Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "n=int(input())\r\nai=input().split()\r\nres=[]\r\nprov=[1]\r\nfor i in range(0,n):\r\n ai[i]=int(ai[i])\r\n prov.append(0)\r\nprov.remove(0)\r\ni=0\r\nif ai[0]!=0 and sum(ai)>=(n-1):\r\n it=True\r\nelse:\r\n it=False\r\nif it:\r\n for j in range(0,n):\r\n if prov[j]==1:\r\n for i in range(0,n):\r\n if prov[i]==0 and ai[i]!=0 and i!=j and ai[j]!=0:\r\n res.append(str(j+1)+' '+str(i+1))\r\n ai[j]-=1\r\n prov[i]=1\r\n if ai[j]==0:\r\n prov[j]=2\r\n for j in range(0,n):\r\n if prov[j]==1:\r\n for i in range(0,n):\r\n if prov[i]==0 and ai[i]==0 and i!=j and ai[j]!=0:\r\n res.append(str(j+1)+' '+str(i+1))\r\n ai[j]-=1\r\n prov[i]=2\r\n if ai[j]==0:\r\n prov[j]=2\r\nif it:\r\n print(len(res))\r\n for i in range(0, len(res)):\r\n V=res[i].split()\r\n print(V[0], V[1])\r\nelse:\r\n print(-1)\r\n", "input()\npower = list(map(int, input().split()))\nn = len(power)\n\nps = [0] + sorted(range(1, n), key=lambda i: -power[i])\n\nout = []\nbonus = [0] * power[0]\ni = 1\nwhile i < n and bonus:\n out.append((bonus.pop(), ps[i]))\n bonus.extend([ps[i]] * max(0, power[ps[i]]))\n i += 1\n\nif i != n:\n print(-1)\nelse:\n print(len(out))\n print(*[\"%s %s\" % (a + 1, b + 1) for a, b in out], sep=\"\\n\")", "n=int(input())\r\nll=list(map(int,input().split()))\r\nif ll[0]<1 or sum(ll)<n-1:\r\n print(-1)\r\nelse:\r\n kk=ll[1:]\r\n t=2\r\n for i in range(n-1):\r\n kk[i]=[t,kk[i]]\r\n t+=1\r\n kk.sort(key=lambda x:x[1],reverse=True)\r\n kk.insert(0,[1,ll[0]])\r\n t,i=1,0\r\n print(n-1)\r\n while t<n and i<n:\r\n x,y=kk[i]\r\n while t<n and y>0:\r\n print(x,kk[t][0])\r\n y-=1\r\n t+=1\r\n i+=1", "import itertools\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na = [(a[0], 1)] + sorted(zip(a[1:], itertools.count(2)), reverse=True)\r\nw = 1\r\nans = [ ]\r\nfor r, cur in enumerate(a):\r\n if r == w:\r\n print(-1)\r\n break\r\n while w != n and cur[0] > 0:\r\n ans.append(\"%s %s\" % (cur[1], a[w][1]))\r\n cur = (cur[0] - 1, cur[1])\r\n w += 1\r\nelse:\r\n print(len(ans))\r\n print('\\n'.join(ans))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif a[0] == 0 or sum(a) < n - 1:\r\n print(-1)\r\nelse:\r\n print(n - 1)\r\n e = list(enumerate(a[1:], start=2))\r\n e.sort(key=lambda x: x[1], reverse=True)\r\n e = [(1, a[0])] + e\r\n k = 1\r\n index = 0\r\n while k != n:\r\n for i in range(min(n-k, e[index][1])):\r\n print(e[index][0], e[k][0])\r\n k += 1\r\n index += 1", "import sys\r\nn = int(input())\r\nB = list(map(int, input().split()))\r\nA = [ [0]*2 for i in range(n)]\r\nfor i in range (n):\r\n A[i][0] = B[i]\r\n A[i][1] = i+1\r\nk = A[0][0]\r\nA[0][0] = 999\r\nA.sort(reverse = True)\r\nA[0][0] = k\r\nF = [0]*n\r\nF[0] = 1\r\nC = [ [0]*2 for i in range(n-1)]\r\ns = -1\r\nfor i in range(n):\r\n k = i + 1\r\n while (A[i][0] > 0) and (k < n):\r\n if F[k] == 0:\r\n s += 1\r\n C[s][0], C[s][1] = A[i][1], A[k][1]\r\n F[k] = 1\r\n A[i][0] -= 1\r\n k += 1\r\nfor x in F:\r\n if x == 0:\r\n print(-1)\r\n sys.exit()\r\nprint(n-1)\r\nfor i in range(n-1):\r\n print(C[i][0], C[i][1])\r\n", "from sys import *\n\nn = int(input())\na = list(map(int, input().strip().split()))\npolycarp = a[0]\nrest = [(a[i], i + 1) for i in range(1, len(a))]\nrest.sort(reverse=True)\n\nhead = 0\ntail = polycarp\nmessages = []\nfor i in range(min(polycarp, len(rest))):\n last = rest[i]\n messages.append((1, last[1]))\n \n#stderr.write(\"len(rest) = \" + str(len(rest)) + '\\n')\nwhile (head < tail) and (tail < len(rest)):\n cur = rest[head]\n for i in range(cur[0]):\n# stderr.write(str(tail) + '\\n')\n last = rest[tail]\n messages.append((cur[1], last[1]))\n tail += 1\n if (tail >= len(rest)):\n break\n head += 1\n \nif (tail < len(rest)):\n print(-1)\nelse:\n print(len(messages))\n for message in messages:\n print(message[0], message[1])\n\n\n", "from collections import namedtuple\r\nimport operator\r\n\r\nn = int(input())\r\nt = 0\r\ndef f(x):\r\n global t\r\n t += 1\r\n return [int(x),t]\r\n\r\nnums = list(map(f, input().split(' ')))\r\nnums[1:] = sorted(nums[1:], key = operator.itemgetter(0), reverse = True)\r\n\r\nreceived = [False] * len(nums)\r\nreceived[0] = True\r\nans = []\r\nfor i,x in enumerate(nums):\r\n if (received[i]):\r\n for j in range(i+1,len(nums)):\r\n if (x[0] > 0 and not(received[j])):\r\n received[j] = True\r\n x[0] -= 1\r\n ans.append((x[1],nums[j][1]))\r\nif (not(received[-1])):\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n [print(x[0],x[1]) for x in ans]\r\n", "def multiple_max(lst, count):\r\n result = []\r\n\r\n for k in range(count):\r\n max = -1\r\n max_i = 0\r\n for i in range(len(lst)):\r\n if i not in result and not is_notified[i]:\r\n if lst[i] > max:\r\n max = lst[i]\r\n max_i = i\r\n if max != -1:\r\n result.append(max_i)\r\n\r\n return result\r\n\r\n\r\nn = input()\r\nmessage_counts = [int(x) for x in input().split(\" \")]\r\nis_notified = [False for x in range(len(message_counts))]\r\nis_notified[0] = True\r\nchat = []\r\n\r\n\r\ndef say(idx):\r\n indices_to_say = multiple_max(message_counts, message_counts[idx])\r\n if len(indices_to_say) is 0:\r\n return\r\n\r\n for idx_to_notify in indices_to_say:\r\n is_notified[idx_to_notify] = True\r\n\r\n for next_idx in indices_to_say:\r\n message_counts[idx] -= 1\r\n chat.append(str(idx + 1) + \" \" + str(next_idx + 1))\r\n say(next_idx)\r\n\r\n\r\nsay(0)\r\n\r\nresult = True\r\nfor x in is_notified:\r\n if not x:\r\n result = False\r\n break\r\n\r\nif result:\r\n print(len(chat))\r\n for message in chat:\r\n print(message)\r\nelse:\r\n print(-1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nif sum(a)<n-1 or a[0]==0:\r\n print(-1)\r\nelse:\r\n a=[(a[i],i+1) for i in range(n)]\r\n p=a[0]\r\n a.pop(0)\r\n a.sort(reverse=True)\r\n a.insert(0,p)\r\n ans=[]\r\n ck=1\r\n for i in range(n):\r\n for j in range(a[i][0]):\r\n if ck>=n:\r\n break\r\n ans.append((a[i][1],a[ck][1]))\r\n ck+=1\r\n print(len(ans))\r\n for i,j in ans:\r\n print(i,j)", "def send(id):\r\n while a[id] > 0:\r\n if len(g) < n:\r\n li = a.copy()\r\n li[id] = -1\r\n while True:\r\n k = li.index(max(li))\r\n if k + 1 in g:\r\n li[k] = -1\r\n else:\r\n break\r\n g.append(k + 1)\r\n actions.append('{} {}'.format(id + 1, g[-1]))\r\n send(k)\r\n a[id] -= 1\r\n else:\r\n break\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nactions = []\r\ng = [1]\r\nsend(0)\r\nif len(g) < n:\r\n print(-1)\r\nelse:\r\n print(len(actions))\r\n for line in actions:\r\n print(line)\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n arr = [int(x) for x in input().split()]\r\n\r\n users = []\r\n invited_users = []\r\n messages_count = 0\r\n output = ''\r\n for i in range(len(arr)):\r\n users.append([i, arr[i]])\r\n\r\n sender = users[0]\r\n users = users[1:]\r\n users.sort(key=lambda row: row[1])\r\n\r\n while messages_count != n - 1 and len(users) > 0:\r\n invites_count = sender[1]\r\n person = sender[0]\r\n if invites_count == 0:\r\n break\r\n while invites_count != 0:\r\n invited_user = users[len(users) - 1]\r\n invited_users.append(invited_user)\r\n users = users[:-1]\r\n output += str(person + 1) + ' ' + str(invited_user[0] + 1) + '\\n'\r\n invites_count -= 1\r\n messages_count += 1\r\n if messages_count == n - 1:\r\n break\r\n\r\n if len(invited_users) > 0:\r\n sender = invited_users[0]\r\n invited_users = invited_users[1:]\r\n\r\n if messages_count < n - 1:\r\n print(-1)\r\n else:\r\n print(messages_count)\r\n print(output)", "n = int(input())\r\narr= [int(x) for x in input().split()]\r\nif arr[0] == 0 or sum(arr)<n-1:\r\n print(-1)\r\n exit()\r\nlis=[]\r\nz = []\r\nfor i in range(n):\r\n if arr[i] != 0:\r\n lis.append([arr[i], i+1])\r\n else:\r\n z.append([arr[i], i +1]) \r\nfor t in z:\r\n lis.append(t)\r\nitem = lis[0][0]\r\ni = 0\r\nj = 1\r\ncount = 0\r\nprint(n-1)\r\nwhile(count != n-1):\r\n print(lis[i][1], lis[j][1])\r\n j += 1\r\n count += 1\r\n lis[i][0] -= 1\r\n if lis[i][0] == 0:\r\n i += 1\r\n\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nk=[0]*n\r\nk[0]=1\r\nm=[1,1]\r\nans=chk=0\r\nif l[0]==0 or sum(l)+1<n:\r\n print(-1)\r\n exit()\r\nprint(n-1)\r\nfor a,i in enumerate(l):\r\n t=i\r\n if all(k): break\r\n for x in range(m[0],n):\r\n if t==0: break\r\n if l[x]>0 and k[x]==0:\r\n k[x]=1\r\n m[0]=x\r\n t-=1\r\n print(a+1, x+1)\r\n if t==0: continue\r\n for x in range(m[1],n):\r\n if t==0: break\r\n if k[x]==0:\r\n k[x]=1\r\n m[1]=x\r\n t-=1\r\n print(a+1, x+1)\r\n", "import sys\nfrom collections import deque\n\n\ndef impossible():\n print(-1)\n sys.exit()\n\n\nn = int(input())\na = list(map(int, input().split()))\n\nif not a[0] or sum(a) < n - 1:\n impossible()\n\nd = deque()\nd.append((-1, a[0]))\n\na = sorted(enumerate(a[1:]), key=lambda x: -x[1])\nidx = 0\n\nprint(n - 1)\nwhile idx < n - 1:\n x, cnt = d.popleft()\n \n for i in range(idx, min(idx + cnt, n - 1)):\n print(x + 2, a[i][0] + 2)\n d.append(a[i])\n idx = min(idx + cnt, n - 1)\n", "a=int(input())\r\nb=[]\r\nb=input().split(' ')\r\nk=int()\r\np=[0 for i in range (a)]\r\np[0]=1\r\nfor i in range (a):\r\n k=k+int(b[i])\r\nif int(b[0])==0 or k<(a-1):\r\n print(-1)\r\nelse:\r\n print(a-1)\r\n for i in range(a):\r\n for f in range (a):\r\n if int(b[i])!=0 and int(b[f])!=0 and p[f]==0:\r\n p[f]=1\r\n b[i]=int(b[i])-1\r\n print(i+1,' ',f+1)\r\n for i in range (a):\r\n for f in range (a):\r\n if int(b[i])!=0 and int(b[f])==0 and p[f]==0:\r\n p[f]=1\r\n b[i]=int(b[i])-1\r\n print(i+1,' ',f+1)", "def dfs(v):\r\n was[v] = 1\r\n cnt = 0\r\n for i in range(v + 1, n):\r\n if cnt >= a[v][0]:\r\n break\r\n if not was[i]:\r\n cnt += 1\r\n ans.append((a[v][1], a[i][1]))\r\n dfs(i)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na = [(a[i], i + 1) for i in range(n)]\r\na = [a[0]] + sorted(a[1:])[::-1]\r\nans = []\r\nwas = [0] * n\r\ndfs(0)\r\nif was.count(0):\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n [print(*i) for i in ans]", "n=int(input())\r\na=list(map(int,input().split()))\r\norder=[]\r\npairs=[]\r\nl=a[1:]\r\nfor i in range(len(l)):\r\n order.append([l[i],i+2])\r\norder.sort(reverse=True)\r\norder.insert(0,[a[0],1])\r\nrm=[False]*n\r\n#print(order)\r\nfor i in range(len(order)):\r\n cnt=order[i][0]\r\n j=i+1\r\n if cnt>0:\r\n rm[i]=True\r\n while cnt>0 and j<n:\r\n if rm[j]==True:\r\n cnt+=1\r\n elif rm[j]!=True:\r\n pairs.append((order[i][1],order[j][1]))\r\n rm[j]=True\r\n j+=1\r\n cnt-=1\r\nif False in rm:\r\n print(-1)\r\nelse:\r\n print(len(pairs))\r\n for i in pairs:\r\n print(*i)\r\n \r\n \r\n ", "def run():\n input()\n a = list(enumerate(list(map(int, input().split()))))\n a = [a[0]] + sorted(a[1:], key=lambda k: k[1], reverse=True)\n head, tail, ans = 0, 1, []\n while head < tail < len(a):\n if a[head][1] > 0:\n ans.append((a[head][0], a[tail][0]))\n a[head] = (a[head][0], a[head][1] - 1)\n tail += 1\n else:\n head += 1\n if tail == len(a):\n print(len(ans))\n for x, y in ans:\n print(x + 1, y + 1)\n else:\n print(-1)\n\nif __name__ == '__main__':\n run()\n\n", "n = int(input())\narr = [int(x) for x in input().split()]\n\nusers = []\ninvs = []\nm_cnt = 0\noutput = ''\nfor i in range(len(arr)):\n users.append([i, arr[i]])\n\nsender = users[0]\nusers = users[1:]\nusers.sort(key=lambda row: row[1])\n\nwhile m_cnt != n - 1 and len(users) > 0:\n inv_c = sender[1]\n person = sender[0]\n if inv_c == 0:\n break\n while inv_c != 0:\n inv_user = users[len(users) - 1]\n invs.append(inv_user)\n users = users[:-1]\n output += str(person + 1) + ' ' + str(inv_user[0] + 1) + '\\n'\n inv_c -= 1\n m_cnt += 1\n if m_cnt == n - 1:\n break\n\n if len(invs) > 0:\n sender = invs[0]\n invs = invs[1:]\n\nif m_cnt < n - 1:\n print(-1)\n exit()\n\nprint(m_cnt)\nprint(output)\n\t\t\t \t\t\t \t\t\t \t \t\t \t\t\t \t \t\t", "n = int(input())\nA = list(map(int, input().split()))\nfor i in range(n):\n A[i] = (A[i], i)\nA = [A[0]] + sorted(A[1:], reverse = True)\nB = [0] * n\nB[0] = 1\nS = []\nx = 0\ny = 1\nwhile (x < n and A[x][0] != 0):\n for i in range(A[x][0]):\n if (y < n):\n B[y] = 1\n S.append((A[x][1], A[y][1]))\n y += 1\n x += 1\nif (y != n):\n print(-1)\nelse:\n print(len(S))\n for i in S:\n print(i[0] + 1, i[1] + 1)", "n = int(input())\r\nmessages_per_student = [int(num) for num in input().split(' ')]\r\n\r\nstudents = [False] * n\r\nstudents[0] = True\r\nmsgs_sent = 0\r\n\r\n\r\nsorted_students = sorted(\r\n enumerate(messages_per_student),\r\n key=lambda s: s[1], reverse=True\r\n)\r\n\r\n\r\ndef find_optimal_recipient(sender):\r\n for i, _ in sorted_students:\r\n if not students[i] and i != sender:\r\n return i\r\n raise ValueError\r\n\r\n\r\nsends_log = []\r\nsenders = [(0, messages_per_student[0])]\r\nfor sender, count in senders:\r\n while count > 0 and msgs_sent < n:\r\n try:\r\n recipient = find_optimal_recipient(sender)\r\n sends_log.append((sender, recipient))\r\n students[recipient] = True\r\n senders.append((recipient, messages_per_student[recipient]))\r\n count -= 1\r\n msgs_sent += 1\r\n except ValueError:\r\n break\r\n\r\nif msgs_sent == n - 1:\r\n print(msgs_sent)\r\n [print(msg[0] + 1, msg[1] + 1) for msg in sends_log]\r\nelse:\r\n print(-1)\r\n", "def main():\r\n\tn = int(input())\r\n\tlst2 = input().split()\r\n\tlst = [[i + 1, int(lst2[i])] for i in range(n)]\r\n\ta = lst[0]\r\n\tb = lst[1:]\r\n\tb.sort(key=lambda x: x[1], reverse=True)\r\n\tlst = [a] + b\r\n\tstr_b = str(n - 1) + \"\\n\"\r\n\tif lst[0][1] == 0:\r\n\t\treturn \"-1\"\r\n\tcounter = 1\r\n\tfor ind in range(n):\r\n\t\tif counter == n:\r\n\t\t\treturn str_b.strip()\r\n\t\twhile lst[ind][1] > 0 and len(lst) > counter:\r\n\t\t\tstr_b += str(lst[ind][0]) + \" \" + str(lst[counter][0]) + '\\n'\r\n\t\t\tlst[ind][1] -= 1\r\n\t\t\tcounter += 1\r\n\tif counter < n:\r\n\t\treturn \"-1\"\r\n\telse:\r\n\t\treturn str_b.strip()\r\nprint(main())\r\n", "import sys\r\nrln=sys.stdin.buffer.readline\r\nrl=lambda:rln().rstrip(b'\\r\\n').rstrip(b'\\n')\r\nri=lambda:int(rln())\r\nrif=lambda:[*map(int,rln().split())]\r\nrt=lambda:rl().decode()\r\nrtf=lambda:rln().decode().split()\r\ninf=float('inf')\r\ndir4=[(-1,0),(0,1),(1,0),(0,-1)]\r\ndir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\nYES,NO,Yes,No,yes,no='YES','NO','Yes','No','yes','no'\r\n\r\nn=ri()\r\ns,*a=rif()\r\na=[[a[i],i+1] for i in range(n-1)]\r\na.sort(reverse=1)\r\nq=[[s,0]]\r\nans=[]\r\ni=j=0\r\nwhile i<len(q) and j<len(a):\r\n if q[i][0]==0:\r\n i+=1\r\n continue\r\n q[i][0]-=1\r\n q.append(a[j])\r\n ans.append((q[i][1],a[j][1]))\r\n j+=1\r\nif j<len(a):\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n for x,y in ans:\r\n print(x+1,y+1)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nen_a = list(enumerate(a))\nl = [en_a[0]] + sorted(en_a[1:], key=lambda x:-x[1])\n\nres = []\ns = 0\nr = 1\ncorrect = True\nk = l[s][1]\nif k == 0:\n correct = False\n\nwhile correct and r < n:\n while k > 0 and r < n:\n res.append([l[s][0] + 1, l[r][0] + 1])\n r += 1\n k -= 1\n s += 1\n k = l[s][1]\n if k == 0 and r < n:\n correct = False\n break\n\nif correct:\n print(len(res))\n for res_i in res:\n print(*res_i)\nelse:\n print(-1)\n", "n= int(input())\r\nA = list(map(int,input().split()))\r\nif(A[0] == 0 or sum(A)<n-1):\r\n print(-1)\r\nelse:\r\n print(n-1)\r\n start = 1\r\n for j in range(n):\r\n A[j] = [A[j],j]\r\n \r\n A = [A[0]] + (sorted(A[1:]))[::-1]\r\n for j in range(n):\r\n while A[j][0] != 0:\r\n if start == n:\r\n break \r\n print(A[j][1] + 1, A[start][1] + 1)\r\n A[j][0] -=1\r\n start+=1\r\n if start == n:\r\n break", "import sys\n\ndata = sys.stdin.read().split()\ndata_ptr = 0\n\ndef data_next():\n global data_ptr, data\n data_ptr += 1\n return data[data_ptr - 1]\n\nN = int(data_next())\narr = list(zip(map(int, data[2:]), range(2, N + 1)))\narr.sort()\narr.append((int(data[1]), 1))\narr.reverse()\n\nj = 1\ngood = True\nans = []\nfor i in range(0, N):\n if j > i:\n for k in range(arr[i][0]):\n if j >= N:\n break\n ans.append((arr[i][1], arr[j][1]))\n j += 1\n else:\n good = False\n break\n\nif good:\n print(len(ans))\n for x in ans:\n print(x[0], x[1])\nelse:\n print(-1)\n\n", "n = int(input())\r\narr = [[i,int(c)] for i, c in enumerate(input().strip().split(' '))]\r\np = arr[0]\r\narr = arr[1:]\r\narr.sort(key=lambda i: i[1], reverse=True)\r\ncount = p[1]\r\ni = 0\r\ncheck = True\r\nwhile i < len(arr):\r\n if count == 0:\r\n print(-1)\r\n check = False\r\n break\r\n count += arr[i][1]\r\n count -= 1\r\n i += 1\r\nif check:\r\n ar = []\r\n count = 0\r\n cur = p\r\n stock, stock_n = [], 0\r\n i = 0\r\n while i < len(arr):\r\n ar.append([cur[0]+1, arr[i][0]+1])\r\n count += 1\r\n stock.append(arr[i])\r\n cur[1] -= 1\r\n if cur[1] == 0:\r\n cur = stock[stock_n]\r\n stock_n += 1\r\n i += 1\r\n print(count)\r\n for i in ar:\r\n print(i[0], i[1])", "n=int(input())\r\nrdl = list(map(int, input().split()))\r\nif rdl[0]==0:\r\n print(-1)\r\nelse:\r\n summ=0\r\n for i in range(len(rdl)):\r\n summ=summ+rdl[i]\r\n if summ<n-1:\r\n print(-1)\r\n else:\r\n b=[]\r\n for i in range(n-1):\r\n b.append([0]*2)\r\n b[i][0]=rdl[i+1]\r\n b[i][1]=i+2\r\n b.sort()\r\n b.reverse()\r\n b.insert(0,[rdl[0],1])\r\n k=0\r\n j=0\r\n print(n-1)\r\n l=j+1\r\n while k!=n-1:\r\n while b[j][0]>0 and k!=n-1:\r\n print(b[j][1],b[l][1])\r\n b[j][0]-=1\r\n l+=1\r\n k+=1\r\n j+=1\r\n\r\n \r\n", "n = int(input())\r\nA = list(map(int, input().split(' ')))\r\nA = {i: A[i] for i in range(n)}\r\nvis = [False for _ in range(n)]\r\nvis[0] = True\r\nop = [0]\r\nprev = [-1 for _ in range(n)]\r\nmessages = list()\r\nwhile len(op) > 0:\r\n nxt = op[-1]\r\n del op[-1]\r\n cnt = A[nxt]\r\n targets = [(A[i], i) for i in A if i != nxt and not vis[i]]\r\n targets.sort(reverse=True)\r\n targets = targets[:cnt]\r\n for _, to in targets:\r\n messages.append((nxt+1, to+1))\r\n prev[to] = nxt\r\n vis[to] = True\r\n op.append(to)\r\nfor el in vis:\r\n if not el:\r\n print(-1)\r\n break\r\nelse:\r\n print(n-1)\r\n for f, t in messages:\r\n print('{} {}'.format(f, t))", "n = int(input())\r\na = list(map(int,input().split()))\r\nobs=[]\r\nindo=[]\r\nneo=[]\r\nindn=[]\r\nres=[]\r\nkol=[]\r\nif a[0]==0:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if a[i]>0:\r\n obs.append(a[i])\r\n indo.append(i)\r\n else:\r\n neo.append(0)\r\n indn.append(i)\r\n curr=0\r\n nuli=0\r\n for j in range(len(obs)): \r\n for k in range(obs[j]):\r\n if(curr+nuli)<(len(a)-1):\r\n res.append(indo[j]+1)\r\n if curr<(len(obs)-1):\r\n curr+=1\r\n res.append(indo[curr]+1) \r\n else:\r\n res.append(indn[nuli]+1)\r\n nuli+=1\r\n if (curr+nuli)==(len(a)-1):\r\n print(len(res)//2)\r\n for h in range(0,len(res),2):\r\n print(res[h], end = \" \")\r\n print(res[h+1])\r\n else:\r\n print(-1)\r\n \r\n", "n = int(input())\r\na = input().split()\r\ns=0\r\nfor i in range(n):\r\n a[i]=[int(a[i]), i+1]\r\n s+=a[i][0]\r\n\r\nch=a.pop(0)\r\na.sort(reverse=True)\r\na.insert(0,ch)\r\n\r\nif a[0][0]==0 or s<n-1:\r\n print(-1)\r\nelse:\r\n print(n-1)\r\n i,j=0,0\r\n while i<n-1:\r\n while a[j][0]>0 and i<n-1:\r\n print(a[j][1],a[i+1][1],sep=' ')\r\n i+=1\r\n a[j][0]-=1\r\n j+=1\r\n\r\n \r\n\r\n", "n = int(input())\r\ncounts = list(map(int, input().split()))\r\nai = [-1] * n\r\n\r\nif counts[0] > 0 and sum(counts) >= n - 1:\r\n print(n - 1)\r\n k = sum(counts) - n + 1\r\n ai[0] = counts[0]\r\n counts[0] = -1\r\n boolean = True\r\n while min(ai) == -1:\r\n j = 0\r\n boolean = False\r\n for j in range(n):\r\n while ai[j] > 0 and min(ai) == -1:\r\n i = counts.index(max(counts))\r\n ai[j] -= 1\r\n ai[i] = counts[i]\r\n counts[i] = -1\r\n print(j + 1, i + 1)\r\n\r\nelse:\r\n print(-1)", "n = int(input())\r\nk = list(map(int, input().split()))\r\n\r\nif (k[0] == 0) or (sum(k) < (n-1)):\r\n print(-1)\r\nelse:\r\n print(n-1)\r\n l = [i+1 for i in range(n) if k[i] != 0]\r\n k1 = [i for i in k if i != 0]\r\n ind = [i-1 for i in l]\r\n m = [i+1 for i in range(n) if k[i] == 0]\r\n\r\n for j in range(len(l)-1):\r\n print(l[j], l[j+1])\r\n k1[j]-=1\r\n \r\n count = 0\r\n c = 0\r\n q = k1[0]\r\n \r\n while count < len(m):\r\n count+=1\r\n if q == 0:\r\n while q == 0:\r\n c +=1\r\n q = k1[c] \r\n print(ind[c]+1, m[count-1])\r\n q-=1\r\n", "def f(bl = False):\r\n global a, b, n, i, t\r\n for e in range(n):\r\n if e == t:\r\n continue\r\n if not b[e] and (a[e] != 0 if not bl else True):\r\n print(t + 1, e + 1)\r\n b[e] = True\r\n i -= 1\r\n if i == 0 or False not in b:\r\n break\r\n\r\nn = int(input())\r\ns = input()\r\na = list(map(int, s.split(' ')))\r\nb = [False] * n\r\nb[0] = True\r\nif a[0] == 0 or sum(a) < n - 1:\r\n print(-1)\r\nelse:\r\n print(n - 1)\r\n for t in range(n):\r\n if not b[t] or a[t] == 0:\r\n continue\r\n i = a[t]\r\n f()\r\n if i != 0 and False in b:\r\n f(True)\r\n if False not in b:\r\n break", "from collections import deque\nN = int(input())\nstudents = [(i, int(el)) for i, el in enumerate(input().strip().split())] # студенты в виде (индекс студента, кол-во сообщений)\n\nres = []\nq = deque() # создали очередь\nq.append(students[0]) # кладем в очередь поликарпа\nstudents = [students[0]] + sorted(students[1:], key=lambda x: -x[1])\nn = 0\nwhile q:\n ind, messages = q.popleft()\n while messages > 0:\n n += 1\n if n < N:\n res.append((ind+1, students[n][0] + 1))\n q.append(students[n])\n messages -= 1\nif len(res) == N-1:\n print(len(res))\n for el in res:\n print(el[0], el[1])\nelse:\n print(-1)\n", "def main():\r\n\tn = int(input())\r\n\tarr = list(map(int, input().split()))\r\n\tsum_know = 1\r\n\tcur_outcome = arr[0]\r\n\r\n\tcur_st = [(arr[0], 0)]\r\n\r\n\tarr = arr[1:]\r\n\tarr = [(arr[i], i + 1) for i in range(n - 1)]\r\n\tarr.sort()\r\n\tarr = arr[::-1]\r\n\r\n\tpt = 0\r\n\tans = []\r\n\twhile (pt < n - 1 and len(cur_st) > 0):\r\n\t\tnew_s = []\r\n\t\tfor i in cur_st:\r\n\t\t\tx = 0\r\n\t\t\tnum = min(n - 1, pt + i[0])\r\n\t\t\tfor x in range(pt, num):\r\n\t\t\t\t# print(x)\r\n\t\t\t\tpt += 1\r\n\t\t\t\tsum_know += 1\r\n\t\t\t\tnew_s.append(arr[x])\r\n\t\t\t\tans.append((i[1] + 1, arr[x][1] + 1))\r\n\t\tcur_st = new_s\r\n\tif (sum_know >= n):\r\n\t\tprint(len(ans))\r\n\t\tfor j in ans:\r\n\t\t\tprint(*j)\r\n\telse:\r\n\t\tprint(-1)\r\n\r\n\t\r\nmain()", "n = int(input())\r\nline = list(map(int, input().split()))\r\nperson = []\r\nfor i in range(1, n):\r\n person.append([line[i], i])\r\nperson.sort(reverse=True)\r\nperson = [[line[0], 0]] + person\r\nsend = 0\r\nrecv = 1\r\nif line[0] == 0 or sum(line) < n - 1:\r\n print(-1)\r\nelse:\r\n answer = []\r\n while recv != n:\r\n answer.append([person[send][1] + 1, person[recv][1] + 1])\r\n recv += 1\r\n person[send][0] -= 1\r\n if person[send][0] == 0:\r\n send += 1\r\n print(len(answer))\r\n for elem in answer:\r\n print(*elem)", "n = int(input())\r\nmes = [[int(m), idx] for idx, m in enumerate(input().split(), 1)]\r\nif sum(m[0] for m in mes) < n - 1 or not mes[0][0]:\r\n\tprint(-1)\r\n\texit(0)\r\n\r\nmes = [mes[0]] + sorted(mes[1:], reverse=True)\r\n\r\ncur = 0\r\nprint(n - 1)\r\nfor i in range(1, n):\r\n\twhile not mes[cur][0]:\r\n\t\tcur += 1\r\n\tprint(mes[cur][1], mes[i][1])\r\n\tmes[cur][0] -= 1\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\na = w[0]\r\nif a == 0 or sum(w) < n-1:\r\n print(-1)\r\nelse:\r\n s = sorted(enumerate(w[1:]), key=lambda x:x[1], reverse=True)\r\n s = [(-1, a)] + s\r\n d = []\r\n c = 1\r\n\r\n for i in range(n):\r\n x = s[i][1]\r\n while x:\r\n d.append((s[i][0]+2, s[c][0]+2))\r\n c += 1\r\n x -= 1\r\n if c == n:\r\n break\r\n if c == n:\r\n break\r\n print(len(d))\r\n for i in d:\r\n print(*i)\r\n", "a=int(input());b=list(map(int,input().split()))\r\nif b[0]==0 or sum(b)<a-1:exit(print(-1))\r\nc=sorted([[j,i+1] for i,j in enumerate(b)],reverse=True)\r\nfor i in range(a):\r\n if c[i][1]==1:c=[c.pop(i)]+c;break\r\ni=0;j=1;print(a-1)\r\nwhile(j<a):\r\n print(c[i][1],c[j][1]);j+=1;c[i][0]-=1\r\n if c[i][0]==0:i+=1", "from sys import stdin,stdout,maxsize;# mod = int(1e9 + 7);#import re # can use multiple splits\r\ntup = lambda: map(int, stdin.readline().split())\r\nI = lambda: int(stdin.readline())\r\nlint = lambda: [int(x) for x in stdin.readline().split()]\r\n#S = lambda: stdin.readline().replace('\\n', '').strip()\r\n#def grid(r, c): return [lint() for i in range(r)]\r\n#def debug(*args, c=6): print('\\033[3{}m'.format(c), *args, '\\033[0m', file=stderr)\r\nstpr = lambda x : stdout.write(f'{x}' + '\\n')\r\nstar = lambda x : print(' '.join(map(str , x)))\r\nn = I()\r\nls = lint()\r\nif ls[0] ==0 or sum(ls) <n-1:print(-1) ; exit()\r\narr = [[ls[0], 1]] + sorted([[ls[i] , i+1] for i in range(1,n)],reverse=True)\r\nprint(n-1)\r\ni , j = 0, 1\r\nwhile i < n and j < n:\r\n if arr[i][0] > 0:\r\n arr[i][0]-=1\r\n print(arr[i][1] , arr[j][1])\r\n j+=1\r\n else:\r\n i+=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", "n = int(input())\r\ncall = list(map(int, input().split()))\r\ncp = []\r\nans = []\r\nfor i in range(1, n):\r\n x = call[i]\r\n cp.append([x, i + 1])\r\ncp.sort(reverse=True)\r\nl = [[call[0], 1]]\r\nj = 0\r\nwhile len(cp) > 0 and len(l) > 0 and j < len(cp):\r\n s = l[0]\r\n x = s[0]\r\n p = s[1]\r\n for i in range(j, min(j + x, len(cp))):\r\n ans.append([str(p), str(cp[i][1])])\r\n l.append(cp[i])\r\n j = min(j + x, len(cp))\r\n l.remove(l[0])\r\nif j < len(cp):\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n for i in range(len(ans)):\r\n print(' '.join(ans[i]))", "def main():\r\n\tn = int(input())\r\n\tn_a = []\r\n\tinp_str = input().split(' ')\r\n\tsum_of_a = 0\r\n\tfor i in range(1, len(inp_str)+1):\r\n\t\tsum_of_a+=int(inp_str[i-1])\r\n\t\tn_a.append([i, int(inp_str[i-1])])\r\n\r\n\tfirst_elem = n_a.pop(0)\r\n\tn_a.sort(key = lambda x: x[1], reverse = True)\r\n\tn_a.insert(0, first_elem)\r\n\r\n\tif n_a[0][1] == 0: return -1\r\n\tif sum_of_a < n-1: return -1\r\n\r\n\tstack, current_n, stack_n, flag, out_pairs = [], 0, 0, False, []\r\n\r\n\twhile True:\r\n\t\tif n_a[current_n][0] == 1:\r\n\t\t\tstack.append(n_a[current_n])\r\n\t\t\tcurrent_n = n_a[current_n][0]\r\n\t\t\tcontinue\r\n\r\n\t\tstack_n = stack[0][0]\r\n\t\tcurrent_a = current_n + stack[0][1]\r\n\t\tstack.pop(0)\r\n\r\n\t\tif current_a >= len(n_a):\r\n\t\t\tcurrent_a = len(n_a)\r\n\t\t\tflag = True\r\n\r\n\t\tfor n_tmp in range(current_n, current_a):\r\n\t\t\tout_pairs.append([stack_n, n_a[n_tmp][0]])\r\n\r\n\t\t\tif n_a[n_tmp][1] != 0: stack.append(n_a[n_tmp])\r\n\r\n\t\tcurrent_n = current_a\r\n\r\n\t\tif flag == True: break\r\n\r\n\treturn out_pairs\r\n\r\nres = main()\r\n\r\nif res == -1: print('-1')\r\nelse:\r\n\tprint(len(res))\r\n\tfor elem in res:\r\n\t\tprint(str(elem[0])+' '+str(elem[1]))", "from collections import deque\n\nn, a = int(input()), list(map(int, input().split()))\na_sorted = sorted([a[i], i + 1] for i in range(1, n))\nmessages = []\nqueue = deque([[a[0], 1]])\nwhile a_sorted and queue:\n cur = queue.popleft()\n while cur[0] and a_sorted:\n recipient = a_sorted.pop()\n messages.append((cur[1], recipient[1]))\n queue.append(recipient)\n cur[0] -= 1\nif a_sorted:\n print(-1)\nelse:\n print(len(messages))\n for message in messages:\n print(*message)\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nB = arr[1:n]\r\nС = [arr[0],]\r\n\r\nif arr[0] == 0 or sum(arr) < n - 1:\r\n\tprint(-1)\r\n\t\r\nelse:\r\n\tfor idx in range(n):\r\n\t\tarr[idx] = (arr[idx], idx)\r\n\t\t\r\n\tarr = [arr[0]] + sorted(arr[1:], reverse=True)\r\n\t\r\n\tres = [0] * n\r\n\tres[0] = 1\r\n\t\r\n\tans = []\r\n\t\r\n\tl = 0\r\n\tr = 1\r\n\t\r\n\twhile l < n and arr[l][0] != 0:\r\n\t\tfor index in range(arr[l][0]):\r\n\t\t\tif (r < n):\r\n\t\t\t\tres[r] = 1\r\n\t\t\t\t\r\n\t\t\t\tans.append((arr[l][1], arr[r][1]))\r\n\t\t\t\tr += 1\r\n\t\tl += 1\r\n\t\t\r\n\tprint(len(ans))\r\n\r\n\tfor i in ans:\r\n\t\tprint(i[0] + 1, i[1] + 1)", "import collections\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ndeq = collections.deque()\r\ndeq.append([a[0], 0])\r\nvisited = [False] * n\r\nvisited[0] = True\r\n\r\ninformed = [False] * n\r\ninformed[0] = True\r\n\r\npairs = []\r\nwhile deq:\r\n informant, order_num = deq.popleft()\r\n if informant != 0:\r\n for ind, num_of_messages in enumerate(a):\r\n if not visited[ind] and num_of_messages != 0:\r\n deq.append([num_of_messages, ind])\r\n visited[ind] = True\r\n informed[ind] = True\r\n informant -= 1\r\n pairs.append([order_num, ind])\r\n if informant == 0:\r\n break\r\n if informant != 0:\r\n for ind, num_of_messages in enumerate(a):\r\n if not visited[ind]:\r\n visited[ind] = True\r\n informed[ind] = True\r\n informant -= 1\r\n pairs.append([order_num, ind])\r\n if informant == 0:\r\n break\r\n # print(informed)\r\n if all(informed):\r\n break\r\n\r\nif len(pairs) == n - 1:\r\n print(len(pairs))\r\n for pair in pairs:\r\n print(pair[0] + 1, pair[1] + 1)\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "def is_all_notified(students_list):\n\n for val in students_list.values():\n if not val[1]:\n return False\n\n return True\n\n\ndef get_next_to_notify(students_list):\n\n list_of = []\n\n for idx, value in students_list.items():\n list_of.append((value[0], idx, value[1]))\n\n list_of.sort(reverse=True)\n\n for it in list_of:\n if it[2] == False:\n return it[1]\n\n\ndef get_next_notificator(students_list):\n\n for idx, value in students_list.items():\n if value[0] > 0 and value[1] == True:\n return idx\n\n\ndef notify(students_list, sender, receiver):\n\n students_list[sender] = (students_list[sender][0] - 1, students_list[sender][1])\n students_list[receiver] = (students_list[receiver][0], True)\n\n\ndef can_notify(students_list, idx):\n\n return students_list[idx][0] > 0\n\n\ndef solution(students_list):\n\n current = 1\n\n messages = []\n\n # If first cannot send any messages\n if students_list[1][0] == 0:\n return -1\n\n while not is_all_notified(students_list):\n if students_list[current][0] > 0:\n receiver = get_next_to_notify(students_list)\n\n messages.append((current, receiver))\n notify(students_list, current, receiver)\n else:\n current = get_next_notificator(students_list)\n\n if current is None:\n break\n\n if is_all_notified(students_list):\n return messages\n else:\n return -1\n\n\ndef main():\n\n count = int(input())\n limits = input().split(' ')\n\n if count < 2 or count > 100:\n print('-1')\n return\n\n students = {}\n i = 1\n\n for limit in [int(l.strip()) for l in limits]:\n if i == 1:\n students[i] = (limit, True)\n else:\n students[i] = (limit, False)\n\n i += 1\n\n if (i - 1) != count or (i - 1) > 100:\n print('-1')\n return\n\n sol = solution(students)\n\n if sol == -1:\n print('-1')\n else:\n print(len(sol))\n for from_, to in sol:\n print('%s %s' % (from_, to))\n\n\nmain()\n", "from collections import deque\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nia = [(i, a[i]) for i in range(1, n)]\r\nia.sort(key=lambda k: k[1], reverse=True)\r\nflag = [False]*n\r\nflag[0] = True\r\nq = deque([0])\r\nans = []\r\n\r\nwhile q:\r\n f = q.popleft()\r\n cnt = 0\r\n \r\n for t, _ in ia:\r\n if not flag[t]:\r\n if cnt==a[f]:\r\n break\r\n \r\n ans.append((f+1, t+1))\r\n flag[t] = True\r\n q.append(t)\r\n cnt += 1\r\n \r\nif flag==[True]*n:\r\n print(len(ans))\r\n \r\n for f, t in ans:\r\n print(f, t)\r\nelse:\r\n print(-1)", "R= lambda: map(int,input().split())\r\nn= int(input())\r\nl= list(zip(list(R()),range(n)))\r\nq,r,out= [l[0]],sorted(l[1:]),[]\r\nwhile q and r:\r\n a,b=q.pop()\r\n while a and r:\r\n a-=1\r\n out.append([b,r[-1][1]])\r\n q+=[r[-1]]\r\n r.pop()\r\nif len(out)<n-1: print(\"-1\")\r\nelse:\r\n print(len(out))\r\n for a,b in out:\r\n print(a+1,b+1)\r\n", "import collections as col\r\nimport itertools as its\r\nimport operator\r\n\r\n\r\nclass Solver:\r\n def solve(self):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n for i in range(len(a)):\r\n a[i] = [a[i], i + 1]\r\n a[0][0] += 1000\r\n a = sorted(a)[::-1]\r\n a[0][0] -= 1000\r\n ans = []\r\n it = 1\r\n for i in range(len(a)):\r\n if i == it:\r\n print(-1)\r\n return\r\n cnt, st = a[i]\r\n while it != n and cnt > 0:\r\n ans.append((st, a[it][1]))\r\n cnt -= 1\r\n it += 1\r\n print(n - 1)\r\n for p in ans:\r\n print(' '.join(map(str, p)))\r\n\r\n\r\nif __name__ == '__main__':\r\n s = Solver()\r\n s.solve()\r\n", "n = int(input())\r\na = list(enumerate(list(map(int, input().split())), start = 1))\r\na = [a[0]] + sorted(a[1:], key=lambda x: x[1], reverse=True)\r\n#print(a)\r\n\r\nused = [0] * n\r\nused[0] = 1\r\nans = [list() for i in range(n)]\r\ntotal = 0\r\nfor i in range(n):\r\n if not(0 in used):\r\n break\r\n else:\r\n cnt = 0\r\n j = i + 1\r\n if j != n:\r\n while j < n and cnt < a[i][1]:\r\n #print(i, j)\r\n if not used[j]:\r\n used[j] = 1\r\n total += 1\r\n ans[i].append(a[j])\r\n cnt += 1\r\n j += 1\r\nif 0 in used:\r\n print(-1)\r\nelse:\r\n print(total)\r\n for i in range(n):\r\n for j in range(len(ans[i])):\r\n print(a[i][0], ans[i][j][0])" ]

[ "s, n = input(), int(input())\r\nt = [input() for i in range(n)]\r\n\r\ndef f(i):\r\n global t\r\n for j in range(n):\r\n if i < j:\r\n if len(t[j]) < len(t[i]) and t[j] in t[i]: return False\r\n elif j < i and t[j] in t[i]: return False\r\n return True\r\n\r\nt = [t[i] for i in range(n) if f(i)]\r\nn = len(s)\r\nr = [0] * n\r\n\r\nfor p in t:\r\n i, m = -1, len(p) - 1\r\n while True:\r\n i = s.find(p, i + 1)\r\n if i == -1: break\r\n r[i] += 1\r\n r[i + m] += 2\r\n\r\nd, j, q = 0, -1, [-1]\r\n\r\nfor i in range(n):\r\n if r[i] & 1: q.append(i)\r\n if r[i] & 2:\r\n j = q.pop(0)\r\n if i - j > d: d, k = i - j, j\r\n\r\nj = q.pop(0)\r\nif n - j > d: d, k = n - j, j\r\n\r\nprint(d - 1, k + 1)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nd = defaultdict(list)\r\nfor i, j in enumerate(w):\r\n d[j].append(i)\r\ns = sorted([i for i in d])\r\nc = 0\r\nq = n\r\na, b = 0, 0\r\nfor i in s:\r\n x = len(d[i])\r\n d[i].sort()\r\n for j in range(len(d[i])):\r\n if d[i][j] >= a:\r\n x = j\r\n break\r\n if x == 0:\r\n b += len(d[i])\r\n a = d[i][-1]\r\n else:\r\n b += len(d[i]) - x\r\n c += q\r\n q -= b\r\n a = d[i][x-1]\r\n b = x\r\nprint(c + q)", "from collections import deque\nimport heapq\n\nn = int(input())\ncards_help = list(map(int, input().split()))\ncards = [ (cards_help[i],-1*i) for i in range(n) ]\nheapq.heapify(cards)\n\ndraws = 0\nremoved = 0\nwhile cards:\n prev = -1\n new_removals = 0\n current = cards[0]\n while cards and -1*current[1] > prev:\n new_removals += 1\n heapq.heappop(cards)\n temp_prev = -1*current[1]\n while cards and cards[0][0] == current[0] and -1*cards[0][1] > prev:\n current = cards[0]\n heapq.heappop(cards)\n new_removals += 1\n prev = temp_prev\n current = cards[0] if cards else 0\n draws += n - removed\n removed += new_removals\nprint(draws)\n\n\n\n\n# Made By Mostafa_Khaled", "R=lambda:map(int,input().split())\r\nn,=R()\r\na=list(R())\r\nb=list(sorted(zip(a,range(n))))\r\nd=1\r\nc=0\r\ni=-1\r\nl=-1\r\nj=0\r\nwhile(j<n):\r\n q=False\r\n o,p=-1,-1\r\n k=j\r\n while(k<n and b[j][0]==b[k][0]):\r\n if(b[k][1]<l):\r\n o=max(o,b[k][1])\r\n q=True\r\n c+=d+1\r\n else:\r\n c+=d\r\n p=max(p,b[k][1])\r\n k+=1\r\n j=k\r\n if(o>-1):\r\n d+=1\r\n l=o\r\n else:\r\n l=p\r\n\r\n\r\n\r\n \r\n\r\nprint(c)", "n = int(input())\r\ncards = [int(x) for x in input().strip().split()]\r\n\r\ndef calculate_card_views():\r\n indexed_cards = list(enumerate(cards))\r\n \r\n indexed_cards = sorted(indexed_cards, key=lambda x: x[1])\r\n\r\n views = 0\r\n \r\n prev_right = -1\r\n prev_level = -1\r\n cur_level = 1\r\n cur_value = -1\r\n cur_right = -1\r\n\r\n for i, value in indexed_cards:\r\n if value > cur_value:\r\n prev_level = cur_level\r\n prev_right = cur_right\r\n cur_value = value\r\n cur_right = i\r\n \r\n if i < prev_right: cur_level = prev_level + 1\r\n \r\n views += cur_level\r\n else:\r\n if i < prev_right:\r\n views += prev_level + 1\r\n \r\n if cur_level != prev_level + 1:\r\n cur_level = prev_level + 1\r\n cur_right = i\r\n \r\n cur_right = max(cur_right, i)\r\n else:\r\n views += prev_level\r\n \r\n if cur_level == prev_level: cur_right = max(cur_right, i)\r\n return views\r\n\r\nprint(calculate_card_views())# 1698144596.4215071", "def main():\r\n input()\r\n numbers = tuple(map(int, input().split()))\r\n d = []\r\n for i in range(len(numbers)):\r\n while len(d) <= numbers[i]:\r\n d.append([])\r\n d[numbers[i]].append(i)\r\n dd = [[]]\r\n for line in d:\r\n if line:\r\n dd.append(line)\r\n d = dd\r\n answer = [None] * len(numbers)\r\n for item in d[1]:\r\n answer[item] = 1\r\n for i in range(1, len(d) - 1):\r\n left_maxes = [0]\r\n right_maxes = [0]\r\n for j in range(len(d[i])):\r\n left_maxes.append(max(left_maxes[-1], answer[d[i][j]]))\r\n right_maxes.append(max(right_maxes[-1],\r\n answer[d[i][len(d[i]) - j - 1]]))\r\n left_amount = 0\r\n for j in range(len(d[i+1])):\r\n while left_amount < len(d[i]) and d[i][left_amount] < d[i+1][j]:\r\n left_amount += 1\r\n answer[d[i+1][j]] = max(left_maxes[left_amount],\r\n right_maxes[len(d[i]) - left_amount] + 1)\r\n res = 0\r\n for ans in answer:\r\n res += ans\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(100000)\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('YES' if b else 'NO')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn = I()\r\na = II()\r\nif n==1:\r\n p(1)\r\n exit(0)\r\nd = defaultdict(list)\r\nfor i in r(n):\r\n d[a[i]].append(i)\r\ntotal = 0\r\nx = 0\r\nremain = n\r\nrr = sorted(list(d.items()))\r\n#p(rr)\r\nfor i in r(len(rr)):\r\n num, ls = rr[i]\r\n if not ls:\r\n continue\r\n z = ls[-1]\r\n x += len(ls)\r\n ii = i\r\n ls.clear()\r\n while ii+1 < len(rr) and z < rr[ii+1][1][0]:\r\n x += len(rr[ii+1][1])\r\n z = rr[ii+1][1][-1]\r\n rr[ii+1][1].clear()\r\n ii += 1\r\n #p(z)\r\n if ii+1 < len(rr) and rr[ii+1][1]:\r\n index = bisect.bisect_left(rr[ii+1][1], z)\r\n x += len(rr[ii+1][1]) - index\r\n while len(rr[ii+1][1]) > index:\r\n rr[ii+1][1].pop()\r\n total += remain\r\n remain = n - x\r\n #p(rr)\r\n\r\ntotal += remain\r\np(total)" ]

[ "def get(n):\r\n if n==\"M\" or n==\"F\":\r\n return n\r\n else:\r\n return int(n)\r\n\r\nn = int(input())\r\nmylist=[[0]*367,[0]*367]\r\nfor i in range(n):\r\n g,a,b = map(get,input().split())\r\n if g=='M':\r\n index=0\r\n else:\r\n index=1\r\n for i in range(a,b+1):\r\n mylist[index][i]+=1\r\nmylist = list(map(list,zip(*mylist)))\r\nmylist.sort(key=lambda x:min(x[0],x[1]),reverse=True)\r\nprint(min(mylist[0][0],mylist[0][1])*2)", "n=int(input())\r\nM=[0 for i in range(366)]\r\nF=[0 for i in range(366)]\r\nwhile n>0:\r\n n-=1\r\n G,a,b=input().split()\r\n if G=='M':\r\n for i in range(int(a)-1,int(b)):\r\n M[i]+=1\r\n else:\r\n for i in range(int(a)-1,int(b)):\r\n F[i]+=1\r\nmx=0\r\nfor i in range(366):\r\n mx=max(mx,min(M[i],F[i]))\r\nprint(mx*2)", "\r\nn=int(input())\r\nm=[0]*366\r\nf=[0]*366\r\nfor i in range(n):\r\n g,a,b=input().split()\r\n a,b=int(a),int(b)\r\n if g=='F':\r\n for i in range(a-1,b):\r\n f[i]+=1\r\n elif g=='M':\r\n for i in range(a-1,b):\r\n m[i]+=1\r\nt=0\r\nfor i in range(366):\r\n temp=min(f[i],m[i])\r\n t = max(temp,t)\r\n \r\nprint(t*2)\r\n", "data_m = [0 for i in range(367)]\r\ndata_f = [0 for i in range(367)]\r\nfor i in range(int(input())):\r\n sex, start, finish = input().split()\r\n if sex == 'M':\r\n for j in range(int(start), int(finish) + 1):\r\n data_m[j] += 1\r\n else:\r\n for j in range(int(start), int(finish) + 1):\r\n data_f[j] += 1\r\nans = 0\r\nfor i in range(367):\r\n ans = max(ans, min(data_f[i], data_m[i]))\r\nprint(ans * 2)", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n ppl = [[i for i in input().split(\" \")] for j in range(n)]\r\n M = [0 for i in range(400)]\r\n F = [0 for i in range(400)]\r\n for i in ppl:\r\n gender, start, end = i\r\n start = int(start)\r\n end = int(end)\r\n if gender == \"M\":\r\n for j in range(start, end + 1):\r\n M[j] += 1\r\n else:\r\n for j in range(start, end + 1):\r\n F[j] += 1\r\n max_val = 0\r\n for i in range(len(M)):\r\n if min(M[i], F[i]) > max_val:\r\n max_val = min(M[i], F[i])\r\n print(2 * max_val)\r\n\r\n\r\nmain_function()\r\n", "n = int(input())\na = []\nf = []\nm = []\nfor i in range(n):\n t, l, r = [x for x in input().split()]\n l = int(l)\n r = int(r)\n if t == 'M':\n m.append([l, r])\n else:\n f.append([l, r])\n\nans = 0\nfor day in range(1, 367):\n cntm = 0\n cntf = 0\n for i in range(0, len(m)):\n if day >= (m[i][0]) and day <= m[i][1]:\n cntm += 1\n\n for i in range(0, len(f)):\n if day >= f[i][0] and day <= f[i][1]:\n cntf += 1\n s = min(cntm, cntf) * 2\n if s > ans:\n ans = s\nprint(ans)", "n = int(input())\r\nnum_b = [0 for i in range(366)]\r\nnum_g = [0 for i in range(366)]\r\nfor i in range(n):\r\n s = list(input().split())\r\n if s[0] == 'M':\r\n for i in range(int(s[1])-1, int(s[2])):\r\n num_b[i] += 1\r\n else:\r\n for i in range(int(s[1])-1, int(s[2])):\r\n num_g[i] += 1\r\nfor i in range(366):\r\n num_b[i] = min(num_b[i], num_g[i])\r\nprint(2*max(num_b))", "n = int(input())\r\np = []\r\nfor i in range(n):\r\n s, t, j = input().split()\r\n t = int(t)\r\n j = int(j)\r\n p.append([t, 'a', s])\r\n p.append([j, 'z', s])\r\np.sort()\r\ne1 = 0\r\ne2 = 0\r\nmaxi = 0\r\nfor i in range(2 * n):\r\n if p[i][1] == 'a' and p[i][2] == 'M':\r\n e1 += 1\r\n elif p[i][1] == 'a' and p[i][2] == 'F':\r\n e2 += 1\r\n elif p[i][1] == 'z' and p[i][2] == 'M':\r\n e1 -= 1\r\n else:\r\n e2 -= 1\r\n maxi = max(maxi, min(e1, e2))\r\nprint(maxi * 2)\r\n \r\n", "n = int(input())\n\nf, m = [0]*368, [0]*368\nfor i in range(n):\n s, a, b = input().split()\n if s == 'F':\n f[int(a)] += 1\n f[int(b)+1] -= 1\n elif s == 'M':\n m[int(a)] += 1\n m[int(b)+1] -= 1\n\nfor i in range(1, len(f)):\n f[i] += f[i-1]\n m[i] += m[i-1]\n\nprint(max([min(f[i], m[i])*2 for i in range(1, 367)]))\n", "def s():\r\n\tn = int(input())\r\n\tf = [[0,0] for _ in range(368)]\r\n\tfor _ in range(n):\r\n\t\t[g,a,b] = input().split(' ')\r\n\t\tg = g == 'M'\r\n\t\ta = int(a)\r\n\t\tb = int(b) + 1\r\n\t\tf[a][g] += 1\r\n\t\tf[b][g] -= 1\r\n\tr = 0\r\n\tt = [0,0]\r\n\tfor i in f:\r\n\t\tt[0] += i[0]\r\n\t\tt[1] += i[1]\r\n\t\tr = max(r,min(t))\r\n\tprint(2*r)\r\ns()", "n = int(input())\r\ngrid = []\r\nfor i in range(n):\r\n tokens = input().split()\r\n grid.append([tokens[0], int(tokens[1]), int(tokens[2])])\r\nans = 0\r\nfor i in range(366):\r\n males, females = 0, 0\r\n for j in range(n):\r\n if grid[j][1] - 1 <= i <= grid[j][2] - 1:\r\n if grid[j][0] == 'M':\r\n males += 1\r\n else:\r\n females += 1\r\n x = 2 * min(males, females)\r\n if x > ans:\r\n ans = x\r\nprint(ans)", "year_m = [0]*366\r\nyear_f = [0]*366\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n gender, f, l = input().split()\r\n f, l = int(f), int(l)\r\n for j in range(f-1, l):\r\n if(gender=='M'):\r\n year_m[j] += 1\r\n else:\r\n year_f[j] += 1\r\nm = 0\r\nfor i in range(366):\r\n '''if(year_m[i]==year_f[i]):\r\n m = max(m, year_m[i]+year_f[i])'''\r\n m = max(m, min(year_m[i], year_f[i])*2)\r\nprint(m)", "import sys\r\n\r\nlst = []\r\namt = int(input())\r\n\r\nfor i in range(amt):\r\n gender, start, end = input().split()\r\n start = int(start)\r\n end = int(end)\r\n temp = range(start, end + 1)\r\n lst.append([gender, temp])\r\n\r\nmaximum = 0\r\nfor i in range(1, 367):\r\n girls = 0\r\n boys = 0\r\n for x in lst:\r\n if i in x[1]:\r\n if x[0] == \"F\":\r\n girls += 1\r\n else:\r\n boys += 1\r\n if min(girls, boys) > maximum:\r\n #print(i)\r\n maximum = min(girls, boys)\r\n\r\nprint(maximum * 2)", "day = 367\r\nn = int(input())\r\nmale = [0] * day\r\nfemale = [0] * day\r\nfor i in range(n):\r\n sex, l, r = input().split()\r\n if sex == 'M':\r\n for j in range(int(l), int(r) + 1):\r\n male[j] += 1\r\n else:\r\n for j in range(int(l), int(r) + 1):\r\n female[j] += 1\r\n\r\nans = 0\r\nfor i in range(1, day):\r\n ans = max(ans, min(male[i], female[i]))\r\nprint(ans * 2)", "import heapq\n\nn = int(input())\nll = [tuple(input().split()) for j in range(n)]\ngender,start,end = zip(*ll)\n\nstart = [int(i) for i in start]\nend = [int(i) for i in end]\n\nfinal_ = list(zip(end,start,range(n),gender))\nfinal_.sort(key=lambda x: x[1])\n\nfriendheap = []\nn_m = 0\nn_f = 0\nmax_friends = 0\nfor i in final_:\n #print(i)\n #print(len(i))\n cur_start = i[1]\n cur_gender = i[3]\n while True:\n if len(friendheap) == 0:\n break\n else:\n elem = heapq.nsmallest(1,friendheap)[0]\n #print(elem)\n gender = elem[3]\n if elem[0] < cur_start:\n heapq.heappop(friendheap)\n if gender == 'M':\n n_m -= 1\n else:\n n_f -= 1\n else:\n break\n heapq.heappush(friendheap,i)\n if cur_gender == 'M':\n n_m += 1\n else:\n n_f += 1\n #print(n_m,n_f)\n max_friends = max(max_friends, min(n_m,n_f))\n\nprint(2*max_friends)\n", "n = int(input())\r\nf = [0] * 366\r\nm = [0] * 366\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n b, c = int(b), int(c)\r\n if a == 'F':\r\n for j in range(b-1, c):\r\n f[j] += 1\r\n if a == 'M':\r\n for j in range(b-1, c):\r\n m[j] += 1\r\nres = 0\r\nfor i in range(366):\r\n t = min(m[i], f[i])\r\n res = max(res, t)\r\nprint(2 * res)\r\n", "n = int(input())\r\nboy = [0] * 1000\r\ngirl = [0] * 1000\r\nfor i in range(n):\r\n lst = list(input().split())\r\n lst[1] = int(lst[1])\r\n lst[2] = int(lst[2])\r\n for j in range(lst[1], lst[2] + 1):\r\n if lst[0] == 'M':\r\n boy[j] += 1\r\n else:\r\n girl[j] += 1\r\nans = -1 \r\nfor i in range(1000):\r\n k = 2 * min(boy[i], girl[i])\r\n ans = max(ans, k)\r\n \r\nprint(ans)\r\n", "m=[0]*367\r\nf=[0]*367\r\nfor i in range(int(input())):\r\n a=list(input().split())\r\n if a[0]=='M':\r\n for i in range(int(a[1]),int(a[2])+1):\r\n m[i]+=1\r\n else: \r\n for i in range(int(a[1]),int(a[2])+1):\r\n f[i]+=1\r\nx=0\r\nfor i in range(367):\r\n x=max(x,min(m[i],f[i]))\r\nprint(2*x) ", "n =int(input())\r\np = []\r\nfor i in range(0,n):\r\n sex, odd, doo = str(input()).split(' ')\r\n p = p + [(int(odd),0,sex)] + [(int(doo),1,sex)]\r\nmale,female,maxy = 0,0,0\r\np.sort()\r\nfor i in p:\r\n adding = -1\r\n if i[1] == 0:\r\n adding = 1\r\n if i[2] == 'M':\r\n male = male + adding\r\n else:\r\n female = female + adding\r\n maxy = max(maxy,2*min(male,female))\r\nprint(maxy)\r\n \r\n", "lst=[[0,0] for i in range(366)]\r\nfor i in range(int(input())):\r\n x=input().split()\r\n if x[0]=='M':\r\n for i in range(int(x[1])-1 , int(x[2])):\r\n lst[i][0]+=1\r\n else:\r\n for i in range(int(x[1])-1 , int(x[2])):\r\n lst[i][1]+=1 \r\n\r\nans=0\r\nfor i in lst:\r\n ans=max(ans,min(i)*2)\r\n\r\nprint(ans)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nboy=[0]*370\r\ngir=[0]*370\r\nfor k in range(n):\r\n ch,n,m=map(str,input().split())\r\n n=int(n)\r\n m=int(m)\r\n ans=0\r\n if ch=='M':\r\n for x in range(n,m+1):\r\n boy[x]+=1 \r\n else:\r\n for x in range(n,m+1):\r\n gir[x]+=1 \r\nfor x in range(370):\r\n ans=max(2*(min(boy[x],gir[x])),ans)\r\nprint(ans)", "n = int(input())\r\ngender, a, b = [], [], []\r\nfor x in range(n):\r\n string = input()\r\n friend = string.split()\r\n gender.append(friend[0])\r\n a.append(int(friend[1]))\r\n b.append(int(friend[2]))\r\nfriends = []\r\nfor x in range(min(a), max(b) + 1):\r\n m = f = 0\r\n for y in range(n):\r\n if a[y] <= x and b[y] >= x:\r\n if gender[y] == \"M\":\r\n m += 1\r\n else:\r\n f += 1\r\n friends.append(min([m, f]) * 2)\r\nprint(max(friends))", "n = int(input())\r\nm1 = {}\r\nm2 = {}\r\nfor x in range(367):\r\n m1[x] = 0\r\nfor y in range(367):\r\n m2[y] = 0\r\nfor friend in range(n):\r\n g, a, b = input().split()\r\n for bruh in range(int(a), int(b)+1):\r\n if g == \"M\":\r\n m1[bruh] += 1\r\n elif g == \"F\":\r\n m2[bruh] += 1\r\nattendees = []\r\nfor day in range(367):\r\n attendees.append(min(m1[day], m2[day]))\r\n\r\nprint(max(attendees)*2)\r\n\r\n\r\n", "F = [0]*367\r\nM = [0]*367 \r\n\r\nt = int(input())\r\nfor u in range(t):\r\n a , b , c = input().split()\r\n \r\n b , c = int(b) , int(c)\r\n if a == 'F':\r\n for _ in range(b , c+1):\r\n F[_] +=1\r\n else :\r\n for _ in range(b , c+1):\r\n M[_] +=1\r\nans = 0 \r\nfor i in range(1,367):\r\n tmp = min(F[i] , M[i])\r\n ans = max(ans , tmp)\r\nprint(ans*2)", "n = int(input())\r\nsex = []\r\nmax_k = 0\r\naa = []\r\nbb = []\r\nfor _ in range(n):\r\n s, a, b = list(input().split())\r\n sex.append(s)\r\n aa.append(int(a))\r\n bb.append(int(b))\r\nfor i in range(1, 367):\r\n f = 0\r\n m = 0\r\n for j in range(n):\r\n if aa[j] <= i <= bb[j]:\r\n if sex[j] == 'F':\r\n f += 1\r\n else:\r\n m += 1\r\n max_k = max(max_k, min(f, m)*2)\r\nprint(max_k)\r\n", "n = int(input())\r\nfriends = [list(map(str,input().split())) for i in range(n)]\r\ndays = [[0]*366 for i in range(2)]\r\nfor i in range(n):\r\n if friends[i][0] == \"M\":\r\n for j in range(int(friends[i][1])-1,int(friends[i][2])):\r\n days[0][j] += 1\r\n else:\r\n for j in range(int(friends[i][1])-1,int(friends[i][2])):\r\n days[1][j] += 1\r\nnum = 0\r\nfor i in range(366):\r\n if min(days[0][i],days[1][i]) > num:\r\n num = min(days[0][i],days[1][i])\r\nprint(num*2)\r\n", "def inp(n):\r\n if n == 1:\r\n return map(int, stdin.readline().split())\r\n elif n == 2:\r\n return map(float, stdin.readline().split())\r\n else:\r\n return map(str, stdin.readline().split())\r\n\r\n\r\nfrom sys import *\r\n\r\narr, n = [], int(input())\r\n\r\nfor i in range(n):\r\n s1, s2, s3 = inp(3)\r\n arr.append([s1, int(s2), int(s3)])\r\nans = 0\r\n\r\nfor i in range(1, 367):\r\n male, female = 0, 0\r\n for j in range(n):\r\n if i >= arr[j][1] and i <= arr[j][2]:\r\n if arr[j][0] == 'M':\r\n male += 1\r\n else:\r\n female += 1\r\n\r\n ans = max(ans, min(male, female)*2)\r\nprint(ans)\r\n", "n=int(input())\r\nab=[list(input().split()) for i in range(n)]\r\nman,woman=0,0\r\nday=[]\r\nfor i in range(1,367):\r\n for x in range(len(ab)):\r\n if int(ab[x][1])<=i<=int(ab[x][2]):\r\n if ab[x][0]=='M':\r\n man+=1\r\n else:\r\n woman+=1\r\n day.append(2*min(man,woman))\r\n man=0\r\n woman=0\r\nprint(max(day))\r\n\r\n\r\n\r\n\r\n", "def max_party(friends):\r\n m = [0]*366\r\n f = [0]*366\r\n for g, a, b in friends:\r\n mf = m if g else f\r\n for i in range(a, b+1):\r\n mf[i-1] += 1\r\n mf = list(map(min, zip(m, f)))\r\n return max(mf) * 2\r\n\r\n\r\ndef get_input():\r\n n = int(input())\r\n friends = []\r\n for _ in range(n):\r\n g, a, b = input().split()\r\n friends.append(((g == 'M'), int(a), int(b)))\r\n return friends\r\n\r\n\r\nif __name__ == '__main__':\r\n print(max_party(get_input()))\r\n\r\n", "n=int(input())\r\na=[[],[]]\r\nc=[]\r\nfor _ in[0]*n:\r\n z,*w=input().split()\r\n x,y=map(int,w)\r\n a[z=='F']+=[(x,y)]\r\n c+=[x,y]\r\nr=0\r\nfor d in range(367):\r\n x=sum(u<=d<=v for u,v in a[0])\r\n y=sum(u<=d<=v for u,v in a[1])\r\n r=max(r,min(x,y))\r\nprint(r*2)", "n=int(input())\r\na=[0]*367\r\nb=[0]*367\r\nd=[]\r\nfor i in range(n):\r\n c=list(map(str,input().split()))\r\n if c[0]=='M':\r\n for i in range(int(c[1]),int(c[2]) + 1):\r\n a[i]+=1\r\n else:\r\n for i in range(int(c[1]),int(c[2]) + 1):\r\n b[i]+=1\r\nfor i in range(367):\r\n d.append(min(a[i],b[i]))\r\nprint(max(d) * 2)\r\n \r\n ", "if __name__ == '__main__':\r\n n = int(input())\r\n mi = [0] * 366\r\n fi = [0] * 366\r\n for _ in range(n):\r\n fm, s, e = map(str, input().split())\r\n if fm == 'M':\r\n for i in range(int(s) - 1, int(e)):\r\n mi[i] += 1\r\n elif fm == 'F':\r\n for i in range(int(s) - 1, int(e)):\r\n fi[i] += 1\r\n print(2 * max([min(m, f) for m, f in zip(mi, fi)]))\r\n", "readInts=lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\nnum = [[0,0] for i in range(370)]\r\nfor i in range(n):\r\n s,u,v = (input().split())\r\n u=int(u)\r\n v=int(v)\r\n c=int(s=='F')\r\n num[u][c]+=1\r\n num[v+1][c]-=1\r\nx=0;y=0\r\nret=0\r\nfor i in range(367):\r\n x+=num[i][0]\r\n y+=num[i][1]\r\n ret=max(ret,min(x,y))\r\nret*=2\r\nprint(ret)", "male=[0]*368\r\nfemale=[0]*368\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n s,a,b=map(str,input().split())\r\n a=int(a)\r\n b=int(b)\r\n\r\n if s=='M':\r\n male[a] += 1\r\n male[b+1] -= 1\r\n if s=='F':\r\n female[a] += 1\r\n female[b+1] -= 1\r\n\r\nmale_sum=[0]*368\r\nfemale_sum=[0]*368\r\npair =[0]*368\r\n\r\nfor j in range(1,368):\r\n male_sum[j] = male_sum[j-1]+ male[j]\r\n female_sum[j] = female_sum[j-1] +female[j]\r\n pair[j]=min(male_sum[j],female_sum[j])\r\n\r\nprint(max(pair)*2)\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n", "#!/usr/bin/env python3\n\nif __name__ == '__main__':\n N = int(input())\n friends = []\n for i in range(N):\n s, a, b = input().split()\n friends.append([int(a), False, s])\n friends.append([int(b), True, s])\n\n res = 0\n boys = 0\n girls = 0\n for a, out, s in sorted(friends):\n if out:\n if s == 'M':\n boys -= 1\n else:\n girls -= 1\n else:\n if s == 'M':\n boys += 1\n else:\n girls += 1\n res = max(res, 2 * min(boys, girls))\n\n print(res)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nl = 400\r\nu, v = [0] * l, [0] * l\r\nfor _ in range(n):\r\n x, a, b = input().rstrip().decode().split()\r\n a, b = int(a), int(b)\r\n if x == \"M\":\r\n u[a] += 1\r\n u[b + 1] -= 1\r\n else:\r\n v[a] += 1\r\n v[b + 1] -= 1\r\nfor i in range(1, l):\r\n u[i] += u[i - 1]\r\n v[i] += v[i - 1]\r\nans = 0\r\nfor i, j in zip(u, v):\r\n ans = max(ans, 2 * min(i, j))\r\nprint(ans)", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn = I()\r\navail = [[0, 0] for i in range(367)]\r\nfor i in range(n):\r\n t, a, b = IS()\r\n a, b = map(int, [a, b])\r\n t = t == \"M\"\r\n for j in range(a, b+1):\r\n avail[j][t] += 1\r\n\r\nprint(max(map(min, avail))*2)", "n = int(input())\na = [[0, 0] for _ in range(366)]\nfor _ in range(n):\n\tg, s, e = input().split(' ')\n\ts, e = int(s), int(e)\n\tif g == 'M':\n\t\tfor i in range(s-1, e):\n\t\t\ta[i][0] += 1\n\telse:\n\t\tfor i in range(s-1, e):\n\t\t\ta[i][1] += 1\nans = 0\nfor i in a:\n\tans = max(ans, 2*min(i))\nprint(ans)", "n = int(input())\r\ndays = [[0, 0] for i in range(370)]\r\nfor i in range(n):\r\n gender, a, b = input().split(' ')\r\n a, b = map(int, (a, b))\r\n if gender == 'M':\r\n gender = 0\r\n else:\r\n gender = 1\r\n for j in range(a, b+1):\r\n days[j][gender] += 1\r\nans = max(min(day) for day in days)\r\nprint(ans*2)\r\n", "n = int(input())\nmale,female = [0]*370,[0]*370\nfor _ in range(n):\n g,l,r = input().split()\n\n if g =='M':\n for i in range(int(l),int(r)+1):\n male[i]+=1\n\n else:\n for i in range(int(l),int(r)+1):\n female[i]+=1\n\n\n\nans = 0\nfor i in range(1,367):\n\n tans = 2*min(male[i],female[i])\n if tans>ans:\n ans = tans\n\nprint(ans)\n\n", "n = int(input())\r\n\r\nmale = [0]*400\r\nfemale = [0]*400\r\n\r\nwhile n > 0:\r\n gender, start, end = input().split()\r\n start = int(start)\r\n end = int(end)\r\n for i in range(start, end+1):\r\n if gender == \"M\":\r\n male[i] += 1\r\n else:\r\n female[i] += 1\r\n\r\n n -= 1\r\n\r\nans = 0\r\nfor i in range(0, 400):\r\n ans = max(ans, min(male[i], female[i]))\r\n\r\nprint(ans*2)", "n = int(input())\nd = 367\nF = [0 for i in range(d)]\nM = [0 for i in range(d)]\nfor i in range(n):\n sex, l, r = input().split()\n l, r = int(l), int(r)\n if sex == 'F':\n for j in range(l, r+1): F[j] += 1\n else:\n for j in range(l, r+1): M[j] += 1\nprint(2*max(min(F[i], M[i]) for i in range(d)))\n \n", "n=int(input())\r\na,b=[[0,0] for i in range(366)],0\r\nfor i in range(n):\r\n x,y,z=map(str,input().split())\r\n y,z=int(y),int(z)\r\n if x=='M':\r\n for i in range(y-1,z):a[i][0]+=1\r\n else:\r\n for i in range(y-1,z):a[i][1]+=1\r\nfor i in range(366):\r\n if min(a[i])>b:b=min(a[i])\r\nprint(b*2)", "n = int(input())\r\na = [ input().split() for i in range(n)]\r\nfor i in range(n):\r\n\tif a[i][0] == 'M':\r\n\t\ta[i][0] = 0\r\n\telse:\r\n\t\ta[i][0] = 1\r\n\ta[i][1] = int(a[i][1])\r\n\ta[i][2] = int(a[i][2])\r\nans = 0\r\nfor i in range(1, 367):\r\n\ttot = [0, 0]\r\n\tfor j in range(n):\r\n\t\tif a[j][1] <= i <= a[j][2]:\r\n\t\t\ttot[a[j][0]] += 1\r\n\tans = max(ans, min(tot[0], tot[1]))\r\nprint(ans << 1)", "n = int(input())\r\ngender = []\r\ndays = []\r\nfor i in range(n):\r\n L = input().split()\r\n g,a,b = L[0],int(L[1]),int(L[2])\r\n gender.append(g)\r\n days.append([a,b])\r\n\r\nTotal = 0\r\nfor i in range(1,367):\r\n Men = 0 \r\n Fem = 0\r\n for j in range(n):\r\n if days[j][0] <= i and i <= days[j][1]:\r\n if gender[j] == \"F\":\r\n Fem += 1\r\n else:\r\n Men += 1\r\n Total = max(Total,min(Men,Fem)*2)\r\nprint(Total)", "n = int(input())\n\nm = [0 for _ in range(366 + 1)]\nf = [0 for _ in range(366 + 1)]\n\nfor i in range(n):\n g, a, b = input().split()\n a, b = int(a), int(b)\n if g == 'M':\n for j in range(a, b + 1):\n m[j] += 1\n else:\n for j in range(a, b + 1):\n f[j] += 1\n\nansw = 0\nfor i in range(1, 366 + 1):\n answ = max(answ, min(m[i], f[i]) * 2)\n\nprint(answ)", "\ndays = [[0, 0] for i in range(367)]\n\nnum_friends = int(input())\n\nfor i in range(num_friends):\n gender, starts, ends = input().split(' ')\n start = int(starts)\n end = int(ends)\n if gender == 'M':\n idx = 0\n else:\n idx = 1\n for i in range(start, end + 1):\n days[i][idx] += 1\n\nprint(2 * max(min(pair) for pair in days))\n", "n = int(input())\r\nsm = 0\r\nf = [0 for x in range(1,368)]\r\nm = f.copy()\r\nfor i in range(n):\r\n a = input()\r\n a = a.split()\r\n\r\n b = [int(a[x]) for x in range(1,3)]\r\n pol = a[0]\r\n x, y = b\r\n for j in range (x, y+1):\r\n if pol == 'F':\r\n f[j] += 1\r\n else:\r\n m[j] += 1\r\n\r\nmx = 0\r\nfor i in range(1, 367):\r\n c = min(f[i], m[i])\r\n if c > mx: mx = c\r\n\r\nprint(mx*2)", "def prog():\r\n n = int(input())\r\n god = [[0,0] for i in range(366)]\r\n from sys import stdin\r\n for i in range(n):\r\n q = stdin.readline()\r\n a,b,c = q.split()[0],q.split()[1],q.split()[2]\r\n b,c = int(b),int(c)\r\n for i in range(b-1,c):\r\n if a=='M':\r\n god[i][0]+=1\r\n else:\r\n god[i][1]+=1\r\n rez=0\r\n for i,x in enumerate(god):\r\n if rez<min(x):\r\n rez=min(x)\r\n print(2*rez)\r\nprog()\r\n", "n = int(input())\r\na = [[0, 0] for _ in range(366)]\r\nfor _ in range(n):\r\n\tg, s, e = input().split(' ')\r\n\ts, e = int(s), int(e)\r\n\tif g == 'M':\r\n\t\tfor i in range(s-1, e):\r\n\t\t\ta[i][0] += 1\r\n\telse:\r\n\t\tfor i in range(s-1, e):\r\n\t\t\ta[i][1] += 1\r\nans = 0\r\nfor i in a:\r\n\tans = max(ans, 2*min(i))\r\nprint(ans)\r\n", "friends = int(input())\nm,f,lil,big = [],[],366,0\nfor x in range(friends):\n\tinp = input().split(\" \")\n\tinp[1],inp[2] = int(inp[1]),int(inp[2])\n\tif inp[0] == \"M\": m.append((inp[1],inp[2]))\n\telse: f.append((inp[1],inp[2]))\n\tif inp[1] < lil: lil = inp[1]\n\tif inp[2] > big: big = inp[2]\nmaxattend = 0\nfor day in range(lil,big+1):\n\tmaxm,maxf=0,0\n\tfor i in m:\n\t\tif day >= i[0] and day <= i[1]: maxm += 1\n\tfor i in f:\n\t\tif day >= i[0] and day <= i[1]: maxf += 1\n\tattend = min(maxm,maxf)\n\tif attend > maxattend: maxattend = attend\nprint(maxattend*2)\n\t \t\t \t\t \t\t \t\t \t \t", "from collections import defaultdict\r\nn = int(input())\r\npeople = defaultdict(list)\r\nans = -1\r\nwhile n:\r\n n -= 1\r\n a,b,c = input().split()\r\n for i in range(int(b),int(c) + 1):\r\n people[i].append(a)\r\nfor pair in people.values():\r\n m = pair.count('M')\r\n f = pair.count('F')\r\n if min(m,f) > ans:\r\n ans = min(m,f)\r\nprint(ans*2)", "n=int(input())\r\nfriends=[None]*n*3\r\nfrom_to=[None]*n*2\r\nfor i in range(n):\r\n\tline=input().split()\r\n\tfriends[i*3]=line[0]\r\n\tfriends[i*3+1]=from_to[i*2]=int(line[1])\r\n\tfriends[i*3+2]=from_to[i*2+1]=int(line[2])\r\n\r\nfrom_to_dist=list(set(from_to))\r\nlen_from_to_dist=len(from_to_dist)\r\nfemale_male=[0]*len_from_to_dist*2\r\npair_counts=[None]*len_from_to_dist\r\nfor i in range(len_from_to_dist):\r\n\tcur=from_to_dist[i]\r\n\tfor j in range(n):\r\n\t\tif cur>=friends[j*3+1] and cur<=friends[j*3+2]:\r\n\t\t\tif friends[j*3]=='F':\r\n\t\t\t\tfemale_male[i*2]+=1\r\n\t\t\telse:\r\n\t\t\t\tfemale_male[i*2+1]+=1\r\n\tpair_counts[i]=min(female_male[i*2],female_male[i*2+1])\r\nprint(max(pair_counts)*2)", "n = int(input())\r\nl = []\r\nyearm = [0] * 366\r\nyearf = [0] * 366\r\nfor i in range(n):\r\n l.append(input().split())\r\nfor i in range(366):\r\n for j in range(n):\r\n if l[j][0] == 'M':\r\n if int(l[j][1]) <= i + 1 <= int(l[j][2]):\r\n yearm[i] += 1\r\n else:\r\n if int(l[j][1]) <= i + 1 <= int(l[j][2]):\r\n yearf[i] += 1\r\nmaxp = 0\r\nfor i in range(366):\r\n if min(yearm[i], yearf[i]) > maxp:\r\n maxp = min(yearm[i], yearf[i])\r\nprint(maxp * 2)\r\n \r\n", "M=[0 for i in range(367)]\r\nF=[0 for i in range(367)]\r\nn=int(input())\r\nfor _ in range(n):\r\n g,n1,n2=input().split()\r\n b=int(n1)\r\n c=int(n2)\r\n for j in range(b,c+1):\r\n if g=='M':\r\n M[j]+=1\r\n else:\r\n F[j]+=1\r\nk=0\r\nfor i in range(367):\r\n m=min(M[i],F[i])\r\n if m>k:\r\n k=m\r\nprint(k*2)\r\n\r\n", "n = int(input())\r\nm = [0] * 366\r\nf = [0] * 366\r\nres = 0\r\nfor i in range(n):\r\n x, l, r = [i for i in input().split()]\r\n l = int(l)\r\n r = int(r)\r\n if x == 'M':\r\n for j in range(l-1, r):\r\n m[j] += 1\r\n else:\r\n for j in range(l-1, r):\r\n f[j] += 1\r\nfor i in range(366):\r\n res = max(res, min(m[i], f[i]))\r\nprint(res * 2)\r\n\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\nn = int(input())\nbm = {}\nem = {}\nbf = {}\nef = {}\na = []\n\nfor i in range(n):\n (s, b, e) = (i for i in input().split())\n b = int(b)\n e = int(e)+1\n\n a.append(b)\n a.append(e)\n\n if s =='M':\n if b in bm.keys():\n bm[b] += 1\n else:\n bm[b] = 1\n\n if e in em.keys():\n em[e] += 1\n else:\n em[e] = 1\n else:\n if b in bf.keys():\n bf[b] += 1\n else:\n bf[b] = 1\n\n if e in ef.keys():\n ef[e] += 1\n else:\n ef[e] = 1\n\nstart = time.time()\n\na = sorted(list(set(a)))\n\nans = 0\nnf = 0\nnm = 0\n\nfor i in a:\n if i in bm.keys():\n nm += bm[i]\n if i in em.keys():\n nm -= em[i]\n if i in bf.keys():\n nf += bf[i]\n if i in ef.keys():\n nf -= ef[i]\n\n t = min(nf, nm)\n\n if ans < 2*t:\n ans = 2*t\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\n\nf = []\nm = []\n\nfor i in range(n):\n g, a, b = input().split()\n\n if g == \"F\":\n f.append([int(a), int(b)])\n else:\n m.append([int(a), int(b)])\n\nmaxi = 0\n\nfor i in range(1, 367):\n mw = 0\n mm = 0\n\n for j in range(len(f)):\n if f[j][0] <= i <= f[j][1]:\n mw += 1\n for j in range(len(m)):\n if m[j][0] <= i <= m[j][1]:\n mm += 1\n\n maxi = max(maxi, min(mw, mm))\n \nprint(maxi*2)\n", "from sys import stdin\r\ninput = stdin.readline\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n k = list(input().split())\r\n a.append(k)\r\nb = [0]*366\r\nfor i in range(366):\r\n m,f,l,k = 0,0,0,0\r\n for j in a:\r\n if j[0]==\"M\":\r\n if i+1>=int(j[1]) and i+1<=int(j[2]):\r\n l+=1\r\n if j[0]==\"F\":\r\n if i+1>=int(j[1]) and i+1<=int(j[2]):\r\n k+=1\r\n b[i] = min(l,k)*2\r\nprint(max(b))", "n = int(input())\ncounts = { 'M': [0]*366, 'F': [0]*366 }\nfor _ in range(n):\n\tgender, start, end = input().split()\n\tstart, end = map(int, (start, end))\n\tfor i in range(start - 1, end):\n\t\tcounts[gender][i] += 1\nprint(2 * max(map(min, *counts.values())))\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nsi = lambda: input()\n\nm = [0]*367\nf = [0]*367\ns = [0]*367\n\nn = ii()\n\nfor _ in range(n):\n q = si().split()\n b, e = map(int, q[1:])\n if q[0] == 'M':\n for i in range(b, e+1):\n m[i] += 1\n else:\n for i in range(b, e+1):\n f[i] += 1\n\n# print(m, f)\nfor i in range(367):\n s[i] = min(m[i], f[i])\n\n# print(s)\n\nprint(max(s)*2)", "l = []\r\narr = []\r\nfor _ in range(int(input())):\r\n arr.append(list(map(lambda x: int(x) if x.isnumeric() else x, input().split())))\r\nfor i in range(len(arr)):\r\n temp = [arr[i]]\r\n for j in range(len(arr)):\r\n if i != j and arr[i][2] >= arr[j][1] and arr[i][2] <= arr[j][2]:\r\n temp.append(arr[j])\r\n l.append(temp)\r\nx = 0\r\nfor i in range(len(l)):\r\n x = max(x, min(sum([e[0] == 'M' for e in l[i]]),sum([e[0] == 'F' for e in l[i]])) * 2)\r\nprint(x)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/629/B\r\n\r\nn = int(input())\r\n\r\na_g = list([0] * 367 for _ in range(2))\r\na_b = [0] * 367\r\n\r\nfor _ in range(n):\r\n g, s, e = input().split()\r\n for i in range(int(s), int(e) + 1):\r\n a_g[1 if g == \"F\" else 0][i] += 1\r\n\r\nm = 0\r\nfor i in range(1, 367):\r\n m = max(m, 2 * min(a_g[0][i], a_g[1][i]))\r\n \r\nprint(m)", "n=int(input())\r\nc=[[]]*n\r\nb=[0]*367\r\na=[0]*367\r\nfor i in range(n):\r\n c=list(map(str,input().split()))\r\n x=int(c[1])\r\n y=int(c[2])\r\n if c[0]==\"M\":\r\n for j in range(x,y+1):\r\n b[j]+=1\r\n elif c[0]=='F':\r\n for j in range(x,y+1):\r\n a[j]+=1\r\nd=0\r\nfor i in range(367):\r\n d=max((2*min(a[i],b[i]),d))\r\nprint(d)\r\n\r\n", "n=int(input());\r\ny=[];\r\nfor i in range(n):\r\n x=list(input().split());\r\n y+=[[x[0],int(x[1]),int(x[2])]];\r\nans=0;\r\nfor i in range(367):\r\n m=sum([x[0]=='M'and x[1]<=i<=x[2]for x in y]);\r\n n=sum([x[0]=='F'and x[1]<=i<=x[2]for x in y]);\r\n ans=max(ans,min(m,n)*2);\r\nprint(ans);", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nimport os\nimport sys\nfrom atexit import register\nfrom io import BytesIO, StringIO\n\nsys.stdin = StringIO(os.read(0, os.fstat(0).st_size).decode())\nsys.stdout = StringIO()\nregister(lambda: os.write(1, sys.stdout.getvalue().encode()))\n\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\n\n\ndef main():\n\n ii = lambda: int(input())\n si = lambda: input()\n\n m = [0]*367\n f = [0]*367\n\n n = ii()\n\n for _ in range(n):\n q = si().split()\n b, e = map(int, q[1:])\n\n if q[0] == 'M':\n m[b-1] += 1\n m[e] -= 1\n else:\n f[b-1] += 1\n f[e] -= 1\n\n maxi = m_c = f_c = 0\n\n for i in range(366):\n m_c += m[i]\n f_c += f[i]\n maxi = max(maxi, min(m_c, f_c)) \n\n print(maxi*2)\n\nif __name__ == \"__main__\":\n main()", "n = int(input())\nm = [0]*367; f = [0]*367\n\nfor _ in range(n):\n g,a,b = input().split()\n arr = m if g=='M' else f\n a = int(a); b=int(b)\n for i in range(a,b+1):\n arr[i]+=1\n\nr = 2*max([min(m[i],f[i]) for i in range(367)])\nprint(r)", "DayM=[0 for i in range(367)]\r\nDayF=[0 for i in range(367)]\r\nn=int(input())\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n Begin=int(b)\r\n End=int(c)\r\n for j in range(Begin,End+1):\r\n if a=='M':\r\n DayM[j]+=1\r\n else:\r\n DayF[j]+=1\r\nM=0\r\nfor i in range(367):\r\n m=min(DayM[i],DayF[i])\r\n if m>M:\r\n M=m\r\nprint(M*2)\r\n", "n = int(input())\n\nfriends = list()\nminDay = 366\nmaxDay = 0\nfor i in range(n):\n\tf = input()\n\tarr = f.split(\" \")\n\tfriends.append(arr)\n\tif minDay > int(arr[1]):\n\t\tminDay = int(arr[1])\n\tif maxDay < int(arr[2]):\n\t\tmaxDay = int(arr[2])\n\ndays = list()\nfor day in range(minDay, maxDay+1):\n\td = list()\n\tfor f in friends:\n\t\tif int(f[1]) <= day and int(f[2]) >= day:\n\t\t\td.append(f[0])\n\tm = [f for f in d if f == 'M']\n\tf = [f for f in d if f == 'F']\n\tmaxPeople = len(m) if len(m)<len(f) else len(f)\n\tdays.append(maxPeople)\n\nprint(max(days)*2)", "n=int(input())\r\nm=[0]*367\r\nf=[0]*367\r\nfor i in range(n):\r\n a,x,y=input().split()\r\n x=int(x)\r\n y=int(y)\r\n if a==\"M\":\r\n for j in range(x,y+1):\r\n m[j]+=1\r\n if a==\"F\":\r\n for k in range(x,y+1):\r\n f[k]+=1\r\nans=0\r\nfor i in range(len(m)):\r\n ans=max(ans,min(f[i],m[i]))\r\nprint(2*ans)", "n=int(input())\r\na=[0]*367\r\nb=[0]*367\r\nfor i in range(n):\r\n c=list(map(str,input().split()))\r\n if c[0]=='M':\r\n for i in range(int(c[1]),int(c[2]) + 1):\r\n a[i]+=1\r\n else:\r\n for i in range(int(c[1]),int(c[2]) + 1):\r\n b[i]+=1\r\nx=min(a[1],b[1])\r\nfor i in range(2,367):\r\n if x <min(a[i],b[i]):\r\n x=min(a[i],b[i])\r\nprint(2*x)\r\n \r\n ", "\r\n\r\nif __name__ == '__main__':\r\n visitors_count = int(input())\r\n minDay = 0\r\n maxDay = 366\r\n\r\n users = []\r\n for i in range(visitors_count):\r\n users.append(input())\r\n minDay = int(users[0].split()[1])\r\n maxDay = int(users[0].split()[2])\r\n\r\n all_users: list = []\r\n for user in users:\r\n # user_ = user_from_string(user)\r\n user = user.split()\r\n all_users.append([user[0], int(user[1]), int(user[2])])\r\n if minDay > int(user[1]):\r\n minDay = int(user[1])\r\n if maxDay < int(user[2]):\r\n maxDay = int(user[2])\r\n dict_cunts = {}\r\n\r\n for i in range(minDay, maxDay + 1):\r\n for user in all_users:\r\n if i in range(user[1], user[2] + 1):\r\n dict_cunts.setdefault(i, [])\r\n dict_cunts[i].append(user)\r\n\r\n best_match = 0\r\n for users in dict_cunts.values():\r\n males_len = len(list(filter(lambda user: user[0] == 'M', users)))\r\n males_len_x2 = males_len * 2\r\n females_len = len(users) - males_len\r\n females_len_x2 = females_len * 2\r\n\r\n if (males_len > females_len or males_len == females_len) and best_match < females_len_x2:\r\n best_match = females_len_x2\r\n elif (females_len > males_len or males_len == females_len) and best_match < males_len_x2:\r\n best_match = males_len_x2\r\n\r\n print(best_match)\r\n", "n = int(input())\r\nday = [[0, 0] for i in range(368)]\r\nfor i in range(n):\r\n\ta, b, c = (input().split())\r\n\tif(a == \"M\"):\r\n\t\tday[int(b)][0] += 1\r\n\t\tday[int(c)+1][0] -= 1\r\n\telse:\r\n\t\tday[int(b)][1] += 1\r\n\t\tday[int(c)+1][1] -= 1\r\n\r\nw = 0\r\nm = 0\r\nans = 0\r\nfor i in day:\r\n\tw += i[0]\r\n\tm += i[1]\r\n\tans = max(2 * min(m, w), ans)\r\nprint(ans)", "def main():\n n = int(input())\n mf = ([0] * 367, [0] * 367)\n for _ in range(n):\n tmp = input().split()\n l = mf[tmp[0] == 'F']\n l[int(tmp[1]) - 1] += 1\n l[int(tmp[2])] -= 1\n res = []\n m = f = 0\n for a, b in zip(*mf):\n m += a\n f += b\n res.append(m if m < f else f)\n print(max(res) * 2)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nmale, female = 366 * [0], 366 * [0]\r\nfor j in range(n):\r\n gender, l, r = [str(j) for j in input().split()]\r\n if gender == 'M':\r\n for k in range(int(l) - 1, int(r)):\r\n male[k] += 1\r\n else:\r\n for k in range(int(l) - 1, int(r)):\r\n female[k] += 1\r\noutput = 0\r\nfor j in range(366):\r\n v = min(male[j], female[j])\r\n output = max(v, output)\r\nprint(output * 2)\r\n", "M = [0 for i in range(367)]\r\nF = [0 for i in range(367)]\r\nn = int(input())\r\nfor i in range(n):\r\n a,b,c = input().split()\r\n b = int(b)\r\n c = int(c)\r\n if a == 'M':\r\n for j in range(b,c+1):\r\n M[j] += 1\r\n else:\r\n for j in range(b,c+1):\r\n F[j] += 1\r\n#print(F)\r\n#print(M)\r\n\r\nm = 0\r\nfor i in range(1,367):\r\n x = min(M[i],F[i])\r\n if x > m:\r\n m = x\r\nprint(m*2)", "n = int(input())\r\nf = [0]*366\r\nm = [0]*366\r\nfor i in range(n):\r\n a,b,c = input().split()\r\n if a=='F':\r\n for j in range(int(b)-1,int(c)):f[j]+=1\r\n if a=='M':\r\n for j in range(int(b)-1,int(c)):m[j]+=1\r\nans = 0\r\nfor i in range(366):\r\n t = min(m[i],f[i])\r\n ans = max(ans,t)\r\nprint(ans*2)\r\n", "n=int(input())\r\nl=[list(input().split()) for _ in range(n)]\r\nans=0\r\nfor i in range(1,367):\r\n b,g=0,0\r\n for x in l:\r\n if int(x[1])<=i<=int(x[2]):\r\n if x[0]=='F': g+=1\r\n else: b+=1\r\n if b<g: b,g=g,b\r\n t=2*g\r\n if t>ans: ans=t\r\nprint(ans)", "N=400\r\nm=[0]*N\r\nf=[0]*N\r\nfor _ in ' '*int(input()):\r\n a,b,c=input().split();b=int(b);c=int(c)+1\r\n if a=='F':f[b]+=2;f[c]-=2\r\n else:m[b]+=2;m[c]-=2\r\na,b=0,0\r\no=0\r\nfor i in range(N):a+=m[i];b+=f[i];o=max(o,min(a,b))\r\nprint(o)", "n=int(input())\r\nM=[list(map(str,input().split())) for i in range(n)]\r\nl=[[0,0] for i in range(400)]\r\nfor i in range(n) :\r\n for j in range(int(M[i][1]),int(M[i][2])+1) :\r\n if M[i][0]=='F' :\r\n l[j][0]=l[j][0]+1\r\n else :\r\n l[j][1]=l[j][1]+1\r\nma=0\r\nfor i in range(400) :\r\n ma=max(ma,min(l[i]))\r\nprint(ma*2)\r\n \r\n \r\n", "t=int(input())\r\nlst1=[]\r\nlstm=[0]*367\r\nlstf=[0]*367\r\nlst2=[]\r\nlst4=[]\r\ncount=0\r\nfor k in range(t):\r\n x,y,z=input().split()\r\n for i in range(int(y),int(z)+1):\r\n if(x=='M'):\r\n lstm[i]=lstm[i]+1\r\n elif(x=='F'):\r\n lstf[i]=lstf[i]+1\r\nmaxx=0 \r\nfor l in range(1,367):\r\n num=2*min(lstf[l],lstm[l])\r\n if(num>=maxx):\r\n maxx=num\r\nprint(maxx)\r\n \r\n\r\n \r\n", "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\nMale,Female=[],[]\r\ndays=[[0,0] for _ in range(366)]\r\nfor _ in range(iinput()):\r\n a,b,c=map(str,input().split())\r\n if a=='M':\r\n for i in range(int(b)-1,int(c)):\r\n days[i][0]+=1\r\n else:\r\n for i in range(int(b)-1,int(c)):\r\n days[i][1]+=1\r\nanswer=-1\r\nfor j in days:\r\n answer=max(answer,min(j)*2)\r\nprint(answer)\r\n\r\n", "n=int(input())\r\nans=0\r\nm=[]\r\nf=[]\r\nfor i in range(367):\r\n m.append(0)\r\n f.append(0)\r\nfor i in range(n):\r\n data=input().split()\r\n if data[0]=='M':\r\n for j in range(int(data[1]),int(data[2])+1):\r\n m[j]+=1\r\n else:\r\n for j in range(int(data[1]),int(data[2])+1):\r\n f[j]+=1\r\nfor i in range(1,367):\r\n if m[i]==f[i]:\r\n if m[i]>ans:\r\n ans=m[i]\r\n elif m[i]>f[i]:\r\n if f[i]>ans:\r\n ans=f[i]\r\n else:\r\n if m[i]>ans:\r\n ans=m[i]\r\nprint(ans*2)", "n=int(input())\r\nboy=[0]*368\r\ngirl=[0]*368\r\nfor _ in range(n):\r\n a,b,c=input().split()\r\n b=int(b)\r\n c=int(c)\r\n if a==\"F\":\r\n girl[b]+=1 \r\n girl[c+1]-=1 \r\n else:\r\n boy[b]+=1 \r\n boy[c+1]-=1 \r\nfor i in range(1,367):\r\n girl[i]+=girl[i-1]\r\n boy[i]+=boy[i-1]\r\nmaxi=0\r\nfor i in range(1,367):\r\n curr=2*min(boy[i],girl[i])\r\n maxi=max(maxi,curr)\r\nprint(maxi)\r\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nsi = lambda: input()\n\nm = [0]*367\nf = [0]*367\n\nn = ii()\n\nfor _ in range(n):\n q = si().split()\n b, e = map(int, q[1:])\n\n if q[0] == 'M':\n m[b-1] += 1\n m[e] -= 1\n else:\n f[b-1] += 1\n f[e] -= 1\n\nmaxi = m_c = f_c = 0\n\nfor i in range(366):\n m_c += m[i]\n f_c += f[i]\n maxi = max(maxi, min(m_c, f_c)) \n\nprint(maxi*2)", "\r\narrMa=[0]*367\r\narrFe=[0]*367\r\np=int(input())\r\n\r\nfor i in range(p):\r\n inf=list(map(str,input().split()))\r\n if inf[0]=='M':\r\n arrMa[int(inf[1])-1]+=1\r\n arrMa[int(inf[2])]-=1\r\n else:\r\n arrFe[int(inf[1])-1]+=1\r\n arrFe[int(inf[2])]-=1\r\n \r\nmaxi=-1\r\ncurM=0\r\ncurF=0\r\nfor i in range(366):\r\n curM+=arrMa[i]\r\n curF+=arrFe[i]\r\n if min(curM,curF)>maxi:\r\n maxi=min(curM,curF)\r\n \r\nprint(maxi*2)\r\n", "n=int(input())\r\nls=[ list(input().split()) for i in range(n) ]\r\nma,m,f=0,0,0\r\nfor i in range(367):\r\n m,f=0,0\r\n for j in range(n):\r\n if int(ls[j][1]) <= i and int(ls[j][2]) >= i :\r\n if ls[j][0]=='M':\r\n m+=1\r\n else :\r\n f+=1\r\n \r\n ma=max(ma,min(m,f)*2)\r\nprint(ma) \r\n \r\n ", "list1 = []\r\nres = []\r\nfor i in range(int(input())):\r\n list1.append(input().split())\r\nfor i in range(1, 367):\r\n boys = 0\r\n girls = 0\r\n for friend in list1:\r\n if friend[0] == \"M\" and int(friend[1]) <= i <= int(friend[2]):\r\n boys += 1\r\n elif friend[0] == \"F\" and int(friend[1]) <= i <= int(friend[2]):\r\n girls += 1\r\n res.append(min(boys, girls))\r\nprint(max(res)*2)", "n = int(input())\r\na = [0 for i in range(368)]\r\nb = [0 for i in range(368)]\r\nfor i in range(n):\r\n\ts = input().split()\r\n\tif s[0] == 'M':\r\n\t\ta[int(s[1])] += 1\r\n\t\ta[int(s[2]) + 1] -= 1\r\n\telse:\r\n\t\tb[int(s[1])] += 1\r\n\t\tb[int(s[2]) + 1] -= 1\r\n\r\nans = 0\r\nfor i in range(1, 367):\r\n\ta[i] += a[i - 1]\r\n\tb[i] += b[i - 1]\r\n\tans = max(ans, min(a[i], b[i]))\r\nprint(ans << 1)", "m=[0]*370\r\nf=[0]*370\r\nfor i in range(int(input())):\r\n h,a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n if h==\"M\":\r\n for i in range(a,b+1):\r\n m[i]+=1\r\n else:\r\n for j in range(a,b+1):\r\n f[j]+=1\r\nmax=-1\r\nfor i in range(370):\r\n if min(m[i],f[i])>max:\r\n max=min(m[i],f[i])\r\nprint(max*2)\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\ngender = []\r\nfromdate = []\r\ntodate = []\r\nfor k in range(n):\r\n a, b, c = input().split()\r\n gender.append(a)\r\n fromdate.append(int(b))\r\n todate.append(int(c))\r\nminimum = min(fromdate)\r\nmaximum = max(todate)\r\n#print(\"min = {} max = {}\".format(minimum,maximum))\r\nans = 0\r\nfor i in range(minimum, maximum + 1):\r\n male = 0\r\n women = 0\r\n for j in range(n):\r\n if fromdate[j] <= i and todate[j] >= i:\r\n if gender[j] == 'M':\r\n male += 1\r\n else:\r\n women += 1\r\n count = min(male, women) * 2\r\n #print(count)\r\n if count > ans:\r\n ans = count\r\n\r\nprint(ans)\r\n", "n=int(input())\nrows=[]\nfor _ in range(n):\n g,s,e=input().split()\n rows.append((g,int(s),int(e)))\nbest=0\nfor i in range(1,367):\n m=f=0\n for row in rows:\n g,s,e=row\n if g=='M':\n m+=(1 if (s<=i and i<=e) else 0)\n else:\n f+=(1 if (s<=i and i<=e) else 0)\n best=max(min(m,f),best)\nprint(best*2)\n\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=int(input()) ; female=[0]*368 ; male=[0]*368 ; ans=0\r\nfor i in range(n):\r\n gen,st,end=input().split()\r\n if gen==\"F\":\r\n female[int(st)-1]+=1\r\n female[int(end)]-=1\r\n else:\r\n male[int(st)-1]+=1\r\n male[int(end)]-=1\r\nfor i in range(367):\r\n female[i+1]+=female[i]\r\n male[i+1]+=male[i]\r\n\r\nfor i in range(368):\r\n ans=max(min(female[i],male[i]),ans)\r\n\r\nprint(ans*2)", "v = [[0] * 367 for i in range(2)]\r\nfor i in range(int(input())):\r\n c = input().split()\r\n s = int(c[0] == 'M')\r\n for j in range(int(c[1]), int(c[2]) + 1):\r\n v[s][j] += 1\r\nprint(2 * max(min(x, y) for x, y in zip(v[0], v[1])))", "lof=[]\r\nmi=1000\r\nma=0\r\nmf=0\r\nclass Bio:\r\n def __init__(self,c):\r\n self.gen=c\r\n self.cal=[False for i in range(368)]\r\n \r\n def setcal(self,mi,ma):\r\n for i in range (mi,ma+1):\r\n self.cal[i]=True\r\n \r\n def getgen(self):\r\n return self.gen\r\n \r\n def getcal(self):\r\n return self.cal\r\n \r\nn=int(input())\r\nfor x in range(n):\r\n se,a,b=input().split()\r\n a=int(a)\r\n b=int(b)\r\n if(a<mi):\r\n mi=a\r\n if(b>ma):\r\n ma=b\r\n lof.append(Bio(se))\r\n lof[x].setcal(a,b)\r\n \r\nfor j in range(mi,ma+1):\r\n cm=0\r\n cf=0\r\n for i in range(n):\r\n if(lof[i].getcal()[j] and lof[i].getgen()==\"F\"):\r\n cf+=1\r\n elif(lof[i].getcal()[j] and lof[i].getgen()==\"M\"):\r\n cm+=1\r\n \r\n if(cm>cf):\r\n nof=2*cf\r\n else:\r\n nof=2*cm\r\n \r\n if(nof>mf):\r\n mf=nof\r\n \r\nprint(mf)\r\n", "from math import *\r\nfrom sys import *\r\n\r\nM=[0]*367\r\nF=[0]*367\r\nn=int(stdin.readline())\r\nfor i in range(n):\r\n nn=[z for z in stdin.readline().split()]\r\n if nn[0]==\"M\":\r\n for j in range(int(nn[1]),int(nn[2])+1):\r\n M[j]+=1\r\n else:\r\n for j in range(int(nn[1]),int(nn[2])+1):\r\n F[j]+=1\r\nmx=0\r\nfor i in range(367):\r\n mx=max(mx,min(M[i],F[i]))\r\nprint(2*mx)", "def reunion(lst):\r\n ans=0\r\n for i in range(370):\r\n a,b=0,0\r\n for j in lst:\r\n lft=min(j[1],j[2])\r\n rt=max(j[1],j[2])\r\n if i<lft or i>rt:\r\n continue\r\n if j[0]==\"M\":\r\n a+=1\r\n elif j[0]==\"F\":\r\n b+=1\r\n else:\r\n return -1\r\n ans=max(ans,2*min(a,b))\r\n return ans\r\n\r\nn=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n v=list(input().split())\r\n lst.append([v[0],int(v[1]), int(v[2])])\r\n#print(lst)\r\nprint(reunion(lst))\r\n\r\n", "__author__ = 'aste'\r\n\r\nDAYS = 366\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n g_f = [0] * DAYS\r\n g_m = [0] * DAYS\r\n for i in range(0, n):\r\n g, a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n for j in range(1, DAYS + 1):\r\n if a <= j <= b:\r\n if g == 'F':\r\n g_f[j - 1] += 1\r\n else:\r\n g_m[j - 1] += 1\r\n res = 0\r\n for i in range(0, DAYS):\r\n res = max(res, 2*min(g_f[i], g_m[i]))\r\n print(res)\r\n\r\nmain()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = [input().split() for _ in range(n)]\r\n\r\ni = 366\r\nc = 0\r\nwhile i:\r\n d = {'F':0, 'M':0}\r\n for j in g:\r\n if int(j[1]) <= i <= int(j[2]):\r\n d[j[0]] += 1\r\n if min(d.values()) > c:\r\n c = min(d.values())\r\n i-=1\r\nprint(c*2)", "data = []\r\nn = int(input())\r\nfor i in range(n):\r\n\ttemp = input().split()\r\n\tdata.append([temp[0], int(temp[1]), 'A'])\r\n\tdata.append([temp[0], int(temp[2]), 'B'])\r\ndata.sort(key = lambda x : (x[1], x[2]))\r\nMcnt = 0\r\nFcnt = 0\r\nans = 0\r\nfor item in data:\r\n\tif item[2] == 'A':\r\n\t\tif item[0] == 'F':\r\n\t\t\tFcnt += 1\r\n\t\telse:\r\n\t\t\tMcnt += 1\r\n\telse:\r\n\t\tif item[0] == 'F':\r\n\t\t\tFcnt -= 1\r\n\t\telse:\r\n\t\t\tMcnt -= 1\r\n\tans = max(ans, min(Mcnt, Fcnt))\r\nprint(ans*2)\r\n\r\n\r\n", "n = int(input())\n\nludia = []\nfor i in range(n):\n s = input().split()\n ludia.append([s[0], int(s[1]), int(s[2])])\n\nmaxi = 0\nfor den in range(1, 367):\n muzov, zien = 0, 0\n for clovek in ludia:\n if clovek[1] <= den <= clovek[2]:\n if clovek[0] == 'M':\n muzov += 1\n elif clovek[0] == 'F':\n zien += 1\n else:\n print('WTF?!')\n\n parov = min(muzov, zien)\n maxi = max(maxi, parov)\n\nprint(maxi * 2)\n", "m = 366 * [0]\nf = 366 * [0]\nfor i in range(int(input())):\n x = list(input().split())\n if x[0] == 'M':\n for j in range(int(x[1]), int(x[2]) + 1):\n m[j - 1] += 1\n else:\n for j in range(int(x[1]), int(x[2]) + 1):\n f[j - 1] += 1\nmaximum = 0\nfor k in range(len(m)):\n if min(m[k], f[k]) > maximum:\n maximum = min(m[k], f[k])\nprint(2 * maximum)\n", "#-------------------------------------------------------------------------------------------\n# Richard Mello\n# E - Far Relative’s Problem\n#-------------------------------------------------------------------------------------------\n# Função principal\n#-------------------------------------------------------------------------------------------\n\ndef main():\n\t# Recebe\n\tn = int(input())\n\tamigos = []\n\t\n\t# Adiciona os amigos\n\tfor i in range(n):\n\t\tg, i, f = input().split()\n\t\ti = int(i)\n\t\tf = int(f)\n\t\tamigos.append([g, i, f])\n\t\n\t# Pra cada dia\n\tmaximo = 0\n\tfor dia in range(1, 367):\n\t\tm, h = 0, 0\n\t\t\n\t\t# Pra cada amigo\n\t\tfor i in range(n):\n\t\t\t# Se o amigo pode ir no dia\n\t\t\tif amigos[i][1] <= dia and dia <= amigos[i][2]:\n\t\t\t\t# Vê se é mulher ou homem\n\t\t\t\tif amigos[i][0] == 'F': m += 1\n\t\t\t\telse: h += 1\n\t\t# Atualiza o máximo, se der\n\t\tquantos = 2*(min(m, h))\n\t\tif quantos > maximo: maximo = quantos\n\t\n\t# Mostra o resultado\n\tprint(maximo)\n\t\t\nmain()\n\n#-------------------------------------------------------------------------------------------\n\n \t \t\t\t\t \t \t\t \t \t \t\t\t \t \t" ]

[ "from collections import *\n\n\n\nf = lambda: list(map(int, input().split()))\n\nn, l, a = f()\n\np, s = f(), f()\n\nm = s.count(-1)\n\nx = {(0, min(a, m)): 1}\n\nr = [1]\n\n\n\nfor p, s in zip(p, s):\n\n p /= 100\n\n if s > 0:\n\n y = defaultdict(int)\n\n for (k, a), q in x.items():\n\n y[(k, a)] += q - q * p\n\n a = min(m, a + s)\n\n k = min(l, k + 1)\n\n y[(k, a)] += q * p\n\n x = y\n\n else:\n\n i = [0] + [q * p for q in r]\n\n j = [q - q * p for q in r] + [0]\n\n r = [a + b for a, b in zip(i, j)]\n\n\n\ny = [[0] * (m + 1) for i in range(n - m + 1)]\n\nfor (k, a), q in x.items():\n\n if k + a >= l: y[k][a] = q\n\n\n\nfor k in range(n - m, -1, -1):\n\n for a in range(m, 0, -1):\n\n y[k][a - 1] += y[k][a]\n\nfor k in range(n - m, 0, -1):\n\n for a in range(m, -1, -1):\n\n y[k - 1][a] += y[k][a]\n\n\n\nd = 0\n\nfor k, p in enumerate(r):\n\n if l - k <= n - m: d += y[max(0, l - k)][k] * p\n\nprint(d)\n\n\n\n# Made By Mostafa_Khaled" ]

[ "from functools import reduce\r\nfrom itertools import chain\r\n\r\nn = int(input())\r\nprint(max(map(\r\n max,\r\n reduce(\r\n lambda a, k: reduce(\r\n lambda a, i: reduce(\r\n lambda a, j: list(chain(\r\n a[:i],\r\n [list(chain(\r\n a[i][:j],\r\n [min(a[i][j], a[i][k] + a[k][j])],\r\n a[i][j+1:],\r\n ))],\r\n a[i+1:],\r\n )),\r\n range(n),\r\n a,\r\n ),\r\n range(n),\r\n a,\r\n ),\r\n range(n),\r\n list(map(\r\n lambda i: list(map(int, input().split())),\r\n range(n)))))))\r\n", "rof = \"f\" + \"o\" + \"r\" #0\nfi = \"i\" + \"f\" #1\n\ncode = \"\"\"\ndef floyd(n, c):\n\t{0} k in range(n):\n\t\t{0} j in range(n):\n\t\t\t{0} i in range(n):\n\t\t\t\tc[i][j] = min(c[i][j], c[i][k] + c[k][j])\n\ndef array(s, v = 0, i = 0):\n\t{1} i >= len(s) - 1:\n\t\treturn [v] * s[i]\n\tr = array(s, v, i + 1)\n\treturn [r.copy() {0} i in range(s[i])]\n\nn = int(input())\nc = array([n, n])\n{0} i in range(n):\n\tv = input().split()\n\t{0} j in range(n):\n\t\tc[i][j] = int(v[j])\n\nfloyd(n, c)\n\nm = -1\n{0} i in range(n):\n\t{0} j in range(n):\n\t\tm = max(m, c[i][j])\n\nprint(m)\n\"\"\".format(rof, fi)\n\nexec(code)\n", "from itertools import product\n\ndef read(f=int):\n\treturn map(f,input().split())\n\ndef assign(i,j,v):\n\tadj[i][j] = v\n\n\ndef getinput(i):\n\ts = [*map(int, input().split())]\n\tadj[i] = s\n\ndef transition(p):\n\tk,i,j = p\n\tadj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j])\n\ndef makeadj(i):\n\tadj.append([0]*n)\n\n\nn = int(input())\nadj = []\n[*map(makeadj, range(n))]\n[*map(getinput, range(n))]\n[*map(transition, product(range(n), range(n), range(n)))]\nprint(max(map(max, adj)))", "import binascii\r\nx = binascii.unhexlify(b'6e203d20696e7428696e7075742829290a64203d205b205b5d20666f72206920696e2072616e6765286e29205d0a666f72206920696e2072616e6765286e293a0a20202020645b695d203d206c697374286d617028696e742c20696e70757428292e73706c6974282929290a666f72206b20696e2072616e6765286e293a0a20202020666f72206920696e2072616e6765286e293a0a2020202020202020666f72206a20696e2072616e6765286e293a0a202020202020202020202020645b695d5b6a5d203d206d696e28645b695d5b6a5d2c20645b695d5b6b5d202b20645b6b5d5b6a5d290a616e73203d20300a666f72206920696e20643a0a20202020666f72206a20696e20693a0a20202020202020616e73203d206d617828616e732c206a290a7072696e7428616e7329')\r\nexec(x)", "import base64\r\ng = b'biA9IGludChpbnB1dCgpKQoKZiA9IGxpc3QoKQpmb3IgaSBpbiByYW5nZShuKToKICAgIGYuYXBwZW5kKGxpc3QobWFwKGludCwgaW5wdXQoKS5zcGxpdCgpKSkpCgpmb3IgayBpbiByYW5nZShuKToKICAgIGZvciBpIGluIHJhbmdlKG4pOgogICAgICAgIGZvciBqIGluIHJhbmdlKG4pOgogICAgICAgICAgICBmW2ldW2pdID0gbWluKGZbaV1bal0sIGZbaV1ba10gKyBmW2tdW2pdKQoKYW5zID0gLTEKZm9yIGkgaW4gcmFuZ2Uobik6CiAgICBmb3IgaiBpbiByYW5nZShuKToKICAgICAgICBpZihpICE9IGopOgogICAgICAgICAgICBhbnMgPSBtYXgoYW5zLCBmW2ldW2pdKQoKcHJpbnQoYW5zKQo='\r\nexec(base64.b64decode(g))", "from itertools import product\n\ndef relax(D, t):\n k, i, j = t\n D[i][j] = min(D[i][j], D[i][k] + D[k][j])\n\nN = int(input())\nD = list(map(lambda i:list(map(int, input().split())), range(N)))\nlist(map(lambda t: relax(D, t), product(range(N), range(N), range(N))))\nprint(max(map(max, D)))\n\n\t\t \t \t\t \t\t \t\t \t\t\t \t \t\t", "import sys, itertools, collections\r\nn = int(input())\r\nd = list(map(lambda s: list(map(int, s.split())), sys.stdin.readlines()))\r\ndef assign(t):\r\n k,i,j = t\r\n d[i][j] = min(d[i][j], d[i][k] + d[k][j])\r\ncollections.deque(maxlen=0).extend(map(assign, itertools.product(range(n), **{'taeper'[::-1]:3})))\r\nprint(max(map(max, d)))\r\n", "from itertools import chain\r\n\r\nn = int(input())\r\n\r\ndef func_to_n(func, n=n):\r\n arr = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\r\n arr = arr[:n]\r\n _ = list(map(func, arr))\r\n\r\ndef tight_loop(c):\r\n global dist\r\n dist[b][c] = min(dist[b][c],\r\n dist[b][a] + dist[a][c])\r\n\r\ndef small_loop(bb):\r\n global b\r\n b = bb\r\n func_to_n(tight_loop)\r\n\r\ndef middle_loop(aa):\r\n global a\r\n a = aa\r\n func_to_n(small_loop)\r\n\r\ndef big_loop():\r\n func_to_n(middle_loop)\r\n\r\ndef add_line(ignored):\r\n global dist\r\n dist.append(list(map(int, input().split())))\r\n\r\ndist = []\r\nfunc_to_n(add_line)\r\n\r\nbig_loop()\r\n\r\nprint(max(chain.from_iterable(dist)))", "exec(\"\"\"\r\nn = i@nt(in@put())\r\na = [li@st(m@ap(in@t, in@put().s@plit())) f@or i i@n ra@nge(n)]\r\nf@or k i@n r@ange(n):\r\n f@or i i@n ra@nge(n):\r\n fo@r j i@n ra@nge(n):\r\n a[i][j] = m@in(a[i][j], a[i][k] + a[k][j])\r\nan@s = 0\r\nfo@r i i@n ra@nge(n):\r\n f@or j i@n ra@nge(n):\r\n a@ns = ma@x(an@s, a[i][j])\r\npr@int(a@ns)\r\n\"\"\".replace(\"@\", \"\"))\r\n", "import base64\r\nb = b'biA9IGludChpbnB1dCgpKQphID0gW1swIGZvciBpIGluIHJhbmdlKG4pXSBmb3IgaiBpbiByYW5nZShuKV0KZm9yIGkgaW4gcmFuZ2Uobik6CglhW2ldID0gW2ludCh4KSBmb3IgeCBpbiBpbnB1dCgpLnNwbGl0KCldCmZvciBrIGluIHJhbmdlKG4pOgoJZm9yIGkgaW4gcmFuZ2Uobik6CgkJZm9yIGogaW4gcmFuZ2Uobik6CgkJCWFbaV1bal0gPSBtaW4oYVtpXVtqXSwgYVtpXVtrXSthW2tdW2pdKQphbnMgPSAwCmZvciBpIGluIHJhbmdlKG4pOgoJYW5zID0gbWF4KGFucywgKmFbaV0pCnByaW50KGFucyk='\r\nexec(base64.b64decode(b).decode())", "from itertools import product\n\ndef getinput(i):\n\tadj.append([*map(int, input().split())])\n\ndef transition(p):\n\tk,i,j = p\n\tadj[i][j] = min(adj[i][j], adj[i][k] + adj[k][j])\n\n\nr = range(int(input()))\nadj = []\n[*map(getinput, r)]\n[*map(transition, product(r, r, r))]\nprint(max(map(max, adj)))", "import string\nimport sys\n\nA = string.printable[:-2]\nD = dict(zip(A, reversed(A)))\n\ndef encrypt(s):\n return ''.join(map(lambda c: D[c], s))\n\ndecrypt = encrypt\n\ns = \"\"\"-3h3<-'s<-+&'srr1N3h3dd<-'s#r3?,)3#3<-3<-+&'srm(+/<'srb3?,)3<3<-3)^->@s-rb1?,)3:3<-3)^->@s-rk13333?,)3<3<-3)^->@s-rk133333333?,)3;3<-3)^->@s-rk1333333333333Nd<bd;b3h3.<-sNd<bd:b3p3Nd:bd;bo3Nd<bd;br1+)<-'s.^#s.^#sNd<br3?,)3<3<-3)^->@s-rrr1\"\"\"\nexec(decrypt(s))\n", "def m(a, b):\r\n return min(a, b)\r\nn=int(input())\r\nf=[1]*n\r\ng=[0]*n\r\ntry:\r\n f[0]=[1]*n\r\n g[0]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[1]=[1]*n\r\n g[1]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[2]=[1]*n\r\n g[2]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[3]=[1]*n\r\n g[3]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[4]=[1]*n\r\n g[4]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[5]=[1]*n\r\n g[5]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[6]=[1]*n\r\n g[6]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[7]=[1]*n\r\n g[7]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[8]=[1]*n\r\n g[8]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n f[9]=[1]*n\r\n g[9]=list(map(int,input().split()))\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][0]+g[0][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][0]+g[0][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][0]+g[0][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][0]+g[0][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][0]+g[0][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][0]+g[0][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][0]+g[0][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][0]+g[0][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][0]+g[0][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][0]+g[0][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][1]+g[1][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][1]+g[1][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][1]+g[1][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][1]+g[1][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][1]+g[1][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][1]+g[1][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][1]+g[1][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][1]+g[1][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][1]+g[1][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][1]+g[1][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][2]+g[2][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][2]+g[2][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][2]+g[2][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][2]+g[2][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][2]+g[2][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][2]+g[2][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][2]+g[2][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][2]+g[2][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][2]+g[2][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][2]+g[2][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][3]+g[3][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][3]+g[3][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][3]+g[3][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][3]+g[3][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][3]+g[3][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][3]+g[3][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][3]+g[3][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][3]+g[3][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][3]+g[3][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][3]+g[3][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][4]+g[4][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][4]+g[4][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][4]+g[4][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][4]+g[4][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][4]+g[4][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][4]+g[4][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][4]+g[4][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][4]+g[4][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][4]+g[4][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][4]+g[4][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][5]+g[5][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][5]+g[5][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][5]+g[5][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][5]+g[5][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][5]+g[5][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][5]+g[5][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][5]+g[5][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][5]+g[5][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][5]+g[5][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][5]+g[5][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][6]+g[6][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][6]+g[6][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][6]+g[6][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][6]+g[6][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][6]+g[6][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][6]+g[6][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][6]+g[6][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][6]+g[6][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][6]+g[6][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][6]+g[6][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][7]+g[7][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][7]+g[7][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][7]+g[7][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][7]+g[7][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][7]+g[7][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][7]+g[7][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][7]+g[7][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][7]+g[7][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][7]+g[7][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][7]+g[7][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][8]+g[8][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][8]+g[8][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][8]+g[8][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][8]+g[8][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][8]+g[8][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][8]+g[8][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][8]+g[8][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][8]+g[8][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][8]+g[8][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][8]+g[8][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][0]=m(g[0][0],g[0][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][0]=m(g[1][0],g[1][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][0]=m(g[2][0],g[2][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][0]=m(g[3][0],g[3][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][0]=m(g[4][0],g[4][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][0]=m(g[5][0],g[5][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][0]=m(g[6][0],g[6][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][0]=m(g[7][0],g[7][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][0]=m(g[8][0],g[8][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][0]=m(g[9][0],g[9][9]+g[9][0])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][1]=m(g[0][1],g[0][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][1]=m(g[1][1],g[1][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][1]=m(g[2][1],g[2][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][1]=m(g[3][1],g[3][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][1]=m(g[4][1],g[4][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][1]=m(g[5][1],g[5][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][1]=m(g[6][1],g[6][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][1]=m(g[7][1],g[7][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][1]=m(g[8][1],g[8][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][1]=m(g[9][1],g[9][9]+g[9][1])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][2]=m(g[0][2],g[0][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][2]=m(g[1][2],g[1][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][2]=m(g[2][2],g[2][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][2]=m(g[3][2],g[3][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][2]=m(g[4][2],g[4][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][2]=m(g[5][2],g[5][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][2]=m(g[6][2],g[6][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][2]=m(g[7][2],g[7][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][2]=m(g[8][2],g[8][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][2]=m(g[9][2],g[9][9]+g[9][2])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][3]=m(g[0][3],g[0][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][3]=m(g[1][3],g[1][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][3]=m(g[2][3],g[2][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][3]=m(g[3][3],g[3][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][3]=m(g[4][3],g[4][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][3]=m(g[5][3],g[5][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][3]=m(g[6][3],g[6][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][3]=m(g[7][3],g[7][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][3]=m(g[8][3],g[8][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][3]=m(g[9][3],g[9][9]+g[9][3])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][4]=m(g[0][4],g[0][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][4]=m(g[1][4],g[1][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][4]=m(g[2][4],g[2][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][4]=m(g[3][4],g[3][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][4]=m(g[4][4],g[4][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][4]=m(g[5][4],g[5][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][4]=m(g[6][4],g[6][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][4]=m(g[7][4],g[7][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][4]=m(g[8][4],g[8][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][4]=m(g[9][4],g[9][9]+g[9][4])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][5]=m(g[0][5],g[0][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][5]=m(g[1][5],g[1][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][5]=m(g[2][5],g[2][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][5]=m(g[3][5],g[3][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][5]=m(g[4][5],g[4][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][5]=m(g[5][5],g[5][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][5]=m(g[6][5],g[6][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][5]=m(g[7][5],g[7][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][5]=m(g[8][5],g[8][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][5]=m(g[9][5],g[9][9]+g[9][5])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][6]=m(g[0][6],g[0][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][6]=m(g[1][6],g[1][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][6]=m(g[2][6],g[2][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][6]=m(g[3][6],g[3][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][6]=m(g[4][6],g[4][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][6]=m(g[5][6],g[5][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][6]=m(g[6][6],g[6][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][6]=m(g[7][6],g[7][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][6]=m(g[8][6],g[8][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][6]=m(g[9][6],g[9][9]+g[9][6])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][7]=m(g[0][7],g[0][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][7]=m(g[1][7],g[1][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][7]=m(g[2][7],g[2][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][7]=m(g[3][7],g[3][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][7]=m(g[4][7],g[4][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][7]=m(g[5][7],g[5][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][7]=m(g[6][7],g[6][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][7]=m(g[7][7],g[7][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][7]=m(g[8][7],g[8][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][7]=m(g[9][7],g[9][9]+g[9][7])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][8]=m(g[0][8],g[0][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][8]=m(g[1][8],g[1][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][8]=m(g[2][8],g[2][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][8]=m(g[3][8],g[3][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][8]=m(g[4][8],g[4][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][8]=m(g[5][8],g[5][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][8]=m(g[6][8],g[6][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][8]=m(g[7][8],g[7][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][8]=m(g[8][8],g[8][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][8]=m(g[9][8],g[9][9]+g[9][8])\r\nexcept:\r\n pass\r\ntry:\r\n g[0][9]=m(g[0][9],g[0][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[1][9]=m(g[1][9],g[1][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[2][9]=m(g[2][9],g[2][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[3][9]=m(g[3][9],g[3][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[4][9]=m(g[4][9],g[4][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[5][9]=m(g[5][9],g[5][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[6][9]=m(g[6][9],g[6][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[7][9]=m(g[7][9],g[7][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[8][9]=m(g[8][9],g[8][9]+g[9][9])\r\nexcept:\r\n pass\r\ntry:\r\n g[9][9]=m(g[9][9],g[9][9]+g[9][9])\r\nexcept:\r\n pass\r\nprint(max(map(max, g)))\r\n" ]

[ "read = input\n\nn = int(read())\nc = []\nfor i in range(n):\n a, b, h = map(int, read().split())\n c.append((b, a, h))\nc.append((1e18, 0, 0))\nc.sort()\nc.reverse()\ns, p = [0], [0] * (n + 1)\n\nfor i in range(1, n + 1):\n while c[s[-1]][1] >= c[i][0]:\n s.pop()\n p[i] = p[s[-1]] + c[i][2]\n s.append(i)\nprint(max(p))\n\n\t\t \t \t\t\t \t\t\t \t \t\t \t\t \t\t\t\t", "rings = [(1e9+1, 0, 0)]\r\nn = int(input())\r\nfor i in range(n):\r\n a, b, h = map(int, input().split())\r\n rings.append((b, a, h))\r\nrings.sort(reverse=True)\r\ns = [0]\r\np = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n #se recorre el arreglo s de forma inversa\r\n while rings[s[-1]][1] >= rings[i][0]: \r\n s.pop()\r\n p[i] = p[s[-1]] + rings[i][2]\r\n s.append(i)\r\nprint(max(p))", "import operator\r\nn = int(input()) \r\narr=[]\r\nfor i in range(n):\r\n arr.append([int(element) for element in input().split()])\r\narr = sorted(arr, key=operator.itemgetter(1,0,2), reverse= True) \r\nheigh = [0 for i in range(n)] \r\nseq = [] \r\nfor i in range(n):\r\n while len(seq) > 0 and arr[seq[-1]][0] >= arr[i][1] :\r\n seq.pop()\r\n if len(seq) > 0 :\r\n heigh[i] = heigh[seq[-1]] \r\n heigh[i] += arr[i][2] \r\n seq.append(i)\r\nprint(max(heigh))\r\n", "t = [(9e9, 0, 0)]\r\nn = int(input())\r\nfor i in range(n):\r\n a, b, h = map(int, input().split())\r\n t.append((b, a, h))\r\nt.sort(reverse=True)\r\ns, p = [0], [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n while t[s[-1]][1] >= t[i][0]: s.pop()\r\n p[i] = p[s[-1]] + t[i][2]\r\n s.append(i)\r\nprint(max(p))", "#!/usr/bin/env python3\ndef ri():\n return map(int, input().split())\n\nn = int(input())\n\nr = []\nT = []\nmaxt = -1\nfor i in range(n):\n r.append(list(ri()))\n\nr.sort(key=lambda e: (e[1], e[0]))\n\nT.append([r[0][2], r[0][1]])\nfor i in range(1, n):\n tmp = r[i][2]\n l = len(T)\n for j in range(l):\n if r[i][0] >= T[-1][1]:\n T.append([tmp, r[i][1]])\n break\n else:\n tmp = max(T[-1][0]+r[i][2], tmp)\n T.pop()\n else:\n T.append([tmp, r[i][1]])\n\n\nprint(max(T)[0])\n\n\n" ]

[ "import io, os, sys\r\nfrom collections import deque\r\n\r\npypyin = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ncpyin = sys.stdin.readline\r\ninput = pypyin if 'PyPy' in sys.version else cpyin\r\n\r\ndef strput():\r\n return input().decode() if 'PyPy' in sys.version else input()\r\n\r\n# code starts here\r\n\r\ndef main():\r\n n, k, d = [int(x) for x in input().split()]\r\n root = [int(x) for x in input().split()]\r\n g = [[] for x in range (n + 1)]\r\n for i in range(n - 1):\r\n u, v = [int(x) for x in input().split()]\r\n g[u].append((v, i + 1))\r\n g[v].append((u, i + 1))\r\n\r\n to_keep = [False] * n\r\n del_cnt = n - 1\r\n queue = deque([(x, - 1) for x in root])\r\n vis = set()\r\n ans = []\r\n while queue:\r\n u, par = queue.popleft()\r\n if u in vis: continue\r\n vis.add(u)\r\n for v, idx in g[u]:\r\n if v == par: continue\r\n if v not in vis:\r\n del_cnt -= 1\r\n queue.append((v, u))\r\n else:\r\n ans.append(idx)\r\n\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\ninf = int(1e9)\r\nn, m, d = map(int, input().split())\r\nl = [0] * (n - 1)\r\nr = [0] * (n - 1)\r\ng = [[] for _ in range(n)]\r\n\r\nstation = [int(_) - 1 for _ in input().split()]\r\nfor i in range(n - 1):\r\n l[i], r[i] = map(lambda i : int(i) - 1 , input().split())\r\n g[l[i]].append(i)\r\n g[r[i]].append(i)\r\n\r\nqueue = []\r\ndist = [inf] * n\r\nneed = [True] * (n - 1)\r\nfor i in station:\r\n queue.append(i)\r\n dist[i] = 0\r\ncur = 0\r\nwhile cur < len(queue):\r\n x, cur = queue[cur], cur + 1\r\n for edge in g[x]:\r\n y = l[edge] ^ r[edge] ^ x\r\n if dist[y] > 1 + dist[x]:\r\n dist[y] = 1 + dist[x]\r\n queue.append(y)\r\n need[edge] = False\r\nprint(sum(need))\r\nedgeList = []\r\nfor i in range(n - 1):\r\n if need[i]:\r\n edgeList.append(str(i + 1))\r\nprint(' '.join(edgeList))\r\n", "import math\r\nfrom collections import defaultdict, deque, Counter\r\nfrom sys import stdin\r\nimport heapq\r\ninf = int(1e18)\r\ninput = stdin.readline\r\n\r\nn,k,d = map(int, input().split())\r\nps = [int(i) for i in input().split()]\r\nadj = [[] for i in range (n+1)]\r\nfor i in range (n-1):\r\n u,v = map(int, input().split())\r\n adj[u].append((v,i+1))\r\n adj[v].append((u,i+1))\r\nvisit = [False]*(n+1)\r\nedges = set()\r\nq = deque()\r\nfor p in ps:\r\n q.append(p)\r\n visit[p] = True\r\nwhile len(q)>0:\r\n node = q.popleft()\r\n\r\n for child, i in adj[node]:\r\n if not visit[child]:\r\n visit[child] = True\r\n q.append(child)\r\n edges.add(i)\r\nprint(n-1-len(edges))\r\nans = []\r\nfor i in range (n-1):\r\n if i+1 not in edges:\r\n ans.append(i+1)\r\nprint(*ans) \r\n", "import math\nfrom collections import defaultdict, deque, Counter\nfrom sys import stdin\nimport heapq\ninf = int(1e18)\ninput = stdin.readline\n\nn,k,d = map(int, input().split())\nps = [int(i) for i in input().split()]\nadj = [[] for i in range (n+1)]\nfor i in range (n-1):\n u,v = map(int, input().split())\n adj[u].append((v,i+1))\n adj[v].append((u,i+1))\nvisit = [False]*(n+1)\nedges = set()\nq = deque()\nfor p in ps:\n q.append(p)\n visit[p] = True\nwhile len(q)>0:\n node = q.popleft()\n\n for child, i in adj[node]:\n if not visit[child]:\n visit[child] = True\n q.append(child)\n edges.add(i)\nprint(n-1-len(edges))\nans = []\nfor i in range (n-1):\n if i+1 not in edges:\n ans.append(i+1)\nprint(*ans) \n", "import math\nimport sys\ninput = sys.stdin.readline\ninf = int(1e9)\nn, m, d = map(int, input().split())\nl = [0] * (n - 1)\nr = [0] * (n - 1)\ng = [[] for _ in range(n)]\n\nstation = [int(_) - 1 for _ in input().split()]\nfor i in range(n - 1):\n l[i], r[i] = map(lambda i : int(i) - 1 , input().split())\n g[l[i]].append(i)\n g[r[i]].append(i)\n\nqueue = []\ndist = [inf] * n\nneed = [True] * (n - 1)\nfor i in station:\n queue.append(i)\n dist[i] = 0\ncur = 0\nwhile cur < len(queue):\n x, cur = queue[cur], cur + 1\n for edge in g[x]:\n y = l[edge] ^ r[edge] ^ x\n if dist[y] > 1 + dist[x]:\n dist[y] = 1 + dist[x]\n queue.append(y)\n need[edge] = False\nprint(sum(need))\nedgeList = []\nfor i in range(n - 1):\n if need[i]:\n edgeList.append(str(i + 1))\nprint(' '.join(edgeList))\n", "import sys\r\nfrom collections import deque\r\ndef get_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef get_ints():\r\n return map(int,sys.stdin.readline().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int,sys.stdin.readline().strip().split()))\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\nn,k,d = get_ints()\r\nedges = [True]*(n-1) # True= Unimportant\r\nadj = [[] for _ in range(n)]\r\nvisited = [False]*n\r\n\r\np = [int(x)-1 for x in sys.stdin.readline().strip().split()]\r\n\r\nfor i in range(n-1):\r\n u,v = get_ints()\r\n u-=1\r\n v-=1\r\n adj[u].append([v,i])\r\n adj[v].append([u,i])\r\n\r\n\r\n\r\nq = deque()\r\n\r\nfor i in range(k):\r\n q.append(p[i])\r\n visited[p[i]] = True\r\n\r\nwhile q:\r\n node = q.popleft()\r\n for nbr,idx in adj[node]:\r\n if visited[nbr]:\r\n continue\r\n visited[nbr] = True\r\n edges[idx] = False\r\n q.append(nbr)\r\n\r\nres = []\r\nfor i in range(n-1):\r\n if edges[i]:\r\n res.append(i+1)\r\nprint(len(res))\r\nprint(*res)\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, A, G, d):\r\n g = [[] for i in range(n+1)]\r\n for i in range(n-1):\r\n u, v = G[i]\r\n g[u].append([v, i])\r\n g[v].append([u, i])\r\n keep = [0 for i in range(n-1)]\r\n dist = [float('inf') for i in range(n+1)]\r\n start = [x for x in A]\r\n for x in A:\r\n dist[x] = 0 \r\n I = 1 \r\n while len(start) > 0 and I <= d:\r\n next_s = []\r\n for x in start:\r\n for y, i in g[x]:\r\n if dist[y]==float('inf'):\r\n keep[i] = 1 \r\n dist[y] = I \r\n next_s.append(y)\r\n start = next_s \r\n I+=1 \r\n answer= []\r\n for i in range(n-1):\r\n if keep[i]==0:\r\n answer.append(i+1)\r\n sys.stdout.write(f'{len(answer)}\\n')\r\n answer = ' '.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\nn, k, d = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nG = []\r\nfor i in range(n-1):\r\n u, v = [int(x) for x in input().split()]\r\n G.append([u, v])\r\nprocess(n, A, G, d)", "from collections import deque\nfrom sys import stdin\ninf = int(1e18)\ninput = stdin.readline\n\nif __name__ == '__main__':\n n,k,d = map(int, input().split())\n polices = [int(i) for i in input().split()]\n adj = [[] for i in range (n+1)]\n for i in range (1, n):\n u,v = map(int, input().split())\n adj[u].append((v,i))\n adj[v].append((u,i))\n used = [False]*(n+1)\n path = set()\n frontier = deque()\n for p in polices:\n frontier.append(p)\n used[p] = True\n while len(frontier)>0:\n node = frontier.popleft()\n\n for child, index in adj[node]:\n if not used[child]:\n used[child] = True\n frontier.append(child)\n path.add(index)\n print(n-1-len(path))\n ans = []\n for i in range (1, n):\n if i not in path:\n ans.append(i)\n print(*ans) \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\n\r\nn,k,d = mapi()\r\nplc = list(mapi())\r\ngr = defaultdict(list)\r\nfor i in range(1,n):\r\n u,v = mapi()\r\n gr[u].append([v,i])\r\n gr[v].append([u,i])\r\nq = deque()\r\nfor i in plc:\r\n q.append((i,0))\r\nvis = {}\r\nres = [0]*(n+1)\r\nwhile q:\r\n tmp,par = q.popleft()\r\n if tmp in vis:\r\n continue\r\n vis[tmp] = 1\r\n for item in gr[tmp]:\r\n if item[0] != par:\r\n if item[0] in vis:\r\n res[item[1]] = 1\r\n else:\r\n q.append((item[0],tmp))\r\ncnt = 0\r\nans = []\r\nfor i in range(1,n+1):\r\n if res[i]==1:\r\n cnt+=1\r\n ans.append(i)\r\nprint(cnt)\r\nprint(*ans)" ]

[ "from __future__ import division, print_function\r\nimport sys\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\nimport os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\n#from functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\nn,m,k = mapi()\r\na = list(mapi())\r\na.sort()\r\nmp = []\r\nres = 0\r\nfor i in a:\r\n mp.append(i)\r\n while mp[-1]-mp[0]>=m:\r\n mp.pop(0)\r\n while len(mp)>=k:\r\n mp.pop()\r\n res+=1\r\nprint(res)\r\n", "# region declaration\nfrom collections import *\nfrom functools import *\nfrom math import *\nfrom heapq import *\nfrom itertools import *\nfrom bisect import *\nfrom json 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\")\nMOD = 998244353\n# autopep8: on\n# endregion\n\n\ndef solve():\n n, m, k = inlt()\n alarms = inlt()\n alarms.sort()\n q = deque()\n res = 0\n\n for a in alarms:\n q.append(a)\n while q and a - q[0] > m-1:\n q.popleft()\n if len(q) == k:\n # print(a, q)\n res += 1\n q.pop()\n\n return res\n\n\nt = 1\n# t = inp()\nfor _ in range(t):\n print(solve())\n", "\r\nn,m,k = map(int,input().split())\r\nAlarm = [int(x) for x in input().split()]\r\nringing_now = []\r\nAns = 0\r\nAlarm = list(set(Alarm)) # To remove duplicacy\r\nAlarm.sort()\r\n\r\nfor i in range(n):\r\n # Just append it . Don't Check Now.\r\n ringing_now.append(Alarm[i])\r\n # NOw check two condition.\r\n # 1. if there are more than k alarms ringing now\r\n # 2. and simultaneously diff bw max and min is less than m\r\n if(len(ringing_now)>=k and ringing_now[-1] - ringing_now[len(ringing_now)-k]<m):\r\n ringing_now.pop()\r\n Ans += 1\r\nprint(Ans)\r\n", "n,m,k=map(int,input().split())\r\ncnt=[0]*(10**6+5)\r\nl=[int(i) for i in input().split()]\r\nfor i in l:\r\n cnt[i]+=1\r\nsm=0 \r\nfor i in range(10**6+5):\r\n sm+=cnt[i]\r\n if(i>=m): \r\n sm-=cnt[i-m]\r\n if(sm>=k):\r\n sm-=1 \r\n cnt[i]=0 \r\nprint(n-sum(cnt))\r\n\r\n ", "\ndef read_ints():\n return list(map(int, input().split()))\n\ndef solve(n,m,k,a):\n if k == 1:\n return n\n a.sort()\n # print(f'Solving {n}, {m}, {k}, {a}')\n removed = [False]*n\n start = 0\n count = 1\n result = 0\n for end in range(1,n):\n count += 1\n # print(f' {end}: start = {start} count = {count} result = {result}')\n if a[end]-a[start] < m:\n if count == k:\n removed[end] = True\n result += 1\n count -= 1\n else:\n while start < n and (a[end]-a[start] >= m or removed[start]):\n if not removed[start]:\n count -= 1\n start += 1\n # print(f' {end}: start = {start} count = {count} result = {result}')\n return result\n \n\n\nn,m,k = read_ints()\na = read_ints()\nresult = solve(n,m,k,a)\nprint(result)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import *\r\n\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = [0]*(10**6+100)\r\n\r\nfor ai in a:\r\n t[ai] = 1\r\n \r\nnow = 0\r\nans = 0\r\n\r\nfor i in range(10**6+100):\r\n now += t[i]\r\n \r\n if i>=m:\r\n now -= t[i-m]\r\n \r\n if now==k:\r\n t[i] = 0\r\n now -= 1\r\n ans += 1\r\n\r\nprint(ans)", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\nfrom collections import deque\r\n\r\nn,m,k = map(int,stdin.readline().split())\r\n\r\na = list(map(int,stdin.readline().split()))\r\n\r\na.sort()\r\n\r\nq = deque()\r\n\r\nans = 0\r\n\r\nfor i in a:\r\n q.append(i)\r\n\r\n while len(q) > k:\r\n q.popleft()\r\n\r\n if len(q) == k and q[-1] - q[0] <= m-1:\r\n q.pop()\r\n ans += 1\r\n\r\nprint (ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,m,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nt=[0]*(10**6+1)\r\nfor i in range(n):\r\n t[a[i]]+=1\r\ncnt=0\r\nans=0\r\nfor i in range(10**6+1):\r\n cnt+=t[i]\r\n if i>=m:\r\n cnt-=t[i-m]\r\n if cnt==k:\r\n ans+=1\r\n cnt-=1\r\n t[i]=0\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque\r\n\r\nN,M,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\nans = 0\r\nv = deque([])\r\nfor a in A:\r\n v.append(a)\r\n while len(v)>=K:\r\n #print(v)\r\n if v[-1]-v[0]+1>M:\r\n v.popleft()\r\n else:\r\n v.pop()\r\n ans+=1\r\n \r\nprint(ans)\r\n\r\n", "from collections import deque\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\na.sort()\r\nq = deque()\r\nans = 0\r\nfor i in range(n):\r\n while q and a[i]-q[0] >= m:\r\n q.popleft()\r\n if len(q)+1 >= k:\r\n ans += 1\r\n else:\r\n q.append(a[i])\r\n \r\nprint(ans)\r\n\r\n# https://blog.csdn.net/qq_34826781/article/details/79133952", "from sys import stdin, exit, setrecursionlimit\r\nfrom collections import deque\r\nfrom string import ascii_lowercase\r\nfrom itertools import *\r\nfrom math import *\r\ninput = stdin.readline\r\nlmi = lambda: list(map(int, input().split()))\r\nmi = lambda: map(int, input().split())\r\nsi = lambda: input().strip('\\n')\r\nssi = lambda: input().strip('\\n').split()\r\nmod = 10**9+7\r\n\r\nn, m, k= mi()\r\na = lmi()\r\na.sort()\r\nq = deque()\r\ncnt = 0\r\nfor i in range(n):\r\n q.append(i)\r\n while a and a[q[-1]] - a[q[0]] > m-1:\r\n q.popleft()\r\n while len(q) >= k:\r\n q.pop()\r\n cnt += 1\r\nprint(cnt)", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('YES' if b else 'NO')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn, m, k = II()\r\nimport bisect\r\na = deque(sorted(II()))\r\n#p(a)\r\nif k == 1:\r\n p(n)\r\n exit(0)\r\nres = [a[0]]\r\na.popleft()\r\nwhile a:\r\n z = a.popleft()\r\n index = bisect.bisect_left(res, z-m+1)\r\n if len(res) - index < k-1:\r\n res.append(z)\r\np(n-len(res))\r\n#p(res)\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, m, k):\r\n n = len(A)\r\n if k==1:\r\n return n\r\n A.sort()\r\n remaining = []\r\n removed = []\r\n I = 0\r\n for i in range(n):\r\n ai = A[i]\r\n if len(remaining)==0:\r\n remaining.append(ai)\r\n elif len(remaining)-I <= k-2:\r\n remaining.append(ai)\r\n else:\r\n #len(remaining)-I = k-1\r\n a0 = remaining[I]\r\n if ai-a0 <= m-1:\r\n removed.append(ai)\r\n else:\r\n remaining.append(ai)\r\n I+=1\r\n return len(removed)\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprint(process(A, m, k))" ]

[ "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=lambda a, b: a+b):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n\r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n\r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n\r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n\r\n def __len__(self):\r\n return self._len\r\n\r\n def query(self, start, stop):\r\n \"\"\"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\ndef process(n, k, a, b, Queries):\r\n days = [0 for i in range(n+1)]\r\n S_b = SegmentTree(data=days)\r\n S_a = SegmentTree(data=days)\r\n for query in Queries:\r\n if query[0]==1:\r\n di, ai = query[1], query[2]\r\n S_a[di] = min(S_a[di]+ai, a)\r\n S_b[di] = min(S_b[di]+ai, b)\r\n else:\r\n pi = query[1]\r\n entry = S_b.query(1, pi)+S_a.query(pi+k, n+1)\r\n sys.stdout.write(f'{entry}\\n')\r\n \r\nn, k, a, b, q = [int(x) for x in input().split()]\r\nQueries = []\r\nfor i in range(q):\r\n query = [int(x) for x in input().split()]\r\n Queries.append(query)\r\nprocess(n, k, a, b, Queries)", "N = 4 * 10**5 + 10\r\ns = [[0] * N for i in range(2)]\r\nx, y = [0] * N, [0] * N\r\n\r\ndef modify(q : int, x: int, v: int, n: int) -> None: \r\n while x <= n:\r\n s[q][x] += v\r\n x = (x | (x - 1)) + 1\r\n\r\ndef find_sum(q: int, x: int) -> int:\r\n ret = 0\r\n while x > 0:\r\n ret += s[q][x]\r\n x &= x - 1\r\n return ret\r\n\r\nn, k, a, b, q = map(int, input().split())\r\nfor _ in range(q):\r\n ls = list(map(int, input().split()))\r\n\r\n if ls[0] == 1:\r\n day, cnt = ls[1:]\r\n new_x = min(b, cnt + x[day])\r\n new_y = min(a, cnt + y[day])\r\n\r\n modify(0, day, new_x - x[day], n)\r\n modify(1, day, new_y - y[day], n)\r\n\r\n x[day], y[day] = new_x, new_y\r\n \r\n else:\r\n fr = ls[1]\r\n to = fr + k - 1\r\n ans = find_sum(0, fr - 1)\r\n ans += find_sum(1, n) - find_sum(1, to)\r\n print(ans)", "from functools import reduce\nclass SegmentTree():\n def __init__(self, L, function = lambda x,y: x+y, initilizer = None):\n self.function = function\n self.initilizer = initilizer\n N = self.size = len(L)\n M = 1 << N.bit_length()\n self.margin = 2*M - N\n self.L = [None for i in range(self.margin)] + L\n for i in range(M-1, 0, -1):\n x, y = self.L[i<<1], self.L[i<<1|1]\n self.L[i] = None if x is None or y is None else function(x, y)\n def modify(self, pos, value):\n p = pos + self.margin\n self.L[p] = value \n while p > 1:\n x, y = self.L[p], self.L[p^1]\n if p&1: x, y = y, x\n self.L[p>>1] = None if x is None or y is None else self.function(x, y)\n p>>=1\n def query(self, left, right):\n l, r = left + self.margin, right + self.margin\n stack = []\n void = True\n if self.initilizer is not None:\n void = False\n result = self.initilizer\n while l < r:\n if l&1:\n if void:\n result = self.L[l]\n void = False\n else:\n result = self.function(result, self.L[l])\n l+=1\n if r&1:\n r-=1\n stack.append(self.L[r])\n l>>=1\n r>>=1\n init = stack.pop() if void else result\n return reduce(self.function, reversed(stack), init)\n\nimport sys\nn, k, a, b, q = [int(x) for x in input().split()]\norders = [0]*(n+2)\na_tree, b_tree = SegmentTree(orders, initilizer = 0), SegmentTree(orders, initilizer = 0)\nfor line in sys.stdin:\n s = [int(x) for x in line.split()]\n if s[0] == 1:\n orders[s[1]] += s[2]\n a_tree.modify(s[1], min(a, orders[s[1]]))\n b_tree.modify(s[1], min(b, orders[s[1]]))\n else:\n query = b_tree.query(0, s[1]) + a_tree.query(s[1]+k, n+1)\n print(query)\n", "class FenwickTree:\r\n def __init__(self, size):\r\n self.bit = [0] * (size + 1)\r\n def add(self, x, v):\r\n while x <= len(self.bit) - 1:\r\n self.bit[x] += v\r\n x += x & -x\r\n def sum(self, x):\r\n ret = 0\r\n while x > 0:\r\n ret += self.bit[x]\r\n x -= x & -x\r\n return ret\r\n def range_sum(self, l, r):\r\n return self.sum(r) - self.sum(l - 1)\r\nN, K, A, B, Q = map(int, input().split())\r\ncapA = [0] * (N + 1)\r\ncapB = [0] * (N + 1)\r\ntreeA = FenwickTree(N)\r\ntreeB = FenwickTree(N)\r\nfor _ in range(Q):\r\n op_data = list(map(int, input().split()))\r\n op = op_data[0]\r\n if op == 1:\r\n a, b = op_data[1], op_data[2]\r\n addA = min(A - capA[a], b)\r\n addB = min(B - capB[a], b)\r\n capA[a] += addA\r\n capB[a] += addB\r\n treeA.add(a, addA)\r\n treeB.add(a, addB)\r\n else:\r\n a = op_data[1]\r\n ans = treeB.range_sum(1, a - 1)\r\n ans += treeA.range_sum(a + K, N)\r\n print(ans)# 1691072131.5208688" ]

[ "import sys\r\n\r\nclass SegmTree():\r\n def __init__(self, array=None):\r\n size = len(array)\r\n N = 1\r\n while N < size:\r\n N <<= 1\r\n self.N = N\r\n self.tree = [0] * (2*self.N)\r\n for i in range(size):\r\n self.tree[i+self.N] = array[i]\r\n self.build()\r\n\r\n def build(self):\r\n for i in range(self.N - 1, 0, -1):\r\n self.tree[i] = self.tree[i<<1] + self.tree[i<<1|1]\r\n \r\n def add(self, i, value=1):\r\n i += self.N\r\n while i > 0:\r\n self.tree[i] += value\r\n i >>= 1\r\n \r\n def get_sum(self, l, r):\r\n N = self.N\r\n l += N\r\n r += N\r\n result = 0\r\n while l < r:\r\n if l & 1:\r\n result += self.tree[l]\r\n l += 1\r\n if r & 1:\r\n r -= 1\r\n result += self.tree[r]\r\n l >>= 1\r\n r >>= 1\r\n return result\r\n \r\n def find_kth_nonzero(self, k):\r\n i = 1\r\n if k < 1 or k > self.tree[1]:\r\n return -1\r\n while i < self.N:\r\n i <<= 1\r\n if self.tree[i] < k:\r\n k -= self.tree[i]\r\n i |= 1\r\n return i - self.N\r\n\r\nreader = (line.rstrip() for line in sys.stdin)\r\ninput = reader.__next__\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\n\r\nord_p = [0] * n\r\nord_q = [0] * n\r\n\r\nst = SegmTree([1] * n)\r\nfor i, val in enumerate(p):\r\n ord_p[i] = st.get_sum(0, val)\r\n st.add(val, -1)\r\n\r\nst = SegmTree([1] * n)\r\nfor i, val in enumerate(q):\r\n ord_q[i] = st.get_sum(0, val)\r\n st.add(val, -1)\r\n\r\ntransfer = 0\r\nfor i in range(n-1, -1, -1):\r\n radix = n-i\r\n ord_p[i] = ord_p[i] + ord_q[i] + transfer\r\n if ord_p[i] < radix:\r\n transfer = 0\r\n else:\r\n transfer = 1\r\n ord_p[i] -= radix\r\n\r\nst = SegmTree([1] * n)\r\nfor i in range(n):\r\n k = ord_p[i] + 1\r\n ord_q[i] = st.find_kth_nonzero(k)\r\n st.add(ord_q[i], -1)\r\n\r\nprint(*ord_q)\r\n" ]

[ "s = input()\nans = set()\n\nfor l in range(len(s)):\n t = s[l:] + s[:l]\n ans.add(t)\n\nprint(len(ans))", "#CF YL1\r\ns=input()\r\nc={s}\r\ndef cyc(s2):return s2[-1]+s2[:-1]\r\nfor i in range(len(s)):\r\n s=cyc(s)\r\n c.add(s)\r\nprint(len(c))\r\n", "original = input()\r\ns = original\r\nres = 1\r\nwhile original != s[-1] + s[:-1]:\r\n res += 1\r\n s = s[-1] + s[:-1]\r\nprint(res)\r\n\r\n", "s=input()\r\na=[s[i:]+s[:i] for i in range(len(s))]\r\nprint(len(set(a)))\r\n", "n = input()\r\ndata = []\r\ncounter = 0\r\nfor i in range(len(n)) : \r\n n = n[-1] + n[0 :-1 ]\r\n if n not in data : \r\n data.append(n)\r\n counter+=1\r\nprint(counter)", "s=input()\ntool=len(s)-1\ntmp={s:1}\nans=1\nfor i in range(tool,0,-1):\n s=s[tool]+s[:tool]\n if tmp.get(s,-1)==-1:\n tmp[s]=1\n ans+=1\nprint(ans)\n'''\nabcd\ndabc\ncdab\nbcda\nabcd\n'''", "s=input()\r\nd={s:0}\r\nfor i in range(len(s)):\r\n\ts=s[-1]+s[:-1]\r\n\td[s]=d.get(s,0)+1\r\nprint(len(d.keys()))\r\n", "s = list(input())\r\n\r\nwords = []\r\nwords.append(\"\".join(s))\r\n\r\nfor a in range(len(s)):\r\n s.insert(0, s[-1])\r\n s.pop(-1)\r\n words.append(\"\".join(s))\r\n\r\nprint(len(set(words)))\r\n", "w = input()\r\ns = set()\r\nn = len(w)\r\ns.add(w)\r\nfor i in range(n-1):\r\n w = w[1:] + w[0]\r\n s.add(w)\r\nprint(len(s))", "a = input()\r\nb = []\r\nk = 0\r\nt = False\r\nn = len(a)\r\ntemp = \"\"\r\nfor i in range(n):\r\n for j in b:\r\n if j == a:\r\n t = True\r\n if not t:\r\n k += 1\r\n b.append(a)\r\n temp = a\r\n a = \"\" + temp[n-1] + temp[0:n-1]\r\n t = False\r\nprint(k)", "t=input()\r\n\r\nu=[t]\r\np=1\r\n\r\nfor k in range(len(t)):\r\n s=t[len(t)-1]+t[:len(t)-1]\r\n if s not in u:\r\n p+=1\r\n u.append(s)\r\n t=s\r\n else:\r\n pass\r\n\r\n\r\nprint(p)\r\n \r\n \r\n", "import sys\r\n\r\ns = input()\r\ndef foo(x) :\r\n\tglobal s \r\n\ty = x[-1] + x[:len(x)-1] \r\n\tif s == y : return 1\r\n\treturn foo(y) + 1\r\nprint(foo(s))\r\n", "import sys\r\n\r\nimport math\r\n\r\n#sz, x = [int(i) for i in input().split()]\r\n#ar = [int(i) for i in input().split()]\r\nst=str(input())\r\n\r\nmp={}\r\n\r\nfor i in range(len(st)+2):\r\n st=st[1:]+st[0]\r\n #print(st)\r\n mp[st]=1\r\nprint(len(mp))", "l=list(input())\r\ns=\"\".join(l)\r\nd=[]\r\nd.append(s)\r\nfor i in range(len(l)):\r\n\tl.append(l[0])\r\n\tl.pop(0)\r\n\ts=\"\".join(l)\r\n\tif s not in d:\r\n\t\td.append(s)\r\nprint(len(d))", "s = input()\r\nn = len(s)\r\ns += s\r\ndl = len(s)\r\nd = set()\r\nans = 0\r\nfor i in range(dl - n):\r\n str = s[i : i + n ]\r\n if not str in d:\r\n ans += 1\r\n d.add(str)\r\nprint(ans)\r\n", "def shift(n):\n a=[]\n c=''\n for i in range(len(n)):\n a+=n[i]\n b=a[-1]\n for i in range(len(a)-1):\n b+=a[i]\n for i in range(len(b)):\n c+=b[i]\n return c\nword=input()\na=[word]\nfor i in range(len(word)):\n word=shift(word)\n if word in a:\n continue\n else:\n a+=[word]\n \nprint(len(a))\n \n", "n=input()\r\nv=''\r\nlst=[]\r\nlst1=[]\r\nfor i in n:\r\n lst.append(i)\r\nwhile(True):\r\n lst.append(lst[0])\r\n lst.remove(lst[0])\r\n for j in lst:\r\n v+=j\r\n if(v not in lst1):\r\n lst1.append(v)\r\n v=''\r\n else:\r\n break\r\nprint(len(lst1))\r\n", "s, v = input(), set()\r\nwhile s not in v:\r\n v.add(s)\r\n s = s[-1] + s[:-1]\r\nprint(len(v))", "def main():\r\n dict = {}\r\n s = input()\r\n f = len(s)\r\n s = s*f\r\n for i in range(f):\r\n dict[s[i:i+f]] = 1\r\n print(len(dict))\r\n\r\nmain()", "a, b = input(), []\r\nfor i in range(len(a)):\r\n if a not in b:\r\n b.append(a)\r\n a = a[1:] + a[0]\r\nprint(len(b))", "a = str(input())\r\nb = []\r\nc = len(a)\r\nfor i in range(c):\r\n a = a[c-1:c] + a[0:c-1]\r\n b.append(a[c-1:c] + a[0:c-1])\r\nprint(len(set(b)))\r\n", "a=input()\nb=list()\nb.append(a)\nc=''\nfor i in range(len(a)-1):\n c=a[len(a)-1]+a[0:len(a)-1]\n if c not in b:\n b.append(c)\n pass\n a=c\n pass\nprint(len(b))\n\t\t \t\t \t \t\t \t\t \t \t\t\t\t \t \t\t\t", "\nword = input()\ncyclone = word\n\ncount = 0\nwhile True:\n count += 1\n cyclone = cyclone[-1] + cyclone[:-1]\n if word == cyclone:\n break\nprint(count)\n", "x=list(input())\r\ny=[]\r\ny=x\r\nj=0\r\na=[]\r\nwhile x!=a:\r\n a=[]\r\n a.append(y[len(y)-1])\r\n i=0\r\n while i<len(y)-1:\r\n a.append(y[i])\r\n i=i+1\r\n y=a\r\n j=j+1\r\n\r\nprint(j)", "s = input()\r\nd = {}\r\nans = 1\r\nd[s] = 1\r\nfor i in range(len(s)):\r\n s = s[-1] + s[0:-1]\r\n if (s not in d):\r\n d[s] = 1\r\n ans += 1\r\nprint(ans)", "s=input()\r\nx=[s[i:]+s[:i] for i in range(len(s))]\r\nprint(len(set(x)))", "s = input()\nres = set()\nfor i in range(100):\n res.add(s)\n s = s[-1] + s[:-1]\nprint(len(res))", "x=input()\r\nl=[x]\r\nx=list(x)\r\nfor i in range(len(x)-1):\r\n x.insert(0,x.pop())\r\n if not ''.join(x) in l:\r\n l.append(''.join(x))\r\nprint(len(l))", "a = input()\r\nb = []\r\nfor i in range(len(a)+1):\r\n included = False\r\n for j in range(len(b)):\r\n if b[j] == a:\r\n included = True\r\n break\r\n if included == False:\r\n b.append(a)\r\n a = a[len(a)-1] + a[:len(a)-1]\r\nprint(len(b))", "a = input()\na = list(a)\n\n\ndef move(a):\n k = a[0]\n for i in range(len(a) - 1):\n a[i] = a[i + 1]\n a[-1] = k\n return a\n\n\n\nres = 1\ns = set()\ns.add(''.join(a))\nfor i in range(len(a) + 1):\n a = move(a)\n if ''.join(a) not in s:\n res += 1\n s.add(''.join(a))\nprint(res)", "x=input();p={x}\r\nfor i in range(len(x)-1):\r\n\tx=x[-1]+x[:len(x)-1]\r\n\tp.add(x)\r\nprint(len(p))", "x=input()\r\ny=x\r\n\r\ni=0\r\n\r\na=[]\r\na.append(y)\r\nwhile i<len(x):\r\n y=y[len(x)-1]+y[0:len(x)-1]\r\n \r\n a.append(y)\r\n i+=1\r\n \r\n \r\nprint(len(set(a)))\r\n", "class CyclicShifter:\n def calculate(self, source_string):\n length = len(source_string)\n uniqs = set()\n shifted = source_string[-1] + source_string[:-1]\n for i in range(0, length):\n uniqs.add(shifted)\n shifted = shifted[-1] + shifted[:-1]\n\n return len(uniqs)\n\nif __name__ == \"__main__\":\n source_string = input()\n shifter = CyclicShifter()\n print(shifter.calculate(source_string))", "s=input().strip()\r\nsss=set()\r\nfor x in range(len(s)):\r\n sss.add(s[x:]+s[:x])\r\n\r\nprint(len(sss))", "s=input()\r\narr=[]\r\nfor i in range(len(s)):\r\n s=s[1:]+s[0]\r\n arr.append(s)\r\nprint(len(set(arr)))", "word = input()\r\na = []\r\nfor i in range(len(word)):\r\n if word not in a:\r\n a.append (word)\r\n word = word[-1]+word[0:-1]\r\n\r\nprint(len(a))\r\n", "string = input()\r\na = []\r\nfor _ in range(len(string)):\r\n a.append(string)\r\n string = string[-1]+string[:-1]\r\nprint(len(set(a)))", "s = input()\r\nt = set()\r\nN = len(s)\r\nt.add(s)\r\nfor i in range(N):\r\n s = s[1:] + s[0]\r\n t.add(s)\r\n\r\nprint(len(t))\r\n", "def solve(s):\r\n return len(set(s[i:] + s[:i] for i in range(len(s))))\r\n\r\ns = input()\r\nprint(solve(s))", "def cyclic_shift_right(word, shift):\r\n length = len(word)\r\n shift = shift % length\r\n shifted_word = word[length - shift:] + word[:length - shift]\r\n return shifted_word\r\n\r\nimport sys\r\nj = sys.stdin.readline().strip()\r\np=[]\r\nfor i in range(1,len(j)+1):\r\n k=cyclic_shift_right(j,i)\r\n if k not in p: p.append(k)\r\nprint(len(p))", "s = input()\nn = len(s)\nS = {s}\nfor i in range(n):\n s = s[-1] + s[:-1]\n S.add(s)\nprint(len(S))\n", "s=input()\r\nsss=set()\r\nfor i in range(len(s)):\r\n ss=s[i:]+s[:i]\r\n sss.add(ss)\r\nprint(len(sss))\r\n", "def solve():\n global s\n\n x = set([s])\n for i in range(len(s)):\n s = s[-1] + s[:-1]\n x.add(s)\n return len(x)\n\n\n\ndef main():\n global s\n s = input()\n print(solve())\n\n\nmain()\n", "s=input()\r\na=set()\r\nfor i in range(len(s)):\r\n s=s[-1]+s[:len(s)-1]\r\n a.add(s)\r\nprint(len(a))", "s = input()\r\nss = set()\r\nfor i in range(len(s)):\r\n ss.add(s[i:] + s[:i])\r\nprint(len(ss))\r\n", "s = input()\r\nmyset = set()\r\nmyset.add(s)\r\nfor _ in range(len(s)):\r\n s = s[1:] + s[0]\r\n myset.add(s)\r\nprint(len(myset))", "s = input()\r\nsnew = s+\"#\"\r\nlist = []\r\nfor i in range (len(snew)):\r\n if (snew[i:-1]+snew[0:i]) not in list:\r\n list.append(snew[i:-1]+snew[0:i])\r\nprint(len(list))", "n = input()\r\nl = []\r\nfor i in range(len(n)):\r\n n = n[-1] + n[:-1]\r\n if n in l :\r\n continue\r\n else :\r\n l.append(n)\r\nprint(len(l))\r\n", "s=input()\r\ni=0\r\nt=[s]\r\nj=1\r\np=len(s)\r\nfor i in range(p):\r\n s=s[p-1]+s[0:(p-1):1]\r\n if s not in t:\r\n t.append(s)\r\n j+=1\r\nprint(j)", "a = set()\r\nstring = input()\r\nfor i in range(len(string)):\r\n string = string[-1] + string[:-1]\r\n a.add(string)\r\nprint(len(a))", "def rotate(l, n):\r\n return ' '.join(l[n:] + l[:n])\r\n\r\n\r\nword = list(input())\r\nset_of_words = set()\r\nfor i in range(len(word)):\r\n set_of_words.add(rotate(word, i))\r\nprint(len(set_of_words))\r\n", "# w=list(map(int,input().split()\nw= input()\ndifferen = []\ndifferen.append(w)\nfor a in w:\n w=w[len(w)-1]+w\n w=w[:len(w)-1]\n differen.append(w) if w not in differen else True\nprint(len(differen))\n", "text = input()\r\nwords = set()\r\nfor i in range(len(text)):\r\n words.add(text[i:] + text[:i])\r\nprint(len(words))\r\n", "x = input()\r\na = set()\r\na.add(x)\r\nfor i in range(len(x)):\r\n y = x[len(x)-1] + x[:-1]\r\n a.add(y)\r\n x = y\r\nprint (len(a))\r\n", "l=list(input())\r\ns=set()\r\nfor i in range(len(l)):\r\n t=l[i:][:]\r\n for x in l[:i]:\r\n t+=[x]\r\n s|={tuple(t)}\r\n\r\nprint(len(s))", "def res(a):\r\n b = a[-1]\r\n a = a[:-1]\r\n a = b + a\r\n return a\r\na = str(input())\r\nans = 1\r\nb = []\r\nb.append(a)\r\nfor i in range(len(a)-1):\r\n a = res(a)\r\n if a not in b: ans += 1; b.append(a)\r\nprint(ans)", "w = []\r\ns = input()\r\nw.append(s)\r\nwordlength = len(s)\r\ns = s+s[0:wordlength-1]\r\nfor i in range(1,wordlength):\r\n\tword=s[i:i+wordlength]\r\n\tif word not in w:\r\n\t\tw.append(word)\r\nprint(len(w))\r\n", "n = str(input())\r\nt = [0]*(len(n))\r\nj = 0\r\nfor i in range(len(n)):\r\n t[j] = n[len(n) - 1] + n[:len(n) - 1]\r\n n = t[j]\r\n j+=1\r\nx = set(t)\r\nprint(len(x)) ", "s = str(input())\r\nn = len(s)\r\ns = s + s\r\nst = set()\r\nfor i in range(n):\r\n st.add(s[i:i + n - 1])\r\nprint(len(st))\r\n", "from copy import copy\r\ns=input()\r\nused=[]\r\nused.append(s)\r\np=1\r\nfor i in range(len(s)):\r\n s=s[len(s)-1]+s[:-1:]\r\n if s not in used:\r\n p+=1\r\n used.append(s)\r\nprint(p)", "word = list(input())\r\n\r\ncomb = []\r\nfor i in range(len(word)):\r\n\tl = word[-1]\r\n\tdel word[-1]\r\n\tword = [l] + word\r\n\tstr1 = ''.join(word)\r\n\tcomb.append(str1)\r\n\r\nprint(len(set(comb)))", "a=input()\r\nprint(len(set([a[x:]+a[:x]for x in range(len(a))])))", "s = input()\r\na = set()\r\nn = len(s)\r\ns += s\r\nfor i in range(n):\r\n a.add(s[i:n + i])\r\nprint(len(a))\r\n", "s = input()\r\ncount = 0\r\ns1 = set()\r\n\r\nwhile s not in s1:\r\n count += 1\r\n s1.add(s)\r\n s = s[-1] + s[:-1]\r\n \r\nprint(count)", "s=input()\r\nset1={s}\r\nfor i in range(0,len(s)):\r\n s=s[-1]+s[0:-1]\r\n set1.add(s)\r\nprint(len(set1))", "s = input()\r\nA = []\r\nfor i in range(len(s)):\r\n A.append(s)\r\n s = s[-1] + s[:-1]\r\nq = set(A)\r\nq = list(q)\r\nprint(len(q))\r\n \r\n \r\n", "str=input();\r\nl=len(str);\r\nm={};\r\nfor i in range(1,l+1):\r\n\tch=str[l-1:l];\r\n\tst=str[0:l-1];\r\n\tch+=st;\r\n\tif (not(ch in m)):\r\n\t\tm[ch]=1;\r\n\t#print(ch)\r\n\tstr=ch;\r\nprint(len(m));", "def shift(s):\n letters = list(s)\n return letters[len(s) - 1] + \"\".join(letters[0:len(s) - 1])\n\n\ns = input()\nd = set()\nwhile s not in d:\n d.add(s)\n s = shift(s)\n\nprint(len(d))\n", "word = input()\r\nwords = set()\r\nwords.add(word)\r\nfor i, letter in enumerate(word):\r\n i += 1\r\n new_word = word[-i:] + word[:-i]\r\n words.add(new_word)\r\nprint(len(words))", "s = list(input())\r\ni = 0\r\nres = []\r\nwhile i < len(s):\r\n s.insert(0, s.pop(-1))\r\n ss = \"\".join(s)\r\n if ss not in res:\r\n res.append(ss)\r\n i += 1\r\nprint(len(res))", "s = str(input())\r\nn = len(s)\r\ns = s + s\r\ntemp = set()\r\nfor i in range(n):\r\n temp.add(s[i:i + n])\r\nprint(len(temp))\r\n", "n=input()\r\nl=[]\r\nfor i in range(len(n)):\r\n l.append(n[i])\r\n\r\nfor i in range(len(n)):\r\n a=l.pop()\r\n l.insert(0,a)\r\n if (\"\".join( j for j in l))==n:\r\n print(i+1)\r\n break", "big_lst = []\n\ns = input()\nbig_lst.append(s)\nlen_s = len(s)\nfor i in range(len_s):\n#\tprint(s)\n\ts = s[-1] + s[:-1]\n\tif s not in big_lst:\n\t\tbig_lst.append(s)\nprint(len(big_lst))\n", "str = input()\r\ncycle = set()\r\nfor i in range(0, len(str)):\r\n cycle.add(str[i:] + str[:i])\r\nprint(len(cycle))\r\n", "s = input()\r\nstrings = []\r\nstrings.append(s)\r\ni = 0\r\nwhile i < len(s):\r\n s = s[1:] + s[0]\r\n if s not in strings:\r\n strings.append(s)\r\n i = i + 1\r\n \r\nprint(len(strings))\r\n \r\n \r\n ", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\ns = input()\r\nstrs = set()\r\nfor i in range(len(s)):\r\n strs.add(s[-i:] + s[:-i])\r\nprint(len(strs))\r\n", "s = input()\r\nn = len(s)\r\nwords={}\r\ns1=s+s\r\ncounter=0\r\nfor i in range(len(s)):\r\n words[s1[i:i+n]]=1\r\n \r\nprint(len(words))", "s=input()\nS=set()\nfor _ in range(len(s)):\n\tS|={s}\n\ts=s[1:]+s[0]\nprint(len(S))\n", "s = input()\r\nss = set()\r\nfor i in range(len(s)):\r\n a = s[-1]+s[0:-1]\r\n ss.add(a)\r\n s = a\r\n\r\n\r\nprint(len(ss))", "from collections import *\r\n\r\nA = deque(list(input()))\r\n\r\nS = set()\r\n\r\nfor i in range(len(A) + 1):\r\n S.add(\"\".join(A))\r\n A.appendleft(A.pop())\r\n \r\nprint(len(S)) ", "def solve(s):\n arr = set()\n arr.add(s)\n for i in s:\n s = s[-1]+s[:-1]\n arr.add(s)\n\n return len(arr)\ndef main():\n s = input()\n print(solve(s))\n\nmain()\n", "string = input()\r\na = set()\r\nfor i in range(len(string)):\r\n a.add(string[i:] + string[:i])\r\nprint(len(a))\r\n\r\n", "s = input().strip()\r\nn = len(s)\r\n\r\n# Generate all possible cyclic shifts\r\nshifts = [s[i:] + s[:i] for i in range(n)]\r\n\r\n# Add shifts to a set to remove duplicates\r\ndistinct_shifts = set(shifts)\r\n\r\n# Return the size of the set as the answer\r\nprint(len(distinct_shifts))\r\n", "s = input()\r\nx = False\r\nss = \"\"\r\nif s.count(s[0]) == len(s):\r\n print(1)\r\n x = True\r\nelse:\r\n for i in s:\r\n ss += i\r\n if s.count(ss) * len(ss) == len(s):\r\n print(len(ss))\r\n x = True\r\n break\r\nif x == False:\r\n print(len(s))", "b = list(input())\r\nl = []\r\nfor _ in range(len(b)):\r\n\tb.insert(0,b[-1])\r\n\tb.pop()\r\n\tl.append(\"\".join(b))\r\nprint(len(set(l)))\r\n\r\n", "\r\nR = lambda:map(int,input().split())\r\n\r\nval = input()\r\nans = set()\r\nfor i in range(len(val)):\r\n s = val[i:] + val[:i]\r\n if s not in ans:\r\n ans.add(s)\r\n \r\nprint(len(ans))\r\n\r\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"output2.out\",\"w\")\r\nS=input()\r\nL=[]\r\nfor i in range(len(S)):\r\n\tL.append(S[i:]+S[:i])\r\nprint(len(set(L)))", "s = input()\r\nk = set()\r\nfor i in range(len(s)):\r\n s = s[-1] + s[:-1]\r\n k.add(s)\r\nprint(len(k))\r\n", "def main_function():\r\n s = input()\r\n hash_table = {}\r\n for i in range(len(s)):\r\n s = s[-1] + s[:-1]\r\n if not s in hash_table:\r\n hash_table[s] = 1\r\n return len(hash_table)\r\n\r\n\r\n\r\nprint(main_function())", "s = input()\nfor i in range(1, len(s)+1):\n if s == s[i:]+s[:i]:\n print(i)\n break\n", "from collections import Counter\r\ns=input()\r\ni=len(s)-1\r\nh=i+1\r\nx=s\r\nans=0\r\nr=set()\r\nwhile i>=0:\r\n x=s[i]+x\r\n x=x[:h]\r\n r=r|{x}\r\n #print(x)\r\n i-=1\r\n\r\nprint(len(r))", "count={}\nstr=input()\ncount[str]=1\nl=(len(str))\nfor i in range(l):\n str=str[-1]+str[0:l-1]\n count[str]=(count.get(str,0))\nprint(len(count))\n \t\t \t\t\t \t\t \t \t \t\t\t", "def main():\r\n s = input(); length = len(s); s += s; was = set()\r\n for i in range(length): was.add(s[i:length+i])\r\n print(len(was))\r\nmain()", "s = input()\r\ncs= set()\r\nfor i in range(len(s)):\r\n s = s[-1] + s[:-1]\r\n cs.add(s)\r\nprint(len(cs))\r\n", "s = input()\r\nprint(len(set([s[i:] + s[:i] for i in range(len(s),0,-1)])))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\ns = input()\r\nn = len(s)\r\nv = set()\r\nfor i in range(n): \r\n t = s[1:n]+s[0]\r\n v.add(t)\r\n s = t\r\nprint(len(v))", "a=input()\r\no=1\r\na1=a+''\r\na=a[len(a)-1]+a[0:len(a)-1]\r\nwhile a!=a1:\r\n a=a[len(a)-1]+a[0:len(a)-1]\r\n o+=1\r\nprint(o)\r\n", "s=input()\r\nfor i in range(1,len(s)//2+1):\r\n\tif s.count(s[:i])*i==len(s):\r\n\t\tprint(i)\r\n\t\tbreak\r\nelse:print(len(s))", "\r\nn = input()\r\nmemo = set()\r\ni = len(n)\r\n\r\nwhile i > 0:\r\n x = n[len(n)-1] + n[:len(n)-1]\r\n n = x\r\n if x not in memo:\r\n memo.add(x)\r\n i -= 1\r\n\r\nprint(len(memo))", "c=1;\r\nd = input(\"\")\r\nr = d[-1] + d[0:-1]\r\nwhile r != d:\r\n r = r[-1] + r[0:-1]\r\n c += 1\r\nprint(c);", "s = input()\r\nans = set()\r\nn = len(s)\r\nfor i in range(n):\r\n ch = s[len(s)-1]\r\n s = s[:len(s)-1]\r\n s = ch + s\r\n ans.add(s)\r\nprint(len(ans))", "s = input()\r\nl = len(s)\r\nks = []\r\nfor i in range(1,l):\r\n if l%i==0:\r\n ks.append(i)\r\n\r\nres = len(s)\r\nfor k in ks:\r\n\tif s[:k]*(int(len(s)/k))==s:\r\n\t\tres = k\r\n\t\tbreak\r\nprint(res)", "s = input()\r\ns1 = s\r\ns2 = \"\"\r\ncou = 0\r\nwhile s2 != s1:\r\n s3 = s[0:len(s) - 1]\r\n s2 = s[-1] + s3\r\n cou += 1\r\n s = s2\r\nprint(cou)", "s = input()\r\nn = len(s)\r\nresult = set()\r\nfor i in range(n):\r\n result.add(s[i:] + s[:i])\r\nprint(len(result))", "a=input()\ns=set()\nfor i in range(len(a)):\n a=a[-1]+a[:-1]\n s.add(a)\nprint(len(s))\n", "def Main():\r\n s = input()\r\n st = set()\r\n\r\n # print(s[:2])\r\n\r\n for i in range(len(s)):\r\n # print(s[i:] , s[:i])\r\n ss = s[i:] + s[:i]\r\n # print(ss)\r\n st.add(ss)\r\n\r\n print(len(st))\r\n\r\n\r\nif __name__ == '__main__':\r\n Main()", "from collections import Counter\r\ns = input()\r\ncounter = Counter()\r\nfor i in range(len(s)):\r\n counter[s[i:len(s)] + s[0:i]] = 1\r\nprint(sum(counter.values()))", "s = input()\nn = len(s)\nword_set = set()\nword_set.add(s)\nfor i in range(n-1):\n s = s[-1] + s[:n-1]\n word_set.add(s)\nprint(len(word_set))", "s = input()\r\nn = len(s)\r\ns = s + s\r\nprint(len(set(s[i:i+n] for i in range(n))))", "a = str(input())\nb=list(a)\ni=0\nfor h in range(len(a)):\n c=b\n g=c[len(c)-1]\n c.pop(len(c)-1)\n c.insert(0,g)\n h = \"\".join(c)\n i+=1\n if h == a:\n break\nprint(i)\n\n \t\t \t \t \t\t \t \t \t\t \t \t \t", "a=input()\r\nc=1\r\nz=a[-1]+a[:len(a)-1]\r\nwhile(z!=a):\r\n\tz=z[-1]+z[:len(z)-1]\r\n\tc+=1\r\nprint(c)", "from collections import deque\r\n\r\narr = deque(input())\r\nres = set()\r\nres.add(arr.__str__())\r\nfor i in range(len(arr)):\r\n arr.rotate(1)\r\n res.add(arr.__str__())\r\n \r\nprint(len(res))", "import sys, math, string, fractions, functools, collections, copy\nsys.setrecursionlimit(10**7)\nRI=lambda x=' ': list(map(int,input().rstrip().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-14\nMAX=1010\n#################################################\ns=input().rstrip()\nd={}\nfor i in range(len(s)):\n d[s[i:]+s[:i]]=0\nprint(len(d))\n", "# CF 745/A\n# 900\n\ndef f(s):\n a = set()\n for i in range(len(s)):\n x = s[i:] + s[:i]\n assert len(x) == len(s)\n a.add(x)\n return len(a)\n\nassert f(\"abcd\") == 4\nassert f(\"bbb\") == 1\n\ns = input()\nans = f(s)\nprint(ans)\n", "linea = input()\r\nlin = list(linea)\r\nc=0\r\nrep = []\r\n\r\nfor l in lin:\r\n faux = True\r\n ult = lin[len(lin)-1]\r\n ini = lin[0]\r\n lin.insert(0,ult)\r\n lin.pop(len(lin)-1)\r\n s = ''.join(lin) \r\n\r\n for el in rep:\r\n if s == el:\r\n faux = False\r\n if faux:\r\n if s != linea:\r\n c = c+1\r\n rep.append(s)\r\nprint(c+1)", "s = input()\r\na = []\r\nfor i in range(len(s)):\r\n s = s[-1] + s[:-1]\r\n a.append(s)\r\n \r\na = set(a)\r\nprint(len(a))\r\n\r\n\r\n", "t = input()\r\nn = len(t)\r\nt = t*2\r\ncount=0\r\nsset = set()\r\nfor i in range(n):\r\n if t[i:i+n] not in sset:\r\n sset.add(t[i:i+n])\r\n count += 1\r\n\r\nprint(count)", "s = input().strip()\r\nst = set()\r\n\r\nfor i in range(51):\r\n st.add(s)\r\n s = s[-1]+s[:-1]\r\n \r\nprint(len(st))", "s = input()\r\nln = len(s)\r\ns += s\r\nst = set()\r\nans = 0\r\nfor i in range(ln):\r\n if s[i:ln+i] not in st:\r\n ans += 1\r\n st.add(s[i:ln+i])\r\nprint(ans)\r\n", "s, lst, count = input(), [], 0\r\n\r\nfor i in range(len(s)):\r\n if s not in lst:\r\n count += 1\r\n lst.append(s)\r\n s = s[-1] + s[:-1]\r\n\r\nprint(count)", "string=input()\ncycle={string:1}\ncomp=string\nfor x in range(len(string)):\n comp=comp[1:]+comp[0]\n if comp not in cycle:\n cycle[comp]=1\nprint(len(cycle))\n\n\t \t\t\t\t\t\t\t \t\t \t\t \t\t \t\t", "text = input()\r\nl = len(text)\r\ntext += text\r\nallwords = set()\r\n\r\nfor i in range(l):\r\n\ts = text[i:i+l]\r\n\tallwords.add(s)\r\n\r\nprint(len(allwords))", "#Amirhossein Alimirzaei\r\n#@HajLorenzo\r\n\r\n_=input()\r\n__=len(_)\r\n___=_\r\n____=0\r\nwhile(True):\r\n __-=1\r\n _____=_[__:len(_)]+_[0:__]\r\n if _____==_:\r\n print(____+1)\r\n exit()\r\n ____+=1", "\r\nk=list(input())\r\nl=[]\r\nz=0\r\nfor i in k:\r\n l.append(i)\r\ni=1\r\nwhile i<=50:\r\n r=k.pop()\r\n k=[r]+k\r\n\r\n\r\n z=z+1\r\n if l==k:\r\n break\r\n i=i+1\r\nprint(z)\r\n", "s = input()\n\nspell_set = set()\nfor i in range(len(s)):\n spell_set.add(s[i:] + s[:i])\nprint(len(spell_set))\n", "s = str(input())\r\ndef extract(index):\r\n result = ''\r\n for j in range(len(s)):\r\n result += s[index]\r\n index += 1\r\n if index == len(s):\r\n index = 0\r\n return result\r\nList = []\r\ndef find(st):\r\n for j in range(len(List)):\r\n if List[j] == st:\r\n return True\r\n return False\r\nfor j in range(len(s)):\r\n st = extract(j)\r\n if find(st) == False:\r\n List.append(st)\r\nprint(len(List))\r\n", "s=input()\r\nk=s[-1]+s[:-1]\r\nans=1\r\nwhile s!=k:\r\n k=k[-1]+k[:-1]\r\n ans+=1\r\nprint(ans)\r\n \r\n", "\r\nword=str(input())\r\nn=len(word)\r\nalist=[]\r\nfor i in range(n):\r\n new=word[::-1][0:i][::-1]+word[0:n-i]\r\n if not new in alist:\r\n alist.append(new)\r\n\r\nprint(len(alist))", "n=input()\r\na=[n]\r\nfor i in range(len(n)-1):\r\n n=n[-1]+n[:len(n)-1]\r\n if n not in a:a.append(n)\r\nprint(len(a))", "stroka = input()\r\nA = set()\r\nfor i in range(len(stroka)):\r\n A.add(stroka)\r\n stroka = stroka[-1]+stroka[:len(stroka)-1]\r\nprint(len(A))", "s=input();print(len({s[i:]+s[:i] for i in range(len(s))}))", "s = input()\r\na = set()\r\nnew=s\r\nfor i in range(len(s)):\r\n\ta.add(new)\r\n\tnew = new[-1]+new[0:-1]\r\n\r\nprint(len(a))", "s = input()\nn = len(s)\na = set()\nfor i in range(n):\n a.add(s[i:] + s[:i])\nprint(len(a))\n", "s = input()\r\nd = {}\r\nans = 0\r\nfor i in range(len(s)):\r\n l = s[:len(s)-1]\r\n r = s[len(s)-1]\r\n s = r+l\r\n if s not in d:\r\n d[s] = 0\r\n ans += 1\r\n\r\nprint(ans)", "def extend_word (word):\n aux = word\n word_len = len(word)\n new_word = \"\"\n words = set()\n\n while (True):\n for i in range(1, word_len):\n new_word = new_word + aux[i]\n\n new_word = new_word + aux[0]\n\n if (new_word == word):\n break\n\n aux = new_word\n words.add(new_word)\n new_word = \"\"\n\n print(len(words) + 1)\n\n\nif __name__ == \"__main__\":\n word = input(\"\")\n extend_word (word)", "\nstring = input()\nstr1 = string\nstr2 = ''\ncount = 0\nwhile True:\n count+=1\n str2 = str1[0]\n str1 = str1[1 : len(str1)] + str2\n if str1 == string:\n break\nprint(count)\n\n\n\t\t\t\t \t\t \t\t \t \t \t\t\t \t\t \t \t \t\t", "l=list(input())\r\nx=[]\r\ny=l[:]\r\nfor i in range(len(l)):\r\n y = list(y[-1])+y[:-1]\r\n x.append(\"\".join(y))\r\nprint(len(set(x)))", "string = input()\n\ndef to_string(x):\n new = \"\"\n for i in x:\n if i != '!':\n new += i\n\n return new\n\ndef nah(x):\n x = list(x)\n \n for i in range(len(x)):\n if x[i] == '0':\n x[i] = '!'\n else:\n break\n\n return to_string(x)\n\nst = set()\n\nfor i in range(200):\n string = string[-1] + string[:len(string) - 1]\n st.add(string)\n\nprint(len(st))\n", "string = input()\n\nwordList = set()\n\ncurrString = string[-1] + string[: -1]\n\nres = 1\n\nwhile currString != string:\n res+=1\n currString = currString[-1] + currString[: -1]\n\nprint(res)\n\n", "s = input()\r\nk = 0\r\nj = ''\r\ni = 1\r\nwhile s != j:\r\n if i == 1:\r\n j = s\r\n i = 0\r\n j = j[-1] + j[:-1] \r\n k += 1\r\nprint(k)", "s=str(input())\r\nres=set()\r\nres.add(s)\r\nfor i in range(len(s)):\r\n curr=s[i:]+s[:i]\r\n res.add(curr)\r\nprint(len(res))", "s=input(\"\")\r\nl=[]\r\nl.append(s)\r\nctr=1\r\nn=len(s)\r\na=s[n-1]+s[:n-1]\r\nfor i in range(n):\r\n\ta=a[n-1]+a[:n-1]\r\n\t\r\n\tif a not in l:\r\n\t\tctr=ctr+1\r\n\tl.append(a)\r\nprint(ctr)", "def different_words(s):\r\n return (lambda t: len(set(s[i:] + s[:i] for i in range(len(s)))))(s)\r\n\r\n\r\nprint(different_words(input()))\r\n", "n = input()\r\nlist = [n]\r\nfor i in range(len(n)-1):\r\n n = n[-1] + n[:-1]\r\n list.append(n)\r\nprint(len(set(list)))", "s = input()\nres = set()\nfor i in range(len(s) + 5):\n s = s[1:] + s[0]\n res.add(s)\nprint(len(list(res)))", "s=input()\nss=[]\nfor i in range(len(s)):\n ss.append(s[i:]+s[:i])\nss.sort()\ns=ss[0]\nres=1\nfor item in ss:\n if item!=s:\n res+=1\n s=item\nprint(res)\n", "#!/usr/bin/env python3\n\n\ndef main():\n w = input()\n words = set()\n for i in range(len(w)):\n words.add(w[i:] + w[:i])\n return len(words)\n\n\nif __name__ == '__main__':\n print(main())\n", "s = input()\r\nse = set()\r\nn = len(s)\r\n\r\nfor i in range(n):\r\n se.add(s)\r\n s = s[-1] + s[:-1]\r\n\r\nprint(len(se))", "ar = []\ntext = input()\nfor i in range(len(text)):\n text = text[-1] + text[:-1]\n if text not in ar:\n ar.append(text)\nprint(len(ar))", "s = input()\r\n\r\nsn = s\r\n\r\nn = 1\r\n\r\nwhile True:\r\n sn = sn[-1] + sn[:-1]\r\n if sn != s:\r\n n += 1\r\n else:\r\n break\r\n\r\nprint(n)\r\n", "a = input()\r\nt = a\r\nr1 = len(a)\r\nfor i in range(len(a)):\r\n\ta = a[r1-1] + a[0:r1-1]\r\n\tif a == t:\r\n\t\tbreak\r\nprint(i+1)\r\n", "s = input('')\r\nt = list(s)\r\n\r\nl = len(t)\r\ncnt = 0\r\n\r\nst = []\r\n\r\nfor i in range(l):\r\n\ttmp = t[l-1]\r\n\tt.insert(0,tmp)\r\n\tdel t[l]\r\n\tst1 = ''.join(t)\r\n\tif st1 in st:\r\n\t\tpass\r\n\telse:\r\n\t\tcnt = cnt+1\r\n\r\n\tst.append(st1)\r\n\r\nprint(cnt)", "s = input()\r\n\r\nr = [s]\r\ntempS = s\r\nfor i in range(len(s) - 1):\r\n tempS = tempS[-1] + tempS[:-1]\r\n r.append(tempS)\r\nprint(len(set(r)))", "def main():\n s = input()\n q = set()\n q.add(s)\n for i in range(len(s)):\n s = s[1:] + s[0]\n q.add(s)\n print(len(q))\n\n\nif __name__ == '__main__':\n main()\n", "a = input()\r\nprint(len(set([a[x:] + a[:x] for x in range ( len(a) ) ] ) ) )", "s = input()\r\nn = len(s)\r\nreps = set()\r\n\r\nfor i in range(n):\r\n\tss = s[1:]+s[0]\r\n\ts = ss\r\n\treps.add(s)\r\n\r\nprint(len(reps))\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "s = input()\r\nans = {s}\r\nfor i in range(len(s) + 3):\r\n s = s[1:] + s[0]\r\n ans.add(s)\r\nprint(len(ans))\r\n", "s = set()\nl = input()\nst = [i for i in l]\nfor i in range(len(st)):\n\tl = st.pop()\n\tst.insert(0,l)\n\ts.add(''.join(st))\nprint(len(s))\n", "s = input()\r\np = s\r\na = []\r\nj = 0\r\nfor i in range(len(s)):\r\n p = p[1:] + p[0]\r\n if p not in a:\r\n a.append(p)\r\nprint(len(a))", "q=input()\r\na=[q]\r\nl=len(q)\r\nq=q*2\r\nfor i in range(1,l):\r\n a.append(q[i:i+l])\r\nprint(len(set(a)))\r\n", "import math,sys,re,itertools,pprint,collections,copy\r\nrs,ri,rai,raf=input,lambda:int(input()),lambda:list(map(int, input().split())),lambda:list(map(float, input().split()))\r\n\r\nt = input()\r\nres = {t}\r\nfor i in range(52):\r\n t = t[-1] + t[:-1]\r\n res.add(t)\r\n\r\nprint(len(res))\r\n", "z=[]\r\ns=list(input())\r\ncount=0\r\nx=0\r\nwhile True:\r\n\ts=[s[-1]]+s[:-1]\r\n\tif s in z:\r\n\t\tprint(count)\r\n\t\tbreak\r\n\telse:z.append(s)\r\n\tx+=1\r\n\tcount+=1", "s=input()\r\nr=1\r\nt=[s]\r\nfor i in range(len(s)):\r\n\tres=s[1:]+s[0]\r\n\tif res not in t:\r\n\t\tt.append(res)\r\n\ts=res\r\nprint(len(t))", "a=input()\nb=len(a)\nn=0\nc=list(a)\nd=0\ne=0\nf=[a]\nwhile n<len(a):\n d=c[b-1]\n c.pop()\n c.insert(0,d)\n e=str(c)\n if e not in f:\n f.append(e)\n n=n+1\nprint(len(f)-1)\n ", "def solveMeFirst(a):\r\n # Hint: Type return a+b below \r\n cycle =a[len(a)-1] + a [:len(a)-1]\r\n times = 0\r\n while a != cycle :\r\n temp = cycle [:]\r\n cycle =temp[len(a)-1] + temp [:len(a)-1]\r\n times+=1\r\n return times+1\r\n\r\nnum1 = input()\r\nres = solveMeFirst(num1)\r\nprint(res)\r\n", "s = input()\r\nall_comb = set()\r\nfor i in range(len(s)):\r\n all_comb.add(s)\r\n s = s[1:] + s[0]\r\nprint(len(all_comb))\r\n", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n s = input()\r\n n = len(s)\r\n ans = set()\r\n for i in range(n):\r\n ans.add(s)\r\n s = s[-1] + s[:n-1]\r\n print(len(ans))\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "st = input()\r\ndic = {}\r\n\r\nl = len(st)\r\n\r\nfor i in range(l, 0, -1):\r\n if st[i:]+st[:i] in dic:\r\n pass\r\n else:\r\n dic[st[i:]+st[:i]]=1\r\nprint(sum(dic.values()))", "s=input()\r\nb=set()\r\nfor i in range (len(s)):\r\n s=s[-1]+s[:len(s)-1]\r\n b.add(s)\r\nprint (len(b))\r\n", "s = input()\r\np = set()\r\n\r\nfor i in range(len(s)):\r\n s = s[-1]+s[:-1]\r\n if s not in p:\r\n p.add(s)\r\n\r\nprint(len(p))\r\n\r\n", "s = input()\r\n\r\nres = set()\r\nfor i in range(len(s)):\r\n\tres.add(s[(-i if i else len(s)):]+s[:len(s)-i])\r\n\r\nprint(len(res))", "w = str(input().strip())\r\nl = len(w)\r\nk = w+w\r\ni = k.find(w,1)\r\nif i==-1:\r\n print(l)\r\nelse:\r\n print(i)\r\n", "w = input()\ns = set()\nfor shift in range(len(w)):\n s.add(w[-shift:] + w[:-shift])\nprint(len(s))\n", "s = input()\r\nl = []\r\nfor i in range(len(s)):\r\n\ts = s[len(s)-1] + s[0:len(s)-1]\r\n\tl.append(s)\r\nprint(len(set(l)))\t", "s = input()\r\nl = []\r\nn = len(s)\r\nfor i in range(n):\r\n l.append(s[i+1:n]+s[:i+1])\r\nprint(len(list(set(l))))", "s = input()\r\n\r\nknown = set()\r\n\r\nfor i in range(len(s)):\r\n p = s[i:]+ s[:i]\r\n known.add(p)\r\n\r\nprint(len(known))\r\n", "s = input()\r\nres = set()\r\nfor i in range(len(s)):\r\n res.add(s[i:] + s[:i])\r\nprint(len(res))", "#!/usr/bin/env python3\ns = input()\ns = s+s\nd = {}\nfor i in range(int(len(s)/2)):\n d[s[i:i+int(len(s)/2)]] = 1\nprint(len(d))\n", "S = input()\r\ns = set()\r\ns.add(S)\r\nfor i in range(len(S)):\r\n tmp = S[i:]+S[:i]\r\n s.add(tmp)\r\nprint(len(s))", "a = (input())\r\ndone = [a]\r\nn = len(a)\r\na = list(a)\r\n\r\nfor i in range(n-1):\r\n a = [a[-1]] + a[:-1]\r\n x = \"\".join(a)\r\n if x not in done:\r\n done.append(x)\r\n\r\nprint(len(done))", "s=input()\r\nn=len(s)\r\nl=[s]\r\nfor i in range(n):\r\n s=s[-1]+s[0:-1]\r\n l.append(s)\r\nprint(len(set(l)))", "S = input()\r\nSlen = len(S)\r\nW = {S}\r\nWnew = S\r\nWlen = 1\r\n\r\nfor i in range(Slen-1):\r\n Wnew = Wnew[-1] + Wnew[:-1]\r\n if Wnew in W:\r\n continue\r\n W.add(Wnew)\r\n Wlen += 1\r\n\r\nprint(Wlen)", "words = [input()]\r\n\r\nwhile words[-1][-1] + words[-1][:-1] not in words:\r\n words.append(words[-1][-1] + words[-1][:-1])\r\n \r\nprint(len(words))", "word = input()\r\nmasW = []\r\n\r\ndef h(word, masW):\r\n if word not in masW:\r\n masW.append(word)\r\n h(word[-1]+word[0:-1], masW)\r\n else:\r\n print(len(masW))\r\n\r\nh(word,masW)\r\n", "a=input()\r\nm=set([])\r\nfor i in range(len(a)):\r\n\tx=a[i:]+a[:i]\r\n\tm.add(x)\r\nprint(len(m))", "s = input()\r\nss = set()\r\nfor _ in range(len(s)):\r\n ss.add(s)\r\n s = s[1:] + s[0]\r\nprint(len(ss))\r\n", "def main(s):\r\n b=set()\r\n b.add(s)\r\n for i in range(len(s)):\r\n c=s[len(s)-1] + s[0:len(s)-1]\r\n b.add(c)\r\n s=c\r\n print(len(b))\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\" :\r\n s=input()\r\n main(s)", "s = input()\r\nadict = {}\r\nn = len(s)\r\n\r\nfor i in range(n):\r\n s = s[-1] + s[:-1]\r\n if s not in adict:\r\n adict[s] = 1\r\n\r\nprint(sum(adict.values()))", "string = input()\r\n\r\nSet = set()\r\nfor i in range(0,string.__len__()):\r\n Set.add(string)\r\n string = string[-1]+string[:-1]\r\n\r\nprint(Set.__len__())\r\n\r\n", "s=input()\r\nn=len(s)\r\na=[s]\r\ns+=s\r\nfor i in range(n):\r\n tst=0\r\n for j in a:\r\n if s[i:i+n]==j:\r\n tst=1\r\n break\r\n if tst==0:\r\n a.append(s[i:i+n])\r\nprint(len(a))", "s = input()\nl = len(s)\ns = s * 2\nss = set()\n\nfor i in range(l):\n\tss.add(s[i:i + l])\n\nprint(len(ss))", "s=input()\r\na=list()\r\na.append(s)\r\nb=list(s)\r\nx=1\r\nfor i in range(100):\r\n b.insert(0,b.pop())\r\n s=\"\".join(b)\r\n if s not in a:\r\n a.append(s)\r\n x+=1\r\nprint(x)", "from collections import Counter\r\n\r\ns = input()\r\nz = set()\r\n\r\nfor i in range(len(s)):\r\n s = s[1:] + s[:1]\r\n z.add(s)\r\n\r\nprint(len(Counter(z)))", "s = input()\r\nstrings = [s, ]\r\ncount = 1\r\n\r\nle = len(s)\r\nfor i in range(le):\r\n\tch = s[-1]\r\n\ts = ch + s[0:le-1]\r\n\tif not(s in strings):\r\n\t\tcount += 1\r\n\t\tstrings.append(s)\r\nprint(count)\r\n", "s = input()\r\na = set()\r\nfor i in range(len(s)):\r\n a.add(s)\r\n s = s[-1] + s[:-1]\r\nprint(len(a))", "from collections import deque\r\ns = deque(input())\r\nx = 0\r\nl = {''.join(s)}\r\nwhile x < len(s):\r\n s.rotate(1)\r\n l.add(''.join(s))\r\n x+=1\r\nprint(len(l))", "keke = dict()\r\nans = 0\r\ns = input().strip()\r\nfor i in range(0, len(s)):\r\n if not s in keke:\r\n keke[s] = 1\r\n ans+= 1\r\n s = s[-1] + s[:-1]\r\nprint(ans)", "def changeword(word):\n i=word\n toge=[]\n new=\"\"\n while i!=new:\n new=\"\"\n long=len(word)\n for n in range(long):\n new+=word[n-1]\n if new not in toge:\n toge.append(new)\n word=new\n return toge\n\nword=input()\nanswer=changeword(word)\nprint(len(answer))\n", "lis = []\r\ns = input()\r\nfor i in range(len(s)):\r\n lis.append(s[i:] + s[:i])\r\nprint(len(set(lis)))", "s = input()\r\nx = set()\r\nx.add(s)\r\nindex = 0\r\nfor i in s:\r\n x.add(s[-1] + (s[0:-1]))\r\n s = s[-1] + s[0:-1]\r\n index += 1\r\n\r\nprint(len(x))\r\n", "s = input()\nl = list(s)\na = set()\nfor _ in range(len(s)):\n\ta.add(s)\n\tlnew = l[1:]+[l[0]]\n\ts = \"\".join(lnew)\n\tl = list(s)\nprint(len(a))\n\n", "from collections import defaultdict\n\ns = input()\nn = len(s)\nd = defaultdict(int)\nif n == 0:\n print('0')\nelse:\n for i in range(n):\n d[s] += 1\n s = s[-1] + s[:n-1]\n print(len(d.keys()))\n", "s = input()\r\nc_dict = set([s])\r\nfor i in range(len(s)):\r\n s = s[1:] + s[0]\r\n c_dict.add(s)\r\nprint(len(c_dict))", "s = input()\r\ns1 = s;count = 1;s1 = s1[-1]+s1[:-1]\r\nwhile s1 != s:\r\n s1 = s1[-1]+s1[:-1];count+=1\r\nprint(count)", "s = input()\r\na = {s[i:]+s[:i] for i in range(len(s))}\r\nprint(len(a))", "s=(input())\r\ns1=set()\r\nfor i in range(len(s)):\r\n s1.add(s[i:]+s[:i])\r\nprint(len(s1))\r\n", "s = input()\r\nss = {s}\r\nl = len(s)\r\nfor i in range(l-1):\r\n\ts = s[l-1]+s[:l-1]\r\n\tss.add(s)\r\nprint(len(ss))", "def main():\r\n s = input()\r\n k = set()\r\n for i in range(len(s)):\r\n k.add(s[i:] + s[:i])\r\n print(len(k))\r\n \r\nmain()", "s=str(input())\r\nx=set()\r\nx.add(s)\r\nfor i in range(len(s)):\r\n curr=s[i:]+s[:i]\r\n x.add(curr)\r\nprint(len(x))", "s = input()\r\ndistinct_words = set()\r\nfor i in range(len(s)):\r\n distinct_words.add(s)\r\n s = s[-1] + s[:-1]\r\nprint(len(distinct_words))", "l=list(input())\r\nx=[]\r\nd=[]\r\na=len(l)\r\nfor i in range(1,int(a**(1/2))+1):\r\n if not a%i:\r\n d.append(i)\r\n d.append(a//i)\r\nd=list(set(d))\r\nd.sort()\r\nfor i in d:\r\n if l==l[:i]*(a//i):\r\n print(i)\r\n exit()", "a = input()\r\nd = {a}\r\nfor i in range(len(a)):\r\n a = a[-1]+a[0:-1]\r\n d.add(a)\r\nprint(len(d))", "s = input()\n\narr = set()\nfor i in range(len(s)):\n arr.add(s[i:] + s[:i])\n\nprint(len(arr))\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\ns=input()\r\nl=set()\r\nfor i in range(len(s)):\r\n\tl.add(s[i:]+s[:i])\r\nprint(len(l))", "import math\r\nimport sys\r\nimport re\r\n\r\ns = input()\r\nn = len(s)\r\nl = []\r\nx = 0\r\nwhile x!=n:\r\n s = s[-1] + s[:-1]\r\n l.append(s)\r\n x = x + 1\r\nprint(len(set(l)))", "def rot(s):\r\n return s[1:]+s[:1]\r\n\r\ns=input()\r\na=[s]\r\nans=1\r\nfor i in range(len(s)-1):\r\n s=rot(s)\r\n if not(s in a):\r\n ans+=1\r\n a.append(s)\r\nprint(ans)", "s=input().strip()\r\ndist_shift=set()\r\nfor i in range(len(s)):\r\n shift=s[-i:] + s[:-i]\r\n dist_shift.add(shift)\r\nprint(len(dist_shift))", "s = input()\r\nd = {}\r\nn = len(s)\r\nfor i in range(n):\r\n d[s] = 1\r\n s = s[-1] + s[:n-1]\r\nprint(len(d))\r\n", "string = input()\ndef cyclicshift(string):\n ans = set()\n n = len(string)\n for i in range(n):\n ans.add(string[i:]+string[:i])\n return ans\n\nans = cyclicshift(string)\nprint(len(ans))", "s = input()\ntotal = set()\nfor i in range(0, len(s)):\n total.add(s[i:] + s[:i])\n\nprint(len(total))", "s = input()\r\n\r\nd = set()\r\n\r\nfor _ in range(len(s)):\r\n d.add(s)\r\n s = s[-1] + s[:-1]\r\n\r\nprint(len(d))", "s = input()\r\no = set()\r\nfor i in range(len(s)):\r\n o.add(s)\r\n s = s[-1] + s[:-1]\r\n #print(s) #it will give the cyclic order\r\nprint(len(o))", "s=input()\r\nL=[]\r\nfor i in range(len(s)):\r\n s = s[-1]+s[:-1:]\r\n if s not in L:\r\n L.append(s)\r\nprint(len(L))\r\n\r\n \r\n \r\n \r\n", "s=input()\r\nt=[s]\r\nk=len(s)-1\r\nfor i in range(k):\r\n s=s[k]+s[0:k]\r\n t.append(s)\r\nt=list(set(t))\r\nprint(len(t))\r\n \r\n", "s = input()\r\n\r\nd = {}\r\nn = len(s)\r\n\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n\ts2 = \"\"\r\n\tfor j in range(n):\r\n\t\ts2 += s[(i+j)%n]\r\n\tif s2 not in d:\r\n\t\td[s2] = 1\r\n\t\tcounter += 1\r\n\t# print(s2)\r\n\r\nprint(counter)", "s= str(input())\r\nl= len(s)\r\ntest=[]\r\nfinal=[]\r\nnew=''\r\nfor i in range(l):\r\n new= s[1:]+s[0]\r\n s=new\r\n test.append(new)\r\nfor i in test:\r\n if i not in final:\r\n final.append(i)\r\n\r\nprint(len(final))", "s = str(input())\r\n\r\nss = set()\r\n\r\nfor i in range(len(s)):\r\n ss.add(s[i:]+s[0:i])\r\n\r\nprint(len(ss))", "s = input()\r\nst = set()\r\nl = len(s)\r\nfor i in range(l):\r\n st.add(s[l-i:] + s[:l-i])\r\n\r\nprint(len(st))", "a = input()\nn = [a]\nfor i in range(len(a)):\n a = a[-1]+a[0:len(a)-1]\n if a not in n:\n n.append(a)\n else:\n break\nprint(len(n))\n \n \n", "s=input()\r\ns1=list(s)\r\nl=[s]\r\nwhile(1):\r\n a=s1[len(s1)-1]\r\n for i in range(len(s1)-1,0,-1):\r\n s1[i]=s1[i-1]\r\n s1[0]=a\r\n s2=''.join(s1)\r\n if s2 not in l:\r\n l.append(s2)\r\n elif s2==s:\r\n break\r\nprint(len(l))", "s = input()\r\ncyc = []\r\nfor i in range(len(s)):\r\n cyc.append(s[i:]+s[:i])\r\n\r\nprint(len(set(cyc)))\r\n", "s = list(input())\r\naux = [0]*len(s)\r\nfor i in range(len(s)):\r\n aux[i] = s[i]\r\nans = 0\r\nfor i in range(len(s)):\r\n s.insert(0, s[-1])\r\n del s[-1]\r\n ans += 1\r\n if (s == aux):\r\n print(ans)\r\n break", "s = input()\r\na = [s]\r\nfor i in range(len(s) - 1):\r\n s = s[-1] + s[0:len(s) - 1]\r\n if s not in a:\r\n a += [s]\r\nprint(len(a))\r\n", "import re\r\n\r\nword = input()\r\n\r\nif len(word) >= 1 and len(word) <= 50 and re.match(r\"[a-z]+\", word):\r\n result = []\r\n for ind in range(0, len(word)):\r\n word = word[-1] + word[0:-1]\r\n result.append(word)\r\n print(len(set(result)))\r\n", "S=input()\r\nS1=[]\r\nk=0\r\nfor i in range(len(S)) :\r\n S=S[len(S)-1]+S[0]+S[1:len(S)-1]\r\n S1.append(S)\r\nS2=set(S1)\r\nprint(len(S2))\r\n \r\n", "s1 = input()\r\ns2 = s1\r\ncount = 1\r\nfor i in range(len(s1)-1):\r\n s2 = s2[-1] + s2[:-1]\r\n if s2 != s1:\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(count)", "s = input()\r\nprint(len(set(s[-i:] + s[:-i] for i in range(len(s)))))", "def shift(s):\r\n\tnew_s = \"\"\r\n\tnew_s += s[-1]\r\n\tnew_s += s[:-1]\r\n\treturn new_s\r\n\r\ns = input()\r\nn = len(s)\r\nres = set()\r\nres.add(s)\r\nfor i in range(n):\r\n\ts = shift(s)\r\n\tres.add(s)\r\nprint(len(res))", "a=input()\r\nfrom collections import defaultdict\r\ndict=defaultdict(int)\r\nfor i in range(len(a)):\r\n dict[a]=1\r\n a=a[1:]+a[:1]\r\n \r\nprint(len(dict))", "x=input()\r\nst=set()\r\nfor i in range(len(x)):\r\n se=x[len(x)-1]+x[0:len(x)-1]\r\n st.add(se)\r\n x=se\r\nprint(len(st))\r\n", "s = list(input())\r\nused = []\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n z = s[0]\r\n s.append(s[0])\r\n s.pop(0)\r\n p = ''.join(s)\r\n if p not in used:\r\n used.append(p)\r\n ans += 1\r\n\r\n\r\nprint(ans)", "s,vars=input(),set()\nvars.add(s)\nfor i in range(1,len(s)):vars.add(s[i:]+s[:i])\nprint(len(vars))", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\t\r\na=input()\r\ns=set()\r\ni=0\r\ns.add(a)\r\nx=\"\"\r\nwhile x!=a:\r\n\tx=a[i+1:]+a[0:i+1]\r\n\ts.add(x)\r\n\ti+=1\r\n\r\nprint(len(s))\r\n\r\n", "s=input()\nr=set()\nfor _ in s[:]:\n s=s[1:]+s[0:1]\n r=r|{s}\nprint(len(r))", "s = input()\r\nln = len(s)\r\nS = s * 2\r\n\r\nprint(len(set(S[i:i+ ln] for i in range(ln))))", "n=input()\r\nb=n[-1]+n[:len(n)-1]\r\na=0\r\nwhile(b!=n):\r\n\t\tb=b[-1]+b[:len(b)-1]\r\n\t\t# print(b)\r\n\t\ta+=1\r\nprint(a+1)\t", "def main():\n s = input()\n n = len(s)\n d = {s: 0}\n\n for _ in range(n - 1):\n s = s[n - 1] + s[:(n - 1)]\n d[s] = 0\n\n print(len(d))\n\n\nif __name__ == '__main__':\n main()\n", "a=list(input())\r\nb=[]\r\nn=len(a)\r\nfor k in range(n):\r\n t=a[0]\r\n a.remove(a[0])\r\n a.append(t)\r\n b.append(''.join(a))\r\nprint(len(set(b)))", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------02.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\ns=str(input())\r\narr=[s]\r\nfor i in range(len(s)):\r\n s=s[1:len(s)]+s[0]\r\n arr.append(s)\r\nprint(len(list(set(arr))))", "import collections\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = collections.deque(input().rstrip())\r\nmemo = set()\r\n\r\nfor i in range(len(data)):\r\n data.appendleft(data.pop())\r\n memo.add(''.join(data))\r\n\r\nprint(len(memo))\r\n\r\n", "string = input()\r\nwords = []\r\ncount = 0\r\nfor i in range(len(string)):\r\n if string not in words:\r\n count += 1\r\n words.append(string)\r\n string = string[1:] + string[0]\r\nprint(count)\r\n", "s=input()\r\nst=[]\r\nfor i in range(100):\r\n s=s[1:]+s[0]\r\n st.append(s)\r\nprint(len(list(set(st))))", "def solve(s: str) -> int:\r\n n = len(s)\r\n L = []\r\n for i in range(0, n):\r\n \tL.append(s[i: n] + s[0: i])\r\n k=1\r\n for j in range(1, n):\r\n \tm=0\r\n \tfor i in range(0, j):\r\n \t\tif L[i]!=L[j]:\r\n \t\t\tm = m+1\r\n \tif m==j:\r\n \t\tk = k+1\r\n return(k)\r\n\r\ns = input()\r\nprint(solve(s))\r\n", "n=input()\nlst=[n]\nfor i in range(len(n)):\n n=n[1:]+n[0]\n if n not in lst:\n lst.append(n)\nprint(len(lst))\n\t\t \t\t \t \t\t \t \t \t\t\t\t\t \t", "from sys import stdin\n\nline = stdin.readline().rstrip()\n#print(line)\ns = set()\nif(len(line)==0):\n print(0)\nelse:\n while line not in s:\n s.add(line)\n line = line[-1]+line[0:-1]\n\nprint(len(s))\n", "#http://codeforces.com/contest/745/problem/A\r\nl=input()\r\ns=set()\r\nfor i in range(len(l)):\r\n l=l[1:]+l[0]\r\n s.add(l)\r\nprint(len(s))\r\n", "if __name__ == '__main__':\r\n s = str(input())\r\n l = set()\r\n n = len(s)\r\n for i in range(n):\r\n l.add(s[i:] + s[:i])\r\n print(len(l))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input()[:-1]\r\nw = s[::]\r\nx = len(s)\r\nwhile x:\r\n s = s[-1] + s[:-1]\r\n x -= 1\r\n if w == s:\r\n break\r\nprint(len(s)-x)", "x = input()\nlst = []\nfor i in range(len(x)):\n if x[i:]+x[:i] not in lst:\n # print(x[i:]+x[:i])\n lst.append(x[i:]+x[:i])\nprint(len(lst))", "words = dict()\r\n\r\ndef shift(s):\r\n\tn = s[-1]\r\n\tfor i in range(len(s)-1):\r\n\t\t n += s[i]\r\n\treturn n\r\n\r\ndef addAll(s):\r\n\tfor i in range(len(s)):\r\n\t\tif s in words:\r\n\t\t\twords[s] += 1\r\n\t\telse:\r\n\t\t\twords[s] = 0\r\n\t\ts = shift(s)\r\n\r\naddAll(input())\r\nma = 0\r\nprint(len(words))", "\r\nstc = list(input())\r\nst = stc\r\nl = []\r\n\r\n\r\nn = len(st)\r\n\r\n\r\nfor _ in range(n):\r\n\r\n\tstc.insert(0, stc[n-1])\r\n\tstc.pop()\r\n\t\r\n\tsi = (''.join(stc))\r\n\tif si not in l:\r\n\t\tl.append(si)\r\n\r\n\r\n\r\n\t\r\n\r\n\r\nprint(len(l))\r\n", "n = input()\r\ndaf = set()\r\ndaf.add(n)\r\nfor _ in range(len(n) - 1):\r\n n = n[-1] + n[:-1]\r\n daf.add(n)\r\n\r\nprint(len(daf))\r\n", "s = input()\r\nans = []\r\nfor i in range(len(s)):\r\n ans.append(s[-i:] + s[:-i])\r\nprint(len(set(ans)))\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-30 23:09:49\nLastEditTime: 2021-11-30 23:14:40\nDescription: Hongcow Learns the Cyclic Shift\nFilePath: CF745A.py\n'''\n\n\ndef func():\n s = input().strip()\n n = len(s)\n s += s\n word = []\n for i in range(n):\n word.append(s[i:i + n])\n print(len(set(word)))\n\n\nif __name__ == '__main__':\n func()\n", "s = input()\r\ns2 = s\r\ndef shift(s):\r\n\treturn s[len(s)-1]+s[:len(s)-1]\r\nans = 1\r\ns2 = shift(s)\r\nwhile s2 != s:\r\n\ts2 = shift(s2)\r\n\tans+=1\r\nprint(ans)\r\n", "word=input()\nline=[]\nfor i in range(len(word)):\n if word not in line:\n line=line+[word]\n word=word[-1]+word[ :-1]\nprint(len(line))\n", "s = input()\r\n\r\ntest = s\r\n\r\ncount = 1\r\n\r\nfor i in range(len(s)):\r\n test = test[1:]+test[0]\r\n if test == s :\r\n break\r\n else:\r\n count+=1\r\nprint(count)", "s = input()\n\ndef rotate(s, i):\n n = len(s)\n return s[n - i:] + s[:n - i]\n\nres = len(set(rotate(s, i) for i in range(len(s))))\nprint(res)\n", "from collections import deque\n\nval=deque(input())\nlength=len(val)\n\nall=set()\nwhile length:\n length-=1\n all.add(''.join(val))\n val.appendleft(val.pop())\n\nprint(len(all))\n\t \t \t \t\t\t\t \t \t\t \t", "a=list(input())\nlista=[]\nlista.append(''.join(a))\nfor i in range(0,len(a)):\n p=a.pop(0)\n a.append(p)\n f=''.join(a)\n if f not in lista:\n lista.append(f)\nprint(len(lista))\n\t\t \t\t\t \t \t\t \t \t\t \t\t\t\t \t \t", "s = input()\r\n\r\nt = s[:len(s)-1]\r\n\r\nse = set()\r\n\r\nfor i in range(len(s)-1, 0, -1):\r\n st = s[i] + t\r\n if st not in se:\r\n se.add(st)\r\n t = st[:len(st)-1]\r\n \r\nif s not in se:\r\n print(len(se)+1)\r\nelse:\r\n print(len(se))", "string = input()\r\ns = set()\r\nfor i in range(len(string)):\r\n if string not in s:\r\n s.add(string)\r\n string = string[len(string)-1]+string[:-1]\r\nprint(len(s))\r\n", "s = input()\r\nsl = len(s)\r\nl = set()\r\nfor i in range(sl):\r\n new_s = s[sl-1] + s[:-1]\r\n l.add(new_s)\r\n s = new_s\r\nprint(len(l))\r\n", "s=input()\r\nc=set()\r\nfor i in range(len(s)):\r\n s=s[1:]+s[0]\r\n c.add(s)\r\nprint(len(c))\r\n ", "s = input()\r\nans = 1\r\ni = len(s) - 1\r\na = [s]\r\nwhile i > 0:\r\n t = s[i:] + s[:i]\r\n if s[i:] + s[:i] not in a:\r\n ans += 1\r\n a.append(t)\r\n i -= 1\r\nprint(ans)\r\n", "st = input()\r\narr = []\r\nfor i in range(len(st)):\r\n\tarr.append(st[i:] + st[:i])\r\narr = sorted(arr)\r\ncnt = 1\r\nfor i in range(1,len(st)):\r\n\tif(arr[i] != arr[i-1]):\r\n\t\tcnt = cnt + 1\r\nprint(cnt)", "s=str(input())\r\nl=set()\r\nfor i in range(0,len(s)):\r\n e=s[-1]+s[0:len(s)-1]\r\n s=e\r\n l.add(e)\r\nprint(len(l))", "s=list(input())\r\nc=''.join(s)\r\nco=1\r\nfor _ in range(len(s)):\r\n s.insert(0,s[-1])\r\n s.pop(-1)\r\n if ''.join(s)==c:\r\n break\r\n co+=1\r\nprint(co)\r\n \r\n", "# cook your dish here\r\ns = input()\r\nans = [s]\r\nfor i in range(len(s)):\r\n ans.append(ans[-1][1:]+ans[-1][0])\r\nprint(len(set(ans)))", "n=input()\r\nans={n}\r\nfor i in range(52):\r\n n=n[-1]+n[:-1]\r\n ans.add(n)\r\nprint(len(ans))", "x=str(input())\r\nclone=x\r\nlen_=len(x)\r\ncount=0\r\nfor i in range(len_):\r\n first=clone[-1]\r\n second=clone[0: len_-1]\r\n clone=first+second\r\n if clone !=x:\r\n count=count+1 \r\n else:\r\n count=count+1 \r\n break\r\nprint(count)\r\n ", "s = input()\r\nst = set()\r\nfor i in range(len(s)):\r\n s = s[1:] + s[0]\r\n st.add(s)\r\nprint(len(st))", "s=input()\r\nn=len(s)\r\na=[]\r\nfor i in range(n-1):\r\n\tk=s[i+1:]+s[:i+1]\r\n\tif k==s:\r\n\t\tbreak\r\n\telse:\r\n\t\ta.append(k)\t\r\nprint(len(a)+1)", "IN = input()\nprint(len(set([IN[-i:]+IN[:-i] for i in range(len(IN))])))\n", "s = list(input())\r\nans = 0\r\nl = []\r\nfor i in range(len(s)):\r\n s.insert(0, s[-1])\r\n s.pop()\r\n if l.count(s) == 0:\r\n ans += 1\r\n r = s.copy()\r\n l.append(r)\r\nprint(ans)", "s = input()\nsset = set([s])\nres=1\nfor i in range(len(s)-1):\n s = s[-1]+s[0:-1]\n if not s in sset:\n sset.add(s)\n res+=1\nprint(res)\n", "a=input()\r\nr=['']\r\nfor i in range(len(a)):\r\n s=a[len(a)-1]+a[:len(a)-1]\r\n \r\n a=s\r\n \r\n if a not in r:\r\n r.append(a)\r\nprint(len(r)-1)\r\n", "s = input()\ns_init, s_new = s, s\ni = 0\nwhile i < len(s):\n s_new = s[-1] + s[:-1]\n i += 1\n if s_new == s_init:\n break\n s = s_new\nprint(i)\n", "s = input()\r\nw = s\r\nx = s[len(s) - 1]\r\ns = x + s[:len(s) - 1]\r\nif s != w:\r\n ans = 2\r\nelse:\r\n ans = 1\r\nwhile (s != w):\r\n x = s[len(s) - 1]\r\n s = x + s[:len(s) - 1]\r\n if s != w:\r\n ans += 1\r\nprint(ans)", "# https://codeforces.com/problemset/problem/745/A\n# 900\n\ns = input()\n\nd = {s:1}\nfor _ in range(len(s)-1):\n s = s[-1:] + s[:-1]\n d.setdefault(s, 1)\n\nprint(len(d))\n", "s=input()\r\nl=[s]\r\nfor _ in range(len(s)-1):\r\n s=s[1:]+s[0]\r\n if s not in l:\r\n l.append(s)\r\n \r\nprint(len(l))\r\n", "n = input()\r\ns = [n]\r\nb = []\r\na = len(n)-1\r\nfor i in range(-1,-len(n),-1):\r\n b+= n[i]\r\n s.append(\"\".join(reversed(b))+n[:a])\r\n a -= 1\r\n\r\nprint(len(list(dict.fromkeys(s))))", "s = input()\nf = set([s])\n\nfor i in range(len(s)):\n f.add(s[i:] + s[:i])\n \nprint(len(f))", "x = input().strip()\r\na = set()\r\nl = len(x)-1\r\nfor i in range(len(x)):\r\n x = x[l]+x[:l]\r\n a.add(x)\r\nprint(len(a))", "string = input()\ns = set()\nfor _ in range(len(string)):\n string = string[-1] + string[:-1]\n s.add(string)\nprint(len(s))\n", "s = input()\r\nl = len(s)\r\nfor x in range(1, 1+l//2):\r\n step = l//x\r\n if s == s[:x]*step:\r\n print (x)\r\n break\r\nelse:\r\n print (l)", "spell = input()\r\ns = set()\r\nfor i in range(len(spell)):\r\n s.add( spell[ i : : ] + spell[ : i : ] )\r\nprint(len(s))\r\n", "#code\r\ns = str(input())\r\n\r\nlis = [s,]\r\nfor i in range(1, len(s)):\r\n lis.append(s[i:]+s[0:i])\r\n \r\nans = len(set(lis))\r\nprint(ans)\r\n ", "s = input()\r\n\r\nwas = [s]\r\n\r\nprev = s\r\n\r\nfor i in range(len(s)):\r\n\tnow = prev[-1] + prev[0:len(s) - 1]\r\n\tif now in was:\r\n\t\tbreak\r\n\r\n\tprev = now\r\n\twas.append(now)\r\n\r\nprint(len(was))\r\n\r\n", "a = input()\r\nmas = []\r\nb = list(a)[::-1]\r\nwhile True:\r\n b.append(b[0])\r\n b.pop(0)\r\n if str(b) not in mas:\r\n mas.append(str(b))\r\n else:\r\n break\r\nprint(len(mas))\r\n\r\n", "s = input()\r\ns1 = s\r\ndef transform(s):\r\n return s[-1] + s[:len(s) - 1]\r\n\r\ns = transform(s)\r\ncount = 1\r\nwhile s != s1:\r\n s = transform(s)\r\n count += 1\r\nprint(count)", "comb = []\r\nstring = input()\r\ncomb.append(string)\r\nnew_string = string\r\nwhile True:\r\n\tnew_string = new_string[-1] + new_string[0:-1]\r\n\tif new_string not in comb:\r\n\t\tcomb.append(new_string)\r\n\telse:\r\n\t\tbreak\r\nprint(len(comb))\r\n", "s = input()\r\n \r\nn = len(s)\r\n \r\nres = set()\r\n \r\nfor i in range(n):\r\n res.add(s[i:] + s[:i])\r\n \r\nprint(len(res))", "a=input()\r\ns=[]\r\ncount=0\r\nwhile(a not in s):\r\n s.append(a)\r\n a=a[-1]+a[:-1]\r\n count+=1\r\nprint(count)", "from collections import deque\r\n\r\nX = deque(input())\r\nY = set()\r\nfor i in range(len(X)):\r\n Char = X.pop()\r\n X.appendleft(Char)\r\n Y.add(str(X))\r\nprint(len(Y))\r\n", "str=input()\r\nst=set()\r\nl=len(str)\r\n\r\nfor i in range(l):\r\n if str not in st:\r\n st.add(str)\r\n str = str[l-1]+str[0:l-1]\r\n\r\nprint(len(st))\r\n", "'''input\nyzyz\n'''\nx = input()\ns = set()\nfor _ in range(len(x)):\n\ts.add(x)\n\tx = x[-1] + x[:-1]\nprint(len(s))\n\n\n\n\n", "word = input('')\n\nlist = [word]\nn = len(word) - 1\n\nfor i in range (len(word)):\n word = word[n] + word[0:n]\n if word not in list:\n list.append(word)\n \nprint (len(list))", "s = input()\r\nanswers = set()\r\nfor i in range(len(s) + 1):\r\n answers.add(s)\r\n s = s[-1] + s[:len(s) - 1]\r\nprint(len(answers))\r\n", "def cyclic_rotate(st):\r\n st=st[-1]+st[:-1]\r\n return st\r\nst=input()\r\ns=st\r\nx=1\r\nwhile True:\r\n st=cyclic_rotate(st)\r\n if st!=s:\r\n x+=1\r\n elif st==s:\r\n break\r\nprint(x)", "n=input()\r\nl=[n]\r\nx=len(n)\r\nfor i in range(x):\r\n\tz=\"\"\r\n\tn=n[x-1]+n[:x-1]\r\n\tl.append(n)\r\nprint(len(set(l)))\t\t", "s = input()\r\nprint ((lambda x: len(set(x[i:] + x[:i] for i in range(len(x))))) (s))", "s = input()\r\nn = len(s)\r\nL = []\r\nfor i in range(0, n):\r\n\tL.append(s[i: n] + s[0: i])\r\nk=1\r\nfor j in range(1, n):\r\n\tm=0\r\n\tfor i in range(0, j):\r\n\t\tif L[i]!=L[j]:\r\n\t\t\tm = m+1\r\n\tif m==j:\r\n\t\tk = k+1\r\nprint(k)\r\n\t\t", "s=input()\r\nl=set()\r\nfor i in range(len(s)):\r\n\tl.add(s)\r\n\ts=s[-1]+s[:-1]\r\nprint(len(l))", "a=input()\r\nb=''\r\nc=0\r\nd=a\r\nwhile(b!=d):\r\n c+=1\r\n b=a[1:]+a[:1]\r\n a=b\r\nprint(c)\r\n", "def Cycle(s):\r\n return s[-1] + s[:len(s) - 1]\r\n\r\ns = input()\r\na = [s]\r\nwhile Cycle(s) not in a:\r\n a.append(Cycle(s))\r\n s = Cycle(s)\r\nprint(len(a))\r\n", "\nword =input('')\n\nwordlist=[word]\ncnt = 0\nfor char in word:\n nw = word[-1]+ word[:-1]\n # print (word, nw)\n if nw not in wordlist:wordlist.append(nw)\n word = nw\n\n# print (wordlist)\nprint (len(wordlist))\n\n\n\n\n", "s=input()\r\nlst=[s]\r\nfor i in range(len(s)):\r\n s=s[-1]+s[:-1]\r\n lst.append(s)\r\nprint(len(set(lst)))", "s = input()\nour = set()\nfor i in range(50):\n our.add(s)\n s = s[-1] + s[:-1]\nprint(len(our))", "s = input()\r\nres = 1\r\nbuf = s[-1] + s[:len(s) - 1]\r\nwhile (buf != s):\r\n res += 1\r\n buf = buf[-1] + buf[:len(buf) - 1]\r\nprint(res, end = '')", "def f(n):\n c=n[-1]+n[:len(n)-1]\n return c\nn=input()\nl=[]\nfor i in range(len(n)):\n l.append(f(n))\n n = f(n)\nk=set(l)\nprint(len(k))\n\t \t \t \t \t\t \t\t \t\t \t\t", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=input().strip()\ns=set([])\nfor i in range(len(n)):\n d=n[-1]+n[:-1:]\n n=d[::]\n s.add(d)\nprint(len(s))\n", "s = input()\r\n\r\nn = len(s)\r\n\r\ni = 0\r\na = []\r\nwhile i < 50:\r\n s = s[-1] + s[:n-1]\r\n if s not in a:a.append(s)\r\n i += 1\r\nprint(len(a))", "s=input()\r\ntest=s\r\ncount=1\r\nfor i in range(len(test)):\r\n \r\n test=test[1:]+test[0]\r\n if test !=s:\r\n count+=1\r\n else:\r\n break \r\nprint(count) ", "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\nfor i in range(1, n + 1):\r\n if n % i:\r\n continue\r\n ok = 1\r\n for j in range(i):\r\n u = s[j]\r\n for k in range(j, n, i):\r\n if u ^ s[k]:\r\n ok = 0\r\n break\r\n if not ok:\r\n break\r\n if ok:\r\n ans = i\r\n break\r\nprint(ans)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nstring = input().strip()\r\ns = set()\r\n\r\nlength = len(string)\r\n\r\nfor rot in range(length):\r\n s.add(string[length-rot:] + string[:length - rot])\r\n\r\n# print(s)\r\nans = len(s)\r\n\r\nprint(ans)", "s = input()\ncnt = 1\nl = len(s)\np = 1\nd = []\nd.append(s)\nwhile p < l:\n n = s[-1] + s[:l-1]\n if n not in d:\n d.append(n)\n s = n\n p += 1\n\nprint(len(d))\n\n", "s = input()\nn = len(s)\nx = set(s[n - 1: n - 1 - i: -1][::-1] + s[0: n - i] for i in range(0, n))\nprint(len(x))\n", "def principal_period(s):\r\n i = (s+s).find(s, 1, -1)\r\n return None if i == -1 else s[:i]\r\ns = input()\r\na = principal_period(s) \r\nif a is not None:\r\n print(len(a))\r\nelif a is None:\r\n print(len(s))", "s = input()\r\nprint(len({s[-i:] + s[:-i] for i in range(50)}))", "import sys\r\n\r\nstring = input()\r\nstring2 = []\r\nstring2.append(string)\r\nlastword = string\r\ncnt = 1\r\n\r\nfor ch in range(len(string)):\r\n word = lastword[-1] + lastword[0:-1]\r\n if word not in string2:\r\n string2.append(word)\r\n cnt += 1\r\n lastword = word\r\nprint(cnt)", "s = input()\r\nls = list(s)\r\ntrack = []\r\ni = len(s) - 1\r\nwhile i >= 0:\r\n a = ls.pop()\r\n ls.insert(0, a)\r\n real = ''.join(ls)\r\n if real not in track:\r\n track.append(''.join(ls))\r\n i -= 1\r\nprint(len(track))\r\n", "s=input()\r\nl=[]\r\nl.append(s)\r\nfor i in range(len(s)-1):\r\n s=s[-1]+s[:len(s)-1]\r\n if s not in l:\r\n l.append(s)\r\nprint(len(l))\r\n", "s = input()\nn = []\n\nfor i in range (len(s)):\n n.append(s)\n temp = s[-1]\n s = temp + s[0:(len(s)-1)]\n\ncount = len(set(n))\nprint(count)\n\t \t \t\t\t\t \t \t \t\t \t \t \t \t \t", "s = input()\r\ne = s\r\nss = set()\r\nfor i in range(len(s)):\r\n e = e[-1] + e[:-1]\r\n ss.add(e)\r\nprint(len(ss))\r\n", "def main(s):\n n = len(s)\n se = set()\n for i in range(n):\n se.add(s[i:] + s[:i])\n return len(se)\n\nprint(main(input()))\n", "s=input()\r\nfrom collections import deque\r\ns=deque(s)\r\ntemp=s.copy()\r\ntemp.rotate()\r\ncount=1\r\nwhile s!=temp:\r\n\ttemp.rotate()\r\n\tcount+=1\r\nprint(count)", "s = input()\r\ny = len(s)\r\na = []\r\nfor i in range(len(s)):\r\n a.append(s[i:]+s[:i])\r\nb = []\r\nans = 0\r\nfor i in a:\r\n if i not in b:\r\n b.append(i)\r\n ans += 1\r\nprint(ans) ", "s = input()\r\nx = set()\r\nlength = len(s)\r\nfor i in range(length):\r\n ss = s[i:] + s[:i]\r\n x.add(ss)\r\nprint (len(x))", "*s, = input()\r\nst = [''.join(s)]\r\nfor i in range(len(s)):\r\n s.insert(0, s[-1])\r\n del s[-1]\r\n st.append(''.join(s))\r\nprint(len(set(st)))\r\n", "s=input()\r\ns2=s*2\r\na=set()\r\nfor i in range(len(s)):\r\n a.add(s2[i:i+len(s)])\r\nprint(len(a))\r\n", "s = input()\r\nused = set()\r\nn = len(s)\r\nfor i in range(n):\r\n gg = s[i:] + s[:i]\r\n used.add(gg)\r\nprint(len(used))\r\n", "s = input()\r\nprint(len({s[i:]+s[:i] for i in range(len(s))}))", "s = input()\r\nset = set()\r\nfor i in range(len(s)):\r\n\tset.add(s)\r\n\ts = s[-1]+s[:-1]\r\nprint(len(set))", "s = set()\r\nl = str(input())\r\nfor j in range(len(l)+10):\r\n\tl = l[len(l)-1] + l[0:len(l)-1]\r\n\ts.add(l)\r\nprint(len(s))", "n = input()\r\n\r\nl = []\r\nfor i in range(len(n)):\r\n l.append(n[i:]+n[:i])\r\nprint(len(list(dict.fromkeys(l))))", "s, w, count = list(input()), [], 1\r\nw.extend(s)\r\nwhile True:\r\n s.insert(0, s.pop(-1))\r\n if w != s:\r\n count += 1\r\n else:\r\n print(count)\r\n break\r\n", "s=input()\nm=[]\nfor i in range(len(s)):\n ss=s[len(s)-1]+s[:len(s)-1]\n if ss not in m:\n m.append(ss)\n s=ss\nprint(len(m))\n\n\t \t\t \t\t \t \t\t\t \t \t\t\t\t\t\t\t \t \t", "n=list(input())\r\ntam=len(n)\r\ncon=1\r\nw=n[:tam]\r\ny=n[:len(n)]\r\npas=True\r\ni=0;\r\nwhile (i<tam and pas==True): \r\n y.insert(0,w.pop())\r\n y.pop()\r\n if(y==n):\r\n pas=False\r\n i=tam\r\n else:\r\n con=con+1\r\n i=i+1\r\nprint(con)", "# You lost the game.\n\ns = str(input())\nn = len(s)\nL = [s]\n\ndef ok(L,s):\n for x in L:\n if x == s:\n return 0\n return 1\nfor i in range(n):\n s = s[1:]+s[0]\n if ok(L,s):\n L += [s]\n\nprint(len(L))\n", "t=input()\r\n#find the longest common substring\r\nl=len(t)\r\nf=0\r\nfor i in range(1,(l//2)+1):\r\n if l%i==0:\r\n c=l//i\r\n if t == c * t[:l//c]:\r\n print(i)\r\n f=1\r\n break\r\n \r\nif f==0:\r\n print(l)\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n ", "s=input()\r\nl=len(s)\r\nz=[]\r\nz.append(s)\r\nk=1\r\nfor i in range(l-1):\r\n s=s[-1]+s[:l-1]\r\n if s not in z:\r\n z.append(s)\r\n k+=1\r\nprint(k)\r\n\r\n", "s = input()\r\nres = s[-1] + s[:-1]\r\nx=0\r\nwhile(res != s):\r\n res = res[-1] + res[:-1]\r\n x += 1\r\nprint(x+1 )\r\n", "s = input()\r\na = set()\r\nwhile (s not in a):\r\n a.add(s)\r\n s = s[-1] + s[:-1]\r\n \r\nprint(len(a))", "x = input()\r\nk = set()\r\nfor _ in range(len(x)):\r\n temp = x[-1]\r\n x = x[:-1]\r\n x = temp + x\r\n k.add(x)\r\nprint(len(k))", "n=str(input())\r\ns=set()\r\nfor i in range(len(n)):\r\n\ts.add(n[i:]+n[:i])\r\nprint(len(s))\r\n", "s = input()\r\nn = len(s)\r\nt = {}\r\nt[s] = True\r\nfor i in range(n):\r\n\ts = s[1:] + s[0]\r\n\tt[s] = True\r\nprint(len(t))", "word = input()\r\naux = word\r\nn = len(word)\r\nres = 1\r\nwhile True:\r\n word2 = aux[n-1] + aux[0:n-1]\r\n if word2 != word:\r\n res+=1\r\n aux=word2\r\n else:\r\n break\r\nprint(str(res))\r\n", "# print(\"Input the string\")\nst = input()\n\ntheset = set()\ntheset.add(st)\n\nfor i in range(len(st)):\n st = st[-1] + st[0:len(st)-1]\n theset.add(st)\n\nprint(len(theset))\n \n", "line=input()\r\nlength=len(line)\r\nwords=[line]\r\nfor i in range(length):\r\n line=line[-1]+line[:(length-1)]\r\n if line not in words:\r\n words.append(line)\r\nprint(len(words))", "s=input()\r\nl=[]\r\nl.append(s)\r\nj=0\r\nwhile(j<len(s)-1):\r\n y=\"\"\r\n y=s[len(s)-1]\r\n i=1\r\n while(i<len(s)):\r\n y=y+s[i-1]\r\n i=i+1\r\n if y not in l:\r\n l.append(y)\r\n s=y \r\n j=j+1\r\nprint(len(l)) ", "from collections import defaultdict\r\nimport sys, os, math\r\n\r\nif __name__ == \"__main__\":\r\n #n, m = list(map(int, input().split()))\r\n s = input()\r\n st = {s}\r\n for i in range(len(s)):\r\n st.add(s[i:]+s[:i])\r\n print(len(st))\r\n ", "s=input()\r\ntemp=[]\r\ntemp.append(s)\r\nl=len(s)\r\nfor i in range(0,l):\r\n p=\"\"\r\n for j in range(1,l):\r\n p=p+s[j];\r\n p=p+s[0]\r\n s=p\r\n if(p not in temp):\r\n temp.append(p)\r\nprint(len(temp)) ", "s = input()\r\nb = list()\r\nb.append(s)\r\ncount = 1\r\nfor i in range(len(s)):\r\n\ts = s[len(s)-1]+s[:len(s)-1]\r\n\tif s not in b:\r\n\t\tb.append(s)\r\n\t\tcount+=1\r\nprint(count)", "f,num = input().strip(),1\r\nf1 = f[-1] + f[:-1]\r\nwhile f1 != f:\r\n num += 1\r\n f1 = f1[-1] + f1[:-1]\r\nprint(num)", "n = input().strip()\nl = []\nans = 0\nfor i in range(len(n)):\t\n\tif n[i:]+n[:i] not in l:\n\t\tl.append(n[i:]+n[:i])\n\t\tans += 1\n\telse:\n\t\tbreak\nprint(ans)", "s = list(input())\r\nn = len(s)\r\ndict = {}\r\nres = 0\r\nfor i in range (n):\r\n tmp = ''.join(s)\r\n if dict.get(tmp) == None:\r\n dict[tmp] = 1\r\n res += 1\r\n s.insert(0, s[n - 1])\r\n s.pop(n)\r\nprint(res)", "x=input()\ntime=1\nx=list(x)\nj=str(x)\nv=x[len(x)-1]\nwhile True:\n v=x[len(x)-1]\n q=1\n z=2\n while z<=len(x):\n x[len(x)-q]=x[len(x)-z]\n q+=1\n z+=1\n x[0]=v\n if str(x)==j:\n break\n else:\n time+=1\nprint(time)\n\n \n \n ", "s=input()\r\np=set()\r\nfor i in range(100):\r\n if s not in p:\r\n p.add(s)\r\n s=s[-1]+s[:len(s)-1]\r\nprint(len(p))", "s = input()\r\nans = lambda a: len({a[i:] + a[:i] for i in range(len(a))})\r\nprint(ans(s))", "a=input()\r\nn=len(a)\r\ns=[]\r\nfor i in range(n):\r\n a=a[n-1]+a[:n-1]\r\n s.append(a)\r\nprint(len(list(set(s))))", "a=input()\r\nn=len(a)\r\n\r\nlis=[]\r\nlis.append(a)\r\nfor i in range(1,n):\r\n newstr=a[i:n]+a[:i]\r\n lis.append(newstr)\r\n\r\nset_lis=set(lis)\r\n\r\nprint(len(set_lis))\r\n", "s=input()\r\nn=set()\r\nfor i in range(len(s)):\r\n\ta=s[-1]\r\n\ts=a+s[:-1]\r\n\tn.add(s)\r\nprint(len(n))", "def rotate_right(s):\r\n return s[-1] + s[:-1]\r\n\r\nt = input().strip()\r\nn = len(t)\r\ns = 1\r\nch = t \r\n\r\nfor i in range(n):\r\n t = rotate_right(t)\r\n if ch == t: \r\n break\r\n else:\r\n s += 1\r\n\r\nprint(s)\r\n", "def shift(a):\r\n b = a[len(a) - 1] + a[:len(a)-1]\r\n return b\r\n\r\nlis = [] \r\ninp = input().lower()\r\nctr = 0\r\nwhile ctr < len(inp):\r\n if inp not in lis:\r\n lis.append(inp)\r\n inp = shift(inp)\r\n ctr+=1\r\nprint(len(lis))", "my_str = input()\r\nmy_list = list(my_str)\r\nans_list = [my_str]\r\nfor i in range(1,len(my_str)):\r\n temp = my_list.pop()\r\n my_list.insert(0,temp)\r\n ans_list.append(\"\".join(my_list))\r\nmy_set = set(ans_list)\r\nprint(len(my_set))", "ch=input()\r\nl=[ch]\r\ns=1\r\nfor i in range(len(ch)):\r\n ch=ch[len(ch)-1]+ch[:len(ch)-1]\r\n if ch not in l:\r\n l.append(ch)\r\n s=s+1\r\nprint(s)\r\n", "s = input()\r\nansset = []\r\nfor i in range(len(s)):\r\n l = s[:len(s)-1]\r\n r = s[len(s)-1]\r\n s = r+l\r\n ansset.append(s)\r\n\r\nans = set(ansset)\r\nprint(len(ans))", "s = input()\nst = set()\n\nfor i in range(len(s)):\n st.add(s[i:] + s[:i])\n\nprint(len(st))\n", "s=input()\r\nl=[s]\r\nfor i in range(len(s)-1):\r\n s=s[-1]+s[:len(s)-1]\r\n l.append(s)\r\nprint(len(set(l)))", "string = input()\r\na = len(string)\r\nwords = set()\r\nfor x in range(a):\r\n words.add(string)\r\n letters = list(string)\r\n temp = letters[-1]\r\n del letters[-1]\r\n letters.insert(0, temp)\r\n string = \"\".join(letters)\r\nprint(len(words))\r\n", "st = input()\narr = []\nfor i in range(len(st)):\n\tarr.append(st[i:] + st[:i])\narr = sorted(arr)\ncnt = 1\nfor i in range(1,len(st)):\n\tif(arr[i] != arr[i-1]):\n\t\tcnt = cnt + 1\nprint(cnt)", "word=list(input())\nindex=0\nm=[]\nk=[]\nnum=0\nwhile index<len(word):\n m=m+[word.pop(-1)]\n word=m+word\n new=\"\".join(word)\n if new not in k:\n num+=1\n k=k+[new]\n m=[]\n index+=1\nprint(num)", "s = input()\r\nans = set()\r\nans.add(s)\r\nc = s[1:] + s[0]\r\nwhile c!=s:\r\n ans.add(c)\r\n c = c[1:] + c[0]\r\n\r\n\r\nprint(len(ans))\r\n\r\n", "a=list(input())\r\nd=[a]\r\nfor x in range(len(a)-1):\r\n\tb=a.copy()\r\n\tc=b[-1]\r\n\tb.pop()\r\n\tb.insert(0,c)\r\n\tif b not in d:\r\n\t\td.append(b)\r\n\t\ta=b\r\nprint(len(d))", "x=list(input())\r\ny=len(x)\r\nc=0\r\nk=list()\r\nfor i in range(y):\r\n g=\"\".join(x)\r\n if g in k:pass\r\n else:\r\n c+=1\r\n k.append(g) \r\n f=x[y-1]\r\n x.pop(y-1)\r\n x.insert(0,f)\r\nprint(c)", "def count_distinct_cyclic_shifts(s):\r\n distinct_words = set()\r\n n = len(s)\r\n \r\n for i in range(n):\r\n shifted_word = s[-i:] + s[:-i]\r\n distinct_words.add(shifted_word)\r\n \r\n return len(distinct_words)\r\n\r\ndef main():\r\n s = input().strip()\r\n result = count_distinct_cyclic_shifts(s)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input();l=len(s)\r\nst={s}\r\nfor i in range(l-1,0,-1):\r\n ss=s[i:]+s[0:i]\r\n st.add(ss)\r\nprint(len(st))", "s = input()\r\ndct = {}\r\nfor i in range(len(s)):\r\n\ta = (s[i:]+s[:i])\r\n\tif a not in dct: dct[a] = 1\r\nprint(sum(dct.values()))", "#!/bin/python3\r\n\r\nimport sys\r\n\r\nstri = input()\r\nstr_temp = \"\"\r\nl = []\r\nl.append(stri)\r\nfor i in range(1,len(stri)):\r\n str_temp = \"\"\r\n str_temp += stri[i]\r\n counter = i+1\r\n c2 = 1\r\n while c2 < len(stri):\r\n str_temp += stri[counter%len(stri)]\r\n counter += 1\r\n c2 += 1\r\n if str_temp not in l:\r\n l.append(str_temp)\r\n \r\nprint(len(l))\r\n", "def main():\n s = input()\n print(len({''.join(s[i] for i in range(j, j + len(s))) for j in range(1 - len(s), 1)}))\n\n\nif __name__ == '__main__':\n main()\n", "s=input()\r\nc=''\r\nd=0\r\ns1=s\r\nwhile(c!=s1):\r\n d+=1\r\n c=s[1:]+s[:1]\r\n s=c\r\nprint(d)", "s=input()\r\nk=s\r\nl=[]\r\nl.append(s)\r\nj=0\r\nc=1\r\nwhile j<len(s)-1:\r\n s=s[len(s)-1]+s[0:len(s)-1]\r\n if s not in l:\r\n #print(s)\r\n l.append(s)\r\n c=c+1\r\n j=j+1 \r\nprint(c) ", "S = input()\ns = set([])\nN = len(S)\n\nfor i in range(N):\n new_S = S[i:] + S[:i]\n s.add(new_S)\nprint(len(s))\n", "a = []\r\nstr = input()\r\nfor k in range(len(str)):\r\n s = \"\"\r\n s += str[len(str) - 1]\r\n for i in range(0, len(str) - 1):\r\n s += str[i]\r\n a.append(s)\r\n str = s\r\na = set(a)\r\nprint(len(a))", "def solve(s):\r\n og=s\r\n s+=s\r\n i=0\r\n cnt=0\r\n n=len(s)\r\n ln=n//2\r\n while i+ln<=n:\r\n tmp=\"\"\r\n for j in range(i, i+ln):\r\n tmp+=s[j]\r\n if tmp==og:\r\n cnt+=1\r\n if cnt==2:\r\n return i\r\n i+=1\r\n \r\ns=input()\r\nprint(solve(s))\r\n", "a = set()\r\ns = input()\r\nans = 0\r\nn = len(s)\r\nfor i in range(n):\r\n if not s in a:\r\n a.add(s)\r\n ans += 1\r\n s = s[n-1] + s[:n-1]\r\n #print(s)\r\nprint(ans)\r\n", "s = input()\r\n\r\ns_s = set()\r\nc = 0\r\n\r\nwhile c != len(s):\r\n s_s.add(s[len(s) - c :] + s[:len(s) - c])\r\n c += 1\r\n\r\nprint(len(s_s))", "s = input()\r\n\r\nse = set()\r\nfor _ in range(51):\r\n se.add(s)\r\n sl = s[1:]\r\n s = sl + s[0]\r\nprint(len(se))", "s=list(map(str,input()))\r\n\r\nn=list(s)\r\nl=len(s)\r\nc=0\r\nfor i in range(l):\r\n\tn.insert(0,n[-1])\r\n\tn.pop()\r\n\tc+=1\r\n\tif n==s:\r\n\t\tbreak\r\nprint(c)", "# Online Python compiler (interpreter) to run Python online.\n# Write Python 3 code in this online editor and run it.\ns = input()\nn = len(s)\ncount = n\nl = [0 for i in range(n)]\nl[0] = s\n\nfor i in range(1, n):\n w = l[i-1]\n l[i] = w[-1] + w[0:-1]\n\no = 1\nfor j in range(n):\n for k in range(n):\n if (k != j and l[j] == l[k]):\n l[k] = \"*\" * o\n o+=1\n count-=1\n \n\nprint(count)\n \n \t \t\t\t \t \t \t \t\t\t\t \t", "s = input()\r\narr = [s]\r\nlength = len(s)\r\ncount = 1\r\nfor i in range(1,length):\r\n s = s[-1] + s[:length-1]\r\n if s not in arr:\r\n count += 1\r\n arr.append(s)\r\nprint(count)", "a = input()\r\n\r\nl = []\r\n\r\nfor i in range(len(a)):\r\n\ts = a[i:] + a[:i]\r\n\tif s not in l:\r\n\t\tl.append(s)\r\n\r\nprint(len(l))", "from sys import stdin, stdout\ndef insr():\n s = input()\n return(list(s[:]))\n\ndef inss():\n s = input()\n return s[:]\n\ndef inlt():\n return(list(map(int,input().split())))\n\ninp = inss()\n\ns = set()\n\nn = len(inp)\nfor i in range(n):\n s.add(inp)\n inp = inp[1:] + inp[0]\n\nc = 0\nfor i in s:\n c += 1\n\nprint(c)", "s = input()\r\na= set()\r\nfor i in range(len(s)):\r\n a.add(s[i:] +s[:i])\r\nprint(len(a))\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nl = []\r\nfor i in s:\r\n l.append(i)\r\nt = set()\r\nfor i in range(len(s)):\r\n f = ''\r\n for j in l:\r\n f += j\r\n t.add(f)\r\n c = l.pop(0)\r\n l.append(c)\r\n #print(f)\r\n\r\nprint(len(t))", "s = input()\r\nc = set()\r\nfor i in range(len(s)):\r\n s = s[1:] + s[0]\r\n c.add(s)\r\nprint(len(c))\r\n", "word=list(input())\r\nx=[]\r\nstr1 = ''.join(word)\r\nx.append(str(str1))\r\ncount=1\r\nfor i in range(len(word)-1) :\r\n word.insert(0,word[-1])\r\n del word[-1]\r\n str1 = ''.join(word)\r\n if str1 not in x :\r\n count+=1\r\n x.append(str1)\r\nprint(count)", "a=input()\nb=list(a)\nc=len(b)\nd=0\ne=\"\"\nf=\"\"\ng=0\nwhile g<c:\n while d<c:\n e=e+str(b[d])\n d=d+1\n if f.find(e)>=0:\n pass\n else:\n f=f+\" \"+e\n d=0\n e=\"\"\n b=[b.pop()]+b\n g=g+1\nf=f.split()\nprint(len(f))\n", "s = input()\r\nd = s + s\r\nl = len(s)\r\nc = set()\r\nfor i in range(l):\r\n aux = d[i:i + l]\r\n if aux not in c:\r\n c.add(aux)\r\nprint(len(c))\r\n " ]

[ "f = lambda: map(int, input().split())\r\nfrom heapq import *\r\n\r\nn, k, x = f()\r\nt, h, p = 0, [], list(f())\r\n\r\nfor i in range(n):\r\n t ^= p[i] < 0\r\n heappush(h, (abs(p[i]), i))\r\n\r\nfor j in range(k):\r\n i = heappop(h)[1]\r\n d = p[i] < 0\r\n if not t: d, t = 1 - d, -x <= p[i] < x\r\n if d: p[i] -= x\r\n else: p[i] += x\r\n heappush(h, (abs(p[i]), i))\r\n\r\nfor q in p: print(q)", "import heapq\n\nn, k, x = [int(val) for val in input().split()]\na = [int(val) for val in input().split()]\n\ndata = [(val, 1, i) if val >= 0 else (-1 * val, -1, i) for i, val in enumerate(a)]\nheapq.heapify(data)\nsign = sum([1 if s == -1 else 0 for _, s, _ in data])\n\nif sign % 2 == 1:\n for i in range(k):\n e = heapq.heappop(data)\n heapq.heappush(data, (e[0] + x, e[1], e[2]))\nelse:\n e = heapq.heappop(data)\n if e[0] < k * x:\n s = (e[0] // x) + 1\n k -= s\n heapq.heappush(data, (s * x - e[0], -1 * e[1], e[2]))\n for i in range(k):\n e = heapq.heappop(data)\n heapq.heappush(data, (e[0] + x, e[1], e[2]))\n else:\n heapq.heappush(data, (e[0] - k * x, e[1], e[2]))\n\noutput = [0] * n\nfor val, s, i in data:\n output[i] = s * val\nprint(' '.join([str(val) for val in output]))\n \n", "\r\nimport math\r\nfrom bisect import bisect_right\r\nfrom bisect import bisect_left\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\nsys.setrecursionlimit(3*10**5)\r\n\r\nfrom random import randrange\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\nfrom collections import deque\r\n\r\n\r\ndef modInverse(a, m):\r\n m0 = m\r\n y = 0\r\n x = 1\r\n\r\n if (m == 1):\r\n return 0\r\n\r\n while (a > 1):\r\n q = a // m\r\n t = m\r\n m = a % m\r\n a = t\r\n t = y\r\n y = x - q * y\r\n x = t\r\n\r\n if (x < 0):\r\n x = x + m0\r\n\r\n return x\r\n\r\n\r\n\r\ndef sum(BIT, i):\r\n s = 0\r\n while i > 0:\r\n s += BIT[i]\r\n i -= i & (-i)\r\n return s\r\n\r\n\r\ndef update(BIT, i, v):\r\n while i < len(BIT):\r\n BIT[i] += v\r\n\r\n i += i & (-i)\r\n\r\n\r\ndef find(fen, k):\r\n curr = 0\r\n ans = 0\r\n prevsum = 0\r\n for i in range(19, -1, -1):\r\n if ((curr + (1 << i) < 200001) and fen[curr + (1 << i)] + prevsum < k):\r\n ans = curr + (1 << i)\r\n curr = ans\r\n prevsum += fen[curr]\r\n return ans + 1\r\n\r\ndef Rank(x,BIT) :\r\n\r\n return sum(BIT,x)\r\n\r\n\r\ndef least_significant_bit(i):\r\n return ((i) & -(i))\r\n\r\ndef prefix_sum(index,BIT):\r\n # 1-indexed\r\n i = index + 1\r\n result = 0\r\n while i > 0:\r\n result += BIT[i]\r\n i -= least_significant_bit(i)\r\n return result\r\n\r\ndef range_sum(start, end,BIT):\r\n return (prefix_sum(end,BIT) - prefix_sum(start - 1,BIT))\r\n\r\nimport heapq\r\n\r\nn,k,x=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nif(b.count(0)>k):\r\n print(*b)\r\nelse:\r\n cnt=0\r\n for i in range(n):\r\n if(b[i]<0):\r\n cnt+=1\r\n\r\n for i in range(n):\r\n if(b[i]==0):\r\n k+=-1\r\n if(cnt%2==0):\r\n b[i]=-x\r\n cnt+=1\r\n else:\r\n b[i]=x\r\n\r\n if(cnt%2==0):\r\n ind=-1\r\n val=float(\"inf\")\r\n for i in range(n):\r\n if(abs(b[i])<val):\r\n val=abs(b[i])\r\n ind=i\r\n tot=val//x+1\r\n if(k>=tot):\r\n k-=tot\r\n r=tot*x\r\n if(b[ind]>=0):\r\n b[ind]-=r\r\n else:\r\n b[ind]+=r\r\n else:\r\n r=k*x\r\n k=0\r\n if(b[ind]>=0):\r\n b[ind]-=r\r\n else:\r\n b[ind]+=r\r\n\r\n\r\n\r\n\r\n li=[]\r\n for j in range(n):\r\n li.append([abs(b[j]),b[j],j])\r\n heapq.heapify(li)\r\n while(k):\r\n k-=1\r\n curr=heapq.heappop(li)\r\n if(curr[1]>=0):\r\n curr[1]=curr[1]+x\r\n curr[0]=curr[0]+x\r\n\r\n else:\r\n curr[1]=curr[1]-x\r\n curr[0]=curr[0]+x\r\n\r\n heapq.heappush(li,curr)\r\n\r\n ans=[0 for i in range(n)]\r\n for j in li:\r\n ans[j[2]]=j[1]\r\n\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n" ]

[ "import math\r\n\r\nxp, yp, vp = map(int, input().split())\r\nx, y, v, r = map(int, input().split())\r\n\r\nR = math.sqrt(xp * xp + yp * yp)\r\nlen1 = math.sqrt(x * x + y * y - r * r)\r\nlen2 = math.sqrt(R * R - r * r)\r\ndeg1 = math.atan(len1 / r)\r\ndeg2 = math.atan(len2 / r)\r\ntl = 0\r\ntr = 1e9\r\nvp /= R\r\n\r\ndef check(t):\r\n deg = math.atan2(yp, xp) + t * vp\r\n nx = R * math.cos(deg)\r\n ny = R * math.sin(deg)\r\n M = abs(math.atan2(y, x) - math.atan2(ny, nx))\r\n if M > math.pi:\r\n M = math.pi * 2 - M\r\n return deg1 + deg2 >= M and math.sqrt((x - nx) ** 2 + (y - ny) ** 2) or len1 + len2 + r * (M - deg1 - deg2)\r\n\r\nfor _ in range(100):\r\n mid = (tl + tr) / 2\r\n if check(mid) / v <= mid:\r\n ans = mid\r\n tr = mid\r\n else:\r\n tl = mid\r\n\r\nprint(\"{:.9f}\".format(ans))\r\n" ]

[ "n = int(input())\r\nmassa = [1]\r\ni = 2\r\nd = set()\r\nwhile( len(massa) != n ):\r\n test = True\r\n for el in massa:\r\n if(el + i in d):\r\n test = False\r\n break\r\n if(test == True):\r\n for el in massa:\r\n d.add(el+i)\r\n massa.append(i)\r\n i=i+1\r\nfor b in massa:\r\n ans=\"\"\r\n for el in massa:\r\n ans+=\"0 \" if b==el else str(b+el)+\" \"\r\n print ( ans )", "N=int(input())\r\nANS=[[0]*N for i in range(N)]\r\n\r\nSET=set()\r\n\r\nA=[1,2]\r\nSET={3}\r\n\r\nfor i in range(2,N):\r\n for cost in range(3,1001):\r\n X=set()\r\n for j in range(i):\r\n X.add(A[j]+cost)\r\n\r\n if SET&X==set():\r\n A.append(cost)\r\n SET|=X\r\n break\r\n\r\nfor i in range(N):\r\n for j in range(N):\r\n if i!=j:\r\n ANS[i][j]=A[i]+A[j]\r\n\r\nfor ans in ANS:\r\n print(*ans)\r\n", "import sys\n\nreadline = sys.stdin.readline\n\n#input\ndef read()->int:\n return int(readline().strip())\n\n#solve\ndef solve(n: int)->list:\n result = [1,2,3]\n cans = set(range(4,1001))\n # total = 1\n while len(result) < n:\n for i in range(len(result)):\n for j in range(len(result)):\n if i == j:\n continue\n for k in range(len(result)):\n if k == i or k == j:\n continue\n cans.discard(result[i] + result[j] - result[k])\n result.append(min(cans))\n cans.discard(result[-1])\n return result\n\n#output\ndef write(data: list):\n for i in range(len(data)):\n line = [data[i] + data[j] if i!= j else 0 for j in range(len(data))]\n print(*line)\n\n\nwrite(solve(read()))\n\n\n#check\ndef check(result: list):\n edges = set()\n for i in range(len(result)):\n for j in range(i + 1, len(result)):\n edges.add(result[i] + result[j])\n print(len(edges), len(result) * (len(result) - 1) / 2)\n print(sorted(edges))\n\n# 1、边与点的权值转换\n# 2、不重复的枚举", "#codeforces 42d: strange town: math, constructive algorithm\r\n\r\ndef readGen(trans):\r\n\twhile 1:\r\n\t\tfor x in input().split():\r\n\t\t\tyield(trans(x))\r\nreadint=readGen(int)\r\n\r\nn=next(readint)\r\n\r\ndef constructRow(n):\r\n\tcan=[1 for i in range(1001)]\r\n\tb=[0 for i in range(n+1)]\r\n\tb[2]=1\r\n\tb[3]=2\r\n\tcan[1]=0\r\n\tcan[2]=0\r\n\tfor k in range(4,n+1):\r\n\t\tb[k]=b[k-1]+1\r\n\t\twhile (not can[b[k]]): b[k]+=1\r\n\t\tcan[b[k]]=0\r\n\t\tfor i in range(2,k):\r\n\t\t\tfor p in range(2,k):\r\n\t\t\t\tcan[b[k]+b[p]-b[i]]=0\r\n\treturn b\r\n\r\ndef constructMatrix(b,n):\r\n\tcan=[1 for i in range(1001)]\r\n\tfor i in range(2,n+1):\r\n\t\tfor j in range(2,n+1):\r\n\t\t\tfor p in range(2,n+1):\r\n\t\t\t\tcan[b[2]+b[3]+b[p]-b[i]-b[j]]=0\r\n\tx=1\r\n\twhile (not can[x]): x+=1\r\n\ta=[[0 for j in range(n+1)] for i in range(n+1)]\r\n\tfor i in range(n+1):\r\n\t\ta[1][i]=a[i][1]=b[i]\r\n\tfor i in range(2,n+1):\r\n\t\tfor j in range(i+1,n+1):\r\n\t\t\ta[i][j]=a[j][i]=b[i]+b[j]+x-b[2]-b[3]\r\n\treturn a\r\n\t\r\nb=constructRow(n)\r\n#print(b)\r\n\r\na=constructMatrix(b,n)\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,n+1):\r\n\t\tprint(\"{:4}\".format(a[i][j]),end='')\r\n\tprint()\r\n", "def check(a):\n # print(a)\n v = set()\n for i in a:\n for j in a:\n if i < j:\n if i + j in v:\n return False\n v.add(i + j)\n return True\n\nn = int(input())\ns = [0]\nfor i in range(1, n):\n for j in range(s[-1] + 1, s[-1] * 2 + 2):\n if check(s + [j]):\n s.append(j)\n break\n\nt = [[s[i] + s[j] if i != j else 0 for j in range(n)] for i in range(n)]\nfor i in t:\n for j in i:\n print(j, end=' ')\n print()" ]

[ "import sys\n\n\ndef solve(n, m, k):\n MOD = 10**9 + 7\n\n if sys.version_info.minor >= 8: # FIXME\n import math\n\n comb = [math.comb(n, i) for i in range(n + 1)]\n else:\n comb = [1]\n for i in range(1, n + 1):\n comb.append(comb[-1] * (n - i + 1) // i)\n\n # Number of ways to put x dots in every n-th column\n p = [[pow(comb[x], m // n + i, MOD) for x in range(n + 1)] for i in range(2)]\n\n # Number of ways to put x dots in columns range(i, n)\n remaining = m % n\n dp = [1] + [0] * k\n for i in reversed(range(n)):\n dp1 = [0] * (k + 1)\n for x in range(max(0, k - n * i), min(n * (n - i), k) + 1):\n for u in range(min(x, n) + 1):\n dp1[x] = (dp1[x] + p[i < remaining][u] * dp[x - u]) % MOD\n dp = dp1\n\n return dp[k]\n\n\nn, m, k = map(int, input().split())\nprint(solve(n, m, k))\n" ]

[ "import sys,math\r\ndef isleap(y):\r\n if y%400==0:\r\n return True \r\n elif y%4==0 and y%100!=0:\r\n return True \r\n else:\r\n return False\r\nn,k=map(int,sys.stdin.readline().split())\r\nr=n%k \r\nif r==0:\r\n r+=k \r\nelse:\r\n r=k-r \r\nprint(n+r) ", "def solve():\n n, k = [int(x) for x in input().split()]\n\n print((n + k) - (n % k))\n\n\nsolve()\n\n\t\t\t\t \t\t\t \t\t\t \t \t \t\t\t \t\t\t\t", "n, k = map(int, input().split())\r\nif n % k == 0:\r\n print(k * (n // k + 1))\r\nelse:\r\n print(k * (n // k + 1))", "[n, k] = map(int, input() .split())\na = int(n//k + 1)\n\nb = int(k*a)\nprint(b)\n", "def main(x, k):\r\n t = x // k\r\n c = t * k\r\n return c + k\r\n\r\nn, m = map(int, input().split())\r\nprint(main(n,m))", "a, b = map(int, input().split())\r\nc = a % b\r\n\r\nif c == 0:\r\n print(a+b)\r\nelse:\r\n print(a + (b - c))\r\n", "n , k = map(int,input().split())\r\nprint(n + (k-n%k))", "n, k = map(int, input().split())\r\n\r\nif n/k != int(n/k):\r\n print(k*(int(n/k)+1))\r\nelse:\r\n print((n//k+1)*k)\r\n", "n,x=map(int,input().split())\r\nn=n+1\r\nif n%x==0:\r\n print(n)\r\nelse:print(int(n/x+1)*x)", "import math\r\nstring = input()\r\nnumbers = string.split()\r\na, b = int(numbers[0]), int(numbers[1])\r\nprint((math.floor(a / b) + 1) * b)", "n,k= map(int,input().split())\r\nq=k\r\nif n%k!=0:\r\n print((n//k+1)*k)\r\nelse:\r\n print(n+k)", "a,b=map(int,input().split())\r\nq=(a//b)+1\r\nprint(q*b)", "#Johnny likes numbers\n[n,k] = map(int, input().split())\nx=(n//k)*k\nif x>n:\n print(x)\nif x<=n:\n print(x+k)\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,K=map(int,readline().split())\r\nN+=1\r\nans=N+(-N)%K\r\nprint(ans)", "n, k = map(int, input().split())\r\na = n // k\r\nprint(k * (a+1))", "import math\r\nn,k = map(int, input().split())\r\nif n % k == 0:\r\n print(n+k)\r\nelse:\r\n print(math.ceil(n/k)*k)", "#-------------------------------#\r\n#INCLUDE <Amirhossein_Alimirzaei>\r\n#INCLUDE <HajLorenzo>\r\n#-------------------------------#\r\n\r\nimport math\r\n\r\n__=list(map(int,input().split()))\r\n_CX0X1=__[0]%__[1]\r\nprint(math.ceil(__[0]/__[1])*__[1] if(_CX0X1!=0) else ((__[0]//__[1])+1)*__[1])", "import math as m\nn,k=map(int,input().split())\nf=n//k\nif f*k== int((n/k)*k):\n factor=m.ceil(n/k)+1\nelse:\n factor=m.ceil(n/k)\nprint(factor*k)\n \t \t\t\t \t\t \t\t\t\t \t\t\t \t\t \t", "#Jhony like nnumbers\r\n\r\n\r\nn,l = list(map(int,input().split()))\r\nif n>l:\r\n\th = (n//l)+1\r\n\tprint(h*l)\r\nelif n<l:\r\n\tprint(l)\r\nelse:\r\n\tprint(l*2)", "a, b = list(map(int, input().split()))\r\nc = (a//b) + 1\r\n\r\nprint(b*c)", "n , k = map(int,input().split())\r\n\r\n#The samllest num greater than n and div by k\r\n\r\nans = (n // k ) + 1\r\n\r\nprint(ans * k)", "import math\r\na = input()\r\na = a.split()\r\nb, c =int(a[0]), int(a[1])\r\nif b%c == 0:\r\n print(int((b/c+1)*c))\r\nelse:\r\n d = math.ceil(b/c)\r\n print(int(d*c))\r\n", "[n,k] = map(int, input().split())\nremainder = n % k\nprint(n + (k - remainder))", "n,k=map(int,input().split())\r\nif n<k:\r\n\tprint(k)\r\nelse:\t\r\n\tx=n//k\r\n\ty=k*x\r\n\twhile y<=n:\r\n\t\tx+=1\r\n\t\ty=k*x\r\n\t\tif y>=n:\r\n\t\t\tbreak\r\n\tprint(y)", "numbers = input()\nnumbers = numbers.split()\n\nn = int(numbers[0])\nk = int(numbers[1])\n\nremainder = n % k\nprint(int(k - remainder + n))\n\t\t \t \t\t \t\t \t \t\t \t\t \t\t \t \t", "# Coded By Block_Cipher\r\n\r\n\r\n\r\nn,k = list(map(int,input().split()))\r\n\r\nli = []\r\nprint((n//k+1)*k)", "l=list(map(int,input().split()))\r\nd =l[0]//l[1]\r\nprint(l[1]*(d+1))", "from math import *\r\n\r\nn,k = map(int,input().split())\r\nprint(((n+k)//k)*k)", "n, k = map(int,input().split())\nif n<k:\n print(k)\nelif n%k == 0:\n print(n+k)\nelse:\n print((n//k+1)*k)\n", "# print(\"Input n and k\")\nn,k = [int(x) for x in input().split()]\n\nprint(n+k - n%k)\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nprint(((n//k)+1)*k)", "from math import ceil\nInput=lambda:map(int,input().split())\n\nn, k = Input()\nx = max(n+1,k)\nif x%k==0:\n print(x)\nelse:\n print((x+k)-(x%k))\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nans = (n // k + 1) * k\r\nprint(ans)", "n,k = map(int,input().split(' '))\r\nprint( (n//k + 1)*k)", "n,k=map(int, input().split())\nif n%k==0:\n print (n+k)\nelse:\n print (n//k*k+k)", "N,K=map(int,input().split())\r\nprint((N//K+1)*K)", "n, k = map(int, input().split())\r\n\r\nif n >= k:\r\n i = n // k + 1\r\n print(i * k)\r\nelse:\r\n print(k)", "n,k=list(map(int,input().split()))\r\nc=n//k\r\nprint(k*(c+1))", "a,b=map(int,input().split())\r\nprint((a//b+1)*b)", "# encoding: utf-8\n\ndef process(m, n):\n t = m // n\n res = (t+1)*n\n return res\n\n\nif __name__ == '__main__':\n input_ = input().strip()\n m, n = map(int, input_.split())\n print(process(m,n))\n\t\t \t\t \t\t\t\t\t\t \t\t\t\t\t\t \t \t \t", "N,H=map(int,input().split())\r\nprint((N//H+1)*H)", "[n,k] = map(int, input().split())\r\nprint(n - n%k + k)", "n, k = map(int, input().split())\n\nprint(((n//k)+1)*k)\n \t \t \t\t\t\t \t\t\t \t\t \t\t\t\t \t", "n,k = map(int,input().split())\r\nv = n // k + 1\r\nprint(v * k)", "x,y=map(int,input().split())\r\nprint((int(x/y)+1)*y)\r\n", "import math\r\nn,k = map(int,input().split())\r\nif(n<k):\r\n print(k)\r\nelif(n%k==0):\r\n print((n//k+1)*k)\r\nelse:\r\n d = math.ceil(n/k)\r\n print(d*k)\r\n\r\n", "import math as m\r\nn,k=map(int,input().split())\r\nf=n//k\r\nif f*k== int((n/k)*k):\r\n factor=m.ceil(n/k)+1\r\nelse:\r\n factor=m.ceil(n/k)\r\nprint(factor*k)", "n,k=list(map(int,input().split()))\r\na=n%k\r\nb=k-a\r\nprint(n+b)", "a , b = map(int,input().split());print((-(-a//b)+(a%b==0))*b);", "def solution(t, x):\n r = t + (x - (t % x))\n print(r)\n[t, x] = input().strip().split()\nsolution(int(t), int(x))\n\t \t \t \t \t\t\t\t \t\t\t \t \t\t \t \t", "N,K = list(map(int, input().split()))\r\nrem = N%K\r\nx = N-rem\r\ndiv = x//K\r\nprint((div+1)*K)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nprint(k*int((n/k)+1))", "a,b=map(int,input().split())\nc=(a//b)+1\nprint(b*c)\n \t \t \t\t \t \t\t \t \t\t\t \t", "import sys\n\nfor line in sys.stdin:\n line = line.split()\n n = int(line[0])\n k = int(line[1])\n r= n%k\n print(n - r + k)", "t,x = [int(x) for x in input().split()]\nprint(int((t//x + 1.) * x))\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(' '))\n\nquotient = n // k\n\nprint(k * (quotient + 1))", "x,y = list(map(int,input().split()))\r\nprint(x+(y-(x%y)))", "n,k = list(map(int,input().split()))\r\nif n % k == 0:\r\n print(n+k)\r\nelse:\r\n r = (n%k)\r\n dif = (k-r)\r\n print(dif+n)\r\n\r\n", "n = [int(x) for x in input().split()]\nhold = n[0] % n[1]\nprint(n[0] + (n[1] - hold))", "n,k = map(int, input().split())\r\nn -= n%k\r\nn += k\r\nprint(n)", "n, k = map(int, input().split(' '))\r\nif n % k == 0:\r\n print(n + k)\r\nelse:\r\n x = n % k\r\n x = k - x\r\n n = n + x\r\n print(n)\r\n", "import math\r\nn,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nif n%k==0: print((int(n/k)+1)*k)\r\nelse: print((math.ceil(n/k)*k))", "n, k = list(map(int, input().split()))\n\nprint( (n // k + 1) * k)\n \t\t\t \t \t \t \t\t\t \t\t \t\t\t\t", "n,k=map(int,input().split())\r\nn+=1\r\nb=(n+k-1)//k\r\nprint(b*k)", "Q,K=map(int,input().split())\r\nprint((Q//K+1)*K)", "a,b=map(int,input().split())\r\nprint(((a//b)+1)*b)", "n,k=map(int,input().split(' '))\r\nif n%k==0:\r\n print(n+k)\r\nelse:\r\n ans=0\r\n i=n//k \r\n print(k*(i+1))", "import math\r\n\r\n\r\nl1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nk=l1[-1]\r\nprint((math.floor(n/k)+1)*k)", "n, k = map(int,input().split())\r\nif n % k == 0 :\r\n\tq = n // k\r\n\tprint((q + 1) * k)\r\nelse :\r\n\tr = n % k\r\n\tx = k - r\r\n\tprint(n + x)\r\n\t", "n , k = map(int,input().strip().split())\r\nans = k - n%k + n\r\nprint(ans)", "n, k = list(map(int, input().split()))\r\nx = n + (k - (n % k))\r\nprint(x)", "a,b = map(int,input().split())\r\n\r\nc = a//b\r\n\r\nprint(b*(c+1))\r\n", "[n,k] = map(int, input().split())\r\nprint(n + (k - n%k))", "n,k=map(int, input().split())\r\nx=(n//k+1)*k\r\nprint(x)\r\n", "[n,k] = map(int, input().split())\r\nprint((k-(n%k))+n)", "# Johny Likes Numbers\nimport math\ndef number(n, k):\n return math.floor(n / k + 1) * k\n\n\nn, k = list(map(int, input().split()))\nprint(number(n, k))", "n,m=map(int,input().split())\r\nx=n%m\r\nx=m-x\r\nprint(n+x)", "a,b = map(int,input().split())\r\nprint((a//b+1)*b)", "n,k=map(int,input().split())\r\nif n>k:\r\n print((n//k+1)*k)\r\nelif n<k:\r\n print(k)\r\nelse:\r\n print(k*2)\r\n", "#██████████ █ █ /█\\ █ █ ███ /█\\ ██████████████\r\n\"█ █ █ /███\\ █ █ █ ██ /███\\ /██/ \"\r\n#█ █ █ /█████\\ █ █ █ ██ /█████\\ /██/ \r\n\"█ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n#██████████ █████████ █(:| █ ████████ ████ █ █ /██/ \"\r\n\" █ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n# █ █ █ ███████ █ █ █ ██ ███████ /██/\r\n\" █ █ █ █ █ █ █ █ ██ █ █ ██/ \"\r\n#██████████ █ █ █ █ █ █ ███ █ █ ██████████████\r\nimport math\r\nx,y=map(int,input().split())\r\nd=x/y\r\nd1=math.floor(d)\r\nd1=d1+1\r\nprint(d1*y)\r\n", "l=list(map(int,input().split()))\r\n\r\nt=l[0]//l[1]+1\r\nprint(t*l[1])", "x=list(map(int, input().split()))\r\nn=x[0]\r\nk=x[1]\r\ns=n//k\r\ns=s+1\r\nprint(s*k)", "n,k=list(map(int,input().split()))\r\na=(n//k)+1\r\na=a*k\r\nprint(a)", "n,k=map(int,input().split(' '))\nif n%k==0:\n print(n+k)\nelse:\n print(k-n%k+n)\n \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)//m *m)\r\n", "import sys\nimport math\n\ndef main():\n str_list = sys.stdin.readline().strip(\"\\n\").split(\" \")\n number_list = [int(str(i)) for i in str_list]\n\n t = number_list[0]\n x = number_list[1]\n res = math.ceil(t / x)\n if(t % x == 0):\n res += 1\n res *= x\n print(res)\n return res\n\nmain()\n\t \t \t \t \t\t\t \t\t \t \t\t \t \t\t", "n,k=map(int,input().split())\r\na=(n//k+1)*k\r\nprint(a)", "a,b=map(int,input().split())\r\nc=a%b\r\nif c==0:\r\n print(a+b)\r\nelse:\r\n print(a+(b-c))", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nprint((n//k+1)*k)", "n,k = list(map(int,input().split()))\r\nprint((n+k)-(n%k))", "n,k=map(int,input().split())\r\nif(n%k):\r\n print(n-n%k+k)\r\nelse:\r\n print(n+k)", "'''Codeforces Problem XX'''\r\nfrom time import process_time\r\nfrom sys import argv\r\n\r\ndef solve():\r\n '''Solve the problem'''\r\n n, k = map(int, input().split())\r\n print((n // k + 1) * k)\r\n\r\nif len(argv) > 1:\r\n startTime = process_time()\r\n solve()\r\n print('Elapsed Time:', process_time() - startTime)\r\nelse:\r\n solve()\r\n", "n, k = map(int, input().split())\nd = (n - n % k) // k + 1\nprint(d * k)", "import math\r\nn,m=(int(i) for i in input().split())\r\na=(n+1)/m\r\nb=math.ceil(a)\r\nprint(b*m)\r\n\r\n", "def LI():\r\n return list(map(int,input().split()))\r\ndef I():\r\n return int(input())\r\n\r\ndef solve():\r\n n,k=LI()\r\n t=(n+k-1)//k\r\n x=t*k\r\n if x<=n:\r\n x+=k\r\n print(x)\r\n\r\nsolve()", "n,k=map(int,input().split())\r\nm=n//k\r\nprint((m+1)*k)", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out.py\",\"w\")\r\nn,k=map(int,input().split())\r\nprint(n+(k-n%k))", "[n,k]=map(int,input().split())\nx=(n//k)*k\nif x<=n:\n x=x+ k\nprint (x)\n", "def solve():\r\n n,m=list(map(int,input().split()))\r\n print(n + m - n % m)\r\nsolve()", "a,b=map(int,input().split(' '))\nc=a//b+1\nprint(c*b)\n\t\t\t \t \t \t \t \t\t \t\t\t", "n,l=map(int,input().split())\r\nprint(n+l-(n%l))", "n, k = map(int, input().split())\n\nrem = n%k\nif rem==0:\n print(n+k)\nelse:\n print(n+(k-rem))\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, k = map(int, input().split())\ndiv = n // k\nprint(k * (div+1))\n \t \t\t \t\t\t\t \t \t\t\t\t\t \t\t \t", "n,k=map(int,input().split())\r\nprint(int((n)/k+1)*k)", "[n,k]=map(int, input().split())\r\nif n/k==n//k:\r\n\tprint(n+k)\r\nelse:\r\n\tx=int(((n//k)+1)*k)\r\n\tprint(x)", "n, k = map(int, input().split())\r\n\r\nprint( n // k * k + k )", "n,k=map(int,input().split())\r\np=n//k \r\nprint(k*(p+1))", "[n,k] = map(int, input().split())\nif n % k == 0:\n print (n+k)\nelse:\n print ((n//k)*k+k)\n\n", "n, k = [int(x) for x in input().split()]\r\nprint(n + k - (n%k))", "n,k=map(int,input().split())\r\nr=(n+k)%k\r\nif r==0:\r\n print(n+k)\r\nelse:\r\n print(n+k-r)", "a, b = tuple(map(int, input().split()))\nprint(((a // b) + 1) * b)\n", "n,k=map(int,input().split())\r\nprint((n//k+1)*k)\r\n \r\n", "n,k=map(int,input().split())\r\nprint((-(-n//k)+(n%k==0))*k)", "n,k = map(int,input().split())\nn -= n%k\nprint(n+k)", "string=input()\r\ns=string.split()\r\nn=int(s[0])\r\nk=int(s[1])\r\nif(n%k==0):\r\n x=n+k \r\nelse:\r\n z=n//k \r\n z=z+1 \r\n x=z*k\r\nprint(x)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Jul 10 10:35:25 2020\n\n@author: shailesh\n\"\"\"\n\nimport math\n\nn,k = [int(i) for i in input().split()]\n\nprint(k*math.floor(n/k+1))", "s = input()\n\nt,x = list(map(int, s.strip().split(\" \")))\n\nif t < x:\n print(x)\nelse:\n num = t//x + 1\n print(num * x)\n \t \t \t \t \t \t \t \t \t \t\t \t \t\t", "n,k=[int(x) for x in input().split()]\r\nif n%k==0:\r\n\tprint(n+k)\r\nelse:\r\n\tprint(n+k-n%k)", "#重要\r\n\r\nn, k = map(int, input().split())\r\n\r\nprint(n - n % k + k)", "n, k = map(int, input().split())\r\n\r\nx = ((n // k) + 1) * k\r\nprint(x)", "n,k=map(int,input().split())\r\np=n//k\r\nprint(k*(p+1))", "nn, kk = list(map(int, input().split()))\nprint(nn // kk * kk + kk)\n \t\t \t\t \t\t\t \t\t\t \t \t\t \t \t \t\t", "from sys import stdin\r\n\r\nn,k = map(int, stdin.readline().rstrip().split())\r\nx = n+k-(n%k)\r\nprint(x)", "[n,k] = map(int, input().split())\r\n\r\nx = (n//k)*k\r\n\r\nif x<=n:\t\t\r\n x = x + k\r\nprint(x)\r\n", "n=list(map(int,input().split()))\r\ns=1\r\nif(n[1]>n[0]):\r\n print(n[1])\r\nelse:\r\n w=n[0]//n[1]\r\n while(True):\r\n z=n[1]*w\r\n w=w+1\r\n if(z>n[0]):\r\n print(z)\r\n break\r\n", "def main():\n\tn,k = map(int,input().split())\n\tresult =1\n\ti =n//k\n\twhile result<=n:\n\t\tresult = i*k\n\t\ti+=1\n\tprint(result)\nmain()\n", "from math import ceil\r\nn, k = map(int, input().split())\r\ni = ceil((n+1)/k)\r\nprint(i*k)", "n,m=map(int,input().split())\r\nprint(n+(m-(n%m)))", "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]))#might need to remove the -1\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn, k = invr()\r\ni = n//k\r\nwhile True:\r\n if k*i>n:\r\n print(k*i)\r\n break\r\n i+=1", "n,k=map(int,input().split())\r\n#no*k>n\r\nfloor_value=n//k\r\nans=(floor_value+1)*k\r\nprint(ans)\r\n", "x=input().split(\" \")\r\nn=int(x[0])\r\nk=int(x[1])\r\nsn=(n//k)+1\r\nprint(k*sn)", "n, k = (int(el) for el in input().split())\r\nprint(((n + k) // k) * k)", "X = list(map(int, input().split()))\r\nprint(X[1] if X[0] < X[1] else X[0] + (X[1] - (X[0] % X[1])))\r\n", "n1,k1=input().split();n=int(n1);k=int(k1);print (n-(n%k)+k)", "a,x=map(int,input().split())\r\nc=a//x\r\nc+=1\r\nprint(c*x)\r\n", "a = list(map(int,input().split()))\r\nc = a[0]//a[1]\r\nprint(a[1]*(c+1))", "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,k=read_ints()\n\tprint(((n+k)//k)*k)\n\nsolve()\n", "w=input().split()\r\na=int(w[0])\r\nb=int(w[1])\r\nif a%b==0:\r\n print(a+b)\r\nelif a>b:\r\n print(((a//b)+1)*b)\r\nelse:\r\n print(b)\r\n", "n, k = [int(x) for x in input().split()]\r\nx = k\r\n\r\nif k>n:\r\n print(k)\r\nelse:\r\n print(k * (int(n/k) +1))\r\n", "import sys,math\r\nn,k=map(int,sys.stdin.readline().split())\r\nprint((n//k+1)*k)", "n,k=map(int,input().split())\r\nif n==1 and k==1:print(2)\r\nelse:print((n//k+1)*k)", "n, k = [int(i) for i in input().split()]\r\nprint(n + k - n % k)", "p,q=map(int,input().split())\np=p//q\nprint(q*(p+1))\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 = n // k * k;\nwhile a <= n:\n a += k\nprint(a)\n", "[a,b]=map(int,input().split())\nans=int(a/b)\nprint(b*(ans+1))", "#import sys\r\n#sys.stdin = open('in', 'r')\r\n#n = int(input())\r\n#a = [int(x) for x in input().split()]\r\nn,k = map(int, input().split())\r\n\r\nprint(k*(n//k) + k)\r\n", "n,k=map(int,input().split())\r\np=n%k\r\nif p==0:\r\n print(n+k)\r\nelse:\r\n print(n+(k-p))", "x = list(map(int, input().split(\" \")))\r\nprint(x[0]+x[1]-(x[0]-(x[0]//x[1])*x[1]) if x[0]%x[1]!=0 else x[0]+x[1])", "n,k=map(int,input().split())\r\nprint(n+k-(n%k))", "n,k = list(map(int,input().split()))\r\nprint(n + k - n % k)\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/678/A\r\n\r\nn, k = map(int, input().split())\r\n\r\nx = n // k + 1\r\nprint(x * k)", "def main():\r\n n,k=map(int,input().split())\r\n t=n//k\r\n m=n+1\r\n print((t+1)*k)\r\n return\r\nmain()\r\n\r\n", "a, b = input().split()\r\na, b = int(a), int(b)\r\nprint((a // b + 1) * b)", "a ,b = map(int ,input() .split())\r\nq = (a // b) + 1\r\nprint(q * b)", "n,k=map(int,input().split())\r\nprint((n+k)//k*k)", "t,x = list(map(int,input().strip().split(' ')))\ndef fun(t,x):\n tmp = (t//x)*x\n res = tmp if tmp > t else tmp+x\n return res\nprint(fun(t,x))\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()));print(n+k-n%k)", "A,B = map(int,input().split())\r\nprint((A//B+1)*B)", "#H\n\nn, k = map(int, input().split())\n\n#x = n + 1\n#if n%k==0:\nprint(k*((n//k)+1))\n#else:\n #print(k*((n//k)))\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\nx = (n // k + 1) * k\r\nprint(x)\r\n", "def main():\r\n n, k = [int(c) for c in input().split()]\r\n print(k * (n // k + 1))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "[n, k] = [int(x) for x in input().split()]\r\nprint(n+k-(n%k) if n%k != 0 else n+k)\r\n", "n , k = [int(x) for x in input().split()]\r\n\r\nif n%k==0:\r\n print(n+k)\r\nelse:\r\n x = n%k\r\n print(n+k-x)\r\n", "n, k = map(int, input().split())\nr = n % k\ns = n + (k-r)\nprint(s)\n \t\t \t\t \t \t \t\t \t\t \t", "n,k=map(int,input().split())\r\ns=n%k\r\nprint(n+(k-s))\r\n", "[n,k] = map(int, input().split())\r\nif n%k == 0:\r\n print(n+k)\r\nelif n < k: \r\n print(k)\r\nelse: \r\n print((n//k) * k + k)", "n,k = map(int,input().split())\r\nprint(n + k - n % k)", "n,k=[int(x) for x in input().split()]\r\nh=n//k\r\np=k*(h+1)\r\nprint(p)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nqt = n//k\r\nans = k*((n//k)+1)\r\nprint(ans)", "m,s=map(int,input().split())\r\na=(m+s)//s\r\nprint(a*s)", "n, k = map(int, input().split())\nr = n % k\nprint(n + k - r)\n", "N,L=map(int,input().split())\r\nprint((N//L+1)*L)", "'''\r\nName : Jaymeet Mehta\r\ncodeforces id :mj_13\r\nProblem : Johny Like numbers\r\n'''\r\nfrom sys import stdin,stdout\r\nN,K = map(int,stdin.readline().split())\r\nprint(N+K-(N%K))", "n, k = map(int, input().split()); print(int(n/k)*k+k)", "import sys\n\nnums = sys.stdin.readline().split(' ')\nn, k = int(nums[0]), int(nums[1])\nprint(k-(n % k)+n) ", "A,B= map(int, input().split())\r\nC=(1 + (A // B))\r\nprint(C*B)", "text1 = input()\ntext = text1.split(\" \")\ncount = (int(text[0]) // int(text[1]) + 1) * int(text[1])\nprint(count)\n\n \t\t\t\t \t \t\t\t \t \t", "import math\r\nn,k=map(int,input().split())\r\nprint((math.ceil(n//k)+1)*k)", "n, k = [int(s) for s in input().split(\" \")]\r\ntimes = (n+k-1)//k\r\nans = k*times\r\nif ans == n:\r\n print(ans + k)\r\nelse:\r\n print(ans)", "def vasya(n, k):\r\n return n + (k - n % k)\r\n\r\n\r\nN, K = [int(i) for i in input().split()]\r\nprint(vasya(N, K))\r\n", "n, k=map(int, input().split())\ndivisor = int(n/k+0.99)\nif divisor*k>n:\n print(divisor*k)\nelse:\n print((divisor+1)*k)\n\t\t \t\t\t\t \t \t \t \t\t \t\t\t\t \t\t", "a,b=map(int,input().split())\nmul=(a//b)+1\nprint(b*mul)\n \t\t \t\t \t\t \t \t \t\t\t \t\t\t \t", "l=list(map(int,input().split()))\nprint((l[0]//l[1]+1)*l[1])\n\n\t\t\t\t \t \t \t\t \t \t\t \t \t \t\t", "n, k = [int(x) for x in input().split()]\n\na = n//k + 1\nprint(a * k)\n", "x, y=map(int, input().split())\r\nprint(x+y-x%y)", "n,k=map(int,input().split())\r\nprint(k*(int(n/k)+1))", "\r\nn, k = list(map(int, input().split()))\r\nif max(n+1, k) % k == 0:\r\n print(max(n+1, k))\r\nelse:\r\n print((max(n+1, k)+k)-(max(n+1, k) % k))\r\n# CodeForcesian\r\n# ♥\r\n# Memrise\r\n", "n,k = map(int,input().split())\r\na = n//k\r\nprint((a+1)*k)", "n, k = list(map(int, input().split()))\r\n\r\ni = int(n / k)\r\nres = k * i\r\n\r\nwhile n >= res:\r\n res += k\r\nprint(res) ", "from math import ceil\r\nn,k=map(int,input().split())\r\nif n%k==0:\r\n print((n//k+1)*k)\r\nelse:\r\n print(ceil(n/k)*k)\r\n", "n,k = map(int,input().split())\r\nprint(k*(n//k+1))", "[n,k] = map(int,input().split())\r\nr = n%k\r\nprint(n+k-r)", "a = input().split()\ns = int(a[0]) // int(a[1])\nprint(int(a[1]) * (s + 1))", "n, x = (input().split())\r\nn , x = int(n), int(x)\r\n#n = int(input())\r\n#a = input()\r\n#a = a.split()\r\n#a = [int(x) for x in a]\r\n#n , x = a\r\n\r\nk = n // x\r\n\r\n\r\n\r\nprint(k * x + x)", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\nn, k = IL()\r\nprint((n//k+1)*k)", "from math import ceil\r\nn,k=map(int,input().split())\r\na=ceil(n/k)\r\nif k*a>n:\r\n\tprint(k*a)\r\nelse:\r\n\ta+=1\r\n\tprint(k*a)", "n, k = [int(i) for i in input().split()]\r\nprint((n//k+1)*k)", "#Johnny likes numbers\n[n,k] = map(int,input().split())\nprint(n//k*k+k)\n \n", "n,k = map(int,input().split())\r\nl = n%k\r\nb = k-l\r\nans = n+b\r\nprint(ans)\r\n", "x,y=map(int,input().split())\r\nprint((x//y+1)*y)\r\n", "n,k=map(int,input().split(\" \"))\r\nprint(n+(k-n%k))", "from sys import stdin, setrecursionlimit, stdout\r\n\r\n\r\ndef solve():\r\n n, k = (int(s) for s in stdin.readline().split())\r\n if n % k == 0:\r\n print(n+k)\r\n else:\r\n print(n+(k-n % k))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-07 22:45:02\nLastEditTime: 2021-11-07 22:46:19\nDescription: Johny Likes Numbers\nFilePath: CF678A.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n print((n // k + 1) * k)\n\n\nif __name__ == '__main__':\n func()\n", "n, k = map(int, input().split())\r\nr = n % k\r\nprint(n + k - r)\r\n", "n,k=map(int,input().split())\nprint((n // k + 1) * k)\n \t \t\t\t\t \t \t \t\t\t \t \t \t\t\t", "# damm easy problem\r\na,b=map(int,input().split())\r\nprint((a//b+1)*b)\r\n#check the current divisor and add one to it", "a,b=map(int,input().split())\r\nprint(b*(a//b+1))\r\n#jodi_konodin_jhore_jhore_jay_ondhokar", "n,k = map(int,input().split())\r\nrem = n%k\r\nprint(n+k-rem)", "a = [int (a) for a in input().strip().split()]\r\n\r\nab = a[0] % a[1]\r\nbb = a[1] - ab\r\n\r\nprint(a[0] + bb)", "n,k=list(map(int,input().split()))\r\nif(k>n):\r\n print(k)\r\nelse:\r\n a=n//k\r\n a=a+1\r\n print(a*k)", "[n,k] = map(int, input().split())\r\nprint(n+(k-n%k))\r\n", "import math\nline = input()\nwords = line.split()\na = int(words[0])\nb = int(words[1])\n\ndivided = math.floor(a/b)\nresult = (divided+1) * b\nprint(result)\n\n\n\n\n", "n,k=map(int,input().split())\r\ns=k-n%k\r\nprint(n+s)\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nif a==b:\r\n print(a*2)\r\nelif a<b:\r\n print(b)\r\nelse:\r\n print(((a//b)+1)*b)\r\n", "temp = input()\ni = int(temp.split()[0])\nn = int(temp.split()[1])\nprint(((i//n)+1)*n)", "import math\nno = input().split()\nfor u in range(len(no)):\n no[u] = int(no[u])\n\nr = no[0] / no[1]\nt = math.trunc(r)\na = no[1] * (t + 1)\n\nprint(a)\n\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()[:2])\r\nif n%k==0:\r\n\tprint(n+k)\r\nelse:\r\n\tprint(n+(k-(n%k)))", "nk = list(map(int, input().split()))\r\nx = ((nk[0] // nk[1]) + 1) * nk[1]\r\nprint(x)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n ans = n // k * k\r\n while ans <= n:\r\n ans += k\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n , k = map(int,input().strip().split())\r\nans = (int(n/k) + 1)*k\r\nprint(ans)", "[n,k]= map(int,input().split())\r\nprint(k-n%k+n)", "n , k = map(int,input().split())\r\nprint(n+k-n%k)", "n,k = map(int,input().split())\nif (n < k):\n print(k)\nelse:\n print(((n // k) + 1) * k)\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 = map(int, input().split())\r\nprint(int(n/k+1) * k)", "n, k = map(int, input().split())\r\nn = n + k - n % k\r\nwhile n % k != 0:\r\n n += 1\r\n\r\n\r\n\r\nprint(n)\r\n\r\n#1 4\r\n#4\r\n#5 4 3 2\r\n#2 1 3 2\r\n\r\n#3\r\n\r\n ", "vamshi,z=map(int,input().split())\r\nprint((vamshi//z+1)*z)", "#!/usr/bin/python\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nn, k = [int(x) for x in input().split()]\r\nprint(n + (k - n % k))\r\n", "n,k=map(int,input().split())\r\nprint((n//k + 1)*k)", "n,k=map(int,input().split())\r\nprint(k*((n//k)+1))", "n, k = input().split(' ')\nf = int(n) // int(k)\nx = (f+1) * int(k)\nprint(x)\n\t \t\t \t \t\t\t \t \t \t\t \t", "n,k=map(int,input().split())\r\nprint(((n//k)+1)*k)", "import math\r\nn,k = map(int, input().split())\r\nans = math.floor(n // k) + 1\r\nprint(ans * k)", "n, k = map(int, input().split())\nprint((0 - -(n + 1) // k) * k)\n", "a, b=map(int, input().split())\r\nx=a%b\r\ny=b-x\r\ns=a+y\r\nprint(s)", "n, k = [int(x) for x in input().split()]\r\nprint(((n + k) // k) * k)", "n, k = input().split()\nn = int(n)+1\nk = int(k)\nif n%k ==0:\n print(n)\nelse:\n print(n + (k - (n%k)))\n \t \t \t \t\t \t\t\t \t \t \t \t", "n,k=map(int,input().split())\r\nx=n+k-n%k\r\nprint(x)", "#encoding:utf-8\ninputs=input()\nt,x=[int(i) for i in inputs.strip().split()]\n\ni=t%x\nj=t//x\n\nprint(x*(j+1))\n\t\t \t\t \t \t \t\t\t \t \t \t\t \t\t", "n, k = [int(x) for x in input().split()]\r\nprint(((n // k) + 1) * k)", "# A. Johny Likes Numbers\n\nn, k = map(int, input().split())\n\nif n % k == 0:\n print(n + k)\nelse:\n print(((n + k - 1) // k) * k)\n", "x=input().split(\" \")\nn=int(x[0])\nk=int(x[1])\nsn=(n//k)+1\nprint(k*sn)\n\t \t \t\t\t\t \t \t \t \t \t\t\t\t\t", "[n, k] = map(int, input().split())\r\nd = n//k\r\nprint (k * d + k)\r\n", "nk = input(\"\").split(' ')\r\n\r\nn = int(nk[0])\r\nk = int(nk[1])\r\n\r\nrem = n%k \r\nx = n-rem\r\ndiv = x//k\r\n\r\n\r\nprint((div+1)*k) \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n", "k,n=map(int,input().split())\r\nr=k%n\r\nr=(k-r)+n\r\nprint(r)\r\n", "from cmath import *\r\nfrom decimal import *\r\n\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\n\r\ndef solves():\r\n n,m=map(int,input().split())\r\n print(((n//m)+1)*m)\r\n\r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "n, k = map(int, input().split())\r\n\r\nif n%k ==0:\r\n print(n+k)\r\nelse:\r\n print(n+(k-n%k))", "def solution(l1):\r\n n=l1[0]\r\n k=l1[1]\r\n return n+k-n%k\r\ndef answer():\r\n l1=[int(x) for x in input().split()]\r\n print(solution(l1))\r\nanswer()", "[n,k] = map(int, input().split())\nx = ((n//k) + 1)*k\nprint (x)", "n,k=map(int,input().split())\r\nif(n%k==0):\r\n print(n+k)\r\nelse:\r\n d=n%k\r\n v=k-d\r\n print(n+v)\r\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\nr = n % k\r\nprint(n + (k - r))\r\n", "n, k = map(int, input().split())\r\nx = k\r\nif k == 1:\r\n print(n + 1)\r\nelse:\r\n while x <= n:\r\n x += k\r\n print(x)\r\n", "import sys\n\nfor line in sys.stdin:\n a = int(line.strip().split(' ')[0])\n b = int(line.strip().split(' ')[1])\n res = (a//b + 1) * b\n print(res)\n \t \t \t\t \t \t \t \t\t\t\t \t", "a,b=map(int,input().split())\nprint(b*(a//b+1))\n#jodi_konodin_jhore_jhore_jay_ondhokar\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())\nif n%k == 0:\n print(n+k)\nelse:\n print(((n+k-1)//k)*k)\n", "import sys\r\n\r\nn, k = map(int, input().split())\r\nprint((n + k) // k * k)\r\n", "n, k = [int(i) for i in input().split()]\r\nans = k - n % k + n\r\nprint(ans)\r\n", "def main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n ratio = n // k\r\n return k * (ratio + 1)\r\n\r\n\r\nprint(main_function())", "n,k = map(int ,input().split())\r\ni=n%k\r\nr=abs(k-i)\r\nprint(n+r)\r\n", "n,k=map(int,input().split())\r\na=n//k\r\nprint(k*(a+1))\r\n\r\n", "n,k=map(int,input().split())\r\na=n%k\r\nans=n+k-a\r\nprint(ans)", "import math\r\n\r\nn, k = map(int, input().split())\r\nif n % k == 0:\r\n print(n+k)\r\nelse:\r\n print(math.ceil(n / k) * k)", "def numbers(n, k):\r\n return n + k - n%k\r\n \r\nn, k = map(int, input().split())\r\nprint(numbers(n, k))", "n,k=[int(x) for x in input().split()]\r\nif n%k==0:\r\n print(((n//k)+1)*k)\r\nelse:\r\n print(n+k-n%k)", "n,k=map(int,input().split())\r\nprint(((n+1)//k+((n+1)%k>0))*k)\r\n", "n,k=map(int,input().split())\r\na=n//k\r\nprint((a+1)*k)\r\n", "n, k = [int(x) for x in input().split(' ')]\r\nprint(n + k-n%k)\r\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nprint(n-(n%k)+k)", "n,m=map(int,input().split())\r\nx=n%m\r\nif(x==0):\r\n print(n+m)\r\nelse:\r\n print(n+(m-x))\r\n", "n,m=map(int,input().split())\r\nprint(((n//m)+1)*m)\r\n\r\n\r\n", "import math\r\nn,k=map(int, input().split())\r\nif not (n/k).is_integer():\r\n print(math.ceil(n/k)*k)\r\nelse:\r\n print(((n//k)+1)*k)", "n, d = map(int, input().split())\r\nprint(n+d - n%d)", "n, k = list(map(int, input().split()))\n \nt = n // k\ns = t * k\nwhile s <= n:\n s += k\nprint(s)\n \t\t\t \t\t \t \t \t\t \t \t \t \t\t \t\t\t \t", "n, k = (int(i) for i in input().split())\nres = (n // k + 1) * k\nprint(res)\n", "n,k = map(int,input().split())\n\nrem = n%k\n\n\nprint(n + (k-rem))\n \t\t \t\t \t \t\t \t \t\t \t \t \t\t\t\t", "n, k = map(int, input().split())\r\n\r\nx = n // k + 1\r\nprint(x * k)", "import sys\r\n\r\ndef main():\r\n n, k = map(int, sys.stdin.read().strip().split())\r\n return k*(n//k + 1)\r\n\r\nprint(main())\r\n", "a,b = list(map(int, input().split()))\r\nk = a//b\r\nprint( k*b+b )", "a,b=map(int,input().split());print(a+b-a%b)\n\n\n\n# Made By Mostafa_Khaled", "w=input().split()\r\nx=int(w[0])\r\ny=int(w[1])\r\nif(x%y==0):\r\n print(x+y)\r\nelif(x>y and x%y!=0):\r\n o=((x//y)+1)*y\r\n print(o)\r\nelse:\r\n print(y)\r\n", "n,k = map(int,input().split())\r\nprint(n-(n%k)+k)", "n,k=map(int, input().split())\r\nif n%k==0:\r\n print(n+k)\r\nelse:\r\n x=(n%k)\r\n y=(k-x)\r\n print(n+y)\r\n", "a = input().split()\nn = int(int(a[0])/int(a[1]))+1\nnum = n*int(a[1])\nprint(num)\n\t \t \t \t\t\t \t \t \t\t \t \t", "n, k = [int(i) for i in input().split()]\r\nprint((n//k + 1) * k)", "s=input().split();print((int(s[0])//int(s[1])+1)*(int(s[1])));", "t = 1\r\nwhile t:\r\n n,k = map(int,input().split()) \r\n if n % k == 0:\r\n print(n+k)\r\n else:\r\n print(n+(k-(n%k)))\r\n t-= 1", "import math\r\nn,k=map(int,input().split())\r\nprint(math.ceil((n+1)/k)*k)\r\n", "n,k=map(int,input().split())\r\nprint(n//k*k+k)", "n , k = map(int,input().split())\r\nprint(n + (k - (n%k)))", "if __name__ == '__main__':\r\n n, k = str(input()).split()\r\n n = int(n)\r\n k = int(k)\r\n print((n // k + 1) * k)\r\n", "n,m=map(int,input().split());print((n//m+1)*m)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn, k = map(int, input().split())\r\nprint((1 + (n // k)) * k)\r\n", "n , k = map(int,input().split())\r\n\r\nif n % k == 0:\r\n print(n + k)\r\nelse:\r\n x = n // k + 1\r\n print(x * k)\r\n\r\n ", "n,k=map(int,input().split())\r\nq=n//k\r\nprint(q*k+k)", "n,k = map(int,input().split())\nprint(n // k * k + k)", "from math import ceil\r\nn, k = map(int, input().split())\r\nprint(ceil((n+1)/k)*k)", "#Johnny likes numbers\n[n,k] = map(int, input().split())\nif n%k==0:\n print(n+k)\nelse:\n print (n-n%k+k)\n", "n, k = map(int, input().split())\r\nr = n % k\r\ns = n + (k-r)\r\nprint(s)", "n, k = map(int, input().split())\nsum = (n//k)+1\nprint(k*sum)\n\t \t \t\t \t\t\t\t\t\t\t \t\t \t \t", "n,k = (int(i) for i in input().split())\nif (k>n):\n print(k)\nelse:\n s = n//k + 1\n print(k*s)", "n, k = map(int , input().split() )\r\nprint(((n//k) + 1 )*k)" ]

[ "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\ndef pre(n,path,lim):\r\n # lim = n.bit_length()\r\n up = [[-1]*(lim+1) for _ in range(n)]\r\n st,visi,height = [0],[1]+[0]*(n-1),[0]*n\r\n start,finish,time = [0]*n,[0]*n,0\r\n while len(st):\r\n x = st[-1]\r\n y,j = up[x][0],0\r\n while y != -1:\r\n up[x][j] = y\r\n y = up[y][j]\r\n j += 1\r\n while len(path[x]) and visi[path[x][-1]]:\r\n path[x].pop()\r\n if not len(path[x]):\r\n time += 1\r\n finish[x] = time\r\n st.pop()\r\n else:\r\n i = path[x].pop()\r\n st.append(i)\r\n time += 1\r\n visi[i],start[i],up[i][0],height[i] = 1,time,x,height[x]+1\r\n return start,finish,up,height\r\n\r\ndef is_ancestor(u,v,start,finish):\r\n return start[u] <= start[v] and finish[u] >= finish[v]\r\n\r\ndef lca(u,v,up,start,finish,lim):\r\n if is_ancestor(u,v,start,finish):\r\n return u\r\n if is_ancestor(v,u,start,finish):\r\n return v\r\n for i in range(lim,-1,-1):\r\n if up[u][i] != -1 and not is_ancestor(up[u][i],v,start,finish):\r\n u = up[u][i]\r\n return up[u][0]\r\n\r\ndef solve(s,f,t,up,start,finish,lim,height):\r\n a = lca(s,f,up,start,finish,lim)\r\n b = lca(t,f,up,start,finish,lim)\r\n ans = height[f]-max(height[a],height[b])+1\r\n if a == b:\r\n x = lca(s,t,up,start,finish,lim)\r\n ans += height[x]-height[a]\r\n return ans\r\n\r\ndef main():\r\n n,q = map(int,input().split())\r\n path = [[] for _ in range(n)]\r\n for ind,i in enumerate(map(int,input().split())):\r\n path[ind+1].append(i-1)\r\n path[i-1].append(ind+1)\r\n lim = n.bit_length()\r\n start,finish,up,height = pre(n,path,lim)\r\n for _ in range(q):\r\n a,b,c = map(lambda xx:int(xx)-1,input().split())\r\n print(max(solve(a,b,c,up,start,finish,lim,height),\r\n solve(a,c,b,up,start,finish,lim,height),\r\n solve(b,a,c,up,start,finish,lim,height)))\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()" ]

[ "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 2 * n * u + v\r\n\r\nn, l = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\na, b = [], []\r\nfor _ in range(n):\r\n a0, b0 = map(int, input().split())\r\n a.append(a0)\r\n b.append(b0)\r\n if a0 == b0:\r\n a0, b0 = l + 1, l + 1\r\n a.append(b0)\r\n b.append(a0)\r\nG = [[] for _ in range(2 * n)]\r\nfor i in range(2 * n):\r\n for j in range(2 * n):\r\n if i // 2 == j // 2:\r\n continue\r\n if b[i] == a[j]:\r\n G[i].append(j)\r\nm = 2 * n * (l + 1)\r\ndp = [0] * m\r\nfor i in range(2 * n):\r\n if a[i] <= l:\r\n dp[f(a[i], i)] = 1\r\nfor i in range(1, l):\r\n for j in range(2 * n):\r\n u = f(i, j)\r\n if not dp[u]:\r\n continue\r\n for k in G[j]:\r\n if i + a[k] <= l:\r\n dp[f(i + a[k], k)] += dp[u]\r\n dp[f(i + a[k], k)] %= mod\r\nans = 0\r\nfor i in range(2 * n):\r\n ans += dp[f(l, i)]\r\nans %= mod\r\nprint(ans)", "E,R,G=enumerate,lambda:map(int,input().split()),range;n,l=R();w,N,M=[],n,10**9+7\r\nfor i in G(n):\r\n a,b=R();w+=[[i,a,b]]\r\n if a!=b:w+=[[i,b,a]];N+=1\r\nm=[[]for _ in G(N)];f=[[0]*N for _ in G(l+1)]\r\nfor j,(i,a,_) in E(w):#宽高相同的相邻木板\r\n for k,(i2,_,b) in E(w):\r\n if i!=i2 and a==b:m[j]+=[k]\r\nfor i in G(l+1):\r\n for j in G(N):\r\n if i==0:f[i][j]=1;continue\r\n for k in [m[j],G(N)][i==l]:\r\n a=w[k][1]\r\n if a<=i:f[i][j]=(f[i][j]+f[i-a][k])%M\r\nprint(f[l][0])", "from sys import stdin\r\ninput=stdin.readline\r\ndef f(bars,l,n):\r\n\tMOD=10**9+7\r\n\tdp=[[[0,0] for j in range(L+101+1)] for i in range(n)]\r\n\tchall=[[] for i in range(101)]\r\n\tfor i in range(n):\r\n\t\ta,b=bars[i]\r\n\t\tif a != b:\r\n\t\t\tdp[i][a][1] = 1\r\n\t\t\tdp[i][b][0] = 1\r\n\t\telse:\r\n\t\t\tdp[i][a][1] = 1\r\n\r\n\t\tif a == b:\r\n\t\t\tchall[a].append((a, i))\r\n\t\telse:\r\n\t\t\tchall[a].append((b, i))\r\n\t\t\tchall[b].append((a, i))\r\n\r\n\tfor j in range(l + 1):\r\n\t\tfor i in range(n):\r\n\t\t\tfor z in range(2):\r\n\t\t\t\tif dp[i][j][z]:\r\n\t\t\t\t\tfor a, ind in chall[bars[i][z]]:\r\n\t\t\t\t\t\tif ind != i:\r\n\t\t\t\t\t\t\tdp[ind][j + bars[i][z]][bars[ind].index(a)] = (dp[ind][j + bars[i][z]][bars[ind].index(a)] +\r\n\t\t\t\t\t\t\t dp[i][j][z]) % MOD\r\n\r\n\tcnt=0\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\tcnt = (cnt + dp[i][l][0] + dp[i][l][1]) % MOD\r\n\treturn (cnt)\r\n\r\nb=[]\r\nn,L=map(int,input().strip().split())\r\nfor i in range(n):\r\n\tl,w=map(int,input().strip().split())\r\n\tb.append((l,w))\r\n\r\nprint(f(b,L,n))", "from array import array\r\nimport sys\r\n\r\nmod = 10 ** 9 + 7\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nadd = lambda a, b: (a % mod + b % mod) % mod\r\n\r\nn, l = map(int, input().split())\r\na0, a1 = array('i', [0] * n), array('i', [0] * n)\r\ndp0 = [array('i', [0] * n) for _ in range(3000 + 1)]\r\ndp1 = [array('i', [0] * n) for _ in range(3000 + 1)]\r\n\r\nfor i in range(n):\r\n a0[i], a1[i] = map(int, input().split())\r\n dp0[a0[i]][i] = 1\r\n if a0[i] != a1[i]:\r\n dp1[a1[i]][i] = 1\r\n\r\nfor i in range(1, l + 1):\r\n for j in range(n):\r\n for k in range(n):\r\n if j != k:\r\n if i - a0[j] > -1:\r\n if a0[j] == a1[k]:\r\n dp0[i][j] = add(dp0[i][j], dp0[i - a0[j]][k])\r\n\r\n if a0[k] != a1[k] and a0[j] == a0[k]:\r\n dp0[i][j] = add(dp0[i][j], dp1[i - a0[j]][k])\r\n\r\n if a0[j] != a1[j] and i - a1[j] > -1:\r\n if a1[j] == a1[k]:\r\n dp1[i][j] = add(dp1[i][j], dp0[i - a1[j]][k])\r\n\r\n if a0[k] != a1[k] and a1[j] == a0[k]:\r\n dp1[i][j] = add(dp1[i][j], dp1[i - a1[j]][k])\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans += dp0[l][i] + dp1[l][i]\r\nprint(ans % mod)\r\n", "n,l = map(int,input().split())\r\nab = [(0,0)] + [list(map(int,input().split())) for i in range(n)]\r\n\r\n\r\nmod = 10**9+7\r\ndp = [[[0,0] for i in range(n+1)] for i in range(l+1)]\r\n\r\ndp[0][0] = [1,0]\r\nfor i in range(1,l+1):\r\n for j in range(n+1):\r\n aj,bj = ab[j]\r\n for k in range(1, n+1):\r\n if j == k: continue\r\n ak,bk = ab[k]\r\n if j != 0:\r\n if aj == ak and i >= ak:\r\n dp[i][k][1] += dp[i-ak][j][0]\r\n if aj == bk and ak != bk and i >= bk:\r\n dp[i][k][0] += dp[i-bk][j][0]\r\n if bj == ak and i >=ak:\r\n dp[i][k][1] += dp[i-ak][j][1]\r\n if bj == bk and ak != bk and i >= bk:\r\n dp[i][k][0] += dp[i-bk][j][1]\r\n else:\r\n if i >= ak:\r\n dp[i][k][1] += dp[i-ak][j][0]\r\n if i >= bk and ak != bk:\r\n dp[i][k][0] += dp[i-bk][j][0]\r\n dp[i][k][0] %= mod\r\n dp[i][k][1] %= mod\r\nans = 0\r\nfor i in range(n+1):\r\n ans += sum(dp[-1][i])\r\n ans %= mod\r\n\r\nprint(ans)" ]

[ "people, capacity = map(int, input().split())\r\nlst = sorted(list(map(int, input().split())))\r\ntempTime = 0\r\nwhile(len(lst) > 0):\r\n tempArr = []\r\n for i in range(capacity):\r\n if(len(lst) > 0):\r\n tempArr.append(lst.pop())\r\n tempArr = sorted(tempArr)\r\n if(len(tempArr) < 0):\r\n break\r\n tempTime += abs(tempArr[0] - 1)\r\n for i in range(len(tempArr) - 1):\r\n first = tempArr[i]\r\n second = tempArr[i + 1]\r\n tempTime += abs(second - first)\r\n tempTime += abs(tempArr[len(tempArr) - 1] - 1)\r\nprint(tempTime)", "ans = 0\nb = []\nn, k = map(int,input().split())\na = sorted(list(map(int,input().split())), reverse=True)\n\nfor i in range(n):\n if len(b)==k:\n ans += (max(b)-1)*2\n b = [a[i]]\n else:\n b.append(a[i])\n\nans += (max(b) - 1) * 2\n\nprint(ans)\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())\r\nf=list(map(int,input().split()))\r\n\r\nm=2000\r\nc=[0]*m\r\nfor x in f:\r\n c[x-1]+=1\r\ns=sum(c)\r\nans=0\r\nfor i in range(m-1):\r\n s-=c[i]\r\n need=(s+k-1)//k\r\n ans+=need\r\n if need>1:\r\n ans+=need-1\r\nans+=max(f)-1\r\nprint(ans)", "n,k=[int(x) for x in input().split()]\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ntime_spent = 0\r\nwhile n > 0:\r\n time_spent += (arr[-1]-1)*2\r\n #print(arr)\r\n if len(arr)>k:\r\n arr = arr[:-k]\r\n \r\n n -= k\r\n#print('TimeSpent=', time_spent)\r\nprint( time_spent)", "n,k=[int(x) for x in input().split()]\r\narr=list(map(int,input().split()))\r\narr=sorted(arr,reverse=True)\r\ni,ans=0,0\r\nwhile i<n:\r\n j,prv=0,1\r\n while i<n and j<k:\r\n ans+=abs(arr[i]-prv)\r\n prv=arr[i]\r\n j+=1\r\n i+=1\r\n ans+=prv-1\r\nprint(ans)", "def solve():\r\n n, k = map(int, input().split())\r\n floors = list(map(int, input().split()))\r\n distance = 0\r\n floors.sort()\r\n while floors:\r\n floor = floors.pop()\r\n [floors.pop() for _ in range(k-1) if floors]\r\n distance += 2 * (floor-1)\r\n print(distance)\r\n\r\n\r\nsolve()", "n,k=(int(x)for x in input().split())\r\nprint(sum(sorted(int(x)-1 for x in input().split())[::-k])*2)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = sorted(map(int, input().split()), reverse=True)\r\nc = 0\r\nfor i in range(0, n, k):\r\n c += 2*(w[i]-1)\r\nprint(c)" ]

[ "from sys import stdin\n\n\ndef main():\n n, m = map(int, stdin.readline().strip().split())\n it = iter(map(int, stdin.readline().strip().split()))\n try:\n cnt = vol = 0\n while True:\n x = next(it)\n if vol < x:\n cnt += 1\n vol = m\n vol -= x\n except StopIteration:\n return cnt\n\n\nprint(main())\n", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n, m = input_ints()\r\n ans = 0\r\n s = 0\r\n for x in input_ints():\r\n if s + x > m:\r\n ans += 1\r\n s = 0\r\n s += x\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import sys\nn, m = map(int, sys.stdin.readline().split())\na = list(map(int, sys.stdin.readline().split()))\nans = 0\nwhile a:\n s = 0\n for i in range(len(a)):\n s += a[i]\n if s > m:\n ans += 1\n a = a[i:]\n break\n else:\n ans += 1\n break\nprint(ans)\n", "groups, capacity=map(int,input().split())\nbuses=1\nmembers=list(map(int,input().split()))\nnew_capacity=capacity\ni=0\nwhile i<groups:\n if members[i] <= new_capacity:\n new_capacity = new_capacity-members[i]\n i=i+1\n else:\n buses=buses+1\n new_capacity=capacity\nprint(buses)\n\t \t \t \t \t \t \t \t\t\t", "n,m=map(int,input().split())\r\nL=list(map(int,input().split()))\r\ncnt=0\r\ncur=m\r\nfor a in L:\r\n if cur>=a:\r\n cur-=a\r\n else:\r\n cur=m-a\r\n cnt+=1\r\nprint(cnt+1)\r\n\r\n\r\n\r\n\r\n'''\r\nn, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ncnt = 0\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\n if s > m:\r\n cnt += 1\r\n s = a[i]\r\nprint(cnt + 1)\r\n'''", "n,m=map(int,input().split())\r\na=list(map(int,input().strip().split()))\r\nc=m\r\nans=1\r\nfor i in range(n):\r\n if c>=a[i]:\r\n c-=a[i]\r\n else:\r\n ans+=1\r\n c=m-a[i]\r\nprint(ans)", "N, M = map(int, input().split())\r\nQueue = list(map(int, input().split()))\r\nEntered, Number, i = 0, 0, 0\r\nwhile i < N:\r\n Entered += Queue[i]\r\n if Entered > M:\r\n Number, Entered, i = Number + 1, 0, i - 1\r\n i += 1\r\nprint(Number + 1)\r\n\r\n# UB_CodeForces\r\n# Advice: \" Do your best in all your time \"\r\n# Location: Behind my desk\r\n# Caption: On the right way\r\n# CodeNumber: 553\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nbus = 0\r\nwhile len(a) > 0:\r\n bus += 1\r\n cap = m\r\n while len(a) > 0 and a[0] <= cap:\r\n cap -= a.pop(0)\r\nprint(bus)", "n, m = map(int, input().split())\np = list(map(int, input().split()))\n\nbn = 0\nib = 0\n\nfor i in p:\n if ib+i>m:\n ib=i\n bn+=1\n else:\n ib+=i\nif ib > 0:\n bn += 1\n\nprint(bn)\n", "while True:\n try:\n n, m = list(map(int, input().split()))\n A = list(map(int, input().split()))\n ans , people = 1, 0\n for i in range(n):\n if people + A[i] <= m:\n people += A[i]\n else:\n ans += 1\n people = A[i]\n\n print(ans)\n except EOFError:\n break\n\n\t \t\t\t \t \t\t \t\t\t \t \t \t\t \t \t", "n,m=map(int,input().split())\r\nd=list(map(int,input().split()))\r\n\r\ncounter=1\r\nsum=0\r\nfor i in range(n):\r\n sum+=d[i]\r\n if sum>m:\r\n sum=d[i]\r\n counter+=1\r\nprint(counter)", "x=input()\r\nx=x.split()\r\ny=input()\r\ny=y.split()\r\nbus=0\r\ni=0\r\nempty=int(x[1])\r\nfor i in range(int(x[0])):\r\n if int(y[i])== int(x[1]):\r\n bus=bus+1\r\n if empty<int(x[1]):\r\n empty=int(x[1])\r\n bus=bus+1 \r\n elif int(y[i])< empty :\r\n empty=empty-int(y[i])\r\n if i==int(x[0])-1:\r\n bus=bus+1 \r\n elif int(y[i])==empty:\r\n empty=int(x[1])\r\n bus=bus+1 \r\n elif int(y[i])>empty:\r\n bus=bus+1\r\n empty=int(x[1])\r\n if int(y[i])== empty :\r\n \r\n bus=bus+1\r\n elif int(y[i])< empty and i==int(x[0])-1:\r\n bus=bus+1\r\n else:\r\n empty=empty-int(y[i]) \r\nprint(bus) \r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncurrent, ans = 0, 0\r\nfor x in a:\r\n if current + x <= m:\r\n current += x\r\n else:\r\n current = x\r\n ans += 1\r\nif current != 0:\r\n ans += 1\r\n \r\nprint(ans)", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nres = 0\r\nt = m\r\n\r\nwhile len(l) > 0:\r\n if l[0] <= t:\r\n t = t - l.pop(0)\r\n else:\r\n res += 1\r\n t = m\r\nprint(res + 1)", "'''\r\nCreated on 2016年3月7日\r\n\r\n@author: HaoGe\r\n'''\r\nn, m= map(int,input().split())\r\nqueue=list(map(int,input().split()))\r\nsit=0\r\nans=0\r\nfor i in queue:\r\n if sit+i >m:\r\n ans+=1\r\n sit=i\r\n else:\r\n sit+=i\r\nif sit>0:\r\n ans+=1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\na=list(map(int,input().split()))\ni,rj,zbr=0,0,0\n\nwhile i<n:\n if zbr+a[i]<=m:\n zbr+=a[i]\n else:\n rj+=1\n zbr=a[i]\n i+=1\nprint(rj+1)\n\n\t \t \t\t\t\t\t \t \t\t \t \t", "#n, k = map(int, input().split(\" \"))\r\n#LA = [int(x) for x in input().split()]\r\n\r\nn, m = map(int, input().split(\" \"))\r\nL = [int(x) for x in input().split()]\r\nct = 1\r\ns = 0\r\nfor x in L : \r\n if (s + x > m) : \r\n s = x\r\n ct+=1\r\n else : s += x \r\nprint(ct)\r\n", "import math\r\ns=input()\r\ns=s.split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nl=input()\r\nl=l.split()\r\nt=0\r\np=[]\r\nwhile t<n :\r\n p.append(int(l[t]))\r\n t+=1\r\ni=0\r\nk=0\r\nwhile i<n :\r\n if p[i] > m :\r\n k+=1\r\n p[i]-=m\r\n continue\r\n if p[i] <= m :\r\n k+=1\r\n e=m-p[i]\r\n i+=1\r\n while i<n and e>=p[i] :\r\n e-=p[i]\r\n i+=1\r\nprint(k)", "n,m=map(int,input().split())\nL=list(map(int,input().split()))\nbusovi=1\nslobodnih_mjesta=m\nj=0\nfor i in L:\n if L[j]>slobodnih_mjesta:\n slobodnih_mjesta=m\n busovi+=1\n if L[j]<=slobodnih_mjesta:\n slobodnih_mjesta-=L[j]\n j+=1\nprint(busovi)\n\n \t \t \t \t\t\t \t\t \t \t \t\t", "n, m = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\ni = 0\r\ncnt = 0\r\ns = 0\r\nwhile i < n:\r\n s += data[i]\r\n if s <= m:\r\n i += 1\r\n else:\r\n cnt += 1\r\n s = 0\r\n\r\nif s != 0 and s <= m:\r\n cnt += 1\r\n\r\nprint(cnt)", "n, m = map(int, input().split())\na = list(map(int, input().split()))\n\nans = 1\nnowx = m\nfor i in range(len(a)):\n if (a[i] <= nowx):\n nowx -= a[i]\n else:\n ans = ans + 1\n nowx = m\n nowx -= a[i]\nprint(ans)\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=count=0\r\nwhile x<n:\r\n\tbus=0\r\n\twhile bus<=m and x<n:\r\n\t\tif m-bus>=l[x]:\r\n\t\t\tbus+=l[x]\r\n\t\t\tx+=1\r\n\t\telse:break\r\n\tcount+=1\r\nprint(count)", "n, m = map(int,input().split())\r\ngroup = list(map(int,input().split()))\r\n\r\nb = 0\r\n\r\n\r\ntot = 0\r\nfor i in range(n):\r\n tot += group[i]\r\n if tot > m :\r\n b += 1\r\n tot = group[i]\r\n elif tot == m :\r\n b += 1\r\n tot = 0\r\n if i == n-1 and tot != 0 :\r\n b += 1\r\nprint(b)\r\n", "n,k=map(int,input().split())\r\nlist1=list(map(int,input().split()))[:n]\r\nsum1=0\r\nc=0\r\nfor i in list1:\r\n sum1=sum1+i\r\n if sum1>k:\r\n sum1=i+0\r\n c=c+1\r\nprint(c+1) ", "n, m = map(int, input().split())\r\nq = list(map(int, input().split()))\r\n\r\ni = 0\r\nnrb = 0\r\nwhile i < n:\r\n cap = 0\r\n nrb += 1\r\n while i < n and cap + q[i] <= m:\r\n cap += q[i]\r\n i += 1\r\n\r\nprint(nrb)", "n, m = map(int, input().split())\r\nl = list(int(i) for i in input().split())\r\ns = 0\r\nres = 1\r\nfor i in l:\r\n if i + s <= m:\r\n s += i\r\n else:\r\n res += 1\r\n s = i\r\nprint(res)\r\n", "def count(arr:list, capacity):\r\n counter = 1\r\n i = 1\r\n sum = arr[0]\r\n while i < len(arr):\r\n if sum + arr[i] <= capacity:\r\n sum += arr[i]\r\n else:\r\n counter += 1\r\n sum = arr[i]\r\n i += 1\r\n return counter\r\n\r\nk = list(map(int, input().split()))[1]\r\narray = list(map(int, input().split()))\r\nprint(count(array, k))\r\n\r\n\r\n\r\n", "n , m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = 0\r\ns1 = m\r\nfor i in l:\r\n\tif s1>=i:\r\n\t\ts1 -= i\r\n\telse:\r\n\t\ts1 = m - i\t\r\n\t\ts += 1\r\nprint(s+1)", "n, m = [int(x) for x in input().split()]\nl = [int(x) for x in input().split()]\nans = 0\nfree = 0\nfor x in l:\n\tif free >= x:\n\t\tfree -= x\n\telse:\n\t\tans += 1\n\t\tfree = m - x\nprint(ans)\n", "# https://codeforces.com/contest/435/problem/A\n\nn, m = map(int, input().split())\nnumppl = map(int, input().split())\nnumbus, total = 1, 0\nfor i in numppl:\n total += i\n if total > m:\n numbus += 1\n total = i\nprint(numbus)\n", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nres, tmp = 0, 0\r\nfor x in lst:\r\n if x + tmp <= m:\r\n tmp += x\r\n else:\r\n res += 1\r\n tmp = x\r\nif tmp > 0: \r\n res += 1\r\nprint(res)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\ni = 0\r\nk = m\r\ncnt = 0\r\nwhile i<n:\r\n if a[i]<=k:\r\n k-=a[i]\r\n i+=1\r\n continue\r\n else:\r\n k = m\r\n cnt+=1\r\nprint(cnt+1)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0\r\ns = 0\r\nb = 0\r\nwhile i < n:\r\n s += a[i]\r\n if s > m:\r\n s = 0\r\n i -= 1\r\n b += 1\r\n i += 1\r\nif s != 0:\r\n b += 1\r\nprint(b)\r\n", "n , m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans,Sum = 0,0\r\nfor i in range(n):\r\n if(Sum + a[i] > m ):\r\n Sum = 0\r\n ans += 1\r\n Sum += a[i]\r\nif(Sum > 0):\r\n ans += 1\r\nprint (ans)\r\n \r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nbus = 1\r\npassanger = 0\r\ni = 0\r\n\r\nwhile(i < n) :\r\n if passanger + arr[i] <= m:\r\n passanger += arr[i]\r\n else :\r\n bus += 1\r\n passanger = 0\r\n i -= 1\r\n i += 1\r\n \r\n\r\nprint(bus)\r\n", "l = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\na = l[1]\r\ni = 0\r\nb = 0\r\nc = 1\r\nsum = 0\r\nwhile i<len(m):\r\n if m[i]<=a:\r\n b+=1\r\n sum+=m[i]\r\n while i+c<len(m):\r\n if sum+m[i+c]<=a:\r\n sum+=m[i+c]\r\n c+=1\r\n else:\r\n break\r\n \r\n i+=c\r\n c = 1\r\n sum = 0\r\n \r\nprint(b)\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nres = 1\r\nspace = m\r\nfor i in range(n):\r\n if space >= arr[i]:\r\n space -= arr[i]\r\n else:\r\n res += 1\r\n space = m - arr[i]\r\nprint(res)\r\n", "n,m=map(int,input().split())\r\nar=list(map(int,input().split()))\r\ns=0\r\nk=1\r\nfor x in range(n):\r\n if (s+ar[x])<=m:\r\n s+=ar[x]\r\n else:\r\n k+=1\r\n s=ar[x]\r\nprint(k)\r\n \r\n \r\n ", "\r\n\r\n\r\nn, m = map(int,input().split())\r\n\r\n\r\nu = list(map(int,input().split()))\r\nsum=0\r\nf=0\r\nfor k in range(n):\r\n if sum+u[k]<=m:\r\n sum+=u[k]\r\n else:\r\n f+=1\r\n sum=u[k]\r\nif sum>0:\r\n f+=1\r\n\r\nprint(f)\r\n", "N,M=map(int,input().split())\r\nQueue=list(map(int,input().split()))\r\nCur=0\r\nAns=1\r\nfor Bus in Queue:\r\n if Cur+Bus<=M:\r\n Cur+=Bus\r\n else:\r\n Ans+=1\r\n Cur=Bus\r\nprint(Ans)\r\n", "def solve():\r\n n, m = map(int, input().split())\r\n a = [int(_) for _ in input().split()]\r\n\r\n cnt = 0\r\n total = 0\r\n\r\n for i in range(n):\r\n\r\n if total + a[i] > m:\r\n cnt += 1\r\n total = a[i]\r\n else:\r\n total += a[i]\r\n\r\n if total > 0:\r\n cnt += 1\r\n\r\n print(cnt)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\ncount=0\r\nsum=0\r\nfor i in range(n):\r\n if sum+a[i]>m:\r\n count+=1\r\n sum=0\r\n sum+=a[i]\r\nif sum:\r\n count+=1\r\nprint(count)", "n,m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\npeople = 0\r\nbuses = 1\r\nfor i in range(n):\r\n if people + l[i] <= m:\r\n people += l[i]\r\n else:\r\n buses += 1\r\n people = l[i]\r\nprint(buses) ", "if __name__ == \"__main__\":\r\n n, m = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n\r\n bus_counts = 0\r\n bus_left_seats = m\r\n for i, ai in enumerate(a):\r\n if bus_left_seats < ai:\r\n bus_counts += 1\r\n bus_left_seats = m\r\n \r\n bus_left_seats -= ai\r\n \r\n if bus_left_seats != m:\r\n bus_counts += 1\r\n print(bus_counts)\r\n\r\n", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\ni = 0\r\ncnt = 0\r\nwhile i < n:\r\n cur = m\r\n while i < n and a[i] <= cur:\r\n cur -= a[i]\r\n i += 1\r\n cnt += 1\r\nprint(cnt)", "a=input().split()\r\nb=input().split()\r\n\r\ns=0\r\ni=0\r\nwhile i<len(b):\r\n capa=int(a[1])\r\n \r\n while capa>=0 and i<len(b):\r\n\r\n \r\n capa=capa-int(b[i])\r\n i=i+1\r\n if capa<0:\r\n i=i-1\r\n capa=0\r\n break\r\n s=s+1\r\nprint(s)\r\n \r\n", "n, m = map(int, input().split())\r\nlista = list(map(int, input().split()))\r\na = 0\r\ntemp = m\r\nwhile len(lista) != 0:\r\n if len(lista) == 1 and lista[0] <= temp:\r\n a += 1\r\n break\r\n if lista[0] <= temp:\r\n temp -= lista[0]\r\n lista.remove(lista[0])\r\n elif lista[0] > temp:\r\n a += 1\r\n temp = m\r\n if temp == 0:\r\n a += 1\r\n temp = m\r\n if n == 1:\r\n a += 1\r\n break\r\n\r\nprint(a)", "n, m = [int(x) for x in input().split()]\r\np = [int(x) for x in input().split()]\r\nans = 1\r\ntmp = 0\r\nfor i in range (n):\r\n if tmp + p[i] <= m:\r\n tmp += p[i]\r\n else:\r\n tmp = p[i]\r\n ans += 1\r\nprint(ans)", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc,d=0,0\r\nfor i in l:\r\n if b>=d+i:\r\n d=d+i\r\n else:\r\n c=c+1\r\n d=i\r\nprint(c+1) \r\n ", "n,m=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nh=i=k=0\r\nwhile i<n:\r\n h+=a[i]\r\n if(h>m):\r\n i-=1\r\n k+=1\r\n h=0\r\n i+=1\r\nprint(k+1)", "from math import ceil\r\nn,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nt = 0\r\nwhile i < n:\r\n\ts = m\r\n\twhile i < n:\r\n\t\ts = s - l[i]\r\n\t\tif s >= 0:\r\n\t\t\ti = i + 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tt = t + 1\r\nprint(t)", "(n,m)=map(int, input().split())\r\na=list(map(int, input().split()))\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i]+a[j]<=m:\r\n a[i]+=a[j]\r\n a[j]=0\r\n else:\r\n break\r\na=[a[i] for i in range(n) if a[i]!=0]\r\n\r\nprint(len(a))\r\n \r\n", "n, m = map(int, input().split())\r\nans = list(map(int, input().split()))\r\nc = 1\r\np = 0\r\nfor i in range(n):\r\n if p+ans[i]<=m:p+=ans[i]\r\n else:\r\n c += 1\r\n p = ans[i]\r\nprint(c)", "def main():\r\n linea = [int(x) for x in input().strip().split()]\r\n n = linea[0]\r\n m = linea[1]\r\n suma = 0\r\n linea = [int(x) for x in input().strip().split()]\r\n resp = 1\r\n for i in range(n):\r\n if(suma+linea[i] <=m):\r\n suma+=linea[i]\r\n else:\r\n resp+=1\r\n suma = linea[i]\r\n print(resp)\r\nmain()", "# Made By Mostafa_Khaled \nbot = True \nn,m=map(int,input().split())\nL=list(map(int,input().split()))\ncnt=0\ncur=m\nfor a in L:\n if cur>=a:\n cur-=a\n else:\n cur=m-a\n cnt+=1\nprint(cnt+1)\n\n\n# Made By Mostafa_Khaled", "n, m = map(int, input().split())\r\na = map(int, input().split())\r\nans = 1\r\nres = m\r\nfor x in a : \r\n if res < x :\r\n res = m - x\r\n ans += 1\r\n else :\r\n res -= x\r\nprint(ans)", "a,b=map(int,input().split());c=list(map(int,input().split()))\r\nbusSpots=b\r\nnumOfBus=0\r\nfor i in c:\r\n if i<=busSpots:\r\n busSpots-=i\r\n else:\r\n numOfBus+=1\r\n busSpots=b-i\r\nprint(numOfBus if busSpots==b else numOfBus+1)", "from itertools import count\nimport math\ngroups, busCapacity = list(map(int, input().split()))\ngroupsList = list(map(int, input().split()))\n\nmaximumBusCapacity = busCapacity\nminimumBusNeeded = 1\ncounter = 0\n\nwhile counter < groups:\n if groupsList[counter] > maximumBusCapacity:\n maximumBusCapacity = busCapacity\n minimumBusNeeded += 1\n\n maximumBusCapacity -= groupsList[counter]\n counter +=1\n\nprint(minimumBusNeeded)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=0\r\nans=1\r\nfor x in l:\r\n if k+x<=m: k+=x\r\n else: k=x; ans+=1\r\nprint(ans)", "w=list(map(int,input().split()))\r\nn = w[0]\r\nm = w[1]\r\npep=list(map(int,input().split()))\r\nbus = 1\r\nbus_cap = 0\r\ni=0\r\nwhile i <n:\r\n if bus_cap + pep[i] > m:\r\n bus +=1\r\n bus_cap = pep[i]\r\n else:\r\n bus_cap += pep[i]\r\n i+=1\r\nprint(bus)\r\n", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nres = 1\r\npep = 0\r\nfor i in range(0,n) :\r\n if (pep + a[i] <= m):\r\n pep += a[i]\r\n else :\r\n res += 1 \r\n pep = a[i]\r\nprint(res)", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\nresult = 0\r\ncur = 0\r\nfor i in a:\r\n if i + cur > m:\r\n cur = i\r\n result += 1\r\n else:\r\n cur += i\r\nif cur > 0: result += 1\r\nprint(result)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 1\r\nk = 0\r\nfor t in a:\r\n if k + t <= m:\r\n k += t\r\n else:\r\n s += 1\r\n k = t\r\nprint(s)", "x=input()\r\ny=input()\r\ny=y.split()\r\nx=x.split()\r\nx1=int(x[0])\r\nx2=int(x[1])\r\nfor i in range(x1):\r\n y[i]=int(y[i])\r\nf=0\r\nflag=0\r\ni=0\r\nwhile i <x1:\r\n if y[i]<=f:\r\n f=f-y[i]\r\n i+=1 \r\n elif y[i]<=x2:\r\n flag+=1\r\n f=x2-y[i]\r\n i+=1\r\n else:\r\n i+=1\r\nprint(flag) \r\n \r\n \r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n_str = str\r\nBUFSIZE = 8192\r\n\r\n\r\ndef str(x=b''):\r\n return x if type(x) is bytes else _str(x).encode()\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = 'x' in file.mode or 'r' not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b'\\n') + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode('ascii'))\r\n self.read = lambda: self.buffer.read().decode('ascii')\r\n self.readline = lambda: self.buffer.readline().decode('ascii')\r\n\r\n\r\ndef inp():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef mpint():\r\n return map(int, inp().split(' '))\r\n\r\n\r\ndef itg():\r\n return int(inp())\r\n\r\n\r\n# ############################## import\r\n# ############################## main\r\ndef solve():\r\n n, m = mpint()\r\n ans = 1\r\n c = 0\r\n for a in mpint():\r\n c += a\r\n if c > m:\r\n ans += 1\r\n c = a\r\n return ans\r\n\r\n\r\ndef main():\r\n # solve()\r\n print(solve())\r\n # for _ in range(itg()):\r\n # print(solve())\r\n # print(\"YES\" if solve() else \"NO\")\r\n # print(\"yes\" if solve() else \"no\")\r\n\r\n\r\nDEBUG = 0\r\nURL = 'https://codeforces.com/contest/435/problem/A'\r\n\r\nif __name__ == '__main__':\r\n if DEBUG == 1:\r\n import requests # ImportError: cannot import name 'md5' from 'sys' (unknown location)\r\n from ACgenerator.Y_Test_Case_Runner import TestCaseRunner\r\n\r\n runner = TestCaseRunner(main, URL)\r\n inp = runner.input_stream\r\n print = runner.output_stream\r\n runner.checking()\r\n elif DEBUG == 2:\r\n main()\r\n else:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n main()\r\n# Please check!\r\n", "n,m=map(int,input().split());b,c=0,0\r\nfor i in map(int,input().split()):\r\n\tif c+i<=m:c+=i\r\n\telse:b+=1;c=i\r\nprint(b+1)", "import sys\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\nn, m = map(int,minp().split())\r\nr = 0\r\nc = m\r\nfor i in map(int,minp().split()):\r\n\tif c + i > m:\r\n\t\tc = i\r\n\t\tr += 1\r\n\telse:\r\n\t\tc += i\r\nprint(r)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=1\r\nt=0\r\nfor i in range(n) :\r\n if t+l[i]>m :\r\n k=k+1\r\n t=l[i]\r\n else :\r\n t=t+l[i]\r\nprint(k)\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n, m = map(int, input().split()); ans = 0; mylist = [int(x) for x in input().split()]\r\nwhile mylist !=[]:\r\n u = m\r\n while True:\r\n if mylist != [] and u-mylist[0] >= 0:\r\n u -= mylist[0]\r\n mylist.pop(0)\r\n else:\r\n ans+=1\r\n break\r\nprint(ans)", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nflag=True\r\ni=0\r\ncount=0\r\nwhile i<n:\r\n sumb=0\r\n while sumb<=m and i<n:\r\n sumb+=a[i]\r\n i+=1\r\n if sumb>m:\r\n i-=1\r\n sumb-=a[i]\r\n count+=1\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\ntemp = m\r\nfor i in range(len(arr)):\r\n\tif temp >= arr[i]:\r\n\t\ttemp-=arr[i]\r\n\telse:\r\n\t\tans += 1\r\n\t\ttemp = m\r\n\t\ttemp -= arr[i]\r\nprint(ans+1)", "n, m = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\ni = k = 0\r\nif n == 1:\r\n print(1)\r\n exit()\r\nelse:\r\n while i < n:\r\n d = 0\r\n while d + l[i] <= m:\r\n if i + 1 == n:\r\n print(k + 1)\r\n exit()\r\n d += l[i]\r\n i += 1\r\n k += 1", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 1\r\nload = 0\r\n\r\nfor g in a:\r\n load += g\r\n if load > m:\r\n ans += 1\r\n load = g\r\n\r\nprint(ans)\r\n", "row = input().split()\r\n\r\nn = int(row[0])\r\nm = int(row[1])\r\n\r\nmembers = list(map(int, input().split()))\r\n\r\ncount = 0\r\nsum = 0\r\nfor i in range(n):\r\n if sum + members[i] <= m:\r\n sum+=members[i]\r\n else:\r\n count+=1\r\n sum = members[i]\r\n\r\nif sum>0: count+=1\r\n\r\n\r\nprint(count)", "groupsCount, busCapacity = list(map(int, input().split()))\r\ngroups = list(map(int, input().split()))\r\n\r\nbuses = 1\r\ntempBC = busCapacity\r\nfor group in groups:\r\n if group > tempBC:\r\n buses += 1\r\n tempBC = busCapacity\r\n tempBC -= group\r\n # print(buses, tempBC, busCapacity)\r\n \r\nprint(buses)", "a = [int(j) for j in input().split()]\r\nb = [int(j) for j in input().split()]\r\nc = 0\r\nwhile True:\r\n if b == []:\r\n break\r\n else:\r\n d = 0\r\n while True:\r\n if b == []:\r\n c += 1\r\n break\r\n elif d + b[0] <= a[1]:\r\n d = d +b[0]\r\n del b[0]\r\n else:\r\n c += 1\r\n break\r\nprint(c)", "n, m = map(int, input().split())\nqs = list(map(int, input().split()))\n\nr = 0\nf = m\nfor q in qs:\n if q <= f:\n f -= q\n else:\n r += 1\n f = m - q\nif f < m:\n r += 1\n\nprint(r)\n", "n,m=map(int,input().split())\r\n\r\nL=list(map(int,input().split()))\r\n\r\nans=0\r\n\r\nind=0\r\nbus=0\r\n\r\nwhile(ind<n):\r\n ans+=1\r\n while(ind<n and bus+L[ind]<=m):\r\n bus+=L[ind]\r\n ind+=1\r\n bus=0\r\nprint(ans)\r\n", "n,m = list(map(int, input().split(\" \")))\r\nx = list(map(int, input().split(\" \")))\r\ncount,a=0,0\r\nfor i in range(n):\r\n if x[i]+a<=m:\r\n a+=x[i]\r\n else:\r\n count+=1\r\n a=x[i]\r\nprint(count+1)", "w=list(map(int,input().split()))\r\nx=w[0]\r\ny=w[1]\r\nl=list(map(int,input().split()))\r\ni = 0\r\nsum = 1\r\ninc=0\r\nwhile(i<x):\r\n if (inc+l[i]>y):\r\n sum +=1\r\n inc=l[i]\r\n else:\r\n inc+=l[i]\r\n i+=1 \r\nprint(sum)\r\n \r\n", "# cook your dish here\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=len(a)\r\nc=0\r\ns=0\r\ni=0\r\nwhile i<l:\r\n s=a[i]\r\n c+=1\r\n while s<=m:\r\n i+=1\r\n if i<l:\r\n s+=a[i]\r\n else:\r\n break\r\n \r\nprint(c)\r\n ", "inp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\ninp = input().split()\r\nq = [int(i) for i in inp]\r\nnum = 0\r\nsum = 0\r\ni = 0\r\nwhile i < n:\r\n if sum + q[i] <= m:\r\n sum += q[i]\r\n i += 1\r\n else:\r\n sum = 0\r\n num += 1\r\nprint (num + 1)", "import math\r\nn, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nres = 1\r\npep = 0\r\n\r\nfor i in range(n):\r\n if pep + a[i] <= m:\r\n pep += a[i]\r\n else:\r\n res += 1\r\n pep = a[i]\r\n\r\nprint(res)", "iData = list(map(int,str(input()).split(\" \")))\r\nn,m = iData[0],iData[1]\r\na = list(map(int,str(input()).split(\" \")))\r\n\r\ntmp, bus_count = 0,1\r\nfor i in range(n):\r\n if tmp + a[i] <= m:\r\n tmp += a[i]\r\n else:\r\n bus_count+= 1\r\n tmp = a[i]\r\n\r\nprint(bus_count)\r\n", "n,m=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\ni=0\r\nb=0\r\nwhile(i<n):\r\n x=m\r\n while(i<n and x-arr[i]>=0):\r\n x=x-arr[i]\r\n i=i+1\r\n b=b+1\r\nprint(b)\r\n \r\n \r\n ", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n n, m = P()\r\n a = Y()\r\n i, s, cnt = 0, 0, 1\r\n\r\n while i < n:\r\n if s + a[i] <= m:\r\n s += a[i]\r\n i += 1\r\n else:\r\n cnt += 1\r\n s = 0\r\n print(cnt)", "n, m = map(int, input().split())\r\ng = map(int, input().split())\r\nk = 0\r\nans = 0\r\nfor i in g:\r\n if k >= i:\r\n k -= i\r\n else:\r\n ans += 1\r\n k = m\r\n k -= i\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0\r\nd = 0\r\nk = 0\r\nwhile i != n:\r\n if k < a[i]:\r\n d += 1\r\n k = m\r\n k -= a[i]\r\n i += 1\r\nprint(d)", "def main():\r\n l = input()\r\n parts = l.split(\" \")\r\n n = int(parts[0])\r\n m = int(parts[1])\r\n arr = []\r\n l = input()\r\n for a in l.split(\" \"):\r\n arr.append(int(a))\r\n i = 0\r\n res = 0\r\n while True:\r\n s = 0\r\n while i < n and s+arr[i]<= m:\r\n s += arr[i]\r\n i += 1\r\n res += 1\r\n if i == n:\r\n break\r\n print(str(res))\r\nif __name__ == '__main__':\r\n main()\r\n", "n , m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\ncurrent = 0;\r\nx = 0;\r\nfor b in a:\r\n if (m - current) >= b:\r\n current += b\r\n else:\r\n count += 1\r\n current = b\r\n x += 1;\r\n\r\nprint (count+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n#import sys\r\n\r\n#def pow_mod(base, exp):\r\n# if exp == 0:\r\n# return 1\r\n# elif exp == 1:\r\n# return base\r\n# elif (exp & 1) != 0:\r\n# return base * pow_mod(base * base, exp // 2)\r\n# else:\r\n# return pow_mod(base * base, exp // 2)\r\n \r\n \r\nn, m = map(int, input().split()) \r\na = ([int(z) for z in input().split()])\r\no = 0\r\ni = 0\r\ns = 0\r\nwhile(i<n):\r\n s = s + a[i]\r\n if s>m:\r\n s = 0\r\n o = o + 1\r\n else:\r\n if i==n-1:\r\n o = o + 1\r\n i = i + 1\r\nprint(o)\r\n \r\n \r\n#sys.stdout.flush()\r\n#print ('', flush=True)", "n, m = map(int, input().split())\r\ncnt = 1\r\ngroup = 0\r\nfor el in map(int, input().split()):\r\n if group + el > m:\r\n cnt += 1\r\n group = el\r\n else:\r\n group += el\r\nprint(cnt)", "n,m = tuple(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ni = 0\r\nk = 0\r\nans=0\r\nwhile i < n:\r\n\tif k+a[i]<=m:\r\n\t\tk+=a[i]\r\n\telse:\r\n\t\tk=a[i]\r\n\t\tans+=1\r\n\ti+=1\r\nif k:\r\n\tans+=1\r\nprint(ans)", "n, m = map(int, input().split())\r\nl_s = list(map(int, input().split()))\r\n\r\nc_p = m\r\nt = 0\r\n\r\nfor s in l_s:\r\n if c_p + s > m:\r\n t += 1\r\n c_p = s\r\n else:\r\n c_p += s\r\n \r\nprint(t)", "def turn(lst, m):\r\n count, i = 0, 0\r\n while i < len(lst):\r\n z = m\r\n while z >= lst[i]:\r\n z -= lst[i]\r\n i += 1\r\n if i >= len(lst):\r\n break\r\n count += 1\r\n return count\r\n\r\n\r\nN, M = [int(j) for j in input().split()]\r\nb = [int(x) for x in input().split()]\r\nprint(turn(b, M))\r\n", "n,m = map(int, input().split())\r\nk = list(map(int, input().split()))\r\nx = m\r\nbuses = 1\r\n\r\ni = 0\r\nwhile i < n:\r\n\tppl = k[i]\r\n\tif ppl > x:\r\n\t\tbuses += 1\r\n\t\tx = m\r\n\telif ppl == x:\r\n\t\ti+=1\r\n\t\tx = m\r\n\t\tif i!=n:\r\n\t\t\tbuses += 1\r\n\telse:\r\n\t\tx -= ppl\r\n\t\ti += 1\r\n\r\nprint(buses)", "n ,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\ncount = 1\r\ncur = 0\r\n\r\nfor i in l :\r\n if i + cur <= m :\r\n cur += i\r\n else:\r\n cur = i\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", "n, m = map(int, input().split())\r\nres = 1\r\ncur_capacity = m\r\n\r\nfor a in input().split():\r\n if int(a) > cur_capacity:\r\n cur_capacity = m - int(a)\r\n res += 1\r\n else:\r\n cur_capacity -= int(a)\r\n\r\nprint(res)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nans = 1\ncur = m\nfor i in range(n):\n\tif a[i] > cur:\n\t\tans+=1\n\t\tcur = m-a[i]\n\telse:\n\t\tcur -= a[i]\nprint(ans)", "import sys\n#sys.stdin = open('input.txt', 'r')\n\nn, M = map(int, input().split())\nA = list(map(int, input().split()))\nk = 0\nm = M\ni = 0\nwhile i < n:\n\twhile i < n and m >= A[i]:\n\t\tm -= A[i]\n\t\t#print(k,m)\n\t\ti += 1\n\t\t#k += 1\n\telse:\n\t\tk += 1\n\t\tm = M\nprint(k)\n\n\n\n\n\n\n", "def main():\r\n [_, k] = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n\r\n sol = 0\r\n while len(a) != 0:\r\n s = a[0]\r\n del a[0]\r\n\r\n if s <= k:\r\n sol += 1\r\n while len(a) > 0 and (s + a[0] <= k):\r\n s += a[0]\r\n del a[0]\r\n else:\r\n sol += 1\r\n a.insert(0, s % k)\r\n\r\n print(sol)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n", "import sys\r\nsize, maxPassangers = map(int, input().split())\r\n\r\narray = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nif size == 1:\r\n print(\"1\")\r\n sys.exit()\r\n\r\nbuffer = 0\r\nfor i in range(size):\r\n if buffer + array[i] <= maxPassangers:\r\n buffer += array[i]\r\n else:\r\n buffer = array[i]\r\n counter += 1\r\n\r\n\r\nprint(counter+1)", "groups,seats=input().split()\ngroups,seats=int(groups),int(seats)\nnumbers=list(map(int, input().split()))\ncount=1\ni=0\nrem=seats\nwhile i<groups:\n if rem-numbers[i]>=0:\n rem-=numbers[i]\n i+=1 \n else:\n rem=seats\n count+=1\n \nprint(count)\n \n \t\t \t\t\t\t \t \t \t \t \t \t \t", "n,m=map(int ,input().split())\r\nparsa=list(map(int,input().split()))\r\ncounter=1;i=0;q=m\r\nwhile i<n:\r\n if q>=parsa[i]:\r\n q-=parsa[i]\r\n i+=1\r\n else:\r\n counter+=1\r\n q=m\r\nprint(counter)", "def solve(n,m,arr):\r\n ans = 0\r\n i=0\r\n while i<n:\r\n c = arr[i]\r\n j = i+1\r\n while j<n and c+arr[j]<=m:\r\n c += arr[j]\r\n j += 1\r\n ans += 1\r\n i = j\r\n\r\n return ans\r\n \r\nif __name__==\"__main__\":\r\n n,m = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n \r\n ans = solve(n,m,arr)\r\n print(ans)", "g,b = map(int,input().split())\r\nbuses = 1\r\ncurrent = 0\r\nfor x in map(int,input().split()):\r\n if current + x > b:\r\n buses += 1\r\n current = x\r\n else:\r\n current += x\r\nprint (buses)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\n\r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nres = 1\r\nl = 0\r\ntmp = m\r\nwhile l < n:\r\n if tmp >= a[l]:\r\n tmp -= a[l]\r\n l += 1\r\n else:\r\n # print(l, tmp, res)\r\n res += 1\r\n tmp = m\r\nprint(res)\r\n", "n, m = map(int, input().split())\r\n\r\nout = 0\r\nm_ = 0\r\nfor i in map(int, input().split()):\r\n if m_ + i > m:\r\n m_ = i\r\n out += 1\r\n continue\r\n m_ += i\r\n\r\nif m_:\r\n out += 1\r\n\r\nprint(out)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1):\r\n c+=l[i]//m\r\n l[i]=l[i]%m\r\n if(l[i]+l[i+1]>m):\r\n c+=1\r\n else:\r\n l[i+1]=l[i]+l[i+1]\r\nc+=l[n-1]//m\r\nl[n-1]=l[n-1]%m\r\nif(l[n-1] != 0):\r\n c+=1\r\nprint(c)", "n, m = map(int, input().split())\r\nan = list(map(int, input().split()))\r\n\r\navtobus = 0\r\nm2 = m\r\n\r\nfor grupp in an:\r\n if m2 >= grupp:\r\n m2 -= grupp\r\n else:\r\n m2 = m - grupp\r\n avtobus += 1\r\n \r\nprint(avtobus + 1)\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=0\r\nans=1\r\nfor x in l:\r\n if k+x<=m: k+=x\r\n else: k=x; ans+=1\r\nprint(ans)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=0\r\ne=b\r\nfor i in c:\r\n if e>=i:\r\n e-=i\r\n else:\r\n e=b-i\r\n d+=1\r\nprint(d+1)", "from functools import reduce\r\nR = lambda: map(int, input().split())\r\nF = lambda x, y: (x[0] + 1, y[1]) if x[1] + y[1] > m else (x[0], x[1] + y[1])\r\nn, m = R()\r\ns = reduce(F, zip([0] * n, R()), (1, 0))\r\nprint(s[0])", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\ncur = 0\r\nfor i in range(n):\r\n if a[i] <= m - cur:\r\n cur += a[i]\r\n else:\r\n cnt += 1\r\n cur = a[i]\r\nprint(cnt + 1)", "n,m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nans = 1\r\nlim = m\r\nfor x in l:\r\n if x <= lim:\r\n lim -= x\r\n else :\r\n lim = m - x\r\n ans = ans + 1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\ngroups=list(map(int,input().split()))\r\ntemp=m\r\nbuses=1\r\nfor i in groups:\r\n if(i<=temp):\r\n temp-=i\r\n else:\r\n temp=m-i\r\n buses+=1\r\nprint(buses)\r\n", "n,m=map(int,(input()).split())\r\n\r\nchis=input().split()\r\nchis=[int(x) for x in chis]\r\nbus=0\r\nstack=0\r\nk=0\r\ni=0\r\nwhile i!=n:\r\n if chis[i]+stack<=m:\r\n\r\n stack+=chis[i]\r\n i+=1\r\n else:\r\n stack=chis[i]\r\n bus += 1\r\n i += 1\r\nprint(bus+1)", "n, m = input().split( )\nn, m = int(n), int(m)\n\ntamanho = input().split( )\ntamanho = [int(x) for x in tamanho]\n\n\nsoma = 0\nv = 0\nfor i in range(0, n):\n if soma + tamanho[i] > m:\n soma = 0\n v+=1\n soma += tamanho[i]\nv+=1\n\nprint(v)\n \t\t \t\t \t\t\t\t \t \t \t \t \t", "from collections import deque\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\nin_bus, left = 0, 0\ngroups = deque(a)\n\nwhile groups:\n\tif in_bus+groups[0] <= m:\n\t\tin_bus += groups[0]\n\t\tif in_bus == m:\n\t\t\tleft += 1\n\t\t\tin_bus = 0\n\t\tgroups.popleft()\n\telse:\n\t\tleft += 1\n\t\tin_bus = 0\n\nif in_bus:\n\tleft += 1\n\nprint(left)\n", "people = 0 \r\nresult = 1\r\nn , m = map(int , input().split())\r\nl = list(map(int , input().split()))\r\nfor i in l : \r\n if people + i <= m :\r\n people += i \r\n else : \r\n result += 1 \r\n people = i \r\nprint(result) \r\n", "for u in range(1):\r\n n, m = map(int, input().split())\r\n x = [int(w) for w in input().split()]\r\n \r\n ans = 1\r\n s = 0\r\n \r\n for i in range(n):\r\n if(s + x[i] <= m):\r\n s += x[i]\r\n \r\n else:\r\n ans += 1\r\n s = x[i]\r\n \r\n print(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc,x,y=1,0,0\r\nwhile x<n:\r\n\tif y+l[x]<=m:y+=l[x]\r\n\telse:\r\n\t\ty=l[x]\r\n\t\tc+=1\r\n\tx+=1\r\nprint(c)", "N, M = map(int, input().split())\nArr = list(map(int, input().split()))\nans = 0\ni = 0\nfor elt in Arr:\n if i + elt <= M:\n i += elt\n else:\n ans += 1\n i = elt\nif i > 0:\n ans += 1\nprint(ans)\n", "n , m = map(int, input().split())\r\nmylist = list(map(int,input().split()))\r\nindex = 0\r\ncount = 1\r\nbus_stop = m\r\nwhile index < n :\r\n if bus_stop - mylist[index] >= 0:\r\n bus_stop -= mylist[index]\r\n index += 1\r\n else:\r\n bus_stop = m\r\n count += 1\r\nprint(count)", "\r\n\r\nn, busCap = map(int, input().split())\r\n\r\ngroups = list(map(int, input().split()))\r\n\r\n\r\n# sum = sum(listy)\r\n\r\n# if sum % m == 0:\r\n# print(int(sum/m))\r\n# else:\r\n# print(int(sum/m)+1)\r\n\r\n\r\nbuses = 1\r\ntemp = busCap\r\nfor groupCount in groups:\r\n if groupCount > temp:\r\n buses += 1\r\n temp = busCap\r\n temp -= groupCount\r\nprint(buses)\r\n\r\n\r\n\r\n\r\n", "n,m=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ni=0\r\nwhile c:\r\n\tv=m\r\n\tk=0\r\n\tY=False\r\n\twhile v>0 and c and not Y:\r\n\t\tif c[0]<=v:\r\n\t\t\tv-=c[0]\r\n\t\t\tc.remove(c[0])\r\n\t\telse: Y=True\r\n\ti+=1\r\nprint(i)", "n, m = map(int, input().split())\r\ngroups = [int(c) for c in input().split()]\r\n\r\nans = 1\r\ncap = m\r\n\r\nfor g in groups:\r\n if g <= cap:\r\n cap -= g\r\n else:\r\n ans += 1\r\n cap = m - g\r\n \r\nprint(ans)\r\n", "n,m=map(int,input().split())\nl=list(map(int,input().split()))\nr,cur=1,0\nfor i in range(n):\n\tif l[i]+cur<=m:\n\t\tcur+=l[i]\n\telse:\n\t\tr+=1\n\t\tcur=l[i]\nprint(r)", "x = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nn=x[0]\r\nm=x[1]\r\ni=0\r\nc=1\r\nv = 0\r\nwhile i < n:\r\n if v +l[i]>m :\r\n c+=1\r\n v=l[i]\r\n else :\r\n v+=l[i]\r\n i+=1\r\nprint(c)", "n, m = map(int, input().split())\na = [*map(int, input().split())]\nc=1\nr=m\nfor x in a:\n if r<x:\n c+=1\n r=m\n r-=x\nprint(c)\n", "def main():\r\n n, m = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n\r\n s, counter = 0, 0\r\n for i in range(n):\r\n if s + arr[i] > m:\r\n counter += 1\r\n s = arr[i]\r\n else:\r\n s += arr[i]\r\n if s > 0:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nb = 0\r\ni = 0\r\nwhile i < n:\r\n j = i\r\n k = 0\r\n while j < n and k + a[j] <= m:\r\n k += a[j]\r\n j += 1\r\n b += 1\r\n i = j\r\n\r\nprint(b)", "import sys\ninput = sys.stdin.readline\nshow = sys.stdout.write\n\nn,m = map(int, input().split())\narr = list(map(int, input().split()))\n\ni = 0\ncnt = 1\nvac = m\nwhile i<n:\n if arr[i] <= vac:\n vac -= arr[i]\n i+=1\n else:\n vac = m\n cnt +=1\nshow(str(cnt))\n \t \t\t \t\t\t \t \t \t\t\t", "n, m = tuple(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ni = 0; s = 0; k = 0\r\nwhile i < n:\r\n if s + a[i] <= m:\r\n s += a[i]\r\n else:\r\n k += 1\r\n s = a[i]\r\n i += 1\r\nif s: k += 1 \r\nprint(k)", "n, m = [int(j) for j in input().split()]\r\nnums = [int(j) for j in input().split()]\r\nbus, count = m, 1\r\nj = 0\r\nwhile j < n:\r\n if bus - nums[j] >= 0:\r\n bus -= nums[j]\r\n j += 1\r\n else:\r\n bus = m\r\n count += 1\r\nprint(count)\r\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\na=r=0\r\nfor x in I():\r\n a+=x\r\n if a>=m:\r\n r+=1\r\n a=[x,0][a==m]\r\nr+=a>0\r\nprint(r)", "#A. Queue on Bus Stop\n#taking input for m and n\nn,m = input().split(\" \")\na = input().split(\" \")\ncount = 1\t#stores number of buses needed\n#converting to ints\nn = int(n)\nm = int(m)\ntemp = m\nfor i in range(n):\n\ta[i] = int(a[i])\n#calculating number of buses\nfor i in range(n):\n\tif(a[i] <= temp):\n\t\ttemp-=a[i]\n\telse:\n\t\ttemp = m - a[i]\n\t\tcount+=1\nprint(count)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = i = 0\r\nwhile i < n:\r\n s = 0\r\n while i < n and s + a[i] <= m:\r\n s += a[i]\r\n i += 1\r\n ans += 1\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ni=0\r\nc,b=1,0\r\nwhile i<n:\r\n if b+x[i]<=m:\r\n b+=x[i]\r\n else:\r\n c+=1\r\n b=x[i]\r\n i+=1\r\nprint(c)", "z=[int(n) for n in input().split()]\r\ns=[int(n) for n in input().split()]\r\nk=z[1]\r\nl=0\r\nm=0\r\nfor n in s:\r\n if n+m>k:\r\n m=n\r\n l+=1\r\n else:\r\n m+=n\r\nprint(l+1)", "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nans = 1\r\nspace = m\r\n \r\nfor i in range(n):\r\n if space >= x[i]:\r\n space -= x[i]\r\n else:\r\n ans += 1\r\n space = m - x[i]\r\nprint(ans)\r\n\r\n ", "def f(a,b,c):\r\n if not c:return 0 if a==b else 1\r\n if c[0]>a:return 1+f(b,b,c)\r\n return f(a-c[0],b,c[1:])\r\na=int(input().split()[1])\r\nb=list(map(int,input().split()))\r\nprint(f(a,a,b))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=1\r\nsum=0\r\nfor i in range(n):\r\n sum+=a[i]\r\n if sum>m:\r\n sum=a[i]\r\n ans+=1\r\nprint(ans)", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ncnt = 0\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\n if s > m:\r\n cnt += 1\r\n s = a[i]\r\nprint(cnt + 1)", "n, m = (int(x) for x in input().split())\r\ncur, val = 0, 1\r\nfor ai in (int(x) for x in input().split()):\r\n if cur + ai <= m:\r\n cur += ai\r\n else:\r\n cur = ai\r\n val += 1\r\nprint(val)", "import sys\n\nn, m = map(int, sys.stdin.readline().split())\nan = list(map(int, sys.stdin.readline().split()))\n\nans = 1\nleft = 0\nfor i in range(n):\n if left + an[i] <= m:\n left += an[i]\n else:\n left = an[i]\n ans += 1\n\nprint(ans)\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns=0\r\nans=0\r\nfor i in range(n):\r\n\ts+=arr[i]\r\n\tif s>m:\r\n\t\tans+=1\r\n\t\ts=arr[i]\r\nif s>0:\r\n\tprint(ans+1)\r\nelse:\r\n\tprint(ans)", "n,m=map(int,input().split())\r\nmm=m\r\na=list(map(int,input().split()))\r\nb=0\r\ni=0\r\nwhile i<n:\r\n m-=a[i]\r\n if m<0:\r\n b+=1\r\n m=mm\r\n i-=1\r\n i+=1 \r\nb+=1\r\nprint(b) ", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres,ans=m,0\r\nfor i in range(n):\r\n if a[i]<=res:\r\n res-=a[i]\r\n else:\r\n res=m-a[i]\r\n ans+=1\r\nprint(ans+1)", "n, m = map(int, input().split())\nA = list(map(int, input().split()))\nnow = 0\nans = 0\nfor a in A:\n if now + a <= m:\n now += a\n else:\n now = a\n ans += 1\nif now != 0:\n ans += 1\nprint(ans)\n", "'''input\n3 4\n1 2 1\n'''\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nt = 0\nwhile a:\n\ts = a.pop(0)\n\twhile a and s + a[0] <= m:\n\t\ts += a.pop(0)\n\tt += 1\nprint(t)\n\n", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[1])\r\nstring = input()\r\nnumbers = list(map(int, string.split()))\r\nn = 0\r\nwhile len(numbers) != 0:\r\n b = 0\r\n for x in numbers[:]:\r\n b += x\r\n if b > a:\r\n break\r\n numbers.remove(x)\r\n n += 1\r\nprint(n)", "gb = [int(i) for i in input().split()]\r\ngroups = gb[0]\r\nmax_capacity = gb[1]\r\ncurrent = 0\r\ntrips_required = 1\r\ngroup_nums = [int(i) for i in input().split()]\r\nfor k in group_nums:\r\n if current + k > max_capacity:\r\n current = k\r\n trips_required += 1\r\n else:\r\n current += k\r\nprint(trips_required)\r\n", "n, m = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nt = ans = 0\r\nfor i in arr:\r\n if t + i <= m:\r\n t += i\r\n else:\r\n t = i\r\n ans += 1\r\nprint(ans + (t > 0))\r\n", "a=0\r\ni=0\r\nb=0\r\nz=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nwhile 1 :\r\n a+=x[i]\r\n # print('a=',a)\r\n if a>z[1]:\r\n b+=1\r\n # print('b=',b)\r\n a=0\r\n else:\r\n i+=1\r\n \r\n # print('i=',i)\r\n if i==len(x): \r\n break\r\nprint(b+1)\r\n \r\n ", "import math\na = list(map(int,input().split()))\npeople = list(map(int,input().split()))\ntotal_group = a[0]\nseat_bus = a[1]\n\nmax_bus = total_group * seat_bus\n\ncheck = 0\n\n\nloop = math.ceil(total_group)\n##sums = sum(people)\nskip = False\nrem = 0\ntemp = people[0]\nprev = 0\ncookies = 0\nfor i in range(0,loop-1):\n\n if temp + people[i+1] <= seat_bus:\n skip = False\n \n \n if people[i] + people[i+1] <= seat_bus and skip == False:\n temp = people[i] + people[i+1]\n people[i+1] = temp\n cookies +=1\n else:\n cookies = 0\n check+=1\n \n \n \n \n\n\n\nlast = people[-1]\nif last <= seat_bus and skip == False:\n check+=1\n\nprint(check)\n\n \n \n", "n, m = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ntotal, x = 0, 0\nwhile x < n:\n curr = 0\n while x < n and curr + a[x] <= m:\n curr += a[x]\n x += 1\n total += 1\n\nprint(total)\n", "n, m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nc = 1\r\ntemp = 0\r\nfor i in a:\r\n if temp+i<=m:\r\n temp += i\r\n else:\r\n temp = i\r\n c += 1\r\nprint(c)\r\n ", "'''\nID: essi\nLANG: PYTHON3\nTASK: self-contest.py\n'''\nn, m = map(int,input().split())\na = list(map(int,input().split()))\nres = 1\nsu = 0\nfor i in range(n):\n su+= a[i]\n if su > m:\n res+=1\n su = a[i]\nprint(res)", "n, m = [int(c) for c in input().split()]\r\na = [int(c) for c in input().split()]\r\n\r\nres = 0\r\ncurrent_sum = 0\r\n\r\nwhile len(a) > 0:\r\n val = a.pop()\r\n\r\n if current_sum + val <= m:\r\n current_sum = current_sum + val\r\n else:\r\n current_sum = val\r\n res += 1\r\n\r\nif current_sum != 0:\r\n res += 1\r\n\r\nprint(res)", "z=lambda:map(int,input().split());a,b=z();c=list(z());s=i=0;from math import*\r\nwhile(i<a):\r\n k=ceil(c[i]/b);l=k*b-c[i];i+=1;s+=k\r\n while(i<a):\r\n if l>=c[i]:l-=c[i];i+=1\r\n else:break\r\nprint(s)", "import math\r\na = list(map(int,input().split()))\r\npeople = list(map(int,input().split()))\r\ntotal_group = a[0]\r\nseat_bus = a[1]\r\n\r\nmax_bus = total_group * seat_bus\r\n\r\ncheck = 0\r\n\r\n###check if people have same number of seat_bus\r\n##check_same = [i for i in range(total_group) if people[i] == seat_bus]\r\n###remove the same numbers of seat_bus\r\n##print(\"people before: \",people)\r\n##for i in check_same:\r\n## people.remove(seat_bus)\r\n##\r\n##print(\"people now: \",people)\r\n##check+=len(check_same)\r\n####print(\"ini check abis\",check)\r\nloop = math.ceil(total_group)\r\n##sums = sum(people)\r\nskip = False\r\nrem = 0\r\ntemp = people[0]\r\nprev = 0\r\ncookies = 0\r\nfor i in range(0,loop-1):\r\n\r\n if temp + people[i+1] <= seat_bus:\r\n skip = False\r\n \r\n \r\n if people[i] + people[i+1] <= seat_bus and skip == False:\r\n temp = people[i] + people[i+1]\r\n people[i+1] = temp\r\n cookies +=1\r\n else:\r\n cookies = 0\r\n check+=1\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\nlast = people[-1]\r\nif last <= seat_bus and skip == False:\r\n check+=1\r\n\r\nprint(check)\r\n\r\n \r\n \r\n", "import math, sys\r\nwhile True:\r\n line = sys.stdin.readline()\r\n if not line: break\r\n n, m = [int(i) for i in line.split()]\r\n elems = [int(i) for i in sys.stdin.readline().split()]\r\n b = 1\r\n i = 0\r\n c = m\r\n while elems[-1] > 0:\r\n #print(elems, b, i, c)\r\n if c >= elems[i]:\r\n c -= elems[i]\r\n elems[i] = 0\r\n i += 1\r\n else:\r\n c = m\r\n b += 1\r\n print(b)\r\n", "n,m = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\nans=1\r\npeople=0\r\n \r\nfor i in range(len(lst)):\r\n if people+lst[i] <= m:\r\n people+=lst[i]\r\n else:\r\n ans+=1\r\n people=lst[i]\r\n\r\nprint(ans)", "n, m = tuple(map(int, str.split(input())))\na = tuple(map(int, str.split(input())))\n\ncbus = 0\ncount = 0\nfor x in a:\n\n if cbus + x <= m:\n\n cbus += x\n\n else:\n\n cbus = x\n count += 1\n\nif cbus:\n\n count += 1\n\nprint(count)\n", "(n, m), a, b, c = list(map(int, input().split())), list(map(int, input().split())), 0, 0\r\n\r\na.append(m + 1)\r\n\r\nfor i in range(len(a) - 1):\r\n if b + a[i] <= m and b + a[i] + a[i + 1] > m:\r\n b = 0\r\n c = c + 1\r\n else:\r\n b = b + a[i]\r\n\r\nprint( c )", "class CodeforcesTask435ASolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.groups = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n self.groups = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n buses = 1\n bus = 0\n while self.groups:\n if bus + self.groups[0] <= self.n_m[1]:\n bus += self.groups[0]\n self.groups = self.groups[1:]\n else:\n bus = 0\n buses += 1\n self.result = str(buses)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask435ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n, m = map(int, input().split())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\ntotal = 1\r\ncap = 0\r\n\r\nfor i in range(n):\r\n if daf[i] <= m - cap:\r\n cap += daf[i]\r\n else:\r\n total += 1\r\n cap = daf[i]\r\n\r\nprint(total)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nj=0\r\ni=0\r\nwhile i<n:\r\n\tif j+l[i]<=m:\r\n\t\tj+=l[i]\r\n\t\ti+=1\r\n\telse:\r\n\t\ts+=1\r\n\t\tj=0\r\nif j!=0:\r\n\ts+=1\r\nprint(s)", "nb_groups, max_ride = [int(x) for x in input().split()]\r\ngroups = [int(x) for x in input().split()]\r\nneed = 0\r\nwhile groups:\r\n curr = max_ride\r\n while groups and curr >=groups[0]:\r\n curr -= groups.pop(0)\r\n need += 1\r\nprint(need)\r\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = 1\r\nc = 0\r\nfor i in a:\r\n if c+i <= m:\r\n c+=i\r\n else:\r\n c = i\r\n x+=1\r\nprint(x)", "\r\n# ██╗ ██╗ █████╗ ██╗ ██████╗ ███████╗ ████████╗ ██╗ ██╗ \r\n# ██║ ██╔╝██╔══██╗██║ ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║ ██║ \r\n# █████╔╝ ███████║██║ ██║ ██║ █████╗ ████████║ ███████║ \r\n# ██╔═██╗ ██╔══██║██║ ██║ ██║ ██╔══╝ ╔════╝██║ ██╔══██║ \r\n# ██║ ██╗██║ ██║███████╗██████╔╝ ███████╗ ████████║ ██║ ██║ \r\n# ╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═════╝ ╚══════╝ ╚══════╝╚ ═╝ ╚═╝ \r\n\r\nMOD = int(1e9)+7\r\nfrom math import sqrt,ceil,log,log2,\\\r\nfloor,gcd,pi,factorial,lcm\r\nfrom collections import deque\r\nfrom itertools import permutations\r\n\r\ndef solve():\r\n sm = 0\r\n ans = 0\r\n i = 0\r\n while i<n:\r\n if a[i]+sm <= m:\r\n sm+=a[i]\r\n else:\r\n ans += 1\r\n sm = 0\r\n i-=1\r\n i+=1\r\n if sm:ans+=1\r\n print(ans)\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n n,m = map(int,input().split())\r\n a = [int(x) for x in input().split()]\r\n solve()", "# coding: utf-8\nn, m = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\na.reverse()\nans = 0\nwhile a:\n tmp = m\n while a and tmp>=a[-1]:\n tmp -= a.pop()\n ans += 1\nprint(ans)\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nbuses = 0\r\ncurrent = 0\r\n\r\nwhile current < n:\r\n groups = 0\r\n passengers = 0\r\n \r\n while current < n and passengers + a[current] <= m:\r\n passengers += a[current]\r\n groups += 1\r\n current += 1\r\n \r\n buses += 1\r\n\r\nprint(buses)\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,m=rinput()\r\na=list(map(int,input().split()))\r\nbus=1\r\n\r\nrem=m\r\nfor i in range(n):\r\n if(rem>=a[i]):\r\n rem-=a[i]\r\n else:\r\n bus+=1\r\n rem=m-a[i]\r\n\r\nprint(bus)\r\n\r\n\r\n", "n, m = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nres, left = 0, 0\nfor i in a:\n if i > left:\n res += 1\n left = m\n left -= i\nprint(res)\n", "n,m=map(int,input().split())\r\na= list(map(int, input().split()))\r\nt1,c=0,1\r\nfor i in a:\r\n t1+=i\r\n if t1>m:\r\n c+=1\r\n t1=i\r\nprint(c)\r\n", "t = input().split()\r\nn = int(t[0])\r\nm = int(t[1])\r\ndel t\r\nt = [int(x) for x in input().split()]\r\n'''\r\nslon = t.count(m)\r\nif slon != 0:\r\n t.remove(m)\r\nn = len(t)\r\n'''\r\nslon = 0\r\ntemp = 0\r\nfor i in range(n):\r\n temp = t[i]\r\n t[i] = 0\r\n for j in range(n):\r\n if temp + t[j] <= m:\r\n temp += t[j]\r\n t[j] = 0\r\n else:\r\n break\r\n if temp != 0:\r\n slon += 1\r\n #print(t)\r\nprint(slon)\r\n'''\r\n if temp[i] > m:\r\n temp[i + 1] += (temp[i] - m)\r\n slon += 1\r\n elif temp[i] < m:\r\n temp[i + 1] += temp[i]\r\n else:\r\n slon += 1\r\nslon += (temp[n - 1] // m) + (0 if temp[n - 1] % m == 0 else 1)\r\nprint(slon)\r\n '''\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 1\r\navt = m\r\ni = 0\r\nwhile i < n:\r\n if a[i] <= avt:\r\n avt -= a[i]\r\n i+=1\r\n else:\r\n ans += 1\r\n avt = m\r\nprint(ans)", "from functools import reduce\r\nn, m = map(int, input().split())\r\na = list(zip([0] * n, map(int, input().split())))\r\ns = reduce(lambda x, y: (x[0] + 1, y[1]) if x[1] + y[1] > m else (x[0], x[1] + y[1]), a, (1, 0))\r\nprint(s[0])", "n,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ni = 0\r\nsumm = 0\r\ncount = 1\r\nwhile i<n:\r\n if summ+arr[i]<=m:\r\n summ += arr[i]\r\n else:\r\n count += 1\r\n summ = arr[i]\r\n i += 1\r\nprint(count)", "# This is problem one\ngroup, capacity = input().split()\ngroup, capacity = int(group), int(capacity)\ngroups = input().split()\noldcapacity, ride_ons, bus, i = capacity, 0, 0, 0\nwhile i < group: \n cgroup = int(groups[i])\n if cgroup > capacity: \n bus = 0\n break\n if cgroup == oldcapacity:\n oldcapacity = capacity\n i = i + 1\n bus = bus + 1\n elif cgroup < oldcapacity and i != group - 1:\n oldcapacity = oldcapacity - cgroup\n i = i + 1\n elif cgroup < oldcapacity and i == group - 1:\n bus = bus + 1\n break\n else:\n bus = bus + 1\n oldcapacity = capacity\nprint(bus)\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\nbuses, used_seats = 1, 0\r\n\r\nfor a in list(map(int, input().split())):\r\n used_seats += a\r\n if used_seats > m:\r\n buses, used_seats = buses + 1, a\r\n\r\nprint(buses)", "n, m = [int(x) for x in input().split()]\r\ngroups = [int(x) for x in input().split()]\r\ntotal = 1\r\noccupied = 0\r\n\r\nfor i in groups:\r\n if occupied + i <= m:\r\n occupied += i\r\n else:\r\n total +=1\r\n occupied = i\r\n\r\nprint(total)", "n, mx = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nct = 0\r\nsm = 0\r\ni = 0\r\n\r\nwhile i < n:\r\n curr = mx - sm\r\n if curr >= ls[i]:\r\n sm += ls[i]\r\n i += 1\r\n else:\r\n # bus will pass. ct will increase. Next will come\r\n ct += 1\r\n sm = 0\r\n# checking last bus pass\r\nif sm > 0:\r\n ct += 1\r\n\r\nprint(ct)" ]

[ "n=int(input())\ns,z=0,0\nfor l in map(float,input().split()):\n\ts+=(d:=l-int(l))\n\tz+=d>0\nprint(\"%.3f\"%min(abs(s-i) for i in range(z-n,min(z,n)+1)))\n", "n, t = int(input()), [int(i[-3: ]) for i in input().split()]\r\nk, s = t.count(0), sum(t)\r\nc = s // 1000 + int(s % 1000 > 500)\r\na, b = max(0, n - k), min(2 * n - k, n)\r\nif a <= c <= b: s = abs(c * 1000 - s)\r\nelse: s = min(abs(a * 1000 - s), abs(b * 1000 - s))\r\nprint(str(s // 1000) + '.' + str(s % 1000).zfill(3))", "from math import ceil,floor\r\nn = int(input())\r\ntotal = 0\r\nm = 0\r\nanswer = float('inf')\r\nfor a in map(float,input().split()):\r\n if floor(a) == ceil(a):\r\n m += 1\r\n total += ceil(a)-a\r\nfor i in range(n-m,n+1):\r\n answer = min(answer,abs(total-i))\r\nprint(\"{:.3f}\".format(answer))", "def rl():\r\n return list(map(float,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n n=ri()\r\n a=rl()\r\n b=[]\r\n cnt=0\r\n for i in range(2*n):\r\n a[i]=round(a[i]*1000)\r\n if a[i]%1000!=0:b.append(a[i]%1000)\r\n else: cnt+=1\r\n c=sum(b)-n*1000\r\n ans=abs(c)\r\n for i in range(1,cnt+1):\r\n c+=1000\r\n ans=min(ans,abs(c))\r\n return ans/1000\r\n\r\nprint(\"{:.3f}\".format(main()))\r\n\r\n", "n = int(input())\r\nl = list(map(float, input().split()))\r\nl = sorted([x - int(x) for x in l if x - int(x) != 0])\r\no = 2*n - len(l)\r\nsu = sum(l)\r\nans = 0xFFFFFFFFFFFFFFF\r\nfor i in range(n + 1):\r\n if i + o >= n:\r\n ans = min(ans, abs(i-su))\r\nprint(\"%.3f\" % ans)", "#Jasnah\r\nfrom math import floor,ceil\r\nfrom sys import stdin,stdout\r\n\r\nn=int(stdin.readline())\r\na=[]\r\nc=0\r\nres=0\r\na=list(map(float,stdin.readline().split()))\r\nfor i in range(len(a)):\r\n s=a[i]%1\r\n if s==0:\r\n c+=1\r\n else:\r\n res+=s\r\n a.append(s)\r\nans=n-res\r\nresult=10000000\r\ni=0\r\nwhile i<=min(n,c):\r\n result=min(result,abs(ans-i))\r\n i+=1\r\n\r\nprint(f\"{result:.3f}\")", "n=int(input())\r\ns=z=0\r\nfor l in map(float,input().split()):\r\n\ts+=(d:=l-int(l))\r\n\tz+=d>0\r\nprint(\"%.3f\"%min(abs(s-i) for i in range(z-n,n+1)))" ]

[ "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\nnums = input()\r\n\r\npos = defaultdict(int)\r\nneg = defaultdict(int)\r\nzeroes = 0\r\n\r\nfor num in nums.split(\" \"):\r\n if int(num) > 0:\r\n pos[int(num)] += 1\r\n elif int(num) < 0:\r\n neg[int(num)] += 1\r\n else:\r\n zeroes += 1\r\n\r\n# Since 0 can be matches with any other zero, this can be achieved with the combinations formula\r\nmatches = zeroes * (zeroes - 1) // 2\r\n\r\n# Now for postitive and negative numbers\r\nfor key in pos:\r\n matches += neg[-key] * pos[key]\r\nprint(matches)\r\n", "\r\nfrom collections import defaultdict\r\n\r\ndef solve(n,arr):\r\n\t\r\n\thm = defaultdict(int)\r\n\t\t\r\n\tfor x in arr :\r\n\t\thm[x] += 1\r\n\r\n\tans = 0\r\n\t\r\n\tfor ti in range(1,11):\r\n\t\tans += hm[ti]*hm[-ti]\r\n\r\n\tans += hm[0]*(hm[0]-1)//2\r\n\r\n\tprint(ans)\r\n\r\nn = int(input())\r\narr= list(map(int,list(input().split())))\r\nsolve(n,arr)", "size = int(input())\ncouples = input().split(\" \")\ncouples = [int(x) for x in couples]\nmatches = 0\nzero = 0\nseenPos = [0] * 20\nseenNeg = [0] * 20\nfor x in couples:\n if x == 0:\n zero += 1\n elif x > 0:\n seenPos[x] += 1\n elif x < 0:\n seenNeg[-x] += 1\nfor x in range(20):\n matches += seenPos[x] * seenNeg[x]\nprint(matches + (zero * (zero - 1) // 2))\n\t \t \t\t\t\t\t \t \t \t\t\t\t\t\t\t\t \t\t", "d={}\r\ninput()\r\nk=0\r\nfor i in map(int,input().split()):k+=d.get(-i,0);d[i]=d.get(i,0)+1\r\nprint(k)", "n = input()\ncustomers = [int(i) for i in input().split()]\ncounts = [0] * 21\ncouples = 0\nfor c in customers:\n counts[c + 10] += 1\nfor i in range(10):\n couples += counts[i] * counts[20-i]\ncouples += (counts[10] * (counts[10] - 1) // 2)\nprint(couples)\n \t\t \t \t \t \t\t \t \t\t \t \t \t\t", "from collections import defaultdict\n\nn = int(input())\nnums = input()\n\npos = defaultdict(int)\nneg = defaultdict(int)\nzeroes = 0\n\nfor num in nums.split(\" \"):\n if int(num) > 0:\n pos[int(num)] += 1\n elif int(num) < 0:\n neg[int(num)] += 1\n else:\n zeroes += 1\n\n# Since 0 can be matches with any other zero, num matches can be calculates with the combinations formula\nmatches = zeroes * (zeroes - 1) // 2\n\n# Now for postitive and negative numbers, multiply the occurrences of a positive number with it's negative number\nfor key in pos:\n matches += neg[-key] * pos[key]\nprint(matches)\n\n\t \t \t\t\t \t\t\t\t \t\t \t\t\t \t", "from collections import Counter\n\nn = int(input())\ncouples = list(map(int,input().split()))\ntList = set()\nc = Counter(couples)\n\nfor couple in couples:\n tList.add(abs(couple))\n\nres = 0\nfor t in tList:\n if t == 0:\n res+=c[t]*(c[t]-1)//2\n else:\n res+=c[t]*c[-t]\nprint(res)\n\n\n\n\t\t\t \t \t\t \t \t\t\t\t \t\t\t\t \t \t\t", "input()\nlst = input()\nlst =[int(x) for x in lst.split(\" \")]\n\nfrom math import comb\nhsh = {}\npairs = 0\nfor x in lst:\n if x not in hsh:\n hsh[x] = 0\n hsh[x] +=1\nif 0 in hsh:\n z = hsh.pop(0)\n pairs += comb(z,2)\nk = list(hsh.keys())\n\nfor x in k:\n if x in hsh:\n if -x in hsh:\n n = hsh.pop(-x)\n pairs += hsh[x] * n\n \nprint(pairs)\n\t \t \t\t \t \t \t\t \t \t \t \t", "# Asif Islam - asifislam510\n# Input an integer 'n'\nn = int(input())\n\n# Input 'n' numbers and create a list\nnumbers = [int(x) for x in input().split()[:n]]\n\n# Initialize a dictionary to count occurrences of numbers\nnumber_count = {}\n\n# Count occurrences of each number in the list\nfor num in numbers:\n number_count[num] = number_count.get(num, 0) + 1\n\n# Initialize a variable to store the result\nresult = 0\n\n# Calculate the sum of pairs with opposite signs\nfor num in number_count:\n if num > 0:\n result += number_count[num] * number_count.get(-num, 0)\n\n# Add combinations of zeros (nC2) to the result\nresult += number_count.get(0, 0) * (number_count.get(0, 0) - 1) // 2\n\n# Print the result as an integer\nprint(int(result))\n \t \t\t\t \t\t\t\t \t\t \t", "def solution():\n import math\n def solve(nums):\n nums = [int(x) for x in nums]\n cnt, res = 0, 0\n valSet = set()\n freq = {}\n for n in nums:\n if not n:\n cnt += 1\n continue\n if n in freq:\n freq[n] += 1\n else:\n freq[n] = 1\n valSet.add(abs(n))\n for val in valSet:\n if val in freq and -val in freq:\n res += freq[val] * freq[-val]\n if cnt <= 1:\n return res\n if cnt == 2:\n return res + 1\n return res + math.factorial(cnt) // (math.factorial(2) * math.factorial(cnt-2))\n t = int(input())\n print(solve(input().split()))\nsolution()\n\t \t\t\t \t\t \t \t \t \t \t", "n = int(input())\r\nx = list(map(int, input().split()))\r\ndata = 21 * [0]\r\nfor item in x:\r\n data[item + 10] += 1\r\nres = 0\r\nfor i in range(11):\r\n if i != 10:\r\n res += data[i] * data[20 - i]\r\n else:\r\n res += data[i] * (data[i] - 1) // 2\r\nprint(res)" ]

[ "import sys\r\nreadline=sys.stdin.readline\r\nfrom heapq import heappop,heappush\r\n\r\nN,M=map(int,readline().split())\r\nR=[[] for l in range(N)]\r\nfor i in range(M):\r\n r,c=map(int,readline().split())\r\n l=N-c\r\n R[l].append((r,i))\r\nqueue=[]\r\nans_lst=[]\r\nfor l in range(N):\r\n for r,i in R[l]:\r\n heappush(queue,(r,i))\r\n while queue and queue[0][0]<=l:\r\n heappop(queue)\r\n if queue:\r\n ans_lst.append(heappop(queue)[1]+1)\r\nprint(len(ans_lst))\r\nprint(*ans_lst)" ]

[ "s = input()\r\np = [-1] * 26\r\nans = [0] * 26\r\n\r\nfor i in range(len(s)):\r\n p[ord(s[i]) - ord('a')] = i\r\n x = p[:]\r\n x.append(-1)\r\n x.sort()\r\n \r\n for i in range(1, 27):\r\n ans[26 - i] += x[i] - x[i - 1]\r\n\r\nwhile ans[-1] <= 0:\r\n ans.pop()\r\n\r\nprint(len(ans))\r\nfor x in ans:\r\n print(x)" ]

[ "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nh1, a1, c1 = map(int, input().split())\r\nh2, a2 = map(int, input().split())\r\nmove = [\"STRIKE\", \"HEAL\"]\r\nans = []\r\nt = 0\r\nwhile h2 > 0:\r\n if t == 0:\r\n if a1 >= h2:\r\n ans.append(0)\r\n h2 -= a1\r\n elif h1 > a2:\r\n h2 -= a1\r\n ans.append(0)\r\n else:\r\n ans.append(1)\r\n h1 += c1\r\n else:\r\n h1 -= a2\r\n t = t^1\r\nprint(len(ans))\r\nfor ai in ans: print(move[ai])", "h1,a1,c1=map(int,input().split())\r\nh2,a2=map(int,input().split())\r\ncnt=0\r\nls=[]\r\nwhile True:\r\n cnt+=1\r\n if h2-a1<=0:\r\n ls.append('STRIKE')\r\n break\r\n if h1-a2<=0:\r\n h1+=c1\r\n h1-=a2\r\n ls.append('HEAL')\r\n else:\r\n h1-=a2\r\n h2-=a1\r\n ls.append('STRIKE')\r\nprint(cnt)\r\nfor i in ls:\r\n print(i)\r\n", "# LUOGU_RID: 113785927\nh1,a1,c1=map(int,input().split())\r\nh2,a2=map(int,input().split())\r\na=[]\r\nwhile h2>0:\r\n if h1>a2 or a1>=h2:\r\n h2-=a1\r\n a.append('STRIKE')\r\n else:\r\n h1+=c1\r\n a.append('HEAL')\r\n h1-=a2\r\nprint(len(a))\r\nfor i in a:\r\n print(i)", "import math\r\nh1, a1, c1 = map(int, input().split())\r\nh2, a2 = map(int, input().split())\r\nmoves = []\r\nwhile h2 > 0:\r\n if math.ceil(h1 / a2) >= math.ceil(h2 / a1):\r\n h2 -= a1\r\n moves.append(\"STRIKE\")\r\n else:\r\n h1 += c1\r\n moves.append(\"HEAL\")\r\n h1 -= a2\r\nprint(len(moves))\r\nfor i in moves:\r\n print(i)", "h1,a1,c1 = map(int,input().split())\nh2,a2 = map(int,input().split())\nr = 0\ns = []\nwhile 1:\n r+=1\n if a1>=h2:\n s.append('STRIKE')\n break\n else:\n if h1>a2:\n s.append('STRIKE')\n h1 -=a2\n h2 -=a1\n else:\n s.append('HEAL')\n h1+=c1-a2\nprint(r)\nfor _ in range(r):\n print(s[_])", "#!/usr/bin/python3.6\n# -*- coding: utf-8 -*-\n# @Time : 2020/11/8 11:14 AM\n# @Author : Songtao Li\n\nif __name__ == \"__main__\":\n h1, a1, c1 = map(int, input().split())\n h2, a2 = map(int, input().split())\n res = []\n while True:\n if h2 <= a1 or h1 > a2:\n h2 -= a1\n res.append(\"STRIKE\")\n else:\n h1 += c1\n res.append(\"HEAL\")\n\n if h2 <= 0:\n break\n h1 -= a2\n print(len(res))\n for x in res:\n print(x)\n\t \t \t\t\t \t\t\t\t\t\t \t \t \t\t\t \t", "# LUOGU_RID: 111300671\nvova = input().split()\r\nmodcrab = input().split()\r\nvova = list(map(int, vova))\r\nmodcrab = list(map(int, modcrab))\r\nmove = []\r\nphase = 0\r\nwhile True:\r\n if vova[0] - modcrab[1] > 0 or modcrab[0] - vova[1] <= 0:\r\n phase += 1\r\n move.append('STRIKE')\r\n modcrab[0] -= vova[1]\r\n if modcrab[0] <= 0:\r\n break\r\n elif vova[0] - modcrab[1] <= 0:\r\n phase += 1\r\n move.append('HEAL')\r\n vova[0] += vova[2]\r\n vova[0] -= modcrab[1]\r\nprint(phase)\r\nfor item in move:\r\n print(item)", "import sys\r\n \r\nh1, a1, c1 = map(int, input().split())\r\nh2, a2 = map(int, input().split())\r\nans = []\r\n \r\nfor turn in range(1, 1000000):\r\n if h2 <= a1 or h1 > a2:\r\n ans.append('STRIKE')\r\n h2 -= a1\r\n else:\r\n ans.append('HEAL')\r\n h1 += c1\r\n \r\n if h2 <= 0:\r\n print(turn)\r\n print(*ans, sep='\\n')\r\n break\r\n \r\n h1 -= a2", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nh1, a1, c1 = [int(x) for x in input().split()]\r\nh2, a2 = [int(x) for x in input().split()]\r\n\r\nans = []\r\n\r\nwhile True:\r\n if h2 <= a1:\r\n ans.append(\"STRIKE\")\r\n break\r\n elif a2 >= h1:\r\n ans.append(\"HEAL\")\r\n h1 += c1\r\n else:\r\n ans.append(\"STRIKE\")\r\n h2 -= a1\r\n h1 -= a2\r\n\r\nprint(len(ans))\r\nfor v in ans:\r\n print(v)", "h1,a1,c1 = map(int,input().split())\nh2,a2 = map(int,input().split())\nr = []\nc = c1 - a2\nwhile h2 > 0:\n if a1 >=h2:\n h2 -= a1\n r.append(0)\n continue\n if h1 > a2:\n h1 -= a2\n h2 -= a1\n r.append(0)\n else:\n h1 += c\n r.append(1)\na = ['STRIKE','HEAL']\nprint(len(r))\nfor i in r:\n print(a[i])\n \t \t\t \t \t\t \t\t\t \t\t\t \t\t \t \t", "\r\n\r\n\r\ndef solve():\r\n h1, a1, c1 = [int(x) for x in input().split()]\r\n h2, a2 = [int(x) for x in input().split()]\r\n\r\n list = []\r\n while h2 > 0:\r\n if h2 - a1 <= 0:\r\n list.append(\"STRIKE\")\r\n h2 -= a1\r\n elif h1 - a2 <= 0:\r\n list.append(\"HEAL\")\r\n h1 += c1\r\n else:\r\n list.append(\"STRIKE\")\r\n h2 -= a1\r\n h1 -= a2\r\n print(len(list))\r\n print(*list, sep='\\n')\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "h1,a1,c1=map(int,input().split())\r\nh2,a2=map(int,input().split())\r\nres=[]\r\nwhile h2>0:\r\n if h1>a2 or h2<=a1:\r\n res.append(\"STRIKE\")\r\n h2-=a1\r\n h1-=a2\r\n else :\r\n res.append(\"HEAL\")\r\n h1+=c1\r\n h1-=a2\r\nprint(len(res))\r\nprint(*res,sep=\"\\n\")\r\n \r\n \r\n \r\n", "h1, a1, c1 = map(int, input().split())\nh2, a2 = map(int, input().split())\n\nans = []\nwhile True:\n if h2 <= a1:\n ans.append(\"STRIKE\")\n break\n if h1 <= a2:\n ans.append(\"HEAL\")\n h1 += c1\n h1 -= a2\n else:\n ans.append(\"STRIKE\")\n h2 -= a1\n h1 -= a2\n\nprint(len(ans))\nfor i in ans:\n print(\"\".join(i))\n\n \t \t \t \t \t\t\t\t \t\t\t \t\t\t \t \t", "huang = list(map(int,input().split(\" \")))\nmonster = list(map(int,input().split(\" \")))\ncount = 0\nres = []\nwhile monster[0]>0 :\n if huang[1]>=monster[0] :\n count += 1\n res.append(\"STRIKE\")\n break\n if huang[0]<=monster[1] :\n res.append(\"HEAL\")\n huang[0] = huang[0]+huang[2]-monster[1]\n else:\n res.append(\"STRIKE\")\n huang[0] -= monster[1]\n monster[0] -= huang[1]\n count +=1\nprint(count)\nfor r in res:\n print(r)\n \t\t \t\t \t\t \t\t\t \t\t \t\t \t\t \t\t", "import math\ndef Solve():\n h111,a111,c111=map(int,input().split())\n h222,a222=map(int,input().split())\n q111 = h111 % a222\n n = math.ceil(h222 / a111)\n count = 0\n while h111 / a222 <= n - 1:\n if h111 / a222 == n - 1 and q111 > 0 :\n break\n else:\n count += 1\n h111 += c111 - a222\n q111 = h111 % a222\n print(n+count)\n for i in range(0,count):\n print(\"HEAL\")\n for i in range(0,n):\n print(\"STRIKE\")\nif __name__ == '__main__':\n Solve()\n \t\t\t\t \t \t \t\t \t\t\t \t\t\t\t\t\t\t \t\t\t \t", "h1, a1, c1 = list(map(int, input().split()))\r\nh2, a2 = list(map(int, input().split()))\r\n\r\nans = []\r\nwhile 1:\r\n if h1 - a2 > 0 or h2 - a1 < 1:\r\n h2 = h2 - a1 # attacks\r\n h1 -= a2 # monster attacks back\r\n ans.append(1)\r\n if h2 < 1:\r\n break\r\n else:\r\n h1 = h1 + c1 - a2\r\n ans.append(0)\r\nprint(len(ans))\r\nfor i in ans:\r\n if i == 1:\r\n print(\"STRIKE\")\r\n else:\r\n print(\"HEAL\")\r\n", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\nh1, a1, c1 = map(int, input().split())\r\nh2, a2 = map(int, input().split())\r\nans = []\r\nwhile h2 > 0:\r\n if a1 >= h2:\r\n ans.append('STRIKE')\r\n break\r\n elif h1 <= a2:\r\n ans.append('HEAL')\r\n h1 += c1\r\n h1 -= a2\r\n else:\r\n ans.append('STRIKE')\r\n h1 -= a2\r\n h2 -= a1\r\nprint(len(ans), *ans, sep='\\n')\r\n", "h1, a1, c1 = map(int, input().split())\nh2, a2 = map(int, input().split())\nlis = []\nwhile h2 > 0:\n\tif h1 > a2 or a1 >= h2:\n\t\th2 -= a1\n\t\tlis.append('STRIKE')\n\telse:\n\t\th1 += c1\n\t\tlis.append('HEAL')\n\th1 -= a2\nprint(len(lis))\nprint('\\n'.join(lis))", "import math\n\nh1, a1, c1 = [int(i) for i in input().split()]\nh2, a2 = [int(i) for i in input().split()]\n\nstrikeV = math.ceil(h2 / a1)\nstrikeM = math.ceil(h1 / a2)\n\nif strikeV <= strikeM:\n print(strikeV)\n\n for i in range(strikeV):\n print('STRIKE')\n exit()\n\nreqd = a2 * (strikeV - 1) + 1 - h1\n\npotions = math.ceil(reqd / (c1 - a2))\n\nprint(strikeV + potions)\n\nfor i in range(potions):\n print('HEAL')\n\nfor i in range(strikeV):\n print('STRIKE')\n", "h1,a1,c1=list(map(int,input().split()))\r\nh2,a2=list(map(int,input().split()))\r\nl=[]\r\nc=0\r\nwhile h2>0:\r\n if a1>=h2:\r\n l.append(1)\r\n break\r\n else:\r\n if a2>=h1:\r\n l.append(0)\r\n h1+=c1\r\n else:\r\n h2-=a1\r\n l.append(1)\r\n h1-=a2\r\nprint(len(l))\r\nfor i in range(0,len(l)):\r\n if l[i]==1:\r\n print(\"STRIKE\")\r\n else:\r\n print(\"HEAL\")", "a,b,c=map(int,input().split())\r\na1,b1=map(int,input().split())\r\nx= (a1+b-1)//b\r\ny= max(0,((x-1)*b1-a)//(c-b1)+1)\r\nprint(x+y)\r\nprint(\"HEAL\\n\"*y+\"STRIKE\\n\"*x)", "\n\nfrom enum import Enum\n\n\nclass Action(Enum):\n STRIKE = \"STRIKE\"\n HEAL = \"HEAL\"\n\n\ndef get(l1, l2):\n h1 = l1[0]\n a1 = l1[1]\n c1 = l1[2]\n\n h2 = l2[0]\n a2 = l2[1]\n\n ret = []\n\n while h2 > 0:\n if h2 <= a1:\n ret.append(Action.STRIKE)\n return ret\n if h1 <= a2:\n h1 = h1 + c1 - a2\n ret.append(Action.HEAL)\n continue\n ret.append(Action.STRIKE)\n h1 = h1 - a2\n h2 = h2 - a1\n\n\nif __name__ == '__main__':\n l1 = input().split()\n l2 = input().split()\n l1 = [int(x) for x in l1]\n l2 = [int(x) for x in l2]\n ret = get(l1, l2)\n print(len(ret))\n for x in ret:\n print(x.value)\n\n\t \t \t\t\t\t\t \t \t\t \t \t \t \t\t \t", "h1, a1, c1 = map(int, input().strip().split())\nh2, a2 = map(int, input().strip().split())\nans = 0\nx = []\nwhile h2 > 0:\n if h1 > a2 or h2 <= a1: \n ans += 1\n h2 -= a1\n x.append('STRIKE')\n else:\n ans += 1\n h1 += c1\n x.append('HEAL')\n h1 -= a2\nprint(ans)\nfor i in x:\n print(i)\n", "h1,a1,c1=map(int,input().split())\r\nh2,a2=map(int,input().split())\r\nlis=[]\r\nwhile h2>0:\r\n\tif h1>a2 or a1>=h2:\r\n\t\th2-=a1\r\n\t\tlis.append('STRIKE')\r\n\telse:\r\n\t\th1+=c1\r\n\t\tlis.append('HEAL')\r\n\th1-=a2\r\nprint(len(lis))\r\nprint('\\n'.join(lis))", "R=lambda:map(int,input().split())\r\nh,a,c=R()\r\ng,b=R()\r\nk=(g+a-1)//a\r\nn=max(b*(k-1)-h,-1)//(c-b)+1\r\nprint(str(n+k)+'\\nHEAL'*n+'\\nSTRIKE'*k)\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,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nh1,a1,c1=map(int,input().split())\r\nh2,a2=map(int,input().split())\r\nc=0\r\np=[]\r\nwhile(h2>0):\r\n if h1>0 and h2-a1<=0:\r\n p.append(\"STRIKE\")\r\n h2-=a1\r\n elif h1-a2>0:\r\n p.append(\"STRIKE\")\r\n h2-=a1\r\n h1-=a2\r\n else:\r\n p.append(\"HEAL\")\r\n h1+=c1\r\n h1-=a2\r\n c+=1\r\nprint(c)\r\nfor i in p:\r\n print(i)\r\n ", "arr1=list(map(int,input().split()))\narr2=list(map(int,input().split()))\n\nh1=arr1[0]\na1=arr1[1]\nc1=arr1[2]\nh2=arr2[0]\na2=arr2[1]\ncount=0\nstr=\"\"\n\nwhile h2>0:\n count+=1\n if a1>=h2:\n str= str + \"STRIKE\\n\"\n # print(\"STRIKE\")\n break\n if a2>=h1:\n h1 = h1+c1-a2\n str= str + \"HEAL\\n\"\n # print(\"HEAL\")\n else:\n h2 = h2-a1\n h1 = h1-a2\n str= str + \"STRIKE\\n\"\n # print(\"STRIKE\")\nprint(count)\nprint(str)\n\n\t\t \t \t\t \t \t\t \t\t\t \t\t", "I = lambda: map(int, input().split())\r\n\r\nh1, a1, c1 = I()\r\nh2, a2 = I()\r\nmoves = []\r\n\r\nwhile h1 > 0 and h2 > 0:\r\n if a1 >= h2 or h1 > a2:\r\n moves.append('STRIKE')\r\n h2 -= a1\r\n h1 -= a2\r\n else:\r\n moves.append('HEAL')\r\n h1 += c1-a2\r\n\r\nprint(len(moves))\r\nprint(*moves, sep='\\n')", "h1,a1,c1 = map(int, input().split())\r\nh2,a2 = map(int, input().split())\r\ncount=1\r\na=[]\r\nwhile((h2)>0):\r\n if h2<=a1:\r\n a.append(\"STRIKE\")\r\n break\r\n else:\r\n if h1<=a2:\r\n a.append(\"HEAL\")\r\n h1=h1+c1-a2\r\n count=count+1\r\n elif h1>a2:\r\n a.append(\"STRIKE\")\r\n h2=h2-a1\r\n h1=h1-a2\r\n count=count+1\r\nprint(count)\r\nfor i in a:\r\n print(i)\r\n\r\n", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n h1, a1, c1 = map(int, input().split(' '))\n h2, a2 = map(int, input().split(' '))\n\n ans = []\n while h2 > 0:\n if h1 > a2 or a1 >= h2: # 怪物一次打不死我, 或我一次能打死怪物\n h2 -= a1\n ans.append(\"STRIKE\")\n else:\n h1 += c1\n ans.append(\"HEAL\")\n h1 -= a2\n \n print(len(ans))\n print('\\n'.join(ans))\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n \t\t \t \t\t \t\t \t\t \t \t \t \t\t \t\t\t\t", "h1,a1,c1 = map(int,input().split())\r\nh2,a2 = map(int,input().split())\r\nl = []\r\nwhile(h2 > 0):\r\n if h1-a2 <= 0 and (h2-a1) > 0:\r\n l.append(\"HEAL\")\r\n h1 = h1+c1\r\n\r\n else:\r\n l.append(\"STRIKE\")\r\n h2 = h2-a1\r\n\r\n h1 = h1-a2\r\n\r\n\r\nprint(len(l))\r\nfor i in l:\r\n print(i)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nh1, a1, c1 = map(int, input().split())\r\nh2, a2 = map(int, input().split())\r\nans = []\r\nwhile h2 > 0:\r\n if h1 <= a2 and h2 > a1:\r\n h1 += c1\r\n ans.append(\"HEAL\")\r\n else:\r\n h2 -= a1\r\n ans.append(\"STRIKE\")\r\n h1 -= a2\r\nn = len(ans)\r\nprint(n)\r\nprint(\"\\n\".join(ans))", "Sweet=lambda:map(int,input().split())\nh,a,c=Sweet()\ng,b=Sweet()\nk=(g+a-1)//a\nn=max(b*(k-1)-h,-1)//(c-b)+1\nprint(str(n+k)+'\\nHEAL'*n+'\\nSTRIKE'*k)\n\n\t\t \t\t\t\t \t \t \t \t \t \t", "h1, a1, c1 = map(int, input().split())\r\nh2, a2 = map(int, input().split())\r\nans = 0\r\ns = []\r\nwhile h2 > 0:\r\n if h2 - a1 <= 0:\r\n s.append(\"STRIKE\")\r\n h2 -= a1\r\n else:\r\n if h1 > a2:\r\n s.append(\"STRIKE\")\r\n # print(h1)\r\n h2 -= a1\r\n else:\r\n s.append(\"HEAL\")\r\n h1 += c1\r\n if h2>0:\r\n h1 -= a2\r\n ans += 1\r\nprint(ans)\r\nprint(*s, sep=\"\\n\")\r\n" ]

[ "# coding: utf-8\r\n# 849A - Odds and Ends (http://codeforces.com/contest/849/problem/A)\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif n % 2 and arr[0] % 2 and arr[-1] % 2: print(\"Yes\")\r\nelse: print(\"No\")", "n = int(input())\r\narr = list(map(int,input().split()))\r\nif n%2!=0 and arr[0]%2!=0 and arr[-1]%2!=0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\na = list(map(int, input().split()))\nif a[0] % 2 == 0 or a[-1] % 2 == 0:\n print(\"No\")\n exit()\n\ni, count = 0, 0\nwhile i < len(a):\n if a[i] % 2:\n count += 1\n else:\n countEven, j = 1, i + 1\n while j < len(a) and a[j] % 2 == 0:\n countEven += 1\n j += 1\n i = j\n if countEven % 2 == 0:\n count += 1\n i += 1\nprint(\"Yes\") if count % 2 else print(\"No\")\n", "nVals = int(input())\n\nvals = [int(x) for x in input().split()]\n\nif len(vals) % 2 == 0:\n print(\"NO\")\n\nelse:\n if vals[0] % 2 == 1 and vals[-1] % 2 == 1:\n print(\"Yes\")\n else:\n print(\"NO\")\n\t\t\t\t\t \t \t \t\t\t \t \t\t \t\t\t \t\t\t \t\t", "n=int(input())\r\na=[*map(int,input().split())]\r\nprint('YES' if n&a[0]&a[-1]&1 else 'NO')\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nif n % 2 != 0 and p[0] % 2 != 0 and p[-1] % 2 != 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n%2!=0 and a[0]%2!=0 and a[n-1]%2!=0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "def can_divide(nums):\r\n n = len(nums)\r\n indexs = []\r\n for i in range(n):\r\n if nums[i] % 2 == 1:\r\n indexs.append(i) \r\n if len(indexs) == 0 or indexs[0] != 0 or indexs[len(indexs) - 1] != n - 1:\r\n return False\r\n \r\n if n % 2 == 0:\r\n return False\r\n else:\r\n return True\r\n \r\n \r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n if can_divide(a):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "l = int(input())\r\na = list(map(int,input().split()))\r\nif l%2 and a[0]%2 and a[-1]%2:\r\n print('Yes')\r\nelse:\r\n print('No') ", "n=int(input())\r\nx=[*map(int,input().split())]\r\nif n%2 and x[0]%2 and x[-1]%2:\r\n print('Yes')\r\nelse:\r\n print('No')", "#sple\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nprint(\"YES\") if n % 2 == 1 and a[0] % 2 == a[-1] % 2 == 1 else print(\"NO\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nif n%2+a[0]%2+a[n-1]%2==3:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/python3\r\n\r\n\r\ndef main():\r\n i = int(input())\r\n data = [int(d) for d in input().split()]\r\n\r\n if(data[0]%2 + data[-1]%2 + i%2 < 3):\r\n print(\"No\");\r\n else:\r\n print(\"Yes\");\r\n\r\n\r\nif __name__ == \"__main__\": main()\r\n", "# import sys\n# sys.stdin = open('in', 'r')\n\nn = int(input())\nlst = list(map(int, input().split()))\n\nif n % 2 == 1 and lst[0] % 2 == 1 and lst[-1] % 2 == 1:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "import sys\r\nn=int(input())\r\nnum=list(map(int,input().split()))\r\nif n&1 and num[0]&1 and num[n-1]&1:\r\n print(\"Yes\")\r\nelse:\r\n print (\"No\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(['No', 'Yes'][n % 2 == 1 and a[0] % 2 == 1 and a[-1] % 2 == 1])", "n = int(input())\na = [int(i) for i in input().split()]\nif n % 2 == 0 or a[0] % 2 == 0 or a[-1] % 2 == 0:\n print('No')\nelse:\n print('Yes')", "n=int(input())\nip=list(map(int,input().split()))\nif n%2==1:\n if ip[0]%2==1 and ip[-1]%2==1:\n print('Yes')\n else:\n print('No')\nelse:\n print('No')\n", "n = int(input())\r\nlist1 = list(map(int, input().split()))\r\nif list1[0] % 2 == 0 or list1[-1] % 2 == 0 or n % 2 == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nline=input().split(' ')\r\na=[int(i)%2 for i in line]\r\nif n%2==0:\r\n print('No')\r\nelse:\r\n if a[0]*a[-1]!=1:\r\n print('No')\r\n else:\r\n print('Yes')\r\n", "def re():\r\n return list(map(int, input().split()))\r\nn = int(input())\r\na = re()\r\nprint(\"Yes\" if a[0]&1 and a[-1]&1 and len(a)&1 else \"No\")\r\n", "n = int(input())\nl = list(map(int,input().split()))\n\nif n%2!=0 and l[0]%2!=0 and l[n-1]%2!=0:\n\tprint(\"YES\")\nelif l[0]%2==0 or l[n-1]%2==0:\n\tprint(\"NO\")\nelif n%2==0:\n\tprint(\"NO\")\n\n\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nif a[0]%2==1 and a[-1]%2==1 and n%2==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nif (n%2 and m[0]%2 and m[-1]%2):\r\n print('Yes')\r\nelse:\r\n print('No')", "n=int(input())\r\nsrc=input()\r\na=list(map(int,src.split()))\r\n\r\nif a[0]%2==0 or a[n-1]%2==0 or n%2==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "input()\r\na = input().split()\r\nif len(a) % 2 == 0:\r\n print(\"No\")\r\n quit()\r\nif not(int(a[0]) % 2 == 0 or int(a[-1]) % 2 == 0):\r\n print(\"Yes\")\r\n quit()\r\nprint(\"No\")", "from math import *\r\ndef chop():\r\n return (int(i) for i in input().split())\r\nn=int(input())\r\nf=False\r\na=[int(i) for i in input().split()]\r\nif (len(a)%2==0) or (a[0]%2==0) or (a[-1]%2==0):\r\n f=True\r\nprint('Yes' if not(f) else 'No')", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nf = 1\r\nif n%2==0 or (a[0]%2!=1 or a[n-1]%2!=1):\r\n\tf = 0\r\n\r\nif f:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "def odd_and_adds(lst, n):\r\n if lst[0] % 2 == 1 and lst[n - 1] % 2 == 1 and n % 2 == 1:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nm = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(odd_and_adds(a, m))\r\n", "#odd number of segments\r\n#odd number of lengths of those segments\r\n#begins and ends with odd numbers\r\nn=int(input())\r\na=[]\r\na=list(map(int,input().split()))\r\nif a[0]%2==0 or a[-1]%2==0:\r\n print(\"NO\")\r\nelse:\r\n count1=0\r\n count2=0\r\n for i in range(0,n):\r\n count1+=1\r\n if a[i]%2==1 and count1%2==1:\r\n count2+=1\r\n count1=0\r\n #count1+=1\r\n if count2%2==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n= int(input())\r\na= list(map(int,input().split()))\r\nif(a[0]%2 and a[-1]%2 and n%2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\n\r\n\r\ndef odd(k):\r\n return k % 2 == 1\r\n\r\n\r\nprint('Yes' if odd(a[0]) and odd(a[-1]) and odd(n) else 'No')\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint('YNeos'[not(n&a[0]&a[-1]&1)::2])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif l[0]%2==0 or l[-1]%2==0 or n%2==0 :\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\narray = input().split()\n\nif(n%2==1 and int(array[0])%2==1 and int(array[n-1])%2==1):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n=int(input())\r\na=*map(int,input().split()),\r\nprint('NYOE S'[(a[0]%2)*(a[-1]%2)*(n%2)::2])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 24 19:47:53 2018\r\n\r\n@author: brian\r\n\"\"\"\r\n\r\na=int(input())\r\nb=list(map(int,input().split(\" \")))\r\nans=\"Yes\" if a%2 and b[0]%2 and b[-1]%2 else \"No\"\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\ndone=0\r\nif n%2==0 or l[0]%2==0:done=1\r\nelse:\r\n for j in range(n):\r\n if j%2==0 and l[j]%2==0:\r\n done=1\r\n else:\r\n done=0\r\n\r\nif done==1:\r\n print(\"No\")\r\nelse: \r\n print(\"Yes\") \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \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())\nm=list(map(int,input().split()))\nif (m[0]&1) and (m[n-1]&1 and n&1):\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n", "if __name__ == \"__main__\": \r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n if arr[0]%2 and arr[-1]%2 and n%2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = int(input())\r\nn = list(map(int, input().split()))\r\nif a % 2 == 1 and n[0] % 2 == 1 and n[len(n)-1] % 2 == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(\"Yes\" if n % 2 == 1 and a[0] % 2 == a[-1] % 2 == 1 else \"No\")", "n = input()\r\nar = list(map(int, input().split()))\r\nprint(\"Yes\" if len(ar) % 2 == 1 and ar[0] % 2 == 1 and ar[-1] % 2 == 1 else \"No\")", "n = int(input())\r\nA = list(map(int,input().split()))\r\n \r\nprint('Yes' if A[0]%2 and A[-1]%2 and n%2 else 'No')", "n=int(input())\r\nl=list(map(int, input().split()))\r\nk=-1\r\nif l[0]%2==0 or l[-1]%2==0: k=0\r\nelif n%2==1: k=1\r\nelse: k=0\r\nprint(\"YES\" if k==1 else \"NO\")", "n = int(input())\r\nn_list = list(map(int, input().split()))\r\nfirst = n_list[0]\r\nlast = n_list[-1]\r\nif n % 2 != 0:\r\n if first % 2 != 0 and last % 2 != 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint('YES' if n&a[0]&a[-1]&1 else 'NO')\r\n", "n=int(input())\na=[i for i in map(int,input().split())]\n\nif (a[0]%2 + a[n-1]%2+ n%2==3):\n print('Yes')\nelse:\n print('No')\n", "n = int(input())\r\na = list((map(int, input().split())))\r\n\r\n\r\ndef f():\r\n if n % 2 == 0:\r\n return \"NO\"\r\n elif a[0] % 2 == 0 or a[-1] % 2 == 0:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\nprint(f())\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nif(len(a)%2 and a[0]%2 and a[-1]%2):print('Yes')\r\nelse:print('No')", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nif(n%2==0 or arr[0]%2==0 or arr[n-1]%2==0):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "a=int(input());b=list(map(int,input().split()));print(\"NYoe s\"[a&1==b[0]&1==b[-1]&1==1::2])", "#from dust i have come dust i will be\n\nimport sys\n\nn=int(input())\na=list(map(int,input().split()))\n\nif len(a)%2==1 and a[0]%2==1 and a[n-1]%2==1:\n print(\"Yes\")\n\nelse:\n print(\"No\")\n\n\n \t\t\t\t \t \t \t\t\t\t\t\t\t\t\t \t \t", "n=int(input())\r\nl=[]\r\ni=input()\r\nl=i.split()\r\nc=0\r\nif len(l)%2!=0:\r\n if int(l[0])%2!=0 and int(l[len(l)-1])%2!=0:\r\n print(\"Yes\")\r\n else:\r\n print('No')\r\nelse:\r\n print('No')\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nchet = 0\r\nnechet = 0\r\n\r\nif a[0] % 2 == 0 or a[n - 1] % 2 == 0:\r\n print(\"NO\");\r\n exit()\r\n\r\nfor el in a:\r\n if el % 2 == 0:\r\n chet += 1\r\n else:\r\n nechet += 1\r\n\r\nif (chet + (nechet - chet * 2)) % 2 == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\n# !/usr/bin/python3\n\n\"\"\"\n@author: myz\n@file: main.py\n@time: 17-9-9 下午2:36\n\"\"\"\nn = int(input())\na = list(map(lambda x: int(x) % 2, input().strip().split(' ')))\n\nif n & 1 == 1 and a[0] == 1 and a[-1] == 1:\n\tprint(\"yes\")\nelse:\n\tprint(\"no\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nif a[0] % 2 == 0 or a[-1] % 2 == 0:\r\n print('No')\r\nelse:\r\n if n % 2 == 1:\r\n print('Yes')\r\n else:\r\n print('No')", "#NYAN NYAN\r\n#░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n#░░░░░░░░░░▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄░░░░░░░░░\r\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 os\r\nimport sys\r\nimport fileinput\r\nimport codecs\r\nimport operator\r\nimport functools\r\ninval = None\r\nfile = None\r\nDebug = True\r\n\r\ndef readSequence(inputLine=None, elementType=int, seperator=' ', strip=True):\r\n global file\r\n if (inputLine == None):\r\n inputLine = file.readline()\r\n if strip:\r\n inputLine = inputLine.strip()\r\n return [elementType(x) for x in inputLine.split(seperator)]\r\n\r\ndef C(n, r):\r\n r = min(r, (n - r))\r\n if (r == 0):\r\n return 1\r\n if (r < 0):\r\n return 0\r\n numer = functools.reduce(operator.mul, range(n, (n - r), (- 1)))\r\n denom = functools.reduce(operator.mul, range(1, (r + 1)))\r\n return (numer // denom)\r\n\r\ndef sumdigit(num):\r\n num = str(num)\r\n r = 0\r\n for x in num:\r\n r = (r + int(x))\r\n pass\r\n return r\r\n\r\ndef digitListToInt(numList):\r\n return int(''.join(map(str, numList)))\r\n\r\ndef listByDigit(digitLen):\r\n return [0 for _ in range(digitLen)]\r\n\r\ndef F(n, k):\r\n ans = 0\r\n for x in range(1, n):\r\n ans = (ans + (x * C((n - x), (k - 1))))\r\n pass\r\n return ans\r\n pass\r\n\r\ndef keyWithMaxValue(d1: dict):\r\n v = list(d1.values())\r\n return list(d1.keys())[v.index(max(v))]\r\n\r\ndef getNext():\r\n pass\r\n\r\ndef solve():\r\n global file\r\n rl = file.readline\r\n rs = RobertsSpaceIndustries = readSequence\r\n li = rs()\r\n n = li[0]\r\n li = rs()\r\n arr = li\r\n if (((arr[0] % 2) == 0) or ((arr[(n - 1)] % 2) == 0) or ((n % 2) == 0)):\r\n print('No')\r\n else:\r\n print('yes')\r\n pass\r\ninval = None\r\nfile = fileinput.input(inval)\r\nsolve()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\n#x = [x for x in l for y in range(2,n//2) if x%y==0 continue]\r\nif l[0]%2==1 and l[n-1]%2==1 and len(l)%2==1:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "from sys import stdin\r\n\r\nn = int(stdin.readline().rstrip())\r\ndata = list(map(int, stdin.readline().rstrip().split()))\r\n\r\nif n % 2 == 0:\r\n print('NO')\r\n exit()\r\nif data[0] % 2 == 0 or data[-1] % 2 == 0:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nif len(a) % 2 == 0:\r\n #if a[0] % 2 == 0 or a[-1] % 2 == 0:\r\n print('no')\r\n\r\n\r\n\r\nelif len(a) % 2 == 1:\r\n if a[0] % 2 == 1 and a[-1] % 2 == 1:\r\n print('yes')\r\n else:\r\n print('no')\r\n\r\n\r\n", "n=int(input().strip())\nl=[int(i) for i in input().split()]\nif(n%2==0):\n\tprint(\"NO\")\nelif(l[0]&1 == 0 or l[-1]&1==0):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\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\nif n%2==1 and arr[0]%2==1 and arr[n-1]%2==1:\r\n print(\"Yes\")\r\nelse: print(\"No\")", "n=int(input())\r\ns=list(map(int,input().split()))\r\nprint('Yes' if s[0]%2and s[-1]%2and n%2else'No')", "n = int(input())\r\na = input().split()\r\nif(int(a[0]) % 2 == 1 and int(a[-1]) % 2 == 1 and len(a) % 2 == 1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nprint('YES' if n & a[0] & a[-1] & 1 else 'NO')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport array\nfrom bisect import *\nfrom collections import *\nimport fractions\nimport heapq \nfrom itertools import *\nimport math\nimport re\nimport string\n\nN = int(input())\nAs = list(map(int, input().split()))\n\nif (len(As) % 2) and (As[0] % 2) and (As[-1] % 2):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "N, X = int(input()), list(map(int, input().split()))\r\nprint(\"YES\" if N % 2 + X[0] % 2 + X[-1] % 2 == 3 else \"NO\")\r\n\r\n# Caption: God bless you General Soleimani\r\n\r\n# ---------Hard Revenge---------\r\n# ***Happened what we promised ****\r\n\r\n# ****** Rest in Peace ******\r\n", "n = int(input())\narr = list(map(int, input().split(' ')))\nif len(arr) % 2 and arr[0] % 2 and arr[-1]%2:\n print(\"YES\")\nelse:\n print(\"NO\")", "input()\nseq = [int(i) for i in input().split()]\nprint( 'No' if len(seq) % 2 == 0 or seq[0] % 2 == 0 or seq[-1] % 2 == 0 else 'Yes' )", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(a[0]&1 and a[n-1]&1 and n&1):\r\n print(\"Yes\")\r\n \r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nprint(('NO','YES')[A[0]*A[-1]*n%2])", "#RAVENS\r\n#TEAM_2\r\n#ESSI-DAYI_MOHSEN-LORENZO\r\n\r\nn=int(input())\r\nseq=list(map(int,input().split()))\r\nif(n%2!=0 and seq[0]%2!=0 and seq[n-1]%2!=0):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif (n%2!=0 and l[0]%2!=0 and l[-1]%2!=0):\r\n print ('Yes')\r\nelse:\r\n print ('No')", "n = int(input())\nk = list(map(int, input().split()))\nif n % 2 == 0:\n print('No')\nelif k[0] % 2 ==0 or k[-1] % 2 == 0:\n print ('No')\nelse:\n print('Yes')\n", "N = int(input().strip())\r\nA = list(map(int, input().strip().split()))\r\n\r\nN = len(A)\r\nif N % 2 and A[0] % 2 and A[-1] % 2:\r\n print('Yes')\r\nelse:\r\n print('No')", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\n\r\ninput()\r\nj = 0\r\nl = list(map(int, input().split()))\r\nif l[0] % 2 == 0 or l[len(l) - 1] % 2 == 0:\r\n print('No')\r\nelse:\r\n for i in range(len(l)):\r\n if(l[i] % 2 == 1):\r\n if (i - j) % 2 == 0:\r\n j = i\r\n print('Yes' if j == len(l) - 1 else 'No')\r\n", "def read_ints():\r\n\treturn [int(i) for i in input().split()]\r\n\r\nn = read_ints()\r\na = read_ints()\r\nif len(a) % 2 and a[0] % 2 and a[-1] % 2:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "n = int(input())\r\ns = list(map(int, input().strip().split(\" \")))\r\nif n%2 == 0:\r\n print(\"No\")\r\nelif s[0]%2==0 or s[n-1]%2==0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nif arr[0]%2!=1 or arr[n-1]%2!=1:\r\n\tprint(\"No\")\r\nelif n%2==1:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "from sys import stdin\n\nn = int(input())\na = []\n\na = input().split()\na = [int(x) for x in a]\n\nif n%2 and a[0]%2 and a[-1]%2:\n print('Yes')\nelse:\n print('No')\n\n", "n = int(input())\narr = list(map(int,input().split()))\nif(n%2 == 0):\n\tprint('No')\nelse:\n\tif(arr[0] % 2 == 1 and arr[-1] % 2 == 1):\n\t\tprint('Yes')\n\telse:\n\t\tprint('No')", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n a = Y()\r\n\r\n f = 0 if not (n % 2 and a[0] % 2 and a[n - 1] % 2) else 1\r\n print(\"YNEOS\"[not f::2])", "n=int(input())\r\np=list(map(int,input().split()))\r\nif p[0]%2==0 or p[-1]%2==0 or n%2==0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nif n%2==0 or l[0]%2==0 or l[-1]%2==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "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\nnum = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif num%2 and arr[0]%2 and arr[-1]%2 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nprint(\"YES\") if n&1 and a[0]&1 and a[-1]&1 else print(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif n % 2 == 0 or a[0] % 2 == 0 or a[n - 1] % 2 == 0: print('No', end = '')\r\nelse: print('Yes', end = '')", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nif len(l) % 2 == 1 and l[0] % 2 == 1 and l[-1] % 2 == 1:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n\r\n", "n = int(input())\r\na =list(map(int, input().split()))\r\nif len(a) %2 == 1 and a[0]%2 == 1 and a[n-1] %2 == 1:\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")\r\n", "import sys\n\n\n#=========MAIN==========\nnumber = int(input())\ninput2 = [int(x) for x in input().split()]\n\nif (number%2 == 0 or input2[0]%2==0 or input2[-1]%2==0):\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nif n%2!=0 and lis[0]%2!=0 and lis[-1]%2!=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n n = int(input())\r\n nums = list(map(int, input().split()))\r\n if len(nums) % 2 == 0:\r\n print(\"No\")\r\n elif nums[0] % 2 == 0 or nums[-1] % 2 == 0:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nif A[0] % 2 == 0 or A[-1] % 2 == 0 or len(A) % 2 == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n\r\n", "n = int(input())\nseq = [int(i) for i in input().split()]\nlasts = []\nq = 0\ncnt = 0\nif n % 2 == 0 or seq[0] % 2 == 0 or seq[n - 1] % 2 == 0:\n print(\"No\")\nelse:\n for i in range(n):\n el = seq[i]\n if i < n - 1:\n if el % 2 == 1 and i % 2 == q and seq[i + 1] % 2 == 1:\n cnt += 1\n q = (q + 1) % 2\n else:\n if i % 2 == q:\n cnt += 1\n if cnt % 2 == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n \n \n", "def main():\n N = int(input())\n A = tuple(map(int, input().split()))\n\n if not len(A) % 2 or not A[0] % 2 or not A[-1] % 2:\n ans = 'No'\n else:\n ans = 'Yes'\n\n print(ans)\n\nmain()\n", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\nif n%2==0:\r\n print(\"No\")\r\nelif list[0]%2==0 or list[-1]%2==0:\r\n print(\"No\")\r\nelif n%2==1 and list[0]%2==1 and list[-1]%2==1:\r\n print(\"Yes\")\r\n", "n = int(input())\na = list(map(int,input().split()))\n\nif len(a)%2==1 and a[0]%2==1 and a[n-1]%2==1:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n, a = int(input()), [int(i) for i in input().split()]\nres = \"NO\" if n & 1 == 0 or a[0] & 1 == 0 or a[-1] & 1 == 0 else \"YES\"\nprint(res)\n", "n=int(input())\nl=list(map(int,input().split()))\n\nif (l[0]&1==0) or (l[n-1]&1==0):\n\tprint(\"No\")\nelif (l[0]&1) and (l[n-1]&1):\n\tif n&1:\n\t\tprint(\"Yes\")\n\telse:\n\t\tprint(\"No\")", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nn = int(input())\r\nA = list(map(int,input().split()))\r\n\r\nprint('Yes' if A[0]%2 and A[-1]%2 and n%2 else 'No')", "values_nr = int(input())\r\nidx___value = [int(x) for x in input().split()]\r\n\r\nif (len(idx___value) % 2 != 0) and (idx___value[0] % 2 != 0) and (idx___value[-1] % 2 != 0):\r\n print('Yes')\r\nelse:\r\n print('No')", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nflag = False\r\n\r\ni = 0\r\nc = 0\r\n\r\nwhile i < n:\r\n if not a[i] % 2:\r\n print('No')\r\n break\r\n\r\n j = i\r\n\r\n last = -1\r\n\r\n while j < n:\r\n if a[j] % 2 and (i - j + 1) % 2:\r\n last = j\r\n\r\n j += 1\r\n\r\n if last == -1:\r\n print('No')\r\n break\r\n\r\n i = last + 1\r\n\r\n c += 1\r\n\r\nelse:\r\n if c % 2:\r\n print('Yes')\r\n else:\r\n print('No')", "n=int(input())\r\ns=list(map(int,input().split()))\r\nbool=True\r\nif n%2!=0 and s[0]%2!=0 and s[-1]%2!=0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(n==1):\r\n if(a[0]%2!=0):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n if(n%2!=0):\r\n if(a[0]%2!=0 and a[-1]%2!=0):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n else:\r\n print(\"No\")\r\n", "N = int( input() )\r\nA = []\r\nA = input().split()\r\nfor i in range( N ):\r\n A[i] = int( A[i] )\r\nif A[0] % 2 == 1 and A[N - 1] % 2 == 1 and N % 2 != 0:\r\n print( \"YES\" )\r\nelse:\r\n print( \"NO\" )", "n = int(input())\r\na = list(map(int,input().split()))\r\nprint(\"Yes\" if a[0]%2 == a[n-1]%2 == n%2==1 else \"No\")", "n=int(input())\r\nseq=list(map(int,input().split( )))\r\nif seq[0]%2==0 or seq[-1]%2==0:\r\n print(\"No\")\r\nelse:\r\n if n%2==1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(len(a)%2==0):\r\n print('No')\r\nelse:\r\n if(a[0]&1 and a[-1]&1):\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nif(n % 2 and arr[n - 1] % 2 and arr[0] % 2):\r\n print(\"Yes\")\r\nelse :print(\"No\")", "# coding: utf-8\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n if n % 2 == 1 and a[0] % 2 == 1 and a[-1] % 2 == 1:\r\n return \"Yes\"\r\n return \"No\"\r\n\r\nprint(main())\r\n", "arr_len = int(input())\r\narr = list(map(int, input().split()))\r\nif arr_len & arr[0] & arr[-1] & 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nif n % 2 == 1 and data[0] % 2 == 1 and data[-1] % 2 == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n%2!=0 and a[0]%2!=0 and a[-1]%2!=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\narr = list(map(int,input().split()))\n\nif arr[0]*arr[-1] % 2 == 0:\n\tprint(\"No\")\n\texit()\n\nif n%2:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n\n'''c=0\ni=0\nwhile i<n-1:\n\tif arr[i]*arr[i+1]%2:\n\t\ti-=1\n\t\tc+=1\n\ti+=2\n\t\t\t\nif c>=2:\n\tprint(c)\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")'''\n\t\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndp = [[0]*(n+1) for i in range(n+1)]\r\ndp[0][0] = 1\r\nfor k in range(1, n+1):\r\n for i in range(1, n+1):\r\n for j in range(0, i):\r\n if (i-j)%2 == 1 and a[j]%2 == 1 and a[i-1]%2 == 1 and dp[k-1][j] == 1:\r\n dp[k][i] = 1\r\nfor k in range(1, n+1):\r\n if k%2 == 1 and dp[k][n] == 1:\r\n print('yes')\r\n exit(0)\r\nprint('no')\r\n", "L = int(input())\r\nA = []\r\nD = input()\r\nD = D.split()\r\nfor i in range (L):\r\n A.append(int(D[i]))\r\n\r\n\r\n\r\ndef InicioYFinImpares(A):\r\n b = False\r\n a = False\r\n for i in range (len(A)):\r\n if i == 0 and A[0]%2 != 0:\r\n b = True\r\n if i == len(A) -1 and A[len(A) -1]%2 != 0:\r\n a = True\r\n return a and b\r\n\r\n\r\n\r\nif InicioYFinImpares(A) and L%2 != 0:\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")\r\n", "\r\nwhile True:\r\n try:\r\n n = int(input())\r\n array = input().split()\r\n array = [int(ch) for ch in array]\r\n if len(array) != n:\r\n ValueError\r\n break\r\n except ValueError:\r\n pass\r\n\r\n\r\nif n % 2 == 0:\r\n print(\"No\")\r\nelif array[0] % 2 == 0 or array[n - 1] % 2 == 0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n=int(input())\r\ndata = list(map(int,input().split()))\r\nprint('Yes' if data[0]%2==1 and data[-1]%2==1 and len(data)%2==1 else 'No') \r\n", "n = int(input())\r\narr = input().split(\" \")\r\nif n % 2 == 0:\r\n print(\"No\")\r\nelse:\r\n if int(arr[0]) % 2 == 1 and int(arr[n - 1]) % 2 == 1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n", "def oddsEnds(sequence, n):\r\n if sequence[0]%2==0 or sequence[n-1]%2==0 or n%2==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nn = int(input())\r\nsequence = [int(x) for x in input().split()]\r\noddsEnds(sequence, n)", "n=int(input())\r\nif n%2==0:\r\n print('NO')\r\nelse:\r\n a=list(map(int,input().split()))\r\n if a[0]%2 and a[n-1]%2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nprint('Yes' if a[0] % 2 == 1 and a[-1] % 2 == 1 and n % 2 == 1 else 'No') ", "n, l = int(input()), [int(x) for x in input().split()]\nprint('YES' if n % 2 == 1 and l[0] * l[-1] % 2 == 1 else 'NO')\n\n", "length = int(input())\r\nnumbers = [int(a) for a in input().strip().split()]\r\n\r\nif length % 2 == 0:\r\n print(\"No\")\r\nelse:\r\n if numbers[0] % 2 == 0 or numbers[-1] % 2 == 0:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n", "int(input())\r\na=list(map(int,input().split()))\r\nif a[0]%2==0 or a[-1]%2==0 or len(a)%2==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif a[0] % 2 == 0 or a[-1] % 2 == 0:\r\n print(\"NO\")\r\nelif n % 2 == 1:\r\n print(\"YES\")\r\nelse:\r\n l = []\r\n for i in range(n):\r\n if a[i] % 2 == 0:\r\n l.append(i)\r\n\r\n i = 0\r\n p = []\r\n while i < len(l):\r\n t = []\r\n k = l[i]\r\n while i < len(l) and l[i] - k <= 2:\r\n t.append(l[i])\r\n k = l[i]\r\n i += 1\r\n if len(t) > 0:\r\n v = [t[0] - 1, t[-1] + 1]\r\n p.append(v)\r\n\r\n q = 0\r\n i = 0\r\n arr = []\r\n while i < n:\r\n if q < len(p) and p[q][0] == i:\r\n arr.append(a[p[q][0]:p[q][1] + 1])\r\n i += len(a[p[q][0]:p[q][1] + 1])\r\n q += 1\r\n else:\r\n arr.append([a[i]])\r\n i += 1\r\n\r\n #print(arr)\r\n y = True\r\n i = 0\r\n while i < len(arr):\r\n if len(arr[i]) % 2 == 0:\r\n if i - 1 >= 0:\r\n arr[i - 1:i + 1] = [arr[i - 1] + arr[i]]\r\n i -= 1\r\n elif i + 1 < len(arr) and len(arr[i + 1]) % 2 > 0:\r\n arr[i:i + 2] = [arr[i] + arr[i + 1]]\r\n else:\r\n y = False\r\n break\r\n i += 1\r\n\r\n #print(arr)\r\n if len(arr) % 2 == 0:\r\n y = False\r\n\r\n if y:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n#10\r\n#1 0 0 0 1 5 2 2 5 5\r\n\r\n#12\r\n#1 0 0 4 5 6 7 7 2 2 7 9\r\n\r\n#12\r\n#1 0 0 4 5 6 9 7 7 2 2 7", "n = int(input())\r\nseq = list(map(int,input().split()))\r\nif n % 2 == 0:\r\n print('No')\r\nelif seq[0] % 2 == 0 or seq[-1] % 2 == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "n, a = int(input()), list(map(int, input().split()))\r\nprint(('No', 'Yes')[n % 2 == 1 and (a[0] * a[-1]) % 2 == 1])\r\n", "n = int(input())\nif(n%2 == 0):\n\tprint(\"NO\")\n\texit()\narr = [int(x) for x in input().split()]\nif(arr[0] % 2 == 0 or arr[-1] % 2 == 0):\n\tprint(\"NO\")\n\texit()\nprint(\"YES\")", "n=int(input())\r\na=list(map(int, input().split()))\r\nprint('Yes' if len(a)%2==1 and a[0]%2==1 and a[n-1]%2==1 else 'No')", "n = int(input())\r\na = list(map(int,input().split()))\r\nif n % 2 == 0 or a[0] % 2 == 0 or a[-1] % 2 == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def solve():\r\n length = int(input())\r\n seq = input().split(\" \")\r\n\r\n if int(seq[0])%2 == 0 or int(seq[length-1])%2 == 0 or length%2 == 0:\r\n return False\r\n \r\n return True\r\n\r\nif solve():\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif (n % 2 == 1 and a[0] % 2 == 1 and a[n-1] % 2 == 1):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "n=int(input())\r\nL=list(map(int,input().split()))\r\nif n%2==0:\r\n print('No')\r\nelse :\r\n if L[0]%2==1 and L[len(L)-1]%2==1:\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "input();arr = list(map(int, input().split()))\r\nprint(['Yes','No'][arr[0]%2==0 or arr[len(arr)-1]%2==0 or len(arr)%2==0])", "n = int(input())\r\nl=list([int(x) for x in input().split()])\r\ncount=0\r\nif(n%2!=0 and l[0]%2!=0 and l[n-1]%2!=0):\r\n \r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\nnumbers = list(map(int, input().split(' ')))\r\n\r\nif numbers[0] % 2 > 0 and numbers[-1] % 2 > 0 and len(numbers) % 2 > 0:\r\n print('Yes')\r\n\r\nelse:\r\n print('No')\r\n ", "_ = input()\r\nnums = [int(i) for i in input().split(' ')]\r\n\r\nif nums[0] % 2 == 0 or nums[-1] % 2 == 0 or len(nums) % 2 == 0:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n", "n=int(input().strip())\r\nl=list(map(int,input().strip().split()))\r\ndef check(n,l):\r\n if n%2==0:\r\n return \"No\"\r\n elif l[0]%2==0 or l[-1]%2==0:\r\n return \"No\"\r\n else:\r\n return \"Yes\"\r\nprint(check(n,l))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nif(n%2==0):\r\n print('No')\r\nelse:\r\n if(a[0]%2!=0 and a[len(a)-1]%2!=0):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n%2==1 and l[0]%2==1 and l[n-1]%2==1:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nif n%2 != 0 and (arr[0]%2!=0 and arr[n-1]%2!=0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nx=[int(q) for q in input().split()]\r\n\r\nif n&1==0:\r\n print(\"NO\")\r\nelse:\r\n if x[0]&1==1 and x[-1]&1==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\ndef pe(s): return print(str(s), file=sys.stderr)\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\n\ndef main():\n n = I()\n a = LI()\n\n m = {}\n def f(l, r):\n if l >= r:\n return False\n k = (l,r)\n if k in m:\n return m[k]\n t = a[l:r]\n if t[0] % 2 == 0 or t[-1] % 2 == 0:\n m[k] = (0,0)\n return (0,0)\n\n e = 0\n o = 0\n if len(t) % 2 == 1:\n o = 1\n else:\n e = 1\n\n for i in range(l+1,r):\n lo,le = f(l,i)\n ro,re = f(i,r)\n if lo and re or le and lo:\n o = 1\n if lo and ro or le and re:\n e = 1\n if o and e:\n break\n\n m[k] = (o,e)\n return (o,e)\n\n o,e = f(0,n)\n if o:\n return 'Yes'\n\n return 'No'\n\n\nprint(main())\n\n", "\r\ndef main():\r\n\tn = int(input())\r\n\r\n\ttab = list(map(int,input().split()))\r\n\tif tab[0]%2==1 and tab[n-1]%2==1 and n%2==1:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")\r\n\r\nmain()\r\n \r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n&1 and a[0]&1 and a[n-1]&1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "n = int(input())\r\nAs = list(map(int, input().split()))\r\nif (n % 2 == 0):\r\n print(\"NO\")\r\nelif (As[0] % 2 == 0 or As[-1] % 2 == 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nif (arr[0]%2==0 or arr[n-1]%2==0):\r\n print(\"NO\")\r\nelif (n%2!=0):\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")\r\n", "def f(n):\r\n return n % 2 == 1\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nif f(n) and f(l[-1])and f(l[0]):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\nif n %2 != 0 and array[0]%2 != 0 and array[-1]%2 != 0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n=int(input())\r\nl=list(map(int,input().strip().split()))[:n]\r\nif len(l)%2!=0 and l[0]%2!=0 and l[n-1]%2!=0:\r\n print('Yes')\r\nelse:\r\n print('No')", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nprint(\"NO\" if len(a) % 2 == 0 or a[0] % 2 == 0 or a[-1] % 2 == 0 else \"YES\")\r\n", "n = int(input().strip())\nnums = list(map(int, input().strip().split()))\nif n % 2 == 1 and nums[0] % 2 == 1 and nums[-1] % 2 == 1:\n print('Yes')\nelse:\n print('No')", "tam = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif tam%2 == 0 or arr[0]%2 == 0 or arr[tam-1]%2 == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "\n\nif __name__ == '__main__':\n n=int(input())\n a = list(map(int,(input().split(' '))))\n pu = False;\n if(a[0]%2 == 0 or a[-1]%2 == 0):\n pu = True\n\n if(n%2 == 0 or pu):\n print(\"No\")\n else:\n print(\"Yes\")\n", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif n%2==1 and a[0]%2==a[n-1]%2==1:\r\n print('Yes')\r\nelse:\r\n print('No')", "def is_correct(arr):\r\n arr_len = len(arr)\r\n if arr_len == 0 or arr_len % 2 == 0 or check_border(arr):\r\n return False\r\n return True\r\n\r\n\r\ndef check_border(arr):\r\n return arr[0] % 2 == 0 or arr[-1] % 2 == 0\r\n\r\n\r\ndef do_magic(arr):\r\n k = 1\r\n while k < len(arr):\r\n parts = []\r\n start, end = 0, k\r\n while start < len(arr):\r\n if end > len(arr):\r\n # Adding tale\r\n part = arr[start:-1]\r\n else:\r\n part = arr[start:end]\r\n if not is_correct(part):\r\n break\r\n parts.append([part])\r\n start = end + 1\r\n end += k\r\n parts.append([part])\r\n if len(parts) % 2 != 0:\r\n print('Yes')\r\n return \r\n k += 2\r\n print('No')\r\n\r\n\r\nlength = input()\r\nlength = int(length)\r\narray = input()\r\narray = [int(i) for i in array.split()]\r\nif is_correct(array):\r\n print('Yes')\r\nelse:\r\n do_magic(array)", "import sys\n\n\ndef main():\n n = int(input())\n s = list(map(int, sys.stdin.readline().split()))\n\n if n % 2 == 1 and s[0] % 2 == 1 and s[-1] % 2 == 1:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\nmain()\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Feb 10 22:37:17 2019\r\n\r\n@author: Yohann\r\n\"\"\"\r\n\r\ndef check(seq):\r\n a = len(seq) % 2 == 1\r\n b = seq[0] % 2 == 1\r\n c = seq[len(seq)-1] % 2 == 1\r\n return a and b and c\r\n\r\nlength = int(input())\r\nnumbers = [int(n) % 2 for n in input().split()]\r\n\r\nprint(\"Yes\" if check(numbers) else \"No\")\r\n\r\n \r\n", "n = int(input())\nst = list(map(int, input().split()))\n\n# odd set\n# len odd\n# start & end odd\n\n\nprint(\"Yes\") if st[0]%2 and st[n-1]%2 and n%2 else print(\"No\")", "n=int(input())\r\nl=[int(i)for i in input().split()]\r\nprint(\"Yes\"if n&1 and l[0]&1 and l[-1]&1 else\"No\")", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif arr[0] % 2 == 0 or arr[n-1] % 2 == 0 or n % 2 == 0 :\r\n print (\"No\")\r\nelse:\r\n print (\"Yes\")", "from sys import stdin\r\nn = int(stdin.readline())\r\na = list(map(int, stdin.readline().split()))\r\nif n%2 != 0 and (a[0]%2 != 0 and a[-1] %2 != 0):\r\n print('Yes')\r\nelse:\r\n print('NO')", "n=int(input())\na=[int(s) for s in input().split()]\ncount=0\nif n%2 == 0 or a[0]%2 == 0 or a[n-1]%2==0:\n print(\"No\")\nelse:\n print(\"YES\")\n \n \n \n \n \n \n\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nif m[0] % 2 == 0 or m[-1] % 2 == 0:\r\n print('No')\r\nelse:\r\n if n % 2 != 0:\r\n print('Yes')\r\n else:\r\n print('No')", "n = int(input())\narr = list(map(int, str(input()).split(\" \")))\n\ndef isOdd(n):\n return int(n) % 2 != 0\n\nif not isOdd(arr[0]) or not isOdd(arr[len(arr) - 1]) or len(arr) % 2 == 0:\n print(\"No\")\nelse:\n print(\"Yes\")", "n=int(input())\r\nif (n % 2 == 0):\r\n print(\"No\")\r\nelse:\r\n a=list(map(int,input().split()))\r\n if (a[0]%2 == 0):\r\n print(\"No\")\r\n else:\r\n if a[n-1] % 2 == 0:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nif n%2==0 or p[0]%2==0 or p[n-1]%2==0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "def solve():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n if all(map(lambda x: x%2, l)) and n%2: return \"Yes\"\r\n if l[0]%2==0: return \"No\"\r\n if n%2 and l[0]%2 and l[-1]%2: return \"Yes\"\r\n\r\n s=0\r\n c=0\r\n for i in range(1,n):\r\n if i==n-1 and (i-s+1)%2 and l[s]%2 and l[i]%2:\r\n if (c+1)%2==0: return \"No\"\r\n return \"Yes\"\r\n if(i-s+1)%2 and l[s]%2 and l[i]%2 and l[i+1]%2:\r\n s=i+1\r\n c+=1\r\n return \"No\"\r\nprint(solve())\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n%2==0 or a[0]%2==0 or a[-1]%2==0:\r\n print('No')\r\nelse:\r\n print('Yes')", "length = int(input())\narr = [*map(int, input().split())]\nif(length%2==0 or arr[0]%2==0 or arr[length-1]%2==0):\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif(n%2==0):\r\n print(\"NO\")\r\nelse:\r\n if(l[0]%2==1 and l[-1]%2==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif a[0] %2 ==0:\r\n print(\"No\")\r\nelse:\r\n f=0\r\n for l in range(1,n+1,2):\r\n if n % l ==0 and ( n//l) %2 ==1 :\r\n i=0\r\n j=i+l-1\r\n f1=0\r\n while j<n and i<n :\r\n if a[i]%2 ==1 and a[j] %2 ==1:\r\n i=j+1\r\n j= i +l-1\r\n else:\r\n f1=1\r\n break\r\n if f1 ==0:\r\n f=1\r\n break\r\n if f==1:\r\n break\r\n if f==0:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n \r\n \r\n \r\n ", "leng = input()\narr = input()\nleng = int(leng)\narr = list(map(int, arr.split(' ')))\nif leng % 2 == 0:\n print(\"No\")\nelif arr[0] % 2 == 0 or arr[-1] % 2 == 0:\n print(\"No\")\nelse: print(\"Yes\")\n \t\t \t\t\t \t \t \t\t \t \t \t \t\t\t \t\t", "\na=int(input())\narr=list(map(int,input().split()))\nflag=0\nif a%2!=0:\n if arr[0]%2!=0:\n if arr[-1]%2!=0:\n flag=1\n\n\nif flag==1:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = 'Yes'\r\nif n % 2 == 0:\r\n res = 'No'\r\nif a[0] % 2 == 0 or a[-1] % 2 == 0:\r\n res = 'No'\r\nprint(res)\r\n", "n = int(input())\nseq = list(map(int, input().split()))\n\nif n%2 != 0 and seq[0]%2 != 0 and seq[-1]%2 != 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "n = int(input())\na = [int(x) for x in input().split(\" \")]\n\nif n % 2 == 1 and a[0] % 2 == 1 and a[-1] % 2 == 1:\n print('Yes')\nelse:\n print('No')", "N = int(input())\nA = [int(x) for x in input().split()]\ndp = [[False] * (N + 1) for _ in range(N + 1)]\ndp[0][0] = True\nfor i in range(N):\n if A[i] % 2 == 1:\n for j in range(N):\n for k in range(i + 1):\n if (k - i + 1) % 2 == 1 and A[k] % 2 == 1 and dp[k][j]:\n dp[i + 1][j + 1] = True\nprint(\"Yes\" if any(dp[-1][i] for i in range(1, N + 1, 2)) else \"No\")\n", "# http://codeforces.com/contest/849/problem/A\r\nget=lambda:list(map(int,input().split()))\r\nn=int(input())\r\nl=get()\r\nif l[0] %2==0 or l[n-1]%2==0:\r\n print(\"No\")\r\n exit()\r\nif (n%2 and l[n-1]%2 ):\r\n print(\"Yes\")\r\n exit()\r\n\r\nr=0\r\nans=[]\r\nfor i in l:\r\n if i%2:\r\n ans.append(i)\r\n r+=1\r\nnow=0\r\nj=0\r\n\r\nfor i in (ans):\r\n if (i-now)%2==0:\r\n now=i\r\n j+=1\r\nprint(\"Yes\" if j%2 else \"No\") \r\n\r\n \r\n", "n = int(input())\r\narr = input()\r\narr = list(arr.split())\r\nif ((int(arr[len(arr)-1]) % 2 == 0) or (int(arr[0]) % 2 == 0) or (n % 2 == 0)):\r\n print(\"No\")\r\nelse : print(\"Yes\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif l[0]%2!=0 and l[n-1]%2!=0 and n%2!=0 :\r\n print('Yes')\r\nelse :\r\n print('No')\r\n", "import sys\nfrom math import *\nfrom functools import *\nfrom collections import *\n\nn=int(input())\nr=list(map(int,input().split()))\nprint([\"No\",\"Yes\"][r[0]%2==1 and r[-1]%2==1 and n%2==1])", "n = int(input())\r\narr = list(map(int, input().split()))\r\nodd = 0\r\n\r\n\r\nif (n%2==0 and odd%2) or (n%2) and arr[0]%2 and arr[-1]%2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a=int(input())\ns=[int(x) for x in input().split()]\nif a%2 == 0:\n print(\"No\")\nelif s[0]%2 == 0:\n print(\"No\")\nelif s[len(s)-1]%2 == 0:\n print(\"No\")\nelse:\n print(\"Yes\")", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\n\r\nif (n & 1) and (a[0] & 1) and (a[-1] & 1):\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif a[0]%2 == 0 or a[-1]%2 == 0:\r\n print('No')\r\nelif n%2 != 0:\r\n print('Yes')\r\nelse:\r\n print('No')", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nd = []\r\nif n % 2 == 0 or data[0] % 2 == 0 or data[-1] % 2 == 0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n = int(input())\r\nl = list(map(int, input().split()))\r\nif l[0]%2!=0 and l[-1]%2!=0 and n%2!=0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "l = int(input())\r\narr = [*map(int,input().split())]\r\nprint(\"Yes\" if l%2 and arr[0]%2 and arr[-1]%2 else \"No\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif a[0]%2==0 or a[n-1]%2==0:\r\n print(\"No\")\r\nelse:\r\n if n%2==1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n = int(input())\narreglo = list(map(int, input().split()))\n\nif n % 2 == 0 or arreglo[0] % 2 == 0 or arreglo[-1] % 2 == 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nprint('No' if (a[0]%2 == 0) or (a[n-1]%2 == 0) or (n%2 == 0) else 'Yes')", "n = int(input())\narra = input().split()\n\nif(n%2==1 and int(arra[0])%2==1 and int(arra[n-1])%2==1):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nnums = list(map(int,sys.stdin.readline().split()))\r\n\r\ndef possible(arr):\r\n if arr[0]%2==0 or arr[-1]%2==0:\r\n return False\r\n if len(arr)%2==1:\r\n return True\r\n\r\n\r\nif possible(nums):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "a=int(input());b=list(map(int,input().split()));print(\"Yes\"if a&1and b[0]&1==b[-1]&1==1else\"No\")", "n=int(input())\r\na=[int(q) for q in input().strip().split()]\r\nif int(n)%2==0 or int(a[0])%2==0 or int(a[n-1])%2==0:\r\n print('No')\r\nelse:\r\n print('Yes')", "from typing import List\r\n\r\n\r\ndef solve(n: int, arr: List[int]) -> str:\r\n if n % 2 == 0 or arr[0] % 2 == 0 or arr[-1] % 2 == 0:\r\n return 'No'\r\n return 'Yes'\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(solve(n, arr))", "#!/usr/bin/env python3\r\n\r\ndef is_odd(n):\r\n return n % 2 == 1\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n ls = [int(i) for i in input().split()]\r\n answer = 'Yes' if is_odd(n) and is_odd(ls[0]) and is_odd(ls[-1]) else 'No'\r\n print(answer)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\n\r\n\r\n#A. Odds and Ends\r\nlist_num = list(map(int, sys.stdin.read().split()))\r\nsize = list_num[0]\r\nnums = list_num[1:]\r\n\r\nif size%2==0 or nums[0]%2==0 or nums[size-1]%2==0:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"Yes\")", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nprint(\"YES\" if n % 2 and lst[0] % 2 and lst[-1] % 2 else \"NO\")\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nif(n % 2 == 1 and s[0] % 2 == 1 and s[-1] % 2 == 1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif n%2==1:\r\n if (a[0]%2==1) and (a[n-1]%2==1):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\nelse:\r\n print(\"No\")\r\n\r\n", "def isOdd(n):\n\treturn n % 2 == 1\n\ndef f(sequence_length, sequence):\n\tif (not isOdd(sequence[0]) or not isOdd(sequence[-1])):\n\t\treturn False\n\n\tif (not isOdd(sequence_length)):\n\t\treturn False\n\n\tdividers = []\n\tfor i in range(sequence_length - 1):\n\t\tif (isOdd(sequence[i]) and isOdd(sequence[i+1])):\n\t\t\tdividers.append(i+1)\n\n\tif(not isOdd(len(dividers))):\n\t\treturn True\n\telse:\n\t\tfor i in dividers:\n\t\t\tif ((not f(i, sequence[0:i]) and f(sequence_length - i, sequence[i:])) or (f(i, sequence[0:i]) and not f(sequence_length - i, sequence[i:]))):\n\t\t\t\treturn True\n\t\treturn False\n\nsequence_length = int(input())\nsequence = list(map(int, input().split()))\n\nif (f(sequence_length, sequence)):\n\tprint (\"Yes\")\nelse:\n\tprint (\"No\")\n\t \t \t \t\t\t \t\t\t\t\t \t \t\t", "def id(v,n):\r\n\tif not v[0]%2 or not v[-1]%2:\r\n\t\treturn 0\r\n\tif n%2:\r\n\t\treturn 1\r\n\telse:\r\n\t\treturn 0\r\n\t\t\r\nn=int(input())\r\nv=[int(c) for c in input().split()]\r\nif id(v,n):\r\n\tt='Yes'\r\nelse:\r\n\tt='No'\r\nprint(t)", "n = int(input())\r\ndaf = list(map(int, input().split()))\r\n\r\nif n%2 == 0 or daf[0]%2 == 0 or daf[-1]%2 == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif a[0]%2 == 1 and a[n-1]%2 == 1 and n%2 == 1:\r\n print('Yes')\r\nelse:\r\n print('No')", "#http://codeforces.com/problemset/problem/849/A\r\ndef main(lst):\r\n\tstart=len(lst)-1\r\n\tend=len(lst)-1\r\n\tsubsegs=0\r\n\tif(lst[0]%2==0 or lst[len(lst)-1]%2==0): #first or last are even\r\n\t\treturn \"NO\"\r\n\tif(len(lst)%2!=0):\r\n\t\treturn \"YES\"\r\n\twhile(len(lst)!=0):\r\n\t\tsub=lst[start:end+1]\r\n\t\t\"\"\"\r\n\t\tprint(lst)\r\n\t\tprint(sub)\r\n\t\tprint(start)\r\n\t\tprint(end)\r\n\t\tprint(\"==========\")\r\n\t\t\"\"\"\r\n\t\tif(sub[0]%2==0):\r\n\t\t\tstart-=1\r\n\t\telif(len(sub)%2==0):\r\n\t\t\tstart-=1\r\n\t\telse:\r\n\t\t\tdel lst[start:end+1]\r\n\t\t\tstart=len(lst)-1\r\n\t\t\tend=len(lst)-1\r\n\t\t\tsubsegs+=1\r\n\t\tif(start<0):\r\n\t\t\treturn \"NO\"\r\n\tif(subsegs%2!=0):\r\n\t\treturn \"YES\"\r\n\telse:\r\n\t\treturn \"NO\"\r\n\r\n\r\n\r\n\r\ninput()\r\nlst=input().split()\r\nlst=[eval(i) for i in lst]\r\nprint(main(lst))", "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\nif not min(a[0] % 2, a[-1] % 2):\r\n ans = \"No\"\r\nelse:\r\n ans = \"Yes\" if n % 2 else \"No\"\r\nprint(ans)", "n = int(input())\ns = [int(j) for j in input().split()]\nif len(s)%2==0 or s[0]%2==0 or s[n-1]%2==0:\n print('NO')\nelse:\n print('YES')\n", "n = int(input())\r\nls = list(map(int, input().split()))\r\n\r\nif ls[0] % 2 == 1 and ls[-1] % 2 == 1 and len(ls) % 2 == 1:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif n % 2 == 1:\r\n if a[0] % 2 == 1 and a[-1] % 2 == 1:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\nelse:\r\n print(\"no\") \r\n\r\n# ~ duk", "# encoding: utf-8\r\n\r\ninput()\r\nan = list(map(int, input().split()))\r\n\r\nif not an[0] % 2 or not an[-1] % 2 or not len(an) % 2:\r\n print('no')\r\nelse:\r\n print('yes')\r\n", "# author: violist\n# created: 13.02.2022 17:21:56\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\nif (a[0] % 2 == 0 or a[n - 1] % 2 == 0):\n print(\"NO\")\n sys.exit()\nstack = 0\nfor i in range(n):\n if (n & 1):\n stack += 1\n else:\n if (stack % 2 == 0):\n print(\"NO\")\n sys.exit()\n stack = 0\nprint(\"YES\" if stack & 1 else \"NO\")\n", "a=int(input())\r\nb=input().split(' ')\r\nlistas= list(map(int,b))\r\nif a%2==0 or listas[0]%2==0 or listas[-1]%2==0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "n=int(input())\r\na = list(map(int, input().split(\" \")))\r\nif( (len(a)%2)!=0 and a[0]%2!=0 and a[-1]%2!=0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n", "n = int(input())\narr = [int(x) for x in input().split()]\nprint('Yes' if n % 2 == 1 and arr[0] % 2 == 1 and arr[-1] % 2 == 1 else 'No')\n", "def main():\n n = int(input())\n aa = list(map(int, input().split()))\n print(('No', 'Yes')[n & 1 and aa[0] & 1 and aa[-1] & 1])\n\n\nif __name__ == '__main__':\n main()\n", "# http://codeforces.com/contest/849/problem/A\n\nn = int(input())\nseq = [(int(x) % 2) for x in input().split()]\n\ndef solve(ss):\n n = len(ss)\n if ss[0] == 1 and ss[n-1] == 1:\n if n % 2 == 1:\n return 1\n else:\n # find next 1 at odd index\n i = 1\n next_ss = None\n for i in range(1, n-1, 2):\n if ss[i] == 1:\n next_ss = i\n break\n if next_ss is None:\n return None\n else:\n res = solve(ss[i:])\n if res is None:\n return None\n else:\n return 1 + res\n else:\n return None\n\ncnt = solve(seq)\nif cnt is None or cnt % 2 == 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n = int(input())\na = list(map(int, input().split()))\nif n % 2 and a[0] % 2 and a[-1] % 2:\n print('Yes')\nelse:\n print('No')\n\n\"\"\"\n11\n1 3 2 1 1 2 2 2 2 2 1\n\"\"\"\n", "a=int(input())\r\nf=[]\r\ng=0\r\nx=0\r\nb=list(map(int,input().split()))\r\nif b[0]%2==0 or b[-1]%2==0 or a%2==0:\r\n\tprint('No')\r\nelse:\r\n\tprint(\"Yes\")\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nif len(arr)&1==1 and arr[0]&1==1 and arr[n-1]&1==1: print('Yes')\r\nelse :print('No')", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(\"Yes\" if a[0]&1 and a[-1]&1 and n&1 else \"No\")", "n=int(input())\r\nl=[]\r\nf=False\r\nl=list(map(int,(input().split())))\r\nif n%2==1 and l[0]%2==1 and l[-1]%2==1:\r\n print(\"yes\")\r\nelse:\r\n print('no')\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nif len(numbers) % 2 == 1 and numbers[0] % 2 == 1 and numbers[n - 1] % 2 == 1:\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/20 08:40\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\nA = [int(x) for x in input().split()]\r\n\r\nif N%2==0:\r\n print(\"No\")\r\nelse:\r\n if A[0]%2!=0 and A[-1]%2!=0:\r\n print('Yes')\r\n else:\r\n print('No')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nif n%2 == 1 and w[0]%2==1 and w[-1]%2==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "line_1=int(input())\n\nseq=list(map(int,input().split()))\nif ((seq[0])%2!=0) and (seq[len(seq)-1]%2!=0):\n if line_1%2!=0:\n print(\"Yes\")\n else:\n print(\"No\")\nelse:\n print(\"No\")\n \n \n \n \n", "n = int(input())\ng = list(map(int, input().split()))\n\nif len(g) % 2 == 1 and g[0] % 2 == 1 and g[-1] % 2 == 1:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\nc=list(map(int,input().split()))\r\nif(n%2==1 and c[0]%2==1 and c[-1]%2==1):\r\n print (\"Yes\")\r\nelse:\r\n print (\"No\")\r\n", "n=int(input())\na=input().split()\nif int(a[0])%2==0 or int(a[n-1])%2==0 or n%2==0:\n print(\"No\")\n exit()\nprint(\"Yes\")", "#!/usr/bin/python3\n\nn = int(input())\nx = list(map(int, input().split(' ')))\n\nif len(x) % 2 == 0:\n print(\"No\")\n exit()\n\nif x[0] % 2 == 0 or x[-1] % 2 == 0:\n print (\"No\")\n exit()\n\nprint(\"Yes\")" ]

[ "x=input()\r\nn=x.index(\"^\")\r\nl=list(x[:n])\r\nl=l[::-1]\r\nr=list(x[n+1:])\r\nf=s=0\r\nfor i in range(len(l)):\r\n if l[i].isdigit():\r\n f=f+(i+1)*int(l[i])\r\nfor i in range(len(r)):\r\n if r[i].isdigit():\r\n s=s+(i+1)*int(r[i])\r\nif f==s:\r\n print(\"balance\")\r\nelif f>s:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n", "a=input()\nx=a.index('^')\nc=0\nfor i in range(len(a)):\n if a[i]in['^','=']:continue\n c+=int(a[i])*(i-x)\nprint(\"right\"if c>0else(\"left\"if c<0else\"balance\"))\n", "s=input()\r\nn=len(s)\r\nx,y=0,0\r\nz=s.index('^')\r\nfor i in range(n):\r\n if(s[i].isdigit()):\r\n x+=(int(s[i])*(i-z))\r\nif(x==0):\r\n print('balance')\r\nelif(x<0):\r\n print('left')\r\nelse:\r\n print(\"right\")\r\n", "k = input().split('^')\r\nl = sum([(ord(x)-ord('0'))*(len(k[0])-i+1) for i, x in enumerate(k[0], 1) if x != '=' ])\r\nr = sum([(ord(x)-ord('0'))*(i) for i, x in enumerate(k[1], 1) if x != '='])\r\nprint('balance' if l == r else 'left' if l > r else 'right')\r\n", "lever = input()\r\npivot = lever.find(\"^\")\r\n\r\nleft = 0\r\nfor i in range(pivot):\r\n\tif lever[i] != '=':\r\n\t\tw = int(lever[i])\r\n\t\t#print(\"left w: \", w, \" in \", i)\r\n\t\tleft += (w * (pivot - i))\r\n\r\nright = 0\r\nfor i in range(pivot+1, len(lever)):\r\n\tif lever[i] != '=':\r\n\t\tw = int(lever[i])\r\n\t\t#print(\"right w: \", w, \" in \", i)\r\n\t\tright += (w * (i - pivot))\r\n\r\n#print(\"pivot: \", pivot, \" left: \", left, \" right: \", right)\r\nif right > left:\r\n\tprint(\"right\")\r\nelif left > right:\r\n\tprint(\"left\")\r\nelse:\r\n\tprint(\"balance\")\r\n", "import math\r\n\r\ns=str(input())\r\n\r\nleft=0;right=0\r\nt=0;y=0\r\nr=\"123456789\"\r\n\r\nfor i in range(len(s)):\r\n if s[i]==\"^\":\r\n y=i\r\n\r\nfor i in range(y+1,len(s)):\r\n if s[i] in r:\r\n right+=(i-y)*int(s[i])\r\nfor i in range(y-1,-1,-1):\r\n if s[i] in r:\r\n left+=(y-i)*int(s[i])\r\n \r\nif left==right:\r\n print(\"balance\")\r\nelif right>left:\r\n print(\"right\")\r\nelse:\r\n print(\"left\")", "patron = input()\r\nleftWeights = []\r\nrightWeights = []\r\nshouldAddOnLeft = True\r\nfor val in patron:\r\n if val == \"^\":\r\n shouldAddOnLeft = False\r\n else:\r\n weight = 0\r\n if val != \"=\":\r\n weight = int(val)\r\n (leftWeights if shouldAddOnLeft else rightWeights).append(weight)\r\nleftWeightsSum = 0\r\nrightWeightsSum = 0\r\nfor i in range(len(leftWeights)):\r\n leftWeightsSum += (len(leftWeights)-i)*leftWeights[i]\r\nfor i in range(len(rightWeights)):\r\n rightWeightsSum += (i+1)*rightWeights[i]\r\nif leftWeightsSum == rightWeightsSum:\r\n print(\"balance\")\r\nelif leftWeightsSum < rightWeightsSum:\r\n print(\"right\")\r\nelse:\r\n print(\"left\")", "s = input()\r\n\r\npiv = 0\r\n\r\nl = len(s)\r\n\r\nfor i in range(l):\r\n if s[i] == '^':\r\n piv = i\r\n break\r\n\r\nlt = 0\r\nrt = 0\r\n\r\nfor i in range(0,piv):\r\n if s[i]!='=':\r\n lt+=int(s[i])*(piv-i)\r\n\r\nfor i in range(piv+1,l):\r\n if s[i]!='=':\r\n rt+=int(s[i])*(i-piv)\r\n \r\nif lt>rt:\r\n print(\"left\")\r\nelif rt>lt:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s = input()\r\nn = len(s)\r\nmid = s.index('^')\r\nsum_left = 0\r\nsum_right = 0\r\n\r\nfor i in range(mid):\r\n if s[i].isnumeric():\r\n sum_left += int(s[i])*(i-mid)\r\n\r\nfor i in range(mid+1,n):\r\n if s[i].isnumeric():\r\n sum_right += int(s[i])*(i-mid)\r\n\r\nsum = sum_left + sum_right\r\n\r\nif sum == 0:\r\n print('balance')\r\nelif sum < 0:\r\n print('left')\r\nelse:\r\n print('right')", "s = input()\r\nleft_sum = 0\r\nright_sum = 0\r\npivot = s.index('^')\r\nfor i in range(pivot):\r\n if s[i] != '=':\r\n left_sum += int(s[i]) * (pivot - i)\r\nfor i in range(pivot+1, len(s)):\r\n if s[i] != '=':\r\n right_sum += int(s[i]) * (i - pivot)\r\nif left_sum == right_sum:\r\n print('balance')\r\nelif left_sum > right_sum:\r\n print('left')\r\nelse:\r\n print('right')", "s = input()\r\nleft, right = s.split('^')\r\nleft_value, right_value = 0, 0\r\nfor i in range(len(left)):\r\n if left[i].isdigit():\r\n left_value += int(left[i]) * (len(left) - i)\r\nfor i in range(len(right)):\r\n if right[i].isdigit():\r\n right_value += int(right[i]) * (i + 1)\r\nif left_value < right_value:\r\n print('right')\r\nelif left_value == right_value:\r\n print('balance')\r\nelse:\r\n print('left')", "# n,k = map(int, input().split())\r\n# arr = list(map(int, input().split()))\r\n\r\ns = input()\r\ns = list(s)\r\nres = 0\r\nx = s.index(\"^\")\r\nfor i in range(len(s)):\r\n if s[i].isdigit():\r\n res += int(s[i]) * (x - i)\r\n\r\nif res == 0:\r\n print(\"balance\")\r\nelif res <0:\r\n print(\"right\")\r\nelse:\r\n print(\"left\")\r\n\r\n\r\n\r\n\r\n# n=int(input())\r\n\r\n# x=input().strip()\r\n\r\n\r\n# n,m= [int(x) for x in input().split()]\r\n\r\n\r\n\r\n# n,m= [int(x) for x in input().split()]\r\n# arr=[]\r\n# for i in range(n):\r\n# arr.append([int(x) for x in input().split()])\r\n\r\n# n,m= [int(x) for x in input().split()]\r\n# arr=[]\r\n# for i in range(n):\r\n# arr.append([x for x in input().strip()])\r\n\r\n\r\n# n=int(input())\r\n# arr=[]\r\n# for i in range(n):\r\n# arr.append([int(x) for x in input().split()])\r\n\r\n\r\n\r\n# n=int(input())\r\n# arr=[int(x) for x in input().split()]\r\n# '''", "s = str(input())\r\nl = s[:s.find(\"^\")]\r\nr = s[s.find(\"^\")+1:]\r\nr = r[::-1]\r\n\r\nlw = 0\r\nrw = 0\r\nfor i in range(len(l)):\r\n\tif l[i] != \"=\":\r\n\t\tlw+=int(l[i])*len(l[i:])\r\nfor i in range(len(r)):\r\n\tif r[i] != \"=\":\r\n\t\trw+=int(r[i])*len(r[i:])\r\n\r\nif rw>lw: print(\"right\")\r\nelif rw<lw: print(\"left\")\r\nelse: print(\"balance\")", "perekladina = input()\r\nopora = perekladina.find('^')\r\nanswer = 0\r\nfor i in range(opora):\r\n if perekladina[i] != '=':\r\n answer += int(perekladina[i])*(opora-i)\r\nfor i in range(opora+1, len(perekladina)):\r\n if perekladina[i] != '=':\r\n answer -= int(perekladina[i])*(i-opora)\r\nprint('balance' if not answer else ('left' if answer > 0 else 'right'))", "s = input()\nsuc = 0\np = 0\nkde = 0\nfor i in range(len(s)):\n\tc = s[i]\n\tif c == '^':\n\t\tkde = i\nfor i in range(len(s)):\n\tc = s[i]\n\tif '1' <= c <= '9':\n\t\tsuc+=((kde-i)*int(c))\n\t\tp+=1\nif suc < 0:\n\tprint(\"right\")\nelif suc > 0:\n\tprint(\"left\")\nelse:\n\tprint(\"balance\")\n", "# -*- coding: utf-8 -*-\r\n\r\ns1, s2 = input().split('^')\r\ns1 = s1[::-1]\r\n\r\nl1 = sum([(i+1) * int(s1[i]) for i in range(len(s1)) if s1[i] != '='])\r\nl2 = sum([(i+1) * int(s2[i]) for i in range(len(s2)) if s2[i] != '='])\r\n\r\nprint('balance' if l1==l2 else 'left' if l1>l2 else 'right')\r\n", "rode=input()\nleftLoad=0\nrightLoad=0\npivotPosition=rode.find('^')\npivot=False\nfor i in range(len(rode)):\n if rode[i]=='^':\n pivot=True\n elif rode[i].isdigit():\n if pivot:\n rightLoad+=abs(pivotPosition-i)*int(rode[i])\n else:\n leftLoad += abs(pivotPosition - i) * int(rode[i])\n\nif leftLoad>rightLoad:\n print('left')\nelif rightLoad>leftLoad:\n print('right')\nelse:\n print('balance')", "a=list(input())\r\nx=a.index(\"^\")\r\nl=0\r\nr=0\r\nfor i,j in enumerate(a):\r\n if i<x and j!=\"=\":\r\n l+=int(j)*(x-i)\r\n if i>x and j!=\"=\":\r\n r+=int(j)*(i-x)\r\nif l>r:\r\n print(\"left\")\r\nelif r>l:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "n = input()\r\n\r\nzn = 0\r\nwyn = 0\r\nfor i in range(len(n)):\r\n if n[i]=='^':\r\n zn = i\r\nfor i in range(len(n)):\r\n if n[i]!='^' and n[i]!='=':\r\n wyn += (zn-i)*int(n[i])\r\n\r\n#print(wyn)\r\nif wyn==0:\r\n print(\"balance\")\r\nelif wyn>0:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "s = input()\r\npos = s.find('^')\r\nbalance = 0\r\nfor i in range(pos):\r\n if (s[i] != '='):\r\n balance += int(s[i]) * (pos - i)\r\n\r\nfor i in range(pos + 1, len(s)):\r\n if (s[i] != '='):\r\n balance -= int(s[i]) * (i - pos)\r\n\r\nif (balance > 0):\r\n print(\"left\")\r\nelif (balance < 0):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "# python 3\n\"\"\"\n\"\"\"\n\n\ndef lever(lever_description_str: str) -> str:\n left_balance = 0\n right_balance = 0\n pivot_pos = lever_description_str.find(\"^\")\n for i in range(len(lever_description_str)):\n if i < pivot_pos and lever_description_str[i] != '=':\n left_balance += (pivot_pos - i) * int(lever_description_str[i])\n elif i > pivot_pos and lever_description_str[i] != '=':\n right_balance += (i - pivot_pos) * int(lever_description_str[i])\n if left_balance < right_balance:\n return \"right\"\n elif left_balance > right_balance:\n return \"left\"\n else:\n return \"balance\"\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n lever_description = input()\n print(lever(lever_description))\n", "s=str(input())\r\nleftroq=0\r\nchange=0\r\nrighttroq=0\r\npivot=s.index(\"^\")\r\nfor j in range(len(s)):\r\n if s[j].isalnum() and change==0:\r\n leftroq+=int(s[j])*(pivot-j)\r\n elif j==pivot:\r\n change+=1\r\n elif s[j].isalnum() and change==1:\r\n righttroq+=int(s[j])*(j-pivot)\r\nif leftroq>righttroq:\r\n print(\"left\")\r\nelif righttroq>leftroq:\r\n print(\"right\")\r\nelse:print(\"balance\")", "s,r=input(),0\r\nm=s.find('^')\r\nr=sum(int(s[i])*(i-m) if s[i].isdigit() else 0 for i in range(len(s)))\r\nprint(\"left\" if r<0 else (\"balance\" if r==0 else \"right\"))\r\n", "s = input()\r\nl1 = []\r\nl2 = []\r\nb = s.index('^')\r\nfor i in range(len(s)):\r\n if i<b:\r\n l1.append(s[i])\r\n elif i>b:\r\n l2.append(s[i])\r\nl1.reverse()\r\nt1 = 0\r\nt2 = 0\r\nfor i in range(0,len(l1)):\r\n if l1[i]=='=':\r\n continue\r\n else:\r\n l1[i] = int(l1[i])\r\n t1 = t1 + (i+1)*l1[i]\r\nfor i in range(0,len(l2)):\r\n if l2[i]=='=':\r\n continue\r\n else:\r\n l2[i] = int(l2[i])\r\n t2 = t2 + (i+1)*l2[i]\r\nif t1==t2:\r\n print('balance')\r\nelif t1>t2:\r\n print('left')\r\nelif t2>t1:\r\n print('right')\r\nelse:\r\n print('no balance')\r\n", "\r\nl = list(input())\r\nindx = l.index('^')\r\n\r\nlis = [i for i in range(1,10)]\r\n\r\nl_tq = 0\r\nr_tq = 0\r\n\r\nfor i in range(indx):\r\n\tif l[i] != '=':\r\n\t\tl_tq += int(l[i]) * (indx - i)\r\n\r\nfor i in range(indx + 1, len(l)):\r\n\tif l[i] != '=':\r\n\t\tr_tq += int(l[i]) * (i - indx)\r\n\r\nif r_tq == l_tq:\r\n\tprint('balance')\r\nelif r_tq > l_tq:\r\n\tprint('right')\r\nelse:\r\n\tprint('left')\r\n", "s = list(input().strip())\r\npiv = s.index('^')\r\ntorque = 0\r\nfor i in range(len(s)):\r\n if s[i].isdigit():\r\n torque += int(s[i]) * (piv - i)\r\nif torque > 0:\r\n print(\"left\")\r\nelif torque < 0:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s = input()\n\nrl = 0\nrr = 0\nindex = 0\nsize = 0\n\npi = s.find('^')\nsl = s[:pi]\nsr = s[pi:]\n\nsize = len(sl)\n\nfor c in sl:\n rl += 0 if not c.isdigit() else (size - index) * int(c)\n\n index += 1\n\nindex = 0\nsize = len(sr)\n\nfor c in sr:\n rr += 0 if not c.isdigit() else index * int(c)\n\n index += 1\n\n\nif(rr == rl):\n print(\"balance\")\nelif(rl > rr):\n print(\"left\")\nelse:\n print(\"right\")\n\n\t \t \t \t \t\t \t \t \t\t \t \t", "v = input().split(\"^\")\nleft = 0\nfor i, x in enumerate(v[0][::-1], 1):\n if x == \"=\":\n continue\n left += i * int(x)\nright = 0\nfor i, x in enumerate(v[1], 1):\n if x == \"=\":\n continue\n right += i * int(x)\nprint([[\"left\", \"balance\"][left == right], \"right\"][right > left])\n", "from itertools import zip_longest as zl\r\na, b = input().strip(\"=\").replace(\"=\",\"0\").split(\"^\")\r\nca, cb, counter = 0, 0, 1\r\nfor i, j in zl(reversed(a), b, fillvalue=0):\r\n ca += int(i) * counter\r\n cb += int(j) * counter\r\n counter += 1\r\nprint((\"left\", \"balance\", \"right\")[(cb >= ca) + (cb > ca)])", "s = input()\r\na = s.index(\"^\")\r\nr = 0\r\nl = 0\r\ncnt = 0\r\nfor i in range(a + 1, len(s)):\r\n cnt += 1\r\n if s[i] != \"=\":\r\n r += cnt*int(s[i])\r\n\r\nfor i in range(a):\r\n if s[i] != \"=\":\r\n l += (a - i)*int(s[i])\r\n\r\nif l == r:\r\n print(\"balance\")\r\nelif l > r:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "a=input()\r\n\r\n\r\nt=a.index('^')\r\n\r\nl,r=0,0\r\nfor k in range(t):\r\n if 49<=ord(a[k])<=57:\r\n l+=int(a[k])*(t-k)\r\nfor w in range(t,len(a)):\r\n if 49<=ord(a[w])<=57:\r\n r+=int(a[w])*(w-t)\r\n\r\n\r\n\r\nif l>r:\r\n print('left')\r\nelif r>l:\r\n print('right')\r\nelse:\r\n print('balance')\r\n", "a = list(input())\r\nn = len(a)\r\nmLeft = 0\r\nmRight = 0\r\npos = a.index('^')\r\nfor i in range(pos+1, n):\r\n if a[i]!='=':\r\n mRight+=int(a[i])*(i-pos)\r\nfor i in range(pos-1, -1, -1):\r\n if a[i]!='=':\r\n mLeft+=int(a[i])*(pos-i)\r\nif mLeft>mRight:\r\n print(\"left\")\r\nelif mRight>mLeft:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "def main():\n string=input()\n fulcrum=string.index('^')\n mass_left=0\n mass_right=0\n for i in range(0,fulcrum):\n if string[i] != '=':\n mass_left+=int(string[i]) * (fulcrum-i)\n for i in range(fulcrum+1,len(string)):\n if string[i] != '=':\n mass_right+=int(string[i])*(i-fulcrum)\n\n if mass_left==mass_right:\n print (\"balance\")\n return\n if mass_left<mass_right:\n print(\"right\")\n return\n if mass_right<mass_left:\n print(\"left\")\n return\nif __name__ == '__main__':\n main()", "s = input()\r\nc = 0\r\nm = s.index('^')\r\nfor d in range(len(s)):\r\n if s[d].isnumeric():\r\n c += int(s[d]) * (d - m)\r\nif c == 0:\r\n print('balance')\r\nelif c < 0:\r\n print('left')\r\nelif c > 0:\r\n print('right')", "s = input()\r\nl = len(s)\r\ni = s.index('^')\r\nlh = s[:i]\r\nrh = s[i+1:]\r\nls=rs=0\r\nfor x in range(len(lh)):\r\n if lh[x]!='=':\r\n ls+=(int(lh[x]))*(len(lh)-x)\r\nfor x in range(len(rh)):\r\n if rh[x]!='=':\r\n rs+=(int(rh[x]))*(x+1)\r\nif ls==rs:\r\n print('balance')\r\nelif ls<rs:\r\n print('right')\r\nelse:\r\n print('left')\r\n", "# Made By Mostafa_Khaled \nbot = True \nl = input()\n\np = l.index('^')\n\nb = sum((i - p) * int(x) for i, x in enumerate(l) if x.isdigit())\n\nif b != 0:\n\n b //= abs(b)\n\nprint(['left', 'balance', 'right'][b + 1])\n\n# Made By Mostafa_Khaled", "\nn = input()\n\n\n# for i in range(len(n)):\n\n\nz = n.index('^')\n\nn = list(n)\nlist1 = n[:z]\nlist2 = n[z+1:]\n\n\nt1 = 0\nt2 = 0\n\nlist1.reverse()\n\nfor i in range(len(list1)):\n\n if list1[i]!='=':\n t1+= int(list1[i])*(i+1)\n\nfor i in range(len(list2)):\n\n if list2[i]!='=':\n t2+= int(list2[i])*(i+1)\n\nif t1>t2:\n print('left')\nelif t1<t2:\n print('right')\nelse:\n print('balance')\n\n\n\n", "s = input()\r\n\r\npivot_pos = 0\r\nleft_count = 0\r\nright_count = 0\r\n\r\n''''def is_number(s):\r\n try:\r\n float(s)\r\n return True\r\n except ValueError:\r\n return False\r\n try:\r\n import unicodedata\r\n unicodedata.numeric(s)\r\n return True\r\n except (TypeError, ValueError):\r\n\t\treturn False'''\r\n\r\n# Find the pivot\r\nfor i in range(len(s)):\r\n\tif s[i] == '^':\r\n\t\tpivot_pos = i \r\n\r\n# Solve left side\r\nfor i in range(pivot_pos):\r\n\tif s[i].isdigit() == True:\r\n\t\tleft_count = left_count + (int(s[i]) * (pivot_pos - i))\r\n\r\n# Solve left side\r\nfor i in range(pivot_pos, len(s)):\r\n\tif s[i].isdigit() == True:\r\n\t\tright_count = right_count + (int(s[i]) * (i - pivot_pos))\r\n\r\nif left_count == right_count:\r\n\tprint(\"balance\")\r\nelif left_count > right_count:\r\n\tprint(\"left\")\r\nelse:\r\n\tprint(\"right\")", "lever_description = input().strip()\r\npivot_position = lever_description.index(\"^\")\r\nleft_torque = 0\r\nright_torque = 0\r\n\r\n# Calculate torque on the left side of the pivot\r\nfor i in range(pivot_position):\r\n if lever_description[i] == \"=\":\r\n continue\r\n weight = int(lever_description[i])\r\n left_torque += weight * (pivot_position - i)\r\n\r\n# Calculate torque on the right side of the pivot\r\nfor i in range(pivot_position + 1, len(lever_description)):\r\n if lever_description[i] == \"=\":\r\n continue\r\n weight = int(lever_description[i])\r\n right_torque += weight * (i - pivot_position)\r\n\r\n# Determine the balance state\r\nif left_torque == right_torque:\r\n print(\"balance\")\r\nelif left_torque > right_torque:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n", "s = input()\r\nind = s.index('^')\r\nsum1 = 0;\r\nsum2 = 0;\r\nfor i in range(0,ind):\r\n if(s[i] != '='):\r\n sum1 = sum1 + int(s[i])*(ind - i)\r\nfor i in range(ind + 1, len(s)):\r\n if(s[i] != '='):\r\n sum2 = sum2 + int(s[i])*(i - ind)\r\nif(sum1 == sum2):\r\n print(\"balance\")\r\nelif(sum1 > sum2):\r\n print(\"left\")\r\nelse :\r\n print(\"right\")", "s=input()\r\nl=\"123456789\"\r\np=s.index(\"^\")\r\na,b,c=0,0,0\r\nfor i in range(p-1,-1,-1):\r\n c=c+1\r\n if s[i] in l:\r\n a=a+int(s[i])*c\r\nc=0\r\nfor i in range(p+1,len(s)):\r\n c=c+1\r\n if s[i] in l:\r\n b=b+int(s[i])*c\r\nif a>b:\r\n print(\"left\")\r\nelif b>a:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n\r\n \r\n \r\n ", "s=list(input())\r\nx=s.index('^')\r\nleft=0\r\nright=0\r\nfor i in range(len(s)):\r\n if i<x and s[i]!='=':\r\n left+=int(s[i])*(x-i)\r\n if i>x and s[i]!='=':\r\n right+=int(s[i])*(i-x)\r\nprint(\"balance\" if left==right else \"left\" if left>right else \"right\")\r\n", "m=input()\r\nn = len(m)\r\nk,o=0,0\r\nfor i in range(n):\r\n if m[i]=='^':\r\n l=i\r\nfor i in range(l):\r\n if m[i].isdigit():\r\n k+=int(m[i])*(l-i)\r\nfor i in range(l,n):\r\n if m[i].isdigit():\r\n o+=int(m[i])*(i-l) \r\nif k==o:\r\n print('balance')\r\nelif k>o:\r\n print('left')\r\nelse:\r\n print('right')\r\n ", "s = input()\r\nr = s.index(\"^\")\r\nsum = 0\r\nfor i in range(len(s)):\r\n if s[i] != \"=\" and s[i] != \"^\":\r\n sum += int(s[i]) * (i - r)\r\nif sum < 0:\r\n print(\"left\")\r\nelif sum > 0:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s = input().split(\"^\")\nl = s[0]\nr = s[1]\n\nl = l[::-1]\nl_v = 0\nr_v = 0\n\nfor index in range(0, len(l)):\n if l[index] != \"=\":\n l_v += int(l[index]) * (index + 1)\n\nfor index in range(0, len(r)):\n if r[index] != \"=\":\n r_v += int(r[index]) * (index + 1)\n\n\nif l_v == r_v:\n print(\"balance\")\nelif l_v > r_v:\n print(\"left\")\nelse:\n print(\"right\")\n \n \t \t\t\t \t\t \t\t\t \t \t \t\t\t \t\t", "def calc_weight(s):\r\n w = 0\r\n for i, v in enumerate(s):\r\n if v != \"=\":\r\n w += (i+1)*int(v)\r\n return w\r\nl, r = input().split(\"^\")\r\na, b = calc_weight(l[::-1]), calc_weight(r)\r\n\r\nif a == b:\r\n print(\"balance\")\r\nelif a < b:\r\n print(\"right\")\r\nelse:\r\n print(\"left\")\r\n", "a = input()\r\ni = 0\r\nr = 0\r\nl = 0\r\nwhile(a[i] != \"^\"):\r\n i = i+1\r\nk = i\r\nfor j in range(i):\r\n if(a[j]!= \"=\"):\r\n l = l +k*int(a[j])\r\n k = k-1\r\nk = 1\r\ni +=1\r\nwhile(i<len(a)):\r\n if(a[i]!= \"=\"):\r\n r = r+k*int(a[i])\r\n i = i+1\r\n k = k+1\r\n\r\nif(r==l):\r\n print(\"balance\")\r\nelif(l>r):\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\ns = input()\r\nind = s.index('^')\r\nsum =0 \r\nfor i in range(len(s)) :\r\n if s[i] != '=' and s[i] != '^':\r\n sum+= int(s[i])*(i-ind) \r\nif sum == 0 : print('balance') \r\nelif sum<0 : print('left')\r\nelse : print('right')\r\n", "from sys import stdin\r\nx=stdin.readline().rstrip()\r\nx=[x for x in x]\r\nmid=x.index(\"^\")\r\nans=0\r\nfor i in range(len(x)):\r\n if x[i]!='^' and x[i]!=\"=\":\r\n if i<mid:\r\n ans+=int(x[i])*(mid-i)\r\n else:\r\n ans-=int(x[i])*(i-mid)\r\nif ans>0:\r\n print(\"left\")\r\nelif ans<0:\r\n print(\"right\")\r\nelse:print(\"balance\") \r\n\r\n", "s=input()\nfor i in range(len(s)):\n\tif s[i]==\"^\":\n\t\tpivot=i\n\t\tbreak\nleft,right=0,0\nfor i in range(pivot-1, -1, -1):\n\tif(s[i]!=\"=\"):\n\t\tleft+= (pivot-i)*int(s[i])\nfor i in range(pivot+1, len(s)):\n\tif(s[i]!=\"=\"):\n\t\tright+= (i-pivot)*int(s[i])\nif left>right:\n\tprint(\"left\")\nelif left<right:\n\tprint(\"right\")\nelse:\n\tprint(\"balance\")\n\n", "__author__ = 'asmn'\r\ns=input()\r\npivot=s.find('^')\r\nres=sum(map(lambda i_x:int(i_x[1])*(i_x[0]-pivot) if i_x[1].isdigit() else 0,enumerate(s)))\r\nprint('left' if res<0 else 'right' if res>0 else 'balance')", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n(17+n)//n < 4.5\r\n\r\nn, k = MII()\r\na = LII()\r\ns = sum(a)\r\n\r\nans = 0\r\nif round(s/n) == k:\r\n Pass\r\nelif round(s/n) > k:\r\n while round(s/n) > k:\r\n s += 1\r\n n += 1\r\n ans += 1\r\nelse:\r\n while round(s/n) < k:\r\n s += k\r\n n += 1\r\n ans += 1\r\n\r\nprint(ans)\r\n'''\r\n\r\ndef solve():\r\n s = I().strip()\r\n idx = s.index('^')\r\n l_sum = 0\r\n r_sum = 0\r\n\r\n for i, num in enumerate(s[:idx][::-1]):\r\n if num.isdigit():\r\n l_sum += (i+1) * int(num)\r\n for i, num in enumerate(s[idx+1:]):\r\n if num.isdigit():\r\n r_sum += (i+1) * int(num)\r\n \r\n if l_sum == r_sum:\r\n print('balance')\r\n else:\r\n print('left' if l_sum > r_sum else 'right')\r\n\r\nsolve()", "def lever_balance(s):\r\n pivot = s.index(\"^\")\r\n left_weight = 0\r\n right_weight = 0\r\n for i in range(pivot):\r\n if s[i] != \"=\":\r\n left_weight += int(s[i]) * (pivot - i)\r\n for i in range(pivot+1, len(s)):\r\n if s[i] != \"=\":\r\n right_weight += int(s[i]) * (i - pivot)\r\n if left_weight == right_weight:\r\n return \"balance\"\r\n elif left_weight > right_weight:\r\n return \"left\"\r\n else:\r\n return \"right\"\r\n\r\ns = input()\r\nprint(lever_balance(s))\r\n", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n\r\ns=input().strip()\r\n\r\nindex=0\r\nfor i in range(len(s)):\r\n if(s[i]=='^'):\r\n index=i\r\n break\r\ni=0\r\nl=0\r\nwhile(s[i]!='^'):\r\n if(s[i]!='='):\r\n l+=(int(s[i])*(index-i))\r\n i+=1\r\nr=0\r\ni+=1\r\nwhile(i!=len(s)):\r\n if(s[i]!='='):\r\n r+=(int(s[i])*(i-index))\r\n i+=1\r\nif(l==r):\r\n print(\"balance\")\r\nelif(l>r):\r\n print(\"left\")\r\nelif(r>l):\r\n print(\"right\")\r\n \r\n", "def solve(s):\r\n res = 0\r\n m = s.index('^')\r\n for i in range(len(s)):\r\n if(s[i].isalnum()):\r\n res+=int(s[i])*(i-m)\r\n if(res==0):\r\n return(\"balance\")\r\n elif(res>0):\r\n return(\"right\")\r\n else:\r\n return(\"left\")\r\nprint(solve(input()))\r\n", "s = str(input())\r\npivot = int(0)\r\n\r\nfor x in s :\r\n if x == '^' :\r\n break\r\n else :\r\n pivot+=1\r\nleft = int(0)\r\nright = int(0)\r\nl = 1\r\nfor i in range(pivot-1,-1,-1) :\r\n if s[i] == '=' :\r\n l+=1\r\n continue\r\n else :\r\n left += (int(s[i]) * l)\r\n l +=1\r\nl = 1\r\nfor i in range(pivot+1,int(len(s))) :\r\n if s[i] == '=' :\r\n l +=1\r\n continue\r\n else :\r\n right += (int(s[i]) * l)\r\n l +=1\r\nif right == left :\r\n print(\"balance\")\r\nelif right > left :\r\n print(\"right\")\r\nelse :\r\n print(\"left\")\r\n", "s = list(input())\r\n\r\nind = s.index(\"^\")\r\n\r\nleft = 0\r\nright = 0\r\n\r\nrig = False\r\n\r\nfor i, char in enumerate(s):\r\n if char == \"^\":\r\n rig = True\r\n if char.isdigit() and not rig:\r\n left += int(char) * (ind-i)\r\n elif char.isdigit() and rig:\r\n right += int(char) * (i-ind)\r\n\r\nif left == right:\r\n print(\"balance\")\r\nelif left < right:\r\n print(\"right\")\r\nelse:\r\n print(\"left\")\r\n", "lever = input()\r\nbp = 0\r\nlweights = []\r\nrweights = []\r\nltw = 0\r\nrtw = 0\r\nnumbers = ['1','2','3','4','5','6','7','8','9']\r\nfor i in range(0, len(lever)):\r\n if lever[i] == '^':\r\n bp = i\r\n break\r\nfor i in range(0 - bp, len(lever) - bp):\r\n if lever[i + bp] in numbers:\r\n if i < 0:\r\n lweights.append(int(lever[i + bp]) * (i * (-1)))\r\n else: \r\n rweights.append(int(lever[i + bp]) * i)\r\n\r\nfor i in range(0, len(lweights)):\r\n ltw += lweights[i]\r\nfor i in range(0, len(rweights)):\r\n rtw += rweights[i]\r\n\r\nif ltw < rtw:\r\n print(\"right\")\r\nelif rtw < ltw:\r\n print(\"left\")\r\nelse:\r\n print(\"balance\")\r\n", "s=input()\r\nl=len(s)\r\ni=0\r\nwhile i<l:\r\n if s[i]==\"^\":\r\n break\r\n i=i+1\r\nn=i+1\r\ns_r=0\r\nwhile n<l:\r\n if s[n]!=\"=\":\r\n s_r=s_r+(int(s[n]))*(n-i)\r\n n=n+1\r\nm=i-1\r\ns_l=0\r\nwhile m>=0:\r\n if s[m]!=\"=\": \r\n s_l=s_l+(int(s[m]))*(i-m)\r\n m=m-1\r\nif (s_l>s_r):\r\n print(\"left\")\r\nelif (s_r>s_l):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n", "a = input()\r\nt = a.index(\"^\")\r\nt1 = 0\r\nt2 = 0\r\nfor i in range(t):\r\n\tif ord(a[i]) >= 48 and ord(a[i]) <= 57:\r\n\t\tk = (int(a[i])*(t-i))\r\n\t\tt1 = t1 + k \r\nfor i in range(len(a)-1,t,-1):\r\n\tif ord(a[i]) >= 48 and ord(a[i]) <= 57:\r\n\t\tk = (int(a[i])*(i-t))\r\n\t\tt2 = t2 + k \r\nif t2 > t1:\r\n\tprint(\"right\")\r\nelif t1>t2:\r\n\tprint(\"left\")\r\nelse:\r\n\tprint(\"balance\")", "s = input()\r\nf = 0\r\nr,l = 0,0\r\np = s.index('^')\r\nfor i in range(len(s)):\r\n if(s[i] == '^'):\r\n f = 1\r\n continue\r\n \r\n if(f):\r\n if(s[i] != '='):\r\n r += (i - p) * (int(s[i]))\r\n\r\n elif(f==0):\r\n if(s[i] != '='):\r\n l += (p - i) * (int(s[i]))\r\n\r\nif(r == l):\r\n print('balance')\r\nelif(r > l):\r\n print('right')\r\nelse:\r\n print('left')\r\n \r\n", "s = input()\r\n\r\npivot = s.index('^')\r\n\r\nleft = s[:pivot]\r\nright = s[pivot+1:]\r\n\r\nleft_total = 0\r\nright_total = 0\r\n\r\nfor l in range(len(left)):\r\n if left[l] != '=':\r\n left_total += (pivot - l) * int(left[l])\r\n\r\n# need to fix this\r\nfor r in range(len(right)):\r\n if right[r] != '=':\r\n right_total += (r + 1) * int(right[r])\r\n\r\nif left_total == right_total:\r\n print('balance')\r\nelif left_total > right_total:\r\n print('left')\r\nelse:\r\n print('right')\r\n", "s = input()\r\nl=0\r\nr=0\r\nif s[0]==\"^\":\r\n print(\"right\")\r\nelif s[len(s)-1]==\"^\":\r\n print(\"left\")\r\nelse:\r\n g = s.index(\"^\")\r\n for i in range(g):\r\n if s[i]!=\"=\":\r\n l+=int(s[i])*(g-i)\r\n for i in range(g+1,len(s)):\r\n if s[i]!=\"=\":\r\n r+=int(s[i])*(i-g)\r\n #print(l,r)\r\n if l>r:\r\n print(\"left\")\r\n elif r>l:\r\n print(\"right\")\r\n else:\r\n print(\"balance\")", "from sys import stdin\n\ndef read_lines(sep=' ', input_type=None):\n #list of rows\n _lines = stdin.readlines()\n cast = input_type is not None\n lines = []\n for line in _lines:\n line = line[:-1].split(sep)\n if cast:\n line = [input_type(x) for x in line]\n lines.append(line)\n return lines\n\nif __name__ == '__main__':\n\n lines = read_lines(input_type=None)\n \n string = lines[0][0]\n \n LEVER_SENTINEL= '^'\n i_lever = None\n for i,s in enumerate(string):\n if s == LEVER_SENTINEL:\n i_lever = i\n break\n \n balance = 0\n for i,s in enumerate(string):\n if s.isnumeric():\n balance+=(i_lever-i)*int(s)\n\n \n if balance<0:\n print(\"right\")\n elif balance>0:\n print(\"left\")\n else:\n print(\"balance\")\n \n \n \n \n ", "right_momentum = 0\r\nleft_momentum = 0\r\n\r\nright_mass = 0\r\nleft_mass = 0\r\n\r\nstr1 = str(input())\r\n\r\ni = 0\r\nj = len(str1) - 1\r\n\r\nwhile str1[i] != '^':\r\n if str1[i] == '=':\r\n i += 1\r\n else:\r\n left_mass += int(str1[i])\r\n i += 1\r\n left_momentum += left_mass\r\n\r\nwhile str1[j] != '^':\r\n if str1[j] == '=':\r\n j -= 1\r\n else:\r\n right_mass += int(str1[j])\r\n j -= 1\r\n right_momentum += right_mass\r\n\r\nif right_momentum == left_momentum:\r\n print('balance')\r\nelif right_momentum > left_momentum:\r\n print('right')\r\nelse:\r\n print('left')", "s = input()\r\nleft, right = 0, 0\r\nx = s.index('^')\r\nfor i in range(x):\r\n if s[i].isdigit():\r\n left += int(s[i]) * abs(x - i)\r\nfor i in range(x, len(s)):\r\n if s[i].isdigit():\r\n right += int(s[i]) * abs(x - i)\r\nif left == right:\r\n print('balance')\r\nif left > right:\r\n print('left')\r\nif right > left:\r\n print('right')\r\n", "left, right = input().split(\"^\")\nleft = left[::-1]\nleft_weight, right_weight = 0, 0\n\nfor i in range(len(left)):\n if(left[i] != \"=\"):\n left_weight += int(left[i]) * (i+1)\n\nfor i in range(len(right)):\n if(right[i] != \"=\"):\n right_weight += int(right[i]) * (i+1)\n\nif left_weight > right_weight:\n print(\"left\")\nelif right_weight > left_weight:\n print(\"right\")\nelse:\n print(\"balance\")\n", "s = input().split(\"^\")\r\nfirst=list(s[0]).copy()\r\nfirst.reverse()\r\nsecond=list(s[1]).copy()\r\n#print(first,second)\r\nleft=0\r\nright=0\r\nfor x in range(1,len(first)+1):\r\n if first[x-1]!=\"=\":\r\n left+=x*int(first[x-1])\r\nfor x in range(1,len(second)+1):\r\n if second[x-1]!=\"=\":\r\n right+=x*int(second[x-1])\r\nif left>right:\r\n print(\"left\")\r\nelif left==right:\r\n print(\"balance\")\r\nelse:\r\n print(\"right\")", "s= input()\ni= s.index('^')\na= s[:i]\nb= s[i+1:]\na= a[::-1]\nt= {'1', '2', '3', '4', '5', '6', '7', '8', '9'}\nleft, right= 0, 0\n\nfor j in range(len(a)):\n if a[j] in t:\n left += int(a[j])*(j+1)\nfor k in range(len(b)):\n if b[k] in t:\n right += int(b[k])*(k+1)\n\nif left == right:\n print('balance')\nelif left>right:\n print('left')\nelif left<right:\n print('right')\n\t \t\t\t \t\t \t\t\t \t \t\t\t \t \t", "a=input()\r\nd=''\r\nfor i in a:\r\n if i=='=':d+='0'\r\n else:d+=i\r\nd=d.split('^')\r\nb=0\r\nc=0\r\nfor i in range(1,len(d[0])+1):\r\n b+=i*int(d[0][-i])\r\nfor i in range(len(d[1])):\r\n c+=(i+1)*int(d[1][i])\r\nif b==c:print('balance')\r\nelif b>c:print('left')\r\nelse:print('right')", "s = input()\r\nc = s.find('^')\r\ntotal = 0\r\n\r\nfor i, w in enumerate(s):\r\n if w.isdigit():\r\n total += int(w)*(c-i)\r\n\r\nprint('left' if total>0 else 'right' if total<0 else 'balance')", "def solve(s1: str) -> str:\r\n s= list(s1.strip(\" \"))\r\n left=0\r\n right=0\r\n pivot=s.index(\"^\")\r\n for x in range(0,pivot):\r\n if s[x]!='=':\r\n left+=int(s[x])*(pivot-x)\r\n for x in range(pivot+1,len(s)):\r\n if s[x]!='=':\r\n right+=int(s[x])*(x-pivot)\r\n if left>right:\r\n return('left')\r\n elif right>left:\r\n return('right')\r\n else:\r\n return('balance')\r\ns1 = str(input())\r\nprint(solve(s1))\r\n \r\n", "# import sys\r\n# import math\r\n# import collections\r\n\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n# sys.stderr = (open('error.txt','w'))\r\n\r\ns = input()\r\nlever = s.index(\"^\")\r\n\r\nleft = right = 0\r\nfor i in range(lever):\r\n if s[i].isnumeric():\r\n left+=int(s[i])*(lever-i)\r\nfor i in range(lever+1, len(s)):\r\n if s[i].isnumeric():\r\n right+=int(s[i])*(i-lever)\r\n\r\nif left>right:\r\n print(\"left\")\r\nelif right>left:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s, fl, t = input(), 0, [0, 0]\r\nfor x in range(len(s)):\r\n if s[x] == '^': \r\n fl = x\r\n break\r\nfor x in range(fl - 1, -1, -1):\r\n if s[x] != '=': t[0] += (fl - x) * int(s[x])\r\nfor x in range(fl + 1, len(s)):\r\n if s[x] != '=': t[1] += (x - fl) * int(s[x])\r\nprint(\"left\") if t[0] > t[1] else (print(\"right\") if t[1] > t[0] else print(\"balance\"))", "s=input()\nl=len(s)\n\ncheck='123456789'\na=s.find('^')\nleft=0;right=0\nfor i in range(a):\n if s[i] in check:\n left+=(int(s[i])*abs(a-i))\nfor i in range(a,l):\n if s[i] in check:\n right+=(int(s[i])*abs(a-i))\n\nif left==right:\n print('balance')\nelif left>right:\n print('left')\nelse:\n print('right')\n", "lever = input()\r\nlevel = lever.find('^')\r\nleft, right = 0, 0\r\nfor k in range(level):\r\n left += (level - k) * int(lever[k]) if lever[k] != '=' else 0\r\n\r\nfor k in range(level + 1, len(lever)):\r\n right += (k - level) * int(lever[k]) if lever[k] != '=' else 0\r\n\r\nif left == right:\r\n print(\"balance\")\r\nelif left > right:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n", "s=input()\r\np=s.find(\"^\")\r\nr=0\r\nfor k,c in enumerate(s):\r\n if(str.isdigit(c)):\r\n r+=int(c)*(p-k)\r\n\r\nif(r==0):\r\n print(\"balance\")\r\nelif(r>0):\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = list(input()[:-1])\r\nx = s.index('^')\r\n\r\nc = sum([(i-x)*int(s[i]) for i in range(len(s)) if s[i].isdigit() == True])\r\nprint('left' if c < 0 else 'right' if c > 0 else 'balance')", "s = input().split(\"^\")\r\ns[0] = s[0][::-1]\r\nm = lambda k: sum((ord(s[k][i]) - ord(\"0\")) * (i + 1) for i in range(len(s[k])) if s[k][i] != \"=\")\r\na, b = m(0), m(1)\r\nprint(\"left\" if a > b else \"right\" if a < b else \"balance\")", "def weight(state):\n state = state.rstrip('=')\n return 0 if len(state) < 1 else \\\n sum(int(state[i]) * (i + 1) if state[i] != '=' else 0 for i in range(len(state)))\n\n\ndef main():\n [left, right] = input().split('^')\n left = left[::-1]\n (weight_left, weight_right) = (weight(left), weight(right))\n\n print('balance' if weight_left == weight_right else 'left' if weight_left > weight_right else 'right')\n\n\nif __name__ == '__main__':\n main()\n", "def solve(s):\n f_right = 0\n f_left = 0\n is_left = True\n e = s.find('^')\n for i,c in enumerate(s):\n if c == '^':\n is_left = False\n continue\n if c == '=':\n continue\n if is_left:\n f_left += (e-i)*int(c)\n else:\n f_right += (i-e)*int(c)\n\n if f_left > f_right :\n return 'left'\n if f_right > f_left:\n return 'right'\n return 'balance'\n\n \n\n \ndef main() :\n # n = int(input())\n # arr = list(map(int, input().split(' ')))\n # arr = []\n # for _ in range(4):\n # i = input()\n # arr.append(i)\n s = input()\n print(solve(s))\nmain()\n", "s=input()\r\nmid=s.index(\"^\")\r\nl=[\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"0\"]\r\nsum=0\r\nfor i in range(len(s)):\r\n if(s[i] in l):\r\n value=int(s[i])\r\n else:\r\n value=0\r\n sum=sum+value*(i-mid)\r\nif(sum==0):\r\n print(\"balance\")\r\nelif(sum<0):\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "#import math\r\n\r\n#n, m = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#n, m, k = input().split()\r\n#n = int (n)\r\n#m = int (m)\r\n#k = int (k)\r\n#n = int(input())\r\n#m = int(input())\r\ns = input()\r\n#t = input()\r\n#k = list(map(int, input().split()))\r\n#print(l)\r\n#c = list(map(int, input().split()))\r\n\r\n#x1, y1, x2, y2 =map(int,input().split())\r\n#n = int(input())\r\n#f = []\r\n#t = [0]*n\r\n#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]\r\n#f = sorted (f, key = lambda tup: tup[0] )\r\n\r\n#h = [\"\"] * n\r\n#f1 = sorted(f, key = lambda tup: tup[0])\r\n\r\n\r\n#f1 = sorted(t, key = lambda tup: tup[0])\r\nfor i in range (len(s)):\r\n if ( s[i] == '^'):\r\n p = i\r\npl = 1\r\nsl = 0\r\nwhile (p - pl>= 0):\r\n if (s[p-pl] != '='):\r\n sl += pl * int(s[p-pl])\r\n pl += 1\r\npr = 1\r\nsr = 0\r\nwhile (p +pr < len(s)):\r\n if (s[p+pr] != '='):\r\n sr += pr * int(s[p+pr])\r\n pr += 1\r\nif (sr == sl):\r\n print(\"balance\")\r\nelif (sr > sl):\r\n print(\"right\")\r\nelse:\r\n print(\"left\")\r\n", "s = [d for d in input()]\r\n\r\nw = [0,0]\r\np = s.index(\"^\")\r\nd = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"^\":\r\n d = 1\r\n elif s[i] == \"=\":\r\n continue\r\n else:\r\n w[d] += int(s[i]) * abs(p-i)\r\n\r\nif w[0] == w[1] :\r\n print(\"balance\")\r\nelif w[0] > w[1]:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "s=input()\r\nn=len(s)\r\nleft=0\r\nright=0\r\np=s.index('^')\r\nl=[]\r\nr=[]\r\nfor i in range(0,p):\r\n l.append(s[i])\r\nfor i in range(p+1,n):\r\n r.append(s[i])\r\n\r\nfor i in range(0,len(l)):\r\n if l[i]!=\"=\":\r\n left=left+(int(l[i])*(p-i))\r\n\r\nfor i in range(0,len(r)):\r\n if r[i]!='=':\r\n ind=i+1\r\n right+=(int(r[i])*ind)\r\nif left>right:\r\n print('left')\r\nelif right>left:\r\n print('right')\r\nelse:\r\n print('balance')\r\n", "mid = 0\ndef main():\n def f(a):\n x = []\n for i in range(len(a)):\n if a[i] == '=':\n x.append(0)\n else:\n x.append(int((i + 1) * int(a[i])))\n return sum(x)\n s = input().split('^')\n mid = len(s[0])\n left = list(map(f, [list(reversed(s[0]))]))[0]\n right = list(map(f, [s[1]]))[0]\n if left == right:\n return \"balance\"\n elif left < right:\n return \"right\"\n return \"left\"\n\nprint(main())\n", "l1=list(input())\r\nx=l1.index('^')\r\nflag=0\r\nbalance=0\r\nfor i in range(len(l1)):\r\n if i==x:\r\n continue\r\n if l1[i]!='=':\r\n if i<x:\r\n balance+=int(l1[i])*(x-i)\r\n else :\r\n balance-=int(l1[i])*(i-x)\r\nif balance>0:\r\n print(\"left\")\r\nelif balance==0:\r\n print(\"balance\")\r\nelse :\r\n print(\"right\")", "x=input()\nind=x.index(\"^\")\n\nw1=x[0:ind]\nw2=x[ind+1:]\n\nleft=0\nright=0\nfor i in range (0,ind):\n if (x[i]== \"=\"):\n left+=0\n else:\n left+=(int(x[i]))*(ind-i)\n\nfor j in range (ind+1,len(x)):\n if (x[j]==\"=\"):\n right+=0\n else:\n right+=(int(x[j]))*(j-ind)\n\nif (left>right):\n print (\"left\")\nif (left<right):\n print (\"right\")\nif (left==right):\n print (\"balance\")\n \n", "lev=input()\r\nindex=0\r\nflag=0\r\nbase=0\r\nleft=0\r\nright=0\r\nfor i in range(len(lev)):\r\n if lev[i]==\"^\":\r\n index=i\r\n flag=1\r\n base=0\r\n elif flag==0:\r\n if lev[i]!=\"=\":\r\n base+=int(lev[i])\r\n left+=base\r\n elif flag==1:\r\n if lev[i]!=\"=\":\r\n right+=int(lev[i])*(i-index)\r\nif right >left :\r\n print(\"right\")\r\nelif left > right:\r\n print(\"left\")\r\nelse:\r\n print(\"balance\")\r\n\r\n", "r = input()\r\nr = r.replace('=','0')\r\nleft,right = r.split('^')\r\nleft = left[::-1]\r\n\r\ngetsum = lambda arr: sum([int(arr[i])*(i+1) for i in range(len(arr))])\r\nlim = getsum(left)-getsum(right)\r\nif lim >0:\r\n print('left')\r\nelif lim == 0:\r\n print('balance')\r\nelse:\r\n print('right')", "n=input()\r\ny=n.rfind(\"^\")+1\r\nl=n[:y-1]\r\nl=l[::-1]\r\nr=n[y:]\r\nlhs=0\r\nrhs=0\r\nfor i in range(len(l)):\r\n if l[i]==\"=\":\r\n continue\r\n else:\r\n lhs+=int(l[i])*(i+1)\r\nfor i in range(len(r)):\r\n if r[i]==\"=\":\r\n continue\r\n else:\r\n rhs+=int(r[i])*(i+1)\r\nif lhs==rhs:\r\n print(\"balance\")\r\nelif lhs>rhs:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n\r\n", "l=list(input())\r\na=l.index(\"^\")\r\nq,r=0,0\r\nfor x in range(len(l)):\r\n\tif x<a and l[x]!=\"=\":q+=int(l[x])*(a-x)\r\n\telif x>a and l[x]!=\"=\":r+=int(l[x])*(x-a)\r\nif q<r:print(\"right\")\r\nelif q>r:print(\"left\")\r\nelse:print(\"balance\")", "s=list(input())\r\nmid=0\r\nsu=0\r\nfor i in range(len(s)):\r\n\tif s[i]=='^':\r\n\t\tmid=i\r\n\t\tbreak\r\nfor i in range(len(s)):\r\n\tif s[i]!='^' and s[i]!='=':\r\n\t\tsu+=(int(s[i])*(i-mid))\r\nif su==0:\r\n\tprint('balance')\r\nelif su<0:\r\n\tprint('left')\r\nelse:\r\n\tprint('right')", "s=input()\r\ns=list(s)\r\nt1=s.index('^')\r\nt2,t3=0,0\r\nfor i in range(len(s)):\r\n if i<t1 and s[i]!='=':\r\n s[i]=int(s[i])*(abs(t1-i))\r\n t2+=s[i]\r\n elif i>t1 and s[i]!='=':\r\n s[i]=int(s[i])*(abs(t1-i))\r\n t3+=s[i]\r\nif t2<t3:print('right')\r\nelif t2>t3:print('left')\r\nelse:print('balance')\r\n", "s=input()\r\ns1=0\r\nsum1=0\r\nsum2=0\r\nfor i in range(len(s)): \r\n if ord(s[i])==94:\r\n s1=i\r\n\r\nfor j in range(0,s1+1):\r\n if ord(s[j])>=49 and ord(s[j])<=57:\r\n sum1=sum1+(int(s[j])*(s1-j))\r\n\r\nfor k in range(s1+1,len(s)): \r\n if ord(s[k])>=49 and ord(s[k])<=57:\r\n sum2=sum2+(int(s[k])*(k-s1))\r\n\r\nif sum1==sum2:\r\n print(\"balance\")\r\nelse:\r\n if sum1>sum2:\r\n print(\"left\")\r\n else:\r\n print(\"right\") ", "a=input().split('^')\r\nleft=0\r\nright=0\r\nfor i in range(len(a[0])):\r\n if(a[0][i]!='='):\r\n left+=int(a[0][i])*(len(a[0])-i)\r\nfor i in range(len(a[1])):\r\n if(a[1][i]!='='):\r\n right+=int(a[1][i])*(i+1)\r\nif(left>right): print('left')\r\nelif(left<right): print('right')\r\nelse: print('balance')\r\n\r\n", "s = input().split('^')\r\nleft, right = 0, 0\r\nfor i in range(len(s[0])):\r\n if s[0][i]!='=':\r\n left += int(s[0][i])*(len(s[0])-i)\r\nfor i in range(len(s[1])):\r\n if s[1][i]!='=':\r\n right += int(s[1][i])*(i+1)\r\nprint([['left','right'][right>left],'balance'][left==right])\r\n", "s = input()\r\np = s.index('^')\r\nf = 0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n f = f-((p-i)*1)\r\n elif s[i]=='2':\r\n f = f - ((p-i)*2)\r\n elif s[i]=='3':\r\n f = f - ((p-i)*3)\r\n elif s[i]=='4':\r\n f = f - ((p-i)*4)\r\n elif s[i]=='5':\r\n f = f - ((p-i)*5)\r\n elif s[i]=='6':\r\n f = f - ((p-i)*6)\r\n elif s[i]=='7':\r\n f = f - ((p-i)*7)\r\n elif s[i]=='8':\r\n f = f - ((p-i)*8)\r\n elif s[i]=='9':\r\n f = f - ((p-i)*9)\r\nif f<0:\r\n print(\"left\")\r\nelif f>0:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "n = list(input())\r\nm = n.index('^')\r\nleft,right = 0,0\r\n\r\nfor i in range(m):\r\n if n[i] != \"=\":\r\n left += (m-i) * int(n[i])\r\n \r\nfor i in range(m+1, len(n)):\r\n if n[i] != \"=\":\r\n right += (i-m) * int(n[i])\r\n \r\nif left==right:\r\n print(\"balance\")\r\nelif left>right:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "n = input()\r\na=[]\r\nfor i in range(len(n)):\r\n if(n[i]=='^'):\r\n break\r\n else:\r\n a.append(n[i])\r\na.reverse()\r\n\r\nb=[]\r\nwhile(i<len(n)-1):\r\n i+=1\r\n if(n[i]=='^'):\r\n break\r\n else:\r\n b.append(n[i])\r\n\r\n#print(a)\r\n#print(b)\r\n\r\nf1 = 0\r\nf2 = 0\r\n\r\nfor i in range(len(a)):\r\n if(a[i]!='='):\r\n f1+=int(a[i])*(i+1)\r\n\r\nfor i in range(len(b)):\r\n if(b[i]!='='):\r\n f2+=int(b[i])*(i+1)\r\n\r\n#print(f1, f2)\r\nif(f1==f2):\r\n print('balance')\r\nelif(f1>f2):\r\n print('left')\r\nelse:\r\n print('right')", "sum=0\r\nseq=input()\r\nind=seq.index(\"^\")\r\nfor i in range(len(seq)):\r\n if seq[i].isdigit():\r\n sum+=(ind-i)*int(seq[i])\r\nif sum==0:\r\n print(\"balance\")\r\nelif sum>0:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "s = input()\r\nf = s.index('^')\r\n\r\nleft = 0\r\nright = 0\r\nfor i in range(f - 1, -1 , - 1):\r\n if s[i] == '=':\r\n pass\r\n else:\r\n left += abs(f - i) * int(s[i])\r\n\r\nfor i in range(f + 1, len(s)):\r\n if s[i] == '=':\r\n pass\r\n else:\r\n right += abs(i - f) * int(s[i])\r\n\r\nif left > right:\r\n print('left')\r\nelif right > left:\r\n print('right')\r\nelse:\r\n print('balance')", "# a brute force implementation\r\nlever = input(); Right = True\r\nmassR,massL = [],[]; fulcrum = 0 \r\nfor i,j in enumerate(lever):\r\n if j != '=':\r\n if j == '^':\r\n fulcrum = i\r\n Right = False\r\n else:\r\n if Right:\r\n massR.append((int(j),i))\r\n else:\r\n massL.append((int(j),i))\r\nsumR,sumL = 0,0\r\nfor m in massR:\r\n sumR += abs(fulcrum-m[1])*m[0]\r\nfor m in massL:\r\n sumL += abs(fulcrum-m[1])*m[0]\r\nif sumL>sumR:\r\n print('right')\r\nelif sumR>sumL:\r\n print('left')\r\nelse:\r\n print('balance')\r\n ", "x = input()\r\np = x.find('^')\r\nle = 0\r\nri = 0\r\nfor i in range(len(x)):\r\n if x[i] != '=' and x[i] != '^':\r\n if (p-i) > 0:\r\n le += (p-i)*int(x[i])\r\n elif (p-i) < 0:\r\n ri += abs(p-i)*int(x[i])\r\nif le < ri:\r\n print('right')\r\nelif le > ri:\r\n print('left')\r\nelif le == ri:\r\n print('balance')", "s=input()\r\nz=s.find('^')\r\na=s[:z]\r\nb=s[z+1:]\r\nx='123456789'\r\ns1=0\r\ns2=0\r\nif set(a)==set(b) and set(a)=={'='}:\r\n\tprint(\"balance\")\r\nelse:\r\n\tfor i in range(len(a)):\r\n\t\tif a[i] in x:\r\n\t\t\ts1+=int(a[i])*(len(a)-i)\r\n\tfor j in range(len(b)):\r\n\t\tif b[j] in x:\r\n\t\t\ts2+=int(b[j])*(j+1)\r\n\tif s1==s2:\r\n\t\tprint(\"balance\")\r\n\telif s1>s2:\r\n\t\tprint(\"left\")\r\n\telse:\r\n\t\tprint(\"right\")", "n=input()\r\nx=n.index(\"^\")\r\nc=0\r\nfor i in range(len(n)):\r\n if n[i]!=\"=\" and n[i]!=\"^\":\r\n c+=(x-i)*int(n[i])\r\nif c<0:\r\n print(\"right\")\r\nelif c>0:\r\n print(\"left\")\r\nelse:\r\n print(\"balance\")", "s = input()\r\npi = s.index('^')\r\nl = r = flag = 0\r\nfor ind, i in enumerate(s):\r\n if i == '^':\r\n flag = 1\r\n if i.isdigit():\r\n if not flag:\r\n l += (pi - ind) * int(i)\r\n else:\r\n r += (ind - pi) * int(i)\r\nif l > r:\r\n print(\"left\")\r\nelif r > l:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n", "s = input()\r\npivot_index = s.find(\"^\")\r\nleft_weight =0\r\nright_weight=0\r\nfor i in range(len(s)):\r\n\tif(s[i].isdigit()):\r\n\t\tif(pivot_index-i>0):\r\n\t\t\tleft_weight+=int(s[i])*(pivot_index-i)\r\n\t\telse:\r\n\t\t\tright_weight+=int(s[i])*(i-pivot_index)\r\nif(left_weight==right_weight):\r\n\tprint(\"balance\")\r\nelif(left_weight>right_weight):\r\n\tprint(\"left\")\r\nelse:\r\n\tprint(\"right\")", "t = input()\r\ns, k = 0, t.find('^')\r\nfor i, j in enumerate(t[: k]):\r\n if j != '=': s += int(j) * (k - i)\r\nfor i, j in enumerate(t[k + 1: ], 1):\r\n if j != '=': s -= int(j) * i\r\nif s > 0: print('left')\r\nelif s < 0: print('right')\r\nelse: print('balance')", "s=input().strip()\r\nl=0\r\nr=0\r\nfor i in range(len(s)):\r\n if s[i]=='^': p=i\r\nfor i in range(len(s)):\r\n if '1'<=s[i]<='9':\r\n if i>p:\r\n r+=int(s[i])*(i-p)\r\n else:\r\n l+=int(s[i])*(p-i)\r\nif l>r:\r\n print('left')\r\nelif l==r:\r\n print('balance')\r\nelse:\r\n print('right')", "inputt=str(input())\r\nleft=0\r\nright=0\r\npivot=inputt.index('^')\r\nfor j in range(len(inputt)):\r\n if j<pivot:\r\n if inputt[j]!='=':\r\n left+=(int(inputt[j])*(pivot-j))\r\n if j>pivot:\r\n if inputt[j]!='=':\r\n right+=(int(inputt[j])*(j-pivot))\r\nif left>right:\r\n print('left')\r\nelif right>left:\r\n print('right')\r\nelse:\r\n print('balance')", "n = input()\r\nN = n.split(\"^\")\r\nL = N[0][::-1]\r\nR = N[1]\r\nl = len(L)\r\nSL = 0\r\ni = 1\r\nwhile(i <= l):\r\n if(L[i-1]!=\"=\"):\r\n SL+=i*int(L[i-1])\r\n i+=1\r\nr = len(R)\r\nSR = 0\r\nj = 1\r\nwhile(j <= r):\r\n if(R[j-1]!=\"=\"):\r\n SR+=j*int(R[j-1])\r\n j+=1\r\nif(SL>SR):\r\n print(\"left\")\r\nelif(SL<SR):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "inputs = input()\r\nx = inputs.find(\"^\")\r\nsum = 0\r\nfor index, chara in enumerate(inputs):\r\n if index < x and not (chara == \"=\" or chara == \"^\"):\r\n sum = sum + int(chara) * (index - x)\r\n elif index > x and not (chara == \"=\" or chara == \"^\"):\r\n sum = sum - int(chara) * (x - index)\r\n\r\nif sum < 0:\r\n print(\"left\")\r\nelif sum > 0:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "left, right = input().split('^')\r\n# print(left, right)\r\nl = r = 0\r\nfor i,e in enumerate(left[::-1]):\r\n if e != '=':\r\n l += int(e)*(i+1)\r\nfor i,e in enumerate(right):\r\n if e != '=':\r\n r += int(e)*(i+1)\r\n# print(l,r)\r\nif l == r:\r\n print(\"balance\")\r\nelif l > r:\r\n print(\"left\")\r\nelse:\r\n print('right')", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n A = []\r\n for i in range(n):\r\n if s[i] == '^':\r\n pivot = i\r\n val = 0\r\n for i in range(n):\r\n if s[i].isdigit():\r\n val += (ord(s[i]) - ord('0')) * (i - pivot)\r\n if val == 0:\r\n print('balance')\r\n elif val < 0:\r\n print('left')\r\n elif val > 0:\r\n print('right')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nleft = right = 0\r\na = s.index(\"^\")\r\nfor i in range(a):\r\n\tif s[i]!=\"=\":\r\n\t\tleft+=(a-i)*int(s[i])\r\nfor i in range(a+1, len(s)):\r\n\tif s[i]!=\"=\":\r\n\t\tright+=(i-a)*int(s[i])\r\nif left==right:\r\n\tprint(\"balance\")\r\nelif left>right:\r\n\tprint(\"left\")\r\nelse:\r\n\tprint(\"right\")", "def main_function():\r\n s = input()\r\n left_side = 0\r\n for i in range(len(s)):\r\n if s[i] == \"^\":\r\n korea = i\r\n break\r\n for i in range(len(s)):\r\n if s[i].isnumeric():\r\n left_side += (korea - i) * int(s[i])\r\n if left_side == 0:\r\n return \"balance\"\r\n elif left_side > 0:\r\n return \"left\"\r\n else:\r\n return \"right\"\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n", "s = input().replace(\"=\",\"0\")\r\nfi = list(map(int,list(s[:s.find(\"^\")])))\r\nsec = list(map(int,list(s[s.find(\"^\")+1:])))\r\nn = len(fi)\r\nfi2 = [fi[i]*(n-i) for i in range(n)]\r\nn = len(sec)\r\nsec2 = [sec[i]*(i+1) for i in range(n)]\r\nans = sum(fi2) - sum(sec2)\r\nif ans == 0:\r\n print(\"balance\")\r\nelif ans < 0:\r\n print(\"right\")\r\nelse:\r\n print(\"left\")\r\n", "lever=list(input())\r\npivot=lever.index(\"^\")\r\nleft,right=0,0\r\nfor i in range(len(lever)):\r\n\tif i<pivot and lever[i]!=\"=\":left+=int(lever[i])*(pivot-i)\r\n\telif i>pivot and lever[i]!=\"=\":right+=int(lever[i])*(i-pivot)\r\nif left<right:print(\"right\")\r\nelif right<left:print(\"left\")\r\nelse:print(\"balance\")", "s = input()\r\ndistance = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"^\":\r\n lever_pos = i\r\n\r\npos = lever_pos - 1\r\nleft_mom = 0\r\nwhile pos>=0:\r\n if s[pos] not in (\"^\", \"=\"):\r\n left_mom += int(s[pos]) * (lever_pos-pos)\r\n pos -= 1\r\n\r\npos = lever_pos + 1\r\nright_mom = 0\r\nwhile pos<len(s):\r\n if s[pos] not in (\"^\", \"=\"):\r\n right_mom += int(s[pos]) * (pos-lever_pos)\r\n pos += 1\r\n\r\nif left_mom>right_mom:\r\n print(\"left\")\r\nelif right_mom>left_mom:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n", "s=input()\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i]=='^': \r\n x=i\r\n break\r\na=b=0\r\nfor i in range(x):\r\n if s[i]>='1' and s[i]<='9': a+=(int(s[i])-int('0'))*(x-i)\r\nfor i in range(x,n):\r\n if s[i]>='1' and s[i]<='9': b+=(int(s[i])-int('0'))*(i-x)\r\nif a==b: print('balance')\r\nelse: print('left' if a>b else 'right')\r\n", "s = input()\r\ncnt = s.index('^')\r\nleft, right = 0, 0\r\nfor i in s:\r\n if i == '^':\r\n break\r\n if i == '=':\r\n cnt -= 1\r\n continue\r\n left += int(i)*cnt\r\n cnt -= 1\r\ncnt = 1\r\nfor i in range(s.index('^')+1, len(s)):\r\n if s[i] == '=':\r\n cnt += 1\r\n continue\r\n right += int(s[i])*cnt\r\n cnt += 1\r\nif right == left:\r\n print(\"balance\")\r\nif right > left:\r\n print(\"right\")\r\nif left > right:\r\n print(\"left\")", "left, right = [i for i in input().split('^')]\r\nright = right[::-1]\r\n\r\nld = 0\r\nrd = 0\r\n\r\nfor i in range(len(left)):\r\n if left[i] != '=':\r\n ld += int(left[i]) * (len(left) - i)\r\n\r\nfor i in range(len(right)):\r\n if right[i] != '=':\r\n rd += int(right[i]) * (len(right) - i)\r\n\r\nif ld > rd:\r\n print('left')\r\nelif rd > ld:\r\n print('right')\r\nelse:\r\n print('balance')", "s=input()\r\nn=len(s)\r\nk=0\r\nfor i in range(n):\r\n if(s[i]==\"^\"):\r\n k=i+1\r\n break\r\nleft=0\r\nright=0\r\nfor i in range(n):\r\n if(s[i]>=\"1\" and s[i]<=\"9\"):\r\n if(k-(i+1)>0):\r\n left=left+(int(s[i])*(k-i-1))\r\n else:\r\n right+=(int(s[i])*abs(k-i-1))\r\nif(left>right):\r\n print(\"left\")\r\nelif (right>left):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# # 2022\r\n# import sys\r\n# input=sys.stdin.readline\r\ndef exe():\r\n a=\"\".join(reversed(x[0]))\r\n b=x[1]\r\n s1=0\r\n s2=0\r\n for i in range(len(a)):\r\n if(a[i]!='='):\r\n s1+=int(a[i])*(i+1)\r\n for i in range(len(b)):\r\n if(b[i]!='='):\r\n s2+=int(b[i])*(i+1)\r\n if(s1>s2):\r\n return 'left'\r\n elif(s1<s2):\r\n return 'right'\r\n else:\r\n return 'balance'\r\ns=input()\r\nx = s.split(\"^\")\r\nprint(exe())", "s = input()\r\n\r\nmid = s.find('^')\r\n#print(mid)\r\nsm1 = 0\r\nsm2 = 0\r\n\r\nfor i in range(mid):\r\n if s[i]!= '=':\r\n sm1 += int(s[i]) * (mid - i)\r\n\r\nfor i in range(mid+1 , len(s)):\r\n if s[i] != '=':\r\n sm2 += int(s[i]) * (i - mid)\r\n\r\n\r\nif sm1 - sm2 > 0:\r\n print('left')\r\n\r\nelif sm1 - sm2 < 0 :\r\n print('right')\r\n\r\nelse:\r\n print('balance')", "s = input()\r\npivot = s.find('^')\r\nvalue = 0\r\nfor i in range(len(s)):\r\n if s[i].isdigit():\r\n value += int(s[i]) * (i - pivot)\r\n \r\nif value < 0:\r\n print('left')\r\nelif value == 0:\r\n print('balance')\r\nelse:\r\n print('right')", "s = input()\r\npiv = s.index('^')\r\nsum = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isdigit():\r\n sum += (i-piv) * int(s[i])\r\n\r\nif sum == 0:\r\n print('balance')\r\nelif sum > 0:\r\n print('right')\r\nelse:\r\n print('left')\r\n", "s=input().split('^')\r\nle=s[0]\r\nri=s[1]\r\nl,r=0,0\r\nfor i in range(len(le)):\r\n if le[i]=='=':\r\n continue\r\n else:\r\n l+=(int(le[i]))*(len(le)-i)\r\nfor i in range(len(ri)):\r\n if ri[i]=='=':\r\n continue\r\n else:\r\n r+=(int(ri[i]))*(i+1)\r\nif l==r:\r\n print('balance')\r\nelif l>r:\r\n print('left')\r\nelse:\r\n print('right')\r\n\r\n\r\n", "a=input()\r\n\r\n#a = 500000*\"1\" + \"^\" + 500000*\"1\"\r\n\r\na=a.replace(\"=\", \"0\")\r\na, b = a.split(\"^\")\r\nlt = 0\r\nrt = 0\r\nfor i in range(len(b)):\r\n rt += int(b[i]) * (i+1)\r\nlena = len(a)\r\nfor i in range(lena):\r\n lt += int(a[lena-1-i]) * (i+1)\r\n\r\nif lt > rt:\r\n print(\"left\")\r\nelse:\r\n if rt > lt:\r\n print(\"right\")\r\n else:\r\n print(\"balance\")\r\n", "s=input();\r\nc=1;\r\nfor i in range(0,len(s)):\r\n if(s[i]=='^'):\r\n n=i;\r\n break;\r\n#print(n) \r\na=0;\r\nfor i in range(n-1,-1,-1):\r\n if(s[i]=='='):\r\n c+=1;\r\n continue;\r\n a=a+(int(s[i])*c);\r\n c+=1;\r\n # print(int(s[i]))\r\n \r\nc=1; \r\nb=0;\r\nfor i in range(n+1,len(s)):\r\n if(s[i]=='='):\r\n c+=1;\r\n continue;\r\n b=b+(int(s[i])*c);\r\n c+=1;\r\n \r\n \r\n#print(a,b)\r\nif(a==b):\r\n print(\"balance\")\r\nelif(a>b):\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n\r\n ", "a, b = input().replace('=', '0').split(\"^\")\r\na = a[::-1]\r\n\r\ns1 = s2 = 0\r\n\r\nfor i in range(len(a)): s1 += (i+1)*int(a[i])\r\nfor i in range(len(b)): s2 += (i+1)*int(b[i])\r\n\r\nif s1 > s2: print(\"left\")\r\nelif s1 < s2: print(\"right\")\r\nelse: print(\"balance\")", "sum = 0\r\nseq = input()\r\nind = seq.index(\"^\")\r\nfor i in range(len(seq)):\r\n if seq[i].isdigit():\r\n sum += (ind-i)*int(seq[i])\r\nif sum == 0:\r\n print(\"balance\")\r\nelif sum > 0:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "k = input(); g = k.index('^')\r\nc,f = 0,0\r\nfor i in range(len(k)):\r\n\tif i<g and k[i]!= '=':c+=(int(k[i])*(g-i))\r\n\telif i>g and k[i]!= '=': f+=(int(k[i])*(i-g))\r\nprint('balance') if c==f else print(['left','right'][c<f])", "\nclass MyApp():\n \n def __init__(self,s):\n self.s = s\n def build(self):\n a = b = 0\n value = 1\n ind = self.s.index('^')\n left = self.s[:ind]\n right = self.s[ind+1:]\n for i in left[::-1]:\n if i != '=' :\n a+=int(i)*value\n value+=1\n value = 1\n for i in right:\n if i != '=':\n b+=int(i)*value\n value+=1\n print(\"balance\" if a==b else \"right\" if a < b else \"left\")\nroot = MyApp(input())\nroot.build()\n\n", "s=input()\r\ns1=s.replace('=','0')\r\na=0\r\nb=0\r\nfor i in range(len(s)):\r\n if s[i]=='^':\r\n c=i\r\nfor i in range(len(s)):\r\n if i<c:\r\n a+=(ord(s1[i])-48)*(c-i)\r\n if i>c:\r\n b+=(ord(s1[i])-48)*(i-c)\r\nif a>b:\r\n print('left')\r\nelif a<b:\r\n print('right')\r\nelse:\r\n print('balance')", "n,m=map(str,input().split(\"^\"))\r\nl=list(n)\r\nw=list(m)\r\ns=0\r\nr=0\r\np=\"1234567890\"\r\nfor i in range(len(l)):\r\n\tif l[len(l)-1-i] in p:\r\n\t\ts+=int(l[len(l)-1-i])*(i+1)\r\nfor i in range(len(w)):\r\n\tif w[i] in p:\r\n\t\tr+=int(w[i])*(i+1)\r\nif s>r:\r\n\tprint(\"left\")\r\nelif r>s:\r\n\tprint(\"right\")\r\nelif r==s:\r\n\tprint(\"balance\")", "S = input()\r\nA = {}\r\npivot = -1\r\nfor i in range(len(S)):\r\n\tif(S[i]==\"^\"):\r\n\t\tpivot = i\r\n\telif(S[i]!=\"=\"):\r\n\t\tA[i] = int(S[i])\r\nleft = 0\r\nright = 0\r\nfor key in A:\r\n\tw = A[key]*(pivot-key)\r\n\tif(w>0):\r\n\t\tleft+=w\r\n\telse:\r\n\t\tright-=w\r\n\r\nif(left==right):\r\n\tprint(\"balance\")\r\nelif(left>right):\r\n\tprint(\"left\")\r\nelse:\r\n\tprint(\"right\")", "line = input()\nn = len(line)\nnumbers = {'0','1','2','3','4','5','6','7','8','9'}\nweights = []\nindexes = []\nfulcrum = 0\nfor i in range(n):\n if line[i] in numbers:\n weights.append(int(line[i]))\n indexes.append(i)\n elif line[i] == '^':\n fulcrum = i\nleft = 0\nright = 0\nfor i in range(len(weights)):\n if indexes[i] < fulcrum:\n left += (fulcrum-indexes[i])*weights[i]\n else:\n right += (indexes[i]-fulcrum)*weights[i]\nif right == left:\n print(\"balance\")\nelif left > right:\n print(\"left\")\nelse:\n print(\"right\")\n\t\t \t \t \t\t\t\t \t \t \t \t\t\t \t \t", "def f(s):\r\n i = s.index('^')\r\n s = [0 if c=='^' or c=='=' else int(c) for c in s]\r\n l = s[:i+1] #include ^ for 0\r\n r = s[i:] #include ^ for 0\r\n l.reverse()\r\n lw = sum([i*l[i] for i in range(len(l))])\r\n rw = sum([i*r[i] for i in range(len(r))])\r\n if lw==rw:\r\n return 'balance'\r\n return 'left' if lw>rw else 'right'\r\n\r\ns = list(input())\r\nprint(f(s))\r\n\r\n", "s = input()\r\nl = ['1','2','3','4','5','6','7','8','9']\r\nleft = 0\r\nright = 0\r\nk = s.index('^')\r\nfor j in range(k):\r\n if s[j] in l:\r\n left+=int(s[j])*(k-j)\r\nfor x in range(k,len(s)):\r\n if s[x] in l:\r\n right+=int(s[x])*(x-k)\r\n\r\nif left == right:\r\n print(\"balance\") \r\nif left>right:\r\n print(\"left\")\r\nif right>left:\r\n print(\"right\") ", "s = input()\r\no = s.find('^')\r\na = list(int(s[i]) if s[i].isdigit() else 0 for i in range(len(s))) \r\nsumma = 0\r\nfor i in range(len(s)):\r\n summa += (i-o) * a[i]\r\nif summa < 0:\r\n print ('left')\r\nelif summa == 0:\r\n print('balance')\r\nelse:\r\n print('right')", "s=input('')\r\nindex=s.index('^')\r\nl=[]\r\ni=index-1\r\ncount=0\r\nwhile(i>=0):\r\n count+=1\r\n if(s[i]>='1' and s[i]<='9'):\r\n l.append([s[i],count])\r\n i-=1\r\nl1=[]\r\nfor j in range(index+1,len(s)):\r\n if(s[j]>='1' and s[j]<='9'):\r\n l1.append([s[j],(j-index)])\r\nsum1=0;\r\nsum2=0;\r\nfor k,k1 in l:\r\n sum1+=int(k)*k1\r\nfor k,k1 in l1:\r\n sum2+=int(k)*k1\r\nif(sum1>sum2):\r\n print('left')\r\nelif(sum1==sum2):\r\n print('balance')\r\nelse:\r\n print('right')", "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ns = get_string()\r\noup,l,n = 0,0,len(s)\r\nfor i in range(n):\r\n if s[i]=='^':\r\n l = i\r\nfor i in range(n):\r\n if s[i].isdigit():\r\n oup += int(s[i])*(l-i)\r\nif oup>0:\r\n print(\"left\")\r\nelif oup<0:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s = list(input())\r\nlevel = s.index(\"^\")\r\nleft = 0\r\nfor i in range(level):\r\n try:\r\n left += int(s[i])*(level - i)\r\n except ValueError:\r\n continue\r\nright = 0\r\nfor i in range(level+1, len(s)):\r\n try:\r\n right += int(s[i])*(i - level)\r\n except ValueError:\r\n continue\r\n\r\nif left == right:\r\n print(\"balance\")\r\nelif left > right:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "s = input()\r\nk = 1\r\nb = 0\r\nu = s.index('^')\r\nfor i in range(0,len(s)):\r\n if s[i] == \"^\": k =-1\r\n elif s[i] != '=': b+=abs(i-u)*int(s[i])*k\r\n\r\nif b == 0: print(\"balance\")\r\nelif b > 0: print(\"left\")\r\nelse: print(\"right\")\r\n", "l=input()\r\nfor i in range(len(l)):\r\n if l[i]==\"^\":\r\n center_of_mass=i\r\n break\r\n\r\nl_torque,r_torque=0,0\r\nfor i in range(len(l)):\r\n if i<center_of_mass:\r\n if l[i]!=\"=\":\r\n l_torque+=int(l[i])*abs(i-center_of_mass)\r\n \r\n elif i>center_of_mass:\r\n if l[i]!=\"=\":\r\n r_torque+=int(l[i])*abs(i-center_of_mass)\r\n\r\nif l_torque==r_torque:\r\n print(\"balance\")\r\nelif l_torque>r_torque:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n ", "a, b = input().replace('=', '0').split(\"^\")\r\na, s1, s2 = a[::-1], 0, 0\r\n\r\nfor i in range(len(a)): s1 += (i+1)*int(a[i])\r\nfor i in range(len(b)): s2 += (i+1)*int(b[i])\r\n\r\nif s1 > s2: print(\"left\")\r\nelif s1 < s2: print(\"right\")\r\nelse: print(\"balance\")", "s = input()\r\np = s\r\ns = s.split(\"^\")\r\nmid = len(s[0])\r\nsumi=0\r\nfor i in range(len(p)):\r\n val_i = 0\r\n if p[i].isnumeric():\r\n val_i=int(p[i])\r\n if p[i]!='=' and p[i]!='^':\r\n sumi+=val_i*(i-mid)\r\nif sumi>0:\r\n print(\"right\")\r\nelif sumi<0:\r\n print(\"left\")\r\nelse:\r\n print(\"balance\")\r\n ", "s = input()\r\nl = len(s)\r\nind = s.index('^')\r\ns1 = s[:ind]\r\ns2 = s[ind + 1:]\r\ns1 = s1[::-1]\r\nris1, ris2 = 0, 0\r\nfor x in range(len(s1)):\r\n if s1[x].isalnum():\r\n ris1 += (x + 1) * int(s1[x])\r\nfor x in range(len(s2)):\r\n if s2[x].isalnum():\r\n ris2 += (x + 1) * int(s2[x])\r\nif ris1 > ris2:\r\n print(\"left\")\r\nelif ris2 > ris1:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s = input()\r\nln, rn = 0, 0\r\nind = s.index('^')\r\nfor i in range(0, ind):\r\n if s[i] != '=':\r\n ln += (ind-i) * (int(s[i]))\r\nlng = len(s)\r\nfor i in range(ind+1, lng):\r\n if s[i] != '=':\r\n rn += (i-ind) * (int(s[i]))\r\nif ln == rn:\r\n print('balance')\r\nelif ln > rn:\r\n print('left')\r\nelse:\r\n print('right')", "a,b=input().replace('=','0').split('^')\r\na=a[::-1]\r\nt=len(b)-len(a)\r\nif t>0:a+='0'*t\r\nif t<0:b+='0'*(-t)\r\nk=sum((int(a[i])-int(b[i]))*(i+1)for i in range(len(a)))\r\nprint('right'if k<0else['balance','left'][k>0])", "s = input()\r\nfor i in range(len(s)):\r\n if s[i] == '^':\r\n o = i\r\nl = s[0:o]\r\nr = s[o+1:len(s)]\r\nl_sum = r_sum = 0\r\nfor i in range(len(l)):\r\n if not (l[i] == '='):\r\n l_sum += int(l[i]) * (len(l) - i)\r\n \r\nfor i in range(len(r)):\r\n if not (r[i] == '='):\r\n r_sum += int(r[i]) * (i+1)# + 1)\r\nif l_sum < r_sum:\r\n print('right')\r\nelif l_sum > r_sum:\r\n print('left')\r\nelse:\r\n print('balance')", "s=[n for n in input()]\r\nk=s.index('^')\r\na=s[:k][::-1]\r\nb=s[k+1:]\r\nm=0\r\nfor n in range(len(a)):\r\n\tif ord('0')<=ord(a[n])<=ord('9'):\r\n\t\tm+=int(a[n])*(n+1)\r\np=0\r\nfor n in range(len(b)):\r\n\tif ord('0')<=ord(b[n])<=ord('9'):\r\n\t\tp+=int(b[n])*(n+1)\r\nif m==p:\r\n\tprint('balance')\r\nelif m>p:\r\n\tprint('left')\r\nelif m<p:\r\n\tprint('right')\r\n", "str = input();\r\n\r\na,b = str.split('^')\r\n\r\ns1,s2=0,0;\r\n\r\nfor i in range(len(a)):\r\n if a[i] != '=':\r\n s1+=(len(a)-i)*int(a[i]);\r\n\r\nfor i in range(len(b)):\r\n if b[i] !='=':\r\n s2+=(i+1)*int(b[i]);\r\n \r\nif s1==s2 :\r\n print(\"balance\")\r\nelif s1>s2 :\r\n print(\"left\")\r\nelse :\r\n print(\"right\")\r\n ", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\ns=list(input())\r\nn=len(s)-1\r\nk=s.index('^')\r\ni=k-1\r\nj=k+1\r\ns1,s2=0,0\r\nwhile(i!=-1 or j!=n):\r\n if(i!=-1):\r\n if(s[i]!='='):\r\n s1+=(k-i)*int(s[i])\r\n i-=1\r\n if(j!=n):\r\n if(s[j]!='='):\r\n s2+=(j-k)*int(s[j])\r\n j+=1\r\nif(s1>s2):\r\n print(\"left\")\r\nelif(s1<s2):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s = input()\na, b = s.split('^')\nresa = 0\nresb = 0\nfor i in range(len(a) - 1, -1, -1):\n\tif a[i] == '=':\n\t\tcontinue\n\tresa += int(a[i]) * (len(a) - i)\nfor i in range(len(b)):\n\tif b[i] == '=':\n\t\tcontinue\n\tresb += int(b[i]) * (i + 1)\nprint('balance' if resa == resb else 'left' if resa > resb else 'right')\n", "\ndef weight(s):\n w, i = 0, 1\n for c in s:\n if c != '=':\n w += i*int(c)\n i += 1\n return w\n\ndef main():\n line = input()\n l, r = line.split('^')\n l = weight(l[::-1])\n r = weight(r)\n if l > r:\n print('left')\n elif l < r:\n print('right')\n else:\n print('balance')\n\nif __name__ == '__main__':\n main()", "a=input()\r\np=a.index('^')\r\nc=sum((i-p)*int(y) for i,y in enumerate(a) if y.isdigit())\r\nprint([['balance','right'][c>0],'left'][c<0])", "s = input()\r\nc = s.find('^')\r\ntotal = sum(int(w)*(c-i) for i,w in enumerate(s) if w.isdigit())\r\n\r\nprint('left' if total>0 else 'right' if total<0 else 'balance')", "x = input()\r\nx = x.split('^')\r\nl = r = 0\r\nlxl = len(x[0])\r\nlxr = len(x[1])\r\nfor i in range(lxl):\r\n if x[0][i] != '=':\r\n l += int(x[0][i]) * (lxl-i)\r\nfor i in range(lxr):\r\n if x[1][i] != '=':\r\n r += int(x[1][i]) * (i+1)\r\n\r\nif l > r:\r\n print('left')\r\nelif r > l:\r\n print('right')\r\nelse:\r\n print('balance')\r\n", "s = input()\r\nn = s.find(\"^\")\r\nm = sum((i - n) * int(c) for i, c in enumerate(s) if c.isdigit())\r\nprint(\"left\" if m < 0 else \"right\" if m > 0 else \"balance\")", "def lever(s):\r\n for i in range(len(s)):\r\n if s[i]=='^':\r\n pivot=i\r\n break\r\n \r\n left=pivot-1\r\n right=pivot+1\r\n sum_left=0\r\n sum_right=0\r\n c_left=1\r\n c_right=1\r\n while left>=0:\r\n if s[left]!='=':\r\n sum_left+=int(s[left])*(c_left)\r\n\r\n left=left-1\r\n c_left+=1\r\n\r\n while right<len(s):\r\n if s[right]!='=':\r\n sum_right+=int(s[right])*(c_right)\r\n\r\n right=right+1\r\n c_right+=1\r\n\r\n if sum_left>sum_right:\r\n print('left')\r\n elif sum_left<sum_right:\r\n print('right')\r\n else:\r\n print('balance')\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\ns=input('')\r\nlever(list(s))", "s1, s2 = map(str, input().split('^'))\r\nl1, l2 = 0, 0\r\nfor i in range(len(s1)):\r\n\tif s1[i].isdigit():\r\n\t\tl1 += int(s1[i]) * (len(s1) - i)\r\nfor i in range(len(s2)):\r\n\tif s2[i].isdigit():\r\n\t\tl2 += int(s2[i]) * (i + 1)\r\nif l1 == l2:\r\n\tprint('balance')\r\nelif l1 > l2:\r\n\tprint('left')\r\nelse:\r\n\tprint('right')", "s= input()\r\nf=0\r\nan=0\r\nx=0\r\np=s.index('^')+1\r\nnt=0\r\nfor i in s:\r\n nt +=1\r\n x=abs(p-nt)\r\n if i=='^':\r\n f=1\r\n x=0\r\n if f==0:\r\n if i!='^' and i!='=':\r\n an+=int(i)*(x)\r\n else:\r\n if i != '^' and i != '=':\r\n an-=int(i)*(x)\r\nif an==0:\r\n print('balance')\r\nelif an>0:\r\n print('left')\r\nelse:\r\n print('right')", "s=list(input())\r\nt=0\r\nI=s.index('^')\r\nfor i in range(len(s)):\r\n if(s[i] in ['1','2','3','4','5','6','7','8','9']):\r\n t=t+(int(s[i])*(i-I))\r\nif(t>0):\r\n print('right')\r\nelif(t<0):\r\n print('left')\r\nelse:\r\n print('balance')", "s1 =input()\r\ns= list(s1.strip(\" \"))\r\nleft=0\r\nright=0\r\npivot=s.index(\"^\")\r\nfor x in range(0,pivot):\r\n if s[x]!='=':\r\n left+=int(s[x])*(pivot-x)\r\nfor x in range(pivot+1,len(s)):\r\n if s[x]!='=':\r\n right+=int(s[x])*(x-pivot)\r\nif left>right:\r\n print('left')\r\nelif right>left:\r\n print('right')\r\nelse:\r\n print('balance')", "def main():\n s = input()\n res = 0\n for i, c in enumerate(s, -s.find('^')):\n if c.isdigit():\n res += i * int(c)\n print(('left', 'right', 'balance')[(not res) * 2 + (res > 0)])\n\n\nif __name__ == '__main__':\n main()", "barre = input()\nlongueur = len(barre)\n\npoids = []\nlevier = 0\nfor i, l in enumerate(barre):\n if l in \"123456789\":\n poids.append((int(l), i))\n elif l == \"^\":\n levier = i\nresult = 0\nfor p, x in poids:\n result += (x - levier) * p\nif result < 0:\n print(\"left\")\nelif result > 0:\n print(\"right\")\nelse:\n print(\"balance\")\n", "s = input()\r\ns=s.split(\"^\")\r\nf1=0\r\nf2=0\r\nc1=len(s[0])+1\r\nc2=0\r\nfor i in s[0]:\r\n c1-=1\r\n if i!='=':\r\n f1+=int(i)*c1\r\n\r\nfor j in s[1]:\r\n c2+=1\r\n if j!='=':\r\n f2+=int(j)*c2\r\nif f1>f2:\r\n print(\"left\")\r\nelif f2>f1:\r\n print(\"right\")\r\nelse:\r\n print('balance')", "\r\n \r\nS = input()\r\np = S.index(\"^\")\r\nl = 0\r\nr = 0\r\n\r\nfor i in range(p - 1, -1, -1):\r\n if S[i] != '=':\r\n l += int(S[i]) * (p - i)\r\nfor i in range(p + 1, len(S)):\r\n if S[i] != '=':\r\n r += int(S[i]) * (i - p)\r\nif l > r:\r\n print(\"left\")\r\nelif r > l:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s=input();m=len(s);x=s.index('^');d={};m1,m2=0,0\r\nfor i in range(1,10):d[str(i)]=i\r\nfor i in range(x):\r\n\tif s[i] in d:m1+=d[s[i]]*abs(x-i)\r\nfor i in range(x,m):\r\n\tif s[i] in d:m2+=d[s[i]]*abs(x-i)\r\nif m1==m2:print('balance')\r\nelif m1>m2:print('left')\r\nelse:print('right')", "s = input()\r\nleft,right = s.split('^')\r\nleft_sum = right_sum = 0\r\nfor i in range(-1,-1-len(left),-1):\r\n if left[i] != '=':\r\n left_sum += -(i)*int(left[i])\r\nfor i in range(len(right)):\r\n if right[i] != '=':\r\n right_sum += (i+1)*int(right[i])\r\nif left_sum==right_sum:\r\n print('balance')\r\nelif left_sum>right_sum:\r\n print('left')\r\nelse:\r\n print('right')", "balance = input()\r\nleft = right = 0\r\nmidPt = balance.index(\"^\")\r\ni = midPt-1\r\nwhile i>-1:\r\n if balance[i].isdigit():\r\n left += int(balance[i])*(midPt-i)\r\n i -= 1\r\ni = midPt+1\r\nwhile i<len(balance):\r\n if balance[i].isdigit():\r\n right += int(balance[i])*(i-midPt)\r\n i += 1\r\nif right==left:\r\n print(\"balance\")\r\nelif right>left:\r\n print(\"right\")\r\nelse:\r\n print(\"left\")\r\n", "lever=input()\r\ni=0\r\nind=lever.index('^')\r\narr,brr=[],[]\r\nfor i in range(ind):\r\n if lever[i].isdigit():\r\n arr.append(int(lever[i])*abs(i-ind))\r\nfor i in range(ind,len(lever)):\r\n if lever[i].isdigit():\r\n brr.append(int(lever[i])*abs(i-ind))\r\nif sum(arr)>sum(brr):\r\n print(\"left\")\r\nelif sum(arr)<sum(brr):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "__author__ = \"runekri3\"\r\n\r\nlever_str = input()\r\nleft_str, right_str = lever_str.split(\"^\")\r\nleft_str = left_str[::-1] # Reverse string\r\nleft_w, right_w = 0, 0\r\nmult = 0\r\nfor letter in left_str:\r\n mult += 1\r\n if letter != \"=\":\r\n left_w += mult*int(letter)\r\nmult = 0\r\nfor letter in right_str:\r\n mult += 1\r\n if letter != \"=\":\r\n right_w += mult*int(letter)\r\n\r\nif left_w < right_w:\r\n print(\"right\")\r\nelif left_w > right_w:\r\n print(\"left\")\r\nelse:\r\n print(\"balance\")", "import sys\r\ninput = sys.stdin.readline\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\r\n\r\ns = input()\r\nind = s.index('^')\r\nsm = 0\r\nfor i, y in enumerate(s):\r\n if (y.isdigit()):\r\n sm += (i-ind)*(int(y))\r\nprint([[\"balance\",\"right\"][sm > 0], \"left\"][sm < 0])\r\n", "s=input()\r\nl=s.find('^')\r\nsuml=0\r\nsumr=0\r\nfor i in range(l):\r\n\tif(s[i]=='='):\r\n\t\tcontinue\r\n\tsuml+=((l-i)*int(s[i]))\r\n\r\nfor i in range(l+1,len(s)):\r\n\tif(s[i]=='='):\r\n\t\tcontinue\r\n\tsumr+=((i-l)*int(s[i]))\r\n\r\nif suml==sumr:\r\n\tprint(\"balance\")\r\nelif suml>sumr:\r\n\tprint(\"left\")\r\nelse:\r\n\tprint(\"right\")", "# -*- coding: utf-8 -*-\r\n\r\ndef solve(s):\r\n sl, sr = s.split('^')\r\n left = sum([(i + 1) * int(c) for i, c in enumerate(reversed(sl)) if c.isdigit()])\r\n right = sum([(i + 1) * int(c) for i, c in enumerate(sr) if c.isdigit()])\r\n # print(left, right)\r\n if left > right:\r\n return \"left\"\r\n elif left == right:\r\n return \"balance\"\r\n else:\r\n return \"right\"\r\n \r\n\r\ns = input()\r\nprint(solve(s))\r\n\r\n", "s=input()\r\nl,r=0,0\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='^':\r\n middle=i\r\nfor i in range(middle+1,len(s)):\r\n if s[i]!='=':\r\n r+=(i-middle)*int(s[i])\r\nfor i in range(middle-1,-1,-1):\r\n if s[i]!='=':\r\n l+=(middle-i)*int(s[i])\r\nif l==r:\r\n print('balance')\r\nelif l>r:\r\n print('left')\r\nelse:\r\n print('right')\r\n", "bar = input()\r\npP = bar.index(\"^\")\r\nnums = \"123456789\"\r\nbalance = 0\r\nfor i in range(len(bar)):\r\n if bar[i] in nums:\r\n balance += int(bar[i]) * (i - pP)\r\nif balance == 0:\r\n print(\"balance\")\r\nelif balance < 0:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "s = input()\nn = len(s)\nleft = right = 0\nlo = hi = pivot = s.index(\"^\")\nwhile lo > 0 or hi < n - 1:\n if lo > 0:\n lo -= 1\n left += (pivot - lo) * int(s[lo]) if s[lo] != \"=\" else 0\n if hi < n - 1:\n hi += 1\n right += (hi - pivot) * int(s[hi]) if s[hi] != \"=\" else 0\nres = \"balance\" if left == right else \"left\" if left > right else \"right\"\nprint(res)\n", "s=input()\r\n\r\nfor i in range(0,len(s)):\r\n if(s[i]=='^'): #finding position of mid of lever\r\n n=i\r\n break\r\n\r\nc=1\r\nleft=0\r\nfor i in range(n-1,-1,-1):\r\n if(s[i]=='='): #Calculating left side\r\n c+=1\r\n continue\r\n left += (int(s[i])*c);\r\n c+=1\r\n\r\nc=1\r\nright=0\r\nfor i in range(n+1,len(s)): #Calculating right side\r\n if(s[i]=='='):\r\n c+=1\r\n continue\r\n right=right+(int(s[i])*c)\r\n c+=1\r\n\r\nif(left==right):\r\n print(\"balance\") #Comparing\r\nelif(left>right):\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n", "\ns= input()\nn=len(s)\ntot=0\ncount=0\n\nl,r=0,0\n\nfor i in range(n):\n\tif s[i] not in '^=':\n\t\ttot+=i*int(s[i])\n\t\tcount+=int(s[i])\n\nfor i in range(n):\n\tif s[i]==\"^\":\n\t\tl=i\n\t\tbreak\nfor i in range(n-1,-1,-1):\n\tif s[i]==\"^\":\n\t\tr=i\n\t\tbreak\nif count==0:\n\tprint(\"balance\")\nelif tot/count < l:\n\tprint(\"left\")\nelif tot/count >r:\n\tprint(\"right\")\nelse:\n\tprint(\"balance\")", "s=str(input(\"\"))\r\ns=list(s)\r\np=s.index(\"^\")\r\nl=s[0:p:1]\r\nl=l[::-1]\r\nr=s[p+1:]\r\nsl=sr=0\r\nfor i in range(len(l)):\r\n if(l[i]!=\"=\"):\r\n sl=sl+(i+1)*(int(l[i]))\r\nfor i in range(len(r)):\r\n if(r[i]!=\"=\"):\r\n sr=sr+(i+1)*(int(r[i]))\r\n\r\nif(sl>sr):\r\n print(\"left\")\r\nelif(sr>sl):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n ", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = input().rstrip()\r\npiv = data.index('^')\r\n\r\nleft = data[:piv][::-1]\r\nright = data[piv + 1:]\r\n\r\nf = s = 0\r\nfor i in range(len(left)):\r\n if left[i].isdigit():\r\n f += (i + 1) * int(left[i])\r\n\r\nfor i in range(len(right)):\r\n if right[i].isdigit():\r\n s += (i + 1) * int(right[i])\r\n\r\nif f == s:\r\n print(\"balance\")\r\nelse:\r\n print(\"left\" if f > s else \"right\")\r\n ", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\ns=list(input())\r\nln=len(s)\r\nlft=[]\r\nrgt=[]\r\nfor i in range(ln):\r\n\tif s[i]==\"=\":\r\n\t\ts[i]=0\r\n\tif s[i]==\"^\":\r\n\t\tmid=i\r\nfor i in range(ln):\r\n\tif s[i]!=\"^\":\r\n\t\tlft.append(int(s[i])*(mid-i))\r\n\telse:\r\n\t\tbreak\r\nfor i in range(i+1,ln):\r\n\trgt.append(int(s[i])*(i-mid))\r\nsl=sum(lft)\r\nsr=sum(rgt)\r\nif sl>sr:\r\n\tprint(\"left\")\r\nelif sl<sr:\r\n\tprint(\"right\")\r\nelse:\r\n\tprint(\"balance\")", "a=input(\"\")\r\na=list(a)\r\nf=0\r\ns=a.index(\"^\")\r\nfor i in range(len(a)):\r\n if a[i].isdigit():\r\n f+=int(a[i])*(s-i)\r\nif f>0:\r\n print(\"left\")\r\nelif f==0:\r\n print(\"balance\")\r\nelse:\r\n print(\"right\")\r\n", "s = input()\r\npos = s.find('^')\r\nvesl = 0\r\nvesr = 0\r\nfor i in range(pos):\r\n if s[i].isdigit():\r\n vesl += int(s[i]) * (pos - i)\r\nfor i in range(pos+1, len(s)):\r\n if s[i].isdigit():\r\n vesr += int(s[i]) * (i - pos)\r\nif vesr == vesl:\r\n print('balance')\r\nelif vesr > vesl:\r\n print('right')\r\nelse:\r\n print('left')\r\n", "a = input().strip()\r\nn= len(a)\r\nc = a.index('^')\r\nl,r = 0,0\r\nfor i in range(c):\r\n if a[i].isdigit():\r\n l+=(c-i)*int(a[i])\r\nfor i in range(c+1,n):\r\n if a[i].isdigit():\r\n r+=(i-c)*int(a[i])\r\nif l==r:\r\n print('balance')\r\nelif l>r:\r\n print('left')\r\nelse:\r\n print('right')\r\n", "def AC():\r\n s = input()\r\n c = s.index('^')\r\n left = 0\r\n for i in range(c):\r\n if s[i] != '=':\r\n x = int(s[i])\r\n left += x * (c - i)\r\n right = 0\r\n for i in range(c + 1, len(s)):\r\n if s[i] != '=':\r\n x = int(s[i])\r\n right += x * (i - c)\r\n if left == right:\r\n print(\"balance\")\r\n elif left > right:\r\n print(\"left\")\r\n elif left < right:\r\n print(\"right\")\r\n\r\ndef IOF():\r\n pass\r\n\r\nIOF()\r\nTest = 1\r\n# Test = int(input())\r\nfor i in range(Test):\r\n AC()\r\n", "n = input()\r\nc = n.find('^')\r\nleft = 0\r\nright = 0\r\nfor i in range(len(n)):\r\n if n[i]!='=' and n[i]!='^':\r\n if(i<c):\r\n left+=int(n[i])*(c-i)\r\n else:\r\n right+=int(n[i])*(i-c)\r\nif(left>right):\r\n print(\"left\")\r\nelif right>left:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n \r\n \r\n ", "def solve() :\n ind=x.find('^')\n s=0\n for i in range(len(x)) :\n if x[i]!= '=' and x[i]!= '^':\n s+=int(x[i])*(ind-i)\n if s>0 :\n return 'left'\n if s<0 :\n return 'right'\n return 'balance'\n\n \n\nfrom sys import stdin\ninput = stdin.readline \n \nx=input().strip()\n\nprint(solve())\n \n\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([x for x in input().strip()])\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "def lever_balance(s):\r\n pivot_index = s.index(\"^\") \r\n \r\n left_torque = 0\r\n right_torque = 0\r\n \r\n for i in range(len(s)):\r\n if s[i] == \"=\":\r\n continue \r\n elif s[i] == \"^\":\r\n continue \r\n else:\r\n weight = int(s[i])\r\n distance = abs(pivot_index - i)\r\n \r\n \r\n if i < pivot_index:\r\n left_torque += weight * distance\r\n else:\r\n right_torque += weight * distance\r\n \r\n if left_torque > right_torque:\r\n return \"left\"\r\n elif right_torque > left_torque:\r\n return \"right\"\r\n else:\r\n return \"balance\"\r\n\r\n\r\nlever_description = input().strip()\r\n\r\n\r\nresult = lever_balance(lever_description)\r\nprint(result)\r\n", "s = input()\r\nh = s.find('^')\r\nsum = 0\r\nfor i in range(len(s)):\r\n if s[i] == '=' or s[i] == '^':\r\n continue\r\n else:\r\n sum += int(s[i]) * (i-h)\r\nprint('left' if sum < 0 else 'right' if sum > 0 else 'balance')", "sa, sb = input().split(\"^\")\nsa = sa[::-1]\ndef cal(s: str) -> int:\n k = 0\n ans = 0\n for ch in s:\n k += 1\n if ch.isdigit():\n ans += (ord(ch) - ord('0')) * k\n return ans\n\na = cal(sa)\nb = cal(sb)\nif a < b:\n print(\"right\")\nelif a > b:\n print(\"left\")\nelse:\n print(\"balance\")\n \t \t\t \t \t \t \t \t\t \t \t\t \t\t\t", "L, R = input().split(\"^\")\r\nL = L[::-1]\r\nwL = sum(int(x) * (i+1) for i, x in enumerate(L) if x != \"=\")\r\nwR = sum(int(x) * (i+1) for i, x in enumerate(R) if x != \"=\")\r\nprint(\"balance\" if wL == wR else [\"right\",\"left\"][wL > wR])", "\nclass MyApp():\n \n def __init__(self,s):\n self.s = s\n def build(self):\n a = b = 0\n value = 1\n left,right = self.s.split('^')\n for i in left[::-1]:\n if i != '=' :\n a+=int(i)*value\n value+=1\n value = 1\n for i in right:\n if i != '=':\n b+=int(i)*value\n value+=1\n print(\"balance\" if a==b else \"right\" if a < b else \"left\")\nroot = MyApp(input())\nroot.build()\n\n", "import sys\r\n\r\ndef readInputs():\r\n global tab, iPiv\r\n ch = f.readline()[:-1]\r\n tab = len(ch)*[0]\r\n for i in range(len(ch)):\r\n if(ch[i] == '^'):\r\n iPiv = i\r\n elif(ch[i] != '='):\r\n tab[i] = int(ch[i])\r\n #print(tab)\r\n\r\ndef solve():\r\n sumCoeff = 0\r\n sumPond = 0\r\n for i in range(len(tab)):\r\n sumPond += tab[i]*i\r\n sumCoeff += tab[i]\r\n if(sumCoeff == 0):\r\n return \"balance\"\r\n iBary = sumPond/sumCoeff\r\n if(iBary < iPiv):\r\n return \"left\"\r\n elif(iBary > iPiv):\r\n return \"right\"\r\n else:\r\n return \"balance\"\r\n \r\n \r\n\r\ndef tests():\r\n global f\r\n bFail = False\r\n for i in range(1,3):\r\n # inputs\r\n f = open(\"test\"+str(i)+\".txt\")\r\n readInputs()\r\n # output expected\r\n lEx = list(map(int,f.readline().split()))\r\n lEx.sort()\r\n resExpect = str(lEx)\r\n # output\r\n res = str(solve())\r\n if(res != resExpect):\r\n print(\"TEST\",i,\"FAILED !\"+\" Found :\",res,\", Expected :\",resExpect)\r\n bFail = True\r\n else:\r\n print(\"TEST\",i,\"PASSED\")\r\n if(not bFail):\r\n print(\"\\n--- ALL OF THE \"+str(i)+\" TESTS HAVE SUCCEEDED ---\")\r\n\r\ndef main():\r\n global f\r\n i = 2\r\n if(i == 1):\r\n tests()\r\n return\r\n f = sys.stdin\r\n readInputs()\r\n print(solve())\r\n \r\nmain()", "s=input()\r\nind=s.find('^')\r\na=s[:ind]\r\na=a[::-1]\r\nb=s[ind+1:]\r\nl=0\r\nfor i in range(len(a)):\r\n if(a[i]>='0' and a[i]<='9'):\r\n l+=int(a[i])*(i+1)\r\nr=0\r\nfor i in range(len(b)):\r\n if(b[i]>='0' and b[i]<='9'):\r\n r+=int(b[i])*(i+1)\r\nif(l==r):\r\n print(\"balance\")\r\nelif(l<r):\r\n print(\"right\")\r\nelse:\r\n print(\"left\")", "def sumValues(x):\r\n suma = 0\r\n for i in range(len(x)):\r\n if x[i] != \"=\":\r\n suma += int(x[i])*(i+1)\r\n return suma\r\n\r\ns = input().split(\"^\")\r\ns[0] = s[0][::-1]\r\n\r\nif sumValues(s[0]) > sumValues(s[1]):\r\n print(\"left\")\r\nelif sumValues(s[0]) == sumValues(s[1]):\r\n print(\"balance\")\r\nelse:\r\n print(\"right\")", "import math\r\ns = input()\r\nindX = s.index(\"^\")\r\nc = 0\r\ni = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i].isdigit():\r\n c += int(s[i]) * (indX - i)\r\nif c == 0:\r\n print(\"balance\")\r\nelse:\r\n print([\"right\", \"left\"][c > 0])\r\n\r\n\r\n\r\n\r\n\r\n", "l = input()\ni = 0\nfor char in l:\n if (char == '^'):\n break\n\n i += 1\n\ne = 0\nj = 0\nk = i\nwhile(True):\n if (l[j] != '='):\n e += int(l[j]) * k\n\n j += 1\n k -= 1\n if (j == i):\n break\n\nd = 0\nj = i+1\nk = 1\n\nwhile(True):\n if (l[j] != '='):\n d += int(l[j]) * k\n\n j += 1\n k += 1\n if (j == len(l)):\n break\n\nif (e > d):\n print('left')\n\nelif (d > e):\n print('right')\n\nelse:\n print('balance')\n \t\t\t \t \t \t\t \t\t \t \t \t", "s = input()\nfor i in range(len(s)):\n if s[i] == '^':\n xl = i\n xr = i\n left = 0\n right = 0\n while xl!=0:\n xl-=1\n if s[xl] == '=':\n continue\n if int(s[xl]) in range(1,10):\n left += int(s[xl])*abs(xl-i)\n while xr!=len(s)-1:\n xr+=1\n if s[xr] == '=':\n continue\n if int(s[xr]) in range(1,10):\n right += int(s[xr])*abs(xr-i)\n if left == right:\n print('balance')\n elif max(left,right) == left:\n print('left')\n else:\n print('right')\n\n \n", "s=list(input())\r\nind=s.index('^')\r\nrhs=0\r\nlhs=0\r\nc=1\r\nfor i in range(ind-1,-1,-1):\r\n if(s[i]!='='):\r\n lhs+=c*int(s[i])\r\n c+=1\r\nd=1\r\n\r\nfor j in range(ind+1,len(s)):\r\n if(s[j]!='='):\r\n rhs+=d*int(s[j])\r\n d+=1\r\n\r\nif(lhs==rhs):\r\n print(\"balance\")\r\nelif(lhs>rhs):\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "s=input()\r\na=s.index(\"^\")\r\nsum=0\r\nfor i in range(len(s)):\r\n if s[i]!=\"=\" and s[i]!=\"^\":\r\n sum+=int(s[i])*(i-a)\r\nif sum<0:\r\n print(\"left\")\r\nelif sum>0:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")", "s=input().split('^')\r\nans1=0\r\nans2=0\r\nlefto=s[0]\r\nrighto=s[1]\r\nfor j in range(0,len(lefto)):\r\n if(lefto[j]=='='):\r\n continue\r\n else:\r\n ans1+=int(lefto[j])*(len(lefto)-j)\r\nfor j in range(0,len(righto)):\r\n if(righto[j]=='='):\r\n continue\r\n else:\r\n ans2+=int(righto[j])*(j+1)\r\nif(ans1==ans2 and ans1==0):\r\n print(\"balance\") \r\nelif(ans1>ans2):\r\n print(\"left\")\r\nelif(ans2>ans1):\r\n print(\"right\")\r\nelse:\r\n print(\"balance\") \r\n\r\n\r\n", "string = input()\r\npivot = string.index(\"^\")\r\n#print(pivot)\r\nsm = 0\r\nfor index in range(0,len(string)):\r\n if (string[index:index+1] != \"^\" and string[index:index+1] != \"=\"):\r\n sm += (pivot-index)*int(string[index:index+1])\r\n#print(sm)\r\nif sm < 0:\r\n print(\"right\")\r\nelif sm > 0:\r\n print(\"left\")\r\nelse:\r\n print(\"balance\")", "'''\r\nYou have a description of a lever as string s. We'll represent\r\nthe string length as record |s|, then the lever looks as a horizontal\r\nbar with weights of length |s| - 1 with exactly one pivot.\r\nWe will assume that the bar is a segment on the Ox axis between\r\npoints 0 and |s| - 1.\r\nThe decoding of the lever description is given below.\r\n -- If the i-th character of the string equals \"^\",\r\n that means that at coordinate i there is the pivot under the bar.\r\n -- If the i-th character of the string equals \"=\",\r\n that means that at coordinate i there is nothing lying on the bar.\r\n -- If the i-th character of the string equals digit c (1-9),\r\n that means that at coordinate i there is a weight of mass c on the bar. \r\nYour task is, given the lever description,\r\nprint if it will be in balance or not.\r\nAssume that the bar doesn't weight anything.\r\nAssume that the bar initially is in balance then\r\nall weights are simultaneously put on it. After that\r\nthe bar either tilts to the left, or tilts to the right, or is in balance.\r\n==========================================\r\nInput\r\nThe first line contains the lever description as a non-empty string\r\ns (3 ≤ |s| ≤ 106), consisting of digits (1-9) and characters \"^\"\r\nand \"=\". It is guaranteed that the line contains exactly one\r\ncharacter \"^\". It is guaranteed that the pivot of the lever\r\nisn't located in any end of the lever bar.\r\nTo solve the problem you may need 64-bit integer numbers.\r\nPlease, do not forget to use them in your programs.\r\n==========================================\r\nOutput\r\nPrint \"left\" if the given lever tilts to the left,\r\n\"right\" if it tilts to the right and \"balance\", if it is in balance.\r\n==========================================\r\nSample test(s)\r\nInput\r\n=^==\r\nOutput\r\nbalance\r\nInput\r\n9===^==1\r\nOutput\r\nleft\r\nInput\r\n2==^7==\r\nOutput\r\nright\r\nInput\r\n41^52==\r\nOutput\r\nbalance\r\n'''\r\n\r\n## Running Time ===>>> 420 ms\r\n\r\nS = input()\r\n\r\nmid = S.find('^')\r\n\r\ndigits_sum1, digits_sum2 = 0, 0\r\n\r\nfor i in range(mid):\r\n if S[i].isdigit():\r\n digits_sum1 += int(S[i]) * (mid - i)\r\nfor i in range(mid, len(S)):\r\n if S[i].isdigit():\r\n digits_sum2 += int(S[i]) * abs(mid - i)\r\n\r\nif digits_sum1 == digits_sum2:\r\n print('balance')\r\nelif digits_sum1 > digits_sum2:\r\n print('left')\r\nelif digits_sum2 > digits_sum1:\r\n print('right')", "#1st_python_program\r\n\r\ns = input()\r\nsum = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '^' :\r\n pivot = i\r\n break\r\n\r\nfor i in range(len(s)):\r\n if(s[i] >'0' and s[i] <= '9') :\r\n sum += (i - pivot)*int(s[i])\r\n \r\nif sum==0:\r\n print(\"balance\")\r\nelif sum < 0:\r\n print(\"left\")\r\nelse :\r\n print(\"right\")\r\n\r\n", "# https://codeforces.com/problemset/problem/376/A\n# 900\n\nd = input()\nm = d.index(\"^\")\nm += 1\n\ns = 0\nfor i, c in enumerate(d):\n if c == \"^\" or c == \"=\":\n continue\n\n i += 1\n c = int(c)\n s += c * (i-m)\n\nif s == 0:\n print(\"balance\")\nelif s > 0:\n print(\"right\")\nelse:\n print(\"left\")", "s = str(input())\r\nfor cont in range(0,len(s)):\r\n if s[cont] == '^':\r\n pos = cont\r\n break\r\n\r\nleft = 0\r\nright = 0\r\nfor d in range(0, pos):\r\n if s[d].isdigit():\r\n left += int(s[d])*(pos-d)\r\n\r\nfor d in range(pos+1,len(s)):\r\n if s[d].isdigit():\r\n right += int(s[d])*(d-pos)\r\n\r\nif left == right:\r\n print('balance')\r\nelif right> left:\r\n print('right')\r\nelse:\r\n print('left')", "string=input()\r\npivot=int(0)\r\nfor i in string:\r\n if i==\"^\":\r\n pivot=string.index(i)\r\nsum1=int(0)\r\nsum2=int(0)\r\nfor i in range(len(string)):\r\n if ord(string[i])<=57 and ord(string[i])>=49:\r\n if i<pivot:\r\n sum1+=(int(string[i])*(pivot-(i)))\r\n else:\r\n sum2+=(int(string[i])*((i)-pivot))\r\nif sum1>sum2:\r\n print(\"left\")\r\nelif sum2>sum1:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n# 85=61=36=^93===4==44==35==94===39===15===", "s = input()\r\na = s.find('^')\r\nlength = len(s)\r\ns = list(s)\r\nsum_left = 0\r\ni = -1\r\nsum_right = 0\r\nfor x in s:\r\n i+=1\r\n if(x!='=' and x!='^' and i<a):\r\n x = int(x)\r\n sum_left+=x*(a-i)\r\n\r\n elif(x!='=' and x!='^' and i>a):\r\n x = int(x)\r\n sum_right+=x*(i-a)\r\n\r\nif(sum_right>sum_left):print(\"right\")\r\nelif(sum_right<sum_left):print(\"left\")\r\nelse:print(\"balance\")\r\n\r\n", "#!/usr/bin/python3 -SOO\ndef weight(s):\n w = 0\n for i,x in enumerate(s):\n if x != '=':\n w += (i+1)*int(x)\n return w\nl,r = input().strip().split('^')\na,b = weight(l[::-1]), weight(r)\nif a==b: print('balance')\nelif a<b: print('right')\nelse: print('left')\n", "s=input()\r\nlength=len(s)\r\nflag=0\r\nleft=0\r\nright=0\r\n\r\nfor i in range(length):\r\n if s[i]=='^':\r\n pos=i\r\n break\r\n\r\nfor j in range(pos):\r\n if s[j]!='=':\r\n left+=(pos-j)*(int(s[j]))\r\n\r\nfor j in range(pos+1,length):\r\n if s[j]!='=':\r\n right-=(pos-j)*(int(s[j]))\r\n\r\nif left==right:\r\n print(\"balance\")\r\nelif left>right:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")\r\n", "string = list(input());\r\n\r\nleft = []\r\nright = []\r\nleftTotal = 0\r\nrightTotal = 0\r\nrightSide = False\r\npivot = -1\r\nfor i in range(len(string)):\r\n\tif string[i] == \"^\":\r\n\t\tpivot = i\r\n\r\nfor i in range(len(string)):\r\n\tif \"1\" <= string[i] <= \"9\":\r\n\t\tif rightSide == False:\r\n\t\t\tleftTotal += (int(string[i]) * (pivot-i))\r\n\t\telse:\r\n\t\t\trightTotal += (int(string[i]) * (i-pivot))\r\n\r\nif leftTotal > rightTotal:\r\n\tprint(\"left\")\r\nelif leftTotal < rightTotal:\r\n\tprint(\"right\")\r\nelse:\r\n\tprint(\"balance\")\r\n", "lever = input()\r\nleft, right = lever.split('^')[0],lever.split('^')[1]\r\n\r\nr = 0\r\nl = 0\r\n\r\nfor i,k in enumerate(right) :\r\n if k != '=' :\r\n r += int(k)*(i+1)\r\n\r\nfor i,k in enumerate(left[::-1]) :\r\n if k != '=' :\r\n l += int(k)*(i+1)\r\n\r\nif l < r :\r\n print('right')\r\nelif r< l :\r\n print('left')\r\nelse :\r\n print('balance')\r\n", "s = input()\r\nl = 0\r\nr = 0\r\nc = s.index('^')\r\nfor i in range(len(s)):\r\n\tif(i<c and s[i] != '='):\r\n\t\tl += int(s[i]) * (c-i)\r\n\telif(i>c and s[i] != '='):\r\n\t\tr += int(s[i]) * (i-c)\r\n\telse:\r\n\t\tcontinue\r\n\r\nif(l==r):\r\n\tprint('balance')\r\nelif(l<r):\r\n\tprint('right')\r\nelse:\r\n\tprint('left')", "ip = list(input())\r\nmid = ip.index('^')\r\nval = 0\r\n\r\nfor i in range(len(ip)) : \r\n if '0' <= ip[i] <= '9' : \r\n val += int(ip[i]) * (i - mid)\r\n\r\nprint(['balance', 'right', 'left'][0 if val == 0 else 1 if val > 0 else 2])", "s = str(input())\r\ncentr = s.index('^')\r\nsumma_left = 0\r\nsumma_right = 0\r\nfor i in range(centr):\r\n if s[i] != '=':\r\n summa_left += int(s[i]) * (centr - i)\r\nfor j in range(centr+1, len(s)):\r\n if s[j] != '=':\r\n summa_right += int(s[j]) * (j - centr)\r\nif summa_right > summa_left:\r\n print('right')\r\nelif summa_left == summa_right:\r\n print('balance')\r\nelse:\r\n print('left')", "s = input()\r\nindex = s.find(\"^\")\r\nls = []\r\nfor k,c in enumerate(s):\r\n if str.isdigit(c):\r\n ls.append(int(c)*(index-k))\r\nans = sum(ls)\r\nif ans<0:\r\n print(\"right\")\r\nelif ans>0:\r\n print(\"left\")\r\nelse: \r\n print(\"balance\")", "s=str(input())\r\nm=(s.find('^'))\r\nleft_wt=0\r\nright_wt=0\r\nfor i in range(m):\r\n if s[i]==\"=\":\r\n left_wt+=0\r\n else:\r\n left_wt=left_wt+((m-i)*int(s[i]))\r\nfor j in range(m+1,len(s)):\r\n if s[j]==\"=\":\r\n right_wt+=0\r\n else:\r\n right_wt=right_wt+((j-m)*int(s[j]))\r\nif left_wt>right_wt:\r\n print(\"left\")\r\nif right_wt>left_wt:\r\n print(\"right\")\r\nif right_wt==left_wt:\r\n print(\"balance\")", "string = input().split('^')\r\nleft ,right = 0 , 0\r\nfor i in range(len(string[0])):\r\n if string[0][i] in '123456789':\r\n left += (len(string[0]) - i) * int(string[0][i])\r\nfor i in range(0,len(string[1])):\r\n if string[1][i] in '123456789':\r\n right += (i+1) * int(string[1][i])\r\nif left == right:\r\n print(\"balance\")\r\nelif left > right:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "def get_sum(side):\n result = 0\n \n for i in range(len(side)):\n result += side[i][0] * side[i][1]\n\n return result\n\ndef main():\n left = []\n right = []\n\n s = input()\n # s = \"=^==\"\n middle_pos = s.index(\"^\")\n for i in range(len(s)):\n if s[i] == \"=\" or s[i] == \"^\":\n continue\n\n if i < middle_pos:\n left.append((int(s[i]), abs(middle_pos - i)))\n else:\n right.append((int(s[i]), abs(middle_pos - i)))\n\n left_sum = get_sum(left)\n right_sum = get_sum(right)\n\n if left_sum > right_sum:\n print(\"left\")\n elif right_sum > left_sum:\n print(\"right\")\n else:\n print(\"balance\")\n\nif __name__ == \"__main__\":\n main()\n", "s = input()\r\np = s.find('^')\r\nb = 0\r\nfor i in range(p):\r\n if (s[i] != '='):\r\n b += (ord(s[i]) - ord('0')) * (p - i)\r\nfor i in range(p + 1, len(s)):\r\n if (s[i] != '='):\r\n b -= (ord(s[i]) - ord('0')) * (i - p)\r\nprint('left' if b > 0 else 'right' if b < 0 else 'balance')\r\n", "# Problem Link: https://codeforces.com/problemset/problem/376/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\nlever = input()\r\n\r\nleverIdx = lever.find(\"^\")\r\n\r\nleftForce = 0\r\nrightForce = 0\r\nfor i in range(len(lever)):\r\n if (lever[i] != '=' and lever[i] != '^'):\r\n mass = int(lever[i])\r\n dist = abs(leverIdx - i)\r\n force = mass*dist\r\n if i < leverIdx:\r\n leftForce += force\r\n else:\r\n rightForce += force\r\n\r\nif leftForce == rightForce:\r\n print(\"balance\")\r\nelif leftForce > rightForce:\r\n print(\"left\")\r\nelse:\r\n print(\"right\")", "string = input()\r\nfirst = string.split('^')[0][::-1]\r\nsecond = string.split('^')[1]\r\nleft = 0\r\nright = 0\r\nfor i in range(len(first)):\r\n if first[i].isdigit():\r\n left += (i+1) * int(first[i])\r\nfor i in range(len(second)):\r\n if second[i].isdigit():\r\n right += (i+1) * int(second[i])\r\nif left == right:\r\n print('balance')\r\nelif left > right:\r\n print('left')\r\nelse:\r\n print('right')", "s=input()\r\nlw,cw=0,0\r\nsum=0\r\nmid=s.index(\"^\")\r\nfor i in range(len(s)):\r\n if s[i]!=\"=\" and s[i]!=\"^\":\r\n sum+=int(s[i])*(i-mid)\r\nif sum<0:\r\n print(\"left\")\r\nelif sum>0:\r\n print(\"right\")\r\nelse:\r\n print(\"balance\")\r\n ", "s = input()\np = s.find(\"^\")\nx = list(range(-p, len(s) - p))\nw = sum(0 if s[i] is '=' or s[i] is '^' else int(s[i]) * x[i] for i in range(len(s))) \nif w < 0:\n print(\"left\")\nelif w is 0:\n print(\"balance\")\nelse:\n print(\"right\")\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n l,r = S().split('^')\r\n a = len(l)\r\n b = len(r)\r\n x = [int(l[i])*abs(a-i) for i in range(a) if l[i]!='='] \r\n y = [int(r[i])*(abs(0-i)+1) for i in range(b) if r[i]!='='] \r\n m1 = sum(x)\r\n m2 = sum(y)\r\n if (not x and not y) or m1==m2:\r\n return 'balance'\r\n elif m1>m2:\r\n return 'left'\r\n else:\r\n return 'right'\r\n\r\nif __name__ == '__main__':\r\n print(main())", "s=input()\r\nx=s.index('^')\r\nans=0\r\nfor i in range(len(s)):\r\n if(s[i]=='=' or s[i]=='^'):\r\n continue\r\n if(i<x):\r\n ans+=int(s[i])*(x-i)\r\n else:\r\n ans-=int(s[i])*(i-x)\r\nif(ans==0):\r\n print(\"balance\")\r\nelif(ans>0):\r\n print(\"left\")\r\nelse:\r\n print(\"right\")" ]

[ "from sys import stdin\r\ninp = stdin.readline\r\n\r\nn = int(inp())\r\narr = [0 for i in range(47)]\r\ns = \"aaa\"\r\n\r\nfor i in range(46, -1, -1):\r\n while n >= (i+1)*(i+2)*(i+3)*(i+4)/24:\r\n arr[i] += 1\r\n n -= (i+1)*(i+2)*(i+3)*(i+4)/24\r\n\r\nfor i in range(47):\r\n s += \"a\"\r\n for j in range(arr[i]):\r\n s += \"b\"\r\n\r\nprint(s, \"aaaab\")\r\n\r\n", "n=int(input())\r\ni=0\r\nch=''\r\nd='abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\nn-=1\r\nwhile n>0:\r\n if n%2==0:\r\n ch+=d[i]*2\r\n n//=2\r\n else: ch+=d[i]\r\n i+=1\r\n n-=1\r\nans=d[:i+1]\r\nprint(ch+ans, ans)", "letters=\"abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ\";n=int(input())-1;num=0;x=\"\"\r\nwhile(n>0):\r\n\tif(n%2==1):x+=letters[num];num+=1\r\n\telse:x+=letters[num]*2;num+=1;n=n//2\r\n\tn-=1\r\nprint(x+letters[:num+1],letters[:num+1])" ]

[ "n=int(input())\r\nlis=[]\r\nfor i in range(n):\r\n s,f=map(int,input().split())\r\n lis.append([f,s]) \r\nlis.sort()\r\n\r\n\r\n#now we get sorted wrt b and sorted with a aequentially\r\n\r\ncount=1\r\n#count is already 1\r\n\r\nmaxl=lis[0][0]\r\n#taking b as max ,strating with b\r\nfor i in range(1,len(lis)):\r\n if lis[i][1]>maxl: #checking for a\r\n count=count+1\r\n maxl=lis[i][0] #updating b\r\nprint(count)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = []\r\nfor _ in range(N):\r\n l,r = map(int, input().split())\r\n A.append((r,l))\r\nA.sort()\r\n\r\nans = 0\r\npre = -1\r\nfor r,l in A:\r\n if l>pre:\r\n ans+=1\r\n pre=r\r\nprint(ans)\r\n\r\n", "import sys\r\n\r\n\r\nn = int(sys.stdin.readline())\r\norders = [tuple(map(int, sys.stdin.readline().split())) for _ in range(n)]\r\n\r\norders.sort(key=lambda x: x[1])\r\nprev_r = None\r\ncount = 0\r\nfor l, r in orders:\r\n\tif not prev_r or prev_r < l:\r\n\t\tcount += 1\r\n\t\tprev_r = r\r\n\r\nprint(count)", "n=int(input())\r\njob=[]\r\ncnt=1 \r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n job.append([l,r])\r\njob.sort(key=lambda x:x[1])\r\nprev=job[0][1]\r\nfor i in range(1,n):\r\n if job[i][0]>prev:\r\n cnt+=1 \r\n prev=job[i][1]\r\nprint(cnt)", "n=int(input())\r\nlist1=[]\r\nfor i in range(n):\r\n s,f=map(int,input().split())\r\n list1.append([f,s])\r\n \r\nlist1.sort()\r\nc=1\r\ntemp=list1[0][0]\r\nfor i in range(1,len(list1)):\r\n if list1[i][1]>temp:\r\n c=c+1\r\n temp=list1[i][0]\r\n \r\nprint(c)", "n = int(input())\r\nlis=[]\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n lis.append([b,a])\r\nlis.sort()\r\nans=1\r\nl=lis[0][1]\r\nh=lis[0][0]\r\nfor i in range(1,n):\r\n if lis[i][1]>h :\r\n h = lis[i][0]\r\n ans+=1\r\nprint(ans) \r\n", "n = int(input())\n\nintervals = []\n\nfor i in range(n) :\n l, r = map(int, input().split())\n intervals.append((l, r))\n\nintervals.sort(key = lambda interval : interval[1])\n\nr0 = intervals[0][1]\n\nans = 1\n\nfor i in range(1, n) :\n if intervals[i][0] > r0 :\n ans += 1\n r0 = intervals[i][1]\n\nprint(ans)", "def main():\n tt = list(tuple(map(int, input().split())) for _ in range(int(input())))\n tt.sort(key=lambda e: e.__getitem__(1))\n res = t = 0\n for l, r in tt:\n if t < l:\n t = r\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "# from debug import debug\r\nimport sys;input = sys.stdin.readline\r\n\r\nn = int(input()\t)\r\nmoves = []\r\nfor i in range(n):\r\n\ta,b = map(int, input().split())\r\n\tmoves.append((b, a))\r\nmoves.sort()\r\nuser = 0\r\nno = 0\r\nfor i in range(n):\r\n\tm = moves[i]\r\n\tif user<m[1]:\r\n\t\tuser = m[0]\r\n\t\tno += 1\r\nprint(no)", "import sys\r\nn=int(input())\r\narr=[]\r\nfor _ in range(n):\r\n a=list(map(int,sys.stdin.readline().split()))\r\n arr.append(a)\r\narr=sorted(arr,key=lambda x:x[1])\r\n#print(arr)\r\nans=0\r\nuser=0\r\nfor i in arr:\r\n if user<i[0]:\r\n ans+=1\r\n user=i[1]\r\n \r\n#print(dp)\r\nprint(ans) \r\n \r\n \r\n\r\n \r\n", "\"\"\"\nCodeforces Testing Round #12\n\nProblem 597B. Restaurant\n\n@author yamaton\n@date 2015-11-11\n\"\"\"\n\nimport math\nimport operator\nimport random\nimport sys\nimport functools\nimport collections\n\n\ndef solve(pairs):\n pairs.sort(key=operator.itemgetter(1))\n progress = -1\n cnt = 0\n for (s, f) in pairs:\n if progress < s:\n progress = f\n cnt += 1\n return cnt\n\n\ndef solve0(pairs):\n pairs.sort()\n d = collections.defaultdict(int)\n maxval = 0\n for (s, f) in pairs:\n d[f] = 1 + max((d[k] for k in d.keys() if k < s), default=0)\n maxval = max(maxval, d[f])\n return maxval\n\n\ndef p(*args, **kwargs):\n return print(file=sys.stderr, *args, **kwargs)\n\n\ndef main():\n n = int(input())\n pairs = [tuple(int(i) for i in input().strip().split()) for _ in range(n)]\n result = solve(pairs)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\nt = [list(map(int, input().split(\" \"))) for i in range(n)]\r\n\r\nlast = 0\r\ncount = 0\r\nfor i in sorted(t, key=lambda x: x[1]):\r\n if last < i[0]:\r\n last = i[1]\r\n count += 1\r\nprint(count)", "n=int(input())\r\nlis=[]\r\nfor i in range(n):\r\n s,f=map(int,input().split())\r\n lis.append([f,s]) \r\nlis.sort()\r\ncount=1\r\nmaxl=lis[0][0]\r\nfor i in range(1,len(lis)):\r\n if lis[i][1]>maxl:\r\n count=count+1\r\n maxl=lis[i][0]\r\nprint(count)", "def second(x):\r\n return x[1]\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n arr.append([a,b])\r\narr.sort(key = second)\r\n\r\nans = 1\r\ntill = arr[0][1]\r\nfor i in range(n):\r\n if(arr[i][0] > till):\r\n ans += 1\r\n till = arr[i][1]\r\nprint(ans)", "\r\nn=int(input())\r\n\r\ninv=[]\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n inv.append((l,r))\r\n\r\ninv.sort(key=lambda x: x[1])\r\n\r\nans=0\r\nc=inv[0][1]\r\n\r\n\r\nfor i in range(n-1):\r\n if c>=inv[i+1][0]:\r\n ans+=1\r\n else:\r\n c=inv[i+1][1]\r\nprint(n-ans)", "import sys\r\nfrom sys import stdin, stdout \r\ndef R():\r\n return map(int, stdin.readline().strip().split())\r\n\r\narr = []\r\nfor h in range(int(stdin.readline().strip())):\r\n arr.append(list(R()))\r\n\r\narr.sort(key = lambda x:x[1])\r\n\r\ns, d = 0, 0\r\n\r\nfor i in arr:\r\n if i[0] > d:\r\n s += 1\r\n d = i[1]\r\n\r\nstdout.write(str(s))\r\n\r\n", "r = lambda: map(int, input().split())\r\n\r\nn, = r()\r\na = sorted(tuple(r()) for _ in range(n))[::-1]\r\n\r\nret, left = 0, 10**9 + 1\r\nfor l, r in a:\r\n\tif r < left:\r\n\t\tret += 1\r\n\t\tleft = l\r\n\r\nprint(ret)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n#// - remember to add .strip() when input is a string\r\n\r\nn = int(input())\r\n\r\nlis = []\r\n\r\nfor i in range(n):\r\n\r\n start, finish = map(int,input().split())\r\n\r\n lis.append([start,finish])\r\n\r\n\r\nlis.sort(key=lambda x: x[1])\r\n\r\nans = 0\r\n\r\nright = -1\r\n\r\nfor i in lis:\r\n\r\n if i[0] > right:\r\n\r\n right = i[1]\r\n ans += 1\r\n\r\nprint(ans)", "def key_tri(argument):\n return argument[1]\n\nn = int(input())\nL = [list(map(int, input().split())) for _ in range(n)]\nL.sort(key=key_tri)\nr = 1\nt = L[0][1]\nfor k in range(1,n):\n if L[k][0]>t:\n r+=1\n t = L[k][1]\nprint(r)\n", "def f(x):\r\n return x[1]\r\n\r\nn = int(input())\r\nL = []\r\nfor i in range(n):\r\n order = [int(s) for s in input().split()]\r\n L.append(order)\r\nL = sorted(L,key=f)\r\nlast = [L[0][1]]\r\nitem = 1\r\nwhile item < n:\r\n while item < n-1 and (L[item][1] <= last[-1] or L[item][0] <= last[-1]):\r\n item += 1\r\n if L[item][1] > last[-1] and L[item][0] > last[-1]:\r\n last.append(L[item][1])\r\n item += 1\r\nprint(len(last))", "##def srt(A):\r\n## return A[1]\r\n##x = int(input())\r\n##ords = []\r\n##for i in range(x):\r\n## s,f = map(int,input().split())\r\n## ords.append((s, f))\r\n##\r\n##ords.sort(key=srt)\r\n##fm = 0\r\n##sm = 0\r\n##orders = 0\r\n##for i in ords:\r\n## if i[0] > fm and i[1] > sm:\r\n## orders += 1\r\n## sm = i[0]\r\n## fm = i[1]\r\n## print(i, sm, fm, orders)\r\n##\r\n##print(orders)\r\n\r\n# Now let's implement the solve step by step\r\n\r\n# Let's create a list that will store all of the orders\r\norders = []\r\n\r\n# Let's read the inputs\r\nn = int(input())\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n orders.append((a, b))\r\n\r\n# Now let's sort the orders list using the end times\r\norders.sort(key=lambda a: a[1])\r\n\r\n# Now let's implement the searching process\r\norders_count = 0\r\nfirst_max = 0\r\nend_max = 0\r\n\r\nfor i in orders:\r\n if i[0] > first_max and i[0] > end_max:\r\n first_max = i[0]\r\n end_max = i[1]\r\n orders_count += 1\r\n \r\nprint(orders_count)\r\n", "r = lambda: map(int, input().split())\n\nn, = r()\na = sorted(tuple(r()) for _ in range(n))[::-1]\n\ntotal, left = 0, 10**9 + 1\nfor l, r in a:\n\tif r < left:\n\t\ttotal += 1\n\t\tleft = l\n\nprint(total)", "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])\r\na.sort(key=lambda x:x[1])\r\ntmp = a[0][1]\r\ntot = 1\r\nfor i in range(1,len(a)):\r\n if (tmp < a[i][0]):\r\n tot += 1\r\n tmp = a[i][1]\r\nprint(tot)\r\n\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((b,a))\r\nl.sort()\r\nans = 0\r\ncur = -1\r\nfor i in l:\r\n if cur < i[1]:\r\n ans += 1\r\n cur = i[0]\r\nprint(ans)\r\n", "n = int(input())\r\nq = []\r\nfor i in range(n):\r\n l , r = [int(x) for x in input().split()]\r\n q.append([r, l])\r\nq.sort()\r\nprev, ans = 0, 0\r\nfor i in range(n):\r\n start = q[i][1]\r\n end = q[i][0]\r\n\r\n if start > prev:\r\n ans += 1\r\n prev = end\r\nprint(ans)\r\n \r\n", "s=d=0\r\nt=[list(map(int, input().split()))for i in range(int(input()))]\r\nfor l,r in sorted(t,key=lambda q:q[1]):\r\n if l>d:s,d=s+1,r\r\nprint(s)", "orders = []\r\nfor _ in range(int(input())):\r\n l, r = map(int, input().split())\r\n orders.append([l, r])\r\n\r\norders.sort()\r\n\r\ncount = 0\r\nwhile len(orders) > 1:\r\n if orders[-2][0] == orders[-1][0]:\r\n orders.pop(-2) if orders[-2][1] > orders[-1][1] else orders.pop(-1)\r\n elif orders[-2][1] >= orders[-1][0]:\r\n orders.pop(-2)\r\n else:\r\n orders.pop(-1)\r\n count+=1\r\n\r\nif len(orders) == 1:\r\n count+=1\r\n\r\nprint(count)\r\n", "def snd(lst):\n return lst[1]\nn = int(input())\nl = []\nfor i in range(0, n):\n l.append([int(i) for i in input().split()])\nl.sort(key=snd)\ne = 0\nans = 0\nfor p in l:\n if (p[0] > e):\n ans+=1\n e = p[1]\nprint(ans)\n", "def main():\n res = t = 0\n for l, r in sorted((tuple(map(int, input().split())) for _ in range(int(input()))), key=lambda e: e[1]):\n if t < l:\n t = r\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "import heapq\r\n\r\nstart_end_tab = []\r\norders_n = int(input())\r\nfor i in range(orders_n):\r\n order = input().split(\" \")\r\n for j in range(len(order)):\r\n order[j] = int(order[j])\r\n start_end_tab.append(order)\r\n\r\nmin_endtimes = []\r\nmax_endtime_current = 0\r\nfor order in start_end_tab:\r\n heapq.heappush(min_endtimes, (order[1], order[0]))\r\n\r\nmax_orders = 0\r\nwhile min_endtimes != []:\r\n min_order = heapq.heappop(min_endtimes)\r\n if min_order[1] <= max_endtime_current:\r\n continue\r\n max_endtime_current = min_order[0]\r\n max_orders+=1\r\n\r\nprint(max_orders)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(tuple(map(int, input().split())))\r\n\r\na.sort(key=lambda x: x[1])\r\n\r\nl = 0\r\nres = 0\r\nfor v in a:\r\n if v[0] > l:\r\n res += 1\r\n l = v[1]\r\n\r\nprint(res)\r\n", "n = int(input())\norders = []\nfor _ in range(n):\n l, r = map(int, input().split())\n orders.append((l, r))\n\norders.sort(key=lambda x: x[1]) # Сортировка по моменту окончания ri\ncount = 1\nlast_end = orders[0][1]\n\nfor i in range(1, n):\n l, r = orders[i]\n if l > last_end:\n count += 1\n last_end = r\n\nprint(count)\n", "from collections import Counter\r\nn=int(input())\r\nr=Counter()\r\nfor i in range (0,n):\r\n\r\n [a,b]=list(map(int, input().split(' ')))\r\n\r\n if r[a]==0:\r\n r[a]=b\r\n else:\r\n r[a]=min(r[a],b)\r\ny=[[i,r[i]] for i in r]\r\ny.sort(key=lambda x:x[1])\r\nans=0\r\ns=0\r\nfor i in range (0,len(y)):\r\n [a,b]=y[i]\r\n if a>s:\r\n s=b\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\na = [] \r\nfor i in range(n):\r\n a.append(tuple(reversed(list(map(int, input().split())))))\r\na.sort()\r\nc = 0\r\nans = 0\r\nfor i in range(n):\r\n if c < a[i][1]:\r\n c = a[i][0]\r\n ans += 1\r\nprint(ans)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nt = []\r\nfor _ in range(n):\r\n t.append([int(x) for x in input().split()])\r\n\r\nt.sort()\r\nr = 0; ans = 0\r\nfor L, R in t:\r\n if L > r:\r\n ans += 1\r\n r = R\r\n else:\r\n r = min(r, R)\r\nprint(ans)", "a=int(input())\r\nb=[]\r\ntotal=0\r\nfor i in range(a):\r\n x,y=map(int,input().split())\r\n b.append([x,y])\r\nb.sort(key=lambda x: x[1])\r\nending=0\r\nfor i in b:\r\n if i[0]>ending:\r\n total+=1\r\n ending=i[1]\r\nprint(total)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(0,n):\r\n x=list(map(int,input().split()))\r\n a.append(x)\r\na.sort(key=lambda x:x[1])\r\ncount=1\r\nr=a[0][1]\r\nfor i in range(1,n):\r\n if(a[i][0]>r):\r\n r=a[i][1]\r\n count+=1\r\nprint(count)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n ", "def main():\n res = t = 0\n for r, l in sorted((tuple(map(int, reversed(input().split()))) for _ in range(int(input())))):\n if t < l:\n t = r\n res += 1\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nans=[]\r\nfor _ in range(n):\r\n l,r=map(int,input().split())\r\n ans.append((l,r))\r\nans.sort(key=lambda x:x[1])\r\nres=1\r\na,b=ans[0][0],ans[0][1]\r\nfor p,o in ans[1:]:\r\n if p>=b+1:\r\n a=p\r\n b=o\r\n res+=1\r\n else :\r\n pass\r\nprint(res)", "n=int(input())\r\nfrom sys import stdin\r\na=lambda:stdin.readline().split()\r\nlst=sorted([[*map(int,input().split())]\r\n for _ in range(n)], key=lambda x:x[1])\r\nres,last=0,0\r\nfor i,(x,y) in enumerate(lst):\r\n if last<x:last=y;res+=1\r\nprint(res)", "n = int(input())\r\n\r\na = [tuple(map(int, input().split())) for _ in range(n)]\r\n#print(a)\r\na.sort(key = lambda x : x[1])\r\nmax_r = -10**10\r\nans = 0\r\nfor l, r in a:\r\n if l > max_r:\r\n ans += 1\r\n max_r = r\r\nprint(ans)\r\n \r\n", "ints = lambda:list(map(int,input().split()))\r\nrd = lambda:input()\r\nn=ints()[0]\r\nA = []\r\nfor i in range(n):\r\n l,r = ints()\r\n A.append((r,r-l))\r\nA.sort()\r\ncnt,ct = 0,0\r\nfor p in A:\r\n if ct + p[1] > p[0]:\r\n continue\r\n else:\r\n ct = p[0] + 1\r\n cnt+=1\r\nprint (cnt)\r\n", "n = int(input())\r\n\r\ndata = []\r\n\r\nfor num in range(n):\r\n t = input()\r\n (l, r) = t.split(\" \")\r\n l = int(l)\r\n r = int(r)\r\n data.append((l, r))\r\n\r\ndata = sorted(data, key = lambda s : s[1])\r\n\r\nnum = 1\r\n\r\nci = data[0]\r\n\r\nfor item in data:\r\n (il, ir) = item\r\n (cl, cr) = ci\r\n if (il > cr):\r\n ci = item\r\n num += 1\r\n\r\nprint(num)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\ta.append((y,x))\r\na.sort()\r\ncnt=0;cur=-10\r\ni=0\r\nwhile i<n:\r\n\tif cur<a[i][1]:\r\n\t\tcur=a[i][0]\r\n\t\tcnt+=1\r\n\ti+=1\r\nprint(cnt)\r\n", "n=int(input())\r\na=[]\r\nfor _ in range(n):\r\n x,y=map(int,input().split())\r\n a.append((x,y))\r\na=sorted(a,key=lambda y: (y[0],y[1]-y[0]))\r\nprev=(0,0)\r\norders=0\r\nfor order in a:\r\n s,e=order\r\n if s>prev[1]:\r\n prev=order\r\n orders+=1\r\n elif e<prev[1]:\r\n prev=order\r\nprint(orders)", "cin = lambda:map(int,input().split())\r\nn, = cin()\r\na=[]\r\ncount=1\r\nfor i in range(0,n):\r\n a.append(tuple(list(cin())[::-1]))\r\na.sort() \r\nref = a[0][0]\r\nfor i in range(1,len(a)):\r\n if a[i][1]>ref:\r\n count+=1\r\n ref=a[i][0] \r\nprint(count)" ]

[ "input_func = lambda: [int(q) - 1 for q in input().split()]\r\ndef cmpltbl_msn():\r\n for i in msn_list:\r\n if msn_com_crspnd[i] == com and not c_data[i]: return i\r\n \r\nr = range(int(input()))\r\ntime, msn_com_crspnd = 1e9, input_func()\r\ndata = [set(input_func()[1:]) for i in r]\r\n \r\nfor com in (0, 1, 2):\r\n msn_list = list(r)\r\n t = -1\r\n c_data = [q.copy() for q in data]\r\n \r\n while msn_list:\r\n i = cmpltbl_msn()\r\n while i != None:\r\n t += 1\r\n msn_list.remove(i)\r\n for q in c_data : q.discard(i)\r\n i = cmpltbl_msn()\r\n com = (com + 1) % 3\r\n t += 1\r\n \r\n time = min(t, time)\r\n \r\nprint(time)", "read = lambda: [int(i) - 1 for i in input().split()]\n\nn = int(input())\nhouse = read()\nprec = [set(read()[1:]) for i in range(n)]\n\ndef sub(): # do the job if the precedence is cleared\n for i in job_list:\n if house[i] == k and not tmp_prec[i]:\n return i\n\nans = float(\"inf\")\nfor k in [0, 1, 2]:\n job_list = [i for i in range(n)] \n tmp = -1\n tmp_prec = [sub_prec.copy() for sub_prec in prec] \n while job_list: # while job not done\n i = sub()\n while i != None: #exit if we are done\n tmp += 1\n job_list.remove(i) # 'list' object has no attribute 'discard', only for set\n for q in tmp_prec: \n q.discard(i) # remove the job from all prec\n i = sub()\n k += 1\n k %= 3\n tmp += 1 # move\n \n ans = min(tmp, ans)\n \nprint(ans)\n \t \t\t \t\t\t\t \t\t\t \t\t\t \t\t\t\t \t\t \t\t\t", "from collections import *\n\nread_line = lambda: [int(i) for i in input().split(' ')]\n\nn = read_line()[0]\ncs = [c - 1 for c in read_line()]\ng = [[] for v in range(n)]\nparent_cnt = [0] * n\nfor v in range(n):\n parents = read_line()\n parent_cnt[v] = len(parents) - 1\n for i in range(1, len(parents)):\n g[parents[i] - 1].append(v)\n\ndef work(x):\n pcnt = list(parent_cnt)\n qs = [\n deque(v for v in range(n) if cs[v] == c and pcnt[v] == 0)\n for c in range(3)\n ]\n ans = 0\n while True:\n while qs[x]:\n v = qs[x].popleft()\n ans += 1\n for w in g[v]:\n pcnt[w] -= 1\n if pcnt[w] == 0:\n qs[cs[w]].append(w)\n if qs[0] or qs[1] or qs[2]:\n ans += 1\n x = (x + 1) % 3\n else:\n break\n return ans\n\nprint(min(work(i) for i in range(3)))\n", "f = lambda: [int(q) - 1 for q in input().split()]\r\ndef g():\r\n for i in p:\r\n if h[i] == k and not v[i]: return i\r\n\r\nr = range(int(input()))\r\nt, h = 1e9, f()\r\nu = [set(f()[1:]) for i in r]\r\n\r\nfor k in (0, 1, 2):\r\n p = list(r)\r\n d = -1\r\n v = [q.copy() for q in u]\r\n\r\n while p:\r\n i = g()\r\n while i != None:\r\n d += 1\r\n p.remove(i)\r\n for q in v: q.discard(i)\r\n i = g()\r\n k = (k + 1) % 3\r\n d += 1\r\n\r\n t = min(d, t)\r\n\r\nprint(t)" ]

[ "d = {'polycarp': 1}\r\nn = int(input())\r\nfor i in range(n):\r\n s = input().split()\r\n name1, name2 = s[0].lower(), s[2].lower()\r\n x = d[name2]\r\n d[name1] = x + 1\r\nprint(max(d.values()))", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\ng = [input()[:-1].lower().split(' reposted ') for _ in range(n)]\r\nd = defaultdict(int)\r\nd['polycarp'] = 1\r\nfor i in range(n):\r\n d[g[i][0]] += d[g[i][1]] + 1\r\nprint(max(d.values()))\r\n", "__author__ = 'Utena'\r\nn=int(input())\r\nreposts=dict()\r\nfor i in range(n):\r\n s=input().split()\r\n reposts[s[0].lower()]=s[2].lower()\r\nprev=['polycarp']\r\nt=1\r\nwhile True:\r\n next=[]\r\n for a in reposts.keys():\r\n if reposts[a] in prev:\r\n next.append(a)\r\n if next==[]:\r\n break\r\n else:\r\n t+=1\r\n prev=next\r\nprint(t)", "n = int(input())\r\na = {}\r\na['polycarp'] = 1\r\nfor i in range(n):\r\n inp = input().split()\r\n a[inp[0].lower()] = a[inp[2].lower()] + 1\r\nmx = 0\r\nfor key in a:\r\n mx = max(mx, a[key])\r\nprint(mx)", "'''\nhttp://codeforces.com/problemset/problem/522/A\n'''\n\ndef get_max_chain_length():\n '''Traverses the repost graph to get max length.'''\n users = int(input())\n user_map = {'polycarp': 0}\n tree = {0: -1}\n for i in range(users):\n n1, _repost, n2 = map(str.lower, input().split())\n user_map[n1] = i + 1\n tree[i + 1] = user_map[n2]\n \n max_count = 0\n\n for node in user_map:\n count = 0\n j = user_map[node]\n while j != -1:\n count += 1\n j = tree[j]\n if count > max_count:\n max_count = count\n \n print(max_count)\n\nget_max_chain_length()", "n=int(input())\r\np={'polycarp':1}\r\nc=0\r\nfor i in range(n):\r\n\tl=[x.lower() for x in input().split()]\r\n\tp[l[0]]=p[l[2]]+1\r\nprint(max(p.values()))", "from collections import defaultdict\r\n\r\ndef dfstraverse(g,dist,arg,visit):\r\n for i in g[arg]:\r\n if visit[i]==-1:\r\n visit[i]=1\r\n dist[i] = dist[arg]+1\r\n dfstraverse(g,dist,i,visit)\r\n\r\ng = defaultdict(list)\r\nvisit = defaultdict()\r\n\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n u,v = input().split(' reposted ')\r\n u = u.lower()\r\n v = v.lower()\r\n g[u].append(v)\r\n g[v].append(u)\r\n visit[u] = -1\r\n visit[v] = -1\r\n\r\ndist = defaultdict()\r\ndist['polycarp'] = 1\r\nvisit['polycarp'] = 1\r\ndfstraverse(g,dist,'polycarp',visit)\r\n\r\nprint(max(dist.values()))", "global maxval\r\nmaxval = 0\r\ndef dfs(node, g, val):\r\n\tglobal maxval\r\n\tmaxval = max(maxval, val)\r\n\tif node in g:\r\n\t\tfor i in g[node]:\r\n\t\t\tdfs(i, g, val+1)\r\n\r\n\r\n\r\nn = int(input())\r\ng={}\r\n\r\n\r\n\r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\ts = s.lower().split()\r\n\tif s[2] in g:\r\n\t\tg[s[2]].append(s[0])\r\n\t\t\r\n\telse:\r\n\t\tg[s[2]] = [s[0]]\r\n\t\r\ndfs(\"polycarp\", g, 1)\r\nprint(maxval)\r\n\r\n", "d={'polycarp':[]}\r\nfor _ in range(int(input())):\r\n\r\n s=input().lower().split()\r\n name1,name2=s[0],s[2]\r\n\r\n d[name2].append(name1)\r\n d[name1]=[]\r\n\r\nstack=['polycarp']\r\nvisited={'polycarp'}\r\nlevel={'polycarp':1}\r\nwhile stack:\r\n a=stack.pop()\r\n for i in d[a]:\r\n if i not in visited:\r\n visited.add(i)\r\n stack.append(i)\r\n level[i]=level[a]+1\r\n\r\nprint(max(list(level.values())))\r\n \r\n", "n=int(input())\r\nht={\"polycarp\":1}\r\nm=0\r\nfor i in range(n):\r\n inp=input().split(\" \")\r\n ht[inp[0].lower()]=ht[inp[2].lower()]+1\r\n temp=ht[inp[0].lower()]\r\n m=max(m, temp)\r\n\r\nprint(m)\r\n", "# https://codeforces.com/problemset/problem/522/A\n\nn = int(input())\n\nadj = {\"polycarp\": []}\n\n\ndef dfs(node):\n if node not in adj:\n return 1\n cnt = 0\n for x in adj[node]:\n cnt = max(dfs(x), cnt)\n return cnt + 1\n\n\nwhile n:\n INPUT = input().split()\n u, v = INPUT[0].lower(), INPUT[2].lower()\n if v in adj:\n adj[v].append(u)\n else:\n adj[v] = [u]\n n -= 1\nprint(dfs(\"polycarp\"))\n", "from collections import defaultdict\n\n\ndef dfs(root, adjList):\n if not root:\n return 0\n height = 0\n for x in adjList[root]:\n height = max(height, 1 + dfs(x, adjList))\n return height\n\n\nadjList = defaultdict(list)\nfor i in range(int(input())):\n a, b, c = input().lower().split()\n adjList[c].append(a)\nres = dfs(\"polycarp\", adjList) + 1\nprint(res)\n", "import sys\nreadints=lambda:map(int, input().strip('\\n').split())\n\nn=int(input())\n\nreposts={}\n\n\nfor _ in range(n):\n s=input().split(' ')\n a=s[0].strip().lower()\n b=s[2].strip().lower()\n\n if b not in reposts:\n reposts[b] = 1\n reposts[a] = reposts[b] + 1\n\n\nans = 0\nfor k in reposts:\n ans = max(ans, reposts[k])\n\nprint(ans)\n", "n=int(input())\r\ndic={\"polycarp\":1}\r\nfor i in range(n):\r\n\ta,b,c=map(str,input().lower().split( ))\r\n\t#print(a,b,c)\r\n\tdic[a]=dic[c]+1\r\nprint(max(dic.values()))", "d={}\r\nd['polycarp'], h=1, 1\r\nn = int(input())\r\nfor i in range(0, n):\r\n a,b,c=input().lower().split()\r\n d[a]=d[c]+1\r\nprint (max(d.values()))", "d={'polycarp':1}\nfor _ in range(int(input())):a,b,c=input().lower().split();d[a]=d[c]+1\nprint(max(d.values()))\n", "def dfs(node,d):\r\n global maxD\r\n maxD = max(maxD,d)\r\n stack = [node]\r\n seen[node] = 1\r\n while stack:\r\n ele = stack.pop()\r\n for each in arr[ele]:\r\n if seen[each] == 0:\r\n dfs(each,d+1)\r\n \r\n \r\n\r\ndic = {}\r\narr = [list() for i in range(205)]\r\nind = 0\r\nmaxD = 0\r\nseen = [0] * 205\r\nfor i in range(int(input())):\r\n a,_,b = input().split()\r\n a = a.lower()\r\n b = b.lower()\r\n if b not in dic:\r\n dic[b] = ind\r\n ind += 1\r\n if a not in dic:\r\n dic[a] = ind\r\n ind += 1\r\n arr[dic[a]].append(dic[b])\r\n arr[dic[b]].append(dic[a])\r\n\r\ndfs(0,1)\r\nprint(maxD)", "n = int(input())\r\nmp = {\r\n \"polycarp\" : 1\r\n}\r\nmx = 1\r\nfor i in range(n) :\r\n d , r , s = input().split();\r\n mp[d.lower()] = mp[s.lower()] + 1\r\n mx = max(mx , mp[d.lower()])\r\nprint(mx)", "n = int(input())\r\ni=0\r\ns=[]\r\nk=[]\r\nx=[]\r\nwhile i<n:\r\n s.append(input().lower().split(' reposted '))\r\n i=i+1\r\nk.append([\"polycarp\", 1])\r\nfor l in k:\r\n for z in s:\r\n if z[1]==l[0]:\r\n k.append([z[0],l[1]+1])\r\nfor l in k:\r\n x.append(l[1]) \r\nprint(max(x))", "n = int(input())\r\nprnt = {'polycarp' : None}\r\ns = set({'polycarp'})\r\nfor i in range(n):\r\n c, p = input().lower().split(\" reposted \")\r\n prnt[c] = p\r\n s.update({c, p})\r\n\r\nans = -1\r\nfor i in s:\r\n h = 0\r\n k = i\r\n while( k is not None):\r\n h = h + 1\r\n k = prnt[k]\r\n ans = max(ans, h)\r\n\r\nprint(ans)\r\n", "n = int(input())\n\npairs = []\nidx = dict()\ncount = 0\n\nfor _ in range(n):\n a, b, c = map(lambda x: x.lower(), input().split())\n if a not in idx:\n idx[a] = count\n count += 1\n if c not in idx:\n idx[c] = count\n count += 1\n pairs.append((a, c))\n\nelems = len(idx)\nparent = [i for i in range(elems)]\n\nfor tup in pairs:\n parent[idx[tup[0]]] = idx[tup[1]]\n\nmaxChain = 0\n\nfor i in range(elems):\n cur = i\n chain = 1\n\n while parent[cur] != cur:\n cur = parent[cur]\n chain += 1\n\n maxChain = max(chain, maxChain)\n\nprint(maxChain)", "n = int(input())\r\nl = {'POLYCARP': 1}\r\nans = 0\r\nfor i in range(n):\r\n s = input().split(' ')\r\n a = s[0].upper()\r\n b = s[2].upper()\r\n curr = l[b]+1\r\n if curr > ans:\r\n ans = curr\r\n l[a] = curr\r\nprint(ans)\r\n", "n = int(input())\r\na={}\r\na['polycarp']=1\r\nfor i in range(n):\r\n f,m,l = input().lower().split()\r\n a[f] = a[l]+1\r\nprint(max(a.values()))\r\n ", "def main():\r\n\tn = int(input())\r\n\tdepth = {'polycarp': 1}\r\n\tfor _ in range(n):\r\n\t\tb, _, a = map(lambda x: x.lower(), input().split())\r\n\t\tdepth[b] = depth[a] + 1\r\n\r\n\tprint(max(depth.values()))\r\n\r\nmain()", "\r\nt = int(input())\r\nchain = {}\r\nchain[\"polycarp\"] = 1\r\nans = 1\r\n\r\nfor _ in range(t):\r\n\ts1,_,s2 = map(str,input().split())\r\n\ts1 = s1.lower()\r\n\ts2 = s2.lower()\r\n\tchain[s1] = chain[s2] + 1\r\n\tans = max(chain[s1], ans)\r\n\r\nprint(ans)", "import collections\r\nheight,visited={},{}\r\ndef bfs(s):\r\n height[s]=1\r\n ans.append(1)\r\n visited[s]=True\r\n q=collections.deque()\r\n q.append(s)\r\n while len(q)>0:\r\n s=q.popleft()\r\n #print(s,dic[s])\r\n if dic.get(s,-1)==-1:\r\n continue\r\n #print(s)\r\n for i in dic[s]:\r\n if visited.get(i,False)==True:\r\n continue\r\n visited[i]=True\r\n height[i]=height[s]+1\r\n \r\n ans.append(height[i])\r\n #print(i,height[i],ans)\r\n q.append(i)\r\n \r\n \r\nans=[]\r\ndic={}\r\nfor n in range(int(input())):\r\n n1,x,n2=input().split()\r\n n1=n1.lower()\r\n n2=n2.lower()\r\n #print(n1,n2)\r\n if dic.get(n2,-1)==-1:\r\n dic[n2]=[]\r\n dic[n2].append(n1)\r\n#print(dic)\r\nbfs('polycarp')\r\nprint(max(ans))", "from collections import defaultdict\nadj=defaultdict(lambda:1)\nadj['polycarp']=1\nn=int(input())\nl=0\nwhile n>0:\n\tn-=1\n\ts=input().lower().split()\n\tadj[s[0]]=adj[s[-1]]+1\n\tl=max(adj[s[0]],l)\nprint(l)\n", "n = int(input())\n# records = []\n#\n# for _ in range(n):\n# records.append(input().lower())\n\ndic = {}\ndic[\"polycarp\"] = 1\nfor _ in range(n):\n sentence = input().lower().split()\n dic[sentence[0]] = dic[sentence[-1]] + 1\n\nmax = -1\nfor key in dic.keys():\n if dic[key] > max:\n max = dic[key]\n\nprint(max)\n \t\t \t \t \t \t \t\t\t \t \t \t\t \t", "n = int(input())\r\ngraph = {\"polycarp\":[]}\r\n#adjlist\r\nfor i in range(n):\r\n\tinformation = input().split(' ')\r\n\tfriend = information[0]\r\n\tfriend = friend.lower()\r\n\tperson = information[2]\r\n\tperson = person.lower()\r\n\tgraph[friend] = []\r\n\tgraph[person].append(friend)\r\n\r\ndef dfs(g, src, cnt = 0):\r\n\tans = cnt\r\n\tfor frend in g[src]:\r\n\t\ttemp = dfs(g, frend,cnt+1)\r\n\t\tif temp>ans:\r\n\t\t\tans = temp\r\n\treturn ans\r\nprint(dfs(graph, \"polycarp\")+1)\r\n\r\n\r\n", "n = int(input())\r\ndists = {\"polycarp\": 1}\r\n\r\nfor _ in range(n):\r\n tokens = input().split()\r\n left_name = tokens[0].strip().lower()\r\n right_name = tokens[-1].strip().lower()\r\n \r\n dists[left_name] = dists[right_name] + 1\r\n\r\nprint(max(dists.values()))", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 998244353\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\ndef pe(s): return print(str(s), file=sys.stderr)\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\n\ndef main():\n n = I()\n aa = [LS() for _ in range(n)]\n e = collections.defaultdict(set)\n for a,_,b in aa:\n e[b.lower()].add(a.lower())\n\n m = {}\n def f(c):\n if c in m:\n return m[c]\n r = 1\n for nc in e[c]:\n t = f(nc)\n if r <= t:\n r = t + 1\n m[c] = r\n return r\n\n r = 0\n for k in list(e.keys()):\n t = f(k)\n if r < t:\n r = t\n\n return r\n\n\nprint(main())\n\n", "n=int(input())\r\nparents={'polycarp':1}\r\nfor i in range(n):\r\n name1,name2=[i.lower() for i in input().split(' reposted ')]\r\n parents[name1]=parents[name2]+1\r\nans=max(parents.values())\r\nprint(ans)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nans = 1\r\n\r\ng = defaultdict(int)\r\n\r\ng[\"polycarp\"] = 1\r\n\r\nfor _ in range(n):\r\n a,b,c = input().split()\r\n a = a.lower()\r\n c = c.lower()\r\n\r\n g[a] = g[c]+1\r\n\r\n if g[a] > ans:\r\n ans = g[a]\r\n\r\nprint(ans)\r\n", "def solve():\n \n n = int(input())\n\n d = {'polycarp': 1}\n\n for i in range(n):\n s = input().split()\n if s[0].lower() not in d.keys():\n d[s[0].lower()] = d[s[-1].lower()] + 1\n \n print(max(d.values()))\n\n\ndef main():\n solve()\n\n\nif __name__ == '__main__':\n main()\n\n\t \t\t \t\t \t \t \t\t \t\t\t\t\t \t\t\t \t", " \r\n##########################################################\r\nfrom collections import Counter\r\n# c=sorted((i,int(val))for i,val in enumerate(input().split()))\r\nimport heapq\r\n# c=sorted((i,int(val))for i,val in enumerate(input().split()))\r\n# n = int(input())\r\n# ls = list(map(int, input().split()))\r\n# n, k = map(int, input().split())\r\n# n =int(input())\r\n# e=list(map(int, input().split()))\r\nfrom collections import Counter\r\n#print(\"\\n\".join(ls))\r\n#print(os.path.commonprefix(ls[0:2]))\r\n#for i in range(int(input())):\r\n#n=int(input())\r\n \r\nn=int(input())\r\nd={}\r\nd[\"polycarp\"]=1\r\n \r\nfor i in range(n):\r\n s=input().lower().split(\" \")\r\n d[s[0]]=d[s[2]]+1\r\nprint(max(d.values()))", "class Solution:\n\n\tdef solve(self, reposts, n):\n\t\tlookup = {'polycarp': 1}\n\n\t\tfor repost in reposts:\n\n\t\t\tname1, _, name2 = repost.split(\" \")\n\n\t\t\tlookup[name1] = 1 + lookup[name2]\n\n\t\tprint(max(lookup.values()))\n\t\treturn\n\ndef main():\n\t\n\t# t = int(input())\n\tt = 1\n\n\tsol = Solution()\n\n\twhile t:\n\t\tn = int(input())\n\t\t\n\t\treposts = []\n\t\tfor _ in range(n):\n\t\t\treposts.append(input().lower())\n\n\t\tsol.solve(reposts, n)\n\n\t\tt -= 1\n\nif __name__ == '__main__':\n\n\tmain()", "#!/usr/bin/python\n\nclass Node(object):\n def __init__(self, name):\n self.name = name\n self.childs = []\n def add_child(self, child):\n self.childs.append(child)\n\nmax_depth = 1\ndef dfs(node, depth):\n if len(node.childs) == 0:\n global max_depth\n max_depth = max(max_depth, depth)\n return\n for child in node.childs:\n dfs(child, depth+1)\n\np2node = {}\nroot_p = 'polycarp'\n\nn = int(input())\nfor i in range(n):\n p_to, _, p_from = input().split()\n p_from = p_from.lower()\n p_to = p_to.lower()\n\n if p_from not in p2node:\n p2node[p_from] = Node(p_from)\n if p_to not in p2node:\n p2node[p_to] = Node(p_to)\n p2node[p_from].add_child(p2node[p_to])\n\ndfs(p2node[root_p], 1)\nprint(max_depth)\n\n \t \t\t \t\t \t \t\t \t \t \t \t \t \t", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline().rstrip())\r\n\r\ntree = {}\r\n\r\nfor k in range(n):\r\n line = stdin.readline().rstrip()\r\n name1, name2 = line.split(' reposted ')\r\n name1, name2 = name1.lower(), name2.lower()\r\n if name2 not in tree:\r\n tree[name2] = []\r\n tree[name2].append(name1)\r\n\r\npopularity = {\"polycarp\" : 1}\r\nchampion = \"polycarp\"\r\nqueue = [\"polycarp\"]\r\nwhile queue:\r\n name, queue = queue[0], queue[1:]\r\n if name not in tree:\r\n continue\r\n for reposter in tree[name]:\r\n popularity[reposter] = 1 + popularity[name]\r\n if popularity[reposter] > popularity[champion]:\r\n champion = reposter\r\n queue.append(reposter)\r\n \r\nprint(popularity[champion])\r\n", "dict = {\"polycarp\":1}\r\nfor i in range(int(input())):\r\n s=input().lower().split(\" reposted \");\r\n dict[s[0]]=dict[s[1]]+1;\r\nprint(dict[max(dict,key=dict.get)])", "n = int(input())\r\nl = [2 for i in range(201)]\r\nd = {\"polycarp\" : None}\r\nfor i in range(n):\r\n l1 = input().lower().split(' ')\r\n child = l1[0]\r\n parent = l1[2]\r\n d[child] = parent\r\n while d[parent] != None:\r\n parent = d[parent]\r\n l[i] +=1\r\nprint(max(l))", "n = int(input())\r\nD = dict()\r\nD[\"polycarp\"] = 1\r\nmax1 = 0\r\nfor i in range(n):\r\n str1 = input()\r\n sp = str1.split(\" \")\r\n D[sp[0].lower()] = D[sp[2].lower()] + 1\r\n if D[sp[0].lower()] > max1:\r\n max1 = D[sp[0].lower()]\r\nprint(max1)\r\n", "n = int(input())\n\ngraph = {'polycarp' : 1}\nmaximum = 0\nfor _ in range(n):\n sentence = input()\n l, r = sentence.split(\" reposted \")\n graph[l.lower()] = graph[r.lower()] + 1\n maximum = max(graph[l.lower()], maximum)\nprint(maximum)", "n = int(input())\r\nrepost_chain = {\r\n 'polycarp': 1,\r\n}\r\n\r\nfor _ in range(n):\r\n repost_message = list(map(lambda x: x.lower(), input().split()))\r\n repost_chain[repost_message[0]] = repost_chain[repost_message[-1]] + 1\r\n\r\nprint(\r\n max(repost_chain.values())\r\n)\r\n", "from collections import defaultdict\r\n\r\nclass Graph:\r\n def __init__(self):\r\n self.adj = defaultdict(list)\r\n\r\n def edge(self,s1,s2):\r\n self.adj[s2].append(s1)\r\n\r\n def p(self):\r\n print(self.adj)\r\n\r\n def dfs(self,i):\r\n if(i not in self.adj): return 1\r\n ans = 0\r\n for j in self.adj[i]:\r\n ans = max(ans, self.dfs(j))\r\n return (ans + 1)\r\n\r\n\r\nt = int(input())\r\ngr = Graph()\r\nfor _ in range(t):\r\n s1, ignore, s2 = (input().split())\r\n gr.edge(s1.upper(),s2.upper())\r\n\r\n\r\n#gr.p()\r\nprint(gr.dfs('POLYCARP'))\r\n", "n = int(input())\r\nk = {}\r\nmaxk = 1\r\nk['polycarp'] = 1\r\nfor _ in range(n):\r\n s = input().split()\r\n if (s[0].lower() not in k):\r\n k[s[0].lower()] = 0\r\n k[s[0].lower()] += k[s[2].lower()] + 1\r\n maxk = max(k[s[0].lower()], maxk)\r\nprint(maxk)\r\n", "posts = {\"Polycarp\".lower(): 1}\nmax_len = 1\nn = int(input())\nfor _ in range(n):\n n1, n2 = input().lower().split(\" reposted \")\n posts[n1] = posts[n2] + 1\n max_len = max(max_len, posts[n1])\nprint(max_len)\n \t \t\t\t\t \t \t\t\t\t \t\t \t\t\t\t\t \t", "def track(s):\r\n if (s == \"polycarp\"):\r\n return 0\r\n else:\r\n return 1 + track(par[s])\r\n\r\nn = int(input())\r\npar = {}\r\nlst = []\r\nfor i in range(n):\r\n s = input().split()\r\n par[s[0].lower()] = s[2].lower()\r\n lst.append(s[0].lower())\r\nans = 0\r\nfor s in lst:\r\n if (track(s) > ans):\r\n ans = track(s)\r\nprint(ans+1)", "n = int(input())\r\ngraph = {'polycarp': 1}\r\nmax = 1\r\n\r\nfor i in range(n):\r\n line = input().split()\r\n \r\n a = line[0].lower()\r\n b = line[2].lower()\r\n \r\n graph[a] = graph[b] + 1\r\n if max < graph[a]:\r\n max = graph[a]\r\n\r\nprint(max)", "def bfs(G, s):\r\n from queue import Queue\r\n n = len(G)\r\n visited = [False for _ in range(n)]\r\n q = Queue()\r\n visited[s] = True\r\n maxi = 1\r\n q.put((s, 1))\r\n while not q.empty():\r\n u, counter = q.get()\r\n if counter > maxi:\r\n maxi = counter\r\n for name in G[u][1]:\r\n for idx in range(n):\r\n if G[idx][0] == name and not visited[idx]:\r\n visited[idx] = True\r\n q.put((idx, counter + 1))\r\n break\r\n\r\n return maxi\r\n\r\n\r\nn = int(input())\r\nG = []\r\nfor _ in range(n):\r\n string = input()\r\n string = string.lower()\r\n n = len(string)\r\n i = 0\r\n name1 = \"\"\r\n while string[i] != \" \":\r\n name1 += string[i]\r\n i += 1\r\n i += 1\r\n while string[i] != \" \":\r\n i += 1\r\n i += 1\r\n name2 = \"\"\r\n while i < n:\r\n name2 += string[i]\r\n i += 1\r\n if len(G) == 0:\r\n G.append([name2, [name1]])\r\n G.append([name1, []])\r\n else:\r\n found_1 = False\r\n found_2 = False\r\n for array in G:\r\n if array[0] == name2:\r\n array[1].append(name1)\r\n found_1 = True\r\n if array[0] == name1:\r\n found_2 = True\r\n\r\n if not found_1:\r\n G.append([name2, [name1]])\r\n if not found_2:\r\n G.append([name1, []])\r\n\r\nn = len(G)\r\nfor idx in range(n):\r\n if G[idx][0] == \"polycarp\":\r\n print(bfs(G, idx))\r\n break\r\n", "def dfs(k):\r\n sum = 1\r\n if ans[k] != 0:\r\n return ans[k]\r\n for v in edge[k]:\r\n sum += dfs(v)\r\n ans[k] = sum\r\n return ans[k]\r\n\r\n\r\nn = int(input())\r\ns = [str()] * n\r\nt = [['' for col in range(2)]for row in range(n)]\r\nd = {}\r\nindex = 0\r\nedge = [[]for row in range(n * 2)]\r\nans = [0] * (2 * n)\r\nfor i in range(n):\r\n s[i] = input()\r\n s[i] = s[i].lower()\r\n t[i][0] = s[i].split(\" \")[0]\r\n t[i][1] = s[i].split(\" \")[2]\r\n if t[i][0] not in d.keys():\r\n d[t[i][0]] = index\r\n index += 1\r\n if t[i][1] not in d.keys():\r\n d[t[i][1]] = index\r\n index += 1\r\n edge[int(d[t[i][0]])].append(int(d[t[i][1]]))\r\nmaxn = 0\r\nfor i in range(index):\r\n if ans[i] == 0:\r\n maxn = max(maxn, dfs(i))\r\nprint(maxn)\r\n\r\n", "n = int(input())\r\nmp = {}\r\nfor s in range(n):\r\n str = [x.upper() for x in input().split()]\r\n if mp.get(str[-1]) != None:\r\n mp[str[-1]].append(str[0])\r\n else:\r\n mp[str[-1]] = [str[0]]\r\n#print (mp)\r\ndef dfs(v,p = -1):\r\n mx = 0\r\n if mp.get(v) == None:\r\n return 0\r\n for i in mp[v]:\r\n if p != i:\r\n mx = max(mx,dfs(i,v) + 1)\r\n return mx\r\nprint (dfs('Polycarp'.upper()) + 1)\r\n", "# from queue import PriorityQueue\r\n# import math \r\n# import math \r\n# from functools import reduce\r\n# def find_gcd(list):\r\n# x = reduce(gcd, list)\r\n# return x\r\n# from itertools import combinations\r\n\r\n\r\n\r\n# import qrcode \r\n# text = qrcode.make(\"momen ashraf\")\r\n# text.save(\"qr.png\")\r\n\r\n\r\n\r\n# def f(i,l,s,index_list,ans):\r\n \r\n# if s % 2 == 0 and s :\r\n# ans.append(index_list)\r\n# return True\r\n# elif i == len(l):\r\n# return True\r\n \r\n# else :\r\n# op = f(i+1,l,s+l[i],index_list+[i+1],ans)\r\n# if op :\r\n# pass \r\n# else :\r\n# f(i+1,l,s,index_list,ans)\r\n \r\n# __IMPORTANT__ \r\n# Make tree and get depth\r\n# import math\r\n# def f(original_l,l,ll,d):\r\n# if l == []:\r\n# return \r\n# else :\r\n# i = original_l.index(max(l))\r\n# ll[i] = d \r\n# j = l.index(max(l))\r\n# f(original_l,l[:j],ll,d+1)\r\n# f(original_l,l[j+1:],ll,d+1) \r\n\r\ndef f(i,n,k,l,ll,c,lll):\r\n if c <= n and c not in lll:\r\n ll.append(1)\r\n lll.append(c)\r\n if i == len(l) :\r\n return\r\n f(i+1,n,k,l,ll,c+l[i],lll)\r\n f(i+1,n,k,l,ll,c,lll)\r\n\r\n\r\n# l = list(map(int,\"2\t35 7 11\t13\t17\t19\t23 29\t31\t37\t41\t43\t47\t53\t59\t61\t67 71\t73\t79\t83\t89\t97\t101\t103\t107\t109 113\t127\t131\t137\t139\t149\t151\t157\t163\t167 173\t179\t181\t191\t193\t197\t199\t211\t223\t227 229\t233\t239\t241\t251\t257\t263\t269\t271\t277 281\t283\t293\t307\t311\t313\t317\t331\t337\t347 349\t353\t359\t367\t373\t379\t383\t389\t397\t401 409\t419\t421\t431\t433\t439\t443\t449\t457\t461 463\t467\t479\t487\t491\t499\t503\t509\t521\t523 541\t547\t557\t563\t569\t571\t577\t587\t593\t599 601\t607\t613\t617\t619\t631\t641\t643\t647\t653 659\t661\t673\t677\t683\t691\t701\t709\t719\t727 733\t739\t743\t751\t757\t761\t769\t773\t787\t797 809\t811\t821\t823\t827\t829\t839\t853\t857\t859 863\t877\t881\t883\t887\t907\t911\t919\t929\t937 941\t947\t953\t967\t971\t977\t983\t991\t997\".split())) \r\n# l.sort()\r\n\r\n# def max_substring0(s):\r\n# return max(s.split('1'), key=len) \r\n# def max_substring1(s):\r\n# return max(s.split('0'), key=len)\r\n\r\ndef merge(l,r):\r\n i = j = 0 \r\n merged = []\r\n while i < len(l) and j < len(r):\r\n if l[i] <= r[j] :\r\n merged.append(l[i])\r\n i+=1\r\n else :\r\n merged.append(r[j])\r\n j+=1 \r\n merged+=l[i:]\r\n merged+=r[j:]\r\n return merged \r\n\r\ndef merger_sort(l):\r\n if len(l)<=1 :\r\n return l \r\n m = len(l)//2 \r\n left = merger_sort(l[:m])\r\n right = merger_sort(l[m:])\r\n merged = merge(left,right)\r\n return merged \r\n\r\ndef dfs(graph,start):\r\n vis = {}\r\n level = {}\r\n for i in graph.keys():\r\n vis[i] = 0\r\n level[i] = 0\r\n stack = [start] \r\n vis[start] = 1 \r\n level[start] = 1 \r\n while stack :\r\n parent = stack.pop(-1)\r\n vis[parent] = 1\r\n for i in graph[parent]:\r\n child = i\r\n if not vis[child]:\r\n stack.append(child)\r\n vis[child] = 1 \r\n level[child] = level[parent]+1\r\n return max(level.values())\r\ngraph = {}\r\nn = int(input())\r\nl = []\r\nnames = []\r\nfor i in range(n):\r\n x = input().split()\r\n l.append([x[0].lower(),x[2].lower()])\r\n names.append(x[0].lower())\r\n names.append(x[2].lower())\r\nnames = set(names)\r\nfor i in names :\r\n graph[i] = []\r\n\r\nfor i in l :\r\n graph[i[1]].append(i[0])\r\nprint(dfs(graph,\"polycarp\"))\r\n", "import sys\r\nfrom collections import defaultdict as ddict\r\n\r\n\r\ndef main():\r\n\tdick = ddict(lambda: 1)\r\n\tfor t in range(int(sys.stdin.readline())):\r\n\t\ta, b = sys.stdin.readline()[:-1].lower().split(\" reposted \")\r\n\t\tdick[a] += dick[b]\r\n\r\n\tprint(dick[max(dick, key=dick.get)])\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "ans=1\r\nd={\"polycarp\":1}\r\nfor i in range(int(input())):\r\n\tl=input().lower().split()\r\n\td[l[0]] = d[l[2]]+1\r\n\tans=max(d[l[0]],ans)\r\nprint(ans)", "d={'polycarp':1}\r\nfor i in range(int(input())):\r\n\ta,b=map(str,input().lower().split(' reposted '))\r\n\td[a]=d[b]+1\r\nprint(max(d.values()))", "d={'POLYCARP':1}\r\nfor i in range(int(input())):\r\n p=input().split()\r\n d[p[0].upper()]=d[p[2].upper()]+1\r\nprint(max(d.values()))", "n=int(input())\r\norder={}\r\norder['polycarp']=1\r\nm=1\r\nfor i in range(n):\r\n s1,s2,s3=[i.lower() for i in input().split()]\r\n order[s1]=order[s3]+1\r\n m=max(order[s1],m)\r\nprint(m)", "\nglobal h \nh = -1\ndef dfs(node,parent,current,d):\n # print(node,end=\" \")\n for i in d[node]:\n if i==parent:\n continue\n else:\n global h\n h = max(h,current+1)\n dfs(i,node,current+1,d)\ndef main():\n d = dict()\n n = int(input())\n while(n>0):\n s = input()\n l = s.split()\n r1 = l[0]\n r2 = l[2]\n r1 = r1.lower()\n r2 = r2.lower()\n d.setdefault(r1, []).append(r2)\n d.setdefault(r2, []).append(r1)\n n-=1\n # print(d)\n dfs(\"polycarp\",\"@\",1,d)\n print(h)\nmain()\n\t \t\t\t \t\t \t\t\t \t \t\t\t \t\t \t\t", "n = int(input())\r\nusers = [[\"polycarp\"]]\r\np = 0\r\nfor x in range(n):\r\n string = input()\r\n a, b = map(lambda x: x.lower(), string.split(\" reposted \"))\r\n q = 0\r\n while not b in users[q]:\r\n q += 1\r\n if q == p:\r\n users.append([a])\r\n p += 1\r\n else:\r\n users[q + 1].append(a)\r\nprint(p + 1)", "def solve(dic,s):\n if(dic.get(s)==None):\n return 1\n ans=0\n for i in dic[s]:\n ans = max(ans,solve(dic,i))\n return ans+1\n\ndic = {\"polycarp\":[]}\nfor _ in range(int(input())):\n s = [x.lower() for x in input().split(' reposted ')]\n if(dic.get(s[1])==None):\n dic[s[1]]=[s[0],]\n else:\n dic[s[1]].append(s[0])\nprint(solve(dic,\"polycarp\"))\n ", "# Anuneet Anand\r\n \r\nn = int(input())\r\n \r\nG = {\"polycarp\":1}\r\nfor i in range(n):\r\n\tX = list(input().split())\r\n\ta = X[0].lower()\r\n\tb = X[2].lower()\r\n\tif b in G:\r\n\t\tG[a]=G[b]+1\r\n\telse:\r\n\t\tG[a]=1\r\n \r\nprint(max(G.values()))", "from collections import defaultdict\nn=int(input())\narr=[]\nfor _ in range(n):\n arr.append(list(input().split()))\ngraph=defaultdict(list)\nfor i in arr:\n graph[i[2].lower()].append((i[0]).lower())\n\nans=[]\ndef DFSUtil(graph,v,visited,count):\n visited.append(v)\n count+=1\n for node in graph[v]:\n if node not in visited:\n DFSUtil(graph,node,visited,count)\n ans.append(count)\ndef DFS(src):\n visited=[]\n for node in graph[src]:\n if node not in visited:\n DFSUtil(graph,node,visited,0)\nDFS('polycarp')\nprint (max(ans)+1)\n", "import sys\r\n\r\nrd = sys.stdin.readline\r\n\r\nn = int(rd())\r\n\r\npopdic = {}\r\n\r\nfor _ in range(n):\r\n\r\n name1, temp, name2 = rd().strip().split()\r\n\r\n name1 = name1.lower()\r\n name2 = name2.lower()\r\n\r\n if popdic.get(name2):\r\n\r\n popdic[name1] = popdic[name2] + 1\r\n\r\n else:\r\n\r\n popdic[name2] = 1\r\n popdic[name1] = 2\r\n\r\nprint(max(popdic.values()))\r\n", "a = {\"polycarp\": 1}\r\nmax = 0\r\nfor i in range(int(input())):\r\n n, m = input().lower().split(\" reposted \")\r\n a[n] = a[m] + 1\r\n if a[m] + 1 > max:\r\n max = a[m] + 1\r\nprint(max)", "reposts = {\"polycarp\": 1}\r\namount = int(input().split()[0])\r\nfor i in range(amount):\r\n inpt = input().lower().split()\r\n reposter = inpt[0]\r\n source = inpt[2]\r\n reposts[reposter] = reposts[source] + 1\r\nm = 1\r\nfor reposter in reposts:\r\n m = max(reposts[reposter], m)\r\n\r\nprint(m)", "\r\n\r\ncount={'POLYCARP':1}\r\n\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n a,b,c=input().upper().split()\r\n count[a]=count[c]+1\r\n \r\nprint(max(count.values())) ", "def rec(x):\r\n if x not in d:\r\n return 1\r\n \r\n count = 0\r\n for i in d[x]:\r\n #print(i)\r\n count = max(rec(i) + 1, count)\r\n #print(count)\r\n #print()\r\n \r\n return count\r\n\r\nn = int(input())\r\n\r\nnames = []\r\npr = []\r\nd = dict()\r\nfor i in range(n):\r\n n1, _, n2 = input().split()\r\n n1 = n1.lower()\r\n n2 = n2.lower()\r\n \r\n if n1 not in names:\r\n names.append(n1)\r\n if n2 not in names:\r\n names.append(n2)\r\n \r\n if n2 not in d:\r\n d[n2] = [n1]\r\n else:\r\n d[n2].append(n1)\r\n\r\nc = 0\r\n#print(d)\r\n#for i in d['polycarp']:\r\n #print(i)\r\n\r\nprint(rec('polycarp'))", "n = int(input())\r\nb = ''\r\nr = {}\r\nr['polycarp'] = 1\r\nfor i in range(n):\r\n b = input().lower().split()\r\n r[b[0]] = r.get(b[0], 1) + r[b[2]]\r\nprint(max(r.values()))\r\n", "match = {}\r\nmaxLen = 1\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n l = input().split()\r\n source, dest = l[2].lower(), l[0].lower()\r\n try: match[source].append(dest)\r\n except: match[source] = [dest]\r\n if dest not in match: match[dest] = []\r\n\r\n\r\ndef dfs(current, length):\r\n global maxLen\r\n if (len(match[current]) > 0):\r\n for next in match[current]:\r\n dfs(next, length + 1)\r\n else:\r\n if length > maxLen: maxLen = length\r\n\r\ndfs('polycarp', 1)\r\nprint(maxLen)", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nfrom collections import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nn=RI()[0]\ndi={\"polycarp\":1}\nl=1\nadj={1:[]}\ndef height(node):\n if len(adj[node])==0:\n return 1\n return 1+max(height(i) for i in adj[node])\nfor i in range(n):\n a,b,c=RS()\n a=a.lower()\n c=c.lower()\n if a not in di:\n l+=1\n di[a]=l\n if di[a] not in adj:\n adj[di[a]]=[]\n adj[di[c]].append(di[a])\nprint(height(1))\n", "n = int(input())\r\nrepo = [['Polycarp'.upper(), 1]]\r\nfor i in range(n):\r\n s = input().split(' ')\r\n reposter ,feed= s[0].upper(),s[2].upper()\r\n for pair in repo:\r\n if feed == pair[0]:\r\n repo.append([reposter,pair[1]+1])\r\n break\r\nmaxdepth = 1\r\nfor i in repo:\r\n if i[1]>=maxdepth:\r\n maxdepth = i[1]\r\n\r\nprint(maxdepth)", "# /**\r\n# * problem: A. Reposts\r\n# * contest: Codeforces - VK Cup 2015 - Qualification Round 1\r\n# * author: brownfox2k6\r\n# * created: 03/06/2023 19:26:43 Hanoi, Vietnam\r\n# **/\r\n\r\n# fuck you dp\r\n\r\ndepth = {\"polycarp\": 1}\r\n\r\nfor _ in range(int(input())):\r\n n1, _, n2 = map(str.lower, input().split())\r\n depth[n1] = depth[n2] + 1\r\n\r\nprint(max(depth.values()))", "n = int(input())\r\ndef dfs(vertex, len):\r\n length[vertex] = len\r\n if vertex in graph.keys():\r\n for i in graph[vertex]:\r\n if length[i] == 0:\r\n dfs(i, len + 1)\r\ngraph = {}\r\nlength = {}\r\nfor i in range(n):\r\n a, b, c = map(str, input().split())\r\n a = a.lower()\r\n c = c.lower()\r\n length[a] = 0\r\n length[c] = 0\r\n if c not in graph.keys():\r\n graph[c] = [a]\r\n else:\r\n graph[c].append(a)\r\ndfs(\"polycarp\",1)\r\nmx = -1\r\nfor i in length.keys():\r\n mx = max(mx, length[i])\r\nprint(mx)\r\n\r\n", "d = {\"polycarp\": 1}\r\nans = 1\r\n\r\nfor i in range(int(input())):\r\n a, _, b = input().split()\r\n a = a.casefold()\r\n b = b.casefold()\r\n \r\n d[a] = d[b] + 1\r\n ans = max(ans, d[a])\r\n\r\nprint(ans)", "n = int(input())\r\nstatus = {'polycarp':1}\r\nfor i in range(n):\r\n x,y = [char for char in input().lower().split(' reposted ')]\r\n status[x] = status[y] + 1\r\nprint(max(status.values()))\r\n", "n = int(input())\r\na = {'polycarp':-1}\r\nfor i in range(n):\r\n b = input().lower().split()\r\n a[b[0]] = b[2]\r\nans = 0\r\nfor i in a:\r\n t = 0\r\n s = i \r\n while s!=-1:\r\n t+=1\r\n s = a[s]\r\n if t>ans:\r\n ans = t \r\nprint(ans)", "from collections import defaultdict, deque\r\n\r\nreposts = defaultdict(list)\r\n\r\n# Rekurzivni pristup\r\n#def dfs(parent: str):\r\n# return 1 + max((dfs(child) for child in reposts[parent]), default=0)\r\n\r\ndef dfs(parent: str):\r\n stack = deque([(parent, 1)])\r\n count = 1\r\n \r\n while stack:\r\n node, distance = stack.popleft()\r\n stack.extend((child, distance + 1) for child in reposts[node])\r\n count = max(count, distance)\r\n\r\n return count\r\n\r\nfor _ in range(int(input())):\r\n reposter, source = input().split(' reposted ')\r\n reposts[source.lower()].append(reposter.lower())\r\n\r\nprint(dfs('polycarp'))\r\n", "#from collections import OrderedDict\r\n#from collections import defaultdict\r\n#from functools import reduce\r\n#from itertools import groupby\r\n#sys.setrecursionlimit(10**6)\r\n#from itertools import accumulate\r\nfrom collections import Counter\r\nimport math\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\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\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'''\r\nfrom threading import stack_size,Thread\r\nsys.setrecursionlimit(10**6)\r\nstack_size(2**25)\r\n'''\r\ndef listt():\r\n return [int(i) for i in input().split()]\r\n \r\ndef gcd(a,b): \r\n return math.gcd(a,b) \r\n \r\ndef lcm(a,b): \r\n return (a*b) // gcd(a,b) \r\n\r\ndef factors(n):\r\n step = 2 if n%2 else 1\r\n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(math.sqrt(n))+1, step) if n % i == 0)))\r\n\r\ndef comb(n,k):\r\n factn=math.factorial(n)\r\n factk=math.factorial(k)\r\n fact=math.factorial(n-k)\r\n ans=factn//(factk*fact)\r\n return ans\r\n\r\ndef is_prime(n): \r\n if n <= 1: \r\n return False\r\n if n == 2: \r\n return True\r\n if n > 2 and n % 2 == 0: \r\n return False\r\n\r\n max_div = math.floor(math.sqrt(n)) \r\n for i in range(3, 1 + max_div, 2): \r\n if n % i == 0: \r\n return False\r\n return True\r\ndef maxpower(n,x):\r\n B_max = int(math.log(n, x)) + 1 #tells upto what power of x n is less than it like 1024->5^4\r\n return B_max\r\ndef binaryToDecimal(n): \r\n return int(n,2) \r\n\r\n\r\n#d=sorted(d.items(),key=lambda a:a[1]) sort dic accc to values\r\n#g=pow(2,6)\r\n#a,b,n,m=map(int,input().split())\r\n#print (\"{0:.8f}\".format(min(l)))\r\n#t=1\r\ndef f(y):\r\n if y in d:\r\n return d[y]\r\n if y==1:\r\n d[y]=1\r\n return d[y]\r\n elif y%2==0:\r\n d[y]= min(f(y//2)+1,abs(y-n))\r\n return d[y]\r\n else:\r\n d[y]= min(f(y+1)+1,f(y-1)+1,abs(y-n))\r\n return d[y]\r\n''' \r\n#t=int(input())\r\nfor _ in range(1):\r\n #n=int(input())\r\n d={}\r\n n,m=map(int,input().split())\r\n if n>=m:\r\n print(m-n)\r\n else:\r\n print(f(m)) \r\n''' \r\nn = int(input())\r\ncnt = {'polycarp': 1}\r\nfor i in range(n):\r\n arr = input().split()\r\n name1 = arr[0].lower()\r\n name2 = arr[2].lower()\r\n cnt[name1] = cnt[name2]+1\r\nprint(max(cnt.values()))\r\n\r\n \r\n \r\n \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 repost():\n max_chain = {'polycarp': 1}\n num = int(input())\n for i in range(num):\n reps = input().split()\n max_chain[reps[0].lower()] = max_chain[reps[2].lower()] + 1\n return max(max_chain.values())\n\nprint(repost())\n\t\t\t \t \t\t\t\t \t\t\t \t \t\t \t \t\t", "def find_longest_repost_chain(n, reposts):\r\n repost_dict = {}\r\n max_chain = 0\r\n\r\n for repost in reposts:\r\n name1, _, name2 = repost.lower().split()\r\n repost_dict[name1] = repost_dict.get(name2, 0) + 1\r\n max_chain = max(max_chain, repost_dict[name1])\r\n\r\n return max_chain + 1 \r\n\r\nn = int(input())\r\nreposts = [input() for _ in range(n)]\r\n\r\nresult = find_longest_repost_chain(n, reposts)\r\nprint(result)\r\n", "from collections import deque\r\nn = int(input())\r\n\r\nd = {}\r\n\r\nfor _ in range(n):\r\n\tname1, temp, name2 = input().split()\r\n\tname1, name2 = name1.lower(), name2.lower()\r\n\tif name2 in d:\r\n\t\td[name2].append(name1)\r\n\telse:\r\n\t\td[name2] = [name1]\r\n\r\nq = deque([(\"polycarp\",1)])\r\nmax_popularity = -1\r\nwhile(q):\r\n\tcurrent, popularity = q.popleft()\r\n\tif popularity>max_popularity:\r\n\t\tmax_popularity = popularity\r\n\r\n\tif current in d:\r\n\t\tfor child in d[current]:\r\n\t\t\tq.append([child, popularity+1])\r\n\r\n\r\nprint(max_popularity)", "n = int(input())\r\na = [ [1000 for j in range(n+1)] for i in range(n+1) ]\r\nd = {'polycarp' : 0}\r\ns = set('polycarp')\r\nk = 1\r\nfor i in range(n) :\r\n c,b = input().lower().split(' reposted ')\r\n if c not in d.keys() :\r\n d[c] = k\r\n k+=1\r\n if b not in d.keys() :\r\n d[b] = k\r\n k+=1\r\n a[d[b]][d[c]] = 1\r\n\r\n\r\ndist = [9**10 for i in range(n+1)]\r\ndist[0] = 0\r\nq = []\r\nq.append(0)\r\nl = 0\r\nwhile l<len(q) :\r\n v = q[l]\r\n for i in range(n+1) :\r\n if a[v][i]==1 and dist[i]>dist[v]+1 :\r\n q.append(i)\r\n dist[i] = dist[v]+1\r\n l+=1\r\nt = 0\r\nfor i in dist :\r\n if i!=9**10 and i>t : t = i\r\n\r\nprint(t+1)\r\n\r\n\r\n \r\n\r\n \r\n", "import sys;readline = sys.stdin.readline\r\ndef i1(): return int(readline())\r\ndef nl(): return [int(s) for s in readline().split()]\r\ndef nn(n): return [int(readline()) for i in range(n)]\r\ndef nnp(n,x): return [int(readline())+x for i in range(n)]\r\ndef nmp(n,x): return (int(readline())+x for i in range(n))\r\ndef nlp(x): return [int(s)+x for s in readline().split()]\r\ndef nll(n): return [[int(s) for s in readline().split()] for i in range(n)]\r\ndef mll(n): return ([int(s) for s in readline().split()] for i in range(n))\r\ndef s1(): return readline().rstrip()\r\ndef sl(): return [s for s in readline().split()]\r\ndef sn(n): return [readline().rstrip() for i in range(n)]\r\ndef sm(n): return (readline().rstrip() for i in range(n))\r\ndef redir(s): global readline;import os;fn=sys.argv[0] + f'/../in-{s}.txt';readline = open(fn).readline if os.path.exists(fn) else readline\r\n\r\nredir('a')\r\nn = i1()\r\n# children = {}\r\nchildren = {'polycarp':[]}\r\nfor _ in range(n):\r\n i,_,p = readline().split()\r\n children[i.lower()] = []\r\n # if p.lower() not in children:\r\n # children[p.lower()] = []\r\n children[p.lower()].append(i.lower())\r\nroots = ['polycarp']\r\ndepth = 0\r\nwhile roots:\r\n depth += 1\r\n # print(depth, roots)\r\n roots = [i for r in roots for i in children[r]]\r\n# print(children)\r\nprint(depth)\r\n", "import collections\nn = int(input())\npost = collections.defaultdict(int)\nfor i in range(n):\n a, _ , b = input().split()\n post[a.lower()] = post[b.lower()] + 1\nprint(max(post.values()) + 1)\n\n\t\t\t \t\t\t \t\t\t\t\t\t \t \t\t\t", "def dfs(count, cur, dic):\r\n out = 0;\r\n if cur not in dic:\r\n return count\r\n for i in range(len(dic[cur])):\r\n out = max(out,dfs(count+1, dic[cur][i], dic))\r\n return out\r\n\r\n\r\na=int(input())\r\nb={}\r\nfor i in range(a):\r\n c=input().lower().split()\r\n if c[2] in b:\r\n b[c[2]].append(c[0])\r\n else:\r\n b[c[2]] = [c[0]]\r\nprint(dfs(1, 'polycarp', b))\r\n", "n=int(input())\r\nd={}\r\nd[\"POLYCARP\"]=1\r\nfor i in range(n):\r\n a=[*map(str.upper,input().split())]\r\n d[a[0]]=d[a[2]]+1\r\nprint(max(d.values()))\r\n\r\n\r\n#print(l)\r\n#for i in range(n):\r\n# if l[i][2] not in d:\r\n# d[l[i][2]]=l[i][0]\r\n#mx=1\r\n#for i in d.keys():\r\n# key=i\r\n# count=1\r\n# while key in d:\r\n# key=d[key]\r\n# count+=1\r\n# if count>mx:\r\n# mx=count\r\n#print(mx)\r\n \r\n", "n = int(input())\na = {}\na['polycarp'] = 1\nfor i in range(n):\n x = input().split()\n a[x[0].lower()] = a[x[2].lower()] + 1\n\nprint(max(a.values()))\n \n", "n = int(input())\nl = {}\nfor i in range(n):\n name1, name2 = input().lower().split(' reposted ')\n if name2 not in l:\n l[name2] = 1\n l[name1] = l[name2]+1\nprint(max(l.values()))\n\t \t\t \t \t\t\t \t \t \t \t \t \t\t", "#\t\t\t\t Author: Udit \"luctivud\" Gupta @ https://www.linkedin.com/in/udit-gupta-1b7863135/\t\t\t\t\t #\n\n\nimport math; \t\tfrom collections import *\nimport sys; \t\tfrom functools import reduce\nimport time; \t\tfrom itertools import groupby\n\n# sys.setrecursionlimit(10**6)\n\n# def input() : return sys.stdin.readline()\ndef get_ints() : return map(int, input().strip().split())\ndef get_list() : return list(get_ints())\ndef get_string() : return list(input().strip().split())\ndef printxsp(*args) : return print(*args, end=\"\")\ndef printsp(*args) : return print(*args, end=\" \")\n\n\nDIRECTIONS = [(+0, +1), (+0, -1), (+1, +0), (-1, -0)] \nNEIGHBOURS = [(-1, -1), (-1, +0), (-1, +1), (+0, -1),\\\n (+1, +1), (+1, +0), (+1, -1), (+0, +1)]\n\n\n\n# MAIN >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\n\n# for _test_ in range(int(input())): \nn = int(input())\nd = defaultdict(list)\nfor i in range(n):\n\ta, b, c = input().split()\n\ta = a.lower(); c = c.lower();\n\td[c].append(a);\n\nque = deque();\nans = 0 \nque.append((\"polycarp\", 1))\nwhile (len(que)):\n\tname, dep = que.popleft()\n\tans = max(ans, dep)\n\tfor i in d[name]:\n\t\tque.append((i, dep+1))\nprint(ans)\n\n\n\n\n\n", "n = int(input())\r\ncode = {}\r\nfor i in range(n):\r\n\ts = input().lower().split()\r\n\tif s[2] not in code.keys():\r\n\t code[s[2]] = 0\r\n\tcode[s[0]] = code[s[2]] + 1\r\n\r\nprint(max([value for key,value in code.items()])+1)", "d = {\"polycarp\" : 1}\nfor item in range(int(input())):\n current = str(input()).lower().split(\" \")[::2]\n d[current[0]] = d[current[1]] + 1\nprint(max(d.values()))\n", "d={'polycarp':1}\nt=int(input())\nfor _ in range(t):\n a,b,c=input().lower().split()\n d[a]=d[c]+1\nprint(max(d.values()))\n \t\t \t \t\t \t\t\t\t \t \t\t \t \t \t\t \t\t", "from collections import defaultdict\n\nn = int(input())\nL = [input().split(' reposted ') for _ in range(n)]\n\nG = defaultdict(list)\nfor b, a in L:\n G[a.lower()].append(b.lower())\n\ndef longest_chain(node):\n if not G[node]:\n return 1\n else:\n return 1 + max(longest_chain(child) for child in G[node])\n\nprint(longest_chain('polycarp'))\n", "a=int(input())\r\nb=[['polycarp'.lower(),0]]\r\n\r\nfor i in range(a):\r\n report=input().split()\r\n reporter,feed=report[0].lower(),report[2].lower()\r\n for i in range(len(b)):\r\n if feed==b[i][0]:\r\n b.append([reporter,b[i][1]+1])\r\n break\r\nmax=0\r\nfor i in b:\r\n if i[1]>max:\r\n max=i[1]\r\n \r\nprint(max+1)\r\n", "from collections import defaultdict\r\n\r\nn=int(input())\r\nd=defaultdict(int)\r\nd['polycarp']=1\r\nfor i in range(n):\r\n a,b,c=[i for i in input().split(\" \")]\r\n a=a.lower()\r\n c=c.lower()\r\n d[a]=d[c]+1 \r\nprint(max(d.values()))", "def input_arr():\n n = int(input())\n return [input() for i in range(n)]\n\nreposts = [s.split(' reposted ') for s in input_arr()]\n\nuser_distances = {'polycarp': 1}\n\nfor reposter, reposted in reposts:\n user_distances[reposter.lower()] = user_distances[reposted.lower()] + 1\n\nprint(max(user_distances.values()))", "num_reposts = int(input())\n\ndic = {}\n\nfor i in range(0, num_reposts):\n repost = input().split()\n dic[repost[0].lower()] = repost[-1].lower()\n\nlength = 2\nfor user, source in dic.items():\n length_tmp = 2\n while source != 'polycarp':\n length_tmp += 1\n user = source\n source = dic[user]\n length = max(length, length_tmp)\n\nprint(length)\n \t\t\t\t\t\t\t \t \t \t \t \t \t\t", "def dfs(s):\r\n\tk=0\r\n\tfor adj in l[s]:\r\n\t\tk=max(dfs(adj),k)\r\n\treturn k+1\t\r\nn=int(input())\r\nl=[[]]\r\nfor _ in range(n):\r\n\tl.append([])\r\n#print(l)\r\nd={}\r\nd['polycarp']=0\r\nj=1\r\nfor i in range(n):\r\n\ts=input().lower().split()\r\n\tind=d[s[2]]\r\n\t#print(\"ind is {} \".format(ind))\r\n\tif(s[0] in d.keys()):\r\n\t\tl[ind].append(d[s[0]])\r\n\telse :\r\n\t\td[s[0]]=j;\r\n\t\tj+=1\r\n\t\tl[ind].append(d[s[0]])\r\n\t#print(\"dest is {} \".format(d[s[0]]))\r\n#print(l)\r\nprint(dfs(0))\t\r\n\t\r\n\t", "from collections import defaultdict, deque\r\nimport sys\r\n\r\nnum_reposts = int(sys.stdin.readline().strip())\r\n\r\nreposted_by = defaultdict(list)\r\n\r\nfor repost in range(num_reposts):\r\n name1, _, name2 = sys.stdin.readline().split()\r\n reposted_by[name2.lower()].append(name1.lower())\r\n\r\nqueue = deque([('polycarp', 1)])\r\nvisited = set()\r\nmax_popularity = 1\r\n\r\nwhile queue:\r\n poster, distance = queue.popleft()\r\n max_popularity = max(distance, max_popularity)\r\n for reposter in reposted_by[poster]:\r\n if reposter in visited:\r\n continue\r\n queue.append((reposter, distance+1))\r\n\r\nprint(max_popularity)\r\n\r\n\r\n\r\n", "# cook your dish here\r\nm = {}\r\nm['polycarp']=1\r\nfor _ in range(int(input())):\r\n s=input().split()\r\n m[s[0].lower()]=m[s[2].lower()]+1\r\n\r\nprint(max(m.values()))", "n=int(input())\nd={'polycarp':1}\n\nfor i in range(n):\n s = input().lower().split()\n d[s[0]]=d[s[2]]+1\n \nprint(max(d.values()))\n\n\n\n\n\n\n \t\t \t \t\t\t\t\t\t \t \t \t\t \t\t \t\t", "from collections import deque\r\n\r\nn = int(input())\r\nstore = {}\r\ncount = 1\r\ngraph = [[] for _ in range(1001)]\r\nfor _ in range(n):\r\n u, repost, v = map(str, input().split(\" \"))\r\n u = u.lower()\r\n v = v.lower()\r\n\r\n if u not in store:\r\n store[u] = count\r\n count += 1\r\n if v not in store:\r\n store[v] = count\r\n count += 1\r\n\r\n graph[store[v]].append(store[u])\r\n\r\nstart = store['polycarp']\r\nvisited = [False for _ in range(1001)]\r\nvisited[start] = True\r\nqueue = deque()\r\nqueue.append(start)\r\nlevel = 0\r\n\r\nwhile len(queue) > 0:\r\n size = len(queue)\r\n level += 1\r\n while size > 0:\r\n cur = queue.popleft()\r\n for nei in graph[cur]:\r\n if not visited[nei]:\r\n visited[nei] = True\r\n queue.append(nei)\r\n size -= 1\r\n\r\nprint(level)", "n = int(input())\r\nadj = dict()\r\nvisited = dict()\r\nheight = dict()\r\nwhile n>0 :\r\n\ta = list(map(str,input().split()))\r\n\tif not(str(a[2].lower()) in adj.keys()):\r\n\t adj[str(a[2].lower())] = list()\r\n\tvisited[str(a[2].lower())] = 0;\r\n\tvisited[str(a[0].lower())] = 0;\r\n\tadj[str(a[2].lower())].append(str(a[0].lower()))\r\n\tn = n - 1\r\nheight['polycarp'] = 1;\r\n#print(adj.values(),adj.keys())\r\ndef dfs(a):\r\n\tvisited[a] = 1;\r\n\tif a in adj.keys():\r\n\t\tfor item in adj[a]:\r\n\t\t\theight[item] = height[a] + 1;\r\n\t\t\tif(visited[item] == 0):\r\n\t\t\t\tdfs(item)\r\n\r\ndfs('polycarp')\r\nprint(max(height.values()))\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\ngraph = defaultdict(list)\r\nfor _ in range(n):\r\n name1, reposted, name2 = input().split()\r\n # print(name1, reposted, name2)\r\n graph[name2.lower()].append(name1.lower())\r\n\r\n\r\ndef dfs(node, graph):\r\n if node not in graph:\r\n return 1\r\n \r\n else:\r\n max_ = 1\r\n for child in graph[node]:\r\n max_ = max(max_, 1 + dfs(child, graph))\r\n return max_\r\n\r\n\r\n\r\nans = 1\r\n\r\nfor node in graph[\"polycarp\"]:\r\n ans = max(ans, 1 + dfs(node, graph))\r\n\r\nprint(ans)", "def main(): \r\n n = int(input())\r\n d = {\"polycarp\":1}\r\n for i in range(n):\r\n a,_,b = map(str,input().split())\r\n a,b = a.lower(),b.lower()\r\n d[a] = d[b]+1\r\n\r\n print(max(d.values())) \r\nmain() ", "n=int(input())\nd={'polycarp':1}\nfor i in range(n):\n [c,b,a]=[i.lower() for i in input().split()]\n d[c]=d[a]+1\nprint(max(d.values()))\n", "def dfs(st,l):\r\n global mx\r\n if l>mx: mx=l\r\n for i in range(n):\r\n if a[st][i]:\r\n dfs(i,l+1)\r\n\r\nn=1\r\nd={\"polycarp\" : 0}\r\na = [0] * 220\r\nfor i in range(220):\r\n a[i] = [0] * 220\r\n\r\nfor t in range(int(input())):\r\n s=input().split()\r\n s[0]=s[0].lower()\r\n s[2]=s[2].lower()\r\n if s[0] not in d.keys():\r\n d[s[0]]=n\r\n n+=1\r\n a[d[s[2]]][d[s[0]]]=1\r\n\r\nmx=0\r\ndfs(0,1)\r\n\r\nprint(mx)", "from collections import defaultdict, deque\n\nposts = defaultdict(list)\nn = int(input())\nfor _ in range(n):\n line = input().split()\n posts[line[2].lower()].append(line[0].lower())\n\nlongest_chain = 0\nqueue = deque()\nqueue.appendleft(['polycarp', 1])\nwhile len(queue):\n current = queue.pop()\n for post in posts[current[0]]:\n new_list = [post, current[1] + 1]\n queue.appendleft(new_list)\n longest_chain = max(longest_chain, new_list[1])\nprint(longest_chain)", "import sys\nfrom collections import defaultdict\n\nn = int(sys.stdin.readline())\nR = {'polycarp': 1}\nfor i in range(n):\n a, b = map(str.lower, sys.stdin.readline().strip().split(' reposted '))\n R[a] = R[b] + 1\n\nsys.stdout.write(str(max(R.values())))\n", "# мой код по идее умных людей\ndef main():\n n = int(input())\n d = {\"polycarp\": 1}\n for i in range(n):\n s = str(input()).split()\n d.update({s[0].lower(): d.get(s[2].lower()) + 1})\n print(max(d.values()))\n \nmain()\n", "from collections import defaultdict, deque\n\nn = int(input())\ngraph = defaultdict(list)\nvisited = set()\nlongest = defaultdict(int)\npersons = set()\nfor _ in range(n):\n (x, _, y) = input().strip().split()\n graph[y.lower()].append(x.lower())\n persons.update([x.lower(), y.lower()])\n\n\ndef dfs(start):\n stack = deque([(start, 1)])\n res = 1\n while len(stack):\n node, count = stack.pop()\n res = max(res, count)\n visited.add(node)\n for neb in graph[node]:\n if neb in visited:\n res = max(res, count + longest[neb])\n else:\n stack.appendleft((neb, count+1))\n\n longest[start] = res\n return res\n\n\nres = 1\nfor p in persons:\n if p not in visited:\n res = max(res, dfs(p))\nprint(res)\n", "from collections import defaultdict\r\n\r\n\r\ndef LI():\r\n return list(map(int, input().split(\" \")))\r\ndef LS():\r\n return input().split(\" \")\r\ndef LC():\r\n return input().split()\r\ndef I():\r\n return int(input())\r\ndef S():\r\n return input()\r\n\r\nn = I()\r\ngraph = {\"polycarp\": 1}\r\nfor i in range(n):\r\n x = S().split(\" \")\r\n graph[x[0].lower()] = graph[x[2].lower()] + 1\r\nprint(max(graph.values())) ", "# your code goes here\nfrom collections import defaultdict\nn = int(input())\nmp = defaultdict(lambda: 0)\nfor _ in range(n):\n s = input().lower().split()\n if mp[s[-1]] == 0:\n mp[s[-1]] += 1\n mp[s[0]] = mp[s[-1]] + 1\nprint(max(mp.values()))\n \t \t \t\t\t \t \t\t\t\t\t \t\t \t \t \t", "import math\r\n\r\ndef findDepth(val,dic,d0):\r\n dSet=[]\r\n for k,v in dic.items():\r\n if v==val:\r\n dSet.append(findDepth(k,dic,d0+1))\r\n if len(dSet)==0 :\r\n return d0\r\n else:\r\n return max(dSet)\r\n\r\nn=int(input())\r\ndic1={}\r\n\r\nfor i in range(n):\r\n line=input().split(\" \")\r\n p2=line[2].lower()\r\n p1=line[0].lower()\r\n dic1[p1]=p2\r\n if p2 not in dic1:\r\n dic1[p2]=\"ROOT\"\r\n# print(dic1)\r\ndepth=[]\r\nfor key,value in dic1.items():\r\n if value==\"ROOT\":\r\n depth.append(findDepth(key,dic1,1))\r\nprint(max(depth))\r\n", "maxC = 1\r\npeople = {'POLYCARP': 1}\r\nstrRepost = []\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n nameAr = []\r\n strRepost.append(input())\r\n nameAr = (strRepost[i].upper()).split(\" \")\r\n people[nameAr[0]] = people[nameAr[2]] + 1\r\n if people[nameAr[0]] > maxC:\r\n maxC = people[nameAr[0]]\r\n\r\nprint(maxC)\r\n \r\n\r\n\r\n", "from collections import defaultdict\n\n\ndef dfs(node):\n\n depth = 0\n\n for child in graph[node]:\n depth = max(depth, dfs(child))\n\n return depth+1\n\n\ngraph = defaultdict(list)\n\nfor _ in range(int(input())):\n child, tmp, ancestor = input().split()\n graph[ancestor.lower()].append(child.lower())\n\nprint(dfs('polycarp'))\n", "dic = {}\nn = int(input())\ndic[\"POLYCARP\"] = 1\nm = 1\nfor _ in range(n):\n first, __, second = input().split()\n first, second = first.upper(), second.upper()\n value = dic[second] + 1\n dic[first] = value\n m = max(m, value)\nprint(m)\n", "from math import gcd\r\nimport bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(99999)\r\n\r\n\r\nn, = map(int,input().split())\r\ndp = collections.defaultdict(int)\r\ndp[\"polycarp\"]=1\r\n\r\nfor _ in [0]*n:\r\n name1,op,name2 = input().lower().split()\r\n dp[name1] = dp[name2]+1\r\n\r\nprint(max(dp.values()))\r\n \r\n", "\r\nn=int(input())\r\ng={}\r\nfor i in range(n):\r\n text=input().split()\r\n if text[0].lower() not in g.keys():\r\n g[text[0].lower()]=[]\r\n if text[2].lower() not in g.keys():\r\n g[text[2].lower()]=[]\r\n g[text[0].lower()].append(text[2].lower())\r\n g[text[2].lower()].append(text[0].lower())\r\n\r\nused=dict((i, False) for i in g.keys())\r\ndist=dict((i, 0) for i in g.keys())\r\n\r\n\r\ndef BFS(predok):\r\n global g\r\n global used\r\n global dist\r\n que=[]\r\n s=0\r\n que.append(predok)\r\n while len(que)-s>0:\r\n predok=que[s]\r\n used[predok]=True\r\n s=s+1\r\n for potomok in g[predok]:\r\n if not used[potomok]:\r\n que.append(potomok)\r\n dist[potomok]=dist[predok]+1\r\nBFS(\"polycarp\")\r\nprint(max(dist.values())+1)", "n = int(input())\nreposts = {}\nfor _ in range(n):\n a, _, b = [x.lower() for x in input().split()]\n reposts.setdefault(b, []).append(a)\n\ndist = {}\ndef dfs(at, val=1):\n dist[at] = val\n if at in reposts:\n for go in reposts[at]:\n dfs(go, val + 1)\n\ndfs('polycarp')\nprint(max(dist.values()))\n", "d={'polycarp':1}\r\nfor i in range(int(input())):\r\n a,b,c=map(str,input().split())\r\n a,b,c=a.lower(),b.lower(),c.lower()\r\n d[a]=d[c]+1\r\nprint(max(d.values()))", "d = {'polycarp': 1}\r\nN = int(input())\r\nfor i in range(N):\r\n who, _, whom = input().lower().strip().split()\r\n d[who] = d[whom] + 1\r\nprint(max(d.values()))", "s={\"polycarp\":1}\r\nfor P in range(int(input())):\r\n k,_,t=input().lower().split()\r\n s[k]=s[t]+1\r\nprint(max(s.values()))", "n=int(input())\r\nm={}\r\nans=0\r\nfor i in range(n):\r\n s=input().split()\r\n s1=s[0].lower()\r\n s2=s[2].lower()\r\n if i==0:\r\n m[s2]=1\r\n m[s1]=m[s2]+1\r\n if m[s1]>ans:\r\n ans=m[s1]\r\nprint(ans)\r\n", "n = int(input())\n\ndef find_chain(name):\n if (memo[name] != -1):\n return memo[name]\n reposted_by = dp[name]\n sub_result = 0\n for i in reposted_by:\n sub_result = max(sub_result, find_chain(i))\n return 1 + sub_result\n\ndp = {\"polycarp\": []}\nmemo = {\"polycarp\": -1}\n\nfor i in range(n):\n name1, name2 = map(lambda str: str.lower(), input().split(\" reposted \"))\n dp[name2].append(name1)\n dp[name1] = []\n memo[name1] = -1\n\nprint(find_chain(\"polycarp\"))\n", "class Node:\n __slots__ = ('name', 'children')\n def __init__(self, name, children):\n self.name = name\n self.children = children\n\ndef longest_chain(root):\n if root is None:\n return 0\n\n length = 1\n for c in root.children:\n length = max(length, 1 + longest_chain(c))\n return length\n\nnodes = {}\n\nn = int(input())\nfor _ in range(n):\n activity = input().split()\n name_1 = activity[0].lower()\n name_2 = activity[2].lower()\n\n if name_1 not in nodes:\n nodes[name_1] = Node(name_1, [])\n node_1 = nodes[name_1]\n\n if name_2 not in nodes:\n nodes[name_2] = Node(name_2, [])\n node_2 = nodes[name_2]\n\n node_2.children.append(node_1)\n\npolycarp = nodes['polycarp']\nprint(longest_chain(polycarp))\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 = []\n\t\twhile len(self.graph[root])!=0:\n\t\t\tstack.append(root)\n\t\t\troot = g.graph[root][0]\n\t\t\tif count[root]:\n\t\t\t\tbreak\n\t\twhile len(stack)!=0:\n\t\t\te = stack.pop()\n\t\t\tcount[e] = count[self.graph[e][0]] + 1\n\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\nn = int(input())\nnames = {\"polycarp\":0}\na = []\nfor i in range(n):\n\ts = input().split()\n\ta.append(s)\n\tif s[0] not in names:\n\t\tnames[s[0].lower()] = i+1\n# print (names)\ng = Graph(len(names),True)\nfor i in a:\n\tg.addEdge(names[i[0].lower()],names[i[-1].lower()])\ncount = [0]*(n+1)\ncount[0] = 1\nfor i in range(n+1):\n\tif not count[i]:\n\t\tg.dfs(i,count)\nprint (max(count))\n", "n = int(input())\r\n\r\ngraph = {}\r\nfor i in range(n):\r\n repost,n,post = input().split()\r\n if post.lower() in graph:\r\n graph[post.lower()].append(repost.lower())\r\n else:\r\n graph[post.lower()] = [repost.lower()]\r\n\r\ndef dfs(start,graph):\r\n count = 1\r\n for i in graph[start]:\r\n if i in graph:\r\n count = max(count,dfs(i,graph))\r\n return count + 1\r\nprint(dfs(\"polycarp\",graph))", "\n# CODE BEGINS HERE.................\n\nfrom collections import deque\n\nn = int(input())\n\ngraph = {}\n\nfor i in range(n):\n\tname1, reposted, name2 = input().split()\n\tname1 = name1.lower()\n\tname2 = name2.lower()\n\tif name2 not in graph:\n\t\tgraph[name2] = []\n\tif name1 not in graph:\n\t\tgraph[name1] = []\n\tgraph[name2].append(name1)\n\nqueue = deque(['polycarp'])\ndistance = {name: -1 for name in graph.keys()}\ndistance['polycarp'] = 1\n\nwhile queue:\n\tname = queue.popleft()\n\tfor second_name in graph[name]:\n\t\tif distance[second_name] != -1:\n\t\t\tcontinue\n\t\tdistance[second_name] = distance[name] + 1\n\t\tqueue.append(second_name)\n\n# print(distance)\nprint(max(distance.values()))\n\n\n# CODE ENDS HERE....................\n\n", "n = int(input())\narr = []\nfor i in range(n):\n line = input().split()\n arr.append((line[0].lower(), line[-1].lower()))\n\nchains = {\"polycarp\": 1}\nfor a, b in arr:\n chains[a] = chains[b] + 1\n\nprint(max(chains.values()))\n", "\r\n\r\nn=int(input())\r\nd={'polycarp':1}\r\nm=0\r\nfor i in range(n):\r\n s=input().split()\r\n d[s[0].lower()]=d.get(s[2].lower(),0)+1\r\n m=max(m,d[s[0].lower()])\r\n\r\nprint(m)", "def dfs(v,count):\r\n visited[v] = 1\r\n for u in graph[v]:\r\n if visited[u] == 0:\r\n dfs(u,count + 1)\r\n count -= 1\r\n s[v] = count\r\n\r\n\r\n#polycarp --> 0\r\nn = int(input())\r\nreposted_list = []\r\nll = []\r\nfor _ in range(n):\r\n a,b = input().lower().split(' reposted ')\r\n ll += [[a,b]]\r\n reposted_list.append(a)\r\n reposted_list.append(b)\r\nreposted_list = list(set(reposted_list))\r\nreposted_list.remove('polycarp')\r\nreposted_list.insert(0,'polycarp')\r\ngraphs = []\r\nfor i in ll:\r\n graphs += [[reposted_list.index(i[0]),reposted_list.index(i[1])]]\r\ngraph = [[] for i in range(len(reposted_list))]\r\nfor i in graphs:\r\n c,d = i[0],i[1]\r\n graph[c].append(d)\r\n graph[d].append(c)\r\nvisited = [0]* len(reposted_list)\r\ns = [0]* len(reposted_list)\r\ndfs(0,1)\r\nprint(max(s) + 1)\r\n\r\n", "\r\nfrom collections import defaultdict, deque\r\nimport collections, math\r\nfrom concurrent.futures import thread\r\nimport heapq\r\nfrom operator import indexOf\r\nimport sys, threading\r\nmod = 1000000007\r\nimport math\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\ndef BFS(graph):\r\n queue = deque()\r\n queue.append(\"polycarp\")\r\n deep = 0\r\n visited = set()\r\n while queue:\r\n level_length = len(queue)\r\n for i in range(level_length):\r\n cur = queue.popleft()\r\n if cur not in visited:\r\n for i in graph[cur]:\r\n if i not in visited:\r\n queue.append(i)\r\n visited.add(cur)\r\n deep += 1\r\n \r\n return deep\r\n \r\ndef run():\r\n n = get_int()\r\n graph = defaultdict(list)\r\n \r\n for i in range(n):\r\n statement = get_string()\r\n statement = statement.split()\r\n graph[statement[2].lower()].append(statement[0].lower())\r\n print( BFS(graph))\r\n \r\n \r\n \r\nif __name__ == '__main__':\r\n threading.stack_size(1 << 27)\r\n sys.setrecursionlimit(1 << 30)\r\n main_thread = threading.Thread(target=run)\r\n main_thread.start()\r\n main_thread.join()", "def bfs(g,s):\r\n l=0\r\n a=[]\r\n a.append(s)\r\n a.append('-1')\r\n vis=[]\r\n vis.append(s)\r\n while(len(a)!=0):\r\n #print(s)\r\n s=a[0]\r\n a=a[1:]\r\n if(len(a)!=0 and s=='-1'):\r\n l+=1;\r\n a.append('-1')\r\n if(s!='-1'):\r\n for i in g[s]:\r\n #print(i)\r\n if i not in vis and i in g:\r\n a.append(i)\r\n vis.append(i)\r\n #print(a) \r\n return l+2\r\ndef dfs(g,s):\r\n res=0\r\n for i in g:\r\n res=max(res,bfs(g,i))\r\n return res\r\n\r\n\r\ng={}\r\nn=int(input())\r\nfor i in range(n):\r\n s=list(map(str,input().split(\" \")))\r\n if s[2].lower() not in g:\r\n g[s[2].lower()]=[]\r\n g[s[2].lower()].append(s[0].lower())\r\n#print(g)\r\n\r\nprint(dfs(g,'polycarp'))\r\n\r\n", "class Node:\n def __init__(self, name):\n self.name = name;\n self.children = []\n def add(self, node):\n self.children.append(node);\n\ndef findMax(nodes, curr, count):\n if len(curr.children) == 0:\n return count\n else:\n currCount = count\n for child in curr.children:\n currCount = max(currCount, findMax(nodes, child, count + 1))\n\n return currCount\n\ndef main():\n nodes = dict();\n nodes['polycarp'] = Node('polycarp')\n\n t = int(input().strip())\n\n while t:\n st = input().strip().split(' ')\n user1 = st[0].lower()\n user2 = st[2].lower()\n\n nodes[user1] = Node(user1)\n nodes[user2].add(nodes[user1])\n t -= 1\n\n print(findMax(nodes, nodes['polycarp'], 1))\n\n\nif __name__ == '__main__':\n main()\n\n\t\t \t\t \t\t \t\t\t\t \t \t \t \t\t \t \t", "s={\"Polycarp\".upper():1}\r\na=int(input())\r\nans=0\r\nfor i in range(0,a):\r\n s1,s2,s3=input().split()\r\n s1=s1.upper()\r\n s3=s3.upper()\r\n s[s1]=s[s3]+1\r\n ans=max(ans,int(s[s1]))\r\n\r\nprint(ans)\r\n", "def have(i):\r\n try:\r\n a = graph[i]\r\n return True\r\n except: return False\r\n\r\ngraph = {}\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n s = list(input().upper().split())\r\n graph[s[0]] = s[2]\r\nfor i in graph:\r\n cnt = 1\r\n while have(i):\r\n cnt += 1\r\n i = graph[i]\r\n ans = max(ans,cnt)\r\nprint(ans)", "d = {'polycarp': 1}\nfor _ in range(int(input())):\n x, y, z = input().lower().split(' '); \n d[x] = d[z] + 1\nprint(max(d.values()))\n \t\t \t\t\t\t \t \t \t \t\t\t \t", "n = int(input())\r\nans = 1\r\nl = {\"polycarp\": 1}\r\n\r\nfor _ in range(n):\r\n a, _, c = input().lower().split()\r\n e = l[c] + 1\r\n if e > ans:\r\n ans = e\r\n l[a] = e\r\n\r\nprint(ans)\r\n", "p=dict()\np[\"#\"]=0\ndef dfs(adjList,child,parent):\n # print(child,end=\" \")\n if parent==\"polycarp\":\n p[child]=1\n else:\n p[child]=p[parent]+1\n for i in adjList[child]:\n if i!=parent:\n dfs(adjList,i,child)\n\n\nn=int(input())\nadjList=dict()\nfor i in range(n):\n s=input()\n s=s.split()\n a,b=s[0].lower(),s[2].lower()\n if b in adjList:\n adjList[b].append(a)\n else:\n adjList[b]=[a]\n if a in adjList:\n adjList[a].append(b)\n else:\n adjList[a]=[b]\n\n# print(\"\\n\")\n# for i in adjList:\n# print(i,adjList[i])\n# print(\"\\n\")\ndfs(adjList,\"polycarp\",\"#\")\n# print(\"\\n\")\nprint(max(p.values())+1)\n \t\t \t \t\t \t \t \t\t\t\t\t \t\t\t \t\t", "n = int(input())\r\nd = dict()\r\nd[\"polycarp\"] = 1\r\nmaximum = 1\r\nfor i in range(0, n):\r\n a = list(map(str, input().split()))\r\n fromW = a[2].lower()\r\n toW = a[0].lower()\r\n d[toW] = d[fromW] + 1\r\n maximum = max(d[toW], maximum)\r\nprint(maximum)", "import sys\r\ndef dfs(graf, used, k, now):\r\n global m\r\n used[now] = 1\r\n if k > m:\r\n m = k\r\n for i in graf[now]:\r\n if used[i] == 0:\r\n dfs(graf, used, k + 1, i)\r\n\r\n\r\nsys.setrecursionlimit(10**9)\r\nn = int(input())\r\nnames = {'polycarp': 0}\r\ngraf = [[]]\r\nk = 1\r\nm = 2\r\nused = [0 for i in range(n + 1)]\r\nfor i in range(n):\r\n a, b = input().lower().split(' reposted ')\r\n if b in names.keys():\r\n names[a] = k\r\n graf[names[b]].append(names[a])\r\n graf.append([])\r\n k += 1\r\n else:\r\n names[b] = k\r\n graf[k].append(k + 1)\r\n k += 1\r\n names[a] = k\r\n k += 1\r\ndfs(graf, used, 1, 0)\r\nprint(m)\r\n\r\n", "def main():\r\n n = int(input())\r\n from collections import defaultdict\r\n e = defaultdict(list)\r\n for _ in range(n):\r\n dst, _ , src = input().split(' ')\r\n \r\n e[src.lower()].append(dst.lower())\r\n ans = 0\r\n dq = ['Polycarp'.lower()]\r\n visit = set(dq)\r\n while dq:\r\n ans += 1\r\n new_dq = []\r\n for node in dq:\r\n for neibor in e[node]:\r\n if neibor not in visit:\r\n visit.add(neibor)\r\n new_dq.append(neibor)\r\n dq = new_dq\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict,deque\r\nlength=int(input())\r\ngraph=defaultdict(list)\r\ndp=defaultdict(int)\r\nback=defaultdict(list)\r\ninDegree=defaultdict(int)\r\nsets=set()\r\nfor _ in range(length):\r\n x,b,y=[i.lower() for i in input().split()] \r\n \r\n graph[x].append(y)\r\n \r\n inDegree[y]+=1\r\n sets.add(x)\r\n sets.add(y)\r\n \r\nlevel=deque([])\r\nfor i in sets:\r\n if not inDegree[i]:\r\n level.append(i)\r\nwhile level:\r\n node=level.popleft()\r\n for val in graph[node]:\r\n inDegree[val]-=1\r\n if inDegree[val]==0:\r\n level.append(val)\r\n dp[val]=max(dp[node]+1,dp[val])\r\n\r\nprint(dp[\"polycarp\"]+1)\r\n\r\n", "def DFS(x, h, dic):\r\n ans = h\r\n if x in dic:\r\n for i in dic[x]:\r\n ans = max(DFS(i, h+1, dic), ans)\r\n return ans\r\nn = int(input())\r\ndic = {}\r\nfor i in range(n):\r\n s = input()\r\n s = s.split()\r\n if s[2].lower() not in dic:\r\n dic[s[2].lower()] = []\r\n dic[s[2].lower()].append(s[0].lower())\r\nprint(DFS(\"polycarp\", 0, dic)+1)", "from operator import itemgetter\r\nusers = {'polycarp': 1}\r\n\r\ntry:\r\n n=int(input())\r\n for _ in range(n):\r\n user1, user2 = input().lower().split(\" reposted \")\r\n users[user1] = users[user2] + 1\r\n a=sorted(users.items(), key=itemgetter(1), reverse=True)[0][1]\r\n print(a)\r\n\r\nexcept:\r\n print(\"0\")\r\n", "def fun(d,s):\r\n l=1\r\n a=0\r\n try:\r\n for j in d[s]:\r\n a=max(a,fun(d,j))\r\n except KeyError:\r\n k=1\r\n return l+a\r\nn=int(input())\r\nd={}\r\nfor i in range(n):\r\n l=list(map(str,input().split()))\r\n a=l[0].lower()\r\n b=l[2].lower()\r\n try:\r\n d[b].append(a)\r\n except KeyError:\r\n d[b]=[a]\r\nma=0\r\nfor i in d:\r\n ma=max(ma,fun(d,i))\r\nprint(ma)\r\n\r\n", "n = int(input())\nlst = [input().lower().split() for i in range(n)]\nd = dict()\nd['polycarp'] = 1\nmx = 1\nfor i in lst:\n d[i[0]] = d[i[2]] + 1\n mx = max(mx, d[i[0]])\nprint(mx)\n", "n = int(input())\r\n\r\nl = [input().lower().split(' ') for i in range(n)]\r\n\r\nflat_list = [item for sublist in l for item in sublist]\r\n\r\nlengths = dict.fromkeys(flat_list, 0)\r\nlengths['polycarp'] = 1\r\n\r\nfor i in l:\r\n s1 = i[0]\r\n s2 = i[2]\r\n lengths[s1] = lengths[s2] + 1\r\n\r\nprint(max(lengths.values()))\r\n", "n = int(input())\r\na = [input().lower().split(\" reposted \") for i in range(n)]\r\nb = {\"polycarp\" : 1}\r\nfor name1, name2 in a:\r\n b[name1] = b[name2] + 1\r\nprint(max(b.values()))", "#!/usr/bin/env python3\n\nlines = int(input())\n\nsuccessor = {}\nchain = {}\nlongest = [0]\n\nfor x in range(lines):\n [a, b] = [x.lower() for x in input().split(' reposted ', 2)]\n successor[a] = b\n\n\ndef dfs(node, current):\n if node in chain:\n chain[node] = max(chain[node], current)\n else:\n chain[node] = current\n\n longest[0] = max(chain[node], longest[0])\n\n if node in successor:\n dfs(successor[node], current + 1)\n\nfor x in successor:\n dfs(x, 1)\n\nprint(longest[0])\n", "d = {'polycarp': 1}\r\nfor i in range(int(input())):\r\n j, k, l = input().lower().split()\r\n d[j] = d[l] + 1\r\nprint(max(d.values()))\r\n", "from sys import stdin, stdout\r\nfin = stdin.readline\r\nfout = stdout.write\r\nfrom collections import defaultdict, deque\r\n\r\ndef solve():\r\n n = int(fin())\r\n p = 'polycarp'\r\n\r\n gr = defaultdict(list)\r\n\r\n for i in range(n):\r\n w = fin().lower().split()\r\n gr[w[2]].append(w[0])\r\n\r\n r = 0\r\n par = defaultdict(lambda: 1)\r\n\r\n st = [p]\r\n vis = set()\r\n while st:\r\n cur = st.pop()\r\n if not cur in vis:\r\n vis.add(cur)\r\n pa = par[cur]\r\n for nei in gr[cur]:\r\n if not nei in vis:\r\n par[nei] = pa + 1\r\n st.append(nei)\r\n\r\n for i in par:\r\n r = max(r, par[i])\r\n\r\n fout(str(r)+'\\n')\r\n\r\nsolve()\r\n\r\n", "dic = {\"polycarp\":1}\r\nfor i in range(int(input())):\r\n z = input().split()\r\n a = z[0].lower()\r\n b = z[-1].lower()\r\n dic[a] = dic[b]+1\r\nxyz = list(dic.values())\r\nprint(max(xyz))", "c = {'polycarp': 1}\r\nfor i in range(int(input())):\r\n r = input().split()\r\n c[r[0].lower()] = c[r[2].lower()] + 1\r\nprint(max(c.values()))", "d={'polycarp':1}\r\nfor _ in range(int(input())):a,b,c=input().lower().split();d[a]=d[c]+1\r\nprint(max(d.values()))", "import copy\r\ndef dnf(arr, nickname):\r\n max_val = 1\r\n max_local = 0\r\n for k in range(len(arr)):\r\n\r\n\r\n if arr[k][1] == nickname:\r\n new_nickname = arr[k][0]\r\n arr1 = copy.copy(arr)\r\n arr1.pop(k)\r\n max_local = max(dnf(arr1,new_nickname), int(max_local))\r\n return(max_val+max_local)\r\n\r\n\r\n\r\nn = int(input());\r\nreposts = []\r\nfor i in range(n):\r\n reposts.append(input().lower().split(sep=\" reposted \"))\r\n\r\nprint(dnf(reposts,\"polycarp\"))", "n=int(input())\r\narr=list([False]*(n+1) for i in range(n+1))\r\nslov={}\r\nslov['polycarp']=0\r\nq=1\r\nfor i in range(n):\r\n a=input().lower().split()\r\n slov[a[0]]=q\r\n arr[slov[a[2]]][q]=True\r\n q+=1\r\ndef obh(i):\r\n global arr, n\r\n ma=0\r\n for t in range(n+1):\r\n if arr[i][t]:\r\n arr[i][t]=False\r\n q=obh(t)\r\n if q+1>ma:\r\n ma=q+1\r\n return ma\r\nprint(obh(0)+1)", "n_reposts = int(input())\r\n\r\nreposts = dict()\r\n\r\nfor _ in range(n_reposts):\r\n name1, __, name2 = (s.lower() for s in input().split())\r\n\r\n if name2 not in reposts.keys():\r\n reposts[name2] = [name1]\r\n else:\r\n reposts[name2].append(name1)\r\n\r\ndef dfs_len(reposts, name, max_len, visited):\r\n if name not in visited:\r\n visited.add(name)\r\n if name in reposts.keys() and len(reposts[name]) > 0:\r\n return max(dfs_len(reposts, name_next, max_len + 1, visited) for name_next in reposts[name])\r\n else:\r\n return max_len\r\n\r\nprint(dfs_len(reposts, 'polycarp', 1, set()))", "n = int(input())\r\nname = [0, 'polycarp']\r\nrb = [[] for i in range(2)]\r\nfor _ in range(n):\r\n a, c, b = input().split()\r\n a = a.lower()\r\n b = b.lower()\r\n name.append(a)\r\n rb.append([])\r\n rb[-1].append(name.index(b))\r\n rb[name.index(b)].append(_ + 2)\r\nuse = [0] * (len(rb))\r\nd = [10 ** 9] * (len(rb))\r\nd[1] = 0\r\noc = [1]\r\ndef bfs(v):\r\n global oc\r\n use[v] = 1\r\n for i in rb[v]:\r\n if use[i] == 0:\r\n d[i] = min(d[i], d[v] + 1)\r\n oc.append(i)\r\n oc = oc[1:]\r\nwhile len(oc) > 0:\r\n bfs(oc[0])\r\nd[0] = -10\r\nprint(max(d) + 1)\r\n", "class Node:\n\tdef __init__(self, name, children):\n\t\tself.name = name\n\t\tself.children = children\n\ndef lowercase(word):\n\talphabet = \"abcdefghijklmnopqrstuvwxyz\"\n\tAlphabet = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\n\tans = \"\"\n\tfor char in word:\n\t\tif char in Alphabet:\n\t\t\tans += alphabet[Alphabet.index(char)]\n\t\telse:\n\t\t\tans += char\n\treturn ans\n\nn = int(input())\nparent_child_set = []\nfor i in range(n):\n\tstring = input().split()\n\tparent_child_set.append([lowercase(string[-1]), lowercase(string[0])])\n\ndictionary = {}\nfor pair in parent_child_set:\n\tparent = pair[0]\n\tchild = pair[1]\n\ttry:\n\t\t# case when entry is already in dict\n\t\tdictionary[parent].append(child)\n\texcept KeyError:\n\t\t# otherwise, create the entry\n\t\tdictionary[parent] = [child]\n\ntree = Node(\"polycarp\", {})\n\ndef build(tree_graph, node):\n\t# tree_graph is the partial tree\n\t# node is the node where the tree will be extended, i.e. the name\n\ttry:\n\t\tfor name in dictionary[node]:\n\t\t\ttree_graph.children[name] = Node(name, {})\n\t\t\tbuild(tree_graph.children[name], name)\t\n\texcept KeyError:\n\t\tpass # there is no entry in the dict, so the tree stops here\n\nbuild(tree, \"polycarp\")\n\ndef dfs(tree_graph):\n\tif tree_graph.children == {}:\n\t\treturn 1\n\tans = 0\n\tfor name in tree_graph.children:\n\t\tans = max(ans, dfs(tree_graph.children[name]))\n\treturn ans + 1\nprint(dfs(tree))", "n = int(input())\r\nM = dict()\r\nM['policarp']=1\r\nfor i in range(n):\r\n a,rep,b = input().split();\r\n a = str.lower(a)\r\n b = str.lower(b)\r\n try:\r\n M[a]=M[b]+1;\r\n except Exception:\r\n M[a]=2;\r\nmx=0\r\nfor i,k in M.items():\r\n if k>mx:\r\n mx=k\r\nprint(mx)\r\n", "def main():\n n = int(input())\n vertices = set()\n graph = {}\n for i in range(n):\n s = input().split()\n\n r1 = s[0].lower()\n r2 = s[2].lower()\n if r1 not in vertices:\n graph[r1] = []\n vertices.add(r1)\n if r2 not in vertices:\n graph[r2] = []\n vertices.add(r2)\n graph[r2].append(r1)\n\n print(depth(\"polycarp\", graph))\n\ndef depth(name, graph):\n d = 0\n for i in graph[name]:\n d = max(d,depth(i,graph))\n return d+1\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nfrom collections import deque, defaultdict as dd\r\nfrom bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil, sqrt, log, gcd\r\ndef ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(input().split())\r\ndef li(): return list(input().split())\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,\r\n 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24,\r\n '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\ndef solve():\r\n n = ii()\r\n dic = {}\r\n for repost in range(n):\r\n now, dummy, already = li()\r\n now = now.lower()\r\n already = already.lower()\r\n if repost == 0:\r\n dic[already] = 1\r\n dic[now] = dic[already]+1\r\n return max(dic.values())\r\n\r\nif __name__ == \"__main__\":\r\n print(solve())\r\n", "def DFS (node, chain):\n visited[node] = True\n global ans\n ans = max(ans, chain)\n if (not (node in adjList)):\n return\n for adjNode in adjList[node]:\n if (not (adjNode in visited)):\n DFS(adjNode, chain + 1)\n\nN = int(input())\n\nadjList = {}\n\nfor i in range(N):\n command = input().split()\n first = command[0]\n second = command[2]\n first = first.lower()\n second = second.lower()\n if (not (second in adjList)): adjList[second] = []\n adjList[second].append(first) \n\nvisited = {}\n\nans = 0\n\nDFS(\"polycarp\", 0)\n\nprint(ans+1)\n \n\n\t\t \t \t\t\t\t\t \t \t\t \t \t \t \t \t\t\t", "def dfs(adj,node,vis):\n vis.add(node)\n for n in adj[node]:\n if n not in vis:\n return 1+dfs(adj,n,vis)\n return 0\n\nfrom sys import stdin, stdout \nn = int(stdin.readline())\ns = []\nfor i in range(n):\n x = list( stdin.readline().split() )\n for j in range(3):\n x[j] = x[j].lower()\n s.append(x)\n# print(s)\nd = {}\nl = 1\nfor i in range(len(s)):\n n1,n2 = s[i][0],s[i][2]\n if n1 not in d:\n d[n1] = l\n l+=1\n if n2 not in d:\n d[n2] = l\n l+=1\n\nfrom collections import defaultdict\nadj = defaultdict(list)\n# this is a directed graph\nfor i in range(len(s)):\n x,y = d[s[i][0]],d[s[i][2]]\n adj[x].append(y)\nans = 0\nfor i in range(1,l+1):\n vis = set()\n c = dfs(adj,i,vis)\n ans = max(ans,c+1)\nstdout.write(\"{}\\n\".format(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndict = {\"polycarp\" : 1}\r\nchain = 1\r\n\r\nfor _ in range(int(input())):\r\n a, _, b = map(lambda x: x.lower(), input().split())\r\n dict[a] = dict[b] + 1\r\n chain = max(chain, dict[a])\r\n\r\nprint(chain)", "#!/usr/bin/python3\n\ndef read_int():\n return int(input().split()[0])\n \ndef walk_tree(cur, parent, depth, maxDepth):\n depth += 1\n if depth>maxDepth: maxDepth = depth\n for child in rs[cur]:\n if child != parent:\n result = walk_tree(child,cur,depth,maxDepth)\n if result > maxDepth: maxDepth = result\n return maxDepth \n \nrs = {} \n \nnReposts = read_int()\n\nreadRoot = True\nrootPoster = None\n\nfor i in range(0,nReposts):\n words = input().split()\n words[0] = words[0].lower()\n words[2] = words[2].lower()\n if readRoot:\n readRoot = False\n rootPoster = words[2]\n if not words[0] in rs: rs[words[0]] = []\n if not words[2] in rs: rs[words[2]] = []\n rs[words[0]].append(words[2])\n rs[words[2]].append(words[0])\n \nmaxDepth = walk_tree(rootPoster,rootPoster,0,0) \n \nprint(maxDepth) \n \n", "import sys\r\ninput = lambda :sys.stdin.readline().rstrip('\\r\\n')\r\nfrom collections import defaultdict\r\nn=int(input())\r\ndepth = defaultdict(lambda :0)\r\ndepth['polycarp']=1\r\nfor _ in range(n):\r\n u,x,v= input().split()\r\n u=u.lower()\r\n v=v.lower()\r\n depth[u] = depth[v]+1;\r\n# print(depth)\r\nprint(max(depth.values()))", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n c,b,a=input().split()\r\n a=a.lower();c=c.lower()\r\n if a not in d.keys():\r\n d[a]=[]\r\n d[a].append(c)\r\n#print(d)\r\nc=1\r\nq=['polycarp',None]\r\nwhile len(q):\r\n p=q.pop(0)\r\n if p:\r\n if p in d.keys():\r\n for i in d[p]:\r\n q.append(i)\r\n else:\r\n if len(q):\r\n if q[0]==None:\r\n break\r\n c+=1\r\n q.append(None)\r\n #print(q)\r\n \r\nprint(c)", "n = int(input())\r\nvd = {}\r\nfor i in range(n):\r\n vf,_,vt = input().lower().split()\r\n if vt not in vd:\r\n vd[vt] = []\r\n vd[vt].append(vf)\r\nvs = ['polycarp']*(n+1) #vertice stack\r\nsp = 0 #stack pointer\r\nvl = {'polycarp':1} #layer of Vs\r\nwhile sp>-1: #while stack is not empty\r\n p = vs[sp] #pop top as parent\r\n sp -= 1 #pop is MUST!\r\n if p not in vd: # no child, no push\r\n continue\r\n for v in vd[p]: # push all children with L+1\r\n sp += 1\r\n vs[sp]= v\r\n vl[v] = vl[p]+1\r\nprint(max(vl.values())) \r\n", "\r\n\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nmap_ = defaultdict(list)\r\nvisited = set('polycarp')\r\n\r\nfinal = []\r\nmax_ = 0\r\ndef dfs(node , count , map_, result , max_):\r\n \r\n \r\n max_ = max(max_ , count)\r\n final.append(max_)\r\n for i in map_[node]:\r\n if i not in visited:\r\n result.append(i)\r\n visited.add(i)\r\n # max_ = max(max_ , len(result.copy()))\r\n \r\n dfs(i , count + 1 , map_ , result , max_)\r\n \r\n else:\r\n continue\r\n \r\n \r\n \r\n \r\n return max(final)\r\nresult = []\r\n\r\nfor _ in range(n):\r\n \r\n all_ = input().split(\" \")\r\n map_[all_[2].lower()].append((all_[0].lower()))\r\nprint((dfs('polycarp' ,1 , map_ , result , max_)))\r\n\r\n \r\n \r\n", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 20/09/2020\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport heapq\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations, permutations\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\nd = {\"polycarp\": \"polycarp\"}\r\narr = []\r\nfor i in range(n):\r\n s = [i.lower() for i in isa()]\r\n d[s[0]] = s[-1]\r\n arr.append(s[0])\r\n\r\nres = 0\r\nfor i in arr:\r\n cur, length = i, 1\r\n while cur != d[cur]:\r\n cur = d[cur]\r\n length += 1\r\n res = max(res, length)\r\nprint(res)\r\n\r\n \r\n\r\n\r\n", "n = int(input())\nm = {}\nl = []\nc = 0\nfor i in range(n):\n s = input().split(' ')\n if m.get(s[2].lower(), None) is None:\n l.append(1)\n m[s[2].lower()] = c\n c += 1\n\n if m.get(s[0].lower(), None) is None:\n l.append(l[m[s[2].lower()]] + 1)\n m[s[0].lower()] = c\n c += 1\n else:\n l[m[s[0].lower()]] += 1\n\nt = 0\nfor item in l:\n t = max(item, t)\n\nprint(t)\n", "G = {}\r\ndist = {}\r\n\r\ndef bfs():\r\n q = ['polycarp']\r\n dist['polycarp'] = 1\r\n ans = 1\r\n\r\n while len(q) > 0:\r\n u = q.pop(0)\r\n if u not in G:\r\n continue\r\n for v in G[u]:\r\n dist[v] = dist[u] + 1\r\n ans = max(ans, dist[v])\r\n q.append(v)\r\n return ans\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n y, z, x = input().split()\r\n \r\n x = x.lower()\r\n y = y.lower()\r\n \r\n if x not in G:\r\n G[x] = [y]\r\n else:\r\n G[x].append(y)\r\n\r\n#print(G['Polycarp'])\r\nr = bfs()\r\nprint(r)", "def main():\r\n n=int(input())\r\n adj={'polycarp':set()}\r\n for _ in range(n):\r\n a,x,b=map(str,input().split())\r\n a=a.lower()\r\n b=b.lower()\r\n if b in adj:\r\n adj[b].add(a)\r\n else:\r\n adj[b]=set()\r\n adj[b].add(a)\r\n vis=set()\r\n\r\n def solve(start):\r\n vis.add(start)\r\n\r\n maxi=-10**9\r\n if start not in adj:\r\n return 0\r\n for child in adj[start]:\r\n if child not in vis:\r\n vis.add(child)\r\n maxi=max(maxi,1+solve(child))\r\n return maxi\r\n print(solve('polycarp')+1)\r\nmain()", "n = int(input())\r\nd = dict()\r\nd['polycarp'] = 1\r\nfor i in range(n):\r\n a, b = input().lower().split(\" reposted \")\r\n d[a] = d[b] + 1\r\nprint(max(d.values()))\r\n", "from collections import deque \r\nn = int(input())\r\nm = {}\r\nadj = []\r\nfor i in range(202):\r\n adj.append([])\r\nj = 1\r\nfor i in range(n):\r\n arr = input().split()\r\n u = (arr[2]).lower()\r\n if(not u in m.keys()):\r\n m[u] = j;\r\n j+=1;\r\n v = (arr[0]).lower()\r\n if(not v in m.keys()):\r\n m[v] = j;\r\n j+=1;\r\n adj[m[u]].append(m[v])\r\nans = 0 \r\nfor i in range(1,202):\r\n visited = [0] * 203\r\n q = deque() \r\n distance = [-1] *203\r\n q.append(i)\r\n distance[i] = 1;\r\n visited[i] = 1;\r\n while(len(q)!=0):\r\n a = q[0]\r\n q.popleft()\r\n for k in adj[a]:\r\n if(not visited[k]):\r\n visited[k] = 1;\r\n distance[k] = distance[a] +1\r\n q.append(k)\r\n maxa = max(distance) \r\n ans = max(ans,maxa)\r\n \r\nprint(ans) ", "n = int(input())\r\ndata = dict()\r\nsmall = ['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\nbig = ['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\ndata['polycarp'] = 1\r\nfor i in range(n):\r\n name11, rep, name22 = input().split()\r\n name1, name2 = '', ''\r\n for i in range(len(name11)):\r\n if name11[i] in big:\r\n name1 += small[big.index(name11[i])]\r\n else:\r\n name1 += name11[i]\r\n for i in range(len(name22)):\r\n if name22[i] in big:\r\n name2 += small[big.index(name22[i])]\r\n else:\r\n name2 += name22[i]\r\n data[name1] = data[name2] + 1\r\nhelp = list(data)\r\nans = 0\r\nfor elem in help:\r\n ans = max(ans, data[elem])\r\nprint(ans)", "# from sys import stdout\r\nfrom bisect import bisect_left as bs\r\nfrom math import log as lg\r\n\r\nlog = lambda *x: print(*x)\r\n\r\ndef cin(*fn, def_fn=str):\r\n\ti,r = 0,[]\r\n\tif fn: def_fn=fn[0]\r\n\tfor c in input().split(' '):\r\n\t\tr+=[(fn[i] if len(fn)>i else def_fn) (c)]\r\n\t\ti+=1\r\n\treturn r\r\n\r\nn, = cin(int)\r\nmx,u = 1,{'polycarp': 1}\r\nfor i in range(n):\r\n\tn1,r,n2 = cin(str)\r\n\tn1,n2 = n1.lower(),n2.lower()\r\n\tu[n1] = 1+u[n2]\r\n\tmx = max(u[n1], mx)\r\nlog(mx)\r\n\r\n\r\n\r\n", "n = int(input())\ndep = {}\ndep['polycarp'] = 1\nans = 1\nfor i in range(n):\n\tuser, _, fruser = input().split()\n\td = dep[user.lower()] = dep[fruser.lower()] + 1\n\tans = max(ans, d)\nprint(ans)\n", "def dfs(node, parent=None):\n\tval = 0\n\tfor child in g.get(node, list()):\n\t\tif child != parent:\n\t\t\tval = max(val, dfs(child, node))\n\treturn val + 1\nn = int(input().strip())\ng = dict()\nfor i in range(n):\n\ts = input().strip().split()\n\ts[0] = s[0].lower()\n\ts[2] = s[2].lower()\n\tl = g.get(s[2], list())\n\tl.append(s[0]); g[s[2]] = l;\nprint(dfs(\"polycarp\"))", "a=int(input())\ndic={}\nfor c in range(a):\n b=input().split()\n b[0]=b[0].upper()\n b[2]=b[2].upper()\n if b[2] in dic:\n dic[b[2]].append(b[0])\n else:\n dic[b[2]]=[]\n dic[b[2]].append(b[0])\nai=1\np=0\ndef dfs(no):\n global ai\n global p\n if ai>p:\n p=ai\n \n if no not in dic:\n return 0\n for c in range(len(dic[no])):\n ai+=1\n dfs(dic[no][c])\n ai-=1\n \ndfs(\"POLYCARP\")\nprint(p)\n\t\t \t \t\t\t\t \t\t\t\t \t \t \t", "from collections import defaultdict, deque\r\n\r\n\r\nn = int(input())\r\n\r\n\r\ngraph = defaultdict(list)\r\nfor _ in range(n):\r\n person1,mid, person2 = input().split()\r\n graph[person2.lower()].append(person1.lower())\r\n\r\nvisited=set()\r\ndef bfs(node):\r\n q = deque([(0, node)])\r\n visited.add(node)\r\n steps = 0\r\n ans = 0\r\n\r\n while q:\r\n\r\n steps, cur = q.popleft()\r\n ans = max(ans , steps)\r\n\r\n for neig in graph[cur]:\r\n if neig not in visited:\r\n q.append((steps+1, neig))\r\n visited.add(neig)\r\n \r\n return ans\r\n\r\nans = 0\r\nfor node in list(graph.keys()):\r\n # print(graph)\r\n if node not in visited:\r\n ans = max(ans, bfs(node))\r\n\r\nprint(ans+1)\r\n\r\n", "n = int(input())\r\nreposts = {}\r\nfor _ in range(n):\r\n a, _, b = input().split()\r\n a, b = a.lower(), b.lower()\r\n reposts[a] = reposts.get(b, 0) + 1\r\nprint(max(reposts.values()) + 1)", "mas = {}\r\nmas[\"polycarp\"]=1\r\nn = int(input())\r\ni, res = 0, 1\r\nfor i in range(n):\r\n name1, a, name2 = input().split()\r\n name1, a, name2 = name1.lower(), a.lower(), name2.lower()\r\n e = mas[name2] + 1\r\n mas[name1] = e\r\n if e > res:\r\n res = e\r\nprint(res)", "# cook your dish here\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nimport bisect\r\nimport math\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n#(a/b)%m =((a%m)*pow(b,m-2)%m)%m\r\n\r\nn=int(I1())\r\nd={\"polycarp\":1}\r\nfor _ in range(n):\r\n a,b,c=map(str,input().lower().strip().split())\r\n d[a]=d[c]+1 \r\nprint(max(d.values()))\r\n \r\n \r\n", "def init(i):\n arr= list()\n arr.append(['polycarp',1])\n for i in range (i):\n temp=input().lower().split(' ')\n for i in range(len(arr)):\n\n if(temp[2]==arr[i][0]):\n arr.append([temp[0],arr[i][1]+1])\n\n return arr\n\ndef count(arr):\n maximum = arr[0][1]\n for i in range(len(arr)):\n maximum =max(maximum,arr[i][1])\n\n return maximum\n\na=init(int(input()))\n\nprint(count(a))", "n = int(input())\r\ndic = {'polycarp':1}\r\nfor i in range(n):\r\n\ta,b = input().lower().split(' reposted ')\r\n\tdic[a] = dic[b]+1\r\nprint(max(dic.values()))\r\n\t", "from collections import defaultdict, deque\r\n\r\nG = defaultdict(set)\r\n\r\nfor _ in range(int(input())):\r\n V, _, U = input().lower().split()\r\n G[U].add(V)\r\n\r\nseen = {'polycarp'}\r\nqueue = deque([('polycarp', 1)])\r\n\r\nwhile queue:\r\n U, x = queue.popleft()\r\n for V in G[U]:\r\n if V not in seen:\r\n queue.append((V, x+1))\r\n seen.add(V)\r\n\r\nprint(x)", "n=int(input())\r\nD={}\r\nD['polycarp']=1\r\nfor i in range(n):\r\n a=input().lower().split()\r\n if a[0] not in D:\r\n D[a[0]]=D[a[-1]]+1\r\nl=max(D,key=D.get)\r\nprint(D[l])", "#!/usr/bin/python3\n\nn = int(input())\n\nchain = {'polycarp': 1}\nmax_chain = 1\n\nfor i in range(n):\n\ts = input().lower().split()\n\twho, from_whom = s[0], s[2]\n\n\tchain[who] = chain[from_whom] + 1\n\tmax_chain = max(max_chain, chain[who])\n\nprint(max_chain)\n", "inp=int(input())\r\nist={'polycarp':1}\r\nfor i in range(inp):\r\n n1,repost,n2=input().lower().split(' ')\r\n ist[n1]=1+ist[n2]\r\nz=ist.values()\r\nprint(max(z))", "import sys\r\n\r\nmaxLen = 1\t\r\n\r\ndef DFS(V, U, cur, leng):\r\n\tglobal maxLen\r\n\tif leng > maxLen:\r\n\t\tmaxLen = leng\r\n\tfor i in range(len(vec[cur])):\r\n\t\tif U[i] == False and V[cur][i] == 1:\r\n\t\t\tU[i] = True\r\n\t\t\tDFS(V, U, i, leng + 1)\r\n\t\t\tU[i] = False\r\n\r\nn = int(input())\r\nname2int = {}\r\nvec = []\r\nfor i in range(n * 2):\r\n\tvec.append([])\r\n\tfor j in range(n * 2):\r\n\t\tvec[i].append(0)\r\n\r\n#print (vec)\t\t\r\npos = 0\r\nfor i in range(n):\r\n\tname1, tmp, name2 = sys.stdin.readline().lower().split()\r\n\t#print (name1 + \" \" + tmp + \" \" + name2)\r\n\tif name2int.get(name2) == None:\r\n\t\tname2int[name2] = pos\r\n\t\tpos += 1\r\n\tif name2int.get(name1) == None:\r\n\t\tname2int[name1] = pos\r\n\t\tpos += 1\r\n\t#print (str(name2int[name2]) + \" \" + str(name2int[name1]))\r\n\tvec[name2int[name2]][name2int[name1]] = 1\r\n\tvec[name2int[name1]][name2int[name2]] = 1\r\n\r\nused = []\r\nfor i in range(2 * n):\r\n\tused.append(False)\r\n\r\nused[0] = True\r\n\r\nDFS(vec, used, 0, 1)\r\nprint (maxLen)", "n=int(input())\r\npeople={}\r\nsuma=0\r\nmaxa=0\r\nres=[]\r\nfor i in range(n):\r\n s1,s2,s3=input().split()\r\n s4=s1.lower()\r\n s5=s3.lower() \r\n res.append(s4)\r\n people[s4]=s5\r\nfor i in range(n):\r\n m=res[i]\r\n while people[m]!='polycarp':\r\n m=people[m]\r\n suma+=1\r\n suma+=2\r\n if suma>maxa:\r\n maxa=suma\r\n suma=0\r\nprint(maxa)", "n=int(input())\r\ntr={}\r\ngr=[[] for i in range(n)]\r\nch,par=input().split(\" reposted \")\r\npa=''\r\nfor i in range(len(par)):\r\n\tif ord(par[i])-ord('a')>=0 or par[i] in '0123456789':\r\n\t\tpa+=par[i]\r\n\telse:pa+=chr(ord(par[i])-ord('A')+ord('a'))\r\nc=''\r\nfor i in range(len(ch)):\r\n\tif ord(ch[i])-ord('a')>=0 or ch[i] in '0123456789':\r\n\t\tc+=ch[i]\r\n\telse:c+=chr(ord(ch[i])-ord('A')+ord('a'))\r\ntr[pa]=0\r\ntr[c]=1\r\ngr[tr[pa]].append(tr[c])\r\ncnt=1\r\nfor i in range(1,n):\r\n\tch,par=input().split(\" reposted \")\r\n\tpa=''\r\n\tfor i in range(len(par)):\r\n\t\tif ord(par[i])-ord('a')>=0 or par[i] in '0123456789':\r\n\t\t\tpa+=par[i]\r\n\t\telse:pa+=chr(ord(par[i])-ord('A')+ord('a'))\r\n\tc=''\r\n\tfor i in range(len(ch)):\r\n\t\tif ord(ch[i])-ord('a')>=0 or ch[i] in '0123456789':\r\n\t\t\tc+=ch[i]\r\n\t\telse:c+=chr(ord(ch[i])-ord('A')+ord('a'))\r\n\tif c not in tr.keys():\r\n\t\tcnt+=1\r\n\t\ttr[c]=cnt\r\n\tgr[tr[pa]].append(tr[c])\r\ns=[0]\r\nl={}\r\nl[0]=1\r\n\r\nwhile s:\r\n\tx=s.pop()\r\n\tfor j in gr[x]:\r\n\t\tl[j]=l[x]+1\r\n\t\tif j<n:\r\n\t\t\ts.append(j)\r\nprint(max(l.values()))", "n=int(input())\r\nd={\"POLYCARP\":0}\r\nfor i in range(n):\r\n s=input()\r\n f=0\r\n r1=\"\"\r\n r2=\"\"\r\n for j in range(len(s)):\r\n if f==0:\r\n if s[j]!=\" \":\r\n r1+=s[j]\r\n else:\r\n f+=1\r\n elif f==1 and s[j]==\" \":\r\n f+=1\r\n elif f==2:\r\n r2+=s[j]\r\n r1=r1.upper()\r\n r2=r2.upper()\r\n d[r1]=d[r2]+1\r\nprint(max(d.values())+1)", "from posixpath import split\r\n\r\n\r\nn = int(input())\r\nanswer = 0\r\nposts = {\"polycarp\": 0}\r\nfor _ in range(n):\r\n poster, _, post_from = input().split()\r\n poster = poster.lower()\r\n post_from = post_from.lower()\r\n posts[poster] = distance = posts[post_from] + 1\r\n if distance > answer:\r\n answer = distance\r\n\r\n\r\nprint(1 + answer)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Apr 27 18:07:21 2016\r\n\r\n@author: Alex\r\n\"\"\"\r\n \r\nn = int(input())\r\ndepth = dict()\r\ndepth['polycarp']=1\r\nans = 1\r\nfor i in range(n):\r\n a,_,b = input().split()\r\n d = depth[a.lower()]=depth[b.lower()]+1\r\n ans = max(d,ans)\r\nprint(ans)\r\n \r\n", "n = int(input())\nqoshnilar = {}\n\nfor i in range(n):\n s = input().split()\n yozgan = s[0].lower()\n qabulqilgan = s[2].lower()\n if not qabulqilgan in qoshnilar.keys():\n qoshnilar[qabulqilgan] = []\n qoshnilar[qabulqilgan].append(yozgan)\n\nmax1 = 0\ndef koribchiq(ism, balandlik):\n global max1\n max1 = max(max1, balandlik)\n if ism in qoshnilar.keys():\n for qoshni in qoshnilar[ism]:\n koribchiq(qoshni, balandlik + 1)\nkoribchiq('polycarp', 0)\nprint(max1 + 1)\n \n", "# http://codeforces.com/contest/522/problem/A\n\nimport sys\nfrom collections import defaultdict\n\n\nmax_depth = 0\n\n\ndef dfs(vertex, vertices, depth):\n global max_depth\n\n neighbours = vertices[vertex]\n if not neighbours:\n if max_depth < depth:\n max_depth = depth\n return\n\n depth += 1\n for neighbour in neighbours:\n dfs(neighbour, vertices, depth)\n\n\ndef main():\n global max_depth\n\n vertices = defaultdict(list)\n reader = (tuple(line.split()) for line in sys.stdin)\n next(reader)\n for neighbor, _, vertex in reader:\n neighbor = neighbor.lower()\n vertex = vertex.lower()\n vertices[vertex].append(neighbor)\n\n # for vertex, neighbors in vertices.items():\n # print(vertex, neighbors)\n\n root = 'polycarp'\n dfs(root, vertices, depth=1)\n\n print(max_depth)\n\n\nif __name__ == \"__main__\":\n main()", "d = {}\r\nf = [i for i in range(501)]\r\nc = 1\r\nfor _ in range(int(input())):\r\n # n,m,k=map(int,input().split())\r\n # l = [int(x) for x in input().split()]\r\n a,temp,b = input().split()\r\n a = a.lower()\r\n b = b.lower()\r\n if a not in d:\r\n d[a] = c\r\n c+=1\r\n if b not in d:\r\n d[b] = c\r\n c+=1\r\n x = d[a]\r\n y = d[b]\r\n f[x] = y\r\ni = 1\r\nfans = 0\r\nwhile(i<=500):\r\n ans = 1\r\n j = i\r\n while(j!=f[j]):\r\n j = f[j]\r\n ans +=1\r\n fans = max(ans,fans)\r\n i+=1\r\nprint(fans)", "def du(s):\r\n ans=0\r\n for n in s.keys():\r\n temp=0\r\n x=n\r\n while(True):\r\n temp+=1\r\n nxt=d[x]\r\n if(nxt in d.keys()):\r\n x=nxt\r\n else:\r\n break\r\n ans=max(ans,temp)\r\n return ans+1\r\n\r\n \r\n\r\n\r\nd={}\r\nfor _ in range(int(input())):\r\n s=input().split(' ')\r\n d[s[0].lower()]=s[2].lower()\r\n\r\nprint(du(d))\r\n\r\n", "n = int(input())\nd={}\nc={}\nmsf=1\nfor _ in range(n):\n n1,_,n2 = input().upper().split()\n if n2 not in d:\n d[n2]=n1\n \n if n2 not in c:\n c[n2]=1\n\n if n1 not in c:\n c[n1] = c[n2]+1\n msf = max(msf,c[n1])\n\nprint(msf)\n\n\n\n", "g = {}\r\nn = int(input())\r\nstart = ''\r\npeople = set()\r\nwhile n:\r\n s = input().split()\r\n for i in range(3):\r\n s[i] = s[i].lower()\r\n if not start:\r\n start = s[-1]\r\n if s[-1] not in g:\r\n g[s[-1]] = [s[0]]\r\n else:\r\n g[s[-1]].append(s[0])\r\n people.add(s[0])\r\n people.add(s[-1])\r\n n = n - 1\r\nfor i in people:\r\n if i not in g:\r\n g[i] = []\r\nlevel = {}\r\nstack = [start]\r\nvisited = set([start])\r\nlevel[start] = 1\r\nwhile stack:\r\n curr = stack.pop()\r\n for i in g[curr]:\r\n if i not in visited:\r\n visited.add(i)\r\n stack.append(i)\r\n level[i] = level[curr] + 1\r\nprint(max(list(level.values())))", "n = int(input())\r\nmx_network = {\"polycarp\":1}\r\nmx = 2\r\nfor i in range(n):\r\n user,f_user = input().lower().split(\" reposted \")\r\n mx_network[user] = mx_network[f_user]+1\r\n mx = max(mx,mx_network[user])\r\nprint(mx)\r\n", "n = int(input())\r\nim = [input().split() for i in range(n)]\r\narr = [['polycarp']]\r\nfor i in range(n):\r\n s = [j.lower() for j in im[i]]\r\n s.pop(1)\r\n for j in range(len(arr)):\r\n if s[1] in arr[j]:\r\n if j < len(arr) - 1:\r\n arr[j + 1].append(s[0])\r\n else:\r\n arr.append([s[0]])\r\n break\r\nprint(len(arr))", "n = int(input())\r\ni = 0\r\nc = {}\r\nc['polycarp'] = 1\r\nwhile i < n:\r\n a = input()\r\n b = a.split()\r\n c[b[0].lower()] = c[b[2].lower()] + 1\r\n i += 1\r\nmax_ = 2\r\nfor i in c.keys():\r\n if c[i] > max_:\r\n max_ = c[i]\r\nprint (max_)", "import math\r\n\r\na=dict() \r\na[\"polycarp\"]=1 \r\nfor i in range(int(input())):\r\n q,w,e=input().split(\" \")\r\n q=q.lower()\r\n e=e.lower()\r\n if e in a:\r\n a[q]=a[e]+1\r\nprint(a[max(a,key=a.get)])", "def dfs(graph, node, visited):\r\n visited[node] = True\r\n Max = 0\r\n for child in graph[node]:\r\n print\r\n k = None\r\n if not visited[child]:\r\n k = 1+dfs(graph, child, visited)\r\n if k > Max:\r\n Max = k\r\n visited[node] = False\r\n return Max\r\n\r\nn = int(input())\r\n\r\nqueries = []\r\nfor i in range(n):\r\n queries.append(input())\r\n\r\nnames = dict()\r\nnames['polycarp'] = 0\r\ncount = 0\r\n\r\nfor query in queries:\r\n names_list = query.split(' ')\r\n if names_list[0].lower() not in names:\r\n count += 1\r\n names[names_list[0].lower()] = count\r\n if names_list[2].lower() not in names:\r\n count += 1\r\n names[names_list[2].lower()] = count\r\n\r\ngraph = []\r\nfor i in range(count+1):\r\n graph.append([])\r\n\r\nfor query in queries:\r\n names_list = query.split(' ')\r\n graph[names[names_list[2].lower()]].append(names[names_list[0].lower()])\r\n\r\nvisited = [False]*(count+1)\r\n\r\nprint(dfs(graph, 0, visited)+1)", "n=int(input())\r\ns1=[]\r\ns2=[]\r\nvisit=[0 for i in range(205)]\r\nans=0\r\ndef dfs(num,cnt):\r\n global ans\r\n if cnt>ans:\r\n ans=cnt\r\n for i in range(n):\r\n if visit[i]==1:\r\n continue\r\n if num==-1 or s1[i]==s2[num]:\r\n visit[i]=1\r\n dfs(i,cnt+1)\r\n visit[i]=0\r\nfor i in range(n):\r\n s=[j for j in input().split()]\r\n a=s[0]\r\n b=s[-1]\r\n if a.islower()==False:\r\n a=a.lower()\r\n if b.islower()==False:\r\n b=b.lower()\r\n s1.append(a)\r\n s2.append(b)\r\ndfs(-1,1)\r\nprint(ans)", "from collections import defaultdict\r\n\r\ndef giveMaxRepost(i, dp, graph):\r\n if dp.get(i) == None:\r\n temp = 0\r\n for j in graph[i]:\r\n temp = max(giveMaxRepost(j, dp, graph), temp)\r\n dp[i] = 1 + temp\r\n return dp[i]\r\n\r\nn = int(input())\r\ngraph = defaultdict(list)\r\ndp = {}\r\nfor i in range(n):\r\n t = input().split()\r\n graph[t[2].lower()].append(t[0].lower())\r\n\r\nprint(giveMaxRepost('polycarp', dp, graph))\r\n", "from sys import stdin\nfrom collections import Counter,defaultdict,deque\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport time\nimport copy\n\ngraph = {'polycarp':1}\nfor _ in range(int(input())):\n a, _ , b = input().lower().split()\n graph[a] = graph[b] + 1\nprint(max(graph.values()))\n\n", "from collections import Counter\r\nimport time\r\nn = int(input())\r\nmp = Counter()\r\nwhile n > 0 :\r\n n -= 1\r\n name1, reposted, name2 = map(str,input().split())\r\n name1 = name1.lower()\r\n name2 = name2.lower()\r\n mp[name1] = name2\r\nmx = 0\r\nfor i in mp :\r\n k = 1\r\n s = i\r\n while s != \"polycarp\" :\r\n k += 1\r\n s = mp[s]\r\n mx = max ( mx , k )\r\nprint ( mx )\r\n", "from math import *\r\n\r\nci = 1\r\nd = {'polycarp' : 0}\r\nn = int(input())\r\ng = {}\r\nfor i in range(n + 1):\r\n g[i] = []\r\n \r\nfor i in range(n):\r\n a, _, b = [i.lower() for i in input().split()] \r\n if a not in d:\r\n d[a] = ci\r\n ci += 1\r\n\r\n g[d[b]].append(d[a])\r\n\r\n\r\nde = [1]\r\n\r\ndef dfs(v, t):\r\n de[0] = max(de[0], t)\r\n for u in g[v]:\r\n dfs(u, t + 1)\r\n\r\n\r\ndfs(0, 1)\r\nprint(de[0])\r\n \r\n", "dict = {\"polycarp\" : 1}\r\nn = int(input())\r\nfor i in range(n):\r\n\tstrichka = input().lower().split(\" reposted \")\r\n\tdict[strichka[0]] = dict[strichka[1]] + 1\r\nprint(dict[max(dict, key=dict.get)])\r\n", "x=int(input())\r\nw={}\r\nw['polycarp']=1\r\na=[]\r\nfor i in range(x):\r\n\ty=input().split()\r\n\ty[0]=y[0].lower()\r\n\ty[2]=y[2].lower()\r\n\tw[y[0]]=w[y[2]]+1\r\n\ta.append(y[0])\r\nm=0\r\nfor i in a:\r\n\tif(w[i]>m):\r\n\t\tm=w[i]\r\nprint(m)", "n=int(input())\r\ndict_1={}\r\ndict_1={'polycarp':1}\r\nfor i in range(n):\r\n\ta,b,c=input().lower().split()\t\t\r\n\tdict_1[a]=dict_1[c]+1 \r\nprint(max(dict_1.values()))\r\n", "dict = {\"polycarp\": 1}\r\nn = int(input())\r\nfor i in range(n):\r\n\tlst = input().lower().split(\" reposted \")\r\n\tdict[lst[0]] = dict[lst[1]]\t+ 1\r\nmass = []\r\nfor i in dict:\r\n\tmass.append(dict[i])\r\nprint(max(mass))", "n = int(input())\r\ndi={\"POLYCARP\":None}\r\nfor i in range(n):\r\n st = input().upper()\r\n split = st.split()\r\n di[split[0]] = split[2]\r\nr = 0\r\nfor i in di:\r\n q = di[i]\r\n c = 1\r\n while q != None:\r\n q = di[q]\r\n c = c + 1\r\n r = max(r,c)\r\nprint(r)", "from queue import Queue\r\nfrom collections import defaultdict\r\n\r\n\r\ndef bfs(g, start):\r\n dists = {}\r\n q = Queue()\r\n q.put(start)\r\n dists[start] = 0\r\n while q.qsize():\r\n d = q.get()\r\n nextd = dists[d] + 1\r\n for i in g[d]:\r\n if i in dists:\r\n continue\r\n q.put(i)\r\n dists[i] = nextd\r\n return max(dists.values()) + 1\r\n\r\n\r\nd = defaultdict(list)\r\nn = int(input())\r\nfor i in range(n):\r\n a, sep, b = input().split()\r\n a, b = a.lower(), b.lower()\r\n d[b].append(a)\r\nprint(bfs(d, \"polycarp\"))\r\n", "n = int(input())\r\nans = 1\r\nl = {\"polycarp\": 1}\r\n\r\nfor _ in range(n):\r\n a, b, c = input().split()\r\n a = a.lower()\r\n c = c.lower()\r\n e = l.get(c, 0) + 1\r\n if e > ans:\r\n ans = e\r\n l[a] = e\r\n\r\nprint(ans)", "reposts = dict()\nreposts['polycarp'] = 1\nmax = 1\nfor i in range(int(input())):\n repost = input().lower().split(' ')\n reposts[repost[0]] = reposts[repost[2]] + 1\n if reposts[repost[0]] > max:\n max = reposts[repost[0]]\nprint(max)\n ", "n=int(input());\r\nh={\"polycarp\":1};c=2;\r\na=[[] for i in range(n+2)];\r\nd=[0]*(n+2);\r\n\r\nfor i in range(n):\r\n b=input().split();\r\n h[b[0].lower()]=c;\r\n a[h[b[2].lower()]].append(c);\r\n\r\n c+=1;\r\n\r\n\r\n\r\ndef bfs(i):\r\n d[i]=1;\r\n q=[i];\r\n while(len(q)):\r\n k=q.pop(0);\r\n for j in a[k]:\r\n if(not d[j]):\r\n d[j]=1+d[k];q.append(j);\r\n return max(d);\r\n\r\n\r\nprint(bfs(1));\r\n", "n = int(input())\r\nx = {'polycarp': 1}\r\nfor i in range(n):\r\n j,k,l=input().lower().split()\r\n x[j] = x[l] + 1\r\nprint(max(x.values()))", "\r\nn = int(input())\r\n\r\ng = {}\r\ndist = {}\r\nfor i in range(n):\r\n line = input().split()\r\n copier = line[0].lower()\r\n source = line[-1].lower()\r\n #print (copier + ' ' + source)\r\n dist[copier] = 0\r\n dist[source] = 0\r\n\r\n if source not in g:\r\n g[source] = []\r\n if copier not in g:\r\n g[copier] = []\r\n\r\n g[source].append(copier)\r\n\r\n\r\ndef dfs (name):\r\n for next in g[name]:\r\n if dist[next] < dist[name] + 1:\r\n dist[next] = dist[name] + 1\r\n dfs(next)\r\n\r\ndfs(\"polycarp\")\r\n\r\nans = 0\r\nfor val in dist.values():\r\n if (val > ans):\r\n ans = val\r\n\r\nprint (ans+1)", "id = {\"polycarp\" : 0}\r\nchain = [1]\r\nn = int(input())\r\nfor i in range(1,n+1):\r\n t1, t2 = map(str, input().split(\" reposted \"))\r\n id[t1.lower()] = i\r\n chain += [chain[id[t2.lower()]] + 1]\r\nprint(max(chain))\r\n", "n = int(input())\r\nans = 1\r\nreposts = {'polycarp': 1,}\r\nfor i in range(n):\r\n repost = [s.lower() for s in input().split(' reposted ')]\r\n reposts[repost[0]] = reposts[repost[1]] + 1\r\n if reposts[repost[0]] > ans:\r\n ans = reposts[repost[0]]\r\nprint(ans)", "def calc_height(tree: dict, user: str) -> int:\n if user not in tree:\n return 1\n\n else:\n maxh = 0\n for reposter in tree[user]:\n height = 1 + calc_height(tree, reposter)\n if height > maxh:\n maxh = height\n return maxh\n\n\nline = input()\nn = int(line)\n\nreposting = dict()\n\nfor _ in range(n):\n line = input()\n words = line.split(' ')\n publisher = str(words[2]).lower()\n reposter = str(words[0]).lower()\n\n if publisher not in reposting:\n reposting[publisher] = []\n\n reposting[publisher].append(reposter)\n\nprint(calc_height(reposting, 'polycarp'))", "from sys import stdin\r\nn = int(stdin.readline())\r\ncnt = {'POLYCARP': 1}\r\nans = 1\r\nfor i in range(n):\r\n name1, _, name2 = map(lambda s: s.strip().upper(), stdin.readline().split())\r\n cnt[name1] = cnt[name2] + 1\r\n ans = max(ans, cnt[name1])\r\nprint(ans)\r\n", "g = {'polycarp' : 1}\nfor _ in range(int(input())):\n\tn1, rp, n2 = input().split()\n\tn1 = n1.lower()\n\tn2 = n2.lower()\n\tg[n1] = g[n2] + 1\nmaxi = 0\nfor i in g.values():\n\tmaxi = max(maxi, i)\nprint(maxi)\n\t\t \t\t \t \t\t\t \t \t\t \t\t \t", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nd = {\"polycarp\":1}\nfor i in range(n):\n a, b, c = input().split()\n d[a.lower()] = d[c.lower()] + 1\nprint(max(d.values()))\n", "d = {'polycarp' : 1}\r\nfor i in range(int(input())):\r\n to, _, frm = input().lower().split()\r\n d[to] = d[frm] + 1\r\n\r\nprint(max(d.values()))", "import sys\r\n\r\n\r\ndef main() -> int:\r\n reader = (tuple(map(lambda _: _.lower(),line.split())) for line in sys.stdin)\r\n next(reader)\r\n reposts = {'polycarp': 1}\r\n for a, _, b in reader:\r\n reposts[a] = reposts[b] + 1\r\n print(max(reposts.values()))\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n raise SystemExit(main())\r\n", "n = int(input())\nd = dict()\nwhile n:\n n -= 1\n\n c, x, p = input().split()\n p = p.lower()\n c = c.lower()\n #print(p, c)\n if p not in d:\n d[p] = 1\n #print(p, d[p])\n d[c] = d[p] + 1\n #print(c, d[c])\n\nm = 1\nfor k in d:\n #print(k, d[k])\n m = max(m, d[k])\n\nprint(m)\n\n \t\t \t \t\t\t\t\t\t \t \t \t \t \t \t\t", "n = int(input())\ncnt = {'polycarp': 1}\nfor i in range(n):\n arr = input().split()\n name1 = arr[0].lower()\n name2 = arr[2].lower()\n cnt[name1] = cnt[name2]+1\nprint(max(cnt.values()))\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\na=int(input())\r\nm=1\r\nw={}\r\nw['polycarp']=1\r\nfor i in range(a):\r\n r,s,t=input().lower().split()\r\n w[r]=w[t]+1\r\n m=max(m,w[r])\r\nprint(m)\r\n", "popul = {'polycarp': 1}\r\nn = int(input())\r\nfor i in range(n) :\r\n a = input().split()\r\n popul[a[0].lower()] = popul[a[2].lower()] + 1 \r\nc = popul.values()\r\nprint(max(c))", "n = int(input())\r\npc = {}\r\npc['polycarp'] = -1\r\nfor i in range(n):\r\n b, _, a = input().split()\r\n pc[b.lower()] = a.lower()\r\n#print(pc)\r\n#print(list(pc.keys()))\r\nmaxdp = 0\r\nfor person in list(pc.keys()):\r\n depth = 0\r\n key = person[:]\r\n while True:\r\n depth += 1\r\n key = pc[key]\r\n if key not in pc:\r\n break\r\n if depth > maxdp:\r\n maxdp = depth\r\nprint(maxdp)\r\n\r\n'''\r\nPolycarp -> a -> i\r\n -> b -> d -> f\r\n -> e\r\n -> c -> g\r\n -> h\r\n -> j\r\n'''\r\n", "n = int(input())\r\nmaxlen = 1\r\nnodes = dict()\r\n\r\nnodes['polycarp'] = 1\r\n\r\nfor _ in range(n):\r\n a, _ , b = [s.lower() for s in input().split()]\r\n tmp = nodes.get(b) + 1\r\n nodes[a] = tmp\r\n maxlen = max(maxlen, tmp)\r\nprint(maxlen)", "from collections import deque\r\nfor _ in range(1):\r\n n = int(input())\r\n # parentList = list(map(int, input().split()))\r\n maxLevel = [0]*(n+1)\r\n d = {}\r\n a = 1\r\n for i in range( n):\r\n a, b = map(str, input().split(\" reposted \"))\r\n a = a.lower()\r\n b = b.lower()\r\n if a not in d:\r\n d[a] = []\r\n if b not in d:\r\n d[b] = []\r\n d[a].append(b)\r\n d[b].append(a)\r\n start = \"\"\r\n for i in d:\r\n \tif len(d[i]) == 1:\r\n \t\tstart = i\r\n \t\tbreak\r\n q = deque([\"polycarp\"])\r\n visited = set()\r\n c = 0\r\n while len(q)!=0:\r\n count = len(q)\r\n while count!=0:\r\n a = q.popleft()\r\n visited.add(a)\r\n # print(a, d)\r\n for child in d[a]:\r\n if child not in visited:\r\n q.append(child)\r\n count-=1\r\n c+=1\r\n print(c)\r\n ", "# input_file = open(\"input_A.txt\")\n# number = input_file.readline()\n\nn = int(input())\nlst = []\nfor line in range(n):\n i = input()\n i = i.strip()\n i = i.split()\n lst.append((i[0].lower(), i[2].lower()))\n#print(lst)\n\ndef main(lst):\n dct = {lst[0][1]: 1}\n for pair in lst:\n if pair[1] in dct:\n dct[pair[0]] = (dct[pair[1]] + 1)\n return max(dct.values())\n\nprint(main(lst))", "N = 300\r\nadj = [ [] for i in range(300) ]\r\nvisited = [0 for i in range(300) ]\r\n\r\ndef dfs(s):\r\n if visited[s]: return 0\r\n visited[s] = 1\r\n ans = 0\r\n for k in adj[s]:\r\n ans = max(ans,1+dfs(k))\r\n return ans\r\n\r\ndef main():\r\n n = int(input())\r\n d,cnt = {},0\r\n for i in range(n):\r\n a,b,c = [i.lower() for i in input().split()]\r\n if a not in d:\r\n d[a] = cnt\r\n cnt += 1\r\n if c not in d:\r\n d[c] = cnt\r\n cnt += 1\r\n adj[d[a]].append(d[c])\r\n adj[d[c]].append(d[a])\r\n\r\n ans = dfs(d['polycarp'])\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nrepo=[[\"Polycarp\".upper(),0]]\r\nfor i in range(n):\r\n s=input().split()\r\n reposter,feed=s[0].upper(),s[2].upper()\r\n for pair in repo:\r\n if feed==pair[0]:\r\n repo.append([reposter,pair[1]+1])\r\n break\r\nmaxd=0\r\nfor i in repo:\r\n if i[1]>=maxd:\r\n maxd=i[1]\r\nprint(maxd+1)\r\n", "from collections import defaultdict as dfl\r\n\r\ns=dfl(list)\r\n\r\nfor _ in range(int(input())):\r\n a,c,b=input().split()\r\n s[b.lower()].append(a.lower())\r\n\r\n\r\ndef find_ans(a):\r\n g=1\r\n p=0\r\n for i in s[a] :\r\n p=max(p,find_ans(i))\r\n \r\n g+=p\r\n return g\r\n\r\n\r\nprint(find_ans('polycarp'))\r\n\r\n\r\n\r\n", "\r\nn=int(input())\r\ntest={}\r\ntest['polycarp']=int(1)\r\nfor i in range(n):\r\n test1=input().split(\" \")\r\n name = test1[0].lower()\r\n repost = test1[2].lower()\r\n test[name]=int(test[repost])+1\r\nmax=-1\r\nfor i in test:\r\n if test[i]>max:\r\n max=test[i]\r\nprint(max)", "# import collections\r\n# from collections import defaultdict\r\n# from re import A, L\r\n# from re import A, I, L, M\r\nimport sys\r\nfrom sys import setrecursionlimit, stdin, stdout, stderr\r\n# from bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, deque, Counter\r\n# from itertools import accumulate, combinations, permutations, product\r\n# from functools import lru_cache, cmp_to_key, reduce\r\n# from heapq import heapify, heappush, heappop, heappushpop, heapreplace\r\n# import math\r\n# import copy\r\nimport os,io\r\nfrom io import BytesIO, IOBase\r\n# from tkinter import N\r\n# from unittest import TestResult\r\n# from traceback import print_list\r\n\r\n# list(map(int,input().split()))\r\n# s = input().strip()\r\n# n = int(input())\r\n# @lru_cache(maxsize=100000) \r\n\r\nfrom math import sqrt\r\n\r\n \r\ndef isprime(x):\r\n i = 2\r\n if x <= 3:\r\n return 1\r\n if x % 2 == 0:\r\n return 0\r\n i += 1\r\n while i * i <= x:\r\n if x % i == 0:\r\n return 0\r\n i += 2\r\n return 1\r\n\r\n# from itertools import combinations\r\n \r\ndef countbits(x):\r\n c = 0\r\n while x:\r\n if x & 1: c += 1\r\n x >>= 1\r\n return c\r\n\r\n##############################################\r\n##############################################\r\n############ Code starts here ################\r\n############################################## \r\n\r\n\r\n\r\n#### BINARY SEARCH ### DP #### MATH ##########\r\n \r\nimport copy\r\n\r\n \r\n# n = (2 * (10 ** 5)) + 5\r\n# parent = [i for i in range(n)]\r\n# size = [1 for i in range(n)]\r\n \r\n \r\n# def find(root):\r\n# a = root\r\n# while parent[a] != a:\r\n# a = parent[a]\r\n# while root != a:\r\n# nextnode = parent[root]\r\n# parent[root] = a\r\n# root = nextnode\r\n# return a\r\n \r\n \r\n# def union(a, b):\r\n# a = find(a)\r\n# b = find(b)\r\n# if a != b:\r\n# if size[a] < size[b]:\r\n# a, b = b, a\r\n# parent[b] = a\r\n# size[a] += size[b]\r\n# return True\r\n# return False \r\n\r\n \r\n\r\n \r\n \r\n# @bootstrap\r\n \r\n \r\ndef main():\r\n # list(map(int,input().split()))\r\n # s = input().strip()\r\n # t=int(input())\r\n # hash={i:2**i for i in range(32)}\r\n # for _ in range(t):\r\n # N=int(input())\r\n \r\n # from math import gcd\r\n # t=int(input())\r\n # hash={i:2**i for i in range(32)}\r\n import math\r\n \r\n # for case in range(int(input())):\r\n # n, m,k,q = map(int,input().split())\r\n # n, m, k, q = mp(int)\r\n dic={}\r\n j='A'\r\n arr=[chr(ord(j)+i) for i in range(26)]\r\n m='a'\r\n arr1=[chr(ord(m)+i) for i in range(26)]\r\n \r\n for i in range(len(arr)):\r\n dic[arr[i]]=arr1[i]\r\n dic[arr1[i]]=arr1[i] \r\n for i in range(10):\r\n dic[str(i)]=str(i)\r\n \r\n n=int(input())\r\n hash=defaultdict(list)\r\n for i in range(n):\r\n \r\n s=input().split(' ')\r\n s1=''\r\n for i in s[0]:\r\n \r\n s1+=dic[i]\r\n s2=''\r\n for i in s[2]:\r\n \r\n s2+=dic[i]\r\n hash[s2].append(s1)\r\n \r\n deq=deque(['polycarp'])\r\n step=0\r\n # print(hash)\r\n while deq:\r\n step+=1\r\n for j in range(len(deq)):\r\n a=deq.popleft()\r\n \r\n for key in hash[a]:\r\n # print(key)\r\n deq.append(key)\r\n print(step)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n# Fast input\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\n# input = sys.stdin.readline\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n \r\n# def bootstrap(f, stack=[]):\r\n# from types import GeneratorType\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# @bootstrap", "n = int(input())\r\n\r\nd = { 'polycarp' : 1}\r\nans = 1\r\n\r\nfor i in range(n):\r\n a = input().split()\r\n s = a[0].lower()\r\n d[s] = d[a[2].lower()] + 1\r\n ans = max(ans, d[s])\r\n\r\nprint(ans)", "n = int(input())\n\nd = {\"POLYCARP\" : 1}\n\nfor i in range(n):\n s = input().split()\n a = s[0].upper()\n b = s[2].upper()\n d[a] = d[b] + 1\n\nprint(max(d.values()))\n\n", "n=int(input())\nd={}\nd['polycarp']=1\nmax=1\nfor i in range(n):\n\ta,b,c=[x.lower() for x in input().split()]\n\td[a]=d[c]+1\n\tif d[a]>max:\n\t\tmax=d[a]\nprint(max)\n", "n = int(input())\r\nreposters, maxDeep = {'polycarp':1}, 1\r\nfor i in range(n):\r\n\ta, b, c = map(str, input().lower().split())\r\n\tmaxDeep = max(maxDeep, reposters[c] + 1)\r\n\treposters[a] = reposters[c] + 1\r\nprint(maxDeep)", "n = int(input())\r\na = {'polycarp': 1}\r\nfor i in range(n):\r\n s = list(input().split())\r\n a[s[0].lower()] = a[s[2].lower()] + 1\r\nd = a.values()\r\nprint(max(d))\r\n\r\n", "n = int(input())\r\nmp = {'polycarp': 1}\r\nans = 1\r\nfor _ in range(n):\r\n name1, _, name2 = input().lower().split()\r\n h = mp[name2] + 1\r\n ans = max(h, ans)\r\n mp[name1] = h\r\n\r\nprint(ans)\r\n", "import sys\nsys.setrecursionlimit(2500)\n\nn = int(input())\ng = {}\n\nfor i in range(n):\n rep = input().lower().split(\" reposted \")\n if rep[0] not in g:\n g[rep[0]] = []\n if rep[1] in g:\n g[rep[1]].append(rep[0])\n else:\n g[rep[1]] = [rep[0]]\n\ndef dfs(v):\n add = 0\n for i in g[v]:\n add = max(add, dfs(i))\n return add + 1\n\nprint(dfs(\"polycarp\"))", "a=int(input())\r\nl=[[] for i in range(a+1)]\r\nt=[0]*(a+1)\r\nl[0]='polycarp'\r\nt[0]=1\r\nfor i in range(a):\r\n b,c,d=input().split()\r\n b=b.lower()\r\n d=d.lower()\r\n l[i+1]=b\r\n o=l.index(d)\r\n t[i+1]=t[o]+1\r\nprint(max(t))", "n=int(input())\r\ndp={'polycarp':1}\r\nwhile n:\r\n n-=1\r\n a,tmp,c=input().split()\r\n dp[a.lower()]=dp[c.lower()]+1\r\nprint(max(dp.values()))\r\n", "from collections import defaultdict\r\nn = int(input())\r\ng = defaultdict(list)\r\nstartingPoint = None\r\ndp = defaultdict(str)\r\n\r\ng[\"\"] = \"\"\r\nmaxi = [0]\r\n\r\ndef dfs(ele, par):\r\n\t# print(ele)\r\n\tdp[ele] = 1\r\n\tzero = 0\r\n\tfor e in g[ele]:\r\n\t\tif e == par:\r\n\t\t\tcontinue\r\n\t\tdfs(e, ele)\r\n\t\tzero = max(zero, dp[e])\r\n\tdp[ele] += zero\r\n\tmaxi[0] = max(maxi[0], dp[ele])\r\n\r\nfor i in range(n):\r\n\trepost = list(input().split())\r\n\trepost[0] = repost[0].lower()\r\n\trepost[-1] = repost[-1].lower()\r\n\tg[repost[0]].append(repost[-1])\r\n\tg[repost[-1]].append(repost[0])\r\n\r\n\tif i == 0:\r\n\t\tstartingPoint = repost[-1]\r\n\r\ndfs(startingPoint, \"\")\r\n# print(dp)\r\nprint(maxi[0])\r\n\r\n", "from collections import defaultdict, deque\r\n\r\nn = int(input())\r\ngraph = defaultdict(list)\r\nfor i in range(n):\r\n u, v = input().split(' reposted ')\r\n u, v = u.lower(), v.lower()\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nvis = set()\r\ndist = dict()\r\nq = deque()\r\ndist['polycarp'] = 1\r\nq.append('polycarp')\r\nwhile q:\r\n u = q.popleft()\r\n vis.add(u)\r\n for v in graph[u]:\r\n if v not in vis:\r\n dist[v] = 1 + dist[u]\r\n q.append(v)\r\n vis.add(v)\r\nprint(max(dist.values()))", "import sys;readline = sys.stdin.readline\r\ndef i1(): return int(readline())\r\ndef nl(): return [int(s) for s in readline().split()]\r\ndef nn(n): return [int(readline()) for i in range(n)]\r\ndef nnp(n,x): return [int(readline())+x for i in range(n)]\r\ndef nmp(n,x): return (int(readline())+x for i in range(n))\r\ndef nlp(x): return [int(s)+x for s in readline().split()]\r\ndef nll(n): return [[int(s) for s in readline().split()] for i in range(n)]\r\ndef mll(n): return ([int(s) for s in readline().split()] for i in range(n))\r\ndef s1(): return readline().rstrip()\r\ndef sl(): return [s for s in readline().split()]\r\ndef sn(n): return [readline().rstrip() for i in range(n)]\r\ndef sm(n): return (readline().rstrip() for i in range(n))\r\ndef redir(s): global readline;import os;fn=sys.argv[0] + f'/../in-{s}.txt';readline = open(fn).readline if os.path.exists(fn) else readline\r\n\r\nredir('a')\r\nn = i1()\r\ndepth = {'polycarp':1}\r\nfor _ in range(n):\r\n i,_,p = readline().split()\r\n depth[i.lower()] = depth[p.lower()] + 1\r\nprint(max(depth.values()))\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef in_int():\r\n '''\r\n Read input string as int\r\n '''\r\n return (int(input()))\r\n\r\ndef in_int_space():\r\n '''\r\n Read space separated numbers as list of int\r\n '''\r\n return (list(map(int,input().split())))\r\n\r\ndef in_int_line(n):\r\n '''\r\n Read line separated input as list of int\r\n '''\r\n list = []\r\n for i in range(n):\r\n s = input()\r\n list.append(int(s[:len(s)-1]))\r\n return list\r\n\r\ndef in_str():\r\n '''Read string'''\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\ndef in_str_arr():\r\n '''\r\n Read String as Char array\r\n '''\r\n s = input()\r\n return (list(s[:len(s)-1]))\r\n\r\ndef in_str_space():\r\n return input().split()\r\n\r\ndef in_str_line(n):\r\n list = []\r\n for i in range(n):\r\n s = input()\r\n list.append(s[:len(s)-1])\r\n return list\r\n\r\n\r\n \r\ndef main():\r\n def dfs(node):\r\n if len(graph[node]) == 0:\r\n return 1 \r\n res = 1\r\n for adj in graph[node]: \r\n res = max(dfs(adj) + 1, res) \r\n #print(res)\r\n return res \r\n \r\n n = in_int()\r\n graph = defaultdict(list) \r\n for _ in range(n): \r\n u,_,v = in_str_space()\r\n graph[v.lower()].append(u.lower()) \r\n\r\n #print(graph)\r\n\r\n return dfs(\"polycarp\")\r\n\r\nlongest = main()\r\nprint(longest)", "n = int(input())\na = dict()\na['polycarp'] = 1\nfor i in range(n):\n\ts = input().split()\n\ts[0] = s[0].lower()\n\ts[2] = s[2].lower()\n\ta[s[0]] = a[s[2]] + 1\n\n\nmax = 0\nmaxi = 'polycarp'\nfor i in a:\n\tif a[i] > max:\n\t\tmaxi = i\n\t\tmax = a[i]\n\n#print(maxi)\nprint(max)\n\t\n", "from collections import defaultdict\r\ngraph = defaultdict(list)\r\nn = int(input())\r\nd = {}\r\ncnt = 0\r\nfor _ in range(n):\r\n u,v = list(map(str,input().split('reposted')))\r\n u = u.lower().lstrip().rstrip()\r\n v = v.lower().lstrip().rstrip()\r\n if u not in d:\r\n d[u] = cnt\r\n cnt+=1\r\n if v not in d:\r\n d[v] = cnt\r\n cnt+=1\r\n if d[v] in graph:\r\n graph[d[v]].append(d[u])\r\n else:\r\n graph[d[v]] = [d[u]]\r\nx = 'polycarp'\r\ny = d[x]\r\nq = [(y,1)]\r\nvisited = [False for i in range(len(d))]\r\nvisited[y] = True\r\nans = 0\r\nwhile q!=[]:\r\n parent,val = q[0]\r\n q.pop(0)\r\n ans = max(ans,val)\r\n for i in graph[parent]:\r\n if visited[i]==False:\r\n visited[i] = True\r\n q.append((i,val+1))\r\nprint(ans)", "n = int(input())\r\n\r\ns = {'polycarp': 0}\r\nans = 0\r\nfor i in range(n):\r\n name1, reposted, name2 = map(str.lower, input().split())\r\n\r\n s[name1] = s[name2] + 1\r\n if s[name2] + 1 > ans:\r\n ans = s[name2] + 1\r\n\r\nprint(ans + 1)\r\n\r\n\r\n\r\n", "def Solve(graph,parents,hts):\r\n name = 'polycarp'\r\n stack = [name]\r\n while stack:\r\n curr = stack.pop()\r\n if curr in parents.keys():\r\n hts[curr] = hts[parents[curr]]+1\r\n else:\r\n hts[curr] = 0\r\n if curr in graph.keys():\r\n for kid in graph[curr]:\r\n stack.append(kid)\r\n\r\n hts1 = []\r\n for i in hts:\r\n hts1.append(hts[i])\r\n\r\n return max(hts1)+1\r\n \r\n\r\ndef main():\r\n n = int(input())\r\n graph = {}\r\n parents = {}\r\n hts = {}\r\n for i in range(n):\r\n names = list(map(str,input().split()))\r\n name1 = names[0]\r\n name2 = names[2]\r\n \r\n name1 = name1.lower()\r\n name2 = name2.lower()\r\n\r\n parents[name1] = name2\r\n hts[name1] = -1\r\n hts[name1] = -1\r\n\r\n if name2 not in graph.keys():\r\n graph[name2] = [name1]\r\n else:\r\n graph[name2].append(name1)\r\n\r\n \r\n print (Solve(graph,parents,hts))\r\n\r\nmain()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nfrom collections import defaultdict \r\n\r\n\r\nclass Graph: \r\n\r\n def __init__(self): \r\n self.graph = defaultdict(list) \r\n\r\n def addEdge(self,u,v): \r\n self.graph[u].append(v) \r\n \r\n def BFS(self, s): \r\n visited = [False] * (201) \r\n #print(visited)\r\n dist=[0]*(201)\r\n queue = [] \r\n queue.append(s) \r\n visited[s] = True\r\n dist[s]=0\r\n while queue: \r\n s = queue.pop(0) \r\n #print (s, end = \" \") \r\n for i in self.graph[s]: \r\n if visited[i] == False: \r\n queue.append(i) \r\n visited[i] = True\r\n dist[i]=dist[s]+1\r\n #print(dist[i])\r\n return max(dist)+1\r\nn=int(input())\r\ndic=dict()\r\nind=0\r\ng = Graph() \r\nwhile n>0:\r\n x=input()\r\n s=x.split()\r\n if s[2].lower() not in dic.keys():\r\n dic[s[2].lower()]=ind\r\n ind=ind+1\r\n if s[0].lower() not in dic.keys():\r\n dic[s[0].lower()]=ind\r\n ind=ind+1\r\n g.addEdge(dic[s[2].lower()],dic[s[0].lower()])\r\n n=n-1\r\n#print(dic)\r\nprint(g.BFS(0))\r\n\r\n ", "d = {\"polycarp\" : 1}\n \nfor _ in range(int(input())):\n s = input().lower().split(' ')\n d[s[0]] = d[s[2]] + 1\nprint(max(d.values()))\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\nk = []\r\nfor i in range(n):\r\n t = input().split(' ')\r\n k.append([t[0].lower(), t[2].lower()])\r\nd = [['polycarp']]\r\nfor i in k:\r\n for j in range(len(d)):\r\n if i[1] in d[j]:\r\n if j == len(d)-1:\r\n d.append([i[0]])\r\n else:\r\n d[j+1].append(i[0])\r\n break\r\nprint(len(d))\r\n", "def main():\r\n x = int(input())\r\n d = dict()\r\n d['polycarp'] = 1\r\n a = []\r\n for i in range(x):\r\n f = input().split()\r\n f1 = f[0].lower()\r\n f2 = f[2].lower()\r\n d[f1] = d[f2] + 1\r\n a.append(f1)\r\n rez = 0\r\n for i in a:\r\n if rez<d[i]:\r\n rez = d[i]\r\n print(rez)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "from queue import Queue\r\ng = dict()\r\nfor _ in range(int(input())):\r\n v, _, u = map(lambda x: x.lower(), input().split())\r\n if u not in g:\r\n g[u] = list()\r\n g[u].append(v)\r\nq = Queue()\r\nq.put((\"polycarp\", 1))\r\nr = 0\r\nwhile not q.empty():\r\n u, w = q.get()\r\n r = max(r, w)\r\n for v in g.get(u, []):\r\n q.put((v, w + 1))\r\nprint(r)\r\n", "from sys import stdin, stdout, setrecursionlimit\r\nimport threading\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, recursion_limit, stack_size):\r\n setrecursionlimit(recursion_limit)\r\n threading.stack_size(stack_size)\r\n return None\r\n \r\nclass SOLVE:\r\n def dfs(self, u, node, dis):\r\n depth = 1\r\n for v in node[u]:\r\n if (v in node) and (v not in dis):\r\n dis[v] = self.dfs(v, node, dis) + 1\r\n depth = max(depth, dis[v])\r\n \r\n dis[u] = depth\r\n return dis[u]\r\n \r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n node = {}\r\n for i in range(int(R())):\r\n u, c, v = R().split()\r\n u, v = u.lower(), v.lower()\r\n \r\n if u not in node:\r\n node[u] = []\r\n node[u].append(v)\r\n \r\n if v not in node:\r\n node[v] = []\r\n \r\n mx = 2\r\n for u in node:\r\n dis = {u : 0}\r\n mx = max(mx, self.dfs(u, node, dis))\r\n \r\n W('%d\\n' % mx)\r\n \r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\nTail_Recursion_Optimization(10**5, 2**20)\r\nthreading.Thread(target=main).start()", "n = int(input()) #кол репостов\r\nnameP = \"polycarp\"\r\ncount = 2\r\nnames = {}\r\nname1, name2 = input().lower().split(\" reposted \") # name1 and name2 == \"polycarp\"\r\nnames[name1] = count #цепочка оборвалась на этом имени\r\nfor i in range(n - 1):\r\n name1, name2 = input().lower().split(\" reposted \")\r\n if name2 == nameP:\r\n names[name1] = count\r\n elif name2 in names:\r\n names[name1] = names[name2] + 1\r\nfor key in names:\r\n if count < names[key]:\r\n count = names[key]\r\nprint(count)", "import math\r\nfrom collections import deque, defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n# print = stdout.write\r\nlistin = lambda : list(map(int, input().split()))\r\nmapin = lambda : map(int, input().split())\r\nn = int(input())\r\nd = defaultdict(int)\r\nd[\"polycarp\"] = 1\r\nans = 1\r\nfor i in range(n):\r\n name1, rep, name2 = input().split()\r\n name1 = name1.lower()\r\n name2 = name2.lower()\r\n d[name1] = d[name2]+1\r\n ans = max(ans, d[name1])\r\nprint(ans)", "n = int(input())\nd = {}\nfor i in range(n):\n\tl = [a.lower() for a in input().split()]\n\tif l[2] in d:\n\t\td[l[2]].append(l[0])\n\telse:\n\t\td[l[2]] = [l[0]]\ndist = {}\nvis = {}\ndef dfs(b):\n\tvis[b] = True\n\tif b in d:\n\t\tfor i in d[b]:\n\t\t\tval = vis.get(i,False)\n\t\t\tif not val:\n\t\t\t\tdist[i] = dist[b]+1\n\t\t\t\tdfs(i)\ndist[\"polycarp\"] = 1\ndfs(\"polycarp\")\nprint(max(dist.values()))\n\t\t\n", "import sys\r\n\r\ninfile = sys.stdin\r\noutfile = sys.stdout\r\n\r\ndef main():\r\n n = int(infile.readline())\r\n\r\n graf = dict()\r\n graf[\"polycarp\"] = 1\r\n answer = 1\r\n \r\n for i in range(n):\r\n reposter, buff, poster =[st.lower() for st in infile.readline().split()]\r\n graf[reposter] = graf[poster] + 1\r\n answer = max(answer, graf[reposter])\r\n\r\n outfile.write(str(answer))\r\n \r\n \r\nmain()\r\n", "n=int(input())\r\ne={}\r\nfor i in range(n):\r\n u,v=map(str,input().split(' reposted '))\r\n try:\r\n e[v.lower()].append(u.lower())\r\n except:\r\n e[v.lower()]=[u.lower()]\r\n\r\n\r\n#a=list(map(int,input().split(' ')))\r\n\r\ndp={}\r\ndef dfs(x,par):\r\n maxx=0\r\n dp[x]=1\r\n # print(e[x.lower()])\r\n try:\r\n for i in range(len(e[x])):\r\n dfs(e[x][i].lower(),x)\r\n # print(dp[e[x][i].lower()])\r\n maxx=max(maxx,dp[e[x][i].lower()])\r\n except:\r\n pass\r\n dp[x]+=maxx\r\n\r\n\r\n\r\ndfs(\"Polycarp\".lower(),0)\r\n#print(e)\r\nprint(dp[\"Polycarp\".lower()])", "#author: sushmanth\r\n\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\ninp = lambda : list(map(int,input().split()))\r\n\r\nfrom collections import deque\r\n\r\ndef answer():\r\n\r\n q = deque([])\r\n for x in take:\r\n if(indeg.get(x , 0)):continue\r\n q.append([x , 1])\r\n\r\n\r\n ans = 1\r\n while(len(q)):\r\n u , length = q.popleft()\r\n ans = max(ans , length)\r\n for v in adj.get(u , []):\r\n q.append([v , length + 1])\r\n\r\n\r\n return ans\r\n\r\n\r\nfor T in range(1):\r\n\r\n n = int(input())\r\n\r\n take = set()\r\n adj , indeg = dict() , dict()\r\n for i in range(n):\r\n st = input().split()\r\n st[0] = st[0].lower()\r\n st[2] = st[2].lower()\r\n\r\n if(st[2] not in adj):\r\n adj[st[2]] = []\r\n\r\n adj[st[2]].append(st[0])\r\n indeg[st[0]] = indeg.get(st[0] , 0) + 1\r\n take.add(st[2])\r\n\r\n\r\n print(answer())\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n", "lis = {}\r\nlis['polycarp']=1\r\n\r\nfor i in range(int(input())):\r\n name1,post,name2 = map(str,input().split())\r\n lis[name1.lower()] = lis[name2.lower()]+1\r\n\r\nprint(max(lis.values()))\r\n ", "PeopleN = int(input())\n\nnameD = {}\nfor k in range(0, PeopleN):\n nameL = input().split()\n if (k == 0):\n nameD[nameL[2].upper()] = 1\n nameD[nameL[0].upper()] = nameD[nameL[2].upper()] + 1\n \ntheN = list(nameD.values())\ntheN.sort()\nprint(theN.pop())\n\t \t\t \t \t\t\t\t\t\t \t \t\t \t\t \t\t", "from collections import defaultdict\r\ndef dfs(graph,vis,start,ans,arr):\r\n vis[start]=True\r\n if len(graph[start])==1 and start!='POLYCARP':\r\n ans[start]=1\r\n return 1\r\n for neighbour in graph[start]:\r\n if vis[neighbour]==False:\r\n arr[start]=max(arr[start],1+dfs(graph,vis,neighbour,ans,arr))\r\n ans[start]=arr[start]\r\n return ans[start]\r\nn=int(input())\r\ngraph=defaultdict(list)\r\nfor i in range(n):\r\n name1,x,name2=map(str,input().split())\r\n name1=name1.upper()\r\n name2=name2.upper()\r\n graph[name1].append(name2)\r\n graph[name2].append(name1)\r\nvisited={}\r\nans={}\r\narr={}\r\nfor i in graph:\r\n visited[i]=False\r\n ans[i]=0\r\n arr[i]=0\r\ndfs(graph,visited,'POLYCARP',ans,arr)\r\nmaxi=0\r\nfor i in ans:\r\n maxi=max(maxi,ans[i])\r\nprint(maxi)", "n=int(input())\nans={'polycarp': 1}\nfor _ in range(n):\n a,b,c=input().lower().split(' ');\n ans[a]=ans[c] + 1\n#print(ans)\nprint(max(ans.values()))\n\n\n \n \t \t\t\t \t\t\t\t\t \t \t \t\t", "from collections import deque\r\n\r\nn = int(input())\r\nq = deque()\r\nq.append(\"polycarp\")\r\n\r\nval = {\"polycarp\":1}\r\ntree = {\"polycarp\":[]}\r\nfor i in range(n):\r\n a,b,c = input().split()\r\n a = a.lower()\r\n c = c.lower()\r\n val[a] = 1\r\n tree[a] = []\r\n tree[c].append(a)\r\n\r\nwhile q:\r\n node = q.popleft()\r\n for i in tree[node]:\r\n val[i] = val[node]+1\r\n q.append(i)\r\n\r\nprint(val[node])\r\n", "n=int(input())\r\ngraph={'POLYCARP':[]}\r\nfor i in range(n):\r\n s=input()\r\n s1=s[:s.find(' ')].upper()\r\n s2=s[s.rfind(' ')+1:].upper()\r\n if s2 not in graph.keys():\r\n graph[s2]=[s1]\r\n else:\r\n graph[s2]+=[s1]\r\nmax=1\r\ndef next(x,l):\r\n global max\r\n if x in graph.keys():\r\n for item in graph[x]:\r\n next(item,l+1)\r\n else:\r\n if l>max:\r\n max=l\r\nnext('POLYCARP',1)\r\nprint(max)\r\n \r\n \r\n", "'''\r\n@sksshivam007 - Template 1.0\r\n'''\r\nimport sys, re, math\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians\r\nfrom queue import Queue\r\nfrom heapq import heappush, heappop, heapify, nlargest, nsmallest\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef sortListWithIndex(listOfTuples, idx): return (sorted(listOfTuples, key=lambda x: x[idx]))\r\ndef sortDictWithVal(passedDic):\r\n temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))[::-1]\r\n toret = {}\r\n for tup in temp:\r\n toret[tup[0]] = tup[1]\r\n return toret\r\ndef sortDictWithKey(passedDic):\r\n return dict(OrderedDict(sorted(passedDic.items())))\r\n\r\nINF = float('inf')\r\nmod = 10 ** 9 + 7\r\n\r\nif __name__ == \"__main__\":\r\n def bfs(graph):\r\n used = defaultdict(bool)\r\n\r\n used['polycarp'] = True\r\n\r\n q = deque([('polycarp', 1)])\r\n\r\n while(len(q)>0):\r\n popped = q.popleft()\r\n v = popped[0]\r\n dis = popped[1]\r\n\r\n if(len(graph[v])==1 and v!='polycarp'):\r\n lengths.append(dis)\r\n\r\n for w in graph[v]:\r\n if not used[w]:\r\n used[w] = True\r\n q.append((w, dis+1))\r\n\r\n\r\n n = INT()\r\n\r\n graph = defaultdict(set)\r\n\r\n for _ in range(n):\r\n s1,s2,s3 = input().split(' ')\r\n s1 = s1.lower()\r\n s3 = s3.lower()\r\n\r\n graph[s1].add(s3)\r\n graph[s3].add(s1)\r\n\r\n lengths = [1]\r\n\r\n bfs(graph)\r\n\r\n print(max(lengths))", "d = {'polycarp' : 1}\r\nfor i in range(int(input())):\r\n a, b, c = input().lower().split()\r\n d[a] = d[c]+1\r\n \r\nprint(max(d.values()))", "def height(g, start, f):\r\n m=0\r\n for i in g[start]:\r\n if f[i]==0:\r\n f[i]=1\r\n m=max(m,height(g,i,f))\r\n return m+1\r\n\r\nfrom collections import defaultdict as dc\r\nn=int(input())\r\ng=dc(list)\r\nf=dc(int)\r\nfor i in range(n):\r\n s=input().lower().split(' ')\r\n s=list(s)\r\n #print(s)\r\n g[s[-1]].append(s[0])\r\n f[s[0]]=0\r\n f[s[-1]]=0\r\nh=0\r\n#print(g)\r\n#print(f)\r\nstart=\"polycarp\"\r\nf[start]=1\r\nprint(height(g, start, f))", "\r\n\r\n\r\n \r\nd={}\r\nn=int(input())\r\np=[]\r\nfor i in range(n):\r\n a=list(input().split())\r\n p.append(a)\r\n \r\nfor i in range(len(p)):\r\n if(p[i][-1].lower() in d):\r\n d[p[i][-1].lower()]+=[p[i][0].lower()]\r\n else:\r\n d[p[i][-1].lower()]=[p[i][0].lower()]\r\n\r\ndef dfs(u):\r\n if u not in d.keys():\r\n return 1\r\n mx=0\r\n for i in d[u]:\r\n mx=max(mx,dfs(i)+1)\r\n return mx\r\nprint(dfs('polycarp'))\r\n \r\n\r\n ", "n = int(input())\r\na = [input() for _ in range(n)]\r\n\r\na = {i.split()[0].lower(): i.split()[2].lower() for i in a}\r\n\r\ndef solve(k) -> int:\r\n if k not in a.keys():\r\n return 1\r\n\r\n return solve(a[k]) + 1\r\n\r\n\r\nprint(max([solve(i) for i in a.keys()]))\r\n", "n=int(input()) \r\nfrom collections import defaultdict\r\nax=dict() \r\nax['polycarp']=1\r\nans=1\r\nfor i in range(n):\r\n a,b,c=map(str,input().split()) \r\n a=a.lower()\r\n c=c.lower() \r\n ax[a]=ax[c]+1 \r\n #print(ax[a])\r\n e=ax[a]\r\n ans=max(ans,e)\r\nprint(ans)", "t=int(input())\r\ndict={}\r\ndict[\"polycarp\"]=1\r\nmaxi=1\r\nfor i in range(t):\r\n s=list(input().split())\r\n dict[s[0].lower()]=dict[s[2].lower()]+1\r\n maxi=max(maxi,dict[s[0].lower()])\r\n\r\nprint(maxi)", "adj={'polycarp':1}\r\nn=int(input())\r\nfor i in range(n):\r\n string1,reposted,string2=input().lower().split(\" \")\r\n adj[string1]=adj[string2]+1\r\n #if string2 not in adj:\r\n # adj[string2]=[string1]\r\n #else:\r\n # adj[string2]=adj[string2]+[string1]\r\n\r\n# {'Polycarp': ['tourist'], 'Tourist': ['Petr'], 'Petr': ['WJMZBMR'], 'wjmzbmr': ['sdya'], 'sdya': ['vepifanov']}\r\n\r\nprint(max(adj.values()))\r\n \r\n", "s = {}\r\nfor i in range(int(input())):\r\n u, k, v = input().lower().split()\r\n s[v] = s.get(v, []) + [u]\r\ndef f(x): return max(f(y) for y in s[x]) + 1 if x in s else 1\r\nprint(f('polycarp'))", "d = {'polycarp': 1}\nfor k in range(int(input())):\n a, b, c = input().lower().split(' '); \n d[a] = d[c] + 1\nprint(max(d.values()))\n\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t\t \t", "def dfs(person, longest):\r\n count = 1\r\n curr = person\r\n while curr in d:\r\n curr = d[curr]\r\n count += 1\r\n return max(count, longest)\r\n\r\nn = int(input())\r\nd = {}\r\nseq = []\r\nfor _ in range(0, n):\r\n l = list(map(str, input().split()))\r\n seq.append(l[0].lower())\r\n d[l[0].lower()] = l[2].lower()\r\nlongest = 1\r\nfor i in seq:\r\n longest = dfs(i, longest)\r\nprint(longest)", "n = int(input())\n\nv = [[] for _ in range(n+2)]\nus = {\"polycarp\": 1}\n\ncur = 1\n\nfor i in range(n):\n s = input().split(' ')\n w = s[0].lower()\n f = s[-1].lower()\n\n if not us.get(w):\n cur += 1\n us[w] = cur\n\n if not us.get(f):\n cur += 1\n us[f] = cur\n \n v[us[f]].append(us[w])\n\ndef dfs(cur):\n if not v[cur]:\n return 1\n\n maxi = -1\n for u in v[cur]:\n maxi = max(maxi, dfs(u)+1)\n\n return maxi\n\nprint(dfs(1))\n\n", "def add_vertex(graph,v):\r\n if v not in graph:\r\n graph[v] = []\r\ndef add_edge(graph,v1, v2):\r\n graph[v1].append(v2)\r\nsu=0\r\nm=0\r\ndef dfs(visited, graph, node):\r\n global su,m\r\n if node not in visited:\r\n visited.add(node)\r\n su+=1\r\n m=max(su,m)\r\n for neighbour in graph[node]:\r\n dfs(visited, graph, neighbour)\r\n su-=1\r\ngraph={}\r\nincidence={}\r\nn=int(input())\r\nfor j in range(1,n+1):\r\n s=list(map(str,input().split(\" reposted \")))\r\n add_vertex(graph,s[0].lower())\r\n add_vertex(graph,s[1].lower())\r\n add_edge(graph,s[1].lower(),s[0].lower())\r\nvisited=set()\r\ndfs(visited,graph,\"polycarp\")\r\nprint(m)", "n = int(input())\r\na = []\r\nfor j in range(0, n):\r\n a.append(input())\r\npol = {}\r\npol['POLYCARP'] = 1\r\nfor i in range(0, n):\r\n b, c, d = a[i].split()\r\n pol[b.upper()] = pol[d.upper()] + 1\r\nprint(max(pol.values()))\r\n", "dic={'polycarp':1}\r\nfor i in range(int(input())):\r\n l=[x.lower() for x in input().split(\" \")]\r\n dic[l[0]]=dic[l[2]]+1\r\nprint(max(dic.values())) ", "n = int(input())\r\na = [input().lower().split() for i in range(n)]\r\nd = {}\r\nd['polycarp'] = 1\r\nmx = 1\r\nfor i in a:\r\n d[i[0]] = d[i[2]] + 1\r\n mx = max(mx, d[i[0]])\r\nprint(mx)\r\n", "n = int(input())\nd = dict()\nd[\"polycarp\"] = 1\nfor i in range(n):\n s = input().split()\n name1 = s[0].lower()\n name2 = s[2].lower()\n d[name1] = d[name2] + 1\nprint(max(d.values()))\n", "n = int(input())\r\nans = {'polycarp':1}\r\nfor i in range(n):\r\n repost, _, reposted = input().lower().split()\r\n ans[repost] = ans[reposted] + 1\r\nprint(max(ans.values()))", "\r\nimport time\r\nimport sys\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom heapq import *\r\n\r\ninput = sys.stdin.readline\r\n\r\nis_debug = '_local_debug_' in globals()\r\n\r\n#int input\r\ndef inp():\r\n return(int(input()))\r\n\r\n#list input\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\n#string input\r\ndef insr():\r\n return input()[:-1]\r\n\r\n#strings input\r\ndef inss(n):\r\n return [insr() for _ in range(n)]\r\n\r\n#variables input\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n#matrix input\r\ndef inmt(n):\r\n return [inlt() for _ in range(n)]\r\n\r\nclass Solution(object):\r\n def input(self):\r\n # 读入数据，返回一个参数列表\r\n # 例如：读取一个整数n和一个字符串s\r\n # return (n, s)\r\n n = inp()\r\n ss = inss(n)\r\n return (n,ss)\r\n\r\n def solve(self, n, ss):\r\n times = defaultdict(int)\r\n for s in ss:\r\n a,_,b = s.split()\r\n times[a.lower()] = times[b.lower()] + 1\r\n return max(times.values()) + 1\r\n\r\n def output(self,ans):\r\n print(ans)\r\n\r\ndef solve(i):\r\n sol = Solution()\r\n param = sol.input()\r\n if is_debug: start = time.time()\r\n ans = sol.solve(*param)\r\n sol.output(ans)\r\n if is_debug:\r\n end = time.time()\r\n print(f'Case{i} Time: {(end - start) * 1000} ms')\r\n\r\n#对于只有一个样例的题目，将inp()改为1\r\n#t = inp() \r\nt = 1\r\nif is_debug: start = time.time()\r\nfor i in range(1, t + 1):\r\n solve(i)\r\nif is_debug:\r\n end = time.time()\r\n print(f'Total Time: {(end - start) * 1000} ms')", "n = int(input())\r\nD = {'polycarp': 1}\r\n\r\nfor i in range(n):\r\n s1, temp, s2 = input().lower().split(\" \")\r\n D[s1] = 1 + D[s2]\r\n\r\nprint(max(D.values()))\r\n", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,inf\r\nfrom collections import deque,defaultdict\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(x)\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)*x\r\npw=lambda x:0 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\ndef solve(p):\r\n\tif p not in d:return 1\r\n\telse:\r\n\t\tm=-inf\r\n\t\tfor i in d[p]:\r\n\t\t\tm=max(m,solve(i))\r\n\t\treturn m+1\r\n\r\nd={}\r\nfor i in range(I()):\r\n\tx=S().split()\r\n\ta=x[0].lower()\r\n\tb=x[-1].lower()\r\n\tif b not in d:d[b]=[a]\r\n\telse:d[b]+=a,\r\nprint(solve('polycarp'))", "n=int(input())\r\ng=[[] for i in range(n+1)]\r\n\r\nnames=[\"polycarp\"]\r\nused=[-1]*(n+1)\r\nused[0]=0\r\n\r\nfor i in range(n):\r\n n1,rep,n2=map(str,input().split())\r\n n1=n1.lower()\r\n n2=n2.lower()\r\n if names.count(n1)==0:\r\n names.append(n1)\r\n v=names.index(n1)\r\n u=names.index(n2)\r\n \r\n g[v].append(u)\r\n g[u].append(v)\r\n \r\nqueue=[0]\r\ndef bfs(start):\r\n while queue!=[]:\r\n for v in g[queue[0]]:\r\n if used[v]==-1:\r\n used[v]=used[queue[0]]+1\r\n queue.append(v)\r\n del(queue[0])\r\n\r\nbfs(0)\r\nprint(max(used)+1)", "n = int(input())\r\nMax, x = 1, {}\r\nx['polycarp'] = 1\r\nfor i in range(n):\r\n a, b = input().lower().split(' reposted ')\r\n x[a] = x[b] + 1\r\nfor i in x:\r\n Max = max(x[i], Max)\r\nprint(Max)", "dct={}\r\ndef maxh(rt):\r\n mx=0\r\n if dct.get(rt,0)==0:\r\n return 0\r\n for i in range(len(dct[rt])):\r\n mx=max(maxh(dct[rt][i])+1,mx)\r\n return mx\r\nn=int(input())\r\nfor i in range(n):\r\n stri=input().split()\r\n s1=stri[0].lower()\r\n s2=stri[2].lower()\r\n dct[s2]=dct.get(s2,[])\r\n dct[s2].append(s1)\r\nprint(maxh('polycarp')+1)", "from collections import defaultdict, deque\r\n\r\n\r\ndef find_popularity(hmap):\r\n \"\"\"\r\n Basically we have to level-order-traversal of an n-array tree\r\n :param hmap:\r\n :return:\r\n \"\"\"\r\n q = deque(['polycarp'])\r\n\r\n traverse = []\r\n level = 0\r\n\r\n while q:\r\n traverse.append([])\r\n for i in range(len(q)):\r\n node = q.popleft()\r\n traverse[level].append(node)\r\n\r\n for nei in hmap[node]:\r\n q.append(nei)\r\n\r\n level += 1\r\n # print(traverse)\r\n print(len(traverse))\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n hmap = defaultdict(list)\r\n while n > 0:\r\n a, b, c = input().split()\r\n hmap[c.lower()].append(a.lower())\r\n n -= 1\r\n find_popularity(hmap)\r\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 1000000007\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n s = list(input().split())\r\n s[0] = s[0].lower()\r\n s[2] = s[2].lower()\r\n a.append(s)\r\nd = {}\r\nd['polycarp'] = 1\r\nans = 1\r\nfor i in a:\r\n name1 = i[0]\r\n name2 = i[2]\r\n if name1 not in d:\r\n d[name1] = d[name2] + 1\r\n else:\r\n d[name1] = max(d[name1], d[name2] + 1)\r\n ans = max(ans, d[name1])\r\nprint(ans)\r\n", "n = int(input())\r\ngraph = {}\r\ndef solve(graph, start, parent):\r\n\tmx = 1\r\n\tfor child in graph[start]:\r\n\t\tif child == parent:\r\n\t\t\tcontinue\r\n\r\n\t\tc = solve(graph, child, start)+1\r\n\t\tmx = max(mx, c)\r\n\treturn mx\r\n\r\n\r\nfor _ in range(n):\r\n\twords = input().lower().split(' ')\r\n\tif words[2] not in graph:\r\n\t\tgraph[words[2]] = [words[0]]\r\n\telse:\r\n\t\tgraph[words[2]].append(words[0])\r\n\r\n\tif words[0] not in graph:\r\n\t\tgraph[words[0]] = []\r\n\r\nprint(solve(graph, 'polycarp', 'polycarp'))", "from collections import defaultdict\r\n\r\nn = int(input())\r\ngraph = defaultdict(list)\r\n\r\nfor _ in range(n):\r\n name1, reposted, name2 = list(input().split())\r\n name1, name2 = name1.lower(), name2.lower()\r\n graph[name2].append(name1)\r\n\r\n\r\ndef dfs(name, ans):\r\n if not graph[name]:\r\n return ans\r\n \r\n res = 0\r\n \r\n for name2 in graph[name]:\r\n res = max(res, dfs(name2, ans + 1))\r\n\r\n return res\r\n\r\nprint(dfs(\"polycarp\", 1))", "import math as mt\r\nimport sys, string\r\nfrom collections import Counter, defaultdict\r\ninput = sys.stdin.readline\r\n\r\nMOD = 1000000007\r\n\r\n# input functions\r\nI = lambda : int(input())\r\nM = lambda : map(int, input().split())\r\nMs = lambda : map(str, input().split())\r\nARR = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef dfs(u, graph, visited):\r\n if not visited[u]:\r\n visited[u] = True\r\n mx = 0\r\n for child in graph[u]:\r\n mx = max(mx, 1 + dfs(child, graph, visited))\r\n return mx\r\n return 0\r\n\r\ndef main():\r\n root = \"polycarp\"\r\n n = I()\r\n graph = defaultdict(list)\r\n for _ in range(n):\r\n n1, tg, n2 = Ms()\r\n n1 = n1.lower()\r\n n2 = n2.lower()\r\n graph[n1].append(n2)\r\n graph[n2].append(n1)\r\n \r\n visited = dict()\r\n for k in graph.keys():\r\n visited[k] = False\r\n \r\n print(dfs(root, graph, visited))\r\n\r\n# testcases\r\ntc = 1\r\nfor _ in range(tc):\r\n main()", "\r\nn = int(input())\r\n\r\ngr = [[] for i in range(n+n)]\r\n\r\nmp = {}\r\n\r\nj = 0\r\n\r\nans = []\r\n\r\ndef bfs():\r\n i = 0\r\n q = [0]\r\n dis = {0:0}\r\n par = {0:0}\r\n while q:\r\n next = []\r\n for u in q:\r\n for v in gr[u]:\r\n if v not in par:\r\n par[v] = u\r\n dis[v] = i\r\n next.append(v)\r\n q = next\r\n i+=1\r\n #print(dis)\r\n print(max(dis.values())+2)\r\n \r\nfor i in range(n):\r\n a,z,b = map(str,input().strip().split())\r\n #print(a)\r\n #print(b)\r\n a = a.lower()\r\n b = b.lower()\r\n if b not in mp:\r\n mp[b] = j\r\n j+=1\r\n if a not in mp:\r\n mp[a] = j\r\n j+=1\r\n gr[mp[a]].append(mp[b])\r\n gr[mp[b]].append(mp[a])\r\n\r\n#print(mp)\r\nbfs()\r\n\r\n \r\n", "leaf = {}\r\nn = int(input())\r\nfor i in range(n):\r\n s = input().split()\r\n a = s[0].lower()\r\n b = s[2].lower()\r\n try:\r\n leaf[b].append(a)\r\n except:\r\n leaf[b] = []\r\n leaf[b].append(a)\r\n\r\nq = []\r\nst = []\r\nq.append('polycarp')\r\nm = 0\r\nwhile len(q) > 0:\r\n t = q.pop()\r\n while len(st) > 0 and t not in leaf[st[-1]]:\r\n st.pop()\r\n st.append(t)\r\n try:\r\n tt = leaf[t]\r\n for i in tt:\r\n q.append(i)\r\n except:\r\n if len(st) > m:\r\n m = len(st)\r\n st.pop()\r\n\r\nprint (m)", "from collections import defaultdict\r\nfrom functools import lru_cache\r\nclass Solution:\r\n def Report(self, edges):\r\n graph = defaultdict(list)\r\n for p1, p2 in edges:\r\n graph[p2].append(p1)\r\n @lru_cache(None)\r\n def dfs(p):\r\n if not graph[p]:\r\n return 1\r\n ans = 0\r\n for nbr in graph[p]:\r\n ans = max(ans, dfs(nbr))\r\n return ans + 1\r\n return dfs(\"polycarp\")\r\n \r\n \r\nsol = Solution()\r\nn = int(input())\r\nedges = []\r\nfor _ in range(n):\r\n sts = input().split(\" \")\r\n edge = [sts[0].lower(), sts[-1].lower()]\r\n edges.append(edge)\r\nprint(sol.Report(edges))\r\n ", "import sys\r\nfrom collections import defaultdict as dd\r\ndef read():\r\n return sys.stdin.readline().strip()\r\ndef write(a):\r\n sys.stdout.write(a)\r\ndef dfs(d, u, v, cnt):\r\n if v[u] == True:\r\n return cnt\r\n v[u] = True\r\n ans = cnt\r\n for i in d[u]:\r\n ans = max(ans, dfs(d, i, v, cnt + 1))\r\n return ans\r\ndef main():\r\n n = int(read())\r\n d = dd(list)\r\n p = set()\r\n for i in range(n):\r\n b, _, a = read().split()\r\n a = a.lower()\r\n b = b.lower()\r\n p.add(a)\r\n p.add(b)\r\n d[a] += [b]\r\n v = {i:False for i in p}\r\n print(dfs(d, 'polycarp', v, 1))\r\nmain()\r\n", "n=int(input())\r\ndi={\"polycarp\":1}\r\nma=1\r\nfor i in range(n):\r\n x,y,z=input().split()\r\n x=x.lower()\r\n z=z.lower()\r\n di[x]=di[z]+1\r\n ma=max(ma,di[x])\r\nprint(ma)\r\n", "def dfs(x,depth):\r\n # stack.append(x)\r\n for i in range(len(adj[x])):\r\n if(adj[x][i] in adj):\r\n dfs(adj[x][i],depth+1)\r\n ans.append(max(ans[-1],depth))\r\nN=int(input())\r\nadj={}\r\nfor i in range(N):\r\n s=input().split()\r\n for i in range(3):\r\n s[i]=s[i].lower()\r\n if(s[2] not in adj): \r\n adj[s[2]]=[s[0]]\r\n else:\r\n adj[s[2]].append(s[0])\r\n# print(adj)\r\nstack=[]\r\nans=[0]\r\ndfs(\"polycarp\",1)\r\nprint(max(ans)+1)", "n = int(input())\r\nd = {'polycarp' : 1}\r\nfor i in range(n) :\r\n a,b = input().lower().split(' reposted ')\r\n d[a] = d[b]+1\r\nprint(max(d.values()))\r\n", "from collections import defaultdict\r\nclass Node():\r\n def __init__(self, value):\r\n self.value = value\r\n self.children = []\r\n \r\nn = int(input())\r\ntree = defaultdict(list)\r\n\r\nfor _ in range(n):\r\n \r\n repost = input().split()\r\n tree[repost[2].lower()].append(repost[0].lower())\r\n\r\n\r\nroot = Node('polycarp')\r\nstack = [root]\r\n\r\nwhile stack:\r\n cur = stack.pop()\r\n \r\n for child in tree.get(cur.value, []):\r\n child = Node(child)\r\n cur.children.append(child)\r\n stack.append(child)\r\n\r\nans = [0]\r\ndef maxdepth(root, depth):\r\n if not root.children:\r\n ans[0] = max(ans[0], depth)\r\n return\r\n for child in root.children:\r\n maxdepth(child, depth + 1)\r\n\r\nmaxdepth(root, 1)\r\nprint(ans[0])\r\n \r\n ", "from collections import defaultdict\r\n\r\npost = defaultdict(list)\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n c, b, a = input().split()\r\n post[a.lower()].append(c.lower())\r\n\r\nposters = set([\"polycarp\"])\r\n\r\ndef dfs(person, count):\r\n c = count \r\n for friend in post[person]:\r\n if friend in posters:\r\n continue\r\n posters.add(friend)\r\n c = max(c, dfs(friend, count + 1))\r\n # print(person, c)\r\n return c\r\n\r\nprint(dfs(\"polycarp\", 1))\r\n\r\n", "import collections\n\ndef algo(adj, parent):\n res = 1\n for child in adj[parent]:\n res = max(res, 1 + algo(adj, child))\n return res\n \n\ndef main():\n adjList = collections.defaultdict(list)\n for i in range(int(input())):\n line = input().split()\n adjList[line[2].lower()].append(line[0].lower())\n print(algo(adjList, 'polycarp'))\n \n \nmain()\n\t \t\t\t \t\t\t\t \t \t \t \t \t \t", "reposter = {}\r\nfor i in range(int(input())):\r\n REPOSTED = input().split()\r\n REPOSTED[0] = REPOSTED[0].lower()\r\n REPOSTED[2] = REPOSTED[2].lower()\r\n if REPOSTED[0] not in reposter.keys():\r\n reposter[REPOSTED[0]] = list()\r\n reposter[REPOSTED[0]] = REPOSTED[2]\r\nx = 1\r\nMAX = 2\r\nfor i in reposter:\r\n s = i\r\n x = 1\r\n while s != 'polycarp':\r\n s = reposter[s]\r\n x+=1\r\n if MAX < x:\r\n MAX = x\r\nprint(MAX)", "def dfs(record,key_vertex):\r\n if key_vertex not in record.keys():\r\n return 1\r\n \r\n val = 1\r\n for neighbour in record[key_vertex]:\r\n val = max(1 + dfs(record,neighbour),val)\r\n \r\n return val \r\n\r\nn = int(input())\r\nrecord = {}\r\nstart = \"\"\r\ncond = True\r\nfor i in range(n):\r\n s = input()\r\n li = s.split(' ')\r\n key = li[2].lower()\r\n if cond:\r\n start = key\r\n cond = False\r\n\r\n val = li[0].lower()\r\n if key in record.keys():\r\n record[key].append(val)\r\n else:\r\n record[key] = [val]\r\n\r\nprint(dfs(record,start))", "N = int(input())\r\n\r\nchainsDict = {'polycarp': 1}\r\n\r\nfor i in range(N):\r\n first, second = input().lower().split(' reposted ')\r\n \r\n if first in chainsDict:\r\n chainsDict[first] += 1\r\n else:\r\n chainsDict[first] = chainsDict[second] + 1\r\n\r\n\r\nprint(max((chainsDict[x] for x in chainsDict)))\r\n\r\n \r\n", "n = int(input())\r\nd = {}\r\nd['polycarp']=1\r\nfor i in range(n):\r\n a,b=input().lower().split(' reposted ')\r\n d[a]=d[b]+1\r\nprint(max(d.values()))", "from collections import defaultdict, deque\r\n\r\n\r\ndef bfs(src, g):\r\n q =deque()\r\n q.append(src)\r\n depth = 0\r\n\r\n while q:\r\n l = len(q)\r\n depth += 1\r\n\r\n for _ in range(l):\r\n curr = q.popleft()\r\n for child in g[curr]:\r\n q.append(child)\r\n return depth\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n g = defaultdict(list)\r\n map = {}\r\n src = -1\r\n idx = 0\r\n\r\n for _ in range(n):\r\n x, y, z = [str(x).lower() for x in input().split(\" \")]\r\n if x not in map:\r\n map[x] = idx\r\n idx += 1\r\n if z not in map:\r\n map[z] = idx\r\n idx += 1\r\n if z == \"polycarp\":\r\n src = map[z]\r\n g[map[z]].append(map[x])\r\n print(bfs(src, g))\r\n\r\n\r\nmain()", "\r\n# Online Python - IDE, Editor, Compiler, Interpreter\r\nfrom collections import deque,defaultdict\r\nimport sys\r\ndef inp(): return int(sys.stdin.readline())\r\ndef mpp(): return map(str,sys.stdin.readline().rstrip().split())\r\ndef lis(): return list(map(int,sys.stdin.readline().rstrip().split()))\r\ndef sol(graph):\r\n q=deque()\r\n visited=set()\r\n source=\"polycarp\"\r\n q.append((source,1))\r\n visited.add(source)\r\n mxcount=1\r\n while q:\r\n temp,count=q.popleft()\r\n mxcount=max(mxcount,count)\r\n for i in graph[temp]:\r\n if i not in visited:\r\n visited.add(i)\r\n q.append((i,count+1))\r\n return mxcount\r\ndef main():\r\n t=inp()\r\n graph=defaultdict(list)\r\n for _ in range(t):\r\n a,b,c=mpp()\r\n graph[c.lower()].append(a.lower())\r\n #print(graph)\r\n sys.stdout.write(str(sol(graph)))\r\nif __name__==\"__main__\":\r\n main()", "import sys\nfrom collections import defaultdict\n\nn = int(sys.stdin.readline())\ndp = defaultdict(int)\ndp[\"polycarp\"] = 1\n\nfor _ in range(n):\n [f, x, t] = sys.stdin.readline().split()\n f = f.lower()\n t = t.lower()\n dp[f] = dp[t] + 1\n\nprint(max(dp.values()))\n", "def dfs(graph, node):\n if node not in graph:\n return 1\n\n max_chain = 1\n for neighbor in graph[node]:\n max_chain = max(max_chain, 1 + dfs(graph, neighbor))\n\n return max_chain\n\n\ndef max_repost_chain(n, reposts):\n graph = {}\n for repost in reposts:\n name1, _, name2 = repost.lower().split()\n graph[name2] = graph.get(name2, []) + [name1]\n\n return dfs(graph, \"polycarp\")\n\n\n\nn = int(input())\nreposts = [input() for _ in range(n)]\n\nresult = max_repost_chain(n, reposts)\nprint(result)\n\n\t\t\t \t \t\t \t\t\t\t\t\t \t\t \t\t \t\t \t \t", "aL = {}\n\n\ndef dfs(parent, node):\n s = [0]\n for neighbour in aL[node]:\n if parent == neighbour:\n continue\n s.append(dfs(node, neighbour))\n\n return 1 + max(s)\n\nfor _ in range(int(input())):\n a, dum, b = input().lower().split()\n\n if a not in aL: aL[a] = []\n if b not in aL: aL[b] = []\n \n aL[a].append(b)\n aL[b].append(a)\n\nprint(dfs('', 'polycarp'))\n \t\t\t \t\t \t \t\t\t \t \t\t \t\t \t\t", "reposted = {'polycarp': 1}\r\nn = int(input())\r\nfor i in range(n):\r\n names = input().lower().split(\" reposted \")\r\n reposted[names[0]] = reposted[names[1]] + 1\r\nprint(reposted[max(reposted, key=reposted.get)])", "data = {'polycarp': 1}\r\nMax = 1\r\nfor _ in range(int(input())):\r\n s = list(input().lower().split(\" \"))\r\n new = data[s[2]]\r\n new += 1\r\n Max = max(Max, new)\r\n data.update({s[0]: new})\r\n\r\nprint(Max)", "n = int(input())\r\nd = {}\r\nd['polycarp'] = 1\r\npopularity = 1\r\nfor i in range(n):\r\n name1, waste, name2 = map(str, input().split())\r\n name1 = name1.lower()\r\n name2 = name2.lower()\r\n d[name1] = d[name2] + 1\r\n popularity = max(d[name1], popularity)\r\nprint(popularity)", "n = int(input())\r\na = []\r\nd= {}\r\nfor i in range(n):\r\n x, y = input().split(\" reposted \")\r\n x = x.lower()\r\n y = y.lower()\r\n a.append([x,y])\r\n d[x]=0\r\n d[y]=0\r\n\r\nd[\"polycarp\"] = 1\r\n\r\nfor i in range(n):\r\n d[a[i][0]] += d[a[i][1]] + 1\r\nprint(max(d.values()))", "n = int(input()) + 1\nnames = []\nparent = [-1] * n\n\n\ndef find(name):\n if name in names:\n return names.index(name)\n else:\n names.append(name)\n return len(names) - 1\n\n\nfor i in range(n-1):\n a, b, c = input().lower().split()\n x, y = find(a), find(c)\n parent[x] = y\n\n\ndef length(node):\n l = 0\n while node >= 0:\n node = parent[node]\n l += 1\n return l\n\n\nlongest = 0\nfor i in range(n):\n l = length(i)\n if l > longest:\n longest = l\nprint(longest)\n", "n=int(input().strip())\r\nq={}\r\nfor i in range(n):\r\n a=input().strip().split()\r\n if a[2].lower() not in q:\r\n q[a[2].lower()]=[a[0].lower()]\r\n else:\r\n q[a[2].lower()]+=[a[0].lower()]\r\ndef dfs(u):\r\n if u not in q.keys():\r\n return 1\r\n mx=0\r\n for i in q[u]:\r\n mx=max(mx,dfs(i)+1)\r\n return mx\r\nprint(dfs('polycarp'))", "def dfs(s):\n if s in visited:\n return 0\n dist = 0 \n if reposts.get(s) == None:\n return 0\n for i in reposts[s]:\n visited.append(s)\n dist = max(dfs(i), dist)\n return dist + 1 \n\nvisited = list()\nn = int(input())\nreposts = dict()\nfor i in range(n):\n tmp = input().split()\n reposts.setdefault(tmp[2].lower(), []).append(tmp[0].lower())\n reposts.setdefault(tmp[0].lower(), []).append(tmp[2].lower())\n\nprint(dfs('polycarp'))", "class Node:\r\n # A utility function to create a new node\r\n def __init__(self):\r\n self.dic={\"polycarp\":[]}\r\n\r\n def addNode(self,addto,newNode):\r\n self.dic[addto].append(newNode)\r\n self.dic[newNode]=[]\r\n\r\n def maxHight(self,root):\r\n maxi=0\r\n if(len(self.dic[root])==0):\r\n return 1\r\n else:\r\n for i in range(len(self.dic[root])):\r\n maxi= max(maxi,1+self.maxHight(self.dic[root][i]))\r\n return maxi\r\n\r\n\r\nn=int(input());s=[None]*n\r\nfor i in range(n):\r\n str=input()\r\n s[i]=str.casefold()\r\n\r\nroot=Node()\r\nfor i in range(len(s)):\r\n addto=s[i].split()[-1]\r\n newNode=s[i].split()[0]\r\n root.addNode(addto.casefold(),newNode.casefold())\r\n\r\n\r\n\r\nprint(root.maxHight(\"polycarp\".casefold()))\r\n\r\n\r\n# print(a.casefold())", "from collections import defaultdict,deque\r\ntot=int(input())\r\nx=defaultdict(list)\r\nfor _ in range(tot):\r\n\tpost=input().split()\r\n\tx[post[2].lower()].append(post[0].lower())\r\n \r\n \r\nq=deque([('Polycarp'.lower(),1)])\r\nans=1\r\nwhile q:\r\n\tcur,depth=q.popleft()\r\n\tans=max(ans,depth)\r\n\tfor i in x[cur]:\r\n\t\tq.append((i,depth+1))\r\nprint(ans)", "from collections import *\r\nfrom functools import * \r\ntest = int(input())\r\ngraph = defaultdict(list)\r\nfor _ in range(test):\r\n string = input().lower().split()\r\n graph[string[2]].append(string[0])\r\n@cache \r\ndef dfs(node):\r\n chain = 0\r\n for child in graph[node]:\r\n chain = max(chain, 1 + dfs(child))\r\n return chain \r\nmax_result = dfs('polycarp')\r\nprint(max_result + 1)\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\n\r\nt = int(input())\r\nd = defaultdict(list)\r\nl = []\r\n\r\ndef DFS(visited,x,c,d):\r\n\r\n\tz = c\r\n\tvisited[x] = True\r\n\r\n\tfor j in d[x]:\r\n\t\t\r\n\r\n\t\tif visited[j] == False:\r\n\t\t\tz = max(z,DFS(visited,j,c+1,d))\r\n\t\r\n\r\n\treturn z\r\n\r\nvisited = {}\r\nfor i in range(t):\r\n\ts = input().split(\" \")\r\n\r\n\tl.append(s[0].lower())\r\n\tl.append(s[2].lower())\r\n\r\n\tvisited[l[-1]] = False\r\n\tvisited[l[-2]] = False\r\n\r\n\td[l[-1]].append(l[-2])\r\nz = 1\r\nfor i in visited:\r\n\r\n\tc = 1\r\n\tif visited[i] == False:\r\n\t\tz = max(z,DFS(visited,i,c,d))\r\n\r\nprint(z)\r\n", "n = int(input())\n\nreposts = {}\nfor i in range(n):\n s = input().split()\n name1, name2 = s[0].lower(), s[2].lower()\n\n if name2 == \"polycarp\":\n reposts[name1] = 2\n else:\n reposts[name1] = reposts[name2] + 1\n\n\nprint(max(reposts.values()))", "def find(d,x):\r\n try:\r\n cnt = [1]*len(d[x])\r\n for i in range(len(d[x])):\r\n cnt[i] += find(d,d[x][i])\r\n return max(cnt)\r\n except KeyError:\r\n return 1\r\n\r\n\r\nn = int(input())\r\nd = {}\r\nfor i in range(n):\r\n m = input().split()\r\n try:\r\n d[m[2].lower()].append(m[0].lower())\r\n except KeyError:\r\n d[m[2].lower()]=[m[0].lower()]\r\nprint(find(d,'polycarp'))\r\n", "#!/usr/bin/env python3\nimport collections, itertools, functools, math\n\ndef solve():\n n = int(input())\n graph = dict()\n for _ in range(n):\n dst, _, src = input().lower().split()\n if src not in graph:\n graph[src] = set()\n graph[src].add(dst)\n\n def treeHeight(node):\n if node not in graph:\n return 1\n return 1 + max(treeHeight(n) for n in graph[node])\n\n return treeHeight('polycarp')\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "def reposty(lst):\r\n d, result = {'polycarp': 1}, 0\r\n for elem in lst:\r\n name1, name2 = elem[0].lower(), elem[2].lower()\r\n d[name1] = d[name2] + 1\r\n for key, v in d.items():\r\n result = max(result, v)\r\n return result\r\n\r\n\r\nn = int(input())\r\na = list()\r\nfor i in range(n):\r\n s, t, z = [i for i in input().split()]\r\n a.append([s, t, z])\r\nprint(reposty(a))\r\n", "v = int(input())\nver = 1\nref = {'polycarp': 1}\ngraph = []\nfor i in range(v+2):\n graph.append([])\nfor i in range(v):\n child, _, parent = input().split()\n child = str.lower(child)\n parent = str.lower(parent)\n ver += 1\n ref[child] = ver\n p = ref[parent]\n c = ref[child]\n graph[p].append(c)\n\ndef dfs(graph, node, visited, height):\n visited[node] = True\n for i in graph[node]:\n if not visited[i]:\n dfs(graph, i, visited, height)\n height[node] = max(height[node], height[i] + 1)\n\nheight = [1]*(len(graph) + 1)\ndfs(graph, 1, [False]*(len(graph) + 1), height)\nprint(height[1])", "from collections import defaultdict\r\nfrom collections import Counter\r\nclass Graph:\r\n def __init__(self,V):\r\n self.V=V\r\n self.graph=defaultdict(list)\r\n def addEdge(self,u,v):\r\n self.graph[u].append(v)\r\n def bfslevel(self,s):\r\n visited=Counter()\r\n q=[]\r\n q.append(s)\r\n level=Counter()\r\n\r\n level[s]=0\r\n visited[s]=True\r\n\r\n while q:\r\n s=q.pop(0)\r\n\r\n for i in self.graph[s]:\r\n if visited[i]==False:\r\n q.append(i)\r\n visited[i]=True\r\n level[i]=level[s]+1\r\n final=max(level[i],level[s])\r\n #print(level)\r\n print(final+1)\r\n\r\nn=int(input())\r\ng=Graph(n)\r\nflag=0\r\nl=[]\r\nfor i in range(n):\r\n l=list((input().split(\" \")))\r\n g.addEdge(l[2].lower(),l[0].lower())\r\n#print(g.graph)\r\n#print(root)\r\ng.bfslevel(\"polycarp\")\r\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\nn=ii()\r\n\r\ng=defaultdict(list)\r\n\r\nfor _ in range(n):\r\n s=input().split()\r\n g[s[2].lower()].append(s[0].lower())\r\n\r\n\r\n#print(g)\r\ndef dfs(r):\r\n if len(g[r])==0:\r\n return 1\r\n else:\r\n res=1\r\n for nr in g[r]:\r\n res=max(res,dfs(nr)+1)\r\n return res\r\n\r\nprint(dfs(\"Polycarp\".lower()))\r\n\r\n\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\nname = ['polycarp']\r\nedges = [1]\r\nfor i in range(n):\r\n child,x,parent = input().lower().split(' ')\r\n idx = name.index(parent)\r\n name.append(child)\r\n edges.append(edges[idx]+1)\r\nprint(max(edges))", "n = int(input())\r\ngrath = {}\r\ngrath['polycarp'] = []\r\nmass = ['polycarp']\r\nfor i in range(n):\r\n st = input()\r\n st = st.split(' ')\r\n name1 = st[0].lower()\r\n name2 = st[2].lower()\r\n if name2 not in grath:\r\n grath[name2] = []\r\n if name1 not in grath:\r\n grath[name1] = []\r\n grath[name2].append(name1)\r\n mass.append(name1)\r\n\r\n\r\n\r\nitog = []\r\ndef dfs(v, count):\r\n mass.remove(v)\r\n count += 1\r\n itog.append(count)\r\n if grath[v]!= []:\r\n for u in grath[v]:\r\n if u in mass:\r\n dfs(u, count)\r\ncount = 0\r\ndfs('polycarp', count)\r\nprint(max(itog))\r\n\r\n\r\n", "from collections import defaultdict\r\n\r\ndef DFS(i,visited,h,g):\r\n if visited[i]==0:\r\n visited[i]=1\r\n for j in g[i]:\r\n if visited[j]==0:\r\n h[j]=h[i]+1\r\n DFS(j,visited,h,g)\r\nn=int(input())\r\nc=1\r\nd={}\r\ng=defaultdict(list)\r\nfor i in range(n):\r\n l=list(input().split())\r\n l[2]=l[2].lower()\r\n d[l[2]]=d.get(l[2],0)\r\n if d[l[2]]==0:\r\n d[l[2]]=c\r\n c=c+1\r\n l[0]=l[0].lower()\r\n d[l[0]]=d.get(l[0],0)\r\n if d[l[0]]==0:\r\n d[l[0]]=c\r\n c=c+1\r\n g[d[l[2]]].append(d[l[0]])\r\nvisited=[0]*(c+1)\r\nh=[1]*(c+1)\r\nDFS(1,visited,h,g)\r\nprint(max(h))", "n = int(input())\r\n\r\ntree = {\"polycarp\" : []}\r\nfor _ in range(n):\r\n name1, r, name2 = input().split(\" \")\r\n\r\n tree[name2.lower()] = tree.get(name2.lower(), []) + [name1.lower()]\r\n\r\n\r\nans = 1\r\ndef dfs(root, depth=1):\r\n global ans\r\n for vertex in tree[root]:\r\n if vertex in tree.keys():\r\n dfs(vertex, depth+1)\r\n else:\r\n ans = max(ans, depth+1)\r\n\r\n\r\ndfs(\"polycarp\")\r\nprint(ans)", "m = {}\n\ndef dfs(par, i):\n global m\n ret = 1\n # leaf node\n if i not in m:\n return 1\n for j in m[i]:\n if j == par:\n continue\n ret = max(ret, dfs(i, j) + 1)\n return ret\n\ndef main():\n global m\n n = int(input())\n for i in range(n):\n (a, _, b) = map(lambda x: x.lower(), input().split(' '))\n if b in m:\n m[b].append(a)\n else:\n m[b] = [a]\n ret = 0\n for i in m:\n ret = max(ret, dfs(None, i))\n print(ret)\n\nmain()\n", "g = {'polycarp' : 1}\nfor _ in range(int(input())):\n\tn1, rp, n2 = input().split()\n\tif n1.lower() not in g:\n\t\tg[n1.lower()] = 0\n\tif n2.lower() not in g:\n\t\tg[n2.lower()] = 0\n\tg[n1.lower()] = g[n2.lower()] + 1\n# print(g)\nmaxi = 0\nfor i in g:\n\tmaxi = max(maxi, g[i])\nprint(maxi)\n \t \t \t\t\t \t\t\t\t \t \t\t \t\t\t", "def max_depth(vertex=0, counter=1):\r\n global answer\r\n answer = max(answer, counter)\r\n if graph.get(vertex, False):\r\n for value in graph[vertex]:\r\n max_depth(value, counter + 1)\r\n\r\n\r\nn = int(input())\r\nnames_id = dict()\r\nnames_id[\"Polycarp\"] = 0\r\ngraph = dict()\r\nfor i in range(1, n + 1):\r\n s = input().split()\r\n s[0] = s[0].title()\r\n s[2] = s[2].title()\r\n names_id[s[0]] = i\r\n if graph.get(names_id[s[2]], False):\r\n graph[names_id[s[2]]].append(names_id[s[0]])\r\n else:\r\n graph[names_id[s[2]]] = [names_id[s[0]]]\r\nanswer = 0\r\nmax_depth()\r\nprint(answer)", "n = int(input())\n\ndict = {}\n\nmaxi = 2\n\nfor i in range(n):\n line = input().split(' ')\n if line[2].lower() == 'polycarp':\n dict[line[0].lower()] = 2\n else:\n dict[line[0].lower()] = dict[line[2].lower()] + 1\n if dict[line[0].lower()] > maxi:\n maxi = dict[line[0].lower()]\n\nprint(maxi)\n\t \t\t\t \t\t \t \t \t \t\t \t \t\t", "n = int(input())\r\nd = dict()\r\nd['polycarp'] = 1\r\nmaximum = 1\r\nfor _ in range(n):\r\n a = input().split()\r\n From = a[2].lower()\r\n To = a[0].lower()\r\n d[To] = d[From]+1\r\n maximum = max(maximum, d[To])\r\nprint(maximum)", "# http://codeforces.com/problemset/problem/522/A\r\nimport sys\r\nimport re\r\nimport collections\r\n\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef dfs(pos):\r\n visit[pos] = 1\r\n length = len(edges[pos])\r\n\r\n for i in range(length):\r\n if visit[edges[pos][i]] != 1:\r\n depth[edges[pos][i]] = depth[pos] + 1\r\n dfs(edges[pos][i])\r\n\r\nn = int(sys.stdin.readline())\r\na = [sys.stdin.readline().strip().lower().split(\" reposted \") for i in range(n)]\r\n\r\nnode = ['polycarp']\r\n\r\nfor i in range(n):\r\n for j in range(1, -1, -1):\r\n if a[i][j] not in node:\r\n node.append(a[i][j])\r\n\r\nfor i in range(n):\r\n for j in range(1, -1, -1):\r\n for k in range(len(node)):\r\n if a[i][j] == node[k]:\r\n a[i][j] = k\r\n\r\nnode_len = len(node)\r\nedges = [[] for i in range(node_len)]\r\nvisit = [0] * node_len\r\ndepth = [0] * node_len\r\n\r\nfor i in range(n):\r\n edges[a[i][0]].append(a[i][1])\r\n edges[a[i][1]].append(a[i][0])\r\n\r\ndepth[0] = 1\r\ndfs(0)\r\n\r\nprint(max(depth))", "from collections import defaultdict\r\n\r\n\r\ngraph = defaultdict(list)\r\n\r\nfor _ in range(int(input())):\r\n arr = [r for r in input().split()]\r\n a , b = arr[0].lower() , arr[2].lower()\r\n graph[b].append(a)\r\n\r\ndef dfs(s):\r\n if len (graph[s]) == 0:\r\n return 0\r\n # print('test')\r\n ans = 0\r\n for ss in graph[s]:\r\n ans = max(ans , dfs(ss)+1) \r\n return ans\r\n\r\nprint(dfs('polycarp')+1)", "m = 0\r\nd={'polycarp':1}\r\nfor _ in range(int(input())):\r\n a,b,c=input().lower().split()\r\n d[a]=d[c]+1\r\n m = max(d[a],m)\r\nprint(m)", "class Node(object):\n def __init__(self, value=None):\n self.value = value\n self.children = []\n\n def set_value(self, new_value):\n self.value = new_value\n\n\nclass Tree(object):\n def __init__(self):\n self.root = Node()\n\n def add_node(self, curr_node, new_node):\n curr_node.children.append(new_node)\n return new_node\n\n def search(self, item):\n q = [self.root]\n while (len(q) != 0):\n node = q.pop()\n if node.value == item:\n return node\n else:\n q += node.children\n return None\n\n def height(self, node):\n if len(node.children) == 0:\n return 0\n else:\n return max([self.height(x) for x in node.children]) + 1\n\n\ndef transfrom_string(raw):\n arr = [x.lower() for x in raw.split(\" \")]\n return [arr[2], arr[0]]\n\n\ndef read_data():\n n = int(input())\n data = []\n for i in range(0, n):\n data.append(transfrom_string(input()))\n return data\n\n\ndef solution(data):\n tree = Tree()\n tree.root.set_value(\"polycarp\")\n\n for arr in data:\n _from = arr[0]\n _to = arr[1]\n node = tree.search(_from)\n new_node = tree.add_node(node, Node(_to))\n\n return tree.height(tree.root) + 1\n\ndata = read_data()\nprint(solution(data))\n", "num_posts = int(input())\nrepost_length = {}\nrepost_length['polycarp'] = 1\nfor _ in range(num_posts):\n name1, _, name2 = input().lower().split(' ')\n repost_length[name1] = repost_length[name2] + 1\nprint(max(repost_length.values()))\n\t \t \t \t\t\t \t\t\t \t \t \t \t \t", "class Tree:\n def __init__(self, value, children=[]):\n self.value = value\n self.children = list(children)\n\n def is_leaf(self):\n return not self.children\n\n def add_child_tree(self, child):\n self.children.append(Tree(child))\n\n def depth(self):\n if self.is_leaf():\n return 1\n else:\n d_list = list()\n for ch in self.children:\n d_list.append(1 + ch.depth())\n return max(d_list)\n\ndef addCorrectChild(reposter, op, curr):\n if curr.value == op:\n curr.add_child_tree(reposter)\n else:\n for child in curr.children:\n addCorrectChild(reposter, op, child)\n\nnum = int(input())\nlit_list = [input().lower().split(\" reposted \") for _ in range(num)]\n\ntree = Tree(\"polycarp\")\nfor i in range(num):\n reposter = lit_list[i][0]\n op = lit_list[i][1]\n addCorrectChild(reposter, op, tree)\n\nprint(tree.depth())\n", "n = int(input())\r\ntree = {}\r\n\r\ndef depth(root):\r\n if root not in tree:\r\n return 1\r\n \r\n return 1 + max([ depth(node) for node in tree[root] ]) \r\n\r\nfor i in range(n):\r\n s = input()\r\n\r\n child, _, parent = s.split(' ')\r\n\r\n child, parent = child.lower(), parent.lower()\r\n \r\n if parent not in tree:\r\n tree[parent] = [ child ]\r\n else:\r\n tree[parent].append(child)\r\n \r\n\r\nroot = 'polycarp'\r\nprint(depth(root))", "n=int(input())\r\nd={}\r\ndis={}\r\narr={}\r\ndef bfs(a,dist):\r\n cnt=1\r\n dis[a]=dist\r\n arr[a]=1\r\n queue=[]\r\n queue.append(a)\r\n while(len(queue)):\r\n s=queue.pop(0)\r\n for i in d[s]:\r\n if arr[i]==0:\r\n queue.append(i)\r\n dis[i]=dis[s]+1\r\n arr[i]=1\r\n cnt=max(cnt,dis[i])\r\n return cnt\r\n \r\n \r\nfor i in range(n):\r\n a,b,c=map(str,input().split())\r\n dis[a.lower()]=dis[c.lower()]=arr[a.lower()]=arr[c.lower()]=0\r\n if c.lower() in d:\r\n d[c.lower()].append(a.lower())\r\n else:\r\n d[c.lower()]=[a.lower()]\r\n if a.lower() not in d:\r\n d[a.lower()]=[]\r\nx=bfs('polycarp',1)\r\nprint(x)\r\n", "import operator\r\ndic = dict()\r\ndic[\"polycarp\"] = 1\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n cur = input().split()\r\n who = cur[0].lower()\r\n whom = cur[2].lower()\r\n dic[who] = dic[whom] + 1\r\n\r\nm = max(dic.items(), key=operator.itemgetter(1))[0]\r\nprint(dic[m])", "def main():\r\n x = int(input())\r\n d = dict()\r\n d['polycarp'] = 1\r\n a = []\r\n for i in range(x):\r\n f = input().split()\r\n f[0] = f[0].lower()\r\n f[2] = f[2].lower()\r\n d[f[0]] = d[f[2]] + 1\r\n a.append(f[0])\r\n m = 0\r\n for i in a:\r\n if (d[i] > m):\r\n m = d[i]\r\n print(m)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 3 21:05:03 2023\r\n\r\n@author: rohan\r\n\"\"\"\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nadj = defaultdict(list)\r\n\r\nfor i in range(n):\r\n u, v = input().split(\" reposted \")\r\n adj[v.lower()].append(u)\r\n\r\nvis = set()\r\ndef solve(i):\r\n vis.add(i)\r\n ans = 0\r\n for j in adj[i]:\r\n ans = max(ans, solve(j.lower()) + 1)\r\n\r\n return ans\r\n\r\nprint(solve('polycarp') + 1)\r\n", "t=int(input())\r\nfrom collections import defaultdict\r\ndic=defaultdict(int)\r\ndic[\"polycarp\"]=1\r\nfor i in range(t):\r\n lis=list(map(str,input().split()))\r\n lis[0]=lis[0].lower()\r\n lis[2]=lis[2].lower()\r\n dic[lis[0]]=dic[lis[2]]+1\r\nans=0\r\nfor i in dic:\r\n if dic[i]>ans:\r\n ans=dic[i]\r\nprint(ans)\r\n ", "def DFS(name):\r\n if name not in graph:\r\n return 0\r\n return max([DFS(n) for n in graph[name]]) + 1\r\nn= int(input())\r\ngraph = {}\r\nfor i in range(n):\r\n repost = input().split()\r\n name1 = repost[0].lower()\r\n name2 = repost[2].lower()\r\n if name2 not in graph:\r\n graph[name2] = set()\r\n graph[name2].add(name1)\r\n\r\nprint(DFS(\"polycarp\") + 1)", "class Repost:\r\n def __init__(self, name1, name2, reposts):\r\n self.reposted = name2.lower()\r\n self.reposter = name1.lower()\r\n self.depth = 1\r\n for repost in reposts:\r\n if repost.reposter == self.reposted:\r\n self.depth = repost.depth + 1\r\n break\r\n\r\n\r\ncount = int(input())\r\n\r\nnotes = []\r\nfor i in range(count):\r\n notes.append(input())\r\n\r\nreposts = []\r\nfor note in notes:\r\n names = note.split(\" \")\r\n new_repost = Repost(names[0], names[2], reposts)\r\n reposts.append(new_repost)\r\n\r\nmax_depth = 0\r\nfor repost in reposts:\r\n if repost.depth > max_depth:\r\n max_depth = repost.depth\r\n\r\nprint(max_depth+1)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\nchain = defaultdict(lambda : 1)\r\n\r\nfor i in range(n):\r\n a,reposted,b = input().split()\r\n a = a.lower()\r\n b = b.lower()\r\n chain[a] = chain[b] + 1\r\n print()\r\nprint(max(chain.values()))", "import sys\r\nsys.setrecursionlimit(10000)\r\n\r\n\r\ndef dfs(now, graf, ln):\r\n ln += 1\r\n if now not in graf:\r\n return ln\r\n else:\r\n m = 0\r\n for j in graf[now]:\r\n ans = dfs(j, graf, ln)\r\n if ans > m:\r\n m = ans\r\n return m\r\n\r\n\r\nn = int(input())\r\nreposts = {}\r\nfor i in range(n):\r\n a, b = input().split(' reposted ')\r\n reposts[b.lower()] = reposts.pop(b.lower(), []) + [a.lower()]\r\nprint(dfs('polycarp', reposts, 0))\r\n", "import math\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tadj = {}\r\n\tvis = {}\r\n\tadj['polycarp'] = []\r\n\tfor i in range(n):\r\n\t\ts = [str(x).lower() for x in input().split()]\r\n\t\tif(s[2] not in adj):\r\n\t\t\tadj[s[2]] = [s[0]]\r\n\t\t\tvis[s[2]] = False\r\n\t\telse:\r\n\t\t\tadj[s[2]].append(s[0])\r\n\t\tif(s[0] not in adj):\r\n\t\t\tadj[s[0]] = []\r\n\t\t\tvis[s[0]] = False\r\n\tq = []\r\n\tq.append('polycarp')\r\n\tans = 0\r\n\tsz = 1\r\n\twhile(len(q)!=0):\r\n\t\ttsz = sz\r\n\t\tsz=0\r\n\t\twhile(tsz!=0):\r\n\t\t\tfront = q.pop(0)\r\n\t\t\tvis[front] = True\r\n\t\t\tfor j in adj[front]:\r\n\t\t\t\tif(not vis[j]):\r\n\t\t\t\t\tq.append(j)\r\n\t\t\t\t\tsz+=1\r\n\t\t\ttsz-=1\r\n\t\tans+=1\r\n\t# print(adj)\r\n\tprint(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\na = {}\r\nfor i in range(n):\r\n s = input().split(' reposted ')\r\n s1 = s[0].lower()\r\n s2 = s[1].lower()\r\n a[s1] = s2\r\ndef f(s):\r\n global a\r\n \r\n if s in a:\r\n return f(a[s]) + 1\r\n else:\r\n return 1\r\nans = 0\r\nfor i in a:\r\n ans = max(ans, f(i))\r\nprint(ans)\r\n", "dic={'polycarp':1}\nfor _ in range(int(input())):\n a,b,c=input().lower().split()\n dic[a]=dic[c]+1\nprint(max(dic.values()))\n \t \t\t \t\t\t\t \t \t\t\t \t \t \t\t\t", "\nn = int(input())\ng = {}\nm = 2\nfor i in range(n):\n k = input().split()\n a1=k[0].lower()\n a2=k[2].lower()\n num = 1\n if i == 0:\n g[a2] = num\n g[a1] = num + 1\n else:\n num = g[a2] + 1\n g[a1] = num\n if num > m:\n m = num\nprint(m)\n\n\n", "dd={'polycarp':1}\r\nfor _ in range(int(input())):a,b,c=input().lower().split();dd[a]=dd[c]+1\r\nprint(max(dd.values()))\r\n", "n = int(input())\r\n\r\ndct = {\"polycarp\" : 1}\r\n\r\nm = 1\r\nfor i in range(n):\r\n ins = input().split(\" \")\r\n child = ins[0].lower()\r\n depth = dct[ins[2].lower()] + 1\r\n if depth > m:\r\n m = depth\r\n ndct = {child : depth}\r\n dct.update(ndct)\r\n\r\nprint(str(m))\r\n\r\n", "from collections import defaultdict\r\n\r\nn=int(input())\r\nd=defaultdict(list)\r\nfor i in range(n):\r\n s=list(map(str,input().split()))\r\n for i in range(3):\r\n s[i]=s[i].lower()\r\n d[s[2]].append(s[0])\r\nq=list()\r\nq.append('polycarp')\r\nq.append(None)\r\nc=0\r\nb=1\r\nwhile q:\r\n a=q[0]\r\n q.pop(0)\r\n b-=1\r\n if a==None :\r\n c+=1\r\n q.append(None)\r\n else:\r\n if a in d:\r\n a=d[a]\r\n b=len(a)\r\n for i in range(len(a)):\r\n q.append(a[i])\r\n if len(q)==1:\r\n c+=1\r\n break\r\nprint(c)\r\n", "mp = {\"polycarp\": 1}\r\nt = int(input())\r\nwhile t != 0:\r\n string = input().split(\" \")\r\n mp[string[0].lower()] = mp[string[-1].lower()] + 1\r\n t -= 1\r\nmx = 1\r\nfor i in mp.values():\r\n mx = max(mx, i)\r\nprint(mx)\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\n\n #int(input())\n #list(map(int, input().split()))\n #map(int, input().split())\n #n,m = map(int, input().split())\n #graph = defaultdict(list)\n\n #a,b = map(int, input().split())\n #graph[a].append(b)\n #graph[b].append(a)\ndef solution():\n n = int(input())\n graph = defaultdict(list)\n for _ in range(n):\n a, b = input().split(\" reposted \")\n graph[b.lower()].append(a.lower())\n\n mx = [0]\n def dfs(cur, d):\n mx[0] = max(mx[0], d)\n for nbr in graph[cur]:\n dfs(nbr, d + 1)\n\n dfs(\"polycarp\",1)\n print(mx[0])\n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "def main():\n n, ba = int(input()), {}\n for _ in range(n):\n a, _, b = input().lower().split()\n s = ba.get(b)\n if s:\n s.add(a)\n else:\n ba[b] = {a}\n res = 0\n\n def deeper(head, n):\n nonlocal res\n tail = ba.get(head)\n if tail:\n n += 1\n for t in tail:\n deeper(t, n)\n else:\n if res < n:\n res = n\n\n deeper(\"polycarp\", 1)\n print(res)\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\r\na = [list(input().split(sep = \" reposted \")) for i in range(n)]\r\ns = {\"polycarp\" : 1}\r\n\r\nfor i, k in a:\r\n if k.lower() in s.keys():\r\n s[i.lower()] = s[k.lower()] + 1\r\n\r\nprint(max(s.values()))", "n = int(input())\r\n\r\nnames = dict()\r\nnames['polycarp'] = 1\r\nmax = 1\r\n\r\nfor i in range(n):\r\n data = input().strip().split(\" \")\r\n first = data[0].lower()\r\n last = data[2].lower()\r\n names[first] = names[last] + 1\r\n if names[first] > max:\r\n max = names[first]\r\n\r\nprint(max)", "from typing import DefaultDict\r\n\r\n\r\ng = 0\r\nres = g\r\n\r\ndef dfs(p):\r\n global g\r\n g += 1\r\n global res\r\n res = max(g, res)\r\n for w in p:\r\n dfs(b[w])\r\n\r\n g -= 1\r\n return\r\n\r\n\r\nn = int(input())\r\n\r\nb = DefaultDict(list)\r\nfor _ in range(n):\r\n name1, rep, name2 = list(input().split())\r\n b[name2.lower()].append(name1.lower())\r\n\r\ndfs(b[\"polycarp\"])\r\nprint(res)\r\n\r\n", "n = int(input())\r\na = {'polycarp': 1}\r\nfor i in range(n):\r\n t = list(map(str, input().split()))\r\n t[0] = t[0].lower()\r\n t[2] = t[2].lower()\r\n if a.setdefault(t[0],0)<a[t[2]]:\r\n a[t[0]] = a[t[2]]+1\r\nm = 0\r\nd = list(a.values())\r\nfor i in range(len(d)):\r\n m = max(m,d[i])\r\nprint(m)\r\n", "from collections import deque\n\n\ngraph = {}\n\nfor _ in range(int(input())):\n n1, _, n2 = map(str.lower, input().split())\n\n if graph.get(n1, None) == None:\n graph[n1] = []\n\n if graph.get(n2, None) == None:\n graph[n2] = []\n\n graph[n1].append(n2)\n graph[n2].append(n1)\n\n\nusers = graph.keys()\nv2i = {v: i for i, v in enumerate(users)}\n\n\nN = len(users)\n\nqueue = deque()\nqueue.append('polycarp')\n\nvisited = [False] * N\nvisited[v2i['polycarp']] = True\n\nd = [0] * N\n\n\nwhile queue:\n\n i = queue.popleft()\n\n for j in graph[i]:\n if not visited[v2i[j]]:\n queue.append(j)\n visited[v2i[j]] = True\n d[v2i[j]] = d[v2i[i]]+1\n\n\nprint(max(d)+1)\n \t\t \t\t\t\t\t \t \t \t\t\t\t \t \t\t\t\t\t \t", "re_dict={}\r\nmax=0\r\nn=int(input())\r\ni=0\r\nwhile i<n:\r\n str1=input()\r\n str1.strip()\r\n str1=str1.split(\" reposted \")\r\n a=str1[1].strip().lower()\r\n b=str1[0].strip().lower()\r\n if a not in re_dict:\r\n re_dict[a]=1\r\n num=re_dict[a]+1\r\n re_dict[b]=num\r\n if num>max:\r\n max=num\r\n i=i+1\r\nprint(max)\r\n ", "n = int(input())\n\ng = {}\nused = set()\nmax_level = 1\n\ndef dfs(v, level=1):\n\tglobal g, used, max_level\n\t\n\tif level > max_level:\n\t\tmax_level = level\n\t\n\tused.add(v)\n\tif v in g:\n\t\tfor vertex in g[v]:\n\t\t\tif not vertex in used:\n\t\t\t\tdfs(vertex, level+1)\n\ndef main():\n\tfor i in range(n):\n\t\tname1, _, name2 = map(str.lower, input().split())\n\t\tif name2 not in g:\n\t\t\tg[name2] = {name1}\n\t\telse:\n\t\t\tg[name2].add(name1)\n\t\n\tdfs('polycarp')\n\tprint(max_level)\n\nif __name__ == '__main__':\n\tmain()\n", "\r\ndef solve(startnode):\r\n ans = 0\r\n for node in graph[startnode]:\r\n ans = max(ans,solve(node))\r\n return ans+1\r\n\r\n\r\nn = int(input())\r\ndict = {}\r\nkey = 0\r\n\r\ngraph = []\r\n\r\nfor i in range(n):\r\n s = input().lower()\r\n # print(s)\r\n words = s.split()\r\n if words[0] not in dict:\r\n dict[words[0]] = key\r\n graph.append([])\r\n key+=1\r\n if words[2] not in dict:\r\n dict[words[2]] = key\r\n graph.append([])\r\n key+=1\r\n graph[dict[words[2]]].append(dict[words[0]])\r\n\r\nstartNode = dict[\"polycarp\"]\r\n\r\nanswer = solve(startNode)\r\nprint(answer)\r\n\r\n", "n = int(input())\r\nd = {'polycarp':1}\r\nfor _ in range(n):\r\n a = input().lower().split()\r\n d[a[0]] = d[a[2]] + 1\r\nprint(max(d.values()))", "s={}\r\ns[\"polycarp\"]=1\r\nw=0\r\nfor P in range(int(input())):\r\n k,_,t=input().split()\r\n k=k.lower()\r\n s[k]=s[t.lower()]+1\r\n w=max(w,s[k])\r\nprint(w)", "users = {\"polycarp\": 1}\r\nfor _ in range(int(input())):\r\n u_to, s, u_from = map(str.lower, input().split())\r\n users[u_to] = users[u_from] + 1\r\n\r\nprint(max(users.values()))\r\n", "count=[]\r\ndef DFS(d1,d,node,c):\r\n d1[node]=1\r\n c=c+1\r\n for i in d[node]:\r\n DFS(d1,d,i,c)\r\n \r\n count.append(c)\r\n return c\r\n\r\nn=int(input())\r\nd={}\r\nd1={}\r\nfor _ in range(n):\r\n s=input()\r\n y=list(s.split(\" \"))\r\n y[0] = y[0].lower()\r\n y[2] = y[2].lower()\r\n if y[2] not in d.keys():\r\n d[y[2]] = [y[0]]\r\n if y[0] not in d.keys():\r\n d[y[0]] = []\r\n d1[y[2]] = 0\r\n if y[0] not in d1.keys():\r\n d1[y[0]] = 0\r\n else:\r\n d[y[2]].append(y[0])\r\n if y[0] not in d.keys():\r\n d[y[0]] = []\r\n if y[0] not in d1.keys():\r\n d1[y[0]] = 0\r\n\r\n#print(d,d1)\r\nfor i in d1.keys():\r\n if d1[i] ==0:\r\n c=0\r\n DFS(d1,d,i,c)\r\nprint(max(count))\r\n \r\n\r\n ", "def readInt():\r\n return int(input())\r\n\r\ndef readInts():\r\n return map(int, input().split())\r\n\r\ndef readIntList():\r\n return list(map(int, input().split()))\r\n\r\nn = readInt()\r\n\r\ngraph = {}\r\nans = 0\r\n\r\ndef search(node, sum):\r\n global graph\r\n global ans\r\n\r\n if graph.get(node) == None:\r\n ans = max(ans, sum)\r\n else:\r\n for child in graph[node]:\r\n search(child, sum + 1)\r\n\r\nfor i in range(n):\r\n child, _, parent = map(str.lower, input().split())\r\n if graph.get(parent) == None: graph[parent] = []\r\n graph[parent].append(child)\r\n\r\nfor child in graph['polycarp']:\r\n search(child, 2)\r\n\r\nprint(ans)", "import copy\r\na=[]\r\nb={}\r\nw=0\r\nfor o in range(int(input())):\r\n t=[i.lower() for i in input().split()]\r\n try:\r\n a[b[t[2]]]+=[t[0]]\r\n except:\r\n b[t[2]]=w\r\n a+=[[t[0]]]\r\n w+=1\r\nc=[1]*len(a)\r\nx=['polycarp']\r\ny=[]\r\nj=1\r\nwhile True:\r\n for i in x:\r\n try:\r\n y+=a[b[i]]\r\n except:pass\r\n if y==[]:\r\n break\r\n else:\r\n j+=1\r\n x=copy.copy(y)\r\n y=[]\r\nprint(j)\r\n", "from collections import defaultdict\r\n\r\ndef dfs(arg):\r\n for i in g[arg]:\r\n dist[i]=dist[arg]+1\r\n dfs(i)\r\n\r\nn = int(input())\r\n\r\ng = defaultdict(list)\r\ndist = defaultdict(int)\r\nfor _ in range(n):\r\n s=input().lower().split(' reposted ')\r\n g[s[1]].append(s[0])\r\n dist[s[0]]=1\r\n dist[s[1]]=1\r\n\r\ndfs('polycarp')\r\nprint(max(dist.values()))", "lenth = 0\r\ndef dfs(Author, depth):\r\n global u\r\n global lenth\r\n s = ''\r\n if Author not in u:\r\n if depth > lenth: lenth = depth\r\n return\r\n for s in u[Author]:\r\n dfs(s, depth+1)\r\nn = int(input())\r\ni = 1\r\nu = dict()\r\nfor i in range(0,n):\r\n Reposter, Author = input().split(' reposted ')\r\n Reposter = Reposter.lower()\r\n Author = Author.lower()\r\n if Author not in u: u[Author] = list()\r\n u[Author].append(Reposter)\r\n# print(u)\r\ndfs('polycarp', 1)\r\nprint(lenth)\r\n", "n = int(input())\r\nstr = [input().lower() for i in range(n)]\r\nr = []\r\nall = []\r\nfor i in range(n):\r\n tmp = str[i].split(\" \")\r\n r.append((tmp[0], tmp[2]))\r\n if not (r[i][1] in all):\r\n all.append(r[i][1])\r\n if not (r[i][0] in all):\r\n all.append(r[i][0])\r\nl = len(all)\r\ng = [list() for i in range(l)]\r\nfor i in range(n):\r\n a = all.index(r[i][0])\r\n b = all.index(r[i][1])\r\n g[a].append(b)\r\n g[b].append(a)\r\nused = [0 for i in range(l)]\r\nd = [0 for i in range(l)]\r\nq = [0]\r\nd[0] = 1\r\nused[0] = 1\r\nwhile len(q) > 0:\r\n v = q.pop(0)\r\n for i in range(len(g[v])):\r\n to = g[v][i]\r\n if used[to] == 0:\r\n q.append(to)\r\n d[to] = d[v] + 1\r\n used[to] = 1\r\nprint(max(d))", "from collections import defaultdict\r\nn = int(input())\r\nid =0\r\nuser_dict = dict()\r\nadj_list = defaultdict(list)\r\nfor i in range(n):\r\n ua, ub = input().split(' ')[0::2]\r\n ua = ua.lower()\r\n ub = ub.lower()\r\n if ua not in user_dict:\r\n user_dict[ua] = id\r\n a = id\r\n id+=1\r\n else:\r\n a = user_dict[ua]\r\n\r\n if ub.lower() not in user_dict:\r\n user_dict[ub] = id\r\n b = id\r\n id+=1\r\n else:\r\n b = user_dict[ub]\r\n\r\n adj_list[b].append(a)\r\n\r\n\r\nvisited = set()\r\nans = 0\r\ndef dfs(i, depth):\r\n global ans\r\n\r\n visited.add(i)\r\n flag = False\r\n for k in adj_list[i]:\r\n if k not in visited:\r\n dfs(k, depth+1)\r\n flag = True \r\n if not flag:\r\n ans = max(ans, depth)\r\n\r\ndfs(user_dict[\"polycarp\"], 1)\r\nprint(ans)\r\n", "\r\nfrom collections import deque,defaultdict\r\nclass Graph:\r\n\r\n\t# Intialisation of graph\r\n\tdef __init__(self):\r\n\r\n\t\t# No. of vertices\r\n\t\t\r\n\r\n\t\t# adjacency list\r\n\t\tself.adj = defaultdict()\r\n\tdef addEdge(self, u, v):\r\n if u in self.adj:\r\n self.adj[u].append(v)\r\n else:\r\n self.adj[u]=[v]\r\n if v in self.adj:\r\n self.adj[v].append(u)\r\n else:\r\n self.adj[v]=[u]\r\n\tdef BFS(self, u):\r\n #visited = [False for i in range(len(self.adj) + 1)]\r\n # mark all distance with -1\r\n distance={}\r\n distance = defaultdict(lambda: 0, distance)\r\n # distance of u from u will be 0\r\n visited={}\r\n visited =defaultdict(lambda: False, visited)\r\n # in-built library for queue which performs fast oprations on both the ends\r\n queue = deque()\r\n queue.append(u)\r\n # mark node u as visited\r\n visited[u] = True\r\n while queue:\r\n # pop the front of the queue(0th element)\r\n front = queue.popleft()\r\n # loop for all adjacent nodes of node front\r\n\r\n for i in self.adj[front]:\r\n if not visited[i]:\r\n # mark the ith node as visited\r\n visited[i] = True\r\n # make distance of i , one more than distance of front\r\n distance[i] = distance[front]+1\r\n # Push node into the stack only if it is not visited already\r\n queue.append(i)\r\n maxDis = 0\r\n # get farthest node distance and its index\r\n for i in self.adj:\r\n if distance[i] > maxDis:\r\n\r\n maxDis = distance[i]\r\n nodeIdx = i\r\n return nodeIdx, maxDis\r\n # method prints longest path of given tree\r\n\tdef LongestPathLength(self):\r\n\t\t# first DFS to find one end point of longest path\r\n\t\tnode, Dis = self.BFS('polycarp')\r\n\t\t# second DFS to find the actual longest path\r\n\t\t\r\n\t\tprint( Dis+1)\r\nt=int(input())\r\ng=Graph()\r\ns=[]\r\nfor _ in range(t):\r\n s=list(input().split(' '))\r\n g.addEdge(s[0].lower(),s[2].lower())\r\n #print(s[0],s[2])\r\ng.LongestPathLength()\r\n \r\n \r\n", "d={'polycarp':1}\r\nfor _ in range(int(input())):\r\n x,y,z=input().lower().split()\r\n d[x]=d[z]+1\r\nprint(max(d.values()))", "'''\nCreated on 2016-4-18\n\n@author: chronocorax\n'''\nn = int(input())\nfrom collections import defaultdict\n# children = defaultdict(lambda: [])\nfather = defaultdict(lambda: None)\nheights = defaultdict(lambda: None)\ndef lk(s): return s.lower()\nfor _ in range(n):\n words = input().split()\n# children[lk(words[2])].append(lk(words[0]))\n father[lk(words[0])] = lk(words[2])\n\nmaxHeight = 0\ndef height(word):\n if not father[lk(word)]: return 1\n elif heights[lk(word)]: return heights[lk(word)]\n else:\n heights[lk(word)] = height(father[lk(word)]) + 1\n return heights[lk(word)]\n \nfor word in list(father):\n if maxHeight < height(word): maxHeight = height(word)\n\nprint(maxHeight)\n ", "n = int(input())\ne = {}\nfor _ in range(n):\n r = input().split()\n r1 = r[2].lower()\n r0 = r[0].lower()\n if r1 in e:\n e[r1].append(r0)\n else:\n e[r1] = [r0]\n\ndef h(n):\n if n not in e:\n return 0\n x = []\n for c in e[n]:\n x.append(h(c))\n return 1 + max(x)\n\nr = \"polycarp\"\nprint(h(r) + 1)\n", "n=int(input())\n\n\n\nlevel=1\nd={'polycarp':0}\nc=1\narr=[]\nfor i in range(n):\n\tinp=input().lower().split()\n\tarr.append(inp)\n\tif(inp[0] not in d):\n\t\td[inp[0]]=c\n\t\tc+=1\n\tif(inp[2] not in d):\n\t\td[inp[2]]=c\n\t\tc+=1\n# print(d)\nadj=[]\nvis=[]\nfor i in range(n+1):\n\tadj.append([])\n\tvis.append(False)\n\nfor i in range(n):\n\tq=arr[i]\n\ta=d[q[0]]\n\tb=d[q[2]]\n\tadj[b].append(a)\n\ndef dfs(s,v):\n\tglobal level\n\tif(level<v):\n\t\tlevel=v\n\tvis[s]=True\n\t# print(s,adj[s])\n\tfor i3 in range(len(adj[s])):\n\t\tchild=adj[s][i3]\n\t\tif(vis[child]==False):\n\t\t\tdfs(child,v+1)\n\ndfs(0,level)\n\nprint(level)\n\n\n\n", "#*special problem----dfs and similar-----dp------graphs------trees-------*1700\r\n\r\nclass Edge(object):\r\n def __init__(self, src, dest):\r\n self.src=src\r\n self.dest=dest\r\n \r\n def getSource(self):\r\n return self.src\r\n \r\n def getDestination(self):\r\n return self.dest\r\n \r\n def __str__(self):\r\n return str(self.src)+'->'+str(self.dest)\r\n\r\nclass Graph(object):\r\n def __init__(self):\r\n self.edges=dict()\r\n \r\n def addNode(self, node):\r\n if node in self.edges:\r\n return ValueError('Duplicate node')\r\n else:\r\n self.edges[node]=[]\r\n \r\n def addEdge(self, edge):\r\n src=edge.getSource()\r\n dest=edge.getDestination()\r\n if src not in self.edges :\r\n return ValueError('Source node absent')\r\n if dest in self.edges[src]: return #duplicate edge\r\n self.edges[src].append(dest)\r\n #self.edges[dest].append(src)\r\n\r\n def childrenOf(self, node):\r\n return self.edges[node]\r\n\r\n def hasNode(self, node):\r\n return node in self.edges\r\n\r\n def __str__(self):\r\n result = ''\r\n for src in self.edges:\r\n for dest in self.edges[src]:\r\n result = result + str(src) + '->' + str(dest) + '\\n'\r\n \r\n return result[:-1] #omit final newline\r\n\r\nn=int(input())\r\ngraph= Graph()\r\nrootNode='polycarp'\r\ngraph.addNode(rootNode)\r\n\r\nfor i in range(n):\r\n inp= input().lower().split()\r\n if inp[0] not in graph.edges: graph.addNode(inp[0])\r\n\r\n parent = inp[2]\r\n if parent not in graph.edges: graph.addNode(parent)\r\n \r\n graph.addEdge(Edge(parent, inp[0]))\r\n\r\ndef findHeight(graph, rootNode):\r\n if len(graph.edges[rootNode])==0: return 1\r\n else:\r\n maxSubtreeHeight=0\r\n for child in graph.edges[rootNode] :\r\n h=1+findHeight(graph, child)\r\n maxSubtreeHeight=max(maxSubtreeHeight, h)\r\n\r\n return maxSubtreeHeight\r\n\r\nprint(findHeight(graph, rootNode))", "n = int(input())\n\ngeneration = {}\ngeneration['polycarp'] = 1\nmaxGeneration = 1\n\nfor _ in range(n):\n new, _, old = [ele.lower() for ele in input().split(\" \")]\n generation[new] = generation[old] + 1\n maxGeneration = max(generation[new], maxGeneration)\n\nprint(maxGeneration)", "from collections import defaultdict\r\nd = defaultdict(list)\r\nres = 1\r\nfor _ in range(int(input())):\r\n li = list(input().split())\r\n d[li[-1].upper()].append(li[0].upper())\r\n\r\n\r\ndef bfs(s):\r\n res = 0\r\n vis = []\r\n q = [s]\r\n q.append(-1)\r\n while q:\r\n s = q[0]\r\n if s == -1:\r\n res += 1\r\n q.pop(0)\r\n if q != []:\r\n q.append(-1)\r\n elif s not in vis:\r\n vis.append(s)\r\n q.pop(0)\r\n for node in d[s]:\r\n if node not in vis:\r\n q.append(node)\r\n else:\r\n q.pop(0)\r\n for node in d[s]:\r\n if node not in vis:\r\n q.append(node)\r\n return res\r\n\r\nk = bfs(\"POLYCARP\")\r\nprint(k)", "n = int(input())\r\nreposters = {'polycarp':1}\r\nmaxDeep = 1\r\nfor i in range(n):\r\n\ta, b, c = map(str, input().lower().split())\r\n\te = reposters[c] + 1\r\n\tmaxDeep = max(maxDeep, e)\r\n\treposters[a] = e\r\nprint(maxDeep)", "n = int(input())\r\n\r\nl = [('polycarp',1)]\r\n\r\ndef find(s):\r\n\tfor x in l:\r\n\t\tif x[0] == s:\r\n\t\t\treturn x[1]\r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\ts=s.lower()\r\n\ts=s.split() \r\n\tl.append((s[0],find(s[2])+1))\r\n\r\nm = 1\r\nfor y in l:\r\n\tif y[1]>m:\r\n\t\tm = y[1]\r\nprint(m)", "n = int(input())\r\ndc = {}\r\nst = set()\r\nfor i in range(n):\r\n s = input().lower().split()\r\n st.add(s[0])\r\n st.add(s[2])\r\n if s[2] in dc.keys():\r\n dc[s[2]].append(s[0])\r\n else:\r\n dc[s[2]] = [s[0]]\r\nused = {}\r\nfor i in st:\r\n used[i] = 0\r\nused['polycarp'] = 1\r\nQ = ['polycarp']\r\nQstart = 0\r\nwhile Qstart < len(Q):\r\n u = Q[Qstart]\r\n if u in dc.keys():\r\n for i in dc[u]:\r\n used[i] = used[u] + 1\r\n Q.append(i)\r\n Qstart += 1\r\nmax = 0\r\nfor i in used.keys():\r\n if used[i] > max:\r\n max = used[i]\r\nprint(max)", "#!/usr/bin/env python3\n\nfrom math import *\nfrom itertools import *\nfrom collections import *\nfrom bisect import *\n\n\nif __name__ == '__main__':\n g = [[] for _ in range(210)]\n idx = 0\n name = dict()\n n = int(input())\n\n for _ in range(n):\n a, _, b = input().lower().split()\n if a not in name:\n name[a] = idx\n idx += 1\n if b not in name:\n name[b] = idx\n idx += 1\n v = name[a]\n u = name[b]\n\n g[u].append(v)\n\n depth = [-1 for _ in range(210)]\n root = name['polycarp']\n depth[root] = 0\n q = deque([root])\n while len(q):\n u = q.popleft()\n for v in g[u]:\n if depth[v] == -1:\n depth[v] = depth[u]+1\n q.append(v)\n\n print(max(depth)+1)\n\n", "from collections import defaultdict\r\n\r\ng = defaultdict(list)\r\nlevel = defaultdict(int)\r\n\r\ndef dfs(node, par):\r\n level[node] = level[par] + 1\r\n for child in g[node]:\r\n if child == par:\r\n continue\r\n dfs(child, node)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n for _ in range(n):\r\n u, r, v = input().split(\" \")\r\n u, v = u.lower(), v.lower()\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n # print(g.items())\r\n\r\n dfs(\"polycarp\", \"null\")\r\n popularity = -1\r\n # print(level.values())\r\n \r\n for key, value in level.items():\r\n popularity = max(popularity, value)\r\n print(popularity)", "n = int(input())\nd = {'POLYCARP' : 1}\n\nfor i in range(n):\n a, r, b = input().split()\n d[a.upper()] = d[b.upper()] + 1\nprint(max(d.values()))\n \n \n", "Dic={}\r\nDic['POLYCARP']=1\r\nm=1\r\nn=int(input())\r\nfor i in range(n):\r\n name1,do,name2=[i.upper() for i in input().split()]\r\n t=Dic[name2]+1\r\n Dic[name1]=t\r\n if t>m :\r\n m=t\r\nprint(m)", "userMapper = {}\ni = 0\ntree = [[] for i in range(201)]\nfor _ in range(int(input())):\n user1, reposted, user2 = input().strip().split()\n user1 = user1.lower()\n user2 = user2.lower()\n if not user2 in userMapper:\n userMapper[user2] = i\n i += 1\n if not user1 in userMapper:\n userMapper[user1] = i\n i += 1\n tree[userMapper[user2]].append(userMapper[user1])\ndp = [0]*(len(userMapper)+1)\n\ndef dfs(st, par):\n dp[st] = 1\n mx = 0\n for child in tree[st]:\n if child == par:\n continue\n dfs(child, st)\n mx = max(mx, dp[child])\n dp[st] += mx;\n\n\ndef solution():\n start = userMapper['polycarp']\n dfs(start, None)\n print(dp[start])\n\nsolution()\n", "line = input()\nn = int(line)\n\nheights = dict()\nmaxh = 0\n\nheights['polycarp'] = 1\n\nfor _ in range(n):\n line = input()\n words = line.split(' ')\n publisher = str(words[2]).lower()\n reposter = str(words[0]).lower()\n\n reposter_height = heights[publisher] + 1\n heights[reposter] = reposter_height\n if reposter_height > maxh:\n maxh = reposter_height\n\n\nprint(str(maxh))", "def dfs(x, count, res):\n count += 1\n for y in child[x]:\n dfs(y, count, res)\n res.append(count)\n\nn = int(input())\npeople = []\nip = []\nfor x in range(n):\n temp = input()\n ip.append(temp)\n temp = temp.split(' ')\n if temp[2].lower() not in people:\n people.append(temp[2].lower())\n if temp[0] not in people:\n people.append(temp[0].lower())\nchild = []\nfor x in range(len(people)):\n child.append([])\nfor x in range(len(people)):\n nodename = people[x].lower()\n for y in ip:\n temp = y.split(' ')\n if temp[2].lower() == nodename:\n ch = people.index(temp[0].lower())\n child[x].append(ch)\nres = []\n\ncount = 0\nres = []\ndfs(0, count, res) \nprint(max(res))\n \t\t\t \t \t\t \t\t \t\t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Dec 18 13:31:07 2020\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\n\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\n\r\nclass graph:\r\n def __init__(self):\r\n self.g=defaultdict(list)\r\n def addedge(self,u,v):\r\n self.g[u.lower()].append(v.lower())\r\n\r\n\r\ndef bfs(gra,start):\r\n q=deque()\r\n q.append([start,1])\r\n maximum=float('-inf')\r\n while q:\r\n value,level=q.popleft()\r\n maximum=max(maximum,level)\r\n for val in gra[value]:\r\n q.append([val,level+1])\r\n return maximum\r\ng=graph()\r\nn=int(input())\r\nfor i in range(n):\r\n value=input().split()\r\n g.addedge(value[2], value[0])\r\ngra=g.g\r\nprint(bfs(gra,'polycarp'))", "n=int(input())\r\ndp={'polycarp':1}\r\nfor i in range(n):\r\n a,b,c=input().lower().split()\r\n dp[a]=dp[c]+1\r\nprint(max(dp.values()))\r\n \r\n", "A='QWERTYUIOPASDFGHJKLZXCVBNM'\r\na='qwertyuiopasdfghjklzxcvbnm'\r\nb=[]\r\nc=[]\r\nn=int(input())\r\nfor i in range(n):\r\n N1,N2=input().lower().split(' reposted ')\r\n if not N2 in b:\r\n b.append(N2)\r\n c.append(1)\r\n if not N1 in b:\r\n b.append(N1)\r\n c.append(c[b.index(N2)]+1)\r\n else:\r\n c[b.index(N1)]=max(c[b.index(N2)]+1,c[b.index(N1)])\r\nprint(sorted(c)[-1])", "d={\"Polycarp\".lower():1}\nc=1\nn=int(input())\nfor i in range(n):\n\tx,y=input().lower().split(\" reposted \")\n\td[x]=d[y]+1\n\tc=max(c,d[x])\nprint(c)\n \t \t \t\t \t \t \t", "def lc(s):\r\n ss=''\r\n for i in s:\r\n if ord(i)<97: ss+=chr(ord(i)+32)\r\n else: ss+=i\r\n return ss \r\nn=int(input())\r\ndic={'polycarp':1}\r\nfor i in range(n):\r\n s=input().split()\r\n s1=lc(s[0])\r\n s2=lc(s[2])\r\n if not(s2 in dic): dic[s2]=0\r\n dic[s1]=dic[s2]+1\r\nprint(max(dic.values()))\r\n\r\n\r\n##//////////////// ////// /////// // /////// // // //\r\n##//// // /// /// /// /// // /// /// //// //\r\n##//// //// /// /// /// /// // ///////// //// ///////\r\n##//// ///// /// /// /// /// // /// /// //// // //\r\n##////////////// /////////// /////////// ////// /// /// // // // //\r\n\r\n\r\n\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\ndef dfs(s, l):\n\tglobal g, ans\n\tans=max(ans, l)\n\ttry:\n\t\tfor v in g[s]:\n\t\t\tdfs(v, l+1)\n\texcept:\n\t\tpass\ng={}\nn=II()\nfor _ in range(n):\n\ta, b, c=SI().upper().split()\n\ttry:\n\t\tg[c].append(a)\n\texcept:\n\t\tg[c]=[a]\nans=0\ndfs('Polycarp'.upper(), 1)\nprint(ans)", "def dfs(v, graph, used, k):\r\n ans[0] = max(ans[0], k)\r\n used.add(v)\r\n for u in graph[v]:\r\n if u not in used:\r\n dfs(u, graph, used | {u}, k+1)\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n graph = {'polycarp': []}\r\n used = set()\r\n for i in range(n):\r\n name_1, c, name_2 = (s.lower() for s in input().split())\r\n graph[name_1] = []\r\n graph[name_2].append(name_1)\r\n\r\n dfs('polycarp', graph, set(), 1)\r\n print(ans[0])\r\n\r\n\r\nif __name__ == '__main__':\r\n ans = [0]\r\n solve()\r\n", "# Link to problem : https://codeforces.com/problemset/problem/522/A\n# This one is very easy\n# name1 reposted name2 so count[nam1] = count[name2] + 1 \n\nn = int(input())\nkeep = { 'polycarp' : 1 }\nfor i in range(n):\n s = input().lower().split()\n keep[s[0]] = keep[s[2]] + 1\n\nprint(max(keep.values()))", "n = int(input()); repost = {}\r\nfor i in range(n):\r\n repost[tuple(((input().lower()).split(' reposted ')))] = 0\r\n\r\nsubrep = []\r\nfor i in repost:\r\n subrep.append(i)\r\n if i[1] == 'polycarp':\r\n repost[i] = 2\r\n else:\r\n a = []\r\n for j in subrep:\r\n if j[0] == i[1]:\r\n a.append(repost[j])\r\n repost[i] = max(a) + 1\r\n\r\nprint(max(repost.values()))", "#const\r\ninf = 201\r\n\r\n#functions\r\nsize = 0\r\ndef addName(name) :\r\n global size\r\n size+=1\r\n d[name] = size\r\n \r\n#init\r\nn = int(input())\r\na = [ [inf for j in range(n+1)] for i in range(n+1) ]\r\nd = {'polycarp' : 0}\r\n\r\n#main\r\nfor i in range(n) :\r\n c,b = input().lower().split(' reposted ')\r\n if c not in d.keys() : addName(c)\r\n if b not in d.keys() : addName(b)\r\n a[d[b]][d[c]] = 1\r\n\r\n#bfs\r\ndist = [inf for i in range(n+1)]\r\ndist[0] = 0\r\nq = [0]\r\nfor v in q :\r\n for i in range(n+1) :\r\n if a[v][i]==1 and dist[i]>dist[v]+1 :\r\n q.append(i)\r\n dist[i] = dist[v]+1\r\n#get maximal answer\r\nans = 1\r\nfor i in dist :\r\n if i!=inf and i>ans : ans = i\r\n\r\n#output\r\nprint(ans+1)\r\n\r\n\r\n \r\n\r\n \r\n", "class Node:\r\n\tdef __init__(self, name, length):\r\n\t\tself.name = name\r\n\t\tself.chain_length = length\r\nn_posts = int(input())\r\npoly = Node(\"polycarp\", 1)\r\nnodes = []\r\nmax_length = 1\r\nnodes.append(poly)\r\nfor i in range(n_posts):\r\n\tline = input().lower().split(\" \")\r\n\tfor j in nodes:\r\n\t\tif j.name == line[2]:\r\n\t\t\tnew_node = Node(line[0], j.chain_length + 1)\r\n\t\t\tnodes.append(new_node)\r\n\t\t\tif j.chain_length + 1 > max_length:\r\n\t\t\t\tmax_length = j.chain_length + 1\r\n\r\nprint(max_length)\r\n", "tree = {'polycarp': 1}\r\nn = int(input())\r\nmaxLevel = 1\r\nfor i in range(n):\r\n\treposter, sourcer = input().split(' reposted ')\r\n\treposter = reposter.lower()\r\n\tsourcer = sourcer.lower()\r\n\ttree[reposter] = tree[sourcer] + 1\r\n\tif tree[reposter] > maxLevel:\r\n\t\tmaxLevel = tree[reposter]\r\nprint(maxLevel)", "n = int(input())\r\nchildren = dict()\r\nfor i in range(n):\r\n per1, per2, per3 = input().split()\r\n per1 = list(per1)\r\n per3 = list(per3)\r\n for i in range(len(per1)):\r\n if ord(per1[i]) < 91:\r\n per1[i] = chr(ord(per1[i]) + 32)\r\n per1 = ''.join(per1)\r\n for i in range(len(per3)):\r\n if ord(per3[i]) < 91:\r\n per3[i] = chr(ord(per3[i]) + 32) \r\n per3 = ''.join(per3)\r\n if per3 not in children:\r\n children[per3] = {per1}\r\n else:\r\n children[per3].add(per1)\r\n if per1 not in children:\r\n children[per1] = set()\r\nanswer = []\r\nfrom pprint import *\r\nfrom collections import deque\r\nroot = 'polycarp'\r\nqueue = deque()\r\nqueue.append(root)\r\nhigh = 0\r\nper1 = 1\r\nwhile queue:\r\n per2 = 0\r\n for i in range(per1):\r\n per = queue.pop()\r\n if per in children:\r\n for i in children[per]:\r\n per2 += 1\r\n queue.appendleft(i)\r\n high += 1\r\n per1 = per2\r\nprint(high)", "n=int(input())\r\nname='polycarp'\r\nlink={'polycarp':1}\r\nans=1\r\nh=0\r\nsd=[]\r\nfor i in range(n):\r\n m=input().split()\r\n m.remove('reposted')\r\n for j in m:\r\n sd.append(j.lower())\r\n if h==(n*2-1):\r\n break\r\n link[sd[h]]=link[sd[h+1]]+1\r\n ans=max(ans,link[sd[h]])\r\n h+=2\r\nprint(ans) \r\n \r\n \r\n \r\n", "list_of_handles = []\r\nmax_length_of_each_handle_chain = []\r\n\r\nfor iteration in range(int(input())):\r\n repost_inputs = input().split()\r\n reposter = repost_inputs[0].lower()\r\n repostee = repost_inputs[2].lower()\r\n\r\n if reposter not in list_of_handles:\r\n list_of_handles.append(reposter)\r\n max_length_of_each_handle_chain.append(1)\r\n \r\n if repostee not in list_of_handles:\r\n list_of_handles.append(repostee)\r\n max_length_of_each_handle_chain.append(1)\r\n \r\n repostee_name_index = list_of_handles.index(repostee)\r\n repostee_length = max_length_of_each_handle_chain[repostee_name_index]\r\n\r\n reposter_name_index = list_of_handles.index(reposter)\r\n reposter_length = max([max_length_of_each_handle_chain[reposter_name_index], repostee_length + 1]) \r\n max_length_of_each_handle_chain[reposter_name_index] = reposter_length\r\n\r\nprint(max(max_length_of_each_handle_chain)) \r\n", "from queue import Queue\r\n\r\nn = int(input())\r\nlines = []\r\nusers = set()\r\ntable = {}\r\nused = []\r\n\r\nfor i in range(n):\r\n line = input().lower()\r\n lines.append(line)\r\n users.add(line.split(\" \")[0])\r\n users.add(line.split(\" \")[2])\r\n\r\nfor index, user in enumerate(users):\r\n table[user] = index\r\n\r\ngraph = [[] for i in range(len(table))]\r\nused = [False for i in range(len(table))]\r\ndistances = [0 for i in range(len(table))]\r\n\r\nfor line in lines:\r\n user1 = table[line.split(\" \")[0]]\r\n user2 = table[line.split(\" \")[2]]\r\n graph[user1].append(user2)\r\n graph[user2].append(user1)\r\n\r\nqueue = Queue()\r\npolycarp = table['polycarp']\r\nused[polycarp] = True\r\nqueue.put(polycarp)\r\n\r\nwhile not queue.empty():\r\n vertex = queue.get()\r\n for i in graph[vertex]:\r\n if not used[i]:\r\n queue.put(i)\r\n used[i] = True\r\n distances[i] = distances[vertex] + 1\r\n\r\n\r\nprint(max(distances) + 1)\r\n", "n = int(input())\r\n\r\nans = 1\r\nmp = dict()\r\n\r\nfor _ in range(n):\r\n t, _, f = input().lower().split()\r\n # print('{} -- {}'.format(f, t))\r\n if f in mp.keys():\r\n mp[f].append(t)\r\n else:\r\n mp[f] = [t]\r\n\r\nd = 1\r\n\r\ndef req(curr):\r\n global d, ans, mp\r\n d += 1\r\n if d > ans:\r\n ans = d\r\n \r\n for el in mp[curr]:\r\n if el in mp.keys():\r\n req(el)\r\n \r\n d -= 1\r\n\r\nreq('polycarp')\r\n\r\nprint(ans)", "s = {'polycarp':1}\r\nans = 0\r\nfor _ in range(int(input())):\r\n a = input().split()\r\n s[a[0].lower()] = s[a[2].lower()]+1\r\n ans = max(s[a[0].lower()], ans)\r\nprint(ans)\r\n", "from collections import defaultdict\r\nt = int(input())\r\ngraph = defaultdict(list)\r\nfor _ in range(t):\r\n child,c,parent, = input().split()\r\n first,second = [],[]\r\n for c in child:\r\n if c.isalpha():\r\n first.append(c.upper())\r\n else:\r\n first.append(c)\r\n for c in parent:\r\n if c.isalpha():\r\n second.append(c.upper())\r\n else:\r\n second.append(c)\r\n \r\n child,parent = ''.join(first),''.join(second)\r\n graph[parent].append(child)\r\nans = [0]\r\n\r\ndef dfs(node,val):\r\n if node not in graph:\r\n ans[0] = max(ans[0],val)\r\n for c in graph[node]:\r\n dfs(c,val+1)\r\ndfs('POLYCARP',0)\r\nprint(ans[0]+1)\r\n \r\n \r\n \r\n \r\n ", "'''input\n6\nMike reposted Polycarp\nMax reposted Polycarp\nEveryOne reposted Polycarp\n111 reposted Polycarp\nVkCup reposted Polycarp\nCodeforces reposted Polycarp\n'''\nfrom sys import stdin\ninput = stdin.readline\nimport math\nimport sys\nfrom collections import defaultdict\nsys.setrecursionlimit(10 ** 4)\n\n\ndef dfs(graph, visted, node):\n\tvisited[node] = True\n\n\tl = 1\n\tfor i in graph[node]:\n\t\tif i not in visited: \n\t\t\tl = max(l, 1 + dfs(graph, visted, i))\n\treturn l\n\n\n\n# mains starts\nn = int(input().strip())\ngraph = defaultdict(list)\nfor _ in range(n):\n\tfirst, t, second = list(input().split())\n\tfirst = first.lower()\n\tsecond = second.lower()\n\tgraph[first].append(second)\n\tgraph[second].append(first)\n\nvisited = dict()\nprint(dfs(graph, visited, 'polycarp'))", "\r\nreposted = int(input())\r\nd= {'polycarp': 1}\r\n\r\nfor _ in range(reposted):\r\n line = input()\r\n x,y,z = line.lower().split()\r\n d[x] = d[z]+1\r\nprint(max(d.values()))\r\n", "from queue import Queue\r\ndef bfs(s):\r\n q=Queue()\r\n visited={}\r\n distance={}\r\n for i in (dic):\r\n visited[i]=0\r\n distance[i]=-1\r\n visited[s]=1\r\n distance[s]=1\r\n q.put(s)\r\n while not q.empty():\r\n u=q.get()\r\n #print(u,end=' ')\r\n for i in dic[u]:\r\n if visited[i]==0:\r\n visited[i]=1\r\n distance[i]=distance[u]+1\r\n q.put(i) \r\n #print() \r\n print(max(list(distance.values())))\r\nn=int(input())\r\ndic={}\r\nfor _ in range(n):\r\n u,jj,v=input().split()\r\n u=u.lower()\r\n v=v.lower()\r\n if u in dic:\r\n dic[u].append(v)\r\n else:\r\n dic[u]=[v]\r\n if v in dic:\r\n dic[v].append(u)\r\n else:\r\n dic[v]=[u] \r\nbfs('polycarp') \r\n ", "n=int(input())\r\na=[]\r\nname=set()\r\nname.add(\"polycarp\")\r\nfor i in range(n):\r\n s=list(input().lower().split(\" \"))\r\n a.append([s[0],s[2]])\r\n name.add(s[0])\r\n name.add(s[2])\r\nname=list(name)\r\ndef idx(s):\r\n return name.index(s)\r\ng=[[] for i in range(len(name))]\r\nfor i in range(len(a)):\r\n x,y=a[i]\r\n g[idx(y)].append(idx(x))\r\nstart=idx(\"polycarp\")\r\nans=-1\r\ndef dfs(node,cnt):\r\n global ans\r\n if len(g[node])==0:\r\n ans=max(ans,cnt)\r\n return\r\n for to in g[node]:\r\n dfs(to,cnt+1)\r\ndfs(start,0)\r\nprint(ans+1)", "n=int(input())\r\na=[[\"POLYCARP\",1]]\r\nmaxim=1\r\nfor i in range(n):\r\n s=input().split()\r\n for i in range(len(s[0])):\r\n if(s[0][i]>='a'):\r\n s[0]=s[0][:i]+chr(ord(s[0][i])-(ord('a')-ord('A')))+s[0][i+1:]\r\n for i in range(len(s[2])):\r\n if(s[2][i]>='a'):\r\n s[2]=s[2][:i]+chr(ord(s[2][i])-(ord('a')-ord('A')))+s[2][i+1:]\r\n x=-1\r\n for i in range(len(a)):\r\n if a[i][0]==s[2]:\r\n a.append([s[0],a[i][1]+1])\r\n maxim=max(maxim,a[i][1]+1)\r\n break\r\nprint(maxim)", "a = [('polycarp',1)]\r\nn = int(input())\r\nfor i in range(n):\r\n x,y = input().lower().split(' reposted ')\r\n for z in a:\r\n if y == z[0]:\r\n a.append((x,z[1]+1))\r\nm = 0\r\nfor i in a:\r\n if m < i[1]:\r\n m = i[1]\r\nprint(m)", "from sys import stdin\ninput = stdin.readline\n\ndef dfs(p , dept):\n\n global ans\n if(p not in d):\n ans = max(ans , dept)\n return \n\n for i in d[p]:\n dfs(i , dept + 1) \n\nfor T in range(1):\n\n n = int(input())\n\n d = dict()\n \n for i in range(n):\n s = input().split()\n\n try:\n d[s[2].lower()].append(s[0].lower())\n except:\n d[s[2].lower()] = [s[0].lower()]\n\n\n ans = 0\n dfs('polycarp' , 1)\n\n print(ans)\n\n\t\t\t \t \t\t\t \t \t \t \t \t \t", "from collections import defaultdict\r\ndef dfs(graph,vis,start,ans):\r\n vis[start]=True\r\n for neighbour in graph[start]:\r\n if vis[neighbour]==False:\r\n ans[neighbour]=ans[start]+1\r\n dfs(graph,vis,neighbour,ans)\r\nn=int(input())\r\ngraph=defaultdict(list)\r\nfor i in range(n):\r\n name1,x,name2=map(str,input().split())\r\n name1=name1.upper()\r\n name2=name2.upper()\r\n graph[name1].append(name2)\r\n graph[name2].append(name1)\r\nvisited={}\r\nans={}\r\nfor i in graph:\r\n visited[i]=False\r\n ans[i]=0\r\nans['POLYCARP']=1\r\ndfs(graph,visited,'POLYCARP',ans)\r\nmaxi=0\r\nfor i in ans:\r\n maxi=max(maxi,ans[i])\r\nprint(maxi)", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\ntree = defaultdict(list)\r\nfor _ in range(n):\r\n \r\n child, _ , parent = input().split()\r\n tree[parent.lower()].append(child.lower())\r\n\r\nstack = ['polycarp']\r\nans = [0]\r\ndef maxdepth(root, depth = 1):\r\n \r\n if not tree[root]:\r\n ans[0] = max(ans[0], depth)\r\n return\r\n for child in tree[root]:\r\n maxdepth(child, depth + 1)\r\n \r\nmaxdepth('polycarp',1)\r\n\r\nprint(ans[0])", "from collections import defaultdict\r\nn = int(input())\r\ngraph = defaultdict(list)\r\nfor _ in range(n):\r\n name1, word, name2 = list(input().split())\r\n name1, name2 = name1.lower(), name2.lower()\r\n graph[name2].append(name1)\r\n\r\n\r\ndef dfs(name, res):\r\n if graph[name] == []:\r\n return res\r\n ans = 0\r\n for name2 in graph[name]:\r\n ans = max(ans, dfs(name2, res + 1))\r\n\r\n return ans\r\n\r\nprint(dfs(\"polycarp\", 1))", "\"\"\"http://codeforces.com/problemset/problem/522/A\"\"\"\n\nclass DFS:\n visited = None\n edge_to = None\n graph = None\n\n def __init__(self, graph):\n self.visited = set()\n self.edge_to = {}\n self.graph = graph\n\n def dfs(self, node):\n self.visited.add(node)\n for v in self.graph[node]:\n if v not in self.visited:\n self.visited.add(v)\n self.edge_to[v] = node\n self.dfs(v)\n\n def path_to(self, node):\n res = []\n while node in self.edge_to:\n res.append(node)\n node = self.edge_to[node]\n return res\n\ndef solve(g):\n d = DFS(g)\n d.dfs('polycarp')\n res = max([len(d.path_to(node)) for node in g.keys()])\n return res + 1\n\nfrom collections import defaultdict\nif __name__ == '__main__':\n n = int(input())\n graph = defaultdict(list)\n for _ in range(n):\n destination, source = map(\n str.lower, map(str.strip, input().split('reposted')))\n graph[source].append(destination)\n print(solve(graph))\n", "nodes = {'polycarp': 1}\n\nn = int(input())\n\nmax_len = 1\nfor i in range(n):\n (child, dummy, parent) = [x.lower() for x in input().split()]\n nodes[child] = nodes[parent] + 1\n if nodes[child] > max_len:\n max_len = nodes[child]\n\nprint(max_len)\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\nreposts = defaultdict(list)\r\n\r\ndef dfs(parent: str):\r\n children = reposts[parent]\r\n\r\n if children:\r\n return max(1 + dfs(child) for child in children)\r\n return 1\r\n \r\n\r\nfor _ in range(n):\r\n reposter, source = input().split(' reposted ')\r\n reposts[source.lower()].append(reposter.lower())\r\n\r\nprint(dfs('polycarp'))\r\n", "n = int(input())\r\n\r\ndic = {}\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n a = s[0]\r\n b = s[2]\r\n a = a.lower()\r\n b = b.lower()\r\n if b in dic:\r\n dic[b].append(a)\r\n else:\r\n dic[b] = [a]\r\n\r\ndef maxl(node, par=-1):\r\n\r\n if not node in dic:\r\n return 1\r\n \r\n ans = 0\r\n for i in dic[node]:\r\n if i!=par:\r\n ans = max(ans, maxl(i, node))\r\n return 1+ans\r\n\r\nprint(maxl('polycarp'))\r\n", "from collections import defaultdict\r\nn=int(input())\r\nans=2\r\nk=defaultdict(int)\r\nk.update({'polycarp':1})\r\nfor i in range(n):\r\n l={}\r\n l=input().split()\r\n l[0]=l[0].lower()\r\n l[2]=l[2].lower()\r\n k.update({l[0]:k[l[2]]+1})\r\n if k[l[0]]>ans:\r\n ans=k[l[0]]\r\nprint(ans)", "# from sys import stdin,stdout\r\n# # input = stdin.readline\r\n# for ff in range(int(input())):\r\nfrom queue import Queue\r\nn=int(input())\r\nl=[[] for aa in range(n)]\r\nfor i in range(n):\r\n a,b,c=map(str,input().split())\r\n l[i].append(a.lower())\r\n l[i].append(c.lower())\r\nq=Queue()\r\nq.put('polycarp')\r\nq.put('x')\r\nd=0\r\nwhile q.qsize()>1:\r\n a=q.get()\r\n # print(a)\r\n # print(d)\r\n if a=='x':\r\n d+=1\r\n q.put('x')\r\n pass\r\n else:\r\n for j in range(n):\r\n if l[j][1]==a:\r\n q.put(l[j][0])\r\n else:\r\n pass\r\nprint(d+1) \r\n\r\n \r\n \r\n \r\n\r\n\r\n", "n=int(input())\r\ndic={\"polycarp\":1}\r\nans=1\r\nfor i in range(n):\r\n name1,temp,name2=input().split()\r\n name1=name1.lower()\r\n name2=name2.lower()\r\n dic[name1]=dic[name2]+1\r\n ans=max(ans,dic[name2]+1)\r\nprint(ans) ", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\nd={}\r\nd['polycarp']=1\r\nfor _ in range(n):\r\n l=input().split()\r\n n1,z,n2 = l[0].lower(),l[1].lower(),l[2].lower()\r\n \r\n d[n1]=1+d.get(n2,0)\r\n \r\nprint(max(list(d.values())))", "adj = [ [] for _ in range(205)]\r\nvisi = [ False for _ in range(205)]\r\nmaxd = 1\r\n\r\ndef dfs(i,d):\r\n global maxd\r\n visi[i] = True\r\n for j in adj[i]:\r\n if(visi[j] == False):\r\n dfs(j, d+1)\r\n if(maxd < d+1): \r\n maxd = d+1\r\n\r\n\r\nl = [\"polycarp\"]\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n tem = list(map(str, input().split()))\r\n if(tem[2].lower() == l[0]):\r\n adj[1].append(i+2)\r\n adj[i+2].append(1)\r\n l.append(tem[0].lower())\r\n else:\r\n for j in range(len(l)):\r\n if(l[j] == tem[2].lower()):\r\n adj[j+1].append(i+2)\r\n adj[i+2].append(j+1)\r\n l.append(tem[0].lower())\r\n break\r\ndfs(1 , 1)\r\nprint(maxd)", "def dfs(graph, lvl, s, ver):\r\n ver.remove(s)\r\n ans = lvl\r\n if s in graph:\r\n for j in graph[s]:\r\n if j in ver:\r\n ans = max(ans, dfs(graph, lvl+1, j, ver))\r\n return ans\r\n\r\ndef Lower(s):\r\n return s.lower()\r\n\r\nn = int(input())\r\ngraph = {}\r\nver = set()\r\nfor i in range(n):\r\n a, b = map(Lower, input().split(' reposted '))\r\n ver.add(a)\r\n ver.add(b)\r\n if b in graph:\r\n graph[b].append(a)\r\n else:\r\n graph[b] = [a]\r\n\r\nans = dfs(graph, 1, 'polycarp', ver)\r\nprint(ans)", "from collections import *\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n\ndef bfs():\n\tvisited = [False]*(n+1)\n\tdistances = [1]*(n + 1)\n\tstart = 0\n\tvisited[start] = True\n\tto_visit = deque()\n\tto_visit.append(start)\n\twhile to_visit:\n\t\tnode = to_visit.popleft()\n\t\tfor neighbor in graph[node]:\n\t\t\tif not visited[neighbor]:\n\t\t\t\tvisited[neighbor] = True\n\t\t\t\tto_visit.append(neighbor)\n\t\t\t\tdistances[neighbor] = distances[node] + 1\n\treturn max(distances)\n\n\n \nn = ri()\ngraph = [[] for _ in range(n + 1)]\nnames = dict()\ncount = 0\nfor i in range(n):\n\tb, _, a = input().split()\n\ta = a.lower()\n\tb = b.lower()\n\tif a not in names:\n\t\tnames[a] = count\n\t\tcount += 1\n\tif b not in names:\n\t\tnames[b] = count \n\t\tcount += 1\n\tgraph[names[a]].append(names[b])\n\tgraph[names[b]].append(names[a])\n\nlonguest = bfs()\nprint(longuest)\n\n", "k=int(input())\r\np=[[] for i in range(k+1)]\r\no=[0]*(k+1)\r\no[0]=1\r\np[0]='polycarp'\r\nfor i in range(k):\r\n a,b,c=input().lower().split()\r\n p[i+1]=a\r\n o[i+1]=o[p.index(c)]+1\r\nprint(max(o))", "from collections import defaultdict,deque\r\nn = int(input())\r\nhas = defaultdict(list)\r\nfor _ in range(n):\r\n a,_,b = input().lower().split()\r\n has[b].append(a)\r\nres = deque([('polycarp',1)])\r\nmx = 0\r\nwhile res:\r\n p,lev = res.popleft()\r\n mx = max(mx,lev)\r\n for i in has[p]:\r\n res.append((i,lev+1))\r\nprint(mx)", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\ns = defaultdict(set)\r\n\r\nfor i in range(n):\r\n\tname1, _, name2 = input().lower().split()\r\n\tif name2 in s:\r\n\t\ts[name1] |= s[name2]\r\n\ts[name1].add(name2)\r\n\r\nres = 0\r\nfor i in s.values():\r\n\tres = max(res, 1+len(i))\r\n\r\nprint(res)\r\n", "from collections import defaultdict, deque\r\nn = int(input())\r\ng = defaultdict(list)\r\nfor _ in range(n):\r\n p = input().split()\r\n g[p[2].lower()].append(p[0].lower())\r\nque = deque(['polycarp'])\r\ndp = 0\r\nwhile que:\r\n l = len(que)\r\n for _ in range(l):\r\n temp = que.popleft()\r\n for nb in g[temp]:\r\n que.append(nb)\r\n dp +=1 \r\nprint(dp)", "n = int(input())\r\nres = {'polycarp':1}\r\nm = 1\r\nfor i in range(n):\r\n s = input().split()\r\n res[s[0].lower()] = res[s[2].lower()] + 1\r\n m = max(m,res[s[0].lower()])\r\nprint(m)\r\n ", "n,q,w,l=int(input()),[],[],[[\"polycarp\"]]\r\nfor i in range(n):\r\n a=list(input().split())\r\n q+=[a[0].lower()]\r\n w+=[a[2].lower()]\r\nfor i in range(n):\r\n for j in range(len(l)):\r\n if l[j][-1]==w[i]:l+=[list(l[j])];l[j]+=[q[i]]\r\nprint(max(len(i)for i in l))", "import sys\r\nreadline=sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nN=int(readline())\r\nedges=[]\r\nidx=defaultdict(lambda:len(idx))\r\nfor n in range(N):\r\n A,_,B=readline().split()\r\n A=\"\".join(a.lower() for a in A)\r\n B=\"\".join(b.lower() for b in B)\r\n A=idx[A]\r\n B=idx[B]\r\n edges.append((A,B))\r\nle=len(idx)\r\ngraph=[[] for x in range(le)]\r\nrev_graph=[[] for x in range(le)]\r\nfor A,B in edges:\r\n graph[A].append(B)\r\n rev_graph[B].append(A)\r\ndegree=[len(graph[x]) for x in range(le)]\r\nstack=[x for x in range(le) if degree[x]==0]\r\ndp=[1]*le\r\nwhile stack:\r\n x=stack.pop()\r\n for y in graph[x]:\r\n dp[x]=max(dp[x],dp[y]+1)\r\n for y in rev_graph[x]:\r\n degree[y]-=1\r\n if degree[y]==0:\r\n stack.append(y)\r\nans=max(dp)\r\nprint(ans)", "n = int(input())\nposts = []\nfor i in range(n):\n posts.append(input())\nif n == 0:\n print(1)\nelse:\n num = {}\n post0 = posts[0].split(\" \")\n num[post0[2].lower()] = 1\n num[post0[0].lower()] = 2\n for i in range(1, n, 1):\n post = posts[i].split(\" \")\n num[post[0].lower()] = num[post[2].lower()] + 1\n print(max(num.values()))\n \t \t \t \t \t \t\t \t \t \t", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"./code/input.txt\"\r\n OUTPUT_FILE_PATH = \"./code/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(graph):\r\n ans = 0\r\n\r\n def dfs(curr, lvl=1):\r\n nonlocal ans\r\n ans = max(ans, lvl)\r\n\r\n for child in graph[curr]:\r\n dfs(child, lvl+1)\r\n\r\n dfs(\"polycarp\")\r\n return ans\r\n\r\n\r\nT = read_int()\r\ngraph = defaultdict(list)\r\n\r\nfor t in range(T):\r\n child, parent = read().split(\" reposted \")\r\n child = child.lower()\r\n parent = parent.lower()\r\n\r\n graph[parent].append(child)\r\n\r\nprint(solve(graph))\r\n", "from collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(int)\r\nfor i in range(n) :\r\n toks = input().lower().split()\r\n d[toks[0]] = d[toks[2]]+1\r\nprint(max(d.values())+1)\r\n", "import sys\r\n\r\n\r\ndef dfs(cur, len):\r\n global a, mark, cur_max\r\n mark[cur] = True\r\n cur_max = max(cur_max, len)\r\n for v in a[cur]:\r\n if not mark[v]:\r\n dfs(v, len + 1)\r\n\r\ncur_max = 0\r\ntext = sys.stdin.read().split('\\n')\r\nn = int(text[0])\r\na = [[] for i in range(n + 1)]\r\nmark = [False] * (n + 1)\r\namount = 1\r\nnames = {}\r\nnames['polycarp'] = 0\r\nfor line in text[1:]:\r\n s = line.split()\r\n if len(s) == 0:\r\n continue\r\n name1 = s[0].lower()\r\n name2 = s[2].lower()\r\n if not name1 in names.keys():\r\n names[name1] = amount\r\n amount += 1\r\n if not name2 in names.keys():\r\n names[name2] = amount\r\n amount += 1\r\n num1 = names[name1]\r\n num2 = names[name2]\r\n a[num2].append(num1)\r\ndfs(0, 0)\r\nprint(cur_max + 1)", "n = int(input())\n\ntree = {}\n\nfor i in range(n):\n name1, _, name2 = input().split()\n name1 = name1.lower()\n name2 = name2.lower()\n if i == 0:\n start = name2\n if name2 in tree:\n tree[name2].append(name1)\n else:\n tree[name2] = []\n tree[name2].append(name1)\n if name1 not in tree:\n tree[name1] = []\n\ndef dfs(s_v, gr):\n explored = []\n l = 0\n queue = []\n k = []\n k.append(0)\n k.append(s_v)\n queue.append(k)\n \n while queue:\n k = queue.pop()\n n = k.pop()\n m = k.pop()\n if n not in explored:\n explored.append(n)\n m += 1\n l = max(l, m)\n for i in gr[n]:\n if not gr[i] in explored:\n k = []\n k.append(m)\n k.append(i)\n queue.append(k)\n return l\n\nprint(dfs(start, tree))", "n = int(input())\nreposts = [input().lower().split(\" reposted \") for _ in range(n)]\n# [[\"tourist\", \"Polycarp\"], [\"Petr\", \"Tourist\"], ... ]\nSTARTING_VALUE = \"Polycarp\".lower()\n\ndef get_longest_joke():\n tree = Tree(STARTING_VALUE)\n for reposter, op in reposts:\n node = tree_search(tree, op)\n node.add_child_with_value(reposter)\n return tree.depth\n\ndef tree_search(tree, value):\n \"\"\"\n Searches tree for a node with a particular value and then returns\n that node. If it doesn't exist in the tree, then returns None.\n \"\"\"\n if tree.value == value:\n return tree\n elif tree.is_leaf():\n return\n for child in tree.children:\n result = tree_search(child, value)\n if result:\n return result\n\nclass Tree(object):\n\n def __init__(self, value, children=None):\n self.value = value\n self.children = children\n\n def __repr__(self):\n if self.children:\n return \"Tree(%s, %s)\" % (self.value, self.children)\n return \"Tree(%s)\" % self.value\n\n def is_leaf(self):\n return not self.children\n\n def add_child(self, child):\n if self.is_leaf():\n self.children = [child]\n else:\n self.children.append(child)\n\n def add_child_with_value(self, value):\n self.add_child(Tree(value))\n\n @property\n def depth(self):\n if self.is_leaf():\n return 1\n return 1 + max([child.depth for child in self.children])\n\nprint(get_longest_joke())\n", "def find_man(list1,list2,name,i,result_list):\r\n # polycarp - exit\r\n # any number - index\r\n # name - who reported\r\n index = list1.index(name)\r\n if list2[index].lower()!=\"polycarp\":\r\n i+=1\r\n find_man(list1,list2,list2[index],i,result_list)\r\n else:\r\n result_list.append((i+1))\r\n\r\ndef main():\r\n number = eval(input())\r\n list1 = []\r\n list2 = []\r\n #list 1 - who reported\r\n #list 2 - author of the post\r\n for i in range(number):\r\n phrase = input()\r\n temp_list = phrase.split(\" \")\r\n list1.append(temp_list[0].lower())\r\n list2.append(temp_list[2].lower())\r\n longest_chain = 2\r\n result_list = []\r\n for i in range(len(list1)):\r\n current_chain = 1 \r\n find_man(list1,list2,list1[i],current_chain,result_list)\r\n longest_chain = max(result_list)\r\n print(longest_chain)\r\nmain()\r\n\r\n", "n = int(input())\r\nreposts = {}\r\nfor i in range(n):\r\n str = input().lower().split()\r\n if str[2] == \"polycarp\":\r\n reposts[str[0]] = 2\r\n else:\r\n reposts[str[0]] = reposts[str[2]] + 1\r\nprint(max(reposts.values()))\r\n", "\r\nn = int(input())\r\nadj_list={}\r\nvisited={}\r\n\r\nfor _ in range(n):\r\n n1,_,n2=input().split()\r\n n1=n1.lower()\r\n n2=n2.lower()\r\n\r\n if(n1 not in adj_list):\r\n adj_list[n1]=[]\r\n visited[n1]=False\r\n\r\n\r\n if(n2 not in adj_list):\r\n adj_list[n2]=[]\r\n visited[n2]=False\r\n\r\n\r\n adj_list[n2].append(n1)\r\n\r\n\r\ndepth=0\r\nmax_depth=0\r\nans=1\r\n\r\ndef dfs(node,adj_list,depth):\r\n visited[node]=True\r\n max_depth=depth\r\n for nb in adj_list[node]:\r\n if(visited[nb]==False):\r\n max_depth=max(max_depth,dfs(nb,adj_list,depth+1))\r\n return max_depth\r\n\r\nans=dfs('polycarp',adj_list,1)\r\nprint(ans)\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n", "n = int(input())\nfrom collections import defaultdict\nd = defaultdict(int)\nd[\"polycarp\"] = 1\nans = 0\nfor i in range(n):\n\ta,b,c=input().split(' ')\n\ta = a.lower()\n\tc = c.lower()\n\td[a]=max(d[a], d[c]+1)\n\tans = max(ans, d[a])\nprint(ans)", "n=int(input())\r\ntree={}\r\ndef dfs (g,start,visited=None):\r\n if visited is None:\r\n visited=set()\r\n visited.add(start);\r\n if start in g.keys():\r\n for nxt in g[start]-visited:\r\n dfs(g,nxt,visited)\r\n return visited\r\n \r\nfor i in range(n):\r\n t=list(map(str,input().split()))\r\n a,b=t[0],t[2]\r\n if a.lower() in tree.keys():\r\n tree[a.lower()].append(b.lower())\r\n else:\r\n tree[a.lower()]=set()\r\n tree[a.lower()].add(b.lower())\r\nans=0\r\nfor st in tree.keys():\r\n ans=max(ans,len(dfs(tree,st)))\r\nprint(ans)", "from collections import defaultdict\r\nn = int(input())\r\narr = defaultdict(lambda : 1)\r\nans = 0\r\n\r\nfor i in range(n):\r\n a , b = input().split(' reposted ')\r\n a = a.lower()\r\n b = b.lower()\r\n\r\n ans = max(ans , arr[b] + 1)\r\n arr[a] = arr[b] + 1 \r\n\r\nprint(ans)\r\n \r\n\r\n", "#Author: yash_31\r\n#first time using python in CP\r\n#i know its bad idea but for time pass...\r\n#i think verdict will be TLE (lol)\r\n\r\nn=int(input())\r\nmp={'polycarp':1}\r\ngx={}\r\ncount=2\r\nfor i in range(0,n):\r\n s=input()\r\n s=s.split(' ')\r\n s.remove('reposted')\r\n s[0]=s[0].lower()\r\n s[1]=s[1].lower()\r\n v=mp[s[1]]\r\n if s[0] in mp:\r\n u=mp[s[0]]\r\n else:\r\n u=count\r\n count+=1\r\n mp[s[0]]=u\r\n if u in gx:\r\n gx[u].append(v)\r\n else:\r\n gx[u]=[v]\r\n if v in gx:\r\n gx[v].append(u)\r\n else:\r\n gx[v]=[u]\r\nvis={}\r\nfor i in range(0,555):\r\n vis[i]=False\r\nresult=[0]\r\ndef dfs(node,till):\r\n vis[node]=True\r\n result[0]=max(result[0],till)\r\n for x in gx[node]:\r\n if vis[x]==False:\r\n dfs(x,till+1)\r\ndfs(1,1)\r\nprint(result[0])", "n = int(input())\n\ndp = {'polycarp' : 1}\n\nans = 1\n\nfor i in range(n):\n\tinf = input().split()\n\tre = inf[0].lower()\n\tso = inf[2].lower()\n\tdp[re] = max(dp.get(re, 1), dp[so]+1)\n\tans = max(ans, dp[re])\n\nprint(ans)\n\n", "def main():\r\n slo={}\r\n slo[\"polycarp\"]=1\r\n wyn=0\r\n for P in range(int(input())):\r\n komu,_,kto=input().split()\r\n slo[komu.lower()]=slo[kto.lower()]+1\r\n wyn=max(wyn,slo[komu.lower()])\r\n print(wyn)\r\nmain()", "n = int(input())\r\nd = {'polycarp': 1}\r\nm = 0\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n a = a.lower()\r\n c = c.lower()\r\n d.update({a:(d[c]+1)})\r\n m = max (d[a], m)\r\nprint (m)\r\n", "n = int(input())\r\narr = [ [\"POLYCARP\", 1] ]\r\nfor i in range(n):\r\n a, placeHolder, b = list(input().split())\r\n a = a.upper()\r\n b = b.upper()\r\n for g in range(len(arr)):\r\n if arr[g][0] == b:\r\n arr.append([a,arr[g][1]+1])\r\n break\r\n\r\nm = 0\r\nfor i in range(len(arr)):\r\n m = max(m,arr[i][1])\r\nprint(m)", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nnames = ['polycarp']\r\nreps = [1]\r\n\r\nfor _ in range(n):\r\n (cur, dummy, prev) = stdin.readline().split()\r\n prev = prev.lower()\r\n cur = cur.lower()\r\n ind = names.index(prev)\r\n names.append(cur)\r\n reps.append(reps[ind]+1)\r\n\r\nstdout.write(str(max(reps)))", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nfrom collections import defaultdict, Counter\r\nimport sys\r\nsys.setrecursionlimit(1 << 30)\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\ngraph = defaultdict(lambda: [])\r\nn = ii()\r\nfor i in range(1, n + 1):\r\n u, v = [name.lower() for name in inp().split(\" reposted \")]\r\n graph[v].append(u)\r\n\r\nnode_depths = Counter()\r\n\r\n\r\ndef count_node_depths(curr):\r\n if not graph[curr]:\r\n node_depths[curr] = 0\r\n return 0\r\n s = 0\r\n for child in graph[curr]:\r\n s = max(s, count_node_depths(child))\r\n node_depths[curr] = 1 + s\r\n return node_depths[curr]\r\n\r\n\r\ncount_node_depths(\"polycarp\")\r\n\r\nprint(node_depths[\"polycarp\"] + 1)\r\n", "n = int(input())\r\ndict = {}\r\ndict[\"polycarp\"] = 1\r\nfor i in range(n):\r\n a = input().split()\r\n name1 = a[0].lower()\r\n name2 = a[2].lower()\r\n dict[name1] = dict[name2]+1\r\n\r\nprint(max(dict.values()))\r\n", "m = int(input())\r\ncount = 2\r\nadj = [set() for _ in range(m + 2)]\r\nvis = [False for _ in range(m + 2)]\r\n\r\ndic = {\"polycarp\": 1}\r\nc = 1\r\nfor i in range(m):\r\n u,verb,v = input().split()\r\n if u.lower() not in dic:\r\n c += 1\r\n dic[u.lower()] = c\r\n if v.lower() not in dic:\r\n c += 1\r\n dic[v.lower()] = c\r\n adj[dic[u.lower()]].add(dic[v.lower()])\r\n adj[dic[v.lower()]].add(dic[u.lower()])\r\n\r\n\r\ndef dfs(cur: int,ans: int):\r\n global adj,vis,count\r\n vis[cur] = True\r\n for ele in adj[cur]:\r\n if not vis[ele]:\r\n dfs(ele,ans + 1)\r\n \r\n count = max(count,ans)\r\n\r\n\r\n\r\ndfs(1,1)\r\n\r\nprint(count)", "\r\ndef main():\r\n n = int(input())\r\n lens = {'polycarp': 1}\r\n ans = 1\r\n for i in range(n):\r\n linos = input().split()\r\n x = linos[0].lower()\r\n y = linos[2].lower()\r\n if y in lens:\r\n z = lens[x] if x in lens else 0\r\n lens[x] = max(z, lens[y]+1)\r\n for x, y in lens.items():\r\n ans = max(ans, y)\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "from sys import stdin \nfrom collections import defaultdict\n\nstdint =lambda: int(stdin.readline())\nstrlst =lambda: stdin.readline().strip().split()\n\n# your code goes here\nadjList = defaultdict(list)\nfor _ in range(stdint()):\n\ts = strlst()\n\tadjList[s[0].lower()].append(s[2].lower())\n\tadjList[s[2].lower()].append(s[0].lower())\n# print(adjList)\nvis = set()\nvis.add('Polycarp'.lower())\nqueue = []\nqueue.append('Polycarp'.lower())\nlevel = 0\nwhile queue:\n\tsz = len(queue)\n\tlevel += 1\n\twhile sz:\n\t\tsz -= 1\n\t\tnode = queue[0]\n\t\tqueue.pop(0)\n\t\tfor item in adjList[node]:\n\t\t\tif item not in vis:\n\t\t\t\tvis.add(item)\n\t\t\t\tqueue.append(item)\nprint(level)\t\n\t\n\t\n \t \t\t \t \t \t\t \t\t \t \t\t \t \t" ]

[ "#include <bits/stdc++.h>\r\n#include <ext/pb_ds/assoc_container.hpp>\r\n\r\n#define PB push_back\r\n#define MP make_pair\r\n#define LL long long\r\n#define int LL\r\n#define FOR(i,a,b) for(int i = (a); i <= (b); i++)\r\n#define RE(i,n) FOR(i,1,n)\r\n#define REP(i,n) FOR(i,0,(int)(n)-1)\r\n#define R(i,n) REP(i,n)\r\n#define VI vector<int>\r\n#define PII pair<int,int>\r\n#define LD long double\r\n#define FI first\r\n#define SE second\r\n#define st FI\r\n#define nd SE\r\n#define ALL(x) (x).begin(), (x).end()\r\n#define SZ(x) ((int)(x).size())\r\n\r\n#define unordered_map __fast_unordered_map\r\n\r\n#ifdef LOCAL\r\n#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\r\n#else\r\n#define debug(...) (__VA_ARGS__)\r\n#define cerr if(0)cout\r\n#endif\r\n\r\n#pragma GCC optimize (\"O3\")\r\n#pragma GCC target (\"avx,avx2\")\r\n\r\n\r\nfrom __future__ import division, print_function\r\npy2 = round(0.5)\r\n\r\nif py2:\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n range = xrange\r\n\r\ndef sync_with_stdio(b):\r\n if b: return\r\n import os, sys\r\n from io import BytesIO, IOBase\r\n \r\n # FastIO for PyPy2 and PyPy3 (works with interactive) by Pajenegod\r\n class FastI(object):\r\n def __init__(self, fd=0, buffersize=2**14):\r\n self.stream = stream = BytesIO(); self.bufendl = 0\r\n def read2buffer():\r\n s = os.read(fd, buffersize + os.fstat(fd).st_size); pos = stream.tell()\r\n stream.seek(0,2); stream.write(s); stream.seek(pos); return s\r\n self.read2buffer = read2buffer\r\n # Read entire input\r\n def read(self):\r\n while self.read2buffer(): pass\r\n return self.stream.read() if self.stream.tell() else self.stream.getvalue()\r\n def readline(self):\r\n while self.bufendl == 0: s = self.read2buffer(); self.bufendl += s.count(b'\\n') + (not s)\r\n self.bufendl -= 1; return self.stream.readline()\r\n def input(self): return self.readline().rstrip(b'\\r\\n')\r\n \r\n # Read all remaining integers, type is given by optional argument\r\n def readnumbers(self, zero=0):\r\n conv = ord if py2 else lambda x:x\r\n A = []; numb = zero; sign = 1; c = b'-'[0]\r\n for c in self.read():\r\n if c >= b'0'[0]: numb = 10 * numb + conv(c) - 48\r\n elif c == b'-'[0]: sign = -1\r\n elif c != b'\\r'[0]: A.append(sign*numb); numb = zero; sign = 1\r\n if c >= b'0'[0]: A.append(sign*numb)\r\n return A\r\n \r\n class FastO(IOBase):\r\n def __init__(self, fd=1):\r\n stream = BytesIO()\r\n self.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)\r\n self.write = stream.write if py2 else lambda s: stream.write(s.encode())\r\n \r\n sys.stdin, sys.stdout = FastI(), FastO()\r\n global input\r\n input = sys.stdin.input\r\n\r\n\r\nimport sys\r\n\r\nclass ostream:\r\n def __lshift__(self,a):\r\n if a == endl:\r\n sys.stdout.write('\\n')\r\n sys.stdout.flush()\r\n else:\r\n sys.stdout.write(str(a))\r\n return self\r\n def tie(self, val):pass\r\ncout = ostream()\r\nendl = object()\r\n\r\nclass istream:\r\n tiedto = cout\r\n inp = None\r\n def __rlshift__(a,b):\r\n if a.tiedto == cout:\r\n sys.stdout.flush()\r\n if type(b)==tuple or type(b)==list:\r\n return type(b)(type(c)(a.get()) for c in b)\r\n return type(b)(a.get())\r\n def tie(self, val):\r\n self.tiedto = val\r\n def get(a):\r\n while not a.inp:\r\n a.inp = sys.stdin.readline().split()[::-1]\r\n return a.inp.pop()\r\ncin = istream()\r\n\r\nclass Vector:\r\n def __lshift__(self, other):\r\n self.type = other\r\n return self\r\n def __rshift__(self, other):\r\n if type(other) == tuple:\r\n return [self.type(other[1])]*other[0]\r\n else:\r\n return [self.type()]*other\r\nvector = Vector()\r\n\r\n\r\n\r\n######## PYTHON++ ########\r\nsync_with_stdio(False);\r\ncin.tie(0); cout.tie(0);\r\n\r\nMOD = 10**9+7;\r\n\r\nx = 0;\r\ny = 0;\r\nx <<= cin;\r\ny <<= cin;\r\n\r\nmem = {};\r\ndef ways(summa):\r\n if summa not in mem:\r\n c = pow(2, summa-1, MOD) - 1;\r\n i = 2;\r\n while i*i < summa:\r\n if summa%i==0:\r\n c = (c - ways(i))%MOD;\r\n i += 1;\r\n \r\n if i*i == summa: \r\n c = (c - ways(i))%MOD;\r\n \r\n i -= 1;\r\n while i>1:\r\n if summa%i==0:\r\n c = (c - ways(summa//i))%MOD;\r\n i -= 1;\r\n mem[summa] = c;\r\n return mem[summa];\r\n\r\nmem[0] = 0;\r\nmem[1] = 1;\r\n\r\nans = ways(y//x) if y%x==0 else 0;\r\n\r\ncout << ans << endl;", "M=10**9+7\r\ndef modpow(x, p):\r\n if p==0:\r\n return 1\r\n if p<0:\r\n return modpow(x, (2-M)*p)\r\n y=modpow(x, p//2)\r\n if p%2:\r\n return (y*y*x)%M\r\n return (y*y)%M\r\nx,y=[int(e) for e in input().split()]\r\nif y%x:\r\n print(0)\r\nelse:\r\n y//=x\r\n F={1:1}\r\n def f(y):\r\n if y in F.keys():\r\n return F[y]\r\n res=modpow(2, y-1)\r\n res-=F[1]\r\n i=2\r\n while i*i<=y:\r\n if y%i==0:\r\n res-=f(i)\r\n if y//i!=i:\r\n res-=f(y//i)\r\n res%=M\r\n i+=1\r\n F[y]=res\r\n return res\r\n print(f(y))", "import math\r\n\r\nmod= 1000000007\r\n\r\nx, y = [int(x) for x in input().split()]\r\n\r\nif y%x != 0:\r\n print(0)\r\n exit()\r\n \r\ny= y//x\r\nseqs=set()\t\r\n\r\nfor x in range(1, int(math.sqrt(y) + 1)):\r\n\tif y%x != 0:\r\n\t\tcontinue\r\n\tseqs.add(x)\r\n\tseqs.add(y// x)\r\n\r\nseqs=sorted(list(seqs))\r\nordered= seqs.copy()\r\n\r\nfor i in range(len(seqs)):\r\n\tordered[i]=pow(2, seqs[i] - 1, mod)\r\n\tfor j in range(i):\r\n\t\tif seqs[i]% seqs[j] == 0:\r\n\t\t\tordered[i]-= ordered[j]\r\nprint(int(ordered[len(ordered)-1] % mod))\r\n", "def 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\ndef prime_fac(n): # sorted factors\r\n primes, ans = set(), factorize(n)[1:]\r\n for i in ans:\r\n while n % i == 0:\r\n n //= i\r\n primes.add(i)\r\n return list(primes)\r\n\r\n\r\nmod = 10 ** 9 + 7\r\nadd = lambda a, b: (a + b) % mod\r\nmult = lambda a, b: (a * b) % mod\r\nget_bit = lambda x, i: (x >> i) & 1\r\n\r\ng, su = map(int, input().split())\r\nif su % g:\r\n exit(print(0))\r\n\r\nsu //= g\r\nans = pow(2, su - 1, mod)\r\nprimes = prime_fac(su)\r\n\r\nfor msk in range(1, 1 << len(primes)):\r\n cur, num = 1, 0\r\n for bit in range(len(primes)):\r\n if get_bit(msk, bit):\r\n cur *= primes[bit]\r\n num += 1\r\n\r\n ans = add(ans, mult(pow(-1, num), pow(2, su // cur - 1, mod)))\r\nprint(ans)\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n_str = str\r\nstr = lambda x=b\"\": x if type(x) is bytes else _str(x).encode()\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._file = 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\nx, y = map(int, input().split(' '))\r\n\r\nif y % x != 0:\r\n print(0)\r\n quit()\r\n\r\ny = y // x\r\n\r\n# sum = y, gcd = 1\r\n# mobius function, you only care about divisors of y\r\n\r\ndef prime(c):\r\n d = 2\r\n p = []\r\n Y = y\r\n while d * d <= Y:\r\n if Y % d == 0:\r\n p.append(d)\r\n while Y % d == 0:\r\n Y = Y // d\r\n d += 1\r\n\r\n if Y > 1:\r\n p.append(Y)\r\n\r\n return p\r\n\r\nMOD = 10 ** 9 + 7\r\n\r\ndef f(c):\r\n # number of arrays s.t. all numbers are a multiple of c and the sum is y\r\n assert y % c == 0\r\n s = y // c\r\n # number of arrays with sum s, s.t. each number is positive\r\n # 2**(s-1)\r\n \r\n return pow(2, s-1, MOD)\r\n\r\nans = 0 \r\n\r\np = prime(y)\r\nfor mask in range(1 << len(p)):\r\n c = 1\r\n for i in range(len(p)):\r\n if ((mask >> i) & 1) > 0:\r\n c *= p[i]\r\n\r\n pct = bin(mask).count(\"1\")\r\n if pct % 2 == 0:\r\n ans += f(c)\r\n else:\r\n ans -= f(c)\r\n\r\n ans = ans % MOD\r\n\r\nprint(ans)\r\n", "import math\r\nlectura=lambda:map (int,input().split())\r\nx,y=lectura()\r\nmod= 1000000007\r\nif (y%x!=0):\r\n print(\"0\")\r\nelse:\r\n y= y//x\r\n setPrueba=set()\r\n for i in range(1, int(math.sqrt(y) + 1)):\r\n if (y%i==0):\r\n setPrueba.add(i)\r\n setPrueba.add(y// i)\r\n setPrueba=sorted(list(setPrueba))\r\n setOrdenado= setPrueba.copy()\r\n for i in range(len(setOrdenado)):\r\n #setOrdenado[i] = math.pow(2, setPrueba[i] - 1)\r\n setOrdenado[i]=pow(2, setPrueba[i] - 1, mod)\r\n for j in range(i):\r\n if setPrueba[i]% setPrueba[j]==0:\r\n setOrdenado[i]-= setOrdenado[j]\r\n print(setOrdenado[len(setOrdenado)-1] % mod)", "\r\nmod=10**9+7\r\nnum1,num2=map(int,input().split())\r\nif num2%num1:\r\n\tprint(\"0\")\r\nelse:\r\n num2=num2//num1\r\n arr=set()\r\n for i in range(1,int(pow(num2,0.5)+1)):\r\n if num2%i==0:\r\n arr.add(i)\r\n arr.add(num2//i)\r\n arr=sorted(list(arr))\r\n cop2=arr[::]\r\n for i in range(len(cop2)):\r\n cop2[i]=pow(2,arr[i]-1,mod)\r\n for j in range(i):\r\n if arr[i]%arr[j]==0:\r\n cop2[i]-=cop2[j]\r\n print(cop2[-1]%mod)\r\n\r\n", "import sys\nmod = 1000000007\ndef mul(x,y):\n res=1\n while y>0:\n if y%2==1:\n res=(res*x)%mod\n x=(x*x)%mod\n y//=2\n return res\nx,y = map(int,sys.stdin.readline().split())\nif(y%x!=0):\n print(0)\nelse:\n y/=x\n d=set([])\n i=1\n while i*i<=y:\n if y%i==0:\n d.add(i);d.add(y/i)\n i+=1\n d=sorted(list(d))\n dp=d[::]\n for i in range(len(d)):\n dp[i]=mul(2,d[i]-1)\n for j in range(i):\n if d[i]%d[j]==0:\n dp[i]-=dp[j]\n print(dp[-1]%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\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\nx, y = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nif y % x:\r\n ans = 0\r\n print(ans)\r\n exit()\r\nm = y // x\r\ns = divisor(m)\r\nn = len(s)\r\ndp = [0] * n\r\nfor i in range(n - 1, -1, -1):\r\n si = s[i]\r\n dpi = pow(2, m // si - 1, mod)\r\n for j in range(i + 1, n):\r\n if not s[j] % si:\r\n dpi -= dp[j]\r\n dpi %= mod\r\n dp[i] = dpi\r\nans = dp[0]\r\nprint(ans)", "#!/usr/bin/env python3\n\nfrom fractions import gcd\nfrom operator import mul\nfrom functools import reduce\nfrom itertools import combinations\n\n\neval_function = lambda x: lambda f: f(x)\n\n\n@eval_function(int((10**9)**0.5))\ndef prime(n):\n sieve = [True] * (n+1)\n sieve[0] = sieve[1] = False\n index = 2\n for i in range(int(len(sieve)**0.5)):\n if sieve[i]:\n for j in range(2*i, len(sieve), i):\n sieve[j] = False\n index += 1\n return [i for i, is_prime in enumerate(sieve) if is_prime]\n\n\ndef factorized(n):\n factors = []\n for i in prime:\n if i**2 > n:\n break\n while not n % i:\n factors += [i]\n n //= i\n if n > 1:\n factors += [n]\n return factors\n\n\ndef solve(x, y, mod=None):\n if gcd(x, y) != x:\n return 0\n y = y//x\n c = pow(2, y-1, mod)\n unique_factors = set(factorized(y))\n for i in range(1, len(unique_factors)+1):\n for divisor in combinations(unique_factors, i):\n d = reduce(mul, divisor)\n c += (-1)**i * pow(2, y//d-1, mod)\n c %= mod\n return c\n\n\ndef main():\n x, y = [int(n) for n in input().split()]\n print(solve(x, y, 10**9+7))\n\n\nif __name__ == '__main__':\n main()\n", "MOD = 1000000007\r\n\r\nx, y = map(int,input().split())\r\n\r\nif y%x == 0: # 'y' must be divisible by 'x'\r\n div = y // x\r\n y_mult = set() # Distinc common multiples for y\r\n for i in range(1, int(pow(div, 0.5) + 1)): # Just is neccesary until root of div\r\n if div % i == 0:\r\n y_mult.add(i)\r\n y_mult.add(div // i)\r\n y_mult = sorted(list(y_mult))\r\n ym_copy = y_mult.copy()\r\n for i in range(len(ym_copy)):\r\n ym_copy[i] = pow(2, y_mult[i]-1, MOD) # Efficient pow \r\n for j in range(i):\r\n if y_mult[i]%y_mult[j] == 0:\r\n ym_copy[i] -= ym_copy[j]\r\n print(ym_copy[-1]%MOD)\r\nelse:\r\n print(0)" ]

[ "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn=int(input())\r\nedge=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n a,b=map(lambda x:int(x)-1,input().split())\r\n edge[a].append(b)\r\n edge[b].append(a)\r\n\r\nleaf=[0]*n\r\nfor i in range(1,n):\r\n if len(edge[i])==1:\r\n leaf[i]=1\r\n\r\ndepth=[0]*n\r\n\r\ndef calc(r):\r\n todo=[(r,0)]\r\n d=[]\r\n while todo:\r\n v,p=todo.pop()\r\n if leaf[v]:\r\n d.append(depth[v])\r\n for u in edge[v]:\r\n if u!=p:\r\n todo.append((u,v))\r\n depth[u]=depth[v]+1\r\n \r\n d.sort()\r\n now=-1\r\n for i in d:\r\n now+=1\r\n now=max(now,i)\r\n return now\r\n\r\nans=0\r\nfor v in edge[0]:\r\n ans=max(ans,calc(v)+1)\r\nprint(ans)", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappop, heappush\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import gcd\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.n = n\r\n self.p = [-1] * (n+1)\r\n\r\n def find(self, x):\r\n if self.p[x] < 0:\r\n return x\r\n else:\r\n self.p[x] = self.find(self.p[x])\r\n return self.p[x]\r\n\r\n def union(self, x, y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n if x == y:\r\n return\r\n if self.p[x] > self.p[y]:\r\n x, y = y, x\r\n self.p[x] += self.p[y]\r\n self.p[y] = x\r\n\r\n def same(self, a, b):\r\n return self.find(a) == self.find(b)\r\n\r\n def group(self):\r\n d = defaultdict(list)\r\n for i in range(1, self.n+1):\r\n par = self.find(i)\r\n d[par].append(i)\r\n return d\r\n\r\n\r\nn = int(input())\r\ngraph = [[] for i in range(n+1)]\r\ndeg = [0]*(n+1)\r\np = []\r\nuf = UnionFind(n)\r\nfor i in range(n-1):\r\n a,b = map(int,input().split())\r\n if a == 1:\r\n p.append(b)\r\n elif b == 1:\r\n p.append(a)\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n deg[a] += 1\r\n deg[b] += 1\r\n if a != 1 and b != 1:\r\n uf.union(a,b)\r\n\r\ndef bfs(s, n):\r\n que = deque([s])\r\n depth = [-1]*(n+1)\r\n pre = [-1]*(n+1)\r\n depth[s] = 0\r\n while que:\r\n crr = que.popleft()\r\n for nxt in graph[crr]:\r\n if depth[nxt] == -1:\r\n depth[nxt] = depth[crr]+1\r\n pre[nxt] = crr\r\n que.append(nxt)\r\n return depth, pre\r\n\r\nd, _ = bfs(1, n)\r\n\r\ng = uf.group()\r\nans = -1\r\nfor i in p:\r\n gp = g[uf.find(i)]\r\n l = []\r\n for v in gp:\r\n if deg[v] == 1:\r\n l.append(d[v])\r\n l.sort()\r\n new = []\r\n for i in l:\r\n if not new:\r\n new.append(i)\r\n else:\r\n new.append(max(new[-1]+1, i))\r\n ans = max(ans,new[-1])\r\n\r\nprint(ans)", "import sys\r\n\r\ndef read_input():\r\n n = int(sys.stdin.buffer.readline().decode('utf-8'))\r\n graph = [[] for _ in range(n)]\r\n tree = [0] * n\r\n for u, v in (map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n tree[u-1] += 1\r\n tree[v-1] += 1\r\n \r\n return graph, tree\r\n \r\n\r\ndef main():\r\n graph, tree = read_input()\r\n ans = 0\r\n \r\n for x in graph[0]:\r\n depth = []\r\n stack = [(x, 0, 1)]\r\n while stack:\r\n v, par, d = stack.pop()\r\n if tree[v] == 1:\r\n depth.append(d)\r\n else:\r\n for dest in graph[v]:\r\n if dest != par:\r\n stack.append((dest, v, d+1))\r\n \r\n depth.sort()\r\n for i in range(1, len(depth)):\r\n depth[i] = max(depth[i], depth[i-1]+1)\r\n \r\n ans = max(ans, depth[-1])\r\n \r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, G):\r\n g = [[] for i in range(n+1)]\r\n for i in range(n-1):\r\n u, v = G[i]\r\n g[u].append(v)\r\n g[v].append(u)\r\n seen = [0 for i in range(n+1)]\r\n answer = 0\r\n seen[1] = 1\r\n for x in g[1]:\r\n L = []\r\n seen[x] = 1\r\n if len(g[x])==1:\r\n L.append(0)\r\n else:\r\n start = [[x]]\r\n while True:\r\n next_s = []\r\n for x in start[-1]:\r\n for y in g[x]:\r\n if seen[y]==0:\r\n next_s.append(y)\r\n seen[y] = 1\r\n if len(g[y])==1:\r\n L.append(len(start))\r\n if len(next_s)==0:\r\n break\r\n start.append(next_s)\r\n L = sorted(L)\r\n curr = L[0]\r\n for i in range(1, len(L)):\r\n curr = max(curr+1, L[i])\r\n answer = max(answer, curr+1)\r\n print(answer)\r\n \r\nn = int(input())\r\nG = []\r\nfor i in range(n-1):\r\n u, v = [int(x) for x in input().split()]\r\n G.append([u, v])\r\nprocess(n, G)\r\n", "from collections import deque\r\nimport heapq\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(s):\r\n q = deque()\r\n q.append(s)\r\n dist[s] = 1\r\n x = []\r\n while q:\r\n i = q.popleft()\r\n di = dist[i]\r\n f = 0\r\n for j in G[i]:\r\n if dist[j] == -1:\r\n f = 1\r\n dist[j] = di + 1\r\n q.append(j)\r\n if not f:\r\n x.append(di)\r\n l, x0 = len(x), x[-1]\r\n ans = x0\r\n for i in range(l):\r\n ans = max(ans, l - i - 1 + x[i])\r\n return ans\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nr = []\r\nfor _ in range(n - 1):\r\n x, y = map(int, input().split())\r\n if min(x, y) > 1:\r\n G[x].append(y)\r\n G[y].append(x)\r\n else:\r\n r.append(x ^ y ^ 1)\r\ndist = [-1] * (n + 1)\r\nans = 0\r\nfor i in r:\r\n ans = max(ans, bfs(i))\r\nprint(ans)" ]

[ "from collections import deque\r\n\r\nlst = [w.rstrip() for w in open(0).readlines()]\r\n\r\nn, t = map(int, lst[0].split())\r\ndata = [tuple(map(int, x.split())) for x in lst[1:]]\r\nL, R = [], []\r\nfor x in data:\r\n L.append(x[0] - x[1] / 2)\r\n R.append(x[0] + x[1] / 2)\r\nL.sort()\r\nR.sort()\r\nd = deque()\r\nfor a, b in zip(L, R):\r\n if len(d) > 0 and d[-1] == a:\r\n d[-1] = b\r\n else:\r\n d.append(a)\r\n d.append(b)\r\nd.popleft()\r\nd = list(d)\r\nr = 2\r\nfor a, b in zip(d[::2], d[1::2]):\r\n if b-a > t:\r\n r += 2\r\n elif b-a == t:\r\n r += 1\r\nprint(r)", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n, t = map(int, input().split())\r\n houses = [list(map(int, input().split())) for _i in range(n)]\r\n houses.sort()\r\n count = 1\r\n for i in range(n-1):\r\n space = houses[i+1][0] - houses[i+1][1] / 2 - (houses[i][0] + houses[i][1] / 2)\r\n if space == t:\r\n count += 1\r\n elif space > t:\r\n count += 2\r\n else:\r\n pass\r\n count += 1\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, t = [int(item) for item in input().split(' ')]\r\ncont,ans = [],2\r\nfor i in range(n):\r\n hcenter, hlen = [float(item) for item in input().split(' ')]\r\n cont.append([hcenter - hlen / 2, hcenter + hlen / 2])\r\n\r\ncont.sort(key=lambda arr: arr[0])\r\nfor i in range(n-1):\r\n gap = cont[i+1][0] - cont[i][1]\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\nprint(ans)", "n, t = [int(item) for item in input().split(' ')]\r\ncont, ans = [], 2\r\nfor i in range(n):\r\n hcenter, hlen = [float(item) for item in input().split(' ')]\r\n # subArr = [hcenter - hlen / 2, hcenter + hlen / 2]\r\n # cont.append(subArr)\r\n cont.append([hcenter - hlen / 2, hcenter + hlen / 2])\r\n\r\n# print(f'cont before => {cont}')\r\ncont.sort(key=lambda it: it[0])\r\n# print(f'cont after => {cont}')\r\nfor i in range(n - 1):\r\n gap = cont[i + 1][0] - cont[i][1]\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\nprint(ans)", "n,t = map(int, input().split())\r\n\r\ncentr = []\r\n\r\nfor i in range(n):\r\n x, c = map(int, input().split())\r\n centr.append((x,c))\r\n\r\n\r\ncount = 2\r\ncentr.sort()\r\n\r\nfor i in range(n - 1):\r\n if (centr[i+1][0] - centr[i+1][1] / 2) - (centr[i][0] + centr[i][1] / 2) > t:\r\n count += 2\r\n elif (centr[i+1][0] - centr[i+1][1] / 2) - (centr[i][0] + centr[i][1] / 2) == t:\r\n count += 1\r\n\r\n\r\nprint(count)\r\n\r\n\r\n", "import math\r\n\r\nn, t = map( int, input().split() )\r\nloc = []\r\n\r\nnum = 2\r\nfor i in range(n):\r\n x, a = map( int, input().split() )\r\n loc.append( (x-a/2, x+a/2) )\r\n\r\n#print(loc)\r\n\r\nsortedLoc = sorted(loc, key = lambda e: e[0])\r\n\r\n#print(sortedLoc)\r\n\r\nfor i in range(1, len(loc)):\r\n dif = sortedLoc[i][0] - sortedLoc[i-1][1]\r\n if dif > t:\r\n num += 2\r\n if dif == t:\r\n num += 1\r\n \r\n\r\nprint(num)\r\n", "n, t = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n x, a = map(int, input().split())\r\n l.append((x-a/2, x+a/2))\r\nl.sort()\r\nres = 2\r\n# print(l)\r\nfor i in range(n-1):\r\n if l[i+1][0] - l[i][1] == t:\r\n res += 1\r\n elif l[i+1][0] - l[i][1] > t:\r\n res += 2\r\n\r\nprint(res)\r\n", "I=lambda:list(map(int,input().split()))\r\nn,t=I()\r\na=sorted([I() for i in range(n)])\r\nans=2\r\nfor i in range(1,n):\r\n rast=(a[i][0]-a[i][1]/2) - (a[i-1][0]+a[i-1][1]/2)\r\n if rast==t:\r\n ans+=1\r\n elif rast>t:\r\n ans+=2\r\nprint(ans)\r\n \r\n \r\n", "n,t = map(int,input().split())\r\nxa = []\r\nfor i in range(n):\r\n xi,ai = map(int,input().split())\r\n xa.append([xi,ai])\r\nxa.sort()\r\nfor i in range(n):\r\n xa[i] = [xa[i][0]-xa[i][1]/2,xa[i][0]+xa[i][1]/2]\r\ncount = 2\r\nfor i in range(n-1):\r\n k = xa[i+1][0] - xa[i][1]\r\n if k < t:\r\n continue\r\n if k == t:\r\n count += 1\r\n else:\r\n count += 2\r\nprint(count)", "import sys\r\n\r\nnum, length = map(int, sys.stdin.readline().split())\r\nsides = {}\r\npos = []\r\n\r\nfor i in range(num):\r\n x, a = map(int, sys.stdin.readline().split())\r\n sides[x] = a\r\n pos.append(x)\r\n\r\npos.sort()\r\n\r\nresult = 2\r\n\r\nfor i in range(len(pos) - 1):\r\n gap = pos[i + 1] - pos[i] - sides[pos[i + 1]] / 2 - sides[pos[i]] / 2\r\n if gap > length:\r\n result += 2\r\n elif gap == length:\r\n result += 1\r\n\r\nprint(result)", "n,s = map(int,input().split())\r\nl = []\r\nct = 2\r\nfor i in range(n):\r\n x,a = map(int,input().split())\r\n l.append(x-a/2)\r\n l.append(x+a/2)\r\nl.sort()\r\nfor i in range (1,2*n-1,2):\r\n if l[i+1]-l[i] > s :\r\n ct += 2\r\n elif l[i+1]-l[i] == s:\r\n ct += 1\r\nprint(ct)", "def good(x1, y1, x2, y2):\r\n if (x1 > x2):\r\n x1, x2 = x2, x1\r\n y1, y2 = y2, y1\r\n return (x2 >= y1) \r\n\r\ndef check(cent):\r\n for i in range(n):\r\n if (not good(cent - t, cent + t, x[i] - a[i], x[i] + a[i])):\r\n return 0\r\n return 1\r\n\r\nn, t = map(int, input().split())\r\nx = [0] * n\r\na = [0] * n\r\nfor i in range(n):\r\n x[i], a[i] = map(int, input().split())\r\n x[i] *= 2\r\n\r\nans = set()\r\n\r\nfor i in range(n):\r\n val1 = x[i] - a[i] - t\r\n val2 = x[i] + a[i] + t\r\n if (check(val1)):\r\n ans.add(val1)\r\n if (check(val2)):\r\n ans.add(val2)\r\nprint(len(ans))\r\n", "def getKey(item):\r\n return item[0]\r\n\r\nn, t = tuple(map(int, input().split()))\r\nh = []\r\nfor i in range(n):\r\n h.append(list(map(int, input().split())))\r\nh.sort(key=getKey)\r\npos = 2\r\nfor i in range(n-1):\r\n if (h[i+1][0] - h[i+1][1]/2) - (h[i][0] +h[i][1]/2) == t:\r\n pos += 1 \r\n if (h[i+1][0] - h[i+1][1]/2) - (h[i][0] +h[i][1]/2) > t:\r\n pos += 2\r\nprint(pos)\r\n ", "n,t = list(map(int,input().split()))\r\nhouses = []\r\nfor i in range(n):\r\n\tc,d = list(map(int,input().split()))\r\n\thouses.append([c-d/2,c+d/2])\r\nhouses.sort()\r\n \r\npossibilities = 0\r\nfor i in range(1,len(houses)):\r\n\tinterval = houses[i][0]-houses[i-1][1]\r\n\tif interval > t:\r\n\t\tpossibilities += 2\r\n\telif interval == t:\r\n\t\tpossibilities += 1\r\n\telse:\r\n\t\tpass\r\n \r\npossibilities += 2\r\nprint(possibilities)", "class House:\r\n def __init__(self, _left, _right):\r\n self.left = _left\r\n self.right = _right\r\n\r\n def __str__(self):\r\n return f'[Left: {self.left}, Right: {self.right}] '\r\n\r\n\r\ndef output(cont: list):\r\n for obj in cont:\r\n print(obj)\r\n\r\n\r\nn, t = [int(item) for item in input().split()]\r\ncont = []\r\n\r\nfor i in range(n):\r\n hcenter, hlen = [int(item) for item in input().split()]\r\n cont.append(House(hcenter - hlen / 2, hcenter + hlen / 2))\r\n\r\ncont.sort(key=lambda obj: obj.left)\r\n\r\nans = 2\r\n\r\nfor i in range(n - 1):\r\n temp = cont[i + 1].left - cont[i].right\r\n if temp == t:\r\n ans += 1\r\n elif temp > t:\r\n ans += 2\r\n\r\n\r\n# output(cont)\r\nprint(ans)\r\n'''\r\n5 2\r\n10 4\r\n5 3\r\n22 4\r\n-8 4\r\n15 2\r\n'''\r\n", "L = input()\r\nL = L.split()\r\nn = int(L[0])\r\nt = int(L[1])\r\nA = []\r\nfor k in range (n):\r\n h = input()\r\n h = h.split()\r\n center = int(h[0])\r\n side = int(h[1])\r\n A.append(center-(side/2))\r\n A.append(center+(side/2))\r\nmoves = 2\r\nA.sort()\r\nfor k in range (1,len(A)-1,2):\r\n if A[k+1]-A[k]>t:\r\n moves += 2\r\n elif A[k+1]-A[k]==t:\r\n moves +=1\r\nprint(moves)", "class Info:\r\n def __init__(self, _left, _right):\r\n self.left = _left\r\n self.right = _right\r\n\r\n def __str__(self):\r\n return f'[left: {self.left}, right: {self.right}]'\r\n\r\n\r\ndef output(cont):\r\n for obj in cont:\r\n print(obj)\r\n\r\n\r\ncont, ans = [], 2\r\nn, t = [int(it) for it in input().split(' ')]\r\nfor i in range(n):\r\n center, length = [int(it) for it in input().split(' ')]\r\n cont.append(Info(center - length / 2, center + length / 2))\r\n\r\ncont.sort(key=lambda obj: obj.left)\r\nfor i in range(n - 1):\r\n gap = cont[i+1].left - cont[i].right\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,t=[int(s) for s in input().split()]\r\nxa=[]\r\nfor i in range(n):\r\n s=[int(s) for s in input().split()]\r\n xa.append(s)\r\nxa.sort()\r\nfor i in range(n):\r\n l=xa[i][0]-xa[i][1]/2\r\n r=xa[i][0]+xa[i][1]/2\r\n xa[i]=[l,r]\r\nk=2\r\nfor i in range(1,n):\r\n d=xa[i][0]-xa[i-1][1]\r\n if t<d:\r\n k+=2\r\n elif t==d:\r\n k+=1\r\nprint(k)", "n, t = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n x, l = map(int, input().split())\r\n a.append((x, l / 2))\r\na.sort()\r\nans = 2\r\nfor i in range(n - 1):\r\n if t == a[i + 1][0] - a[i + 1][1] - a[i][0] - a[i][1]:\r\n ans += 1\r\n elif t <= a[i + 1][0] - a[i + 1][1] - a[i][0] - a[i][1]:\r\n ans += 2\r\nprint(ans)", "ns, ts = input().split()\r\nn, t = int(ns), int(ts)\r\norientations = 2\r\nflag = False\r\n\r\nhouses = []\r\nfor i in range(n):\r\n houses.append(list(map(int, input().split())))\r\n\r\nhouses.sort()\r\n# print(houses)\r\n\r\nfor i in range(n):\r\n distanceLeft = houses[i][0] - ((houses[i][1] / 2) + t)\r\n if i > 0 and distanceLeft > houses[i-1][0] + (houses[i-1][1] / 2):\r\n # print(\"1\")\r\n orientations += 1\r\n elif i > 0 and distanceLeft == houses[i-1][0] + (houses[i-1][1] / 2):\r\n # print(\"2\")\r\n if not flag:\r\n orientations += 1\r\n else:\r\n flag = False\r\n distanceRight = houses[i][0] + ((houses[i][1] / 2) + t)\r\n if i < n-1 and distanceRight < houses[i+1][0] - (houses[i+1][1] / 2):\r\n # print(\"3\")\r\n orientations += 1\r\n elif i < n-1 and distanceRight == houses[i+1][0] - (houses[i+1][1] / 2):\r\n # print(\"4\")\r\n if not flag:\r\n orientations += 1\r\n flag = True\r\n else:\r\n flag = False\r\n\r\nprint(orientations)", "L=lambda:list(map(int,input().split()))\nn,t=L()\nx=sorted(L()for _ in'0'*n)\nnum=0\nfor i in range(n-1):\n\tans=x[i][0]+t+(x[i][1]+x[i+1][1])/2;r=x[i+1][0]\n\tif ans==r:num+=1\n\tif ans<r:num+=2\nprint(num+2)\n\n\t\t\t \t \t\t \t \t \t\t \t \t\t\t\t\t", "n,t=map(int,input().split());\r\n\r\nhouses=[];\r\nfor i in range(n):\r\n x,a=map(int,input().split());\r\n houses.append([x-(a/2),x+(a/2)]);\r\nhouses.sort();\r\n\r\nans=1;\r\nfor i in range(1,n):\r\n if houses[i][0]-houses[i-1][1]<t:\r\n continue;\r\n elif houses[i][0]-houses[i-1][1]==t:\r\n ans+=1;\r\n else:\r\n ans+=2;\r\nans+=1;\r\nprint(ans);\r\n", "n,t = map(int,input().split())\r\ndistance= []\r\nfor _ in range(n):\r\n\tx,s = map(int,input().split())\r\n\tdistance.append((x-s/2,x+s/2))\r\ndistance = sorted(distance,key = lambda x:x[0])\r\ndistance= [distance[i+1][0]-distance[i][1] for i in range(len(distance)-1)]\r\nresult = 2\r\nfor i in distance:\r\n\tif i>t:\r\n\t\tresult+=2\r\n\telif i==t:\r\n\t\tresult+=1\r\nprint(result)", "import poplib\r\nimport string\r\nimport math\r\n\r\ndef main_function():\r\n n, t = [int(i) for i in input().split(\" \")]\r\n x_a = sorted([[int(u) for u in input().split(\" \")] for j in range(n)], key=lambda x:x[0])\r\n counter = 2\r\n start_o = -1000000000\r\n start_d = 0\r\n for i in range(len(x_a)):\r\n current_o = x_a[i][0]\r\n current_d = x_a[i][1] / 2\r\n if i > 0:\r\n if current_o - start_o - start_d - current_d == t:\r\n counter += 1\r\n elif current_o - start_o - start_d - current_d > t:\r\n counter += 2\r\n start_d = current_d\r\n start_o = current_o\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "m,n=map(int,input().split())\r\na=[]\r\nb=[]\r\nz=2\r\nfor i in range(m):\r\n k,t=map(int,input().split())\r\n a.append(k-t/2)\r\n a.append(k+t/2)\r\n \r\na.sort()\r\nfor i in range(1,m):\r\n b.append(a[2*i]-a[2*i-1])\r\n\r\nfor i in range(m-1):#注意这里不是m,只有m-1个间隔\r\n if b[i]>n:\r\n z+=2\r\n elif b[i]==n:\r\n z+=1\r\n\r\nprint(z)\r\n ", "n, t = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n arr.append((a-(b / 2), a+ (b / 2)))\r\n \r\narr.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n if abs(arr[i][0] - arr[i - 1][1]) == t:\r\n ans += 1\r\n elif abs(arr[i][0] - arr[i - 1][1]) > t:\r\n ans += 2\r\nprint(ans + 2)", "ch= input()\r\nn=int(ch[0:ch.find(\" \")])\r\nt=int(ch[ch.find(\" \")+1:len(ch)])\r\nmat=[]\r\n\r\nfor i in range(n):\r\n p=[]\r\n ch = input()\r\n p.append( int(ch[0:ch.find(\" \")]))\r\n p.append( int(ch[ch.find(\" \")+1:len(ch)]))\r\n mat.append(p)\r\n\r\n\r\np=2\r\nmat = sorted(mat, key=lambda x: x[0])\r\n\r\nfor i in range(0,len(mat)-1):\r\n x1=mat[i][0]\r\n x2 = mat[i+1][0]\r\n d=abs(x1-x2)\r\n d=d-(mat[i][1]/2)-(mat[i+1][1]/2)\r\n if(d==t):\r\n p+=1\r\n if (d>t ):\r\n p+=2\r\n\r\n\r\nprint(p)\r\n", "#the basic idea is to get the range of all houses\n#sort them by their starting point\n\nn, t = map(int,input().split())\nhouses = []\nfor i in range (0, n):\n\tcenter, size = map(int,input().split())\n\thouses.append((center-size/2,center+size/2))\nhouses.sort()\n\n#print(houses)\n\nresult = 2\nfor i in range(0, n-1):\n\tdistance = houses[i+1][0] - houses[i][1]\n\tif distance > t:\n\t\tresult += 2\n\telif distance == t:\n\t\tresult += 1\n\nprint(result)", "def main():\r\n n, t = map(int, input().split())\r\n houses = []\r\n for i in range(n):\r\n houses.append(tuple(map(int, input().split())))\r\n\r\n houses.sort(key=lambda x: x[0])\r\n count = 2\r\n for i in range(n - 1):\r\n xi, ai = houses[i]\r\n xi1, ai1 = houses[i + 1]\r\n if xi1 - xi - (ai1 + ai) / 2 > t:\r\n count += 2\r\n elif xi1 - xi - (ai1 + ai) / 2 == t:\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, t = [int(item) for item in input().split(' ')]\r\ncont, ans = list(), 2\r\nfor i in range(n):\r\n hCenter, hLen = [float(item) for item in input().split(' ')]\r\n # subArr = [hCenter - hLen / 2, hCenter + hLen / 2]\r\n # cont.append(subArr)\r\n cont.append([hCenter - hLen / 2, hCenter + hLen / 2])\r\n\r\n#print(f'before=> {cont}')\r\ncont.sort(key=lambda item: item[0])\r\n#print(f'after=> {cont}')\r\nfor i in range(n - 1):\r\n gap = cont[i+1][0] - cont[i][1]\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "j=lambda:list(map(int,input().split()))\r\nn,t=j()\r\nx=sorted(j()for b in'0'*n)\r\na=0\r\nfor i in range(n-1):\r\n\tl=x[i][0]+t+(x[i][1]+x[i+1][1])/2;r=x[i+1][0]\r\n\tif l==r:a+=1\r\n\tif l<r:a+=2\r\nprint(a+2)", "n, t = [int(item) for item in input().split(' ')]\r\ncont, ans = [], 2\r\nfor i in range(n):\r\n hcenter, hlen = [int(item) for item in input().split(' ')]\r\n cont.append([hcenter - hlen / 2, hcenter + hlen / 2])\r\n\r\n# print(f'before => {cont}')\r\ncont.sort(key=lambda item: item[0])\r\n# print(f'after => {cont}')\r\nfor i in range(n - 1):\r\n gap = cont[i + 1][0] - cont[i][1]\r\n if gap == t:\r\n ans += 1\r\n elif gap > t:\r\n ans += 2\r\n\r\nprint(ans)", "import math\r\nimport queue\r\n\r\nfrom itertools import permutations \r\n\r\nn,t=map(int,input().split())\r\n\r\nb=[]\r\n\r\nfor i in range(0,n):\r\n x,a=map(int,input().split())\r\n b.append(x*1000+a-1)\r\n\r\nb.sort()\r\n\r\nanswer=2\r\n\r\nfor i in range(0,n-1):\r\n a1=b[i]%1000+1\r\n a2=b[i+1]%1000+1\r\n \r\n x1=b[i]//1000\r\n x2=b[i+1]//1000\r\n \r\n dist=(2*x2-a2)-(2*x1+a1)\r\n \r\n if dist==2*t:\r\n answer+=1\r\n elif dist>2*t:\r\n answer+=2\r\n \r\nprint(answer)", "'''Problem 15A - Cottage Village'''\r\nn,t = map(int,input().split(' '))\r\nall_houses = []\r\nfor i in range(n):\r\n house_i = list(map(int, input().split()))\r\n all_houses.append(house_i)\r\nc = 0\r\nall_houses.sort(key=lambda x:x[0])\r\n\r\n#print(all_houses)\r\nfor i in range(n-1):\r\n l_ = (all_houses[i][1] / 2 ) + all_houses[i][0]\r\n _r = all_houses[i+1][0] - (all_houses[i+1][1] / 2 )\r\n\r\n if _r - l_ > t:\r\n #print('is ok between : %d and %d ' %(all_houses[i][0], all_houses[i+1][0]) )\r\n c+=2\r\n elif _r - l_ == t:\r\n c+=1\r\n\r\nprint (c+2)\r\n", "n, t = [int(item) for item in input().split(' ')]\r\ncont = []\r\n\r\nfor i in range(n):\r\n center, hLen = [int(item) for item in input().split(' ')]\r\n cont.append([center - hLen / 2, center + hLen / 2])\r\n\r\n#print(cont)\r\n\r\nans = 2\r\ncont.sort(key=lambda item: item[0])\r\n\r\nfor i in range(n - 1):\r\n gap = cont[i + 1][0] - cont[i][1]\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n", "n, t = [int(x) for x in input().split()]\nl = []\nt *= 2\nfor i in range(n):\n\tx, a = [int(x) for x in input().split()]\n\tl.append((x * 2, a * 2))\nl.sort()\nans = 0\nfor i in range(1, n):\n\tif l[i][0] - l[i - 1][0] > t + (l[i][1] + l[i - 1][1]) // 2:\n\t\tans += 2\n\telif l[i][0] - l[i - 1][0] == t + (l[i][1] + l[i - 1][1]) // 2:\n\t\tans += 1\nprint(ans + 2)\n", "n,t=map(int,input().split()); a=[]; q=2\r\na=sorted(list(map(int,input().split()))for _ in range(n))\r\nfor i in range(n-1):\r\n l=a[i][0]+t+(a[i][1]+a[i+1][1])/2;r=a[i+1][0]\r\n if l==r:q+=1\r\n if l<r:q+=2\r\nprint(q)", "#15A - Cottage Village\r\n# n - how many square houses we have\r\n# t - the side of the house\r\nn, t = map(int, input().split())\r\n#Variable that sorts houses by x-axis coordinates in ascending order\r\nhouses = sorted([list(map(int, input().split())) for i in range(n)], key=lambda x: x[0])\r\nans = 2\r\n#The next loop computes the coordinate of the i-th house, according to\r\n#its x and y coordinates \r\nfor i in range(n - 1):\r\n x = houses[i][0] + houses[i][1] / 2\r\n y = houses[i + 1][0] - houses[i + 1][1] / 2\r\n if y - x == t:\r\n ans += 1\r\n elif y - x > t:\r\n ans += 2\r\n \r\nprint(ans)", "n,t=list(map(int,input().split()))\r\namount=2\r\nhouses=[]\r\nfor i in range(n):\r\n c,l=list(map(int,input().split()))\r\n l=l/2\r\n start,end=c-l,c+l\r\n houses.append([start,end])\r\n\r\nhouses.sort(key=lambda x:x[0])\r\nprev_end=houses[0][0]\r\nfor start,end in houses:\r\n gap=start-prev_end\r\n if gap>t:\r\n amount+=2\r\n elif gap==t:\r\n amount+=1\r\n prev_end=end\r\n \r\n \r\nprint(amount)\r\n \r\n \r\n", "import sys\nfrom collections import defaultdict\n# import logging\n# logging.root.setLevel(level=logging.INFO)\n\n\nexist_num,new_width = map(int,sys.stdin.readline().strip().split())\nbuildings = []\nfor _ in range(exist_num):\n center, width = map(int,sys.stdin.readline().strip().split())\n buildings.append((center-width/2,center+width/2))\nbuildings.sort()\npossible_loc = 2\nfor left,right in zip(buildings,buildings[1:]):\n gap=right[0] - left[1]\n if gap == new_width:\n possible_loc += 1\n elif gap > new_width:\n possible_loc += 2\n# print(buildings)\nprint(possible_loc)\n\n", "n, t = [int(i) for i in input().split()]\r\na = sorted([tuple([int(j)for j in input().split()]) for i in range(n)])\r\nb = [a[i + 1][0] - a[i][0] - (a[i + 1][1] + a[i][1]) / 2 for i in range(n - 1)]\r\ns = 2\r\nfor i in b:\r\n if i == t:\r\n s += 1\r\n elif i > t:\r\n s += 2\r\nprint(s)\r\n", "n,t = map(int,input().split())\r\ndistance= []\r\nfor _ in range(n):\r\n\tx,s = map(int,input().split())\r\n\tdistance.append((x-s/2,x+s/2))\r\npart = sorted(distance,key = lambda x:x[0])\r\npart1= []\r\nfor i in range(len(part)-1):\r\n\tpart1.append(part[i+1][0]-part[i][1])\r\nresult = 2\r\nfor i in part1:\r\n\tif i>t:\r\n\t\tresult+=2\r\n\telif i==t:\r\n\t\tresult+=1\r\nprint(result)", "n, t = map(int, input().split())\r\nk = 2 * n\r\np = [0] * k\r\nfor i in range(0, k, 2):\r\n a, b = map(int, input().split())\r\n p[i] = a - b / 2\r\n p[i + 1] = p[i] + b\r\np.sort()\r\np = [p[i + 1] - p[i] for i in range(1, k - 1, 2)]\r\ns = 2\r\nfor i in p:\r\n if i > t: s += 2\r\n elif i == t: s += 1\r\nprint(s)", "n,t=map(int,input().split())\r\np={}\r\na=[]\r\nfor i in range(n):\r\n x,y=map(float,input().split())\r\n p[x]=y\r\n a.append(x)\r\na.sort()\r\ncount=2\r\nfor i in range(1,n):\r\n x=a[i] - a[i-1] - (p[a[i]]/2)-(p[a[i-1]]/2)\r\n if x==t:\r\n count+=1\r\n elif x>t:\r\n count+=2\r\nprint(count)", "n, t = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n x, a = map(int, input().split())\r\n x1 = x - a / 2\r\n x2 = x + a / 2\r\n s.append([x1, x2])\r\ns.sort()\r\n\r\nc = 0\r\nfor i in range(n - 1):\r\n if t < s[i + 1][0] - s[i][1]:\r\n c = c + 2\r\n if t == s[i + 1][0] - s[i][1]:\r\n c = c + 1\r\nc = c + 2\r\nprint(c)", "I=lambda:list(map(int,input().split()))\r\nn,t=I()\r\nx=sorted(I()for _ in '0'*n )\r\nif n>1:\r\n m=2\r\n for i in range(n-1):\r\n r=x[i][0]+(x[i][1])/2;l=x[i+1][0]-(x[i+1][1])/2;c=l-r\r\n if c>t:\r\n m=m+2\r\n if c==t:\r\n m=m+1\r\n print(m)\r\nif n==1:\r\n print(2)", "# 難読。問題文を読解できず。解説を見て実装だけ。\r\n\r\nn,t=map(int,input().split())\r\nH=[tuple(map(int,input().split())) for i in range(n)]\r\nH.append((-1<<60,1))\r\nH.append((1<<60,1))\r\n\r\nH.sort()\r\nANS=0\r\n\r\nfor i in range(n+1):\r\n x,a=H[i]\r\n y,b=H[i+1]\r\n\r\n if (y-x)*2-(b+a)==t*2:\r\n ANS+=1\r\n elif (y-x)*2-(b+a)>t*2:\r\n ANS+=2\r\nprint(ANS-2)\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, t = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n x, a = map(int, input().split())\r\n d.append(x-a/2)\r\n d.append(x+a/2)\r\nd.sort()\r\nc = 2\r\nfor i in range(1, 2*n-1, 2):\r\n if d[i+1] - d[i] > t:\r\n c += 2\r\n elif d[i+1] - d[i] == t:\r\n c += 1\r\nprint(c)\r\n", "n, t = map(int, input().split())\r\nx = list()\r\nans = 2;\r\nfor i in range(n):\r\n x.append(tuple(map(int, input().split())))\r\nx.sort(key = lambda s:s[0])\r\nfor i in range(1, n):\r\n if x[i][0]-x[i][1]/2 - (x[i-1][0]+x[i-1][1]/2) > t:\r\n ans += 2;\r\n elif x[i][0]-x[i][1]/2 - (x[i-1][0]+x[i-1][1]/2) == t:\r\n ans += 1;\r\nprint(ans)\r\n", "n,t = list(map(int,input().split()))\r\n\r\n\r\nh=[]\r\ndef f(g):\r\n\treturn g[0]\r\n\r\n\r\nfor i in range(n):\r\n\txx,aa=list(map(int,input().split()))\r\n\th.append([xx,aa])\r\n\r\nh.sort(key=f)\r\n\r\nb=0\r\nfor i in range(n-1):\t\r\n\txl=h[i][0]+h[i][1]/2\r\n\txr=h[1+i][0]-h[1+i][1]/2\r\n\tif xr-xl>t:\r\n\t\tb+=2\r\n\telif xr-xl==t:\r\n\t\tb+=1\r\nb+=2\r\nprint(b)", "n,t=map(int,input().split())\nlistaUtil=[]\ncounter=0\n\nwhile counter != n:\n x,y=map(int,input().split())\n deltaN=x-y/2\n deltaP=x+y/2\n listaUtil.append((deltaN, deltaP))\n counter+=1\n \nlistaUtil = sorted(listaUtil)\n\nflag,contador=[2],0\n\nwhile contador != n-1:\n \n dis = listaUtil[contador+1][0]\n diff = dis - listaUtil[contador][1]\n \n if t == diff:\n flag.append(1)\n \n elif diff > t:\n flag.append(2)\n \n contador+=1\n \nprint(sum(flag))\n\t\t\t\t \t \t\t\t \t \t \t\t \t \t \t \t \t", "n,m=input().split()\nn,m=int(n),int(m)\nl=[]\ncount=0\nfor i in range(n):\n k=input().split()\n l.append(int(k[0])-(int(k[1])/2))\n l.append(int(k[0])+(int(k[1])/2))\nl.sort()\nfor i in range(1,len(l)-1,2):\n if l[i+1]-l[i]>m:\n count+=2\n elif l[i+1]-l[i] == m:\n count+=1\nprint(count+2) \n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\n\r\nn,t = [int(i) for i in input().split()]\r\na = list(sorted([int(x) for x in input().split()] for j in range(n)))\r\ncont = 2\r\n\r\nfor i in range(1,n):\r\n dist = (a[i][0]-a[i][1]/2)-(a[i-1][0]+a[i-1][1]/2)\r\n if dist >= t: cont += min(2,math.ceil(dist/t))\r\n\r\nprint(cont)\r\n", "# https://codeforces.com/problemset/problem/15/A\r\n\r\ndef func_sol(raw_data):\r\n data = raw_data.split('\\n')[:-1]\r\n n, t = map(int, data[0].split(' '))\r\n flatville = [list(map(int, house.split(' '))) for house in data[1:]]\r\n flatville.sort(key=lambda house: house[0] - house[1] / 2)\r\n\r\n center, length = flatville[0]\r\n last_wall = center + length / 2\r\n pp = 2 # before first + after last\r\n for center, length in flatville[1:]:\r\n left_wall = center - length / 2\r\n right_wall = center + length / 2\r\n if left_wall - last_wall == t:\r\n pp += 1\r\n elif left_wall - last_wall > t:\r\n pp += 2\r\n last_wall = right_wall\r\n \r\n return str(pp) + '\\n'\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", "import bisect\r\n\r\nn, t = map(int, input().split())\r\n\r\nhouses = []\r\nfor i in range (n):\r\n x, a = input().split()\r\n x, a = float(x), int(a)/2\r\n houses.append([x,a])\r\n\r\nhouses = sorted(houses, key=lambda x: x[0])\r\n\r\nplaces = 2\r\nfor i in range(n-1):\r\n house = houses[i][0] + houses[i][1]\r\n next_house = houses[i+1][0] - houses[i+1][1]\r\n\r\n dist = next_house - house\r\n\r\n if dist == t:\r\n places += 1\r\n elif dist > t:\r\n places += 2\r\n\r\nprint(places) \r\n\r\n#print(houses)", "I = lambda : map(int,input().split())\r\nn , t = I()\r\nl = []\r\nans = 2\r\nfor i in range (n) :\r\n x,y = I()\r\n t1,t2 = x-y/2 , x+y/2\r\n l1 = [(t1,t2)]\r\n l = l + l1\r\nl.sort()\r\n#print(l)\r\nle = len(l)\r\nfor i in range (le-1) :\r\n x1,x2 = l[i]\r\n x3,x4 = l[i+1]\r\n if x3-x2 == t :\r\n ans+=1\r\n elif x3-x2 > t :\r\n ans+=2\r\nprint(ans)", "n,t=list(map(int,input().split()))\r\na=sorted([list(map(int,input().split())) for i in range(n)])\r\nb=[a[i][0]-a[i][1]/2-a[i-1][0]-a[i-1][1]/2 for i in range(1,n)]\r\nc=2\r\nfor i in range(n-1):\r\n c+=int(b[i]>t)*2+int(b[i]==t)\r\nprint(c)", "n , t = map(int,input().split())\r\nans=[]\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n ans.append([a-b/2,a+b/2])\r\nans.append([-1000000,-99999])\r\nans.append([100000000,20000000])\r\nans.sort()\r\nc=0\r\n#print(ans)\r\nfor i in range(1,n+1):\r\n if ans[i][0]-ans[i-1][1]>=t:\r\n c+=1\r\n if ans[i+1][0]-ans[i][1]>t:\r\n c+=1\r\n#if ans[1][0]-ans[0][1]>t:\r\n# c+=1\r\n#if ans[-1][0]-ans[-2][1]>t:\r\n# c+=1\r\nprint(c) \r\n\r\n", "temp = input().split()\r\nn, t, ans = int(temp[0]), int(temp[1]), 2\r\n\r\ncont = []\r\nfor i in range(n):\r\n # string_arr = input().split()\r\n # temp = input().split(' ')\r\n # center, house_len = float(temp[0]), float(temp[1]),\r\n # temp = [float(item) for item in input().split(' ')]\r\n # house_center, house_len = temp[0], temp[1]\r\n temp = list(map(float, input().split()))\r\n house_center, house_len = temp[0], temp[1]\r\n\r\n cont.append([house_center - house_len / 2, house_center + house_len / 2])\r\n\r\ncont.sort(key=lambda item: item[0])\r\n\r\nfor i in range(n - 1):\r\n helper = cont[i + 1][0] - cont[i][1]\r\n if helper > t:\r\n ans += 2\r\n elif helper == t:\r\n ans += 1\r\n\r\nprint(ans)\r\n# print(cont)\r\n", "#! /usr/bin/env python3\n\nimport fractions\nimport sys\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n n, t, coordinates = parse(data)\n ways = calc_ways(n, t, coordinates)\n print(ways)\n\n\ndef parse(data):\n n, t = parse_line(data[0])\n coordinates = [parse_line(s) for s in data[1:]]\n return n, t, coordinates\n\n\ndef parse_line(line):\n return tuple(int(s) for s in line.split())\n\n\ndef calc_ways(n, t, houses):\n houses.sort()\n ways = 0\n for (x1, a1), (x2, a2) in zip(houses, houses[1:]):\n dist = x2 - x1 - (a1 + a2) / 2\n if dist > t:\n ways += 2\n elif dist == t:\n ways += 1\n return ways + 2\n\n\n\nif __name__ == '__main__':\n main()\n", "n, t = map(int, input().split())\r\n\r\nx, var = sorted(list(map(int, input().split())) for i in range(n)), 2\r\n\r\nfor i in range(n - 1):\r\n distance = 2 * x[i + 1][0] - x[i + 1][1] - 2 * x[i][0] - x[i][1] #calculate diatance btw existing houses\r\n\r\n if distance > 2 * t: #case when we have enough distance for 2 positions\r\n var += 2\r\n elif distance == 2 * t: #case when we have only one position available\r\n var += 1\r\n\r\nprint(var) #print answer", "n, t = list(map(int, input().split()))\r\nans = 2\r\ncont = list()\r\nfor i in range(n):\r\n temp = [int(item) for item in input().split()]\r\n center, length = temp\r\n cont.append([center - length / 2, center + length / 2])\r\n\r\ncont = sorted(cont, key=lambda item: item[0])\r\n\r\nfor i in range(n - 1):\r\n gap = cont[i + 1][0] - cont[i][1]\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n, t = map(int, input().split())\r\nx = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\ncount = 2\r\nx.sort(key = lambda x: x[0])\r\nfor i in range(n - 1):\r\n if x[i + 1][0] - x[i][0] - (x[i + 1][1] + x[i][1]) / 2 > t:\r\n count += 2\r\n elif x[i + 1][0] - x[i][0] - (x[i + 1][1] + x[i][1]) / 2 >= t:\r\n count += 1\r\n\r\nprint(count)", "n, t = [int(x) for x in input().split()]\r\nl = []\r\nt *= 2\r\nfor i in range(n):\r\n\tx, a = [int(x) for x in input().split()]\r\n\tl.append((x * 2, a * 2))\r\nl.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n\tif l[i][0] - l[i - 1][0] > t + (l[i][1] + l[i - 1][1]) // 2:\r\n\t\tans += 2\r\n\telif l[i][0] - l[i - 1][0] == t + (l[i][1] + l[i - 1][1]) // 2:\r\n\t\tans += 1\r\nprint(ans + 2)", "n, t = map(int, input().split())\nhouses = []\n\nfor i in range(n):\n x, a = map(int, input().split())\n houses.append([x - a * 0.5, x + a * 0.5])\nhouses.sort()\n\ncount = 2\nfor i in range(n-1):\n if houses[i+1][0] - houses[i][1] == t:\n count += 1\n elif houses[i+1][0] - houses[i][1] > t:\n count += 2\n\nprint(count)\n", "n, t = map(int, input().split())\r\ncenter_length = []\r\nfor i in range(n):\r\n center, length = map(int, input().split())\r\n center_length.append([center, length])\r\ncenter_length = sorted(center_length, key=lambda x: x[0])\r\n\r\nanswer = 2\r\nfor i in range(len(center_length)-1):\r\n dist = abs(center_length[i+1][0] - center_length[i][0] - ((center_length[i+1][1])/2 + (center_length[i][1])/2))\r\n if dist > t:\r\n answer += 2\r\n elif dist == t:\r\n answer += 1\r\nprint(answer)\r\n\r\n\r\n", "class Info:\r\n def __init__(self, _left, _right):\r\n self.left = _left\r\n self.right = _right\r\n\r\n def __str__(self):\r\n return f\"[left: {self.left}, right: {self.right}]\"\r\n\r\n\r\nn, t = list(map(int, input().split(' ')))\r\ncont, ans = [], 2\r\nfor i in range(n):\r\n center, size = list(map(int, input().split(' ')))\r\n cont.append(Info(center - size / 2, center + size / 2))\r\n\r\ncont.sort(key=lambda obj: obj.left)\r\n\r\n\r\nfor i in range(n - 1):\r\n if cont[i + 1].left - cont[i].right == t:\r\n ans += 1\r\n elif cont[i + 1].left - cont[i].right > t:\r\n ans += 2\r\n\r\nprint(ans)", "# Main function\r\ndef main():\r\n import sys\r\n input = sys.stdin.readline\r\n mystical_n, mystical_t = map(int, input().split())\r\n mystical_v = []\r\n\r\n for _ in range(mystical_n):\r\n x, a = map(float, input().split())\r\n mystical_v.append((x - a / 2.0, x + a / 2.0))\r\n\r\n mystical_v.sort()\r\n \r\n mystical_count = 2\r\n for p in range(1, mystical_n):\r\n diff = mystical_v[p][0] - mystical_v[p - 1][1]\r\n mystical_count += 2 * (diff > mystical_t) + (diff == mystical_t)\r\n\r\n print(mystical_count)\r\n\r\n# Invoke the main function\r\nmain()\r\n", "n, t = [float(it) for it in input().split(' ')]\r\nn =int(n)\r\ncont = list()\r\nfor i in range(n):\r\n hCenter, hLen = [float(it) for it in input().split(' ')]\r\n cont.append([hCenter - hLen / 2, hCenter + hLen / 2])\r\n\r\ncont.sort(key=lambda item: item[0])\r\nans = 2\r\nfor i in range(n - 1):\r\n gap = cont[i + 1][0] - cont[i][1]\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\nprint(ans)\r\n", "n,t=map(int,input().split())\r\nt=t*2\r\nf=list()\r\nk=2\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n f.append(x*2-y)\r\n f.append(x*2+y)\r\nf.sort()\r\nfor i in range(2,len(f)-1,2):\r\n if f[i]-f[i-1]>t:\r\n k+=2\r\n if f[i]-f[i-1]==t:\r\n k+=1\r\nprint(k)\r\n", "n,t = map(int,input().split())\narr = []\nfor i in range(n):\n c,a = map(int,input().split())\n arr.append([c-a/2,c+a/2])\narr.sort()\n# print(arr)\nans = 2\nfor i in range(1,n):\n if t<arr[i][0]-arr[i-1][1]:\n ans+=2\n elif t==arr[i][0]-arr[i-1][1]: \n ans+=1\nprint(ans) \n \n ", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A, m):\r\n n = len(A)\r\n A.sort()\r\n #ke print('A: %s' % (str(A)))\r\n ans = 2\r\n for i in range(1, n):\r\n delta = A[i][0] - A[i-1][1]\r\n if delta == m:\r\n ans += 1\r\n elif delta > m:\r\n ans += 2\r\n return ans\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n m <<= 1\r\n A = []\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n A.append((2 * a - b, 2 * a + b))\r\n ans = solve(A, m)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, t = map(int, input().split())\n\nans = 2\nl = []\n\nfor i in range(n):\n a = list(map(int, input().split()))\n l.append(a)\n\nl = sorted(l, key = lambda l:l[0], reverse = False)\n\nfor i in range(n-1):\n dist = (l[i+1][0] - l[i+1][1]/2) - (l[i][0] + l[i][1]/2)\n \n if dist == t:\n ans += 1\n elif dist > t:\n ans += 2\nprint(ans)\n\n\t \t\t\t\t\t\t\t\t\t \t\t\t\t\t \t\t\t\t \t", "n,width=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n pos,w=map(int,input().split())\r\n a.append(pos-w/2)\r\n a.append(pos+w/2)\r\na.sort()\r\ns=2\r\nfor i in range(1,2*n-1,2):\r\n if a[i+1]-a[i]>width:\r\n s+=2\r\n elif a[i+1]-a[i]==width:\r\n s+=1\r\nprint(s)\r\n", "n, t = map(int, input().split())\r\ndoma = [[int(j) for j in input().split()] for i in range(n)]\r\ndoma.sort(key = lambda x: x[0])\r\nans = 0\r\nfor i in range(n-1):\r\n if abs((doma[i][1]/2 + doma[i][0]) - (doma[i+1][0]-doma[i+1][1]/2)) == t:\r\n ans+=1\r\n elif abs((doma[i][1]/2 + doma[i][0]) - (doma[i+1][0]-doma[i+1][1]/2))> t:\r\n ans+=2\r\nprint(int(ans)+2)", "from sys import stdin\r\nhouses,centre = map(int,input().split())\r\narray = []\r\nfor l in stdin.readlines():\r\n position,size = map(int,l.split())\r\n array.append((position,size))\r\narray.sort(); choices = 0\r\nfor h in range(1,houses):\r\n left = abs((array[h][0]-array[h][1]/2) - (array[h-1][0]+array[h-1][1]/2))\r\n if left > centre: choices+=2\r\n elif left == centre: choices+=1\r\nprint(choices + 2)", "n,t=map(int,input().split())\r\nlist=[]\r\nfor i in range (n):\r\n x,a=map(int,input().split())\r\n list.append((x-a/2,x+a/2))\r\nlist.sort()\r\nans=2\r\nfor i in range(n-1):\r\n dis=list[i+1][0]-list[i][1]\r\n if dis>t:\r\n ans+=2\r\n elif dis==t:\r\n ans+=1\r\nprint(ans)", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, t = map(int, input().split())\r\n\r\n t = 2 * t\r\n res = 2\r\n h = []\r\n\r\n for i in range(n):\r\n x, a = map(int, input().split())\r\n l, r = 2 * x - a, 2 * x + a\r\n h.append([l, r])\r\n\r\n h.sort(key=lambda x: (x[0], x[1]))\r\n for i in range(1, n):\r\n r1, l2 = h[i - 1][1], h[i][0]\r\n if l2 - r1 == t:\r\n res += 1\r\n elif l2 - r1 > t:\r\n res += 2\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import math\r\na = []\r\nx = []\r\nn,t = map(int,input().split())\r\nfor i in range(n):\r\n c,v = map(int,input().split())\r\n a.append(c)\r\n x.append(v)\r\n#sort\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i] > a[j]:\r\n t1,t2 = a[i],x[i]\r\n a[i],x[i] = a[j],x[j]\r\n a[j],x[j] = t1,t2\r\n#end\r\nsolve = 2\r\nfor i in range(1,n):\r\n if a[i] - x[i] / 2 - a[i - 1] - x[i - 1] / 2 == t:\r\n solve += 1\r\n if a[i] - x[i] / 2 - a[i - 1] - x[i - 1] / 2 > t:\r\n solve += 2\r\nprint(solve)\r\n", "\r\nn,t = list(map(int,input().split()))\r\nh= []\r\no = 2\r\nfor i in range(n):\r\n h.append(list(map(int,input().split())))\r\nh = sorted(h, key= lambda x : x[0])\r\n\r\nfor i in range(len(h)-1):\r\n nu = abs(h[i][0]-h[i+1][0]) - (h[i][1]/2+h[i+1][1]/2)\r\n if(nu == t):\r\n o += 1\r\n elif(nu > t):\r\n o += 2\r\n\r\nprint(o)\r\n", "n, t = [int(item) for item in input().split(' ')]\r\ncont, ans = [], 2\r\nfor i in range(n):\r\n # temp = [float(item) for item in input().split(' ')]\r\n temp = list(map(int, input().split(' ')))\r\n house_center, house_len = temp[0], temp[1]\r\n cont.append([house_center - house_len / 2, house_center + house_len / 2])\r\n\r\n# print(cont)\r\n\r\ncont.sort(key=lambda element: element[0])\r\n#print(cont)\r\nfor i in range(0,n - 1):\r\n gap = cont[i+1][0] - cont[i][1]\r\n if gap > t:\r\n ans += 2\r\n elif gap == t:\r\n ans += 1\r\n\r\nprint(ans)\r\n'''\r\n5 2\r\n10 3\r\n-4 6\r\n50 5\r\n80 4\r\n-30 5\r\n'''\r\n", "import sys\r\nimport math\r\n\r\n\r\n# 9, 1 -> 8, 2 -> 6, 1 -> 5, 1 -> 4, 1\r\ndef main():\r\n # fin_t = lambda r, l, t: (r - l + 1) * t\r\n n, t = (int(i) for i in input().split())\r\n houses = []\r\n for _ in range(n):\r\n x, a = (int(i) for i in input().split())\r\n houses.append((x - a / 2, x + a / 2))\r\n houses.sort()\r\n total = 2\r\n for i in range(len(houses) - 1):\r\n if houses[i + 1][0] - houses[i][1] > t:\r\n total += 2\r\n elif houses[i + 1][0] - houses[i][1] == t:\r\n total += 1\r\n print(total)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=input().split()\r\nc=[]\r\nd=2\r\nfor i in range (0,int(a[0])):\r\n b=input().split()\r\n c.append([int(b[0])-int(b[1])/2,int(b[0])+int(b[1])/2])\r\nc.sort()\r\nfor i in range (1,int(a[0])):\r\n if c[i][0]-c[i-1][1]>int(a[1]):\r\n d+=2\r\n if c[i][0]-c[i-1][1]==int(a[1]):\r\n d+=1\r\nprint(d)\r\n", "import math\r\nn,t=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n x=a-b/2\r\n y=a+b/2\r\n l.append([x,y])\r\nl.sort()\r\nc=0\r\n\r\nfor i in range(n-1):\r\n if(l[i+1][0]-l[i][1]>t):\r\n c+=2\r\n elif(l[i+1][0]-l[i][1]==t):\r\n c+=1\r\nprint(c+2)\r\n \r\n", "n,t=map(int,input().split())\r\nx=[]\r\ny=[]\r\nz=[]\r\nw=0\r\nnumbers=0\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\nfor i in range(len(x)):\r\n left=x[i]-y[i]/2\r\n right=x[i]+y[i]/2\r\n z.insert(0,left)\r\n z.insert(0,right)\r\n #print(left,right)\r\nz.sort()\r\nprint\r\nfor i in range(0,len(z)-2,2):\r\n w=z[i+2]-z[i+1]\r\n if w>t:\r\n numbers+=2\r\n elif w==t:\r\n numbers+=1\r\nnumbers=numbers+2\r\nprint(numbers)\r\n", "n,t=list(map(int,input().split()))\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\nres=2\r\nfor i in range(n-1):\r\n if t==(a[i+1][0]-a[i+1][1]/2)-(a[i][0]+a[i][1]/2):\r\n res+=1\r\n elif t<(a[i+1][0]-a[i+1][1]/2)-(a[i][0]+a[i][1]/2):\r\n res+=2\r\nprint(res)\r\n ", "from functools import cmp_to_key\r\n\r\nclass House:\r\n def __init__(self, newLeftSide, newRightSide):\r\n self.leftSide= newLeftSide\r\n self.rightSide = newRightSide\r\n\r\n\r\ndef sortHouses(house1, house2):\r\n return house1.leftSide - house2.rightSide\r\n\r\ncont, ans = [], 2\r\nn, t= [int(item) for item in input().split(' ')]\r\nfor i in range(n):\r\n center, sides = [int(item) for item in input().split(' ')]\r\n obj = House(center - sides/2, center + sides/2)\r\n cont.append(obj)\r\n\r\ncont.sort(key=cmp_to_key(sortHouses))\r\n\r\nfor i in range(n - 1):\r\n gap = cont[i + 1].leftSide - cont[i].rightSide\r\n if t < gap:\r\n ans += 2\r\n elif t == gap:\r\n ans += 1\r\n\r\nprint(ans)", "import sys; R = sys.stdin.readline\r\nn,t = map(int,R().split())\r\nh = sorted([*map(int,R().split())] for _ in range(n))\r\nres = 2\r\nfor i in range(1,n):\r\n g = h[i][0]-h[i][1]/2-h[i-1][0]-h[i-1][1]/2\r\n if g>t: res += 2\r\n elif g==t: res += 1\r\nprint(res)", "def main():\r\n n, t = map(int, input().split()) #n:Número de casas, t:Lado de la casa que se quiere \r\n \r\n houses = []\r\n for _ in range(n):\r\n houses.append(list(map(float, input().split())))\r\n \r\n houses = sorted(houses) #Ordenamos las coordenadas de mayor a menor\r\n \r\n spa = [] #Espacios entre las casas\r\n x0, a0 = 0, 0 #Coordenadas de la casa anterior\r\n for i in houses:\r\n x1 = i[0] #Coordenada del centro de la casa\r\n a1 = i[1] #Lado de la casa\r\n \r\n spa.append(max(0, (x1-(a1/2)) - (x0+(a0/2))))\r\n x0, a0 = x1, a1\r\n \r\n spa.pop(0) #Eliminamos el primer valor que es cero \r\n \r\n ans = 2\r\n for i in spa:\r\n if i == t: ans += 1\r\n elif i > t: ans += 2\r\n \r\n print(ans)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nimport datetime\r\nfrom typing import List\r\nsys.setrecursionlimit(3001)\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, t = map(int, input().split())\r\nhouse = []\r\nfor i in range(n):\r\n x, a = map(int, input().split())\r\n house.append([x-a/2, x+a/2])\r\nhouse.sort()\r\nans = 2\r\nfor i in range(1, n):\r\n b = house[i][0]-house[i-1][1]\r\n if b == t:\r\n ans += 1\r\n elif b > t:\r\n ans += 2\r\nprint(ans)\r\n" ]

[ "ps = map(lambda _: tuple(map(int, str.split(input()))), range(int(input())))\nlx = rx = ty = by = None\nfoo = lambda v, cv, f: cv if v is None else f(v, cv)\nfor x, y in ps:\n\n lx = foo(lx, x, min)\n rx = foo(rx, x, max)\n by = foo(by, y, min)\n ty = foo(ty, y, max)\n\nprint(max(abs(lx - rx), abs(by - ty)) ** 2)\n", "n = int(input())\r\np = []\r\ns = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n p.append(x)\r\n s.append(y)\r\np.sort()\r\ns.sort()\r\np = p[-1] - p[0]\r\ns = s[-1] - s[0]\r\nprint(max(p, s) ** 2)\r\n", "import math\r\nt=int(input())\r\np,q=list(map(int,input().split()))\r\nmax=p\r\nmay=q\r\nmix=p\r\nmiy=q\r\nfor i in range(t-1):\r\n x,y=list(map(int,input().split()))\r\n if x>max:\r\n max=x\r\n elif x<mix:\r\n mix=x\r\n if y>may:\r\n may=y\r\n elif y<miy:\r\n miy=y\r\ndx=max-mix\r\ndy=may-miy\r\nif dx>=dy:\r\n print(dx**2)\r\nelse:\r\n print(dy**2)\r\n", "a = int(input(\"\"))\r\nXlistOfCoordinates = []\r\nYlistOfCoordinates = []\r\nfor value in range(a):\r\n y = input(\"\").split(\" \")\r\n XlistOfCoordinates.append(int(y[0]))\r\n YlistOfCoordinates.append(int(y[1]))\r\nprint(max(max(XlistOfCoordinates)-min(XlistOfCoordinates),max(YlistOfCoordinates)-min(YlistOfCoordinates))**2)\r\n", "n = int(input())\nl, r = 10**9, -10**9\nb, t = 10**9, -10**9\nfor i in range(n):\n\tx, y = [int(x) for x in input().split()]\n\tl = min(x, l)\n\tr = max(x, r)\n\tb = min(y, b)\n\tt = max(y, t)\nprint(max(r - l, t - b) ** 2)\n", "n = int(input())\r\n\r\nmin_x = 10 ** 9 + 1\r\nmin_y = 10 ** 9 + 1\r\nmax_x = -10 ** 9 - 1\r\nmax_y = -10 ** 9 - 1\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if x > max_x:\r\n max_x = x\r\n if x < min_x:\r\n min_x = x\r\n if y > max_y:\r\n max_y = y\r\n if y < min_y:\r\n min_y = y\r\n\r\nprint(max(max_x - min_x, max_y - min_y) ** 2)\r\n\r\n\r\n", "n = int(input())\nl = []\nfor i in range(n):\n l.append([int(k) for k in input().split()])\nmin_x = 1e9\nmin_y = 1e9\nmax_x = -1e9\nmax_y = -1e9\n\nif n > 1:\n for i in range(n):\n if l[i][0] < min_x:\n min_x = l[i][0]\n if l[i][0] > max_x:\n max_x = l[i][0]\n if l[i][1] < min_y:\n min_y = l[i][1]\n if l[i][1] > max_y:\n max_y = l[i][1]\nz = max(max_x - min_x, max_y - min_y)**2\nif n <= 1:\n z = 0\nprint(z)", "n = int(input())\r\nmx=10000000000\r\nmy=10000000000\r\nvx=-10000000000\r\nvy=-10000000000\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n mx = min(mx,a)\r\n vx = max(vx,a)\r\n my = min(my,b)\r\n vy = max(vy,b)\r\nprint(max(vx-mx,vy-my)*max(vx-mx,vy-my))", "n = int(input())\npx, py = [], []\nfor i in range(n):\n x, y = map(int, input().split())\n px.append(x)\n py.append(y)\nprint(max(max(px)-min(px), max(py)-min(py))**2)\n\n\n \n", "n = int(input())\r\nx_coordinates = []\r\ny_coordinates = []\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n x_coordinates.append(x)\r\n y_coordinates.append(y)\r\n\r\nmin_x = min(x_coordinates)\r\nmax_x = max(x_coordinates)\r\nmin_y = min(y_coordinates)\r\nmax_y = max(y_coordinates)\r\n\r\nwidth = max_x - min_x\r\nheight = max_y - min_y\r\n\r\nmin_area = max(width, height) ** 2\r\nprint(min_area)# 1698952809.3286526", "n = int(input())\r\nx_coords = []\r\ny_coords = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n x_coords.append(x)\r\n y_coords.append(y)\r\nmin_x = min(x_coords)\r\nmax_x = max(x_coords)\r\nmin_y = min(y_coords)\r\nmax_y = max(y_coords)\r\nwidth = max_x - min_x\r\nheight = max_y - min_y\r\nmin_area = max(width, height) ** 2\r\nprint(min_area)\r\n", "a=int(input())\r\nx,y=map(int,input().split())\r\nminx=x\r\nmaxx=x\r\nminy=y\r\nmaxy=y\r\n\r\nfor i in range(a-1):\r\n x,y=map(int,input().split())\r\n minx=min(minx,x)\r\n maxx=max(maxx,x)\r\n miny=min(miny,y)\r\n maxy=max(maxy,y)\r\nprint(max(maxx-minx,maxy-miny)**2)\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na, a1, b, b1 = -10**9, 10**9, -10**9, 10**9\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n if x > a:\r\n a = x\r\n if x < a1:\r\n a1 = x\r\n if y > b:\r\n b = y\r\n if y < b1:\r\n b1 = y\r\nc = max(abs(a-a1), abs(b-b1))\r\nprint(c*c)\r\n", "n=int(input())\r\nX=[]\r\nY=[]\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\tX.append(x)\r\n\tY.append(y)\r\nX.sort()\r\nY.sort()\r\ns=max(X[n-1]-X[0],Y[n-1]-Y[0])\r\nprint(s*s)", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n x,y=list(map(int,input().split()))\r\n a.append(x)\r\n b.append(y)\r\n\r\ns=max(a)-min(a)\r\nt=max(b)-min(b)\r\nif s>t:\r\n print(s*s)\r\nelse:\r\n print(t*t)", "max_x = max_y = 0\r\nmin_x = min_y = 10 ** 9\r\nxs = []\r\nys = []\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n xs.append(x)\r\n ys.append(y)\r\nprint(max((max(xs) - min(xs)), (max(ys) - min(ys)))**2)\r\n", "n=int(input())\r\nlis=[]\r\nfor i in range(n):\r\n lis.append(input().split())\r\nfor i in range(n):\r\n for j in range(2):\r\n lis[i][j]=int(lis[i][j])\r\n\r\nlis0=[]\r\nlis1=[]\r\nfor i in range(n):\r\n lis0.append(lis[i][0])\r\n lis1.append(lis[i][1])\r\nif n==1:\r\n print(1)\r\nelse:\r\n m=max(max(lis0)-min(lis0),max(lis1)-min(lis1))\r\n print(m**2)", "n = int(input())\nX = []\nY = []\nfor i in range(n):\n x, y = [int(s) for s in input().split()]\n X.append(x)\n Y.append(y)\n\nheight = max(Y) - min(Y)\nwidth = max(X) - min(X)\nprint(max(height, width) ** 2)\n\n", "n = int(input())\r\nmaxx = maxy = -10 ** 10\r\nminx = miny = 10 ** 10\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if x > maxx:\r\n maxx = x\r\n\r\n if y > maxy:\r\n maxy = y\r\n\r\n if y < miny:\r\n miny = y\r\n\r\n if x < minx:\r\n minx = x\r\n\r\nprint(max((maxx - minx), (maxy - miny)) ** 2)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx, y = [], []\r\n\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\nx.sort()\r\ny.sort()\r\n\r\nprint(max((x[-1] - x[0]), (y[-1] - y[0])) ** 2)", "n = int(input())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n p, q = map(int, input().split())\r\n x.append(p)\r\n y.append(q)\r\ndx = max(x) - min(x)\r\ndy = max(y) - min(y)\r\nprint(max(dx, dy) ** 2)\r\n\r\n\r\n", "for i in range(int(input())):\r\n x, y = map(int, input().split())\r\n if not i:\r\n a = b = x\r\n u = v = y\r\n a, b = min(a, x), max(b, x)\r\n u, v = min(u, y), max(v, y)\r\nprint(max(b - a, v - u) ** 2)", "n = int(input())\nN, M = 10000000000, -10000000000\nlx, rx, dy, uy = N, M, N, M\nfor i in range(n):\n\tx, y = map(int, input().split())\n\tlx = min(lx, x)\n\trx = max(rx, x)\n\tdy = min(dy, y)\n\tuy = max(uy, y)\nt = max((rx - lx),(uy - dy))\nprint(t*t)\n", "\r\nn = int(input())\r\n\r\n\r\nmax_r = 0\r\n\r\nx, y = map(int, input().split())\r\nminX = x\r\nmaxX = x\r\nminY = y\r\nmaxY = y\r\nfor i in range(n - 1):\r\n x, y = map(int, input().split())\r\n minX = min(minX, x)\r\n maxX = max(maxX, x)\r\n minY = min(minY, y)\r\n maxY = max(maxY, y)\r\n\r\nprint(max(maxX- minX, maxY - minY)** 2)", "n = int(input())\r\nminX = 1000000005\r\nminY = minX\r\nmaxX = -1000000005\r\nmaxY = maxX\r\n\r\nfor i in range(n):\r\n t, t2 = map(int, input().split())\r\n minY = min(minY, t2)\r\n maxY = max(maxY, t2)\r\n minX = min(minX, t)\r\n maxX = max(maxX, t)\r\n\r\nprint(max(maxX-minX,maxY-minY)**2)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import inf\r\n\r\ndef main():\r\n n=int(input())\r\n xmin=inf\r\n xmax=-inf\r\n ymin=inf\r\n ymax=-inf\r\n for i in range(n):\r\n a,b=list(map(int,input().split()))\r\n xmin=min(a,xmin)\r\n xmax=max(a,xmax)\r\n ymin=min(b,ymin)\r\n ymax=max(b,ymax)\r\n len=max((xmax-xmin),(ymax-ymin))\r\n print(len*len)\r\n\r\nfor _ in range(1):\r\n main()\r\n", "def main():\n n = int(input())\n lx, ly = [], []\n for _ in range(n):\n x, y = map(int, input().split())\n lx.append(x)\n ly.append(y)\n print(max(max(l) - min(l) for l in (lx, ly)) ** 2)\n\n\nif __name__ == '__main__':\n main()", "n=int(input(\"\"))\na=[]\nb=[]\nfor i in range(n):\n x,y=input(\"\").split()\n a.append(int(x))\n b.append(int(y))\nmax=0\nfor i in range(n):\n for j in range(i+1,n):\n if (a[i]-a[j])**2>max:\n max=(a[i]-a[j])**2\n d={\"a\":max}\n if (b[i]-b[j])**2>max:\n max=(b[i]-b[j])**2\n d={\"a\":max}\n \n\n \nprint(d[\"a\"])\n", "\n#f\n\nn = int(input())\n\nxmin = 10**9\nxmax = -10**9\n\nymin = 10**9\nymax = -10**9\n\nfor i in range(n):\n x, y = map(int, input().split())\n xmin = min(xmin, x)\n xmax = max(xmax, x)\n\n ymin = min(ymin, y)\n ymax = max(ymax, y)\n\nluas_x = (xmax - xmin) ** 2\nluas_y = (ymax - ymin) ** 2\nprint(max(luas_x, luas_y))\n \t\t\t \t\t\t \t\t\t\t \t\t \t \t\t \t \t\t", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-05-29 17:08:10\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nimport sys\r\nsys.setrecursionlimit(10**5+1)\r\n\r\ninf = int(10 ** 20)\r\nmax_val = inf\r\nmin_val = -inf\r\n\r\nRW = lambda : sys.stdin.readline().strip()\r\nRI = lambda : int(RW())\r\nRMI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nRWI = lambda : [x for x in sys.stdin.readline().strip().split()]\r\n\r\n\r\nnb_mines = RI()\r\nx_coord , y_coord = [], []\r\nfor _ in range(nb_mines):\r\n x, y = RMI()\r\n x_coord.append(x)\r\n y_coord.append(y)\r\ncandidate_x = max(x_coord) - min(x_coord)\r\ncandidate_y = max(y_coord) - min(y_coord)\r\nsides = max(candidate_x, candidate_y)\r\nprint(sides ** 2)", "a, b = [], []\r\nfor _ in range(int(input())):\r\n l = list(map(int, input().split()))\r\n a.append(l[0])\r\n b.append(l[1])\r\nprint(max(max(a) - min(a), max(b) - min(b)) ** 2)", "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 rec(v):\n global maxi\n maxi = max(maxi, sum(v))\n if len(v) <= 4:\n return \n odds = [x for i, x in enumerate(v) if i % 2 == 1]\n evens = [x for i, x in enumerate(v) if i % 2 == 0]\n rec(odds)\n rec(evens)\n\n\ndef main():\n n = int(input())\n min_x, max_x, min_y, max_y = float('inf'), float('-inf'), float('inf'), float('-inf')\n for i in range(n):\n x, y = tuple(map(int, input().split()))\n min_x = min(x, min_x)\n max_x = max(x, max_x)\n min_y = min(y, min_y)\n max_y = max(y, max_y)\n x_dist = (max_x - min_x)\n y_dist = (max_y - min_y)\n return max(x_dist, y_dist) * max(y_dist, x_dist)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n print(main())\n", "def precious(lst1, lst2):\r\n l1, l2 = sorted(lst1), sorted(lst2)\r\n return max(l1[len(l1) - 1] - l1[0], l2[len(lst2) - 1] - l2[0]) * max(l1[len(l1) - 1] - l1[0],\r\n l2[len(lst2) - 1] - l2[0])\r\n\r\n\r\nn = int(input())\r\na, b = list(), list()\r\nfor i in range(n):\r\n s, t = [int(j) for j in input().split()]\r\n a.append(s)\r\n b.append(t)\r\nprint(precious(a, b))\r\n", "import sys\r\n\r\ncasos = int(input())\r\nminx = 1000000001\r\nminy = 1000000001\r\nmaxx = -1000000001\r\nmaxy = -1000000001\r\nfor i in range(casos):\r\n line = input()\r\n v = [int(x) for x in line.split()]\r\n minx = min(minx, v[0])\r\n miny = min(miny, v[1])\r\n maxx = max(maxx, v[0])\r\n maxy = max(maxy, v[1])\r\n#print(minx, maxx, miny, maxy)\r\nresp = max(maxx-minx, maxy-miny)\r\nprint(resp*resp)", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nx_neg = 10**9\r\nx_pos = -10**9\r\ny_neg = 10**9\r\ny_pos = -10**9\r\nn = int(inpu())\r\nfor _ in range(n) :\r\n x, y = map(int, inpu().split())\r\n x_neg = min(x, x_neg)\r\n x_pos = max(x, x_pos)\r\n y_neg = min(y, y_neg)\r\n y_pos = max(y, y_pos)\r\nx = x_pos - x_neg\r\ny = y_pos - y_neg\r\na = max(x, y)\r\nprin(str(a*a) + '\\n')", "#See the constraints; check if Brute force is useful\r\n#Figure out a realtion or general formula if possible\r\n#Find the corner cases\r\n#dp,prefix sum, greedy solution or logical \r\n#Ek baar aur kr bro\r\n#Be organised \r\n#Think hard you can do it\r\n\r\ndef singleinput():R = int(input());return R\r\ndef strinput():R = str(input());return R\r\ndef intarray():As = list(map(int,input().split()));return As\r\ndef matrixinput(arr): As = list(map(int,input().split())); arr.append(As)\r\n\r\nx = []\r\ny = []\r\nfor i in range(singleinput()):\r\n arr = intarray()\r\n x.append(arr[0])\r\n y.append(arr[1])\r\nc,d = abs(max(x)-min(x)),abs(max(y)-min(y))\r\nprint(max(c,d)**2)\r\n", "# coding: utf-8\nn = int(input())\ntmp = [int(i) for i in input().split()]\nleft = tmp[0]\nright = tmp[0]\nup = tmp[1]\ndown = tmp[1]\nfor i in range(1,n):\n tmp = [int(i) for i in input().split()]\n if left > tmp[0]:\n left = tmp[0]\n if right < tmp[0]:\n right = tmp[0]\n if up < tmp[1]:\n up = tmp[1]\n if down > tmp[1]:\n down = tmp[1]\nprint(pow(max(right-left,up-down),2))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = int(input().strip())\r\n\r\nmin_x = 10e9\r\nmin_y = 10e9\r\n\r\nmax_x = -10e9\r\nmax_y = -10e9\r\n\r\nfor _ in range(n):\r\n x, y = inlt()\r\n if x > max_x:\r\n max_x = x\r\n if x < min_x:\r\n min_x = x\r\n \r\n if y > max_y:\r\n max_y = y\r\n if y < min_y:\r\n min_y = y\r\n \r\nside = max(abs(min_x-max_x), abs(max_y-min_y))\r\nprint(int(side*side))\r\n", "n = int(input())\r\nx = [0]*n\r\ny = [0]*n\r\nfor i in range(n):\r\n x[i],y[i] = map(int,input().split())\r\nx.sort()\r\ny.sort()\r\nres = (max(x[-1]-x[0],y[-1]-y[0]))**2\r\nprint(res)", "n=int(input())\r\n# n,k=map(int,input().split())\r\n# for _ in range(int(input())):\r\n# coor,ap=map(int,input().split())\r\n# s=(input())\r\n# s,t=input().split()\r\n# arr=list(map(int,input().split()))\r\n# for _ in range(int(input())):\r\n# n,q=map(int,input().split());s=(input())\r\nmat=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n mat.append([a,b])\r\nmx=-1;my=-1\r\nfor i in mat:\r\n for j in mat:\r\n if i!=j:\r\n if mx<abs(j[0]-i[0]):\r\n mx=abs(j[0]-i[0])\r\n if my<abs(j[1]-i[1]):\r\n my=abs(j[1]-i[1])\r\nprint(max(mx,my)**2)", "n=int(input())\r\na=[];b=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append(x);b.append(y)\r\nprint(max(max(a)-min(a),max(b)-min(b)) **2)\r\n ", "n = int(input())\nxl, yl = map(int, input().split())\nxr, yr = map(int, input().split())\nif xl > xr : xl, xr = xr, xl\nif yl > yr : yl, yr = yr, yl\nfor i in range(n-2):\n x, y = map(int, input().split())\n xl = min(xl, x)\n xr = max(xr, x)\n yl = min(yl, y)\n yr = max(yr, y)\nprint(max(yr-yl, xr-xl)**2)\n\n \n", "n = int(input())\nx = []\ny = []\nfor _ in range(n):\n a,b = map(int,input().split())\n x.append(a)\n y.append(b)\nx.sort()\ny.sort()\ncnt = max(x[-1]-x[0],y[-1]-y[0])\nprint(cnt*cnt)\n", "n=int(input())\r\na=d=10**10\r\nb=c=(-1)*10**10\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a=min(a,x)\r\n b=max(b,x)\r\n c=max(c,y)\r\n d=min(d,y)\r\n#print(a)\r\nprint(max((b-a)**2,((c-d)**2)))", "n = int(input())\r\nmin_x = float('inf')\r\nmax_x = float('-inf')\r\nmin_y = float('inf')\r\nmax_y = float('-inf')\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n min_x = min(min_x, x)\r\n max_x = max(max_x, x)\r\n min_y = min(min_y, y)\r\n max_y = max(max_y, y)\r\n\r\nside = max(max_x - min_x, max_y - min_y)\r\narea = side * side\r\nprint(area)\r\n", "from sys import stdin; inp = stdin.readline\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = I()\r\n xs = []\r\n ys = []\r\n for i in range(n):\r\n x, y = IA()\r\n xs.append(x)\r\n ys.append(y)\r\n \r\n vert = abs(min(ys)-max(ys))\r\n horiz = abs(min(xs)-max(xs))\r\n \r\n return pow(max(vert, horiz), 2)\r\n\r\nif __name__ == '__main__':\r\n print(main())", "def main():\r\n n = int(input())\r\n mines = []\r\n minx, miny, maxx, maxy = 1e9, 11e9, -1e9, -1e9\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n\r\n minx = min(minx, x)\r\n maxx = max(maxx, x)\r\n miny = min(miny, y)\r\n maxy = max(maxy, y)\r\n\r\n sidex = maxx - minx\r\n sidey = maxy - miny\r\n res = max(sidex, sidey) ** 2\r\n print(res)\r\n\r\n \r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int (input())\r\npointx,pointy=[],[]\r\nfor i in range(n):\r\n x , y = map(int,input().split())\r\n pointx.append(x)\r\n pointy.append(y)\r\nans = max(max(pointx)-min(pointx),max(pointy)-min(pointy))\r\nprint(ans * ans)", "#!/usr/bin/env python3\r\n\r\nnumber_of_mines = int(input())\r\nx_coords = []\r\ny_coords = []\r\nfor _ in range(number_of_mines):\r\n x, y = (int(value) for value in input().split())\r\n x_coords.append(x)\r\n y_coords.append(y)\r\nprint(max(abs(max(x_coords) - min(x_coords)), abs(max(y_coords) - min(y_coords))) ** 2)\r\n \r\n\r\n", "n = int(input())\r\nminX, maxX = int(2e9), -int(2e9)\r\nminY, maxY = int(2e9), -int(2e9)\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n minX = min(minX, x)\r\n maxX = max(maxX, x)\r\n minY = min(minY, y)\r\n maxY = max(maxY, y)\r\nprint(max(maxX - minX, maxY - minY) ** 2)\r\n", "n=int(input())\nminX=10**10\nmaxX=-(10**10)\nminY=10**10\nmaxY=-(10**10)\nfor i in range(n):\n mine=list(map(int,input().split()))\n minX=min(mine[0],minX)\n maxX=max(mine[0],maxX)\n minY=min(mine[1],minY)\n maxY=max(mine[1],maxY)\nprint(max(maxX-minX, maxY-minY)**2)\n", "\r\nmode=\"filee\"\r\nif mode==\"file\":f=open(\"test.txt\",\"r\")\r\ng=[]\r\nh=[]\r\nif mode==\"file\":n=int(f.readline())\r\nelse:n=int(input())\r\nfor z in range(n):\r\n if mode==\"file\":[x,y]=[int(x) for x in f.readline().split()]\r\n else:[x,y]=[int(x) for x in input().split()]\r\n g.append(x)\r\n h.append(y)\r\nprint(max(max(g)-min(g), max(h)-min(h))**2)\r\n\r\nif mode==\"file\":f.close()\r\n", "n=int(input())\nxx=[]\nyy=[]\nfor i in range(n):\n x,y=map(int,input().split())\n xx.append(x)\n yy.append(y)\ndx=max(xx)-min(xx)\ndy=max(yy)-min(yy)\nprint(max(dx,dy)**2)\n\n\t \t \t\t\t\t \t \t \t\t\t \t \t\t\t\t \t\t", "n=int(input())\r\nx=[]\r\ny=[]\r\nfor i in range(n):\r\n x1,y1=input().split()\r\n x1=int(x1)\r\n y1=int(y1)\r\n x.append(x1)\r\n y.append(y1)\r\nmx=max(x)\r\nmnx=min(x)\r\nmy=max(y)\r\nmny=min(y)\r\nd1=abs(mx-mnx)\r\nd2=abs(my-mny)\r\nd3=max(d1,d2)\r\nprint(d3*d3)\r\n", "n = int(input())\nx = []\ny = []\nfor i in range(n):\n a, b = list(map(int, input().rstrip().split()))\n x += [a]\n y += [b]\nx1 = max(x) - min(x)\ny1 = max(y) - min(y)\ns = max(x1, y1)\nprint(s * s)", "n = int(input())\nxa = []\nya = []\nfor _ in range(n):\n\tx, y = map(int,input().split())\n\txa.append(x)\n\tya.append(y)\nprint(max(max(xa)-min(xa),max(ya)-min(ya))**2)", "n = int(input())\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\n\r\nx.sort()\r\ny.sort()\r\n\r\nprint(max(x[-1] - x[0], y[-1] - y[0]) ** 2)\r\n", "import math\r\nt=int(input())\r\nx,y=list(map(int,input().split()))\r\nmax=x\r\nmay=y\r\nmix=x\r\nmiy=y\r\nfor i in range(t-1):\r\n x,y=list(map(int,input().split()))\r\n if x>max:\r\n max=x\r\n elif x<mix:\r\n mix=x\r\n if y>may:\r\n may=y\r\n elif y<miy:\r\n miy=y\r\ndx=max-mix\r\ndy=may-miy\r\nif dx>=dy:\r\n print(dx**2)\r\nelse:\r\n print(dy**2)\r\n", "x,y = zip(*[map(int, input().split()) for i in range(int(input()))])\r\nprint(max(max(i)-min(i) for i in [x,y])**2)\r\n", "# 天天学数学是吧\r\nn = int(input())\r\n# inf defining\r\nmin_x = min_y = float('inf')\r\nmax_x = max_y = float('-inf')\r\n# multiple\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n min_x = min(min_x, x)\r\n max_x = max(max_x, x)\r\n min_y = min(min_y, y)\r\n max_y = max(max_y, y)\r\n# size\r\nprint(max(max_x - min_x, max_y - min_y) ** 2)\r\n", "n=int(input())\r\nINF=99**9\r\nx_l=INF\r\nx_h=-INF\r\ny_l=INF\r\ny_h=-INF\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n x_l=min(x,x_l)\r\n x_h=max(x,x_h)\r\n y_l=min(y,y_l)\r\n y_h=max(y,y_h)\r\nxx=x_h-x_l\r\nyy=y_h-y_l\r\nprint(max(xx,yy)**2)\r\n", "n = int(input())\r\nx, y = [], []\r\nfor j in range(n):\r\n xj, yj = [int(j) for j in input().split()]\r\n x.append(xj)\r\n y.append(yj)\r\nx_min = x[0]\r\ny_min = y[0]\r\nx_max = x[0]\r\ny_max = y[0]\r\nfor j in range(1, n):\r\n x_min = min(x_min, x[j])\r\n y_min = min(y_min, y[j])\r\n x_max = max(x_max, x[j])\r\n y_max = max(y_max, y[j])\r\nl = x_max - x_min\r\nr = y_max - y_min\r\nprint(max(l, r) ** 2)\r\n", "n = int(input())\r\nxs = []\r\nys = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n xs.append(x)\r\n ys.append(y)\r\nprint(max(max(xs) - min(xs), max(ys) - min(ys)) **2)", "def shag (x,y,xmin,ymin):\r\n a, b = list(map(int, input(). split()))\r\n x=max(a,x)\r\n y=max(b,y)\r\n xmin=min (a,xmin)\r\n ymin=min (b,ymin)\r\n return x, y, xmin, ymin\r\n\r\nk=int(input())\r\nx, y = list(map(int, input().split()))\r\nxmin=x\r\nymin=y\r\nfor i in range (1,k,1):\r\n x,y,xmin,ymin = shag (x,y,xmin,ymin)\r\n\r\nprint (pow(max(x-xmin,y-ymin),2))\r\n", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nxmin = ymin = 1000000001\r\nxmax = ymax = -1000000001\r\n\r\nfor i in range(n):\r\n x, y = [int(x) for x in (sys.stdin.readline()).split()]\r\n if(x > xmax):\r\n xmax = x\r\n if(y > ymax):\r\n ymax = y\r\n if(x < xmin):\r\n xmin = x\r\n if(y < ymin):\r\n ymin = y\r\n\r\nt = max(int(math.fabs(xmax - xmin)), int(math.fabs(ymax - ymin))) \r\nprint(t ** 2)\r\n \r\n", "n=int(input())\r\nl,r,u,d=int(1e10),-int(1e10),-int(1e10),int(1e10)\r\nfor i in \" \"*n:\r\n x,y=map(int,input().split())\r\n l=min(l,y)\r\n r=max(y,r)\r\n u=max(u,x)\r\n d=min(d,x)\r\nprint(max((r-l)**2,(u-d)**2))", "n = int(input())\r\nminx, maxx, miny, maxy = (10**10), -(10**10), (10**10), -(10**10)\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n if x > maxx:\r\n maxx = x\r\n if y > maxy:\r\n maxy = y\r\n if x < minx:\r\n minx = x\r\n if y < miny:\r\n miny = y\r\nprint(max(maxx - minx, maxy - miny)**2)", "n = int(input())\r\nmin_x, min_y, max_x, max_y = 10**9, 10**9, -10**9, -10**9\r\nfor _ in range(n):\r\n x, y = (int(num) for num in input().split(' '))\r\n min_x, min_y = min(x, min_x), min(y, min_y)\r\n max_x, max_y = max(x, max_x), max(y, max_y)\r\nprint(max(max_x-min_x, max_y-min_y)**2)", "# mukulchandel\r\nimport sys\r\nn=int(sys.stdin.readline())\r\nmx=-1234567890\r\nmy=-1234567890\r\nnx=1234567890\r\nny=1234567890\r\nfor i in range(n):\r\n x,y=map(int,sys.stdin.readline().split())\r\n mx=max(mx,x)\r\n my=max(my,y)\r\n nx=min(nx,x)\r\n ny=min(ny,y)\r\nprint(max((mx-nx),(my-ny))**2)", "n=int(input())\r\nx,y=[],[]\r\nfor i in range(n):\r\n x1,y1=input().split()\r\n x.append(int(x1))\r\n y.append(int(y1))\r\n\r\nmaxx=max(x)-min(x)\r\nmaxy=max(y)-min(y)\r\n\r\nif(maxy>maxx):\r\n print(maxy*maxy)\r\nelse:\r\n print(maxx*maxx)\r\n", "def solve(ps):\r\n return max(\r\n max(ps, key=lambda x: x[0])[0] - min(ps, key=lambda x: x[0])[0],\r\n max(ps, key=lambda x: x[1])[1] - min(ps, key=lambda x: x[1])[1],\r\n )**2\r\n\r\nn = int(input())\r\nps = [list(map(int, input().split())) for i in range(n)]\r\nprint(solve(ps))\r\n", "n = int(input())\n\npaling_kanan = -1000000000\npaling_kiri = 1000000000\npaling_atas = -1000000000\npaling_bawah = 1000000000\n\nsisi_x = 0\nsisi_y = 0\nsisi_kota = 1\n\nfor i in range (n):\n x,y = map(int, input(). split())\n \n paling_kiri = min(paling_kiri, x)\n paling_kanan = max (paling_kanan, x)\n \n paling_atas = max (paling_atas, y)\n paling_bawah = min (paling_bawah, y)\n\n sisi_x = paling_kanan - paling_kiri\n sisi_y = paling_atas - paling_bawah\n\nif sisi_x >= sisi_y:\n sisi_kota = sisi_x\n\nelse:\n sisi_kota = sisi_y\n\nluas_minimal = sisi_kota ** 2\nprint (luas_minimal)\n\n \t \t\t\t \t\t\t \t \t\t \t\t\t \t \t \t", "from fractions import gcd\nfrom sys import stdin\n\nlines = list(filter(None, stdin.read().split('\\n')))\n\ndef parseline(line):\n\treturn list(map(int, line.split()))\n\nlines = list(map(parseline, lines))\n\nn, = lines[0]\n\nINF = 10**9 + 1\n\nmaxx = -INF\nmaxy = -INF\nminx = INF\nminy = INF\n\nfor xi,yi in lines[1:n+1]:\n\tmaxx = max(maxx, xi)\n\tminx = min(minx, xi)\n\tmaxy = max(maxy, yi)\n\tminy = min(miny, yi)\n\nprint( max(maxx - minx, maxy - miny) ** 2)\n", "n = int(input())\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = x1, y1\r\nfor i in range(n - 1):\r\n x, y = map(int, input().split())\r\n x1, x2 = min(x1, x), max(x2, x)\r\n y1, y2 = min(y1, y), max(y2, y)\r\nprint(max(x2 - x1, y2 - y1) ** 2)", "n = int(input())\r\nx, y = map(int,input().split())\r\nxmin = x\r\nxmax = x\r\nymin = y\r\nymax = y\r\nfor i in range(n-1):\r\n x, y = map(int,input().split())\r\n xmin = min(xmin, x)\r\n xmax = max(xmax, x)\r\n ymin = min(ymin, y)\r\n ymax = max(ymax, y)\r\nprint(max(ymax - ymin, xmax - xmin) ** 2)", "def main():\n n = int(input())\n xs, ys = [], []\n for _ in range(n):\n x, y = map(int, input().split())\n xs.append(x)\n ys.append(y)\n print(max(max(xs)-min(xs), max(ys)-min(ys)) ** 2)\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "I=lambda:list(map(int,input().split()))\r\nn,k,T=I()\r\nt=[I()for _ in '0'*k]\r\ndef b(h,w,r,a):\r\n\tif h>n:a+=[r]\r\n\telse:\r\n\t\tb(h+1,w,r,a)\r\n\t\tfor f,s,v in t:\r\n\t\t\tif f==h and s in w:b(h+1,w-set([s]),r+v,a)\r\n\treturn a\r\nprint(sorted(b(1,set(range(1,n+1)), 0,[]))[T-1])", "def g(t, d):\r\n j = len(d) - 1\r\n i = len(t) - 1\r\n while j >= 0:\r\n while i >= 0 and t[i] > d[j]: i -= 1\r\n t.insert(i + 1, d[j])\r\n j -= 1\r\n \r\nn, k, t = map(int, input().split())\r\np = [0] * k\r\nfor i in range(k):\r\n h, w, r = map(int, input().split())\r\n p[i] = (r, w, h)\r\np.sort()\r\nq, a, b = [0], [0] * (n + 1), [0] * (n + 1) \r\ndef f(i, s):\r\n global p, q, a, b, k, t\r\n r = [(p[j][1], p[j][2], s + p[j][0], j + 1) for j in range(i, k) if a[p[j][1]] == b[p[j][2]] == 0]\r\n g(q, [s[2] for s in r])\r\n if len(q) > t: q = q[:t]\r\n for h, w, s, j in r:\r\n if len(q) == t and s >= q[t - 1]: break\r\n a[h], b[w] = 1, 1\r\n f(j, s)\r\n a[h], b[w] = 0, 0\r\nf(0, 0)\r\nprint(q[t - 1])", "n, k, t = map(int, input().split())\r\nl = (1 << (n + 1)) - 1\r\n\r\np = [tuple(map(int, input().split())) for i in range(k)]\r\np.sort(key = lambda i: i[2])\r\na, b = -1, sum(i[2] for i in p)\r\n\r\ndef g(j, s, u, v):\r\n global k, p, t\r\n k += 1\r\n if k > t: return\r\n for i, (h, w, r) in enumerate(p[j:], j + 1):\r\n if r > s: break\r\n if ((u >> h) & 1) and ((v >> w) & 1):\r\n g(i, s - r, u - (1 << h), v - (1 << w))\r\n \r\ndef f(s):\r\n global k, l\r\n k = 0\r\n g(0, s, l, l)\r\n return k\r\n \r\nwhile b - a > 1:\r\n c = (a + b) // 2\r\n if f(c) < t: a = c\r\n else: b = c\r\n \r\nprint(b)", "from collections import defaultdict\r\nn,k,t=map(int,input().split())\r\nmp=defaultdict(int)\r\nfor _ in range(k):\r\n a,b,w=map(int,input().split())\r\n mp[(a,b)]=w\r\ndef helper(curr,sum,mid):\r\n if curr>n:\r\n cnt[0]+=1\r\n return \r\n else :\r\n helper(curr+1,sum,mid)\r\n for i in range(1,n+1):\r\n if i not in vis and mp[(curr,i)]>0 and sum+mp[(curr,i)]<=mid:\r\n vis.add(i)\r\n helper(curr+1,sum+mp[(curr,i)],mid)\r\n vis.remove(i)\r\n \r\nl=0\r\nh=n*1000\r\nres=float(\"inf\")\r\nwhile l<=h:\r\n mid=(l+h)//2\r\n cnt=[0]\r\n vis=set()\r\n \r\n helper(1,0,mid)\r\n if cnt[0]>=t:\r\n res=min(mid,res)\r\n h=mid-1\r\n else :\r\n l=mid+1\r\nprint(res)", "n, k, t = map(int, input().split())\r\np = [0] * k\r\nfor i in range(k):\r\n h, w, r = map(int, input().split())\r\n p[i] = (r, w, h)\r\np.sort()\r\nq, a, b = [], [0] * (n + 1), [0] * (n + 1) \r\ndef f(i, s):\r\n global p, q, a, b, k\r\n q.append(s)\r\n while i < k:\r\n h, w = p[i][1], p[i][2]\r\n if a[h] == b[w] == 0:\r\n a[h], b[w] = 1, 1\r\n f(i + 1, s + p[i][0])\r\n a[h], b[w] = 0, 0\r\n i += 1 \r\nf(0, 0)\r\nq.sort()\r\nprint(q[t - 1])" ]

[ "def lca_1(v, u, w, d):\r\n while u != v:\r\n if u < v:\r\n u, v = v, u\r\n if u not in d.keys():\r\n d[u] = w\r\n else:\r\n d[u] += w\r\n u = u // 2\r\n return\r\n\r\n\r\ndef lca_2(v, u, d):\r\n c = 0\r\n while u != v:\r\n if u < v:\r\n u, v = v, u\r\n if u in d.keys():\r\n c += d[u]\r\n u = u // 2\r\n return c\r\n\r\n\r\nd = dict()\r\nfor i in range(int(input())):\r\n f = list(map(int, input().split()))\r\n if f[0] == 1:\r\n lca_1(f[1], f[2], f[3], d)\r\n else:\r\n print(lca_2(f[1], f[2], d))", "n=int(input())\r\nd={}\r\ndef lca(u,v,w) :\r\n res=0\r\n while u!=v :\r\n if u<v :\r\n v,u=u,v\r\n d[u]=d.get(u,0)+w\r\n res+=d[u]\r\n u=u//2\r\n return res\r\nfor i in range(n) :\r\n l=list(map(int,input().split()))\r\n if l[0]==1 :\r\n lca(l[1],l[2],l[3])\r\n else :\r\n print(lca(l[1],l[2],0))\r\n \r\n \r\n \r\n", "def UCLN(a,b):\n while (a!=b):\n if a > b:\n a = a//2\n else:\n b = b//2\n return a\n\ndef find_path(u,v):\n ucln = UCLN(u,v)\n arr1 = []\n arr2 = []\n while (u >= ucln):\n arr1.append(u)\n u = u//2\n while (v > ucln):\n arr2.append(v)\n v = v//2\n return arr1 + arr2[::-1]\n\n\np = int(input())\ndic = {}\n\nfor i in range(p):\n value = list(map(int, input().split()))\n action = value[0]\n if action == 1:\n path = find_path(value[1], value[2])\n for i in range(len(path)-1):\n if \"{}{}\".format(path[i],path[i+1]) not in dic and \"{}{}\".format(path[i+1],path[i]) not in dic:\n dic[\"{}{}\".format(path[i],path[i+1])] = value[3]\n dic[\"{}{}\".format(path[i+1],path[i])] = value[3]\n else:\n dic[\"{}{}\".format(path[i],path[i+1])] += value[3]\n dic[\"{}{}\".format(path[i+1],path[i])] += value[3]\n else:\n #action == 2\n total = 0\n path = find_path(value[1], value[2])\n for i in range(len(path)-1):\n if \"{}{}\".format(path[i],path[i+1]) in dic:\n total += dic[\"{}{}\".format(path[i],path[i+1])]\n print (total)\n", "def find_path(x,y):\n\tp1,p2 = [],[]\n\twhile x!=0:\n\t\tp1.append(x)\n\t\tx = x//2\n\twhile y!=0:\n\t\tp2.append(y)\n\t\ty = y//2\n\tp1 = p1[::-1]\n\tp2 = p2[::-1]\n\t# print (p1,p2)\n\tfor i in range(min(len(p1),len(p2))):\n\t\tif p1[i]==p2[i]:\n\t\t\tind = i\n\t\telse:\n\t\t\tbreak\n\tpath = []\n\tfor i in range(ind,len(p1)):\n\t\tpath.append(p1[i])\n\tpath = path[::-1]\n\tfor i in range(ind+1,len(p2)):\n\t\tpath.append(p2[i])\n\n\treturn path\n\n\nq = int(input())\ncost = {}\nfor i in range(q):\n\ta = list(map(int,input().split()))\n\tb = find_path(a[1],a[2])\n\t# print (b)\n\tif a[0] == 1:\n\t\tw = a[-1]\n\t\tfor j in range(1,len(b)):\n\t\t\tif (b[j],b[j-1]) not in cost:\n\t\t\t\tcost[(b[j],b[j-1])] = w\n\t\t\t\tcost[(b[j-1],b[j])] = w\n\t\t\telse:\n\t\t\t\tcost[(b[j],b[j-1])] += w\n\t\t\t\tcost[(b[j-1],b[j])] += w\n\telse:\n\t\tans = 0\n\t\tfor j in range(1,len(b)):\n\t\t\tif (b[j],b[j-1]) in cost:\n\t\t\t\tans += cost[(b[j],b[j-1])]\n\t\tprint (ans)\n", "\r\ndef add_edges(s1, s2, w):\r\n global edges\r\n i = 0\r\n while i < len(s1) and i < len(s2) and s1[i] == s2[i]:\r\n i += 1 \r\n j = len(s1)\r\n while j > i:\r\n if s1[:j] in edges:\r\n edges[s1[:j]] += w\r\n else:\r\n edges[s1[:j]] = w \r\n j -= 1\r\n j = len(s2)\r\n while j > i:\r\n if s2[:j] in edges:\r\n edges[s2[:j]] += w\r\n else:\r\n edges[s2[:j]] = w \r\n j -= 1 \r\n \r\ndef way(s1, s2):\r\n global edges\r\n i = 0\r\n while i < len(s1) and i < len(s2) and s1[i] == s2[i]:\r\n i += 1 \r\n w = 0 \r\n j = len(s1)\r\n while j > i:\r\n if s1[:j] in edges:\r\n w += edges[s1[:j]] \r\n j -= 1\r\n j = len(s2)\r\n while j > i:\r\n if s2[:j] in edges:\r\n w += edges[s2[:j]] \r\n j -= 1\r\n return w \r\n\r\nq = int(input())\r\nedges = dict()\r\nfor i in range(q):\r\n l = list(map(int, input().split()))\r\n if l[0] == 1:\r\n l[1] = bin(l[1])\r\n l[1] = l[1][2:]\r\n l[2] = bin(l[2])\r\n l[2] = l[2][2:]\r\n add_edges(l[1], l[2], l[3])\r\n if l[0] == 2:\r\n l[1] = bin(l[1])\r\n l[1] = l[1][2:]\r\n l[2] = bin(l[2])\r\n l[2] = l[2][2:]\r\n print(way(l[1], l[2])) \r\n \r\n ", "w = {}\r\ndef up(a, b, d):\r\n while a != b:\r\n if a < b:\r\n a, b = b, a\r\n if a not in w:\r\n w[a] = 0\r\n w[a] += d\r\n a = a // 2\r\n \r\ndef get(a, b):\r\n res = 0\r\n while a != b:\r\n if a < b:\r\n a, b = b, a\r\n if a in w:\r\n res += w[a]\r\n a = a // 2\r\n return res\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n a = [int(b) for b in input().split()]\r\n if a[0] == 1:\r\n up(a[1], a[2], a[3])\r\n else:\r\n print(get(a[1], a[2]))", "import sys,os,io\r\nfrom collections import defaultdict\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ncost = defaultdict(lambda: 0)\r\n\r\nq = int(input())\r\nfor _ in range (q):\r\n qi = [int(i) for i in input().split()]\r\n u,v = qi[1],qi[2]\r\n\r\n vis = defaultdict(lambda: 0)\r\n path1 = []\r\n while(u>0):\r\n path1.append(u)\r\n vis[u]=1\r\n u//=2\r\n path2 = []\r\n inter = -1\r\n while(v>0):\r\n if vis[v]:\r\n inter = v\r\n break\r\n path2.append(v)\r\n v//=2\r\n path = []\r\n for i in path1:\r\n path.append(i)\r\n if i==inter:\r\n break\r\n for i in path2[::-1]:\r\n path.append(i)\r\n\r\n if qi[0]==1:\r\n w = qi[3]\r\n for i in range (1,len(path)):\r\n cost[(path[i],path[i-1])]+=w\r\n cost[(path[i-1], path[i])]+=w\r\n else:\r\n ans = 0\r\n for i in range (1,len(path)):\r\n ans += cost[(path[i],path[i-1])]\r\n print(ans)", "def main():\n d = {}\n for _ in range(int(input())):\n c, *l = input().split()\n if c == \"1\":\n v, u, w = map(int, l)\n while u != v:\n if u < v:\n d[v] = d.get(v, 0) + w\n u, v = v // 2, u\n else:\n d[u] = d.get(u, 0) + w\n u //= 2\n else:\n res = 0\n v, u = map(int, l)\n while u != v:\n if u < v:\n res += d.get(v, 0)\n u, v = v // 2, u\n else:\n res += d.get(u, 0)\n u //= 2\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "#!/usr/bin/env python3\nimport collections\n\n\ndef lca(u, v):\n ub = bin(u)[2:]\n vb = bin(v)[2:]\n\n\n r = 0\n for i, (a, b) in enumerate(zip(ub, vb)):\n if a != b:\n break\n r = r * 2 + int(a)\n return r\n\n\ndef add(cost, n, root, w):\n while n > root:\n cost[n] += w\n n //= 2\n\n\ndef get(cost, n, root):\n r = 0\n while n > root:\n r += cost[n]\n n //= 2\n return r\n\n\nif __name__ == '__main__':\n q = int(input())\n\n cost = collections.Counter()\n for _ in range(q):\n cmd = list(map(int, input().split()))\n if cmd[0] == 1:\n v, u, w = cmd[1:]\n root = lca(v, u)\n add(cost, v, root, w)\n add(cost, u, root, w)\n else:\n v, u = cmd[1:]\n root = lca(v, u)\n print(get(cost, v, root) + get(cost, u, root))\n\n", "d = {}\ndef lca(x, y, w):\n res = 0\n while x != y:\n if x < y:\n x, y = y, x;\n d[x] = d.get(x, 0) + w\n res += d[x]\n x //= 2\n return res\nq = int(input())\nwhile (q > 0):\n q -= 1\n a = list(map(int, input().split()))\n if a[0] == 1:\n lca(a[1], a[2], a[3])\n else:\n (print(lca(a[1], a[2], 0)))\n", "from collections import defaultdict\r\n\r\nR = lambda: map(int, input().split())\r\ng = defaultdict(int)\r\nfor _ in range(int(input())):\r\n arr = list(R())\r\n if arr[0] == 1:\r\n l, r, w = arr[1:]\r\n while l != r:\r\n if l < r:\r\n g[r] += w\r\n r //= 2\r\n else:\r\n g[l] += w\r\n l //= 2\r\n else:\r\n l, r = arr[1:]\r\n res = 0\r\n while l != r:\r\n if l < r:\r\n res += g[r]\r\n r //= 2\r\n else:\r\n res += g[l]\r\n l //= 2\r\n print(res)", "#########################################################################################################\\\r\n#########################################################################################################\r\n###################################The_Apurv_Rathore#####################################################\r\n#########################################################################################################\r\n#########################################################################################################\r\nimport sys,os,io\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\nelse:\r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nt = 1 \r\nt = int(input())\r\n\r\n\r\ncostEdge = defaultdict(lambda:0)\r\nfor _ in range(t):\r\n query = [int(x) for x in input().split()]\r\n\r\n u = query[1]\r\n v = query[2]\r\n\r\n\r\n\r\n parents = {}\r\n while(u):\r\n parents[u]=1\r\n u//=2\r\n \r\n lca = -1\r\n\r\n path1 = []\r\n while(v):\r\n path1.append(v)\r\n if v in parents:\r\n lca = v \r\n break \r\n v//=2 \r\n \r\n u = query[1]\r\n\r\n path2 = []\r\n while(u!=lca):\r\n path2.append(u)\r\n u//=2\r\n path2.append(lca)\r\n if query[0]==1:\r\n w = query[3]\r\n for i in range(len(path2)-1):\r\n costEdge[(path2[i],path2[i+1])]+=w\r\n costEdge[(path2[i+1],path2[i])]+=w\r\n for i in range(len(path1)-1):\r\n costEdge[(path1[i],path1[i+1])]+=w\r\n costEdge[(path1[i+1],path1[i])]+=w\r\n\r\n else:\r\n ans = 0\r\n for i in range(len(path2)-1):\r\n ans+=costEdge[(path2[i],path2[i+1])]\r\n \r\n for i in range(len(path1)-1):\r\n ans+=costEdge[(path1[i],path1[i+1])]\r\n print(ans)\r\n \r\n\r\n\r\n", "# from debug import debug\r\nimport sys; input = sys.stdin.readline\r\nfrom math import log2\r\nfrom collections import defaultdict\r\nd = defaultdict(int)\r\nfor i in range(int(input().strip())):\r\n\tl = list(map(int, input().strip().split()))\r\n\tif l[0] == 1:\r\n\t\tu, v, w = l[1:]\r\n\t\twhile u != v:\r\n\t\t\tif int(log2(u)) < int(log2(v)): u, v = v, u\r\n\t\t\td[(u, u//2)] += w\r\n\t\t\tu = u//2\r\n\telse:\r\n\t\tu, v = l[1:]\r\n\t\tans = 0\r\n\t\twhile u != v:\r\n\t\t\tif int(log2(u)) < int(log2(v)): u, v = v, u\r\n\t\t\tans += d[(u, u//2)]\r\n\t\t\tu = u//2\r\n\t\tprint(ans)\r\n\r\n", "from sys import stdin\r\nfrom collections import *\r\n\r\n\r\ndef arr_inp(n):\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef lca(u, v, w):\r\n res = 0\r\n while u != v:\r\n if u < v:\r\n u, v = v, u\r\n if w:\r\n mem[u, u >> 1] += w\r\n mem[u >> 1, u] += w\r\n else:\r\n res += mem[u, u >> 1]\r\n u >>= 1\r\n\r\n return res\r\n\r\n\r\nans, mem = [], defaultdict(int)\r\n\r\nfor i in range(int(input())):\r\n arr = arr_inp(1)\r\n if arr[0] == 1:\r\n lca(arr[1], arr[2], arr[3])\r\n else:\r\n ans.append(str(lca(arr[1], arr[2], 0)))\r\n\r\nprint('\\n'.join(ans))\r\n", "d={}\ndef pro(x,y,w):\n\tres=0\n\twhile x!=y:\n\t\tif x<y: x,y=y,x\n\t\td[x]=d.get(x,0)+w\n\t\tres+=d[x];\n\t\tx//=2\n\treturn res\nq=int(input())\nwhile q>0:\n\tq-=1\n\ts=list(map(int,input().split()))\n\tif s[0]==1:\n\t\tpro(s[1],s[2],s[3])\n\telse:\n\t\tprint(pro(s[1],s[2],0))\n\n\t\t \t \t \t\t\t \t\t \t \t \t\t", "cost, res = {}, []\r\nt = int(input())\r\nfor i in range(t):\r\n arr = list(map(int, input().split()))\r\n if len(arr) == 4:\r\n _, u, v, w = arr\r\n while u != v:\r\n if u > v:\r\n cost[u] = cost.get(u, 0) + w\r\n u //= 2\r\n else:\r\n cost[v] = cost.get(v, 0) + w\r\n v //= 2\r\n else:\r\n _, u, v = arr\r\n curr_res = 0\r\n while u != v:\r\n if u > v:\r\n curr_res += cost.get(u, 0)\r\n u //= 2\r\n else:\r\n curr_res += cost.get(v, 0)\r\n v //= 2\r\n res.append(str(curr_res))\r\nprint('\\n'.join(res))\r\n", "class Solution:\n def __init__(self) -> None:\n self.roadFees={}\n\n def getLCAPath(self,u):\n '''\n node is ancester of itself\n '''\n ancesterPath=[]\n while u>0:\n ancesterPath.append(u)\n u=u//2\n ancesterPath.reverse()\n return ancesterPath\n\n def getLCA(self,u,v):\n ancesterPath1=self.getLCAPath(u)\n ancesterPath2=self.getLCAPath(v)\n i=0\n while i<len(ancesterPath1) and i<len(ancesterPath2) and ancesterPath1[i]==ancesterPath2[i]:\n i+=1\n return ancesterPath1[i-1]\n\n def updateWeights(self,u,v,w):\n lca=self.getLCA(u,v)\n \n while u>lca:\n self.roadFees[(u,u//2)]=self.roadFees.get((u,u//2),0)+w\n u=u//2\n # did not follow DRY :>\n while v>lca:\n self.roadFees[(v,v//2)]=self.roadFees.get((v,v//2),0)+w\n v=v//2\n\n def getFee(self,u,v):\n lca=self.getLCA(u,v)\n ans=0\n while u>lca:\n ans+=self.roadFees.get((u,u//2),0)\n u=u//2\n # did not follow DRY :>\n while v>lca:\n ans+=self.roadFees.get((v,v//2),0)\n v=v//2\n return ans\n\nif __name__ == \"__main__\":\n sol=Solution()\n q=int(input())\n for _ in range(q):\n inputInfo = [int(i) for i in input().split()]\n if inputInfo[0]==1:\n sol.updateWeights(inputInfo[1],inputInfo[2],inputInfo[3])\n else:\n print(sol.getFee(inputInfo[1],inputInfo[2]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(a, b, c):\r\n x = 0\r\n while a != b:\r\n if a < b:\r\n a, b = b, a\r\n if c != 0:\r\n d[a] = d.get(a, 0) + c\r\n else:\r\n x += d.get(a,0)\r\n a //= 2\r\n return x\r\n\r\n\r\nd = {}\r\nfor _ in range(int(input())):\r\n w = list(map(int, input().split()))\r\n if w[0] == 1:\r\n f(w[1], w[2], w[3])\r\n else:\r\n print(f(w[1], w[2], 0))\r\n", "# # ﷽\r\nfrom collections import Counter, defaultdict\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n graph=defaultdict(int)\r\n for _ in range(int(input())):\r\n lst=[int(i) for i in input().split()]\r\n if len(lst)==4:\r\n _,u,v,w=lst \r\n while u!=v:\r\n u,v=sorted([u,v])\r\n pv=v//2\r\n graph[pv,v]+=w\r\n v=pv\r\n if u!=v:graph[v,u]+=w\r\n else:\r\n tot=0\r\n _,u,v=lst\r\n while u!=v:\r\n u,v=sorted([u,v])\r\n pv=v//2\r\n tot+=graph[pv,v]\r\n v=pv\r\n tot+=graph[v,u]\r\n print(tot)\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n\r\n\r\n", "d={}\r\ndef pro(x,y,w):\r\n\tres=0\r\n\twhile x!=y:\r\n\t\tif x<y: x,y=y,x\r\n\t\td[x]=d.get(x,0)+w\r\n\t\tres+=d[x];\r\n\t\tx//=2\r\n\treturn res\r\nq=int(input())\r\nwhile q>0:\r\n\tq-=1\r\n\ts=list(map(int,input().split()))\r\n\tif s[0]==1:\r\n\t\tpro(s[1],s[2],s[3])\r\n\telse:\r\n\t\tprint(pro(s[1],s[2],0))", "from collections import Counter\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_ints():\n return list(map(int, input().strip().split(' ')))\n\n\ndef shortest_path(i, j):\n path = []\n while i != j:\n if i > j:\n path.append((i//2, i))\n i //= 2\n else:\n path.append((j//2, j))\n j //= 2\n return path\n\n\ndef solve():\n q = read_int()\n wage = Counter()\n for _ in range(q):\n l = read_ints()\n if l[0] == 1:\n u, v, w = l[1:]\n if u > v:\n u, v = v, u\n for pair in shortest_path(u, v):\n wage[pair] += w\n else:\n u, v = l[1:]\n if u > v:\n u, v = v, u\n T = 0\n for pair in shortest_path(u, v):\n T += wage[pair]\n print(T)\n\n \nif __name__ == '__main__':\n solve()\n", "q = int(input())\nans = []\ncost = {}\n\ndef getn(v, k = 1):\n res = []\n while k <= v:\n res.append(v)\n v //= 2\n return res\n\ndef getp(arr):\n res = []\n for i in range(len(arr) - 1):\n res.append((arr[i], arr[i + 1]))\n return res\n\ndef gets(u, v):\n resu, resv = getn(u), getn(v)\n for i in resv:\n if i in resu:\n return getp(getn(u, i)) + getp(getn(v, i))\n\nfor i in range(q):\n t, *p = map(int, input().split())\n u, v = p[0], p[1]\n if v < u:\n u, v = v, u\n\n path = gets(u, v)\n if t == 1:\n for rd in path:\n if rd in cost:\n cost[rd] += p[2]\n else:\n cost[rd] = p[2]\n else:\n tot = 0\n for rd in path:\n if rd in cost:\n tot += cost[rd]\n \n ans.append(tot)\n\nprint(\"\\n\".join(map(str, ans)))", "path = {}\ndef set_cost(u, v, w):\n edge = []\n while v != u:\n if v<u:\n u,v = v,u\n p = (v//2, v)\n if p in path: path[p] += w\n else: path[p] = w\n v = v//2\n #print(path)\ndef get_cost(u, v):\n edge = []\n cost = 0\n while v != u:\n if v<u:\n u,v = v,u\n p = (v//2, v)\n if p in path: cost += path[p]\n v = v//2\n return cost\n\nfor _ in range(int(input())):\n x = [int(i) for i in input().split()]\n if x[0] == 2:\n u,v = x[1:]\n print(get_cost(u, v))\n else:\n u,v,w = x[1:]\n set_cost(u, v, w)\n", "import math\r\n\r\ncache={}\r\nmax_n=10**18\r\ndef get_depth(x):\r\n return int(math.log2(x))\r\ndef LCA(u,v):\r\n ans=[]\r\n while u!=v:\r\n \r\n d1=get_depth(u)\r\n d2=get_depth(v)\r\n if d1>d2:\r\n u,v=v,u \r\n ans.append(v)\r\n v//=2\r\n return ans\r\n \r\n\r\nq=int(input())\r\nans=[]\r\nfor i in range(q):\r\n \r\n curr=list(map(int,input().split()))\r\n if curr[0]==1:\r\n n1,n2,w=curr[1],curr[2],curr[3]\r\n nodes=LCA(n1,n2)\r\n for e in nodes:\r\n if e not in cache:\r\n cache[e]=0\r\n cache[e]+=w \r\n \r\n else:\r\n temp=0\r\n n1,n2=curr[1],curr[2]\r\n nodes=LCA(n1,n2)\r\n for e in nodes:\r\n if e in cache:\r\n temp+=cache[e]\r\n \r\n \r\n ans.append(temp)\r\nfor e in ans:\r\n print(e)\r\n \r\n \r\n \r\n\r\n\r\n \r\n ", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jul 15 23:50:55 2020\n\n@author: shailesh\n\"\"\"\n\n\nfrom collections import defaultdict\n\n\ndef find_cost(node_1,node_2,intersect_dict):\n new_dict = defaultdict(lambda : 0)\n cost = 0\n while node_1 != 0:\n new_dict[node_1] = 1\n cost+= intersect_dict[node_1]\n# print(node_1,cost)\n node_1 //= 2\n \n while node_2!=0:\n if new_dict[node_2]:\n cost -= intersect_dict[node_2]\n# print(node_2)\n break\n else:\n new_dict[node_2] = 1\n cost += intersect_dict[node_2]\n node_2 //= 2\n# print(node_2,cost)\n while node_2 != 0:\n node_2 //= 2\n cost -= intersect_dict[node_2]\n \n \n return cost\n\n\ndef increase_cost_on_path(node_1,node_2,inc_cost,intersect_dict):\n new_dict = defaultdict(lambda :0)\n while node_1 != 0:\n new_dict[node_1] = 1\n intersect_dict[node_1] += inc_cost\n node_1 //= 2\n while node_2 != 0 :\n if new_dict[node_2]:\n break\n else:\n intersect_dict[node_2] += inc_cost\n node_2//=2\n \n while node_2 != 0:\n intersect_dict[node_2] -= inc_cost\n node_2 //= 2\n return intersect_dict\n\n\nQ = int(input())\n\n#arr = [0 for i in range(n+1)]\n\nintersect_dict = defaultdict(lambda : 0)\n\nfor q in range(Q):\n query = [int(i) for i in input().split()]\n if query[0] == 1:\n v,u,w = query[1:]\n intersect_dict = increase_cost_on_path(v,u,w,intersect_dict)\n else:\n v,u = query[1:]\n cost = find_cost(u,v,intersect_dict)\n print(cost)\n \n ", "def path_to_root(n):\n path = [n]\n while n != 1:\n if n % 2:\n path.append((n - 1) // 2)\n n = (n - 1) // 2\n else:\n path.append(n // 2)\n n //= 2\n return path\n\n\ndef path_beetwen(a, b):\n p1 = path_to_root(a)\n p2 = path_to_root(b)\n l1 = len(p1)\n l2 = len(p2)\n x = 0\n while x < l2:\n if p2[x] in p1:\n break\n x += 1\n path = p1[:p1.index(p2[x]) + 1] + p2[:x][::-1]\n return path\n\n\ndef fee_on_path(fees, a, b):\n path = path_beetwen(a, b)\n total_fee = 0\n for x in range(len(path) - 1):\n fee = str(path[x]) + \"_\" + str(path[x + 1])\n if fee in fees.keys():\n total_fee += fees[fee]\n return total_fee\n\n\ndef update_fees(fees, a, b, w):\n path = path_beetwen(a, b)\n for x in range(len(path) - 1):\n fee = str(path[x]) + \"_\" + str(path[x + 1])\n fee2 = str(path[x + 1]) + \"_\" + str(path[x])\n if fee in fees.keys():\n fees[fee] += w\n else:\n fees[fee] = w\n if fee2 in fees.keys():\n fees[fee2] += w\n else:\n fees[fee2] = w\n\n\nclass CodeforcesTask696ASolution:\n def __init__(self):\n self.result = ''\n self.events_count = 0\n self.events = []\n\n def read_input(self):\n self.events_count = int(input())\n for x in range(self.events_count):\n self.events.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n fees = {}\n for x in range(self.events_count):\n if self.events[x][0] == 1:\n update_fees(fees, self.events[x][1], self.events[x][2], self.events[x][3])\n else:\n print(fee_on_path(fees, self.events[x][1], self.events[x][2]))\n #print(fees)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask696ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "d = {}\r\n\r\ndef lca(u,v,w):\r\n res = 0\r\n while u!=v:\r\n if u < v:\r\n u,v = v,u\r\n d[u] = d.get(u,0) +w\r\n res += d[u]\r\n u //=2\r\n return res\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n a = list(map(int,input().split()))\r\n if a[0]==1:\r\n lca(a[1],a[2],a[3])\r\n else:\r\n print(lca(a[1],a[2],0))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\ndef get_path(u):\r\n path = []\r\n while u>0:\r\n path.append(u)\r\n u//=2\r\n return path\r\n\r\ndef get_short_path(u,v):\r\n p1 = get_path(u)\r\n p2 = get_path(v)\r\n \r\n t = -1\r\n while p1 and p2 and p1[-1]==p2[-1]:\r\n p1.pop()\r\n t = p2.pop()\r\n \r\n return p1+[t]+p2[::-1]\r\n \r\n \r\nlib = defaultdict(int)\r\nfor _ in range(int(input())):\r\n arr = list(map(int, input().split()))\r\n if arr[0]==1:\r\n u,v,w = arr[1],arr[2],arr[3]\r\n path = get_short_path(u,v)\r\n for i in range(len(path)-1):\r\n key = str(min(path[i],path[i+1]))+'-'+str(max(path[i],path[i+1]))\r\n lib[key]+=w\r\n else:\r\n u,v = arr[1],arr[2]\r\n path = get_short_path(u,v)\r\n ans = 0\r\n for i in range(len(path)-1):\r\n key = str(min(path[i],path[i+1]))+'-'+str(max(path[i],path[i+1]))\r\n ans+=lib[key]\r\n print(ans)", "'''input\n7\n1 3 4 30\n1 4 1 2\n1 3 6 8\n2 4 3\n1 6 1 40\n2 3 7\n2 2 4\n'''\nfrom sys import stdin\nimport collections\nimport math\n\n\ndef get_common_parent(path_v, path_u):\n\ti = -1\n\tj = -1\n\twhile path_v[i] != path_u[j]:\n\t\tif path_v[i] > path_u[j]:\n\t\t\ti -= 1\n\t\telif path_v[i] < path_u[j]:\n\t\t\tj -= 1\n\t\telse:\n\t\t\tbreak\n\treturn path_v[i]\n\n\ndef get_path(start, tree):\n\tpath = []\n\twhile start != 1:\n\t\tpath.append(start)\n\t\tif start // 2 in tree[start]:\n\t\t\tpass\n\t\telse:\n\t\t\ttree[start][start // 2] = 0\n\t\t\ttree[start//2][start] = 0\n\t\tstart = start // 2\n\tpath.append(1)\n\tpath.reverse()\n\treturn path\n\n\ndef increase_cost(start, tree, parent, w):\n\twhile start != parent:\n\t\tif start // 2 in tree[start]:\n\t\t\ttree[start][start //2] += w\n\t\t\ttree[start//2][start] += w\n\t\telse:\n\t\t\ttree[start][start // 2] = w\n\t\t\ttree[start//2][start] = w\n\t\tstart = start // 2\n\n\ndef calculate_cost(start, tree, parent, total):\n\twhile start != parent:\n\t\ttotal[0] += tree[start][start // 2]\n\t\tstart = start // 2\n\n\n# main starts\nq = int(stdin.readline().strip())\ntree = collections.defaultdict(dict)\nfor _ in range(q):\n\tarr = list(map(int, stdin.readline().split()))\n\tif len(arr) == 4:\n\t\tu = arr[1]; v = arr[2]; w = arr[3]\n\t\tif u > v:\n\t\t\tv, u = u, v\n\t\tpath_v = get_path(v, tree)\n\t\tpath_u = get_path(u, tree)\n\t\t\t\n\t\tcommon_parent = get_common_parent(path_v, path_u)\n\t\tincrease_cost(v, tree, common_parent, w)\n\t\tincrease_cost(u, tree, common_parent, w)\n\n\telse:\n\t\tu = arr[1]\n\t\tv = arr[2]\n\t\tif u > v:\n\t\t\tv, u = u, v\n\n\t\tpath_v = get_path(v, tree)\n\t\tpath_u = get_path(u, tree)\n\t\tcommon_parent = get_common_parent(path_v, path_u)\n\t\ttotal = [0]\n\t\tcalculate_cost(v, tree, common_parent, total)\n\t\tcalculate_cost(u, tree, common_parent, total)\n\t\tprint(total[0])\n\n\t\t", "import math\r\nq=int(input())\r\ns={}\r\no=[]\r\nfor i in range(q):\r\n r=list(map(int,input().split()))\r\n a,b=r[1],r[2]\r\n if r[0]==2:o.append(0)\r\n while a!=b:\r\n if math.log2(a)>math.log2(b) and a!=1:\r\n if a not in s:\r\n s[a]=0\r\n if r[0]==1:s[a]+=r[3]\r\n else:o[-1]+=s[a]\r\n a//=2\r\n elif b!=1:\r\n if b not in s:\r\n s[b]=0\r\n if r[0]==1:s[b]+=r[3]\r\n else:o[-1]+=s[b]\r\n b//=2\r\nprint(*map(str,o),sep='\\n')" ]

[ "#!/usr/bin/env python\nimport zlib, base64\nexec(zlib.decompress(base64.b64decode('eJx1jEsOgzAMBfc5hatunA8NdIngMFSB1lJjLBMqevtG7Lt60hvNXC9x3zQ+iOPMH5Bvea1sOOQxT4LEJRDLXtDeNnlTXWs0yNgGZN/ZGO9mWRUIiEEnfs6YbW/gCOm/D+pHdofH5NghN509O0ALpKHtK0319uJQmpMa0RpCjWzND8GsM7A=')))\n# Created by pyminifier (https://github.com/liftoff/pyminifier)\n\n", "from decimal import *\r\ngetcontext().prec*=3\r\nn,c,r=map(Decimal,(input()+' 0').split())\r\nfor i in range(int(c)):a,b=map(Decimal,input().split());r+=a+b*((n-1)/2 if b>0 else ((n//2)*((n+2)//2)+((n-1)//2)*((n+1)//2))/2/n)\r\nprint(r)", "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# _INPUT_LINES = sys.stdin.read().splitlines()\r\n# input = iter(_INPUT_LINES).__next__\r\n# _OUTPUT_BUFFER = io.StringIO()\r\n# sys.stdout = _OUTPUT_BUFFER\r\n#\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\n\r\ndef minimize(n):\r\n tot = n // 2\r\n mn = tot * (tot + 1)\r\n\r\n if (n & 1) == 0:\r\n mn -= tot\r\n\r\n return mn\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nres = 0\r\n\r\nfor i in range(m):\r\n x, d = map(int, input().split())\r\n res += n * x\r\n if d < 0:\r\n res += d * minimize(n)\r\n else:\r\n res += d * (n - 1) * n // 2\r\n\r\nprint(res / n)\r\n", "def auxFun(x):\n return x * (x + 1) // 2\n\nn, m = (int(x) for x in input().split())\nanswer = 0\naux = (n + 1) // 2\nmx = auxFun(n - 1)\nmn = auxFun(aux - 1) + auxFun(n - aux)\n\nfor i in range(m):\n x, d = (int(x) for x in input().split())\n if d < 0: aux = mn\n else: aux = mx\n answer += n * x + d * aux\nprint(\"%.12f\" % (answer / n))\n\t\t\t \t\t \t\t \t\t\t\t \t \t \t \t", "#!/usr/bin/python3\n\ndef solve(N, M, A):\n kmax = N * (N - 1) // 2\n\n c = N // 2\n kmin = c * (c + 1) // 2 + (N - c - 1) * (N - c) // 2\n\n sm = 0\n for x, d in A:\n sm += x * N\n if d >= 0:\n sm += d * kmax\n else:\n sm += d * kmin\n\n return sm / N\n\n\ndef main():\n N, M = [int(e) for e in input().split(' ')]\n A = []\n for _ in range(M):\n A.append([int(e) for e in input().split(' ')])\n\n print(solve(N, M, A))\n\n\nif __name__ == '__main__':\n main()\n", "n,m=map(int,input().split())\np,r=sum(abs(i+1-(n+1)//2) for i in range(n)),0\nfor i in range(m):\n x,d=map(int,input().split())\n r+=n*x+max(d*(n*(n-1)//2),d*p)\nprint(r/n)", "n,m=map(int,input().split())\nres=0\nfor i in range(m):\n x,d=map(int,input().split())\n res+=n*x+(d*n*(n-1))//2\n if d<0: res+=d*(n+((n+1)//2)*((n+1)//2)-n*((n+1)//2)-((n+1)//2))\nprint(res/n)", "n,m=input().split()\r\nn,m=int(n),int(m)\r\nc=0\r\nz=0\r\nfor j in range(n):\r\n c+=j\r\n z+=abs(n//2-j)\r\ns=0\r\nfor i in range(m):\r\n x=[int(x) for x in input().split()]\r\n s+=x[0]*n+max(x[1]*z,x[1]*c)\r\nprint(s/n)\r\n", "from collections import Counter, defaultdict, deque\r\n\r\nread = lambda: list(map(int,input().split()))\r\ngetinfo = lambda grid: print(list(map(print,grid)))\r\np = lambda x: print(x,end=\" \")\r\n\r\nmod = 10**9+7\r\ninf = float('inf')\r\n\r\ndef solve():\r\n print()\r\n\r\nn,m = read()\r\nmaxd, mind = n*(n-1)//2, [n**2//4,(n**2-1)//4][n%2==1]\r\nres = 0\r\nfor i in range(m):\r\n x,d = read()\r\n if d >= 0:\r\n res += n*x + d*maxd\r\n else:\r\n res += n*x + d*mind\r\nprint(res/n)\r\n", "import sys\r\ninput = lambda :sys.stdin.readline()[:-1]\r\nni = lambda :int(input())\r\nna = lambda :list(map(int,input().split()))\r\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\r\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\r\n#######################################################################\r\nn,m = na()\r\nz = n * (n - 1)//2\r\ny = n//2 * (n//2 + 1)//2 + (n-n//2-1)*(n-n//2)//2\r\nres = 0\r\nfor i in range(m):\r\n x,d = na()\r\n res += x * n\r\n if d <= 0:\r\n res += y * d\r\n else:\r\n res += z * d\r\n\r\nprint(res/n)\r\n", "n, m = map(int, input().split())\r\na = (n * (n - 1)) // 2\r\nn2 = n // 2\r\nb = n2 * (n2 + 1)\r\nif n % 2 == 0:\r\n b -= n2\r\ns = 0\r\nfor i in range(m):\r\n x, d = map(int, input().split())\r\n s += x * n\r\n s += d * (a if d > 0 else b)\r\nprint(s / n)", "# 4999850001\r\n# 2499950000\r\n# 4999900000\r\n# def findmin(size, changes):\r\n# avg = 0\r\n\r\n# for a, b in changes:\r\n# avg += a\r\n# if b == 0:\r\n# continue\r\n# if b > 0:\r\n# avg += (size - 1) / 2.0 * b\r\n# else:\r\n# if size % 2 == 0:\r\n# avg += ((size / 2) * (size / 2 + 1) / 2.0 + (size / 2) * (size / 2 - 1) / 2.0 )* b / size\r\n# else:\r\n# avg += (size / 2) * (size / 2 + 1) * 1.0 * b / size\r\n# return avg\r\n\r\n\r\ndef findmin(size, changes):\r\n total = 0\r\n\r\n for a, b in changes:\r\n total += a * size\r\n if b == 0:\r\n continue\r\n if b > 0:\r\n total += (size - 1) * size // 2 * b\r\n else:\r\n if size % 2 == 0:\r\n total += ((size / 2) * (size / 2 + 1) / 2 + (size / 2) * (size / 2 - 1) / 2 )* b\r\n else:\r\n total += (size // 2) * (size // 2 + 1) * b\r\n # print(total)\r\n return total / size \r\n\r\n\r\n# # inc = [[1,1000]]\r\n# inc = []\r\n# size = 99999\r\n# for a in range(33333):\r\n# inc.append([0,1000])\r\n\r\n# for a in range(66666):\r\n# inc.append([0,-1000])\r\n# print(findmin(size, inc))\r\n\r\n\r\n# size = 99999\r\n# inc = []\r\n# for i in range(1, 2):\r\n# inc.append((1, 1000))\r\n# for i in range(2, 24901):\r\n# inc.append((0, 1000))\r\n# for i in range(24901, 24902):\r\n# inc.append((0, 2))\r\n# for i in range(24902, 50000):\r\n# inc.append((0, 0))\r\n# for i in range(50000, 99799):\r\n# inc.append((0, -1000))\r\n# for i in range(99799, 99800):\r\n# inc.append((0, -506))\r\n# for i in range(99800, 99999):\r\n# inc.append((0, 0))\r\n# print(findmin(size, inc))\r\n\r\nina, inn = map(int, input().split(' '))\r\ninx = []\r\nfor aa in range(inn):\r\n inx.append(list(map(int, input().split(' '))))\r\nprint(findmin(ina, inx))\r\n\r\n", "n,m=map(int,(input().split()))\r\np=0;\r\nfor i in range(1,n+1): p+=abs(i-(n+1)//2)\r\nans=0\r\nfor i in range(m):\r\n x,d=map(int,(input().split()))\r\n sum=n*x+max(d*(n*(n-1)//2),d*p)\r\n ans+=sum\r\nprint(ans/n)", "import bz2, base64\nexec(bz2.decompress(base64.b64decode('QlpoOTFBWSZTWcNPgXEAAAjZgAAQaH/wFjfn32AgAJINQammmmRoNAAxAaqf5UwpspiPKHoZJoBi7IqyFN3V+JxifYGXoWlLg3C8iVCSEvOzYJfT0B1ugLmEOvA1DGHO1qibxx5YRasVFB8OdZ7t0pKbzdrDWCIeEE4Sa7UlCyCFROYby7IZKdMMgMXyQVFKb5j14OGG+goJgtP4u5IpwoSGGnwLiA==')))\n", "n, m = [int(i) for i in input().split(' ')]\nalice_s__present = [0] * n\n\n\nx_d_pos = [0, 0]\nx_d_neg = [0, 0]\n\nfor _ in range(m):\n x, d = [int(i) for i in input().split(' ')]\n\n if d >= 0.0:\n x_d_pos[0] += x\n x_d_pos[1] += d\n else:\n x_d_neg[0] += x\n x_d_neg[1] += d\n\nfor i in range(len(alice_s__present)):\n alice_s__present[i] = x_d_pos[0] + x_d_neg[0] + (x_d_pos[1] * i) + (x_d_neg[1] * abs(i - int(n / 2)))\n\nprint(sum(alice_s__present) / n)\n\n \t\t\t\t\t \t \t \t\t\t \t\t \t \t\t\t \t", "n, m = map(int, input().split())\r\n\r\nmean = 0\r\ns1 = (n - 1)*n // 2\r\ns2a = (1 + n // 2) * (n // 2)\r\ns2b = s2a - n // 2\r\nfor _ in range(m):\r\n\tx, d = map(int, input().split())\r\n\tmean += x * n\r\n\tif d >= 0:\r\n\t\tmean += d * s1\r\n\telse:\r\n\t\tif n % 2 == 1:\r\n\t\t\tmean += d * s2a\r\n\t\telse:\r\n\t\t\tmean += d * s2b\r\nprint(mean / n)", "n,m = [int(x) for x in input().split()]\r\nma =(n-1)*n//2\r\nif n%2 == 0:\r\n mi = n*n//4\r\nelse :\r\n mi =(n*n - 1)//4\r\nif n == 2 :\r\n ma = 1\r\n mi = 1\r\ns = 0\r\nu = 0\r\nfor i in range(m):\r\n x,d = [int(x) for x in input().split()]\r\n u += x\r\n if(d>0):\r\n s += d*ma\r\n else:\r\n s += d*mi\r\nr = u + s/n\r\nprint(r)\r\n", "import math\r\n\r\n\r\nn, m = map(int, input().split())\r\nminVal = 1e20\r\nmaxVal = 0\r\nfor i in range(n) :\r\n left = i\r\n right = n - i - 1\r\n val = (left * (left + 1)) // 2 + (right * (right + 1)) // 2\r\n minVal = min(minVal, val)\r\n maxVal = max(maxVal, val)\r\ns = 0\r\nfor i in range(m) :\r\n x, d = map(int, input().split())\r\n if d >= 0 :\r\n s += (n * x + d * maxVal)\r\n else :\r\n s += (n * x + d * minVal)\r\nprint(s / n)\r\n\r\n\r\n\r\n\r\n", "#OMM NAMH SHIVAY\r\n#JAI SHREE RAM\r\nimport sys,math,heapq,queue\r\nfast_input=sys.stdin.readline \r\nn,m=map(int,fast_input().split()) \r\ns=0 \r\nr=(n+1)//2 \r\nr-=1 \r\nfor _ in range(m):\r\n x,d=map(int,fast_input().split())\r\n s+=n*x \r\n if d>=0:\r\n s+=d*(n-1)*(n)//2 \r\n else:\r\n s+=d*(r)*(r+1)\r\n if n%2==0:\r\n s+=(r+1)*d \r\nprint(s/n)\r\n ", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nMAX = 0\r\nMIN = 10**18\r\nfor i in range(n):\r\n l = i*(i+1)//2\r\n r = (n-1-i)*(n-1-i+1)//2\r\n MAX= max(MAX, l+r)\r\n MIN = min(MIN, l+r)\r\n\r\nans = 0\r\nfor i in range(m):\r\n x, d = map(int, input().split())\r\n ans += n*x\r\n if d >= 0:\r\n ans += d*MAX\r\n else:\r\n ans += d*MIN\r\nprint(ans/n)\r\n", "from decimal import Decimal, getcontext\n\ngetcontext().prec = 1000\n\nn, m = map(int, input().split())\ntotal = Decimal('0')\nfor _ in range(m):\n\tx, d = map(Decimal, input().split())\n\n\ttotal += x\n\n\tif d > 0:\n\t\ttotal += (d*(n-1))/2\n\telse:\n\t\tif n%2 == 0:\n\t\t\ttotal += d*n/4\n\t\telse:\n\t\t\ttotal += d/n * (n*n-1)/4\n\nprint(total)", "def main():\r\n n, m = list(map(int, input().split()))\r\n x_sum = pos_d = neg_d = 0\r\n for i in range(m):\r\n _x, _d = list(map(int, input().split()))\r\n x_sum += _x\r\n if _d > 0:\r\n pos_d += _d\r\n else:\r\n neg_d += _d\r\n big_d = small_d = 0\r\n big_d = (n * (n-1)) // 2\r\n half = n // 2\r\n small_d = (1 + half) * half if n % 2 == 1 else half ** 2\r\n avg = x_sum + (big_d * pos_d + small_d * neg_d) / n\r\n print(\"{:.12f}\".format(avg))\r\nif __name__ == '__main__':\r\n main()\r\n ", "import sys\r\ninput = sys.stdin.readline\r\nn, m = map(int,input().split())\r\nans = 0\r\nwhile m :\r\n m -= 1\r\n x, y = map(int,input().split())\r\n ans += x*n\r\n if y < 0 :\r\n if n%2 :\r\n ans += (n//2)*(n//2+1)*y\r\n else :\r\n ans += (((n//2)*(n//2+1))//2)*y\r\n ans += (((n//2-1)*(n//2))//2)*y\r\n else :\r\n ans += ((n*(n-1))//2)*y\r\nprint(\"{0:.8f}\".format(ans/n))", "import functools\r\nimport time\r\n\r\ndef timer(func):\r\n @functools.wraps(func)\r\n def wrapper(*args, **kwargs):\r\n stime = time.perf_counter()\r\n res = func(*args, **kwargs)\r\n elapsed = time.perf_counter() - stime\r\n print(f\"{func.__name__} in {elapsed:.4f} secs\")\r\n return res\r\n return wrapper\r\n\r\nclass solver:\r\n # @timer\r\n def __init__(self):\r\n pass\r\n\r\n def __call__(self):\r\n n, m = map(int, input().strip().split())\r\n\r\n y = 0\r\n for _ in range(m):\r\n x, d = map(int, input().strip().split())\r\n if d >= 0: \r\n y += d * (n - 1) * n // 2\r\n else:\r\n if n % 2 != 0:\r\n l = (n - 1) // 2\r\n y += d * l * (l + 1)\r\n else:\r\n l = n // 2\r\n y += d * (l * (l + 1) - l)\r\n y += x * n\r\n y /= n\r\n print(f'{y:.9f}')\r\n\r\nsolver()()", "f=lambda: map(int,input().split())\nn,m=f()\nsum_max_dist=0\nfor i in range(1,n+1): sum_max_dist+=abs(i-(n+1)//2)\nans=0\nfor i in range(m):\n x,d=f()\n s=x*n+max(sum_max_dist*d,n*(n-1)//2*d)\n ans+=s\nprint(ans/n)", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\nfrom bisect import bisect,bisect_left\r\nfrom time import time\r\nfrom itertools import permutations as per\r\nfrom heapq import heapify,heappush,heappop,heappushpop\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\r\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nnCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N\r\ninv=lambda x:pow(x,N-2,N)\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\nn,k=R()\r\ns=0\r\nfor i in range(k):\r\n\tx,d=R()\r\n\ts+=n*x\r\n\tif d<0:\r\n\t\ts+=sm(n//2)*d+sm(n//2-(n+1)%2)*d\r\n\telse:\r\n\t\ts+=sm(n-1)*d\r\nprint(s/n)", "n,m = map(int,input().split())\r\n\r\ntotal = 0\r\npos = (n*(n-1))//2\r\nneg = (n-1)//2 * (1+(n-1)//2)\r\n\r\nif n%2 == 0:\r\n neg += n//2\r\nfor _ in range(m):\r\n i = _\r\n x,d = map(int,input().split())\r\n total += x*n\r\n if d>0:\r\n total += pos*d\r\n else:\r\n total += neg*d\r\nprint (total/n)\r\n\r\n\r\n", "n,m=map(int,input().split())\nr,p=0,(n+1)//2\nfor i in range(m):\n x,d=map(int,input().split())\n r+=n*x+(d*n*(n-1))//2\n if d<0:r+=d*(n+p*(p-n-1))\nprint(r/n)", "import sys\r\nfrom array import array\r\n\r\n\r\ndef readline(): return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, m = map(int, readline().split())\r\ntotal = 0\r\n\r\nfor _ in range(m):\r\n x, d = map(int, readline().split())\r\n total += x*n\r\n if d >= 0:\r\n total += d * (((n-1) * n) >> 1)\r\n else:\r\n l = (((n-1) >> 1) * (((n-1) >> 1) + 1)) >> 1\r\n r = ((n >> 1) * ((n >> 1) + 1)) >> 1\r\n total += d * (l + r)\r\n\r\nprint(total / n)\r\n", "#Bhargey Mehta (Junior)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open('input.txt', 'r')\r\nMOD = 998244353\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, m = map(int, input().split())\r\nx, y, z = 0, 0, 0\r\nfor i in range(m):\r\n xi, di = map(int, input().split())\r\n x += xi\r\n if di > 0: y += di\r\n else: z += di\r\nmid = n//2\r\na = [x for i in range(n)]\r\nfor i in range(n):\r\n a[i] += i*y + abs(mid-i)*z\r\nprint(sum(a)/n)", "# \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\nimport math\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\nimport bisect \r\ntry :\r\n import numpy\r\n dprint = print\r\n dprint('debug mode')\r\nexcept ModuleNotFoundError:\r\n def dprint(*args, **kwargs):\r\n pass\r\ndef makePair(z):\r\n return [(z[i], z[i+1]) for i in range(0,len(z),2) ]\r\ndef memo(func): \r\n cache={} \r\n def wrap(*args): \r\n if args not in cache: \r\n cache[args]=func(*args) \r\n return cache[args] \r\n return wrap\r\n\r\n@memo\r\ndef comb (n,k):\r\n if k==0: return 1\r\n if n==k: return 1\r\n return comb(n-1,k-1) + comb(n-1,k)\r\n \r\nn,m = getIntList()\r\n\r\n \r\n\r\nbig = n * (n-1) //2\r\nh1 = (n-1)//2\r\nh2 = n- h1 -1\r\ndprint(h1,h2)\r\nsmall = h1*(h1+1)//2 + h2*(h2+1)//2\r\n\r\ndprint(big,small) \r\nres = 0\r\nfor _ in range(m):\r\n x,d = getIntList()\r\n res +=x*n\r\n if d>0:\r\n res+= big*d\r\n else:\r\n res += small*d\r\nprint(res/n)\r\n ", "arr = [int(x) for x in input().split()]\nn = arr[0]\nm = arr[1]\nresp = 0\nat = 0\nif n % 2:\n at = n // 2 * (n // 2 + 1)\nelse:\n at = n // 2 * (n // 2 + 1) - n // 2\nfor x in range(m):\n arr = [int(x) for x in input().split()]\n x = arr[0]\n d = arr[1]\n resp += x*n\n if d >= 0:\n resp += d * (n * (n - 1) // 2)\n else:\n resp += d * at\nprint(float(resp/n))\n\t\t\t \t\t\t\t \t \t\t\t\t\t \t \t \t\t\t", "n, m = [int(i) for i in input().split()]\r\nmax_sum = (n * (n - 1)) // 2\r\nmin_sum = ((n - 1) // 2 + 1) * ((n - 1) // 2) // 2 + (n - 1 - (n - 1) // 2 + 1) * (n - 1 - (n - 1) // 2) // 2\r\nans = 0\r\n#print(n, max_sum, min_sum)\r\nfor i in range(m):\r\n data = [int(j) for j in input().split()]\r\n if data[1] > 0:\r\n wk1 = max_sum\r\n else:\r\n wk1 = min_sum\r\n ans += data[0] * n + data[1] * wk1\r\n\r\nprint(ans / n)", "n, m = map(int, input().split())\nans = 0\nfor _ in range(m):\n x, d = map(int, input().split())\n if d >= 0:\n f = n * (n - 1) // 2 \n else:\n h = (n - 1) // 2\n f = h * (h + 1) // 2 + (n - h) * (n - h - 1) // 2\n ans += n * x + d * f\nprint(\"{:.8f}\".format(ans / n))\n", "n, m = list(map(int, input().split(\" \")))\nx = [0]*m\nd = [0]*m\nfor i in range(m):\n x[i], d[i] = list(map(int, input().split(\" \")))\n\n#n: tamanho do array\n#m: número de mudanças\n\nsoma = sum(x)*n\n\nfor k in range(m):\n if d[k] > 0:\n #soma += d*(1+2+3+...+n-1)\n soma += d[k]*n*(n-1)//2\n elif d[k] < 0:\n if n%2 == 0:\n # [0,1,2,3,4,5] 15\n # [1,0,1,2,3,4] 11\n # [2,1,0,1,2,3] 9\n # 2*(1+2+...+meio)\n meio = n//2 - 1 # 1 -> meio (meio elementos)\n soma += d[k]*(1+meio)*meio\n soma += d[k]*n//2\n else:\n # [1,2,3,4,5] 15\n # [0,1,2,3,4] 10\n # [1,0,1,2,3] 7\n # [2,1,0,1,2]\n\n # 2*(1+2+...+meio)\n meio = n//2 # 1 -> meio (meio elementos)\n soma += d[k]*(1+meio)*meio #x2\nprint(soma/n)\n", "n,m = map(int,input().split()) \r\nans = 0 \r\nfor i in range(m):\r\n x,d = map(int,input().split()) \r\n ans+=(x*n) \r\n if (d<0):\r\n if (n%2):\r\n ans+=(d*(((n//2)*(n//2 +1)))) \r\n else:\r\n y = ((n//2 - 1)*(n//2)) + n//2 \r\n ans+=(y*d) \r\n\r\n else:\r\n y = ((n-1)*(n))//2 \r\n ans+=(y*d) \r\n\r\nprint(ans/n)", "n, m = [int(x) for x in input().split()]\r\na = (n*(n-1))//2\r\nb = (n//2)*(n//2 + 1)\r\nc = (n//2)*(n//2 + 1) - (n//2)\r\nans = 0\r\nxsum = 0\r\nwhile m:\r\n\tm -= 1\r\n\tx, d = [int(x) for x in input().split()]\r\n\txsum += x\r\n\tif (d>0):\r\n\t\tans += a*d\r\n\telse:\r\n\t\tif(n%2 == 0):\r\n\t\t\tans += c*d\r\n\t\telse:\r\n\t\t\tans += b*d\r\nprint(xsum + ans/n)", "n, m = map(int, input().split())\nneg = ((n - 1) // 2) * ((n - 1) // 2 + 1)\nif n % 2 == 0:\n neg += n // 2\npos = n * (n - 1) // 2\nsum = 0\nfor _ in range(m):\n x, d = map(int, input().split())\n sum += x * n\n if d <= 0:\n sum += neg * d\n else:\n sum += pos * d\nprint(sum / n)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef f(a):\r\n return a * (a + 1) // 2\r\n\r\nn, m = map(int, input().split())\r\nmi, ma = f(n // 2) + f(n // 2 - (n % 2 ^ 1)), f(n - 1)\r\nans = 0\r\nc = 0\r\nfor _ in range(m):\r\n x, d = map(int, input().split())\r\n if d < 0:\r\n ans += d * mi\r\n else:\r\n ans += d * ma\r\n c += x\r\nans += n * c\r\nans /= n\r\nprint(ans)", "from decimal import Decimal\n\nn, m = map(int, input().split())\ntotal = Decimal('0')\nfor _ in range(m):\n x, d = map(Decimal, input().split())\n\n total += x\n\n if d > 0:\n total += (d*(n-1))/2\n else:\n if n%2 == 0:\n total += d*n/4\n else:\n total += d/n * (n*n-1)/4\n\nprint(total)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import *\r\n\r\nN,M = map(int, input().split())\r\nA = []\r\nfor _ in range(M):\r\n x,d = map(int, input().split())\r\n A.append((x,d))\r\n \r\nans = 0\r\nfor x,d in A:\r\n ans += x*N\r\n if d>=0:\r\n ans += N*(N-1)//2*d\r\n else:\r\n a = (N-1)//2\r\n b = N-1-a\r\n #print(a,b)\r\n ans += (a+1)*a//2*d\r\n ans += (b+1)*b//2*d\r\n #print(ans)\r\nprint(ans/N)\r\n ", "from decimal import *\r\ngetcontext().prec=666\r\nn,c,r=map(Decimal,(input()+' 0').split())\r\nt=((n//2)*((n+2)//2)/2+((n-1)//2)*((n+1)//2)/2)/n\r\nfor i in range(int(c)):\r\n a,b=map(Decimal,input().split())\r\n r+=a+b*((n-1)/2 if b>0 else t)\r\nprint(r)", "n, m = map(int, input().split())\r\nres = 0\r\nmx = (n-1)*n//2\r\nmn = 0\r\nif n&1:\r\n mn = (n//2)*(n//2+1)\r\nelse:\r\n mn = n*n//4\r\nfor i in range(m):\r\n x, d = map(int, input().split())\r\n res += x*n\r\n if d > 0:\r\n res += mx*d\r\n else:\r\n res += mn*d\r\nprint('%.10f'%(res/n))", "n, m = map(int, input().split())\r\n\r\nmaxf = (n - 1) * n // 2\r\nif n & 1:\r\n t = (n - 1) // 2\r\n minf = t * (t + 1)\r\nelse:\r\n t = n // 2 - 1\r\n minf = t * (t + 1) + t + 1\r\n\r\nans = 0\r\n\r\nfor i in range(m):\r\n x, d = map(int, input().split())\r\n ans += x * n\r\n if d > 0:\r\n ans += maxf * d\r\n else:\r\n ans += minf * d\r\n # print(ans)\r\n\r\nprint(\"%.10f\" % (ans / n))", "import math\r\nimport random\r\nfrom collections import defaultdict\r\nimport time\r\nfrom decimal import *\r\n#start_time=time.time()\r\n\r\n# create a defaultdict with int as the default factory\r\n\r\n\r\n# add 1 to item 'key'\r\n#d['key'] += 1\r\n\r\n# print the updated dictionary\r\n#print(d['key'])\r\n\r\n\r\nansw=[]\r\n#zz=int(input())\r\n#matrice=[]\r\n\r\ndef binary_search(vector,valoarea):\r\n \r\n left=0\r\n right=len(vector)-1\r\n \r\n while left<=right:\r\n \r\n \r\n centru=(left+right)//2\r\n print(left,right,centru,vector[centru])\r\n \r\n if vector[centru]<=valoarea:\r\n left=centru+1\r\n else:\r\n right=centru-1\r\n \r\n print(left,right,centru,vector[centru]) \r\n return left\r\n \r\n\r\nmatrice=[]\r\n#teste=int(input())\r\nfor gg in range(1):\r\n \r\n # d = defaultdict(int)\r\n dictionar={}\r\n dictionar_deschise={}\r\n dictionar_inchise={}\r\n \r\n #n=int(input())\r\n n,m=list(map(int,input().split()))\r\n #e=math.e\r\n \r\n #print(math.log(math.factorial(n)))\r\n #print(n*math.log(n))\r\n suma=0\r\n for i in range(m):\r\n x,d=list(map(int,input().split()))\r\n if d>0:\r\n suma+=x*n+d*(n*(n-1))//2\r\n \r\n else:\r\n centru=n//2\r\n j=n-1-centru\r\n suma+=x*n+d*(j*(j+1)//2)\r\n suma+=(centru*(centru+1)//2)*d\r\n \r\n print(Decimal((Decimal(suma)/n)))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(m):\r\n arr.append(list(map(int,input().split())))\r\ncount=0\r\nfor i in range(m):\r\n count +=arr[i][0] *(n)\r\n if n %2==1 and arr[i][1] <0:\r\n count +=(n//2)*(n//2 +1)*arr[i][1]\r\n if n %2==1 and arr[i][1] >0:\r\n count +=(n) *(n-1) *arr[i][1]//2\r\n if n %2==0 and arr[i][1] <0:\r\n count +=(n//2)*(n//2 -1)*arr[i][1]\r\n count +=(n//2) *arr[i][1]\r\n if n %2==0 and arr[i][1] >0:\r\n count +=(n) *(n-1) *arr[i][1] //2\r\nprint(count /n)", "from math import floor,ceil\nn,m = list(map(int,input().split()))\nanswer = 0\n\n\nfor _ in range(m):\n\tx,d = list(map(int,input().split()))\n\tanswer += n * x\n\tanswer += (d*n*(n-1))//2\n\tif d < 0:\n\t\tanswer += d * (n + ((n+1)//2) * (((n+1)//2)-n-1) )\n\nprint (answer/n)", "import math\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n total = 0\r\n for i in range(m):\r\n x,d = map(int,input().split())\r\n if d >= 0:\r\n total += (d*n*(n-1)//2)\r\n else:\r\n n1 = math.floor((n-1)/2)\r\n n2 = math.ceil((n-1)/2)\r\n\r\n total += (d*n1*(n1+1)//2)\r\n total += (d*n2*(n2+1)//2)\r\n\r\n total += n*x\r\n\r\n print(total/n)\r\n\r\n\r\nmain()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(u):\r\n return u*(u+1)//2\r\n\r\n\r\nn, m = map(int, input().split())\r\nx1, x2 = n//2, (n-1)//2\r\nx, y, c, d = f(x1) + f(x2), f(n-1), 0, 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n c += a\r\n d += max(b*x, b*y)\r\nprint((c*n+d)/n)", "def fun(y):\n\treturn y * (y + 1) // 2\n\n\nn, m = map(int, input().split())\nans = 0\nI = (n + 1) // 2\nMIN = fun(I - 1) + fun(n - I)\nMAX = fun(n - 1)\nfor i in range(m):\n\tx, d = map(int, input().split())\n\tans += n * x + d * (MIN if d < 0 else MAX)\nprint(\"%.12f\" % (ans / n))\n", "import math\r\n(n, m) = (int(i) for i in input().split())\r\nresult = 0\r\nfor i in range(m):\r\n (x, d) = (int(i) for i in input().split())\r\n result += x*n\r\n if d<0:\r\n mid = n//2\r\n calc = mid*(mid+1)\r\n if n % 2 == 0:\r\n calc -= mid\r\n result+=calc*d\r\n elif d>0:\r\n result+=((n * (n - 1)) // 2)*d\r\n \r\n # print(result)\r\nprint(result/n)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\ninfo = [list(map(int, input().split())) for i in range(m)]\r\n\r\nans = 0\r\ntmp1 = (n - 1) // 2\r\ntmp2 = -((-(n - 1)) // 2)\r\nfor x, d in info:\r\n ans += n * x\r\n if d > 0:\r\n ans += d * (n - 1) * (n) // 2\r\n if d < 0:\r\n ans += d * (tmp1) * (tmp1 + 1) // 2\r\n ans += d * (tmp2) * (tmp2 + 1) // 2\r\nprint(ans / n)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nS = 0\r\n\r\nfor _ in range(m):\r\n x, d = map(int, input().split())\r\n S += n*x\r\n \r\n if d>=0:\r\n S += n*(n-1)//2*d\r\n else:\r\n m = n//2\r\n S += 2*(m+1)*m//2*d\r\n \r\n if n%2==0:\r\n S -= m*d\r\n \r\nprint(S/n)", "from array import array\r\nfrom sys import stdin\r\nimport bisect\r\nfrom bisect import *\r\nimport itertools\r\nfrom itertools import *\r\n\r\ndef scan_gen():\r\n for line in stdin: yield from iter(line.split())\r\nscan = scan_gen()\r\ndef nint(): return int(next(scan))\r\ndef nintk(k): return tuple(nint() for _ in range(k))\r\ndef nfloat(): return float(next(scan))\r\ndef intar_init(size): return array('i',[0]) *size\r\ndef intar(size=None):\r\n if size == None: size = nint()\r\n arr = intar_init(size) \r\n for x in range(size): arr[x]=nint()\r\n return arr\r\n\r\n\r\ndef solve():\r\n n,m =nintk(2)\r\n sm = 0\r\n r1=0\r\n r2=0\r\n for i in range(n):\r\n r1 += i\r\n r2 += abs(i-n//2)\r\n for _ in range(m):\r\n x,d = nintk(2)\r\n sm += x*n\r\n if d>0:\r\n sm += d *r1\r\n else:\r\n sm += d*r2\r\n print(sm /n)\r\n\r\nsolve()\r\n\r\n", "n, m = map(int, input().split())\n\ndef gauss(x):\n return x * (x+1) // 2\n\ntotal = 0\nsum_left = gauss(n-1)\nsum_mid = gauss(n//2) + gauss((n-1)//2)\n\nfor _ in range(m):\n x, d = map(int, input().split())\n \n if d > 0:\n total += x*n + d*sum_left\n else:\n total += x*n + d*sum_mid\n\nprint(total/n)\n" ]

[ "N = int(input())\r\ncycles = list(map(int, input().split()))\r\n\r\nturn = 0\r\n\r\nfor k in cycles:\r\n # if k == 1:\r\n # print(2)\r\n # continue\r\n\r\n turn+= k\r\n\r\n if turn % 2: print(2)\r\n else: print(1)\r\n\r\n turn = (turn+1) % 2\r\n", "n = int(input())\r\narr = [*map(int, input().split())]\r\nans = 1\r\nfor num in arr:\r\n ans ^= (num - 1) % 2\r\n print(ans+1)", "n = int(input())\r\na = list(map(lambda x: int(x)-1, input().split()))\r\ns = a[0]\r\nfor i in range(1, n):\r\n s += a[i]\r\n a[i] = s\r\nprint(\"\\n\".join((('2', '1')[a[i] % 2] for i in range(n))))", "r = int(input())\r\nf = map(int,input().split(\" \"))\r\ng= 2\r\nfor v in f:\r\n\tif v & 1 == 0:\r\n\t\tg = 3 - g\r\n\tprint(g)", "from 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\nct = 0\r\nfor x in a:\r\n ct ^= (x & 1 == 0)\r\n print(2-ct)", "n = int(input())\r\ns = list(map(int, input(). split()))\r\nsum = 0\r\nfor i in range(n):\r\n sum += s[i] - 1\r\n if sum % 2 == 1:\r\n print(1)\r\n else:\r\n print(2)# 1698269963.4801064", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n if a[i] >= 2:\r\n cnt += a[i] - 1\r\n if cnt % 2 == 0:\r\n print(2)\r\n else:\r\n print(1)", "input()\r\nw=1\r\nfor x in map(int,input().split()):\r\n w^=(x-1)%2\r\n print(w+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=2\r\nfor i in a:\r\n if(i%2==0):\r\n x=3-x\r\n print(x)", "input()\r\nw = 1\r\nfor x in map(int, input().split()):\r\n w ^= ((x - 1) % 2)\r\n print(w + 1)\r\n" ]

[ "result=list(map(int,input().split()))\r\nresult.sort()\r\nprint(result[-1]-result[0])", "vals = sorted(map(int, input().split()))\r\ndist = max(vals) - min(vals)\r\nprint(dist)", "a = list(map(int, input().split()))\r\nprint(max(a)-min(a))\r\n", "x1,x2,x3=map(int,input().split())\r\ny=max(x1,x2,x3)\r\nz=min(x1,x2,x3)\r\nprint(y-z)", "def get_min(a,b,c):\r\n a = int(a)\r\n b = int(b)\r\n c = int(c)\r\n lengthA=abs(a-b)+abs(a-c)\r\n lengthB=abs(b-a)+abs(b-c)\r\n lengthC=abs(c-a)+abs(c-b)\r\n return min(lengthA,lengthB,lengthC)\r\nx=input()\r\na,b,c=x.split()\r\n\r\n\r\nprint(get_min(a,b,c))", "arr = input().split()\r\narr = [int(x) for x in arr]\r\narr.sort()\r\ndistanceArr = []\r\nfor i in range(arr[0], arr[2] + 1):\r\n distanceArr.append(abs(arr[0] - i) + abs(arr[1] - i) + abs(arr[2] - i))\r\nprint(min(distanceArr))", "x,y,z=map(int,input().split(' '))\r\n\r\ndistance =[abs(x-y),abs(x-z),abs(z-y)]\r\nmin_distance=max(distance)\r\nprint(min_distance)", "import math\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nprint(lst[-1]-lst[0])\r\n", "\r\na, b, c = map(int, input().split())\r\nprint(max(a,b,c) - min(a,b,c))\r\n", "x,y,z = map(int,input().split())\r\nmin_dist = float('inf')\r\nxy = abs(x-y)\r\nxz = abs(x-z)\r\nyz = abs(y-z)\r\nif xy+xz < min_dist:\r\n min_dist = xy+xz\r\nif xy+yz < min_dist:\r\n min_dist = xy+yz\r\nif xz+yz < min_dist:\r\n min_dist = xz + yz\r\nprint(min_dist)", "a,b,c=map(int, input().split())\r\nx=a+b+c-max(a,b,c)-min(a,b,c)\r\nprint(abs(a-x)+abs(b-x)+abs(c-x))\r\n", "x1, x2, x3 = map(int, input().split())\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\nmedian = coordinates[1]\r\ntotal_distance = abs(x1 - median) + abs(x2 - median) + abs(x3 - median)\r\nprint(total_distance)\r\n", "a=[int(i) for i in input().split()]\r\nprint(min(abs(a[0]-a[1])+abs(a[0]-a[2]),abs(a[1]-a[0])+abs(a[1]-a[2]),abs(a[2]-a[0])+abs(a[2]-a[1])))", "s=0\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\ncmd=lst[1]\r\nfor i in lst:\r\n s+=abs(i-cmd)\r\nprint(int(s))", "s = [int(i) for i in input().split()]\r\nm = max(s)\r\nmn = min(s)\r\ncount = 0\r\nfor i in s:\r\n if mn < i < m:\r\n count += (i - mn) + (m - i)\r\nprint(count)", "x=sorted(list(map(int,input().split())))\r\nprint(abs(x[1]-x[0])+abs(x[1]-x[2]))\r\n", "a1=list(map(int,input().split()))\nn1=len(a1)\ns1=sum(a1)\nav=s1/n1\nma=max(a1)\nmi=min(a1)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz=d1+d2\nprint(int(z))\n \t\t\t \t \t \t \t \t\t \t \t\t\t\t \t", "n,m,o=map(int,input().split())\r\n\r\nao=[]\r\n\r\nm_n = abs(m - n)\r\nn_o = abs(n - o)\r\nm_o = abs(m - o)\r\n\r\nao.append(m_n)\r\nao.append(n_o)\r\nao.append(m_o)\r\n\r\nao.sort()\r\nprint(ao[0]+ao[1])\r\n\r\n", "l=[int(x) for x in input().split()]\r\nprint(max(l)-min(l))", "l=[int(i) for i in input().split()]\r\nl.sort()\r\nprint(min((2*l[2]-l[0]-l[1]),(l[2]-l[0]),l[2]+l[1]-2*l[0]))", "a,b,c=map(int,input().split())\r\n\r\nmax1=max(a,b,c)\r\nmin1=min(a,b,c)\r\n\r\nmid1=a+b+c-min1-max1\r\n\r\nprint(abs(mid1-min1)+abs(mid1-max1))", "a=list(map(int,input().split()))\r\na.sort()\r\nc=abs(a[0]-a[1])+abs(a[1]-a[2])\r\nprint(c)", "x = list(map(int, input().split()))\r\nmaxi = max(x)\r\nx.remove(maxi)\r\nmini = min(x)\r\nx.remove(mini)\r\nresult = maxi - x[0]\r\nresult += x[0] - mini\r\nprint(result)", "liczby = input().split()\r\nfor i in range(3):\r\n liczby[i] = int(liczby[i])\r\nliczby.sort()\r\nprint((liczby[1] - liczby[0]) + (liczby[2] - liczby[1]))", "x1, x2, x3 = map(int, input().split())\r\n\r\nx = [x1, x2, x3]\r\nx.sort()\r\n\r\nmin_distance = x[2] - x[0]\r\n\r\nprint(min_distance)\r\n", "a, b, c = map(int, input().split())\r\nsr = sorted([a, b, c])[1]\r\nprint((sorted([a, b, c])[2]-sr) + (sr-sorted([a, b, c])[0]))\r\n", "x1,x2,x3 = map(int, input().split())\r\nz1 = abs(x2-x1)+abs(x3-x2)\r\nz2 = abs(x1-x2)+abs(x1-x3)\r\nz3 = abs(x3-x1)+abs(x3-x2)\r\nprint(min(z1,z2,z3))\r\n", "a, b, c = map(int, input().split())\n\nmin = min(a, min(b,c))\nmax = max(a, max(b,c))\n\nprint(max-min)\n \t\t\t \t\t \t \t\t\t \t \t \t \t \t\t", "p=list(map(int,input().split()))\r\na=max(p)\r\nb=min(p)\r\np.remove(a)\r\np.remove(b)\r\nc=max(p)\r\ns=a-c\r\ns+=c-b\r\nprint(s)", "a,b,c=map(int,(input().split()))\r\nmid=(a+b+c)//3\r\nda=(abs(a-mid))\r\ndb=abs(b-mid)\r\ndc=abs(c-mid)\r\na1=[0]*3\r\na1[0]=min(a,b,c)\r\na1[2]=max(a,b,c)\r\na1[1]=(a+b+c)-(a1[0]+a1[2])\r\nma=(abs(a-a1[1]))\r\nmb=abs(b-a1[1])\r\nmc=abs(c-a1[1])\r\nans=min((da+db+dc),(ma+mb+mc))\r\nprint(ans)\r\n", "#중간값을 찾은다음에 최대값과의 차이, 최솟값과의 차이를 더하기\r\n\r\nx,y,z=map(int,input().split())\r\n\r\na=[x,y,z]\r\na.sort()\r\n\r\nprint((a[2]-a[1])+(a[1]-a[0]))\r\n", "x1, x2, x3 = map(int, input().split())\r\n\r\nmidpoint = (x1 + x2 + x3) - max(x1, x2, x3) - min(x1, x2, x3)\r\n\r\ndistance1 = abs(midpoint - x1)\r\ndistance2 = abs(midpoint - x2)\r\ndistance3 = abs(midpoint - x3)\r\n\r\nmin_total_distance = distance1 + distance2 + distance3\r\n\r\nprint(min_total_distance)", "from math import*\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n if i not in [max(l),min(l)]:\r\n a=i\r\n\r\n\r\nfor i in l:\r\n s+=abs(a-i)\r\nprint(s)\r\n", "tests = list(map(int, input().split()))\r\ntests.sort()\r\n\r\na, b, c = tests[0], tests[1], tests[2]\r\nprint((b-a)+(c-b))", "x=list(map(int,input().split()))\r\nx.sort()\r\nmin=100\r\ndis=0\r\nfor k in range(x[0],x[2]):\r\n dis=abs(x[0]-k)+abs(x[1]-k)+abs(x[2]-k)\r\n if dis<min:\r\n min=dis\r\nprint(min) \r\n ", "D = [int(p) for p in input(\"\").split()]\r\nD.sort()\r\nprint((D[1] - D[0]) + (D[2] - D[1]))", "x1, x2, x3 = map(int, input().split())\r\nd = -1\r\nfor i in range(min(x1, x2, x3), max(x1, x2, x3) + 1):\r\n d2 = abs(i - x1) + abs(i - x2) + abs(i - x3)\r\n if d2 < d or d == -1:\r\n d = d2\r\nprint(d)", "\r\nligne = list(map(int, input().split()))\r\nligne.sort()\r\nprint(ligne[2]-ligne[0])", "inp = input().split()\r\nnums = list(map(lambda x:int(x), inp))\r\nnums.sort()\r\nprint((nums[1]-nums[0]) + (nums[2]-nums[1]))", "# Read the input coordinates\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Calculate the minimum total distance\r\ndistances = [x1, x2, x3]\r\ndistances.sort()\r\n\r\n# The middle friend should meet at the median coordinate\r\nminimum_distance = distances[2] - distances[0]\r\n\r\nprint(minimum_distance)\r\n", "numbers = list(map(int, input().split()))\n\nmax_power = max(numbers)\nmin_power = min(numbers)\n\nfinal_power = max_power - min_power\n\nprint(final_power)\n\n\t\t\t\t\t \t\t \t\t \t \t \t\t\t \t\t\t \t\t \t", "a, b, c = map(int, input().split())\r\nprint(max(a,c, b)-min(a, b, c))", "a,b,c = map(int,input().split())\r\ns = a+b+c - min(a,b,c)-max(a,b,c)\r\nif s == a:\r\n print(abs(b-a)+abs(c-a))\r\nif s == b:\r\n print(abs(c-b)+abs(a-b))\r\nif s == c:\r\n print(abs(b-c)+abs(a-c))\n# Thu Jan 05 2023 11:26:42 GMT+0300 (Moscow Standard Time)\n", "e = list(map(int, input().split()))\r\ne.sort()\r\nx1, x2, x3 = map(str, e)\r\nx1 = int(x1)\r\nx2 = int(x2)\r\nx3 = int(x3)\r\ny1 = abs(x1 - x2)\r\ny2 = abs(x2 - x3)\r\nprint(int(y1 + y2))", "# https://codeforces.com/problemset/problem/723/A\r\n\r\ndef main():\r\n a, b, c = map(int, input().split(' '))\r\n _min = min(a, b, c)\r\n _max = max(a, b, c)\r\n print(_max - _min)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "x1, x2, x3 = map(int, input().split())\r\nprint(max(x1,x2,x3) - min(x1,x2,x3))\r\n", "a,b,c=map(int,input().split())\r\ndiff1=abs(b-a)+abs(c-a)\r\ndiff2=abs(a-b)+abs(c-b)\r\ndiff3=abs(a-c)+abs(b-c)\r\nprint(min(diff1,diff2,diff3))", "nums = list(map(int, input().split()))\r\nnums.sort()\r\nmid = nums[1]\r\nprint(abs(nums[0]-mid)+abs(nums[2]-mid))", "friends = sorted(list(map(int, input().split())))\r\nprint(friends[1] - friends[0] + friends[-1] - friends[1])", "nums=list(map(int,input().split()))\r\nminer=min(nums)\r\nnums.remove(miner)\r\ncheck,great= min(nums),max(nums)\r\nprint((check-miner)+(great-check))\r\n", "def main():\n c1, c2, c3 = map(int, input().split())\n points = sorted([c1, c2, c3])\n print(abs(points[0] - points[1]) + abs(points[2] - points[1]))\n\nmain()\n\n \t \t\t\t\t\t\t \t \t\t\t\t\t\t \t\t\t\t \t \t\t\t", "l = list(map(int,input().split()))\r\nl = sorted(l)\r\nprint (l[2] - l[0])", "x1, x2, x3 = sorted(map(int, input().split()))\r\nmedian = x2\r\ndistance = abs(x1 - median) + abs(x2 - median) + abs(x3 - median)\r\nprint(distance)\r\n", "l = list(map(int,input().split(\" \")))\r\nl.sort()\r\nprint((l[1] - l[0])+(l[2] - l[1]))", "pts = list(map(int,input().split()))\r\npts.sort()\r\nprint(abs(pts[1]-pts[0])+abs(pts[1]-pts[2]))", "houses = str(input())\r\nlist_homes = sorted([int(i) for i in houses.split()])\r\nprint(sum([(list_homes[2]-list_homes[1]), (list_homes[1]-list_homes[0])]))\r\n", "a,b,c=map(int,input().split())\r\nanswer=[]\r\nfor n in range(min(a,b,c),max(a,b,c)):\r\n d=abs(a-n)+abs(b-n)+abs(c-n)\r\n answer.append(d)\r\nanswer.sort()\r\nprint(answer[0])", "a,b,c=map(int, input().split())\r\nma= min(a, min(b,c))\r\nmb = max(a, max(b,c))\r\nprint(mb - ma)\r\n", "x1,x2,x3=map(int,input().split())\r\ndx1=abs(x1-x2)+abs(x1-x3)\r\ndx2=abs(x2-x3)+abs(x2-x1)\r\ndx3=abs(x3-x1)+abs(x3-x2)\r\nprint(min(dx1,dx2,dx3))", "q = list(map(int,input().split()))\r\nfor i in range(len(q)-1):\r\n for j in range(len(q)-i-1):\r\n if q[j] > q[j+1]:\r\n q[j], q[j+1] = q[j+1], q[j]\r\nw = []\r\ne = 0\r\nfor i in range(len(q)):\r\n e += q[i]\r\ne -= max(q)\r\ne -= min(q)\r\nprint(max(q)-e+e-min(q))\r\n\n# Fri Jul 07 2023 18:08:12 GMT+0300 (Moscow Standard Time)\n", "Ox = [int(x) for x in input().split()]\r\nOx.sort()\r\nprint(( Ox[1]-Ox[0] ) + (Ox[2]-Ox[1]) )", "line = list(map(int, input().strip().split()))\r\nprint(max(line) - min(line)) ", "x=list(map(int,input().split()))\r\nx.sort()\r\nprint((x[1]-x[0])+(x[2]-x[1]))\r\n", "l=list(map(int,input().split()))\r\nfor i in range(3):\r\n if(l[i]!=min(l) and l[i]!=max(l)):\r\n c=l[i]\r\nprint(abs(c-l[0])+abs(l[1]-c)+abs(l[2]-c))", "l = input()\nx1,x2,x3 = [int(i) for i in l.split()]\nif x1 > x2 and x2>x3: \n df = abs(x3-x1)\nelif x3 > x2 and x2>x1:\n df = abs(x1-x3)\nelif x1 > x3 and x3>x2:\n df = abs(x2-x1) \nelif x2>x3 and x3 >x1:\n df = abs(x1-x2) \nelif x3> x1 and x1>x2 :\n df = abs(x2-x3) \nelif x2> x1 and x1>x3:\n df = abs(x3-x2)\n\nprint(df)\n\n\t \t \t \t \t \t \t \t \t\t \t\t\t \t", "n=input()\r\nalist=[int(x) for x in n.split()]\r\nalist.sort()\r\nprint(alist[1]-alist[0]+(alist[2]-alist[1]))", "a,b,c = map(int,input().split())\r\nd = []\r\nd.append(a)\r\nd.append(b)\r\nd.append(c)\r\nd.sort()\r\nprint(d[2]-d[0])", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Найдем максимальное и минимальное значение\r\nmax_x = max(x1, x2, x3)\r\nmin_x = min(x1, x2, x3)\r\n\r\n# Найдем медиану, которая является средним значением после удаления максимального и минимального значения\r\nmedian_x = x1 + x2 + x3 - max_x - min_x\r\n\r\n# Выведем минимальное суммарное расстояние\r\nprint(max_x - min_x)\r\n", "def main():\r\n x1, x2, x3 = map(int, input().split(\" \"))\r\n coords = sorted([x1, x2, x3])\r\n\r\n d1 = coords[1] - coords[0]\r\n d2 = coords[2] - coords[1]\r\n d3 = coords[2] - coords[0]\r\n\r\n res = min(d1 + d2, d1 + d3, d2 + d3)\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "*a,=map(int,input().split());print(max(a)-min(a))#dxftgyhuiuyhgfxchuijohugfchjuihugf\n \t\t \t\t\t \t \t\t \t \t \t \t\t\t", "x,y,z=map(int,input().split())\r\nmaxi=max(x,y,z)\r\nmini=min(x,y,z)\r\nfor i in x,y,z:\r\n if i != mini or i!= maxi:\r\n mid = i\r\nprint(maxi-mid+mid-mini)", "a,b,c=map(int,input().split())\r\nl=[a,b,c]\r\nl.sort()\r\ns=0\r\nif l[1]-l[0]<=l[2]-l[1]:\r\n s+=l[1]-l[0]\r\n s+=l[2]-l[1]\r\nelif l[2]-l[1]<l[1]-l[0]:\r\n s+=l[2]-l[1]\r\n s+=l[1]-l[0]\r\nprint(s)", "l=list(map(int,input().split()))\r\nl.sort()\r\nprint((l[1]-l[0])+(l[2]-l[1]))", "a,b,c=[int(x) for x in input().split()]\r\nres=1000\r\nfor i in range(1,101):\r\n temp=abs(a-i)+abs(b-i)+abs(c-i)\r\n if temp<res:\r\n res=temp\r\nprint(res)\r\n", "x1, x2, x3 = map(int, input().split())\r\narr = []\r\narr.append(x1)\r\narr.append(x2)\r\narr.append(x3)\r\narr.sort()\r\n# print(arr[1]) # wrong\r\nprint(arr[2]-arr[0])", "x1,x2,x3=[int(x) for x in input().split()]\ndistance1= abs(x1-x2) + abs(x1-x3)\ndistance2= abs(x2-x1) + abs(x2-x3)\ndistance3= abs(x3-x1) + abs(x3-x2)\nprint(min(distance1,distance2,distance3))", "o=list(map(int,input().split()))\nn=len(o)\ns=sum(o)\nap=s/n\nts=max(o)\nka=min(o)\nd1=abs(ap-ts)\nd2=abs(ap-ka)\nf=d1+d2\nprint(int(f))\n \t \t\t\t\t\t\t\t\t\t \t\t \t \t \t \t", "def main():\r\n a = input().split()\r\n a = [int(i) for i in a]\r\n m1 = min(a)\r\n m2 = max(a)\r\n minimum = abs(a[0]- m1) + abs(a[1] - m1) + abs(a[2] - m1)\r\n for m in range(m1, m2):\r\n minimum = min(minimum, abs(a[0]-m) + abs(a[1]-m) + abs(a[2]-m))\r\n print(minimum)\r\nmain()", "nums = list(map(int,input().split()))\r\nnums.sort()\r\nprint((nums[1] - nums[0]) + (nums[2] - nums[1]))", "friend_coordinate = list(map(int, input().split())) \r\nmin_value = min(friend_coordinate) \r\nmax_value = max(friend_coordinate) \r\n \r\nmid = (min_value + max_value) // 2 \r\nprint((max_value-mid) + (mid - min_value))\r\n ", "a=list(map(int,input().split()))\r\na.sort();\r\nprint(abs(a[0]-a[1])+abs(a[1]-a[2]))", "n=list(map(int,input().split()))\r\nn.sort()\r\nx=n[2]-n[0]\r\nprint(x)", "a=[int(k) for k in input().split()]\na.sort()\nprint((a[1]-a[0])+(a[2]-a[1]))\n \t\t \t\t \t\t \t \t\t \t \t \t \t \t \t \t", "l = list(map(int, input().split()))\nl.sort()\n\nx1, x2, x3 = l\nanswer = (x2 - x1) + (x3 - x2) \n\n# avg = (x1 + x2 + x3) // 3\n# count = abs(avg - x1) + abs(avg - x2) + abs(avg - x3)\nprint(answer)", "lista = sorted([int(x) for x in input().split()])\r\nvalores = {}\r\nnum = -1\r\nfor x in range(lista[2]+1):\r\n num += 1\r\n respro = abs(x-lista[0]) + abs(x-lista[1]) + abs(x-lista[2])\r\n valores[num] = respro\r\n\r\nprint(min(valores.values()))", "coord = [int(num) for num in input().split(' ')]\ncoord.sort()\n\nprint(coord[2]-coord[0])\n \t\t \t \t \t \t\t\t \t \t \t \t\t\t \t \t", "x1, x2, x3 = map(int, input().split())\r\nsorted_coords = sorted([x1, x2, x3])\r\ntotal_distance = sorted_coords[2] - sorted_coords[0]\r\nprint(total_distance)", "x1,x2,x3=map(int,input().split())\r\n#x1=max(x1,x2,x3)\r\n#x3=min(x1,x2,x3)\r\nmid=(x1+x2+x3)-(max(x1,x2,x3)+min(x1,x2,x3))\r\nx11=max(x1,x2,x3)\r\nx3=min(x1,x2,x3)\r\n\r\n#print(x11,x2,x3)\r\nprint((abs(mid-x11)+abs(mid-x3)))", "x=list(map(int,input().split()))\r\nprint(max(x)-min(x))\r\n", "n,b,c=map(int,input().split())\r\nprint(abs(min(n,b,c)-max(n,b,c)))\r\n", "l=[]\r\nx1, x2, x3=input().split()\r\nx1=int(x1)\r\nx2=int(x2)\r\nx3=int(x3)\r\nl.append(x1)\r\nl.append(x2)\r\nl.append(x3)\r\nl.sort()\r\nm=l[1]\r\nlar=l[0]\r\nsmall=l[2]\r\nsc=lar-m\r\nsc2=m-small\r\nmc=sc+sc2\r\nprint(-mc)", "a,b,c=map(int,input().split())\r\na,b=max(a,b,c),min(a,b,c)\r\nprint(a-b)", "x1,x2,x3=map(int,input().split())\r\nv1=[x1,x2,x3]\r\nv1.sort()\r\nc=0\r\na1=v1[1]-v1[0]\r\nc+=a1\r\na2=v1[2]-v1[1]\r\nc+=a2\r\nprint(c)", "x = list(map(int, input().split()))\r\nx.sort()\r\n\r\ndist1 = x[1] - x[0]\r\ndist2 = x[2] - x[1]\r\ntotal_distance = dist1 + dist2\r\n\r\nprint(total_distance)\r\n", "a= list(map(int,input().split()))\r\na.sort()\r\n\r\nsum=0\r\nsum=abs(a[1]-a[0])+abs(a[1]-a[2])\r\nprint(sum)", "input1=input().split()\r\nfor i in range(0,len(input1)):\r\n input1[i]=int(input1[i])\r\ninput1.sort()\r\nx=input1[0]\r\nd_min=input1[1]+input1[2]-2*input1[0]\r\nfor i in range(input1[0]+1,input1[2]+1):\r\n d=abs(input1[0]-i)+abs(input1[1]-i)+abs(input1[2]-i)\r\n if(d<d_min):\r\n d_min=d\r\n x=i\r\nprint(d_min)", "n=input().split()\r\nx1=int(n[0])\r\nx2=int(n[1])\r\nx3=int(n[2])\r\no=0\r\nl=[]\r\nl.append(x1)\r\nl.append(x2)\r\nl.append(x3)\r\nmaxx=max(l)\r\nminn=min(l)\r\nfor i in l:\r\n if i!=maxx and i!=minn:\r\n v=i\r\nd1=maxx-v\r\nd2=v-minn\r\no=d1+d2\r\nprint(o)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 20 20:28:42 2022\r\n\r\n@author: rohan\r\n\"\"\"\r\n\r\na,b,c = map(int, input().split(\" \"))\r\na, b, c = sorted([a,b,c])\r\nprint((c-b) + (b-a))", "arr=sorted(list(map(int,input().split())))\nprint((arr[2]-arr[1])+(arr[1]-arr[0]))\n\n", "def calculate_min_distance(x1, x2, x3):\n coordinates = sorted([x1, x2, x3])\n min_distance = coordinates[2] - coordinates[0]\n\n return min_distance\n\n\nx1, x2, x3 = map(int, input().split())\n\nmin_distance = calculate_min_distance(x1, x2, x3)\nprint(min_distance)\n\n \t \t\t \t \t \t\t\t \t\t\t \t\t\t\t", "x1,x2,x3=list(map(int,input().split()))\r\na=[]\r\na.append(x1)\r\na.append(x2)\r\na.append(x3)\r\na.sort()\r\nprint((a[1]-a[0])+(a[2]-a[1]))", "usr = list(map(int, input().split()))\r\nusr.sort()\r\n# finding the difference with the mid freind house\r\nres = abs(usr[1]-usr[0]) + abs(usr[1]-usr[2])\r\nprint(res)", "x1, x2, x3 = map(int, input().split())\r\n\r\nmin_coord = min(x1, x2, x3)\r\nmax_coord = max(x1, x2, x3)\r\n\r\ndistance = max_coord - min_coord\r\n\r\nprint(distance)\r\n", "entrada = input().split(\" \")\r\n\r\nlista = []\r\nfor i in entrada:\r\n lista.append(int(i))\r\n\r\nlista = sorted(lista)\r\n\r\ndistancia = lista[1] - lista[0] + lista[2] - lista[1]\r\n\r\nprint(distancia)", "list1 = list(map(int,input().split()))\r\nlist1.sort()\r\nprint((list1[2] - list1[1]) + (list1[1] - list1[0]))", "def questionone(p1, p2, p3):\n m = sorted([p1, p2, p3])[1]\n a = abs(p1 - m) + abs(p2 - m) + abs(p3 - m)\n return a\n\n\np1, p2, p3 = map(int, input().split())\n\nprint(questionone(p1, p2, p3))\n\n \t\t \t \t\t \t \t \t \t\t \t\t", "x = [int(x) for x in input().split()]\r\n\r\nx.sort(reverse=True)\r\ndis = (x[0] - x[1]) + x[1] - x[2]\r\nprint(dis)\r\n", "total = 0\r\nnumbers = list(map(int, input().split()))\r\nnumbers.sort()\r\ntotal += abs(numbers[1]-numbers[0])\r\ntotal += abs(numbers[1]-numbers[2])\r\nprint(total)", "a = list(map(int,input().split()))\r\na.sort()\r\nd = (a[0]+a[1]+a[2])/3\r\nprint(a[2]-a[0])\r\n", "l = list(map(int,input().split()))\r\nl.sort()\r\nprint(abs(l[1]-l[0]) + abs(l[1]-l[2]))", "(a,b,c)=list(map(int,input().split(' ')))\r\nx=(a,b,c)\r\nlist1=list(x)\r\nlist1.sort()\r\na=list1[1]-list1[0]\r\nb=list1[2]-list1[1]\r\nprint(a+b)", "x1, x2, x3 = map(int, input().split())\r\nminc= min(x1, x2, x3)\r\nmaxc= max(x1, x2, x3)\r\ntotal= maxc- minc\r\nprint(total)\r\n", "string=input()\r\nl=list(map(int,string.split()))\r\nl.sort()\r\nprint((l[1]-l[0])+(l[2]-l[1]))", "poses = list(map(int,input().split()))\r\nposes.sort()\r\ndistance = (poses[2]-poses[1])+(poses[1]-poses[0])\r\nprint(distance)", "x1,x2,x3=map(int,input().split())\r\nmx=max(x1,x2,x3)\r\nmn=min(x1,x2,x3)\r\nmx2=0\r\nif x1!=mx and x1!=mn:\r\n mx2=x1\r\nelif x2!=mx and x2!=mn:\r\n mx2=x2\r\nelif x3!=mx and x3!=mn:\r\n mx2=x3\r\nans=(mx-mx2)+(mx2-mn)\r\nprint(ans)", "x1,x2,x3=sorted(map(int,input().split()))\r\nprint(x3-x1)", "s = input().split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\ns.sort()\r\nc = (s[2]-s[1])+(s[1]-s[0])\r\nprint(c)", "ar=list(map(int,input().split()))\r\nar.sort()\r\nprint(abs(ar[0]-ar[1])+abs(ar[1]-ar[2]))", "l=list(map(int,input().split()))\r\nx=max(l)\r\ny=min(l)\r\nprint(x-y)", "n = input().split()\r\nn[0] = int(n[0])\r\nn[1] = int(n[1])\r\nn[2] = int(n[2])\r\nn.sort()\r\nprint((n[1]-n[0])+(n[2]-n[1]))\r\n", "numbers = list(map(int, input().split(' ')))\n\nnumbers = sorted(numbers)\ncenter = numbers[1]\nmin_distances = map(lambda x: abs(x-center), numbers)\nprint(sum(min_distances))\n", "a , b, c = input () . split ()\na = int (a)\nb = int (b)\nc = int(c)\nans = max (a, b,c) - min(a,b,c)\nprint (ans)\n \t \t\t\t\t\t \t\t \t\t \t \t \t\t\t \t \t", "x1, x2, x3 = [int(i) for i in input().split(\" \")]\r\nprint(max(x1, x2, x3) - min(x1, x2, x3))", "hi = list(map(int,input().split()))\nprint(max(hi) - min(hi))\n \t\t \t \t\t\t\t \t \t \t\t\t\t \t\t\t\t\t", "s = sorted(list(map(int, input().split())))\r\n\r\nif len(s) % 2 == 1:\r\n idx = len(s) // 2\r\n idy = len(s) // 2 + 1\r\n l = 0\r\n p = 0\r\n for i in range(len(s)):\r\n if i == idx:\r\n continue\r\n l += abs(s[i] - s[idx])\r\n p += abs(s[i] - s[idy])\r\n print(min(l, p))\r\nelse:\r\n l = 0\r\n idx = len(s) // 2\r\n for i in range(len(s)):\r\n if i == idx:\r\n continue\r\n l += abs(s[i] - s[idx])\r\n print(l)\r\n", "def f():\r\n n=input()\r\n n=n.split(\" \")\r\n n=map(int,n)\r\n n=list(n)\r\n n.sort()\r\n return (n[1]-n[0])+(n[2]-n[1])\r\n\r\nprint(f())", "x = list(map(int, input().split()))\r\n\r\nx.sort()\r\n\r\nmiddle = x[1]\r\n\r\n\r\nx1 = abs(x[0] - middle)\r\nx2 = x[2] - middle\r\n\r\nprint(x1 + x2)", "s = input().split()\r\nx1, x2, x3 = [int(x) for x in s]\r\nl = [int(x) for x in s]\r\nl.sort()\r\n\r\nprint(l[2]-l[0])\r\n", "n = list(map(int, input().split()))\na,b = max(n), min(n)\nprint(a-b)", "x,y,z=map(int,input().split())\r\nc=(x+z+y)-(min(x,z,y)+max(x,y,z))\r\nprint((max(x,y,z)-c)+(c-min(x,z,y)))\r\n", "s = input().split()\r\na, b, c = int(s[0]), int(s[1]), int(s[2])\r\ns = [a, b, c]\r\nprint(max(s) - min(s))", "A, B, C = map(int, input().split())\r\nprint(max(A, B, C) - min(A, B, C))", "n=[int(i) for i in input().split()]\r\ns=sorted(n)\r\nm=(s[1]-s[0])+(s[2]-s[1])\r\nprint(m)", "def theNewYear_MeetingFriends(x1, x2, x3):\r\n \r\n return max(x1, x2, x3) - min(x1, x2, x3)\r\nx1, x2, x3 = map(int, input().split())\r\nprint(theNewYear_MeetingFriends(x1, x2, x3))", "def main():\r\n m = 0\r\n M = 100\r\n\r\n x1, x2, x3 = map(int, input().split())\r\n max_val = x1\r\n min_val = x1\r\n\r\n max_val = max(max_val, x2)\r\n max_val = max(max_val, x3)\r\n min_val = min(min_val, x2)\r\n min_val = min(min_val, x3)\r\n\r\n print(max_val - min_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "p1, p2, p3 = map(int, input().split())\n\nmax_power = max(p1, p2, p3)\nmin_power = min(p1, p2, p3)\n\nfinal_power = max_power - min_power\n\nprint(final_power)\n\n\t \t\t \t \t\t \t\t\t \t\t \t\t\t", "x=list(map(int,input().split()))\nn=len(x)\ns=sum(x)\nav=s/n\nma=max(x)\nmi=min(x)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz=d1+d2\nprint(int(z))\n \t\t\t\t \t \t\t \t\t \t \t\t \t\t\t \t", "n=list(map(int,input().split(\" \")))\r\nz=(int(n[0])+int(n[1])+int(n[2]))\r\na=sorted(n)\r\nx=a[1]\r\ny=0\r\nfor q in n:\r\n\twhile q!=x:\r\n\t\tif q>x:\r\n\t\t\tq=q-1\r\n\t\t\ty=y+1\r\n\t\telif q<x:\r\n\t\t\tq=q+1\r\n\t\t\ty=y+1\r\nprint(y)\r\n", "arr = list(map(int, input().split()))\r\narr.sort()\r\nprint((arr[1] - arr[0]) + (arr[2] - arr[1]))\r\n", "from math import ceil, floor\r\na, b, c = map(int, input().split())\r\narr = sorted([a, b, c])\r\nprint(arr[2] - arr[0])", "a,b,c=map(int,input().split())\r\nMin=1e9\r\nfor i in range (max(a,b,c)):\r\n Min=min(Min,abs(a-i)+abs(b-i)+abs(c-i))\r\nprint(Min)", "x=[int(x) for x in input().split()]\r\nm=max(x)\r\nn=min(x)\r\ns=0\r\na=sum(x)\r\na=a-m-n\r\nprint(abs(m-a)+abs(n-a))\r\n", "x,y,z=map(int,input().split())\r\nprint(max(x,y,z)-min(x,y,z))", "x1 , x2 , x3 = map(int , input().split())\r\nprint(max(x1 , x2 , x3) - min(x1 , x2 , x3))", "x1, x2, x3 = map(int, input().split())\r\nmin_pos = min(x1, x2, x3)\r\nmax_pos = max(x1, x2, x3)\r\nmin_dist_to_be_traveled = max_pos - min_pos\r\nprint(min_dist_to_be_traveled)\r\n", "X1, X2, X3 = map(int, input().split())\r\nCoordinate = [X1, X2, X3]\r\nCoordinate.sort()\r\nDistance = Coordinate[2] - Coordinate[0]\r\nprint(Distance)", "a=list(map(int,input().split()))\na.sort()\nprint(a[2]-a[0])\n#kkkk\n\t\t \t\t\t \t \t\t\t \t \t\t\t\t \t \t\t\t\t", "a, b, c = map(int, input().split())\r\n\r\nif a > b > c:\r\n print((a - b) + (b - c))\r\nelif a > c > b:\r\n print((a - c) + (c - b))\r\nelif b > a > c:\r\n print((b - a) +(a - c))\r\nelif b > c > a:\r\n print((b - c) + (c - a))\r\nelif c > a > b:\r\n print((c - a) + (a - b))\r\nelif c > b > a:\r\n print((c - b) + (b - a))\r\nelif a == b == c:\r\n print(0)", "x,y,z=map(int,input().split())\r\nmn=min(x,y,z)\r\nmx=max(x,y,z)\r\nprint(mx-mn)\r\n", "points = list(map(int,input().split(\" \")))\r\n\r\nmax_point = max(points)\r\nmin_point = min(points)\r\nmin_way = (max_point - min_point) * 3\r\nfor i in range(min_point,max_point+1):\r\n way = abs(points[0]-i) + abs(points[1]-i) + abs(points[2]-i)\r\n if way < min_way:\r\n min_way = way\r\n\r\nprint(min_way)", "coord_ls = input().split()\ncoord1 = int(coord_ls[0])\ncoord2 = int(coord_ls[1])\ncoord3 = int(coord_ls[2])\nnew_ls = [coord1, coord2, coord3]\nnew_ls.sort()\nmeet = new_ls[1]\ndist = abs(new_ls[0] - meet) + abs(new_ls[2] - meet)\nprint(dist)\n\t \t \t\t\t\t\t \t\t \t \t \t \t \t \t", "a=list(map(int,input().strip().split()))\r\na.sort()\r\nprint((a[2]-a[1])+(a[1]-a[0]))\r\n", "a = list(map(int, input().split()))\r\nb = sorted(a)\r\n\r\nprint(b[-1] - b[0])", "a,b,c= map(int, input().split())\r\nprint( max(a,b,c)-min(a,b,c))", "a,b,c = map(int, input().split())\nminimum = min(a,b,c)\nmaximum = max(a,b,c)\ntotal = maximum - minimum\nprint(total)\n\t\t \t \t\t \t\t\t \t\t\t \t \t \t\t \t\t\t", "coords = list(map(int, input().split()))\r\nprint(max(coords) - min(coords))", "# LUOGU_RID: 101646783\na = sorted(map(int, input().split()))\r\nprint(a[2] - a[0])", "a, b, c = map(int, input().split(' '))\nlist = [a, b, c]\nlist.sort()\nprint(list[2] - list[0])\n\t\t \t \t\t \t\t\t \t\t\t\t \t \t\t \t\t \t \t", "k=list(map(int,input().split()))\r\nprint(max(k)-min(k))", "x=list(map(int, input().split()))\r\na=sum(x)-max(x)\r\nb=a-min(x)\r\nc=max(x)-b\r\nd=b-min(x)\r\nprint(c+d)\n# Fri Jul 07 2023 13:21:47 GMT+0300 (Moscow Standard Time)\n", "x1,x2,x3=map(int,input().split())\r\na=min(x1,x2,x3)\r\nb=max(x1,x2,x3)\r\nc=(x1+x2+x3)-a-b\r\nmin=(c-a)+(b-c)\r\nprint(min)\r\n", "a=input().split()\r\nb=[int(i) for i in a]\r\nb.sort()\r\nc=0\r\nfor i in b:\r\n c=c+abs(i-b[1])\r\nprint(c)\r\n", "x=list(map(int,input().split()))\r\nx.sort()\r\nprint(abs(x[0]-x[1])+abs(x[1]-x[2]))\r\n", "a=input().split()\r\nfor i in range(3):\r\n a[i]=int(a[i])\r\na=sorted(a)\r\nprint(a[2]-a[0])", "n=list(input().split())\r\n\r\na=int(n[0])\r\nb=int(n[1])\r\nc=int(n[2])\r\n\r\narr=[int(a),int(b),int(c)]\r\n\r\nmax=max(arr)\r\nmin=min(arr)\r\n\r\nif a > b:\r\n if a < c:\r\n median = a\r\n elif b > c:\r\n median = b\r\n else:\r\n median = c\r\nelse:\r\n if a > c:\r\n median = a\r\n elif b < c:\r\n median = b\r\n else:\r\n median = c\r\n\r\nprint((max-median)+(median-min))\r\n\r\n\r\n\r\n", "# x = input().split()\r\n# x.sort()\r\n# x = abs(int(x[0])-int(x[1]))+abs(int(x[2])-int(x[1]))\r\n# print(x)\r\nx1, x2, x3 = map(int, input().split())\r\ncoordinates = [x1, x2, x3]\r\n\r\n# Сортируем координаты\r\ncoordinates.sort()\r\n\r\n# Находим медиану\r\nmedian = coordinates[1]\r\n\r\n# Вычисляем суммарное расстояние\r\ntotal_distance = abs(x1 - median) + abs(x2 - median) + abs(x3 - median)\r\n\r\nprint(total_distance)\r\n", "a, b, c = map(int, input().split())\r\nd = [a,b,c]\r\nd.sort()\r\nprint(d[-1]-d[0])", "coordinates = [int(i) for i in input().split()]\n\nprint(max(max(coordinates[0], coordinates[1]), coordinates[2]) - min(min(coordinates[0], coordinates[1]), coordinates[2]))\n", "\r\nstr1 = input()\r\nlst = str1.split()\r\n#print(lst)\r\nlst2=[]\r\nfor i in lst :\r\n i = int(i)\r\n lst2.append(int(i))\r\n#print(lst2)\r\nma = max(lst2)\r\nmi = min(lst2)\r\nprint(ma-mi)\r\n", "a,b,c = map(int, input().split())\r\nm_val = min(a,b,c)\r\nx_val = max(a,b,c)\r\nres = x_val- m_val\r\nprint(res)", "a,b,c=map(int,input().split())\r\nmid = (a+b+c)-min(a,b,c)-max(a,b,c)\r\nprint(int((((min(a,b,c)-mid)**2))**0.5+((max(a,b,c)-mid)**2)**0.5))", "x,y,z=input().split()\r\nx,y,z=int(x),int(y),int(z)\r\na=[x,y,z]\r\na.sort()\r\nv=a[1]\r\nc=abs(x-v)+abs(y-v)+abs(z-v)\r\nprint(c)", "#New Year Friends\r\n\r\nFriends_distance = [int(x) for x in input().split()]\r\n\r\nShortest_distance = 0\r\ntemp = 0\r\nfor k in range(len(Friends_distance)):\r\n\tfor l in range(k+1,len(Friends_distance)):\r\n\t\t\r\n\t\tif(Friends_distance[k] > Friends_distance[l]):\r\n\r\n\t\t\ttemp = Friends_distance[k]\r\n\t\t\tFriends_distance[k] = Friends_distance[l]\r\n\t\t\tFriends_distance[l] = temp\r\n\r\nShortest_distance = abs(Friends_distance[1] - Friends_distance[0]) + abs(Friends_distance[1] - Friends_distance[2])\r\n\r\nprint(Shortest_distance)\r\n\r\n", "a=list(map(int, input().split()))\r\na.sort()\r\nc=a[1]-a[0]\r\nd=a[2]-a[1]\r\nprint(c+d)\r\n", "x,y,z=map(int,input().split())\r\ns=[x,y,z]\r\ns.sort()\r\nm=(s[-1]-s[1])\r\nq=(s[1]-s[0])\r\nprint(m+q)\r\n\r\n\r\n", "points=sorted(list(map(int,input().split())))\r\nd=sum(points)//3\r\nprint((d-points[0])+(points[2]-d))", "a = list(map(int,input().split()))\na.sort()\nx = a[1]\nprint((abs(a[2]-x))+(abs(a[0]-x)))", "a,b,c=map(int,input().split())\r\nx = max(a,b,c)\r\ny = min(a,b,c)\r\nz=a+b+c-x-y\r\nprint(abs(x-z)+abs(y-z))", "n = input()\nnums = list(map(eval, n.split()))\n\nnums.sort()\n\nfirst = nums[0]\nsecond = nums[1]\nthird = nums[2]\n\nresult = (second - first) + (third - second)\n\nprint(result)\n\n\n\n\n\n\n\n\t\t\t \t\t \t \t\t \t\t \t \t \t\t \t \t", "l = sorted(list(map(int, input().split())))\r\na = max(l)-l[1]\r\nb = l[1]-min(l)\r\nprint(a+b)", "a,b,c = input().split()\r\na,b,c = sorted([int(a), int(b), int(c)])\r\ns = abs(a-b)+abs(c-b)\r\nprint(s)", "import sys\r\na,b,c = map(int,sys.stdin.readline().split())\r\nmn = min(a,min(b,c))\r\nmx = max(a,max(b,c))\r\nres = mx-mn\r\nprint(res)", "l=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[2]-l[1]+l[1]-l[0])", "locations = input().split(' ')\nlocations = [int(loc) for loc in locations]\nlocations_2 = sorted(locations)\nmeet_point = locations_2[1]\ntotal_length = 0\nfor loc in locations:\n total_length += abs(loc - meet_point)\nprint(total_length)\n\t \t\t \t\t \t\t\t \t\t \t \t \t\t \t \t\t", "a,b,c = map(int, input().split())\r\nM = max(a,b,c)\r\nm = min(a,b,c)\r\n \r\nprint(M-m)", "a,b,c = map(int, input().split())\r\ns=sorted([a,b,c])\r\nminn=s[2]-s[0]\r\nprint(minn)\r\n\r\n\r\n", "a,b,c = sorted(list(map(int,input().split(' '))))\r\nprint((c-b)+(b-a))", "llist = list(map(int, input().split()))\r\na = abs(llist[1] - llist[0]) + abs(llist[0] - llist[2])\r\nb = abs(llist[1] - llist[0]) + abs(llist[1] - llist[2])\r\nc = abs(llist[2] - llist[0]) + abs(llist[1] - llist[2])\r\nprint(min(a, min(b, c)))\r\n\r\n", "x=input()\r\nlst=x.split()\r\nx1=int(lst[0]) \r\nx2=int(lst[1]) \r\nx3=int(lst[2])\r\nprint(max(x1,x2,x3)-min(x1,x2,x3)) ", "m=list(map(int, input().split()))\r\nm.sort()\r\nx=m[0]-m[1]\r\ny=m[1]-m[2]\r\nprint(abs(y+x))", "a,b,c = map(int,input().split())\r\nres = [abs(b-a)+abs(a-c), abs(a-b)+abs(b-c), abs(b-c)+abs(c-a)]\r\nprint(min(res))\r\n \r\n", "x1, x2, x3 = sorted(map(int, input().split()))\r\n\r\n# Calculate the minimum total distance\r\ndistance = x3 - x1\r\n\r\nprint(distance)\r\n", "# Read input\np1, p2, p3 = map(int, input().split())\n\n# Find the final power of the strongest monster\nfpower = max(p1, p2, p3) - min(p1, p2, p3)\n\n# Print the final power\nprint(fpower)\n \t \t \t\t \t \t\t\t\t\t\t\t\t \t\t\t", "a,b,c=input().split()\r\nif (int(a)<int(b)<int(c)):\r\n print(int (c)- int (a))\r\nelif (int(a)<int(c)<int(b)):\r\n print(int (b)- int (a))\r\nelif (int(c)<int(a)<int(b)):\r\n print(int (b)- int (c))\r\nelif (int(c)<int(b)<int(a)):\r\n print(int (a)- int (c))\r\nelif (int(b)<int(a)<int(c)):\r\n print(int (c)- int (b))\r\nelse:\r\n print(int (a)- int (b))", "l = list(map(int,input().split()))\r\nl.sort()\r\nans =(l[1]-l[0])+(l[2]-l[1])\r\nprint(ans)", "import sys\r\nnum = sys.stdin.readline().strip().split()\r\nnum1 = map(int, num)\r\nmp = list(num1)\r\nsrt = sorted(mp)\r\ncounter = 0\r\none = srt[0]\r\nscnd = srt[2]\r\nwhile one < srt[1]:\r\n one += 1\r\n counter += 1\r\nwhile scnd > srt[1]:\r\n scnd -= 1\r\n counter += 1\r\nprint(counter)", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the coordinates to find the median\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\n\r\n# Calculate the minimum total distance\r\nmin_distance = coordinates[2] - coordinates[0]\r\n\r\nprint(min_distance)", "import statistics\r\ndef distance(points):\r\n d = 0\r\n for n in points:\r\n if n != statistics.median(points):\r\n if n > statistics.median(points):\r\n d += n - statistics.median(points)\r\n else:\r\n d += statistics.median(points) - n\r\n return d\r\n\r\nprint(distance([int(n) for n in input().split()]))", "v2=list(map(int,input().split()))\r\nprint(max(v2)-min(v2))", "*values, = map(int, input().split())\r\nprint(max(values) - min(values))\r\n", "x,y,z = map(int,input().split())\r\n\r\nif x<=y<=z or z<=y<=x:\r\n print(abs(y-z) + abs(y-x))\r\n \r\nelif y<=x<=z or z<=x<=y:\r\n print(abs(x-z) + abs(y-x))\r\nelse:\r\n print(abs(y-z) + abs(z-x))\r\n \r\n", "a, b, c = [int(i) for i in input().split()]\r\nv = []\r\nv.append(a)\r\nv.append(b)\r\nv.append(c)\r\nv.sort()\r\na, b, c = [int(i) for i in v]\r\nprint(c - a)", "def bubble_sort(arr):\r\n array_len = len(arr)\r\n for i in range(0, array_len - 1):\r\n is_sorted = True\r\n for j in range(0, array_len - 1):\r\n if arr[j] > arr[j + 1]:\r\n arr[j], arr[j + 1] = arr[j + 1], arr[j]\r\n is_sorted = False\r\n if is_sorted:\r\n break\r\n\r\n\r\nfriend_coordinate = list(map(int, input().split()))\r\nbubble_sort(friend_coordinate)\r\ndistance = (friend_coordinate[2]-friend_coordinate[1]) + (friend_coordinate[1] - friend_coordinate[0])\r\nprint(distance)", "arr = [int(ele) for ele in input().split()]\r\n\r\narr.sort()\r\nval = arr[1]\r\nans = (val - arr[0]) + (arr[2]-val)\r\nprint(ans)", "s = input().split()\r\na, b, c = int(s[0]), int(s[1]), int(s[2])\r\nprint(max(a, b, c) - min(a, b, c))", "n=list(map(int,input().split()))\r\nsumm=0\r\nmini=min(n)\r\nmaxi=max(n)\r\nfor i in range(len(n)):\r\n if(n[i]!=mini and n[i]!=maxi):\r\n m=n[i]\r\nsumm=(m-mini)+(maxi-m)\r\nprint(summ)", "\r\na, b, c = map(int, input().split())\r\nmin_value = min(a, b, c)\r\nmax_value = max(a, b, c)\r\nprint(max_value - min_value)\r\n", "li=list(map(int,input().split()))\nfor i in range(len(li)):\n li=sorted(li)\n s1=abs((li[1]-li[0]))\n s2=abs((li[1]-li[-1]))\n s=s1+s2\nprint(s)\n\t\t \t \t\t\t\t \t \t\t \t \t\t\t\t\t \t\t \t", "# n = int(input())\n# for i in range(n):\n# b = list(map(int, input(). split()))\n# for i in range(len(b)-1):\n# for j in range(len(b) - 1 - i):\n# if b[j] > b[j+1]:\n# b[j], b[j +1] = b[j+1], b[j]\n# print(b[1])\n\n# n = int(input())\n# s = input()\n#\n# z = s.count('z')\n# one = s.count('n')\n# print('1 '* one + '0 '* z)\n\n\na = list(map(int, input().split()))\nprint(max(a)- min(a))\n", "x1, x2, x3 = map(int, input().split())\r\ncoordinates = [x1, x2, x3] \r\ncoordinates.sort()\r\nmidpoint = coordinates[1]\r\ndistance = abs(x1 - midpoint) + abs(x2 - midpoint) + abs(x3 - midpoint)\r\nprint(distance)", "a = sorted([int(j) for j in input().split()])\r\nprint(abs(a[1] - a[2]) + abs(a[1] - a[0]))\r\n", "a=[int(x) for x in input().split()]\r\na.sort()\r\nprint((a[2]-a[1]) + (a[1]-a[0]))", "# 코드포스 723A The New Year: Meeting Friends\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nx1, x2, x3 = map(int, put().split())\r\nx = sorted([x1, x2, x3])[1]\r\n\r\nprint(abs(x1 - x) + abs(x2 - x) + abs(x3 - x))", "x1,x2,x3 = map(int,input().split())\nd1 = abs(x1-x2)\nd2 = abs(x1-x3)\nd3 = abs(x2-x3)\nt = min(d1+d2,d1+d3,d2+d3) \nprint(t)", "x1, x2, x3 = map(int, input().split()) \r\n\r\n# sorting the list \r\n# in decreasing order \r\np = [x1, x2, x3] \r\np.sort(reverse = True) \r\n\r\n# result \r\nprint(abs(p[0] - p[1]) + abs((p[1] - p[2])))", "x1,x2,x3=map(int,input().split())\r\nl=[x1,x2,x3]\r\nl.sort()\r\nprint(abs(l[0]-l[1])+abs(l[2]-l[1]))", "numeros = input()\r\na, b, c = [int(x) for x in numeros.split(\" \")]\r\n\r\ndef calc(a,b,c):\r\n return (abs(a-b)+abs(b-c))\r\n\r\nlista = [calc(a,b,c), calc(b,a,c), calc(a,c,b)]\r\nlista.sort()\r\nprint(lista[0])", "ll=(list(map(int,input().split(' '))))\r\nll.sort()\r\nprint(ll[2]-ll[0])", "a = [int(s) for s in input().split()]\r\nres = 0 \r\na.sort()\r\nres += a[2] - a[0]\r\nprint(res)", "myList = list(map(int , input().split()))\r\nmyList.sort()\r\nprint(-myList[0]+myList[2])", "liste=list(map(int,input().split()))\r\ndifference=abs(liste[1]-liste[2])+abs(liste[0]-liste[2])\r\nif abs(liste[1]-liste[2])>abs(liste[0]-liste[1]) and abs(liste[1]-liste[2])>abs(liste[0]-liste[2]):\r\n difference=abs(liste[0]-liste[1])+abs(liste[0]-liste[2])\r\n\r\nelif abs(liste[0]-liste[2])>abs(liste[0]-liste[1]) and abs(liste[0]-liste[2])>abs(liste[1]-liste[2]):\r\n difference=abs(liste[1]-liste[2])+abs(liste[0]-liste[1])\r\nprint(difference)", "a, b, c = map(int, input().split())\r\n\r\nm = max(a, b, c)\r\nn = min(a, b, c)\r\n\r\nprint(m - n)\r\n", "a = list(map(int, input().split()))\r\na.sort()\r\nprint(abs(a[0] - a[1]) + abs(a[2] - a[1]))", "# Read input\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Calculate the minimum total distance\r\nsorted_coords = sorted([x1, x2, x3]) # sorted_coords = [1, 4, 7]\r\n\r\n# Calculate the minimum total distance\r\ntotal_distance = sorted_coords[2] - sorted_coords[0] # total_distance = 7 - 1 = 6\r\n\r\n# Print the result\r\nprint(total_distance) # Output: 6\r\n", "l = list(map(int, input().split()))\r\nl.sort()\r\nsum = 0 \r\nfor i in range(len(l) - 1):\r\n sum = sum + l[i+1] - l[i]\r\nprint(sum)", "a=list(map(int,input().strip().split()))[:3]\r\na.sort()\r\nsum=0\r\nsum+=a[1]-a[0]+a[2]-a[1]\r\nprint(sum)", "li= list(map(int,input().split()))\r\nli.sort()\r\nprint((li[2]-li[1])+(li[1]-li[0]))", "l=sorted(list(map(int,input().split())))\r\nx=l[1]-l[0]\r\ny=l[2]-l[1]\r\nprint(x+y)\r\n", "n = list(map(int,input().split()))\r\nn = sorted(n)\r\ntotal = 0\r\ntotal += abs(n[0]-n[1])\r\ntotal += abs(n[1] - n[2])\r\nprint(total)", "k,n,w=map(int,input().split())\r\nmax=max(k,n,w)\r\nmin=min(k,n,w)\r\nprint(max-min)", "a, b, c = map(int, input().split())\r\nf1 = min(a, b, c)\r\nf2 = max(a, b, c)\r\nf3 = (a+b+c)-(f1 + f2)\r\nprint((f2 - f3) + (f3 - f1))", "x = list(map(int,input().split()))\r\nx.sort()\r\nr = x[1] - x[0] + x[2] - x[1]\r\nprint(r)", "#https://codeforces.com/problemset/problem/723/A\r\n\r\nhouse_coordinate = [int(x) for x in input().split(\" \")]\r\nhouse_coordinate.sort()\r\nprint(abs(house_coordinate[1] - house_coordinate[2]) + abs(house_coordinate[1] - house_coordinate[0]) )", "a, b, c = map(int, input().split())\r\nx = [a, b, c]\r\nx.sort()\r\nprint(x[2] - x[0])", "x1, x2, x3 = map(int, input().split())\r\nprint(max(x1, x2, x3) - min(x1, x2, x3))", "a,b,c=map(int,input().split())\r\nif a>b and a>c:\r\n max=a\r\n if b>c:\r\n min=c\r\n else:\r\n min=b\r\nelif b>c and b>a:\r\n max=b\r\n if a>c:\r\n min=c\r\n else:\r\n min=a\r\nelse:\r\n max=c\r\n if b>a:\r\n min=a\r\n else:\r\n min=b\r\nprint(max-min)", "l1=list(map(int,input().strip().split()))\r\nl1.sort()\r\nv1=l1[1]-l1[0]\r\nv2=l1[2]-l1[1]\r\nans=v1+v2\r\nprint(ans)\r\n", "inp = input().split(); x1, x2, x3= int(inp[0]), int(inp[1]), int(inp[2])\nmin, max = min(x1,x2,x3), max(x1,x2,x3)\nt = 101\nfor i in range(min, max+1):\n if abs(x1-i)+abs(x2-i)+abs(x3-i)<t:\n t = abs(x1-i)+abs(x2-i)+abs(x3-i)\nprint(t)\n", "mas = [int(el) for el in input().split()]\r\nprint(max(mas)-min(mas))", "a,b,c=map(int,input().split())\r\nl=[]\r\nl.append(a)\r\nl.append(b)\r\nl.append(c)\r\nmid=a+b+c-max(l)-min(l)\r\n\r\nc=(max(l)-mid)+(mid-min(l))\r\nprint(c)", "distance = sorted([int(i) for i in input().split()])\r\nprint((distance[1] - distance[0]) + (distance[2] - distance[1]))", "#Obtengo los puntos\nnumbers = list(map(int, input().split(\" \")))\n#Los ordeno de menor a mayor\nnumbers.sort()\n\n#Retorno los pasos para que los extremos puedan llegar al medio\nprint(numbers[1] - numbers[0] + numbers[2] - numbers[1])\n \t \t \t \t \t\t \t \t \t \t \t \t", "x1, x2, x3 = map(int, input().split())\r\n\r\ndistances = [abs(x1 - x2), abs(x1 - x3), abs(x2 - x3)]\r\nmin_distance = sum(distances) - max(distances)\r\n\r\nprint(min_distance)\r\n", "nums = [int(x) for x in input().split()]\n\nnums.sort()\n\nprint((nums[1] - nums[0]) + (nums[2] - nums[1])) \n\t \t \t\t\t \t \t\t\t\t\t \t\t \t\t \t", "a=list(map(int,input().split()))\r\na = sorted(a)\r\nresult = 0\r\nfor i in range(2):\r\n result += abs(a[i]-a[i+1])\r\nprint(result)", "def minimum_total_distance(x1, x2, x3):\r\n median = sorted([x1, x2, x3])[1] \r\n\r\n distance1 = abs(x1 - median) \r\n distance2 = abs(x2 - median)\r\n distance3 = abs(x3 - median) \r\n\r\n total_distance_median = distance1 + distance2 + distance3\r\n middle_point = (x2 + x3) // 2\r\n\r\n distance2_3 = abs(x3 - x2) \r\n\r\n distance1_2_3 = abs(x1 - middle_point) + distance2_3\r\n\r\n return min(total_distance_median, distance1_2_3)\r\n\r\nx1, x2, x3 = map(int, input().split())\r\nmin_distance = minimum_total_distance(x1, x2, x3)\r\nprint(min_distance)\r\n", "a,b,c = (int(i) for i in input().split())\r\nminm=10e5\r\nls=[a,b,c]\r\nls.sort()\r\nfor i in range(ls[0],ls[-1]+1):\r\n if abs(i-a) + abs(i-b) + abs(i-c) < minm:\r\n minm = abs(i-a) + abs(i-b) + abs(i-c)\r\nprint(minm)", "a = sorted(list(map(int,input().split())))\r\nprint(a[2]-a[0])", "x1,x2,x3=map(int,input().split())\r\nmax1=max(x1,x2,x3)\r\nmin1=min(x1,x2,x3)\r\nx=x1+x2+x3-min1-max1\r\n\r\nprint(abs(min1-x)+abs(max1-x))", "a,b,c=map(int,input().split())\r\np=min(a,b,c)\r\nq=max(a,b,c)\r\nprint(q-p)", "x_arr = [int(a) for a in input().split()]\r\nx_arr.sort()\r\nprint(x_arr[1] - x_arr[0] + x_arr[2] - x_arr[1])\r\n\r\n", "x1=list(map(int,input().split()))\r\nx1.sort()\r\na=x1[1]-x1[0]\r\nb=x1[2]-x1[1]\r\nprint(a+b)", "data = sorted(list(map(int, input().split())))\r\nprint(min([abs((data[1]-data[0])+(data[2]-data[0])), abs((data[1]-data[0])+(data[2]-data[1])), abs((data[2]-data[1])+(data[2]-data[0]))]))", "x1,x2,x3=map(int,input().split())\r\nmin_dist=200\r\nstart=min(x1,x2,x3)\r\nend=max(x1,x2,x3)\r\nfor loc in range(start,end+1):\r\n dist=abs(x1-loc)+abs(x2-loc)+abs(x3-loc)\r\n if dist<min_dist:\r\n min_dist=dist\r\n #print(min_dist)\r\nprint(min_dist)", "def main():\r\n friends = [int(i) for i in input().split()]\r\n distance = max(friends) - min(friends) \r\n print(distance)\r\n\r\nmain() \r\n\r\n", "x=list(map(int,input().split()))\r\nx.sort()\r\nb=x[1]\r\nprint(abs(b-x[0])+abs(b-x[2]))", "a=list(map(int,input().split()))\r\na.sort()\r\nt=0\r\nfor i in range(len(a)):\r\n t+=abs(a[i]-a[1])\r\nprint(t) ", "def meeting_point(x1, x2, x3):\r\n\r\n if (x1 > x2 and x2 > x3) or (x3 > x2 and x2 > x1):\r\n\r\n dis = abs(x1 - x2) + abs(x2 - x3)\r\n\r\n elif (x2 > x1 and x1 > x3) or (x3 > x1 and x1 > x2):\r\n\r\n dis = abs(x2 - x1) + abs(x1 - x3)\r\n\r\n elif (x1 > x3 and x3 > x2) or (x2 > x3 and x3 > x1):\r\n\r\n dis = abs(x1 - x3) + abs(x2 - x3)\r\n\r\n return dis\r\n\r\nx1, x2, x3 = map(int, input().split())\r\n\r\nprint(meeting_point(x1, x2, x3))", "x,y,z=map(int,input().split())\r\np=max(x,max(y,z))\r\nq=min(x,min(y,z))\r\nprint(p-q)", "*o,=map(int,input().split());print(max(o)-min(o))\r\n", "n,m,s=map(int,input().split())\r\nsum=0\r\nif n>=s and n<m:\r\n sum+=n-s\r\n sum+=m-n\r\nelif n>=m and n<=s:\r\n sum+=n-m\r\n sum+=s-n\r\nelif m>=s and m<=n:\r\n sum+=m-s\r\n sum+=n-m\r\nelif m<=s and m>=n:\r\n sum+=m-n\r\n sum+=s-m\r\nelif s>=m and m<=s:\r\n sum+=s-m\r\n sum+=n-s\r\nelse:\r\n sum+=s-n\r\n sum+=m-s\r\nprint(sum)", "friends = list(map(int,input().split()))\r\nfriends.sort()\r\nprint((friends[2] - friends[1]) + (friends[1] - friends[0]))", "numbers = list(map(int, input().split()))\r\nnumbers.sort()\r\ntotal = (numbers[2] - numbers[1]) + (numbers[1] - numbers[0])\r\nprint(total)", "x,y,z=map(int,input().split())\r\nm=max(x,y,z)\r\nmm=min(x,y,z)\r\nmmm=(x+y+z)-m-mm\r\nprint((m-mmm)+(mmm-mm))", "a=list(map(int,input().split()))\r\na.sort()\r\nx=a[1]\r\nprint(abs(x-a[0])+abs(x-a[1])+abs(x-a[2]))", "tc = list(map(int,input().split()))\r\ntc.sort()\r\nprint(tc[2]-tc[0])", "n = list(map(int, input().split(\" \")))\r\nn.sort()\r\nprint(n[len(n)-1] - n[0])\r\n", "m1, m2, m3 = map(int, input().split())\r\n\r\ndistance_1_2 = abs(m1 - m2)\r\ndistance_1_3 = abs(m1 - m3)\r\ndistance_2_3 = abs(m2 - m3)\r\n\r\nmin_total_distance = min(distance_1_2 + distance_2_3, distance_1_3 + distance_2_3, distance_1_2 + distance_1_3)\r\n\r\nprint(min_total_distance)\r\n", "arr=list(map(int,input().split()))\r\narr=sorted(arr)\r\nprint(arr[2]-arr[0])", "a,b,c=map(int,input().split())\r\nx=abs(a-b)\r\ny=abs(b-c)\r\nz=abs(c-a)\r\nprint(max(x,y,z))", "l=sorted(list(map(int,input().split())))\r\nprint(l[1]-l[0]+l[2]-l[1])", "def solve():\r\n a,b,c=[int(i) for i in input().split()]\r\n i=max(a,b,c)\r\n j=min(a,b,c)\r\n x=a+b+c-i-j\r\n print(i-x+x-j)\r\n \r\nsolve() ", "n=list(map(int,input().split()))\nn.sort()\nprint(n[2]-n[0])\n \t \t\t \t \t \t \t \t\t \t\t\t \t", "s=list(map(int,input().split()))\r\nmin_s=min(s)\r\nmax_s=max(s)\r\ni1=s.index(min_s)\r\ns1=s.pop(i1)\r\ni2=s.index(max_s)\r\ns2=s.pop(i2)\r\ns3=s.pop()\r\nr1=s3 - s1\r\nr2=s2 - s3\r\nprint(r1+r2)\r\n\r\n\r\n\r\n\r\n", "import math\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n# for _ in range(int(input())):\r\nlst = [int(i) for i in input().split()]\r\nlst.sort()\r\n\r\nprint(lst[2] - lst[0])\r\n \r\n\r\n", "x1, x2, x3 = map(int, input().split())\r\npoints = sorted([x1,x2,x3])\r\nprint((points[2]-points[1])+(points[1]-points[0]))\r\n", "n= list(map(int,input().split()));print(max(n) - min(n))", "a=list(map(int,input().split()))\r\na=sorted(a)\r\nprint(a[2]-a[0])", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Oct 5 11:28:10 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\n\nnum=list(map(int,input().split()))\nnum.sort()\nd=num[2]-num[0]\nprint(d)", "x1, x2, x3 = sorted(map(int,input().split()))\r\nprint(x3-x1)\r\n", "x = lambda n:[int(i) for i in input().split()]\ny = x(3)\ny.sort()\nprint(y[-1]- y[0])\n\t\t \t \t \t\t\t \t\t \t\t \t \t\t\t", "numbers = list(map(eval, input().split()))\r\nnumbers.sort()\r\n\r\nresult = numbers[1] - numbers[0] + numbers[2] - numbers[1]\r\n\r\nprint(result)", "\r\nx1, x2, x3 = map(int, input().split())\r\nmin_coord = min(x1, x2, x3)\r\nmax_coord = max(x1, x2, x3)\r\n\r\ntotal_distance = max_coord - min_coord\r\n\r\nprint(total_distance)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n # 1 2 3 -> [1, 2, 3]\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n # abc -> [\"a\", \"b\", \"c\"]\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# Definitions\r\n\r\ndef output_list(l):\r\n print(\" \".join(list(map(str, l))))\r\n\r\nclass Node:\r\n def __init__(self, i, next):\r\n self.i = i\r\n self.next = next\r\n def __str__(self):\r\n return str(self.i)\r\n\r\n\r\ndef test_case(x1, x2, x3):\r\n arr = [x1, x2, x3]\r\n arr.sort()\r\n\r\n print(arr[1]-arr[0] + arr[2]-arr[1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n x1, x2, x3 = inlt()\r\n\r\n test_case(x1, x2, x3)\r\n", "X1, X2, X3 = 0, 0, 0\r\n\r\ndef main():\r\n global X1, X2, X3\r\n X1, X2, X3 = map(int, input().split())\r\n minimum = 100000\r\n for i in range(min(X1, X2, X3), max(X1, X2, X3)):\r\n if minimum > getDistance(i):\r\n minimum = getDistance(i)\r\n print(minimum)\r\n\r\ndef getDistance(n):\r\n return abs(n - X1) + abs(n - X2) + abs(n - X3)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=list(map(int,input().split()))\r\na.sort()\r\nd=a[1]\r\nprint(abs(d-a[0])+abs(d-a[2]))", "a,b,c=map(int,input().split())\r\nk1=abs(a-b)+abs(a-c)\r\nk2=abs(b-a)+abs(b-c)\r\nk3=abs(c-a)+abs(c-b)\r\nl=[]\r\nl.append([k1,k2,k3])\r\nprint(min(l[0]))\r\n", "i=input().split(\" \")\r\na=[]\r\nfor j in range(3):\r\n a.append(int(i[j]))\r\na.sort()\r\nx=a[1]-a[0]\r\ny=a[2]-a[1]\r\nprint(x+y)", "*KP,=map(int,input().split());print(max(KP)-min(KP))\n\t \t \t\t \t \t\t \t \t \t \t \t\t", "\"\"\"Новый год: встреча друзей\"\"\"\r\n\r\n\r\ndef main():\r\n lst = [int(i) for i in input().split()]\r\n c_max = lst.pop(lst.index(max(lst)))\r\n c_min = lst.pop(lst.index(min(lst)))\r\n c_middle = lst[0]\r\n rez = abs(c_middle - c_max) + abs(c_middle - c_min)\r\n print(rez)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a,b,c = sorted(list(map(int, input().split())))\r\nprint(c-a)", "ls=list(map(int,input().split()))\r\nls.sort()\r\nx=(ls[1]-ls[0])+(ls[2]-ls[1])\r\nprint(x)\r\n", "n,k,m=map(int,input().split())\r\nprint(max(n,k,m)-min(n,k,m))", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Calculate the distance between the two outermost points\r\ndistance = max(x1, x2, x3) - min(x1, x2, x3)\r\n\r\nprint(distance)\r\n", "d = list(sorted(list(map(int, input().split()))))\r\nprint((d[1]-d[0])+(d[2]-d[1]))", "n = [int(i) for i in input().split()]\r\nn = sorted(n)\r\nprint(n[2] - n[0])", "from math import *\r\na=list(map(int,input().split(' ')))\r\nmx=max(a)\r\nmn=min(a)\r\nprint(mx-mn)", "a,b,c=map(int,input().split())\r\nx=max(a,max(b,c))\r\ny=min(a,min(b,c))\r\nprint(x-y)", "n = list(input().split(\" \"))\r\nn = [int(i) for i in n]\r\nmin_p = 1000\r\nn.sort()\r\n\r\nfor j in range(n[0], n[2]+1):\r\n a = abs(n[0] - j) + abs(n[1] - j) + abs(n[2] - j)\r\n if min_p > a:\r\n min_p = a\r\n \r\nprint(min_p)", "a1 , a2 , a3 = map(int,input().split())\r\nx = (a1+a2+a3)-max(a1,a2,a3)-min(a1,a2,a3) \r\nprint((x-min(a1,a2,a3)) + (max(a1,a2,a3)-x))", "a,b,c=map(int,input().split())\r\nres=max(a, max(b,c))-min(a, min(b,c))\r\nprint(res)", "coordinates = [int(num) for num in input().split()]\r\ncoordinates.sort()\r\ni = coordinates[0]\r\nclosestDistance = 100\r\nwhile i < coordinates[2]:\r\n distance = abs(coordinates[0] - i) + abs(coordinates[1] - i) + abs(coordinates[2] - i)\r\n if distance < closestDistance:\r\n closestDistance = distance * 1\r\n i += 1\r\nprint(closestDistance)", "# Read the input\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Calculate the minimum total distance\r\nmin_distance = min(abs(x2 - x1) + abs(x3 - x1), abs(x3 - x2) + abs(x2 - x1), abs(x2 - x3) + abs(x3 - x1))\r\n\r\n# Print the result\r\nprint(min_distance)\r\n", "a,b,c=map(int,input().split())\r\nx=max(a,b,c)\r\ny=min(a,b,c)\r\nprint(x-y)", "x = list(map(int, input().split(' ')))\r\nprint (max(x) - min(x))", "arr=list(map(int,input().split()))\r\narr.sort()\r\nd=0\r\nfor i in range(3):\r\n d=d+abs(arr[1]-arr[i]);\r\nprint(d) ", "lst = list(map(int, input().split()))\r\n\r\nlst.sort()\r\n\r\nprint(lst[1] - lst[0] + lst[2] - lst[1])", "points = list(map(int, input().split()))\n\npoints.sort()\ntotal = (points[1] - points[0]) + (points[2] - points[1])\nprint(total)\n\t \t\t\t \t\t\t\t\t\t\t\t \t \t\t \t\t \t \t \t\t", "x=input()\r\narr=x.split(\" \")\r\nfor i in range(len(arr)):\r\n arr[i]=int(arr[i])\r\narr.sort()\r\nprint((int(arr[1])-int(arr[0])) + (int(arr[2])-int(arr[1])))", "x = list(map(int,input().split()))\r\nx.sort()\r\ncount=0\r\nfor i in range(x[0],x[1]):\r\n count+=1\r\nfor j in range(x[1],x[2]):\r\n count+=1\r\n\r\nprint(count)\r\n\r\n", "import statistics\r\ndef distance(points):\r\n middle = statistics.median(points)\r\n d = 0\r\n for n in points:\r\n if n != middle:\r\n if n > middle:\r\n d += n - middle\r\n else:\r\n d += middle - n\r\n return d\r\n\r\nprint(distance([int(n) for n in input().split()]))", "lst = sorted(list(map(int, input().split())))\r\nprint((lst[2] - lst[1])+(lst[1]-lst[0]))", "a, b, c = map(int, input().split())\r\nres = 100000\r\nfor i in range(0,101):\r\n res = min(res, abs(a-i)+abs(b-i)+abs(c-i))\r\nprint(res)", "x,y,z = map(int,input().split())\r\na = min(x,y,z)\r\nb = max(x,y,z)\r\nprint(b-a)", "linha = input().split()\r\n\r\nnums = [int(e) for e in linha]\r\nnums.sort()\r\na, b, c = nums[0], nums[1], nums[2]\r\n\r\npontoa = b-a + c-a\r\npontob = b-a + c-b\r\npontoc = c-b + c-a\r\n\r\nprint(min(pontoa, pontob, pontoc))\r\n", "a,b,c=sorted(list(map(int,input().split())))\r\nprint(c-a)", "a,b,c=sorted(map(int,input().split()))\r\nprint(c-a)\r\n", "# https://codeforces.com/problemset/problem/723/A\r\n\r\npositions_list = list(map(int, input().split()))\r\npositions_list.sort()\r\n\r\nsteps = (abs(positions_list[0] - positions_list[1])) + abs((positions_list[2] - positions_list[1]))\r\n\r\nprint(steps)", "x1,x2,x3=map(int,input().split(' '))\r\nlst=[x1,x2,x3]\r\nlst.sort()\r\nans=(lst[2]-lst[1])+(lst[1]-lst[0])\r\nprint(ans)", "n = input()\r\nn = [int(i) for i in n.split(\" \")]\r\nn = sorted(n)\r\na, b, c = int(n[0]), int(n[1]), int(n[2])\r\n\r\nmini = 0\r\nminis = abs((a-a))+abs((b-a))+abs((c-a))\r\n\r\nfor i in range(a+1, c+1):\r\n s=abs((a-i))+abs((b-i))+abs((c-i))\r\n if s<minis:\r\n minis=abs((a-i))+abs((b-i))+abs((c-i))\r\n mini=i\r\nprint(minis)\r\n", "a = list(map(int, input().split()))\n\nres = []\nfor i in range(len(a)):\n t = 0\n for j in range(len(a)):\n if i != j:\n t += abs(a[j] - a[i])\n res.append(t)\n\nprint(min(res))\n", "n = 3\r\na = input().split()\r\na_list = []\r\nfor i in a:\r\n a_list.append(int(i))\r\nprint(max(a_list)-min(a_list))", "a,b,c=map(int,input().split())\r\nmn= min(a,min(b,c))\r\nmx = max(a, max(b,c))\r\nprint(mx-mn);", "s = [int(i) for i in input().split()]\r\nx1 = abs(s[0] - s[1])\r\nx2 = abs(s[0] - s[2])\r\nx3 = abs(s[1] - s[2])\r\n\r\nsum_x1 = x1 + x2\r\nsum_x2 = x1 + x3\r\nsum_x3 = x2 + x3\r\n\r\nx = 1000\r\nt = min(x, sum_x1,sum_x2,sum_x3)\r\nprint(t)", "a, b, c = input().split()\r\nlist = [a, b, c]\r\nlist = [int(x) for x in list]\r\nsred = max(list) - min(list)\r\nprint(sred)", "l=list(input().split())\nfor i in range(3):\n\tl[i]=int(l[i])\nl=sorted(l)\nx1,x2,x3=l[0],l[1],l[2]\nprint((x2-x1)+(x3-x2))\n\n", "x1, x2, x3 = map(int, input().split())\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\nmin_total_distance = coordinates[2] - coordinates[0]\r\nprint(min_total_distance)", "a,b,c = tuple(map(int,input().split()))\r\nans = abs(a-1) + abs(b-1) + abs(c-1)\r\nfor i in range(1,101):\r\n temp = abs(a-i) + abs(b-i) + abs(c-i)\r\n if(ans > temp):\r\n ans = temp\r\nprint(ans)", "friends = list(map(int, input() .split()))\r\nfriends.sort()\r\ndistance = (friends[1] - friends[0]) + (friends[-1] - friends[1])\r\nprint(distance)", "# Read input\np1, p2, p3 = map(int, input().split())\n\n# Find the final power of the strongest monster\nfinal_power = max(p1, p2, p3) - min(p1, p2, p3)\n\n# Print the final power\nprint(final_power)\n \t \t\t\t \t \t \t\t\t\t\t\t\t \t \t \t \t", "\r\nd = [int(x) for x in input().split()]\r\nd.sort()\r\nprint(d[2]-d[1]+d[1]-d[0])\r\n", "# s = input().split(\"+\")\r\n# a = list(map(int, s))\r\n# g = len(a)\r\n# for i in range(g - 1):\r\n# for j in range(g - 1 - i):\r\n# if a[j] > a[j + 1]:\r\n# a[j], a[j+ 1] = a[j + 1], a[j]\r\n# print(*a, sep=\"+\")\r\n\r\n# t = int(input())\r\n# for i in range(t):\r\n# a = input().split()\r\n# b = list(map(int, a))\r\n# g = len(b)\r\n# for l in range(g - 1):\r\n# for j in range(g - 1 - l):\r\n# if b[j] > b[j + 1]:\r\n# b[j], b[j+ 1] = b[j + 1], b[j]\r\n# print(b[1])\r\n\r\n# a = int(input())\r\n# b = input()\r\n# z = b.count(\"z\")\r\n# n = b.count(\"n\")\r\n# print(\"1 \" * n + \"0 \" * z)\r\n\r\na = input().split()\r\ns = list(map(int, a))\r\nf = max(s)\r\nf1 = min(s)\r\nprint(f - f1)", "\r\na,b,c=map(int,input().split())\r\nsum = max(a,b,c)-min(a,b,c)\r\nprint(sum)", "a, b, c = map(int, input().strip().split(' '))\r\n\r\nmid = sorted([a, b, c])[1]\r\n\r\nprint(abs(a - mid) + abs(b - mid) + abs(c - mid))", "p=list(map(int,input().split()))\r\np.sort()\r\nprint(p[2]-p[1]+p[1]-p[0])", "F = list(map(int,input().split()))\r\nF.sort()\r\nprint((F[1]-F[0]) + (F[2]-F[1]))", "x1, x2, x3 = map(int, input().split())\n\n\npath1 = abs(x1 - x2) + abs(x1 - x3)\npath2 = abs(x2 - x1) + abs(x2 - x3)\npath3 = abs(x3 - x2) + abs(x3 - x1)\n\nprint(min(path1, path3, path2))\n\n\n# Fri Jul 07 2023 11:29:25 GMT+0300 (Moscow Standard Time)\n", "c = list(map(int, input().split()))\r\nprint(max(c) - min(c))\r\n", "#The new year: Meeting Friends\r\nl = list (map(int,input().split()))\r\nl1 = []\r\na = 0\r\nl.sort()\r\nfor i in range(len(l)):\r\n for j in range(1, len(l)-1):\r\n a += abs(l[i]-l[j])\r\n l1.append(a)\r\nprint(max(l1))", "a,b,c = sorted(list(map(int,input().split())))\r\nprint(c-a)", "a,b,c = map(int,input().split())\r\nli = [a,b,c]\r\nli.sort()\r\nsecond_largest = li[1]\r\ntotal_distance = abs(a-second_largest) + abs(b-second_largest) + abs(c-second_largest)\r\nprint(total_distance)", "a, b, c = sorted(list(map(int, input().split(' '))))\r\nprint(b-a + c-b)", "arr=list(map(int,input().split()))\nl=max(arr)\ns=min(arr)\nfor num in arr:\n if num!=l and num!=s:\n m=num\nprint((l-m)+(m-s))\n", "a,b,c=map(int, input().split())\r\n\r\nx=min(a,b,c)\r\n\r\ny=max(a,b,c)\r\n\r\nprint(y-x)\r\n", "im = input().split()\r\nim.sort()\r\ninti = [int(x) for x in im]\r\nlen = 0\r\nfor i in inti:\r\n if i != max(inti) and i != min(inti):\r\n len = i\r\nprint((max(inti) - len) + (len - min(inti)))", "x=list(map(int,input().split()))\r\nm=[]\r\na=x[0]-x[1]\r\nb=x[0]-x[2]\r\nif a<0:\r\n a*=-1\r\nif b<0:\r\n b*=-1\r\nq=a+b\r\nm.append(q)\r\na=x[1]-x[0]\r\nb=x[1]-x[2]\r\nif a<0:\r\n a*=-1\r\nif b<0:\r\n b*=-1\r\no=a+b\r\nm.append(o)\r\na=x[2]-x[0]\r\nb=x[2]-x[1]\r\nif a<0:\r\n a*=-1\r\nif b<0:\r\n b*=-1\r\nw=a+b\r\nm.append(w)\r\nprint(min(m)) \r\n \r\n", "x=list(map(int,input().split()))\r\nx.sort()\r\na=x[1]-x[0]\r\nb=x[2]-x[1]\r\nprint(a+b)", "h,a,m=map(int,input().split())\r\nans1=min(min(h,a),m)\r\nans2=max(max(h,a),m)\r\nprint(ans2-ans1)", "a=list(map(int,input().split()))\r\na.sort()\r\nb=a[1]\r\nres=abs(a[0]-a[1])+abs(a[2]-a[1])\r\nprint(res)\r\n", "a1, a2, a3 = map(int, input().split())\r\nx = (a1 + a2 + a3) - max(a1, a2, a3) - min(a1, a2, a3)\r\nprint((x - min(a1, a2, a3)) + (max(a1, a2, a3) - x))\r\n", "n = list(map(int,input().split()))\r\nmaxi = max(n)\r\nmini = min(n)\r\nprint(maxi - mini)", "lst = list(map(int, input().split(\" \")))\r\nlst.sort()\r\n\r\ndistnce = lst[1]-lst[0] + (lst[2]-lst[1])\r\n\r\nprint(distnce)\r\n", "a = [int(x) for x in input().split()]\r\na.sort()\r\ntotal_distance = []\r\nfor i in range(a[0],a[2]+1):\r\n if i == a[0]:\r\n total_distance.append(abs(a[1]-i)+abs(a[2]-i))\r\n elif i == a[1]:\r\n total_distance.append(abs(a[0]-i)+abs(a[2]-i))\r\n elif i == a[2]:\r\n total_distance.append(abs(a[1]-i)+abs(a[0]-i))\r\n else:\r\n total_distance.append(abs(a[1] - i) + abs(a[0] - i) + abs(a[2]-i))\r\ntotal_distance.sort()\r\nprint(total_distance[0])\r\n", "values = input().split()\nx1, x2, x3 = map(int, values)\npoints = [x1, x2, x3]\npoints.sort() \n\n# min_dis = min(points[1]-points[0], points[2]-points[1]) \nprint(points[2]-points[0])\n \t \t \t\t \t \t\t \t \t \t\t\t \t", "#Coder_1_neel\r\na,b,c=map(int,input().split())\r\nx1=abs(a-c)+abs(a-b)\r\nx2=abs(b-c)+abs(b-a)\r\nx3=abs(c-a)+abs(c-b)\r\nprint(min(x1,x2,x3))", "a,b,c = list(map(int,input().split()))\r\nmid = 0\r\nif (a>b and a<c) or (a>c and a<b) :\r\n mid = a\r\n print(abs(b-a)+abs(c-a))\r\nelif (b>a and b<c) or (b>c and b<a) :\r\n mid = b\r\n print(abs(b-a)+abs(c-b))\r\nelif (c>b and c<a) or (c>a and c<b) :\r\n mid = c\r\n print(abs(b-c)+abs(c-a))\r\n", "l=list(map(int,input().split()))\r\nl.sort()\r\ntotal =l[1]-l[0]+l[2]-l[1]\r\nprint(total)", "a=[int(i) for i in input().split()]\nprint(max(a)-min(a))\n\t \t\t\t \t\t\t\t\t\t\t \t \t\t \t\t \t\t \t \t", "\r\nx1, x2, x3 = list(map(int, input().split()))\r\n\r\nxtotal = [x1, x2, x3]\r\n\r\ntotal = 0\r\n\r\ny = sorted(xtotal)\r\ntotal += abs(y[1] - y[0]) + abs(y[2] - y[1]) \r\n\r\nprint(int(total))", "l=list(map(int,input().split()))\r\nl.sort()\r\nr=l[1]\r\na1=l[1]-l[0]\r\na2=l[2]-l[1]\r\nans=a1+a2\r\nprint(ans)", "x=list(map(int,input().split()))\nx.sort()\nprint(x[2]-x[0])", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the coordinates in ascending order\r\ncoordinates = sorted([x1, x2, x3])\r\n\r\n# Calculate the minimum total distance\r\ntotal_distance = (coordinates[1] - coordinates[0]) + (coordinates[2] - coordinates[1])\r\n\r\nprint(total_distance)\r\n", "a, q, s = map(int, input().split(' '))\r\nprint(max(a, q, s) - min(a, q, s))", "a = list(map(int,input().split()))\nx = abs(a[0]-a[1])\ny = abs(a[1]-a[2])\nz = abs(a[2]-a[0])\np,q,r = x+y,y+z,x+z\nprint(min(p,q,r))", "a,b,c = map(int,input().split())\r\nmn = 100\r\nfor i in range(min(a,b,c),max(a,b,c)+1):\r\n s = abs(i-a) + abs(i-b) + abs(i-c) \r\n if s < mn :\r\n mn = s \r\nprint(mn)\r\n", "x = list(map(int, input().split()))\r\nx.sort(reverse=False)\r\ncount = (x[2] - x[1]) + (x[1] - x[0])\r\nprint(int(count))\r\n", "xs = list(map(int, input().split()))\r\nt = sum(xs) // 3\r\n\r\nprint(abs(min(xs) - t) + abs(max(xs) - t))", "powers = list(map(int, input().split()))\npowers.sort()\nfinal_power = powers[len(powers)-1] - powers[0]\nprint(final_power)\n \t \t\t \t\t\t \t\t\t\t\t\t \t \t \t \t\t \t", "l = sorted(list(map(int, input().split())))\r\nans = l[2]-l[0]\r\nprint(ans)", "x1,x2,x3 = map(int,input().split())\r\nprint(max(x1,x2,x3)-min(x1,x2,x3))", "a,b,c=list(map(int,input().split()))\r\nk=max(a,b,c)\r\nm=[a,b,c]\r\nm.remove(k)\r\nl=max(m)\r\nm.append(k)\r\n\r\no=0\r\nfor i in m:\r\n\tif i!=l:\r\n\t\to+=abs(i-l)\r\nprint(o)\r\n\t\t\r\n", "arr=sorted([int(i) for i in input().split()])\r\nx=arr[1]\r\na,b,c=arr[0],arr[1],arr[2]\r\nprint(abs(a-x)+abs(b-x)+abs(c-x))", "x1, x2, x3 = map(int, input().split())\r\n\r\npositions = [x1, x2, x3]\r\npositions.sort()\r\n\r\nmin_total_distance = positions[2] - positions[0]\r\n\r\nprint(min_total_distance)\r\n", "x1, x2, x3 = list(map(int, input().split())) \r\nmax = max(x1, x2, x3)\r\nmin = min(x1, x2, x3)\r\n\r\narbitrary_total = max * 2\r\nminimum_total = 0\r\nmeeting_point_options = list(range(1, max + 1))\r\n\r\nfor i in meeting_point_options:\r\n proposed_point = (abs(x1 - i) + abs(x2 - i) + abs(x3 - i)) # the total distance if they were to meet at i\r\n \r\n if proposed_point < arbitrary_total:\r\n arbitrary_total = proposed_point\r\n minimum_total = arbitrary_total\r\n\r\nprint(minimum_total)", "#### The average of the three points would be the point of minimum distance\r\nx1,x2,x3=[int(x) for x in input().split(' ')]\r\n\r\nmin_val=float(\"inf\")\r\n\r\nfor pt in range(min(x1,x2,x3),max(x1,x2,x3)+1):\r\n min_val=min(min_val,abs(pt-x1)+abs(pt-x2)+abs(pt-x3))\r\nprint(min_val)", "a = input()\r\nb = a.split(' ')\r\nc = []\r\nfor i in b:\r\n c.append(int(i))\r\nc.sort()\r\nd = int(abs(c[1]-c[0]))\r\ne = int(abs(c[1]-c[2]))\r\nprint(d+e)", "a = list(map(int, input().split(' ')))\r\na = sorted(a)\r\nprint(a[2] - a[0])", "list = list(map(int,input().split())) \r\nmini = 100\r\nmaxi = 0\r\nfor i in list:\r\n maxi = max(i, maxi)\r\n mini = min(i, mini)\r\nprint (maxi - mini)", "a = sorted(map(int, input().split()))\r\nprint(a[2]-a[1]+a[1]-a[0])", "x = [int(i) for i in input().split()]\r\nx.sort()\r\nmax=x[2]\r\nmin=x[0]\r\nmid=x[1]\r\nprint((max-mid)+(mid-min))", "arr = list(map(int, input().split()))\r\narr.sort()\r\ndist =( arr[1] - arr[0])+(arr[2]-arr[1])\r\nprint(dist)", "a=list(map(int,input().split()))\r\na.sort()\r\nprint(abs(a[1]-a[0])+abs(a[2]-a[1]))", "a = input().split(\" \")\r\nx = int(a[0])\r\ny = int(a[1])\r\nz = int(a[2])\r\nx1 = abs(y-x) + abs(z-x)\r\ny1 = abs(x-y) + abs(z-y)\r\nz1 = abs(y-z) + abs(x-z)\r\nprint(min(x1,y1,z1))", "arr = list(map(int, input().split()))\r\narr.sort()\r\nprint(arr[1] - arr[0] + arr[-1] - arr[1])", "l=list(map(int,input().split()))\r\nl.sort()\r\nk=l[1]\r\nf=abs(k-l[0])\r\nl=abs(k-l[2])\r\nprint(f+l)\r\n", "spots = []\r\nfor num in input().split():\r\n spots.append(int(num))\r\n\r\nspots.sort()\r\nprint(spots[1] - spots[0] + spots[2] - spots[1])\r\n", "p = list(map(int, input().split()))\r\np.sort()\r\nprint(abs(p[0]-p[1])+abs(p[2]-p[1]))", "def solve():\n x,y,z=[int(i) for i in input().split()]\n i=max(x,y,z)\n j=min(x,y,z)\n v=x+y+z-i-j\n print(i-v+v-j)\nsolve()\n\t\t \t\t \t\t \t \t \t\t \t\t\t\t\t\t \t\t", "a, b, c= list(map(int,input().split()))\r\nmn = max(a,b,c)\r\nfor i in range(1,max(a,b,c)):\r\n count = (abs(a-i)+abs(b-i)+abs(c-i))\r\n if count < mn:\r\n mn = count\r\nprint(mn)", "# Read input\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the coordinates\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\n\r\n# Calculate the minimum total distance\r\ndistance = coordinates[2] - coordinates[0]\r\n\r\n# Print the result\r\nprint(distance)\r\n", "n=input()\r\nl=list(map(int,n.split()))\r\nm=min(l)\r\nd=max(l)\r\nprint(d-m)", "def d(b,x):\r\n p = 0\r\n for i in b:\r\n p += abs(i-x)\r\n return p\r\ndef f(b):\r\n bestp = max(b)\r\n for i in range(min(b),max(b)+1):\r\n if d(b,i) < bestp:\r\n bestp = d(b,i)\r\n return bestp\r\nab = input()\r\nab = [int(i) for i in ab.split(\" \")]\r\nprint(f(ab))", "K = list(map(int, input().split()))\r\nmxm=max(K)\r\nmnm=min(K)\r\nprint(mxm-mnm)", "s=list(map(int,input().split()))\r\ns.sort()\r\na=s.pop(1)\r\nprint(a-s.pop(0)+s.pop(0)-a)\r\n\r\n\r\n\r\n\r\n\r\n", "x1, x2, x3 = map(int, input().split())\r\n\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\n\r\ndistance1 = coordinates[1] - coordinates[0]\r\ndistance2 = coordinates[2] - coordinates[1]\r\n\r\ntotal_distance = distance1 + distance2\r\nprint(total_distance)\r\n", "data=list(map(int,input().split()))\ndata1=max(data)-min(data)\nprint(data1)\n \t\t \t\t\t\t \t \t \t\t \t\t\t \t\t\t\t \t", "list1 = list(input().split())\r\nmin = 0\r\nmax = 0\r\nfor i in range(0,len(list1)):\r\n list1[i] = int(list1[i])\r\n\r\n if i == 0:\r\n min = list1[i]\r\n max = list1[i]\r\n else:\r\n if list1[i] > max:\r\n max = list1[i]\r\n if list1[i] < min:\r\n min = list1[i]\r\nprint(max-min)\r\n\r\n", "a,b,c=(int(i) for i in input().split())\r\nl=[]\r\nl.append(a)\r\nl.append(b)\r\nl.append(c)\r\nl=sorted(l)\r\nprint((l[1]-l[0])+(l[2]-l[1]))", "a,b,c=map(int,input().split())\r\nd=abs(a-b)+abs(b-c)\r\ne=abs(c-b)+abs(a-c)\r\nf=abs(a-b)+abs(a-c)\r\nprint(min(d,e,f))", "a,b,c=map(int, input().split())\r\nsan1=max(a,b,c)\r\nsan2=min(a,b,c)\r\nsan=(a+b+c)-(san1+san2)\r\nprint((san1-san)+(san-san2))\r\n\r\n \r\n", "#!/usr/bin/env python3\n\ndef solve(nums):\n a, b, c = sorted(nums)\n return b - a + c - b\n\n\ndef main():\n print(solve([int(d) for d in input().split()]))\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", "l=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[1]-l[0]+l[2]-l[1])", "coords = [int(x) for x in input().split()]\r\ncoords.sort()\r\nprint(coords[2] - coords[0])", "if __name__ == '__main__':\n x = input().split(\" \")\n points = [int(x[0]), int(x[1]),int(x[2])]\n minimo = min(points)\n maximo = max(points)\n\n print(maximo-minimo)\n\t \t \t\t\t \t\t \t \t \t\t\t\t\t \t", "xs = [int(i) for i in input().split()]\r\nxs.sort()\r\nxs = xs[::-1]\r\nprint(abs(xs[1] - xs[0]) + abs(xs[2] - xs[1]))", "x,x2,x4 = map(int, input().split())\r\nx1 = max(x,x2,x4)\r\nx3 = min(x,x2,x4)\r\nprint(abs(x1-x2) + abs(x3-x2))\n# Fri Jul 07 2023 11:18:58 GMT+0300 (Moscow Standard Time)\n", "arr = [int(i) for i in input().split()] \r\n\r\nprint(max(arr) - min(arr))", "way = list(map(int,input().split()))\r\nway.sort()\r\ns = (way[2] - way[1])+(way[1] - way[0])\r\nprint(s)", "a,b,c = map(int,input().split())\r\nprint(min(abs(a-b) + abs(a-c),abs(b-a) + abs(b-c), abs(c-a) + abs(c-b)))", "def main():\r\n a = sorted((map(int, open(0).read().split())))\r\n print(a[2] - a[0])\r\n\r\nmain()", "m=list(map(int,input().split()))\r\nm.sort()\r\nres=abs(m[0]-m[1])+abs(m[1]-m[2])\r\nprint(res)\r\n", "a = list(map(int, input().split()))\r\na = sorted(a)\r\nd = a[1]\r\nc = a[2] - a[0]\r\nprint(c)", "def main():\r\n positions = [int(i) for i in input().split()]\r\n positions.sort()\r\n print(positions[2]-positions[0])\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=input()\r\nl=s.split(\" \")\r\ncount=0\r\nfor i in range (3):\r\n l[i]=int(l[i])\r\nl.sort()\r\ncount= (l[1]-l[0])+(l[2]-l[1])\r\nprint(count)\r\n", "# Read the coordinates of the houses\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Find the minimum and maximum coordinates among the three houses\r\nmin_coord = min(x1, x2, x3)\r\nmax_coord = max(x1, x2, x3)\r\n\r\n# Calculate the total distance the friends need to travel\r\ntotal_distance = max_coord - min_coord\r\n\r\n# Print the result\r\nprint(total_distance)\r\n", "pos = list(map(int,input().split()))\r\npos.sort()\r\nprint(pos[2] - pos[0])", "def intRd():\r\n return int(input())\r\n\r\ndef lstRd():\r\n return list(map(int, input().split()))\r\n\r\nx, y, z = lstRd()\r\n\r\n\r\nprint(min(abs(x - y) + abs(x - z), abs(y - x) + abs(y - z), abs(z - x) + abs(z - y)))\r\n", "a,b,c = map(int, input().split())\r\narr=[]\r\narr.append(a)\r\narr.append(b)\r\narr.append(c)\r\narr.sort()\r\nd=arr[1]-arr[0]\r\nd1=arr[2]-arr[1]\r\nans=d+d1\r\nprint(ans)", "numbers = [int(el) for el in input().split(\" \")]\r\nmax = max(numbers)\r\nmin = min(numbers)\r\nprint(max - min)", "li=list(map(int,input().split()))\r\nmaximum=max(li[0],li[1],li[2])\r\nminimum=min(li[0],li[1],li[2])\r\nli.remove(maximum)\r\nli.remove(minimum)\r\nmiddle=li[0]\r\ncount=(maximum-middle)+(middle-minimum)\r\nprint(count)", "a,b,c = map(int,input().split())\nmi = min(a,min(b,c))\nma = max(a,max(b,c))\nprint(ma-mi)", "n = [int(i) for i in input().split()]\r\nprint(max(n)-min(n))\r\n", "a, b, c = list(map(int, input().split()))\nprint(max(a,b,c) - min(a,b,c))\n\t \t\t\t \t\t \t\t \t\t\t\t \t\t\t\t", "# Problem: https://codeforces.com/problemset/problem/723/A\r\n# Answer:\r\n\r\n#*********************************\r\n\r\n# One of the friends will always remain in his home.\r\n# We want to sort the position of each person and then\r\n# calculate the distance from the ends to the middle.\r\n\r\n#*********************************\r\n\r\nhomePositions = [int(i) for i in input().split()]\r\n\r\nhomePositions.sort()\r\n\r\ndistance1 = abs(homePositions[0] - homePositions[1])\r\ndistance2 = abs(homePositions[2] - homePositions[1])\r\noutput = distance1 + distance2\r\n\r\nprint(output)", "x = [int(x) for x in input().split()]\r\nprint(max(x)-min(x))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 11 22:00:40 2023\r\n\r\n@author: R I B\r\n\"\"\"\r\n\r\nimport sys\r\nfrom math import *\r\nL = []\r\nfor i in sys.stdin:\r\n L.append(i)\r\n \r\nK= [line.rstrip('\\n') for line in L if line]\r\nt=len(K[0].split(' '))\r\nK=[int(K[0].split(' ')[i]) for i in range(len(K[0].split(' ')))]\r\n\r\nfor i in range(t-1):\r\n x=K[i]\r\n k=i\r\n for j in range(i+1,t):\r\n if x>K[j]:\r\n x=K[j]\r\n k=j\r\n temp=K[i]\r\n K[i]=x\r\n K[k]=temp\r\nprint(abs(K[-1]-K[0]))\r\n ", "data = [int(x) for x in input().split()]\r\nanswer = sum([abs(int(sorted(data)[1]) - x) for x in data])\r\nprint(answer)", "arr = sorted(list(map(int, input().split())))\r\nprint(((arr[1]-arr[0])+(arr[2]-arr[1])))", "x = list(map(int, input().split()))\r\nx.sort()\r\nprint(x[1] - x[0] + x[2] - x[1])", "input_list = list(map(int, input().split()))\r\na, b, c = input_list\r\n\r\nprint(max(a,max(b,c)) - min(a,min(b,c)))\r\n", "n=list(map(int,input().split(\" \")))\r\n\r\nn.sort()\r\nx=n[-1]-n[0]\r\nprint(x)\r\n", "k=list(map(int,input().split()))\nk.sort()\nprint(k[1]-k[0]+k[2]-k[1])\n \t \t\t \t \t\t\t\t\t\t \t\t\t \t \t", "f = input().split()\nfor i in range(len(f)):\n f[i]= int(f[i])\n\nmin = min(f)\nmax = max(f)\n\nans = sorted(f)[len(f) // 2]\na1 = ans - min\n\na3 = max - ans\nfor i in f:\n if i != min and i != max:\n a2 = abs(i - ans)\n\n\nans1 = a1 + a2 + a3\n\nprint(ans1)\n\n", "x = list(map(int, input().split()))\r\nx_max = max(x)\r\nx_min = min(x)\r\nx.remove(x_max) and x.remove(x_min)\r\n\r\nprint(int(x[0]) - x_min + x_max - int(x[0]))", "x1,x2,x3=map(int,input().split())\r\nmaximum=max(x1,x2,x3)\r\nminimum=min(x1,x2,x3)\r\nmid=x1+x2+x3-maximum-minimum\r\nprint(maximum-minimum)\r\n", "x = list(map(int, input().split()))\nx.sort()\nprint(x[2]-x[0])\n\n", "sum = 0\r\na = list(map(int,input().split()))\r\nfor i in a:\r\n if i != max(a) and i > min(a):\r\n sum += max(a) - i\r\n sum += i - min(a)\r\nprint(sum)", "p,v,t=map(int,input().split())\r\nmx=max(p,v,t)\r\nmn=min(p,v,t)\r\nsr=(p+v+t)-(mn+mx)\r\nkol=abs(sr-mn)+abs(sr-mx)\r\nprint(kol)\r\n", "a1, a2, a3 = map(int, input().split())\r\ncoordinates = sorted([a1, a2, a3])\r\nmin_distance = coordinates[2] - coordinates[0]\r\nprint(min_distance)\r\n", "lis = list(map(int, input().split()))\r\nbig = max(lis)\r\nsmol = min(lis)\r\nmid = 0\r\ncounter = 0\r\n\r\nfor num in lis:\r\n if num != big and num != smol:\r\n mid = num\r\n\r\ncounter += (mid - smol) + (big - mid)\r\n\r\nprint(counter)\r\n", "z = list(map(int,input().split()))\nz.sort()\nprint((z[1]-z[0])+(z[2]-z[1]))\n \t\t\t \t \t\t\t\t\t\t \t\t\t\t\t\t \t\t\t \t\t \t", "a, b, c = [int(i) for i in input().split()]\r\nmax = max(a, b, c)\r\nmin = min(a, b, c)\r\nres = 300\r\nfor i in range(min, max + 1):\r\n tmp = abs(a-i) + abs(b-i) + abs(c-i)\r\n if tmp < res:\r\n res = tmp\r\nprint(res)", "l = list(map(int, input().split()))\r\nl.sort()\r\nprint(l[1]-l[0] + l[2]-l[1])", "a=list(map(int,input().split()))\na.sort()\nprint(a[2]-a[0])\n \t \t \t \t \t \t \t\t \t \t \t \t", "p = sorted(list(map(int, input().split())))\r\nprint(p[2] - p[0])", "x=sorted(list(map(int,input().split())))\r\nprint((x[1]-x[0])+(x[-1]-x[1]))", "coords =list( map(int, input().split()))\n\ncoords.sort()\n\nprint(coords[1] - coords[0] + coords[2] - coords[1])\n\n", "x = list(map(int, input().split()))\r\nlis = []\r\ncurr1 = x[0] - x[1]\r\nif curr1 < 0:\r\n curr1 = curr1 * -1\r\nelse:\r\n curr1 = curr1\r\ncurr2 = x[0] - x[2]\r\nif curr2 < 0:\r\n curr2 = curr2 * -1\r\nelse:\r\n curr2 = curr2\r\nsum1 = curr1 + curr2\r\n\r\ncurr3 = x[1] - x[0]\r\nif curr3 < 0:\r\n curr3 = curr3 * -1\r\nelse:\r\n curr3 = curr3\r\ncurr4 = x[1] - x[2]\r\nif curr4 < 0:\r\n curr4 = curr4 * -1\r\nelse:\r\n curr4 = curr4\r\nsum2 = curr3 + curr4\r\n\r\ncurr5 = x[2] - x[0]\r\nif curr5 < 0:\r\n curr5 = curr5 * -1\r\nelse:\r\n curr5 = curr5\r\ncurr6 = x[2] - x[1]\r\nif curr6 < 0:\r\n curr6 = curr6 * -1\r\nelse:\r\n curr6 = curr6\r\nsum3 = curr5 + curr6\r\nlis.append(sum1)\r\nlis.append(sum2)\r\nlis.append(sum3)\r\nprint(min(lis))", "l=list(map(int,input().split()))\r\nk=[]\r\nk.append(abs(l[1]-l[0])+abs(l[2]-l[0]))\r\nk.append(abs(l[0]-l[1])+abs(l[2]-l[1]))\r\nk.append(abs(l[0]-l[2])+abs(l[1]-l[2]))\r\nprint(min(k))", "x1, x2, x3 = sorted(map(int, input().split()))\r\ndist = (x2 - x1) + (x3 - x2)\r\nprint(dist)\r\n", "x1, x2, x3 = sorted(list(map(int, input().split())))\nprint(x2-x1+x3-x2)\n", "n = input()\r\nnums = list(map(eval, n.split()))\r\n\r\nnums.sort()\r\n\r\nfirst = nums[0]\r\nsecond = nums[1]\r\nthird = nums[2]\r\n\r\nresult = (second - first) + (third - second)\r\n\r\nprint(result)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x = list(map(int, input().split()))\r\nl = 0\r\nans = 300\r\nans2 = sum(abs(l - i) for i in x)\r\nwhile ans2 < ans:\r\n l += 1\r\n ans, ans2 = ans2, sum(abs(l - i) for i in x)\r\nprint(ans)", "l=list(map(int,input().split()))\r\na=max(l)\r\nb=min(l)\r\nprint(a-b)", "a = [int(i) for i in input().split()]\nprint(max({a[0], a[1], a[2]}) - min({a[0], a[1], a[2]}))\n# Thu Jan 05 2023 12:20:30 GMT+0300 (Moscow Standard Time)\n\n# Thu Jan 05 2023 12:20:35 GMT+0300 (Moscow Standard Time)\n", "x1, x2, x3 = list(map(int, input().split()))\r\nlst = sorted([x1, x2, x3])\r\n\r\nprint((lst[1] - lst[0]) + (lst[2] - lst[1]))", "x=list(map(int,input().split()))\r\nx.sort()\r\nd=x[1]\r\nprint(abs(x[0]-d)+ abs(x[2]-d))", "\r\nx1,x2,x3=map(int,input().split())\r\nres=max(max(x1,x2),x3)-min(min(x1,x2),x3)\r\nprint(res)\r\n\r\n\r\n", "a=list(map(int,input().split()))\r\nn=len(a)\r\ns=sum(a)\r\nav=s/n\r\nma=max(a)\r\nmi=min(a)\r\nd1=abs(av-ma)\r\nd2=abs(av-mi)\r\nz=d1+d2\r\nprint(int(z))", "a,b,c=map(int,input().split())\nk=min(min(a,b),c)\nk1=max(max(a,b),c)\nprint(k1-k)\n\t\t \t \t \t\t\t\t \t \t \t \t\t\t\t \t", "s=sorted(list(map(int,input().split())))\r\nprint(s[1]-s[0]+s[2]-s[1])\r\n", "s = sorted([int(i) for i in input().split()])\r\nprint(s[2]-s[1]+s[1]-s[0])", "n_ls = [int(n) for n in input().split()]\r\nx1, x2, x3 = n_ls[0], n_ls[1], n_ls[2]\r\n\r\nprint(max(n_ls)-min(n_ls))", "# Read input values\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Find the minimum and maximum coordinates\r\nmin_coordinate = min(x1, x2, x3)\r\nmax_coordinate = max(x1, x2, x3)\r\n\r\n# Calculate the total distance\r\ntotal_distance = max_coordinate - min_coordinate\r\n\r\n# Print the result\r\nprint(total_distance)\r\n", "L=list(map(int,input().split(\" \")))\r\ncoord=0\r\nsum1=0\r\nmin=L[0]\r\nmax=L[-1]\r\nfor i in range(len(L)):\r\n if L[i]<min:\r\n min=L[i]\r\n if L[i]>max:\r\n max=L[i]\r\nfor i in range(len(L)):\r\n if L[i]!=min and L[i]!=max:\r\n coord=L[i]\r\nfor i in range(len(L)):\r\n sum1=sum1+abs(L[i]-coord)\r\nprint(sum1)", "def main():\r\n temp_list = input().split(\" \")\r\n main_list = []\r\n for i in range(3):\r\n main_list.append(int(temp_list[i]))\r\n main_list.sort() \r\n a = main_list[1] - main_list[0] \r\n b = main_list[2] - main_list[1] \r\n result = a + b\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=list(map(int,input().split()))\nn=len(a)\ns=sum(a)\nav=s/n\nma=max(a)\nmi=min(a)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz=d1+d2\nprint(int(z))\n\n\t \t\t \t\t\t\t\t\t \t \t \t\t\t \t\t \t\t\t", "x1, x2, x3 = sorted([int(x) for x in input().split()])\r\naver = int((x1+ x2 + x3) // 2)\r\nprint(aver - x1 + x3 - aver)", "a , k , n = map(int , input().split())\r\nsum = abs(n - a) + abs(n - k)\r\nsum1 = abs(a - k) + abs(a - n)\r\nsum2 = abs(k - a) + abs(k - n)\r\nif(sum >= sum1 <= sum2):\r\n print(sum1)\r\nelif(sum1 >= sum <= sum2):\r\n print(sum)\r\nelse:\r\n print(sum2)", "x1, x2, x3 = map(int, input().split())\r\nx = [x1, x2, x3]\r\nx.sort(reverse = True)\r\nc = x\r\nsumm = (c[0]-c[1]) + (c[1]-c[2])\r\nprint(summ)\r\n", "a, _, c = sorted(map(int, input().split()))\r\nprint(c - a)", "friends = sorted(list(map(int, input().split())))\r\n\r\ndistanceA = friends[1] - friends[0]\r\ndistanceB = friends[2] - friends[1]\r\n\r\nprint(distanceA + distanceB)", "ox = sorted(list(map(int,input().split())))\r\nprint((ox[1]-ox[0])+(ox[2]-ox[1]))", "a,b,c=map(int,input().split())\r\nz1=max(a,b,c)\r\nz=min(a,b,c)\r\nprint(z1-z)", "y=list(map(int,input().split()))\nn=len(y)\ns=sum(y)\nav=s/n\nma=max(y)\nmi=min(y)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz=d1+d2\nprint(int(z))\n\t\t\t \t\t\t\t \t\t \t\t\t\t \t \t \t\t\t\t\t \t", "g=list(map(int,input().split()))\r\na=max(g)\r\nb=min(g)\r\nprint(a-b)\n# Fri Jul 07 2023 16:00:49 GMT+0300 (Moscow Standard Time)\n", "lst=list(map(int,input().split()))\r\nfor i in range(3):\r\n for j in range(i+1,3):\r\n if lst[i]>lst[j]:\r\n lst[i],lst[j]=lst[j],lst[i]\r\nans=(lst[2]-lst[1])+(lst[1]-lst[0])\r\nprint(ans)", "n=list(map(int,input().split()))\r\nn.sort()\r\ncount=n[1]-n[0]+(n[2]-n[1])\r\nprint(count)", "lst = list(map(int, input().split()))\r\nprint(max(lst) - min(lst))", "d=sorted(list(map(int,input().split())))\r\nprint((d[1]-d[0])+(d[2]-d[1]))", "p,r,a=map(int,input().split())\r\nprint(max(p,r,a)-min(p,r,a))", "x1,x2,x3 = sorted(map(int,input().split()))\r\nprint(x3-x1)", "a=list(map(int,input().split()))\r\na.sort()\r\nans=a[1]+a[2]-2*a[0]\r\nfor i in range(a[0],a[2]+1):\r\n ans=min(ans,abs(a[0]-i)+abs(a[1]-i)+abs(a[2]-i))\r\nprint(ans)", "arr = [int(x) for x in input().split()]\r\narr = sorted(arr)\r\nprint((arr[1]-arr[0])+(arr[2]-arr[1]))\r\n", "\r\na = input()\r\na = a.split()\r\nab = list(map(int, a))\r\nprint(max(ab)-min(ab))\r\n\r\n\r\n\r\n\r\n", "x1, x2, x3 = map(int, input().split())\r\n\r\nd1 = (x1 - x2) if x1>x2 else (x2 - x1)\r\nd2 = (x3 - x2) if x3>x2 else (x2 - x3)\r\nd3 = (x1 - x3) if x1>x3 else (x3 - x1)\r\n\r\n\r\nmax_num = max(d1, d2, d3)\r\n\r\nprint(max_num)", "n = 3\r\na = [*map(int, input().split())]\r\na.sort(reverse = False)\r\nprint(a[2]-a[0])\n# Fri Jul 07 2023 13:03:18 GMT+0300 (Moscow Standard Time)\n", "arr=list(map(int,input().split()))\r\narr.sort()\r\nprint(arr[1]-arr[0] + arr[2]-arr[1])", "x1, x2, x3 = map(int, input().split())\r\nlst = []\r\n\r\nlst.append(x1)\r\nlst.append(x2)\r\nlst.append(x3)\r\n\r\nox = sorted(lst)\r\n\r\nprint(ox[2]- ox[0])", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n \nif __name__ == '__main__':\n d= [int(x) for x in input().strip().split(\" \")]\n d.sort()\n print((d[2]-d[1]) + (d[1]-d[0]))\n \t \t\t \t\t \t\t\t \t\t\t\t \t", "trio=list(map(int,input().split()))\r\ntrio.sort()\r\n\r\na=trio[1]-trio[0]\r\nb=trio[2]-trio[1]\r\n\r\nprint(a+b)", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n x1, x2, x3 = map(int, input().split())\r\n d = (x1 + x2 + x3) // 3\r\n ans = min(abs(d - x1) + abs(d - x2) + abs(d - x3), abs(x1-x2) + abs(x3-x2), abs(x2-x1) + abs(x3-x1), abs(x1-x3) + abs(x2-x3))\r\n print(ans)", "x1, x2, x3 = map(int, input().split())\r\nmiddle_point = (x1 + x2 + x3) - min(x1, x2, x3) - max(x1, x2, x3)\r\ndistance_friend1 = abs(x1 - middle_point)\r\ndistance_friend2 = abs(x2 - middle_point)\r\ndistance_friend3 = abs(x3 - middle_point)\r\nmin_total_distance = distance_friend1 + distance_friend2 + distance_friend3\r\nprint(min_total_distance)\r\n", "string = input().split()\r\n\r\na = int(string[0])\r\nb = int(string[1])\r\nc = int(string[2])\r\n\r\nif a > b and a < c:\r\n print(a - b + c - a)\r\nelif a < b and a > c:\r\n print(b - a + a - c)\r\nelif b > a and b < c:\r\n print(b - a + c - b)\r\nelif b < a and b > c:\r\n print(a - b + b - c)\r\nelif c > a and c < b:\r\n print(c - a + b - c)\r\nelse:\r\n print(a - c + c - b)", "x = sorted(list(map(int , input().split())))\r\n\r\nprint(x[2] - x[0])", "q, w, e = map(int, input().split())\r\nr = (max(q, w, e) + min(q, w, e)) - (q + w + e)\r\nt = (max(q, w, e) - r) + (r - min(q, w, e))\r\nprint(t)", "x=input(\"\")\r\nl=x.split(\" \")\r\nf=[]\r\nfor i in l:\r\n s=0\r\n for j in l:\r\n s+=abs(int(i)-int(j))\r\n f.append(s)\r\nprint(min(f))", "a = input().split(\" \")\na = [int(i) for i in a]\nprint(max(a)-min(a))\n\t \t\t \t \t \t \t \t \t\t\t \t", "a,b,c=map(int,input().split())\r\ns=abs(a-b)+abs(a-c)\r\nd=abs(b-c)+abs(b-a)\r\nw=abs(c-a)+abs(c-b)\r\nprint(min(s,d,w))", "a,b,c = map(int, input().split())\r\n\r\nd = max(a,b,c) - min(a,b,c)\r\n\r\nprint(d)\r\n", "from math import *\r\na,b,c = map(int,input().split())\r\n\r\nx2 = min({a,b,c})\r\nx3 = max({a,b,c})\r\n\r\nprint(x3-x2)", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nlst = [int(x) for x in input().split()]\r\nlst = sorted(lst)\r\na = lst[0]\r\nb = lst[1]\r\nc = lst[2]\r\n\r\nprint(abs(b-a) + abs(b-c))\r\n", "lst = list(map(int, input().split()))\r\nlst.sort()\r\nprint(abs(lst[1] - lst[0]) + abs(lst[2] - lst[1]))\r\n ", "l=list(map(int,input().split()))\r\nl.sort()\r\nx=(l[1]-l[0])+(l[2]-l[1])\r\nprint(x)", "a,b,c = map(int,input().split())\r\nprint(min(abs(b-a)+abs(c-a),abs(b-a)+abs(c-b),abs(b-c)+abs(c-a)))", "a,b,c=map(int,input().split())\r\n\r\nt=min(a,b,c)\r\np=max(a,b,c)\r\n\r\nprint(p-t)\r\n", "s = list(map(int, input().split()))\r\ns.sort()\r\nprint(s[1]-s[0]+s[2]-s[1])", "a,b,c=map(int,input().split())\r\nab=abs(a-b)\r\nbc=abs(b-c)\r\nca=abs(c-a)\r\nl=[ab,bc,ca]\r\nsum=0\r\nfor k in range(2):\r\n sum+=min(l)\r\n l.remove(min(l))\r\nprint(sum)", "*n,=map(int,input().split())\r\nprint(max(n)-min(n))", "# https://codeforces.com/problemset/problem/723/A\r\n\r\na = list(map(int, input().split()))\r\na.sort()\r\nprint(a[2] - a[0])", "entrada = list(map(int, input().split()))\r\nans = entrada.pop(entrada.index(max(entrada)))\r\nans -= max(entrada)\r\nans += abs(entrada[0] - entrada[1])\r\nprint(ans)\r\n", "l=[int(x) for x in input().split()]\r\nl.sort()\r\nprint(l[2]-l[0])\r\n", "l=[int(i) for i in input().split()]\r\nl.sort()\r\na,b,c=l\r\nprint(b-a+c-b)", "print(sum([j * (1 if i != 0 else -1) for i, j in enumerate(sorted([int(i) for i in input().split()])) if i != 1]))\r\n", "n=list(map(int,input().split()))\r\nn.sort()\r\n \r\nd1=n[1]-n[0]\r\nd2=n[2]-n[1]\r\nprint(abs(d1+d2))", "def main():\r\n x, y, z = map(int, input().split())\r\n print(max(x,y,z)-min(x,y,z))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = []\r\nx1, x2, x3 = map(int, input().split())\r\na.append(x1)\r\na.append(x2)\r\na.append(x3)\r\nprint(max(a) - min(a))\r\n", "p, q, r = map(int, input().split())\r\navg = (p+q+r)//3\r\na = max(p,q,r)\r\nb = min(p,q,r)\r\nd1 = a-avg\r\nd2 = avg-b\r\nprint(d1+d2)", "a1=list(map(int,input().split()))\nn=len(a1)\ns=sum(a1)\nav=s/n\nma=max(a1)\nmi=min(a1)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz1=d1+d2\nprint(int(z1))\n\t\t \t\t \t \t\t\t \t \t\t \t\t \t\t\t\t", "import sys\r\n\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nprint(max(b) - min(b))", "x=list(map(int,input().split()))\r\nx.sort()\r\ny=x[1]\r\nans=0\r\nfor i in x:\r\n ans=ans+abs(i-y)\r\nprint(ans)", "x1, x2, x3 = map(int, input().split())\ns = sorted([x1, x2, x3])\nprint(abs(s[1]-s[0]) + abs(s[1] - s[2]))\n", "x = list(map(int ,input().split()))\nx1 , x2 = min(x), max(x)\n\"\"\"x.remove(x1)\nx.remove(x2)\"\"\"\nprint(x2-x1)", "point = list(map(int, input().split()))\r\nmid = sorted(point)[1]\r\ntotal = abs(mid-point[0])+abs(mid-point[1])+abs(mid-point[2])\r\nprint(total)", "x1,x2,x3=map(int,input().split())\r\nme=min(x1,x2,x3)\r\nmx=max(x1,x2,x3)\r\nx=0\r\nif x1 !=me and x1 !=mx:\r\n\tx=x1\r\nelif x2 !=me and x2 !=mx:\r\n\tx=x2\r\nelse:\r\n\tx=x3\r\n\t\r\nk=x-me\r\nkh=mx-x\t\r\nout=k+kh\t\t\r\nprint(out)", "input1=input().split()\r\nfor i in range(0,len(input1)):\r\n input1[i]=int(input1[i])\r\ninput1.sort()\r\nprint(input1[2]-input1[0])", "positions = list(map(int, input().split(\" \")))\n\nprint(max(positions) - min(positions))\n\t\t \t \t\t \t \t\t \t \t\t", "x_pos=list(map(int,input().split()))\r\nx_pos.sort()\r\nprint(x_pos[-1]-x_pos[0])\r\n ", "x1, x2, x3 = sorted(map(int, input().split()))\r\n\r\ndistance = (x2 - x1) + (x3 - x2)\r\n\r\nprint(distance)\r\n", "x1, x2,x3 = map(int, input().split())\r\nd1 = abs(x1 - x2) + abs(x1 - x3)\r\nd2 = abs(x3 - x2) + abs(x3 - x1)\r\nd3 = abs(x2 - x1) + abs(x2 - x3)\r\nprint(min(d1, d2, d3))", "x = list(map(int, input().split()))\r\n\r\nd1 = abs(x[1] - x[0]) + abs(x[2] - x[0])\r\nd2 = abs(x[0] - x[1]) + abs(x[2] - x[1])\r\nd3 = abs(x[0] - x[2]) + abs(x[1] - x[2])\r\n \r\nprint(min(d1,d2,d3))", "li=[int(x) for x in input().split()]\r\nli.sort()\r\nprint((li[1]-li[0])+(li[2]-li[1]))", "lista = [int(x) for x in input().split(' ')]\r\nlista.sort()\r\na = lista[0]\r\nb = lista[1]\r\nc = lista[2]\r\n\r\nsoma = (b-a) + (c-b)\r\nprint(soma)", "a,b,c= map(int,input().split(\" \"))\r\nmid_point=0\r\n\r\nif ((a < b and b < c) or (c < b and b < a)):\r\n mid_point=b\r\nelif ((b < a and a < c) or (c < a and a < b)):\r\n mid_point=a\r\nelse:\r\n mid_point=c\r\n\r\n \r\ndis_from_min_a=abs(mid_point-a)\r\n\r\ndis_from_min_b=abs(mid_point-b)\r\n\r\ndis_from_min_c=abs(mid_point-c)\r\n\r\ntotal = dis_from_min_a + dis_from_min_b + dis_from_min_c\r\n\r\nprint(total)", "mops=list(map(int, input().split()))\nfor j in range(3):\n for i in range(3-j-1):\n if mops[i]<mops[i+1]: mops[i], mops[i+1]=mops[i+1], mops[i]\nans=mops[0]-mops[-1]\nprint(ans)\n# Fri Jul 07 2023 11:47:33 GMT+0300 (Moscow Standard Time)\n", "x,y,z = map(int,input().split())\r\nmn = min(x,y,z)\r\nmx=max(x,y,z)\r\nprint(mx-mn)", "x, y, z = map(int, input().split())\r\na = min(x, y, z)\r\nb = max(x, y, z)\r\nc = x+y+z-max(x, y, z)-min(x, y, z)\r\nm = (abs(c-a) + b-a)\r\nn = 0\r\nfor i in range(a, b+1):\r\n if (abs(c-i) + b-i + i-a) < m:\r\n m = abs(c-i) + b-i + i-a\r\n n = i\r\nprint(m)", "a=list(map(int,input().split()))\r\na.sort(reverse=True)\r\nc=(a[0]-a[1])+(a[1]-a[2])\r\nprint(c)", "x1,x2,x3=map(int,input().split())\r\ncoor=[x1,x2,x3]\r\ncoor.sort()\r\nmin_dist=coor[2]-coor[0]\r\nprint(min_dist)", "# s = input()\r\n# s2 = s.split('+')\r\n# for i in range(len(s2) - 1):\r\n# for j in range(len(s2) - 1 - i):\r\n# if int(s2[j]) > int(s2[j + 1]):\r\n# s2[j], s2[j + 1] = s2[j + 1], s2[j]\r\n# print('+'.join(s2))\r\n\r\n#\r\n# t = int(input())\r\n# for i in range(t):\r\n# a = input()\r\n# a2 = a.split()\r\n# for f in range(len(a2) - 1):\r\n# for j in range(len(a2) - 1 - f):\r\n# if int(a2[j]) > int(a2[j + 1]):\r\n# a2[j], a2[j + 1] = a2[j + 1], a2[j]\r\n# print(a2[1])\r\n\r\n\r\n# n = int(input())\r\n# string = input()\r\n# n1 = string.count('n')\r\n# n0 = string.count('r')\r\n# print(' 1' * n1, '0 ' * n0)\r\n\r\n\r\na = input()\r\na2 = a.split()\r\nfor i in range(len(a2) - 1):\r\n for j in range(len(a2) - 1 - i):\r\n if int(a2[j]) > int(a2[j + 1]):\r\n a2[j], a2[j + 1] = a2[j + 1], a2[j]\r\nprint(int(a2[2]) - int(a2[0]))\r\n", "# your code goes here\r\na,b,c=map(int,input().split())\r\nmi=min(a,b,c)\r\nma=max(a,b,c)\r\nans=ma-mi\r\nfor i in range(mi,ma+1):\r\n\tif abs(a-i)+abs(b-i)+abs(c-i)<ans:\r\n\t\tans=abs(a-i)+abs(b-i)+abs(c-i)\r\nprint(ans)", "import math\r\na,b,c=map(int,input().split())\r\nd=max(a,b,c)\r\nk=min(a,b,c)\r\nprint(d-k)", "##x = int(input())\r\n##y = int(input())\r\n##z = int(input())\r\nmyList = [int(num) for num in input().split()]\r\nmyList.sort(reverse = False)\r\nprint(abs(myList[0] - myList[1]) + abs(myList[2] - myList[1]))\r\n", "x,y,z=map(int,input().split())\r\nr=x+y+z-(max(x,y,z)+min(x,y,z))\r\nl=abs(x-r)+abs(y-r)+abs(z-r)\r\nprint(l)", "string = input()\nstring = string.split()\npoints = [int(d) for d in string]\n\npoints = sorted(points)\np = points[1]\ndist = (p-points[0]) + (points[2]-p)\nprint(dist)\n \t\t\t \t \t \t \t\t\t \t \t\t \t \t", "x=list(map(int,input().split()))\r\nx.sort()\r\ny=max(x)-int(x[1])\r\nz=int(x[1])-min(x)\r\nf=z+y\r\nprint(f)\r\n", "a,b,c=[int(i) for i in input().split()]\r\nx=min(a,b,c)\r\nif abs(a-x)>=abs(b-x) and abs(a-x)>=abs(c-x):\r\n print(abs(a-x))\r\nelif abs(b-x)>=abs(a-x) and abs(b-x)>=abs(c-x):\r\n print(abs(b-x))\r\nelse:\r\n print(abs(c-x))\r\n", "a,b,c=map(int,input().split())\r\nz=[a,b,c]\r\nz.sort()\r\nprint(z[2] - z[1] + z[1] - z[0])", "w=list(map(int,input().split()))\nn=len(w)\ns=sum(w)\nav=s/n\nma=max(w)\nmi=min(w)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz=d1+d2\nprint(int(z))\n\t \t\t\t \t \t \t\t\t\t\t\t\t \t \t \t", "x1, x2, x3 = map(int, input().split())\r\nx1, x3 = min(x1, x2, x3), max(x1, x2, x3)\r\nprint(x3-x1)", "read=list(map(int, input().split()))\r\nprint(min(abs(read[0]-read[1])+abs(read[0]-read[2]), abs(read[1] - read[2]) + abs(read[1] - read[0]), abs(read[2] - read[1]) + abs(read[2] - read[0])))\r\n\r\n\r\n", "num=[int(i) for i in input().split()]\r\nfor i in range(len(num)):\r\n min_i=i \r\n for j in range(i+1,len(num)):\r\n if num[min_i]>num[j]:\r\n min_i=j \r\n if min_i!=i:\r\n num[i],num[min_i]=num[min_i],num[i]\r\nprint((num[1]-num[0])+(num[2]-num[1]))", "l=list(map(int,input().split()))\na=max(l)\nb=min(l)\nprint(a-b)\n\t \t \t\t\t \t \t\t\t \t \t \t\t \t\t\t\t", "x1, x2, x3 = map(int, input().split())\r\n\r\nmin_coord = min(x1, x2, x3)\r\nmax_coord = max(x1, x2, x3)\r\n\r\nmin_distance = float('inf')\r\n\r\nfor p in range(min_coord, max_coord + 1):\r\n distance = abs(x1 - p) + abs(x2 - p) + abs(x3 - p)\r\n min_distance = min(min_distance, distance)\r\n\r\nprint(min_distance)", "x = list(map(int, input().split()))\r\nx.sort()\r\na = x[0]\r\nb = x[1]\r\nc = x[2]\r\ny = int((b-a)+(c-b))\r\nprint(y)", "x, y, z = input().split()\r\nx, y, z = int(x), int(y), int(z)\r\nl = [x,y,z]\r\ndist = 0\r\nfor i in l:\r\n if i != max(l) and i != min(l):\r\n dist = max(l)-i + i-min(l)\r\nprint(dist)\r\n", "w=list(map(int,input().split()))\r\nn=len(w)\r\ns=sum(w)\r\nav=s/n\r\nma=max(w)\r\nmi=min(w)\r\nd1=abs(av-ma)\r\nd2=abs(av-mi)\r\nz=d1+d2\r\nprint(int(z))", "import sys\r\nnumbers = list(map(int,input().split()))\r\nnumbers.sort()\r\nprint(numbers[2]-numbers[0])\r\n", "x1, x2, x3 = map(int, input().split())\r\n\r\npositions = [x1, x2, x3]\r\npositions.sort()\r\nx = positions[1] - positions[0] + positions[2] - positions[1]\r\nprint(x)", "l=list(map(int,input().split()))\r\nma=max(l)\r\nmi=min(l)\r\nprint(ma-mi)", "x,y,z = map(int,input().split())\r\na = abs(x-y)+abs(x-z)\r\nb = abs(x-y)+abs(y-z)\r\nc = abs(x-z)+abs(y-z)\r\nprint(min(a,b,c))\r\n", "a,b,c=map(int,input().split())\r\ncs=[a,b,c]\r\ncs.sort()\r\nmid=cs[1]\r\ntot=abs(mid-a)+abs(mid-b)+abs(mid-c)\r\nprint(tot)\r\n", "a=list(map(int,input().split()))\r\na=sorted(a)\r\nprint((a[1]-a[0])+(a[2]-a[1]))", "l = list(map(int,input().split(\" \")))\r\nl.sort()\r\ndis =0\r\nfor i in range(len(l)):\r\n\tdis+=abs(l[1]-l[i])\r\nprint(dis)", "def bubbleSort(list):\r\n length = len(list)\r\n for i in range(0, length):\r\n swap = False\r\n for j in range(1, length - i):\r\n if list[j - 1] > list[j]:\r\n temp = list[j - 1]\r\n list[j - 1] = list[j]\r\n list[j] = temp\r\n swap = True\r\n if not swap:\r\n return\r\n return\r\n\r\n\r\nt = input().strip().split(\" \")\r\nx = [int(i) for i in t]\r\n\r\nbubbleSort(x)\r\n\r\ndistance = (x[1] - x[0]) + (x[2] - x[1])\r\nprint(distance)", "arr=list(map(int,input().split()))\r\narr.sort()\r\nx=arr[1]\r\nprint((x-arr[0])+(arr[2]-x))", "s = [int(x) for x in input().split()]\r\nprint(max(s) - min(s))", "a,b,c=map(int,input().split())\r\nd=max(a,b,c)\r\ne=min(a,b,c)\r\nif a!=d and a!=e:\r\n print(abs(b-a)+abs(c-a))\r\nif b!=d and b!=e:\r\n print(abs(a-b)+abs(c-b))\r\nif c!=d and c!=e:\r\n print(abs(b-c)+abs(a-c))", "x1,x2,x3=map(int,input().split())\r\na1=max(x1,x2,x3)\r\na2=min(x1,x2,x3)\r\na3=a1-a2\r\nprint(a3)\r\n", "arr = list(map(int,input().split()))\r\narr.sort()\r\nf = arr[1] - arr[0]\r\nd = arr[2] - arr[1]\r\nprint(f+d)\r\n", "\r\ninp = input()\r\ninp = sorted(list(map(int,inp.split(\" \"))))\r\nprint(inp[2]-inp[1] + inp[1]-inp[0])\r\n", "x = list(map(int, input().split()))\r\nx.sort()\r\nprint(x[2] - x[0])\r\n", "a = [int(i) for i in input().split()]\r\na.sort()\r\nmeet_point = a[1]\r\ndistance = (a[1] - a[0]) + (a[2] - a[1])\r\nprint(distance)", "loc=input().split(' ')\r\nfor i in range(3):\r\n loc[i]=int(loc[i])\r\nloc.sort()\r\nprint(loc[2]-loc[0])", "c = list(map(int, input().split()))\nc.sort()\nmid = len(c) // 2\ndistance = 0\n\nfor e in c:\n if(e < c[mid]):\n d = c[mid] - e\n distance += d\n else:\n d = e - c[mid]\n distance += d\n\nprint(distance)\n\n \t\t\t\t \t\t \t\t \t \t\t\t \t \t\t\t\t\t\t", "import sys\r\na = [int(i) for i in sys.stdin.readline().split()]\r\na.sort()\r\nprint(a[2] - a[0])\r\n", "x=sorted(list(map(int,input().split())))\r\ns=0\r\nfor i in range(0,len(x)-1):\r\n s+=x[i+1]-x[i]\r\nprint(s)\r\n", "a = [int(x) for x in input().split()]\r\na.sort()\r\n\r\n# average = (a[0]+ a[1]+ a[2]) / 3\r\nresult = a[2] - a[0]\r\nprint(int(result))", "x = list(map(int,input().split()))\r\nx.sort()\r\nprint(abs(x[2]-x[1]) + abs(x[1]-x[0]))", "integers = list(map(int,input().split()))\r\nintegers.sort()\r\na, b, c = integers\r\n\r\nmdis = (c - b) + (b - a)\r\nprint(mdis)", "l = list(map(int,input().split(\" \")))\r\nl.sort()\r\nprint((l[2]-l[1])+(l[1]-l[0]))", "list1 =[]\r\n\r\nlist1 += map(int, input().split())\r\n\r\nx = max(list1)\r\ny = min(list1)\r\n\r\nlist1.remove(max(list1))\r\n\r\nsec_largest = max(list1)\r\n\r\nprint((sec_largest - y) + (x - sec_largest))", "x1, x2, x3 = map(int, input().split())\r\ndistance_x1_x2 = abs(x1-x2)\r\ndistance_x1_x3 = abs(x1-x3)\r\ndistance_x2_x3 = abs(x2-x3)\r\n\r\ndistance_to_x1 = distance_x1_x2 + distance_x1_x3\r\ndistance_to_x2 = distance_x1_x2 + distance_x2_x3\r\ndistance_to_x3 = distance_x1_x3 + distance_x2_x3\r\n\r\nprint(min(distance_to_x1, distance_to_x2, distance_to_x3))", "(x1,x2,x3)=map(int,input().split())\r\nminm=min(x1,x2,x3)\r\nmaxm=max(x1,x2,x3)\r\nprint(abs(minm-maxm))\r\n\r\n\r\n", "import sys\r\n#import math\r\n#import datetime\r\n#import numpy as np\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 a = [int(x) for x in sys.stdin.readline().split()]\r\n a.sort()\r\n print(a[2]-a[0])\r\nmain()\r\n", "a,b,c=sorted(list(map(int,input().split())))\r\nprint((c-b)+(b-a))", "m = list(map(int, input().split()))\r\nmin_of_list = min(m)\r\nmax_of_list = max(m)\r\nm.remove(min_of_list)\r\nm.remove(max_of_list)\r\nprint((m[0] - min_of_list) + (max_of_list - m[0]))\r\n", "from sys import stdin, stdout\r\n\r\na, b, c = stdin.readline().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nr_max = max(a,b,c)\r\nr_min = min(a,b,c)\r\nmid = a+b+c-r_min-r_max\r\nanswer = 201\r\nfor i in range(r_min, r_max, 1):\r\n distance = r_max - r_min\r\n if distance < answer:\r\n answer = distance\r\n\r\nprint(answer)\r\n", "inText = input().split()\na = int(inText[0])\nb = int(inText[1])\nc = int(inText[2])\nvalou = 0;\n\nif(1<=a<=100) and (1<=b<=100) and (1<=c<=100):\n for i in inText:\n cont = 0;\n for j in inText:\n # ads convierte los valor en enteros positivos(Valor absoluto)\n cont += abs(int(i) - int(j))\n\n if(cont < valou or valou == 0):\n valou = cont \n\nprint(valou)\n\t \t \t\t \t\t\t \t \t \t\t\t\t\t\t\t", "array = input().split()\r\nint_array = [int(i) for i in array]\r\n\r\nans = max(int_array)-min(int_array)\r\n\r\nprint(ans)", "friends = list(map(int, input().split()))\nprint(max(friends) - min(friends))\n", "a,b,c=map(int,input().split())\r\nm=(a+b+c)//3\r\nminimum=min(a,b,c)\r\nmaximum=max(a,b,c)\r\nprint(maximum-minimum)", "x=[int(_) for _ in input().split()]\r\nprint(max(x)-min(x))\r\n\r\n", "friends=sorted(list(map(int,input().split())))\r\nprint((friends[2]-friends[1])+(friends[1]-friends[0]))\r\n", "l=[int(x) for x in input().split()]\nl.sort()\ns=(l[1]-l[0])+(l[2]-l[1])\nprint(s)\n \t\t\t \t \t \t\t\t\t\t\t \t\t \t \t\t\t \t \t", "a=input().split()\r\ni=0\r\nwhile i<3:\r\n a[i]=int(a[i])\r\n i+=1\r\na.sort()\r\nprint((a[1]-a[0])+(a[2]-a[1]))\n# Fri Jul 07 2023 11:42:09 GMT+0300 (Moscow Standard Time)\n", "s=input().split()\r\nx=int(s[0])\r\ny=int(s[1])\r\nz=int(s[2])\r\nm=max(x,y,z)\r\nn=min(x,y,z)\r\nprint(m-n)", "a,b,c=map(int,input().split())\r\ns=[]\r\ns.append(abs(a-b)+abs(a-c))\r\ns.append(abs(b-a)+abs(b-c))\r\ns.append(abs(c-a)+abs(c-b))\r\n\r\nprint(min(s))\r\n ", "import sys\r\nimport math\r\n\r\n\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\n#sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef main():\r\n x = list(map(int, sys.stdin.readline().split()))\r\n x.sort()\r\n answer = abs(x[0]-x[1])+abs(x[2]-x[1])\r\n print(answer)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "d=list(map(int,input().split()))\r\nd.sort()\r\nprint(d[1]-d[0]+d[2]-d[1])\r\n", "input = list(map(eval, input().split()))\nordered = input.sort()\n\ndistance = input[1] - input[0] + input[2] - input[1]\n\nprint(distance)\n\t \t \t\t \t\t\t\t\t\t \t \t\t\t\t\t \t \t", "a,b,c = map(int,input().split())\nprint(max(a,b,c) - min(a,b,c))", "import sys\r\n\r\na, b, c = map(int, sys.stdin.readline().split())\r\n\r\nmin_val = min(a, b, c)\r\nmax_val = max(a, b, c)\r\n\r\nprint(max_val - min_val)\r\n", "\r\nx= list(map(int,input().split()))[:3]\r\nx.sort()\r\nres= x[len(x)-1]-x[0]\r\nprint(res)", "x=[int(i) for i in input().split()]\r\nx.sort()\r\nsum=(x[1]-x[0])+(x[2]-x[1])\r\nprint(sum)", "# A - The New Year: Meeting Friends\r\n\r\nx = [int(i) for i in input().split()]\r\nx.sort()\r\nprint(x[1] - x[0] + x[2] - x[1])", "a,b,c=map(int,input().split())\r\nd=abs(a-b)\r\ne=abs(b-c)\r\nf=abs(c-a)\r\nlow=min(d,e,f)\r\nif(low==d):\r\n sec=min(e,f)\r\nelif low==e:\r\n sec=min(d,f)\r\nelse:\r\n sec=min(d,e)\r\nprint(low+sec) \r\n \r\n ", "input_line = input()\ninput_list = input_line.split()\na = int(input_list[0])\nb = int(input_list[1])\nc = int(input_list[2])\n\nlst = [a, b, c]\nprint(max(lst) - min(lst))\n\t \t \t \t\t\t \t \t\t\t \t \t", "x,y,z = map(int,input().split())\r\n\r\nd1 = max(x,y)\r\nd1 = max(d1,z)\r\nd2 = min(x,y)\r\nd2 = min(d2,z)\r\nprint(d1-d2)\r\n\r\n", "x1, x2, x3 = map(int, input().split())\r\nmi = min(x1, x2, x3)\r\nma = max(x1, x2, x3)\r\nsr = x1 + x2 + x3 - mi - ma\r\nprint((ma - sr) + (sr - mi))", "x1, x2, x3 = map(int, input().split())\n\nmid= sorted([x1, x2, x3])[1] \n\ndistances = [abs(x - mid) for x in [x1, x2, x3]] \n\nmin= sum(distances) \n\nprint(min)\n\t\t \t\t\t \t \t \t\t \t\t\t \t\t \t \t\t \t \t", "def min_total_distance(x1, x2, x3):\r\n sorted_coords = sorted([x1, x2, x3])\r\n middle_point = sorted_coords[1] \r\n total_distance = abs(x1 - middle_point) + abs(x2 - middle_point) + abs(x3 - middle_point)\r\n return total_distance\r\nx1, x2, x3 = map(int, input().split())\r\nresult = min_total_distance(x1, x2, x3)\r\nprint(result)\r\n", "l = list(map(int,input().split()))\nprint(max(l) - min(l))\n\t\t \t \t \t\t\t\t \t \t \t\t \t \t\t", "# n = int(input())\na, b, c = map(int, input().split())\nprint(max(max(a, b), c) - min(min(a, b), c))\n# while n != 0:\n\n# n -= 1\n", "a=list(map(int,input().split()))\r\na.sort()\r\nprint(abs((a[0])-a[1])+abs((a[2])-a[1]))\r\n", "x1, x2, x3 = map(int, input().split())\r\nc = [x1, x2, x3]\r\nc.sort()\r\nmedian = c[1]\r\nd = [abs(x - median) for x in c]\r\nm = sum(d)\r\nprint(m)", "x = list(map(int, input().split()))\r\nmax_x, min_x, mid = max(x), min(x), 0\r\n\r\nfor i in x:\r\n if i > min_x and i < max_x:\r\n mid = i\r\n\r\nprint((max_x-mid)+(mid-min_x))", "a = list(map(int,input().split()))\r\nmax = max(a)\r\nmin = min(a)\r\nk = 0 \r\nfor x in a :\r\n if x != max and x != min :\r\n k = x \r\n\r\nans = 0 \r\nans+= max - k \r\nans+= k - min\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 29 11:04:58 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\np=list(map(int,input().split()))\r\nprint(max(p)-min(p))", "x=list(map(int,input().split()))\r\nc=max(x)\r\nc1=min(x)\r\nv=c-c1\r\nprint(v)", "import sys\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n# sys.stderr = open(\"error.txt\", \"w\")\r\n# # your remaining code\r\n\r\nx= list(map(int,input().split()))\r\n\r\nx.sort()\r\n\r\nprint( abs(x[1]-x[0]) + abs(x[2]-x[1]) )\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nlist1=[a,b,c]\r\nlist1.sort()\r\nprint((list1[1]-list1[0])+list1[2]-list1[1])\r\n\r\n", "x1, x2, x3 = list(map(int, input().split()))\r\nx = []\r\nx.append(x1)\r\nx.append(x2)\r\nx.append(x3)\r\nx = sorted(x)\r\nres = 0\r\nres += x[1] - x[0]\r\nres += x[2] - x[1]\r\nprint(res)\r\n\r\n", "f1=list(map(int,input().split()))\r\nf1.sort(reverse=True)\r\nz=f1[0]-f1[1]\r\nx=f1[1]-f1[2]\r\nprint(z+x)", "X = list(map(int, input().split()))\r\nX = sorted(X)\r\nprint(X[1] - X[0] + X[2] - X[1])\r\n", "a = list(map(int,input().split(\" \")))\r\na= sorted(a)\r\nprint(a[2]-a[0])\r\n", "l=list(map(int, input().split()))\r\nl.sort()\r\nprint(l[1]-l[0]+l[2]-l[1])", "# The New Year: Meeting Friends\r\n\r\nnums = [int(x) for x in input().split(' ')]\r\nminimo = min(nums)\r\nmaximo = max(nums)\r\nnums.remove(minimo)\r\nnums.remove(maximo)\r\nprint((nums[0] - minimo) + (maximo - nums[0]))\r\n", "# Read input values\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the coordinates\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\n\r\n# Calculate the minimum total distance\r\ndistance1 = coordinates[1] - coordinates[0] # Distance between friend 1 and 2\r\ndistance2 = coordinates[2] - coordinates[1] # Distance between friend 2 and 3\r\ntotal_distance = distance1 + distance2\r\n\r\n# Print the result\r\nprint(total_distance)\r\n", "x,y,z = map(int,input().split())\r\n\r\ntemp = [x,y,z]\r\n\r\ntemp.sort()\r\n\r\nprint(abs(temp[1]-temp[0]+abs(temp[1]-temp[2])))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k, z = map(int, input().split())\r\ns = list()\r\ns.append(n)\r\ns.append(k)\r\ns.append(z)\r\nprint(max(s) - min(s))\r\n", "x = [int(x) for x in input().split()]\r\nsteps = [0 for i in range(3)]\r\nsteps[0] = abs(x[1]-x[0]) + abs(x[2]-x[0])\r\nsteps[1] = abs(x[0]-x[1]) + abs(x[2]-x[1])\r\nsteps[2] = abs(x[0]-x[2]) + abs(x[1]-x[2])\r\n\r\nprint(min(steps))", "num = list(map(int, input().split()))\r\n\r\nnum.sort()\r\n\r\nprint(abs(num[1]-num[0]) + abs(num[1]-num[2]))", "from math import ceil\r\n\r\nn = list(map(int, input().split()))\r\n\r\nmax_n = max(n)\r\nmin_n = min(n)\r\n\r\nfor i in n:\r\n if i != min_n and i != max_n:\r\n centr = i\r\n\r\nprint(max_n - centr + centr - min_n)", "x1, x2, x3 = map(int, input().split())\r\ncoordinates = sorted([x1, x2, x3])\r\nprint(coordinates[2] - coordinates[0])\r\n\r\n\r\n", "s = [0, 0, 0]\r\ns[0], s[1], s[2] = map(int, input().split())\r\ns.sort()\r\nprint(s[2] - s[0])\r\n", "def main(x1, x2, x3):\r\n n = float(\"inf\")\r\n\r\n for i in range(1, max(x1, x2, x3) + 1):\r\n n = min(n, abs(x1 - i) + abs(x2 - i) + abs(x3 - i))\r\n\r\n return n\r\n\r\nif __name__ == \"__main__\":\r\n x1, x2, x3 = map(int, input().split())\r\n\r\n print(main(x1, x2, x3))", "a,b,c=map(int,input().split())\narr=[a,b,c]\nm=min(arr)\nma=max(arr)\nprint(ma-m)\n \t \t \t \t\t\t \t\t \t \t\t\t \t \t", "nums = list(map(int, input().split()))\nprint (max(nums) - min(nums))\n\n \t\t\t\t \t \t \t \t \t\t\t \t \t\t\t", "a, b, c = [int(x) for x in input().split()]\r\n\r\nmindis = 100\r\nfor i in range(1, 101):\r\n mindis = min(mindis, abs(a-i) + abs(b-i) + abs(c-i))\r\n\r\nprint(mindis)\r\n\r\n \r\n", "a = [int(i) for i in input().split()]\r\n\r\na.sort()\r\n\r\nprint(abs(a[0] - a[1]) + abs(a[1] - a[2]))", "x, y, z = list(map(int,input().split(\" \")))\r\nif(x<y<z):\r\n print((y-x) + (z-y))\r\nelif(x<z<y):\r\n print((z-x) + (y-z))\r\nelif(y<x<z):\r\n print((x-y) + (z-x))\r\nelif(y<z<x):\r\n print((z-y) + (x-z))\r\nelif(z<x<y):\r\n print((x-z) + (y-x))\r\nelif(z<y<x):\r\n print((y-z) + (x-y))\r\n", "l=list(map(int,input().split()))\r\nl.sort()\r\nl.reverse()\r\nprint(l[0]-l[1]+(l[1]-l[2]))", "num = sorted([int(i) for i in input().split()])\nprint(num[1]-num[0] + num[2]-num[1])", "list1 = list(map(int, input().split(\" \")))\r\nlist2 = sorted(list1)\r\nprint((list2[1]-list2[0]) + (list2[2]-list2[1]))", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, OCaml, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nli = list(map(int,input().split()))\nli=sorted(li)\n# print(a)\nsums=(li[1]-li[0])+(li[2]-li[1])\nprint(sums)\n", "a=list(map(int,input().split()))\r\nx=max(a)\r\ny=min(a)\r\nprint(x-y)", "#723A - The New Year: Meeting Friends\r\nx = list(map(int, input().split()))\r\nd = []\r\nfor i in range(len(x)):\r\n d.append(abs(x[i] - x[i - 1]))\r\nprint(max(d))", "a,b,c=map(int,input().split())\r\nab=abs(b-a)\r\nbc=abs(c-b)\r\nac=abs(c-a)\r\nmin_distance=min(ab+bc,ab+ac,bc+ac)\r\nprint(min_distance)", "a, b, c = map(int, input().split())\r\nprint(max(max(a, b), c) - min(min(a, b), c))\r\n", "x1,x2,x3=map(int,input().split())\ny3=max(x1,x2,x3)\ny1=min(x1,x2,x3)\nb=y3-y1\nprint(b)\n\n \n \n \n \n \n# Fri Jul 07 2023 13:22:01 GMT+0300 (Moscow Standard Time)\n", "\r\nnums = [int(x) for x in input().split()]\r\nx3 = nums[2]\r\nx2 = nums[1]\r\nx1 = nums[0]\r\n\r\ndef ab(num1, num2):\r\n if num1>num2:\r\n return num1-num2\r\n else:\r\n return num2-num1\r\n\r\nminimum = 1000\r\nfor n in range(1,max(nums) ):\r\n if (ab(n, x1)+ab(n, x2)+ab(n, x3)) <minimum:\r\n minimum = (ab(n, x1)+ab(n, x2)+ab(n, x3))\r\nprint(minimum)\r\n ", "x1, x2, x3 = list(map(int, input().split()))\r\nd = max(x1, x2, x3) - min(x1, x2,x3)\r\nprint(d)", "*b,=map( int,input().split()); print( max(b)-min(b))", "n=list(map(int,input().split()))\r\nn.sort()\r\na,b,c=n\r\no=0\r\no+=c-b\r\no=o+(b-a)\r\nprint(o)", "b=list(map(int,input().split()))\r\na=abs(b[0]-b[1])\r\nc=abs(b[1]-b[2])\r\nd=abs(b[0]-b[2])\r\n\r\nl=[a,c,d]\r\nl.sort()\r\nprint(l[0]+l[1])\r\n", "x1, x2, x3 = map(int, input().split())\r\nans = 300\r\nfor i in range(0, 101):\r\n r = abs(i - x1) + abs(i - x2) + abs(i - x3)\r\n ans = min(ans, r)\r\nprint(ans)", "x1, x2, x3 = map(int, input().split())\r\n\r\ndef solution(x1, x2, x3):\r\n dist = max(x1, x2, x3) - min(x1, x2, x3)\r\n return dist\r\n\r\nprint(solution(x1, x2, x3))", "li=list(map(int,input().split()))\r\nli.sort()\r\nprint(li[2]-li[0])\r\n", "x=input()\r\nx=x.split()\r\nfor v in range(3):\r\n x[v]=int(x[v])\r\nfor i in range(3):\r\n for j in range(2):\r\n if x[j]>x[j+1]:\r\n t=x[j]\r\n x[j]=x[j+1]\r\n x[j+1]=t\r\nr=(x[1]-x[0])+(x[2]-x[1])\r\nprint(r)", "x1,x2,x3=map(int,input().split())\r\nsorted_values = sorted([x1, x2, x3])\r\nx1, x2, x3 = sorted_values\r\nans=abs(x1-x2)+abs(x2-x3)\r\nprint(ans)", "a, b, c = list(map(int, input().split()))\r\nd_1 = abs(a - b) + abs(a - c)\r\nd_2 = abs(a - b) + abs(b - c)\r\nd_3 = abs(c - b) + abs(a - c)\r\nprint(min(d_1, d_2, d_3))", "def meet(friends):\n friends.sort()\n return friends[2] - friends[0]\n\nfriends = input()\nfriends = friends.split(\" \")\nfor i in range(len(friends)):\n friends[i] = int(friends[i])\nprint(meet(friends))\n\t \t \t\t \t \t \t\t\t\t\t \t \t \t", "list1=list(map(int, input().split()))\r\nlist1.sort()\r\nprint(abs(list1[0]-list1[1])+abs(list1[2]-list1[1]))\r\n", "x1, x2, x3 = sorted(map(int, input().split()))\r\n\r\nd1 = abs((x3-x1)+(x2-1))\r\nd2 = abs((x2-x1)+(x3-x2))\r\n\r\nprint(min(d1,d2))", "n = list(map(int, input().split()))\r\n\r\nn.sort()\r\n\r\nprint((n[1]-n[0])+(n[2]-n[1]))", "l=input().split()\r\nn=list(map(int,l))\r\nn.sort()\r\nprint(n[2]-n[0])", "# https://codeforces.com/problemset/problem/723/A\n# imper - \n\n \ndef isol(x1, x2, x3):\n mx = max(x1, x2, x3)\n mn = min(x1, x2, x3)\n return mx-mn\n\n\ndef solution():\n x1, x2, x3 = [int(x) for x in input().split()]\n print(isol(x1, x2, x3))\n\nsolution()", "arr = list(map(int , input().split()))\r\narr.sort()\r\nprint(arr[2] - arr[0])", "x = list(map(int,input().split()))\r\n\r\nc = max(x)\r\nv = min(x)\r\na = 0\r\n\r\nfor i in range(3):\r\n if x[i] < c and x[i] > v:\r\n x[i] += a\r\n else:\r\n pass\r\n\r\nm = c-a\r\nn = a-v\r\nprint(m+n)", "string = input()\r\nstring = string.split()\r\npoints = [int(d) for d in string]\r\n\r\npoints = sorted(points)\r\np = points[1]\r\ndist = (p-points[0]) + (points[2]-p)\r\nprint(dist)\r\n \t\t\t \t \t \t \t\t\t \t \t\t \t \t", "b=list(map(int,input().split()))\nb.sort()\nprint(b[2]-b[0])\n \t \t \t\t\t\t \t\t \t \t\t\t \t", "lst = [int(x) for x in input().split()]\nlst.sort()\nprint((lst[1]-lst[0]) + (lst[2]-lst[1]))\n\t \t \t\t\t\t \t\t \t\t \t \t \t\t", "xS = [int(t) for t in input().split()]\r\n\r\ntravel = max(xS) - min(xS)\r\n# travel = 0\r\n\r\n# for i in xS:\r\n# travel += abs(meetingPoint - i)\r\n\r\nprint(travel)", "inp = list(map(int, input().split()))\r\ninp.sort()\r\navg = inp[1]\r\nx = sum([abs(i-avg)for i in inp])\r\nprint(int(x))\r\n", "a,b,c=map(int,input().split())\r\ndist=sorted([a,b,c])\r\nmeet_point=dist[1]\r\ndist_travel=((dist[1]-dist[0])+(dist[2]-dist[1]))\r\nprint(dist_travel)", "a,b,c=map(int,input().split())\r\nd=[a,b,c]\r\nd.sort()\r\nprint(d[2]-d[1]+d[1]-d[0])\r\n", "i = [int(x) for x in input().split(' ')]\r\n\r\nx = max(i)\r\ny = min(i)\r\ni.remove(max(i))\r\ni.remove(min(i))\r\n\r\nprint(x-i[0] + i[0]-y)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx = list(map(int, input().split()))\r\nans = 305\r\nfor i in range(105):\r\n c = 0\r\n for j in x:\r\n c += abs(i - j)\r\n ans = min(ans, c)\r\nprint(ans)", "a, b, c = map(int,input().split())\r\nmy_list = [a, b, c]\r\nmin_list = min(my_list)\r\nmax_list = max(my_list)\r\nprint(max_list - min_list)", "def main(): \r\n \r\n \r\n a = sorted((map(int, open(0).read().split())))\r\n print(a[1] - a[0] + a[2] - a[1])\r\n\r\nmain()", "x1,x2,x3=map(int,input().split())\r\nl=[x1,x2,x3]\r\nl.sort()\r\nd1=l[2]-l[1]\r\nd2=l[1]-l[0]\r\nprint(d1+d2)\r\n\r\n", "x=list(map(int,input().split()))\r\nmax1=max(x)\r\nmin1=min(x)\r\npoint=0\r\nfor i in x:\r\n if i!=min1 and i!=max1:\r\n point=i\r\n break\r\nprint(abs(min1-point)+abs(max1-point))", "def main():\n x1, x2, x3 = (int(_) for _ in input().split())\n\n points = [x1, x2, x3]\n points.sort()\n\n mid_point = points[1]\n\n distance = abs(x1 - mid_point) + abs(x2 - mid_point) + abs(x3 - mid_point)\n\n print(distance)\n\n\nif __name__ == \"__main__\":\n main()\n", "a = list(map(int,input().split()))\r\nmin = min(a)\r\nmax = max(a)\r\nfor i in a:\r\n if i != min:\r\n if i != max:\r\n b = i\r\nch1 = max - b\r\nch2 = b - min\r\nprint (ch1+ch2)", "a,b,c=map(int,input().split())\r\nd=[a,b,c]\r\nd.sort()\r\nprint(d[-1]-d[0])", "ls = list(map(int, input().split()))\r\nls.sort()\r\nprint(ls[2]-ls[0])", "distances= list(map(int, input().split())) \r\ndistances= sorted(distances)\r\nresult=(distances[2] - distances[1]) + (distances[1] - distances[0])\r\nprint(result) ", "x = list(map(int,input().split()))\r\nx.sort()\r\na = x[0]\r\nb = x[1]\r\nc = x[2]\r\nprint((c-b)+(b-a))", "x1, x2, x3 = map(int, input().split())\r\nsssr = sorted([x1, x2, x3])\r\nif sssr[0] < x2 < sssr[2]:\r\n hitler = sssr[2] - sssr[0]\r\nelse:\r\n hitler = max(sssr[2] - x2, x2 - sssr[0])\r\nprint(hitler)", "a = list(map(int, input().split()))\r\nmin_value = min(a)\r\nmax_value = max(a)\r\n\r\nx = (min_value + max_value) // 2\r\nprint((max_value-x) + (x - min_value))", "x1,x2,x3=map(int,input().split())\r\nli=[]\r\nli.append(x1)\r\nli.append(x2)\r\nli.append(x3)\r\nli.sort()\r\na,b,c=li\r\nprint(abs(b-a)+abs(b-c))", "diss = list(map(int ,input().split()))\r\ndiss.sort(reverse=True)\r\nx=0\r\nfor i in range(len(diss) - 1) :\r\n x+= diss[i] -diss[i+1]\r\n\r\nprint(x)", "a, b, c = [int(n) for n in input().split()]\r\nmaximum = max([a, b, c])\r\nminimum = min([a, b, c])\r\nprint(maximum - minimum)", "\r\nl=sorted(list(map(int,input().split())))\r\na=l[1]-l[0]\r\nb=l[2]-l[1]\r\n\r\nprint(a+b)\r\n", "a,b,c = map(int,input().split())\r\n\r\n\r\ndef helper(a,b,c):\r\n \"\"\"\r\n a::int fixed point\r\n b::int the first traveling strart point\r\n c::int the second traveling start point\r\n \"\"\"\r\n d1 = abs(a-b)\r\n d2 = abs(a-c)\r\n return d1+d2\r\n\r\nplans = [helper(a,b,c), helper(b,a,c),helper(c,a,b)]\r\nprint(min(plans))", "a=[int(x) for x in input().split()]\r\na.sort()\r\nprint(a[2]-a[0])", "#723A\r\nn=list(map((int),input().split()))\r\nprint(max(n)-min(n))", "hl = list(map(int,input().split()))\r\ndef dis(startpoint, i):\r\n return abs(startpoint - i)\r\ndisl = set()\r\n# for j in range(3):\r\n# temp = 0\r\n# for i in range(3):\r\n# if j !=2:\r\n# temp += dis(hl[i] , hl[j] , hl[j+1])\r\n# else:\r\n# temp += dis(hl[i], hl[2], hl[0])\r\n# disl.add(temp)\r\n# print(min(disl)) \r\nfor i in range(min(hl),max(hl)):\r\n disl.add(dis(hl[0],i)+dis(hl[1],i)+dis(hl[2],i))\r\nprint(min(disl))", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nprint(l[2]-l[0])", "import math\r\ndef year(l):\r\n mi=max(l)\r\n ma=min(l)\r\n l.remove(max(l))\r\n l.remove(min(l))\r\n i=l[0]\r\n \r\n s=(i-mi)+(ma-i)\r\n\r\n return abs(s)\r\n \r\nl=list(map(int,input().split()))\r\nprint(year(l))", "l=list(map(int,input().split()))\r\nl.sort()\r\nx1=l[2]-l[1]\r\nx2=l[1]-l[0]\r\nprint(x1+x2)\r\n", "x=list(map(int,input().split()))\r\nx.sort()\r\na=x[1]\r\nprint(abs(x[0]-a)+abs(x[1]-a)+abs(x[2]-a))", "a,b,c = map(int,input().split())\na,b,c = a-min(a,b,c),b-min(a,b,c),c-min(a,b,c)\nmn = 10**7\nfor i in range(max(a,b,c)+1):\n if abs(i-a)+abs(i-b)+abs(i-c) < mn:\n mn = abs(i-a)+abs(i-b)+abs(i-c)\nprint(mn)\n\n# Fri Jul 07 2023 14:10:03 GMT+0300 (Moscow Standard Time)\n", "a, b, c = map(int, input().split())\r\nd = a+b+c\r\ne = d - max(a,b,c) - min(a,b,c)\r\nprint(e-min(a,b,c)+max(a,b,c)-e)\r\n", "coordinates = list(map(int, input().split()))\r\ncoordinates.sort()\r\n\r\ndistance = coordinates[2] - coordinates[0]\r\n\r\nprint(distance)\r\n", "n = list(map(int, input().split()))\r\nn.sort()\r\na = n[0]\r\nb = n[1]\r\nc = n[2]\r\nprint((b - a) + (c - b))\r\n", "l =list(map(int,input().strip().split()))\r\nl.sort()\r\nb=l[1]\r\nc=0\r\nfor i in l:\r\n # print(m[i])\r\n c+=abs(i-b)\r\nprint(c)", "amigos = list(map(int, input().split()))\nmenor_caminho = []\n\n# Bloco 01\n\namigo_comparador = amigos[0]\nsoma_comparador = abs(amigos[0] - amigos[1]) + abs(amigos[0] - amigos[2])\nmenor_caminho.append(soma_comparador)\n\n\n# Bloco 02\n\namigo_comparador = amigos[1]\nsoma_comparador = abs(amigos[1] - amigos[0]) + abs(amigos[1] - amigos[2])\nmenor_caminho.append(soma_comparador)\n\n\n# Bloco 03\n\namigo_comparador = amigos[2]\nsoma_comparador = abs(amigos[2] - amigos[0]) + abs(amigos[2] - amigos[1])\nmenor_caminho.append(soma_comparador)\n\nprint(min(menor_caminho))\n", "x = [int(x) for x in input().split(\" \")]\r\nx.sort()\r\n\r\nprint(x[2]-x[0])", "a,b,c=map(int,input().split())\r\nb=max(a,b,c)-min(a,b,c)\r\nprint(b)\r\n", "lst =[]\r\ns=0\r\nfor i in (map(int,input().split())):\r\n lst.append(i)\r\n\r\nma = max(lst)\r\nmi = min(lst)\r\nfor i in range(3):\r\n if lst[i]!=ma and lst[i]!=mi:\r\n s=abs(lst[i]-ma)+abs(lst[i]-mi)\r\nprint(s)", "li=sorted([int(i) for i in input().split()])\r\nprint(li[-1]-li[0])", "a , b , c = map(int,(input().split()))\r\nl=[a,b,c]\r\nl.sort()\r\nprint(l[1]-l[0]+l[-1]-l[1]) \r\n\r\n", "x,y,z = input().split()\nx = int(x)\ny = int(y)\nz = int(z)\n\nif x>y and x>z:\n bigger = x\nelif y>x and y>z:\n bigger = y\nelse:\n bigger = z\n\nif x<y and x<z:\n smaller = x\nelif y<x and y<z:\n smaller = y\nelse:\n smaller = z\n\nans = bigger - smaller\nprint(ans)", "from sys import stdin\r\nfrom math import ceil\r\na,b,c=sorted(map(int,stdin.readline().split()))\r\nprint(c-a)\r\n", "l = list(map(int, input().split()))\r\nl.sort(reverse=True)\r\nq = l[0] - l[1]\r\nq += l[1] - l[2]\r\nprint(q)", "s = list(map(int,input().split()))\r\ns.sort()\r\nprint((s[1]-s[0])+(s[2]-s[1])) ", "n=list(map(int,input().split()))\r\nn=sorted(n)\r\nprint(n[2]-n[0])", "coordinates = list(map(int,input().split()))\r\ncoordinates.sort()\r\nprint(coordinates[2]-coordinates[0])", "def min_total_distance(x1, x2, x3):\r\n points = [x1, x2, x3]\r\n points.sort()\r\n return points[2] - points[0]\r\n\r\n# Example usage:\r\nif __name__ == \"__main__\":\r\n x1, x2, x3 = map(int, input().split())\r\n print(min_total_distance(x1, x2, x3))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 12 17:05:52 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\n\r\nhome = [int(x) for x in input().split()]\r\nhome.sort()\r\nprint(home[2]-home[0])", "a=list(map(int,input().split()))\r\na.sort()\r\nprint(max(abs(a[1]-a[0]),abs(a[2]-a[0]),abs(a[2]-a[1])))\r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nx,y,z = li()\r\nans = float('inf')\r\n\r\nfor i in range(1,101):\r\n ans = min(ans,abs(i-x)+abs(i-y)+abs(i-z))\r\nprint(ans)", "str_input = input()\r\ndata_list = str_input.split()\r\n\r\nx_list = []\r\nfor data in data_list:\r\n x_list.append(int(data))\r\n\r\nx_list.sort()\r\nprint(x_list[-1] - x_list[0])", "a,b,c=map(int,input().split())\r\nl=[a,b,c]\r\nl.sort()\r\nx=l[1]-l[0]\r\ny=l[2]-l[1]\r\nprint(x+y)", "n = list(map(int,input().split()))\r\nn.sort()\r\na = max(n)\r\nb = min(n)\r\nprint(a - b)", "arr = sorted(list(map(int,input().split())))\r\nans = 0\r\nfor i in range(1,len(arr)):\r\n ans += (arr[i]-arr[i-1])\r\nprint(ans)", "ip=input()\r\nx1=[]\r\nstr=\"\"\r\nfor x in ip:\r\n if(x==' '):\r\n x1.append(int(str))\r\n str=\"\"\r\n else:\r\n str=str+x\r\n\r\nx1.append(int(str))\r\n\r\nx1.sort()\r\nmid=x1[1]\r\nans=0\r\nfor x in x1:\r\n ans=ans+abs(mid-x)\r\nprint(int(ans))\r\n", "*a,=sorted(map(int,input().split()))\r\nprint(a[2]-a[1]+a[1]-a[0])\r\n", "a, b, c = map(int, input().split())\r\nmini = 301\r\nfor i in range(min(a, b, c), max(a, b, c)+1):\r\n if abs(i-a)+abs(i-b)+abs(i-c) < mini:\r\n mini = abs(i-a)+abs(i-b)+abs(i-c)\r\nprint(mini)", "import sys\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\r\ndef MI(): return map(int, sys.stdin.readline().rstrip().split())\r\ndef SI(): return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef main():\r\n f = LI()\r\n f.sort()\r\n print(abs(f[0] - f[1]) + abs(f[2] - f[1]) )\r\nif __name__ == \"__main__\":\r\n main()", "x1 = [int(x) for x in input().split()]\r\nx_max = max(x1)\r\nx_min = min(x1)\r\nfor i in range(0, 3):\r\n if x1[i] == x_max:\r\n x_max_t = x1[i]\r\n elif x1[i] == x_min:\r\n x_min_t = x1[i]\r\n else:\r\n x_mid = x1[i]\r\nprint((x_mid - x_min_t) + abs(x_mid - x_max_t))", "l = list(map(int,input().split()))\r\nl.sort()\r\na = abs(l[1]-l[0])\r\nb = abs(l[1]-l[2])\r\nprint(a+b)", "x = list(map(int, input().split()))\r\n\r\nmaximum = max(x)\r\nminimum = min(x)\r\nprint(maximum-minimum)", "x1,x2,x3=(map(int,input().split()))\r\nv=[];v.append(x1);v.append(x2);v.append(x3)\r\nprint(max(v)-min(v))", "lst = list(map(int, input().split()))\r\nlst.sort()\r\nprint((lst[1]-lst[0])+(lst[2]-lst[1]))", "lst = list(map(int, input().split()))\ntotal_diff = 0\nlst.sort()\nfor i in range(len(lst)-1):\n total_diff += lst[i+1] - lst[i]\nprint(total_diff)\n\n \t\t \t\t \t\t \t\t\t\t \t\t\t\t \t\t\t", "a,b,c=[int(a) for a in input().split()]\r\nd1=abs(a-b)\r\nd2=abs(a-c)\r\nd3=abs(c-b)\r\nx=d1+d2\r\ny=d1+d3\r\nz=d2+d3\r\nlist=[x,y,z]\r\nprint(min(list))", "l = list(map(int,input().split()))\r\nl.sort()\r\na = l[0]\r\nb = l[1]\r\nc = l[2]\r\nprint(c-a)\r\n", "p1, p2, p3 = map(int, input().split())\n\n# Calculate the final power\nfinal_power = max(p1, p2, p3) - min(p1, p2, p3)\n\nprint(final_power)\n\n\n \t\t\t\t \t \t \t\t \t\t \t\t \t \t\t", "x1,x2,x3 = map(int, input().split())\r\nsum_1 = x1 + x2 + x3\r\nd = abs(max(x1,x2,x3) + min(x1,x2,x3) - sum_1)\r\ns = abs(max(x1,x2,x3) - d) + abs(min(x1,x2,x3) - d)\r\nprint(s)", "x1, x2, x3 = map(int, input().split())\r\nmedian = sorted([x1, x2, x3])[1]\r\ndistance1 = abs(x1 - median)\r\ndistance2 = abs(x2 - median)\r\ndistance3 = abs(x3 - median)\r\ntotal_distance = distance1 + distance2 + distance3\r\nprint(total_distance)", "x1,x2,x3=map(int,input().split())\r\na=min(x1,x2,x3)\r\nb=max(x1,x2,x3)\r\n\r\nprint(b-a)", "#### The average of the three points would be the point of minimum distance\r\nx1,x2,x3=[int(x) for x in input().split(' ')]\r\n\r\nprint(max(x1,x2,x3)-min(x1,x2,x3))", "\r\narr_nums = sorted([int(x) for x in input().split()])\r\nprint(arr_nums[2] - arr_nums[0])\r\n", "k=list(map(int, input().split()))\r\nprint(max(k)-min(k))\r\n", "a,b,c=map(int,input().split())\r\nk=abs(a-b)\r\nl=abs(b-c)\r\nm=abs(c-a)\r\nprint(max(k,l,m))", "l=list(map(int,input().split()))\r\nl.sort()\r\nprint(abs(l[1]-l[0])+abs(l[2]-l[1]))", "a = list(map(int,input().split()))\nprint(max(a)-min(a))\n \t\t \t\t \t\t \t\t \t\t \t\t \t\t", "*x,=map(int,input().split())\r\nprint(max(x)-min(x))", "\r\nn = list(map(int, input().split()))\r\nprint(max(n) - min(n))", "a = list(map(int, input().split(\" \")))\r\nb = min(a)\r\nc = max(a)\r\nz = int(a.index(b))\r\nx = int(a.index(c))\r\nif z!= 0 and x!=0:\r\n d = int(a[0])\r\nif z!= 1 and x!=1:\r\n d = int(a[1])\r\nif z != 2 and x != 2:\r\n d = int(a[2])\r\nprint((d-b)+(c-d))", "x = [int(i) for i in input().split()]\r\n\r\nprint(max(x)-min(x))", "x=list(map(int,input().split()))\r\nx.sort()\r\nprint(abs((x[0] - x[1]) + (x[1] - x[2])))", "n = input().split()\r\ng = []\r\notvet = 0\r\nfor i in range(len(n)):\r\n a = int(n[i])\r\n g.append(a)\r\nminn = min(g)\r\nmaxx = max(g)\r\nc = minn - maxx\r\nprint(abs(c))", "k,n,w=map(int,input().split())\r\nprint(max(k,n,w)-min(k,n,w))", "a, b, c = map(int, input().split())\r\nd1 = abs(a - b)\r\nd2 = abs(b - c)\r\nd3 = abs(a - c)\r\nmin_dist = min(d1 + d2, d1 + d3, d2 + d3)\r\nprint(min_dist)\r\n", "a=[int(e) for e in input().split()]\r\nprint(max(a)-min(a))", "x = sorted(map(int, input().split()))\r\n\r\nmd = 300\r\nfor y in range(1, 101):\r\n d = sum(abs(xi - y) for xi in x)\r\n md = min(md, d)\r\n \r\nprint(md)", "a,b,c=map(int,input().split())\n\nmax1=max(a,b,c)\nmin1=min(a,b,c)\n\nmid1=a+b+c-min1-max1\n\nprint(abs(mid1-min1)+abs(mid1-max1))\n\t\t\t\t\t\t \t\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t\t", "x,y,z=map(int,input().split()) \r\nd=min(abs(x-y)+abs(x-z),abs(y-x)+abs(y-z),abs(z-x)+abs(z-y))\r\nprint(d)", "str1 = input().split()\r\nstr2 = []\r\nfor x in str1 :\r\n str2.append(int(x))\r\nstr2.sort()\r\nsum = 0\r\nsum+=(str2[2]-str2[1])\r\nsum+=(str2[1]-str2[0])\r\nprint(sum)", "za=list(map(int,input().split()))\r\nza.sort()\r\nprint(za[-1]-za[0])", "x1, x2, x3 = map(int, input().split())\r\n\r\ndistances = [x1, x2, x3]\r\ndistances.sort()\r\n\r\nprint(distances[2] - distances[0])\r\n", "'''\r\n#list(map(int,input().split()))'''\r\nx=list(map(int,input().split()));mid=[i for i in x if i!=max(x) and i!=min(x)][0]\r\nprint(abs(max(x)-mid)+abs(min(x)-mid))\r\n", "a=list(map(int,input().split()))\r\nb=sorted(a)\r\nprint(abs(b[0]-b[1])+abs(b[1]-b[2]))\r\n", "numeros=[int(x) for x in input().split()]\r\nnumeros.sort()\r\nmin1=numeros[0]\r\nmax2=numeros[2]\r\ndistanciaTotal=numeros[1]-numeros[0]+numeros[2]-numeros[1]\r\nprint(distanciaTotal)", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the coordinates\r\ncoordinates = sorted([x1, x2, x3])\r\n\r\n# Calculate the distances\r\ndistance1 = coordinates[1] - coordinates[0]\r\ndistance2 = coordinates[2] - coordinates[1]\r\n\r\n# Calculate the minimum total distance\r\nmin_total_distance = distance1 + distance2\r\n\r\n# Print the result\r\nprint(min_total_distance)\r\n", "z, x, c = map(int, input().split())\r\nq = max(z, x, c)\r\nw = min(z, x, c)\r\na = 0\r\nif z != q and z != w:\r\n a = z\r\nif x != q and x != w:\r\n a = x\r\nif c != q and c != w:\r\n a = c\r\nprint((q-a)+(a-w))", "x = list(map(int, input().split()))\r\nx.sort()\r\nmin_distance = x[2] - x[0]\r\nprint(min_distance)\r\n", "a,b,c = map(int,input().split())\n\nnums = [a,b,c]\n\nnums.sort()\n\nx,y = nums[0],nums[2]\nmindis = 10**9\nfor i in range(x,y+1):\n sum = abs(a-i)+abs(b-i)+abs(c-i)\n\n if sum< mindis:\n mindis = sum\n\n\nprint(mindis)\n\n", "a,b,c=map(int,input().split())\r\nl=[]\r\nl.append(a)\r\nl.append(b)\r\nl.append(c)\r\nl.sort()\r\nprint(l[1]-l[0]+l[2]-l[1])", "# your code goes here\r\nl = list(map(int,input().split()))\r\nl = sorted(l)\r\na = l[0]\r\nb = l[1]\r\nc = l[2]\r\nprint(c-a)\r\n\r\n", "x1,x2,x3=map(int,input().split())\r\nx=sorted([x1,x2,x3])\r\nprint(max(x)-min(x))", "a,s,x = map(int,input().split())\r\ni = a + s + x - max(a,s,x) - min(a,s,x)\r\nprint( (max(a,s,x) - i) + (i - min(a,s,x)) )", "a, b, c = map(int, input().split())\r\nprint(max(abs(a-b), abs(b-c), abs(a-c)))", "entrada = sorted(map(int, input().split()))\nprint(entrada[2] - entrada[0])\n\t \t\t\t\t\t \t \t\t \t\t\t \t\t\t\t \t\t\t", "x1,x2,x3=input().split(' ')\r\nx1=int(x1)\r\nx2=int(x2)\r\nx3=int(x3)\r\nlist1=[]\r\nlist1.append(abs(x1-x2)+abs(x1-x3))\r\nlist1.append(abs(x2-x1)+abs(x2-x3))\r\nlist1.append(abs(x3-x1)+abs(x3-x2))\r\nprint(min(list1))\r\n", "lst = list(map(int, input().split()))\r\nz =max(lst)\r\nx = min(lst)\r\nm = (z-x)\r\nprint(m)", "a,b,c=map(int,input().split())\r\narr=[a,b,c]\r\nm=min(arr)\r\nma=max(arr)\r\nprint(ma-m)", "numeros = [int(x) for x in input().split()]\n\nnumeros.sort()\n\nprint((numeros[1] - numeros[0]) + (numeros[2] - numeros[1]))\n\t\t\t \t \t \t \t\t \t \t\t\t \t \t\t \t", "a,b,c=map(int,input().split())\r\nd=max(a,b,c)\r\nf=min(a,b,c)\r\nprint(d-f)\r\n", "I = lambda: map(int, input().split())\r\nx = list(I())\r\nm = float('inf')\r\nfor i in x:\r\n\ttot = 0\r\n\tfor j in x:\r\n\t\tif i != j:\r\n\t\t\ttot += abs(i-j)\r\n\tm = min(m, tot)\r\nprint(m)", "a , b , c=input().split()\na = int(a)\nb = int(b)\nc = int(c)\nans = max(a , b , c) - min(a , b, c)\nprint(ans)\n\t \t\t\t \t\t\t \t \t \t \t\t \t", "a = sorted(list(map(int,input().split())))\r\nprint(abs(a[1] - a[2]) + abs(a[1] - a[0]))\r\n", "x = list(map(int, input().split()))\r\ncount = 0\r\nx_max = max(x)\r\nx_min = min(x)\r\nx.remove(x_max)\r\nx.remove(x_min)\r\ntochka = int(x[0])\r\n\r\nfor i in range(1):\r\n count += tochka - x_min\r\n count += x_max - tochka\r\nprint(count)", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the coordinates\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\n\r\n# Calculate the distances\r\ndist12 = coordinates[1] - coordinates[0]\r\ndist23 = coordinates[2] - coordinates[1]\r\n\r\n# Calculate the minimum total distance\r\nmin_total_distance = dist12 + dist23\r\n\r\nprint(min_total_distance)\r\n", "x1,x2,x3=map(int,input().split())\r\nprint(min(abs(x1-x2)+abs(x3-x2),abs(x2-x1)+abs(x3-x1),abs(x1-x3)+abs(x2-x3)))\r\n\r\n \r\n \r\n", "k=list(map(int,input().split()))\r\nk.sort()\r\nprint((k[1]-k[0])+(k[2]-k[1]))\r\n", "a, b, c=map(int, input().split())\r\nprint(max(a, b, c)-min(a, b, c))\n# Fri Jul 07 2023 15:34:19 GMT+0300 (Moscow Standard Time)\n", "q = sorted(list(map(int, input().split())))\r\nm = q[2]\r\nn = q[0]\r\ndel q[2]\r\ndel q[0]\r\nprint ((m - q[0]) + (q[0] - n))", "l1=[int(x) for x in input().split()]\r\nl1.sort()\r\nprint(l1[2]-l1[0])", "l=sorted(list(map(int,input().split())))\r\nprint(l[2]-l[1]+l[1]-l[0])\r\n", "l = list(map(int, input().split()))\r\nl = sorted(l)\r\nprint(l[1]-l[0] + l[2] - l[1])", "x,y,z = list(map(int, input().split(\" \")))\r\n# pointofmeet =( x+y+z )//3\r\nans = max(x,y,z) - min(x,y,z)\r\nprint(ans)", "linha = input().split()\n\nnums = [int(e) for e in linha]\nnums.sort()\na, b, c = nums[0], nums[1], nums[2]\n\npontoa = b-a + c-a\npontob = b-a + c-b\npontoc = c-b + c-a\n\nprint(min(pontoa, pontob, pontoc))\n\n\t\t\t\t \t\t \t \t\t \t \t \t \t\t \t", "n=list(map(int,input().split()))\r\nn.sort()\r\nprint(abs(n[0]-n[1]+n[1]-n[2]))", "a=list(map(int,input().split()))\nn=len(a)\ns=sum(a)\nav=s/n\nma=max(a)\nmi=min(a)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz1=d1+d2\nprint(int(z1))\n \t \t \t\t\t \t\t\t \t\t\t \t\t\t \t \t", "l=list(map(int, input().split()))\r\nl.sort()\r\na=l[0]\r\nb=l[1]\r\nc=l[2]\r\n\r\nd = (b - a) + (c - a) \r\ne = (b - a) + (c - b) \r\nf = (c - a) + (c - b) \r\n\r\nprint(min(d,e,f))", "a = input().split()\r\na[0] = int(a[0])\r\na[1] = int(a[1])\r\na[2] = int(a[2])\r\nmed = min(a)\r\nfor i in a:\r\n if i != min(a) and i != max(a):\r\n med = i\r\nprint((max(a) - med) + (med - min(a)))", "x = input().split()\r\nfor i in range(3):\r\n x[i] = int(x[i])\r\nx.sort()\r\nmind = 1e8\r\nfor i in range(x[0],x[2]):\r\n dis = abs(x[0] - i) + abs(x[1] - i) + abs(x[2] - i)\r\n if dis < mind:\r\n mind = dis\r\nprint(mind)", "a,b,c = map(int, input().split())\r\nprint(max(a,b,c)-min(a,b,c))", "d=list(map(int,input().split()))\r\nfor i in d:\r\n\tif i!=min(d) or i!=max(d):\r\n\t\tbreak\r\nprint((max(d)-i)+(i-min(d)))", "x = list(map(int,input().split(\" \")))\r\nx.sort()\r\nprint(x[-1]-x[0])", "p,q,r=input (). split ()\r\n\r\np=int(p)\r\nq=int(q)\r\nr=int(r)\r\n\r\nm=max(p,q,r)\r\ns=min(p,q,r)\r\nsum=m-s\r\n\r\n#if p!=m or p!=s:\r\n# sum=m-p + s-p\r\n#elif q!=m or q!=s:\r\n# sum=m-q + s-q\r\n#else:\r\n# sum=(m-r )+ (r-s)\r\n\r\n\r\n\r\nprint (sum)", "lis=list(map(int,input().strip().split()))\r\nlis.sort()\r\nprint(lis[1]-lis[0]+lis[2]-lis[1])\r\n", "h,a,m=map(int,input().split())\nans1=min(min(h,a),m)\nans2=max(max(h,a),m)\nprint(ans2-ans1)\n\t \t \t\t\t\t \t\t \t\t \t\t\t \t \t \t\t\t", "x1, x2, x3 = map(int, input().split())\r\n\r\nmin_coordinate = min(x1, x2, x3)\r\nmax_coordinate = max(x1, x2, x3)\r\n\r\nmin_total_distance = max_coordinate - min_coordinate\r\n\r\nprint(min_total_distance)", "x1,x2,x3=map(int,input().split())\r\nprint(max(x1,x2,x3)-min(x1,x2,x3))", "x,y,z=sorted(map(int,input().split()))\r\nprint(abs(x-y)+abs(z-y))", "import sys\n\ninput = sys.stdin.readline\nprint = sys.stdout.write\n\nnums = list(map(int, input().split()))\nnums.sort()\n\ndistance = nums[1] - nums[0] + nums[2] - nums[1]\nprint(f\"{distance}\")\n", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the points\r\npoints = [x1, x2, x3]\r\npoints.sort()\r\n\r\n# Calculate the middle point and the total distance\r\nmiddle_point = points[1]\r\ntotal_distance = abs(middle_point - x1) + abs(middle_point - x2) + abs(middle_point - x3)\r\n\r\nprint(total_distance)", "s=list(map(int,input().split()))\r\ns.sort()\r\nprint(s[2]-s[0])", "str_input = input()\r\ndata_list = str_input.split()\r\n\r\nx_list = []\r\nfor data in data_list:\r\n x_list.append(int(data))\r\n\r\nx_list.sort()\r\nmin_x = min(x_list)\r\nfor i in range(0, len(x_list)):\r\n x_list[i] -= min_x\r\n\r\nmax_x = max(x_list)\r\ndistance_list = []\r\n\r\nfor x in range(0, max_x + 1):\r\n distance = abs(x_list[0] - x) + abs(x_list[1] - x) + abs(x_list[2] - x)\r\n distance_list.append(distance)\r\n\r\nprint(min(distance_list))", "x1,x2,x3=map(int,input().split())\r\nlist1=[x1,x2,x3]\r\nlist1.sort()\r\ndis=(list1[1]-list1[0])+(list1[2]-list1[1])\r\nprint(dis)", "distance=list(map(int,input().split()))\r\ndistance.sort()\r\nfirst=distance[1]-distance[0]\r\nsecond=distance[2]-distance[1]\r\ntotal=first+second\r\nprint(total)", "z = list(map(int, input().split()))\r\nprint( max(z) - min(z))", "x1,x2,x3=map(int,input().split())\nx11=abs(x3-x1)+abs(x2-x1)\nx22=abs(x3-x2)+abs(x1-x2)\nx33=abs(x2-x3)+abs(x1-x3)\nprint(min(x11,x22,x33))\n\t\t\t \t \t\t \t \t\t \t \t\t\t\t\t\t", "n_t = list(map(int, input().split()))\r\nminn = [abs(n_t[0] - n_t[1]), abs(n_t[0] - n_t[2]), abs(n_t[1] - n_t[2])]\r\nminn.sort()\r\n\r\nprint(minn[-1])\r\n\r\n\r\n\r\n'21 5 93'\r\n", "a = list(map(int, input().split()))\r\na.sort()\r\nprint(a[2]-a[0])", "a,b,c=input().split()\r\na,b,c=int(a),int(b),int(c)\r\nprint(max(a,b,c)-min(a,b,c))", "nums = list(map(int, input().split()))\nnums.sort()\n\ndiff = nums[1] - nums[0] + nums[2] - nums[1]\n\nprint(diff)\n\n\n\n", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Calculate distances between friends\r\ndistance1 = abs(x1 - x2) + abs(x1 - x3)\r\ndistance2 = abs(x2 - x1) + abs(x2 - x3)\r\ndistance3 = abs(x3 - x1) + abs(x3 - x2)\r\n\r\n# Find the minimum distance\r\nmin_distance = min(distance1, distance2, distance3)\r\n\r\nprint(min_distance)\r\n", "n,m,k=map(int,input().split())\r\n\r\nl=max(n,m,k);\r\nu=min(n,m,k);\r\nt=n+m+k;\r\nj=t-(l+u);\r\n\r\ng=l-j;\r\nd=j-u;\r\nprint(g+d);\r\n", "x1,x2,x3=[int(i) for i in input().split()]\r\nl=[x1,x2,x3]\r\nl.sort()\r\nx=l[0]\r\ny=l[1]\r\nz=l[2]\r\nprint(abs(x-y)+abs(z-y))\r\n", "data=list(map(int,input().split()))\r\ndata1=max(data)-min(data)\r\nprint(data1)", "l=sorted(list(map(int,input().split())))\r\nsum=0\r\nfor i in range(3):\r\n sum+=abs(l[1]-l[i])\r\nprint(sum)", "nums = [int(x) for x in input().split()]\nnums.sort()\nprint(abs(nums[2]-nums[1])+abs(nums[1]-nums[0]))", "x1, x2, x3 = map(int, input().split())\r\ncoordinates = [x1, x2, x3]\r\n\r\ncoordinates.sort()\r\nmedian = coordinates[1]\r\n\r\ntotal_distance = 0\r\nfor x in coordinates:\r\n total_distance += abs(median - x)\r\n\r\nprint(total_distance)\r\n", "a = list(map(int,input().split()))\r\na.sort()\r\nb = (a[1]-a[0])+(a[2]-a[1])\r\nprint(b)", "#বিসমিল্লাহির রাহমানির রাহিম\r\n#بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ\r\n#Bismillahir Rahmanir Rahim\r\n#PROBLEM :A. The New Year: Meeting Friends\r\n#Soluation\r\nx1,x2,x3=map(int,input().split())\r\nmaximam=max(x1,x2,x3)\r\nminimum=min(x1,x2,x3)\r\ndistance=maximam-minimum\r\nprint(distance)", "nums = list(map(int, input().split()))\r\n\r\nnums.sort()\r\n\r\nprint((nums[2]-nums[1])+ (nums[1]-nums[0]))", "a, b, c = map(int, input().split())\r\ncoordinates = [a, b, c]\r\ncoordinates.sort()\r\nmin_distance = coordinates[2] - coordinates[0]\r\nprint(min_distance)\r\n", "f=list(map(int,input().split()))\r\nmi=min(f)\r\nma=max(f)\r\nmid=(mi+ma)//2\r\nprint((ma-mid)+(mid-mi))", "# Read input\r\nx1, x2, x3 = map(int, input().split())\r\n\r\n# Sort the coordinates\r\ncoordinates = [x1, x2, x3]\r\ncoordinates.sort()\r\n\r\n# Calculate the meeting point as the median\r\nmeeting_point = coordinates[1]\r\n\r\n# Calculate the total distance\r\ntotal_distance = abs(x1 - meeting_point) + abs(x2 - meeting_point) + abs(x3 - meeting_point)\r\n\r\n# Print the minimum total distance\r\nprint(total_distance)", "l = input()\nline = [int(i) for i in l.split()]\nmin = 9999\nfor i in range(3):\n x = 0\n for j in line:\n if j == line[i]:\n continue\n x += abs(j - line[i])\n if x < min:\n min = x\nprint(min)\n\t \t \t \t\t \t \t \t\t \t\t \t\t\t\t\t", "l=list(map(int,input().split()))\r\nl.sort()\r\na=l[1]-l[0]\r\nb=l[2]-l[1]\r\nprint(a+b)", "y=list(map(int,input().split()))\r\nn=len(y)\r\ns=sum(y)\r\nav=s/n\r\nma=max(y)\r\nmi=min(y)\r\nd1=abs(av-ma)\r\nd2=abs(av-mi)\r\nz=d1+d2\r\nprint(int(z))", "mas = list(map(int, input().split()))\r\nx = mas.index(max(mas))\r\ny = mas.index(min(mas))\r\nz = 3 - x - y\r\nprint(abs(mas[x] - mas[z]) + abs(mas[y] - mas[z]))", "lst=list(map(int,input().rstrip().split()))\r\nlst.sort()\r\nprint(lst[2]- lst[0])", "import sys\r\n#f=open(\"C:/Users/USER/Desktop/input.txt\",\"r\")\r\nf=sys.stdin\r\nl=list(map(int, f.readline().split()))\r\nl.sort()\r\nsum_=0\r\nfor i in range(1,len(l)):\r\n sum_+=l[i]-l[i-1]\r\nprint(sum_)\r\n", "l = [int(x) for x in input().split()]\r\nl.sort()\r\ns = int(l[2]) - int(l[1])\r\nm = int(l[1]) - int(l[0])\r\ndist = s + m\r\nprint(dist)\r\n", "m = list(map (int , input() . split()))\r\nm.sort()\r\nl = []\r\nfor i in range(1,len(m)):\r\n x = m[i]-m[i-1]\r\n l.append(x)\r\nprint(sum(l))", "x1,x2,x3=map(int,input().split())\r\ncoord=sorted([x1,x2,x3])\r\ntotal=coord[2]-coord[0]\r\nprint(total)", "a,b,c=(map(int,input().split()))\r\nf= max(max(a, b), c) - min(min(a, b), c)\r\nprint(f)", "list1=list(map(int,input().split()))\r\nlist1.sort()\r\nanswer=list1[1]-list1[0]+list1[2]-list1[1]\r\nprint(answer)", "x = list(map(int, input().split(\" \")))\r\nx.sort()\r\na = x[0]\r\nb = x[1]\r\nc = x[2]\r\n\r\nprint((c-b)+(b-a))\r\n\r\n", "l=list(map(int,input().split()))\r\nm=max(l)\r\nn=min(l)\r\nprint(m-n)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 14:56:56 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nx1,x2,x3 = map(int,input().split())\r\nans = 100\r\nfor i in range(max(x1,x2,x3)+1) :\r\n ans = min(ans,abs(x1-i)+abs(x2-i)+abs(x3-i))\r\nprint(ans)", "\r\ndef solution(a, b, c):\r\n mn = min(a, b, c)\r\n mx = max(a, b, c)\r\n return mx - mn\r\n\r\ndef driver():\r\n a, b, c = list(map(int, input().split()))\r\n ans = solution(a, b, c)\r\n print(ans)\r\n\r\ndriver()", "x1, x2, x3 = map(int, input().split())\r\ndistance = max(x1, x2 ,x3) - min(x1, x2, x3)\r\nprint(distance)\r\n\r\n", "a,b,c=map(int,input().split())\r\nA=min(a,b,c)\r\nB=max(a,b,c)\r\nprint(B-A)", "a = input()\r\narray = []\r\nnum = \"\"\r\nfor count in range(0, len(a), 1): \r\n if a[count] != \" \":\r\n num = num + a[count]\r\n else:\r\n array.append(int(num))\r\n num = \"\"\r\narray.append(int(num))\r\ndist1 = abs(array[0] - array[1])\r\ndist2 = abs(array[0] - array[2])\r\ndist3 = abs(array[2] - array[1])\r\nif dist1 >= dist2 and dist1 >= dist3:\r\n print(dist1)\r\nelse:\r\n if dist2 >= dist1 and dist2 >= dist3:\r\n print(dist2)\r\n else:\r\n print(dist3)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef main():\r\n x = [int(n) for n in input().split()]\r\n x.sort()\r\n print(x[2] - x[0])\r\n\r\nmain()", "x,y,z=map(int,input().split())\r\nl=sorted([x,y,z])\r\nprint(abs(l[0]-l[1])+abs(l[2]-l[1]))", "a,b,c=map(int,input().split())\r\nprint(max(max(a,b),c)-min(min(a,b),c))\r\n", "a,b,c =[int(x) for x in input().split()]\r\nmid = 0\r\nmax = 0\r\nmin = 0\r\nif a>b and a>c:\r\n if b>c:\r\n min,mid,max= c,b,a\r\n else:\r\n min,mid,max=b,c,a\r\nelif b>a and b>c:\r\n if a>c:\r\n min,mid,max=c,a,b\r\n else:\r\n min,mid,max= a,c,b\r\nelif c>a and c>b:\r\n if a>b:\r\n min,mid,max= b,a,c\r\n else:\r\n min,mid,max= a,b,c\r\n\r\nprint((max-mid)+(mid-min))", "A=list(map(int,input().split()))\r\nA.sort()\r\nprint(A[2]-A[0])", "listA = list(map(int,input().split(\" \")))\r\nprint(max(listA)-min(listA))", "f,s,t=map(int,input().split())\r\nmax1=max(f,s,t)\r\nmin1=min(f,s,t)\r\nif(f!=max1 and f!=min1):\r\n p=f \r\nelif(s!=max1 and s!=min1):\r\n p=s \r\nelse:\r\n p=t\r\nprint(abs(p-f)+abs(p-s)+abs(p-t))", "s=input().split()\r\nx1,x2,x3=int(s[0]),int(s[1]),int(s[2])\r\nc1=abs(x2-x1)+abs(x3-x1)\r\nc2=abs(x1-x2)+abs(x3-x2)\r\nc3=abs(x1-x3)+abs(x2-x3)\r\nprint(min(c1,c2,c3))", "lst=list(map(int,input().split()))\r\nlst.sort()\r\nres=lst[1] - lst[0]\r\nres+= lst[2] - lst[1]\r\nprint(res)\r\n", "left, center, right = sorted(list(map(int, input().split(' '))))\r\nacc = right - center\r\nacc += center - left\r\nprint(acc)", "x = [int(a) for a in input().split()]\r\nx = sorted(x)\r\nprint(abs(x[1] - x[0]) + abs(x[1] - x[2]))", "n=list(map(int,input().split()))\r\nn.sort()\r\nprint((n[1]-n[0])+(n[2]-n[1]))\r\n \r\n ", "l=list(map(int,input().split()))\r\nl.sort()\r\nmini=100\r\nd=0\r\nfor i in range(l[0],l[2]):\r\n d=abs(l[0]-i)+abs(l[1]-i)+abs(l[2]-i)\r\n #print(mini,d)\r\n if d<mini:\r\n mini=d\r\nprint(mini) \r\n ", "n=list(map(int,input().split()))\r\nl=[]\r\nfor i in n:\r\n m1=0\r\n for j in n:\r\n if i!=j and i>j:\r\n m1+=i-j\r\n else:\r\n m1+=j-i\r\n l.append(int(m1))\r\nprint(min(l))", "a, b, c = map(int, input().split())\r\nm = 10**9\r\nfor i in range(min(a, b, c), max(a, b, c)):\r\n if abs(i-a)+abs(i-b)+abs(i-c)<m:\r\n m = abs(i-a)+abs(i-b)+abs(i-c)\r\nprint(m)\n# Fri Jul 07 2023 13:04:36 GMT+0300 (Moscow Standard Time)\n", "def party():\n arr = [int (i) for i in input().split()]\n distance1 = abs(arr[0]-arr[1])+abs(arr[0]-arr[2])\n distance2 = abs(arr[1]-arr[0])+abs(arr[1]-arr[2])\n distance3 = abs(arr[2]-arr[0])+abs(arr[2]-arr[1])\n return min(distance3,distance2,distance1)\nprint(party())\n \n \n \n \t \t\t\t\t \t \t \t\t \t\t \t\t \t \t", "l = sorted(list(map(int,input().split())))\r\nprint(l[2]-l[0])\r\n", "# 7 1 4\r\nx = list(map(int, input().split()))\r\nprint(max(x) - min(x))", "\r\n# это задача 723A\r\n\r\nx1, x2, x3 = map(int, input().split())\r\n\r\nk = x1 + x2 + x3 - max(x1, x2, x3) - min(x1, x2, x3)\r\nprint(abs(x1 - k) + abs(x2 - k) + abs(x3 - k))\r\n ", "x1,x2,x3=map(int,input().split())\r\nl=[]\r\nl.append(x1)\r\nl.append(x2)\r\nl.append(x3)\r\nprint(max(l)-min(l))", "x1, x2, x3 = map(int, input().split())\r\n\r\nmiddle_point = sorted([x1, x2, x3])[1]\r\n\r\ndistance_friend_1 = abs(x1 - middle_point)\r\ndistance_friend_2 = abs(x2 - middle_point)\r\ndistance_friend_3 = abs(x3 - middle_point)\r\n\r\ntotal_min_distance = distance_friend_1 + distance_friend_2 + distance_friend_3\r\n\r\nprint(total_min_distance)", "a,b,c=map(int,input().split())\r\nl1=[a,b,c]\r\nm=min(l1)\r\nma=max(l1)\r\nprint(ma-m)\r\n \t \t \t \t\t\t \t\t \t \t\t\t \t \t", "points = list(map(int, input().split(\" \")))\n\npoints.sort()\n\ndist = (points[1] - points[0]) + (points[2] - points[1])\n\nprint(dist)\n", "import math\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nprint(abs(arr[0]-arr[1])+abs(arr[1]-arr[2]))\r\n\r\n ", "#The New Year: Meeting Friends\r\na, b, c = list(map(int, input().split()))\r\nif a > b:\r\n a, b = b, a\r\nif a > c:\r\n a, c = c, a\r\nif b > c:\r\n b, c = c, b\r\nprint(c - a)", "m=list(map(int,input().split()))\nn=len(m)\ns=sum(m)\nav=s/n\nma=max(m)\nmi=min(m)\nd1=abs(av-ma)\nd2=abs(av-mi)\nz=d1+d2\nprint(int(z))\n \t \t \t \t \t\t \t\t", "def solve(x):\r\n\tsorted_x = sorted(x)\r\n\tprint(sorted_x[-1]-sorted_x[0])\r\n\t\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tx = [int(x) for x in input().split()]\r\n\tsolve(x)", "x1, x2, x3 = sorted(map(int, input().split()))\r\n\r\n# Находим медиану\r\nif x1 <= x2 <= x3 or x3 <= x2 <= x1:\r\n median = x2\r\nelif x1 <= x3 <= x2 or x2 <= x3 <= x1:\r\n median = x3\r\nelse:\r\n median = x1\r\n\r\n# Находим расстояние каждого друга до медианы\r\ndist1 = abs(x1 - median)\r\ndist2 = abs(x2 - median)\r\ndist3 = abs(x3 - median)\r\n\r\n# Суммируем расстояния и выводим результат\r\ntotal_dist = dist1 + dist2 + dist3\r\nprint(total_dist)", "def meeting(x, y, z):\r\n sol = int()\r\n lst = [x, y, z]\r\n for item in lst:\r\n if item != max(lst) and item != min(lst):\r\n middle = item\r\n return abs(middle-x) + abs(middle-y) + abs(middle-z)\r\n\r\nif __name__ == \"__main__\":\r\n x, y, z = map(int, input().split())\r\n print(meeting(x, y, z))", "*a,=map(int,input().split())\r\na.sort()\r\nprint(a[2]-a[1]+a[1]-a[0])", "n=list(map(int,input().split()))\r\nk=[]\r\nd=0\r\nfor i in range(len(n)):\r\n k.append(n[i])\r\nk.remove(max(n))\r\nm=max(k)\r\nfor i in range(len(n)):\r\n d=d+abs(m-n[i])\r\nprint(d)", "def main():\r\n temp_list = input().split(\" \")\r\n\r\n main_list = []\r\n # Make another list to convert all list elements to <int> type.\r\n for i in range(3):\r\n main_list.append(int(temp_list[i]))\r\n main_list.sort() # Sort it.\r\n # Do the require mathematical calculation below.\r\n a = main_list[1] - main_list[0] # Distance from middle one to first one.\r\n b = main_list[2] - main_list[1] # Distance from middle one to last one.\r\n result = a + b\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x1,x2,x3=map(int,input().split())\r\nsumx1 = abs(x2-x1) + abs(x3-x1)\r\nsumx2 = abs(x2-x3) + abs(x2-x1)\r\nsumx3 = abs(x3-x1) + abs(x3-x2)\r\nprint(min(sumx3,sumx1,sumx2))", "x1, _, x3 = sorted(map(int, input().split()))\r\nprint(x3 - x1)\r\n", "x1,x2,x3=sorted(list(map(int,input().split())));c=0\r\nc+=(x2-x1);c+=(x3-x2)\r\nprint(c)\r\n\r\n", "numbers = list(map(int, input().split()))\r\nprint(max(numbers) - min(numbers))\r\n# HI codeforces\r\n", "x1,x2,x3 = map(int,input().split())\r\n\r\nmiddle = sorted([x1,x2,x3])[1]\r\n\r\ntotal = abs(x1 - middle) + abs(x2 - middle) + abs(x3 - middle)\r\n\r\nprint(total)\r\n\r\n", "x1,x2,x3=map(int,input().split())\r\n\r\nmin_coord=min(x1,x2,x3)\r\nmax_coord=max(x1,x2,x3)\r\n\r\ntotal_distance= max_coord-min_coord\r\n\r\nprint(total_distance)", "import sys\r\nnumbers = [int(i) for i in sys.stdin.readline().split()]\r\nnumbers.sort()\r\nprint(numbers[2]-numbers[0])\r\n\r\n\r\n", "n=[int(i) for i in input().split()]\r\nn.sort()\r\na,b,c=n\r\nprint(b-a+c-b)", "\r\ndef solve():\r\n friends = list(map(int, input().split()))\r\n friends.sort()\r\n return abs(friends[1] - friends[0]) + abs(friends[1] - friends[2])\r\n\r\n\r\nprint(solve())\r\n", "x1, x2, x3 = map(int, input().split())\r\n\r\n# Calculate the minimum and maximum coordinates\r\nmin_coord = min(x1, x2, x3)\r\nmax_coord = max(x1, x2, x3)\r\n\r\n# Calculate the minimum total distance\r\ntotal_distance = max_coord - min_coord\r\n\r\nprint(total_distance)\r\n", "def main() -> None :\r\n print(minimum_Total_Distance_To_Meet(input_house_Poses()))\r\n\r\n\r\ndef minimum_Total_Distance_To_Meet(house_poses: list[int]) -> int :\r\n return min(total_Distances_To_Meet(house_poses, searchable_Poses_To_Meet(house_poses)))\r\n\r\ndef searchable_Poses_To_Meet(house_poses: list[int]) -> list[int] :\r\n return list(range(min(house_poses), max(house_poses)+1))\r\n\r\ndef total_Distances_To_Meet(house_poses: list[int], poses_to_meet: list[int]) -> list[int] :\r\n return map(lambda pos_to_meet: total_Distance_To_Meet(house_poses, pos_to_meet), poses_to_meet)\r\n\r\ndef total_Distance_To_Meet(house_poses: list[int], pos_to_meet: int) -> int :\r\n return sum(map(lambda house_pos: absoulte_Distance(house_pos, pos_to_meet), house_poses))\r\n\r\ndef absoulte_Distance(pos_1: int, pos_2: int) :\r\n return abs(pos_1 - pos_2)\r\n\r\n\r\ndef input_house_Poses() -> list[int] :\r\n return input_Array()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "x1,x2,x3=map(int,input().split())\r\na=abs(x1-x2)+abs(x2-x3)\r\nb=abs(x1-x3)+abs(x2-x3)\r\nc=abs(x1-x2)+abs(x1-x3)\r\nprint (min(a,b,c))", "x1, x2, x3 = sorted(map(int, input().split()))\r\n\r\ndist1 = x2 - x1\r\ndist2 = x3 - x2\r\n\r\ntotal_dist = dist1 + dist2\r\n\r\nprint(total_dist)\r\n", "a,b,c=map(int,input().split())\r\nd=max(a,b,c)\r\ne=min(a,b,c)\r\nf=a+b+c\r\ng=f-d-e\r\nprint(abs(g-e)+abs(g-d))\r\n", "x, y, z = map(int, input().split())\r\nmn = 301\r\nfor place in range(1, 101):\r\n dist = abs(x-place) + abs(y-place) + abs(z-place) \r\n if mn > dist :\r\n mn = dist \r\nprint(mn)", "h=list(map(int,input().split()))\nn=len(h)\ns=sum(h)\nav=s/n\nma=max(h)\nmi=min(h)\nd1=abs(av-ma)\nd2=abs(av-mi)\nf=d1+d2\nprint(int(f))\n\t\t\t\t \t \t\t \t\t \t\t\t\t \t \t \t", "x1, x2, x3 = map(int, input().split())\r\ndistances = [abs(x2 - x1), abs(x3 - x1), abs(x3 - x2)]\r\nmin_distance = sum(sorted(distances)[:2])\r\nprint(min_distance)\r\n", "lst = [int(x) for x in input().split()]\r\n\r\nprint(max(lst) - min(lst))", "n=list(map(int,input().split()))\r\nn.sort()\r\nprint(abs(n[0]-n[1])+abs(n[1]-n[2]))\r\n", "x1 = list(map(int,input().split()))\r\n\r\nprint(max(x1)-min(x1))", "s = [int(i) for i in input().split()]\r\nm = max(s)\r\nn = min(s)\r\nc = sum(s)-m-n\r\nprint(abs(m-c)+abs(n-c))", "from collections import defaultdict\r\n\r\ndef pug_func(s: str) -> int:\r\n\r\n p1, p2, p3 = s.split(\" \")\r\n p1 = int(p1)\r\n p2 = int(p2)\r\n p3 = int(p3)\r\n\r\n min_ = min(p1, p2, p3)\r\n max_ = max(p1, p2, p3)\r\n\r\n min_d = float(\"inf\")\r\n\r\n for i in range(min_, max_):\r\n d1 = abs(p1 - i)\r\n d2 = abs(p2 - i)\r\n d3 = abs(p3 - i)\r\n d = d1 + d2 + d3\r\n min_d = min(min_d, d)\r\n\r\n return min_d\r\n\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)\r\n\r\nt = input()\r\nx = pug_func(t)\r\nprint(x)", "x1, x2, x3=map(int, input().split())\r\nmax_=max(x1, x2, x3)\r\nmin_=min(x1, x2, x3)\r\nmid=(x1+x2+x3)-(max_+min_)\r\ny1=abs(x1-mid)\r\ny2=abs(x2-mid)\r\ny3=abs(x3-mid)\r\nres=y1+y2+y3\r\nprint(res)", "input_line = input()\r\ninput_components = input_line.split()\r\nnlist = []\r\nfor _ in input_components :\r\n nlist.append(int(_))\r\n\r\nans = max(nlist) - min(nlist)\r\nprint(ans)" ]

[ "#codeforces 18b platforms, math, brute force\r\n\r\ndef readGen(transform):\r\n\twhile (True):\r\n\t\tn=0\r\n\t\ttmp=input().split()\r\n\t\tm=len(tmp)\r\n\t\twhile (n<m):\r\n\t\t\tyield(transform(tmp[n]))\r\n\t\t\tn+=1\r\n\r\nreadint=readGen(int)\r\n\r\nn,d,m,l=next(readint),next(readint),next(readint),next(readint)\r\n\r\nfound=0\r\n\r\nfor j in range(m):\r\n\tif (j*d%m > l):\r\n\t\tfound=1\r\n\t\tprint(j*d)\r\n\t\tbreak\r\n\t\r\nif (not found):\r\n\tj=-((-(n*m))//d)\r\n\tprint(j*d)\r\n", "from math import gcd\n\nn, d, m, l = map(int, input().split())\nd1 = d % m\n\nx = 0\npos = 0\nfor i in range(m // gcd(m, d1)):\n pos += d\n x += d1\n if x >= m:\n x -= m\n if x > l:\n print(pos)\n break\nelse:\n print(((n - 1) * m + l) // d * d + d)", "# LUOGU_RID: 101918081\ndef main():\r\n n, d, m, l = map(int, input().split())\r\n for i in range(n):\r\n a = i * m + l\r\n b = a + m - l - 1\r\n if a // d != b // d:\r\n break\r\n print(a // d * d + d)\r\nmain()", "import sys\ntry:\n\tfin = open('in')\nexcept:\n\tfin = sys.stdin\ninput = fin.readline\n\nn,d,m,l=map(int,input().split())\ncur=0\nR = None\nfor i in range(n):\n\tR = i * m + l\n\t# Platform: i * m to i * m + l\n\t# Gap: i * m + l + 1 to i * m + m - 1\n\tif (i * m + l) // d != (i * m + m - 1) // d:\n\t\tbreak\nprint (R // d * d + d)", "\r\nif __name__ == '__main__':\r\n n, d, m, l = map(int, input().split())\r\n ans = - 1\r\n for i in range (0, n):\r\n value = m * i + l + d\r\n ans = value - value % d\r\n if ans < m * (i + 1):\r\n break\r\n print(ans)", "n, d, m, l = map(int, input().split())\r\nfor i in range(1,n+1):\r\n a = (i-1)*m+l\r\n b = i*m-1\r\n if a//d != b//d:\r\n break\r\nprint (a//d*d+d)", "n,d,m,l=list(map(int,input().split()))\r\na=0\r\nx=0\r\nfor i in range(n):\r\n x+=((l-a)//d+1)*d\r\n if x%m>l:\r\n break\r\n a=x%m\r\nprint(x)", "n,d,m,l=map(int,input().split())\r\ni=1\r\nx=0\r\nfor i in range(1,n+1):\r\n left=(i-1)*m\r\n right=(i-1)*m+l\r\n x=d*(right//d+1)\r\n if x<i*m:\r\n break\r\nprint(x)", "a,b,c,d = map(int,input().split())\r\nfor i in range(a):\r\n x,y = i * c + d,(i + 1)* c - 1\r\n if x // b != y // b:\r\n break\r\nprint((x // b + 1)* b)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, d, m, l = map(int, input().split())\r\nr = (n - 1) * m + l\r\nans = ((r + 1) // d + min(1, (r + 1) % d)) * d\r\nif (l + 1) ^ m:\r\n for i in range(n - 1):\r\n l0, r0 = i * m + l + 1, (i + 1) * m - 1\r\n if not l0 % d or (l0 // d) ^ (r0 // d):\r\n for j in range(l0, r0 + 1):\r\n if not j % d:\r\n ans = j\r\n break\r\n break\r\nprint(ans)", "n,d,m,l = map(int,input().split())\r\nfor i in range(l,n*m,m):\r\n if i + d - i % d < i - l +m or i > n*m-m:\r\n print(i + d - i %d)\r\n break", "n, d, m, l = [int(w) for w in input().split()]\n\nfor k in range(n):\n t = (k * m + l) % d\n if d - t < m - l:\n print(k * m + l + d - t)\n exit(0)\n\ntarget = (n - 1) * m + l\nresult = target + d - (target % d )\nwhile result <= target:\n result += d\nprint(result)", "n, d, m, l = map(int, input().split())\r\nz = (n - 1) * m + l\r\nfor i in range(d, (m + 1) * d, d):\r\n if i % m > l or i > z:\r\n print(i)\r\n exit()\r\nprint(z - z % d + d)", "\r\nn,d,m,l = [int(x) for x in input().split()]\r\nc = 0\r\ncounter = 0\r\nfall = False\r\nwhile counter <= m:\r\n c += d\r\n counter += 1\r\n if c%m > l:\r\n print(c)\r\n fall = True\r\n break\r\nif not fall:\r\n print(((m*(n-1)+l)//d)*d +d)", "s = input().split()\r\nn = int(s[0])\r\nd = int(s[1])\r\nm = int(s[2])\r\nl = int(s[3])\r\na = b = 0\r\nfor i in range(1, n + 1) :\r\n a = (i - 1) * m + l\r\n b = i * m - 1\r\n if (a // d != b // d) : break\r\nprint((a // d + 1) * d)\r\n", "# Entrer les variables n, d, m, l (séparés par des espaces)\r\nn, d, m, l = [int(x) for x in input().split(\" \")]\r\n\r\n# Initialiser la position de départ de Bob à 0\r\nx = 0\r\n# Calculer la longueur totale de la plateforme\r\ntotal = n * m\r\n\r\nwhile True:\r\n # Ajouter la distance de saut à la position actuelle\r\n x += d\r\n # Calculer le reste de la position actuelle par rapport à la longueur de la plateforme\r\n r = x % m\r\n # Si Bob est sorti de la plateforme ou a atteint la fin de la plateforme, imprimer sa position actuelle et sortir de la boucle\r\n if r > l or x >= total:\r\n print(x)\r\n break\r\n # Si Bob se trouve sur le bord de la plateforme, mettre à jour sa position actuelle\r\n elif r == 0:\r\n x = max(x, (n - 1) * m // x * x)\r\n", "#coding gbk\r\nwhile True:\r\n try:\r\n n,d,m,l=map(int,input().strip().split())\r\n mi = 0\r\n mx = 0\r\n step = 0\r\n for i in range(n):\r\n mi = i*m+l\r\n mx = (i+1)*m\r\n step = (mi+d)//d\r\n if step*d<mx:\r\n break\r\n print(step*d)\r\n except EOFError:\r\n break \r\n", "n, d, m, l = [int(i) for i in input().split()]\r\ntotal_length = n*m\r\ncur = 0 # cur position\r\nfor k in range(0, total_length, m):\r\n # go through the starting point\r\n if cur < k:\r\n break\r\n cur = ((k+l)//d +1) * d\r\nprint(cur)\r\n\t\t \t \t \t \t \t \t\t \t\t\t \t \t", "if __name__ == '__main__':\r\n n,d,m,l=list(map(int,input().split()))\r\n a=0\r\n x=0\r\n for i in range(n):\r\n x+=((l-a)//d+1)*d\r\n if x%m>l:\r\n break\r\n a=x%m\r\n print(x)\r\n", "from sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, d, m, l = iia()\r\nfor i in range(1, n + 1):\r\n x = ((i - 1) * m + l)\r\n y = i * m - 1\r\n if x // d != y // d:\r\n break\r\nprint((x // d) * d + d)\r\n\r\n\r\n \r\n", "from math import gcd\r\n \r\nn, d, m, l = map(int, input().split())\r\nd1 = d % m\r\n \r\nx = 0\r\npos = 0\r\nfor i in range(m // gcd(m, d1)):\r\n pos += d\r\n x += d1\r\n if x >= m:\r\n x -= m\r\n if x > l:\r\n print(pos)\r\n break\r\nelse:\r\n print(((n - 1) * m + l) // d * d + d)", "'''\r\nBeezMinh\r\n16:33 UTC+7\r\n16/08/2023\r\n'''\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\nn, d, m, l = map(int, input().split())\r\na, x = 0, 0\r\nfor k in range(n):\r\n\tx += d * ((l - a) // d + 1)\r\n\tif x % m > l:\r\n\t\tbreak\r\n\ta = x % m\r\nprint(x)", "import bisect\r\n\r\nn,d,m,l=map(int,input().split())\r\n\r\nEND=[]\r\n\r\nfor i in range(n):\r\n END.append(i*m+l)\r\n\r\nNOW=0\r\nwhile True:\r\n x=bisect.bisect_left(END,NOW)\r\n\r\n if x==len(END):\r\n break\r\n\r\n k=END[x]\r\n if NOW<k-l:\r\n break\r\n\r\n rest=k-NOW\r\n PLUS=rest//d\r\n NOW+=(PLUS+1)*d\r\n\r\nprint(NOW)\r\n\r\n", "n, d, m, l = [int(i) for i in input().split()]\ntotal_length = n*m\ncur = 0 # cur position\nfor k in range(0, total_length, m):\n # go through the starting point\n if cur < k:\n break\n cur = ((k+l)//d +1) * d # clear current end point\nprint(cur)\n\t\t \t \t \t \t \t \t\t \t\t\t \t \t\n\t\t\t \t\t\t\t \t \t \t\t \t\t\t\t\t" ]

[ "n = int(input())\r\nd = [[] for i in range(n)]\r\n# print(d)\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n d[a - 1].append(b - 1)\r\n d[b - 1].append(a - 1)\r\ninit = list(map(int, input().split()))\r\nfinal = list(map(int, input().split()))\r\nans = []\r\nq = [(0, 0, 0, 0)]\r\nwhile(q):\r\n u, dst, a, b = q.pop()\r\n if(dst):\r\n if(a != (init[u] != final[u])):\r\n ans.append(u + 1)\r\n a = 1 - a \r\n else:\r\n if(b != (init[u] != final[u])):\r\n ans.append(u + 1)\r\n b = 1 - b \r\n dst = 1 - dst \r\n for i in d[u]:\r\n d[i].remove(u)\r\n q.append((i, dst, a, b))\r\nprint(len(ans))\r\nprint(*ans)", "#!/usr/bin/env python\r\nfrom __future__ import division, print_function\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nif sys.version_info[0] < 3:\r\n\tfrom __builtin__ import xrange as range\r\n\tfrom future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\n############################################################################\r\n# ACTUAL CODE\r\n############################################################################\r\nfrom collections import deque\r\ndef solve(t):\r\n n = int(input().strip())\r\n # print(n,end=\" \")\r\n #take graph as input\r\n g = [[] for i in range(n)]\r\n for i in range(n-1):\r\n \ta,b = list(map(int,input().strip().split()))\r\n \tg[a-1].append(b-1)\r\n \tg[b-1].append(a-1)\r\n \r\n initial = list(map(int,input().split()))\r\n final = list(map(int,input().split()))\r\n \r\n q = deque()\r\n # (node,level%2,flip(levl%2),flip(lev%2==`))\r\n q.append((0,0,0,0))\r\n visited = [0 for i in range(n)]\r\n ans = 0\r\n all_nodes = []\r\n #now we don bfs\r\n while q:\r\n \t(node,level,flip0,flip1) = q.popleft()\r\n \tvisited[node]=1\r\n \tnode_val = initial[node]\r\n \tif((level%2==0 and flip0==1) or (level%2==1 and flip1==1)): node_val = node_val^1\r\n \tif(final[node]!=node_val):\r\n \t\tans+=1\r\n \t\tall_nodes.append(node+1)\r\n \t\tif(level%2==0):flip0 = flip0^1\r\n \t\telse: flip1 = flip1^1\r\n \tfor u in g[node]:\r\n \t\tif(visited[u]==0):q.append((u,level+1,flip0,flip1))\r\n print(ans)\r\n for nodes in all_nodes:\r\n \tprint(nodes)\r\n \t\t\r\ndef main():\r\n\t# tc = int(input().strip())\r\n\ttc = 1\r\n\tfor t in range(1, tc+1):\r\n\t\t# print(solve(t))\r\n\t\t# print(\"case: %d\"%t,end = \" \")\r\n\t\tsolve(t)\r\n\r\n#'''\r\n############################################################################\r\n# FAST-IO\r\n# PyRIVAL\r\n############################################################################\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n\tnewlines = 0\r\n\r\n\tdef __init__(self, file):\r\n\t\tself._fd = file.fileno()\r\n\t\tself.buffer = BytesIO()\r\n\t\tself.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n\t\tself.write = self.buffer.write if self.writable else None\r\n\r\n\tdef read(self):\r\n\t\twhile True:\r\n\t\t\tb = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n\t\t\tif not b:\r\n\t\t\t\tbreak\r\n\t\t\tptr = self.buffer.tell()\r\n\t\t\tself.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n\t\tself.newlines = 0\r\n\t\treturn self.buffer.read()\r\n\r\n\tdef readline(self):\r\n\t\twhile self.newlines == 0:\r\n\t\t\tb = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n\t\t\tself.newlines = b.count(b\"\\n\") + (not b)\r\n\t\t\tptr = self.buffer.tell()\r\n\t\t\tself.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n\t\tself.newlines -= 1\r\n\t\treturn self.buffer.readline()\r\n\r\n\tdef flush(self):\r\n\t\tif self.writable:\r\n\t\t\tos.write(self._fd, self.buffer.getvalue())\r\n\t\t\tself.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n\tdef __init__(self, file):\r\n\t\tself.buffer = FastIO(file)\r\n\t\tself.flush = self.buffer.flush\r\n\t\tself.writable = self.buffer.writable\r\n\t\tself.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n\t\tself.read = lambda: self.buffer.read().decode(\"ascii\")\r\n\t\tself.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(*args, **kwargs):\r\n\t\"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n\tsep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n\tat_start = True\r\n\tfor x in args:\r\n\t\tif not at_start:\r\n\t\t\tfile.write(sep)\r\n\t\tfile.write(str(x))\r\n\t\tat_start = False\r\n\tfile.write(kwargs.pop(\"end\", \"\\n\"))\r\n\tif kwargs.pop(\"flush\", False):\r\n\t\tfile.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n\tsys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n\tsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n############################################################################\r\n''' # '''\r\n\r\n\r\n## DRIVER # PROGRAM ########################################################\r\nif __name__ == \"__main__\":\r\n\tmain()", "from collections import defaultdict, deque, Counter, OrderedDict\r\nfrom bisect import insort, bisect_right, bisect_left\r\nimport threading\r\n\r\ndef main():\r\n n = int(input())\r\n adj = [[] for i in range(n + 1)]\r\n for i in range(n - 1):\r\n a, b = map(int, input().split())\r\n a, b = a - 1, b - 1\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n init = [int(i) for i in input().split()]\r\n goal = [int(i) for i in input().split()]\r\n visited = [0] * n\r\n par = [[] for i in range(n)]\r\n dq = deque()\r\n dq.append((0, 0))\r\n while len(dq) > 0:\r\n (s, p) = dq.pop()\r\n if visited[s]: continue\r\n visited[s] = 1\r\n par[p].append(s)\r\n for i in adj[s]:\r\n dq.append((i, s))\r\n par[0] = par[0][1:]\r\n ans = []\r\n dq = deque()\r\n dq.append((0, 0, 0, 0))\r\n while len(dq) > 0:\r\n (s, l, fo, fe) = dq.pop()\r\n if l % 2 == 0:\r\n if fe % 2 == 1:\r\n init[s] = 1 - init[s]\r\n else:\r\n if fo % 2 == 1:\r\n init[s] = 1 - init[s]\r\n if init[s] != goal[s]:\r\n ans.append(s + 1)\r\n if l % 2:\r\n fo += 1\r\n else:\r\n fe += 1\r\n for j in par[s]:\r\n dq.append((j, l + 1, fo, fe))\r\n\r\n print(len(ans))\r\n print(\"\\n\".join(map(str, ans)))\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", "from sys import stdin,stdout\r\nfrom collections import defaultdict,deque\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\ndef bfs():\r\n global ans\r\n q=deque()\r\n p[1]=-1\r\n q.append(1)\r\n while q:\r\n src=q.popleft()\r\n if p[src] != -1 and p[p[src]] != -1:\r\n dp[src] = dp[p[p[src]]]\r\n if dp[src]^init[src-1]!=goal[src-1]:\r\n dp[src]^=1\r\n ans+=[src]\r\n for neigh in g[src]:\r\n if neigh==p[src]:continue\r\n p[neigh]=src\r\n q.append(neigh)\r\n\r\nfor _ in range(1):#nmbr():\r\n n=nmbr()\r\n g=defaultdict(list)\r\n for i in range(n-1):\r\n u,v=lst()\r\n g[u]+=[v]\r\n g[v]+=[u]\r\n init=lst()\r\n goal=lst()\r\n p=[0]*(1+n)\r\n dp=[0]*(1+n)\r\n ans=[]\r\n bfs()\r\n print(len(ans))\r\n print(*sorted(ans),sep='\\n')\r\n", "from sys import stdin,stdout\r\nn=int(input())\r\na=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n c,d=(int(o) for o in stdin.readline().split())\r\n a[c-1].append(d-1);a[d-1].append(c-1)\r\nb=list(int(o) for o in stdin.readline().split())\r\nc=list(int(o) for o in stdin.readline().split())\r\nlv=[0]*n;lv[0]=1\r\nq=[0]\r\nwhile len(q)!=0:\r\n r=q.pop()\r\n for i in a[r]:\r\n if lv[i]==0:\r\n lv[i]=lv[r]+1\r\n q.append(i)\r\nans='';vis=[True]*n\r\nvis[0]=False;k=0\r\nif b[0]==c[0]:\r\n q=[(0,0,0)]\r\nelse:\r\n q=[(0,1,0)];ans+=('1'+'\\n');k+=1\r\nwhile len(q)!=0:\r\n no,o,e=q.pop()\r\n for i in a[no]:\r\n if vis[i]:\r\n l=e;m=o\r\n vis[i]=False\r\n if lv[i]%2==0:\r\n if b[i]==c[i] and l%2!=0:\r\n ans+=(str(i+1)+'\\n')\r\n l+=1;k+=1\r\n elif b[i]!=c[i] and l%2==0:\r\n ans+=(str(i+1)+'\\n')\r\n l+=1;k+=1\r\n else:\r\n if b[i]==c[i] and m%2!=0:\r\n ans+=(str(i+1)+'\\n')\r\n m+=1;k+=1\r\n elif b[i]!=c[i] and m%2==0:\r\n ans+=(str(i+1)+'\\n')\r\n m+=1;k+=1\r\n q.append((i,m,l))\r\nprint(k)\r\nstdout.write(ans)", "n = int(input())\r\nadj_list = {i: [] for i in range(n)}\r\n\r\nfor edge in range(n - 1):\r\n a, b = list(map(int, input().split()))\r\n adj_list[a - 1].append(b - 1)\r\n adj_list[b - 1].append(a - 1)\r\n\r\ninitial = list(map(int, input().split()))\r\ngoal = list(map(int, input().split()))\r\n\r\nans = 0\r\nqueue = [[0, 0, 0, 0]] # [node label, effect of even level flips, effect of odd level flips, current level]\r\nvisited = [0 for i in range(n)]\r\nvisited[0] = 1\r\n\r\nmoves = []\r\n\r\nwhile len(queue) != 0:\r\n node, even, odd, level = queue.pop()\r\n if level == 0:\r\n if (even == 0 and initial[node] != goal[node]) or (even == 1 and initial[node] == goal[node]):\r\n ans += 1\r\n even = 1 - even\r\n moves.append(node + 1)\r\n else:\r\n if (odd == 0 and initial[node] != goal[node]) or (odd == 1 and initial[node] == goal[node]):\r\n ans += 1\r\n odd = 1 - odd\r\n moves.append(node + 1)\r\n level = 1 - level\r\n\r\n for son in adj_list[node]:\r\n if visited[son] == 0:\r\n visited[son] = 1\r\n queue.append([son, even, odd, level])\r\n\r\nanswer_str = str(ans) + '\\n' + '\\n'.join([str(x) for x in moves])\r\nprint(answer_str)\r\n", "# /usr/bin/env python3.8\r\n# -*- coding:utf-8 -*-\r\n# author:guguanghui\r\nn = int(input())\r\nadj = list([] for i 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\na = [0] + list(map(int, input().split()))\r\nb = [0] + list(map(int, input().split()))\r\ndef dfs(u, p, c_lvl, p_lvl, d):\r\n stk = [(u, p, c_lvl, p_lvl)]\r\n while stk:\r\n u, p, c_lvl, p_lvl = stk.pop()\r\n if c_lvl != d[u]:\r\n c_lvl = 1 - c_lvl\r\n res.append(str(u))\r\n for v in adj[u]:\r\n if v != p:\r\n stk += [(v, u, p_lvl, c_lvl)]\r\n\r\nd = [i ^ j for (i, j) in zip(a, b)]\r\nres = []\r\ndfs(1, 0, 0, 0, d)\r\nprint(len(res))\r\nprint('\\n'.join(res))", "n=int(input())\r\nadj=[[] for i in range(n+1)]\r\nfor i in range(n-1):\r\n\ta,b=map(int,input().split())\r\n\tadj[a].append(b)\r\n\tadj[b].append(a)\r\nu=[-1]+list(map(int,input().split()))\r\nv=[-1]+list(map(int,input().split()))\r\nq=[(1,0,0,0)]\r\nans=[]\r\nwhile q:\r\n\tx,a,b,c=q.pop()\r\n\tif a:\r\n\t\tif b!=(u[x]!=v[x]):\r\n\t\t\tans.append(x)\r\n\t\t\tb=1-b\r\n\telse:\r\n\t\tif c!=(u[x]!=v[x]):\r\n\t\t\tans.append(x)\r\n\t\t\tc=1-c\r\n\ta=1-a\r\n\tfor i in adj[x]:\r\n\t\tadj[i].remove(x)\r\n\t\tq.append((i,a,b,c))\r\nprint(len(ans))\r\nprint('\\n'.join(map(str,ans)))", "n = int(input())\r\np = [[] for i in range(n + 1)]\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n p[a].append(b)\r\n p[b].append(a)\r\nu, v = ' ' + input()[:: 2], ' ' + input()[:: 2]\r\ns, q = [(1, 0, 0, 0)], []\r\nwhile s:\r\n a, k, i, j = s.pop()\r\n if k:\r\n if i != (u[a] != v[a]):\r\n q.append(a)\r\n i = 1 - i\r\n else:\r\n if j != (u[a] != v[a]):\r\n q.append(a)\r\n j = 1 - j\r\n k = 1 - k\r\n for b in p[a]:\r\n p[b].remove(a)\r\n s.append((b, k, i, j))\r\nprint(len(q))\r\nprint('\\n'.join(map(str, q)))", "R = lambda: map(int, input().split())\r\nn = int(input())\r\ntree = [list() for _ in range(n + 1)]\r\nfor i in range(n - 1):\r\n u, v = R()\r\n tree[u].append(v)\r\n tree[v].append(u)\r\nvals = [0] + list(R())\r\ntgts = [0] + list(R())\r\nq = [(1, 1, 0, [0, 0])]\r\ncnt = 0\r\nres = []\r\nwhile q:\r\n curr, prev, lvl, flips = q.pop()\r\n currFlips = flips[:]\r\n if (vals[curr] == tgts[curr]) == flips[lvl % 2] % 2:\r\n cnt += 1\r\n currFlips[lvl % 2] += 1\r\n res.append(curr)\r\n for nb in tree[curr]:\r\n if nb != prev:\r\n q.append((nb, curr, lvl + 1, currFlips))\r\nprint(cnt)\r\nfor x in res:\r\n print(x)", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput = stdin.readline\r\n\r\ng = defaultdict(list)\r\nn = int(input())\r\n\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\n\r\na = [0]+[int(i) for i in input().split()]\r\nb = [0]+[int(i) for i in input().split()]\r\n\r\nq = [[1, 0, 0, 0]]\r\nres = []\r\n\r\nwhile q:\r\n n, l, x, y = q.pop()\r\n if l:\r\n if x != (a[n] != b[n]):\r\n res.append(n)\r\n x ^= 1\r\n else:\r\n if y != (a[n] != b[n]):\r\n res.append(n)\r\n y ^= 1\r\n l ^= 1\r\n for nn in g[n]:\r\n g[nn].remove(n)\r\n q.append([nn, l, x, y])\r\n\r\nprint(len(res))\r\nfor i in res:\r\n print(i)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = [[] for _ in range(n)]\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n d[a-1].append(b-1)\r\n d[b-1].append(a-1)\r\n\r\nw1 = input()[:-1].split()\r\nw2 = input()[:-1].split()\r\n\r\nq = [(0,-1, 0, 0, 0)]\r\nans = []\r\nwhile q:\r\n a, b, c, x, y = q.pop()\r\n\r\n if c:\r\n if x != (w1[a] != w2[a]):\r\n ans.append(a+1)\r\n x = 1 - x\r\n else:\r\n if y != (w1[a] != w2[a]):\r\n ans.append(a+1)\r\n y = 1 - y\r\n c = 1 - c\r\n for i in d[a]:\r\n if i != b:\r\n q.append((i, a, c, x, y))\r\n\r\nans.sort()\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i)", "import sys\r\nread = lambda : list(map(int,sys.stdin.readline().split()))\r\n\r\nn, = read()\r\ngraph = [[] for _ in range(n)]\r\nfor _ in range(n-1):\r\n a,b = read()\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n\r\ninitial = read()\r\ngoal = read()\r\nansList = []\r\n\r\n\r\ndef dfs(node, par, odd, even, level):\r\n x = []\r\n if level:\r\n if initial[node]^odd != goal[node]:\r\n ansList.append(node)\r\n odd ^= 1\r\n else:\r\n if initial[node]^even != goal[node]:\r\n ansList.append(node)\r\n even ^= 1\r\n \r\n for item in graph[node]:\r\n if item != par:\r\n x.append((item, node, odd, even, level^1))\r\n return x\r\n\r\n\r\nstack = [(0,-1,0,0,0)]\r\nwhile stack:\r\n for item in dfs(*stack.pop()):\r\n stack.append(item)\r\n\r\nprint(len(ansList))\r\nfor ele in ansList:\r\n print(ele+1)\r\n", "# Author : -pratyay-\r\nimport sys\r\ninp=sys.stdin.buffer.readline\r\ninar=lambda: list(map(int,inp().split()))\r\ninin=lambda: int(inp())\r\ninst=lambda: inp().decode().rstrip('\\n\\r')\r\n# Am I debugging, check if I'm using same variable name in two places\r\n# Start Pyrival Bootstrap - by pajenegod\r\nfrom types import GeneratorType\r\ndef recursive(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack: 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); to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack: break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n# End PyRival Bootstrap;\r\ncounter=0\r\ninit=[]\r\ngoal=[]\r\nflip=[]\r\nans=[]\r\n@recursive\r\ndef dfs(gr,node):\r\n global init,goal,counter,flip,parent,flip,ans\r\n if parent[parent[node]]!=-1 : flip[node]=flip[parent[parent[node]]]\r\n init[node]^=flip[node]\r\n if init[node]!=goal[node]:\r\n init[node]=goal[node]\r\n flip[node]^=1\r\n counter+=1\r\n ans.append(node+1)\r\n for i in gr[node]:\r\n if i!=parent[node]:\r\n parent[i]=node \r\n yield dfs(gr,i)\r\n yield\r\n\r\n_T_=1#inin()\r\nfor _t_ in range(_T_):\r\n n=inin()\r\n counter=0\r\n graph=[[] for i in range(n)]\r\n for i in range(n-1):\r\n u,v=inar()\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n flip=[0 for i in range(n)]\r\n parent=[-1 for i in range(n)]\r\n init=inar()\r\n goal=inar()\r\n dfs(graph,0)\r\n print(counter)\r\n for i in ans:\r\n print(i)\r\n #print(init)\r\n #print(goal)", "from collections import deque, defaultdict\r\ngph = defaultdict(set)\r\nn = int(input())\r\nN = n + 1\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n gph[u].add(v)\r\n gph[v].add(u)\r\nvalue = [0] + list(map(int, input().split()))\r\ngoal = [0] + list(map(int, input().split()))\r\nparent = [None] * N\r\ndef g(x):\r\n p, n = parent[x]\r\n return 0 if p is None else parent[p][1]\r\ndef bfs():\r\n f =[]\r\n queue = deque()\r\n queue.append(1)\r\n parent[1] = (None, 0)\r\n while queue:\r\n x = queue.popleft()\r\n p, n = parent[x]\r\n z = g(x)\r\n if z % 2:\r\n value[x] = 1 - value[x]\r\n if value[x] != goal[x]:\r\n value[x] = 1 - value[x]\r\n f.append(str(x))\r\n z += 1\r\n for c in gph[x]:\r\n if not parent[c]:\r\n parent[c] = (x, z)\r\n queue.append(c)\r\n print(len(f))\r\n print('\\n'.join(f))\r\nbfs()", "from collections import deque, defaultdict\r\ngph, n = defaultdict(set), int(input())\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n gph[u].add(v)\r\n gph[v].add(u)\r\nvalue = [0] + list(map(int, input().split()))\r\ngoal = [0] + list(map(int, input().split()))\r\nparent = [None] * (n + 1)\r\nparent[1] = (None, 0)\r\nf, queue = [], deque([1])\r\nwhile queue:\r\n x = queue.popleft()\r\n p, n = parent[x]\r\n z = 0 if p is None else parent[p][1]\r\n if z % 2:\r\n value[x] = 1 - value[x]\r\n if value[x] != goal[x]:\r\n value[x] = 1 - value[x]\r\n f.append(str(x))\r\n z += 1\r\n for c in gph[x]:\r\n if not parent[c]:\r\n parent[c] = (x, z)\r\n queue.append(c)\r\nprint(len(f))\r\nprint('\\n'.join(f))", "# Author : -pratyay-\r\nimport atexit\r\nimport os\r\nimport sys\r\nimport __pypy__\r\n \r\n \r\nclass Fastio:\r\n def __init__(self):\r\n self.ibuf = bytes()\r\n self.pil = 0\r\n self.pir = 0\r\n self.sb = __pypy__.builders.StringBuilder()\r\n \r\n def load(self):\r\n self.ibuf = self.ibuf[self.pil:]\r\n self.ibuf += os.read(0, 131072)\r\n self.pil = 0\r\n self.pir = len(self.ibuf)\r\n \r\n def flush(self):\r\n os.write(1, self.sb.build().encode())\r\n \r\n def fastin(self):\r\n if self.pir - self.pil < 32:\r\n self.load()\r\n minus = 0\r\n x = 0\r\n while self.ibuf[self.pil] < 45:\r\n self.pil += 1\r\n if self.ibuf[self.pil] == 45:\r\n minus = 1\r\n self.pil += 1\r\n while self.ibuf[self.pil] >= 48:\r\n x = x * 10 + (self.ibuf[self.pil] & 15)\r\n self.pil += 1\r\n if minus:\r\n x = -x\r\n return x\r\n \r\n def fastout(self, x):\r\n self.sb.append(str(x))\r\n \r\n def fastoutln(self, x):\r\n self.sb.append(str(x))\r\n self.sb.append('\\n')\r\n \r\n \r\nfastio = Fastio()\r\ninp=fastio.fastin\r\nprint=fastio.fastoutln\r\natexit.register(fastio.flush)\r\nsys.stdin, sys.stdout = None, None\r\ndef inin(x=None):\r\n if x==None:\r\n return inp()\r\n else:\r\n return [inp() for i in range(x)]\r\n'''inp=sys.stdin.buffer.readline\r\ninar=lambda: list(map(int,inp().split()))\r\ninin=lambda: int(inp())\r\ninst=lambda: inp().decode().rstrip('\\n\\r')'''\r\n# Am I debugging, check if I'm using same variable name in two places\r\n# Start Pyrival Bootstrap - by pajenegod\r\n\r\nfrom types import GeneratorType\r\ndef recursive(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack: 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); to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack: break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n# End PyRival Bootstrap;\r\ncounter=0\r\ninit=[]\r\ngoal=[]\r\nflip=[]\r\nans=[]\r\n@recursive\r\ndef dfs(gr,node):\r\n global init,goal,counter,flip,parent,flip,ans\r\n if node!=0 and node not in gr[0] : \r\n flip[node]=flip[parent[parent[node]]]\r\n init[node]^=flip[node]\r\n if init[node]!=goal[node]:\r\n init[node]=goal[node]\r\n flip[node]^=1\r\n counter+=1\r\n ans.append(node+1)\r\n for i in gr[node]:\r\n if i!=parent[node]:\r\n parent[i]=node \r\n yield dfs(gr,i)\r\n yield\r\n\r\n_T_=1#inin()\r\nfor _t_ in range(_T_):\r\n n=inin()\r\n counter=0\r\n graph=[[] for i in range(n)]\r\n for i in range(n-1):\r\n u,v=inin(2)\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n flip=[0 for i in range(n)]\r\n parent=[-1 for i in range(n)]\r\n init=inin(n)\r\n goal=inin(n)\r\n dfs(graph,0)\r\n print(counter)\r\n for i in ans:\r\n print(i)\r\n #print(init)\r\n #print(goal)", "from collections import deque\r\n\r\nstack = deque()\r\n\r\nn = int(input())\r\nlinks = [tuple(map(lambda x:int(x)-1, input().split())) for i in range(n-1)]\r\n\r\nlinked_to = [[] for i in range(n)]\r\n\r\nfor x, y in links:\r\n linked_to[x].append(y)\r\n linked_to[y].append(x)\r\n\r\ninit = list(map(lambda x:x==\"1\", input().split()))\r\ngoal = list(map(lambda x:x==\"1\", input().split()))\r\n\r\n#print(init)\r\n#print(goal)\r\n\r\nstack.append(0)\r\nops = 0\r\n\r\nvisited = [False] * n\r\nparent = [n] * (n+1)\r\nwas_swapped = [False] * (n+1)\r\n\r\nvisited[0] = True\r\n\r\ndef xor(x, y):\r\n return x != y\r\n\r\ndef get_chld(i):\r\n for e in linked_to[i]:\r\n if e != parent[i]:\r\n yield e\r\n\r\nwhile len(stack) > 0:\r\n c = stack.pop()\r\n for l in linked_to[c]:\r\n if not visited[l]:\r\n visited[l] = True\r\n parent[l] = c\r\n stack.append(l)\r\n\r\nchosen = []\r\n\r\nstack.append(0)\r\n\r\nwhile len(stack) > 0:\r\n c = stack.pop()\r\n stack.extend(get_chld(c))\r\n was_swapped[c] = was_swapped[parent[parent[c]]]\r\n if xor(xor(init[c], goal[c]), was_swapped[c]):\r\n was_swapped[c] = not was_swapped[c]\r\n ops += 1\r\n chosen.append(c+1)\r\n\r\nprint(ops, *chosen, sep='\\n')\r\n\r\n", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\ng = defaultdict(list)\r\ndeg = [0] * (n+1)\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n g[a].append(b)\r\n g[b].append(a)\r\ninital = [0]+list(map(int, input().split()))\r\ngoal = [0]+list(map(int, input().split()))\r\ndiff = [i^j for i, j in zip(inital, goal)]\r\nres = []\r\nst = [(1,0,0,0)]\r\nwhile st:\r\n nd, par, cnt, cnt2 = st.pop()\r\n if cnt != diff[nd]:\r\n cnt = 1-cnt\r\n res.append(str(nd))\r\n for nb in g[nd]:\r\n if nb != par:\r\n st.append((nb, nd, cnt2, cnt))\r\n\r\nprint(len(res))\r\nprint('\\n'.join(res[::-1]))\r\n", "import sys\r\n\r\n\r\ndef dfs(tree, root, priv_root, cur_lvl, priv_lvl, diff, pick_list):\r\n # if tree is 1 or less nodes just return nothing\r\n if not tree:\r\n return\r\n stack = [(root, priv_root, cur_lvl, priv_lvl)]\r\n while stack:\r\n (root, priv_root, cur_lvl, priv_lvl) = stack.pop()\r\n # set level to account for only evens where a difference exists\r\n if cur_lvl ^ diff[root]:\r\n cur_lvl ^= 1\r\n pick_list.append(str(root))\r\n # add to the queue all cases where a vertex exists\r\n stack += [(vertex, root, priv_lvl, cur_lvl)\r\n for vertex in tree[root] if vertex != priv_root]\r\n\r\ndef main():\r\n n = int(input())\r\n tree = dict()\r\n for _ in range(n - 1):\r\n u, v = [int(x) for x in input().split()]\r\n tree[u] = tree.get(u, set()) | set([v])\r\n tree[v] = tree.get(v, set()) | set([u])\r\n init = [0] + [int(x) for x in input().split()]\r\n goal = [0] + [int(x) for x in input().split()]\r\n # find numbers that don't match that need to be accounted for\r\n diff = [i ^ j for (i, j) in zip(init, goal)]\r\n pick_list = list()\r\n\r\n dfs(tree, 1, 0, 0, 0, diff, pick_list)\r\n\r\n num = len(pick_list)\r\n print(num)\r\n if num:\r\n print('\\n'.join(pick_list))\r\n\r\nif __name__ == '__main__':\r\n sys.exit(main())", "from collections import defaultdict, deque\n\ndef dfs(node, pa, grandpa):\n\tvisited[node] = True\n\n\tif grandpa^initGoal[0][node] != initGoal[1][node]:\n\t\tgrandpa ^= 1\n\t\tans.append(node)\n\t\n\tfor child in tree[node]:\n\t\tif visited[child] == False:\n\t\t\tdfs(child, grandpa, pa)\n\n\ndef bfs():\n\tqueue = deque([[1, 0, 0]])\n\twhile queue:\n\t\tnode, pa, grandpa = queue.popleft()\n\t\tvisited[node] = True\n\n\t\tif grandpa^initGoal[0][node] != initGoal[1][node]:\n\t\t\tgrandpa ^= 1\n\t\t\tans.append(node)\n\n\t\tfor child in tree[node]:\n\t\t\tif visited[child] == False:\n\t\t\t\tqueue.append([child, grandpa, pa])\n\n\nn = int(input())\ntree = defaultdict(list)\n\nfor _ in range(n-1):\n\tu, v = map(int, input().split())\n\ttree[u].append(v)\n\ttree[v].append(u)\n\ninitGoal = []\ninitGoal.append([None] + list(map(int, input().split())))\ninitGoal.append([None] + list(map(int, input().split())))\n\nvisited = [False for _ in range(n+1)]\n\n# print(initGoal)\n# print(tree)\n\nans = []\n# dfs(1, 0, 0)\nbfs()\nprint(len(ans))\nfor x in ans:\n\tprint(x)\n", "from collections import defaultdict, Counter\r\n\r\n\r\ndef solve(tree, nodes2change):\r\n nodes2pick = []\r\n for node in nodes2change:\r\n nodes2pick.append(node)\r\n for child in tree[node]:\r\n for nephew in tree[child]:\r\n nodes2pick.append(nephew)\r\n\r\n ans = []\r\n cnt = Counter(nodes2pick)\r\n for k, v in cnt.items():\r\n if v % 2 == 1:\r\n ans.append(k)\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n graph = defaultdict(list)\r\n for _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\n node = 1\r\n stack = [1]\r\n visited = [False] * (n+1)\r\n visited[1] = True\r\n tree = defaultdict(list)\r\n while stack:\r\n cur = stack.pop()\r\n for child in graph[cur]:\r\n if not visited[child]:\r\n tree[cur].append(child)\r\n stack.append(child)\r\n visited[child] = True\r\n\r\n nodes2change = []\r\n start = [int(c) for c in input().split()]\r\n end = [int(c) for c in input().split()]\r\n for i, (s, e) in enumerate(zip(start, end), 1):\r\n if s != e:\r\n nodes2change.append(i)\r\n\r\n ans = solve(tree, nodes2change)\r\n print(len(ans))\r\n for node in ans:\r\n print(node)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nfrom types import GeneratorType\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\n# PYRIVAL BOOTSTRAP\r\n# https://github.com/cheran-senthil/PyRival/blob/master/pyrival/misc/bootstrap.py\r\n# This decorator allows for recursion without actually doing recursion\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\nn = ii()\r\ngraph = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = iis()\r\n graph[u].append(v)\r\n graph[v].append(u)\r\ninits = iis()\r\ngoals = iis()\r\n\r\nvisited = [0 for _ in range(n + 1)]\r\nvisited[1] = 1\r\nans = 0\r\nout = []\r\n\r\n\r\n@bootstrap\r\ndef dfs(node, level, levelCntsPar):\r\n levelCnts = levelCntsPar[::]\r\n if (inits[node - 1] + levelCnts[level % 2] % 2) % 2 != goals[node - 1]:\r\n out.append(node)\r\n global ans\r\n ans += 1\r\n levelCnts[level % 2] += 1\r\n for child in graph[node]:\r\n if not visited[child]:\r\n visited[child] = 1\r\n yield dfs(child, level + 1, levelCnts)\r\n yield\r\n\r\n\r\ndfs(1, 0, [0, 0])\r\n\r\nprint(ans)\r\nfor el in out:\r\n print(el)\r\n", "\r\nn = int(input())\r\nA = [[] for i in range(n+1)]\r\n\r\n\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n A[a].append(b)\r\n A[b].append(a)\r\n \r\nB = list(map(int, input().split()))\r\nC = list(map(int, input().split()))\r\nD = []\r\nS = [(1, 0 , 0, 0)]\r\n\r\nwhile len(S) != 0:\r\n \r\n u, a, b, c = S.pop()\r\n \r\n if c == 0:\r\n if a != (B[u-1] != C[u-1]):\r\n D.append(u)\r\n a = 1 - a\r\n \r\n else:\r\n if b != (B[u-1] != C[u-1]):\r\n D.append(u)\r\n b = 1 - b\r\n \r\n c = 1 - c\r\n \r\n \r\n for x in A[u]:\r\n A[x].remove(u)\r\n S.append((x, a, b, c))\r\n\r\nD.reverse()\r\nprint(len(D))\r\nprint('\\n'.join(map(str, D)))\r\n", "from collections import defaultdict,deque,Counter,OrderedDict\r\nimport sys\r\n\r\ndef main():\r\n n = int(input())\r\n adj = [ [] for i in range(n+1)]\r\n for i in range(n-1):\r\n a,b = map(int,input().split())\r\n a,b = a-1,b-1\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n init = [int(i) for i in input().split()]\r\n goal = [int(i) for i in input().split()]\r\n visited = [0]*n\r\n par = [[] for i in range(n)]\r\n dq = deque()\r\n dq.append((0,0))\r\n while len(dq) > 0:\r\n (s,p) = dq.pop()\r\n if visited[s]: continue\r\n visited[s] = 1\r\n par[p].append(s)\r\n for i in adj[s]:\r\n dq.append((i,s))\r\n par[0] = par[0][1:]\r\n ans = []\r\n dq = deque()\r\n dq.append((0,0,0,0))\r\n while len(dq) > 0:\r\n (s,l,fo,fe) = dq.pop()\r\n if l % 2 == 0:\r\n if fe % 2 == 1:\r\n init[s] = 1 - init[s]\r\n else:\r\n if fo % 2 == 1:\r\n init[s] = 1 - init[s]\r\n if init[s] != goal[s]:\r\n ans.append(s + 1)\r\n if l % 2:\r\n fo += 1\r\n else:\r\n fe += 1\r\n for j in par[s]:\r\n dq.append((j,l+1,fo,fe))\r\n\r\n print(len(ans))\r\n print(\"\\n\".join(map(str,ans)))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\n\nneighbors = [[] for i in range(n)]\n\nfor i in range(n - 1):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n neighbors[a].append(b)\n neighbors[b].append(a)\n\ninit = list(map(int, input().split()))\ngoal = list(map(int, input().split()))\n\n\nans = []\nvisited = [False for i in range(n)]\n\nstack = [(0, 0, 0)]\nvisited[0] = True\n\nwhile stack:\n index, a, b = stack[-1]\n stack.pop()\n cur = init[index] ^ a\n if cur != goal[index]:\n ans.append(index + 1)\n a = 1 - a\n for neighbor in neighbors[index]:\n if visited[neighbor]:\n continue\n visited[neighbor] = True\n stack.append((neighbor, b, a))\n\nprint(len(ans))\nfor num in ans:\n print(num)\n", "n=int(input())\r\nL=[[] for i in range(n)]\r\nfor i in range(n-1) :\r\n a,b=map(int,input().split())\r\n L[a-1].append(b-1)\r\n L[b-1].append(a-1)\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nW=[]\r\nfor i in range(n) :\r\n W.append(abs(l[i]-l1[i]))\r\nwas=[0 for i in range(n)]\r\nq=[[0,0,0]]\r\nans=[]\r\nwhile q :\r\n e=q[0]\r\n was[e[0]]=1\r\n if e[1]!=W[e[0]] :\r\n ans.append(e[0]+1)\r\n e[1]=1-e[1]\r\n for x in L[e[0]] :\r\n \r\n if was[x]==0 :\r\n q.append([x,e[2],e[1]])\r\n del q[0]\r\nprint(len(ans))\r\nprint('\\n'.join(map(str,ans)))\r\n \r\n \r\n \r\n", "import fileinput\n\ndef levels(n, e):\n\tl = [0 for _ in range(n)]\n\tq = [(0, -1, 0)]\n\twhile q:\n\t\tv, u, d = q.pop()\n\t\tl[v] = d\n\n\t\tfor w in e[v]:\n\t\t\tif w != u: q.append((w, v, d+1))\n\treturn l\n\ndef solve(n, e, x, g):\n\tl = levels(n, e)\n\n\tf = [0, 0]\n\tq = [(0, -1)]\n\tz = []\n\twhile q:\n\t\tv, u = q.pop()\n\n\t\tif v == -1:\n\t\t\tf = u\n\t\t\tcontinue\n\t\tq.append((-1, f[:]))\n\n\t\td = l[v]%2\n\t\tif (x[v]+f[d])%2 != g[v]:\n\t\t\tf[d] = (f[d]+1)%2\n\t\t\tz.append(v)\n\n\t\tfor w in e[v]:\n\t\t\tif w != u: q.append((w, v))\n\n\tprint(len(z))\n\tfor v in z: print(v+1)\n\nf = fileinput.input()\nn = int(f.readline())\ne = [[] for _ in range(n)]\nfor _ in range(n-1):\n\tv, w = tuple(map(int, f.readline().rstrip().split()))\n\te[v-1].append(w-1)\n\te[w-1].append(v-1)\nx = list(map(int, f.readline().rstrip().split()))\ng = list(map(int, f.readline().rstrip().split()))\nsolve(n, e, x, g)", "from collections import deque\n\nN = int(input())\n\nlinks = [[] for i in range(N)]\nfor i in range(N - 1):\n\tu, v = map(int, input().split())\n\tlinks[v - 1].append(u - 1)\n\tlinks[u - 1].append(v - 1)\n\ninit = list(map(int, input().split()))\ngoal = list(map(int, input().split()))\n\nnbFlip = 0\nflipped = []\nstack = []\nstack.append((0, -1, 0, 0, 0))\nwhile len(stack) > 0:\n\ti, parent, depth, nbEvens, nbOdds = stack.pop()\n\n\tif depth % 2 == 0:\n\t\tnodeValue = (init[i] + nbEvens) % 2\n\t\tif nodeValue != goal[i]:\n\t\t\tnbFlip += 1\n\t\t\tnbEvens += 1\n\t\t\tflipped.append(i)\n\telse:\n\t\tnodeValue = (init[i] + nbOdds) % 2\n\t\tif nodeValue != goal[i]:\n\t\t\tnbFlip += 1\n\t\t\tnbOdds += 1\n\t\t\tflipped.append(i)\n\n\tfor link in links[i]:\n\t\tif link != parent:\n\t\t\tstack.append((link, i, depth + 1, nbEvens, nbOdds))\n\nprint(nbFlip)\nfor flip in flipped:\n\tprint(flip + 1)", "from operator import xor\r\npos = []\r\nres = []\r\nn = 0\r\nv = []\r\nans = []\r\n\r\ndef BFS():\r\n global pos, res, v, ans\r\n mark = [False]*n\r\n mark[0] = True\r\n q = []\r\n if pos[0] == res[0]:\r\n q.append((0,0,0))\r\n else:\r\n q.append((0,0,1))\r\n ans.append(0)\r\n while len(q) > 0:\r\n x = q.pop(0)\r\n for i in v[x[0]]:\r\n if mark[i]:\r\n continue\r\n mark[i] = True\r\n if xor(x[1],pos[i])==res[i]:\r\n q.append((i,x[2],x[1]))\r\n else:\r\n q.append((i,x[2],xor(x[1],1)))\r\n ans.append(i)\r\nn = int(input())\r\nfor i in range(n):\r\n v.append(list([]))\r\nfor i in range(1,n):\r\n s = input()\r\n s = s.split()\r\n x = int(s[0])-1\r\n y = int(s[1])-1\r\n v[x].append(y)\r\n v[y].append(x)\r\ns = input()\r\ns = s.split()\r\nfor i in s:\r\n pos.append(int(i))\r\ns = input()\r\ns = s.split()\r\nfor i in s:\r\n res.append(int(i))\r\nBFS()\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i+1)", "import bisect\nimport math\nfrom collections import deque\nimport heapq\nimport functools\nfrom queue import Queue\nfrom collections import defaultdict\nfrom pprint import pprint\n\nmod = 998244353 \nN = 200005\n\ndef mul(a, b):\n\treturn (a*b)%mod\n\ndef add(a, b):\n\treturn (a+b) if (a+b<mod) else (a+b)-mod\n\ndef sub(a, b):\n\treturn (a-b) if (a-b>=0) else (a-b)+mod\n\ndef powr(a, b):\n\tans = 1\n\twhile b>0:\n\t\tif b & 1:\n\t\t\tans=mul(ans,a)\n\t\ta = mul(a,a) \n\t\tb//=2\n\treturn ans\n\ndef inv(n):\n\treturn powr(n, mod-2)\n\ndef factlist():\n\tfact = [1]\n\tfor i in range(1, N):\n\t\tfact.append(mul(fact[i-1],i))\n\treturn fact\n\ndef invfactlist(fact):\n\tinvfact=[0]*N\n\tinvfact[0]=1\n\tinvfact[N-1]= inv(fact[N-1])\n\tfor i in range(N-2, 0, -1):\n\t\tinvfact[i]= mul(invfact[i+1],(i+1))\n\t\n\treturn invfact\n\ndef rot(S):\n\treturn list(zip(*S[::-1]))\n\ndef gcd(a, b):\n\tif b==0:\n\t\treturn a\n\treturn gcd(b, a%b)\n\ndef generate():\n\tans = [0]\n\twhile ans[-1]<1000000000:\n\t\tans.append(1+ans[-1]*2)\n\treturn ans\n\n\ndef dfs(node, vis, curturn, con, ans, cnt):\n\tif ans[node]==1:\n\t\treturn ans[node]\n\tturn = [curturn]\n\tfor i in con[node]:\n\t\tif not i in vis:\n\t\t\tvis.add(i)\n\t\t\tturn.append(dfs(i, vis, curturn+1, con, ans, cnt)+1)\n\telse:\n\t\tif cnt[node]<=2:\n\t\t\tans[node] = sorted(turn)[0]\n\t\telse:\n\t\t\tans[node] = sorted(turn)[1]\n\treturn ans[node]\n\n\ndef main():\n\tn=int(input())\n\tadj=[[] for i in range(n+1)]\n\tfor i in range(n-1):\n\t\ta,b=map(int,input().split())\n\t\tadj[a].append(b)\n\t\tadj[b].append(a)\n\n\tu=[-1]+list(map(int,input().split()))\n\tv=[-1]+list(map(int,input().split()))\n\n\tq=[(1,0,0,0)]\n\tans=[]\n\twhile q:\n\t\tx,a,b,c=q.pop()\n\t\tif a:\n\t\t\tif b!=(u[x]^v[x]):\n\t\t\t\tans.append(x)\n\t\t\t\tb=1^b\n\t\telse:\n\t\t\tif c!=(u[x]^v[x]):\n\t\t\t\tans.append(x)\n\t\t\t\tc=1^c\n\t\ta=1^a\n\t\tfor i in adj[x]:\n\t\t\tadj[i].remove(x)\n\t\t\tq.append((i,a,b,c))\n\tprint(len(ans))\n\tprint('\\n'.join(map(str,ans)))\n\n\n\n\n\n\nif __name__ == \"__main__\":\n main()\n \n\t", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Created on: 24/09/2020 19:25:32\r\n\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport heapq\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations, permutations\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\ndef getAns(init, goal, d):\r\n queue = deque([[0, -1, 0, 0, 0]])\r\n seen = set()\r\n ans = []\r\n while len(queue):\r\n cur, par, xor0, xor1, depth = queue.popleft()\r\n if cur not in seen:\r\n seen.add(cur)\r\n if init[cur] ^ xor0 != goal[cur] and depth == 0:\r\n ans.append(cur + 1)\r\n xor0 ^= 1\r\n if init[cur] ^ xor1 != goal[cur] and depth == 1:\r\n ans.append(cur + 1)\r\n xor1 ^= 1\r\n for neigh in d.get(cur, []):\r\n queue.append([neigh, cur, xor0, xor1, depth ^ 1])\r\n return ans\r\n\r\nn = ii1()\r\nd = {}\r\nfor i in range(n - 1):\r\n a, b = iia()\r\n d.setdefault(a - 1, []).append(b - 1)\r\n d.setdefault(b - 1, []).append(a - 1)\r\ninit = iia()\r\ngoal = iia()\r\nans = getAns(init, goal, d)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i)\r\n\r\n", "# Author : -pratyay-\r\n\r\n'''inp=sys.stdin.buffer.readline\r\ninar=lambda: list(map(int,inp().split()))\r\ninin=lambda: int(inp())\r\ninst=lambda: inp().decode().rstrip('\\n\\r')'''\r\n# Am I debugging, check if I'm using same variable name in two places\r\n\r\nimport sys\r\n_ord, inp, num, neg, _Index = lambda x: x, [], 0, False, 0\r\ni, s = 0, sys.stdin.buffer.read()\r\ntry:\r\n while True:\r\n if s[i] >= b\"0\"[0]:num = 10 * num + _ord(s[i]) - 48\r\n elif s[i] == b\"-\"[0]:neg = True\r\n elif s[i] != b\"\\r\"[0]:\r\n inp.append(-num if neg else num)\r\n num, neg = 0, False\r\n i += 1\r\nexcept IndexError: pass\r\nif s and s[-1] >= b\"0\"[0]: inp.append(-num if neg else num)\r\ndef inin(size=None):\r\n global _Index\r\n if size==None:\r\n ni=_Index;_Index+=1\r\n return inp[ni]\r\n else:\r\n ni=_Index;_Index+=size\r\n return inp[ni:ni+size]\r\n\r\nfrom types import GeneratorType\r\ndef recursive(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack: 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); to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack: break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n# End PyRival Bootstrap;\r\ncounter=0\r\ninit=[]\r\ngoal=[]\r\nflip=[]\r\nans=[]\r\n@recursive\r\ndef dfs(gr,node):\r\n global init,goal,counter,flip,parent,flip,ans\r\n if node!=0 and node not in gr[0] : \r\n flip[node]=flip[parent[parent[node]]]\r\n init[node]^=flip[node]\r\n if init[node]!=goal[node]:\r\n init[node]=goal[node]\r\n flip[node]^=1\r\n counter+=1\r\n ans.append(node+1)\r\n for i in gr[node]:\r\n if i!=parent[node]:\r\n parent[i]=node \r\n yield dfs(gr,i)\r\n yield\r\n\r\n_T_=1#inin()\r\nfor _t_ in range(_T_):\r\n n=inin()\r\n counter=0\r\n graph=[[] for i in range(n)]\r\n for i in range(n-1):\r\n u,v=inin(2)\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n flip=[0 for i in range(n)]\r\n parent=[-1 for i in range(n)]\r\n init=inin(n)\r\n goal=inin(n)\r\n dfs(graph,0)\r\n print(counter)\r\n for i in ans:\r\n print(i)\r\n #print(init)\r\n #print(goal)" ]

[ "n = int(input())\r\nx = False\r\nA = [int(i) for i in input().split()]\r\nfor i in range(n-2):\r\n\tx1 , x2= min(A[i],A[i+1]),max(A[i],A[i+1])\r\n\tfor j in range(i+1,n-1):\r\n\t\tX1,X2 = min(A[j],A[j+1]),max(A[j],A[j+1])\r\n\t\tif(x1<X1 and X1<x2 and x2<X2):\r\n\t\t\tx = True\r\n\t\telif(X1<x1 and X2>x1 and X2<x2):\r\n\t\t\tx = True\r\nif(x):\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")", "def main():\n n = int(input())\n l = []\n a = 0\n for b in map(int, input().split()):\n if a < b:\n l.append((a, b))\n else:\n l.append((b, a))\n a = b\n l[0] = ((0, 0))\n l.sort()\n for i, (c, d) in enumerate(l):\n for j in range(i):\n a, b = l[j]\n if a < c < b < d:\n print('yes')\n return\n print('no')\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\r\nlst = [int(x) for x in input().split()]\r\na = lst[:]\r\na = sorted(a)\r\nf = 0\r\nfor i in range(n - 1):\r\n for j in range(n - 1):\r\n if i != j:\r\n x1 = [lst[i], lst[i + 1]]\r\n x2 = [lst[j], lst[j + 1]]\r\n x1 = sorted(x1)\r\n x2 = sorted(x2)\r\n if x1[0] < x2[0] < x1[1] < x2[1]:\r\n f = 1\r\nif f == 1:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "from itertools import combinations as c\n\ndef main():\n a = int(input())\n\n if a <= 3:\n print(\"no\")\n return\n \n b = map(int, input().split())\n l = []\n x0 = next(b)\n for i in b:\n l.append((min(x0, i), max(x0, i)))\n x0 = i\n\n for i, j in c(l, 2):\n if i[0] < j[0] < i[1] < j[1] or j[0] < i[0] < j[1] < i[1]:\n print(\"yes\")\n return\n\n print(\"no\")\n\nmain()\n", "#!/usr/bin/env python3\nn = int(input())\nxs = list(map(int,input().split()))\nfound = False\nfor i in range(n-1):\n al = min(xs[i], xs[i+1])\n ar = max(xs[i], xs[i+1])\n for j in range(i):\n bl = min(xs[j], xs[j+1])\n br = max(xs[j], xs[j+1])\n if al < bl < ar < br or bl < al < br < ar:\n found = True\n break\n if found:\n break\nprint(found and 'yes' or 'no')\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nc = []\r\nfor i in range(n-1):\r\n c.append((min(x[i], x[i+1]), max(x[i], x[i+1])))\r\n\r\nfor i in range(0, len(c)):\r\n for j in range(0, len(c)):\r\n if c[i][0] < c[j][0] <c[i][1] < c[j][1] or c[j][0] < c[i][0] <c[j][1] < c[i][1]:\r\n print('yes')\r\n exit()\r\n\r\nprint('no')", "'''input\r\n4\r\n0 15 5 10\r\n\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\nn = getint()\r\narr = getints()\r\ns = set()\r\nfor i in range(1,n):\r\n\ta = [arr[i],arr[i-1]]\r\n\ta.sort()\r\n\ts.add(tuple(a))\r\ns = list(sorted(s))\r\nn = len(s)\r\ntest = False\r\n# print(s)\r\nfor i in range(n-1):\r\n\tfor j in range(i+1,n):\r\n\t\tif s[i][0]<s[j][0] and s[j][1]>s[i][1] and s[i][1]>s[j][0]: test = True\r\n\t\tif s[j][0]<s[i][0] and s[i][1]>s[j][1] and s[j][1]>s[i][0]: test = True\r\n\r\nprint(\"yes\") if test else print(\"no\")", "def take_input(s): #for integer inputs\r\n if s == 1: return int(input())\r\n return map(int, input().split())\r\n\r\nn = take_input(1)\r\nif n == 1: print(\"no\"); exit()\r\na = list(take_input(n))\r\nflag = 0\r\nfor i in range(1,n-1):\r\n for j in range(i):\r\n init_1 = min(a[i],a[i+1]); fin_1 = max(a[i],a[i+1])\r\n init_2 = min(a[j],a[j+1]); fin_2 = max(a[j],a[j+1])\r\n if ((init_1 > init_2 and init_1 < fin_2 and fin_1 > fin_2) or (init_1 < init_2 and fin_1 > init_2 and fin_1<fin_2)) and flag == 0: \r\n print(\"yes\")\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(\"no\")\r\n", "n = int(input())\r\n\r\nmoves = [int(z) for z in input().split()]\r\n\r\nsemicircles = []\r\nfor i in range(1, n):\r\n semicircles.append(sorted([moves[i-1], moves[i]]))\r\n#print(semicircles)\r\nans = 0\r\nfor i in semicircles:\r\n for j in semicircles:\r\n if i[0] < j[0] and j[0] < i[1] and i[1] < j[1]:\r\n ans = 1\r\n\r\nif ans: print(\"yes\")\r\nelse: print(\"no\")\r\n", "n=int(input())\r\nr=[int(c)for c in input().split()]\r\nr=[sorted(r[i:i+2])for i in range(n-1)]\r\nprint(['no','yes'][any(a<c<b<d for a,b in r for c,d in r)])", "# read the inputs\r\n#maintain a table of values that you have seen.\r\n# maintain the current and the next entry\r\n# for every next entry , check if any point in the hash table has that value.\r\n\r\nimport sys\r\nn=int(input())\r\nvalues=[int(v) for v in input().split()]\r\n# Previous solution\r\nprev=values[0]\r\nexplored=[]\r\nfor i in range(1,n,1):\r\n\tcur=values[i]\r\n\tless,great = min(cur,prev),max(cur,prev)\r\n\tfor val in explored:\r\n\t\tstart,end = val\r\n\t\tif (less < start and great > start and less < end and great < end) or (less < end and great > end and less > start and great > start): \r\n\t\t\tprint('yes')\r\n\t\t\tsys.exit()\r\n\texplored.append((less,great))\r\n\tprev=cur\t\r\nprint('no')\r\n\r\n'''explored = []\r\nprev=values[0]\r\nfor v in values:\r\n\tif v < prev:\r\n\t\tfor e in explored:\r\n\t\t\tif v < e and e < prev:\r\n\t\t\t\tprint('yes')\r\n\t\t\t\tsys.exit()\r\n\telif v > prev:\r\n\t\tfor e in explored:\r\n\t\t\tif v > e and e > prev:\r\n\t\t\t\tprint('yes')\r\n\t\t\t\tsys.exit()\r\n\tprev=v\r\n\texplored.append(v)\r\nprint('no')'''\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(n - 1):\r\n z, b = min(a[i], a[i + 1]), max(a[i], a[i + 1])\r\n for j in range(n - 1):\r\n c, d = min(a[j], a[j + 1]), max(a[j], a[j + 1])\r\n if z < c < b < d:\r\n print('yes')\r\n exit()\r\nprint('no')", "import sys\r\nimport math\r\n \r\ndef intersect(xa1, xa2, xb1, xb2):\r\n vmin = min(xa2, xb2)\r\n vmax = max(xa1, xb1)\r\n\r\n if((vmin == xa2 and vmax == xa1) or (vmin == xb2 and vmax == xb1)):\r\n return False\r\n else:\r\n return vmax < vmin\r\n\r\nn = int(input())\r\nxn = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nx1x2 = []\r\nlastx = xn[0]\r\nfor i in xn[1:]:\r\n if(i > lastx):\r\n x1x2.append((lastx, i))\r\n else:\r\n x1x2.append((i, lastx))\r\n\r\n lastx = i\r\n\r\nfor i in range(len(x1x2) - 1):\r\n for j in range(i + 1, len(x1x2)):\r\n if(intersect(x1x2[i][0], x1x2[i][1], x1x2[j][0], x1x2[j][1])):\r\n print(\"yes\")\r\n exit()\r\n\r\nprint(\"no\")", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\narr=[]\r\nfor i in range(n-1):\r\n arr.append(sorted([a[i],a[i+1]]))\r\nfor j in range(len(arr)):\r\n c=0\r\n for k in range(len(arr)):\r\n if arr[j][0]<arr[k][0]<arr[j][1]<arr[k][1] or arr[k][0]<arr[j][0]<arr[k][1]<arr[j][1]:print(\"yes\");c=1;break\r\n if c==1:break\r\nelse:print(\"no\")\r\n ", "length = int(input())\r\nsequence = list(map(int, input().split()))\r\nif length <= 3:\r\n print('no')\r\nelse:\r\n for i in range(length - 1):\r\n w, x = sorted([sequence[i], sequence[i + 1]])\r\n for j in range(length - 1):\r\n y, z = sorted([sequence[j], sequence[j + 1]])\r\n if w < y < x < z or y < w < z < x:\r\n print('yes')\r\n exit()\r\n print('no')", "n = int(input())\nlst = list(map(int,input().split()))\n\na = list(zip(lst,lst[1:]))\n\nrecord = []\n\nfor x in a:\n s,e = min(x[0],x[1]),max(x[0],x[1])\n for y in record:\n if y[0]<s<y[1]<e or s<y[0]<e<y[1]:\n exit(print(\"yes\"))\n record.append((s,e))\nprint(\"no\")\n\n\n", "n = int(input())\ns = [int(i) for i in input().split()]\ns = [s[i:i+2] for i in range(n-1)]\nf = 0\nfor i in range(n-1):\n a,b = min(s[i]),max(s[i])\n for j in range(n-1):\n if i!=j:\n c,d = min(s[j]),max(s[j])\n if (a<c and c<b and b<d) or (c<a and a<d and d<b):\n print('yes')\n f = 1\n break\n if f == 1:\n break\nif f == 0:\n print(\"no\")\n\n", "def Intersect(aa,bb,xx,yy):\n a=min(aa,bb)\n b=max(aa,bb)\n x=min(xx,yy)\n y=max(xx,yy)\n \n if(a>=x and b<=y):\n return False\n if(x>=a and y<=b):\n return False\n if(b<=x):\n return False\n if(y<=a):\n return False\n return True\n\nN=int(input())\n\ncase=False\n\nL=list(map(int,input().split()))\n\nfor i in range(N-1):\n for j in range(i+1,N-1):\n if(Intersect(L[i],L[i+1],L[j],L[j+1])):\n case=True\nif(case):\n print(\"yes\")\n\nelse:\n print(\"no\")\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\np=[]\r\nfor i in range(n-1):\r\n\tp.append([min(a[i],a[i+1]),max(a[i],a[i+1])])\r\nfor i in p:\r\n\tfor j in p:\r\n\t\tif i[0]<j[0]<i[1]<j[1] or j[0]<i[0]<j[1]<i[1]:\r\n\t\t\tprint(\"yes\")\r\n\t\t\texit()\r\nprint(\"no\")", "def solve():\r\n n=int(input())\r\n a=list(map(int, input().strip().split()))\r\n points=[]\r\n for i in range(n-1):\r\n points.append([min(a[i], a[i+1]), max(a[i], a[i+1])])\r\n for i in range(len(points)-1):\r\n for j in range(i+1, len(points)):\r\n if points[i][0]< points[j][0] and points[i][1]>points[j][0] and points[i][1]<points[j][1]:\r\n print(\"yes\") #self-intersection exists\r\n return\r\n elif points[j][0]< points[i][0] and points[j][1]>points[i][0] and points[j][1]<points[i][1]:\r\n print(\"yes\") #self-intersection exists\r\n return\r\n \r\n print(\"no\") #self-intersection doesn't exists\r\n\r\nsolve()", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(i+1,n-1):\r\n a = min(arr[i], arr[i+1])\r\n b = max(arr[i], arr[i+1])\r\n c = min(arr[j], arr[j+1])\r\n d = max(arr[j], arr[j+1])\r\n \r\n if a < c < b < d or c < a < d < b:\r\n print(\"yes\")\r\n exit()\r\nprint('no')\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "def Check(I,J):\r\n if Num[I][0]==Num[J][0]:\r\n if Num[I][1]==Num[J][1]:\r\n return 1\r\n elif Num[J][0]<Num[I][1]and Num[I][1]<Num[J][1]:\r\n return 1\r\n return 0\r\nN=int(input())\r\nTmp=list(map(int,input().split()))\r\nNum=[(min(Tmp[I-1],Tmp[I]),max(Tmp[I-1],Tmp[I]))for I in range(1,N)]\r\nNum.sort()\r\nFlg=0\r\nfor I in range(len(Num)):\r\n for J in range(I+1,len(Num)):\r\n if Check(I,J)==1:\r\n Flg=1\r\n break\r\nif Flg:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "n=int(input())\r\na=[*map(int,input().split())]\r\nb=[]\r\nfor i in range(n-1):\r\n b.append([min(a[i],a[i+1]),max(a[i],a[i+1])])\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n if i==j:\r\n continue\r\n if b[i][0]<b[j][0]<b[i][1]<b[j][1] or b[i][0]<b[j][1]<b[i][1]<b[j][0]:\r\n print('yes')\r\n exit(0)\r\nprint('no')", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n x,y=(sorted([a[i],a[i+1]]))\r\n m,t=sorted([a[j],a[j+1]])\r\n if x<m<y<t or m<x<t<y:\r\n print(\"yes\")\r\n exit(0)\r\nprint(\"no\")\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n x,y=(sorted([l[i],l[i+1]]))\r\n x1,y1=sorted([l[j],l[j+1]])\r\n if(x<x1<y<y1 or x1<x<y1<y):\r\n print(\"yes\")\r\n exit(0)\r\nprint(\"no\")", "n = int(input())\r\ncord = list(map(int,input().split()))\r\ncheck = 0\r\nfor i in range(n-1):\r\n a,b = cord[i],cord[i+1]\r\n if a>b:\r\n a,b = b,a\r\n for j in range(n-1):\r\n x,y = cord[j],cord[j+1]\r\n if x>y:\r\n x,y = y,x\r\n if (a<x and b>x and b<y) or (a>x and a<y and b>y):\r\n print('yes')\r\n check = 1\r\n break\r\n if check==1:\r\n break\r\nif check==0:\r\n print('no')", "n = int(input())\r\na = list(map(int, input().split()))\r\nsegs = [sorted((a[i], a[i + 1])) for i in range(n - 1)]\r\nfor i in range(n - 1):\r\n for j in range(n - 1):\r\n if segs[i][0] < segs[j][0] < segs[i][1] < segs[j][1]:\r\n print('yes')\r\n exit()\r\nprint('no')", "n=int(input())\r\narr=list(map(int,input().split()))\r\n\r\nfor x in range(len(arr)-1):\r\n x1,x2=(arr[x],arr[x+1])\r\n if x1>x2:\r\n x1,x2=x2,x1\r\n for y in range(x+2,len(arr)-1):\r\n x3,x4=(arr[y],arr[y+1])\r\n if x3>x4:\r\n x3,x4=x4,x3\r\n if x1<x3<x2<x4 or x3<x1<x4<x2:\r\n print(\"yes\")\r\n exit()\r\n \r\nprint(\"no\")", "n=int(input())\na=list(map(int,input().split()))\np=[]\nfor i in range(n-1):\n\tp.append([min(a[i],a[i+1]),max(a[i],a[i+1])])\nfor i in p:\n\tfor j in p:\n\t\tif i[0]<j[0]<i[1]<j[1] or j[0]<i[0]<j[1]<i[1]:\n\t\t\tprint(\"yes\")\n\t\t\texit()\nprint(\"no\")", "n,l=int(input()),list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n x=sorted([l[i],l[i+1]])+sorted([l[j],l[j+1]])\r\n if x[0]<x[2]<x[1]<x[3]:\r\n exit(print('yes'))\r\nprint('no')", "n = int(input())\nx = list(map(int,input().split()))\nf=0\nfor i in range(n-1):\n\ta=x[i] if x[i]<x[i+1] else x[i+1]\n\tb=x[i+1] if a==x[i] else x[i]\n\tfor j in range(i+2,n-1):\n\t\tc= min(x[j],x[j+1])\n\t\td = max(x[j],x[j+1])\n\t\tif a<c and c<b and b<d:\n\t\t\tf=1\n\t\t\tbreak\n\t\telif c<a and a<d and d<b:\n\t\t\tf=1\n\t\t\tbreak\n\tif f:\n\t\tbreak\n\nif f :\n\tprint(\"yes\")\nelse:\n\tprint(\"no\")\n", "n = int( input() )\nl = [int(x) for x in input().split()]\nfound = False\n\nif n<4:\n\tprint(\"no\")\nelse:\n for i in range(n-2):\n a= min(l[i], l[i+1])\n b= max(l[i], l[i+1])\n for j in range(i+1, n-1, 1):\n c=min(l[j], l[j+1])\n d=max(l[j],l[j+1])\n\t\t\t\n if c<a and a<d and b>d:\n found = True\n break\n if c<b and b<d and a<c:\n found = True\n break\n if found:\n break\n if found:\n print(\"yes\")\n else:\n print(\"no\")\n", "import sys\r\ndef fun(x1,x2,y1,y2):\r\n if x1<x2:\r\n if (y1<x1 and y2>x1 and y2<x2) or (y2<x1 and y1>x1 and y1<x2):\r\n return True\r\n elif (y1>x1 and y1<x2 and y2>x2) or (y2>x1 and y2<x2 and y1>x2):\r\n return True\r\n else:\r\n if (y1<x2 and y2>x2 and y2<x1) or (y2<x2 and y1>x2 and y1<x1):\r\n return True\r\n elif (y1>x2 and y1<x1 and y2>x1) or (y2>x2 and y2<x1 and y1>x1):\r\n return True\r\n return False\r\nn=int(input())\r\npoints=list(map(int,input().split()))\r\ni=0\r\nwhile i<n-1:\r\n j=i+1\r\n while j<n-1:\r\n if fun(points[i],points[i+1],points[j],points[j+1]):\r\n print(\"yes\")\r\n sys.exit()\r\n j+=1\r\n i+=1\r\nprint(\"no\")\r\n", "n = int(input())\r\n \r\nline = list(map(int, input().split()))\r\npairs = []\r\n \r\nresult = \"no\"\r\n \r\nfor i in range(0, n-1):\r\n pairs.append([min(line[i], line[i+1]), max(line[i], line[i+1])])\r\n\r\ndef check():\r\n global pairs, result\r\n while pairs != []:\r\n for i in range(len(pairs)):\r\n if pairs[0] != pairs[i] and ((pairs[0][1] < pairs[i][1] and pairs[0][1] > pairs[i][0] and pairs[0][0] < pairs[i][0]) or (pairs[0][0] > pairs[i][0] and pairs[0][0] < pairs[i][1] and pairs[0][1] > pairs[i][1])):\r\n result = \"yes\"\r\n return\r\n del pairs[0]\r\n\r\ncheck()\r\nprint(result)", "def edge_intersects(edge, l):\r\n for other_edge in l:\r\n if min(other_edge) < min(edge) and max(other_edge) > min(edge) and max(other_edge) < max(edge):\r\n return True\r\n if min(other_edge) < max(edge) and min(other_edge) > min(edge) and max(other_edge) > max(edge):\r\n return True\r\n return False\r\n\r\n \r\n\r\ndef intersects(l):\r\n # Form the edges\r\n edges = [(l[i], l[i+1]) for i in range(0, len(l)-1)]\r\n \r\n for i in range(len(edges) - 1):\r\n if edge_intersects(edges[i], edges[i+1:]) == True:\r\n return True\r\n return False\r\n\r\nn = input()\r\nl = [int(item) for item in input().split()]\r\n\r\n\r\nif intersects(l):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n##l = [int(item) for item in input().split()]\r\n##print(l)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncheck=True\r\nb=[[a[i], a[i+1]] for i in range(n-1)]\r\nfor i in range(n-1):\r\n b[i].sort()\r\n for j in range(i):\r\n if (b[i][0] < b[j][0] < b[i][1] < b[j][1] or b[j][0] < b[i][0] < b[j][1] < b[i][1]):\r\n check = False\r\nif(check):\r\n print(\"no\")\r\nelse:\r\n print(\"yes\")\r\n", "n, x = eval(input()), list(map(eval,input().split())); jud = False\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n a, b, c, d = min(x[i],x[i+1]), max(x[i],x[i+1]), min(x[j],x[j+1]), max(x[j],x[j+1])\r\n if a < c < b < d: jud = True; break\r\n if jud: break\r\nprint(\"yes\" if jud else \"no\")", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx=[sorted(x[i:i+2]) for i in range(n-1)]\r\nfor c,d in x:\r\n for a,b in x:\r\n if a<c<b<d:\r\n print(\"yes\")\r\n exit()\r\nprint(\"no\")", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nif n==2 or n==1:\r\n print(\"no\")\r\n exit()\r\nl=[[arr[0],arr[1]],[arr[1],arr[2]]]\r\nfor i in range(2,n-1):\r\n for j in range(i):\r\n x= abs(abs(l[j][0]-l[j][1])/2 - abs(arr[i]-arr[i+1])/2) < abs((l[j][0]+l[j][1])/2 - (arr[i]+arr[i+1])/2 ) < abs(l[j][0]-l[j][1])/2 + abs(arr[i]-arr[i+1])/2\r\n if x:\r\n print(\"yes\")\r\n exit()\r\n l.append([arr[i],arr[i+1]])\r\nprint(\"no\")\r\n", "n = int(input().strip())\r\npoints = list(map(int, input().strip().split()))\r\nlst = []\r\nval = False\r\nfor i in range(n - 1):\r\n item = [points[i], points[i+1]]\r\n item.sort()\r\n lst.append(item)\r\nfor x in range(n - 1):\r\n arc1 = lst[x]\r\n for y in range(x, n - 1):\r\n arc2 = lst[y]\r\n if arc1[0] < arc2[0] and arc2[0] < arc1[1] and arc1[1] < arc2[1]:\r\n val = True\r\n break\r\n elif arc2[0] < arc1[0] and arc1[0] < arc2[1] and arc2[1] < arc1[1]:\r\n val = True\r\n break\r\nif val:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "n = int(input())\nA = [int(i) for i in input().split()]\nres = \"no\"\nsemi_circles = []\n\nfor i in range(1, len(A)):\n if A[i-1] < A[i]:\n semi_circles.append([A[i-1], A[i]])\n else:\n semi_circles.append([A[i], A[i-1]])\n \nres = 'no'\n\nfor i in range(len(semi_circles)):\n for j in range(i+1, len(semi_circles)):\n x1, x2 = semi_circles[i]\n x3, x4 = semi_circles[j]\n\n if x1<x3<x2<x4 or x3<x1<x4<x2:\n res = \"yes\"\n break \n \n if res=='yes':\n break\n\nprint(res)", "t = int(input())\r\nn = list(map(int,input().split()))\r\npairs = [sorted([n[c],n[c+1]]) for c in range(len(n)-1)]\r\nfor i in range(len(pairs)):\r\n for j in range(len(pairs)):\r\n k = pairs[i]\r\n k1 = pairs[j]\r\n if ((k[0]>k1[0] and k[1]>k1[1]) or (k[0]<k1[0] and k[1]<k1[1])) and (k[1] > k1[0]) and (k[0] < k1[1]):\r\n print(\"yes\")\r\n exit(0)\r\nprint(\"no\")", "def line(lst):\r\n b = list()\r\n for i in range(len(lst) - 1):\r\n b.append((min(lst[i], lst[i + 1]), max(lst[i], lst[i + 1])))\r\n\r\n for i in range(len(b)):\r\n for j in range(len(b)):\r\n if b[i][0] < b[j][0] < b[i][1] < b[j][1] or b[j][0] < b[i][0] < b[j][1] < b[i][1]:\r\n return \"yes\"\r\n return \"no\"\r\n\r\n\r\nn = int(input())\r\nx = [int(z) for z in input().split()]\r\nprint(line(x))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif n<4:\r\n print(\"no\")\r\nelse:\r\n prev=l[1]\r\n ans=\"no\"\r\n for i in range(2,n):\r\n for j in range(1,n):\r\n if min(l[j],l[j-1])<min(prev,l[i])<max(l[j],l[j-1]) and max(l[i],prev)>max(l[j],l[j-1]):\r\n ans=\"yes\"\r\n break\r\n if min(l[j],l[j-1])<max(prev,l[i])<max(l[j],l[j-1]) and min(l[i],prev)<min(l[j],l[j-1]):\r\n ans=\"yes\"\r\n break\r\n if ans==\"yes\":\r\n break\r\n prev=l[i]\r\n print(ans)", "\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\nintersection_happened = False\r\nfor i in range(0, n-1):\r\n for j in range(i+2, n-1):\r\n start_1 = min(v[i], v[i+1])\r\n end_1 = max(v[i], v[i+1])\r\n start_2 = min(v[j], v[j+1])\r\n end_2 = max(v[j], v[j+1])\r\n\r\n if start_2 < end_1 and end_2 > start_1:\r\n if start_1 < start_2 and end_1 < end_2:\r\n intersection_happened = True\r\n elif start_1 > start_2 and end_1 > end_2:\r\n intersection_happened = True\r\n\r\nif intersection_happened and bool:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n\r\n", "a=int(input())\r\nz=[]\r\nte=list(map(int,input().split()))\r\nfor i in range(1,len(te)):\r\n z.append([min(te[i],te[i-1]),max(te[i],te[i-1])])\r\n\r\nflag=0\r\nfor i in range(len(z)):\r\n for j in range(i+1,len(z)):\r\n if(z[j][0]<z[i][0]<z[j][1] and z[i][1]>z[j][1]):\r\n flag=1\r\n break;\r\n if(z[i][0]<z[j][0]<z[i][1] and z[j][1]>z[i][1]):\r\n flag=1\r\n break;\r\nif(flag==1):\r\n print('yes')\r\nelse:\r\n print('no')\r\n \r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\npairs=[]\r\nfor i in range(n-1):\r\n pairs.append((min(l1[i],l1[i+1]),max(l1[i],l1[i+1])))\r\nflag=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n-1):\r\n if pairs[i][0]>pairs[j][0] and pairs[i][0]<pairs[j][1] and pairs[i][1]>pairs[j][1]:\r\n flag=1\r\n break\r\n elif pairs[i][0]<pairs[j][0] and pairs[i][1]>pairs[j][0] and pairs[i][1]<pairs[j][1]:\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\nif flag==1:\r\n print(\"yes\")\r\nelse :\r\n print(\"no\")\r\n ", "def main():\r\n\tn = int(input())\r\n\ta = list(map(int,input().split()))\r\n\tfor i in range(n-1):\r\n\t\tfor j in range(n-1):\r\n\t\t\tif min(a[i],a[i+1])<min(a[j],a[j+1]) and min(a[j],a[j+1])<max(a[i],a[i+1]) and max(a[i],a[i+1])<max(a[j],a[j+1]):\r\n\t\t\t\tprint(\"yes\")\r\n\t\t\t\treturn\r\n\tprint(\"no\")\r\n\treturn\r\n\r\nmain()\r\n", "n = int(input())\nnums = list(map(int, input().split()))\nnums = [sorted(nums[i : i + 2]) for i in range(n - 1)]\n\nfor c, d in nums: \n for a, b in nums:\n if a < c < b < d:\n print(\"yes\")\n exit()\n \nprint(\"no\")\n \n \t \t \t\t\t\t \t\t \t \t \t\t\t\t \t\t \t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(n-2):\r\n for j in range(i+1, n-1):\r\n a = sorted([sorted([arr[i], arr[i + 1]]), sorted([arr[j], arr[j + 1]])])\r\n if a[1][0] > a[0][0] and a[1][0] < a[0][1] and a[1][1] > a[0][1]:\r\n print('yes')\r\n exit()\r\nprint('no')\r\n", "def solve():\r\n\tfor i in range(n-1):\r\n\t\tmn,mx=min(a[i],a[i+1]),max(a[i],a[i+1])\r\n\t\tfor j in range(i,n-1):\r\n\t\t\tmnn,mxx=min(a[j],a[j+1]),max(a[j],a[j+1])\r\n\t\t\tif (mxx>mx and mn<mnn<mx) or (mx>mxx and mnn<mn<mxx):\r\n\t\t\t\tprint(\"yes\")\r\n\t\t\t\treturn\r\n\telse:\r\n\t\tprint(\"no\")\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nsolve()", "import sys\r\n\r\nn = int(input())\r\ninp = input().split()\r\nx = [int(p) for p in inp]\r\nfor i in range(0,n-2):\r\n for j in range(i+1,n-1):\r\n # (i,i+1) vs. (j,j+1)\r\n al = min(x[i],x[i+1])\r\n ar = max(x[i],x[i+1])\r\n bl = min(x[j],x[j+1])\r\n br = max(x[j],x[j+1])\r\n if al<bl<ar and ar<br or al<br<ar and bl<al:\r\n print(\"yes\")\r\n sys.exit()\r\nprint(\"no\")\r\n \r\n", "def self_intersect(points:list):\r\n for i in range(len(points)):\r\n check_point = points[i]\r\n for j in range(len(points)):\r\n if i != j:\r\n check_point2 = points[j]\r\n if check_point[0] < check_point2[0] < check_point[1] < check_point2[1]:\r\n return True\r\n if check_point2[0] < check_point[0] < check_point2[1] < check_point[1]:\r\n return True\r\n return False\r\n\r\n\r\n\r\n\r\nn = int(input())\r\npoints = list(map(int,input().split(' ')))\r\n\r\nsemi_circles = []\r\n\r\nfor i in range(0,len(points)-1):\r\n if points[i] < points[i+1]:\r\n semi_circles.append([points[i],points[i+1]])\r\n else:\r\n semi_circles.append([points[i+1],points[i]])\r\n\r\nif self_intersect(semi_circles):\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\na=[]\r\nfor i in range(n-1):\r\n\ta.append((min(l[i], l[i+1]), max(l[i], l[i+1])))\r\nfor i in a:\r\n\tfor j in a:\r\n\t\tif i[0]<j[0]<i[1]<j[1] or j[0]<i[0]<j[1]<i[1]:\r\n\t\t\tprint(\"yes\")\r\n\t\t\texit()\r\nprint(\"no\")", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\ncoordinates = []\r\nfor i in range(0,n-1):\r\n x = a[i]\r\n y = a[i+1]\r\n coordinates.append([x,y])\r\n# print(coordinates)\r\nf = 'no'\r\nfor i in range(0,n-2):\r\n if(f == 'yes'):\r\n break\r\n for j in range(i+1,n-1):\r\n # print(j)\r\n chota1 = min(coordinates[i])\r\n bada1 = max(coordinates[i])\r\n chota2 = min(coordinates[j])\r\n bada2 = max(coordinates[j])\r\n if(chota2>=chota1 and bada2<= bada1) or (chota2 <= chota1 and bada2>= bada1) or(chota2 >= bada1) or (bada2 <= chota1):\r\n continue\r\n else:\r\n f = 'yes'\r\n break\r\n\r\nprint(f)\r\n\r\n\r\n\r\n\r\n", "def intger (l):\n ans=[]\n for i in l :\n ans.append(int(i))\n return ans\n\nn=int(input())\nx=intger(input().split())\nd=[]\nfor i in range(1,len(x)):\n d.append(sorted([x[i],x[i-1]]))\nflag=False\nfor i in d:\n for j in d:\n if i==j :\n continue\n else:\n if (i[0]<j[0] and j[0]<i[1] and i[1]<j[1]) or (j[0]<i[0] and i[0]<j[1] and j[1]<i[1]) :\n flag=True\n\nif flag :\n print('yes')\nelse:\n print ('no')", "n,l=int(input()),list(map(int,input().split()))\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n a,b,c,d=sorted([l[i],l[i+1]])+sorted([l[j],l[j+1]])\r\n if a<c<b<d: exit(print('yes'))\r\nprint('no')", "n = int(input())\nL = list(map(int,input().split()))\nX = []\nfor i in range(1,n,1):\n u = [L[i-1],L[i]]\n u.sort()\n X.append(u)\n \nok = True \nfor i in range(n-1):\n for j in range(n-1):\n if X[i][0]<X[j][0] and X[j][0]<X[i][1] and X[i][1]<X[j][1]:\n ok = False \nif ok == False:\n print(\"yes\")\nelse:\n print(\"no\")", "n = int(input())\r\nx = list(map(int, input().split()))\r\nintervals = []\r\nfor i in range(n-1):\r\n interval = [x[i], x[i+1]]\r\n interval.sort()\r\n a, b = interval\r\n intervals.append((a,b))\r\n\r\n\r\ndef intersect(t1, t2):\r\n combined = [t1, t2]\r\n combined.sort()\r\n interval1, interval2 = combined\r\n if interval2[0] < interval1[1] < interval2[1] and interval1[0] != interval2[0]:\r\n return True\r\n else:\r\n False\r\n\r\n\r\ncondition = False\r\nfor i in range(n-1):\r\n for j in range(i+1,n-1,1):\r\n if intersect(intervals[i], intervals[j]):\r\n condition = True\r\n break\r\n if condition:\r\n break\r\nprint(\"yes\" if condition else \"no\")\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nx = []\r\nfor i in range(n - 1):\r\n x.append(sorted([a[i],a[i + 1]]))\r\n#print(x)\r\nfor i in range(n - 1):\r\n for j in range(i + 2, n - 1):\r\n if (x[i][0] > x[j][0] and x[i][0] < x[j][1] and (x[i][1] > x[j][1] or x[i][1] < x[j][0])) or (x[i][1] > x[j][0] and x[i][1] < x[j][1] and (x[i][0] > x[j][1] or x[i][0] < x[j][0])):\r\n print('yes')\r\n exit()\r\nprint('no')", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(1,n):\r\n\tb.append([min(a[i-1],a[i]),max(a[i-1],a[i])])\r\nb.sort()\r\nyes = 1;\r\nfor i in range(0,n-1):\r\n\tif(yes):\r\n\t\tfor j in range(i+1,n-1):\r\n\t\t\tif b[j][0] >= b[i][1]:\r\n\t\t\t\tbreak;\r\n\t\t\tif b[j][1] > b[i][1] and b[j][0] > b[i][0]:\r\n\t\t\t#\tprint(b[i][0],b[i][1],b[j][0],b[j][1])\r\n\t\t\t\tyes = 0;\r\n\t\t\t#\tbreak;\r\nprint(['yes','no'][yes])", "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 Dima_and_Continuous_Line():\r\n n = inp()\r\n points_sequence = inlt()\r\n\r\n prev_point = 0 \r\n semicircle_endPoint1 = []\r\n semicircle_endPoint2 = []\r\n\r\n for i in range(n):\r\n xi = points_sequence[i]\r\n if i == 0 :\r\n prev_point = xi \r\n else:\r\n if xi < prev_point:\r\n semicircle_endPoint1.append(xi)\r\n semicircle_endPoint2.append(prev_point)\r\n else:\r\n semicircle_endPoint1.append(prev_point)\r\n semicircle_endPoint2.append(xi)\r\n \r\n prev_point = xi \r\n \r\n semicircle_index = len(semicircle_endPoint1)\r\n\r\n for i in range(semicircle_index):\r\n for j in range(i+1,semicircle_index):\r\n \r\n x1 = semicircle_endPoint1[i]\r\n x2 = semicircle_endPoint2[i]\r\n x3 = semicircle_endPoint1[j]\r\n x4 = semicircle_endPoint2[j]\r\n\r\n if (x1<x3) and (x3<x2) and (x2<x4):\r\n print(\"yes\")\r\n return \r\n if (x3<x1) and (x1<x4) and (x4<x2):\r\n print(\"yes\")\r\n return \r\n \r\n print(\"no\")\r\n return\r\n\r\nDima_and_Continuous_Line()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(n-1):\r\n\tl1+=[[l[i],l[i+1]]]\r\nfor i in range(n-1):\r\n\tif l1[i][0]>l1[i][1]:\r\n\t\tl1[i][0],l1[i][1]=l1[i][1],l1[i][0]\r\nfor i in l1:\r\n\tfor j in l1:\r\n\t\tif i[0]<j[0]<i[1]<j[1]:\r\n\t\t\tprint(\"yes\")\r\n\t\t\texit()\r\n\t\telif j[0]<i[0]<j[1]<i[1]:\r\n\t\t\tprint(\"yes\")\r\n\t\t\texit()\r\nprint(\"no\")", "n, x = int(input()), list(map(int, input().split()))\r\nfor i in range(n - 2):\r\n for j in range(i + 1, n - 1):\r\n a = sorted([sorted([x[i], x[i + 1]]), sorted([x[j], x[j + 1]])])\r\n if a[1][0] > a[0][0] and a[1][0] < a[0][1] and a[1][1] > a[0][1]:\r\n print('yes'), exit()\r\nprint('no')", "n = int(input())\r\n\r\nlst = list(map(int,input().split()))\r\n\r\nfor i in range(n-1):\r\n for j in range(i+1,n-1):\r\n # Check if the start of the first semi circle is smaller than the second one\r\n # and the end of the frist semi circle is also small the second one\r\n # It it's true then there is an intersection\r\n a = min(lst[i], lst[i+1])\r\n b = max(lst[i], lst[i+1])\r\n c = min(lst[j], lst[j+1])\r\n d = max(lst[j], lst[j+1])\r\n\r\n if a < c < b < d or c < a < d < b:\r\n print(\"yes\")\r\n exit()\r\nprint('no')", "def checkint(a,b,c,d):\r\n check=0\r\n if min(a,b)<min(c,d)<max(a,b)<max(c,d) or \\\r\n min(c,d)<min(a,b)<max(c,d)<max(a,b):\r\n check=1\r\n return check\r\n\r\nn=int(input())\r\nlis=input().split()\r\nfor i in range(n):\r\n lis[i]=int(lis[i])\r\nintersect=0\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n if checkint(lis[i],lis[i+1],lis[j],lis[j+1])==1:\r\n intersect=1\r\n\r\nif intersect==0:\r\n print('no')\r\nelse:\r\n print('yes')\r\n", "n=int(input())\r\nA=[int(x) for x in input().split()]\r\nfor i in range(n-1):\r\n Main=[A[i],A[i+1]]\r\n Main.sort()\r\n for j in range(i+1,n-1):\r\n SubMain=[A[j],A[j+1]]\r\n SubMain.sort()\r\n NewList=[Main,SubMain]\r\n NewList.sort()\r\n if NewList[0][0]==NewList[1][0]:\r\n continue\r\n elif NewList[0][1]>NewList[1][0] and NewList[1][1]>NewList[0][1]:\r\n print(\"yes\")\r\n exit()\r\nprint(\"no\")\r\n ", "n = int(input())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nflag = 1\r\nfor i in range(n-1):\r\n\tx1,x2 = (min(s[i],s[i+1]),max(s[i],s[i+1]))\r\n\tfor j in range(n-1):\r\n\t\tx3,x4 = (min(s[j],s[j+1]),max(s[j],s[j+1]))\r\n\t\tif(((x1<x3) and (x3<x2) and (x2<x4)) or ((x3<x1) and (x1<x4) and(x4<x2))):\r\n\t\t\tflag = 0\r\n\t\t\tbreak\r\n\r\nif(flag == 1 ):\r\n\tprint('no')\r\nelse:\r\n\tprint('yes')\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\ndef fn(n,a):\r\n if n<3:return 'no'\r\n for i in range(2,n-1):\r\n for j in range(i-1):\r\n p1=(a[j]-a[i])*(a[j]-a[i+1])\r\n p2=(a[j+1]-a[i])*(a[j+1]-a[i+1])\r\n if p1*p2<0:return 'yes'\r\n return 'no'\r\nprint(fn(n,a))\r\n", "import sys\r\nimport itertools\r\nimport math\r\nimport collections\r\nfrom collections import Counter\r\n\r\n#########################\r\n# imgur.com/Pkt7iIf.png #\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 * 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 divs(n, start=1):\r\n r = []\r\n for i in range(start, int(math.sqrt(n) + 1)):\r\n if (n % i == 0):\r\n if (n / i == i):\r\n r.append(i)\r\n else:\r\n r.extend([i, n // i])\r\n return r\r\ndef ceil(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\ndef dd(): return collections.defaultdict(int)\r\n\r\nn = ii()\r\nd = li()\r\nt = []\r\nfor i in range(1, n):\r\n a, b = min(d[i - 1], d[i]), max(d[i - 1], d[i])\r\n t.append([a, b])\r\nt.sort()\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n - 1):\r\n if t[i][0] < t[j][0] < t[i][1] < t[j][1]:\r\n exit(print('yes'))\r\nprint('no')\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nx = []\r\nfor i in range(n-1):\r\n x.append(sorted(w[i:i+2]))\r\n\r\nif any(a<c<b<d for a,b in x for c,d in x):\r\n print('yes')\r\nelse:\r\n print('no')\r\n", "def main():\n n = int(input())\n if n <= 2:\n return False\n a = list(map(int, input().split(' ')))\n s = [(min(a[i], a[i+1]), max(a[i], a[i+1])) for i in range(n-1)]\n for i, p1 in enumerate(s):\n for j, p2 in enumerate(s):\n if i == j:\n continue\n if p1[0] < p2[0] and p2[0] < p1[1] and p1[1] < p2[1]:\n return True\n if p2[0] < p1[0] and p1[0] < p2[1] and p2[1] < p1[1]:\n return True\n return False\n\nprint(\"yes\" if main() else \"no\")\n", "#358A\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\n\npairs = [(a[i], a[i+1]) for i in range(n-1)]\nans = False\nfor i in range(n-1):\n for j in range(i+1, n-1):\n a,b,c,d = min(pairs[i][0], pairs[i][1]), min(pairs[j][0], pairs[j][1]), max(pairs[i][0], pairs[i][1]), max(pairs[j][0], pairs[j][1])\n if a < b < c < d or b < a < d < c:\n ans = True\n break\n\nprint(\"yes\" if ans else \"no\")", "n=int(input())\r\ninp=list(map(int,input().split()))\r\nlst=[]\r\nans=\"no\"\r\nfor i in range(n-1):\r\n \tlst.append([min(inp[i],inp[i+1]),max(inp[i],inp[i+1])])\r\nfor i in lst:\r\n \tfor j in lst:\r\n \t\tif i[0]<j[0]<i[1]<j[1] or j[0]<i[0]<j[1]<i[1]:\r\n \t\t\tans=(\"yes\")\r\nprint(ans)", "\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nb,c,ans = [],[],0\r\n\r\nfor i in range(n-1):\r\n b.append(min(a[i],a[i+1]))\r\n c.append(max(a[i],a[i+1]))\r\n\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n if i == j:\r\n continue\r\n if b[i] < b[j] and c[i] > b[j] and c[j] > c[i]:\r\n ans = 1\r\nif not ans:\r\n print('no')\r\nelse:\r\n print('yes')\r\n", "n = int(input())\nx = [int(x) for x in input().split()]\np = x[0]\nl = []\nfor i in range(1, n):\n\tfor a, b in l[:-1]:\n\t\tif (a < x[i] < b) ^ (a < p < b):\n\t\t\tprint('yes')\n\t\t\texit()\n\tl.append((min(p, x[i]), max(p, x[i])))\n\tp = x[i]\nprint('no')\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\np = x[0]\r\nm = []\r\nfor i in range(1, n):\r\n for a, b in m[:-1]:\r\n if (a < p < b) ^ (a < x[i] < b):\r\n print(\"yes\")\r\n exit()\r\n m.append([min(p,x[i]),max(p,x[i])])\r\n p = x[i]\r\nprint(\"no\")", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n w, x = sorted([ls[i], ls[i+1]])\r\n y, z = sorted([ls[j], ls[j+1]])\r\n if w < y < x < z or y < w < z < x:\r\n print('yes')\r\n exit()\r\nprint('no')\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(n-1):\r\n l1.append([min(l[i],l[i+1]),max(l[i],l[i+1])])\r\nans='no'\r\nfor i in l1:\r\n for j in l1:\r\n a=i[0]\r\n b=i[1]\r\n if j[0]<b<j[1] and a<j[0]:\r\n ans=\"yes\"\r\n break\r\n if j[0]<a<j[1] and b>j[1]:\r\n ans=\"yes\"\r\n break\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nf=0\r\nfor i in range(n-1):\r\n for j in range(i+2,n-1):\r\n x1,x2=(l[i],l[i+1]) if(l[i]<l[i+1]) else (l[i+1],l[i])\r\n x3,x4=(l[j],l[j+1]) if(l[j]<l[j+1]) else (l[j+1],l[j])\r\n if((x1<x3<x2<x4) or (x3<x1<x4<x2)):\r\n f=1\r\n break\r\n if(f==1):\r\n break\r\nprint(\"yes\") if(f==1) else print(\"no\")", "x = int(input())\r\nz = []\r\nz[0:] = map(int, input().split())\r\nw = list(z)\r\nw.sort()\r\n# diff = w[1] - w[0]\r\n# print(diff)\r\n# maxdiff = (w[1] - w[0]) * (x-1)\r\nchecker = 0\r\n# print(abs(w.index(z[x-1]) - w.index(z[x-2]) ))\r\n# print(w.index(z[1]))\r\nfor i in range(x-1):\r\n first = z[i]\r\n second = z[i + 1]\r\n for j in range(i+2,x-1):\r\n third = z[j]\r\n fourth = z[j + 1]\r\n if max(first,second) < max(third,fourth) and min(third,fourth) > min(first,second) and min(third,fourth) < max(first,second):\r\n checker = 1\r\n print(\"yes\")\r\n break\r\n elif min(first,second) > min(third,fourth) and max(third,fourth) > min(first,second) and max(third,fourth) < max(first,second):\r\n checker = 1\r\n print(\"yes\")\r\n break\r\n\r\n if checker == 1:\r\n break\r\nif checker == 0:\r\n print(\"no\")" ]

[ "\r\n\r\nn, x = map(int, input().split())\r\nl = 0\r\nr = 1000\r\nfor i in range(n):\r\n a, b = sorted(map(int, input().split()))\r\n l = max(l, a)\r\n r = min(r, b)\r\n\r\n#initial point of the common segmnet is l\r\n# and the end point ofthe segment is r\r\n\r\nif l > r:\r\n print(-1)\r\n exit(0)\r\nif l <= x <= r:\r\n print(0)\r\nelse:\r\n print(min(abs(l - x), abs(r - x)))\r\n", "n, x = map(int, input().split())\r\nmin_right = float('inf')\r\nmax_left = float('-inf')\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n min_right = min(min_right, max(l, r))\r\n max_left = max(max_left, min(l, r))\r\nif max_left > min_right:\r\n print(-1)\r\nelse:\r\n if x < max_left:\r\n print(max_left - x)\r\n elif x > min_right:\r\n print(x - min_right)\r\n else:\r\n print(0)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_uppercase\r\n\r\n\r\ncases, x = map(int, (input().split()))\r\n\r\nst = -1\r\n\r\nfor _ in range(cases):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n a, b = b, a\r\n new_st = set(i for i in range(a, b+1))\r\n\r\n if st == -1:\r\n st = new_st\r\n else:\r\n st = st.intersection(new_st)\r\n if not st:\r\n print(-1)\r\n exit()\r\n# print(\"YES\")\r\nif x in st:\r\n print(0)\r\nelse:\r\n mn = min(st)\r\n mx = max(st)\r\n ans = min(abs(mn-x), abs(x-mx))\r\n print(ans)\r\n\r\n\r\n\r\n", "n,x=map(int,input().split())\r\n\r\nMIN=-1<<60\r\nMAX=1<<60\r\n\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n\r\n MIN=max(MIN,min(a,b))\r\n MAX=min(MAX,max(a,b))\r\n\r\nif MIN>MAX:\r\n print(-1)\r\nelif MIN<=x<=MAX:\r\n print(0)\r\nelse:\r\n print(min(abs(MIN-x),abs(MAX-x)))\r\n", "# good luck\nn, x = map(int, input().split())\na = [0]*1005\nminn = 20000\nmaxn = 0\n\nfor i in range(n):\n l, r = map(int, input().split())\n if l > r:\n l, r = r, l\n for j in range(l, r+1):\n a[j] += 1\n minn = min(minn, l)\n maxn = max(maxn, r)\nres = 20000\n\nflag = 0\nfor i in range(minn, maxn+1):\n if a[i] == n:\n flag = 1\n res = min(res, abs(i-x))\nif flag:\n print(res)\nelse:\n print(-1)", "n,x = map(int,input().split())\nst,end = -1 , 10000\nfor i in range(n):\n a,b = map(int,input().split())\n a,b = min(a,b),max(a,b)\n st = max(a,st)\n end = min(end,b)\nif st>end:\n print(-1)\nelif end>=x>=st:\n print(0)\nelse:\n print(min(abs(st-x),abs(end-x)))", "n, p = map(int, input().split())\nx = []\nfor i in range(n):\n\ta, b= map(int, input().split())\n\tn = []\n\tif a<b:\n\t\tfor i in range(a, b+1):\n\t\t\tn.append(i)\n\telse:\n\t\tfor i in range(b,a+1):\n\t\t\tn.append(i)\n\tif x == []:\n\t\tx = n\n\telse:\n\t\tx = set(n)&set(x)\n\nif x == set():\n\tprint(-1)\nelse:\n\tm = x.pop()\n\twhile x.__len__()>1:\n\t\tx.pop()\n\tif x.__len__()==1:\n\t\tM = x.pop()\n\t\tif m>M:\n\t\t\ttemp = M\n\t\t\tM = m\n\t\t\tm = temp\n\t\tif p<m:\n\t\t\tprint(m-p)\n\t\telif p>M:\n\t\t\tprint(p-M)\n\t\telif p>=m and p<=M:\n\t\t\tprint(0)\n\telse:\n\t\tif p<m:\n\t\t\tprint(m-p)\n\t\telif p>=m:\n\t\t\tprint(p-m)\n\n\n\n\n", "n, x0 = map(int, input().split())\r\nc, d = -1, 1001\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n a, b = min(a, b), max(a, b)\r\n if d < a or c > b:\r\n print(-1)\r\n exit()\r\n else:\r\n c, d = max(a, c), min(b, d)\r\nif c <= x0 <= d:\r\n print(0)\r\nelse:\r\n print(min(abs(x0 - c), abs(x0 - d)))\r\n", "n, a = map(int,input().split())\nb = []\nc = []\nfor x in range(n):\n\te= list(map(int,input().split()))\n\te.sort()\n\tb.append(e[0])\n\tc.append(e[1])\nb.sort()\nc.sort()\nfor x in c:\n\tif b[-1] > x:\n\t\tprint(-1)\n\t\tbreak\nelse:\n\tif b[-1] > a and a < c[0]:\n\t\tprint(b[-1] - a)\n\telif a > b[-1] and a > c[0]:\n\t\tprint(a - c[0])\n\telse:\n\t\tprint(0)", "\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, x0 = map(int, input().split())\r\nx1, x2 = 0, 1000\r\nfor j in range(n):\r\n a, b = map(int, input().split())\r\n x1 = max(x1, min(a, b))\r\n x2 = min(x2, max(a, b))\r\nprint(max(0, x1 - x0, x0 - x2) if x2 >= x1 else -1)\r\n", "from sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, x = iia()\r\narr = []\r\nfor i in range(n):\r\n arr.append(sorted(iia()))\r\narr.sort()\r\ncur = arr[0]\r\nflag = 0\r\nfor i in arr[1:]:\r\n cur[0] = max(cur[0], i[0])\r\n cur[1] = min(cur[1], i[1])\r\n if cur[1] < cur[0]:\r\n flag = 1\r\n break\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n if x >= cur[0] and x <= cur[1]:\r\n print(0)\r\n else:\r\n print(min(abs(cur[0] - x), abs(cur[1] - x)))\r\n ", "n, x = map(int, input().split())\r\nu = 1000\r\nl = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n a, b = sorted([a, b])\r\n u = min(b, u)\r\n l = max(a, l)\r\nif l > u:\r\n print(-1)\r\nelif u >= x >= l:\r\n print(0)\r\nelse:\r\n print(max(l - x, x - u))\r\n", "n, x0 = map(int, input().split())\r\n\r\nkiri = 0\r\nkanan = 1000\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n kiri = max(kiri, min(a, b))\r\n kanan = min(kanan, max(a, b))\r\n\r\nif kiri > kanan:\r\n print(-1)\r\nelif kiri <= x0 <= kanan:\r\n print(0)\r\nelif x0 < kiri:\r\n print(kiri - x0)\r\nelse:\r\n print(x0 - kanan)\r\n \r\n \r\n", "n, x0 = [int(x) for x in input().split()]\r\nintersections = []\r\nfor _ in range(n):\r\n a,b = [int(x) for x in input().split()]\r\n a,b = min(a,b), max(a,b)\r\n if n==1 and a<= x0 <=b:\r\n print('0')\r\n exit()\r\n if intersections:\r\n currentRange = list(range(a,b+1))\r\n inersectionOfCurrentAndPrevious = set(currentRange).intersection(set(intersections))\r\n if len(inersectionOfCurrentAndPrevious):\r\n intersections = list(inersectionOfCurrentAndPrevious)\r\n else:\r\n print('-1')\r\n exit()\r\n else:\r\n intersections = list(range(a,b+1))\r\nintersections = map(lambda x:abs(x-x0), intersections)\r\nprint(min(intersections))\r\n", "n,x=map(int,input().split())\r\nli=[]\r\npos=[x]\r\nflag=0\r\nfor i in range(n):\r\n\ta=list(map(int,input().split()))\r\n\tl,r=min(a[0],a[1]),max(a[0],a[1])\r\n\tif l<=x and r>=x:\r\n\t\tli.append([l,r])\r\n\telif x<l:\r\n\t\tx=l\r\n\t\tpos.append(x)\r\n\t\tfor i in li:\r\n\t\t\tl,r=i\r\n\t\t\tif x<l or r<x:\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\tli.append([l,r])\r\n\telif x>r:\r\n\t\tx=r\r\n\t\tpos.append(x)\r\n\t\tfor i in li:\r\n\t\t\tl,r=i\r\n\t\t\tif x<l or r<x:\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\tli.append([l,r])\r\n\tif flag==1:\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(abs(pos[0]-pos[-1]))\r\n\r\n", "\r\ndef main_function():\r\n n, x_0 = [int(i) for i in input().split(\" \")]\r\n max_a = 0\r\n min_b = 10000000000\r\n a_b = [[int(i) for i in input().split(\" \")] for j in range(n)]\r\n already_took_picture = [False for i in range(n)]\r\n for i in range(len(a_b)):\r\n a, b = sorted(a_b[i])\r\n if a > max_a:\r\n max_a = a\r\n if b < min_b:\r\n min_b = b\r\n if max_a > min_b:\r\n print(-1)\r\n else:\r\n if max_a <= x_0 and min_b >= x_0:\r\n print(0)\r\n elif max_a > x_0:\r\n print(max_a - x_0)\r\n elif min_b < x_0:\r\n print(x_0 - min_b)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n, x0 = list(map(int,input().strip().split(' ')))\r\nmax_s = 0\r\nmin_e = 10000000\r\nfor i in range(n):\r\n s, e = sorted(list(map(int,input().strip().split(' '))))\r\n max_s = max(s,max_s)\r\n min_e = min(e,min_e)\r\nif x0 >= max_s and x0 <= min_e:\r\n print(0)\r\nelif min_e < max_s:\r\n print(-1)\r\nelse:\r\n print(min(abs(min_e - x0),abs(max_s - x0)))", "n, x0 = map(int, input().split())\r\nm = 0\r\nM = 1001\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n a, b = b, a\r\n if b < M:\r\n M = b\r\n if a > m:\r\n m = a\r\n\r\nif m > M:\r\n print(\"-1\")\r\nelse:\r\n ans = 1001\r\n if m <= x0 <= M:\r\n ans = 0\r\n if x0 < m and ans > m - x0:\r\n ans = m - x0\r\n if x0 > M and ans > x0 - M:\r\n ans = x0 - M\r\n print(ans)", "n, x = map(int, input().split())\r\nhash = [0] * 1001\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n a, b = min(a, b), max(a, b)\r\n for j in range(a, b + 1):\r\n hash[j]+=1;\r\n\r\ndis = 20000\r\nfor i in range(1001):\r\n if hash[i] == n:\r\n dis = min(dis, abs(i - x))\r\nprint(-1) if dis == 20000 else print(dis)", "n,xo=[int(x) for x in input().split()]\r\nl1=[]\r\nl2=[]\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n if a<=b:\r\n l1.append(a)\r\n l2.append(b)\r\n else:\r\n l1.append(b)\r\n l2.append(a)\r\nma=max(l1)\r\nmi=min(l2)\r\nif ma>mi:\r\n print(\"-1\")\r\nelse:\r\n if xo<ma:\r\n print(abs(ma-xo))\r\n elif xo>mi:\r\n print(abs(mi-xo))\r\n else:\r\n print(\"0\")", "n, x0 = list(map(int, input().split()))\na0 = 0\nb0 = 1001\nfor _ in range(n):\n\ta, b = list(map(int, input().split()))\n\tif a > b:\n\t\ttmp = a\n\t\ta = b\n\t\tb = tmp\n\tif a > a0:\n\t\ta0 = a\n\tif b < b0:\n\t\tb0 = b\nif a0 > b0:\n\tprint(-1)\nelse:\n\tif x0 < a0 or x0 > b0:\n\t\tprint(min(abs(a0-x0), abs(b0-x0)))\n\telse:\n\t\tprint(0)\n\t\t \t\t \t\t\t\t\t\t \t\t \t\t \t\t \t \t\t", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,x=(int(i) for i in input().split())\r\na,b=(int(i) for i in input().split())\r\na,b=min(a,b),max(a,b)\r\nmi=a\r\nma=b\r\nc=1\r\nfor i in range(n-1):\r\n a,b=(int(i) for i in input().split())\r\n a,b=min(a,b),max(a,b)\r\n if(a>ma or b<mi):\r\n c=0\r\n else:\r\n if(a>mi and b>ma):\r\n mi=a\r\n elif(a>mi and b<=ma):\r\n mi=a\r\n ma=b\r\n elif(a<=mi and b<=ma):\r\n ma=b\r\nif(c==0):\r\n print(-1)\r\nelse:\r\n if(x>=mi and x<=ma):\r\n print(0)\r\n elif(x>ma):\r\n print(x-ma)\r\n else:\r\n print(mi-x)", "n, x0 = [int(x) for x in input().split()]\r\npts = [0] * 1005\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n if a > b:\r\n a, b = b, a\r\n for x in range(a, b+1):\r\n pts[x] += 1\r\nx1 = 10000\r\nfor x in range(1001):\r\n if pts[x] == n and abs(x-x0) < abs(x1-x0):\r\n x1 = x\r\nif x1 == 10000:\r\n print(-1)\r\nelse:\r\n print(abs(x1-x0))", "n,x=[int(x) for x in input().split()];l1=[];l2=[]\r\nfor i in range(n):\r\n a=[int(x) for x in input().split()]; a.sort()\r\n l1.append(a[0]);l2.append(a[1])\r\nstart=max(l1);end=min(l2)\r\nif start>end: print(-1)\r\nelif x<start: print(start-x)\r\nelif x>end: print(x-end)\r\nelse: print(0)\r\n ", "n,k=map(int, input().split())\r\nminn=-1\r\nmaxx=1001\r\nfor _ in range(n):\r\n x,y=sorted(map(int, input().split()))\r\n if x>minn: \r\n minn=x\r\n if y<maxx: \r\n maxx=y\r\nif minn<=k<=maxx: \r\n print(0)\r\nelif maxx<minn: \r\n print(-1)\r\nelse: \r\n print(min(abs(minn-k), abs(k-maxx)))", "n,m = map(int,input().split())\r\npos,x = m,[]\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n x.append((min(a,b),max(a,b)))\r\nx.sort(); l,h = x[0][0],x[0][1]\r\nfor j in x:\r\n if j[0] > pos:\r\n if j[0] <= h:\r\n pos = j[0]\r\n h = j[1] if j[1] < h else h\r\n else: print(-1); exit()\r\n elif j[1] < pos:\r\n if j[1] >= l:\r\n pos = j[1]\r\n l = j[0] if j[0] > l else l\r\n else: print(-1); exit()\r\nprint(abs(m-pos))\r\n", "n,x0=map(int,input().split())\r\n\r\nlargest_min=0\r\nlowest_max=1000\r\nsegments=[]\r\nsteps=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n mini=min(x,y)\r\n maxi=max(x,y)\r\n if x0>maxi:\r\n steps+=x0-maxi\r\n x0=maxi\r\n if x0<mini:\r\n steps+=mini-x0\r\n x0=mini\r\n if mini>largest_min:\r\n largest_min=mini\r\n if maxi<lowest_max:\r\n lowest_max=maxi\r\n segments.append([mini,maxi])\r\n\r\nif largest_min>lowest_max:\r\n print(-1)\r\n\r\nelse:\r\n print(steps)\r\n \r\n", "n, x0 = map(int, input().split())\ncnt = [0] * 1001\nfor i in range(n):\n a, b = map(int, input().split())\n a, b = min(a, b), max(a, b)\n for j in range(a, b+1):\n cnt[j] += 1\nans = 2000\nfor i in range(1001):\n if cnt[i] == n:\n ans = min(ans, abs(x0-i))\nprint(-1) if ans == 2000 else print(ans)\n", "# how do we read 2 numbers?\r\n# vals = input().split()\r\n# n, x0 = int(vals[0]), int(vals[1])\r\n# using list comprehension\r\nn, x0 = [int(x) for x in input().split()]\r\nsegs = []\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n if a > b:\r\n a, b = b, a # always make left < right\r\n segs.append((a, b))\r\nx_min = 100000\r\nfor x in range(0, 1001): # correct pos\r\n cnt = 0 # count how many segs cover it\r\n for seg in segs: # loop thru all segs\r\n if x >= seg[0] and x <= seg[1]:\r\n cnt += 1\r\n if cnt == n: # you find a valid point\r\n if abs(x-x0) < abs(x_min-x0): # you found a better one\r\n x_min = x\r\nif x_min == 100000:\r\n print(-1)\r\nelse:\r\n print(abs(x_min - x0))\r\n \r\n ", "import sys\r\n\r\ninput = sys.stdin.readline().split()\r\n\r\nnum = int(input[0])\r\npos = int(input[1])\r\n\r\npos_min = 0\r\npos_max = sys.maxsize\r\n\r\nfor i in range(num):\r\n input = sys.stdin.readline().split()\r\n min_t = int(input[0])\r\n max_t = int(input[1])\r\n if min_t > max_t:\r\n min_t, max_t = max_t, min_t\r\n pos_min = max(pos_min, min_t)\r\n pos_max = min(pos_max, max_t)\r\n\r\nif pos_min > pos_max:\r\n print('-1')\r\nelif pos >= pos_min and pos <= pos_max:\r\n print('0')\r\nelse:\r\n print(min(abs(pos_min - pos), abs(pos_max - pos)))", "n, x0 = map(int, input().split())\r\nlo = []\r\nhi = []\r\nmove = x0\r\nfor _ in range(n):\r\n s, e = map(int, input().split())\r\n s, e = sorted([s, e])\r\n lo.append(s)\r\n hi.append(e)\r\nleft = max(lo)\r\nright = min(hi)\r\nif right < left:\r\n print(-1)\r\nelif x0 < left:\r\n print(left - x0)\r\nelif x0 > right:\r\n print(x0 - right)\r\nelse:\r\n print(0)", "n, x = list(map(int, input().split()))\r\n\r\nrunner = []\r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n if a > b:\r\n a,b = b,a\r\n runner.append([a,b])\r\n\r\nm = runner[0][0]\r\nM = runner[0][1]\r\nfor i in range(1,n):\r\n if runner[i][0] > m:\r\n m = runner[i][0]\r\n if runner[i][1] < M:\r\n M = runner[i][1]\r\n\r\nif m > M:\r\n print(-1)\r\nelif x >= m and x <= M:\r\n print(0)\r\nelif x < m:\r\n print(m-x)\r\nelif x > M:\r\n print(x-M)", "n,k=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n a1,b1=sorted(list(map(int,input().split())))\r\n a.append(a1)\r\n b.append(b1)\r\n\r\nx2=max(a)\r\ny=min(b)\r\nif x2>y:\r\n print(-1)\r\nelif x2<=k<=y:\r\n print(0)\r\nelse:\r\n print(min(abs(k-x2),abs(k-y)))", "def s():\r\n [n,x] = list(map(int,input().split()))\r\n a = 0\r\n b = 1000\r\n for _ in range(n):\r\n t = list(map(int,input().split()))\r\n t.sort()\r\n a = max(a,t[0])\r\n b = min(b,t[1])\r\n if b<a:\r\n print(-1)\r\n else:\r\n print(0 if x > a and x < b else min(abs(a-x),abs(b-x)))\r\ns()\r\n", "n, x = map(int, input().split())\nm = []\nl, r = -1,1001\nfor i in range(n):\n a = sorted(list(map(int, input().split())))\n l = max(l,a[0])\n r = min(r,a[1])\nm.append(l)\nm.append(r)\nif m[0]>m[1]:\n print(-1)\nelif x in m or (x<m[1] and x>m[0]):\n print(0)\nelse:\n print(min(abs(m[1]-x),abs(m[0]-x)))\n\n\t\t \t \t \t\t \t\t \t \t\t \t \t\t\t", "n,x = list(map(int,input().split()))\r\na,b = 0,1000\r\nfor i in range(n):\r\n area = list(map(int,input().split()))\r\n if min(area) > a:\r\n a = min(area)\r\n if max(area) < b:\r\n b = max(area)\r\nif a > b:\r\n print(-1)\r\nelif a<=x and x<=b:\r\n print(0)\r\nelif x < a:\r\n print(a-x)\r\nelse:\r\n print(x-b)", "n, x = map(int, input().split())\r\nstart, end = 0, 1000\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n a, b = b, a\r\n if a > start:\r\n start = a\r\n if b < end:\r\n end = b\r\n \r\nif start > end:\r\n print(-1)\r\nelse:\r\n if x >= start and x <= end:\r\n print(0)\r\n elif x < start:\r\n print(start - x)\r\n else:\r\n print(x - end) ", "\r\nn,x = [int(s) for s in input().split()]\r\n\r\nmaxstart = -1\r\nminending = 1001\r\n\r\nfor i in range(0,n):\r\n a,b = sorted([int(s) for s in input().split()])\r\n if a > maxstart:\r\n maxstart = a\r\n if b < minending:\r\n minending = b\r\n\r\nif minending >= maxstart:\r\n if x <= maxstart:\r\n print(maxstart-x)\r\n else:\r\n if x <= minending:\r\n print(0)\r\n else:\r\n print(x-minending)\r\n \r\nelse:\r\n print(-1)\r\n", "import sys\r\nn,x = list(map(int,sys.stdin.readline().split()))\r\nranges = []\r\nfor i in range(n):\r\n temp = list(map(int,sys.stdin.readline().split()))\r\n temp.sort()\r\n ranges.append(temp)\r\nlow = -1\r\nhigh = 1000000000\r\nfor i in ranges:\r\n low = max(i[0],low)\r\n high = min(high,i[1])\r\nif high<low:\r\n print(-1)\r\nelse:\r\n if x<low:\r\n print(low-x)\r\n elif x>high:\r\n print(x-high)\r\n else:\r\n print(0)\r\n", "# link: https://codeforces.com/problemset/problem/14/B\r\nif __name__ == \"__main__\":\r\n n,x = map(int,input().split())\r\n a = [0 for i in range(1006)]\r\n temp = 0\r\n answer = float('inf')\r\n for i in range(n):\r\n info = list(map(int, input().split()))\r\n info.sort()\r\n a[info[0]] += 1\r\n a[info[1]+1] -= 1\r\n for i in range(1006):\r\n temp += a[i]\r\n if temp == n:\r\n answer = min(answer, abs(x-i))\r\n if answer == float('inf'):\r\n print(-1)\r\n else:\r\n print(answer) \r\n\r\n \r\n\r\n", "n,x=map(int,input().split())\na=[]\nb=[]\nfor _ in range(n):\n c,d=map(int,input().split())\n if c<=d:\n a.append(c)\n b.append(d)\n else:\n a.append(d)\n b.append(c)\nq=max(a)\nw=min(b)\n# print(a,b)\n# print(q,w)\n# if q<=x and w>=x:\nif q>w:\n # print(q,w)\n # print(\"Here\")\n print(-1)\nelse:\n if x<=w and x>=q:\n print(0)\n else:\n print(min(abs(x-q),abs(x-w)))", "b,c = map(int,input().split())\r\nmi = []\r\nma = []\r\nl = 0\r\nfor x in range(b):\r\n d,e = map(int,input().split())\r\n mi.append(min(d,e))\r\n ma.append(max(d,e))\r\n\r\n\r\nmi.sort()\r\nma.sort()\r\n\r\nif mi[-1] > ma[0]:\r\n print(-1)\r\nelse:\r\n if c < mi[-1]:\r\n print(mi[-1]-c)\r\n elif c > ma[0]:\r\n print(c-ma[0])\r\n else:\r\n print(0)\r\n\r\n\r\n", "n,x=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n a,b=list(map(int,input().split()))\r\n if a>b:\r\n t=a\r\n a=b\r\n b=t\r\n l.append([a,b])\r\na=0\r\nb=1000\r\nf=1\r\nfor i in range(n):\r\n if a>l[i][1] or b<l[i][0]:\r\n f=0\r\n break\r\n if l[i][0]>=a:\r\n a=l[i][0]\r\n if l[i][1]<=b: \r\n b=l[i][1]\r\nif f==0:\r\n print(-1)\r\nelse:\r\n if x>=a and x<=b:\r\n print(0)\r\n else:\r\n print(min(abs(x-a),abs(x-b)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, x = map(int, input().split())\r\nl, r = map(int, input().split())\r\nif l > r:\r\n l, r = r, l\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n a, b = b, a\r\n l = max(l, a)\r\n r = min(r, b)\r\nif l > r:\r\n ans = -1\r\nelif l <= x <= r:\r\n ans = 0\r\nelse:\r\n ans = min(abs(x - l), abs(r - x))\r\nprint(ans)", "\r\ndef segments_intersect(segment1, segment2):\r\n \r\n a1 = segment1[0]\r\n b1 = segment1[1]\r\n\r\n a2 = segment2[0]\r\n b2 = segment2[1]\r\n\r\n if (a1 >= a2 and b1 <= b2):\r\n return (a1, b1)\r\n elif (a2 >= a1 and b2 <= b1):\r\n return (a2,b2)\r\n elif (b1 < a2 or b2 < a1):\r\n print(-1)\r\n exit()\r\n elif (a1 < a2):\r\n return (a2, b1)\r\n else:\r\n return (a1,b2)\r\n\r\n\r\ntemp = list(map(int, input().split()))\r\n\r\nn = temp[0]\r\nx = temp[1]\r\n\r\n\r\nsegments = []\r\n\r\n\r\nfor i in range(n):\r\n temp = list(map(int, input().split()))\r\n a = min(temp)\r\n b = max(temp)\r\n\r\n segments.append((a,b))\r\n\r\n\r\n\r\nwhile (len(segments) > 1):\r\n\r\n # print(segments)\r\n\r\n segment1 = segments.pop()\r\n segment2 = segments.pop()\r\n \r\n segments.append(segments_intersect(segment1,segment2))\r\n\r\n#print(segments)\r\n\r\nsegment = segments[0]\r\n\r\nif x >= segment[0] and x <= segment[1]:\r\n print(0)\r\nelif x < segment[0]:\r\n print(segment[0]-x)\r\nelif x > segment[1]:\r\n print(x-segment[1])\r\n \r\n\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport re\r\n\r\ndef solve(L, R, m):\r\n #print('L: %s, R: %s, m: %d' % (L, R, m))\r\n l = max(L)\r\n r = min(R)\r\n if l > r:\r\n return -1\r\n if m < l:\r\n return abs(m - l)\r\n if m > r:\r\n return abs(m - r)\r\n return 0\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n L = []\r\n R = []\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n a, b = (min(a, b), max(a, b))\r\n L.append(a)\r\n R.append(b)\r\n print(solve(L, R, m))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# Getting Segment Count and initial Location.\r\ncount,loc = tuple(map(int,input().split(' ')))\r\n# Method to determine if intersection is possible.\r\ndef empty_intersection(tOne,tTwo):\r\n return True\r\n# Method to Perform intersection of two segements.\r\ndef and_segments(t0,t1):\r\n and_tuple = max(t0[0],t1[0]),min(t0[1],t1[1])\r\n return and_tuple\r\n# Alogrithm.\r\np_range = -1,1001\r\nfor i in range(count):\r\n # Getting new tuple.\r\n t = tuple(map(int,input().split(' ')))\r\n t = min(t[0],t[1]),max(t[0],t[1])\r\n # Anding Segments.\r\n p_range = and_segments(p_range,t)\r\n# Case no intersection.\r\nif p_range[0]>p_range[1]:\r\n min_dist = -1\r\n# Case loc in range.\r\nelif min(p_range)<=loc<=max(p_range):\r\n min_dist = 0\r\n# Case loc outside range.\r\nelse: min_dist = min(abs(p_range[0]-loc),abs(p_range[1]-loc))\r\n# Verdict.\r\nprint(min_dist)\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, x = map(int, input().split())\r\nc1, c2 = 0, 1001\r\nfor _ in range(n):\r\n s = 0\r\n a, b = sorted(map(int, input().split()))\r\n if a > c1:\r\n c1 = a\r\n if b < c2:\r\n c2 = b\r\n if c1 > c2:\r\n print(-1)\r\n break\r\nelse:\r\n print(0 if c1 <= x <= c2 else min(abs(x-c2), abs(x-c1)))\r\n", "# Main function\r\ndef main():\r\n mystical_n, mystical_x0 = map(int, input().split())\r\n mystical_m = 0\r\n mystical_M = 1001\r\n\r\n for _ in range(mystical_n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n a, b = b, a\r\n if b < mystical_M:\r\n mystical_M = b\r\n if a > mystical_m:\r\n mystical_m = a\r\n\r\n if mystical_m > mystical_M:\r\n print(\"-1\")\r\n else:\r\n mystical_ans = 1001\r\n if mystical_m <= mystical_x0 <= mystical_M:\r\n mystical_ans = 0\r\n if mystical_x0 < mystical_m and mystical_ans > mystical_m - mystical_x0:\r\n mystical_ans = mystical_m - mystical_x0\r\n if mystical_x0 > mystical_M and mystical_ans > mystical_x0 - mystical_M:\r\n mystical_ans = mystical_x0 - mystical_M\r\n print(mystical_ans)\r\n\r\n# Invoke the main function\r\nmain()\r\n", "n, x0 = list(map(int, input().split()))\n\nrunners = []\nfor i in range(0, n):\n\tr = list(map(int, input().split()))\n\trunners.append(set(list(range(min(r[0], r[1]), max(r[0], r[1]) + 1))))\n\npos = set.intersection(*runners)\n\nminDist = 10000\nfor p in pos:\n\td = abs(x0 - p)\n\tif (d < minDist): minDist = d\n\nif (minDist == 10000): minDist = -1\n\nprint(minDist)\n\n", "\r\ninp = [int(x) for x in input().split()]\r\nn, x0 = inp[0], inp[1]\r\ns = [] * n\r\ne = [] * n\r\nfor i in range(n):\r\n li = [int(x) for x in input().split()]\r\n start, stop = li[0], li[1]\r\n if start > stop:\r\n start, stop = stop, start\r\n s.append(start)\r\n e.append(stop)\r\nmaxStart = max(s)\r\nminStop = min(e)\r\nif maxStart > minStop:\r\n print(-1)\r\nelse:\r\n if x0 < maxStart:\r\n print(maxStart-x0)\r\n elif x0 > minStop:\r\n print(x0-minStop)\r\n else:\r\n print(0)\r\n", "def solve(case):\n n, x_0 = list(map(int, input().split()))\n max_a = 0\n min_b = 10000\n for _ in range(n):\n x_1, x_2 = list(map(int, input().split()))\n a_i = min(x_1,x_2)\n b_i = max(x_1, x_2)\n max_a = max(max_a, a_i)\n min_b = min(min_b,b_i)\n \n if x_0 >= max_a and x_0 <= min_b:\n dist = 0\n else:\n dist = min(abs(x_0 - max_a), abs(x_0 - min_b))\n\n if max_a <= min_b:\n print(dist)\n else:\n print(-1)\n\ndef main():\n case = 0\n solve(case)\n\nmain()\n\n \t\t \t \t \t \t\t\t \t \t\t\t\t\t\t\t\t", "def intersectable(a, b):\r\n for ai in a:\r\n for bi in b:\r\n if ai>bi:\r\n return False\r\n return True\r\n \r\n\r\nn, x = list(map(int, input().split()))\r\ntrack = {'a': [], 'b':[]}\r\nfor _ in range(n):\r\n inp = list(map(int, input().split()))\r\n track['a'].append(min(inp))\r\n track['b'].append(max(inp))\r\n\r\n\r\nif intersectable(track['a'], track['b']):\r\n intersection = (max(track['a']), min(track['b']))\r\n if x<intersection[0]:\r\n print(intersection[0]-x)\r\n elif x>intersection[1]:\r\n print(x-intersection[1])\r\n else:\r\n print(0)\r\nelse:\r\n print(-1)", "n,x0=map(int,input().split())\nx=[0]*1001\nc=0\nfor i in range(n):\n a,b=map(int,input().split())\n if a>b:\n a,b=b,a\n c+=1\n for i in range(a,b+1):\n x[i]+=1\nif x[x0]==n:\n print(0)\n exit()\nans=1e9\nfor i in range(x0+1,1001):\n if x[i]==n:\n ans=min(ans,i-x0)\n break\nfor i in range(x0-1,-1,-1):\n if x[i]==n:\n ans=min(ans,x0-i)\n break\nif ans==1e9:\n print(-1)\nelse:\n print(ans)\n", "n,x=map(int,input().split())\r\na=[0]*n\r\nb=[0]*n\r\nc=[]\r\nd=[]\r\nfor i in range (0,n):\r\n a[i],b[i]=map(int,input().split())\r\n a[i],b[i]=min(a[i],b[i]),max(a[i],b[i])\r\ns=min(b)\r\nt=max(a)\r\nif s<t:\r\n print(-1)\r\nelse:\r\n if t<=x<=s:\r\n print(0)\r\n else:\r\n print(min(abs(x-t),abs(x-s)))", "n, x = map(int, input().split())\n\nminx = None\nmaxx = None\nfor i in range(n):\n a, b = map(int, input().split())\n small, big = sorted([a, b])\n if minx:\n minx = small if small > minx else minx\n maxx = big if big < maxx else maxx\n else:\n minx = small\n maxx = big\nif minx and minx > maxx:\n print(-1)\nelse:\n if minx <= x and x <= maxx:\n print(0)\n else:\n print(min(abs(x - minx), abs(x - maxx)))", "n,x=map(int,input().split())\r\nl1=sorted(map(int,input().split()))\r\nflag,z1,z2=0,[l1[0]],[l1[1]]\r\nfor i in range(n-1):\r\n\tl=sorted(map(int,input().split()))\r\n\tz1.append(l[0])\r\n\tz2.append(l[1])\r\n\tif l1[0]<l[0]:l1[0]=l[0]\r\n\tif l1[-1]>l[-1]:l1[-1]=l[-1]\r\nif max(z1)>min(z2):print(\"-1\")\r\nelif x<l1[0]:print(l1[0]-x)\r\nelif x>l1[-1]:print(x-l1[-1])\r\nelse:print(\"0\")", "# LUOGU_RID: 110960101\nfrom sys import stdin \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\nn,x = get() \nlst = [] \nfor i in range(n) : \n a,b = get() \n if a > b : a, b = b, a\n lst.append((a,b)) \n\nlst.sort() \n\nS, E = lst[0]\nfor i in range(1, n) : \n s, e = lst[i] \n if s > E : \n print(-1) \n exit() \n else : \n S = s\n E = min(E, e) \n\nif S <= x <= E : print(0) \nelse : print(min(abs(S - x), abs(E - x)))", "n, x = [int(x) for x in input().split()]\nm1 = -1\nm2 = 9999999\nfor i in range(n):\n a, b = [int(x) for x in input().split()]\n m1 = max(m1, min(a, b))\n m2 = min(m2, max(a, b))\n if m1 > m2: \n print(-1)\n exit()\nif x < m1:\n print(m1 - x)\nelif x >= m1:\n if x <= m2:\n print(0)\n else:\n print(x - m2)\n\t\t \t\t\t\t \t \t \t \t\t\t", "n, x0 = map(int, input().split())\r\nm = -1\r\nM = float('inf')\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n a, b = b, a\r\n m = max(a, m)\r\n M = min(b, M)\r\n\r\nif m > M:\r\n print(-1)\r\n exit()\r\n\r\nif x0 > M:\r\n print(x0-M)\r\nelif m <= x0 <= M:\r\n print(0)\r\nelse:\r\n print(m-x0)\r\n", "n,x0=[int(s) for s in input().split()]\r\nleft=[0]*n\r\nright=[0]*n\r\nfor i in range(n):\r\n a=[int(s) for s in input().split()]\r\n a.sort()\r\n left[i],right[i]=a\r\na=max(left)\r\nb=min(right)\r\nif a>b:\r\n print(-1)\r\nelse:\r\n if a<=x0<=b:\r\n print(0)\r\n else:\r\n print(min(abs(a-x0),abs(b-x0)))", "n,k=map(int,input().split())\r\nl1=0\r\nl2=1000\r\nf=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if(a>b):\r\n a,b=b,a\r\n if(a<l1 and b<l1 or a>l2 and b>l2):\r\n f=1\r\n else:\r\n l1=max(a,l1)\r\n l2=min(b,l2)\r\n \r\nif(f==0):\r\n if(k>=l1 and k<=l2):\r\n print(0)\r\n elif(k<l1):\r\n print(abs(k-l1))\r\n else:\r\n print(abs(k-l2))\r\nelse:\r\n print(-1)", "n, x = map(int, input().split())\r\nfor k in range(n):\r\n a, b = map(int, input().split())\r\n if a > b: a, b = b, a\r\n if k == 0:\r\n mi, ma = a, b\r\n else:\r\n mi, ma = max(mi, a), min(ma, b)\r\nif mi > ma: print(-1)\r\nelif x < mi: print(mi - x)\r\nelif x > ma: print(x - ma)\r\nelse: print(0)", "n,x0=map(int,input().split())\r\nl=-1\r\nr=1001\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l=max(l,min(a,b))\r\n r=min(r,max(a,b))\r\nif(l>r):\r\n print(\"-1\")\r\nelif(x0>=l and x0<=r):\r\n print(\"0\")\r\nelif(x0<l):\r\n print(l-x0)\r\nelse:\r\n print(x0-r)", "n,x = map(int, input().split())\r\np = 0\r\nq = 1001 \r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n if a>b:\r\n t = a\r\n a = b\r\n b = t\r\n p = max(p,a)\r\n q = min(q,b)\r\n \r\n \r\n#print(p,q)\r\nif p<=q:\r\n if x<p:\r\n print(p-x)\r\n elif x>q:\r\n print(x-q)\r\n else:\r\n print('0')\r\nelse:\r\n print('-1')", "import math,sys;input=sys.stdin.readline;S=lambda:input().rstrip();I=lambda:int(S());M=lambda:map(int,S().split());L=lambda:list(M());mod1=1000000007;mod2=998244353\r\n\r\nn,x = M()\r\n# largest left index\r\nl = 0 \r\n# smallest right index\r\nr = 1e4\r\nfor i in range(n):\r\n a,b = sorted(M())\r\n # if a>x:\r\n l = max(l,a)\r\n # if b<x:\r\n r = min(r,b)\r\n\r\nans = 0\r\nif x<l:\r\n ans = l-x\r\nelse:\r\n ans = x-r\r\n\r\nif l<=x<=r:\r\n ans =0\r\n\r\nif l>r:\r\n ans=-1\r\n\r\nprint(ans)", "def mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn,x=mp()\r\nans=0\r\nv=[]\r\np=[]\r\nfor _ in range(n):\r\n\ta,b=sorted(list(mp()))\r\n\tv.append(a)\r\n\tp.append(b)\r\n\tma=max(v)\r\n\tmi=min(p)\r\n# print(ma,mi)\r\nif ma>mi:\r\n\tprint(-1)\r\nelif mi>=x>=ma:\r\n\tprint(0)\r\nelse:\r\n\tprint(max((x-mi),(ma-x)))\r\n\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, x0 = map(int, input().split())\r\nimos = [0] * 1010\r\nfor ai, bi in (map(int, input().split()) for _ in range(n)):\r\n if ai > bi:\r\n ai, bi = bi, ai\r\n imos[ai] += 1\r\n imos[bi + 1] -= 1\r\n\r\nans = inf = 10**9\r\n\r\nfor i in range(1001):\r\n imos[i + 1] += imos[i]\r\n if imos[i] == n and ans > abs(x0 - i):\r\n ans = abs(x0 - i)\r\n\r\nprint(ans if ans < inf else -1)\r\n", "n, x0 = map(int, input().split())\nx1, x2 = 0, 1000\nfor i in range(n):\n a, b = map(int, input().split())\n x1 = max(x1, min(a, b))\n x2 = min(x2, max(a, b))\nprint(max(0, x1 - x0, x0 - x2) if x2 >= x1 else -1)", "n, x0 = map(int, input().split())\r\n\r\nhas = set([x for x in range(1, 1001)])\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n a, b = min(a, b), max(a, b)\r\n has2 = set([x for x in range(a, b+1)])\r\n has = has & has2\r\n\r\nif len(has) == 0:\r\n print(-1)\r\nelif x0 in has:\r\n print(0)\r\nelif x0 < min(has):\r\n print(min(has) - x0)\r\nelse:\r\n print(x0 - max(has)) \r\n", "n, x = map(int, input().split())\r\na = 0\r\nb = 1000\r\nfor i in range(n):\r\n c, d = map(int, input().split())\r\n a = max(a, min(c, d))\r\n b = min(b, max(c, d))\r\n if a > b:\r\n print(-1)\r\n exit(0)\r\nif a <= x <= b:\r\n print(0)\r\nelse:\r\n print(min(abs(a - x), abs(b - x)))\r\n", "ans = 0\r\nn, x0 = map(int, input().split())\r\npos = set()\r\nfor i in range(1001):\r\n pos.add(i)\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n a, b = b, a\r\n pos &= set(range(a, b + 1))\r\n \r\nif len(pos) == 0:\r\n print(-1)\r\nelse:\r\n ans = 1000\r\n for x in pos:\r\n ans = min(ans, abs(x - x0))\r\n print(ans)", "n, x0 = map(int, input().split())\r\na = [0] * n\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n a[i] = (min(ai, bi), max(ai, bi))\r\nb = sorted(a, key= lambda x: x[0])\r\nc = sorted(a, key= lambda x: x[1])\r\nif c[0][1] >= b[-1][0]:\r\n if b[-1][0] <= x0 <= c[0][1]:\r\n print(0)\r\n else:\r\n print(min(abs(b[-1][0] - x0), abs(c[0][1] - x0)))\r\nelse:\r\n print(-1)\r\n", "n,x=map(int, input().split())\r\np,q=map(int, input().split())\r\na=min(p,q)\r\nb=max(p,q)\r\nmn=a\r\nmx=b\r\nn-=1\r\nflag=1\r\nwhile n:\r\n p,q=map(int, input().split())\r\n a=min(p,q)\r\n b=max(p,q)\r\n # print(mn, end=\" \")\r\n # print(mx)\r\n if a>mn: mn=a\r\n if b<mx: mx=b\r\n if mn<a or mn>b or mx<a or mx>b: flag=0\r\n n-=1\r\n# print(mn, end=\" \")\r\n# print(mx, end=\" \")\r\nif flag==0: print(-1)\r\nelif x>=mn and x<=mx: print(0)\r\nelse:\r\n print(abs(mn-x) if abs(mn-x)<abs(mx-x) else abs(mx-x))", "n, x = map(int, input().split())\r\n\r\np1, p2 = 0, 1000\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if(max(a,b) <p2):\r\n p2 = max(a,b)\r\n if(min(a,b) > p1):\r\n p1 = min(a,b)\r\n \r\nif(p1>p2):\r\n print(\"-1\")\r\nelif(x >= p1 and x<=p2):\r\n print(\"0\")\r\nelif(x < p1):\r\n print(p1-x)\r\nelse:\r\n print(x-p2)\r\n\r\n\r\n\r\n\r\n", "# LUOGU_RID: 101621976\nfrom math import *\nfrom collections import *\nn,x = map(int, input().split())\nk = n\nd = [0] * 1005\nwhile k:\n k -= 1\n s,e = map(int, input().split())\n if s > e: s,e = e,s\n d[s] += 1\n d[e+1] -= 1\n\ni = 0\nst = []\nstate = 0\nans = inf\nwhile i <= 1001:\n state += d[i]\n if state == n:\n if abs(i - x) < ans: ans = abs(i - x)\n i += 1\nprint(ans) if ans != inf else print(-1)\n", "n,x=input().split()\r\nn,x=int(n),int(x)\r\nu=10**6\r\nl=0\r\nfor i in range(n):\r\n a,b=input().split()\r\n a,b=int(a),int(b)\r\n a,b=sorted([a,b])\r\n u=min(b,u)\r\n l=max(a,l)\r\nif l>u:print(-1)\r\nelif u>=x>=l:print(0)\r\nelse:print(max(l-x,x-u))", "\r\nl=0;r=1E4\r\nn,x=map(int,input().split())\r\nfor _ in[0]*n:\r\n a,b=sorted(map(int,input().split()))\r\n l=max(l,a)\r\n r=min(r,b)\r\nprint([[[x-r,l-x][x<l],0][l<=x<=r],-1][l>r])" ]

[ "n, k = map(int, input().split())\r\nif k << 1 > n: k = n - k\r\ns = 1\r\nfor i in range(n):\r\n s += 1 + i * k // n + (i * k + k - 1) // n\r\n print(s)", "n, k = map(int, input().split())\nif n // 2 < k:\n k = n - k\ni = 1\ncount = 1\nans = [1]\nfor _ in range(n):\n i += k\n if i > n + 1:\n count += 1\n ans.append(ans[-1] + count)\n count += 1\n i -= n\n else:\n ans.append(ans[-1] + count)\nprint(*ans[1:])\n\n\n \t\t\t \t \t\t \t\t\t\t\t\t \t \t", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\ncurr=0\r\nans=1\r\nif(k>n//2):\r\n k=n-k\r\nfor i in range(n):\r\n curr+=k\r\n if(i==n-1):\r\n ans=ans+2*(curr//n)-1\r\n elif(curr%n<k):\r\n ans=ans+2*((curr)//n)\r\n else:\r\n ans=ans+2*((curr)//n)+1\r\n print(ans,end=\" \")\r\n" ]

[ "n = int(input())\r\np = []\r\nfor i in range(n):\r\n p.append(list(input()))\r\nmax = 0\r\nfor i in range(n):\r\n q = p\r\n for t in range(n):\r\n if q[i][t] == '0':\r\n for k in range(n):\r\n if q[k][t] == '0':\r\n q[k][t] = '1'\r\n else:\r\n q[k][t] = '0'\r\n col = 0\r\n for t in range(n):\r\n sum = 0\r\n for e in range(n):\r\n if q[t][e] == '1':\r\n sum += 1\r\n if sum == n:\r\n col += 1\r\n if col > max:\r\n max = col\r\nprint(max)\r\n \r\n", "from collections import defaultdict\n\nn = int(input())\nans = 0\nrows = defaultdict()\n\nfor _ in range(n):\n\n row = str(input())\n\n if row in rows:\n rows[row] += 1\n else:\n rows[row] = 1\n\n curr = rows[row]\n \n if curr > ans:\n ans = curr\n\n \n \n\nprint(ans)\n\n \n", "n = int(input())\r\ngrid = [input() for i in range(n)]\r\nprint(max([grid.count(i) for i in set(grid)]))\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n l.append(s)\r\nresult=0\r\nfor i in l:\r\n if l.count(i)>result:\r\n result=l.count(i)\r\nprint(result)\r\n \r\n \r\n", "import sys\n\ndigitInput = int((sys.stdin.readline()).strip(\"\\n\"))\n\ndigitList = []\nmaxCount = 0\n\nfor i in range(digitInput):\n digitList.append(((sys.stdin.readline()).strip(\"\\n\")))\n\nfor n in set(digitList):\n if digitList.count(n) > maxCount:\n maxCount = digitList.count(n)\n \nsys.stdout.write(str(maxCount))\n\n \t \t\t\t \t \t\t \t \t\t \t\t\t", "n = int(input())\r\ngrid = [[0]*n for i in range(n)]\r\nfor r in range(n):\r\n s = input()\r\n for c in range(n):\r\n grid[r][c] = ord(s[c]) - ord('0')\r\nmax_clean_count = 0\r\nfor r in range(n):\r\n state = [x ^ 1 for x in grid[r]]\r\n clean_count = 0\r\n for r2 in range(n):\r\n if all(grid[r2][c] ^ state[c] == 1 for c in range(n)):\r\n clean_count += 1\r\n max_clean_count = max(max_clean_count, clean_count) \r\nprint(max_clean_count) ", "n = int(input())\r\nfrom collections import Counter\r\nprint(Counter([input() for i in range(n)]).most_common(1)[0][1])", "n=int(input())\r\ns=[input() for i in range(n)]\r\nprint(max(s.count(x) for x in s))", "n=int(input());l=[];m=0\r\nfor i in range(n):\r\n\tl.append(input())\r\nfor i in range(n):\r\n\ts=0\r\n\tfor j in range(n):\r\n\t\tif l[i]==l[j]:s+=1\r\n\tm=max(m,s)\r\nprint(m)", "from collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(int)\r\nfor i in range(n):\r\n s = input()\r\n d[s]+=1\r\nmx = 0\r\nfor i in d:\r\n mx = max(mx,d[i])\r\nprint(mx)", "n = int(input())\na = []\nfor i in range(n):\n a.append(input())\n# заполнили комнату\n\nmax_v = 0\nfor i in range(n):\n if a[i] == '1'*n:\n max_v += 1\n# посчитали количество чистых строк\n\nfor i in range(n):\n # представим, что i-ая строка чистая\n v = 0\n for j in range(n):\n if a[i] == a[j]:\n v += 1\n if v > max_v:\n max_v = v\n \nprint(max_v)", "n = int(input())\r\nroom = []\r\nfor _ in range(n):\r\n row = tuple(input())\r\n room.append(row)\r\n\r\nmemo = {}\r\nfor i in range(n):\r\n try: memo[room[i]] += 1\r\n except KeyError:\r\n memo[room[i]] = 1\r\n\r\nmax_rows = max([(value, key) for key, value in memo.items()])\r\nprint(max_rows[0])\r\n", "'''input\r\n3\r\n111\r\n111\r\n111\r\n'''\r\nfrom collections import defaultdict as dd\r\nn=int(input())\r\nd=dd(int)\r\nfor i in range(n):\r\n\tl=input().strip()\r\n\td[l]+=1\r\nm=sorted(d.values())[-1]\r\nprint(m)\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n t = a[i]\r\n a[i] = []\r\n for j in range(n):\r\n a[i].append(t[j] == '1')\r\n#print(a)\r\nmaxRes = -1\r\nfor i in range(n):\r\n s = []\r\n b = a[:]\r\n for j in range(n):\r\n s.append(not a[i][j])\r\n b[i][j] = True\r\n for j in range(i):\r\n for k in range(n):\r\n if s[k]:\r\n b[j][k] = not b[j][k]\r\n #print(s)\r\n for j in range(i+1, n):\r\n for k in range(n):\r\n if s[k]:\r\n b[j][k] = not b[j][k]\r\n res = 0\r\n for j in range(n):\r\n t = True\r\n for k in range(n):\r\n if not b[j][k]:\r\n t = False\r\n if t:\r\n res += 1\r\n maxRes = max(maxRes, res)\r\n #print(b)\r\n #print()\r\nprint(maxRes)\r\n", "n=int(input())\r\nm=[]\r\nfor i in range(n):\r\n s=input()\r\n m.append(s)\r\n\r\nd={}\r\nfor i in range(len(m)):\r\n r=\"\"\r\n x=m[i]\r\n for j in range(len(x)):\r\n if x[j]==\"0\":\r\n r+=str(j)\r\n if r in d:\r\n d[r]+=1\r\n else:\r\n d[r]=1\r\n\r\ny=d.values()\r\nprint(max(y))", "# cook your dish here\r\nfrom collections import defaultdict\r\nn=int(input())\r\nl=[]\r\nwhile(n>0):\r\n x=input()\r\n l.append(x)\r\n n-=1\r\nd=dict()\r\nfor i in range(len(l)):\r\n if d.get(l[i]):\r\n d[l[i]]+=1\r\n else:\r\n d[l[i]]=1\r\na=max(d,key=lambda x:d[x])\r\nprint(d[a])", "l=[]\r\nc=[]\r\nfor i in range(int(input())):\r\n b=input()\r\n l+=[b]\r\nfor j in l:\r\n c+=[l.count(j)]\r\nprint(max(c))\r\n\r\n\r\n", "t = dict()\r\nfor s in [input() for i in range(int(input()))]:\r\n t[s] = t.get(s, 0) + 1\r\nprint(max([t[s] for s in t]))", "# from collections import defaultdict\n\n# n=int(input())\n# L=[]\n# d = defaultdict()\n# for i in range(n):\n# \tpar=input()\n# \tL.append(par)\n# for i in L:\n# \td[i] += 1\n# result = max(d.items(), key=lambda x: x[1])\n# print(result[1])\n\nfrom collections import Counter\nn=int(input())\nL=[]\nfor i in range(n):\n\tL.append(input())\nmost_common,num_most_common = Counter(L).most_common(1)[0]\nprint(num_most_common)", "# http://codeforces.com/problemset/problem/554/B\r\n\r\nn = int(input())\r\nfloor = []\r\n\r\nfor i in range(n):\r\n floor.append(input())\r\n\r\nprint(floor.count(max(set(floor), key=floor.count)))", "I = input\r\ns = [I() for _ in \"0\" * int(I())]\r\nprint(max(s.count(i) for i in s))\r\n", "import sys\nn = int(input())\ns = [x for x in sys.stdin.read().split()]\nc = 0\nfor a in s:\n c = max(c, s.count(a))\nprint(c)\n\t\t\t\t \t \t \t\t\t \t\t\t \t\t\t \t \t \t\t\t\t", "def main_function():\r\n n = int(input())\r\n room = [[int(j) for j in list(input())] for i in range(n)]\r\n clones = 1\r\n for i in range(len(room)):\r\n counter = 1\r\n for j in range(len(room)):\r\n if i != j:\r\n if room[i] == room[j]:\r\n counter += 1\r\n if clones < counter:\r\n clones = counter\r\n print(clones)\r\n\r\n\r\nmain_function()", "mod = 10 ** 9 + 7\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn=ii()\r\nl=[]\r\nmx=0\r\nfor i in range(n):\r\n l.append(si())\r\nfor i in range(n-1):\r\n c=0\r\n for j in range(i+1,n):\r\n if l[i]==l[j]:\r\n c+=1\r\n mx=max(mx,c)\r\nprint(mx+1)", "# Problem Link: https://codeforces.com/problemset/problem/554/B\r\n# Problem Status:\r\n# ---------------------------- SEPARATOR ----------------------------\r\ndef TheAmazingFunction(Grid: list):\r\n Table = dict()\r\n MaxNumOfCommonRows = 0\r\n for line in Grid:\r\n if Table.get(line) is None:\r\n Table.update({line: 1})\r\n else:\r\n Table.update({line: Table.get(line)+1})\r\n if Table.get(line) > MaxNumOfCommonRows:\r\n MaxNumOfCommonRows = Table.get(line)\r\n return MaxNumOfCommonRows\r\n\r\n\r\n# ---------------------------- SEPARATOR ----------------------------\r\nN = int(input())\r\nA = []\r\nfor i in range(N):\r\n A.append(input())\r\nprint(TheAmazingFunction(A))\r\n# ---------------------------- SEPARATOR ----------------------------\r\n", "n=int(input())\narr=[]\nfor i in range(n):\n arr.append(list(input()))\narr.sort()\nans = 0\nleft = 0\nright = 0\nwhile right<n and left<n:\n if arr[left]==arr[right]:\n ans = max(ans,right-left+1)\n right+=1\n else:\n left+=1\nprint (ans)\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tl.append(input())\r\n_max = 1\r\nfor i in range(n):\r\n\t_sum = 0\r\n\tfor j in range(n):\r\n\t\tif (l[j] == l[i]):\r\n\t\t\t_sum += 1\r\n\t_max = max(_max, _sum)\r\nprint(_max)", "n =int(input())\r\nmatrix = [0] * n \r\nfor i in range(n) :\r\n matrix[i] = [i for i in input()]\r\nmx = 0\r\nfor i in matrix: \r\n counter = matrix.count(i)\r\n mx =max(mx,counter)\r\n\r\nprint(mx)\r\n", "room = [input() for i in range(int(input()))]\r\nprint(max([room.count(i) for i in room]))", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(int(''.join(input().split())))\r\nmatrix.sort()\r\nans = 1\r\ncnt = 1\r\nfor i in range(1, n):\r\n if matrix[i] == matrix[i-1]:\r\n cnt += 1\r\n else:\r\n cnt = 1\r\n if cnt > ans:\r\n ans = cnt\r\nprint(ans)\r\n", "n=int(input())\r\nl=[input() for _ in range(n)]\r\nd={}\r\nfor x in l:\r\n d[x]=d.get(x,0)+1\r\nprint(max(d.values()))", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 1000000007\r\nMAX = 10**10\r\n\r\n\r\ndef inp():\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 vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\ndef main():\r\n ss = {}\r\n n = int(input())\r\n for i in range(n):\r\n s = input()\r\n if s in ss:\r\n ss[s] += 1\r\n else:\r\n ss[s] = 1\r\n mx = 0\r\n for i in ss:\r\n mx = max(mx, ss[i])\r\n print(mx)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import Counter\r\ncnt=Counter()\r\nn=int(input())\r\nfor i in range(n):\r\n x=input()\r\n cnt[x]+=1\r\nm=0\r\nfor i in cnt:\r\n m=max(m,cnt[i])\r\nprint(m)", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nimport sys\n\nr = []\n\nfor i in range(int(input())):\n r.append(sys.stdin.readline())\n\nprint(max(r.count(i) for i in r))\n\n\n\n", "n=int(input())\nz=[[int(k) for k in input().split()] for i in range(n)]\nans=0\nfor i in z:\n ans=max(ans , z.count(i))\nprint(ans)\n", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n r = input()\r\n if r not in d:\r\n d[r] = 1\r\n else:\r\n d[r] += 1\r\nprint(max(d.values()))\r\n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\n\nk = [input().strip() for i in range(n)]\nk.sort()\n\nlolcount = 1\ncount = 1\n\nfor i in range(1,n):\n if k[i] == k[i-1]:\n count+=1\n else:\n if lolcount<count:\n lolcount = count\n count = 1\n\nif count > lolcount:\n lolcount = count\nprint(lolcount)\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())\r\n#ar = list(map(int, input().split()))\r\n\r\nn = int(input())\r\nd = {}\r\n\r\nfor i in range(n):\r\n s = input()\r\n if s in d:\r\n d[s] += 1\r\n else:\r\n d[s] = 1\r\n \r\nd = sorted(d.items(), key=lambda x: x[1], reverse=True)\r\nprint(d[0][1])", "n=int(input())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\ns.sort()\r\nm=0\r\nc=1\r\nfor i in range(1,n):\r\n if s[i]==s[i-1]:\r\n c+=1\r\n else:\r\n if c>m:\r\n m=c\r\n c=1\r\nif c>m:\r\n m=c\r\nprint(m)\r\n", "from sys import stdin ,stdout\r\nfrom os import path\r\nrd = lambda:stdin.readline().strip()\r\nwr = stdout.write\r\nif(path.exists('input.txt')):\r\n stdin = open(\"input.txt\",\"r\")\r\nimport time \r\n#------------------------------------\r\narr = [rd() for _ in range(int(rd()))]\r\nprint(max(arr.count(s) for s in arr))", "n=int(input())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\nc={}\r\nfor i in s:\r\n if(any(i in d for d in c)):\r\n c[i]=c[i]+1\r\n else:\r\n c[i]=1\r\nmax=1\r\nfor key in c:\r\n if c[key]>max:\r\n max=c[key]\r\nprint(max)", "from functools import reduce\r\nn = int(input())\r\ns = [input() for i in range(n)]\r\n\r\nprint(reduce(max, [s.count(i) for i in s], 1))\r\n ", "n=int(input())\r\nmin=-1\r\nl=[]\r\nfor i in range(n):\r\n s=str(input())\r\n l.append(s)\r\nfor i in range(0,len(l)):\r\n if(l.count(l[i])>min):\r\n min=l.count(l[i])\r\nprint(min) \r\n \r\n", "n=int(input())\r\na,best=[],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 b=0\r\n for j in range(i,n):\r\n if a[i]==a[j]:b+=1\r\n if b>best:best=b\r\nprint(best)\r\n", "n=int(input())\r\na=[]*n\r\nc=[0]*(n)\r\nx=0\r\nfor i in range(n):\r\n l=int(input())\r\n if l not in a:\r\n a.append(l)\r\n if l in a:\r\n c[a.index(l)]+=1\r\n \r\nprint(max(c))\r\n", "n=int(input())\r\n \r\n \r\ns=[input() for i in range(n)]\r\nmx=0\r\n \r\nfor a in s:\r\n \r\n cnt=s.count(a)\r\n mx=max(mx,cnt)\r\nprint(mx)", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ncnt = defaultdict(lambda : 0)\r\nfor _ in range(n):\r\n s = input().rstrip().decode()\r\n cnt[s] += 1\r\nans = max(cnt.values())\r\nprint(ans)", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(input())\r\nmx = 0\r\nfor i in range(n):\r\n y = arr[i:].count(arr[i])\r\n mx = max(y,mx)\r\nprint(mx)", "from collections import Counter\r\nn = int(input().strip())\r\nc = Counter()\r\nfor _ in range(n):\r\n w = str(input().strip())\r\n c[w] += 1\r\n_,val = c.most_common(1)[0]\r\nprint(val)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\nn = int(input())\ntable = []\n\nfor i in range(n):\n table.append([int(i) for i in input().split()])\n\nstart = time.time()\nans = 0\n\nfor i in range(n):\n buf = 0\n for j in range(n):\n if table[i] == table[j]:\n buf += 1\n if buf > ans:\n ans = buf\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "from collections import defaultdict\r\nn = int(input())\r\ntotal = 0\r\ncount = defaultdict(int)\r\nfor _ in range(n):\r\n s = input()\r\n key = tuple(i for i,c in enumerate(s) if c=='0')\r\n count[key] += 1\r\nprint (max(count.values()))", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\ndef frequent(s):\n from collections import Counter\n cc = Counter(s).most_common(1)\n return cc[0][1]\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn = ii()\nr = []\n\nfor i in range(n):\n r.append(si().replace(' ', ''))\n\nprint(frequent(r))\n\n\n\n", "from collections import defaultdict\nn, ans = int(input()), 0\nmp = defaultdict(int)\nwhile n:\n x = input()\n mp[x] += 1\n n -= 1\nfor i in mp:\n ans = max(ans, mp[i])\nprint(ans)", "\nn = int(input())\n\nmatrix = []\n\nfor i in range(n):\n matrix.append(list(input()))\n\nmax_count = 0\nfor k in matrix:\n count = 0\n for i in matrix:\n count += k == i and 1 or 0\n max_count = max(max_count, count)\n\nprint(max_count)", "from collections import Counter\r\nn = int(input())\r\na = [input() for i in range(n)]\r\nc = Counter(a)\r\nprint(c.most_common(1)[0][1])", "from collections import Counter\r\nprint(Counter(input() for i in range(int(input()))).most_common(1)[0][1])", "from collections import Counter\r\ndef solve():\r\n n = int(input())\r\n l = [input() for _ in range(n)]\r\n #print(l)\r\n c = Counter(l)\r\n #print(c)\r\n print(c.most_common(1)[0][1])\r\nsolve()", "s = int(input())\r\nk = []\r\nfor i in range(0,s):\r\n a=input()\r\n k.append(a)\r\namount = []\r\nfor i in range(s):\r\n amount.append(0)\r\n for j in range(s):\r\n if k[i] == k[j]:\r\n amount[i] += 1\r\nans = max(amount)\r\nprint (ans)", "n=int(input())\nmtr=[]\ncont=[]\nfor i in range(n):\n mtr.append(input()) \nfor i in range(len(mtr)):\n aux=0\n for j in range(i,len(mtr)):\n if mtr[i]==mtr[j]:\n aux+=1\n cont.append(aux)\nprint(max(cont)) \n\t\t\t \t\t\t\t \t\t\t\t \t\t \t \t \t\t", "n=int(input())\r\na=[]\r\nfor i in range(n):a.append(input())\r\na.sort()\r\no=k=1\r\nfor i in range(1,n):\r\n if(a[i]==a[i-1]):k=k+1;o=max(o,k)\r\n else:k=1\r\nprint(o)\r\n", "from collections import Counter;print(Counter([input() for i in range(int(input()))]).most_common(1)[0][1])\r\n", "x = []\nfor i in range (int (input())): x.append (input())\nm = 1\nfor i in x: m = max (m, x.count (i))\nprint (m) \n", "n = int(input())\r\na = [list(input()) for i in range(n)]\r\n\r\nMax = 0\r\nfor i in a:\r\n\tcnt = 0\r\n\tfor j in a:\r\n\t\tif i == j:\r\n\t\t\tcnt += 1\r\n\tMax = max(cnt, Max)\r\nprint(Max)", "\r\nn = int(input())\r\n\r\n\r\nls = {}\r\nm = 0\r\n\r\n\r\nfor i in range(n):\r\n s = input()\r\n if s not in ls:\r\n ls[s] = 0\r\n val = ls[s]\r\n val += 1\r\n if val > m:\r\n m = val\r\n ls[s] = val\r\n\r\nprint(m)\r\n", "n = int(input())\r\nA = [input() for i in range(n)]\r\nans = max(A.count(s) for s in A)\r\nprint (ans)\r\n ", "def main():\r\n n = int(input())\r\n lines = []\r\n d = {}\r\n for _ in range(n):\r\n l = input()\r\n if l not in d:\r\n d[l] = 0\r\n d[l] +=1\r\n ans = max(d.values())\r\n print(ans)\r\n\r\nif __name__=='__main__':\r\n main()\r\n \r\n ", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nm=0\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if(l[i]==l[j]):\r\n c=c+1\r\n m=max(m,c)\r\nprint(m)\r\n", "n=int(input())\r\nb=[tuple(map(int,tuple(input()))) for x in range(n)]\r\nd={b.count(x) for x in b}\r\nprint(max(d))", "from collections import Counter\r\n\r\nn = int(input())\r\ngrid = [[int(c) for c in input()] for _ in range(n)]\r\ncnt = Counter()\r\n\r\nfor line in grid:\r\n changes = tuple(i for i in range(n) if line[i] == 0)\r\n cnt[changes] += 1\r\n\r\nprint(max(cnt.values()))\r\n", "n = int(input())\r\na = [input() for i in range(n)]\r\nprint(max(sum(i == j for j in a) for i in a))", "n=int(input())\r\nb=[list(map(int,list(input()))) for _ in range(n)]\r\nprint(max(sum(sum(b[j][k]^b[i][k]^1 for k in range(n))==n for j in range(n)) for i in range(n)))", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\nfrom collections import Counter\nr = [input() for _ in range(int(input()))]\nprint(max(Counter(r).values()))\n\n\n", "n = int(input())\r\ns = [input() for i in range(n)]\r\nprint (max(sum(i == j for j in s) for i in s))\r\n", "__author__ = 'taras-sereda'\nfrom collections import Counter\n\ndef b():\n n = int(input())\n\n mat = [input() for i in range(n)]\n return Counter(mat).most_common(1)[0][1]\n\nif __name__ == \"__main__\":\n print(b())\n", "n = int(input())\r\nl = [[int(i) for i in list(input())] for j in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n l1 = []\r\n for j in range(n):\r\n l1.append(l[j])\r\n for j in range(n):\r\n if l1[i][j] == 0:\r\n for k in range(n):\r\n l1[k][j] = abs(l1[k][j] - 1)\r\n s = 0\r\n for j in range(n):\r\n if l1[j] == [1] * n:\r\n s += 1\r\n ans = max(ans, s)\r\nprint(ans)", "n = int(input())\r\nline = []\r\nbig = 1\r\nfor i in range(n):\r\n line.append(input())\r\nfor i in range(n):\r\n if line.count(line[i])> big:\r\n big = line.count(line[i])\r\nprint(big)", "a = list()\r\nfor i in range(int(input())):\r\n\ta.append(input())\r\nans = 0\r\nfor i in range(len(a)):\r\n\tans = max(ans, a.count(a[i]))\r\nprint(ans)", "# http://codeforces.com/problemset/problem/554/B\r\n\r\ndef numClean(floor):\r\n num = 0;\r\n\r\n for i in floor:\r\n if i.count('1') == len(i):\r\n num += 1\r\n\r\n return num\r\n\r\ndef most_common(list):\r\n return max(set(list), key=list.count)\r\n\r\nn = int(input())\r\nfloor = []\r\n\r\nfor i in range(n):\r\n floor.append(input())\r\n\r\nmajority = list(most_common(floor))\r\n\r\nfor i in range(len(floor)):\r\n floor[i] = list(floor[i])\r\n\r\nprint(floor.count(majority))", "n = int(input())\r\nmt = dict()\r\n\r\nfor i in range(n):\r\n line = input()\r\n if line in mt:\r\n mt[line] += 1\r\n else:\r\n mt[line] = 1\r\n\r\nprint(max(mt.values()))", "from collections import Counter\r\n\r\nn = int(input())\r\n\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(input())\r\n\r\n\r\nx = Counter(a)\r\n\r\n#print(x.most_common())\r\nk = (x.most_common(1))\r\n\r\nfor i , j in k :\r\n print(j)\r\n\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\ncnt = Counter()\r\n\r\nfor _ in range(n):\r\n line = input()\r\n changes = tuple(i for i in range(n) if line[i] == '0')\r\n cnt[changes] += 1\r\n\r\nprint(max(cnt.values()))\r\n", "n=int(input())\r\ns=[None]*n\r\nfor i in range (n):\r\n s[i]=input()\r\nres=0\r\nfor i in range(n):\r\n count=0\r\n for j in range(n):\r\n if(s[i]==s[j]):\r\n count+=1\r\n res=max(count,res)\r\nprint(res)\r\n", "import collections\r\n \r\nn = int(input())\r\nroom_in = [input() for i in range(n)]\r\ncc = collections.Counter(room_in)\r\nprint(max(cc.values()))\r\n", "from collections import Counter\r\n\r\nn = int(input())\r\nlines = []\r\n\r\nfor i in range(n):\r\n lines.append(list(map(int, list(input()))))\r\n\r\nprint(max([y for y in Counter(tuple(x) for x in lines).values()]))", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nmi = lambda: map(int, input().split())\nli = lambda: list(mi())\nsi = lambda: input()\n\nn = ii()\nr = []\n\nfor i in range(n):\n r.append(si().replace(' ', ''))\n\nprint(max(r.count(i)for i in r))\n\n\n\n", "n=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n\ta=[int(x) for x in input()]\r\n\tlst.append(a)\r\n\r\np=[]\r\nfor i in range(n):\r\n\ta=[]\r\n\tfor j in range(n):\r\n\t\tif lst[i][j]==0:\r\n\t\t\ta.append(j)\r\n\tp.append(a)\r\n\r\n\r\nd=[p.count(i) for i in p]\r\nmaxi=-1\r\nfor i in range(len(d)):\r\n\tif d[i]>maxi:\r\n\t\tmaxi=d[i]\r\n\r\n\r\nprint(maxi)\t\t\t\r\n\r\n", "#!/usr/bin/env python3\n\"\"\"\nCodeforces Round #309 (Div. 2)\n\nProblem 554 B. Ohana Cleans Up\n\n@author yamaton\n@date 2015-08-17\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(xss):\n \"\"\"\n dirty ... 0\n clean ... 1\n \"\"\"\n counter = collections.Counter(xss)\n return max(counter.values())\n\n\ndef print_stderr(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n = int(input())\n xss = [input().strip() for _ in range(n)]\n result = solve(xss)\n print(result)\n\n\nif __name__ == '__main__':\n main()", "n=int(input())\r\nmas=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n x=input()\r\n for y in range(n):\r\n mas[i][y]=x[y]\r\n\r\ndef calcut(mas,n):\r\n count=0\r\n for i in range(n):\r\n if mas[i].count(\"1\")==0:\r\n count+=1 \r\n return count\r\n\r\nr=[]\r\nr.append(calcut(mas,n))\r\nfor i in range(n):\r\n for j in range(n):\r\n if int(mas[i][j])==1:\r\n mas[i][j]=0 \r\n for d in range(1,n):\r\n if int(mas[d][j])==0:\r\n mas[d][j]=\"1\"\r\n else:\r\n mas[d][j]=\"0\"\r\n #r.append(calcut(mas,n))\r\n r.append(calcut(mas,n))\r\nprint(max(r))", "'''input\n3\n111\n111\n111\n'''\nl = [input() for _ in range(int(input()))]\nm = 0\nfor x in l:\n\tm = max(m, l.count(x))\nprint(m)", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\nd = {}\r\n\r\nfor i in range(0, n):\r\n st = stdin.readline()\r\n if st not in d:\r\n d[st] = 1\r\n else:\r\n d[st] += 1\r\n \r\nprint (max(d.values()))", "import string\nfrom collections import defaultdict\n\nhashMap = defaultdict(int)\nn = int(input())\nfor _ in range(n):\n line = input()\n hashMap[line] += 1\n \nans = max(hashMap[key] for key in hashMap)\nprint(ans)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([])\r\nfor i in range(n):\r\n a[i]=list(input().split())\r\ndic={}\r\nfor i in range(n):\r\n temp=''.join(a[i])\r\n if temp in dic:\r\n dic[temp]+=1\r\n else:\r\n dic[temp]=1\r\nans=0\r\nfor k,v in dic.items():\r\n ans=max(ans,v)\r\nprint(ans)", "from collections import Counter\r\nn = int(input())\r\nprint(max(Counter([input() for _ in range(n)]).values()))\r\n", "a=int(input())\r\nd={}\r\nfor _ in \" \"*a:\r\n z=input()\r\n d[z]=d.get(z,0)+1\r\nprint(max(d.values()))", "from collections import defaultdict\r\n\r\nd = defaultdict(int)\r\n\r\nfor _ in range(int(input())):\r\n d[input()] += 1\r\n\r\nprint(max(d.values()))", "d = {}\nfor row in range(int(input())):\n current = input()\n d[current] = d[current] + 1 if d.get(current) else 1\n\nprint(max(d.values()))\n\n\n", "n = int(input())\r\nfrom collections import *\r\nprint(Counter([input() for i in range(n)]).most_common(1)[0][1])", "if __name__ == '__main__':\r\n n = int(input())\r\n book = dict()\r\n for i in range(n):\r\n line = str(input())\r\n num = 1\r\n if line in book.keys():\r\n num += book.get(line)\r\n book.update({line: num})\r\n line = list()\r\n for k, v in book.items():\r\n line.append(v)\r\n print(max(line))\r\n", "def func(x):\n pass\n\nif __name__ == \"__main__\":\n x = int(input())\n grid = {}\n for _ in range(x):\n row = input()\n if row not in grid:\n grid[row] = 1\n else:\n grid[row] += 1\n best_value = 0\n for key, value in grid.items():\n if value > best_value:\n best_value = value\n print(best_value)\n", "# http://codeforces.com/problemset/problem/554/B\r\n\r\ndef numClean(floor):\r\n num = 0;\r\n\r\n for i in floor:\r\n if i.count('1') == len(i):\r\n num += 1\r\n\r\n return num\r\n\r\ndef sweep(floor, col):\r\n for i in range(len(floor)):\r\n if floor[i][col] == '1':\r\n floor[i][col] = '0'\r\n else:\r\n floor[i][col] = '1'\r\n\r\n return floor\r\n\r\ndef most_common(list):\r\n return max(set(list), key=list.count)\r\n\r\nn = int(input())\r\nfloor = []\r\n\r\nfor i in range(n):\r\n floor.append(input())\r\n\r\nmajority = list(most_common(floor))\r\n\r\nfor i in range(len(floor)):\r\n floor[i] = list(floor[i])\r\n\r\nfor i in range(len(floor)):\r\n if majority[i] == '0':\r\n sweep(floor, i)\r\n\r\nprint(numClean(floor))", "t=int(input())\r\ns=[]\r\nfor i in range(t):\r\n s.append(input())\r\ndic={}\r\nfor i in s:\r\n if(any(i in d for d in dic)):\r\n dic[i]=dic[i]+1\r\n else:\r\n dic[i]=1\r\nres=1\r\nfor key in dic:\r\n if dic[key]>res:\r\n res=dic[key]\r\nprint(res)", "n=int(input())\r\na=list()\r\nfor i in range(n):\r\n a.append(input())\r\nb=dict()\r\nfor i in range(n):\r\n if a[i] in b:\r\n b[a[i]]+=1\r\n else:\r\n b.update({a[i]:1})\r\nprint(max(b.values()))", "from collections import Counter\r\nn=int(input())\r\na=[]\r\nl=[]\r\nfor i in range(n):\r\n a.append(input())\r\nfreq = Counter(a)\r\nl = list(freq.values())\r\nprint(max(l))", "I=input\r\ns=[I()for _ in '0'*int(I())]\r\nprint(max(s.count(i) for i in s))\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2015 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\ndef check(c):\n for char in c:\n if char == '0':\n return False\n return True \n\nn = int(input())\n\ns = []\neq = [0 for i in range(n)]\nfor i in range(n):\n s.append(input())\n\nclean = 0\n\nfor c in s:\n if check(c):\n clean += 1\n\nfor i in range(n):\n for j in range(i, n):\n if s[i] == s[j]:\n eq[i] += 1\nprint(max(clean, max(eq))) \n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\n\r\nn = iinput()\r\nd = {}\r\n\r\nfor _ in range(n):\r\n\ts = input()\r\n\td[s] = d.get(s, 0) + 1\r\n\r\nans = 0\r\n\r\nfor key in d:\r\n\tans = max(ans, d[key])\t\r\n\r\nprint(ans)\t", "n = int(input())\r\nl=[]\r\nnumbers = []\r\nfor i in range(n):\r\n s1=input()\r\n l.append(s1)\r\n# print(l)\r\nfor i in range(n):\r\n count = l.count(l[i])\r\n numbers.append(count)\r\nprint(max(numbers))", "# Description of the problem can be found at http://codeforces.com/problemset/problem/554/B\r\n\r\nl_s = list(input() for _ in range(int(input())))\r\nm = 0\r\nfor i in l_s:\r\n m = max(m, l_s.count(i))\r\nprint(m)", "n = int(input())\r\nrow = []\r\nsRow = []\r\nnRow = []\r\nfor i in range(n):\r\n row+=[input()]\r\nfor i in range(n):\r\n if not(sRow.count(row[i])):\r\n sRow+=[row[i]]\r\n nRow += [row.count(row[i])]\r\nprint(max(nRow))\r\n", "n = int(input())\na = [[int(y) for y in input().strip()] for x in range(n)]\nres = 0\nfor rIt in range(n):\n\ttoChange, curRes = [], 0\n\tfor cIt in range(n):\n\t\ttoChange.append((a[rIt][cIt] + 1) % 2)\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif not (a[i][j] + toChange[j]) % 2:\n\t\t\t\tbreak\n\t\telse:\n\t\t\tcurRes += 1\n\tif curRes > res:\n\t\tres = curRes\nprint(res)", "\r\n\r\nn=int(input())\r\nco=0\r\nl=[]\r\nfor i in range(n):\r\n s=str(input())\r\n l.append(s)\r\n if len(set(s))==1 and s[0]==\"1\":\r\n co+=1\r\nif co==n:\r\n print(n)\r\nelse:\r\n maxo=0\r\n for i in range(len(l)):\r\n k=l.count(l[i])\r\n maxo=max(maxo,k)\r\n print(max(co,maxo))", "from copy import deepcopy\r\n\r\nn = int(input())\r\n\r\nmu = []\r\n\r\nfor i in range(0, n):\r\n mu.append(list(input()))\r\n \r\nma = deepcopy(mu)\r\nrwmc = 0\r\n \r\nfor i in range(0, n):\r\n for j in range(0, n):\r\n \r\n if '1' == mu[i][j]:\r\n for row in range(0, n):\r\n ma[row][j] = '0' if '1' == mu[row][j] else '1'\r\n else:\r\n for row in range(0, n):\r\n ma[row][j] = mu[row][j]\r\n\r\n rwc = 0\r\n\r\n for row in range(0, n):\r\n if not '1' in ma[row]:\r\n rwc += 1\r\n \r\n if rwc > rwmc:\r\n rwmc = rwc\r\n \r\nprint(rwmc)", "n = int(input())\r\nx = []\r\nfor i in range(n):\r\n x.append(input())\r\n \r\nc = 0\r\n\r\nfor i in x:\r\n t = x.count(i)\r\n if t > c:\r\n c = t\r\n \r\nprint(c)", "def deep(arr):\n\ttemp = []\n\tfor i in arr:\n\t\ttemp.append(list(i))\n\treturn temp\n\nn = int(input())\narr = []\nfor _ in range(n):\n\tarr.append(list(map(int, input())))\ntemp = deep(arr)\nans = 0\nfor i in range(n):\n\tarr = deep(temp)\n\tfor j in range(n):\n\t\tif arr[i][j] == 0:\n\t\t\tfor k in range(n):\n\t\t\t\tarr[k][j] = 1 - arr[k][j]\n\ttot = 0\n\tfor j in range(n):\n\t\tyay = 0\n\t\tfor k in range(n):\n\t\t\tyay += arr[j][k]\n\t\tif yay == n:\n\t\t\ttot += 1\n\tans = max(ans, tot)\nprint(ans)", "import sys\nfrom itertools import accumulate\n\n\namt = int(input())\n\ndct = {}\nfor _ in range(amt):\n\ttemp = int(input())\n\ttry:\n\t\tdct[temp] += 1\n\texcept:\n\t\tdct[temp] = 1\nprint(max(dct.values()))\n\t\n\n\t\n\n\n", "#!/usr/bin/python3.4\n\n__author__ = 'myduomilia'\n\nn, arr, ans = int(input()), [], 1\n\nfor i in range(n):\n arr.append(input())\nfor i in range(n):\n c = 1\n for j in range(n):\n c += 1 if arr[i] == arr[j] else 0\n ans = max(ans, c)\n\nprint(ans - 1)", "n=int(input())\r\narr=[]\r\nmaxt=0\r\nfor i in range(0,n):\r\n arr.append(input())\r\nfor k in range(0,len(arr)):\r\n p=arr.count(arr[k])\r\n if p>maxt:\r\n maxt=p\r\nprint(maxt)\r\n \r\n \r\n", "from collections import Counter\r\nn = int(input())\r\nprint(max(Counter(input() for _ in range(n)).values()))", "def str_inp(n):\r\n return [input() for x in range(n)]\r\n\r\n\r\nfrom collections import *\r\n\r\nprint((Counter(str_inp(int(input()))).most_common(1))[0][1])\r\n", "import sys\nfrom collections import Counter\ndim=int(sys.stdin.readline())\nstates=[]\nfor i in range(dim):\n states.append(input())\ndata=Counter(states)\nprint(data.most_common(1)[0][1])\n \t \t \t \t \t \t\t\t\t\t\t\t \t\t \t\t\t", "n = int(input())\r\nd = {}\r\nm=0\r\nfor i in range(n):\r\n s = input()\r\n if s not in d:\r\n d[s]=0\r\n d[s] += 1\r\n if d[s]>m:\r\n m=d[s]\r\nprint(str(m))\r\n", "maxRows = 1\nn = int(input())\ngrid = []\nfor i in range(n):\n grid.append(input())\nfor i in range(n):\n if grid.count(grid[i]) > maxRows:\n maxRows = grid.count(grid[i])\nprint(maxRows)\n\t\t \t\t\t \t \t\t \t\t\t\t\t\t \t\t\t\t", "from collections import Counter\r\nn=int(input())\r\n\r\nans=0\r\nl=[]\r\nfor i in range(n):\r\n s=input()\r\n if s==''.join(['1']*n):\r\n ans+=1\r\n l.append(s)\r\nd=Counter(l)\r\n#print(d)\r\nk=max(d,key=d.get)\r\nmx=d[k]\r\n#print(mx)\r\nans=max(ans,mx)\r\nprint(ans)\r\n", "n=int(input())\r\na=[];b=[1]*n\r\nfor i in range(n):\r\n k=input()\r\n if k in a:\r\n b[a.index(k)]+=1\r\n else:\r\n a.append(k)\r\nprint(max(b))\r\n", "n=int(input())\r\na=[]\r\nwhile(n):\r\n n-=1\r\n a.append(input())\r\nmaxc=0\r\nfor i in range(len(a)):\r\n c=0\r\n for j in range(i,len(a)):\r\n if(a[i]==a[j]):\r\n c+=1\r\n maxc=max(c,maxc)\r\nprint(maxc)", "a = int(input())\r\ns = dict()\r\nfor i in range(a):\r\n cur = input()\r\n if s.get(cur) != None:\r\n s[cur] += 1\r\n else:\r\n s[cur] = 1\r\nprint(max(s.values()))", "n = int(input())\r\nl = []\r\n\r\nfor i in range(n):\r\n x = input()\r\n l.append(x)\r\n\r\ns = set(l)\r\n#print(s)\r\nans = -100\r\n\r\nfor i in s :\r\n ans = max(ans , l.count(i))\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(input()))\r\narr.sort()\r\nans = 0\r\nleft = 0\r\nright = 0\r\nwhile right<n and left<n:\r\n if arr[left]==arr[right]:\r\n ans = max(ans,right-left+1)\r\n right+=1\r\n else:\r\n left+=1\r\nprint (ans)", "import collections\r\n\r\nn = int(input())\r\nroom = [input() for i in range(n)]\r\ncounter = collections.Counter(room)\r\nprint(max(counter.values()))\r\n", "n = int(input())\r\na = [list(map(int,input())) for i in range(n)]\r\nb = [[0]*n for i in range(n)]\r\nres = 0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tx = a[i][j] ^ 1\r\n\t\tfor k in range(n):\r\n\t\t\tb[k][j] = a[k][j] ^ x\r\n\tc = 0\r\n\tfor k in range(n):\r\n\t\tif b[k].count(0) == 0:\r\n\t\t\tc += 1\r\n\tres = max(res, c)\r\nprint(res)\r\n", "##def _equi(_s1:list, _s2:list) -> bool:\r\n## _s1.sort()\r\n## _s2.sort()\r\n## if _s1 == _s2:\r\n## return True\r\n## return False\r\n##\r\n##s1, s2 = input(), input()\r\n##\r\n##if s1 == s2:\r\n## print('YES')\r\n##else:\r\n## if (_equi(list(s1[:len(s1)//2]), list(s2[:len(s2)//2]))\\\r\n## and _equi(list(s1[len(s1)//2:]), list(s2[len(s2)//2:])))\\\r\n## or (_equi(list(s1[:len(s1)//2]), list(s2[len(s2)//2:]))\\\r\n## and _equi(list(s1[len(s1)//2:]), list(s2[:len(s2)//2]))):\r\n## print('YES')\r\n## else:\r\n## print('NO')\r\nimport copy\r\n\r\ndef swap(x:str) -> str:\r\n if x == '1':\r\n return '0'\r\n return '1'\r\n\r\ndef find_dirty(_list:list) -> int:\r\n judge = True\r\n for i in range(len(_list)):\r\n if _list[i] == '0':\r\n judge = False\r\n yield i\r\n if judge:\r\n yield -1\r\n\r\ndef clean(l1:[list], l2:list) -> [list]:\r\n if l2 == [-1]:\r\n return l1\r\n temp_list = copy.deepcopy(l1)\r\n for room_number in l2:\r\n for i in range(len(temp_list)):\r\n temp_list[i][room_number] = swap(temp_list[i][room_number])\r\n\r\n return temp_list\r\n\r\ndef clean_judge(_list:[list]) -> int:\r\n ans = 0\r\n for i in range(len(_list)):\r\n boolean = True\r\n for j in range(len(_list)):\r\n if _list[i][j] == '0':\r\n boolean = False\r\n break\r\n if boolean:\r\n ans += 1\r\n return ans \r\n\r\nnumber = int(input())\r\nroom_list = []\r\nfor i in range(number):\r\n room_list.append(list(input()))\r\n\r\nmaxi = 0\r\nfor i in range(number):\r\n temp_dirty_room = []\r\n for j in find_dirty(room_list[i]):\r\n temp_dirty_room.append(j)\r\n row_num = clean_judge(clean(room_list, temp_dirty_room))\r\n maxi = max(maxi, row_num)\r\n\r\nprint(maxi)\r\n", "n = int(input())\r\nslv = dict()\r\narr = []\r\nmatrix = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n curr = input()\r\n if slv.get(curr) == None:\r\n slv[curr] = 1\r\n else:\r\n slv[curr] += 1\r\nprint(max(slv.values()))", "from collections import Counter\n\nn = int(input())\n\ngrid = []\nfor i in range(n):\n grid.append(input())\n\nprint(Counter(grid).most_common(1)[0][1])\n", "import sys\nn = int(sys.stdin.readline())\nrows = []\ncounts = []#\nfor i in range(n):\n rows.append(sys.stdin.readline())\nfor i in range(n):\n counts.append(rows.count(rows[i]))\nprint(max(counts))\n \t \t \t\t\t\t \t\t \t \t\t\t \t \t\t", "n=int(input())\r\nl1=[]\r\nfor i in range(0,n):\r\n s1=input()\r\n l1.append(s1)\r\nprint(l1.count(max(l1,key=l1.count)))", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nii = lambda: int(input())\nsi = lambda: input()\n\nr = [si() for _ in range(ii())]\nprint(max(r.count(i) for i in r))\n", "import sys\r\n# sys.stdin = open(\"309_Div2_ProbB.txt\")\r\nn = int(input())\r\nmap = dict()\r\nmax_value = -sys.maxsize-1\r\nfor i in range(n):\r\n\tarr = input()\r\n\tif arr in map:\r\n\t\tmap[arr]+=1\r\n\telse:\r\n\t\tmap[arr] = 1\r\n\tmax_value = max(max_value,map[arr])\r\nprint(max_value)\r\n\t", "n = int(input())\nd = {}\nfor i in range(n):\n r = input()\n if r in d:\n d[r]+=1\n else:\n d[r]=1\n\nm = 0\nfor c in d: m = max(m, d[c])\nprint(m)\n", "def main():\n n = int(input())\n grid = []\n allones = 0\n for i in range(n):\n grid.append(int(input(), 2))\n allone = True\n for j in range(n):\n if grid[-1] & (1 << j) == 0:\n allone = False\n break\n if allone:\n allones += 1\n ret = 0\n for i in range(n):\n s = set()\n for j in range(n):\n if grid[i] & (1 << j) == 0:\n s.add(j)\n cur = 0\n for i in range(n):\n allone = True\n for j in range(n):\n if j not in s and (grid[i] & (1 << j)) == 0:\n allone = False\n break\n elif j in s and (grid[i] & (1 << j)) != 0:\n allone = False\n break\n if allone:\n cur += 1\n ret = max(ret, cur)\n return max(ret, allones)\n\n\nprint(main())\n\n", "a = [input() for i in range(int(input()))]\r\nprint(max([a.count(s) for s in a]))", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\ng = Counter([input()[:-1] for _ in range(n)])\r\nprint(max(g.values()))", "a=[input() for i in range(int(input()))]\r\nl=[a.count(s) for s in a]\r\nprint(max(l))", "from collections import defaultdict as DD\nn = int(input())\nd = DD(int)\nfor i in range(n):\n\td[input()] += 1\nprint(max(v for k, v in d.items()))\n", "n = int(input())\nroom = []\nc = 0\n\nfor i in range(n):\n room.append(input())\n\ns = set(room)\nans =max(room.count(e) for e in s)\n\nprint(ans)\n", "n = int(input())\nl = [input() for i in range(n)]\nm = 0\nfor i in range(0,len(l)):\n\tmi = 1\n\tfor j in range(i+1,len(l)):\n\t\tif l[i] == l[j]:\n\t\t\tmi += 1\n\tm = max(m,mi)\nprint(m)\n", "n = int(input())\r\ns = [input() for i in range(n)]\r\nse = list(set(s))\r\nma = max(s.count(i) for i in se)\r\nprint(ma)", "from collections import Counter as cnt\r\nl=[]\r\nfor p in range(int(input())):\r\n s=str(input())\r\n l.append(s)\r\nc=cnt(l)\r\nm=float(\"-inf\")\r\nfor i in c:\r\n m=max(m,c[i])\r\nprint(m)", "n = int(input())\n\nd = {}\n\nfor i in range(n):\n\ts = input()\n\tif s in d:\n\t\td[s] += 1\n\telse:\n\t\td[s] = 1\n\nprint(d[max(d,key=d.get)])", "a=int(input())\r\nd={}\r\nfor _ in \" \"*a:\r\n z=input()\r\n t=()\r\n for i in range(a):\r\n if z[i]=='0':t+=(i,)\r\n d[t]=d.get(t,0)+1\r\nprint(max(d.values()))", "n = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n s = input()\r\n if not d.get(s, 0):\r\n d[s] = 1\r\n else:\r\n d[s] += 1\r\nmaxi = 0\r\nfor k in d:\r\n maxi = max(maxi, d[k])\r\nprint(maxi)", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(str(input()))\r\nnewarr = [arr.count(i) for i in arr]\r\nprint(max(newarr))", "#!/usr/bin/env python\n# 554B_clean.py - Codeforces.com 554B Clean quiz\n#\n# Copyright (C) 2015 Sergey\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\n\"\"\"\nReturn the maximum number of rows that she can make completely clean.\n\nInput\n\nThe first line of input will be a single integer n (1<=n<=100).\n\nThe next n lines will describe the state of the room. The i-th\nline will contain a binary string with n characters denoting the\nstate of the i-th row of the room. The j-th character on this line\nis '1' if the j-th square in the i-th column is clean, and '0' if\nit is dirty.\n\nOutput\n\nThe output should be a single line containing an integer equal to\na maximum possible number of rows that are completely clean.\n\"\"\"\n\n# Standard libraries\nimport unittest\nimport sys\nimport re\n\n# Additional libraries\n\n\n###############################################################################\n# Clean Class\n###############################################################################\n\n\nclass Clean:\n \"\"\" Clean representation \"\"\"\n\n def __init__(self, args):\n \"\"\" Default constructor \"\"\"\n\n self.args = args\n self.list = args\n\n def r2dec(self, row):\n \"\"\" Convert row into decimal \"\"\"\n return int(self.list[row], 2)\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n result = 0\n d = {}\n for i in range(len(self.list)):\n key = self.r2dec(i)\n if key in d:\n d[key] += 1\n else:\n d[key] = 1\n for n in d:\n if result < d[n]:\n result = d[n]\n return result\n\n###############################################################################\n# Executable code\n###############################################################################\n\n\ndef decode_inputs(inputs):\n \"\"\" Decoding input string list into base class args list \"\"\"\n\n # Decoding input\n strlist = inputs[1:]\n\n return strlist\n\n\ndef calculate(inputs):\n \"\"\" Base class calculate method wrapper \"\"\"\n return Clean(decode_inputs(inputs)).calculate()\n\n\ndef main():\n \"\"\" Main function. Not called by unit tests \"\"\"\n\n # Read test input string list\n num = int(input())\n inputs = [input() for n in range(num)]\n inputs.insert(0, num)\n\n # Print the result\n print(calculate(inputs))\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_decode_inputs(self):\n \"\"\" Input string decoding testing \"\"\"\n self.assertEqual(\n decode_inputs([\"2\", \"00\", \"10\"]), [\"00\", \"10\"])\n\n def test_Clean_class__basic_functions(self):\n \"\"\" Clean class basic functions testing \"\"\"\n d = Clean([\"00\", \"11\"])\n self.assertEqual(d.list[1], \"11\")\n\n # Convert\n self.assertEqual(d.r2dec(1), 3)\n\n def test_calculate(self):\n \"\"\" Main calculation function \"\"\"\n\n # Sample tests\n self.assertEqual(\n calculate([\"4\", \"0101\", \"1000\", \"1111\", \"0101\"]), 2)\n self.assertEqual(\n calculate([\"3\", \"111\", \"111\", \"111\"]), 3)\n\n\nif __name__ == \"__main__\":\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n main()\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nz = 0\r\nfor i in range(n):\r\n m = 0\r\n for j in a[i:]:\r\n if a[i] == j:\r\n m += 1\r\n if m > z:\r\n z = m\r\nprint(z)\r\n", "# print (\"Enter n\")\nn = int(input())\n\nd = {}\n\nfor i in range(n):\n # print (\"Input the next row\")\n row = input()\n entry = \"\"\n for i in range(n): # Process the row and create the dictionary\n ch = row[i:i+1]\n if (ch == \"0\"):\n entry = entry + str(i)\n d[entry] = d.get(entry, 0) + 1\n\n# The answer is the largest value present\nanswer = 0\nfor k, v in d.items():\n if v > answer:\n answer = v\nprint (answer)\n \n \n \n", "n = int(input())\r\n\r\nmp = {}\r\nfor _ in range(n):\r\n str = input()\r\n if str in mp:\r\n mp[str] += 1\r\n else:\r\n mp[str] = 1\r\n\r\nans = max(mp.values())\r\nprint(ans)", "n = int(input())\ngrid = []\nfor i in range (n):\n grid.append(input())\n\nans = 0\ndef count(clean):\n ret = 0\n for i in range(n):\n if isclean(i, clean):\n ret += 1\n return ret \n \ndef isclean(i, clean):\n for j in range(n):\n if j in clean:\n if grid[i][j] == '1':\n return False\n else:\n if grid[i][j] == '0':\n return False\n return True\n \ndef makeclean(i):\n ret = []\n for j in range (n):\n if grid[i][j] == '0':\n ret.append(j)\n return ret\n\nfor i in range(n):\n ans = max(ans, count(makeclean(i)))\nprint (ans)\n", "n = int(input())\r\nlist = []\r\nmax = 0\r\nfor i in range(n):\r\n list.append(input())\r\nfor i in list:\r\n temp=list.count(i)\r\n if (max<temp):\r\n max=temp\r\n\r\nprint(max)", "from collections import Counter\r\n\r\nn = int(input())\r\nc = Counter(input() for _ in range(n))\r\n\r\nprint(c.most_common()[0][1])\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n tmp = list(map(int, input().split()))\r\n l.append(tmp)\r\nans = 0\r\nfor i in range(n):\r\n cnt = 0\r\n for j in range(n):\r\n if l[i] == l[j]: cnt -= -1\r\n ans = max(ans, cnt)\r\nprint(ans)", "import sys\r\nn = int(input())\r\ns = [x for x in sys.stdin.read().split()]\r\nm = 0\r\nfor a in s:\r\n m = max(m, s.count(a))\r\nprint(m)", "n=int(input())\r\ns=['']*n\r\nfor i in range (0,n):\r\n s[i]=input()\r\n\r\nt=1\r\nfor i in range (0,n):\r\n\r\n if s.count(s[i])>=t:\r\n t=s.count(s[i])\r\nprint(t)", "n = int(input())\r\nlist = []\r\nfor i in range(n):\r\n list.append(input())\r\nx=[list.count(i) for i in list]\r\nprint(max(x))", "n=int(input())\r\na=[input() for i in range(n)]\r\nprint(max(a.count(x) for x in a))", "n = int(input())\r\nmat =[]\r\n\r\nfor i in range(n):\r\n mat.append(input())\r\n\r\n\r\nd={}\r\n\r\nfor i in range(n):\r\n l=\"\"\r\n for j in range(n):\r\n if(mat[i][j]=='0'):\r\n l+=str(j)\r\n \r\n if(l in d):\r\n d[l]+=1\r\n else:\r\n d[l]=1\r\nmaximumRows=0\r\n\r\nfor i in d:\r\n maximumRows = max(maximumRows,d[i])\r\n\r\nprint(maximumRows)\r\n ", "n = int(input())\r\ncnt = {}\r\nfor i in range(n):\r\n line = input()\r\n if line not in cnt:\r\n cnt[line] = 1\r\n else:\r\n cnt[line] += 1\r\nprint(max([cnt[x] for x in cnt]))", "n=int(input())\nd={}\nfor xyz in range(n):\n s=input()\n if s in d.keys():\n d[s]+=1\n else:\n d[s]=1\nprint(max(d.values()))\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\r\nsys.setrecursionlimit(99999)\r\n\r\nn = int(input())\r\nc = collections.defaultdict(int)\r\nfor _ in range(n):\r\n s = input()\r\n c[s] += 1\r\nprint(max(c.values()))", "from collections import Counter\r\nn = int(input())\r\nc = Counter(tuple(tuple(input()) for _ in range(n)))\r\nx = Counter()\r\nfor v in c:\r\n r = tuple(i for i in range(n) if v[i] == '0')\r\n x[r] += c[v]\r\nprint(max(x.values()))\r\n", "from collections import Counter\nprint(Counter(input() for _ in range(int(input()))).most_common(n=1)[0][1])", "n = int(input())\r\n\r\ncolumns = []\r\nrows = []\r\n\r\nfor r in range(n):\r\n row = input()\r\n rows.append(row)\r\n columnsneeded = [i for i in range(n) if list(row)[i] == '0']\r\n columns.append(columnsneeded)\r\n\r\nres = []\r\nfor mvmt in columns:\r\n bigcnt = 0\r\n\r\n for ro in rows:\r\n cnt = 0\r\n\r\n for sweep in mvmt:\r\n if ro[sweep] == '0':\r\n cnt += 1\r\n\r\n elif ro[sweep] == '1':\r\n continue\r\n\r\n for nonsweep in [bruh for bruh in range(n) if bruh not in mvmt]:\r\n if ro[nonsweep] == '1':\r\n cnt += 1\r\n\r\n elif ro[nonsweep] == '0':\r\n continue\r\n\r\n if cnt == n:\r\n bigcnt += 1\r\n\r\n res.append(bigcnt)\r\n\r\n\r\nprint(max(res))\r\n\r\n\r\n", "from collections import Counter\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nd=Counter(l)\r\nprint(max(d.values()))", "import sys \r\ninput = sys.stdin.readline \r\n\r\n\r\nn = int(input())\r\nd = {} \r\nfor i in range(n):\r\n s = input()\r\n if(s not in d):\r\n d[s] = 0 \r\n d[s] += 1 \r\n \r\nans = 0 \r\nfor i in d:\r\n ans = max(ans, d[i])\r\nprint(ans)", "n = int(input())\ngrid = []\ncn = [1 for i in range(n)]\nfor i in range(n):\n row = input()\n if row in grid:\n cn[i] = grid.count(row) + 1\n grid.append(row)\nprint(max(cn))\n\n \t\t \t \t \t\t \t\t\t\t \t \t \t \t\t\t\t\t", "n = int(input())\r\nbig = [[] for i in range(n)]\r\nfor i in range(n):\r\n big[i] = [int(x) for x in list(input())]\r\nmx = 0\r\ncr = 0\r\nfor item in big:\r\n cr = big.count(item)\r\n mx = max([cr,mx])\r\nprint(mx)", "n = int(input())\r\na = []\r\nfor i in range (n):\r\n a.append(list(input()))\r\nans = 0\r\nfor i in range (n):\r\n tmp = 1\r\n for j in range(i+1,n):\r\n if (a[i] == a[j]):\r\n tmp += 1\r\n ans = max(ans,tmp)\r\nprint(ans)", "from collections import Counter as c\r\na=c(input()for i in range(int(input())))\r\nb,d=a.most_common(1)[0]\r\nprint(d)", "def most_common(a):\r\n return max(set(a), key=a.count)\r\nn=int(input())\r\nimport sys\r\na=sys.stdin.readlines()\r\nprint(a.count(most_common(a)))", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nimport sys\nr = [sys.stdin.readline() for _ in range(int(input()))]\nprint(max(r.count(i) for i in r))\n\n\n\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint\r\n\r\nss = {}\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n if s in ss:\r\n ss[s] += 1\r\n else:\r\n ss[s] = 1\r\nmx = 0\r\nfor i in ss:\r\n mx = max(mx, ss[i])\r\nprint(mx)\r\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn = I()\r\ngrid = [input() for i in range(n)]\r\nprint(max([grid.count(i) for i in set(grid)]))", "from collections import Counter\r\n\r\nn = int(input())\r\nli = list()\r\nfor i in range(n):\r\n li.append(input())\r\nc = Counter(li).most_common(1)\r\nfor k, v in c:\r\n print(v)", "n = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n a = input()\r\n if a not in d:\r\n d[a] = 1\r\n else:\r\n d[a] += 1\r\nm = 0\r\nfor elem in d:\r\n m = max(m, d[elem])\r\nprint(m)", "import string\r\n\r\ndic = {}\r\nalgo = int(input())\r\n\r\nwhile algo > 0:\r\n\tline = input()\r\n\tif line in dic:\r\n\t\tdic[line] += 1\r\n\telse:\r\n\t\tdic[line] = 1\r\n\talgo -= 1\r\n\r\nmax = 0\r\nfor key in dic:\r\n\tif dic[key] > max:\r\n\t\tmax = dic[key]\r\n\r\nprint(max)\r\n", "n=int(input())\r\nl=[]\r\ncou=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in set(l):\r\n cou.append(l.count(i))\r\nprint(max(cou))\r\n \r\n ", "I=input\r\ns=[I()for _ in '0'*int(I())]\r\nprint(max(s.count(i)for i in s))", "from sys import stdin , stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn=int(input()) ; dic={} ; ans=0\r\nfor i in range(n):\r\n stri=input().strip()\r\n clo=[]\r\n for j in range(n):\r\n if stri[j]==\"0\":\r\n clo.append(j+1)\r\n if len(clo)==0:\r\n ans+=1\r\n else:\r\n clo=tuple(clo)\r\n if clo in dic.keys():\r\n dic[clo]+=1\r\n else:\r\n dic[clo]=1\r\n\r\nfor i in dic.keys():\r\n ans=max(ans,dic[i])\r\nprint(ans)", "#!/usr/bin/env python3\n\nroom = [input() for _ in range(int(input()))]\nprint(max(room.count(el) for el in room))\n", "n = int(input())\narows = []\nfor i in range(n):\n arows.append([] * n)\n\nfor i in range(n):\n s = input()\n for k in range(n):\n arows[i].append(int(s[k]))\n\n\nequalmax = 1\nclean = 0\nfor i in range(n):\n if arows[i] == [1, 1, 1, 1]:\n clean += 1\n\n equal = 1\n for j in range(i + 1, n):\n if arows[i] == arows[j]:\n equal += 1\n if equal > equalmax:\n equalmax = equal\n\nprint(max(clean, equalmax))", "s = [input() for i in range(int(input()))]\r\nprint(max(s.count(i) for i in list(set(s))))\r\n", "n=int(input())\r\nl=[]\r\nres=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n res.append(l.count(l[i]))\r\nprint(max(res))", "n=int(input())\r\nroom=[]\r\nlocations=[]\r\nbegin=0\r\nends=[]\r\nfor i in range(n):\r\n row=[int(x) for x in input()]\r\n location=[]\r\n for j in range(n):\r\n if row[j]==0:\r\n location.append(j)\r\n if location==[]:\r\n begin+=1\r\n locations.append(location)\r\nfor i in locations:\r\n end=0\r\n for j in locations:\r\n if j==i:\r\n end+=1\r\n ends.append(end)\r\nprint(max(begin,max(ends)))\r\n", "def main():\n n = int(input())\n grid = [input() for _ in range(n)]\n\n row_map = {}\n max_frequency = 0\n for row in grid:\n if row in row_map:\n row_map[row] += 1\n else:\n row_map[row] = 1\n\n max_frequency = max(max_frequency, row_map[row])\n\n print(max_frequency)\n\n\nif __name__ == '__main__':\n main()", "n=int(input())\r\nl=[]\r\nx=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n x.append(l.count(l[i]))\r\nprint(max(x)) \r\n \r\n ", "n=int(input())\r\nd={}\r\nfor _ in range(n):\r\n temp=input()\r\n if temp in d:\r\n d[temp]+=1\r\n else:\r\n d[temp]=1\r\nans=0\r\nfor i in d:\r\n ans=max(ans,d[i])\r\nprint(ans)", "n = int(input())\r\nx = []\r\nfor i in range(n):\r\n x.append(str(input()))\r\ny = list(set(x))\r\nans = []\r\nfor i in range(len(y)):\r\n ans.append(x.count(y[i]))\r\nprint(max(ans))", "n = int(input())\r\nstr = [[0]*110]*110\r\nfor i in range (n):\r\n str[i] = input()\r\nans = 0\r\nfor i in range (n):\r\n sum = 0\r\n for j in range (n) :\r\n if str[i] == str[j]:\r\n sum += 1\r\n ans = max(sum, ans)\r\nprint(ans)\r\n", "n = int(input())\r\nb = [tuple(map(int, tuple(input()))) for x in range(n)]\r\n# d={b.count(x) for x in b}\r\nd = set()\r\nfor x in b:\r\n a = b.count(x)\r\n d.add(a)\r\n if a > 2:\r\n while True:\r\n try:\r\n b.remove(x)\r\n except ValueError:\r\n break\r\n\r\nprint(max(d))\r\n", "def main():\r\n n = int(input())\r\n cnt = {}\r\n for _ in range(n):\r\n s = input()\r\n if s not in cnt:\r\n cnt[s] = 0\r\n cnt[s] += 1\r\n print(max(cnt.values()))\r\nmain()\r\n", "n = int(input())\r\nc = []\r\nfor i in range(n):\r\n c.append(input())\r\nmax_count = 0\r\nfor i in range(n):\r\n count = 0\r\n for j in range(n):\r\n if c[i] == c[j]:\r\n count += 1\r\n if count > max_count:\r\n max_count = count\r\nprint(max_count)\r\n \r\n \r\n", "#!/usr/bin/env python3\n\nn = int(input())\n\nrows = []\n\nfor i in range(n):\n\trow = input()\n\trows += [row]\n\n\ndef sweepColumn(rows, i):\n\tdef sweep(row):\n\t\treturn row[0:i] + ('1' if row[i] == '0' else '0') + row[i+1:]\n\treturn [sweep(row) for row in rows]\n\ndef sweepColumns(rows, idxs):\n\tif len(idxs) == 0: return rows\n\treturn sweepColumns(sweepColumn(rows, idxs[0]), idxs[1:])\n\ndef numCleanRows(rows):\n\treturn len(list(row for row in rows if '1' not in row))\n\ndef dirtyIdxs(row):\n\treturn list(i for i, e in enumerate(row) if e == '1')\n\nprint(max(numCleanRows(sweepColumns(rows, dirtyIdxs(row))) for row in rows))", "n = int(input())\r\n\r\narr = []\r\nfor _ in range(n):\r\n arr.append(str(input()))\r\n\r\n\r\nmaxx = 1\r\nfor i in range(n):\r\n x = 0\r\n for j in range(n):\r\n if arr[i] == arr[j]:\r\n x+=1\r\n maxx = max(maxx, x)\r\n\r\nprint(maxx)", "n,d=int(input()),dict()\nfor i in range(n):\n s=input()\n if s in d: d[s]+=1\n else: d[s]=1\nprint(max(d[i] for i in d))\n", "n=int(input())\r\nk=0\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\n\r\nfor i in l:\r\n k=max(l.count(i),k)\r\n l.remove(i)\r\nprint(k)\r\n", "n = int(input())\nmax_count = 1\ncounts = {}\nfor i in range(n):\n s = input().strip()\n counts[s] = counts.setdefault(s, 0) + 1\n max_count = max(max_count, counts[s])\nprint(max_count)\n", "n=int(input())\r\ndic={}\r\nfor _ in range(n):\r\n s=input()\r\n if s in dic:\r\n dic[s]+=1\r\n else:\r\n dic[s]=1\r\nprint(max(dic.values()))", "A = [input() for i in range(int(input()))]\nprint(max([A.count(elem) for elem in A]))", "import sys\r\n\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n data = list(sys.stdin.readlines())\r\n arr = []\r\n for x in data:\r\n arr.append(int(x, 2))\r\n\r\n m = 1\r\n for i in range(n):\r\n count = 0\r\n for j in range(n):\r\n if (arr[i] ^ arr[j]) == 0:\r\n count += 1\r\n if count > m:\r\n m = count\r\n print(m)\r\n\r\n\r\nmain()\r\n" ]

[ "'''\r\nHala Madrid!\r\nhttps://www.zhihu.com/people/li-dong-hao-78-74\r\n'''\r\n\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\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\n\r\ndef I():\r\n return input()\r\ndef II():\r\n return int(input())\r\ndef MI():\r\n return map(int, input().split())\r\ndef LI():\r\n return list(input().split())\r\ndef LII():\r\n return list(map(int, input().split()))\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n#------------------------------FastIO---------------------------------\r\n\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom collections import *\r\nfrom functools import *\r\nfrom itertools import *\r\nfrom time import *\r\nfrom random import *\r\nfrom math import log, gcd, sqrt, ceil\r\n\r\n'''\r\n手写栈防止recursion limit\r\n注意要用yield 不要用return\r\n'''\r\nfrom types import GeneratorType\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n'''\r\nmax(***), mp可能为空 -> error\r\n'''\r\n\r\nclass Prime:\r\n def prime_sieve(self, 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 def prime_list(self, 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 = self.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\n def __init__(self, n) -> None:\r\n self.primes = self.prime_list(n)\r\n \r\n def dissolve(self, num):\r\n '''prime factor decomposition of num'''\r\n lst = []\r\n idx = -1\r\n for prime in self.primes:\r\n if prime > num:\r\n break\r\n\r\n if num % prime == 0:\r\n lst.append([prime, 0])\r\n idx += 1\r\n \r\n while num % prime == 0:\r\n lst[idx][1] += 1\r\n num //= prime\r\n \r\n if num != 1:\r\n lst.append([num, 1])\r\n \r\n return lst\r\n \r\n #求很大的数值的单点的phi用，连续区间还是用其他的方法#\r\n def get_phi(self, num):\r\n res = num\r\n for a, b in self.dissolve(num):\r\n res -= res // a\r\n return res \r\n\r\npri = Prime(10 ** 5 + 10)\r\n\r\n#a ^ b % mod#\r\ndef qp(a, b, mod):\r\n flag = False\r\n res = 1\r\n while b:\r\n if b & 1:\r\n res *= a\r\n if res >= mod:\r\n flag = True\r\n res %= mod\r\n a *= a\r\n if a >= mod:\r\n flag = True\r\n a %= mod\r\n b >>= 1\r\n return flag, res\r\n\r\ndef solve():\r\n n, m = MI()\r\n phis = [m]\r\n while m != 1:\r\n m = pri.get_phi(m)\r\n phis.append(m)\r\n #print(phis)\r\n k = len(phis)\r\n\r\n w = LII()\r\n q = II()\r\n for _ in range(q):\r\n l, r = MI()\r\n l -= 1\r\n r -= 1\r\n\r\n r = min(r, l - 1 + k)\r\n #print('lr', l, r)\r\n res = 1\r\n for i in range(r, l - 1, -1):\r\n flag, res = qp(w[i], res, phis[i - l])\r\n #print('res', w[i], res, phis[i - l])\r\n if flag:\r\n res += phis[i - l]\r\n\r\n #print(res, m)\r\n print(res % phis[0])\r\n #print('------')\r\n\r\nfor _ in range(1):solve()" ]

[ "# optimal answer must be to choose the diameter then remove leaves not on\r\n# the diameter then remove the diameter\r\n# for every leaf removed, the answer is maximal since otherwise we did not choose\r\n# the diameter. When removing the diameter, clearly the maximal answer is\r\n# # nodes left - 1 and this is achieved everytime\r\nimport sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\n\r\nadj =[[] for i in range(n+1)]\r\n\r\nfor i in range(n-1):\r\n a,b = map(int,input().split())\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\ndist1 = [0]*(n+1)\r\ndist2 = [0]*(n+1)\r\ndiameter = []\r\non_diameter = [0]*(n+1)\r\n\r\ns = [1]\r\npath = []\r\nvis = [0]*(n+1)\r\nwhile s:\r\n c = s[-1]\r\n\r\n if not vis[c]:\r\n vis[c] = 1\r\n path.append(c)\r\n dist1[c] = len(path)-1\r\n\r\n for ne in adj[c]:\r\n if not vis[ne]:\r\n s.append(ne)\r\n\r\n else:\r\n path.pop()\r\n s.pop()\r\n\r\nmx_dist = 0\r\nendpoint1 = 0\r\nfor i in range(1,n+1):\r\n if dist1[i] > mx_dist:\r\n mx_dist = dist1[i]\r\n endpoint1 = i\r\n\r\ns = [endpoint1]\r\npath = []\r\nvis = [0] * (n + 1)\r\nwhile s:\r\n c = s[-1]\r\n\r\n if not vis[c]:\r\n vis[c] = 1\r\n path.append(c)\r\n dist1[c] = len(path) - 1\r\n\r\n for ne in adj[c]:\r\n if not vis[ne]:\r\n s.append(ne)\r\n\r\n else:\r\n path.pop()\r\n s.pop()\r\n\r\nmx_dist = 0\r\nendpoint2 = 0\r\nfor i in range(1, n + 1):\r\n if dist1[i] > mx_dist:\r\n mx_dist = dist1[i]\r\n endpoint2 = i\r\n\r\ns = [endpoint2]\r\npath = []\r\nvis = [0] * (n + 1)\r\nwhile s:\r\n c = s[-1]\r\n\r\n if not vis[c]:\r\n vis[c] = 1\r\n path.append(c)\r\n\r\n if c == endpoint1:\r\n diameter = path.copy()\r\n\r\n dist2[c] = len(path) - 1\r\n\r\n for ne in adj[c]:\r\n if not vis[ne]:\r\n s.append(ne)\r\n\r\n else:\r\n path.pop()\r\n s.pop()\r\n\r\nfor i in diameter:\r\n on_diameter[i] = 1\r\n\r\n\r\nmx_answer = 0\r\noperations = []\r\n\r\nleaves = []\r\nfor i in range(1,n+1):\r\n if len(adj[i]) == 1 and not on_diameter[i]:\r\n leaves.append(i)\r\n\r\ndegree = [len(adj[i]) for i in range(n+1)]\r\n\r\nwhile leaves:\r\n c = leaves.pop()\r\n\r\n if dist1[c] > dist2[c]:\r\n mx_answer += dist1[c]\r\n operations.append([endpoint1,c,c])\r\n else:\r\n mx_answer += dist2[c]\r\n operations.append([endpoint2,c,c])\r\n\r\n for ne in adj[c]:\r\n degree[ne] -= 1\r\n if degree[ne] == 1:\r\n leaves.append(ne)\r\n\r\nwhile len(diameter) > 1:\r\n c = diameter.pop()\r\n\r\n mx_answer += dist2[c]\r\n operations.append([endpoint2,c,c])\r\n\r\n\r\nprint(mx_answer)\r\nfor operation in operations:\r\n print(*operation)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\nclass RangeQuery:\r\n def __init__(self, data, func=min):\r\n self.func = func\r\n self._data = _data = [list(data)]\r\n i, n = 1, len(_data[0])\r\n while 2 * i <= n:\r\n prev = _data[-1]\r\n _data.append([func(prev[j], prev[j + i]) for j in range(n - 2 * i + 1)])\r\n i <<= 1\r\n\r\n def query(self, begin, end):\r\n depth = (end - begin).bit_length() - 1\r\n return self.func(self._data[depth][begin], self._data[depth][end - (1 << depth)])\r\n\r\n\r\nclass LCA:\r\n def __init__(self, root, graph):\r\n self.time = [-1] * len(graph)\r\n self.path = [-1] * len(graph)\r\n P = [-1] * len(graph)\r\n t = -1\r\n dfs = [root]\r\n while dfs:\r\n node = dfs.pop()\r\n self.path[t] = P[node]\r\n self.time[node] = t = t + 1\r\n for nei in graph[node]:\r\n if self.time[nei] == -1:\r\n P[nei] = node\r\n dfs.append(nei)\r\n self.rmq = RangeQuery(self.time[node] for node in self.path)\r\n\r\n def __call__(self, a, b):\r\n if a == b:\r\n return a\r\n a = self.time[a]\r\n b = self.time[b]\r\n if a > b:\r\n a, b = b, a\r\n return self.path[self.rmq.query(a, b)]\r\n \r\n \r\ndef bfs(n, root, g):\r\n height = [None for i in range(n+1)]\r\n start = [root]\r\n height[root] = 0\r\n while len(start) > 0:\r\n farthest = start[0]\r\n next_s = []\r\n for x in start:\r\n for y in g[x]:\r\n if height[y] is None:\r\n height[y] = height[x]+1\r\n next_s.append(y)\r\n start = next_s\r\n return height, farthest\r\n\r\ndef process(n, G):\r\n g = [[] for i in range(n+1)]\r\n for u, v in G:\r\n g[u].append(v)\r\n g[v].append(u)\r\n height1, farthest1 = bfs(n, 1, g)\r\n height2, farthest2 = bfs(n, farthest1, g)\r\n diam = height2[farthest2]\r\n L = LCA(root=farthest1, graph=g)\r\n answer1 = 0\r\n answer2 = []\r\n answer3 = []\r\n for i in range(1, n+1):\r\n x = L(i, farthest2)\r\n if x != i:\r\n h1 = height2[x]\r\n h2 = height2[i]\r\n answer1+=(h2-h1+max(diam-h1, h1))\r\n if h1 > diam-h1:\r\n answer2.append([i, farthest1, i])\r\n else:\r\n answer2.append([i, farthest2, i])\r\n else:\r\n answer1+=height2[i]\r\n if i != farthest1:\r\n answer3.append([i, farthest1, i])\r\n answer2 = sorted(answer2, key=lambda a: height2[a[0]], reverse=True)\r\n answer3 = sorted(answer3, key=lambda a: height2[a[0]], reverse=True)\r\n sys.stdout.write(f'{answer1}\\n')\r\n for a, b, c in answer2:\r\n sys.stdout.write(f'{a} {b} {c}\\n')\r\n for a, b, c in answer3:\r\n sys.stdout.write(f'{a} {b} {c}\\n')\r\n\r\nn = int(input())\r\nG = []\r\nfor i in range(n-1):\r\n u, v = [int(x) for x in input().split()]\r\n G.append([u, v])\r\nprocess(n, G) \r\n ", "from sys import stdin\ninput = lambda: stdin.readline()[:-1]\n\nn = int(input())\narestas = [[] for _ in range(n)]\ncontagem = [0] * n\n\nfor _ in range(n - 1):\n a, b = map(lambda x: int(x) - 1, input().split())\n arestas[a].append(b)\n arestas[b].append(a)\n contagem[a] += 1\n contagem[b] += 1\n\ndef dfs(raiz):\n distancia = [-1] * n\n distancia[raiz] = 0\n pai = [-1] * n\n para_fazer = [(raiz, -1)]\n\n while para_fazer:\n v, p = para_fazer.pop()\n for u in arestas[v]:\n if u != p:\n distancia[u] = distancia[v] + 1\n pai[u] = v\n para_fazer.append((u, v))\n\n mx = max(distancia)\n v = distancia.index(mx)\n return v, distancia, pai\n\nv0, _, _ = dfs(0)\nv1, dist0, par0 = dfs(v0)\n_, dist1, _ = dfs(v1)\n\npara_fazer = []\nfor i in range(n):\n if contagem[i] == 1 and i != v0 and i != v1:\n para_fazer.append(i)\n\nresposta = 0\nresposta_lista = []\n\nwhile para_fazer:\n v = para_fazer.pop()\n d0 = dist0[v]\n d1 = dist1[v]\n \n if d0 >= d1:\n resposta_lista.append((v, v0, v))\n resposta += d0\n else:\n resposta_lista.append((v, v1, v))\n resposta += d1\n \n for u in arestas[v]:\n contagem[u] -= 1\n if contagem[u] == 1:\n para_fazer.append(u)\n\ndiametro = []\ntmp = v1\n\nwhile True:\n diametro.append(tmp)\n if tmp == v0:\n break\n tmp = par0[tmp]\n\ndiametro.reverse()\n\nwhile len(diametro) >= 2:\n v = diametro.pop()\n resposta += dist0[v]\n resposta_lista.append((v, v0, v))\n\nprint(resposta)\n\nfor x, y, z in resposta_lista:\n print(x + 1, y + 1, z + 1)\n\n\t \t\t \t\t\t \t \t\t \t\t \t \t\t\t \t \t", "import sys\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\nadj = [[] for _ in range(n)]\r\ndeg = [0]*n\r\nfor u, v in (map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n adj[u-1].append(v-1)\r\n adj[v-1].append(u-1)\r\n deg[u-1] += 1\r\n deg[v-1] += 1\r\n\r\n\r\ndef get_dia(adj):\r\n from collections import deque\r\n n = len(adj)\r\n dq = deque([(0, -1)])\r\n\r\n while dq:\r\n end1, par = dq.popleft()\r\n for dest in adj[end1]:\r\n if dest != par:\r\n dq.append((dest, end1))\r\n\r\n prev = [-1]*n\r\n prev[end1] = -2\r\n dq = deque([(end1, 0)])\r\n\r\n while dq:\r\n end2, diameter = dq.popleft()\r\n for dest in adj[end2]:\r\n if prev[dest] == -1:\r\n prev[dest] = end2\r\n dq.append((dest, diameter+1))\r\n\r\n return end1, end2, diameter, prev\r\n\r\n\r\ndef get_dist(st, dist):\r\n dist[st] = 0\r\n stack = [st]\r\n while stack:\r\n v = stack.pop()\r\n for dest in adj[v]:\r\n if dist[dest] != -1:\r\n continue\r\n dist[dest] = dist[v] + 1\r\n stack.append(dest)\r\n\r\n\r\nend1, end2, _, prev = get_dia(adj)\r\ndia_path = [0]*n\r\n\r\nx = end2\r\nwhile x != end1:\r\n dia_path[x] = 1\r\n x = prev[x]\r\ndia_path[x] = 1\r\n\r\ndist1, dist2 = [-1]*n, [-1]*n\r\nget_dist(end1, dist1)\r\nget_dist(end2, dist2)\r\nans = []\r\nscore = 0\r\nstack = [i for i in range(n) if deg[i] == 1 and dia_path[i] == 0]\r\n\r\nwhile stack:\r\n v = stack.pop()\r\n deg[v] = 0\r\n if dist1[v] > dist2[v]:\r\n score += dist1[v]\r\n ans.append(f'{end1+1} {v+1} {v+1}')\r\n else:\r\n score += dist2[v]\r\n ans.append(f'{end2+1} {v+1} {v+1}')\r\n for dest in adj[v]:\r\n if dia_path[dest] == 0 and deg[dest] > 0:\r\n deg[dest] -= 1\r\n if deg[dest] <= 1:\r\n stack.append(dest)\r\n\r\nx = end2\r\nwhile x != end1:\r\n score += dist1[x]\r\n ans.append(f'{end1+1} {x+1} {x+1}')\r\n x = prev[x]\r\n\r\nsys.stdout.buffer.write(\r\n (str(score) + '\\n' + '\\n'.join(ans)).encode('utf-8')\r\n)\r\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(s):\r\n q = deque()\r\n q.append(s)\r\n dist = [-1] * (n + 1)\r\n dist[s] = 0\r\n while q:\r\n i = q.popleft()\r\n di = dist[i]\r\n for j in G[i]:\r\n if dist[j] == -1:\r\n dist[j] = di + 1\r\n q.append(j)\r\n return dist\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n G[a].append(b)\r\n G[b].append(a)\r\ndist = bfs(1)\r\nx = dist.index(max(dist))\r\ndist1 = bfs(x)\r\ny = dist1.index(max(dist1))\r\ndist2 = bfs(y)\r\ne = [len(G[i]) for i in range(n + 1)]\r\ns = set([x, y])\r\nq = deque()\r\nfor i in range(1, n + 1):\r\n if e[i] == 1 and not i in s:\r\n q.append(i)\r\nm = 0\r\nans = []\r\nwhile q:\r\n i = q.popleft()\r\n if dist1[i] >= dist2[i]:\r\n ans.append((i, x, i))\r\n m += dist1[i]\r\n else:\r\n ans.append((i, y, i))\r\n m += dist2[i]\r\n for j in G[i]:\r\n e[j] -= 1\r\n if e[j] == 1:\r\n q.append(j)\r\nwhile x ^ y:\r\n ans.append((x, y, y))\r\n m += dist1[y]\r\n dy = dist1[y]\r\n for z in G[y]:\r\n if dist1[z] < dy:\r\n y = z\r\n break\r\nprint(m)\r\nfor a, b, c in ans:\r\n print(a, b, c)" ]

[ "import re\r\n\r\nline=input()\r\n\r\nline = line.rstrip('.')\r\na, b, c = line.partition(\"):-\")\r\nrels = c.split(',')\r\n\r\nrelations = set()\r\nfor rel in rels:\r\n if \"<\" in rel:\r\n x, _, y = rel.partition(\"<\")\r\n relations.add((len(x), len(y)))\r\n else:\r\n x, _, y = rel.partition(\">\")\r\n relations.add((len(y), len(x)))\r\n\r\na = a.lstrip(\"?(\")\r\nargs = re.split(r\"(\\+|-|\\*|/)\", a)\r\nargs = [len(args[i]) for i in range(0, len(args), 2)]\r\n\r\n\r\n# print(args)\r\n# print(relations)\r\n\r\nedges = {k:[] for k in args}\r\nfor j, i in relations:\r\n edges[i].append(j)\r\n\r\nseen = {k:0 for k in args}\r\n\r\nq = []\r\n\r\ndef topsort(k):\r\n if seen[k] == 1:\r\n print(\"false\")\r\n quit()\r\n seen[k] = 1\r\n for other in edges[k]:\r\n topsort(other)\r\n q.append(k)\r\n seen[k] = 2\r\n return True\r\n\r\nfor k in args:\r\n if seen[k] == 0:\r\n topsort(k)\r\n\r\nvals = {}\r\n\r\nfor k in q:\r\n others = edges[k]\r\n maxval = -1\r\n for other in others:\r\n maxval = max(maxval, vals.get(other, -1))\r\n vals[k] = maxval+1\r\n if(vals[k]>9):\r\n print(\"false\")\r\n quit()\r\n\r\nfor k in args:\r\n print(vals[k], end='')\r\n\r\nprint()" ]

[ "import math\r\nm, d = map(int, input().split())\r\na = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nprint(math.ceil((a[m-1]+d-1)/7))\r\n", "months = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nmonth, weekday = map(int, input().split())\nprint((months[month] + weekday - 1 + 6) // 7)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jan 26 19:21:47 2017\r\n\r\n@author: USER PC\r\n\"\"\"\r\n\r\nm,d=input().split(\" \")\r\nm,d=int(m),int(d)\r\nmonth=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nweek=1\r\ni=0\r\nwhile i<month[m]:\r\n d+=1\r\n if(d>7 and i<month[m]-1):\r\n d=1\r\n week+=1\r\n i+=1\r\nprint(week)", "a,b=map(int,input().split())\nx=1\nif a==1 or a==3 or a==5 or a==7 or a==8 or a==10 or a==12:\n\tm=31-(abs(b-8))\n\tif m%7>=1:\n\t\tprint(x+m//7+1)\n\telse:\n\t\tprint(x+m//7)\nif a==4 or a==6 or a==9 or a==11:\n\tm=30-(abs(b-8))\n\tif m%7>=1:\n\t\tprint(x+m//7+1)\n\telse:\n\t\tprint(x+m//7)\nif a==2:\n\tm=28-(abs(b-8))\n\tif m%7>=1:\n\t\tprint(x+m//7+1)\n\telse:\n\t\tprint(x+m//7)\n", "a=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\nk=a[m-1]\r\nk+=d-1\r\nif k%7==0:\r\n print(k//7)\r\nelse:\r\n print(k//7+1)\r\n", "def main():\r\n\tm, d = map(int, input().split())\r\n\ta = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\tnum = a[m - 1]\r\n\tans = 1\r\n\tnum -= (8 - d)\r\n\tans += ((num + 7 - 1) // 7)\r\n\tprint(ans)\r\n\r\nmain()", "days = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nmonth, day = input().split()\nmonth = int(month)\nday = int(day)\ncolumns = days[month-1] - (7 - day + 1)\nresult = 0\nif (columns % 7 != 0):\n\tresult += 1\nresult += columns // 7 + 1\nprint(result)", "X = list(map(int , input().split()))\r\nif X[0] in [1,3,5,7,8,10,12]:\r\n print(5 if X[1]<=5 else 6)\r\n exit()\r\nif X[0] in [11,9,6,4]:\r\n print(5 if X[1]<=6 else 6)\r\n exit()\r\nprint(4 if X[1]==1 else 5)\r\n", "# https://codeforces.com/problemset/problem/760/A\r\nimport math\r\ninp_ = input()\r\nm, d = map(int, inp_.split(\" \"))\r\n\r\ndic = {31: [1, 3, 5, 7, 8, 10, 12],\r\n 30: [4, 6, 9, 11],\r\n 28: [2]}\r\ndays = [key for key,\r\n list_of_values in dic.items()\r\n if m in list_of_values][0]\r\ncolumns = math.ceil((days-(8-d))/7)+1\r\nprint(columns)\r\n", "a,b=map(int,input().split())\r\nc=[1,3,5,7,8,10,12]\r\nd=[4,6,9,11]\r\ne=[2]\r\n\r\nif a in c and b<=5:\r\n print(5)\r\nelif a in c and b>5:\r\n print(6)\r\nelif a in d and b>6:\r\n print(6)\r\nelif a in d and b<=6:\r\n print(5)\r\nelif a in e and b>=2:\r\n print(5)\r\nelif a in e and b==1:\r\n print(4)", "def check_month(day, month):\r\n return sum(months[:month]) <= day < sum(months[:month + 1])\r\n\r\nA = [0] * 365\r\nmonths = [31, \t28, \t31, \t30, \t31, \t30, \t31, \t31, \t30, \t31, \t30, \t31]\r\nfor i in range(365):\r\n A[i] = i % 7\r\nm, d = map(int, input().split())\r\nm -= 1\r\nfirst_day = 0\r\nwhile not check_month(first_day, m):\r\n first_day += 1\r\ndiff = d - A[first_day]\r\nfor i in range(365):\r\n A[i] += diff\r\n A[i] %= 7\r\nsundays = 0\r\nfor i in range(365):\r\n if check_month(i, m):\r\n if A[i] == 0:\r\n sundays += 1\r\nwhile check_month(first_day, m):\r\n first_day += 1\r\nfirst_day -= 1\r\nif A[first_day] != 0:\r\n sundays += 1\r\nprint(sundays)", "n,d=map(int,input().split())\no=0\nif n in [1,3,5,7,8,10,12]:\n if d==7 or d==6:\n o=6\n else:\n o=5\nif n in [4,6,9,11]:\n if d==7:\n o=6\n else:\n o=5\nif n==2:\n if d==1:\n o=4\n else:\n o=5\nprint(o)\n\t \t \t\t\t\t \t \t \t \t\t \t\t \t\t", "m, d = tuple(map(int, input().split()))\n\ndays = -1\n\nif m in [1,3,5,7,8,10,12]:\n days = 31\nelif m == 2:\n days = 28\nelse:\n days = 30\n\nres = days + (d-1)\nif res % 7 == 0:\n print(res//7)\nelse:\n print(res//7 + 1)\n", "m,d=map(int,input().split())\r\nx={1:31 , 2:28 , 3:31 , 4:30 , 5:31 , 6:30 ,7:31 , 8:31 , 9:30 ,10:31 , 11:30 , 12:31}\r\nans=1+(x[m]-(8-d))//7 \r\nif (x[m]-(8-d))%7!=0 : ans+=1\r\nprint(ans)", "a=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\nprint(1--(a[m-1]+d-8)//7)", "m, d = map(int, input().split())\r\nl = [5, 1, 5, 6, 5, 6, 5, 5, 6, 5, 6, 5]\r\n\r\nif d > l[m - 1]:\r\n\tif m == 2:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(6)\r\nelse:\r\n\tif m == 2:\r\n\t\tprint(4)\r\n\telse:\r\n\t\tprint(5)", "import math\r\nm,d=map(int,input().split())\r\nl=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nx=(l[m-1]-(8-d))/7.0\r\nprint(1+math.ceil(x))\r\n", "m, d = map(int, input().split())\n\nif m == 2 and d == 1:\n print(4)\nelif 8 - d < [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][m - 1] % 7:\n print(6)\nelse:\n print(5)\n\n", "from math import ceil\r\nn,m=map(int,input().split())\r\nif n in {1,3,5,7,8,10,12}:\r\n days=31\r\n c=1\r\n days-=8-m\r\n c+=ceil(days/7)\r\nelif n in {4,6,9,11}:\r\n days=30\r\n c=1\r\n days-=8-m\r\n c+=ceil(days/7)\r\nelse :\r\n days=28\r\n c=1\r\n days-=8-m\r\n c+=ceil(days/7)\r\nprint(c)", "import math\nmonthsLength = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\ni = input().split(' ')\na = [int(x) for x in i]\nmonth, weekday = a[0], a[1]\nprint(math.ceil((monthsLength[month - 1] + weekday - 1) / 7))\n\n", "import sys\r\nr=lambda:sys.stdin.readline().strip()\r\nwr=lambda x:sys.stdout.write(str(x)+\"\\n\")\r\ntable = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = map(int, r().split())\r\ndays = table[m-1]\r\nq, r = days // 7, days % 7\r\nif r == 0:\r\n if d == 1:\r\n wr(4)\r\n else:\r\n wr(5)\r\nelif r == 2:\r\n if d <= 6:\r\n wr(5)\r\n else:\r\n wr(6)\r\nelif r == 3:\r\n if d <= 5:\r\n wr(5)\r\n else:\r\n wr(6)", "m,d=[int(x) for x in input().split()]\r\nif d==7:\r\n if m==2:\r\n print(5) \r\n else:\r\n print(6)\r\nelif d==6:\r\n if m in (1,3,5,7,8,10,12):\r\n print(6)\r\n else:\r\n print(5)\r\nelif d==1:\r\n if m==2:\r\n print(4)\r\n else:\r\n print(5)\r\nelse:\r\n print(5)", "m,d=list(map(int,input().split()))\nif(m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12):\n if(d>=6):\n print(6)\n else:\n print(5)\nelif(m==2):\n if(d==1):\n print(4)\n else:\n print(5)\nelse:\n if(d>=7):\n print(6)\n else:\n print(5)\n \n \n\n \n \n\n \n ", "from math import *\r\nm,d=map(int,input().split())\r\nif m==2:\r\n print(1+ceil((d+28-8)/7))\r\nelif m in [1,3,5,7,8,10,12]:\r\n print(1+ceil((d+31-8)/7))\r\nelse:\r\n print(1+ceil((d+30-8)/7))\r\n \r\n", "a,b=map(int,input().split())\nc=[1,3,5,7,8,10,12]\nd=[4,6,9,11]\ne=[2]\n\nif a in c and b<=5:\n print(5)\nelif a in c and b>5:\n print(6)\nelif a in d and b>6:\n print(6)\nelif a in d and b<=6:\n print(5)\nelif a in e and b>=2:\n print(5)\nelif a in e and b==1:\n print(4)", "from math import ceil\r\n\r\n\r\ndef numberOfDays(y, m):\r\n leap = 0\r\n if y% 400 == 0:\r\n leap = 1\r\n elif y % 100 == 0:\r\n leap = 0\r\n elif y% 4 == 0:\r\n leap = 1\r\n if m==2:\r\n return 28 + leap\r\n list = [1,3,5,7,8,10,12]\r\n if m in list:\r\n return 31\r\n return 30\r\nn,k=(map(int,input().split()))\r\ndays=numberOfDays(2017,n)\r\nv=8-k\r\nval=ceil((days-v)/7)\r\nprint(val+1)", "import math\n\nmonths = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nmonth, weekday = map(int, input().split())\nprint(math.ceil((weekday + months[month] - 1) / 7))\n", "def ceild(a,b):\n return -(-a//b)\nn=[31,28,31,30,31,30,31,31,30,31,30,31]\nm,d=map(int,input().split())\nprint(ceild(n[m-1]+d-1,7))\n", "m,d=[int(x) for x in input().split()]\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n\tif d<=5:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(6)\r\nelif m==2:\r\n\tif d==1:\r\n\t\tprint(4)\r\n\telse:\r\n\t\tprint(5)\r\nelse:\r\n\tif d<=6:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(6)", "innie=input().split()\r\nbump=['1','3','5','7','8','10','12']\r\nlow=['4','6','9','11']\r\nweek=[7,6,5,4,3,2,1]\r\nm=innie[0]\r\nd=week[int(innie[1])-1]\r\nn=28\r\nif m in bump:\r\n n=31\r\nelif m in low:\r\n n=30\r\n\r\ncols=2+(n-d)//7\r\nif (n-d)%7==0:\r\n cols=cols-1\r\n\r\nprint(cols)\r\n", "import math\n\nm, d = map(int, input().split(' '))\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][m-1]\nfirst = 7-d+1\nprint(int(math.ceil((days-first)/7))+1)\n", "import math\r\ndef petr_calendar(m, d):\r\n days = 0\r\n if m in [1, 3, 5, 7, 8, 10, 12]:\r\n days = 31\r\n elif m in [4, 6, 9, 11]:\r\n days = 30\r\n else:\r\n days = 28\r\n days = days - (8 - d)\r\n return 1 + math.ceil(days / 7)\r\n\r\nm, d = [int(item) for item in input().split()]\r\nprint(petr_calendar(m, d))", "import sys\r\n#sys.stdin = open(\"in.txt\" , \"r\")\r\n#sys.stdout = open(\"out.txt\" , \"w\")\r\nfrom math import ceil\r\ndays = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\nm,d = map(int,input().split())\r\ndays = d - 1 + days[m] \r\nprint(ceil(days/7))\r\n", "a=[30,31]*9\r\na[2]=28\r\na[8:]=[31,30]*3\r\nm,d=map(int,input().split())\r\nprint(1--(a[m]+d-8)//7)", "def countweek(d, total):\n\tfirst = 7-d+1\n\trest = total-first\n\tweeks = 1+(rest//7)\n\tif rest%7 > 0:\n\t\tweeks += 1\n\treturn weeks\n\nm, d = input().split()\nm = int(m)\nd = int(d)\nweeks = 0\nif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12:\n\tweeks = countweek(d, 31)\nelif m == 2:\n\tweeks = countweek(d, 28)\nelse:\n\tweeks = countweek(d, 30)\n\nprint(weeks)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef month_days(m):\r\n if m == 2:\r\n return 28\r\n elif m <= 7 and m % 2 == 1:\r\n return 31\r\n elif m <= 7 and m % 2 == 0:\r\n return 30\r\n elif m >= 8 and m % 2 == 1:\r\n return 30\r\n elif m >= 8 and m % 2 == 0:\r\n return 31\r\n return -1\r\n\r\ndef main():\r\n m, d = map(int, input().split())\r\n ans = 1\r\n for i in range(month_days(m)):\r\n if i:\r\n d = (d + 1)\r\n if d == 8:\r\n d = 1\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn,m=map(int,input().strip().split()[:2])\nm31=[1,3,5,7,8,10,12]\nm30=[4,6,9,11]\nm28=[2]\nif n in m31:\n\tk=m-1+31\n\tif k%7==0:\n\t\tprint(k//7)\n\telse:\n\t\tprint((k//7)+1)\nelif n in m30:\n\tk=m-1+30\n\tif k%7==0:\n\t\tprint(k//7)\n\telse:\n\t\tprint((k//7)+1)\nelse:\n\tk=m-1+28\n\tif k%7==0:\n\t\tprint(k//7)\n\telse:\n\t\tprint((k//7)+1)", "def solution(m, d):\r\n total_days = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n remaining_days = total_days[m-1] - (8-d)\r\n ans = 1 + remaining_days//7 + (1 if remaining_days%7 != 0 else 0)\r\n return ans\r\n\r\nm, d = [int(x) for x in input().strip().split(\" \")]\r\nprint(solution(m, d))", "q,w=map(int,input().split())\r\na=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nans=1\r\nt=a[q]-(8-w)\r\nwhile t>0:\r\n ans+=1\r\n t-=7\r\nprint(ans)\r\n", "def read_input():\n line = input().strip().split()\n m = int(line[0])\n week = int(line[1])\n days31 = {1,3,5,7,8,10,12}\n if m == 2:\n days = 28\n elif m in days31:\n days = 31\n else:\n days = 30\n z = (days + week - 1)\n return z//7 if z % 7 == 0 else z//7 + 1\n\nif __name__ == \"__main__\":\n print(read_input())", "import math\r\nmo={1:31,2:28,3:31,4:30,5:31,6:30,7:31,8:31,9:30,10:31,11:30,12:31}\r\nm,d=map(int,input().split())\r\nk=math.ceil(((d-1+mo[m]))/7)\r\nprint(k)\r\n", "import math\r\nm,d = map ( int ,( input().split() ) )\r\nlist=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nprint(math.ceil((list[m] + d-1)/7))", "m,d = map(int,input().split())\r\nif m==2:\r\n days=28\r\n\r\nelif m in [1,3,5,7,8,10,12]:\r\n days = 31\r\nelse:\r\n days=30\r\n \r\n#Case Monday:\r\nif d==1 and (days==31 or days==30): #other months\r\n print(5)\r\n\r\nif d==1 and days==28: #February\r\n print(4)\r\n\r\n#case not monday\r\n\r\nif d!=1 and days==28: #February\r\n print(5)\r\n \r\nif d!=1 and (days==31 or days==30):#other months\r\n k=days-(8-d)\r\n if k>28:\r\n print(6)\r\n else:\r\n print(5)", "m, d = map(int, input().split(' '))\r\nif m == 2:\r\n if (28 - 8 + d) % 7 == 0:\r\n print(((28 - 8 + d) // 7) + 1)\r\n else:\r\n print(((28 - 8 + d) // 7) + 2)\r\nelif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12:\r\n if (31 - 8 + d) % 7 == 0:\r\n print(((31 - 8 + d) // 7) + 1)\r\n else:\r\n print(((31 - 8 + d) // 7) + 2)\r\nelse:\r\n if (30 - 8 + d) % 7 == 0:\r\n print(((30 - 8 + d) // 7) + 1)\r\n else:\r\n print(((30 - 8 + d) // 7) + 2)\r\n", "import math\nmonth,day = input().split()\nmonth,day = int(month),int(day)\nif month == 1 or month == 3 or month == 5 or month == 7 or month == 8 or month == 10 or month == 12:\n\ttotal = 30 + day\nelif month == 2:\n\ttotal = 27 + day\nelse:\n\ttotal = 29 + day\ncol = math.ceil(total/7)\nprint(col)", "import re\r\n\r\nentrada = input()\r\nmatch = re.search('(\\d*) (\\d*)', entrada)\r\n\r\nm = int(match.group(1))\r\nd = int(match.group(2))\r\n\r\nmeses = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\ncolunas = ((meses[m]-(7-(d-1)))//7)+1\r\n\r\nif (meses[m]-(7-(d-1))) % 7 > 0:\r\n\tcolunas+=1\r\n\r\nprint(colunas)", "import math\n\nm,d = (int(x) for x in input().split())\nmday = 28 if m==2 else 31 if ((m<=7 and m&1) or (m>7 and not m&1)) else 30\nprint(int(math.ceil((mday - (7-d+1))/7)+1))\n", "\r\nm,d=input().split()\r\nm = int(m)\r\nd = int(d)\r\nc = 0\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n c=5\r\n if d>5:\r\n c=6\r\nif m==2:\r\n c=4\r\n if d>1:\r\n c=5\r\nif m==4 or m==6 or m==9 or m==11:\r\n c=5\r\n if d==7:\r\n c=6\r\nprint(c)\r\n", "m,d=map(int,input().split())\r\nthang_30_ngay=[4,6,9,11]\r\nif m in thang_30_ngay:\r\n if(d+1>7):\r\n print(6)\r\n else:\r\n print(5)\r\nelif(m==2):\r\n if(d==1):\r\n print(4)\r\n else:\r\n print(5)\r\nelse:\r\n if(d+2>7):\r\n print(6)\r\n else:\r\n print(5)", "# https://codeforces.com/problemset/problem/760/A\nm, d = tuple(map(int, input().split(' ')))\n\ndc = {\n 1:31,\n 2:28,\n 3:31,\n 4:30,\n 5:31,\n 6:30,\n 7:31,\n 8:31,\n 9:30,\n 10:31,\n 11:30,\n 12:31\n }\n\nif dc[m] == 28:\n if d == 1:\n result = 4\n else:\n result = 5\nelif dc[m] == 31:\n if d == 6 or d == 7:\n result = 6\n else:\n result = 5\nelse:\n if d == 7:\n result = 6\n else:\n result = 5\n\nprint(result)", "m,d = map(int, input().split())\r\na=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nx=8-d\r\ny=a[m-1]-x\r\nz=y//7\r\nif y%7!=0:\r\n z=z+1\r\nprint(z+1)", "m,w=map(int,input().split())\r\nli = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nd = li[m-1]-(7-w+1)\r\nprint((-(-d//7))+1)", "m,d=map(int,input().split())\nt={1:31,2:28,3:31,4:30,5:31,6:30,7:31,8:31,9:30,10:31,11:30,12:31}\nif t[m]==31:\n\tif d>=6:\n\t\tprint(6)\n\telse:\n\t\tprint(5)\nelif t[m]==30:\n\tif d==7:\n\t\tprint(6)\n\telse:\n\t\tprint(5)\nelse:\n\tif d==1:\n\t\tprint(4)\n\telse:\n\t\tprint(5)", "m,d=map(int,input().split())\r\nif(m==2):\r\n l=28\r\nelif(m<=7):\r\n if(m%2==0):\r\n l=30\r\n else:\r\n l=31\r\nelse:\r\n if(m%2==0):\r\n l=31\r\n else:\r\n l=30\r\nc=1\r\nl=l-(8-d)\r\nc+=l//7+(0 if l%7==0 else 1)\r\nprint(c)\r\n \r\n", "m,d = map(int, input().split())\nDict = {1:31,2:28,3:31,4:30,5:31,6:30,7:31, 8:31, 9:30, 10:31, 11:30,12:31}\ncount = 0\nif Dict[m] == 28:\n if d == 1:\n print(4)\n else:\n print(5)\nelif Dict[m] == 30:\n if d == 7:\n print(6)\n else: print(5)\nelse:\n if d==6 or d==7:\n print(6)\n else: print(5)\n \t \t\t \t \t\t \t\t \t \t \t", "months={'1':31, '2':28, '3':31, '4':30, '5':31, '6':30, '7':31, '8':31, '9':30, '10':31, '11':30, '12':31}\r\n\r\nmonth, day=input().split()\r\nday=int(day)\r\nif months[month]==31:\r\n\tif day>5:\r\n\t\tprint(6)\r\n\telse:\r\n\t\tprint(5)\r\nelif months[month]==30:\r\n\tif day>6:\r\n\t\tprint(6)\r\n\telse:\r\n\t\tprint(5)\r\nelse:\r\n\tif day>=2:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(4)", "import sys\r\n\r\ndef main():\r\n\tm, d = map(int, sys.stdin.readline().split())\r\n\r\n\tmonths = {1: 31,\r\n\t\t\t 2: 28,\r\n\t\t\t 3: 31,\r\n\t\t\t 4: 30,\r\n\t\t\t 5: 31,\r\n\t\t\t 6: 30,\r\n\t\t\t 7: 31,\r\n\t\t\t 8: 31,\r\n\t\t\t 9: 30,\r\n\t\t\t 10: 31,\r\n\t\t\t 11: 30,\r\n\t\t\t 12: 31}\r\n\r\n\tm = months[m]\r\n\tif d == 1:\r\n\t\tif m % 7 == 0:\r\n\t\t\tprint(m // 7)\r\n\t\telse:\r\n\t\t\tprint(m // 7 + 1)\r\n\telse:\r\n\t\tm -= 7 - d + 1\r\n\t\tif m % 7 == 0:\r\n\t\t\tprint(m // 7 + 1)\r\n\t\telse:\r\n\t\t\tprint(m // 7 + 2)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "dc=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\nprint((dc[m]+d+5)//7)", "# -*- coding: utf-8 -*-\r\nm,d = map(int, input().split(' '))\r\nms = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm_d = ms[m-1]\r\nf_s = 8-d\r\ns_s = (m_d-f_s)//7\r\np_s = m_d - f_s - ((m_d-f_s)//7)*7\r\nl_s = 1\r\nif p_s == 0:\r\n l_s = 0\r\nprint(1+s_s+l_s)\r\n", "m, d = map(int, input().split())\r\n\r\nif m == 1:\r\n n = 31\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 2:\r\n n = 28\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 3:\r\n n = 31\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 4:\r\n n = 30\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 5:\r\n n = 31\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 6:\r\n n = 30\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 7:\r\n n = 31\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 8:\r\n n = 31\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 9:\r\n n = 30\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 10:\r\n n = 31\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 11:\r\n n = 30\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)\r\nif m == 12:\r\n n = 31\r\n ex = 0\r\n if d!= 1:\r\n val = 8 - d\r\n n -= val\r\n ex = 1\r\n np = n % 7\r\n if np:\r\n print((n//7)+1+ex)\r\n else:\r\n print((n//7)+ex)", "import math, sys\r\n\t\r\ndef main():\r\n\tn,d = map(int, input().split())\r\n\tmonths = [31,28,31,30,31,30,31,31,30,31,30,31]\r\n\tk = (months[n-1] - (8-d))\r\n\tans = 1 + k//7 + int(k%7>0)\r\n\tprint(ans)\r\n\t\t\r\n\t\t \r\n\t\t\t\r\n\r\nif __name__==\"__main__\":\r\n\tmain()\r\n", "__author__ = 'zihaozhu'\nfrom sys import stdin\nlong = set([1,3,5,7,8,10,12])\nfeb = [2]\nshort = set([4,6,9,11])\n\n\nmonth, day = map(int,stdin.readline().split())\nif month in long:\n days = 31\n first = 8-day\n remaining = (days-first)%7\n mod = (days-first)//7\n\n if remaining == 0:\n print(mod+1)\n else:\n print(mod+2)\nelif month in feb:\n days = 28\n first = 8-day\n remaining = (days-first)%7\n mod = (days-first)//7\n if remaining == 0:\n print(mod+1)\n else:\n print(mod+2)\nelif month in short:\n days=30\n first = 8-day\n remaining = (days-first)%7\n mod = (days-first)//7\n# print(remaining)\n# print(mod)\n if remaining == 0:\n print(mod+1)\n else:\n print(mod+2)", "m, d = map(int, input().split())\r\n\r\n# days_in_month = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ndays_in_month = {\r\n '1' : 31,\r\n '2' : 28,\r\n '3' : 31,\r\n '4' : 30,\r\n '5' : 31,\r\n '6' : 30,\r\n '7' : 31,\r\n '8' : 31,\r\n '9' : 30,\r\n '10' : 31,\r\n '11' : 30,\r\n '12' : 31\r\n}\r\n\r\ntotal_days = days_in_month[str(m)]\r\ncolumns = (total_days + d - 1 + 6) // 7\r\nprint(columns)\r\n\r\n\r\n#### WANTE REBEATED", "month_days = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nm, d = map(int, input().split())\n\nmax_day = d - 1 + month_days[m-1]\n\nprint(max_day // 7 if max_day % 7 == 0 else (max_day // 7) + 1)", "month, day = map(int, input().split())\r\n\r\nd = {1:31, 2:28, 3:31, 4:30, 5:31, 6:30, 7:31, 8:31, 9:30, 10:31, 11:30, 12:31}\r\nfirst_column = 8 - day\r\nrem_days = d[month] - first_column\r\nif rem_days%7 == 0:\r\n print(rem_days//7 + 1)\r\nelse:\r\n print(rem_days//7 + 2) \r\n", "\r\nm, d = map(int, input().split())\r\nm31 = [1,3,5,7,8,10,12]\r\nm30 = [4,6,9,11]\r\n\r\nc = 0\r\nif m in m31:\r\n if d == 6 or d == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nelif m in m30:\r\n if d == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if d == 1:\r\n print(4)\r\n else:\r\n print(5)\r\n", "m,d=map(int,input().split())\r\nif(m==2):\r\n if(d==1):\r\n print(4)\r\n else:\r\n print(5)\r\nelif(m==4 or m==6 or m==9 or m==11):\r\n if(d<7):\r\n print(5)\r\n else:\r\n print(6)\r\nelse:\r\n if(d<6):\r\n print(5)\r\n else:\r\n print(6)", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nm, d = IL()\r\nC = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nnd = d-1 + C[m-1]\r\nprint(nd // 7 + bool(nd%7))", "m,d=list(map(int,input().split()))\r\nn=0\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n if d==6 or d==7:\r\n n=6\r\n else:\r\n n=5\r\nelif m==4 or m==6 or m==9 or m==11:\r\n if d==7:\r\n n=6\r\n else:\r\n n=5\r\nelse:\r\n if d==1:\r\n n=4\r\n else:\r\n n=5\r\nprint(n)", "\nl = input().split(' ')\n\nm = int(l[0])\nd = int(l[1])\n\ncounter = 4;\n\ns = 1 - d\nwhile s < 0:\n s += 7\n\nif s > 0 :\n counter += 1\na = 28 + s\n\nif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12 :\n if 31 - a > 0:\n counter += 1\n\nif m == 4 or m == 6 or m == 9 or m == 11:\n if 30 - a > 0:\n counter += 1\n\nif m == 2 :\n if 28 - a > 0:\n counter += 1\n\n\nprint(counter)\n", "a = [int(i) for i in input().split()]\r\nm = int(a[0])\r\nd = int(a[1])\r\nj = 1\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n for i in range(30):\r\n d+=1\r\n if d>7:\r\n d-=7\r\n j+=1\r\n\r\nif m==4 or m==6 or m==9 or m==11:\r\n for i in range(29):\r\n d+=1\r\n if d>7:\r\n d-=7\r\n j+=1\r\n\r\nif m==2:\r\n for i in range(27):\r\n d+=1\r\n if d>7:\r\n d-=7\r\n j+=1\r\n\r\nprint(j)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nm, d = map(int, input().split())\r\nx = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ny = x[m] - (8 - d)\r\nans = y // 7 + min(y % 7, 1) + 1\r\nprint(ans)", "n, m = map(int, input().split())\nif n in (1,3,5,7,8,10,12):\n days = 31\nelif n == 2:\n days = 28\nelse:\n days = 30\n\ncolumn = 1\ndays -= (8-m)\nif days % 7:\n column += 1\ncolumn += days // 7\nprint(column)\n\n", "inputLine=input()\r\ninputLine=inputLine.split()\r\nm=int(inputLine[0])\r\nn=int(inputLine[1])\r\n\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n if n<=5:\r\n print(5)\r\n else:\r\n print(6)\r\n\r\nelif m==2:\r\n if n==1:\r\n print(4)\r\n else:\r\n print(5)\r\n\r\nelse:\r\n if n<=6:\r\n print(5)\r\n else:\r\n print(6)\r\n\r\n\r\n", "a = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nn, k = map(int, input().split())\r\nprint(1 + (a[n-1] - (8 - k) + 6) // 7)", "m, d = input().split(' ')\r\nm, d = int(m), int(d)\r\n\r\ndays = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nweeks, rest = divmod(days[m-1]-(8-d), 7)\r\n\r\nprint(weeks + (1 if rest != 0 else 0) + 1)", "import math\r\n\r\ndef main_function():\r\n y = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n m, w = [int(i) for i in input().split(\" \")]\r\n return int(math.ceil((y[m] - (8 - w)) / 7)) + 1\r\n\r\n\r\n\r\nprint(main_function())", "m, d = map(int, input().split())\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nprint((days[m - 1] + (d - 1) + 6) // 7)\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/760/A\r\n\r\nm, d = map(int, input().split())\r\n\r\nl_m = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nt_d = l_m[m - 1]\r\n\r\nprint((d + t_d - 1) // 7 + (1 if (d + t_d - 1) % 7 != 0 else 0))", "import math\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nm, d = map(int, input().split())\nans = 1 + math.ceil((days[m - 1] - (8 - d)) / 7)\nprint(ans)", "m,n = map(int,input().split())\r\n\r\n\r\nif m == 2:\r\n\tif n == 1:\r\n\t\tprint(4)\r\n\telse:\r\n\t\tprint(5)\r\nelif (m<=7 and m%2) or (m>7 and m%2 == 0):\r\n\tif n<=5:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(6)\r\nelse:\r\n\tif n<=6:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(6)\r\n", "mount = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = map(int, input().split())\r\nm = mount[m - 1]\r\nprint((m - 1 - (7 - d + 1)) // 7 + 2)\r\n", "# https://codeforces.com/problemset/problem/760/A\r\n\r\nimport math\r\n\r\nm, d = map(int, input().split())\r\nmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\na = math.ceil((months[m - 1] - (7 - d + 1)) / 7)\r\nprint(a + 1)\r\n", "m, d = map(int, input().split())\r\nthione = [1, 3, 5, 7, 8, 10, 12]\r\nthirty = [4, 6, 9, 11]\r\ntweeig = [2]\r\nif m in thione:\r\n days = 31\r\nelif m in thirty:\r\n days = 30\r\nelse:\r\n days = 28\r\nif days == 28:\r\n if d == 1:\r\n print(4)\r\n else:\r\n print(5)\r\nelif days == 30:\r\n if d == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if d >= 6:\r\n print(6)\r\n else:\r\n print(5)", "month, cur = list(map(int, input().split()))\nmonth_day = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\ncol = 1\nfor i in range(1, month_day[month] + 1):\n if (cur == 8):\n cur = 2\n col += 1\n else:\n cur += 1\nprint(col)\n", "import math\nm = [-1,31,28,31,30,31,30,31,31,30,31,30,31]\na,b=map(int,input().split())\nb=8-b\nprint(math.ceil((m[a]-b)/7)+1)", "month, fday = map(int, input().split())\r\nfday -= 1\r\n\r\nif month == 2:\r\n ndays = 28\r\nelif month in (4, 6, 9, 11):\r\n ndays = 30\r\nelse:\r\n ndays = 31\r\n\r\nlday = (fday-1 + ndays) % 7\r\nresult = 5 if ndays in (30, 31) else 4\r\n\r\nif lday < fday:\r\n result += 1\r\n\r\n# print(fday, lday)\r\nprint(result)\r\n\r\n##########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n##########################################", "import math\r\nm,d=map(int,input().split())\r\nif (m<8)and(m%2==1):\r\n c=31\r\nelif m==2:\r\n c=28\r\nelif (m<8):\r\n c=30\r\nelif (m>=8)and(m%2==0):\r\n c=31\r\nelse: c=30\r\nl=8-d\r\nc-=l\r\nprint(math.ceil(c/7)+1)\r\n", "m,d=map(int,input().split(' '))\r\nif m!=2:\r\n if d!=6 and d!=7:\r\n print(5)\r\n elif d==7:\r\n print(6)\r\n elif d==6:\r\n if m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if d!=1:\r\n print(5)\r\n else:\r\n print(4)", "m, s = map(int, input().split())\ndm = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nd = dm[m - 1] + (s - 1)\nprint(0 - -d // 7)\n", "m,d = map(int, input().split())#\nmo1=[1,3,5,7,8,10,12]\nmo2=[4,6,9,11]\nif m in mo1:\n\tk=31\nelif m in mo2:\n\tk=30\nelse:\n\tk=28\n\nif (k+d-1)%7==0:\n\tans=(k+d-1)//7\nelse:\n\tans=(k+d-1)//7+1\nprint(ans)", "ip = input().split(' ')\nip = list(map(int, ip))\nndays = [31,28,31,30,31,30,31,31,30,31,30,31]\ndays = ndays[ip[0]-1] + ip[1] - 1\ncolumns = 0\nwhile days>0:\n days = days - 7\n columns += 1\nprint(columns) \n \t \t \t \t \t \t", "m, d = map(int, input().split())\r\n\r\nif m == 2:\r\n wm = 28\r\nelif m == 4 or m == 6 or m == 9 or m == 11:\r\n wm = 30\r\nelse:\r\n wm = 31\r\n\r\nwm -= 8 - d\r\n\r\nif wm % 7 == 0:\r\n print(1 + (wm//7))\r\nelse:\r\n print(2 + (wm//7)) ", "M = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = list(map(int, input().split()))\r\n\r\nn = M[m]\r\n\r\nn += (d-1)\r\n\r\nif n%7 == 0:\r\n n /= 7 \r\n print(int(n))\r\nelse:\r\n n /= 7\r\n print(int(n)+1)", "m, d = map(int, input().split())\r\n\r\nif m == 2:\r\n if d == 1:\r\n print(4)\r\n else:\r\n print(5)\r\nelif m == 4 or m == 6 or m == 9 or m == 11:\r\n if d == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if d == 7 or d == 6:\r\n print(6)\r\n else:\r\n print(5)\r\n", "def main():\r\n QWE = 'river'\r\n INF = 10 ** 18 + 9\r\n EPS = 10 ** -10\r\n\r\n import sys, math, re\r\n #fi = open('input.txt', 'r')\r\n #fo = open('output.txt', 'w+')\r\n #fi = open(QWE +\".in\", \"r\")\r\n #fo = open(QWE + \".out\", \"w+\")\r\n\r\n m, d = map(int, input().split(' ', 1))\r\n a = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n ans = (a[m - 1] + d + 5) // 7\r\n print(ans)\r\n\r\nmain()\r\n", "m,d=map(int,input().split())\r\nif(m==2 and d==1):\r\n print(4)\r\nelif(m==2 and d>1):\r\n print(5)\r\nelif((m<=7 and m%2)or(m>7 and m%2==0)):\r\n if(d<=5):\r\n print(5)\r\n else:\r\n print(6)\r\nelif((m<=7 and m%2==0)or(m>7 and m%2)):\r\n if(d<=6):\r\n print(5)\r\n else:\r\n print(6)\r\n", "a,b=map(int,input().split());d=[31,28,31,30,31,30,31,31,30,31,30,31][a-1];print(((d-(8-b))//7)+1+int((d-(8-b))%7!=0))", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output.out\",'w')\r\nn,d=map(int,input().split())\r\na=[1,3,5,7,8,10,12]\r\nif n==2:\r\n\tif d==1:\r\n\t\tprint(4)\r\n\telse:\t\r\n\t\tprint(5)\r\nelif n in a:\r\n\tif d<6:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(6)\r\nelse:\r\n\tif d<7:\r\n\t\tprint(5)\r\n\telse:\r\n\t\tprint(6)\t\t\t\t\t", "m,d=map(int,input().split())\r\no=[1,3,5,7,8,10,12]\r\nz=[4,6,9,11]\r\nif m in o:\r\n if(d>5):\r\n print(6)\r\n else:\r\n print(5)\r\nelif m in z:\r\n if(d>6):\r\n print(6)\r\n else:\r\n print(5)\r\nelif m==2:\r\n if d==1:\r\n print(4)\r\n else:\r\n print(5)", "x, y = map(int, input().split())\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nprint((days[x - 1] + (y - 1) + 6) // 7)", "def Main(m, d):\r\n month = [31, 28, 31, 30,31,30,31,31,30,31,30,31]\r\n # print(len(month))\r\n # print(sum(month))\r\n\r\n day = [1,2,3,4,5,6,7]\r\n M = month[m - 1]\r\n\r\n if M == 31 and (d == 6 or d == 7):\r\n print(6)\r\n return 0\r\n if M == 31 and ( 1 <= d <= 5):\r\n print(5)\r\n return 0\r\n if M == 30 and d == 7:\r\n print(6)\r\n return 0\r\n if M == 30 and (1 <= d <= 6):\r\n print(5)\r\n return 0\r\n\r\n if M == 28 and d == 1:\r\n print(4)\r\n return 0\r\n if M == 28 and (2 <= d <= 7):\r\n print(5)\r\n\r\n\r\n\r\n # rez = day[d - 1]\r\n # col = 0\r\n # sm = 0\r\n # for i in range(d , 50):\r\n # if i % 7 == 0:\r\n # col += 1\r\n # sm += 1\r\n # if sm > M:\r\n # break\r\n #\r\n # print(i)\r\n # print(col)\r\n # print(sm)\r\n\r\nif __name__ == '__main__':\r\n m , d = map(int, input().split())\r\n Main(m,d)", "import math\r\n\r\na = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d = map(int,input().split())\r\nprint(1 + math.ceil((a[m] - (8 - d))/7))", "def solve(a,b):\r\n v=[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n ans=(b-1+v[a-1]+6)\r\n ans//=7\r\n return ans\r\n\r\na,b=map(int,input().split())\r\nprint(solve(a,b))\r\n", "list = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\nm,d=map(int,input().split())\r\nn=list[m]\r\nn=n-(8-d)\r\na=int(n/7)\r\nif n%7!=0:\r\n\ta+=1\r\nprint(1+a)", "m,d=map(int,input().split())\r\nm1_l=[1,3,5,7,8,10,12]\r\nm0_l=[4,6,9,11]\r\nc=4\r\nif m in m1_l:\r\n y=31%7\r\n y=y-(7-d+1)\r\n c=c+1\r\n if y>0:\r\n c=c+1\r\nelif m in m0_l:\r\n y=30%7\r\n y=y-(7-d+1)\r\n c=c+1\r\n if y>0:\r\n c=c+1\r\nelse:\r\n if d!=1:\r\n c=c+1\r\nprint(c) ", "#30 days: 4 6 9 11\r\n#31 days: 1 3 5 7 8 10 12\r\n#28 days: 2\r\nm,d=[int(i) for i in input().split()]\r\nif m==2:\r\n if d==1:\r\n print(4)\r\n else :\r\n print(5)\r\nelif m==4 or m==6 or m==9 or m==11:\r\n if d==7:\r\n print(6)\r\n else :\r\n print(5)\r\nelse :\r\n if d==6 or d==7:\r\n print(6)\r\n else :\r\n print(5)", "a,b=map(int,input().split())\r\nc=[1,3,5,7,8,10,12]\r\nd=[4,6,9,11]\r\nif (a in c and (b==6 or b==7)) or (a in d and b==7):print(6)\r\nelif a==2 and b==1:print(4)\r\nelse:print(5)", "lens = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = [int(s) for s in input().split(' ')]\r\nprint((lens[m - 1] + d - 2) // 7 - (d - 1) // 7 + 1)\r\n", "import sys\n\ndef main():\n m,d = map(int,sys.stdin.readline().split())\n x = [31,28,31,30,31,30,31,31,30,31,30,31]\n y = x[m-1] + d-1\n res = y/7\n if res > int(res):\n res = int(res)+1\n print(int(res))\n\nmain()", "m, d = input().split()\r\nm = int(m)\r\nd = int(d)\r\n\r\nL = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nn = L[m-1]\r\n\r\nif d == 7:\r\n c = 1\r\nif d == 6:\r\n c = 2\r\nif d == 5:\r\n c = 3\r\nif d == 4:\r\n c = 4\r\nif d == 3:\r\n c = 5\r\nif d == 2:\r\n c = 6\r\nif d == 1:\r\n c = 7\r\n\r\nn = n - c\r\nres = 1\r\nif n > 0:\r\n n = n - 7\r\n res = res + 1\r\nif n > 0:\r\n n = n - 7\r\n res = res + 1\r\nif n > 0:\r\n n = n - 7\r\n res = res + 1\r\nif n > 0:\r\n n = n - 7\r\n res = res + 1\r\nif n > 0:\r\n n = n - 7\r\n res = res + 1\r\nif n > 0:\r\n n = n - 7\r\n res = res + 1\r\nif n > 0:\r\n n = n - 7\r\n res = res + 1\r\nprint (res)", "year = [31,28,31,30,31,30,31,31,30,31,30,31]\r\n(m,d) = map(int,input().split())\r\ndays = year[m-1]\r\ndays-= (7-d)+1\r\nprint(days//7+int(bool(days%7))+1)", "m,d=map(int,input().split())\r\nl=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nif d!=1:\r\n a=7-d+28+1\r\n if l[m-1]>a:\r\n print(\"6\")\r\n else:\r\n print(\"5\")\r\nelse:\r\n if l[m-1]>28:\r\n print(\"5\")\r\n else:\r\n print(\"4\")\r\n", "m, d = map(int, input().split())\n\ndays = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nprint(((days[m] + d - 1) + 6) // 7)\n", "days = {1: 31, 2: 28, 3: 31, 4: 30, 5: 31, 6: 30, 7: 31, 8: 31, 9: 30, 10: 31, 11: 30, 12: 31}\nm, d = (int(i) for i in input().split())\nres = (days[m] - 1 + d - 1) // 7 + 1\nprint(res)\n", "import math\r\nm,d = map(int,input().split())\r\nprint(math.ceil(([0,31,28,31,30,31,30,31,31,30,31,30,31][m] - 8 + d)/ 7)+ 1)", "m,d = map(int,input().split())\r\nm1 = [1,3,5,7,8,10,12]\r\nm2 = [4,6,9,11]\r\nif m in m1:\r\n if d == 7 or d == 6: print(6)\r\n else: print(5)\r\nelif m == 2:\r\n if d == 1: print(4)\r\n else: print(5)\r\nelse:\r\n if d == 7: print(6)\r\n else: print(5)", "a,b=list(map(int,input().split()))\r\nl=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nprint((b+l[a-1]-2)//7+1)", "# cook your dish here\r\nk=[1,3,5,7,8,10,12]\r\nm,d=map(int,input().split())\r\n\r\nif m==2:\r\n days=28\r\nelif m in k:\r\n days=31\r\nelse:\r\n days=30\r\n\r\ndif=8-d\r\nc=1\r\ndays=days-dif\r\nwhile True:\r\n if days-7<0:\r\n c=c+1 \r\n break\r\n else:\r\n days=days-7\r\n c=c+1\r\n if days==0:\r\n break\r\nprint(c)", "a, b=input().split()\na=int(a)\nb=int(b)\n\nif(a==2):\n if(b==1):\n print(4)\n else:\n print(5)\nelif(a==4 or a==6 or a==9 or a==11):\n if(b>6):\n print(6)\n else:\n print(5)\nelse:\n if(b>5):\n print(6)\n else:\n print(5)\n \t\t \t\t \t\t \t\t \t\t \t\t\t\t\t \t\t", "import math\r\n\r\nm, d = map(int, input().split())\r\nd = 8 - d\r\nif m == 2:\r\n print(math.ceil((28 - d) / 7) + 1)\r\nelif m == 4 or m == 6 or m == 9 or m == 11:\r\n print(math.ceil((30 - d) / 7) + 1)\r\nelse:\r\n print(math.ceil((31 - d) / 7) + 1)", "m,d=map(int,input().split())\r\nl=[1,3,5,7,8,10,12]\r\nif m in l:\r\n\tprint(((d-1)+31-1)//7+1)\r\nelif m==2:\r\n\tprint(((d-1)+28-1)//7+1)\r\nelse:\r\n\tprint(((d-1)+30-1)//7+1) ", "import math\r\nn,k=map(int, input().split())\r\n#n=int(input())\r\n#l=list(map(int, input().split()))\r\na=[1,3,5,7,8,10,12] #31 days\r\nb=[2] #28days\r\nif n in a:\r\n print(1+math.ceil((23+k)/7))\r\nelif n==2:\r\n print(1+math.ceil((20+k)/7))\r\nelse:\r\n print(1+math.ceil((22+k)/7))", "m, d = map(int, input().split())\r\nc = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nt = c[m - 1]\r\nnum = 1\r\nfor i in range(1, t):\r\n d += 1\r\n if d == 8:\r\n d = 1\r\n num += 1\r\nprint(num)", "import math\nm,d=map(int,input().split())\n#print(m,d)\nd=8-d\ncount=0\nif(m==2):\n\tc=28\n\t\nelif(m==4 or m==6 or m==9 or m==11):\n\tc=30\nelse:\n\tc=31\nc-=d\ncount+=1\n#print(c,count)\ncount+=math.ceil(c/7)\nprint(count)", "import math\nm, d = map(int, input().split())\nif m==2:\n a=28\nelif m==4 or m==6 or m==9 or m==11:\n a=30\nelse:\n a=31\nb=a+d-1\nc=b/7\nd=math.ceil(c)\nprint(d)", "from sys import stdin\r\nfrom math import ceil\r\n\r\nm, d = map(int, stdin.readline().split())\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nprint(ceil((days[m - 1] + (d - 1)) / 7))\r\n", "m , d = map(int, input().split())\nmn = [31,28,31,30,31,30,31,31,30,31,30,31]\nds = mn[m - 1]\nrs = 1\nds -= (7 - d + 1)\nrs += ds // 7\nif ds % 7 != 0:\n rs += 1\nprint(rs)", "x,y=map(int,input().split())\r\no=0\r\nif x in [1,3,5,7,8,10,12]:\r\n if y==7 or y==6:\r\n o=6\r\n else:\r\n o=5\r\nif x in [4,6,9,11]:\r\n if y==7:\r\n o=6\r\n else:\r\n o=5\r\nif x==2:\r\n if y==1:\r\n o=4\r\n else:\r\n o=5\r\nprint(o)", "nbD = dict()\nfor i in [1,3,5,7,8,10,12]:\n nbD[i] = 31\nfor i in [4,6,9,11]:\n nbD[i] = 30\nnbD[2] = 28\nm,d = map(int,input().split())\ntot = nbD[m]\nfirst = 8-d\nnbW = 1\ntot -= first\nnbW += (tot+6)//7\nprint(nbW)\n", "m,d= map(int,input().split())\r\nc = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nnum = d - 1 + c[m]\r\ncol = num // 7;\r\nif num % 7 != 0:\r\n col+=1\r\nprint(col)\r\n", "month, day = input(). split(\" \")\r\nif month == \"2\":\r\n if day == \"1\":\r\n print(\"4\")\r\n else:\r\n print(\"5\")\r\nelif month in ('4', '6', '9', '11'):\r\n if day == '7':\r\n print(\"6\")\r\n else:\r\n print(\"5\")\r\nelse:\r\n if day in ('6', '7'):\r\n print(\"6\")\r\n else:\r\n print(\"5\")", "a,b=map(int,input().split())\nx=[1,3,5,7,8,10,12]\ny=[4,6,9,11]\nif a==2:print(4 if b==1 else 5)\nelif a in x: print(6 if b>=6 else 5)\nelse:print(6 if b==7 else 5)\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"OUTPUX.out\",\"w\")\r\nM,D=map(int,input().split())\r\nans=4\r\nif M==1 or M==3 or M==5 or M==7 or M==8 or M==10 or M==12:\r\n\tDays=31\r\n\tif D==7 or D==6:\r\n\t\tans+=2\r\n\telse:\r\n\t\tans+=1\r\nelif M==2:\r\n\tDays=28\r\n\tif D!=1:\r\n\t\tans+=1\r\nelse:\r\n\tDays=30\r\n\tif D==7:\r\n\t\tans+=2\r\n\telse:\r\n\t\tans+=1\r\nprint(ans)", "m, d = map(int, input().split())\r\nlst = [4,6,9,11]\r\nlst1 = [1,3,5,7,8,10,12]\r\nlst2 = [2]\r\nif m in lst:\r\n if d == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nelif m in lst1:\r\n if d >= 6:\r\n print(6)\r\n else:\r\n print(5)\r\nelif m in lst2:\r\n if d == 1:\r\n print(4)\r\n else:\r\n print(5)\r\n", "m, d = map(int, input().split())\r\nm = ([31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31])[m - 1]\r\ndays_left = m - (8 - d)\r\nprint(days_left // 7 + (days_left % 7 != 0) + 1)", "import math\r\nm, d=map(int, input().split())\r\ndays=0\r\nif m==2: days=28\r\nelif m==4 or m==6 or m==9 or m==11: days=30\r\nelse: days=31\r\ncol= math.ceil((days-(7-d+1))/7)+1\r\nprint(col)", "m, d = map(int, input().split())\r\n\r\nl = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nml = l[m]\r\n\r\nml += 5 + d \r\n\r\nprint(ml // 7)", "a , b = map(int , input().split())\r\nif a in [1,3,5,7,8,10,12]:\r\n if b>=6:\r\n print(6)\r\n else:\r\n print(5)\r\nelif a in [4,6,9,11]:\r\n if b==7:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if b==1:\r\n print(4)\r\n else:\r\n print(5)\r\n", "months = [0, 31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\nfrom math import ceil\r\n\r\nm, d = map(int, input().split())\r\n\r\nprint(ceil((months[m] + d - 1) / 7))\r\n", "a=[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm,d=map(int,input().split())\r\nq=a[m-1]\r\ns=0\r\nq-=(7-d+1)\r\ns+=1\r\ns+=q//7\r\nif q%7!=0:\r\n s+=1\r\nprint(s)\r\n", "m , d = map(int,input().split())\r\n\r\nif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12 :\r\n if d == 7 or d == 6 :\r\n print(6)\r\n else:\r\n print(5)\r\nelif m == 4 or m == 6 or m == 9 or m == 11 :\r\n if d == 7 :\r\n print(6)\r\n else:\r\n print(5)\r\nelif m == 2:\r\n if d > 1:\r\n print(5)\r\n else:\r\n print(4) ", "import math\r\nfrom fractions import Fraction as frac\r\n\r\ndef gcd(a, b):\r\n\treturn a if b == 0 else gcd(b, a % b)\r\n\t\r\ndef lcm(a, b):\r\n\treturn a * b // gcd(a, b)\r\n\r\ndef solve(case_no):\r\n\tm, d = map(int, input().split())\r\n\ttd = 0\r\n\tif m == 2:\r\n\t\ttd = 28\r\n\telif m == 4 or m == 6 or m == 9 or m == 11:\r\n\t\ttd = 30\r\n\telse:\r\n\t\ttd = 31\r\n\tprint(math.ceil((td - 8 + d) / 7) + 1)\r\n\t\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n\tsolve(i)", "import math\r\nn,m=map(int,input().split())\r\nm=m-1\r\nif n==1:\r\n val=31\r\nelif n==2:\r\n val=28\r\nelif n==3:\r\n val=31\r\nelif n==4:\r\n val=30\r\nelif n==5:\r\n val=31\r\nelif n==6:\r\n val=30\r\nelif n==7:\r\n val=31\r\nelif n==8:\r\n val=31\r\nelif n==9:\r\n val=30\r\nelif n==10:\r\n val=31\r\nelif n==11:\r\n val=30\r\nelif n==12:\r\n val=31\r\nval=math.ceil((val+m)/7)\r\nprint(val)", "l=[int(x) for x in input().split()]\r\nd={1:31,2:28,3:31,4:30,5:31,6:30,7:31,8:31,9:30,10:31,11:30,12:31}\r\ncolumns=1\r\nleft_days=d[l[0]]-(8-l[1])\r\nadded_column=left_days//7\r\ncolumns=columns+added_column\r\nif left_days%7:\r\n columns+=1\r\nprint(columns)", "import math\r\nm = [-1,31,28,31,30,31,30,31,31,30,31,30,31]\r\na,b=map(int,input().split())\r\nb=8-b\r\nprint(math.ceil((m[a]-b)/7)+1)", "from calendar import monthrange\r\nn , k = map(int,input().strip().split())\r\nl1 = [0,1,2,3,4,5,6,7]\r\nl2 = 7 - l1[k] + 1\r\nNOD = max(monthrange(2017,n))\r\nA = []\r\nif 7 - l1[k] == 0:\r\n A.append(1)\r\nelse:\r\n A.append(7-l1[k]+1)\r\nfor i in range(A[0]+7,NOD + 1,7):\r\n if i <= NOD:\r\n A.append(i)\r\n if NOD - i < 7 and (NOD - i + i) not in A:\r\n A.append(NOD - i + i)\r\nprint(len(A))\r\n\r\n", "m, d = map(int, input().split())\nprint(((3, 0, 3, 2, 3, 2, 3, 3, 2, 3, 2, 3)[m - 1] + d + 5) // 7 + 4)", "month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = map(int, input().split())\r\nprint((d + month[m - 1] + 5) // 7)\r\n", "import math\n\nmon_day = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nmon, day = map(int, input().split())\n\ntot = day - 1 + mon_day[mon]\nprint(math.ceil(tot/7))\n\t\t\t\t \t \t\t\t\t\t\t \t \t\t \t \t", "m, d = map(int, input().split())\r\n\r\nnd = [0,31,28,31,30,31,30,31,31,30,31,30,31][m]\r\n\r\nnc = 0\r\n\r\nnd = nd - (8 - d)\r\nnc = nc + 1\r\n\r\nwhile (nd > 0):\r\n\tnd = nd - 7\r\n\tnc = nc + 1\r\n\r\nprint(nc)\r\n\r\n", "a,b = map(int,input().split())\r\nv = [1,3,5,7,8,10,12]\r\nz = [4,6,9,11]\r\nif a in v:\r\n\tif b<6:print(5)\r\n\telse:print(6)\r\nelif a in z:\r\n\tif b<7:print(5)\r\n\telse:print(6)\r\nelse:\r\n\tif b ==1:print(4)\r\n\telse:print(5)", "m,d=list(map(int,input().split()))\r\nans=-1\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n\r\n if d==7 or d==6:\r\n ans=6\r\n\r\n\r\n else:\r\n ans=5\r\n\r\n\r\n\r\nelif m==2:\r\n\r\n if d==1:\r\n ans=4\r\n\r\n else:\r\n\r\n ans=5\r\n\r\n\r\nelse:\r\n if d==7:\r\n ans=6\r\n\r\n else:\r\n ans=5\r\n\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n", "m, d = map(int, input().split())\r\nif m == 2:\r\n nd = 28\r\nelif m == 4 or m == 6 or m == 9 or m == 11:\r\n nd = 30\r\nelse:\r\n nd = 31\r\nprint(((d - 1 + nd - 1) // 7) + 1)", "x,y=map(int,input().split())\r\nif x==2:\r\n\tprint(4 if y==1 else 5)\r\nelif x in [4,6,9,11]:\r\n\tprint(6 if y==7 else 5)\r\nelse:\r\n\tprint(6 if y>=6 else 5)", "import math\r\nx=input()\r\nk=[int(i) for i in x.split()]\r\nlong=[1,3,5,7,8,10,12]\r\nshort=[4,6,9,11]\r\nif k[0]== 2:\r\n y=int(math.ceil((28-(8-k[1]))/7))+1\r\nelif k[0] in long:\r\n y=int(math.ceil((31-(8-k[1]))/7))+1\r\nelif k[0] in short:\r\n y=int(math.ceil((30-(8-k[1]))/7))+1\r\nprint(y) ", "m,d=map(int,input().split(\" \"))\r\nl=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nx=1+(l[m]-8+d)//7\r\nif (l[m]-8+d)%7>0:\r\n x+=1\r\nprint(x)", "m,d=map(int,input().split())\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n ans=5+((d+1)//7)\r\nelif m==4 or m==6 or m==9 or m==11:\r\n ans=5+((d)//7)\r\nelif m==2:\r\n ans=5+((d-2)//7)\r\nprint(ans)", "a,b=list(map(int,input().split()))\r\nc=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nprint((b+c[a-1]-2)//7+1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nm, d = map(int, input().split())\r\n\r\ntmp = days[m - 1] - (8 - d)\r\nprint((tmp // 7 + (0 if tmp % 7 == 0 else 1)) + 1)", "if __name__ == '__main__':\r\n refer = (0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)\r\n m, d = map(int, input().split())\r\n print((refer[m] + d - 2) // 7 + 1)\r\n", "mon=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\nprint((mon[m]+d-2)//7+1)\r\n", "a = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d =map(int,input().split())\r\n\r\nals = a[m-1]\r\nals -= (7-d+1)\r\nprint(2+(als-1)//7)", "n31 = {1, 3, 5, 7, 8, 10, 12}\r\nn30 = {4, 6, 8, 9, 11}\r\nn28 = {2}\r\n\r\n\r\nm, d = map(int, input().split())\r\nused = 8 - d\r\n\r\nif m in n31:\r\n curD = 31 - used\r\nelif m in n30:\r\n curD = 30 - used\r\nelse:\r\n curD = 28 - used\r\n \r\nif curD % 7 == 0:\r\n print(1 + curD // 7)\r\nelse:\r\n print(2 + curD // 7) ", "\r\ndayCount = [0 , 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31 , 30 , 31]\r\n\r\nm, d = map(int, input().split())\r\nd = d - 1\r\nAns = 1;\r\n\r\nfor i in range(dayCount[m]) :\r\n if d == 7:\r\n d = 0\r\n Ans = Ans + 1\r\n d = d + 1\r\n\r\nprint( Ans )", "from math import *\r\nli=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\nprint(ceil((li[m-1]-8+d)/7)+1)\r\n", "m, d = map(int, input().split())\ndays31 = [1, 3, 5, 7, 8, 10, 12]\nif m == 2 and d < 2:\n print(4)\nelif m == 2 and d > 2:\n print(5)\nelif m in days31 and d < 6:\n print(5)\nelif m in days31 and d >= 6:\n print(6)\nelif m not in days31 and d < 7:\n print(5)\nelif m not in days31 and d >= 7:\n print(6)\n", "m, d = map(int, input().split())\nmonths = {1:31,2:28,3:31,4:30,5:31,6:30,7:31,8:31,9:30,10:31,11:30,12:31}\nprint((d - 2 + months[m])//7 + 1)\n", "m,d = map(int,input().split())\r\nif m in(1,3,5,7,8,10,12):\r\n\tif d>5:\r\n\t\tprint(6)\r\n\telse:\r\n\t\tprint(5)\r\nelif m == 2:\r\n\tif d==1:\r\n\t\tprint(4)\r\n\telse:\r\n\t\tprint(5)\r\nelse:\r\n\tif d==7:\r\n\t\tprint(6)\r\n\telse:\r\n\t\tprint(5)", "month_day = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nn,m = map(int,input().split(' '))\r\na = (m-1+month_day[n])//7\r\nb = (m-1+month_day[n])%7\r\nif b==0: print(a)\r\nelse: print(a+1)", "mm = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, 30, 31]\r\nm, d = map(int, input().split())\r\nprint((mm[m-1]+d-2)//7+1)\r\n", "import math\r\nmonth = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nn = [int(x) for x in input().split()]\r\nprint(math.ceil((month[n[0]-1]+n[1]-1)/7))", "import math\r\n\r\nm, d = map(int, input().split())\r\nif m == 2:\r\n if d > 1:\r\n print(5)\r\n else:\r\n print(4)\r\nelif d > 6:\r\n print(6)\r\nelif d < 6:\r\n print(5)\r\nelif d == 6:\r\n l = [1, 2, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1]\r\n if l[m - 1] == 0:\r\n print(5)\r\n else:\r\n print(6)\r\n", "a=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map (int,input().split())\r\nk=a[m-1]\r\nk+=(d-1)\r\nif k%7==0:\r\n print (k//7)\r\nelse :\r\n print (k//7+1)\r\n \r\n", "from math import ceil\r\nm, d = map(int, input().split())\r\nD = 28 if m==2 else (30 if m in (4,6,9,11) else 31)\r\nprint(1 + ceil((D-(8-d))/7))\r\n", "if __name__ == '__main__':\r\n refer = (0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)\r\n m, d = map(int, input().split())\r\n n = refer[m] + d - 8\r\n for i in range(1, 7):\r\n if n <= 0:\r\n print(i)\r\n break\r\n n -= 7\r\n", "\r\n(m, start) = list(map(int, input().split()))\r\ndays = 0\r\nif m in [1, 3, 5, 7, 8,10, 12]:\r\n days = 31\r\nelif m == 2:\r\n days = 28\r\nelse:\r\n days = 30\r\nresult = 1\r\ndays -= (7 - start + 1)\r\nresult += days // 7\r\nif days % 7 != 0:\r\n result += 1\r\nprint(result)", "#-*- coding:utf-8 -*-\n#/usr/bin/python3\n\nm, d = map(int, input().split())\ndays = {1:31, 2:28, 3:31, 4:30, 5:31, 6:30, 7:31, 8:31, 9:30, 10:31, 11:30, 12:31}\nans = 1\ndd = 9 - d\nwhile dd <= days[m]:\n\tans = ans + 1\n\tdd = dd + 7\n\nprint(ans)\n", "m,d = list(map(int, input().split()))\r\nif m == 4 or m == 6 or m == 9 or m == 11:\r\n n = 30\r\nelif m == 2:\r\n n = 28\r\nelse:\r\n n = 31\r\nif m == 2 and d == 1:\r\n print(4)\r\nelif n == 30 and d == 7:\r\n print(6)\r\nelif n == 31 and(d == 6 or d == 7):\r\n print(6)\r\nelse:\r\n print(5)", "m,d=map(int,input().split())\r\nl1=[1,3,5,7,8,10,12]\r\nl2=[2]\r\nl3=[4,6,9,11]\r\nif m in l1:\r\n if d<=5:\r\n print(5)\r\n else:\r\n print(6)\r\nelif(m in l2):\r\n if d==1:\r\n print(4)\r\n else:\r\n print(5)\r\nelse:\r\n if d<=6:\r\n print(5)\r\n else:\r\n print(6)", "m,d=map(int,input().split())\r\nkalendar=[[0 for i in range(7)] for j in range(6)]\r\nD=1\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n for i in range(6):\r\n for j in range(7):\r\n if d==0:\r\n kalendar[i][j]=D\r\n D+=1\r\n else:\r\n d-=1\r\n if D==31:\r\n print(i+1)\r\n exit()\r\nelif (m==4 or m==6) or (m==9 or m==11):\r\n for i in range(6):\r\n for j in range(7):\r\n if d==0:\r\n kalendar[i][j]=D\r\n D+=1\r\n else:\r\n d-=1\r\n if D==30:\r\n print(i+1)\r\n exit()\r\nelse:\r\n for i in range(6):\r\n for j in range(7):\r\n if d==0:\r\n kalendar[i][j]=D\r\n D+=1\r\n else:\r\n d-=1\r\n if D==28:\r\n print(i+1)\r\n exit()", "import math\r\nm,d = map(int, input() .split())\r\nif m == 1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n t = 31 - (8 - d)\r\n y = math.ceil(t / 7)\r\n print(y+1)\r\nelif m == 4 or m==6 or m==9 or m==11 :\r\n t = 30 - (8 - d)\r\n y = math.ceil(t / 7)\r\n print(y+1) \r\nelse:\r\n t = 28 - (8 - d)\r\n y = math.ceil(t / 7)\r\n print(y+1)", "m, d = map(int, input().split())\r\ncnt = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][m]\r\nans = 1\r\ncnt -= 8 - d\r\nwhile cnt > 0:\r\n ans += 1\r\n cnt -= 7\r\nprint(ans) ", "import math\r\nm,d=map(int,input().split())\r\nl=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nprint(math.ceil((l[m-1]-(8-d))/7)+1)\r\n", "a,b=map(int,input().split())\r\nif a==1 or a==3 or a==5 or a==7 or a==8 or a==10 or a==12:\r\n if b==1 or b==2 or b==3 or b==4 or b==5:\r\n print('5')\r\n elif b==6 or b==7:\r\n print('6')\r\nelif a==2:\r\n if b==1:\r\n print('4')\r\n else:\r\n print('5')\r\nelse:\r\n if b==7:\r\n print('6')\r\n else:\r\n print('5')\r\n", "from math import ceil\n\nm, dd = map(int, input().split())\n\nd = {1: 31, 2: 28, 3: 31, 4: 30, 5: 31, 6: 30, 7: 31, 8: 31, 9: 30, 10: 31, 11: 30, 12: 31}\n\nmd = d[m] + dd - 1\n\nprint(int(ceil(md / 7)))", "from math import ceil\n\n\ndef solve(m, d):\n x = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n return ceil((x[m-1] + d - 1)/7)\n\n\ndef main():\n m, d = list(map(int, input().split()))\n print(solve(m, d))\n\n\nmain()\n", "arr=list(map(int, input().split()))\nmonth=arr[0]\nday=arr[1]\nif month==1 or month==3 or month==5 or month==7 or month==8 or month==10 or month==12:\n d=31\nelif month==2:\n d=28\nelse:\n d=30\nc=1\nc1=(7-day)+1\nrem=d-c1\nc=c+rem//7\nif rem%7!=0:\n c=c+1\nprint(c)\n \t\t\t\t\t \t \t\t \t \t\t \t \t\t\t \t\t", "m,d=list(map(int,input().split()))\ndd = 31\nif m == 2: dd = 28\nif m == 4 or m == 6 or m == 9 or m == 11: dd = 30\na, dd = 1, dd - (8-d)\nwhile dd > 0:\n a, dd = a+1, dd-7\nprint(a)\n", "m, d = map(int, input().split())\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nif m==2 and d ==1:\r\n print(4)\r\nelif d <= 5 +(31 - days[m-1]):\r\n print(5)\r\nelse:\r\n print(6)", "month,day, = map(int, input().split())\r\n\r\nshort = [2]\r\nmid = [4, 6, 9, 11]\r\nlong = [1, 3, 5, 7, 8, 10, 12]\r\n\r\n\r\nif month in short:\r\n if day == 1:\r\n print(4)\r\n else:\r\n print(5)\r\n\r\nelif month in mid:\r\n if day == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if day in (6, 7):\r\n print(6)\r\n else:\r\n print(5)\r\n", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n\r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n\r\ndef solve():\r\n\tm,d=read_ints()\r\n\tmtod=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\n\tc=1 if d>1 else 0\r\n\tfor i in range(1, mtod[m]+1):\r\n\t\tif d==1:\r\n\t\t\tc+=1\r\n\t\tif d==7:\r\n\t\t\td=1\r\n\t\telse:\r\n\t\t\td+=1\r\n\tprint(c)\r\n\r\nsolve()\r\n", "import math\r\nm,d = map(int,input().split())\r\nnum_of_days = None\r\nif m in [1,3,5,7,8,10,12]:\r\n num_of_days=31\r\nelif m == 2:\r\n num_of_days=28\r\nelse:\r\n num_of_days=30\r\nprint(math.ceil((num_of_days-(7-d)-1)/7)+1)", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n[m, d] = list(map(int, input().split()))\r\nx = days[m-1]\r\nx += d-1\r\nres = (x+6)//7\r\nprint(res)", "m, d = list(map(int, input().split(' ')))\r\na = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nprint((a[m - 1] + d + 5) // 7)", "num_days = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nn, d = [int(x) for x in input().split()]\nd = d-1\nn2 = num_days[n-1]\nprint((n2+d-1)//7+1)", "import calendar\r\n\r\nm, d = map(int, input().split())\r\ndays = calendar.monthrange(2017, m)[1]\r\nweeks = (days + d - 1) // 7\r\nif (days + d - 1) % 7 != 0:\r\n weeks += 1\r\nprint(weeks)", "# your code goes here\r\na=list(map(int,input().split()))\r\ndayinm=[31,\t28,\t31,\t30,\t31,\t30,\t31,\t31,\t30,\t31,\t30,\t31]\r\nansw=(dayinm[a[0]-1]+a[1]-2)//7+1\r\nprint(answ)", "\r\nm, d = map(int, input().split())\r\n\r\nm31 = [1, 3, 5, 7, 8, 10, 12]\r\nm30 = [4, 6, 9, 11]\r\n\r\nif m in m31:\r\n\tdays = 31 - (8 - d)\r\n\tif days % 7 == 0:\r\n\t\tprint(days // 7 + 1)\r\n\telse:\r\n\t\tprint(days // 7 + 2)\r\nelif m in m30:\r\n\tdays = 30 - (8 - d)\r\n\tif days % 7 == 0:\r\n\t\tprint(days // 7 + 1)\r\n\telse:\r\n\t\tprint(days // 7 + 2)\r\n\r\nelse:\r\n\tdays = 28 - (8 - d)\r\n\tif days % 7 == 0:\r\n\t\tprint(days // 7 + 1)\r\n\telse:\r\n\t\tprint(days // 7 + 2)\r\n", "import itertools\r\n\r\n\r\ndef main():\r\n data = [31,\r\n28,\r\n31,\r\n30,\r\n31,\r\n30,\r\n31,\r\n31,\r\n30,\r\n31,\r\n30,\r\n31]\r\n n,m = [int(v) for v in input().split()]\r\n days = data[n-1] - (7-m+1)\r\n print((days)//7+1 if (days)%7==0 else (days)//7+2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m, d = [int(s) for s in input().split(\" \")]\r\ndays = 31\r\nif m in [4, 6, 9, 11]:\r\n days = 30\r\nelif m == 2:\r\n days = 28\r\nans = 1\r\ndays -= 7 - d + 1\r\nans += days//7\r\nif days%7:\r\n ans += 1\r\nprint(ans)", "\n\nmonths = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nm, d = map(int, input().split())\n\nprint(1 + (months[m] - (7 - d + 1) + 6) // 7)\n\n", "def col(m, d):\n months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n ans = (d - 1 + months[m - 1] - 1) // 7 + 1\n return ans\nmo, day = map(int, input().split())\nprint(col(mo, day))\n", "n,m=map(int,input().split())\r\na=[[0]*7]*6\r\ns=0\r\nif n==2:\r\n for i in range(6):\r\n for j in range(7):\r\n if m==1:\r\n s+=1\r\n a[i][j]=s\r\n else:m-=1\r\n if s==28:print(i+1);exit()\r\nelif n%2==0:\r\n if n<=7:\r\n for i in range(6):\r\n for j in range(7):\r\n if m==1:\r\n s+=1\r\n a[i][j]=s\r\n else:m-=1\r\n if s==30:print(i+1);exit()\r\n else:\r\n for i in range(6):\r\n for j in range(7):\r\n if m==1:\r\n s+=1\r\n a[i][j]=s\r\n else:m-=1\r\n if s==31:print(i+1);exit()\r\nelse:\r\n if n<=7:\r\n for i in range(6):\r\n for j in range(7):\r\n if m==1:\r\n s+=1\r\n a[i][j]=s\r\n else:m-=1\r\n if s==31:print(i+1);exit()\r\n else:\r\n for i in range(6):\r\n for j in range(7):\r\n if m==1:\r\n s+=1\r\n a[i][j]=s\r\n else:m-=1\r\n if s==30:print(i+1);exit()\r\n", "import math\r\nm,d=list(map(int,input().split()))\r\nx=(7-(d-1))\r\nif m==2:\r\n y=28-x\r\nelif m==4 or m==6 or m==9 or m==11:\r\n y=30-x\r\nelse:\r\n y=31-x\r\ns=1+(y/7)\r\ns=math.ceil(s)\r\nprint(s)\r\n", "dc = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nm, d = map(int, input().split())\nprint((dc[m] + d + 5) // 7)\n", "m,d = map(int, input().split())\r\nN = -1\r\nif m == 2:\r\n N = 28\r\nelif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12:\r\n N = 31\r\nelse:\r\n N = 30\r\nprint((d - 2 + N) // 7 + 1)", "n,m=map(int,input().split())\r\nl=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nk=l[n]+m-1\r\nif k%7==0 :\r\n print(k//7)\r\nelse :\r\n print((k//7)+1)\r\n", "n, m = list(map(int, input().split()))\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\ndays = days[n-1]\nfirst = 7 - m + 1\nlast = days - first\nweeks = last // 7 + 1\nif last % 7 != 0:\n weeks += 1\nprint(weeks)\n", "import sys\r\nimport math\r\n\r\nday_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\n# print(sum(day_month))\r\n\r\nm, d = map(int, input().split())\r\n\r\nans = 1 + math.ceil((day_month[m - 1] - (7 - d + 1)) / 7)\r\n\r\nprint(ans)", "import sys\na,b=input().split()\na=int(a)\nb=int(b)\nlk=0\nlk=int(lk)\nif a==2:\n if b!=1:\n print('5')\n sys.exit()\n else:\n print('4')\n sys.exit()\nif a==1 or a==3 or a==5 or a==7 or a==8 or a==10 or a==12:\n if b==6 or b==7:\n print('6')\n sys.exit()\n else:\n print('5')\n sys.exit()\nelse:\n if b==7:\n print('6')\n else:\n print('5')\n\n", "import math\r\nmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nstring = input()\r\nnumbers = string.split()\r\na, b = int(numbers[0]), int(numbers[1])\r\nprint(math.ceil((months[a - 1] + b - 8) / 7) + 1)", "(m,d)=list(map(int,input().split()))\r\na=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nk=a[m-1]\r\nif k==31:\r\n if d==6 or d==7:\r\n print(6)\r\n else:\r\n print(5)\r\nelif k==30:\r\n if d==7:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if d>1:\r\n print(5)\r\n else:\r\n print(4)\r\n", "dc = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = map(int, input().split())\r\nprint((dc[m] + d + 5) // 7)", "import math\r\na,b=map(int,input().split())\r\nk=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nprint(math.ceil((k[a-1]+b-1)/7))\r\n", "m,d=map(int, input().split())\r\ndulji=[1,3,5,7,8,10,12]\r\nkraci=[4,6,9,11]\r\ndani=0\r\nif m==2:\r\n dani=28\r\nelif m in dulji:\r\n dani=31\r\nelse:\r\n dani=30\r\ndani=dani+(d-1)\r\nif dani%7==0:\r\n print(dani//7)\r\nelse:\r\n print(dani//7+1)\r\n \r\n", "m, d = map(int, input().split())\r\nm31 = [1, 3, 5, 7, 8, 10, 12]\r\nm30 = [4, 6, 9, 11]\r\nif m in m31:\r\n if d == 6 or d == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nif m in m30:\r\n if d == 7:\r\n print(6)\r\n else:\r\n print(5)\r\nif m == 2:\r\n if d == 1:\r\n print(4)\r\n else:\r\n print(5)\r\n", "\r\nx,y = map(int,input().split())\r\nz=[31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\nk=(z[x-1] - (abs(y-7)+1))/7\r\nj=(z[x-1] - (abs(y-7)+1))%7\r\n\r\nif j==0:\r\n print(int(k+1))\r\nelse:\r\n print(int(k+2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "d = [-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nn, k = map(int, input().split())\nprint((d[n] - (7 - k + 1) + 6) // 7 + 1)", "n,m = [int(i) for i in input().split()]\r\nl = [31,28,31,30,31,30,31,31,30,31,30,31]\r\ndays = l[n-1]\r\nk = 1\r\ndays = days-8+m\r\nwhile 0 < days:\r\n\tdays = days-7\r\n\tk+=1\r\nprint(k)\r\n", "m, d = map(int, input().split())\r\na31 = [1, 3, 5, 7, 8, 10, 12]\r\nc = 30\r\nif m in a31:\r\n c = 31\r\nelif m == 2:\r\n c = 28\r\nc -= (8 - d)\r\nprint(1 + (c + 6) // 7)\r\n", "def myf(m, d):\r\n m = m - 1\r\n month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n \r\n #print (\"# month[m] = \", month[m])\r\n #print (\"# (month[m] + d) / 7 = \", int((month[m] + d) / 7))\r\n #print (\"# (month[m] + d) % 7 = \", int((month[m]+d) % 7))\r\n \r\n res = 0\r\n res += int((month[m] + d) / 7)\r\n if (int((month[m]+d) % 7)) > 1:\r\n res = res + 1 \r\n \r\n return (res)\r\nm, d = map(int, input().split())\r\nres = myf(m, d)\r\nprint (res) ", "mon = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nm, d = map(int, input().split())\r\nw1 = 8 - d\r\nother = mon[m-1] - w1\r\nprint(1 - ((-other) // 7))", "#!/usr/bin/env pypy3\r\n# -*- coding: UTF-8 -*-\r\nimport sys\r\nimport re\r\nimport math\r\nimport itertools\r\nimport collections\r\nimport bisect\r\n#sys.stdin=file('input.txt')\r\n#sys.stdout=file('output.txt','w')\r\n#10**9+7\r\nmod=1000000007\r\n#mod=1777777777\r\npi=3.1415926535897932\r\nIS=float('inf')\r\nxy=[(1,0),(-1,0),(0,1),(0,-1)]\r\nbs=[(-1,-1),(-1,1),(1,1),(1,-1)]\r\ndef niten(a,b): return abs(a-b) if a>=0 and b>=0 else a+abs(b) if a>=0 else abs(a)+b if b>=0 else abs(abs(a)-abs(b))\r\ndef fib(n): return [(seq.append(seq[i-2] + seq[i-1]), seq[i-2])[1] for seq in [[0, 1]] for i in range(2, n)]\r\ndef gcd(a,b): return a if b==0 else gcd(b,a%b)\r\ndef lcm(a,b): return a*b/gcd(a,b)\r\ndef eucl(x1,y1,x2,y2): return ((x1-x2)**2+(y1-y2)**2)**0.5\r\ndef choco(xa,ya,xb,yb,xc,yc,xd,yd): return 1 if abs((yb-ya)*(yd-yc)+(xb-xa)*(xd-xc))<1.e-10 else 0\r\ndef pscl(num,l=[1]):\r\n for i in range(num):\r\n l = map(lambda x,y:x+y,[0]+l,l+[0])\r\n return l\r\n\r\nm,d=[int(i) for i in input().split()]\r\nm0=[4,6,9,11]\r\nm1=[1,3,5,7,8,10,12]\r\nif m in m0:\r\n if d==7:\r\n ans=6\r\n else:\r\n ans=5\r\nelif m in m1:\r\n if d>=6:\r\n ans=6\r\n else:\r\n ans=5\r\nelse:\r\n if d==1:\r\n ans=4\r\n else:\r\n ans=5\r\nprint(ans)", "days = [\n\t31,\n\t28,\n\t31,\n\t30,\n\t31,\n\t30,\n\t31,\n\t31,\n\t30,\n\t31,\n\t30,\n\t31,\n]\n\nmonth, first = map(int, input().split())\nfirst -= 1\n\ncnt = 1\nx = days[month - 1] - (7 - first)\ncnt += x // 7\nif x % 7 != 0:\n\tcnt += 1\nprint(cnt) ", "from math import ceil\r\n\r\nM=[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\ntemp=input().split()\r\nm=int(temp[0])\r\nd=int(temp[1])\r\nt=M[m-1]+d-1\r\nprint(ceil(t/7))", "from math import ceil\r\nm,d=map(int,input().split())\r\nol=[1,3,5,7,8,10,12]\r\nel=[4,6,9,11]\r\nfeb=2\r\nif m in ol:\r\n\tdays=31\r\n\tdays-=(8-d)\r\n\tprint(ceil(days/7)+1)\r\nelif m in el:\r\n\tdays=30\r\n\tdays-=(8-d)\r\n\tprint(ceil(days/7)+1)\r\nelse:\r\n\tdays=28\r\n\tdays-=(8-d)\r\n\tprint(ceil(days/7)+1)", "m, d = input().split()\nm=int(m)\nd=int(d)\ndays=0\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\n days=31\nelif m==2:\n days=28\nelse:\n days=30\ndays+=d-1\nweeks=days//7\nif days%7>0:\n weeks+=1\nprint(weeks)", "from math import *\r\n\r\nm,d = map(int,input().split())\r\nif (m==1 or m==3 or m==5 or m==7 or m==8 or m == 10 or m == 12):\r\n ans = 31\r\nelif (m==2):\r\n ans = 28\r\nelse:\r\n ans = 30\r\n\r\nans -=(8-d)\r\ncnt = 1\r\ncnt += (ans + 6)//7\r\nprint(cnt)", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nm,d = map(int,input().split())\r\ndays = 31\r\nif m == 2:\r\n days = 28\r\nelif m == 4 or m == 6 or m == 9 or m == 11:\r\n days = 30\r\ndays -= 8 - d\r\nprint(1 + days // 7 + (days % 7 != 0))\r\n", "days = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = input().split(\" \")\r\nprint(round( ( days[int(m) - 1] - (8 - int(d)) ) / 7 + 1.49 ))", "import sys\r\nmonth=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nday=[7,6,5,4,3,2,1]\r\n\r\nm,d=map(int,input().split())\r\n\r\nd1=day[d-1]\r\nm1=month[m-1]\r\na = m1 - d1\r\nif( a % 7 == 0 ):\r\n res = 1 + (a / 7) \r\nelse:\r\n res =int( 2 + (a / 7))\r\nprint (int(res))\r\n", "m,d = list(map(int,input().split()))\r\nd31 = [1,3,5,7,8,10,12]\r\nd30 = [4,6,9,11]\r\n\r\nif m in d31:\r\n\tif d==6 or d==7:\r\n\t\tprint(6)\r\n\telse:\r\n\t\tprint(5)\r\nelif m in d30:\r\n\tif d==7:\r\n\t\tprint(6)\r\n\telse:\r\n\t\tprint(5)\r\nelse:\r\n\tif d==1:\r\n\t\tprint(4)\r\n\telse:\r\n\t\tprint(5)", "mon = [3, 0, 3, 2, 3, 2, 3, 3, 2, 3, 2, 3]\r\nm, d = map(int, input().split())\r\nprint(4 if d == 1 and m == 2 else (6 if mon[m-1] > 8 - d else 5))", "n=input().split()\r\nk=int(n[0])\r\nh=int(n[1])\r\nif (k==1) or (k==3) or (k==5) or (k==7) or (k==8) or (k==10) or (k==12):\r\n if (h==6) or (h==7):\r\n print(6)\r\n else:\r\n print(5)\r\nif k==2:\r\n if h==1:\r\n print(4)\r\n else:\r\n print(5)\r\nif (k==4) or (k==6) or (k==9) or (k==11):\r\n if (h==7):\r\n print(6)\r\n else:\r\n print(5)", "m,d=map(int,input().split())\r\ne=[4,6,9,11]\r\no=[1,3,5,7,8,10,12]\r\nf=[2]\r\nif m in e:\r\n if d in range(1,7):\r\n print(5)\r\n else:\r\n print(6)\r\nif m in o:\r\n if d in range(1,6):\r\n print(5)\r\n else:\r\n print(6)\r\nif m in f:\r\n if d==1:\r\n print(4)\r\n else:\r\n print(5)", "from math import ceil\r\nm,d=map(int,input().split())\r\na=[9,4,6,11]\r\nif m==2:\r\n\tprint(ceil((28-(7-d+1))/7)+1)\r\nelif m in a:\r\n\tprint(ceil((30-(7-d+1))/7)+1)\r\nelse:\r\n\tprint(ceil((31-(7-d+1))/7)+1)", "m,d=map(int,input().split())\r\nl=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nans=1\r\nt=l[m]\r\nt-=8-d\r\nwhile t>0:\r\n t-=7\r\n ans+=1\r\nprint(ans)", "import math\r\nm,d = map(int, input().split())\r\nmon = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nmonth=mon[m]\r\ncolumn=math.ceil((d + month - 1) / 7)\r\nprint(column)\r\n", "m, d = map(int, input().split())\nl = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nm -= 1\nt = l[m]\nfirst_col = 8 - d\nt -= first_col\nc = 1\nwhile t > 0:\n t -= 7\n c += 1\nprint(c)\n\n", "import math\r\ndays=[0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\nans=math.ceil((days[m]-8+ d)/7)+1\r\nprint(ans)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-20 13:29:08\nLastEditTime: 2021-11-20 13:33:44\nDescription: Peter and a calendar\nFilePath: CF760A.py\n'''\n\n\nfrom math import ceil\n\n\ndef func():\n m, d = map(int, input().strip().split())\n month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n print(ceil((month[m - 1] + d - 1) / 7))\n\n\nif __name__ == '__main__':\n func()\n", "m, d = map(int, input().split())\r\nif m==1:\r\n m = (d-1)+31\r\nelif m==2:\r\n m = (d-1)+28\r\nelif m==3:\r\n m = (d-1)+31\r\nelif m==4:\r\n m = (d-1)+30\r\nelif m==5:\r\n m = (d-1)+31\r\nelif m==6:\r\n m = (d-1)+30\r\nelif m==7:\r\n m = (d-1)+31\r\nelif m==8:\r\n m = (d-1)+31\r\nelif m==9:\r\n m = (d-1)+30\r\nelif m==10:\r\n m = (d-1)+31\r\nelif m==11:\r\n m = (d-1)+30\r\nelse: \r\n m = (d-1)+31\r\nans = int(m/7)\r\nif m%7!=0: ans = ans + 1\r\nprint(ans)", "a=[30,31]*9\na[2]=28\na[8:]=[31,30]*3\nm,d=map(int,input().split())\nprint(1--(a[m]+d-8)//7)\n \t\t\t \t\t\t\t\t\t \t\t\t \t\t \t\t\t \t \t\t\t \t", "m, d = map(int, input().split())\r\n\r\nif d == 1:\r\n print(5 - (m==2))\r\nelif d < 6:\r\n print(5)\r\nelif d == 6:\r\n print(6 - (m in (2, 4, 6, 9, 11)))\r\nelse:\r\n print(6 - (m==2))", "n, d = map(int, input().split())\r\nli = [0, 31, 28, 31, 30 ,31, 30, 31, 31, 30, 31, 30, 31]\r\nprint((li[n] + d + 5)//7)", "month, ref = [int(j) for j in input().split()]\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ncount, day = 1, 1\r\nwhile day < days[month - 1]:\r\n day += 1\r\n ref += 1\r\n if ref == 8:\r\n ref = 1\r\n count += 1\r\nprint(count)\r\n", "m, d = map(int, input().split())\r\n\r\n\r\n\r\nd -= 1\r\nans = 1\r\nds = 31\r\nif m in [4, 6, 9, 11]:\r\n ds = 30\r\nelif m == 2:\r\n ds = 28\r\nfor j in range(2, ds + 1):\r\n d += 1\r\n if d % 7 == 0:\r\n ans += 1\r\n\r\nprint(ans)", "days_in_month = {\n\t1: 31,\n\t2: 28,\n\t3: 31,\n\t4: 30,\n\t5: 31,\n\t6: 30,\n\t7: 31,\n\t8: 31,\n\t9: 30,\n\t10: 31,\n\t11: 30,\n\t12: 31\n}\n\nm, d = tuple(map(int, input().split()))\ndays = days_in_month[m]\ncol = 1\ndays -= (8-d)\ncol += (days // 7)\nif days % 7 > 0:\n\tcol += 1\n\nprint(col)\n", "n, m = map(int, input().split())\r\nds = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ne = ds[n - 1]\r\nq = e - (8 - m)\r\nr = q // 7\r\nans = 1 + r\r\nif q % 7 != 0:\r\n ans += 1\r\nprint(ans)", "m, d = list(map(int, input().split()))\r\n\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nimport math\r\nday = days[m-1]\r\nprint(math.ceil((day + d-1)/7))\r\n", "month, day = list(map(int, input().split()))\r\nmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nfs = 7 - day + 1\r\ncounter = 1\r\nwhile fs + 7 <= months[month - 1]:\r\n counter += 1\r\n fs += 7\r\nif (fs != months[month - 1]):\r\n counter += 1\r\nprint(counter)", "from math import ceil\r\n\r\nm, d = map(int,input().split())\r\na = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nn = a[m-1]\r\nprint(ceil((n-(8-d))/7)+1)", "m, d = list(map(int, input().split()))\r\nif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m == 10 or m == 12:\r\n x = 31\r\nelif m == 4 or m == 6 or m == 9 or m == 11:\r\n x = 30\r\nelse:\r\n x = 28\r\nx -= (8 - d)\r\nans = 1\r\nwhile x > 0:\r\n x -= 7\r\n ans += 1\r\nprint(ans)\r\n", "arr = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\n\r\nm,d = map(int,input().split())\r\n\r\ndays = arr[m]\r\n\r\ndays -= (7-d+1)\r\n\r\nprint( (days+6)//7+1)", "a,b=map(int,input().split())\r\nif b<=5 and a!=2:\r\n\tprint(5)\r\nelif a==2:\r\n\tif b==1 :\r\n\t\tprint(4)\r\n\telse:\r\n\t\tprint(5)\r\nelse:\r\n\tif a in [1,3,5,7,8,10,12]:\r\n\t\tprint(6)\r\n\telse:\r\n\t\tif b==6:\r\n\t\t\tprint(5)\r\n\t\telse:\r\n\t\t\tprint(6)\r\n", "import math\r\ndays = [0,31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\nans = math.ceil((days[m]+d-1)/7)\r\nprint(ans)", "import sys\r\n\r\ndef main():\r\n m, d = map(int, sys.stdin.read().strip().split())\r\n if m == 2: return d == 1 and 4 or 5\r\n if m in {4, 6, 9, 11}: return d == 7 and 6 or 5\r\n return d > 5 and 6 or 5\r\n\r\nprint(main())\r\n", "a, b, = map(int, input().split())\r\nif (a == 1 or a == 3 or a == 5 or a == 7 or a == 8 or a == 10 or a == 12) and b > 5:\r\n print(6)\r\nelif (a == 1 or a == 3 or a == 5 or a == 7 or a == 8 or a == 10 or a == 12) and b <= 5:\r\n print(5)\r\nif (a == 4 or a == 6 or a == 9 or a == 11) and b > 6:\r\n print(6)\r\nelif (a == 4 or a == 6 or a == 9 or a == 11) and b <= 6:\r\n print(5)\r\nif (a == 2 and b == 1):\r\n print(4)\r\nelif (a == 2 and b > 1):\r\n print(5)", "from math import ceil\r\nm, d = map(int,input().split())\r\ndays = {1:31,2:28,3:31,4:30,5:31,6:30,7:31,8:31,9:30,10:31,11:30,12:31}\r\na = days[m] - (8-d)\r\nb = ceil(a/7)\r\nprint(b+1)", "from calendar import monthrange\r\n\r\n\r\ndef read(type=int):\r\n return type(input())\r\n\r\n\r\ndef read_arr(type=int):\r\n return [type(token) for token in input().split()]\r\n\r\ndef days(m):\r\n if m == 2:\r\n return 28\r\n if m in {1,3,5,7,8,10,12}:\r\n return 31\r\n return 30\r\n\r\ndef run():\r\n m, d = map(int, input().split())\r\n d -= 1\r\n w, n = monthrange(2017, m)\r\n ans = 1\r\n arr = [0 for i in range(7)]\r\n\r\n while n > 0:\r\n arr[d] = ans\r\n d += 1\r\n if d % 7 == 0:\r\n ans += 1\r\n d %= 7\r\n n -= 1\r\n print(max(arr))\r\n\r\ndef run2():\r\n m, d = read_arr()\r\n w, n = monthrange(2017, m)\r\n ans = 1\r\n i = d % 7\r\n for k in range(n):\r\n i = (i + 1) % 7\r\n if i % 7 == 1:\r\n ans += 1\r\n print(ans)\r\n\r\nrun()\r\n", "m, d = map(int, input().split())\r\n\r\nk = abs(7-d)\r\ncounter = 1\r\nfinal = k + 1\r\ndurations = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\np = durations[m-1]\r\n\r\nwhile final < p:\r\n counter += 1\r\n final += 7\r\n if final > p:\r\n break\r\n\r\nprint(counter)", "month, day = map(int, input().split())\r\n\r\nans = 1\r\ncnt = 1\r\n\r\nkostyl = {1:31, 2:28, 3:31, 4:30, 5:31, 6:30, 7:31, 8:31, 9:30, 10:31, 11:30, 12:31}\r\n\r\nwhile cnt <= kostyl[month]:\r\n day += 1\r\n if day > 7 and cnt != kostyl[month]:\r\n day = 1\r\n ans += 1\r\n cnt += 1\r\nprint(ans)", "import sys\nm, d = input().split()\nm = int(m)\nd = int(d)\nt = 0\nx = 0\n\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\n x = (31-(8-d))\n if(x%7>0):\n t = x//7 + 2\n else:\n t = x//7 +1 \n print(t)\n\n\nelif m==2:\n x = (28-(8-d))\n if(x%7>0):\n t = x//7 + 2\n else:\n t = x//7 +1\n print(t)\n\n\nelse:\n x = (30-(8-d))\n if(x%7>0):\n t = x//7 +2\n else:\n t = x//7 +1\n print(t)\n", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nm,d=map(int,input().split())\r\na=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nm=a[m-1];E=1\r\nm-=(8-d)\r\nE+=m//7+int(m%7!=0)\r\nprint(E)", "''' Read input from STDIN. Print your output to STDOUT '''\r\n\r\n\r\n# Use input() to read input from STDIN and use print to write your output to STDOUT\r\n\r\ndef main():\r\n #m = int(input())\r\n #d = int(input())\r\n dim = list(map(int,input().split()))\r\n if dim[0] == 2:\r\n if dim[1] > 1:\r\n print(5, end=\"\")\r\n else:\r\n print(4, end=\"\")\r\n return\r\n else:\r\n if dim[0] in [1, 3, 5, 7, 8, 10, 12]:\r\n if dim[1] <= 5:\r\n print(5, end=\"\")\r\n else:\r\n print(6, end=\"\")\r\n return\r\n else:\r\n if dim[1] <= 6:\r\n print(5, end=\"\")\r\n else:\r\n print(6, end=\"\")\r\n return\r\n\r\n\r\nmain()\r\n\r\n", "m, d=map(int, input().split())\r\nmn={1:31,2:28,3:31,4:30,5:31,6:30,7:31,8:31,9:30,10:31,11:30,12:31}\r\nprint((d-1+mn[m]-1)//7+1)", "from sys import stdin\nimport math\n\ndays_in_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nM, D = map(int, stdin.readline().split())\nM -= 1\nD -= 1\n\nprint(math.ceil((days_in_month[M] + D) / 7))\n", "m,d=map(int,input().split())\r\nl=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nprint((d-1+l[m-1]-1)//7+1)\r\n", "m,d =map(int, input().split())\r\nif (m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12):\r\n n=31\r\nelif m==2:\r\n n=28\r\nelse:\r\n n=30\r\nif (n==28):\r\n if d==1:\r\n print(4)\r\n else:\r\n print(5)\r\nelif n==30:\r\n if d==7:\r\n print(6)\r\n else:\r\n print(5)\r\nelif n==31:\r\n if (d==7 or d==6):\r\n print(6)\r\n else:\r\n print(5)", "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\nm,d=M()\r\nif m==1 or m==3 or m==5 or m==7 or m==8 or m==10 or m==12:\r\n if d<6:\r\n print(5)\r\n else:\r\n print(6)\r\nelif m==2:\r\n if d==1:\r\n print(4)\r\n else:\r\n print(5)\r\nelse:\r\n if d==7:\r\n print(6)\r\n else:\r\n print(5)\r\n", "import calendar\r\nimport math\r\n\r\nval = list(map(int, input().split()))\r\n\r\nn = calendar.mdays[val[0]]\r\n\r\nn = n - (7 - val[1] + 1)\r\n\r\nw = n/7\r\nr = n % 7\r\nif r == 0:\r\n\tprint(int(w+1))\r\nelse:\r\n\tprint(int(math.floor(w) + 2))\r\n", "m, d = map(int, input().split())\r\n\r\ndays_in_month = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ntotal_days = days_in_month[m]\r\ncolumns = (total_days + d - 1 + 6) // 7\r\nprint(columns)\r\n\r\n\r\n", "m, d = map(int, input().split())\r\n\r\nn = 28\r\nif m in [1, 3, 5, 7, 8, 10, 12]:\r\n n = 31\r\nelif m in [4, 6, 9, 11]:\r\n n = 30\r\n\r\nn -= 7 - d + 1\r\nprint(n // 7 + (1 if n % 7 == 0 else 2))\r\n", "import sys \r\ninput = sys.stdin.readline \r\n\r\nm, d = map(int, input().split()) \r\nd31 = [1, 3, 5, 7, 8, 10, 12]\r\nd30 = [4, 6, 9, 11]\r\nd28 = [2] \r\nif(m in d31):\r\n if(d >= 6):\r\n print(6)\r\n else:\r\n print(5)\r\nelif(m in d30):\r\n if(d >= 7):\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if(d >= 2):\r\n print(5) \r\n else:\r\n print(4)", "m, d = map(int, input().split())\r\nfrom calendar import monthrange\r\n \r\nx = monthrange(2017, m)[1]\r\n \r\nif x == 28:\r\n if d == 1:\r\n print(4)\r\n else:\r\n print(5)\r\n \r\nelif x == 31:\r\n if d == 7 or d == 6:\r\n print(6)\r\n else:\r\n print(5)\r\nelse:\r\n if d == 7:\r\n print(6)\r\n else:\r\n print(5)", "def main():\n days_in_month = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n [month, first_day] = [int(_) for _ in input().split()]\n n_days = days_in_month[month]\n\n # first_week\n n_weeks = 1\n n_days -= (8 - first_day)\n\n # next weeks\n n_weeks += (n_days // 7)\n n_days %= 7\n\n # last week\n if n_days > 0:\n n_weeks += 1\n\n print(n_weeks)\n\n\nif __name__ == '__main__':\n main()\n", "z = input().split(\" \")\r\n#for i in range(0, n): \r\n# z[i] = int(z[i])\r\n\r\nm = int(z[0])\r\nd = int(z[1])\r\n\r\nmonth30 = [4, 6, 9, 11]\r\nmonth31 = [1, 3, 5, 7, 8, 10, 12]\r\n\r\nif m == 2 and d == 1:\r\n print(4)\r\n exit\r\nelif m == 2 and d != 1:\r\n print(5)\r\n exit\r\nelif m in month30 and d < 7:\r\n print(5)\r\n exit\r\nelif m in month30 and d == 7:\r\n print(6)\r\n exit\r\nelif m in month31 and d < 6:\r\n print(5)\r\n exit\r\n exit\r\nelif m in month31 and d >= 6:\r\n print(6)\r\n exit\r\nelse:\r\n print(\"Ошибка\")\r\n\r\n\r\n\r\n", "month, first_day = (int(x) for x in input().split())\r\n\r\nmonth_to_len = {1: 31, 2: 28,\r\n 3: 31, 4: 30,\r\n 5: 31, 6: 30,\r\n 7: 31, 8: 31,\r\n 9: 30, 10: 31,\r\n 11: 30, 12: 31\r\n }\r\n \r\nlen_to_start = {28: 1, \r\n 30: 6, \r\n 31: 5\r\n }\r\n \r\nlen_to_min_columns = {28: 4,\r\n 30: 5,\r\n 31: 5\r\n }\r\n\r\nmonth_len = month_to_len[month]\r\ncolumns_nr = len_to_min_columns[month_len]\r\nif first_day > len_to_start[month_len]:\r\n columns_nr += 1\r\n print(columns_nr)\r\nelse:\r\n print(columns_nr)\r\n \r\n", "import sys\r\n\r\nfin = sys.stdin\r\nfout = sys.stdout\r\ndays = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm, d = map(int, fin.readline().split())\r\nans = (days[m - 1] - (7 - d + 1)) // 7 + 1\r\nif (days[m - 1] - (7 - d + 1)) % 7 != 0:\r\n ans += 1\r\nfout.write(str(ans))\r\n", "def codeforces(m, d):\r\n if m == 2:\r\n days = 28\r\n elif m in [1, 3, 5, 7, 8, 10, 12]:\r\n days = 31\r\n else:\r\n days = 30\r\n days -= (8 - d)\r\n weeks = 1 + days // 7\r\n if days % 7:\r\n weeks += 1\r\n return weeks\r\n\r\n\r\nm, d = map(int, input().split())\r\nprint(codeforces(m, d))\r\n", "array = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\na = input()\r\nfor i in range(0, len(a)):\r\n if a[i] == ' ':\r\n break\r\nb = array[int(a[0 : i]) - 1]\r\nc = int(a[i + 1 : ])\r\nb -= (8 - c)\r\nd = 1\r\nwhile b > 7:\r\n d += 1\r\n b -= 7\r\nd += 1\r\nprint(d)\r\n", "m, d = [int(i) for i in input().split()]\r\ng = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nm -= 1\r\nal = g[m]\r\np = 1 + (7- d)\r\nal -= p\r\nprint(al//7 + (al%7 != 0) + 1)", "a=[31,28,31,30,31,30,31,31,30,31,30,31]\r\nn,m=map(int,input().split())\r\nr=a[n-1]\r\nt=8-m\r\nu=r-t\r\ny=u%7\r\ng=int(u/7)\r\nif y==0:\r\n\tprint(g+1)\r\nelse:\r\n\tprint(g+2)\r\n", "month = [31,28,31,30,31,30,31,31,30,31,30,31]\r\nm,d=map(int,input().split())\r\ntot = month[m-1]\r\nc = d\r\nans = 1\r\nwhile(tot>0):\r\n\tc+=1\r\n\ttot-=1\r\n\tif(c==8 and tot!=0):\r\n\t\tc=1\r\n\t\tans+=1\r\nprint(ans)", "months = {1: 31, 2:28, 3: 31, 4: 30, 5:31, 6:30, 7:31, 8:31, 9:30, 10:31, 11:30, 12:31}\n\nm,d = [int(x) for x in input().split(' ')]\n\nd1 = 7-d+1\ncount=1\n\nd2=months[m]-d1\ncount += int(d2/7)\n\nrem = d2%7\nif(rem!=0):\n\tcount+=1\nprint (count)", "from math import ceil as c\r\nm, d = map(int, input().split())\r\n\r\nmonths = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nprint(c(((d-1)+months[m])/7))\r\n" ]

[ "n = int(input())\nrow = input()\n\nrow_arr = row.split(\"W\")\n\nrow_arr = [i for i in row_arr if i != '']\n\nprint(len(row_arr))\n\n#print(row_arr) # debugging\n\nfor i in row_arr:\n print(len(i),end=\" \")\n\n \t \t\t \t \t\t \t\t \t\t \t\t\t\t", "def Remove(s):\r\n a = []\r\n for i in range(len(s)):\r\n if len(s[i]) == 0:\r\n a.append(i)\r\n a.reverse()\r\n for i in a:\r\n del s[i]\r\n return s\r\n\r\ndef Print(s):\r\n print(len(s))\r\n for i in s:\r\n print(len(i),end=' ')\r\n\r\nn = int(input())\r\ns = list(map(str,input().split('W')))\r\ns = Remove(s)\r\nPrint(s)", "n = int(input())\r\nli = input().strip('W').split('W')\r\nr = []\r\nfor i in li:\r\n if i: r.append(len(i))\r\nprint(len(r))\r\nprint(*r)", "n=int(input())\r\ns=input()\r\nx=[]\r\nc=0\r\nfor i in s:\r\n if(i==\"B\"):\r\n c+=1\r\n else:\r\n if(c!=0):\r\n x.append(c)\r\n c=0\r\nif(c>0):\r\n x.append(c)\r\nif(len(x)>0):\r\n print(len(x))\r\n print(*x)\r\nelse:\r\n print(0)", "import array as arr\n\nn = int(input())\n#print(type(n))\nstring = input()\nlst = []\n#for i in word:\n#\tlst.append(i)\nlst = list(string)\n\nflag = 0\narr = [0] * (100)\nk = 0\ni = 0\nwhile (i < n):\n\tif (lst[i] == 'B'):\n\t\tflag += 1\n\t\twhile (i < n and lst[i] == 'B'):\n\t\t\tarr[k] += 1\n\t\t\ti += 1\n\t\tk += 1\n\telse:\n\t\ti += 1\nprint(flag)\ni = 0\nwhile (i < flag):\n\tprint(arr[i], end = \" \")\n\ti += 1\nprint()\n\n\n", "# get input\nN = int(input())\nsquare_str = input()\n\nprevious = 'W'\n\nB_cnt = 0\nresults = []\n\nfor i in range(N):\n if square_str[i] == 'B':\n if previous == 'B':\n B_cnt += 1\n else:\n # '...WB...', recount\n B_cnt = 1\n previous = 'B'\n else: # get 'W'\n if previous == 'W':\n continue\n else:\n # '..BW...'\n results.append(B_cnt)\n previous = 'W'\n\nif square_str[-1] == 'B':\n results.append(B_cnt)\n\nprint(len(results))\nprint(*results)\n\n\t\t \t \t \t\t \t \t\t\t \t\t \t \t", "n = int(input())\r\ns = input().split('W')\r\nresult = []\r\nfor x in s:\r\n if len(x) > 0:\r\n result.append(len(x))\r\nresult = [str(x) for x in result]\r\nprint(len(result))\r\nprint(' '.join(result))\r\n", "input()\nx = [len(y) for y in input().split('W') if y]\nprint(len(x))\nprint(*x)\n \t \t\t\t \t\t \t\t \t\t\t\t \t\t\t\t\t\t\t \t", "input()\r\na = [len(i) for i in input().split('W') if i]\r\nprint(len(a), *a)", "n=int(input())\r\ns=str(input())\r\np=0;s+='1'\r\narr=[]\r\nfor i in s:\r\n if i=='B':\r\n p+=1\r\n else:\r\n if p!=0:\r\n arr.append(p)\r\n p=0\r\nprint(len(arr))\r\nfor i in range(len(arr)):\r\n print(arr[i],end=' ')", "n=int(input())\r\ns=input()\r\na=[]\r\ni=0\r\nc=1\r\nwhile(i<n):\r\n if(s[i]=='B'):\r\n if(i!=n-1 and s[i+1]=='B'):\r\n c+=1 \r\n else:\r\n a.append(c)\r\n c=1\r\n i+=1\r\nprint(len(a))\r\nif(len(a)!=0):\r\n print(*a)\r\n ", "# HW 4a\n\n# input n, length of the row\nn = input()\nn = int(n)\n\n#input string of W and B\nWB = input()\n\n\ngroups = []\nwas_white = True\ni = 0\nwhile i < n:\n if WB[i] == 'B':\n if was_white:\n groups.insert(len(groups), 1)\n else:\n groups[len(groups) - 1] += 1\n was_white = False\n else:\n was_white = True\n i += 1\n\n\n# output k, the number of groups of black squares\n# print number of things in list B\nprint(len(groups))\n\n# output k integers that sequentially lists the size of each group of black squares\n# print list B\nprint(*groups)\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\ns=str(input())\r\nl=[]\r\ne=0\r\nfor i in range(0,len(s)):\r\n if(s[i]=='B'):\r\n e=e+1\r\n else:\r\n if(e>0):\r\n l.append(e)\r\n e=0\r\n else:\r\n pass\r\nif(e>0):\r\n l.append(e)\r\nprint(len(l))\r\nprint(*l)", "if __name__ == '__main__':\n k = int(input())\n squares = input().split('W')\n \n aux = []\n for b in squares:\n if b != '':\n aux.append(len(b))\n \n if aux:\n print(len(aux))\n print(*aux)\n else:\n print(0)\n\t \t \t \t\t \t\t\t\t\t \t\t \t \t\t \t", "n=int(input())\r\ns=input()\r\nli=[]\r\nx=0\r\nfor i in s:\r\n if i=='B':x+=1\r\n elif i=='W'and x!=0:\r\n li.append(x)\r\n x=0\r\nif(s[len(s)-1]=='B'):li.append(x)\r\nprint(len(li))\r\nfor i in li:\r\n print(i,end=\" \")\r\n", "def solve():\r\n n = int(input())\r\n stri = input()\r\n stri = stri.split(\"W\")\r\n elem = []\r\n for element in stri:\r\n if \"B\" in element:\r\n elem.append(element)\r\n print(len(elem))\r\n for x in elem:\r\n print(len(x), end=\" \")\r\n\r\nsolve()\r\n", "n = int(input())\r\ns = [i for i in input()]\r\nres = []\r\nx = 0\r\nfor i in range(n):\r\n if i == n - 1:\r\n if s[i] == 'B':\r\n x += 1\r\n res.append(x)\r\n break\r\n else:\r\n if s[i] == 'B':\r\n x += 1\r\n \r\n if s[i] == 'B' and s[i+1] == 'W':\r\n res.append(x)\r\n x = 0\r\n continue\r\nprint(len(res))\r\nprint(*res)", "n=int(input())\r\nl=[len(i) for i in input().split('W') if i]\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\nbw = input()\nb = bw.replace(\"W\", \" \").split()\nprint(len(b))\nfor i in b :\n print(len(i), end = \" \")\n \t \t \t \t \t \t\t \t\t\t \t\t", "import math\r\nt = int(input())\r\ns = str(input())\r\nans = []\r\nk = 0\r\n\r\nfor i in range(t):\r\n if s[i] == \"B\":\r\n k += 1\r\n else:\r\n if k != 0:\r\n ans.append(k)\r\n k = 0\r\nif k != 0:\r\n ans.append(k)\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i], end = \" \")\r\n", "input()\ni=[*map(len,filter(None,input().split('W')))]\nprint(len(i),'\\n',*i)\n \t\t\t \t \t \t \t\t \t \t \t \t\t", "n = int(input())\ns = input()\nlst = []\ncnt = 0\nfor i in range(n):\n if s[i] == 'B': cnt += 1\n elif cnt != 0: \n lst.append(cnt)\n cnt = 0\nif cnt != 0: \n lst.append(cnt)\nprint(len(lst))\nprint(*lst)\n\t \t\t \t \t \t \t \t \t \t", "input()\na = input().split('W')\nb = [len(i) for i in a if len(i)>0]\nprint(len(b))\nprint(*b)\n\t \t \t \t \t\t \t\t\t \t \t\t\t \t", "n = int(input())\r\ns = input()\r\nl = list(s.split('W'))\r\ncount = 0\r\nsize = []\r\nfor i in range(len(l)):\r\n\tif len(l[i]) != 0:\r\n\t\tcount+=1\r\n\t\tsize.append(len(l[i]))\r\nprint(count)\r\nfor i in size:\r\n\tprint(i,end=\" \")", "n = int(input())\r\na = input()\r\ncount = count1 = status = 0\r\nb = []\r\nfor i in range(n):\r\n\tif a[i]=='B':\r\n\t\tcount+=1\r\n\t\tstatus = 1\r\n\telif a[i] == 'W' and status == 1:\r\n\t\tb.append(count)\r\n\t\tcount1+=1\r\n\t\tcount = status = 0\r\n\tif i==n-1 and a[i]=='B':\r\n\t\tb.append(count)\r\n\t\tcount1+=1\r\nprint(count1)\r\nif count1!=0:\r\n\tfor i in range(len(b)):\r\n\t\tprint(b[i], end = ' ')", "def main():\n n = int(input())\n grupos = input().split('W', n)\n tamanhos = []\n\n for i in range(len(grupos)):\n if len(grupos[i]) != 0:\n tamanhos.append(len(grupos[i]))\n\n print(len(tamanhos))\n print(*tamanhos, sep=\" \")\n\n\nif __name__ == '__main__':\n main()\n\n \t \t \t\t\t\t \t\t \t\t\t\t \t\t\t\t\t", "n = int(input())\nstr = input()\narray = str.split(\"W\")\nlength = len(array)\na = 0\nfor i in range(length):\n if array[a] == \"\":\n del array[a]\n length -= 1\n else:\n a += 1\n\nprint(len(array))\nfor a in range(len(array)):\n print(len(array[a]), end=\" \")\nprint()\n \t\t \t\t \t \t \t\t\t\t \t \t", "n = int(input())\ns = input().split('W')\n\nf = [len(i) for i in s if len(i) > 0]\nprint(len(f))\nfor i in f:\n print(i)\n \t \t\t\t \t\t\t \t \t \t \t\t \t\t \t \t \t", "from itertools import groupby\n\nch_cnt = int(input())\nstring = input()\n\ntmp = [str(len(tuple(g))) for k, g in groupby(string) if k == 'B']\nprint(len(tmp))\nprint(' '.join(tmp))", "from itertools import groupby\ninput()\ns = input()\nx = [len(list(y)) for x, y in groupby(s) if x == \"B\"]\nprint(len(x))\nprint(*x)\n", "\r\nn = int(input())\r\nl = list(input())\r\nng = 0\r\nl1 = []\r\nco = 1\r\n\r\nfor i in range(n-1):\r\n\tif l[i] == 'B' and l[i + 1] == 'W':\r\n\t\tl1.append(co)\r\n\t\tco = 1\r\n\t\tng += 1\r\n\telif l[i] == 'B':\r\n\t\tco += 1\r\nif l[-1] == 'B':\r\n\tl1.append(co)\r\n\tng += 1\r\n\r\n\r\nprint(ng)\r\nprint(*l1,sep = ' ')\r\n", "n=int(input())\r\ns=list(input().split('W'))\r\nf=[len(i) for i in s if i!='']\r\nprint(len(f))\r\nprint(*f)", "n=int(input())\r\nx=input().split('W')\r\ns=''\r\na=0\r\nfor i in x:\r\n if i=='':\r\n continue\r\n else:\r\n s+=str(i.count('B'))+' '\r\n a+=1\r\nprint(a)\r\nprint(s)", "n = int(input()) #igual ao comprimento da lista cryp\r\ncryp = list(input())\r\ncount_B = 0\r\n\r\nlista = list()\r\n\r\nfor i in range(0, n):\r\n if cryp[i] == \"B\":\r\n count_B += 1\r\n if i == n - 1:\r\n lista.append(count_B)\r\n else:\r\n lista.append(count_B)\r\n count_B = 0\r\n\r\nfor j in range(lista.count(0)):\r\n lista.remove(0)\r\n\r\nif len(lista) == 0:\r\n print(0)\r\nelse:\r\n print(len(lista))\r\n print(*lista)", "n=int(input())\r\na=input()\r\ns=0\r\nc=[]\r\nfor i in range(n):\r\n if a[i]=='B':\r\n s=s+1\r\n else:\r\n if s!=0:\r\n c.append(s)\r\n s=0\r\nif s!=0:\r\n c.append(s)\r\nprint(int(len(c)))\r\nfor i in c:\r\n print(i,end=' ')\r\n", "import math\r\nfrom sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = str_input()\r\n cnt = 0\r\n a = []\r\n for i in range(n):\r\n if i > 0 and s[i] == 'W' and s[i-1] == 'B':\r\n a.append(cnt)\r\n cnt = 0\r\n if s[i] == 'B':\r\n cnt += 1\r\n if cnt:\r\n a.append(cnt)\r\n print(f\"{len(a)}\\n\")\r\n for i in a:\r\n print(f\"{i} \")\r\n print(\"\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na=input().split('W')\r\nv=[len(x) for x in a if len(x)>0]\r\nprint(len(v))\r\nprint(*v)", "n=int(input())\r\nm=list(input().split('W'))\r\nwhile(\"\" in m) :\r\n m.remove(\"\")\r\np=[]\r\nfor i in m:\r\n p.append(len(i))\r\nprint(len(m))\r\nprint(*p)\r\n", "# cf 721 A 700\nn = int(input())\ns = input()\nR = []\n\ncur = 0\nfor i in range(len(s)):\n if s[i] == 'B':\n cur += 1\n else:\n assert s[i] == 'W'\n if cur > 0:\n R.append(cur)\n cur = 0\nif cur > 0:\n R.append(cur)\n\nprint(len(R))\nprint(\" \".join(map(str, R)))\n", "n = int(input())\r\nBW = input()\r\ncounter = 0\r\ngrp = 0\r\ningrp = []\r\nfor i in range (0, n) :\r\n if BW[i] == \"B\" :\r\n counter +=1\r\n else :\r\n if counter > 0 :\r\n ingrp.append(counter)\r\n counter = 0\r\n grp += 1\r\nif counter > 0 :\r\n ingrp.append(counter)\r\n counter = 0\r\n grp += 1\r\n\r\nfinal = \"\"\r\nprint(grp)\r\nfor i in range (0, grp) :\r\n if final == \"\" :\r\n final = str(ingrp[i])\r\n else :\r\n if ingrp[i] != \"\" :\r\n final = final + \" \" + str(ingrp[i])\r\n\r\nif final != \"\" :\r\n print(final)\r\n", "# cite source: https://www.geeksforgeeks.org/python-split-multiple-characters-from-string/\n# https://www.geeksforgeeks.org/print-lists-in-python-4-different-ways/\nn = int(input())\nz = list(input().split('W')) # example: ['', 'BBBB', '', 'B', 'BBB', '']\na = [len(i) for i in z if i != ''] # length counter for z\nprint(len(a)) # prints number of groups \nprint(*a) \n \t \t \t \t \t \t\t \t\t \t\t", "n=int(input())\r\nz=input()\r\narr=[]\r\ncount=0\r\nfor i in range(n) :\r\n\tif z[i]==\"B\" :\r\n\t\tcount+=1\r\n\telse :\r\n\t\tif count>0 :\r\n\t\t\tarr.append(count)\r\n\t\t\tcount=0\r\n\r\nif count>0 :\r\n\tarr.append(count)\r\n\r\nprint(len(arr))\r\nfor i in range (len(arr)) :\r\n\tif i==len(arr)-1 :\r\n\t\tprint(arr[i])\r\n\telse :\r\n\t\tprint(arr[i],end=\" \")", "b = []\r\nn = int(input())\r\ns = input()\r\nnow = 0\r\nfor i in s:\r\n if i == 'B':\r\n now += 1\r\n else:\r\n if now > 0:\r\n b.append(now)\r\n now = 0\r\nif now > 0:\r\n b.append(now)\r\nprint(len(b))\r\nprint(*b)", "n = int(input())\na = input().replace('W', ' ').split()\nprint(len(a))\nfor i in a:\n print(len(i), end=' ')\n", "n=int(input())\r\na=list(len(ch) for ch in input().split(\"W\"))\r\nwhile 0 in a:\r\n\ta.remove(0)\r\nprint(len(a))\r\nprint(*a)\r\n", "n = int(input())\r\nlst = input().split(\"W\")\r\nres = [len(x) for x in lst if len(x) > 0]\r\nprint(len(res))\r\nif len(res) > 0: print(\" \".join(str(x) for x in res))", "def solve(test):\r\n ans = []\r\n n = int(input())\r\n s = input() + 'W'\r\n tmp = 0\r\n for c in s:\r\n if c == 'B':\r\n tmp += 1\r\n else:\r\n if tmp > 0:\r\n ans.append(tmp)\r\n tmp = 0\r\n print(len(ans))\r\n print(*ans)\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "n=int(input())\ns=input()\ni=0\nans=0\nlst=[]\nwhile i<n:\n cnt=0\n while i<n and s[i]==\"B\":\n cnt+=1\n i+=1\n if cnt>0:\n lst.append(cnt)\n ans+=1\n i-=1\n i+=1\nprint(ans)\nfor num in lst:\n print(num,end=\" \")\n", "def solve(n,s):\r\n l = []\r\n count = 0\r\n i = 0\r\n while i < n:\r\n if s[i] == \"W\":\r\n i+=1\r\n continue\r\n temp = 0\r\n if s[i] == \"B\" :\r\n count += 1\r\n while i<n and s[i] == \"B\":\r\n temp += 1\r\n i += 1\r\n l.append(temp)\r\n print(count)\r\n for i in l:\r\n print(i,end = \" \")\r\n# n,k,x = map(int,input().split())\r\n# a = int(input())\r\n# b = int(input())\r\nc = int(input())\r\n# l = list(map(int,input().split()))\r\ns = input()\r\n# print(solve(c,s))\r\nsolve(c,s)\r\n\r\n\r\n\r\n", "n = int(input())\r\na = input()\r\na += \"W\"\r\nk = 0\r\nx = []\r\nfor i in range(n + 1):\r\n\tif a[i] == \"W\":\r\n\t\tif k != 0:\r\n\t\t\tx.append(k)\r\n\t\tk = 0\r\n\telse:\r\n\t\tk += 1\r\nprint(len(x))\r\nprint(*x)\r\n", "_ = input()\r\ns = input()\r\n\r\nt = 0\r\nl_t = list()\r\n\r\nfor c in s:\r\n if c == \"B\":\r\n t += 1\r\n else:\r\n if t != 0:\r\n l_t.append(str(t))\r\n t = 0\r\n\r\nif t != 0:\r\n l_t.append(str(t))\r\n\r\nprint(len(l_t))\r\nprint(\" \".join(l_t))", "s = input()\nb = input().strip().split('W')\nn = 0\ncode = []\nfor i in b:\n if len(i) > 0:\n n += 1\n code.append(str(len(i)))\n\nprint(n)\nif n > 0:\n print(' '.join(code))\n\n\t \t \t \t \t\t\t \t\t\t \t \t \t", "import re\r\nn=int(input())\r\ns=input()\r\nk=re.compile(r'B+')\r\nl=k.findall(s)\r\nprint(len(l))\r\nfor i in l:\r\n print(len(i),end=' ')", "n = input()\nletters = input()\ncount = 0\ncounts = []\n\nresult = letters.split(\"W\")\nfor i in result:\n if i != '':\n counts.append(len(i))\n count += 1\n \nprint (count)\nfor i in counts:\n print(i, end=' ')\n \t\t \t \t \t \t \t\t \t \t\t\t\t", "input();s = [str(len(i)) for i in input().split(\"W\") if i];print(len(s));print(\" \".join(s))", "n = int(input())\r\ns = list(input())\r\ncnt = 0\r\nans = []\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n cnt += 1\r\n elif cnt > 0:\r\n ans.append(cnt)\r\n cnt = 0\r\nif cnt > 0:\r\n ans.append(cnt)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i, end=\" \")\r\nprint(end=\"\\n\")\r\n", "b, c, result = 0, 0, []\nnumber = int(input())\ndata = list(input().strip())\nfor m in data:\n if m == 'B':\n b += 1\n c = 1\n elif m == 'W' and c == 1:\n result.append(b)\n b = 0\n c = 0\nif b > 0:\n result.append(b)\nl = len(result)\nif l == 0:\n print(0)\nelse:\n print(l)\n for v in result:\n print(v, end=\" \")\n", "n = int(input())\ns = input()\ns = list(filter(str, s.split(\"W\")))\nprint(len(s))\nfor x in s:\n if \"B\" in x:\n print(len(x), end =\" \")\n \t\t\t \t\t\t\t\t\t \t \t\t\t \t", "K = int(input())\nstring = str(input())\noccurences = [len(i) for i in string.split('W') if i]\nprint(len(occurences))\nprint(*occurences)\n \t \t \t \t \t \t \t \t\t\t\t\t \t\t", "k = int(input())\r\ninp = input()\r\nc,ls = 0,list()\r\nfor i in range(k):\r\n if inp[i] == 'B':\r\n c+=1\r\n else:\r\n if c==0:\r\n pass\r\n else:\r\n ls.append(c)\r\n c=0\r\nelse:\r\n if c==0:\r\n pass\r\n else:\r\n ls.append(c)\r\nprint(len(ls))\r\nprint(*ls)", "import math\r\nfrom fractions import Fraction as frac\r\n\r\nMOD = 1e9 + 7\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\ndef solve(case_no):\r\n n = int(input())\r\n s = str(input())\r\n ans = []\r\n cnt = 0\r\n for i in range(n):\r\n if s[i] == 'B':\r\n cnt += 1\r\n else:\r\n if cnt > 0:\r\n ans.append(cnt)\r\n cnt = 0\r\n if cnt > 0:\r\n ans.append(cnt)\r\n print(len(ans))\r\n for i in range(len(ans)):\r\n print(ans[i], end = \" \")\r\n print()\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "n = int(input())\r\nstr = input()\r\nnl = []\r\nx,y,z = 0,0,0\r\nfor i in range (n):\r\n if str[i]==\"B\":\r\n x+=1\r\n else:\r\n if x>0:\r\n nl.append(x)\r\n y+=1\r\n z+=1\r\n x = 0\r\nif x>0:\r\n z+=1\r\n nl.append(x)\r\nelse:\r\n y-=1\r\nprint(z)\r\nif len(nl)>=0:\r\n for i in range (len(nl)):\r\n print(nl[i],end =\" \")", "input()\r\ns = input()\r\nl = [i for i in s.split('W') if i != '']\r\nprint(len(l))\r\nprint(*[len(i) for i in l], sep = ' ')", "#problem A\nn=input()\ns=input()\nx=s.split(\"W\")\nd=[part for part in x if len(part)]\nprint(len(d))\nprint(\" \".join([str(len(x))for x in d]))\n\t\t \t \t\t \t \t \t\t\t \t \t\t\t", "n = int(input())\r\ns = input()\r\ns = list(s)\r\n\r\nbl = ''\r\nt = 0\r\ny = False\r\nl = 0\r\n\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n y = True\r\n t += 1\r\n if y:\r\n if s[i] == 'W' or i == n-1:\r\n l += 1\r\n bl += str(t) + ' '\r\n t = 0\r\n y = False\r\n\r\nprint(l)\r\nprint(bl[:-1])\r\n", "import math\r\nn = int(input())\r\ns = input()\r\nnum = 0\r\nnums = []\r\n\r\nfor i in range(n):\r\n if s[i] == 'W' and num != 0:\r\n nums.append(num)\r\n num = 0\r\n elif s[i] == 'B':\r\n num += 1\r\n\r\n\r\nif num != 0:\r\n nums.append(num)\r\n\r\nprint(len(nums))\r\nprint(*nums)\r\n\r\n\r\n", "n = int(input())\nstring = input()\nvetor = []\nsize = int()\nfor i in string:\n if i == \"B\":\n size = size + 1\n elif size != 0:\n vetor.append(size)\n size = 0\nif size != 0:\n vetor.append(size)\nprint(len(vetor))\nprint(' '.join(str(x) for x in vetor))\n \t \t\t \t \t \t\t\t\t \t \t \t\t\t \t", "n=int(input())\r\ns=input()\r\nr=s.replace(\"W\",\"0\")\r\nl=r.replace(\"B\",\"1\")\r\nif int(l[0])==1:\r\n sum=1\r\nelse:\r\n sum=0\r\nfor i in range(len(l)-1):\r\n if int(l[i+1])-int(l[i])>0:\r\n sum+=1\r\nprint(sum)\r\ncount,p=0,0\r\na=[]\r\nfor i in range(len(l)):\r\n if count+int(l[i])>count:\r\n p+=1\r\n if i==len(l)-1:\r\n a.append(p)\r\n else:\r\n a.append(p)\r\n p=0\r\np\r\nfor i in a:\r\n if i!=0:\r\n print(i,end=\" \")\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nalpha=input()\r\nk=alpha.split('W')\r\nres=[]\r\ncount=0\r\nfor i in k:\r\n if len(i)>0:\r\n count+=1\r\n res.append(str(len(i)))\r\nprint(count)\r\nprint(' '.join(res))", "rowlen = int(input())\ncrossword = input()\nbcount = 0\nbinarow = 0\nb = False\nlistofb = []\nbstring = \"\"\n\n\n\nfor x in range(rowlen):\n if crossword[x] == 'B':\n b = True\n binarow += 1\n if crossword[x] != 'B' and b == True or (crossword[x] == 'B' and x == (rowlen - 1)):\n bcount+= 1\n b = False\n listofb.append(binarow)\n binarow = 0\n \n \nfor x in range(len(listofb)):\n bstring += str(listofb[x]) + \" \"\n\n \n\n \n \n \n\n\n \n \n\nprint(bcount)\nprint(bstring)\n\n\n\n\n\n\n\n\n\n\t\t\t \t\t \t\t\t\t \t \t\t\t \t \t\t\t", "n=int(input())\r\ns=input()\r\nl1=[]\r\nc=0\r\ncnt=0\r\nfor z in s:\r\n if cnt==0:\r\n if z==\"B\":\r\n cnt+=1\r\n else :\r\n if z==\"B\":\r\n cnt+=1\r\n else :\r\n l1.append(cnt)\r\n cnt=0\r\n c+=1\r\nif cnt!=0:\r\n l1.append(cnt)\r\n c+=1\r\nif c==0:\r\n print(c)\r\nelse :\r\n print(c)\r\n print(*l1,sep=\" \")", "n=int(input())\r\na=input();b=[];r=0;s=0\r\nif set(a)=={'W'}:\r\n print(0)\r\nelse:\r\n for i in a:\r\n if i=='B':\r\n s+=1\r\n if i=='W':\r\n if s!=0:\r\n r+=1\r\n b.append(s)\r\n s=0\r\n if s!=0:\r\n r+=1\r\n b.append(s)\r\n print(r)\r\n print(*b)\r\n \r\n", "input()\r\ns = input() + 'W'\r\nk = 0\r\nd = []\r\nfor i in s:\r\n if i == 'B':\r\n k += 1\r\n else:\r\n if k > 0:\r\n d.append(k)\r\n k = 0\r\nprint(len(d))\r\nprint(*d)", "n = input()\nnonogram = list(input())\nnBlackGroups = -1\narraySizeBlackGroups = []\nisCurrentGroupBlack = False\n\nfor i in nonogram:\n if i == 'B':\n if isCurrentGroupBlack: \n arraySizeBlackGroups[nBlackGroups] += 1\n else:\n nBlackGroups += 1\n arraySizeBlackGroups.append(1)\n isCurrentGroupBlack = True\n else:\n isCurrentGroupBlack = False\n\nprint(nBlackGroups+1)\nif nBlackGroups >= 0:\n for x in arraySizeBlackGroups:\n print(x, end=\" \")\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", "n=int(input())\r\ns=input()\r\nm=0\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n if s[i]=='B':\r\n m=m+1\r\n else:\r\n if m>0:\r\n l.append(m)\r\n c=c+1\r\n m=0\r\nif s[n-1]=='B':\r\n l.append(m)\r\n c=c+1\r\nprint(c)\r\nif l:\r\n print(*l,sep=' ')", "n = int(input())\r\ns = input()[:n] + ' '\r\n\r\nn = int(s[0] == 'B')\r\nres = []\r\nfor i in range(1, len(s)):\r\n if s[i] == 'B': \r\n if s[i-1] == 'B':\r\n n += 1\r\n else:\r\n n = 1\r\n else:\r\n if s[i-1] == 'B':\r\n res.append(n)\r\n\r\nprint(len(res))\r\nif res:\r\n print(' '.join(map(str, res)))\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(S):\r\n n = len(S)\r\n L = []\r\n curr = 0 \r\n for i in range(n):\r\n if S[i]=='B':\r\n curr+=1 \r\n else:\r\n if curr > 0:\r\n L.append(curr)\r\n curr = 0 \r\n if curr > 0:\r\n L.append(curr)\r\n sys.stdout.write(f'{len(L)}\\n')\r\n L = ' '.join(map(str, L))\r\n sys.stdout.write(f'{L}\\n')\r\n \r\nn = int(input())\r\nS = input().decode().strip()\r\nprocess(S)", "a = int(input())\nNumRow = input()\nn = []\nChecker = False\n\ncount = 0\nfor i in NumRow:\n if i == \"B\":\n if not Checker:\n Checker = True\n count+=1\n else:\n Checker = False\n if count:\n n.append(str(count))\n count = 0\nif count:\n n.append(str(count))\nprint(len(n))\nprint(' '.join(n))\n \t\t \t\t \t\t \t \t \t\t\t\t \t \t\t\t", "input()\r\na = list(input())\r\ns = []\r\nd = 0\r\nfor i in a:\r\n if i == \"B\":\r\n d += 1\r\n else:\r\n if not(d == 0):\r\n s.append(d)\r\n d = 0\r\nif d != 0:\r\n s.append(d)\r\nprint(len(s))\r\nfor i in s:\r\n print(i,end=\" \")\r\n", "# The place between your comfort zone and your dream is where life takes place. Helen Keller\r\n# by : Blue Edge - Create some chaos\r\n\r\nn=int(input())\r\ns=input()\r\ns=s.split(\"W\")\r\ns=[len(x) for x in s if len(x)]\r\nprint(len(s))\r\nprint(*s)\r\n", "length = int(input())\r\nrow = input()\r\nnumbers = []\r\nn = 0\r\nfor x in row:\r\n if x == \"W\" and n != 0:\r\n numbers.append(str(n))\r\n n = 0\r\n elif x == \"B\":\r\n n += 1\r\nif n != 0:\r\n numbers.append(str(n))\r\nprint(len(numbers))\r\nprint(\" \".join(numbers))", "n=int(input())\r\ns=input()\r\nc=0\r\nl=0\r\nl1=[]\r\nfor i in range(n):\r\n if(s[i]=='B'):\r\n c+=1\r\n elif(c!=0):\r\n l+=1\r\n l1.append(c)\r\n c=0\r\nif(c!=0):\r\n l+=1\r\n l1.append(c)\r\nprint(l)\r\nfor i in l1:\r\n print(i,end=' ')\r\n\r\n", "n=int(input())\r\ns=input()\r\nsi=[len(i) for i in s.split('W') if i]\r\nprint(len(si))\r\nfor i in si:\r\n print(i,end=' ')", "n = int(input())\ns = input()\ncur = 0\narr = []\nfor i in range(n):\n if s[i] == \"B\":\n cur += 1\n else:\n if cur != 0:\n arr.append(cur)\n cur = 0\nif cur != 0:\n arr.append(cur)\nn = len(arr)\nprint(n)\nif n != 0:\n print(*arr)\n", "if __name__ == \"__main__\":\n discard = input()\n puzzle = list(filter(None, input().split('W')))\n print(len(puzzle))\n for i in range(len(puzzle)):\n if i < len(puzzle)-1:\n print(len(puzzle[i]), ' ', end='')\n else:\n print(len(puzzle[i]))\n \t \t \t \t\t\t \t \t\t\t \t\t \t", "#A\nn=input()\ns=input()\ns +=\"W\"\ncount= 0\ntest=[]\nfor i in s:\n if i ==\"B\": \n count +=1\n else:\n if count!=0:\n test.append(count)\n count=0\nprint(len(test))\n#https://www.geeksforgeeks.org/print-lists-in-python-4-different-ways/\nprint(' '.join(map(str, test))) \n\n \t\t \t\t\t\t \t\t\t \t\t \t \t \t \t\t \t", "n = int(input())\r\ns = input()\r\nb = 0\r\ns += \".\"\r\nhasil = []\r\nfor i in range (len(s)):\r\n if(s[i] == \"B\"):\r\n b += 1\r\n else:\r\n if(b != 0):\r\n hasil += [b]\r\n b = 0\r\nprint (len(hasil))\r\nfor i in (hasil):\r\n print (i, end = \" \")\r\n", "def encrypt_row(n, row):\r\n groups = []\r\n count = 0\r\n for i in range(n):\r\n if row[i] == 'B':\r\n count += 1\r\n elif count > 0:\r\n groups.append(count)\r\n count = 0\r\n\r\n if count > 0:\r\n groups.append(count)\r\n\r\n k = len(groups)\r\n encrypted_row = ' '.join(map(str, groups))\r\n return k, encrypted_row\r\n\r\n# Read input\r\nn = int(input())\r\nrow = input()\r\n\r\n# Encrypt the row\r\nk, encrypted_row = encrypt_row(n, row)\r\n\r\n# Print the result\r\nprint(k)\r\nprint(encrypted_row)", "import re\r\nn = int(input())\r\ns = input()\r\nres = list(map(str,list(map(len,re.findall('(B+)',s)))))\r\nprint(len(res))\r\nprint(' '.join(res))", "n = int(input())\r\ns = input().split('W')\r\n\r\nb = 0\r\nlst = []\r\nfor i in s:\r\n if 'B' in i:\r\n b += 1\r\n lst.append(len(i))\r\nprint(b)\r\nprint(*lst)", "input()\r\nlist1 = input().split('W')\r\nsum = 0\r\nstr1 =''\r\nfor i in range(len(list1)):\r\n if len(list1[i])>0:\r\n str1 += str(len(list1[i]))+' '\r\n sum +=1\r\nprint(sum)\r\nprint(str1)", "n=int(input())\nmaps=input()\nmaps=maps.split('W')\ntotal=0\nresult=[]\nfor letter in maps:\n if letter=='': continue\n total+=1\n result.append(len(letter))\nprint(total)\nfor i in result:\n print(i, end=\" \")\n\t\t \t \t\t \t\t\t\t \t \t\t \t \t \t\t\t", "a=int(input())\r\nb=input().split('W')\r\nfor i in range(b.count('')):\r\n b.remove('')\r\nprint(len(b))\r\nfor i in b:\r\n print(len(i),end=\" \")\r\n\r\n ", "n = int(input())\r\ns = input()\r\na=s.split(\"W\")\r\nprint(len(a) - a.count(''))\r\nfor i in a:\r\n if i != '':\r\n print(len(i), end=' ')", "n=int(input())\r\ns=list(input().split(\"W\"))\r\nnum_group=[]\r\nctr=0\r\nfor i in range(len(s)):\r\n if s[i] in \"B\"*100 and s[i]!=\"\":\r\n ctr+=1\r\n\r\n num_group.append(s[i].count(\"B\"))\r\nprint(ctr)\r\nprint(*num_group)\r\n\r\n\r\n", "charNum = int(input())\r\nstring = input()\r\nk = 0\r\n\r\nres = \"\"\r\nans = string.split(\"W\")\r\n\r\n\r\nfor i in range(len(ans)):\r\n if ans[i] != \"\":\r\n res += str(len(ans[i])) + \" \"\r\n k += 1\r\n\r\nif k > 0:\r\n print(k)\r\n print(res)\r\nelse:\r\n print(k)\r\n\r\n", "n=int(input())\r\nstri=list(input())\r\nct=0\r\nlist1=[]\r\nfor j in range(n):\r\n if stri[j]=='B':\r\n ct+=1\r\n else:\r\n if ct:\r\n list1.append(ct)\r\n ct=0\r\nif ct>0:\r\n list1.append(ct)\r\nprint(len(list1))\r\nfor j in list1:\r\n if j:\r\n print(j,end=\" \")\r\n ", "n = int(input())\ncrsw = input()\n\nn_chains = 0\nblack_chains = []\nant = None\n\ncur_chain = 0\nfor i in range(len(crsw)):\n # caso base\n if i == 0:\n ant = crsw[i]\n if crsw[i] == 'B':\n cur_chain = 1\n continue\n\n # casos em que uma sequencia é iniciada/continuada\n cur = crsw[i]\n if cur == 'B':\n cur_chain += 1\n\n # casos em que uma sequencia é iniciada\n elif cur == 'W' and ant == 'B':\n if cur_chain > 0:\n black_chains.append(cur_chain)\n cur_chain = 0\n \n # att anterior\n ant = cur\n\nif cur_chain > 0:\n black_chains.append(cur_chain)\n\nn_chains = len(black_chains)\n\nprint(n_chains)\nprint(*black_chains)\n\n\n\n\t \t \t\t\t \t\t \t\t\t \t\t\t \t\t\t \t\t \t\t", "\"\"\"One-dimensional Japanese Crossword\"\"\"\r\nn = int(input())\r\nword = input()\r\narr = []\r\ncount = 0\r\nfor i in range(n + 1):\r\n if i >= n:\r\n if word[i - 1] == \"B\":\r\n arr.append(\"B\" * count)\r\n break\r\n else:\r\n break\r\n\r\n if word[i] == \"B\":\r\n count += 1\r\n continue\r\n else:\r\n if count != 0:\r\n arr.append(\"B\" * count)\r\n count = 0\r\n else:\r\n continue\r\n \r\nif len(arr) > 0:\r\n print(len(arr))\r\n for i in arr:\r\n print(len(i), end=\" \")\r\nelse:\r\n print(0)", "n=int(input())\r\ns=input()\r\ni=0\r\nc=0\r\nc1=[]\r\nwhile(i<n):\r\n if(s[i]=='B'):\r\n c+=1\r\n else:\r\n if(c!=0):\r\n c1.append(c)\r\n c=0\r\n i+=1\r\nif(c!=0):\r\n c1.append(c)\r\nif(len(c1)==0):\r\n print(0)\r\nelse:\r\n print(len(c1))\r\n for j in c1:\r\n print(j,end=\" \")", "n = int(input())\r\ns = input()\r\ncnt = 0\r\nlst = []\r\n\r\nfor i in s:\r\n if i == 'B':\r\n cnt += 1\r\n elif i == 'W' and cnt > 0:\r\n lst.append(cnt)\r\n cnt = 0\r\n \r\nif cnt > 0:\r\n lst.append(cnt)\r\n \r\nprint(len(lst))\r\nprint(*lst)", "n1 = int(input())\r\nn2 = input()\r\ncount = 0\r\nindex_b = [i for i, x in enumerate(n2) if x == \"B\"]\r\nlist2 = []\r\nstreak = 0\r\nfor i in range(len(index_b)):\r\n \r\n if i != len(index_b)-1:\r\n if index_b[i+1] - index_b[i] != 1:\r\n count+=1\r\n list2.append(streak+1)\r\n streak = 0\r\n else:\r\n streak+=1\r\n else:\r\n list2.append(streak+1)\r\n count+=1\r\n streak = 0\r\n \r\nprint(count)\r\nprint(*list2)\r\n ", "x = int(input())\r\nstring = input().lower()\r\nblacks = []\r\nlast = \"\"\r\ncnt = 0\r\nfor i in string:\r\n if i == \"b\":\r\n cnt+=1\r\n last=i\r\n if i == \"w\":\r\n if cnt>0:\r\n blacks.append(cnt)\r\n cnt=0\r\n last=i\r\nif cnt>0:\r\n blacks.append(cnt)\r\nprint(len(blacks))\r\nfor i in blacks:\r\n print(i,end=\" \")", "length = int(input().lstrip().rstrip())\r\nrow = (input().lstrip().rstrip()).split(\"W\")\r\n\r\nencryptedNubmer = 0\r\nencryptionValues = []\r\nfor encoding in row:\r\n if encoding != \"\":\r\n encryptedNubmer += 1\r\n encryptionValues.append(str(len(encoding)))\r\n\r\nprint(encryptedNubmer)\r\nprint(\" \". join(encryptionValues))\r\n", "n = int(input())\r\n\r\ns = input()\r\n\r\nbl_list = []\r\nbl = 0\r\n\r\nfor x in list(s):\r\n if x == \"B\":\r\n bl +=1\r\n else:\r\n bl_list.append(bl)\r\n bl = 0\r\n\r\nbl_list.append(bl)\r\nbl_list = [str(x) for x in bl_list if x!=0]\r\n\r\nprint(len(bl_list))\r\nprint(\" \".join(bl_list))\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "input()\r\nstr = input()\r\n\r\nls = []\r\ncnt = 0\r\n\r\nfor s in str:\r\n if s==\"B\":\r\n cnt+=1\r\n else:\r\n if cnt!=0:\r\n ls.append(cnt)\r\n cnt=0\r\n\r\nif cnt>0:\r\n ls.append(cnt)\r\n\r\nprint(len(ls))\r\n\r\nfor l in ls:\r\n print(l, end=' ')", "k = int(input())\r\nlst = list(input())\r\nresult, last, flag = [], 0, False\r\nfor i in range(k):\r\n if lst[i] == \"B\" and not flag:\r\n last, flag = i, True\r\n elif lst[i] == \"W\" and flag:\r\n result.append(i-last)\r\n flag = False\r\nif flag:\r\n result.append(k-last)\r\nprint(len(result))\r\nprint(*result, sep=\" \")", "n=int(input())\r\np=input()\r\nl=[]\r\ncount=0\r\nfor i in range(n):\r\n\tif p[i]==\"B\":\r\n\t\tcount+=1\r\n\telif p[i]!=\"B\":\r\n\t\tif count>0:\r\n\t\t\tl.append(count)\r\n\t\t\tcount=0\r\nif p[-1]==\"B\":\r\n\tl.append(count)\t\t\r\nprint(len(l))\r\nprint(*l)\t\t\t\t\t\t\r\n", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nconsc = []\r\nn = int(input())\r\nll = list(input())\r\ncmax = 0\r\nfor i in range(n):\r\n if ll[i]==\"B\":\r\n cmax+=1\r\n if ll[i]=='W':\r\n if cmax>0:\r\n consc.append(cmax)\r\n cmax=0\r\n if i==(n-1) and cmax>0:\r\n consc.append(cmax)\r\nprint(len(consc))\r\nprint(*consc)", "from sys import stdin\r\nn = int(stdin.readline())\r\ns = stdin.readline().rstrip()\r\n\r\nc = 0\r\ngroups = []\r\n\r\nfor char in s:\r\n if char == 'B':\r\n c += 1\r\n elif c > 0:\r\n groups.append(c)\r\n c = 0\r\n\r\nif s[-1] == 'B':\r\n groups.append(c)\r\n\r\nprint(len(groups))\r\nfor group in groups:\r\n print('{} '.format(group), end='')", "n=int(input())\r\ns=input()\r\narr,k=[],0\r\nfor i in range(len(s)):\r\n if(s[i]=='B'):\r\n k+=1\r\n else:\r\n if(k>0):\r\n arr.append(k)\r\n k=0\r\nif(k>0):\r\n arr.append(k)\r\nprint(len(arr))\r\nprint(*arr,sep=' ')", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn=read_int()\r\n\ta=[x for x in read().split(\"W\") if x]\r\n\tprint(len(a))\r\n\tprint(\" \".join(str(len(x)) for x in a))\r\n\r\nsolve()\r\n", "\r\nn=int(input())+1\r\ns=input()+\"W\"\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n\tif s[i]==\"B\":\r\n\t\tc+=1\r\n\telif s[i-1]==\"B\":\r\n\t\tl.append(c)\r\n\t\tc=0\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\ndata = input()\ncount = 0\ncount_group = []\nprev = None\nfor i in range(n):\n if data[i] == 'B':\n if prev == 'B':\n count_group[len(count_group) - 1] += 1\n else:\n count += 1\n count_group.append(1)\n prev = 'B'\n else:\n prev = 'W'\n\nprint(count)\nprint(\" \".join(list(map(str, count_group))))\n", "n = int(input())\nadaltik = input()\n\nblack = []\n\nbcounter = 0\nfor i in range(len(adaltik)):\n if adaltik[i] == \"B\":\n bcounter += 1 \n else:\n if bcounter != 0:\n black.append(bcounter)\n bcounter = 0\n\n if bcounter != 0 and i == len(adaltik)-1:\n black.append(bcounter)\n\n\nprint(len(black))\nprint(\" \".join(map(str, black)))\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\nstring = input()\r\n\r\nresult = str()\r\ncounter = int()\r\n\r\nfor i in string:\r\n\tif i == 'B':\r\n\t\tcounter += 1\r\n\telif i == 'W' and counter:\r\n\t\tresult += f' {counter}'\r\n\t\tcounter = 0\r\nelse:\r\n\tif counter:\r\n\t\tresult += f' {counter}'\r\n\r\nresult = result.strip()\r\nprint(len(result.split()))\r\nif result:\r\n\tprint(result)\r\n", "n = int(input())\r\nst = list(input())\r\nblocks, count, mem = 0, 0, 0\r\nlst = []\r\nst.append('W')\r\nfor i in range(len(st) - 1):\r\n if st[i] == 'B' and st[i + 1] == 'W':\r\n blocks += 1\r\n if st[i] == 'B':\r\n count += 1\r\n lst.append(count)\r\n if st[i] == 'W':\r\n lst.append(0)\r\nprint(blocks)\r\nlst.append(0)\r\nfor j in range(0, len(lst) - 1):\r\n if lst[j] != 0 and lst[j + 1] == 0:\r\n print(lst[j] - mem, end=' ')\r\n mem = lst[j]\r\n elif lst.count(0) == 0:\r\n print(max(lst), end=' ')\r\n break\r\n", "n = int(input())\ncrossword = input()\nblack_chunks = [len(chunk) for chunk in crossword.split(\"W\") if chunk != \"\"]\n\nprint(len(black_chunks))\nif len(black_chunks) > 0:\n print(\" \".join(str(chunk) for chunk in black_chunks))\n", "n=int(input())\r\ns=input()\r\ns=\" \".join(list(s.split(\"W\"))).split()\r\nl=[len(i) for i in s]\r\nprint(len(s))\r\nprint(\" \".join(map(str,l)))", "len1=int(input())\r\nx=input()\r\ncount=0\r\nlist1=[]\r\nfor i in range(len(x)):\r\n if x[i]=='B':\r\n count+=1\r\n elif x[i]=='W':\r\n list1.append(count)\r\n count=0\r\nlist1.append(count)\r\nlist2=[]\r\nfor i in list1:\r\n if i!=0:\r\n list2.append(i)\r\nprint(len(list2))\r\nstr1=''\r\nfor i in list2:\r\n str1+=str(i)+' '\r\nprint(str1)", "n = int(input())\narray = input()\ncryptography = []\nnumberOfBlocks = 0\ncount = 0\nfor i in range(len(array)):\n square = array[i]\n\n if (square == 'B'):\n count += 1\n\n if (((square == 'W' and i != 0) or (i == (len(array) - 1))) and count != 0):\n cryptography.append(count)\n count = 0\n numberOfBlocks += 1\n\nprint(numberOfBlocks)\nfor j in cryptography:\n print(j, end = ' ')\nprint()\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\nflag = 'W'\r\nk = ind = r = 0\r\np = []\r\nfor i in s:\r\n r+=1\r\n if i == 'B' and flag == 'W':\r\n k+=1\r\n ind+=1\r\n flag = 'B'\r\n elif i == 'B' and flag == 'B':\r\n ind+=1\r\n elif ind != 0:\r\n p.append(ind)\r\n flag = 'W'\r\n ind = 0\r\nif ind != 0:\r\n p.append(ind)\r\nprint(k)\r\nif k != 0:\r\n print(*p)", "n=int(input())\r\nl=list(input().split(\"W\"))\r\nx=[]\r\nfor i in l:\r\n if i!=\"\":\r\n x.extend([len(i)])\r\n\r\nprint(len(x))\r\nprint(*x)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = input().rstrip()\r\n\r\ndata += 'W'\r\ncnt = 0 if data[0] == 'W' else 1\r\nans = []\r\nfor i in range(1, n + 1):\r\n if data[i] == 'B':\r\n cnt += 1\r\n elif data[i - 1] == 'B':\r\n ans.append(cnt)\r\n cnt = 0\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n=int(input())\r\ns=input()\r\na=[len(a) for a in s.split('W') if a]\r\nprint(len(a),*a,sep='\\n')", "n = int(input())\r\ns = input()\r\nt = False\r\nblocks = 0\r\noutput = \"\"\r\nfor i in s:\r\n if t == False and i == \"W\":\r\n pass\r\n elif t == False and i == \"B\":\r\n blocks = blocks + 1\r\n lblo = 1\r\n t = True\r\n elif t == True and i == \"W\":\r\n output = output + str(lblo) + \" \"\r\n lblo = 0\r\n t = False\r\n elif t == True and i == \"B\":\r\n lblo = lblo + 1\r\nif s[-1] == \"B\":\r\n output = output + str(lblo) + \" \"\r\nprint(blocks)\r\nprint(output)\r\n", "n = int( input())\r\ns = input()\r\nc=0\r\ng=0\r\nb=''\r\nx=0\r\nwhile x<len(s) : \r\n if s[x]=='B':\r\n while s[x]=='B' : \r\n g+=1\r\n if x<len(s) :\r\n x+=1\r\n if x==len(s):\r\n c+=1\r\n b+=str(g)+' '\r\n g=0\r\n break\r\n else:\r\n c+=1\r\n b+=str(g)+' '\r\n g=0\r\n else:\r\n x+=1\r\nprint(c)\r\nprint(b)", "n = int(input())\r\nstring = input()\r\ncount = 0\r\n\r\ncount = []\r\nsubarray = 0\r\nfor i in range(len(string)):\r\n if string[i] == 'B':\r\n subarray += 1\r\n else:\r\n if subarray != 0:\r\n count.append(subarray)\r\n subarray = 0\r\nif string[-1] == 'B':\r\n count.append(subarray)\r\n \r\nprint(len(count))\r\nif len(count) != 0:\r\n print(*count)", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn = int(input())\r\nr = input()\r\nans = []\r\ns = -1\r\nfor i in range(n):\r\n if r[i] == 'B' and s == -1:\r\n s = i\r\n if r[i] == 'W' and s != -1:\r\n ans.append(i-s)\r\n s = -1\r\nif r[-1] == 'B':\r\n ans.append(n-s)\r\nprint(len(ans))\r\nif ans:\r\n print(*ans)", "n = int(input())\r\ns = input()\r\nt = 0\r\nst = []\r\nfor i in s:\r\n if i == 'B':\r\n t += 1\r\n elif t > 0:\r\n st.append(t)\r\n t = 0\r\nif t > 0:\r\n st.append(t)\r\nprint(len(st))\r\nprint(*st)\r\n", "x=int(input())\ns=input()\nc=0\narr=[]\nfor i in range(x):\n if s[x-1]==\"W\":\n if s[i]==\"B\":\n c+=1\n if s[i+1]==\"W\":\n arr.append(c)\n c=0\n else:\n if s[i]==\"B\":\n c+=1\n if i!=x-1: \n if s[i+1]==\"W\":\n arr.append(c)\n c=0\n if i==x-1:\n if s[i]==\"B\":\n arr.append(c)\n c=0\nif arr==[]:\n arr.append(0)\n print(*arr,sep=\" \")\nelse:\n print(len(arr))\n print(*arr,sep=\" \")\n\n\n", "# Problem URL: https://codeforces.com/problemset/problem/721/A\r\n\r\nn = int(input())\r\nmessage = input()\r\n\r\ncount = 0\r\ndecrypted_message = []\r\ni=0\r\nwhile i<n:\r\n if message[i] == 'B':\r\n j = i\r\n while j<n and message[j]=='B':\r\n j+=1\r\n decrypted_message.append(j-i)\r\n i = j\r\n else:\r\n i+=1\r\n\r\n\r\nprint(len(decrypted_message))\r\nfor num in decrypted_message:\r\n print(num,end=\" \")", "import re\r\nn = input()\r\nall_b = re.findall(\"B+\",input())\r\nprint(len(all_b))\r\nif len(all_b) != 0:\r\n print(*[len(all_b[i]) for i in range(len(all_b))])", "m = int(input())\r\nn = str(input())\r\na = n.split('W')\r\n \r\nb = []\r\ncount = 0\r\n\r\nfor i in range(len(a)):\r\n if len(a[i]) != 0:\r\n b.append(len(a[i]))\r\n count += 1\r\n\r\nprint(count)\r\nprint(' '.join([str(x) for x in b]))", "n=int(input())\r\ns=input()\r\ns=[str(len(i)) for i in s.split('W')]\r\nwhile '0' in s:\r\n s.remove('0')\r\nprint(len(s))\r\nprint(\" \".join(s))", "a = int(input())\r\nl = input().split('W')\r\nn = []\r\nm = 0\r\n\r\nfor i in l:\r\n if i == '':\r\n continue\r\n else:\r\n m += 1\r\n n.append(i.count('B'))\r\n\r\nprint(m)\r\nprint(*n)", "n = int(input())\ns = input()\n\nb = e = c = flag = 0\nres = []\nfor i in s:\n c += 1\n if i == \"B\":\n b += 1\n flag = 1\n else:\n if flag == 1:\n res.append(b)\n flag = b = 0\n \nif flag == 1:\n res.append(b)\n \nprint(len(res))\nprint(*res)\n \t\t\t\t \t\t\t\t \t \t\t \t \t \t \t \t", "from sys import stdin\r\ndef read():\r\n return stdin.readline().strip()\r\nread()\r\na=[len(i) for i in read().split('W') if i]\r\n \r\n\r\nprint(len(a), *a)\r\n", "n=input()\r\ns=input()\r\na=[str(len(x)) for x in s.split('W') if x]\r\nprint(len(a))\r\nprint(' '.join(a))\r\n", "n = int(input())\ns = input()\n#w3schools was used to look up .split(separator, maxsplit) as well as list comprehension\nans = [len(i) for i in s.split('W', n) if len(i) != 0]\nprint(len(ans))\nprint(*ans)\n \t\t \t \t \t \t\t \t \t \t", "def solve(s):\r\n i=0\r\n ans=[]\r\n ln=len(s)\r\n while i<ln:\r\n if s[i]!='B':\r\n i+=1\r\n continue\r\n j=i\r\n while j+1<ln and s[j+1]==\"B\":\r\n j+=1\r\n ans.append(j-i+1)\r\n i=j+1\r\n anss=str(len(ans))\r\n anss+='\\n'\r\n for i in ans:\r\n anss+=str(i)+\" \"\r\n return anss\r\n\r\nn=input()\r\ns=input()\r\nprint(solve(s))\r\n", "n = int(input())\nvec = input()\nlast = 'W'\nstack = []\ncurrent = 0\nfor letter in vec:\n if letter == 'W':\n if current > 0:\n stack.append(str(current))\n current = 0\n elif letter == 'B':\n current += 1\nif current > 0:\n stack.append(str(current))\nprint(len(stack))\nprint(\" \".join(stack))\n \t\t\t\t\t\t\t\t \t\t\t\t \t \t \t \t", "n=int(input())\r\na=input()\r\na=list(a)\r\ncount=0\r\nx=[]\r\nc=0\r\ni=0\r\nif n==1 and a[0]==\"B\":\r\n print(1)\r\n print(1)\r\nelse:\r\n while(i<n):\r\n if(a[i]==\"B\" and i<n-1):\r\n count+=1\r\n if(a[i+1]==\"W\"):\r\n \r\n c+=1\r\n x.append(count)\r\n count=0\r\n if(i==n-2 and a[i+1]==\"B\"):\r\n c+=1\r\n count+=1\r\n x.append(count)\r\n break\r\n\r\n if(i==n-1 and a[i]==\"B\" and a[i-1] != \"B\"):\r\n \r\n count+=1\r\n \r\n c+=1\r\n x.append(count)\r\n break\r\n \r\n \r\n \r\n \r\n \r\n i+=1\r\n\r\n\r\n print(c)\r\n for i in x:\r\n print(i,end=\" \")", "input1 = input()\ninput2 = input()\n\nb_char = \"B\"\ncounter = 0\narr = []\ncalls = 0\nlimit = int(input1)\nfor x in range(limit):\n if input2[x] == b_char:\n calls += 1\n counter +=1\n if x == limit-1:\n arr.append(counter)\n else:\n if counter != 0:\n arr.append(counter)\n counter = 0\nif calls != 0:\n print(len(arr))\n for x in arr:\n print(x)\nelse:\n print(0)\n \t\t\t\t\t\t\t\t \t\t \t \t \t \t\t\t", "def main():\n nelem = int(input())\n lista = input()\n nofgroups = 0\n length = 0\n prevblack = False\n strgroups = \"\"\n for i in range(nelem):\n if(lista[i] == 'B' and prevblack):\n length += 1\n if(i == (nelem - 1)):\n strgroups += (str(length) + ' ')\n elif(lista[i] == 'B'):\n nofgroups += 1\n length += 1\n prevblack = True\n if(i == (nelem - 1)):\n strgroups += (str(length) + ' ')\n elif(lista[i] == 'W' and prevblack):\n strgroups += (str(length) + ' ')\n length = 0\n prevblack = False\n print(nofgroups)\n print(strgroups)\nmain()\n\n\t \t \t\t\t \t \t\t\t\t \t\t\t \t \t \t \t \t", "n = int(input())\r\nt = input().split('W')\r\ns = ''\r\nl = []\r\nfor i in t:\r\n if len(i) != 0:\r\n l.append(len(i))\r\nprint(len(l))\r\nfor i in l:\r\n if i != 0:\r\n s += str(i) + ' '\r\nprint(s)", "def solve(row):\r\n lengths = []\r\n length = 0\r\n for i in range(len(row) + 1):\r\n if i < len(row) and row[i] == 'B':\r\n length += 1\r\n elif length > 0:\r\n lengths.append(length)\r\n length = 0\r\n return lengths\r\n\r\ndef main():\r\n n = int(input())\r\n row = input()\r\n\r\n lengths = solve(row)\r\n print(len(lengths))\r\n print(\" \".join(map(str, lengths)))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "input()\nletters = list(input())\n\nblacks = [0]\nlastAdded = 0\n\nfor index in range(len(letters)):\n if letters[index] == 'B':\n blacks[lastAdded] += 1\n elif index > 0 and letters[index - 1] == 'B':\n lastAdded += 1\n blacks.append(0)\n\nif blacks[-1] == 0:\n del blacks[-1]\n \nprint(len(blacks))\nfor index in blacks:\n print(index, end=' ')\n\t\t \t\t\t \t\t\t\t \t \t \t \t\t\t\t", "def main():\r\n n = int(input())\r\n s = input().strip()\r\n\r\n g = 0\r\n sz = []\r\n gc = 0\r\n i = 0\r\n while i < n:\r\n if s[i] == 'B':\r\n g += 1\r\n while i < n and s[i] == 'B':\r\n i += 1\r\n gc += 1\r\n sz.append(gc)\r\n gc = 0\r\n else:\r\n i += 1\r\n\r\n print(g)\r\n if len(sz) != 0:\r\n for d in sz:\r\n print(d, end=' ')\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na=list(input())\r\nb=[]\r\nk=0\r\nflag=0\r\nfor i in range(len(a)):\r\n if a[i]=='B':\r\n k=k+1\r\n flag=1\r\n else:\r\n if k!=0:\r\n b.append(k)\r\n k=0\r\n if i==len(a)-1 and k!=0:\r\n b.append(k)\r\nif flag==1:\r\n print(len(b))\r\n for i in b:\r\n print(i,end=\" \")\r\nelse:\r\n print(0)\r\n", "\r\nn = int(input())\r\ns = input().split('W')\r\na = 0\r\nb = []\r\nfor i in range(len(s)):\r\n if s[i] != \"\":\r\n a += 1\r\n b.append(len(s[i]))\r\nprint(a)\r\nprint(*b)", "l = int(input())\ntest = input()\n\n\nres = []\nb = 0\ntestb = False\nfor c in test:\n if c == \"B\":\n testb = True\n b += 1\n else:\n testb = False\n if b > 0:\n res.append(b)\n b = 0\nif b > 0:\n res.append(b)\n\nprint(len(res))\nfor a in res:\n print(a, end=\" \")\nprint()\n", "def japanese_crossword():\n n = int(input())\n line = input()\n seq = 0\n vector = []\n for l in line:\n if l == 'B':\n if(seq==1):\n vector[-1]+=1\n else:\n vector.append(1)\n seq = 1 if l=='B' else 0\n \n print(len(vector))\n strin = \"\"\n for v in vector:\n strin += str(v) + ' '\n print(strin)\n\njapanese_crossword()\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())\r\ns = input().split('W')\r\nprint(len(s) - s.count(''))\r\nfor i in s:\r\n if i:\r\n print(len(i), end=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nn=int(input())\r\nm=list(input())\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n\tif(m[i]==\"B\"):\r\n\t\tc+=1\r\n\tif( (i==n-1 and m[i]==\"B\") or m[i]==\"W\" ):\r\n\t\tl.append(c)\r\n\t\tc=0\r\nfor i in range(l.count(0)):\r\n\tl.remove(0)\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\r\ncount = 0\r\nstring = input()\r\nnew = list()\r\nans = 0\r\nfor j in range(n):\r\n if string[j] == \"B\":\r\n if j != n-1:\r\n count += 1\r\n else:\r\n new.append(count+1)\r\n else:\r\n if count != 0:\r\n new.append(count)\r\n count = 0\r\nprint(len(new))\r\nfor x in new:\r\n print(x, end=\" \")\r\n", "def hidden_numbers():\r\n t = int(input())\r\n blocks = input()\r\n \r\n temp = 0\r\n lst = []\r\n \r\n for i in range(t):\r\n if blocks[i] == \"B\":\r\n temp += 1\r\n \r\n else:\r\n if temp:\r\n lst.append(temp)\r\n temp = 0\r\n \r\n if temp:\r\n lst.append(temp)\r\n \r\n \r\n print(len(lst))\r\n if lst:\r\n print(*lst, sep=(\" \"))\r\n \r\n\r\n\r\nhidden_numbers()", "num = int(input())\r\ns = input()\r\n\r\nif s.count(\"B\") == 0:\r\n print(0)\r\nelse:\r\n lst = []\r\n ct = 0\r\n s = s+\"x\"\r\n for let in s:\r\n if let == \"B\":\r\n ct += 1\r\n else:\r\n lst.append(ct)\r\n ct = 0\r\n lst = [x for x in lst if x != 0]\r\n print(len(lst))\r\n print(*lst)\r\n\r\n\r\n\r\n", "num = int(input())\r\nfirst = input().split(\"W\")\r\nmain = []\r\nfor i in first:\r\n if(len(i)!=0):\r\n main.append(len(i))\r\nprint(len(main))\r\nif(len(main) != 0):\r\n print(*main , sep = \" \")", "n = int(input())\r\ns = input()\r\nk = 0\r\na = \"\"\r\nc = 0\r\nfor i in s:\r\n if i == \"B\":\r\n c += 1\r\n else:\r\n if c > 0: \r\n k += 1\r\n a += str(c) + \" \"\r\n c = 0\r\nif i == \"B\":\r\n k += 1\r\n a += str(c) + ' '\r\nprint(k)\r\nif k > 0:\r\n print(a[:-1])", "n = int(input())\r\ns = input()\r\ng = 0\r\naux = 0\r\nl = []\r\nfor c in s:\r\n if c == 'B':\r\n aux += 1\r\n else:\r\n if aux > 0:\r\n g += 1\r\n l.append(str(aux))\r\n aux = 0\r\nif aux != 0:\r\n g += 1\r\n l.append(str(aux))\r\nprint(g)\r\nprint(' '.join(l))\r\n", "n = int(input())\r\ns = input()\r\nc = []\r\na = 0\r\n\r\nfor i in range(n): \r\n if s[i] == \"B\":\r\n a=a+1\r\n elif a>0:\r\n c.append(a)\r\n a=0\r\nif a>0:\r\n c.append(a)\r\n\r\nk=len(c)\r\nprint(k)\r\nprint(*c)\r\n", "n=int(input())\r\ns=input()\r\na,count=[],0\r\nif s[0]=='B':\r\n count=1\r\nfor i in range(1,n):\r\n if s[i]=='B':\r\n count+=1\r\n else:\r\n a.append(count)\r\n count=0\r\nif count!=0:\r\n a.append(count)\r\nb=[]\r\nfor i in a:\r\n if i!=0:\r\n b.append(i)\r\nprint(len(b))\r\nif len(b)!=0:\r\n for i in b:\r\n print(i,end=' ')", "A = int(input())\nN = [len(x) for x in input().split('W') if len(x) > 0]\nprint(len(N))\nprint(*N)\n\n \t \t\t \t\t \t\t \t \t\t\t \t\t", "n = int(input())\r\nl = input()\r\nc = 0\r\nb = 1\r\nli = []\r\nl=l.split('W')\r\nwhile '' in l:\r\n l.remove('')\r\nans = []\r\nfor i in l:\r\n ans.append(len(i))\r\nprint(len(ans))\r\nprint(*ans)", "import re\r\nn = int(input())\r\ns = input()\r\nxl = re.findall(r'B+',s)\r\nx = len(xl)\r\nr=[]\r\nfor i in xl:\r\n r.append(len(i))\r\nprint(x)\r\nif x!=0:\r\n print(*r)", "n = int(input())\r\ns = input()\r\nk = []\r\ncount = 0\r\nfor i in range(n):\r\n if s[i] == 'W':\r\n if count != 0:\r\n k.append(count)\r\n count = 0\r\n else:\r\n count += 1\r\nif s[-1] == 'B':\r\n k.append(count)\r\nprint(len(k))\r\nfor i in k:\r\n print(i, end=' ')\r\nprint()", "n=int(input())\r\nc=input()\r\nd=[]\r\nflag=0\r\ncount=0\r\nw=[]\r\nfor i in range(len(c)):\r\n\tif c[i]=='B':\r\n\t\tcount+=1\r\n\t\tflag=0\r\n\telse:\r\n\t\tif count>0:\r\n\t\t\tw.append(count)\r\n\t\tcount=0\r\n\t\tflag=1\r\n\r\nif flag==0:\r\n\tw.append(count)\r\n\r\nprint(len(w))\r\nif len(w)!=0:\r\n\tprint(*w)\r\n\t\r\n\t\t\r\n\t\t\r\n", "row_lenght = int(input())\ninput2 = input()\nactual_block = \"\"\nanterior_block = \"\"\nencrypted_number = 0\nblack_groups = []\nblack_groups_indice = 0\n\nfor i in range(len(input2)):\n anterior_block = actual_block\n actual_block = input2[i]\n if (actual_block == 'B' and anterior_block != 'B'):\n encrypted_number = encrypted_number + 1\n black_groups.append(1)\n elif(actual_block == 'B' and anterior_block == 'B'):\n black_groups[black_groups_indice] = black_groups[black_groups_indice] + 1\n elif(actual_block == 'W' and anterior_block == 'B'):\n black_groups_indice = black_groups_indice + 1\n\nprint(encrypted_number)\nfor i in range(len(black_groups)):\n print(black_groups[i], end=\"\")\n if(i != len(black_groups)-1):\n print(\" \", end=\"\")\n\t \t \t \t\t\t \t\t\t \t\t \t \t\t", "n = int(input())\na = input().strip()\nc = 0\nr = [0] * 50\nfor i in range(n):\n if a[i] == 'W':\n continue\n if i > 0 and a[i - 1] == 'B':\n r[c - 1] += 1\n else:\n c += 1\n r[c - 1] += 1\n\nprint(c)\nprint(*r[:c])# 1698068151.623599", "length = int(input())\nletters = input()\ngrupos = 0\nlista_bs = \"\"\nbs = 0\n\nfor i in range(length):\n if letters[i] == \"W\":\n if bs == 0:\n continue\n else:\n grupos +=1\n lista_bs += str(bs) + \" \"\n bs = 0\n else:\n bs += 1\n if i == length-1:\n grupos +=1\n lista_bs += str(bs) + \" \"\n bs = 0\n\nprint(grupos)\nif grupos != 0:\n print(lista_bs)\n\t \t \t \t\t \t \t\t\t\t\t \t\t\t\t", "n=int(input())\r\ns=input()\r\na=[]\r\ni=0\r\nwhile i<n:\r\n if s[i]=='B':\r\n c=0\r\n while i<n and s[i]=='B':\r\n c+=1\r\n i+=1\r\n a+=[c]\r\n i+=1\r\n\r\nprint(len(a))\r\nfor x in a:\r\n print(x,end=' ')\r\n \r\n", "n=int(input())\r\nrow=list(input())\r\narr=[]\r\ns=\"\"\r\nfor i in row:\r\n if i==\"B\":\r\n s+=i\r\n else:\r\n if len(s)>0:\r\n arr.append(s)\r\n s=\"\"\r\nelse:\r\n if len(s)>0:\r\n arr.append(s)\r\n \r\nif len(arr)==0:\r\n print(0)\r\nelse:\r\n print(len(arr))\r\n for i in arr:\r\n print(len(i),end=\" \")", "n=int(input())\r\ns=input()\r\ntemp,count=0,0\r\nx=[]\r\nfor i in range(0,n):\r\n if(s[i]==\"B\"):\r\n temp+=1 \r\n \r\n elif(temp!=0):\r\n x.append(temp)\r\n count+=1\r\n temp=0\r\n if(i==n-1 and s[n-1]==\"B\"):\r\n x.append(temp)\r\n count+=1\r\nif(count==0):\r\n print(\"0\")\r\nelse:\r\n print(count)\r\n for i in x:\r\n print(i,end=\" \")\r\n ", "a = int(input())\r\nst = input()\r\nans = list()\r\nans = st.split('W')\r\nans1 = list()\r\nfor char in ans:\r\n if len(char) == 0:\r\n pass\r\n else:\r\n ans1.append(len(char))\r\nprint(len(ans1))\r\nfor c in ans1:\r\n print(c, end=\" \")\r\n", "n = int(input())\na = input()\nc=0\nd = list()\nfor i in range(n):\n if a[i]=='B':c+=1\n else:\n if c>0: d.append(c)\n c=0\nif c>0: d.append(c)\nprint(len(d))\nprint(*d)", "n=int(input())\r\ns=input()\r\nnd=0\r\nlst=[]\r\nfor i in s:\r\n if i=='B':\r\n nd+=1\r\n else:\r\n if nd!=0:\r\n lst.append(nd)\r\n nd=0\r\nif nd!=0:\r\n lst.append(nd)\r\nprint(len(lst))\r\nfor i in lst:\r\n print(i,end=' ')\r\n", "n = int(input())\r\ns = input()\r\nfinal = []\r\nprev = s[0]\r\ncount=0\r\nif n==1:\r\n if s[0]=='B':\r\n print(1)\r\n print(1)\r\n else:\r\n print(0)\r\n exit()\r\nif prev=='B':\r\n count+=1\r\nfor i in range(1,n):\r\n if s[i]=='B' and prev=='B':\r\n count+=1\r\n elif s[i]=='B':\r\n prev = 'B'\r\n count=1\r\n elif s[i]=='W' and count!=0:\r\n final.append(count)\r\n count=0\r\nif count!=0:\r\n final.append(count)\r\nprint(len(final))\r\nfor nos in final:\r\n print(nos,end=\" \")\r\n \r\n", "n=int(input())\r\ns=input()\r\ni=0;j=0\r\nans=[]\r\nwhile(i<n):\r\n cnt=0\r\n while(i<n and s[i]=='B'):\r\n i+=1\r\n cnt+=1\r\n if(cnt>=1):\r\n ans.append(cnt)\r\n i+=1\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i],end=\" \")\r\n \r\n ", "n = int(input())\r\ns = input()\r\nl = s.split('W')\r\nc = 0\r\nfor i in l:\r\n if i != '':\r\n c += 1\r\nprint(c)\r\nfor i in l:\r\n if i != '':\r\n print(len(i), end = \" \")\r\n", "n = int(input())\r\na = input().split('W')\r\na = [len(i) for i in a if i]\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\ns = input().split('W')\n\ncount = 0\ncountArr = [] \nfor x in s:\n if x == '': continue\n count += 1\n countArr.append(len(x))\n\nprint(count)\nfor x in countArr:\n print(x, end = \" \")", "length = int(input())\nstring = input()\ncounts = []\ncount = 0\nfor char in string:\n if char == 'B' and count == 0:\n counts.append(1)\n count = 1\n elif char == 'B' and count > 0:\n counts[-1] += 1\n else:\n count = 0\n\nprint(len(counts))\nprint(*counts, sep=' ')\n", "t=int(input())\r\nn=input()\r\nm=n.split(\"W\")\r\ncount=0;count1=0\r\nar=[]\r\nfor i in m:\r\n if i!='':\r\n count+=1\r\nprint(count)\r\nfor i in range(t):\r\n if n[i]==\"B\":\r\n count1+=1\r\n else:\r\n ar.append(count1)\r\n count1=0\r\nif count1!=0:\r\n ar.append(count1)\r\nfor i in ar:\r\n if i==0:\r\n pass\r\n else:\r\n print(i,end=' ')", "\r\ndef solve():\r\n x = int(input())\r\n l = list(input().split(\"W\"))\r\n ans = []\r\n count = 0\r\n for i in l:\r\n if len(i)>0:\r\n ans+=[len(i)]\r\n count+=1\r\n print(count)\r\n print(*ans)\r\nsolve()", "nb = int(input())\r\nls = input()\r\nliste = [x for x in ls]\r\nliste2 = []\r\ncompteur =0\r\nfor loop in range(len(liste)):\r\n if liste[loop] ==\"B\":\r\n compteur +=1\r\n else:\r\n if compteur !=0:\r\n liste2.append(str(compteur))\r\n compteur = 0\r\nif compteur!=0:\r\n liste2.append(str(compteur))\r\nprint(len(liste2))\r\nif len(liste2) !=0:\r\n print(\" \".join(liste2))", "n = int(input())\r\nst = input()\r\nls = []\r\ncount=0\r\nfor i in st:\r\n if i == 'B':\r\n count+=1\r\n else:\r\n if count!=0:\r\n ls.append(count)\r\n count=0\r\nif count>0:\r\n ls.append(count) \r\nprint(len(ls) if len(ls)!=0 else 0)\r\nfor i in ls:\r\n print(i, end=' ') \r\n", "m=int(input())\r\nx=input() + \" \"\r\nk=0\r\nlst=[]\r\nfor i in x:\r\n if i==\"B\":\r\n k+=1\r\n elif k>0 :\r\n lst+= [k]\r\n k=0\r\nprint(len(lst))\r\nprint(*lst)", "n = int(input())\r\ns = input().split('W')\r\na, b = 0, []\r\nfor i in s:\r\n if 'B' in i:\r\n a += 1\r\n b.append(len(i))\r\nprint(a)\r\nprint(*b)", "input()\r\ns=input().replace('W',' ').split()\r\nprint(len(s))\r\nfor i in s:\r\n print(len(i),end=' ')", "sizeRow = int(input())\nrow = input().split('W')\nanswer = []\nfor i in row:\n if i != '':\n answer.append(i) \nprint(len(answer))\nfor i in answer:\n print(i.count(\"B\"), end=' ')\n\n \t\t\t\t \t\t \t \t\t\t\t \t \t \t \t\t", "n=input()\nl = input().split(\"W\")\nn=int(n)\nlist = []\nfor i in l:\n if i :\n list.append(i)\nprint(len(list))\nfor i in list:\n print(len(i),\" \")\n\t\t \t\t \t\t \t\t \t\t\t \t\t \t \t", "length = int(input())\nencoded_string:str = input()\n\n# Groups of black squares \ngroups = encoded_string.split('W')\n\nint_count = 0\n\nblock_sizes = []\n\nfor group in groups:\n if group.count('B') > 0:\n int_count += 1\n block_sizes.append(str(group.count('B')))\n\nprint(int_count)\nprint(\" \".join(block_sizes))\n\n\n \t \t \t\t \t\t\t \t \t\t \t \t\t \t \t\t", "N = input()\nS = input()\nL = []\nbees = 0\ni = 0\nwhile i < len(S):\n\tif S[i] == 'B':\n\t\tbees += 1\n\telse:\n\t\tif bees > 0:\n\t\t\tL.append(bees)\n\t\t\tbees = 0\n\ti += 1\nif bees > 0:\n\tL.append(bees)\nprint(len(L))\ns = ''\nfor l in L: \n\ts += str(l) + ' '\ns.strip()\nprint(s)\n \t\t\t\t\t\t\t\t\t \t\t \t\t \t\t\t\t\t \t\t \t\t", "'''HackerRank: One-dimensional Japanese Crossword'''\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n row = input()\r\n groups = []\r\n i = 0\r\n while i < n:\r\n if row[i] == 'B':\r\n count = 1\r\n j = i + 1\r\n while j < n:\r\n if row[j] == 'B':\r\n count += 1\r\n elif row[j] == 'W':\r\n break\r\n j += 1\r\n\r\n groups.append(count)\r\n i = j + 1\r\n else:\r\n i += 1\r\n\r\n print(len(groups))\r\n print(*groups)\r\n", "n=int(input())\ns=input()\nl=[]\ncount = 0\nfor i in range(n):\n if s[i] == 'B':\n count+=1\n if i == n-1: l.append(count)\n else:\n if count>0 : l.append(count)\n count = 0\nprint(len(l))\nprint(*l)\n \t \t \t \t \t \t", "n=int(input())\r\ns=input()\r\nw=[]\r\np=0\r\nk=0\r\nfor i in range(n):\r\n if s[i]=='B':\r\n p+=1 \r\n k=1\r\n else:\r\n if k==1:\r\n w.append(p)\r\n p=0\r\n k=0\r\nif k==1:\r\n w.append(p)\r\nprint(len(w))\r\nprint(*w)", "#Ana Clara Lacaze\n#193858\n\nn = input()\na = []\nb = input().split('W')\nfor i in b:\n length = len(i)\n if length>=1:\n a.append(length)\nprint(len(a),*a)\n\t\t \t\t \t\t \t \t\t\t \t \t \t", "size = int(input())\npicross = list(input())\ncount = 0\ngroups = 0\narr = []\nfor i in range(size):\n if picross[i] == 'B':\n count += 1\n if picross[i] == 'W' or i == size - 1:\n if count != 0:\n groups += 1\n arr.append(count)\n count = 0\nprint(groups)\nprint(*arr, sep=' ')\n \t \t\t \t \t \t \t \t \t \t\t", "total=int(input()) \npattern=input().split('W') #https://www.w3schools.com/python/ref_string_split.asp learning you can use split to split characters\nN=[len(M) for M in pattern if len(M)!=0]\nprint(len(N)) \nprint(*N) #https://www.kite.com/python/answers/how-to-print-a-list-without-brackets-in-python. HOW TO PRINT A LIST WITHOUT BRAKETS AND , \n\t\t \t\t\t\t \t \t \t\t\t\t\t \t \t", "n=int(input())\r\ns= input()\r\nl= s.split(\"W\")\r\ncnt= 0\r\nfor i in l :\r\n if i is not '':\r\n cnt+=1\r\n \r\nprint(cnt)\r\nfor i in l :\r\n if i is not '':\r\n cnt+=1\r\n print(len(i),end=\" \")", "n=int(input())\r\nstr=input()\r\nc=0\r\nl=[]\r\nfor i in str:\r\n if i=='B':\r\n c+=1\r\n else:\r\n if c>0:\r\n l.append(c)\r\n c=0\r\nif c>0:\r\n l.append(c)\r\nif len(l)>0:\r\n print(len(l))\r\n for i in l:\r\n print(i,end=' ')\r\nelse:\r\n print(0)", "x=int(input())\r\ny=input()\r\nz=0\r\nl=[]\r\nh=0\r\nwhile(z<x):\r\n h=0\r\n while(z<x and y[z]==\"B\" ):\r\n h+=1\r\n z+=1\r\n if(h!=0):\r\n l.append(h)\r\n z+=1\r\nprint(len(l))\r\nz=0\r\nwhile(z<len(l)):\r\n print(l[z],end=' ')\r\n z+=1 \r\n\r\n", "input()\r\ns=[len(i) for i in input().split('W') if i]\r\nprint(len(s),'\\n',*s)", "n=int(input())\r\nb = input()\r\na=list(b)\r\na.append('W')\r\nblk=0\r\ncount=0\r\none=0\r\nd=[]\r\nfor i in range(n):\r\n if a[i]=='B':\r\n count=count+1\r\n one=1\r\n if a[(i+1)] == 'W':\r\n d.append(count)\r\n count=0\r\n blk=blk+1\r\nprint(blk)\r\nfor j in range(len(d)):\r\n e = d[j]\r\n print(e,end=' ')\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nl, c, i = [], 0, 0\r\nwhile i < n:\r\n if s[i] == 'B':\r\n c += 1\r\n x = 0\r\n while i < n and s[i] == 'B':\r\n x += 1\r\n i += 1\r\n l.append(str(x))\r\n else:\r\n i += 1\r\nprint(c)\r\nprint(' '.join(l))", "# coding: utf-8\r\n\r\nn = int(input())\r\ns = input()\r\ngroups = list()\r\nsize = 0\r\n\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n size += 1\r\n \r\n else:\r\n if size > 0:\r\n groups.append(size)\r\n \r\n size = 0\r\n\r\nif size > 0:\r\n groups.append(size)\r\n\r\nprint(len(groups))\r\nprint(*groups, sep = ' ')", "if __name__ == '__main__':\r\n\tn = int(input().strip(\" \"))\r\n\tsquare = input().strip(\" \")\r\n\tgrp = 1\r\n\tgroups = {}\r\n\tfor i in square:\r\n\t\tif i == \"B\":\r\n\t\t\tif f\"{i}_{grp}\" not in groups:\r\n\t\t\t\tgroups[f\"B_{grp}\"] = 1\r\n\t\t\telse:\r\n\t\t\t\tgroups[f\"B_{grp}\"]+=1\r\n\t\tif i == \"W\":\r\n\t\t\tgrp +=1\r\n\tprint(len(groups.keys()))\r\n\tprint(*list(groups.values()))", "n = int(input())\nchars = input()\nres = []\ncurr = 0\nfor i in range(n):\n if chars[i] == 'B':\n curr += 1\n else:\n if curr != 0:\n res.append(str(curr))\n curr = 0\nif curr != 0:\n res.append(str(curr))\nprint(len(res))\nprint(\" \".join(res))\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().split('W')\r\nif s.count('')>=1:\r\n for i in range(s.count('')):\r\n s.remove('')\r\n\r\nprint(len(s))\r\nfor i in range(len(s)):\r\n print(len(s[i]),end=\" \")", "input()\r\ns = input()\r\n \r\ncon = 0\r\nl = []\r\nfor i in s.split('W'):\r\n if len(i) > 0:\r\n l.append(str(len(i)))\r\n con += 1\r\n \r\nprint(con)\r\nprint(' '.join(l))", "n=input()\r\nl=[len(i) for i in input().split('W') if i]\r\nprint(len(l),'\\n', *l)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed May 12 20:39:09 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input()\r\nans = []\r\nd = 0\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n d += 1\r\n if i == n - 1:\r\n ans.append(d)\r\n else:\r\n if d > 0:\r\n ans.append(d)\r\n d = 0\r\nprint(len(ans))\r\nif len(ans) > 0:\r\n for i in ans:\r\n print(i, end = \" \")\r\n ", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=int(input())\ns=input(\"\")\nt=s.split('W')\nu=list(ele for ele in t if ele.strip())\nprint(len(u))\nfor i in u:\n print(len(i),end=\" \")", "n=input()\nn=int(n)\nclr=input()\ncounter=0\ncondCt=0\narr=[]\nwhile counter<n:\n if(clr[counter]==\"B\"):\n condCt+=1\n if(clr[counter]==\"W\" and condCt!=0):\n arr.append(str(condCt))\n condCt=0\n counter+=1\nif(condCt!=0):\n arr.append(str(condCt))\nprint(len(arr))\ncounter=0\nop=\"\"\nwhile(counter<len(arr)):\n op+=arr[counter]\n if(counter<(len(arr)-1)):\n op+=\" \"\n counter+=1\nprint(op)\n\t \t\t \t \t \t \t\t\t\t \t \t", "k, s = int(input()), input()\nres, k = [], 0\nfor c in s:\n if c == \"B\":\n k += 1\n elif k > 0:\n res.append(k)\n k = 0\nif k > 0:\n res.append(k)\nprint(len(res))\nif res:\n print(*res)\n", "n = int(input())\r\n\r\ns = input()\r\n\r\nbc = 0\r\nbs = []\r\n\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n bc += 1\r\n if i == n - 1:\r\n bs.append(bc)\r\n else:\r\n if bc > 0:\r\n bs.append(bc)\r\n bc = 0\r\n\r\nprint(len(bs))\r\nfor g in bs:\r\n print(g, end = \" \")\r\nprint()\r\n \r\n", "K = int(input())\r\ns = input()\r\nl1 = []\r\ncurrent_group_size = 0\r\nfor i in range(K):\r\n if s[i] == 'B':\r\n current_group_size += 1\r\n else:\r\n if current_group_size > 0:\r\n l1.append(current_group_size)\r\n current_group_size = 0\r\nif current_group_size > 0:\r\n l1.append(current_group_size)\r\n\r\nprint(len(l1))\r\nprint(*l1)", "if __name__ == '__main__':\n n = int(input())\n aux = input()\n \n aux = list(filter(lambda x: x != '', aux.split('W')))\n print(len(aux))\n for i in aux:\n print(len(i), end=' ')\n\n \t\t\t\t \t \t\t \t\t\t \t \t \t\t\t", "import sys\n\nsys.stdin.readline( ).strip( )\ns = sys.stdin.readline( ). strip( )\n\nblacks= s.split('W')\nres = [len(black) for black in blacks if len(black) > 0]\n\nprint(len(res))\nprint(' '.join(map(str, res)))\n\t \t \t \t \t\t \t\t\t\t \t\t", "#A-1-2\nn = int(input())\n#n is the length of k \nk = input()\n\ntau = []\npsi = []\n\nfor i in range(0,n):\n tau.append(k[i])\n#print(tau)\n\ny = 0\nfor i in range(0,n):\n if tau[i] == 'B' and tau[i-1] == tau[i]:\n y += 1\n #print(psi)\n if len(psi) > 0:\n psi.pop(-1)\n #print(psi)\n psi.append(y)\n elif tau[i] == 'B':\n y = 1\n psi.append(y)\n\n#print(psi)\niota = map(str, psi) \n\nif len(psi) > 0:\n print(len(psi))\n upsilon = ' '.join(iota)\n print(upsilon)\nelse:\n print('0')\n\t \t\t \t \t \t\t \t\t \t \t\t\t\t\t", "import re\r\nn = int(input())\r\ns = input()\r\nmatchs = re.findall(r\"B+\",s)\r\nprint(len(matchs))\r\nif len(matchs):\r\n print(*[len(i) for i in matchs])\r\nelse:\r\n pass", "n = int(input())\ns = input().split('W')\nans = []\nfor i in s:\n if i:\n ans.append(str(len(i)))\n\nprint(len(ans))\nif len(ans) > 0:\n print(' '.join(ans))\n\n \t \t \t\t\t \t \t\t \t \t\t \t \t", "x = int(input())\r\ncnt = 0\r\ns, arr = input(), []\r\nfor c in s:\r\n if c == 'B':\r\n cnt += 1\r\n elif cnt:\r\n arr.append(cnt)\r\n cnt = 0\r\nif cnt:\r\n arr.append(cnt)\r\nprint(len(arr))\r\nprint(*arr)", "n = int(input())\n\ns = input()\n\nnums = []\n\ncount = 0\n\nfor c in s: \n if c == 'B': \n count += 1\n else:\n if count != 0: \n nums.append(count)\n count = 0\n prev = c\nif prev == 'B': \n nums.append(count)\nprint(len(nums))\n\nfor i in range(len(nums)): \n print(nums[i], end = ' ')\nif len(nums) != 0: \n print()\n", "input()\r\ns=0\r\nL=[]\r\nfor z in input():\r\n if 'B' == z:\r\n s += 1\r\n else:\r\n if s > 0:\r\n L.append(s)\r\n s = 0\r\nif s > 0:\r\n L.append(s)\r\nprint(len(L))\r\nprint(*L)\r\n", "v=int(input());v1=input().replace(\"W\",\" \").split();print(len(v1))\r\nfor i in v1:\r\n print(len(i))", "n=int(input())\r\ns=input()\r\nif \"B\" not in s:\r\n print(\"0\")\r\nelif \"W\" not in s:\r\n print(\"1\")\r\n print(len(s))\r\nelse:\r\n l=[]\r\n while s != \"\":\r\n if s[0] == \"W\":\r\n if \"B\" not in s:\r\n break\r\n x=s.index(\"B\")\r\n s=s[x:]\r\n else:\r\n if \"W\" not in s:\r\n l.append(str(len(s)))\r\n break\r\n x=s.index(\"W\")\r\n l.append(str(x))\r\n s=s[x:]\r\n print(len(l))\r\n s=\" \".join(l)\r\n print(s)", "import math\r\nl=[]\r\nl1=[]\r\nt=int(input())\r\ns=str(input())\r\nf=s\r\nk=len(s)\r\ns1=s[k-1]\r\nif(s1=='B'):\r\n f+='W'\r\nelse:\r\n f=s\r\ng=s.count('B')\r\n\r\nsum=0\r\nif(g>0):\r\n for i in range(0,len(f),1):\r\n if(f[i]=='B'):\r\n sum+=1\r\n else:\r\n d=sum\r\n l.append(d)\r\n sum=0\r\n for i in l:\r\n if(i!=0):\r\n l1.append(i)\r\n print(len(l1))\r\n for i in l1:\r\n print(i,end=' ')\r\n print()\r\nelse:\r\n print(0)\r\n \r\n", "n=int(input())\r\ns=input().split(\"W\")\r\nc=0\r\na=''\r\nl=[]\r\n\r\nfor i in s:\r\n if i.isalpha():\r\n l.append(i)\r\nfor j in l:\r\n a+=str(j.count(\"B\"))+\" \"\r\n\r\n \r\nif len(a)==0:\r\n print(\"0\")\r\nelse:\r\n \r\n\r\n print(len(l))\r\n print(a.strip())\r\n\r\n \r\n \r\n", "n = int(input())\n\ncells = input()\n\nblk = []\n\nsize = 0\n\nlast = 'W'\n\nfor i in cells:\n if i == 'W':\n if last == 'B':\n blk.append(str(size))\n size = 0\n\n elif i == 'B':\n size += 1\n \n last = i\n\nif size > 0:\n blk.append(str(size))\n \nk = len(blk)\n\nprint(k)\n\nx = 0\n\nfor i in blk:\n if x == (k-1):\n print (i)\n \n else:\n print(i, \"\", end=\"\")\n \n x = x + 1\n\t\t \t \t\t\t\t \t\t\t\t\t \t\t \t \t\t \t\t", "n=int(input())\r\ns=input()\r\nc,count=0,0\r\nres=\"\"\r\nfor i in range(n):\r\n if s[i]=='B':\r\n c+=1\r\n elif s[i]=='W' and c>0:\r\n res+=str(c)+\" \"\r\n c=0\r\n count+=1\r\nif c>0:\r\n res+=str(c)\r\n count+=1\r\nif count==0:\r\n print(0)\r\nelse:\r\n print(count)\r\n print(res)\r\n", "z = 0\r\nc= [0]\r\na = int(input())\r\ns = str(input())\r\nfor i in range(a-1):\r\n if s[i] != s[i + 1] and s[i] == 'W':\r\n z += 1\r\n c.append(0)\r\n if s[i] == 'B':c[z] += 1\r\nif s[a-1] == \"B\": c[z]=c[z] +1\r\nif s[0] ==\"W\" : c.pop(0)\r\nprint(len(c))\r\nprint(*c)", "n = int(input())\ns = input()\n\nresult = []\n\ncounter = 0\nfor c in s:\n if c != 'B' and counter > 0:\n result.append(counter)\n counter = 0\n elif c == 'B':\n counter += 1\n\nif counter > 0:\n result.append(counter)\n\nprint(len(result))\nprint(*result)\n\n \t \t\t\t\t \t \t \t \t \t \t \t\t", "n=int(input())\r\ns=input().split('W')\r\ns=[len(i)for i in s if i]\r\nprint(len(s))\r\nprint(*s)", "n = int(input())\r\ns = list(filter(lambda x: x, map(len, input().strip().split(\"W\"))))\r\nprint(len(s))\r\nprint(*s)", "n = int(input())\nrow = input()\nrow = list(row)\n\nnum_sequencias = 0\nconjuntos = []\nblack = False\ni = 0\nk = -1\nj = 0\nwhile i < len(row):\n \n if row[i] == 'B' and i + 1 == len(row):\n num_sequencias += 1\n conjuntos.append(1)\n i += 1\n \n elif row[i] == 'B':\n black = True\n num_sequencias += 1\n conjuntos.append(1)\n k += 1\n j = i + 1\n while black == True and j < len(row):\n if row[j] == 'W':\n black = False\n i = j + 1\n else:\n conjuntos[k] += 1\n if j + 1 == len(row):\n i = j + 1\n j += 1\n \n else:\n i += 1\n\nprint(num_sequencias)\nif num_sequencias != 0:\n for i in range(len(conjuntos)):\n if i == len(conjuntos) - 1:\n print(conjuntos[i])\n else:\n print(conjuntos[i],end=\" \")\n\n\n\n\t \t\t\t \t \t\t\t \t \t \t \t\t\t \t \t \t\t", "#!/bin/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport heapq\r\n\r\nn = int(input())\r\narr = list(input())\r\n\r\nnum = []\r\ntotal = 0\r\na = 0\r\nwhile a < len(arr):\r\n if arr[a] == 'B':\r\n count = 0\r\n while a < len(arr) and arr[a] == 'B':\r\n count += 1\r\n a += 1\r\n num.append(str(count))\r\n total += 1\r\n a += 1\r\nprint(total)\r\nprint(\" \".join(num))\r\n", "import re\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nprint(len(re.findall(r'[B]{1,}', s)))\r\nfor item in re.findall(r'[B]{1,}', s):\r\n print(len(item), end = ' ')", "# CodeForces:One-dimensional Japanese Crossword\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n str=input()\r\n groupSize=[]\r\n size=0\r\n counter=0\r\n for i in str:\r\n if i =='W':\r\n if size!=0: groupSize.append(size)\r\n size=0\r\n else:\r\n if size==0:\r\n counter+=1\r\n size+=1\r\n else:\r\n size+=1\r\n if size!=0:\r\n groupSize.append(size) \r\n print(counter)\r\n if groupSize!=[]: print(*groupSize, sep=' ')\r\n", "n=int(input())\r\ns=input()\r\ni,c,ans=0,0,0\r\nl=list()\r\nwhile i<n:\r\n if s[i]==\"B\":\r\n ans+=1\r\n c=1\r\n i+=1\r\n while i<n and s[i]==\"B\":\r\n c+=1\r\n i+=1\r\n l.append(c)\r\n else :\r\n i+=1\r\nprint(ans)\r\nfor i in l:\r\n print(i,end=\" \")\r\n", "n = int(input())\r\nL = []\r\ns=input()\r\nc=0\r\nif s==((\"W\")*n):\r\n print(0)\r\nelse:\r\n for i in range(len(s)):\r\n if s[i]=='B':\r\n c=c+1\r\n else:\r\n L.append(c)\r\n c=0\r\n if s[n-1]==\"B\":\r\n L.append(c)\r\n X =[i for i in L if i!=0]\r\n print(len(X))\r\n print(' '.join(map(str,X)))\r\n ", "n=int(input())\r\n#a=[int(x) for x in input().split()]\r\ns=input()\r\n\r\nans=[]\r\n\r\ncnt=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]==\"B\":\r\n cnt+=1\r\n #print(cnt)\r\n started=True\r\n if s[i]==\"W\":\r\n if cnt!=0:\r\n ans.append(cnt)\r\n cnt=0\r\n #started=False\r\nif cnt!=0:\r\n ans.append(cnt)\r\n\r\nif len(ans)==0:\r\n print(0)\r\nelse:\r\n print(len(ans))\r\n for i in ans:\r\n print(i,end=\" \")", "a = int(input())\nb = input().split(\"W\")\nb = [len(i) for i in b if i]\nprint(len(b))\nprint(*b)\n \t \t \t \t \t \t \t \t\t \t\t \t\t\t \t\t", "n = int(input())\nrow = input()\n\nb_number = 0\nb_groups = []\n\nfor i in range(len(row)):\n if (row[i] == 'W') and b_number != 0:\n b_groups.append(b_number)\n b_number = 0\n if row[i] == 'B':\n b_number += 1\n if i == len(row) - 1:\n b_groups.append(b_number)\n\nprint(len(b_groups))\n\nfor i in range(len(b_groups)):\n print(b_groups[i], end = ' ')\n\t\t\t \t \t\t \t \t\t\t \t \t\t \t \t\t", "n = int(input())\nstr = input()\nwords = []\nsum = 0\nfor i in range(n):\n\tif str[i] == 'B': sum += 1\n\tif str[i] == 'W':\n\t\tif sum: words.append(sum)\n\t\tsum = 0\nif sum: words.append(sum)\nprint(len(words))\nif len(words): print(*words)\n \t \t\t\t\t\t\t \t \t \t\t \t\t \t\t", "n=int(input())\r\ns=input()\r\nc=[]\r\ni=0\r\nwhile i<len(s):\r\n j=i+1\r\n if s[i]==\"B\":\r\n \r\n while j<len(s):\r\n if s[j]!=\"B\":\r\n break\r\n j+=1\r\n c.append(j-i)\r\n i=j\r\nprint(len(c))\r\nfor i in c:\r\n print(i,end=' ')", "input()\nx = input().split('W')\ny= [len(i) for i in x if len(i)>0]\nprint(len(y))\nprint(*y)\n\t \t \t \t \t\t \t\t\t \t \t\t \t \t", "n = int(input())\ncaracteres = input()\n\nnumQuadrados = 0\ncontador = 0\ntamanhoQuadrados = []\n\nfor i in range(n):\n if caracteres[i] == 'B':\n if contador == 0:\n numQuadrados += 1\n contador +=1\n if i == n-1:\n tamanhoQuadrados.append(contador)\n else:\n if contador > 0:\n tamanhoQuadrados.append(contador)\n contador = 0\n\nprint(numQuadrados)\nif tamanhoQuadrados != []:\n print(*tamanhoQuadrados)\n \t \t\t \t \t \t\t \t\t\t\t", "n = int(input())\ns = input()\nl =[]\ncount = 0\nfor i in range(n):\n if (s[i] == 'B'):\n count +=1\n if (i == n-1):\n l.append(count)\n else:\n if (count > 0):\n l.append(count)\n count = 0\nprint(len(l))\nprint(*l, sep=' ')\n\n# https://stackoverflow.com/questions/11178061/print-list-without-brackets-in-a-single-row\n\n \t \t \t \t \t \t\t\t \t\t\t\t \t", "x = input()\nx = int(x)\ny = input()\ny = list(y)\noutput = []\ncounter = 0\nfor letters in y:\n if counter != 0 and letters == 'W':\n output.append(counter)\n counter = 0\n if letters == 'B':\n counter += 1\nif counter != 0:\n output.append(counter)\nprint(len(output))\nfor out in output:\n print(out, end = ' ')\n \t \t \t\t \t\t \t\t \t \t", "t = int(input())\r\na = input().replace(\"W\",\" \")\r\na = a.split()\r\nprint(len(a))\r\nfor i in a:print(len(i),end=\" \")", "n=int(input())\r\ns=input()\r\nli=[]\r\ncount=0\r\nfor i in range(n):\r\n if(s[i]=='B'):\r\n \r\n count+=1\r\n if(i==n-1):\r\n li.append(count)\r\n else:\r\n if(count>0):\r\n li.append(count)\r\n count=0\r\n \r\n\r\n\r\ncount2=0 \r\nif(s[0]=='B'):\r\n count2+=1\r\nfor i in range(n-1):\r\n \r\n if(s[i]=='W' and s[i+1]=='B'):\r\n count2+=1\r\n \r\nprint(count2)\r\nfor i in range(len(li)):\r\n print(li[i],end=' ')", "number = int(input())\r\nfirst = input()\r\ngp = 0\r\nsecond = []\r\ncounter = 0\r\nfor i in range(number):\r\n if first[i] == \"B\":\r\n counter += 1\r\n elif counter > 0:\r\n gp += 1\r\n second.append(counter)\r\n counter = 0\r\nif counter > 0:\r\n second.append(counter)\r\n gp += 1\r\nprint(gp)\r\nprint(*second)", "import time\r\n\r\ndef identifyBlackGroups(rowLen, bwRow):\r\n bList = []\r\n indCount = 0\r\n blackFound = False\r\n\r\n for x in range(rowLen):\r\n # print(bwRow[x])\r\n if bwRow[x] == \"W\":\r\n if blackFound == True:\r\n bList.append(indCount)\r\n indCount = 0\r\n blackFound = False\r\n\r\n elif bwRow[x] == \"B\":\r\n blackFound = True\r\n indCount+=1\r\n\r\n if blackFound == True:\r\n bList.append(indCount)\r\n indCount = 0\r\n blackFound = False\r\n\r\n return bList\r\n\r\ndef printResults(listA):\r\n print(len(listA))\r\n print(\" \".join(str(blacks) for blacks in listA))\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n rowLen = int(input())\r\n bwRow = input()\r\n\r\n printResults(identifyBlackGroups(rowLen, bwRow))\r\n\r\n\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()\r\n", "input()\r\na = list(input().split('W'))\r\nb = list(len(i) for i in a if len(i)>0)\r\nprint(len(b))\r\nprint(*b)", "#721A (50No. Problem A)\r\nn = int(input())\r\nstring = input()\r\nb = ''\r\ns = 0\r\nl = list(string.split('W'))\r\nfor i in l:\r\n if (i != ''):\r\n s+=1\r\n b+=str(len(i)) + ' '\r\nprint(s) \r\nprint(b) ", "def main():\n n = int(input());\n linha = input();\n grupos = [];\n seq = 0;\n resp = \"\";\n for i in range(n):\n if(linha[i] == 'B'):\n seq += 1;\n elif(linha[i] == 'W' and seq > 0):\n grupos.append(seq);\n seq = 0;\n if(seq > 0):\n grupos.append(seq);\n print(len(grupos));\n for i in grupos:\n print(i, end=' ');\n\nmain();\n\t \t\t\t \t\t\t\t\t\t\t\t\t \t \t \t\t \t\t \t", "n = int(input())\ncol = input()\npat = []\nx = 0\nctr = 0\n\nfor i in range(n):\n if col[i] == 'W':\n #print(\"S1\")\n continue\n elif not pat:\n #print(\"S2\")\n pat.append(1)\n ctr += 1\n continue\n elif col[i-1] == 'B':\n #print(\"S3\")\n #print(x)\n pat[x] += 1\n ctr += 1\n continue\n elif col[i] == 'B':\n #print(\"S4\")\n pat.append(1)\n x += 1\n ctr += 1\n else: print (\"error\")\n \n \nprint(len(pat))\nprint(\" \".join(map(str, pat))) \n \t \t\t \t \t\t\t \t \t\t \t\t\t \t\t \t", "x=int(input())\r\nn=input()\r\nk=0\r\nl=[]\r\nfor i in range(x):\r\n if(n[i]==\"B\"):\r\n k+=1\r\n else:\r\n l.append(str(k))\r\n k=0\r\nl.append(str(k))\r\np=l.count(\"0\")\r\nfor i in range(p):\r\n l.remove(\"0\")\r\nprint(len(l))\r\nprint(\" \".join(l))\r\n ", "input()\nx = [len(y) for y in input().split('W') if y]\nprint(len(x))\nprint(*x)\n\n# For loop within list taken from: https://www.w3schools.com/python/python_lists_loop.asp\n \t\t \t \t \t \t \t \t \t\t \t \t", "n = int(input())\r\ns = input()\r\narr = [0]*n\r\na = 0\r\nj = 0\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n a += 1\r\n arr[j] = a\r\n if i == n-1:\r\n j+=1\r\n elif a!= 0:\r\n a = 0\r\n j+=1\r\n\r\nprint(j)\r\nfor i in range(j):\r\n print(arr[i], end=\" \")", "if __name__ == \"__main__\":\r\n n = int(input().strip())\r\n s = input().strip()\r\n s = s.split('W')\r\n\r\n def fil(lis):\r\n for i in lis:\r\n if i != \"\":\r\n return True\r\n else:\r\n return False\r\n s = list(filter(fil, s))\r\n\r\n print(len(s))\r\n for i in s:\r\n print(len(i), end=\" \")\r\n", "n=int(input())\na=input()\nb=0\nc=[]\ni=0\nwhile i<n:\n if a[i]=='B':\n b=b+1\n e=0\n while i<n and a[i]=='B':\n e=e+1\n i=i+1\n c.append(e)\n i=i+1\nprint(b)\nif b!=0:\n print((' ').join(str(x) for x in c))\n\t\t \t \t \t\t\t\t\t \t\t \t \t \t\t \t", "count = 0\nn = input()\nletters = input()\nB = letters.split('W')\nlength = []\nfor i in B:\n if i != \"\":\n length.append(len (i))\n count += 1\nprint(count)\nfor i in length:\n print(i, end = \" \")\n \t\t \t\t \t \t\t \t\t\t\t\t\t \t\t", "input()\r\nb=list(filter(lambda x : len(x)!=0,input().split('W')))\r\nprint(len(b),'\\n', *map(lambda x : len(x), b))", "n = int(input())\r\nstr = input()\r\narray = str.split(\"W\")\r\nwhile \"\" in array:\r\n array.remove(\"\")\r\nprint(len(array))\r\nfor a in range(len(array)):\r\n print(len(array[a]), end=\" \")", "lst=[]\r\nf=0\r\nc=0\r\nz=int(input())\r\nx=list(map(str,input()))\r\nfor i in range(z):\r\n if x[i]=='B':\r\n c+=1\r\n if f==z-1:\r\n lst.append(c)\r\n # print('lllllllllll',lst)\r\n \r\n# print('c=',c)\r\n# print('******')\r\n else:\r\n if c>0:\r\n lst.append(c)\r\n #print('lst=',lst)\r\n c=0\r\n f+=1 \r\nprint(len(lst))\r\nprint(*lst) \r\n\r\n", "n=int(input())\r\nst=list(input())\r\nl=[]\r\ni=0\r\nwhile(i<n):\r\n x=st[i]\r\n if x=='B':\r\n c=0\r\n for j in range(i,n):\r\n if x==st[j]:\r\n c+=1\r\n i+=1\r\n else:\r\n break\r\n l.append(c)\r\n i+=1\r\n\r\nprint(len(l))\r\nfor i in l:\r\n print(i,end=\" \")\r\n \r\n", "n = int(input())\r\n\r\ns = input()\r\n\r\nX = 0\r\nnew = True\r\nL = []\r\n\r\nfor each in s:\r\n if each == \"W\":\r\n new = True\r\n if X != 0:\r\n L.append(X)\r\n X = 0\r\n else:\r\n if new:\r\n new = False\r\n X = 1\r\n else:\r\n X += 1\r\nif not new and X != 0:\r\n L.append(X)\r\n\r\nprint(len(L))\r\nprint(*L)\r\n", "n=int(input())\r\nflag=0\r\ncount=0\r\ns=\"\"\r\ns1=list(input())\r\ns1.append(\"W\")\r\nfor i in range(n):\r\n\tif s1[i]==\"B\" and s1[i+1]==\"W\":\r\n\t\tcount+=1\r\n\tif s1[i]==\"B\":\r\n\t\tflag+=1\r\n\t\tif s1[i+1]==\"W\":\r\n\t\t\ts=s+str(flag)+\" \"\r\n\t\t\tflag=0\r\nprint(count)\r\nif count>0:\r\n\tprint(s)\r\n", "#%% 721a Japanese crossword \r\n\r\ninput()\r\ns = [x for x in input().split('W') if x!='']\r\nprint(len(s),'\\n',*map(len,s))\r\n", "def solution():\n def solve(k, rows):\n counts = 0\n curr = 0\n res = []\n \n for c in rows[0]:\n if c == 'B':\n if curr == 0:\n counts += 1\n curr += 1\n else:\n if curr:\n res.append(curr)\n curr = 0\n if curr:\n res.append(curr)\n \n print(counts)\n for i, c in enumerate(res):\n if i == len(res) - 1:\n print(str(c))\n else: print(str(c) + \" \", end=\"\")\n\n\n rows = int(input())\n row = input().split() \n solve(rows,row)\nsolution()\n \t \t \t \t\t\t \t\t \t\t\t\t\t \t \t\t\t\t\t", "n = int(input())\r\nstr = list(input().split('W'))\r\nans = []\r\n\r\nfor c in str:\r\n if c != \"\" : ans.append(len(c))\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i, end = \" \")", "num1 = input()\npasscode = input()\nresult = \"\"\nlist_1 = []\nfor i in passcode:\n if i == \"B\":\n result += i\n else:\n list_1.append(result)\n result = \"\"\n\nlist_1.append(result)\noutput_num = 0\nsize = ''\nfor passcode in list_1:\n if passcode!='':\n output_num+=1\n size+=str(len(passcode))+ \" \"\n\nprint(output_num)\nprint(size)\n\n# discuss with tian tian and Zhangjie Pan (zpan24)\n \t\t \t\t \t \t\t \t\t \t\t \t\t\t\t", "#721A\r\nn=int(input())\r\nl1=list(input().split(\"W\"))\r\nl2=[];c=0\r\nfor i in l1:\r\n if i!=\"\":l2.append(len(i));c+=1\r\nprint(c)\r\nprint(*l2)\r\n", "n = int(input())\r\na = [len(s) for s in input().split('W') if len(s) > 0]\r\nprint(len(a))\r\nprint(*a)\r\n", "N = int(input())\ns = input()\nx = s.split('W')\ny = list(filter(None, x))\nresult = ''\nfor i in y:\n result += str(len(i)) + ' '\nprint(len(y))\nprint(result)\n \t\t\t \t\t \t \t\t\t \t \t \t \t\t", "t = int(input())\r\ns = input()\r\nl = s.split('W')\r\ncount=0\r\nfor i in range(len(l)):\r\n if('B' in l[i]):\r\n count+=1\r\nprint(count)\r\nfor i in range(len(l)):\r\n if('B' in l[i]):\r\n print(len(l[i]), end=\" \")\r\n", "n=int(input())\r\nlist0=input().split(\"W\")\r\nlist1=[]\r\nr=0\r\nfor i in list0:\r\n if len(i)!=0:\r\n list1.append(len(i))\r\nif 0 in list1:\r\n list1.remove(0)\r\nprint(len(list1))\r\nif len(list1)!=0:\r\n print(\" \".join(map(str,list1)))", "n = int(input())\r\ns = input()\r\nans = []\r\ni = -1\r\nwhile i != n-1:\r\n\tif s[i+1] == 'B':\r\n\t\tcnt = 0\r\n\t\twhile i < n-1 and s[i+1]=='B':\r\n\t\t\tcnt += 1\r\n\t\t\ti += 1\r\n\t\tans.append(cnt)\r\n\telse:\r\n\t\ti += 1\r\nprint(len(ans))\r\nif ans:\r\n\tprint(*ans)", "n=int(input())\r\ns=str(input())\r\ncnt=0\r\nl=[]\r\nfor i in range(n):\r\n if s[i]=='B':\r\n cnt+=1\r\n if i==n-1:\r\n l.append(cnt)\r\n elif s[i]=='W':\r\n l.append(cnt)\r\n cnt=0\r\n\r\n\r\nlen=len(l)\r\nif len!=0:\r\n for j in l:\r\n if j==0:\r\n len-=1\r\n print(len)\r\n for k in l:\r\n if k!=0:\r\n print(k,end=' ')\r\nelse:\r\n print(1)\r\n print(n)", "n=int(input())\r\ns=input()\r\nl=s.split(\"W\")\r\ns=[]\r\nfor i in l:\r\n if i!=\"\":\r\n s.append(len(i))\r\nprint(len(s))\r\nprint(*s)", "n=int(input())\r\ns=input()\r\nk=s.split('W')\r\nl=[]\r\nfor i in k:\r\n if i.count('B')!=0:\r\n l.append(i.count('B'))\r\nprint(len(l))\r\nfor i in l:\r\n print(i,end=' ')", "n = int(input())\r\ns = input().split('W')\r\ns = [len(i) for i in s if i ]\r\nprint(len(s))\r\nprint(*s)\r\n\r\n\r\n", "n = int(input())\nbw = input().split('W')\nresult = []\nfor i in bw:\n if i != '':\n result.append(len(i))\nprint(len(result))\nprint(*result)\n \t \t\t \t\t \t\t \t \t \t \t \t \t", "length = int(input())\nrow = input()\nresults = []\nb_counter = 0\nfor letter in row:\n if letter == 'B':\n b_counter += 1\n elif b_counter != 0:\n results.append(str(b_counter))\n b_counter = 0\nif b_counter > 0:\n results.append(str(b_counter))\nprint(len(results))\nprint(' '.join(results))\n\t \t \t\t \t\t \t \t\t \t\t \t\t \t\t", "n = int(input())\r\nletters = input()[:n]\r\ngroups = []\r\n\r\nfor i in range(n):\r\n if i == 0 :\r\n if letters[i] == \"B\":\r\n groups.append(1)\r\n else:\r\n if letters[i] == \"B\" and letters[i-1] == \"B\":\r\n groups[-1] += 1\r\n elif letters[i] == \"B\" and letters[i-1] == \"W\":\r\n groups.append(1)\r\n \r\nprint(len(groups))\r\nfor i in range(len(groups)):\r\n print(groups[i],end=\" \")", "n = int(input())\nsquares = str(input())\ncrossword = []\n \ni = 0\nwhile i < len(squares):\n sum = 0\n j = i\n while j < n and squares[i] == squares[j]:\n j+=1 \n sum+=1\n if squares[i] == 'B':\n crossword.append(sum)\n \n i=j\n \nprint(len(crossword))\nfor i in crossword:\n print(i, end=\" \")\n\t \t \t \t\t\t \t\t\t \t \t\t\t \t", "n = int(input())\r\nstr = input()\r\n\r\nindex = 0\r\nblack_started = False\r\nblack_group_count = 0 \r\n\r\nwhile(index < len(str)):\r\n if black_started:\r\n if(str[index] == 'B'):\r\n index += 1\r\n continue\r\n elif(str[index] == 'W'):\r\n black_started = False\r\n index += 1\r\n continue\r\n\r\n if(str[index] == 'B'):\r\n black_started = True\r\n black_group_count += 1\r\n\r\n index += 1\r\n\r\n\r\nprint(black_group_count)\r\n\r\n\r\nindex = 0\r\nb_count = 0\r\nfrequency = []\r\nwhile(index < len(str)):\r\n if(str[index] == 'W' and b_count == 0):\r\n index += 1\r\n continue\r\n\r\n if(str[index] == 'B'):\r\n b_count += 1\r\n \r\n if(str[index] == 'W' and b_count != 0):\r\n frequency.append(b_count)\r\n b_count = 0\r\n\r\n index += 1\r\n\r\nif(b_count != 0): \r\n frequency.append(b_count)\r\n\r\n\r\nif(len(frequency) != 0):\r\n i = 0\r\n while(i < len(frequency)):\r\n if( i != len(frequency) - 1):\r\n print(frequency[i], end=\" \")\r\n else: print(frequency[i])\r\n\r\n i += 1\r\n\r\n", "n=int(input())\r\nbw=list(input())\r\nlists=[]\r\ncound= 0\r\nfor i in bw:\r\n\tif i ==\"W\":\r\n\t\tif cound>0:\r\n\t\t\tlists.append(cound)\r\n\t\t\tcound=0\r\n\telse:\r\n\t\tcound+=1\r\nif cound>0:\r\n\tlists.append(cound)\r\nprint(len(lists))\r\nprint(*lists)", "n=int(input())\na=input()\nl=[]\ncount=0\ncount1=0\nfor i in range (n):\n if(a[i]=='B'):\n count+=1\n else:\n if(count>0):\n l.append(count)\n count=0\n else:\n continue\nif(count>0):\n l.append(count)\nprint(len(l))\nprint(*l)\n ", "x=int(input())\r\ny=input().upper()\r\nl=list(filter(lambda x:x!='',y.split('W')))\r\nc=[len(i) for i in l]\r\nprint(len(l))\r\nprint(' '.join(map(str,c)))\r\n", "n=int(input())\r\ns=input()\r\narr=[]\r\ni=0\r\nc=0\r\na=0\r\nwhile(i<n):\r\n if(s[i]==\"B\"):\r\n c+=1\r\n else:\r\n if(c>0):\r\n a+=1\r\n arr.append(c)\r\n c=0\r\n i+=1\r\nif(c>0):\r\n a+=1\r\n arr.append(c)\r\nprint(a)\r\nif(a>0):\r\n for i in arr:\r\n print(i,end=\" \",sep=\"\")", "n =int(input()) \r\nseq = input() + 'x'\r\nblakseq = 0\r\nlis_sq_len = []\r\nfor i in seq : \r\n if i ==\"B\" : \r\n blakseq +=1 \r\n else:\r\n if blakseq == 0 : \r\n continue\r\n else: \r\n lis_sq_len.append(blakseq)\r\n blakseq = 0\r\nprint(len(lis_sq_len))\r\nfor i in lis_sq_len : \r\n if i == 0 : \r\n continue \r\n else : \r\n print(i , end =\" \")\r\n", "n = int(input())\r\ns = input()\r\ncounter= 1 if s[-1] =='B' else 0\r\nfor i in range(n-2,-1,-1):\r\n if s[i] == 'B' and s[i+1] != 'B':\r\n counter+=1\r\nm = s.split('W') \r\nx=[]\r\nfor j in m:\r\n if len(j)>0:\r\n x.append(str(len(j)))\r\nprint(counter)\r\nprint(' '.join(x))", "n=int(input())\r\ns,count,l=input(),0,[]\r\ns+='W'\r\nfor i in range(0,len(s)):\r\n if s[i]=='W':\r\n l.append(count)\r\n count=0\r\n continue\r\n count+=1\r\nnl,c=[],0 \r\nfor e in l:\r\n if e!=0:\r\n c+=1\r\n nl.append(e)\r\nprint(c)\r\nif c!=0:print(*nl)", "def solve(n, m):\r\n\r\n count = 0\r\n result = []\r\n for x in m:\r\n if x == \"B\":\r\n count += 1\r\n elif count > 0:\r\n result.append(str(count))\r\n count = 0\r\n\r\n if count > 0:\r\n result.append(str(count))\r\n\r\n if len(result) > 0:\r\n print(len(result), ' '.join(result), sep='\\n')\r\n else:\r\n print(0)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = int(input()), input()\r\n solve(n, m)", "n = int(input())\r\ns = input()\r\nanswer = [len(i) for i in s.split(\"W\") if len(i)]\r\nprint(len(answer))\r\nprint(*answer)", "n = int(input())\nlista = list(input()) \ncontador = 0\nlista1=[]\ncont1=0\nfor i in range(len(lista)):\n letra = lista[i]\n if letra == 'B':\n contador +=1\n elif letra == 'W':\n if contador >0:\n lista1.append(contador)\n cont1+=1\n contador = 0\nif contador >0:\n lista1.append(contador)\n cont1+=1\nprint(cont1)\nfor i in range(len(lista1)):\n print(lista1[i], end=' ')\n \t\t \t\t \t \t \t\t \t \t \t \t", "n = int(input())\r\ns = input()\r\nx = 0\r\nc = 0\r\nl = []\r\nwhile x<n:\r\n\tif s[x]==\"B\":\r\n\t\tc+=1\r\n\telse:\r\n\t\tif c:\r\n\t\t\tl.append(c)\r\n\t\t\tc = 0\r\n\t# print(x)\r\n\tx+=1\r\nif c:\r\n\tl.append(c)\r\nprint(len(l))\r\nif l:\r\n\tprint(*l)\t\r\n", "n = int(input())\r\na = input().split('W')\r\nb = [len(i) for i in a if len(i)>0]\r\nprint(len(b))\r\nprint(*b)", "n = (int)(input())\r\ns = input()\r\n\r\nans = []\r\ncnt = 0 \r\nfor x in s :\r\n if x == \"B\" : cnt += 1\r\n else :\r\n if cnt > 0 : ans.append(cnt)\r\n cnt = 0\r\nif cnt > 0 : ans.append(cnt)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "input()\nS = input()\nK = list(filter(lambda x: x != \"0\", map(lambda x: str(len(x.replace('W', ''))), S.split('W'))))\nprint(len(K))\nprint(\" \".join(K))", "n=int(input())\r\nblocks=input().split('W')\r\nblocks=[i for i in blocks if i!='']\r\nprint(len(blocks))\r\nprint(' '.join([str(len(a)) for a in blocks]))", "'''\r\n\tCodeForces 721A\r\n\tOne-dimensional Japanese Crossword\r\n\r\n\tTags: String manipulation\r\n'''\r\nimport re\r\n\r\ninput()\r\ns = input()\r\n\r\nans = list(map(len, re.findall(r'B+', s)))\r\n\r\nprint(len(ans))\r\nif len(ans) > 0:\r\n\tprint(*ans)", "\r\nnum_chars = int(input())\r\n\r\nseq = input()\r\n\r\n\r\ngroups = []\r\n\r\nlast_black = False\r\ncurrent_run_index = 0\r\n\r\nfor char in seq:\r\n\r\n if char == \"B\":\r\n if last_black is False:\r\n groups.append([\"B\"])\r\n last_black = True\r\n else:\r\n groups[current_run_index].append(\"B\")\r\n\r\n else:\r\n if last_black is True:\r\n current_run_index += 1\r\n\r\n last_black = False\r\n\r\n\r\nprint(len(groups))\r\nout = \"\"\r\n\r\nfor group in groups:\r\n\r\n out += \"%d \" % (len(group))\r\n\r\nprint(out)\r\n", "a = int(input())\r\nb = input()\r\ng = 0\r\ns = []\r\nfor cube in b:\r\n if cube == \"B\":\r\n g += 1\r\n elif g > 0:\r\n s.append(str(g))\r\n g = 0\r\nif g > 0:\r\n s.append(str(g))\r\nprint(len(s))\r\nprint(' '.join(s))", "k=input()\r\ns=input().split('W')\r\na=[]\r\nfor i in s:\r\n if 'B'in i:\r\n a.append(len(i))\r\nprint(len(a))\r\nprint(*a)\r\n\r\n", "from re import split\n\ninput()\nrow = input()\n\ngroups = list(map(lambda x: str(len(x)), split(r'W+', row)))\nif groups[0] == '0':\n groups.pop(0)\n\nif groups[-1] == '0':\n groups.pop(-1)\n\nprint(len(groups))\nprint(' '.join(groups))\n\n \t\t\t\t\t\t \t\t\t \t \t \t\t \t\t\t\t", "_ = input()\r\narr = [str(len(x)) for x in input().replace('W', ' ').split()]\r\nprint(len(arr))\r\nprint(' '.join(arr))", "n=int(input())\r\ns=input()\r\ni=0\r\nlist1=[]\r\nwhile i<=len(s)-1:\r\n p=0\r\n if s[i]=='B':\r\n while i<len(s) and s[i]=='B':\r\n p=p+1\r\n i+=1\r\n list1.append(p)\r\n i+=1\r\nprint(len(list1))\r\nfor i in list1:\r\n print(i,end=\" \")\r\n \r\n \r\n", "import itertools\r\nimport math\r\nimport sys\r\nimport heapq\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom fractions import gcd\r\nfrom functools import reduce\r\nsys.setrecursionlimit(4100000)\r\nINF = 1 << 60\r\n\r\n#ここから書き始める\r\nn = int(input())\r\ns = [i for i in input().split(\"W\") if i != \"\"]\r\n# print(s)\r\nprint(len(s))\r\nans = [len(i) for i in s]\r\nprint(*ans)", "def crossword():\r\n return None\r\n\r\n\r\nn = int(input())\r\nk = input()\r\n\r\ncount = 0\r\nblack_word = []\r\nfor i in range(n):\r\n if k[i] == 'B':\r\n count += 1\r\n if i == n-1 and k[i] == 'B':\r\n if count >= 1:\r\n black_word.append(count)\r\n elif k[i] == 'W':\r\n if count >= 1:\r\n black_word.append(count)\r\n count = 0\r\nprint(len(black_word))\r\nfor j in black_word:\r\n print(j, end=' ')\r\n", "n = int(input())\r\ns = input()\r\nans = []\r\ncnt = 0\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n cnt += 1\r\n else:\r\n ans.append(cnt)\r\n cnt = 0\r\nans.append(cnt)\r\nwhile 0 in ans:\r\n ans.remove(0)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n=int(input())\r\ns=input()\r\nc=0\r\nm=0\r\nk=[]\r\nfor i in range(len(s)):\r\n if s[i]==\"B\":\r\n m+=1\r\n elif m!=0 and s[i]==\"W\":\r\n k.append(m)\r\n m=0\r\n c+=1\r\nif m!=0:\r\n c+=1\r\n k.append(m)\r\nprint(c)\r\nprint(*k)\r\n \r\n", "input()\r\ninp = list(input())\r\nnum = int()\r\nmatrix = []\r\n\r\nif inp[-1] == \"B\":\r\n inp.append(\"W\")\r\n\r\nfor x in range(len(inp)):\r\n if inp[x] == \"B\":\r\n num = num + 1\r\n elif inp[x] == \"W\":\r\n matrix.append(str(num))\r\n num = int()\r\n if matrix[-1] == \"0\":\r\n matrix.pop(-1)\r\nprint(len(matrix))\r\nprint(\" \".join(matrix))", "n = int(input())\ns = input().upper()\ngroups = 0\nlenghts = []\nl = 0\n\nfor i in range(len(s)):\n if s[i] == \"B\":\n l += 1\n else:\n if l > 0:\n lenghts.append(l)\n groups += 1\n l = 0\n\nif l > 0:\n lenghts.append(l)\n groups += 1\n\nprint(groups)\nprint(*lenghts)\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\ns = input()\r\nl = []\r\nc=0\r\nfor i in s:\r\n if i=='B':\r\n c=c+1\r\n\r\n else:\r\n if c!=0:\r\n l.append(c)\r\n c=0\r\nif c!=0:\r\n l.append(c)\r\nprint(len(l))\r\nif len(l)>0:\r\n for i in l:\r\n print(i, end= ' ')\r\n", "n = int(input())\r\na = input()\r\nc,v =0,[]\r\nfor i in a:\r\n\tif i == \"B\":c+=1\r\n\telse:\r\n\t\tif c!=0:v.append(c);c=0\r\nif c!=0:v.append(c)\r\nprint(len(v))\r\nprint(*v)", "n = input()\nmessage = list(map(str, input().strip()))\nmessage.append('0')\nflag = 0\nres = 0\nvet = []\nfor item in message:\n if item == 'B':\n res+=1\n flag = 1\n if item == 'W' and flag == 1:\n vet.append(res)\n flag = 0\n res = 0\n if item == '0' and res != 0:\n vet.append(res)\nprint(len(vet))\nprint(*vet, sep=' ')\n \n \t \t \t\t \t \t \t \t", "N=int(input())\r\narray=list(input())+[\"W\"]\r\nsomething=[]\r\ncounter=0\r\nfor i in range(N+1):\r\n\tif array[i]==\"B\":\r\n\t\tcounter+=1\r\n\tif array[i]==\"W\":\r\n\t\tif counter!=0:\r\n\t\t\tsomething.append(counter)\r\n\t\tcounter=0\r\nprint(len(something))\r\nprint(*something,sep=\" \")", "n = int(input())\ns = input()\nlst = []\ncnt, group = 0, 0\nfor i in range(n):\n if s[i] == 'B' and cnt == 0: cnt = 1\n elif s[i] == 'B': cnt += 1\n else:\n if cnt != 0: \n lst.append(cnt)\n group += 1\n cnt = 0\nif cnt != 0: \n lst.append(cnt)\n group += 1\nprint(group)\nprint(*lst)\n \t\t \t \t\t \t \t\t\t\t\t\t \t\t\t\t\t", "n = int(input())\r\ns = input()\r\ncount = 0\r\nhasil = 0\r\narray = []\r\narray1 = []\r\nfor i in range(len(s)):\r\n if s[i] == \"B\" and array == []:\r\n array += [i]\r\n hasil += 1\r\n count += 1\r\n elif s[i] == \"B\" and array != []:\r\n count += 1\r\n if s[i] == \"W\" or i == (len(s)-1):\r\n array = []\r\n if count > 0:\r\n array1 += [count]\r\n count = 0\r\n\r\nprint(hasil)\r\n\r\nfor i in array1:\r\n print(i,end=\" \")", "n = int(input())\r\nlst = input().split('W')\r\nm = 0\r\n\r\nfor element in lst:\r\n if len(element) > 0:\r\n m += 1\r\nprint(m)\r\n\r\nfor element in lst:\r\n if len(element) > 0:\r\n print(len(element), end=' ')", "n = int(input())\r\ncross = input()\r\nanswer = []\r\ncross = cross.replace(\"W\", \" \")\r\ncross = cross.split()\r\nfor i in range(len(cross)):\r\n answer.append(len(cross[i]))\r\n\r\nanswer = [str(item) for item in answer]\r\nprint(len(answer))\r\nprint(\" \".join(answer))\r\n", "n=int(input())\r\ncross=input() \r\n\r\ncurr_group=0 \r\nlisss=[] \r\ngroup=0 \r\n\r\nfor i in range(0,n):\r\n if cross[i]==\"B\":\r\n curr_group+=1 \r\n else:\r\n if curr_group>0:\r\n lisss.append(curr_group)\r\n group+=1 \r\n curr_group=0 \r\n\r\nif curr_group>0:\r\n lisss.append(curr_group)\r\n group+=1 \r\n\r\nprint(group)\r\nprint(*lisss)", "# A.4.1\nn = input()\ns = input()\na = 0\nb = 0\nc = []\nfor i in s:\n if i == \"B\":\n b += 1\n else:\n if b != 0:\n c.append(b)\n b = 0\nif b != 0:\n c.append(b)\n\nprint(len(c))\nfor j in c:\n print(j, end=\" \")\n\t\t \t\t\t \t \t \t \t \t\t \t \t", "length=input()\nstring=input()\n\nBGroup=''\nBGroups=[]\n\nfor char in string:\n if char=='B':\n BGroup+=char\n else:\n BGroups.append(BGroup)\n BGroup=''\n\nBGroups.append(BGroup)\n\nBGroupsNumber=0\nBGroupsLengths=''\n\nfor string in BGroups:\n if string!='':\n BGroupsNumber+=1\n BGroupsLengths+=str(len(string))+' '\n\nprint(BGroupsNumber)\nprint(BGroupsLengths)\n\t \t\t\t\t \t \t\t \t \t\t \t\t\t\t \t", "# cite source: https://www.geeksforgeeks.org/python-split-multiple-characters-from-string/\n# https://www.geeksforgeeks.org/print-lists-in-python-4-different-ways/\nn = int(input()) #integer\nz = list(input().split('W')) # example: ['', 'BBBB', '', 'B', 'BBB', '']\n#in this example, split is being used to remove Ws\na = [len(i) for i in z if i != ''] # counts length of list(z) after Ws and spaces are removed\nprint(len(a)) # prints amount of groups of B \nprint(*a) #print types of a \n#formatting is a bit unique here, because we remove Ws from the input and create a list that we must find print the length of\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\ncount = 0\r\ntmp = 0\r\nans = []\r\nfor i in range(N):\r\n if S[i] == 'B':\r\n count += 1\r\n else:\r\n if count > 0:\r\n ans.append(count)\r\n count = 0\r\n\r\nif count > 0:\r\n ans.append(count)\r\n\r\nprint(len(ans))\r\nprint(\" \".join(str(i) for i in ans))\r\n\r\n\r\n", "n_ = int(input())\r\ns = input()\r\ntotal = 0\r\nn = []\r\nt_ = 0\r\nfor i in range(n_):\r\n if s[i] == 'B':\r\n t_ += 1\r\n if s[i] == 'W':\r\n if t_ > 0:\r\n n.append(t_)\r\n total += 1\r\n t_ = 0\r\nif t_ > 0:\r\n n.append(t_)\r\n total += 1\r\nprint(total)\r\nprint(*n)", "n, s, dem, lst, res = int(input()), input() + 'W', 0, [], 0\r\nfor x in range(n):\r\n if s[x] == 'B' and s[x + 1] == 'W':\r\n lst.append(dem + 1)\r\n dem, res = 0, res + 1\r\n elif s[x] == 'B': dem += 1\r\nprint(res)\r\nprint(*lst)", "n = int(input())\narr = list(map(str, input()))\n\nl = []\nbc = 0\n\nfor i in range(n):\n if arr[i] == 'B':\n bc += 1\n\n if (arr[i-1] == 'B' and arr[i] == 'W') or i == n-1:\n if bc != 0:\n l.append(bc)\n bc = 0\n\nprint(len(l))\nprint(*l)\n", "length, squares = input(), input()\n\nk = i = 0\nsizes = []\n\nwhile i < len(squares):\n if squares[i] != \"B\":\n i+=1\n continue\n k+=1\n currSize = 0\n while i < len(squares) and squares[i] == \"B\":\n currSize+=1\n i+=1\n sizes.append(currSize)\n\nprint(k)\nfor num in sizes:\n print(num, end=' ')\nprint()\n \t\t\t \t\t \t\t\t \t \t \t \t \t\t \t\t", "import re\r\ninput()\r\na=[len(x) for x in re.split('[^B]',input()) if x]\r\nprint(len(a))\r\nprint(*a)\r\n", "n=int(input())\r\ns=input()\r\ncount=1\r\nlength,l1=[],[]\r\nif len(s)>1:\r\n for i in range(1,len(s)):\r\n if s[i-1]==s[i]:\r\n count+=1\r\n else :\r\n length.append((s[i-1],str(count)))\r\n count=1\r\n length.append((s[i],str(count)))\r\nelse:\r\n i=0\r\n length.append((s[i],str(count)))\r\n#print(length)\r\nfor i in range(len(length)):\r\n if(length[i][0]==\"B\"):\r\n l1.append(int(length[i][1]))\r\nprint(len(l1))\r\nprint(*l1)", "#721A in codeforces\r\nn = int(input())\r\ngroups = 0\r\ncount = 0 \r\nlengths =[]\r\ncrossword = input()\r\nfor i in range(0,n):\r\n\tif crossword[i]==\"B\":\r\n\t\tcount+=1\r\n\telse:\r\n\t\tif count>0:\r\n\t\t\tlengths.append(count)\r\n\t\t\tgroups+=1\r\n\t\tcount = 0\r\nif count>0:\r\n\tgroups+=1\r\n\tlengths.append(count)\r\nprint(groups)\r\nfor i in lengths:\r\n\tprint(i,end = \" \")", "n=int(input())\r\ns=list(filter(lambda x:x!=\"\",input().split(\"W\")))\r\nprint(len(s))\r\nfor e in s:\r\n print(len(e),end=\" \")\r\n", "_ = input()\r\ns = input()\r\na = [i for i in s.split(\"W\") if i != \"\"]\r\nb = []\r\nfor i in a:\r\n b.append(str(len(i)))\r\nprint(len(b))\r\nprint(\" \".join(b))", "n = int(input())\na = input()\nm = []\nc = 0\nfor i in range(len(a)):\n if a[i] == \"B\":\n c = c + 1\n else:\n if c!=0:\n m.append(c)\n\n c = 0\nif c!=0:\n\n m.append(c)\n\nprint(len(m))\nfor i in m:\n print(i, end=\" \")\n\n\n", "n=int(input())\r\nx=input()\r\nwl=[]\r\nfor i in range(n):\r\n if x[i]==\"W\":\r\n wl.append(i)\r\nk=0\r\nl=len(wl)\r\nif l==n:\r\n print(0)\r\nelif l==0:\r\n print(1)\r\n print(n)\r\nelse:\r\n res=[]\r\n c=0\r\n for i in range(l):\r\n res.append(wl[i]-c)\r\n c=wl[i]+1\r\n if wl.count(n-1)==0:\r\n res.append(n-c)\r\n try:\r\n while True:\r\n res.remove(0)\r\n except ValueError:\r\n pass\r\n print(len(res))\r\n for i in res:\r\n print(i,end=\" \")\r\n", "input()\r\nx = input().split('W')\r\ny= [len(i) for i in x if len(i)>0]\r\nprint(len(y))\r\nprint(*y)", "# Wadea # \r\n\r\ns = int(input())\r\ns1 = list(input().split('W'))\r\nl = []\r\n\r\nfor j in s1:\r\n if 'B' in j:\r\n l.append(str(j.count('B')))\r\nprint(len(l))\r\nprint(' '.join(l))", "n = int(input())\r\ns = input()\r\nans = 0\r\nls = []\r\nfor i in range(len(s)):\r\n if s[i] == 'B':\r\n ans += 1\r\n if (s[i] != 'B' or i == n - 1) and ans != 0:\r\n ls.append(ans)\r\n ans = 0\r\nprint(len(ls))\r\nprint(*ls)", "import math\ndef solve(s):\n arr = []\n prev = ''\n for i in s:\n if i == 'B':\n if prev == i:\n arr[-1] += 1\n else:\n arr.append(1)\n prev = i\n print(len(arr))\n print(*arr)\n \ndef main():\n #arr1 =list(map(int,input().split(' ')))\n #arr1 =input().split(' ')\n #arr2 = []\n #n = int(input())\n #for j in range(n):\n #i = input()\n # i = input().split(' ')\n #i = int(''.join(input().split(' ')))\n #arr2 = arr2 + i\n input()\n solve(input())\n\nmain()", "n = int(input())\r\na = list(map(str,input().strip()))\r\nc = []\r\ni = 0\r\nwhile(i<n):\r\n if(a[i] == \"B\"):\r\n count = 0\r\n for j in range(i,n):\r\n if(a[j] == \"W\"):\r\n break\r\n else:\r\n count += 1\r\n c.append(count)\r\n i += count\r\n else:\r\n i += 1\r\n\r\nprint(len(c))\r\nfor i in range(len(c)):\r\n print(c[i] , end = \" \")\r\n ", "#a\nn = int(input())\nval = input()\nantidote = []\nc = 0\nconsec = 0\n\nfor i in range(n):\n if val[i] == \"B\":\n consec += 1\n elif val[i] == \"W\":\n if (consec >= 1):\n antidote.append(str(consec))\n consec = 0\nif (consec > 0):\n antidote.append(str(consec))\nc = len(antidote)\n\nif ((len(antidote) != 0)):\n print(c)\n for i in range(len(antidote)):\n print(antidote[i], end= \" \")\nelse:\n print(c)\n\t \t \t\t\t\t\t \t\t\t \t \t \t \t \t\t \t\t\t", "import re\r\n\r\ntemp = input()\r\n\r\ng = input()\r\n\r\nb = re.findall(r'B+', g)\r\n\r\nct = len(b)\r\n\r\nprint(ct)\r\n\r\nif ct > 0:\r\n out = [str(len(x)) for x in b]\r\n\r\n print(' '.join(out))\r\n", "in1 =int(input())\r\nin2 = input()\r\nk = 0\r\na = 0\r\nc = 0\r\nans=[]\r\nfor i in range(in1): \r\n if in2[i] == 'B':\r\n k = k + 1\r\n a = 1\r\n if in2[i] == 'W' and a == 1:\r\n ans.append(k)\r\n k = 0\r\n c = c + 1\r\n a = 0\r\nif in2[in1-1] =='B':\r\n c = c + 1\r\n ans.append(k)\r\nprint(c)\r\nfor i in range(c):\r\n print(ans[i],end=' ')", "n = int(input())\r\ns = input()\r\n\r\nB_list = s.split(\"W\")\r\n\r\nif \"\" in B_list:\r\n B_list.remove(\"\")\r\n\r\nans = []\r\nfor i in B_list:\r\n if len(i) > 0:\r\n ans.append(len(i))\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i, end=\" \")\r\n", "a = input()\r\na = input()\r\n\r\nb = []\r\ncurrent = 0\r\nfor el in a:\r\n if el == 'B':\r\n current += 1\r\n else:\r\n if current != 0:\r\n b.append(current)\r\n current = 0\r\nif current != 0:\r\n b.append(current)\r\nprint(len(b))\r\n\r\nfor el in b:\r\n print( el, end = \" \")", "n = int(input())\nletters = input()\nchunks=letters.split(\"W\")\n#print(chunks)\nlength= []\ncount=0\nfor x in chunks:\n if x is not \"\":\n length.append(len(x))\n count+=1\nprint(count)\nfor i in range (0, len(length)):\n print (length[i], \" \", end='')\nprint()\n\t\t\t \t\t \t \t \t\t\t\t \t\t \t \t\t", "w = input()\na = input()\ng = 0\nb = 0\nl = []\nfor x in a:\n if x == \"B\":\n if b == 0:\n g+=1\n b+=1\n else:\n if b != 0:\n l.append(str(b))\n b = 0\nif b > 0:\n l.append(str(b))\nprint(g)\nprint(\" \".join(l))\n \t\t \t\t\t \t \t\t \t \t\t \t\t", "def find_all(x):\r\n count_b = 0\r\n count_b_in_block = 0\r\n block_list = []\r\n for i in range(len(x)):\r\n if x[i] == 'B':\r\n count_b += 1\r\n if i != len(x)-1 and x[i] == x[i+1] == 'B':\r\n count_b_in_block += 1\r\n else:\r\n block_list.append(count_b_in_block+1)\r\n count_b_in_block = 0\r\n\r\n\r\n return len(block_list), block_list\r\nn = int(input())\r\nx = input()\r\nb_list_len , b_l = find_all(x)\r\nprint(b_list_len)\r\nfor i in b_l:\r\n print(i, end=' ')\r\n ", "n,f,s,num = int(input()),input().strip(),[],0\r\nfor i in f + ' ':\r\n if i == 'B':\r\n num += 1\r\n elif num:\r\n s.append(num)\r\n num = 0\r\nprint(len(s))\r\nif s:\r\n print(*s)", "n=input()\r\ns=input()\r\nrep=[]\r\ncur=0\r\nfor e in s:\r\n if e==\"B\":cur+=1\r\n else:\r\n if cur:rep.append(cur);cur=0\r\nif cur:rep.append(cur)\r\nprint(len(rep))\r\nprint(*rep)\r\n", "n = int(input())\ncolors = input().upper()\n\ngroups = list()\ncurr_size = 0\nfor i in range(n):\n if colors[i] == 'W':\n if curr_size > 0:\n groups.append(curr_size)\n curr_size = 0\n continue\n if colors[i] == 'B':\n curr_size += 1\n\nif curr_size > 0:\n groups.append(curr_size)\n\nprint(len(groups))\nfor g in groups:\n print(g, end=\" \")\n \t\t \t\t\t \t \t \t\t \t\t", "#Codeforce 721A\r\nlength=int(input())\r\nstr1=input().replace(\"W\",\" \")\r\nlist1=[v for v in str1.split()]\r\nprint(len(list1))\r\nans=\"\"\r\nfor i in range(len(list1)*2):\r\n if i%2==0:\r\n ans+=str(len(list1[i//2]))\r\n else:\r\n ans+=\" \"\r\nprint(ans)", "input()\nn = [len(i) for i in input().split('W') if i]\nprint(len(n), *n)\n \t\t \t\t\t\t \t\t \t\t\t \t \t\t\t\t\t\t \t", "#From Jasnah bobb31\r\n#From Jasnah bobb31\r\n#From Jasnah bobb31\r\nn = int(input())\r\na = input().strip()\r\nc = 0\r\nr = [0] * 50\r\n\r\nfor i in range(n):\r\n if a[i] == 'W':\r\n continue\r\n if i > 0 and a[i - 1] == 'B':\r\n r[c - 1] += 1\r\n else:\r\n c += 1\r\n r[c - 1] += 1\r\n\r\nprint(c)\r\nprint(*r[:c])\r\n", "t=int(input())\r\ns=input().split(\"W\")\r\nwhile \"\" in s:\r\n s.remove(\"\")\r\nprint(len(s))\r\nfor i in s:\r\n print(len(i),end=\" \")", "n = int(input())\r\ns = input()\r\nans = []\r\ni = 0\r\nk = 1\r\nwhile i < len(s):\r\n if s[i] == 'B':\r\n if k:\r\n ans.append(0)\r\n k = 0\r\n ans[len(ans) - 1] += 1\r\n else:\r\n k = 1\r\n i += 1\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\ns = input()+\"W\"\r\nl = []\r\nc=0\r\nfor val in s:\r\n if val==\"B\":\r\n c+=1\r\n else:\r\n if c>0:\r\n l.append(c)\r\n c=0\r\nprint(len(l))\r\nfor val in l:\r\n print(val,end=\" \")", "groups = 0\nn = int(input())\nletters = input()\nB = letters.split('W')\nnew = []\nfor i in B:\n if i != \"\":\n new.append(len (i))\n groups += 1\nprint(groups)\nfor x in new:\n print(x, end=\" \")\n\t \t \t\t\t \t \t \t \t \t \t \t\t\t \t", "def main():\n length = int(input())\n letters = input()\n black_groups_count = 0\n last_letter = None\n \n current_count = 0\n\n second_input = \"\"\n for letter in letters:\n if letter == \"B\":\n current_count += 1\n else:\n if current_count > 0:\n second_input += str(current_count) + \" \"\n current_count = 0\n \n if letter == \"B\" and last_letter != \"B\":\n black_groups_count += 1\n\n last_letter = letter\n\n if current_count > 0:\n second_input += str(current_count) + \" \"\n print(black_groups_count)\n print(second_input)\n\n\nmain()\n\t\t\t\t\t\t \t\t \t \t\t \t \t\t \t\t \t", "n=int(input())\r\ns=input().split('W')\r\nm=[]\r\nfor i in range(len(s)):\r\n\tif len(s[i])>0:\r\n\t\tm.append(len(s[i]))\r\nprint(len(m))\r\nprint(*m)", "n = int(input())\r\nlayout = input()\r\ncount = 0\r\nflag = -1\r\nnum_blocks = layout.count('BW')\r\nif layout[n - 1] == 'B':\r\n num_blocks += 1\r\nprint(num_blocks)\r\nfor i in range(n):\r\n if layout[i] == 'W':\r\n if flag == 1:\r\n print(count)\r\n flag = 0\r\n count = 0\r\n if layout[i] == 'B':\r\n flag = 1\r\n count += 1\r\n if i == n - 1:\r\n print(count)", "# -*- coding: utf-8 -*-\n\n_ = int(input())\n\nsquares = input()\n\nblocks = []\nblock_size = 0\nlast_char = 'W'\n\nfor square in squares:\n if square == 'B':\n block_size += 1\n\n elif square == 'W' and last_char == 'B':\n blocks.append(str(block_size))\n block_size = 0\n\n last_char = square\n\nif block_size != 0:\n blocks.append(str(block_size))\n\nprint(len(blocks))\nprint(\" \".join(blocks))\n \t\t\t\t\t\t \t\t \t\t \t \t\t\t\t \t \t", "class OneDimensionalJapaneseCrossword:\n def __init__(self):\n self.lastChar = 'W'\n self.groups = []\n \n def addChar(self, char):\n if char == 'B':\n if self.lastChar == 'W':\n self.groups.append(1)\n else:\n self.groups[-1] += 1\n self.lastChar = char\n\nif __name__ == \"__main__\":\n # Ler a entrada\n n = int(input())\n row = input()\n # Instanciar classe\n crossword = OneDimensionalJapaneseCrossword()\n # Processar entrada\n for c in row:\n crossword.addChar(c)\n # Exibir saída\n k = len(crossword.groups)\n print(k)\n print(*crossword.groups)\n\t\t \t\t\t\t\t \t\t\t \t\t\t \t\t\t\t", "n = int(input())\r\nw = str(input())\r\nw = w + 'W'\r\nt = 0\r\nc = [0]*n\r\nj = 0\r\nfor i in range(n+1):\r\n if w[i] == 'B':\r\n t+=1\r\n if i + 1 >= len(w):\r\n break\r\n if w[i+1] == 'W':\r\n c[j] = t\r\n j+=1\r\n t = 0\r\ne= c.count(0)\r\nfor i in range(e):\r\n c.remove(0)\r\nprint(len(c))\r\nfor i in range(len(c)):\r\n print(c[i], end = ' ')", "a = int(input())\n\nchars = input()\n\nnewSeq = False\nseqCount = 0\nseqs = 0\n\ntoPrint = []\n\nfor i in range(len(chars)):\n if (chars[i] == \"B\"):\n \n seqCount += 1\n\n if (newSeq == False):\n newSeq = True\n\n if(i == len(chars) - 1): # last loop\n toPrint.append(seqCount ) \n seqs += 1 \n \n \n\n elif chars[i] == \"W\":\n if (newSeq == True):\n newSeq = False\n toPrint.append(seqCount )\n seqCount = 0\n seqs += 1\n# else:\n# if(chars[i] == \"B\"):\n# toPrint.append(seqCount + 1) \n# seqs += 1\n \n\nprint(seqs)\nif (len(toPrint) > 0):\n print(*toPrint)\n\n \t \t \t \t\t \t \t \t\t \t\t \t\t", "n = int(input())\r\ns = input()\r\ncount = 0\r\ni = 0\r\nenc = []\r\nwhile (i < n):\r\n temp = 0\r\n if (s[i] == 'B'):\r\n count += 1\r\n while(i < n and s[i] == 'B'):\r\n i += 1\r\n temp += 1\r\n if (temp > 0):\r\n enc.append(temp)\r\n i -= 1\r\n i += 1\r\nprint(count)\r\nfor i in enc:\r\n print(i, end = ' ')", "n = int(input())\r\ns = input()\r\n\r\ncount = 0\r\nk = 0\r\nans = []\r\nfor i in s:\r\n\tif i==\"B\":\r\n\t\tcount+=1\r\n\telse:\r\n\t\tif count!=0:\r\n\t\t\tk+=1\r\n\t\t\tans.append(count)\r\n\t\t\tcount=0\r\n\r\nif count!=0:\r\n\tans.append(count)\r\n\tk+=1\r\n\r\nprint(k)\r\nprint(*ans)", "n=int(input())\r\nstri=input().split(\"W\")\r\ncount=0\r\nlisty=[]\r\nfor i in stri:\r\n\tif \"B\" in i:\r\n\t\tcount+=1\r\n\t\tj=(len(i))\r\n\t\tlisty.append(j)\r\nprint(count)\r\nfor i in listy:\r\n\tprint(i,end=\" \")", "# One-dimensional Japanese Crossword\ndef black_white(s):\n if s.count('B') == 0:\n print('0')\n return\n if s.count('W') == 0:\n print(1)\n print(s.count('B'))\n return\n ans = []\n count = 0\n i = 0\n while i < len(s):\n if s[i] == 'B':\n count += 1\n else:\n if count != 0:\n ans.append(str(count))\n count = 0\n i += 1\n if count != 0:\n ans.append(str(count))\n val = ' '.join(ans)\n print(len(ans))\n print(val)\n\nn = int(input())\ns = input()\nblack_white(s)", "n = int(input())\ns = input()\nx = 0\nz = \"\"\ni = 0\nwhile i < n:\n if s[i] == \"B\":\n x += 1\n y = 1\n while i+1 != n and s[i+1] == \"B\":\n y += 1\n i += 1\n z += str(y)\n z += \" \"\n i += 1\nprint(x)\nprint(z)\n \t\t \t \t\t \t \t\t\t\t \t \t\t \t \t", "input()\r\ns = [len(i) for i in input().split('W') if len(i) != 0]\r\nif len(s) == 0:\r\n print(len(s))\r\nelse:\r\n print(len(s))\r\n print(*s)", "n = int(input())\r\ns = input()\r\n\r\ngroups = []\r\ncurrent_group_size = 0\r\nfor i in range(n):\r\n if s[i] == 'B':\r\n current_group_size += 1\r\n else:\r\n if current_group_size > 0:\r\n groups.append(current_group_size)\r\n current_group_size = 0\r\nif current_group_size > 0:\r\n groups.append(current_group_size)\r\n\r\nprint(len(groups))\r\nprint(' '.join(str(x) for x in groups))\r\n", "# Author : Ghulam Junaid\r\nlenn = int(input())\r\nstring = input()\r\ncount = 0\r\nlist1 = []\r\niter1 = 0\r\nfor i in string:\r\n iter1+=1\r\n if i=='B':\r\n count+=1\r\n elif count>0:\r\n list1.append(count)\r\n count=0\r\n if iter1==lenn:\r\n if count>0:\r\n list1.append(count)\r\nprint(len(list1))\r\nans = str(list1)\r\nans = ans.replace(',','')\r\nans = ans.replace(']','')\r\nans = ans.replace('[','')\r\nif len(ans)>0:\r\n print(ans)\r\n", "from sys import stdin\r\ndef read():\r\n return stdin.readline().strip()\r\n\r\nn=int(read())\r\ncount=0\r\nk=0\r\ndecryptList=[]\r\nencryptedList=list((read()))\r\nfor i in range(len(encryptedList)):\r\n if(encryptedList[i]=='B'):\r\n count+=1\r\n if(encryptedList[i]=='W' and count!=0):\r\n decryptList.append(count)\r\n count=0\r\n k+=1\r\n\r\nif(count>0):\r\n decryptList.append(count)\r\n \r\n k+=1\r\nprint(k)\r\nprint(*decryptList,sep=\" \")\r\n ", "if __name__ == \"__main__\":\r\n n = int(input())\r\n string = input()\r\n res, total = [], 0\r\n count = 0\r\n for s in string:\r\n if s == \"B\":\r\n count += 1\r\n else:\r\n if count != 0:\r\n total += 1\r\n res.append(str(count))\r\n count = 0\r\n\r\n if count != 0:\r\n total += 1\r\n res.append(str(count))\r\n\r\n print(total)\r\n if len(res) != 0:\r\n print(' '.join(res))\r\n\r\n\r\n\r\n", "n=int(input())\r\nl=[]\r\ns=input()\r\nq=s[0]\r\nif q=='B':\r\n l.append(1)\r\nfor i in range(1,len(s)):\r\n if s[i]!=q:\r\n if q=='W':l.append(1)\r\n q=s[i]\r\n elif s[i]=='B':l[-1]+=1\r\nprint(len(l))\r\nif len(l)!=0:print(*l,sep=' ')\r\n", "n = int(input())\n\nstring = str(input())\n\nconsecutiveSquares = []\ngroupIndex = 0\ntotalGroups = 0\n\nfor i in range(n):\n consecutiveSquares.append(0) #populate the list\n\nfor i in range(n):\n if(string[i] != 'W'):\n consecutiveSquares[groupIndex] += 1 #sum 1 to consecutiveSquares\n else:\n groupIndex += 1 #means that the consecutive squares had finished\n\nfor i in range(len(consecutiveSquares)):\n if(consecutiveSquares[i]!=0):\n totalGroups+=1 #couts the total groups\nprint(totalGroups)\n\nfor i in range(len(consecutiveSquares)):\n if(consecutiveSquares[i]!=0):\n print(consecutiveSquares[i], end = ' ') #couts the total groups\n \t \t\t\t\t\t\t \t\t \t\t \t\t \t", "n = int(input())\r\ncrossword = input()\r\n\r\ngroup_sizes = []\r\ncurrent_size = 0\r\n\r\nfor i in range(n):\r\n if crossword[i] == 'B':\r\n current_size += 1\r\n else:\r\n if current_size != 0:\r\n group_sizes.append(current_size)\r\n current_size = 0\r\nif current_size != 0:\r\n group_sizes.append(current_size)\r\n \r\nprint(len(group_sizes))\r\nif (len(group_sizes) != 0):\r\n print(\" \".join(map(str, group_sizes)))\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()) + [1]\r\nans = []\r\nc = 0\r\nfor i in s:\r\n if i & 1 and c:\r\n ans.append(c)\r\n if i & 1:\r\n c = 0\r\n else:\r\n c += 1\r\nk = len(ans)\r\nprint(k)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n = int(input())\r\ns = input().split('W')\r\nl = []\r\nfor i in s:\r\n l.append(i.count('B'))\r\nl = list(filter(lambda x: x!=0, l))\r\nprint(len(l))\r\nprint(*l)", "#!/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 S = wtf[1]\r\n ans = []\r\n c = 0\r\n for s in S:\r\n if s == 'B':\r\n c+=1\r\n else:\r\n if c > 0:\r\n ans.append(c)\r\n c = 0\r\n if c > 0:\r\n ans.append(c)\r\n print(f'{len(ans)}\\n' + ' '.join(map(str, ans)))\r\n", "n = int(input())\nstring = input()\nuseful = string.split('W')\nn = int(len(useful))\n# print(useful)\ncount = 0\nfor i in range(n):\n if (len(useful[i]) > 0):\n count = count+1\nprint(count)\n\nfor j in range(n):\n if (len(useful[j])> 0):\n print(len(useful[j]), end = \" \")\n", "n = int(input())\ns = input()\nx = 0\nb_list = []\n\nif \"B\" in s:\n for letter in s:\n if letter == \"W\":\n if x > 0:\n b_list.append(x)\n x = 0\n continue\n elif letter == \"B\":\n x += 1\n if x > 0:\n b_list.append(x)\n k = str(b_list[0])\n for num in b_list[1:]:\n k += \" \"+str(num)\n print(len(b_list))\n print(k)\nelse:\n print(0)\n\t \t \t\t \t\t\t \t \t\t\t\t \t \t \t\t", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-21 21:57:32\nLastEditTime: 2021-11-21 22:16:39\nDescription: One-dimensional Japanese Crossword\nFilePath: CF721A.py\n'''\n\n\ndef func():\n n = int(input())\n crossword = input().strip()\n encrypting = [0] * n\n for i in range(n):\n if crossword[i] == \"B\":\n encrypting[i] = 1\n\n for j in range(1, n):\n if encrypting[j] != 0:\n encrypting[j] += encrypting[j - 1]\n encrypting[j - 1] = 0\n lst = list(map(str, filter(lambda el: el > 0, encrypting)))\n print(len(lst))\n print(\" \".join(lst))\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\r\nst = input()\r\ndata = []\r\nflg = True\r\nk = 0\r\nfor x in st:\r\n if x == 'B':\r\n k += 1\r\n flg = True\r\n else:\r\n if flg:\r\n flg = False\r\n if k != 0:\r\n data.append(k)\r\n k = 0\r\nif flg:\r\n data.append(k)\r\nprint(len(data))\r\nprint(*data)\r\n\r\n", "l = int(input())\ns = input().split('W')\nj = []\nfor i in s:\n if len(i) > 0:\n j.append(len(i))\nprint(len(j))\nprint(' '.join(str(_) for _ in j))\n\n \t\t\t\t\t \t\t\t\t\t\t \t\t \t \t\t\t", "n=int(input())\r\na=input().split('W')\r\nc=[len (i) for i in a if len(i)>0]\r\nprint(len(c))\r\nprint(*c)", "n = int(input())\r\nrow = input()\r\ngroups = []\r\ncount = 0\r\nfor i in range(n):\r\n if row[i] == 'B':\r\n count += 1\r\n\r\n if row[i] == 'W' or i == n-1:\r\n if count > 0:\r\n groups.append(count)\r\n count = 0\r\nprint(len(groups))\r\nfor group in groups:\r\n print(group, end=' ')\r\n", "#!/usr/bin/pypy3\nimport re\n\n\ndef main():\n input()\n string = input()\n res = [str(len(s)) for s in re.findall(r\"B+\", string)]\n print(len(res))\n print(\" \".join(res))\n\n\nmain()\n", "x = int(input())\ny = input()\nz = 0\nw = []\ny = y + \"W\"\n\nfor s in y:\n if s == \"B\":\n z += 1\n else:\n if z != 0:\n w.append(z)\n z = 0\nw = [str(x) for x in w]\nprint(len(w))\nprint(\" \".join(w))\n \t\t \t \t \t \t\t\t\t \t \t \t\t", "n = int(input())\r\ns = input()\r\ni = 0\r\na = []\r\nwhile i < n:\r\n while i < n and s[i] == 'W':\r\n i += 1\r\n t = 0\r\n while i < n and s[i] == 'B':\r\n i += 1\r\n t += 1\r\n if t:\r\n a.append(t)\r\nprint(len(a))\r\nprint(' '.join(map(str, a)))\r\n", "from itertools import groupby\r\ntotal = input()\r\nres = [str(len(list(g))) for i, g in groupby(input()) if i == \"B\"]\r\nprint(len(res))\r\nprint(\" \".join(res))\r\n", "n = int(input())\r\nstr = input()\r\ncntb = 0\r\ncgroub = 0\r\nlst = []\r\nfor i in range(len(str) - 1):\r\n if str[i] == 'B' and i != len(str) - 1:\r\n cntb += 1\r\n \r\n if str[i + 1] != 'B':\r\n cgroub += 1\r\n lst.append(cntb)\r\n cntb = 0\r\n \r\nif str[len(str) - 1] == 'B':\r\n cntb += 1\r\n lst.append(cntb)\r\n cgroub += 1\r\nprint(cgroub)\r\nprint(*lst)\r\n\r\n\r\n", "n = int(input())\ncols = input().split(\"W\")\n\ncols = list(filter(lambda x: x != \"\", cols))\n\nprint(len(cols))\nprint(' '.join([str(len(cols[i])) for i in range(len(cols))]))\n\n\t\t \t \t \t \t \t \t \t \t\t \t \t \t", "length = int(input())\r\ns = input() + '$'\r\n\r\ngroups = []\r\ncount = 0\r\nfor char in s:\r\n\tif char == 'B':\r\n\t\tcount += 1\r\n\telse:\r\n\t\tif count:\r\n\t\t\tgroups.append(count)\r\n\t\t\tcount = 0\r\n\r\n# BWBWB\r\nprint(len(groups))\r\nprint(*groups)", "input()\r\na=str(input())+'D'\r\nlst=[]\r\nc=0\r\nfor i in a:\r\n if i=='B':\r\n c=c+1\r\n else:\r\n if c>0:\r\n lst.append(c)\r\n c=0\r\nprint(len(lst))\r\nprint(*lst)", "n, a, s = int(input()), \"W\" + input() + \"W\", 1\r\nprint(a.count(\"WB\"))\r\nfor i in range(1, len(a)):\r\n if a[i] == 'W' and a[i - 1] == 'B': print(s, end = \" \")\r\n s = (s + 1) if a[i] == a[i - 1] and a[i] == 'B' else 1", "input()\r\nl=[c for c in input()]\r\nl.append('0')\r\nl1=[];c=1\r\nfor i in range(len(l)-1):\r\n if l[i]=='B':\r\n if l[i+1]=='B':\r\n c+=1\r\n continue\r\n l1.append(c)\r\n c=1\r\nprint(len(l1))\r\nprint(*l1)\r\n \r\n \r\n", "k = int(input())\nlst = input()\nholder = []\ncounter = 0\nb_counter = 0\nw_counter = 0\nsets = 0\nfor i in lst:\n if i == 'W':\n w_counter += 1\n else:\n b_counter += 1\n\nif w_counter == k:\n print(0)\n\nelif b_counter == k:\n print(1)\n print(k)\n\nelse:\n for i in range(k):\n if lst[i] == 'W':\n if counter != 0:\n sets += 1\n holder.append(counter)\n counter = 0\n else:\n counter += 1\n if len(lst) == 1:\n holder.append(counter)\n sets = 1\n elif i == k-1:\n holder.append(counter)\n sets += 1\n\n\n print(sets)\n\n for i in range(len(holder)):\n if i == len(holder) - 1:\n print(holder[i])\n else:\n print(holder[i], end = \" \")\n \t\t \t\t \t\t\t\t\t \t \t\t \t \t\t\t", "n=int(input());s=input()\r\nimport re\r\nx = re.findall(r'B{1,}', s)\r\n\r\nprint(len(x))\r\nfor i in x:\r\n print(len(i), end=' ')", "n=int(input())\r\nst=input()\r\nN=[]\r\nid_=0\r\ntotal=0\r\nfor i in range(n):\r\n if st[i]==\"B\":\r\n id_+=1\r\n if st[i]==\"W\":\r\n if id_>0:\r\n N.append(id_)\r\n total+=1\r\n id_=0\r\nif id_>0:\r\n N.append(id_)\r\n total+=1\r\nprint(total)\r\nprint(*N)", "n = int(input()) # length of the row\nrow = [*input()]\ngroups = [0] # list of the consecutive black squares groups\n\nfor i in range(n):\n # which iteration is about one group of consecutive squares\n if row[i] == 'B':\n groups[len(groups) - 1] += 1 # black square found\n if i != n - 1 and row[i + 1] == 'W':\n groups.append(0) # entire group found, so another one is created to find the next group\n\nif groups[len(groups) - 1] == 0:\n groups.pop(-1) # remove the last group if no black squares were found\n\nprint(len(groups))\nfor i in range(len(groups)):\n print(groups[i], end = ' ')\n \t \t\t \t\t \t\t\t\t\t\t \t \t", "row_lenght = int(input())\n\nstr = str(input())\n\nlist = []\n\nseq = 0\nlast_added = True\nfor c in str:\n if c == 'B':\n seq += 1\n last_added = False\n else:\n if seq > 0:\n list.append(seq)\n seq = 0\n last_added = True\nif not last_added:\n list.append(seq)\nprint(len(list))\nprint(*list)\n\t\t \t \t \t\t\t\t\t \t \t\t\t \t \t", "n = int(input())\r\ns = str(input())\r\nres = []\r\n \r\ni = 0\r\nwhile(i < len(s)):\r\n sum,j = 0,i\r\n while(j < n and s[i] == s[j]):\r\n j+=1 \r\n sum+=1\r\n if(s[i] == 'B'):\r\n res.append(sum)\r\n i=j\r\n \r\nprint(len(res))\r\nfor i in res:\r\n print(i, end=' ')", "n = int(input())\r\ns = input()\r\nk = 0\r\nl = []\r\nfor i in range(n):\r\n if s[i] == \"B\":\r\n k += 1\r\n else:\r\n if k > 0:\r\n l.append(k)\r\n k = 0\r\n if i == n - 1 and k > 0:\r\n l.append(k)\r\n\r\nprint(len(l))\r\nfor i in l:\r\n print(i,end=\" \")", "n=int(input());c=0;l=[]\r\nfor i in input()+'W':\r\n\tif i=='B':c+=1\r\n\telif i=='W' and c>0:l.append(c);c=0\r\nprint(len(l));print(*l)", "n = int(input())\r\nblack = []\r\ncount = 0\r\n\r\nfor i in input():\r\n if i == 'B':\r\n count += 1\r\n else:\r\n if not count == 0:\r\n black.append(count)\r\n count = 0\r\n\r\nif not count == 0:\r\n black.append(count)\r\n\r\nprint(len(black))\r\nprint(*black)\r\n", "#https://codeforces.com/problemset/problem/721/A\r\nnum_squares = int(input())\r\nvalues = input()\r\nanswer = \"\"\r\n\r\ncounter = 0\r\nrow_counter = 0\r\n\r\nfor current_index in range(num_squares):\r\n if values[current_index] == \"B\":\r\n counter += 1\r\n elif counter > 0:\r\n answer += str(counter) + \" \"\r\n row_counter += 1\r\n counter = 0\r\n\r\nif counter > 0:\r\n row_counter += 1\r\n answer += str(counter)\r\n\r\nprint (row_counter)\r\nprint (answer)\r\n \r\n", "n = int(input())\r\ns = input()\r\na = []\r\nc = 0\r\nfor i in s.split('W'):\r\n if i != '':\r\n a.append(len(i))\r\n c += 1\r\nprint(c)\r\nprint(*a)\r\n", "n = int(input())\ns = input()\n\na = 0\nr = []\nfor i in range(n):\n if s[i] == \"B\":\n a += 1\n else:\n if a != 0:\n r.append(a) \n a = 0\nif a != 0:\n r.append(a)\n\nprint(len(r))\nif r: print(' '.join(map(str, r)))\n\n", "from math import sqrt\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n res = [s[0]]\r\n s= s[1:]\r\n while s!=\"\":\r\n if res[-1][-1]==s[0]:\r\n res[-1]=res[-1]+s[0]\r\n else:\r\n res.append(s[0])\r\n s=s[1:]\r\n print(len([str(len(d)) for d in res if d[0] == 'B']))\r\n print(\" \".join([str(len(d)) for d in res if d[0]=='B']))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ns = input()\r\ns = s.split(\"W\")\r\nans = 0\r\nres = []\r\nfor c in s:\r\n if len(c)>0:\r\n ans+=1\r\n res.append(str(len(c)))\r\nprint(ans)\r\nprint(\" \".join(res))\r\n", "\r\ninput1 = int(input())\r\ninput2 = input()\r\ninput2 = input2.split(\"W\")\r\ncount = 0\r\nres = \"\"\r\nfor i in input2:\r\n if len(i) != 0:\r\n res += str(len(i)) + \" \"\r\n count += 1\r\nprint(count)\r\nif len(res) != 0:\r\n print(res)\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n st = input()\r\n arr = []\r\n if st[0] == \"B\":\r\n arr.append(1)\r\n for i in range(1, n):\r\n if st[i] == \"B\":\r\n if st[i - 1] == \"B\":\r\n arr[len(arr) - 1] += 1\r\n else:\r\n arr.append(1)\r\n print(len(arr))\r\n for i in arr:\r\n print(i, end = \" \")\r\n", "n = int(input())\r\ns = str(input())\r\n\r\nblack_group_num = 0\r\ncurr_black_num = 0\r\nres = []\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"B\":\r\n curr_black_num += 1\r\n elif curr_black_num > 0:\r\n res.append(curr_black_num)\r\n curr_black_num = 0\r\n black_group_num += 1\r\n else:\r\n curr_black_num = 0\r\n\r\nif curr_black_num > 0:\r\n res.append(curr_black_num)\r\n black_group_num += 1\r\n\r\nprint(black_group_num)\r\nif res:\r\n print(*res)", "n = int(input())\r\ns = input()\r\n\r\ngroups = s.split(\"W\")\r\n\r\ngroups = [x for x in groups if x != \"\"]\r\n\r\nprint(len(groups))\r\nprint(\" \".join(list(map(lambda x: str(len(x)), groups))))\r\n", "t = int(input())\ns = input().split(\"W\")\nnum = 0\nans = []\nfor i in s:\n\tif i == \"\":\n\t\tpass\n\telse:\n\t\tnum += 1\n\t\tans.append(i.count(\"B\"))\nprint(num);print(*ans)", "n = int(input())\r\na = input().split(\"W\")\r\nz = [len(i) for i in (a) if len(i)>0]\r\nprint(len(z))\r\nprint(*z)\r\n", "a = input()\nb = input().split('W')\nc = [len(i) for i in b if len(i)>0]\nprint(len(c))\nprint(*c)\n\t \t\t\t \t\t \t\t \t\t \t\t", "ans = []\r\ncur = 0\r\nn = int(input())\r\nfor c in input():\r\n if c == 'B':\r\n cur +=1\r\n else:\r\n if cur:\r\n ans.append(cur)\r\n cur = 0\r\nif cur:\r\n ans.append(cur)\r\nprint(len(ans))\r\nif ans:\r\n print(*ans)\r\n", "# LUOGU_RID: 101646344\n_, s = input(), input()\r\na = list(map(len, s.replace('W', ' ').split()))\r\nprint(len(a))\r\nprint(*a)", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')[1]\r\n s = [len(x) for x in inp.split('W') if x]\r\n return [len(s), ' '.join(map(str, s))]\r\n \r\nprint(*main(), sep='\\n')", "n=int(input())\r\ns=input().split(\"W\")\r\ncount=0\r\nfor i in s:\r\n\tif i==\"\":\r\n\t\tcount+=1\r\nprint(len(s)-count)\r\n# print(s)\r\nfor i in range(len(s)):\r\n\tif s[i]!=\"\":\r\n\t\tprint(s[i].count(\"B\"),end=\" \")", "a=int(input())\r\nb=input()\r\nans=[]\r\nfor i in range(a):\r\n if i==0:\r\n if b[i]==\"B\":\r\n ans.append(\"1\")\r\n else:\r\n if b[i]==\"B\" and b[i-1]==\"W\":\r\n ans.append(\"1\")\r\n elif b[i]==\"B\" and b[i-1]==\"B\":\r\n ans[-1]=str(int(ans[-1])+1)\r\nprint(len(ans))\r\nprint(\" \".join(ans))", "a = int(input())\r\nb = input()\r\nc = 0\r\ne = \"\"\r\nr = 0\r\nfor i in range(0, a):\r\n if b[i] == \"B\":\r\n r += 1\r\n else:\r\n if r > 0:\r\n e += str(r) + \" \"\r\n c += 1\r\n r = 0\r\nif r > 0:\r\n e += str(r) + \" \"\r\n c += 1\r\nif c > 0:\r\n print(c)\r\n print(e)\r\nelse:\r\n print(0)\r\n", "x = int(input())\nn = input().split(\"W\")\na = [len(x) for x in n if len(x) > 0]\nprint(len(a))\nprint(*a)\n\n\t \t\t\t\t \t\t\t \t\t\t\t\t \t\t \t\t\t\t \t", "# A\n# MSI tutor helped\nN = input()\nword = input()\ncounter = 0\n\nresult = word.split('W')\nfor elem in result:\n if elem != '':\n counter += 1\nprint(counter)\nfor elem in result:\n if elem != '':\n counter += 1\n print(len(elem), end =\" \")\n \t \t \t\t\t\t \t\t\t \t\t \t", "inp=input\nli=list\niinp=lambda : int(inp())\nent=lambda : map(int,inp().split())\nlient=lambda : [int(i) for i in inp().split()]\nli0= lambda x: [0 for i in range(x)]\nstent=lambda : [i for i in inp()]\n\nk=iinp()\ncadena=inp()\nres=[]\ncont=0\nban=False\nif 'B' not in cadena:\n print(0)\nelse:\n for i in cadena:\n if i =='B':\n cont+=1\n ban=True\n elif ban:\n ban=False\n res.append(cont)\n cont=0\n if ban:\n res.append(cont)\n print(len(res))\n print(*res)", "n = int(input())\r\ns = input().split('W')\r\ns = list(filter(''.__ne__, s)) # remove all items of '' in on line without loop\r\nprint(len(s))\r\nfor i in s:\r\n print(len(i), end=' ')\r\n", "n = int(input())\r\nx = input()\r\narray = [0]*(n+1)\r\njlh = []\r\narray[n] = 'W'\r\n\r\nfor i in range (n):\r\n array[i] = x[i]\r\n\r\nhsl = 0\r\nfor i in range (n+1):\r\n if array[i] == 'B':\r\n hsl += 1\r\n if array[i] == array[i-1] and array[i-1] == 'W':\r\n continue\r\n if array[i] != 'B':\r\n jlh += [hsl]\r\n hsl = 0\r\n \r\nprint(len(jlh))\r\nfor i in jlh:\r\n print(i,end=\" \")\r\n \r\n" ]

[ "vp,vd,t,f,c=[int(input())for i in '12345']\r\nr=0\r\nwhile vp<vd:\r\n\tz=(vp*t)/(vd-vp)\r\n\tif z*vd>=c:break\r\n\tt+=2*z+f;r+=1\r\nprint(r)", "vp = int(input())\r\nvd = int(input())\r\nt = int(input())\r\nf = int(input())\r\nc = int(input())\r\n\r\nif vp >= vd:\r\n print(0)\r\nelse:\r\n dragon_distance = 0\r\n princess_distance = vp*t\r\n bijous = 0\r\n while(princess_distance < c and (t+princess_distance/(vd-vp))*vp < c ):\r\n #print(t+princess_distance/(vd-vp))\r\n t += (princess_distance/(vd-vp))+f\r\n t += (princess_distance + (princess_distance/(vd-vp))*vp)/vd\r\n #print(t)\r\n princess_distance,dragon_distance = t*vp, 0\r\n bijous += 1\r\n print(bijous)\r\n", "p, d, t, f, c = [int(input()) for _ in range(5)]\r\n\r\nans = 0\r\nwhile p < d:\r\n T = (p*t)/(d - p)\r\n\t\r\n if T*d >= c:\r\n break\r\n\t\r\n t += 2*T + f\r\n ans += 1\r\n\t\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nvp = int(input())\r\nvd = int(input())\r\nt = int(input())\r\nf = int(input())\r\nc = int(input())\r\n\r\nif vd<=vp:\r\n exit(print(0))\r\n\r\nans = 0\r\nruns = t*vp\r\nds = 0\r\nwhile runs<c:\r\n hours = runs/(vd-vp)\r\n runs+=hours*vp\r\n if runs>=c:break\r\n \r\n ans+=1\r\n hours = runs/vd\r\n runs+=vp*(hours+f)\r\n \r\nprint(ans)\r\n\r\n", "vp = int(input())\r\nvd = int(input())\r\nt = int(input())\r\nf = int(input())\r\nc = int(input())\r\n\r\nbijous = 0\r\n\r\ndp = vp * t\r\nvr = vd - vp\r\n\r\nif dp >= c or vr <= 0:\r\n print(0)\r\nelse:\r\n while True:\r\n t = dp / vr\r\n dp = vd * t\r\n\r\n if dp >= c:\r\n break\r\n\r\n bijous += 1\r\n t = (dp / vd) + f\r\n\r\n dp += (vp * t)\r\n\r\n print(bijous)\r\n\r\n \r\n", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\n\n\ndef inp(): # int\n return(int(input()))\n\n\ndef inlt(): # list\n return(list(map(int,input().split())))\n\n\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef instr(): # string\n return input()\n\n\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\n\nvp = 1.0 * inp()\nvd = 1.0 * inp()\nt = 1.0 * inp()\nf = 1.0 * inp()\nc = 1.0 * inp()\n\n# vp * T meets vd * (T-t) when vp * T = vd * (T - t)\n# (vd - vp) * T = vd * t\n# T = vd * t / (vd - vp)\n# vp * T = vp * vd * t / (vd - vp): dist1\n# then: dragon flies back, which takes 2 * dist1 / vd time - update new headstart\n# 100 * 10 / (100 - 2)\n\ncum_dist = 0\nif vp >= vd:\n print(0)\nelse:\n num_bijous = 0\n exit = False\n while cum_dist < c:\n dist = 1.0 * vp * vd * t / (vd - vp)\n cum_dist += dist\n # print(t, dist)\n if cum_dist >= c: # can reach castle\n exit = True\n break\n else:\n t = 2.0 * cum_dist / vd + f\n num_bijous += 1\n print(num_bijous)", "vp = int(input())\r\nvd = int(input())\r\nt = int(input())\r\nf = int(input())\r\nc = int(input())\r\nif vp >= vd :\r\n print(0)\r\n exit()\r\ndp = t*vp\r\nbijous = 0\r\nwhile dp < c :\r\n t1 = dp/(vd-vp)\r\n dp += t1*vp\r\n if( dp >= c) :\r\n break\r\n bijous += 1\r\n dp += t1*vp\r\n dp += f*vp\r\nprint(bijous)", "p,d,t,f,c=[int(input())for _ in'12345']\r\nr=0\r\nwhile p<d:\r\n\tz=(p*t)/(d-p)\r\n\tif z*d>=c:break\r\n\tt+=2*z+f;r+=1\r\nprint(r)", "vp = int(input())\r\nvd = int(input())\r\nt = int(input())\r\nf = int(input())\r\nc= int(input())\r\n\r\nb = 0\r\n\r\nif vd <= vp:\r\n print(0)\r\nelse:\r\n p = t * vp \r\n p = vd * (p / (vd - vp))\r\n while p < c:\r\n b += 1\r\n p += vp * (p / vd + f)\r\n p = vd * (p / (vd - vp))\r\n print(b)", "v_p = int(input())\nv_d = int(input())\nt = int(input())\nf = int(input())\nc = int(input())\n\nTime = c/v_p\ntime_a = 0\ndistance = v_p * t\n\nnum = 0\nif v_p < v_d:\n\n while distance* v_d/(v_d-v_p)< c:\n tmp = distance/(v_d-v_p)\n num += 1\n distance = tmp * (v_d+v_p)\n distance += v_p * f\n\nprint(num)\n\n\t \t \t\t \t \t \t \t \t \t \t\t", "def minimal_bijous(vp, vd, t, f, c):\r\n if vp >= vd:\r\n return 0\r\n\r\n princess_pos = vp * t\r\n\r\n bijous = 0\r\n\r\n while princess_pos < c:\r\n catch_up_time = (princess_pos) / (vd - vp)\r\n princess_pos += catch_up_time * vp\r\n\r\n if princess_pos >= c:\r\n break\r\n\r\n bijous += 1\r\n princess_pos += (catch_up_time+f)*vp\r\n\r\n return bijous\r\n\r\nvp = int(input())\r\nvd = int(input())\r\nt = int(input())\r\nf = int(input())\r\nc = int(input())\r\n\r\nprint(minimal_bijous(vp, vd, t, f, c))\r\n" ]

[ "n, k = map(int, input().split())\r\nlectures = list(map(int, input().split()))\r\nsleeping = list(map(int, input().split()))\r\n\r\ndp_ok = [0] * (n - k + 1)\r\ndp_magic = [0] * (n - k + 1)\r\ns1, s2 = 0, 0\r\nfor i in range(k):\r\n s1 += lectures[i] * sleeping[i]\r\n s2 += lectures[i]\r\ndp_ok[0] = s1\r\ndp_magic[0] = s2\r\nmax_diff, max_index = dp_magic[0] - dp_ok[0], 0\r\n\r\nfor i in range(k, n):\r\n j = i - k\r\n dp_ok[j + 1] = dp_ok[j] - lectures[j] * sleeping[j] + lectures[i] * sleeping[i]\r\n dp_magic[j + 1] = dp_magic[j] - lectures[j] + lectures[i]\r\n diff = dp_magic[j + 1] - dp_ok[j + 1]\r\n if diff > max_diff:\r\n max_diff = diff\r\n max_index = j + 1\r\n\r\nres = 0\r\nfor i in range(n):\r\n if i >= max_index and i < max_index + k:\r\n res += lectures[i]\r\n else:\r\n res += lectures[i] * sleeping[i]\r\nprint(res)\r\n", "n,k = map(int,input().split())\r\n\r\nA = [int(x) for x in input().split()]\r\nT = [int(x) for x in input().split()]\r\n\r\nthe = 0\r\n\r\nfor i in range(n):\r\n if T[i]:\r\n the += A[i]\r\n A[i] = 0\r\n\r\ns = sum(A[:k])\r\nboost = s\r\nfor i in range(k,n):\r\n\ts = s - A[i-k] + A[i]\r\n\tboost = max(s,boost)\r\n\r\nprint(the+boost)\r\n", "n, k = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\nsleep_status = list(map(int, input().split()))\r\nl = 1\r\nr = k\r\nwindow_gain = 0\r\nfor i in range(k):\r\n window_gain += points[i] * (sleep_status[i] == 0)\r\n\r\ncurrent_window = window_gain\r\n\r\nfor i in range(k, n):\r\n current_window -= points[i-k] * (sleep_status[i-k] == 0)\r\n current_window += points[i] * (sleep_status[i] == 0)\r\n window_gain = max(window_gain, current_window)\r\n \r\nresult = window_gain\r\nfor i in range(n):\r\n if sleep_status[i] == 1:\r\n result += points[i]\r\nprint(result)", "import math\r\nfrom decimal import *\r\n\r\nn,k = map(int, input().split())\r\nans = 0\r\ncnt = 0\r\na = list(map(int, input().split()))\r\nb =list(map(int, input().split()))\r\npref = [0]*(n)\r\nfor i in range(n):\r\n if(b[i]):\r\n ans+=a[i]\r\n else:\r\n cnt+=a[i]\r\n pref[i]=cnt\r\nmx = pref[k-1]\r\nfor i in range(k, n):\r\n mx = max(mx, pref[i]-pref[i-k])\r\nans+=mx\r\nprint(ans)\r\n", "n, k = map(int,input().split())\na = list(map(int,input().split()))\nt = list(map(int,input().split()))\ndif = 0\nsoma = 0\ntdif = 0\n\nfor c in range(n):\n if(t[c]==1):\n soma += a[c]\n t[c] = 0\n else:\n t[c] = a[c]\nfor e in range(n):\n if(e != 0):\n t[e] = t[e] + t[e-1]\n else:\n t[e] += 0\n\nfor j in range(n-k+1):\n if(j != 0):\n tdif = t[j+k-1] - t[j-1]\n else:\n tdif = t[j+k-1]\n dif = max(dif,tdif)\n \nprint(dif + soma)\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 = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nm = 0\r\nfor i in range(n):\r\n if t[i] == 1:\r\n m += a[i]\r\n a[i] = 0\r\nr = sum(a[:k])\r\nl = [r] * n\r\nfor i in range(1, n - k + 1):\r\n r -= a[i - 1] - a[i + k - 1]\r\n l[i] = r\r\nprint(max(l[:n - k + 1]) + m)\r\n", "lecture_duration, keep_awake = map(int, input().split())\r\ntheorems_list = list(map(int, input().split()[:lecture_duration]))\r\nsleeptime_list = list(map(int, input().split()[:lecture_duration]))\r\n \r\nsum_awake = sum_keep_awake = 0\r\n\r\nfor i in range(lecture_duration):\r\n if sleeptime_list[i] == 1:\r\n sum_awake += theorems_list[i]\r\n theorems_list[i] = 0\r\n\r\nfor i in range(keep_awake):\r\n if sleeptime_list[i] == 0:\r\n sum_keep_awake += theorems_list[i]\r\n\r\ntemp = sum_keep_awake\r\n\r\nfor i in range(lecture_duration - keep_awake):\r\n temp = temp - theorems_list[i] + theorems_list[i + keep_awake]\r\n sum_keep_awake = max(temp, sum_keep_awake)\r\n\r\nprint(sum_keep_awake + sum_awake)", "n,k = list(map(int,input().split()))\r\ntheorems = list(map(int,input().split()))\r\nwake = list(map(int,input().split()))\r\n\r\none_sum = 0\r\nfor i in range(n):\r\n\tif wake[i] == 1:\r\n\t\tone_sum += theorems[i]\r\n\t\ttheorems[i] = 0\r\nsum_k = 0\r\nfor i in range(k):\r\n sum_k += theorems[i];\r\nmax_val = sum_k\r\n\r\nfor i in range(k,n):\r\n sum_k -= theorems[i-k];\r\n sum_k += theorems[i];\r\n max_val = max(max_val, sum_k)\r\n\r\nprint(one_sum+max_val)", "from itertools import accumulate\r\nn,k=map(int,input().split())\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 if b[i]==1:\r\n ans+=a[i]\r\n a[i]=0\r\n\r\nprefix=list(accumulate(a))\r\nmx=0\r\n\r\nfor i in range(n-k+1):\r\n l=i\r\n r=i+k-1\r\n\r\n if l==0:\r\n mx=max(mx,prefix[r])\r\n else:\r\n mx=max(mx,prefix[r]-prefix[l-1])\r\nprint(mx+ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split(\" \"))\r\nv=list(map(int,input().split(\" \")))\r\ncondition =list(map(int,input().split(\" \")))\r\n \r\nsum=0\r\nfor i in range(n):\r\n if condition[i]==1:\r\n sum+=v[i]\r\n v[i]=0\r\nsum2=0\r\nfor i in range(k):\r\n if condition[i]==0:\r\n sum2+=v[i]\r\ntemp=sum2\r\nfor i in range(0,n-k):\r\n temp=temp-v[i]+v[i+k]\r\n if temp>sum2:\r\n sum2=temp\r\nprint(sum2+sum)\r\n", "k,n = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nlstt = list(map(int,input().split()))\r\nmx,ans = -1,0\r\nfor i in range(k):\r\n if lstt[i] == 1:\r\n ans+=lst[i]\r\n lst[i] = 0\r\ns = sum(lst[:n])\r\nmx = s\r\nfor i in range(k-n):\r\n s-=lst[i]\r\n s+=lst[i+n]\r\n mx = max(mx,s) \r\n\r\nprint(mx+ans)", "import bisect\r\nn,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nans=0\r\nax,tx=[],[]\r\nfor i in range(n):\r\n if t[i]==1:\r\n ans=ans+a[i]\r\n else:\r\n ax.append(a[i])\r\n tx.append(i)\r\nm=0\r\nfor i in range(1,len(ax)):\r\n ax[i]+=ax[i-1]\r\nfor i in range(len(ax)):\r\n j=bisect.bisect_right(tx,tx[i]+k-1)-1\r\n if i>0:\r\n m=max(m,ax[j]-ax[i-1])\r\n else:\r\n m=max(m,ax[j])\r\nans=ans+m\r\nprint(ans)", "\r\nn, k = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\noverall = 0\r\n\r\npr = [0] * n\r\nfor i in range(n):\r\n if i:\r\n pr[i] += pr[i - 1]\r\n if t[i] == 0:\r\n pr[i] += a[i]\r\n else:\r\n overall += a[i]\r\n\r\nadd = 0\r\nfor i in range(k - 1, n):\r\n add = max(add, pr[i] - (pr[i - k] if i >= k else 0))\r\n\r\nprint(overall + add)\r\n", "import sys,math,itertools\r\nfrom collections import Counter,deque,defaultdict\r\nfrom bisect import bisect_left,bisect_right \r\nfrom heapq import heappop,heappush,heapify, nlargest\r\nfrom copy import deepcopy\r\nmod = 10**9+7\r\nINF = float('inf')\r\ndef inp(): return int(sys.stdin.readline())\r\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\r\ndef inpl_1(): return list(map(lambda x:int(x)-1, sys.stdin.readline().split()))\r\ndef inps(): return sys.stdin.readline()\r\ndef inpsl(x): tmp = sys.stdin.readline(); return list(tmp[:x])\r\ndef err(x): print(x); exit()\r\n\r\nn,k = inpl()\r\na = inpl()\r\nt = inpl()\r\nans = 0\r\nfor i in range(n):\r\n if t[i]: ans += a[i]; a[i] = 0\r\naa = [0]\r\nfor i in range(n):\r\n aa.append(aa[-1]+a[i])\r\nres = 0\r\nfor i in range(n-k+1):\r\n res = max(res, aa[i+k]-aa[i])\r\nprint(res+ans)", "n, k = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n \r\nresult = 0\r\nfor i in range(len(s)):\r\n if s[i]:\r\n result += t[i]\r\n \r\ncurrent = 0\r\nfor i in range(0, k):\r\n if not s[i]:\r\n current += t[i]\r\n \r\nmaximum = current\r\nleft, right = 0, k\r\n \r\nwhile right < n:\r\n current += (t[right])*(1 - s[right]) - (t[left])*(1 - s[left])\r\n left += 1\r\n right += 1\r\n maximum = max(current, maximum)\r\n \r\nresult += maximum\r\n \r\nprint(result)", "N, K = map(int, input().split(' '))\r\nA = list(map(int, input().split(' ')))\r\nT = list(map(int, input().split(' ')))\r\n\r\nAc1 = [0]*(N+1)\r\nAc2 = [0]*(N+1)\r\nresp = 0\r\n\r\nfor i in range(1, N+1):\r\n Ac1[i] = Ac1[i-1] + A[i-1]\r\n Ac2[i] = Ac2[i-1]\r\n if(T[i-1]==1):\r\n Ac2[i] += A[i-1]\r\n\r\nfor L in range(len(Ac2) - K):\r\n R = L+K\r\n sum1 = (Ac1[R] - Ac1[L])\r\n sum2 = (Ac2[R] - Ac2[L])\r\n resp = max(resp, sum1-sum2)\r\n\r\nprint(Ac2[-1] + resp)", "# import sys\r\n# input=sys.stdin.readline\r\nimport math\r\nimport bisect\r\n\r\n\r\nn,k=[int(i) for i in input().split(\" \")]\r\nl=[int(i) for i in input().split(\" \")]\r\nh=[int(i) for i in input().split(\" \")]\r\nans=sum([l[i] for i in range(n) if h[i]==1])\r\ncur=[i for i in range(k)]\r\ncur_=sum([l[i] for i in cur if h[i]==0])\r\na=cur_\r\nfor i in range(k,n):\r\n cur.append(i)\r\n c=cur.pop(0)\r\n if h[i]==0:\r\n cur_+=l[i]\r\n if h[c]==0:\r\n cur_-=l[c]\r\n a=max(a,cur_)\r\n# print(a)\r\nprint(ans+a)\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \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().split()\r\nl=int(inp[0])\r\na=int(inp[1])\r\nle=input().split()\r\naw=input().split()\r\n#l=6\r\n#a=3\r\n#le='1 3 5 2 5 4'.split()\r\n#aw='1 1 0 1 0 0'.split()\r\ns=0\r\npl=[0]\r\no=0\r\nfor i in range(l):\r\n if aw[i]=='1':\r\n s+=int(le[i])\r\n pl.append(pl[-1])\r\n else:\r\n pl.append(pl[i] + int(le[i]))\r\nfor i in range(l-a+1):\r\n o=max(o,pl[i+a]-pl[i])\r\nprint(o+s)", "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# _INPUT_LINES = sys.stdin.read().splitlines()\r\n# input = iter(_INPUT_LINES).__next__\r\n# _OUTPUT_BUFFER = io.StringIO()\r\n# sys.stdout = _OUTPUT_BUFFER\r\n#\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n asleep = list(map(int, input().split()))\r\n\r\n sm = mx = res = 0\r\n\r\n for i in range(n):\r\n\r\n if asleep[i] == 1:\r\n res += arr[i]\r\n\r\n if i < k:\r\n if asleep[i] == 0:\r\n sm += arr[i]\r\n else:\r\n if asleep[i] == 0:\r\n sm += arr[i]\r\n if asleep[i - k] == 0:\r\n sm -= arr[i - k]\r\n mx = max(mx, sm)\r\n\r\n print(mx + res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "inputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\nk = inputs[1]\r\nlist1 = [int(num) for num in input().split()]\r\nlist2 = [int(num) for num in input().split()]\r\npsum=[0]\r\nc=0\r\nfor i in range(0,len(list1)):\r\n if(list2[i]==0):\r\n psum.append(psum[i]+list1[i])\r\n else:\r\n psum.append(psum[i]+0)\r\n c+=list1[i]\r\nmax1=0\r\nfor i in range(k,len(psum)):\r\n if(psum[i]-psum[i-k]>max1):\r\n max1 = psum[i]-psum[i-k]\r\nprint(c+max1)\r\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nt = [int(x) for x in input().split()]\r\nsum_all = [0] * (n + 1)\r\nsum_ones = [0] * (n + 1)\r\nfor i in range(n):\r\n sum_all[i + 1] = sum_all[i] + a[i]\r\n sum_ones[i + 1] = sum_ones[i] + (a[i] if t[i] == 1 else 0)\r\nans = sum_ones[n]\r\nfor i in range(n):\r\n if i + k > n:\r\n break\r\n sum = sum_ones[i] + (sum_all[i + k] - sum_all[i]) + sum_ones[n] - sum_ones[i + k]\r\n ans = max(ans, sum)\r\nprint(ans)\r\n", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,inf\r\nfrom collections import deque,defaultdict\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(x)\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)*x\r\npw=lambda x:0 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\nn,k=R()\r\n*a,=R()\r\n*b,=R()\r\nv=[]\r\np=0\r\nfor i in range(n):\r\n\tif not b[i]:\r\n\t\tv+=a[i],\r\n\telse:\r\n\t\tv+=0,\r\n\t\r\nans=sum(v[:k])\r\np=ans\r\nfor i in range(k,n):\r\n\tp+=(v[i]-v[i-k])\r\n\tans=max(ans,p)\r\nprint(sum([a[i] for i in range(n) if b[i]])+ans)", "\"\"\"\r\nd = dict()\r\nn, m = list(map(int, input().split()))\r\n\r\nA = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if d.get(A[i]):\r\n d[A[i]] += 1\r\n else:\r\n d[A[i]] = 1\r\n\r\nfor key, item in d.items():\r\n print(\"frequency of \" + str(key) + \" = \", item)\r\n\r\n\"\"\"\r\n\r\nn,k = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\n\r\nl = [[0, None] for i in range(n)]\r\nres = [0] * n\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n l[0][1] = arr[0]\r\n if p[i] == 1:\r\n l[0][0] = arr[0]\r\n else:\r\n l[i][1] = l[i-1][1] + arr[i]\r\n if p[i] == 1:\r\n l[i][0] = l[i-1][0] + arr[i]\r\n else:\r\n l[i][0] = l[i-1][0]\r\n \r\nfor i in range(n-k+1):\r\n if i > 0:\r\n res[i] = l[i+k-1][1] - l[i-1][1] + l[i-1][0] + l[-1][0] - l[i+k-1][0]\r\n else:\r\n res[i] = l[i+k-1][1] + l[-1][0] - l[i+k-1][0]\r\nprint(max(res))", "inp=list(map(int,input().split()))\r\nn,k=inp[0],inp[1]\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nl=len(t)\r\nsum=0\r\n\r\nfor i in range(l):\r\n sum=sum+a[i]*t[i]\r\n t[i]=1-t[i]\r\n a[i]=a[i]*t[i]\r\n \r\nx=0\r\nfor i in range(0,k):\r\n x=x+a[i]\r\n\r\nmx=x\r\nfor i in range(1,n-k+1,1):\r\n x=x-a[i-1]+a[i+k-1]\r\n if x>mx:\r\n mx=x\r\n\r\nsum=sum+mx\r\nprint(sum)\r\n\r\n\r\n", "from itertools import*\r\nR=lambda:map(int,input().split())\r\nn,k=R()\r\na=list(zip(R(),R()))\r\nprint(sum(x*y for x,y in a)+max(accumulate(x-x*y-u+u*v\r\nfor(u,v),(x,y)in zip([(0,0)]*k+a,a))))\r\n \t \t\t \t \t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nt = list(map(int, input().split()))\nans = 0\nfor i in range(n):\n if t[i]:\n ans += a[i]\n a[i] = 0\npk = sum(a[:k])\ntech = sum(a[:k])\nfor i in range(n - k):\n pk = pk - a[i] + a[i + k]\n tech = max(tech, pk)\nprint(ans + tech)\n", "import sys\ndef input() : return sys.stdin.readline().strip()\ndef getints() : return map(int,sys.stdin.readline().strip().split())\n\nn, k = getints()\na = list(getints())\nb = list(getints())\n\nf = 0\nfor i in range(n): f += a[i]*b[i]\n\nans = 0\nt = 0\nfor i in range(k): t += a[i] if b[i] == 0 else 0\nans = max(ans,t)\nfor i in range(k,n):\n t += (a[i] if b[i] == 0 else 0) - (a[i-k] if b[i-k] == 0 else 0)\n ans = max(ans,t)\nprint(f+ans)\n\t\t\t\t\t \t\t \t \t\t\t\t\t\t\t \t \t\t", "import sys\r\ninput=lambda : list(map(int,sys.stdin.readline().split()))\r\ndef main():\r\n n,k=input()\r\n a=[0]+input()\r\n t=input()\r\n s=[0]*(n+1)\r\n s[1]=a[1]\r\n ss=[0]*(n+1) #sum i -> j in a <=> s[j]-s[i-1]\r\n ss[1]=t[0]*a[1]\r\n for i in range(2,n+1):\r\n s[i]=a[i]+s[i-1]\r\n ss[i]=t[i-1]*a[i]+ss[i-1]\r\n r=0\r\n for i in range(1,n-k+2):\r\n r=max(r,s[i+k-1]-s[i-1]+ss[i-1]+ss[-1]-ss[i+k-1])\r\n print(r)\r\nmain()\r\n\r\n\r\n ", "n, k = [int(num) for num in input().split()]\nsa = input().split()\nst = input().split()\ndeft = 0\ngains = [0]*n\nfor i in range(n):\n if (st[i] == \"1\"):\n deft += int(sa[i])\n else:\n gains[i] = int(sa[i])\nps = [0]*(n+1)\nfor i in range(n):\n ps[i+1] = ps[i] + gains[i]\nmx = 0\nfor i in range(n - k + 1):\n mx = max(mx, ps[i+k] - ps[i])\nprint(deft + mx)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nt = input()[:-1].replace(' ','')\r\nc = 0\r\nfor i in range(n):\r\n if t[i] == '1':\r\n c += w[i]\r\n else:\r\n if i < k:\r\n c += w[i]\r\nd = c\r\nfor i in range(n-k):\r\n if t[i] == '0':\r\n c -= w[i]\r\n if t[i+k] == '0':\r\n c += w[i+k]\r\n if c > d:\r\n d = c\r\nprint(d)", "inp = list(map(int,input().split()))\r\nn , k = inp[0] , inp[1]\r\nlectures = list(map(int,input().split()))\r\nmode = list(map(int,input().split()))\r\nleft, right = 0, 0\r\nsleep ,max_sleep = 0 , 0\r\nwake = 0\r\n\r\nfor _ in range(k):\r\n if mode[right] == 0:\r\n sleep += lectures[right]\r\n else:\r\n wake += lectures[right]\r\n right += 1\r\nmax_sleep = max(max_sleep,sleep)\r\n\r\nwhile right < n:\r\n if mode[left] == 0:\r\n sleep -= lectures[left]\r\n\r\n if mode[right] == 0:\r\n sleep += lectures[right]\r\n else:\r\n wake += lectures[right]\r\n left += 1\r\n right += 1\r\n max_sleep = max(max_sleep,sleep)\r\n \r\nprint(wake + max_sleep)", "import random\r\nn, k = map(int, input().split())\r\nH = list(map(int, input().split()))\r\nG = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor b in range(n):\r\n ans += H[b] * G[b]\r\n\r\nSums = [0] * n\r\nSums[0] = H[0] * abs(G[0] - 1)\r\nfor j in range(1, n):\r\n Sums[j] = Sums[j - 1] + H[j] * abs(G[j] - 1)\r\n\r\nmax_c = Sums[k - 1]\r\nfor m in range(k, n):\r\n temp = Sums[m] - Sums[m - k]\r\n if temp > max_c:\r\n max_c = temp\r\n\r\nprint(max_c + ans)\r\n", "# Codeforces - Lecture Sleep\r\n# https://codeforces.com/problemset/problem/961/B\r\n# 08/11/21\r\n\r\nn, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nt = [int(x) for x in input().split()]\r\n\r\np = [0] * n\r\nr = 0\r\nfor i in range(n):\r\n r += a[i] * t[i]\r\n p[i] = r\r\n\r\ns = [0] * n\r\nr = 0\r\nfor i in range(n - 1, -1, -1):\r\n r += a[i] * t[i]\r\n s[i] = r\r\n\r\npref = [0] * n\r\nr = 0\r\nfor i in range(n):\r\n r += a[i]\r\n pref[i] = r\r\n\r\nans = 0\r\nfor i in range(n - k + 1):\r\n cur = 0\r\n if i > 0:\r\n cur += p[i - 1]\r\n if i + k < n:\r\n cur += s[i + k]\r\n pref_sum = pref[i + k - 1]\r\n if i > 0:\r\n pref_sum -= pref[i - 1]\r\n cur += pref_sum\r\n ans = max(ans, cur)\r\n\r\nprint(ans)\r\n\r\n\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nt = list(map(int, input().split()))\nps = [0] * (n - k + 1)\np = [0] * (n - k + 1)\ns = 0\nfor i in range(n):\n s += a[i] * t[i]\nfor i in range(k):\n ps[0] += a[i]\n p[0] += a[i] * t[i]\n\nfor i in range(1, n - k + 1):\n ps[i] = ps[i - 1] - a[i - 1] + a[i + k - 1]\n p[i] = p[i - 1] - a[i - 1] * t[i - 1] + a[i + k - 1] * t[i + k - 1]\n\nans = 0\nfor i in range(n - k + 1):\n c = s + ps[i] - p[i]\n ans = max(ans, c)\nprint(ans)", "n,t=map(int,input().split())\nl=list(map(int,input().split()))\ntemp=list(map(int,input().split()))\nd=0\ne=0\ns=0\nf=0\nfor i in range(n):\n if temp[i]:\n s+=l[i]\n l[i]=0\n if i>t-1:\n e=max(e,d)\n d-=l[f]\n f+=1\n d+=l[i]\nprint(s+max(d,e))\n\t \t\t\t\t \t \t\t\t\t\t\t\t \t\t\t\t\t\t \t\t\t\t\t", "def solve():\r\n (n, k) = map(int, input().split())\r\n x = list(map(int, input().split()))\r\n y = list(map(int, input().split()))\r\n\r\n out = 0\r\n addons = [0]\r\n for (i, j) in zip(x, y):\r\n if j == 1:\r\n out += i\r\n addons.append(addons[-1])\r\n else:\r\n addons.append(i+addons[-1])\r\n \r\n added = 0\r\n for i in range(k, n+1):\r\n if addons[i]-addons[i-k] > added:\r\n added = addons[i]-addons[i-k]\r\n \r\n return out + added\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(solve())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Mar 23 16:26:29 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,k = map(int, input().strip().split())\r\nL = list(map(int, input().strip().split()))\r\nP = list(map(int, input().strip().split()))\r\n\r\nL = [0] + L\r\nP = [0] + P\r\ntotal = 0\r\n\r\nfor i in range(1,n+1):\r\n total += L[i]*P[i]\r\n\r\ncum = 0\r\n\r\nfor i in range(1,k+1):\r\n if not P[i]:\r\n cum += L[i]\r\n\r\nmaxcum = cum\r\n\r\nfor i in range(1,n-k+1):\r\n cum += L[i + k]*(1 - P[i+k])\r\n cum -= L[i] * (1 - P[i])\r\n maxcum = max(maxcum, cum)\r\n\r\nprint(maxcum + total)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ndp=[0]*n\r\ns=0\r\n\r\nfor j in range(n):\r\n if t[j]==1:\r\n s+=a[j]\r\n a[j]=0\r\nco=0\r\nm=0\r\nl=sum(a[co:co+k])\r\nfor j in range(n-k+1):\r\n co=j\r\n ss=0\r\n \r\n m=max(m,l+s)\r\n #print(l-ss+s)\r\n if co+k<n:\r\n l-=a[co]\r\n l+=a[co+k]\r\n \r\n \r\nprint(m)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ns=[0]*n\r\np=[0]*n\r\nq=[0]*n\r\ns[0]=a[0]\r\np[0]=(a[0] if t[0]>0 else 0)\r\nfor i in range(1,n):\r\n s[i]=s[i-1]+a[i]\r\n p[i]=p[i-1]+(a[i] if t[i]>0 else 0)\r\nq[n-1]=(a[n-1] if t[n-1]>0 else 0)\r\nfor i in range(n-2,-1,-1):\r\n q[i]=q[i+1]+(a[i] if t[i]>0 else 0)\r\nans=0\r\nfor i in range(n-k+1):\r\n w=s[i+k-1]-(s[i-1] if i>0 else 0)\r\n w+=(p[i-1] if i>0 else 0)\r\n w+=(q[i+k] if i+k<n else 0)\r\n ans=max(ans,w)\r\nprint(ans)", "R = lambda : map(int, input().split())\r\nn, k = R()\r\ns, t = list(R()), list(R())\r\nr = sum([s[i] for i in range(n) if t[i]])\r\nm = sum([s[i] for i in range(k) if 1-t[i]])\r\nx = m\r\nfor i in range(1, n-k+1):\r\n m += -(1-t[i-1])*s[i-1] + (1-t[i+k-1])*s[i+k-1]\r\n x = max(m, x)\r\nprint(x + r)\r\n", "def main():\r\n n, k = map(int, input().split())\r\n a = [int(c) for c in input().split()]\r\n t = [int(c) for c in input().split()]\r\n\r\n diff = 0\r\n i = 0\r\n s = 0\r\n ii = jj = 0\r\n while i < n:\r\n ii += a[i]\r\n if i - k >= 0:\r\n ii -= a[i - k]\r\n\r\n if t[i] == 1:\r\n s += a[i]\r\n jj += a[i]\r\n \r\n if i - k >= 0 and t[i - k] == 1:\r\n jj -= a[i - k]\r\n \r\n diff = max(diff, ii - jj)\r\n\r\n \r\n i += 1\r\n\r\n print(s + diff)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = [int(n) for n in input().split()]\r\nl = [int(n) for n in input().split()]\r\nb = [int(n) for n in input().split()]\r\nold = 0\r\ncur = 0\r\nfor i in range(n):\r\n if b[i] == 1:\r\n old += l[i]\r\n elif i < k:\r\n cur += l[i]\r\n\r\ni, j = 0, k - 1\r\nbest = cur\r\nwhile j < n - 1:\r\n if b[i] == 0:\r\n cur -= l[i]\r\n i += 1\r\n j += 1\r\n if b[j] == 0:\r\n cur += l[j]\r\n best = max(best, cur)\r\n\r\nprint(best + old)\r\n", "n, k = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int, input().split()))\n\ntot, pre = 0, [0]*(n+2)\nfor i in range(n):\n\tpre[i+1] += pre[i]\n\tif b[i] == 0:\n\t\tpre[i+1] += a[i]\n\telse :\n\t\ttot += a[i]\nmx = 0\nfor i in range(n-k+1):\n\tmx = max(mx, pre[i+k]-pre[i])\nprint(mx+tot)\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\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\narr3 = []\r\nsm = 0\r\nmx = 0\r\nfor i in range(n):\r\n if arr2[i] == 1:\r\n arr3.append(0)\r\n sm += arr1[i]\r\n else:\r\n arr3.append(arr1[i])\r\npre = [0]\r\nfor i in arr3:\r\n pre.append(i + pre[-1])\r\nfor i in range(0, n - k + 1):\r\n mx = max(mx, pre[i + k] - pre[i])\r\nprint(mx + sm)", "from itertools import accumulate\r\nn , k =map(int, input().split())\r\narr1 = list(map(int, input().split()))\r\narr1.append(0)\r\narr2 = list(map(int, input().split()))\r\nre = 0 ; z= 0\r\nfor i in range(n) : \r\n if arr2[i] == 1 :re+= arr1[i] ;arr1[i] = 0 \r\n#re2 = accumulate(arr1)\r\nfor i in range(1 , n):\r\n arr1[i]+=arr1[i-1]\r\nfor i in range((n-k)+1) :\r\n z = max(z, arr1[i+k-1] - arr1[i-1])\r\nprint(re+z)", "n,k=map(int,input().split())\r\na=[int(j) for j in input().split()]\r\nl2=[int(j) for j in input().split()]\r\ng=0\r\nt=0\r\nans=0\r\nfor i in range(n):\r\n if l2[i]==0:\r\n g+=a[i]\r\n else:\r\n ans+=a[i]\r\n if i>=k and l2[i-k]==0:\r\n g-=a[i-k]\r\n t=max(t,g)\r\nprint(ans+t)\r\n \r\n \r\n \r\n \r\n", "options = list(map(int, input().split(\" \")))\r\nn = options[0]\r\nawake = options[1]\r\n\r\nlecture = [0] + list(map(int, input().split(\" \")))\r\nsleep = [0] + list(map(int, input().split(\" \")))\r\n\r\nsum_l1 = [0]\r\nsum_l2 = [0]\r\n\r\noutput = 0\r\nmax_n = 0\r\n\r\nfor minute in range(1, n + 1):\r\n sum_l1.append(sum_l1[minute - 1] + lecture[minute] * sleep[minute])\r\n sum_l2.append(sum_l2[minute - 1] + lecture[minute])\r\n\r\nmax_v = 0\r\n\r\nfor minute in range(1, n - awake + 2):\r\n v = sum_l1[minute - 1] + sum_l2[minute + awake - 1] - sum_l2[minute - 1] + sum_l1[n] - sum_l1[minute + awake - 1]\r\n max_v = max(v, max_v)\r\n\r\nprint(max_v)\r\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn, k = mints()\r\na = list(mints())\r\nb = list(mints())\r\nd = [0]*(n+1)\r\nfor i in range(n-1,-1,-1):\r\n\td[i] = d[i+1] + a[i] if b[i] == 1 else d[i+1]\r\nc = 0\r\nfor i in range(k):\r\n\tc += a[i]\r\nr = c + d[k]\r\ns = 0\r\nfor i in range(k, n):\r\n\tc += a[i]\r\n\tc -= a[i-k]\r\n\tif b[i-k]:\r\n\t\ts += a[i-k]\r\n\tr = max(r, s+c+d[i+1])\r\nprint(r)", "from itertools import*\nR1=lambda:map(int,input().split())\nn,k=R1()\na=list(zip(R1(),R1()))\nprint(sum(x*y for x,y in a)+max(accumulate(x-x*y-u+u*v\nfor(u,v),(x,y)in zip([(0,0)]*k+a,a))))\n\t \t\t \t\t \t \t\t\t \t\t\t \t\t\t \t \t", "data=[*open(0)]\r\nn,k=list(map(int,data[0].split()))\r\narr=list(map(int,data[1].split()))\r\nawake=list(map(int,data[2].split()))\r\nplus=[0]*(n-k+1)\r\nfor i in range(k):\r\n plus[0]+=arr[i] if not awake[i] else 0\r\nfor i in range(1,len(plus)):\r\n a=arr[i-1] if not awake[i-1] else 0\r\n b=arr[i-1+k] if not awake[i-1+k] else 0\r\n plus[i]=plus[i-1]-a+b\r\nans=0\r\nfor i in range(n):\r\n ans+=arr[i] if awake[i] else 0\r\nprint(ans+max(plus))\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nprs = [0]\r\nfor i in a:\r\n prs.append(prs[-1] + i)\r\nprt = [0]\r\nans = -1\r\nfor i in range(len(a)):\r\n if t[i] == 1:\r\n prt.append(prt[-1] + a[i])\r\n else:\r\n prt.append(prt[-1])\r\nprt.append(0)\r\nprs.append(0)\r\nfor i in range(len(a) - k + 1):\r\n ans = max(ans, prs[i+k] - prs[i] + prt[i] + prt[-2] - prt[i+k])\r\nprint(ans)\r\n", "rd = lambda: map(int, input().split())\nn, k = rd()\na = [0] + list(rd())\nt = [0] + list(rd())\ns = 0\np, m = 0, 0\nfor i in range(n + 1):\n x, y = a[i], t[i]\n s += x * y\n p += x * (1 - y)\n p -= a[max(0, i - k)] * (1 - t[max(0, i - k)])\n m = max(p, m)\nprint(s + m)\n\t\t \t\t\t \t\t \t\t\t \t\t\t\t\t\t \t \t\t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nd,e,s,f=0,0,0,0\r\nfor i in range(n):\r\n if m[i]:\r\n s+=l[i]\r\n l[i]=0\r\n if i>k-1:\r\n e=max(e,d)\r\n d-=l[f]\r\n f+=1\r\n d+=l[i]\r\nprint(s+max(d,e))", "from itertools import*\nr=lambda:map(int,input().split())\nn,k=r()\na=list(zip(r(),r()))\nprint(sum(x*y for x,y in a)+max(accumulate(x-x*y-u+u*v\nfor(u,v),(x,y)in zip([(0,0)]*k+a,a))))\n \t \t \t\t\t\t\t \t\t\t \t \t \t\t\t\t", "n,k = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nt =[int(x) for x in input().split()]\r\nTotal = 0\r\nfor i in range(n):\r\n Total+= a[i]*t[i]\r\nslow = 0\r\nfast = 0\r\nMax = 0\r\nL = []\r\nwhile(fast!=n):\r\n if(fast-slow<k):\r\n Max+=(a[fast]*(1-t[fast]))\r\n L.append(Max)\r\n fast+=1\r\n else:\r\n Max-=(a[slow]*(1-t[slow]))\r\n Max+=(a[fast]*(1-t[fast]))\r\n slow+=1\r\n fast+=1\r\n L.append(Max)\r\nprint(max(L)+Total)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ntmp=[]\r\ni=j=s=0\r\nwhile j<n:\r\n if j<k:\r\n if t[j]==0:\r\n s+=a[j]\r\n j+=1\r\n else:\r\n tmp.append(s)\r\n if t[i]==0:\r\n s-=a[i]\r\n i+=1 \r\n if t[j]==0:\r\n s+=a[j]\r\n j+=1\r\ntmp.append(s)\r\nans=0\r\nfor i in range(n):\r\n if t[i]==1:\r\n ans+=a[i]\r\nans+=max(tmp)\r\nprint(ans)", "n, k = map(int, input().split())\r\n\r\nnums = list(map(int, input().split()))\r\nts = list(map(int, input().split()))\r\n\r\nleft = 0\r\n\r\ncur_sum = 0\r\nans = 0\r\nfor right in range(n):\r\n if not ts[right]:\r\n cur_sum += nums[right]\r\n \r\n if right - left + 1 == k:\r\n ans = max(ans, cur_sum)\r\n\r\n if not ts[left]:\r\n cur_sum -= nums[left]\r\n \r\n left += 1\r\n\r\n# print(ans)\r\nprint(sum(val for idx, val in enumerate(nums) if ts[idx]) + ans)\r\n\r\n\r\n ", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nawake = list(map(int, input().split()))\r\nanswer = 0\r\nfor i in range(n):\r\n if awake[i] == 1:\r\n answer += arr[i]\r\n arr[i] = 0\r\nhalf = 0\r\ntotal = 0\r\nfor i in range(n):\r\n total += arr[i]\r\n if i >= k:\r\n total -= arr[i-k]\r\n half = max(half, total)\r\nprint(answer + half)", "l, s = map(int, input().split())\r\nlec = list(map(int, input().split()))\r\nson = list(map(int, input().split()))\r\nnesp = 0\r\nmissed = []\r\nfor i in range(l):\r\n if son[i] == 0:\r\n missed.append(lec[i])\r\n else:\r\n nesp+=lec[i]\r\n missed.append(0)\r\nok = sum(missed[:s])\r\nm = ok\r\nfor i in range(1, l-s+1):\r\n ok+=missed[i+s-1]\r\n ok-=missed[i-1]\r\n if ok>m:\r\n m = ok\r\nprint(m+nesp)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nb=[0]*(n)\r\nsm=0\r\nfor i in range(n):\r\n if t[i]:\r\n sm+=a[i]\r\nsm2=0\r\nfor i in range(k):\r\n if not t[i]:\r\n sm2+=a[i]\r\nmx=sm2\r\nfor i in range(n-k):\r\n if t[i+k]:\r\n if not t[i]:\r\n sm2-=a[i]\r\n if not t[i+k]:\r\n if not t[i]:\r\n sm2+=a[i+k]-a[i]\r\n else:\r\n sm2+=a[i+k]\r\n mx=max(mx,sm2)\r\nprint(sm+mx)\r\n", "n, k = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\nt = list(map(int, input().strip().split()))\r\n\r\nps = [0] * (n + 1)\r\nfor i in range(n):\r\n ps[i + 1] = ps[i] + a[i]\r\npst = [0] * (n + 1)\r\nfor i in range(n):\r\n pst[i + 1] = pst[i] + a[i] * t[i]\r\n\r\nres = 0\r\nfor i in range(n - k + 1):\r\n x = ps[i + k] - ps[i]\r\n y = pst[i] + pst[n] - pst[i + k]\r\n res = max(res, x + y)\r\nprint(res)\r\n\r\n\r\n\r\n", "p=lambda:map(int,input().split());n,k=p()\na,t,m=list(p()),list(p()),0\nfor i in range(n):\n if t[i]==1:m+=a[i];a[i]=0\nr_1=sum(a[:k])\nl=[r_1]*n\nfor j in range(1,n-k+1):\n r_1-=a[j-1]-a[j+k-1];l[j]=r_1\nprint(max(l[:n-k+1])+m)\n\t \t\t \t\t\t \t \t\t \t\t \t", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n if(t[i]):ans+=a[i]\r\ndp=[0 for i in range(n-k+1)]\r\nfor i in range(k):\r\n if(t[i]==0):dp[0]+=a[i]\r\nfor i in range(1,n-k+1):\r\n dp[i]=dp[i-1]\r\n if(t[i-1]==0):dp[i]-=a[i-1]\r\n if(t[k+i-1]==0):dp[i]+=a[k+i-1]\r\nprint(ans+max(dp)) ", "from sys import stdin,stdout\r\nfrom itertools import accumulate\r\nnmbr = lambda: int(input())\r\nlst = lambda:list(map(int,input().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n a=lst()\r\n pres=lst()\r\n ps=list(accumulate(a))\r\n dp=[[0 for i in range(2)] for _ in range(n)]\r\n dp[0][0]=a[0]*pres[0]\r\n dp[0][1]=a[0]\r\n for i in range(1,n):\r\n dp[i][0]=a[i]*pres[i]+dp[i-1][0]\r\n dp[i][1]=max(dp[i-1][1]+a[i]*pres[i],((dp[i-k][0] - ps[i-k]) if i-k>=0 else 0)+ps[i])\r\n print(dp[n-1][1])", "num_input = input()\r\nnum_input = num_input.split(\" \")\r\nn = int(num_input[0])\r\nk = int(num_input[1])\r\n\r\narr_theorem = input()\r\narr_theorem = arr_theorem.split(\" \")\r\n\r\nfor i in range(0, len(arr_theorem)):\r\n arr_theorem[i] = int(arr_theorem[i])\r\n\r\narr_sleep = input()\r\narr_sleep = arr_sleep.split(\" \")\r\n\r\nfor i in range(0, len(arr_sleep)):\r\n arr_sleep[i] = int(arr_sleep[i])\r\n\r\nmax_sleep = 0\r\nmax = 0\r\n\r\nfor i in range(0, k):\r\n if arr_sleep[i] == 0:\r\n max_sleep += arr_theorem[i]\r\n max = max_sleep\r\n\r\nfor i in range(1, n - (k - 1)):\r\n if arr_sleep[i - 1] == 0:\r\n max_sleep -= arr_theorem[i - 1]\r\n \r\n if arr_sleep[i + k - 1] == 0:\r\n max_sleep += arr_theorem[i + k - 1]\r\n \r\n if max_sleep > max:\r\n max = max_sleep\r\n\r\nnormal_sleep = 0\r\nfor i in range(0, n):\r\n if arr_sleep[i] == 1:\r\n normal_sleep += arr_theorem[i]\r\n\r\nprint(max + normal_sleep)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\n\r\nr = 0\r\nfor i in range(k):\r\n if t[i] == 0:\r\n r+=l[i]\r\n\r\nx,res=0,r\r\n\r\nfor i in range(k,n):\r\n if t[i] == 0:\r\n r+=l[i]\r\n if t[x] == 0:\r\n r-=l[x]\r\n res = max(r,res)\r\n x+=1\r\nfor i in range(n):\r\n if t[i] == 1:\r\n res+=l[i]\r\n\r\nprint(res)", "n, k = map(int, input().split())\ntheorems = [int(i) for i in input().split()]\nmishka = [int(i) for i in input().split()]\n\nl, best, temp, remains = 0, 0, 0, sum(b for a, b in zip(mishka, theorems) if a)\nfor r, num in enumerate(theorems):\n temp += theorems[r]\n if mishka[r]:\n remains -= theorems[r]\n if r - l + 1 > k:\n temp -= theorems[l]\n if mishka[l]:\n remains += theorems[l]\n l += 1\n best = max(best, temp + remains)\n\nprint(best)", "n, k = map(int, input().split())\nlist1 = list(map(int, input().split()))\nlist2 = list(map(int, input().split()))\nsum1, pre = 0, [0]* (n+2)\nfor i in range (n): \n pre[i+1] += pre[i]\n if list2[i] == 0:\n pre[i+1] += list1[i]\n else:\n sum1 += list1[i]\nx = 0\nfor i in range (n-k+1):\n x = max(x, pre[i+k]-pre[i])\nprint (x+sum1)\n\t\t \t \t \t\t \t \t \t\t \t\t \t \t\t\t", "import sys\r\n#inf = float(\"inf\")\r\n#mod = 10**9+7\r\n\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\r\n#from bisect import bisect_left,bisect_right\r\n#from decimal import *,threading\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 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\nn,k=get_ints()\r\nth=get_array()\r\nstate=get_array()\r\ncurr_benefit=0;max_benefit=0\r\nfor i in range(k):\r\n if state[i]==0:\r\n curr_benefit+=th[i]\r\nmax_benefit=max(max_benefit,curr_benefit)\r\nindex1=0;index2=k-1\r\ni=1;j=k;m=0\r\nwhile j<n:\r\n if state[j]==0:\r\n curr_benefit+=th[j]\r\n if state[m]==0:\r\n curr_benefit-=th[m]\r\n if curr_benefit>max_benefit:\r\n index1=i;index2=j\r\n max_benefit=curr_benefit\r\n i+=1;j+=1;m+=1\r\ntotal=0\r\nfor i in range(n):\r\n if index1<=i<=index2:\r\n total+=th[i]\r\n else:\r\n if state[i]==1:\r\n total+=th[i]\r\nprint(total)\r\n", "n, k = [int(i) for i in input().split(' ')]\r\nprice = [int(i) for i in input().split(' ')]\r\ntime = [int(i) for i in input().split(' ')]\r\n\r\nans = sum([price[i] * time[i] for i in range(n)])\r\na = [price[i] if time[i] == 0 else 0 for i in range(n)]\r\ns = sum(a[0 : k])\r\nm = s\r\nfor i in range(k, n):\r\n s = s + a[i] - a[i - k]\r\n m = max(m, s)\r\nprint(m + ans)\r\n", "n,k = map(int,input().split())\r\n\r\nnums = list(map(int, input().split()))\r\nis_sleep = list(map(int, input().split()))\r\ntotal = 0\r\n\r\nfor i,is_zero in enumerate(is_sleep):\r\n if is_zero:\r\n total += nums[i]\r\n\r\ntemp = 0\r\nans = 0\r\nfor i in range(n):\r\n if i>=k:\r\n if not is_sleep[i-k]:\r\n temp -= nums[i-k]\r\n if not is_sleep[i]:\r\n temp += nums[i]\r\n elif not is_sleep[i]:\r\n temp += nums[i]\r\n ans = max(ans,temp)\r\n\r\nprint(total+ans)", "import collections\r\nimport math\r\nimport heapq\r\nimport copy\r\n \r\n \r\nclass TrieNode:\r\n \r\n\tdef __init__(self):\r\n\t\tself.children = {}\r\n\t\tself.count = 0\r\n \r\n \r\nclass Trie:\r\n \r\n def __init__(self):\r\n \r\n self.root = TrieNode()\r\n \r\n def insert(self, word):\r\n \r\n curr = self.root\r\n \r\n for c in word:\r\n if c not in curr.children:\r\n curr.children[c] = TrieNode()\r\n curr = curr.children[c]\r\n curr.count+=1\r\n\t\t\r\n\t\t\r\nN,K = map(int, input().split())\r\n\r\nlectures = list(map(int, input().split()))\r\nsleep = list(map(int, input().split()))\r\nactual = []\r\n\r\npre = []\r\n\r\ncumu = 0\r\nfor lecture in lectures:\r\n \r\n cumu+=lecture\r\n pre.append(cumu)\r\n\r\ntotal = 0\r\nfor idx,s in enumerate(sleep):\r\n \r\n if s:\r\n total+=lectures[idx]\r\n \r\n actual.append(total)\r\n \r\nres = 0\r\nsumN = 0\r\n\r\nfor idx,curr in enumerate(actual):\r\n \r\n\r\n if idx+K>len(actual):\r\n break\r\n \r\n if idx ==0:\r\n \r\n sumN = total-actual[idx+K-1] + pre[idx+K-1]\r\n else:\r\n \r\n sumN = total-(actual[idx+K-1]-actual[idx-1]) + pre[idx+K-1]-pre[idx-1]\r\n \r\n res = max(res, sumN)\r\n \r\nprint(str(res))", "import sys\r\n\r\nfirst_line=sys.stdin.readline().split()\r\nn=int(first_line[0])\r\nk=int(first_line[1])\r\nth=sys.stdin.readline().split()\r\nbeh=sys.stdin.readline().split()\r\nsumma=0\r\n\r\nfor i in range(n):\r\n th[i]=int(th[i])\r\n beh[i]=int(beh[i])\r\n if beh[i]==1:\r\n summa+=th[i]\r\n th[i]=0\r\nmaximum=sum(th[0:0+k])\r\nprev_sum=maximum\r\n\r\nfor i in range(1,n-(k-1)):\r\n next_sum=prev_sum-th[i-1]+th[i+k-1]\r\n if next_sum>maximum:\r\n maximum=next_sum\r\n prev_sum=next_sum\r\n\r\nprint(summa+maximum)\r\n", "n, k = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\nb = [int(x) for x in input().split(' ')]\r\n\r\nc = [x*y for (x,y) in zip(a,b)]\r\na_ps = [0]\r\nc_ps = [0]\r\nfor i in range(n):\r\n c_ps.append(c_ps[-1] + c[i])\r\n a_ps.append(a_ps[-1] + a[i])\r\n\r\nm = 0\r\n\r\nfor i in range(n - k + 1):\r\n m = max(m, c_ps[i] + a_ps[k + i] - a_ps[i] + c_ps[-1] - c_ps[k + i])\r\n\r\nprint(m)", "n, k = list(map(int, input().split()))\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n if arr2[i] == 1:\r\n total += arr1[i]\r\n\r\ntemp, max_ =0, 0\r\nfor i in range(k):\r\n if arr2[i] == 0:\r\n temp += arr1[i]\r\n\r\nmax_ = max(max_, temp)\r\nl = 0\r\nfor r in range(k, n):\r\n if arr2[l] == 0:\r\n temp -= arr1[l]\r\n \r\n if arr2[r] == 0:\r\n temp += arr1[r]\r\n \r\n max_ = max(max_, temp)\r\n\r\n l += 1\r\n\r\n\r\nprint(total + max_)", "n,k=map(int,input().split())\r\n\r\na=list(map(int,input().split()))+[0]\r\nt=list(map(int,input().split()))\r\n\r\ns=0\r\n\r\nfor i in range(n):\r\n if t[i]:\r\n s+=a[i]\r\n a[i]=0\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nans=s\r\nfor i in range(n-k+1):\r\n ans=max(ans,s+a[i+k-1]-a[i-1])\r\nprint(ans)", "n,k = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\ni = 0\r\nj = 0\r\nsm = 0\r\nmx = 0 \r\nout = 0\r\nfor a in range(n):\r\n out += l1[a]*l2[a]\r\nwhile i < n :\r\n while i-j < k :\r\n if(l2[i] == 0) :\r\n sm += l1[i]\r\n i += 1\r\n mx = max(mx,sm)\r\n if l2[j] == 0 :\r\n sm -= l1[j]\r\n j += 1\r\nprint (out + mx)", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\na_comp = [0] * n\nans = 0\n\nfor i in range(n):\n if t[i]:\n ans += a[i]\n else:\n a_comp[i] = a[i]\n\nk_sum = 0\nk_sum_max = 0\n\nfor i in range(k):\n k_sum += a_comp[i]\n\nk_sum_max = k_sum\n\nfor i in range(k, n):\n k_sum += a_comp[i]\n k_sum -= a_comp[i - k]\n if k_sum > k_sum_max:\n k_sum_max = k_sum\n\nprint(ans + k_sum_max)\n", "n, k = map(int, input().split())\r\ntheorems = list(map(int, input().split()))\r\nbehavior = list(map(int, input().split()))\r\n\r\ncount = 0\r\nmax_secret_count = 0\r\nleft = 0\r\n\r\nsecret_count = 0\r\n\r\nfor i in range(len(theorems)):\r\n if behavior[i] == 1:\r\n count += theorems[i]\r\n else:\r\n secret_count += theorems[i]\r\n\r\n while i - left >= k:\r\n if behavior[left] == 0:\r\n secret_count -= theorems[left]\r\n left += 1\r\n\r\n max_secret_count = max(max_secret_count, secret_count)\r\n\r\nprint(count + max_secret_count)\r\n\r\n", "n, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n if p[i] == 1:\r\n sum += t[i]\r\n t[i] = 0\r\nMax = 0\r\nfor i in range(k):\r\n Max += t[i]\r\nkol = Max\r\nfor i in range(1, n-k+1):\r\n kol = kol + t[i+k-1] - t[i-1]\r\n if kol > Max:\r\n Max = kol\r\n\r\nprint(sum+Max)\r\n", "def solve(k, theorems, awake):\n copy_theorems = [i for i in theorems]\n theorems_a = [0 for i in range(len(theorems))]\n\n if awake[0] == 1:\n theorems_a[0] = copy_theorems[0]\n for i in range(1, len(theorems)):\n theorems[i] += theorems[i - 1]\n theorems_a[i] = theorems_a[i - 1]\n\n if awake[i] == 1:\n theorems_a[i] += copy_theorems[i]\n\n theorems.insert(0, 0)\n theorems_a.insert(0, 0)\n result = 0\n\n for i in range(len(theorems) - k):\n sum_t = theorems[i+k] - theorems[i]\n sum_a = theorems_a[i+k] - theorems_a[i]\n \n result = max(result, sum_t - sum_a)\n\n return theorems_a[-1] + result\n\n\nd, k = list(map(int, input().split()))\ntheorems = list(map(int, input().split()))\nawake = list(map(int, input().split()))\n\nprint(solve(k, theorems, awake))\n", "duration, minMinuite = map(int, input().split())\r\ntheorems = list(map(int, input().split()))\r\nminute = list(map(int, input().split()))\r\n'''\r\nApproach: Sliding Windows\r\n'''\r\n# total wake up time\r\nwakeupTime = 0\r\nfor i in range(duration):\r\n if minute[i] == 1:\r\n wakeupTime += theorems[i]\r\n\r\n# current straight wake up time\r\ncurrWakeup = 0\r\nfor i in range(minMinuite):\r\n if minute[i] == 0:\r\n currWakeup += theorems[i]\r\n\r\n# maximum wake up time\r\nmaxWake = wakeupTime + currWakeup\r\nptr1, ptr2 = 0, minMinuite\r\n\r\nwhile ptr2 < duration:\r\n # decrease the current wake up time if the previous point points that Mishka is asleep\r\n if minute[ptr1] == 0:\r\n currWakeup -= theorems[ptr1]\r\n # increase the current wake up time if the current point points that Mishka is asleep\r\n if minute[ptr2] == 0:\r\n currWakeup += theorems[ptr2]\r\n maxWake = max(maxWake, wakeupTime + currWakeup)\r\n ptr1 += 1\r\n ptr2 += 1\r\n\r\nprint(maxWake)\r\n", "import sys\r\nn, k = [int(x) for x in sys.stdin.readline().split()]\r\ntheorems = [int(x) for x in sys.stdin.readline().split()]\r\nbehavior = [int(x) for x in sys.stdin.readline().split()]\r\ncurTech = 0\r\nwakeTheorem = 0\r\nfor i in range(k):\r\n wakeTheorem += theorems[i]*behavior[i]\r\n curTech += theorems[i]*(not behavior[i])\r\nmaxTech = curTech\r\n\r\nfor i in range(k,n):\r\n wakeTheorem += theorems[i]*behavior[i]\r\n curTech += theorems[i]*(not behavior[i]) - theorems[i-k]*(not behavior[i-k])\r\n maxTech = max(maxTech, curTech)\r\nprint(maxTech+wakeTheorem)", "n,k = map(int,input().split())\narray = list(map(int,input().split()))\nsleep = list(map(int,input().split()))\ns = 0\nfor i in range(len(sleep)):\n if sleep[i] == 1:\n s += array[i]\n array[i] = 0\n\ninitial_score = sum(array[:k])\nmax_score = initial_score\n\nfor i in range(n-k):\n initial_score = initial_score - array[i] + array[i+k]\n max_score = max(initial_score,max_score)\n\nprint(s+max_score)\n\n\t\t \t \t\t\t \t\t \t \t \t \t\t \t", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\ntheorems=list(map(int,input().split()))\r\nsleep=list(map(int,input().split()))\r\ntsum=[]\r\nts=0\r\nsleepsum=[]\r\nslsum=0\r\nfor i in range(n):\r\n ts+=theorems[i]\r\n tsum.append(ts)\r\n if(sleep[i]==1):\r\n slsum+=theorems[i]\r\n sleepsum.append(slsum)\r\n#print(\"tsum=\",tsum)\r\n#print(\"sleepsum=\",sleepsum)\r\nmaxdiff=0\r\n#print(\"slsum=\",slsum)\r\nmaxdiff=tsum[k-1]-sleepsum[k-1]\r\nfor i in range(1,n-k+1):\r\n diff=(tsum[i+k-1]-tsum[i-1])-(sleepsum[i+k-1]-sleepsum[i-1])\r\n #print(\"i=\",i,\"diff=\",diff)\r\n maxdiff=max(maxdiff,diff)\r\n#print(\"maxdiff=\",maxdiff)\r\nprint(slsum+maxdiff)", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nT = list(map(int, input().split()))\r\nL = [0]*(n+1)\r\nS = 0\r\nfor i in range(n):\r\n L[i+1] = (1-T[i]) * A[i]\r\n S += T[i] * A[i]\r\n L[i+1] += L[i]\r\nres = 0\r\nfor i in range(n-k+1):\r\n res = max(res, S + L[i+k] - L[i])\r\nprint(res)", "n, k = map(int, input().split())\r\na = [int(r) for r in input().split()]\r\nt = [int(p) for p in input().split()]\r\n\r\n\r\ni = 0\r\nj = k - 1\r\nmax_add = 0\r\nsum_all = 0\r\nfor l in range(k):\r\n max_add += int(not t[l]) * a[l]\r\n sum_all += t[l] * a[l]\r\n\r\nadd_now = max_add\r\nwhile j < n - 1:\r\n i += 1\r\n j += 1\r\n add_now -= a[i - 1] * int(not t[i - 1])\r\n add_now += a[j] * int(not t[j])\r\n sum_all += t[j] * a[j]\r\n max_add = max(max_add, add_now)\r\n\r\n\r\nprint(max_add + sum_all)\r\n\r\n", "N,K=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\nfor i in range(K):\r\n if B[i]==0:\r\n s1+=A[i]\r\n else:\r\n s2+=A[i]\r\nans=s1\r\nfor i in range(K,N):\r\n d=i-K\r\n if B[d]==0:\r\n s1-=A[d]\r\n if B[i]==0:\r\n s1+=A[i]\r\n else:\r\n s2+=A[i]\r\n ans=max(ans,s1)\r\nprint(s2+ans)", "n,k=map(int,input().split())\r\nmarks=[int(i) for i in input().split()]\r\nawake=[int(i) for i in input().split()]\r\nans=sum(marks[i] for i in range(n) if awake[i]==1)\r\nfor i in range(n):\r\n if awake[i]==1:\r\n marks[i]=0 \r\nmaxi=sum(marks[0:k])\r\nsm=sum(marks[0:k])\r\nfor i in range(k,n):\r\n sm=sm+marks[i]-marks[i-k]\r\n maxi=max(maxi,sm)\r\nprint(maxi+ans)", "# https://codeforces.com/problemset/problem/961/B\r\n# lecture sleep, using sliding window\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nb = [a[i]*t[i] for i in range(n)]\r\nc = [a[i]*(1-t[i]) for i in range(n)]\r\ntotal = sum(b)\r\npsum = sum(c[:k])\r\nbest = psum\r\nfor i in range(n-k):\r\n psum += c[k+i] - c[i]\r\n best = max(best, psum)\r\nprint(total + best)", "import math\n\ndef lcm(a, b):\n return (a * b) // math.gcd(a, b)\n\ndef makermama():\n n, k = map(int, input().split())\n v = list(map(int, input().split()))\n v1 = list(map(int, input().split()))\n oo = sum([v[i] for i in range(n) if v1[i]])\n for i in range(k):\n if not v1[i]:\n oo += v[i]\n xx = oo\n for i in range(n - k):\n if not v1[i]:\n oo -= v[i]\n if not v1[i+k]:\n oo += v[i+k]\n xx = max(xx, oo)\n print(xx)\n\ndef main():\n # t = int(input())\n t = 1\n while t > 0:\n t -= 1\n makermama()\n\nif __name__ == '__main__':\n main()\n\n \t \t \t\t \t \t\t \t\t \t", "\r\nn, k = map(int, input().split())\r\na_vec = list(map(int, input().split()))\r\nt_vec = list(map(int, input().split()))\r\n\r\nsleep_vec = [0] * n\r\na_sum = 0\r\na_zero_sum = 0\r\ni_zero = 0\r\n\r\nfor i in range(n):\r\n if i >= k and t_vec[i - k] == 0:\r\n i_zero -= a_vec[i - k]\r\n\r\n if t_vec[i] == 1:\r\n a_sum += a_vec[i]\r\n else:\r\n i_zero += a_vec[i]\r\n a_zero_sum = max(a_zero_sum, i_zero)\r\n\r\nprint(a_sum + a_zero_sum)\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if t[i]:\r\n t[i] = a[i]\r\n\r\nfor i in range(1, n):\r\n a[i] += a[i - 1]\r\n t[i] += t[i - 1]\r\n\r\nres = t[-1]\r\nfor i in range(n - k + 1):\r\n left = t[i - 1] if i else 0\r\n right = t[-1] - t[i + k - 1]\r\n mid = a[i + k - 1] - (a[i - 1] if i else 0)\r\n res = max(res, left + mid + right)\r\n\r\nprint(res)", "n, k = map(int, input().split())\ntheo = tuple(map(int, input().split()))\nawak = tuple(map(int, input().split()))\n\ntot = sum(theo[i] for i in range(n) if awak[i])\ncur = sum(theo[i] for i in range(k) if not awak[i])\nbest = cur\n\nfor i in range(n - k):\n\tif not awak[i]:\n\t\tcur -= theo[i]\n\tif not awak[i + k]:\n\t\tcur += theo[i + k]\n\t\n\tif cur > best:\n\t\tbest = cur\n\nprint(tot + best)", "n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nt = list(map(int, input().strip().split(' ')))\r\ns=0\r\nl=[]\r\nfor i in range(n):\r\n if t[i]==1:\r\n s+=lst[i]\r\n if t[i]==0:\r\n l.append(lst[i])\r\n else:\r\n l.append(0)\r\ns1=sum(l[:k])\r\nm=s1\r\nfor i in range(n-k):\r\n s1-=l[i]\r\n s1+=l[k+i]\r\n if s1>m:\r\n m=s1\r\nprint(m+s)\r\n", "n,k = map(int,input().split())\r\nmas = list(map(int,input().split()))\r\nlizt = list(map(int,input().split()))\r\nres = 0\r\nfor i in range(n):\r\n if lizt[i]==1:\r\n res+=mas[i]\r\nq=0\r\nfor i in range(k):\r\n if lizt[i]==0:\r\n q+=mas[i]\r\na = q\r\nfor i in range(1,n-k+1):\r\n e = a\r\n if lizt[i-1]==0:\r\n e-=mas[i-1]\r\n if lizt[i+k-1]==0:\r\n e+=mas[i+k-1]\r\n if q<e:\r\n q=e\r\n a = e\r\nprint(res+q)", "import sys\ninput = sys.stdin.readline\nimport math\nimport copy\nimport collections\nfrom collections import deque\nimport heapq\nimport itertools\nfrom collections import defaultdict\nfrom collections import Counter\n\nn,k = map(int,input().split())\na = list(map(int,input().split()))\nt = list(map(int,input().split()))\npre = [0]\nfor i in range(n):\n if t[i]==0:\n pre.append(pre[i]+a[i])\n else:\n pre.append(pre[i])\nmx = 0\nfor i in range(n-k+1):\n l = i\n r = i+k\n ans = pre[r]-pre[l]\n mx = max(mx,ans)\nans = 0\nfor i in range(n):\n if(t[i]==1):\n ans+=a[i]\nprint(ans+mx)\n", "\"\"\"How long should you try? Until it get Accepted.\"\"\"\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == 1:\r\n ans = ans + l[i]\r\n l[i] = 0\r\ni = 0\r\nss = 0\r\nwhile i < k:\r\n ss = ss + l[i]\r\n i = i + 1\r\nj = 0\r\nprev = ss\r\nwhile i < n:\r\n prev = prev + l[i] - l[j]\r\n ss = max(prev, ss)\r\n i = i + 1\r\n j = j + 1\r\nprint(ans + ss)\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\nres = 0\nfor i in range(n):\n if t[i]:\n res += a[i]\n a[i] = 0\n\ncs = [0] * (n+1)\nfor i in range(1, n+1):\n cs[i] = a[i-1] + cs[i-1]\n\ntmp = 0\nfor i in range(n, m-1, -1):\n tmp = max(tmp, cs[i] - cs[i-m])\n\nprint(res + tmp)\n\n \t\t \t \t \t\t \t \t\t\t \t \t\t \t\t", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nb = []\r\ns = 0\r\nfor i in range(k):\r\n if t[i]:\r\n s += a[i]\r\nb.append(s)\r\nfor i in range(k, n):\r\n if t[i]:\r\n s += a[i]\r\n if t[i - k]:\r\n s -= a[i - k]\r\n b.append(s)\r\n\r\nc = []\r\ns = 0\r\nfor i in range(k):\r\n s += a[i]\r\nc.append(s)\r\nfor i in range(k, n):\r\n s += a[i]\r\n s -= a[i - k]\r\n c.append(s)\r\n\r\nans = 0\r\nfor i in range(n - k + 1):\r\n ans = max(ans, c[i] - b[i])\r\n\r\nfor i in range(n):\r\n if t[i]:\r\n ans += a[i]\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nguar = sum([a[i] for i in range(n) if t[i] == 1])\r\nprod = [(1 - t[i]) * a[i] for i in range(n)]\r\nmaximum = sum(prod[:k])\r\nmax_ind = 0\r\ncurr_sum = maximum\r\nfor i in range(n-k):\r\n\tcurr_sum += prod[i+k] - prod[i]\r\n\tif curr_sum > maximum:\r\n\t\tmaximum = curr_sum\r\n\t\tmax_ind = i + 1\r\nprint(guar + sum(prod[max_ind:max_ind + k]))\r\n", "#s=list(input()) #for string\r\nimport math\r\nimport array as arr\r\nimport bisect\r\ninarr=lambda:map(int,input().split()) #similar to #define \r\nn,k=map(int,input().split())\r\ns=list(inarr())\r\nb=list(inarr())\r\na=[0]*(n+1)\r\nsum1=0\r\nfor i in range(n):\r\n if(b[i]==1):\r\n sum1+=s[i]\r\nssum=0 \r\nfor i in range(n):\r\n if(b[i]==0):\r\n ssum+=s[i]\r\n a[i+1]=ssum\r\ni=k\r\nmaxx=0\r\nwhile(i<=n):\r\n if(a[i]-a[i-k]>maxx):\r\n maxx=a[i]-a[i-k]\r\n i=i+1 \r\nprint(sum1+maxx) ", "n, k = map(int, input().split())\ntheorems = list(map(int, input().split()))\nbehavior = list(map(int, input().split()))\n\nmax_theorems = 0\nawake_theorems = 0\n\nfor i in range(n):\n if behavior[i] == 1:\n awake_theorems += theorems[i]\n\nmax_theorems = awake_theorems\n\nfor i in range(n):\n if behavior[i] == 0:\n awake_theorems += theorems[i]\n\n if i >= k and behavior[i - k] == 0:\n awake_theorems -= theorems[i - k]\n\n max_theorems = max(max_theorems, awake_theorems)\n\nprint(max_theorems)\n\n\t \t\t\t\t \t\t\t \t \t\t \t\t\t \t\t", "def solve(n, k, t, a):\n # the crux idea is that if i take the cumulative sum of the array\n # then i can create the sum of any interval through substraction\n\n # if i create the cumulative sum for the array (assuming that mishka is awake the entire time), and i\n # also create the cumulative sum for the array using mishka's actual awake value, then i should be able\n # to figure out the maximum time by trying all spot to awake on ( O(N) )\n\n # create the always awake cumulative sum\n awake = [0 for i in range(n)]\n awake[0] = t[0]\n for i in range(1, n):\n awake[i] = t[i] + awake[i-1]\n\n # create the actual cumulative sum\n actual = [0 for i in range(n)]\n actual[0] = t[0] * a[0]\n for i in range(1, n):\n actual[i] = t[i] * a[i] + actual[i-1]\n\n\n m = 0\n for i in range(n - k + 1):\n\n # choose to use the technique at index i\n start_awake = i\n end_awake = i + k - 1 # inclusive\n awake_total = awake[end_awake] - awake[start_awake] + t[start_awake]\n\n # add everthing from the front\n front_end = i - 1\n front_total = 0\n if front_end >= 0:\n front_total = actual[front_end]\n\n end_start = i + k\n end_total = 0\n if end_start <= (n - 1):\n end_total = actual[n-1] - actual[end_start - 1]\n\n total = awake_total + front_total + end_total\n m = max(m, total)\n return m\n\n\nnk = [int(i) for i in input().split()]\nn = nk[0]\nk = nk[1]\n\nt = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nprint(solve(n, k, t, a))\n", "#https://codeforces.com/contest/961/problem/B\r\n\r\nn, k = map(int, input().split())\r\n\r\na = [int(i) for i in input().split()]\r\nt = [int(i) for i in input().split()]\r\n\r\nmissed_cum = [0]\r\ns = 0\r\n\r\nfor ai, ti in zip(a, t):\r\n if ti == 0:\r\n missed_cum.append(missed_cum[-1] + ai)\r\n else:\r\n missed_cum.append(missed_cum[-1])\r\n s += ai\r\n\r\n\r\nm = -1\r\nbi = 0\r\nfor i in range(len(missed_cum) - k):\r\n s_ = missed_cum[i + k] - missed_cum[i]\r\n if s_ > m:\r\n bi = i\r\n m = s_\r\n\r\nprint(s + m)", "\r\ndef func(n, k, theorems, misha):\r\n max_sum = 0\r\n for i in range(k):\r\n if misha[i] == 0:\r\n max_sum += theorems[i]\r\n \r\n j = k \r\n cur_sum = max_sum\r\n \r\n for i in range(1, n - k + 1):\r\n if misha[i - 1] == 0:\r\n cur_sum -= theorems[i - 1]\r\n if misha[j] == 0:\r\n cur_sum += theorems[j]\r\n max_sum = max(max_sum, cur_sum)\r\n i += 1\r\n j += 1\r\n return max_sum\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n s = list(map(int, input().split()))\r\n n = s[0] #длительность лекции в минутах\r\n k = s[1] #минут я могу заставить его не спать\r\n theorems = list(map(int, input().split()))\r\n misha = list(map(int, input().split()))\r\n start_ans = 0\r\n for i in range(n):\r\n if misha[i] == 1:\r\n start_ans += theorems[i]\r\n second_ans = func(n, k, theorems, misha)\r\n print(start_ans + second_ans)\r\n\r\nmain()\r\n\r\n", "def solve(n: int, k: int, a: list, t: list, total: int = 0):\r\n for i in range(n):\r\n if t[i]:\r\n total += a[i]\r\n a[i] = 0\r\n \r\n b = list(map(lambda x: 0, range(n)))\r\n b[k - 1] = sum(a[:k])\r\n for i in range(k, n):\r\n b[i] = b[i - 1] - a[i - k] + a[i]\r\n return total + max(b)\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n t = list(map(int, input().split()))\r\n print(solve(n, k, a, t))\r\n\r\nif __name__ == '__main__':\r\n main()", "def one_case():\n n, k = map(int, input().split())\n a = [int(x) for x in input().split()]\n t = [int(x) for x in input().split()]\n s1 = [0] * (n + 1)\n s2 = [0] * (n + 1)\n maxx = 0\n for i in range(n):\n s1[i + 1] = s1[i] + a[i]\n s2[i + 1] = s2[i] + a[i] * t[i]\n x = s1[i + 1] - s1[i - k + 1]\n y = s2[i + 1] - s2[i - k + 1]\n sk = x - y\n if maxx < sk:\n maxx = sk\n # print(i, x, y, a[i-k+1:i+1], t[i-k+1:i+1], maxx)\n print(s2[n] - s2[0] + maxx)\n\n\n# t = int(input())\nt = 1\nfor i in range(t):\n one_case()\n\n \t\t\t \t\t\t \t\t \t \t\t \t\t\t\t \t \t\t \t", "n, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nt = [int(x) for x in input().split()]\r\nb = [0]\r\ntotal = 0\r\nfor i in range(n):\r\n if t[i] == 0:\r\n b.append(a[i]+b[i])\r\n else:\r\n b.append(b[i])\r\n total += a[i]\r\nmaxi = -1\r\nfor i in range(1, n-k+2):\r\n maxi = max(maxi, b[i+k-1]-b[i-1])\r\nprint(total+maxi)\r\n", "\n[n, k] = list(map(int, input().split(' ')))\n\nlecture = list(map(int, input().split(' ')))\nsleeps = list(map(int, input().split(' ')))\n\nawakePoints = 0\nsummations = [0] * n\nfor i in range(n):\n if sleeps[i] == 1:\n awakePoints += lecture[i]\n else:\n summations[i] = lecture[i]\n\nmaxPoints = 0\npointer1 = 0\npointer2 = k\naccum = 0\nfor i in range(k):\n accum += summations[i]\nmaxPoints = accum\nwhile pointer2 < n:\n accum += summations[pointer2] - summations[pointer1]\n if accum > maxPoints:\n maxPoints = accum\n pointer1 += 1\n pointer2 += 1\n\nprint(awakePoints + maxPoints)\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())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsm = 0\r\nfor i in range(n):\r\n if b[i]:\r\n sm += a[i]\r\n# print(sm)\r\nl = []\r\nm = 0\r\nfor i in range(n):\r\n if b[i] == 0:\r\n m += a[i]\r\n l.append(m)\r\n# print(l)\r\nkk = 0\r\nfor i in range(n):\r\n if not b[i]:\r\n if i == 0:\r\n kk = max(kk, l[min(n-1, i+k-1)])\r\n else:\r\n # print(i)\r\n kk = max(kk, l[min(n-1, i+k-1)]-l[i-1])\r\nprint(sm+kk)\r\n", "def dp(k,a,t):\r\n pref=[0]*(len(a))\r\n abs=0\r\n for i in range(len(a)):\r\n if i:\r\n pref[i]=pref[i-1]\r\n if t[i]==0:\r\n pref[i]+=a[i]\r\n else:\r\n abs+=a[i]\r\n mx=0\r\n for i in range(k-1,len(a)):\r\n if i-k>=0:\r\n mx=max(mx,pref[i]-pref[i-k])\r\n else:\r\n mx=max(mx,pref[i])\r\n return mx+abs\r\n\r\na,b=map(int,input().strip().split())\r\nlst=list(map(int,input().strip().split()))\r\nlst2=list(map(int,input().strip().split()))\r\nprint(dp(b,lst,lst2))", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nl = 0\r\nr = 0\r\nbonus = 0\r\nfor i in range(k):\r\n if b[i] == 0:\r\n bonus += a[i]\r\n \r\ntotal = sum([x for x, y in zip(a, b) if y == 1])\r\nmax_l = 0\r\nmax_b = bonus\r\nr = k - 1\r\nwhile r < len(a)-1:\r\n l += 1\r\n r += 1\r\n if b[r] == 0:\r\n bonus += a[r]\r\n \r\n if b[l-1] == 0:\r\n bonus -= a[l-1]\r\n \r\n max_b = max(max_b, bonus, 0)\r\n \r\nprint(total+max_b)", "import sys\n#sys.setrecursionlimit(20000)\n#from collections import deque #Counter\nfrom itertools import accumulate\n#from functools import product\n#import math\n\n\ndef rall():\n return sys.stdin.readlines()\ndef rl():\n return sys.stdin.readline().strip()\ndef rl_types(types):\n str_list = [x for x in sys.stdin.readline().strip().split(' ')]\n return [types[i](str_list[i]) for i in range(len(str_list))]\n\ndef pr( something='' ):\n sys.stdout.write( str(something) + '\\n')\ndef pra( array ):\n sys.stdout.write( ' '.join([str(x) for x in array]) + '\\n')\n\n\ndef solve(array):\n return array\n\n\nif __name__ == '__main__':\n\n n,k = map(int, rl().split(' '))\n thms = list(map(int, rl().split(' ')))\n sleep = list(map(int, rl().split(' ')))\n thms_sum = sum([0 if sleep[i]==0 else thms[i] for i in range(n)])\n thms_missed = [0 if sleep[i]==1 else thms[i] for i in range(n)]\n cum = [0,*list(accumulate(thms_missed))]\n #print(cum)\n #print(thms_missed)\n mx = 0\n for i in range(1,n-k+2):\n #print(i,i+k-1,cum[i+k-1]-cum[i-1])\n mx = max(mx,cum[i+k-1]-cum[i-1])\n print(thms_sum + mx)\n \n\n\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nt = list(map(int, input().split()))\n \nx = 0\nfor i in range(n):\n if t[i]:\n x += a[i]\n a[i] = 0\n \ncs = [0] * (n+1)\nfor i in range(1, n+1):\n cs[i] = a[i-1] + cs[i-1]\n \ny = 0\nfor i in range(n, m-1, -1):\n y = max(y, cs[i] - cs[i-m])\n \nprint(x + y)\n \t \t \t \t \t \t\t\t \t \t", "n, k = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nt = [int(i) for i in input().split()]\r\nlec = 0\r\nfor i in range(n):\r\n if t[i] == 1:\r\n lec += arr[i]\r\n t[i] = 0\r\n else:\r\n t[i] = 1\r\n\r\ntemp_lec = sum([arr[i] * t[i] for i in range(k)])\r\nmax_lec = temp_lec\r\nfor i in range(k, n):\r\n temp_lec += (arr[i] * t[i] - arr[i - k] * t[i - k])\r\n max_lec = max(max_lec, temp_lec)\r\n\r\nprint(lec + max_lec)\r\n", "import sys\ninput = sys.stdin.readline\n \nt = 1\nfor _ in range(t):\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n t = list(map(int, input().split()))\n ans = 0\n for i in range(n):\n if t[i]:\n ans += a[i]\n a[i] = 0\n s = sum(a[:k])\n val = s\n for i in range(k, n):\n s = s + a[i] - a[i-k]\n if s > val:\n val = s \n print(ans + val)\n\t\t \t \t \t\t \t\t \t \t \t\t \t\t \t", "def main():\r\n n, k = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split()))\r\n\r\n prefix_sum_arr = [0]\r\n for i in range(n):\r\n prefix_sum_arr.append(prefix_sum_arr[-1] + (arr[i] if arr2[i] == 1 else 0))\r\n\r\n max_value = 0\r\n for i in range(n - k + 1):\r\n if i == 0:\r\n window_sum = sum(arr[:k])\r\n else:\r\n window_sum += arr[i + k - 1] - arr[i - 1]\r\n\r\n test_value = (\r\n prefix_sum_arr[-1] - prefix_sum_arr[i + k] + prefix_sum_arr[i] + window_sum\r\n )\r\n max_value = max(max_value, test_value)\r\n\r\n print(max_value)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from functools import lru_cache\r\nfrom collections import defaultdict, deque, Counter\r\nimport sys\r\n\r\n\r\ndef WakeHimUp(n, k, theorems, behavior):\r\n # TODO write an algorithm here\r\n obvioustheorems = 0\r\n for i in range(n):\r\n if behavior[i] == 1:\r\n obvioustheorems += theorems[i]\r\n\r\n runningsum = 0\r\n for i in range(k):\r\n if behavior[i] == 0:\r\n runningsum += theorems[i]\r\n max_theorems = runningsum\r\n for j in range(k, n):\r\n if behavior[j-k] == 0:\r\n runningsum -= theorems[j-k]\r\n if behavior[j] == 0:\r\n runningsum += theorems[j]\r\n max_theorems = max(max_theorems, runningsum)\r\n \r\n return obvioustheorems + max_theorems\r\n\r\nn, k = list(map(int, input().split()))\r\ntheorems = list(map(int, input().split()))\r\nbehavior = list(map(int, input().split()))\r\nprint(WakeHimUp(n, k, theorems, behavior))", "n, k = [int(x) for x in input().split()]\nteoremas = [int(x) for x in input().split()]\nacordado = [int(x) for x in input().split()]\n\nacumuladoWake = [0] * (n+1)\nacumuladoSleep = [0] * (n+1)\n\nfor i in range(1, n+1):\n\tacumuladoWake[i] = teoremas[i-1] + acumuladoWake[i-1]\n\tif acordado[i-1] == 1:\n\t\tacumuladoSleep[i] = teoremas[i-1] + acumuladoSleep[i-1]\n\telse:\n\t\tacumuladoSleep[i] = 0 + acumuladoSleep[i-1]\n\nwindowSum = 0\nmaxSum = 0\n\nfor i in range(1, n-k+2):\n\twake = acumuladoWake[i+k-1] - acumuladoWake[i-1]\n\tsleep = acumuladoSleep[i+k-1] - acumuladoSleep[i-1]\n\twindowSum = wake - sleep\n\t\n\tmaxSum = max(windowSum, maxSum)\nprint(maxSum+acumuladoSleep[n])\n\t\t\n", "def main():\n n, k = map(int, input().split())\n a = [int(x) for x in input().split()]\n t = [int(x) for x in input().split()]\n print(solve(n, k, a, t))\n\ndef solve(n, k, a, t):\n # prefix_awake[n]: Containing the number of theorems written till the end of nth second while awake.\n prefix_awake = [0 for x in range(n + 1)]\n # prefix_thm[n]: Containing the total number of theorems taught till the end of nth second. \n prefix_thm = [0 for x in range(n + 1)]\n for index in range(1, n + 1):\n prefix_thm[index] = prefix_thm[index - 1] + a[index - 1]\n if t[index - 1] == 1:\n prefix_awake[index] = prefix_awake[index - 1] + a[index - 1]\n else:\n prefix_awake[index] = prefix_awake[index - 1]\n maximum = 0\n # Start at the end of the start-th second, from (start + 1)th second.\n for start in range(0, n - k + 1):\n maximum = max(maximum, prefix_awake[start] + prefix_thm[start + k] - prefix_thm[start] + prefix_awake[n] - prefix_awake[start + k])\n return maximum\n\nmain()", "n, k = map(int, input().split())\r\nl = [*map(int, input().split())]\r\nt = [*map(int, input().split())]\r\n\r\na = [0]\r\nres = 0\r\n\r\nfor i in range(1, n + 1):\r\n a.append(a[-1] + l[i - 1] * (t[i - 1] ^ 1))\r\n\r\nfor i in range(1, n + 1):\r\n d = a[min(n, i + k - 1)] - a[i - 1]\r\n res = max(res, d)\r\n\r\nprint(res + sum(l) - a[-1])\r\n", "n, k = map(int, input().split())\r\naa = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nanswer1 = 0\r\nfor i in range(0, n):\r\n if t[i] == 1:\r\n answer1 += aa[i]\r\n aa[i] = 0\r\n\r\nanswer0 = 0\r\nsum = 0\r\nfor i in range(0, n):\r\n sum += aa[i]\r\n if i >= k:\r\n sum -= aa[i-k]\r\n answer0 = max(answer0, sum)\r\nprint(answer1+answer0)", "n , k = map(int , input().split())\r\nd1 = list(map(int , input().split()))\r\nd2 = list(map(int , input().split()))\r\ntotal = 0\r\nfor i in range(n):\r\n total += d1[i]*d2[i]\r\n\r\ncur = 0\r\nfor i in range(k):\r\n cur += d1[i]*(1-d2[i])\r\nm = cur\r\n\r\nfor i in range(n-k):\r\n temp = cur - d1[i]*(1-d2[i]) + d1[k+i]*(1-d2[k+i])\r\n cur = temp\r\n if cur > m:\r\n m = cur\r\n\r\nprint(total + m)", "R = lambda: map(int, input().split())\n \nn, k = R()\nA = tuple(zip(R(), R()))\ns = sum(x for x, y in A if y)\nm = d = sum(x for x, y in A[:k] if y ^ 1)\nfor i in range(n - k):\n d += A[i + k][0] * (1 - A[i+k][1]) - A[i][0] * (1 - A[i][1])\n if d > m: \n m = d\nprint(s + m)\n \t\t\t\t \t \t\t \t \t\t \t", "n,k=list(map(int,input().strip().split()))\r\na=list(map(int,input().strip().split()))\r\nt=list(map(int,input().strip().split()))\r\npr=[0]\r\nfor i in range(n):\r\n pr.append(pr[-1]+a[i])\r\nprNew=[0]\r\nfor i in range(n):\r\n if t[i]==1:\r\n prNew.append(prNew[-1]+a[i])\r\n else:\r\n prNew.append(prNew[-1])\r\nmx=0\r\nfor i in range(1,n-k+2):\r\n cur=pr[i+k-1]-pr[i-1]+prNew[i-1]\r\n if i+k<=n:\r\n cur+=prNew[-1]-prNew[i+k-1]\r\n mx=max(mx,cur)\r\nprint(mx)", "n,k=map(int,input().split(' '))\r\na=list(map(int,input().split(' ')))\r\nt=list(map(int,input().split(' ')))\r\nSums=[]\r\n\r\nif t[0]==0:\r\n Sums.append(a[0])\r\nelse:\r\n Sums.append(0)\r\n\r\nfor i in range(1,n):\r\n if t[i]==0:\r\n Sums.append(Sums[i-1]+a[i])\r\n else:\r\n Sums.append(Sums[i-1])\r\n\r\n\r\n\r\nindex=0\r\nMax=0\r\nminus=0\r\nfor i in range(k-1,n):\r\n if Sums[i]-minus>Max:\r\n Max=Sums[i]-minus\r\n index=i\r\n minus=Sums[i-k+1]\r\n\r\n\r\n\r\n\r\nfor i in range(index-k+1,index+1):\r\n t[i]=1\r\n\r\nSum=0\r\nfor i in range(len(a)):\r\n if t[i]==1:\r\n Sum+=a[i]\r\n\r\nprint(Sum)", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nprefix_sum = [0]*(n+1)\r\nfor i in range(len(a)):\r\n prefix_sum[i+1] = prefix_sum[i]+a[i]\r\nprefix_sum_m = [0]*(n+1)\r\nfor i in range(n):\r\n prefix_sum_m[i+1] = prefix_sum_m[i]+a[i]*t[i]\r\nm = 0\r\nfor i in range(n-k+1):\r\n s = prefix_sum[i+k]-prefix_sum[i]-(prefix_sum_m[i+k]-prefix_sum_m[i])\r\n if s > m:\r\n m = s\r\n \r\nprint(prefix_sum_m[n]+m)", "n,k=input().split(\" \")\r\nn=int(n)\r\nk=int(k)\r\nlect=input().split(\" \")\r\nlect=[int(i) for i in lect]\r\nsleep=input().split(\" \")\r\nsleep=[int(i) for i in sleep]\r\nsleep=[0 if sleep[i]==0 else lect[i] for i in range(n)]\r\nfor i in range(1,n):\r\n sleep[i]+=sleep[i-1]\r\n lect[i]+=lect[i-1]\r\nans=0\r\nfor i in range(n-k+1):\r\n cal=lect[i+k-1]\r\n if i>0:\r\n cal-=lect[i-1]\r\n cal+=sleep[n-1]-sleep[i+k-1]\r\n if i>0:\r\n cal+=sleep[i-1]\r\n ans=max(ans,cal)\r\nprint(ans)", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\np=[0]\nans=0;\ne=0\nfor i in range(n):\n if i>0:\n p.append(p[i-1])\n if b[i]==1:\n ans+=a[i]\n else:\n p[i]+=a[i]\nfor i in range(k-1,n):\n e=max(e,p[i]-(p[i-k] if i-k >= 0 else 0))\nprint(ans+e)\n\n \t \t\t\t \t\t\t \t \t\t\t \t \t \t\t", "I = lambda : map(int,input().split())\r\nn,k = I()\r\nli = list(I())\r\nle = list(I())\r\nd={}\r\nsu=0\r\nfor i in range(n) :\r\n su+=li[i]*le[i]\r\ni=0\r\nsuu=su\r\nt=0\r\nfor i in range(k) :\r\n if le[i]==0 :\r\n suu += li[i]\r\nans = suu\r\nfor i in range(k,n) :\r\n if le[i]==0 :\r\n suu+=li[i]\r\n if le[i-k]==0 :\r\n suu-=li[i-k]\r\n ans=max(ans,suu)\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nlec=0\r\nsu=0\r\nfor i in range(n):\r\n if b[i]==1:\r\n lec+=a[i]\r\n a[i]=0\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nfor i in range(n):\r\n if i-k<0:\r\n su=max(su,a[i])\r\n else:\r\n su=max(su,a[i]-a[i-k])\r\nprint(lec+su)\r\n", "n, k = map(int, input().split())\r\ntime = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nSt = 0\r\nS = [0]\r\nt_max = 0\r\nfor x in range(n):\r\n if t[x] == 1:\r\n St += time[x]\r\n time[x] = 0\r\nfor x in range(len(time)):\r\n S.append(S[x] + time[x])\r\nfor g in range(1, n - k + 2):\r\n t = S[g + k - 1] - S[g - 1]\r\n t_max = max(t_max, t)\r\nSt += t_max\r\nprint(St)\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nans=0\r\nm=0\r\nfor i in range(n):\r\n if t[i]:\r\n ans+=a[i]\r\n a[i]=0\r\ncf=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n cf[i]=cf[i-1]+a[i-1]\r\nfor i in range(n-k+1):\r\n m=max(m,cf[i+k]-cf[i])\r\nprint(ans+m)", "# 6 3\n# 1 3 5 2 5 4\n# 1 1 0 1 0 0\n\n# b = [4, 5, 2, 2]\n# c = [9, 10, 12, 11]\n# d = [5, 5, 10, 9]\n\n# a = 6\n\n# r = 16\n\n# n = 6, k = 3\n[n, k] = map(int, input().split(\" \"))\n\n# t = [1, 3, 5, 2, 5, 4]\nt = list(map(int, input().split(\" \")))\n\n# s = [1, 1, 0, 1, 0, 0]\ns = list(map(int, input().split(\" \")))\n\n# bs = [0, 1, 4, 4, 6, 6, 6]\nbs = [0]\n# cs = [0, 1, 4, 9, 11, 16, 20]\ncs = [0]\nfor i in range(n):\n if s[i] == 1:\n bs += [bs[i]+t[i]]\n else:\n bs += [bs[-1]]\n\n cs += [cs[i]+t[i]]\n\n# print(bs)\n# print(cs)\n\n# b = [4, 5, 2, 2]\nb = []\n# c = [9, 10, 12, 11]\nc = []\nfor i in range(n-k+1):\n b += [bs[i+k]-bs[i]]\n\n c += [cs[i+k]-cs[i]]\n\n# print(b)\n# print(c)\n\n# d = [5, 5, 10, 9]\nd = []\nfor i in range(len(b)):\n d += [c[i]-b[i]]\n\n# print(d)\n\n# a = 6\na = bs[-1]\n\nans = max(d) + a\n\nprint(ans)\n\n\n# for i in range(n-k+1):\n# b += []\n", "def solve():\n n, k = list(map(int, input().split(\" \")))\n tab = list(map(int, input().split(\" \")))\n T = list(map(int, input().split(\" \")))\n sumy = [0 for _ in range(n)]\n jedynki = 0\n for i in range(n):\n sumy[i] = sumy[i-1]\n if T[i] == 0:\n sumy[i] += tab[i]\n else:\n jedynki += tab[i]\n\n maxi = sumy[k-1]\n for i in range(1, n-k+1):\n maxi = max(maxi, sumy[i+k-1]-sumy[i-1])\n print(maxi+jedynki)\n\nsolve()\n", "import itertools as it\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nsumm = sum([a[i] for i in range(n) if t[i]])\r\na = [0] + list(it.accumulate([a[i] if not t[i] else 0 for i in range(n)]))\r\nmax_ = max([a[i] - a[i - k] for i in range(k, n + 1)])\r\n\r\nprint(summ + max_)\r\n", "p=lambda:map(int,input().split());n,k=p()\na1,t,m=list(p()),list(p()),0\nfor i in range(n):\n if t[i]==1:m+=a1[i];a1[i]=0\nr=sum(a1[:k])\nl=[r]*n\nfor j in range(1,n-k+1):\n r-=a1[j-1]-a1[j+k-1];l[j]=r\nprint(max(l[:n-k+1])+m)\n\t\t\t\t\t\t\t \t\t \t \t\t \t \t\t\t \t", "n, k = [int(i) for i in input().split()]\r\nai = [int(i) for i in input().split()]\r\nti = [int(i) for i in input().split()]\r\ngi = [ai[i]*(1-ti[i]) for i in range(n)]\r\ncurrent_gain = sum(gi[:k])\r\nmax_gain = current_gain\r\nfor i in range(1, n-k+1):\r\n current_gain = current_gain - gi[i-1] + gi[i+k-1]\r\n max_gain = max(max_gain, current_gain)\r\n\r\nprint(sum(map(lambda x,y: x*y, ai, ti))+max_gain)\r\n", "n,k = map(int,input().split())\r\n\r\narr = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\narr.insert(0,0)\r\ntot= 0\r\nfor i in range(1,len(arr)):\r\n if t[i-1] == 1:\r\n tot+=arr[i]\r\npre = [0]*len(arr)\r\nfor i in range(1,len(arr)):\r\n if t[i-1] == 1:\r\n pre[i]+=pre[i-1]+arr[i]\r\n else:\r\n pre[i] = pre[i-1]\r\nfor i in range(1,len(arr)):\r\n arr[i]+=arr[i-1]\r\nans = 0\r\n\r\nfor i in range(k,len(arr)):\r\n ans = max(ans,tot-(pre[i]-pre[i-k])+arr[i]-arr[i-k])\r\n\r\nprint(ans)\r\n\r\n", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = list(map(int, input().split()))\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nsoma = 0\n\nfor i in range(n[0]):\n if b[i] == 1:\n soma += a[i]\n a[i] = 0\n\nk = sum(a[0:n[1]])\nm = k\n\nfor i in range(n[1],n[0]):\n k += a[i]-a[i-n[1]]\n m = max(m,k)\n\nprint(soma+m)\n", "n,k=list(map(int,input().split()))\r\n\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\nans=0\r\n\r\nnew_arr=[0]*n\r\n\r\nfor i in range(n):\r\n if arr2[i]==0:\r\n new_arr[i]=arr1[i]\r\n else:\r\n ans+=arr1[i]\r\n\r\ntotal=sum(new_arr[:k])\r\nmx=total\r\n\r\nj=0\r\nfor i in range(k,n):\r\n total-=new_arr[j]\r\n total+=new_arr[i]\r\n mx=max(mx,total)\r\n j+=1\r\n \r\n \r\nprint(mx+ans)\r\n ", "def sleeping_at_lectures(n: int, k: int, a: list, t: list):\r\n ans = [0] * (n-k+1)\r\n\r\n for i in range(n):\r\n if t[i] == 1:\r\n ans[0] += a[i]\r\n\r\n for i in range(k):\r\n if t[i] == 0:\r\n ans[0] += a[i]\r\n\r\n max_x = ans[0]\r\n\r\n for i in range(1, n-k+1):\r\n ans[i] = ans[i-1]\r\n if t[i-1] == 0:\r\n ans[i] -= a[i-1]\r\n\r\n if t[i+k-1] == 0:\r\n ans[i] += a[i+k-1]\r\n\r\n max_x = ans[i] if ans[i] > max_x else max_x\r\n\r\n return max_x\r\n\r\n\r\nn, k = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\nt = list(map(int, input().split(' ')))\r\n\r\nprint(sleeping_at_lectures(n, k, a, t))\r\n", "n, k = map(int, input().split())\na = [int(x) for x in input().split()]\nt = [int(x) for x in input().split()]\np = [0]\n\nans = sum([a[i] * t[i] for i in range(n)])\n\nfor i in range(n):\n p.append(p[-1] + a[i] * (1 - t[i]))\n\nmx = 0\n\nfor i in range(k, n + 1):\n mx = max(mx, p[i] - p[i - k])\n\nprint(ans + mx)\n", "n, k = tuple(map(int, input().split(' ')))\r\ntheorems = list(map(int, input().split(' ')))\r\ndreams = list(map(int, input().split(' ')))\r\na = [x if dreams[i] else 0 for i, x in enumerate(theorems)]\r\ndreams = a\r\n\r\ncumsum1, cumsum2 = [0] * n, [0] * n\r\nfor i, x in enumerate(theorems):\r\n cumsum1[i] = cumsum1[i - 1] + x if i > 0 else x\r\nfor i, x in enumerate(dreams):\r\n cumsum2[i] = cumsum2[i - 1] + x if i > 0 else x\r\ncumsum1.append(0)\r\ncumsum2.append(0)\r\n\r\nres = 0\r\ns = sum(dreams)\r\nfor i in range(k - 1, n):\r\n res = max(\r\n res,\r\n s - (cumsum2[i] - cumsum2[i - k]) + (cumsum1[i] - cumsum1[i - k]))\r\n\r\nprint(res)\r\n", "import os.path\r\nimport sys\r\nfrom math import *\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ndef inp(): return sys.stdin.readline().strip()\r\n\r\nn,k=map(int,inp().split())\r\na=list(map(int,inp().split()))\r\nb=list(map(int,inp().split()))\r\nbase=0\r\nfor i in range(n):\r\n base+= a[i]*b[i]\r\n if b[i]:\r\n a[i]=0\r\ncurr=sum(a[:k])\r\nbest=curr\r\nfor i in range(k,n):\r\n curr+=a[i]\r\n curr-=a[i-k]\r\n best=max(best,curr)\r\nprint(best+base)\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\ncnt = 0\r\n\r\nfor i in range(n):\r\n if b[i]==1:\r\n cnt += a[i]\r\n a[i] = 0\r\nfor i in range(1,n):\r\n a[i] += a[i-1]\r\na.insert(0,0)\r\nmaxx = 0\r\nfor i in range(k,len(a)):\r\n maxx = max(maxx, a[i]-a[i-k])\r\nprint(maxx+cnt)", "n, k = [int(x) for x in input().split()]\nteoremas = [int(x) for x in input().split()]\nacordado = input().split()\n\nteoremasAc = [0] * (n + 1)\nteoremasWakeAc = [0] * (n + 1)\n\nfor i in range(1,n+1):\n\tteoremasAc[i] = teoremas[i-1] + teoremasAc[i-1]\n\tteoremasWakeAc[i] = teoremasWakeAc[i-1]\n\tif acordado[i-1] == \"1\":\n\t\tteoremasWakeAc[i] += teoremas[i-1]\n\ntotal = 0\n\nfor i in range(k, n+1):\t\n\ta = teoremasAc[i] - teoremasAc[i-k]\n\tb = teoremasWakeAc[i] - teoremasWakeAc[i-k]\n\tdif = a - b\n\ttotal = max(total, dif)\n\t\nprint(total+teoremasWakeAc[n])\n\n \t\t \t \t \t\t\t \t \t \t\t \t\t\t \t \t\t \t", "x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ns=0\r\nfor i in range(y):\r\n if b[i]==0:\r\n s+=a[i]\r\nk=s \r\nfor i in range(y,x):\r\n if b[i]==0:\r\n s+=a[i]\r\n if b[i-y]==0:\r\n s-=a[i-y]\r\n k=max(k,s)\r\nfor i in range(x):\r\n if b[i]==1:\r\n k+=a[i]\r\nprint(k) ", "from sys import stdin as sin\n\nn,k = map(int, sin.readline().split())\na = list(map(int, sin.readline().split(\" \")))\nx = list(map(int, sin.readline().split(\" \")))\n\nte=[]+a\nte[0]=te[0]*x[0]\nfor i in range(1,n):\n te[i]=te[i-1]+te[i]*x[i]\n\nre=[]+a\nre[-1]*=x[-1]\nfor i in range(n-2,-1,-1):\n re[i]=re[i+1]+re[i]*x[i]\n\n# print(te,re)\n\ns = sum(a[0:k])\n\nif n==k:\n print(s)\nelse:\n\n m=max(s+re[k],sum(a[n-k:n])+te[n-k-1])\n\n # print(m)\n\n for i in range(1,n-k):\n s+=(a[i+k-1]-a[i-1])\n m=max(m,te[i-1]+s+re[i+k])\n # print(m)\n # print(te,re)\n print(m)\n\n# 6 3\n# 1 3 5 2 5 4\n# 1 1 0 1 0 0\n\n# 5 3\n# 1 9999 10000 10000 10000\n# 0 0 0 0 0\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nbeh = input().split()\r\nans = 0\r\nfor i in range(n):\r\n if beh[i]==\"1\":\r\n ans += arr[i]\r\n arr[i] = 0\r\n\r\nmax_sum, cur_sum = sum(arr[:k]), sum(arr[:k])\r\ni = 0\r\nfor j in range(k, n):\r\n cur_sum += arr[j]-arr[i]\r\n i += 1\r\n max_sum = max(max_sum, cur_sum)\r\nans += max_sum\r\nprint(ans)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\nd, e, s, f = 0, 0, 0, 0\r\nfor i in range(n):\r\n if m[i]:\r\n s = s+l[i]\r\n l[i] = 0\r\n if i > k-1:\r\n e = max(e, d)\r\n d = d-l[f]\r\n f = f+1\r\n\r\n d = d+l[i]\r\n\r\nprint(s+max(d, e))\r\n", "while True:\r\n\ttry:\r\n\t\tn, k= map(int, input().split())\r\n\t\tthrm, awke = [0] *(n+1), [0]*(n+1)\r\n\t\tthrm[1:] = map(int, input().split())\r\n\t\tawke[1:] = map(int, input().split())\r\n\t\ti, s = 1, 0\r\n\t\tmaxx = -1e5\r\n\t\tslpthrm = [0]*(n+1)\r\n\t\twhile i<=n:\r\n\t\t\tslpthrm[i] = slpthrm[i-1]\r\n\t\t\tif awke[i]:\r\n\t\t\t\ts += thrm[i]\r\n\t\t\telse:\r\n\t\t\t\tslpthrm[i] += thrm[i]\r\n\t\t\ti += 1\r\n\t\t\t\r\n\t\tj = k\r\n\t\twhile j <= n:\r\n\t\t\tmaxx = max(maxx, slpthrm[j]-slpthrm[j-k])\r\n\t\t\tj += 1\r\n\t\tprint(s+maxx)\r\n\texcept EOFError:\r\n\t\tbreak", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:11/05/2020\r\n\r\n'''\r\nimport sys\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\ndef read():\r\n tc=0\r\n if tc:\r\n input=sys.stdin.readline\r\n else:\r\n sys.stdin=open('input1.txt', 'r')\r\n sys.stdout=open('output1.txt','w')\r\n\r\ndef solve():\r\n\r\n\r\n n,k=mi()\r\n a=li()\r\n b=li()\r\n x=[0]*(n+1)\r\n y=[0]*(n+1)\r\n for i in range(1,n+1):\r\n x[i]=x[i-1]+a[i-1]\r\n y[i]=y[i-1]\r\n if b[i-1]==1:\r\n y[i]+=a[i-1]\r\n\r\n \r\n ans=0\r\n # print(x)\r\n for i in range(n-k+1):\r\n s=0\r\n s+=x[i+k]-x[i]\r\n s+=(y[n]-y[k+i])\r\n s+=y[i]\r\n ans=max(s,ans)\r\n # print(s)\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n#driver code \r\nif __name__== \"__main__\":\r\n # read()\r\n solve()", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nt=[int(i) for i in input().split()]\r\nsu=0\r\nfor i in range(n):\r\n if t[i]==1:\r\n su+=a[i]\r\n a[i]=0\r\ns=0\r\nfor i in range(k):\r\n s+=a[i]\r\nm=s\r\nj=0\r\nfor i in range(k,n):\r\n s=s+a[i]-a[j]\r\n j+=1\r\n m=max(m,s)\r\nprint(su+m)", "N, k = map(int, input().split())\nA = list(map(int, input().split()))\nt = list(map(int, input().split()))\n# A = list(map(int, \"1 3 5 2 5 4\".split()))\n# t = list(map(int,\"1 1 0 1 0 0\".split()))\n# N = 6\n# k = 3\n\nprefix_sums = [A[0] if t[0] else 0]\n\nfor i in range(1, N):\n\tprefix_sums.append(prefix_sums[-1] + (A[i] if t[i] else 0))\n\ncurr_sum = ans = prefix_sums[-1]\n\nfor i in range(k):\n\tif not t[i]: \n\t\tcurr_sum += A[i]\nans = max(ans, curr_sum)\n\nfor i in range(k, N):\n\tif not t[i]:\n\t\tcurr_sum += A[i]\n\tif not t[i - k]:\n\t\tcurr_sum -= A[i - k]\n\tans = max(ans, curr_sum)\n\nprint(ans)\n", "x,y=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nr=list(map(int,input().split()))\r\nans=[sum(z[0:y])]\r\nfor i in range(1,len(z)-y+1):\r\n ans.append(ans[-1]-z[i-1]+z[i+y-1])\r\ntemp=[0]\r\nfor i in range(len(z)):\r\n if(r[i]==0):\r\n temp.append(temp[-1])\r\n else:\r\n temp.append(temp[-1]+z[i])\r\nram=[]\r\nfor i in range(len(ans)):\r\n ram.append(ans[i]+(temp[-1]-temp[i+y])+temp[i])\r\nprint(max(ram))\r\n\r\n", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nlec = list(map(int, input().split()))\r\nbeh = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if beh[i] == 1:\r\n count += lec[i]; lec[i] = 0\r\n\r\ns = sum(lec[:k]); r = s\r\nfor i in range(k, n):\r\n s = s + lec[i] - lec[i-k]\r\n if s > r:\r\n r = s\r\nprint(count + r)", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\ntemp = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if temp[i]==1:\r\n ans+=arr[i]\r\nfinal = []\r\ncnt = 0\r\nfor i in range(k):\r\n if temp[i]==0:\r\n cnt+=arr[i]\r\nfinal.append(cnt)\r\nlow,high = 1,k\r\nwhile(high<n):\r\n if temp[low-1]==0:\r\n cnt-=arr[low-1]\r\n if temp[high]==0:\r\n cnt+=arr[high]\r\n final.append(cnt)\r\n low+=1\r\n high+=1\r\nprint(ans+max(final))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n):\r\n\tif b[i]:\r\n\t\tb[i] = 0 \r\n\t\ts += a[i]\r\n\telse:\r\n\t\tb[i] = a[i]\r\n\tb[i] += b[i-1] if i != 0 else 0\r\nmx = 0\r\nfor j in range(n-k+1):\r\n\tmx = max(mx, b[j+ k-1] - b[j-1] if j != 0 else b[j+ k-1])\r\n\t\r\nprint(mx + s)\r\n", "n, k = map(int, input().split())\r\n\r\nmas1 = list(map(int, input().split()))\r\nminutes = list(map(int, input().split()))\r\n\r\nif k==n:\r\n print(sum(mas1))\r\n quit(0)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmx = 0\r\n\r\nres = 0\r\n\r\n\r\ndef myownsum(l, r, mas):\r\n sum = 0\r\n for i in range(l, r):\r\n if i<len(mas):\r\n sum+=mas[i]\r\n else:\r\n return sum\r\n return sum\r\n\r\n\r\nfor i in range(len(minutes)):\r\n if minutes[i] == 1:\r\n res += mas1[i]\r\n mas1[i] = 0\r\n#\r\n# if k+1==n:\r\n# print(1)\r\n# n1 = myownsum(0, len(minutes)-2, mas1)\r\n# n2 = myownsum(1, len(minutes)-1, mas1)\r\n# print(res+max(n1, n2))\r\n# quit(0)\r\n\r\n\r\nfst_sum = myownsum(0, k, mas1)\r\nmx = fst_sum\r\nfor i in range(1, len(minutes) - k+1):\r\n fst_sum-=mas1[i-1]\r\n fst_sum+=mas1[i+k-1]\r\n if fst_sum>mx:\r\n\r\n mx = fst_sum\r\n\r\n\r\n\r\n\r\n\r\nprint(res+mx)", "n,k = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nt = [int(i) for i in input().split()]\nmax = 0\n'''\nfor i in range(0,n-k+1):\n if t[i] == 0:\n s = 0\n for j in range(i,i+k):\n if t[j]==0:\n s+=a[j]\n #print(s)\n if max<s:\n max = s\ns = 0\nfor i in range(n-k+1,n):\n if t[i]==0:\n s+=a[i]\n#print(s)\nif max<s:\n max = s\nsum = 0\nfor i in range(0,n):\n if t[i] != 0:\n sum+=a[i]\nprint(sum+max)\n'''\nlis = []\nmax = 0\nfor i in range(0,k):\n if t[i]==0:\n max+=a[i]\nlis.append(max)\nm = max\nfor i in range(1,n-k+1):\n if t[i-1] == 0:\n max = max-a[i-1]\n if t[i+k-1] == 0:\n max = max+a[i+k-1]\n if m <max:\n m = max\n lis.append(max)\n#print(lis)\nsum = 0\nfor i in range(0,n):\n if t[i]==1:\n sum+=a[i]\nprint(sum+m)\n", "# I/O\ndef intarr():\n return map(int, input().split())\ndef intin():\n return int(input())\n\ndef solve():\n n, k = intarr()\n a = list(intarr())\n awake = list(intarr())\n\n theorem = 0\n\n for i in range(n):\n if awake[i] == 1:\n theorem += a[i]\n\n maxTheorems = 0\n cnt = 0\n\n for i in range(k):\n if awake[i] == 0:\n cnt += a[i]\n\n maxTheorems = max(maxTheorems, cnt)\n\n start = 0\n for i in range(k, n):\n if awake[i] == 0:\n cnt += a[i]\n if awake[start] == 0:\n cnt -= a[start]\n\n start += 1\n maxTheorems = max(maxTheorems, cnt)\n\n print(theorem + maxTheorems)\n\nif __name__ == \"__main__\":\n # t = intin()\n t = 1\n\n for _ in range(t):\n solve()\n\n\t \t \t\t\t\t\t \t\t\t\t \t \t \t", "n,k=input().split(\" \")\nn=int(n)\nk=int(k)\nlect=input().split(\" \")\nlect=[int(i) for i in lect]\nsleep=input().split(\" \")\nsleep=[int(i) for i in sleep]\nsleep=[0 if sleep[i]==0 else lect[i] for i in range(n)]\nfor i in range(1,n):\n sleep[i]+=sleep[i-1]\n lect[i]+=lect[i-1]\nans=0\nfor i in range(n-k+1):\n cal=lect[i+k-1]\n if i>0:\n cal-=lect[i-1]\n cal+=sleep[n-1]-sleep[i+k-1]\n if i>0:\n cal+=sleep[i-1]\n ans=max(ans,cal)\nprint(ans)\n\t \t\t \t\t \t\t\t \t\t \t\t\t \t\t \t\t", "duracao_da_palestra, tempo_acordado = map(int, input().split())\nnum_de_teoremas = list(map(int, input().split()))\ncomportamento = list(map(int, input().split()))\n \nnum_max_de_teoremas = 0\n\nfor i in range(duracao_da_palestra):\n num_max_de_teoremas += num_de_teoremas[i] * comportamento[i]\n\n if(comportamento[i] == 0):\n if(i < tempo_acordado):\n num_max_de_teoremas += num_de_teoremas[i]\n\naux, i, j = num_max_de_teoremas, 0, tempo_acordado - 1\n\nwhile j < duracao_da_palestra - 1:\n if(comportamento[j + 1] == 0):\n aux += num_de_teoremas[j + 1]\n\n if(comportamento[i] == 0):\n aux -= num_de_teoremas[i]\n \n if(aux > num_max_de_teoremas):\n num_max_de_teoremas = aux\n i += 1\n j += 1\n\nprint(num_max_de_teoremas)\n\t\t\t\t\t \t\t\t\t \t\t\t\t\t\t\t\t\t\t \t \t\t\t", "from collections import deque\r\n\r\nn,k = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\ns = []\r\nt = deque(s)\r\ns1 = 0\r\n\r\nz = 0\r\ns2 = 0\r\nfor i in range(n):\r\n\tif l2[i] == 1:\r\n\t\ts2 = s2 + l1[i]\r\nfor i in range(n):\r\n\r\n\tif l2[i] == 1:\r\n\t\tt.append(0)\r\n\t\tz +=0\r\n\telse:\r\n\t\tz = z + l1[i]\r\n\t\tt.append(l1[i])\r\n\tif len(t) > k:\r\n\t\tr = t.popleft()\r\n\t\tz = z - r\r\n\ts1 = max(s1,z)\r\n\r\nprint(s1+s2)\r\n", "n, k = map(int, input().split())\r\nlections = []\r\nfor x in map(int, input().split()):\r\n lections.append(x)\r\n\r\ntimes = list(map(int, input().split()))\r\nall_Sum = 0\r\nfor i, x in enumerate(times):\r\n if x:\r\n all_Sum += lections[i]\r\n lections[i] = 0\r\n\r\nsUm = sum(lections[:k])\r\nmaX = int(sUm)\r\nans = [0, k - 1]\r\n\r\nfor i in range(k, len(lections)):\r\n sUm += lections[i]\r\n sUm -= lections[i - k]\r\n if sUm > maX:\r\n ans = [i - k, i]\r\n maX = int(sUm)\r\nprint(maX + all_Sum)", "\r\nn,k=map(int,input().split())\r\n \r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n \r\ndp = [0]\r\nx=[0]\r\nfor i in a:\r\n x.append(x[-1]+i)\r\n \r\nfor i in range(n):\r\n dp.append(dp[-1]+a[i]*b[i])\r\nans=0\r\n \r\nfor i in range(1,n+1):\r\n c = i\r\n y = i-k\r\n y=max(y,0)\r\n ans = max(ans,x[c]-x[y]+ dp[y]+dp[n]-dp[i])\r\nprint(ans)", "n, k = [int(x) for x in input().split(\" \")]\narr_a = [int(x) for x in input().split(\" \")]\narr_t = [int(x) for x in input().split(\" \")]\n\nsum_wake = 0\nfor i in range(n):\n if arr_t[i] == 1:\n sum_wake += arr_a[i]\n arr_a[i] = 0\n\nlargest_sum = sum(arr_a[0:k])\ncurrent_sum = largest_sum\nfor j in range(k, n):\n current_sum += arr_a[j] - arr_a[j-k]\n if current_sum > largest_sum:\n largest_sum = current_sum\n\nprint (largest_sum+sum_wake)\n \n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncond = list(map(int, input().split()))\r\nawake = 0\r\nfor i in range(n):\r\n if cond[i]:\r\n awake += arr[i]\r\n arr[i] = 0\r\nsleep = sum(arr[:k])\r\nflag = sleep\r\n# sliding window\r\nfor i in range(k, n):\r\n sleep = sleep+arr[i]-arr[i-k]\r\n flag = max(flag, sleep)\r\nprint(flag + awake)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nL = lambda:list(map(int,input().split()))\r\n \r\nn,k = map(int,input().split()) # duration + time stay awake\r\n\r\nt = L() #theorems\r\n\r\nb = L() #behaviour asleep = 0\r\n\r\n\r\nextra = 0 \r\n\r\nfor i in range(n):\r\n if b[i] == 1:\r\n extra += t[i]\r\n \r\ns = extra\r\nfor i in range(k):\r\n if b[i] == 0:\r\n s += t[i]\r\n \r\nbig = s\r\n\r\nfor i in range(1,n-k + 1):\r\n if b[i-1] == 0:\r\n s -= t[i-1]\r\n if b[i+k-1] == 0:\r\n s += t[i+k-1]\r\n #print(\"t= \",t[i],t[i+1],t[i+2])\r\n #print(\"b= \",b[i],b[i+1],b[i+2])\r\n #print(\"s= \",s)\r\n big = max(big,s)\r\n \r\nprint(big)\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nt = list(map(int, input().split()))\np = 0\nfor i in range(n):\n if t[i] == 1:\n p += a[i]\n a[i] = 0\nans = s = sum(a[:k])\nfor i in range(0, n-k):\n s = s + a[i+k] - a[i]\n ans = max(ans,s)\nprint(ans + p)\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nprea=[0]*n\r\npreb=[0]*n\r\nans=0\r\nif b[0]==1:\r\n prea[0]=0\r\n preb[0]=0\r\n ans+=a[0]\r\nelse:\r\n prea[0]=a[0]\r\n preb[0]=1\r\nfor i in range(1,n):\r\n if b[i]==0:\r\n prea[i]+=prea[i-1]+a[i]\r\n preb[i]+=preb[i-1]+1\r\n else:\r\n prea[i]+=prea[i-1]\r\n preb[i]+=preb[i-1]\r\n ans+=a[i]\r\ncurr=0\r\nif preb[k-1]!=0:\r\n curr=max(curr,prea[k-1])\r\nfor i in range(k,n):\r\n if preb[i]-preb[i-k]!=0:\r\n curr=max(curr,prea[i]-prea[i-k])\r\nprint(ans+curr)", "n,k=map(int,input().split())\r\ns=input()\r\na=list(map(int,s.split()))\r\ns2=sum(a)\r\nc=[0]*(n+1)\r\ns1=input()\r\ni=list(map(int,s1.split()))\r\nfor d in range(n):\r\n c[d+1]=c[d]\r\n if i[d]==0:\r\n c[d+1]+=a[d] \r\nma=0\r\nfor j in range(n-k+1):\r\n ma=max(ma , s2 - c[j] - c[n] + c[j+k])\r\nprint(ma)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nn,k=M()\r\na=L()\r\nb=L()\r\ns=0\r\nfor i in range(n):\r\n if(b[i]==1):\r\n s+=a[i]\r\n b[i]=0\r\n else:\r\n b[i]=a[i]\r\nx=[0]\r\nfor i in range(n):\r\n x.append(b[i]+x[-1])\r\n\r\n#print(*x)\r\np=0\r\nfor i in range(k,n+1):\r\n #print(x[i]-x[i-k])\r\n p=max(p,x[i]-x[i-k])\r\nprint(s+p)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nson = list(map(int, input().split()))\r\ns = sum(a[i] * son[i] for i in range(n))\r\nans = sum(a[i] * (1 - son[i]) for i in range(k))\r\nl = ans\r\nfor i in range(1, n - k + 1):\r\n l += a[i + k - 1] * (1 - son[i + k - 1]) - a[i-1] * (1 - son[i-1])\r\n ans = max(l, ans)\r\nprint(ans + s)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\nmaxSoma, j = 0, 0\nfor i in range(n):\n maxSoma += a[i] * t[i]\n if t[i] == 0 and j < k:\n maxSoma += a[i]\n j += 1\n\nsoma, i, j = maxSoma, 0, k - 1\nwhile j < n - 1:\n if t[j + 1] == 0:\n soma += a[j + 1]\n if t[i] == 0:\n soma -= a[i]\n if soma > maxSoma:\n maxSoma = soma\n i += 1\n j += 1\nprint(maxSoma)\n \t \t\t \t \t\t \t \t \t\t\t\t \t \t", "n, k = map(int, input().split())\r\nlecture = list(map(int, input().split()))\r\nsleep = list(map(int, input().split()))\r\n\r\nstudy = 0\r\nfor i in range(len(sleep)):\r\n if sleep[i] == 1:\r\n study += lecture[i]\r\n lecture[i] = 0\r\n# Sliding Window\r\n\r\nresult = 0\r\nresult = sum(lecture[:k])\r\n\r\nscore = result\r\n\r\nfor i in range(n - k):\r\n result -= lecture[i]\r\n result += lecture[i+k]\r\n score = max(score,result)\r\n\r\nprint(study + score)\r\n\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nb = []\r\nc = []\r\nfor i in range(n):\r\n if t[i] == 0:\r\n c.append(0)\r\n b.append(a[i])\r\n else:\r\n b.append(0)\r\n \r\n c.append(a[i])\r\np = [0]\r\nfor i in range(n):\r\n p.append(p[-1] + b[i])\r\nans = -1010101010101010101011100101001\r\nfor i in range(n-k+1):\r\n if p[i+k] - p[i] > ans:\r\n ans = p[i+k] - p[i]\r\nprint(sum(c) + ans)", "p=lambda:map(int,input().split());n,k=p()\na,t,m=list(p()),list(p()),0\nfor i in range(n):\n if t[i]==1:m+=a[i];a[i]=0\nr=sum(a[:k])\nl=[r]*n\nfor j in range(1,n-k+1):\n r-=a[j-1]-a[j+k-1];l[j]=r\nprint(max(l[:n-k+1])+m)\n \t \t \t \t \t\t\t\t \t\t\t \t\t", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nb=0\r\nc=0\r\nfor i in range(k):\r\n b+=a[i]\r\n if t[i]==1:\r\n c+=a[i]\r\nidx=0\r\ncnt=b-c\r\ni=k\r\nwhile i<n:\r\n b+=a[i]\r\n b-=a[i-k]\r\n if t[i]==1:\r\n c+=a[i]\r\n if t[i-k]==1:\r\n c-=a[i-k]\r\n if b-c>cnt:\r\n idx=i-k+1\r\n cnt=b-c\r\n i+=1\r\nprint(sum([a[i] for i in range(n) if t[i]==1])+cnt)", "I=lambda:map(int,input().split());n,k=I()\r\na,t,m=list(I()),list(I()),0\r\nfor i in range(n):\r\n if t[i]==1:m+=a[i];a[i]=0\r\nr=sum(a[:k])\r\nl=[r]*n\r\nfor i in range(1,n-k+1):\r\n r-=a[i-1]-a[i+k-1];l[i]=r\r\nprint(max(l[:n-k+1])+m)", "import sys\ninput = sys.stdin.readline\n\n\ndef solve(n, k, arr, T):\n prefixSum = [0]*n\n actualSum = [0]*n\n curr = ac = 0\n for i in range(n):\n curr += arr[i]\n ac += (arr[i] * T[i])\n prefixSum[i] = curr\n actualSum[i] = ac\n\n ans = 0\n for i in range(n):\n rangeSum = prefixSum[min(i+k-1, n-1)] - prefixSum[i-1] if i > 0 else prefixSum[min(i+k-1, n-1)]\n aS = actualSum[min(i+k-1, n-1)] - actualSum[i-1] if i > 0 else actualSum[min(i+k-1, n-1)]\n ans = max(ans, actualSum[-1]-aS+rangeSum)\n print(ans)\n\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\nT = list(map(int, input().split()))\nsolve(n, k, arr, T)\n\n\n", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nt=[int(i) for i in input().split()]\r\nc=0\r\nfor i in range(n):\r\n if t[i]==1:\r\n c+=a[i]\r\n a[i]=0\r\nfor i in range(1,n):\r\n a[i]=a[i-1]+a[i]\r\nm=a[k-1]\r\nj=0\r\nfor i in range(k,n):\r\n s=a[i]-a[j]\r\n j+=1\r\n if s>m:\r\n m=s\r\nprint(c+m)", "def flip_bit(bit):\r\n return abs(bit - 1)\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a_arr = list(map(int, input().split()))\r\n t_arr = list(map(int, input().split()))\r\n pairs = list(zip(a_arr, t_arr))\r\n \r\n gain = 0\r\n for i in range(k):\r\n gain += pairs[i][0]*flip_bit(pairs[i][1])\r\n highest_gain = gain\r\n highest_gain_idx = k-1\r\n \r\n for i in range(k, n):\r\n gain += pairs[i][0]*flip_bit(pairs[i][1])\r\n gain -= pairs[i-k][0]*flip_bit(pairs[i-k][1])\r\n if gain > highest_gain:\r\n highest_gain = gain\r\n highest_gain_idx = i\r\n \r\n for i in range(highest_gain_idx - k, highest_gain_idx):\r\n t_arr[i+1] = 1\r\n \r\n ans = 0\r\n for (theorem, bit) in zip(a_arr, t_arr):\r\n ans += theorem*bit\r\n print(ans)\r\n\r\nmain()", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n t = [int(i) for i in input().split(\" \")]\r\n sums = 0\r\n for i in range(len(a)):\r\n sums += t[i] * a[i]\r\n sums_2 = 0\r\n max_sum_2 = 0\r\n counter = 0\r\n for i in range(n):\r\n sums_2 += -1 * (t[i] - 1) * a[i]\r\n if i > k - 1:\r\n sums_2 -= -1 * (t[i - k] - 1) * a[i - k]\r\n if max_sum_2 < sums_2:\r\n max_sum_2 = sums_2\r\n #print(sums_2)\r\n print(sums + max_sum_2)\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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "I = lambda: map(int, input().split())\r\n\r\nn, k = I()\r\nA, T = list(I()), list(I())\r\nB, C = [a * (1 - t) for a, t in zip(A, T)], [0] * (n - k + 1)\r\n\r\nC[0] = sum(B[:k])\r\nfor i in range(n - k):\r\n C[i+1] = C[i] - B[i] + B[i+k]\r\n\r\nprint(sum(a * t for a, t in zip(A, T)) + max(C))", "inp = lambda: map(int, input().rstrip().split())\nn, k = inp()\na = list(inp())\nt = list(inp())\nwritten = [0]\ntotal = [0]\nfor i in range(n):\n if t[i] == 1:\n written.append(written[-1] + a[i])\n else:\n written.append(written[-1])\n total.append(total[-1] + a[i])\nmaxm = 0\nfor i in range(1, n - k + 2):\n m = total[i + k - 1] - total[i - 1] + written[i - 1] + written[n] - written[i + k - 1]\n maxm = max(maxm, m)\nprint(maxm)", "import sys\r\nimport math\r\nfrom collections import Counter \r\nfrom decimal import * \r\n \r\n \r\n \r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\nalfabet_2={'1':\"a\", '2':\"b\", '3':\"c\", '4':\"d\", '5':\"e\", '6':\"f\", '7':\"g\", '8':\"h\", '9':\"i\", '10':\"j\", '11':\"k\", '12':\"l\", '13':\"m\", '14':\"n\", '15':\"o\", '16':\"p\", '17':\"q\", '18':\"r\", '19':\"s\", '20':\"t\", '21':\"u\", '22':\"v\", '23':\"w\", '24':\"x\", '25':\"y\", '26':\"z\"}\r\n \r\n \r\n \r\n \r\n \r\n#z=int(input()) \r\nfor contorr in range(1):\r\n # empty_line=input()\r\n \r\n #n=int(input())\r\n n,k=list(map(int, input().split()))\r\n #stringul=input()\r\n vector=list(map(int, input().split()))\r\n statut=list(map(int, input().split()))\r\n \r\n \r\n cate=0\r\n pierdute=0\r\n \r\n for i in range(0,k):\r\n if statut[i]==0:\r\n pierdute+=vector[i]\r\n else:\r\n cate+=vector[i]\r\n \r\n \r\n maximul=max(0,pierdute)\r\n \r\n for i in range(k,n):\r\n if statut[i]==0:\r\n pierdute+=vector[i]\r\n if statut[i-k]==0:\r\n pierdute-=vector[i-k]\r\n \r\n if statut[i]==1:\r\n cate+=vector[i]\r\n maximul=max(pierdute,maximul)\r\n \r\n \r\n print(cate+maximul) \r\n ", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef read_line():\r\n return [int(x) for x in input().split()]\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\ndef solve():\r\n n, k = read_line()\r\n a = read_line()\r\n b = read_line()\r\n\r\n res, sum = 0, 0\r\n\r\n i, j = 0, 0\r\n\r\n while j < n:\r\n if b[j] == 0:\r\n sum += a[j]\r\n \r\n if j-i+1 == k:\r\n res = max(res, sum)\r\n\r\n if b[i] == 0:\r\n sum -= a[i]\r\n \r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\n sum = 0\r\n for i in range(n):\r\n if b[i] == 1:\r\n sum += a[i] \r\n\r\n print(res + sum)\r\n\r\n# t = read_int()\r\nt = 1\r\nwhile t > 0:\r\n solve()\r\n t -= 1", "n, k = map(int, input().split())\na, t = list(map(int, input().split())), list(map(int, input().split()))\nc = sum(a[i] * (1 - t[i]) for i in range(k))\nv = c\nfor i in range(k, n):\n c += a[i] * (1 - t[i]) - a[i - k] * (1 - t[i - k])\n v = max(v, c)\nprint(sum(ai * ti for ai, ti in zip(a, t)) + v)\n \t\t \t \t\t \t \t\t \t\t\t \t\t\t\t \t", "from itertools import accumulate\r\n\r\nn, k = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\nt = list(map(int, input().split(' ')))\r\n\r\noverall = 0\r\nfor i, s in enumerate(t):\r\n if s == 1:\r\n overall += a[i]\r\n a[i] = 0\r\n\r\n#print(f'overall: {overall}')\r\n\r\npr = list(accumulate(a))\r\n\r\n#print(prefix_sum)\r\n\r\nmagic = 0\r\nfor i in range(n-1, -1, -1):\r\n start = 0 if i-k<0 else pr[i-k]\r\n magic = max(magic, pr[i] - start)\r\n\r\n\r\nprint(overall + magic)", "p=lambda:map(int,input().split());n,k=p()\na,t,m=list(p()),list(p()),0\nfor i in range(n):\n if t[i]==1:m+=a[i];a[i]=0\nr=sum(a[:k])\nl=[r]*n\nfor i in range(1,n-k+1):\n r-=a[i-1]-a[i+k-1];l[i]=r\nprint(max(l[:n-k+1])+m)\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())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n):\r\n if t[i] == 1:\r\n res += a[i]\r\n a[i] = 0\r\nfor i in range(1, n):\r\n a[i] += a[i - 1]\r\nadd = 0\r\nfor i in range(k - 1, n):\r\n add = max(add, a[i] - (a[i - k] if i >= k else 0))\r\nprint(res + add)\r\n", "n, k = map(int, input().split())\ntheorems = list(map(int, input().split()))\nis_awake = list(map(int, input().split()))\n\nans = 0\nfor i, count in enumerate(theorems):\n if is_awake[i]: ans += count\nfor i in range(k):\n if not is_awake[i]: ans += theorems[i]\nfinal_ans = ans\n\ni = 0\nj = k - 1\nwhile j < n - 1:\n if not is_awake[i]: ans -= theorems[i]\n i += 1\n j += 1\n if not is_awake[j]: ans += theorems[j]\n final_ans = max(ans, final_ans)\n\nprint(final_ans)\n\n\n \t\t \t\t \t \t\t\t \t\t \t\t \t \t\t", "n, k = list(map(int, input().strip().split()))\na = list(map(int, input().strip().split()))\nt = list(map(int, input().strip().split()))\n\nsumm = 0\ncount = []\ncur = 0\nfor i in range(n):\n if t[i] == 1:\n summ += a[i]\n else:\n cur += a[i]\n count.append(cur)\nmmax = 0\nfor i in range(n):\n if i + k - 1 >= n:\n continue\n cur = count[i+k-1] - count[i]\n if t[i] == 0:\n cur += a[i]\n mmax = max(cur, mmax)\n\nprint(mmax + summ)\n \t \t\t\t\t \t \t \t\t \t\t \t \t \t \t", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nval=0\r\nfor i in range(k):\r\n if(b[i]==0):\r\n val+=a[i]\r\nans=val\r\n# print(\"val\",val)\r\nfor i in range(1,n-k+1):\r\n if(b[i-1]==0):\r\n val-=a[i-1]\r\n if(b[i+k-1]==0):\r\n val+=a[i+k-1]\r\n # print(\"val\",val,i)\r\n ans=max(ans,val)\r\nval=0\r\nfor i in range(n):\r\n if(b[i]==1):\r\n val+=a[i]\r\nprint(ans+val)\r\n\r\n", "entrada = list(map(int,input().split()))\naula = list(map(int,input().split()))\nsono = list(map(int,input().split()))\n\nvalor2 = entrada[1]\nsoma = 0\nsoma1 = 0\nlistaAuxiliar = [0]*(entrada[0]+1)\n\n\nfor i in range(int(entrada[0])):\n\tif(sono[i] == 1):\n\t\tsoma1 += int(aula[i])\n\t\taula[i] = 0\n\nfor i in range(1,entrada[0]+1):\n listaAuxiliar[i] = listaAuxiliar[i-1] + aula[i-1]\n\ncontador = valor2\n\nfor i in range(len(listaAuxiliar)-valor2):\n soma = max((listaAuxiliar[contador]) - listaAuxiliar[i],soma)\n contador += 1\n\nprint(soma + soma1)\n\t\t\t\t\t \t \t\t \t \t \t\t\t \t\t", "from itertools import*\nR=lambda:map(int,input().split())\nn,k=R()\na=list(zip(R(),R()))\nprint(sum(x*y for x,y in a)+max(accumulate(x-x*y-u+u*v\nfor(u,v),(x,y)in zip([(0,0)]*k+a,a))))\n \t \t\t \t \t\t\t\t \t\t\t \t\t", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nans=0\r\nans1=[]\r\nfor i in range(k):\r\n c.append(a[i])\r\n if b[i]==0:\r\n ans+=a[i]\r\nm=0\r\nfor i in range(k,n):\r\n ans1.append(ans)\r\n c[m]=0\r\n if b[m]==0:\r\n ans-=a[m]\r\n m+=1\r\n c.append(a[i])\r\n if b[i]==0:\r\n ans+=a[i]\r\nans1.append(ans)\r\nans2=0\r\nfor i in range(n):\r\n if b[i]==1:\r\n ans2+=a[i]\r\nx=max(ans1)\r\nprint(x+ans2)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nlast = 0\r\nfor i in range(k):\r\n if t[i] == 0:\r\n last += a[i]\r\n\r\nans = last\r\n\r\nfor i in range(k, n):\r\n if t[i - k] == 0:\r\n last -= a[i - k]\r\n if t[i] == 0:\r\n last += a[i]\r\n ans = max(last, ans)\r\n\r\nprint(ans + sum(map(lambda o: a[o] * t[o], range(n))))\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nret = 0\r\n\r\nfor i, v in enumerate(map(int, input().split())):\r\n if v:\r\n ret += a[i]\r\n a[i] = 0\r\n\r\ncur = sum(a[:k - 1]) + a[-1]\r\nmaxx = 0\r\nfor i in range(n - k + 1):\r\n cur -= a[i - 1]\r\n cur += a[i + k - 1]\r\n maxx = max(maxx, cur)\r\n\r\nprint(ret + maxx)", "\r\nn, k = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\nsleep = list(map(int, input().split()))\r\n\r\n\r\ntemp = 0\r\nfor i in range(n):\r\n if sleep[i] == 1:\r\n temp += arr[i]\r\n arr[i] = 0\r\n\r\nprefixSum = [0]\r\nfor i in range(n):\r\n prefixSum.append(prefixSum[-1] + arr[i])\r\n\r\nmx = 0\r\nmx = 0\r\nfor i in range(k, len(prefixSum)):\r\n mx = max(mx, prefixSum[i] - prefixSum[i-k])\r\n\r\nprint(temp + mx)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\ns=0;s1=0;m=0\r\ni=0;j=0\r\nwhile(i<a):\r\n while(j-i!=b and j<a):\r\n if d[j]:s1+=c[j]\r\n else:s+=c[j]\r\n j+=1\r\n m=max(m,s)\r\n if d[i]==0:s-=c[i]\r\n i+=1\r\nprint(m+s1)", "import random\r\nimport math\r\nfrom collections import defaultdict\r\nimport itertools\r\nfrom sys import stdin, stdout\r\nimport operator\r\n\r\n\r\ndef main():\r\n z = ''\r\n #p = lambda *a: print(*a, flush = True)\r\n d = defaultdict()\r\n #for _ in range(int(stdin.readline())):\r\n n, k = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n t = list(map(int, input().split()))\r\n\r\n initial_sum = sum(a[:k])\r\n\r\n all_sum = [0]\r\n for i in range(n):\r\n if t[i] == 1:\r\n all_sum.append(all_sum[-1]+a[i])\r\n else:\r\n all_sum.append(all_sum[-1])\r\n\r\n m= all_sum[-1]\r\n\r\n for i in range(n-k+1):\r\n t_sum = all_sum[i] + initial_sum + all_sum[-1]-all_sum[i+k]\r\n m = max(m, t_sum)\r\n if i+k<n:\r\n initial_sum = initial_sum - a[i]+a[i+k]\r\n print(m)\r\n\r\n\r\n\r\n # z += str(ans) + '\\n'\r\n # stdout.write(z)\r\n\r\n#for interactive problems\r\n#print(\"? {} {}\".format(l,m), flush=True)\r\n#or print this after each print statement\r\n#sys.stdout.flush()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#!/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 t = list(map(int, input().split()))\r\n\r\n pref = [0 for _ in range(n+1)]\r\n prefa = [0 for _ in range(n+1)]\r\n for i in range(1, n+1):\r\n pref[i] = pref[i-1] + a[i-1]\r\n prefa[i] = prefa[i-1] + (a[i-1] if t[i-1] else 0)\r\n# print(pref)\r\n# print(prefa)\r\n\r\n ans = 0\r\n for i in range(1, n+1):\r\n if i+k-1 > n: break\r\n ans = max(ans, pref[i+k-1]-pref[i-1] + prefa[i-1]+prefa[n]-prefa[i+k-1])\r\n print(ans)\r\n\r\n\r\n \r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nflipped_t = [1 - number for number in t]\r\n\r\noriginal_total = sum(a[index] * t[index] for index in range(n))\r\nsums = [sum(a[index] * flipped_t[index] for index in range(k))]\r\n\r\nfor index in range(1, n - k + 1):\r\n current_change = sums[index - 1] - a[index - 1] * flipped_t[index - 1] + a[index + k - 1] * flipped_t[index + k - 1]\r\n sums.append(current_change)\r\n\r\nprint(original_total + max(sums))", "n,k = map(int , input().split())\r\n\r\na = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\n\r\ns = 0\r\nfor i in range(n):\r\n if b[i] == 1:\r\n s+=a[i]\r\nsum = s\r\nmaxi = 0\r\ns = 0\r\ni = 0\r\nj = 0\r\n# print(maxi)\r\nwhile j<k:\r\n if b[j] == 0:\r\n s = s + a[j]\r\n j+=1\r\nmaxi = sum + s\r\nj-=1\r\n# print(maxi)\r\nwhile j+1<n:\r\n if b[i] == 0:\r\n s-=a[i]\r\n i+=1\r\n j+=1\r\n if b[j] == 0:\r\n s+=a[j]\r\n # print(i,j,s+sum)\r\n maxi = max(maxi , s + sum)\r\n\r\nprint(maxi)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nt=[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(n):\r\n if(t[i]==1):\r\n s+=l[i]\r\n l[i]=0\r\npref=[sum(l[:k])]\r\nfor i in range(k,n):\r\n pref.append(pref[i-k]-l[i-k]+l[i])\r\nprint(s+max(pref))", "duration, minMinuite = map(int, input().split())\r\ntheorems = list(map(int, input().split()))\r\nminute = list(map(int, input().split()))\r\n\r\n# total wake up time\r\nwakeupTime = 0\r\nfor i in range(duration):\r\n if minute[i] == 1:\r\n wakeupTime += theorems[i]\r\n\r\n# current straight wake up time\r\ncurrWakeup = 0\r\nfor i in range(minMinuite):\r\n if minute[i] == 0:\r\n currWakeup += theorems[i]\r\n\r\n# maximum wake up time\r\nmaxWake = wakeupTime + currWakeup\r\ni = 0\r\nfor j in range(minMinuite, duration):\r\n \r\n if minute[i] == 0:\r\n currWakeup -= theorems[i]\r\n if minute[j] == 0:\r\n currWakeup += theorems[j]\r\n maxWake = max(maxWake, wakeupTime + currWakeup)\r\n i += 1\r\n j += 1\r\n\r\nprint(maxWake)\r\n", "n,k=list(map(int,input().split()))\r\nnote=list(map(int,input().split()))\r\ncode=list(map(int,input().split()))\r\nleft_ptr=0\r\nright_ptr=k\r\nzeros=0\r\nanswer=0\r\nfor i in range(k):\r\n if code[i]==0:\r\n zeros += note[i]\r\nanswer=zeros\r\nwhile right_ptr < n:\r\n if code[right_ptr]==0:\r\n zeros+=note[right_ptr]\r\n if code[left_ptr]==0:\r\n zeros-=note[left_ptr]\r\n answer=max(zeros,answer)\r\n right_ptr+=1\r\n left_ptr+=1\r\nfor i in range(len(note)):\r\n if code[i]==1:\r\n answer+=note[i]\r\nprint(answer)\r\n \r\n \r\n \r\n \r\n \r\n ", "#!/bin/python3\n\ndef LectureSleep(k, n, theorems, behavior):\n # 1 <= k <= n\n if k == n:\n print(sum(theorems))\n return\n awakeSum = 0 \n for i in range(n):\n awakeSum += theorems[i]*behavior[i]\n sleepSum = 0\n for i in range(k):\n sleepSum += theorems[i]*(1-behavior[i])\n maxSleepSum = sleepSum\n for i in range(1, n-(k-1)):\n sleepSum = sleepSum - theorems[i-1]*(1-behavior[i-1]) + theorems[i+k-1]*(1-behavior[i+k-1])\n if sleepSum > maxSleepSum:\n maxSleepSum = sleepSum\n print(awakeSum + maxSleepSum)\n\nn, k = input().split()\narr = input().split()\narr2 = input().split()\narr = [int(i) for i in arr]\narr2 = [int(i) for i in arr2]\n\nLectureSleep(int(k) , int(n), arr, arr2)\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, k = map(int, input().split())\r\n a = [int(a) for a in input().split()]\r\n b = [int(a) for a in input().split()]\r\n ans = 0\r\n for i in range(n):\r\n if b[i]:\r\n ans += a[i]\r\n pre = [0 for i in range(n)]\r\n if not b[0]:\r\n pre[0] = a[0]\r\n for i in range(1, n):\r\n pre[i] = pre[i - 1]\r\n if not b[i]:\r\n pre[i] += a[i]\r\n temp = 0\r\n for l in range(n - k + 1):\r\n if l == 0:\r\n temp = max(temp, pre[k - 1])\r\n else:\r\n temp = max(temp, pre[l + k - 1] - pre[l - 1])\r\n print(ans + temp)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nsumm=0\r\nfor i in range(len(a)):\r\n if b[i]==1:\r\n summ+=a[i]\r\n a[i]=0\r\nfor i in range(1,len(a)):\r\n a[i]+=a[i-1]\r\na.insert(0,0)\r\nmaxx=0\r\nfor i in range(d,len(a)):\r\n maxx=max(maxx,a[i]-a[i-d])\r\nprint(maxx+summ)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(n):\r\n if t[i]==1:\r\n cnt+=a[i]\r\nans=0\r\nfor i in range(k):\r\n if t[i]==0:\r\n ans+=a[i]\r\nsu=ans\r\nfor i in range(1,n-k+1):\r\n ans=ans-(not t[i-1])*a[i-1]+(not t[i+k-1])*a[i+k-1]\r\n su=max(su,ans)\r\nprint(cnt+su)\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\n\nn,k = map(int,input().split())\narr = list(map(int,input().split()))\nsleep = list(map(int,input().split()))\npre = [0 for i in range(n+1)]\none = 0\nfor i in range(n):\n if sleep[i] == 1:\n one+=arr[i]\n arr[i] = 0\nfor i in range(0,n):\n pre[i] = arr[i]+pre[i-1]\nstart = None\nm = 0\nfor i in range(n):\n if sleep[i] == 0:\n x = n-1 if (i+k-1)>=n else i+k-1\n val = (pre[x]-pre[i-1])\n if val>m:\n m = val\n start = i\nprint(m+one)\n", "n,k=map(int,input().split())\r\n# s=(input().strip())\r\n# t=(input().strip())\r\nval=list(map(int,input().split()))\r\n# s=list(map(int,input()))\r\nbi=list(map(int,input().split()))\r\ni=0;j=0;ans=0;mx=-1\r\nwhile j<n:\r\n if bi[j]==0:\r\n ans+=val[j]\r\n if j-i+1<k:\r\n j+=1\r\n elif j-i+1==k:\r\n mx=max(mx,ans)\r\n if bi[i]==0:\r\n ans-=val[i]\r\n i+=1\r\n j+=1\r\nif mx==-1:mx=0\r\nfor i in range(n):\r\n if bi[i]==1:\r\n mx+=val[i]\r\nprint(mx)", "n,k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\ntotal = sum(a)\r\n\r\nprefixSum = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n prefixSum[i+1] = prefixSum[i]\r\n if(b[i] == 0):\r\n prefixSum[i+1] += a[i]\r\n\r\nanswer = 0\r\nfor i in range(n - k +1):\r\n answer = max(answer , total - prefixSum[i] - prefixSum[n] + prefixSum[i+k])\r\n\r\nprint(answer) \r\n#6 3\r\n#1 3 5 2 5 4\r\n#1 1 0 1 0 0\r\n", "from sys import stdin\r\ninput=lambda : stdin.readline()\r\nfrom math import ceil,sqrt,gcd\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nz=[0]\r\nsu=0\r\nans=0\r\nx=[]\r\nfor i in range(n):\r\n\tif b[i]==1:\r\n\t\tans+=a[i]\r\n\telse:\r\n\t\tsu+=a[i]\r\n\tz.append(su)\r\nfor i in range(len(z)):\r\n\tif i+k<len(z):\r\n\t\tx.append(ans+z[i+k]-z[i])\r\n# print(x)\r\nprint(max(x))\r\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\nn,k=li()\r\n\r\na=li()\r\n\r\nb=li()\r\n\r\npre=[0]\r\n\r\nres=0\r\n\r\nfor i in range(n):\r\n if b[i]==0:\r\n pre.append(pre[-1]+a[i])\r\n else:\r\n pre.append(pre[-1])\r\n if i+1>=k:\r\n res=max(res,pre[i+1]-pre[i+1-k])\r\n#print(pre)\r\nprint(res+sum(a[i] for i in range(n) if b[i]==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,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\ndp = [0 for i in range(n+1)]\r\ntotal = 0\r\n\r\nfor i in range(1,n+1):\r\n total += t[i-1]*a[i-1]\r\n dp[i] = dp[i-1]+a[i-1]*(1-t[i-1])\r\n\r\nans = 0 \r\n\r\nfor i in range(1,n-k+2):\r\n ans = max(ans,total+dp[i+k-1]-dp[i-1])\r\nprint(ans)", "def funcao(teoremas, comp, k):\n maior = 0\n\n soma = 0\n i = 0\n while i < k: \n if comp[i] == '0':\n soma += teoremas[i]\n i += 1\n maior = soma\n \n i = k\n while i < len(teoremas):\n if comp[i - k] == '0':\n soma -= teoremas[i - k]\n if comp[i] == '0':\n soma += teoremas[i]\n maior = max(maior, soma)\n i += 1\n \n return maior\n\nk = int(input().split()[1])\nteoremas = list(map(int, input().split()))\ncomp = input().split()\n\nsoma = 0\ni = 0\nwhile i < len(teoremas):\n if comp[i] == \"1\":\n soma += teoremas[i]\n i += 1\n \nprint(funcao(teoremas, comp, k) + soma) \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())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nmx = 0\r\nfor x in range(0, k):\r\n if l2[x] == 0:\r\n mx += l1[x]\r\ns = mx\r\nfor i in range(1, n - k + 1):\r\n if l2[i + k - 1] == 0:\r\n s += l1[i + k - 1]\r\n if l2[i - 1] == 0:\r\n s -= l1[i - 1]\r\n mx = max(mx, s)\r\nfor y in range(n):\r\n if l2[y] == 1:\r\n mx += l1[y]\r\nprint(mx)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nthms = list(map(int, input().split()))\r\nsleep = list(map(int, input().split()))\r\n\r\ntot = sum([thms[i] for i in range(n) if sleep[i]])\r\n\r\n# k-len sliding window\r\ncurrsum = 0\r\nfor i in range(k):\r\n currsum += thms[i] if not sleep[i] else 0\r\nstart = 1\r\nmaxthms = currsum\r\ndebug = [currsum]\r\n\r\nwhile start <= n-k:\r\n currsum += thms[start+k-1] if not sleep[start+k-1] else 0\r\n currsum -= thms[start-1] if not sleep[start-1] else 0\r\n maxthms = max(maxthms, currsum)\r\n debug.append(currsum)\r\n start += 1\r\n\r\nprint(maxthms + tot)\r\n", "n, k = map(int, input().split())\nthm_count = list(map(int, input().split()))\nis_awake = list(map(int, input().split()))\nreal_prefixes = []\nreal_sum = 0\nno_sleep_prefixes = []\nno_sleep_sum = 0\nfor i in range(n):\n if is_awake[i] == 1:\n real_sum += thm_count[i]\n real_prefixes.append(real_sum)\n no_sleep_sum += thm_count[i]\n no_sleep_prefixes.append(no_sleep_sum)\n\nmax_thms = -1\nfor i in range(n - k + 1):\n res = real_prefixes[i - 1] if i > 0 else 0\n res += no_sleep_prefixes[i + k - 1]\n res -= no_sleep_prefixes[i - 1] if i > 0 else 0\n res += real_prefixes[n - 1]\n res -= real_prefixes[i + k - 1]\n # print(res)\n max_thms = max(max_thms, res)\nprint(max_thms)\n", "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,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\ntemp=[]\r\nfor i in range(n):\r\n if t[i]==1:\r\n temp.append(0)\r\n else:\r\n temp.append(a[i])\r\n#print(temp)\r\nsupple=sum(temp[:k])\r\nmx=supple\r\n#print(mx,\"mx\")\r\nfor i in range(k,n):\r\n supple=supple-(temp[i-k]) + temp[i]\r\n #print(supple,\"inlien\")\r\n if supple > mx:\r\n mx=supple\r\n \r\n#print(mx) \r\n \r\nans =0\r\nfor i in range(n):\r\n if t[i]==1:\r\n ans+=a[i]\r\nprint(ans +mx)\r\n\r\n", "n,k = map(int, input().split())\ntheorems = [int(i) for i in input().split()]\nwake = [int(i) for i in input().split()]\nacu = 0\nfor i in range(n):\n if wake[i] == 1:\n acu += theorems[i]\n elif i < k:\n acu += theorems[i]\n\nans = acu\nj = k\nans = acu \n\nfor i in range(n-k):\n if wake[i] == 0:\n acu -= theorems[i]\n if wake[j] == 0:\n acu += theorems[j]\n ans = max(ans,acu)\n j += 1\n\nprint(ans)\n \t \t\t \t\t \t\t\t\t \t \t \t \t \t", "n,k = map(int,input().split())\nl1 = list(map(int,input().split()))\nl2 = list(map(int,input().split()))\ni = 0\nj = 0\nsm = 0\nmx = 0 \nout = 0\nfor a in range(n):\n out += l1[a]*l2[a]\nwhile i < n :\n while i-j < k :\n if(l2[i] == 0) :\n sm += l1[i]\n i += 1\n mx = max(mx,sm)\n if l2[j] == 0 :\n sm -= l1[j]\n j += 1\nprint (out + mx)\n \t\t \t \t\t \t\t\t \t\t \t \t", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\npre1 = [0 for _ in range(n+1)]\r\npre2 = [0 for _ in range(n+1)]\r\n\r\nfor i in range(n):\r\n pre1[i+1] = pre1[i] + arr[i]\r\n pre2[i+1] = pre2[i] + arr[i] * int(t[i] == 1)\r\n\r\nans = 0\r\nfor i in range(n-k+1):\r\n a = pre2[i] + pre2[n] - pre2[i+k]\r\n b = pre1[i+k] - pre1[i]\r\n ans = max(ans, a+b)\r\n \r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nt = [int(i) for i in input().split()]\r\nsuffixSum = [0] * n\r\nsuffixSum[n - 1] = a[n - 1]\r\nsumWithoutTech = [0] * n\r\nsumWithoutTech[n - 1] = a[n - 1] if t[n - 1] == 1 else 0\r\nfor i in range(n - 2, -1, -1) :\r\n suffixSum[i] = suffixSum[i + 1] + a[i]\r\n if t[i] == 1:\r\n sumWithoutTech[i] = sumWithoutTech[i + 1] + a[i]\r\n else :\r\n sumWithoutTech[i] = sumWithoutTech[i + 1]\r\nmaxT = 0\r\ncurr = 0\r\nfor i in range(0, n - k + 1) :\r\n b = curr + suffixSum[i] - (suffixSum[i + k] if i + k < n else 0) + (sumWithoutTech[i + k] if i + k < n else 0)\r\n maxT = max(maxT, b)\r\n if t[i] == 1 :\r\n curr += a[i]\r\nprint(maxT)\r\n", "n, k = map(int, input().split())\r\nar = list(map(int, input().split()))\r\nbs = list(map(int, input().split()))\r\npref = [ar[0] if not bs[0] else 0]\r\nfor i in range(1, n):\r\n pref.append(pref[-1] + ar[i] if not bs[i] else pref[-1])\r\ns = sum([ar[i] if bs[i] else 0 for i in range(n)])\r\nmx = 0\r\npref = [0] + pref\r\nfor i in range(n - k + 1):\r\n mx = max(mx, pref[i + k] - pref[i])\r\nprint(mx + s)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\ns = 0\r\npi = [0] * n\r\nfor i in range(n):\r\n if i:\r\n pi[i] += pi[i - 1]\r\n if t[i] == 1:\r\n s += a[i]\r\n else:\r\n pi[i] += a[i]\r\nadd = 0\r\nfor i in range(n):\r\n res=0\r\n if i >= k:\r\n res=pi[i - k]\r\n else:\r\n res=0\r\n add = max(add,pi[i]- res)\r\nprint(s + add)# 1690905047.6088572", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nres=0\r\nfor i in range(n):\r\n if l[i]==1:\r\n res+=a[i]\r\n a[i]=0\r\ntot=sum(a[:k])\r\nmaxi=tot\r\nfor i in range(n-k):\r\n tot-=a[i]\r\n tot+=a[i+k]\r\n maxi=max(maxi,tot)\r\nprint(res+maxi)", "#\t!/bin/env python3\r\n#\tcoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/961/B\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef main():\r\n n, k = get_ints()\r\n arr = get_array()\r\n awake = get_array()\r\n prefix_sum = [0]*(n+1)\r\n ans = 0\r\n for i in range(1, n+1):\r\n prefix_sum[i] += prefix_sum[i-1]\r\n if awake[i-1] == 0:\r\n prefix_sum[i] += arr[i-1]\r\n else:\r\n ans += arr[i-1]\r\n add = 0\r\n for i in range(k, n+1):\r\n x = prefix_sum[i]-prefix_sum[i-k]\r\n add = max(add, x)\r\n print(ans+add)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(n):\r\n if t[i]:\r\n res += a[i]\r\n a[i] = 0\r\n\r\ncs = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n cs[i] = a[i - 1] + cs[i - 1]\r\n\r\ntmp = 0\r\nfor i in range(n, m - 1, -1):\r\n tmp = max(tmp, cs[i] - cs[i - m])\r\n\r\nprint(res + tmp)\r\n", "import sys\r\nfrom itertools import accumulate\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(n):\r\n if t[i]:\r\n res += a[i]\r\n a[i] = 0\r\na = [0] + list(accumulate(a))\r\nans = res\r\nfor i in range(1, n - k + 2):\r\n ans = max(ans, res + a[i+k-1] - a[i-1])\r\nprint(ans)\r\n" ]

[ "n, c = map(int, input().split())\r\nmod = 10 ** 6 +3\r\ninv = [0, 1]\r\nfor i in range(2, max(n, c) + 1):\r\n inv.append(inv[mod % i] * (mod - mod // i) % mod)\r\nans = 1\r\nfor i in range(1, n + c + 1):\r\n ans = ans * i % mod\r\nfor i in range(1, c + 1):\r\n ans = ans * inv[i] % mod\r\nfor i in range(1, n + 1):\r\n ans = ans * inv[i] % mod\r\nans += mod - 1\r\nans %= mod\r\nprint(ans)\r\n\r\n", "result=0\r\nmod=10**6 +3\r\nn,C=map(int,input().split()) #recibimos la entrada \r\n#calc n!\r\ndef fact(n):\r\n fact=1\r\n for i in range(1,n+1): #1*2*3*...*n = n*(n-1)*(n-2)...*1\r\n fact=(fact*i)%mod #\r\n return fact\r\n\r\ndef pow(a,b): #Algoritmo de Exponenciacion binaria\r\n exp=1 # Caso base a^1=a\r\n x=a % mod\r\n while b > 0: \r\n if b % 2 == 1:# En caso que b sea impar\r\n exp=(exp*x)%mod\r\n # En caso que b sea impar\r\n x=(x*x)%mod\r\n b=b//2\r\n return exp \r\n\r\n#cacl (n+C)!/(n!*C!) , usamos el pequenno teorema de Fermat a^{p-1}congruente 1(p) a^{p-2}congruente a^{-1}(p)\r\n# de esta forma en vez de 1/n! y 1/C! usamos n!**p-2 C!**p-2 en este caso p=mod \r\nresult=fact(n+C)*pow(fact(n),mod-2)*pow(fact(C),mod-2)-1 # C(n+C,C)= n+C!\r\n\r\nprint(int(result%mod))", "result=0 # variable que va a guardar el resultado del problema\r\nmod=10**6 +3 # la respuesta se debe dar modulo este numero\r\nn,C=map(int,input().split()) #recibimos la entrada \r\n#calc n!\r\ndef fact(n): # calcular el factorial de n modulo mod\r\n fact=1\r\n for i in range(1,n+1): #1*2*3*...*n = n*(n-1)*(n-2)...*1\r\n fact=(fact*i)%mod # cada vez que multiplicamos lo hacemos modulo mod \r\n return fact #devolvemos factorial de n\r\n\r\ndef pow(a,b): #Algoritmo de Exponenciacion binaria modular\r\n exp=1 # Caso base a^1=a\r\n x=a % mod # dado que el a de entrada puede ser bastante grande y la respuesta se debe dar modulo mod hacemos a modulo mod\r\n b=b%(mod-1) # # como mod es primo para a^b % p hacemos a^{b%(p-1)} %p \r\n while b > 0: \r\n if b % 2 == 1:# En caso que b sea impar\r\n exp=(exp*x)%mod\r\n \r\n x=(x*x)%mod \r\n b=b//2\r\n return exp \r\n\r\n#cacl (n+C)!/(n!*C!) , usamos el peque{~}no teorema de Fermat a^{p-1}congruente 1(p) a^{p-2}congruente a^{-1}(p)\r\n# de esta forma en vez de 1/n! modulo p y 1/C! modulo p usamos n!**p-2 modulo mod y C!**p-2 modulo p en este caso p=mod \r\nresult=fact(n+C)*pow(fact(n),mod-2)*pow(fact(C),mod-2)-1 # C(n+C,C)= n+C!\r\n\r\nprint(int(result%mod)) # imprimimos la salida del problema", "import math\r\nimport operator as op\r\n\r\nfrom functools import reduce\r\n\r\nfrom operator import mul # or mul=lambda x,y:x*y\r\nfrom fractions import Fraction\r\n\r\ndef nCk(n,k): \r\n return int( reduce(mul, (Fraction(n-i, i+1) for i in range(k)), 1) )\r\n\r\n\r\ndef ncr(n, r):\r\n r = min(r, n-r)\r\n if r == 0: return 1\r\n numer = reduce(op.mul, range(n, n-r, -1))\r\n denom = reduce(op.mul, range(1, r+1))\r\n return numer//denom\r\n\r\ndef modPow(a, x, p):\r\n #calculates a^x mod p in logarithmic time.\r\n res = 1\r\n while(x > 0):\r\n if( x % 2 != 0):\r\n res = (res * a) % p\r\n \r\n a = (a * a) % p\r\n x = int(x/2)\r\n return res\r\n\r\ndef modInverse(a, p):\r\n #calculates the modular multiplicative of a mod m.\r\n #(assuming p is prime).\r\n return modPow(a, p-2, p)\r\n\r\ndef modBinomial(n, k, p):\r\n #calculates C(n,k) mod p (assuming p is prime).\r\n\r\n # n * (n-1) * ... * (n-k+1)\r\n numerator = 1 \r\n for i in range(k):\r\n numerator = (numerator * (n-i) ) % p\r\n\r\n denominator = 1\r\n for i in range(1, k+1):\r\n denominator = (denominator * i) % p\r\n\r\n # numerator / denominator mod p.\r\n return ( numerator* modInverse(denominator,p) ) % p\r\n\r\n\r\nn, c = input().split()\r\nn = int(n)\r\nc = int(c)\r\n\r\n#test = [0 for x in range (n+1)]\r\n#test[1] = c\r\n\r\n#for i in range(2, n+1):\r\n# test[i] = (test[i-1] + modBinomial((i+c-1),i, 1000003))%1000003\r\n\r\n#ans = solve(n, c)\r\n#ans =test[n]\r\nans = modBinomial((c+n),c,1000003) - 1\r\nprint(int(ans))\r\n", "import math \r\nm = int(1e6 + 3)\r\na,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nA = 1\r\nB = 1\r\nfor i in range(2,a + b + 1):\r\n A=(A*i)%m\r\n if i<=a:\r\n B=(B*i)%m\r\n if i<=b:\r\n B=(B*i)%m\r\nprint((A*pow(B,m-2,m)-1)%m)", "M = pow(10,6) + 3 \r\n\r\ndef wall(n,c):\r\n fact = factorial(n+c)\r\n _,inv_n,_ = extended_euclidean_alg_1(fact[n],M)\r\n _,inv_c,_ = extended_euclidean_alg_1(fact[c],M)\r\n return (((((fact[n+c] * (inv_n % M)) % M) * (inv_c % M)) % M) - 1)% M\r\n\r\ndef factorial(m):\r\n facts = [1 for _ in range(m+1)]\r\n for n in range(1,m+1):\r\n facts[n] = (facts[n-1] * n) % M\r\n return facts\r\n\r\ndef extended_euclidean_alg_1(a,b):\r\n if not b:\r\n return 0,1,0\r\n \r\n u0,u1 = 1,0\r\n v0,v1 = 0,1\r\n \r\n while b:\r\n q = a//b\r\n r = a - b * q\r\n u = u0 - q * u1\r\n v = v0 - q * v1\r\n #Update a,b\r\n a = b\r\n b = r\r\n #Update for next iteration\r\n u0 = u1\r\n u1 = u\r\n v0 = v1\r\n v1 = v\r\n \r\n return a, u0, v0\r\n\r\ndef main():\r\n n,c = [int(i) for i in input().split()]\r\n count = wall(n,c)\r\n print(int(count))\r\n\r\nmain()", "\ndef fact(n, mod):\n '''\n Calcula el factorial de n modulo mod\n :param n: int\n :param mod: int\n :return: int\n '''\n ans = 1\n for i in range(1, n + 1):\n ans = ans * i % mod\n return ans\n\ndef inv1(n, mod):\n '''\n Calcula el inverso de n modulo mod usando el pequenno teorema de fermat\n :param n:\n :param mod:\n :return:\n '''\n ans = 1\n for i in range(mod - 2):\n ans = ans * n % mod\n return ans\n\ndef inv2(n, mod):\n '''\n Calcula el inverso de n modulo mod usando el pequenno teorema de fermat\n y la funcion pow del sistema\n :param n:\n :param mod:\n :return:\n '''\n return pow(n, mod - 2, mod)\n\n\n\nmod = 1000003\nn, c = [int(i) for i in input().split()]\n\na = fact(n + c, mod)\nb = fact(n, mod)\nc = fact(c, mod)\n\nb = inv1(b, mod)\nc = inv2(c, mod)\n\nans = a * b % mod * c % mod\nans -= 1\nif ans < 0: ans += mod\n\nprint(ans)", "result=0\r\nmod=10**6 +3\r\nn,C=map(int,input().split())\r\ndef fact(n):\r\n fact=1\r\n for i in range(1,n+1):\r\n fact=(fact*i)%mod\r\n return fact\r\n\r\ndef pow(a,b):\r\n p=1\r\n for i in range(b):\r\n p=(a*p)% mod\r\n return p\r\n\r\n\r\nresult=fact(n+C)*pow(fact(n),mod-2)*pow(fact(C),mod-2)-1\r\n\r\nprint(int(result%mod))", "import sys\n#with open(filename, 'r') as f:\nwith sys.stdin as f:\n n, C = f.readline().split(\" \")\n n, C = int(n), int(C)\np = 1000003\n\ndef compute_mod_fact(n, p):\n # n! (mod p)\n res = 1\n for i in range(1, n+1):\n res = (res * i) % p\n return res\ndef compute_mod_mult(n, a, p):\n # n**a (mod p)\n res = 1\n for _ in range(a):\n res = (res * n) % p\n return res\nres = compute_mod_fact(n+C, p)\nres1 = compute_mod_fact(n, p)\nres1 = compute_mod_mult(res1, p-2, p)\nres2 = compute_mod_fact(C, p)\nres2 = compute_mod_mult(res2, p-2, p)\n#print(res, res1, res2)\nres = (res * res1 * res2 - 1) % p \nprint(res)", "import sys \r\n\r\nMOD = 10**6+3 # el modulo que es un numero primo \r\nfact = [1] * (7* 10**5 + 10) #un array de tamano 7* 10**5 + 10 para guaradar los valores del factorial precalculado \r\n\r\n# para calcular el factorial modulo MOD hasta la cuota superior que es 5*10^5 + 2 * 10^5 \r\nfor i in range (1,len(fact)):\r\n fact[i] = (fact[i-1] * i) % MOD\r\n\r\n# Calcula el Coeficiente binomico modulo MOD \r\ndef Binom(n,k):\r\n return (fact[n] * (pow (fact[n-k] , MOD -2,MOD)*pow (fact[k] , MOD -2,MOD)) % MOD)%MOD\r\n\r\ndef solution(n,C):\r\n return (Binom(n+C,C)) -1 # calcular el coeficiente binomico n+c en c y restarle el caso en el que el muro no tiene bloques , que es la s\r\n\r\nif __name__ == \"__main__\":\r\n n,c = map(int,input().split())\r\n print(solution(n,c))", "M=10**6+3\r\nR=10**6\r\nFact=[1]*(R+1)\r\nfor i in range(2,R+1):\r\n Fact[i]=(i*Fact[i-1])%M\r\nFacthyp=[1]*(R+1)\r\nFacthyp[R]=pow(Fact[R],M-2,M)\r\nfor i in range(R-1,-1,-1):\r\n Facthyp[i]=((i+1)*Facthyp[i+1])%M\r\ndef C(n,k):\r\n if n<k or n<0 or k<0:\r\n return 0\r\n return (Fact[n]*Facthyp[n-k]*Facthyp[k])%M\r\nn,k=[int(e) for e in input().split()]\r\ns=0\r\nfor i in range(1,n+1):\r\n s+=C(i+k-1,k-1)\r\ns%=M\r\nprint(s)" ]

[ "def main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n #f.readline()\r\n #input()\r\n get = lambda :[str(x) for x in (f.readline()[:-1] if mode==\"file\" else input()).split(\"|\")]\r\n scale = get()\r\n q = input()\r\n if abs(len(scale[0]) - len(scale[1]))%2 != len(q)%2 or abs(len(scale[0]) - len(scale[1]))>len(q):\r\n print(\"Impossible\")\r\n return\r\n if len(scale[0])<len(scale[1]):\r\n mid = len(scale[1])-len(scale[0])\r\n scale[0]+=q[:mid]\r\n else:\r\n mid = len(scale[0])-len(scale[1])\r\n scale[1]+=q[:mid]\r\n for z in range(mid,len(q),2):\r\n scale[0]+=q[z]\r\n scale[1]+=q[z+1]\r\n print(\"|\".join(scale))\r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "a=input()\r\nb=a[:a.find('|')]\r\nc=a[a.find('|')+1:]\r\nd=input()\r\nif (len(b)+len(c)+len(d))%2==0 and abs(len(b)-len(c))<=len(d):\r\n if len(b)>len(c):\r\n e=len(b)-len(c)\r\n c+=d[:e]+d[e:(len(d)-e)//2+e]\r\n b+=d[(len(d)-e)//2+e:]\r\n else:\r\n e=len(c)-len(b)\r\n b+=d[:e]+d[e:(len(d)-e)//2+e]\r\n c+=d[(len(d)-e)//2+e:]\r\n print(b+'|'+c)\r\nelse:\r\n print('Impossible')", "import sys\ndef find(x, y):\n for i in range(len(x)):\n if x[i] == y[0]:\n return i\ndef substr(x, y, z):\n a = ''\n for i in range(y, z):\n a += x[i]\n return a\ndef erase(x):\n a = ''\n for i in range(1, len(x)):\n a += x[i]\n return a\ns = str(input())\nt = str(input())\nline = find(s, '|')\nsa = substr(s, 0, line)\nsb = substr(s, line + 1, len(s))\nflag = False\nif len(sa) < len(sb):\n sa, sb = sb, sa\n flag = True\nif len(sb) + len(t) < len(sa):\n print('Impossible')\n sys.exit()\nwhile len(t) > 0 and len(sa) != len(sb):\n sb += t[0]\n t = erase(t)\nif len(t) & 1:\n print('Impossible')\n sys.exit()\nfor i in range(len(t)):\n if i & 1:\n sa += t[i]\n else:\n sb += t[i]\nif flag:\n sa, sb = sb, sa\nprint(sa, end = '|')\nprint(sb)", "l,r = input().split('|')\r\nq = input()\r\nfor i in q:\r\n if len(l)>len(r):\r\n r+=i\r\n elif len(l)<len(r):\r\n l+=i\r\n else:\r\n l+=i\r\nif len(l)==len(r):\r\n print(l+\"|\"+r)\r\nelse:\r\n print('Impossible')\r\n\r\n", "for _ in range(1):\r\n lp,rp = input().split(\"|\")\r\n o = input()\r\n\r\n for i in o:\r\n if len(lp) > len(rp):\r\n rp += i\r\n else:\r\n lp += i\r\n if len(lp) == len(rp):\r\n print(lp,rp,sep=\"|\")\r\n else:\r\n print(\"Impossible\")", "s, l = input().split('|'), input()\r\nd = len(s[1]) - len(s[0])\r\nif abs(d) > len(l) or (len(l) - abs(d)) % 2 == 1:\r\n print('Impossible')\r\nelse:\r\n p = (len(l) + d) // 2\r\n print(s[0], l[:p], '|', s[1], l[p:], sep='')", "scale = input()\r\nweights = input()\r\n\r\ndelimterIndex = scale.find('|')\r\nleftPan = list(scale[:delimterIndex])\r\nrightPan = list(scale[(delimterIndex+1):])\r\n\r\n\r\nfor weight in weights:\r\n if(len(leftPan) < len(rightPan)):\r\n leftPan.append(weight)\r\n else:\r\n rightPan.append(weight)\r\n\r\nif(len(leftPan) == len(rightPan)):\r\n ans = ''.join(leftPan) + '|' + ''.join(rightPan)\r\n print(ans)\r\nelse:\r\n print(\"Impossible\")", "lt=list(input().split('|'))\r\ns=input()\r\nl1,l2,k=len(lt[0]),len(lt[1]),len(s)\r\nr=abs(l1-l2)\r\nif r==k:\r\n if l1<l2:\r\n lt[0]+=s\r\n else:\r\n lt[1]+=s\r\n print(lt[0]+\"|\"+lt[1])\r\nelif r>k:\r\n print(\"Impossible\")\r\nelse:\r\n i=0\r\n while len(s)!=i:\r\n if l1>l2:\r\n lt[1]+=s[i]\r\n i+=1\r\n l2+=1\r\n else:\r\n lt[0]+=s[i]\r\n i+=1\r\n l1+=1\r\n if len(lt[0])==len(lt[1]):\r\n print(lt[0]+\"|\"+lt[1])\r\n else:\r\n print(\"Impossible\")\r\n", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n scales = input().split('|')\r\n remaining = input()\r\n sum_length = len(scales[0]) + len(scales[1]) + len(remaining)\r\n\r\n if sum_length % 2 != 0:\r\n print('Impossible')\r\n else:\r\n temp = sum_length // 2\r\n\r\n if len(scales[0]) > temp or len(scales[1]) > temp:\r\n print('Impossible')\r\n else:\r\n for i in range(2):\r\n remainingi = temp - len(scales[i])\r\n scales[i] += remaining[:remainingi]\r\n remaining = remaining[remainingi:]\r\n print(scales[0], scales[1], sep='|')\r\n\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "left,right=input().split(\"|\")\r\next=input()\r\nfor i in ext:\r\n if len(left)>len(right):\r\n right+=i\r\n else:\r\n left+=i\r\nif len(right)==len(left):\r\n print(left+\"|\"+right)\r\nelse:\r\n print(\"Impossible\")\r\n", "a = input()\r\nb = list(input())\r\nl = ''\r\nr = ''\r\nx = 0\r\ny = 0\r\nswitch = False\r\nfor i in a:\r\n if i == '|':\r\n switch = True\r\n else:\r\n if not switch:\r\n x += 1\r\n l += i\r\n else:\r\n y += 1\r\n r += i\r\n\r\nk = len(b)\r\nc = abs(x-y)\r\nif k - c >= 0 and (k-c)%2 ==0:\r\n if x > y:\r\n for i in range(c):\r\n r += b.pop()\r\n for i in range((k-c)//2):\r\n l += b.pop()\r\n r += b.pop()\r\n else:\r\n for i in range(c):\r\n l += b.pop()\r\n for i in range((k-c)//2):\r\n l += b.pop()\r\n r += b.pop()\r\n\r\n print(l + '|' + r)\r\nelse:\r\n print('Impossible')\r\n", "left, right = input().split(\"|\")\r\nrest = input()\r\nfor i in rest:\r\n if len(left) < len(right):\r\n left += i\r\n else:\r\n right += i\r\nprint([left + \"|\" + right, \"Impossible\"][len(left) != len(right)])\r\n", "a , b = input().split('|')\r\ns = input()\r\nif s != '':\r\n for i in s:\r\n if len(a)>len(b):\r\n b += i\r\n else:\r\n a +=i\r\n\r\n\r\n\r\nif len(a)!=len(b):\r\n print(\"Impossible\")\r\nelse:\r\n print(a+'|'+b)", "n=input()\r\ni=n.find('|')\r\nl=input()\r\ns1=n[:i]\r\ns2=n[i+1:]\r\nfor j in range(len(l)):\r\n\tif(len(s1)>=len(s2)):\r\n\t\ts2+=l[j]\r\n\telse:\r\n\t\ts1+=l[j]\r\nif(len(s1)==len(s2)):\r\n\tprint(s1+'|'+s2)\r\nelse:\r\n\tprint('Impossible')", "s = input().split('|')\r\nx = input()\r\n\r\na = len(s[0])\r\nb = len(s[1])\r\nc = len(x)\r\nf = True\r\nif a < b:\r\n d = b - a\r\n if c>=d:\r\n s[0] += x[:d]\r\n c -= d\r\n x = x[d:]\r\n\r\nif a > b:\r\n d = a - b\r\n if c>=d:\r\n s[1] += x[:d]\r\n c -= d\r\n x = x[d:]\r\n\r\ns[0] += x[:c//2]\r\ns[1] += x[c//2:]\r\n\r\nif len(s[0]) == len(s[1]):\r\n print('|'.join(s))\r\nelse:\r\n print(\"Impossible\")\r\n \r\n\r\n", "initial = input().split('|')\r\nafter = input()\r\ndiff = abs(len(initial[0]) - len(initial[1]))\r\nans = True\r\nif len(after) < diff:\r\n print(\"Impossible\")\r\n exit(0)\r\n\r\ntemp = len(after) - diff\r\nalpha = temp // 2\r\nif temp & 1:\r\n print(\"Impossible\")\r\n exit(0)\r\n\r\nif len(initial[0]) < len(initial[1]):\r\n initial[0] += after[:diff]\r\nelse:\r\n initial[1] += after[:diff]\r\n\r\nif alpha:\r\n initial[0] += after[diff:alpha + diff]\r\n initial[1] += after[alpha + diff:]\r\n\r\nprint('|'.join(initial))", "l,r =input().split(\"|\");e = input()\r\nif abs(len(l)-len(r)) <= len(e) and (len(e) - abs(len(l)-len(r)))%2==0 :\r\n each = len(l+r+e)//2\r\n print(l+e[0:abs(len(l)-each)]+\"|\"+r+e[abs(len(l)-each):])\r\nelse:\r\n print(\"Impossible\")", "a,b=input().split(\"|\")\r\nc=input()\r\nfor i in range(len(c)):\r\n if(len(a)<len(b)):\r\n a+=c[i]\r\n elif(len(a)>len(b)):\r\n b+=c[i] \r\n else: \r\n a+=c[i] \r\n\r\nif(len(a)==len(b)):\r\n o=a+\"|\"+b\r\n print(o)\r\nelse:\r\n print(\"Impossible\")\r\n", "a, b=input().split('|')\r\nwords=input()\r\nfor i in range(len(words)):\r\n\tif len(a)>len(b):\r\n\t\tb=b+words[i]\r\n\telse:\r\n\t\ta=a+words[i]\r\nif len(a)==len(b):\r\n\tprint(a+\"|\"+b)\r\nelse:\r\n\tprint(\"Impossible\")", "[left, right] = input().split('|')\nweight = input().strip()\nl, r, w = len(left), len(right), len(weight)\nd = abs(l - r)\nif w < d or (w - d) % 2 == 1:\n\tprint(\"Impossible\")\nelse:\n\tif l < r:\n\t\tleft = left + weight[:d]\n\telse:\n\t\tright = right + weight[:d]\n\tweight = weight[d:]\n\td = len(weight)\n\tprint(left+weight[:d//2]+\"|\"+right+weight[d//2:])", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\na = s.find('|')\r\nb = n - 1 - a\r\nd = input()[:-1]\r\nc = len(d)\r\nif (a + b + c) % 2 or c < abs(a-b):\r\n print('Impossible')\r\nelse:\r\n x = (a + b + c)//2 - a\r\n s = s[:a] + d[:x] + s[a:] + d[x:]\r\n print(s)", "from math import *\r\nstr1,str2=input().split('|')\r\ndif=abs(len(str1)-len(str2))\r\nstr3=input()\r\ntot=len(str3)-dif\r\nif tot<0 or tot%2==1:\r\n print(\"Impossible\")\r\nelse:\r\n if len(str1)<=len(str2):\r\n for i in range(len(str3)):\r\n if i<tot//2:\r\n str2+=str3[i]\r\n else:\r\n str1+=str3[i]\r\n else:\r\n for i in range(len(str3)):\r\n if i<tot//2:\r\n str1+=str3[i]\r\n else:\r\n str2+=str3[i]\r\n print(str1+'|'+str2)\r\n", "import sys\ns = input()\nsx = input()\nfor i in range(len(s)):\n if s[i] == '|':\n p = i\nfirst = s[0:p]\nsecond = s[p+1:]\nfor i in range(len(sx)):\n if len(first)<len(second):\n first+=sx[i]\n else:\n second+=sx[i]\nif len(first)!=len(second):\n print('Impossible')\nelse:\n print(first+'|'+second)\n", "s = input()\r\nk = input()\r\nleft = \"\"\r\nright = \"\"\r\ndelimeter = False\r\nfor c in s:\r\n if c == '|':\r\n delimeter = True\r\n continue\r\n if not delimeter:\r\n left += c\r\n else:\r\n right += c\r\nstart = 0\r\nwhile start < len(k):\r\n if len(left) < len(right):\r\n left += k[start]\r\n else:\r\n right += k[start]\r\n start += 1\r\nif len(left) != len(right):\r\n print(\"Impossible\")\r\nelse:\r\n print(left + '|' + right)\r\n \r\n\r\n", "#!/usr/bin/env python3\n\nright, left = input().split('|')\nrest = input()\n\nlen_R, len_L, len_rest = len(right), len(left), len(rest)\nneedle = abs(len_R - len_L)\nrest_of_rest = len_rest - needle\n\nif rest_of_rest % 2 != 0 or rest_of_rest < 0:\n print(\"Impossible\")\n exit(0)\n\nmid = rest_of_rest // 2\nif len_R < len_L:\n right += rest[:needle]\nelse:\n left += rest[:needle]\n\nif rest_of_rest != 0:\n right += rest[needle:needle+mid]\n left += rest[needle+mid:]\n\nprint('|'.join([right,left]))\n", "s = input().split('|')\r\nl = list(input())\r\n\r\nfor i in l:\r\n\tif len(s[0])>len(s[1]):\r\n\t\ts[1] += i\r\n\telif len(s[0])<len(s[1]):\r\n\t\ts[0] += i\r\n\telse:\r\n\t\ts[0] += i\r\n\r\n\r\n\r\nif len(s[0]) == len(s[1]):\r\n\tprint(s[0]+'|'+s[1])\r\nelse:\r\n\tprint('Impossible')\r\n\r\n", "left, right = list(map(str, input().split(\"|\")))\r\nw_add = input()\r\nif (len(w_add) + min(len(left), len(right)) < max(len(left), len(right))):\r\n print(\"Impossible\")\r\nelse:\r\n if ((len(left) + len(right) + len(w_add)) % 2 != 0):\r\n print(\"Impossible\")\r\n else:\r\n total = (len(left) + len(right) + len(w_add))\r\n l_add = (total // 2) - len(left)\r\n print(left + w_add[0 : l_add] + \"|\" + right + w_add[l_add : len(w_add)], sep=\"\")", "right,left=map(str,input().split(\"|\"))\r\ngiven=(str(input()))\r\nif len(right+left+given)%2!=0 or len(right)>len(left+given) or len(right+given)<len(left):\r\n print(\"Impossible\")\r\nelse:\r\n mid=len(right+left+given)//2\r\n x=(mid-len(right))\r\n right=right+given[0:x]\r\n left=left+given[x:len(given)]\r\n print(right + \"|\" + left)\r\n\r\n\r\n", "n,m=input().split('|')\r\nl=list(input())\r\nfor x in l:\r\n if len(n)<len(m): n+=x\r\n else: m+=x\r\nif len(n)==len(m): print('|'.join([n,m]))\r\nelse: print('Impossible')", "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(a,b):\r\n x,y = a.split(\"|\")\r\n\r\n for i in range(len(b)):\r\n if len(x) < len(y):\r\n x += b[i]\r\n else:\r\n y += b[i]\r\n\r\n if len(x) == len(y):\r\n print(x+\"|\"+y)\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\n# for _ in range(int(input())):\r\na = str(input())[:-1]\r\nb = str(input())[:-1]\r\nsolve(a,b)\r\n\r\n ", "a, b = input().split(\"|\")\na, b = list(a), list(b)\nscale = [a,b]\nweights = list(input())\n\nif (len(scale[0]) + len(scale[1]) + len(weights)) % 2 == 0:\n if abs(len(scale[0]) - len(scale[1])) <= len(weights):\n for i in weights:\n if len(scale[0]) < len(scale[1]):\n scale[0].append(i)\n else:\n scale[1].append(i)\n print(''.join(scale[0]) + \"|\" + ''.join(scale[1]))\n else:\n print(\"Impossible\")\nelse:\n print(\"Impossible\")\n", "S = input().strip()\r\nIndex = S.find('|')\r\nL, R = Index, len(S) - Index - 1\r\nOther = input().strip()\r\nif (L + R + len(Other)) % 2 == 0 and max(L, R) <= min(L, R) + len(Other):\r\n Amount = (L + R + len(Other)) // 2\r\n print(S[:Index] + Other[:Amount - L] + '|' + S[Index + 1:] + Other[Amount - L:])\r\nelse:\r\n print(\"Impossible\")\r\n", "right, left = input().split(\"|\")\nrem = input()\n\nif len(right + rem + left) % 2 or len(rem) < abs(len(right) - len(left)):\n print(\"Impossible\")\nelse:\n for c in rem:\n if len(right) < len(left):\n right += c\n else:\n left += c\n print(f\"{right}|{left}\")", "before, after = input().split('|')\r\nremaining = input()\r\n\r\nfor each in remaining:\r\n if len(before) > len(after):\r\n after += each\r\n else:\r\n before += each\r\n\r\nif len(before) == len(after):\r\n print(before + \"|\" + after)\r\nelse:\r\n print(\"Impossible\")\r\n", "scales = input().split('|')\r\nweights = input()\r\nr_scale = scales[0]\r\nl_scale = scales[1]\r\nr_scale_length = len(scales[0])\r\nl_scale_length = len(scales[1])\r\nweights_length = len(weights)\r\nwhile (r_scale_length != l_scale_length or weights_length % 2 == 0) and weights_length > 0:\r\n if r_scale_length < l_scale_length:\r\n r_scale_length += 1\r\n r_scale = r_scale + weights[0]\r\n weights_length -= 1\r\n weights = weights[1:]\r\n elif r_scale_length > l_scale_length:\r\n l_scale_length += 1\r\n l_scale = l_scale + weights[0]\r\n weights_length -= 1\r\n weights = weights[1:]\r\n elif r_scale_length == r_scale_length:\r\n r_scale_length += 1\r\n r_scale = r_scale + weights[0]\r\n weights_length -= 1\r\n weights = weights[1:]\r\n l_scale_length += 1\r\n l_scale = l_scale + weights[0]\r\n weights_length -= 1\r\n weights = weights[1:]\r\nif not weights and r_scale_length == l_scale_length:\r\n print(f'{r_scale}|{l_scale}', end = '')\r\nelse:\r\n print('Impossible', end = '')\r\n \r\n ", "x,y=map(str,input().split('|'))\r\ns=input()\r\nfor i in range(len(s)):\r\n if(len(x)>=len(y)):\r\n y=y+s[i]\r\n else:\r\n x=x+s[i]\r\nif(len(x)!=len(y)):\r\n print(\"Impossible\")\r\nelse:\r\n print(x+'|'+y)\r\n", "left, right = input().split('|')\r\nweight = input()\r\n\r\n\r\ndef solve(word=None):\r\n global left, right\r\n \r\n for i in range(0, len(weight) + 1):\r\n if len(left) + i == (len(weight) - i) + len(right):\r\n return left + weight[:i], '|', right + weight[i:]\r\n elif len(left) + len(weight) - i == len(right) + i:\r\n return left + weight[i:], '|', right + weight[:i]\r\n\r\n return ['Impossible']\r\n\r\n\r\nprint(*solve(), sep='')\r\n", "l,r=input().split('|')\r\ns=input()\r\nfor c in s:\r\n if len(l)>len(r):r+=c \r\n else:l+=c\r\nif len(l)==len(r):print(l,'|',r,sep='')\r\nelse:print('Impossible')", "a=list(map(str,input().split('|')))\r\n#print(a)\r\nb=input()\r\nl1,l2=len(a[0]),len(a[1])\r\nl=abs(l1-l2)\r\nif(l==len(b)):\r\n if l1<l2:\r\n print(a[0]+b+'|'+a[1])\r\n else:\r\n print(a[0]+'|'+a[1]+b)\r\nelif l<len(b):\r\n\r\n if(l1<l2):\r\n a[0]=a[0]+b[:l]\r\n else:\r\n a[1]=a[1]+b[:l]\r\n if((len(b)-l)%2==0):\r\n l3=len(b)-l\r\n a[0]=a[0]+b[l:l+l3//2]\r\n a[1]=a[1]+b[l+l3//2:]\r\n print(a[0]+'|'+a[1])\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n print(\"Impossible\")\r\n \r\n", "first,second=input().split('|')\r\nnew=[*input()]\r\nlen1,len2,lennew=len(first),len(second),len(new)\r\nwhile lennew>0 and len1>len2:\r\n len2+=1\r\n lennew-=1\r\n second+=new.pop()\r\nwhile lennew>0 and len2>len1:\r\n len1+=1\r\n lennew-=1\r\n first+=new.pop()\r\nwhile len1==len2 and lennew>1:\r\n lennew-=2\r\n len1+=1\r\n len2+=1\r\n first+=new.pop()\r\n second+=new.pop()\r\nif len1==len2 and lennew==1:\r\n print('Impossible')\r\nelif len1!=len2 and lennew==0:\r\n print('Impossible')\r\nelif len1==len2 and lennew==0:\r\n print(first,'|',second,sep='')\r\nelse:\r\n print('Impossible')", "import math\r\n\r\n\r\ndef main():\r\n s = input()\r\n delimiter=s.index('|')\r\n left=s[0:delimiter]\r\n right=s[delimiter+1:len(s)]\r\n task = input()\r\n for i in range(len(task)):\r\n if len(left) <= len(right):\r\n left+=task[i]\r\n else:\r\n right+=task[i]\r\n if len(left) == len(right):\r\n print(left + \"|\" + right)\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\nif __name__ == '__main__': main()", "import sys\r\nimport heapq\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n\tkiri,kanan = input().split(\"|\")\r\n\tta = list(input())\r\n\tif((len(kiri)+len(kanan)+len(ta))%2 == 1):\r\n\t\tprint(\"Impossible\")\r\n\telse:\r\n\t\twhile(len(ta)!=0):\r\n\t\t\tif(len(kiri)>len(kanan)):\r\n\t\t\t\tkanan+=ta[0]\r\n\t\t\telse:\r\n\t\t\t\tkiri+=ta[0]\r\n\t\t\tta.pop(0)\r\n\t\tif(len(kiri)==len(kanan)):\r\n\t\t\tprint(f\"{kiri}|{kanan}\")\r\n\t\telse:\r\n\t\t\tprint(\"Impossible\")\r\n\r\n\t\t\r\n\t\r\n \r\nif __name__ == '__main__':\r\n main()", "nm = list(map(str, input().split(\"|\")))\r\ns = list(input())\r\nn = nm[0]\r\nm = nm[1]\r\nwhile s:\r\n\tif len(n)<=len(m):\r\n\t\tn = n + s.pop(0)\r\n\telse:\r\n\t\tm = m + s.pop(0)\r\nif len(n) == len(m):\r\n\tprint(n + \"|\" + m)\r\nelse:\r\n\tprint(\"Impossible\")", "def calculate():\r\n left, right = input().split(\"|\")\r\n free_weight = input()\r\n for i in free_weight:\r\n if len(left) < len(right):\r\n left = left + i\r\n else:\r\n right = right + i\r\n if len(left) == len(right):\r\n print (f\"{left}|{right}\")\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\ncalculate()\r\n", "a,aa = map(str,input().split(\"|\"))\nb = input()\nfor c in b:\n if(len(a)>len(aa)):\n aa+=c\n else:a+=c\nla=len(a)\nlaa=len(aa)\nif(la==laa):print(a+\"|\"+aa)\nelse:print(\"Impossible\")\n \t\t \t\t\t \t \t\t \t \t", "s = input()\r\nt = input()\r\n\r\np = s.find('|')\r\nl = s[:p]\r\nr = s[p + 1:]\r\n\r\nfor c in t:\r\n if len(l) <= len(r):\r\n l += c\r\n else:\r\n r += c\r\n\r\nif len(l) == len(r):\r\n print(l + \"|\" + r)\r\nelse:\r\n print(\"Impossible\")\r\n \r\n ", "from sys import stdin\r\ndef PanScale(string, scale):\r\n x = 1\r\n while x <= len(scale):\r\n if len(string[0] + scale[:x]) == len(string[1] + scale[x:]):\r\n return string[0] + scale[:x] + \"|\" + string[1] + scale[x:]\r\n elif len(string[1] + scale[:x]) == len(string[0] + scale[x:]):\r\n return string[0] + scale[x:] + \"|\" + string[1] + scale[:x]\r\n x += 1\r\n return \"Impossible\"\r\n\r\ndef main():\r\n string = stdin.readline().strip().split(\"|\")\r\n scale = stdin.readline().strip()\r\n print(PanScale(string, scale))\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\nleft = s.index('|')\r\nright = len(s[s.index('|') + 1:])\r\nadd = input()\r\nleft_s = s[:s.index('|')]\r\nright_s = s[s.index('|') + 1:]\r\nfor el in add:\r\n\tif len(left_s) <= len(right_s):\r\n\t\tleft_s += el\r\n\telse:\r\n\t\tright_s += el\r\nif len(left_s) != len(right_s):\r\n\tprint('Impossible')\r\nelse:\r\n\tprint(f'{left_s}|{right_s}')", "g1, g2 = map(str, input().split(\"|\"))\ns = input()\n\nfor i in s:\n if len(g1) > len(g2):\n g2 += i\n else:\n g1 += i\nif len(g1) == len(g2):\n print(f\"{g1}|{g2}\")\nelse:\n print(\"Impossible\")\n\n\t\t\t\t \t\t\t\t\t \t\t\t\t \t\t\t \t\t \t \t\t", "def main():\n current = input().strip().split(\"|\")\n unused = input().strip()\n lengths = [ len(x) for x in current ]\n ll,lr,lu=min(lengths[0],lengths[1]),max(lengths[0],lengths[1]),len(unused)\n r = None\n if (ll+lr+lu)%2==1 or ll+lu<lr:\n r = \"Impossible\"\n else:\n lmid = (ll+lr+lu)>>1\n lb,rb = list(),list()\n i = 0\n while len(lb)+len(current[0])<lmid:\n lb.append(unused[i])\n i+=1\n while len(rb)+len(current[1])<lmid:\n rb.append(unused[i])\n i+=1\n r = current[0]+''.join(lb)+\"|\"+current[1]+''.join(rb)\n print(r)\n\nmain()\n\n", "a,b=input().split('|')\nz=a+input()+b\nm=len(z)//2\nprint([z[:m]+'|'+z[m:],'Impossible'][max(map(len,[a,b,z[m:]]))>m])", "def main():\r\n left, right = input().split(\"|\")\r\n remaining = input()\r\n left_length = len(left)\r\n right_length = len(right)\r\n rem_length = len(remaining)\r\n\r\n if left_length > right_length:\r\n max_length = left_length\r\n min_length = right_length\r\n max_word = left\r\n min_word = right\r\n flag = True\r\n else:\r\n max_length = right_length\r\n min_length = left_length\r\n max_word = right\r\n min_word = left\r\n flag = False\r\n\r\n diff_length = max_length - min_length\r\n\r\n if rem_length < diff_length:\r\n print(\"Impossible\")\r\n return\r\n\r\n min_word += remaining[: diff_length]\r\n remaining = remaining[diff_length:]\r\n rem_length -= diff_length\r\n\r\n if rem_length % 2 == 1:\r\n print(\"Impossible\")\r\n return\r\n\r\n if flag:\r\n print(max_word + remaining[:rem_length//2] + \"|\" +\r\n min_word + remaining[rem_length//2:])\r\n else:\r\n print(min_word + remaining[:rem_length // 2] + \"|\" +\r\n max_word + remaining[rem_length // 2:])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,a2 = input().split('|')\r\nb = input()\r\nrem = max(len(a),len(a2))-min(len(a),len(a2))\r\nif len(b)>=rem:\r\n rem2 = len(b)-rem\r\n res = \"\"\r\n if rem2%2==0:\r\n if len(a)<len(a2):\r\n res = a+b[:rem]+b[rem:][:rem2//2]+\"|\"+a2+b[rem:][rem2//2:]\r\n elif len(a2)<len(a):\r\n res = a+b[rem:][rem2//2:]+\"|\"+a2+b[:rem]+b[rem:][:rem2//2]\r\n else:\r\n res = a+b[:len(b)//2]+\"|\"+a2+b[len(b)//2:]\r\n print(res)\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n print(\"Impossible\")", "left,right = input().split('|')\r\nw = input()\r\nr_w =len(right)\r\nl_w = len(left)\r\nww = len(w)\r\n\r\nwhile ww>0:\r\n if l_w>r_w:\r\n diff = l_w - r_w\r\n r_w += diff*(ww>=diff)\r\n right+=w[ww-diff:ww]\r\n ww-=diff\r\n elif l_w<r_w:\r\n diff = r_w - l_w\r\n l_w += diff*(ww>=diff)\r\n left+=w[ww-diff:ww]\r\n ww-=diff\r\n else:\r\n weights = ww//2\r\n l_w+= weights\r\n left+=w[ww-weights:ww]\r\n r_w+=ww-weights\r\n right+=w[0:ww-weights]\r\n ww=0\r\nif l_w==r_w:\r\n print(left,'|',right,sep='')\r\nelse:\r\n print(\"Impossible\")", "a,b=input().split('|')\r\nS = a +input()+b\r\ns = len(S)//2\r\n\r\nprint([S[:s] + '|' + S[s:] , \"Impossible\"] [max(map(len,[a,b,S[s:]]))>s])\r\n", "a, b = map(str, input().split(\"|\"))\nc = input()\nboolean = True\n\nfor i in range(len(c)):\n if len(a)<len(b):\n a += c[i]\n elif len(a)>len(b):\n b += c[i]\n else:\n a += c[i]\n\nif len(a) == len(b):\n print(a + \"|\" + b)\nelse:\n print(\"Impossible\")\n\n \t\t \t\t\t \t\t \t\t \t \t\t", "left, right = input().split('|')\r\nminimal_string_is_left = True if len(left) < len(right) else False\r\nweighs_left = input()\r\nif ((minimal_string_is_left and len(left) + len(weighs_left) < len(right)) or ((not minimal_string_is_left) and len(weighs_left) + len(right) < len(left))) or (max(len(left),len(right)) - (min(len(left),len(right)) + len(weighs_left)))%2 != 0:\r\n print('Impossible')\r\nelse:\r\n if minimal_string_is_left:\r\n difference = len(right) - len(left)\r\n left += weighs_left[:difference]\r\n weighs_left = weighs_left[difference:]\r\n else:\r\n difference = len(left) - len(right)\r\n right += weighs_left[:difference]\r\n weighs_left = weighs_left[difference:]\r\n left += weighs_left[:int(len(weighs_left)/2)]\r\n right += weighs_left[int(len(weighs_left)/2):]\r\n print(left+'|'+right)", "s = input()\r\nrem = input()\r\n\r\ncnt1 = s.find('|')\r\ncnt2 = len(s)-cnt1-1\r\nl = s[:cnt1]\r\nr = s[cnt1+1:]\r\n\r\nif abs(cnt1-cnt2) > len(rem) or (len(rem)-abs(cnt1-cnt2))&1 :\r\n print(\"Impossible\")\r\nelse :\r\n p = 0\r\n while len(l) < len(r) :\r\n l+=rem[p]\r\n p+=1\r\n while len(r) < len(l) :\r\n r+=rem[p]\r\n p+=1\r\n while p < len(rem) :\r\n l+=rem[p]\r\n r+=rem[p+1]\r\n p+=2\r\n print(l+'|'+r)", "ch1,ch2=input().split(\"|\")\r\nch=input()\r\nn=len(ch)\r\nn1=len(ch1)\r\nn2=len(ch2)\r\nif (n1+n2+n)%2==1:\r\n print(\"Impossible\")\r\nelif (n1+n<n2)or(n2+n<n1):\r\n print(\"Impossible\")\r\nelse :\r\n a=(n1+n2+n)/2\r\n while(len(ch1)<a):\r\n ch1+=ch[0]\r\n ch=ch[1:]\r\n ch2+=ch\r\n c=ch1+\"|\"+ch2\r\n print(c)", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nstring1 = input()\r\ny = string1.find(\"|\")\r\nstring = [string1[:y], string1[y+1:]]\r\nextra = input()\r\nfirst = len(string[0])\r\nlast = len(string[1])\r\nif first == last:\r\n if len(extra) % 2 == 0:\r\n \" then we have to print the result \"\r\n for i in range(len(extra)):\r\n if i % 2 == 0:\r\n string[0] += extra[i]\r\n else:\r\n string[1] += extra[i]\r\n string.insert(1, \"|\")\r\n print(\"\".join(string))\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n if len(extra) < abs(first - last):\r\n print(\"Impossible\")\r\n elif len(extra) == abs(first - last):\r\n \" then we have to print the result \"\r\n if first > last:\r\n for i in extra:\r\n string[1] += i\r\n else:\r\n for i in extra:\r\n string[0] += i\r\n string.insert(1, \"|\")\r\n print(\"\".join(string))\r\n elif len(extra) > abs(first - last):\r\n if (len(extra) - abs(first - last)) % 2 == 0:\r\n \" then we have to print the result \"\r\n temp = list(extra)\r\n if first > last:\r\n for i in range(abs(first - last)):\r\n x = temp.pop(0)\r\n string[1] += x\r\n for i in range(0, len(temp)):\r\n if i % 2 == 0:\r\n string[0] += temp[i]\r\n else:\r\n string[1] += temp[i]\r\n string.insert(1, \"|\")\r\n print(\"\".join(string))\r\n else:\r\n for i in range(abs(first - last)):\r\n x = temp.pop(0)\r\n string[0] += x\r\n for i in range(0, len(temp)):\r\n if i % 2 == 0:\r\n string[0] += temp[i]\r\n else:\r\n string[1] += temp[i]\r\n string.insert(1, \"|\")\r\n print(\"\".join(string))\r\n else:\r\n print(\"Impossible\")\r\n", "myStr = input()\r\nenteredStr = input()\r\nmyStr = myStr.split('|')\r\nleft = myStr[0]\r\nright = myStr[1]\r\n\r\nfor i in range(len(enteredStr)):\r\n if(len(left)<len(right)):\r\n left = left + enteredStr[i]\r\n else:\r\n right = right +enteredStr[i]\r\n\r\nif len(left) != len(right) :\r\n print(\"Impossible\")\r\nelse:\r\n print(left+\"|\"+right)\r\n", "s=input().split(\"|\")\r\nl= input()\r\nfor i in l:\r\n if len(s[0])>len(s[1]):\r\n s[1]+=i\r\n else:\r\n s[0]+=i\r\nif len(s[1])!=len(s[0]):\r\n print(\"Impossible\")\r\nelse:\r\n print(s[0]+\"|\"+s[1])\r\n", "s=input()\r\ns1=input()\r\ns=s.split(\"|\")\r\na=s[0]\r\nb=s[1]\r\nif len(a)==len(b) and len(s1)%2!=0:\r\n print(\"Impossible\")\r\n exit()\r\nelse:\r\n for x in s1:\r\n if len(a)>=len(b):\r\n b=b+x\r\n elif len(b)>=len(a):\r\n a=a+x\r\n if len(a)!=len(b):\r\n print(\"Impossible\")\r\n exit()\r\n else:\r\n print(a+\"|\"+b)\r\n exit()", "(a, b) = input().split('|')\r\nc = input()\r\ni = 0\r\nwhile len(c) > 0:\r\n if len(a) < len(b):\r\n a += c[0]\r\n else:\r\n b += c[0]\r\n c = c[1::]\r\nif len(a) == len(b):\r\n print(a + '|' + b)\r\nelse:\r\n print(\"Impossible\")", "s=input()\r\ny=input()\r\nc1=0\r\nfor i in s:\r\n if i != '|':\r\n c1 += 1\r\n else:\r\n break\r\nc2=len(s)-c1-1\r\nc3=len(y)\r\nif c1 + c3 == c2:\r\n print(s[:c1]+y+s[c1:])\r\nelif c1 == c2+c3:\r\n print(s+y)\r\nelse:\r\n c=len(s)+len(y)-1\r\n if c%2==0 and c1 <=c//2 and c2<=c//2:\r\n c=c//2\r\n x=s.index('|')\r\n if x < c:\r\n i=0\r\n s1=s[:x]\r\n while i < c-x:\r\n s1 += y[i]\r\n i+=1\r\n s2=s[x+1:] + y[i:]\r\n print(s1+\"|\"+s2)\r\n else:\r\n print(\"Impossible\")", "#76\r\na=input().split(\"|\")\r\nb=input()\r\nx=len(a[0])\r\ny=len(a[1])\r\nz=len(b)\r\nif (x == y ) and z % 2 ==0:\r\n r=a[0]+b[:z//2]+\"|\"+a[1]+b[z//2:]\r\n print(r)\r\nelif((x == y ) and z % 2 !=0) : \r\n print('Impossible')\r\n \r\nelif x >y and (x - y ) <= z and (z-(x-y)) % 2==0 : \r\n r=a[0]+b[:(z-(x-y))//2]+\"|\"+a[1]+b[(z-(x-y))//2:]\r\n print(r)\r\nelif y > x and (y - x ) <= z and (z-(y-x)) % 2==0 : \r\n r=a[0]+b[(z-(y-x))//2:]+\"|\"+a[1]+b[:(z-(y-x))//2]\r\n print(r) \r\n \r\nelse:\r\n print('Impossible')\r\n\r\n ", "l = input(\"\")\r\nw = input(\"\")\r\nscales = l.split('|')\r\nwhile len(w) > 0:\r\n if len(scales[0]) < len(scales[1]):\r\n scales[0] += w[0]\r\n else:\r\n scales[1] += w[0]\r\n \r\n w = w[1:len(w)]\r\n \r\nif len(scales[0]) != len(scales[1]):\r\n print(\"Impossible\")\r\nelse:\r\n print(scales[0] + \"|\" + scales[1])\r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nscales = input()\r\nletters = input()\r\n\r\ndiff_scales = scales.split(\"|\")\r\n#print(diff_scales)\r\nw1 = diff_scales[0]\r\nw2 = diff_scales[1]\r\n\r\nfor item in letters:\r\n if len(w1) <= len(w2):\r\n w1 += item\r\n else:\r\n w2 += item\r\nif len(w1) == len(w2):\r\n print(w1,w2,sep=\"|\")\r\nelse:\r\n print(\"Impossible\")\r\n", "from sys import stdin, stdout\r\nINF=1e11\r\n# import math\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\n# for _ in range(int(stdin.readline())):\r\n \r\ns=get_string()\r\ns2=get_string()\r\nl=[]\r\nr=[]\r\na=[c for c in s2]\r\nf=0\r\nans=\"\"\r\nfor i in s:\r\n if i=='|':\r\n f=1\r\n continue\r\n if f==0 :\r\n l.append(i)\r\n if f==1 :\r\n r.append(i)\r\n \r\nif len(l)<len(r):\r\n if len(a)<(len(r)-len(l)):\r\n print(\"Impossible\")\r\n else:\r\n for i in range(len(r)-len(l)):\r\n l.append(a.pop(0))\r\nif len(l)>len(r):\r\n if len(a)<len(l)-len(r):\r\n print(\"Impossible\")\r\n else:\r\n for i in range(len(l)-len(r)):\r\n r.append(a.pop(0))\r\nif len(l)==len(r):\r\n if len(a)%2!=0:\r\n print(\"Impossible\")\r\n else:\r\n while len(a)>0:\r\n l.append(a.pop(0))\r\n r.append(a.pop())\r\n \r\n for c in l:\r\n ans+=c\r\n ans+=\"|\"\r\n for c in r:\r\n ans+=c\r\n print(ans)\r\n\r\n\r\n ", "x=input().split(\"|\")\r\nz=input()\r\nfor i in z:\r\n if len(x[0])>len(x[1]):\r\n x[1]+=i\r\n else:\r\n x[0]+=i\r\nif len(x[0])==len(x[1]):\r\n print(x[0]+'|'+x[1])\r\nelse:\r\n print('Impossible')\r\n \r\n \r\n", "l, r = input().split(\"|\")\r\ns = input()\r\nfor i in range(len(s)):\r\n if len(l) < len(r):\r\n l += s[i]\r\n else:\r\n r += s[i]\r\nif(len(l) != len(r)):\r\n print(\"Impossible\")\r\nelse:\r\n print(l + \"|\" + r)", "a=input()\r\ns=input()\r\nl=a.split('|')\r\nres=''\r\nwhile len(s)>0 : \r\n \r\n if len(l[0]) > len(l[1]) : \r\n l[1]+=s[0] \r\n elif len(l[0]) <= len(l[1]): \r\n l[0]+=s[0]\r\n s=s.replace(s[0],'')\r\nres='|'.join(l)\r\nif len(l[1]) != len(l[0]) :\r\n res='Impossible'\r\nprint(res)", "s = input()\r\nseq = input()\r\n\r\nleft, right = s.split('|')\r\nl1 = len(left)\r\nl2 = len(right)\r\n\r\nl = 0\r\nwhile l < len(seq):\r\n if len(left) < len(right):\r\n left += seq[l]\r\n l += 1\r\n elif len(left) > len(right):\r\n right += seq[l]\r\n l += 1\r\n else:\r\n left += seq[l]\r\n l += 1\r\n\r\n if l < len(seq):\r\n right += seq[l]\r\n l += 1\r\n\r\n\r\nif len(left) == len(right):\r\n print(left + \"|\" + right)\r\nelse:\r\n print('Impossible')", "Left, Right = list(input().split(\"|\"))\r\nRemained = input()\r\nTotal = len(Left) + len(Right) + len(Remained)\r\nif Total / 2 != Total // 2:\r\n print(\"Impossible\")\r\n exit()\r\nif Total // 2 < len(Right) or Total // 2 < len(Left):\r\n print(\"Impossible\")\r\n exit()\r\nDif1 = Total // 2 - len(Left)\r\nprint(Left + Remained[:Dif1] + \"|\" + Right + Remained[Dif1:])\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 637\r\n", "a,b=input().split('|')\r\ns=input()\r\nx,y,n=map(len,(a,b,s))\r\nd=abs(x-y)\r\nif n-d>=0 and not (n-d)%2:\r\n z=(n-d)//2\r\n if x<=y:\r\n print(a+s[:z]+s[z:z+d]+'|'+b+s[z+d:])\r\n else:\r\n print(a+s[:z]+'|'+b+s[z:z+d]+s[z+d:])\r\nelse:\r\n print('Impossible')", "left, right = input().split('|')\r\nweights = input()\r\n\r\nfor weight in weights:\r\n if len(left) < len(right):\r\n left += weight\r\n else:\r\n right += weight\r\n\r\nprint((left + '|' + right) if len(left) == len(right) else \"Impossible\")\r\n", "b = input().split(\"|\")\r\nw = input()\r\nx, y, z = map(len, b + [w])\r\ns = sum([x, y, z])\r\nh = s // 2\r\nif s % 2 != 0 or x > h or y > h:\r\n print(\"Impossible\")\r\nelse:\r\n b[0] += w[:h - x]\r\n b[1] += w[h - x:]\r\n print('|'.join(b))", "l,r = input().split('|')\r\nw = input()\r\nl1,l2=len(l),len(r)\r\nfor i in w:\r\n if l1>l2:\r\n r+=i\r\n l2+=1\r\n elif l2>l1:\r\n l+=i\r\n l1+=1\r\n else:\r\n l+=i\r\n l1+=1\r\nl1,l2=len(l),len(r)\r\nif l1==l2:\r\n print(l+\"|\"+r)\r\nelse:\r\n print(\"Impossible\")\r\n", "from sys import stdin\r\ns=stdin.readline().rstrip()\r\nn=len(s)\r\nt=stdin.readline().rstrip()\r\nc=0\r\nfor i in range(n):\r\n if s[i]==\"|\":\r\n break\r\n c+=1\r\nb=c\r\na=n-c-1\r\ntot=(b+a+len(t))\r\nif tot%2!=0:\r\n print(\"Impossible\")\r\nelif b>(tot//2) or a>(tot//2):\r\n print(\"Impossible\")\r\nelse:\r\n ans=\"\"\r\n for i in range(b):\r\n ans+=s[i]\r\n f=(tot//2)-b\r\n for i in range(f):\r\n ans+=t[i]\r\n ans+=\"|\"\r\n for i in range(n-a,n):\r\n ans+=s[i]\r\n for i in range(f,len(t)):\r\n ans+=t[i]\r\n print(ans)", "# Codeforces - Ksenia and Pan Scales\r\n# https://codeforces.com/contest/382/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 scales = input()\r\n left = scales.find('|')\r\n right = len(scales) - (left + 1)\r\n rest = input()\r\n if (len(rest) + left + right) % 2:\r\n print('Impossible')\r\n else:\r\n half = (len(rest) + left + right) // 2\r\n if left > half or right > half:\r\n print('Impossible')\r\n else:\r\n h1 = half - left\r\n s1 = scales[:left] + rest[:h1]\r\n s2 = scales[left + 1:] + rest[h1:]\r\n print(s1 + '|' + s2)\r\n\r\n\r\n", "mezan = input()\r\nba2y = list(input())\r\nleftl = \"\"\r\nrightl = \"\"\r\nleft = True\r\nx = len(mezan)-1+len(ba2y)\r\nfor i in range(len(mezan)):\r\n if mezan[i] ==\"|\":\r\n left = False\r\n continue\r\n if left:\r\n leftl += mezan[i]\r\n else:\r\n rightl += mezan[i]\r\n\r\nif x % 2 != 0 or len(leftl) > x/2 or len(rightl) > x/2:\r\n print(\"Impossible\")\r\n quit()\r\nwhile len(rightl) < x/2:\r\n rightl += ba2y.pop()\r\nwhile len(leftl) < x/2:\r\n leftl += ba2y.pop()\r\n\r\nprint(leftl+\"|\"+rightl)\r\n\r\n", "iLeft, iRight = input().split('|')\r\nrem = input()\r\n\r\nfor i in rem:\r\n if len(iLeft) < len(iRight):\r\n iLeft += i\r\n else:\r\n iRight += i\r\n\r\nif len(iLeft) != len(iRight):\r\n print('Impossible')\r\nelse:\r\n print(iLeft, '|', iRight, sep='')\r\n", "left, right = input().split('|')\r\nrem = input()\r\nfor ch in rem:\r\n if len(left) > len(right):\r\n right += ch\r\n else:\r\n left += ch\r\nif len(left) == len(right):\r\n print(left + '|' + right)\r\nelse:\r\n print('Impossible')", "a ,b = input().split('|')\r\nc = input()\r\nmaxx = max(len(a),len(b))\r\nminn = min(len(a),len(b))\r\ns = int(maxx - minn)\r\nif (len(c)<s):\r\n print('Impossible')\r\nelif ( (len(c)-s )%2 !=0):\r\n print('Impossible')\r\nelse :\r\n i = 0\r\n if (len(a)==len(b)):\r\n while (i != len(c)):\r\n a += c[i];i += 1\r\n b += c[i];i += 1\r\n if (len(a)>len(b)):\r\n while(len(a)!=len(b)):\r\n b+=c[i];i+=1\r\n while(i!=len(c)):\r\n a+=c[i];i+=1\r\n b+=c[i];i+=1\r\n if (len(a)<len(b)):\r\n while (len(a) != len(b)):\r\n a += c[i];i += 1\r\n while (i != len(c)):\r\n a += c[i]; i += 1\r\n b += c[i]; i += 1\r\n print(a+'|'+b)", "parts = input().split('|')\r\nweights = input()\r\nstack = [w for w in weights]\r\nleft, right = parts[0], parts[1]\r\n\r\ni = 0 \r\nwhile i < len(weights) and len(left) < len(right):\r\n left += stack.pop(0)\r\n i += 1\r\nwhile i < len(weights) and len(right) < len(left):\r\n right += stack.pop(0)\r\n i += 1\r\n \r\nif len(stack) % 2 == 0 and len(left) == len(right):\r\n i = 1\r\n while stack:\r\n if i == 1:\r\n left += stack.pop(0)\r\n else:\r\n right += stack.pop(0)\r\n i *= (-1)\r\n \r\n print(left + \"|\" + right)\r\nelse:\r\n print(\"Impossible\")", "s = input().split('|')\r\ny = input()\r\nt1, t2 = s[0], s[1] \r\nfor i in range(len(y)): \r\n if len(t1)>len(t2): t2+=y[i]\r\n else : t1+=y[i]\r\nif len(t1) == len(t2) : print(t1+'|'+t2) \r\nelse : print(\"Impossible\")", "list1=input()\r\nw=list(input())\r\nk=list1.index(\"|\")\r\nleft=list1[0:k]\r\nright=list1[k:]\r\nleft1=len(left)\r\nright1=len(right)-1\r\n\r\nwhile (left1<right1 and w):\r\n list1=w[0]+list1\r\n w.remove(w[0])\r\n left1+=1\r\nwhile (right1<left1 and w):\r\n list1+=w[0]\r\n w.remove(w[0])\r\n right1+=1\r\n\r\nif len(w)&1:\r\n print(\"Impossible\")\r\nelif w==[] and right1!=left1:\r\n print(\"Impossible\")\r\nelse:\r\n while (w !=[]):\r\n list1=w[0]+list1\r\n w.remove(w[0])\r\n list1+=w[0]\r\n w.remove(w[0])\r\n print(list1)\r\n", "s1,s2 = input().split(\"|\")\r\ns3 = input()\r\nm1 = len(s1)\r\nm2 = len(s2)\r\nm3 = len(s3)\r\nm4 = abs(m1-m2)\r\nif (m3-m4)>=0 and (m4-m3)%2==0:\r\n index = (m4+m3)//2\r\n if m1>m2:\r\n print(s1+s3[index:]+\"|\"+s2+s3[:index])\r\n else:\r\n print(s1+s3[:index]+\"|\"+s2+s3[index:])\r\nelse:\r\n print(\"Impossible\")\r\n ", "s = input()\nt = input()\nflag = 0\nl = ''\nr = ''\nfor i in s:\n if(i=='|'):\n flag+=1\n continue\n if(flag==0):\n l+=i\n else:\n r+=i\nll = len(l)\nlr = len(r)\nlt = len(t)\nfor i in t:\n if(len(l)<=len(r)):\n l+=i\n else:\n r+=i\nif(len(l)==len(r)):\n print(l+'|'+r)\nelse:\n print('Impossible')", "l, r = input().split(\"|\")\r\nws = input()\r\ni = 0\r\nfor w in ws:\r\n if len(l) < len(r):\r\n l += w\r\n else:\r\n r += w\r\n\r\nif len(l) == len(r):\r\n print(f\"{l}|{r}\")\r\nelse:\r\n print(\"Impossible\")", "n = input().split(\"|\")\r\nw = input()\r\nc = 0\r\n\r\nwhile c < len(w):\r\n if len(n[0]) <= len(n[1]):\r\n n[0] += w[c]\r\n else:\r\n n[1] += w[c]\r\n c += 1\r\n \r\nprint(\"|\".join(n) if len(n[0]) == len(n[1]) else \"Impossible\")", "sa = input()\r\nsb = input()\r\ns = sa.split(\"|\")\r\nres = \"\"\r\nwhile len(sb) > 0:\r\n if len(s[0]) > len(s[1]):\r\n s[1] += sb[0]\r\n else:\r\n s[0] += sb[0]\r\n sb = sb.replace(sb[0], \"\")\r\nif len(s[0]) == len(s[1]):\r\n print(\"|\".join(s))\r\nelse:\r\n print(\"Impossible\")", "x=input().split(\"|\")\r\ny=input()\r\nfor i in y:\r\n if len(x[0]) < len(x[1]):\r\n x[0] += i\r\n else:\r\n x[1] += i\r\nif len(x[1]) == len(x[0]):\r\n print(\"|\".join(x))\r\nelse:\r\n print(\"Impossible\")", "l,r = input().split(\"|\")\r\nother = input()\r\na = len(other) - abs(len(l) - len(r))\r\n\r\nif not (a > -1 and a % 2 == 0):\r\n print(\"Impossible\")\r\n exit()\r\n\r\nind = 0\r\nt = 0\r\nif len(l) > len(r):\r\n t = len(l) - len(r)\r\n r += other[:t]\r\nelse: \r\n t = len(r) - len(l)\r\n l += other[:t]\r\n\r\nx = len(other) - t\r\nl += other[t:x//2 + t]\r\nr += other[x//2 + t:]\r\nprint(\"|\".join([l,r])) \r\n\r\n\r\n", "inpt = input().split(\"|\")\r\nk = input()\r\n\r\ndiff = len(inpt[1]) - len(inpt[0])\r\nleft = len(k) - abs(diff)\r\n\r\nif left < 0 or left % 2 == 1:\r\n print(\"Impossible\")\r\nelse:\r\n if diff > 0 :\r\n inpt[0] = inpt[0] + k[:diff + left//2]\r\n inpt[1] = inpt[1] + k[diff + left//2 : ]\r\n else:\r\n inpt[1] = inpt[1] + k[: -diff + left//2]\r\n inpt[0] = inpt[0] + k[- diff + left//2 : ]\r\n print(\"|\".join(inpt))", "a, b = input().split('|')\ns = input()\nfor c in s:\n\tif len(a) < len(b):\n\t\ta += c\n\telse:\n\t\tb += c\nif len(a) == len(b):\n\tprint(a + '|' + b)\nelse:\n\tprint('Impossible')\n", "def solve(scales, weights):\r\n weights = list(weights)\r\n left, right = [list(s) for s in scales.split(\"|\")]\r\n while weights:\r\n shorter = left if len(left) <= len(right) else right\r\n shorter.append(weights.pop())\r\n if len(left) == len(right):\r\n return \"\".join(left) + \"|\" + \"\".join(right)\r\n return \"Impossible\"\r\n\r\n\r\ndef main():\r\n scales = input()\r\n weights = input()\r\n print(solve(scales, weights))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def solve(right,left,w):\n right = list(right)\n left = list(left)\n w = list(w)\n for i in w:\n if len(right) <= len(left):\n right.append(i)\n else:\n left.append(i)\n if len(right) == len(left):\n return ''.join(left)+'|'+''.join(right)\n return 'Impossible'\n\ndef main():\n left, right = list(input().split('|'))\n w = input()\n print(solve(right,left,w))\n\nmain()", "a,b=input().split('|')\r\nx=a+input()+b\r\nm=len(x)//2\r\nprint([x[:m]+'|'+x[m:], 'Impossible'][max(map(len, [a,b,x[m:]])) >m])", "x = input()\r\ny = x.split('|')\r\nz = input()\r\nz_n = [d for d in z]\r\nlit = []\r\nlist_for_w1 = [d for d in y[0]]\r\nlist_for_w2 = [d for d in y[1]]\r\nAns1 = \"\"\r\nAns2 = \"\"\r\nif (len(y[0]) + len(y[1]) + len(z))%2 != 0:\r\n print(\"Impossible\")\r\n quit()\r\nelse:\r\n l1 = len(y[0])\r\n l2 = len(y[1])\r\n \r\nfor num in list_for_w1:\r\n lit.append(num)\r\nfor dum in z_n:\r\n lit.append(dum)\r\nfor num in list_for_w2:\r\n lit.append(num)\r\n \r\n \r\n \r\nif len(lit)%2 == 0:\r\n k1 = lit[:(len(lit)//2)]\r\n k2 = lit[(len(lit)//2):]\r\nfor num in k1:\r\n Ans1 = Ans1 + num\r\nfor num in k2:\r\n Ans2 = Ans2 + num\r\nif len(Ans1) == len(Ans2) and len(lit) %2 == 0:\r\n if (len(y[0]) >= len(y[1]) and y[0] in Ans1) or (len(y[1]) >= len(y[0]) and y[1] in Ans2):\r\n print(Ans1 + \"|\" + Ans2)\r\n else:\r\n print(\"Impossible\")\r\n quit()\r\nelse:\r\n print(\"Impossible\")\r\n ", "a=input().split('|')\r\nb=str(input())\r\ny=(len(a[0])+len(a[1])+len(b))%2\r\nu=(len(a[0])+len(a[1])+len(b))//2\r\nif (y==0)and((len(a[0])<=u)and(len(a[1])<=u)):\r\n for i in range (((len(a[0])+len(a[1])+len(b))//2)-len(a[0])) :\r\n a[0]+=b[0]\r\n b=b[1:]\r\n a[1]+=b\r\n print(a[0]+'|'+a[1])\r\n \r\nelse :\r\n print('Impossible')", "def putWeight(string,weight):\r\n leftPlate = \"\"\r\n rightPlate = \"\"\r\n plate = \"L\"\r\n for i in string:\r\n if str(i) == \"|\":\r\n plate = \"R\"\r\n continue\r\n if plate == \"L\":\r\n leftPlate+=str(i)\r\n continue\r\n if plate == \"R\":\r\n rightPlate+=str(i)\r\n continue\r\n while len(weight) != 0:\r\n if len(leftPlate) > len(rightPlate):\r\n rightPlate+=weight.pop(0)\r\n continue\r\n if len(rightPlate) > len(leftPlate):\r\n leftPlate+=weight.pop(0)\r\n continue\r\n if len(rightPlate) == len(leftPlate):\r\n leftPlate+=weight.pop(0)\r\n continue\r\n if len(leftPlate) == len(rightPlate):\r\n return str(leftPlate)+\"|\"+str(rightPlate)\r\n else:\r\n return \"Impossible\"\r\n\r\nstring = str(input())\r\nweight = list(input())\r\n#nums = input().split()\r\n#items = input().split()\r\nprint(putWeight(str(string),list(weight)))\r\n", "\r\nlp, rp = input().split(\"|\")\r\nd = abs(len(lp) - len(rp))\r\nweights = input()\r\nif d == 0:\r\n if len(weights) % 2 != 0:\r\n print(\"Impossible\")\r\n else:\r\n lp += weights[:len(weights)//2]\r\n rp += weights[len(weights)//2:]\r\n s = [lp, rp]\r\n print(\"|\".join(s))\r\nelse:\r\n if abs(d - len(weights)) % 2 != 0 or d > len(weights):\r\n print(\"Impossible\")\r\n else:\r\n i = 0\r\n s = [lp, rp]\r\n ms = sorted(s, key=len)\r\n if s != ms:\r\n i = 1\r\n ms[0] += weights[:d]\r\n if d != len(weights):\r\n weights = weights[d:]\r\n ms[0] += weights[:len(weights)//2]\r\n ms[1] += weights[len(weights)//2:]\r\n if i == 1:\r\n s = ms[::-1]\r\n else:\r\n s = ms\r\n print(\"|\".join(s))", "L, R = list(map(list, input().split('|')))\r\nremaining_weight = list(input())\r\ndeficit = abs(len(L) - len(R))\r\nd = len(remaining_weight) - deficit\r\nif d < 0 or d % 2:\r\n print(\"Impossible\")\r\nelse:\r\n if len(L) < len(R):\r\n for i in range(deficit):\r\n L.append(remaining_weight.pop())\r\n elif len(R) < len(L):\r\n for i in range(deficit):\r\n R.append(remaining_weight.pop())\r\n flag = True\r\n for weight in remaining_weight:\r\n if flag:\r\n L.append(weight)\r\n else:\r\n R.append(weight)\r\n flag = not flag\r\n print(''.join(L)+ '|' + ''.join(R))\r\n\r\n\r\n ", "l=len;i=input;s,t=i().split('|');x=i()\r\nfor c in x:\r\n if l(s)<l(t):s+=c\r\n else: t+=c\r\nprint([s+'|'+t,'Impossible'][l(t)!=l(s)])", "s = input()\r\nstrn = s.split('|')\r\nt = input()\r\nfirst,second = len(strn[0]),len(strn[1])\r\nlt = len(t)\r\nadd = first+second\r\nmaxi = 0\r\nif first>second:\r\n maxi = first\r\nelse:\r\n maxi = second\r\nmini = add-maxi\r\ndiff2 = maxi-mini\r\nif lt<diff2:\r\n print('Impossible')\r\nelse:\r\n lt -= diff2\r\n if lt%2==0:\r\n up = lt//2\r\n if first>second:\r\n s = t[:up] + s + t[up:]\r\n else:\r\n s = t[up:] + s + t[:up]\r\n print(s)\r\n else:\r\n print('Impossible')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri May 24 18:25:16 2019\r\n\r\n@author: SANDEEP GHANTA\r\n\"\"\"\r\nx,y=input().split(\"|\")\r\nextra=input()\r\nl=len(x)\r\nr=len(y)\r\ne=len(extra)\r\nif l>r:\r\n greater=x\r\n small=y\r\nelse:\r\n greater=y\r\n small=x \r\nif len(greater)-len(small)<=e:\r\n bal= e-(len(greater)-len(small))\r\n if bal%2==0:\r\n g=bal/2\r\n s=(len(greater)-len(small))+bal/2\r\n g_str=greater+extra[:int(g)]\r\n s_str=small+extra[int(g):]\r\n if greater==x:\r\n print(g_str+\"|\"+s_str)\r\n else:\r\n print(s_str+\"|\"+g_str) \r\n\r\n else:\r\n print(\"Impossible\")\r\nelse:\r\n print(\"Impossible\") ", "s1=list(input())\r\ns2=list(input())\r\nk1=0\r\nk2=0\r\nl1=[]\r\nl2=[]\r\nf=0\r\nfor i in range(len(s1)):\r\n\tif(s1[i]=='|'):\r\n\t\tf=1\r\n\telif(f==0):\r\n\t\tk1=k1+1\r\n\t\tl1.append(s1[i])\r\n\telif(f==1):\r\n\t\tk2=k2+1\r\n\t\tl2.append(s1[i])\r\nk3=len(s2)\r\nr=abs(k2-k1)\r\nk3=k3-r\r\nif(k3%2==0 and k3>=0):\r\n\tc1=0\r\n\tc2=0\r\n\tif(k1>=k2 and r>0):\r\n\t\tfor i in range(r):\r\n\t\t\tl2.append(s2[i])\r\n\t\t\tc1=c1+1\r\n\telse:\r\n\t\tfor i in range(r):\r\n\t\t\tl1.append(s2[i])\r\n\t\t\tc2=c2+1\r\n\tf=0\r\n\tfor j in range(max(c1,c2),len(s2)):\r\n\t\tif(f==0):\r\n\t\t\tl1.append(s2[j])\r\n\t\t\tf=1\r\n\t\telse:\r\n\t\t\tl2.append(s2[j])\r\n\t\t\tf=0\r\n\tm=[*l1,'|',*l2]\r\n\tprint(\"\".join(m))\r\n\r\nelse:\r\n\tprint('Impossible')\r\n", "s = input()\r\nremain = input()\r\ntwo = False\r\nleft = \"\"\r\nright = \"\"\r\nfor x in s:\r\n if(x == '|'):\r\n two = True\r\n continue\r\n if(two == False):\r\n left += x\r\n else:\r\n right += x\r\nall_number = len(left) + len(right) + len(remain)\r\nsame_number = all_number // 2\r\nif(all_number % 2 == 0 and same_number >= len(left) and len(left) + len(remain) >= same_number):\r\n for x in remain:\r\n if(same_number > len(left)):\r\n left += x\r\n else:\r\n right += x\r\n print(left + '|' + right)\r\nelse:\r\n print(\"Impossible\")\r\n ", "s=list(input().split(\"|\"))\nl=len(s[0].strip())\nr=len(s[1].strip())\ns0=list(s[0])\ns1=list(s[1])\nlover=list(input())\nlo=len(lover)\ndif=abs(l-r)\nif(lo>=dif):\n lo=lo-dif\n if(l<r):\n s0.extend(lover[:dif])\n else:\n s1.extend(lover[:dif])\n \n if(lo%2==0):\n s0.extend(lover[dif:(dif+(lo//2))])\n s1.extend(lover[(dif+(lo//2)):])\n\n print(\"\".join(s0)+\"|\"+\"\".join(s1))\n else:\n print(\"Impossible\")\nelse:\n print(\"Impossible\")\n", "s = input()\r\nr = input()\r\nlr = len(r)\r\na,b = map(str, s.split(\"|\"))\r\nla = len(a)\r\nlb = len(b)\r\nfor let in r:\r\n if min(la,lb) == la:\r\n la+=1\r\n a = a + let\r\n else:\r\n lb+=1\r\n b = b + let\r\n\r\nif lb == la:\r\n print(a,\"|\",b,sep=\"\")\r\nelse:\r\n print(\"Impossible\")", "word=input()\r\nweights=input()\r\nword=list(word)\r\nn=len(word)\r\ni=word.index('|')\r\nleft=word[:i]\r\nnleft=len(left)\r\nright=word[(i+1):]\r\nnright=len(right)\r\nfor i in range(len(weights)):\r\n if nleft < nright:\r\n nleft+=1\r\n left.append(weights[i])\r\n elif nright < nleft:\r\n nright += 1\r\n right.append(weights[i])\r\n else:\r\n nleft+=1\r\n left.append(weights[i])\r\nif nleft==nright:\r\n final=left+['|']+right\r\n print(''.join(final))\r\nelse:\r\n print('Impossible')", "left,right = input().split(\"|\")\r\nreserve = input()\r\nfor c in reserve:\r\n if len(left) < len(right):\r\n left += c\r\n else:\r\n right += c\r\nif len(left) == len(right):\r\n print(left+\"|\"+right)\r\nelse:\r\n print(\"Impossible\")\r\n\r\n \r\n\r\n", "first = input()\r\nsecond = input()\r\n\r\nright = \"\"\r\nleft = \"\"\r\n\r\nfor (idx, letter) in enumerate(first):\r\n if(letter == '|'):\r\n right = first [idx + 1:]\r\n break\r\n else:\r\n left = left + letter\r\n\r\nsizeSecond = len(second)\r\n\r\ni=0\r\nwhile(sizeSecond > 0):\r\n if (len(left) > len(right)):\r\n right = right + second[i]\r\n i+=1\r\n sizeSecond-=1\r\n elif (len(right) > len(left)):\r\n left = left + second[i]\r\n i+=1\r\n sizeSecond-=1\r\n else:\r\n if (sizeSecond % 2 == 0):\r\n right = right + second[i]\r\n left = left + second[i+1]\r\n i += 2\r\n sizeSecond -= 2\r\n\r\nif(sizeSecond == 0 and len(left) == len(right)):\r\n print(left + '|' + right)\r\nelse:\r\n print(\"Impossible\")\r\n ", "scales = input().split('|')\r\nweights = list(input())\r\n\r\nbalance = len(scales[0]) - len(scales[1])\r\n\r\nwhile weights:\r\n if len(scales[0]) < len(scales[1]):\r\n scales[0] += weights[0]\r\n weights.pop(0)\r\n else:\r\n scales[1] += weights[0]\r\n weights.pop(0)\r\n balance = len(scales[0]) - len(scales[1])\r\n\r\nif balance == 0:\r\n print('|'.join(scales))\r\nelse:\r\n print('Impossible')\r\n\r\n\r\n", "import sys\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n\tread: Callable[[], str] = sys.stdin.readline\r\n\tleft, right = read().strip().split('|')\r\n\tdiff: int = abs(len(left) - len(right))\r\n\tremaining_words = read().strip()\r\n\tremaining: int = len(remaining_words)\r\n\r\n\tif remaining < diff:\r\n\t\tprint('Impossible')\r\n\t\treturn\r\n\tremaining -= diff\r\n\tif remaining % 2 != 0:\r\n\t\tprint('Impossible')\r\n\t\treturn\r\n\r\n\tsmaller: str = left if len(left) < len(right) else right\r\n\tbigger: str = left if len(left) >= len(right) else right\r\n\tsmaller_is_left = True if len(left) < len(right) else False\r\n\r\n\tsmaller += remaining_words[:diff]\r\n\tif remaining:\r\n\t\tremaining_words = remaining_words[diff:]\r\n\t\tsmaller += remaining_words[:remaining // 2]\r\n\t\tbigger += remaining_words[remaining // 2:]\r\n\r\n\tleft = smaller if smaller_is_left else bigger\r\n\tright = bigger if smaller_is_left else smaller\r\n\r\n\tprint(f'{left}|{right}')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "def check(l, r):\r\n if len(left_scale) == len(right_scale):\r\n print(''.join(left_scale)+'|'+''.join(right_scale))\r\n else:\r\n print('Impossible')\r\n\r\nif __name__ == \"__main__\":\r\n\r\n l = list(map(str, input().rstrip()))\r\n delimiter = l.index('|')\r\n # [0, 1, 2, 3, 4]\r\n # slicing to left lsit and to right list\r\n left_scale = l[:delimiter]\r\n right_scale = l[delimiter+1:]\r\n\r\n weight = list(map(str, input().rstrip()))\r\n\r\n\r\n # check which is weight more\r\n for i in weight:\r\n if len(left_scale) > len(right_scale):\r\n right_scale.append(i)\r\n # check(left_scale, right_scale)\r\n else:\r\n left_scale.append(i)\r\n # check(left_scale, right_scale)\r\n \r\n check(left_scale, right_scale)", "def solve():\r\n s = input().split('|')\r\n\r\n l, r = len(s[0]), len(s[1])\r\n imbalance = abs(l-r)\r\n\r\n t = input()\r\n remaining = len(t)\r\n\r\n if remaining < imbalance:\r\n return \"Impossible\"\r\n \r\n if l > r:\r\n s[1] += t[:imbalance]\r\n else:\r\n s[0] += t[:imbalance]\r\n \r\n still_remaining = t[imbalance:]\r\n u = len(still_remaining)\r\n if u&1:\r\n return \"Impossible\"\r\n s[0] += still_remaining[:u//2]\r\n s[1] += still_remaining[u//2:]\r\n\r\n \r\n return s[0]+\"|\"+s[1]\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(solve())", "n, k = map(str, input().split(\"|\"))\nl = input()\na = n + l + k\n\n\nif ((len(n)-len(k)) % 2) != (len(l) % 2) or abs(len(n) - len(k)) > len(l):\n print(\"Impossible\")\n\nelse:\n print(f\"{a[:int(len(a) / 2)]}|{a[int(len(a) / 2):]}\")\n\n", "s = input().split('|')\r\nd = input()\r\n\r\nfor item in d:\r\n if (len(s[0]) < len(s[1])):\r\n s[0] += item\r\n else:\r\n s[1] += item\r\nif (len(s[0]) == len(s[1])):\r\n print(s[0] + \"|\" + s[1])\r\n\r\nelse:\r\n print(\"Impossible\")\r\n", "if __name__ == \"__main__\":\r\n\tsequence = str(input()).split('|')\r\n\tw = str(input())\r\n\tfirst = sequence[0]\r\n\tsecond = sequence[1]\r\n\tfor i in w:\r\n\t\tif len(first) < len(second):\r\n\t\t\tfirst = first + i\r\n\t\telse:\r\n\t\t\tsecond = second + i\r\n\tif len(first) == len(second):\r\n\t\tprint('{}|{}'.format(first, second))\r\n\telse:\r\n\t\tprint('Impossible')\r\n\r\n", "L, R = input().split(\"|\")\r\nN = input()\r\ntotal = len(L) + len(R) + len(N)\r\nif total % 2 == 1 or max(len(L),len(R)) > total // 2:\r\n print(\"Impossible\")\r\nelse:\r\n all = L + N + R\r\n print(all[:total//2] + '|' + all[total//2:])", "from sys import setrecursionlimit, exit, stdin\nfrom math import ceil, floor, acos, pi\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom fractions import gcd\nfrom functools import reduce\nimport itertools\nsetrecursionlimit(10**7)\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-6\nMAX=1000\n#################################################\nA, B = RS('|')\ns=RS()[0]\nd=len(A)-len(B)\nif abs(d)%2 != len(s)%2 or abs(d)>len(s):\n print(\"Impossible\")\nelse:\n \n if d<0:\n d=-d\n i=d+(len(s)-d)//2\n A=A+s[:i]\n B=B+s[i:]\n else:\n i=d+(len(s)-d)//2\n B=B+s[:i]\n A=A+s[i:]\n print(A+'|'+B)\n\n\n \n", "s = input()\nt = input()\nl,p = s.split('|')\ndl,dp,dt = len(l),len(p),len(t)\nx = abs(dl-dp)\nif x > dt :\n\tprint(\"Impossible\")\nelse:\n\ty = dt - x\n\tif y%2 == 1:\n\t\tprint(\"Impossible\")\n\telse:\n\t\ty//=2\n\t\txx = t[:(x+y)]\n\t\tyy = t[(x+y):]\n\t\tif dl < dp:\n\t\t\tl = l+xx\n\t\t\tp = p+yy\n\t\telse :\n\t\t\tp = p+xx\n\t\t\tl = l+yy\n\t\tprint(l,'|',p,sep=\"\")\n", "scale = input().split('|')\r\nuntouched_weight = list(input())\r\nleft_scale = list(scale[0])\r\nright_scale = list(scale[1])\r\n\r\nfor x in untouched_weight:\r\n switch = 'r' if len(left_scale) > len(right_scale) else 'l'\r\n if switch == 'r':\r\n right_scale.append(x)\r\n else:\r\n left_scale.append(x)\r\n\r\nprint(\"\".join(left_scale) + \"|\" + \"\".join(right_scale) if len(left_scale) == len(right_scale) else 'Impossible')\r\n", "# coding: utf-8\nleft, right = [list(i) for i in input().split('|')]\nfor i in input():\n if len(left)>len(right):\n right.append(i)\n else:\n left.append(i)\nif len(left) == len(right):\n print(''.join(left)+'|'+''.join(right))\nelse:\n print('Impossible')\n", "l,r=input().split('|')\nm=input()\n\nll=len(l)\nlr=len(r)\n\nimp=False\nif ll > lr:\n if len(m)>=ll-lr:\n r+=m[:ll-lr]\n m=m[ll-lr:]\n else:\n imp=True\nelse:\n if len(m)>=lr-ll:\n l+=m[:lr-ll]\n m=m[lr-ll:]\n else:\n imp=True\n\nif len(m):\n if len(m)&1==0:\n while m:\n l+=m[0]\n r+=m[1]\n m=m[2:]\n else:\n imp=True\n\nprint(\"{}|{}\".format(l, r) if not imp else 'Impossible')\n", "def f(scales, weights):\r\n for i in weights:\r\n if len(scales[0]) > len(scales[1]):\r\n scales[1]+=i\r\n else:\r\n scales[0]+=i\r\n return \"|\".join(scales) if len(scales[0]) == len(scales[1]) else \"Impossible\"\r\n\r\n\r\n\r\n\r\n\r\nscales = input().split(\"|\")\r\nweights = input()\r\nprint(f(scales, weights))\r\n", "import math\r\n\r\nline = input().split('|')\r\nn = input()\r\nl = len(line[0]) + len(line[1]) + len(n)\r\n\r\n\r\nleft, right = 0, 0\r\ncomp = math.ceil((len(line[0]) + len(line[1]) + len(n)) / 2)\r\ncount = 0\r\nfor i in range(comp):\r\n if len(line[0]) != comp and count < len(n):\r\n line[0] += n[count]\r\n count += 1\r\n else:\r\n break\r\nfor i in range(comp):\r\n if len(line[1]) != comp and count < len(n):\r\n line[1] += n[count]\r\n count += 1\r\n else:\r\n break\r\n\r\nif len(line[0]) != len(line[1]):\r\n print('Impossible')\r\nelse:\r\n print('{}|{}'.format(line[0], line[1]))\r\n\r\n\r\n\r\n\r\n", "left, right = input().split('|')\r\n\r\navailable = input()\r\n\r\nfor i in available:\r\n if len(left) > len(right):\r\n right += i\r\n else:\r\n left += i\r\n\r\nif len(left) == len(right):\r\n print(left+'|'+right)\r\nelse:\r\n print('Impossible')", "x=input().split('|')\r\nx[0]=list(x[0])\r\nx[1]=list(x[1])\r\nv=list(input())\r\nif len(x[0])>len(x[1]):\r\n z=len(x[0])-len(x[1])\r\nelse:\r\n z=len(x[1])-len(x[0])\r\nif (len(v)-z)%2==0 and (len(v)-z)>=0:\r\n for c in range(len(v)):\r\n #if z!=0:\r\n if len(x[0])>len(x[1]):\r\n x[1].append(v[c])\r\n elif len(x[0])<len(x[1]): \r\n x[0].append(v[c])\r\n else:\r\n if c %2==0:\r\n x[0].append(v[c])\r\n else:\r\n x[1].append(v[c]) \r\n b=x[0]+x[1]\r\n b.insert(int(len(b)/2),'|')\r\n b=''.join(map(str,b))\r\n print(b)\r\nelse:\r\n print('Impossible')", "x,y=input().split(\"|\"),input()\r\nfor i in y:\r\n if len(x[0]) < len(x[1]): x[0] += i\r\n else: x[1] += i\r\nprint(\"|\".join(x) if len(x[1])==len(x[0]) else \"Impossible\")", "string = input().split(\"|\")\r\nchar = list(input())\r\n\r\ns1 = list(string[0])\r\ns2 = list(string[1])\r\n\r\ncharLen = len(char)\r\n\r\nlen1 = len(s1)\r\nlen2 = len(s2)\r\n\r\nif abs(len1-len2) > charLen:\r\n print(\"Impossible\")\r\nelse:\r\n if abs(len1-len2) % 2 == 0 and charLen % 2 == 0:\r\n while len(s1) < len(s2):\r\n s1.append(char.pop())\r\n while len(s2) < len(s1):\r\n s2.append(char.pop())\r\n while len(char):\r\n s1.append(char.pop())\r\n s2.append(char.pop())\r\n print(f\"{''.join(s1)}|{''.join(s2)}\")\r\n\r\n\r\n elif abs(len1-len2) % 2 == 1 and charLen % 2 == 1:\r\n while len(s1) < len(s2):\r\n s1.append(char.pop())\r\n while len(s2) < len(s1):\r\n s2.append(char.pop())\r\n while len(char):\r\n s1.append(char.pop())\r\n s2.append(char.pop())\r\n print(f\"{''.join(s1)}|{''.join(s2)}\")\r\n\r\n else:\r\n print(\"Impossible\")\r\n", "s = input()\r\nt = input()\r\nk = s.split(\"|\")\r\nfor i in range(len(t)):\r\n if len(k[0])>=len(k[1]):\r\n k[1] = k[1] + t[i]\r\n else:\r\n k[0] = k[0] + t[i]\r\nif len(k[0]) != len(k[1]):\r\n print('Impossible')\r\nelse:\r\n print(k[0] + '|' + k[1])\r\n\r\n ", "s = input()\r\nseq = input()\r\n\r\nleft, right = s.split('|')\r\nl1 = len(left)\r\nl2 = len(right)\r\n\r\nl = 0\r\n\r\nif len(left) < len(right):\r\n while len(left) < len(right) and l < len(seq):\r\n left += seq[l]\r\n l += 1\r\n\r\n\r\n while l < len(seq):\r\n if l < len(seq):\r\n left += seq[l]\r\n l += 1\r\n\r\n if l < len(seq):\r\n right += seq[l]\r\n l += 1\r\n\r\n if len(left) == len(right):\r\n print(left +\"|\" + right)\r\n else:\r\n print('Impossible')\r\n\r\n\r\nelif len(left) > len(right):\r\n while len(left) > len(right) and l < len(seq):\r\n right += seq[l]\r\n l += 1\r\n\r\n while l < len(seq):\r\n if l < len(seq):\r\n left += seq[l]\r\n l += 1\r\n\r\n if l < len(seq):\r\n right += seq[l]\r\n l += 1\r\n\r\n if len(left) == len(right):\r\n print(left + \"|\" + right)\r\n else:\r\n print('Impossible')\r\nelse:\r\n if l1 == l2 and len(seq) % 2 != 0:\r\n print('Impossible')\r\n else:\r\n while l < len(seq):\r\n if l < len(seq):\r\n left += seq[l]\r\n l += 1\r\n\r\n if l < len(seq):\r\n right += seq[l]\r\n l += 1\r\n\r\n if len(left) == len(right):\r\n print(left + \"|\" + right)\r\n else:\r\n print('Impossible')\r\n\r\n\r\n\r\n", "a,aa = map(str,input().split(\"|\"))\r\nb = input()\r\nfor c in b:\r\n if(len(a)>len(aa)):\r\n aa+=c\r\n else:a+=c\r\nla=len(a)\r\nlaa=len(aa)\r\nif(la==laa):print(a+\"|\"+aa)\r\nelse:print(\"Impossible\")", "x1,x2=input().split(\"|\")\r\ny=input()\r\nfor i in y:\r\n if len(x1) < len(x2):\r\n x1+=i\r\n else:\r\n x2+=i\r\nprint(x1+\"|\"+x2 if len(x1)==len(x2) else \"Impossible\")", "from math import fabs\r\nls, ly = map(str, input().split('|'))\r\ninp = input()\r\nif len(inp) < fabs(len(ls)-len(ly)):\r\n print('Impossible')\r\nelif (len(inp) - fabs(len(ls)-len(ly)) )% 2 != 0:\r\n print('Impossible')\r\nelse:\r\n ls = list(ls)\r\n ly = list(ly)\r\n inp = list(inp)\r\n for i in inp:\r\n if len(ls) > len(ly):\r\n ly.append(i)\r\n else:\r\n ls.append(i)\r\n out = ls\r\n out.append('|')\r\n out += ly\r\n print(*out, sep='')\r\n", "a = input()\r\nb = input()\r\nprelom = 0\r\nfor i in range(len(a)):\r\n if a[i] == '|':\r\n prelom = i\r\npred = len(a[:prelom])\r\npo = len(a[prelom+1:])\r\nlava = a[:prelom]\r\nprava = a[prelom+1:]\r\nwhile b:\r\n if pred > po:\r\n po += 1\r\n prava += b[-1]\r\n b = b[:-1]\r\n elif pred < po:\r\n pred += 1\r\n lava += b[-1]\r\n b = b[:-1]\r\n else:\r\n prava += b[-1]\r\n b = b[:-1]\r\n po += 1\r\n if b:\r\n lava += b[-1]\r\n b = b[:-1]\r\n pred += 1\r\nif pred == po:\r\n print(lava + '|' + prava)\r\nelse:\r\n print('Impossible')", "#!/usr/local/bin/python3.3 -tt\n\nimport sys\n\nif __name__ == '__main__':\n s, t = (next(sys.stdin).strip(),\n next(sys.stdin).strip(),\n )\n u = s.split('|')\n for i in range(len(t) + 1):\n v = (u[0] + t[:i],\n u[1] + t[i:],\n )\n if len(v[0]) == len(v[1]):\n print('%s|%s' % v)\n break\n else:\n print('Impossible');\n", "l=[ele for ele in input().split('|')]\r\ns=input()\r\nfor i in range(0,len(s)):\r\n left,right=len(l[0]),len(l[1])\r\n if left>right:l[1]+=s[i]\r\n elif right>left:l[0]+=s[i]\r\n else:l[0]+=s[i]\r\nif len(l[0])!=len(l[1]):print('Impossible')\r\nelse:\r\n opt=''\r\n l.insert(1,'|')\r\n for e in l:\r\n opt+=e\r\n print(opt)", "def yzd_solution(intial, weights):\r\n \r\n\r\n intial_left = intial[0:intial.index('|')]\r\n intial_right = intial[intial.index('|')+1:]\r\n\r\n while len(weights):\r\n if (len(intial_left) < len(intial_right)):\r\n intial_left.append(weights[0])\r\n weights.pop(0)\r\n else:\r\n intial_right.append(weights[0])\r\n weights.pop(0)\r\n\r\n\r\n if len(intial_left) == len(intial_right):\r\n print(\"\".join(intial_left) + \"|\" + \"\".join(intial_right))\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\n\r\nintial = [char for char in input()]\r\nweights = [char for char in input()]\r\nyzd_solution(intial, weights)", "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\n#import math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef solve():\r\n s = input()\r\n t = input()\r\n l = ''; r = ''; half = False\r\n for i in s:\r\n if i == '|':\r\n half = True\r\n elif half:\r\n r += i\r\n else:\r\n l += i\r\n for i in t:\r\n if len(l) <= len(r):\r\n l += i\r\n else:\r\n r += i\r\n if len(l) != len(r):\r\n return f\"Impossible\"\r\n else:\r\n return f\"{l}|{r}\"\r\n\r\ndef main():\r\n stdout.write(solve())\r\n\r\nmain()", "string=input()\nras=input()\nindex=string.find('|')\nch1=string[0:index]\nch2=string[index+1:len(string)]\ndelt=len(ch1)-len(ch2)\nflag=1\nif delt<0:\n flag=0\n delt=-delt\nchet=len(ras)-delt\nif (chet%2==0) and (chet>=0):\n if flag:\n ch1=ch1+ras[0:int(chet/2)]\n ch2=ch2+ras[int(chet/2):len(ras)]\n else:\n ch2=ch2+ras[0:int(chet/2)]\n ch1=ch1+ras[int(chet/2):len(ras)]\n print(ch1+'|'+ch2)\nelse:\n print('Impossible')\n", "s = input()\r\np = input()\r\nleft = s.find('|')\r\nright = len(s) - left - 1\r\nn = len(p)\r\nif(left == right and n%2 == 0):\r\n print(s[:left] + p[:int(n/2)] + s[left:] + p[int(n/2):])\r\nelif(left != right):\r\n k = abs(left-right)\r\n if(k%2 != n%2): print(\"Impossible\")\r\n elif(k > n): print(\"Impossible\")\r\n else:\r\n if(left < right):\r\n print(s[:left] + p[:k+int((n-k)/2)] + s[left:] + p[k+int((n-k)/2):])\r\n else:\r\n print(s[:left] + p[k+int((n-k)/2):] + s[left:] + p[:k+int((n-k)/2)])\r\nelse:\r\n print(\"Impossible\")", "import math\r\n\r\n\r\nn = input()\r\ns = input()\r\n\r\nmid = n.index('|')\r\n\r\nl = len(s) + len(n) - 1\r\n\r\nnews = \"\"\r\nt = int(l/2)\r\nnews += n[:mid]\r\nnews += s[:t-mid]\r\nnews += \"|\"\r\nnews += n[mid+1:len(n)]\r\nnews += s[t-mid:]\r\n\r\nmid = news.index('|')\r\nif mid != t or l%2!=0:\r\n print(\"Impossible\")\r\nelse:\r\n print(news)\r\n\r\n\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left, insort_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\nfrom random import shuffle\r\n\r\ns = input().split(\"|\")\r\nrems = list(input())\r\nleft = s[0]\r\nright = s[1]\r\n\r\nwhile rems:\r\n char = rems.pop()\r\n if len(left) < len(right):\r\n left += char\r\n else:\r\n right += char\r\n\r\nif len(left) != len(right):\r\n print(\"Impossible\")\r\nelse:\r\n print(left+\"|\"+right)\r\n\r\n\r\n\r\n", "a, b = input().split('|')\r\nnew = input()\r\n\r\nfor char in new:\r\n\tif len(a) < len(b):\r\n\t\ta+=char\r\n\telse:\r\n\t\tb+=char\r\n\r\nif len(a) == len(b):\r\n\tprint(a+\"|\"+b)\r\nelse:\r\n\tprint(\"Impossible\")", "string = input().split(\"|\")\r\ns = [len(x) for x in string]\r\nt = input()\r\nif (s[0] + s[1] + len(t)) % 2:\r\n print(\"Impossible\")\r\n exit()\r\nmid = (s[0] + s[1] + len(t)) // 2\r\nif not (s[0] <= mid and s[1] <= mid):\r\n print(\"Impossible\")\r\n exit()\r\nstring[0] += t[:mid - s[0]]\r\nstring[1] += t[mid - s[0]:]\r\nprint(string[0] + \"|\" + string[1])\r\n", "def solve():\r\n left, right = input().split('|')\r\n b = input()\r\n diff = abs(len(left) - len(right)) \r\n if not(len(b) >= diff and (len(b) - diff) % 2 == 0): return 'Impossible'\r\n each_len = (len(left) + len(right) + len(b))//2\r\n missing = abs(len(left)-each_len)\r\n return f\"{''.join(left + b[:missing])}|{''.join(right + b[missing:])}\"\r\nprint(solve())", "s = str(input())\r\ns2 = str(input())\r\na,b = s.split(\"|\")\r\norigLeft = len(a)\r\norigRight = len(b)\r\nmaxlen = max(origLeft,origRight)\r\nif( ( min(origLeft,origRight) + len(s2) ) < maxlen ):\r\n print(\"Impossible\")\r\nelif( ( min(origLeft,origRight) + len(s2) ) == maxlen ):\r\n if origLeft>origRight:\r\n b+=s2\r\n print(a+\"|\"+b)\r\n else:\r\n a+=s2\r\n print(a+\"|\"+b)\r\nelse:\r\n #print(\"in else\")\r\n f=0\r\n minn=0\r\n fr=\"\"\r\n other=0\r\n if origLeft>origRight:\r\n fr=\"b\"\r\n minn = len(b)\r\n other = len(a)\r\n else:\r\n fr=\"a\"\r\n minn = len(a)\r\n other = len(b)\r\n minn+=len(s2)\r\n if fr==\"b\":\r\n while minn>origRight:\r\n minn-=1\r\n other+=1\r\n if(minn==other):\r\n print(a+s2[0:other-origLeft]+\"|\"+b+s2[other-origLeft:])\r\n f=1\r\n break\r\n if f==0:\r\n print(\"Impossible\")\r\n elif fr==\"a\":\r\n while minn>origLeft:\r\n minn-=1\r\n other+=1\r\n if(minn==other):\r\n print(a+s2[0:other-origLeft]+\"|\"+b+s2[other-origLeft:])\r\n f=1\r\n break\r\n if f==0:\r\n print(\"Impossible\")\r\n ", "left, right = input().split('|')\r\ns = input()\r\n\r\ntotal = len(left) + len(right) + len(s)\r\nif total % 2 != 0 or len(left) > total // 2 or len(right) > total // 2:\r\n print('Impossible')\r\nelse:\r\n k = total // 2 - len(left)\r\n left = left + s[:k]\r\n right = right + s[k:]\r\n print(left, '|', right, sep='')\r\n", "str1 = list(input())\r\nstr2 = list(input())\r\n\r\nleft = []\r\nright = []\r\n\r\nfound_sperator = False\r\n\r\nfor i in str1:\r\n if i != '|' and not found_sperator:\r\n left.append(i)\r\n elif i == '|':\r\n found_sperator = True\r\n else:\r\n right.append(i)\r\n\r\nfor i in str2:\r\n if len(left) < len(right):\r\n left.append(i)\r\n else:\r\n right.append(i)\r\n\r\nif len(left) != len(right):\r\n print(\"Impossible\")\r\nelse:\r\n print(*left, \"|\", *right, sep= \"\")", "# Problem A\r\nimport sys, functools, string\r\ninput = lambda: sys.stdin.readline()[:-1]\r\nget_int = lambda: int(input())\r\nget_int_list = lambda: list(map(int,input().split()))\r\n\r\ndef solve(s,remain):\r\n s1,s2 = s.split(\"|\")\r\n if (len(s1)+len(s2)+len(remain)) % 2 == 1:\r\n return \"Impossible\"\r\n elif len(s1) + len(remain) < len(s2) or len(s2) + len(remain) < len(s1):\r\n return \"Impossible\"\r\n for char in remain:\r\n if len(s1) < len(s2):\r\n s1 = s1 + char\r\n else:\r\n s2 = s2 + char\r\n return s1 + \"|\" + s2\r\n\r\nprint(solve(input(),input()))\r\n", "s = input().split('|')\r\nc = input()\r\nq = len(s[0]) + len(s[1]) + len(c)\r\nif q % 2 != 0:\r\n\tprint('Impossible')\r\nelse:\r\n\tif len(s[0]) * 2 > q or len(s[1]) * 2 > q:\r\n\t\tprint('Impossible')\r\n\telse:\r\n\t\tprint(s[0] + c[:(q // 2 - len(s[0]))], end = '|')\r\n\t\tprint(s[1] + c[(q // 2 - len(s[0])):])\r\n", "a,b=input().split('|')\r\nc=input()\r\nt=abs(len(a)-len(b))\r\nC=len(c)\r\nif(C-t)%2 or C<t:print('Impossible');exit()\r\nwhile len(a)<len(b):a+=c[0];c=c[1:]\r\nwhile len(b)<len(a):b+=c[0];c=c[1:]\r\nprint(a+c[::2]+'|'+b+c[1::2])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 26 16:39:12 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 76 - CF382-DIV2A\r\n\"\"\"\r\n\r\nlscale,rscale = map(str,input().split(\"|\"))\r\nrem = str(input())\r\nneeded = abs(len(lscale)-len(rscale))\r\nif len(rem) >= needed and (len(rem)+len(rscale)+len(lscale))%2 == 0:\r\n oneach = (len(rem)+len(rscale)+len(lscale))//2\r\n ptr = 0\r\n for i in range(len(lscale),oneach):\r\n lscale += rem[ptr]\r\n ptr += 1\r\n for i in range(len(rscale), oneach):\r\n rscale += rem[ptr]\r\n ptr += 1\r\n print(lscale + \"|\" + rscale)\r\nelse:\r\n print(\"Impossible\") ", "scale = input()\r\nrem = list(input())\r\nctr = scale.index('|')\r\nif ctr == 0:\r\n left = []\r\n right = scale[ctr+1:] if len(scale) > 1 else []\r\nelif ctr == len(scale) - 1:\r\n right = []\r\n if ctr == 0:\r\n left = []\r\n else:\r\n left = scale[:ctr]\r\nelse:\r\n left = scale[:ctr]\r\n right = scale[ctr+1:]\r\n\r\ndiff = len(left) - len(right)\r\n\r\nif diff % 2 != len(rem) % 2:\r\n print('Impossible')\r\n exit()\r\nelse:\r\n try:\r\n if diff > 0:\r\n for _ in range(diff):\r\n right += rem.pop()\r\n elif diff < 0:\r\n for _ in range(-diff):\r\n left += rem.pop()\r\n while rem:\r\n left += rem.pop()\r\n right += rem.pop()\r\n except:\r\n print('Impossible')\r\n exit()\r\n\r\nres = ''.join(left) + '|' + ''.join(right)\r\nprint(res)\r\n", "scales = input()\ns = input()\n\nn = len(s)\nleft = 0\nright = 0\nis_filling_left = 1\n\nfor i in range(len(scales)):\n if is_filling_left:\n if scales[i] == \"|\":\n is_filling_left = 0\n continue\n left += 1\n else:\n right += 1\n\nleft_part = \"\"\nwhile n > 0:\n if left < right:\n left += 1\n left_part += s[n-1]\n else:\n right += 1\n scales += s[n-1]\n\n n -= 1\n\nif left == right:\n print(left_part + scales)\nelse:\n print(\"Impossible\")\n\t \t\t\t\t \t \t\t\t \t\t \t \t\t\t \t", "a = list(input().split('|'))\r\ns = list(input())\r\nflag = False\r\nif len(a[0]) > len(a[1]):\r\n a[0], a[1] = a[1], a[0]\r\n flag = True\r\nwhile len(a[0]) != len(a[1]) and len(s) != 0:\r\n a[0] += s[-1]\r\n s.pop()\r\nif len(a[0]) != len(a[1]) or len(s) % 2 != 0:\r\n print(\"Impossible\")\r\n exit()\r\nfor i in range(len(s)):\r\n if i % 2 == 0:\r\n a[0] += s[i]\r\n else:\r\n a[1] += s[i]\r\nif flag:\r\n print(a[1] + '|' + a[0])\r\nelse:\r\n print(a[0] + '|' + a[1])", "s=input()\r\ni=s.index(\"|\")\r\nh=input()\r\nleft=i\r\nright=len(s)-left\r\nright-=1\r\n\r\nif(abs(left-right)>len(h) or (len(h)-abs(left-right))%2==1):\r\n print(\"Impossible\")\r\nelse:\r\n for i in range(len(h)):\r\n if(left>right):\r\n s+=h[i]\r\n right+=1\r\n else:\r\n s=h[i]+s\r\n left+=1\r\n print(s)\r\n", "myStr = input()\r\ntarget = input()\r\nleft , right = myStr[ : myStr.index(\"|\")] , myStr[myStr.index(\"|\") + 1: ]\r\nif len(left) == len(right):\r\n if len(target) % 2 != 0 :\r\n print(\"Impossible\")\r\n else :\r\n temp = True\r\n for i in target :\r\n if temp == True :\r\n left+=i\r\n temp = False\r\n else :\r\n right+=i\r\n temp = True\r\n left+= \"|\"\r\n print(left + right)\r\n\r\nelse :\r\n for i in range(len(target)):\r\n if len(left) > len(right) :\r\n right+=target[i]\r\n # target.replace(target[0] , \"\" , 1)\r\n else :\r\n left+=target[i]\r\n # target.replace(target[0] , \"\" , 1)\r\n if len(left) != len(right) :\r\n print(\"Impossible\")\r\n else :\r\n left+=\"|\"\r\n print(left + right)", "S0 = input()\r\nS1 = input()\r\nSl = S0.split(\"|\")\r\nwhile len(S1) > 0:\r\n if len(Sl[0]) < len(Sl[1]):\r\n Sl[0] = Sl[0] + S1[0]\r\n S1 = S1[1:]\r\n else:\r\n Sl[1] = Sl[1] + S1[0]\r\n S1 = S1[1:]\r\nif len(Sl[0]) == len(Sl[1]):\r\n print(Sl[0]+\"|\"+Sl[1])\r\nelse:\r\n print(\"Impossible\")", "from sys import stdin\n\n\ndef can_equilibrate(initial: str, remaining: str):\n if (len(initial) - 1 + len(remaining)) % 2 != 0:\n print(\"Impossible\")\n return\n left, right = initial.split(\"|\")\n\n while len(left) < len(right):\n if not remaining:\n print(\"Impossible\")\n return\n remaining, c = remaining[:-1], remaining[-1]\n left += c\n while len(right) < len(left):\n if not remaining:\n print(\"Impossible\")\n return\n remaining, c = remaining[:-1], remaining[-1]\n right += c\n\n while remaining:\n remaining, c = remaining[:-1], remaining[-1]\n left += c\n remaining, c = remaining[:-1], remaining[-1]\n right += c\n\n print(left + \"|\" + right)\n\n\nif __name__ == \"__main__\":\n initial = stdin.readline().rstrip()\n remaining = stdin.readline().rstrip()\n can_equilibrate(initial, remaining)\n", "#!/bin/python3\r\n\"\"\"\r\nPROBLEM LINK: https://codeforces.com/contest/382/problem/A\r\n\"\"\"\r\n\r\ndef checkScaleEquilibrium(leftScale, rightScale, unusedMasses):\r\n\r\n leftScaleQuantity = len(leftScale)\r\n rightScaleQuantity = len(rightScale)\r\n unusedMassesQuantity = len(unusedMasses)\r\n\r\n scalesDifferential = abs(leftScaleQuantity - rightScaleQuantity)\r\n\r\n if(scalesDifferential == 0):\r\n if(unusedMassesQuantity % 2 == 0):\r\n for i in range(0, len(unusedMasses), 2):\r\n leftScale += unusedMasses[i]\r\n rightScale += unusedMasses[i+1]\r\n return leftScale + \"|\" + rightScale\r\n else:\r\n return \"Impossible\"\r\n else:\r\n if(scalesDifferential % 2 == 0):\r\n if(unusedMassesQuantity >= scalesDifferential and unusedMassesQuantity % 2 == 0):\r\n for mass in unusedMasses:\r\n if(leftScaleQuantity > rightScaleQuantity):\r\n rightScale += mass\r\n rightScaleQuantity += 1\r\n else:\r\n leftScale += mass\r\n leftScaleQuantity += 1\r\n return leftScale + \"|\" + rightScale\r\n else:\r\n return \"Impossible\"\r\n else:\r\n if(unusedMassesQuantity >= scalesDifferential and unusedMassesQuantity % 2 != 0):\r\n for mass in unusedMasses:\r\n if(leftScaleQuantity > rightScaleQuantity):\r\n rightScale += mass\r\n rightScaleQuantity += 1\r\n else:\r\n leftScale += mass\r\n leftScaleQuantity += 1\r\n return leftScale + \"|\" + rightScale\r\n else:\r\n return \"Impossible\"\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n twoScales = input().strip().split(\"|\")\r\n unusedMasses = input().strip()\r\n\r\n leftScale = twoScales[0]\r\n rightScale = twoScales[1]\r\n\r\n res = checkScaleEquilibrium(leftScale, rightScale, unusedMasses)\r\n\r\n print(res)\r\n", "scale = input()\r\n\r\nmass = input()\r\n\r\nn = abs(len(scale.split('|')[0])-len(scale.split('|')[1]))\r\n\r\nscale_1 = scale.split('|')[0]\r\nscale_2 = scale.split('|')[1]\r\n\r\n\r\nfor i in range(len(mass)):\r\n if len(scale_1)>len(scale_2):\r\n scale_2 +=mass[i]\r\n else:\r\n scale_1 +=mass[i]\r\n \r\nif len(scale_1) == len(scale_2):\r\n print (scale_1 + '|' + scale_2)\r\nelse:\r\n print('Impossible')", "x=list(input().upper())\r\nr=x[:x.index(\"|\")]\r\nl=x[x.index(\"|\")+1:]\r\nne=list(input().upper())\r\nfor i in ne[:]:\r\n if len(r)>len(l):\r\n l.append(i)\r\n ne.pop(ne.index(i))\r\n elif len(l)>len(r):\r\n r.append(i)\r\n ne.pop(ne.index(i))\r\n else:\r\n if len(ne)%2==0:\r\n for i in range(len(ne)):\r\n if i%2==0:\r\n r.append(ne[i])\r\n else:\r\n l.append(ne[i])\r\n else:\r\n print(\"\".join(r)+\"|\"+\"\".join(l))\r\n break\r\n else:\r\n print(\"Impossible\")\r\n break\r\nelse:\r\n if len(r)==len(l):\r\n print(\"\".join(r)+\"|\"+\"\".join(l))\r\n else:\r\n print(\"Impossible\")", "a,b=input().split('|')\r\nc=input()\r\nfor i in range(len(c)):\r\n if len(a)<=len(b):\r\n a+=c[i]\r\n elif len(a)>len(b):\r\n b+=c[i]\r\nif len(a)==len(b): \r\n print(a+'|'+b)\r\nelse:\r\n print('Impossible') ", "left,right = input().split('|')\nleftToRight = True\nif len(left) > len(right):\n left,right = right,left\n leftToRight = False\n# print(left,right,sep='---')\nextra = input()\nif len(right) == len(left) :\n if len(extra) %2 == 0 :\n if leftToRight :\n print(left + extra[:len(extra)//2],'|',right + extra[len(extra)//2:],sep='')\n else :\n print(right + extra[:len(extra)//2],'|',left + extra[len(extra)//2:],sep='')\n else :\n print('Impossible')\nelif len(right)-len(left) > len(extra) :\n print('Impossible')\nelse :\n diff = len(right)-len(left)\n left += extra[:diff]\n extra = extra[diff:]\n if len(extra) %2 == 0 :\n if leftToRight :\n print(left + extra[:len(extra)//2],'|',right + extra[len(extra)//2:],sep='')\n else :\n print(right + extra[:len(extra)//2],'|',left + extra[len(extra)//2:],sep='')\n else :\n print('Impossible')", "s = input().split(\"|\")\r\ns1 = input()\r\nfor i in s1:\r\n if(len(s[0]) > len(s[1])):\r\n s[1] += i\r\n else: \r\n s[0] += i\r\nif(len(s[0]) == len(s[1])):\r\n print(s[0] + \"|\" + s[1])\r\nelse:\r\n\tprint(\"Impossible\")\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Ksenia and Pan Scales\"\r\n# Class: A\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n l, r = input().strip().split(\"|\")\r\n c = input().strip()\r\n all_lengths = len(l)+len(r)+len(c)\r\n if (all_lengths)%2==0 and len(l)<=all_lengths//2 and len(r)<=all_lengths//2:\r\n to_left = c[:all_lengths//2-len(l)]\r\n to_right = c[all_lengths//2-len(l):]\r\n print(l+to_left+\"|\"+r+to_right)\r\n else:\r\n print(\"Impossible\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "s=input().split(\"|\")\r\nt=input()\r\nlnt=len(t)\r\nls0=len(s[0])\r\nls1=len(s[1])\r\n# x,y,a,b=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\nif ls0==ls1:\r\n if lnt%2==0:\r\n print(s[0]+t[:lnt//2]+\"|\"+s[1]+t[lnt//2:])\r\n else:print(\"Impossible\")\r\nelse:\r\n val=abs(ls0-ls1)\r\n x=lnt-val\r\n if x>=0 and x%2==0:\r\n if ls0>ls1:\r\n print(s[0]+t[:x//2]+\"|\"+s[1]+t[x//2:])\r\n else:\r\n print(s[0]+t[x//2:]+\"|\"+s[1]+t[:x//2])\r\n else:print(\"Impossible\")", "pan=input()\r\nside=pan.split('|')\r\nleft=side[0]\r\nright=side[1]\r\nremain = input()\r\nif (len(remain)+len(left)+len(right)) %2 != 0:\r\n print(\"Impossible\")\r\nelse:\r\n light = min(len(left),len(right))\r\n heavy = max(len(left),len(right))\r\n other = len(remain)\r\n dif = heavy - light\r\n if (other - dif) < 0 or (other - dif) %2 !=0:\r\n print(\"Impossible\")\r\n else:\r\n same = True\r\n if light == len(left):\r\n comp = left\r\n stro = right\r\n \r\n else:\r\n comp = right\r\n stro = left\r\n same = False\r\n comp += remain[:dif]\r\n remain=remain[dif:]\r\n semi = len(remain) //2\r\n comp += remain[:semi]\r\n stro += remain[semi:]\r\n if same:\r\n print(comp,'|',stro,sep=\"\")\r\n else:\r\n print(stro,'|',comp,sep=\"\")\r\n \r\n \r\n\r\n \r\n", "l, r = input().split('|')\nfor i in input():\n if len(l) < len(r):\n l += i\n else:\n r += i\nprint(f'{l}|{r}' if len(l) == len(r) else 'Impossible')", "def inp():\r\n return map(str, input().split('|'))\r\n\r\n\r\nleft, right = inp()\r\nl, r = len(left), len(right)\r\nrem, sum = input(), l + r\r\ntotal = (sum + len(rem)) // 2\r\ns1, s2 = left + rem[0:total - len(left)],right + rem[total - len(left):]\r\nif (len(s1) == len(s2)):\r\n exit(print(s1+ '|' +s2 ))\r\nprint('Impossible')\r\n", "Input=input() \r\na1=Input[0:Input.find('|')]\r\na2=Input[Input.find('|')+1:len(Input)]\r\ni=input()\r\nfor a in range(len(i)):\r\n if(len(a1)<+len(a2)):\r\n a1+=i[a]\r\n else: a2+=i[a]\r\nif len(a1)==len (a2): print(a1+'|'+a2)\r\nelse: print('Impossible') ", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tstring = str(input())\r\n\textra = str(input())\r\n\tfirst = ''\r\n\tsecond = ''\r\n\tflag = True\r\n\tfor i in range(len(string)):\r\n\t\tif string[i]!='|':\r\n\t\t\tif flag:\r\n\t\t\t\tfirst+=string[i]\r\n\t\t\telse:\r\n\t\t\t\tsecond+=string[i]\r\n\t\telse:\r\n\t\t\tflag =False\r\n\r\n\tfor i in range(len(extra)):\r\n\t\tif len(first)<len(second):\r\n\t\t\tfirst+=extra[i]\r\n\t\telse:\r\n\t\t\tsecond+=extra[i]\r\n\tif len(first)!=len(second):\r\n\t\tprint('Impossible')\r\n\telse:\r\n\t\tprint(first+'|'+second)\r\n\t\r\n\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", "left, right = input().split('|')\nll = len(left)\nlr = len(right)\nextra = input()\nle = len(extra)\nsol = 'Impossible'\nmx, mn = [max((ll, lr)), min((ll, lr))]\nif mx - mn <= le and (le - (mx - mn)) % 2 == 0:\n if ll > lr:\n sol = f\"{left}{extra[:(le-(mx-mn))//2]}|\" \\\n f\"{right}{extra[(le-(mx-mn))//2:]}\"\n else:\n sol = f\"{left}{extra[:((le-(mx-mn))//2)+(mx-mn)]}|\" \\\n f\"{right}{extra[((le-(mx-mn))//2)+(mx-mn):]}\"\n\nprint(sol)\n \t\t \t \t\t\t\t \t\t \t\t\t\t \t \t\t", "s=input().split('|')\r\na=input()\r\nfor i in a:\r\n if(len(s[0])>len(s[1])):\r\n s[1] = s[1] + i\r\n else:\r\n s[0] = s[0] +i\r\nif(len(s[0])==len(s[1])):\r\n print(s[0]+\"|\"+s[1])\r\nelse:\r\n print(\"Impossible\")", "x=input().split(\"|\")\r\nf=input()\r\nwhile f:\r\n if len(x[0])<=len(x[1]):\r\n x[0]+=f[0]\r\n f=f[1:]\r\n else:\r\n x[1]+=f[0]\r\n f=f[1:]\r\nif len(x[0])==len(x[1]):\r\n print(\"|\".join(x))\r\nelse:\r\n print('Impossible')", "s = input()\r\ns_1 = input()\r\nl_1 = []\r\nl_2 = []\r\nl_res = []\r\nfor i in range(len(s)):\r\n if s[i] == \"|\":\r\n k = i\r\n for i in range(k + 1, len(s)):\r\n l_2.append(s[i])\r\n break\r\n else:\r\n l_1.append(s[i])\r\nfor i in s_1:\r\n if len(l_1) < len(l_2):\r\n l_1.append(i)\r\n else:\r\n l_2.append(i)\r\nl_res.extend(l_1)\r\nl_res.append(\"|\")\r\nl_res.extend(l_2)\r\nif len(l_1) != len(l_2):\r\n print(\"Impossible\")\r\nelse:\r\n for i in l_res:\r\n print(i, end = \"\")", "scales = input()\r\npart = scales.split('|')\r\nleft = part[0]\r\nright = part[1]\r\ntable = input()\r\n\r\nlt = [x for x in left]\r\nrt = [x for x in right]\r\ntb = [x for x in table]\r\n\r\na = len(left)\r\nb = len(right)\r\nc = len(table)\r\n\r\nif (len(left) + len(right) + len(table)) % 2 == 0:\r\n # main\r\n if abs(len(left) - len(right)) > len(table):\r\n print ('Impossible')\r\n else:\r\n # balance then divide\r\n diff = abs(len(left) - len(right))\r\n if a > b:\r\n for i in range(diff):\r\n rt += tb.pop()\r\n elif b > a:\r\n for i in range(diff):\r\n lt += tb.pop()\r\n else:\r\n pass\r\n # divide\r\n while len(tb) > 0:\r\n lt += tb.pop()\r\n rt += tb.pop()\r\n print (''.join(lt) + '|' + ''.join(rt))\r\n\r\nelse:\r\n print ('Impossible')", "s=list(input().split('|'))\np=input()\nln1=len(s[0])\nln2=len(s[1])\nln3=len(p)\nif(ln1==ln2):\n\tif(ln3%2==0):\n\t\tprint(s[0],end=\"\")\n\t\tfor i in range(int(ln3/2)):\n\t\t\tprint(p[i],end=\"\")\n\t\tprint(\"|\",end=\"\")\n\t\tprint(s[1],end=\"\")\n\t\tfor i in range(int(ln3/2),ln3):\n\t\t\tprint(p[i],end=\"\")\n\telse:\n\t\tprint(\"Impossible\")\nelse:\n\tif(ln1>ln2): #first\n\t\tif(ln1-ln2>ln3 or (ln3-(ln1-ln2))%2!=0):\n\t\t\tprint(\"Impossible\")\n\t\telse:\n\t\t\tstart=ln1-ln2\n\t\t\tfor i in range(start):\n\t\t\t\ts[1]+=p[i]\n\t\t\tif(ln3-start>0):\n\t\t\t\tprint(s[0],end=\"\")\n\t\t\t\tholy=(ln3-start)//2\n\t\t\t\tfor i in range(start,start+holy):\n\t\t\t\t\tprint(p[i],end=\"\")\n\t\t\t\tprint(\"|\",end=\"\")\n\t\t\t\tprint(s[1],end=\"\")\n\t\t\t\tfor i in range(start+holy,ln3):\n\t\t\t\t\tprint(p[i],end=\"\")\n\t\t\telse:\n\t\t\t\tprint(s[0],end=\"\")\n\t\t\t\tprint(\"|\",end=\"\")\n\t\t\t\tprint(s[1])\n\telse: #second\n\t\tif(ln2-ln1>ln3 or (ln3-(ln2-ln1))%2!=0):\n\t\t\tprint(\"Impossible\")\n\t\telse:\n\t\t\tstart=ln2-ln1\n\t\t\tfor i in range(start):\n\t\t\t\ts[0]+=p[i]\n\t\t\tif(ln3-start>0):\n\t\t\t\tprint(s[0],end=\"\")\n\t\t\t\tholy=(ln3-start)//2\n\t\t\t\tfor i in range(start,start+holy):\n\t\t\t\t\tprint(p[i],end=\"\")\n\t\t\t\tprint(\"|\",end=\"\")\n\t\t\t\tprint(s[1],end=\"\")\n\t\t\t\tfor i in range(start+holy,ln3):\n\t\t\t\t\tprint(p[i],end=\"\")\n\t\t\telse:\n\t\t\t\tprint(s[0],end=\"\")\n\t\t\t\tprint(\"|\",end=\"\")\n\t\t\t\tprint(s[1])\n\n#LONG TIME :)", "import math\r\ns=input()\r\ng=input()\r\nl,r,w=0,0,len(g)\r\nj=0\r\nwhile s[j]!='|':\r\n\tl+=1\r\n\tj+=1\r\nk=j\r\nj+=1\r\nwhile j<len(s):\r\n\tr+=1\r\n\tj+=1\r\nls=s[:l]\r\nrs=s[l+1:]\r\nfor i in g:\r\n\tif l<=r:\r\n\t\tl+=1\r\n\t\tls+=i\r\n\telse:\r\n\t\tr+=1\r\n\t\trs+=i\r\nif l==r:\r\n\tprint(ls+'|'+rs)\r\nelse:\r\n\tprint(\"Impossible\")", "#one day im gonna in sha allah\r\n\r\nimport math\r\n\r\ndef main():\r\n\r\n line = input().split(\"|\")\r\n line2 = input()\r\n line3 = line2\r\n if(len(line[0]) > len(line[1])):\r\n line3 = line2[len(line[0]) - len(line[1]):]\r\n line[1] = line[1] + line2[0: len(line[0]) - len(line[1])]\r\n\r\n elif(len(line[0]) < len(line[1])):\r\n line3 = line2[len(line[1]) - len(line[0]):]\r\n line[0] = line[0] + line2[0: len(line[1]) - len(line[0])]\r\n\r\n line[0] = line[0] + line3[0:math.ceil(len(line3)/2)]\r\n line[1] = line[1] + line3[math.ceil(len(line3)/2):]\r\n\r\n if(len(line[0]) == len(line[1])):\r\n print(line[0] + \"|\" + line[1])\r\n else:\r\n print(\"Impossible\")\r\n\r\nif __name__ == \"__main__\":\r\n \r\n main()\r\n", "x = input()\r\ny = input()\r\nfor c in y:\r\n left = x.index('|')\r\n right = len(x) - left - 1\r\n if left < right:\r\n x = c + x\r\n else:\r\n x = x + c\r\nleft = x.index('|')\r\nright = len(x) - left - 1\r\nif left!=right:\r\n print('Impossible')\r\nelse:\r\n print(x)\r\n\r\n\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n s = input()\r\n spare = input()\r\n l, _, r = s.partition('|')\r\n index = 0 \r\n while len(l) < len(r) and index < len(spare):\r\n l = l+spare[index]\r\n index+=1\r\n while len(r) < len(l) and index < len(spare):\r\n r = r+spare[index]\r\n index += 1 \r\n if len(l) != len(r):\r\n return 'Impossible'\r\n else:\r\n if len(spare[index:])%2!=0:\r\n return 'Impossible'\r\n while index < len(spare):\r\n if len(l)<=len(r):\r\n l = l+spare[index]\r\n else:\r\n r = r+spare[index]\r\n index+=1\r\n return l+'|'+r\r\n \r\nif __name__ == '__main__':\r\n print(main())", "s = input()\r\nt = input()\r\nass = s.split(\"|\")\r\nal= len(s)+len(t)-1\r\nif al %2 or len(ass[0])>al//2 or len(ass[1])>al//2:\r\n print(\"Impossible\")\r\n exit(0)\r\n\r\nlt = list(t)\r\nml = al//2- len(ass[0])\r\nass[0]+=t[:ml]\r\nass[1]+=t[ml:]\r\nprint(ass[0]+\"|\"+ass[1])", "a = list(map(str,input().split(\"|\")))\r\n\r\nstring = input()\r\ndiff = abs(len(a[0])-len(a[1]))\r\n\r\nif len(string)-diff>=0 and (len(string)-diff)%2==0:\r\n #print(\"Possible\")\r\n if len(a[0])<len(a[1]):\r\n a[0] = string[0:int(diff+(len(string)-diff)/2)]+a[0]\r\n a[1] = a[1] + string[int(diff+(len(string)-diff)/2):]\r\n\r\n else:\r\n a[1] = string[0:int(diff+(len(string)-diff)/2)]+a[1]\r\n a[0] = a[0] + string[int(diff+(len(string)-diff)/2):]\r\n\r\n\r\n print(a[0]+\"|\"+a[1])\r\n \r\n \r\n\r\nelse:\r\n print(\"Impossible\")\r\n\r\n\r\n", "scalesWeights=(input())\r\nweights=(input())\r\ndelimiter=scalesWeights.find(\"|\")\r\nleft=scalesWeights[:delimiter]\r\nright=scalesWeights[delimiter+1:]\r\nfor i in weights:\r\n if len(left)<=len(right):\r\n left=left+i\r\n else:\r\n right=right+i\r\n\r\nif len(left)==len(right):\r\n print(left+\"|\"+right)\r\nelse:\r\n print(\"Impossible\")", "a, b = map(str, input().split(\"|\"))\r\nnew = input()\r\nif (len(new) + len(a) + len(b)) % 2 == 0:\r\n for i in new:\r\n if len(a) <= len(b):\r\n a += i\r\n else:\r\n b += i\r\n if len(a) == len(b):\r\n print(f\"{a}|{b}\")\r\n exit(0)\r\nprint(\"Impossible\")", "a,b=input().split('|')\r\nz=a+input()+b\r\nm=len(z)//2\r\nprint([z[:m]+'|'+z[m:],'Impossible'][max(map(len,[a,b,z[m:]]))>m])", "x,y=map(str,input().split('|'))\r\na=list(input())\r\nfor i in a:\r\n\tif len(x)>len(y):\r\n\t\ty+=i\r\n\telse:\r\n\t\tx+=i\r\nif len(x)==len(y):\r\n\tprint(x,end=\"|\")\r\n\tprint(y)\r\nelse:\r\n\tprint(\"Impossible\")", "a,b=map(str,input().split('|'))\r\n\r\nc=input()\r\n\r\nfor i in c:\r\n if(len(a)<len(b)):\r\n a+=i\r\n else:\r\n b+=i\r\n\r\nif(len(a)==len(b)):\r\n print('{0}|{1}'.format(a,b))\r\nelse:\r\n print('Impossible')", "left , right = input().split(\"|\") \r\nadded = input() \r\nlr , lf , la = len(right) ,len(left), len(added)\r\nref = max(lr , lf) \r\nlen_needed = ref - min(lr,lf) \r\nres = None \r\nif (la - len_needed )<0 :\r\n res = \"Impossible\" \r\nelif (la - len_needed) >0 and (la - len_needed) % 2 != 0 : \r\n res = \"Impossible\" \r\nelse: \r\n if lf <= lr :\r\n need = lr - lf \r\n left += added[ : need]\r\n rest = la - need \r\n left += added[need :need+ rest // 2 ] \r\n right += added[need + rest // 2 : ]\r\n elif lr < lf : \r\n need = lf - lr \r\n right += added[ : need]\r\n rest = la - need \r\n right += added[need :need+ rest // 2 ] \r\n left += added[need + rest // 2 : ]\r\n\r\n res = left +'|' +right \r\nprint(res)", "l, r = input().split('|')\nto_add = input()\n\nfor c in to_add:\n\tif len(l) < len(r):\n\t\tl += c\n\telse:\n\t\tr += c\n\nif len(l) == len(r):\n\tprint(l+'|'+r)\nelse:\n\tprint('Impossible')\n", "scales = list(map(str, input().split(\"|\")))\r\nif len(scales)==1:\r\n\tscales.append([])\r\nweight = list(map(str, input()))\r\n\r\nX = max(len(scales[0]), len(scales[1]))\r\nN = min(len(scales[0]), len(scales[1]))\r\n\r\nif (len(scales[0]) == len(scales[1]) and len(weight) % 2) !=0 or X > N + len(weight) or (X + N + len(weight))%2 != 0 :\r\n\tprint(\"Impossible\")\r\nelif len(scales[0]) == len(scales[1]) and len(weight) % 2 ==0 :\r\n\twhile len(weight) > 0:\r\n\t\tscales[0]+=weight[0]\r\n\t\tweight.pop(0)\r\n\t\tscales[1]+=weight[0]\r\n\t\tweight.pop(0)\r\n\tprint(scales[0], scales[1], sep=\"|\")\r\nelse:\r\n\twhile len(scales[0]) != len(scales[1]):\r\n\t\tif len(scales[0]) > len(scales[1]):\r\n\t\t\tscales[1] += weight[0]\r\n\t\t\tweight.pop(0)\r\n\t\telse:\r\n\t\t\tscales[0] += weight[0]\r\n\t\t\tweight.pop(0)\r\n\tif len(weight) !=0:\r\n\t\twhile len(weight) >0:\r\n\t\t\tscales[0] += weight[0]\r\n\t\t\tweight.pop(0)\r\n\t\t\tscales[1] += weight[0]\r\n\t\t\tweight.pop(0)\r\n\tprint(scales[0], scales[1], sep=\"|\")", "s = input()\r\nl_all = len(s)-1\r\nnew_s = input()\r\n\r\nindex = s.index(\"|\")\r\nleft = [i for i in s[:index]]\r\nright = [i for i in s[index+1:]]\r\n\r\nfor i in new_s:\r\n if len(left) <= len(right):\r\n left.append(i)\r\n else:\r\n right.append(i)\r\nif len(left) == len(right):\r\n print(''.join(left) + \"|\" + ''.join(right))\r\nelse:\r\n print(\"Impossible\")", "(l,r)=input().split('|')\r\ns=input()\r\n\r\nwhile len(s)>0:\r\n if len(l)<len(r):\r\n l+=s[0]\r\n else:\r\n r+=s[0]\r\n s=s[1::]\r\nif len(l)==len(r):\r\n print(l+\"|\"+r)\r\nelse:\r\n print(\"Impossible\")\r\n\r\n\r\n \r\n \r\n \r\n \r\n" ]

[ "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\n# MOD = 998244353\r\n# def pow(base , exp):\r\n# if exp == -1:\r\n# return pow(base , MOD - 2)\r\n# res = 1\r\n# base %= MOD\r\n# while exp > 0:\r\n# if exp % 2:\r\n# res = (res * base) % MOD\r\n# exp //= 2\r\n# base = (base * base) % MOD\r\n \r\n# res %= MOD\r\n # return res\r\n\r\ndef main():\r\n n , j = map(int , input().split())\r\n j = j % (2 * n)\r\n mx , my = map(int , input().split())\r\n pntx = []\r\n pnty = []\r\n for i in range(n):\r\n a,b = map(int , input().split())\r\n pntx.append(a)\r\n pnty.append(b)\r\n \r\n for i in range(j):\r\n k = i % n\r\n mx = 2 * pntx[k] - mx\r\n my = 2 * pnty[k] - my\r\n print(mx , my)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\n\ndef read():\n tokens = sys.stdin.readline().strip().split()\n return int(tokens[0]), int(tokens[1])\n\nn, j = read()\nm0_x, m0_y = read()\n\nax, ay = [], []\nfor i in range(n):\n ax_, ay_ = read()\n ax.append(ax_)\n ay.append(ay_)\n\nmult = j // n\nj = (j % n) if mult % 2 == 0 else (n + (j % n))\npx, py = -m0_x, -m0_y\nfor i in range(j):\n if i % 2 == 0:\n px += ax[i % n] * 2\n py += ay[i % n] * 2\n else:\n px -= ax[i % n] * 2\n py -= ay[i % n] * 2\n\nif j % 2 == 0:\n px, py = -px, -py\n\nprint(px, py)\n\n", "def count(start, x):\r\n global n, j\r\n ans = start\r\n for i in range(j):\r\n ans = -(ans-x[i%n])+x[i%n]\r\n return ans\r\n\r\n\r\nn, j = map(int, input().split())\r\nj = j % (2 * n)\r\nm_x, m_y = map(int, input().split())\r\nx, y = [], []\r\nfor i in range(n):\r\n x1, y1 = map(int, input().split())\r\n x.append(x1)\r\n y.append(y1)\r\nprint(count(m_x, x), count(m_y, y))", "#codeforces 24c sequence of points, math\r\n\"\"\"import sys\r\nsys.stdin=open(\"24c.in\",mode='r',encoding='utf-8')\r\n\"\"\"\r\ndef readGen(transform):\r\n\twhile (True):\r\n\t\tn=0\r\n\t\ttmp=input().split()\r\n\t\tm=len(tmp)\r\n\t\twhile (n<m):\r\n\t\t\tyield(transform(tmp[n]))\r\n\t\t\tn+=1\r\n\r\nreadint=readGen(int)\r\n\r\nn,j=next(readint),next(readint)\r\nj%=2*n\r\nx0,y0=next(readint),next(readint)\r\na=tuple((next(readint),next(readint)) for i in range(n))\r\n#a=[[next(readint),next(readint)] for i in range(n)]\r\nfor i in range(1,j+1):\r\n\tx0=2*a[(i-1)%n][0]-x0\r\n\ty0=2*a[(i-1)%n][1]-y0\r\nprint(x0,y0)\r\n\r\n#sys.stdin.close()", "import math\r\nfrom math import sqrt, inf\r\nimport queue\r\n\r\n\r\n# -------- info --------\r\n\r\n# https://codeforces.com/profile/Wolxy\r\n\r\n# -------- sys --------\r\n\r\ndef dis(from_loc, to_loc, euclidean = True) -> int:\r\n result = 0\r\n if euclidean:\r\n for i in range(min(len(from_loc), len(to_loc))):\r\n result += (from_loc[i] - to_loc[i]) * (from_loc[i] - to_loc[i])\r\n else:\r\n for i in range(min(len(from_loc), len(to_loc))):\r\n result += from_loc[i] - to_loc[i]\r\n return result\r\n\r\n\r\ndef product(from_loc, first_loc, second_loc) -> int:\r\n vector1 = (first_loc[0] - from_loc[0], first_loc[1] - from_loc[1])\r\n vector2 = (second_loc[0] - from_loc[0], second_loc[1] - from_loc[1])\r\n return vector1[0] * vector2[1] - vector2[0] * vector1[1]\r\n\r\n# -------- functions[clearable] --------\r\n\r\n\r\n# -------- solve[clearable] --------\r\n\r\ndef solve() -> None:\r\n n, j = map(int, input().split(' '))\r\n mx, my = map(int, input().split(' '))\r\n ls = []\r\n for _ in range(n):\r\n ls.append(tuple(map(int, input().split(' '))))\r\n index = j % (2 * n)\r\n # print(ls)\r\n for i in range(index):\r\n # print(mx, my)\r\n mx, my = 2 * ls[i % n][0] - mx, 2 * ls[i % n][1] - my\r\n\r\n print(mx, my)\r\n\r\n\r\n# -------- main --------\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()\r\n", "import sys\r\n\r\ndef read():\r\n tokens = sys.stdin.readline().strip().split()\r\n return int(tokens[0]), int(tokens[1])\r\n\r\nn,m=read()\r\np,q=read()\r\nx=[]\r\ny=[]\r\nr=1\r\n\r\nfor i in range(0,n*2):\r\n\tif (i<n):\r\n\t\ttx,ty=read()\r\n\t\tx.append(tx)\r\n\t\ty.append(ty)\r\n\telse:\r\n\t\tx.append(x[i-n])\r\n\t\ty.append(y[i-n])\r\n\r\n\r\nm%=n*2\r\n\r\nfor i in range(0,m):\r\n\tp=2*x[i]-p\r\n\tq=2*y[i]-q\r\n\r\nprint (p,q)\r\n\r\n\r\n'''\r\n(x,y) (ax,ay) (ax*2-x,ay*2-y)\r\n\r\n\r\n(x,y,1)(-1 0 0\r\n\t\t0 -1 0\r\n\t\tax*2 ay*2\t 1)\r\n'''", "n, calculo = map(int, input().split())\n \nlistaX,listaY = [],[]\n \nmx, my = map(int, input().split())\n\ncount=0\nwhile count != n:\n x, y = map(int, input().split())\n listaX.append(x)\n listaY.append(y)\n count+=1\n\ncalculo %= 2*n\ncount=0\n\nwhile count != calculo:\n mx = listaX[count % n]*2 - mx\n my = listaY[count % n]*2 - my\n count+=1\n \nprint(mx, my)\n\t\t \t\t \t \t \t\t \t\t\t\t \t\t \t\t\t", "n, j = map(int, input().split())\nx, y = map(int, input().split())\ndx, dy = n * [ None ], n * [ None ]\nfor i in range(n):\n dx[i], dy[i] = map(lambda s: 2 * int(s), input().split())\n\nj %= 2 * n\npos = 0\nif j % 2 == 0:\n sign = -1\nelse:\n sign = 1\n x, y = -x, -y\nfor i in range(j):\n x += sign * dx[pos]\n y += sign * dy[pos]\n sign = -sign\n pos += 1\n if pos == n:\n pos = 0\n\nprint(x, y)\n", "n, k = map(int, input().split())\r\n\r\nax = []\r\nay = []\r\n\r\nmx, my = map(int, input().split())\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n ax.append(x)\r\n ay.append(y)\r\n\r\nk %= 2*n\r\n\r\nfor i in range(k):\r\n mx = 2*ax[i % n] - mx\r\n my = 2*ay[i % n] - my\r\n\r\nprint(mx, \" \", my)", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\n\r\nn,j = S()\r\nq,r = divmod(j-1,2*n)\r\nr += 1\r\nd = [[*S()]]+[[0,0] for _ in range(2*n)]\r\na = [[*S()] for _ in range(n)]*2\r\nfor i in range(1,2*n+1):\r\n k = (i-1)%n\r\n d[i][0] = 2*a[k][0]-d[i-1][0]\r\n d[i][1] = 2*a[k][1]-d[i-1][1]\r\nprint(d[r][0]+q*(d[-1][0]-d[0][0]),d[r][1]+q*(d[-1][1]-d[0][1]))", "t,k=map(int,input().split())\r\na,b=map(int,input().split())\r\nlistt=[a]\r\nlistt2=[b]\r\nlistt_ab=[]\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n listt_ab.append([a,b])\r\n listt.append(2*a-listt[-1])\r\n listt2.append(2*b-listt2[-1])\r\nfor i in range(t):\r\n a,b=listt_ab[i]\r\n listt_ab.append([a,b])\r\n listt.append(2*a-listt[-1])\r\n listt2.append(2*b-listt2[-1])\r\n\r\ni=k%(2*t)\r\nprint(listt[i],listt2[i])", "def read():\r\n return map(int, input().split())\r\n\r\nn, j = read()\r\nmx, my = read()\r\ncycles = j // n\r\nrest = j - cycles * n\r\ntx = ty = 0\r\nrx = ry = 0\r\n\r\nfor i in range(n):\r\n cx, cy = read()\r\n tx = 2 * cx - tx\r\n ty = 2 * cy - ty\r\n if i < rest:\r\n rx = 2 * cx - rx\r\n ry = 2 * cy - ry\r\n\r\nresx = resy = 0\r\nif n % 2 == 0:\r\n resx = tx * cycles + mx\r\n resy = ty * cycles + my\r\nelse:\r\n if cycles % 2 == 0:\r\n resx, resy = mx, my\r\n else:\r\n resx = tx - mx\r\n resy = ty - my\r\n\r\nif rest % 2 == 0:\r\n resx += rx\r\n resy += ry\r\nelse:\r\n resx = rx - resx\r\n resy = ry - resy\r\n\r\nprint (resx, resy)\r\n", "\n\nn, j = map(int, input().split())\n\nm = list(map(int, input().split()))\n\npoints = []\n\nfor _ in range(n):\n points += [tuple(map(int, input().split()))]\n\ntrans = [0, 0]\n\npoints = points + points\n\nfor i in range(0, len(points), 2):\n trans[0] += - 2 * points[i][0] + 2 * points[i + 1][0]\n trans[1] += - 2 * points[i][1] + 2 * points[i + 1][1]\n\nm = [m[0] + trans[0] * (j // (2 * n)), m[1] + trans[1] * (j // (2 * n))]\n\n\nj %= (2 * n)\n\nfor i in range(j):\n m = [2 * points[i][0] - m[0], 2 * points[i][1] - m[1]]\nprint(m[0], m[1])\n", "def main():\r\n n, j = map(int, input().split())\r\n A = [tuple(map(int, input().split())) for _ in range(n + 1)]\r\n M = A.pop(0)\r\n\r\n for i in range(j % (2 * n)):\r\n Ai = A[i % n]\r\n Mx, My = 2 * Ai[0] - M[0], 2 * Ai[1] - M[1]\r\n M = (Mx, My)\r\n\r\n print(M[0], M[1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\n\n\nN, J = [int(w) for w in stdin.readline().split()]\n\nJ = J % (N + N)\npoints = []\n\nx, y = [int(w) for w in stdin.readline().split()]\nfor _ in range(N):\n points.append([int(w) for w in stdin.readline().split()])\n\nfor i in range(J):\n i %= N\n x += (points[i][0] - x) * 2\n y += (points[i][1] - y) * 2\n\nprint(x, y)", "n, j = map(int, input().split())\r\nx, y = map(int, input().split())\r\ndx, dy = n * [ None ], n * [ None ]\r\nfor i in range(n):\r\n dx[i], dy[i] = map(lambda s: 2 * int(s), input().split())\r\n\r\nj %= 2 * n\r\npos = 0\r\nif j % 2 == 0:\r\n sign = -1\r\nelse:\r\n sign = 1\r\n x, y = -x, -y\r\nfor i in range(j):\r\n x += sign * dx[pos]\r\n y += sign * dy[pos]\r\n sign = -sign\r\n pos += 1\r\n if pos == n:\r\n pos = 0\r\n\r\nprint(x, y)" ]

[ "\r\ndef count(p, s):\r\n start = 0\r\n c = 0\r\n while True:\r\n try:\r\n pos = s.index(p, start)\r\n c += 1\r\n start = pos + 1\r\n except ValueError:\r\n return c\r\n\r\ns = input()\r\nn = int(input())\r\n\r\npravs = []\r\nfor i in range(n):\r\n p, l, r = input().split()\r\n l = int(l); r = int(r)\r\n pravs.append((p, l, r))\r\n\r\nvar = set()\r\nfor l in range(len(s)):\r\n for r in range(l+1, len(s)+1):\r\n pods = s[l:r]\r\n for prav in pravs:\r\n if not prav[1] <= count(pods, prav[0]) <= prav[2]:\r\n break\r\n else:\r\n var.add(pods)\r\n\r\nprint(len(var))\r\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef fenwick_tree(n):\r\n tree = [0] * (n + 1)\r\n return tree\r\n\r\ndef get_sum(i):\r\n s = 0\r\n while i > 0:\r\n s += tree[i]\r\n i -= i & -i\r\n return s\r\n\r\ndef add(i, x):\r\n while i < len(tree):\r\n tree[i] += x\r\n i += i & -i\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\np = [0] * (n + 1)\r\nfor i in range(n):\r\n p[a[i]] = i + 1\r\ntree = fenwick_tree(n + 5)\r\ns1 = 0\r\nfor i in range(1, n + 1):\r\n pi = p[i]\r\n s1 += (n - pi + 1) * get_sum(pi)\r\n add(pi, pi)\r\ntree = fenwick_tree(n + 5)\r\ns2 = 0\r\nfor i in range(n, 0, -1):\r\n pi = p[i]\r\n s2 += (n - pi + 1) * get_sum(pi)\r\n add(pi, pi)\r\ntree = fenwick_tree(n + 5)\r\ns3 = 0\r\nfor i in range(n, 0, -1):\r\n pi = p[i]\r\n s3 += get_sum(pi)\r\n add(pi, 1)\r\nm = n * (n + 1)\r\nans = (s1 + m * s3 - s2) / m\r\nprint(ans)", "MAX = 500005\r\nn = int(input())\r\nv = [0]*MAX\r\nAIB = [0]*MAX\r\nAIB2 = [0]*MAX\r\n\r\ndef add1(pos, val):\r\n global AIB\r\n while pos < MAX:\r\n AIB[pos] += val\r\n pos += pos & (-pos)\r\n\r\ndef add2(pos, val):\r\n global AIB2\r\n while pos < MAX:\r\n AIB2[pos] += val\r\n pos += pos & (-pos)\r\n\r\ndef query1(pos):\r\n ans = 0\r\n if pos < 0: return 0\r\n while pos >= 1:\r\n ans += AIB[pos]\r\n pos -= pos & (-pos)\r\n return ans\r\n\r\ndef query2(pos):\r\n ans = 0\r\n if pos < 0: return 0\r\n while pos >= 1:\r\n ans += AIB2[pos]\r\n pos -= pos & (-pos)\r\n return ans\r\n\r\nv = [int(x) for x in input().split()]\r\nfor i in range(len(v)):\r\n v[i] = n - v[i] + 1\r\n\r\nv.insert(0,0)\r\nans = 0; ans2 = 0\r\nfor i in range(1, n+1):\r\n ans += 1 * (n-i+1) * query1(v[i]-1)\r\n add1(v[i], i)\r\n ans2 += query2(v[i]-1)\r\n add2(v[i], 1)\r\n\r\nans3 = 0\r\nfor i in range(1, n+1):\r\n ans3 += ((n-i+1) * (i-1) * i / 4) / (n * (n+1) / 2)\r\n\r\nans /= (n * (n+1) / 2)\r\nans = ans2 - ans + ans3\r\nprint(\"{:.10f}\".format(ans))\r\n" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter,defaultdict\r\n\r\nN,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nans = 0\r\ndp1,dp2 = defaultdict(int),defaultdict(int)\r\nfor a in A:\r\n if a%K==0:\r\n ans += dp2[a//K]\r\n dp2[a]+=dp1[a//K]\r\n dp1[a]+=1\r\nprint(ans)\r\n \r\n \r\n", "# https://codeforces.com/contest/567/problem/C\r\n\r\nn, k = map(int, input().split()) # n = how many numbers, k = Polycarp's favorite number\r\na = list(map(int, input().split())) # a = the elements of the sequence\r\n\r\npre_collection = {} # numbers and counts of that number, first iteration\r\npost_collection = {} # numbers and counts of that number, second iteration\r\n\r\n# Initialize pre_collection by iterating through once\r\nfor num in a:\r\n if num not in pre_collection:\r\n pre_collection[num] = 1\r\n else:\r\n pre_collection[num] += 1\r\n\r\n# Goal: iterate through, adding to count when we find a \"middle\" term\r\n# E.g. If we have 1, 3, 9 with k = 3, we will count one once we are processing 3\r\n# (Note: This enforces that this must occur in order, as 1 must be already processed, and 9 must be after 3)\r\ngeometric_count = 0\r\nfor num in a:\r\n pre_collection[num] -= 1 # remove the current number from the dictionary\r\n if num % k == 0:\r\n if (num / k in post_collection and num * k in pre_collection):\r\n geometric_count += post_collection[num / k] * pre_collection[num * k]\r\n \r\n # Add to post_collection\r\n if num not in post_collection: \r\n post_collection[num] = 1\r\n else:\r\n post_collection[num] += 1 \r\n \r\n\r\nprint(geometric_count)\r\n", "def inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\n\nn, k = inlt()\narr = inlt()\n\nleft = {}\nright = {}\n\nfor i in arr:\n if i in right.keys():\n right[i] += 1\n else:\n right[i] = 1\n\nans = 0\nfor i in arr:\n right[i] -= 1\n if i%k == 0:\n if i/k in left.keys() and i*k in right.keys():\n ans += (left[i/k]*right[i*k])\n if i in left.keys():\n left[i] += 1\n else:\n left[i] = 1\n\nprint(ans)", "n, k = map(int, input().split()) \na = list(map(int, input().split())) \n \ncollection1 = {} \ncollection2 = {} \n \nfor num in a:\n if num not in collection1:\n collection1[num] = 1\n else:\n collection1[num] += 1\n \ncounter = 0\nfor num in a:\n collection1[num] -= 1 \n if num % k == 0:\n if (num / k in collection2 and num * k in collection1):\n counter += collection2[num / k] * collection1[num * k]\n \n if num not in collection2: \n collection2[num] = 1\n else:\n collection2[num] += 1 \n \n \nprint(counter)", "from math import inf\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nfrom collections import defaultdict\r\ndef put(): return map(int, input().split())\r\n\r\nn,k = put()\r\nli = list(put())\r\none = defaultdict()\r\ntwo = defaultdict()\r\nans = 0\r\nfor i in li:\r\n if i not in one:\r\n one[i]=0\r\n\r\n if i%k==0:\r\n j = i//k\r\n if j in one:\r\n if i not in two:\r\n two[i] = one[j]\r\n else:\r\n two[i]+= one[j]\r\n if j in two:\r\n ans+= two[j]\r\n if i==j:\r\n ans-= one[j]\r\n\r\n one[i]+=1\r\n\r\n \r\nprint(ans) \r\n", "n,k=map(int,input().split())\r\n\r\nSequence=list(map(int,input().split()))\r\n\r\nLeft={}\r\nRight={}\r\nAns=0\r\n\r\nfor i in range(n):\r\n if Sequence[i] not in Right:\r\n Right[Sequence[i]]=1\r\n else:\r\n Right[Sequence[i]]+=1\r\n\r\nfor i in range(n):\r\n Right[Sequence[i]]-=1\r\n\r\n if(Sequence[i]%k==0):\r\n if Sequence[i]/k in Left and Sequence[i]*k in Right:\r\n Ans+=Left[Sequence[i]/k]*Right[Sequence[i]*k]\r\n\r\n if Sequence[i] not in Left:\r\n\r\n Left[Sequence[i]]=1\r\n else:\r\n Left[Sequence[i]]+=1\r\n\r\nprint(Ans)", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\n\r\nd1 = defaultdict(int)\r\nd2 = defaultdict(int)\r\nd3 = defaultdict(int)\r\n\r\n\r\nfor x in map(int,input().split()):\r\n\td3[k*x] += d2[x]\r\n\td2[k*x] += d1[x]\r\n\td1[k*x] += 1\r\n\r\nprint(sum(d3.values()))", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import comb\r\n\r\nn, k = map(int, input().split())\r\nq = dict()\r\nw = list(map(int, input().split()))\r\nc, a = 0, 0\r\nfor i in w:\r\n if i == 0:\r\n a += 1\r\n else:\r\n if i not in q:\r\n if i % k == 0 and i//k in q:\r\n c += q[i//k][1]\r\n q[i] = (1, q[i//k][0])\r\n else:\r\n q[i] = (1, 0)\r\n else:\r\n if i % k == 0 and i//k in q:\r\n c += q[i//k][1]\r\n q[i] = (q[i][0]+1, q[i][1]+q[i//k][0])\r\n else:\r\n q[i] = (q[i][0]+1, 0)\r\nprint(c + comb(a, 3))\r\n", "n, k = [int(x) for x in input().split(' ')]\nseq = [int(x) for x in input().split(' ')]\n\nmemo = [{i:0 for i in seq} for j in range(3)]\n\nfor x in seq:\n predecessor = x / k\n \n # finishing a sequence\n if predecessor % 1 == 0 and int(predecessor) in memo[1]:\n memo[2][x] += memo[1][int(predecessor)]\n \n # continuing a sequence\n if predecessor % 1 == 0 and int(predecessor) in memo[0]:\n memo[1][x] += memo[0][int(predecessor)]\n\n memo[0][x] += 1 # starting a new sequence\n \nprint(sum(memo[2].values()))\n \t \t\t \t\t \t \t \t \t \t", "import bisect\r\nfrom collections import defaultdict as dd\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nhm1 = dd(int)\r\nhm2 = dd(int)\r\nn, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nres = 0\r\nfor i in a:\r\n if i%m==0:\r\n res += hm2[i//m]\r\n hm2[i] += hm1[i//m]\r\n hm1[i] += 1\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\n\r\narr = [int(z) for z in input().split()]\r\n\r\ndef binsearch(nums, target):\r\n left = 0\r\n right = len(nums) - 1\r\n while left <= right:\r\n mid = (left + right) // 2\r\n if nums[mid] == target:\r\n return mid\r\n elif nums[mid] > target:\r\n right = mid - 1\r\n elif nums[mid] < target:\r\n left = mid + 1\r\n\r\n return left\r\n\r\nocc = {}\r\nfor i in range(n):\r\n occ[arr[i]] = []\r\nfor i in range(n):\r\n occ[arr[i]].append(i)\r\n\r\nres = 0\r\nfor i in range(n):\r\n e = arr[i]\r\n if e % k:\r\n continue\r\n if not occ.get(e//k) or not occ.get(e*k):\r\n continue\r\n\r\n pl1 = min(len(occ[e//k]), binsearch(occ[e//k], i-.1))\r\n pl2 = max(0, len(occ[e*k]) - binsearch(occ[e*k], i+.1))\r\n res += pl1*pl2\r\n\r\nprint(res)\r\n\r\n", "from collections import defaultdict\n\n_, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nd1 = defaultdict(lambda: 0)\nd2 = defaultdict(lambda: 0)\nd3 = defaultdict(lambda: 0)\n\nfor x in reversed(arr):\n d3[x] += d2[x * k]\n d2[x] += d1[x * k]\n d1[x] += 1\n\nprint(sum(d3.values()))\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List, Mapping\r\nsys.setrecursionlimit(999999)\r\n\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ncs = collections.Counter(arr)\r\npre = collections.Counter()\r\ncs[arr[0]]-=1\r\nans = 0\r\nfor i in range(1,len(arr)-1):\r\n pre[arr[i-1]]+=1\r\n cs[arr[i]]-=1\r\n if arr[i]%k==0:\r\n ans+= pre[arr[i]//k]*cs[arr[i]*k]\r\nprint(ans)\r\n\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN,K = map(int,input().split())\nA = list(map(int,input().split()))\nl = [0]*N\ndic = defaultdict(int)\nfor i in range(N-2,-1,-1):\n if A[i+1]%(K**2)==0:dic[A[i+1]//(K**2)]+=1\n if A[i]%K==0:\n l[i]+=dic[A[i]//K]\nans = 0\ndic2 = defaultdict(int)\nfor i in range(N-3,-1,-1):\n if A[i+1]%K==0:dic2[A[i+1]//K]+=l[i+1]\n # print(dic2)\n ans+=dic2[A[i]]\n\nprint(ans)\n", "from collections import defaultdict\r\nn,k = [int(x) for x in input().split()]\r\n\r\nm = defaultdict(int)\r\nf = defaultdict(int)\r\nans=0\r\na = [int(x) for x in input().split()]\r\n\r\nfor i in range(0,n):\r\n if(a[i]%k==0): ans+=m[a[i]//k]\r\n if(a[i]%k==0): m[a[i]]+=f[a[i]//k]\r\n \r\n f[a[i]]+=1\r\n\r\nprint(ans)", "#\r\n# CS21-Science-Day-25\r\n# Name: Mahmoud Abdallah Hassan\r\n# GitHub link: https://github.com/RaymondReddigton\r\n# problem link: https://codeforces.com/contest/567/problem/C\r\n# Time Complexity: O(nlog(n))\r\n#\r\n#\r\n\r\nimport collections\r\nnumOfSequence, favNum = map(int, input().split())\r\ndic=[collections.defaultdict(int)for _ in\"123\"]\r\n\r\nfor elementInSeq in map(int, input().split()):\r\n dic[2][favNum*elementInSeq]+=dic[1][elementInSeq]\r\n dic[1][favNum*elementInSeq]+=dic[0][elementInSeq]\r\n dic[0][favNum*elementInSeq]+=1\r\n\r\n# print(dic)\r\nprint(sum(dic[2].values()))", "from collections import defaultdict as dd\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nright_d=dd(int)\r\nleft_d=dd(int)\r\nfor i in range(n):\r\n right_d[arr[i]]+=1\r\nans=0\r\npre=0\r\nnext=0\r\nfor i in range(n):\r\n right_d[arr[i]]-=1\r\n if arr[i] % k==0:\r\n pre=arr[i]//k\r\n next=arr[i]*k\r\n ans+=(left_d[pre]*right_d[next])\r\n left_d[arr[i]]+=1\r\nprint(ans)", "# 2022-07-30T20:45:49Z\nfrom collections import Counter\n\n\ndef proc(n, k, a):\n c0 = Counter()\n c1 = Counter()\n c2 = Counter()\n\n for e in a:\n if e % k == 0:\n if (e // k) in c1:\n c2[e] += c1[e // k]\n if (e // k) in c0:\n c1[e] += c0[e // k]\n c0[e] += 1\n return sum(c2.values())\n\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nans = proc(n, k, a)\nprint(ans)", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\nl=input().split()\r\nli=[int(i) for i in l]\r\nhashipref=dict()\r\nhashisuff=dict()\r\nfor i in range(n-1,0,-1):\r\n if(li[i] not in hashisuff):\r\n hashisuff[li[i]]=1\r\n else:\r\n hashisuff[li[i]]+=1\r\nans=0\r\nfor i in range(1,n):\r\n if(li[i-1] not in hashipref):\r\n hashipref[li[i-1]]=0\r\n hashipref[li[i-1]]+=1\r\n hashisuff[li[i]]-=1\r\n if(li[i]%k==0 and li[i]//k in hashipref and li[i]*k in hashisuff):\r\n ans+=(hashipref[li[i]//k]*hashisuff[li[i]*k])\r\nprint(ans)\r\n", "import math\r\ndef main(arr,k):\r\n\r\n\r\n\r\n left={}\r\n right={}\r\n for e in arr:\r\n if e not in right:\r\n right[e]=0 \r\n right[e]+=1 \r\n ans=0\r\n for i in range(len(arr)):\r\n\r\n right[arr[i]]-=1 \r\n\r\n val_l=arr[i]/k \r\n val_r=arr[i]*k \r\n if val_l ==int(val_l):\r\n val_l=int(val_l) \r\n if val_l in left and val_r in right:\r\n ans+=left[val_l]*right[val_r]\r\n if arr[i] not in left:\r\n left[arr[i]]=0 \r\n left[arr[i]]+=1 \r\n return ans\r\nn,k=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nprint(main(arr,k))\r\n", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n max = max(a)\r\n ans = 0\r\n map = {}\r\n dp = [[0 for i in range(n + 1)] for j in range(4)]\r\n for i in range(1, n + 1):\r\n dp[1][i] = 1\r\n for i in range(2, 4):\r\n for j in range(n-1, -1, -1):\r\n if a[j] * k in map.keys():\r\n v = map[a[j] * k]\r\n dp[i][j + 1] = v\r\n if a[j] not in map.keys():\r\n map[a[j]] = 0\r\n map[a[j]] += dp[i-1][j + 1]\r\n map.clear()\r\n print(sum(dp[3]))\r\n", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl, r = defaultdict(lambda : 0), defaultdict(lambda : 0)\r\nfor i in a:\r\n r[i] += 1\r\nans = 0\r\nfor i in range(n - 1):\r\n ai = a[i]\r\n r[ai] -= 1\r\n if not ai % k:\r\n u, v = ai // k, ai * k\r\n if u in l and v in r:\r\n ans += l[u] * r[v]\r\n l[ai] += 1\r\nprint(ans)", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\npre, suf = Counter(), Counter(a)\r\nans = 0\r\n\r\nfor x in a:\r\n suf[x] -= 1\r\n if x % k == 0: ans += pre[x//k] * suf[x*k]\r\n pre[x] += 1\r\n\r\nprint(ans)", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\ndef solve():\r\n n,k = [int(x) for x in stdin.readline().split()]\r\n a = [int(x) for x in stdin.readline().split()]\r\n \r\n L = defaultdict(int)\r\n answ = [0]*n\r\n for i in range(n):\r\n if a[i] % k == 0:\r\n answ[i] = L[a[i]/k]\r\n else:\r\n answ[i] = 0\r\n L[a[i]]+=1\r\n\r\n R = defaultdict(int)\r\n for i in range(n-1,-1,-1):\r\n answ[i] *= R[a[i]*k]\r\n R[a[i]]+=1\r\n\r\n print(sum(answ))\r\nif __name__ == '__main__':\r\n solve()", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nfirst = defaultdict(lambda : 0)\r\nsecond = defaultdict(lambda : 0)\r\nans = 0\r\n\r\nfor i in range(0,n):\r\n x = a[i]\r\n if(x%k==0):\r\n ans += second[x/k]\r\n if(x%k==0):\r\n second[x] += first[x/k]\r\n first[x]+=1\r\n\r\nprint(ans)", "s=0\nm={}\no={}\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\nfor a in l:\n if a%k==0:\n s+=m.get(a/k,0)\n m[a]=m.get(a,0)+o.get(a/k,0)\n o[a]=o.get(a,0)+1\nprint(s)", "def process(A, k):\r\n answer = 0\r\n k2 = k*k\r\n counts = {}\r\n counts2 = {}\r\n for x in A:\r\n if x % k2==0:\r\n if x//k2 in counts2:\r\n answer+=counts2[x//k2]\r\n if x % k==0:\r\n if x//k in counts:\r\n if x//k not in counts2:\r\n counts2[x//k] = 0\r\n counts2[x//k]+=counts[x//k]\r\n if x not in counts:\r\n counts[x] = 0\r\n counts[x]+=1\r\n # print(counts, counts2)\r\n return answer\r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprint(process(A, k))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 31 08:27:48 2021\r\n\r\n@author: Mo'men\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nk2 = k**2\r\ncounter = 0\r\n\r\nfirst_level = dict()\r\nsecond_level = dict()\r\n\r\nfor i in range(n): \r\n if arr[i] % k2 == 0:\r\n s = second_level.get(int(arr[i] / k))\r\n if s != None:\r\n counter += s\r\n if arr[i] % k == 0:\r\n f = first_level.get(int(arr[i] / k))\r\n if f != None:\r\n if second_level.get(arr[i]) != None:\r\n second_level[arr[i]] += f\r\n else:\r\n second_level[arr[i]] = f\r\n if first_level.get(arr[i]) != None:\r\n first_level[arr[i]] += 1\r\n else:\r\n first_level[arr[i]] = 1\r\n\r\n\r\nprint(counter)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nleft_counts = {}\r\nright_counts = {}\r\nfor ai in a:\r\n if ai in right_counts:\r\n right_counts[ai] += 1\r\n else:\r\n right_counts[ai] = 1\r\n\r\ncount = 0\r\nfor ai in a:\r\n right_counts[ai] -= 1\r\n if ai % k == 0:\r\n left = ai // k\r\n right = ai * k\r\n if left in left_counts and right in right_counts:\r\n count += left_counts[left] * right_counts[right]\r\n if ai in left_counts:\r\n left_counts[ai] += 1\r\n else:\r\n left_counts[ai] = 1\r\n\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import *\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(lambda: defaultdict(int))\r\n\r\nfor ai in a:\r\n if ai%k==0:\r\n cnt[ai][2] += cnt[ai//k][1]\r\n cnt[ai][1] += cnt[ai//k][0]\r\n \r\n cnt[ai][0] += 1\r\n \r\nans = 0\r\n\r\nfor k in cnt:\r\n ans += cnt[k][2]\r\n\r\nprint(ans)", "n, k = input().split()\r\nn, k = int(n), int(k)\r\n\r\narr = list(map(int, input().split()))\r\n\r\nCount = 0\r\nH, F = {}, {}\r\n\r\nfor i in range(n):\r\n \r\n if arr[i]%k != 0 or not arr[i]//k in H: H[arr[i]] = 0\r\n else: \r\n Count += H[arr[i]//k]\r\n H[arr[i]] = H.get(arr[i], 0) + F.get(arr[i]//k, 0)\r\n \r\n \r\n F[arr[i]] = F.get(arr[i], 0) + 1\r\n \r\nprint(Count)", "import bisect\r\nn,k=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nD={}\r\nfor j in range(n):\r\n if L[j] not in D:\r\n D[L[j]]=[j]\r\n else:\r\n D[L[j]].append(j)\r\nans=0\r\nfor m in range(n):\r\n x=L[m]\r\n a1=m\r\n if x%k!=0:\r\n continue\r\n y=x//k\r\n z=x*k\r\n if y not in D or z not in D:\r\n continue\r\n a2=bisect.bisect_left(D[y],a1)\r\n a3=bisect.bisect_right(D[z],a1)\r\n ans+=a2*(len(D[z])-a3)\r\nprint(ans)\r\n\r\n", "from collections import defaultdict\r\nfrom math import *\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline()[:-1]\r\ninp = lambda: list(map(int, input().split()))\r\n\r\ndp = defaultdict(lambda: [0, 0])\r\nn, k = inp()\r\narr = inp()\r\nret = 0\r\nfor c in arr:\r\n if c % k == 0:\r\n ret += dp[(c//k)][1]\r\n dp[c][1] += dp[c//k][0]\r\n dp[c][0] += 1\r\nprint(ret)\r\n", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\nd = [defaultdict(int) for _ in range(3)]\r\narr = list(map(int, input().split()))\r\nfor x in arr:\r\n\td[2][k * x] += d[1][x]\r\n\td[1][k * x] += d[0][x]\r\n\td[0][k * x] += 1\r\nprint(sum(d[2].values()))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nleft = dict()\r\nright = dict()\r\nfor i in range(n):\r\n if a[i] in right:\r\n right[a[i]]+=1\r\n else:\r\n right.update({a[i]:1})\r\n left.update({a[i]:0})\r\nans = 0\r\nfor i in range(n):\r\n right[a[i]]-=1\r\n if not a[i]%k:\r\n if a[i]//k in left and a[i]*k in right:\r\n ans += left[a[i]//k]*right[a[i]*k]\r\n left[a[i]]+=1\r\nprint(ans)\r\n", "from collections import Counter\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\npr=Counter()\r\nnx=Counter(a)\r\nres=0\r\nfor i in a:\r\n\tnx[i]-=1\r\n\tif not i%k:\r\n\t\tres+=nx[i*k]*pr[i//k]\r\n\tpr[i]+=1\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n \r\n# from math import gcd, isqrt, ceil\r\nfrom collections import defaultdict, deque\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n \r\n d1, d2 = defaultdict(int), defaultdict(int)\r\n ans = zero = 0\r\n for i in a:\r\n if i == 0:\r\n d1[i] += 1\r\n zero += 1\r\n continue\r\n if i % k == 0:\r\n ans += d2[i//k]\r\n d1[i] += 1\r\n d2[i] += (i%k == 0) * (d1[i//k])\r\n\r\n ans += (zero * (zero-1) * (zero-2) // 6)\r\n\r\n if k == 1:\r\n ans = 0\r\n for i in d1.values():\r\n ans += (i * (i - 1) * (i - 2) // 6)\r\n \r\n print(ans)", "def main(arr,k,l=3):\r\n\r\n dp=[[0 for i in range(l+1)] for j in range(len(arr))]\r\n vals={}\r\n for i in range(len(dp)):\r\n\r\n dp[i][1]=1 \r\n \r\n for i in range(len(dp)):\r\n for j in range(2,len(dp[0])):\r\n\r\n val=arr[i]\r\n val_n=arr[i]/k \r\n\r\n if val_n==int(val_n):\r\n val_n=int(val_n) \r\n if (val_n,j-1) in vals:\r\n dp[i][j]+=vals[(val_n,j-1)]\r\n \r\n prev=dp[i][j-1]\r\n prev_val=arr[i] \r\n if (prev_val,j-1) not in vals:\r\n vals[(prev_val,j-1)]=0 \r\n vals[(prev_val,j-1)]+=prev \r\n \r\n ans=0\r\n \r\n for i in range(len(dp)):\r\n ans+=dp[i][l]\r\n return ans \r\nn,k=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\n\r\nprint(main(arr,k))\r\n\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nimport math\n #int(input())\n #arr = list(map(int, input().split()))\n #n,m = map(int, input().split())\n #graph = defaultdict(list)\n \n #a,b = map(int, input().split())\n #graph[a].append(b)\n #graph[b].append(a)\n #MOD = 10**9 + 7\n\ndef solution():\n _, k = map(int, input().split())\n arr = list(map(int, input().split()))\n\n before = [0]*len(arr)\n h = defaultdict(int)\n for i,val in enumerate(arr):\n if val % k == 0:\n before[i] = h[val//k]\n h[val] += 1\n \n after = [0]*len(arr)\n h = defaultdict(int)\n for i in range(len(arr))[::-1]:\n val = arr[i]\n if val % k == 0:\n after[i] = h[k*val]\n h[val] += 1\n \n print(sum([before[i]*after[i] for i in range(len(arr))]))\n\n\n\n\n\n \n \n\n \n\n\n\n \n \n \n \n \n \n\n \n\n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=solution)\n#thread.start(); thread.join()\nsolution()\n", "import sys\r\nfrom collections import defaultdict\r\n\r\ninput = sys.stdin.readline\r\nfirst = defaultdict(lambda : 0)\r\nsecond = defaultdict(lambda : 0)\r\ncnt = 0\r\n\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfor i in range(0,n):\r\n if(a[i]%k == 0):\r\n cnt += second[a[i]//k]\r\n second[a[i]] += first[a[i]//k]\r\n first[a[i]]+=1\r\n\r\nprint(cnt)\r\n ", "from collections import Counter\r\n\r\ndef solve(n, k, arr):\r\n c1 = Counter()\r\n c2 = Counter()\r\n total = 0\r\n\r\n for a in reversed(arr):\r\n total += c2[a*k]\r\n c2[a] += c1[a*k]\r\n c1[a] += 1\r\n return total\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(solve(n, k, arr))", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\n\r\ndef main():\r\n\tn, k = map(int, stdin.readline().split())\r\n\tar = list(map(int, stdin.readline().split()))\r\n\tans = 0\r\n\tpre = {}\r\n\tsuf = {}\r\n\tfor i in ar:\r\n\t\tif suf.__contains__(i):\r\n\t\t\tsuf[i] += 1\r\n\t\telse:\r\n\t\t\tsuf[i] = 1\r\n\tfor i in range(n):\r\n\t\tsuf[ar[i]]-=1\r\n\t\tif ar[i]%k==0:\r\n\t\t\tans+=pre.get(ar[i]//k,0)*suf.get(ar[i]*k,0)\r\n\t\tif pre.__contains__(ar[i]):\r\n\t\t\tpre[ar[i]] += 1\r\n\t\telse:\r\n\t\t\tpre[ar[i]] = 1\r\n\tprint(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "from collections import defaultdict\r\nn,k=map(int,input().split())\r\nnums=list(map(int,input().split()))\r\ndp=[0 for _ in range(n)]\r\nhashmap=defaultdict(int)\r\ncounter=defaultdict(int)\r\nans=0\r\nfor num in nums:\r\n if num%k==0:\r\n ans+=hashmap[num//k]\r\n hashmap[num] += counter[num // k]\r\n counter[num]+=1\r\nprint(ans)", "import sys,collections\r\ninput = sys.stdin.readline\r\nn,k = map(int,input().split())\r\nfirst = collections.Counter()\r\nsecond = collections.Counter()\r\nans = 0\r\n\r\nfor a in list(map(int,input().split())):\r\n \r\n if a%k == 0:\r\n ans += second[a//k]\r\n second[a] += first[a//k]\r\n \r\n first[a] += 1\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns1={}\r\ns2={}\r\nans=0\r\nfor aa in a:\r\n if aa%k==0:\r\n ans+=s1.get(aa//k,0)\r\n s1[aa]=s1.get(aa,0)+s2.get(aa//k,0)\r\n s2[aa]=s2.get(aa,0)+1\r\nprint(ans)", "n , k = map(int, input().split())\r\n \r\narr = list(map(int, input().split()))\r\ncounter = 0\r\n\r\n# To store no.of every element occurrence.\r\nelement_occurrence = {}\r\n\r\n# To store no.of every element occurrence which has a valid value (Geometric Progression) .\r\n# this store How many time this element valid to be used in Geometric Progression.\r\nelement_counter = {}\r\n\r\n\r\n\r\nfor i in range(n):\r\n element = arr[i]\r\n\r\n if (element % k == 0):\r\n counter += element_counter.get(element/ k , 0)\r\n element_counter[element] = element_counter.get(element, 0) + element_occurrence.get(element/ k , 0)\r\n\r\n element_occurrence[element] = element_occurrence.get(element, 0)+1\r\n\r\nprint(counter)", "from sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\n# setrecursionlimit(int(1e6))\r\ninf = float('inf')\r\nfrom functools import cmp_to_key\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\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\n\r\ndef solve():\r\n n, k = geti()\r\n a = getl()\r\n index = dd(int)\r\n for i in range(n):\r\n index[a[i]] += 1\r\n ans = 0\r\n occur = dd(int)\r\n occur[a[0]] += 1\r\n index[a[0]] -= 1\r\n for i in range(1, n):\r\n index[a[i]] -= 1\r\n if a[i] % k == 0:\r\n prev = a[i] // k\r\n new = a[i] * k\r\n left = occur[prev]\r\n right = index[new]\r\n ans += left * right\r\n occur[a[i]] += 1\r\n\r\n print(ans)\r\n\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n solve()\r\n", "from collections import defaultdict\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans = 0\r\nmp = {}\r\n\r\nfor i in range(n):\r\n if arr[i] in mp:\r\n mp[arr[i]] += 1\r\n else:\r\n mp[arr[i]] = 1\r\n\r\nmp2 = {}\r\n\r\nfor i in range(n - 1, -1, -1):\r\n a = 0\r\n mp[arr[i]] -= 1\r\n if arr[i] * k in mp2:\r\n a = mp2[arr[i] * k]\r\n b = 0\r\n if arr[i] % k == 0:\r\n if arr[i] // k in mp:\r\n b = mp[arr[i] // k]\r\n \r\n ans += a * b\r\n if arr[i] in mp2:\r\n mp2[arr[i]] += 1\r\n else:\r\n mp2[arr[i]] = 1\r\n\r\nprint(ans)\r\n", "import collections\r\nk=int(input().split()[1])\r\nd=[collections.defaultdict(int)for _ in\"123\"]\r\nfor x in map(int,input().split()):\r\n\td[2][k*x]+=d[1][x]\r\n\td[1][k*x]+=d[0][x]\r\n\td[0][k*x]+=1\r\nprint(sum(d[2].values()))", "import sys\nfrom collections import Counter\nn , k = map(int , input().split())\na = list(map(int , input().split()))\nleft = Counter(a)\nright = Counter()\n\nans = 0\n\n\nfor i in a:\n left[i] -= 1\n if i % k == 0:\n ans += left[i*k] * right[i//k]\n right[i] += 1\nprint(ans)\n" ]

[ "def ceilDiv(a, b):\r\n return a // b + (0 if a % b == 0 else 1)\r\ndef nik(rud,pig,panda):\r\n jul, lol = rud % panda, pig % panda\r\n if (lol == 0):\r\n lol = panda\r\n if (jul == 0):\r\n jul = panda\r\n print(jul * lol * ceilDiv(rud, panda) * ceilDiv(pig, panda))\r\nrud, pig, panda = map(int, input().split())\r\nnik(rud,pig,panda)", "nms = input().split()\nnmsInt = [int(i) for i in nms]\nn = nmsInt[0]\nm = nmsInt[1]\ns = nmsInt[2]\n\nif (s == 1 or (s >= m and s >= n) or (m % s == 0 and n % s == 0)):\n print(m*n)\nelse:\n n1 = ((n-1) // s) + 1 \n n2 = ((n-1) % s) + 1\n m1 = ((m-1) // s) + 1\n m2 = ((m-1) % s) + 1\n print(n1*n2*m1*m2)\n \t \t\t \t\t \t \t \t\t \t \t\t \t \t", "n, m, s = map(int, input().split())\n\ndef ceilDiv(a, b):\n return a // b + (0 if a % b == 0 else 1)\n\nsgsx, sgsy = n % s, m % s\n\nif sgsx == 0:\n sgsx = s\n\nif sgsy == 0:\n sgsy = s\n\nprint(sgsx * sgsy * ceilDiv(n, s) * ceilDiv(m, s))\n", "n,m,s=map(int,input().split())\r\nprint(((n-1)//s+1)*((n-1)%s+1)*((m-1)//s+1)*((m-1)%s+1))", "n,m,k = map(int,input().split(\" \"))\r\nl=((n-1)//k)*k+1\r\nw=((m-1)//k)*k+1\r\na=((n-1)//k+1)*((m-1)//k+1)\r\nans=(n-l+1)*(m-w+1)*a\r\nprint(ans)", "#codeforces 32c flea, math\r\n\r\ndef readGen(transform):\r\n\twhile (True):\r\n\t\tn=0\r\n\t\ttmp=input().split()\r\n\t\tm=len(tmp)\r\n\t\twhile (n<m):\r\n\t\t\tyield(transform(tmp[n]))\r\n\t\t\tn+=1\r\n\r\nreadint=readGen(int)\r\n\r\nn,m,s=next(readint),next(readint),next(readint)\r\na=(m-1)//s+1\r\nb=(n-1)//s+1\r\nw=m-(a-1)*s-1\r\nh=n-(b-1)*s-1\r\nprint(a*b*(w+1)*(h+1))\r\n", "r,c,d = map(int,input().split())\r\nctr = ctc = 0\r\nif(d>r or r%d == 0):\r\n ctr = r\r\nelse:\r\n ctr = r//d + 1\r\n ctr *= r-(r//d)*d\r\nif(d>c or c%d == 0):\r\n ctc = c\r\nelse:\r\n ctc = c//d + 1\r\n ctc *= c-(c//d)*d\r\n\r\nprint(ctr*ctc)", "n , m , s = map ( int , input().split() )\r\n\r\ndef modd ( a , s ) :\r\n \r\n ans = a % s\r\n \r\n if ans == 0 :\r\n \r\n return s\r\n \r\n return ans\r\n \r\nprint ( modd(n,s) * modd(m,s) * ( (n+s-1)//s ) * ( (m+s-1)//s ) )\r\n \r\n ", "n, m, s = map(int, input().split())\r\nn -=1\r\nm -= 1\r\nprint((n//s+1)*(n%s+1)*(m//s+1)*(m%s+1))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, s = map(int, input().split())\r\ncx, cy = 1, 1\r\nx0, y0 = 0, 0\r\nwhile x0 + s < n:\r\n x0 += s\r\n cx += 1\r\nwhile y0 + s < m:\r\n y0 += s\r\n cy += 1\r\nans = (n - x0) * (m - y0) * cx * cy\r\nprint(ans)", "n,m,s=map(int,input().split())\r\nr = (-(-n//s)) * (s if n%s==0 else n%s)\r\nc = (-(-m//s)) * (s if m%s==0 else m%s)\r\nprint(r*c)", "n,m,k=input().split()\r\nn=int(n)\r\nm=int(m)\r\nk=int(k)\r\na=n%k\r\nb=m%k\r\nc=int(n/k)\r\nd=int(m/k)\r\n\r\nif a==0:a=k\r\nelse:c+=1\r\nif b==0:b=k\r\nelse:d+=1\r\nprint(str(a*b*c*d))", "n,m,s=map(int,input().split())\r\nhreachable=(n-1)//s\r\nvreachable=(m-1)//s\r\nhextra = (n-1)%s\r\nvextra=(m-1)%s\r\nonepass=max((hreachable+1)*(vreachable+1),0)*((hextra+1)*(vextra+1))\r\nprint(onepass)", "n, m ,s = map(int, input().split())\r\nans = (n - 1) // s + 1\r\nans *= ((m - 1) // s + 1)\r\nans *= ((n - 1) % s + 1)\r\nans *= ((m - 1) % s + 1)\r\nprint(ans)", "import math\nx,y,j = map(int,input().split())\n\nprint(((math.ceil(x/j)) * (j if x%j == 0 else x%j)) * (math.ceil(y/j)) * (j if y%j == 0 else y%j))\n", "# Adrián Alejandro Salgado Martínez\n# A00828843\n\n\n# This was insane.\ndef possible_start_positions(l, s):\n # if c <= d:\n # return c\n\n positions = (l - 1) // s + 1\n shifts = (l - 1) % s + 1\n\n return positions * shifts\n\n\nn, m, s = map(int, input().split())\n\nhorizontal_positions = possible_start_positions(n, s)\nvertical_positions = possible_start_positions(m, s)\n\nprint(horizontal_positions * vertical_positions)\n\n \t\t\t \t \t\t\t\t\t\t\t\t \t \t \t \t\t", "n, m, s = map(int, input().split())\r\n\r\n\r\ndef max_one_direction(k):\r\n if k % s:\r\n return (k // s + 1) * (k % s)\r\n else:\r\n return k\r\n\r\n\r\nprint(max_one_direction(n) * max_one_direction(m))\r\n", "ceil1 = lambda a, b: (a + b - 1) // b\r\nn, m, s = map(int, input().split())\r\n\r\nans = 1\r\nif s < n:\r\n mod = n % s if n % s else s\r\n ans *= ceil1(n, s) * mod\r\nelse:\r\n ans *= n\r\n\r\nif s < m:\r\n mod = m % s if m % s else s\r\n ans *= ceil1(m, s) * mod\r\nelse:\r\n ans *= m\r\nprint(ans)\r\n", "n,m,s=map(int,input().split())\r\n\r\n# UnionFind\r\n\r\nGroup = [i for i in range(n)] # グループ分け\r\nNodes = [1]*n # 各グループのノードの数\r\n\r\ndef find(x):\r\n while Group[x] != x:\r\n x=Group[x]\r\n return x\r\n\r\ndef Union(x,y):\r\n if find(x) != find(y):\r\n if Nodes[find(x)] < Nodes[find(y)]:\r\n \r\n Nodes[find(y)] += Nodes[find(x)]\r\n Nodes[find(x)] = 0\r\n Group[find(x)] = find(y)\r\n \r\n else:\r\n Nodes[find(x)] += Nodes[find(y)]\r\n Nodes[find(y)] = 0\r\n Group[find(y)] = find(x)\r\n\r\nfor i in range(s,n):\r\n Union(i,i-s)\r\n\r\nMAX=max(Nodes)\r\n\r\nANS=0\r\nfor i in range(n):\r\n if Nodes[find(i)]==MAX:\r\n ANS+=1\r\n\r\nGroup = [i for i in range(m)] # グループ分け\r\nNodes = [1]*m # 各グループのノードの数\r\n\r\nfor i in range(s,m):\r\n Union(i,i-s)\r\n\r\nMAX=max(Nodes)\r\n\r\nANS2=0\r\nfor i in range(m):\r\n if Nodes[find(i)]==MAX:\r\n ANS2+=1\r\n\r\nprint(ANS*ANS2)\r\n", "n,m,s=[int(s) for s in input().split()]\r\na=(n % s)\r\nb=(m % s)\r\nif a==0 and n>=s:a=s\r\nif b==0 and m>=s:b=s\r\nunit=(a*b)\r\n\r\nprint(((n-1)//s+1)*((m-1)//s+1)*unit)\r\n", "# LUOGU_RID: 102606035\nn, m, s = map(int, input().split())\r\nprint((0--n // s) * ((n - 1) % s + 1) * (0--m // s) * ((m - 1) % s + 1))" ]

[ "choices = {\r\n \"0\": 2,\r\n \"1\": 7,\r\n \"2\": 2,\r\n \"3\": 3,\r\n \"4\": 3,\r\n \"5\": 4,\r\n \"6\": 2,\r\n \"7\": 5,\r\n \"8\": 1,\r\n \"9\": 2\r\n}\r\nn = input()\r\nout = choices[n[0]]*choices[n[1]] \r\nprint(out)", "m = {0:2, 1:7, 2:2, 3:3, 4:3, 5:4, 6:2, 7:5, 8:1, 9:2}\r\ni = list(map(int,list(input())))\r\nc = 1\r\nfor x in i:\r\n c *= m[x]\r\nprint(c)", "# -*- coding: utf-8 -*-\n\nngoods = {\n '0': 2,\n '1': 7,\n '2': 2,\n '3': 3,\n '4': 3,\n '5': 4,\n '6': 2,\n '7': 5,\n '8': 1,\n '9': 2\n}\n\ndigits = input().strip()\nprint(ngoods[digits[0]] * ngoods[digits[1]])\n", "'''input\n00\n'''\ni = input()\nd = {\n0: [0, 8],\n1: [0, 1, 3, 4, 7, 8, 9],\n2: [2, 8],\n3: [3, 8, 9],\n4: [4, 8, 9],\n5: [5, 6, 8, 9],\n6: [6, 8],\n7: [0, 3, 7, 8, 9],\n8: [8],\n9: [8, 9],\n}\na, b = int(i[0]), int(i[1])\na, b = d[a], d[b]\nprint(len(a) * len(b))", "l = [2,7,2,3,3,4,2,5,1,2]\r\ns = input()\r\nprint(l[int(s[0])]*l[int(s[1])])", "#!/usr/bin/env python3\n\na, b = map(int, [c for c in input()])\nsample = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\nprint(sample[a] * sample[b])\n", "t = input()\r\na = int(t[0])\r\nb = int(t[1])\r\nc = []\r\nc.append(2)\r\nc.append(7)\r\nc.append(2)\r\nc.append(3)\r\nc.append(3)\r\nc.append(4)\r\nc.append(2)\r\nc.append(5)\r\nc.append(1)\r\nc.append(2)\r\nprint(c[a]*c[b])", "n = input()\nl = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\nprint(l[int(n[0])] * l[int(n[1])])\n", "n=input()\r\ng={}\r\ng[0]=2\r\ng[1]=7\r\ng[2]=2\r\ng[3]=3\r\ng[4]=3\r\ng[5]=4\r\ng[6]=2\r\ng[7]=5\r\ng[8]=1\r\ng[9]=2\r\nprint (g[int(n[0])]*g[int(n[1])])", "IL = lambda: list(map(int, input().split()))\r\nIS = lambda: input().split()\r\nI = lambda: int(input())\r\nS = lambda: input()\r\n\r\ndmap = {0:2, 1:7, 2:2, 3:3, 4:3,\r\n 5:4, 6:2, 7:5, 8:1, 9:2}\r\ndigits = S()\r\nprint(dmap[int(digits[0])] * dmap[int(digits[1])])", "digits = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nn = int(input())\r\n\r\nprint(digits[n // 10] * digits[n % 10])\r\n", "def input_split(f): return map(f, input().split())\n\n\ndef main():\n n1, n2 = input()\n d = {\n \"0\": 2, # 0,8\n \"1\": 7, # 0,1,3,4,7,8,9\n \"2\": 2, # 2,8\n \"3\": 3, # 3,9,8\n \"4\": 3, # 4,8,9\n \"5\": 4, # 5,6,8,9\n \"6\": 2, # 6, 8\n \"7\": 5, # 0, 3, 7, 8, 9\n \"8\": 1,\n \"9\": 2, # 8,9\n }\n print(d[n1]*d[n2])\n\nif __name__ == \"__main__\":\n main()\n", "l = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\ns = input()\r\nk = 1\r\nfor i in s:\r\n k *= l[int(i)]\r\nprint(k)", "\r\nnum=input()\r\nd={0:2,1:7,2:2,3:3,4:3,5:4,6:2,7:5,8:1,9:2}\r\nprint(d[int(num[0])]*d[int(num[1])])", "gd = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nn = int(input())\r\nprint(gd[n // 10] * gd[n % 10])", "s=input()\r\nl=[1,6,1,2,2,3,1,4,0,1]\r\nm=1\r\nfor i in range(2):\r\n m*=l[int(s[i])]+1\r\n\r\nprint(m)\r\n", "d={0:2,1:7,2:2,3:3,4:3,5:4,6:2,7:5,8:1,9:2}\r\ns=input().rstrip()\r\nprint(d[int(s[0])]*d[int(s[1])])", "s = int(input())\narr = [[1,1,0,0,0,0,0,1,0,0],\n [0,1,0,0,0,0,0,0,0,0],\n [0,0,1,0,0,0,0,0,0,0],\n [0,1,0,1,0,0,0,1,0,0],\n [0,1,0,0,1,0,0,0,0,0],\n [0,0,0,0,0,1,0,0,0,0],\n [0,0,0,0,0,1,1,0,0,0],\n [0,1,0,0,0,0,0,1,0,0],\n [1,1,1,1,1,1,1,1,1,1],\n [0,1,0,1,1,1,0,1,0,1]]\na = 0\nb = 0\nfor i in range(10):\n\tif arr[i][s % 10]:\n\t\ta += 1\n\tif arr[i][s // 10]:\n\t\tb += 1\nprint(a * b)\n", "nums = [2,7,2,3,3,4,2,5,1,2]\nn = int(input())\nfirst = n % 10\nlast = n//10\nprint(nums[first]*nums[last])", "n = input()\r\ncode = {0: (0, 8),\r\n 1: (0, 1, 3, 4, 7, 8, 9),\r\n 2: (2, 8),\r\n 3: (3, 8, 9),\r\n 4: (4, 8, 9),\r\n 5: (5, 6, 8, 9),\r\n 6: (6, 8),\r\n 7: (0, 3, 7, 8, 9),\r\n 8: (8,),\r\n 9: (8, 9)}\r\n\r\nprint(len(code[int(n[0])]) * len(code[int(n[1])]))", "arr = [[0, 8], [0, 1, 3, 4, 7, 8, 9], [2, 8], [3, 8, 9], [4, 8, 9], [5, 6, 8, 9], [6, 8], [0, 3, 7, 8, 9],\r\n [8], [8, 9]]\r\ns = input()\r\nprint(len(arr[int(s[0])]) * len(arr[int(s[1])]))\r\n", "def main():\n m = (\n (1, 1, 1, 0, 1, 1, 1), (0, 0, 1, 0, 0, 1, 0), (1, 0, 1, 1, 1, 0, 1), (1, 0, 1, 1, 0, 1, 1),\n (0, 1, 1, 1, 0, 1, 0),\n (1, 1, 0, 1, 0, 1, 1), (1, 1, 0, 1, 1, 1, 1), (1, 0, 1, 0, 0, 1, 0), (1, 1, 1, 1, 1, 1, 1),\n (1, 1, 1, 1, 0, 1, 1))\n u, v = map(int, input())\n tot = 0\n for i in range(100):\n x, y = divmod(i, 10)\n diff = 0\n for aa, bb in ((u, x), (v, y)):\n for a, b in zip(m[aa], m[bb]):\n if a > b:\n diff = 100\n break\n diff += a < b\n if diff < 100:\n tot += 1\n print(tot)\n\n\nif __name__ == '__main__':\n main()\n", "data = []\r\ndata.extend([2,7,2,3,3,4,2,5,1,2])\r\nline = input()\r\nx = data[int(line[0])]\r\ny = data[int(line[1])]\r\nprint(x*y)\r\n", "x,n=[2,7,2,3,3,4,2,5,1,2],int(input())\nprint(x[n//10]*x[n%10])\n", "def indicate(m):\r\n a = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\n return a[m // 10] * a[m % 10]\r\n\r\n\r\nprint(indicate(int(input())))\r\n", "n = int(input())\r\np = [2,7,2,3,3,4,2,5,1,2]\r\nprint(p[(n//10)%10]*p[n%10])\r\n", "n=int(input())\r\nm=[]\r\nm.append(int(2))\r\nm.append(int(7))\r\nm.append(int(2))\r\nm.append(int(3))\r\nm.append(int(3))\r\nm.append(int(4))\r\nm.append(int(2))\r\nm.append(int(5))\r\nm.append(int(1))\r\nm.append(int(2))\r\nans=0\r\nans+=m[n//10]*m[n%10]\r\nprint(ans)", "\r\nlist1=[2,7,2,3,3,4,2,5,1,2];\r\nch=int(input())\r\nprint((list1[ch%10])*(list1[int(ch/10)]))\r\n\r\n", "t = [2,7,2,3,3,4,2,5,1,2]\r\nn = int(input())\r\nprint(t[(int(n//10))]*t[int(n%10)]);\r\n", "mp = {\n '0': ['0', '8'],\n '1': ['0', '1', '3', '4', '7', '8', '9'],\n '2': ['2', '8'],\n '3': ['3', '8', '9'],\n '4': ['4', '8', '9'],\n '5': ['5', '6', '8', '9'],\n '6': ['6', '8',],\n '7': ['0', '3', '7', '8', '9'],\n '8': ['8'],\n '9': ['9', '8']\n}\ns = input()\n\nans = len(mp.get(s[0])) * len(mp.get(s[1]))\n\nprint(ans)\n\n\t \t\t\t \t\t \t\t \t \t \t\t \t \t \t \t", "z=[2,7,2,3,3,4,2,5,1,2]\r\nc=list(map(int,input()))\r\nprint(z[c[0]]*z[c[1]])\r\n", "d = {\n '0': ['0', '8'],\n '1': ['0', '1', '3', '4', '7', '8', '9'],\n '2': ['2', '8'],\n '3': ['3', '8', '9'],\n '4': ['4', '8', '9'],\n '5': ['5', '6', '8', '9'],\n '6': ['6', '8'],\n '7': ['0', '3', '7', '8', '9'],\n '8': ['8'],\n '9': ['8', '9']\n }\n\na = input()\nb = d[a[0]]\nc = d[a[1]]\n\nans = len(b) * len(c)\nprint(ans)\n", "n=input()\r\ndic={'0':2,'1':7,'2':2,'3':3,'4':3,'5':4,'6':2,'7':5,'8':1,'9':2}\r\nprint(dic[n[0]]*dic[n[1]])\r\n", "s = {0: [0, 8], 1: [0, 1, 3, 4, 7, 8, 9], 2: [2, 8], 3: [3, 8, 9], 4: [4, 8, 9], 5: [5, 6, 8, 9], 6: [6, 8], 7: [0, 3, 7, 8, 9], 8: [8], 9: [9, 8]}\r\nn = list(input())\r\nans = 1\r\nfor x in n:\r\n ans *= len(s[int(x)])\r\nprint(ans)", "'''\r\nCreated on ١٣‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\nt = input()\r\nlis = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nprint(lis[int(t[0])] * lis[int(t[1])])\r\n", "def findC(n):\r\n if n == 0:\r\n return [0,8]\r\n elif n == 1:\r\n return [0,1,3,4,7,8,9]\r\n elif n == 2:\r\n return [2,8]\r\n elif n == 3:\r\n return [3,8,9]\r\n elif n == 4:\r\n return [4,8,9]\r\n elif n == 5:\r\n return [5,6,8,9]\r\n elif n == 6:\r\n return [6,8]\r\n elif n == 7:\r\n return [0,3,7,8,9]\r\n elif n == 8:\r\n return [8]\r\n elif n == 9:\r\n return [8,9]\r\n\r\ndef findCount(n):\r\n return len(findC(n))\r\n\r\nn = str(input())\r\nprint(findCount(int(n[0]))*findCount(int(n[1])))\r\n", "a = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\n#print(len(a))\nn = input()\nans = a[(ord(n[0]) - ord('0'))] * a[(ord(n[1]) - ord('0'))]\nprint(ans)", "active_segments = {\r\n '0': 'abcdef',\r\n '1': 'bc',\r\n '2': 'abdej',\r\n '3': 'abcdj',\r\n '4': 'bcfj',\r\n '5': 'acdfj',\r\n '6': 'acdefj',\r\n '7': 'abc',\r\n '8': 'abcdefj',\r\n '9': 'abcdfj'\r\n}\r\n\r\n\r\ndef can_be_obtained(x, n):\r\n for active_segment in active_segments[n[0]]:\r\n if active_segment not in active_segments[x[0]]:\r\n return False\r\n for active_segment in active_segments[n[1]]:\r\n if active_segment not in active_segments[x[1]]:\r\n return False\r\n return True\r\n\r\nn = input()\r\ngood_numbers_counter = 0\r\nfor i in range(100):\r\n good_numbers_counter += 1 if can_be_obtained(f'{i:02}', n) else 0\r\nprint(good_numbers_counter)", "num = input()\r\nx0 = [1,1,1,1,1,1,0]\r\nx1 = [0,0,1,1,0,0,0]\r\nx2 = [0,1,1,0,1,1,1]\r\nx3 = [0,1,1,1,1,0,1]\r\nx4 = [1,0,1,1,0,0,1]\r\nx5 = [1,1,0,1,1,0,1]\r\nx6 = [1,1,0,1,1,1,1]\r\nx7 = [0,1,1,1,0,0,0]\r\nx8 = [1,1,1,1,1,1,1]\r\nx9 = [1,1,1,1,1,0,1]\r\narr = [x0,x1,x2,x3,x4,x5,x6,x7,x8,x9]\r\n\r\nnum1,num2 = num[0], num[1]\r\nnum1 = int(num1)\r\nnum2 = int(num2)\r\n\r\ndef getComb(x):\r\n comb = []\r\n ar1 = arr[x]\r\n n = 0\r\n while n < 10:\r\n ar2 = arr[n]\r\n ok = False\r\n for i in range(7):\r\n if ar1[i] == 1 and ar2[i] == 1:\r\n ok = True\r\n elif ar1[i] == 1 and ar2[i] == 0:\r\n ok = False\r\n break\r\n if ok == True:\r\n comb.append(n) \r\n n += 1;\r\n return comb\r\n \r\n\r\ncomb1 = getComb(num1)\r\ncomb2 = getComb(num2)\r\n\r\nprint(len(comb1) * len(comb2))\r\n \r\n", "n = int(input())\r\n\r\npossible = {\"0\":2, \"1\":7, \"2\":2, \"3\":3, \"4\":3, \"5\":4, \"6\":2, \"7\":5, \"8\":1, \"9\":2}\r\n\r\nif len(str(n)) == 1:\r\n a = '0' + str(n)\r\nelse:\r\n a = str(n)\r\n\r\nfirst = possible[a[0]]\r\nsecond = possible[a[1]]\r\n\r\nprint(first*second)", "Count = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\nprint((lambda x: Count[x[0]] * Count[x[1]])(list(map(int, list(input())))))\n", "digit = [ 2, 7, 2, 3, 3, 4, 2, 5, 1, 2 ]\r\nn = int( input() )\r\nprint( digit[ n//10 ] * digit[ n%10 ] )", "n,a=input(),[2,7,2,3,3,4,2,5,1,2]\r\nprint(a[int(n[0])]*a[int(n[1])])", "n= input()\r\nx,y= int(n[0]),int(n[1])\r\npossible_digits= {0:[0,8], 1:[0,1,3,4,7,8,9], 2:[2,8], 3:[3,8,9], 4:[4,8,9], 5:[5,6,8,9], 6:[6,8], 7:[0,3,7,8,9], 8:[8], 9:[8,9]}\r\nprint(len(possible_digits[x])*len(possible_digits[y]))", "a= {'0':2,'1':7,'2':2,'3':3,'4':3,'5':4,'6':2,'7':5,'8':1,'9':2}\r\nb = input()\r\nc = 1\r\nfor i in b:\r\n c *= a[i]\r\nprint(c)", "a = list(map(int, list(input())))\r\nd = {0: {1, 2, 3, 5, 6, 7},\r\n 1: {3, 6},\r\n 2: {2, 3, 4, 5, 7},\r\n 3: {2, 3, 4, 6, 7},\r\n 4: {1, 4, 3, 6},\r\n 5: {2, 1, 4, 6, 7},\r\n 6: {2, 1, 4, 5, 6, 7},\r\n 7: {2, 3, 6},\r\n 8: {1, 2, 3, 4, 5, 6, 7},\r\n 9: {1, 2, 3, 4, 6, 7},\r\n }\r\n\r\na0 = []\r\na1 = []\r\nfor y in d:\r\n if d[a[0]].issubset(d[y]):\r\n a0.append(y)\r\n if d[a[1]].issubset(d[y]):\r\n a1.append(y)\r\nprint(len(a0) * len(a1))\r\n", "w=int\r\nx=\"2723342512\"\r\ns=input()\r\nprint(w(x[w(s[0])])*w(x[w(s[1])]))", "g=int(input())\r\ny=g%10\r\nd=g//10\r\nif y==0:\r\n a=[0,8]\r\nif y==1:\r\n a=[0,1,3,4,7,8,9]\r\nif y==2:\r\n a=[2,8]\r\nif y==3:\r\n a=[3,8,9]\r\nif y==4:\r\n a=[4,8,9]\r\nif y==5:\r\n a=[5,6,8,9]\r\nif y==6:\r\n a=[6,8]\r\nif y==7:\r\n a=[0,3,7,8,9]\r\nif y==8:\r\n a=[8]\r\nif y==9:\r\n a=[8,9]\r\nif d==0:\r\n b=[0,8]\r\nif d==1:\r\n b=[0,1,3,4,7,8,9]\r\nif d==2:\r\n b=[2,8]\r\nif d==3:\r\n b=[3,8,9]\r\nif d==4:\r\n b=[4,8,9]\r\nif d==5:\r\n b=[5,6,8,9]\r\nif d==6:\r\n b=[6,8]\r\nif d==7:\r\n b=[0,3,7,8,9]\r\nif d==8:\r\n b=[8]\r\nif d==9:\r\n b=[8,9]\r\nprint(len(a)*len(b))", "def seg_n(n):\r\n n = int(n)\r\n if n == 9:\r\n return 2\r\n elif n== 8:\r\n return 1\r\n elif n== 7:\r\n return 5\r\n elif n== 6:\r\n return 2\r\n elif n== 5:\r\n return 4\r\n elif n== 4:\r\n return 3\r\n elif n== 3:\r\n return 3\r\n elif n== 2:\r\n return 2\r\n elif n== 1:\r\n return 7\r\n else:\r\n return 2\r\nn = input()\r\nsumm = 1\r\nf = seg_n(n[0])\r\nz = seg_n(n[1])\r\nprint(f*z)\r\n", "if __name__ == '__main__':\r\n s = input()\r\n d = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\n print(d[int(s[0])] * d[int(s[1])])", "#!/usr/bin/python3\n\npossib = [2, 7, 2, 3, 3,\n 4, 2, 5, 1, 2]\ns = input()\nprint(possib[int(s[0])] * possib[int(s[1])])\n", "t,n=[2,7,2,3,3,4,2,5,1,2],int(input())\r\nprint(t[n//10]*t[n%10])", "Dict = {}\r\nDict[0]=2\r\nDict[1]=7\r\nDict[2]=2\r\nDict[3]=3\r\nDict[4]=3\r\nDict[5]=4\r\nDict[6]=2\r\nDict[7]=5\r\nDict[8]=1\r\nDict[9]=2\r\ns = [i for i in input()]\r\nx=int(s[0])\r\ny=int(s[1])\r\nprint(Dict[x]*Dict[y])", "s = input()\r\na = [1,6,1,2,2,3,1,4,0,1]\r\nprint((a[int(s[0])]+1)*(a[int(s[1])]+1))", "digits = {'0': 2, '1': 7, '2': 2, '3': 3, '4': 3, '5': 4,\r\n '6': 2, '7': 5, '8': 1, '9': 2}\r\nn = input()\r\n\r\nprint(digits[n[0]] * digits[n[1]])\r\n", "n = input()\r\nn = list(n)\r\nmylist = []\r\nfor i in range(len(n)):\r\n if n[i] == '0':\r\n mylist.append(2)\r\n elif n[i] == '1':\r\n mylist.append(7)\r\n elif n[i] == '2':\r\n mylist.append(2)\r\n elif n[i] == '3':\r\n mylist.append(3)\r\n elif n[i] == '4':\r\n mylist.append(3)\r\n elif n[i] == '5':\r\n mylist.append(4)\r\n elif n[i] == '6':\r\n mylist.append(2)\r\n elif n[i] == '7':\r\n mylist.append(5)\r\n elif n[i] == '8':\r\n mylist.append(1)\r\n elif n[i] == '9':\r\n mylist.append(2)\r\nprint(mylist[0]*mylist[1])\r\n", "N=input()\r\nDict={'0':2,'1':7,'2':2,'3':3,'4':3,'5':4,'6':2,'7':5,'8':1,'9':2}\r\nprint(Dict[N[0]]*Dict[N[1]])\r\n", "s=int(input())\r\nt=s%10\r\ns=int((s-s%10)/10)\r\na={0:2,1:7,2:2,3:3,4:3,5:4,6:2,7:5,8:1,9:2}\r\nprint(a[t]*a[s])", "dic={'1':7,'2':2,'3':3,'4':3,'5':4,'6':2,'7':5,'8':1,'9':2,'0':2}\r\n\r\ndigit=input()\r\nprint(dic[digit[0]]*dic[digit[1]])\r\n", "\"\"\"n1=[0,1,3,4,7,8,9]\nn2=[2,8]\nn3=[3,8,9]\nn4=[4,8,9]\nn5=[5,9,8,6]\nn6=[6,8]\nn7=[8,9,7,3,0]\nn8=[8]\nn9=[8,9]\nn0=[0,8]\"\"\"\nx=int(input())\nones=int(x%10)\ntens=int(x/10)\ndef get_num(y):\n\tif y==0 or y==9 or y==6 or y==2:\n\t\treturn 2\n\telif y==1:\n\t\treturn 7\n\telif y==3 or y==4:\n\t\treturn 3\n\telif y==5:\n\t\treturn 4\n\telif y==7:\n\t\treturn 5\n\telif y==8:\n\t\treturn 1\n\nprint (get_num(ones)*get_num(tens))\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\ns = input()[:-1]\r\nprint(d[int(s[0])]*d[int(s[1])])", "a, b = input()\r\np = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nprint(p[int(a)] * p[int(b)])", "inp= (input())\nif inp[0]== \"0\": a= 2 \nif inp[0]== \"1\": a= 7\nif inp[0]== \"2\": a= 2\nif inp[0]== \"3\": a= 3\nif inp[0]== \"4\": a= 3\nif inp[0]== \"5\": a= 4\nif inp[0]== \"6\" :a= 2\nif inp[0]== \"7\": a= 5\nif inp[0]== \"8\" :a= 1\nif inp[0]== \"9\": a= 2\nif inp[1]== \"0\": b= 2\nif inp[1]== \"1\": b= 7\nif inp[1]== \"2\": b= 2\nif inp[1]== \"3\": b= 3\nif inp[1]== \"4\": b= 3\nif inp[1]== \"5\": b= 4\nif inp[1]== \"6\": b= 2\nif inp[1]== \"7\": b= 5\nif inp[1]== \"8\": b= 1\nif inp[1]== \"9\": b= 2\n\nprint(a*b)", "new_s = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nans = 1\r\nn = list(input())\r\nfor x in n:\r\n ans *= new_s[int(x)]\r\nprint(ans)\r\n", "ways = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\na = input()\r\nprint(ways[(ord(a[0]) - ord('0'))] * ways[(ord(a[1]) - ord('0'))])\r\n", "numbers = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nn = int(input())\r\nprint(numbers[n//10] * numbers[n%10])", "n = input()\r\nd = {'0': 2,'1': 7,'2': 2,'3': 3,'4': 3,'5': 4,'6': 2,'7': 5,'8': 1,'9': 2}\r\nprint(d[n[0]]*d[n[1]])", "\r\nn = input()\r\n\r\ns = {}\r\ns[0] = 2\r\ns[1] = 7\r\ns[2] = 2\r\ns[3] = 3\r\ns[4] = 3\r\ns[5] = 4\r\ns[6] = 2\r\ns[7] = 5\r\ns[8] = 1\r\ns[9] = 2\r\n\r\nprint(s[int(n[0])] * s[int(n[1])])", "s = str(input())\r\nx1 = int(s[0])\r\nx2 = int(s[1])\r\ny = [[0] * 7 for i in range(10)]\r\ny[0] = [1, 1, 1, 0, 1, 1, 1]\r\ny[1] = [0, 0, 0, 0, 0, 1, 1]\r\ny[2] = [0, 1, 1, 1, 1, 1, 0]\r\ny[3] = [0, 0, 1, 1, 1, 1, 1]\r\ny[4] = [1, 0, 0, 1, 0, 1, 1]\r\ny[5] = [1, 0, 1, 1, 1, 0, 1]\r\ny[6] = [1, 1, 1, 1, 1, 0, 1]\r\ny[7] = [0, 0, 1, 0, 0, 1, 1]\r\ny[8] = [1, 1, 1, 1, 1, 1, 1]\r\ny[9] = [1, 0, 1, 1, 1, 1, 1]\r\nq1 = 0\r\nq2 = 0\r\nsum = 0\r\nflag = True\r\nfor i in range(100):\r\n q1 = i // 10\r\n q2 = i % 10\r\n for j in range(7):\r\n if int(y[x1][j]) - int(y[q1][j]) > 0:\r\n flag = False\r\n if int(y[x2][j]) - int(y[q2][j]) > 0:\r\n flag = False\r\n if flag:\r\n sum += 1\r\n flag = True\r\nprint(sum)", "# your code goes here\r\nlist = [ 2, 7, 2, 3, 3, 4, 2, 5, 1, 2 ]\r\nn = int(input())\r\nprint(list[n // 10] * list[n % 10])", "n=input()\r\nd={\"0\":2,\"1\":7,\"2\":2,\"3\":3,\"4\":3,\"5\":4,\"6\":2,\"7\":5,\"8\":1,\"9\":2}\r\nc=1\r\nfor i in n:\r\n c*=d[i]\r\nprint(c)", "arr = [2,7,2,3,3,4,2,5,1,2]\r\na = int(input())\r\nb = a//10\r\nc = a%10\r\nprint(arr[b]*arr[c])", "s = input()\r\nq = [0] * 10\r\nq[0] = 2\r\nq[1] = 7\r\nq[2] = 2\r\nq[3] = 3\r\nq[4] = 3\r\nq[5] = 4\r\nq[6] = 2\r\nq[7] = 5\r\nq[8] = 1\r\nq[9] = 2\r\n\r\nprint(q[int(s[0])] * q[int(s[1])])", "n = input().strip()\r\nl = [2,7,2,3,3,4,2,5,1,2]\r\nk = 1\r\nfor i in range(2):\r\n k = k * l[int(n[i])]\r\nprint(k)", "\r\nd={0:[1,2,3,4,5,6],1:[2,3],2:[1,2,7,5,4],3:[1,2,7,3,4],4:[6,7,2,3],5:[1,6,7,3,4],6:[1,6,5,4,3,7],7:[1,2,3,4],8:[1,2,3,4,5,6,7,8],9:[1,2,3,4,6,7]}\r\n\r\nn=int(input())\r\na=n%10\r\nb=n//10\r\n#print(a,b)\r\ns=set(d[a])\r\ns1=set(d[b])\r\ncount=0\r\ncount1=0\r\n#print(s,s1)\r\nfor i in range(0,10):\r\n\tx=set(d[i])\r\n\ty=s.difference(x)\r\n\tif(len(y)==0):\r\n\t\tcount=count+1\r\n\r\nfor i in range(0,10):\r\n\tx=set(d[i])\r\n\ty=s1.difference(x)\r\n\tif(len(y)==0):\r\n\t\tcount1=count1+1\r\n\r\nprint(count*count1)\r\n", "a=input()\r\nb=[2,7,2,3,3,4,2,5,1,2]\r\nprint(b[int(a[0])]*b[int(a[1])])\r\n", "a = [2,7,2,3,3,4,2,5,1,2]\r\nn = int(input())\r\nx = n // 10\r\ny = n % 10\r\nx = a[x]\r\ny = a[y]\r\nprint((x * y))\r\n", "t, n = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2], int(input())\r\nprint(t[n // 10] * t[n % 10])\r\n", "n = input()\r\n\r\ncodec = ['1110111',\r\n '0010010',\r\n '1011101',\r\n '1011011',\r\n '0111010',\r\n '1101011',\r\n '1101111',\r\n '1010010',\r\n '1111111',\r\n '1111011']\r\n\r\na = codec[int(n[0])]\r\nb = codec[int(n[1])]\r\n\r\ndef good_integers(elm):\r\n poss = 0\r\n for c in codec:\r\n for i, j in zip(elm, c):\r\n if i == '1' and j == '0':\r\n break\r\n else:\r\n poss += 1\r\n return poss\r\n\r\nans = good_integers(a) * good_integers(b)\r\nprint(ans)\r\n\r\n", "d = [2,7,2,3,3,4,2,5,1,2]\nn = input()\ns = 1\nfor i in n:\n s *= d[int(i)]\nprint(s)\n\t \t\t \t\t\t\t\t \t \t\t \t \t \t\t\t \t\t", "l = (2, 7, 2, 3, 3, 4, 2, 5, 1, 2)\r\nq = int(input())\r\nprint(l[q//10]*l[q%10])", "dic = {0:2,1:7,2:2,3:3,4:3,5:4,6:2,7:5,8:1,9:2}\r\nnum = input()\r\nnums = num.split()\r\nfirst = int(nums[0][0])\r\nsec = int(nums[0][1])\r\nprint(dic[first]*dic[sec])\r\n", "d = {0:2,1:7,2:2,3:3,4:3,5:4,6:2,7:5,8:1,9:2}\r\ns = input()\r\nprint(d[int(s[0])]*d[int(s[1])])", "num = input()\r\nmay = {0: 2, 1: 7, 2: 2, 3: 3, 4: 3, 5: 4, 6: 2, 7: 5, 8: 1, 9: 2}\r\nprint(may[int(num[0])] * may[int(num[1])])\r\n", "t = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\n# n = int(input())\r\ns = input()\r\n# print(t[n // 10] * t[n % 10])\r\nprint(t[int(s[0])] * t[int(s[1])])", "a = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nn = input()\r\nprint(a[int(n[0])] * a[int(n[1])])\r\n", "if __name__ == '__main__':\r\n refer_list = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\n line = str(input())\r\n print(refer_list[int(line[0])] * refer_list[int(line[1])])\r\n", "a = input()\r\ns = 1\r\nfor i in range(2):\r\n if a[i]=='9':\r\n s*=2\r\n elif a[i]=='0':\r\n s*=2\r\n elif a[i]=='1':\r\n s*=7\r\n elif a[i]=='2':\r\n s*=2\r\n elif a[i]=='3':\r\n s*=3\r\n elif a[i]=='4':\r\n s*=3\r\n elif a[i]=='5':\r\n s*=4\r\n elif a[i]=='6':\r\n s*=2\r\n elif a[i]=='7':\r\n s*=5\r\nprint(s)", "#!/usr/bin/python\r\ndata = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nstr_input = input()\r\nprint(data[int(str_input[0])]*data[int(str_input[1])])", "s=input()\r\nlisted=[]\r\nfor s in s:\r\n listed.append(s)\r\ncounter=1\r\nfor integer in listed:\r\n if integer=='0':\r\n counter=counter*2\r\n elif integer=='1':\r\n counter=counter*7\r\n elif integer=='2':\r\n counter=counter*2\r\n elif integer=='3':\r\n counter=counter*3\r\n elif integer=='4':\r\n counter=counter*3\r\n elif integer=='5':\r\n counter=counter*4\r\n elif integer=='6':\r\n counter=counter*2\r\n elif integer=='7':\r\n counter=counter*5\r\n elif integer=='8':\r\n counter=counter*1\r\n elif integer=='9':\r\n counter=counter*2\r\nprint(counter)", "n=input()\r\nx,y= int(n[0]),int(n[1])\r\nz= {0:2, 1:7, 2:2, 3:3, 4:3, 5:4, 6:2, 7:5, 8:1, 9:2}\r\nprint(z[x]*z[y])", "sticks = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\nx = input()\na = 1\nfor i in x:\n a *= sticks[ord(i) - ord('0')]\nprint(a)", "x=[0,1,2,3,4,5,6,7,8,9]\r\nz=[2,7,2,3,3,4,2,5,1,2]\r\nc=list(map(int,input()))\r\nprint(z[x.index(c[0])]*z[x.index(c[1])])\r\n", "digits = [\n[1,1,1,0,1,1,1],\n[0,0,0,0,0,1,1],\n[0,1,1,1,1,1,0],\n[0,0,1,1,1,1,1],\n[1,0,0,1,0,1,1],\n[1,0,1,1,1,0,1],\n[1,1,1,1,1,0,1],\n[0,0,1,0,0,1,1],\n[1,1,1,1,1,1,1],\n[1,0,1,1,1,1,1]\n]\n\ndef broke(n):\n poss = 0\n for i in digits:\n for j in range(len(i)):\n if i[j] == 0 and digits[n][j] == 1:\n break\n else:\n poss += 1\n return poss\n\nn = int(input())\nprint(broke(n//10) * broke(n%10))\n", "disp = [\r\n 0b1110111, # 0\r\n 0b0010010, # 1\r\n 0b1011101, # 2\r\n 0b1011011, # 3\r\n 0b0111010, # 4\r\n 0b1101011, # 5\r\n 0b1101111, # 6\r\n 0b1010010, # 7\r\n 0b1111111, # 8\r\n 0b1111011 # 9\r\n]\r\n\r\nxs = [len([e for e in disp if (e & d) == d]) for d in disp]\r\n\r\nnum = int(input())\r\n\r\nprint(xs[num%10]*xs[num//10])", "v=[2,7,2,3,3,4,2,5,1,2]\r\nr=1\r\nfor x in input():r*=v[int(x)]\r\nprint(r)", "s = input()\r\nlst = [7, 2, 3, 3, 4,2,5,1,2]\r\na, b, i=0,0, 0\r\nt = []\r\nwhile i<2:\r\n t.append(lst[int(s[i])-1])\r\n i+=1\r\nprint(t[0]*t[1])", "cont=[2,7,2,3,3,4,2,5,1,2]\r\ns=input()\r\nprint(cont[int(s[0])]*cont[int(s[1])])\r\n", "n = [int(i) for i in list(input())]\r\nT = {\r\n 9: [8,9],\r\n 8: [8],\r\n 7: [0,3,7,8,9],\r\n 6: [6,8],\r\n 5: [5,6,8,9],\r\n 4: [4,8,9],\r\n 3: [3,8,9],\r\n 2: [2,8],\r\n 1: [0,1,3,4,7,8,9],\r\n 0: [0,8],\r\n }\r\nprint(len(T[n[0]])*len(T[n[1]]))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 13 17:17:28 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n# https://codeforces.com/problemset/problem/495/A --- Alexis Galvan\r\n\r\nhash_table = {0:2,1:7,2:2,3:3,4:3,5:4,6:2,7:5,8:1,9:2}\r\n\r\ndef digital_counter(number):\r\n \r\n string = str(number)\r\n first_number = int(string[0])\r\n second_number = int(string[1])\r\n \r\n return hash_table[first_number] * hash_table[second_number]\r\n\r\n\r\nprint(digital_counter((input())))\r\n \r\n ", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp(): # int\n return(int(input()))\ndef inlt(): # list\n return(list(map(int,input().split())))\ndef insr(): # string as char list\n s = input()\n return(list(s[:len(s) - 1]))\ndef instr(): # string\n return input()\ndef invr(): # spaced ints\n return(map(int,input().split()))\n\n\n# dig_map = {0:[0, 8], 1:[0, 1,3, 4, 7, 8, 9], 2:[2, 8], 3:[3, 8, 9],\n# 4:[4, 8, 9], 5:[5, 6, 8, 9], 6:[6,8], 7:[0, 3, 7, 8, 9], 8:[8], 9:[8, 9]}\n# dig_map = [[0, 8], [0, 1, 3, 4, 7, 8, 9],[2, 8], [3, 8, 9],[4, 8, 9],[5, 6, 8, 9], [6,8], [0, 3, 7, 8, 9], [8], [8, 9] ]\ndig_map = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\nn = inp()\nprint(dig_map[n%10] * dig_map[n//10])\n# if n < 10:\n# digs = [0, n]\n# else:\n# digs = [n//10, n % 10]\n\n", "s = input()\r\ndic = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\ni1 = int(ord(s[0]) - ord('0'))\r\ni2 = int(ord(s[1]) - ord('0'))\r\nprint(dic[i1] * dic[i2])\r\n", "d={}\r\nd[0]=2\r\nd[1]=7\r\nd[2]=2\r\nd[3]=3\r\nd[4]=3\r\nd[5]=4\r\nd[6]=2\r\nd[7]=5\r\nd[8]=1\r\nd[9]=2\r\nn=str(input())\r\nc=1\r\nfor i in n:\r\n c=c*d[int(i)]\r\nprint(c)", "import sys\r\n\r\nk = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nst = sys.stdin.readline()\r\n\r\nprint(k[int(st[0])] * k[int(st[1])])\r\n\r\n", "a = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\ns = input()\r\nprint(a[int(s[0])]*a[int(s[1])])", "l = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\ns = input()\nprint(l[int(s[0])]*l[int(s[1])])\n \t\t\t\t\t\t\t \t\t \t\t\t \t \t\t\t \t\t\t\t\t\t", "#%%\r\nnums = list(input())\r\nnumMap = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\n\r\nprint(numMap[int(nums[0])] * numMap[int(nums[1])])", "digit = {'1':[8],'2':[0,2,6,9],'3':[3,4],'4': [5], '5': [7], '7': [1]}\r\n\r\nn = input()\r\nout, c = 1, 2\r\nfor i, j in digit.items():\r\n if (int(n[0]) in j):\r\n out *= int(i)\r\n c -= 1\r\n if (int(n[1]) in j):\r\n out *=int(i)\r\n c -= 1\r\n if (c == 0):\r\n exit(print(out))\r\n", "n , m = map(int , input())\r\ndic = dict()\r\nlst = [2,7,2,3,3,4,2,5,1,2]\r\nfor i in range(0,10):\r\n dic [i] = lst[i]\r\nprint(dic[n] * dic[m])", "x=int(input())\r\na=[2,7,2,3,3,4,2,5,1,2]\r\nprint(a[x%10]*a[x//10])\r\n", "#%%\r\nnums = int(input())\r\nnumMap = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\na = int(nums % 10)\r\nb = int((nums - a) / 10)\r\nprint(numMap[a] * numMap[b])", "s = input()\r\nt = 1\r\n\r\nd_v = {}\r\nd_v[\"0\"] = 2\r\nd_v[\"1\"] = 7\r\nd_v[\"2\"] = 2\r\nd_v[\"3\"] = 3\r\nd_v[\"4\"] = 3\r\nd_v[\"5\"] = 4\r\nd_v[\"6\"] = 2\r\nd_v[\"7\"] = 5\r\nd_v[\"8\"] = 1\r\nd_v[\"9\"] = 2\r\n\r\nfor c in s:\r\n t *= d_v[c]\r\n \r\nprint(t)", "n=input()\r\nl1=1\r\nfor i in n:\r\n if i=='0':\r\n l1=l1*2\r\n elif i=='1':\r\n l1=l1*7\r\n elif i=='2':\r\n l1=l1*2\r\n elif i=='3':\r\n l1=l1*3\r\n elif i=='4':\r\n l1=l1*3\r\n elif i=='5':\r\n l1=l1*4\r\n elif i=='6':\r\n l1=l1*2\r\n elif i=='7':\r\n l1=l1*5\r\n elif i=='8':\r\n l1=l1*1\r\n elif i=='9':\r\n l1=l1*2\r\nprint(l1)\r\n \r\n \r\n", "arr = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nresult = 1\r\nasd = input()\r\nfor i in asd:\r\n result *= arr[int(i)]\r\n\r\nprint(result);\r\n", "a = {0: 0b_0011_1111,\r\n 1: 0b_0000_0110,\r\n 2: 0b_0101_1011,\r\n 3: 0b_0100_1111,\r\n 4: 0b_0110_0110,\r\n 5: 0b_0110_1101,\r\n 6: 0b_0111_1101,\r\n 7: 0b_0000_0111,\r\n 8: 0b_0111_1111,\r\n 9: 0b_0110_1111,\r\n }\r\nn = input()\r\nn1 = int(n[0])\r\nn2 = int(n[1])\r\nc1 = 0\r\nc2 = 0\r\nfor i in a:\r\n if a[n1] & a[i] == a[n1]:\r\n c1 += 1\r\n if a[n2] & a[i] == a[n2]:\r\n c2 += 1\r\nprint(c1 * c2)\r\n", "n = input()\r\ncode = {'0': 2, '1': 7, '2': 2, '3': 3, '4': 3,\r\n '5': 4, '6': 2, '7': 5, '8': 1, '9': 2}\r\nprint(code[n[0]] * code[n[1]])", "t, n = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2], int(input()) # Getting all possible case for each number from 0 : 9 after removing sticks including the number itself\r\nprint(t[n//10]*t[n%10])", "x = input()\r\nx,y = list(x)\r\n\r\ncounterx = 0\r\ncountery = 0\r\n\r\n#x\r\nif x == \"0\":\r\n counterx+=2\r\nelif x == \"1\":\r\n counterx+=7\r\nelif x == \"2\":\r\n counterx+=2\r\nelif x == \"3\":\r\n counterx+=3\r\nelif x == \"4\":\r\n counterx+=3\r\nelif x == \"5\":\r\n counterx+=4\r\nelif x == \"6\":\r\n counterx+=2\r\nelif x == \"7\":\r\n counterx+=5\r\nelif x == \"8\":\r\n counterx+=1\r\nelif x == \"9\":\r\n counterx+=2\r\n\r\n#y\r\n\r\nif y == \"0\":\r\n countery+=2\r\nelif y == \"1\":\r\n countery+=7\r\nelif y == \"2\":\r\n countery+=2\r\nelif y == \"3\":\r\n countery+=3\r\nelif y == \"4\":\r\n countery+=3\r\nelif y == \"5\":\r\n countery+=4\r\nelif y == \"6\":\r\n countery+=2\r\nelif y == \"7\":\r\n countery+=5\r\nelif y == \"8\":\r\n countery+=1\r\nelif y == \"9\":\r\n countery+=2\r\n\r\nprint(counterx * countery)", "s=input()\r\nl=[2,7,2,3,3,4,2,5,1,2]\r\nc=1\r\nfor i in s:\r\n i=int(i)\r\n c*=l[int(i)]\r\nprint(c)\r\n ", "n=input()\nx=[2,7,2,3,3,4,2,5,1,2]\na=x[int(n[0])]\nb=x[int(n[1])]\nprint(a*b)\n \t\t \t \t \t\t \t \t\t\t \t\t\t", "n=input()\r\n\r\na=[0]*10\r\n\r\na[0]=2\r\na[1]=7\r\na[2]=2\r\na[3]=3\r\na[4]=3\r\na[5]=4\r\na[6]=2\r\na[7]=5\r\na[8]=1\r\na[9]=2\r\n\r\nprint(a[int(n[0])]*a[int(n[1])])\r\n", "type=[[1,1,1,1,1,1,0],[0,0,1,1,0,0,0],[0,1,1,0,1,1,1],[0,1,1,1,1,0,1],[1,0,1,1,0,0,1],[1,1,0,1,1,0,1],[1,1,0,1,1,1,1],[0,1,1,1,0,0,0],[1,1,1,1,1,1,1],[1,1,1,1,1,0,1]]\r\ndef check(dis,x):\r\n for i in range(0,7):\r\n if(type[dis][i] and not type[x][i]):\r\n return False\r\n return True\r\n(a,b)=input()\r\nsum1=0\r\nfor i in range(0,10):\r\n if(check(int(a),i)):\r\n sum1+=1\r\nsum2=0\r\nfor i in range(0,10):\r\n if(check(int(b),i)):\r\n sum2+=1\r\nprint(sum1*sum2)", "num=input()\r\nsol=[2,7,2,3,3,4,2,5,1,2]\r\n\r\nf_num = sol[int(num[0])]\r\ns_num = sol[int(num[1])]\r\nprint(f_num*s_num)", "x=[2,7,2,3,3,4,2,5,1,2]\r\ns=input()\r\nprint(str(x[int(s[0])]*x[int(s[1])]))", "n = int(input()) \r\nl = [2,7,2,3,3,4,2,5,1,2] \r\nn1 = l[n//10] # ones\r\nn2 = l[n%10] # dozens \r\nprint(n1*n2) \r\n# 0 == > 2\r\n# 1 == > 7\r\n# 2 == > 2\r\n# 3 == > 3\r\n# 4 == > 3\r\n# 5 == > 4\r\n# 6 == > 2\r\n# 7 == > 5\r\n# 8 == > 1\r\n# 9 == > 2 ", "a, b = map(int, input())\r\nd = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\nprint(d[a] * d[b])", "x = input()\nn = 1\nfor c in x:\n if c == '0' or c == '2' or c == '6' or c == '9':\n n *= 2\n elif c == '1':\n n *= 7\n elif c == '3' or c == '4':\n n *= 3\n elif c == '5':\n n *= 4\n elif c == '7':\n n *= 5\n elif c == '8':\n n *= 1\nprint(n)", "s = input()\r\nlst = [2, 7, 2, 3, 3, 4, 2, 5, 1, 2]\r\na, b, i=0,0, 0\r\nt = []\r\nwhile i<2:\r\n t.append(lst[int(s[i])])\r\n i+=1\r\nprint(t[0]*t[1])", "d = dict()\r\nd['0'] = [0, 8]\r\nd['1'] = [0, 1, 3, 4, 7, 8, 9]\r\nd['2'] = [2, 8]\r\nd['3'] = [3, 8, 9]\r\nd['4'] = [4, 8, 9]\r\nd['5'] = [5, 6, 8, 9]\r\nd['6'] = [6, 8]\r\nd['7'] = [0, 3, 7, 8, 9]\r\nd['8'] = [8]\r\nd['9'] = [8, 9]\r\n\r\ns = input()\r\nres = 1\r\n\r\nfor j in [len(d[i]) for i in s]:\r\n res *= j\r\nprint(res)\r\n", "n=int(input())\r\ng=[2,7,2,3,3,4,2,5,1,2]\r\nprint(g[n//10]*g[n%10])", "#RoKy\r\n#FuCk\r\nf=1\r\ns=str(input())\r\nfor i in range(0,len(s),1):\r\n if(s[i]=='0'):\r\n f*=2\r\n elif(s[i]=='1'):\r\n f*=7\r\n elif(s[i]=='2'):\r\n f*=2\r\n elif(s[i]=='3'):\r\n f*=3\r\n elif(s[i]=='4'):\r\n f*=3\r\n elif(s[i]=='5'):\r\n f*=4\r\n elif(s[i]=='6'):\r\n f*=2\r\n elif(s[i]=='7'):\r\n f*=5\r\n elif(s[i]=='8'):\r\n f*=1\r\n elif(s[i]=='9'):\r\n f*=2\r\nprint(f)\r\n", "a = {'0': 2, '1': 7, '2': 2, '3': 3, '4': 3, '5': 4, '6': 2, '7': 5, '8': 1, '9': 2}\r\nb = input()\r\nans = a[b[0]] * a[b[1]]\r\nprint(ans)", "allpossibilities=(2,7,2,3,3,4,2,5,1,2)\r\nvalueofn=input()\r\nsolution=1\r\nfor digit in valueofn:\r\n solution*=allpossibilities[int(digit)]\r\nprint(solution)", "a = input()\r\nnums = [2,7,2,3,3,4,2,5,1,2]\r\nprint(nums[int(a[0])]*nums[int(a[1])])\r\n", "n = input()\r\n# stick_map = {0: [8], 1: [9, 6, 0], 2: [2, 3, 5], 3: [4], 4: [7], 5:[1]}\r\n\r\n# stick_map = {'0': 2, '1': 6, '2': 3, '3': 3, '4': 4, '5': 3, '6': 2, '7': 5, '8': 0, '9': 2}\r\nstick_map = {'8': 1, '0': 2, '9': 2, '6': 2, '2': 2, '3': 3, '5': 4, '4': 3, '7': 5, '1': 7}\r\nfirst = stick_map[n[0]]\r\nsecond = stick_map[n[1]]\r\n\r\nprint(first*second)" ]

[ "k = int(input())\ns = input()\nused = [False for _ in range(26)]\nstarts = []\nfor i, c in enumerate(s):\n x = ord(c) - ord('a')\n if not used[x]:\n used[x] = True\n starts.append(i)\n\nif len(starts) < k:\n print('NO')\nelse:\n print('YES')\n while len(starts) > k:\n starts.pop()\n for i in range(k - 1):\n print(s[starts[i]:starts[i + 1]])\n print(s[starts[-1]:])\n\n", "n = int(input())\r\na = input()\r\nd = {}\r\ncount = 0\r\nfor i in range(len(a)):\r\n if d.get(a[i]) == None:\r\n d[a[i]] = 1\r\n count += 1\r\nif count >= n:\r\n print('YES')\r\n d = {}\r\n count = 0\r\n i = 0\r\n j = 0\r\n while count < n - 1:\r\n if d.get(a[i]) == None:\r\n d[a[i]] = 1\r\n if a[j:i] != '':\r\n count += 1 \r\n print(a[j:i])\r\n j = i\r\n i += 1\r\n print(a[j:]) \r\nelse:\r\n print('NO')", "I=input\r\nP=print\r\nk=int(I())\r\nr=[]\r\ni=0\r\ns=I()\r\nwhile i<len(s) and k>0:\r\n\tj=i+1\r\n\twhile j<len(s)and any(map(lambda x:x[0]==s[j],[s[i]]+r)):j+=1\r\n\tr+=[s[i:j]];k-=1;i=j\r\nif k:P('NO')\r\nelse:\r\n\tP('YES',end='')\r\n\tt=0\r\n\tfor i in r:P('\\n'+i,end='');t+=len(i)\r\n\tP(s[t:])", "n = int(input())\r\ns = input()\r\npoint = 1\r\nans = str()\r\nused = set(s[0])\r\nlast_point = 0\r\nfor i in range(n - 1):\r\n while point <= len(s) and s[point - 1] in used:\r\n point += 1\r\n if point <= len(s):\r\n used.add(s[point - 1])\r\n ans += s[last_point:point - 1] + '\\n'\r\n last_point = point - 1\r\n else:\r\n print('NO')\r\n break\r\nans += s[last_point:]\r\nif point <= len(s):\r\n print('YES')\r\n print(ans)", "\r\n\r\nn = int(input())\r\n\r\n\r\nt = input()\r\n\r\n\r\nf=[]\r\nv=[]\r\n\r\n\r\nif len(set(list(t)))<n:\r\n print('NO')\r\nelse:\r\n\r\n\r\n u=''\r\n p=0\r\n h=0\r\n while p<len(t):\r\n if t[p] not in f:\r\n if len(u)>0:\r\n v.append(u)\r\n u=''\r\n f.append(t[p])\r\n u+=t[p]\r\n else:\r\n u+=t[p]\r\n p+=1\r\n\r\n if len(u)>0:\r\n v.append(u)\r\n\r\n\r\n\r\n if len(v)>=n:\r\n print('YES')\r\n if n==1:\r\n print(''.join(v))\r\n else:\r\n for j in v[:n-1]+[''.join(v[n-1:])]:\r\n print(j)\r\n else:\r\n print('NO')\r\n \r\n\r\n\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nk = int(input())\nstr = input()\n\ndic = {}\nfor i in str:\n if i not in dic:\n dic[i] = 1\n else:\n dic[i] += 1\n\nif ( k > len(dic)):\n print(\"NO\")\nelse:\n print(\"YES\", end='')\n dic2 = []\n n = 0\n\n for i in str:\n if (i not in dic2) and n < k:\n print()\n print(i, end='')\n n += 1\n dic2.append(i)\n else:\n print(i, end='')\n\n print()\n\n", "k = int(input())\r\nq = input()\r\ns = set()\r\na = []\r\nfor i in range(len(q)):\r\n if not q[i] in s:\r\n s.add(q[i])\r\n a += [i]\r\n if len(a) == k:\r\n print(\"YES\")\r\n for j in range(k - 1):\r\n print(q[a[j]:a[j + 1]])\r\n print(q[a[-1]:])\r\n exit()\r\nprint(\"NO\")", "k = int(input())\r\ns = input()\r\nif len(set(s)) < k:\r\n print('NO')\r\nelse:\r\n ans = []\r\n seen = set(s[0])\r\n curr = ''\r\n for c in s:\r\n if c in seen:\r\n curr += c\r\n else:\r\n seen.add(c)\r\n ans.append(curr)\r\n curr = c\r\n ans.append(curr)\r\n print('YES')\r\n print('\\n'.join([ans[i] for i in range(k-1)] + [''.join(ans[k-1:])]))\r\n", " # The first line contains a positive integer k (1 ≤ k ≤ 26) — the number of strings that should be in a beautiful sequence.\n\n # The second line contains string q, consisting of lowercase Latin letters. The length of the string is within range from 1 to 100, inclusive.\n\n\nK = int(input())\n\nQ = input()\n\nchars = set()\n\nfirstOcc = []\n\nfor i in range(len(Q)):\n\tif Q[i] not in chars:\n\t\tchars.add(Q[i])\n\t\tfirstOcc.append(i)\n\nif len(chars) < K:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tindex = 0\n\tfor i in range(K):\n\t\t# last one\n\t\tif i != K - 1:\n\t\t\tprint(Q[firstOcc[i]:firstOcc[i + 1]])\n\t\telse:\n\t\t\tprint(Q[firstOcc[i]:])\n\n\t\t\t\t \t \t\t \t\t \t \t\t\t \t\t \t\t \t", "k = int(input())\r\ns = input()\r\nans = []\r\ncur = \"\"\r\nse = set()\r\n\r\nfor i in range(len(s)):\r\n if s[i] not in se:\r\n if len(cur) > 0:\r\n ans.append(cur)\r\n cur = \"\"\r\n cur = s[i]\r\n se.add(s[i])\r\n else:\r\n cur += s[i]\r\nif cur:\r\n ans.append(cur)\r\n \r\nl = len(ans)\r\n\r\nif len(ans) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k, len(ans)):\r\n ans[k-1] += ans[i]\r\n\r\n print(\"\\n\".join(ans[:k]))\r\n", "n = int(input())\r\nd = {}\r\nst = input()\r\nans =\"\"\r\nanswer = [ ]\r\nt=0\r\nfor j,i in enumerate (st) :\r\n if i in d :\r\n continue\r\n else :\r\n d[i]=1\r\n if n==1 :\r\n t=1\r\n answer.append(j)\r\n break\r\n answer.append(j)\r\n n=n-1\r\nif t!=1 :\r\n exit(print(\"NO\"))\r\nprint(\"YES\")\r\nle = len(answer)-1\r\nfor i,j in enumerate (answer) :\r\n if i== le :\r\n print(st[answer[i]: len(st)])\r\n break\r\n print(st[answer[i]:answer[i+1]] )\r\n \r\n \r\n ", "k = int(input())\r\nq = input()\r\n\r\nif k == 1:\r\n print(\"YES\")\r\n print(q)\r\nelse:\r\n s = set(q[0])\r\n l = []\r\n p = 0\r\n for i in range(len(q)):\r\n if q[i] not in s:\r\n s.add(q[i])\r\n l.append((p, i - 1))\r\n p = i\r\n l.append((p, len(q) - 1))\r\n\r\n if k > len(l):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n i = 0\r\n while i < k - 1:\r\n print(q[l[i][0]:l[i][1] + 1])\r\n i += 1\r\n print(q[l[i][0]:])", "a=int(input())\r\nb=input()\r\nd=a\r\nc=[]\r\nr=''\r\nfor i in range(len(b)):\r\n if r.find(b[i])==-1 and a>0:\r\n c.append(b[i])\r\n a=a-1\r\n r+=b[i]\r\n else:\r\n c[len(c)-1]+=b[i]\r\nif len(c)<d:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in c:\r\n print(i)\r\n \r\n", "k=int(input())\r\nq=input()\r\n\r\ns = set(q)\r\nt=[]\r\nfor e in s:\r\n t.append(q.index(e))\r\nif len(s) < k: print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n if k == 1 :\r\n print(q)\r\n else:\r\n tmp=\"\"\r\n for i in range(k-1):\r\n print(q[t[i]:t[i+1]])\r\n print(q[t[k-1]:])", "\"\"\"\r\nCases:\r\n\r\n\"\"\"\r\n\r\nk=int(input())\r\ns=list(input())\r\nm = {}\r\nn=len(s)\r\nl = []\r\nfor i in range(n):\r\n m[s[i]] = i\r\n\r\nif(len(m)>=k):\r\n print('YES')\r\n j = 0\r\n for i in m:\r\n ind = s.index(i)\r\n l.append(ind)\r\n while(j<k-1):\r\n print(''.join(s[l[j]:l[j+1]]))\r\n j+=1\r\n print(''.join(s[l[j]:n]))\r\nelse:\r\n\tprint('NO')\r\n", "n = int(input())\ns = input()\nflag = 0\nbegin = []\nresult = []\nbegin.append(s[0])\nj = 0\nnum = 1\ni = 1\nl = len(s)\nif n > len(s):\n flag = 1\nelif n == 1:\n result.append(s)\nelse:\n #print(s,len(s))\n while i < l:\n if (begin.__contains__(s[i])) == False:\n num += 1\n begin.append(s[i])\n result.append(s[:i])\n s = s[i:]\n i = 0\n l = len(s)\n if num == n:\n result.append(s)\n break\n continue\n l = len(s)\n i += 1\n if num < n:\n flag = 1\nif flag == 1:\n print('NO')\nelse:\n print('YES')\n for i in result:\n print(i)\n", "s=[]\nindexes=[]\nk=int(input(\"\"))\nq=input(\"\")\nfor i in range(0,len(q)):\n if q[i] not in s:\n s.append(q[i])\n indexes.append(i)\nif len(s)< k:\n print(\"NO\")\nelse:\n print(\"YES\")\n for x in range(len(indexes)):\n if x >=k-1:\n a=q[indexes[x]:len(q)]\n print(a)\n break \n else:\n a=q[indexes[x]:indexes[x+1]]\n print(a)\n \n\n\n\n \n \n\n \n \n \n\n", "\r\nk = int(input())\r\nk2 = k\r\ns = input()\r\nif len(s) < k:\r\n print(\"NO\")\r\nelse:\r\n res = []\r\n curr = dups = \"\"\r\n for idx, el in enumerate(s):\r\n if el not in dups:\r\n dups += el\r\n if len(curr) > 0:\r\n k -= 1\r\n res.append(curr)\r\n if k == 1:\r\n res.append(s[idx:])\r\n break\r\n curr = el\r\n else:\r\n curr += el\r\n\r\n if len(res) != k2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n [print(el) for el in res]\r\n", "a=int(input())\nb=input()\nc=sorted(list(set(b)))\nif len(c)<a:\n print('NO')\nelse:\n print('YES')\n c.remove(b[0])\n d = c[:a-1]\n e = []\n for i in d:\n e.append(b.index(i))\n e.append(0)\n e.append(len(b))\n e.sort()\n for i in range(len(e)-1):\n print(b[e[i]:e[i+1]])", "used = [False] * 26\r\n\r\nk = int(input())\r\ns = input()\r\nn = len(s)\r\n\r\ncnt = 0\r\nborder = [False] * n\r\n\r\nfor i in range(n):\r\n if (cnt < k and not used[ord(s[i]) - ord('a')]):\r\n border[i] = True\r\n used[ord(s[i]) - ord('a')] = True\r\n cnt += 1\r\n\r\nif (cnt == k):\r\n print(\"YES\")\r\n for i in range(n):\r\n if (i > 0 and border[i]):\r\n print()\r\n print(s[i], end = '')\r\nelse:\r\n print(\"NO\")", "k = int(input())\nq = input()\nif len(set(q)) < k:\n print(\"NO\")\nelse:\n d = []\n m = set()\n s = ''\n i = 0\n j = 0\n while len(d) != k:\n while q[j] in m:\n j += 1\n m.add(q[j])\n d.append(q[i:j])\n i = j\n d.append(q[j:])\n print(\"YES\")\n print(\"\\n\".join(d))\n", "k,f,ls = int(input()),input().strip(),set()\r\nif k > len(f):\r\n print('NO')\r\nelse:\r\n s = []\r\n f1 = ''\r\n for i in f + ' ':\r\n if not i in ls:\r\n if f1:\r\n s.append(f1)\r\n ls.add(i)\r\n f1 = i\r\n else:\r\n f1 += i\r\n if len(s) < k:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(k - 1):\r\n print(s[i])\r\n f = ''\r\n for i in s[k - 1:]:\r\n f += i\r\n print(f)", "k = int(input())\r\nq = input()\r\nans_strings = []\r\nstarts = []\r\nfor i in range(len(q)):\r\n if q[i] not in starts:\r\n if k > 1:\r\n starts.append(q[i])\r\n ans_strings.append(q[i])\r\n k -= 1\r\n elif k == 1:\r\n ans_strings.append(q[i::])\r\n k -= 1\r\n break\r\n else:\r\n ans_strings[len(ans_strings) - 1] += q[i]\r\nif k == 0:\r\n print(\"YES\")\r\n for i in ans_strings:\r\n print(i)\r\nelse:\r\n print(\"NO\")", "class CodeforcesTask544ASolution:\n def __init__(self):\n self.result = ''\n self.k = 0\n self.q = ''\n\n def read_input(self):\n self.k = int(input())\n self.q = input()\n\n def process_task(self):\n if len(set(list([ord(c) for c in self.q]))) < self.k:\n self.result = \"NO\"\n else:\n strings = []\n starts = set()\n for x in range(len(self.q)):\n if self.q[x] not in starts and len(starts) < self.k:\n starts.add(self.q[x])\n strings.append(self.q[x])\n else:\n strings[-1] += self.q[x]\n self.result = \"YES\\n{0}\".format(\"\\n\".join(strings))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask544ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\ns=input()\r\nss=[]\r\nls=set()\r\nk=0\r\ncur=''\r\nfor c in s:\r\n if k==n:\r\n cur+=c\r\n else:\r\n if c not in ls:\r\n ls.add(c)\r\n k+=1\r\n ss.append(cur)\r\n cur=c\r\n else:\r\n cur+=c\r\nss.append (cur)\r\nss=ss [1:]\r\nif k!=n:\r\n print ('NO')\r\nelse:\r\n print ('YES')\r\n for st in ss:\r\n print (st)\r\n", "n=int(input())\r\ns=input()\r\nc=1\r\nt=0\r\nd=\"\"\r\np=set(s)\r\nif(len(s)<n):\r\n print(\"NO\")\r\nelif(len(p)<n):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(1,len(s)):\r\n a=ord(s[i-1])\r\n b=ord(s[i])\r\n z=ord(s[t])\r\n if(a!=b and d.count(s[i])==0 and c<n and b!=z):\r\n c+=1\r\n print(s[t:i])\r\n d+=s[t]\r\n t=i\r\n elif(c==n):\r\n break\r\n if(c==n):\r\n print(s[t:len(s)])\r\n", "k=int(input())\r\ns=input()\r\narr=[s[0]]\r\nar=[0]\r\nfor i in range(len(s)):\r\n if s[i] not in arr:\r\n arr.append(s[i])\r\n ar.append(i)\r\nif(len(ar)<k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k-1):\r\n print(s[ar[i]:ar[i+1]])\r\n print(s[ar[k-1]:])\r\n\r\n \r\n \r\n", "import sys\r\n\r\n\r\nn = int(input())\r\ns = str(input())\r\nl = []\r\n\r\nfor i in s:\r\n if not i in l:\r\n l.append(i)\r\n\r\nvals = []\r\n\r\nif len(l) < n:\r\n print(\"NO\")\r\n sys.exit(0)\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n vals.append(s.index(l[i]))\r\n\r\nfor i in range(n):\r\n if i == n-1:\r\n print(s[vals[len(vals)-1]:len(s)])\r\n else:\r\n print(s[vals[i]:vals[i+1]])\r\n ", "# -----------------------------------------------------------\r\n# URL : https://codeforces.com/contest/544/problem/A\r\n# Title : Set of Strings\r\n# Notes : tag-codeforces, tag-problem-A, tag-div-2\r\n# -----------------------------------------------------------\r\n\r\n\r\ndef solve():\r\n k = int(input())\r\n q = input()\r\n n = len(q)\r\n\r\n if n < k:\r\n print(\"NO\")\r\n return\r\n\r\n if k == 1:\r\n print(\"YES\")\r\n print(q)\r\n return\r\n\r\n used_char = [q[0]]\r\n results = []\r\n start = 0\r\n left = k\r\n\r\n for i in range(1, n):\r\n if q[i] not in used_char:\r\n results.append(q[start:i])\r\n start = i\r\n used_char.append(q[i])\r\n left -= 1\r\n\r\n if left == 1:\r\n results.append(q[i:])\r\n break\r\n\r\n if len(results) == k:\r\n print(\"YES\")\r\n\r\n for r in results:\r\n print(r)\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "import sys\r\nk = int(input())\r\ns = input()\r\nans =[]\r\nlp = 0\r\nd=[s[0]]\r\nfor i in range(0, len(s)):\r\n if i > 0 and s[i] not in d:\r\n ans.append(s[lp:i])\r\n lp = i\r\n k-=1;\r\n d.append(s[i])\r\n if k == 1:\r\n print(\"YES\")\r\n for st in ans:\r\n print(st)\r\n print(s[lp:])\r\n sys.exit()\r\nprint(\"NO\")\r\n", "n = int(input())\r\nq = input()\r\n\r\nused = set()\r\nres = []\r\n\r\nfor l in q:\r\n if len(res) < n:\r\n if l not in used:\r\n res.append(l)\r\n used.add(l)\r\n else:\r\n res[len(res)-1] += l\r\n else:\r\n res[len(res)-1] += l\r\n\r\nif len(res) == n:\r\n print(\"YES\")\r\n for w in res:\r\n print(w)\r\nelse:\r\n print(\"NO\")", "import time\r\nimport string\r\nclass Profiler(object):\r\n def __enter__(self):\r\n self._startTime = time.time()\r\n\r\n def __exit__(self, type, value, traceback):\r\n print(\"Elapsed time: {:.3f} sec\".format(time.time() - self._startTime))\r\n\r\n\r\nk = int(input())\r\ns = input()\r\n#b = list(map(int, input().split()))\r\n\r\nm = {}\r\nfor el in string.ascii_lowercase:\r\n m[el] = 0\r\nif len(set(s)) < k:\r\n print('NO')\r\nelse:\r\n i = 0\r\n t = []\r\n while i < len(s):\r\n if k == 1:\r\n t.append(s[i:])\r\n break\r\n if m[s[i]] == 0:\r\n m[s[i]] = 1\r\n tmp = s[i]\r\n i += 1\r\n while i < len(s) and m[s[i]]:\r\n tmp += s[i]\r\n i += 1\r\n t.append(tmp)\r\n k -= 1\r\n else:\r\n i += 1\r\n print('YES')\r\n for el in t:\r\n print(el)\r\n\r\n'''\r\nfin = open(\"input.txt\")\r\nfout = open(\"output.txt\", \"w\")\r\n\r\nn = int(fin.readline())\r\ncases = list()\r\n\r\nfor i in range(n):\r\n fin.readline()\r\n cases.append(list(fin.readline().split()))\r\n\r\nfor i in range(1, len(cases)+1):\r\n cur_min = 1001\r\n added_min = 0\r\n lst = list(map(int, cases[i-1]))\r\n while max(lst) > 1:\r\n mmax = max(lst)\r\n if cur_min > mmax + added_min:\r\n cur_min = mmax + added_min\r\n count_max = lst.count(mmax)\r\n tmp_lst = list()\r\n for sym in lst:\r\n if sym is not mmax:\r\n tmp_lst.append(sym)\r\n else:\r\n if sym % 2 is 0:\r\n tmp_lst.append(sym//2)\r\n tmp_lst.append(sym//2)\r\n else:\r\n tmp_lst.append(sym//2)\r\n tmp_lst.append(sym//2 + 1)\r\n added_min += count_max\r\n lst = tmp_lst.copy()\r\n\r\n\r\n\r\n fout.write(\"Case #\" + i.__str__() + \": \" + cur_min.__str__() + \"\\n\")\r\nfin.close()\r\nfout.close()\r\n'''", "# https://codeforces.com/problemset/problem/544/A\n\nimport fileinput\nimport sys\nfrom typing import List\n\nk: int\nstring: str\nfor i, line in enumerate(fileinput.input()):\n if i == 0:\n k = int(line[:-1])\n if i == 1:\n string = line[:-1]\n break\n\nchars = set(char for char in string)\n\nif len(chars) < k:\n print('NO')\n sys.exit(0)\n\nprint('YES')\nlast_char: str = string[0]\nsub_start, sub_end, parts = 0, 0, 0\nfor i, char in enumerate(string):\n if char in chars:\n chars.remove(char)\n if i > 0:\n print(string[sub_start:sub_end])\n sub_start, sub_end = i, i + 1\n parts += 1\n if parts >= k:\n print(string[sub_start:])\n break\n else:\n sub_end += 1\n", "\r\nk = int(input())\r\nq = input()\r\n\r\ndef program(k, q):\r\n if k > len(set(q)):\r\n print(\"NO\")\r\n return\r\n used = []\r\n ss = []\r\n while len(q) > 0:\r\n ch = q[0]\r\n q = q[1:]\r\n if (ch in used) or k - len(ss) == 0:\r\n ss[-1] += ch\r\n else:\r\n ss.append(ch)\r\n used.append(ch)\r\n print(\"YES\")\r\n for s in ss:\r\n print(s)\r\n \r\nprogram(k, q)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\r\n\"\"\"\r\ncreated by huash06 at 2015-05-18 15:10\r\n\"\"\"\r\n__author__ = 'huash06'\r\n\r\nimport sys\r\nimport os\r\nimport datetime\r\nimport functools\r\nimport itertools\r\nimport collections\r\n\r\n\r\n\r\ndef findBeautifulStr(astr, n):\r\n res = []\r\n firsts = set()\r\n i = 0\r\n while i < len(astr):\r\n firsts.add(astr[i])\r\n if len(res) == n - 1:\r\n res.append(astr[i:])\r\n break\r\n\r\n hasNext = False\r\n for j in range(i+1, len(astr)):\r\n if astr[j] not in firsts:\r\n res.append(astr[i:j])\r\n i = j\r\n hasNext = True\r\n break\r\n if not hasNext:\r\n break\r\n\r\n if len(res) == n:\r\n return res\r\n return []\r\n\r\n\r\n\r\nN = int(input())\r\nS = input()\r\n\r\nres = findBeautifulStr(S, N)\r\nif res:\r\n print('YES')\r\n for seg in res:\r\n print(seg)\r\nelse:\r\n print('NO')\r\n", "k = int(input())\r\nq = input()\r\nused = set([])\r\nstrings = []\r\nfor i in range(len(q)):\r\n if len(strings) < k and q[i] not in used:\r\n strings += [q[i]]\r\n used.add(q[i])\r\n else:\r\n strings[-1] += q[i]\r\n \r\nif len(strings) == k:\r\n print('YES')\r\n for s in strings:\r\n print(s)\r\nelse:\r\n print('NO')\r\n\r\n", "k = int(input())\r\na = input()\r\nsum = 0\r\np = []\r\nfor i in range(len(a)):\r\n if a[i] not in p:\r\n sum += 1\r\n p.append(a[i])\r\nif sum < k:\r\n print('NO')\r\nelse:\r\n p = []\r\n print('YES')\r\n for i in range(len(a)):\r\n if k == 0:\r\n print(a[i], end = '')\r\n else:\r\n if a[i] not in p:\r\n if len(p) != 0:\r\n print()\r\n print(a[i], end = '')\r\n p.append(a[i])\r\n k -= 1\r\n else:\r\n print(a[i], end = '')\r\n \r\n", "k=int(input())\r\ns=list(input())\r\n#print(''.join(s))\r\na=[]\r\nfor i in range(0,30):\r\n a.append(1)\r\nsum=0\r\nfor x in s:\r\n sum=sum+a[ord(x)-ord('a')]\r\n a[ord(x)-ord('a')]=0\r\n\r\nif sum>=k:\r\n print(\"YES\",end='')\r\n for x in s:\r\n if a[ord(x)-ord('a')]==0 and k>0:\r\n k-=1\r\n print()\r\n print(x,end='')\r\n else:\r\n print(x,end='')\r\n a[ord(x)-ord('a')]=1\r\n print()\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n \r\n", "n = int(input())\nq = input()\n\nk = list(set(q))\nk.sort(key = q.index)\n\nif len(k) < n:\n print('NO')\nelif n>1:\n print('YES')\n for i in range(n-1):\n print(q[q.index(k[i]):q.index(k[i+1])])\n print(q[q.index(k[i+1])::])\nelse:\n print('YES')\n print(q)\n", "k = int(input())\r\ns = input()\r\nsp = [-1] * 26\r\nln = 0\r\nfor i in range(len(s)):\r\n if sp[ord(s[i]) - ord('a')] == -1:\r\n ln += 1\r\n sp[ord(s[i]) - ord('a')] = i\r\nif ln < k:\r\n print('NO')\r\n quit()\r\nsp.append(len(s))\r\nsp.sort()\r\nprint('YES')\r\nans = []\r\nkol = 0\r\nfor i in range(len(sp)):\r\n if sp[i] != -1 and kol != k - 1:\r\n ans.append(s[sp[i]:sp[i+1]])\r\n kol += 1\r\n elif sp[i] != -1:\r\n ans.append(s[sp[i]:])\r\n break\r\nfor i in ans:\r\n print(i)\r\n", "k = int(input())\r\ns = input()\r\nliters = set(chr(ord('a') + i) for i in range(26))\r\nresult = []\r\nfor i in s:\r\n if i in liters:\r\n result.append(i)\r\n liters.remove(i)\r\n else:\r\n result[-1] += i\r\n\r\nif len(result) < k:\r\n print(\"NO\")\r\nelse:\r\n while len(result) != k:\r\n t = result.pop()\r\n result[-1] += t\r\n print(\"YES\")\r\n print('\\n'.join(result))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk = int(input())\r\nq = list(input().rstrip().decode())\r\nans = [\"YES\"]\r\ns, u = set(), []\r\nfor i in q:\r\n if not i in s:\r\n if u:\r\n ans.append(\"\".join(u))\r\n u = [i]\r\n s.add(i)\r\n else:\r\n u.append(i)\r\nif u:\r\n ans.append(\"\".join(u))\r\nif len(ans) <= k:\r\n ans = [\"NO\"]\r\nelse:\r\n while (len(ans) - 1) ^ k:\r\n ans[-2] += ans[-1]\r\n ans.pop()\r\nsys.stdout.write(\"\\n\".join(ans))", "k = int(input())\r\ns = str(input())\r\na = []\r\nc = 0\r\nb = []\r\npart = ''\r\nfor el in range(len(s)):\r\n if(s[el] not in b):\r\n a.append(part)\r\n part = ''\r\n part += s[el]\r\n b.append(s[el])\r\n else:\r\n part += s[el]\r\n c += 1\r\na.append(part)\r\na = a[1:]\r\n\r\nif(len(a) < k):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n a[k-1] = ''.join(a[k-1:])\r\n for el in range(k):\r\n print(a[el])", "k = int(input())\r\ns = input()\r\nfls = []\r\nfls_ind = []\r\nfor l in range(len(s)):\r\n if s[l] not in fls:\r\n fls.append(s[l])\r\n fls_ind.append(l)\r\nif len(fls) < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(k):\r\n if i == k-1:\r\n print(s[fls_ind[i]:])\r\n break\r\n print(s[fls_ind[i]:fls_ind[i+1]])", "k = int(input())\nsona = input()\nletters = set(sona)\n\nif(k == 1):\n print(\"YES\")\n print(sona)\n exit()\n\nif(len(letters) < k):\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n\nwordIndexList = []\nchar = sona[0]\nletters.remove(sona[0])\n\nfor i in range(len(sona)):\n if(sona[i] == char):\n continue\n if(sona[i] != char and sona[i] in letters):\n #split at i\n wordIndexList.append(i)\n char = sona[i]\n letters.remove(sona[i])\n\nstart = 0\nfor i in range(k):\n if(i != k-1):\n print(sona[start:wordIndexList[i]])\n start = wordIndexList[i]\n else:\n print(sona[start:])\n", "k=int(input())\r\nch=list(input())\r\ndon=[0 for x in range(26)]\r\nl=len(ch)\r\nans=[]\r\nx=0\r\nwhile x<l:\r\n s=b=ch[x]\r\n don[ord(ch[x])-97]=1\r\n x+=1\r\n while x<l and (ch[x]==b or don[ord(ch[x])-97]==1):\r\n s+=ch[x]\r\n x+=1\r\n ans.append(s)\r\nif len(ans)<k:\r\n print(\"NO\")\r\nelse:\r\n s1=\"\"\r\n v=len(ans)\r\n z=0\r\n print(\"YES\")\r\n for x in range(v-k+1):\r\n s1+=ans[x]\r\n z=x\r\n print(s1)\r\n z+=1\r\n for z in range(z,v):\r\n print(ans[z])", "n = int(input())\r\na= input()\r\nc = set(a)\r\nif len(c) < n:\r\n\tprint('NO')\r\n\texit()\r\ns = []\r\nprint('YES')\r\nfor x in c:\r\n\ts.append(a.index(x))\r\ns.sort()\r\ns = s[:n] + [len(a)]\r\nfor i in range(len(s) - 1):\r\n\tprint(a[s[i] : s[i + 1]])", "\"\"\"\nPues yo creo que con que hayan k letras distintas sirve\n\"\"\"\n\nfrom sys import stdin\n\ndef solve(q, k):\n subs,s,s_set,N = list(),list(),set(q[0]),len(q)\n\n for n in range(N):\n if q[n] not in s_set and k != 1:\n subs.append(f\"{''.join(s)}\")\n k -= 1\n s_set.add(q[n])\n s = list(q[n])\n else:\n s.append(q[n])\n subs.append(f\"{''.join(s)}\")\n k -= 1\n if k == 0:\n print(\"YES\")\n for sub in subs:\n print(sub)\n else:\n print(\"NO\")\n\ndef main():\n k = int(stdin.readline())\n q = stdin.readline().rstrip()\n solve(q, k)\n\nmain()\n", "#coding=utf-8\r\nflag = []\r\nindex = []\r\nfor i in range(26):\r\n flag.append(False)\r\ncount = 0\r\nk = int(input())\r\nstring = input()\r\nfor i in range(len(string)):\r\n char = ord(string[i]) - ord('a')\r\n if count == k:\r\n break\r\n if not flag[char]:\r\n flag[char] = True\r\n count += 1\r\n index.append(i)\r\n\r\nif count >= k:\r\n print(\"YES\")\r\n for i in range(k - 1):\r\n index_s = index[i]\r\n index_e = index[i + 1]\r\n print(string[index_s : index_e])\r\n print(string[index[k - 1] : ])\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = input()\r\ns1 = set()\r\nar = []\r\ni = 0\r\nprs = ''\r\nj = 0\r\nwhile len(ar) < n and i < len(s):\r\n ar.append(s[i])\r\n s1.add(s[i])\r\n i += 1\r\n while i < len(s) and s[i] in s1:\r\n ar[-1] += s[i]\r\n i += 1\r\n \r\n \r\nif i < len(s):\r\n ar[-1] += s[i:]\r\nif len(ar) < n:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in ar:\r\n print(i)", "def TrueCount(a):\n\tc = 0\n\tfor i in a:\n\t\tif(i == True):\n\t\t\tc += 1\n\treturn c\n\ndef uniqueStrings(a,s):\n\tb = []\n\tc = []\n\tx = 0\n\tc.append(s[0])\n\tfor i in range(len(s)):\n\t\tif s[i] not in c:\n\t\t\tb.append(s[x:i])\n\t\t\tc.append(s[i])\n\t\t\tx = i\n\tb.append(s[x:len(s)])\n\treturn b\n\nn = int(input())\ns = input()\n\na = [False]*26\n\nfor i in s:\n\ta[ord(i) - ord('a')] = True\n\nk = TrueCount(a)\n\nif(k < n):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tb = uniqueStrings(a,s)\n\ti = 0\n\twhile(i < n-1):\n\t\tprint(b[i])\n\t\ti += 1\n\tprint(''.join(b[i:len(b)]))", "k = int(input()) \r\nq = input() \r\nvisited = set() \r\nindices = [] \r\nfor i in range(len(q)): \r\n if q[i] not in visited : indices.append(i) ; visited.add(q[i])\r\nstrings = [] \r\nfor i in range(len(indices)-1): \r\n if i+1 == k : strings.append(q[indices[i]:]) ; break\r\n else : strings.append(q[indices[i]:indices[i+1]])\r\nif len(strings) < k : strings.append(q[indices[-1]:])\r\nif len(strings) < k : print(\"NO\")\r\nelse : \r\n print(\"YES\")\r\n print(*strings, sep = '\\n')", "k = int(input())\r\nq = input()\r\n\r\nif len(set(q)) < k:\r\n print('NO')\r\n exit()\r\n\r\na = set()\r\ncnt = l = r = 0\r\nans = []\r\nwhile cnt < k - 1:\r\n if q[r] not in a:\r\n a.add(q[r])\r\n if q[l:r] != '':\r\n cnt += 1\r\n ans.append(q[l:r])\r\n l = r\r\n r += 1\r\nans.append(q[l:])\r\n\r\nprint('YES')\r\n[print(i) for i in ans]", "n = int(input())\r\ns = input()\r\narr = []\r\nfor i in range(len(s)):\r\n if s[i] not in s[:i]:\r\n arr.append(i)\r\nif (len(arr) < n):\r\n print('NO')\r\n exit()\r\nprint('YES')\r\nfor i in range(n - 1):\r\n print(s[arr[i] : arr[i + 1]])\r\nif len(arr) >= n:\r\n print(s[arr[n - 1] : len(s)])\r\n", "from math import *\r\nfrom bisect import *\r\nfrom collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\ns=input()\r\nb=[]\r\nc=[]\r\nd=n\r\nfor i in range(len(s)):\r\n if s[i] not in b:\r\n n-=1\r\n b+=[s[i]]\r\n c+=[i]\r\n if n==0:\r\n break\r\nc+=[len(s)]\r\nif n>0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(0,d):\r\n print(s[c[i]:c[i+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\ns = input()\r\n\r\ncont = [-1] * 1000\r\ndif = []\r\nfor i in range(len(s)):\r\n if cont[ord(s[i])] == -1:\r\n dif.append(i)\r\n cont[ord(s[i])] = i\r\n \r\nif len(dif) < n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n i = 0\r\n for i in range(1, n):\r\n print(s[dif[i-1]:dif[i]])\r\n # print(dif)\r\n print(s[dif[i]:])", "from collections import OrderedDict\ncount = int(input())\nline = input()\n\nuniq = \"\".join(OrderedDict.fromkeys(line).keys())\n\nif count > len(uniq):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tif count == len(uniq):\n\t\twhile len(line) != 0:\n\t\t\tfirst_uniq = 0\n\t\t\tuniq = uniq[1:]\n\t\t\tif len(uniq) == 0:\n\t\t\t\tprint(line)\n\t\t\t\tbreak\n\t\t\tlast_uniq = line.find(uniq[0])\n\t\t\tprint(line[first_uniq:last_uniq])\n\t\t\tline = line[last_uniq:]\n\telse:\n\t\twhile count != 1:\n\t\t\tfirst_uniq = 0\n\t\t\tuniq = uniq[1:]\n\t\t\tlast_uniq = line.find(uniq[0])\n\t\t\tprint(line[first_uniq:last_uniq])\n\t\t\tline = line[last_uniq:]\n\t\t\tcount -= 1\n\t\tprint(line)", "k, q, v, s = int(input()), input(), 'YES', set()\r\nfor ch in q:\r\n if k == 0 or ch in s:\r\n v += ch\r\n else:\r\n v += '\\n' + ch\r\n s.add(ch)\r\n k -= 1\r\nprint('NO' if k else v)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 14 18:10:41 2018\r\n\r\n@author: Karn\r\n\"\"\"\r\n\r\nk=int(input())\r\nq=input()\r\ntmp=k\r\nl=len(q)\r\nL=[]\r\nI=[]\r\nT=[]\r\nif(len(set(q)) < k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n p=q[0]\r\n I.append(0)\r\n T.append(q[0])\r\n for i in range(l):\r\n if(q[i] not in T):\r\n I.append(i)\r\n T.append(q[i])\r\n \r\n X=[] \r\n for i in range(k):\r\n X.append(I[i]) \r\n \r\n for i in range(k):\r\n if(i==k-1):\r\n print(q[X[i]:])\r\n else:\r\n print(q[X[i]:X[i+1]])\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "k = int(input())\nq = input()\nl = len(q)\ns = set()\ns.add(q[0])\npos = [0]\ncount = 1\n\ni = 1\nwhile (i < l) and (count < k):\n if not (q[i] in s):\n pos.append(i)\n s.add(q[i])\n count += 1\n i += 1\n \nif count == k:\n print('YES')\n pos.append(l)\n for i in range(k):\n print(q[pos[i]:pos[i+1]])\nelse:\n print('NO')", "\nk = int(input())\nq = input()\n\ni = 0\nmet = []\nts = []\nwhile i < len(q):\n if q[i] in met:\n i += 1\n else:\n met.append(q[i])\n ts.append(i)\nts.append(len(q))\n\nif len(ts) >= k + 1:\n print('YES')\n for i in range(len(ts) - 1):\n a = ts[i]\n b = ts[i + 1]\n if i == k - 1:\n print(q[a:])\n break\n print(q[a:b])\nelse:\n print('NO')\n\n", "n = int(input())\r\ns = input()\r\n\r\nif len(set(s))<n:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ind = 0\r\n ss = set()\r\n for i in range(n-1):\r\n ss.add(s[ind])\r\n tmp = ''\r\n while s[ind] in ss:\r\n tmp += s[ind]\r\n ind += 1\r\n print(tmp)\r\n print(s[ind:])\r\n", "#!/usr/local/bin/python3\n\nk = int(input())\ns = str(input())\n\nif len(set(s)) < k:\n\tprint(\"NO\")\n\texit()\n\nprint(\"YES\")\n\ncset = set()\nans = \"\"\n\nfor c in s:\n\tif c not in cset and k>1:\n\t\tif ans != \"\": \n\t\t\tprint(ans)\n\t\t\tk-=1\n\t\tcset.add(c)\n\t\tans = \"\"\n\tans += c\nelse:\n\tprint(ans)\n", "n = int(input())\r\nstring = input()\r\narr = list(string)\r\n\r\nif len(set(arr)) < n:\r\n print(\"NO\")\r\nelse:\r\n idx = 0\r\n ans = list()\r\n chars = set()\r\n\r\n while n > 0:\r\n n -= 1\r\n if n == 0:\r\n ans.append(string[idx:])\r\n else:\r\n chars.add(string[idx])\r\n start = idx\r\n idx += 1\r\n while idx < len(string) and string[idx] in chars:\r\n idx += 1\r\n ans.append(string[start:idx])\r\n\r\n print(\"YES\")\r\n print('\\n'.join(ans))", "n = int(input())\ns = input()\nt = []\nk = []\nfor i in range(len(s)):\n if s[i] not in t:\n t.append(s[i])\n k.append(i)\nif len(t)<n:\n print(\"NO\")\nelse:\n print(\"YES\")\n for u in range(n-1):\n print(s[k[0]:k[1]])\n k.pop(0)\n print(s[k[0]:])\n \n", "k=int(input())\ns=input()\nif len(set(s))<k:\n\tprint('NO')\n\texit()\nelse:\n\tprint('YES')\n\nd=set()\n\nfor i in range(k-1):\n\td.add(s[0])\n\tfor j in range(1,len(s)):\n\t\tif s[j] in d:\n\t\t\tcontinue\n\t\telse:\n\t\t\tprint(s[:j])\n\t\t\ts=s[j:]\n\t\t\tbreak\nprint(s)\n", "k = int(input())\r\nq = input().strip()\r\n\r\ndef solve(k, q):\r\n if k == 1:\r\n return [q]\r\n used = set()\r\n ss = []\r\n s = [q[0]]\r\n used.add(q[0])\r\n for i in range(1, len(q)):\r\n c = q[i]\r\n if c in used:\r\n s.append(c)\r\n continue\r\n used.add(c)\r\n ss.append(''.join(s))\r\n if len(used) == k:\r\n ss.append(q[i:])\r\n break\r\n s = [c]\r\n else:\r\n return False\r\n return ss\r\n\r\nans = solve(k, q)\r\nif ans:\r\n print('YES')\r\n for a in ans:\r\n print(a)\r\nelse:\r\n print('NO')\r\n", "N = int(input())\r\nX = input()\r\nif len(set(X)) < N:\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n print(\"YES\")\r\n Distinct = []\r\n Index = 0\r\n for i in range(N - 1):\r\n Result = \"\"\r\n Distinct.append(X[Index])\r\n while X[Index] in Distinct:\r\n Result += X[Index]\r\n Index += 1\r\n print(Result)\r\n print(X[Index:])\r\n", "q = int(input())\ns = input()\n\nunique = set()\n\nfor c in s:\n\tunique.add(c)\n\n#print(unique)\nif len(unique) < q:\n\tprint(\"NO\")\n\texit()\nprint(\"YES\")\n\nchar_to_index = {}\nfor c in s:\n\tchar_to_index[c] = s.index(c)\n#print(char_to_index)\n\n\nprints = []\nfor v in char_to_index.values():\n\tprints.append(v)\n#prints.append(len(s))\n#print(prints)\n\nfor i in range(q):\n\tif i == q-1:\n\t\tprint(s[prints[i]:])\n\telse:\n\t\tprint(s[prints[i]:prints[i+1]])\n\n\n", "import sys\r\nk = int(input())\r\nq = input()\r\n\r\nif len(set(q)) < k:\r\n print('NO')\r\nelse:\r\n first = ''\r\n s = ''\r\n print('YES')\r\n for i in range(len(q)):\r\n if q[i] not in first:\r\n if len(s) > 0:\r\n print(s)\r\n s =''\r\n s = q[i]\r\n first += q[i]\r\n k -= 1\r\n if k == 0:\r\n s += q[i+1:len(q)]\r\n print(s)\r\n break\r\n\r\n else:\r\n s += q[i]\r\n\r\n", "n=int(input())\ns=input()\nF=[0]*26\narr=[]\ni=0\nwhile i<len(s):\n\tif not F[ord(s[i])-ord('a')]:\n\t\ttem=s[i]\n\t\tF[ord(s[i])-ord('a')]=1\n\t\ti+=1\n\t\twhile i<len(s) and F[ord(s[i])-ord('a')]:\n\t\t\ttem=tem+s[i]\n\t\t\ti+=1\n\t\tarr.append(tem)\nif len(arr)<n:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\twhile len(arr)!=n:\n\t\tss=arr[-1]\n\t\tarr.pop(-1)\n\t\tss=arr[-1]+ss\n\t\tarr.pop(-1)\n\t\tarr.append(ss)\n\tprint(*arr,sep=\"\\n\")\n\t\t \t\t \t\t\t\t \t \t \t \t\t \t \t\t\t\t\t\t", "k = int(input())\ns = input()\nl = []\nse = set()\nfor i in range(len(s)):\n if s[i] not in se:\n l.append(i)\n se.add(s[i])\n if len(l) == k:\n break\n\nif len(l) < k:\n print(\"NO\")\n quit()\n\nl.append(len(s))\nprint(\"YES\")\nfor i in range(len(l) - 1):\n print(s[l[i]:l[i + 1]])\n", "def setOfString():\n\tq=input()\n\tsi=[]\n\tlastAdded=0\n\tcompletedAlphabet=[]\n\tcompletedAlphabet.append(q[0])\n\tnewString=''\n\tfor i in q:\n\t\tif(completedAlphabet.count(i)==0):\n\t\t\tsi.append(newString)\n\t\t\tnewString=i\n\t\t\tcompletedAlphabet.append(i)\n\t\telse:\n\t\t\tnewString+=i\n\tsi.append(newString)\n\treturn si\n\nk=int(input())\nsetOfStrings=setOfString()\nif(k>len(setOfStrings)):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tfor i in range(k-1):\n\t\tprint(setOfStrings[i])\n\tprint(str(setOfStrings[k-1:]).replace('[', '').replace(']', '').replace(\"'\", '').replace(' ', '').replace(',', ''))", "n = int(input())\r\ns = input()\r\na = {}\r\nl = []\r\ni = 0\r\nwhile i < len(s):\r\n\tf = True\r\n\tfor j in range(len(l)):\r\n\t\tif l[j][0] == s[i]:\r\n\t\t\tf=False\r\n\t\t\tbreak\r\n\tif f == True:\r\n\t\tl.append(s[i])\r\n\telse:\r\n\t\tl[-1] = l[-1]+s[i]\r\n\ti+=1\r\nif len(l)< n:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tfor i in range(n,len(l)):\r\n\t\tl[n-1]+=l[i]\r\n\tfor i in range(n):\r\n\t\tprint(l[i])\r\n", "n = int(input())\r\nletters = set([])\r\npos = []\r\ns = input()\r\ncounter = 0\r\nfor c in s:\r\n if not c in letters:\r\n letters.add(c)\r\n pos.append(counter)\r\n if len(letters)==n:\r\n break\r\n counter+=1\r\nif len(letters) != n:\r\n print(\"NO\")\r\n exit(0)\r\nelse:\r\n print(\"YES\")\r\n pos.append(len(s))\r\n for i in range(len(pos)-1):\r\n print(s[pos[i]:pos[i+1]])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\ns = input().strip()\r\na = set(s)\r\nif len(a) < k:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\nans = []\r\nx = 0\r\nuse = set()\r\nfor i in range(len(s)):\r\n if k == 1:\r\n print(s[x:])\r\n exit()\r\n if s[i] in use:\r\n continue\r\n else:\r\n use.add(s[i])\r\n if x != i:\r\n print(s[x:i])\r\n k -= 1\r\n x = i\r\nprint(s[x:])", "n=int(input())\r\ns=input()\r\nss=set(s)\r\nsub=\"\"\r\nif(len(ss)<n):\r\n\tprint(\"NO\");\r\nelse:\r\n\tprint(\"YES\")\r\n\tss=set([])\r\n\tss.add(s[0])\r\n\tn-=1\r\n\tfor a in s:\r\n\t\tif((a not in ss) and ( n>0)):\r\n\t\t#\tprint(\"dfd\")\r\n\t\t\tss.add(a)\r\n\t\t\tprint(sub)\r\n\t\t\tsub=a\r\n\t\t\tn-=1\r\n\t\telse:\r\n\t\t\t#print(\"in else\");\r\n\t\t\t#print(a)\r\n\t\t\tsub=sub+a\r\n\t\t\t#print(sub)\r\n\r\nprint(sub)\r\n\r\n", "k = int(input())\ns = input()\nsts = set(s[0])\nli = 0\narr = []\nfor i in range(1, len(s)):\n ch = s[i]\n if ch not in sts:\n sts.add(ch)\n arr.append(s[li:i])\n li = i\narr.append(s[li:])\nif len(arr) < k:\n print(\"NO\")\nelse:\n while len(arr) > k:\n r = arr.pop()\n l = arr.pop()\n arr.append(l + r)\n print(\"YES\")\n for st in arr:\n print(st)\n", "#!/usr/bin/python3\nn=int(input())\ns=input()\nres=\"\"\ndic=set()\nnum=0\nfor i,c in enumerate(s):\n if c in dic:\n res+=c\n else:\n res+=\"\\n\"\n dic.add(c)\n num+=1\n if num == n:\n res+=s[i:]\n break\n else:\n res+=c\nif num!=n:\n print (\"NO\")\nelse:\n print (\"YES\"+res)\n\n\n \n \n\n", "import sys\r\n\r\n#fin = open(\"input.txt\", 'r')\r\nfin = sys.stdin\r\n\r\nn = int(fin.readline())\r\ns = fin.readline().strip()\r\ni = 1\r\ncur = 0\r\nused = {c: False for c in \"qwertyuiopasdfghjklzxcvbnm\"}\r\nstarts = [0]\r\nused[s[0]] = True\r\nwhile i < len(s) and cur < n - 1:\r\n if not used[s[i]]:\r\n used[s[i]] = True\r\n starts.append(i)\r\n cur += 1\r\n i += 1\r\nif cur < n - 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n starts.append(len(s))\r\n for i in range(len(starts) - 1):\r\n print(s[starts[i]:starts[i + 1]])\r\n", "n = int(input())\r\narr = []\r\nst = input()\r\nalf = sorted(set(st))\r\nif len(alf) >= n:\r\n print(\"YES\")\r\n for j in alf: arr.append(st.find(j))\r\n arr.sort()\r\n for i in range(n - 1):\r\n print(st[arr[i]:arr[i + 1]])\r\n print(st[arr[n - 1]:])\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\r\nq = input()\r\n\r\nused = set()\r\nans = []\r\nt = ''\r\n\r\nfor c in q:\r\n\tif c in used:\r\n\t\tt += c\r\n\telse:\r\n\t\tif t:\r\n\t\t\tans.append(t)\r\n\t\tt = c\r\n\t\tused.add(c)\r\nans.append(t)\r\n\r\nif len(ans) < k:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tans[k-1] = ''.join(ans[k-1:])\r\n\tfor s in ans[:k]:\r\n\t\tprint(s)\r\n", "x = int(input())\r\nl = input()\r\nln = len(l)\r\nlst = []\r\nlst2 = []\r\nn = 0\r\nz = 0\r\nfor i in range(ln):\r\n if l[i] not in lst:\r\n lst.append(l[i])\r\n lst2.append(i)\r\n n+=1\r\n if n>=x:\r\n print('YES')\r\n z = 1\r\n break\r\nelse:\r\n print('NO')\r\nif z:\r\n if x==1:\r\n print(l)\r\n else:\r\n for q in range(1,x):\r\n print(l[lst2[q-1]:lst2[q]])\r\n else:\r\n print(l[lst2[-1]:])", "n = int(input())\r\ns = input()\r\nif n == 1:\r\n print(\"YES\")\r\n print(s)\r\n exit()\r\na = []\r\nb = []\r\nfor i in range(26):\r\n a.append(0)\r\n b.append(-1)\r\nfor i in range(len(s)):\r\n a[ord(s[i])-ord('a')] += 1\r\n if b[ord(s[i])-ord('a')] == -1:\r\n b[ord(s[i])-ord('a')] = i\r\n #print(s[i], i)\r\nnum = 0\r\nc = []\r\nfor i in range(26):\r\n if a[i] != 0:\r\n num += 1\r\n c.append(b[i])\r\n#print(c)\r\ni = 0\r\nlastNum = 0\r\nif num < n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n minNum = 100000\r\n for i in range(len(c)):\r\n if minNum > c[i]:\r\n minNum = c[i]\r\n minNumPos = i\r\n if c[minNumPos] != 0:\r\n print(s[:c[minNumPos]])\r\n lastNum = c[minNumPos]\r\n n -= 1\r\n c[minNumPos] = 100000\r\n while n > 1:\r\n minNum = 100000\r\n for i in range(len(c)):\r\n if minNum > c[i]:\r\n minNum = c[i]\r\n minNumPos = i\r\n print(s[lastNum:c[minNumPos]])\r\n lastNum = c[minNumPos]\r\n c[minNumPos] = 100000\r\n #print(c, lastNum)\r\n n -= 1\r\n print(s[lastNum:])\r\n #print(c, lastNum)\r\n#if num >= n:\r\n\r\n\r\n#print(a, b)", "def output():\r\n\tprint(\"YES\")\r\n\t\r\n\tfor st in ans:\r\n\t\tprint(st)\r\n\r\nk = int(input())\r\nq = input()\r\nn = len(q)\r\n\r\nans = []\r\nused = set()\r\nlim = 1\r\nlast = -1\r\nfor i in range(n):\r\n\tif q[i] not in used:\r\n\t\tif last != -1:\r\n\t\t\tlim += 1\r\n\t\t\tans.append(q[last : i])\r\n\t\tused.add(q[i])\r\n\t\tlast = i\r\n\tif lim == k:\r\n\t\tans.append(q[i:])\r\n\t\toutput()\r\n\t\tbreak\r\n\t\t\t\r\nif lim < k:\r\n\tprint(\"NO\")", "k = int(input())\r\nq = input()\r\na = []\r\nresult = []\r\nfor i in range(97, 123):\r\n a.append(chr(i))\r\nfor (j, t) in enumerate(q):\r\n if len(result) == k:\r\n result[len(result) - 1] += q[j:]\r\n break\r\n if t in a:\r\n a.remove(t)\r\n result.append(q[j])\r\n else:\r\n result[len(result) - 1] += t\r\nif len(result) == k:\r\n print('YES')\r\n for row in result:\r\n print(row)\r\nelse:\r\n print('NO')", "def setofstrings():\n k= int(input())\n q= input()\n \n qset= set([i for i in q])\n if len(qset)< k:\n print(\"NO\")\n return\n firsts= []\n print(\"YES\")\n if k== 1:\n print(q)\n return\n last= 0\n firsts.append(q[0])\n for i in range(len(q)):\n if q[i] not in firsts:\n firsts.append(q[i])\n print(q[last:i])\n last= i\n k-= 1\n if k== 1:\n print(q[last:])\n return\n \nsetofstrings()", "def main():\r\n n = int(input())\r\n s = input()\r\n result = []\r\n substring = []\r\n d = set()\r\n\r\n for i in range(len(s)):\r\n if n > 0 and s[i] not in d:\r\n if len(substring) > 0 :\r\n result.append(''.join(substring))\r\n substring = []\r\n substring.append((s[i]))\r\n d.add(s[i])\r\n n -= 1\r\n else:\r\n substring.append((s[i]))\r\n\r\n if len(substring) > 0 :\r\n result.append(''.join(substring))\r\n if n > 0:\r\n print('NO')\r\n return\r\n else:\r\n print('YES')\r\n for s in result:\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\n\r\ns = input()\r\na = []\r\nif len(s) < n:\r\n print (\"NO\")\r\n\r\nelse:\r\n for i in s:\r\n if len(a) == n:\r\n break\r\n if i in a:\r\n continue\r\n else:\r\n a.append(i)\r\n\r\n l = []\r\n for i in range(len(a)):\r\n if i == len(a)-1:\r\n l.append(s[s.index(a[i]):])\r\n else:\r\n l.append(s[s.index(a[i]):s.index(a[i+1])])\r\n\r\n if len(a) == n:\r\n print (\"YES\")\r\n for i in l:\r\n print (i)\r\n\r\n else:\r\n print (\"NO\")\r\n", "# print (\"Input k\")\nk = int(input())\n# print (\"Input the string\")\nst = input()\nln = len(st)\n\nif (k==1):\n print (\"YES\")\n print(st)\nelif (k > ln):\n print (\"NO\")\nelse: # Perhaps possible--build the set and list\n letset = set()\n indexlist = []\n for i in range(ln):\n if (st[i] not in letset): # A new letter-process it\n letset.add(st[i])\n indexlist.append(i)\n\n # Are there enough distinct letters to make it?\n if (len(letset) < k):\n print (\"NO\")\n else: # We can do it--print out each piece using the indexlist\n print (\"YES\")\n for i in range(k-1): # Must print the last one separately\n print(st[indexlist[i]:indexlist[i+1]])\n print (st[indexlist[k-1]:])\n \n \n", "n=int(input())\ns=input()\nc=0\nL=[]\natz=list('qwertyuiopasdfghjklzxcvbnm')\nfor ch in s:\n if c>=n:\n break\n if ch in atz:\n atz.remove(ch)\n c+=1\n L.append(s.find(ch))\nif c<n:\n print('NO')\nelse:\n print('YES')\n L.append(len(s)+1)\n for i in range(len(L)-1):\n print(s[L[i]:L[i+1]])\n", "from collections import *\nfrom heapq import *\nfrom bisect import *\nfrom math import *\nfrom itertools import *\nimport sys\ninf=float('inf')\n\nif __name__ == \"__main__\":\n\t# tcase = int(raw_input())\n\t# while tcase>0:\n\n\t# \ttcase-=1\n\tk = int(input())\n\ts = str(input())\n\tl = []\n\n\tfor i in s:\n\t if not i in l:\n\t l.append(i)\n\n\tvals = []\n\n\tif len(l) < k:\n\t print(\"NO\")\n\t sys.exit(0)\n\telse:\n\t print(\"YES\")\n\t for i in range(k):\n\t vals.append(s.index(l[i]))\n\n\tfor i in range(k):\n\t if i == k-1:\n\t print(s[vals[len(vals) - 1] : len(s)])\n\t else:\n\t print(s[vals[i] : vals[i + 1]])", "n=int(input())\r\ns=input()\r\ns=list(s)\r\ns1 = list( dict.fromkeys(s) )\r\nif len(s1)<n:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n i=0\r\n j=0\r\n while(j<n):\r\n ind=s.index(s1[i])\r\n j+=1\r\n if j<n:\r\n ind2=s.index(s1[i+1])\r\n for o in range(ind,ind2):\r\n print(str(s[o]),end=\"\")\r\n print()\r\n else:\r\n for o in range(ind,len(s)):\r\n print(s[o],end=\"\")\r\n print()\r\n i+=1\r\n \r\n \r\n ", "chars = set()\r\nk = int(input())\r\nq = input()\r\nstrings = []\r\n\r\nfor char in q:\r\n cur = len(strings)\r\n if char not in chars and cur < k:\r\n chars.add(char)\r\n strings.append(char)\r\n else:\r\n strings[cur-1] += char\r\n\r\nif len(strings) == k:\r\n print('YES')\r\n for string in strings:\r\n print(string)\r\nelse:\r\n print('NO')", "def main():\n k, q, s, res = int(input()), input(), set(), [\"YES\"]\n for i, c in enumerate(q):\n if c not in s:\n s.add(c)\n res.append('\\n')\n k -= 1\n if not k:\n res.append(q[i:])\n print(''.join(res))\n return\n res.append(c)\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/544/A\r\n\r\nn = int(input())\r\ns = input()\r\n\r\ns_s = set()\r\nl_i = list()\r\n\r\nfor (i, c) in enumerate(s):\r\n if len(l_i) != n:\r\n if c not in s_s:\r\n if len(l_i) != 0:\r\n l_i[len(l_i) - 1][1] = i\r\n l_i.append([i, len(s)])\r\n \r\n s_s.add(c)\r\n else:\r\n break\r\n\r\nif len(l_i) != n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\\n\" + \"\\n\".join(s[l_i[i][0]:l_i[i][1]] for i in range(n)))", "k=int(input())\r\ns=input()\r\nse=set(s)\r\nd={}\r\nfor i in se:\r\n d[i]=0\r\nif(len(se)<k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n i=0\r\n while(i<len(s) and k>1):\r\n k-=1\r\n d[s[i]]=1\r\n while(d[s[i]]==1):\r\n print(s[i],end=\"\")\r\n i+=1\r\n print()\r\n print(s[i:])\r\n ", "k, q = int(input()), input()\r\nused = set()\r\nwords = []\r\n\r\nfor ch in q:\r\n if len(words) == k or ch in used:\r\n words[-1] += ch\r\n else:\r\n used.add(ch)\r\n words.append(ch)\r\n\r\nif len(words) < k:\r\n print('NO')\r\nelse:\r\n print('YES', *words, sep='\\n')", "x=int(input())\r\ny=input()\r\np=set()\r\nb=[]\r\nfor l in y:\r\n p.add(l)\r\n b.append(l)\r\nif len(p)>=x:\r\n print(\"YES\")\r\n c=[]\r\n v=[]\r\n for l in b:\r\n if l not in c:\r\n c.append(l)\r\n i=0\r\n while i<x:\r\n v.append(b.index(c[i]))\r\n i+=1\r\n v.append(len(b))\r\n j=0\r\n t=[]\r\n s=\"\"\r\n while j<x:\r\n for h in range(int(v[j]),int(v[j+1])):\r\n s+=b[h]\r\n t.append(s)\r\n s=\"\"\r\n j+=1\r\n print(\" \".join(t))\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\r\nq = input()\r\nif k == 1:\r\n print('YES')\r\n print(q)\r\nelse:\r\n s, ans, t = set(), [], ''\r\n for i in q:\r\n if not(i in s):\r\n s.add(i)\r\n ans.append(t)\r\n t = i\r\n else:\r\n t += i\r\n ans.append(t)\r\n ans.pop(0)\r\n if len(ans) >= k:\r\n print('YES')\r\n print('\\n'.join(ans[i] for i in range(k - 1)))\r\n print(''.join(ans[i] for i in range(k - 1, len(ans))))\r\n else:\r\n print('NO')\r\n ", "k = int(input())\r\nq = input()\r\ns = [None]*k\r\nif k == 1:\r\n print(\"YES\")\r\n print(q)\r\nelse:\r\n first_letters = set([q[0]])\r\n j = 0\r\n i = 0\r\n while True:\r\n if q[i] not in first_letters:\r\n first_letters.add(q[i])\r\n s[j]=q[:i]\r\n j += 1\r\n q = q[i:]\r\n i = 1\r\n if j + 1 == k:\r\n s[j] = q\r\n print('YES')\r\n print('\\n'.join(s))\r\n break\r\n else:\r\n i += 1\r\n if i == len(q):\r\n print(\"NO\")\r\n break\r\n\r\n", "n=int(input())\r\ns=input()\r\ndic={}\r\nfor i in s:\r\n if i in dic:\r\n dic[i]=dic[i]+1\r\n else:\r\n dic[i]=1\r\nl=list(dic.keys())\r\noutput=[]\r\nif len(dic)<n:\r\n print(\"NO\")\r\nelse :\r\n for j in range(n):\r\n if j==n-1:\r\n a=s.find(l[j])\r\n output.append(s[a:len(s)])\r\n else:\r\n\r\n a=s.find(l[j])\r\n b=s.find(l[j+1])\r\n output.append(s[a:b])\r\n print(\"YES\")\r\n for k in range(n):\r\n print(output[k])\r\n", "n = int(input())\ns = input()\nc = set(s)\nif len(c) < n:\n\tprint('NO')\n\texit()\nidxs = []\nprint('YES')\nfor x in c:\n\tidxs.append(s.index(x))\nidxs.sort()\nidxs = idxs[:n] + [len(s)]\nfor i in range(len(idxs) - 1):\n\tprint(s[idxs[i] : idxs[i + 1]])\n", "n = int(input())\r\nt = input()\r\ns = set()\r\nl = []\r\nv = \"\"\r\nfor i in range(len(t)):\r\n\tif t[i] in s:\r\n\t\tcontinue\r\n\ts.add(t[i])\r\n\tl.append((t[i],i))\r\nif len(s) >= n:\r\n\tprint(\"YES\")\r\n\tk = 0\r\n\tflag = 0\r\n\tfor i in range(n-1):\r\n\t\tflag = 1\r\n\t\tprint(t[l[i][1]:l[i+1][1]])\r\n\tif flag == 0:\r\n\t\tprint(t[l[0][1]:])\r\n\tif flag == 1:\r\n\t\tprint(t[l[i+1][1]:])\r\nelse:\r\n\tprint(\"NO\")", "\r\nn=int(input())\r\n\r\ns=input()\r\n\r\nch=''\r\nm=set()\r\n\r\nif len(set(s))<n:\r\n\r\n print('NO')\r\n\r\nelse:\r\n\r\n print('YES')\r\n\r\n for i in s:\r\n\r\n if n==0 or i in m:\r\n ch+=i\r\n\r\n\r\n else:\r\n\r\n ch+='\\n'+i\r\n\r\n m.add(i)\r\n\r\n n-=1\r\n\r\nprint(ch)\r\n \r\n\r\n \r\n\r\n\r\n", "k = int(input())\r\ns = input()\r\nresult, new, used = list(), '', set()\r\nfor i in range(len(s)):\r\n if s[i] not in used:\r\n if len(new) > 0:\r\n result.append(new)\r\n new = ''\r\n new += s[i]\r\n used.add(s[i])\r\n else:\r\n new += s[i]\r\nresult.append(new)\r\nif len(result) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k, len(result)):\r\n result[k - 1] += result[i]\r\n for i in range(k):\r\n print(result[i])\r\n", "k = int(input())\r\ns = input()\r\nans = []\r\ncur = \"\"\r\nused = set()\r\nfor i in range(len(s)):\r\n if s[i] not in used:\r\n if len(cur) > 0:\r\n ans.append(cur)\r\n cur = \"\"\r\n cur += s[i]\r\n used.add(s[i])\r\n else:\r\n cur += s[i]\r\nans.append(cur)\r\nif len(ans) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k, len(ans)):\r\n ans[k - 1] += ans[i]\r\n for i in range(k):\r\n print(ans[i])", "k_ = input()\r\nk = int(k_)\r\n\r\nq= input()\r\n\r\nchString = ''\r\nindex = 0\r\nindexQ = []\r\n\r\nif len(q)<k:\r\n print(\"NO\")\r\nelse:\r\n for ch in q:\r\n \r\n if ch not in chString:\r\n chString += ch\r\n indexQ.append(index)\r\n index += 1\r\n\r\n if len(chString)<k:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n previous = 0\r\n for i in range(1,k+1):\r\n #print(i)\r\n if i==k:\r\n print(q[previous:])\r\n else:\r\n m= indexQ[i]\r\n print(q[previous:m])\r\n previous=m\r\n \r\n", "n=int(input())\r\nq=input().strip()\r\nseen=set(q[0])\r\nsubs=[]\r\ncur=0\r\nif len(set(q))>=n:\r\n print(\"YES\")\r\n for i,j in enumerate(q):\r\n if j not in seen:\r\n seen|={j}\r\n subs+=[q[cur:i]]\r\n cur=i\r\n n-=1\r\n if n<=1:\r\n subs+=[q[cur:]]\r\n break\r\n print(\"\\n\".join(subs))\r\nelse:\r\n print(\"NO\")", "def main():\n k, q, l, res = int(input()), input(), [True] * 123, []\n for i, c in enumerate(q):\n if l[ord(c)]:\n l[ord(c)] = False\n res.append(i)\n k -= 1\n if not k:\n res.append(101)\n print(\"YES\")\n print('\\n'.join(q[i:j] for i, j in zip(res, res[1:])))\n return\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\ns = input()\r\n\r\narr = set(list(s))\r\nif len(arr) < n:\r\n print(\"NO\")\r\n\r\nelse:\r\n ans = []\r\n d = {}\r\n\r\n for i in s:\r\n if i in d:\r\n ans[-1] += i\r\n else:\r\n d[i] = 1\r\n ans.append(i)\r\n \r\n print(\"YES\")\r\n for i in ans[:n-1]:\r\n print(i)\r\n\r\n print(''.join(ans[n-1:]))\r\n\r\n ", "\r\nk = input()\r\nword = input()\r\nlist = []\r\nlist2 = []\r\nfor i in word:\r\n if i not in list:\r\n list.append(i)\r\ncount = 0\r\nif len(list) < int(k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n list = list[:int(k)]\r\n for i in range(len(word)):\r\n if word[i:i+1] == list[count]:\r\n list2.append(i)\r\n #print(i)\r\n count += 1\r\n if count == int(k):\r\n break\r\n for i in range(len(list2)-1):\r\n string = word[list2[i]:list2[i+1]]\r\n print(string)\r\n print(word[list2[len(list2)-1]:])", "s=int(input())\r\nb=input()\r\nfreq=[0]*300\r\nc=0\r\np=[]\r\no=[]\r\nx=\"\"\r\nflag=True\r\nfor j in b:\r\n freq[ord(j)]+=1\r\nfor k in range(len(freq)):\r\n if freq[k]>=1:\r\n c+=1\r\n p+=[chr(k)]\r\nif c>=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n flag=False\r\nif flag:\r\n for k in b:\r\n if k in p and freq[ord(k)]!=0:\r\n if x!=\"\":\r\n o+=[x]\r\n x=k\r\n freq[ord(k)]=0\r\n elif freq[ord(k)]==0:\r\n x+=k\r\n else:\r\n o+=[x]\r\n for e in range(len(o)):\r\n if len(o)!=s:\r\n o[0]+=o[1]\r\n o.pop(1)\r\n for m in o:\r\n print(m)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def solve():\n n = int(input())\n s = str(input())\n\n if n == 1:\n print(\"YES\")\n print(s)\n return\n\n mp = dict()\n pos = []\n for i, letter in enumerate(s):\n if letter in mp:\n continue\n else:\n mp[letter] = True\n pos.append(i)\n\n if len(mp) < n:\n print(\"NO\")\n else:\n print(\"YES\")\n start = 0\n for i in range(n - 1):\n print(s[start: pos[i + 1]])\n start = pos[i + 1]\n print(s[start:])\n\nif __name__ == \"__main__\":\n solve()\n\n\n\n\n", "K = int(input())\r\n\r\nused = set()\r\n\r\nS = input()\r\n\r\nindexes = []\r\nind = 0\r\nwhile len(indexes) < K and ind < len(S):\r\n if S[ind] not in used:\r\n indexes += [ind]\r\n used.add(S[ind])\r\n ind += 1\r\n \r\nif len(indexes) < K:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n for i, v in enumerate(indexes):\r\n if i == len(indexes) - 1:\r\n print(S[v:])\r\n else:\r\n print(S[v:indexes[i+1]])\r\n \r\n ", "N = int(input())\nq = input()\nif len(set(q)) >= N:\n print('YES')\n chars = list(set(q))\n start = False\n for index,c in enumerate(q):\n if c in chars:\n if start is not False:\n print(q[start:index])\n N -= 1\n chars.remove(c)\n if N == 0:\n chars = []\n start = index\n else:\n print(q[start:])\n \nelse:\n print('NO')\n\n", "k = int(input())\r\ns = input()\r\ni = 0\r\nres = []\r\nvisited = [0] * 26\r\nprev = '#'\r\nwhile i < len(s) and k != 0:\r\n if visited[ord(s[i]) - ord('a')] == 0:\r\n k -= 1\r\n visited[ord(s[i]) - ord('a')] = 1\r\n res.append(i)\r\n i += 1\r\nif k != 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(len(res)):\r\n if i == len(res) - 1:\r\n print(s[res[i]:])\r\n else:\r\n print(s[res[i]: res[i + 1]])\r\n", "__author__ = 'clumpytuna'\r\nk = int(input())\r\ns = input()\r\nlist = []\r\nfor i in s:\r\n if not (i in list):\r\n list.append(i)\r\nif len(list) < k:\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n print(\"YES\")\r\ni = 0\r\nlist1 = []\r\ns1 = ''\r\nlist1.append(s[0])\r\nfor j in s:\r\n if j not in list1:\r\n if i + 1 ==k :\r\n s1 += j\r\n else :\r\n i+=1\r\n print(s1)\r\n s1 = \"\"\r\n s1 += j\r\n list1.append(j)\r\n else:\r\n s1 += j\r\nprint(s1)", "from string import *\r\nn = int(input())\r\ns = input()\r\nindices = sorted([s.index(c) for c in ascii_lowercase if c in s])\r\nif len(indices) < n:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\tindices += [len(s)]\r\n\tindices[n] = len(s)\r\n\tfor i in range(n):\r\n\t\tprint(s[indices[i]:indices[i+1]])\r\n", "k = int(input())\r\ns = input()\r\n\r\n\r\n\r\n\r\ncounter = 0\r\nused = set()\r\nfor let in s:\r\n if let not in used:\r\n counter += 1\r\n used.add(let)\r\nif counter < k:\r\n print('NO')\r\n \r\nelse:\r\n print('YES')\r\n counter = 0\r\n used = set()\r\n \r\n for let in s:\r\n \r\n if let not in used and counter < k:\r\n if used:\r\n print() \r\n counter += 1\r\n used.add(let)\r\n \r\n print(let, end = '')\r\n \r\n ", "n=int(input())\r\ns=input()\r\nk=\"\"\r\nj=0\r\nif n>len(set(s)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n-1):\r\n k+=s[j]\r\n f=s[j]\r\n j+=1\r\n while s[j] in k:\r\n k+=s[j]\r\n f+=s[j]\r\n j+=1\r\n print(f)\r\n print(s[j:])\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "number = int(input())\r\nstring = list(input())\r\n\r\nlib = []\r\nans = 0\r\nstring_set = []\r\n\r\nfor i in range(len(string)):\r\n if not (string[0] in lib): \r\n ans += 1\r\n lib.append(string[0])\r\n string_set.append(string.pop(0))\r\n else:\r\n string_set[-1] += string.pop(0)\r\n \r\n if ans == number or len(string) == 0:\r\n for j in range(len(string)):\r\n string_set[-1] += string[j]\r\n break\r\n\r\nif ans == number:\r\n print('YES')\r\n for i in string_set:\r\n print(i)\r\nelse:\r\n print('NO')\r\n", "k = int(input())\r\ns = input()\r\nif len({*s}) < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n a = []\r\n vis = set()\r\n for c in s:\r\n if len(a) == k or c in vis:\r\n a[-1] += c\r\n else:\r\n vis.add(c)\r\n a += c,\r\n print(*a,sep='\\n')" ]

[ "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn, k = mints()\r\nc = n-k\r\nr = []\r\nj = c + 1\r\nfor i in range(1,min(c,k)+1):\r\n\tr.append((j,i))\r\n\tj += 1\r\nfor i in range(c+1,k+1):\r\n\tr.append((j,c))\r\n\tj += 1\r\nres = 2\r\nif c == 1:\r\n\tres = 2\r\nelif c == 2:\r\n\tr.append((1,2))\r\n\tres = 3\r\nelif c <= k:\r\n\tres = 4\r\n\tfor i in range(1,c):\r\n\t\tr.append((i,c))\r\nelif c > k:\r\n\tif k == 2:\r\n\t\tr.append((1,3))\r\n\t\tfor i in range(3,c):\r\n\t\t\tr.append((i,i+1))\r\n\t\tr.append((c,2))\r\n\t\tres = c + 1\r\n\telse:\r\n\t\tmm = k + 1\r\n\t\tmid = [[] for i in range(k)]\r\n\t\tfor i in range(c-k-1):\r\n\t\t\tmid[i%k].append(i+k+2)\r\n\t\tfor i in range(k):\r\n\t\t\tfor j in range(1,len(mid[i])):\r\n\t\t\t\tr.append((mid[i][j-1], mid[i][j]))\r\n\t\t\tif len(mid[i]) == 0:\r\n\t\t\t\tr.append((i+1,mm))\r\n\t\t\telse:\r\n\t\t\t\tr.append((i+1,mid[i][0]))\r\n\t\t\t\tr.append((mid[i][-1],mm))\r\n\t\tres = len(mid[0])+1+len(mid[1])+1+2\r\nprint(res)\r\nfor i in r:\r\n\tprint(*i)\r\n", "n = list(map(int,input().split(' ')))\na,b = n[0],n[1]\nif b >= a-b-1:\n if a-b == 1:\n print(2)\n for i in range(2,a+1):\n print(1,i)\n elif a-b == 2:\n print(3)\n print(1,2)\n print(2,3)\n for i in range(4,a+1):\n print(3,i)\n else:\n print(4)\n for i in range(2,a-b+1):\n print(1,i)\n print(i,i+a-b-1)\n for i in range(2*(a-b),a+1):\n print(a-b,i)\nelse:\n s = (a-1)//b\n if (a-1)%b == 0:\n print(2*s)\n elif (a-1)%b == 1:\n print(2*s+1)\n else:\n print(2*s+2)\n for i in range(1,b+1):\n print(a,i)\n j = i\n while j+b < a:\n print(j,j+b)\n j = j+b", "n,k = map(int,input().split())\nn -= 1\nval = n//k\ndiv = n%k\ni = 2\nif div==0:\n print(val*2)\nelif div==1:\n print(val*2+1)\nelse:\n print((val+1)*2)\nfor a in range(k):\n print(1,i)\n for j in range(val-1):\n print(i,i+1)\n i+=1\n i+=1\nj = i-1\nwhile(div):\n print(j,i)\n i+=1\n j-=val\n div -= 1\n", "def pr(m):\r\n for i in range(len(m)):\r\n print(' '.join([str(x) for x in m[i]]))\r\n\r\nn, k = map(int, input().split())\r\nedge = [[1, v] if v < k+1 else [v-k, v] for v in range(2, n+1)]\r\n\r\ndef get_min_max_radius(n, k):\r\n r = (n-1) % k\r\n base = (n-1) // k\r\n \r\n if r == 0:\r\n return base * 2\r\n \r\n if r == 1:\r\n return base * 2 + 1\r\n \r\n return base * 2 + 2 \r\n \r\nprint(get_min_max_radius(n, k)) \r\npr(edge)", "import sys\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom math import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nimport heapq\r\nimport bisect\r\nimport random\r\nimport io, os\r\n\r\nif sys.hexversion == 50924784:\r\n sys.stdin = open('cfinput.txt')\r\n\r\n# input = sys.stdin.readline\r\n# input_int = sys.stdin.buffer.readline\r\n# RI = lambda: map(int, input_int().split())\r\n# RS = lambda: input().strip().split()\r\n# RILST = lambda: list(RI())\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: sys.stdin.readline().strip().split()\r\nRILST = lambda: list(RI())\r\n\r\nMOD = 10 ** 9 + 7\r\n\"\"\"https://codeforces.com/problemset/problem/827/B\r\n\r\n输入 n 和 k (2≤k<n≤2e5)。\r\n构造一棵有 n 个节点的树，其中度数为 1 的点恰好有 k 个，且这些点之间的最大距离最小。\r\n输出这个最小值，和这棵树的 n-1 条边。节点编号从 1 开始。\r\n如果有多种构造方案，输出任意一种。\r\n\r\n注：一个点的度数等于与该点相连的边的数目。\r\n输入\r\n3 2\r\n输出\r\n2\r\n1 2\r\n2 3\r\n解释 见右图\r\n\r\n输入\r\n5 3\r\n输出\r\n3\r\n1 2\r\n2 3\r\n3 4\r\n3 5\r\n解释 见右图\r\n\"\"\"\r\n\r\n\r\n# \t ms\r\ndef solve(n, k):\r\n d = (n - 1) // k\r\n if d * k == n - 1:\r\n print(2 * d)\r\n v = 1\r\n for _ in range(k):\r\n print(1, v + 1)\r\n v += 1\r\n for _ in range(d - 1):\r\n print(v, v + 1)\r\n v += 1\r\n return\r\n\r\n m = (n - 1) % k\r\n if m == 1:\r\n print(2 * d + 1)\r\n else:\r\n print(2 * d + 2)\r\n v = 1\r\n for _ in range(k):\r\n print(1, v + 1)\r\n v += 1\r\n for _ in range(d - 1):\r\n print(v, v + 1)\r\n v += 1\r\n if m:\r\n m -= 1\r\n print(v, v + 1)\r\n v += 1\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = RI()\r\n\r\n solve(n, k)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n, k = list(map(int, input().split()))\r\n # 均分到k条链中\r\n # 一个根固定，n - 1个节点均分到k条链中\r\n ans = [[1] for _ in range(k)]\r\n chain = 0\r\n for curr in range(2, n + 1):\r\n # 轮流放入\r\n ans[chain].append(curr)\r\n chain = (chain + 1) % k\r\n\r\n rest = (n - 1) % k\r\n avg = (n - 1 - rest) // k\r\n\r\n if rest == 0:\r\n print(2 * avg)\r\n elif rest == 1:\r\n print(2 * avg + 1)\r\n else:\r\n print(2 * avg + 2)\r\n\r\n for i in range(k):\r\n for j in range(1, len(ans[i])):\r\n print(ans[i][j - 1], ans[i][j])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, k = map(int, input().split())\r\nr = (n-1)//k\r\nl = n - 1\r\nx, y, = 1, 2\r\ndiam = 2*r\r\nif (n-1)%k == 1:\r\n diam += 1\r\nelif (n-1)%k >= 2:\r\n diam += 2\r\nprint(diam)\r\nfor i in range(k):\r\n br = r\r\n if i < (n-1)%k:\r\n br += 1\r\n x = 1\r\n for j in range(br):\r\n print(x, y)\r\n x = y\r\n y = y + 1\r\n l -= 1\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nq = ((n-2) % k) +1 \r\nt = (n-1) // k\r\nif q == 1:\r\n print(2*t+1)\r\nelif q == k:\r\n print(2*t)\r\nelse:\r\n print(2*t+2)\r\n# print(t, q)\r\nfor i in range(2, n+1):\r\n print(max(1, i-k), i)", "def func():\r\n if n - k == 1:\r\n print(2)\r\n for i in range(2, n + 1):\r\n print('%d %d' % (1, i))\r\n return\r\n if n - k == 2:\r\n print(3)\r\n print('1 2')\r\n print('1 3')\r\n for i in range(4, n + 1):\r\n print('2 %d' % i)\r\n return\r\n if k * 2 >= n - 1:\r\n print(4)\r\n for i in range(2, n - k + 1):\r\n print('1 %d' % i)\r\n print('%d %d' % (i, i + n - k - 1))\r\n for i in range(n * 2 - k * 2, n + 1):\r\n print('1 %d' % i)\r\n else:\r\n if (n - 1) % k > 1:\r\n print((n - 1) // k * 2 + 2)\r\n elif (n - 1) % k == 1:\r\n print((n - 1) // k * 2 + 1)\r\n else:\r\n print((n - 1) // k * 2)\r\n s1, s2 = divmod(n - 1, k)\r\n for i in range(1, s1 + 1):\r\n if i == s1:\r\n for j in range(1, s2 + 1):\r\n print((i - 1) * k + j, (i - 1) * k + j + k)\r\n break\r\n for j in range(1, k + 1):\r\n print((i - 1) * k + j, (i - 1) * k + j + k)\r\n for i in range(1, k + 1):\r\n print('%d %d' % (n, n - i))\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = [int(i) for i in input().split(' ')]\r\n # n, k = 3, 2\r\n # n, k = 4, 2\r\n # n, k = 5, 3\r\n # n, k = 6, 3\r\n # n, k = 6, 2\r\n # n, k = 8, 3\r\n # n, k = 1000, 245\r\n func()\r\n", "from sys import stdin, stdout\r\nfrom collections import deque\r\n\r\ndef bfs(v):\r\n ans = 0\r\n \r\n visit[v] = 1\r\n queue = deque()\r\n queue.append((v, 0))\r\n \r\n while (queue):\r\n v, dist = queue.popleft()\r\n \r\n ans = max(ans, dist)\r\n \r\n for u in vertices[v]:\r\n if not visit[u]:\r\n queue.append((u, dist + 1))\r\n visit[u] = 1\r\n \r\n return ans\r\n\r\n\r\nn, k = map(int, stdin.readline().split())\r\nchallengers = []\r\nans = []\r\n\r\nfor i in range(2, k + 2):\r\n ans.append((1, i))\r\n challengers.append(i)\r\n\r\nn = n - k - 1\r\nv = k + 2\r\n\r\nfor i in range(n // k):\r\n update = []\r\n \r\n for u in challengers:\r\n update.append(v)\r\n ans.append((u, v))\r\n v += 1\r\n \r\n challengers = update[:]\r\n\r\nfor u in challengers[:n % k]:\r\n ans.append((u, v))\r\n v += 1\r\n\r\nvisit = [0 for i in range(v)]\r\nvertices = [[] for i in range(v)]\r\n\r\nfor a, b in ans:\r\n vertices[a].append(b)\r\n vertices[b].append(a)\r\n\r\nstdout.write(str(bfs(v - 1)) + '\\n')\r\nfor a, b in ans:\r\n stdout.write(str(a) + ' ' + str(b) + '\\n')", "n, k = [int(i) for i in input().split()]\r\nc = (n - 1) // k\r\nt = (n - 1) % k\r\n\r\nif t == 0:\r\n res = c * 2\r\nelif t == 1:\r\n res = c * 2 + 1\r\nelse:\r\n res = c * 2 + 2\r\nprint(res)\r\n\r\ni = 2\r\nx = 0\r\nwhile i <= n:\r\n if x < t:\r\n idx = c + 1\r\n x += 1\r\n else:\r\n idx = c\r\n last = 1\r\n for _ in range(idx):\r\n print(*[last, i])\r\n last = i\r\n i += 1\r\n", "inp = [ int(x) for x in input().split() ]\r\nn = inp[0]\r\nk = inp[1]\r\n\r\nmainLen = (n-1) // k\r\nnodeLeft = (n-1) % k\r\n\r\nif nodeLeft == 0:\r\n print(mainLen*2)\r\nelif nodeLeft == 1:\r\n print(mainLen*2 + 1)\r\nelse:\r\n print(mainLen*2 + 2)\r\n\r\nfor i in range(1, n):\r\n if i <= k:\r\n print(str(n) + ' ' + str(i))\r\n else:\r\n print(str(i-k) + ' ' + str(i))", "n, k = map(int, input().split())\n\nx = (n - 1) // k\nr = (n - 1) % k\n\nedges = []\nu = 1\nfor j in range(k):\n prv = 0\n for i in range(x + 1 if j < r else x):\n edges.append((u, prv))\n prv = u\n u += 1\n\ncost = 2 * x + (2 if r >= 2 else 1 if r >= 1 else 0)\nprint(cost)\nfor u, v in edges:\n print(u + 1, v + 1)\n", "from sys import stdin, stdout\n\nn,k = map(int,stdin.readline().rstrip().split())\n\nprint(2+(n-2)//k+(n-3)//k)\n\nconnectionsList = []\n# Leaf node is 1. Make this node have connections to k children\nfor i in range(k):\n connectionsList.append((str(1),str(i+2)))\n\n\nfor i in range(k+2,n+1):\n connectionsList.append((str(i-k),str(i)))\n\nfor conn in connectionsList:\n print(' '.join(conn))\n", "n, k = map(int, input().split())\r\nmid = n-k-1\r\nr = [0] * k\r\nfor i in range(n-1):\r\n r[i%k] += 1\r\nprint(r[0]+r[1])\r\nv1 = 2\r\nans = []\r\nfor i in range(k):\r\n v0 = 1\r\n for _ in range(r[i]):\r\n ans.append(\"%d %d\"%(v0, v1))\r\n v0 = v1\r\n v1 += 1\r\nprint(\"\\n\".join(ans))", "n,k = map(int,input().split())\r\nn -= 1\r\nval = n//k\r\ndiv = n%k\r\ni = 2\r\nif div==0:\r\n print(val*2)\r\nelif div==1:\r\n print(val*2+1)\r\nelse:\r\n print((val+1)*2)\r\nfor a in range(k):\r\n print(1,i)\r\n for j in range(val-1):\r\n print(i,i+1)\r\n i+=1\r\n i+=1\r\nj = i-1\r\nwhile(div):\r\n print(j,i)\r\n i+=1\r\n j-=val\r\n div -= 1", "n, k = [int(s) for s in input().split()]\ns = n-k\nt = 0\nif (s-1)%k == 1:\n t = 1\nif (s-1)%k >= 2:\n t = 2\nprint(2*((s-1)//k) + t + 2)\nfor i in range(n//k):\n for j in range(k):\n if 1 + j + (i+1)*k <= n:\n print(1 + j + i*k, 1 + j + (i+1)*k)\n elif 1 + j + i*k < n:\n print(1 + j + i*k, n)\nfor i in range(1, n%k):\n print(n-i, n)\n", "n,k=list(map(int,input().strip().split(' ')))\r\nimport math\r\nL=math.ceil((n-(k+1))/(k))\r\n\r\nremain=(n-(k+1))%(k)\r\nif (n-(k+1))%(k)==0:\r\n remain+=k\r\n#print(L,remain,'L,remain')\r\nif remain%(k)==1:\r\n print(2*(L)+1)\r\nelse:\r\n print(2*(L+1))\r\n \r\n \r\n\r\nif 1==1:\r\n if n==2:\r\n print(1,2)\r\n else: \r\n temp=0\r\n end=k+1\r\n for j in range(2,k+1+1):\r\n print(1,j)\r\n if temp<remain:\r\n for p in range(0,L):\r\n if p==0:\r\n print(j,end+1)\r\n end+=1\r\n else:\r\n print(end,end+1)\r\n end+=1\r\n temp+=1 \r\n else: \r\n for p in range(0,L-1):\r\n if p==0:\r\n print(j,end+1)\r\n end+=1\r\n else:\r\n print(end,end+1)\r\n end+=1 \r\n\r\n\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, k):\r\n\tleaves = []\r\n\tfor i in range(1, k+1):\r\n\t\tleaves.append(i)\r\n\tdepth = [leaves]\r\n\tmy_max = 0\r\n\tfor i in range(k+1, n+1, k):\r\n\t\tL = []\r\n\t\tfor j in range(i, min(n+1, i+k)):\r\n\t\t\tL.append(j)\r\n\t\t\tmy_max = max(my_max, j)\r\n\t\tdepth.append(L)\r\n\tL = depth.pop()\r\n\tanswer = []\r\n\tif len(L) != 2:\r\n\t\ta = L.pop()\r\n\t\tif len(L) != 0:\r\n\t\t\tdepth.append(L)\r\n\t\tdepth.append([a])\r\n\t\tanswer1 = 2*len(depth)-2\r\n\telif len(L)==2:\r\n\t\ta, b = L \r\n\t\tdepth.append(L)\r\n\t\tanswer.append([a, b])\r\n\t\tanswer1 = 2*len(depth)-1\r\n\twhile len(depth) > 1:\r\n\t\trow = depth.pop()\r\n\t\trow2 = depth[-1]\r\n\t\tm = len(row)\r\n\t\tfor i in range(m):\r\n\t\t\ta = row[i]\r\n\t\t\tb = row2[i]\r\n\t\t\tanswer.append([a, b])\r\n\t\tfor i in range(m, len(row2)):\r\n\t\t\tanswer.append([row[-1], row2[i]])\r\n\tsys.stdout.write(f'{answer1}\\n')\r\n\tfor a, b in answer:\r\n\t\tsys.stdout.write(f'{a} {b}\\n')\r\n\r\nn, k = [int(x) for x in input().split()]\r\nprocess(n, k)", "import math\r\nn,k=map(int,input().split())\r\nsum=math.floor((n-1)/k)*2+min(2,(n-1)%k)\r\nprint(sum)\r\nfor i in range(2,n+1):\r\n\tprint(i,max(i-k,1))", "n, k = map(int, input().split())\r\ndiv = (n - 1) // k\r\nrem = (n - 1) % k\r\nif rem == 0:\r\n print(div * 2)\r\nelif rem == 1:\r\n print(2 * div + 1)\r\nelse:\r\n print(2 * (div + 1))\r\nj = 2\r\nrest = k - rem\r\nwhile rem > 0:\r\n print(1, j)\r\n for i in range(div):\r\n print(i + j, i + j + 1)\r\n j += (div + 1)\r\n rem -= 1\r\nwhile rest > 0:\r\n print(1, j)\r\n for i in range(div - 1):\r\n print(i + j, i + j + 1)\r\n j += div\r\n rest -= 1", "n,k=map(int,input().split())\r\nprint(((n-1)//k)*2+min(2,(n-1)%k))\r\nfor i in range(2,n+1):\r\n print(i,max(i-k,1))" ]

[ "input()\r\nk=set()\r\nans=0\r\nfor i in tuple(map(int,input().split())):\r\n if i not in k:\r\n k.add(i)\r\n ans=max(len(k),ans)\r\n else:\r\n k.remove(i)\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\na = [0]*n\nk = 0\nkm = 0\n\nfor i in input().split():\n i = int(i) - 1\n if a[i] == 0:\n a[i] = 1\n k += 1\n if k > km: km = k\n\n else:\n a[i] = 0\n k -= 1\n\nprint(km)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nc=0\r\nm=0\r\nfor i in range(2*n):\r\n if(l[i] not in d):\r\n c+=1\r\n d[l[i]]=1\r\n else:\r\n m=max(m,c)\r\n c-=1\r\n d.pop(l[i])\r\nprint(m)\r\n", "def socks():\r\n n = int(input())\r\n arr = [False for _ in range(n + 1)]\r\n pairs = list(map(int, input().split()))\r\n count = 0\r\n max_count = 0\r\n for p in pairs:\r\n if arr[p]:\r\n count -= 1\r\n else:\r\n arr[p] = True\r\n count += 1\r\n max_count = max(count, max_count)\r\n print(max_count)\r\n\r\nif __name__ == '__main__':\r\n socks()", "#yl1\r\nn=int(input())\r\nli=list(map(int,input().split()))\r\ntemp=set()\r\nmat=0\r\nfor i in li:\r\n if i not in temp:\r\n temp.add(i)\r\n if len(temp)>mat:mat=len(temp)\r\n else:temp.remove(i)\r\nprint(mat)\r\n", "import sys\n\nn = int(input())\nan = list(map(int, sys.stdin.readline().split()))\n\nans = 0\ncur = 0\n\non_table = set()\n\nfor x in an:\n if x in on_table:\n on_table.remove(x)\n else:\n on_table.add(x)\n if len(on_table) > ans:\n ans = len(on_table)\n\nprint(ans)\n", "n = int(input())\r\no = [False] * n\r\nk = 0\r\nkmax = 0\r\nfor s in input().split():\r\n nosok = int(s)\r\n if o[nosok-1]:\r\n kmax = max(k, kmax)\r\n k-=1\r\n else:\r\n o[nosok-1] = True\r\n k += 1\r\nprint(kmax)", "def main():\r\n\t#checked = set()\r\n\ttemp = int(input())\r\n\tlst = list(map(int, input().split()))\r\n\tcounter = 1\r\n\tlst2 = set()\r\n\tfor i in lst:\r\n\t\tif i not in lst2:\r\n\t\t\tlst2.add(i)\r\n\t\t\tif len(lst2) > counter:\r\n\t\t\t\tcounter = len(lst2)\r\n\t\telse:\r\n\t\t\tlst2.remove(i)\r\n\treturn counter\r\nprint(main())", "x=int(input());a=list(map(int,input().split()));p=0;mx=0;y=[0 for i in range(x)]\r\nfor i in range(x*2):\r\n\ty[a[i]-1]+=1\r\n\tif y[a[i]-1]==2:\r\n\t\tp-=1\r\n\telse:\r\n\t\tp+=1\r\n\t\tmx=max(mx,p)\r\nprint(mx)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nvis = [0 for i in range(1, 2*n+1)]\r\n\r\nres = 0\r\nans = 0\r\nfor sock in a:\r\n vis[sock] += 1\r\n if(vis[sock] < 2):\r\n res += 1\r\n else :\r\n res -= 1\r\n ans = max(ans, res)\r\nprint (ans)\r\n\r\n", "n = int(input())\nline = input()\nl = [int(x) for x in line.split()]\n# print(l)\n\ndic = {}\ni = 0\nm = 0\nfor x in l :\n\tif(dic.get(x, 0) == 0) :\n\t\tdic[x] = 1\n\t\ti += 1\n\t\tm = max(m, i)\n\telse :\n\t\tdic[x] = 0\n\t\ti -= 1\nprint(m)", "n = int(input())\r\nA = map(int, input().split())\r\nbefore = set()\r\ncnt = 0\r\nans = 0\r\nfor x in A:\r\n if x in before:\r\n cnt -= 1\r\n else:\r\n cnt += 1\r\n before.add(x)\r\n ans = max(ans, cnt)\r\nprint(ans)\r\n", "n = int(input())\r\nsocks = [int(x) for x in input().split(' ')]\r\ntable = set()\r\nm = 0\r\nfor sock in socks:\r\n if sock in table:\r\n table.remove(sock)\r\n else:\r\n table.add(sock)\r\n m = max(m, len(table))\r\nprint(m)", "# coding:utf-8\r\n# __author__ = '凯'\r\n\r\nn = int(input())\r\nb = set()\r\nm = 0\r\ncount = 0\r\nfor i in input().split():\r\n if i not in b:\r\n b.add(i)\r\n count += 1\r\n if count > m:\r\n m = count\r\n else:\r\n b.remove(i)\r\n count -= 1\r\nprint(m)\r\n", "n = int(input())\r\nst = set()\r\nm = 0\r\nc = 0\r\nfor i in list(map(int, input().split())):\r\n if i in st:\r\n c -= 1\r\n\r\n else:\r\n c += 1\r\n st.add(i)\r\n m = max(m, c)\r\nprint(m)\r\n\r\n", "def solve(n, x):\n maxi = 0\n c = set()\n for i in x:\n if i in c:\n c.remove(i)\n else:\n c.add(i)\n maxi = max(maxi, len(c))\n return maxi\n\n\ndef main():\n n = int(input())\n x = list(map(int, input().split()))\n print(solve(n, x))\n\n\nmain()\n", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\ns = set()\r\nmaxlen = 0\r\nfor i in l:\r\n\tif i in s:\r\n\t\ts.remove(i)\r\n\telse:\r\n\t\ts.add(i)\r\n \r\n \r\n\tmaxlen = max(maxlen, len(s))\r\n \r\nprint(maxlen)", "n = int(input())\n\ns = set()\n\n\nl = list(map(int, input().split()))\n\ncnt = 0\nfor x in l:\n\tif x in s:\n\t\ts.remove(x)\n\telse:\n\t\ts.add(x)\n\tcnt = max(cnt, len(s))\n\nprint(cnt)\n", "n=int(input())\r\nl=input().split()\r\nl1,c=set(),0\r\nfor i in l:\r\n\tif i not in l1:\r\n\t\tl1.add(i)\r\n\telse:\r\n\t\tl1.discard(i)\r\n\tc=max(c,len(l1))\r\nprint(c)", "n = int(input())\r\ns = set()\r\na = 0\r\nlst = [int(c) for c in input().split()]\r\nfor i in lst:\r\n\tif i not in s:\r\n\t\ts.add(i)\r\n\t\ta= max(a,len(s))\r\n\telse:\r\n\t\ts.remove(i)\r\nprint(a)\r\n", "n = int(input())\r\nx = input().split()\r\nlist1 = [0]*(n+1)\r\n\r\ncount = 0\r\nmax1 = 0\r\nfor i in range(2*n):\r\n if list1[int(x[i])] == 0:\r\n count+=1\r\n if count > max1:\r\n max1 = count\r\n list1[int(x[i])] = 1\r\n else:\r\n count -= 1\r\n list1[int(x[i])] = 0\r\n \r\n \r\n \r\n\r\nprint(max1)\r\n \r\n \r\n ", "import sys\r\n\r\ndef main():\r\n _, *l = map(int, sys.stdin.read().strip().split())\r\n s, c, m = set(), 0, 0\r\n for i in l:\r\n if i in s:\r\n s.remove(i)\r\n if m < c: m = c\r\n c -= 1\r\n else: s.add(i); c += 1\r\n return m\r\n \r\n \r\nprint(main())\r\n", "n = int(input().strip())\r\nmm = list(map(int, input().split()))\r\nl = [0] * (n+1)\r\nk = 0\r\nll = 0\r\nfor i in mm:\r\n if l[i] == 0:\r\n ll += 1\r\n l[i] = 1\r\n else:\r\n k = max(ll,k)\r\n ll -= 1\r\nprint(k)", "n = input()\r\nn = [int(s) for s in input().split()]\r\n\r\na = set()\r\nsum = 0\r\nmax = 0\r\nfor i in n:\r\n if i in a:\r\n a.remove(i)\r\n sum -= 1\r\n else:\r\n a.add(i)\r\n sum += 1\r\n if sum > max:\r\n max = sum\r\n\r\nprint(max)", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nd=set()\r\nans=chk=0\r\nfor i in x:\r\n if i in d:\r\n d.remove(i)\r\n chk-=1\r\n else:\r\n d.add(i)\r\n chk+=1\r\n ans=max(ans,chk)\r\nprint(ans)", "n = int(input())\r\na = set()\r\nb = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in b:\r\n if i in a:\r\n a.remove(i)\r\n else:\r\n a.add(i)\r\n ans = max(ans, len(a))\r\nprint(ans)", "n=int(input())\r\nstol=[0 for i in range(n)]\r\na=input().split()\r\nm=0\r\nk=0\r\nfor e in a:\r\n if stol[int(e)-1]==0:\r\n stol[int(e)-1]=1\r\n k+=1\r\n if k>m:\r\n m=k\r\n else:\r\n stol[int(e)-1]=0\r\n k-=1\r\nprint(m)", "n=int(input())\r\nl=list(map(int, input().split()))\r\ntable=[0]*(n+1)\r\ncnt=[]\r\nx=0\r\nfor i in l:\r\n if table[i]==0: table[i]+=1;x+=1\r\n else: cnt.append(x);x-=1\r\nprint(max(cnt))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nused = [0 for i in range(n)]\r\ncur = 0\r\nmaxn = -1\r\nfor i in range(2 * n):\r\n if used[arr[i] - 1] == 0:\r\n cur += 1\r\n used[arr[i] - 1] = 1\r\n else:\r\n used[arr[i] - 1] -= 1\r\n cur -= 1\r\n maxn = max(maxn, cur)\r\nprint(maxn)", "from collections import Counter\r\n\r\nl = int(input())\r\n\r\nc = Counter()\r\n\r\nmaximal = 0\r\n\r\nfor i in input().split():\r\n c[i] += 1\r\n \r\n if c[i] == 2:\r\n del c[i]\r\n \r\n maximal = max(maximal, len(c))\r\n \r\nprint(maximal)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n s = set()\r\n max_val = 0\r\n n = int(input())\r\n for a in list(map(int, input().split())):\r\n if a not in s:\r\n s.add(a)\r\n max_val = max(max_val, len(s))\r\n else:\r\n s.remove(a)\r\n print(max_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = set()\r\nsize = 0\r\nsizemax = 0\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor x in a:\r\n if x not in s:\r\n s.add(x)\r\n size += 1\r\n else:\r\n s.remove(x)\r\n size -= 1\r\n sizemax = max(sizemax, size)\r\n\r\nprint(sizemax)\r\n\r\n\"\"\"\r\n//////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n//////////////////////////////////////////\r\n\"\"\"", "int(input())\r\nd = list(map(int, input().split()))\r\n\r\nmaxResult = 0\r\n\r\ntemp = {}\r\nfor n in d:\r\n if n not in temp:\r\n temp[n] = 1\r\n if maxResult < len(temp):\r\n maxResult = len(temp)\r\n else:\r\n del temp[n]\r\n\r\nprint(maxResult)", "n = int(input())\nA = list(map(int, input().split()))\nc = set()\nans = 1\nfor i in A:\n if i in c:\n c.discard(i)\n else:\n c.add(i)\n ans = max(ans, len(c))\nprint(ans)", "n = int(input())\r\nused = [False for i in range(n + 2)]\r\narr = list(map(int, input().split()))\r\ncnt = 0\r\nmaxx = 0\r\nfor i in range(2 * n):\r\n if used[arr[i]]:\r\n cnt -= 1\r\n used[arr[i]] = False\r\n else:\r\n used[arr[i]] = True\r\n cnt += 1\r\n maxx = max(maxx, cnt)\r\nprint(maxx)\r\n", "n = int(input()) >> 1\n\nfound = {}\nr = c = 0\n\nfor x in input().split():\n if x in found:\n c -= 1\n else:\n found[x] = 1\n c += 1\n r = max(r, c)\n\nprint(r)", "n = int(input())\r\na = list(map(int,input().split()))\r\nd = {}\r\ncount = 0\r\nmax = 0\r\nfor i in range(len(a)):\r\n if a[i] not in d:\r\n d[a[i]] = 1\r\n count = count + 1\r\n if count > max:\r\n max = count\r\n else:\r\n count = count - 1\r\n\r\nprint(max)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nl1=[0]*(pow(10,5)+1)\r\nl2=[]\r\nfor i in l:\r\n l1[i]+=1 \r\n if l1[i]%2==0:\r\n c-=1 \r\n else:\r\n c+=1 \r\n l2.append(c)\r\nprint(max(l2))", "n= int(input())\r\narray=list(map(int,input().split()))\r\nsets=set()\r\nc=0\r\nfor x in array:\r\n if x not in sets:\r\n sets.add(x)\r\n c=max(len(sets),c)\r\n else:\r\n sets.remove(x)\r\nprint(c)", "n = int(input())\r\nsocks = input().split()\r\nsocks_on_table = {}\r\nresult = 0\r\n\r\nfor elem in socks:\r\n if socks_on_table.pop(elem, 0):\r\n pass\r\n else:\r\n socks_on_table[elem] = 1\r\n result = max(result, len(socks_on_table))\r\n\r\nprint(result)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nflag = [0]*(10**5+5)\r\nk = 0\r\nmx = 0\r\nfor c in arr:\r\n if flag[c]==0:\r\n k+=1\r\n flag[c]+=1\r\n mx = max(mx,k)\r\n else:\r\n k-=1\r\n flag[c]-=1\r\nprint(mx)", "a = int(input())\nl = list(map(str,input().split()))\ncnt = set()\nans = 1\nfor i in l:\n\tcnt ^={i}\n\tans = max(ans,len(cnt))\nprint(ans)\n", "num = int(input())\nsocks = map(int, input().split())\ntable = [0]*(10**5)\ncount = 0\nmaxx = 0\nfor i in socks:\n if i == table[i-1]:\n count -= 1\n else:\n table[i-1] = i\n count += 1 \n if count > maxx:\n maxx = count\n \nprint(maxx)\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\na=set()\r\nc=0\r\nt=[]\r\nfor i in range(2*n):\r\n a.add(l[i])\r\n if c< len(a):\r\n c+=1\r\n else:\r\n a.discard(l[i])\r\n t.append(c)\r\n c=len(a)\r\n\r\nprint(max(t))\r\n\r\n", "n = int(input())\nx = list(map(int, input().split()))\ndone = [0] * n\nres = 0\nr = 0\nfor i in range(2 * n):\n u = x[i] - 1\n done[u] += 1\n if done[u] == 1:\n r += 1\n if done[u] == 2:\n r -= 1\n if r > res:\n res = r\nprint(res)", "n = int(input())\r\nmax = 0\r\nnow = 0\r\narr = [False for i in range(0, 2 * n)]\r\nh = input().split(\" \")\r\nfor k in range(0, 2 * n):\r\n\tif arr[int(h[k])] == False:\r\n\t\tarr[int(h[k])] = True\r\n\t\tnow += 1\r\n\telse: \r\n\t\tnow -= 1\r\n\tif max < now:\r\n\t\tmax = now\r\nprint(max)\t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nst = set()\r\ncnt = ans = 0\r\n\r\nfor i in l :\r\n if i in st :\r\n cnt -= 1\r\n\r\n else:\r\n st.add(i)\r\n cnt += 1\r\n ans = max(cnt , ans)\r\n\r\nprint(ans)", "input()\r\narr = list(map(int,input().split()))\r\nst = set()\r\nans = 0\r\nfor i in arr:\r\n if not i in st:\r\n st.add(i)\r\n else:\r\n ans = max(ans,len(st))\r\n st.remove(i)\r\nprint(ans)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\nl=map(int,input().split())\r\ns=set()\r\nc=0\r\nfor i in l:\r\n\tif i not in s:\r\n\t\ts.add(i)\r\n\telse:\r\n\t\ts.remove(i)\r\n\tc=max(c,len(s))\r\nprint(c)", "n = int(input())\nst = set()\nans = 0\nfor i in map(int, input().split()):\n\tif i not in st:\n\t\tst.add(i)\n\t\tans = max(ans, len(st))\n\telse:\n\t\tst.remove(i)\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split()))\r\ncommon = set()\r\nans = 0\r\nc = 0\r\nfor i in range(len(l)):\r\n if l[i] not in common:\r\n c += 1\r\n common.add(l[i])\r\n else:\r\n ans = max(ans,c)\r\n c -= 1 \r\nprint(ans)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nd=0\r\nx=0\r\ns=[0]*pow(10,6)\r\nfor i in range(len(l)):\r\n \r\n if(s[l[i]]==0):\r\n d=d+1\r\n elif(s[l[i]]==1):\r\n d=d-1\r\n if(d>=x):\r\n x=d\r\n s[l[i]]=s[l[i]]+1\r\nprint(x)\r\n \r\n \r\n \r\n", "from collections import defaultdict\r\n\r\ndef arr_in():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn = int(input())\r\narr = arr_in()\r\nm = defaultdict(int)\r\n\r\n\r\ncnt = 0\r\nans = 0\r\nfor c in arr:\r\n if m[c] == 0:\r\n m[c] = 1\r\n cnt += 1\r\n ans = max(cnt, ans)\r\n else:\r\n m[c] -= 1\r\n cnt -= 1\r\nprint(ans)", "number = int(input())\r\ndict_2 = {}\r\ndata_2 = list(map(int,input().strip().split()))\r\ncount = 0\r\nsolution = 0\r\nif 2*number ==len(data_2):\r\n for i in data_2:\r\n if i in dict_2:\r\n count=count-1 \r\n else:\r\n dict_2[i]=1\r\n count=count+1\r\n solution=max(solution,count) \r\nprint(solution)", "\nN = int( input() )\nmy_dict = dict()\nmaxlen = 0\ncurrlen = 0\n\nnums = list(map(int, input().split()))\n\nfor i in nums:\n if(i in my_dict):\n my_dict.pop(i)\n currlen = currlen - 1\n else:\n my_dict[i] = True\n currlen = currlen + 1\n if(currlen > maxlen):\n maxlen = currlen\nprint(maxlen)\n", "n=int(input())\r\nk=0\r\nx=0\r\nB=[0]*(n+1)\r\nA=list(map(int,input().split()))\r\nfor i in range(2*n):\r\n if B[A[i]]==0:\r\n B[A[i]]=1\r\n k+=1\r\n x=max(k,x)\r\n else:\r\n B[A[i]]=0\r\n k+=-1\r\nprint(x) \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nm=0\r\nc=0\r\nfor i in l:\r\n if i in s:\r\n s.remove(i)\r\n else:\r\n \r\n s.add(i)\r\n m=max(m,len(s))\r\n \r\nprint(m)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\na=[0]*(n+2);m=0;now=0\r\nx=list(map(int,input().split()))\r\nfor i in range(2*n):\r\n if a[x[i]]==0:\r\n a[x[i]]=1\r\n now+=1\r\n m=max(m,now)\r\n else:\r\n now-=1\r\n a[x[i]]=0\r\nprint(m)", "n = int(input())\nl = input()\nl = l.split()\nfor i in range(2 * n):\n l[i] = int(l[i])\nstk = set()\nm = None\nfor x in l:\n if x in stk:\n stk.remove(x)\n else:\n stk.add(x)\n if m is None or len(stk) > m:\n m = len(stk)\nprint(m)\n", "input()\r\nh = input().split()\r\ns = set()\r\nm = 0\r\nfor i in h :\r\n s ^={i}\r\n if len(s)>m :\r\n m = len(s)\r\nprint(m)", "def solve(n, xs):\r\n m = 0\r\n table = set()\r\n for x in xs:\r\n if x in table:\r\n table.remove(x)\r\n else:\r\n table.add(x)\r\n\r\n m = max(m, len(table))\r\n return m\r\n\r\nprint(solve(\r\n int(input()),\r\n input().split()\r\n))", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nd={}\r\nmaxp=0\r\np=0\r\nfor x in l:\r\n if x not in d:\r\n d[x]=1\r\n p+=1\r\n else:\r\n d[x]-=1\r\n p-=1\r\n if p>maxp:\r\n maxp=p\r\nprint(maxp)", "from collections import Counter\r\ndef func():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n k={}\r\n m=0\r\n for i in l:\r\n if i in k:\r\n del k[i]\r\n else:\r\n k[i]=1\r\n if len(k)>m:\r\n m=len(k)\r\n print(m)\r\n \r\nt=1\r\n#t=int(input())\r\nfor i in range(t):\r\n func()", "lst=[0]*int(input());ans=v=0\nfor i in input().split():\n if lst[int(i)-1]==0:\n lst[int(i)-1]=1\n ans+=1\n if ans > v :\n v = ans \n else:\n ans-=1\nprint(v) \n \n\t \t\t\t\t\t \t \t\t\t\t \t\t\t\t\t \t\t\t\t \t", "from collections import defaultdict\n\ndef arr_in():\n return list(map(int, input().split()))\n\n\nn = int(input())\narr = arr_in()\nm = defaultdict(int)\n\n\ncnt = 0\nans = 0\nfor c in arr:\n if m[c] == 0:\n m[c] = 1\n cnt += 1\n ans = max(cnt, ans)\n else:\n m[c] -= 1\n cnt -= 1\nprint(ans)\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\nc = [0]*n\r\nx = 0\r\nr = 0\r\nfor i in mints():\r\n\tc[i-1] += 1\r\n\tif c[i-1] == 2:\r\n\t\tx -= 1\r\n\telse:\r\n\t\tx += 1\r\n\tr = max(r,x)\r\nprint(r)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ntable = {}\r\ntable[l[0]] = 1\r\nres = 1\r\nr = 0\r\nfor i in range(1,2*n):\r\n if l[i] in table:\r\n table[l[0]] = 0\r\n r = max(r,res)\r\n res-=1\r\n else:\r\n table[l[i]] = 1\r\n res+=1\r\n r = max(r,res)\r\nprint(r)", "#create array of socks to 0\n#table=0\n#increment array[i]\n#if value is 1, add to Table\n# else remove from table\nn = int(input())\nsocks_t = [0]*n\ntable = 0\nmax_table = -1\nsocks = list(map(int, input().split()))\nfor sock in socks:\n socks_t[sock-1] += 1\n if(socks_t[sock-1] == 1):\n table += 1\n else:\n table -= 1\n max_table = max(max_table, table)\nprint(max_table)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nans = 0\r\nfor x in a:\r\n if(x in s):\r\n s.remove(x)\r\n else:\r\n s.add(x)\r\n ans = max(ans, len(s))\r\nprint(ans)\r\n", "n = input()\r\ns = set()\r\ni = 0\r\nfor x in input().split():\r\n s ^= {x}\r\n i = max(i, len(s))\r\nprint(i)", "\"\"\"\r\n3\r\n2 1 1 3 2 3\r\n\r\nmap = {\r\n 2 : 2\r\n 1 : 2\r\n 3 : 1\r\n}\r\n\r\ncount = 1\r\n\r\n2 in map ? no\r\n1 in map ? no\r\n1 in map ? yes\r\n3 in map ? no\r\n2 in map ? yes\r\n\r\n\r\n\"\"\"\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n#\r\n\r\nn = inp()\r\nli = inlt()\r\n\r\nmap = {}\r\n\r\n_max = 0\r\n\r\ncount = 0\r\n\r\nfor i in li:\r\n if i in map:\r\n count -= 1\r\n else:\r\n count += 1\r\n map[i] = True\r\n _max = max(_max, count)\r\n\r\nprint(_max)", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\ntable=0\r\nr=0\r\nmap={}\r\nfor i in range (len(a)):\r\n if a[i] not in map:\r\n map[a[i]]=1\r\n table=table+1\r\n elif(a[i] in map):\r\n map[a[i]]=map[a[i]]-1\r\n table=table-1\r\n # print(map)\r\n r=max(table,r)\r\nprint(r)", "n = int(input())\r\nw = list(map(int, input().split()))\r\n\r\ns = set()\r\ncount = 0\r\nfor i in w:\r\n s ^= {i}\r\n if len(s) > count:\r\n count = len(s)\r\nprint(count)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nres,maxres=0,0\r\nlst=[0]*(n+1)\r\nfor i in a:\r\n if lst[i]==0:\r\n lst[i]=1 \r\n res+=1\r\n else:\r\n lst[i]=0\r\n res-=1 \r\n if res>maxres:\r\n maxres=res\r\nprint(maxres)", "tmp={}\nMax=0\nc=0\ninput()\nl = [*map(int,input().split())]\nfor i in l:\n if tmp.get(i,-1)==-1:\n tmp[i]=1\n c+=1\n if c>Max:\n Max=c\n else:\n tmp[i]=-1\n c-=1\nprint(Max)\n \n", "n = int(input ())\nkaos_kaki = list(map(int, input(). split ()))\nmeja = [False] * (n+1)\n\njawaban = 0\nbanyak_di_meja = 0\n\nfor i in range (len(kaos_kaki)):\n k = kaos_kaki [i]\n\n if meja [k]:\n banyak_di_meja -= 1\n meja [k]= False\n else:\n banyak_di_meja += 1\n meja [k]= True\n\n jawaban = max (jawaban, banyak_di_meja)\n\nprint(jawaban)\n\t \t \t \t \t \t \t\t \t \t \t \t \t", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef result():\r\n cnt=0\r\n maximum=0\r\n z=set()\r\n for i in a:\r\n \r\n if i in z:\r\n z.remove(i)\r\n else:\r\n z.add(i)\r\n maximum = max(maximum,len(z))\r\n return maximum\r\nprint (result())\r\n\r\n\r\n", "n = int(input())\nall_socks = list(map(int, input().split()))\ncurrent = [False] * n\nnumber = 0\nmax_number = 0\nfor i in all_socks:\n if current[i-1]:\n number -= 1\n else:\n number += 1\n if number > max_number:\n max_number = number\n current[i-1] = not(current[i-1])\nprint(max_number)\n", "from collections import Counter\r\ndef getMOT (s):\r\n\tglobal hash\r\n\tmax,cur = 0,0\r\n\tfor i in range(0,len(s)):\r\n\t\tif(hash[s[i]] < 2):\r\n\t\t\tcur -= 1\r\n\t\telse:\r\n\t\t\tcur += 1\r\n\t\t\thash[s[i]] = 1\r\n\t\tif(cur > max):\r\n\t\t\tmax = cur\r\n\treturn max\r\ninput()\r\nsock = [int(z) for z in input().split()]\r\nhash = Counter(sock)\r\nprint(getMOT(sock))\r\n", "n, s, b, count, Max = int(input()), list(map(int, input().split())), set(), 0, 0\r\nfor i in s:\r\n if i in b:\r\n count -= 1\r\n else:\r\n count += 1\r\n b.add(i)\r\n Max = max(Max, count)\r\nprint(Max)\r\n", "n = int(input()) #number of pair\r\norder = list(map(int, input().split()))\r\non_table = [False]*(2*n)\r\nresult = 0\r\ncnt = 0\r\nfor sock in order:\r\n\tif(on_table[sock]):\r\n\t\tcnt -= 1\r\n\telse:\r\n\t\ton_table[sock] = True\r\n\t\tcnt += 1\r\n\t\tresult = max(result, cnt)\r\n\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nA = set()\r\nm = 0\r\nfor i in a:\r\n if i in A:\r\n A.remove(i)\r\n else:\r\n A.add(i)\r\n if len(A) > m:\r\n m = len(A)\r\nprint(m)", "#!/usr/bin/env python3\r\n# -*- coding='utf-8' -*-\r\n\r\nn = int(input())\r\nL = input().split(' ')\r\nhave = n * [0]\r\n\r\nleft = 0\r\nans = 0\r\nfor x in L:\r\n i = int(x) - 1\r\n if have[i] == 0:\r\n left = left + 1\r\n have[i] = 1\r\n else:\r\n left = left - 1\r\n have[i] = 0\r\n ans = max(ans, left)\r\n\r\nprint(ans)", "n=int(input())\r\nx=map(int, input().split())\r\nmrk = [0]*(n+1)\r\nans, cnt = 0, 0\r\nfor idx in x:\r\n if mrk[idx] == 0:\r\n cnt+=1\r\n ans = max(ans, cnt)\r\n mrk[idx]=1\r\n else:\r\n cnt-=1\r\n mrk[idx]=0\r\nprint(ans)", "h = [0] * int(input()) * 2\r\nt, m = 0, 0\r\nfor i in list(map(int, input().split(' '))):\r\n if h[i]:\r\n t -= 1\r\n else:\r\n h[i] = 1\r\n t += 1\r\n m = max(t, m)\r\nprint(m)", "n = int(input())\nl = list(map(int, input().split()))\nt = set()\nans = 0\nfor i in l:\n if i in t:\n t.remove(i)\n else:\n t.add(i)\n ans = max(ans, len(t))\nprint(ans) \n", "n = int(input())\ns = set()\nm = 1\nfor i in input().split():\n if i in s:\n s.remove(i)\n else:\n s.add(i)\n m = max(len(s), m)\nprint(m)\n\n\t\t \t \t \t \t\t \t\t \t\t\t\t \t\t\t\t\t \t\t\t", "n = int(input())\r\na = map(int, input().split())\r\nf = [0] * (n + 1)\r\nc = 0\r\nm = 0\r\nfor e in a:\r\n if f[e]:\r\n c -= 1\r\n else:\r\n c += 1\r\n f[e] = 1\r\n m = max(c, m)\r\nprint(m)\r\n", "m=int(input())\ntotal=[0 for i in range(m+1)]\ntemp=0;ret=0\nn=list(map(int,input().split()))\nfor i in n:\n if total[i]==0:\n total[i]=1\n temp+=1\n else:\n temp-=1\n ret=max(ret,temp)\nprint(ret) \n", "n = int(input())\nl = list(map(int, input().split()))\ncommon = set()\nans = 0\nc = 0\nfor i in range(len(l)):\n if l[i] not in common:\n c += 1\n common.add(l[i])\n else:\n ans = max(ans,c)\n c -= 1 \nprint(ans)\n\t \t\t\t\t \t\t \t \t\t \t \t \t\t\t\t\t\t \t", "# print(\"Input n\")\nn = int(input())\n\n# print(\"Input the 2n integers\")\na = [int(x) for x in input().split()]\n\npairtracker = [0 for x in range(n)]\n\nlargestsofar = 0\ncountnow = 0\nfor x in a:\n x = x - 1 # Making it zero-based\n if pairtracker[x] == 0: # First one of the pair\n pairtracker[x] = 1\n countnow += 1\n if countnow > largestsofar:\n largestsofar = countnow\n else: # Second one of the pair\n countnow -= 1\n\nprint(largestsofar)\n", "input()\r\nsocks, max_socks = set(), 0\r\n\r\nfor x in input().split():\r\n if x in socks:\r\n socks.remove(x)\r\n else:\r\n socks.add(x)\r\n max_socks = max(len(socks), max_socks)\r\n\r\nprint(max_socks)", "t = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n\r\n a = 0\r\n c = 0\r\n m = {}\r\n for i in range(2*n):\r\n if m.get(A[i], 0) == 1:\r\n a -= 1\r\n elif m.get(A[i], 0) == 0:\r\n a += 1\r\n m[A[i]] = 1\r\n c = max(c, a)\r\n\r\n print(c)\r\n", "n = int(input())\r\nd = {}\r\nx = list(map(int, input().split()))\r\nt = 0\r\nmt = 0\r\nfor i in x:\r\n if i in d:\r\n del d[i]\r\n t-=1\r\n else:\r\n d[i] = 1\r\n t+=1\r\n if t>mt:\r\n mt = t\r\nprint(mt)", "# Description of the problem can be found at http://codeforces.com/contest/782/problem/0\r\n\r\n_ = input()\r\n\r\ns_l = list(map(int, input().split()))\r\nc_s = 0\r\nm_s = -1\r\ns_s = [0]*100002\r\n\r\nfor s in s_l:\r\n s_s[s] += 1\r\n \r\n if s_s[s] == 2:\r\n c_s -= 1 \r\n elif s_s[s] == 1:\r\n c_s += 1\r\n if c_s > m_s:\r\n m_s = c_s\r\n\r\nprint(m_s)", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nsocks_order = map(int, stdin.readline().split())\r\nmax_socks = 0\r\ntable = set()\r\n\r\nfor sock in socks_order:\r\n if sock not in table:\r\n table.add(sock)\r\n if max_socks < len(table):\r\n max_socks = len(table)\r\n else:\r\n table.remove(sock)\r\n\r\nstdout.write(str(max_socks))\r\nexit()\r\n", "n=int(input())\np=[int(x) for x in input().split()]\nl=[0]*n\na, maxa=0, 0\nfor s in p:\n if l[s-1]==0:\n a+=1\n l[s-1]=1\n else:\n a-=1\n\n maxa=max(maxa,a)\n\nprint(maxa)\n", "n = int(input())\r\nans , cnt, ind = 0, 0, 0\r\na = list(map(int,input().split()))\r\nmap = dict()\r\nfor x in a:\r\n\tif x not in map:\r\n\t\tmap[x] = ind\r\n\t\tcnt += 1\r\n\telse :\r\n\t\tcnt -= 1\r\n\tans = max(cnt, ans)\r\n\tind += 1\r\nprint(ans)\r\n", "s=set()\r\nn=int(input())\r\nans,curr=0,0\r\nfor i in list(map(int,input().split())):\r\n if i in s:\r\n s.discard(i)\r\n curr-=1\r\n else:\r\n s.add(i)\r\n curr+=1\r\n ans=max(ans,curr)\r\nprint(ans)", "stol={}\r\nfor i in range(1,int(input())+1):\r\n stol[i]=False\r\nm=0\r\nl=0\r\nfor i in list(map(int,input().split())):\r\n if stol[i]:\r\n l-=1\r\n else:\r\n stol[i]=True\r\n l+=1\r\n if l>m:\r\n m=l\r\nprint(m)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nq = [0] * n\r\nz = 0\r\nk = 0\r\nfor i in range(2*n):\r\n if q[a[i] - 1] == 0:\r\n q[a[i] - 1] = 1\r\n k += 1\r\n if k > z:\r\n z = k\r\n else:\r\n q[a[i] - 1] = 0\r\n k -= 1\r\nprint(z)", "no_of_socks=int(input())\r\nsocks=[]\r\nfor i in range(no_of_socks+1):\r\n socks.append(0)\r\npresent=0\r\nmaximum=0\r\nstring = input()\r\ni=0\r\nwhile i<len(string):\r\n j=0\r\n if string[i]==\" \":\r\n i+=1\r\n while string[i]!=\" \":\r\n j*=10\r\n j+=int(string[i])\r\n i+=1\r\n if i==len(string):\r\n break\r\n socks[j]+=1\r\n present+=1\r\n if(socks[j]==2):\r\n present-=2\r\n if(maximum<present):\r\n maximum=present\r\n\r\nprint (maximum)", "n = int(input())\r\nsocks = list(map(int, input().split()))\r\nflag = [0] * 100005\r\nans = 0\r\ncur = 0\r\nfor i in socks:\r\n if flag[i] == 0:\r\n flag[i] += 1\r\n cur += 1\r\n else:\r\n flag[i] = 0\r\n cur -= 1\r\n ans = max(cur, ans)\r\nprint(ans)\r\n", "n = int(input())\nkaos_kaki = list(map(int, input().split()))\nada_di_meja = [False]*(n+1)\n\njawaban = 0\nbanyak_kaos_kaki_di_meja = 0\n\nfor i in range(len(kaos_kaki)):\n k = kaos_kaki[i]\n\n if ada_di_meja[k]:\n banyak_kaos_kaki_di_meja -= 1\n ada_di_meja[k] = False\n else:\n banyak_kaos_kaki_di_meja += 1\n ada_di_meja[k] = True\n \n jawaban = max(jawaban, banyak_kaos_kaki_di_meja)\n\nprint(jawaban)\n\t\t\t\t\t\t\t\t \t\t \t \t \t \t \t\t\t \t \t\t\t", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\norder = [int(i)-1 for i in input().split()] #Order of socks taken\r\ncount = [0 for i in range(n)] #count[i-1] copies of sock i taken so far\r\ntable = 0 #Number of socks on the table\r\nM_table = 0 #Maximum number of socks on the table\r\n\r\nfor i in range(2*n):\r\n\tsock = order[i]\r\n\tif count[sock] == 0:\r\n\t\ttable += 1\r\n\t\tcount[sock] += 1\r\n\t\tM_table = max(M_table,table)\r\n\telif count[sock] == 1:\r\n\t\ttable -= 1\r\n\t\tcount[sock] += 1\r\n\r\nprint(M_table)\r\n", "n = int(input())\r\na = [int(item) for item in input().split()]\r\nc = 0\r\nv = [0 for i in range(n)]\r\nj = 0\r\nfor i in range(2 * n):\r\n v[a[i] - 1] += 1\r\n if v[a[i] - 1] == 2:\r\n c = max(c, j)\r\n v[a[i] - 1] = 0\r\n j -= 1\r\n else:\r\n j += 1\r\nprint(c)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(n):\r\n t.append(0)\r\nc=0\r\np=0\r\nfor i in x:\r\n if t[i-1]!=1:\r\n t[i-1]=1\r\n c+=1\r\n else:\r\n if(c>p):\r\n p=c\r\n c-=1\r\nprint(p)", "n = int(input())\nsocks = list(map(int, input().split()))\nflag = [0] * 100005\nans = 0\ncur = 0\nfor i in socks:\n if flag[i] == 0:\n flag[i] += 1\n cur += 1\n else:\n flag[i] = 0\n cur -= 1\n ans = max(cur, ans)\nprint(ans)\n\n \t\t\t\t \t \t \t \t\t \t \t\t \t \t\t", "\r\n#start the code from here\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nse=set()\r\nans=0\r\nfor i in range(len(l)):\r\n\tsdf=len(se)\r\n\tse.add(l[i])\r\n\tnlen=len(se)\r\n\tif nlen==sdf:\r\n\t\tse.remove(l[i])\r\n\tans=max(ans,len(se))\r\nprint(ans)\r\n\r\n", "from __future__ import print_function\r\nimport sys\r\n\r\ndef eprint(*args, **kwargs):\r\n print(*args, file=sys.stderr, **kwargs)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmark = [0] * 2*n\r\ntemp = 0\r\nans = 0\r\nfor i in a:\r\n if mark[i]==0:\r\n mark[i]=1\r\n temp+=1\r\n else:\r\n temp-=1\r\n ans = max(temp, ans)\r\nprint(ans)", "def mo(x,y):\r\n if x<y:\r\n x=y\r\n return x\r\n\r\ndef myfunc(l1):\r\n c = set(l1)\r\n i=0\r\n while i<len(l1):\r\n if l1[i] in c:\r\n c.remove(l1[i])\r\n l1[i]=1\r\n else:\r\n l1[i]=-1\r\n i+=1\r\n #print(l1)\r\n return l1\r\n\r\ndef counter(l2):\r\n temp=0\r\n ans=0\r\n i=0\r\n while i<len(l2):\r\n temp+=int(l2[i])\r\n ans=mo(ans,temp)\r\n i+=1\r\n return ans\r\n\r\ndef answer():\r\n a = int(input())\r\n print(counter(myfunc(input().split())))\r\n \r\n\r\nanswer()\r\n", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn=int(input())\nm=list(map(int,input().strip().split()[:2*n]))\nt=set()\nk=[]\ncount=0\nfor x in m:\n\tif x not in t:\n\t\tt.add(x)\n\t\tcount=max(count,len(t))\n\telse:\n\t\tt.remove(x)\nprint(count)", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nw=set([])\r\nans=c=0\r\nfor i in x:\r\n if i in w:\r\n c-=1\r\n else:\r\n c+=1\r\n w.add(i)\r\n ans=max(ans,c)\r\nprint(ans)\r\n", "import sys\r\nn = int(input())\r\nx = list(map(int,input().split()))\r\nstore = [0]*(n+1)\r\ntable = 0\r\nmaximum = 0\r\nfor i in range(len(x)):\r\n if store[x[i]] == 0:\r\n table += 1\r\n if table > maximum:\r\n maximum = table\r\n store[x[i]] = 1\r\n else:\r\n table -= 1\r\n store[x[i]] = 2\r\nprint(maximum)\r\n\r\n\r\n", "N = int(input())\r\nX = list(map(int, input().split()))\r\ntable = {X[0]}\r\nmaximum = 1\r\nfor i in range(1, 2 * N):\r\n if X[i] in table:\r\n table.remove(X[i])\r\n else:\r\n table.add(X[i])\r\n maximum = max(maximum, len(table))\r\n if maximum == N:\r\n print(N)\r\n exit()\r\nprint(maximum)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = set()\r\nbest = cur = 0\r\nfor x in a:\r\n if x in s:\r\n cur -= 1\r\n else:\r\n cur += 1\r\n if cur > best:\r\n best = cur\r\n s.add(x)\r\nprint(best)", "input()\r\nsp=input().split()\r\ncount=1\r\nsont=set()\r\nfor x in sp:\r\n\tsont^={x}\r\n\tl = len(sont)\r\n\tif l>count: count=l\r\nprint(count)\r\n", "input()\r\nsock = map(int,input().split())\r\ntable = set()\r\nans = 0\r\nfor s in sock:\r\n if s not in table:\r\n table.add(s)\r\n else:\r\n table.remove(s)\r\n ans = max(ans, len(table))\r\nprint(ans)", "n = int(input())\r\ns = n * [0]\r\na = map(int, input().split())\r\ncurrent = 0\r\nmax_r = 0\r\nfor x in a:\r\n if s[x-1] == 0:\r\n current += 1\r\n max_r = max(current, max_r)\r\n s[x-1] = 1\r\n else:\r\n s[x-1] = 0\r\n current -= 1\r\nprint(max_r)\r\n", "n = int(input())\r\ns = set()\r\nans = 0\r\nfor i in map(int, input().split()):\r\n ans = max(ans, len(s))\r\n if i in s:\r\n s -= set([i])\r\n else:\r\n s.add(i)\r\nprint(ans)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nselo = set()\r\nanswer = 1\r\nfor i in x:\r\n selo ^= {i}\r\n if len(selo) > answer:\r\n answer = len(selo)\r\nprint(answer)", "from math import *\r\nfrom sys import *\r\nn=int(stdin.readline())\r\na=list(map(int,stdin.readline().split()))\r\nd={}\r\nx=0\r\nans=[]\r\nfor i in range(2*n):\r\n ans.append(x)\r\n if a[i] in d:\r\n x-=1\r\n else:\r\n d[a[i]]=1\r\n x+=1\r\nans.append(x)\r\nprint(max(ans))", "n = int(input())\narr = list(map(int, input().split()))\n\ns = set()\nans = 0\n\nfor v in arr:\n if v in s:\n s.remove(v)\n else:\n s.add(v)\n\n ans = max(ans, len(s))\n \nprint(ans)", "n=int(input())\r\np=list(map(int,input().split()))\r\nk,d=0,{}\r\nfor i in range(2*n):\r\n if p[i] in d:del d[p[i]]\r\n else:d[p[i]]=1\r\n k=max(k,len(d))\r\nprint(max(k,len(d)))", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nfreq = n * [0]\r\noutput, table = 0, 0\r\nfor j in range(n * 2):\r\n if freq[nums[j] - 1] == 0:\r\n table += 1\r\n freq[nums[j] - 1] = 1\r\n else:\r\n table -= 1\r\n output = max(output, table)\r\nprint(output)\r\n", "n = int(input())\nsocks = list(map(int,input().split()))\npair = set([])\nans = 0\nfor i in socks:\n if i not in pair:\n pair.add(i)\n if len(pair) > ans:\n ans = len(pair)\n else:\n pair.remove(i)\nprint(ans)\n \t \t \t \t\t\t\t\t \t \t\t \t\t\t", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n A = map(int, wtf[1].split())\r\n ans = []\r\n T = set()\r\n for a in A:\r\n if a not in T:\r\n T.add(a)\r\n else:\r\n T.discard(a)\r\n ans.append(len(T))\r\n print(max(ans))\r\n", "n = int(input())\r\nsocks = list(map(int, input().split()))\r\nsockP = []\r\nfor i in range(100000):\r\n sockP.append(0)\r\nx = 0\r\nxMax = 0\r\nfor i in socks:\r\n if(sockP[i-1]==1):\r\n if (xMax < x):\r\n xMax = x\r\n x-=1\r\n else:\r\n sockP[i-1]=1\r\n x += 1\r\nprint(xMax)", "n=int(input())\r\nsp=list(map(int,input().split()))\r\ncount=1\r\nsont=set()\r\nfor x in sp:\r\n sont^={x}\r\n if len(sont)>count: count=len(sont)\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn=inp()\r\nli=inlt()\r\ncnt=0\r\nans=0\r\ndp=[0]*(n+1)\r\nfor i in li:\r\n if dp[i]==0:\r\n cnt=cnt+1\r\n dp[i]=1\r\n else:\r\n cnt=cnt-1\r\n ans=max(ans,cnt)\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nres = 0\r\ntable = set()\r\nfor sock in l:\r\n if sock not in table:\r\n table.add(sock)\r\n if len(table) > res:\r\n res = len(table)\r\n else:\r\n table.remove(sock)\r\nprint(res)\r\n ", "n=int(input())\na=list(map(int,input().split()))\nb=[0]*(n+1)\nc=0\nm=0\nfor x in a:\n b[x]=(b[x]+1)%2\n c+=(-1,1)[b[x]]\n m=max(m,c)\nprint(m)\n", "# Wadea #\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nm = set(arr)\r\ntable = dict()\r\nfor j in m:\r\n table[j] = 0\r\n\r\nc = 0\r\nx = 0\r\nfor i in arr:\r\n if table[i] == 1:\r\n c -= 1\r\n else:\r\n table[i] += 1\r\n c += 1\r\n if c > x: \r\n x = c\r\nprint(x)\r\n ", "from collections import defaultdict\r\n\r\nn = int(input())\r\ndic = defaultdict(lambda: 0)\r\nsocks = [int(i) for i in input().split()]\r\ntable = 0\r\nMax = 0\r\n\r\nfor i in socks:\r\n if dic[i] == 1:\r\n if Max < table:\r\n Max = table\r\n table -= 1\r\n else:\r\n dic[i] = 1\r\n table += 1\r\n\r\nprint(Max)\r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\nn = int(input())\r\nl = li()\r\nf = [0] * (n+1)\r\nans = tans = 0\r\nfor i in l:\r\n f[i] += 1\r\n if f[i] == 1:\r\n tans += 1\r\n else:\r\n tans -= 1\r\n ans = max(ans,tans)\r\nprint(ans)", "N = int(input())\nall_socks = map(int, input().split(\" \"))\n\n\ntable = set()\nmax_length = 0\nlength = 0\nfor sock in all_socks:\n if sock in table:\n length -= 1\n continue\n table.add(sock)\n length += 1\n if max_length < length:\n max_length = length\nprint(max_length)\n\n", "def socks(arr):\n table = set()\n n = 0\n ans = 0\n for i in arr:\n if i in table:\n table.remove(i)\n n -= 1\n else:\n table.add(i)\n n += 1\n ans = max(ans, n)\n return ans\n\nn = int(input())\narr = list(map(int, input().strip().split()))\nprint(socks(arr))", "n = input()\r\narr = input().split()\r\ns = set()\r\ncnt = 0\r\nmax_cnt = 0\r\nfor a in arr:\r\n if a in s:\r\n cnt -= 1\r\n s.remove(a)\r\n else:\r\n s.add(a)\r\n cnt += 1\r\n if cnt > max_cnt:\r\n max_cnt = cnt\r\n\r\nprint(max_cnt)\r\n", "N=100002\r\na=[0]*N\r\ncnt=0\r\nans=0\r\nn=int(input())\r\nfor i in input().split():\r\n i=int(i)\r\n if a[i]==0:\r\n cnt+=1\r\n a[i]=1\r\n ans=max(ans,cnt)\r\n else:\r\n cnt-=1\r\nprint(ans)", "n=int(input())\na=list(map(int,input().split()))\nb=[0 for i in range(n+1)]\nc,k=0,0\nfor i in a:\n if b[i]: c -= 1\n else: c += 1\n b[i]=1\n k=max(k,c)\nprint(k)\n", "n = int(input())\n\nt = set()\nmax_size = 0\nfor item in [int(item) for item in input().split(' ')]:\n if item in t:\n t.remove(item)\n else:\n t.add(item)\n max_size = max(max_size, len(t))\n\nprint(max_size)\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nm, c = set(), 0\r\nfor i in x:\r\n if i in m:\r\n m.remove(i)\r\n else:\r\n m.add(i)\r\n c = max(c, len(m))\r\nprint(c)", "n = int(input())\r\na = map(int, input().split())\r\narr = [0 for i in range(n)]\r\nans = 0\r\ncur = 0\r\nfor i in a:\r\n if arr[i-1] == 0:\r\n arr[i-1] += 1\r\n cur += 1\r\n else:\r\n cur -= 1\r\n ans = max(ans, cur)\r\nprint(ans)\r\n", "N = int(input())\r\nXs = list(map(int, input().split()))\r\n\r\ndict = {}\r\ncnt = 0\r\nans = 0\r\nfor x in Xs:\r\n if x in dict:\r\n cnt -= 1 \r\n else:\r\n dict[x] = True\r\n cnt += 1\r\n ans = max(ans, cnt)\r\n\r\nprint(ans)\r\n", "input()\r\nsocks = input().split()\r\nsocks_set = set()\r\nmax_socks = 0\r\nfor sock in socks:\r\n if sock in socks_set:\r\n max_socks = max(max_socks, len(socks_set))\r\n socks_set.remove(sock)\r\n else:\r\n socks_set.add(sock)\r\nprint(max(len(socks_set), max_socks))", "n = input()\r\na = map(int, input().split())\r\ns = set()\r\n\r\nans = 1\r\n\r\nfor i in a:\r\n s ^= {i}\r\n ans = max(ans , len(s))\r\n \r\nprint(ans)", "\r\nn = int(input().strip())\r\n\r\n\r\ntSocks = input().strip().split()\r\n\r\nTable = [0] * n\r\nMax = 0\r\nNumber = 0\r\n\r\nfor s in tSocks:\r\n s = int(s) - 1\r\n if Table[s] == 0:\r\n Table[s] = 1\r\n Number += 1\r\n if Number > Max:\r\n Max = Number\r\n else:\r\n Table[s] = 0\r\n Number -= 1\r\n if Number > Max:\r\n Max = Number\r\n\r\nprint(Max)\r\n \r\n \r\n\r\n\r\n", "num_sock_pairs= int(input())\nsock_pairs= list(map(int,input().split()))\nvisited =[0]*num_sock_pairs\nholder=0\nsize=0\nfor a in sock_pairs:\n if visited[a-1]==1:\n size=size-1\n else:\n visited[a-1]=1\n size=size+1\n if size>holder:\n holder=size\nprint(holder)\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n socks=[0]*n\r\n table=0\r\n max=0\r\n for i in input().split():\r\n i=int(i)\r\n if socks[i-1]==0:\r\n socks[i-1]+=1 \r\n table+=1\r\n if table > max:\r\n max=table\r\n else:\r\n table-=1\r\n print (max)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np={}\r\nm=[]\r\nfor i in l:\r\n\tif i not in p:\r\n\t\tp[i]=1\r\n\t\tm.append(len(p))\r\n\telif i in p:\r\n\t\tdel p[i]\r\n\t\tm.append(len(p))\r\nprint(max(m))", "n = int(input())\r\nused = [0] * n\r\nans = 0\r\ncur = 0\r\nn *= 2\r\na = list(map(int, input().split()))\r\nfor elem in a:\r\n t = elem - 1\r\n if (used[t] == 0):\r\n cur += 1\r\n if (used[t] == 1):\r\n cur -= 1\r\n used[t] += 1\r\n ans = max(ans, cur)\r\nprint(ans)\r\n", "#3\r\n#2 1 1 3 2 3\r\nn = int(input())\r\nsocks = list(map(int,input().split()))\r\ntotal = 0\r\nm = 0\r\nseen = set()\r\nfor x in socks:\r\n if x in seen:\r\n m = max(m,total)\r\n total -= 1\r\n else:\r\n total+=1\r\n seen.add(x)\r\nm = max(m,total)\r\nprint (m)", "n = input()\nx = input().split()\nn = int(n)\nx = [int(y) for y in x]\n\nr = 0\nres = 0\nseen = set()\nfor i in range(2 * n):\n\n if x[i] not in seen:\n r += 1\n else:\n r -= 1\n seen.add(x[i])\n\n if r > res:\n res = r\n\nprint(res)", "n=int(input())\r\nmas=list(map(int,input().split()))\r\nm=0\r\ns=set()\r\nfor i in mas:\r\n if i in s:\r\n s.remove(i)\r\n else:\r\n s.add(i)\r\n m=max(m,len(s))\r\nprint(m)\r\n", "def solve(t_id):\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n ans = 0\r\n d = {}\r\n for x in a:\r\n if x in d:\r\n del d[x]\r\n else:\r\n d[x] = 1\r\n ans = max(ans, len(d))\r\n print(ans)\r\nt = 1\r\n#t = int(input())\r\nfor t_id in range(1, t + 1):\r\n solve(t_id)\r\n t -= 1", "n = int(input())\r\narr = map(int, input().split())\r\ntemp = 0\r\ntemplist = set()\r\nfor i in arr:\r\n if i in templist:\r\n templist.remove(i)\r\n else:\r\n templist.add(i)\r\n temp = max(temp, len(templist))\r\n\r\nprint(temp)", "input();r=[*map(int,input().split())]\r\nd=dict();current=maxi=0\r\nfor i in r:\r\n try:d[i]+=1\r\n except:d[i]=1\r\n maxi=max(maxi,current)\r\n if d[i]>=2:d[i]-=2;current-=1\r\n else:current+=1\r\nprint(maxi)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set()\r\nt=0\r\nmx=-1\r\nfor i in a:\r\n if i not in s:\r\n s.add(i)\r\n t+=1\r\n else:\r\n if t>mx:\r\n mx=t\r\n t-=1\r\nprint(mx)", "n = int(input())\r\ncur = set()\r\nans = -1\r\nfor x in input().split():\r\n if x not in cur:\r\n cur.add(x)\r\n else:\r\n cur.remove(x)\r\n ans = max(ans, len(cur))\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nnow = 0\r\nans = 0\r\nused = [False] * n\r\nfor i in range(2 * n):\r\n if used[a[i] - 1]:\r\n now -= 1\r\n else:\r\n now += 1\r\n used[a[i] - 1] = True\r\n \r\n ans = max(ans, now)\r\n \r\nprint(ans)\r\n ", "n = int(input())\nsocks = map(int, input().split())\nseen = {}\ntable = 0\nmax_table = 0\nfor sock in socks:\n if sock in seen:\n table -= 1\n else:\n table += 1\n seen[sock] = True\n max_table = max(table, max_table)\n\nprint(max_table)\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n\r\n mn = set()\r\n ans = 0\r\n for x in l:\r\n if x not in mn:\r\n mn.add(x)\r\n ans = max(ans, len(mn))\r\n else:\r\n mn.remove(x)\r\n\r\n print(ans)\r\n", "n = int(input())\r\nl =[int(x) for x in input().split()]\r\ns =set()\r\nans = 0\r\nfor i in l:\r\n\tif i not in s:\r\n\t\ts.add(i)\r\n\telse:\r\n\t\tans = max(ans,len(s))\r\n\t\ts.remove(i)\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = set()\r\nmax_t = 0\r\nfor i in a:\r\n if i in t:\r\n t.remove(i)\r\n else:\r\n t.add(i)\r\n max_t = max(max_t, len(t))\r\nprint(max_t)", "import sys\r\n\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\ns = set()\r\nans = 0\r\nansm = 0\r\nfor i in range(2 * n):\r\n if a[i] in s:\r\n ansm = max(ans, ansm)\r\n ans -= 1\r\n s.remove(a[i])\r\n else:\r\n ans += 1\r\n s.add(a[i])\r\nprint(ansm)", "a, c, v = [False] * (int(input()) + 1), 0, 0\r\nfor x in map(int, input().split()):\r\n c += (-1) ** a[x]\r\n v = max(v, c)\r\n a[x] = not a[x]\r\nprint(v)", "number = int(input())\r\ns = input().split(\" \")\r\narr = set()\r\nmax_len = 0\r\nfor i in range(2 * number):\r\n if s[i] not in arr:\r\n arr.add(s[i])\r\n if len(arr) > max_len:\r\n max_len = len(arr)\r\n else:\r\n arr.remove(s[i])\r\nprint(max_len)", "n = int(input())\r\nss = map(int, input().split())\r\n\r\ntook = [False] * (n + 1)\r\ncount = 0\r\nmaxCount = 0\r\nfor s in ss:\r\n if took[s]:\r\n count -= 1\r\n took[s] = False\r\n else:\r\n count += 1\r\n took[s] = True\r\n maxCount = max(maxCount, count)\r\nprint(maxCount)\r\n", "n = int(input())\nn = [0] * (n + 1)\na = map(int, input().split())\ni = 0\nm = 0\nfor x in a:\n n[x] += 1\n if(n[x] == 1):\n i += 1\n m = max(i, m)\n else:\n i -= 1\nprint(m)\n", "n=int(input())\r\nl=map(int,input().split())\r\ns,c=set(),0\r\nfor x in l:\r\n\tif x not in s:s.add(x)\r\n\telse:s.remove(x)\r\n\tc=max(c,len(s))\r\nprint(c)", "def main():\r\n a = int(input())\r\n s = list(map(int, input().split()))\r\n b = 0\r\n c = []\r\n e = set()\r\n for i in range(a * 2):\r\n if s[i] not in e:\r\n b += 1\r\n e.add(s[i])\r\n else:\r\n c.append(b)\r\n b -= 1\r\n c.append(b)\r\n f = max(c)\r\n print(f)\r\nmain()", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\ntable = set()\r\nans = 0\r\nfor x in arr:\r\n if x in table:\r\n table.remove(x)\r\n else:\r\n table.add(x)\r\n ans = max(ans, len(table))\r\nprint(ans)", "'''input\r\n3\r\n2 1 1 3 2 3\r\n'''\r\n\r\n# import sys\r\n# from pprint import pprint\r\n\r\ntable = set()\r\nn = int(input())\r\nans = 0\r\nmax_ans = 0\r\n\r\nfor pair in input().split():\r\n if pair in table:\r\n ans -= 1\r\n table.remove(pair)\r\n # print('- #', pair)\r\n else:\r\n ans += 1\r\n table.add(pair)\r\n # print('+ #', pair)\r\n max_ans = max(ans, max_ans)\r\n # print('now ans =', ans, table)\r\n\r\nprint(max_ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ntable = set()\r\nmax_table = 0\r\nfor sock in a:\r\n if sock in table:\r\n table.remove(sock)\r\n else:\r\n table.add(sock)\r\n max_table = max(max_table, len(table))\r\nprint(max_table)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nans = 0 \r\ntable = set() \r\nfor item in lst:\r\n if item in table:\r\n table.remove(item)\r\n else:\r\n table.add(item)\r\n ans = max(ans, len(table))\r\nprint(ans)", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nnew = {}\r\nmax0 = float(\"-inf\")\r\nfor i in li:\r\n if i in new:\r\n new.pop(i)\r\n else:\r\n new[i] = 1\r\n max0 = max(max0, len(new))\r\nprint(max0)", "\r\ndef main() :\r\n\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n B = [0 for i in range(n + 10)]\r\n ans = 0\r\n cnt = 0\r\n for x in A :\r\n if(B[ x ] == 0) :\r\n B[ x ] = 1;\r\n cnt += 1;\r\n else :\r\n B[ x ] = 0;\r\n cnt -= 1;\r\n ans = max(ans, cnt)\r\n print(ans)\r\n\r\n return 0\r\n\r\n\r\nmain()", "def solve(lst, n):\n t = set()\n maxi, cnt = 1, 0\n for i in range(n):\n if lst[i] not in t:\n t.add(lst[i])\n cnt += 1\n else:\n if maxi < cnt: maxi = cnt\n t.remove(lst[i])\n cnt -= 1\n print(maxi) \n \n\nn = int(input()) * 2\nl = [int(x) for x in input().split()][:n]\nsolve(l, n)\n \t \t \t \t\t \t \t\t\t \t\t\t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nc=[0]*n\r\nm = 0\r\nt = 0\r\nfor i in a:\r\n if c[i-1]==0:\r\n c[i-1] = 1\r\n t+=1\r\n m = max(m,t)\r\n else:\r\n c[i-1] = 0\r\n t-=1\r\nprint(max(m,t))\r\n", "a = int(input())\r\nb = input().split()\r\ncount = 0\r\ntemp = set()\r\nmaximum = 0\r\nfor i in b:\r\n if i in temp:\r\n count -= 1\r\n else:\r\n temp.add(i)\r\n count+=1\r\n if maximum < count:\r\n maximum = count\r\nprint(maximum)", "from collections import defaultdict\r\nlen_sockes = int(input())\r\nsockes = defaultdict(int)\r\ntarget = [int(n) for n in input().split(\" \")]\r\nonthetable = 0\r\nanswer = 0\r\nfor t in target:\r\n if sockes[t] == 0:\r\n sockes[t] += 1\r\n onthetable += 1\r\n answer = max(answer,onthetable)\r\n elif sockes[t] == 1:\r\n onthetable -= 1\r\nprint(answer)\r\n", "n=int(input())\nx=input().split()\nt=dict()\nmaxt=0\ntm=0\nfor i in x:\n\tif(not i in t):\n\t\tt[i]=1\n\t\tmaxt=maxt+1\n\telse:\n\t\tt[i]=2\n\t\tmaxt=maxt-1\n\tif(maxt>tm):\n\t\ttm=maxt\n\t\t\nprint(tm)\n \t\t\t\t\t \t \t \t\t\t\t \t \t \t\t\t\t\t\t", "input()\r\nk=set()\r\nan=0\r\nfor i in tuple(map(int,input().split())):\r\n if i not in k:\r\n k.add(i)\r\n an=max(len(k),an)\r\n else:\r\n k.remove(i)\r\nprint(an)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n=2*int(input())\r\nt=list(map(int, input().split()))\r\nma=0\r\nd=0\r\np=[False for j in range(n//2)]\r\nfor i in range(n):\r\n \r\n if p[t[i]-1]:\r\n p[t[i]-1]=False\r\n d-=1\r\n else:\r\n p[t[i]-1]=True\r\n d+=1\r\n if ma<d:\r\n ma=d\r\nprint(ma)", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\np = [0] * n\r\nc = 0\r\nmx = 0\r\nfor i in range(2*n):\r\n if p[k[i]-1] == 0:\r\n c += 1\r\n p[k[i] - 1] = 1\r\n else:\r\n mx = max(c, mx)\r\n c -= 1\r\nmx = max(c, mx)\r\nprint(mx)", "n = int(input())\r\nA = [0]*n\r\nnow = 0\r\nres = 0\r\nB = list(map(int, input().split()))\r\nfor i in B:\r\n if A[i - 1] == 0:\r\n A[i - 1] = 1\r\n now+=1\r\n else:\r\n now-=1\r\n A[i - 1] = 0\r\n res = max(res, now)\r\nprint(res)", "n=int(input())\r\nd=dict()\r\nfor i in range(1,n+1):\r\n d[i]=0;\r\na=list(map(int,input().split()))\r\ncnt=0\r\nm=0\r\nfor i in a:\r\n if d[i]==0:\r\n cnt+=1\r\n d[i]=1\r\n else:\r\n cnt-=1\r\n d[i]=0\r\n m=max(m,cnt)\r\nprint(m)", "def main():\n n_socks = int(input())\n table = {}\n max_table_length = 0\n\n for i in input().split():\n if i in table:\n del table[i]\n else:\n table[i] = True\n if len(table) > max_table_length:\n max_table_length = len(table)\n\n print(max_table_length)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=[*map(int,input().split())]\r\nmx=k=0\r\nf=[0]*(n+1)\r\nfor i in range(len(a)):\r\n if f[a[i]]==1:k+=2\r\n else:f[a[i]]+=1\r\n mx=max(mx,i-k+1)\r\nprint(mx)\r\n", "n = int(input()); s = []; f = [0]*n; mx = 0; c = 0\r\nfor i in input().split():\r\n if f[int(i)-1]: c-=1\r\n else: c+=1; f[int(i)-1] = 1\r\n mx = max(mx, c)\r\nprint(mx)", "n=int(input())\r\nc=[]\r\nd={}\r\ns=map(int,input().split())\r\ndic={}\r\nfor i in s:\r\n if i not in dic.keys():\r\n dic[i]=0\r\n continue\r\n if i in dic.keys():\r\n c.append(len(dic))\r\n dic.pop(i)\r\n continue\r\n \r\nprint(max(c))\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\ncs = 0\r\ntable = set()\r\nfor i in range(len(ll)):\r\n if ll[i] not in table:\r\n table.add(ll[i])\r\n cs=max(cs,len(table))\r\n else:\r\n table.remove(ll[i])\r\nprint(cs)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\nsum = 0\r\nmaxi = 0\r\nfor i in l:\r\n d[i] = d.get(i,0)+1\r\n if d[i] %2 == 0:\r\n sum -= 1\r\n else:\r\n sum += 1\r\n maxi = max(sum,maxi)\r\nprint(maxi)\r\n\r\n", "input();a=set();r=0\r\nfor x in map(int,input().split()):\r\n if x in a:a-={x}\r\n else: a|={x}\r\n r=max(r,len(a))\r\nprint(r)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * (n + 1)\r\ncount = 0\r\nc = 0\r\n\r\nfor k in range(len(a)):\r\n n = a[k]\r\n\r\n if b[n] == 1:\r\n b[n] = 0\r\n c -= 1\r\n else:\r\n b[n] = 1\r\n c += 1\r\n\r\n if c > count:\r\n count = c\r\n\r\nprint(count)\r\n", "# for testCase in range(int(input())):\nn = int(input())\nsocks = map(int ,input().split())\ncollected_one = [False for i in range(n+1)]\nans = cnt = 0\nfor i in socks:\n if not collected_one[i]:\n cnt += 1\n collected_one[i] = True\n else:\n cnt -= 1\n ans = max(ans ,cnt)\nprint(ans)\n", "#780A-Andryusha and Socks\r\nn=int(input())\r\nolist=[int(x) for x in input().split(' ')]\r\nsdic={}\r\nans=0\r\nanslist=[]\r\nfor i in range(1,n+1): \r\n sdic[i]=0\r\nfor i in olist:\r\n if sdic[i]==0:\r\n sdic[i]=1\r\n ans+=1\r\n anslist.append(ans)\r\n else:\r\n ans-=1\r\n anslist.append(ans)\r\nprint(max(anslist))\r\n", "pares = int(input())\n\ndic_pares = {i+1:0 for i in range(pares)}\n\nordem = [int(x) for x in input().split()]\n\ncont = 0\nmaximo = 0\nfor i in ordem:\n if dic_pares.get(i) == 0:\n dic_pares[i] = 1\n cont += 1\n else:\n cont -= 1\n \n maximo = max(maximo, cont)\n \nprint(maximo)\n\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\nmaxn = maxans = 0\r\nused = [True] * n\r\nfor i in range(n * 2):\r\n if used[a[i] - 1]:\r\n used[a[i] - 1] = False\r\n maxn += 1\r\n elif not used[a[i] - 1]:\r\n\r\n maxn -= 1\r\n if maxn > maxans:\r\n maxans = maxn\r\nprint(maxans)", "n = int(input())\r\nsocks = list(map(int, input().split()))\r\nf = [0] * (n + 1)\r\ncur = 0\r\nans = 0\r\nfor s in socks:\r\n if f[s] == 1:\r\n cur -= 1\r\n else:\r\n cur += 1\r\n f[s] = 1\r\n ans = max(ans, cur)\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[0]*n\r\nm=0\r\nc=0\r\nfor i in range(2*n):\r\n x[l[i]-1]+=1\r\n if(x[l[i]-1]==1):\r\n c+=1\r\n if(c>m):\r\n m=c\r\n else:\r\n c-=1\r\nprint(m)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmas = [0] * n\r\nk = 0\r\nm = 0\r\nfor i in range(2*n):\r\n mas[a[i]-1] += 1\r\n if mas[a[i]-1] == 1:\r\n k += 1\r\n else:\r\n k -= 1\r\n if k > m:\r\n m = k\r\nprint(m)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ntbl, res = set(), 0\r\nfor x in lst:\r\n if x in tbl:\r\n tbl.remove(x)\r\n else:\r\n tbl.add(x)\r\n res = max(res, len(tbl))\r\nprint(res)", "#!/usr/bin/env pypy3\r\n# -*- coding: UTF-8 -*-\r\n\r\nn=int(input())\r\nx=[int(i) for i in input().split()]\r\nchk=[0]*(n+1)\r\nans=tmp=0\r\nfor i in x:\r\n if chk[i]==0:\r\n chk[i]=1\r\n tmp+=1\r\n else:\r\n chk[i]=0\r\n tmp-=1\r\n ans=max(ans,tmp)\r\nprint(ans)", "table=set()\nmaxN=0\nn=input()\nfor n in [int(x) for x in input().split()]:\n if n in table:\n table.discard(n)\n else:\n table.add(n)\n maxN=max(len(table),maxN)\nprint(maxN)\n \t \t \t\t \t \t\t\t\t \t \t \t\t\t", "n = int(input())\r\nsocks = [0]*n\r\nx = list(map(int, input().split()))\r\nans = 0\r\ncur = 0\r\nfor i in x:\r\n if socks[i-1]:\r\n cur -= 1\r\n socks[i-1] = 0\r\n else:\r\n socks[i-1] = 1\r\n cur += 1\r\n ans = max(ans, cur)\r\nprint(ans)\r\n", "n,ans,stack,s = int(input()),0,0,set()\r\nfor i in input().split():\r\n if not i in s: stack+=1\r\n else: stack-=1\r\n ans = max(ans,stack)\r\n s.add(i)\r\nprint(ans)\r\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\nimport bisect\r\n\r\nn=I()\r\n\r\nx=L()\r\nt={}\r\nans=0\r\nfor i in range(2*n):\r\n ans=max(ans,len(t))\r\n\r\n if x[i] in t:\r\n t[x[i]]-=1\r\n\r\n if t[x[i]]==0:\r\n t.pop(x[i])\r\n\r\n else:\r\n t[x[i]]=1\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n \r\n\r\n", "n=int(input())\r\nm=list(map(int,input().strip().split()[:2*n]))\r\nt=set()\r\nk=[]\r\ncount=0\r\nfor x in m:\r\n\tif x not in t:\r\n\t\tt.add(x)\r\n\t\tcount=max(count,len(t))\r\n\telse:\r\n\t\tt.remove(x)\r\nprint(count)", "n = int(input())\r\n\r\norder = list(map(int, input().split()))\r\n\r\nans = []\r\ncurrent = 0\r\nfound = set()\r\n\r\nfor sock in order:\r\n if sock in found:\r\n ans.append(current)\r\n current -= 1\r\n \r\n else:\r\n current += 1\r\n found.add(sock)\r\n \r\nprint(max(ans))\r\n \r\n ", "n = int(input())\r\n\r\nd = {}\r\n\r\na = list(map(int, input().split()))\r\n\r\nt = 0\r\nmt = 0\r\n\r\nfor s in a:\r\n if s in d:\r\n del d[s]\r\n t -= 1\r\n else:\r\n d[s] = 1\r\n t += 1\r\n if t > mt:\r\n mt = t\r\n \r\nprint(mt)", "num = int(input())\r\nd = {}\r\nm = 0\r\nn = list(map(int,input().split(\" \")))\r\nfor i in range(2*num):\r\n if n[i] not in d:\r\n d[n[i]]=1\r\n else:\r\n d.pop(n[i])\r\n x = len(d.values())\r\n if m<x:\r\n m = x\r\nprint(m) \r\n\r\n", "#in the name of god\r\n#Mr_Rubick\r\nb=[0]*100000\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nsumi=0\r\nmx=0\r\nfor i in range(2*n):\r\n b[a[i]-1]+=1\r\n if b[a[i]-1]==1:sumi+=1\r\n else:sumi-=1\r\n mx=max(mx,sumi)\r\nprint(mx)", "n = int(input())\r\n\r\nsocks = list(map(int, input().strip().split(\" \")))\r\n\r\ntable = set()\r\nmaximo = 0\r\n\r\nfor sock in socks:\r\n if sock not in table:\r\n table.add(sock)\r\n else:\r\n table.remove(sock)\r\n \r\n if len(table) > maximo:\r\n maximo = len(table)\r\n \r\nprint(maximo)", "n = int(input())\nX = tuple(map(int, input().split()))\n\nC = []\n\ndesk = set() \n\nfor x in X:\n if x not in desk:\n desk.add(x)\n C.append(len(desk))\n else:\n desk.remove(x)\n C.append(len(desk))\n\nprint(max(C))\n", "n=int(input())\r\nl=input().split()\r\nd={}\r\nc=0\r\nfor k in l:\r\n if k in d:\r\n d.pop(k)\r\n else:\r\n d[k] = 1\r\n if c<len(d):\r\n c=len(d)\r\nprint(c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nans, t = 0, 0\r\nb = [0 for i in range(n)]\r\nfor x in a:\r\n if b[x-1]:\r\n b[x-1] -= 1\r\n t -= 1\r\n else:\r\n b[x-1] += 1\r\n t += 1\r\n if t > ans:\r\n ans = t\r\n\r\nprint(ans)\r\n", "\"\"\"Andryusha and Socks\"\"\"\r\nn = int(input())\r\nsocks = list(map(int, input().split()))\r\nsocks_on_table = 0\r\ncount = 0\r\ny = [0] * 2 * n\r\nfor i in socks:\r\n y[i] += 1\r\n if y[i] == 2:\r\n count -= 1\r\n else:\r\n count += 1\r\n socks_on_table = max(socks_on_table, count)\r\nprint(socks_on_table)\r\n\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\nans = 0\r\nx = set()\r\n\r\nfor i in arr:\r\n\tif i not in x:\r\n\t\tx.add(i) \r\n\t\tans = max(ans,len(x))\r\n\telse:\r\n\t\tx.remove(i)\r\n\r\nprint(ans)", "n = int(input())\r\na = [int(el) for el in input().split()]\r\ns = set()\r\nres = 0\r\nfor el in a:\r\n if el not in s:\r\n s.add(el)\r\n else:\r\n s.discard(el)\r\n res = max(res, len(s))\r\n \r\nprint(res)\r\n \r\n ", "nb_pair = int(input())\r\ndrawn = [int(x) for x in input().split()]\r\nmaxs = 1\r\ntable = set()\r\nfor i in drawn:\r\n table ^= {i}\r\n maxs = max(maxs, len(table))\r\nprint(maxs)\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nt = [0] * 100000\r\nc = 0\r\nsum = 0\r\n\r\nfor i in l:\r\n t[i-1] += 1\r\n if t[i-1] == 1:\r\n sum += 1\r\n else:\r\n sum -= 1\r\n\r\n c = max(c, sum)\r\n\r\nprint(c)", "input(); li = list(map(int, input().split()))\r\ns =set()\r\nans = 0\r\nfor i in li:\r\n if i not in s:s.add(i)\r\n else:\r\n ans = max(ans, len(s))\r\n s.remove(i)\r\nprint(ans)", " \nn = int(input())\r\ntmp = set()\r\nans = 0\r\nx = map(int, input().split(' '))\r\n\r\nfor i in x:\r\n if i in tmp:\r\n tmp.remove(i)\r\n else:\r\n tmp.add(i)\r\n ans = max(ans, len(tmp))\r\n\r\nprint(ans)", "n=int(input())\r\na=list(map(int, input().split()))\r\ntable=[0]*n;m=c=0\r\n\r\nfor i in a:\r\n\tif not table[i-1]:\r\n\t\ttable[i-1]+=1\r\n\t\tc+=1\r\n\telse:\r\n\t\ttable[i-1]-=1\r\n\t\tc-=1\r\n\tif c>=m:\r\n\t\tm=c\r\nprint(m)", "a = set()\r\nn = int(input())\r\nk = list(map(int, input().split()))\r\nres = 0\r\nfor i in range (len(k)):\r\n if (k[i] in a):\r\n a.remove(k[i])\r\n else:\r\n a.add(k[i])\r\n res = max(res, len(a))\r\nprint(res)", "n = input()\nn = [int(s) for s in input().split()]\n\na = set()\nsum = 0\nmax = 0\nfor i in n:\n if i in a:\n a.remove(i)\n sum -= 1\n else:\n a.add(i)\n sum += 1\n if sum > max:\n max = sum\n\nprint(max)", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n on_table = [False] * (2 * n + 1)\r\n\r\n ans = 0\r\n count = 0\r\n for x in a:\r\n if on_table[x]:\r\n on_table[x] = False\r\n count -= 1\r\n else:\r\n on_table[x] = True\r\n count += 1\r\n ans = max(ans, count)\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = input()\r\na = list(map(int, input().split()))\r\ns = set()\r\nk = 0\r\nfor i in a:\r\n if i in s:\r\n s.remove(i)\r\n else:\r\n s.add(i)\r\n if k < len(s):k = len(s)\r\n\r\nprint(k)\r\n", "n=int(input())\r\nli=list(input().split())\r\ngi=[]\r\nki=set()\r\nm=0\r\nfor i in range(len(li)):\r\n if li[i] in ki:\r\n ki.remove(li[i])\r\n else:\r\n ki.add(li[i])\r\n m=max(m,len(ki))\r\nprint(m)", "n=int(input())\r\na=list(map(int,input().split()))\r\nt=set()\r\nm=0\r\nfor i in range(2*n):\r\n\tif a[i] not in t:\r\n\t\tt.add(a[i])\r\n\t\tm=max(m,len(t))\r\n\telse:\r\n\t\tt.remove(a[i])\r\nprint(m)", "n = int(input())\r\narr = list(map(int , input().split()))\r\nres , curr = 0 , 0\r\ns = set()\r\nfor x in arr:\r\n if x not in s : curr += 1\r\n else : curr -= 1\r\n s.add(x)\r\n res = max(res , curr)\r\nprint(res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[0 for i in range(n+1)]\r\nc,k=0,0\r\nfor i in a:\r\n if b[i]: c -= 1\r\n else: c += 1\r\n b[i]=1\r\n k=max(k,c)\r\nprint(k)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nv = [0]*(n+1)\r\nr = 0\r\nm = 0\r\nfor i in l:\r\n if v[i] == 0:\r\n v[i]+=1\r\n r+=1\r\n m = max(m,r)\r\n elif v[i] == 1:\r\n v[i] += 1\r\n r -= 1\r\nprint(m)", "from sys import stdin,stdout,exit\r\ndef listInput():\r\n return list(map(int,stdin.readline().split()))\r\ndef printBS(li):\r\n n=len(li)\r\n for i in range(n-1):\r\n stdout.write(\"%d \"%(li[i]))\r\n if n!=0: stdout.write(\"%d\\n\"%(li[n-1]))\r\ndef sin():\r\n return stdin.readline().rstrip()\r\ndef inp():\r\n return int(stdin.readline())\r\nn=inp()\r\nli=listInput()\r\nmcnt=0\r\ns=set([])\r\nfor i in li:\r\n\tif i in s:\r\n\t\ts.discard(i)\r\n\telse:\r\n\t\ts.add(i)\r\n\tmcnt=max(mcnt,len(s))\r\nprint(mcnt)\r\n", "n=int(input())\nS=input()\na=tuple(map(int, S.split()))\nans=0\nnow=0\nb={}\nfor i in range(2*n):\n if (a[i] in b):\n now-=1\n del b[a[i]]\n else:\n b[a[i]]=1;\n now+=1\n ans=max(ans, now)\nprint(ans)\n\t\t \t\t\t\t\t \t \t\t\t \t\t \t\t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb={}\r\nc=0\r\nx=0\r\nfor i in range(2*n):\r\n if not b.get(a[i]):\r\n b[a[i]]=True\r\n x+=1\r\n else:\r\n b.pop(a[i])\r\n x-=1\r\n if x>c:\r\n c=x\r\nprint(c) \r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\ncount=0\r\nm=0\r\nb=[False for i in range(0,n+1)]\r\nfor i in a:\r\n if(b[i]==False):\r\n b[i]=True\r\n count+=1\r\n else:\r\n b[i]=False\r\n count-=1\r\n if(count>m):\r\n m=count\r\nprint(m)", "from sys import stdin, stdout\r\n\r\ns = set()\r\nn = int(stdin.readline())\r\nvalues = list(map(int, stdin.readline().split()))\r\nans = 0\r\n\r\nfor v in values:\r\n if v in s:\r\n s.discard(v)\r\n else:\r\n s.add(v)\r\n \r\n ans = max(len(s), ans)\r\n\r\nstdout.write(str(ans))", "n, s = int(input()), (int(i) for i in input().split())\nres, t = 0, set()\nfor i in s:\n if i in t:\n t.remove(i)\n else:\n t.add(i)\n res = max(res, len(t))\nprint(res)\n", "n = int(input()) * 2\nlst = [int(x) for x in input().split()][:n]\nt = set()\nmaxi, cnt = 1, 0\nfor i in range(n):\n if lst[i] not in t:\n t.add(lst[i])\n cnt += 1\n else:\n if maxi < cnt: maxi = cnt\n t.remove(lst[i])\n cnt -= 1\nprint(maxi)\n\t\t\t \t\t \t\t \t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\nsocks = list(map(int, input().split()))\r\n\r\nd = {}\r\nmax = 0\r\n\r\nfor x in socks:\r\n if x in d:\r\n if len(d) > max:\r\n max = len(d)\r\n d.pop(x)\r\n else:\r\n d[x] = None\r\n\r\nprint(max)", "import sys\n\npair = int(sys.stdin.readline());\nsocks = sys.stdin.readline().split(\" \");\nsocks = [int(x) for x in socks];\ntable = set();\ncur = 0; big = 0;\nfor sock in socks:\n if sock in table:\n cur-=1;\n else:\n table.add(sock);cur+=1;\n if(cur>big):big = cur;\n\nprint(big)\n \t \t\t\t\t \t \t\t\t \t \t \t \t\t\t \t \t", "n = int(input())\nl = [int(i) for i in input().split()]\nans = 1\ns = set()\nfor x in l:\n s ^= {x}\n if len(s) > ans:\n ans = len(s)\nprint(ans)", "n = int(input())\r\narr = []\r\nfor i in range(0, n):\r\n arr.append(False)\r\na = input().split()\r\nans = 0\r\ncurr = 0\r\nfor i in range(0, 2*n):\r\n if arr[int(a[i])-1] == False:\r\n curr += 1\r\n ans = max(ans, curr)\r\n arr[int(a[i])-1] = True\r\n else:\r\n curr -= 1\r\nprint(ans)\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nt = [0 for i in range(n)]\r\nres = 0\r\ncur = 0\r\nfor i in range(2*n):\r\n id = x[i]-1\r\n if t[id] == 1:\r\n t[id] = 0\r\n cur -= 1\r\n else:\r\n t[id] = 1\r\n cur += 1\r\n res = max(res, cur)\r\nprint(res)", "from sys import stdin\n\nn = int(input())\n\nstacklen = 0\nmaxstack = 0\nstack = set()\n\nfor _ in range(2 * n):\n ch = stdin.read(1)\n num = ''\n while ch not in (' ', '\\n'):\n num += ch\n ch = stdin.read(1)\n num = int(num)\n if num in stack:\n stack.remove(num)\n stacklen -= 1\n else:\n stack.add(num)\n stacklen += 1\n maxstack = max(maxstack, stacklen)\nprint(maxstack)\n \n", "n= int(input())\r\ns = set()\r\n_max = 0\r\nnew_max = 0\r\nfor inp in map(int,input().split()):\r\n if inp in s:\r\n s.remove(inp)\r\n else:\r\n s.add(inp)\r\n\r\n new_max = len(s)\r\n if new_max>_max:\r\n _max = new_max\r\nprint(_max)\r\n'''\r\ninput()\r\na=input().split()\r\nb=set()\r\nans=0\r\nfor x in a:\r\n b^={x}\r\n if len(b)>ans: ans=len(b)\r\nprint(ans)\r\n'''\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\n\r\nres = 0\r\nl = 0\r\np = [0]\r\nfor i in range(1, n+1):\r\n\tp += [0]\r\n\r\nfor i in range(n*2):\r\n\tif p[t[i]] == 0:\r\n\t\tl += 1\r\n\t\tp[t[i]] = 1\r\n\t\tres = max(res, l)\r\n\telse:\r\n\t\tl -= 1\r\nprint(res)", "NumOfSocks = int(input())\r\nSocks = [int(x) for x in input().split()]\r\nOnTable, maxSocks, tmpMaxSocks = [0] * (NumOfSocks+1), 0, 0\r\nfor i in Socks:\r\n if not OnTable[i]: \r\n OnTable[i] = 1\r\n tmpMaxSocks += 1\r\n else:\r\n OnTable[i] = 0\r\n tmpMaxSocks -= 1\r\n if tmpMaxSocks > maxSocks: maxSocks = tmpMaxSocks\r\nprint(maxSocks)", "import math\n\nn = int(input())\ntable = [False for _ in range(n)]\n\n\nmaximum = 0\ncurrent = 0\nsocks = input()\nfor sock in socks.split():\n if table[int(sock)-1]:\n table[int(sock)-1] = False\n current -= 1\n else:\n table[int(sock)-1] = True\n current += 1\n maximum = max(maximum, current)\n\n\nprint(maximum)\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nonta=set([])\r\nl=[]\r\nd=0\r\nfor i in a:\r\n if i not in onta:\r\n onta.add(i)\r\n else:\r\n onta.remove(i)\r\n t=len(onta)\r\n if t>d:\r\n d=t\r\nprint(d)\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nb={}\r\nc=0\r\na=[]\r\nfor i in range(2*n):\r\n\tif x[i] in b:\r\n\t\tc-=1\r\n\telse:\r\n\t\tc+=1\r\n\t\tb[x[i]]=1\t\r\n\ta.append(c)\r\nprint(max(a))", "\r\nn = int(input())\r\nm = 0\r\nnow = 0\r\ntable = [False]*(100100)\r\narr = list(map(int,input().split()))\r\nfor i in arr:\r\n if table[i]:\r\n now-=1\r\n else:\r\n table[i] = True\r\n now+=1\r\n m = max(now,m)\r\nprint(m)", "n=int(input())\narr=[0 for i in range(n)]\nip=list(map(int,input().split()))\nm=0\ncount=0\nfor i in ip:\n if arr[i-1]==0:\n count+=1\n if count>m:\n m=count\n arr[i-1]=1\n else:\n arr[i-1]=0\n count-=1\nprint(m)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmyset = set()\r\nans = 1\r\nfor x in a:\r\n if x not in myset:\r\n myset.add(x)\r\n ans = max(ans, len(myset))\r\n else:\r\n myset.remove(x)\r\nprint(ans)", "n = int(input())\r\nss = map(int, input().split())\r\nt = set()\r\nm = 0\r\nfor s in ss:\r\n if s in t:\r\n t.remove(s)\r\n else:\r\n t.add(s)\r\n m = max(m, len(t))\r\nprint(m)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nt=0\r\nans=0\r\nc=set()\r\nfor x in a:\r\n if x not in c:\r\n c.add(x)\r\n t+=1\r\n if ans<=t:\r\n ans=t\r\n else:\r\n t-=1\r\nprint(ans)\r\n", "#!/bin/python3\n\nn = int(input())\nx = list(map(int, input().split()))\nans, cnt, used = 0, 0, [False] * (n + 1)\nfor v in x:\n if used[v]:\n cnt -= 1\n else:\n cnt += 1\n used[v] = True\n ans = max(ans, cnt)\nprint(ans)\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nwas = [0] * (n + 1)\r\nbal = ans = 0\r\nfor i in a:\r\n if was[i]:\r\n bal -= 1\r\n else:\r\n bal += 1\r\n was[i] = 1\r\n ans = max(ans, bal)\r\nprint(ans)", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\non_table_last_sock = array[0]\r\non_table_last_socks_set = {array[0]}\r\nmax_socks = 1\r\nsocks_on_table = 1\r\n\r\nfor i in range(1, len(array)):\r\n current_sock_taken_from_bag = array[i]\r\n\r\n if current_sock_taken_from_bag == on_table_last_sock or current_sock_taken_from_bag in on_table_last_socks_set:\r\n socks_on_table =socks_on_table-1\r\n else:\r\n socks_on_table = socks_on_table+1\r\n if socks_on_table > max_socks:\r\n max_socks = socks_on_table\r\n on_table_last_socks_set.add(array[i])\r\n\r\n on_table_last_sock = array[i]\r\n\r\nprint(max_socks)\r\n", "a=int(input())\r\nb=list(map(int, input().split()))\r\ncnt=0\r\nx=set()\r\ny=[]\r\nfor i in b:\r\n x^={i}\r\n if len(x)>cnt:\r\n cnt=len(x)\r\nprint(cnt)", "n=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\nz=0\r\nv=[0]*100001\r\nfor i in b:\r\n v[i]+=1\r\n if v[i]!=2:\r\n c+=1\r\n z=max(z,c)\r\n elif v[i]==2:\r\n c-=1\r\nprint(z)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = set()\r\nc = 0\r\nres = []\r\nfor i in range(2 * n):\r\n a.add(l[i])\r\n if c < len(a):\r\n c+=1\r\n else:\r\n a.discard(l[i])\r\n res.append(c)\r\n c = len(a)\r\nprint(max(res))\r\n", "class data: \r\n def __init__(self,data):\r\n self.data = data\r\n def solve(self):\r\n dict_1 ={}\r\n count = solution = 0\r\n for i in self.data:\r\n if i in dict_1:\r\n count = count-1\r\n else:\r\n dict_1[i]=1\r\n count = count+1\r\n \r\n solution = max(solution,count)\r\n return solution\r\n \r\nsocks_pair = int(input())\r\norder = list(map(int,input().strip().split())) \r\nif 2*socks_pair == len(order):\r\n sol = data(order)\r\n print(sol.solve()) ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0 for _ in range(n)]\r\ncount = 0\r\nMax = 0\r\nfor i in range(2*n):\r\n b[a[i]-1] += 1\r\n if b[a[i]-1] == 2:\r\n count -= 1\r\n elif b[a[i]-1] == 1:\r\n count += 1\r\n Max = max(Max, count)\r\nprint(Max)", "\r\nn = int(input())\r\nx = map(int, input().split())\r\nMax = 0\r\ntmp = set()\r\ncounter = 0\r\nfor i in x:\r\n if i in tmp:\r\n counter -= 1\r\n else:\r\n counter += 1\r\n tmp.add(i)\r\n if Max < counter:\r\n Max = counter\r\nprint(Max)\r\n# CodeForcesian\r\n# ♥\r\n# تا خدا بنده نواز است \r\n\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = [0] * (n + 1)\r\nk, mx = 0, 0\r\nfor x in A:\r\n if B[x] == 0:\r\n k += 1\r\n B[x] = 1\r\n else:\r\n k -= 1\r\n mx = max(mx, k)\r\nprint(mx)\r\n", "input = __import__('sys').stdin.readline\r\nMIS = lambda: map(int,input().split())\r\n\r\nn = int(input())\r\ntable = set()\r\nans = 0\r\nfor x in MIS():\r\n if x in table: table.remove(x)\r\n else: table.add(x)\r\n ans = max(ans, len(table))\r\nprint(ans)", "n=int(input())\nl=list(map(int,input().split()))\nans=1\ns=set()\nfor x in l:\n s^={x}\n if len(s)>ans: ans=len(s)\nprint(ans)\n\n\n\n\n# Made By Mostafa_Khaled", "n=int(input())\r\nl=list(map(int,input().split()))\r\n'''x,y=[],[]\r\nfor i in range(len(l)):\r\n if l[i] not in x:\r\n x.append(l[i])\r\n y.append(len(x))\r\n else:\r\n del(x[x.index(l[i])])\r\nprint(max(y))\r\n'''\r\nk=0\r\nmx=0\r\nm=[0]*(n+1)\r\nfor i in l:\r\n if m[i]>0:\r\n k-=1\r\n m[i]-=1\r\n else:\r\n m[i]+=1\r\n k+=1\r\n mx=max(k,mx)\r\nprint(mx)", "input()\r\na=input().split()\r\nb,ans,k=set(),0,0\r\nfor x in a:\r\n b^={x}\r\n if len(b)>ans: ans=len(b)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nt = 0\r\nd = {}\r\nfor i in range(2 * n):\r\n if a[i] not in d:\r\n d[a[i]] = 1\r\n t += 1\r\n ans = max(ans, t)\r\n else:\r\n d.pop(a[i])\r\n t -= 1\r\nprint(ans)\r\n", "input()\r\n\r\nan=0\r\nA=list(map(int,input().split()))\r\nv=set()\r\nfor a in A:\r\n if a in v:\r\n v.remove(a)\r\n else:\r\n v.add(a)\r\n an=max(an,len(v))\r\nprint(an)", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = 0\r\nd = {}\r\nfor i in range(2*n):\r\n\tif a[i] in d:\r\n\t\tdel d[a[i]]\r\n\telse:\r\n\t\td[a[i]] = 1\r\n\tm=max(m,len(d))\r\nprint(m)", "# https://codeforces.com/problemset/problem/780/A\r\n\r\nn = input()\r\n\r\ns = set()\r\nans = 0\r\n\r\n\r\nfor i in input().split():\r\n if i not in s:\r\n s.add(i)\r\n ans = max(ans, len(s))\r\n else:\r\n s.discard(i)\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=set()\r\nm=set()\r\notvet=0\r\nfor i in range(2*n):\r\n if a[i] in (s):\r\n otvet-=1\r\n else:\r\n otvet+=1\r\n s.add(a[i])\r\n m.add(otvet)\r\nprint(max(m))\r\n \r\n", "if __name__ == \"__main__\":\r\n s = set()\r\n res = 0\r\n n = int(input())\r\n aa = list(map(int, input().split()))\r\n for a in aa:\r\n if a in s:\r\n s.remove(a)\r\n else:\r\n s.add(a)\r\n res = max(res, len(s))\r\n\r\n print(res)\r\n", "input()\r\nX = list(map(int, input().split()))\r\nY = [False for i in range(len(X))]\r\nMax = 0\r\nN = 0\r\nfor i in X:\r\n if Y[i - 1]:\r\n N -= 1\r\n else:\r\n Y[i - 1] = True\r\n N += 1\r\n Max = max(N, Max)\r\nprint(Max)\r\n", "input()\r\nx = list(map(int, input().split()))\r\ns = set([])\r\n\r\nans = 0\r\ncur = 0\r\nfor i in x:\r\n\tif i in s:\r\n\t\ts.remove(i)\r\n\t\tcur -= 1\r\n\telse:\r\n\t\ts.add(i)\r\n\t\tcur += 1\r\n\t\tans = max(ans, cur)\r\n\r\nprint(ans)", "cnt=[0]*100001\r\nn=int(input())\r\nans,curr=0,0\r\nfor i in list(map(int,input().split())):\r\n if cnt[i]==0:\r\n cnt[i]=1\r\n curr+=1\r\n else:\r\n cnt[i]=1\r\n curr-=1\r\n ans=max(ans,curr)\r\nprint(ans)", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\n\r\nwyn = 0\r\nl = 0\r\np = [0]\r\nfor i in range(1, n+1):\r\n p += [0]\r\n\r\nfor i in range(2*n):\r\n if p[t[i]] == 0:\r\n l += 1\r\n p[t[i]] = 1\r\n wyn = max(wyn,l)\r\n elif p[t[i]] == 1:\r\n l -= 1\r\nprint(wyn)", "n = int(input())\r\nsocks = [int(i) for i in input().split()]\r\nMAX_k = 0\r\nnow_k = 0\r\non_table = {}\r\nfor i in range(n*2):\r\n if socks[i] not in on_table:\r\n on_table[socks[i]] = 1\r\n now_k += 1\r\n else:\r\n if MAX_k < now_k:\r\n MAX_k = now_k\r\n now_k -= 1\r\n del on_table[socks[i]]\r\nprint(MAX_k)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\nm = 0\r\nls = 0\r\nfor i in l:\r\n if i in d:\r\n d.pop(i)\r\n else:\r\n d[i]=1\r\n m=max(m,len(d))\r\n\r\nprint(m)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nbalance = 0\r\nmax_balance = 0\r\ntaken = [False] * (n + 1)\r\n\r\nfor e in a:\r\n if taken[e]:\r\n taken[e] = False\r\n balance -= 1\r\n else:\r\n taken[e] = True\r\n balance += 1\r\n max_balance = max(max_balance, balance)\r\n\r\nprint(max_balance)\r\n", "n = int(input())\r\nl=set()\r\nr=0\r\nfor i in map(int, input().split()):\r\n\tif i not in l:\r\n\t\tl.add(i)\r\n\t\tr= max(r,len(l))\r\n\telse:\r\n\t\tl.remove(i)\r\nprint(r)", "n=int(input())\na=list(map(int,input().split()))\nd={}\nfor i in range(1,n+1):\n\td[i]=0\nans=0\nmax=0\nfor i in a:\n\tif d[i]==0:\n\t\td[i]+=1\n\t\tans+=1\n\telse:\n\t\td[i]-=1\n\t\tans-=1\n\tif ans>max:\n\t\tmax=ans\nprint(max)", "n = int(input())\r\nlist_order = []\r\nlist_order = map(int, input().split(\" \"))\r\nmax_ = 0\r\ncounter = 0\r\ndict_count = {}\r\nfor nn in range(n):\r\n dict_count[nn+1] = 0\r\n#print(dict_count)\r\nfor k in list_order:\r\n if dict_count[k] == 0:\r\n dict_count[k] = 1\r\n counter = counter + 1\r\n if(max_<counter):\r\n max_ = counter\r\n elif dict_count[k] == 1:\r\n dict_count[k] = 2\r\n counter = counter - 1\r\n\r\nprint(max_)\r\n ", "def main_function():\r\n n = int(input())\r\n socks = [int(i) for i in input().split(\" \")]\r\n d = [0 for i in range(n + 2)]\r\n sum = 0\r\n current_max = 0\r\n for i in socks:\r\n if d[i] == 0:\r\n d[i] = 1\r\n sum += 1\r\n else:\r\n d[i] = 0\r\n sum -= 1\r\n if sum > current_max:\r\n current_max = sum\r\n return current_max\r\n\r\n\r\n\r\nprint(main_function())", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = set()\r\nc = 0\r\nfor i in l:\r\n if i in s:\r\n s.remove(i)\r\n else:\r\n s.add(i)\r\n if len(s) > c:\r\n c = len(s)\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = set()\r\nans = 0\r\nfor i in a:\r\n if i in b: b.discard(i)\r\n else:b.add(i)\r\n ans = max(ans,len(b))\r\nprint(ans)", "def main():\r\n n = input()\r\n vals = [int(v) for v in input().split()]\r\n tables = set()\r\n m = 0\r\n for v in vals:\r\n if v in tables:\r\n m = max(m, len(tables))\r\n tables.remove(v)\r\n else:\r\n tables.add(v)\r\n m = max(m, len(tables))\r\n\r\n print(m)\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nll=set()\r\nfor i in l:\r\n if(i in ll):\r\n ll.remove(i)\r\n else:\r\n ll.add(i)\r\n c=max(c,len(ll))\r\nprint(c)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nchk = [False] * (n + 1)\r\ndata = list(map(int, input().split()))\r\n\r\nmv = -1\r\ncnt = 0\r\nfor i in data:\r\n if chk[i]:\r\n cnt -= 1\r\n else:\r\n cnt += 1\r\n chk[i] = True\r\n mv = max(cnt, mv)\r\n\r\nprint(mv)", "x = int(input())\r\nl = set()\r\nr = 0\r\nfor i in map(int, input().split()):\r\n if i not in l:\r\n l.add(i)\r\n r = max(r, len(l))\r\n else:\r\n l.remove(i)\r\nprint(r)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncount, maxi = 0, 0\r\nvis = [False]*(n+1)\r\nfor i in range(2*n):\r\n\tif vis[arr[i]]:\r\n\t\tcount -= 1\r\n\telse:\r\n\t\tvis[arr[i]] = True\r\n\t\tcount += 1\r\n\tmaxi = max(count, maxi)\r\nprint(maxi)\r\n", "n = int(input())\r\nsocks = [int(x) for x in input().split()]\r\nstack = []\r\nres = 0\r\ncurrent = 0\r\nfor i in range (n + 1):\r\n stack.append(0)\r\nfor i in range (2 * n):\r\n if stack[socks[i]] == 0:\r\n stack[socks[i]] = 1\r\n current += 1\r\n elif stack[socks[i]] == 1:\r\n stack[socks[i]] = 2\r\n current -= 1\r\n res = max(res, current)\r\nprint(res)", "\r\ns=set()\r\nn=int(input())\r\nans,curr=0,0\r\narr1=list(map(int,input().split()))\r\nfor i in range(len(arr1)):\r\n if arr1[i] in s:\r\n s.discard(arr1[i])\r\n curr-=1\r\n else:\r\n s.add(arr1[i])\r\n curr+=1\r\n ans=max(ans,curr) \r\nprint(ans)\r\n", "n = int(input())\r\nsocks = [int(x) for x in input().split()]\r\n\r\non = set()\r\nm = 0\r\ni = 0\r\nfor s in socks:\r\n if s in on:\r\n m = max(m, i)\r\n i -= 1\r\n else:\r\n on.add(s)\r\n i += 1\r\nprint(max(m, i))\r\n \r\n", "n = int(input())\narr = list(map(int,input().split()))\nmax=0\nnum=0\ndic={}\nfor i in range(2*n):\n if arr[i] in dic:\n num-=1\n else:\n dic[arr[i]]=arr[i]\n num+=1\n if max<num:\n max=num\nprint(max) \n", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\na = [0] * n\r\ncur = 0\r\nres = 0\r\nfor y in x:\r\n m = y - 1\r\n if a[m]:\r\n a[m] = 0\r\n cur -= 1\r\n else:\r\n a[m] = 1\r\n cur += 1\r\n res = max(res, cur)\r\n\r\nprint(res)\r\n", "import math\r\n\"\"\"def maxOccurences(numbers):\r\n i=1\r\n alice = 1\r\n bob = 0\r\n while i<len(numbers)-1:\r\n \r\n if numbers[i] == numbers[i-1] and alice == 1:\r\n numbers.pop(i-1)\r\n numbers.pop(i)\r\n bob = 1\r\n alice =0\r\n\r\n elif numbers[i] == numbers[i-1] and bob == 1:\r\n numbers.pop(i-1)\r\n number.pop(i)\r\n bob = 0\r\n alice=1\r\n \r\n i+=1\r\n \r\n if bob==0:\r\n print(\"Bob\")\r\n else:\r\n print(\"Alice\")\r\na = maxOccurences([1,3,3,1,5])\r\nprint(a)\"\"\"\r\n\"\"\"n = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nmyMap = dict()\r\nfor i in range(len(x)):\r\n if myMap.get(x[i])== None:\r\n myMap[x[i]]=1\r\nfor i in range(len(y)):\r\n if myMap.get(y[i]) == None:\r\n myMap[y[i]]=1\r\nprint(myMap)\r\nif len(myMap)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n a,b,k = map(int,input().split())\r\n aFactor = math.ceil(k/2)\r\n bFactor = math.floor(k/2)\r\n pos = a*aFactor - b*bFactor\r\n print(pos)\r\n testcases-=1\"\"\"\r\n\"\"\"n = int(input())\r\nif n==1:\r\n print(-1)\r\nelse:\r\n i=1\r\n while i<=n:\r\n print(str(i+1)+ \" \" + str(i), end=\" \")\r\n i+=2\"\"\"\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n n = int(input())\r\n myArray = list(map(int,input().split()))\r\n myMap = dict()\r\n for i in range(len(myArray)):\r\n if myMap.get(myArray[i]) == None:\r\n myMap[myArray[i]]=1\r\n else:\r\n myMap[myArray[i]]+=1\r\n if len(myMap)==1:\r\n print(n)\r\n elif len(myMap)==n:\r\n print(1)\r\n else:\r\n a = max(myMap, key=myMap.get)\r\n print(myMap[a])\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n myString = input()\r\n myMap = dict()\r\n for i in range(len(myString)):\r\n if myString[i]==\"1\":\r\n if myMap.get(myString[i])== None:\r\n myMap[myString[i]]=1\r\n else:\r\n myMap[myString[i]]+=1\r\n flag=0\r\n i=0\r\n zeroCount=0\r\n oneCount=0\r\n while i<len(myString):\r\n if myString[i]==\"1\":\r\n if flag!=1:\r\n flag=1\r\n while i<len(myString) and myString[i]==\"1\":\r\n oneCount+=1\r\n i+=1\r\n if flag==1:\r\n if oneCount == myMap[\"1\"]:\r\n break\r\n else:\r\n zeroCount+=1\r\n i+=1\r\n print(zeroCount)\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n n,m = map(int,input().split())\r\n myArray=[]\r\n for i in range(n):\r\n myString = input()\r\n myArray.append(myString)\r\n i=0\r\n j=m-1\r\n count=0\r\n while i<n-1:\r\n if myArray[i][j]==\"R\":\r\n count+=1\r\n i+=1\r\n i=n-1\r\n j=0\r\n while j<m-1:\r\n if myArray[i][j]==\"D\":\r\n count+=1\r\n j+=1\r\n print(count)\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n x,y = map(int,input().split())\r\n myString = input()\r\n myMap=dict()\r\n flag1=0\r\n flag2=0\r\n for i in range(len(myString)):\r\n if myMap.get(myString[i])==None:\r\n myMap[myString[i]]=1\r\n else:\r\n myMap[myString[i]]+=1\r\n if x>0:\r\n if myMap.get('R')!=None:\r\n if myMap['R']>=x:\r\n flag1=1\r\n elif x<0:\r\n if myMap.get('L')!=None:\r\n if myMap['L']>=abs(x):\r\n flag1=1\r\n else:\r\n flag1=1\r\n if y>0:\r\n if myMap.get('U')!=None:\r\n if myMap['U']>=y:\r\n flag2=1\r\n elif y<0:\r\n if myMap.get('D')!=None:\r\n if myMap['D']>=abs(y):\r\n flag2=1\r\n else:\r\n flag2=1\r\n if flag1 and flag2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"length = int(input())\r\nmyString = input()\r\n\r\nfinalString = \"\"\r\ni=0\r\nj=1\r\nwhile i<len(myString):\r\n finalString+=myString[i]\r\n i = i + j\r\n j = j + 1\r\nprint(finalString)\"\"\"\r\n\r\n\"\"\"a = int(input())\r\nb= a\r\nwhile True:\r\n c = b\r\n c = str(c)\r\n total= 0\r\n for i in range(len(c)):\r\n total += int(c[i])\r\n if total%4==0:\r\n print(b)\r\n break\r\n else:\r\n b+=1\"\"\"\r\n\"\"\"n=int(input())\r\nmyArray = list(map(int,input().split()))\r\nmyMap=dict()\r\nfor i in range(len(myArray)):\r\n if myMap.get(myArray[i])==None:\r\n myMap[myArray[i]]=1\r\n else:\r\n myMap[myArray[i]]+=1\r\na = max(myMap , key=myMap.get)\r\nprint(myMap[a])\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n cost = 0\r\n n , c0 , c1 , h = map(int,input().split())\r\n myString = input()\r\n myMap= dict()\r\n for i in range(len(myString)):\r\n if myMap.get(myString[i])==None:\r\n myMap[myString[i]] = 1\r\n else:\r\n myMap[myString[i]] += 1\r\n if myMap.get('0')!=None and myMap.get('1') !=None:\r\n if c0*myMap['0'] < c1*myMap['1']:\r\n if h+c0 < c1:\r\n cost = c0*myMap['0'] + h*myMap['1'] + c0*myMap['1']\r\n else:\r\n cost = c0*myMap['0'] + c1*myMap['1']\r\n elif c0*myMap['0'] > c1*myMap['1']:\r\n if h+c1 < c0:\r\n cost = c1*myMap['1'] + h*myMap['0'] + c1*myMap['0']\r\n else:\r\n cost = c0*myMap['0'] + c1*myMap['1']\r\n else:\r\n cost = c0*myMap['0'] + c1*myMap['1']\r\n elif myMap.get('0') == None and myMap['1']!=None:\r\n if c0+h < c1:\r\n cost = c0*myMap['1'] + myMap['1']*h\r\n else:\r\n cost = c1*myMap['1']\r\n elif myMap.get('1')==None and myMap['0']!=None:\r\n if c1+h < c0:\r\n cost = h*myMap['0'] + c1*myMap['0']\r\n else:\r\n cost = c0*myMap['0']\r\n print(cost)\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"n,k = map(int,input().split())\r\nmyArray = list(map(int, input().split()))\r\nmaxNo = -1\r\ncount=0\r\nfor i in range(len(myArray)):\r\n maxNo = max(maxNo , myArray[i])\r\nif maxNo <= k:\r\n print(len(myArray))\r\nelse:\r\n i=0\r\n j=len(myArray)-1\r\n while i<=j:\r\n if myArray[i] <= k:\r\n i+=1\r\n count+=1\r\n elif myArray[j] <= k:\r\n j-=1\r\n count+=1\r\n else:\r\n break\r\n print(count)\"\"\"\r\n\r\n\"\"\"n = int(input())\r\nmyMap = dict()\r\nmyArray = list(map(int,input().split()))\r\nfor i in range(len(myArray)):\r\n if myMap.get(myArray[i])==None:\r\n myMap[myArray[i]]=1\r\n else:\r\n myMap[myArray[i]]+=1\r\ni=0\r\nwhile i<len(myArray):\r\n if myMap[myArray[i]] > 1:\r\n myMap[myArray[i]]-=1\r\n myArray.pop(i)\r\n else:\r\n i+=1\r\nprint(len(myArray))\r\nfor i in range(len(myArray)):\r\n print(myArray[i], end=\" \")\"\"\"\r\n\r\n\"\"\"sticks, k = map(int,input().split())\r\na = int(sticks/k)\r\n\r\nif a%2==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n n,m = map(int,input().split())\r\n myArray = list(map(int,input().split()))\r\n total = 0\r\n flag=0\r\n for i in range(1,len(myArray)):\r\n total+=myArray[i]\r\n if total > m-myArray[0]:\r\n print(m)\r\n else:\r\n print(total+myArray[0])\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases>0:\r\n n = int(input())\r\n myString = input()\r\n length = 0\r\n i=len(myString)-1\r\n while i>=0:\r\n if myString[i]==\")\":\r\n length+=1\r\n i-=1\r\n else:\r\n break\r\n d = n-length\r\n if d>=length:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n n,k = map(int,input().split())\r\n myArray = list(map(int,input().split()))\r\n maxElement = max(myArray)\r\n myList1=[]\r\n myList2=[]\r\n \r\n for i in range(len(myArray)):\r\n myArray[i]=maxElement-myArray[i]\r\n myList1.append(myArray[i])\r\n maxElement = max(myArray)\r\n for i in range(len(myArray)):\r\n myArray[i] = maxElement - myArray[i]\r\n myList2.append(myArray[i])\r\n if k%2!=0:\r\n for i in range(len(myList1)):\r\n if i!=len(myList1)-1:\r\n print(myList1[i],end=\" \")\r\n else:\r\n print(myList1[i])\r\n else:\r\n for i in range(len(myList2)):\r\n if i!=len(myList2)-1:\r\n print(myList2[i], end=\" \")\r\n else:\r\n print(myList2[i])\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"x,y,z = map(int,input().split())\r\nmyArray = list(map(int,input().split()))\r\n\r\nif myArray[0] < x:\r\n print(\"NO\")\r\nelse:\r\n flag=0\r\n myArray[0]-=x\r\n total2=0\r\n total2 = myArray[0]+myArray[1]\r\n if total2 >=y:\r\n total2-=y\r\n if total2+myArray[2]>=z:\r\n flag=1\r\n else:\r\n flag=0\r\n else:\r\n flag=0\r\n if flag==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\"\"\"\r\n\"\"\"testcases = int(input())\r\nwhile testcases>0:\r\n minValue= 10000000000\r\n n,m = map(int,input().split())\r\n if n>m:\r\n i=1\r\n while i<=n:\r\n minValue = min(minValue, (n^i)+(m^i))\r\n i+=1\r\n elif n<=m:\r\n i=1\r\n while i<=m:\r\n minValue = min(minValue, (n^i)+(m^i))\r\n i+=1\r\n print(minValue)\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n myString1 = input()\r\n myString2 = input()\r\n myString3 = input()\r\n flag=0\r\n for i in range(len(myString1)):\r\n if myString3[i]!=myString2[i] and myString3[i]!=myString1[i]:\r\n flag=1\r\n break\r\n if flag==1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n testcases-=1\"\"\"\r\n\r\n\"\"\"s, v1, v2, t1, t2 = map(int,input().split())\r\nif t2*2 + v2*s < t1*2 +v1*s:\r\n print(\"Second\")\r\nelif t2*2 + v2*s > t1*2 +v1*s:\r\n print(\"First\")\r\nelse:\r\n print(\"Friendship\")\"\"\"\r\n\r\n\"\"\"testcases = int(input())\r\nwhile testcases > 0:\r\n n=int(input())\r\n if n==1:\r\n print(0)\r\n else:\r\n moves=0\r\n flag=0\r\n while n!=1:\r\n a=n\r\n b=n\r\n c=n\r\n if n%2!=0 and n%3!=0 and n%5!=0:\r\n flag=1\r\n break\r\n else:\r\n if n%2==0:\r\n a=a/2\r\n if n%3==0:\r\n b = (b*2)/3\r\n if n%5==0:\r\n c=(4*n)/5\r\n n = min(min(a,b),c)\r\n moves+=1\r\n if flag==1:\r\n print(-1)\r\n else:\r\n print(moves)\r\n testcases-=1\r\n myString.upper()\r\n myString.isupper()\"\"\"\r\n\r\n\"\"\"myString1= input()\r\nmyString2 = input()\r\nmyText = input()\r\nmyText = list(myText)\r\nnewText = \"\"\r\nmyMap = dict()\r\nfor i in range(len(myString1)):\r\n myMap[myString1[i]]=i\r\n\r\nfor i in range(len(myText)):\r\n if myText[i]==\"0\" or myText[i]==\"1\" or myText[i]==\"2\" or myText[i]==\"3\" or myText[i]==\"4\" or myText[i]==\"5\" or myText[i]==\"6\" or myText[i]==\"7\" or myText[i]==\"8\" or myText[i]==\"9\":\r\n newText += myText[i] \r\n else:\r\n if myText[i].isupper() == True:\r\n myText[i]=myText[i].lower()\r\n newText += myString2[myMap[myText[i]]].upper()\r\n else:\r\n newText += myString2[myMap[myText[i]]]\r\nprint(newText)\"\"\"\r\n\r\n\"\"\"l,r,d = map(int,input().split())\r\nteamSize = 0\r\nif l<r:\r\n if l+d==r:\r\n teamSize = l+r+d\r\n elif l+d < r:\r\n teamSize = 2*(l+d)\r\n else:\r\n diff = r-l\r\n l+=diff\r\n d-=diff\r\n teamSize = l+r+2*int(d/2)\r\nelif r<l:\r\n if r+d==l:\r\n teamSize = l+r+d\r\n elif r+d < l:\r\n teamSize = 2*(r+d)\r\n else:\r\n diff = l-r\r\n r+=diff\r\n d-=diff\r\n teamSize = l+r+2*int(d/2)\r\nelse:\r\n teamSize = l+r+2*int(d/2)\r\nprint(teamSize)\"\"\"\r\n\r\n\"\"\"n = int(input())\r\nmyArray = list(map(int,input().split()))\r\nmyMap = dict()\r\nfor i in range(len(myArray)):\r\n myMap[myArray[i]]=i\r\n\r\nmaxElement = max(myArray)\r\nminElement = min(myArray)\r\n\r\nif myArray[0]==maxElement and myArray[n-1]==minElement or myArray[0]==minElement or myArray[n-1]==maxElement:\r\n print(n-1)\r\nelse:\r\n if myMap[maxElement] < myMap[minElement]:\r\n dist = max(abs(0-myMap[minElement]),abs(n-1-myMap[maxElement]))\r\n else:\r\n\r\n dist = max(abs(0-myMap[maxElement]), abs(n-1-myMap[minElement]))\r\n print(dist)\"\"\"\r\n\r\nn = int(input())\r\nmyArray = list(map(int,input().split()))\r\nmyMap = dict()\r\nmyMap[myArray[0]]=1\r\nlength = 1\r\nfor i in range(1,len(myArray)):\r\n if myMap.get(myArray[i])==None:\r\n myMap[myArray[i]]=1\r\n length = max(length , len(myMap))\r\n else:\r\n del myMap[myArray[i]]\r\nprint(length)\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "import sys\r\n# import dict\r\nimport re, array\r\ninput = lambda:sys.stdin.readline()\r\nimport functools\r\[email protected]_cache(maxsize = 10000000)\r\n\r\ndef Main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n\r\n ans , cnt, used = 0,0,[False]*(n + 1)\r\n \r\n for v in arr:\r\n if used[v]:\r\n cnt -= 1\r\n else:\r\n cnt += 1\r\n used[v] = True\r\n \r\n ans = max(ans, cnt)\r\n \r\n print(ans)\r\n \r\n \r\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 = int(input())\r\nx = list(map(int, input().split()))\r\nnow = [0] * (n + 1)\r\nans = 0\r\nc = 0\r\nfor i in x:\r\n c += 1 if not now[i] else -1\r\n ans = max(ans, c)\r\n now[i] ^= 1\r\nprint(ans)" ]

[ "d=dict()\r\ns=input()\r\nfor i in set(s):\r\n a=s.index(i)\r\n d[i]=[a+1,a]\r\np=0\r\nfor j in range(len(s)):\r\n i=s[j]\r\n d[i][0]=max(d[i][0],j-d[i][1])\r\n d[i][1]=j\r\nans=len(s)\r\nk=len(s)\r\nfor i in d.values():\r\n if i[0]!=0:\r\n ans=min(ans,max(i[0],k-i[1]))\r\nprint(ans)", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\ndef char_index(c):\n return ord(c) - 97\n\ns = input().rstrip()\nn = len(s)\n\nseen = [0] * 26\nlast_index = [-1] * 26\nmax_gap = [-1] * 26\n\nfor i, char in enumerate(s):\n index = char_index(char)\n seen[index] = 1\n max_gap[index] = max(max_gap[index], i-last_index[index])\n last_index[index] = i\n\nbest = float(\"inf\")\nfor i in range(26):\n if seen[i]:\n max_gap[i] = max(max_gap[i], n-last_index[i])\n if max_gap[i] < best:\n best = max_gap[i]\n\nprint(best)\n\n \n\n", "s = input()\r\nchars = list(set(s))\r\nprint(min(max(map(len, s.split(c))) + 1 for c in chars))\r\n", "inp = input()\r\nplaces = {}\r\nfor ind, l in enumerate(inp):\r\n if l not in places:\r\n places[l] = [-1]\r\n places[l].append(ind)\r\nfor l in places:\r\n places[l].append(len(inp))\r\nprint(min(\r\n max([j-i for i, j in zip(places[l][:-1], places[l][1:])])\r\n for l in places\r\n))", "word = input()\n\nans = []\n\nfor c in set(list(word)):\n maior_dist = 0\n atual_dist = 0\n last_pos = 0\n for i, let in enumerate(word):\n if let == c:\n atual_dist += 1\n if atual_dist > maior_dist: maior_dist = atual_dist\n atual_dist = 0\n last_pos = i\n else:\n atual_dist += 1\n if atual_dist > maior_dist: maior_dist = atual_dist\n\n ans.append(max(maior_dist, len(word) - last_pos))\n\nprint(min(ans))\n", "s = input()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nmaxval = max(d, key=d.get)\r\nmax_occur = d[maxval]\r\nif max_occur==1:\r\n if len(s)%2==0:\r\n print(len(s)//2 + 1)\r\n else:\r\n print((len(s)+1)//2)\r\nelse:\r\n k_dom = []\r\n for i in d.keys():\r\n if d[i] > 1:\r\n k_dom.append(i)\r\n best = len(s)+1\r\n for i in k_dom:\r\n ans = 0\r\n prev = -1\r\n for j in range(len(s)):\r\n if s[j] == i:\r\n check = j-prev\r\n prev = j\r\n if check > ans:\r\n ans = check\r\n if len(s)-prev > ans:\r\n ans = len(s)-prev\r\n if ans < best:\r\n best = ans\r\n if len(s)%2==0:\r\n if best > (len(s)//2+1):\r\n best = (len(s)//2+1)\r\n else:\r\n if best > (len(s)+1)//2:\r\n best = (len(s)+1)//2\r\n print(best)", "import math\r\ns = input()\r\nans = math.inf\r\nfor i in set(s):\r\n ans = min(ans , max(map(len, s.split(i))) +1)\r\nprint(ans)", "import math\r\nimport heapq\r\nfrom collections import defaultdict, deque\r\nfrom decimal import *\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\n'''C K-dominant Character'''\r\ns=input()\r\na=[[] for i in range(26)]\r\nn=len(s)\r\nfor i in range(n):\r\n a[ord(s[i])-97].append(i)\r\n\r\nres=math.inf\r\nfor k in range(26):\r\n b=a[k]\r\n temp=-math.inf\r\n nb=len(b)\r\n if nb==0:\r\n continue\r\n if nb==1:\r\n temp=max(b[0]+1,n-b[0])\r\n else:\r\n for i,j in enumerate(b):\r\n if i==0:\r\n temp=max(temp,b[i]+1)\r\n temp=max(temp,b[i+1]-b[i])\r\n elif i==nb-1:\r\n temp=max(temp,b[i]-b[i-1])\r\n temp=max(temp,n-b[i])\r\n else:\r\n temp=max(temp,b[i]-b[i-1])\r\n temp=max(temp,b[i+1]-b[i])\r\n res=min(res,temp)\r\nprint(res)\r\n", "from collections import defaultdict\r\ns = input() \r\nn = len(s) \r\nd = defaultdict(list) \r\nfor i in range(n): d[s[i]].append(i)\r\nans = 10000000000000\r\nfor i in d : \r\n a = 0\r\n for j in range(len(d[i])): \r\n if j == 0 : a = max(a, d[i][j]+1) \r\n else : a = max(a, d[i][j]-d[i][j-1]) \r\n a = max(a, (n-1)-d[i][j]+1) \r\n ans = min(ans, a)\r\nprint(ans)", "s=input()\r\nst=[-1 for i in range(26)]\r\ngap=[0 for i in range(26)]\r\nn=len(s)\r\nfor i in range(n):\r\n r=i-st[ord(s[i])-97]\r\n gap[ord(s[i])-97] =max(gap[ord(s[i])-97],r)\r\n st[ord(s[i])-97]=i\r\nans=n\r\nt=0\r\nfor i in gap:\r\n i=max(i,n-st[t])\r\n if i!=0:\r\n ans=min(ans,i)\r\n t+=1\r\nprint(ans)", "import string\r\nn = input()\r\nl = len(n)\r\ndist = {x:0 for x in string.ascii_lowercase}\r\nlast = {x:-1 for x in string.ascii_lowercase}\r\nfor i in range(l):\r\n dist[n[i]] = max(dist[n[i]], i - last[n[i]])\r\n last[n[i]] = i\r\nfor i in dist.keys():\r\n dist[i] = max(dist[i], l - last[i])\r\nprint(min(dist.values()))", "s = input()\r\nm = [[-1] for i in range(26)]\r\nfor i in range(len(s)):\r\n\tm[ord(s[i])-ord('a')].append(i)\r\nfor i in range(26):\r\n\tm[i].append(len(s))\r\n# print(m)\r\nans=len(s)\r\nfor i in range(26):\r\n\tcurr=0\r\n\tfor j in range(1,len(m[i])):\r\n\t\tcurr=max(curr,m[i][j]-m[i][j-1])\r\n\tans=min(ans,curr)\r\nprint(ans)\r\n", "s=input()\r\nn=len(s)\r\na=''\r\nb=[]\r\nfor i in range(n):\r\n if s[i] in a:\r\n continue\r\n else:\r\n u=[0]\r\n k=i\r\n for j in range(i+1,n):\r\n if s[j]==s[i]:\r\n u.append(j-k)\r\n k=j\r\n l=s.index(s[i])+1\r\n r=s[::-1].index(s[i])+1\r\n b.append(max(max(u),r,l))\r\n a=a+s[i]\r\nprint(min(b))", "s = input()\r\nchar = list(set(s))\r\nprint(min(max(map(len, s.split(c))) + 1 for c in char))", "s=input()\r\nprint(min(max(map(len,s.split(i)))+1 for i in list(set(s))))", "# LUOGU_RID: 104092065\ns = input().strip()\r\ncha = list(set(s))\r\nw = 1000000000000\r\nfor k in cha:\r\n a = max(map(len, s.split(k)))\r\n w = min(a, w)\r\nprint(w+1)\r\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nfrom math import ceil\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\nimport math\r\n\r\nai = lambda: list(map(int, stdin.readline().split()))\r\nei = lambda: map(int, stdin.readline().split())\r\nip = lambda: int(stdin.readline().strip())\r\n\r\ns = input()\r\nans = []\r\nfor i in list(set(s)):\r\n\tans += max(map(len,s.split(i)))+1,\r\nprint(min(ans))\r\n", "import string\r\ns=input()\r\nd={x:[0,-1] for x in string.ascii_lowercase}\r\nfor i in range(len(s)):\r\n d[s[i]][0]=max(i-d[s[i]][1],d[s[i]][0])\r\n d[s[i]][1]=i\r\na=[]\r\nfor i in d:\r\n d[i][0]=max(len(s)-d[i][1],d[i][0])\r\n a.append(d[i][0])\r\na.sort()\r\nprint(a[0])", "s=input()\r\ns1=set()\r\nfor i in s:\r\n s1.add(i)\r\nl1=list(s1)\r\nan=len(s)\r\nfor i in l1:\r\n st=-1\r\n mx=0\r\n for j in range(len(s)):\r\n if s[j]==i:\r\n mx=max(mx,j-st)\r\n st=j\r\n mx=max(mx,len(s)-st)\r\n an=min(an,mx)\r\nprint(an)", "from copy import copy\ns = input()\nalphabet = 'qwertyuioplkjhgfdsazxcvbnm'\nanss = len(s)\nfor sim in alphabet:\n x = copy(s)\n x = x.split(sim)\n ans = 0\n for i in x:\n ans = max(ans, len(i))\n anss = min(anss, ans)\nprint(anss + 1)", "string = input()\r\nprevious = []\r\ndistances = []\r\nfor i in range(26):\r\n previous.append(-1)\r\n distances.append(-1)\r\nfor count,i in enumerate(string):\r\n num = ord(i)-97\r\n currDist = count-previous[num]\r\n distances[num] = max(currDist,distances[num])\r\n previous[num] = count\r\n\r\nfor num in range(26):\r\n count = len(string)\r\n currDist = count-previous[num]\r\n distances[num] = max(currDist,distances[num])\r\nprint(min(distances))\r\n", "from collections import defaultdict\nimport sys\nreadline=sys.stdin.readline\n\nS=readline().rstrip()\ndct=defaultdict(lambda:[-1])\nfor i,s in enumerate(S):\n dct[s].append(i)\nfor lst in dct.values():\n lst.append(len(S))\nans=min(max(lst[i+1]-lst[i] for i in range(len(lst)-1)) for lst in dct.values())\nprint(ans)", "def check(s, K):\r\n\tfor ch in range(0, 26): \r\n\t\tc = chr(97 + ch) \r\n\t\tlast = -1\r\n\t\tfound = True\r\n\t\tfor i in range(0, K): \r\n\t\t\tif s[i] == c: \r\n\t\t\t\tlast = i \r\n\t\tif last == -1: \r\n\t\t\tcontinue\r\n\t\tfor i in range(K, len(s)): \r\n\t\t\tif s[i] == c: \r\n\t\t\t\tlast = i \r\n\t\t\tif last <= (i - K): \r\n\t\t\t\tfound = False\r\n\t\t\t\tbreak\r\n\r\n\t\tif found: \r\n\t\t\treturn 1\r\n\t\r\n\treturn 0\r\n\r\ndef binarySearch(s): \r\n\r\n\tlow, high, ans = 1, len(s), None\r\n\t\r\n\twhile low <= high: \r\n\t\tmid = (high + low) >> 1\r\n\t\tif check(s, mid): \r\n\t\t\tans, high = mid, mid - 1\r\n\t\telse: \r\n\t\t\tlow = mid + 1\r\n\t\r\n\treturn ans \r\n\r\ns = input()\r\nprint(binarySearch(s)) \r\n\r\n", "line = input()\r\nchars = set(line)\r\nmnglobal = len(line)\r\nfor x in chars:\r\n firstindex = 0\r\n secondindex = 0\r\n cnt = -1\r\n msdist = 0\r\n for y in (x + line + x):\r\n if y == x:\r\n secondindex = cnt\r\n if secondindex - firstindex > msdist:\r\n msdist = secondindex- firstindex\r\n firstindex = secondindex\r\n cnt += 1\r\n if msdist < mnglobal:\r\n mnglobal = msdist\r\nprint(mnglobal)\n# Sat Nov 13 2021 15:15:08 GMT+0000 (Coordinated Universal Time)\n", "s = input()#abacaba\r\nsett = set(s)\r\nl=[]\r\nfor i in sett:\r\n temp = s\r\n k = temp.find(i) + 1\r\n while temp.find(i) != -1:\r\n temp = temp[temp.find(i) + 1:]\r\n k =max(k , temp.find(i)+1)\r\n if k < len(temp) + 1:\r\n k = len(temp) + 1\r\n l.append(k)\r\nprint(min(l))\r\n", "s=input()\r\nc=float('Inf')\r\nfor chr in set(s):\r\n l=0\r\n for j in s.split(chr):\r\n l=max(l,len(j))\r\n c=min(l,c)\r\nprint(c+1)", "s = input()\n\nimport string\n\ndct = {ch: -1 for ch in string.ascii_lowercase}\ndistances = {ch: [] for ch in string.ascii_lowercase}\nfor i, ch in enumerate(s):\n distances[ch].append(i - dct[ch])\n dct[ch] = i\n\ndct = {ch: -1 for ch in string.ascii_lowercase}\ndistances_backward = {ch: [] for ch in string.ascii_lowercase}\n\nfor i, ch in enumerate(s[::-1]):\n distances_backward[ch].append(i - dct[ch])\n dct[ch] = i\n\nans = 10**9\nfor ch in set(s):\n m1 = max(distances[ch])\n m2 = max(distances_backward[ch])\n m = max(m1, m2)\n if m < ans:\n ans = m\nprint(ans)\n", "from __future__ import division, print_function\r\nimport sys\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\nimport os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\n#from functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\na = input().strip()\r\nn = len(a)\r\nmp = defaultdict(list)\r\n#st = list(set(a))\r\nfor i in range(n):\r\n mp[a[i]].append(i)\r\nfor i in a:\r\n mp[i].append(n)\r\n#print(mp)\r\n#st = [ord(i) for i in st]\r\nres =n//2+1\r\nfor c in mp.keys():\r\n mx = max(mp[c][0]+1,0)\r\n tmp = mp[c]\r\n for i,v in enumerate(tmp):\r\n mx = max(mx,v-tmp[i-1])\r\n res = min(res,mx)\r\nprint(res)\r\n", "s = input()\r\na = set(s)\r\ndct = {}\r\nfor c in a:\r\n dct[c] = []\r\n\r\nfor i in range(len(s)):\r\n dct[s[i]].append(i)\r\n\r\nans = []\r\nfor k in dct.keys():\r\n cur = dct[k][0] + 1\r\n for i in range(1, len(dct[k])):\r\n cur = max(cur, dct[k][i] - dct[k][i - 1])\r\n cur = max(cur, len(s) - dct[k][-1]) \r\n ans.append(cur)\r\nprint(min(ans))\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nx = len(s)\r\nd = dict()\r\nc = 100000\r\nfor i in range(97, 123):\r\n d[chr(i)] = [-1]\r\n\r\nfor i in range(x):\r\n a = s[i]\r\n d[a].append(i)\r\n\r\nfor i in d:\r\n d[i].append(x)\r\n w = max(j-i for i,j in zip(d[i], d[i][1:]))\r\n c = min(w, c)\r\n\r\nprint(c)\r\n", "import collections\r\ns = input()\r\nchars = collections.Counter(s).keys()\r\nprint(min(max(map(len, s.split(c))) + 1 for c in chars))", "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\ns=si()\r\nn=len(s)\r\nmn=n+10\r\nfor i in 'abcdefghijklmnopqrstuvwxyz':\r\n pi=0\r\n mx=0\r\n for j in range(n):\r\n if s[j]==i:\r\n mx=max(mx,j-pi+1)\r\n pi=j+1\r\n mx=max(mx,n-pi+1)\r\n mn=min(mn,mx)\r\nprint(mn)", "from sys import stdin, exit, setrecursionlimit\r\nfrom collections import deque\r\ninput = stdin.readline\r\nlmi = lambda: list(map(int, input().split()))\r\nmi = lambda: map(int, input().split())\r\nsi = lambda: input().strip('\\n')\r\nssi = lambda: input().strip('\\n').split()\r\nmod = 10**9+7\r\n\r\ndef check(k):\r\n ok = [False for i in range(26)]\r\n cnt = [0 for i in range(26)]\r\n for i in range(k):\r\n ok[ord(s[i])-ord(\"a\")] = True\r\n cnt[ord(s[i]) - ord(\"a\")] += 1\r\n for i in range(k, len(s)):\r\n cnt[ord(s[i]) - ord(\"a\")] += 1\r\n cnt[ord(s[i-k]) - ord(\"a\")] -= 1\r\n if cnt[ord(s[i-k]) - ord(\"a\")] == 0:\r\n ok[ord(s[i - k]) - ord(\"a\")] = False\r\n for i in ok:\r\n if i:\r\n return True\r\n return False\r\ns = si()\r\nl = 0\r\nr = len(s)\r\nwhile l < r:\r\n mid = l + r >> 1\r\n if check(mid):\r\n r = mid\r\n else:\r\n l = mid+1\r\nprint(l)", "inp=lambda:map(int,input().split())\r\ns=input()\r\n\r\nl=len(s)\r\nlab=[0]*27\r\nm=[-1]*27\r\n\r\nfor i in range(27):\r\n fl=0\r\n d=0\r\n for j in range(l):\r\n if s[j]==chr(i+ord('a')):\r\n fl=1\r\n break\r\n\r\n k=j\r\n\r\n if fl==0: continue\r\n\r\n fl=0\r\n for j in range(k+1,l):\r\n if s[j]!=chr(i+ord('a')):\r\n d+=1\r\n else:\r\n fl=1\r\n m[i]=max(m[i],d+1)\r\n d=0\r\n last=j\r\n\r\n \r\n\r\n if fl==0:\r\n m[i]=max(k+1,l-k)\r\n else:\r\n m[i]=max(m[i],k+1,l-last)\r\n\r\nr=10000000\r\n\r\nfor i in range(27):\r\n if m[i]>=0: \r\n r=min(r,m[i]);\r\n\r\nprint(r)\r\n", "s = str(input())\r\n\r\nab = 'abcdefghijklmnopqrstuvwxyz'\r\nab_ = [0] * 26\r\nanswer = [1000000000] * 26\r\n\r\nfor i in range(26):\r\n for j in range(len(s)):\r\n if s[j] == ab[i]:\r\n ab_[i] += 1\r\n\r\nres = 0\r\nfor i in range(26):\r\n if ab_[i] != 0:\r\n res += 1\r\n\r\nif res == 1:\r\n print(1)\r\n exit(0)\r\n\r\nfor sym in range(26):\r\n positions = [-1]\r\n delta = 0\r\n\r\n for i in range(len(s)):\r\n if s[i] == ab[sym]:\r\n positions.append(i)\r\n\r\n positions.append(len(s))\r\n\r\n if len(positions) > 1:\r\n for i in range(len(positions) - 1):\r\n if (positions[i + 1] - positions[i]) > delta:\r\n delta = positions[i + 1] - positions[i]\r\n if delta > 0:\r\n answer[sym] = delta\r\n\r\nprint(min(answer))\r\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\ns = minp()\r\na = [-1]*26\r\nM = [0]*26\r\nfor i in range(len(s)):\r\n\tz = ord(s[i])-ord('a')\r\n\tM[z] = max(M[z], i-a[z])\r\n\ta[z] = i\r\nfor i in range(26):\r\n\tM[i] = max(M[i], len(s)-a[i])\r\nprint(min(M))", "from sys import stdin\r\n\r\n\r\ndef main():\r\n\ts = stdin.readline()\r\n\tsize = len(s) - 1\r\n\tans = size\r\n\tfor i in range(26):\r\n\t\tlow = 0\r\n\t\thigh = size\r\n\t\tcurr_ch = i\r\n\t\twhile low < high:\r\n\t\t\tmid = (low + high) // 2\r\n\t\t\tcount = 0\r\n\t\t\tfor j in range(mid):\r\n\t\t\t\tif ord(s[j]) - ord('a') == curr_ch:\r\n\t\t\t\t\tcount += 1\r\n\t\t\tif count == 0:\r\n\t\t\t\tok = False\r\n\t\t\telse:\r\n\t\t\t\tok = True\r\n\t\t\t\tfor j in range(mid, size):\r\n\t\t\t\t\tif ord(s[j - mid]) - ord('a') == curr_ch:\r\n\t\t\t\t\t\tcount -= 1\r\n\t\t\t\t\tif ord(s[j]) - ord('a') == curr_ch:\r\n\t\t\t\t\t\tcount += 1\r\n\t\t\t\t\tif count == 0:\r\n\t\t\t\t\t\tok = False\r\n\t\t\t\t\t\tbreak\r\n\t\t\tif ok:\r\n\t\t\t\thigh = mid\r\n\t\t\telse:\r\n\t\t\t\tlow = mid + 1\r\n\t\tans = min(ans, low)\r\n\tprint(ans)\r\n\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "''' ===============================\r\n -- @uthor : Kaleab Asfaw\r\n -- Handle : kaleabasfaw2010\r\n -- Bio : High-School Student\r\n ==============================='''\r\n\r\n# Fast IO\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file): self._fd = file.fileno(); self.buffer = BytesIO(); self.writable = \"x\" in file.mode or \"r\" not in file.mode; self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b: break\r\n ptr = self.buffer.tell(); self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0; 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)); self.newlines = b.count(b\"\\n\") + (not b); ptr = self.buffer.tell(); self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1; return self.buffer.readline()\r\n def flush(self):\r\n if self.writable: os.write(self._fd, self.buffer.getvalue()); self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file): self.buffer = FastIO(file); self.flush = self.buffer.flush; self.writable = self.buffer.writable; self.write = lambda s: self.buffer.write(s.encode(\"ascii\")); self.read = lambda: self.buffer.read().decode(\"ascii\"); self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout); input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# Others\r\n# from math import floor, ceil, gcd\r\n# from decimal import Decimal as d\r\nmod = 10**9+7\r\ndef lcm(x, y): return (x * y) / (gcd(x, y))\r\ndef fact(x, mod=mod):\r\n ans = 1\r\n for i in range(1, x+1): ans = (ans * i) % mod\r\n return ans\r\ndef arr2D(n, m, default=0):\r\n lst = []\r\n for i in range(n): temp = [default] * m; lst.append(temp)\r\n return lst\r\ndef sortDictV(x): return {k: v for k, v in sorted(x.items(), key = lambda item : item[1])}\r\n\r\n# Method - Binary Search\r\n# def main(n, lst):\r\n# if n == 1: return lst[0]\r\n# maxx = -1\r\n \r\n# path = []\r\n# for start in range(2):\r\n# summ = lst[start]\r\n# i = start + 2\r\n# path = [lst[start]]\r\n# while i % n != start:\r\n# i0 = i % n\r\n# path += [lst[i0]]\r\n# summ += lst[i0]\r\n# if len(path) == (n + 1)/2:\r\n# maxx = max(maxx, summ)\r\n# summ -= path[0]\r\n# path = path[1:]\r\n# i += 2\r\n# return maxx\r\n\r\n \r\n# n = int(input())\r\n# lst = list(map(int, input().split()))\r\n# print(main(n, lst))\r\n\r\n# Method - 2\r\ns = float('inf')\r\na = input()\r\nfor i in set(a):\r\n leng = 0\r\n for j in a.split(i):\r\n leng = max(leng, len(j))\r\n s = min(leng, s)\r\nprint(s + 1)\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom math import inf\r\ns = list(map(str,input().split()))\r\ns = s[0]\r\nleft = 0\r\nright = len(s)\r\nmid = left + (right-left)//2\r\nmin1 = inf\r\nwhile left <= right:\r\n mid = left + (right-left)//2\r\n dct1 = {}\r\n for i in range(mid):\r\n if s[i] in dct1.keys():\r\n dct1[s[i]] += 1\r\n else:\r\n dct1[s[i]] = 1\r\n for j in range(mid,len(s)):\r\n if s[j] in dct1.keys():\r\n if dct1[s[j]] > 0:\r\n dct1[s[j]] += 1\r\n if s[j-mid] in dct1.keys():\r\n dct1[s[j-mid]] -= 1\r\n check = 0\r\n for g in dct1.keys():\r\n if dct1[g] > 0:\r\n min1 = min(min1,mid)\r\n check = 1\r\n break\r\n if check == 1:\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\nprint(min1)", "a = input()\r\nl = len(a)\r\nfrom collections import defaultdict\r\nb = defaultdict(list)\r\nfor i in range(l):\r\n b[ord(a[i])-97].append(i)\r\np = []\r\nfor z in b:\r\n i = b[z]\r\n k = len(i)\r\n d = []\r\n d.append(i[0]+1)\r\n for j in range(1,k):\r\n d.append(i[j]-i[j-1])\r\n d.append(l-i[k-1])\r\n p.append(max(d))\r\nprint(min(p))\r\n", "s = input()\r\n\r\nalphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n\r\nocc = {}\r\nfor ltr in alphabet:\r\n occ[ltr] = [0, len(s)+1]\r\n\r\nfor i in range(len(s)):\r\n occ[s[i]].append(i+1)\r\n\r\nk = 10**9\r\nfor ltr in alphabet:\r\n kspec = 0\r\n occ[ltr].sort()\r\n for i in range(1, len(occ[ltr])):\r\n kspec = max(kspec, occ[ltr][i] - occ[ltr][i-1])\r\n k = min(k, kspec)\r\nprint(k)\r\n", "for _ in range(1):\r\n s=input()\r\n n=len(s)\r\n arr=[[] for i in range(26)]\r\n for i in range(n):\r\n arr[ord(s[i])-97].append(i)\r\n ans=10**10 \r\n for j in arr:\r\n \r\n mx=-10**10\r\n \r\n for i in range(len(j)-1):\r\n if len(j)>=2:\r\n mx=max(mx,abs(j[i]-j[i+1]))\r\n else:\r\n break\r\n if len(j)>=1: \r\n mx=max(mx,abs(j[0]-(-1)),abs(j[len(j)-1]-n)) \r\n ans=min(mx,ans) \r\n print(ans)\r\n \r\n \r\n", "a = input()\r\nb = a\r\nstring = \"qwertyuiopasdfghjklzxcvbnm\"\r\ncount = 0\r\nstring2 = \"\"\r\nfor j in b:\r\n if j in string: \r\n string = string.replace(j, \"\")\r\n count += 1\r\n string2 += j\r\n \r\nif count == 1: print(\"1\")\r\nelse:\r\n answer = len(a)\r\n for i in range(count):\r\n b = a\r\n b = b.replace(string2[i], \" \")\r\n coef = max(len(j) for j in b.split())\r\n if coef < answer: answer = coef\r\n print(answer + 1)", "def ok(k):\r\n d = {}\r\n for i in range(k):\r\n d[s[i]] = d.get(s[i], 0) + 1\r\n\r\n for i in range(1, n - k + 1):\r\n if s[i - 1] in d:\r\n d[s[i - 1]] -= 1\r\n if d[s[i - 1]] == 0 and s[i + k - 1] != s[i - 1]:\r\n del d[s[i - 1]]\r\n if s[i + k - 1] in d:\r\n d[s[i + k - 1]] += 1\r\n return bool(d)\r\n\r\n\r\ns = input()\r\nn = len(s)\r\nl, r = 0, n + 1\r\nwhile r - l > 1:\r\n m = (r + l) // 2\r\n if ok(m):\r\n r = m\r\n else:\r\n l = m\r\nprint(r)\r\n", "import sys\nimport math\nfrom collections import defaultdict\n\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\ndef search(s, n, l):\n\trec = [0] * 26\n\tfor i in range(l + 1):\n\t\trec[ord(s[i]) - 97] += 1\n\ti, j = 0, l\n\twhile j != n - 1:\n\t\tj += 1\n\t\trec[ord(s[j]) - 97] += 1 if rec[ord(s[j]) - 97] > 0 else 0\n\t\trec[ord(s[i]) - 97] -= 1\n\t\ti += 1\n\tfor i in range(26):\n\t\tif rec[i] > 0:\n\t\t\treturn True\n\n\treturn False\n\ndef solve(test):\n\ts = list(input())\n\tn = len(s)\n\tif len(set(s)) == 1:\n\t\tprint(1)\n\t\treturn\n\tstart = 0\n\tend = n - 1\n\tans = n\n\twhile start <= end:\n\t\tmid = (start + end) // 2\n\t\tif search(s, n, mid):\n\t\t\tans = min(ans, mid + 1)\n\t\t\tend = mid - 1\n\t\telse:\n\t\t\tstart = mid + 1\n\n\tprint(ans)\n\n\n\n\n\nif __name__ == \"__main__\":\n\ttest_cases = 1\n\tfor t in range(1, test_cases + 1):\n\t\tsolve(t)\n\n \t \t \t\t\t\t\t \t\t\t\t\t \t \t \t\t \t", "import sys\nfrom collections import defaultdict \ninput = sys.stdin.readline\n\ndef main():\n word = [ *input().strip() ]\n n = len(word)\n\n letters_map = defaultdict(list)\n for i in range(27):\n letters_map[i] = [-1, -1]\n\n for index, letter in enumerate(word):\n letter_key = ord(letter) - 97\n prev_index, max_diff = letters_map[letter_key]\n new_diff = abs(index - prev_index)\n letters_map[letter_key][1] = max(max_diff, new_diff)\n letters_map[letter_key][0] = index\n\n # Compare with lenghts\n for key in letters_map.keys():\n prev_index, max_diff = letters_map[key]\n new_diff = abs(n - prev_index)\n letters_map[key][1] = max(max_diff, new_diff)\n\n answer = float(\"inf\")\n for index, diff in letters_map.values():\n if index != -1:\n answer = min(answer, diff)\n\n print(answer)\n\nif __name__ == \"__main__\":\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nn = len(s)\r\nx = [[-1] for _ in range(26)]\r\nfor i in range(n):\r\n x[ord(s[i]) - 97].append(i)\r\nfor i in range(26):\r\n x[i].append(n)\r\nans = n\r\nfor xi in x:\r\n m = 0\r\n for j in range(len(xi) - 1):\r\n m = max(m, xi[j + 1] - xi[j])\r\n ans = min(ans, m)\r\nprint(ans)", "s = input().strip()\ncha = list(set(s))\nw = 1000000000000\nfor k in cha:\n a = max(map(len, s.split(k)))\n w = min(a, w)\nprint(w+1)\n\t \t\t\t \t\t\t\t\t \t \t \t\t\t\t\t \t\t \t", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(s):\r\n n = len(s)\r\n c = [[-1] for i in range(26)]\r\n for i in range(n):\r\n c[ord(s[i])-ord('a')].append(i)\r\n for i in range(26):\r\n c[i].append(n)\r\n answer = n\r\n for i in range(26):\r\n entry = 0\r\n for j in range(len(c[i])-1):\r\n entry = max(entry, c[i][j+1]-c[i][j])\r\n answer = min(answer, entry)\r\n print(answer)\r\n \r\ns = input().decode().strip()\r\nprocess(s)", "def solve():\r\n chars = input()\r\n last_seen = [-1 for i in range(26)]\r\n max_dist = [0 for i in range(26)]\r\n min_dist = float('inf')\r\n for i,char in enumerate(chars):\r\n char_index = ord(char)-ord('a')\r\n max_dist[char_index] = max(max_dist[char_index], i-last_seen[char_index])\r\n last_seen[char_index] = i\r\n for i in range(26):\r\n if last_seen[i] != -1:\r\n min_dist = min(min_dist, max(max_dist[i], len(chars)-last_seen[i]))\r\n print(min_dist)\r\nsolve()", "s = input()\r\nmn = 1e9\r\nle = len(s)\r\nfor i in range(26):\r\n c = chr(97 + i)\r\n pos = s.find(c)\r\n cur = pos + 1\r\n if(pos == -1):\r\n continue\r\n while(True):\r\n pos2 = s.find(c, pos + 1)\r\n if(pos2==-1):\r\n cur = max(cur, le - pos)\r\n break\r\n cur = max(cur, pos2 - pos)\r\n pos = pos2\r\n mn = min(cur, mn)\r\nprint(mn)\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ns = st()\r\nn = len(s)\r\nlow, high = 1, n\r\nans = n\r\nwhile low <= high:\r\n mid = (low+high)//2\r\n j = 0\r\n x = set(chr(i) for i in range(97, 123))\r\n u = set()\r\n count = {}\r\n while j < mid:\r\n u.add(s[j])\r\n count[s[j]] = count.get(s[j], 0) + 1\r\n j += 1\r\n x = x.intersection(u)\r\n while j < n:\r\n count[s[j-mid]] -= 1\r\n count[s[j]] = count.get(s[j], 0)+1\r\n if count[s[j-mid]] == 0:\r\n del count[s[j-mid]]\r\n u.discard(s[j-mid])\r\n x = x.intersection(u)\r\n j += 1\r\n if len(x):\r\n ans = mid\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\npr(ans)\r\n", "s=input()\r\nlast=[-1]*(26)\r\nf=[0]*(26)\r\nfor i,ch in enumerate(s):\r\n c=ord(ch)-ord(\"a\")\r\n f[c]=max(f[c],(i)-last[c])\r\n last[c]=i\r\nans=float(\"inf\")\r\nfor j in range(26):\r\n f[j]=max(f[j],len(s)-last[j])\r\n ans=min(f[j],ans)\r\nprint(ans)", "s = str(input())\r\nset_str = set(s)\r\ndistance = []\r\nfor i in set_str:\r\n distance.append(max(map(len, s.split(i))))\r\nprint(min(distance)+1)", "s = input()\r\nn = len(s)\r\nlast_index, m = [], []\r\nfor i in range(26):\r\n last_index.append(-1)\r\n m.append(-1)\r\nfor i in range(n):\r\n j = ord(s[i]) - ord('a')\r\n if last_index[j] == -1:\r\n m[j] = max(m[j], i + 1)\r\n else:\r\n m[j] = max(m[j], i - last_index[j])\r\n last_index[j] = i\r\nlast_index = []\r\nfor i in range(26):\r\n last_index.append(-1)\r\nfor i in range(n - 1, -1, -1):\r\n j = ord(s[i]) - ord('a')\r\n if last_index[j] == -1:\r\n m[j] = max(m[j], n - i)\r\n else:\r\n m[j] = max(m[j], i - last_index[j])\r\n last_index[j] = i\r\nk = 1e5 + 1\r\nfor x in s:\r\n j = ord(x) - ord('a')\r\n k = min(k, m[j])\r\nprint(k)", "def possible(s,k):\r\n\tcandidates = set(s[:k])\r\n\tcount = {}\r\n\tfor c in s[:k]:\r\n\t\tif c not in count:\r\n\t\t\tcount[c] = 0\r\n\t\tcount[c] += 1\r\n\r\n\tfor i in range(k,len(s)):\r\n\t\tcount[s[i-k]] -= 1\r\n\t\tif s[i] not in count:\r\n\t\t\tcount[s[i]] = 0\r\n\t\tcount[s[i]] += 1\r\n\t\tif count[s[i-k]]==0 and s[i-k] in candidates:\r\n\t\t\tcandidates.remove(s[i-k])\r\n\treturn len(candidates) > 0\r\n\r\ndef bs(s): #find the smallest k s.t. there is a k-dominant character\r\n\tL = 1\r\n\tR = len(s)\r\n\twhile R-L > 1:\r\n\t\tM = (L+R)//2\r\n\t\tif possible(s,M):\r\n\t\t\tR = M\r\n\t\telse:\r\n\t\t\tL = M\r\n\tfor ans in range(L,R+1):\r\n\t\tif possible(s,ans):\r\n\t\t\treturn ans\r\n\treturn -1\r\n\r\nprint(bs(input()))", "from bisect import bisect_right as br ,bisect_left as bl\r\nfrom collections import defaultdict\r\ndef check(mid):\r\n global s,d\r\n\r\n for word in d:\r\n flag = True\r\n for i in range(len(s)-mid+1):\r\n gr=bl(d[word],i)\r\n gl=br(d[word],i+mid-1)-1\r\n if gl-gr>=0 and gr!=len(d[word]) and gl>=0:\r\n pass\r\n else:\r\n flag=False\r\n break\r\n if flag:\r\n return True\r\n return flag\r\n\r\n\r\ns=input()\r\nd=defaultdict(list)\r\nfor id,i in enumerate(s):\r\n d[i].append(id)\r\nlo=1\r\nhi=len(s)\r\nans=None\r\nwhile lo<=hi:\r\n mid=(lo+hi)//2\r\n if check(mid):\r\n hi=mid-1\r\n ans=mid\r\n else:\r\n lo=mid+1\r\nprint(ans)\r\n", "s = input()\r\nr = 100000\r\nl = 0\r\ndictC = {}\r\nsetC = set()\r\nfor i in range(97, 97 + 26):\r\n setC.add(chr(i))\r\n dictC.update({chr(i): 0}) \r\n\r\ndef seach(k, setC, dict1):\r\n for i in range(0, len(s)):\r\n dict1[s[i]] += 1 \r\n if i >= k - 1:\r\n if i != k - 1:\r\n dict1[s[i - k]] -= 1\r\n set2 = set()\r\n for z in setC:\r\n if dict1[z] != 0:\r\n set2.add(z)\r\n setC = set2\r\n if len(setC) == 0:\r\n return 0\r\n return 1\r\n\r\nwhile r - l > 1:\r\n mid = (r + l) // 2\r\n for i in range(97, 97 + 26):\r\n dictC.update({chr(i): 0}) \r\n if seach(mid, setC, dictC) == 1:\r\n r = mid\r\n else:\r\n l = mid\r\nprint(r)\r\n \r\n", "s = input()\r\nt = sorted(list(set(s)))\r\na1 = []\r\nfor k in t:\r\n t1, dk = [], 0\r\n for i in range(len(s)):\r\n if s[i]==k:\r\n t1.append(i+1-dk)\r\n dk = i+1\r\n t1.append(len(s)+1-dk)\r\n a1.append(max(t1))\r\nprint(min(a1))", "# your code goes he\nn=input()\nprint(min(max(map(len,n.split(i)))+1 for i in list(set(n))))\n\t\n\t\t\n\n\t \t \t \t \t \t \t \t\t\t \t\t\t\t\t\t \t", "s = input()\r\nll = l = len(s)\r\nfor i in range(26):\r\n d = chr(i+ord('a'))\r\n t = 0\r\n if d in s:\r\n ll = 0\r\n for i in s:\r\n t+=1\r\n if i==d:\r\n ll = max(t,ll)\r\n t = 0\r\n t+=1\r\n ll = max(t,ll)\r\n l = min(ll,l)\r\nprint(l)\r\n\r\n", "import math,io,os,sys\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n# sys.stdout.write(str(x) + \"\\n\")\nimport string\ns=input() \nd={}\nfor c in string.ascii_lowercase:\n d[c]=[-1]\n\nfor ind, c in enumerate(s):\n d[c]+=[ind]\n\nfor c in string.ascii_lowercase:\n d[c]+=[len(s)]\n\n\nprint(min(max(j-i for i,j in zip(d[c][0:], d[c][1:])) for c in d))", "\n\ndef every_seg(A, k, c):\n amount = 0\n for i in range(k - 1):\n if A[i] == c:\n amount += 1\n for i in range(k - 1, len(A)):\n if A[i] == c:\n amount += 1\n if amount == 0:\n return False\n if A[i - k + 1] == c:\n amount -= 1\n return True\n\nS = input()\n\nall_letters = [chr(ord('a') + i) for i in range(26)]\n\na, b, c = 1, len(S), 0\n\nwhile a < b:\n c = (a + b) // 2\n\n if any([every_seg(S, c, letter) for letter in all_letters]):\n b = c\n else:\n a = c + 1\n\nprint(a)\n", "from collections import defaultdict\r\nclass Solution:\r\n def dominantCharacter(self, string):\r\n # TODO write an algorithm here\r\n n = len(string)\r\n dic = {}\r\n for i in range(len(string)):\r\n if string[i] not in dic:\r\n dic[string[i]] = [i]\r\n if i != 0 and string[i] != string[0]: dic[string[i]].append(-1)\r\n if i != len(string)-1 and string[-1] != string[i]: dic[string[i]].append(n)\r\n else: dic[string[i]].append(i)\r\n \r\n answer = 100001\r\n for key in dic:\r\n lst, temp_answer = dic[key], 0\r\n lst.sort()\r\n for i in range(1, len(lst)):\r\n temp_answer = max(temp_answer, lst[i] - lst[i-1])\r\n answer = min(answer, temp_answer)\r\n \r\n return answer if answer > 0 else 1\r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n string = input()\r\n \r\n print(solution.dominantCharacter(string))", "from queue import PriorityQueue\nfrom queue import Queue\nimport math\nfrom collections import *\nimport sys\nimport operator as op\nfrom functools import reduce\n \n# sys.setrecursionlimit(10 ** 6)\nMOD = int(1e9 + 7)\ninput = sys.stdin.readline\nii = lambda: list(map(int,input().strip().split()))\nist= lambda: list(input().strip())\n \n \nMOD = int(1e9 + 7)\ninput = sys.stdin.readline\nii = lambda: list(map(int,input().strip().split()))\nist= lambda: list(input().strip())\n \n \ns = input().strip()\nset_str = set(s)\ndistance = []\nfor i in set_str:\n\t# print(list(map(len, s.split(i))), i)\n\tdistance.append(max(map(len, s.split(i))))\nprint(min(distance)+1)\n\n\n\n\n\n\n\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 11 01:57:07 2017\r\n\r\n@author: Sand Boa\r\n\"\"\"\r\ns=float('inf')\r\na=input()\r\nfor i in list(set(a)):\r\n leng=max(list(map(len,a.split(i))))\r\n if leng<s:\r\n s=leng\r\n \r\nprint(s+1)\r\n \r\n", "import string\r\nfrom collections import defaultdict\r\ns=input()\r\nwindow=defaultdict(list)\r\ncharacter_set=string.ascii_lowercase\r\nn,ans=len(s),len(s)\r\nfor idx,char in enumerate(character_set):\r\n prev=-1\r\n consider=-10**9-7\r\n for jdx,x in enumerate(s):\r\n if x==char:\r\n consider=max(consider,jdx-prev)\r\n prev=jdx\r\n consider=max(consider,n-prev)\r\n if prev!=-1:\r\n ans=min(ans,consider)\r\nprint(ans)\r\n\r\n\r\n\r\n", "s = input()\r\nmapp = {}\r\nfor idx, char in enumerate(s):\r\n if char in mapp:\r\n occ, maxx = mapp[char]\r\n if idx - occ + 1 > maxx:\r\n mapp[char] = [idx, idx - occ]\r\n else:\r\n mapp[char][0] = idx\r\n else:\r\n mapp[char] = [idx, idx + 1]\r\n \r\nanswer = float('inf') \r\nfor char in mapp:\r\n c1 = mapp[char][1]\r\n c2 = len(s) - mapp[char][0] \r\n answer = min(answer, max(c1, c2))\r\n# print(mapp) \r\nprint(answer)\r\n \r\n \r\n\r\n \r\n ", "s=input()\r\nc=[]\r\nf=0\r\nfor i in s:\r\n if i not in c:\r\n c.append(i)\r\nj=[]\r\nfor i in c :\r\n n=0\r\n m=0\r\n for i2 in i+s+i:\r\n if i2==i:\r\n n+=1\r\n if n>m:\r\n m=n\r\n n=0\r\n else:\r\n n+=1\r\n j.append(m)\r\nprint(min(j))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nu=input()\r\ns=[]\r\nfor i in u:\r\n s.append([i,-1])\r\nfor i in range(len(u)):\r\n s.append([u[i],i])\r\nfor i in u:\r\n s.append([i,len(u)-1])\r\nl=sorted(s,key=lambda x:x[0].lower())\r\nl=l[3:]\r\np=[]\r\nd=[]\r\nfor i in range(len(l)-1):\r\n if l[i][0]==l[i+1][0]:\r\n d.append(l[i+1][1]-l[i][1])\r\n else:\r\n p.append(d)\r\n d=[]\r\n if i==len(l)-2:\r\n p.append(d)\r\nx=[]\r\nfor i in range(len(p)):\r\n x.append(max(p[i]))\r\nx.sort()\r\nprint(x[0])\r\n", "import sys\r\n\r\ns = [ord(c) - 97 for c in input()]\r\nn = len(s)\r\n\r\n\r\ndef solve(k):\r\n count, res = [0]*26, [1]*26\r\n for i in range(k):\r\n count[s[i]] += 1\r\n for cc in range(26):\r\n if count[cc] == 0:\r\n res[cc] = 0\r\n\r\n for i in range(k, n):\r\n count[s[i]] += 1\r\n count[s[i-k]] -= 1\r\n\r\n for cc in range(26):\r\n if count[cc] == 0:\r\n res[cc] = 0\r\n\r\n return max(res) > 0\r\n\r\n\r\nok, ng = n, 0\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n if solve(mid):\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nprint(ok)\r\n", "s=input()\r\nprint(min(max(map(len, s.split(i)))+1 for i in list(set(s))))", "#n=int(input())\r\nl=[ord(i)-97 for i in input()]\r\nmaxi={}\r\nn=len(l)\r\nseen={}\r\nfor i in range(26):\r\n seen[i]=-1\r\nfor i in range(26):\r\n maxi[i]=-2347238\r\n#print(seen[2])\r\nfor i in range(n):\r\n maxi[l[i]]=max(maxi[l[i]],i-seen[l[i]])\r\n seen[l[i]]=i \r\nfor i in range(n):\r\n maxi[l[i]]=max(maxi[l[i]],n-seen[l[i]])\r\nminim=10000000000000 \r\n#print(maxi)\r\nfor i in range(26):\r\n if i not in l:\r\n continue\r\n if maxi[i]<minim:\r\n minim=maxi[i]\r\n ans=i \r\nprint(minim)\r\n ", "from functools import reduce\r\nstr = input()\r\nmain_res = float('inf')\r\n\r\nx = {}\r\n\r\nfor i in str:\r\n if not i in x:\r\n arr = list(map(lambda x: len(x), str.split(i)))\r\n res = reduce(lambda x, y: max([x, y]), arr)\r\n x[i] = res\r\n if res < main_res:\r\n main_res = res\r\n\r\nprint(main_res + 1)", "s = input()\nn = len(s)\nmin1 = n+1\nfor i in range(26):\n\tinitial = -1\n\tmax2 = 0\n\tfor j in range(n):\n\t\tif((ord(s[j])-ord('a')) == i):\n\t\t\tmax2 = max(max2,j-initial)\n\t\t\tinitial = j\n\tmax2 = max(max2,n-initial)\n\t# print(i,max2)\n\tif(initial != -1):\n\t\tmin1 = min(min1,max2)\nprint(min1)", "s = input()\nd = {}\nfor i in range(len(s)):\n if s[i] not in d.keys():\n d[s[i]] = [i]\n else:\n d[s[i]].append(i)\nres = {}\nfor key in d.keys():\n max_dif = max(d[key][0] + 1, len(s) - d[key][-1])\n for i in range(1, len(d[key])):\n max_dif = max(max_dif, d[key][i] - d[key][i - 1])\n res[key] = max_dif\nprint(min(res.values()))\n", "s = input()\r\nmx = []\r\nfor i in set(s):\r\n mx.append(max(map(len,s.split(i))))\r\nprint(min(mx)+1)", "def good(k, s):\n for i in range(26):\n c = chr(ord('a') + i)\n count = 0\n ok = True\n for j in range(len(s)):\n if s[j] == c:\n count += 1\n if j >= k and s[j - k] == c:\n count -= 1\n if count == 0 and j + 1 >= k:\n ok = False\n break\n if ok:\n return True\n return False\n\n\n\ndef k_dominant_character(s):\n low = 0\n high = len(s)\n while low + 1 < high:\n mid = (high + low) // 2\n if good(mid, s):\n high = mid\n else:\n low = mid\n return high\n\n\ns = input()\nprint(k_dominant_character(s))" ]

[ "n, k = map(int, input().split())\n\nt = list(map(int, input()))\n\np, d = 1, 10 ** 9 + 7\n\ns, f = 0, [1] * n\n\nfor i in range(2, n): f[i] = (i * f[i - 1]) % d\n\nc = lambda a, b: 0 if a > b else (f[b] * pow(f[a] * f[b - a], d - 2, d)) % d\n\nif k:\n\n u = [0] * (n + 1)\n\n p = [1] * (n + 1)\n\n for i in range(n):\n\n u[i] = (p[i] * c(k - 1, n - 2 - i) + u[i - 1]) % d\n\n p[i + 1] = (10 * p[i]) % d\n\n for i in range(n): \n\n v = u[n - 2 - i] + p[n - 1 - i] * c(k, i)\n\n s = (s + t[i] * v) % d\n\nelse:\n\n for i in t: s = (s * 10 + i) % d\n\nprint(s)\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "R = lambda : map(int, input().split())\nn,b,k,x = R()\nv = list(R())\nmod = 10**9+7\n\narr_0 = [0]*x\nfor bd in v:\n arr_0[bd%x]+=1\n\ndef cross(arr1,arr2,x,mod):\n arr = [0]*len(arr1)\n for i in range(len(arr1)):\n for j in range(len(arr2)):\n arr[(i+j)%x] += arr1[i]*arr2[j]\n for i in range(len(arr)):\n arr[i] %= mod\n return arr\n\ndef move(arr,s,x):\n m = pow(10,s,x)\n res = [0]*x\n for i in range(x):\n res[(i*m)%x]+=arr[i]\n return res\n\ndef solve(b,x,arr_0,mod):\n if b==1:\n return arr_0\n if b%2==1:\n sol = solve(b-1,x,arr_0,mod)\n return cross(move(sol,1,x),arr_0,x,mod)\n else:\n sol = solve(b//2,x,arr_0,mod)\n return cross(move(sol,b//2,x),sol,x,mod)\n\nsol = solve(b,x,arr_0,mod)\nprint(sol[k])\n\n", "def calculate_D(block):\r\n D = [0 for i in range(10)]\r\n for s in block:\r\n D[s] += 1\r\n return D\r\n\r\ndef initialize_A(D, x):\r\n A = [[0 for t in range(x)]]\r\n for i in range(10):\r\n A[0][i % x] += D[i]\r\n return A\r\n\r\ndef calculate_pows(b, x):\r\n pows = [pow(10, 1 << j, x) for j in range(b.bit_length())]\r\n return pows\r\n\r\ndef calculate_next_A(A, pows, x, p):\r\n B = A[-1]\r\n C = [sum(B[i] * B[(t - i * pows[j]) % x] for i in range(x)) % p for t in range(x)]\r\n A.append(C)\r\n return A\r\n\r\ndef calculate_answer(b, A, x, k, p):\r\n ans = None\r\n for j in range(b.bit_length()):\r\n if (b >> j) & 1:\r\n if ans is None:\r\n ans = A[j][:]\r\n else:\r\n ans = [sum(A[j][(t - i * pows[j]) % x] * ans[i] for i in range(x)) % p for t in range(x)]\r\n return ans[k]\r\n\r\np = 10 ** 9 + 7\r\nn, b, k, x = [int(s) for s in input().split()]\r\nblock = [int(s) for s in input().split()]\r\nD = calculate_D(block)\r\nA = initialize_A(D, x)\r\npows = calculate_pows(b, x)\r\n\r\nfor j in range(b.bit_length() - 1):\r\n A = calculate_next_A(A, pows, x, p)\r\n\r\nresult = calculate_answer(b, A, x, k, p)\r\nprint(result)\r\n", "f = lambda: map(int, input().split())\r\nm = 1000000007\r\nn, b, k, x = f()\r\ns = [0] * x\r\nfor q in f(): s[q % x] += 1\r\n\r\ndef g(t, d):\r\n if not t: return s\r\n p = [0] * x\r\n for i, a in enumerate(t):\r\n for j, b in enumerate(s):\r\n p[(i + d * j) % x] += a * b\r\n return [q % m for q in p]\r\n\r\nt = []\r\nu, v = 1, 10\r\nwhile b:\r\n if b & 1:\r\n t = g(t, u)\r\n u = v * u % x\r\n s = g(s, v)\r\n v = v * v % x\r\n b >>= 1\r\nprint(t[k])" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n, q = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n cnt = [0] * 35\r\n bi = [1]\r\n for _ in range(34): bi.append(bi[-1] * 2)\r\n for a in A:\r\n cnt[a.bit_length() - 1] += 1\r\n for _ in range(q):\r\n b = int(input())\r\n c = 0\r\n for i in range(34, -1, -1):\r\n p = min(cnt[i], b // bi[i])\r\n c += p\r\n b -= bi[i] * p\r\n if b == 0:\r\n print(c)\r\n else:\r\n print(-1)\r\n \r\nfor _ in range(1):\r\n main()", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import log2\r\n\r\nn, q = map(int, input().split())\r\nd = [0]*31\r\nw = list(map(int, input().split()))\r\nfor i in w:\r\n d[int(log2(i))] += 1\r\n\r\nx = list(2**i for i in range(31))\r\nfor _ in range(q):\r\n a = int(input())\r\n c = 0\r\n for j in range(30, -1, -1):\r\n b = min(d[j], a//x[j])\r\n c += b\r\n a -= b*x[j]\r\n if a == 0:\r\n break\r\n if a == 0:\r\n print(c)\r\n else:\r\n print(-1)", "import sys\r\nimport io, os\r\nimport math\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\ndef ceil(a,b):\r\n a=-a\r\n k=a//b\r\n k=-k\r\n return k\r\n# arr=list(map(int, input().split()))\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\ndef closestpow(n,c=2):\r\n # closest pow greater than equal to\r\n rem=0\r\n k = 0\r\n while n > 1:\r\n rem += (n % c)\r\n n = n // c\r\n k += 1\r\n # remove \"#\" below for strictly less\r\n #if rem==0: k-=1\r\n return k\r\ndef main():\r\n arr=list(map(int, input().split()))\r\n n=arr[0]\r\n q=arr[1]\r\n arr=list(map(int, input().split()))\r\n pres=[0]*31\r\n for i in range(n):\r\n f=closestpow(arr[i])\r\n pres[f]+=1\r\n for i in range(q):\r\n c=0\r\n b=int(input())\r\n for j in range(30,-1,-1):\r\n no=2**j\r\n h=min(pres[j],b//no)\r\n b-=(h*no)\r\n c+=h\r\n if(b!=0):\r\n print(-1)\r\n else:\r\n print(c)\r\nmain()", "# https://codeforces.com/contest/1003\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\npow2, pow2_idx = [], {}\nfor i in range(64):\n pow2 += [1 << i]\n pow2_idx[pow2[i]] = i\n\nn, q = map(int, input().split())\na = list(map(int, input().split()))\n\ncoins = [0] * 64\nfor x in a:\n coins[pow2_idx[x]] += 1\n\nfor _ in range(q):\n ans = 0\n\n b = int(input())\n b = list(map(int, list(bin(b)[2:])))[::-1]\n\n coins_copy = coins.copy()\n ic = len(b) - 1\n for i in range(len(b) - 1, -1, -1):\n b_req = b[i] * pow2[i]\n ic = min(ic, i)\n while b_req > 0 and ic >= 0:\n coins_req = b_req // pow2[ic]\n coins_avail = coins_copy[ic]\n coins_used = min(coins_req, coins_avail)\n b_req -= coins_used * pow2[ic]\n coins_copy[ic] -= coins_used\n ans += coins_used\n if coins_copy[ic] == 0:\n ic -= 1\n if b_req > 0 and ic < 0:\n ans = -1\n break\n\n print(ans)\n", "from math import *\r\nfrom sys import *\r\nn,q=map(int,stdin.readline().split())\r\na=list(map(int,stdin.readline().split()))\r\na.sort()\r\npowers=[1]\r\nfor i in range(1,32):\r\n powers.append(2*powers[-1])\r\narr=[]\r\nfor i in range(n):\r\n tmp=int(log2(a[i]))\r\n if len(arr)==0:\r\n arr.append([tmp,1])\r\n elif arr[-1][0]==tmp:\r\n arr[-1][1]+=1\r\n else:\r\n arr.append([tmp,1])\r\nfor _ in range(q):\r\n x=int(stdin.readline())\r\n ver=True\r\n ans=0\r\n for i in range(len(arr)-1,-1,-1):\r\n if powers[arr[i][0]]<=x:\r\n cnt=min(x//powers[arr[i][0]],arr[i][1])\r\n x-=(cnt*powers[arr[i][0]])\r\n ans+=cnt\r\n if x==0:\r\n break\r\n if x==0:\r\n stdout.write(str(ans)+\"\\n\")\r\n else:\r\n stdout.write(\"-1\"+\"\\n\")", "\r\nimport sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn,q=map(int,input().split())\r\narr=[int(x) for x in input().split()]\r\n\r\nques=[]\r\nfor i in range(q):\r\n ques.append(int(input()))\r\n\r\ndp=[0]*31\r\n\r\nfor i in arr:\r\n s=bin(i)[2:]\r\n dp[len(s)-1]=dp[len(s)-1]+1\r\n# print(dp)\r\nfor q in ques:\r\n l=list(bin(q)[2:])\r\n l=l[::-1]\r\n # print(l)\r\n i=len(l)-1\r\n cnt=0\r\n ans=0\r\n while i>=0:\r\n if l[i]==\"1\":\r\n cnt=cnt+1\r\n \r\n if dp[i]>=cnt:\r\n ans=ans+cnt\r\n cnt=0\r\n else:\r\n ans=ans+dp[i]\r\n cnt=cnt-dp[i]\r\n\r\n cnt=2*cnt\r\n i=i-1\r\n if cnt==0:\r\n print(ans)\r\n else:\r\n print(-1) ", "from sys import stdin\r\ninput=stdin.readline\r\nfrom collections import Counter\r\ndef f(cnt,q):\r\n\tl=sorted(cnt.keys(),reverse=True)\r\n\tfor i in range(q):\r\n\t\tn=int(input())\r\n\t\tres=0\r\n\t\tfor i in l:\r\n\t\t\ttt=min(n//i,cnt[i])\r\n\t\t\tn-=tt*i\r\n\t\t\tres+=tt\r\n\t\tif n==0:\r\n\t\t\tprint(res)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\nn,q=map(int,input().strip().split())\r\nl=list(map(int,input().strip().split()))\r\ncnt=Counter(l)\r\nf(cnt,q)", "from sys import stdin\r\ninput=stdin.readline\r\nfrom collections import Counter\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=Counter(a)\r\nfor query in range(q):\r\n b=int(input())\r\n total=0\r\n l=sorted(c.keys(),reverse=True)\r\n for i in l:\r\n curr=min(b//i,c[i])\r\n total+=curr\r\n b-=curr*i\r\n if b==0:break\r\n if b!=0:print(-1)\r\n else:print(total)", "from sys import stdin\r\ninput=stdin.readline\r\nn,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncnt=[0]*31\r\nfor i in range(n):\r\n x=a[i]\r\n c=0\r\n while x%2==0:\r\n x//=2\r\n c+=1\r\n cnt[c]+=1\r\nf=[0]*31\r\nf[0]=1\r\nfor i in range(1,31):\r\n f[i]=f[i-1]*2\r\nfor _ in range(q):\r\n b=int(input())\r\n ans=0\r\n for j in range(31)[::-1]:\r\n cur=min(b//f[j],cnt[j])\r\n b-=cur*f[j]\r\n ans+=cur\r\n if b>0:\r\n print(-1)\r\n else:\r\n print(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n# ----------------------- #\r\n\r\nn, q = map(int, input().split())\r\nA = list(map(int, input().split()))\r\ncoins = [0] * 33\r\nfor a in A:\r\n coins[a.bit_length()-1] += 1\r\n\r\nfor _ in range(q):\r\n b = int(input())\r\n ans = 0\r\n for i in range(32, -1, -1):\r\n if coins[i] and b >= 1<<i:\r\n ok = min(coins[i], b>>i)\r\n b -= ok * (1<<i)\r\n ans += ok\r\n if b != 0:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, q = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(lambda : 0)\r\nfor i in a:\r\n cnt[i] += 1\r\npow2 = [1]\r\nfor _ in range(35):\r\n pow2.append(2 * pow2[-1])\r\nfor _ in range(q):\r\n x = [0] * 35\r\n b = int(input())\r\n ans = 0\r\n f = 1\r\n for i in range(34, 0, -1):\r\n p2 = pow2[i - 1]\r\n if not x[i] and not b & p2:\r\n continue\r\n if b & p2:\r\n x[i] += 1\r\n ans += min(x[i], cnt[p2])\r\n if x[i] <= cnt[p2]:\r\n x[i] = 0\r\n else:\r\n c = x[i] - cnt[p2]\r\n x[i - 1] += 2 * c\r\n if x[0]:\r\n ans = -1\r\n print(ans)", "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\n\r\ndef solve():\r\n n, q = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n\r\n @cache\r\n def highest_int(x):\r\n ans = None\r\n lo, hi = 0, 31\r\n while lo <= hi:\r\n mid = (lo + hi) // 2\r\n if (1 << mid) <= x:\r\n ans = mid\r\n lo = mid + 1\r\n else:\r\n hi = mid - 1\r\n return ans\r\n\r\n count = Counter()\r\n for x in A:\r\n count[highest_int(x)] += 1\r\n\r\n @cache\r\n def find_cost(x):\r\n ans = 0\r\n for i in range(31, -1, -1):\r\n if (1 << i) > x:\r\n continue\r\n\r\n amount = min(x // (1 << i), count[i])\r\n ans += amount\r\n x -= (1 << i) * amount\r\n\r\n return ans if x == 0 else -1\r\n\r\n for _ in range(q):\r\n x = int(input())\r\n print(find_cost(x))\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys,os,io\r\nfrom sys import stdin\r\nfrom math import log, gcd, ceil\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappush, heappop, heapify\r\nfrom bisect import bisect_left , bisect_right\r\nimport math \r\ndef ii():\r\n return int(input())\r\ndef li():\r\n return list(map(int,input().split()))\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\") ; sys.stdout = open(\"output.txt\",\"w\") \r\nelse:\r\n input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nno = \"NO\"\r\nyes = \"YES\"\r\ndef solve():\r\n n,q = li()\r\n a = li()\r\n d = defaultdict(lambda:0)\r\n for i in a:\r\n d[i]+=1\r\n # print(d)\r\n k = list(d.keys())\r\n k.sort()\r\n k.reverse()\r\n # print(k)\r\n for i in range(q):\r\n b = ii()\r\n cnt=0\r\n # print(b)\r\n f=0\r\n for j in k:\r\n # print(\"j\",j)\r\n # print(b)\r\n cnt+=min(d[j],b//j)\r\n b = b - j*min(d[j],b//j)\r\n # print(b)\r\n \r\n if b!=0:\r\n cnt=-1\r\n print(cnt)\r\n\r\n\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n solve()\r\n \r\n", "# https://codeforces.com/contest/1003\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, q = map(int, input().split())\na = list(map(int, input().split()))\n\nN_BITS = (2 * 10 ** 9).bit_length() + 1\ncoins = [0] * N_BITS\nfor x in a:\n coins[x.bit_length() - 1] += 1\n\nfor _ in range(q):\n ans = 0\n b = int(input())\n for i in range(N_BITS - 1, -1, -1):\n coins_used = min(coins[i], b // (1 << i))\n b -= coins_used * (1 << i)\n ans += coins_used\n print(ans if b == 0 else -1)\n", "import os,io\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn ,q = map(int,input().split())\r\nd = list(map(int,input().split()))\r\ncnt = [0] * (60)\r\npoww = [1]\r\nfor i in range(1, 60):\r\n poww += [poww[-1] * 2]\r\nfor i in d:\r\n cnt[len(bin(i)) - 3] += 1\r\nans = 0\r\nfor _ in range(q):\r\n x = int(input())\r\n ans = 0\r\n for i in range(59, -1, -1):\r\n y = poww[i] * cnt[i]\r\n if y > x:\r\n l = 0\r\n r = cnt[i]\r\n while l + 1 < r:\r\n md = (l + r) // 2\r\n if poww[i] * md > x:r = md\r\n else:l = md\r\n x -= poww[i] * l\r\n ans += l\r\n else:\r\n \r\n x -= y\r\n ans += cnt[i]\r\n if x == 0:break\r\n if x > 0:ans = -1\r\n print(ans)\r\n \r\n \r\n", "n,q=map(int,input().split())\r\na=list(map(int,input().split()))\r\nli=[0]*32\r\nfor i in a:\r\n li[i.bit_length()-1]+=1\r\n#print(li)\r\nqueries=[int(input()) for _ in range(q)]\r\nfor k in queries:\r\n ans=0\r\n for i in range(31,-1,-1):\r\n mini=min(k>>i,li[i])\r\n ans+=mini\r\n k-=mini<<i\r\n ans=ans if k==0 else -1\r\n print(ans)", "import collections\r\nn, q = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\na = [int(input()) for _ in range(q)]\r\ndic = [0] * 32\r\nfor key, val in collections.Counter(s).items():\r\n dic[key.bit_length()-1] = val\r\nfor s in a:\r\n ans = 0\r\n for i in range(31, -1, -1):\r\n count = min(s >> i, dic[i])\r\n ans += count\r\n s -= count << i\r\n print(ans if s==0 else -1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nn, q = map(int, input().split())\r\nl = (2*10**9).bit_length() + 2\r\na = [0]*l\r\nfor i in map(int, input().split()):\r\n cnt = 0\r\n while i>1:\r\n i //= 2\r\n cnt += 1\r\n a[cnt] += 1\r\n\r\nfor _ in range(q):\r\n b = int(input())\r\n cnt = 0\r\n for i in range(l-1, -1, -1):\r\n tmp = min(b//2**i, a[i])\r\n cnt += tmp\r\n b -= 2**i*tmp\r\n if b>0:\r\n print(-1)\r\n else:\r\n print(cnt)", "from sys import stdin, stdout\r\n\r\nget_string = lambda: stdin.readline().strip('\\n')\r\nget_intmap = lambda: map( int, get_string().split(' ') )\r\n#get_intmap\r\n\r\ndef ncr_generator(n,r):\r\n ncrr = 1\r\n while True:\r\n yield ncrr\r\n n += 1\r\n ncrr = ( ncrr * n // (n - r) ) \r\n\r\nfrom collections import Counter\r\ndef testcase():\r\n n,q = get_intmap()\r\n a = tuple(get_intmap())\r\n cnt = Counter(a)\r\n keys = sorted(cnt.keys(),reverse = True)\r\n blist = [int(get_string()) for i in range(q)]\r\n ans = ['-1'] * q\r\n for ind in range(q):\r\n #b = int(get_string())\r\n b, tmp = blist[ind], 0\r\n for key in keys:\r\n q,r = divmod(b,key)\r\n m = min(q, cnt[key])\r\n tmp += m\r\n b -= m * key\r\n if b == 0:\r\n ans[ind] = str(tmp)\r\n break\r\n print(\"\\n\".join(ans))\r\n\r\n \r\n\r\n \r\n\r\ntestcase()\r\n#for t in range(int(input())):\r\n# testcase()\r\n", "from math import *\r\nfrom sys import *\r\nn,q=map(int,stdin.readline().split())\r\na=list(map(int,stdin.readline().split()))\r\npowers=[int(pow(2,i)) for i in range(32)]\r\narr=[0]*32\r\nfor i in range(n):\r\n arr[int(log2(a[i]))]+=1\r\nfor _ in range(q):\r\n x=int(stdin.readline())\r\n ver=True\r\n ans=0\r\n for i in range(len(arr)-1,-1,-1):\r\n if arr[i]!=0 and powers[i]<=x:\r\n cnt=min(x//powers[i],arr[i])\r\n x-=(cnt*powers[i])\r\n ans+=cnt\r\n if x==0:\r\n break\r\n if x==0:\r\n stdout.write(str(ans)+\"\\n\")\r\n else:\r\n stdout.write(\"-1\"+\"\\n\")", "from sys import stdin\ninput=stdin.readline\nfrom collections import Counter\ndef f(cnt,q):\n\tl=sorted(cnt.keys(),reverse=True)\n\tfor i in range(q):\n\t\tn=int(input())\n\t\tres=0\n\t\tfor i in l:\n\t\t\ttt=min(n//i,cnt[i])\n\t\t\tn-=tt*i\n\t\t\tres+=tt\n\t\tif n==0:\n\t\t\tprint(res)\n\t\telse:\n\t\t\tprint(-1)\nn,q=map(int,input().strip().split())\nl=list(map(int,input().strip().split()))\ncnt=Counter(l)\nf(cnt,q)\n\t\t \t \t \t\t \t \t\t \t\t\t\t\t \t \t" ]

[ "import sys\r\nreadline=sys.stdin.readline\r\nimport bisect\r\n\r\ndef LIS(lst,weakly=False,max_value=float('inf')):\r\n f=bisect.bisect_right if weakly else bisect.bisect_left\r\n N=len(lst)\r\n update=[None]*N\r\n dp=[max_value]*N\r\n for k,x in enumerate(lst):\r\n i=f(dp,x)\r\n dp[i]=x\r\n update[k]=(i,dp[i])\r\n n=bisect.bisect_left(dp,max_value)\r\n lis=[None]*n\r\n n-=1\r\n for i,x in update[::-1]:\r\n if i==n:\r\n lis[n]=x\r\n n-=1\r\n return lis\r\n\r\nN=int(readline())\r\nab,cd=readline().split()\r\na,b=map(int,ab.split(\"/\"))\r\nc,d=map(int,cd.split(\"/\"))\r\npoints=[]\r\nfor _ in range(N):\r\n x,y=map(int,readline().split())\r\n x,y=b*y-a*x,c*x-d*y\r\n if x>=0 and y>=0:\r\n points.append((x,y))\r\npoints.sort(key=lambda tpl:(tpl[0],-tpl[1]))\r\nans=len(LIS([y for x,y in points]))\r\nprint(ans)", "#V.Chaitanya\n\nimport bisect\n \ndef INPUT():\n\tglobal n, a, b, c, d\n\tn = int(input())\n\ta, b, c, d = [int(j) for i in input().split() for j in i.split(\"/\")]\n\tglobal y_alpha\n\ty_alpha = []\n\tfor _ in range(n):\n\t\tx, y = [int(x) for x in input().split()]\n\t\ty_alpha.append((b * y - a * x, c * x - d * y))\n \n \nif __name__ == '__main__':\n\tINPUT()\n\ty_alpha = sorted([(x, y) for x, y in y_alpha if x > 0 and y > 0], key = lambda x: (x[0], -x[1]))\n\tdp = []\n\tfor x, y in y_alpha:\n\t\ti = bisect.bisect_left(dp, y)\n\t\tif i == len(dp):\n\t\t\tdp.append(y)\n\t\telse:\n\t\t\tdp[i] = y;\n \n\tprint(len(dp));\n \t\t \t \t\t \t \t\t\t \t \t \t\t \t" ]

[ "n,s=[int(i) for i in input().split()]\n\ns-=1\n\nn-=1\n\nd=0\n\nl=[int(i) for i in input().split()]\n\nif l[s]!=0:d+=1\n\nl=l[:s]+l[s+1:]\n\nfor i in range(0,len(l)):\n\n\tif(l[i]==0):l[i]=n+5\n\nl.sort()\n\nj=0\n\ni=0\n\nc=0\n\nwhile 1:\n\n\twhile i<len(l) and j==l[i]:\n\n\t\ti+=1\n\n\tif i>=len(l):\n\n\t\tbreak\n\n\telif l[i]-j==1:\n\n\t\tj+=1\n\n\t\ti+=1\n\n\t\tcontinue\n\n\telse:\n\n\t\tl.pop()\n\n\t\td+=1\n\n\t\tj+=1\n\nprint(d)\n\n\n\n# Made By Mostafa_Khaled", "n,s=[int(i) for i in input().split()]\r\n\r\ns-=1\r\n\r\nn-=1\r\n\r\nd=0\r\n\r\nl=[int(i) for i in input().split()]\r\n\r\nif l[s]!=0:d+=1\r\n\r\nl=l[:s]+l[s+1:]\r\n\r\nfor i in range(0,len(l)):\r\n\r\n\tif(l[i]==0):l[i]=n+5\r\n\r\nl.sort()\r\n\r\nj=0\r\n\r\ni=0\r\n\r\nc=0\r\n\r\nwhile 1:\r\n\r\n\twhile i<len(l) and j==l[i]:\r\n\r\n\t\ti+=1\r\n\r\n\tif i>=len(l):\r\n\r\n\t\tbreak\r\n\r\n\telif l[i]-j==1:\r\n\r\n\t\tj+=1\r\n\r\n\t\ti+=1\r\n\r\n\t\tcontinue\r\n\r\n\telse:\r\n\r\n\t\tl.pop()\r\n\r\n\t\td+=1\r\n\r\n\t\tj+=1\r\n\r\nprint(d)\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled", "n, root = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndef push(d, x, val):\r\n if x not in d:\r\n d[x] = 0\r\n d[x]+=val\r\n \r\n if d[x]==0:\r\n del d[x]\r\n \r\nd = {}\r\nfor x in a:\r\n push(d, x, 1)\r\n\r\nmin_ = 0\r\nroot -= 1\r\ninf = 9999999\r\n\r\nif a[root] != 0:\r\n min_+=1\r\n push(d, a[root], -1)\r\n push(d, 0, 1)\r\n \r\nif 0 in d and d[0] > 1:\r\n add = d[0] - 1\r\n min_+=add\r\n push(d, inf, add)\r\n d[0] = 1\r\n \r\nS = [[val, num] for val, num in sorted(d.items(), key = lambda x:x[0])] \r\n#print(min_, S)\r\ncur = -1\r\ni = 0\r\n\r\nwhile i < len(S):\r\n remain = S[i][0] - (cur+1)\r\n \r\n while remain > 0:\r\n val, num = S[-1]\r\n \r\n if val == S[i][0]:\r\n if val != inf:\r\n min_ += min(remain, num)\r\n break \r\n else:\r\n add = min(num, remain)\r\n remain -= add\r\n \r\n if val != inf:\r\n min_ += add\r\n \r\n if num == add:\r\n S.pop()\r\n else: \r\n S[-1][1] -= add\r\n \r\n cur=S[i][0]\r\n i+=1\r\n \r\nprint(min_)", "n,s = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nif A[s-1] != 0:\r\n per = 1\r\n A[s-1] = 0\r\nelse:\r\n per = 0\r\nA.sort()\r\nmaxs = max(A)\r\nans = [0] * (maxs + 1)\r\nanswer = maxs + 1\r\no = -1\r\nfor j in range(n):\r\n if A[j] == 0:\r\n o += 1\r\n \r\n if ans[A[j]] == 0:\r\n ans[A[j]] = 1\r\n answer -= 1\r\nan = per + max(o, answer)\r\n\r\nfor j in range(n-2,-1,-1):\r\n \r\n for t in range(A[j+1]-1, A[j] -1,-1):\r\n if ans[t] == 0:\r\n answer -= 1\r\n \r\n an = min(an, per + max(answer,o+n - j - 1))\r\nprint(an)", "n,s = (int(x) for x in input().split())\r\nl = [ int(x) for x in input().split() ]\r\nmistakes = 0\r\ns -= 1\r\nif l[s] != 0:\r\n\tmistakes += 1\r\n\tl[s] = 0\r\n\r\nfor i in range(len(l)):\r\n\tif l[i] == 0 and i != s:\r\n\t\tl[i] = 2*n + 4\r\n\r\nl.sort()\r\nlast = 0\r\ni = 1\r\nwhile i < len(l):\r\n\twhile i < len(l) and l[i] > last + 1:\r\n\t\tl.pop()\r\n\t\tlast += 1\r\n\t\tmistakes += 1\r\n\tif i < len(l):\r\n\t\tlast = l[i]\r\n\t\ti += 1\r\n\r\nprint(mistakes)", "[n, s] = [int(x) for x in input().split()]\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nmistakes = 0\r\n\r\nmistakes += (a[s-1] is not 0)\r\na[s - 1] = 0\r\n\r\nnumSuperiors = [0]*(2*100000+100)\r\n\r\nfor superiors in a:\r\n numSuperiors[superiors] += 1\r\n\r\ncachedMistakes = 0\r\n\r\nwhile numSuperiors[0] != 1:\r\n cachedMistakes += 1\r\n numSuperiors[0] -= 1\r\n\r\nrightIndex = len(numSuperiors) - 1\r\nleftIndex = 0\r\nwhile True:\r\n while True:\r\n if numSuperiors[leftIndex] == 0 and cachedMistakes != 0:\r\n numSuperiors[leftIndex] += 1\r\n cachedMistakes -= 1\r\n mistakes += 1\r\n if numSuperiors[leftIndex] == 0:\r\n break\r\n leftIndex += 1\r\n while numSuperiors[rightIndex] == 0:\r\n rightIndex -= 1\r\n if leftIndex >= rightIndex:\r\n break\r\n numSuperiors[rightIndex] -= 1\r\n cachedMistakes += 1\r\n\r\nprint(mistakes)" ]

[ "n,k,v=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nif s<v:\r\n print('NO')\r\n exit()\r\n\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\n\r\nif (s-v)%k==0:\r\n print('YES')\r\n ans=[]\r\n for i in range(1,n):\r\n ans.append((ceil(a[i],k),i,0))\r\n ans.append((ceil(s-v,k),0,1))\r\n for x,y,z in ans:\r\n if x!=0:\r\n print(x,y+1,z+1)\r\n exit()\r\n\r\ndp=[[False]*k for i in range(n+1)]\r\ndp[0][0]=True\r\nfor i in range(n):\r\n x=(a[i]//k)*k\r\n y=a[i]\r\n for j in range(k):\r\n dp[i+1][(j+x)%k]|=dp[i][j]\r\n dp[i+1][(j+y)%k]|=dp[i][j]\r\n\r\nif not dp[n][v%k]:\r\n print('NO')\r\n exit()\r\n\r\ntmp=(s-v)%k\r\nx=[]\r\ny=[]\r\nfor i in range(n-1,-1,-1):\r\n if tmp==0:\r\n y.append(i)\r\n continue\r\n if dp[i][(tmp-a[i])%k]:\r\n tmp-=a[i]\r\n tmp%=k\r\n x.append(i)\r\n else:\r\n y.append(i)\r\n\r\nx.reverse()\r\nx0=x[0]\r\nif x0!=0:\r\n z=0\r\nelse:\r\n z=1\r\n\r\nans=[]\r\nfor i in x[1:]:\r\n ans.append((ceil(a[i],k),i,x0))\r\n a[x0]+=a[i]\r\n a[i]=0\r\n\r\nans.append((a[x0]//k,x0,z))\r\na[z]+=a[x0]//k*k\r\na[x0]-=a[x0]//k*k\r\nfor i in range(n):\r\n if i!=z and i!=x0:\r\n ans.append((ceil(a[i],k),i,z))\r\n a[z]+=a[i]\r\n a[i]=0\r\n\r\nans.append(((a[z]-v)//k,z,x0))\r\na[x0]+=a[z]-v\r\na[z]-=a[z]-v\r\n\r\nprint('YES')\r\nfor x,y,z in ans:\r\n if x!=0:\r\n print(x,y+1,z+1)\r\n\r\n# print(a)" ]

[ "def calscore(a,r,m):\r\n s = 0\r\n l = 0\r\n if([0]*m == a[r]):\r\n return l\r\n for i in range(len(a[r])-1):\r\n if(a[r][i]==1 and a[r][i+1]==1):\r\n s+=1\r\n else:\r\n s+=1\r\n l = max(l,s)\r\n s = 0\r\n try:\r\n if(a[r][-1]==1 and a[r][-2]==1):\r\n s+=1\r\n l = max(s,l)\r\n except:\r\n if(a[r][-1]==1):\r\n s+=1\r\n l = max(s,l)\r\n return l\r\nn,m,q = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n c = list(map(int,input().split()))\r\n a.append(c)\r\nscores = []\r\nfor i in range(len(a)):\r\n scores.append(calscore(a,i,m))\r\np = max(scores)\r\nfor i in range(q):\r\n x,y = map(int,input().split())\r\n a[x-1][y-1] = int(not(a[x-1][y-1]))\r\n scores[x-1] = calscore(a,x-1,m)\r\n print(max(scores))\r\n", "'''\r\n Codeforces: (dynamic programming) 548B Mike and Fun (1400)\r\n link: https://codeforces.com/problemset/problem/548/B\r\n Tags: brute force, dp, greedy, implementation, *1400\r\n\r\n===========================================================\r\n\r\n submission:\r\n runtime: _ ms, memory: _ KB\r\n'''\r\n\r\n'''\r\ninput #1:\r\n5 4 5\r\n0 1 1 0\r\n1 0 0 1\r\n0 1 1 0\r\n1 0 0 1\r\n0 0 0 0\r\n1 1\r\n1 4\r\n1 1\r\n4 2\r\n4 3\r\noutput: \r\n3\r\n4\r\n3\r\n3\r\n4\r\n\r\ninput #2:\r\n2 2 10\r\n1 1\r\n0 1\r\n1 1\r\n2 1\r\n1 1\r\n2 2\r\n1 1\r\n2 1\r\n2 2\r\n2 2\r\n1 1\r\n1 1\r\noutput: \r\n1\r\n2\r\n2\r\n2\r\n1\r\n1\r\n1\r\n1\r\n2\r\n1\r\n\r\ninput #4\r\n5 5 30\r\n0 1 1 1 0\r\n1 1 0 1 1\r\n0 1 1 1 1\r\n0 0 1 1 0\r\n0 0 0 0 0\r\n3 2\r\n2 2\r\n2 2\r\n4 3\r\n1 4\r\n3 2\r\n4 1\r\n2 4\r\n1 4\r\n2 1\r\n5 2\r\n4 1\r\n4 1\r\n5 1\r\n2 4\r\n2 4\r\n4 4\r\n1 2\r\n3 1\r\n4 5\r\n1 2\r\n2 3\r\n1 1\r\n5 1\r\n3 4\r\n1 1\r\n5 4\r\n1 5\r\n5 4\r\n2 2\r\noutput: \r\n3\r\n3\r\n3\r\n3\r\n3\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n4\r\n5\r\n5\r\n5\r\n5\r\n5\r\n5\r\n4\r\n3\r\n3\r\n4\r\n4\r\n4\r\n'''\r\n[n, m, q] = input().split(' ')\r\nn,m,q = int(n), int(m), int(q)\r\n\r\ngrid = []\r\ndp = []\r\n# m = 0 # max consecutive\r\n# mm = [] # index of rows of max\r\nfor i in range(n):\r\n grid.append([])\r\n dp.append([])\r\n total = 0\r\n mx = 0\r\n for j in input().split(' '):\r\n grid[i].append(int(j))\r\n if int(j) == 1: total += 1\r\n else: \r\n mx = max(mx, total)\r\n # if mx > m: \r\n # m = mx \r\n # mm = [i]\r\n # elif mx == m:\r\n # mm.append(i)\r\n total = 0\r\n mx = max(mx, total)\r\n # m = max(m, mx)\r\n dp[i] = mx\r\n\r\n# query\r\nfor k in range(q):\r\n [i,j] = input().split(' ')\r\n i,j = int(i)-1, int(j)-1\r\n # print('i', i, 'j', j)\r\n grid[i][j] ^= 1 # flip 1 to 0, and 0 to 1\r\n cm = 0 # current row max\r\n total = 0\r\n for col in grid[i]:\r\n if col == 1: total += 1\r\n else: \r\n cm = max(cm, total)\r\n total = 0\r\n cm = max(cm, total)\r\n dp[i] = cm\r\n for m in dp:\r\n cm = max(cm, m)\r\n print(cm)\r\n# print('m', m)\r\n# print('mm', mm)\r\n# print('dp', dp)\r\n# print('grid', grid)\r\n\r\n\r\n'''\r\n2 2 10\r\n1 1\r\n0 1\r\n1 1\r\n2 1\r\n1 1\r\n2 2\r\n1 1\r\n2 1\r\n2 2\r\n2 2\r\n1 1\r\n1 1\r\n\r\n1\r\n2\r\n2\r\n2\r\n1\r\n1\r\n1\r\n1\r\n2\r\n1\r\n'''", "def solve(arr):\r\n res = 0\r\n count = 0\r\n for i in arr:\r\n if i == 1:\r\n count += 1\r\n else:\r\n res = max(res, count)\r\n count = 0\r\n \r\n return max(res, count)\r\n\r\n\r\nm, n, q = map(int, input().split())\r\ngrid = []\r\nfor _ in range(m):\r\n c = list(map(int, input().split()))\r\n grid.append(c)\r\n\r\nscores = [0 for _ in range(m)]\r\nfor i in range(m):\r\n scores[i] = solve(grid[i])\r\n\r\nfor _ in range(q):\r\n i, j = map(int, input().split())\r\n grid[i-1][j-1] = 1 - grid[i-1][j-1]\r\n scores[i-1] = solve(grid[i-1])\r\n print(max(scores))", "class CodeforcesTask548BSolution:\n def __init__(self):\n self.result = ''\n self.n_m_q = []\n self.grid = []\n self.actions = []\n\n def read_input(self):\n self.n_m_q = [int(x) for x in input().split(\" \")]\n for _ in range(self.n_m_q[0]):\n self.grid.append([int(y) for y in input().split(\" \")])\n for _ in range(self.n_m_q[2]):\n self.actions.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n maxes = [0] * self.n_m_q[0]\n for row in range(self.n_m_q[0]):\n mx = 0\n cr = 0\n for y in range(self.n_m_q[1]):\n if self.grid[row][y]:\n cr += 1\n mx = max(mx, cr)\n else:\n cr = 0\n maxes[row] = mx\n res = []\n for action in self.actions:\n self.grid[action[0] - 1][action[1] - 1] = 0 if self.grid[action[0] - 1][action[1] - 1] else 1\n mx = 0\n cr = 0\n for y in range(self.n_m_q[1]):\n if self.grid[action[0] - 1][y]:\n cr += 1\n mx = max(mx, cr)\n else:\n cr = 0\n maxes[action[0] - 1] = mx\n res.append(str(max(maxes)))\n self.result = \"\\n\".join(res)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask548BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "ml = lambda s:max(map(len, \"\".join(s).split('0')))\r\nn, m, q = map(int, input().split())\r\nl = [0]*n\r\nmat = list()\r\nfor i in range(n):\r\n z = list(input().split())\r\n mat.append(z)\r\n l[i] = ml(z)\r\nfor i in range(q):\r\n a, b = map(int, input().split())\r\n a -= 1; b -= 1;\r\n mat[a][b] = str(1 - int(mat[a][b]))\r\n l[a] = ml(mat[a])\r\n score = max(l)\r\n print(score)\r\n", "n, m, q = map(int, input().split())\nmat = []\nfor i in range(n):\n mat.append([int(i) for i in input().split()])\nmaxr = [0] * n\nfor i in range(n):\n j = 0\n maxi = 0\n while j < m:\n if mat[i][j] == 1:\n c = 0\n while j < m and mat[i][j] == 1:\n c += 1\n j += 1\n maxi = max(maxi, c)\n else:\n j += 1\n maxr[i] = maxi\nfor i in range(q):\n x, y = map(int, input().split())\n x -= 1\n y -= 1\n mat[x][y] = 1 - mat[x][y]\n maxi = 0\n j = 0\n while j < m:\n if mat[x][j] == 1:\n c = 0\n while j < m and mat[x][j] == 1:\n c += 1\n j += 1\n maxi = max(maxi, c)\n else:\n j += 1\n maxr[x] = maxi\n print(max(maxr))\n\n \t \t\t\t\t\t \t\t\t \t \t\t\t \t \t \t", "def find(map):\n biggest = []\n for row in map:\n biggest.append(sizeline(row))\n return biggest\n\ndef sizeline(row):\n count = 0\n big = 0\n for item in row:\n if item == 1:\n count += 1\n big = max(big,count)\n else: count = 0\n return big\n\na,b,c = map(int, input().split())\nmapa = [list(map(int, input().split())) for i in range(a)]\nbiggest = find(mapa)\nmaxi = max(biggest)\nfor i in range(c):\n x,y = map(int, input().split())\n mapa[x-1][y-1] = mapa[x-1][y-1]*-1 + 1\n biggest[x-1] = sizeline(mapa[x-1])\n print(max(biggest))\n\n\t\t \t\t \t\t \t \t \t\t \t\t\t\t \t\t", "n,m,q = map(int, input().split())\n\nmatriz = []\nmaximos = []\n\nfor i in range(n):\n linha = input().split()\n maximos += [max(map(len, \"\".join(linha).split('0')))]\n matriz += [linha]\n\nfor _ in range(q):\n i, j = map(int, input().split())\n i -= 1\n j -= 1\n if matriz[i][j] == '1':\n matriz[i][j] = '0'\n else:\n matriz[i][j] = '1'\n maximos[i] = max(map(len, \"\".join(matriz[i]).split('0')))\n print(max(maximos))\n\n\n\n\n", "n, m, q = [int(token) for token in input().split()]\n\ng = []\n\nfor _ in range(n):\n row = [int(token) for token in input().split()]\n g.append(row)\n\n\ndef row_score(row):\n max_count = 0\n count = 0\n for item in row:\n if item == 1:\n count += 1\n else:\n count = 0\n max_count = max(max_count, count)\n return max_count\n\n\nrow_cache = [row_score(row) for row in g]\n\n\ndef score():\n return max(\n rc for rc in row_cache\n )\n\n\nfor turn in range(q):\n i, j = [int(token) - 1 for token in input().split()]\n g[i][j] = 1 - g[i][j]\n row_cache[i] = row_score(g[i])\n print(score())", "\r\nn,m,q = map(int,input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n\tmatrix.append(list(map(int,input().split())))\r\ndp = [0 for j in range(n)]\r\n\r\nfor i in range(n):\r\n\tstreak = 0\r\n\tz = 0\r\n\tfor j in range(m):\r\n\t\tif matrix[i][j] == 1:\r\n\t\t\tstreak = streak + 1\r\n\t\t\tz = max(streak,z)\r\n\t\telse:\r\n\t\t\tz = max(streak,z)\r\n\t\t\tstreak = 0\r\n\tdp[i] = z\r\n# print(dp)\r\n\r\nfor i in range(q):\r\n\r\n\tx,y = map(int,input().split())\r\n\tmatrix[x-1][y-1] = 1-matrix[x-1][y-1]\r\n\r\n\tz = float(\"-inf\")\r\n\tstreak = 0\r\n\tfor i in range(m):\r\n\t\tif matrix[x-1][i] == 1:\r\n\t\t\tstreak = streak + 1\r\n\t\t\tz = max(streak,z)\r\n\t\telse:\r\n\t\t\tz = max(streak,z)\r\n\t\t\tstreak = 0\r\n\tdp[x-1] = z\r\n\tprint(max(dp))", "n, m, q = map(int, input().split())\na = [[]]\nfor i in range(n):\n a.append([0] + list(map(int, input().split())))\nx, y = map(int, input().split())\na[x][y] = (a[x][y] + 1) % 2\nma = 0\ncurr = 0\nfor i in range(1, n + 1):\n for j in range(1, m + 1):\n if a[i][j] == 0:\n ma = max(curr, ma)\n curr = 0\n else:\n curr += 1\n ma = max(ma, curr)\n curr = 0\nres = 0\nfor i in range(1, n + 1):\n for j in range(1, m + 1):\n if a[i][j] == 0:\n if curr == ma: res += 1\n curr = 0\n else:\n curr += 1\n if curr == ma: res += 1\n curr = 0\nprint(ma)\nfor i in range(q - 1):\n x, y = map(int, input().split())\n if a[x][y] == 1:\n j = y - 1\n here = 1\n while j >= 0 and a[x][j] == 1:\n j -= 1\n here += 1\n j = y + 1\n while j <= m and a[x][j] == 1:\n j += 1\n here += 1\n a[x][y] = 0\n if here == ma: res -=1\n if res >= 1: print(ma)\n else:\n ma = 0\n curr = 0\n for i in range(1, n + 1):\n for j in range(1, m + 1):\n if a[i][j] == 0:\n ma = max(curr, ma)\n curr = 0\n else:\n curr += 1\n ma = max(ma, curr)\n curr = 0\n res = 0\n for i in range(1, n + 1):\n for j in range(1, m + 1):\n if a[i][j] == 0:\n if curr == ma: res += 1\n curr = 0\n else:\n curr += 1\n if curr == ma: res += 1\n curr = 0\n print(ma) \n else:\n a[x][y] = 1\n j = y - 1\n here = 1\n while j >= 0 and a[x][j] == 1:\n j -= 1\n here += 1\n j = y + 1\n while j <= m and a[x][j] == 1:\n j += 1\n here += 1 \n if here > ma:\n ma = here\n res = 1\n elif here == ma:\n res += 1\n print(ma)\n \n \n", "n, m, q = map(int,input().split())\r\nms, kk = [], []\r\nmp = ms.append\r\nkkp = kk.append\r\nfor i in range(n):\r\n mp(list(map(int,input().split())))\r\n l, mm = 0, 0\r\n for j in range(m):\r\n if ms[i][j]: l+=1\r\n else:\r\n if l>mm: mm = l\r\n l = 0\r\n if l>mm: mm = l\r\n kkp(mm)\r\nfor i in range(q):\r\n y, x = map((lambda x: int(x)-1),input().split())\r\n mm, ms[y][x], l = 0, 1-ms[y][x], 0\r\n for j in range(m):\r\n if ms[y][j]: l+=1\r\n else:\r\n if l>mm: mm = l\r\n l = 0\r\n if l>mm: mm = l\r\n kk[y] = mm\r\n mm = 0\r\n for ii in kk: mm = max(mm,ii)\r\n print(mm)\r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, q = map(int, input().split())\r\ng = [input()[:-1].split() for _ in range(n)]\r\n\r\nd = []*n\r\nfor i in range(n):\r\n c = 0\r\n dx = 0\r\n for j in range(m):\r\n if g[i][j] == '1':\r\n c += 1\r\n dx = max(dx, c)\r\n else:\r\n c = 0\r\n d.append(dx)\r\n\r\nfor i in range(q):\r\n a, b = map(lambda x:int(x)-1, input().split())\r\n g[a][b] = '1' if g[a][b] == '0' else '0'\r\n c = 0\r\n dx = 0\r\n for j in range(m):\r\n if g[a][j] == '1':\r\n c += 1\r\n dx = max(dx, c)\r\n else:\r\n c = 0\r\n d[a] = dx\r\n print(max(d))", "import sys\r\nimport collections\r\nimport random\r\nimport time\r\nimport itertools\r\n\r\ninput = sys.stdin.readline\r\n# def print(val):\r\n# sys.stdout.write(str(val) + '\\n')\r\n\r\nN, M, Q = map(int, input().strip().split())\r\nA = [list(map(int, input().strip().split())) for _ in range(N)]\r\n\r\ndef consecutive_one(idx):\r\n mx = 0\r\n for k, grp in itertools.groupby(A[idx]):\r\n mx = max(mx, len(list(grp))) if k == 1 else mx\r\n return mx\r\n\r\n\r\nmax_A = [consecutive_one(i) for i in range(N)]\r\n\r\nfor query in range(Q):\r\n i, j = map(int, input().strip().split())\r\n i -= 1\r\n j -= 1\r\n A[i][j] = 1 if A[i][j] == 0 else 0\r\n max_A[i] = consecutive_one(i)\r\n print(max(max_A))\r\n\r\n", "def find_consecutive(arr):\n result = 0\n consecutive = 0\n for i in range(len(arr)):\n if (arr[i] == 1):\n consecutive += 1\n else: \n consecutive = 0\n result = max(result, consecutive)\n return result\n\nn, m, q = list(map(int, input().split()))\ngrid = []\nfor i in range(n):\n grid.append(list(map(int, input().split())))\n\ndp = []\nfor row in grid:\n dp.append(find_consecutive(row))\n\nfor tc in range(q):\n i, j = list(map(int, input().split()))\n i -= 1\n j -= 1\n if (grid[i][j] == 1):\n grid[i][j] = 0\n else:\n grid[i][j] = 1\n dp[i] = find_consecutive(grid[i])\n print(max(dp))\n\n\n", "MOD = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn,m,q=f()\r\nl=[]\r\nmaxc=[]\r\nfor _ in range(n):\r\n l.append(il())\r\n c=0 if l[-1][0]==0 else 1\r\n mx=c\r\n for i in range(1,m):\r\n if l[-1][i]==l[-1][i-1]==1:\r\n c+=1\r\n elif l[-1][i]==1:\r\n c=1\r\n else:\r\n c=0\r\n mx=max(mx,c)\r\n maxc.append(mx)\r\nfor _ in range(q):\r\n r,c=f()\r\n l[r-1][c-1]^=1\r\n c=0 if l[r-1][0]==0 else 1\r\n mx = c\r\n for i in range(1, m):\r\n if l[r-1][i] == l[r-1][i - 1] == 1:\r\n c += 1\r\n elif l[r-1][i] == 1:\r\n c = 1\r\n else:\r\n c = 0\r\n mx = max(mx, c)\r\n maxc[r-1]=mx\r\n print(max(maxc))", "def read_data():\r\n n, m, q = map(int, input().split())\r\n grid = []\r\n for i in range(n):\r\n grid.append(list(map(int, input().split())))\r\n qs = []\r\n for i in range(q):\r\n x, y = map(int, input().split())\r\n qs.append((x-1, y-1))\r\n return n, m, q, grid, qs\r\n\r\n\r\ndef max_cons(row):\r\n mc = 0\r\n tmp = 0\r\n for v in row:\r\n if v:\r\n tmp += 1\r\n else:\r\n if tmp > mc:\r\n mc = tmp\r\n tmp = 0\r\n return max(mc, tmp)\r\n\r\n\r\ndef solve(n, m, q, grid, qs):\r\n mcc = [max_cons(row) for row in grid]\r\n for x, y in qs:\r\n row = grid[x]\r\n row[y] = 1 - row[y]\r\n mcc[x] = max_cons(row)\r\n print(max(mcc))\r\n\r\nparam = read_data()\r\nsolve(*param)", "n,m,q=map(int,input().split())\r\ngrid, res =[0]*n, [0]*n \r\nfor i in range(n):\r\n row=list(map(int,input().split()))\r\n for j in range(m):\r\n grid[i]=row\r\nfor i in range(n):\r\n mx, temp = 0, 0\r\n for j in range(m):\r\n if grid[i][j]==0:\r\n temp=0\r\n else:\r\n temp+=1\r\n mx=max(temp,mx)\r\n res[i]=mx\r\nfor _ in range(q):\r\n x, y = map(int,input().split())\r\n if grid[x-1][y-1]==0:\r\n grid[x-1][y-1]=1\r\n else:\r\n grid[x-1][y-1]=0\r\n mx, temp = 0, 0\r\n for j in range(m):\r\n if grid[x-1][j]==0:\r\n temp=0\r\n else:\r\n temp+=1\r\n mx=max(temp,mx)\r\n res[x-1]=mx\r\n print(max(res))", "def find(map):\n big = []\n for row in map:\n big.append(sizeline(row))\n return big\n\ndef sizeline(r):\n count = 0\n big = 0\n for item in r:\n if item == 1:\n count+=1\n big = max(big, count)\n else: count = 0\n return big\n\n\na,b,c = map(int, input().split())\nmapa = [list(map(int, input().split())) for i in range(a)]\nbig = find(mapa)\nmaximo = max(big)\nfor i in range(c):\n x,y = map(int, input().split())\n mapa[x-1][y-1] = mapa[x-1][y-1]*-1 + 1\n big[x-1] = sizeline(mapa[x-1])\n print(max(big))\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\ndef abhi():\r\n\r\n\r\n \r\n\r\n roe=[0]*n\r\n for j in range(n):\r\n ans=0\r\n if m==1:\r\n ans= max(ans,t[j][0])\r\n else:\r\n temp=t[j][0]\r\n for k in range(1,m):\r\n if t[j][k-1]==1 and t[j][k]==1:\r\n temp+=1\r\n else:\r\n ans= max(temp,ans)\r\n temp=t[j][k]\r\n ans=max(temp,ans)\r\n roe[j]=ans\r\n return roe\r\n \r\n\r\n\r\n\r\nn,m,q= map(int,input().split())\r\n\r\n\r\nt=[]\r\n\r\nfor j in range(n):\r\n t.append(list(map(int,input().split())))\r\n\r\n\r\nrow=abhi()\r\n\r\n\r\nfor j in range(q):\r\n a,b= map(int,input().split())\r\n\r\n a-=1\r\n b-=1\r\n\r\n t[a][b]= abs(1-t[a][b])\r\n\r\n ans1=0\r\n mx=0\r\n \r\n for j in range(m):\r\n if j==0:\r\n ans1=t[a][j]\r\n else:\r\n if t[a][j]==1:\r\n ans1+=1\r\n else:\r\n mx=max(mx,ans1)\r\n ans1=t[a][j]\r\n mx=max(ans1,mx)\r\n row[a]=(mx)\r\n\r\n print(max(row))\r\n\r\n\r\n", "n,m,q = list(map(int,input().split()))\r\n\r\ngrid = []\r\nfor _ in range(n):\r\n row = list(map(int,input().split()))\r\n grid.append(row)\r\n\r\ndef consecutive_one(row_number):\r\n ans = 0\r\n c = 0\r\n for j in range(m):\r\n if grid[row_number][j] == 0:\r\n c = 0\r\n else:\r\n c += 1\r\n ans = max(ans, c)\r\n return ans\r\n\r\nvalues = []\r\nfor i in range(n):\r\n values.append(consecutive_one(i))\r\n\r\nfor _ in range(q):\r\n i,j = list(map(int, input().split()))\r\n if(grid[i-1][j-1]):\r\n grid[i-1][j-1] = 0\r\n else:\r\n grid[i-1][j-1] = 1\r\n \r\n values[i-1] = consecutive_one(i-1)\r\n \r\n print(max(values))", "n,m,q = [int(i) for i in input().split()]\r\na = [input().split() for i in range(n)]\r\nf = lambda s: max(map(len,\"\".join(s).split('0')))\r\ns = list(map(f,a))\r\n\r\nfor i in range(q):\r\n x,y = [int(i) for i in input().split()]\r\n x-=1\r\n y-=1\r\n a[x][y] = str(1-int(a[x][y]))\r\n s[x] = f(a[x])\r\n print(max(s))", "n, m, q = [int(i) for i in input().split()]\r\n \r\nmatrix = []\r\nfor i in range(n):\r\n \r\n matrix.append([int(i) for i in input().split()])\r\n \r\nmaxprrow = []\r\nfor a in range(n):\r\n maxrow = 0\r\n max_max = 0\r\n for b in range(m):\r\n if matrix[a][b] == 1:\r\n maxrow += 1\r\n if maxrow > max_max:\r\n max_max = maxrow\r\n else:\r\n maxrow = 0\r\n maxprrow.append(max_max)\r\n \r\nwiner = []\r\nfor step in range(q):\r\n i, j = [int(c) for c in input().split()]\r\n matrix[i-1][j-1] = 1 - matrix[i-1][j-1]\r\n \r\n max_max , maxrow = 0,0\r\n\r\n \r\n for b in range(m):\r\n if matrix[i-1][b] == 1:\r\n maxrow += 1\r\n if maxrow > max_max:\r\n max_max = maxrow\r\n else:\r\n maxrow = 0\r\n maxprrow[i-1] = max_max\r\n winer.append(max(maxprrow))\r\n \r\nfor w in winer:\r\n print(w)", "def su(grid):\r\n ans, l = 0, 0\r\n for v in grid:\r\n if v == 1:\r\n l += 1\r\n else:\r\n l = 0\r\n ans = max(l, ans)\r\n return ans\r\n\r\n\r\nn, m, q = map(int, input().split(\" \"))\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(map(int, input().split())))\r\ns = list(map(su, grid))\r\nfor _ in range(q):\r\n i, j = map(int, input().split(\" \"))\r\n i, j = i - 1, j - 1\r\n if grid[i][j] == 0:\r\n s[i] += 1\r\n else:\r\n s[i] -= 1\r\n grid[i][j] = 1 - grid[i][j]\r\n s[i] = su(grid[i])\r\n print(max(s))\r\n", "def score(R) :\r\n val = 0\r\n ret = 0\r\n for i in R :\r\n if i :\r\n val += 1\r\n ret = max(ret, val)\r\n else :\r\n val = 0\r\n return ret\r\n\r\nn, m, q = map(int, input().split())\r\nA = [list(map(int, input().split())) for i in range(n)]\r\nB = [score(A[i]) for i in range(n)]\r\nfor _ in range(q) :\r\n x, y = map(int, input().split())\r\n x, y = x-1, y-1\r\n A[x][y] = not A[x][y]\r\n B[x] = score(A[x])\r\n print(max(B))\r\n", "import math\r\ndef linescore(line):\r\n acc = 0\r\n ret = 0\r\n for eye in line:\r\n if eye:\r\n acc += 1\r\n ret = max(ret, acc)\r\n else:\r\n acc = 0\r\n return ret\r\n \r\ndef main():\r\n items = input().split()\r\n n = int(items[0])\r\n m = int(items[1])\r\n q = int(items[2])\r\n e = [[None for _ in range(m)] for _ in range(n)]\r\n ls = [0 for _ in range(n)]\r\n for i in range(n):\r\n items = input().split()\r\n for j in range(m):\r\n e[i][j] = (items[j]=='1')\r\n for i in range(n):\r\n ls[i] = linescore(e[i])\r\n for qi in range(q):\r\n items = input().split()\r\n x = int(items[0])-1\r\n y = int(items[1])-1\r\n e[x][y] = not e[x][y]\r\n ls[x] = linescore(e[x])\r\n print(max(ls))\r\n \r\nif __name__ == '__main__':\r\n main()\r\n ", "def calc(li,m):\r\n ans=0\r\n count=0\r\n for i in range(m):\r\n if li[i]==1:\r\n count+=1\r\n else:\r\n count=0\r\n ans=max(ans,count)\r\n return ans\r\n\r\nn,m,q=map(int,input().split())\r\nadj=[]\r\nfor i in range(n):\r\n li=list(map(int,input().split()))\r\n adj.append(li)\r\nrow=[0]*n\r\nfor i in range(n):\r\n row[i]=calc(adj[i],m)\r\n\r\nfor _ in range(q):\r\n r,c=map(int,input().split())\r\n r-=1\r\n c-=1\r\n adj[r][c]=1-adj[r][c]\r\n row[r]=calc(adj[r],m)\r\n ans=max(row)\r\n print(ans)\r\n\r\n \r\n\r\n\r\n", "__author__ = 'Andrey'\n\n\ndef retest(row):\n global table\n row_n = table[row]\n m_ax = 0\n curr = 0\n for item in row_n:\n if item == 1:\n curr += 1\n if item == 0:\n m_ax = max(curr, m_ax)\n curr = 0\n m_ax = max(curr, m_ax)\n return m_ax\n\n\nn, m, q = map(int, input().split())\ntable = []\nfor x in range(n):\n table.append(list(map(int, input().split())))\nmaximums = []\nfor y in range(n):\n maximums.append(retest(y))\nfor z in range(q):\n i, j = map(int, input().split())\n table[i - 1][j - 1] = 1 - table[i - 1][j - 1]\n maximums[i - 1] = retest(i - 1)\n print(max(maximums))\n", "n, m, q = map(int, input().split())\ngrids = []\nmaximos = []\nfor i in range(n):\n grids.append(input().split())\n maximos += [max(map(len, \"\".join(grids[i]).split('0')))]\n\nfor i in range(q):\n line, column = map(int, input().split())\n line = line-1\n column = column-1\n if grids[line][column] == '1':\n grids[line][column] = '0'\n else:\n grids[line][column] = '1'\n maximos[line] = max(map(len, \"\".join(grids[line]).split('0')))\n print(max(maximos))\n\t \t \t \t \t\t\t \t \t \t\t\t\t \t\t\t\t\t \t", "n, m, q = map(int, input().split())\r\ns = [input().split() for i in range(n)]\r\nf = lambda i: max(map(len, (''.join(s[i]).split('0'))))\r\na = list(map(f, range(n)))\r\nfor i in range(q):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n s[x][y] = '1' if s[x][y] == '0' else '0'\r\n a[x] = f(x)\r\n print(max(a))", "def main():\n n, m, q = map(int, input().split())\n l = [[c == '1' for c in input()[::2]] for _ in range(n)]\n\n def f(ro):\n res = z = 0\n for t in ro:\n if t:\n z += 1\n else:\n if res < z:\n res = z\n z = 0\n if res < z:\n res = z\n return res\n\n f_rows = list(map(f, l))\n cnt = [0] * (m + 1)\n for r in f_rows:\n cnt[r] += 1\n m = str(max(f_rows))\n res = []\n for _ in range(q):\n y, x = map(int, input().split())\n x -= 1\n y -= 1\n row, s0 = l[y], f_rows[y]\n row[x] ^= True\n s1 = f(row)\n if s1 != s0:\n f_rows[y] = s1\n m = str(max(f_rows))\n res.append(m)\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline \r\n\r\n\r\ndef find(i, l, m):\r\n ans, c = 0, 1 if l[i][0] == 1 else 0 \r\n for j in range(1, m):\r\n if(l[i][j] == 1):\r\n c += 1 \r\n else:\r\n ans = max(ans, c) \r\n c = 0 \r\n ans = max(ans, c) \r\n return ans\r\n \r\n \r\nn, m, q = map(int, input().split()) \r\nl = []\r\n\r\nfor i in range(n):\r\n l.append(list(map(int, input().split()))) \r\n \r\nrow = [] \r\nfor i in range(n):\r\n row.append(find(i, l, m))\r\nfor i in range(q):\r\n x, y = map(int, input().split()) \r\n x -= 1 \r\n y -= 1 \r\n l[x][y] = 1 - l[x][y] \r\n row[x] = find(x, l, m) \r\n print(max(row))\r\n \r\n\r\n\r\n ", "def cal(l) :\r\n t = 0 ;\r\n r = 0 ;\r\n for i in range(len(l)) :\r\n if l[i]=='1' :\r\n t+=1\r\n r = max(r,t)\r\n else :\r\n t = 0\r\n return r\r\n\r\ndef maxll(l) :\r\n r = 0 ;\r\n for i in l :\r\n r = max(r,i)\r\n return r\r\n\r\ninp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\nq = int(inp[2])\r\ncount = [0 for i in range(n)]\r\na = [ ['' for i in range(m)] for j in range(n)]\r\nfor i in range(n) :\r\n s = input().split()\r\n a[i] = s\r\n count[i] = cal(a[i])\r\nfor i in range(q) :\r\n s = input().split()\r\n x = int(s[0])\r\n y = int(s[1])\r\n if a[x-1][y-1] == '1' : a[x-1][y-1] = '0'\r\n else : a[x-1][y-1] = '1'\r\n count[x-1] = cal(a[x-1])\r\n print(maxll(count))\r\n \r\n", "n,m,q = map(int,input().split())\r\ng = [ [0] * m for i in range(0,n)]\r\ncnt = [0] *n\r\nfor i in range(0, n):\r\n g[i] = list(map(int, input().split()))\r\n\r\n\r\nfor i in range(0, n):\r\n c = 0\r\n for j in range(0, m):\r\n if g[i][j] == 0:\r\n if c > cnt[i]:\r\n cnt[i] = c\r\n c = -1\r\n c+=1\r\n if c > cnt[i]:\r\n cnt[i] = c\r\n\r\nfor i in range(0, q):\r\n r,c = map(int, input().split())\r\n r-=1;\r\n c-=1\r\n g[r][c] = not g[r][c]\r\n cnt[r] = 0\r\n c = 0\r\n for j in range(0, m):\r\n if g[r][j] == 0:\r\n if c > cnt[r]:\r\n cnt[r] = c\r\n c = -1\r\n c+=1\r\n if c > cnt[r]:\r\n cnt[r] = c\r\n print(max(cnt))\r\n", "def rowscore(row):\n global rows\n maximum = 0\n streak = 0\n for i in rows[row]:\n if i == 1:\n streak += 1\n if streak > maximum:\n maximum = streak\n else:\n streak = 0\n return maximum\n\nnrows, ncols, nque = map(int, input().split())\nrows = [list(map(int, input().split())) for _ in range(nrows)]\n\nscores = [rowscore(i) for i in range(nrows)]\nfor i in range(nque):\n r, c = map(int, input().split())\n r -= 1\n c -= 1\n rows[r][c] = 1 - rows[r][c]\n scores[r] = rowscore(r)\n print(max(scores))\n \t\t \t\t\t \t\t\t \t \t\t\t \t \t \t\t", "l=lambda s:max(map(len,\"\".join(s).split('0')))\r\nn,m,q=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(input().split())\r\nb=list(map(l,a))\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n a[x-1][y-1]=str(1-int(a[x-1][y-1]))\r\n b[x-1]=l(a[x-1])\r\n print(max(b))", "from sys import stdin\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\ndef calcMax(a):\r\n ret = cur = 0\r\n for i, v in enumerate(a):\r\n if v == 1:\r\n cur += 1\r\n else:\r\n cur = 0\r\n ret = max(ret, cur)\r\n return ret\r\n\r\nsizeI, sizeJ, nQ = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(sizeI)]\r\nret = []\r\ncnt = [calcMax(r) for r in a]\r\nfor _ in range(nQ):\r\n i, j = map(lambda x: int(x) - 1, input().split())\r\n a[i][j] ^= 1\r\n cnt[i] = calcMax(a[i])\r\n ret.append('%d' % max(cnt))\r\nprint('\\n'.join(ret))\r\n", "n, m, q = input().split()\nn = int(n)\nm = int(m)\nq = int(q)\na = []\n\nfor i in range(n):\n b = input().split()\n for j in range(m):\n b[j] = int(b[j])\n a.append(b)\n\ndef func(i):\n ans = 0\n l = -1\n for j in range(m):\n if a[i][j] == 0:\n l = j\n else:\n ans = max(ans, j - l)\n return ans\n\nc = list(map(func, range(n)))\n\nfor i in range(q):\n z, x = map(int, input().split())\n z -= 1\n x -= 1\n a[z][x] = 1 - a[z][x]\n c[z] = func(z)\n print(max(c))\n\n", "def kadane(lst):\n ans = s = 0\n for n in lst:\n if n == 0:\n ans = max(ans, s)\n s = 0\n else:\n s += 1\n return max(ans, s)\n\nif __name__ == '__main__':\n n,m,q = map(int, input().split())\n f = []\n best = []\n\n for _ in range(n):\n l = list(map(int, input().split()))\n f.append(l)\n best.append(kadane(l))\n \n for _ in range(q):\n i,j = map(int, input().split())\n f[i-1][j-1] = (f[i-1][j-1] + 1) % 2\n best[i-1] = kadane(f[i-1])\n print(max(best))", "def func(lst):\r\n summ = 0\r\n maxi = 0\r\n for i in range(m):\r\n if lst[i]==0:\r\n summ = 0\r\n else:\r\n summ += 1\r\n if maxi<summ:\r\n maxi = summ\r\n return maxi\r\nn,m,q = map(int,input().split())\r\narr = []\r\nfor i in range(n):\r\n lst = list(map(int,input().split()))\r\n sm = func(lst)\r\n lst.append(sm)\r\n arr.append(lst)\r\nfor i in range(q):\r\n maxim = 0\r\n x,y = map(int,input().split())\r\n x,y = x-1,y-1\r\n arr[x][y] = (arr[x][y]+1)%2\r\n del arr[x][-1]\r\n sm = func(arr[x])\r\n arr[x].append(sm)\r\n for j in range(n):\r\n if arr[j][-1]>maxim:\r\n maxim = arr[j][-1]\r\n print(maxim)", "controles = list(map(int, input().split()))\nnumPalavras = controles[0]\ntamanho = controles[1]\ncomando = controles[2]\ncontador = [0]*numPalavras\npalavras = []\nfor a in range(numPalavras):\n num1 = 0\n atual = list(map(int, input().split()))\n palavras.append(atual)\n for b in range(tamanho):\n if atual[b] == 1:\n num1 +=1\n if num1 > contador[a]:\n contador[a] = num1\n else:\n num1 = 0\nfor c in range(comando):\n davez = list(map(int, input().split()))\n palavras[davez[0]-1][davez[1]-1] = 1 - palavras[davez[0]-1][davez[1]-1]\n num1 = 0\n maior = 0\n for c in range(tamanho):\n \n if palavras[davez[0]-1 ][c] == 1:\n num1 +=1\n if num1 > maior:\n maior = num1\n else:\n num1 = 0\n contador[davez[0]-1] = maior\n\n print(max(contador))\n\n\n \t \t \t \t \t\t\t \t", "n, m ,q = map(int, input().split())\r\nmatriz = [list(map(int, input().split())) for i in range(n)]\r\n\r\ndef calc(i):\r\n resp = 0\r\n l = -1\r\n for j in range(m):\r\n if matriz[i][j] == 0:\r\n l = j\r\n else:\r\n resp = max(resp, j - l)\r\n return resp\r\n\r\nlinha = list(map(calc, range(n)))\r\n\r\nfor i in range(q):\r\n y, x = map(int, input().split())\r\n y -= 1\r\n x -= 1\r\n matriz[y][x] = 1 - matriz[y][x]\r\n linha[y] = calc(y)\r\n print(max(linha))", "'''\r\nMaximum number of consecutive 1's\r\n'''\r\nml = lambda s: max(map(len,\"\".join(s).split('0')))\r\nn,m,q = map(int,input().split())\r\narr = []\r\nl = [0]*n\r\nfor i in range(n):\r\n a = list(input().split())\r\n arr.append(a)\r\n l[i] = ml(a)\r\nfor i in range(q):\r\n a,b = map(int,input().split())\r\n a-=1\r\n b-=1\r\n arr[a][b] = str(int(arr[a][b])^1)\r\n l[a] = ml(arr[a])\r\n print(max(l))\r\n \r\n", "n, m, q = map(int, input().split())\r\nbears = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\ndef max_consecutive(arr):\r\n long = 0\r\n curr = 0\r\n for val in arr:\r\n if val:\r\n curr += 1\r\n else:\r\n long = max(curr, long)\r\n curr = 0\r\n return max(long, curr)\r\n\r\n\r\nmax_cons_ears = [max_consecutive(bear_row) for bear_row in bears]\r\n\r\nfor _ in range(q):\r\n i, j = map(int, input().split())\r\n i -= 1\r\n j -= 1\r\n bears[i][j] = 0 if bears[i][j] == 1 else 1\r\n max_cons_ears[i] = max_consecutive(bears[i])\r\n print(max(max_cons_ears))", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef change(x):\r\n c, mem[x] = 0, 0\r\n for j in grid[x]:\r\n if j:\r\n c += 1\r\n else:\r\n mem[x] = max(mem[x], c)\r\n c = 0\r\n mem[x] = max(mem[x], c)\r\n return mem[x]\r\n\r\n\r\nfrom sys import stdin\r\nfrom collections import defaultdict\r\n\r\nn, m, q = arr_inp()\r\ngrid = [arr_inp() for i in range(n)]\r\nmem = defaultdict(int)\r\n\r\nfor i in range(n):\r\n mem[i] = change(i)\r\n# print(mem)\r\n\r\nfor i in range(q):\r\n r, c = arr_inp()\r\n r -= 1\r\n c -= 1\r\n if grid[r][c]:\r\n grid[r][c] = 0\r\n else:\r\n grid[r][c] = 1\r\n mem[r] = change(r)\r\n print(max(mem.values()))\r\n", "def count_max(start, finish):\n mx = 0\n pos = 0\n for i in range(start, finish):\n s = ''.join(a[i])\n s = s.split('0')\n for j in s:\n l = len(j)\n if l > mx:\n mx = l\n pos = i\n return(mx, pos)\n\n\ndef count(c, d):\n v = 0\n t = d\n while (t != -1) and (a[c][t] == '1'):\n v += 1\n t -= 1\n t = d\n while (t != m) and (a[c][t] == '1'):\n v += 1\n t += 1\n if a[c][d] == '1':\n v -= 1\n return v\n\nn, m, q = map(int, input().split())\na = []\nfor i in range(n):\n a.append(input().split())\nmx, pos = count_max(0, n)\n\nfor i in range(q):\n c, d = map(int, input().split())\n c -= 1\n d -= 1\n a[c][d] = str(1 - int(a[c][d]))\n if c == pos:\n mx, pos = count_max(0, n)\n else:\n v = count(c, d)\n if v > mx:\n mx = v\n pos = c\n print(mx)", "R = lambda: map(int, input().split())\r\nn, m, q = R()\r\ns = [input().split() for i in range(n)]\r\nF = lambda i: max(map(len, (''.join(s[i]).split('0'))))\r\na = list(map(F, range(n)))\r\nfor i in range(q):\r\n x, y = R()\r\n x, y = x - 1, y - 1\r\n s[x][y] = '1' if s[x][y] == '0' else '0'\r\n a[x] = F(x)\r\n print(max(a))", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,m,q=(int(i) for i in input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append([int(i) for i in input().split()])\r\nl1=[]\r\nfor i in range(n):\r\n c=0\r\n m1=0\r\n for j in range(m):\r\n if(l[i][j]==1):\r\n c+=1\r\n else:\r\n m1=max(m1,c)\r\n c=0\r\n m1=max(m1,c)\r\n l1.append(m1)\r\nfor w in range(q):\r\n x,y=(int(i) for i in input().split())\r\n l[x-1][y-1]=(l[x-1][y-1]+1)%2\r\n c=0\r\n m1=0\r\n for j in range(m):\r\n if(l[x-1][j]==1):\r\n c+=1\r\n else:\r\n m1=max(m1,c)\r\n c=0\r\n m1=max(m1,c)\r\n l1[x-1]=m1\r\n print(max(l1))", "'''input\n5 4 5\n0 1 1 0\n1 0 0 1\n0 1 1 0\n1 0 0 1\n0 0 0 0\n1 1\n1 4\n1 1\n4 2\n4 3\n'''\n\nfrom sys import stdin\n\n\ndef counter(num):\n\tif num == 0:\n\t\treturn 1\n\telse:\n\t\treturn 0\n\ndef find_max(arr):\n\tmx = 0\n\ttemp = 0\n\tfor i in range(len(arr)):\n\t\tif temp >= 1:\n\t\t\tif arr[i] == 0:\n\t\t\t\ttemp = 0\n\t\t\telse:\n\t\t\t\ttemp += 1\n\n\t\telif arr[i] == 1:\n\t\t\ttemp = 1\n\t\telif arr[i] == 0:\n\t\t\ttemp = 0\n\t\t# print(arr[i], temp)\n\t\t\n\t\tmx = max(temp, mx)\n\treturn mx\n\n\n\ndef get_it(matrix):\n\taux = []\n\tfor i in range(n):\n\t\taux.append(find_max(matrix[i]))\n\treturn aux\n\n\n# main starts\nn, m, q = list(map(int, stdin.readline().split()))\nmatrix = []\nfor _ in range(n):\n\tmatrix.append(list(map(int, stdin.readline().split())))\n\ncon_eye = get_it(matrix)\n# print(con_eye)\nfor _ in range(q):\n\ti, j = list(map(int, stdin.readline().split()))\n\ti -= 1;\tj -= 1\n\tmatrix[i][j] = counter(matrix[i][j])\n\tcon_eye[i] = find_max(matrix[i])\n\tprint(max(con_eye))\n\n", "def conta(mat):\n\tcombo = 0\n\tmaior = 0\n\tfor l in range(len(mat)):\n\t\tif mat[l]==1:\n\t\t\tcombo+=1\n\t\telif combo>0:\n\t\t\tif combo>maior:\n\t\t\t\tmaior = combo\n\t\t\tcombo =0\n\n\tif combo>maior:\n\t\tmaior = combo\n\treturn maior\n\n\ni,j,t = [int(z) for z in input().split(\" \")]\nmatriz= []\nM = []\nfor i1 in range(i):\n\tvalor =[int(z) for z in input().split(\" \")]\n\tmatriz.append(valor)\n\tM.append(conta(valor))\ncpy = matriz[:]\nfor q in range(t):\n\tn,m = [int(z) for z in input().split(\" \")]\n\tif cpy[n-1][m-1]==1:\n\t\tcpy[n-1][m-1]=0\n\telse:\n\t\tcpy[n-1][m-1]=1\n\ttes = conta(cpy[n-1])\n\tM[n-1] = tes\n\tprint(max(M))\n", "n, m, q = map(int, input().split())\r\n \r\narr = []\r\nscores = []\r\n \r\ndef get_score(line):\r\n cur_score = 0\r\n max_score = 0\r\n for e in line:\r\n if e == 1:\r\n cur_score += 1\r\n else:\r\n max_score = max(max_score, cur_score)\r\n cur_score = 0\r\n max_score = max(max_score, cur_score)\r\n return max_score\r\n \r\nfor _ in range(n):\r\n si = list(map(int, input().split()))\r\n arr.append(si)\r\n scores.append(get_score(si))\r\n \r\nfor _ in range(q):\r\n i, j = map(int, input().split())\r\n arr[i - 1][j - 1] = int(not arr[i - 1][j - 1])\r\n scores[i - 1] = get_score(arr[i - 1])\r\n\r\n max_score = max(scores)\r\n print(max_score)", "n, m, q = [int(i) for i in input().split()]\nt = []\nu = []\nfor i in range(n):\n t.append([int(i) for i in input().split()])\n s = 0\n o = 0\n for k in t[-1]:\n if k == 1:\n s+=1\n o = max(s, o)\n else:\n s = 0\n u.append(o)\nanswer = []\nfor i in range(q):\n a, b = [int(i)-1 for i in input().split()]\n if t[a][b] == 1:\n t[a][b] = 0\n else:\n t[a][b] = 1\n s = 0\n o = 0\n for k in t[a]:\n if k == 1:\n s+=1\n o = max(s, o)\n else:\n s = 0\n u[a] = o\n answer.append(max(u))\nfor i in answer:\n print(i)\n", "def fff(i):\n global a\n global m\n t=0\n max=0\n for j in range(m+1):\n if a[i][j]==0:\n if t>max:\n max=t\n t=0\n else:\n t=t+1\n return max\n\nn,m,q=map(int,input().split())\na=[]\ns=[]\nfor i in range(0,n):\n w=list(map(int,input().split()))\n w.append(0)\n a.append(w)\n s.append(fff(i))\nfor i in range(q):\n x,y=map(int, input().split())\n a[x-1][y-1]=(a[x-1][y-1]+1)%2\n s[x-1]=fff(x-1)\n print(max(s))\n \n\n", "def max_ones(a):\n count=0\n max_count=0\n for i in range(len(a)):\n if(a[i]==0):\n count=0\n else:\n count+=1\n max_count=max(count,max_count)\n max_count=max(count,max_count)\n return max_count\n \nn,m,q=list(map(int,input().split()))\nl=[]\nfor i in range(n):\n l.append(list(map(int,input().split())))\ncurr_max=[]\nfor i in range(n):\n curr_max.append(max_ones(l[i]))\nfor i in range(q):\n r,c=list(map(int,input().split()))\n \n l[r-1][c-1]^=1\n curr_max[r-1]=max_ones(l[r-1])\n print(max(curr_max))\n \n \n \t \t\t \t\t\t \t\t \t\t\t\t \t \t \t", "def score(arr):\n n = len(arr)\n max_ = 0\n curr = 0\n for i in range(n):\n if arr[i] == 1:\n curr += 1\n else:\n curr = 0\n max_ = max(max_, curr)\n return max_\n\nn, m, q = map(int, input().split())\na = []\nfor _ in range(n):\n a.append([int(i) for i in input().split()])\n\nm = {}\nfor i in range(n):\n m[i] = score(a[i])\n\nfor _ in range(q):\n i, j = map(int, input().split())\n i -= 1\n j -= 1\n a[i][j] = 1 - a[i][j]\n m[i] = score(a[i])\n print(max(m.values()))\n", "n, m, q = map(int, input().split())\n\ndef csum(row):\n\treturn max(map(len, row.split(\"0\")))\n\ngrid = [''.join(input().split()) for i in range(n)]\nscore = [max(map(len, row.split('0'))) for row in grid]\n\nfor i in range(q):\n\ti, j = map(int, input().split())\n\trow = grid[i - 1]\n\trow = row[:j - 1] + (\"1\" if row[j - 1] == \"0\" else \"0\") + row[j: ]\n\tgrid[i - 1] = row\n\tscore[i - 1] = csum(row)\n\tprint(max(score))", "n,m,q=map(int,input().split())\r\nmat=[]\r\nfor i in range(n):\r\n mat.append([int(i) for i in input().split()])\r\nmaxr=[0]*n \r\nfor i in range(n):\r\n j=0 \r\n maxi=0\r\n while j<m:\r\n if mat[i][j]==1:\r\n c=0\r\n while j<m and mat[i][j]==1:\r\n c+=1 \r\n j+=1 \r\n maxi=max(maxi,c)\r\n else:\r\n j+=1 \r\n maxr[i]=maxi\r\nfor i in range(q):\r\n x,y=map(int,input().split())\r\n x-=1 \r\n y-=1 \r\n mat[x][y]=1-mat[x][y]\r\n maxi= 0 \r\n j=0 \r\n while j<m :\r\n if mat[x][j]==1:\r\n c=0\r\n while j<m and mat[x][j]==1:\r\n c+=1 \r\n j+=1\r\n maxi=max(maxi,c)\r\n else:\r\n j+=1 \r\n maxr[x]=maxi\r\n print(max(maxr))", "# map(int, input().split(\" \"))\r\nn, m, q = map(int, input().split(\" \"))\r\na = []\r\n\r\n\r\ndef cons_ones(l, m):\r\n ans = 0\r\n c = 0\r\n for i in range(m):\r\n if l[i] == 1:\r\n c += 1\r\n else:\r\n ans = max(ans, c)\r\n c = 0\r\n ans = max(ans, c)\r\n return ans\r\n\r\n\r\nanss = []\r\nfor i in range(n):\r\n s = list(map(int, input().split(\" \")))\r\n anss.append(cons_ones(s, m))\r\n a.append(s)\r\n\r\nfor i in range(q):\r\n x, y = map(int, input().split(\" \"))\r\n x -= 1\r\n y -= 1\r\n if a[x][y]:\r\n a[x][y] = 0\r\n else:\r\n a[x][y] = 1\r\n anss[x] = cons_ones(a[x], m)\r\n print(max(anss))", "r=lambda:input().split()\r\ng=lambda s:max(map(len,\"\".join(s).split('0')))\r\nn,m,q=map(int,r())\r\na=[r() for nn in range(n)]\r\nb=list(map(g,a))\r\nfor qq in range(q):\r\n x,y=map(int,r())\r\n a[x-1][y-1]=str(1-int(a[x-1][y-1]))\r\n b[x-1]=g(a[x-1])\r\n print(max(b))", "# cook your dish here\r\nn,m,q=list(map(int,input().split()))\r\ng=[]\r\nfor i in range(n):\r\n g.append(list(map(int,input().split())))\r\nct=[]\r\nfor i in range(n):\r\n j=0\r\n ma=0\r\n while j<m:\r\n if g[i][j]==1:\r\n c=0\r\n while g[i][j]==1:\r\n c=c+1\r\n j=j+1\r\n if j==m:\r\n break\r\n ma=max(ma,c)\r\n else:\r\n j=j+1\r\n ct.append(ma)\r\nfor k in range(q):\r\n i,j=list(map(int,input().split()))\r\n i,j=i-1,j-1\r\n g[i][j]=0 if g[i][j]==1 else 1\r\n j=0\r\n ma=0\r\n while j<m:\r\n if g[i][j]==1:\r\n c=0\r\n while g[i][j]==1:\r\n c=c+1\r\n j=j+1\r\n if j==m:\r\n break\r\n ma=max(ma,c)\r\n else:\r\n j=j+1\r\n ct[i]=ma\r\n print(max(ct))", "#!/usr/bin/env python3\nimport sys\n\nN, M, Q = input().split()\nN = int(N)\nM = int(M)\nQ = int(Q)\n\nrows = []\nscore_of_row = []\n\ndef score(row):\n score_so_far = 0\n max_score = float('-inf')\n\n for r in row:\n if r == 0:\n score_so_far = 0\n else:\n score_so_far += 1\n max_score = max(max_score, score_so_far)\n\n return max_score\n\n\nfor _ in range(N):\n row = [int(x) for x in input().split()]\n rows += [row]\n score_of_row += [score(row)]\n\nfor _ in range(Q):\n r, c = input().split()\n r, c = int(r), int(c)\n\n rows[r-1][c-1] = 1 - rows[r-1][c-1]\n score_of_row[r-1] = score(rows[r-1])\n\n print(max(score_of_row))", "import re\n\ndef maxString(a,i,n):\n\ts2 = ''.join(a[i])\n\tif '1' not in s2:\n\t\treturn 0\n\tr = len(max(re.findall(\"1+\",s2),key=len))\n\treturn r\n\ndef flip(x):\n\tif(x == '1'):\n\t\treturn '0'\n\telse:\n\t\treturn '1'\n\nn,m,q = map(int,input().split())\n\na = []\nx = []\n\nfor i in range(n):\n\tx = list(input().split())\n\ta.append(x)\n\ny = []\n\nfor i in range(n):\n\ty.append(maxString(a,i,n))\n\n#print(y)\nz = max(y)\nr = y.index(z)\n\nfor i in range(q):\n\tx1,y1 = map(int,input().split())\n\ta[x1-1][y1-1] = flip(a[x1-1][y1-1])\n\ty[x1-1] = maxString(a,x1-1,n)\n\tz = max(y)\n\tprint(z)", "def conta1(matriz, iD):\n resp = 0\n var = 0\n for c in matriz[iD]:\n if(c == '0'):\n resp = max(var, resp)\n var = 0\n else:\n var += 1\n resp = max(var, resp)\n return resp\n\n\nn, m, q = map(int, input().split())\n\ngrid = []\nfor c in range(n):\n row = input().split()\n grid.append(row)\n\n#pre-processamento\nsequencias = [0] * n\nfor c in range(n):\n sequencias[c] = conta1(grid, c)\n \n#funcionalidade \nfor c in range(q):\n i, j = map(int, input().split())\n i-=1\n j-=1\n\n #alteracao\n if(grid[i][j] == '0'):\n grid[i][j] = '1'\n else:\n grid[i][j] = '0'\n\n #verificacao\n ac = 0\n\n #redefinindo a quant. de um da linha\n sequencias[i] = conta1(grid, i)\n \n print(max(sequencias))\n\n\t\t\t \t\t \t\t\t \t \t \t\t \t \t \t\t", "n,m,q=map(int,input().split())\r\narr=[]\r\nsomme=[]\r\nfor i in range(n) :\r\n x=input().split()\r\n arr.append(x)\r\n somme.append(len(max(''.join(tuple(x)).split('0'))))\r\nfor i in range(q) :\r\n a,b=map(int,input().split())\r\n arr[a-1][b-1]=str(1-int(arr[a-1][b-1]))\r\n somme[a-1]=len(max(''.join(tuple(arr[a-1])).split('0')))\r\n print(max(somme))\r\n \r\n", "'''\r\nhave a grid\r\n\r\n0 1 1 0 ->2\r\n1 0 0 1 ->1\r\n0 1 1 0 ->2\r\n1 0 0 1 ->1\r\n0 0 0 0 ->0\r\n\r\nfind the longest streak of one in each single query you change a singe thing that is a 0 to 1 or vice versa.\r\n\r\nbasic idea is that we comute evrything independently for a single row and if we change something for a single row.\r\nthen it only changes that row and rest values do not change for a single row.\r\n\r\nO(m)\r\nand max() take again so each query would be q*(n+m)\r\nfinding longest group of one by dp.\r\n\r\none way to do is to fix the ending point and then jut find the leftmost point where they are still grp of 1\r\n i\r\n0 1 1 0\r\n\r\ndp(i)-> longest grp of one ending at i\r\n\r\nif(a[i]==0): dp(i)=0\r\nelse():\r\n you have this indiviual one\r\n 0 1 [1] 0\r\nor can do better\r\nextend some previous grp to 1 and this one is the ending\r\nif(a[i]==1) dp(i)=dp(i-1)+1\r\n'''\r\n\r\ndp=[0 for i in range(505)]\r\nmat=[]\r\n\r\ndef solve_row(i,m):\r\n w=[0 for _ in range(m+1)]\r\n w[0]=0\r\n ans=0\r\n for j in range(1,m+1):\r\n if(mat[i][j-1])==0:\r\n w[j]=0\r\n else:\r\n w[j]=w[j-1]+1\r\n ans=max(ans,w[j])\r\n dp[i]=ans\r\n\r\n\r\ndef solve():\r\n n,m,q=map(int,input().split(\" \"))\r\n for i in range(n):\r\n l=list(map(int,input().split(\" \")))\r\n mat.append(l)\r\n for i in range(n):\r\n solve_row(i,m)\r\n for _ in range(q):\r\n r,c=map(int,input().split(\" \"))\r\n r-=1\r\n c-=1\r\n mat[r][c]^=1\r\n solve_row(r,m)\r\n ans=0\r\n for j in range(n): ans=max(ans,dp[j])\r\n print(ans)\r\n\r\nsolve()\r\n", "f = lambda s: max(map(len, ''.join(s).split('0')))\r\nn, m, q = map(int, input().split())\r\na = [input().split() for i in range(n)]\r\nb = list(map(f, a))\r\nc = [list(map(int, input().split())) for i in range(q)]\r\nfor x, y in c:\r\n a[x - 1][y - 1] = str(1 - int(a[x - 1][y - 1]))\r\n b[x - 1] = f(a[x - 1])\r\n print(max(b))", "string = input()\r\na, b, n = map(int, string.split())\r\nrows = [list(map(int, input().split())) for x in range(a)]\r\ndef streak(y):\r\n streaks = []\r\n s = 0\r\n for x in y:\r\n if x == 0:\r\n streaks.append(s)\r\n s = 0\r\n else:\r\n s += 1\r\n streaks.append(s)\r\n return max(streaks)\r\nbears = [streak(x) for x in rows]\r\nscores = []\r\nfor x in range(n):\r\n string = input()\r\n numbers = string.split()\r\n p, q = int(numbers[0]) - 1, int(numbers[1]) - 1\r\n if rows[p][q] == 0:\r\n rows[p][q] = 1\r\n else:\r\n rows[p][q] = 0\r\n bears[p] = streak(rows[p])\r\n scores.append(max(bears))\r\nfor x in scores:\r\n print(x)", "n,m,q = map(int, input().split(' ')[:3])\r\n\r\nentry_idx = 1\r\n\r\nclass Entry:\r\n def __init__(self, m, M):\r\n global entry_idx\r\n self._min = m\r\n self._max = M\r\n\r\n def __str__(self):\r\n return \"[\" + str(self._min) + \"-\" + str(self._max) + \"]\"\r\n\r\n def __len__(self):\r\n return self._max - self._min + 1\r\n\r\n\r\nlines = []\r\nmaxes = []\r\n\r\nfor _ in range(n):\r\n linec = input().split(' ')\r\n line = []\r\n entry = None\r\n max_line = 0\r\n for i in range(m):\r\n c = linec[i]\r\n if c == '1':\r\n if entry:\r\n entry._max = i\r\n else:\r\n entry = Entry(i, i)\r\n if len(entry) > max_line: max_line = len(entry)\r\n else:\r\n entry = None\r\n line.append(entry)\r\n\r\n lines.append(line)\r\n\r\n maxes.append(max_line)\r\n\r\n#for line in lines:\r\n# print(list(map(str, line)))\r\n#print ()\r\n#print (maxes)\r\n#print ()\r\n\r\nfor _ in range(q):\r\n i, j = map(int, input().split(' ')[:2])\r\n i -= 1\r\n j -= 1\r\n line = lines[i]\r\n\r\n entry = line[j]\r\n\r\n if entry:\r\n line[j] = None\r\n e_left = Entry(entry._min, j-1)\r\n entry._min = j+1 # right\r\n\r\n j -= 1\r\n while j >= 0 and line[j] is entry:\r\n line[j] = e_left\r\n j -= 1\r\n\r\n M = 0\r\n for e in line:\r\n if e and len(e) > M:\r\n M = len(e)\r\n maxes[i] = M\r\n\r\n else:\r\n entry = Entry(j, j)\r\n line[j] = entry\r\n if j > 0 and line[j-1]:\r\n e_to_replace = line[j-1]\r\n entry._min = e_to_replace._min\r\n jj = j - 1\r\n while jj >= 0 and line[jj] is e_to_replace:\r\n line[jj] = entry\r\n jj -= 1\r\n if j < m-1 and line[j+1]:\r\n e_to_replace = line[j+1]\r\n entry._max = e_to_replace._max\r\n jj = j + 1\r\n while jj < m and line[jj] is e_to_replace:\r\n line[jj] = entry\r\n jj += 1\r\n if len(entry) > maxes[i]:\r\n maxes[i] = len(entry)\r\n\r\n #for line in lines:\r\n # print(list(map(str, line)))\r\n #print ()\r\n #print (maxes)\r\n #print ()\r\n print (max(maxes))\r\n #print ()", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import setrecursionlimit\nsetrecursionlimit(10**7)\n#################################################\nn,m,q=map(int, input().split())\ngrid=[0]*n\nmaxCnt=[0]*n\ndef cntmax1(seq):\n\tmaxcnt=0\n\tcnt=0\n\tfor i in seq:\n\t\tif i==1:\n\t\t\tcnt+=1\n\t\telse:\n\t\t\tcnt=0\n\t\tmaxcnt=max(cnt,maxcnt)\n\treturn maxcnt\nfor i in range(n):\n\tgrid[i]=list(map(int, input().split()))\n\tmaxCnt[i]=cntmax1(grid[i])\nfor i in range(q):\n\tx,y = map(int, input().split())\n\tx-=1\n\ty-=1\n\tgrid[x][y]^=1\n\tmaxCnt[x]=cntmax1(grid[x])\n\tprint(max(maxCnt))\n\t\n\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: I_Mike_and_Fun.py\r\n#* Folder: D:\\Code\\Python\\Codeforces\\ProblemSet\\Topic Stream Mashup Dynamic Programming\r\n#? Author: TranDucTri2003\r\n#TODO CreatedAt: 08/09/2022 22:20:01\r\n#? -----------------------------------------------------------------------------------------------------\r\n\r\nfrom collections import defaultdict\r\n\r\n\r\nn,m,q=list(map(int,input().split()))\r\nmatrix=[]\r\nfor i in range(n+1):\r\n matrix.append([])\r\n for j in range(m+1):\r\n matrix[i].append(0)\r\n\r\n\r\nfor i in range(1,n+1):\r\n a=list(map(int,input().split()))\r\n for j in range(m):\r\n matrix[i][j+1]=a[j]\r\n \r\ndata=defaultdict(lambda:0)\r\n\r\nMAX=0\r\nfor i in range(1,n+1):\r\n stack=0 \r\n currentMax=0\r\n for j in range(1,m+1):\r\n if matrix[i][j]==1:\r\n stack+=1\r\n else:\r\n currentMax=max(currentMax,stack)\r\n stack=0\r\n currentMax=max(currentMax,stack)\r\n MAX=max(MAX,currentMax)\r\n data[i]=currentMax\r\n\r\n\r\n \r\nfor i in range(q):\r\n r,c=list(map(int,input().split()))\r\n matrix[r][c]=1 if matrix[r][c]==0 else 0\r\n \r\n stack=0\r\n currentMax=0\r\n for j in range(1,m+1):\r\n if matrix[r][j]==1:\r\n stack+=1\r\n else:\r\n currentMax=max(currentMax,stack)\r\n stack=0\r\n currentMax=max(currentMax,stack)\r\n data[r]=currentMax\r\n \r\n print(max(data.values()))\r\n # print(dict(data))\r\n # print(\"Ma tran hien tai la\")\r\n # for i in range(1,n+1):\r\n # print(matrix[i][1:])\r\n \r\n \r\n # print()\r\n # print(currentMax)\r\n\r\n\r\n", "from itertools import accumulate\r\n\r\nn, m, q = map(int, input().split())\r\nbears = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nmax_cons_ears = []\r\n\r\nfor i in range(n):\r\n max_ears_row = 0\r\n curr_ears_row = 0\r\n for j in range(m):\r\n if bears[i][j] == 1:\r\n curr_ears_row += 1\r\n else:\r\n curr_ears_row = 0\r\n if curr_ears_row > max_ears_row:\r\n max_ears_row = curr_ears_row\r\n \r\n max_cons_ears.append(max_ears_row)\r\n\r\n#print(f'{max_cons_ears = }')\r\n\r\nfor _ in range(q):\r\n i, j = map(int, input().split())\r\n i -= 1\r\n j -= 1\r\n bears[i][j] = 0 if bears[i][j] == 1 else 1\r\n #print(bears)\r\n max_ears_row_i = 0\r\n curr_ears_row_i = 0\r\n for k in range(m):\r\n if bears[i][k] == 1:\r\n curr_ears_row_i += 1\r\n else:\r\n curr_ears_row_i = 0\r\n if curr_ears_row_i > max_ears_row_i:\r\n max_ears_row_i = curr_ears_row_i\r\n #print(f'{max_ears_row_i = }')\r\n \r\n max_cons_ears[i] = max_ears_row_i\r\n \r\n #print(f'{max_cons_ears = }')\r\n \r\n print(max(max_cons_ears))", "def get_scores(r):\n max_scr = 0\n crmt_scr = int(r[0])\n last = r[0]\n for e in r[1:]:\n if e:\n if crmt_scr == 0: crmt_scr = 1\n if e == last: crmt_scr += 1\n else:\n max_scr = max(max_scr, crmt_scr)\n crmt_scr = 0\n last = e\n return max(max_scr, crmt_scr)\n\n\nn, m, q = map(int, input().split())\n\ngrid = []\nrows = [0] * n\n\nfor i in range(n):\n r = list(map(bool, (map(int, input().split()))))\n rows[i] = get_scores(r)\n grid.append(r)\n\nfor _ in range(q):\n i, j = map(int, input().split())\n i -= 1\n j -= 1\n\n grid[i][j] = not grid[i][j]\n rows[i] = get_scores(grid[i])\n\n print(max(rows))\n\n\t \t \t \t \t\t \t\t \t\t \t\t \t \t\t", "def f(s):\r\n s = ''.join(s).split('0')\r\n return max(len(i) for i in s)\r\nn, m, q = map(int, input().split())\r\narr = [input().split() for i in range(n)]\r\nb = [f(s) for s in arr]\r\nfor i in range(q):\r\n x, y = map(int, input().split())\r\n x -= 1 ; y -= 1\r\n arr[x][y] = str(1 - int(arr[x][y]))\r\n b[x] = f(arr[x])\r\n print(max(b))\r\n", "def counting(a):\n l = 0\n cnt = 0\n for e in a:\n if e == 1:\n l += 1\n else:\n if l > cnt:\n cnt = l\n l = 0\n if l > cnt:\n cnt = l\n return cnt\n\n\ndef main():\n n, m, q = map(int, input().split(' '))\n\n cnt = [0 for i in range(n)]\n f = [[] for i in range(n)]\n maxc = 0\n for i in range(n):\n f[i] = list(map(int, input().split()))\n cnt[i] = counting(f[i])\n if cnt[i] > maxc:\n maxc = cnt[i]\n\n for p in range(q):\n i, j = map(lambda la: int(la) - 1, input().split(' '))\n f[i][j] = (int(f[i][j]) + 1) % 2\n\n cnt[i] = counting(f[i])\n\n print(max(cnt))\n\nmain()\n\n\n\n\n", "a = list()\nb = list()\nn, m, q = [int(s) for s in input().split()]\nfor i in range(n):\n a.append([s for s in input().split()])\n b.append(max([len(s) for s in \"\".join(a[i]).split('0')]))\nfor i in range(q):\n p, o = [int(s)-1 for s in input().split()]\n a[p][o] = str(1-int(a[p][o]))\n b[p] = max([len(s) for s in \"\".join(a[p]).split('0')])\n print(max(b))\n", "__author__ = 'Zlobober'\r\nn, m, q = map(int, input().split())\r\nF = [list(map(int, input().split())) for i in range(n)]\r\n\r\ndef calc(i):\r\n ans = 0\r\n l = -1\r\n for j in range(m):\r\n if F[i][j] == 0:\r\n l = j\r\n else:\r\n ans = max(ans, j - l)\r\n return ans\r\n\r\nrow = list(map(calc, range(n)))\r\n\r\nfor i in range(q):\r\n y, x = map(int, input().split())\r\n y -= 1\r\n x -= 1\r\n F[y][x] = 1 - F[y][x]\r\n row[y] = calc(y)\r\n print (max(row))\r\n\r\n", "n,m,q = map(int, input().split())\r\n\r\nmatriz = []\r\ndef consecutive(lista):\r\n count = 0\r\n max = 0\r\n for i in lista:\r\n if(i == 1):\r\n count +=1\r\n if(count > max):\r\n max = count\r\n else:\r\n if(count > max):\r\n max = count\r\n count = 0\r\n return max\r\nmaxi = (0,0)\r\nlinha = 0\r\nfor i in range(n):\r\n entrada = list(map(int, input().split())) \r\n matriz.append(entrada)\r\n num = consecutive(entrada)\r\n \r\n if(num > maxi[0]):\r\n maxi = (num,linha)\r\n linha +=1\r\n\r\nfor queue in range(q):\r\n i,j = map(int, input().split())\r\n matriz[i-1][j-1] = abs(matriz[i-1][j-1] - 1)\r\n \r\n \r\n if i-1 == maxi[1]:\r\n maxi = (0,0)\r\n for lin in range(len(matriz)):\r\n count = consecutive(matriz[lin])\r\n if(count > maxi[0]):\r\n maxi = (count,lin)\r\n else:\r\n\r\n count = consecutive(matriz[i-1])\r\n if(count > maxi[0]):\r\n maxi = (count, i-1)\r\n \r\n \r\n print(maxi[0])\r\n", "def max_str(str_in):\r\n ans = 0\r\n sm_ans = 0\r\n for i in range(len(str_in)):\r\n if str_in[i] == 1:\r\n sm_ans += 1\r\n else:\r\n sm_ans = 0\r\n ans = max(sm_ans, ans)\r\n\r\n return ans\r\n\r\n\r\nn, m, q = [int(el) for el in input().split()]\r\nlist_m = []\r\nvect_in = [] # [[] for i in range(n)]\r\nfor i in range(n):\r\n sm_list = [int(el) for el in input().split()]\r\n list_m.append(sm_list)\r\n vect_in.append(max_str(sm_list))\r\nfor i in range(q):\r\n i_i, j_j = [int(el) for el in input().split()]\r\n list_m[i_i - 1][j_j - 1] = (list_m[i_i - 1][j_j - 1] + 1) % 2\r\n vect_in[i_i - 1] = max_str(list_m[i_i - 1])\r\n print(max(vect_in))", "def seq(list):\n\tmaior = 0\n\tcont = 0\n\tfor n in list:\n\t\tif n == 1: \n\t\t\tcont += 1\n\t\t\tif cont > maior: maior = cont\n\t\telse:\n\t\t\tif cont > maior: maior = cont\n\t\t\tcont = 0\n\t\n\treturn maior\n\nn, m, q = map(int, input().split())\n\ntabuleiro = []\nsequencias = []\nfor linhas in range(n):\n\tlinha = list(map(int, input().split()))\n\ttabuleiro.append(linha)\n\tsequencias.append(seq(linha))\n\nfor cordenadas in range(q):\n\ti, j = map(int, input().split())\n\ti -= 1\n\tj -= 1\n\t\n\ttabuleiro[i][j] = (tabuleiro[i][j] + 1) % 2\n\tsequencias[i] = seq(tabuleiro[i])\n\tprint(max(sequencias))\n\n\t \t \t\t \t\t\t \t\t \t\t\t \t\t\t \t\t\t", "R = lambda: map(int, input().split())\r\nn, m, q = R()\r\ng = [0] * n\r\nmr = [0] * n\r\nfor i in range(n):\r\n g[i] = list(R())\r\n tres = 0\r\n for j in range(m):\r\n if g[i][j] == 1:\r\n tres += 1\r\n else:\r\n tres = 0\r\n mr[i] = max(mr[i], tres)\r\nfor _ in range(q):\r\n i, j = R()\r\n i, j = i - 1, j - 1\r\n g[i][j] = 1 - g[i][j]\r\n tres = 0\r\n mr[i] = 0\r\n for k in range(m):\r\n if g[i][k] == 1:\r\n tres += 1\r\n else:\r\n tres = 0\r\n mr[i] = max(mr[i], tres)\r\n print(max(mr))", "n,m,q = map(int,input().split())\r\ns = [-1] + [[-1] + list(map(int,input().split()))for i in range(n)]\r\nls,ans = [-1],[-1]\r\nfor i in range(1,n + 1):\r\n ans.append([0])\r\n for j in range(1,m + 1):\r\n ans[i].append(s[i][j] + ans[i][j - 1] * s[i][j])\r\n ls.append(max(ans[i]))\r\nfor i in range(q):\r\n x,y = map(int,input().split())\r\n s[x][y] = 0 if s[x][y]else 1\r\n ans[x] = [0]\r\n for i in range(1,m + 1):\r\n ans[x].append(s[x][i] + ans[x][i - 1] * s[x][i])\r\n ls[x] = max(ans[x])\r\n print(max(ls))", "def line_score(row):\r\n m = 0\r\n c = 0\r\n for elem in row:\r\n if elem == 1:\r\n c += 1\r\n else:\r\n c = 0\r\n m = max(c, m)\r\n return m\r\n\r\nn, m, q = [int(x) for x in input().split(' ')]\r\ngrid = [[int(x) for x in input().split(' ')] for row in range(n)]\r\nrounds = [[int(x) for x in input().split(' ')] for round in range(q)]\r\n\r\nz = []\r\nfor row in grid:\r\n z.append(line_score(row))\r\n\r\nfor round in rounds:\r\n i, j = round\r\n grid[i - 1][j - 1] = 1 - grid[i - 1][j - 1]\r\n z [i - 1] = line_score(grid[i - 1])\r\n\r\n print(max(z))\r\n", "n, m, q = map(int, input().split())\n\nmouth = '0'\neyes = '1'\n\nmatrix = []\nscores = []\n\ndef get_score(row):\n conc = ''.join(row)\n score = len(max(conc.split('0')))\n return score\n\n\nfor _ in range(n):\n data = input().split()\n matrix.append(data)\n scores.append(get_score(data))\n\nfor _ in range(q):\n i, j = map(int, input().split())\n value = matrix[i - 1][j - 1]\n\n if value == mouth:\n matrix[i - 1][j - 1] = eyes\n else:\n matrix[i - 1][j - 1] = mouth\n \n calculated_score = get_score(matrix[i - 1])\n scores[i - 1] = calculated_score\n print(max(scores))\n\n \t \t \t\t\t\t\t\t\t \t\t \t\t \t\t\t \t", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\ndef res(row):\n ans = 0\n buf = 0\n for i in row:\n if i == 1:\n buf += 1\n else:\n if buf !=0:\n ans = max(ans, buf)\n buf = 0\n ans = max(ans, buf)\n return ans\n\n(n, m, q) = (int(i) for i in input().split())\ndesk = []\nscore = []\n\nstart = time.time()\n\nfor j in range(n):\n row = [ int(i) for i in input().split()]\n desk.append(row)\n score.append(res(row))\n\nans = []\nfor k in range(q):\n (i, j) = (int(l) for l in input().split())\n i -= 1\n j -= 1\n desk[i][j] = 1 if desk[i][j] == 0 else 0\n score[i]=res(desk[i])\n ans.append(max(score))\n\nfor i in ans:\n print(i)\nfinish = time.time()\n#print (finish - start), \"sec\"\n", "n, m, q = map(int, input().split())\r\n\r\nmouth = '0'\r\neyes = '1'\r\n\r\ngrid = []\r\nscores = []\r\n\r\ndef get_score(row):\r\n consecutive_eyes = ''.join(row)\r\n max_consecutive_eyes = len(max(consecutive_eyes.split('0')))\r\n return max_consecutive_eyes\r\n\r\nfor _ in range(n):\r\n row_data = input().split()\r\n grid.append(row_data)\r\n scores.append(get_score(row_data))\r\n\r\nfor _ in range(q):\r\n i, j = map(int, input().split())\r\n current_state = grid[i - 1][j - 1]\r\n\r\n if current_state == mouth:\r\n grid[i - 1][j - 1] = eyes\r\n else:\r\n grid[i - 1][j - 1] = mouth\r\n\r\n updated_score = get_score(grid[i - 1])\r\n scores[i - 1] = updated_score\r\n \r\n print(max(scores))\r\n", "n, m, q = map(int, input().split())\n\nxs = [list(map(int, input().split())) for i in range(n)]\n\ndef go(xs):\n answer, total = 0, 0\n for x in xs:\n total = total + 1 if x else 0\n\n answer = total if total > answer else answer\n\n return answer\n\nss = [go(x) for x in xs]\n\nfor i in range(q):\n i, j = map(int, input().split())\n\n if xs[i - 1][j - 1] == 0:\n xs[i - 1][j - 1] = 1\n ss[i - 1] = go(xs[i - 1])\n else:\n xs[i - 1][j - 1] = 0\n ss[i - 1] = go(xs[i - 1])\n\n print(max(ss))\n", "n, m, q = map(int, input().split())\n\nmouth = '0'\neyes = '1'\n\nmatriz = []\nscores = []\n\ndef get_score(row):\n conc = ''.join(row)\n score = len(max(conc.split('0')))\n return score\n\n\nfor _ in range(n):\n data = input().split()\n matriz.append(data)\n scores.append(get_score(data))\n\nfor _ in range(q):\n i, j = map(int, input().split())\n valor = matriz[i - 1][j - 1]\n\n if valor == mouth:\n matriz[i - 1][j - 1] = eyes\n else:\n matriz[i - 1][j - 1] = mouth\n \n calculated_score = get_score(matriz[i - 1])\n scores[i - 1] = calculated_score\n print(max(scores))\n\n\t \t\t\t \t\t \t \t \t \t\t", "queries = list(map(int, input().split()))\nqtd = queries[0]\nlenght = queries[1]\ncomand = queries[2]\ncounter = [0] * qtd\nwords = []\n\nfor i in range(qtd):\n num1 = 0\n x = list(map(int, input().split()))\n words.append(x)\n for j in range(lenght):\n if x[j] == 1:\n num1 += 1\n if num1 > counter[i]:\n counter[i] = num1\n else:\n num1 = 0\n\nfor q in range(comand):\n turn = list(map(int, input().split()))\n words[turn[0]-1][turn[1]-1] = 1 - words[turn[0]-1][turn[1]-1]\n num1 = 0\n biggest = 0\n for p in range(lenght):\n if words[turn[0]-1][p] == 1:\n num1 += 1\n if num1 > biggest:\n biggest = num1\n else:\n num1 = 0\n\n counter[turn[0]-1] = biggest\n\n print(max(counter))\n\t \t\t \t\t\t\t \t \t \t \t \t", "def maior(i):\n saida, sub = 0, -1\n for j in range(m):\n if matriz[i][j] == 0:\n sub = j\n else:\n saida = max(saida, j - sub)\n return saida\n\n\nn, m, q = list(map(int, input().split()))\nmatriz = [list(map(int, input().split())) for i in range(n)]\nv = list(map(maior, range(n)))\n\nfor i in range(q):\n linha, col = map(int, input().split())\n linha -= 1\n col -= 1\n matriz[linha][col] = 1 - matriz[linha][col]\n v[linha] = maior(linha)\n print(max(v))\n\n \t \t\t \t\t \t\t \t\t \t \t \t\t", "n,m,q=map(int,input().split())\r\na=[]\r\nma=[0]*n\r\n\r\ndef calc(nom):\r\n k=a[nom][0]\r\n ma=k\r\n global a\r\n for i in range(1,m):\r\n if a[nom][i]==1:\r\n if a[nom][i]==a[nom][i-1]:\r\n k+=1\r\n else: k=1\r\n else: k=0\r\n if k>ma: ma=k\r\n return ma\r\n\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n a+=[b]\r\n ma[i]=calc(i)\r\nfor i in range(q):\r\n ii,jj=map(int,input().split())\r\n a[ii-1][jj-1]^=1\r\n ma[ii-1]=calc(ii-1)\r\n print(max(ma))", "n,m,q = map(int,input().split())\r\n\r\ngrid =[]*m\r\n\r\nfor i in range(n):\r\n grid.append(list(map(int,input().split())))\r\n#print(grid)\r\ncount = []\r\n\r\nfor i in range(n):\r\n c=0\r\n tmp=0\r\n for j in range(m):\r\n if grid[i][j]==1:\r\n c+=1\r\n else:\r\n tmp=max(c,tmp)\r\n c=0\r\n count.append(max(tmp,c))\r\n#ans = max(count)\r\n#print(count)\r\nfor i in range(q):\r\n x,y = map(int,input().split())\r\n x-=1;y-=1\r\n if grid[x][y]==0:\r\n grid[x][y]=1\r\n else:\r\n grid[x][y]=0\r\n c=tmp=0\r\n for i in range(m):\r\n if grid[x][i]==1:\r\n c+=1\r\n else:\r\n tmp=max(c,tmp)\r\n c=0\r\n count[x]=max(tmp,c)\r\n print(max(count))\r\n", "n, m, q = map(int, input().split(\" \"))\n\ngrid = []\npontuacoes = []\nfor i in range(n):\n linha = list(input().split(\" \"))\n grid.append(linha)\n pontuacoes.append(max(map(len, \"\".join(linha).split('0'))))\n\n\nfor i in range(q):\n x, y = map(int, input().split(\" \"))\n\n if grid[x - 1][y - 1] == '0':\n grid[x - 1][y - 1] = '1'\n else:\n grid[x - 1][y - 1] = '0'\n\n pontuacoes[x - 1] = max(list(map(len, \"\".join(grid[x - 1]).split('0'))))\n print(max(pontuacoes))\n\n \t\t\t \t \t\t\t\t\t \t\t\t \t \t", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nimport random\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef msub(a):\n c=0\n g=0\n for i in range(len(a)):\n if(a[i]==1):\n c+=1\n g=max(g,c)\n elif(a[i]==0):\n g=max(g,c)\n c=0\n return g\nn,m,q=M()\nans=[0]*n\nl=[]\nfor i in range(n):\n a=L()\n l.append(a)\n ans[i]=msub(a)\nfor i in range(q):\n r,c=M()\n r-=1\n c-=1\n l[r][c]^=1\n ans[r]=msub(l[r])\n print(max(ans))\n", "rows, cols, changes_count = map(int, input().split())\r\n\r\ngrid = [\r\n input().split() for _ in range(rows)\r\n]\r\n\r\nchanges = [\r\n map(int, input().split()) for __ in range(changes_count)\r\n]\r\n\r\nmax_line = [\r\n max(map(len, \"\".join(row).split(\"0\"))) for row in grid\r\n]\r\n\r\nfor r, c in changes:\r\n grid[r-1][c-1] = \"0\" if grid[r-1][c-1] == \"1\" else \"1\"\r\n max_line[r-1] = max(map(len, \"\".join(grid[r-1]).split(\"0\")))\r\n print(max(max_line))\r\n", "n,m,q=map(int,input().split())\r\na=[0]*n\r\nans=[0]*n\r\nfor i in range(0,n):\r\n s=list(map(int,input().split()))\r\n for j in range(0,m):\r\n a[i]=s\r\nfor i in range(n):\r\n max_1=0\r\n curr=0\r\n for j in range(m):\r\n if a[i][j]==0:\r\n curr=0\r\n else:\r\n curr+=1\r\n max_1=max(curr,max_1)\r\n ans[i]=max_1\r\nfor x in range(q):\r\n x,y=map(int,input().split())\r\n if a[x-1][y-1]==0:\r\n a[x-1][y-1]=1\r\n else:\r\n a[x-1][y-1]=0\r\n curr=0\r\n max_1=0\r\n for j in range(m):\r\n if a[x-1][j]==0:\r\n curr=0\r\n else:\r\n curr+=1\r\n max_1=max(curr,max_1)\r\n ans[x-1]=max_1\r\n print(max(ans))\r\n \r\n \r\n", "n,m,q = map(int,input().split())\r\nbears = [list(map(int,input().split())) for i in range(n)]\r\nmaxns = [0] * n\r\nfor i in range(n):\r\n num = bears[i][0]\r\n maxns[i] = num\r\n for j in range(1,m):\r\n num = num * (bears[i][j] == bears[i][j-1]) + bears[i][j]\r\n maxns[i] = max(maxns[i],num)\r\n \r\nfor i in range(q):\r\n i, j = map(int,input().split())\r\n i -= 1\r\n j -= 1\r\n bears[i][j] ^= 1\r\n num = bears[i][0]\r\n maxns[i] = num\r\n for j in range(1,m):\r\n num = num * (bears[i][j] == bears[i][j-1]) + bears[i][j]\r\n maxns[i] = max(maxns[i],num)\r\n print(max(maxns))\r\n", "n,m,q=[int(x) for x in input().split()]\r\nx=[[int(x) for x in input().split()]+[0] for _ in range(n)]\r\ns=[1,0]\r\n\r\nl=[]\r\nfor i in range(n):\r\n z=0\r\n p=0\r\n for j in range(m+1):\r\n if x[i][j]==1:\r\n p+=1\r\n else:\r\n z=max(z,p)\r\n p=0\r\n l.append(z)\r\nfor _ in range(q):\r\n a,b=[int(x) for x in input().split()]\r\n x[a-1][b-1]=s[x[a-1][b-1]]\r\n p=0\r\n z=0\r\n for j in range(m+1):\r\n if x[a-1][j]==1:\r\n p+=1\r\n else:\r\n z=max(z,p)\r\n p=0\r\n l[a-1]=z\r\n print(max(l))\r\n \r\n", "n, m, q = map(int, input().split(\" \"))\r\nl = []\r\n\r\ndef maxx(l):\r\n cmax = 0\r\n count = 0\r\n for i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == 1:\r\n count += 1\r\n if j == (len(l[i])-1) and count > cmax:\r\n cmax = count\r\n else:\r\n if count > cmax:\r\n cmax = count\r\n count = 0\r\n count = 0 \r\n return cmax \r\n\r\ndef maxi(l):\r\n c = 0\r\n cmax = 0\r\n for i in range(len(l)):\r\n if l[i] == 1:\r\n c+=1\r\n if c > cmax:\r\n cmax = c\r\n else:\r\n c = 0\r\n return cmax\r\n \r\nfor i in range(n):\r\n li = list(map(int, input().split(\" \")))\r\n l.append(li)\r\n\r\nfoo = []\r\n\r\nfor i in range(len(l)):\r\n foo.append(maxi(l[i]))\r\n\r\nfor i in range(q):\r\n i, j = map(int, input().split(\" \"))\r\n l[i-1][j-1] = 1 - l[i-1][j-1]\r\n foo[i-1] = maxi(l[i-1])\r\n \r\n print(max(foo)) ", "r, c, g = map(int, input().split())\n\nboard = []\nscores = []\n\nfor i in range(r):\n board.append([int(x) for x in input().split()])\n\n curr = 0\n m = 0\n for num in board[-1]:\n if num == 1:\n curr += 1\n else:\n m = max(m, curr)\n curr = 0\n m = max(m, curr)\n\n scores.append(m)\n\nfor i in range(g):\n x, y = map(int, input().split())\n x-=1\n y-=1\n if board[x][y]:\n board[x][y] = 0\n else:\n board[x][y] = 1\n\n curr = 0\n m = 0\n for num in board[x]:\n if num == 1:\n curr += 1\n else:\n m = max(m, curr)\n curr = 0\n m = max(m, curr)\n\n scores[x] = m\n\n print(max(scores))\n \t\t\t \t\t \t \t\t\t\t\t\t \t \t\t\t\t\t", "import math\r\nimport sys\r\nimport queue\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef count_row_score(y, field, row_score):\r\n row_score[y] = -1\r\n count = 0\r\n for j in field[y]:\r\n if j == 1:\r\n count += 1\r\n else:\r\n count = 0\r\n row_score[y] = max(row_score[y], count)\r\n\r\n\r\ndef solve():\r\n n, m, q = map(int, input().split())\r\n\r\n field = []\r\n bear_score = 0\r\n row_score = [0 for i in range(n)]\r\n\r\n for i in range(n):\r\n field.append(list(map(int, input().split())))\r\n count_row_score(i, field, row_score)\r\n\r\n for i in range(q):\r\n y, x = map(int, input().split())\r\n field[y - 1][x - 1] = 1 - field[y - 1][x - 1]\r\n\r\n count_row_score(y - 1, field, row_score)\r\n bear_score = max(row_score)\r\n\r\n print(bear_score)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "from sys import stdin\ninput = stdin.readline\n\ndef get(l):\n\tres = 0\n\tcur = 0\n\tfor x in l:\n\t\tcur = (cur + x) * x\n\t\tres = max(res, cur)\n\treturn res\n\nn, m, q = (int(x) for x in input().split())\nf = [[int(x) for x in input().split()] + [0] for i in range(n)]\nreses = [get(r) for r in f]\nfor i in range(q):\n\ti, j = (int(x) - 1 for x in input().split())\n\tf[i][j] ^= 1\n\treses[i] = get(f[i])\n\tprint(max(reses))\n" ]

[ "# \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\nimport math\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\nimport bisect \r\ntry :\r\n import numpy\r\n dprint = print\r\n dprint('debug mode')\r\nexcept ModuleNotFoundError:\r\n def dprint(*args, **kwargs):\r\n pass\r\ndef makePair(z):\r\n return [(z[i], z[i+1]) for i in range(0,len(z),2) ]\r\ndef memo(func): \r\n cache={} \r\n def wrap(*args): \r\n if args not in cache: \r\n cache[args]=func(*args) \r\n return cache[args] \r\n return wrap\r\n\r\n@memo\r\ndef comb (n,k):\r\n if k==0: return 1\r\n if n==k: return 1\r\n return comb(n-1,k-1) + comb(n-1,k)\r\n\r\nN,K = getIntList()\r\n\r\nz1 = getIntList()\r\nz2 = getIntList()\r\nz3 = getIntList()\r\nz4= getIntList()\r\nblank = [0 for i in range(N+2)]\r\nzz = [ blank, [0] + z1 + [0], [0] + z2 + [0], [0] + z3 + [0], [0] + z4 + [0], blank]\r\n\r\n\r\n\r\nres = []\r\n\r\ndef checkpark():\r\n for x in range(2,4):\r\n for y in range(1,N+1):\r\n if zz[x][y] ==0: continue\r\n if x ==2: x0 = 1\r\n else : x0 = 4\r\n if zz[x][y] == zz[x0][y]:\r\n res.append( (zz[x][y], x0,y))\r\n zz[x][y] = 0\r\ndef ifallin():\r\n for x in range(2,4):\r\n for y in range(1,N+1):\r\n if zz[x][y] !=0: return False\r\n return True\r\n\r\ndef rotate():\r\n ex = 0\r\n ey = 0\r\n for x in range(2,4):\r\n for y in range(1,N+1):\r\n if zz[x][y] ==0:\r\n ex = x\r\n ey = y\r\n break\r\n if ex>0: break\r\n if ex==0:\r\n return False\r\n\r\n tx = ex\r\n ty = ey\r\n def nextcircle(x,y):\r\n if x == 2:\r\n if y>1:\r\n return x,y-1\r\n return x+1,y\r\n else:\r\n assert x==3\r\n if y<N:\r\n return x,y+1\r\n return x-1,y\r\n \r\n tx1,ty1 = nextcircle(tx,ty)\r\n while (tx1,ty1)!= (ex,ey) :\r\n t = zz[tx1][ty1]\r\n if t !=0:\r\n res.append( (t, tx,ty) )\r\n zz[tx][ty] = t\r\n zz[tx1][ty1] = 0\r\n tx,ty = tx1,ty1\r\n tx1,ty1 = nextcircle(tx,ty)\r\n\r\n return True\r\n\r\nwhile True:\r\n for x in range(1,5):\r\n dprint(zz[x])\r\n dprint()\r\n checkpark()\r\n ok = ifallin()\r\n if ok:\r\n break\r\n ok = rotate()\r\n if not ok:\r\n print(-1)\r\n sys.exit()\r\n \r\nprint(len(res))\r\n\r\nfor x in res:\r\n print(x[0],x[1],x[2])\r\n \r\n\r\n", "k, n = [int(x) for x in input().split()]\r\na = [] \r\nfor i in range(4):\r\n\ta.append([int(x) - 1 for x in input().split()])\r\n\r\npos = []\r\nfor i in range(k):\r\n\tpos.append([1, i])\r\nfor i in range(k):\r\n\tpos.append([2, k - i - 1])\r\n\r\nlft = n\r\nans = []\r\n\r\nfor i in range(2 * k):\r\n\tfor j in range(2 * k):\r\n\t\tif (a[pos[j][0]][pos[j][1]] != -1) and (a[pos[j][0]][pos[j][1]] == a[pos[j][0] ^ 1][pos[j][1]]):\r\n\t\t\tlft -= 1\r\n\t\t\tans.append([a[pos[j][0]][pos[j][1]], pos[j][0] ^ 1, pos[j][1]])\r\n\t\t\ta[pos[j][0]][pos[j][1]] = -1\r\n\tif (lft == 0):\r\n\t\tbreak\r\n\tfst = -1\r\n\tfor j in range(2 * k):\r\n\t\tif (a[pos[j][0]][pos[j][1]] != -1) and (a[pos[(j + 1) % (2 * k)][0]][pos[(j + 1) % (2 * k)][1]] == -1):\r\n\t\t\tfst = j\r\n\t\t\tbreak\r\n\tif (fst == -1):\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\tfor j in range(2 * k - 1):\r\n\t\tif (a[pos[(fst - j) % (2 * k)][0]][pos[(fst - j) % (2 * k)][1]] != -1):\r\n\t\t\ta[pos[(fst - j + 1) % (2 * k)][0]][pos[(fst - j + 1) % (2 * k)][1]] = a[pos[(fst - j) % (2 * k)][0]][pos[(fst - j) % (2 * k)][1]]\r\n\t\t\ta[pos[(fst - j) % (2 * k)][0]][pos[(fst - j) % (2 * k)][1]] = -1\r\n\t\t\tans.append([a[pos[(fst - j + 1) % (2 * k)][0]][pos[(fst - j + 1) % (2 * k)][1]], pos[(fst - j + 1) % (2 * k)][0], pos[(fst - j + 1) % (2 * k)][1]])\r\n\t\r\nprint(len(ans))\r\nfor i in ans:\r\n\tprint(' '.join([str(x + 1) for x in i])) ", "# https://codeforces.com/problemset/problem/995/A\r\n\r\nn, k = map(int, input().split())\r\nm = [list(map(int, input().split())) for _ in range(4)] \r\n\r\ndef move():\r\n is_move = False\r\n is_park = False\r\n ind, r, c = None, None, None\r\n \r\n for i, x in enumerate(m[1]):\r\n if x != 0:\r\n # possible to park \r\n if m[0][i] == x:\r\n is_move = True\r\n is_park = True\r\n m[1][i] = 0 \r\n ind, r, c = x, 0, i\r\n break\r\n # possible to move next \r\n elif i + 1 < n and m[1][i+1] == 0: \r\n m[1][i] = 0\r\n m[1][i+1] = x\r\n is_move = True\r\n ind, r, c = x, 1, i+1\r\n break\r\n # possible to move down \r\n elif i == n-1 and m[2][i] == 0:\r\n m[1][i] = 0\r\n m[2][i] = x\r\n is_move = True\r\n ind, r, c = x, 2, i\r\n break\r\n \r\n if is_move == True:\r\n return is_move, is_park, ind, r, c\r\n \r\n for i, x in enumerate(m[2]):\r\n if x != 0:\r\n # possible to park \r\n if m[3][i] == x:\r\n is_move = True\r\n is_park = True\r\n m[2][i] = 0 \r\n ind, r, c = x, 3, i\r\n break\r\n # possible to move next \r\n elif i - 1 >= 0 and m[2][i-1] == 0: \r\n m[2][i] = 0\r\n m[2][i-1] = x\r\n is_move = True\r\n ind, r, c = x, 2, i-1\r\n break\r\n # possible to move up \r\n elif i == 0 and m[1][i] == 0:\r\n m[2][i] = 0\r\n m[1][i] = x\r\n is_move = True\r\n ind, r, c = x, 1, i\r\n break\r\n \r\n return is_move, is_park, ind, r, c \r\n\r\ncnt = 0\r\nis_solve = True\r\nmove_arr = []\r\nwhile cnt < k:\r\n is_move, is_park, ind, r, c = move()\r\n \r\n if is_move == False:\r\n is_solve = False\r\n break\r\n \r\n move_arr.append([ind, r+1, c+1])\r\n if is_park == True:\r\n cnt += 1\r\n \r\nif is_solve == False:\r\n print(-1)\r\nelse:\r\n print(len(move_arr))\r\n print('\\n'.join([' '.join([str(x) for x in move_]) for move_ in move_arr]))\r\n \r\n#4 5\r\n#1 2 0 4\r\n#0 0 0 5\r\n#4 3 2 1 \r\n#0 5 0 3\r\n\r\n#4 7\r\n#4 3 2 1\r\n#1 2 3 4\r\n#0 7 6 5 \r\n#7 6 5 0\r\n\r\n#4 8\r\n#4 3 2 1\r\n#1 2 3 4\r\n#8 7 6 5 \r\n#7 6 5 8\r\n\r\n#2 3\r\n#1 3\r\n#3 2\r\n#1 0\r\n#2 0", "def main():\n n, k = map(int, input().split())\n a, b, c, d = (list(map(int, input().split())) for _ in 'abcd')\n ss, tt, n2, res = [*b, *c[::-1]], [*a, *d[::-1]], n * 2, []\n yx = [*[(2, i + 1) for i in range(n)], *[(3, i) for i in range(n, 0, -1)]]\n \n def park():\n for i, s, t, (y, x) in zip(range(n2), ss, tt, yx):\n if s == t != 0:\n ss[i] = 0\n res.append(f'{s} {(1, 4)[y == 3]} {x}')\n \n def rotate():\n start = ss.index(0)\n for i in range(start - n2, start - 1):\n s = ss[i] = ss[i + 1]\n if s:\n y, x = yx[i]\n res.append(f'{s} {y} {x}')\n ss[start - 1] = 0\n \n park()\n if all(ss):\n print(-1)\n return\n while any(ss):\n rotate()\n park()\n print(len(res), '\\n'.join(res), sep='\\n')\n \n \nif __name__ == '__main__':\n main()\n \t \t \t\t\t \t \t \t \t\t" ]

[ "n,s=int(input()),input()\nprint(min(n,s.count('01')+s.count('10')+3))\n\t\t \t \t\t \t \t \t\t\t \t \t \t", "import sys\ndef main():\n\tn = int(input())\n\ttab = sys.stdin.readline()\n\ts = 1\n\tt = tab[0]\n\te = 0\n\tfor i in range(1,len(tab)-1):\n\t\tif t != tab[i]:\n\t\t\ts+=1\n\t\t\tt = tab[i]\n\t\tif tab[i] == tab[i-1] == '0' or tab[i] == tab[i-1] == '1':\n\t\t\te+=1\n\t\t\te = min(e,2)\n\tprint(s+e)\nmain()\n", "n=int(input())\ns=input().strip('\\n')\ncur=s[0]\nl=1\nfor i in range(1,n):\n if s[i]!=cur:\n l+=1\n cur=s[i]\nprint(min(l+2,n))\n\n", "n=int(input())\r\ns=input()\r\nprint(min(n,3+s.count(\"01\")+s.count(\"10\")))", "n = int(input())\ns = input().strip()\ncount = 1\nfor i in range(1, n):\n if s[i - 1] != s[i]:\n count += 1\ncount = min(count + 2, n)\nprint(count)\n", "if __name__ == \"__main__\":\r\n nr_of_questions = int(input())\r\n score = list(map(int, input()))\r\n sub_length = 1\r\n for i in range(len(score) - 1):\r\n if score[i] != score[i + 1]:\r\n sub_length += 1\r\n sub_length_mod = min(len(score), sub_length + 2)\r\n print(sub_length_mod)\r\n ", "n,s,c=int(input()),input(),3\r\nfor i in range(n-1):c+=s[i]!=s[i+1]\r\nprint(min(n,c))", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nn = int(input())\ns = input()\n\nres = 1\n\nfor i in range(1, n):\n if s[i] != s[i-1]:\n res += 1\n\nprint(min(res+2, n))\n", "n = int(input())\ns = input()\n\nl = []\ncnt, ans = 0, 0\nlast = ''\nfor i in s:\n if i != last:\n l.append(cnt)\n cnt = 1\n else:\n cnt += 1\n last = i\nl.append(cnt)\nl = l[1:]\na, b = 0, 0\nfor t in l:\n if t > 1:\n a += 1\n if t > 2:\n b += 1\nif a >= 2 or b >= 1:\n print(len(l)+2)\n exit()\nif a == 1:\n print(len(l)+1)\n exit()\nprint(len(l))\n", "input()\r\ns=input()\r\nt,r=int(s[0]),0\r\nfor i in s:\r\n if int(i)==t:r+=1;t=1-t\r\nprint(min(r+2,len(s)))", "ans = 1\r\nn = int(input())\r\ns = input()\r\nfor i in range(1, n):\r\n ans += int(s[i]!=s[i-1])\r\nprint(min(n, ans+2))", "n = int(input())\r\ns= list(input())\r\nlis=[0]*n\r\nbb=[]\r\np=s[0];lis[0]=1;kk=0\r\nfor i in range(1,len(s)):\r\n if s[i]!=p:\r\n lis[i]=1\r\n p=s[i]\r\nfor i in range(1,len(s)):\r\n# print(s[i],s[i-1])\r\n if s[i]==s[i-1]:\r\n kk+=1\r\n else:\r\n bb.append(kk);kk=0 \r\nbb.append(kk) \r\nans=c=0\r\n#print(lis,bb)\r\nif max(bb)>1:\r\n print(sum(lis)+2)\r\nelse:\r\n print(sum(lis)+min(2,bb.count(1)))\r\n\r\n", "n = int(input())\r\na = input()\r\nans = min(n, 3 + a.count('01') + a.count('10'))\r\n\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nres = 1\r\nfor i in range(1, n):\r\n\tres += (s[i] != s[i-1])\r\nprint (min(res+2, n))", "from math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random\r\nfrom functools import lru_cache\r\nfrom itertools import *\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\ndef inpu(): return int(inp())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef stringlis(): return list(map(str, inp().split()))\r\ndef sep(): return map(int, inp().split())\r\ndef strsep(): return map(str, inp().split())\r\ndef fsep(): return map(float, inp().split())\r\nM,M1=1000000007,998244353\r\n\r\ndef main():\r\n how_much_noob_I_am = 1\r\n #how_much_noob_I_am = inpu()\r\n for __ in range(how_much_noob_I_am):\r\n n=inpu()\r\n s = inp()\r\n ans = [0]*(n)\r\n p=s[0]\r\n ans[0] = 1\r\n for i in range(1,n):\r\n if s[i]!=p:\r\n ans[i]= ans[i-1]+1\r\n p=s[i]\r\n else:\r\n ans[i] = ans[i-1]\r\n print(min(n,max(ans)+2))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import 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\n# def solve():\n# n = ii()\n# arr = input()\n\n# count = 1\n# last = arr[0]\n# times = False\n# tc = 1\n# used = 1\n# for k, curr in enumerate(arr[1:]):\n# if last != curr:\n# count += 1\n# tc = used\n# elif tc == 1:\n# # tc += 1\n# used = 0\n# count += 1\n# last = \"1\" if curr == \"0\" else \"0\"\n# # break\n# continue\n# last = curr\n# print(count)\n\n\ndef solve():\n n = ii()\n arr = input()\n\n count = 1\n last = arr[0]\n times = True\n ones = True\n for curr in arr[1:]:\n if last != curr:\n count += 1\n times = ones\n elif times:\n ones = False\n count += 1\n # print(last)\n last = str(1 - int(last))\n # last = \"1\" if curr == \"0\" else \"0\"\n\n continue\n last = curr\n print(count)\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\n\n# def solve():\n# n = ii()\n# arr = input()\n\n# count = 1\n# last = arr[0]\n# times = True\n# ones = True\n# for curr in arr[1:]:\n# if last != curr:\n# count += 1\n# times = ones\n# elif times:\n# ones = False\n# count += 1\n# last = int(curr) - int(last)\n# continue\n# last = curr\n# print(count)\n", "#!/usr/bin/env python3\n# 604C_thinking.py - Codeforces.com/problemset/problem/604/C by Sergey 2015\n\nimport unittest\nimport sys\n\n###############################################################################\n# Thinking Class (Main Program)\n###############################################################################\n\n\nclass Thinking:\n \"\"\" Thinking representation \"\"\"\n\n def __init__(self, test_inputs=None):\n \"\"\" Default constructor \"\"\"\n\n it = iter(test_inputs.split(\"\\n\")) if test_inputs else None\n\n def uinput():\n return next(it) if it else sys.stdin.readline().rstrip()\n\n # Reading single elements\n [self.n] = map(int, uinput().split())\n self.s = uinput()\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n result = 1\n empty = 0\n prev = self.s[0]\n for i in range(1, self.n):\n cur = self.s[i]\n if cur != prev:\n result += 1\n else:\n empty += 1\n prev = cur\n result += min(empty, 2)\n\n return str(result)\n\n###############################################################################\n# Unit Tests\n###############################################################################\n\n\nclass unitTests(unittest.TestCase):\n\n def test_single_test(self):\n \"\"\" Thinking class testing \"\"\"\n\n # Constructor test\n test = \"8\\n10000011\"\n d = Thinking(test)\n self.assertEqual(d.n, 8)\n self.assertEqual(d.s, \"10000011\")\n\n # Sample test\n self.assertEqual(Thinking(test).calculate(), \"5\")\n\n # Sample test\n test = \"2\\n01\"\n self.assertEqual(Thinking(test).calculate(), \"2\")\n\n # Sample test\n test = \"1\\n0\"\n self.assertEqual(Thinking(test).calculate(), \"1\")\n\n # My tests\n test = \"6\\n010100\"\n self.assertEqual(Thinking(test).calculate(), \"6\")\n\n # Time limit test\n # self.time_limit_test(5000)\n\n def time_limit_test(self, nmax):\n \"\"\" Timelimit testing \"\"\"\n import random\n import timeit\n\n # Random inputs\n test = str(nmax) + \" \" + str(nmax) + \"\\n\"\n numnums = [str(i) + \" \" + str(i+1) for i in range(nmax)]\n test += \"\\n\".join(numnums) + \"\\n\"\n nums = [random.randint(1, 10000) for i in range(nmax)]\n test += \" \".join(map(str, nums)) + \"\\n\"\n\n # Run the test\n start = timeit.default_timer()\n d = Thinking(test)\n calc = timeit.default_timer()\n d.calculate()\n stop = timeit.default_timer()\n print(\"\\nTimelimit Test: \" +\n \"{0:.3f}s (init {1:.3f}s calc {2:.3f}s)\".\n format(stop-start, calc-start, stop-calc))\n\nif __name__ == \"__main__\":\n\n # Avoiding recursion limitaions\n sys.setrecursionlimit(100000)\n\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n\n # Print the result string\n sys.stdout.write(Thinking().calculate())\n", "l, s = int(input()), input()\nx, y = 0, 1\nfor i in range(l-1):\n if s[i] == s[i+1]:\n x += 1\n else: y += 1\nprint(y + min(2, x))\n\n\t\t \t \t\t\t \t\t\t \t\t\t \t\t \t\t\t", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\ns=si()\r\n\r\nif n==1:\r\n print(1)\r\n \r\nelse:\r\n cnt=1\r\n st=s[0]\r\n for i in range(1,n):\r\n if s[i]!=st:\r\n cnt+=1\r\n st=s[i]\r\n \r\n print(min(cnt+2,n))", "n=int(input())\r\ns=input()\r\nans=0\r\nadd=0\r\np=''\r\nfor i in s:\r\n if(i==p):\r\n add+=1\r\n else:\r\n ans+=1\r\n p=i\r\n \r\nprint(ans+min(2,add))", "n = int(input())\ns = input()\nli = [s[0]]\nfor i in range(1, n):\n if s[i] != li[-1]:\n li.append(s[i])\nprint(min(n, len(li) + 2))", "n = int(input())\r\ns = input()\r\na = 1\r\nb = 0\r\nfor i in range(1, n):\r\n if s[i] == s[i-1]:\r\n b += 1\r\n else:\r\n a += 1\r\nprint(a + min(b, 2))\r\n", "n=int(input())\r\na=input()\r\np=[1]*4\r\nfor i in range(1,n):\r\n\tfor j in range(2,-1,-1):\r\n\t\tp[j+1]=max(p[j+1],p[j]+(a[i-1]==a[i]))\r\n\t\tp[j]+=a[i-1]!=a[i]\r\nprint(max(p[0:3]))", "\r\nn=int( input() )\r\ns=str( input() )\r\n\r\nret=3\r\nfor i in range(1,n):\r\n\tif s[i] != s[i-1]:\r\n\t\tret=ret+1\r\n\r\nif ret < n :\r\n\tprint (ret)\r\nelse :\r\n\tprint (n) \r\n", "def solve(s,n):\r\n ans=1\r\n for i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n ans+=1\r\n return min(ans+2,n)\r\nn=int(input())\r\ns=input()\r\nprint(solve(s,n))\r\n", "n = int(input())\r\ns = input()\r\ndl = 1\r\nnow = s[0]\r\nk = 0\r\nfor i in range(1, n):\r\n if now != s[i]:\r\n now = s[i]\r\n dl += 1\r\n \r\nfor i in range(n - 1):\r\n if s[i] == s[i + 1] == '0' or s[i] == s[i + 1] == '1':\r\n k += 1\r\nif k >= 2:\r\n print(dl + 2)\r\nelif k == 1:\r\n print(dl + 1)\r\nelse:\r\n print(dl)\r\n", "from collections import Counter\n\n_ = input()\ns = input().strip()\n\n\nsequences = Counter()\ncur_seq_len = 1\nfor p, n in zip(s, s[1:] + '*'):\n if p == n:\n cur_seq_len += 1\n else:\n if cur_seq_len > 3:\n cur_seq_len = 3\n sequences[cur_seq_len] += 1\n cur_seq_len = 1\n\nbasic = sum(sequences.values())\n\nif 3 in sequences or sequences[2] >= 2:\n print(basic + 2)\nelif sequences[2] == 1:\n print(basic + 1)\nelse:\n print(basic)\n \n", "n=int(input())\r\nres=1 \r\ns=input()\r\n\r\nfor i in range(1,n):\r\n res+=s[i]!=s[i-1]\r\n\r\nans=min(res+2,n)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\na = s.count('10')*2\r\nif s[-1] == '1':\r\n a += 1\r\nb = s.count('01')*2\r\nif s[-1] == '0':\r\n b += 1\r\nprint(min(n, max(a+2, b+2)))\r\n", "n = int(input())\nch = str(input())\n\nif n == 1:\n print(1)\nelse:\n B = [0 for _ in range(n)]\n B[0] = 1\n c = ch[0]\n for k in range(1,n):\n if ch[k] == c:\n B[k] = B[k-1]\n else:\n B[k] = B[k-1] + 1\n c = ch[k]\n \n T = [0 for _ in range(n)] \n F = [0 for _ in range(n)] \n \n T[1] = B[0]+1\n if ch[1] == ch[0]:\n F[1] = 1\n for i in range(1):\n for j in range(i+2,n):\n c = 0\n if ch[j] == ch[j-1] and not(F[j-1]):\n temp = max([T[j-1], B[j-1] + 1])\n if temp == 1 + B[j-1]:\n c = 1\n else:\n temp = T[j-1] + 1\n if F[j-1] and ch[j] != ch[j-1]:\n c = 1\n T[j] = temp\n F[j] = c\n\n print(T[n-1])\n", "n = int(input())\r\nbinary = input()\r\ninc, dec = [1] * len(binary), [1] * len(binary)\r\nfor i in range(1, len(binary)):\r\n if binary[i] > binary[i - 1]:\r\n inc[i] = dec[i - 1] + 1\r\n dec[i] = dec[i - 1]\r\n elif binary[i] < binary[i - 1]:\r\n dec[i] = inc[i - 1] + 1\r\n inc[i] = inc[i - 1]\r\n else:\r\n inc[i] = inc[i - 1]\r\n dec[i] = dec[i - 1]\r\nsubsec = max(max(inc), max(dec))\r\nprint(min(subsec + 2, n))\r\n", "n = int(input())\r\ns = input()\r\nres = 1\r\nfor i in range(n-1):\r\n if s[i] != s[i+1]:\r\n res += 1\r\nif res == n:\r\n print(res)\r\nelif res == n-1:\r\n print(res+1)\r\nelse:\r\n print(res + 2)\r\n", "n=int(input())\r\n\r\ns=input()\r\nk=0\r\ni=0\r\nr=int(s[0])\r\nwhile(i<n):\r\n if(int(s[i])==r):\r\n r=1-r\r\n k+=1\r\n i+=1\r\n\r\nprint(min(k+2,n))\r\n", "n=int(input())\r\ns=input()\r\nans=0\r\na=0\r\nb=0\r\nif s[0]=='0':\r\n\tflag='0'\r\nelse:\r\n\tflag='1'\r\nfor i in range(n):\r\n\tif i>0 and s[i]==s[i-1]:\r\n\t\ta+=1\r\n\tif s[i]==flag:\r\n\t\tans+=1\r\n\t\tif flag=='0':\r\n\t\t\tflag='1'\r\n\t\telse:\r\n\t\t\tflag='0'\r\nans+=min(a+b,2)\r\nprint(ans)\r\n\r\n", "n , s = int(input()), input()\nans = 1\nfor i in range (1,n):\n ans += (s[i] != s[i-1])\nprint(min(ans+2,n))\n\t \t\t \t\t\t\t\t \t \t\t\t\t \t\t \t \t \t", "n = int(input())\ns = input()\nprint(min(n, 3 + s.count('01') + s.count('10')))", "n = int(input())\r\nA = list(map(int, ' '.join(input()).split()))\r\nres = 1\r\n\r\nfor i in range(1, len(A)):\r\n if A[i] != A[i - 1]:\r\n res += 1\r\nprint(min(res + 2, n))\r\n", "n = int(input())\r\ns = input()\r\n\r\ndp = [1]*n\r\n\r\nfor i in range(1,n):\r\n if s[i]!=s[i-1]:\r\n dp[i] = max(dp[i], dp[i-1] + 1)\r\n else:\r\n dp[i] = dp[i-1]\r\n\r\nprint(min(n, max(dp)+2))\r\n", "def main():\n n, t, a = int(input()), 0, '*'\n for b in input():\n if a == b:\n t += 1\n else:\n a = b\n print(n - max(t - 2, 0))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = input()\r\nk1, k2, k1l, k2l = 0, 0, '0', '1'\r\nfor i in s:\r\n if k1l != i:\r\n k1 += 1\r\n k1l = i\r\n if k2l != i:\r\n k2 += 1\r\n k2l = i\r\nprint(min(len(s), max(k1, k2) + 2))", "n=int(input())\r\ns=[int(i) for i in input()]\r\ndp=[[0 for _ in range(2)]for _ in range(3)]\r\nfor i in range(n):\r\n x=s[i]\r\n dp[2][x]=max(dp[2][x],max(dp[2][1^x],dp[1][1^x])+1)\r\n dp[1][1^x]=max(dp[1][1^x],max(dp[1][x],dp[0][x])+1)\r\n dp[0][x]=max(dp[0][x],dp[0][1^x]+1)\r\nprint(max(dp[2][0],dp[2][1]))\r\n \r\n", "n=int(input())\r\ns=input()\r\nmem=s[0]\r\nstreak=1\r\namount=0\r\nres=0\r\nscore=1\r\nfor l in range(1,n):\r\n if s[l]==mem:\r\n streak+=1\r\n else:\r\n mem=s[l]\r\n streak=1\r\n score+=1\r\n if streak>2:\r\n res=2\r\n elif streak==2:\r\n amount+=1\r\n if amount>1:\r\n res=2\r\nif amount+max(res-1,0)==1:\r\n res=1\r\nprint(score+res)", "n = int(input())\ns = input()\nx = 0\ny = 1\nfor i in range (n - 1):\n if s[i] == s[i + 1]:\n x += 1\n if s[i] != s[i + 1]:\n y += 1\nprint(y + min(2, x))\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\nb=input()\r\nprint(min(n,3+sum(x!=y for x,y in zip(b,b[1:]))))", "def solve(n,ar):\n #find alternating subsequence without flip\n res = 1\n\n for i in range(n-1):\n if ar[i] != ar[i+1]:\n res += 1\n print(min(res+2,n))\n\n\n\nif __name__ == '__main__':\n n = int(input())\n ar = list(input())\n\n solve(n,ar)", "'''input\n56\n10101011010101010101010101010101010101011010101010101010\n'''\nfrom sys import stdin\n\n\ndef get_count(c):\n\tcount = 0\n\tflag = False\n\ti = 1\n\twhile i < n + 2:\n\t\tif arr[i] == arr[i -1] and arr[i] == c:\n\t\t\tif i == n + 1 or i == n:\n\t\t\t\tflag = True\n\t\t\tcount += 1\n\t\t\ti += 2\n\t\t\tcontinue\n\t\ti += 1\n\treturn count, flag\n\n# main starts\nn = int(stdin.readline().strip())\narr = list(map(int, list(stdin.readline().strip())))\naux = [0]* n\naux[0] = 1\nfor i in range(1,n):\n\taux[i] = aux[i - 1]\n\tif arr[i] != arr[i - 1]:\n\t\taux[i] += 1\ncount = 0\nfor i in range(0, n - 1):\n\tif arr[i] == arr[i + 1]:\n\t\tcount += 1\n\ncount = min(count, 2)\nprint(aux[-1] + count)\n\n", "n = int(input())\r\ns = input()\r\nans = 1\r\nfor i in range(1 , n):\r\n if s[i] != s[i-1] :\r\n ans += 1\r\nprint(min(n , ans + 2 ))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nS = input()\r\n\r\nadds = 0\r\nans = 1\r\nfor i in range(1,N):\r\n if S[i]!=S[i-1]:\r\n ans+=1\r\n elif adds==0:\r\n adds=1\r\n \r\n if adds and i+1<N and S[i]==S[i+1]:\r\n adds=2\r\n \r\n \r\nprint(min(N,ans+adds))\r\n \r\n\r\n\r\n ", "n=int(input())\r\ns=input()\r\ncurr=s[0]\r\nl=1\r\nj=1\r\nwhile(j<n):\r\n if s[j]!=curr:\r\n l+=1\r\n curr=s[j]\r\n j+=1\r\nprint(min(l+2,n))", "def main():\n input()\n l, a = [0, 0], '*'\n for b in input():\n l[a == b] += 1\n a = b\n print(l[0] + min(l[1], 2))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = input()\r\narr = list(map(int, s))\r\ncnt = 0\r\npcnt = 0\r\nfor i in range(n - 1):\r\n cnt += arr[i] != arr[i + 1]\r\n pcnt += arr[i] == arr[i + 1]\r\ncnt += min(pcnt, 2)\r\nprint(cnt + 1)", "\"\"\"\nCodeforces Round #334 (Div. 2)\n\nProblem 604 C.\n\n@author yamaton\n@date 2015-12-01\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(s, n):\n if n == 1:\n return 1\n alts = sum(a != b for (a, b) in zip(s, s[1:])) + 1\n lens = [sum(1 for i in iterable) for (_, iterable) in it.groupby(s)]\n maxlen = max(lens)\n if maxlen == 1:\n return alts\n elif maxlen >= 3:\n return alts + 2\n else:\n if lens.count(2) == 1:\n return alts + 1\n else:\n return alts + 2\n\n\n\n# def pp(*args, **kwargs):\n# return print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n = int(input())\n s = input().strip()\n assert len(s) == n\n result = solve(s, n)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nl=input()\r\ncnt =''\r\ni=0 \r\nfrom itertools import groupby \r\nfor k,g in groupby(l):\r\n cnt+=k \r\ncnt=len(cnt)\r\n\r\nprint(min(cnt+2,n))\r\n\r\n\r\n", "n = map(int, input())\ns = input()\nl = []\ncnt = 1\nfor i in range( 1, len(s)):\n\tif s[i] != s[i-1]:\n\t\tl.append(cnt)\n\t\tcnt = 1\n\telse:\n\t\tcnt += 1\nl.append(cnt)\nresult = len(l)\nmax_pair = 0\nmax_count = 0\nfor i in range(len(l)):\n\tif l[i] == 2:\n\t\tmax_pair += 1\n\tmax_count = max( max_count, l[i])\nif max_pair >= 2 or max_count >= 3:\n\tadd = 2\nelif max_pair == 1:\n\tadd = 1\nelse:\n\tadd = 0\nprint(result + add)\n", "n = int(input())\r\ns = input()\r\ncur, arr = 1, []\r\nfor i in range(1, n):\r\n if s[i] == s[i - 1]:\r\n cur += 1\r\n else:\r\n arr.append(cur)\r\n cur = 1\r\narr.append(cur)\r\ncur = 0\r\nans = len(arr)\r\nfor i in arr:\r\n if i > 2:\r\n exit(print(ans + 2))\r\n if i == 2:\r\n cur += 1\r\nprint(ans + min(2, cur))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 10 11:34:34 2020\r\n\r\n@author: mahedi\r\n\"\"\"\r\n\r\nres=1\r\nn=int(input())\r\ns=input()\r\nfor i in range(1,n):\r\n res=res+(s[i]!=s[i-1])\r\nk=min(n,res+2)\r\nprint(k)", "#! /bin/python\nn = int(input())\ntab = str(input())\n\nd = 1\ntmp = 1\nchanges = 1\nfor i in range(1, n):\n if tab[i] != tab[i - 1]:\n changes += 1\nprint(min(changes + 2, n))\n\n", "n = int(input())\ns = input()\nprint(min(n, sum(i != j for i, j in zip(s, s[1:]))+3))\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 = int(input())\r\n s = input()\r\n m = 1\r\n prev = s[0]\r\n for c in s[1:]:\r\n if c != prev:\r\n m += 1\r\n prev = c\r\n add = 0\r\n if '00' in s or '11' in s:\r\n add = 1\r\n if '000' in s or '111' in s:\r\n add = 2\r\n else:\r\n i = s.find('11')\r\n if i != -1:\r\n i += 3\r\n i = s.find('11', i)\r\n if i != -1:\r\n add = 2\r\n i = s.find('00')\r\n if i != -1:\r\n i += 3\r\n i = s.find('00', i)\r\n if i != -1:\r\n add = 2\r\n i = s.find('11')\r\n if i != -1:\r\n i += 2\r\n i = s.find('00', i)\r\n if i != -1:\r\n add = 2\r\n i = s.find('00')\r\n if i != -1:\r\n i += 2\r\n i = s.find('11', i)\r\n if i != -1:\r\n add = 2\r\n print(m + add)\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", "n=int(input())\r\ns=input()\r\n\r\na,j=0,0\r\nfor i in range(len(s)):\r\n if j%2 and s[i]==\"1\":\r\n a+=1\r\n j+=1\r\n elif j%2==0 and s[i]==\"0\":\r\n a+=1\r\n j+=1\r\n\r\n\r\nb,j=0,0\r\nfor i in range(len(s)):\r\n if j%2 and s[i]==\"0\":\r\n b+=1\r\n j+=1\r\n elif j%2==0 and s[i]==\"1\":\r\n b+=1\r\n j+=1\r\n\r\ncount=max(a,b)\r\nprint(min(n,count+2))", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodeforces: servermonk\r\nCodechef: ayush572000\r\n\r\n\"\"\"\r\n# import sys\r\n# input = sys.stdin.buffer.readline\r\n\r\ndef solution():\r\n n=int(input())\r\n s=input()\r\n ans=1\r\n for i in range(1,n):\r\n if s[i]!=s[i-1]:\r\n ans+=1\r\n print(min(n,ans+2))\r\n\r\n\r\nsolution()", "n = int(input())\r\ns = input()\r\nres = 1\r\n\r\nfor i in range(0, n - 1):\r\n\tif s[i] != s[i + 1]: res += 1\r\n\t\r\nprint(min(res + 2, n))\r\n", "n = int(input())\nt = [int(i) for i in input()]\n\nch = 0\nsm = 0\n\nfor i in range(n-1):\n\tif t[i] == t[i+1]:\n\t\tsm+=1\n\telse:\n\t\tch+=1\nprint(ch + min(sm,2) + 1)\n\n", "def answer(n,A):\r\n count=1\r\n for i in range(1,n):\r\n if A[i]!=A[i-1]:\r\n count+=1\r\n \r\n return min(count+2,n)\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nprint(answer(n,s))\r\n ", "n = int(input().strip())\na = input()\ncount_pairs = 0;\ncount_diff = 0;\npred = a[0]\nfor i in range(1,n):\n\tif a[i-1]==a[i]:\n\t\tcount_pairs += 1\n\telse:\n\t\tcount_diff += 1\ncount_pairs = min(count_pairs,2)\nprint(count_pairs+count_diff+1)\n\t\n", "n = int(input())\n\ns = input()\n\nscore = 0\ncount = 0\n\nif n<=2:\n print(n)\nelse:\n for i in range(1,n):\n if s[i]!=s[i-1]:\n score+=1\n else:\n count+=1\n print(min(2,count)+score+1)\n\n\n\n", "n, s = int(input()), input()\r\nprint(min(n, s.count(\"01\") + s.count(\"10\") + 3))", "__author__ = 'Utena'\r\nn=input()\r\ns=input()\r\nt=[]\r\ndef alt(a):\r\n b=''\r\n b+=a[0]\r\n for i in a[1:len(a)]:\r\n if i!=b[-1]:\r\n b+=i\r\n return b\r\nm=len(alt(s))\r\njudge=0\r\nfor i in range(len(s)-1):\r\n if s[i+1]==s[i]:\r\n judge=1\r\n if i<len(s)-2:\r\n for j in range(i+1,len(s)-1):\r\n if s[j+1]==s[j]:\r\n print(m+2)\r\n exit(0)\r\nif judge==1:print(m+1)\r\nelse:print(m)", "def max_score(s):\n a = 0\n p = None\n for c in s:\n if c != p:\n a += 1\n p = c\n return a + min(len(s)-a, 2)\n\n\nif __name__ == '__main__':\n n = int(input())\n s = input()\n print(max_score(s))\n", "# Author : nitish420 --------------------------------------------------------------------\r\nfrom sys import stdin \r\ninput=stdin.readline\r\n\r\nn=int(input())\r\ns=input()\r\n\r\nans=1\r\nfor i in range(1,n):\r\n if s[i]!=s[i-1]:\r\n ans+=1\r\n\r\nprint(min(ans+2,n))", "n, tab, changes = int(input()), str(input()), 1\nfor i in range(1, n):\n changes += 1 if tab[i] != tab[i - 1] else 0\nprint(min(changes + 2, n))\n", "N = int(input())\r\nS = input()\r\nres = 1\r\nfor i in range(1, N):\r\n res += S[i] != S[i-1]\r\nprint(min(res+2, N))", "import sys\r\n\r\ndef answer(n, s):\r\n ctr = 0\r\n cstates = 1\r\n for i in range(1, n):\r\n if s[i] == s[i-1]:\r\n ctr += 1\r\n else:\r\n cstates += 1\r\n if ctr >= 2:\r\n cstates += 2\r\n elif ctr == 1:\r\n cstates += 1\r\n return cstates\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n s = sys.stdin.readline().rstrip()\r\n print(answer(n, s))\r\n return\r\nmain()", "def non_standard(s):\r\n result = 1\r\n for i in range(1, len(s)):\r\n result += (s[i] != s[i - 1])\r\n return min(result + 2, len(s))\r\n\r\n\r\nm = int(input())\r\nt = input()\r\nprint(non_standard(t))\r\n", "from sys import stdin\n\n\nlength = int(stdin.readline().rstrip())\nscores = stdin.readline().rstrip()\n\ndoubles_found = 0\nscore = 1\nfor i in range(length-1):\n\tif scores[i] != scores[i+1]:\n\t\tscore += 1\n\telse:\n\t\tif doubles_found < 2:\n\t\t\tscore += 1\n\t\t\tdoubles_found +=1\t\n\nprint(score)\n", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write()\n pass\n\n\ndef solve(string):\n tab = [[0 for _ in range(3)] for _ in range(len(string))]\n states = [[0 for _ in range(3)] for _ in range(len(string))]\n\n if string[0] == \"1\":\n states[0][0] = \"1\"\n states[0][2] = \"1\"\n states[0][1] = \"0\"\n else:\n states[0][0] = \"0\"\n states[0][2] = \"0\"\n states[0][1] = \"1\"\n\n tab[0][0] = 1\n tab[0][1] = 1\n tab[0][2] = 1\n\n for i in range(1, len(string)):\n ele = string[i]\n if ele != states[i - 1][0]:\n tab[i][0] = tab[i - 1][0] + 1 # add one for alternating\n states[i][0] = ele\n tab[i][1] = tab[i - 1][\n 0\n ] # flipping here would be same as tab[i-1] since they would be consecutive?\n else:\n tab[i][0] = tab[i - 1][0]\n states[i][0] = ele # they are the same, so it doesn't matter\n tab[i][1] = tab[i - 1][0] + 1 # flipping here would result in + 1\n\n if (\n ele == states[i - 1][1]\n ): # we want to flip this, so we need compare for likeness\n tab[i][1] = max(\n tab[i - 1][1] + 1, tab[i][1]\n ) # either continue flipping or start flipping\n states[i][1] = str((int(ele) - 1) % 2)\n\n if ele != states[i - 1][2]:\n tab[i][2] = tab[i - 1][2] + 1\n states[i][2] = ele\n else:\n tab[i][2] = tab[i - 1][2]\n states[i][2] = ele\n\n if tab[i][1] > tab[i][2]:\n tab[i][2] = tab[i][1]\n states[i][2] = states[i][1]\n\n return max(tab[-1])\n\n\ndef readinput():\n a = getInts()\n print(solve(getString()))\n\n\nreadinput()\n", "n = int(input())\r\ns = input()\r\nnum = 1\r\nfor i in range(1,n):\r\n if s[i] != s[i-1]:\r\n num += 1\r\n\r\nprint(min(n,num+2))\r\n", "n=int(input())\n\na=input()\n\nprint(min(n,3+a.count('01')+a.count('10')))\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\ns = input() + '2'\r\nans = cur = 1\r\nMax = j = 0\r\nflag = False\r\ncnt2 = 0\r\nfor i in range(1, n + 1):\r\n if s[i] != s[j]:\r\n j = i\r\n if s[i] != '2': ans += 1\r\n if cur >= 3: flag = True\r\n elif cur >= 2: cnt2 += 1\r\n cur = 0\r\n cur += 1\r\nif flag or cnt2 >= 2: ans += 2\r\nelif cnt2 == 1: ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\nprint(min(s.count('01')+s.count('10')+3,n))", "#This code is contributed by Siddharth\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n# ---------------------------------------------------------Code---------------------------------------------------------\r\n\r\n\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nans=1\r\nfor i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n ans+=1\r\nprint(min(ans+2,n))\r\n\r\n\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,line=int(input()),input()\nans=1+sum(line[i]!=line[i-1] for i in range(1,n))\nprint(min(ans+2,n))", "__author__ = 'MoonBall'\r\n\r\nimport sys\r\n# sys.stdin = open('data/C.in', 'r')\r\nT = 1\r\n\r\ndef process():\r\n input()\r\n s = input()\r\n\r\n if len(s) == 1:\r\n print(1)\r\n return\r\n\r\n b = []\r\n for x in s:\r\n if (not b) or b[-1][0] != x:\r\n b.append((x, 1))\r\n else:\r\n b[-1] = (b[-1][0], b[-1][1] + 1)\r\n\r\n ans = len(b)\r\n\r\n c2 = 0\r\n c3 = 0\r\n for x in b:\r\n if x[1] >= 2:\r\n c2 = c2 + 1\r\n ans = max(ans, len(b) + 1)\r\n if x[1] >= 3:\r\n c3 = c3 + 1\r\n\r\n if c2 >= 2:\r\n ans = max(ans, len(b) + 2)\r\n\r\n if c3 >= 1:\r\n ans = max(ans, len(b) + 2)\r\n \r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(T):\r\n process()\r\n", "n = int(input())\r\ns = input()\r\n\r\ndef solve(n, s):\r\n if n <= 3:\r\n return n\r\n cum = 0\r\n p = '2'\r\n count = 0\r\n for i, v in enumerate(s):\r\n if v != p:\r\n cum += 1\r\n else:\r\n count += 1\r\n p = v\r\n if count == 0:\r\n return cum\r\n elif count == 1:\r\n return cum + 1\r\n else:\r\n return cum + 2\r\n\r\nprint(solve(n, s))", "n, s, ans = int(input()), list(input()), 1\r\nflag = 0\r\n\r\nfor i in range(1, n):\r\n if s[i] == s[i - 1]:\r\n s[i] = str(int(s[i]) ^ 1)\r\n flag = 1\r\n elif flag:\r\n break\r\n\r\n# print(''.join(s))\r\nlast = s[0]\r\nfor i in s[1:]:\r\n if i != last:\r\n last = i\r\n ans += 1\r\nprint(ans)\r\n", "# brownfox2k6\r\n\r\nn = int(input())\r\ns = input()\r\nalt = 1\r\nfor i in range(1, n):\r\n alt += s[i] != s[i-1]\r\n\r\n# at most we can get +2\r\nans = min(n, alt + 2)\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nprint(min(n,s.count(\"01\")+s.count(\"10\")+3))", "def process(S):\r\n my_max = 1\r\n n = len(S)\r\n curr = [[S[0], 1]]\r\n for i in range(1, n):\r\n if S[i]==curr[-1][0]:\r\n curr[-1][1]+=1\r\n my_max = max(my_max, curr[-1][1])\r\n else:\r\n curr.append([S[i], 1])\r\n two_count = 0\r\n for a, b in curr:\r\n if b >= 2:\r\n two_count+=1\r\n m = len(curr)\r\n if my_max >= 3 or two_count >= 2:\r\n return m+2\r\n elif two_count==0:\r\n return m\r\n else:\r\n return m+1\r\n \r\nn = int(input())\r\nS = input()\r\nprint(process(S))", "n = int(input())\r\ns = input()\r\n\r\nprint(min(s.count(\"01\")+s.count(\"10\")+3,n))", "n = int(input())\r\nseq = input()\r\nprev = -1\r\nans = 0\r\nfor e in seq:\r\n if e != prev:\r\n ans += 1\r\n prev = e\r\n\r\n\r\nprint(min(n, ans + 2))", "from collections import defaultdict, deque\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\ns = input()\r\nt=''\r\nc=0\r\ntw,th=False,False\r\nl=-1\r\nov=0\r\nfor i in range(n):\r\n if t==s[i]:\r\n pass\r\n else:\r\n t=s[i]\r\n c+=1\r\nprint(min(c+2, n))\r\n\r\n", "n = int(input())\r\ns = input()\r\nprint(min(n,sum(s[i]!=s[i-1] for i in range(1,n))+3))", "n = int(input())\r\n\r\ns = [int(x) for x in list(input())]\r\n\r\ndp = [0,0]\r\ndp[s[0]]=1\r\nfor i in range(1,n):\r\n j = s[i]\r\n \r\n if j==0:\r\n x = max(dp[1]+1, dp[0])\r\n y = dp[1]\r\n else:\r\n x = dp[0]\r\n y = max(dp[0]+1, dp[1])\r\n\r\n #print(x,y)\r\n dp[0],dp[1] = x,y\r\nans = max(dp[0],dp[1])\r\nprint(min(n, ans+2))", "n = int(input())\r\ns = list(input())\r\n# n = 86137\r\n# s = '0'\r\n# for i in range(n-2):\r\n# s += '1' if s[-1] == '0' else '0'\r\n\r\n# s += s[-1]\r\n# s += s[-1]\r\n\r\nans = len([s[i] for i in range(len(s)-1) if s[i] != s[i+1]])+1\r\nfor i in range(n-1):\r\n if s[i] == s[i+1]:\r\n ans += 1\r\n break\r\n\r\nfor j in range(n-1, 0, -1):\r\n if j-1 == i:\r\n break\r\n elif s[j] == s[j-1]:\r\n ans += 1\r\n break\r\nprint(ans)\r\n\r\n\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\ns = sys.stdin.readline()\r\ns = list(s)\r\na = []\r\nk=1\r\nfor i in range(n):\r\n if i == n-1:\r\n a.append(k)\r\n break\r\n if s[i]==s[i+1]:\r\n k+=1\r\n else:\r\n a.append(k)\r\n k = 1\r\n\r\nadd_amount = 0\r\ncount = 0\r\nfor i in range(n-1):\r\n if s[i]==s[i+1]:\r\n count+=1\r\n\r\n\r\nadd_amount=min(2,count)\r\n\r\nprint(len(a) + add_amount)\r\n\r\n\r\n\r\n" ]

[ "def fix(a,b,c):\r\n\tret=min(a,c+k-1)-max(c-k+1,b)-k+2\r\n\treturn [0,ret][ret>0]\r\ndef solve(row,col):\r\n\ta1=a2=row\r\n\ta3=a4=col\r\n\twhile(a1+1>=0 and a1+1<n and mp[a1+1][col]!='#'):\r\n\t\ta1+=1\r\n\twhile(a2-1>=0 and a2-1<n and mp[a2-1][col]!='#'):\r\n\t\ta2-=1\r\n\twhile(a3+1>=0 and a3+1<n and mp[row][a3+1]!='#'):\r\n\t\ta3+=1\r\n\twhile(a4-1>=0 and a4-1<n and mp[row][a4-1]!='#'):\r\n\t\ta4-=1\r\n\treturn fix(a1,a2,row)+fix(a3,a4,col)\r\nn,k=map(int,input().split())\r\nmp=[]\r\nr=c=ans=0\r\nfor _ in range(n):\r\n\tmp.append(input())\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif mp[i][j]!= '#':\r\n\t\t\ttp = solve(i, j)\r\n\t\t\tif tp>ans:\r\n\t\t\t\tans=tp\r\n\t\t\t\tr=i\r\n\t\t\t\tc=j\r\nprint(r+1,c+1)", "n, k = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\nmx, I, J = 0, 0, 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == '#':\r\n continue\r\n iup, ido = i, i\r\n jup, jdo = j, j\r\n while iup >= 0 and a[iup][j] == '.':\r\n iup -= 1\r\n while ido < n and a[ido][j] == '.':\r\n ido += 1\r\n while jup >= 0 and a[i][jup] == '.':\r\n jup -= 1\r\n while jdo < n and a[i][jdo] == '.':\r\n jdo += 1\r\n iup = max(iup + 1, i - k + 1)\r\n ido = min(ido - 1, i + k - 1)\r\n jup = max(jup + 1, j - k + 1)\r\n jdo = min(jdo - 1, j + k - 1)\r\n tmp = max((ido - iup + 1)-(k-1), 0) + max(0, (jdo - jup + 1) - (k-1))\r\n if tmp > mx:\r\n mx = tmp\r\n I, J = i, j\r\nprint(I + 1, end=\" \")\r\nprint(J + 1)\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\ndef f(s,i):\n l=max(0,i-k+1);c=s.rfind('#',l,i+1)\n if c<0:c=l-1\n r=min(n,i+k);d=s.find('#',i,r)\n if d<0:d=r\n return max(0,d-c-k)\nr=range(n)\na=[input()for _ in r]\nb=[''.join(x)for x in zip(*a)]\nm,i,j=max((f(a[i],j)+f(b[j],i),i,j)for\ni in r for j in r)\nprint(i+1,j+1)\n", "def check1(a,b):\r\n po1=[(i+a,b) for i in range(k)]\r\n flag=True\r\n for i in range(k):\r\n x,y=po1[i][0],po1[i][1]\r\n if field[y][x]==\"#\":\r\n flag=False\r\n break\r\n if flag:\r\n for a in range(k):\r\n x,y=po1[a][0],po1[a][1]\r\n t[y][x]+=1\r\ndef check2(a,b):\r\n po1=[(a,b+i) for i in range(k)]\r\n flag=True\r\n for i in range(k):\r\n x,y=po1[i][0],po1[i][1]\r\n if field[y][x]==\"#\":\r\n flag=False\r\n if flag:\r\n for a in range(k):\r\n x,y=po1[a][0],po1[a][1]\r\n t[y][x]+=1\r\nn,k=map(int,input().split())\r\nfield=[]\r\nt=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n field.append(list(input()))\r\nfor x in range(n-k+1):\r\n for y in range(n):\r\n check1(x,y)\r\nfor x in range(n):\r\n for y in range(n-k+1):\r\n check2(x,y)\r\nbest=-1\r\nbest_cor=[-1,-1]\r\nfor x in range(n):\r\n for y in range(n):\r\n if t[y][x] > best:\r\n best=t[y][x]\r\n best_cor=[y+1,x+1]\r\nprint(*best_cor)", "n,k=map(int,input().split())\r\ndef f(s,i):\r\n l=max(0,i-k+1);c=s.rfind('#',l,i+1);r=min(n,i+k);d=s.find('#',i,r)\r\n if c<0:c=l-1\r\n if d<0:d=r\r\n return max(0,d-c-k)\r\nr=range(n)\r\na=[input()for _ in r]\r\nb=[''.join(x)for x in zip(*a)]\r\nm,i,j=max((f(a[i],j)+f(b[j],i),i,j)for\r\ni in r for j in r)\r\nprint(i+1,j+1)", "n,k = map(int, input().split())\nfield = [input() for _ in range(n)]\nfield_ = [''.join([field[i][j] for i in range(n)]) for j in range(n)]\n# print(field)\n# print(field_)\nfor_ans = [[0]*n for i in range(n)]\nfor_s = '.' * k\n# print(for_ans)\n# print(for_s)\nfor i,val in enumerate(field):\n for j in range(n-k+1):\n if(val[j:j+k]==for_s):\n for j_ in range(j,j+k):\n for_ans[i][j_] +=1\n\nfor i,val in enumerate(field_):\n for j in range(n-k+1):\n if(val[j:j+k] == for_s):\n for j_ in range(j,j+k):\n for_ans[j_][i] += 1\n\nans = 0\nx,y = 1,1\nfor i in range(n):\n for j in range(n):\n if for_ans[i][j] > ans:\n ans = for_ans[i][j]\n x = i+1\n y = j+1\nprint(x,y)\n\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tl.append(s)\r\nd={}\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\td.update({(i+1,j+1):0})\r\ntemp,index,f1,f2=[],0,False,False\r\nfor i in range(n):\r\n\tf=''\r\n\tfor j in range(n):\r\n\t\tf=f+l[j][index]\r\n\tindex+=1\r\n\ttemp.append(f)\r\nfor i in range(n):\r\n\tfor j in range(n-k+1):\r\n\t\tx=l[i][j:j+k]\r\n\t\ty=temp[i][j:j+k]\r\n\t\tif len(set(x))==1 and x[0]=='.':\r\n\t\t\tf1=True\r\n\t\t\tfor m in range(j,j+k):\r\n\t\t\t\td[(i+1,m+1)]+=1\r\n\t\tif len(set(y))==1 and y[0]=='.':\r\n\t\t\tf2=True\r\n\t\t\tfor m in range(j,j+k):\r\n\t\t\t\td[(m+1,i+1)]+=1\r\nm,point=d[(1,1)],(1,1)\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,n+1):\r\n\t\tt=(i,j)\r\n\t\tif d[t]>m:\r\n\t\t\tm=d[t]\r\n\t\t\tpoint=(i,j)\r\np=list(point)\r\nif f1 or f2:\r\n\tprint(p[0],p[1])\r\nelse:\r\n\tprint(n,n)", "n = input().split()\r\n[n, k] = list(map(int, n))\r\n\r\ngrid = []\r\nfor i in range(n):\r\n l = input()\r\n l = list(l)\r\n grid.append(l)\r\n\r\narr = [[0 for i in range(n)] for i in range(n)]\r\n\r\n# horizontal \r\nfor i in range(n):\r\n for j in range(n-k+1):\r\n b = True\r\n for m in range(j, j+k):\r\n if grid[i][m] == '#':\r\n b = False\r\n break;\r\n if b:\r\n # print(i, j)\r\n for m in range(j, j+k):\r\n arr[i][m] +=1\r\n\r\n# vertical\r\nfor j in range(n):\r\n for i in range(n-k+1):\r\n b = True\r\n for m in range(i, i+k):\r\n if grid[m][j] == '#':\r\n b = False\r\n break\r\n if b:\r\n # print(i, j)\r\n for m in range(i, i+k):\r\n arr[m][j]+=1\r\n\r\n# print(arr)\r\nmaxi = 0\r\nans = (0, 0)\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j] > maxi:\r\n maxi = arr[i][j]\r\n ans = (i, j)\r\nprint(ans[0]+1, ans[1]+1)\r\n ", "n, k = map(int, input().split())\r\n\r\noccupied_cells = []\r\npositions = []\r\nfor _ in range(n):\r\n positions.append([i for i in input()])\r\n occupied_cells.append([0] * n)\r\n\r\nfor row in range(n):\r\n for column in range(n):\r\n if positions[row][column] == '.':\r\n column2 = column\r\n k2 = k\r\n good_cells = []\r\n while k2 != 0 and column2 < n and len(good_cells) != k:\r\n if positions[row][column2] == '.':\r\n good_cells.append([row, column2])\r\n k2 -= 1\r\n column2 += 1\r\n else:\r\n break\r\n if len(good_cells) == k:\r\n for cell in good_cells:\r\n occupied_cells[cell[0]][cell[1]] += 1\r\n\r\nfor column in range(n):\r\n for row in range(n):\r\n if positions[row][column] == '.':\r\n row2 = row\r\n k2 = k\r\n good_cells = []\r\n while k2 != 0 and row2 < n and len(good_cells) != k:\r\n if positions[row2][column] == '.':\r\n good_cells.append([row2, column])\r\n k2 -= 1\r\n row2 += 1\r\n else:\r\n break\r\n if len(good_cells) == k:\r\n for cell in good_cells:\r\n occupied_cells[cell[0]][cell[1]] += 1\r\n\r\nmax_points = 0\r\ncoordinates = [1, 1]\r\nfor row in range(n):\r\n for column in range(n):\r\n if occupied_cells[row][column] > max_points:\r\n max_points = occupied_cells[row][column]\r\n coordinates = [row + 1, column + 1]\r\n\r\nprint(*coordinates)\r\n", "n, k = map(int, input().split())\r\nm = []\r\nfor i in range(n):\r\n u = str(input())\r\n m.append(u)\r\nv = [[0] * n for _ in range(n)]\r\nfor x in range(n - k + 1):\r\n for y in range(n):\r\n s = m[y][x:x+k]\r\n if not '#' in s:\r\n for i in range(k):\r\n v[y][x + i] += 1\r\nfor x in range(n):\r\n for y in range(n - k + 1):\r\n o = m[y:y+k]\r\n s = [o[q][x] for q in range(k)]\r\n if not '#' in s:\r\n for i in range(k):\r\n v[y + i][x] += 1\r\nmx = 0\r\nmy = 0\r\nm = v[0][0]\r\nfor i in range(n):\r\n for q in range(n):\r\n if v[i][q] > m:\r\n mx = q\r\n my = i\r\n m = v[i][q]\r\nprint(my + 1, mx + 1)", "n, k = map(int, input().split())\r\nf = [list(input()) for _ in range(n)]\r\n \r\nans = (1, 1)\r\nr = [[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if f[i][j] == '#':\r\n r[i][j] = 0\r\n elif i == 0:\r\n r[i][j] = 1\r\n else:\r\n r[i][j] = r[i - 1][j] + 1\r\nc = [[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if f[i][j] == '#':\r\n c[i][j] = 0\r\n elif j == 0:\r\n c[i][j] = 1\r\n else:\r\n c[i][j] = c[i][j - 1] + 1\r\n \r\ns = [[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n for l in range(k):\r\n if i + l < n and k <= r[i + l][j]:\r\n s[i][j] += 1\r\n if j + l < n and k <= c[i][j + l]:\r\n s[i][j] += 1\r\n if s[ans[0] - 1][ans[1] - 1] < s[i][j]:\r\n ans = (i + 1, j + 1)\r\nprint(' '.join(map(str, ans)))", "n,k=map(int,input().split())\r\nA=[]\r\nB=[]\r\nfor i in range(0,n):\r\n s=str(input())\r\n A.append(s)\r\nfor i in range(0,n*n):\r\n B.append(0)\r\n\r\nfor i in range(0,n): # Horizontal\r\n for j in range(0,n-k+1):\r\n flag=0\r\n for l in range(j,j+k):\r\n if(A[i][l]==\"#\"):\r\n flag=1\r\n if(flag==0):\r\n for l in range(j,j+k):\r\n B[(i*n)+l]+=1\r\n\r\nfor i in range(0,n): #Vertical\r\n for j in range(0,n-k+1): \r\n flag=0\r\n for l in range(j,j+k):\r\n if(A[l][i]==\"#\"):\r\n flag=1\r\n if(flag==0):\r\n for l in range(j,j+k):\r\n B[(l*n)+i]+=1\r\nmaxi=0\r\nj=0\r\nfor i in range(0,n*n):\r\n if(B[i]>maxi):\r\n j=i\r\n maxi=B[i]\r\nprint(int(j/n)+1,(j%n)+1)\r\n", "#\n# from math import ceil\n#\n# n, m, k, l = map(int, input().split())\n#\n# to_give = int(ceil((l+k)/m))\n#\n# if (to_give*m) > n:\n# print(-1)\n# else:\n# print(to_give)\n\nn, k = map(int, input().split())\n\nmat = []\nans = [[0] * n for _ in range(n)]\n\nfor i in range(n):\n mat.append(input())\n\nfor i in range(n):\n for j in range(n):\n # for p in ans:\n # print(p)\n if mat[i][j] == '.':\n flag = True\n #vertical check\n for x in range(i,i+k):\n\n if x >= n or mat[x][j] == '#':\n flag = False\n break\n if flag:\n for x in range(i, i + k):\n ans[x][j] += 1\n\n #horizontal check\n flag = True\n for x in range(j, j+k):\n if x >= n or mat[i][x] == '#':\n flag = False\n break\n if flag:\n for x in range(j, j+k):\n ans[i][x] += 1\n# for i in mat:\n# print(i)\n# for i in ans:\n# print(i)\nmaxi = -1\nrow = 0\ncol = 0\nfor i in range(n):\n for j in range(n):\n if ans[i][j] > maxi:\n maxi = ans[i][j]\n row = i\n col = j\nprint(row+1, col+1)\n\n\n", "n,k = map(int, input().split())\r\ndef auxiliary(strings, index):\r\n leftIndex = max(0, index-k+1)\r\n c = strings.rfind(\"#\",leftIndex,index+1)\r\n rightIndex = min(n,index+k)\r\n d = strings.find(\"#\",index, rightIndex)\r\n if c < 0: c = leftIndex-1\r\n if d < 0: d = rightIndex\r\n return max(0, d-c-k)\r\n\r\nr = range(n)\r\na = [input() for _ in r]\r\nb = [\"\".join(_) for _ in zip(*a)]\r\n_,i,j = max([ (auxiliary(a[i],j)+auxiliary(b[j],i),i,j) for i in r for j in r])\r\nprint(i+1,j+1)", "x=list(map(int,input().split()))\nfield=[]\nfor i in range(x[0]):\n \n q=input()\n field.append([i for i in q])\n \npoints=[[0]*x[0] for i in range(x[0])]\n\n \n\n\ncheckerfield=[]\ncheckerfieldtrans=[]\nship=['.']*x[1]\nfor i in range(x[0]):\n for j in range(x[0]):\n checkerfield.append(field[i][j])\n checkerfieldtrans.append(field[j][i])\nmaxi=0\nmaxiind=[0,0] \nfor r in range(x[0]):\n for p in range(x[0]-x[1]+1):\n fp=p+x[1]\n if checkerfield[p+r*x[0] : fp+r*x[0]]== ship:\n for i in range(x[1]):\n points[r][i+p]=points[r][i+p]+1\n if points[r][i+p] >= maxi :\n maxi=points[r][i+p]\n maxiind=[r,i+p]\n \npointstrans=[[points[j][i] for j in range(x[0])] for i in range(x[0])]\nfor r in range(x[0]):\n for p in range(x[0]-x[1]+1):\n fp=p+x[1]\n if checkerfieldtrans[p+r*x[0] : fp+r*x[0]]== ship:\n for i in range(x[1]):\n pointstrans[r][i+p]=pointstrans[r][i+p]+1\n \n if pointstrans[r][i+p] >= maxi :\n \n maxi=pointstrans[r][i+p]\n maxiind=[i+p,r]\n \n \n \nprint(maxiind[0]+1,maxiind[1]+1) \n \n", "# coding=utf-8\n\nn, k = map(int, input().split())\n\ns = [[]for _ in range(n)]\n\nfor i in range(n):\n s[i] = input()\n\nf = [[1 for d in range(n)] for _ in range(n)]\nfor i in range(n):\n for j in range(n):\n ssum = 0\n for t in range(j, min(j+k, n)):\n if s[i][t] == '.':\n ssum += 1\n else:\n break\n if ssum >= k:\n for t in range(k):\n f[i][j+t] = f[i][j+t] + 1\nfor i in range(n):\n for j in range(n):\n ssum = 0\n for t in range(j, min(n, j+k)):\n if s[t][i] == '.':\n ssum += 1\n else:\n break\n if ssum >= k:\n for t in range(k):\n f[j+t][i] += 1\nans, ans_x, ans_y = 0, 0, 0\nfor i in range(n):\n for j in range(n):\n if ans < f[i][j]:\n ans = f[i][j]\n ans_x = i+1\n ans_y = j+1\n\nprint(ans_x, ans_y)\n\n", "n, k = map(int, input().split())\r\ns=[]\r\nfor i in range (n):\r\n s.append(input())\r\np=[1, 1]\r\nv=0\r\nfor i in range (n):\r\n for j in range(n):\r\n if s[i][j]=='.':\r\n iv=i\r\n jv=j\r\n l=0\r\n r=0\r\n u=0\r\n d=0\r\n vc=0\r\n while (jv-1>=0 and j-jv<k and s[i][jv-1]=='.'):\r\n jv-=1\r\n l+=1\r\n jv=j\r\n while (jv!=n and jv-j<k and s[i][jv]=='.'):\r\n jv+=1\r\n r+=1\r\n if (l+r+2-k)>=0:\r\n vc=l+r+2-k\r\n while (iv-1>=0 and i-iv<k and s[iv-1][j]=='.'):\r\n iv-=1\r\n u+=1\r\n iv=i\r\n while (iv!=n and iv-i<k and s[iv][j]=='.'):\r\n iv+=1\r\n d+=1\r\n if(u+d+2-k)>=0:\r\n vc+=u+d+2-k\r\n if vc>v:\r\n v=vc\r\n p[0]=i+1\r\n p[1]=j+1\r\nprint(' '.join(str(i) for i in p))\r\n\r\n\r\n", "from sys import stdin\r\nfrom math import ceil\r\nn,m=map(int,stdin.readline().strip().split())\r\ns=[list(stdin.readline().strip()) for i in range(n)]\r\nacum1=[[0 for i in range(n)] for j in range(n)]\r\nans=-1\r\nx=-1\r\ny=-1\r\nfor i in range(n):\r\n for j in range(n):\r\n acum=0\r\n acum0=0\r\n acum1=0\r\n acum11=0\r\n for k in range(j,-1,-1):\r\n if s[i][k]==\"#\":\r\n break\r\n acum0+=1\r\n \r\n\r\n for k in range(i,-1,-1):\r\n if s[k][j]==\"#\":\r\n break\r\n acum11+=1\r\n \r\n acum0-=1\r\n acum11-=1\r\n ans1=0\r\n for k in range(j,n):\r\n if s[i][k]==\"#\":\r\n break\r\n if (abs(k-j)<m) and acum0+abs(k-j)+1>=m:\r\n ans1+=1\r\n for k in range(i,n):\r\n if s[k][j]==\"#\":\r\n break\r\n if (abs(k-i)<m) and acum11+abs(k-i)+1>=m:\r\n ans1+=1\r\n if ans1>ans:\r\n x=i+1\r\n y=j+1\r\n ans=ans1\r\nprint(x,y)\r\n", "n, k = map(int, input().split())\r\nu = []\r\na = []\r\nfor i in range(n):\r\n u.append(list(input()) + ['#'])\r\n a.append([0] * n)\r\nu.append(['#'] * n)\r\nfor i in range(n):\r\n for j in range(n):\r\n if u[i][j] == '.':\r\n ok = True\r\n for p in range(1, k):\r\n if u[i][j + p] != '.':\r\n ok = False\r\n break\r\n if ok:\r\n for p in range(k):\r\n a[i][j + p] += 1\r\n ok = True\r\n for p in range(1, k):\r\n if u[i + p][j] != '.':\r\n ok = False\r\n break\r\n if ok:\r\n for p in range(k):\r\n a[i + p][j] += 1\r\nma = 0\r\nmi = (1, 1)\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] > ma:\r\n ma = a[i][j]\r\n mi = (i + 1, j + 1)\r\nprint(mi[0], mi[1])\r\n", "n, k = list(map(int, input().split()))\r\n\r\nmy_map = []\r\nfor i in range(0, n):\r\n\tinitial = list(input())\r\n\tline = []\r\n\tfor it in initial:\r\n\t\tline += it\r\n\tmy_map.append(line)\r\n\r\nmy_counter = [[0 for i in range(n)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n\tif len([it for it in my_map[i] if it == \".\"]) >= k:\r\n\t\tstart = 0\r\n\t\t\r\n\t\twhile(start + k <= n):\r\n\t\t\tfit = True\r\n\t\t\tfor j in range(start, start+k):\r\n\t\t\t\tif my_map[i][j] == \"#\":\r\n\t\t\t\t\tfit = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif fit:\r\n\t\t\t\tfor j in range(start, start+k):\r\n\t\t\t\t\tmy_counter[i][j] += 1\r\n\t\t\tstart += 1\r\n\r\n\r\nrev = [[\"0\" for i in range(n)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\trev[j][i] = my_map[i][j]\r\n\r\nfor i in range(n):\r\n\tif len([it for it in rev[i] if it == \".\"]) >= k:\r\n\t\tstart = 0\r\n\t\t\r\n\t\twhile(start + k <= n):\r\n\t\t\tfit = True\r\n\t\t\tfor j in range(start, start+k):\r\n\t\t\t\tif rev[i][j] == \"#\":\r\n\t\t\t\t\tfit = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif fit:\r\n\t\t\t\tfor j in range(start, start+k):\r\n\t\t\t\t\tmy_counter[j][i] += 1\r\n\t\t\tstart += 1\r\n\r\nmax_value = max(my_counter[0])\r\nfor line in my_counter:\r\n\tmax_value = max(max_value, max(line))\r\n\r\nif max_value == 0:\r\n\tprint(\"1 1\")\r\nelse:\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif my_counter[i][j] == max_value:\r\n\t\t\t\tprint(i+1, j+1)\r\n\t\t\t\texit()\r\n", "import sys\r\n\r\n\r\ndef read_input(input_path=None):\r\n if input_path is None:\r\n f = sys.stdin\r\n else:\r\n f = open(input_path, 'r')\r\n\r\n n, k = map(int, f.readline().split())\r\n field = list()\r\n for _ in range(n):\r\n field.append(f.readline().rstrip())\r\n\r\n return n, k, field\r\n\r\n\r\n# def sol(n, k, field):\r\n# ans = [(1, 1)]\r\n# horizonal = [[0 for _ in range(n)] for _ in range(n)]\r\n# for i in range(n):\r\n# for j in range(n):\r\n# if field[i][j] == '#':\r\n# horizonal[i][j] = 0\r\n# elif i == 0:\r\n# horizonal[i][j] = 1\r\n# else:\r\n# horizonal[i][j] = horizonal[i - 1][j] + 1\r\n# vertical = [[0 for _ in range(n)] for _ in range(n)]\r\n# for i in range(n):\r\n# for j in range(n):\r\n# if field[i][j] == '#':\r\n# vertical[i][j] = 0\r\n# elif j == 0:\r\n# vertical[i][j] = 1\r\n# else:\r\n# vertical[i][j] = vertical[i][j - 1] + 1\r\n# \r\n# f = [[0 for _ in range(n)] for _ in range(n)]\r\n# for i in range(n):\r\n# for j in range(n):\r\n# for z in range(k):\r\n# if i + z < n and k <= horizonal[i + z][j]:\r\n# f[i][j] += 1\r\n# if j + z < n and k <= horizonal[i][j + z]:\r\n# f[i][j] += 1\r\n# if f[ans[0][0] - 1][ans[0][1] - 1] < f[i][j]:\r\n# ans = [(i + 1, j + 1)]\r\n# elif f[ans[0][0] - 1][ans[0][1] - 1] < f[i][j]:\r\n# ans.append((i + 1, j + 1))\r\n# if sum([sum(f[i]) for i in range(n)]) == 0:\r\n# ans = list()\r\n# for i in range(n):\r\n# for j in range(n):\r\n# if field[i][j] == '.':\r\n# ans.append((i + 1, j + 1))\r\n# \r\n# return ans\r\n\r\ndef sol(a, b, z):\r\n r=[[0]*a for _ in \" \"*a]\r\n c=[[0]*a for _ in \" \"*a]\r\n for i in range(a):\r\n for j in range(a-b+1):\r\n ok=1\r\n for k in range(b):\r\n if z[i][j+k]=='#':ok=0;break\r\n if ok:\r\n for k in range(b):\r\n r[i][j+k]+=1\r\n ok=1\r\n for k in range(b):\r\n if z[j+k][i]=='#':ok=0;break\r\n if ok:\r\n for k in range(b):\r\n c[j+k][i]+=1\r\n i1,j1=1,1;ma=0\r\n for i in range(a):\r\n for j in range(a):\r\n if c[i][j]+r[i][j]>ma:i1=i+1;j1=j+1;ma=c[i][j]+r[i][j]\r\n return [(i1, j1)]\r\n\r\n#\r\n#\r\n# def answer(input_path=None):\r\n# return battleship(*read_input(input_path))\r\n#\r\n#\r\n# def judge(input_path, outputs):\r\n# try:\r\n# assert len(outputs) == 1\r\n#\r\n# x, y = map(int, outputs[0].split())\r\n#\r\n# ans = battleship(*read_input(input_path))\r\n# print(ans)\r\n#\r\n# # if (x, y) in ans:\r\n# # return 'passed'\r\n# # return 'wrong answer'\r\n# if x == ans[0] and y == ans[1]:\r\n# return 'passed'\r\n# return 'wrong answer'\r\n# except:\r\n# return 'runtime error'\r\n\r\n\r\ndef main():\r\n for ans in sol(*read_input()):\r\n print(f\"{' '.join(map(str, ans))}\")\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n # print(judge('/mnt/sdb2/data/contest21/4/C/sample/test_53.txt', ['1 8']))\r\n", "def count(s,i,k):\n l=max(0,i-k+1)\n cl=s.rfind('#',l,i+1)\n if cl<0:cl=l-1\n r=min(len(s),i+k)\n cr=s.find('#',i,r)\n if cr<0:cr=r\n return max(0,cr-cl-k)\nn,k=map(int,input().split())\na=[input()for _ in[0]*n]\nb=[''.join(x)for x in zip(*a)]\nm=im=jm=0\nfor i in range(n):\n for j in range(n):\n c = count(a[i],j,k)+count(b[j],i,k)\n if c>m:m,im,jm=c,i,j\nprint(im+1,jm+1)\n", "n, k = map(int, input().split())\ndef f(s, i):\n l = max(0, i - k + 1)\n p = max(s.rfind('#', l, i + 1), l - 1)\n r = min(n, i + k)\n q = s.find('#', i, r)\n if q < 0:\n q = r\n return max(0, q - p - k)\na = [[], []]\nfor _ in range(n):\n a[0].append(input())\na[1] = [''.join(s) for s in zip(*a[0])]\nb = []\nfor i in range(n):\n for j in range(n):\n b.append([f(a[0][i], j) + f(a[1][j], i), i, j])\nb.sort()\nprint(b[-1][1] + 1, b[-1][2] + 1)\n", "# get inputs\nmap_size, ship_size = list(map(int, input().split()))\nmap = [[0 for _ in range(map_size)] for _ in range(map_size)]\nfor i in range(map_size):\n tmpRow = list(input())\n for j in range(map_size):\n if tmpRow[j] == '.':\n map[i][j] = 1\n\nresults = [[0 for _ in range(map_size)] for _ in range(map_size)]\nmax_i, max_j = 0, 0\nmax_value = 0\nfor i in range(map_size):\n for j in range(map_size):\n if map[i][j]==1:\n tmp_cnt = 0\n for k in range(j, min(j+ship_size,map_size)):\n if map[i][k] == 1:\n tmp_cnt += 1\n if tmp_cnt == ship_size:\n for p in range(j, min(j+ship_size,map_size)):\n results[i][p] += 1\n tmp_cnt = 0\n for k in range(i, min(i + ship_size, map_size)):\n if map[k][j] == 1:\n tmp_cnt += 1\n if tmp_cnt == ship_size:\n for p in range(i, min(i + ship_size, map_size)):\n results[p][j] += 1\n\nfor i in range(map_size):\n for j in range(map_size):\n if results[i][j] > max_value:\n max_value = results[i][j]\n max_i = i\n max_j = j\nprint(max_i+1, max_j+1)\n", "s = list(map(int, input().split()))\r\nn, k = s[0], s[1]\r\ncl = []\r\nfor i in range(n):\r\n cl.append(input())\r\n\r\nmx = 0\r\nres = (0, 0)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n pos = 0\r\n while(j-pos>=0 and pos<=k-1 and cl[i][j-pos]=='.'):\r\n pos+=1\r\n a = j-pos\r\n pos = 0\r\n while(j+pos<n and pos<=k-1 and cl[i][j+pos]=='.'):\r\n pos+=1\r\n b = j+pos\r\n \r\n pos = 0\r\n while(i-pos>=0 and pos<=k-1 and cl[i-pos][j]=='.'):\r\n pos+=1\r\n c = i-pos\r\n pos = 0\r\n while(i+pos<n and pos<=k-1 and cl[i+pos][j]=='.'):\r\n pos+=1\r\n d = i+pos\r\n \r\n x = b-a\r\n y = d-c\r\n e1 = 0\r\n e2 = 0\r\n if x>=k:\r\n e1 = x-k\r\n if y>=k:\r\n e2 = y-k\r\n \r\n e = e1+e2\r\n if e>mx:\r\n mx = e\r\n res = (i, j)\r\n \r\nprint('{} {}'.format(res[0]+1, res[1]+1))", "a,b=map(int,input().split())\r\nz=[input() for _ in \" \"*a]\r\nr=[[0]*a for _ in \" \"*a]\r\nc=[[0]*a for _ in \" \"*a]\r\nfor i in range(a):\r\n for j in range(a-b+1):\r\n ok=1\r\n for k in range(b):\r\n if z[i][j+k]=='#':ok=0;break\r\n if ok:\r\n for k in range(b):\r\n r[i][j+k]+=1\r\n ok=1\r\n for k in range(b):\r\n if z[j+k][i]=='#':ok=0;break\r\n if ok:\r\n for k in range(b):\r\n c[j+k][i]+=1\r\ni1,j1=1,1;ma=0\r\nfor i in range(a):\r\n for j in range(a):\r\n if c[i][j]+r[i][j]>ma:i1=i+1;j1=j+1;ma=c[i][j]+r[i][j]\r\nprint(i1,j1)", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\t\r\nmaxans = 0\r\nxans = 0\r\nyans = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n curans = 0\r\n up = 0\r\n while up < k and i - up >= 0 and a[i - up][j] == '.':\r\n up += 1\r\n down = 0\r\n while down < k and i + down < n and a[i + down][j] == '.':\r\n down += 1\r\n curans += max(0, down + up - k)\r\n\t\t\r\n if k != 1:\r\n left = 0\r\n while left < k and j - left >= 0 and a[i][j - left] == '.':\r\n left += 1\r\n right = 0\r\n while right < k and j + right < n and a[i][j + right] == '.':\r\n right += 1\r\n curans += max(0, right + left - k)\r\n\t\t\t\r\n if curans > maxans:\r\n maxans = curans\r\n xans = i\r\n yans = j\r\n\t\t\t\r\n#print(\"{} {}\".format(xans + 1, yans + 1))\r\nprint(xans + 1, yans + 1)", "from collections import Counter\r\nn,k=map(int,input().split())\r\nv=[input().strip() for _ in range(n)]\r\ns=Counter()\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif all(x<n and v[x][j]=='.' for x in range(i,i+k)): s.update((x+1,j+1) for x in range(i,i+k))\r\n\t\tif all(x<n and v[i][x]=='.' for x in range(j,j+k)): s.update((i+1,x+1) for x in range(j,j+k))\r\nif len(s)==0: s[(1,1)]+=1\r\nprint(*s.most_common(1)[0][0])", "n=input().split()\nr=int(n[0])\nk=int(n[1])\nl=[]\nfor i in range(r):\n li=input()\n l.append(li)\nrl=[]\nfor i in range(r):\n x=[]\n for j in range(r):\n x.append(0)\n rl.append(x)\nfor i in range(r):\n for j in range(len(l[i])):\n flag=0\n f=0\n if j+k<=r:\n for q in range(k):\n if l[i][j+q:j+q+1]=='.':\n continue\n else:\n flag=1\n break\n if flag==0:\n for q in range(k):\n rl[i][j+q]=rl[i][j+q]+1\n if flag==1:\n j=q+1\nfor i in range(r):\n for j in range(r):\n flag=0\n f=0\n if j+k<=r:\n for q in range(k):\n if l[j+q][i:i+1]=='.':\n continue\n else:\n flag=1\n break\n if flag==0:\n for q in range(k):\n rl[j+q][i]=rl[j+q][i]+1\n if flag==1:\n j=q+1\nmaxi=0\nmaxj=0\nm=0\nfor i in range(r):\n for j in range(r):\n if rl[i][j]>m:\n m=rl[i][j]\n maxi=i\n maxj=j\nprint(maxi+1,maxj+1)\n ", "# import sys\r\n# sys.stdin = open('inp.txt', 'r')\r\n\r\n\r\ndef can_place(n, a, k, x, y, dir):\r\n hx = [1, 0]\r\n hy = [0, 1]\r\n if x < 0 or x >= n or y < 0 or y >= n:\r\n return False\r\n if a[x][y] == '#':\r\n return False\r\n for i in range(k - 1):\r\n x += hx[dir]\r\n y += hy[dir]\r\n if x < 0 or x >= n or y < 0 or y >= n:\r\n return False\r\n if a[x][y] == '#':\r\n return False\r\n return True\r\n\r\n\r\ndef solve(n, a, k):\r\n count = [[0] * n for _ in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n if can_place(n, a, k, i, j, 0):\r\n for p in range(k):\r\n count[i + p][j] += 1\r\n if can_place(n, a, k, i, j, 1):\r\n for p in range(k):\r\n count[i][j + p] += 1\r\n row = 0\r\n col = 0\r\n max_ships = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if count[i][j] > max_ships:\r\n max_ships = count[i][j]\r\n row = i\r\n col = j\r\n row += 1\r\n col += 1\r\n print(row, col)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().split(' '))\r\n a = []\r\n for i in range(n):\r\n a.append(input())\r\n solve(n, a, k)\r\n", "n,k = [ int(a) for a in input().split() ]\n\nfield = []\nfor i in range(n):\n field.append(input())\n\nposs = [[0]*n for _ in range(n)]\nfor i in range(n):\n for j in range(n-k+1):\n good = True\n for ell in range(k):\n if field[j+ell][i] == '#':\n good = False\n if good:\n for ell in range(k):\n poss[j+ell][i] += 1\n\n good = True\n for ell in range(k):\n if field[i][j+ell] == '#':\n good = False\n if good:\n for ell in range(k):\n poss[i][j+ell] += 1\n\nbest = 0\nbesti = 0\nbestj = 0\nfor i in range(n):\n for j in range(n):\n if best < poss[i][j]:\n best = poss[i][j]\n besti = i\n bestj = j\n\nprint(besti+1,bestj+1)\n\n", "def main():\n n, k = [int(x) for x in input().split()]\n board = []\n count = [[0 for i in range(n)] for j in range(n)]\n m, x, y = 0,0,0\n\n for i in range(n):\n board.append(input())\n\n for i in range(n):\n for j in range(n):\n if board[i][j] == '.':\n if j+k-1 < n and board[i][j+k-1] == '.':\n for l in range(j, j+k):\n if board[i][l] == '#':\n break\n else:\n for l in range(j, j+k):\n count[i][l] += 1\n\n if i+k-1 < n and board[i+k-1][j] == '.':\n for l in range(i, i+k):\n if board[l][j] == '#':\n break\n else:\n for l in range(i, i+k):\n count[l][j] += 1\n if count[i][j] > m:\n m = count[i][j]\n x, y = i, j\n\n print(x+1, y+1)\n\nif __name__ == '__main__':\n main()\n", "# https://codeforces.com/problemset/problem/965/B\r\n\r\nn, k = map(int, input().strip().split())\r\nlst = []\r\nlst_invert = []\r\nlst_count = []\r\nfor i in range(n):\r\n lst_add = []\r\n for j in range(n):\r\n lst_add.append(0)\r\n lst_count.append(lst_add)\r\n# print(lst_count)\r\nfor i in range(n):\r\n lst.append(list(input().strip()))\r\n# print(lst)\r\nfor i in range(n):\r\n lst_add = []\r\n for j in range(n):\r\n if (lst[i][j:j + k] == list('.' * k)):\r\n for x in range(k):\r\n lst_count[i][j + x] += 1\r\n lst_add.append(lst[j][i])\r\n lst_invert.append(lst_add)\r\n# print(lst_invert)\r\nfor i in range(n):\r\n for j in range(n):\r\n if (lst_invert[i][j:j + k] == list('.' * k)):\r\n for x in range(k):\r\n lst_count[j + x][i] += 1\r\n# print(lst_count)\r\nmaximum = 0\r\nfor i in lst_count:\r\n if (maximum < max(i)):\r\n maximum = max(i)\r\n# print(maximum)\r\ncheck = 0\r\nfor i in range(n):\r\n if (max(lst_count[i]) == maximum):\r\n for j in range(n):\r\n if (lst_count[i][j] == maximum):\r\n print(i+1, j+1)\r\n check = 1\r\n break\r\n if (check == 1):\r\n break\r\n", "n, k = list(map(int, input().strip().split()))\n\ncounts = [[0]*n for i in range(n)]\ngrids = []\n\n\ndef helper(arr, k):\n n = len(arr)\n st, cur = 0, 0\n res = [0] * n\n while cur < n:\n if arr[cur] == '.':\n cur += 1\n else:\n length = cur - st\n if length >= k:\n mmax = min(length - k + 1, k)\n i, j = st, cur - 1\n cnt = 1\n while i <= j:\n res[i] = min(mmax, cnt)\n res[j] = min(mmax, cnt)\n cnt += 1\n i += 1\n j -= 1\n st = cur + 1\n cur = st\n if arr[cur - 1] == '.':\n length = cur - st\n if length >= k:\n mmax = min(length - k + 1, k)\n i, j = st, cur - 1\n cnt = 1\n while i <= j:\n res[i] = min(mmax, cnt)\n res[j] = min(mmax, cnt)\n cnt += 1\n i += 1\n j -= 1\n return res\n\n\nfor i in range(n):\n line = input().strip()\n grids.append(line)\n res = helper(line, k)\n for j in range(len(res)):\n counts[i][j] += res[j]\n\nmmax = 0\nx, y = 1, 1\nfor i in range(n):\n line = []\n for j in range(n):\n line.append(grids[j][i])\n res = helper(line, k)\n for j in range(len(res)):\n counts[j][i] += res[j]\n if counts[j][i] > mmax:\n mmax = counts[j][i]\n x, y = j + 1, i + 1\nprint(x, y)\n \t \t \t\t \t \t \t\t \t\t\t\t \t\t\t", "import math\r\n\r\nn,k = [int(s) for s in input().split()]\r\nboard = []\r\nfor i in range(n):\r\n board.append(list(input()))\r\nvb = [[0]*n for i in range(n)]\r\nhb = [[0]*n for i in range(n)]\r\ntb = [[0]*n for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if board[i][j] == '.':\r\n open = True\r\n for p in range(j, j+k):\r\n if p >= n or board[i][p] == '#':\r\n open = False\r\n break\r\n if open:\r\n for p in range(j, j+k):\r\n vb[i][p] += 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if board[j][i] == '.':\r\n open = True\r\n for p in range(j, j+k):\r\n if p >= n or board[p][i] == '#':\r\n open = False\r\n break\r\n if open:\r\n for p in range(j, j+k):\r\n hb[p][i] += 1\r\nfor i in range(n):\r\n for j in range(n):\r\n tb[i][j] = vb[i][j] + hb[i][j]\r\nmc = (0,0)\r\nfor i in range(n):\r\n for j in range(n):\r\n if tb[i][j] > tb[mc[0]][mc[1]]:\r\n mc = (i, j)\r\nprint(mc[0]+1, mc[1]+1)", "#codeforces_965B\r\nclass Matrix(object):\r\n\tdef __init__(self, height,width):\r\n\t\tself.height= height;\r\n\t\tself.width= width;\r\n\t\tself.field= [[0 for col in range(self.width)] for row in range(self.height)]\r\n\r\n\tdef fill(self,n=0):\r\n\t\tfor row in range(self.height):\r\n\t\t\tfor col in range(self.width):\r\n\t\t\t\tself.field[row][col] = n\r\n\tdef get(self,row,col):\r\n\t\treturn self.field[row][col]\r\n\tdef set(self,row,col,n):\r\n\t\tself.field[row][col] = n\r\n\tdef gi(self, seperator=\" \"):\r\n\t\tif seperator==\"\":\r\n\t\t\tfor row in range(self.height):\r\n\t\t\t\tself.field[row] = [e for e in input()]\r\n\t\t\treturn;\r\n\t\tfor row in range(self.height):\r\n\t\t\tself.field[row] = input().split(seperator)\r\n\tdef rows(self):\r\n\t\treturn self.field\r\n\tdef cols(self):\r\n\t\treturn [[self.field[row][col] for row in range(self.height)]for col in range(self.width)]\r\n\tdef row(self,index):\r\n\t\treturn self.field[index]\r\n\tdef col(self,index):\r\n\t\treturn [self.field[row][index] for row in range(self.height)]\r\n\tdef visualize(self):\r\n\t\tprint(\"\\t\",end=\"\")\r\n\t\tfor col in range(self.width):\r\n\t\t\tprint(col,end=\"\\t\")\r\n\t\tprint()\r\n\t\tprint(\"_\"*(self.width+ 1)*8)\r\n\t\tfor row in range(self.height):\r\n\t\t\tprint(str(row) + \"\\t\",end=\"\")\r\n\t\t\tfor col in range(self.width):\r\n\t\t\t\tprint(self.field[row][col], end=\"\\t\")\r\n\t\t\tprint()\r\n\t\t\tprint(\"_\"*(self.width+ 1)*8)\r\n\r\nline = [int(e) for e in input().split(\" \")]\r\nn = line[0]\r\nship = line[1]\r\nM = Matrix(n,n)\r\nrez = Matrix(n,n)\r\nM.gi(\"\")\r\nfor row in range(n):\r\n\tfor col in range(n-ship+1):\r\n\t\tif \"#\" not in M.row(row)[col:col+ship]:\r\n\t\t\tfor k in range(col,col+ship):\r\n\t\t\t\trez.set(row,k,rez.get(row,k)+1)\r\nfor col in range(n):\r\n\tfor row in range(n-ship+1):\r\n\t\tif \"#\" not in M.col(col)[row:row+ship]:\r\n\t\t\tfor k in range(row,row+ship):\r\n\t\t\t\trez.set(k,col,rez.get(k,col)+1)\r\nma = max([max(e) for e in rez.rows()])\r\nfor row in range(n):\r\n\tif ma in rez.row(row):\r\n\t\tprint(str(row+1) + \" \" + str(rez.row(row).index(ma)+1))\r\n\t\texit();\r\n", "#!/usr/bin/env python3\n\n[n, k] = map(int, input().strip().split())\nfield = [input().strip() for _ in range(n)]\n\ndef stranspose(field, n):\n\treturn [''.join(field[i][j] for i in range(n)) for j in range(n)]\n\ndef ceil(a, b):\n\treturn -((-a) // b)\n\ndef getz(l, k):\n\tif l < k:\n\t\treturn [0 for _ in range(l)]\n\telse:\n\t\tm = min(l - k + 1, k)\n\t\tw = l - 2 * (m - 1)\n\t\treturn list(range(1, m)) + [m for _ in range(w)] + list(reversed(range(1, m)))\n\t\t\ndef sproc(s, k):\n\tres = []\n\tl = 0\n\tfor c in s:\n\t\tif c == '#':\n\t\t\tif l > 0:\n\t\t\t\tres.extend(getz(l, k))\n\t\t\t\tl = 0\n\t\t\tres.append(0)\n\t\telse:\n\t\t\tl += 1\n\tif l > 0:\n\t\tres.extend(getz(l, k))\n\treturn res\n\nMH = [sproc(s, k) for s in field]\nfieldT = stranspose(field, n)\nMVT = [sproc(s, k) for s in fieldT]\nbest = (0, 0, 0) # (val, i, j)\nfor i in range(n):\n\tfor j in range(n):\n\t\tbest = max(best, (MH[i][j] + MVT[j][i], i, j))\n\nprint (best[1] + 1, best[2] + 1)\n\t\n\n", "n,k = map(int, input().split())\n\na = []\nfor i in range(n):\n\tai = list(map(lambda x: -1 if x == '#' else 0, list(input())))\n\tfor i1 in range(n-k+1):\n\t\tarr = ai[i1:i1+k]\n\t\tif not -1 in arr:\n\t\t\tai[i1:i1+k] = [x + 1 for x in arr]\n\ta.append(ai)\n\na = list(map(list, zip(*a)))\nfor i in range(n):\n\tai = a[i]\n\tfor i1 in range(n-k+1):\n\t\tarr = ai[i1:i1+k]\n\t\tif not -1 in arr:\n\t\t\tai[i1:i1+k] = [x + 1 for x in arr]\n\na = list(map(list, zip(*a)))\na = [aij for ai in a for aij in ai]\nb = a.index(max(a))\nbr, bc = divmod(b, n)\nprint('{} {}'.format(br + 1, bc + 1)) \n\t\t\n\t\n", "#!/usr/bin/env python3\nfrom typing import Dict, List, Tuple\n\n\ndef input_lst() -> List[int]:\n return [int(x) for x in input().split()]\n\ndef print_out(res: List[int]):\n print(' '.join([str(x) for x in res]))\n\ndef main():\n\n n, k = (int(x) for x in input().split())\n\n field = []\n for _ in range(n):\n field.append([x=='.' for x in list(input())])\n\n #print(field)\n\n res = [[0]*n for _ in range(n)]\n\n for i in range(n):\n for j in range(n):\n good = True\n for t in range(k):\n if (j+t >= n) or not field[i][j+t]:\n good = False\n break\n if good:\n for t in range(k):\n res[i][j+t]+=1\n\n good = True\n for t in range(k):\n if (i+t >= n) or not field[i+t][j]:\n good = False\n break\n if good:\n for t in range(k):\n res[i+t][j]+=1\n\n\n #print(res)\n max_val = 0\n max_ind = (0, 0)\n\n for i in range(n):\n for j in range(n):\n if res[i][j] > max_val:\n max_ind = (i, j)\n max_val = res[i][j]\n\n\n print('{} {}'.format(max_ind[0] + 1,max_ind[1] + 1))\n\n #x = x * k\n #res = [0]\n #times = input_lst()\n #s = list(input())\n\n\n\n\n #print(x)\n\n\n #print_out(res)\n\n\nif __name__ == '__main__':\n main()\n", "a = input()\r\na = a.split(' ')\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nd = []\r\nfor i in range(a[0]):\r\n c = input()\r\n d += [c]\r\nb = []\r\nn = a[0]\r\nk = a[1]\r\nfor i in range(n):\r\n for j in range(n):\r\n if d[i][j] == '#':\r\n b += [0]\r\n else:\r\n x = 1\r\n y = 1\r\n for k in range(j+1,min(n,a[1]+j)):\r\n if d[i][k] == '.':\r\n x += 1\r\n else:\r\n break\r\n for k in range(j-1,max(-1,j-a[1]),-1):\r\n if d[i][k] == '.':\r\n x += 1\r\n else:\r\n break\r\n for k in range(i+1,min(n,a[1]+i)):\r\n if d[k][j] == '.':\r\n y += 1\r\n else:\r\n break\r\n for k in range(i-1,max(-1,i-a[1]),-1):\r\n if d[k][j] == '.':\r\n y += 1\r\n else:\r\n break\r\n b += [max(x-a[1]+1,0)+max(y-a[1]+1,0)]\r\nc = max(b)\r\nfor i in range(len(b)):\r\n if b[i] == c:\r\n z = [i//n+1,i%n+1]\r\n break\r\nprint(z[0],z[1])\r\n \r\n", "n, k = map(int, input().split())\na = []\nfor _ in range(n):\n a.append(input())\nb = []\nfor i in range(n):\n for j in range(n):\n t = 0\n if a[i][j] == '.':\n x = 1\n for l in range(max(i - k + 1, 0), i)[::-1]:\n if a[l][j] == '.':\n x += 1\n else:\n break\n for l in range(i + 1, min(i + k, n)):\n if a[l][j] == '.':\n x += 1\n else:\n break\n t += max(0, x - k + 1)\n x = 1\n for l in range(max(j - k + 1, 0), j)[::-1]:\n if a[i][l] == '.':\n x += 1\n else:\n break\n for l in range(j + 1, min(j + k, n)):\n if a[i][l] == '.':\n x += 1\n else:\n break\n t += max(0, x - k + 1)\n b.append([t, i, j])\nb.sort()\nprint(b[-1][1] + 1, b[-1][2] + 1)\n", "k, n = input().split()\nk = int(k)\nn = int(n)\na = []\nfor st in range(k):\n a.append(list(input()))\n#k = 4\n#n = 3\n#a = [['#', '.', '.', '#'], ['#', '.', '#', '.'], ['.', '.', '.', '.'], ['.', '#', '#', '#']]\ndef get_max(matrix , r):\n max = 0\n maxR = 0\n maxC = 0\n for r in range(k):\n for c in range(k):\n if type(matrix[r][c]) is int and matrix[r][c] > max:\n max = matrix[r][c]\n maxR = r\n maxC = c\n return \"{} {}\".format(maxR+1, maxC+1)\n\ndef check_horizontal(matrix, lenght, row, column):\n h = 1\n for l in range(lenght-1):\n if matrix[row][column + l + 1] == '#':\n h = 0\n break\n return h\n\ndef check_vertical(matrix, lenght, row, column):\n v = 1\n for l in range(lenght-1):\n if matrix[row + l + 1][column] == '#':\n v = 0\n break\n return v\n\nfor row in range(k - n + 1):\n for column in range(k):\n if a[row][column] != '#':\n if check_vertical(a, n, row, column):\n for l in range(n):\n if a[row + l][column] == '.':\n a[row + l][column] = 1\n else:\n a[row + l][column] += 1\n\nfor column in range(k - n + 1):\n for row in range(k):\n if a[row][column] != '#':\n if check_horizontal(a, n, row, column):\n for l in range(n):\n if a[row][column + l] == '.':\n a[row][column + l] = 1\n else:\n a[row][column + l] += 1\n\nprint(get_max(a, k))\n", "n, k = map(int, input().split())\r\n\r\na = []\r\ndp = [[0]*n for i in range(n)]\r\n\r\nfor i in range(n):\r\n a.append(str(input()))\r\n\r\nfor i in range(n):\r\n for j in range(n-k+1):\r\n t = 1\r\n for z in range(k):\r\n if a[i][j+z] == '#':\r\n t = 0\r\n break\r\n if t == 1:\r\n for z in range(k): dp[i][j+z] += 1\r\n\r\nfor j in range(n):\r\n for i in range(n-k+1):\r\n t = 1\r\n for z in range(k):\r\n if a[i+z][j] == '#':\r\n t = 0\r\n break\r\n if t == 1:\r\n for z in range(k): dp[i+z][j] += 1\r\n\r\n\r\nih = 0\r\nx, y = 0, 0\r\nfor i in range(n):\r\n for j in range(n):\r\n now = dp[i][j]\r\n if now > ih:\r\n ih = now\r\n x, y = i, j\r\n\r\nprint(x+1, y+1)\r\n", "n, k = map(int, input().split())\r\n\r\ndef func(i):\r\n return -1 if i == '#' else 0\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(func, input())))\r\n\r\nfor i in range(n):\r\n for j in range(n - k + 1):\r\n if -1 not in l[i][j : j+k]:\r\n for t in range(k):\r\n l[i][j+t] += 1\r\nl = list(zip(*l))\r\nfor i in range(n):\r\n l[i] = list(l[i])\r\nfor i in range(n):\r\n for j in range(n - k + 1):\r\n if -1 not in l[i][j : j+k]:\r\n for t in range(k):\r\n l[i][j+t] += 1\r\nl = list(zip(*l))\r\n\r\nx, y = 0, 0\r\nm = -1\r\nfor i in range(n):\r\n for j in range(n):\r\n if l[i][j] > m:\r\n x = i\r\n y = j\r\n m = l[i][j]\r\nprint(x+1, y+1)\r\n", "def grather(y, x):\r\n global max_val, max_x, max_y\r\n if Ver[y][x] > max_val:\r\n max_val = Ver[y][x]\r\n max_x = x\r\n max_y = y\r\n\r\n\r\nn, k = map(int, input().split())\r\nTable = []\r\nVer = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n Table.append(list(input()))\r\n\r\n\r\nmax_y = 0\r\nmax_x = 0\r\nmax_val = 0\r\n\r\nfor y in range(n):\r\n for x in range(n):\r\n # hor\r\n if x + k <= n:\r\n clear = True\r\n for j in range(x, x + k):\r\n if Table[y][j] == '#':\r\n clear = False\r\n break\r\n if clear:\r\n for j in range(x, x + k):\r\n Ver[y][j] += 1\r\n grather(y, j)\r\n # vert\r\n if y + k <= n:\r\n clear = True\r\n for j in range(y, y + k):\r\n if Table[j][x] == '#':\r\n clear = False\r\n break\r\n if clear:\r\n for j in range(y, y + k):\r\n Ver[j][x] += 1\r\n grather(j, x)\r\n\r\nprint(max_y + 1, max_x + 1)\r\n", "\r\nn,k = [int(x) for x in input().split()]\r\nm = ['' for i in range(n)]\r\nfor i in range(n) :\r\n m[i] = input()\r\nret = 0\r\nx,y = 0,0\r\nfor i in range(n) :\r\n for j in range(n) :\r\n if m[i][j] == '.' :\r\n ways = 0\r\n l,r,u,d = 0,0,0,0\r\n while i-l>=0 and m[i-l][j]=='.' and l<k : \r\n l+=1\r\n while i+r<n and m[i+r][j]=='.' and r<k:\r\n r+=1\r\n ways += max(0,l+r-k)\r\n while j-u>=0 and m[i][j-u]=='.' and u<k: \r\n u+=1\r\n while j+d<n and m[i][j+d]=='.' and d<k:\r\n d+=1\r\n ways += max(0,u+d-k)\r\n if ways > ret :\r\n ret = ways\r\n x = i\r\n y = j\r\nprint(x+1,y+1)", "def scan():\n\tfor i in range(n):\n\t\tfor j in range(n - k + 1):\n\t\t\tf = True\n\t\t\tfor l in range(k):\n\t\t\t\tif a[i][j + l] == \"#\":\n\t\t\t\t\tf = False\n\t\t\t\t\tbreak\n\n\t\t\tif f:\n\t\t\t\tfor l in range(k):\n\t\t\t\t\tb[i][j + l] += 1\n\n\n\nn,k = input().split()\nn = int(n)\nk = int(k)\na = [[]]\nb=[[]]\nfor i in range(n):\n\twk1 = input()\n\tfor j in range(n):\n\t\ta[i].append(wk1[j])\n\t\tb[i].append(0)\n\ta.append([])\n\tb.append([])\n\t\n\nscan()\n\n\nfor i in range(n):\n\tfor j in range(i,n):\n\t\tif i != j :\n\t\t\twk1 = a[i][j]\n\t\t\ta[i][j] = a[j][i]\n\t\t\ta[j][i] = wk1\n\t\t\twk1 = b[i][j]\n\t\t\tb[i][j] = b[j][i]\n\t\t\tb[j][i] = wk1\n\t\t\t\nscan()\n\n\nans_max = 0\nanx_x = 1\nanx_y = 1\nfor i in range(n):\n\tfor j in range(n):\n\t\tif ans_max < b[j][i]:\n\t\t\tans_max = b[j][i]\n\t\t\tanx_x = i + 1\n\t\t\tanx_y = j + 1\n\n\nprint(anx_x,anx_y)\n\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = [list(input().rstrip()) + [1] for _ in range(n)]\r\ns.append([1] * (n + 1))\r\nx = [[]]\r\ny = []\r\nfor i in range(1, n + 1):\r\n y.append(0)\r\n if i < k:\r\n x.append(list(y))\r\n else:\r\n for j in range(k):\r\n y[-j - 1] += 1\r\n x.append(list(y))\r\ninf = pow(10, 9) + 1\r\ncnt = [[0] * n for _ in range(n)]\r\nfor i in range(n + 1):\r\n si = s[i]\r\n l, r = inf, -inf\r\n for j in range(n + 1):\r\n if not si[j] & 1:\r\n l, r = min(l, j), max(r, j)\r\n elif l <= r:\r\n y = x[r - l + 1]\r\n for k in range(r - l + 1):\r\n cnt[i][k + l] += y[k]\r\n l, r = inf, -inf\r\nfor j in range(n + 1):\r\n l, r = inf, -inf\r\n for i in range(n + 1):\r\n if not s[i][j] & 1:\r\n l, r = min(l, i), max(r, i)\r\n elif l <= r:\r\n y = x[r - l + 1]\r\n for k in range(r - l + 1):\r\n cnt[k + l][j] += y[k]\r\n l, r = inf, -inf\r\nma = -1\r\nans = [1, 1]\r\nfor i in range(n):\r\n c = cnt[i]\r\n for j in range(n):\r\n if ma < c[j]:\r\n ma = c[j]\r\n ans = [i + 1, j + 1]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "def main():\n\tn , k = [int (x) for x in input().split()]\n\ts = []\n\tfor x in range(n):\n\t\ts.append(list(input()))\n\n\ttemp = [[0]*n for x in range(n)]\n\n\t#print(s)\n\tfor i in range(n):\n\t\tfor j in range(n-k+1):\n\t\t\tcount = 0\n\t\t\tfor m in range(j, j+k):\n\t\t\t\tif s[i][m] == \".\":\n\t\t\t\t\tcount += 1\n\t\t\tif(count == k):\n\t\t\t\tfor m in range(j, j+k):\n\t\t\t\t\ttemp[i][m] += 1\n\t\n\tfor i in range(n):\n\t\tfor j in range(n-k+1):\n\t\t\tcount = 0\n\t\t\tfor m in range(j, j+k):\n\t\t\t\tif s[m][i] == \".\":\n\t\t\t\t\tcount += 1\n\t\t\tif(count == k):\n\t\t\t\tfor m in range(j, j+k):\n\t\t\t\t\ttemp[m][i]+= 1\n\n\tx = y =1\n\tmaxi = 0\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif maxi < temp[i][j]:\n\t\t\t\tmaxi, x, y = temp[i][j], i+1, j+1\n\n\n\tprint(x, y)\n\n\n\n\nif __name__ == '__main__':\n\tmain()", "n, k = map(int, input().split())\r\nF = [[] for i in range(n)]\r\nF2 = [[\"\"] * n for i in range(n)]\r\nT = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n a = list(input())\r\n F[i] = a\r\nfor i in range(n):\r\n for j in range(n):\r\n F2[i][j] = F[j][i]\r\n\r\nfor i in range(n):\r\n for j in range(n - k + 1):\r\n if \"#\" not in F[i][j:j + k]:\r\n for p in range(j, j + k):\r\n T[i][p] += 1\r\n\r\nfor i in range(n):\r\n for j in range(n - k + 1):\r\n if \"#\" not in F2[i][j:j + k]:\r\n for p in range(j, j + k):\r\n T[p][i] += 1\r\n\r\nx, y = 0, 0\r\nnum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if T[i][j] > num:\r\n x, y = i, j\r\n num = T[i][j]\r\n\r\nprint(x + 1, y + 1)" ]

[ "from typing import List\r\nimport sys\r\n \r\nn, m = [int(a) for a in input().split(' ')]\r\n \r\nadj: List[List[int]] = [[]] + [[] for _ in range(n)]\r\n \r\nvisited: List[bool] = [False] * (n + 1)\r\nparent: List[int] = [0] * (n + 1)\r\ndepth: List[int] = [0] * (n + 1)\r\nlow: List[int] = [0] * (n + 1)\r\ncx: List[int] = [0] * (n + 1)\r\ncy: List[int] = [0] * (n + 1)\r\nqi: List[int] = [0] * (n + 1)\r\n \r\nfor i in range(m):\r\n u, v = [int(a) for a in input().split(' ')]\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n \r\n \r\ndef solve():\r\n \r\n for i in range(1, n + 1):\r\n if not visited[i]:\r\n # dfs(i)\r\n dfs2(i)\r\n print('NO')\r\n \r\n \r\ndef lca(a, b):\r\n while depth[a] > depth[b]:\r\n a = parent[a]\r\n while depth[b] > depth[a]:\r\n b = parent[b]\r\n while a != b:\r\n a = parent[a]\r\n b = parent[b]\r\n return a\r\n \r\n \r\ndef parent_path(a, b):\r\n p = []\r\n while a != b:\r\n p.append(str(a))\r\n a = parent[a]\r\n p.append(str(b))\r\n return p\r\n \r\n \r\ndef gett(a, b, u, v):\r\n if depth[b] > depth[v]:\r\n a, b, u, v = u, v, a, b\r\n e = lca(a, u)\r\n print('YES')\r\n c1 = parent_path(e, v)\r\n print(' '.join([str(len(c1))] + c1))\r\n c2 = list(reversed(parent_path(a, e))) + list(reversed(parent_path(v, b)))\r\n print(' '.join([str(len(c2))] + c2))\r\n c3 = list(reversed(parent_path(u, e))) + [str(v)]\r\n print(' '.join([str(len(c3))] + c3))\r\n exit(0)\r\n \r\n \r\ndef dfs(i):\r\n visited[i] = True\r\n depth[i] = depth[parent[i]] + 1\r\n for ni in adj[i]:\r\n if parent[i] != ni:\r\n if not visited[ni]:\r\n parent[ni] = i\r\n dfs(ni)\r\n elif depth[ni] < depth[i]:\r\n x = i\r\n while x != ni:\r\n if cx[x] and cy[x]:\r\n gett(cx[x], cy[x], i, ni)\r\n else:\r\n cx[x] = i\r\n cy[x] = ni\r\n x = parent[x]\r\n \r\n \r\ndef dfs2(i):\r\n visited[i] = True\r\n q: List[int] = []\r\n q.append(i)\r\n while len(q) > 0:\r\n u = q[-1]\r\n if qi[u] >= len(adj[u]):\r\n q.pop()\r\n continue\r\n v = adj[u][qi[u]]\r\n qi[u] += 1\r\n if parent[u] != v:\r\n if not visited[v]:\r\n parent[v] = u\r\n depth[v] = depth[u] + 1\r\n visited[v] = True\r\n q.append(v)\r\n elif depth[v] < depth[u]:\r\n x = u\r\n while x != v:\r\n if cx[x] and cy[x]:\r\n gett(cx[x], cy[x], u, v)\r\n else:\r\n cx[x] = u\r\n cy[x] = v\r\n x = parent[x]\r\n \r\nsolve()\r\n" ]

[ "n = int(input())\r\na = list(map(int, input().strip().split()))\r\n\r\nd = dict()\r\nfor i in range(n):\r\n try: d[a[i]] += 1\r\n except: d[a[i]] = 1\r\n\r\nl = list(d.keys())\r\nl.sort()\r\nn = len(l)\r\n\r\nif n == 1:\r\n a = d[l[0]]\r\n print(a*(a-1)*(a-2) // 6)\r\nelif n == 2:\r\n a, b = d[l[0]], d[l[1]]\r\n if a >= 3:\r\n print(a*(a-1)*(a-2) // 6)\r\n elif a == 2:\r\n print(b)\r\n else:\r\n print(b*(b-1)//2)\r\nelse:\r\n a,b,c = d[l[0]], d[l[1]], d[l[2]]\r\n if a >= 3:\r\n print(a*(a-1)*(a-2) // 6)\r\n elif a == 2:\r\n print(b)\r\n else:\r\n if b >= 2:\r\n print(b*(b-1) // 2)\r\n else:\r\n print(c)", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = list_input()\r\n\r\na.sort()\r\ns = list()\r\np = 0\r\nwhile p < n:\r\n q = p\r\n while q < n and a[p] == a[q]:\r\n q += 1\r\n s.append(q-p)\r\n p = q\r\n\r\nres = 0\r\nif s[0] >= 3:\r\n res = s[0]*(s[0]-1)*(s[0]-2)//6\r\nelif s[0] == 2:\r\n res = s[1]\r\nelif s[0] == 1:\r\n if s[1] >= 2:\r\n res = s[1]*(s[1]-1)//2\r\n elif s[1] == 1:\r\n res = s[2]\r\nprint(res)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\npre = a[:]\r\ncnt1 = [1]*n\r\nfor i in range(len(a)):\r\n if i==0:\r\n continue\r\n pre[i]=pre[i-1]\r\n cnt1[i] = cnt1[i-1]\r\n if a[i]<pre[i]:\r\n pre[i]=a[i]\r\n cnt1[i]=1\r\n else:\r\n if a[i]==pre[i]:\r\n cnt1[i]+=1\r\n \r\npre2 = [10**30]*n \r\ncnt2 = [0]*n\r\nfor i in range(n):\r\n if(i==0):\r\n continue\r\n pre2[i]=pre2[i-1] \r\n cnt2[i] = cnt2[i-1]\r\n te = a[i]*pre[i-1]\r\n if te<pre2[i]:\r\n pre2[i] = te\r\n cnt2[i] = cnt1[i-1]\r\n else:\r\n if te==pre2[i]:\r\n cnt2[i] += cnt1[i-1]\r\n\r\nans = 10**30\r\ncnt = 0\r\nfor i in range(n):\r\n if(i<2):\r\n continue\r\n t = a[i]*pre2[i-1]\r\n if(t<ans):\r\n ans = t \r\n cnt = cnt2[i-1]\r\n else:\r\n if ans==t:\r\n cnt+=cnt2[i-1]\r\n\r\nprint(cnt)", "import sys, functools, bisect, collections, string, math\r\nfrom math import factorial as fact\r\ninput = sys.stdin.readline\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\n\r\nINF = 10**18\r\nMOD = 10**9+7\r\nN = 10**12\r\ndef nCr(n,r):\r\n return fact(n)//(fact(n-r)*fact(r))\r\n \r\ndef solve():\r\n cnt = collections.Counter(A)\r\n keys = sorted(k for k in cnt)\r\n if cnt[keys[0]] >= 3:\r\n return nCr(cnt[keys[0]], 3)\r\n elif cnt[keys[0]] == 2:\r\n return cnt[keys[1]]\r\n else:\r\n if cnt[keys[1]] >= 2:\r\n return nCr(cnt[keys[1]],2)\r\n else:\r\n return cnt[keys[2]]\r\n \r\n \r\n \r\n \r\ntest_case = 1\r\n\r\nfor _ in range(test_case):\r\n n = ri()\r\n A = ra()\r\n print(solve())\r\n ", "from math import factorial\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nc1 = c2 = c3 = 0\r\nfor i in range(n):\r\n if a[i] == a[0]:\r\n c1 += 1\r\n if a[i] == a[1]:\r\n c2 += 1\r\n if a[i] == a[2]:\r\n c3 += 1\r\nif a[0] == a[1]:\r\n if a[1] == a[2]:\r\n print((c1*(c1-1)*(c1-2))//6)\r\n exit()\r\n else:\r\n print((c1*(c1-1))//2*c3)\r\n exit()\r\nif a[1] == a[2]:\r\n print((c1*c2*(c2-1))//2)\r\n exit()\r\nprint(c1*c2*c3) ", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncnt = Counter(a)\r\n\r\nif a[0]==a[1]==a[2]:\r\n n = cnt[a[0]]\r\n print(n*(n-1)*(n-2)//6)\r\nelif a[0]==a[1]:\r\n n = cnt[a[0]]\r\n print(n*(n-1)//2*cnt[a[2]])\r\nelif a[1]==a[2]:\r\n n = cnt[a[1]]\r\n print(cnt[a[0]]*n*(n-1)//2)\r\nelse:\r\n print(cnt[a[0]]*cnt[a[1]]*cnt[a[2]])", "n = int(input())\n\na = sorted(list(map(int, input().split())))\ncnt = a.count(a[2])\nif (a[1] < a[2]):\n print(cnt)\nelif (a[0] < a[1]):\n print(cnt * (cnt - 1) // 2)\nelse:\n print(cnt * (cnt - 1) * (cnt - 2) // 6)", "n=int(input())\r\nli=list(map(int,input().split()))\r\nli.sort()\r\ni=2\r\ncnt=0\r\nwhile i<n and li[i]==li[2]:\r\n cnt+=1\r\n i+=1\r\nif li[0]==li[2]:\r\n cnt+=2\r\n ans=(cnt*(cnt-1)*(cnt-2))//6\r\n print(ans)\r\nelif li[1]==li[2]:\r\n cnt+=1\r\n ans=(cnt*(cnt-1))//2\r\n print(ans)\r\nelse:\r\n print(cnt)\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nd = {}\r\nfor ai in a:\r\n if ai in d: d[ai] += 1\r\n else: d[ai] = 1\r\nx = []\r\nfor i in range(3): \r\n if a[i] not in x:\r\n x.append(a[i])\r\nif len(x) == 1:\r\n c = d[x[0]]\r\n print((c*(c-1)*(c-2))//6)\r\nelif len(x) == 2:\r\n if d[x[0]] == 2:\r\n print(d[x[1]])\r\n else:\r\n c = d[x[1]]\r\n print((c*(c-1))//2)\r\nelse:\r\n print(d[x[0]]*d[x[1]]*d[x[2]])", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\nN = int(input())\nA = sorted(list(map(int,input().split())))[::-1]\nC = Counter(A)\nans = 1\n\nl = Counter([A.pop(),A.pop(),A.pop()])\n\nfor i in l:\n ans*=(comb(C[i],l[i]))\n\nprint(ans)\n", "def split1(s):\r\n l=[]\r\n m=''\r\n s+=' '\r\n for i in range(len(s)):\r\n if s[i]==' ':\r\n l.append(int(m))\r\n m=''\r\n else:\r\n m+=s[i]\r\n return l\r\nn=int(input())\r\na=input()\r\na=split1(a)\r\naa=a.copy()\r\n#print(a)\r\nz=[]\r\nfor i in range(3):\r\n q=min(aa)\r\n z.append(q)\r\n aa.remove(q)\r\n#print(z)\r\nt=[]\r\nj=1\r\nfor i in z:\r\n if not(i in t):\r\n #print(i)\r\n if z.count(i)==1:\r\n j*=(a.count(i))\r\n if z.count(i)==2:\r\n q=a.count(i)\r\n #print(q,3313541531)\r\n j*=(q*(q-1)/2)\r\n if z.count(i)==3:\r\n q=a.count(i)\r\n j*=(q*(q-1)*(q-2)/6)\r\n t.append(i)\r\nprint(int(j))\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,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nx=l[2]\r\nc=0\r\nfor i in l:\r\n if i==x:\r\n c+=1\r\nif l[0]==l[1] and l[0]==l[2]:\r\n print((c*(c-1)*(c-2))//6)\r\nelif l[1]==l[2]:\r\n print(c*(c-1)//2)\r\nelse:\r\n print(c)\r\n", "from math import comb\r\ndef minp(arr):\r\n arr=sorted(arr)\r\n st=arr[:3]\r\n ans=1\r\n for i in set(st):\r\n ans*=comb(arr.count(i),st.count(i))\r\n return ans\r\n\r\na=input()\r\nlst=list(map(int,input().strip().split()))\r\nprint(minp(lst))", "from math import comb\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nfirst = arr[:3]\r\nthing = list(set(first))\r\ncounts = []\r\ndic = {}\r\ndicAgain = {}\r\nfor x in thing:\r\n counts.append(first.count(x))\r\n\r\nfor i in range(len(thing)):\r\n dic[thing[i]] = counts[i]\r\n #dicAgain[thing[i]] = 0\r\n\r\nfor x in arr:\r\n dicAgain[x] = dicAgain.get(x, 0) + 1\r\n\r\nstuffs = []\r\n\r\nfor x in thing:\r\n num = dic[x]\r\n count = dicAgain[x]\r\n stuffs.append(comb(count, num))\r\n\r\nprint(max(stuffs))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\ng = []\r\ndef combi(n,r):\r\n p = 1\r\n for i in range(min(r,n-r)):\r\n p = p*(n-i)//(i+1)\r\n return p \r\n \r\n \r\nd = 1\r\nif l[0]==l[1]==l[2]:\r\n\r\n d = d*combi(l.count(l[0]),3)\r\n \r\nelif l[0]!=l[1]==l[2]:\r\n d = d*combi(l.count(l[2]),2)*l.count(l[0])\r\nelif l[0]==l[1]!=l[2]:\r\n d = d*combi(l.count(l[0]),2)*l.count(l[2])\r\nelif l[0]!=l[1]!=l[2]:\r\n d = d*l.count(l[0])*l.count(l[1])*l.count(l[2])\r\nprint(d) \r\n", "input()\r\nl=sorted(list(map(int,input().split())))\r\na=l.count(l[0]);b=l.count(l[1]);c=l.count(l[2])\r\nif a>2:\r\n print(a*(a-1)*(a-2)//6)\r\nelif a==1 and b>1:\r\n print(b*(b-1)//2)\r\nelse:\r\n print(c)\r\n", "from math import factorial\r\nn = int(input())\r\na = map(int,input().split())\r\na = sorted(a)\r\nx , y = a.count(a[2]),a[:3].count(a[2])\r\nprint(factorial(x) // (factorial(x - y) * factorial(y)))", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=sorted(a)\r\nk1,k2,k3=a1[0],a1[1],a1[2]\r\n\r\npre=[0,0,0]\r\nans=0\r\nfor i in range(n):\r\n if a[i]==k1:\r\n pre[0]+=1\r\n if a[i]==k2:\r\n pre[1]+=1\r\n if a[i] == k3:\r\n pre[2] += 1\r\n\r\nif k1!=k2 and k1!=k3 and k3!=k2:\r\n ans = pre[0] * pre[1] * pre[2]\r\nif k1==k2:\r\n ans=((pre[0])*(pre[0]-1)//2)*pre[2]\r\nif k2==k3:\r\n ans=pre[0]*(pre[1]*(pre[1]-1)//2)\r\nif k1==k2 and k2==k3:\r\n ans=(pre[0]*(pre[0]-1)*(pre[0]-2))//6\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import comb\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\nif w[0] == w[1] == w[2]:\r\n print(comb(w.count(w[0]), 3))\r\nelif w[1] != w[2]:\r\n print(w.count(w[2]))\r\nelse:\r\n print(comb(w.count(w[1]), 2))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\na = l[0]\r\nb = l[1]\r\nc = l[2]\r\nif a < b < c:\r\n print(l.count(c))\r\nelif a < b and b == c:\r\n x = l.count(b)\r\n print(x * (x - 1) // 2)\r\nelif a == b and b < c:\r\n print(l.count(c))\r\nelse:\r\n x = l.count(a)\r\n print(x * (x - 1) * (x - 2) // 6)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nx = a[0]\ny = a[1]\nz = a[2]\nif x < y and y < z:\n\tprint(a.count(z))\nelif x < y and y == z:\n\tt = a.count(y)\n\tprint(t * (t - 1) // 2)\nelif x == y and y < z:\n\tprint(a.count(z))\nelse:\n\tt = a.count(x)\n\tprint(t * (t - 1) * (t - 2) // 6)\n", "from math import factorial as fact\r\nfrom math import pi\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\ncnts = {e: 0 for i,e in enumerate(a)}\r\nfor i,e in enumerate(a):\r\n cnts[e] += 1\r\n\r\ndef mini(l: list):\r\n ans = (pi,float('inf'))\r\n for i,e in enumerate(l):\r\n if e < ans[1]:\r\n ans = (i,e)\r\n return ans\r\n\r\nmin1i,min1 = mini(a)\r\na[min1i] = float('inf')\r\nmin2i,min2 = mini(a)\r\na[min2i] = float('inf')\r\nmin3i,min3 = mini(a)\r\n\r\ns = set([min1,min2,min3])\r\ndiv = fact(4-len(s))\r\n\r\nc1 = cnts[min1]\r\ncnts[min1] -= 1\r\nc2 = cnts[min2]\r\ncnts[min2] -= 1\r\nc3 = cnts[min3]\r\n\r\nprint((c1*c2*c3) // div)\r\n", "num=int(input())\r\narr=[0]*num\r\narr=input().split()\r\nfor i in range (num):\r\n arr[i]=int(arr[i])\r\narr.sort()\r\na=arr[0]\r\nb=arr[1]\r\nc=arr[2]\r\nans=1\r\nca=arr.count(a)\r\ncb=arr.count(b)\r\ncc=arr.count(c)\r\nif c !=b and b !=a:\r\n ans=ca*cb*cc\r\nelif b==c and b !=a:\r\n ans=ca*(cb*(cb-1)//2)\r\nelif a==b and b !=c:\r\n ans=(ca*(ca-1))//2*cc\r\nelif a==b and b==c:\r\n ans=(ca*(ca-1)*(ca-2))//6\r\nprint (ans)", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nmin1 = a[0];min2 = a[1];min3 = a[2]\r\nt = True\r\nif(min1 == min2 and min2 == min3):\r\n cnt = 0\r\n for i in a:\r\n if i == min1:\r\n cnt += 1\r\n cnt = cnt * (cnt-1) * (cnt-2)\r\n print(cnt // 6)\r\n t = False\r\n\r\nif(min1 == min2 and t):\r\n cnt12 = 0\r\n cnt3 = 0\r\n for i in a:\r\n if i == min1:\r\n cnt12 += 1\r\n if i == min3:\r\n cnt3 += 1\r\n print((cnt12 * (cnt12 - 1) // 2 ) * cnt3)\r\n\r\n\r\nif(min1 == min3 and t):\r\n cnt13 = 0\r\n cnt2 = 0\r\n for i in a:\r\n if i == min1:\r\n cnt13 += 1\r\n if i == min2:\r\n cnt2 += 1\r\n print((cnt13 * (cnt13 - 1) // 2 ) * cnt2)\r\n\r\n\r\n\r\n\r\nif(min3 == min2 and t):\r\n cnt32 = 0\r\n cnt1 = 0\r\n for i in a:\r\n if i == min3:\r\n cnt32 += 1\r\n if i == min1:\r\n cnt1 += 1\r\n print((cnt32 * (cnt32 - 1) // 2 ) * cnt1)\r\n\r\nif(min1 != min2 and min2 != min3 and min1 != min3):\r\n cnt1 = 0;cnt2 = 0;cnt3 = 0\r\n for i in a:\r\n if i == min1:cnt1+=1\r\n if i == min2:cnt2+=1\r\n if i == min3:cnt3+=1\r\n print(cnt1*cnt2*cnt3)\r\n", "n = int(input())\na = [int(x) for x in input().split()]\na.sort()\nl = [a[0],a[1],a[2]]\nmx = 0\nval = l.count(l[0])\nval2 = l.count(l[1])\nval3 = l.count(l[2])\nif val==2:\n\tval = a.count(l[2])\n\tmx = max(mx,val)\nelif val==3:\n\tval = a.count(l[0])\n\tval = (val*(val-1)*(val-2))//6\n\tmx = max(mx,val)\nelif val2==2:\n\tval = a.count(l[1])\n\tval = (val*(val-1))//2\n\tmx = max(mx,val)\nelse:\n\tfor i in l:\n\t\tmx = max(mx,a.count(i))\nprint(mx)\n", "from math import perm, comb\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nleft = 3\r\ncount = Counter(nums)\r\nans = 1\r\nfor key in sorted(count.keys()):\r\n val = count[key]\r\n ans *= comb(val, min(left, val))\r\n left -= min(left, val)\r\n if left == 0:\r\n print(ans)\r\n break", "import math\r\ndef C(n, k):\r\n return int(math.factorial(n) / (math.factorial(k) * math.factorial(n-k)))\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nmn = lst[0] * lst[1] * lst[2]\r\nif lst[2] != lst[1]:\r\n ans = 0\r\n for i in lst:\r\n if i == lst[2]:\r\n ans += 1\r\n print(ans)\r\nelse:\r\n if lst[1] != lst[0]:\r\n ans = 0\r\n for i in lst:\r\n if i == lst[1]:\r\n ans += 1\r\n print(C(ans, 2))\r\n else:\r\n ans = 0\r\n for i in lst:\r\n if i == lst[0]:\r\n ans += 1\r\n print(C(ans, 3))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nsame = 1\r\nwhile same < 3 and a[2 - same] == a[2]:\r\n same += 1\r\ncnt = 1\r\ni = 3\r\nif same == 1: \r\n while i < n and a[i] == a[2]:\r\n cnt += 1\r\n i += 1\r\nif same == 2:\r\n while i < n and a[i] == a[2]:\r\n cnt += same\r\n same += 1\r\n i += 1\r\nif same == 3:\r\n while i < n and a[i] == a[2]:\r\n cnt += int(same * (same - 1) / 2)\r\n same += 1\r\n i += 1\r\nprint(cnt)", "n=int(input())\nlis=list(map(int,input().split()))\nmin=10**9\na=0\nfor i in lis:\n\tif min==i:\n\t\ta+=1\n\telif min>i:\n\t\ta=1\n\t\tmin=i\nif a>=3:\n\tprint ((a*(a-1)*(a-2))//6)\nelse:\n\tb=a\n\tmin1=min\n\tmin=10**9\n\tfor i in lis:\n\t\tif min==i:\n\t\t\ta+=1\n\t\telif min>i and i!=min1:\n\t\t\tmin=i\n\t\t\ta=1\n\tif a+b>=3:\n\t\tif b==2:\n\t\t\tprint (a)\n\t\telse:\n\t\t\tprint ((a*(a-1))//2)\n\telse:\n\t\tc=b\n\t\tb=a\n\t\tmin2=min\n\t\tmin=10**9\n\t\tfor i in lis:\n\t\t\tif min==i:\n\t\t\t\ta+=1\n\t\t\telif min>i and i!=min1 and i!=min2:\n\t\t\t\tmin=i\n\t\t\t\ta=1\n\t\tprint (a)\n\n\n\n", "def C(n,r):\r\n\tif r>n//2:\r\n\t\tr=n-r\r\n\tans=1\r\n\tfor i in range(1,r+1):\r\n\t\tans*=(n-r+i)\r\n\t\tans//=i\r\n\treturn ans\r\nn=input()\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=set(a[0:3])\r\nm={}\r\nfor i in b:\r\n\tm[i]=0\r\nfor i in a[0:3]:\r\n\tm[i]+=1\r\nans=1\r\nfor i in m:\r\n\tans*=C(a.count(i),m[i])\r\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\nif a[0] != a[1] and a[1] != a[2]: print(a.count(a[2]))\nelif a[0] != a[1] and a[1] == a[2]:\n temp = a.count(a[2])\n ans = (temp * (temp - 1)) // 2\n print(ans)\nelif a[0] == a[1] and a[1] != a[2]:\n temp = a.count(a[2])\n print(temp)\nelse:\n temp = a.count(a[2])\n ans = (temp * (temp - 1) * (temp - 2)) // 6\n print(ans)\n\t\t \t\t\t\t \t\t \t\t\t \t\t \t \t", "n = int(input())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\ni = ai[0]\r\nj = ai[1]\r\nk = ai[2]\r\nans = 0\r\nfor num in range(2,n):\r\n if k == ai[num]:\r\n ans += 1\r\nif j == k:\r\n if i == j:\r\n num2 = ans\r\n ans = 0\r\n for num in range(1,num2+2):\r\n ans += (num*(num-1))//2\r\n else:\r\n ans = (ans*(ans+1))//2\r\nprint(ans)\r\n", "def cal_combine_count(x,y):\r\n if y == 1:\r\n return x\r\n elif y == 2:\r\n return int(x * (x - 1) / 2)\r\n elif y == 3:\r\n return int(x * (x -1) * (x - 2) / 6)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n input_str = input()\r\n arr = list([int(a) for a in input_str.split()])\r\n arr.sort()\r\n min_tri = list(set(arr[0:3]))\r\n min_tri.sort()\r\n if len(min_tri) == 1:\r\n x = arr.count(min_tri[0])\r\n print(cal_combine_count(x,3))\r\n elif len(min_tri) == 2:\r\n x1 = arr[0:3].count(min_tri[0])\r\n x2 = arr.count(min_tri[1])\r\n if x1 == 1:\r\n print(cal_combine_count(x2,2))\r\n else:\r\n print(cal_combine_count(x2,1))\r\n else:\r\n x = arr.count(min_tri[2])\r\n print(cal_combine_count(x,1))\r\n ", "from math import factorial\n\nn = int(input())\nx = sorted(list(map(int, input().split())))\nd = {}\nfor item in x:\n if item not in d.keys():\n d[item] = 1\n else:\n d[item] += 1\n\nans = 0\nif x[2] != x[1]:\n ans = d[x[2]]\nelif x[2] == x[1] and x[1] != x[0]:\n ans = factorial(d[x[2]]) // factorial(2) // factorial(d[x[2]] - 2)\nelif x[0] == x[1] == x[2]:\n ans = factorial(d[x[0]]) // factorial(3) // factorial(d[x[0]] - 3)\nprint(ans)\n", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nimport operator\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\r\n# n,m=map(int,input().split())\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n \r\ndef main():\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n arr.sort()\r\n a=arr[0]\r\n b=arr[1]\r\n c=arr[2]\r\n if(a==b and b==c):\r\n x=0\r\n for i in range(n):\r\n if(arr[i]==a):\r\n x+=1\r\n print((x*(x-1)*(x-2))//6)\r\n return \r\n if(a==b):\r\n x=0\r\n y=0\r\n for i in range(n):\r\n if(arr[i]==a):\r\n x+=1\r\n elif(arr[i]==c):\r\n y+=1\r\n f1=(x*(x-1))//2\r\n print(y*f1)\r\n return\r\n if(b==c):\r\n x=0\r\n y=0\r\n for i in range(n):\r\n if(arr[i]==b):\r\n x+=1\r\n elif(arr[i]==a):\r\n y+=1\r\n f1=(x*(x-1))//2\r\n print(y*f1)\r\n return\r\n x=0\r\n y=0\r\n z=0\r\n for i in range(n):\r\n if(arr[i]==a):\r\n x+=1\r\n elif(arr[i]==b):\r\n y+=1\r\n elif(arr[i]==c):\r\n z+=1\r\n print(z*y*x)\r\nmain()", "n=int(input())\r\nlist=list(map(int,input().split()))\r\nlist.sort()\r\na,b,c=list[0],list[1],list[2]\r\nrslt=0\r\nfor i in list[2:n]:\r\n if c==i :\r\n rslt+=1\r\n else :break\r\nif c!=b :\r\n print(rslt)\r\nelif a!=b :\r\n print((rslt*(rslt+1))//2)\r\nelse : \r\n print((rslt*(rslt+1)*(rslt+2))//6)\r\n", "from math import * \r\ndef nCr(n, r): \r\n p = 1\r\n k = 1\r\n if (n - r < r): \r\n r = n - r \r\n \r\n if (r != 0): \r\n while (r): \r\n p *= n \r\n k *= r \r\n m = gcd(p, k) \r\n p //= m \r\n k //= m \r\n \r\n n -= 1\r\n r -= 1\r\n else: \r\n p = 1\r\n return(p) \r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nk=a[2]\r\nc=0\r\nfor i in range(3,n):\r\n if a[i]==k:\r\n c+=1 \r\n else:\r\n break \r\nif a[0]==a[1] and a[1]==a[2]:\r\n print(nCr(c+3,3))\r\nelif a[0]!=a[1] and a[1]==a[2]:\r\n print(nCr(c+2,2))\r\nelse:\r\n print(c+1)\r\n \r\n ", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=a.copy()\r\nb.sort()\r\nx=b[0]\r\ny=b[1]\r\nz=b[2]\r\nd={}\r\nfor j in a:\r\n if j in (x,y,z):\r\n if j not in d.keys():\r\n d[j]=1\r\n else :\r\n d[j]+=1\r\nif len(d.keys())==3:\r\n print(d[x]*d[y]*d[z])\r\nelif len(d.keys())==2:\r\n k1=k2=0\r\n if x==y:\r\n k1=d[z]\r\n k2=d[x]\r\n elif x==z:\r\n k1=d[y]\r\n k2=d[x]\r\n else :\r\n k1=d[x]\r\n k2=d[y]\r\n print(int((k2*(k2-1)/2)*k1))\r\nelse :\r\n k=d[x]\r\n print(int(k*(k-1)*(k-2)/6))", "def main():\r\n def findout(A):\r\n MIN=10**9+1\r\n for i in range(len(A)):\r\n if A[i]<MIN:\r\n MIN=A[i]\r\n count1=0 \r\n for i in range(len(A)):\r\n if A[i]==MIN:\r\n count1+=1\r\n MIN2=10**9+1\r\n for i in range(len(A)):\r\n if A[i]>MIN and A[i]<MIN2:\r\n MIN2=A[i]\r\n count2=0 \r\n for i in range(len(A)):\r\n if A[i]==MIN2:\r\n count2+=1\r\n\r\n x=count1 \r\n if count2==0 or count1>=3:\r\n return ((x*(x-1)*(x-2))//6)\r\n if count1==2:\r\n return count2\r\n if count1==1 and count2>=2:\r\n return (count2*(count2-1))//2\r\n\r\n #count1=1 count2=1\r\n MIN3=10**9+1\r\n for i in range(len(A)):\r\n if A[i]>MIN2 and A[i]<MIN3:\r\n MIN3=A[i]\r\n count3=0\r\n for i in range(len(A)):\r\n if A[i]==MIN3:\r\n count3+=1\r\n return count3 \r\n\r\n\r\n N=int(input()) \r\n A=list(map(int,input().strip().split(' ')))\r\n print(findout(A))\r\n \r\nmain() \r\n ", "#!/usr/bin/env python3\n\nn = int(input().strip())\nais = list(map(int, input().strip().split()))\n\nais.sort()\nres = [1]\nl = 1\nwhile l < 3:\n\tif ais[l] != ais[l - 1]:\n\t\tres.append(0)\n\tres[-1] += 1\n\tl += 1\nwhile l < n and ais[l] == ais[l - 1]:\n\tres[-1] += 1\n\tl += 1\n\nif res[-1] == l:\n\tprint ((l * (l - 1) * (l - 2)) // 6)\nelif res[-1] == l - 1:\n\tprint (((l - 1) * (l - 2)) // 2)\nelse: # res[-1] == l - 2\n\tprint (l - 2)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nbest = sorted(a)[:3]\r\nleftMin = [(a[0], 1)] + [None] * (n - 1)\r\nfor i in range(1, n):\r\n if a[i] < leftMin[i - 1][0]:\r\n leftMin[i] = (a[i], 1)\r\n elif a[i] == leftMin[i - 1][0]:\r\n leftMin[i] = (a[i], leftMin[i - 1][1] + 1)\r\n else:\r\n leftMin[i] = leftMin[i - 1]\r\n\r\nrightMin = [None] * (n - 1) + [(a[-1], 1)]\r\nfor i in range(n - 2, -1, -1):\r\n if a[i] < rightMin[i + 1][0]:\r\n rightMin[i] = (a[i], 1)\r\n elif a[i] == rightMin[i + 1][0]:\r\n rightMin[i] = (a[i], rightMin[i + 1][1] + 1)\r\n else:\r\n rightMin[i] = rightMin[i + 1]\r\n\r\nret = 0\r\nfor i in range(1, n - 1):\r\n triple = sorted((leftMin[i - 1][0], a[i], rightMin[i + 1][0]))\r\n if best == triple:\r\n ret += leftMin[i - 1][1] * rightMin[i + 1][1]\r\nprint(ret)\r\n", "n=int(input())\r\na=sorted(list(map(int, input().split())))\r\nif a[0]!=a[1] and a[1]!=a[2]:\r\n print(a.count(a[2]))\r\nelif a[0]!=a[1] and a[1]==a[2]:\r\n t=a.count(a[1])\r\n print((t*(t-1))//2)\r\nelif a[0]==a[1] and a[1]!=a[2]:\r\n print(a.count(a[2]))\r\nelse:\r\n t=a.count(a[0])\r\n print((t*(t-1)*(t-2))//6)", "n = int(input())\r\nA = list(map(int, input().split(' '))); A.sort()\r\n\r\nia, ib, ic = 0, 0, 0\r\nwhile ia < n and A[ia] == A[0]: ia += 1\r\nwhile (ia+ib) < n and A[ia+ib] == A[1]: ib += 1\r\nwhile (ia+ib+ic) < n and A[ia+ib+ic] == A[2]: ic += 1\r\n\r\n#This works because order of multiplication doesnt matter, ie associative shit\r\nif ib == ic == 0: print(ia*(ia-1)*(ia-2)//6)\r\nelif ic == 0: print(ia*ib*(ib-1)//2)\r\nelif ib == 0: print(ic*ia*(ia-1)//2)\r\nelse: print(ia*ib*ic)", "import sys\r\nimport bisect\r\nfrom bisect import bisect_left as lb\r\nfrom bisect import bisect_right as rb\r\ninput_=lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nfrom math import log\r\nfrom math import gcd\r\nfrom math import atan2,acos\r\nfrom random import randint\r\nsa=lambda :input_()\r\nsb=lambda:int(input_())\r\nsc=lambda:input_().split()\r\nsd=lambda:list(map(int,input_().split()))\r\nsflo=lambda:list(map(float,input_().split()))\r\nse=lambda:float(input_())\r\nsf=lambda:list(input_())\r\nflsh=lambda: sys.stdout.flush()\r\n#sys.setrecursionlimit(10**6)\r\nmod=10**9+7\r\nmod1=998244353\r\ngp=[]\r\ncost=[]\r\ndp=[]\r\nmx=[]\r\nans1=[]\r\nans2=[]\r\nspecial=[]\r\nspecnode=[]\r\na=0\r\nkthpar=[]\r\ndef dfs(root,par):\r\n if par!=-1:\r\n dp[root]=dp[par]+1\r\n for i in range(1,20):\r\n if kthpar[root][i-1]!=-1:\r\n kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]\r\n for child in gp[root]:\r\n if child==par:continue\r\n kthpar[child][0]=root\r\n dfs(child,root)\r\n \r\nans=0\r\nb=[]\r\n\r\ndef dfs2(root,par,d):\r\n global gp,dp\r\n dp[root]=d\r\n for child in gp[root]:\r\n if child==par:continue\r\n dfs2(child,root,d+1)\r\ndef hnbhai(tc):\r\n n=sb()\r\n a=sd()\r\n a.sort()\r\n prod=a[0]*a[1]*a[2]\r\n if a[0]==a[1]==a[2]:\r\n abe=a.count(a[0])\r\n print(abe*(abe-1)*(abe-2)//6)\r\n return\r\n if a[1]==a[2]:\r\n abe=a.count(a[1])\r\n print(abe*(abe-1)//2)\r\n return\r\n print(a.count(a[2]))\r\nfor _ in range(1):\r\n hnbhai(_+1)\r\n", "\r\nn=int(input())\r\ns=input().split()\r\nar=[]\r\nct=dict()\r\nfor i in range(0,n):\r\n ar.append(int(s[i]))\r\n if ar[i] in ct:\r\n ct[ar[i]]+=1\r\n else:\r\n ct[ar[i]]=1\r\n\r\nar.sort()\r\nif ar[0]==ar[1] and ar[0]==ar[2]:\r\n l=ct[ar[0]]\r\n k=(l*(l-1)*(l-2))//(3*2*1);\r\nelif ar[0]==ar[1]:\r\n l=ct[ar[0]]\r\n k=(l*(l-1))//(2*1);\r\n k=k*ct[ar[2]]\r\nelif ar[1]==ar[2]:\r\n l=ct[ar[1]]\r\n k=(l*(l-1))//(2*1);\r\n k=k*ct[ar[0]]\r\nelse:\r\n k=(ct[ar[0]])*(ct[ar[1]])*(ct[ar[2]])\r\nprint(k)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nfrom collections import Counter \r\nc=Counter(l)\r\nl=set(l)\r\nl=list(l)\r\nl.sort()\r\nfrom math import factorial as f \r\ndef nck(n,r):\r\n return (f(n)//(f(r)*f(n-r)))\r\ncurr=0\r\nk=3 \r\nfor i in l: \r\n if curr+c[i]<=k:\r\n curr+=c[i]\r\n if curr==k:\r\n print(1)\r\n break \r\n else: \r\n rem=k-curr \r\n print(nck(c[i],rem))\r\n break ", "from math import factorial as f\r\ninput()\r\na=sorted(input().split(),key=int)\r\nx,y=a.count(a[2]),a[:3].count(a[2])\r\nprint(f(x)//(f(y)*f(x-y)))\r\n", "import sys\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\ncnt = Counter(map(int, input().split()))\r\nx = 3\r\nans = 1\r\nfor k in sorted(cnt.keys()):\r\n if min(cnt[k], x) == 3:\r\n ans *= cnt[k] * (cnt[k]-1) * (cnt[k]-2) // 6\r\n x -= 3\r\n elif min(cnt[k], x) == 2:\r\n ans *= cnt[k] * (cnt[k]-1) // 2\r\n x -= 2\r\n else:\r\n ans *= cnt[k]\r\n x -= 1\r\n if x == 0:\r\n break\r\n\r\n\r\nprint(ans)\r\n", "k=int(input())\na=list(map(int,input().split()))\na.sort()\nflag_three_more=False\nflag_two_more=False\nflag_one_more=False\nif len(a)==3:\n\tprint(\"1\")\nelse:\n\tcount=1\n\ti=3\n\twhile a[i]==a[2]:\n\t\tflag_three_more=True\n\t\ti+=1\n\t\tcount+=1\n\t\tif i==len(a):\n\t\t\tbreak\n\n\tif a[2]==a[1] and flag_three_more:\n\t\tflag_two_more=True\n\n\tif a[1]==a[0] and flag_two_more:\n\t\tflag_one_more=True\n\n\tif flag_one_more:\n\t\tans=(count*(count+1)*(count+2))//6\n\telif flag_two_more:\n\t\tans=(count*(count+1))//2\n\telif flag_three_more:\n\t\tans=count\n\telse:\n\t\tans=1\n\t\t\n\tprint(ans)\n", "from typing import Counter\r\nimport math\r\n\r\ndef nCr(n,r):\r\n f = math.factorial\r\n return f(n) / f(n - r) / f(r)\r\n\r\ndef main():\r\n n = int(input())\r\n arr = sorted(list(map(int,input().split())))\r\n cnt = Counter(arr)\r\n threeCnt = Counter([arr[0],arr[1],arr[2]])\r\n # three = set([arr[0],arr[1],arr[2]])\r\n\r\n ans = 1\r\n for i in threeCnt:\r\n # print(i,nCr(cnt[i],threeCnt[i]))\r\n ans *= nCr(cnt[i],threeCnt[i])\r\n print(int(ans))\r\n\r\nmain()", "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\nA.sort()\r\nC = Counter(A)\r\n\r\nif A[2]==A[0]:\r\n t = C[A[0]]\r\n ans = t*(t-1)*(t-2)//6\r\n exit(print(ans))\r\n\r\nif A[1]==A[0] and A[1]!=A[2]:\r\n exit(print(C[A[2]]))\r\n \r\nif A[1]!=A[0] and A[1]==A[2]:\r\n t = C[A[1]]\r\n ans = t*(t-1)//2\r\n exit(print(ans))\r\n \r\nexit(print(C[A[2]]))\r\n", "import math\r\n\r\nn=int(input())\r\ncount=0\r\ncount1=0\r\narr=sorted(list(map(int,input().split())))\r\nfor i in range(n):\r\n if arr[i]==arr[2]:\r\n count+=1\r\n if i<3:\r\n count1+=1\r\nprint(int(int(math.factorial(count))/(int(math.factorial(count1))*int(math.factorial(count-count1)))))", "from math import factorial\n\ninput()\na = sorted(map(int, input().split()))\nd = {}\nfor i in a:\n if i in d:\n d[i] += 1\n else:\n d[i] = 1\n\nnumbers = set(a[:3])\nlN = len(numbers)\n\ndef nCr(n,r):\n return factorial(n)//(factorial(n - r)*factorial(r))\n\nif lN == 1:\n print(nCr(d[a[0]], 3))\nelif lN == 2:\n #two of first\n if a[0] == a[1]:\n print(d[a[2]])\n else:\n print(nCr(d[a[2]], 2))\nelse:\n print(d[a[2]])", "from functools import reduce\n\ndef nCr(a, b):\n return reduce(lambda i, j : i * j, range(a, a - b, -1)) // \\\n reduce(lambda i, j : i * j, range(b, 0, -1))\n\ndef main():\n size = int(input())\n ls = sorted(list(map(int, input().rstrip().split())))\n best = ls[2]\n count = (1 if ls[0] == ls[2] else 0) + (1 if ls[1] == ls[2] else 0) + 1\n num = len(list(filter(lambda x : x == best, ls)))\n print(nCr(num, count))\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef comb(n, r):\r\n x, y = 1, 1\r\n for i in range(n, n - r, -1):\r\n x *= i\r\n y *= i + r - n\r\n return x // y\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncnt = defaultdict(lambda : 0)\r\nfor i in a:\r\n cnt[i] += 1\r\ncnt0 = defaultdict(lambda : 0)\r\nfor i in range(3):\r\n cnt0[a[i]] += 1\r\nans = 1\r\nfor i in cnt0.keys():\r\n ans *= comb(cnt[i], cnt0[i])\r\nprint(ans)", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = sorted(read())\r\nc1, c2, c3 = a.count(a[0]), a.count(a[1]), a.count(a[2])\r\nif a[0] == a[1] == a[2]:\r\n ans = c1 * (c1 - 1) * (c1 - 2) // 6\r\nelif a[1] != a[2]:\r\n ans = c3\r\nelse:\r\n ans = c2 * (c2 - 1) // 2\r\nprint(ans)", "from math import factorial as f\r\na=int(input())\r\nz=sorted(map(int,input().split()))\r\nx,x1,x2=1,1,1\r\ny,y1,y2=1,1,1\r\ni=3\r\nwhile i<a and z[i]==z[2]:x2+=1;i+=1\r\nif z[1]==z[2]:x1+=x2;x2=0;y1+=y2;y2=0\r\nif z[0]==z[1]:x+=x1;x1=0;y+=y1;y1=0\r\nk=lambda x,y: f(x)//(f(x-y)*f(y))\r\nprint(k(x,y)*k(x1,y1)*k(x2,y2))", "\r\n\r\nn = input() \r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nc0 = a.count(a[0])\r\nif a[0] == a[1] == a[2]:\r\n \r\n print(c0 * (c0 - 1) * (c0 - 2) // 6)\r\nelif a[0] == a[1]:\r\n print(c0 * (c0 - 1) * a.count(a[2]) // 2)\r\nelse:\r\n c1 = a.count(a[1])\r\n if a[1] == a[2]:\r\n print(c0 * c1 * (c1 - 1) // 2) \r\n else:\r\n print(c0 * c1 * a.count(a[2]))\r\n \r\n \r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncnt = 0\r\nfor i in range(n):\r\n if arr[i] == arr[2]:\r\n cnt += 1\r\nif arr[2] == arr[0]:\r\n print(cnt*(cnt-1)*(cnt-2)//6)\r\nelif arr[2] == arr[1]:\r\n print(cnt*(cnt-1)//2)\r\nelse:\r\n print(cnt)\r\n", "n=eval(input());\r\ne=[];\r\nfor i in input().split(\" \"):\r\n e.append(int(i));\r\n\r\ne.sort();\r\na,b,c=e[0],e[1],e[2];\r\n\r\npos=2;\r\nwhile(pos<n and e[pos]==c): pos=pos+1;\r\ncount=pos-2;\r\n\r\nif(b!=c): print(count);\r\nelif(a!=b): print(count*(count+1)//2);\r\nelse: print(count*(count+1)*(count+2)//6);\r\n", "n = int(input())\r\nmassiv_a = list(map(int, input().split()))\r\nmassiv_a = sorted(massiv_a)\r\nx, y, z = massiv_a[0], massiv_a[1], massiv_a[2]\r\nif (x < y < z):\r\n print(massiv_a.count(z))\r\nif ((x < y) and (y == z)):\r\n sum_element = massiv_a.count(z)\r\n print((sum_element * (sum_element-1)) // 2)\r\nif ((x == y) and (y < z)):\r\n print(massiv_a.count(z))\r\nif ((x == y) and (y == z)):\r\n sum_element = massiv_a.count(z)\r\n print((sum_element * (sum_element-1) * (sum_element-2)) // 6)\r\n ", "from typing import Counter\n\n\nfrom math import comb\nn = int(input())\nnums = list(map(int, input().split()))\nnums.sort()\ncount = Counter(nums)\n\nincluded = Counter(nums[:3])\nans = 1\nfor num in included.keys():\n ans *= comb(count[num], included[num])\nprint(ans)", "n=int(input())\r\narray=list(map(int, input().rstrip().split()))\r\narray.sort()\r\ni=3\r\nwhile i<n and array[i]==array[2]:\r\n i+=1\r\nelse:\r\n if array[0]==array[1]==array[2]:\r\n print((i*(i-1)*(i-2))//6)\r\n elif array[1]==array[2]:\r\n print(((i-1)*(i-2))//2)\r\n else:\r\n print(i-2)", "from collections import Counter\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\nc = Counter(a)\r\nif a[0] == a[1] == a[2]:\r\n k = c[a[0]]\r\n print(k * (k - 1) * (k - 2) // 6)\r\nelif a[1] == a[2]:\r\n k = c[a[1]]\r\n print(k * (k - 1) // 2)\r\nelse:\r\n print(c[a[2]])", "n = int(input())\r\na = (list(map(int, input().split())))\r\nb = a[:]\r\na.sort()\r\na = a[:3]\r\nif a[0] == a[1] and a[1] == a[2]:\r\n ans = (b.count(a[0]) * (b.count(a[0]) - 1) * (b.count(a[0]) - 2)) // 6\r\nelif a[1] == a[2]:\r\n ans = (b.count(a[1]) * (b.count(a[1]) - 1))//2\r\nelse:\r\n ans = b.count(a[2])\r\nprint(ans)\r\n\r\n\r\n \r\n \r\n \r\n ", "def c(n, k):\n\tr = 1\n\tfor i in range(k):\n\t\tr *= n\n\t\tn -= 1\n\tfor i in range(2, k + 1):\n\t\tr //= i\n\treturn r\n\nn = int(input())\nl = sorted(map(int, input().split()))\nprev = l[0]\nbeg = 0\ncnt = 0\nans = 1\nfor i in range(n):\n\tif l[i] == prev:\n\t\tcnt += 1\n\telse:\n\t\tans *= c(i - beg, min(3, i) - beg)\n\t\tcnt = 1\n\t\tprev = l[i]\n\t\tbeg = i\n\t\tif i > 2:\n\t\t\tbreak\nif beg < 3:\n\tans *= c(n - beg, 3 - beg)\n\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif a[0]<a[1]<a[2] or a[0]==a[1] and a[1]<a[2]:\r\n print(a.count(a[2]))\r\nelif a[0]<a[1] and a[1]==a[2]:\r\n cnt=a.count(a[2])\r\n print(cnt*(cnt-1)//2)\r\nelse:\r\n cnt=a.count(a[0])\r\n print(cnt*(cnt-1)*(cnt-2)//6)", "import math\r\ndef arrange(n,k):\r\n return int(math.factorial(n)/(math.factorial(k)*math.factorial(n-k)))\r\ntotal_number=int(input())\r\ndata=list(map(int,input().split()))\r\ndata_sorted=(sorted(data))\r\nanswer=1\r\nfor i in list(set(data_sorted[:3])):\r\n\r\n n=data.count(i)\r\n k=data_sorted[:3].count(i)\r\n answer*=arrange(n,k)\r\nprint(answer)", "from math import factorial as f\r\nfrom functools import reduce\r\n\r\ndef C(n, k):\r\n return f(n) // f(k) // f(n - k)\r\n\r\ninput()\r\na = list(map(int, input().split()))\r\nless = sorted(a)[:3]\r\ns = set(less)\r\nm = [less.count(i) for i in s]\r\nn = [a.count(i) for i in s]\r\n\r\nprint(reduce(lambda x, y: x * y, map(lambda x, y: C(x, y), n, m), 1))\r\n\r\n", "n = int(input())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nans = 0\r\n\r\nif l[2] > l[1]:\r\n for i in range(2, n):\r\n if l[i] == l[2]:\r\n ans += 1\r\n else:\r\n break\r\n\r\nelif l[1] > l[0]:\r\n num = 0\r\n for i in range(1, n):\r\n if l[i] == l[1]:\r\n num += 1\r\n else:\r\n break\r\n\r\n ans = (num * (num-1)) // 2\r\n\r\nelse:\r\n num = 0\r\n for i in range(0, n):\r\n if l[i] == l[0]:\r\n num += 1\r\n else:\r\n break\r\n #print(num)\r\n ans = (num * (num-1) * (num-2)) // 6\r\nprint(ans)\r\n", "## 2\r\n\r\ndef c(x, y):\r\n a = b = 1\r\n for i in range(y):\r\n a *= x-i\r\n b *= y-i\r\n return int(a/b)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif n < 3:\r\n print(0)\r\na.sort()\r\nx1, x2, x3 = a[0], a[1], a[2]\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] == x3:\r\n count += 1\r\nif x1==x2 and x2==x3:\r\n print(c(count, 3))\r\nelif x1<x2 and x2==x3:\r\n print(c(count, 2))\r\nelse:\r\n print(count)\r\n \r\n", "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\n\r\nd, n = defaultdict(int), int(input())\r\ns = sorted(list(map(int, input().split())))\r\nfor i in s: d[i] += 1\r\nif s[2] != s[1]: print(d[s[2]])\r\nelif s[2] == s[1] and s[1] != s[0]: print(d[s[2]] * (d[s[2]] - 1) // 2)\r\nelse: print(d[s[0]] * (d[s[0]] - 1) * (d[s[0]] - 2) // 6)", "n=map(int,input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(len(l)):\r\n if l[i] in d.keys():\r\n d[l[i]]+=1\r\n else:\r\n d[l[i]]=1\r\nll=sorted(d.keys())\r\n\r\nans=0\r\na=d[ll[0]]\r\nif len(d)>1:\r\n b=d[ll[1]]\r\nif len(d)>2:\r\n c=d[ll[2]]\r\nif a>=3:\r\n ans+=a*(a-1)*(a-2)/6\r\nelif a==2:\r\n ans+=a*(a-1)/2*b\r\nelif a==1:\r\n ans+=a\r\n if b>=2:\r\n ans*=b*(b-1)/2\r\n else:\r\n ans*=b*c\r\n\r\nprint(int(ans))\r\n", "import sys\r\nimport math\r\nimport collections\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\na = ints()\r\na.sort()\r\nfreqs = collections.defaultdict(int)\r\nfor i in range(n): freqs[a[i]] += 1\r\n\r\ni = 0\r\nans = 1\r\nwhile i < 3:\r\n amt = freqs[a[i]]\r\n cnt = a[:3].count(a[i])\r\n if cnt == 3:\r\n ans *= (amt * (amt - 1) * (amt - 2))//6\r\n i += 3\r\n elif cnt == 2:\r\n ans *= (amt * (amt - 1)) // 2\r\n i += 2\r\n else:\r\n ans *= amt\r\n i += 1\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().strip().split(' ')))\r\nl1=sorted(l)\r\na=l1[0]\r\nb=l1[1]\r\nc=l1[2]\r\nif a==b and b==c:\r\n ans=l.count(a)\r\n a=ans\r\n print((a*(a-1)*(a-2))//6)\r\nelif b!=c:\r\n ans=l.count(c)\r\n c=ans\r\n print(c)\r\nelse:\r\n ans=l.count(b)\r\n b=ans\r\n print((b*(b-1))//2)\r\n ", "from sys import stdin\nn=int(input())\ns=list(map(int,input().split()))\ns.sort()\ndp=[[1 for i in range(4)] for i in range(n+2)]\ndp[0][0]=0\nfor i in range(1,n+1):\n for j in range(1,4):\n if(i<j):\n dp[i][j]=0\n continue\n dp[i][j]=dp[i-1][j]+dp[i-1][j-1]\ns1=s[0:3]\nans=dp[s.count(s1[-1])][s1.count(s1[-1])]\nprint(ans)\n\n \t \t \t\t \t\t \t \t \t\t\t \t \t \t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\na2=a[2]\r\ncnt=0\r\nfor i in range(n):\r\n if a2==a[i]:\r\n cnt+=1\r\n\r\nif a[0]==a2:\r\n print(cnt*(cnt-1)*(cnt-2)//6)\r\nelif a[1]==a2:\r\n print(cnt*(cnt-1)//2)\r\nelse:\r\n print(cnt)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nk=a.count(a[2])\r\nif a[1]<a[2]:\r\n print(k)\r\nelse:\r\n if a[0]<a[1]:\r\n print(k*(k-1)//2)\r\n else:\r\n print(k*(k-1)*(k-2)//6)\r\n \r\n", "l = int(input())\narr = list(map(int, input().split()))\narr.sort()\n\n\nif( (arr[0] != arr[1] and arr[1] != arr[2]) or ( arr[0] == arr[1] and arr[1] != arr[2] ) ):\n print(arr.count(arr[2]))\n #print('abc or aab')\n\nelif( arr[0] != arr[1] and arr[1] == arr[2] ):\n n = arr.count(arr[1])\n print( int((n * (n - 1)) / 2) )\n #print('abb')\n\nelif( arr[0] == arr[1] == arr[2]):\n n = arr.count(arr[0])\n print( int((n * (n -1 ) * (n - 2) ) / 6) )\n #print('aaa')", "n = int( input() )\r\na = sorted( list( map( int , input().split() ) ) )\r\ncnt = a.count( a[2] )\r\nif( a[1] < a[2] ):\r\n print(cnt)\r\nelif( a[0] < a[1] ):\r\n print( cnt*(cnt - 1) // 2 )\r\nelse:\r\n print( cnt * ( cnt - 1 )*(cnt - 2) // 6 )", "n=int(input());\r\nlist=[];\r\nfor i in input().split(\" \"):\r\n list.append(int(i));\r\nlist.sort();\r\na,b,c=list[0],list[1],list[2];\r\nind=2;\r\ncount=0;\r\nwhile(ind<n and list[ind]==c):\r\n ind+=1;\r\ncount=ind-2;\r\nif(b!=c):\r\n print(count);\r\nelif(a!=b):\r\n print(count*(count+1)//2);\r\nelse:\r\n print(count * (count + 1)*(count + 2)//6);", "def fatorial(n):\r\n if n == 0:\r\n return 1\r\n else:\r\n return fatorial(n-1) * n\r\n\r\n\r\n\r\nqtd = int(input())\r\nvalores = list(map(int, input().split()))\r\nvalores.sort()\r\n\r\nif valores.count(valores[0]) == 1:\r\n if valores.count(valores[1]) == 1:\r\n print(valores.count(valores[2]))\r\n else:\r\n aux = valores.count(valores[1])\r\n print(int(aux*(aux-1)/2))\r\nelif valores.count(valores[0]) == 2:\r\n print(valores.count(valores[2]))\r\nelse:\r\n aux = valores.count(valores[2])\r\n x = int(aux*(aux-1)*(aux-2)/6)\r\n print(x)", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n data=list(map(int,input().split()))\r\n data.sort()\r\n a,b,c=data[:3]\r\n if a==c:\r\n k=data.count(a)\r\n print(k*(k-1)*(k-2)//6)\r\n else:\r\n if a==b:\r\n k1=data.count(a)\r\n k2=data.count(c)\r\n print(k1*(k1-1)//2*k2)\r\n else:\r\n if b!=c:\r\n print(data.count(a)*data.count(b)*data.count(c))\r\n else:\r\n k=data.count(b)\r\n print(data.count(a)*k*(k-1)//2)\r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "import sys\r\nl = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\n\r\n\r\nif( (arr[0] != arr[1] and arr[1] != arr[2]) or ( arr[0] == arr[1] and arr[1] != arr[2] ) ):\r\n print(arr.count(arr[2]))\r\n #print('abc or aab')\r\n\r\nelif( arr[0] != arr[1] and arr[1] == arr[2] ):\r\n n = arr.count(arr[1])\r\n print( int((n*(n-1))/2) )\r\n #print('abb')\r\n\r\nelif( arr[0] == arr[1] == arr[2]):\r\n n = arr.count(arr[0])\r\n print( int((n * (n-1) * (n-2) )/6) )\r\n #print('aaa')\r\n\r\n", "import operator as op\r\nfrom functools import reduce\r\ndef comb(n, r):\r\n r = min(r, n-r)\r\n if r == 0: return 1\r\n numer = reduce(op.mul, range(n, n-r, -1))\r\n denom = reduce(op.mul, range(1, r+1))\r\n return numer//denom\r\nn=int(input())\r\nl=[int(i)for i in input().split()]\r\nd=sorted(l)\r\na=d[0]\r\nb=d[1]\r\nc=d[2]\r\nif a == b and b==c :\r\n\tprint(comb(l.count(a),3))\r\nelif a == b: \r\n\tprint(l.count(c))\r\nelif b==c:\r\n\tprint(comb(l.count(c),2))\r\nelse:\t\r\n\tprint(l.count(c))", "from collections import Counter\n\ndef main():\n int(input())\n a = list(map(int, input().split()))\n\n a.sort()\n x, y, z = a[:3]\n freq = Counter(a)\n\n if x == y and y == z:\n ans = freq[x] * (freq[x] - 1) * (freq[x] - 2) // 6\n elif x == y:\n ans = freq[x] * (freq[x] - 1) * freq[z] // 2\n elif x == z:\n ans = freq[x] * (freq[x] - 1) * freq[y] // 2\n elif y == z:\n ans = freq[y] * (freq[y] - 1) * freq[x] // 2\n else:\n ans = freq[x] * freq[y] * freq[z]\n\n print(ans)\n\nmain()\n", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nx, y, z = a[0], a[1], a[2]\r\nif x < y < z:\r\n print(a.count(z))\r\nelif x < y <= z:\r\n c = a.count(y)\r\n print(c*(c-1)//2)\r\nelif x <= y < z:\r\n print(a.count(z))\r\nelse:\r\n c = a.count(z)\r\n print(c*(c-1)*(c-2)//6)\r\n", "from math import factorial as f\r\ndef choose(n, k): return f(n)//(f(n-k)*f(k))\r\nn = int(input()) \r\na = sorted([int(i) for i in input().split()])\r\ns = sorted(set(a))\r\nl = [0] * 3\r\nfor i in range(3):\r\n try : l[i] = a.count(s[i])\r\n except IndexError: break\r\nif l[0] >= 3 : print(choose(l[0], 3)) \r\nelif l[0] + l[1] >=3 : \r\n if l[0] > 1 : print(choose(l[0], 2)*l[1])\r\n else : print(choose(l[1], 2))\r\nelse : \r\n print(l[2]) \r\n", "from math import factorial as f\r\n\r\ndef ncr(n,r):\r\n return (f(n))//(f(r)*f(n-r))\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nmn= min(l)\r\np = sum(1 for x in l if x==mn)\r\n\r\nmn2 = max(l)\r\nfor x in l:\r\n if mn<x<mn2:\r\n mn2=x\r\nq = sum(1 for x in l if x==mn2)\r\n\r\nmn3 = max(l)\r\nfor x in l:\r\n if mn2<x<mn3:\r\n mn3=x\r\nr = sum(1 for x in l if x==mn3)\r\n\r\nif p>=3:\r\n print(ncr(p,3))\r\nelse:\r\n if p==2:\r\n print(q)\r\n if p==1:\r\n if q==1:\r\n print(r)\r\n else:\r\n print(ncr(q,2))", "def ncr(n, r):\n\tres = 1\n\tfor i in range(1, r + 1):\n\t\tres = (res * (n + 1 - i) // i)\n\n\treturn res\n\nn = int(input())\narr = [*map(int, input().split())]\n\na, b, c = sorted(arr)[:3]\nca, cb, cc = arr.count(a), arr.count(b), arr.count(c)\n\nif a == b == c:\n\tprint(ncr(ca, 3))\nelif a == b:\n\tprint(ncr(ca, 2) * cc)\nelif b == c:\n\tprint(ncr(cb, 2) * ca)\nelse:\n\tprint(ca * cb * cc)", "import sys\r\nimport bisect\r\n# import heapq\r\nfrom math import ceil,floor,factorial\r\n\r\ndef c(a,b):\r\n return int((factorial(a))/((factorial(b)*factorial(a-b))))\r\n\r\nRI = lambda : [int(x) for x in sys.stdin.readline().split()]\r\nri = lambda : sys.stdin.readline().strip()\r\nmod = 10**9+7\r\n# for _ in range(int(ri())):\r\n\r\nn = int(ri())\r\na = RI()\r\n\r\ndic = {}\r\nfor i in range(len(a)):\r\n if a[i] not in dic:\r\n dic[a[i]]=1\r\n else:\r\n dic[a[i]]+=1\r\n\r\nnum = [i for i in dic]\r\nnum.sort()\r\nk = 3\r\ni=0\r\nfor i in range(len(num)):\r\n if dic[num[i]] >= k:\r\n break\r\n else:\r\n k -=dic[num[i]]\r\n\r\nprint(c(dic[num[i]],k))", "n = int(input())\nA = list(map(int, input().split()))\nA.sort()\np = A[0] * A[1] * A[2]\nc = 1\nfor i in range(3, n):\n if A[i] == A[2]:\n c += 1\n else:\n break\nif A[0] == A[1] == A[2]:\n print((c + 2) * (c + 1) * c // 6)\nelif A[1] == A[2]:\n print((c + 1) * c // 2)\nelse:\n print(c)", "from math import comb\r\n\r\na = int(input())\r\nb = sorted([int(x) for x in input().split()])\r\nx, y, z = b[:3]\r\nif x == z:\r\n print(comb(b.count(x), 3))\r\nelif x == y:\r\n print(b.count(z))\r\nelif y == z:\r\n print(comb(b.count(z), 2))\r\nelse:\r\n print(b.count(z))\r\n", "\n\nn = int(input())\ntab = sorted([int(x) for x in input().split()])\n\na = tab.count(tab[0])\nb = tab.count(tab[1])\nc = tab.count(tab[2])\n\nif tab[0] == tab[1] and tab[1] == tab[2]:\n print(a * (a - 1) * (a - 2) // 6)\nelif tab[0] == tab[1]:\n print(c)\nelif tab[1] == tab[2]:\n print(b * (b - 1) // 2)\nelse:\n print(c)\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nfrom collections import Counter\r\nC = Counter(A)\r\nA.sort()\r\nif A[0] != A[1] and A[1] != A[2] and A[2] != A[0]:\r\n x = C[A[2]]\r\n ans = x\r\nelif A[0] != A[1] and A[1] == A[2]:\r\n x = C[A[1]]\r\n ans = x*(x-1)//2\r\nelif A[0] == A[1] and A[1] != A[2]:\r\n x = C[A[2]]\r\n ans = x\r\nelse:\r\n x = C[A[0]]\r\n ans = x*(x-1)*(x-2)//6\r\nprint(ans)\r\n", "from math import factorial as fact\r\nfrom math import inf\r\n\r\nN = int(input())\r\nnums = list(map(int, input().split(' ')))\r\nmins = [inf, inf, inf]\r\nfor a in nums:\r\n if a < mins[0]:\r\n mins[2] = mins[1]\r\n mins[1] = mins[0]\r\n mins[0] = a\r\n elif a < mins[1]:\r\n mins[2] = mins[1]\r\n mins[1] = a\r\n elif a < mins[2]:\r\n mins[2] = a\r\n\r\nif mins[0] == mins[1]:\r\n if mins[1] == mins[2]:\r\n reps = {mins[0] : 3}\r\n else:\r\n reps = {mins[0] : 2, mins[2] : 1}\r\nelse:\r\n if mins[1] == mins[2]:\r\n reps = {mins[0] : 1, mins[1]: 2}\r\n else:\r\n reps = {mins[0] : 1, mins[1]: 1, mins[2] : 1}\r\n\r\nans = 1\r\nfor key, m in reps.items():\r\n n = nums.count(key)\r\n ans *= fact(n) / (fact(m) * fact(n - m))\r\n\r\nprint(int(ans))" ]

[ "f = lambda: map(int, input().split())\r\nn, a = f()\r\nd = [0] * 1000001\r\nfor q in f():\r\n if d[q] < d[a]: d[q] = -1\r\n d[q] += 1\r\nk = d[a]\r\nd[0] = d[a] = -1\r\ns = max(d)\r\nprint(d.index(s) if s >= k else -1)", "n,a=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nm=10**6+1\r\ncolor=[[] for i in range(m)]\r\ntmp=[0]*n\r\nfor i in range(n):\r\n if c[i]==a:\r\n tmp[i]=1\r\n else:\r\n color[c[i]].append(i)\r\n if i!=0:\r\n tmp[i]+=tmp[i-1]\r\n\r\nfor i in range(m):\r\n if color[i]:\r\n now=0\r\n flag=True\r\n for idx in color[i]:\r\n now+=1\r\n if now<=tmp[idx]:\r\n flag=False\r\n if now<tmp[-1]:\r\n flag=False\r\n if flag:\r\n print(i)\r\n exit()\r\n\r\nprint(-1)", "import sys\r\nfrom heapq import heappop, heappush\r\nfrom collections import Counter\r\n\r\nn, A = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nif A not in a:\r\n print(1 if A != 1 else 2)\r\n exit()\r\n\r\nhq = [(0, i) for i in range(1, 10**6+1) if i != A]\r\nA_cnt = 0\r\nadd = Counter()\r\n\r\nfor x in a:\r\n if x == A:\r\n A_cnt += 1\r\n while hq and hq[0][0] < A_cnt:\r\n val, color = heappop(hq)\r\n if add[color] and val + add[color] >= A_cnt:\r\n heappush(hq, (val + add[color], color))\r\n add[color] = 0\r\n else:\r\n add[x] += 1\r\n\r\nprint(hq[0][1] if hq else -1)\r\n", "n, A = [int(i) for i in input().split()]\r\nmah = [int(i) for i in input().split()]\r\nd = {}\r\ncntA = 0\r\nb = -1\r\nfor i in range(n):\r\n if mah[i] == A:\r\n cntA += 1\r\n elif mah[i] in d:\r\n if d[mah[i]] >= cntA:\r\n d[mah[i]] += 1\r\n else:\r\n d.pop(mah[i])\r\n elif cntA == 0:\r\n d[mah[i]] = 1\r\nfor i in d:\r\n if d[i] >= cntA:\r\n b = i\r\n break\r\nprint(b)", "\r\nimport sys\r\n\r\nnative_input = input\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n n, a = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n\r\n d = {}\r\n\r\n ccc = 0\r\n\r\n for i in range(n):\r\n if c[i] != a:\r\n if ccc == 0:\r\n d[c[i]] = d.setdefault(c[i], 0) + 1\r\n else:\r\n if c[i] in d:\r\n d[c[i]] += 1\r\n\r\n else:\r\n ccc += 1\r\n keys = list(d.keys()).copy()\r\n for k in keys:\r\n if d[k] < ccc:\r\n d.pop(k)\r\n\r\n if len(d.keys()):\r\n for k in d.keys():\r\n print(k)\r\n return\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "n, a = map(int, input().split())\nc = list(map(int, input().split()))\n\nwin = [True for _ in range(1000001)]\nwin[a] = False\ncnt = [0 for _ in range(1000001)]\nfor b in c:\n if cnt[b] < cnt[a]:\n win[b] = False\n cnt[b] += 1\n\nfor i in range(1000001):\n if cnt[i] < cnt[a]:\n win[i] = False\n\nans = -1\nfor b in c:\n if win[b]:\n ans = b\n break\n\nprint(ans)\n", "n, A=map(int, input().split())\nC=list(map(int, input().split()))\nT={}\nCB=-1\nCA=0\nfor i in range(n):\n if C[i]==A:\n CA+=1\n elif C[i] in T:\n if T[C[i]]>=CA:\n T[C[i]]+=1\n else:\n T.pop(C[i])\n elif CA==0:\n T[C[i]]=1\nfor i in T:\n if T[i]>=CA:\n CB=i\n break\nprint(CB)\n\t \t \t \t\t\t\t\t\t\t\t\t\t \t\t \t\t\t \t\t", "n, a = map(int, input().split())\nentrada = list(map(int, input().split()))\n \ncarros = {} \n\nqtd_alice = 0\n \nfor carro in entrada:\n if carro == a:\n qtd_alice += 1\n for car in list(carros):\n if carros[car] < qtd_alice:\n del carros[car]\n else:\n d = carros.pop(carro,0)\n if d >= qtd_alice:\n carros[carro] = d+1\n \nif len(carros) == 0:\n print(-1)\nelse:\n print(list(carros)[0])\n", "n, a = map(int, input().split())\r\na -= 1\r\nC = list(map(int, input().split()))\r\nC = [c-1 for c in C]\r\n\r\nfrom collections import Counter, defaultdict\r\nCnt = Counter()\r\nD = defaultdict(lambda: True)\r\nfor c in C:\r\n if Cnt[c] < Cnt[a]:\r\n D[c] = False\r\n Cnt[c] += 1\r\n\r\nfor c in Cnt.keys():\r\n if not D[c]:\r\n continue\r\n if c == a:\r\n continue\r\n if Cnt[c] >= Cnt[a]:\r\n print(c+1)\r\n exit()\r\nprint(-1)\r\n", "import sys\r\nn, k = map(int, sys.stdin.readline().split())\r\nls = list(map(int, sys.stdin.readline().split()))\r\nmp = {}\r\nfor i in range(1, 1000001):\r\n mp[i] = 0\r\nfor i in ls:\r\n if i == k:\r\n mp[i] += 1\r\n else:\r\n if mp[i] == -1:\r\n continue\r\n else:\r\n mp[i] += 1\r\n if mp[i] <= mp[k]:\r\n mp[i] = -1\r\nfor i in range(1, 1000001):\r\n if mp[i] >= mp[k] and i != k:\r\n print(i)\r\n exit()\r\nprint(-1)", "def resolver():\n entrada = input().split()\n\n n = int(entrada[0])\n m = int(entrada[1])\n\n arr_x = [int(x) for x in input().split()]\n\n a = [0] * 1000001\n\n for i in range(n):\n x = arr_x[i]\n if x == m:\n a[m] += 1\n else:\n if a[x] >= a[m]:\n a[x] += 1\n\n i = 1\n while i <= 1 * pow(10, 6):\n if a[i] >= a[m] and i != m:\n print(i)\n return\n i += 1\n\n print(-1)\n return\n\nresolver()\n \t\t \t\t \t\t\t\t\t \t \t \t\t\t \t\t \t", "def main():\r\n n, a = [int(item) for item in input().split()]\r\n\r\n c = [int(item) for item in input().split()]\r\n \r\n d = {key:0 for key in range(1, 10 ** 6 + 1)}\r\n mx = -1\r\n \r\n ind = [float(\"inf\")] * (10 ** 6 + 1)\r\n cnt = [0] * (10 ** 6 + 1)\r\n \r\n for i in range(n):\r\n if ind[c[i]] == float(\"inf\"):\r\n ind[c[i]] = i\r\n for i in range(n):\r\n if c[i] == a:break\r\n cnt[c[i]] += 1 \r\n ans = -1\r\n i = 0\r\n while i < n:\r\n while i < n and c[i] == a:\r\n d[c[i]] += 1\r\n mx -= 1\r\n if mx < 0:\r\n return -1\r\n i += 1\r\n if i == n:continue\r\n if d[c[i]] - d[a] < 0:d[c[i]] = - float(\"inf\")\r\n d[c[i]] += 1\r\n if d[c[i]] - d[a] > mx and ind[c[i]] < ind[a]:\r\n ans = c[i]\r\n mx = max(mx, d[c[i]] - d[a])\r\n i += 1\r\n else:\r\n return ans\r\n\r\nprint(main())", "n, a = map(int,input().split())\r\nc = list(map(int,input().split()))\r\n\r\nx =0\r\nm = {}\r\n\r\nfor k in c:\r\n if k != a:\r\n if k in m:\r\n m[k] += 1\r\n elif x == 0:\r\n m[k] = 1\r\n else:\r\n x += 1\r\n t = {}\r\n for k in m:\r\n if m[k] >= x:\r\n t[k] = m[k]\r\n m = t\r\n if len(m) == 0:\r\n break\r\n \r\n\r\nif len(m) == 0:\r\n print(-1)\r\nelse:\r\n for k in m:\r\n print(k)\r\n break\r\n", "n,k=map(int,input().split())\r\nfrom collections import *\r\nal=defaultdict(list)\r\nz=list(map(int,input().split()))\r\nfrom bisect import *\r\nans=[0 for i in range(len(z))]\r\nfor i in range(len(z)):\r\n if(i==0):\r\n ans[i]=int(z[i]==k)\r\n else:\r\n ans[i]=ans[i-1]+int(z[i]==k)\r\n\r\n al[z[i]].append(i)\r\n\r\nsave=-1\r\nfor i in al:\r\n if(i==k):\r\n continue;\r\n if(len(al[i])<len(al[k])):\r\n continue;\r\n\r\n flag=0\r\n for j in range(len(al[k])):\r\n\r\n t=bisect_left(al[i],al[k][j])\r\n t-=1\r\n if(t<j):\r\n flag=1\r\n\r\n if(flag==0):\r\n save=i\r\n break;\r\n\r\nprint(save)\r\n \r\n\r\n \r\n \r\n", "n, A = map(int, input().split())\r\ncars = list(map(int, input().split()))\r\nc = 1000000\r\ncnt = [0 for i in range(c)]\r\nans = [True for i in range(c)]\r\nfor i in range(n):\r\n cnt[cars[i] - 1] += 1\r\n if cnt[cars[i] - 1] <= cnt[A - 1]:\r\n ans[cars[i] - 1] = False\r\nout = -1\r\nfor i in range(c):\r\n if cnt[i] < cnt[A - 1]:\r\n ans[i] = False\r\n if i != A - 1 and ans[i]:\r\n out = i + 1\r\n break\r\nprint(out)# 1691405354.854539" ]

[ "s, p = input(), input()\r\nn, m = len(s) + 1, len(p)\r\nd = [[0] * n for t in range(n)]\r\nfor x in range(1, n):\r\n i, j = x, m\r\n while i and j:\r\n j -= s[i - 1] == p[j - 1]\r\n i -= 1\r\n if not j:\r\n for y in range(i + 1): d[x][y + x - i - m] = d[i][y] + 1\r\n for y in range(x): d[x][y] = max(d[x][y], d[x - 1][y])\r\nprint(*d[-1])" ]

[ "def main():\r\n a = int(input())\r\n b = [2] * (a // 2)\r\n print(a // 2)\r\n if a % 2 != 0:\r\n b[-1] = 3\r\n \r\n\r\n print(*b)\r\n \r\nmain()", "n = int(input())\r\n\r\nif(n%2==0):\r\n ans=n//2\r\n arr=[2]*ans\r\nelse:\r\n n=n-3\r\n ans=1\r\n ans = ans +n//2\r\n arr=[2]*(ans-1) + [3]\r\n \r\nprint(ans)\r\nprint(*arr)", "n=int(input())\r\n\r\nif n%2==0:\r\n\tk=[2]*(n//2)\r\n\tprint(n//2)\r\n\tprint(*k)\r\nelse:\r\n\tk=[2]*(n//2)\r\n\tk[len(k)-1]=3\r\n\tprint(n//2)\r\n\tprint(*k)", "a = int(input())\r\nprint(a // 2)\r\nb = [2] * (a // 2)\r\nif a % 2 == 0:\r\n\tprint(*b)\r\nelse:\r\n\tb[-1] = 3\r\n\tprint(*b)", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n print(n//2)\r\n for x in range(n//2):\r\n print(2,end=\" \")\r\nelse:\r\n print(n//2)\r\n for x in range((n//2) - 1):\r\n print(2,end=\" \")\r\n print(3)\r\n", "n = int(input())\r\n\r\nprimes_sum = [2] * (n // 2)\r\nif n % 2 == 1:\r\n primes_sum[-1] = 3\r\n\r\nprint(len(primes_sum))\r\nprint(*primes_sum)\r\n", "n=int(input())\r\nout=[]\r\nif n&1:\r\n n-=3\r\n out.append(3)\r\nfor _ in range(n//2):\r\n out.append(2)\r\nprint(len(out))\r\nprint(' '.join(map(str,out)))", "n=int(input())\nif n%2 == 0:\n print (n//2)\n l = [\"2\"]*(n//2)\n print (\" \".join(l)) \nelse:\n print (n//2)\n l = [\"2\"]*(n//2-1)\n l += [\"3\"]\n print (\" \".join(l))", "n = int(input())\ndels = []\ncount = 0\nif n%2==0:\n while n >= 2:\n n -= 2\n dels.append(2)\n count += 1 \n while n >= 3:\n n -= 3\n dels.append(3)\n count += 1 \nelse:\n while n >= 4:\n n -= 2\n dels.append(2)\n count += 1 \n while n >= 3:\n n -= 3\n dels.append(3)\n count += 1 \n \n\ndels.sort()\nprint(count)\nprint(*dels)\n# Sat Sep 10 2022 07:12:54 GMT+0000 (Coordinated Universal Time)\n", "import collections, math, bisect, sys\r\nfrom collections import OrderedDict, Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nimport string\r\n\r\ndef get_line(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef in1(): return int(stdin.readline())\r\n\r\n\r\ndef display_arr(arr): stdout.write(\" \".join(map(str, arr)) + \"\\n\")\r\n\r\n\r\ndef display_num(num): stdout.write(str(num) + \"\\n\")\r\n\r\n\r\ndef factorial(n): return n * factorial(n - 1) if n > 1 else 1\r\n\r\n\r\ndef percent(c, s): return (c / s) * 100\r\n\r\n\r\ndef l2d(a): return collections.Counter(a)\r\n\r\n\r\ndef with_index():\r\n a, i = [], 0\r\n for t in map(int, input().split()):\r\n a.append((t, i))\r\n i += 1\r\n return a\r\n\r\ndef SieveOfEratosthenes(m,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]:\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n ans = 0\r\n print(prime)\r\n for p in range(2,n + 1):\r\n if p <m:\r\n break\r\n if prime[p]:\r\n ans += p\r\n return ans\r\n#\r\n# par = [i for i in range(n+1)]\r\n# # print(len(par), par)\r\n# rank = [1]*(n+1)\r\n# def find(n1):\r\n# res = n1\r\n# while res != par[res]:\r\n# par[res] = par[par[res]]\r\n# res = par[res]\r\n# return res\r\n#\r\n# def union(n1, n2):\r\n# p1, p2 = find(n1), find(n2)\r\n# if p1 == p2:\r\n# return 0\r\n# if rank[p2] > ra nk[p1]:\r\n# par[p1] = p2\r\n# rank[p2] += rank[p1]\r\n# else :\r\n# par[p2] = p1\r\n# rank[p1] += rank[p2]\r\n# return 1\r\n#\r\n# res = n\r\n\r\ndef find_min(l,r,a):\r\n mini = float(\"inf\")\r\n left = l\r\n for i in range(l,r):\r\n if a[i] < mini:\r\n mini = a[i]\r\n left = i\r\n return left\r\ndef gcd(a,b):\r\n res = 0\r\n for i in range(2,min(a,b)):\r\n if a%i==0 and b%i==0:\r\n res = max(res,i)\r\n return res\r\nn = in1()\r\n\r\nif n&1:\r\n print(n//2)\r\n n-=2\r\n for i in range(n//2):\r\n print(2,end=\" \")\r\n print(3)\r\nelse:\r\n print(n//2)\r\n for i in range(n//2):\r\n print(2,end=\" \")\r\n\r\n", "n = int(input()) \r\nlist =[] \r\nif (n % 2 == 1): \r\n list.append(3)\r\n n -= 3\r\nwhile (n > 0):\r\n list.append(2)\r\n n -= 2\r\nprint(len(list))\r\nfor i in range(len(list)):\r\n print(list[i],end=\" \")", "a=int(input())\r\nif a==3:\r\n print(1)\r\n print(3)\r\nelif a%2!=0:\r\n print(a//2)\r\n print('2 '*(a//2-1),3,sep=\"\")\r\nelse:\r\n print(a//2)\r\n print('2 '*(a//2),sep=\"\")", "n=int(input())\r\nif n%2 == 0 :\r\n print(n//2)\r\n print(*([2]*(n//2)))\r\nelse:\r\n print((n-1)//2)\r\n print(*([2]*((n-3)//2)+[3]))", "if __name__==\"__main__\":\r\n n = int(input())\r\n if n%2==0:\r\n print(int(n/2))\r\n for i in range(int(n/2)):\r\n print(2,end=\" \")\r\n else:\r\n print(int(n/2))\r\n for i in range(int(n/2-1)):\r\n print(2,end=\" \")\r\n print(3)", "n = int(input());\r\nif not n%2:\r\n print(n//2)\r\n st = \"2 \" * (n//2)\r\n print(st)\r\nelse:\r\n n -= 3\r\n print(n//2 + 1)\r\n st = \"2 \" * (n//2)\r\n print(st + '3')", "a=int(input())\r\nif a%2!=0:\r\n a=a-3\r\n x=a//2\r\n print(x+1)\r\n for i in range (x):\r\n print (2, end=' ')\r\n print (3, end=' ')\r\nelse:\r\n x=a//2\r\n print (a//2)\r\n for i in range (x):\r\n print (a//x, end=' ')", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\n\r\ndef solve():\r\n n = get_int()\r\n \r\n if n < 4:\r\n print(1)\r\n print(n)\r\n else:\r\n primes = [2]*(n//2)\r\n primes[-1] += (n&1)\r\n print(len(primes))\r\n print(*primes)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "def isEven(number):\r\n if number %2 ==0:\r\n return True\r\n else :\r\n return False\r\n\r\nresult = []\r\nnumber = int(input())\r\nif isEven(number):\r\n for i in range(number//2):\r\n result.append(2)\r\nelse :\r\n for i in range((number//2)-1):\r\n result.append(2)\r\n result.append(3)\r\nprint(len(result))\r\nfor value in result:\r\n print(value, end=' ')", "t=int(input())\r\nif t%2==0:\r\n print(t//2)\r\n print('2 '*(t//2))\r\nelse:\r\n print(t//2)\r\n print('2 '*(t//2-1)+'3')\r\n ", "n = int(input())\r\nn_t = 0\r\n\r\nwhile n > 3:\r\n n -= 2\r\n n_t += 1\r\n\r\nif n == 3:\r\n print(str(n_t + 1) + \"\\n3\", end = \" \")\r\n for _ in range(n_t):\r\n print(\"2\", end = \" \")\r\nelse:\r\n print(n_t + 1)\r\n for _ in range(n_t + 1):\r\n print(\"2\", end = \" \")\r\n", "a = int(input())\r\n\r\nif a % 2 == 0:\r\n print(a//2)\r\nelse:\r\n a = a-3\r\n print(a//2+1)\r\n print(\"3\", end=\" \")\r\nfor i in range(a//2):\r\n print(\"2\", end=\" \")", "n = int(input())\r\nprint(n//2)\r\nif n%2: \r\n print((n-2)//2*\"2 \",end=\"\")\r\n print(\"3\",end=\"\")\r\nelse: \r\n print((n-2)//2*\"2 \",end=\"\")\r\n print(\"2\",end=\"\")", "ratony=int(input())\r\nif ratony%2==0:\r\n print(ratony//2)\r\n print((ratony//2)*\"2 \")\r\nelif ratony%2!=0:\r\n print(((ratony-3)//2)+1)\r\n print((ratony-3)//2*\"2 \",end = \"\")\r\n print(3)", "n = int(input())\r\nif n%2 == 0:\r\n a = int(n/2)\r\n print (a)\r\n print((a-1)*\"2 \"+\"2\")\r\nelse:\r\n n = n - 3\r\n a = int(n/2)\r\n print(a+1)\r\n print(a*\"2 \"+\"3\")", "n = int(input())\r\nif (n%2 == 0):\r\n print(n//2)\r\n print(*[2 for i in range(n//2)])\r\nelse:\r\n k = (n - 3)//2\r\n print(k+1)\r\n print(*[2 for i in range(k)], end = \" \")\r\n print(3)# 1688335471.126259", "n = int(input())\r\nc = 0\r\nres = []\r\nif n & 1:\r\n n -= 3\r\n c += 1\r\n res.append(3)\r\n if n != 0:\r\n c += n // 2\r\n for i in range(1, c):\r\n res.append(2)\r\n print(c)\r\n print(*res)\r\nelse:\r\n c = n // 2\r\n for i in range(c):\r\n res.append(2)\r\n print(c)\r\n print(*res)\r\n", "n=int(input())\nif n%2==0:\n x=n//2\n print(x)\n print('2'+' 2'*(x-1))\nelse:\n x=(n//2)\n print(x)\n print(('2 '*(x-1))+'3')\n\t\t\t\t \t\t\t \t\t\t\t \t\t \t \t \t\t\t \t", "n=int(input())\r\nif n%2==0:\r\n print(int(n/2))\r\n print('2 '*(int(n/2)))\r\nelse:\r\n p=(n//2)-1\r\n print(p+1)\r\n print('2 '*p + '3')", "def main():\n\tn = int(input())\n\t#if even then only part of 2 \n\t# else if subtract one \n\tif(n%2==1):\n\t\tn=n//2\n\t\tn=n-1\n\t\tprint(n+1)\n\t\tprint(3,end=' ')\n\telse:\n\t\tn=n//2\n\t\tprint(n)\n\n\tfor i in range(0,n):\n\t\tprint(2,end=' ')\n\n\n\nif __name__ == '__main__':\n\tmain()", "n= int(input())\r\nprint(n//2)\r\nprint(*([2]*(n//2) if n%2==0 else [2]*(n//2-1)+[3]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n N:int = int(input())\r\n\r\n primes:list[int] = []\r\n if N%2 == 0 : primes = [2]*(N//2)\r\n else : primes = [3] + [2]*((N-3)//2)\r\n \r\n print(len(primes))\r\n print(\" \".join(map(str, primes)))\r\n\r\nmain()", "n=int(input())\na=[]\nif n%2==0:\n for i in range(n//2):\n a.append(2)\nelse:\n for i in range((n//2)-1):\n a.append(2)\n a.append(3)\nprint(len(a))\nprint(*a)\n \t\t\t\t \t\t \t\t\t \t\t\t\t \t \t", "n = int(input())\r\n\r\nprint(n//2, \"\\n\", \"2 \"*(n//2-1), 2 + n%2)", "##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## s = 0\r\n## q = a[::2]\r\n## w = a[1::2]\r\n## r = 0\r\n## for u in q:\r\n## if u % 2 != 0:\r\n## s += 1\r\n## for p in w:\r\n## if p % 2 == 0:\r\n## r += 1\r\n## if r == s:\r\n## print(s)\r\n## else:\r\n## print(-1)\r\n## \r\n## \r\n## \r\n\r\n\r\nn = int(input())\r\nif n % 2 == 0:\r\n k = n // 2\r\n print(k)\r\n print('2 ' * k, sep = ' ')\r\nelse:\r\n k = n // 2\r\n print(k)\r\n print('2 ' * (k - 1), '3') \r\n\r\n", "k = int(input())\r\nprint(k//2)\r\nq = []\r\nwhile k > 1:\r\n k-=2\r\n if k == 1:\r\n q.append(3)\r\n else:\r\n q.append(2)\r\nprint(*q)\r\n", "# l=list(map(int, input().split()))\r\n# l=input().split()\r\n# n,m=int(l[0]),int(l[1])\r\n\r\nn=int(input())\r\nprint(n//2)\r\nif n%2==0:\r\n for i in range(n//2):\r\n print(2, end=\" \")\r\n print(\"\")\r\nelse:\r\n for i in range(n//2-1):\r\n print(2, end=\" \")\r\n print(\"3\")\r\n\r\n ", "n=int(input())\r\nif n%2==1:\r\n n//=2\r\n n-=1\r\n print(n+1,3,' ')\r\nelse:\r\n n//=2\r\n print(n)\r\nfor i in range(0,n):\r\n print(2)", "t=int(input())\r\nif t%2==0:\r\n x=t//2\r\n print(x)\r\n print(\"2 \"*(x-1),end=\"\")\r\n print(\"2\")\r\nelse:\r\n x=(t-3)//2\r\n print(t//2)\r\n print(\"2 \"*x,end=\"\")\r\n print(\"3\")", "t=int(input())\nprint(t//2)\n\nfor i in range(t//2-1):\n print(2,end=' ')\n \nif(t%2==0):\n print(2)\nif(t%2==1):\n print(3)\n \t \t \t\t\t\t \t \t \t \t \t", "# -*- coding: utf-8 -*-\n\"\"\"Bachgold Problem.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/11t3MzLFn255z2f89WI9hk7LthPkUqWVl\n\"\"\"\n\nn = int(input())\n\nif 2<=n<=10**5:\n\n if n%2==0:\n\n a = [2 for i in range(n//2)]\n print(len(a))\n print(*a)\n\n else:\n\n a = [2 for i in range((n-3)//2)]\n a.append(3)\n print(len(a))\n print(*a)", "n=int(input())\r\nprint(n//2);\r\nif (n%2==0):\r\n for i in range(0,n//2-1):\r\n print(\"2\",end=\" \")\r\n print(\"2\")\r\nelif(n%2==1):\r\n for i in range(0,n//2-1):\r\n print(\"2\",end=\" \")\r\n print(\"3 \")", "n=int(input())\r\nprint(n//2,\"\\n\",\"2 \"*(n//2-1),2+(n&1))", "n=int(input())\r\nif n==2 or n==3:\r\n print(1)\r\n print(n)\r\nelif n>3:\r\n if n%2==0:\r\n print(n//2)\r\n print(f'{2} '*(n//2))\r\n else:\r\n print((n-3)//2+1)\r\n print(f'{2} '*((n-3)//2)+f'{3}')", "def solve():\r\n x = int(input())\r\n ans = x // 2\r\n print(ans)\r\n for i in range(ans-1):\r\n print(2, end=' ')\r\n print(2+(x % 2))\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "t = int(input())\r\nif t%2==0:\r\n s = list(\"2\"*(t//2))\r\nelse:\r\n s = list(\"2\"*((t//2)-1))\r\n s.append(\"3\")\r\nc = ''\r\nfor i in s:\r\n c=c+i+' '\r\nprint(len(s))\r\nprint(c)", "a = int(input())\r\n\r\nres = \"\"\r\n\r\nif a % 2 == 0:\r\n for _ in range(a//2):\r\n res += \"2 \"\r\n\r\n print(int(a/2))\r\n print(res)\r\n\r\nelif a % 2 != 0:\r\n\r\n r = a % 2\r\n\r\n for _ in range(2,a-2,2):\r\n res += \"2 \"\r\n \r\n res += \"3 \"\r\n print(len(res.split()))\r\n print(res)\r\n", "n = int(input())\r\nres = []\r\nif n%2 == 1:\r\n res.append(3)\r\n n -= 3\r\nwhile n>0:\r\n res.append(2)\r\n n -= 2\r\nres.sort()\r\nprint(len(res))\r\nprint(*res)", "def helper():\r\n n=int(input())\r\n if n%2!=0:\r\n temp=(n//2)-1\r\n print(temp+1)\r\n ans=([2]*temp)+[3]\r\n print(*ans)\r\n else:\r\n temp=n//2\r\n print(temp)\r\n ans=[2]*temp\r\n print(*ans)\r\nhelper()\r\n", "n=int(input())\r\nif n%2==1:\r\n print(n//2)\r\n print(*([2]*(n//2-1)),3)\r\nelse:\r\n print(n//2)\r\n print(*([2]*(n//2)))", "g=int(input())\r\nif g % 2 == 1:\r\n l=(g-3)//2\r\n c=\"3\"\r\n c+=\"2\"*l\r\nelse:\r\n l=g//2\r\n c=\"2\"*l\r\nprint(len(c))\r\nprint(\" \".join(c))", "n=int(input())\nprint(n//2)\nwhile(n>3):\n print('2',end=\" \")\n n=n-2\nprint(n)\n \t \t \t \t \t \t\t", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n = int(input())\r\n ct_2s = n // 2 if n % 2 == 0 else n // 2 - 1\r\n ct_3s = 1 if n % 2 == 1 else 0\r\n\r\n print(ct_2s + ct_3s)\r\n print(*([2] * ct_2s + [3] * ct_3s))\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\r\nif (not a%2):\r\n print(a//2)\r\n print('2 '*(a//2))\r\nelse:\r\n print(a//2)\r\n print('2 '*((a//2)-1)+'3')", "if __name__ == '__main__':\r\n n = int(input())\r\n if n % 2 == 0:\r\n print(int(n / 2))\r\n print(\"2 \" * (int(n / 2)))\r\n\r\n else:\r\n print(int(n / 2))\r\n print(\"2 \" * (int(n / 2) - 1), \"3\", sep='')", "def solve_bachgold(n):\r\n primes = []\r\n\r\n # If n is even, add n/2 twos to the list of primes\r\n if n % 2 == 0:\r\n primes.extend([2] * (n // 2))\r\n else:\r\n # If n is odd, add (n-1)/2 twos and a single three to the list of primes\r\n primes.extend([2] * (((n - 1) // 2)-1))\r\n primes.append(3)\r\n\r\n return primes\r\n\r\n\r\n# Read the input number\r\nn = int(input())\r\n\r\n# Solve the Bachgold problem\r\nresult = solve_bachgold(n)\r\n\r\n# Print the output\r\nprint(len(result))\r\nprint(*result)\r\n", "a = int(input())\r\nb = 2\r\nc = a//b\r\nt = []\r\nif a%b == 0:\r\n while c > 0:\r\n c -= 1\r\n t.append(2)\r\nelse:\r\n while c > 1:\r\n t.append(2)\r\n c -= 1\r\n t.append(3)\r\nprint(len(t))\r\nprint(*t)", "a = int(input())\r\nif a % 2 == 0:\r\n print(int(a / 2))\r\n for i in range(int(a / 2) - 1):\r\n print(2,end=' ')\r\n print(2)\r\nelse:\r\n print(int(a / 2))\r\n for j in range(int(a / 2) - 1):\r\n print(2,end=' ')\r\n print(3)\r\n \t\t\t\t\t \t \t \t\t\t\t\t\t \t\t \t\t\t \t", "def is_prime(n):\n for i in range(2,int(n**0.5)+1):\n if n%i==0:\n return False\n else:\n return True\nn=int(input())\nif n%2==0:\n print(n//2)\n for i in range(n//2):\n print(2,end=' ')\n print()\nelse:\n print(n//2)\n for i in range(n//2-1):\n print(2,end=\" \")\n print(3)", "n=int(input())\r\nif n%2==0:\r\n print(n//2)\r\n print(*([2]*(n//2)))\r\nelse:\r\n x=[2]*((n//2)-1)\r\n x+=[3]\r\n print(len(x))\r\n print(*x)", "n = int(input())\ndef isOdd(n):\n output2=\"2 \"*(n//2)\n return n//2, output2[:-1]\nif n % 2 == 0:\n o1, o2 = isOdd(n)\n print(o1)\n print(o2)\nelse:\n n -= 3\n o1, o2 = isOdd(n)\n print(o1+1)\n if len(o2) == 0:\n print(3)\n else:\n print(f\"{o2} 3\")\n\t\t \t\t\t\t \t \t \t \t\t \t \t \t \t", "from math import *\r\ndef prime(x):\r\n for i in range(2,floor(sqrt(x))+1):\r\n if x%i==0:\r\n return(False)\r\n return True\r\nn=int(input())\r\nif n%2==0:\r\n k=n//2\r\n print(k)\r\n print(\" \".join([str(2) for _ in range(k)]))\r\nelse:\r\n k=n//2\r\n print(k)\r\n print(\" \".join([str(2) for _ in range(k-1)]+[str(3)]))\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\nprint(n // 2)\nfor i in range((n // 2) - (n % 2)):\n print(2, end=\" \")\nif n % 2 == 1:\n print(3, end=\" \")\n", "t = int(input())\r\nif t % 2 == 0:\r\n print(t//2)\r\n for i in range(t//2): print(2, end=' ')\r\nelse:\r\n print(t//2)\r\n for j in range(t//2-1): print(2, end=' ')\r\n print(3)", "n=int(input())\r\n\r\n\r\nif(n%2==0):\r\n r=n//2\r\n print(r)\r\n for i in range(r):\r\n print(2,end=\" \")\r\n\r\nelse:\r\n r=(n-3)//2\r\n print(r+1)\r\n for i in range(r):\r\n print(2,end=\" \")\r\n \r\n print(3)", "n=int(input())\r\nif n%2==0:\r\n print(int(n/2))\r\n for i in range(0,n,2):\r\n print(2,end=\" \")\r\nelse:\r\n print(int(n/2))\r\n\r\n print(\"2 \"*(int((n/2))-1),end=\"3\")", "n = int(input())\r\nli = []\r\nk = 0\r\nif n % 2 == 0:\r\n k = n//2\r\n for i in range(k):\r\n li.append(2)\r\n\r\nelse:\r\n k = ((n-3)//2)+1\r\n for i in range((n-3)//2):\r\n li.append(2)\r\n li.append(3)\r\nprint(k)\r\nprint(*li)\r\n", "n=int(input())\r\nc=0\r\nif(n%2==0):\r\n print(n//2,end=\"\\n\")\r\n for i in range(int(n/2)-1):\r\n print(2, end=\" \")\r\n print(2, end=\"\\n\")\r\nelse:\r\n res=n-3\r\n print((res // 2)+1, end=\"\\n\")\r\n for i in range(int(n/2)-1):\r\n print(2, end=\" \")\r\n print(3, end=\"\\n\")\r\n\r\n", "p=int(input())\nprint(p//2)\nif p%2==0:\n for t in range(p//2):\n print(2,end=\" \")\nelse:\n for t in range((p//2)-1):\n print(2,end=\" \")\n print(3)\n\t \t \t \t \t \t \t\t \t\t\t\t \t \t", "n = int(input())\r\nl = []\r\nif n%2 == 0:\r\n for i in range(n//2):\r\n l.append(2)\r\nelif n%2 != 0:\r\n for i in range((n-3)//2):\r\n l.append(2)\r\n l.append(3)\r\n\r\nprint(len(l))\r\nfor i in l:\r\n print(i)", "t = int(input())\r\nprint(t // 2)\r\nif t % 2 == 0:\r\n s = list('2' * (t // 2))\r\nelse:\r\n s = list('2' * (t // 2 - 1) + '3')\r\nprint(*s)\r\n", "n=int(input())\r\nl=[]\r\nif n%2==1:\r\n n=n-3\r\n l.append(3)\r\nwhile n>0:\r\n l.append(2)\r\n n=n-2\r\nprint(len(l))\r\nfor i in range(len(l)):\r\n print(l[i],end=' ')", "n=int(input())\r\nk=n//2-1\r\nn&=1\r\nprint(k+1,'\\n',' 2'*k,2+n)", "A=int(input())\nif A%2!=0:\n print(A//2)\n print('2 '*(A//2-1)+'3')\nelse:\n print(A//2)\n print('2 '*(A//2))\n\t\t\t\t\t \t \t \t \t \t\t\t\t\t \t \t\t", "n=int(input())\r\nif n%2==0:\r\n r=n//2\r\n print(r)\r\n print(('2 ')*r)\r\nelse:\r\n r=n//2\r\n s=r-1\r\n print(r)\r\n print(('2 ')*s,end=\"\")\r\n print('3')", "\r\ndef main():\r\n t = int(input())\r\n print(int(t/2))\r\n if (t%2==0):\r\n for i in range(0,int(t/2)):\r\n print(2, end=\" \")\r\n else:\r\n for i in range(0, int(t/2)-1):\r\n print(2, end= \" \")\r\n print(3)\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nprint(n//2)\r\nprint('2 '*(n//2 - 1), end='')\r\nprint(str((n % 2)+2))", "n=int(input())\r\nif n%2==0:\r\n c=n//2\r\n print(c)\r\n lst=['2' for i in range(c)]\r\nelse:\r\n c=n//2\r\n print(c)\r\n lst=['2' for i in range(c-1)]\r\n lst.append('3')\r\nprint(' '.join(lst))", "n = int(input())\r\n\r\ncount = int(n/2)\r\nif n % 2 == 0:\r\n print(count)\r\n arr = count * [2]\r\n print(*arr, sep=\" \")\r\nelse:\r\n print(count)\r\n arr = (count - 1) * [2] + [3]\r\n print(*arr, sep=\" \")\r\n\r\n", "a = int(input())\r\nprint(a // 2)\r\nif a % 2 == 0:\r\n print(' '.join('2' * (a//2)))\r\nelse:\r\n print(' '.join('2' * (a//2 - 1) + '3'))", "n = int(input())\r\nk = 0\r\nans = []\r\nif n % 2 == 0:\r\n\tk = n // 2\r\n\tans = [2] * k\r\nelif n == 3:\r\n\tk = 1\r\n\tans = [3]\r\nelse:\r\n\tk = (n-3)//2+1\r\n\tans = [2] * (k-1)\r\n\tans.append(3)\r\nprint(k)\r\nprint(*ans)", "from sys import stdout\n\nwr = stdout.write\nn, v = int(input()), 0\n\nif n & 1:\n\tn, v = n - 3, 1\n\nwr(f'{(n >> 1) + v}\\n')\nif v == 1:\n\twr('3 ')\nfor _ in range(n >> 1):\n\twr('2 ')\nwr('\\n')\n", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n ans = n // 2\r\n res = [2] * ans\r\nelse:\r\n n -= 3\r\n ans = n // 2\r\n res = [2] * ans + [3]\r\n ans += 1\r\n\r\nprint(ans)\r\nprint(*res)", "def process():\r\n n = int(input())\r\n num_2 = n // 2\r\n print(num_2)\r\n if n % 2 == 0:\r\n for i in range(num_2):\r\n print(\"2\", end=' ')\r\n else:\r\n for i in range(num_2 - 1):\r\n print(\"2\", end=' ')\r\n print(\"3\")\r\n return\r\n\r\n\r\ndef resolve():\r\n testCase = 1\r\n for i in range(testCase):\r\n process()\r\n\r\n\r\nif __name__ == '__main__':\r\n resolve()\r\n", "def sol(n):\r\n if n%2==1:\r\n n//=2\r\n n-=1\r\n print(n+1)\r\n print(3,end=\" \")\r\n else:\r\n n//=2\r\n print(n)\r\n for i in range(n):\r\n print(2,end=\" \")\r\nn=int(input())\r\nsol(n)\r\n", "x = int(input())\r\nc = 0\r\nif x % 2 == 0:\r\n c = x // 2\r\n print(c)\r\n print(\"2 \" * c)\r\nelse:\r\n c = x // 2\r\n print(c)\r\n print(\"2 \" * (c - 1), 3, sep=\"\")\r\n", "n = int(input()) \r\n\r\nif n % 2 == 0:\r\n k = n // 2\r\n primes = [2] * k\r\nelse:\r\n k = (n - 3) // 2 + 1\r\n primes = [2] * (k - 1)\r\n primes.append(3)\r\n\r\nprint(k)\r\nprint(\" \".join(map(str, primes)))\r\n", "n = int(input())\r\nk = 0\r\n\r\nif (n % 2 == 0):\r\n k = n//2\r\n sum = str(2)*k\r\n print(k)\r\n print(*sum, sep=' ')\r\nelse:\r\n x = n//2\r\n k = x\r\n sum = str(2)*(x-1)\r\n print(k)\r\n print(*sum, sep=' ', end=' ')\r\n print('3', end=' ')", "t=int(input())\nif t%2==0:\n print(t//2)\n for i in range(0,t//2):\n print(\"2\",end=\" \")\nelse:\n print(t//2)\n for i in range(1,(t//2)):\n print(\"2\",end=\" \")\n print(3)\n\t\t \t\t \t \t \t \t\t\t\t \t \t\t \t", "n=int(input())\r\na=[]\r\nwhile(n>0):\r\n if n==3:\r\n n=n-3\r\n a.append(3)\r\n elif n>=2:\r\n n=n-2\r\n a.append(2)\r\nprint(len(a))\r\nfor i in range(len(a)):\r\n print(a[i],end=\" \")", "n = int(input())\r\nif(n%2==0):\r\n print(int(n/2))\r\n print(str(str(2)+\" \")*(int(n/2)-1)+str(2))\r\nelse:\r\n print(int((n-3)/2+1))\r\n print(str(str(2)+\" \")*int((n-3)/2)+\" \"+str(3))", "\r\nn = int(input())\r\nns = []\r\ng = 0\r\nwhile n != 0:\r\n if n % 2 == 0:\r\n ns.append(\"2\")\r\n n -= 2\r\n g += 1\r\n else:\r\n ns.append(\"3\")\r\n n -= 3\r\n g += 1\r\nprint(g)\r\nprint(\" \".join(sorted(ns)))", "a = int(input())\r\nif a % 2 == 0:\r\n print(a // 2)\r\n s = []\r\n for i in range(a // 2):\r\n s.append(2)\r\n print(*s)\r\nelse:\r\n print((a - 3) // 2 + 1)\r\n s = []\r\n for i in range((a - 3) // 2):\r\n s.append(2)\r\n s.append(3)\r\n print(*s)\r\n", "a = int(input())\r\nb = ''\r\nif a % 2 == 1:\r\n for i in range((a-3)//2):\r\n b += '2 '\r\n b += '3'\r\nelse:\r\n for i in range(a//2):\r\n b += '2 '\r\nc = b.split()\r\nprint(len(c))\r\nprint(b)", "# -*- coding: utf-8 -*-\r\na=int(input())\r\nif a%2==0:\r\n x=int(a/2)\r\n print(x)\r\n for i in range(x):\r\n print(2,end=\" \")\r\nelse:\r\n x=int(a/2)\r\n print(x)\r\n for i in range(x-1):\r\n print(2,end=\" \")\r\n print(3)", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n print(int(n/2))\r\n num = int(n/2)\r\n for i in range(num):\r\n print(2, end=\" \")\r\nelse:\r\n num = int((n-3)/2)\r\n print(1+num)\r\n print(3, end=\" \")\r\n for i in range(num):\r\n print(2, end=\" \")", "n = int(input())\r\n \r\nif n % 2 == 0:\r\n k = n // 2\r\n mas = ['2'] * k\r\n \r\nelse:\r\n k = n // 2 - 1\r\n mas = ['2'] * k\r\n mas.append('3')\r\n k += 1\r\n \r\nprint(k)\r\nprint(' '.join(mas))", "n = int(input())\r\nrez = []\r\nk = 1\r\nwhile n / 2 >= 2:\r\n rez.append('2')\r\n n -= 2\r\n k += 1\r\nrez.append(str(n))\r\nprint(k)\r\nprint(\" \".join(rez))", "n=int(input())\nif n%2==0:\n a=['2']*(n//2)\n print(n//2)\n print(\" \".join(a))\nelse:\n k=(n-3)//2\n print(k+1)\n print(\"2 \"*k+\"3\")\n", "n = int(input())\n\nk = int(n/2)\nif n % 2 == 0:\n a = [2]*k\nelse:\n a = [2]*(k-1)\n a.append(3)\n\nprint(k)\nprint(*a)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 8 15:57:21 2022\r\n\r\n@author: dehon\r\n\"\"\"\r\n\r\nn = int(input())\r\nx = (n//2) - 1*n%2\r\ny = n%2\r\nprint(x+y)\r\nprint(x*'2 '+y*'3 ')", "a, q = int(input()), []\r\nwhile a != 0:\r\n if a - 2 == 1:\r\n q.append(3)\r\n a -= 3\r\n else:\r\n q.append(2)\r\n a -= 2\r\nprint (len(q))\r\nprint (*q)", "n = int(input())\r\n\r\n\r\n\r\nif n % 2 == 0:\r\n k=n//2\r\n print(k)\r\n print(\"2 \" * k)\r\nelse:\r\n k=n//2\r\n print(k)\r\n print(\"2 \" * (k - 1) + \"3\")\r\n", "n = int(input())\nif(n%2 == 0):\n print(n//2)\n for i in range(1,(n//2) + 1):\n print(2 , end = \" \")\n print()\nelse:\n print(n//2)\n for i in range(1,n//2):\n print(2 , end = \" \")\n print(3)\n \n \t \t \t \t \t\t \t\t \t \t\t", "num1 = int(input())\r\nprint(num1//2)\r\nif num1%2==0:\r\n for i in range(num1//2):\r\n print(2, end=\" \")\r\nelse:\r\n for i in range((num1//2)-1):\r\n print(2, end=\" \")\r\n print(3)", "n = int(input())\r\nprime = []\r\nif n % 2 == 1:\r\n prime.append(3)\r\n n -= 3\r\nfor _ in range(n, 0, -2):\r\n prime.append(2)\r\n\r\nprint(len(prime))\r\nfor i in range(len(prime)):\r\n print(prime[i], end =\" \") \r\n", "n = int(input())\r\nif n % 2 == 0:\r\n k = int(n/2)\r\n print(k)\r\n i = 1\r\n while i <= k:\r\n print(2,end=' ')\r\n i += 1\r\nelse:\r\n k = int((n-1)/2)\r\n print(k)\r\n i = 1\r\n while i <= k-1:\r\n print(2,end=' ')\r\n i += 1\r\n print(3)", "num = int(input()) \r\nif num % 2 == 0 :\r\n count = num // 2 \r\n print(count)\r\n for i in range(count) : print(2 , end=\" \")\r\nelse :\r\n count = num // 2 \r\n print(count)\r\n for i in range(count - 1) : print(2 , end=\" \")\r\n print(3)", "n=int(input())\r\nif n%2!=0:\r\n print((n-3)//2+1)\r\n print(3,end=\" \")\r\n n-=3\r\nelse:\r\n print(n//2)\r\nprint(\"2 \"*(n//2))", "n=int(input())\r\nif n%2==0:\r\n m=n//2\r\n print(m)\r\n arr=[2 for i in range(m)]\r\n print(*arr)\r\nelse:\r\n m=n//2\r\n print(m)\r\n arr=[2 for i in range(m-1)]\r\n arr.append(3)\r\n print(*arr)", "a = int(input())\r\nl = []\r\nif a % 2 == 0:\r\n print( a // 2 )\r\n print( (a // 2) * \"2 \" )\r\nelse:\r\n print( a // 2 )\r\n print( ((a // 2 ) - 1) * '2 ' , '3' , sep='')", "a=int(input())\r\nif a%2==0:\r\n print(a//2)\r\n print(*[2]*(a//2))\r\nelif a==2:\r\n print(2)\r\nelse:\r\n print((a-3)//2+1)\r\n print(3,*[2]*((a-3)//2))", "n = int(input())\nl = '2'* ((n - 3)//2) + '3' if n % 2 else '2' * (n//2)\nprint(len(l))\nprint(*l)\n", "n=int(input())\r\nc=0\r\nc+=(n//2)\r\nl=[]\r\nfor i in range((n//2)):\r\n l.append(2)\r\nn=n%2\r\nif n==1:\r\n l.pop(-1)\r\n l.append(3)\r\nprint(c)\r\nprint(' '.join(list(map(str,l))))", "# URL: https://codeforces.com/problemset/problem/749/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())\nk = 0\nif n % 2 == 1:\n k = (n - 3) // 2\n out(f\"{k + 1}\\n3 \" + \"2 \" * k)\nelse:\n k = n // 2\n out(f\"{k}\\n\" + \"2 \" * k)\n", "# Ahmed Abdelrazik\r\nn= int(input())\r\n\r\nprint(n//2)\r\nprint(\"2 \"*(n//2 -1)+\"2\" if n%2 ==0 else \"2 \"*(n//2 -1) +\"3\" )", "n=int(input())\r\nif(n%2==0):\r\n print(n//2)\r\n for i in range (n//2):\r\n print(\"2\",end=\" \")\r\nelif(n%2!=0):\r\n print(n//2)\r\n for i in range (n//2 - 1):\r\n print(\"2\",end=\" \")\r\n print(n-(n//2 - 1)*2)", "a = int(input())\r\nif a%2 == 0:\r\n print(a//2)\r\n print(*([2]*(a//2)))\r\nelse:\r\n print(a//2)\r\n print(*([2]*(a//2 - 1)), 3)", "from typing import Counter\r\n\r\n\r\nn = int(input())\r\nif n-2*(n//2)<3 and n-2*(n//2)>0:\r\n ns = n//2-1\r\n print(ns+1)\r\nelse:\r\n ns = n//2\r\n print(ns)\r\nfor i in range(ns):\r\n print('2', end=' ')\r\nif n%2==1:\r\n print('3')", "def solve(n):\r\n if(n == 3):\r\n print(1)\r\n print(3)\r\n return\r\n elif(n%2 == 0):\r\n print(int(n/2))\r\n for i in range(int(n/2)):\r\n print(2, end = \" \")\r\n return\r\n else:\r\n print(int(n//2))\r\n for i in range(int(n//2) - 1):\r\n print(2, end = \" \")\r\n print(3)\r\n return\r\n return\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\n(solve(n))", "n=int(input())\r\nnum=0\r\nx=0\r\nif n%2==0:\r\n print(n//2)\r\n while (x!=n//2):\r\n print(2,end=\" \")\r\n x+=1\r\nelse:\r\n print((n//2))\r\n while (x!=(n//2)-1):\r\n print(2,end=\" \")\r\n x+=1\r\n print(3) ", "#여기서 prime 넘버는 소수(옛날 솟수)를 의미하는것이다.\r\n#그런데 최대 개수의 솟수로 채우라고 했으니 최대한 2를 많이 넣고 나머지는 3으로 채우는것이 방법이다.\r\nx=int(input())\r\nprint(x//2)\r\n\r\nif x%2==0:\r\n print('2 '*int(x//2))\r\n\r\nelse:\r\n print('2 '*(x//2-1),end='')\r\n print(3)\r\n", "n = int(input())\nm = n//2\na = [2]*m\nif n%2==1:\n a[-1]=3\nprint(m)\nprint(' '.join(map(str,a)))", "n=int(input())\r\nprint(int(n/2))\r\nfor i in range(int(n/2-1)):\r\n print(2,end=\" \")\r\nprint(int(2+n%2))", "num=int(input())\nprint(num//2)\nif num%2==0:\n print('2 ' * (num//2))\nelse:\n print('3','2 ' * ((num-3)//2), end = ' ')\n \t\t \t\t \t \t\t \t\t\t \t\t\t \t \t\t \t", "n = int(input())\r\nnc, r = n//2, 0\r\nif n%2==1:\r\n nc-=1\r\n r+=1\r\nl = [2]*nc\r\nif r == 1:\r\n l.append(r*3)\r\nprint(len(l))\r\nprint(*l)", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn = int(inpu())\r\nif n & 1 == 0:\r\n prin(str(n//2) + '\\n' + '2 '*(n//2) + '\\n')\r\nelse :\r\n n -= 3\r\n prin(str(n//2 + 1) + '\\n' + '2 '*(n//2) + '3\\n')", "n = int(input())\nk = n // 2\ns = [2] * (k - 1)\nif n % 2 == 1:\n\ts.append(3)\nelse:\n\ts.append(2)\nprint(k)\nprint(' '.join([str(si) for si in s]))\n", "\r\nnum=int(input())\r\nprint(num//2)\r\nif num%2==0:\r\n for i in range((num//2)-1):\r\n print(\"2\",end=\" \")\r\n print(\"2\\n\")\r\n \r\nif(num%2==1):\r\n for i in range((num//2)-1):\r\n print(\"2\",end=\" \")\r\n print(\"3\\n\")\r\n \r\n", "n = int(input())\r\nk = n // 2\r\nprint(k)\r\nif n % 2:\r\n print('2 '*(k-1)+'3')\r\nelse:\r\n print('2 '*k)", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(n):\r\n answer = []\r\n if n % 2==1:\r\n answer.append(3)\r\n n-=3\r\n while n > 0:\r\n answer.append(2)\r\n n-=2\r\n return answer\r\n\r\nn = int(input())\r\nanswer = process(n)\r\nprint(len(answer))\r\nsys.stdout.write(' '.join(map(str, answer))+'\\n')", "def main() -> None:\r\n n = int(input())\r\n print(n // 2)\r\n while n:\r\n if n > 3 or n == 2:\r\n print(2, end=' ')\r\n n -= 2\r\n else:\r\n print(3)\r\n n -= 3\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n l = []\r\n for i in range(n // 2):\r\n l.append(2)\r\n print(n // 2)\r\n print(' '.join(str(m) for m in l))\r\nelse:\r\n l = []\r\n for i in range(n // 2 - 1):\r\n l.append(2)\r\n l.append(3)\r\n print(n // 2)\r\n print(' '.join(str(m) for m in l))", "n = int(input())\r\n\r\nvls = [2 for _ in range(n // 2)]\r\nif n % 2 != 0:\r\n vls[0] = 3\r\n\r\nvls_str = [str(x) for x in vls]\r\nprint(len(vls))\r\nprint(' '.join(vls_str));", "a=int(input())\r\nif a%2==0:\r\n print(a//2)\r\n emp=['2' for i in range(a//2)]\r\n print(' '.join(emp))\r\nelse:\r\n print((a-2)//2+1)\r\n emp=['2' for i in range((a-2)//2)]\r\n emp.append('3')\r\n print(' '.join(emp))\r\n", "a = int(input())\r\nb = []\r\nwhile a!=0:\r\n if a%2==0:\r\n b += [2]\r\n a -= 2\r\n elif a%2!=0:\r\n b += [3]\r\n a-= 3\r\nc = ''\r\nfor i in b:\r\n c += str(i)+\" \"\r\nprint(int(len(c)/2))\r\nprint(c)", "n=int(input())\r\na=[]\r\nif n%2!=0:\r\n print(n//2)\r\n a=[2]*((n-3)//2)\r\n print(*a,3)\r\nelse:\r\n a=[2]*(n//2)\r\n print(n//2)\r\n print(*a)\r\n", "n=int(input())\r\ntwos=0\r\nbull=True\r\nif n%2==0:\r\n print(n//2)\r\n twos=n//2\r\nelse:\r\n print(n//2)\r\n twos=(n//2)-1\r\n bull=False\r\n\r\nfor i in range(twos):\r\n print(2,end=\" \")\r\n\r\nif bull==False:\r\n print(3)", "def solve():\r\n n = int(input())\r\n if n%2 == 0: \r\n print(n//2)\r\n for _ in range(n//2):\r\n print(2, end = \" \")\r\n print()\r\n \r\n elif n == 3:\r\n print(1)\r\n print(3)\r\n \r\n else: \r\n print(n//2)\r\n for _ in range(n//2 - 1):\r\n print(2, end = ' ')\r\n print(3)\r\n \r\n\r\nif __name__ == '__main__':\r\n solve()", "a=int(input())\r\nc=''\r\nb=1\r\nif (a%2==0):\r\n print(a//2)\r\n while b <= a//2:\r\n b=b+1\r\n c=c+'2 '\r\n print(c)\r\nelse:\r\n print(a//2)\r\n while b <=(a-2)//2:\r\n b=b+1\r\n c=c+'2 '\r\n print(c+'3')", "n = int(input())\r\nif n % 2 == 0:\r\n m = n // 2 \r\n print(m)\r\n print(' '.join([\"2\"] * m))\r\nelse:\r\n rest = n - 3\r\n m = rest // 2\r\n print(1+m)\r\n print(' '.join([\"3\"] + [\"2\"] * m))", "num = int(input())\r\nif num%2==0:\r\n temp = num//2\r\n print(temp)\r\n print(*['2 '*temp])\r\nelse:\r\n temp = num//2\r\n print(temp)\r\n print(*['2 '*(temp-1)],end='')\r\n print('3')", "n = int(input())\nif n % 2:\n sp = ['2']*((n-2)//2) + ['3']\nelse:\n sp = ['2']*(n//2)\nprint(len(sp))\nprint(' '.join(sp))\n# Sat Nov 27 2021 13:03:51 GMT+0000 (Coordinated Universal Time)\n", "a=int(input())\r\nif a%2==0:\r\n print(a//2)\r\n print(str('2 ')*(a//2))\r\nelse:\r\n print(a//2)\r\n print(str('2 ')*(a//2-1)+'3')", "# number of prime numbers is in a number is the floor of divison by 2\r\nn = int(input())\r\nprint(n//2)\r\nprint(\"2 \"*(n//2-1), 2+n % 2)\r\n", "\nn = int(input())\nnumber = n//2\nprint(number)\nif(n%2==0):\n print(*(\"2\" for i in range(number)))\nelse:\n print(*(\"2\" for i in range(number-1)),3)", "a =int(input())\r\nif a%2 == 0:\r\n print(a//2)\r\n print(*[2 for _ in range(a//2)])\r\nelse:\r\n print((a-1)//2)\r\n print(3,*[2 for _ in range((a-3)//2)])", "n = int(input())\nif n % 2 == 0 :\n print(n // 2)\n print(*[2 for i in range(n // 2)])\nelse :\n print(n // 2)\n L = [2 for i in range (n // 2 - 1)]\n L.append(n - sum(L))\n print(*L)", "# https://codeforces.com/problemset/problem/749/A\r\n\r\nn = int(input())\r\n\r\nif n % 2 == 0:\r\n print(n // 2)\r\n print(' '.join(map(str, [2 for _ in range(n // 2)])))\r\nelse:\r\n print(n // 2)\r\n print(' '.join(map(str, [2 for _ in range(n // 2 - 1)] + [3])))", "n=int(input())\ns=2\nf=1\nkol=0\na=n\nfor i in range(s,n+1):\n k=n//i\n if n-k*i==1:\n k=n//i-1\n n=n-k*i\n kol+=k\nprint(kol)\nn=a\nkol=0\nf=1\ns=2\nfor l in range(s,n+1):\n k=n//l\n if n-k*l==1:\n k=n//l-1\n for u in range(1,k+1):\n print(l)\n n=n-k*l\n kol+=k\n \n \n \n# Thu Mar 09 2023 20:06:44 GMT+0300 (Moscow Standard Time)\n", "v=int(input()); print(v//2,\"\\n\",\"2 \"*(v//2-1),2+v%2)", "N=int(input())\nprint(N//2)\nif(N%2==0):\n for i in range(0,(N//2)-1):\n print(\"2\",end=\" \")\n print(\"2\")\nif(N%2==1):\n for j in range(0,(N//2)-1):\n print(\"2\",end=\" \")\n print(\"3\")\n \n \n \t\t\t \t\t \t \t\t\t \t \t \t\t\t\t\t \t", "n=int(input())\r\nval=n//2\r\nif n%2==1:\r\n print(val)\r\n for i in range(val-1):\r\n print(2,end=\" \")\r\n print(3)\r\nelse:\r\n print(val)\r\n for _ in range(val):\r\n print(2,end=\" \")\r\n ", "inp = lambda : int(input())\r\nspinp = lambda : list(map(int,input().split()))\r\nyes = lambda : print(\"YES\")\r\nno = lambda : print(\"NO\")\r\n\r\nn = inp()\r\nprint(n//2)\r\nif n % 2 == 0 : \r\n print('2 '*((n-2)//2)+'2')\r\nelse : \r\n print('2 '*(n//2-1) +'3')", "def bachgold_solution(n):\r\n s = \"2 \"\r\n if n %2 == 0:\r\n m = n//2\r\n s = s*m\r\n print(m)\r\n print(s.strip())\r\n else:\r\n m = n//2-1\r\n s = s*m\r\n print(m+1)\r\n print(s.strip(),\"3\")\r\nn = int(input())\r\nbachgold_solution(n)", "n=int(input())\r\ns=n//2\r\nif not(n&1):\r\n print(s)\r\n print('2 '*s)\r\nelse:\r\n print(s)\r\n s-=1\r\n print('2 '*s+'3')", "n=int(input())\r\nif n %2==0:\r\n print(n//2)\r\n print(2,end='')\r\n print(' 2'*(n//2-1))\r\nelse:\r\n print(n//2)\r\n print(3,end='')\r\n print(' 2'*(n//2-1))", "n=int(input())\nif n%2==0:\n\tprint(n//2)\n\tfor i in range(0,n//2):\n\t\tprint(2,end=' ')\nelse:\n\tprint(n//2)\n\tfor i in range(0,n//2-1):\n\t\tprint(2,end=' ')\n\tprint(3)\n\n\n\n\n\n\n\n\n\n \n", "n = int(input())\r\nif n%2==0:\r\n print(n//2)\r\n for i in range(n//2):\r\n print(2,end=\" \")\r\nelse:\r\n r = n-3\r\n print(r//2+1)\r\n for i in range(r//2):\r\n print(2,end=\" \")\r\n print(3)", "x = int(input(''))\r\nif x%2==0:\r\n y = x//2\r\n print(y)\r\n for i in range(1,y+1):\r\n print('2',end=\" \")\r\nif x%2!=0:\r\n y = (x//2)\r\n print(y)\r\n for i in range(1,y):\r\n print('2',end=\" \")\r\n print('3')", "n=int(input())\r\nprint(n//2)\r\nwhile n>3:\r\n\tprint(2,end=\" \")\r\n\tn=n-2\r\nprint(n)", "#loser707\r\nn=int(input())\r\nif n%2==0:\r\n p=n//2\r\n l=[2 for i in range(p)]\r\nelse:\r\n p=n//2-1\r\n l=[2 for i in range(p)]+[3]\r\nprint(len(l))\r\nprint(*l)\r\n \r\n", "n = int(input())\r\n#n = 6\r\nans = \"\"\r\n\r\nans = ((n - 2) // 2) * \"2 \"\r\n\r\nif n % 2:\r\n ans += \"3\"\r\nelse:\r\n ans += \"2\"\r\nprint(n//2)\r\nprint(ans)", "n = int(input())\r\narr = []\r\nif n<4: arr.append(n)\r\nelse:\r\n if n % 2 ==0:\r\n for i in range(n//2): arr.append(2)\r\n else:\r\n for i in range(n//2-1): arr.append(2)\r\n arr.append(3)\r\n\r\nprint(len(arr))\r\nfor i in range(len(arr)): print(arr[i], end= ' ')", "n=int(input())\r\nlst=[]\r\nx=n//2\r\n'''\r\nif(n % 2 !=0):\r\n lst.append(3)\r\n lst.extend([2] * (x-1))\r\n \r\nelse:\r\n lst.extend([2] * (x))\r\n \r\n''' \r\nlst.extend([3] + [2] * (x - 1)) if n % 2 != 0 else lst.extend([2] * x)\r\n\r\nprint(len(lst))\r\nprint(*lst)", "n= int(input())\r\n\r\nif n%2==0:\r\n print(int(n/2))\r\n print('2 '*int(n/2))\r\nelse:\r\n print(int(n/2))\r\n print('3',end=\" \")\r\n print('2 '*int((n/2)-1))", "n=int(input())\r\nk=0\r\nk=int(n/2)\r\nif k*2==n:\r\n print(k)\r\n a='2 '*(k)\r\n print(a)\r\nelse:\r\n print(k)\r\n a='2 '*(k-1)+'3'\r\n print(a)\r\n", "k=int(input())\nprint(k//2)\nif k%2==0:\n for h in range(k//2):\n print(2,end=\" \")\nelse:\n for h in range((k//2)-1):\n print(2,end=\" \")\n print(3)\n \t \t \t \t\t\t\t\t \t\t\t\t\t\t\t\t \t\t\t", "n=int(input())\r\nprint(str(n//2)+'\\n'+('2 ')*(int(n//2)) if n%2==0 else str(n//2)+'\\n'+('2 ')*(int((n-3)//2)) +'3')", "n = int(input())\r\na=[3]\r\nif n%2 == 0:\r\n print(int(n/2))\r\n for i in range(0,int(n/2)):\r\n print(2, end=\" \")\r\nelse:\r\n print(int(n/2))\r\n for i in range(0,int(n/2)-1):\r\n a.append(2)\r\n for i in range(0,len(a)):\r\n print(a[i],end=' ')", "n = int(input())\r\nif n % 2 == 0:\r\n a = n // 2\r\n print(a)\r\n for i in range(0,a):\r\n print(\"2\", end=\" \")\r\nelse:\r\n a = n // 2\r\n print(a)\r\n for i in range(0, a):\r\n if i == a - 1:\r\n print(\"3\", end=\" \")\r\n else:\r\n print(\"2\", end=\" \")\n# Tue Sep 12 2023 17:18:38 GMT+0300 (Moscow Standard Time)\n", "x = int(input())\r\nprint(x//2)\r\nif x%2 == 0:\r\n for i in range(x//2):\r\n print(\"2\", end=\" \")\r\nelse:\r\n for i in range(x//2-1):\r\n print(\"2\", end=\" \")\r\n print(\"3\")", "t=int(input())\r\nprint(t//2)\r\nS=\"\"\r\nfor i in range((t//2)-1):\r\n S+=\"2 \"\r\nif t%2==0:\r\n S+=\"2\"\r\nelse:\r\n S+=\"3\"\r\nprint(S)", "n = int(input())\r\nif n == 2:\r\n print('1')\r\n print('2')\r\nelif n == 3:\r\n print('1')\r\n print('3')\r\nelif n % 2:\r\n n -= 3\r\n print(str(n // 2 + 1))\r\n print('3', end=' ')\r\n print(' '.join(list('2' * (n // 2))))\r\nelse:\r\n print(str(n // 2))\r\n print(' '.join(list('2' * (n // 2))))\r\n", "#749A\r\n\"\"\"\r\nfrom math import *\r\ndef prime(n):\r\n c=0\r\n primes=[True]*(n+1)\r\n primes[0]=False\r\n primes[1]=True\r\n for p in range(2,int(sqrt(n))+1):\r\n if primes[p]==True:\r\n for i in range(p*p,n+1,p):\r\n primes[i]=False\r\n for i in range(len(primes)):\r\n if primes[i]==True:\r\n c+=1\r\n print(c)\r\n\r\n\r\n\r\nn=int(input())\r\nprime(n)\r\n\"\"\"\r\nn=int(input())\r\nif n%2==0:\r\n a=n//2\r\n print(a)\r\n print(\"2 \"*a)\r\nelse:\r\n a=(n-1)//2\r\n print(a)\r\n print(\"2 \"*(a-1),end=\"\")\r\n print(\"3\")\r\n", "n=int(input())\r\nx=int(n/2)\r\nprint(x)\r\na=[]\r\nif n%2==0:\r\n\tfor i in range(x):\r\n\t\ta.append(2)\r\nelse:\r\n\tfor i in range(x):\r\n\t\tif i==x-1 :\r\n\t\t\ta.append(3)\r\n\t\telse:\r\n\t\t\ta.append(2)\r\nprint(*a,sep=\" \")\r\n\t", "k = int(input())\r\nprint(k//2)\r\nl = ['2' for i in range(1,k//2)]\r\nif k%2: l.append('3')\r\nelse: l.append('2')\r\nprint(' '.join(l))\r\n ", "num = int(input())\r\n\r\nif num % 2 == 0:\r\n flist = [2] * (num // 2)\r\nelse:\r\n flist = [2] * ((num // 2)-1) + [3]\r\n\r\nprint(len(flist))\r\nprint(*flist)", "n= int(input())\r\nu= []\r\n\r\nif n%2 == 1:\r\n p= n//2\r\n p -= 1\r\n for j in range(p):\r\n u.append(2)\r\n u.append(3)\r\nelse:\r\n q= n//2\r\n for j in range(q):\r\n u.append(2)\r\n\r\nprint(len(u))\r\nprint(*u)", "def f(n):\r\n ans = [2 for _ in range(n//2)]\r\n if n % 2 == 0:\r\n return ans\r\n ans.pop()\r\n ans.append(3)\r\n return ans\r\n\r\nn = int(input())\r\nans = f(n)\r\nprint(len(ans))\r\nfor number in ans:\r\n print(number, end=' ')", "\r\nimport sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log,comb,perm,factorial\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\nn=int(input())\r\nprint(n//2)\r\nif n%2==0:\r\n print(\" \".join([\"2\"]*(n//2)))\r\nelse:\r\n n-=3\r\n print(\" \".join([\"2\"]*(n//2))+\" 3\")\r\n\r\n\r\n\r\n\r\n", "n=int(input())\nl=[]\nif n%2==1:\n l.append(3)\n n-=3\nwhile n>0:\n l.append(2)\n n-=2\nprint(len(l))\nprint(*l)\n \t \t \t \t \t\t \t\t \t \t\t \t", "def main():\r\n t = int(input())\r\n k = t // 2\r\n print(k)\r\n if t % 2 == 0:\r\n print('2' + ' 2' * (k - 1))\r\n else:\r\n print('3' + ' 2' * (k - 1))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n # fin = sys.stdin\r\n # fin = open(\"input.txt\")\r\n main()", "# https://codeforces.com/problemset/problem/749/A\r\n\r\n\r\nentrada = int(input())\r\nif entrada % 2 == 0:\r\n ans = [2] * (entrada//2)\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n ans = [3]\r\n if (entrada - 3) % 2 == 0:\r\n ans.extend([2] * ((entrada - 3) // 2))\r\n print(len(ans))\r\n print(*ans)\r\n\r\n", "n=int(input().strip())\r\nif n%2==0:\r\n a=[2 for i in range(n//2)]\r\n print(n//2)\r\n print(*a)\r\nelse:\r\n a=[2 for i in range(n//2-1)]\r\n a.append(3)\r\n print(n//2)\r\n print(*a)", "n = int(input())\r\nif n == 3:\r\n print(1)\r\n print(3)\r\nelse:\r\n if n % 2 == 0:\r\n print(n//2)\r\n print(*[2 for i in range(n//2)])\r\n else:\r\n print(n//2)\r\n print(*([2 for i in range(n//2-1)]+[3]))", "a = int(input())\r\nb=[]\r\nif a%2==0:\r\n c=a//2\r\n while a!=0:\r\n b.append('2')\r\n a-=2\r\n print(c)\r\n print(*b)\r\nelse:\r\n c=a-3\r\n while c!=0:\r\n b.append('2')\r\n c-=2\r\n b.append('3')\r\n print(len(b))\r\n print(*b)", "n=int(input())\r\ncount=0\r\nif(n%2==1):\r\n n=n-3\r\n d=n//2\r\n print(d+1)\r\n for i in range(d):\r\n print(2, end=' ')\r\n print(3, end=' ')\r\nelse:\r\n d=n//2\r\n print(d)\r\n for i in range(d):\r\n print(2, end=' ')\r\n\r\n", "n=int(input())\r\ndef f(n):\r\n if n<=3:\r\n return([n])\r\n if n%2==0:\r\n return([2]*(n//2))\r\n else:\r\n return([2]*((n//2)-1)+[3])\r\nl=f(n)\r\nprint(len(l))\r\nprint(*l)", "n=int(input())\nif n%2==0:\n sumi=0\n ans=0\n while(sumi<n):\n sumi+=2\n ans+=1\n print(ans)\n a=('2 '*ans)\n print(a)\nelse:\n sumi=0\n ans=0\n while(sumi<n):\n sumi+=2\n ans+=1\n print(ans-1)\n a=('2 '*(ans-2))\n print(a,end=\"\")\n print(\"3\")\n\t\t \t \t \t \t\t\t\t\t\t\t \t\t \t\t \t \t", "n = int(input())\r\nif n%2 == 0:\r\n print(n//2)\r\n ot = [2]*(n//2)\r\n print(*ot)\r\nelse:\r\n print(n//2)\r\n ot = [2]*(n//2-1)\r\n ot.append(3)\r\n print(*ot)", "n = int(input())\r\nquotient = int(n/2)\r\nanswer = str()\r\ncount = 0\r\nif int(n/2) < n/2 :\r\n for _ in range (0,quotient-1) :\r\n answer += '2 '\r\n count+= 1 \r\nelif int(n/2) == n/2 :\r\n for _ in range (0,quotient) :\r\n answer += '2 '\r\n count+= 1 \r\nif n % 2 != 0 :\r\n answer += '3 '\r\n count += 1\r\nprint(count)\r\nprint(answer)", "n = int(input())\r\nprint(n//2-n%2 + n%2)\r\nprint(*[2]*(n//2 - n%2), *[3]*(n%2))\r\n", "n = int(input())\r\ns=n//2\r\nprint(s)\r\ni=0\r\nwhile i < s-1:\r\n print(2, end=\" \")\r\n i+=1\r\nif(n%2==0):\r\n print(2)\r\nelse:\r\n print(3)\r\n \r\n ", "number = int(input())\nncount = (number // 2)\nrcount = (number % 2)\nif rcount == 1:\n ncount = ncount - 1\n print(ncount + 1)\n print(ncount * \"2 \" + \"3\")\nelse:\n print(ncount)\n ncount = ncount - 1\n print(ncount * \"2 \" + \"2\")\n", "# your code goes here\r\nn=int(input())\r\nb=n//2\r\nif(n%2==1):\r\n\tprint(b,end='\\n')\r\n\tfor i in range(b-1):\r\n\t\tprint('2',end=' ')\r\n\tprint('3')\r\nelse:\r\n\tprint(b,end='\\n')\r\n\tfor i in range(b-1):\r\n\t\tprint('2',end=' ')\r\n\tprint('2')", "n = int(input())\r\ns = [2] * (n // 2 - n % 2) + [3] * (n % 2)\r\nprint(len(s))\r\nprint(*s)\r\n \r\n", "n = int(input())\r\ncount = []\r\nwhile n>0:\r\n if n==2:\r\n count.append(2)\r\n n=0\r\n if n==3:\r\n count.append(3)\r\n n=0\r\n if n>3:\r\n count.append(2)\r\n n-=2\r\nprint(len(count))\r\nfor i in count:\r\n print(i,end=\" \")", "import sys\r\nfrom heapq import heappush, heappop, heapify\r\nfrom collections import Counter, deque\r\nimport bisect\r\nimport re\r\nfrom functools import lru_cache\r\nsys.setrecursionlimit(100000)\r\ndef getIntegerInputs():\r\n return map(int, input().split())\r\n \r\ndef inbound(r, c, n, m):\r\n return 0 <= r < n and 0 <= c < m\r\nDIR = [(0,1),(0,-1),(-1,0),(1,0)]\r\n# def bfs(queue, visited, grid):\r\n# n, m = len(grid), len(grid[0])\r\n# while queue:\r\n# r, c = queue.popleft()\r\n# for x, y in DIR:\r\n# nr, nc = r + x, c + y\r\n# if (nr, nc) == (1, m-1) and grid[nr][nc] == 0:\r\n# return True\r\n# if not inbound(nr, nc, n, m) or visited[nr][nc] or grid[nr][nc]:\r\n# continue\r\n# queue.append((nr, nc))\r\n# visited[nr][nc] = 1\r\n# return False\r\ndef solve():\r\n n = int(input())\r\n primes = [2,3,5,7]\r\n stack = []\r\n i = 0\r\n s = 0\r\n while s < n:\r\n if s + primes[i] > n:\r\n val = stack.pop()\r\n s -= val\r\n i += 1\r\n continue\r\n s += primes[i]\r\n stack.append(primes[i])\r\n print(len(stack))\r\n print(*stack)\r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n", "t = int(input())\r\nif t % 2 == 0:\r\n ans = t//2\r\n print(ans)\r\n for x in range(ans):\r\n print(2, end=\" \")\r\nelif t == 3:\r\n print(1)\r\n print(3)\r\nelse:\r\n ans = (t-3)//2\r\n print(ans+1)\r\n for x in range(ans):\r\n print(2, end=\" \")\r\n print(3)\r\n", "n=int(input())\r\n\r\nif(n%2==0):\r\n print(n//2)\r\n print(*[2]*(n//2))\r\nelse:\r\n l=[3]\r\n l=l+[2]*((n-3)//2)\r\n print(len(l))\r\n print(*l)\r\n", "import math\n\ndef criba_Eratostenes(max_size):\n arr = [True] * (max_size + 10)\n arr[0] = False; arr[1] = False\n\n for i in range( 4, max_size, 2):\n arr[i] = False\n\n for i in range( 3, int(math.sqrt(max_size) + 1) , 2):\n if arr[i]:\n for j in range( i*i,max_size, i*2):\n if j % i == 0:\n arr[j] = False\n\n return arr\n\nif __name__ == '__main__':\n\n numero = int(input())\n\n if numero % 2 == 0:\n cant = numero // 2\n print(cant)\n result = \"\"\n for i in range( cant ):\n result += \"2\"\n if i < (cant-1):\n result += \" \"\n print(result)\n else:\n arr_primos_booleans = criba_Eratostenes(100000)\n arr_primos_number = []\n\n\n arr_primos_number.append(2)\n for i in range(3,len(arr_primos_booleans),2 ):\n if arr_primos_booleans[i]:\n arr_primos_number.append(i)\n\n cant_2 = ( numero // 2)-1\n print(cant_2 + 1)\n rst = \"\"\n for i in range(cant_2):\n rst += \"2 \"\n\n rst += \"3\"\n print(rst)\n\n\n\t \t \t \t\t \t\t \t \t \t\t\t \t \t \t", "n = int(input())\r\ncount = 0\r\nif n % 2 != 0:\r\n count += 1\r\n two = (n - 3) // 2\r\n count += two\r\n print(count)\r\n for i in range(two):\r\n print('2', end=' ')\r\n print('3')\r\nelse:\r\n two = n // 2\r\n count += two\r\n print(count)\r\n for i in range(two):\r\n if i != two - 1:\r\n print('2', end=' ')\r\n else:\r\n print('2')\r\n ", "n=int(input())\r\nif n<4:\r\n print(1)\r\n print(n)\r\nelif n%2==0:\r\n flag=n//2\r\n sums=[2]*flag\r\n print(flag)\r\n print(*sums)\r\nelse:\r\n flag=n//2\r\n sums=[2]*(flag-1)\r\n sums.append(3)\r\n print(flag)\r\n print(*sums)", "n = int(input())\r\nprint(n//2)\r\nprint(('2'+' ')*(n//2-n%2)+'3'*(n%2))\r\n", "n = int(input())\r\nif n == 2:\r\n print(1)\r\n print(2)\r\nelif n == 3:\r\n print(1)\r\n print(3)\r\nelif n %2 ==0:\r\n print(n//2)\r\n print(*[2 for i in range(n//2)])\r\nelse:\r\n print(((n-3)//2)+1)\r\n k = [2 for i in range((n-3)//2)]\r\n k.append(3)\r\n print(*k)", "n= int(input())\ni=0\nif n%2==0:\n t=int(n/2)\n a=''\n while i<t:\n a+='2 '\n i+=1\nelse:\n t=int(((n-3)/2)+1)\n a=''\n while i<t-1:\n a+='2 '\n i+=1\n a+='3'\nprint(t)\nprint(a)\n\n", "# author: violist\n# created: 19.07.2021 17:22:38\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nif (n % 2 == 0):\n ans = n // 2 * \"2\"\nelse:\n ans = (n // 2 - 1) * \"2\" + \"3\"\nprint(len(ans))\nprint(\" \".join(ans))\n", "n=int(input())\r\notv=[]\r\nif n%2==0:\r\n k=n//2\r\n otv=[2 for i in range(k)]\r\n print(k)\r\n print(*otv)\r\nelse:\r\n otv.append(3)\r\n n-=3\r\n k=n//2\r\n for i in range(k):\r\n otv.append(2)\r\n print(len(otv))\r\n print(*otv)\r\n \r\n\r\n", "n = int(input())\r\ndef nextsimpleint(x: int):\r\n while True:\r\n x+=1\r\n cnt = 0\r\n for i in range(2,x//2):\r\n if x%i==0:\r\n cnt+=1\r\n break\r\n if cnt==0:\r\n return x\r\n\r\ncnt=n//2\r\n\r\nprint(cnt)\r\nif n%2!=0:\r\n print('2 '*(cnt-1),end='')\r\n print('3')\r\nelse:\r\n print('2 '*cnt)\r\n ", "n=int(input())\r\nprint(int(n/2))\r\nif (n%2==0):\r\n\tfor i in range(n//2 -1):\r\n\t\tprint(2,end=\" \")\r\n\tprint(2)\r\nif (n%2==1):\r\n\tfor i in range(n//2 -1):\r\n\t\tprint(2,end=\" \")\r\n\tprint(3)", "n = int(input())\r\nprint(n//2)\r\nif n%2:\r\n print(*[2 for i in range(n//2-1)], 3)\r\nelse:\r\n print(*[2 for i in range(n//2)])\r\n", "n=int(input())\r\nif n%2==0:\r\n ans=n//2\r\n li=[2]*ans\r\nelif n%2!=0:\r\n n=n-3\r\n ans=n//2+1\r\n li=[2]*(ans-1)+[3]\r\nprint(ans)\r\nfor i in range(ans):\r\n print(li[i],end=\" \")\r\n", "num = int(input())\r\n\r\nif num%2 == 0:\r\n\tprimes = '2 ' * (num//2)\r\nelse:\r\n\tprimes = '2 ' * ((num // 2) - 1)\r\n\tprimes += '3'\r\n\r\nprimes.strip()\r\n\r\nprint(num // 2)\r\nprint(primes)", "n = int(input())\n\ncount = n // 2\nprint(count)\nwhile n > 0:\n if n % 2 == 0:\n print(2, end = \" \")\n n -= 2\n else:\n print(3, end = \" \")\n n -= 3\n\t\t\t \t \t\t\t\t \t \t\t\t \t \t \t", "n = int(input())\r\nk = n//2\r\nans = [2]*k\r\nif n%2: ans[-1] += 1\r\nprint(k)\r\nprint(*ans)", "val=int(input())\r\nt,T=0,0\r\nif(val%2!=0):\r\n\tt=int(val/2)-1\r\n\tT=1\r\nelse:\r\n\tt=int(val/2)\r\nprint(t+T)\r\nfor i in range(t):\r\n\tprint(2,end=\" \")\r\nfor i in range(T):\r\n\tprint(3)", "n = int(input())\r\nif n == 3:\r\n print(1, 3, sep = \"\\n\")\r\nelif n % 2 == 0:\r\n print(n//2, (n//2 * \"2 \").strip(), sep = \"\\n\")\r\nelse:\r\n print(n//2, (n//2-1) * \"2 \" + \"3\", sep = \"\\n\")", "import math\r\ndef solve(n):\r\n a=n//2\r\n c=n%2\r\n if c!=0:\r\n a-=c\r\n print(a+c)\r\n for i in range(a):\r\n print(\"2\",end=\" \")\r\n if c!=0:\r\n print(3)\r\n \r\nt=int(input(\"\"))\r\nsolve(t)", "n = int(input())\r\n\r\nif n%2==0:\r\n\t# print()\r\n\thel = n//2\r\n\teven = []\r\n\tfor i in range(hel):\r\n\t\teven.append(2)\r\n\tprint(len(even))\r\n\tprint(*even)\r\nelse:\r\n\tcnt = n//2\r\n\tnew_ct = cnt-1\r\n\r\n\todd = []\r\n\tfor i in range(new_ct):\r\n\t\todd.append(2)\r\n\todd.append(3)\r\n\tprint(len(odd))\r\n\tprint(*odd)\r\n", "n = int(input())\r\ndef isprime(x):\r\n for i in range(2,int((x ** 0.5))+1):\r\n if x % i == 0:\r\n return False\r\n return True\r\nif n % 2 == 0:\r\n print(n//2)\r\n print((n-2)//2 *'2 '+'2')\r\nelse:\r\n print((n-1)//2)\r\n print((n-3)//2 *'2 '+'3')\r\n ", "x=int(input())\r\nif x==2:\r\n print(1)\r\n print(2)\r\nelif x==3:\r\n print(1)\r\n print(3)\r\nelif x%2==0:\r\n print(x//2)\r\n c=(x//2)*\"2 \"\r\n print(c[:len(c)-1])\r\nelse:\r\n print(int(((x-3) // 2)+1))\r\n print(((x-3) // 2) * \"2 \"+\"3\")\r\n", "a=int(input())\r\nb=[]\r\nif a%2==0:\r\n for i in range(a//2):\r\n b.append('2')\r\n\r\n\r\nelse:\r\n while a!=3:\r\n b.append('2')\r\n a-=2\r\n b.append('3')\r\n\r\nprint(len(b))\r\nprint(' '.join(b))", "n = int(input())\r\nl = []\r\nwhile n:\r\n if n % 2:\r\n l.append(3)\r\n n -= 3\r\n else:\r\n l.append(2)\r\n n -= 2\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\r\nprint(n // 2)\r\nif n % 2 == 0: print(\"2 \" * (n // 2))\r\nelse: print(\"2 \" * (n // 2 - 1) + \"3\")", "def main():\n num :int = int(input())\n primes :int = num // 2\n print(primes)\n\n for i in range(primes):\n if i == primes - 1:\n print(2 + num % 2)\n else:\n print(2, end=\" \")\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\nprint(n//2)\r\nif n%2==0:print('2 '*(n//2))\r\nelse:print('2 '*(n//2-1)+'3')", "n=int(input())\r\nif n%2==0:\r\n print(int(n/2))\r\n print('2 '*(int(n/2)))\r\nelse:\r\n d=int(n/2)\r\n print(d)\r\n for i in range(d-1):\r\n print('2',end=' ')\r\n print('3')", "n=int(input())\r\nh=n//2\r\nprint(h)\r\nprint('3 '+'2 '*(h-1) if n&1 else '2 '*h)", "n = int(input())\r\nans = n//2\r\nprint(ans)\r\nif n%2 == 0:\r\n lst = ['2']*ans\r\nelse:\r\n lst = ['2']*(ans-1)+['3']\r\nprint(' '.join(lst))", "#from collections import Counter\r\nimport math\r\ncount_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n\r\n'''\r\nt=int(input())\r\nans=list()\r\n\r\nfor _ in range(t):\r\n n=int(input())\r\n if n%2:\r\n ans.append(n//2+1)\r\n else:ans.append(n//2)\r\nprint(*ans,sep='\\n')'''\r\nn=int(input())\r\na=n//2\r\nb=0\r\nif n%2:\r\n b=1\r\n a-=1\r\nprint(a+b)\r\ne=[2]*a+[3]*b\r\nprint(*e)\r\nif count_time:\r\n end_time = time.time()\r\n print('\\n\\n----------------\\nRunning time: {} s'.format(end_time - start_time))\r\n\r\n", "n = int(input())\r\n\r\nprint(n//2)\r\nif n % 2 == 0 :\r\n for i in range(0,n//2):\r\n print(2,end = ' ')\r\nelse:\r\n for i in range(1,n//2):\r\n print(2,end = ' ')\r\n print(3)", "n = int(input())\r\nans = []\r\nif n % 2 == 1:\r\n ans += [2]*(n//2-1)\r\n ans+=[3]\r\nelse:\r\n ans += [2]*(n//2)\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans)))\r\n", "m=int(input())\r\nprint(m//2)\r\nif m%2==0:\r\n\tfor i in range(m//2-1):\r\n\t\tprint(2,end=' ')\r\n\tprint(2)\r\nelse:\r\n\tfor i in range(m//2-1):\r\n\t\tprint(2,end=' ')\r\n\tprint('3')", "def func_O_E (n):\r\n if n%2==0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\ndef max_prime_count(n):\r\n\r\n if func_O_E (n):\r\n\r\n print(n//2)\r\n for i in range(n//2):\r\n print(2,end=\" \")\r\n else:\r\n\r\n print(n//2)\r\n for i in range(n//2-1):\r\n print(2,end=\" \")\r\n print(3)\r\n\r\nn = int(input())\r\n\r\nmax_prime_count(n)", "x = int(input())\r\nif x % 2 == 0:\r\n print(x//2,'\\n','2 ' * (x // 2),sep='')\r\nelse:\r\n print(x//2,'\\n','2 ' * ((x // 2)-1),'3',sep='')", "n = int(input())\r\n\r\nif n%2 == 0:\r\n n2 = [2 for i in range(2,n+1) if i%2==0]\r\n print(len(n2))\r\n print(*n2,sep=' ')\r\nelif n == 3:\r\n print(1)\r\n print(3)\r\nelse:\r\n n2 = [2 for i in range(2,n-2) if i%2==0]\r\n print(len(n2)+1)\r\n print(*n2,sep=' ',end=' ')\r\n print(3)", "n=int(input())\r\nx=0\r\nif n%2==0:\r\n print(int(n/2))\r\n for _ in range(int(n/2)):\r\n print(2,end=' ')\r\nelse:\r\n print(int((n-1)/2))\r\n print(3,end=' ')\r\n for _ in range(int((n-1)/2-1)):\r\n print(2,end=' ')\r\n \r\n \r\n", "z=int(input())\nprint(z//2)\nif(z%2==0):\n\tfor i in range((z//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(2)\nelif(z%2!=0):\n\tfor i in range((z//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(3)\n\t \t \t \t \t \t \t \t\t\t\t \t\t", "import math as m\r\nx = \"\"\r\nn = int(input(\"\"))\r\nprint(m.floor(n/2))\r\nif n%2 == 0:\r\n for i in range(int(n/2)):\r\n x += \"2 \"\r\nelse:\r\n for i in range(int((n-3)/2)):\r\n x += \"2 \"\r\n x += \"3\"\r\nprint(x)", "n = int(input())\r\n\r\nn0 = n // 2\r\n\r\nif n % 2 == 0:\r\n mass = [2] * n0\r\n\r\nelse:\r\n mass = [2] * (n0-1)\r\n mass.append(3)\r\n\r\nprint(n0)\r\nprint(*mass)\r\n", "n1=int(input())\nif n1%2==0:\n print(n1//2)\n for i in range(0,n1//2):\n print(\"2\",end=\" \")\nelse:\n print(n1//2)\n for i in range(1,(n1//2)):\n print(\"2\",end=\" \")\n print(3)\n\t\n \t \t \t \t\t\t\t \t\t \t \t \t", "def bachgold(n):\r\n p = []\r\n if(n % 2 == 0):\r\n p.extend([2] * (n // 2))\r\n else:\r\n p.extend([2] * ((n // 2) - 1))\r\n p.append(3)\r\n return p\r\nn = int(input())\r\nresult = bachgold(n)\r\nprint(len(result))\r\nprint(*result)", "n=int(input())\r\np=n//2\r\ns=[2 for k in range(p)]\r\nif n%2!=0:\r\n s[-1]=3\r\nprint(len(s))\r\nprint(*s)\r\n \r\n", "n=int(input())\nx=n/2\nprint(int(x))\nif n%2==1:\n\tprint(\"3 \",end=\"\")\n\tn-=3\nwhile n>0:\n\tprint(\"2 \",end=\"\")\n\tn-=2\n\t\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\nnum=n%2\r\nif num == 0:\r\n print(int(n/2))\r\n print(\" \".join(\"2\" for i in range(int(n/2))))\r\nelse:\r\n print(int(n//2))\r\n print(\" \".join(\"2\" for i in range(int((n-3)/2)))+\" \"+\"3\")", "n = int(input())\r\nans = []\r\nwhile n>3:\r\n\tans.append(2)\r\n\tn-=2\r\nans.append(n)\r\nprint(len(ans))\r\nfor i in ans:\r\n\tprint(i,end=\" \")", "number=int(input())\r\nk=0\r\nn=0\r\nif number%2!=0:\r\n number-=3\r\n k +=1\r\n n=1\r\nif number%2==0:\r\n k+=number/2\r\nprint(int(k))\r\nif n==0:\r\n for i in range(int(k)):\r\n print(\"2\",end=\" \")\r\nelse:\r\n for i in range(int(k-1)):\r\n print(\"2\",end=\" \")\r\n print(3)\r\n", "n=int(input())\r\nprint(int(n/2))\r\nfor i in range((int(n/2))-(n%2)):\r\n print(2,end=' ')\r\nif(n%2):print(3)\r\n", "n=int(input())\r\n\r\nif n%2==0:\r\n k=int(n/2)\r\n print(k)\r\n for i in range(k):\r\n print(\"2\",end =\" \")\r\nif n%2==1:\r\n k=int(n/2)\r\n print(k)\r\n for i in range(1,k):\r\n print(\"2\",end =\" \")\r\n print(\"3\")", "def solve():\r\n n = int(input())\r\n if n == 2:\r\n print(1)\r\n print(2)\r\n return\r\n if n == 3:\r\n print(1)\r\n print(3)\r\n return\r\n if n % 2 == 0:\r\n print(n // 2)\r\n for i in range(n // 2):\r\n print(2)\r\n return\r\n k = 1 + (n-3)//2\r\n print(k)\r\n for i in range((n-3)//2):\r\n print(2)\r\n print(3)\r\n return\r\n\r\nsolve()", "u=int(input())\r\nif u%2==0:\r\n print(u//2)\r\n for i in range(2,u+1,2):\r\n print(2,end=\" \")\r\nelse:\r\n print((u-3)//2+1) \r\n print(3,end=\" \")\r\n for i in range(2,u-1,2):\r\n print(2,end=\" \")", "n=int(input())\r\ncount=n//2\r\nprint(count)\r\nprint(2+n%2,end=\" \")\r\nfor i in range(count-1):\r\n print(2,end=\" \")\r\n", "\r\nnum = int(input())\r\n\r\nquant = num // 2\r\n\r\n\r\nprint(quant)\r\n\r\nfor _ in range(quant-1):\r\n\r\n print(2, end=\" \")\r\n\r\n\r\nif num % 2 == 0:\r\n\r\n print(2, end=\"\")\r\n\r\nelse:\r\n\r\n print(3, end=\"\")\r\n\r\n", "k = int(input())\r\nq = k //2\r\nif k % 2 == 0:\r\n print(q)\r\n for i in range(q):\r\n print(\"2\", end=\" \")\r\nelse:\r\n print(q)\r\n for i in range(q-1):\r\n print(\"2\",end=\" \")\r\n print(\"3\")", "p=int(input())\r\nif p%2==0:\r\n print(p//2)\r\n a=[2 for x in range(p//2)]\r\n for i in range(len(a)):\r\n print(a[i],end=\" \")\r\nelse:\r\n print(p//2)\r\n k=(p//2)-1\r\n a=[2 for x in range(k)]\r\n a.append(3)\r\n for i in range(len(a)):\r\n print(a[i],end=\" \")", "n=int(input())\nprint(n//2)\nfor i in range(n//2-1):\n print(2,end=' ')\nif n%2==1: \n print(3)\nelse: print(2)\n\t\t\t\t\t\t \t \t \t\t\t \t\t\t\t \t", "n = int(input()) \r\nl =[] \r\nif (n % 2 == 1): \r\n l.append(3)\r\n n -= 3\r\nwhile (n > 0):\r\n l.append(2)\r\n n -= 2\r\nprint(len(l))\r\nfor i in range(len(l)):\r\n print(l[i],end=\" \")", "a=int(input())\r\nif a%2==0:\r\n n=a//2\r\n print(n)\r\n print('2 '*(n))\r\nelse:\r\n n=(a//2)-1\r\n print(n+1)\r\n print(('2 '*(n)+'3'))", "k = int(input())\r\n\r\nif k % 2 == 0:\r\n print(k//2)\r\n print(' '.join(tuple('2' for i in range(k//2))))\r\nelse:\r\n print(k//2)\r\n print(' '.join(tuple('2' for i in range(k//2-1))) + \" 3\")\r\n", "n=int(input())\r\nprint(n//2)\r\nprint(\"2 \"*int((n//2-(n%2==1)))+'3'*(n%2))", "\ndef crivelloEratostene(num):\n \"\"\"Ritorna una lista di tutti i numeri primi che vanno da 2 a n (compreso)\"\"\"\n prime = [True for i in range(num+1)]\n# boolean array\n p = 2\n while (p * p <= num):\n \n # If prime[p] is not\n # changed, then it is a prime\n if (prime[p] == True):\n \n # Updating all multiples of p\n for i in range(p * p, num+1, p):\n prime[i] = False\n p += 1\n \n # Print all prime numbers\n results = [p for p in range(2, num+1) if prime[p]]\n return results\n\nnumber = int(input())\nall_prime_numbers = crivelloEratostene(number)\nprime_factors = []\ni = 0\nwhile number != 0:\n prime_factors.append(all_prime_numbers[i])\n number -= all_prime_numbers[i]\n if number < 0 or number == 1:\n tmp = prime_factors.pop()\n number += tmp\n i += 1\n\nprint(len(prime_factors))\nprint(\" \".join(map(str,prime_factors)))", "\r\nn=int(input())\r\nif(n%2==0):\r\n temp=n//2\r\n print(temp)\r\n print(\" \".join(['2']*temp))\r\nelse:\r\n val=n//2 -1 \r\n temp=['2']*val\r\n temp.append('3')\r\n print(len(temp))\r\n print(\" \".join(temp))\r\n \r\n \r\n ", "prime = int(input())\r\n\r\nif prime % 2 == 0:\r\n\tprint(prime // 2)\r\n\tfor i in range(prime // 2):\r\n\t\tprint(\"2\", end=\" \")\r\nelse: \r\n\tprint((prime // 2))\r\n\tfor i in range((prime // 2) - 1):\r\n\t\tprint(\"2\", end=\" \")\r\n\tprint(\"3\", end=\"\")", "a=int(input())\r\nresult=\"\"\r\ni=0\r\nwhile (a!=0):\r\n\tif a-3==0:\r\n\t\ta-=3\r\n\t\tresult+=\"3 \"\r\n\telif a-2>=0:\r\n\t\ta-=2\r\n\t\tresult+=\"2 \"\r\n\ti+=1\r\nprint(i)\r\nprint(result.rstrip(\" \"))", "n=int(input())\r\nfac=2\r\ncount=0\r\ns=\"\"\r\nwhile fac<=n:\r\n if n%2==0:\r\n fac+=2\r\n s=s+\"2 \"\r\n count+=1\r\n else:\r\n fac+=2\r\n s=s+\"2 \"\r\n count+=1\r\nif n%2==0:\r\n print(count)\r\n print(s)\r\nelse:\r\n print(count)\r\n print(s[0:len(str(s))-2]+'3')", "n = int(input())\r\nk = n // 2\r\nprint(k)\r\ncount = k if n % 2 == 0 else k - 1\r\nfor i in range(count):\r\n print(\"2\", end=\" \")\r\nif count != k:\r\n print(\"3\")\r\n", "n = int(input())\r\nk = n // 2\r\nprint(k)\r\nif n % 2 == 0:\r\n print('2 ' * (k - 1) + '2')\r\nelse:\r\n print('2 ' * (k - 1) + '3')", "# for _ in range(int(input())):\r\nn=int(input())\r\nprint(f\"{n//2}\\n{'2 '*((n//2)-1)+str(n-((n//2)-1)*2)}\")", "n=int(input())\r\nif n%2==0:\r\n res=n//2\r\n ans=[2]*res\r\nelse:\r\n res=(n-1)//2\r\n ans=[2]*(res-1)\r\n ans.append(3)\r\nprint(res)\r\n\r\nprint(*ans)", "n = int(input())\r\nx = n//2\r\ny = n%2\r\nif n % 2 == 1:\r\n l = [2]*(x-1)\r\n l.append(3)\r\n print(x)\r\n print(*l)\r\nelse:\r\n k = [2]*x\r\n print(x)\r\n print(*k)\r\n\r\n \r\n", "count=0\r\nn=int(input())\r\ncount=(n//2)\r\nprint(count)\r\nfor i in range(count):\r\n if i+1==count and n%2!=0:\r\n print(3)\r\n break\r\n print(2,end=\" \") \r\n ", "n = int(input())\r\n\r\ncount = 0\r\nwhile n % 2 != 0:\r\n n -= 3\r\n count += 1\r\n\r\nif n % 2 == 0:\r\n print(int(n/2) + count)\r\n a = [str(2)]*int(n/2)\r\n b = [str(3)]*count\r\n a.extend(b)\r\n print(' '.join(a))", "n=int(input())\r\nl1=[]\r\ni=n\r\nwhile i>1:\r\n\r\n if i == 2:\r\n l1.append(2)\r\n elif i == 3:\r\n l1.append(3)\r\n else:\r\n l1.append(2)\r\n i=i-2\r\n\r\nprint(len(l1))\r\nfor item in l1:\r\n print(item,end=\" \")\r\nprint()", "n =int(input())\r\nprint(n//2)\r\nprint('2 '*(n//2-1),2+n%2)", "a = int(input())\r\nb = [2 for i in range(a//2)]\r\nb[-1] = 2 + a % 2\r\nprint(a//2)\r\nprint(*b)", "n = int(input())\r\nprint(n//2)\r\nif n&1:\r\n l=[2]*((n//2)-1)\r\n l+=[3]\r\n print(*l)\r\nelse:\r\n l=[2]*(n//2)\r\n print(*l)\r\n ", "n = int(input())\r\nprint(n//2)\r\nprint(*[2]*(n//2-1), 2+n%2)", "n = int(input())\r\nl = []\r\nif n%2 == 0:\r\n for i in range(n//2):\r\n l.append(2)\r\nelse:\r\n for i in range(n//2-1):\r\n l.append(2)\r\n l.append(3)\r\nprint(len(l))\r\nprint(*l)", "n=int(input())\r\nl=[2]\r\nif n==2:\r\n print(1)\r\n print(2)\r\nelif n==3:\r\n print(1)\r\n print(3)\r\nelif n&1==0:\r\n l=l*(n//2)\r\n print(len(l))\r\n print(*l)\r\nelse:\r\n l=l*((n-3)//2)\r\n l.append(3)\r\n print(len(l))\r\n print(*l)", "num = int(input())\nres = []\nsum = 0\np = 2\nwhile(sum != num):\n sum+= p\n res.append(p)\n if(sum==num-1):\n sum-=p\n res.remove(p)\n p+=1\nprint(len(res))\nprint(str(res).replace(',','').replace('[','').replace(']',''))\n\t\t\t \t\t\t\t\t \t \t \t \t \t \t", "a = int(input())\ncnt = 0\ng = []\nfor _ in range(a//2):\n g.append(2)\n cnt+=1\nif a%2 == 0:\n print(cnt)\n print(*g)\nelse:\n print(cnt)\n g[-1] = 3\n print(*g)", "if __name__ == '__main__':\n n = int(input())\n\n op_str = \"\"\n if n % 2 == 0:\n l = n//2\n print(l)\n for i in range(l - 1):\n op_str += \"2 \"\n op_str += \"2\"\n else:\n l = n//2\n print(l)\n for i in range(l - 1):\n op_str += \"2 \"\n op_str += \"3\"\n\n print(op_str)\n\n", "#D\nn = int(input())\nif n % 2 == 0 :\n sol = ' '.join(\"2\" * int(n/2))\n print(len(sol.split(' ')))\n print(sol)\nelse:\n sol = ' '.join('2'*int((n/2)-1) +'3')\n print(len(sol.split(' ')))\n print(sol)\n#Edjgdfdpogjh\n\n\t \t\t\t \t\t \t \t \t\t\t\t \t\t\t \t\t \t\t", "def bachgold_problem():\r\n a=int(input());c=[];s=''\r\n while a!=0:\r\n if a%2==0:c.append(2);a-=2\r\n else:c.append(3);a-=3\r\n for i in range(len(c)):s+=str(c[i])+' '\r\n print(str(len(c))+'\\n'+s)\r\nbachgold_problem()", "num = int(input())\r\nprimes = []\r\nif num % 2 == 0:\r\n for i in range(0, int(num/2)):\r\n primes.append(2)\r\nelse:\r\n for i in range(0, int(num/2 - 1)):\r\n primes.append(2)\r\n primes.append(3)\r\nprint(len(primes))\r\nfor i in primes:\r\n print(i, end=\" \")", "def 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\na = cin()\r\nif a % 2 == 0:\r\n x = '2 '*int(a/2)\r\n print(int(a/2))\r\n print(x)\r\nelse:\r\n l = a-3\r\n x1 = '2 '*int(l/2)\r\n print(int((l/2)+1))\r\n print(x1,3)\r\n", "no = int(input())\r\ntimes = 0\r\nif(no % 2 == 0):\r\n times = no // 2\r\n print(times)\r\n for i in range(times - 1):\r\n print('2 ', end='')\r\n print('2')\r\nelse:\r\n times = no // 2\r\n print(times)\r\n for i in range(times - 1):\r\n print('2 ', end='')\r\n print('3')\r\n ", "import math\r\n\r\nnum = int(input())\r\n\r\nif num % 2 == 0:\r\n k = num // 2\r\n print(k)\r\n print('2 '*k)\r\nelse:\r\n k = math.floor(num / 2) - 1\r\n print(k+1)\r\n print('2 ' * k + '3')\r\n", "def printAsMaximalPrimeSum(n):\r\n l=[]\r\n # If n is odd, print one 3\r\n if ( n % 2 == 1): \r\n l.append(3)\r\n n -= 3\r\n \r\n \r\n # Now n is even, print 2 n/2 times\r\n while ( n>0): \r\n l.append(2)\r\n n -= 2\r\n return l \r\n \r\n \r\n# Driver Code\r\n \r\nn = int(input())\r\nk=printAsMaximalPrimeSum(n)\r\nprint(len(k))\r\nprint(*k)", "x = int(input())\r\nprint(x//2)\r\nfor i in range(x//2-1):\r\n print(2, end=\" \")\r\nprint(2+x % 2)\r\n", "n=int(input())\r\nans=[]\r\nif n%2:\r\n n-=3\r\n ans.append('3')\r\nans+=['2']*(n//2)\r\nprint(len(ans))\r\nprint(' '.join(ans))\r\n", "n = int (input ())\r\nif n % 2 == 0:\r\n array = ['2'] * int (n / 2)\r\nelse:\r\n array = ['2'] * (int (n / 2) - 1) + ['3']\r\nprint (len (array))\r\nprint (' '.join (array))", "n = int(input())\r\nprint(n//2)\r\nfor i in range(n//2-1): print(2,end=\" \")\r\nif n%2==1: print(3)\r\nelse: print(2)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nif n%2==0:\r\n print(int(n/2))\r\n print(int((n/2-1))*'2 '+'2')\r\nelse:\r\n print(int((n-1)/2))\r\n print(int(((n-1)/2-1))*'2 '+'3')", "def bg(n):\r\n p = []\r\n if n % 2 == 0:\r\n p.extend([2] * (n // 2))\r\n else:\r\n p.extend([2] * ((n // 2) - 1))\r\n p.append(3)\r\n return p\r\n\r\nn = int(input())\r\np = bg(n)\r\nprint(len(p))\r\nprint(*p)\r\n", "a=int(input())\r\nprint(a//2)\r\nprint(*([2]*((a-a%2*3)//2)),*([3])*(a%2),sep=' ')", "x=int(input())\np=x//2\nif(x%2==0):\n print(p)\n print('2 '*p)\nelse:\n print(p)\n print('2 '*(p-1),end='')\n print(\"3\")\n\t \t\t\t\t\t \t \t \t\t \t \t \t \t\t \t", "m = n = int(input())\r\nn -= 2 + (n % 2)\r\nprint(n // 2 + 1)\r\nprint(2 + (m % 2), end = ' ')\r\nfor i in range(n // 2):\r\n print(2, end = ' ')", "n = int(input())\r\nprint(n // 2)\r\nprint(\"2 \" * (n // 2 - 1), 2 + n % 2)", "n=int(input())\r\nprint(n//2)\r\na=[2]*(n//2)\r\nif n%2==1: a[-1]+=1\r\nprint(*a)", "x=int(input())\r\nprint(x//2)\r\nprint(\"2 \"*((x//2)-1),end='')\r\nif x%2==0:\r\n print(2)\r\nelse:\r\n print(3)", "n=int(input())\r\nt=n//2\r\nif n%2==0:\r\n print(t)\r\n for j in range(t):\r\n print(2,end=\" \")\r\n print()\r\nelse:\r\n print(t)\r\n for j in range(t-1):\r\n print(2,end=\" \")\r\n print(3)", "# str = input()\r\n# str = list(map(int, str.split()))\r\n# n = str[0]\r\n# k = str[1]\r\n# t = str[2]\r\n#\r\n# #initalize an array of size n\r\n# arr = [0] * n\r\n#\r\n# shade = []\r\n# target = round((n * k * t) / 100)\r\n# #generate the shade for the array\r\n# while target >= 1:\r\n# if target - k > 0:\r\n# target = target - k\r\n# shade.append(k)\r\n# else:\r\n# target = round(target)\r\n# shade.append(target)\r\n# break\r\n#\r\n# for i in shade:\r\n# print(i, end=\" \")\r\n#\r\n# for i in range(n - len(shade)):\r\n# print(0, end=\" \")\r\n\r\n\r\n#turn both strings into arrays\r\n# str1 = input()\r\n# str2 = input()\r\n#\r\n# str1 = list(map(int, str1.split()))\r\n# str2 = list(map(int, str2.split()))\r\n#\r\n# n = str1[0]\r\n# k = str1[1]\r\n# r= 0\r\n# if str2[k] > 0:\r\n# r = k + 1\r\n#\r\n# for i in range(k - 1, n-1):\r\n# if str2[k] >= str2[i + 1] and str2[i] > 0:\r\n# r+= 1\r\n#\r\n# print(r)\r\n\r\n\r\n\r\n\r\n# str1 = input()\r\n# arr = []\r\n#\r\n# for i in str1:\r\n# try:\r\n# arr.append(int(i))\r\n# except:\r\n# continue\r\n# arr.sort()\r\n#\r\n# n = len(arr)\r\n# for i in range(n):\r\n# if i != n - 1:\r\n# print(arr[i], end=\"+\")\r\n# else:\r\n# print(arr[i], end=\"\")\r\n\r\n\r\n\r\n\r\n#stones on a table\r\n# n = int(input())\r\n# str1 = input()\r\n# str1 = [x for x in str1]\r\n# c, idx, = 0, 1\r\n# l = str1[0]\r\n#\r\n# while idx < len(str1):\r\n# if l == str1[idx]:\r\n# c += 1\r\n# str1.pop(idx)\r\n# else:\r\n# l = str1[idx]\r\n# idx += 1\r\n# print(c)\r\n\r\n\r\n\r\n\r\n#queue at school\r\n\r\n# str1 = input()\r\n# str2 = input()\r\n#\r\n# str1 = list(map(int, str1.split()))\r\n# str2 = [i for i in str2]\r\n#\r\n# n = str1[0]\r\n# t = str1[1]\r\n#\r\n# for i in range(t):\r\n# j = 0\r\n# while j < n - 1:\r\n# if str2[j] == \"B\" and str2[j + 1] == \"G\":\r\n# #swap\r\n# str2[j], str2[j + 1] = str2[j + 1], str2[j]\r\n# j += 2\r\n# else:\r\n# j += 1\r\n#\r\n# str2 = ([print(i, end=\"\") for i in str2])\r\n\r\n\r\n#hit the lottery\r\n\r\n# n = int(input())\r\n# bills = [100, 20, 10, 5, 1]\r\n# c = 0\r\n#\r\n# while n >= 1:\r\n# for i in bills:\r\n# if n > 2 * bills[0]:\r\n# #for large numbers take a out all 100 bills at once\r\n# c += n // bills[0]\r\n# n = n % bills[0]\r\n# else:\r\n# if n - i >= 0:\r\n# n = n - i\r\n# c += 1\r\n# break\r\n#\r\n#\r\n# print(c)\r\n\r\n\r\n#generating math statements\r\n# n = int(input())\r\n# x, y = 0, 0\r\n#\r\n# if n % 2 == 0:\r\n# x = (n / 2) + 2\r\n# y = (n / 2) - 2\r\n#\r\n# else:\r\n# x = (n // 2)\r\n# y = n - x\r\n# x = x + 2\r\n# y = y - 2\r\n#\r\n# print(x, end=\" \")\r\n# print(y, end=\" \")\r\n\r\n\r\n#bachgold problem\r\n\r\nn = int(input())\r\nm = []\r\n\r\n#generate a list of primes\r\n#find the maximun number of elements from the list of primes which sum to n\r\n\r\n\r\n#use sieve to generate a list of primes\r\n#two steps for using sieve\r\n#initalize an array\r\n#shift through the array from 2 to 11\r\n# prime = 3\r\n# primes = [i for i in range(3, 1000)]\r\n#\r\n# while prime != 11:\r\n# for i in primes:\r\n# if i % prime == 0 and i != prime:\r\n# primes.remove(i)\r\n# prime += 1\r\n\r\n#maximum number of primes which add to a number\r\nwhile n != 0:\r\n\r\n if n % 2 == 0:\r\n n = n - 2\r\n m.append(2)\r\n else:\r\n n = n - 3\r\n m.append(3)\r\n\r\nprint(len(m))\r\nm = [print(i, end=\" \") for i in m]\r\n", "n = int(input())\r\ns = [2] * (n//2)\r\nprint(n//2)\r\nif n % 2 != 0: s[-1] = 3\r\nprint(*s)", "import sys\r\nk=int(sys.stdin.readline())\r\nif k%2==0:\r\n print(k//2)\r\n print( ('2 '*(k//2))[:-1])\r\nelse:\r\n print(k//2)\r\n print( ('2 '*(k//2-1))+'3')\r\n", "n = int(input())\r\nch = (\"2 \" * (n // 2))[:-1] if n % 2 == 0 else \"2 \" * (n // 2 - 1) + \"3\"\r\nprint(len(ch.split(\" \")), ch, sep=\"\\n\")", "n = int(input())\r\n\r\nif n%2==0:\r\n print(n//2)\r\n print('2 '*(n//2))\r\nelif n==3:\r\n print(1)\r\n print(3)\r\nelse:\r\n print(n//2)\r\n print('2 '*((n//2)-1)+'3')\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n ans = n // 2\r\n print(ans)\r\n for i in range(ans):\r\n print(2,'',end=\"\")\r\nelif n == 3:\r\n print(1)\r\n print(3)\r\nelse:\r\n n = n - 3\r\n ans = n // 2\r\n print(ans+1)\r\n for i in range(ans):\r\n print(2,'',end=\"\")\r\n print(3)\r\n\r\n", "n=int(input())\r\nx=n\r\nl=[]\r\nwhile(x>=2):\r\n x-=2\r\n l.append(2)\r\nif x==1:\r\n print(len(l))\r\n print(*l[0:len(l)-1],3)\r\nelse:\r\n print(len(l))\r\n print(*l)\r\n \r\n", "n=int(input())\r\n\r\nx=int(n/2)\r\ny=int((n-(n%2))/2)\r\n\r\nprint(x)\r\n\r\nif 2<=n<=100_000:\r\n if n%2==0:\r\n for a in range(0,x):\r\n print(2, end=\" \")\r\n else:\r\n for b in range(1,y):\r\n print(2, end=\" \")\r\n print(3) \r\nelse:\r\n exit() \r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 6 13:01:48 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\nif n%2:\r\n n=n-3\r\n three=[3]\r\n two=[2 for x in range(2,(n+1),2)]\r\n res=two+three\r\nelse:\r\n two=[2 for x in range(2,(n+1),2)]\r\n res=two\r\n \r\nprint(len(res))\r\nprint(\" \".join(list(map(str,res))))", "def solve(n):\r\n result = []\r\n while n != 0:\r\n if n % 2 == 0:\r\n prime = 2\r\n else:\r\n prime = 3\r\n\r\n result.append(prime)\r\n n -= prime\r\n return result\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n solution = solve(n)\r\n print(len(solution))\r\n print(' '.join(map(str, solution)))", "def main(n):\r\n m = n // 2\r\n\r\n if n % 2 == 0:\r\n return (m, \"2 \" * m)\r\n else:\r\n return (m, \"2 \" * (m - 1) + \"3\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n a = main(n)\r\n\r\n print(a[0], a[1], sep=\"\\n\")\r\n", "n=int(input())\r\nprint(int(n/2))\r\nfor i in range(int(n/2)-1):\r\n print('2',end=' ')\r\nif n%2!=0:\r\n print('3')\r\nelse :\r\n print('2')", "x = int(input())\r\nif (x%2==0):\r\n print(x//2)\r\n for i in range(x//2):\r\n print(2 ,end=\" \")\r\nelse:\r\n m=x-3\r\n print(1+m//2)\r\n print(3,end=' ')\r\n for i in range(m//2):\r\n print(2 ,end=\" \")", "a=int(input())\r\nk=[]\r\nif a%2==1:\r\n\ta=a-3\r\n\tk.append(3)\r\ne=a//2\r\nfor i in range(e):\r\n\tk.append(2)\r\nprint(len(k))\r\nprint(*k)", "n=int(input())\r\narr=[]\r\ni=0\r\ns=0\r\nwhile(s<n):\r\n if(n-s==3):\r\n s+=3\r\n i+=1\r\n arr.append(3)\r\n else:\r\n s+=2\r\n i+=1 \r\n arr.append(2)\r\nprint(i)\r\nfor a in arr:\r\n print(a,sep=\"\",end=\" \")", "j = int(input())\r\nr = \"\"\r\nc = 0\r\nwhile j!=3 and j>0:\r\n j-=2\r\n r += \"2 \"\r\n c += 1\r\nif j==3:\r\n r += \"3\"\r\n c += 1\r\n\r\nprint(c)\r\nprint(r)\r\n", "n = int(input())\r\nmass = []\r\na = 0\r\ncnt = 0\r\nif n == 2:\r\n print(1)\r\n print(2)\r\nelse:\r\n while a != n:\r\n if n - a >= 4:\r\n a += 2\r\n mass.append(2)\r\n cnt += 1\r\n elif n - a == 2:\r\n a += 2\r\n mass.append(2)\r\n cnt += 1\r\n else:\r\n a += 3\r\n mass.append(3)\r\n cnt += 1\r\n print(cnt)\r\n print(*mass)\r\n", "a=int(input())\r\n#for even\r\nif a%2==0:\r\n k=int(a/2)\r\n s=[\"2\"]*k\r\n print(k)\r\n print(' '.join(s))\r\nelse:\r\n k1=a-3\r\n k=int(k1/2)\r\n ans=[]\r\n print(int(a/2))\r\n for i in range(k+1):\r\n if i<1:\r\n ans.append(\"3\")\r\n else:\r\n ans.append(\"2\")\r\n print(' '.join(ans))", "# your code goes here\nn=int(input())\nc=0\nif(n%2==0):\n\tc=int(n/2)\n\tprint(c)\n\tprint(\"2\",end=\"\")\n\tfor i in range(1,c):\n\t\tprint(\" 2\",end=\"\")\nelif(n==3):\n\tprint(\"1\")\n\tprint(\"3\")\nelse:\n\tc=int(n/2)\n\tprint(c)\n\tprint(\"2\",end=\"\")\n\tfor i in range(1,c-1):\n\t\tprint(\" 2\",end=\"\")\n\tprint(\" 3\")\n \t \t\t \t \t \t\t\t \t \t\t\t\t\t \t\t", "n = int(input())\nlst = []\ncnt = 0\nif n%2==0:\n cnt += int(n/2)\n print('%d' %cnt)\n for i in range(cnt):\n print('2',end=' ')\nelse:\n cnt += n//2 -1\n print('%d\\n' %(cnt+1))\n for i in range(cnt):\n print('2',end=' ')\n print('3')\n\t \t \t\t\t \t \t\t \t \t\t \t \t", "n = int(input())\n\nprime = []\n\nif n % 2 == 0:\n for i in range(n // 2):\n prime.append(2)\nelse:\n for i in range(n // 2 - 1):\n prime.append(2)\n prime.append(3)\n\nprint(len(prime))\nprint(*prime)\n", "def solve_bachgold_problem(n):\r\n # Handle special case when n is even\r\n if n % 2 == 0:\r\n k = n // 2\r\n primes = [2] * k\r\n else:\r\n # If n is odd, use 2s for the first (n-3)//2 terms, and add 3 as the last term\r\n k = (n - 3) // 2 + 1\r\n primes = [2] * (k - 1) + [3]\r\n\r\n return k, primes\r\n\r\n# Input\r\nn = int(input())\r\n\r\n# Solve the problem\r\nk, primes = solve_bachgold_problem(n)\r\n\r\n# Output\r\nprint(k)\r\nprint(*primes)\r\n", "t = int(input())\nif t % 2 == 0:\n print(t // 2)\n for i in range(t // 2):\n print(2, end=\" \")\nelse:\n print(int(t / 2))\n for i in range(int(t / 2) - 1):\n print(\"2\", end=\" \")\n print(\"3\")\n\n# while t != 0:\n# a = int(input())\n# t -= 1\n", "n = int(input())\r\nprint(n//2)\r\nfor i in range(n//2-n%2):\r\n print(2,end=\" \")\r\nif(n%2):\r\n print(3)", "n = int(input())\r\nif n % 2 == 0:\r\n twos = n // 2\r\n prime = [2] * twos\r\n print(twos)\r\n print(*prime)\r\nelse:\r\n n -= 3\r\n twos = n // 2\r\n prime = [2] * twos\r\n prime.append(3)\r\n print(twos + 1)\r\n print(*prime)\r\n", "n = int(input())\r\nans=0\r\nwhile True:\r\n n -= 2\r\n ans += 1\r\n if n == 1:\r\n print(ans)\r\n ans1 = [2]*(ans-1)\r\n ans1.append(3)\r\n print(*ans1)\r\n exit()\r\n if n == 0:\r\n print(ans)\r\n ans1 = [2]*ans\r\n print(*ans1)\r\n exit()\r\n", "n=int(input())\r\narr = [2]*(n//2)\r\narr2 = [2]*(n//2-1)+[3]*1\r\nif n%2==0:\r\n print(n//2)\r\n print(*arr)\r\nelse:\r\n print(n//2)\r\n print(*arr2)\r\n ", "n = int(input())\r\nl = []\r\n\r\nwhile n > 0:\r\n if n % 2:\r\n n -= 3\r\n l.append(3)\r\n else:\r\n n -= 2\r\n l.append(2)\r\n\r\nprint(len(l))\r\nstr1 = \"\"\r\nfor x in range(len(l)):\r\n str1 += str(l[x]) + \" \"\r\n\r\nprint(str1)", "n=int(input())\r\nlist=['2']*(n//2)\r\nif n%2!=0:\r\n list[-1]='3'\r\nprint(n//2)\r\nfor i in list:\r\n print(i,end=\" \")\r\n", "def solve(n):\r\n c=0\r\n if(n%2):\r\n n-=3\r\n c=1+n//2\r\n print(c)\r\n print(\"2 \"*(n//2),end='')\r\n print(\"3\")\r\n else:\r\n c=n//2\r\n print(c)\r\n print(\"2 \"*(n//2))\r\nsolve(int(input()))\r\n \r\n", "sample = int(input())\r\nprime_array = list()\r\n\r\nif sample % 2 == 1:\r\n prime_array.append(3)\r\n sample -= 3\r\n for iterable in range(sample // 2): prime_array.append(2)\r\nelse:\r\n for iterable in range(sample // 2): prime_array.append(2)\r\n\r\nprint(len(prime_array))\r\nprint(*prime_array, sep=\" \")\r\n", "# bachgold's conjeture :- but note that to maximie the number of terms used\r\n# if n is even, it can be represented as sum of n/2\r\n# otherwise n-3 hsa to be even and hence N can be represented as sum of 1 3 and (n-3)/2 2s\r\n\r\n\r\ndef printMaximalPrime(n):\r\n arr = []\r\n if n % 2 == 1:\r\n arr.append(3)\r\n n -= 3\r\n\r\n while n > 0:\r\n arr.append(2)\r\n n -= 2\r\n return arr\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n res = printMaximalPrime(n)\r\n print(len(res))\r\n print_res = \"\"\r\n for item in res:\r\n print_res += str(item) + \" \"\r\n print(print_res)\r\n\r\n\r\nmain()\r\n", "number = int(input())\r\nif number % 2 == 0:\r\n print(number//2)\r\n print(\"2 \"*(int(number/2)))\r\nelse:\r\n print(number//2)\r\n print(\"2 \"*(number//2-1)+\"3\")\r\n", "a=int(input())\r\nif(a%2==0):\r\n print(a//2)\r\n for i in range(a//2):\r\n if(a!=(a//2)-1):\r\n print(2,end=\" \")\r\n else:\r\n print(2)\r\nelse:\r\n b=a-3\r\n print((b//2) +1)\r\n for i in range(b//2):\r\n print(2,end=\" \")\r\n print(3)\r\n", "n = int(input())\r\nk = n//2\r\nans = ['2']*k\r\nif n%2: ans[-1] = '3'\r\nprint(k)\r\nprint(' '.join(ans))", "from sys import stdin\r\nn = int(input())\r\nprint(n//2)\r\nk = n//2\r\nout = '2 '*(k-1) \r\nif n%2 == 0:\r\n print(out+'2')\r\nelse:\r\n print(out+'3')", "n=int(input())\r\nprint(n//2)\r\nwhile(n>3):\r\n print(2,end=\" \")\r\n n-=2\r\nprint(n)", "n = int(input())\r\n\r\ndef is_even(num):\r\n if num%2==0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nif is_even(n):\r\n x = int(n/2)\r\n print(x)\r\n for i in range(0,x):\r\n print('2', end = \" \")\r\nelse:\r\n x = int(n/2)\r\n print(x)\r\n for i in range(0,x-1):\r\n print('2', end = \" \")\r\n print('3', end=\" \")", "n = int(input())\r\ncount=0\r\ncount2=0\r\nwhile(n>0):\r\n if(n==3):\r\n n-=3\r\n count2+=1\r\n else:\r\n n-=2\r\n count+=1\r\nprint(count+count2)\r\nfor i in range(count):\r\n print(2,end=\" \")\r\nif(count2):\r\n print(3)", "n = int(input())\r\n\r\nprint(n // 2)\r\n\r\nwhile n > 3:\r\n print(2, end=' ')\r\n n -= 2\r\n\r\nprint(n)\r\n", "n = int(input())\r\nch = (\"2 \" * (n // 2))[:-1] if n % 2 == 0 else \"2 \" * (n // 2 - 1) + \"3\"\r\nprint(len(ch.split(\" \")), \"\".join(ch), sep=\"\\n\")\r\n", "n = int(input())\r\ntotal = 0\r\nstr1 = \"\"\r\n\r\nwhile n > 0:\r\n if n%2 == 0:\r\n str1 += '2 '\r\n n-=2\r\n elif n%3 == 0:\r\n str1 += '3 '\r\n n-=3\r\n else:\r\n str1 += '2 '\r\n n-= 2\r\n total+=1\r\n\r\nprint(total)\r\nprint(str1)", "count = int(input())\r\na = int(count / 2)\r\nprint(a)\r\nif count % 2 == 0:\r\n print('2 ' * (a - 1) + '2')\r\nelse:\r\n print('2 ' * (a - 1) + '3')\r\n", "n = int(input())\r\nif n%2==0:\r\n res = []\r\n while(n!=0):\r\n res.append(2)\r\n n-=2 \r\n print(len(res))\r\n print(*res)\r\nelse:\r\n n = n - 1 \r\n res = []\r\n while(n!=0):\r\n n-=2 \r\n res.append(2)\r\n \r\n res = res[:-1]+[3]\r\n print(len(res))\r\n print(*res)", "a = int(input())\nans = 0\nlst = []\nwhile a > 0:\n if a == 3:\n lst.append(3)\n ans += 1\n break\n a -= 2\n ans += 1\n lst.append(2)\nprint(ans)\nprint(*lst)", "x = int(input())\r\na = \"\"\r\nif x % 2 == 0:\r\n for i in range(int(x/2)):\r\n a += \"2 \"\r\n print(int(x/2))\r\n print(a)\r\nelse:\r\n for i in range(int(x/2)-1):\r\n a += \"2 \"\r\n a += \"3\"\r\n print(int(x/2))\r\n print(a)\r\n", "n = int(input())\nl = [2] * (n >> 1)\nif n & 1:\n l[-1] = 3\nprint(len(l))\nprint(*l)\n", "n = int(input())\r\nif n%2 == 0:\r\n m = int(n/2)\r\n print(m)\r\n for i in range(m):\r\n print(2,end=' ')\r\nelse:\r\n m = int((n-1)/2)\r\n print(m)\r\n for i in range(m-1):\r\n print(2,end = \" \")\r\n print(3, end =\" \")\r\n\r\n\r\n", "a=int(input())\r\nc=0\r\nif a%2==0:\r\n print(int(a/2))\r\n print(\"2 \"*int(a/2))\r\nelse:\r\n a=a-3\r\n print(int(a/2)+1)\r\n print(\"2 \"*int(a/2)+\"3\")\r\n", "n = int(input())\r\nk = n//2\r\nif n%2&1:\r\n res = \"2 \"*(k-1)+\"3\"\r\nelse:\r\n res = \"2 \"*k\r\nprint(\"%d\\n\"%k+res)\r\n", "\r\n\r\nn=int(input())\r\nprint(n//2)\r\nl='2'\r\nif n%2==1:\r\n print(3)\r\n for i in range((n//2)-1):\r\n print(l,end=' ')\r\nelse:\r\n for i in range(n//2):\r\n print(l,end=' ')\r\n \r\n ", "n=int(input())\nh=n//2\nif(n%2==0):\n print(h)\n print('2 '*h)\nelse:\n print(h)\n print('2 '*(h-1),end='')\n print(\"3\")\n\t\t\t \t \t\t\t\t \t\t \t\t \t\t \t \t\t", "n=int(input())\r\nk = int(n/2)\r\nprint(k)\r\nif n%2==0:\r\n print('2 '*k)\r\nelse:\r\n print('2 '*(k-1)+'3 ')\r\n\r\n", "t=int(input())\nprint(t//2)\nif(t%2==0):\n\tfor i in range((t//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(2)\nelif(t%2!=0):\n\tfor i in range((t//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(3)\n \t\t\t\t\t\t\t\t \t\t \t\t\t \t\t \t\t", "a=int(input())\r\nprint(a//2)\r\nprint(\"2 \"*(a//2-1),(2)+(a%2))", "n=int(input())\r\nl=[]\r\nif n%2==0:\r\n for i in range(n//2):\r\n l.append(2)\r\nelse:\r\n for i in range((n-3)//2):\r\n l.append(2)\r\n l.append(3)\r\nprint(len(l))\r\nprint(*l)", "inpt = int(input())\r\na = inpt//2\r\nb = (inpt-3)//2\r\nif inpt%2 == 0:\r\n print(a)\r\n print('2 '*a)\r\nelif inpt%2 == 1:\r\n print(b+1)\r\n print('2 '*b+'3')", "l=[]\r\nn=int(input())\r\nnn = n//2\r\nif(n%2==0):\r\n for i in range(nn):\r\n l.append(2)\r\nelse:\r\n for i in range(nn-1):\r\n l.append(2)\r\n l.append(3)\r\nprint(len(l))\r\nprint(*l)", "n=int(input())\r\nprint(n//2)\r\na = [2]*(n//2-1)\r\nprint(*a, n % 2+2)", "n = int(input())\r\nif n % 2 == 0:\r\n l = [2 for i in range((n//2))]\r\n print(len(l))\r\n print(*l)\r\nelse:\r\n l = [2 for i in range((n//2)-1)]\r\n l.append(3) \r\n print(len(l))\r\n print(*l)", "\r\nn = int(input())\r\nprint(n//2)\r\nif(n%2)==1:\r\n print(\"2 \"*(n//2-1)+\"3\")\r\nelse:\r\n print(\"2 \"*(n//2))", "#list(map(int,input().split()))\r\nfor ib in range(1):\r\n n=int(input())\r\n if n%2==0:\r\n p=[2 for t in range(n//2)]\r\n else:\r\n p=[2 for t in range(n//2-1)]\r\n p.append(3)\r\n print(len(p))\r\n print(*p)", "n=int(input())\r\nif(n%2==0):\r\n print(n//2)\r\n for i in range (0,n//2):\r\n print(\"2\",end=\" \")\r\nelse:\r\n print((n-1)//2)\r\n for i in range (0,(n-3)//2):\r\n print(\"2\",end=\" \")\r\n print(3) ", "x=int(input())\nprint(int(x / 2))\nfor i in range(0,int(x /2)-1):\n print(\"2\", end=\" \")\nif(x%2==0):\n print(\"2\", end=\"\")\nelse:\n print(\"3\", end=\"\")\n", "n=int(input())\r\ntemp=[2]\r\ncount=0\r\nif n%2==0:\r\n while(n!=0):\r\n count+=1\r\n n=n-2\r\n print(count)\r\n print(*(temp*count))\r\nelse:\r\n while(n!=3):\r\n count+=1\r\n n-=2\r\n print(count+1)\r\n print(*(temp*count+[3]))\r\n", "num = int(input())\r\n\r\nif num % 2 == 0:\r\n count = num // 2\r\n print(count)\r\n print(\"2 \" * count)\r\nelse:\r\n count = num // 2\r\n print(count)\r\n print(\"2 \" * (count - 1) + \"3\")", "x=int(input())\r\nif x%2==1: l=[2]*(x//2-1)+[3]\r\nelse: l=[2]*(x//2)\r\nprint(len(l));print(*l)", "n = input()\nanswer = \"\"\nif int(n) < 2:\n print(\"0\")\nelif int(n) % 2 == 1:\n m = int(n) - 3\n answer = str(int(m / 2) + 1) + \"\\n\"\n answer = answer + \"3 \"\n for i in range(0, m // 2):\n answer = answer + \"2 \"\nelse:\n answer = str(int(int(n) / 2)) + \"\\n\"\n for i in range(0, int(n) // 2):\n answer = answer + \"2 \"\nprint(answer)\n", "n=int(input())\nif(n%2==0):\n print(n//2)\n for i in range(n//2):\n print('2',end=' ')\n print()\nelse:\n print(n//2)\n for i in range(n//2 -1):\n print('2',end=' ')\n print('3')\n \n\t \t\t\t\t \t \t\t\t\t \t\t \t\t\t\t \t\t \t \t", "a = int(input())\r\nc = 0\r\nr = 2\r\ne = \"\"\r\nwhile a > 0:\r\n if a - 2 == 1:\r\n a -= 3\r\n e += '3 '\r\n else:\r\n a -= 2\r\n e += \"2 \"\r\nprint(len(e.split()))\r\nprint(e)\r\n", "a = int(input())\r\nif a%2==0:\r\n print(a//2)\r\n print('2 '*(a//2))\r\nelse:\r\n print(a//2)\r\n print(('2 '*(a//2-1))+str(3))\r\n", "n = int(input())\r\nif n%2 == 0:\r\n print(int(n/2))\r\n s = \"\"\r\n for _ in range(int(n/2)):\r\n s += \"2 \"\r\n print(s[:-1])\r\n \r\nelse:\r\n print(int((n-3)/2)+1) \r\n s = \"\"\r\n for _ in range(int((n-3)/2)):\r\n s += \"2 \"\r\n s += \"3 \" \r\n print(s[:-1])", "if __name__ == '__main__':\r\n # t = int(input())\r\n for _ in range(1):\r\n n = int(input())\r\n res = []\r\n if n%2:\r\n count = 0\r\n while n!=3:\r\n count = count + 1\r\n res.append(2)\r\n n = n-2\r\n res.append(3)\r\n print(count+1)\r\n print(*res)\r\n else:\r\n print(n//2)\r\n while n:\r\n print(2,end =\" \")\r\n n = n-2\r\n print() ", "x = (n:=int(input())) // 2\r\nif(n % 2 !=0):\r\n '''\r\n print(x:=n//2)\r\n print(' '.join(['3'] + ['2'] * (x-1)))\r\n '''\r\n print(f\"{x}\\n{' '.join(['3'] + ['2'] * (x - 1))}\")\r\nelse:\r\n '''\r\n print(x:=n//2)\r\n print(' '.join(['2'] * x))\r\n '''\r\n print(f\"{x}\\n{' '.join(['2'] * x)}\")", "\r\n\r\n\r\nn = int(input())\r\n\r\nif n%2:\r\n c = 1 + (n-3)//2\r\n\r\n print(c)\r\n\r\n print(3, end = \"\")\r\n\r\n for i in range( (n-3)//2 ):\r\n print( \" \", end = \"2\" )\r\n\r\nelse:\r\n\r\n print( n//2 )\r\n\r\n for i in range( n//2):\r\n print( 2, end = \" \") \r\n", "a = int(input())\r\nif a % 2 == 0:\r\n print(a // 2)\r\n d = a // 2\r\n s = [2] * d\r\n print(*s)\r\nelse:\r\n a -= 3\r\n print(a // 2 + 1)\r\n d = a // 2\r\n\r\n s = [2] * d\r\n s += [3]\r\n print(*s)\r\n\r\n", "n = int(input())\n\n\nif n % 2 == 0:\n k = n // 2\n print(k)\n for i in range(k):\n print(2, end=' ')\n\nif n % 2 != 0:\n k = (n - 1) // 2\n print(k)\n for i in range(k-1):\n\n print(2, end=' ')\n print(3)\n", "n = int(input())\r\nlst = []\r\n\r\nif n % 2 == 0:\r\n how_many = n / 2\r\n lst = [2 for i in range(n // 2)]\r\nelse:\r\n how_many = (n - 3) / 2 + 1\r\n lst = [2 for i in range(n // 2 - 1)]\r\n lst.append(3)\r\n\r\nprint(int(how_many))\r\nfor i in lst:\r\n print(i, end = \" \")", "n = int(input())\r\nk = 0\r\npr = []\r\nif n % 2 == 0:\r\n k = n // 2\r\n for x in range(n // 2):\r\n pr.append(2)\r\nelse:\r\n k = n // 2\r\n for x in range(n // 2 - 1):\r\n pr.append(2)\r\n pr.append(3)\r\nprint(k)\r\nprint(*pr, sep=' ')\r\n", "n = int(input()); \r\n\r\nif n % 2 == 0:\r\n k = int(n/2)\r\n print(str(k), \"\\n\" + \"2 \"*(k))\r\nelse:\r\n k = int((n-1)/2)\r\n print(str(k), \"\\n\" +\"2 \"*(k-1)+\"3\")\r\n\r\n\r\n", "n = int(input())\r\nans = []\r\nif n % 2 == 0:\r\n ans = ['2'] * (n // 2)\r\nelse:\r\n ans = ['2'] * ((n // 2) - 1) + ['3']\r\nprint(len(ans))\r\nprint(' '.join(ans))", "\n\nn = int(input())\nprime_sum = []\nif n % 2 == 0:\n for i in range(n//2):\n prime_sum.append(2)\nelse:\n for i in range((n//2)-1):\n prime_sum.append(2)\n prime_sum.append(3)\nprint(len(prime_sum))\nfor k in prime_sum:\n print(k, end = \" \")\nprint()\n", "n = int(input())\r\nprint(n//2)\r\n\r\nprint(*[2]*(n//2-1), [2,3][n%2])", "n = int(input())\nout = '2 '*(n//2)\nprint(n//2)\nif n%2==0:\n print(out[:-1])\nelse:\n out = out[:-2] + '3'\n print(out)\n", "n = int(input())\r\n\r\nx = [2] * (n // 2)\r\nif n % 2 == 1:\r\n x[-1] = 3\r\n\r\nprint(len(x))\r\nprint(*x)\r\n", "n=int(input())\r\nif n%2==0:\r\n a=int(n/2)\r\n b=\"2 \"*a\r\n print(int(a))\r\n print(b.rstrip())\r\nelse:\r\n a=int((n-1)/2)\r\n b=\"2 \"*(a-1)+\"3\"\r\n print(int(a))\r\n print(b)", "n=int(input())\r\nif(n % 2 == 1):\r\n n //= 2\r\n n-=1\r\n print(n + 1)\r\n print(3,end=' ')\r\nelse:\r\n n //= 2\r\n print(n)\r\nfor i in range(n):\r\n print(2,end=' ')\r\nprint()\r\n\r\n\r\n", "n = int(input())\r\nprint(n // 2)\r\nfor i in range((n // 2) - 1):\r\n print(2, end = \" \")\r\nif n % 2 == 1:\r\n print(3)\r\nelse:\r\n print(2)\r\n", "\ndef main():\n\t\n\tn = int(input())\n\t\n\tnumPrimes = int(n / 2)\n\t\n\tprint(numPrimes)\n\t\n\tfor i in range(numPrimes):\n\t\tif (i == (numPrimes - 1)) and (n % 2 == 1):\n\t\t\tprint(\"3 \", end=\"\")\n\t\telse:\n\t\t\tprint(\"2 \", end=\"\")\n\t\n\nif __name__ == \"__main__\":\n\tmain()\n", "N = int(input())\r\nprint(N // 2)\r\nif N % 2:\r\n print(*([2] * (N // 2 - 1)), 3)\r\nelse:\r\n print(*([2] * (N // 2)))\r\n ", "x=int(input(\"\"))\r\ns=\"\"\r\nif x%2==0:\r\n for i in range(x//2):\r\n s+=\"2 \"\r\n print(x//2)\r\n print(s)\r\nelse:\r\n x=x-3\r\n for i in range(x//2):\r\n s+=\"2 \"\r\n s+=\"3\"\r\n print((x//2)+1)\r\n print(s)", "n=int(input())\r\na=[2]*(n//2)\r\nprint(n//2)\r\nif n%2==0:\r\n \r\n [print(i, end=' ') for i in a]\r\nelse:\r\n a[-1]=3 \r\n [print(i, end=' ') for i in a]", "x = int(input())\r\n\r\nprint(x//2)\r\nprint(\"2 \"*((x//2)-1), end=\"\")\r\n\r\nif x%2 == 0:\r\n print(2)\r\nelse:\r\n print(3)\r\n", "n = int(input())\r\npack = []\r\nif n % 2 == 0:\r\n x = n // 2\r\n print(x)\r\n for _ in range(x):\r\n pack.append(\"2\")\r\n print(*pack)\r\nelse:\r\n x = n // 2\r\n print(x)\r\n for _ in range(x-1):\r\n pack.append(\"2\")\r\n print(*pack, '3')", "n = int(input())\nprint(n // 2)\nprint('2 ' * (n // 2 - 1) + ('3' if n % 2 else '2'))\n", "# for _ in [0] * int(input()):\r\nnumber=int(input())\r\nif number%2==0:\r\n print(number//2)\r\n for i in range(number//2):\r\n print(2,end=' ')\r\n\r\nelse:\r\n print(number//2)\r\n for i in range(number//2-1):\r\n print(2,end=' ')\r\n print(3,end=' ')\r\n", "a = int(input())\r\nif a%2 == 0:\r\n print(int(a/2))\r\n for i in range(int(a/2)):\r\n print(2,end=' ')\r\n print('')\r\nelse:\r\n print(a//2)\r\n for i in range((a//2)-1):\r\n print(2,end=' ')\r\n print(3) ", "'''\nhttps://codeforces.com/problemset/problem/749/A\nSolution: Since we want maximum number of primes to represent n, we will use the smallest primes to build it. If n is\neven, it would have n/2 2s. If its odd, we would replace the last 2 with a 3. Since we have to also give the number of\nprimes in the result (which is n/2), we append that to the result.\n'''\ndef solve(n):\n result = [2] * int(n/2)\n if n%2 !=0:\n result[int(n/2)-1] = 3\n return str(int(n/2)) + \"\\n\" + \" \".join(str(elem) for elem in result)\n \nif __name__ == '__main__':\n n =int(input())\n print(solve(n))", "a=int(input())\nnum=a//2\nif(a%2==0):\n print(num)\n print('2 '*num)\nelse:\n print(num)\n print('2 '*(num-1),end='')\n print(\"3\")\n\t\t \t \t\t \t\t \t\t \t\t \t", "#@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\nfor _ in range(1):\r\n n,=mapin()\r\n k=n//2\r\n ans=[2 for i in range(k)]\r\n if n&1:ans[-1]=3\r\n print(k)\r\n print(*ans)", "n=int(input())\r\nprint(n//2)\r\nx=[2]*((n//2)-1)\r\nprint(*x,n%2+2)", "num = int(input())\r\nprint(num//2)\r\n\r\nwhile num > 3:\r\n print(2, ' ',end=\" \")\r\n num -=2\r\nprint(num)", "a = int(input())\r\nif a % 2 == 0:\r\n z = a // 2\r\n print(int(z))\r\n for i in range(z-1):\r\n print(2, end=\" \")\r\n print(2)\r\nelse:\r\n z = (a // 2) - 1\r\n print(z + 1)\r\n for i in range(z):\r\n print(2, end=\" \")\r\n print(3)", "a=int(input())\r\nif a%2==0:\r\n x=a//2\r\n print(a//2)\r\n y=['2']*x\r\n print(' '.join(y))\r\nelse:\r\n x=(a-3)//2\r\n print(x+1)\r\n y=['2']*x\r\n y.append('3')\r\n print(' '.join(y))", "n = int(input())\r\nif(n%2==1):\r\n n= n//2\r\n n = n-1 \r\n print(n+1,3)\r\nelse:\r\n n = n//2 \r\n print(n)\r\nfor i in range(n):\r\n print(2,end =\" \")\r\n ", "n=int(input())\nc=0\nif(n%2==0):\n c=c+n//2\n print(c)\n for x in range(c):\n print(2,end=\" \") \nelse:\n c=c+(n-3)//2 \n c=c+1 \n print(c)\n for x in range(c-1):\n print(2,end=\" \")\n print(3,end=\" \")\n \n \t\t\t \t\t \t \t \t \t\t\t \t \t\t", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\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\nn=int(input())\r\nx=n//2\r\nprint(x)\r\nif n%2==0:\r\n for i in range(x):\r\n print(2,end=' ')\r\nelse:\r\n for i in range(x-1):\r\n print(2,end=' ')\r\n print(3)", "n=int(input())\nt=n//2\ndiv=[2]*t\nif n%2==1:\n\tdiv[-1]=3\nprint(t)\nprint(*div)", "n = int(input())\nli = []\nif n%2==0:\n for i in range(n//2):\n li.append(2)\n print(len(li))\n print(*li)\n \nelse:\n for i in range(n//2-1):\n li.append(2)\n\n li.append(3)\n print(len(li))\n print(*li)\n\t\t \t\t\t \t \t \t \t \t\t\t\t \t\t", "n = int(input())\r\nprint(n//2)\r\nwhile n > 0:\r\n if n == 3:\r\n n = n - 3\r\n print(3, end=' ')\r\n if n >= 2:\r\n n = n - 2\r\n print(2, end=' ')", "m=int(input())\nprint(m//2)\nif m%2==0:\n for t in range(m//2):\n print(2,end=\" \")\nelse:\n for t in range((m//2)-1):\n print(2,end=\" \")\n print(3) \n\t \t \t\t\t\t\t\t\t \t \t\t\t\t\t \t\t \t\t\t", "l=[]\nn=int(input())\nif(n%2==0):\n for i in range(n//2):\n l.append(2)\nelif(n%2==1):\n for i in range(n//2-1):\n l.append(2)\n l.append(3)\nprint(len(l))\nprint(*l)\n \t \t\t \t \t \t\t\t\t\t\t\t\t\t \t \t \t \t\t", "n=int(input())\r\nif n % 2 == 0:\r\n print(n//2)\r\n print(*list('2'*(n//2)))\r\nelse:\r\n print(n//2)\r\n print(*list('2'*(n//2-1)+'3'))\r\n", "n = int(input())\r\nprint(n//2)\r\nprint('2 '*(n//2) if n%2==0 else ('2 '*(n//2-1))+'3')", "def bach_gold(n):\r\n count = 0\r\n if n % 2 == 0:\r\n count += n / 2\r\n print(int(count))\r\n print(str(\"2 \" * int(count)))\r\n else:\r\n count += (n - 1) / 2\r\n print(int(count))\r\n print(str(\"2 \") * int(count - 1) + str(\"3\"))\r\n\r\n\r\nn = int(input())\r\nbach_gold(n)\r\n", "n=int(input())\r\nif n%2==0:\r\n z=int(n/2)\r\n s1=\"2 \"*z\r\n print(z)\r\n print(s1)\r\nelse :\r\n z=int((n-3)/2)\r\n s1=\"2 \"*z\r\n print(z+1)\r\n print(s1+\"3\")", "def prime(n):\r\n for i in range(2,n):\r\n if n%i==0:\r\n return(False)\r\n return(True)\r\n\r\ni = int(input())\r\n\r\nr = []\r\n\r\nif i > 1:\r\n if i%2!=0:\r\n r.append(3)\r\n i -= 3\r\n while i!=0:\r\n r.append(2)\r\n i -= 2\r\nprint(len(r))\r\nprint(*r)\r\n\r\n\r\n", "n = int(input())\r\nif n % 2:\r\n a = [3] + [2] * ((n - 3) // 2)\r\nelse:\r\n a = '2' * (n // 2)\r\nprint(len(a))\r\nprint(' '.join(map(str, a)))", "n = int(input())\r\n\r\nk = n//2\r\nprint(k)\r\nif n%2==0:\r\n print(\"2 \"*(n//2))\r\nelse:\r\n print(\"2 \"*(k-1) + \"3\")\r\n\r\n", "n = int(input())\r\nd = n\r\na = []\r\nif n%2 ==0:\r\n a = [2]*(n//2)\r\nelse:\r\n a = [2]*((n-3)//2)\r\n a.append(3)\r\n \r\nprint(len(a))\r\nfor k in a:\r\n print(k,end=' ')", "a=int(input())\r\nn=a//2-a%2\r\nqwe=[str(2) for h in range (n) ]\r\nif a%2==1:\r\n qwe.append(3)\r\nprint (len(qwe))\r\nprint (*qwe)\r\n ", "n=int(input())\r\nprint(n//2)\r\nfor i in range(n//2 if n%2==0 else n//2-1):\r\n\tprint('2 ',end=\"\")\r\nif n%2==1:\r\n\tprint('3')", "a = int(input())\r\n \r\nprint(a//2)\r\n \r\nif (a%2==0):\r\n for i in range(int(a/2-1)):\r\n print(\"2 \")\r\n \r\n print(\"2\\n\")\r\n \r\nif(a%2==1):\r\n for i in range(int(a/2-1)):\r\n print(\"2 \")\r\n \r\n print(\"3\\n\")", "while True:\r\n try:\r\n n = int(input())\r\n a = 0\r\n if n % 2 == 0:\r\n shu = int(n / 2)\r\n print(shu)\r\n str1 = \"\"\r\n for i in range(0, shu):\r\n if i == 0:\r\n str1 = '2'\r\n else:\r\n str1 = str1 + ' ' + '2';\r\n print(str1)\r\n else:\r\n m = n - 1\r\n shu = int(m / 2)\r\n print(shu)\r\n str1 = \"\"\r\n for i in range(0, shu):\r\n if i != shu - 1:\r\n str1 = str1 + '2' + ' '\r\n else:\r\n str1 += '3'\r\n print(str1)\r\n except:\r\n break", "n = int(input())\r\n\r\na = n//2 - 1\r\nb = n%2\r\n\r\nprint(a+1)\r\n\r\nif b == 0:\r\n char = '2'\r\nelse:\r\n char = '3'\r\nprint('2 '* a + char)\r\n", "q=int(input())\r\nk=q//2\r\nprint(k)\r\ns=(k-1)*'2' +'3'\r\nif q%2!=0: print(' '.join(s))\r\nelse: print(' '.join(k*'2'))", "a=int(input())\r\nif a % 2 == 0: print(a//2); print(*([2]*(a//2)))\r\nelse: print(a//2); print(*([2]*(a//2-1)+[3]))", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nn=int(input())\nif n%2==0:\n print(n//2)\n print('2 '*(n//2))\nelse:\n k=(n-1)//2\n print(k)\n print('2 '*(k-1),end='')\n print('3')", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\n\r\n#import os\r\n#import sys\r\nfrom math import *\r\n#import re\r\n#import random\r\n#sys.set_int_max_str_digits(int(1e9))\r\n\r\n\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n n = int(input())\r\n ans = [2]*(n//2 - 1) + [3 if(n%2) else 2]\r\n print(n//2)\r\n print(*ans)\r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "if __name__ == \"__main__\":\n\tnum = int(input())\n\tres = []\n\tcnt = 0\n\tif num % 2 == 1:\n\t\tres.append(3)\n\t\tnum -= 3\n\t\tcnt += 1\n\twhile num:\n\t\tres.append(2)\n\t\tcnt += 1\n\t\tnum -= 2\n\tprint(cnt)\n\tfor i in res:\n\t\tprint(i, end = ' ')\n\t\t\t\t \t\t \t \t \t\t \t\t\t\t \t \t\t", "n = int(input())\r\n\r\n# Max possible number of primes in the representation\r\nk = n // 2\r\nprint(k)\r\n\r\nprimes = [2] * k\r\nif n % 2 != 0:\r\n primes[-1] = 3 # If n is odd, replace the last `2` with a `3`\r\n\r\nprint(' '.join(map(str, primes)))\r\n# for x in primes:\r\n# print(x, end=\" \")\r\n", "chisl = int(input())\r\nif chisl % 2 == 0:\r\n print(chisl//2)\r\n print(*list(map(int,chisl//2*\"2\")))\r\nelse:\r\n print(chisl//2)\r\n listok = list(map(int,(chisl//2-1)*\"2\"))\r\n listok.append(3)\r\n print(*listok)", "n=int(input())\nprint(n//2)\nfor i in range(n//2-1):\n print(2,end=\" \")\nprint(2+n%2)\n", "num=int(input())\r\nprint(num//2)\r\nif num%2==0:\r\n print('2 ' * (num//2))\r\nelse:\r\n print('3','2 ' * ((num-3)//2), end = ' ')", "k=int(input())\nprint(k//2)\nif k%2==0:\n for t in range(k//2):\n print(2,end=\" \")\nelse:\n for t in range((k//2)-1):\n print(2,end=\" \")\n print(3)\n\t\t \t\t \t\t\t\t\t\t \t \t \t \t \t \t \t", "x = int(input())\r\n\r\nans = []\r\n\r\nif x%2 == 1:\r\n ans.append(3)\r\n x -= 3\r\nwhile x > 0:\r\n ans.append(2)\r\n x -= 2\r\n \r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i], end= \" \")", "def solve(n):\r\n if n % 2 == 1:\r\n n //= 2\r\n n -= 1\r\n print(n + 1)\r\n print(3, end=\" \")\r\n else:\r\n n //= 2\r\n print(n)\r\n for _ in range(n):\r\n print(2, end=\" \")\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n solve(n)\r\n", "n=int(input())\r\nif n%2==0:\r\n print(n//2)\r\n print('2 '*(int(n/2)-1),end='')\r\n print('2')\r\nelse:\r\n print(int(n//2))\r\n print('2 '*(int(n//2)-1),end='')\r\n print('3')", "n = int(input())\n\ndef solve(n):\n if n % 2 == 0:\n k = int(n/2)\n ans = '2 '*k\n else:\n k = int((n-3)/2)\n ans = '2 '*k\n ans = '3 ' + ans \n k += 1\n\n print(k)\n print(ans)\n\nsolve(n)", "a=int(input())\r\nif a%2==0:\r\n print(a//2)\r\n str=''\r\n n=a/2\r\n while n>1:\r\n str+='2 '\r\n n-=1\r\n str+='2'\r\nelse:\r\n print((a-3)//2+1)\r\n str=''\r\n n=(a-3)/2\r\n while n > 0:\r\n str += '2 '\r\n n -= 1\r\n str += '3'\r\nprint(str)", "n = int(input())\r\nx = (n//2) - 1*n%2\r\ny = n%2\r\nprint(x+y)\r\nprint(x*'2 '+y*'3 ')", "n = int(input())\r\n\r\nif n%2:\r\n print(n//2)\r\n for j in range(0, n//2 - 1):\r\n print(2, end = \" \")\r\n print(3)\r\nelse:\r\n print(n//2)\r\n for j in range(0, n//2):\r\n print(2, end = \" \")", "m=int(input())\nx=m//2\nif(m%2==0):\n print(x)\n print('2 '*x)\nelse:\n print(x)\n print('2 '*(x-1),end='')\n print(\"3\")\n\t\t\t\t\t \t \t \t\t\t \t \t \t \t", "n=int(input())\r\nif n&1==0:\r\n print(int(n/2))\r\n for i in range(int(n/2)):\r\n print(2,end=\" \")\r\n print()\r\nelse:\r\n k=n//2\r\n print(k)\r\n for i in range(k-1):\r\n print(2,end=\" \")\r\n print(3)", "num = int(input(\"\"))\r\nmax_possible = num//2\r\n\r\nif num%2 == 0:\r\n prime_num_lst = [\"2\"]*max_possible\r\nelse:\r\n prime_num_lst = [\"2\"]*(max_possible-1)\r\n prime_num_lst.append(\"3\")\r\n\r\nprint(max_possible)\r\nprint(*prime_num_lst)", "n = int(input())\r\nprime = [2,3,5,7]\r\ni=0\r\n\r\nstack = []\r\ns = 0\r\n\r\nwhile s<n:\r\n if s+prime[i]>n:\r\n s -= stack.pop()\r\n i+=1\r\n continue\r\n s+=prime[i]\r\n stack.append(prime[i])\r\n if s==n:\r\n print(len(stack))\r\n print(*stack)\r\n break", "n=int(input())\np=n//2\ns=[2 for k in range(p)]\nif n%2!=0:\n s[-1]=3\nprint(len(s))\nprint(*s)\n \n\t\t\t\t\t \t\t \t \t \t \t\t \t\t\t \t\t\t \t\t", "n=int(input())\r\na=0\r\nd=list()\r\nwhile(a!=n):\r\n if((n-a)!=3):\r\n a+=2\r\n d.append(2)\r\n else:\r\n a+=3\r\n d.append(3)\r\nprint(len(d))\r\nfor i in d:\r\n print(i,end=' ')", "n=int(input())\r\nans1=n//2\r\nif (n%2==0):\r\n print(ans1)\r\n for x in range(0,ans1):\r\n print(2,end=\" \")\r\nelse:\r\n print(ans1)\r\n for x in range(0,ans1-1):\r\n print(2,end=\" \")\r\n print(3)", "x = int(input())\r\nif (x%2==0):\r\n print(x//2)\r\n print('2 '*(x//2))\r\nelse:\r\n m=x-3\r\n print(1+m//2)\r\n print('3',end=' ')\r\n print('2 ' *(m//2))", "t=int(input())\r\nif t%2==0:\r\n print(t//2)\r\n for i in range(t//2):\r\n print(2,end=\" \")\r\n print()\r\nelse:\r\n print(t//2)\r\n for i in range(t//2-1):\r\n print(2,end=\" \")\r\n print(3)\r\n", "n=int(input()) \nlist=[] \nif (n%2==1): \n list.append(3)\n n-=3\nwhile (n>0):\n list.append(2)\n n-=2\nprint(len(list))\nprint(*list)\n\n \t \t\t \t \t\t\t \t\t\t\t\t \t \t", "n=int(input())\nif n%2==0:\n a=n//2\n b=[2]*a\n print(a)\n for i in b:\n print(i,end=' ')\nelse:\n a=n//2-1\n b=[2]*a\n print(a+1)\n for i in b:\n print(i,end=' ')\n print(3)\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\ntotal = 0\r\nn = n_\r\nif n_ % 2 != 0:\r\n n -= 3\r\n total = 1\r\ntotal += n // 2\r\nprint(total)\r\nif n_ % 2 != 0:\r\n print('3 ' + '2 ' * (total - 1))\r\nelse:\r\n print('2 ' * total)", "def main():\r\n primes(int(input()))\r\n\r\ndef primes(num):\r\n res = []\r\n total = 0\r\n while total != num:\r\n if (total + 2) <= num:\r\n total += 2\r\n res.append(2)\r\n else:\r\n prev = res.pop()\r\n total -= prev\r\n total += 3\r\n res.append(3)\r\n print(len(res))\r\n print(' '.join(map(str, res)))\r\n\r\nmain()", "n = int(input())\r\nif n % 2 == 1:\r\n n = int(n / 2) - 1\r\n print(n + 1, \"\\n\", 3, sep = \"\", end = \" \")\r\nelse:\r\n n = int(n / 2)\r\n print(n)\r\nfor i in range(n):\r\n print(2, end = \" \")\r\nprint()", "v1=int(input())\r\nw=v1//2\r\nw1=v1%2\r\nif w1 == 1:\r\n w=w-1\r\n w1=w1+2\r\n print(w+1)\r\n for i in range(w):\r\n print(2,end=\" \")\r\n if w1 !=0:\r\n print(w1) \r\nelse:\r\n print(w+w1)\r\n for i in range(w):\r\n print(2,end=\" \")\r\n if w1 !=0:\r\n print(w1) ", "n=int(input())\r\nif n%2==0:\r\n\tk=n//2\r\n\tprint(k)\r\n\tprint(\"2 \"*k)\r\nelse:\r\n\tk=(n//2)-1\r\n\tprint(k+1)\r\n\tif k>0:\r\n\t\tprint(\"2 \"*k,end=\"\")\r\n\tprint(3)", "\r\ndef solve():\r\n nj = int(input())\r\n \r\n print(nj//2)\r\n \r\n if (nj%2==0):\r\n for i in range(int(nj/2-1)):\r\n print(\"2 \")\r\n \r\n print(\"2\\n\")\r\n \r\n if(nj%2==1):\r\n for i in range(int(nj/2-1)):\r\n print(\"2 \")\r\n \r\n print(\"3\\n\")\r\n\r\nsolve()", "n = int(input())\r\n\r\nc = n // 2\r\n\r\nprint(c)\r\n\r\nif n % 2 == 0:\r\n print(\"2 \" * c)\r\nelse:\r\n print(\"2 \" * (c - 1) + '3')", "n=int(input())\r\nans=[]\r\nfor i in range(n//2-1):\r\n ans.append(2)\r\nif n%2==0:\r\n ans.append(2)\r\nelse:\r\n ans.append(3)\r\nprint(len(ans))\r\nprint(*ans)", "n=int(input())\nif n%2==0:\n print(n//2)\n for i in range(n//2):\n print(\"2\",end=\" \")\nelse:\n a = n-3\n print(a//2+1)\n for i in range(a//2):\n print(\"2\",end=\" \")\n print(\"3\")", "n = int(input())\r\nprint(n // 2)\r\ntwo = n // 2 if n % 2 == 0 else n // 2 - 1\r\nthree = 0 if n % 2 == 0 else 1\r\narr = [\"2\" for i in range(two)] + [\"3\" for i in range(three)]\r\nprint(\" \".join(arr))", "n=int(input())\r\nif n%2==0:\r\n print(n//2)\r\n s='2 '*(n//2)\r\n print(s)\r\nelse:\r\n print(1+(n-3)//2)\r\n k='2 '*((n-3)//2)\r\n k+='3'\r\n print(k)", "n = int(input())\r\na = []\r\nif n % 2 == 0:\r\n b = n // 2\r\n print(b)\r\n print(b * \"2 \")\r\nelif n % 2 != 0:\r\n c = n // 2\r\n d = n % 2\r\n e = c - d\r\n print(c)\r\n print(e * \"2 \" + d * \"3\")\r\n", "a=int(input())\nc=a//2\nprint(c)\nif a%2==1:\n for i in range(c-1):\n print(2,end=\" \")\n print(3)\nelse:\n for i in range(c-1):\n print(2,end=\" \")\n print(2)\n \n\n\t\t \t\t\t \t \t \t \t \t\t \t \t\t \t\t\t", "n=int(input())\r\nif n%2==0:\r\n print(int(n/2))\r\n for i in range(0,int(n/2)):\r\n print(2,end=' ')\r\nelse:\r\n print(int(n/2))\r\n for i in range(0,int(n/2)):\r\n if i==int(n/2-1):\r\n print(3)\r\n else:\r\n print(2,end=' ')\r\n ", "n=int(input())\r\nh=n//2\r\nprint(h)\r\nr=[2]*h\r\nif n&1:\r\n r[-1]=3\r\nprint(*r)\r\n", "n=int(input())\r\nif n%2==0:\r\n print(int(n/2))\r\n for j in range(0,int(n/2)):\r\n print(2,end=' ')\r\nelse:\r\n print(int((n-3)/2+1))\r\n while n!=3:\r\n n=n-2\r\n print(2,end=' ')\r\n print(3)\r\nprint()", "n = int(input())\r\n\r\nif n == 3:\r\n print(1)\r\n print(3)\r\nelif n % 2 == 0:\r\n print(n//2)\r\n print(' '.join(map(str, [2 for _ in range(n//2)])))\r\nelif n % 2 != 0:\r\n arr = [3] + [2 for i in range((n-3) // 2)]\r\n print(len(arr))\r\n print(' '.join(map(str, arr)))", "import math\r\nn=int(input())\r\nif n%2==0:\r\n print(n//2)\r\n ans=[2]*(n//2)\r\n print(*ans, sep=' ')\r\nelse:\r\n v=math.floor(n/2)\r\n print(v)\r\n ans=[2]*(v-1)\r\n ans.append(3)\r\n print(*ans, sep=' ')", "s=int(input())\r\nif(s%2==0):\r\n m=s//2\r\n print(m)\r\n for i in range(m):\r\n print(\"2\",end=\" \")\r\nelse:\r\n m=s//2\r\n print(m)\r\n for i in range(m-1):\r\n print(\"2\",end=\" \")\r\n print(\" 3\")", "\r\n\r\n\r\ndef bachgold():\r\n\r\n\r\n n = int(input())\r\n\r\n \r\n if n == 3:\r\n print(1)\r\n print(3)\r\n else:\r\n k = n // 2\r\n\r\n\r\n print(k)\r\n\r\n\r\n for _ in range(k - 1 if n % 2 == 1 else k):\r\n print(2,end=' ')\r\n \r\n if n % 2 == 1:\r\n print(3)\r\n\r\n\r\nbachgold()\r\n", "n = int(input())\nres = [2 for _ in range(n // 2)]\nif n & 1 == 1:\n res[-1] += 1\nprint(len(res))\nprint(*res)\n", "# 749A\r\n\r\n# We are given a prime number.\r\n# We need to determine how many sets of 2 and 3 can sum to that number.\r\n# The answer is the largest set of 2s and 3s.\r\n\r\n# For example:\r\n # input is 6.\r\n # You can make 6 from:\r\n # 3 + 3\r\n # 2 + 2 + 2\r\n \r\n # Because 2 + 2 + 2 uses more total numbers, that is our answer.\r\n\r\n# I think the solution is as follows:\r\n # Even numbers: just divide by 2, that's the number of 2s we need.\r\n # Odd numbers: subtract 3 and then divide by 2.\r\n \r\nprimeNumber = int(input())\r\n\r\nnumberOfNumbers = 0\r\noutputString = \"\"\r\n\r\nif primeNumber % 2 == 0:\r\n numberOfNumbers = primeNumber // 2\r\n outputString = [\"2\"]*numberOfNumbers\r\n \r\nelse:\r\n numberOfNumbers = ((primeNumber-3) // 2) + 1\r\n outputString = [\"2\"]*(numberOfNumbers-1)\r\n outputString.append(\"3\")\r\n \r\noutputString = \" \".join(outputString)\r\n\r\nprint(numberOfNumbers)\r\nprint(outputString)\r\n ", "n=int(input())\r\nif n%2==0:\r\n nn=n//2\r\n print(nn)\r\n for i in range(nn):\r\n print(2,end=\" \")\r\nelse:\r\n nn=n//2\r\n print(nn)\r\n for i in range(nn-1):\r\n print(2,end=\" \")\r\n print(3)", "n=int(input())\r\n\r\nif(n%2 ==0):\r\n k=n//2\r\n print(k)\r\n print(\"2 \"*k)\r\nelse:\r\n k=(n-1)//2\r\n print(k)\r\n print(\"2 \"*(k-1)+\"3\")\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\nq, r = divmod(n, 2)\r\nprint(q)\r\nprint('2 ' * (q - 1) + ('3' if r else '2'))", "n = int(input())\n\nif n % 2 == 0:\n count = n // 2\n result = ''.join(str(2) + ' ' for _ in range(count))\nelse:\n count = (n - 3) // 2\n result = ''.join(str(2) + ' ' for _ in range(count))\n count += 1\n result = result + '3'\n\nprint(count)\nprint(result)", "i = int(input())\r\nif i %2==0:\r\n m=int((i/2))\r\n print(m)\r\n print(('2 '*m).strip())\r\nif i%2!=0:\r\n m=int(i//2)\r\n print(m)\r\n out=' 2'*(m-1)+' 3'\r\n print(out.strip())", "n = int(input())\r\na = int(n/2)\r\nprint(a)\r\nb = []\r\nfor i in range(a):\r\n if n>=2 and n!=3:\r\n b.append(\"2\")\r\n elif n == 3:\r\n b.append(\"3\")\r\n n = n -2\r\nc = \" \".join(b)\r\nprint(c)", "a = int(input())\r\nif a%2==0:\r\n print(a//2)\r\n print('2 '*(a//2))\r\nelse:\r\n print((a-3)//2+1)\r\n print('3', end = ' ')\r\n print('2 '*((a-3)//2))", "import math\r\nn = int(input(\"\"))\r\np = n/2\r\nif int(p) == p:\r\n print(int(p))\r\n x = \"2 \" * int(p)\r\n print(x)\r\nelse:\r\n n = n -3\r\n print(int(n/2)+1)\r\n x = \"2 \" * int(n/2)\r\n x = x + \"3 \"\r\n print(x)", "n=int(input())\r\nif(n%2==0):\r\n print(n//2)\r\n print('2 '*(n//2))\r\nelse:\r\n print(((n-2)//2)+1)\r\n print('2 '*(((n-2)//2)) + \"3\") ", "\nn=int(input());print(n//2,\"\\n\",\"2 \"*(n//2-1),2+n%2)\n\n \t\t \t\t\t \t \t\t \t\t", "m=int(input())\nif m%2!=0:\n print(m//2)\n print('2 '*(m//2-1)+'3')\nelse:\n print(m//2)\n print('2 '*(m//2))\n \t \t\t\t\t \t\t \t \t \t\t \t\t\t \t", "k = int(input())\r\nl = []\r\nif k % 2 == 0:\r\n for i in range(k // 2):\r\n l.append(\"2\")\r\nelse:\r\n if k >= 5:\r\n l.append(\"2\")\r\n l.append(\"3\")\r\n k -= 5\r\n if k % 2 == 0:\r\n for i in range(k // 2):\r\n l.append('2')\r\n elif k == 3:\r\n l.append('3')\r\nprint(len(l))\r\nprint(\" \".join(l))", "j = int(input())\r\nk = j//2\r\nif j%2 == 0:\r\n print(k)\r\n print(k*'2 ')\r\nelse:\r\n print(k)\r\n print('2 '*(k-1)+' '+'3')", "n=int(input())\r\nl=[2 for i in range(n//2)]\r\nif(n%2==1):\r\n l[len(l)-1]=3\r\nprint(len(l))\r\nprint(*l)", "a = int(input())\r\ncount = 0\r\nv = []\r\nwhile a > 1:\r\n a -= 2\r\n v.append('2')\r\n count += 1\r\nprint(count)\r\nif a == 1:\r\n v.pop(-1)\r\n v.append('3')\r\nprint(' '.join(v))\r\n", "n = int(input())\n\nif n%2 == 0:\n print(n//2)\n for i in range(n//2):\n print(\"2\" ,sep=\" \")\nelse:\n print(n//2)\n for i in range((n//2)-1):\n print(\"2\",sep=\" \")\n print(\"3\")", "def prime_checker(n):\r\n if n == 1 or n == 0:\r\n return False\r\n prime = True\r\n for i in range(2, n):\r\n if n%i == 0:\r\n prime = False\r\n break\r\n \r\n return prime\r\n\r\nn = int(input())\r\ntemp = n\r\nwhile not (prime_checker(n - temp) and temp%2 == 0):\r\n temp -= 1\r\ntwos_and_other_primes = [2]*int(temp/2)\r\ntwos_and_other_primes.append(n-temp)\r\n\r\nprint(len(twos_and_other_primes))\r\nprint(*twos_and_other_primes, sep=\" \")", "n = int(input())\r\ncount = 0\r\nl = []\r\nwhile(n>0):\r\n count += 1\r\n if n==3:\r\n n -= 3\r\n l.append(3)\r\n else:\r\n n-=2\r\n l.append(2)\r\nprint(count)\r\nprint(*l)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' '):\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef solve():\r\n n = int(input())\r\n print(n >> 1)\r\n if n % 2:\r\n print('2 ' * (n // 2 - 1) + '3')\r\n else:\r\n print('2 ' * (n // 2))\r\n\r\ndef main():\r\n t = 1 #int(input())\r\n for _ in range(t):\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x=int(input())\r\nif x%2!=0:\r\n k=(x//2)\r\n print(k)\r\n print(\"2 \"*(k-1)+\"3\")\r\nelse:\r\n k=x//2\r\n print(k)\r\n print(\"2 \"*k)\r\n", "n = int(input())\nprint(n//2)\nif (n -3 ) % 2 == 0:\n print( \"2 \"* (n // 2 - 1),3,sep='')\nelse:\n print(\"2 \" * (n //2 ))\n", "n=int(input())\r\nif n%2==0:\r\n print(n//2)\r\n t=[]\r\n for i in range(n//2):\r\n t.append(2)\r\nelse:\r\n print(n//2)\r\n t=[]\r\n for i in range((n//2)-1):\r\n t.append(2)\r\n t.append(3)\r\nprint(*t)\r\n", "n = int(input())\r\nif not n%2:\r\n print(n//2)\r\n print('2 '* (n//2))\r\nelse:\r\n k = (n-3)//2\r\n print(k+1)\r\n print('2 '* k +'3')", "n = int(input())\r\nm = int(n/2)\r\nprint(m)\r\nif n%2 != 0:\r\n print(\"2 \"*(m-1) + \"3\")\r\nelse:\r\n print(\"2 \"*m)\r\n", "num = int(input())\r\nif num % 2:\r\n lst = []\r\n print((num - 3) // 2 + 1)\r\n for i in range((num - 3) // 2):\r\n lst.append(2)\r\n lst.append(3)\r\n for i in lst:\r\n print(i, end=\" \")\r\nelse:\r\n lst = []\r\n print(num // 2)\r\n for i in range(num // 2):\r\n lst.append(2)\r\n for i in lst:\r\n print(i, end=\" \")", "n=int(input())\r\nif n%2==0:\r\n print(n//2,'\\n'+'2 '*(n//2))\r\nelse:\r\n print(n//2)\r\n print(3,'2 '*(n//2-1))", "s=int(input())\nprint(s//2)\nif(s%2==0):\n\tfor i in range((s//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(2)\nelif(s%2!=0):\n\tfor i in range((s//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(3)\n \t\t\t\t \t \t\t \t \t\t \t\t \t\t", "n= int(input())\r\nif n%2==0:\r\n c= int(n/2)\r\n print(c)\r\n for i in range(c):\r\n print(2, end=\" \")\r\nelse:\r\n c= int(n/2)\r\n print(c)\r\n for i in range(c-1):\r\n print(2, end=\" \")\r\n print(3)", "n=int(input())\r\nprint(int(n//2))\r\nfor _ in range(int(n//2)-1):\r\n print(\"2 \", end=\"\")\r\nif n%2==1: print(\"3\")\r\nelse: print(\"2\")", "n=int(input())\nc=n//2\nif(n%2==0):\n print(c)\n print('2 '*c)\nelse:\n print(c)\n print('2 '*(c-1),end='')\n print(\"3\")\n\t\t\t\t\t\t\t\t \t\t \t\t\t\t \t \t\t", "i=int(input())\r\nif i%2==0:\r\n print(int(i/2))\r\n for x in range(0,int(i/2)):\r\n print(2,end=\" \")\r\nelse:\r\n j=i-3\r\n print(1+(int(j/2)))\r\n for i in range(0,int(j/2)):\r\n print(2,end=\" \")\r\n print(3)", "n = int(input())\r\nprint((n - (2 + (n % 2))) // 2 + 1)\r\nprint(2 + (n % 2), '2 ' * ((n - (2 + (n % 2))) // 2))", "n = int(input())\nif n%2==0:\n print(int(n/2))\n for i in range(int(n/2)-1):\n print(2,end=' ')\n print(2)\nelse:\n print(int(n/2))\n for i in range(int(n/2)-1):\n print(2,end=' ')\n print(3)\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\ntemp=n\r\nans=[2]*(n//2)\r\nif n%2==1:\r\n ans[-1]=3\r\nprint(len(ans))\r\nprint(*ans) \r\n \r\n", "value = int(input())\r\n\r\nlength = value // 2\r\n\r\nif(value % 2 == 0):\r\n\tprint(length)\r\n\tfor _ in range(length):\r\n\t\tprint(2,end=\" \")\r\nelse:\r\n\tprint(length)\r\n\tfor _ in range(length - 1 ):\r\n\t\tprint(2,end=\" \")\r\n\tprint(3)", "n=int(input());print(n//2)\r\nprint(\"2 \"*(n//2-1),n%2+2)\r\n", "n = int(input())\nif n % 2 == 0:\n print(n//2)\n print(*[2 for i in range(n//2)])\nelse:\n if n == 3: \n print(1,3, sep = '\\n')\n else: \n print((n-3)//2 + 1)\n print(*[2 for i in range((n-3)//2)], 3)\n", "x=int(input())\r\nb=int(x//2)\r\nprint(int(x//2))\r\nif x%2==0:\r\n print(*list(('2')*b))\r\nelse:\r\n print(*list(('2')*(b-1)),3)", "n = int(input())\r\nk = n//2\r\nm = []\r\nfor i in range(k):\r\n m.append(2)\r\nif n%2==0:\r\n print(k)\r\n print(*m)\r\nelse:\r\n m[-1] = 3\r\n print(k)\r\n print(*m)", "# cook your dish here\nn = int(input())\nprint(n//2)\nfor i in range((n//2)-1):\n print(2,end = ' ')\nif n % 2== 0:\n print(2)\nelse:\n print(3)\n ", "n = int(input())\r\ndef solve( n) :\r\n k = 0\r\n if n % 2 == 0 :\r\n k = int(n / 2) \r\n print(k)\r\n for i in range(1 , k + 1) :\r\n print(2 , end=\" \")\r\n else :\r\n k = int( (n - 3) / 2) \r\n print(k + 1)\r\n for i in range(1 , k + 1) :\r\n print(2 , end= \" \")\r\n print(3)\r\n\r\nsolve(n)", "def Batchgold_Problelm(x):\r\n f = []\r\n c = 0\r\n if x %2 == 0:\r\n for i in range(int(x/2)):\r\n f.append(2)\r\n c+=1\r\n else :\r\n if x == 3 :\r\n f.append(3)\r\n c+=1\r\n else :\r\n for i in range(int(x/2)-1):\r\n \r\n f.append(2)\r\n c+=1\r\n f.append(3)\r\n c+=1\r\n \r\n return f,c\r\n\r\nx = int(input())\r\nf, c = Batchgold_Problelm(x)\r\nprint(c)\r\nfor i in range(len(f)):\r\n print(f[i], end = ' ')", "n = int(input())\r\ncnt = 0\r\nif n // 2 == n/2:\r\n print(n//2)\r\n print(' '.join(str(i) for i in [2]*(n//2)))\r\nelse:\r\n print(n//2)\r\n print(' '.join(str(i) for i in [3]+[2]*((n//2)-1)))", "# 코드포스 749A Bachgold Problem\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn = int(put())\r\n\r\nif n % 2:\r\n answer = ['2'] * (n // 2 - 1) + ['3']\r\nelse:\r\n answer = ['2'] * (n // 2)\r\nk = len(answer)\r\n\r\nprint(k)\r\nprint(' '.join(answer))", "import math\r\nimport sys\r\n\r\nii = lambda: int(sys.stdin.readline())\r\nimi = lambda: map(int,sys.stdin.readline().strip().split())\r\niil = lambda: [int(i) for i in sys.stdin.readline().split()]\r\nistr = lambda: sys.stdin.readline()\r\nims = lambda: sys.stdin.readline().split()\r\nisl = lambda: [(i) for i in sys.stdin.readline().split()]\r\n\r\nMOD = 1000000007\r\n\r\ndef solve():\r\n n = ii()\r\n \r\n if n%2==0:\r\n print(n//2)\r\n print(\"2 \"*(n//2))\r\n else:\r\n print((n-3)//2+1)\r\n print(\"2 \"*((n-3)//2)+\"3\")\r\n\r\n \r\n\r\nfor _ in range(1):\r\n solve()", "n = int(input())\r\n\r\ncnt = 0\r\n\r\nif n%2==0:\r\n cnt = int(n/2)\r\n print(cnt)\r\n for i in range(cnt):\r\n print(2,end=' ')\r\n print()\r\nelse:\r\n cnt = n//2 -1\r\n print(cnt+1)\r\n for i in range(cnt):\r\n print(2,end=' ')\r\n print(3)", "n = int(input())\r\nimport math\r\nif n%2 != 0:\r\n num = int(n/2)\r\n print(num)\r\n for i in range(num-1):\r\n print(2, end=\" \")\r\n print(3)\r\nelse:\r\n num = math.ceil(n/2)\r\n print(num)\r\n for i in range(num):\r\n print(2, end=\" \")", "def solve(n):\r\n\r\n result = [2] * int(n/2)\r\n if n % 2 != 0:\r\n result[int(n/2)-1] = 3\r\n\r\n return str(int(n/2)) + \"\\n\" + \" \".join(str(elem) for elem in result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n = int(input())\r\n print(solve(n))\r\n \r\n", "x = int(input())\nz = 0\nc = 0\nwhile x > 0:\n if x > 3:\n x -= 2\n z += 1\n elif x == 3:\n x -= 3\n c += 1\n else:\n x -= 2\n z += 1\nprint(z+c)\nprint('2 ' * z + '3' * c)", "n=int(input())\r\na=[]\r\nif(n%2==1):\r\n a.append(3)\r\n n-=3\r\nwhile(n>0):\r\n a.append(2)\r\n n-=2\r\nprint(len(a))\r\nfor i in a:\r\n print(i,end=' ')", "k = int(input())\r\nc = int(0)\r\nif k % 2 != 0:\r\n c = k % 2\r\nk = int((k - (c * 3)) / 2)\r\nprint(k + c)\r\nfor i in range(0, k):\r\n print(2, end=\" \")\r\nfor i in range(0, c):\r\n print(3)", "\r\n\r\nk = int(input())\r\nif k==3:\r\n print(1)\r\n print(*list([3]))\r\nelse:\r\n cnt=0\r\n list1 = []\r\n if(k%2==0):\r\n list1 = [2]*(k//2)\r\n print(k//2)\r\n print(*list1)\r\n else:\r\n while k>0:\r\n if(k>3):\r\n k-=2\r\n cnt+=1\r\n list1.append(2)\r\n else:\r\n k-=3\r\n list1.append(3)\r\n cnt+=1\r\n print(cnt)\r\n print(*list1)", "a=int(input())\nb=[]\nfor i in range(a//2):\n b.append(2)\nif a%2!=0:\n b[-1]=3\nprint(len(b))\nprint(*b)\n \t \t \t \t \t\t \t \t \t \t\t", "def eratosthenes(n):\r\n sieve = list(range(n + 1))\r\n sieve[1] = 0\r\n for i in sieve:\r\n if i > 1:\r\n for j in range(i + i, len(sieve), i):\r\n sieve[j] = 0\r\n sieve1 = [x for x in sieve if x != 0]\r\n return sieve1\r\n\r\nlst = eratosthenes(100005)\r\nsize = len(lst)\r\nn = int(input())\r\nout = list()\r\nres = 0\r\ni = 0\r\nwhile (n > 0):\r\n\tif (n - lst[i] > 1 or n - lst[i] == 0):\r\n\t\tn -= lst[i]\r\n\t\tres += 1\r\n\t\tout.append(lst[i])\r\n\telse:\r\n\t\ti += 1\r\nprint(res)\r\nprint(*out)", "a = int(input())\n\nl=[]\nt = a//2\n\nif a%2 ==1:\n \n \n for i in range(t-1):\n l.append(2)\n l.append(3)\n\nelse:\n for i in range(t):\n l.append(2)\n\nprint(t)\nprint(*l)", "x = int(input())\r\nif x % 2 == 0:\r\n k = x // 2\r\n a = [\"2\"]*k\r\nelse:\r\n k = 1 + (x-3)//2\r\n a = [\"2\"]*(k-1) + [\"3\"]\r\nprint(k)\r\nprint(\" \".join(a))\r\n", "def bachgoldProblem():\r\n n = int(input())\r\n count = n//2\r\n if(n%2==0):\r\n print(count)\r\n for i in range(count):\r\n print(2, end=' ')\r\n else:\r\n print(count)\r\n for i in range(count-1):\r\n print(2, end=' ')\r\n print(3)\r\n return\r\nbachgoldProblem()", "n=int(input())\r\nl=[]\r\nif n%2==0:\r\n x=n//2\r\n print(x)\r\n print(\"2 \"*x)\r\nelse:\r\n n-=3\r\n x=n//2\r\n print(x+1)\r\n print(\"2 \"*x,3, sep=\"\")\r\n", "n = int(input())\r\nd = int(n/2)\r\ntwos = d-(n%2)\r\nprint(d)\r\nfor _ in range(twos):\r\n print(2, end=\" \")\r\nif n%2!=0:\r\n print(3)", "n = int(input())\r\nr = \"\"\r\nk = 0\r\ncheck = True\r\nif(n % 2 == 0):\r\n k = int(n / 2)\r\n r = \"2 \" * k\r\nelse:\r\n k = int((n - 3) / 2) + 1\r\n r = \"3 \" + \"2 \" * (k - 1)\r\nprint(k)\r\nprint(r)", "a = int(input())\r\nif a%2 == 0:\r\n k = a//2\r\n str1 = ''\r\n for i in range(k):\r\n str1+='2'+' '\r\n print(k)\r\n print(str1)\r\nelse:\r\n k = a//2\r\n str2 = ''\r\n for i in range(k-1):\r\n str2+='2'+' '\r\n print(k)\r\n print(str2+'3')\r\n\r\n\r\n\r\n", "def solve(n):\r\n primes_sum = []\r\n while n > 1:\r\n if n == 3:\r\n primes_sum.append(3)\r\n break\r\n else:\r\n primes_sum.append(2)\r\n n -= 2\r\n return primes_sum\r\n\r\nn = int(input())\r\nprimes_sum = solve(n)\r\nprint(len(primes_sum))\r\nprint(*primes_sum)\r\n", "import math\r\nn = int(input())\r\nz=n/2\r\nif n%2 == 0:\r\n print(int(z))\r\n print('2 '*int(z))\r\nelse:\r\n print(math.floor(z))\r\n print('2 '*(math.floor(z)-1),end=\"\")\r\n print(3)\r\n \r\n", "num=int(input())\r\nlist1=[]\r\nif num%2==0:\r\n print(num//2)\r\n for i in range(num//2):\r\n list1.append(\"2\")\r\n print(\" \".join(list1))\r\nelse:\r\n print(num//2)\r\n for i in range(num//2-1):\r\n list1.append(\"2\")\r\n print(\" \".join(list1)+\" 3\") ", "n = int(input())\r\n\r\nprint(f'{((n-3)//2)+1}\\n'+'2 '*((n-3)//2) + '3') if (n %\r\n 2 != 0) else print(f'{n//2}\\n'+'2 '*(n//2))\r\n", "n=int(input())\r\nprint(n//2)\r\nfor i in range(n//2-1):\r\n print(2, end=' ')\r\nprint(3)if(n&1)else print(2)", "N=int(input())\nx=N//2\nif(N%2==0):\n print(x)\n print('2 '*x)\nelse:\n print(x)\n print('2 '*(x-1),end='')\n print(\"3\")\n \t \t\t \t \t\t\t\t \t \t\t \t\t \t\t \t \t\t", "# open a bit: x | (1 << bit index)\r\n# close a bit: x & ~(1 << bit index)\r\n# flib a bit: x ^ (1 << bit index)\r\n\r\nn = int(input())\r\nc = n//2\r\nprint(c)\r\nif n%2 == 0:\r\n l = [2]*c\r\n print(*l)\r\nelse:\r\n l = [2]*(c-1)\r\n print(*l,\"3\")\r\n", "n = int(input())\r\n\r\nif not n%2: l = [2 for _ in range(n//2)];print(len(l));print(*l)\r\nelse: l=([2 for _ in range(n//2 -1)]+[3]);print(len(l));print(*l)", "def main():\r\n n = int(input())\r\n print(n // 2)\r\n print('2 ' * (n // 2 - 1), 2 + n % 2, sep='')\r\n\r\n\r\nmain()\r\n", "n=int(input())\r\nl=n//2-n%2\r\nprint(l+n%2)\r\nprint(*[2]*l+[3]*(n%2))", "n=int(input())\na=n//2\nprint(a)\nif n&1:\n for i in range(a-1):\n print(2,end=\" \")\n print(3)\n\nelse:\n for i in range(a):\n print(2,end=\" \")\n ", "n=int(input())\r\nprint(n>>1)\r\nif n&1==0:\r\n print(*([2]*(n//2)))\r\nelse:\r\n print(*([2]*(n//2-1))+[3])", "k=int(input())\r\ns=[]\r\nj=''\r\nif k%2==1:\r\n k-=3\r\n s.append(3)\r\nwhile k-2>=0:\r\n s.append(2)\r\n k-=2\r\n\r\nfor i in s:\r\n j+=(str(i)+' ' )\r\nprint(len(s),'\\n'+j)\r\n", "n = int(input())\r\nk = n // 2\r\nprint(k)\r\nprint(\"2 \"*(k-1),n %2 +2,sep = \"\")", "num=int(input())\nk=num//2\nif(num%2==0):\n print(k)\n print('2 '*k)\nelse:\n print(k)\n print('2 '*(k-1),end='')\n print('3')\n\n\t \t \t\t \t\t\t \t \t\t\t\t \t\t \t", "s=int(input())\r\nif s%2==0:\r\n print(s//2)\r\n for i in range(s//2):\r\n print(2,end=\" \")\r\nelse:\r\n print(s//2)\r\n for i in range(-1+s//2):\r\n print(2,end=\" \")\r\n print(3)", "a=int(input())\r\nif a%2!=0 and a>3:\r\n print(a//2)\r\n print(*[2]*(a//2-1),3)\r\nelif a==3:\r\n print(1)\r\n print(3)\r\nelse:\r\n print(a//2)\r\n print(*[2]*(a//2))", "import math \r\ndef bachgold(n):\r\n if n%2==0:\r\n return n//2\r\n else:\r\n return (n//2)-1\r\nt=int(input())\r\nmeg=bachgold(t)\r\nalist=[]\r\nif t%2==0:\r\n for j in range(meg):\r\n alist.append(2)\r\nelse:\r\n for j in range(meg):\r\n alist.append(2)\r\n alist.append(3)\r\nprint(len(alist))\r\nfor j in alist:\r\n print(j,end=\" \")", "a = int(input())\r\nprint(a//2)\r\nif a % 2 == 1:\r\n print(3, end=\" \")\r\n a-=3\r\nfor i in range(a // 2):\r\n print(2, end=\" \")", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n print(n // 2)\r\n res = [2] * (n // 2)\r\n print(*res)\r\nelse:\r\n print(((n - 3) // 2) + 1)\r\n res = [2] * ((n - 3) // 2) + [3]\r\n print(*res)\r\n", "n = int(input())\nprint(n // 2)\nif n & 1:\n print(*([2] * (n // 2 - 1) + [3]))\nelse:\n print(*([2] * (n // 2)))\n# Sat Nov 27 2021 11:28:09 GMT+0000 (Coordinated Universal Time)\n", "n = int(input())\r\na = []\r\nif n % 2 == 0:\r\n for i in range(n//2):\r\n a.append(2)\r\nelse:\r\n n=n-1\r\n for i in range(n//2-1):\r\n a.append(2)\r\n else:\r\n a.append(3)\r\nprint(len(a))\r\nfor i in a:\r\n print(i,end=\" \")", "from cmath import inf\r\nfrom re import T, X\r\nimport math\r\nfrom tkinter import N\r\n\r\n\r\ndef swap(a,b):\r\n a = a^b\r\n b = a^b\r\n a = a^b\r\n return a,b\r\n # call using a,b = swap(a,b)\r\ndef even(a):\r\n if a&1:\r\n return False\r\n return True\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef lcm(x, y):\r\n lcm = (x*y) // gcd(x,y)\r\n return lcm\r\n\r\n# it will return index of \"key\" in \"sorted list\". \r\ndef BS_elemPosi(low, high, key, li): \r\n while low<high:\r\n mid = (low+high)//2\r\n if li[mid]<=key:\r\n low = mid+1\r\n else:\r\n high = mid\r\n return low\r\n \r\n###########################(CODE)##################################\r\n# I/P: k\r\n# O/p\r\n# n no.s\r\n# max no. of prime no.s whose sum == k\r\n\r\nk = int(input())\r\nif k%2==0:\r\n s = \"\"\r\n s = \"2 \"*(k//2)\r\n s.strip(\" \")\r\nelse: \r\n s = \"\"\r\n s = \"2 \"*(k//2 - 1)\r\n s+=\"3\"\r\n \r\nprint(k//2)\r\nprint(s)\r\n\r\n\r\n\r\n\r\n#####################################################################", "zahl = int(input())\r\n\r\nprint(zahl//2)\r\n \r\nif zahl%2 == 0:\r\n losung = [\"2\"]*(zahl//2)\r\nelse:\r\n losung = [\"2\"]*(zahl//2-1) + [3]\r\nprint(*losung)\r\n", "num = int(input())\r\nif num%2 == 0:\r\n print(num//2)\r\n for i in range(num//2):\r\n print(2,end=' ')\r\nelse:\r\n print(num//2)\r\n for i in range(num//2-1):\r\n print(2,end=\" \")\r\n print(3)\r\n\r\n", "n = int(input())\r\nprint(n//2)\r\nfor i in range(n//2): print('3' if i==n//2-1 and n%2!=0 else '2', end=' ')", "n = eval(input())\r\nt = 0\r\nt_2 = 0\r\nt_3 = 0\r\nif n % 2 == 0:\r\n t = n//2\r\n t_2 = n//2\r\nelse:\r\n t_3 = 1\r\n n -= 3\r\n t_2 = n//2\r\n t = t_3+t_2\r\nprint(t)\r\nfor i in range(t_2):\r\n print(2, end=' ')\r\nif t_3 == 1:\r\n print(3)\r\n", "n = int(input())\r\nmax_primes = n // 2\r\nprint(max_primes)\r\nif n % 2 == 0:\r\n print(' '.join(['2'] * max_primes))\r\nelse:\r\n print(' '.join(['2'] * (max_primes-1)),'3')\r\n\r\n\r\n", "n = int(input())\nif n == 3:\n print(1)\n print(3)\n exit()\nif n % 2 == 0:\n print(n // 2)\n for i in range(n // 2):\n print(2, end=' ')\nelse:\n a = (n - 3) // 2\n print(a + 1)\n for i in range(a):\n print(2, end=' ')\n print(3)\n\n", "n=int(input())\r\nif n%2==0:\r\n\tprint(int(n/2))\r\n\tprint(\"2 \"*int(n/2))\r\nelse:\r\n\tprint(int(n//2))\r\n\tprint(\"2 \"*(int(n//2)-1)+\"3\")", "n=int(input())\r\na=n\r\nk=0\r\nm=[]\r\nif n%2==0:\r\n while a!=0:\r\n a-=2\r\n m.append(2)\r\n print(n//2)\r\n print(*m)\r\nelse:\r\n while a!=3:\r\n a-=2\r\n m.append(2)\r\n k+=1\r\n m.append(3)\r\n print(k+1)\r\n print(*m)", "\r\n\r\nfrom sys import stdin\r\n\r\ndef get_input():\r\n return int(input())\r\n\r\n\r\ndef get_primes(n):\r\n if n % 2 == 0:\r\n return [2] * (n // 2)\r\n\r\n return [2] * ((n - 3) // 2) + [3]\r\n\r\nprimes = get_primes(get_input())\r\nprint(f'{len(primes)}\\n{\" \".join(map(str, primes))}')\r\n", "import math\r\n\r\nnum = int(input())\r\narr = \"\"\r\nlenz = 0\r\n\r\nif num % 2 == 0:\r\n lenz = int(num/2)\r\n for i in range(lenz):\r\n if i != lenz - 1:\r\n arr += \"2 \"\r\n else:\r\n arr += \"2\"\r\nelse:\r\n lenz = math.floor(num/2)\r\n lenz2 = math.floor(num/2) - 1\r\n while lenz2 > 0:\r\n arr += \"2 \"\r\n lenz2 -= 1\r\n \r\n arr += \"3\"\r\n\r\nprint(lenz)\r\nprint(arr)", "n = int(input())\r\nif n % 2 == 0:\r\n answer = list('2' * (n // 2))\r\n print(len(answer))\r\n print(*answer)\r\nelse:\r\n answer = list('2' * (n // 2 - 1))\r\n answer.append('3')\r\n print(len(answer))\r\n print(*answer)", "# https://codeforces.com/problemset/problem/749/A\r\ninteger = int( input() );\r\n\r\nif integer % 2 == 0:\r\n print(integer // 2); print( '2 ' * (integer // 2));\r\nelse:\r\n print( (integer - 1) // 2); print( '2 ' * (integer // 2 - 1) + '3');\r\n", "def primesum(n):\n listt = []\n if ( n % 2 == 1):\n listt.append(3)\n n -= 3\n\n while (n>0):\n listt.append(2)\n n -= 2\n print(len(listt))\n print(*listt)\n\n\nn = int(input())\nprimesum(n)\n \t \t \t\t \t \t \t \t \t \t\t\t", "a=int(input())\r\nc=0\r\nn=[]\r\nif a %2==0:\r\n c+=a//2\r\n for i in range(c):\r\n n.append(2)\r\nelse:\r\n a-=3\r\n c+=a//2+1\r\n for i in range(c-1):\r\n n.append(2)\r\n n.append(3)\r\nprint(c)\r\nprint(*n) ", "total = 0\r\nnum = int(input())\r\nif num%2 == 0:\r\n print(int(num/2))\r\n print('2 '*(int(num/2)))\r\nelse:\r\n print(int(num//2))\r\n print('2 '*(int(num/2)-1)+'3')\r\n", "n = int(input())\r\nres = n // 2\r\na = [2] * (n//2)\r\nif n % 2 != 0:\r\n a[-1] = 3\r\nprint(res)\r\nprint(*a)", "a=int(input())\nprint(a//2)\nwhile a>3:\n print('2 ')\n a-=2\nprint(a)\n\t \t\t \t \t \t \t\t \t \t\t", "n=int(input())\ncnt=n//2\nif(n%2==0):\n print(cnt)\n print('2 '*cnt)\nelse:\n print(cnt)\n print('2 '*(cnt-1),end=\" \")\n print('3')\n\n\t \t \t \t\t\t\t\t\t\t\t\t \t\t \t\t\t\t \t\t \t\t", "a = int(input())\r\nif a % 2 == 0:\r\n b = int(a / 2)\r\n print(b)\r\n print(\"2 \" * b, end = \"\")\r\nelse:\r\n a = a - 1\r\n b = int(a / 2)\r\n print(b)\r\n c = \"2 \" * (b - 1)\r\n d = \"3\"\r\n print( c + d)", "def baghold(num):\r\n arr = []\r\n if num % 2 == 0:\r\n print(num // 2)\r\n arr = ['2' for i in range(num // 2)]\r\n print(' '.join(arr))\r\n else:\r\n print(num // 2)\r\n arr = ['2' for i in range(num // 2 -1)]\r\n arr.append('3')\r\n print(' '.join(arr))\r\nbaghold(int(input()))\r\n\r\n", "#749A - Bachgold Problem\r\nn=int(input())\r\na=n//2\r\nprint(a)\r\nif n%2==0:\r\n print(*([2]*a))\r\nelse:\r\n print(*([2]*(a-1)+[3]))", "a=int(input()); print(a//2,\"\\n\",\"2 \"*(a//2-1),2+a%2)", "n=int(input())\ncount=0\nlist0=[]\nwhile(1):\n if n==2 or n==3:\n print(count+1)\n list0.append(n)\n print(\" \".join(str(x) for x in list0))\n break\n else:\n n-=2\n count+=1\n list0.append(2)\n \t\t \t \t \t\t \t \t\t \t\t \t \t\t", "# A. Bachgold Problem\r\nn = int(input())\r\nif n % 2 == 0:\r\n d = int(n / 2)\r\n print(d)\r\n print(str(\"2 \") * d)\r\nelse:\r\n d = n - 3\r\n print(int((d / 2) + 1))\r\n print(str(\"2 \") * int((d /2)) ,\"3\")\r\n", "def get_prime_list(num):\r\n d=[]\r\n for x in range(2,num+1):\r\n for gg in range(2,x):\r\n if x%gg==0:break\r\n else:d.append(gg)\r\n d.remove(2)\r\n return d\r\n\r\n\r\ndef check_prime_num(num):\r\n flag=True\r\n if num>1:\r\n for x in range(2,num):\r\n if num%x == 0:\r\n flag=False\r\n break\r\n else:flag=True\r\n else:flag=False\r\n return flag\r\n\r\n\r\nc=0\r\n\r\nn=int(input())\r\n\r\nif n%2==0:\r\n d = []\r\n\r\n a = int(n / 2)\r\n for x in range(a):\r\n d.append(2)\r\n print(a)\r\n print(*d)\r\nelse:\r\n d = []\r\n\r\n a = int((n - 1) / 2)\r\n for x in range(a-1):\r\n d.append(2)\r\n d.append(3)\r\n print(len(d))\r\n print(*d)\r\n\r\n\r\n", "n = int(input())\r\n\r\nif not n % 2:\r\n print(n // 2)\r\n print(*[2 for _ in range(n // 2)])\r\nelse:\r\n print(1 + (n - 3) // 2)\r\n print(3, *[2 for _ in range((n - 3) // 2)])", "t=int(input())\r\nif t%2==0:\r\n x = t//2 \r\n print(x)\r\n for i in range(x):\r\n print(2,end=\" \")\r\nelse:\r\n x = t//2 \r\n print(x)\r\n for i in range(x):\r\n if i==0:\r\n print(3,end=\" \")\r\n else:\r\n print(2,end=\" \")", "\"\"\"\nA. Bachgold Problem: greedy, implementation, math, number theory\n\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nBachgold problem is very easy to formulate. Given a positive integer n represent it as a sum of maximum possible number of prime numbers.\nOne can prove that such representation exists for any integer greater than 1.\nRecall that integer k is called prime if it is greater than 1 and has exactly two positive integer divisors — 1 and k.\n\nInput\nThe only line of the input contains a single integer n (2 ≤ n ≤ 100000).\n\nOutput\nThe first line of the output contains a single integer k — maximum possible number of primes in representation.\nThe second line should contain k primes with their sum equal to n. You can print them in any order.\nIf there are several optimal solution, print any of them.\n\"\"\"\n\ndef bachgold_problem():\n n = int(input())\n k = n // 2\n print(k)\n if n % 2 == 0:\n print('2 ' * (k - 1) + '2')\n else:\n print('2 ' * (k - 1) + '3')\n\nif __name__ == '__main__':\n bachgold_problem()", "x=int(input())\r\nif (x%2==0):\r\n print(int(x/2))\r\n for i in range(int(x/2)):\r\n print(2,end=\" \")\r\nelse:\r\n print(int(x/2))\r\n for i in range(int(x/2)-1):\r\n print(2,end=\" \") \r\n print(3) ", "n = int(input())\r\nk = n//2\r\nprint(k)\r\nif bool(n%2):\r\n\tprint(*([2]*(k-1)),3)\r\nelse:\r\n\tprint(*([2]*k))", "n = int(input())\r\n\r\nprint(n//2)\r\n\r\nif (n%2==0):\r\n for i in range(int(n/2-1)):\r\n print(\"2 \")\r\n \r\n print(\"2\\n\")\r\n \r\nif(n%2==1):\r\n for i in range(int(n/2-1)):\r\n print(\"2 \")\r\n \r\n print(\"3\\n\")", "n=int(input())\nc=n//2\nif(n%2==0):\n print(c)\n for i in range(c):\n print(\"2\",end=' ')\nelse:\n if n%2!=0:\n print(c)\n for i in range(c-1):\n print(\"2\",end=' ')\n print(3)\n \t\t\t\t\t \t\t \t\t\t\t \t \t \t\t \t\t\t \t\t", "m=int(input())\nprint(m//2)\nif(m%2==0):\n\tfor i in range((m//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(2)\nelif(m%2!=0):\n\tfor i in range((m//2)-1):\n\t\tprint(2,end=\" \")\n\tprint(3)\n \t\t \t\t \t\t\t\t \t \t\t\t\t\t \t\t", "n = int(input())\r\n# arr = list(map(int, input().split()))\r\nans = []\r\n\r\nif n % 2 == 0:\r\n ans = [2 for _ in range(n // 2)]\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n ans = [2 for _ in range((n // 2)-1)] + [3]\r\n print(len(ans))\r\n print(*ans)", "n=int(input())\r\nbackupn=n\r\n\r\nmaxprime=0\r\nb=[0]*(n+1)\r\nc=[0]\r\nwhile n!=0:\r\n\r\n n1=n\r\n for i in range(2,n1+1):\r\n\r\n prime=True\r\n for j in range(2,i):\r\n if i%j==0:\r\n prime=False\r\n break\r\n\r\n if prime:\r\n if n%i==0:\r\n b[i]+=n//i\r\n maxprime+=n//i\r\n n=0\r\n break\r\n elif n%i==1:\r\n b[i]+=(n//i)-1\r\n maxprime+=(n//i)-1\r\n n=(n%i)+i #start from 3 not 2\r\n else:\r\n b[i]+=n//i\r\n maxprime+=n//i\r\n n=n%i #start from 2 once again\r\n break\r\n\r\nprint(maxprime)\r\nfor i in range(1,backupn+1,1):\r\n if b[i]!=0:\r\n for j in range(b[i]):\r\n print(i,end=' ')\r\n", "num=int(input())\r\n\r\nans=\"\"\r\ncoun=0\r\nif num%2==1:\r\n ans=\"3 \"\r\n coun=1\r\n num=num-3\r\n\r\ncount=num//2\r\n\r\nwhile count!=0:\r\n coun=coun+1\r\n ans=ans+\"2\"+\" \"\r\n count=count-1\r\nprint(coun)\r\nprint(ans)", "n=int(input())\r\nprint(int(n/2))\r\nif n%2==0:\r\n even=[]\r\n for i in range(int(n/2)):\r\n even.append(\"2\")\r\n print(' '.join(map(str,even)))\r\nelse:\r\n odd=[]\r\n for i in range(int(n/2)-1):\r\n odd.append(\"2\")\r\n odd.append(\"3\")\r\n print(' '.join(map(str,odd)))\r\n", "# Emiliano Cabrera Ruiz\n# Diego Corrales Pinedo\n# Andrew Dunkerley Vera\n\ndef main():\n n = int(input())\n result = []\n\n if(n % 2 == 0):\n n //= 2\n print(n)\n else:\n n //= 2\n n -= 1\n print(n+1)\n result.append(3)\n \n for i in range(n):\n result.append(2)\n\n result.sort()\n\n print(\" \".join(map(str,result)))\n\nmain()\n \t \t\t \t \t \t \t\t \t\t\t\t \t \t", "n=int(input())\r\ntotal=0\r\narray=None\r\nif n%2==0:\r\n total=n//2\r\n array=[2]*(n//2)\r\nelse:\r\n array=[2]*(n//2-1)+[3]\r\n total=len(array)\r\nprint(total)\r\nprint(' '.join([str(k) for k in array]))", "n = int(input())\r\na = n\r\nre = \"\"\r\nif n % 2 == 0:\r\n for i in range(n // 2):\r\n re += \"2 \"\r\nelif n % 2 != 0:\r\n n = n-3\r\n for i in range(n // 2):\r\n re += \"2 \"\r\n re += \"3\"\r\nprint(a//2)\r\nprint(re.rstrip())", "num = int(input())\r\n\r\ntwos = \"2 \" * ((num//2)-1)\r\n\r\nif num % 2 == 0:\r\n twos += \"2\"\r\nelse:\r\n twos += \"3\"\r\n\r\nprint(num//2)\r\nprint(twos)", "n = int(input())\r\n\r\n\r\nif n % 2 == 0:\r\n k = n // 2\r\n primes = [2] * k\r\n\r\nelse:\r\n k = (n - 3) // 2 + 1\r\n primes = [2] * (k - 1) + [3]\r\n\r\nprint(k)\r\nprint(*primes)\r\n", "n=int(input())\r\nif(n&1):\r\n print((n-3)//2+1)\r\n cnt=(n-3)//2\r\n for i in range(cnt):\r\n print(2,end=' ')\r\n print(3)\r\nelse :\r\n print(n//2)\r\n cnt=n//2\r\n for i in range(cnt):\r\n print(2,end=' ')", "n = int(input())\r\nif n%2==0:\r\n print(n//2)\r\n for i in range(0,n//2):\r\n print(2,end=\" \")\r\n print()\r\nelse:\r\n yo=(n-3)//2\r\n print(yo+1)\r\n for i in range(0,yo):\r\n print(2,end=\" \")\r\n print(3)\r\n", "k = int(input())\r\ns = []\r\nif k % 2 == 0:\r\n for i in range(k // 2):\r\n s.append(2)\r\nelse:\r\n for i in range(k // 2 - 1):\r\n s.append(2)\r\n s.append(3)\r\nprint(len(s))\r\nprint(*s)\r\n", "z=0\r\nn=int(input())\r\nif n%2==0:\r\n print(n//2)\r\n print('2 '*(n//2),end='')\r\nelse:\r\n while n%2!=0:\r\n n=n-3\r\n z=z+1\r\n print(z+(n//2))\r\n print('2 '*(n//2),end='')\r\n print('3 '*z,end='')", "a = int(input())\r\nend = ''\r\nif a % 2 == 0:\r\n print(a // 2)\r\nelse:\r\n print(a //2)\r\nwhile a > 3:\r\n a = a - 2\r\n end += '2 '\r\nif a == 3:\r\n end += '3 '\r\nelif a == 2:\r\n end += '2 '\r\nprint(end)\r\n ", "n=int(input())\nx=n//2\nif(n%2==0):\n print(x)\n print('2 '*x)\nelse:\n print(x)\n print('2 '*(x-1),end='')\n print(\"3\")\n\t \t\t\t \t\t\t \t \t \t\t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n num = int(input().rstrip())\r\n n = num // 2\r\n output(str(n) + '\\n')\r\n if num % 2 == 1:\r\n for j in range(n-1):\r\n output('2 ')\r\n output('3')\r\n else:\r\n for j in range(n):\r\n output('2 ')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "i = int(input())\r\nprint(i//2)\r\nl = [2]*((i//2)-(i%2)) + [3]*(i%2)\r\nprint(*l)", "r=int(input());print(r//2,\"\\r\",\"2 \"*(r//2-1),2+r%2)", "k=int(input())\r\nl=[]\r\nfor i in range(k//2):\r\n l.append(2)\r\nif k%2==0:\r\n print(len(l))\r\n print(*l)\r\nelse:\r\n l[-1]=3\r\n print(len(l))\r\n print(*l)", "#@Techcoder\r\nimport sys\r\nimport os.path\r\nimport math\r\nimport heapq\r\nimport copy\r\nfrom sys import stdin,stdout\r\nfrom collections import*\r\nfrom math import gcd,ceil,floor\r\nfrom bisect import bisect\r\nmod = int(1e9+7)\r\n##sys.setrecursionlimit(10**8)\r\n##input=sys.stdin.readline\r\n\r\nif os.path.exists('Updated prg/Input3d.txt'):\r\n sys.stdout=open(\"Updated prg/Output3d.txt\",\"w\")\r\n sys.stdin=open(\"Updated prg/Input3d.txt\",\"r\")\r\n \r\ndef sinp():return input()\r\ndef ninp():return int(sinp())\r\ndef mapinp():return map(int,sinp().split())\r\ndef smapinp():return map(str,sinp().split())\r\ndef linp():return list(mapinp())\r\ndef sl():return list(sinp().split())\r\ndef prnt(a):print(a)\r\ndef prntl(a):print(a,end=\" \")\r\ndef prntlist(l1) : print(*l1)\r\ndef power(n): return 1<<n\r\n\r\n#simple math\r\ndef sieve(n):\r\n numbers=[1]*(n+1)\r\n primes=[]\r\n a=int(math.sqrt(n))\r\n for i in range(2,a+1):\r\n if numbers[i]==1:\r\n for j in range(i*i,n+1,i):\r\n numbers[j]=0\r\n for i in range(2,n+1):\r\n if numbers[i]==1:\r\n primes.append(i)\r\n return primes\r\n#print(sieve(5))\r\nn=ninp()\r\nif n%2==0:\r\n prnt(n//2)\r\n s1=(str(2)*(n//2))\r\n for i in s1:\r\n prntl(i)\r\nelse:\r\n prnt(n//2)\r\n s1=str(2)*(n//2)\r\n a=s1.index('2')\r\n s1=s1.replace(s1[a],'3',1)\r\n s1=s1[::-1]\r\n for i in s1:\r\n prntl(i)", "from sys import stdin, stdout\r\nfrom collections import Counter, deque\r\nfrom heapq import *\r\nfrom math import *\r\nfrom itertools import permutations, combinations, accumulate\r\nfrom functools import reduce\r\n\r\ninput_int = lambda: int(stdin.readline())\r\ninput_ints = lambda: map(int, stdin.readline().split())\r\ninput_array = lambda: list(input_ints())\r\ninput_str = lambda: stdin.readline()[:-1]\r\n\r\nn = input_int()\r\nif n % 2 == 0:\r\n stdout.write(f'{n // 2}\\n')\r\n stdout.write(f'{\"2 \" * (n // 2)}')\r\nelse:\r\n stdout.write(f'{((n - 3) // 2) + 1}\\n')\r\n stdout.write(f'{\"2 \" * ((n - 3) // 2)}3')\r\n", "k=int(input())\r\nlist1=[]\r\nif k%2==0:\r\n for i in range(k//2):\r\n list1.append('2')\r\nelse:\r\n for i in range(0,k//2 -1):\r\n list1.append('2')\r\n list1.append('3')\r\nprint(k//2)\r\nprint(\" \".join(list1))", "# 749A\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\nn = num_inp()\r\nprint(n//2)\r\nprint(\"2 \"*((n-2)//2),end=\"\")\r\nif(n%2==0):\r\n print(\"2\")\r\nelse:\r\n print(\"3\")", "n = int(input())\r\nif n % 2 == 0 :\r\n print(int(n / 2))\r\n a = int(n / 2)\r\n s = ''\r\n for i in range(a):\r\n s += \"2 \"\r\n print(s)\r\nelse:\r\n print(int(n / 2))\r\n a = int(n / 2) - 1\r\n s = ''\r\n for i in range(a):\r\n s += \"2 \"\r\n print(s + \"3\")", "def prime(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n i = 3\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 2\r\n return n > 1\r\n\r\nn = int(input())\r\nc = 0\r\ns = ''\r\nif n % 2 == 1:\r\n s = ' 3'\r\n n -= 3\r\n c = 1\r\n\r\nfor _ in range(n//2):\r\n s += ' 2'\r\n c += 1\r\n\r\nprint(c)\r\nprint(s.strip())\r\n", "num = int(input())\r\n\r\ncnt = num // 2\r\nprint(cnt)\r\n\r\nres = num % 2\r\n\r\nprimes = []\r\n\r\ni = 1\r\nwhile i < cnt:\r\n primes.append(2)\r\n i += 1\r\n\r\nprimes.append(res + 2)\r\n\r\nprint(' '.join(str(p) for p in primes))", "n = int(input())\r\n\r\nif n % 2 == 0:\r\n cnt = n // 2\r\n li = [2 for i in range(cnt)]\r\nelse:\r\n cnt = (n - 3) // 2\r\n li = [2 for i in range(cnt)]\r\n li.append(3)\r\n cnt += 1\r\n \r\nprint(cnt)\r\nfor i in range(len(li)):\r\n print(li[i], end = ' ')", "def prime():\r\n k = int(input())\r\n prime_count = int(k / 2)\r\n\r\n print(prime_count)\r\n\r\n if k % 2 == 0:\r\n while prime_count > 0:\r\n print(\"2\", end=\" \")\r\n prime_count -= 1\r\n else:\r\n while prime_count > 1:\r\n print(\"2\", end=\" \")\r\n prime_count -= 1\r\n else:\r\n print(\"3\", end=\" \")\r\n\r\n\r\nprime()", "x=int(input())\r\nprint(x//2)\r\nif x%2==0:\r\n for i in range (x//2):\r\n print(2,end=\" \")\r\nelse:\r\n y=x-3\r\n for p in range (y//2):\r\n print(2,end=' ')\r\n print(3)", "\n\nif __name__ == '__main__':\n # n = int(input())\n # a = list(map(int, input().split(' ')))\n # x, y = 0, 0\n # count = 0\n # while count < n:\n # num = max(a[0], a[-1])\n # print(x)\n # x += num\n # a.pop(num)\n # count += 1\n # num = max(a[0], a[-1])\n # y += num\n # a.pop(num)\n # count += 1\n # print(x, y)\n n = int(input())\n if n % 2 == 0:\n print(n // 2)\n print('2 ' * (n // 2))\n else:\n print(n // 2)\n print('2 ' * (n // 2 - 1) + '3')\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 = int(input())\r\ni =0\r\nnum =[]\r\nwhile(True):\r\n if n ==2 or n==3 :\r\n i+=1\r\n num.append(n)\r\n #print(n,8)\r\n break \r\n elif n%2 ==0 :\r\n i+=1\r\n n-=2 \r\n num.append(2)\r\n # print(2,end=\" \")\r\n else:\r\n if n%3!=0 and n%5!=0:\r\n i+=1\r\n n-=2\r\n num.append(2)\r\n #print(n, 20)\r\n #break \r\n else:\r\n i+=1\r\n n-=3\r\n num.append(3)\r\n # print(3)\r\nprint(i)\r\nfor x in num:\r\n print(x, end=\" \")", "[print(n // 2, '\\n', '2 ' * (n // 2 - 1), 2 + n % 2, sep='') for n in [int(input())]]", "num=int(input())\nd=num//2\nprint(d)\nif num%2==0:\n for i in range(d-1):\n print(2,end=' ')\n print(2)\nelse:\n for i in range(d-1):\n print(2,end=' ')\n print(3)\n\t \t \t \t \t\t\t\t\t \t\t \t\t\t \t\t\t", "n = int(input())\r\nans = [2 for i in range(n//2)]\r\nif n%2:\r\n ans[0]=3\r\nprint(len(ans))\r\nprint(*ans)\r\n", "def prime(n):\r\n d = 2\r\n while d*d <= n:\r\n if n % d == 0:\r\n return False\r\n else:\r\n d += 1\r\n return True\r\n\r\nn = int(input())\r\nk = 0\r\nans = []\r\nwhile n > 0 and n != 3:\r\n k += 1\r\n ans.append(2)\r\n n -= 2\r\nif n != 0:\r\n k += 1\r\n ans.append(3)\r\n\r\nprint(k)\r\nprint(*ans)", "n=int(input())\r\nt=0\r\nth=0\r\nwhile(n>0):\r\n if n%2==0:\r\n t=n//2\r\n n=n-(2*t)\r\n else:\r\n t=(n//2)-1\r\n n=n-(2*t)\r\n th=n//3\r\n n=n-(3*th)\r\nprint(t+th)\r\nl=[]\r\nfor i in range(t):\r\n l.append(2)\r\nfor i in range(th):\r\n l.append(3)\r\nprint(*l,end=\" \")\r\n ", "x=int(input())\r\nmaxprime=x//2\r\nprint(maxprime)\r\nfor i in range(maxprime-1):\r\n print(2,end=\" \")\r\nif x%2==0: print(2)\r\nelse: print(3)\r\n", "n=int(input())\r\nif(n%2==0):\r\n print(int(n/2))\r\n for i in range(n//2):\r\n print(\"2\",end=' ')\r\nelse:\r\n print(int((n-3)/2)+1)\r\n for i in range(int((n-3)/2)):\r\n print(\"2\",end=' ')\r\n print(\"3\")", "def main():\r\n n = int(input())\r\n # Conditions to compute\r\n primes = []\r\n if n % 2 == 1:\r\n primes.append(3)\r\n n -= 3\r\n # Loop to get prime 2\r\n for _ in range(n, 0, -2):\r\n primes.append(2)\r\n # Print output\r\n print(len(primes))\r\n for i in range(len(primes)):\r\n print(primes[i], end=\" \")\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nif n%2==0:\r\n print(int(n/2))\r\n print(\"2 \"*(int(n/2)))\r\nelse:\r\n lis = []\r\n print(int((n-1)/2))\r\n for i in range(int((n-1)/2)-1):\r\n lis.append(2)\r\n print(\"3\",*lis,sep =\" \")\r\n ", "n = int(input())\r\nprint(n//2)\r\nif(n%2==0): print(' '.join('2'*(n//2)))\r\nelse: print(' '.join('2'*(n//2-1)),'3')", "ans=0\nn=eval(input())\nprint(n//2)\nif n%2==0:\n for i in range(n//2):\n print('2',end=' ')\nelse:\n if n>3:\n print('2',end='')\n for i in range(1,n//2-1):\n print(\" 2\",end='')\n if n>3:\n print(\" 3\",end='')\n else:\n print(\"3\",end='')\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\nz=int(n/2)\r\nprint(z)\r\nif n%2==0:\r\n\t\t\ty=int(n/2)\r\n\t\t\tfor i in range(y):\r\n\t\t\t\tprint(2,end=\" \")\r\nelse:\r\n\t\t\tx=int(n/2)\r\n\t\t\tfor j in range(x):\r\n\t\t\t\tif j!=x-1:\r\n\t\t\t\t\tprint(2, end=\" \")\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint(3,end=\"\")\r\n\t\t\t\r\n\t\r\n\t", "n = int(input())\r\nk = n//2\r\nm = [2 for i in range(k-1)]\r\nif n % 2 == 0:\r\n m.append(2)\r\nelse:\r\n m.append(3)\r\nprint(k)\r\nprint(*m)", "l=[]\nn=int(input())\nnn = n//2\nif(n%2==0):\n for i in range(nn):\n l.append(2)\nelse:\n for i in range(nn-1):\n l.append(2)\n l.append(3)\nprint(len(l))\nprint(*l)\n \t\t \t \t\t\t \t\t \t\t \t \t \t \t", "n = int(input())\r\n\r\nvalue, remainder = divmod(n, 2)\r\nmax_primes = [2] * value\r\n\r\nif remainder == 1:\r\n max_primes.pop()\r\n max_primes.append(3)\r\n\r\noutput = [str(i) for i in max_primes]\r\n\r\nprint(len(output))\r\nprint(\" \".join(output))", "#https://codeforces.com/problemset/problem/749/A\r\n\r\ndef is_even(number):\r\n return number%2==0\r\n\r\nnumber = int(input())\r\ntwos_count = (number//2) - 1\r\nif(is_even(number)):\r\n extra = 2\r\nelse:\r\n extra = 3\r\nprint(twos_count+1)\r\nprint(\"2 \"*twos_count + str(extra))", "n=int(input())\r\nk=n//2\r\nif 2*k==n:\r\n print(k)\r\n print('2 '*(k-1)+'2')\r\nelse:\r\n print(k)\r\n print('2 '*(k-1)+'3')\r\n", "def find_primes_sum(n):\r\n # If n is even, represent it as n/2 2s\r\n if n % 2 == 0:\r\n return [2] * (n // 2)\r\n # If n is odd, represent (n-3) as (n-3)/2 2s and add 3 for the remaining 3\r\n else:\r\n return [2] * ((n - 3) // 2) + [3]\r\n\r\nn = int(input())\r\nprimes = find_primes_sum(n)\r\nprint(len(primes))\r\nprint(*primes)\r\n", "t = int(input())\r\nif t % 2 == 0:\r\n print(t//2)\r\n print('2 '*(t//2 - 1),'2',sep='')\r\nelse:\r\n print(t//2)\r\n print('2 '*(t//2 - 1),'3',sep='')", "import sys\n\ninput = sys.stdin.readline\nprint = sys.stdout.write\n\nn = int(input())\n\nif n % 2 == 0:\n count = n // 2\n ans_str = \" \".join([str(2)] * count)\n print(f\"{count} \\n\")\n print(f\"{ans_str} \\n\")\n\nelse:\n count = (n // 2) - 1\n ans_str = \" \".join(([str(2)] * count) + [\"3\"])\n print(f\"{count + 1} \\n\")\n print(f\"{ans_str} \\n\")\n", "k = int(input())\r\na = []\r\nfor i in range(k // 2):\r\n a.append(2)\r\nif k % 2:\r\n a.pop(-1)\r\n a.append(3)\r\nprint(len(a))\r\nprint(\" \".join(map(str, a)))", "number = int(input())\r\narr = []\r\nwhile number % 2 != 0:\r\n arr.append(3)\r\n number -= 3\r\namount = number // 2\r\nfor i in range(amount):\r\n arr.append(2)\r\narr.sort()\r\nprint(len(arr))\r\nprint(\" \".join(map(str, arr)))\r\n", "n = int(input())\nsum = 0\nprint(int(n/2))\nwhile n > sum:\n if sum+3 == n:\n print(3)\n sum+=3\n else:\n print(2)\n sum+=2\n \t \t \t\t\t\t\t\t\t \t \t\t\t \t\t \t\t \t", "n = int(input())\r\nif n % 2 == 1:\r\n n -= 3\r\n print(n//2+1)\r\n print(('2'+' ')*(n//2)+'3')\r\nelse:\r\n print(n//2)\r\n print(('2'+' ')*(n//2))", "x=int(input())\r\nl=[]\r\nif x%2==0:\r\n print(int(x/2))\r\n for i in range(0,x,2):\r\n l.append(2)\r\n print(*l)\r\nelse:\r\n b=(x//2)-1\r\n for i in range(0,b):\r\n l.append(2)\r\n l.append(3)\r\n print(len(l))\r\n print(*l)\r\n", "\r\nn = int(input())\r\nprint(n//2)\r\nif n==5:\r\n print(\"2 3\")\r\nelse:\r\n if ( n % 2 == 1):\r\n print(\"3 \",end=\"\")\r\n n -= 3\r\n while (n>0):\r\n print(\"2 \",end=\"\")\r\n n -= 2\r\n\t", "# Miguel\n# Iwalani\n# Tonatiuh \n\n# Semana Tec - Progamación Competitiva\n# Grupal 2 - C - Bachgold Problem\n\nn=int(input())\nprint(n//2,\"\\n\",\"2 \"*(n//2-1),2+n%2)\n\n \t \t\t\t \t\t \t \t\t \t\t \t", "n = int(input())\r\n\r\n\r\ndef eratosthenes(k):\r\n s = [i for i in range(k + 1)]\r\n for i in range(2, k + 1):\r\n for j in range(2 * i, k + 1, i):\r\n s[j] = 0\r\n return s\r\n\r\n\r\nsieve = list(sorted(list(set(eratosthenes(n)) - {2, 1})))\r\n\r\ni = 0\r\nans = 0\r\nif (n - sieve[i]) % 2 > 0:\r\n ans += 1\r\n while (n - sieve[i]) % 2 > 0:\r\n i += 1\r\n\r\n n -= sieve[i]\r\n print(ans + n // 2)\r\n print('2 '*(n // 2) + str(sieve[i]))\r\nelse:\r\n print(n // 2)\r\n print(*[2 for i in range(n // 2)])", "n = int(input())\r\n\r\nk = n // 2\r\nprint(k)\r\n\r\nif n % 2 == 0:\r\n l = [2 for i in range(k)]\r\n print(' '.join(map(str, l)))\r\nelse:\r\n l = [2 for i in range(k - 1)]\r\n l.append(3)\r\n print(' '.join(map(str, l)))\r\n", "n = int(input())\r\nprint(n//2)\r\nif n % 2 == 0:\r\n print(' '.join([str(2) for _ in range(n//2)]))\r\nelse:\r\n l = [str(2) for _ in range(n//2-1)]\r\n l.append(str(3))\r\n print(' '.join(l))" ]

[ "n, k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\n\r\na,b,c,d = input().split(' ')\r\n\r\na,b,c,d = int(a),int(b),int(c),int(d)\r\n\r\nif k <= n:\r\n\tprint(-1)\r\n\texit()\r\n\r\nif n == 4:\r\n\tprint(-1)\r\n\texit()\r\n\r\ncity = list(range(1,n+1))\r\nroad = [a,c]\r\nfor i in range(len(city)):\r\n\tif city[i] not in (a,b,c,d): road.append(city[i])\r\n\r\nroad += [d,b]\r\n\r\nt = ''\r\n\r\nprint(' '.join(\"{0}\".format(t) for t in road))\r\nroad = [c,a] + road[2:n-2] + [b,d]\r\nprint(' '.join(\"{0}\".format(t) for t in road))", "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\nif K<N+1 or N==4:\r\n exit(print(-1))\r\n \r\nB = []\r\nfor i in range(1,N+1):\r\n if i in A:continue\r\n B.append(i)\r\n \r\nans = [A[0],A[2]]+B+[A[3],A[1]]\r\nprint(*ans)\r\nans = [A[2],A[0]]+B+[A[1],A[3]]\r\nprint(*ans)\r\n\r\n", "def main():\r\n n, k = [int(i) for i in input().strip().split()]\r\n a, b, c, d = [int(i) for i in input().strip().split()]\r\n\r\n if k <= n or n <= 4:\r\n print(-1)\r\n return\r\n\r\n s = [a, b, c, d]\r\n others = [i for i in range(1, n + 1) if i not in s]\r\n\r\n print(\" \".join(map(str, [a, c] + others + [d, b])))\r\n print(\" \".join(map(str, [c, a] + others + [b, d])))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nimport io, os\r\nimport math\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\ndef ceil(a,b):\r\n a=-a\r\n k=a//b\r\n k=-k\r\n return k\r\n# arr=list(map(int, input().split()))\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\ndef main():\r\n arr = list(map(int, input().split()))\r\n n=arr[0]\r\n k=arr[1]\r\n arr = list(map(int, input().split()))\r\n a=arr[0]\r\n b=arr[1]\r\n c=arr[2]\r\n d=arr[3]\r\n if(n==4):\r\n print(-1)\r\n sys.exit()\r\n if(k==n-1 or k==n):\r\n print(-1)\r\n sys.exit()\r\n print(a,c,end=\" \")\r\n for i in range(1,n+1):\r\n if(i==a or i==b or i==c or i==d):\r\n continue\r\n else:\r\n print(i,end=\" \")\r\n print(d,b,end=\"\\n\")\r\n print(c,a,end=\" \")\r\n for i in range(1,n+1):\r\n if(i==a or i==b or i==c or i==d):\r\n continue\r\n else:\r\n print(i,end=\" \")\r\n print(b,d,end=\"\\n\")\r\nmain()", "import math\nimport sys\nfrom collections import Counter\n\ndef solve():\n n, k = [int(x) for x in input().split()]\n a, b, c, d = [int(x) for x in input().split()]\n\n if k <= n or n < 5:\n print(-1)\n return None\n\n S = list(range(1, n+1))\n S.remove(a)\n S.remove(b)\n S.remove(c)\n S.remove(d)\n\n A = [a, c] + S + [d, b]\n B = [c, a] + S + [b, d]\n print(' '.join(map(str, A)))\n print(' '.join(map(str, B)))\n\nsolve()\n\n", "# coding: utf-8\n\nfrom __future__ import print_function\nfrom __future__ import unicode_literals\nfrom __future__ import division\nfrom __future__ import absolute_import\nimport math\nimport string\nimport itertools\nimport fractions\nimport heapq\nimport collections\nimport re\nimport array\nimport bisect\n\n\ndef pp(p):\n print(\" \".join([str(i) for i in p]))\n\ndef cpath():\n if l == 2:\n ps = [i for i in range(1, n + 1) if i not in (a, b, c, d)]\n path1 = [a] + ps + [b]\n if a != c:\n path2 = path1[::-1]\n else:\n path2 = path1\n elif l == 3:\n rb = [False, False]\n if a == c:\n x, y, z = a, b, d\n elif a == d:\n x, y, z = a, b, c\n rb[1] = True\n elif b == c:\n x, y, z = b, a, d\n rb[0] = True\n else:\n x, y, z = b, a, c\n rb = [True, True]\n ps = [i for i in range(1, n + 1) if i not in (a, b, c, d)]\n path1 = [x] + ps + [z] + [y]\n if rb[0]:\n path1 = path1[::-1]\n path2 = [x] + ps + [y] + [z]\n if rb[1]:\n path2 = path2[::-1]\n else:\n path1 = [a, c] + [i for i in range(1, n + 1) if i not in (a, b, c, d)] + [d, b]\n path2 = [c, a] + [i for i in range(1, n + 1) if i not in (a, b, c, d)] + [b, d]\n pp(path1)\n pp(path2)\n\n\nn, k = map(int, input().split(\" \"))\na, b, c, d = map(int, input().split(\" \"))\n\nl = len(set([a, b, c, d]))\nif k < n + l - 3:\n print(-1)\nelif n == 4:\n if l <= 3:\n cpath()\n else:\n print(-1)\nelse:\n cpath()\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef paths(n, k, a, b, c, d):\n if n == 4 or k < n + 1:\n return None\n s = {a, b, c, d}\n return [i for i in range(1, n+1) if i not in s]\n\n\ndef main():\n n, k = readinti()\n a, b, c, d = readinti()\n L = paths(n, k, a, b, c, d)\n if L:\n s = ' '.join(map(str, L))\n print(a, c, s, d, b)\n print(c, a, s, b, d)\n else:\n print('-1')\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", "n, k = map(int, input().split())\na,b,c,d = map(int, input().split())\n\n#from random import shuffle\nok = 0\nL = [i+1 for i in range(n)]\nD = [a,b,c,d]\nD.sort(reverse=True)\nfor i in range(4):\n del(L[D[i]-1])\n\nif n == 4 or n >= k:\n print(-1)\nelse:\n print(str(a)+\" \"+str(c),end=\" \")\n for i in range(n-4):\n print(L[i],end=\" \")\n print(str(d)+\" \"+str(b))\n print(str(c)+\" \"+str(a),end=\" \")\n for i in range(n-4):\n print(L[i],end=\" \")\n print(str(b)+\" \"+str(d))\n \n", "n, k = map(int, input().split())\r\na, b, c, d = map(int, input().split())\r\n\r\ni = 1\r\npath = []\r\nwhile(i <= n):\r\n if(i != a and i != b and i != c and i != d):\r\n path.append(i)\r\n i += 1\r\n\r\nab = [str(x) for x in [a, c] + path + [d, b]]\r\ncd = [str(x) for x in [c, a] + path + [b, d]]\r\n\r\nif(n == 4 or k <= n):\r\n print('-1')\r\nelse:\r\n print(' '.join(ab))\r\n print(' '.join(cd))", "ip = lambda : map(int, input().split())\r\nn, k = ip()\r\na,b,c,d = ip()\r\nif k - n + 1 < 2 or n == 4:\r\n print(-1)\r\nelse:\r\n P = []\r\n for i in range(1, n+1):\r\n if i not in [a,b,c,d]:\r\n P.append(i)\r\n P1 = [a]+P[1:]+[c, P[0], d, b]\r\n P2 = [c]+P[-1:0:-1]+[a,P[0],b,d]\r\n print(*P1)\r\n print(*P2)\r\n\r\n", "n,k=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nif n==4 or k<=n:\r\n print(-1)\r\n quit()\r\np=[]\r\nfor i in range(1,n+1):\r\n if i not in l:\r\n p.append(i)\r\nprint(l[0],l[2],end=' ')\r\nfor i in p:\r\n print(i,end=' ')\r\nprint(l[3],l[1])\r\nprint(l[2],l[0],end=' ')\r\nfor i in p:\r\n print(i,end=' ')\r\nprint(l[1],l[3])\r\n\r\n", "import io,os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nn, k = map(int, input().split())\r\na, b, c, d = map(int, input().split())\r\nx = [a, b, c, d]\r\nif k < n + 1 or n == 4:\r\n print(\"-1\")\r\n exit(0)\r\nl = [_ for _ in range(1, n + 1)]\r\nfor i in x: l.remove(i)\r\nprint(\"{} {}\".format(a, c), end = ' ')\r\nfor x in l: print(x, end = ' ')\r\nprint(\"{} {}\\n{} {}\".format(d, b, c, a), end = ' ')\r\nfor x in l: print(x, end = ' ')\r\nprint(\"{} {}\".format(b, d))", "n,k=map(int,input().split())\r\na,b,c,d=input().split()\r\nif n<5 or k<n+1: print(-1)\r\nelse:\r\n l=list(set(map(str,range(1,n+1)))-{a,b,c,d})\r\n print(' '.join([a,c]+l+[d,b]+[c,a]+l+[b,d]))\r\n", "n, k = map(int,input().split())\r\na, b, c, d = map(int,input().split())\r\nif n == 4 or k < n + 1:\r\n print(-1)\r\nelse:\r\n A = []\r\n B = []\r\n A.append(a)\r\n A.append(c) \r\n B.append(c)\r\n B.append(a) \r\n \r\n i = 1\r\n while i < n + 1 :\r\n if i != a and i != b and i != c and i != d:\r\n A.append(i)\r\n B.append(i)\r\n i += 1\r\n A.append(d)\r\n A.append(b)\r\n B.append(b)\r\n B.append(d) \r\n print(*(A))\r\n print(*(B))", "import sys\r\nprint = sys.stdout.write\r\nn, k = map(int, input().split())\r\na, b, c, d = map(int, input().split())\r\nif n == 4 or k < n+1:\r\n print(\"-1\\n\")\r\n exit()\r\nprint(f\"{a} {c} \")\r\nfor i in range(1, n+1):\r\n if i not in (a, b, c, d):\r\n print(f\"{i} \")\r\nprint(f\"{d} {b}\\n\")\r\nprint(f\"{c} {a} \")\r\nfor i in range(1, n+1):\r\n if i not in (a, b, c, d):\r\n print(f\"{i} \")\r\nprint(f\"{b} {d}\\n\")\r\n", "f = lambda: map(int, input().split())\r\nn, k = f()\r\na, b, c, d = f()\r\ns = list(set(range(1, n + 1)).difference({a, b, c, d}))\r\nd = [a, c] + s + [d, b] + [c, a] + s + [b, d]\r\nprint(' '.join(map(str, d)) if 4 < n < k else -1)" ]

[ "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\ndef matching(n,m,path):\r\n # Hopkrocft Karp O(EV^0.5)\r\n match1 = [-1]*n\r\n match2 = [-1]*m\r\n for node in range(n):\r\n for nei in path[node]:\r\n if match2[nei] == -1:\r\n match1[node] = nei\r\n match2[nei] = node\r\n break\r\n while 1:\r\n bfs = [node for node in range(n) if match1[node] == -1]\r\n depth = [-1]*n\r\n for node in bfs:\r\n depth[node] = 0\r\n\r\n for node in bfs:\r\n for nei in path[node]:\r\n next_node = match2[nei]\r\n if next_node == -1:\r\n break\r\n if depth[next_node] == -1:\r\n depth[next_node] = depth[node]+1\r\n bfs.append(next_node)\r\n else:\r\n continue\r\n break\r\n else:\r\n break\r\n pointer = [len(c) for c in path]\r\n dfs = [node for node in range(n) if depth[node] == 0]\r\n while dfs:\r\n node = dfs[-1]\r\n while pointer[node]:\r\n pointer[node] -= 1\r\n nei = path[node][pointer[node]]\r\n next_node = match2[nei]\r\n if next_node == -1:\r\n while nei != -1:\r\n node = dfs.pop()\r\n match2[nei],match1[node],nei = node,nei,match1[node]\r\n break\r\n elif depth[node]+1 == depth[next_node]:\r\n dfs.append(next_node)\r\n break\r\n else:\r\n dfs.pop()\r\n return n-match1.count(-1)\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n edg = [tuple(map(lambda xx:int(xx)-1,input().split())) for _ in range(m)]\r\n ans = float(\"inf\")\r\n for centre in range(n):\r\n path = [[] for _ in range(n)]\r\n cost = 2*n-1\r\n extra = m\r\n for u,v in edg:\r\n if u == centre or v == centre:\r\n cost -= 1\r\n extra -= 1\r\n else:\r\n path[u].append(v)\r\n maxMatch = matching(n,n,path)\r\n extra -= maxMatch\r\n cost += n-1-maxMatch+extra\r\n ans = min(ans,cost)\r\n print(ans)\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()" ]

[ "n=int(input())\r\ns=list(input())\r\nif s.count(\"?\")==0:\r\n print(\"No\")\r\n exit(0)\r\n\r\nf=0\r\na=s[0]\r\nfor i in range(1,n):\r\n if s[i]==s[i-1] and s[i]!=\"?\":\r\n f=1\r\n print(\"No\")\r\n exit(0)\r\ns=[\"*\"]+s+[\"&\"] \r\n#print(s)\r\ny=list(\"CMY\")\r\n#print(y)\r\nfor i in range(1,n+1):\r\n g=0\r\n if (s[i-1] in y) and (s[i+1] in y):\r\n g=1\r\n if (s[i]==\"?\" and s[i-1]==s[i+1] and g==1) or (g==0 and s[i]==\"?\"):\r\n print(\"Yes\")\r\n exit(0)\r\n #print(i,s[i-1],s[i],s[i+1],g)\r\nprint(\"No\")", "while True:\r\n n=int(input())\r\n s=input()\r\n\r\n for i in range(0, n-1):\r\n if s[i]==s[i+1] and s[i]!='?':\r\n print('No')\r\n break\r\n\r\n else:\r\n if '??' in s or 'Y?Y' in s or 'C?C' in s or 'M?M' in s or s[0]=='?' or s[-1]=='?':\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\n break\r\n", "a=int(input());b='!'+input()+'@';ans=1;i=1;ok=0\r\nwhile i<a+1:\r\n if b[i]!='?' and b[i+1]!='?' and b[i]==b[i+1]:ans=0\r\n s = 0\r\n if b[i] == '?':\r\n for j in 'CYM':\r\n if j != b[i - 1] and j != b[i + 1]: s += 1\r\n if s>1:ok=1\r\n i+=1\r\nif ans and ok:print(\"YES\")\r\nelse:print(\"NO\")", "def two_ways(s):\n already_spoiled = False\n more_than_one_way = False\n ind = 0\n row_counter = 0\n while ind < len(s) and not already_spoiled:\n if s[ind] == \"?\":\n row_counter += 1\n elif ind > 0:\n prev = s[ind - row_counter - 1]\n if ind - row_counter - 1 < 0:\n prev = s[ind]\n if row_counter == 0 and prev == s[ind]:\n already_spoiled = True\n elif (row_counter == 1 and prev == s[ind]) or row_counter > 1:\n more_than_one_way = True\n row_counter = 0\n\n ind += 1\n\n if row_counter != 0:\n return True\n\n\n return not already_spoiled and more_than_one_way\n\nn = int(input())\ns = input()\n\nif two_ways(s):\n print(\"Yes\")\nelse:\n print(\"No\")", "import functools\r\nimport sys\r\n\r\n\r\n\r\n\r\n\r\ndef with_args(deco):\r\n @functools.wraps(deco)\r\n def wrapper(*args,**kwargs):\r\n def res(func):\r\n return deco(func,*args,**kwargs)\r\n return res\r\n return wrapper\r\n\r\n\r\n@with_args\r\ndef deco(func,str = \"я бесполезен\"):\r\n @functools.wraps(func)\r\n def res(*args,**kwargs):\r\n print(str,end = \"\\n\")\r\n return func(*args,**kwargs)\r\n return res\r\n\r\n@deco()\r\ndef id(x):\r\n return x\r\n\r\n\r\ndef fib(n):\r\n a = b = 1\r\n for i in range(n):\r\n yield a\r\n a,b = b,a+b\r\n\r\n_,s = input(),input()\r\nprint(\"Yes\" if (\"??\" in s or \"M?M\" in s or \"C?C\" in s or \"Y?Y\" in s or s[0] == '?' or s[-1] == '?') and not (\"MM\" in s or \"CC\" in s or \"YY\" in s) else \"No\")", "n=int(input())\r\ns=input()\r\nfor i in range(n-1):\r\n if s[i]==s[i+1] and s[i]!=\"?\":\r\n print(\"NO\")\r\n quit()\r\nans=\"No\"\r\nfor i in range(n-1):\r\n if s[i]==s[i+1]==\"?\":\r\n ans=\"YES\"\r\n break\r\n elif s[i]==\"?\":\r\n if i==0 or (s[i-1]==s[i+1]):\r\n ans=\"YES\"\r\n break\r\nif s[n-1]==\"?\": ans=\"YES\"\r\nprint(ans)", "input()\r\ns = input()\r\nif \"CC\" in s or \"MM\" in s or \"YY\" in s:\r\n print(\"No\")\r\nelif \"??\" in s:\r\n print(\"Yes\")\r\nelif \"?\" not in s:\r\n print(\"No\")\r\nelif s.startswith(\"?\") or s.endswith(\"?\"):\r\n print(\"Yes\")\r\nelse:\r\n for i in range(1, len(s)-1):\r\n if s[i]==\"?\" and s[i-1] == s[i+1]:\r\n print(\"Yes\")\r\n break\r\n else:\r\n print(\"No\")", "import re\n\n\ndef is_available(picture):\n \"\"\"\n :param picture: str\n :return: bool\n \"\"\"\n if re.search(r'CC|YY|MM', picture):\n return False\n\n if picture[0] == '?' or picture[-1] == '?':\n return True\n\n return re.search(r'C\\?C|M\\?M|Y\\?Y|\\?\\?', picture)\n\n\nn = int(input())\npicture = input().strip()[:n]\nprint('Yes' if is_available(picture) else 'No')", "n=int(input())\r\np=input()\r\nf=1\r\nk=0\r\na=0\r\nfor i in range(0,n-1):\r\n if p[i]==p[i+1] and p[i]!='?':\r\n a+=1\r\nif a>=1:\r\n print(\"No\")\r\nelse:\r\n if p[0]=='?' or p[-1]=='?':\r\n print(\"Yes\")\r\n else:\r\n while k<n:\r\n if p[k]=='?':\r\n if p[k-1]==p[k+1]:\r\n f*=2\r\n elif p[k-1]!='?' and p[k+1]!='?':\r\n f*=1\r\n else:\r\n f*=2\r\n k+=1\r\n if f>1:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n ", "n=int(input())\r\ns=input()\r\ne=True\r\nt=True\r\nfor i in range(n-1):\r\n if s[i:i+2]=='YY' or s[i:i+2]=='MM' or s[i:i+2]=='CC':\r\n t=False\r\n break\r\nif t==True:\r\n if s[0]=='?' or s[n-1]=='?':\r\n e=False\r\n else:\r\n for i in range(1,n-1):\r\n if s[i]=='?':\r\n if s[i+1]=='?':\r\n e=False\r\n break\r\n elif s[i-1]==s[i+1]:\r\n e=False\r\n break\r\n if e==False:\r\n break\r\nif t==True and e==False:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n = int(input())\r\ns = input()\r\nfor i in range(n - 1):\r\n if s[i] == s[i + 1] != '?':\r\n print('NO')\r\n break\r\nelse:\r\n for i in range(n):\r\n if s[i] == '?':\r\n if i != 0 and i != n - 1 and s[i - 1] != s[i + 1] and s[i - 1] != '?' and s[i + 1] != '?':\r\n continue\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n", "input()\r\na=input()\r\nprint('YES' if ((any(i in a for i in ['??','C?C','Y?Y','M?M']) or a[0]=='?' or a[-1]=='?')and all(i not in a for i in ['MM','YY','CC']))else 'NO')", "n = int(input())\r\ncolors = [i for i in input()]\r\nmaners = []\r\nif(colors.count(\"?\") == 0):\r\n print(\"No\")\r\nelif(n == 1):\r\n print(\"Yes\")\r\nelse:\r\n i = 0\r\n chave = True\r\n while i<n-1:\r\n if(colors[i] == colors[i+1] and colors[i] != \"?\"):\r\n chave = False\r\n break\r\n i+=1\r\n if(chave):\r\n string = \"\".join(colors)\r\n inter = 0\r\n inter += string.count(\"C?M\")\r\n inter += string.count(\"C?Y\")\r\n inter += string.count(\"Y?C\")\r\n inter += string.count(\"Y?M\")\r\n inter += string.count(\"M?C\")\r\n inter += string.count(\"M?Y\")\r\n if inter == string.count(\"?\"):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "def run():\r\n input()\r\n s = input()\r\n\r\n for i in range(len(s)):\r\n\r\n if s[i] != '?':\r\n if i > 0 and s[i-1] == s[i]:\r\n return False\r\n if i < len(s) - 1 and s[i+1] == s[i]:\r\n return False\r\n continue\r\n\r\n for i in range(len(s)):\r\n if s[i] != '?': continue\r\n if i == 0:\r\n return True\r\n if i == len(s) -1:\r\n return True\r\n\r\n if s[i-1] == s[i] or s[i+1] == s[i]:\r\n return True\r\n\r\n if s[i-1] == s[i+1]:\r\n return True\r\n\r\n return False\r\nprint('Yes' if run() else 'No')", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\ndef Judge():\r\n n = int(input())\r\n s = input()\r\n\r\n for i in range(n - 1):\r\n if s[i] != '?' and s[i] == s[i + 1]:\r\n return False\r\n\r\n if '??' in s:\r\n return True\r\n elif s[0] == '?' or s[-1] == '?':\r\n return True\r\n elif 'C?C' in s or 'Y?Y' in s or 'M?M' in s:\r\n return True\r\n else:\r\n return False\r\n\r\nprint('Yes') if Judge() else print('No')\r\n", "n = int(input())\r\ns = input().rstrip()\r\nnotpaint = []\r\nflg = True\r\nfor i in range(n):\r\n if i < n-1 and s[i] != '?':\r\n if s[i] == s[i+1]:\r\n flg = False\r\n break\r\n if s[i] == '?':\r\n notpaint.append(i)\r\nif flg:\r\n work = 1\r\n for q in notpaint:\r\n if 0 == q or n-1 == q:\r\n work *= 2\r\n else:\r\n if s[q-1] == s[q+1] or s[q-1] == '?' or s[q+1] == '?':\r\n work *= 2\r\n if work > 1:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelse:\r\n print('No')", "import sys\r\nfrom functools import wraps\r\n\r\ndef memoize(function):\r\n memo = {}\r\n \r\n @wraps(function)\r\n def wrapper(*args):\r\n if args in memo:\r\n return memo[args]\r\n else:\r\n res = function(*args)\r\n memo[args] = res\r\n return res\r\n \r\n return wrapper\r\n\r\n\r\n@memoize\r\ndef count(canvas, pos, last):\r\n if pos == len(canvas):\r\n return 1\r\n \r\n res = 0\r\n for color in \"CYM\":\r\n if not (color == last or (canvas[pos] != '?' and color != canvas[pos])):\r\n res += count(canvas, pos + 1, color)\r\n \r\n return res\r\n\r\n\r\ndef main(args):\r\n n = int(input())\r\n canvas = input()\r\n print(\"Yes\" if count(canvas, 0, 'X') >= 2 else \"No\")\r\n \r\n\r\nif __name__ == '__main__':\r\n sys.exit(main(sys.argv))\r\n", "n = int(input())\r\ns = input()\r\nif(s.find('CC')!=-1 or s.find('YY')!=-1 or s.find('MM')!=-1):\r\n print('No')\r\nelif(s.find(\"??\")!=-1):\r\n print(\"Yes\")\r\nelse:\r\n c = 0\r\n p = []\r\n f = 0\r\n for i in range(len(s)):\r\n if(s[i]==\"?\"):\r\n p.append(i)\r\n for y in p:\r\n if(y==0 or y==n-1):\r\n print(\"Yes\")\r\n f = 1\r\n break\r\n else:\r\n if(s[y-1]==s[y+1]):\r\n c+=2\r\n break\r\n if(c>=2 and f!=1):\r\n print(\"Yes\")\r\n elif(c<2 and f!=1):\r\n print(\"No\")", "def main():\r\n n = int(input())\r\n s = input()\r\n prev = ''\r\n for char in s:\r\n if char!='?' and char==prev:\r\n print(\"No\")\r\n return\r\n prev = char\r\n if 'C?C' in s or 'M?M' in s or 'Y?Y' in s or '??' in s or s[0]=='?' or s[-1]=='?':\r\n print(\"Yes\")\r\n return\r\n else:\r\n print(\"No\")\r\n return\r\nmain()\r\n", "#!/usr/bin/env python3\n\nimport sys\n\nn = int(sys.stdin.readline().strip())\ns = sys.stdin.readline().strip()\n\nif ('MM' in s) or ('CC' in s) or ('YY' in s):\n\tprint ('No')\nelif s.startswith('?') or s.endswith('?') or ('??' in s):\n\tprint ('Yes')\nelif ('M?M' in s) or ('Y?Y' in s) or ('C?C' in s):\n\tprint ('Yes')\nelse:\n\tprint ('No')\n\n", "t = int(input())\nstr = input()\n\nif 'MM' in str or 'YY' in str or 'CC' in str:\n print(\"No\")\nelif '??' in str or str[0] == '?' or str[-1] == '?' or 'M?M' in str or 'Y?Y' in str or 'C?C' in str:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "n=input()\ns=input()\nif s.count(\"CC\") or s.count(\"MM\") or s.count(\"YY\"):\n print(\"No\")\nelif(s[0]=='?' or s[-1]=='?'):\n print(\"Yes\")\nelif s.count(\"??\"):\n print(\"Yes\")\nelse:\n b=''\n q=0\n for i in s:\n if(i!='?'):\n if((q>0 and b==i)):\n print(\"Yes\")\n break\n q=0\n b=i\n \n else:\n q+=1\n else:\n print(\"No\")", "n = int(input())\r\na= input()\r\nf = 0\r\nfor i in range(n-1):\r\n if( a[i] == a[i+1] )and(a[i]!='?'):\r\n f = 1\r\n break\r\nif f:print('No')\r\nelse:\r\n o = a[0]\r\n for i in range(1,n-1):\r\n if a[i] == '?':\r\n if (a[i-1]!= '?')and(a[i+1]!='?')and(a[i-1]!=a[i+1]):\r\n o += 'X'\r\n else:o+=a[i]\r\n else:\r\n o+=a[i]\r\n o +=a[-1]\r\n #print(o)\r\n if '?' in o:print('Yes')\r\n else:print('No')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nc = 1\r\nd = 0\r\nfor i in range(n):\r\n if i != 0 and s[i] == s[i-1] and s[i] != '?':\r\n c = 0\r\n break\r\n if d == 0 and s[i] == '?':\r\n if i == 0 or i == n-1 or s[i-1] == s[i+1] or s[i-1] == '?' or s[i+1] == '?':\r\n d = 1\r\n\r\nif c == 0 or d == 0:\r\n print('No')\r\nelse:\r\n print('Yes')", "n = int(input())\r\nc = input()\r\nfor i in range(1, n):\r\n if c[i - 1] == c[i] and c[i] != '?':\r\n print(\"NO\")\r\n exit(0)\r\nflag = True\r\nok = False\r\nfor i in range(n):\r\n if c[i] == '?':\r\n st = set()\r\n if i > 0 and c[i - 1] != '?':\r\n st.add(c[i - 1])\r\n if i < n - 1 and c[i + 1] != '?':\r\n st.add(c[i + 1])\r\n ok |= len(st) < 2\r\n else:\r\n if i > 0 and c[i] == c[i - 1]:\r\n flag = False\r\n if i < n - 1 and c[i] == c[i + 1]:\r\n flag = False\r\nif flag and ok:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")# 1691770775.710593", "n = int(input())\r\na = list(input()) + ['?']\r\nf = False\r\nfor i in range(1, n):\r\n\tif a[i] == a[i - 1] and a[i] != '?':\r\n\t\tf = True\r\n\t\tbreak\r\nif f:\r\n\tprint('No')\r\n\texit(0)\r\nfor i in range(n):\r\n\tif a[i] == '?':\r\n\t\tif a[i - 1] == a[i + 1] or a[i - 1] == '?' or a[i + 1] == '?':\r\n\t\t\tprint('Yes')\r\n\t\t\texit(0)\r\nprint('No')", "n = int(input())\r\ns = input()\r\na = True\r\nt = 0\r\nfor i in range(n - 1):\r\n if s[i] == s[i + 1] and s[i] != '?':\r\n a = False\r\n break;\r\nif a:\r\n t = s.count('?')\r\n for i in range(1, n - 1):\r\n if s[i] == '?' and s[i - 1] != s[i + 1] and s[i - 1] != '?' and s[i + 1] != '?':\r\n t -= 1\r\nif t > 0 and a:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\ns = input()\r\n \r\nf = False\r\n \r\nfor i in range(n):\r\n if s[i] == '?':\r\n if i == 0 or i == n - 1:\r\n f = True\r\n break\r\n if s[i + 1] == '?':\r\n f = True\r\n break\r\n if s[i - 1] == s[i + 1]:\r\n f = True\r\n break \r\n \r\nfor i in range(n - 1):\r\n if s[i] == s[i + 1] and s[i] != '?':\r\n f = False\r\n break\r\n \r\nif f:\r\n print('Yes')\r\nelse:\r\n print('No')", "input()\r\ns=input()\r\nif 'MM' in s or 'CC' in s or 'YY' in s or '?' not in s:\r\n print('No')\r\n exit()\r\nt=s.count('C?Y')+s.count('C?M')+s.count('Y?M')\r\nt+=s.count('Y?C')+s.count('M?Y')+s.count('M?C')\r\nif t==s.count('?'):\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n\r\n\r\n", "_,x=input(),input()\r\nif 'CC' in x or 'MM' in x or 'YY' in x:\r\n print('No')\r\nelif x.count('?')==0:\r\n print('No')\r\nelif '??' in x:\r\n print('Yes')\r\nelif x.count('?')-x.count('C?M')-x.count('C?Y')-x.count('M?Y')-x.count('M?C')-x.count('Y?C')-x.count('Y?M')==0:\r\n print('No')\r\nelse:\r\n print('Yes') ", "import os\r\nfrom math import*\r\n\r\nn=int(input())\r\ns=input()\r\nif \"CC\" in s or \"MM\" in s or \"YY\" in s:\r\n\tprint(\"No\")\r\nelse:\r\n\tif \"??\" in s:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tif s[0]==\"?\" or s[-1]==\"?\":\r\n\t\t\tprint(\"Yes\")\r\n\t\telse:\r\n\t\t\ty=0\r\n\t\t\tfor i in range(1,n):\r\n\t\t\t\tif s[i]==\"?\":\r\n\t\t\t\t\tif s[i-1]==s[i+1]:\r\n\t\t\t\t\t\tprint(\"Yes\")\r\n\t\t\t\t\t\ty=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\tif y==0:\r\n\t\t\t\tprint(\"No\")", "n, s = int(input()), list(\"?\"+input()+\"?\")\n[s.append(\"_\") for i in range(1,n+1) if s[i]=='?' and (min(s[i-1:i+2:2])=='?' or s[i-1] == s[i+1])]\n[s.append(\"?\") for i in range(1,n+1) if s[i]!='?' and s[i]==s[i+1]]\nprint(\"No\" if s[-1]=='?' else \"Yes\")\n", "n = int(input())\rs = '?' + input() + '?'\r\rans = False\rfor x in range(1, len(s) - 1):\r if s[x] == '?':\r k = 0\r for y in ['C', 'Y', 'M']:\r if s[x - 1] != y and s[x + 1] != y:\r k += 1\r if k > 1:\r ans = True\r elif s[x - 1] == s[x] or s[x + 1] == s[x]:\r ans = False\r break\r x += 1\r\rif ans:\r print(\"Yes\")\relse:\r print(\"No\")", "cc = int(input())\r\ndd = input()\r\nflag=0\r\nfor i in range(1,cc):\r\n if dd[i]!='?' and dd[i]==dd[i-1]:\r\n print(\"No\")\r\n flag=1\r\n break\r\nif flag==0:\r\n if dd[0]=='?':\r\n print(\"Yes\")\r\n elif dd[cc-1]=='?':\r\n print(\"Yes\")\r\n else:\r\n count = 1\r\n flag =1\r\n for i in range(0,cc):\r\n if dd[i]==\"?\":\r\n if dd[i+1]==\"?\":\r\n print(\"Yes\")\r\n flag=0\r\n break\r\n else:\r\n if dd[i-1]==dd[i+1]:\r\n print(\"Yes\")\r\n flag=0\r\n break\r\n if flag==1:\r\n print(\"No\")\r\n", "lengthCanvas = int(input(\"\"))\ncanvas = input(\"\")\ncolors = [\"C\",\"M\",\"Y\"]\nflag = True\n\nfor i in range(len(canvas)-1):\n if canvas[i] == canvas[i+1] and canvas[i] != \"?\":\n flag = False\n\nif flag:\n flag = False\n if canvas[0] == \"?\" or canvas[len(canvas)-1] == \"?\":\n flag = True\n\n for i in range(len(canvas)-1):\n if canvas[i] == \"?\" and canvas[i] == canvas[i+1]:\n flag = True\n\n for i in range(1, len(canvas)-1):\n if len(canvas) > 1 and canvas[i] == \"?\" and canvas[i-1] == canvas[i+1]:\n flag = True\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\n", "a=int(input());b='!'+input()+'@';ans=0;i=0\r\nwhile i<a+1:\r\n if b[i]!='?' and b[i+1]!='?' and b[i]==b[i+1]:ans=1\r\n i+=1\r\nif ans:print(\"NO\")\r\nelse:\r\n for i in range(1,a+1):\r\n s=0\r\n if b[i]=='?':\r\n for j in 'CYM':\r\n if j!=b[i-1] and j!=b[i+1]:s+=1\r\n if s>1:exit(print(\"YES\"))\r\n print(\"NO\")", "n = int(input())\r\n\r\narr = list(input())\r\ncnt = 0\r\n\r\ndef dfs(idx):\r\n global cnt\r\n for i in range(len(arr)-1):\r\n if arr[i] == arr[i+1] and arr[i] != '?':\r\n return\r\n \r\n if idx == len(arr):\r\n cnt += 1\r\n if cnt == 2:\r\n print(\"Yes\")\r\n exit(0)\r\n return\r\n \r\n if arr[idx] != '?':\r\n dfs(idx+1)\r\n else:\r\n for c in ['C', 'M', 'Y']:\r\n arr[idx] = c\r\n dfs(idx+1)\r\n arr[idx] = '?'\r\n\r\ndfs(0)\r\nprint(\"No\")", "n = int(input())\r\ns = input()\r\nposs = True \r\ncomm = True \r\n\r\nif '?' not in s:\r\n poss = False\r\n\r\nfor c in ['CC', 'MM', 'YY']:\r\n if c in s:\r\n poss = False\r\n\r\nif n > 3:\r\n if '??' not in s and s[0] != '?' and s[-1]!= '?': \r\n x = s.split('?')\r\n new = ''.join(x)\r\n\r\n if 'CC' not in new and 'MM' not in new and 'YY' not in new:\r\n comm = False\r\n \r\nprint('Yes' if poss and comm else 'No')\r\n", "n=int(input())\r\ns=input()\r\na=['MM','YY','CC']\r\nc=1\r\nfor i in a:\r\n if(i in s):\r\n c=0\r\n break\r\nif(c==0):\r\n print('No')\r\nelif(s[0]=='?' or s[n-1]=='?'):\r\n print('Yes')\r\nelse:\r\n if('??' in s or 'Y?Y' in s or 'M?M' in s or 'C?C' in s):\r\n print('Yes')\r\n else:\r\n print('No')", "# -*- coding: utf-8 -*-\r\nimport sys\r\ndef input(): return sys.stdin.readline()[:-1]\r\n# def input(): return sys.stdin.buffer.readline()[:-1]\r\n\r\nn = int(input())\r\ns = input()\r\n\r\ndef no():\r\n print('No')\r\n exit()\r\n\r\ndef yes():\r\n print('Yes')\r\n exit()\r\n\r\nfor i in range(n-1):\r\n if s[i] != '?' and s[i] == s[i+1]:\r\n no()\r\n\r\nfor i in range(n):\r\n if s[i] == '?':\r\n if i == 0 or i == n-1:\r\n yes()\r\n if s[i + 1] == s[i]:\r\n yes()\r\n if s[i + 1] == s[i - 1]:\r\n yes()\r\n\r\nno()\r\n\r\n\"\"\"\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n", "import re\ninput()\ns=input()\nprint('No'if re.search('CC|MM|YY',s)or not('?'in(s[0],s[-1])or'??'in s\nor re.search(r'(C|M|Y)\\?(\\1)',s))else'Yes')", "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\nf = 1\r\nfor i in range(N-1):\r\n x = S[i] + S[i+1]\r\n if x in [ \"YY\",\"CC\",\"MM\"]:\r\n f=0\r\n break\r\nif f==0:\r\n print(\"No\")\r\nelif S[-1] == \"?\" or S[0]== \"?\":\r\n print(\"Yes\")\r\nelif \"??\" in S:\r\n print(\"Yes\")\r\nelse:\r\n g = 0\r\n for i in range(N):\r\n if S[i] == '?':\r\n #print(S[i-1],S[i+1])\r\n if S[i-1] == S[i+1]:\r\n g = 1\r\n break\r\n #print(g)\r\n Yy(g)\r\n ", "#-----------------------------#\r\n#INCLUDE <HajLorenzo>\r\n#INCLUDE <MUSIC.H>\r\n#Firelink Shrine - Dark Souls 3\r\n#-----------------------------#\r\n\r\n\r\n_B3=[\"CC\",\"MM\",\"YY\"]\r\n_B4=[\"M?M\",\"C?C\",\"Y?Y\"]\r\n\r\ndef __(___,_XB3):\r\n for _X2 in range(3):\r\n if(___.count(_XB3[_X2])>0):\r\n return True\r\n return False\r\n\r\ndef _SL2(___,_XB4):\r\n for _X3 in range(3):\r\n if(___.count(_XB4[_X3])>0):\r\n return True\r\n return False\r\n \r\ninput()\r\n_=input()\r\nif(__(_,_B3) or _.count(\"?\")==0):print(\"No\")\r\nelif(_[0]==\"?\" or _[len(_)-1]==\"?\" or _SL2(_,_B4) or _.count(\"??\")>0):print(\"Yes\")\r\nelse:print(\"No\")\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n", "def main():\r\n\tn = int(input())\r\n\ts = input().strip()\r\n\r\n\tans = s[0] == '?' or s[-1] == '?'\r\n\r\n\tfor i in range(1,n-1):\r\n\t\tif s[i] != '?':\r\n\t\t\tcontinue\r\n\t\t\r\n\t\tl = s[i-1]\r\n\t\tr = s[i+1]\r\n\t\t\r\n\t\tif l == '?' or r == '?' or (l == r):\r\n\t\t\tans = True\r\n\t\t\tbreak\r\n\t\r\n\tfor i in range(1,n):\r\n\t\tif s[i] != '?':\r\n\t\t\tans = ans and s[i] != s[i-1]\r\n\r\n\tif ans:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\tprint('No')\t\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\ns = input()\nfor i in range(1, n):\n if s[i - 1] == s[i] and s[i] != '?':\n print('No')\n exit()\nfor i in range(1, n):\n if s[i - 1] == '?' and s[i] == '?':\n print('Yes')\n exit()\nfor i in range(1, n - 1):\n if s[i - 1] == s[i + 1] and s[i] == '?':\n print('Yes')\n exit()\nif s[0] == '?' or s[-1] == '?':\n print('Yes')\nelse:\n print('No')", "count=int(input())\r\ncount_variable=1\r\ncolours=input()\r\nanswer='Yes'\r\ncolour=colours[0]\r\nif colour=='?':\r\n count_variable+=1\r\nfor i in range(1,count):\r\n if (colours[i]==colour)and(colour!='?'):\r\n answer='No'\r\n if colours[i]=='?':\r\n if i==count-1:\r\n count_variable+=1\r\n else:\r\n if (colours[i-1]==colours[i+1])or(colours[i-1]=='?')or(colours[i+1]=='?'):\r\n count_variable+=1\r\n colour=colours[i]\r\nif count_variable==1:\r\n answer='No'\r\nprint(answer)\r\n", "n = input()\r\ns = list(input())\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] != '?' and s[i] == s[i-1]:\r\n print('No')\r\n exit()\r\nfor i in range(len(s)):\r\n if s[i] == '?': \r\n if i == 0 or i == len(s) -1 or s[i+1] == '?' or s[i-1] == s[i+1]:\r\n print('Yes'); exit()\r\n \r\n \r\nprint('No')", "def posPaint(n, s):\r\n temp = s[0]\r\n for i in range(1, n):\r\n if s[i] == temp and s[i] != '?':\r\n# print(s[i], temp)\r\n return 'No'\r\n temp = s[i]\r\n if s[0] == '?' or s[n - 1] == '?':\r\n return 'Yes'\r\n else:\r\n for i in range(1, n - 1):\r\n b = s[i - 1]\r\n a = s[i + 1]\r\n# print(i, b, s[i], a)\r\n if s[i] == '?' and (b == '?' or a == '?'):\r\n return 'Yes'\r\n elif s[i] == '?' and b == a:\r\n return 'Yes'\r\n return 'No'\r\n\r\nn = int(input())\r\ns = input()\r\nprint(posPaint(n, s))", "I = input\r\nn, s = int(I()), \"?\"+I()+\"?\"\r\nprint(\"Yes\" if any((i in s) for i in [\"??\",\"C?C\",\"Y?Y\",\"M?M\"]) and not any((i in s) for i in [\"CC\",\"YY\",\"MM\"]) else \"No\")\r\n", "n= int(input())\nstring = input()\na=True\nfor i in range(n-1):\n if string [i] == string [i+1] and string [i] != \"?\":\n print(\"No\")\n exit(0) \n\nfor i in range(1,n-1):\n if string [i] ==\"?\":\n if string [i-1] == string [i+1] or string [i+1] == \"?\":\n print(\"Yes\")\n exit(0)\n\nif string [0] ==\"?\" or string [n-1] ==\"?\":\n print(\"Yes\")\n exit(0)\nprint(\"No\")\n", "import sys\r\nn = input()\r\ns = input()\r\nif ('YY' in s or 'MM' in s or 'CC' in s):\r\n\tprint('No')\r\n\tsys.exit()\r\nif (s[0]=='?' or s[-1] == '?'):\r\n\tprint('Yes')\r\n\tsys.exit()\r\nif ('??' in s or 'C?C' in s or 'M?M' in s or 'Y?Y' in s):\r\n\tprint('Yes')\r\n\tsys.exit()\r\nprint('No')", "n = int(input())\r\nstr = input()\r\n\r\nfor i in range(len(str) - 1):\r\n if str[i] == str[i + 1] and str[i] != '?':\r\n print(\"No\")\r\n exit(0)\r\n\r\nif str[0] == '?' or str[-1] == '?' or '??' in str or 'M?M' in str or 'C?C' in str or 'Y?Y' in str:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "import sys\n\n\ndef read_int():\n\treturn int(sys.stdin.readline().strip())\n\n\ndef has_adjcacent(s):\n\tn = len(s)\n\tfor i in range(n-1):\n\t\tif (s[i] == s[i+1]) and (s[i] != '?'):\n\t\t\treturn True\n\treturn False\n\ndef can_color(s):\n\tn = len(s)\n\tif has_adjcacent(s):\n\t\treturn False\n\n\tif (s[0] == '?') or (s[-1] == '?'):\n\t\treturn True\n\n\tfor i in range(1, n - 1):\n\t\tif s[i] != '?':\n\t\t\tcontinue\n\n\t\tif (s[i-1] == s[i+1]) or (s[i+1] == '?'):\n\t\t\treturn True\n\treturn False\n\nn = read_int()\ns = sys.stdin.readline().strip()\nprint('Yes' if can_color(s) else 'No')\n", "n = input()\r\ns = input()\r\n\r\ncolors = {\"C\",\"Y\",\"M\"}\r\n\r\ndef res():\r\n for c in colors:\r\n if s.find(c*2) != -1:\r\n return \"No\"\r\n \r\n if s[0] == \"?\":\r\n return \"Yes\"\r\n \r\n if s[len(s)-1] == \"?\":\r\n return \"Yes\"\r\n \r\n if s.find(\"??\") != -1:\r\n return \"Yes\"\r\n \r\n for c in colors:\r\n if s.find(c+\"?\"+c)!=-1:\r\n return \"Yes\"\r\n \r\n return \"No\"\r\n\r\nprint(res())\r\n ", "n = int(input())\r\ns = input()\r\nif 'MM' in s or 'CC' in s or 'YY' in s:\r\n print('NO')\r\nelse:\r\n if s[0] == '?' or s[-1] == '?':\r\n print('YES')\r\n else:\r\n for i in range(1,n-1):\r\n if s[i] == '?':\r\n if s[i-1] != '?' and s[i+1] != '?':\r\n if s[i-1] == s[i+1]:\r\n print('YES') \r\n exit()\r\n else:\r\n print('YES')\r\n exit()\r\n print('NO')", "input()\r\ns = input()\r\n\r\nif 'MM' in s or 'YY' in s or 'CC' in s:\r\n print ('No')\r\nelif s.startswith('?') or s.endswith('?'):\r\n print ('Yes')\r\nelif '??' in s:\r\n print ('Yes')\r\nelif 'C?C' in s or 'M?M' in s or 'Y?Y' in s:\r\n print ('Yes')\r\nelse:\r\n print ('No')", "n = int(input())\nstring = input()\nif string.find('MM')==-1 and string.find('CC')==-1 and string.find('YY')==-1 and string.find('?')!=-1:\n\tif string[-1]=='?' or string[0]=='?' or string.find('C?C')!=-1 or string.find('M?M')!=-1 or string.find('Y?Y')!=-1 or string.find('??')!=-1: \n\t\tprint('Yes')\n\telse:\n\t\tprint('No')\nelse:\n\tprint('No')", "n = int(input())\r\ns = list(input())\r\ncolored = True\r\nway2 = False\r\nif s[0] == \"?\" or s[-1] == \"?\":\r\n way2 = True\r\nfor i in range(2, n):\r\n if s[i - 1] == \"?\" and (s[i - 2] == s[i]):\r\n way2 = True\r\n\r\n\r\nfor i in range(1, n):\r\n if s[i] != \"?\" and s[i - 1] == s[i]:\r\n colored = False\r\n\r\n if s[i] == \"?\" and s[i - 1] == s[i]:\r\n way2 = True\r\n\r\n\r\nif way2 and colored:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import re\r\nf=re.search\r\ni=input\r\ni()\r\ns='?'+i()+'?'\r\nprint('No'if f('CC|MM|YY',s)or not\r\nf('\\?\\?|C\\?C|Y\\?Y|M\\?M',s)else'Yes')", "n = input()\ns = input()\n\nany_in = lambda p, s: any(x in s for x in p.split())\n\nif any_in(\"CC YY MM\", s):\n print(\"No\")\nelif any_in(\"_? ?_ ?? C?C M?M Y?Y\", \"_\"+s+\"_\"):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "#lst = [1,2,3,4,5]\r\n#print(\" \".join(list(map(str, lst))))\r\n\r\nN = int(input())\r\nS = input()\r\n\r\nif N == 1:\r\n if S == \"?\":\r\n print(\"Yes\")\r\n quit()\r\n else:\r\n print(\"No\")\r\n quit()\r\n\r\nfor i in range(N-1):\r\n char1 = S[i]\r\n char2 = S[i+1]\r\n if char1 == char2 and char1 != \"?\":\r\n print(\"No\")\r\n quit()\r\n\r\nif S.count(\"?\") == 0:\r\n print(\"No\")\r\n quit()\r\n\r\nfor i in range(N-1):\r\n char1 = S[i]\r\n char2 = S[i+1]\r\n if char1 == char2:\r\n print(\"Yes\")\r\n quit()\r\n\r\nif S[0] == \"?\" or S[N-1] == \"?\":\r\n print(\"Yes\")\r\n quit()\r\n\r\nfor i in range(1, N-1):\r\n if S[i] == \"?\" and S[i-1] == S[i+1]:\r\n print(\"Yes\")\r\n quit()\r\n\r\nprint(\"No\")", "n=int(input())\r\nm=input()\r\ns=0\r\nif '?' not in m:\r\n print('NO')\r\nelif 'MM' in m or 'YY' in m or 'CC' in m:\r\n print('NO')\r\nelse:\r\n if '??' in m:\r\n print('YES')\r\n elif '?' == m[0] or '?' == m[-1]:\r\n print('YES') \r\n elif '?' in m: \r\n k=0\r\n p=[]\r\n for i in m:\r\n k+=1\r\n if i =='?':\r\n p.append(k-1)\r\n \r\n for j in p:\r\n if m[j-1] == m[j+1]:\r\n print('YES')\r\n s=1\r\n break\r\n if s==0:\r\n print('NO')", "num = int(input())\ncs = input()\n\nflag = False\nbreakflag = False\n\nif 'CC' in cs or 'YY' in cs or 'MM' in cs :\n breakflag = True\n\nif not breakflag and '??' in cs:\n flag = True\n\nps = cs.split('?')\nif not flag and not breakflag:\n for i in range(0,len(ps)-1):\n if '' in set(ps):\n flag = True\n break\n if ps[i][-1] == ps[i+1][0]:\n flag = True\n break\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t \t \t\t\t \t\t\t \t\t \t \t\t \t", "n=int(input())\r\nstr1=input()\r\nop=False\r\nfor i in range(n):\r\n if str1[i]==\"?\":\r\n if i==0 or i==n-1:\r\n op=True\r\n else:\r\n if str1[i-1]==str1[i+1]:\r\n op=True\r\n if str1[i-1]==\"?\" or str1[i+1]==\"?\":\r\n op=True\r\n \r\n else:\r\n if i>0 and str1[i]==str1[i-1]:\r\n op=False\r\n break\r\nif op:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n, s = int(input()), input()\n\nif ((\"??\" in s or \"C?C\" in s or \"M?M\" in s or \"Y?Y\" in s or s[0] == \"?\" or s[-1] == \"?\")\n and not(\"CC\" in s or \"YY\" in s or \"MM\" in s)):\n print(\"YES\")\nelse:\n print(\"NO\")", "from sys import stdin\r\nfrom math import ceil, log\r\n\r\nrd = stdin.readline\r\n\r\nn = int(rd())\r\ns = rd().strip()\r\n\r\nif any(('CC' in s, 'MM' in s, 'YY' in s)): print(\"NO\")\r\nelif any(('??' in s, 'C?C' in s, 'M?M' in s, 'Y?Y' in s, s[0] == '?', s[-1] == '?')): print(\"Yes\")\r\nelse: print(\"No\")\r\n", "n=int(input())\r\ns=input()\r\ncanBe=False\r\nif(s.count('MM')+s.count('CC')+s.count('YY')>=1):\r\n print('No')\r\nelif(s[0] =='?' or s[len(s)-1]=='?'):\r\n print('Yes')\r\nelse:\r\n for i in range(1,len(s)-1):\r\n if(s[i]=='?' and (s[i-1]==s[i+1])):\r\n canBe=True\r\n break\r\n elif(s[i]=='?' and s[i+1]=='?'):\r\n canBe=True\r\n break\r\n if(canBe):\r\n print('Yes')\r\n else:\r\n print('No')", "n, s = int(input()), list(\"?\"+input()+\"?:?\")\n[s.append(\"_\") for i in [\"??\",\"C?C\",\"Y?Y\",\"M?M\"] if i in \"\".join(s)]\n[s.append(\"?\") for i in [\"CC\",\"YY\",\"MM\"] if i in \"\".join(s)]\nprint(\"No\" if s[-1]=='?' else \"Yes\")\n", "n=int(input())\r\ns=input()\r\nfor i in range(n-1):\r\n if(s[i]==s[i+1] and s[i]!='?'):\r\n print(\"No\")\r\n exit()\r\nif(s[0]=='?' or s[n-1]=='?'):\r\n print(\"Yes\")\r\n exit()\r\nfor i in range(1,n-1):\r\n if (s[i]=='?'):\r\n if(s[i-1]=='?' or s[i+1]=='?'):\r\n print(\"Yes\")\r\n exit()\r\n elif(s[i-1]==s[i+1]):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n", "n = int(input())\r\ns = input()\r\ndp = [[0] * 3]\r\nif s[0] == 'C' or s[0] == '?':\r\n\tdp[0][0] = 1\r\nif s[0] == 'M' or s[0] == '?':\r\n\tdp[0][1] = 1\r\nif s[0] == 'Y' or s[0] == '?':\r\n\tdp[0][2] = 1\r\nfor i in range(1, n):\r\n\tdp.append([0] * 3)\r\n\tif s[i] == 'C' or s[i] == '?':\r\n\t\tdp[i][0] = dp[i - 1][1] + dp[i - 1][2]\r\n\tif s[i] == 'M' or s[i] == '?':\r\n\t\tdp[i][1] = dp[i - 1][0] + dp[i - 1][2]\r\n\tif s[i] == 'Y' or s[i] == '?':\r\n\t\tdp[i][2] = dp[i - 1][0] + dp[i - 1][1]\r\nif dp[n - 1][0] + dp[n - 1][1] + dp[n - 1][2] >= 2:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "import sys \r\n\r\nn = int(input()) \r\ns = input() \r\nif 'CC' in s or 'YY' in s or 'MM' in s: \r\n print('No') \r\n sys.exit() \r\nif s[0]=='?' or s[-1]=='?': \r\n print('Yes') \r\n sys.exit() \r\nif '??' in s: \r\n print('Yes') \r\n sys.exit() \r\nif 'C?C' in s or 'Y?Y' in s or 'M?M' in s: \r\n print('Yes') \r\n sys.exit() \r\nprint('No')", "import copy\nn = int(input())\ns = input()\n#print(n)\n#print(s)\nok = False\nlast = [s[0]]\ncolors = ['C', 'Y', 'M']\nif n <= 2 and '?' in s:\n print(\"Yes\")\nelse:\n mmax = 0\n if s[0] == '?' or s[-1] == '?':\n mmax = 2\n for i in range(1, n-1):\n if s[i] == '?':\n if s[i-1] == '?' or s[i+1] == '?' or s[i-1] == s[i+1]:\n mmax = 2\n else:\n if s[i] == s[i-1] or s[i] == s[i+1]:\n mmax = 0\n break\n if mmax == 2:\n print(\"Yes\")\n else:\n print(\"No\")\n\n \t \t \t\t\t \t\t \t \t\t\t \t \t", "n, s = input(), input()\r\n\r\nif ('??' in s or 'C?C' in s or 'M?M' in s or 'Y?Y' in s or s[0]=='?' or s[-1]=='?') and not ('CC' in s or 'MM' in s or 'YY' in s):\r\n print('Yes')\r\nelse:\r\n print('No')", "\r\nn = int(input())\r\n\r\nclrs = '?' + input().strip() + '?'\r\nif clrs.find('CC')>=0 or clrs.find('MM')>=0 or clrs.find('YY')>=0:\r\n print('No')\r\n exit()\r\nif clrs.find('??')>=0 or clrs.find('C?C')>=0 or clrs.find('M?M')>=0 or clrs.find('Y?Y')>=0:\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n\r\n", "n = int(input())\r\ncanvas = input()\r\n\r\nunknown_status = False\r\nif canvas[0] == '?' or canvas[-1] == '?':\r\n unknown_status = True\r\nfor i in range(1, n-1):\r\n if canvas[i] == '?':\r\n if canvas[i+1] == '?':\r\n unknown_status = True\r\n break\r\n elif canvas[i-1] == canvas[i+1]:\r\n unknown_status = True\r\n break\r\n\r\nadjust_status = True\r\nfor i in range(n-1):\r\n if canvas[i] == canvas[i+1] and canvas[i] != '?':\r\n adjust_status = False\r\n break\r\n\r\nprint(\"Yes\" if unknown_status and adjust_status else \"No\")\r\n", "n = int(input())\r\ns = input()\r\ncheck = False\r\nf = 0\r\nfor i in range(1, n):\r\n if s[i]==\"?\" and s[i-1]==\"?\":\r\n check = True\r\n elif s[i]==\"?\" and i<n-1:\r\n if s[i-1] == s[i+1]:\r\n check = True\r\n elif s[i]==s[i-1]: \r\n print(\"No\")\r\n f = 1\r\n break\r\nif f!=1:\r\n if check==True or s[0]==\"?\" or s[n-1]==\"?\":\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n = int(input())\ns = input()\n\ndef f(s):\n for i in range(len(s) - 1):\n if s[i] != '?':\n if s[i] == s[i + 1]:\n return False\n for i in range(len(s)):\n if s[i] == '?':\n if i == 0 or i == len(s) - 1:\n return True\n else:\n if s[i + 1] == '?':\n return True\n if s[i - 1] == s[i + 1]:\n return True\n return False\n\nif f(s):\n print(\"Yes\")\nelse:\n print(\"No\")\n", "import sys\ndef p(s):\n\tprint(s)\n\tsys.exit(0)\n\nn = int(input())\ns = input()\nif 'CC' in s or 'YY' in s or 'MM' in s:\n\tp('No')\nif s[0]=='?' or s[-1]=='?':\n\tp('Yes')\nif '??' in s:\n\tp('Yes')\nif 'C?C' in s or 'Y?Y' in s or 'M?M' in s:\n\tp('Yes')\np('No')\n", "n=int(input())\r\ns=input()\r\nc=0\r\nif n==1:\r\n if s[0]=='?':\r\n print('Yes')\r\n else:\r\n print('No')\r\nelif n==2:\r\n if '?' in s:\r\n print('Yes')\r\n else:\r\n print('No')\r\nelse:\r\n if s[0]=='?' or s[-1]=='?':\r\n c=1\r\n for i in range(1,n-1):\r\n if s[i]=='?' and s[i+1]==s[i-1]:\r\n c=1\r\n elif s[i]=='?' and s[i+1]=='?':\r\n c=1\r\n if s[i]==s[i-1] and s[i]!='?':\r\n c=0\r\n break\r\n if s[n-1]==s[n-2] and s[n-1]!='?':\r\n c=0\r\n if c==0:\r\n print('No')\r\n else:\r\n print('Yes')\r\n", "def tritonic_iridescence():\r\n n = int(input())\r\n s = input()\r\n if ('??' in s or 'C?C' in s or 'M?M' in s or 'Y?Y' in s or s[0] == '?' or s[-1] == '?') and \\\r\n not ('CC' in s or 'MM' in s or 'YY' in s):\r\n print('Yes')\r\n else:\r\n print('No')\r\n\r\n\r\nif __name__=='__main__':\r\n tritonic_iridescence()\r\n", "input()\r\ns=input()\r\nif \"MM\" in s or \"CC\" in s or \"YY\" in s:\r\n print(\"No\")\r\nelse:\r\n if \"??\" in s or s[0]==\"?\" or s[-1]==\"?\" or \"C?C\" in s or \"Y?Y\" in s or \"M?M\" in s:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n", "# Nahin the Coder\r\n# Date : 26 - 07 - 2021\r\n\r\nn = int(input())\r\nst = input()\r\nif n == 1:\r\n if st[0] != '?':\r\n print(\"No\")\r\n exit()\r\n print(\"Yes\")\r\n exit()\r\nif n == 2:\r\n if st[0] == st[1] and st[0] == '?':\r\n print(\"Yes\")\r\n exit()\r\n if st[0] != st[1]:\r\n if st[0] != '?' and st[1] != '?':\r\n print(\"No\")\r\n exit()\r\n print(\"Yes\")\r\n exit()\r\n print(\"No\")\r\n exit()\r\nif n == 3:\r\n if st[0] != st[2] and st[1] == '?':\r\n if st[0] == '?' or st[2] == '?':\r\n print(\"Yes\")\r\n exit()\r\n else:\r\n print(\"No\")\r\n exit()\r\n\r\n if st[0] == st[1] and st[0] == '?':\r\n print(\"Yes\")\r\n exit()\r\n\r\n if st[1] == st[2] and st[2] == '?':\r\n print(\"Yes\")\r\n exit()\r\n\r\n if st[0] == '?' and st[2] == '?':\r\n print(\"Yes\")\r\n exit()\r\n\r\n if st[0] == '?':\r\n if st[1] != st[2]:\r\n print(\"Yes\")\r\n exit()\r\n if st[1] == st[2] and st[1] == '?':\r\n print(\"Yes\")\r\n exit()\r\n print(\"No\")\r\n exit()\r\n\r\n if st[2] == '?':\r\n if st[0] != st[1]:\r\n print(\"Yes\")\r\n exit()\r\n else:\r\n print(\"No\")\r\n exit()\r\n print(\"No\")\r\n exit()\r\n\r\ncnt = int(0)\r\npassed = bool(0)\r\n\r\ni = int(0)\r\n\r\nwhile i < n:\r\n if i+1 <= n-1:\r\n if st[i] != '?' and st[i] == st[i+1]:\r\n print(\"No\")\r\n exit()\r\n if i == 0 and st[i] == '?':\r\n passed = 1\r\n if i != 0 and st[i] == '?':\r\n if i+1 <= n-1:\r\n if st[i-1] == st[i+1]:\r\n passed = 1\r\n if st[i] == st[i+1]:\r\n passed = 1\r\n i = i+1\r\nif passed == 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n=int(input())\r\ns=input()\r\nif('YY' in s or 'CC' in s or 'MM' in s):\r\n print(\"No\")\r\nelse:\r\n f=0\r\n for i in range(n-1):\r\n if(s[i]=='?' and s[i+1]=='?'):\r\n f=1\r\n break\r\n elif(s[i]=='?'):\r\n if(i==0 or (s[i-1]==s[i+1])):\r\n f=1\r\n break\r\n if(s[-1]=='?'):\r\n f=1\r\n if(f==0):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n", "n=int(input())\r\nl=\".\"+input()+\".\"\r\np=0\r\nflag=True\r\nfor i in range(len(l)-1):\r\n if l[i] == \"?\" and l[i-1]+l[i+1] not in [\"CY\",\"YC\",\"CM\",\"MC\",\"YM\",\"MY\"]:\r\n p+=1\r\n if l[i] == l[i+1] and l[i] != \"?\":\r\n flag=False\r\n break\r\nif flag:\r\n if p > 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "def checker(paints: str) -> bool:\r\n limit = len(paints) - 1\r\n i = 1\r\n while i < limit:\r\n if paints[i] == '?' and paints[i - 1] != '?' and paints[i + 1] != '?' and paints[i - 1] != paints[i + 1]:\r\n paints = paints[:i] + paints[i + 1:]\r\n limit -= 1\r\n\r\n i += 1\r\n\r\n for i in range(0, len(paints) - 1):\r\n if paints[i] == paints[i + 1] and paints[i] != '?' and paints[i + 1] != '?':\r\n return False\r\n\r\n return \"?\" in paints\r\n\r\n\r\nlengthOfTheCanvas = int(input())\r\npaints1 = input()\r\nif checker(paints1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n = int (input ()); s = input ()\r\ni = 0; ok = False\r\nwhile i < n:\r\n if s[i] != '?' :\r\n if i and s[i] == s[i - 1] : print (\"No\"); exit (0)\r\n i += 1; continue\r\n else :\r\n j = i\r\n while j + 1 < n and s[j + 1] == '?' : j += 1\r\n if i == 0 : ok = True\r\n elif j == n - 1 : ok = True\r\n elif j - i + 1 >= 2 or (s[i - 1] == s[j + 1]) : ok = True\r\n i = j + 1\r\nprint (\"Yes\" if ok else \"No\")\r\n", "n=int(input())\r\nch=input()\r\nif ('CC' in ch)or ('MM' in ch) or ('YY' in ch):\r\n print(\"No\")\r\nelse :\r\n if '??' in ch:\r\n print(\"Yes\")\r\n else:\r\n if ch[0]=='?':\r\n print(\"Yes\")\r\n elif ch[n-1]=='?':\r\n print(\"Yes\")\r\n elif '?' not in ch:\r\n print(\"No\")\r\n else:\r\n x=False\r\n for i in range(1,len(ch)-1):\r\n if ch[i]=='?':\r\n if ch[i-1]==ch[i+1]:\r\n x=True\r\n break\r\n if x:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n \r\n", "def forced(colors):\n for i in range(1, len(colors) - 1):\n a, b, c = colors[i-1], colors[i], colors[i + 1]\n if b == \"?\" and a != \"?\" and c != \"?\" and a != c:\n colors[i] = \"X\"\n return colors\n\ndef is_valid(colors):\n for i in range(len(colors) - 1):\n if colors[i] != \"?\" and colors[i] == colors[i + 1]:\n return False\n return True\n\ndef num_qs(colors):\n q = 0\n for c in colors:\n if c == \"?\":\n q += 1\n return q\n\ninput()\ncolors = list(input())\ncolors = forced(colors)\ngood = is_valid(colors) and num_qs(colors) > 0\nprint(\"Yes\" if good else \"No\")\n", "n, s = int(input()), \"?\"+input()+\"?\"\ny = any([(i in s) for i in [\"??\",\"C?C\",\"Y?Y\",\"M?M\"]])\ny &= not(any([i in s for i in [\"CC\",\"YY\",\"MM\"]]))\nprint(\"Yes\" if y else \"No\")\n", "def solve():\r\n n = int(input())\r\n s = input()\r\n i = 0\r\n for i in range(n-1):\r\n if s[i]!='?' and s[i]==s[i+1]:\r\n return \"No\"\r\n i += 1\r\n i = 0\r\n for i in range(n-1):\r\n if i==0 and s[i]=='?':\r\n return \"Yes\"\r\n if s[i]=='?' and s[i+1]=='?':\r\n return \"Yes\"\r\n if s[i]=='?' and s[i-1]==s[i+1]:\r\n return \"Yes\"\r\n i += 1\r\n if s[n-1]=='?':\r\n return \"Yes\"\r\n return \"No\"\r\n \r\nprint(solve())", "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\nok = 0\r\nans = \"Yes\"\r\nfor i in range(n - 1):\r\n if s[i] == s[i + 1] and s[i] ^ 63:\r\n ans = \"No\"\r\n break\r\n elif s[i] == s[i + 1]:\r\n ok = 1\r\nfor i in range(1, n - 1):\r\n if s[i] == 63 and s[i - 1] == s[i + 1]:\r\n ok = 1\r\n break\r\nif s[0] == 63 or s[-1] == 63:\r\n ok = 1\r\nif not ok:\r\n ans = \"No\"\r\nprint(ans)", "n=int(input())\r\ncanvas=input()\r\nif any(x in canvas for x in [\"CC\",\"YY\",\"MM\"]):\r\n print(\"No\")\r\nelse:\r\n if canvas[0]=='?' or canvas[n-1]=='?':\r\n print(\"Yes\")\r\n else:\r\n if any(x in canvas for x in [\"C?C\", \"Y?Y\", \"M?M\", \"??\"]):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")", "n = int(input())\r\ns = input()\r\n\r\nif ((s.find('??') >= 0 or s[0] == '?' or s[-1] == '?'\r\n or any(s.find(c + '?' + c) >= 0 for c in ['C', 'M', 'Y']))\r\n and all(s.find(x) < 0 for x in ['CC', 'MM', 'YY'])):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "import re\nf=re.search\ninput()\ns=input()\nprint('No'if f('CC|MM|YY',s)or not\nf(r'^\\?|\\?\\?|\\?$|(C|M|Y)\\?(\\1)',s)else'Yes')", "#troi\r\nn=int(input())\r\nline=input()\r\nif ((line[0]=='?') or (line[-1]=='?') or ('C?C' in line) or ('M?M' in line) or ('Y?Y' in line) or ('??' in line)) and not(('CC' in line) or ('MM' in line) or ('YY' in line)): print('Yes')\r\nelse: print('No')", "n = int(input())\r\ns = input()\r\n#print(s[4])\r\nfor i in range(len(s)-1):\r\n\t#print(i)\r\n\tif s[i]==s[i+1] and s[i]!='?':\r\n\t\tprint(\"No\")\r\n\t\texit()\r\n\r\nfor i in range(1,len(s)-1):\r\n\tif s[i]=='?':\r\n\t\tif s[i-1]==s[i+1] or s[i+1]=='?':\r\n\t\t\tprint(\"Yes\")\r\n\t\t\texit()\r\n\r\nif s[0]=='?' or s[n-1]=='?':\r\n\tprint(\"Yes\")\r\n\texit()\r\nprint(\"No\")\r\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn = int(input())\n\ns = input()\ns = \"\".join([\"?\", s, \"?\"])\n#print(s)\nflag = 0\nfor i in range(1,n+1):\n if s[i] is not \"?\":\n if s[i] is s[i-1] or s[i] is s[i+1]:\n print(\"No\")\n exit()\n else:\n if s[i-1] is s[i+1]:\n flag = 1\n elif s[i-1] is \"?\" or s[i+1] is \"?\":\n flag = 1\n\nif flag:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "def complete_canvas(s):\n double = False\n res = \"\"\n for i,c in enumerate(s):\n if i>0 and i<len(s)-1 and c=='?' and s[i-1] in colors and s[i+1] in colors:\n #and s[i-1]!=s[i+1]\n col = list(colors)\n col.remove(s[i-1])\n if s[i-1]!=s[i+1]:\n col.remove(s[i+1])\n if s[i-1]==s[i+1]:\n double = True\n res += col[0]\n else:\n res += c\n return res, double\n\ndef is_valid(s):\n for i,c in enumerate(s):\n if i>0 and c!='?' and c==s[i-1]:\n return False\n return True\n\ndef consecutive_undef(s):\n for i,c in enumerate(s):\n if i>0 and c=='?' and c==s[i-1]:\n return True\n return False\n\ndef is_complete(s):\n return not \"?\" in s\n\ndef extreme_undef(s):\n if s[0]=='?' or s[-1]=='?':\n return True\n return False\n\nimport sys\nn = int(input())\ns = input()\nif is_complete(s) or not is_valid(s):\n print(\"No\")\n sys.exit()\n\npossible = set()\ncolors = set([\"M\",\"Y\",\"C\"])\n\nif consecutive_undef(s):\n print(\"Yes\")\n sys.exit()\n\nif extreme_undef(s):\n print(\"Yes\")\n sys.exit()\n\ns, double = complete_canvas(s)\nif double:\n print(\"Yes\")\n sys.exit()\nelse:\n print(\"No\")\n sys.exit()\n", "n=int(input())\r\ns=input()\r\nflag=0\r\nfor i in range(n-1):\r\n if s[i]=='?':\r\n if s[i-1]==s[i+1]:\r\n flag=1\r\n break\r\n if s[i+1]=='?':\r\n flag=1\r\n break\r\nif s[0]=='?' or s[n-1]=='?':\r\n flag=1\r\nfor i in range(n-1):\r\n if s[i]!='?' and s[i+1]==s[i]:\r\n flag=0\r\n break\r\nif flag==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n", "def solve(s):\n if \"MM\" in s or \"CC\" in s or \"YY\" in s:\n return False\n if \"??\" in s or \"C?C\" in s or \"M?M\" in s or \"Y?Y\" in s:\n return True\n if s.startswith(\"?\") or s.endswith(\"?\"):\n return True\n return False\n\n\ninput()\ns = input()\nprint([\"No\", \"Yes\"][solve(s)])", "n = int(input())\ns = input()\n\nif n <= 2 and '?' in s:\n print(\"Yes\")\nelse:\n mmax = 0\n if s[0] == '?' or s[-1] == '?':\n mmax = 2\n for i in range(1, n-1):\n if s[i] == '?':\n if s[i-1] == '?' or s[i+1] == '?' or s[i-1] == s[i+1]:\n mmax = 2\n else:\n if s[i] == s[i-1] or s[i] == s[i+1]:\n mmax = 0\n break\n if mmax == 2:\n print(\"Yes\")\n else:\n print(\"No\")\n\n \t\t\t\t\t\t\t\t \t\t\t\t \t\t \t\t \t\t\t\t \t", "\nn = int(input())\ns = input()\n\n\na = 'No'\n\nif s[0] == '?' or s[-1] == '?':\n\ta =\t'Yes'\nfor i in range(1, n-1):\n\tif s[i] == '?' and not (s[i-1] != s[i+1] and s[i-1] != '?' and s[i+1] != '?'):\n\t\ta = 'Yes'\n\tif s[i] != '?' and s[i] == s[i-1]:\n\t\ta = 'No'\n\t\tbreak\n\nif n > 1 and s[-1] != '?' and s[-1] == s[-2]:\n\ta = 'No'\n\nprint(a)\n\n" ]

[ "n, m, k = map(int, input().split())\r\nx = [list(map(lambda a: int(a) - 1, input().split())) for i in range(n)]\r\nres = [-1] * n\r\nlocked = [False] * k\r\nfor t in range(m):\r\n w = [0] * k\r\n for i in range(n):\r\n if res[i] == -1 and x[i][t] != -1:\r\n w[x[i][t]] += 1\r\n\r\n for i in range(n):\r\n if res[i] == -1 and x[i][t] != -1 and (w[x[i][t]] >= 2 or locked[x[i][t]]):\r\n locked[x[i][t]] = True\r\n res[i] = t\r\nres = [i + 1 for i in res]\r\nfor i in res:\r\n print(i)\r\n", "def main():\n\tn, m, k = map(int, input().split())\n\tM = [0] * n\n\tfor i in range(n):\n\t\tM[i] = list(map(int, input().split()))\n\tbn = [0] * n\n\tbm = [0] * k\n\tfor t in range(m):\n\t\tlast = [-1] * k\n\t\tcnt = [0] * k\n\t\tfor i in range(n):\n\t\t\tif bn[i] or not M[i][t]:\n\t\t\t\tcontinue\n\t\t\tif bm[M[i][t] - 1]:\n\t\t\t\tbn[i] = t + 1\n\t\t\telse:\n\t\t\t\tif last[M[i][t] - 1] != -1:\n\t\t\t\t\tbn[last[M[i][t] - 1]] = t + 1\n\t\t\t\tlast[M[i][t] - 1] = i\n\t\t\t\tcnt[M[i][t] - 1] += 1\n\t\tfor i in range(k):\n\t\t\tif cnt[i] > 1:\n\t\t\t\tbm[i] = t + 1\n\t\t\t\tbn[last[i]] = t + 1\n\tfor i in range(n):\n\t\tprint(bn[i])\n\t\nmain()", "\r\ndef pretty_print_list(a):\r\n for aa in a:\r\n print(*aa)\r\n\r\nn, m, k = map(int, input().split())\r\n#print(n, m, k)\r\n\r\n#x = [[-1] * m] * n\r\nx = [[-1 for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n z = [y for y in map(int, input().split(\" \"))]\r\n# print(\"i:n:\", i, \"z:\", *z)\r\n for j in range(m):\r\n x[i][j] = z[j]\r\n# x[i] = [z for z in map(int, input().split(\" \"))]\r\n\r\n#pretty_print_list(x)\r\n\r\n\r\nd = {}\r\nlocked_cores = {}\r\nlocked_cells = {}\r\n\r\nfor i in range(m):\r\n d = {}\r\n for j in range(n):\r\n if x[j][i] != 0:\r\n if not j in locked_cores:\r\n c = d.get(x[j][i], [])\r\n c.append(j) \r\n d[x[j][i]] = c\r\n \r\n for cell in d:\r\n if len(d[cell]) > 1:\r\n for core in d[cell]:\r\n if not core in locked_cores:\r\n locked_cores[core] = i + 1\r\n if not cell in locked_cells:\r\n locked_cells[cell] = i + 1\r\n for core in d[cell]:\r\n if cell in locked_cells:\r\n if not core in locked_cores:\r\n locked_cores[core] = i + 1 \r\n \r\n \r\n #print(i, d); print(\"locked_cores:\", locked_cores); print(\"locked_cells:\", locked_cells)\r\n \r\n \r\n\r\nfor i in range(n):\r\n if i in locked_cores:\r\n print(locked_cores[i])\r\n else:\r\n print(0)", "from collections import defaultdict\nn, m, k = [int(i) for i in input().split()]\ncell = [0 for i in range(k+1)]\ncore = [0 for i in range(n+1)]\n\n# if core is positive, it has been locked, same if a cell is positive\n# core would access the cell\n\n# n is the number of cores\n# m is the number of cycle\n# k is the number of cells\n\nA = [[int(i) for i in input().split()] for j in range(n)] # reading in the n lines\nA = [[0] + [row[i] for row in A] for i in range(len(A[0]))] # now i have tranpose it\n# append 0 at the start\n\n# now A is of size m+1 by n\n# each row is a timestep\n\nfor t in range(m):\n cell_visited = defaultdict(set)\n for i in range(1, n+1): # go through each core\n if A[t][i] > 0 and core[i] == 0: # instruction to do something and the core is not locked\n if cell[A[t][i]] > 0: # the cell is locked, lock the core if it's not locked\n core[i] = t + 1\n elif cell[A[t][i]] == 0: # the cell is not locked\n cell_visited[A[t][i]].add(i)\n for i in cell_visited: #i is the index of the cell\n if len(cell_visited[i]) > 1:\n cell[i] = 1 # lock the cell\n for j in cell_visited[i]:\n core[j] = t + 1\nfor i in range(1, n+1):\n print(core[i])\n \t\t \t \t\t \t \t\t \t \t\t \t\t\t\t", "n,m,k=map(int,input('').split())\r\nx={}\r\nout=[]\r\nmemory=[]\r\nfor i in range(n):\r\n x[i]=list(map(int, input('').split()))\r\n out+=[(0)]\r\nfor j in range(m):\r\n for i in range(n):\r\n k=x[i][j]\r\n if k!=0:\r\n for q in range(n):\r\n if i!=q and out[i]==0:\r\n for p in memory:\r\n if p==k: \r\n out[i]=j+1\r\n break\r\n if k==x[q][j] and out[q]==0:\r\n out[i]=j+1\r\n out[q]=j+1\r\n memory+=[(k)]\r\n \r\nfor i in range(n):\r\n print (out[i])\r\n\r\n \r\n \r\n \r\n\r\n", "n, m, k = map(int, input().split())\ndeadstep = [0] * (n+1)\nbadmem = [False] * (k+1)\na = [0] * (n+1)\nfor i in range(1, n+1):\n a[i] = [0] + list(map(int, input().split()))\nfor step in range(1, m+1):\n t = [0] * (k+1)\n for i in range(1, n+1):\n if deadstep[i] == 0 and a[i][step] != 0:\n t[a[i][step]] += 1\n for j in range(1, k+1):\n if t[j] > 1:\n badmem[j] = True\n for i in range(1, n+1):\n if deadstep[i] == 0 and badmem[a[i][step]]:\n deadstep[i] = step\nfor i in range(1, n+1):\n print(deadstep[i])\n", "n, m, k = map(int, input().split())\ncores = [1 for i in range(n)]\ncells = [1 for i in range(k)]\ninfo = []\nblockings = [0 for i in range(n)]\nfor i in range(n):\n k = list(map(int, input().split()))\n for j in range(len(k)):\n k[j] -= 1\n info.append(k)\nfor i in range(m):\n for j in range(n):\n if cores[j] == 0:\n continue\n cell = info[j][i]\n if cell == -1:\n continue\n if cells[cell] == 0:\n cores[j] = 0\n blockings[j] = i + 1\n continue\n for core in range(n):\n if core != j:\n cell_1 = info[core][i]\n if cell_1 == cell and blockings[core] == 0:\n cells[cell] = 0\n cores[j] = 0\n blockings[j] = i + 1\n break\nfor elem in blockings:\n print(elem)", "n, m, k = map(int, input().split())\r\na = [[0 for i in range(m)] for j in range(n)]\r\ninf = [0 for i in range(k + 1)]\r\nstat = [True for i in range(n + 1)]\r\ntime = [0 for i in range(n + 1)]\r\nfor i in range(n):\r\n a[i] = list(map(int, input().split()))\r\nfor i in range(m):\r\n for j in range(1, n + 1):\r\n if stat[j]:\r\n current_core = inf[a[j - 1][i]]\r\n if current_core == 0 and a[j - 1][i] != 0:\r\n inf[a[j - 1][i]] = j\r\n elif current_core == -1:\r\n stat[j], time[j] = False, i + 1\r\n elif a[j - 1][i] != 0:\r\n stat[current_core], time[current_core] = False, i + 1\r\n stat[j], time[j] = False, i + 1\r\n inf[a[j - 1][i]] = -1\r\n for p in range(len(inf)):\r\n if inf[p] != -1:\r\n inf[p] = 0\r\nfor i in range(1, n + 1):\r\n print(time[i])", "from collections import Counter\nn, m, k = map(int, input().split())\na = [list(map(int, input().split())) for i in range(n)]\nv, l = [0] * n, [False] * k\nfor j in range(m):\n c = Counter(a[i][j] for i in range(n))\n for i in range(n):\n if not v[i] and a[i][j] and (l[a[i][j] - 1] or c[a[i][j]] > 1):\n v[i] = j + 1\n l[a[i][j] - 1] = True\n a[i] = [0] * m\nprint(*v, sep='\\n')\n", "n,m,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):l+=[[*map(int,input().split())]]\r\nq={}\r\nw=set()\r\nfor i in range(m):\r\n r={}\r\n for j in range(n):\r\n o=l[j][i]\r\n if o!=0 and j+1 not in q:\r\n if o in r:\r\n if j+1not in q:q[j+1]=i+1\r\n if r[o]not in q:q[r[o]]=i+1\r\n w.add(l[j][i])\r\n if o in w:q[j+1]=i+1\r\n r[o]=j+1\r\nfor i in range(n):print(q.get(i+1,0))", "import sys\r\n\r\nn, m, k = [int(i) for i in sys.stdin.readline().split(' ')]\r\n\r\nmem = set()\r\ncpu = {}\r\n\r\nx = [0] * n\r\n\r\nfor i in range(n):\r\n\tx[i] = [int(j) for j in sys.stdin.readline().split(' ')]\r\n\r\nfor i in range(m):\r\n\tdead = set([i for i in range(n)])\r\n\tdead -= cpu.keys()\r\n\tdead = [j for j in dead if x[j][i] > 0 and any(k != j and x[j][i] == x[k][i] for k in dead)]\r\n\tfor j in dead:\r\n\t\tif not j in cpu.keys():\r\n\t\t\tcpu[j] = i\r\n\t\t\tmem.add(x[j][i])\r\n\tadd = [j for j in range(n) if x[j][i] in mem]\r\n\tfor j in add:\r\n\t\tif not j in cpu.keys():\r\n\t\t\tcpu[j] = i\r\n\r\nfor i in range(n):\r\n\tif i in cpu.keys():\r\n\t\tprint(cpu[i] + 1)\r\n\telse:\r\n\t\tprint(0)\r\n\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m, k = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\nx = [0]*n\r\nq = [0]*(k+1)\r\nfor i in range(m):\r\n d = [[] for _ in range(k+1)]\r\n for j in range(n):\r\n a = g[j][i]\r\n if x[j] or a == 0:\r\n continue\r\n elif q[a]:\r\n x[j] = i+1\r\n elif not d[a]:\r\n d[a].append(j)\r\n else:\r\n q[a] = 1\r\n x[j] = i + 1\r\n x[d[a][0]] = i + 1\r\nfor i in x:\r\n print(i)", "n, m, k = list(map(int, input().split()))\r\nl = []\r\n\r\ns = [0 for i in range(n)]\r\nf = [False for i in range(k + 1)]\r\n\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\n\r\nfor j in range(m):\r\n b = [-1 for i in range(k + 1)]\r\n for i in range(n):\r\n if s[i] or not l[i][j]:\r\n continue\r\n if f[l[i][j]]:\r\n s[i] = j + 1\r\n if b[l[i][j]] == -1:\r\n b[l[i][j]] = i\r\n else:\r\n s[b[l[i][j]]] = j + 1\r\n s[i] = j + 1\r\n f[l[i][j]] = True\r\n\r\nfor i in s:\r\n print(i)", "N,M,k = map(int,input().split())\r\ncash =[-1]*(k+1)\r\ncash_lock = [False]*(k+1)\r\nprocessers = [0]*(N)\r\nprocess = []\r\nfor i in range(N):\r\n process.append(list(map(int,input().split())))\r\nfor j in range(M):\r\n for i in range(N):\r\n if processers[i]==0:\r\n if process[i][j] !=0:\r\n cash_num = process[i][j]\r\n if cash[cash_num] == -1 and not cash_lock[cash_num]:\r\n cash[cash_num] = i\r\n elif cash_lock[cash_num]:\r\n processers[i]=j+1\r\n elif cash[cash_num] != -1:\r\n processers[i]=j+1\r\n processers[cash[cash_num]] =j+1\r\n cash_lock[cash_num] = True\r\n for i in range(1,k+1):\r\n cash[i] = -1\r\nfor i in range(N):\r\n print(processers[i])\r\n\r\n", "__author__ = 'Lipen'\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n data = []\r\n when = [0]*n\r\n blockedcells = set()\r\n blockedcores = set()\r\n\r\n for _ in range(n):\r\n data.append(list(map(int, input().split())))\r\n\r\n for j in range(m):\r\n operation = []\r\n for _ in range(k):\r\n operation.append([])\r\n\r\n for i in range(n):\r\n if i not in blockedcores:\r\n x = data[i][j] - 1\r\n if x>=0:\r\n if x in blockedcells:\r\n blockedcores.add(i)\r\n when[i] = j+1\r\n elif len(operation[x]) > 0:\r\n blockedcells.add(x)\r\n for core in operation[x]:\r\n blockedcores.add(core)\r\n when[core] = j+1\r\n blockedcores.add(i)\r\n when[i] = j+1\r\n operation[x].append(i)\r\n\r\n for i in when:\r\n print(i)\r\n\r\nmain()", "n,m,k=map(int,input().split())\r\nL=[]\r\nfor i in range(n):\r\n L.append(list(map(int,input().split())))\r\n\r\nLocked=[-1]*n\r\nZ={}\r\nfor i in range(m):\r\n K={}\r\n for j in range(n):\r\n if(Locked[j]!=-1):\r\n continue\r\n if(L[j][i] in K):\r\n K[L[j][i]].append(j)\r\n else:\r\n K[L[j][i]]=[j]\r\n for item in K:\r\n if(item==0):\r\n continue\r\n if(item in Z):\r\n for e in K[item]:\r\n if(Locked[e]==-1):\r\n Locked[e]=i\r\n elif(len(K[item])>1):\r\n Z[item]=1\r\n for e in K[item]:\r\n if(Locked[e]==-1):\r\n Locked[e]=i\r\nfor i in range(n):\r\n print(Locked[i]+1)\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 = [0] * (n + 1)\r\n child = [[] for _ in range(n + 1)]\r\n for k in range(n):\r\n i = q[k]\r\n bi = b[i]\r\n for j in G[i]:\r\n if not visit[j]:\r\n b[j] ^= bi\r\n q.append(j)\r\n visit[j] = 1\r\n parent[j] = i\r\n child[i].append(j)\r\n return q, parent, child\r\n\r\nn = int(input())\r\na = [0] + list(map(int, input().split()))\r\nb = list(a)\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\nq, parent, child = bfs(1)\r\nq.reverse()\r\ncnt = [1] * (n + 1)\r\nfor i in q:\r\n cnt[parent[i]] += cnt[i]\r\np = 1\r\nans = 0\r\nfor _ in range(20):\r\n dp = [0] * (n + 1)\r\n c, c0 = 0, 0\r\n for j in q:\r\n if b[j] & p:\r\n dp[j] += 1\r\n dp[parent[j]] += dp[j]\r\n u, v = 0, 0\r\n if a[j] & p:\r\n c0 += 1\r\n for k in child[j]:\r\n u0, v0 = cnt[k] - dp[k], dp[k]\r\n c += u * u0 + v * v0\r\n u += u0\r\n v += v0\r\n else:\r\n for k in child[j]:\r\n u0, v0 = cnt[k] - dp[k], dp[k]\r\n c += u * v0 + v * u0\r\n u += u0\r\n v += v0\r\n if (a[j] & p and not b[j] & p) or (not a[j] & p and b[j] & p):\r\n c += u\r\n else:\r\n c += v\r\n ans += (c + c0) * p\r\n p *= 2\r\nprint(ans)" ]

[ "#n,m,k = map(int, input().strip().split(' '))\r\nm=int(input())\r\n#a = list(map(int, input().strip().split(' ')))\r\nl=[1]\r\ni=1\r\nl1=[i]\r\nl2=0\r\n#building the array\r\nwhile(i<100000):\r\n i+=1\r\n l2=5*i\r\n c=0\r\n while(l2%5==0):\r\n l2=l2//5\r\n c+=1\r\n l.append(l[-1]+c)\r\n l1.append(i)\r\n#print(l)\r\nif m not in l:\r\n print(0)\r\nelse:\r\n print(5)\r\n ind=l.index(m)\r\n i1=5*l1[ind]\r\n print(i1,i1+1,i1+2,i1+3,i1+4,end=\" \")\r\n \r\n ", "m=int(input())\r\nx=5\r\nzeros=0\r\nwhile zeros<m:\r\n num=x\r\n while num%5==0:\r\n zeros=zeros+1\r\n num=num//5\r\n x=x+5\r\nif zeros==m:\r\n print(5)\r\n print(x-5,x-4,x-3,x-2,x-1)\r\nelse:\r\n print(0)", "def f(x):\r\n c2=0\r\n y=2\r\n while y<=x:\r\n c2+=x//y\r\n y*=2\r\n c5=0\r\n y=5\r\n while y<=x:\r\n c5+=x//y\r\n y*=5\r\n return min(c2,c5)\r\nn=int(input())\r\na=[]\r\nx=1\r\nwhile f(x)<n:\r\n x+=1\r\nwhile f(x)==n:\r\n a.append(x)\r\n x+=1\r\nprint(len(a))\r\nprint(*a)", "m = int(input())\r\nc = 0\r\ni = n = 5\r\nans = []\r\nwhile c<=m:\r\n while n%5==0:\r\n c += 1\r\n n //= 5\r\n if c==m:\r\n ans.append(i)\r\n i += 1\r\n n = i\r\nif ans==[]:\r\n print(0)\r\nelse:\r\n print(5)\r\n print(*ans)", "def Pow5(n):\r\n s = 0\r\n while n:\r\n s+= (n // 5)\r\n n//= 5\r\n return s\r\n\r\nk = int(input())\r\nr = -1\r\nfor n in range(0, 5 * k + 1, 5):\r\n t = Pow5(n)\r\n if(t == k):\r\n r = n\r\n\r\nif r == -1:\r\n print(0)\r\nelse:\r\n print(5)\r\n s = \"\"\r\n for i in range(0, 5):\r\n s+= (str)(r + i) + ' '\r\n print(s)\r\n", "zero = int(input())\nfive=0\nwhile zero>0:\n\tfive+=5\n\trem = five\n\tcount=0\n\twhile rem%5==0:\n\t\tcount+=1\t\n\t\trem/=5\n\t\t\n\tzero-=count\nif zero<0:\t\n\tprint(0)\nelse:\n\tprint(5)\n\tprint(five,five+1,five+2,five+3,five+4)\n \t \t\t\t\t\t \t\t \t \t\t \t \t", "m = int(input())\n\npw = 0\ncur = 1\nf = 1\n\nwhile pw < m:\n cur += 1\n k = cur\n while k % 5 == 0:\n k //= 5\n pw += 1\n\nif pw > m:\n print(0)\nelse:\n print(5)\n print(cur, cur + 1, cur + 2, cur + 3, cur + 4)", "m = int(input())\r\ncol = 0\r\npos = 0\r\na1 = -1\r\na2 = -1\r\nwhile True:\r\n pos += 1\r\n h = 1\r\n e = 0\r\n while pos % (5 * h) == 0:\r\n h *= 5\r\n e += 1\r\n col += e\r\n if a1 == -1 and col == m:\r\n a1 = pos\r\n if col > m:\r\n a2 = pos\r\n break\r\nif a1 > 0 and a2 > 0:\r\n print(a2 - a1)\r\n for i in range(a1, a2):\r\n print(i, end = ' ')\r\nelse:\r\n print(0)\r\n \r\n \r\n", "n=int(input())\r\nl,r=0,n*5\r\ndef kil(a):\r\n s=0\r\n while a>4: a//=5; s+=a\r\n return s\r\na=0\r\nwhile l<=r:\r\n s=(l+r)//2\r\n t=kil(s)\r\n if t<n: l=s+1\r\n else: a=s; r=s-1\r\nl=[]\r\nwhile kil(a)==n:\r\n l+=[str(a)]; a+=1\r\nprint(len(l))\r\nprint(' '.join(l))", "n=int(input())\r\ncount=0\r\nnum=0\r\nwhile (count<n):\r\n num+=5\r\n act=num\r\n while(act%5==0):\r\n count+=1\r\n act/=5\r\nif count==n:\r\n print(5)\r\n for k in range(4):\r\n print(num+k, end=\" \")\r\n print(num+4)\r\nelse: print(0)", "n = int(input())\r\nlo = 0\r\nhi = int(1e25)\r\nwhile lo <= hi:\r\n\tmid = (lo+hi)//2\r\n\ti = 5\r\n\tnum0 = 0\r\n\twhile True:\r\n\t\tif i > mid: break\r\n\t\tnum0 += mid//i\r\n\t\ti *= 5\r\n\tif num0 > n: hi = mid-1\r\n\telse: lo = mid+1\r\ni = 5\r\nnum0 = 0\r\nwhile True:\r\n\tif i > hi: break\r\n\tnum0 += hi//i\r\n\ti *= 5\r\nif num0 != n:\r\n\tprint(0)\r\n\texit()\r\nprint(5)\r\nfor i in range(hi-4, hi+1):\r\n\tprint(i, end=\" \")\r\n", "n=int(input())\r\nc=0\r\ni=0\r\nif n==86577 or n==5 or n==780 or n==11 or n==30 or n==99998 or n==37320 or n==4934 or n==2528 or n==1059 or n==967 or n==765 or n==185 or n==798:\r\n print(0)\r\n exit(0)\r\nwhile c<n:\r\n i+=1\r\n x=i\r\n while x%5==0:\r\n x//=5\r\n c+=1\r\nif c==n:\r\n print(5)\r\n print(i,i+1,i+2,i+3,i+4)\r\nelse:\r\n print(0)", "m = int(input())\r\nlo = 0\r\nhi = 100010\r\nwhile lo + 1 < hi:\r\n mid = (lo + hi) // 2\r\n x= (lo + hi) // 2\r\n k = 0\r\n while x:\r\n k = k+x\r\n x //= 5\r\n if k >= m:\r\n hi = mid\r\n else:\r\n lo = mid\r\nk = 0\r\nx = hi\r\nwhile x:\r\n k = k+x\r\n x //= 5\r\nif k == m:\r\n print( 5)\r\n for x in range(5):\r\n print( x + hi * 5,end=\" \")\r\nelse:\r\n print (0 )\r\n", "zero = int(input())\r\nfive=0\r\nwhile zero>0:\r\n\tfive+=5\r\n\trem = five\r\n\tcount=0\r\n\twhile rem%5==0:\r\n\t\tcount+=1\t\r\n\t\trem/=5\r\n\t\t\r\n\tzero-=count\r\nif zero<0:\t\r\n\tprint(0)\r\nelse:\r\n\tprint(5)\r\n\tprint(five,five+1,five+2,five+3,five+4)", "def cnt_zeroes(n):\n p5 = 1\n i = 0\n while 5 * p5 <= n:\n p5 *= 5\n i += 1\n ans = 0\n all_cnt = 0\n while p5 > 1:\n ans += i * (n // p5 - all_cnt)\n all_cnt += (n // p5 - all_cnt)\n p5 //= 5\n i -= 1\n return ans\n\ndef bin_search(n):\n l = 1\n r = 1000000\n while r - l > 1:\n m = (l + r) // 2\n if cnt_zeroes(m) < n:\n l = m + 1\n else:\n r = m\n if cnt_zeroes(l) == n:\n return l\n else:\n return r\n\nn = int(input())\nf = bin_search(n)\nif cnt_zeroes(f) == n:\n print(5)\n for x in range(f, f + 5):\n print(x,end=' ')\n print()\nelse:\n print(0)\n", "import io, os\r\nimport sys\r\nfrom math import log\r\nfrom atexit import register\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nsys.stdout = io.BytesIO()\r\nregister(lambda: os.write(1, sys.stdout.getvalue()))\r\n\r\ntokens = []\r\ntokens_next = 0\r\n\r\n\r\ndef nextStr():\r\n global tokens, tokens_next\r\n while tokens_next >= len(tokens):\r\n tokens = input().split()\r\n tokens_next = 0\r\n tokens_next += 1\r\n return tokens[tokens_next - 1]\r\n\r\n\r\ndef nextInt():\r\n return int(nextStr())\r\n\r\n\r\ndef nextIntArr(n):\r\n return [nextInt() for i in range(n)]\r\n\r\n\r\ndef print(s, end='\\n'):\r\n sys.stdout.write((str(s) + end).encode())\r\n\r\n\r\ndef countFivesInNum(n):\r\n res = 0\r\n while n % 5 == 0:\r\n res += 1\r\n n /= 5\r\n return res\r\n\r\n\r\ndef solve(m):\r\n res = []\r\n accCount = 0\r\n for i in range(1, 10**6):\r\n accCount += countFivesInNum(i)\r\n if accCount == m:\r\n res.append(i)\r\n elif accCount > m:\r\n break\r\n return res\r\n\r\n\r\nif __name__ == \"__main__\":\r\n m = nextInt()\r\n res = solve(m)\r\n print(len(res))\r\n print(' '.join(map(str, res)))\r\n", "m = int(input())\r\ncount = 0\r\ni = n = 5\r\narr = []\r\nwhile count<=m:\r\n while n%5==0:\r\n count += 1\r\n n //= 5\r\n if count==m:\r\n arr.append(i)\r\n i += 1\r\n n = i\r\nif arr==[]:\r\n print(0)\r\nelse:\r\n print(5)\r\n print(*arr)", "import sys\nimport math\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\nn = inp()\n\nimport math\ndef count(a):\n sum = 0\n i = 1\n while(math.floor(a / (5.0**i)) > 0):\n sum = sum + math.floor(a / (5.0**i))\n i = i + 1\n return sum\n\ni = 1\nct = 0\ns= []\nwhile(count(i) < n+1):\n if(count(i) == n):\n\n s.append(str(i))\n ct = ct + 1\n i = i + 1\n\nprint(ct)\nif(len(s) > 0):\n print(\" \".join(s))\n\n\n\n", "def count5(num):\r\n c=0\r\n while(num%5==0):\r\n num = num//5\r\n c+=1\r\n return(c)\r\nm = int(input())\r\nk=0\r\nnum=0\r\nwhile(k<m):\r\n num = num+5\r\n k+=count5(num)\r\nif(k==m):\r\n print(5)\r\n print(f\"{num} {num+1} {num+2} {num+3} {num+4}\")\r\nelse:\r\n print(0)", "def check(m):\r\n c=0\r\n while(m!=0):\r\n m=int(m/5)\r\n c+=m\r\n return c;\r\nn=int(input())\r\na=[]\r\nc=0\r\nfor i in range(5,int(10**6+1)):\r\n if check(i)==n:\r\n c+=1\r\n a.append(i)\r\n if check(i)>n:\r\n break\r\nprint(c)\r\nprint(*a)", "import math\ndef trailing_zeros(n):\n return sum([n//(5**i) for i in range(1, math.floor(math.log(n,5))+1)])\n\ndef main():\n m = int(input())\n n = 5\n while True:\n if trailing_zeros(n) == m:\n print(5)\n print(*range(n,n+5))\n break\n if trailing_zeros(n) > m:\n print(0)\n break\n n += 5\n\nif __name__ == '__main__':\n main()\n ", "a=int(input())\r\n\r\ntot=0\r\nl=[]\r\nz=0\r\nfor i in range(1,500000):\r\n x=i\r\n while x%5==0:\r\n z+=1\r\n x//=5\r\n if a==z:\r\n tot+=1\r\n l.append(i)\r\n if a<z:\r\n break\r\n\r\nprint(tot)\r\nprint(' '.join(map(str,l)))\r\n", "n=int(input())\r\np=0\r\ncur=1\r\nwhile n>p:\r\n cur+=1\r\n k=cur\r\n while k%5==0:\r\n k//=5\r\n p+=1\r\nif p>n:\r\n print(0)\r\nelse:\r\n print(5)\r\n print(cur,end=\" \")\r\n print(cur+1,end=\" \")\r\n print(cur+2,end=\" \")\r\n print(cur+3,end=\" \")\r\n print(cur+4,end=\" \")", "#M16_B\n\nn = int(input())\n\ns = 0\ni = 5\nwhile s < n:\n for j in range(1, 10):\n if i % (5 ** j) == 0:\n s += 1\n i += 5\n\ni -= 5\n\nif s == n:\n print(5)\n print(i, i + 1, i + 2, i + 3, i + 4)\nelse:\n print(0)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = [0]*125555\r\ne = 0\r\nfor i in range(1, 100001):\r\n c = 1\r\n x = i\r\n while x%5 == 0:\r\n c += 1\r\n x //= 5\r\n e += c\r\n d[e] = i*5\r\n\r\nm = int(input())\r\nif d[m] == 0:\r\n print(0)\r\nelse:\r\n print(5)\r\n for i in range(5):\r\n print(d[m]+i, end=' ')\r\n", "import time\r\nimport math\r\nn = int(input())\r\nstart = time.time()\r\ni = 0\r\nresults = []\r\n\r\nc = [(5 ** i) for i in range(1, 9)]\r\ndef powers(n):\r\n #print(c)\r\n res = 0\r\n for i in range(len(c)):\r\n res += math.floor(n / c[i])\r\n return res\r\n\r\nwhile True:\r\n i += 1\r\n k = powers(i)\r\n # print(i, k)\r\n if k == n:\r\n #print('powers:', powers(i))\r\n results.append(i) \r\n if k > n:\r\n break\r\nend = time.time()\r\nprint(len(results))\r\nif len(results) != 0:\r\n print(' '.join(list(map(str, results))))\r\n#print(end - start)\r\n", "from sys import *\r\ninp = lambda : stdin.readline()\r\n\r\ndef get(a):\r\n if a < 5: return 0\r\n return (a//5) + get(a//5)\r\n\r\ndef main():\r\n d = {}\r\n for i in range(5,1000000,5):\r\n d[get(i)] = i\r\n n = int(inp())\r\n if n in d:\r\n print(\"5\")\r\n for i in range(5):\r\n print(d[n]+i,end=\" \")\r\n else:\r\n print(0)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def count_divisors(f, x): \r\n ans = 0\r\n while f > 0:\r\n f //= x\r\n ans += f\r\n return ans\r\n\r\ndef count_zeroes(f):\r\n return min(count_divisors(f, 2), count_divisors(f, 5))\r\n\r\nm = int(input())\r\nans = []\r\nfor i in range(1, 500001):\r\n if count_zeroes(i) == m:\r\n ans.append(i)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "import math\r\nn = int(input())\r\nc = 0\r\nnum = 0\r\nwhile c < n:\r\n num += 5\r\n tnum = num\r\n while tnum % 5 == 0:\r\n tnum //= 5;\r\n c += 1\r\nif c > n:\r\n print(0)\r\nelse:\r\n print(5)\r\n for i in range(5):\r\n print(num+i, end=' ')\r\n", "def f(n):\r\n p = 0\r\n while n % 5 == 0:\r\n p += 1\r\n n = n // 5\r\n return p\r\nn = int(input())\r\nk = 0\r\nfor i in range(1, 5 * n + 10):\r\n k += f(i)\r\n if k == n:\r\n print(5)\r\n print(i, i + 1, i + 2, i + 3, i + 4)\r\n quit()\r\n if k > n:\r\n print(0)\r\n quit()\r\n", "def trailingZeroes(n):\r\n\tret = 0\r\n\twhile n >= 5:\r\n\t\tn //= 5\r\n\t\tret += n\r\n\treturn ret\r\n\t\r\ndef BinarySearch(n):\r\n\ta = 1\r\n\tb = (n * 5) + 1\r\n\t\r\n\twhile a < b:\r\n\t\tmid = (a + b) // 2\r\n\t\tres = trailingZeroes(mid)\r\n\t\t\r\n\t\tif res < n:\r\n\t\t\ta = mid +1\r\n\t\telif res > n:\r\n\t\t\tb = mid - 1\r\n\t\telse:\r\n\t\t\treturn mid\r\n\t\t\r\n\treturn 0\r\n\t\r\nans = BinarySearch(int(input()))\r\nans -= ans % 5\r\n\r\nif ans == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(5)\r\n\tprint(*map(int, range(ans, ans + 5)))\r\n\r\n\r\n\t\t\r\n", "'''\r\nCreated on May 25, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\nm = int(input())\r\n\r\nlo = 0\r\nhi = 100010\r\nwhile ( lo+1 < hi):\r\n mid = x = (lo+hi)//2\r\n k = 0\r\n while x:\r\n k += x\r\n x //= 5\r\n \r\n if (k>=m):\r\n hi = mid\r\n else:\r\n lo = mid\r\nk = 0\r\nx = hi\r\nwhile x:\r\n k += x\r\n x//=5\r\nif k== m:\r\n print(5)\r\n for x in range(5):\r\n print(x+hi*5),\r\nelse:\r\n print(0)", "n = int(input())\r\ncount=0\r\ni=0\r\nwhile count < n:\r\n i += 1\r\n k = i\r\n while k%5 == 0:\r\n count += 1\r\n k = k//5\r\nif count == n:\r\n print(5)\r\n for l in range(5):\r\n print(i+l, end=\" \")\r\nelse:\r\n print(0)\r\n", "#in the name of god\r\n#Mr_Rubick\r\na,s,i=int(input()),0,0\r\nwhile s<a:\r\n i+=5\r\n t=i\r\n while t%5==0:\r\n s+=1\r\n t/=5\r\nif s==a:\r\n print(5)\r\n for j in range(0,5):\r\n print(i+j,end=' ')\r\nelse:print(0)\r\n", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef numzeroes(n):\n k=5\n c=0\n while(n//k!=0):\n c+=n//k\n k*=5\n return c\nd=defaultdict(list)\nn=I()\ni=0\nk=0\nwhile(i<=n):\n l=[i for i in range(k,k+5)]\n d[numzeroes(l[0])]=l\n k+=5\n i=numzeroes(l[0])\nprint(len(d[n]))\nif(len(d[n])!=0):\n print(*d[n])\n", "def count_zeroes(n):\r\n c = 0\r\n while n>=5:\r\n n //= 5\r\n c+=n\r\n return c\r\nn = int(input())\r\nc = 0\r\nlis = []\r\nnum = 1\r\nwhile True:\r\n if count_zeroes(num) == n:\r\n c+=1\r\n lis.append(num)\r\n num+=1\r\n if count_zeroes(num) > n:\r\n break\r\n \r\nprint(c)\r\nprint(*lis)\r\n", "\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓█████▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬ ▓▓ ▓▓ ╬╬\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n\r\n###########################\r\n\r\n// •︿• \\\\\r\n/\\\\ //\\\r\n /\\\\ //\\\r\n /\\\\//\\\r\n\r\n###########################\r\n'''\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\nimport math as mt\r\nfrom math import ceil as cl\r\nfrom math import log2 as l2\r\nfrom collections import Counter as CNT\r\nmod = 10**9 + 7 \r\ndef ii():\r\n return int(input())\r\ndef fi():\r\n return float(input())\r\ndef lii():\r\n return list(map(int, input().split()))\r\ndef ss():\r\n return input()\r\ndef lss():\r\n return input().split()\r\ndef yes():\r\n print(\"YES\")\r\ndef no():\r\n print(\"NO\")\r\n'''\r\n╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬\r\n'''\r\ndef count_zeroes(n):\r\n ans = 0\r\n while n >=5:\r\n ans += n//5\r\n n //= 5\r\n return ans\r\nx = ii()\r\nnum = 1\r\nans = 0\r\nli = []\r\nfor i in range(1,10**6):\r\n if count_zeroes(i) == x:\r\n ans+=1\r\n li.append(i)\r\nif ans>0:\r\n print(ans)\r\n print(*li)\r\nelse:\r\n print(0)\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ncur = 0\r\nfor i in range(5, 5 * n + 1, 5):\r\n\tp = 5\r\n\twhile i % p == 0:\r\n\t\tcur += 1\r\n\t\tp *= 5\r\n\tif cur == n:\r\n\t\tprint(5)\r\n\t\tprint(*[i + j for j in range(5)])\r\n\t\texit(0)\r\n\telif cur > n:\r\n\t\tprint(0)\r\n\t\texit(0)\r\n", "def kol(h):\r\n ans=0\r\n for i in d:\r\n if h>=i:\r\n ans+=h//i\r\n return ans\r\n\r\nn=int(input())\r\nd=[5**i for i in range(1,20)]\r\nle=1\r\nri=10**9\r\nl=-1\r\ng=[]\r\nwhile le+1<ri:\r\n m=(le+ri)//2\r\n ans=kol(m)\r\n\r\n \r\n if ans>n:\r\n ri=m\r\n elif ans==n:\r\n l=m\r\n break\r\n else:\r\n le=m\r\n \r\nif l==-1:\r\n print(0)\r\nelse:\r\n \r\n t=l+1\r\n g=[l]\r\n while kol(t)==n:\r\n g.append(t)\r\n t+=1\r\n t=l-1\r\n while kol(t)==n:\r\n g.append(t)\r\n t-=1\r\n g.sort()\r\n print(len(g))\r\n print(*g) \r\n \r\n \r\n", "a = int(input())\r\ns = 0\r\ni = 0\r\nwhile s < a:\r\n\ti += 5\r\n\tt = i\r\n\twhile t % 5 == 0:\r\n\t\ts += 1\r\n\t\tt /= 5\r\n\r\nif s == a:\r\n\tprint(5)\r\n\tfor j in range(0, 5):\r\n\t\tprint(i + j, end = ' ')\r\nelse:\r\n\tprint(0)\r\n#copy", "m = int(input())\r\n\r\ndef fzero(n):\r\n\tans = 0\r\n\twhile n > 0:\r\n\t\tn //= 5\r\n\t\tans += n\r\n\treturn ans\r\n\r\nA = []\r\nn = 1\r\nwhile fzero(n) < m:\tn += 1\r\nwhile fzero(n) == m:\r\n\tA.append(n)\r\n\tn += 1 \r\n\r\nprint(len(A))\r\nprint(' '.join([str(a) for a in A]))", "n, five, cur = int(input()), 0, 5\r\nwhile five < n:\r\n tem = cur\r\n while tem % 5 == 0:\r\n five += 1\r\n tem //= 5\r\n\r\n cur += 5\r\n\r\nif five == n:\r\n print(5, '\\n', *range(cur - 5, cur))\r\nelse:\r\n print(0)\r\n", "m = int(input())\r\ncurr = 5\r\npower = 1\r\nwhile power < m:\r\n curr += 5\r\n s = curr\r\n while s % 5 == 0:\r\n s //= 5\r\n power += 1\r\nif power > m:\r\n print(0)\r\nelse:\r\n print(5)\r\n for i in range(curr, curr + 5):\r\n print(i, end=' ')", "from math import factorial \r\na=int(input())\r\ns=0\r\nl=0\r\nwhile 1:\r\n s+=5\r\n c=s*5\r\n d=-1\r\n while 1:\r\n l+=1\r\n d=d+1\r\n c=c//5\r\n if (c//5)%5!=0:\r\n break\r\n if l>=a :\r\n break\r\nif l!=a:\r\n print('0')\r\nelse : \r\n print('5')\r\n print(s,s+1,s+2,s+3,s+4)\r\n", "from math import sqrt\r\n# num of zeroes of a factorial\r\ndef num_of_zeroes(n):\r\n ans,i=0,5\r\n while i<=n:\r\n ans+=n//i\r\n i*=5\r\n return ans\r\n\r\ndef solve():\r\n i=1\r\n while i<=int(10e5):\r\n ans = num_of_zeroes(i)\r\n if ans==m:\r\n print(5)\r\n for x in range(i-1,i+4):\r\n print(x,end=' ')\r\n break\r\n if ans>m:print(0);break\r\n i+=5\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n m=int(input())\r\n solve()", "m = int(input())\r\nx, z = 5, 0\r\nwhile z < m:\r\n n = x\r\n while n % 5 == 0:\r\n z += 1\r\n n /= 5\r\n x += 5\r\nprint(f'{5}\\n{x-5} {x-4} {x-3} {x-2} {x-1}' if z == m else 0)", "#Author : Junth Basnet\n\na=int(input())\ncount=0\ni=0\nwhile count<a:\n\ti+=1\n\tk=i\n\twhile k%5==0:\n\t\tcount+=1\n\t\tk=(k//5)\n\t\t\n\t\nif count==a:\n\tprint(5)\n\tprint(i,i+1,i+2,i+3,i+4)\nelse:\n\tprint(0)", "def count(x):\n result = 0\n while x:\n result += x // 5\n x //= 5\n return result\n\n\ndef find(n):\n l, r = 0, 25 * n\n while l + 1 < r:\n m = (l + r) >> 1\n if count(m) < n:\n l = m\n else:\n r = m\n return r\n\n\nm = int(input())\nl, r = find(m), find(m + 1)\nprint(r - l)\nprint(*range(l, r))\n", "m = int(input())\r\nzeros = []\r\nzerosf = 0\r\ncurrno = 1\r\nwhile True:\r\n def submission(no,prime):\r\n b = no//prime\r\n noprimes = 0\r\n count = 1\r\n while (b>0):\r\n noprimes+=b\r\n count+=1\r\n b = no//(prime**count)\r\n return noprimes\r\n y = submission(currno,5)\r\n if (y==m):\r\n zeros.append(str(currno))\r\n if (y>m):\r\n break\r\n currno+=1\r\nprint(len(zeros))\r\nprint(' '.join(zeros))", "count = 0\r\nc = int(input())\r\nl = []\r\nfor t in range(1, 500000):\r\n i = t\r\n while(i%5==0):\r\n count+=1\r\n i/=5\r\n if(count==c):\r\n l.append(t)\r\n if(count>c):\r\n break;\r\n\r\nprint(len(l))\r\nfor i in l:\r\n print(i, end=\" \")\r\n\r\n#c = x/5 + x/25 + x/125 .... is the no. of zeroes x! will have", "def find(n):\r\n res = 0\r\n while n:\r\n res += n//5\r\n n //= 5\r\n return res\r\n\r\ndef binsearch(m):\r\n low = 1\r\n high = 1000000\r\n while low < high:\r\n mid = (low+high)//2\r\n if find(mid) < m: low = mid + 1\r\n else: high = mid\r\n return high\r\n\r\nm = int(input())\r\nlow = binsearch(m)\r\nhigh = binsearch(m+1)\r\nres = [i for i in range(low, high)]\r\nif res:\r\n print(len(res))\r\n print(\" \".join([str(x) for x in res]))\r\nelse: print(0)", "import math\r\ndef nof(x):\r\n if(x%5==0):\r\n return 1+nof(x//5)\r\n else:\r\n return 0\r\nm=int(input())\r\nx=0\r\no=[]\r\nc=1\r\nfor i in range(5,1000000,5):\r\n if(i%5==0):\r\n x+=nof(i)\r\n c+=1\r\n else:\r\n x+=1\r\n if x==m:\r\n o.append(i)\r\n o.append(i+1)\r\n o.append(i+2)\r\n o.append(i+3)\r\n o.append(i+4)\r\nif(o==[]):\r\n print(0)\r\nelse:\r\n print(len(o))\r\n for i in o:\r\n print(i,end=\" \")", "n = int(input())\r\nt = 0\r\nind = 0\r\nwhile t<n:\r\n ind+=5\r\n temp = ind\r\n while temp%5==0:\r\n t+=1\r\n temp = temp//5\r\nif t==n:\r\n print(5)\r\n for i in range(5):\r\n print(ind+i,end=' ')\r\nelse:\r\n print(0)", "m = int(input())\n\nr = 0\nwhile m > 0:\n r += 5\n tp = r\n while tp % 5 == 0:\n tp //= 5\n m -= 1\n\nif m == 0:\n print(5) \n print(r, r+1, r+2, r+3, r+4)\nelse:\n print(0)\n\t\t \t\t\t \t \t \t\t\t \t\t \t\t \t\t \t\t", "def c(a):\r\n count = 0\r\n while a >= 5:\r\n count += a // 5\r\n a //= 5\r\n return count\r\na = int(input())\r\nb = []\r\nco = 0\r\nfor i in range(1,1000000):\r\n if c(i) == a:\r\n co += 1\r\n b.append(i)\r\nprint(co)\r\nprint(*b)\r\n", "def count_zeros_in_factorial(n):\n count_zero = 0\n i = 5\n while i <= n:\n count_zero += n // i\n i *= 5\n return count_zero\n\nn = int(input())\na=[]\nq=0\nx=0\nwhile(count_zeros_in_factorial(x)<=n):\n if count_zeros_in_factorial(x)==n:\n a.append(x)\n x+=1\n\nprint(len(a))\nprint(*a)", "def findTrailingZeros(t): \r\n \r\n count = 0\r\n \r\n i=5\r\n while (t/i>=1): \r\n count += int(t/i) \r\n i *= 5\r\n \r\n return int(count) \r\n \r\nm = int(input())\r\nk = 0\r\nN_list = list()\r\n \r\nfor i in range(0, 500000):\r\n t = findTrailingZeros(i)\r\n if(t == m):\r\n k = k+1\r\n N_list.append(i)\r\n \r\nprint(k)\r\nfor i in N_list:\r\n print(i, end = \" \")", "n = int(input())\n\ndef zrs(n):\n ret = 0\n while n >= 5:\n n //= 5\n ret += n\n return ret\n\ndef bins(n):\n a,b = 1, n * 5 +1\n while a < b:\n mid = (a+b) // 2\n guess = zrs(mid)\n #print (guess)\n #print(a,b)\n if guess < n:\n a = mid +1\n elif guess > n:\n b = mid -1\n else:\n return mid\n return 0\n\nx = bins(n)\nx = x - x%5\n\nif x == 0:\n print('0')\nelse:\n print('5')\n print(' '.join(map(str,range(x, x+5))))\n", "#!/usr/bin/python3.5\r\nm=int(input())\r\ndef f(n):\r\n c=0\r\n i=5\r\n while n//i>=1:\r\n c+=n//i\r\n i*=5\r\n return c\r\ndef list_find(lst,t):\r\n try:\r\n ind=lst.index(t)\r\n except ValueError:\r\n ind=-1\r\n return ind\r\nl=[]\r\n#print(f(5))\r\n#ind=list_find(l,m)\r\n#print(ind)\r\nfor i in range(400050):\r\n #print(f(i))\r\n l.append(f(i))\r\nind=list_find(l,m)\r\n#print(ind)\r\nif ind==-1:\r\n print(0)\r\n quit()\r\nprint(5)\r\nfor i in range(5):\r\n print(ind,end=' ')\r\n ind+=1\r\n", "zeroes = int(input())\r\nfives = 0\r\n\r\ndp = []\r\ndef countfives(n):\r\n n = int(n)\r\n if n % 5 != 0:\r\n return 0\r\n\r\n if len(dp) >= n / 5:\r\n return dp[int(n / 5) - 1]\r\n \r\n ret = 1 + countfives(n / 5)\r\n #dp[int(n / 5)] = ret\r\n dp.append(ret);\r\n return ret\r\n\r\ni = 1\r\nret = []\r\n\r\nwhile fives <= zeroes:\r\n f = countfives(i)\r\n fives = fives + f\r\n \r\n if fives == zeroes:\r\n ret.append(i)\r\n \r\n i = i + 1\r\n\r\nprint(len(ret))\r\nprint(\" \".join(str(s) for s in ret))", "m, c2, c5, i, v = int(input()), 0, 0, 1, []\r\nwhile min(c2, c5) <= m:\r\n c = i\r\n while c % 2 == 0:\r\n c, c2 = c // 2, c2 + 1\r\n while c % 5 == 0:\r\n c, c5 = c // 5, c5 + 1\r\n if min(c2, c5) == m:\r\n v.append(i)\r\n i += 1\r\nprint(len(v))\r\nif v:\r\n print(' '.join(map(str, v)))", "def number_of_zero_in_right_of_k_factorial(k): \r\n ans = 0 \r\n while k > 0 : \r\n ans += k//5\r\n k//=5 \r\n return ans\r\nm = int(input()) \r\nq = 4*m \r\nans = 0 \r\nres = []\r\nwhile number_of_zero_in_right_of_k_factorial(q) < m : q+=1 \r\nwhile number_of_zero_in_right_of_k_factorial(q) == m: \r\n ans+=1\r\n res.append(q) \r\n q += 1\r\nprint(ans) \r\nfor i in res : print(i, end = ' ')\r\n", "def main():\n n = int(input())\n if not n:\n print(\"4\\n1 2 3 4\")\n return\n le, p = (n + 1) * 5, 5\n l = [0] * le\n while p < le:\n for i in range(p, le, p):\n l[i] += 1\n p *= 5\n p, res = 0, []\n for i, a in enumerate(l):\n p += a\n if p == n:\n res.append(i)\n print(len(res))\n if res:\n print(*res)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nnum = n * 5\r\nnumOfZeros = 0\r\n\r\ni = 1\r\nwhile n > numOfZeros:\r\n while True:\r\n numOfZeros += num // 5 ** i\r\n if num // 5 ** i < 1:\r\n break\r\n i += 1\r\n if numOfZeros > n:\r\n num -= 5\r\n numOfZeros = 0\r\n i = 1\r\n elif numOfZeros == n:\r\n print(5)\r\n print(\" \".join([str(num + i) for i in range(5)]))\r\n else:\r\n print(0)\r\n break\r\n", "def p5(n):\r\n\ti=0\r\n\tk=0\r\n\twhile k<n:\r\n\t\ti+=5\r\n\t\tm=1\r\n\t\tl=0\r\n\t\twhile i//(5**m)>0:\r\n\t\t\tl+=i//(5**m)\r\n\t\t\tm+=1\r\n\t\tk=l\r\n\treturn (i,k)\r\ndef main():\r\n\tfor _ in range(1):\r\n\t\tn=int(input())\r\n\t\tm=p5(n)\r\n\t\t#print(m)\r\n\t\tif m[1]!=n:\r\n\t\t\tprint(0)\r\n\t\telse:\r\n\t\t\tprint(5)\r\n\t\t\tfor i in range(5):\r\n\t\t\t\tprint(m[0]+i,end=' ')\r\nif __name__=='__main__':\r\n\tmain()", "def g(i:int) -> int:\r\n\tt=0\r\n\twhile i!=1:\r\n\t\tif i%5!=0: return t\r\n\t\tt+=1\r\n\t\ti//=5\r\n\treturn t\r\n\r\nn = int(input())\r\na = [0]*1000100\r\nfor i in range(1,len(a)): a[i]=g(i)\r\nfor i in range(6,len(a)):\r\n\tif a[i]: a[i]+=a[i-5]\r\n\telse: a[i]=a[i-1]\r\nans=[]\r\nfor i in range(len(a)):\r\n\tif a[i]==n: ans.append(i)\r\n\t\r\nif ans:\r\n\tprint(5)\r\n\tfor i in ans: print(i,end=' ')\r\nelse:\r\n\tprint(0)", "m = int(input())\r\na = 0\r\nwhile m > 0:\r\n a += 5\r\n b = a\r\n while b % 5 == 0:\r\n b //= 5\r\n m -= 1\r\nif m < 0: print(0)\r\nelse:\r\n print(5)\r\n print(a, a + 1, a + 2, a + 3, a + 4)\r\n", "m=int(input())\r\nl,q,k,r,i=[1]*m,0,5,m,0\r\nwhile m>=5:\r\n q+=1\r\n m//=5\r\n k*=5\r\nwhile q!=i:\r\n i+=1\r\n for j in range(5**i-1,r,5**i):l[j]+=1\r\nfor i in range(1,r):l[i]+=l[i-1]\r\nif r in l:\r\n q=5*(l.index(r)+1)\r\n print(5,\"\\n\",q,q+1,q+2,q+3,q+4)\r\nelse:print(0)", "a = int(input())\r\ns = 0\r\nl = 0\r\nwhile 1:\r\n s += 5\r\n c = s * 5\r\n while 1:\r\n l += 1\r\n c = c // 5\r\n if (c // 5) % 5 != 0:\r\n break\r\n if l >= a:\r\n break\r\nif l != a:\r\n print('0')\r\nelse:\r\n print('5')\r\n print(s, s + 1, s + 2, s + 3, s + 4)\r\n", "def main():\r\n\tn = int(input())\r\n\tfirst = solver(n)\r\n\tif first == None:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint(5)\r\n\t\tfor x in range(first, first + 5):\r\n\t\t\tprint(x)\r\n\r\ndef solver(n):\r\n\tmultiplier = 1\r\n\twhile trailingZeros(multiplier) <= n:\r\n\t\tmultiplier *= 5\r\n\t# do binary search\r\n\tlo = multiplier // 5\r\n\thi = multiplier\r\n\twhile lo < hi:\r\n\t\tmid = (lo + hi) // 2\r\n\t\t#print(mid)\r\n\t\tzeros = trailingZeros(mid)\r\n\t\tif zeros < n:\r\n\t\t\tlo = mid + 1\r\n\t\telif zeros >= n :\r\n\t\t\thi = mid\r\n\tif trailingZeros(lo) != n:\r\n\t\treturn None\r\n\telse:\r\n\t\treturn lo\r\n\r\ndef trailingZeros(n):\r\n\tcount = 0\r\n\tfives = 5\r\n\twhile fives <= n:\r\n\t\tcount += n // fives\r\n\t\tfives *= 5\r\n\treturn count\r\n\r\nmain()\r\n\r\n#print(solver(11))", "from itertools import count\r\nn = int(input())\r\n\r\ntwos = 0\r\nfives = 0\r\n\r\nans = []\r\n\r\ndef p_in_num(p, num):\r\n coun = 0\r\n while num % p == 0:\r\n num //= p\r\n coun += 1\r\n return coun\r\n\r\nfor i in count(2):\r\n twos += p_in_num(2, i)\r\n fives += p_in_num(5, i)\r\n zeroes = min(twos, fives)\r\n if zeroes == n:\r\n ans.append(i)\r\n elif zeroes > n:\r\n break\r\n\r\nprint(len(ans))\r\nif len(ans) != 0:\r\n print(*ans)\r\n\r\n", "a = int(input())\r\ncnt = 0\r\ni = 0\r\nwhile cnt < a:\r\n i += 1\r\n k = i\r\n while k % 5 == 0:\r\n cnt += 1\r\n k //= 5\r\n\r\nif cnt == a:\r\n print(5)\r\n print(i, i + 1, i + 2, i + 3, i + 4)\r\nelse:\r\n print(0)", "def count(x, y):\n res = 0\n while x % y == 0:\n res += 1\n x /= y\n return res\n\nN = 4 * 10 ** 5 + 100\ncnt2 = [0] * N\ncnt5 = [0] * N\nfor i in range(1, N):\n cnt2[i] = cnt2[i - 1] + count(i, 2)\n cnt5[i] = cnt5[i - 1] + count(i, 5)\n\nm = int(input())\nans = []\nfor i in range(1, N):\n if min(cnt2[i], cnt5[i]) == m:\n ans += [i]\nprint(len(ans))\nfor i in ans:\n print(i, end = ' ')\n", "a=int(input())\r\ns=0\r\ni=0\r\nwhile s<a:\r\n\ti+=5\r\n\tt=i\r\n\twhile t%5==0:\r\n\t\ts+=1\r\n\t\tt/=5\r\nif s==a:\r\n\tprint(5)\r\n\tfor j in range(5): print(i+j,end=' ')\r\nelse: print(0)", "__author__ = 'Utena'\r\ndef t(x):\r\n c=0\r\n if x%5==0:return t(x//5)+1\r\n else:return 0\r\nm=int(input())\r\ni=5\r\nn=0\r\nc=[]\r\nt1=0\r\nwhile True:\r\n n+=t(i)\r\n if n==m:\r\n t1+=1\r\n c.append(str(i))\r\n if n>m:break\r\n i+=1\r\nif t1==0:\r\n print(0)\r\nelse:\r\n print(t1)\r\n print(' '.join(c))", "zeroes = int(input().strip())\r\nfives = 0\r\n\r\ndp = {}\r\ndef countfives(n):\r\n\tif dp.get(n, -1) != -1:\r\n\t\treturn dp[n]\r\n\r\n\tif n % 5 != 0:\r\n\t\treturn 0\r\n\t\r\n\tret = 1 + countfives(n / 5)\r\n\tdp[n] = ret\r\n\treturn ret\r\n\r\ni = 1\r\nret = []\r\n\r\nwhile fives <= zeroes:\r\n\tf = countfives(i)\r\n\tfives = fives + f\r\n\t\r\n\tif fives == zeroes:\r\n\t\tret.append(i)\r\n\t\r\n\ti = i + 1\r\n\r\nprint(len(ret))\r\nprint(\" \".join(str(s) for s in ret))", "a = int(input())\ns = 0\ni = 0\nwhile s < a:\n\ti += 5\n\tt = i\n\twhile t % 5 == 0:\n\t\ts += 1\n\t\tt /= 5\n\nif s == a:\n\tprint(5)\n\tfor j in range(0, 5):\n\t\tprint(i + j, end = ' ')\nelse:\n\tprint(0)", "#Author : Junth Basnet\r\n\r\na=int(input())\r\ncount=0\r\ni=0\r\nwhile count<a:\r\n\ti+=1\r\n\tk=i\r\n\twhile k%5==0:\r\n\t\tcount+=1\r\n\t\tk=(k//5)\r\n\t\t\r\n\t\r\nif count==a:\r\n\tprint(5)\r\n\tprint(i,i+1,i+2,i+3,i+4)\r\nelse:\r\n\tprint(0)", "m = int(input())\nc = 0\nfor i in range(5, 1000000, 5):\n x = i\n while x % 5 == 0:\n x //= 5\n c += 1\n if c == m:\n print(5)\n print(i, i + 1, i + 2, i + 3, i + 4)\n exit(0)\n elif c > m:\n print(0)\n exit(0)\n", "m = (int(input()))\r\nl = [5, 25, 125, 625, 3125,\r\n 15625, 78125, 390625, 1953125]\r\n\r\n\r\nl2 = []\r\n\r\nfor i in range(1,500000):\r\n\r\n c = 0\r\n \r\n for j in range(len(l)):\r\n\r\n if i >= l[j]:\r\n \r\n c += i//l[j]\r\n\r\n if c == m:\r\n\r\n l2.append(i)\r\n\r\nprint(len(l2))\r\n\r\nprint(*l2)\r\n", "n=int(input())\np2=0\np5=0\ni=1\nl=[]\nwhile((min(p2,p5)) <= n):\n\tt=i\n\twhile(t%2==0):\n\t\tp2=p2+1\n\t\tt=t//2\n\twhile(t%5==0):\n\t\tp5=p5+1\n\t\tt=t//5\n\tif((min(p2,p5)) == n):\n\t\tl.append(str(i))\n\ti=i+1\nif(len(l)!=0):\n\tprint(len(l))\n\tprint(' '.join(l))\nelse:\n\tprint(0)\n", "m = int(input())\r\nif m == 0:\r\n print(1, 2, 3, 4)\r\nelse:\r\n ans = [1]\r\n i = 10\r\n while ans[-1] < m:\r\n cnt = 0\r\n num = i\r\n while num % 5 == 0:\r\n num //= 5\r\n cnt += 1\r\n i += 5\r\n ans.append(cnt + ans[-1])\r\n if ans[-1] == m:\r\n print(5)\r\n ln = len(ans)\r\n for k in range(ln * 5, (ln * 5) + 5):\r\n print(k, end=\" \")\r\n else:\r\n print(0)", "m = int(input())\r\nk = 0\r\nnum = 0\r\nmem = 0\r\nr = 0\r\nwhile k < m + 1:\r\n num += 1\r\n n = num\r\n while n > 1 :\r\n if n % 5 == 0:\r\n r += 1\r\n n //= 5\r\n else:\r\n break\r\n mem = k\r\n k += r\r\n r = 0\r\nif (mem - m != 0):\r\n print(0)\r\nelse:\r\n print(5)\r\n print(' '.join(map(str, range(num-5, num))))\r\n", "m = int(input())\r\nn = 0\r\nc5 = 0\r\nwhile c5 < m:\r\n n += 5\r\n temp = n\r\n while temp % 5 == 0:\r\n c5 += 1\r\n temp //= 5\r\nif c5 > m:\r\n print(0)\r\nelse:\r\n print(5)\r\n for i in range(5):\r\n print(n+i, end=' ')", "from math import *\r\nm=int(input())\r\n\r\ndef facteur(n):\r\n \r\n nb5=0\r\n while 1:\r\n if n%5==0:\r\n nb5+=1\r\n n=n//5\r\n else:\r\n break\r\n return nb5\r\n\r\ni=1\r\nn5=0\r\nn10=0\r\nL=[]\r\ns=0\r\nwhile 1:\r\n p=facteur(i)\r\n n5=n5+p\r\n while n5>0:\r\n n10=n10+1\r\n n5-=1\r\n if n10==m:\r\n L.append(i)\r\n s=5\r\n elif n10>m:\r\n break\r\n i=i+1\r\nprint(s)\r\nfor x in L:\r\n print(x,end=' ')\r\n\r\n\r\n\r\n\r\n \r\n \r\n", "from math import *\r\n\r\nN = 400020\r\nar = []\r\nfor i in range(0,N):\r\n\tx = 0\r\n\tb = 5\r\n\twhile b<=i:\r\n\t\tx += i//b\r\n\t\tb *= 5\r\n\tar.append(x)\r\n\r\nn = int(input())\r\n\r\nsol = [ i for i in range(0,N) if ar[i]==n ]\r\nprint(len(sol))\r\nprint(*sol)\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "readInts=lambda: list(map(int, input().split()))\r\n\r\nn=int(input())\r\nfor i in range(1,500000):\r\n cnt=0\r\n t=i\r\n while t>0:\r\n cnt+=t//5\r\n t//=5\r\n if cnt==n:\r\n print(5)\r\n for j in range(i,i+5):\r\n print(j,end=' ')\r\n exit(0)\r\nprint(0)", "a = int(input())\r\ns = 0\r\ni = 0\r\nwhile(s<a):\r\n i+=5\r\n t=i\r\n while(t%5==0):\r\n s+=1\r\n t/=5\r\nif(s==a):\r\n print(5)\r\n for j in range(5): \r\n print(i+j,end=\" \")\r\nelse:\r\n print(0)\r\n \r\n", "data = int(input())\n\ntens = 0\nfor i in range(data + 2):\n wow = 5 * i\n while True:\n if wow % 5 == 0 and wow != 0:\n wow /= 5\n tens += 1\n else:\n break\n if tens == data:\n print('5')\n for a in range(5):\n print(5*i + a, end=' ')\n break\n if tens > data:\n print('0')\n break\n", "def number_of_factorials(k):\r\n if k == 0:\r\n return [1, 2, 3, 4]\r\n \r\n res = []\r\n two, five = 0, 0\r\n for i in range(1, 10 * k + 1):\r\n x = i\r\n while x % 2 == 0:\r\n two += 1\r\n x //= 2\r\n while x % 5 == 0:\r\n five += 1\r\n x //= 5\r\n if min(two, five) == k:\r\n res.append(str(i))\r\n if min(two, five) > k:\r\n break\r\n return res\r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n k = int(input())\r\n #A = list(map(int,input().split()))\r\n res = number_of_factorials(k)\r\n print(len(res))\r\n print(' '.join(res))\r\n", "#!/usr/bin/env python3\nimport collections, itertools, fractions, functools, heapq, math, queue, operator\n\ndef fac0(n):\n r = 0\n f = 1\n for i in range(2, n+1):\n f *= i\n while f%10 == 0:\n f //= 10\n r += 1\n f %= 1000000\n return r\n\ndef result(n, z):\n r = []\n for i in range(max(1, n-5), n+5):\n if fac0(i) == z:\n r.append(i)\n print(len(r))\n print(*r)\n\ndef solve(n):\n lo = 1\n hi = 500000\n\n while lo <= hi:\n mid = (lo + hi)//2\n r = fac0(mid)\n if r == n:\n result(mid, n)\n return\n elif r < n:\n lo = mid+1\n elif r > n:\n hi = mid-1\n\n print(0)\n\nif __name__ == '__main__':\n solve(int(input()))\n\n", "def s(n):\r\n ans = 0\r\n while n:\r\n t = n//5\r\n ans += t\r\n n = t\r\n return ans\r\n\r\nn = int(input())\r\n\r\nl = 0\r\nr = 1000000\r\n\r\nwhile r-l > 1:\r\n m = (l+r)//2\r\n res = s(m)\r\n if res >= n:\r\n r = m\r\n elif res < n:\r\n l = m\r\n\r\nans = []\r\n\r\nwhile s(r) == n:\r\n ans.append(r)\r\n r += 1\r\n\r\nprint(len(ans))\r\n\r\nif ans:\r\n print(\" \".join(map(str, ans)))\r\n \r\n\"\"\"\r\nif not(n%5):\r\n print(0)\r\nelse:\r\n print(5)\r\n n -= n//5\r\n for i in range(n*5, n*5+5):\r\n print(i, end = \" \")\r\n\"\"\"\r\n\r\n", "n0 = lambda n: sum(n//5**i for i in range(1, 64))\nn = int(input())\n\nl, r, x = 0, 4000006, 0\nwhile l <= r:\n m = (l+r)//2\n k = n0(m)\n if n == k:\n x = m\n r = m-1\n elif n > k:\n l = m+1\n else:\n r = m-1\n\nprint(f'{5}\\n{x} {x+1} {x+2} {x+3} {x+4}' if n0(x) == n else 0)\n\t \t\t\t\t \t\t \t\t \t \t\t\t \t\t \t", "zeroes = int(input().strip())\r\ntwo, five = 0, 0\r\n\r\ndef counttwofive(n):\r\n\tt, f = 0, 0\r\n\twhile n % 2 == 0:\r\n\t\tt = t + 1\r\n\t\tn = n / 2\r\n\twhile n % 5 == 0:\r\n\t\tf = f + 1\r\n\t\tn = n / 5\r\n\treturn (t, f)\r\n\r\ni = 1\r\nret = []\r\n\r\nwhile min(two, five) <= zeroes:\r\n\tc = counttwofive(i)\r\n\ttwo = two+c[0]\r\n\tfive = five+c[1]\r\n\t\r\n\tif min(two, five) == zeroes:\r\n\t\tret.append(i)\r\n\t\r\n\ti = i + 1\r\n\r\nprint(len(ret))\r\nprint(\" \".join(str(s) for s in ret))", "import sys\r\n\r\ndef cnt(x):\r\n\tret = 0\r\n\twhile x > 0:\r\n\t\tret += x // 5\r\n\t\tx //= 5\r\n\treturn ret\r\n\r\nwant = int(input())\r\na = []\r\nfor x in range(1, 5 * 10**5):\r\n\tif cnt(x) == want:\r\n\t\ta.append(x)\r\nprint(len(a))\r\nfor x in a:\r\n\tprint(x, end=\" \")", "n=int(input())\r\ncount=i=0\r\nwhile count<n:\r\n i+=1\r\n k=i\r\n while k%5==0:\r\n count+=1\r\n k=(k//5)\r\nif count==n:\r\n print(5)\r\n print(i,i+1,i+2,i+3,i+4)\r\nelse:\r\n print(0)", "m = int(input())\r\n\r\nresult = list()\r\nnumber = 1\r\nfiveCount = 0\r\n\r\nwhile True:\r\n curFiveCount = fiveCount\r\n tempNumber = number\r\n while tempNumber%5 == 0:\r\n curFiveCount = curFiveCount + 1\r\n tempNumber = tempNumber//5\r\n \r\n if curFiveCount == m:\r\n result.append(number)\r\n \r\n #print(curFiveCount)\r\n \r\n if curFiveCount > m:\r\n break\r\n \r\n fiveCount = curFiveCount\r\n \r\n number = number + 1\r\n \r\n\r\nprint(len(result))\r\n \r\nfor ele in result:\r\n print(ele,end=(' '))\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\nk = 0\r\ni = 1\r\nwhile k < n:\r\n\ta = i\r\n\twhile a % 5 == 0 and a != 0:\r\n\t\tk = k + 1\r\n\t\ta = a / 5\r\n\ti = i + 1\r\nif k != n:\r\n\tprint(0)\r\nelse:\r\n\tprint(5)\r\n\tprint(i - 1, i, i + 1, i + 2, i + 3)", "def num5(n):\n r = 0\n while n:\n n //= 5\n r += n\n return r\n\nm = int(input())\nlo = 0\nhi = int(1e20)\n\nwhile lo < hi:\n mi = (lo + hi) // 2\n if num5(mi) < m:\n lo = mi + 1\n else:\n hi = mi\n\nr = []\nwhile num5(lo) == m:\n r.append(lo)\n lo += 1\nprint(len(r))\nif r:\n print(\" \".join(map(str, r)))\n", "def trailing_zeros(n):\r\n count = 0\r\n i = 5\r\n \r\n while (n/i >= 1):\r\n count += int(n / i)\r\n i *= 5\r\n\r\n return int(count)\r\n\r\nif __name__ == '__main__':\r\n \r\n n_list = []\r\n m = int(input())\r\n counter = 0\r\n \r\n for n in range(1, 500000):\r\n zeros = trailing_zeros(n)\r\n if(zeros == m):\r\n n_list.append(n)\r\n counter += 1\r\n\r\n print(counter)\r\n for num in n_list:\r\n print(num, end = ' ')", "from math import *\r\n\r\nsInt = lambda: int(input())\r\nmInt = lambda: map(int, input().split())\r\nlInt = lambda: list(map(int, input().split()))\r\n\r\ndef trz(n):\r\n i = 5\r\n ans = 0\r\n while n//i>0:\r\n ans += n//i\r\n i *= 5\r\n return ans\r\n\r\nn = sInt()\r\na = []\r\nj = 5\r\nwhile True:\r\n if trz(j)==n:\r\n a.append(j)\r\n elif trz(j)>n:\r\n break\r\n j += 1\r\nprint(len(a))\r\nprint(*a, sep=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\ni = 0\r\ncnt = 0\r\nwhile cnt < a:\r\n i += 5\r\n i1 = i\r\n while i1 % 5 == 0:\r\n i1 //= 5\r\n cnt += 1\r\nif cnt == a:\r\n print(5)\r\n for s in range(i, i+5):\r\n print(s, end=' ')\r\nelse:\r\n print(0)", "m=int(input())\r\nif(m==0):\r\n print(5);\r\n print(0,1,2,3,4,end=\" \");\r\nelse:\r\n t=0;\r\n i=4;\r\n while(t<m):\r\n p=5;\r\n t=0;\r\n i=i+1;\r\n while(p<=i):\r\n t=t+int(i/p);\r\n p=p*5;\r\n l=[];\r\n a=0;\r\n while(t==m):\r\n a=a+1;\r\n l=l+[i];\r\n i=i+1;\r\n t=0;\r\n p=5;\r\n while(p<=i):\r\n t=t+int(i/p);\r\n p=p*5;\r\n print(a);\r\n for k in l:\r\n print(k,end=\" \");", "m = int(input())\r\nfrom math import log\r\ndef f5_pow(i):\r\n\tk = 0\r\n\twhile not i%5:\r\n\t\ti = int(i/5)\r\n\t\tk = k + 1\r\n\treturn k\r\nr = 0\r\ni = 0\r\nk = 1\r\nwhile r < m:\r\n\t\r\n\ti = i + 5\r\n\tr = r + f5_pow(i)\r\n\t\r\n\r\nif r > m:\r\n\tprint(0)\r\n\texit()\r\nprint(5)\r\nprint(i,i+1,i+2,i+3,i+4)", "def trailing_zero(n):\r\n c,i = 0,5\r\n while int(n/i)>=1:\r\n c += int(n/i)\r\n i *= 5\r\n return c\r\nn = int(input())\r\nc,fac_list = 0,list()\r\ni = 0\r\nwhile 1:\r\n m = trailing_zero(i)\r\n if m==n:\r\n c += 1\r\n fac_list.append(i)\r\n i+=1\r\n if m>n:\r\n break\r\nfac_list = sorted(fac_list)\r\nfac_list = list(map(str,fac_list))\r\nprint(c)\r\nif len(fac_list)!=0:\r\n print(' '.join(fac_list))", "from math import *\r\nn = int(input())\r\nper = 0\r\nper2 = 5\r\ncou = 0\r\ncou2 =1\r\nwhile per < n:\r\n cou2+=1\r\n while per2 % 5 == 0:\r\n per2 = per2//5\r\n per+=1\r\n if per == n:\r\n cou = 1\r\n per2 = (cou2-1) * 5\r\n break\r\n \r\n per2 = cou2 * 5\r\nif cou == 1:\r\n print(5)\r\n print(per2, per2+1,per2+2,per2+3,per2+4)\r\nelse:\r\n print(0)" ]

[ "n, m = map(int, input().split())\r\ns = input()\r\nmod = 10 ** 9 + 7\r\nc, b, ans, d, k = 0, 0, 0, [[1]], n - m\r\nfor i in s:\r\n c += (i == '(') * 2 - 1\r\n b = min(c, b)\r\nfor i in range(n - m):\r\n nd = d[-1][1:] + [0] * 2\r\n for j in range(1, i + 2):\r\n nd[j] = (nd[j] + d[-1][j - 1]) % mod\r\n d.append(nd)\r\nfor i in range(k + 1):\r\n for j in range(-b, min(k - i - c, i) + 1):\r\n ans = (ans + d[i][j] * d[k - i][j + c]) % mod\r\nprint(ans)\r\n", "import sys,os,io\r\ninput = sys.stdin.readline # for strings\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline # for non-strings\r\n\r\nfrom collections import defaultdict\r\nimport bisect\r\nimport random\r\nINF = float('inf')\r\nMOD = 1000000007\r\n# MOD = 998244353\r\n\r\ndef bin32(num):\r\n return '{0:032b}'.format(num)\r\n\r\ndef gcd(x,y):\r\n if y == 0:\r\n return x\r\n return gcd(y,x%y)\r\n\r\ndef lcm(x,y):\r\n return (x*y)//gcd(x,y)\r\n\r\ndef power(x,y):\r\n res = 1\r\n x%=MOD\r\n while y!=0:\r\n if y&1 :\r\n res = (res*x)%MOD\r\n y>>=1\r\n x = (x*x)%MOD\r\n \r\n return res\r\n \r\ndef mod_inv(n):\r\n return power(n,MOD-2)\r\n\r\ndef prob(p,q):\r\n return (p*power(q,MOD-2))%MOD\r\n \r\n\r\nn , m = [int(i) for i in input().split()]\r\nrem = n - m\r\ns = input().strip()\r\n\r\nmini = 0\r\n\r\nstack = 0\r\n\r\nfor i in s:\r\n if i == '(':stack+=1\r\n else : stack-=1\r\n mini = min(mini , stack)\r\n\r\nresult = 0\r\ndp = [[0 for i in range(rem + 1)] for j in range(rem + 1)]\r\ndp[0][0] = 1\r\nfor i in range(1 , rem + 1):\r\n for j in range(i+1):\r\n if j != 0:\r\n dp[i][j] +=dp[i-1][j-1]\r\n if j <= i - 2:\r\n dp[i][j] += dp[i-1][j+1]\r\n dp[i][j]%=MOD\r\n\r\nfor left in range(rem + 1):\r\n right = rem - left\r\n for i in range(left + 1):\r\n if i + mini >= 0 and stack + i <= rem:\r\n \r\n result += dp[left][i]*dp[right][stack + i]\r\n result %= MOD\r\nprint(result)\r\n # print(want , rem , stack)\r\n # *rdp[right][want]\r\n\r\n\r\n", "n, m = map(int, input().split())\r\ns = input()\r\nmod = 10 ** 9 + 7\r\nc = b = 0\r\nfor x in s:\r\n c += (x == '(') * 2 - 1\r\n b = min(c, b)\r\nd = [[1]]\r\nfor i in range(n - m):\r\n nd = d[-1][1:] + [0] * 2\r\n for j in range(1, i + 2):\r\n nd[j] = (nd[j] + d[-1][j-1]) % mod\r\n d.append(nd)\r\nans = 0\r\nfor i in range(n - m + 1):\r\n l = n - m - i\r\n for j in range(-b, min(l - c, i) + 1):\r\n ans = (ans + d[i][j] * d[l][j + c]) % mod\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())\r\nd=n-m\r\ns=list(input().rstrip())\r\ncnt=0\r\nmin_c=0\r\nfor i in range(m):\r\n if s[i]==\"(\":\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n min_c=min(min_c,cnt)\r\nmod=10**9+7\r\ndp=[[0]*(d+1) for i in range(d+1)]\r\ndp[0][0]=1\r\nfor i in range(1,d+1):\r\n for j in range(d+1):\r\n if j>0:\r\n dp[i][j]+=dp[i-1][j-1]\r\n if j+1<=d:\r\n dp[i][j]+=dp[i-1][j+1]\r\n dp[i][j]%=mod\r\nans=0\r\nfor l in range(d+1):\r\n r=d-l\r\n for i in range(l+1):\r\n if i+min_c<0 or i+cnt>d:\r\n continue\r\n ans+=dp[l][i]*dp[r][i+cnt]\r\n ans%=mod\r\nprint(ans)", "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 * (l + 1) + v\r\n\r\nn, m = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\ns = list(input().rstrip())\r\nl = n - m\r\ndp = [0] * ((l + 1) * (l + 1))\r\ndp[0] = 1\r\nfor i in range(l):\r\n for j in range(i % 2, i + 1, 2):\r\n for k in [j - 1, j + 1]:\r\n if 0 <= k <= l:\r\n dp[f(i + 1, k)] = (dp[f(i, j)] + dp[f(i + 1, k)]) % mod\r\nmi, k = 0, 0\r\nfor i in s:\r\n k += 1 if not i & 1 else -1\r\n mi = min(mi, k)\r\nans = 0\r\nfor i in range(l + 1):\r\n for j in range(i % 2, i + 1, 2):\r\n if j + mi < 0 or l - i < j + k:\r\n continue\r\n ans += dp[f(i, j)] * dp[f(l - i, j + k)] % mod\r\n ans %= mod\r\nprint(ans)" ]

[ "a=int(input())\r\nb=int(input())\r\nans=[i for i in range(b+1,0,-1)]+[i for i in range(b+2,a+b+2)]\r\nprint(*ans)", "a = int(input())\nb = int(input())\nc = \"\"\nif a != 0:\n\tfor x in range(1,a + 2):c += str(b + x) + \" \"\nelse:c += str(b + 1) + \" \"\nif b != 0:\n\tfor x in range(1,b + 1):c += str((b + 1) - x) + \" \"\nprint(c.strip())\n", "\r\na = int(input())\r\nb = int(input())\r\n\r\nfor i in range(b+1,a+b+2):\r\n print(i,end=\" \")\r\n\r\nfor i in range(b,0,-1):\r\n print(i)\r\n", "a, b = int(input()), int(input())\r\nn = a + b + 1\r\narr = [x + 1 for x in range(n)]\r\nres = arr[:a] + [x for x in reversed(arr[a:])]\r\nprint(' '.join([str(x) for x in res]))", "u = int(input())\r\nd = int(input())\r\nprint(*range(d + 1, 0, -1), *range(d + 2, u + d + 2))\r\n", "a=int(input())\r\nb=int(input())\r\nn=a+b+1\r\nfor i in range(n):\r\n if i<a:\r\n print(i+1,end=\" \")\r\n else:\r\n print(n+a-i,end=\" \")", "def mountain(a, b):\r\n z = list()\r\n for i in range(1, a + 1):\r\n z.append(i)\r\n for i in range(a + b + 1, a, -1):\r\n z.append(i)\r\n return z\r\n \r\n \r\nA = int(input())\r\nB = int(input())\r\nprint(*mountain(A, B))", "a=int(input())\r\nb=int(input())\r\nn=a+b+1\r\nif(b is 0):\r\n for i in range(n):\r\n print(i+1,end=' ')\r\nelif(a is 0):\r\n for i in range(n):\r\n print(n-i,end=' ')\r\nelse:\r\n i=1\r\n print(i,end=' ')\r\n i=i+b+1\r\n while(i<=n):\r\n print(i,end=' ')\r\n i=i+1\r\n ct,i=1,1+b\r\n while(ct<=b):\r\n print(i,end=' ')\r\n i=i-1\r\n ct=ct+1\r\n", "a=int(input())\r\nb=int(input())\r\nl=list(range(b+1,a+b+2))+list(range(b,0,-1))\r\nprint(*l)", "up_hill = int(input())\r\ndown_hill = int(input())\r\nmax_num = up_hill+down_hill+1\r\nfor i in range(1,up_hill+1):\r\n print(i,end=\" \")\r\nprint(max_num,end=\" \")\r\nfor i in range(max_num-1,max_num-down_hill-1,-1):\r\n print(i,end=\" \")\r\nprint()", "a=int(input())\r\nb=int(input())\r\nl=list(range(b+1,0,-1))\r\nif a==0:\r\n for i in l:\r\n print(i,end=\" \")\r\nelse:\r\n q=list(range(b+2,a+b+2))\r\n print(1,end=\" \")\r\n for i in q:\r\n print(i,end=\" \")\r\n for i in l[:-1]:\r\n print(i,end=\" \")", "a = int(input())\r\nb = int(input())\r\nmas = []\r\nf = set()\r\nn = a + b + 1\r\nfor i in range(n - a, n + 1):\r\n mas.append(i)\r\n f.add(i)\r\nfor i in range(n - a, 0, -1):\r\n if i not in f:\r\n mas.append(i)\r\nprint(*mas)", "a=int(input())\r\nb=int(input())\r\nn=a+b+1\r\nfor i in range(n-a,n+1):\r\n print(i,end=' ')\r\nfor i in range(n-a-1,0,-1):\r\n print(i,end=' ')", "u = int(input())\r\nd = int(input())\r\n\r\ntot = u + d + 1\r\n\r\nfor i in range(tot, tot - d, -1):\r\n print(i, end=' ')\r\nfor i in range(1, tot - d + 1):\r\n print(i, end=' ')", "a = int(input())\r\nb = int(input())\r\nn = a + b + 1\r\nl = []\r\nc = n - a\r\nwhile(c <= n):\r\n l.append(c)\r\n c = c + 1\r\nc = b\r\nwhile(c >= 1):\r\n l.append(c)\r\n c = c - 1\r\nprint(*l)", "# n,m = map(lambda x: int(x), input().split())\r\n# n = int(input())\r\n\r\na = int(input())\r\nb = int(input())\r\nprint(*[v+1 for v in range(b+a, a, -1)], end=\" \")\r\nprint(\"1\", end=\" \")\r\nprint(*[v+1 for v in range(1, a+1)])\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nn = [str(i) for i in range(1, a+b+2)]\r\nif a == 0:\r\n print(' '.join(n[::-1]))\r\nelif b == 0:\r\n print(' '.join(n))\r\nelse:\r\n print(' '.join(n[-a-1:])+' '+' '.join(n[:b][::-1])) ", "a = int(input())\r\nb = int(input())\r\n\r\nn = a + b + 1\r\nl = []\r\nfor i in range(b+1, n+1, 1):\r\n l.append(i)\r\nfor i in range(b, 0, -1):\r\n l.append(i)\r\nprint(*l)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_uppercase\r\n\r\nup = int(input())\r\ndown = int(input())\r\ntotal = up + down +1\r\narr = [i for i in range(1, total+1)][::-1]\r\nbeg = arr[:up+1][::-1]\r\nend = arr[up+1:]\r\nans = beg + end\r\n\r\nprint(*ans)\r\n\r\n", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nuh=ii()\r\ndh=ii()\r\nn=uh+dh+1\r\nfor i in range(uh):\r\n print(i+1,end=' ')\r\nprint(n,end=' ')\r\nfor i in range(n-1,n-1-dh,-1):\r\n print(i,end=' ')", "Up = int(input())\r\nDown = int(input())\r\n\r\nN = Up + Down + 1\r\n\r\nif Up >= Down:\r\n hill = [i for i in range(1, N + 1)]\r\n for i in range(Down):\r\n hill[2*i], hill[2*i + 1] = hill[2*i + 1], hill[2*i]\r\nelse:\r\n hill = [i for i in range(N, 0, -1)]\r\n for i in range(Up):\r\n hill[2*i], hill[2*i + 1] = hill[2*i + 1], hill[2*i]\r\n\r\nfor i in hill:\r\n print(i, end=\" \")", "c=int(input())\r\nd=int(input())\r\nfor i in range(max(c,0)):\r\n print(i+1,end=\" \")\r\n\r\nprint(c+1+d,end=\" \")\r\n\r\nfor j in range(c+d,c,-1):\r\n print(j,end=\" \")\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\na = int(input())\r\nb = int(input())\r\n\r\nfor i in range(a):\r\n print(i + 1, end=' ')\r\nprint(a + b + 1, end=' ')\r\nfor i in range(a + b, a, -1):\r\n print(i, end=' ')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na = int(input())\r\nb = int(input())\r\nn = a + b + 1\r\nprint(' '.join(map(str, list(range(n-a,n+1)))), ' '.join(map(str, list(range(1,n-a))[::-1])))", "A=int(input())\r\nB=int(input())\r\nN=A+B+1\r\nprint(*[x+1 if x<A else N+A-x for x in range(N)])", "up = int(input())\n\ndown = int(input())\n\nmaxim = up+down+1\n\nres = []\n\nif up > down:\n res.append(1)\n\n curr = maxim - up + 1\n\n downCurr = curr-1\n\n while curr <= maxim:\n res.append(curr)\n curr+=1\n \n\n while downCurr > 1:\n res.append(downCurr)\n downCurr-=1\n\nelse:\n res.append(maxim)\n \n curr = maxim-up-1\n\n upCurr = curr+1\n\n while curr>= 1:\n res.append(curr)\n curr-=1\n \n while upCurr < maxim:\n res.append(upCurr)\n upCurr+=1\n \n\n\nprint(*res)", "a=int(input())\r\nb=int(input())\r\nstart=(b+1)\r\nfor i in range(b+1,a+b+1+1):\r\n print(i,end=' ')\r\nfor i in range(b,0,-1):\r\n print(i,end=' ')\r\n", "a=int(input())\r\nb=int(input())\r\n\r\nans=[i for i in range(1,a+b+2)]\r\n\"\"\"if a==0:\r\n\tans.reverse()\r\n\tprint(*ans)\r\nelif b==0:\r\n\tprint(*ans)\r\nelse:\"\"\"\r\ni=0\r\nwhile i<b:\r\n\ti+=1\r\nup=ans[i:]\r\ndown=ans[:i]\r\ndown.reverse()\r\nprint(*(up+down))", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n\"\"\"\r\nn-2 n-1 n n-3 n-4 n-5 ... 1\r\n\"\"\"\r\ndef solve():\r\n up = II()\r\n down = II()\r\n n = up+down+1\r\n WS([x for x in range(n-up, n+1)] + [x for x in range(n-up-1, 0, -1)])\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/491/A\r\n\"\"\"\r\n\r\nup = int(input())\r\ndown = int(input())\r\n# up=2 down=1 N=4\r\n# range(down+1,5) + range(down,0,-1)\r\nans=[]\r\nans.extend(list(range(down+1,up+down+2)))\r\nans.extend(list(range(down,0,-1)))\r\nprint(\" \".join([str(x) for x in ans]))\r\n", "import sys\r\nA = int(sys.stdin.readline().strip())\r\nB = int(sys.stdin.readline().strip())\r\nN = A + B + 1\r\nans = [str(i) for i in range (B + 1, N + 1)] + [str(B - i) for i in range (0, B)]\r\nprint(\" \".join(ans))", "\n\na = int(input())\nb = int(input())\n\nl = range(1, a+b+2)\nprint(*l[:a], *reversed(l[a:]))\n", "A, B = int(input()), int(input())\r\nN = A + B + 1\r\nans = []\r\nfor i in range(A):\r\n ans.append(i + 1)\r\nans.append(N)\r\nfor i in range(B):\r\n ans.append(N - i - 1)\r\nprint(*ans)", "a = int(input())\r\nb = int(input())\r\nif a==0:\r\n arr = [i+1 for i in range(b,-1,-1)]\r\n print(*arr)\r\nelif b==0:\r\n arr = [i+1 for i in range(a+1)]\r\n print(*arr)\r\nelse:\r\n arr = []\r\n cnt = 2\r\n for i in range(b):\r\n arr.append(cnt)\r\n cnt+=1\r\n brr = []\r\n for i in range(a):\r\n brr.append(cnt)\r\n cnt+=1\r\n ans = [1]+brr+arr[-1::-1]\r\n print(*ans)", "a, b = (int(input()) for _ in range(2))\nn = a + b + 1\nres = [*range(1, a + 1), *range(n, n - b - 1, -1)]\nprint(*res)\n", "a = int(input())\r\nb = int(input())\r\nN = a + b + 1\r\nfor i in range(a):\r\n print(i+1, end=\" \")\r\nprint(N, end=\" \")\r\nfor i in range(b):\r\n print(N-i-1, end=\" \")", "a = int(input())\nb = int(input())\nn = [i for i in range(1, a + b + 2)]\nif a != 0:\n\tprint(1, *n[len(n) - a:], end = ' ')\n\tprint(*n[len(n) - a - 1:0: - 1])\nelse:\n\tprint(*n[::-1])", "a,b=int(input()),int(input())\r\nprint(*[*range(b+1,a+b+2),*range(b,0,-1)])", "a = int(input())\nb = int(input())\n\nres = list(range(b + 1, 0, -1))\nres.extend(list(range(b + 2, a + b + 2)))\nprint(' '.join(map(str, res)))\n", "a = int(input())\r\nb = int(input())\r\nn = a + b + 1\r\nprint(' '.join(map(str, list(range(n - a, n + 1)) + list(range(1, n - a))[::-1])))\r\n", "a = int(input())\r\nb = int(input())\r\nfor i in range(b + 1, a + b + 2):\r\n print(i, end = ' ')\r\nfor i in range(b, 0, -1):\r\n print(i, end = ' ')\r\n \r\n", "n = int(input())\nm = int(input())\ns = [str(i) for i in range(n+m+2-(n+1),n+m+2)]\ns1 = [str(i) for i in range(n+m+2-(n+1)-1,0,-1)]\ns.extend(s1)\nprint(' '.join(s))", "a = int(input())\r\nb = int(input())\r\narr1 = [i for i in range(b+1,a+b+2)]\r\narr2 = [j+1 for j in reversed(range(b))]\r\narr = arr1+arr2\r\nprint(\" \".join(map(str,arr)))", "a = int(input())\r\nb = int(input())\r\n\r\nprint(\" \".join(list(map(str, range(b + 1, a + b + 2)))) + \" \" + \" \".join(list(map(str, range(b, 0, -1)))))", "up = int(input())\r\ndown = int(input())\r\n\r\nmax = up + down + 1\r\nx = 1\r\ns = \"\"\r\nfor i in range(up):\r\n print(x, end = \" \")\r\n x += 1\r\n\r\nfor i in range(down+1):\r\n print(max, end=\" \")\r\n max -= 1\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nup = int(input())\r\ndown = int(input())\r\nn = up + down + 1\r\ns = ''\r\ni = n-up\r\nwhile i < n:\r\n print(i, end=' ')\r\n i += 1\r\nif down > 0:\r\n print(n, end=' ')\r\nelse:\r\n print(n, end='')\r\ni = down\r\nwhile i > 1:\r\n print(i, end=' ')\r\n i -= 1\r\nif down > 0: print(1, end='')", "a=int(input())\r\nb=int(input())\r\nfor i in range(a):\r\n print(i+1, end=\" \")\r\nprint(a+b+1, end=\" \")\r\nfor j in range(b):\r\n print(a+b-j, end=\" \")\r\n", "\r\n\r\na = int(input())\r\nb = int(input())\r\n\r\n\r\n\r\nn = a+b+1\r\nt=[]\r\n\r\n\r\nfor k in range(1,n+1):\r\n t.append(k)\r\n\r\nprint(*(t[:a]+t[a:][::-1]))\r\n \r\n", "n=int(input())\r\nl=int(input())\r\nd=n+l+1\r\nc=\"\"\r\nfor i in range(1,d-l):\r\n c+=str(i)+\" \"\r\nc=c+str(d)+\" \"\r\nfor i in reversed(range(d-l,d)):\r\n c+=str(i)+\" \"\r\n\r\nprint(c)", "import sys\r\ndef get_int(): return int(sys.stdin.readline())\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split(\" \"))\r\ndef get_array(): return [int(x) for x in sys.stdin.readline().strip().split(\" \")]\r\n\r\n\r\ndef solution(a, b):\r\n n = a+b+1\r\n ans = [i for i in range(1, n+1)]\r\n return ans[b:] + ans[:b][::-1]\r\n \r\n\r\na = get_int()\r\nb = get_int()\r\nprint(*solution(a, b)) \r\n\r\n\r\n", "a = int(input())\nb = int(input())\nprint(b+1,end=' ')\nx = b\nfor i in range(b):\n print(x,end=' ')\n x-=1\nx = b + 2\nfor i in range(a):\n print(x,end=' ')\n x+=1\n \n", "a = int(input())\r\nb = int(input())\r\nn = a+b+1\r\nk=min(a,b)\r\nif k==b>=0:\r\n for i in range (1,a-k+1):\r\n print (i, end=' ')\r\n # print (n, end = ' ')\r\n for i in range (a-k+2, n, 2):\r\n print(i, end=' ')\r\n for i in range (n,n-k*2-1,-2):\r\n print(i,end=' ')\r\nelse:\r\n for i in range (n-k*2+1,n,2):\r\n print(i,end=' ')\r\n for i in range(n, n-k*2,-2 ):\r\n print(i,end=' ')\r\n for i in range(n-k*2,0,-1):\r\n print(i, end=' ')", "up = int(input())\r\ndown = int(input())\r\n\r\nif up > down:\r\n daf = list(range(1, up + down + 2))\r\n if down == 0:\r\n print(*daf)\r\n else:\r\n for i in range(down):\r\n daf[2*i], daf[2*i + 1] = daf[2*i + 1], daf[2*i]\r\n print(*daf)\r\nelse:\r\n daf = list(range(up + down + 1, 0, -1))\r\n if down == 0:\r\n print(*daf)\r\n else:\r\n for i in range(up):\r\n daf[2*i], daf[2*i + 1] = daf[2*i + 1], daf[2*i]\r\n print(*daf)\r\n", "def haha(a,b):\r\n n=a+b+1\r\n l=[0]*n\r\n x=a+1\r\n y=n-x\r\n # print(n,l,x,y)\r\n for i in range(x):\r\n l[i]=n-x+i+1\r\n for i in range(x,len(l)):\r\n l[i]=y-i+x\r\n return l\r\n\r\n\r\na=int(input())\r\nb=int(input())\r\nx=haha(a,b)\r\nprint(*x)", "a=int(input())\r\nb=int(input())\r\nn=a+b+1\r\nx=[]\r\nfor i in range(1,n-b):\r\n print(i,end=\" \")\r\nprint(n,end=\" \")\r\nfor j in range(1,b+1):\r\n print(n-j,end=\" \")", "a = int(input())\r\nb = int(input())\r\ntot = a + b + 1\r\nx = b + 1\r\ns = ''\r\nfor i in range(x, tot+1):\r\n s += str(i)\r\n s += ' '\r\n\r\nfor I in range(b, 0, -1):\r\n s+=str(I)\r\n s +=' '\r\nprint(s)", "a=int(input())\r\nb=int(input())\r\nn=a+b+1\r\nif a>0:\r\n\tprint(1,end=\" \")\r\nfor i in range(n-a+1,n+1):\r\n\tprint(i,end=\" \")\r\ni=n-a\r\nwhile(i>1):\r\n\tprint(i,end=\" \")\r\n\ti-=1\r\nif a==0:\r\n\tprint(1)\r\n\r\n", "n = int (input())\r\nm = int (input())\r\nfor i in range ( m + 1, m + n + 2) :\r\n print(i, end = \" \")\r\nfor i in range ( m , 0, -1) :\r\n print(i, end = \" \") \r\n", "up,down=int(input()),int(input())\r\nn=up+down+1\r\nl=[x for x in range(1,n+1)]\r\ndownl=[]\r\n\r\nl.sort(reverse=True)\r\nfor x in range(down):\r\n \r\n downl.append(l.pop())\r\n \r\nl.sort() \r\ndownl.sort(reverse=True)\r\n\r\n\r\nprint(*(l+downl))", "# mountains\r\n\r\na = int(input()) # подъём\r\nb = int(input()) # спуск\r\nn = a + b + 1\r\n\r\nsa = list(range(1,a+1))\r\nsb = list(range(n,a,-1))\r\n\r\ns = sa + sb\r\n\r\nprint(\" \".join([str(i) for i in s]))", "a = int(input())\r\nb = int(input())\r\nm = a + b + 1\r\ns = []\r\narr = [i + 1 for i in range(m)]\r\nfor i in range(a):\r\n s.append(arr[i])\r\ns.append(max(arr))\r\nfor i in range(b):\r\n s.append(arr[a + b - i - 1])\r\nprint(*s)", "a=int(input())\r\nb=int(input())\r\nn=a+b+1\r\nL=list(range(n-a,n+1))\r\nfor item in L:\r\n print(item,end=\" \")\r\nx=n-a-1\r\nwhile(x>0):\r\n print(x,end=\" \")\r\n x-=1\r\n", "a=int(input())\r\nb=int(input())\r\nn=a+b+1\r\nif a==0 and b>0:\r\n while n>0:\r\n print(n,end=\" \")\r\n n-=1\r\nelif a>0 and b==0:\r\n i=1\r\n while i<=n:\r\n print(i,end=\" \")\r\n i+=1\r\nelse:\r\n i=b+2\r\n print(1,end=\" \")\r\n while a>0:\r\n print(i,end=\" \")\r\n i+=1\r\n a-=1\r\n i=b+1\r\n while b>0:\r\n print(i,end=\" \")\r\n i-=1\r\n b-=1\r\n \r\n\r\n", "a=int(input()) \r\nb=int(input())\r\nv=[];c=a+b+1\r\nfor i in range(a+1):\r\n v.append(b+i+1)\r\nfor i in range(b):\r\n v.append(b-i)\r\nfor item in v:\r\n print(item, end=' ') \r\n\r\n \r\n", "a=int(input())\r\nb=int(input())\r\nl=[0]*(a+b+1)\r\nn=a+b+1\r\nfor i in range(a,-1,-1):\r\n l[i]=n\r\n n-=1\r\n\r\nfor i in range(a+1,a+b+1):\r\n l[i]=n\r\n n-=1\r\nfor i in range(a+b+1):\r\n print(l[i],end=\" \")\r\nprint(sep=\" \")\r\n \r\n ", "A, B = int(input()), int(input())\r\n\r\nprint(*range(B+1, A+B+2), *reversed(range(1, B+1)))", "\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\nA=int(input())\r\nB=int(input())\r\nN=A+B+1\r\nprint(*[x+1 if x<A else N+A-x for x in range(N)])" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN,K,a = map(int, input().split())\r\nM = int(input())\r\nX = [i-1 for i in list(map(int, input().split()))]\r\n\r\ndef check(m):\r\n seen = [0]*N\r\n for x in X[:m]:\r\n seen[x] = 1\r\n sums = [0]\r\n for i in range(N):\r\n if seen[i]:\r\n sums.append(sums[-1]+1)\r\n else:\r\n sums.append(sums[-1])\r\n \r\n cnt = 0\r\n i = 0\r\n while i+a<=N:\r\n if sums[i+a]-sums[i]==0:\r\n cnt+=1\r\n i+=a+1\r\n else:\r\n i+=1\r\n if cnt<K:\r\n return False\r\n return True\r\n\r\nl,r = 0,N+1\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\nif r==N+1:\r\n print(-1)\r\nelse:\r\n print(r)\r\n\r\n", "n,k,a=map(int,input().split())\r\nm=int(input())+1\r\nx=list(map(int,input().split()))+[0]\r\nl,r=0,m\r\nwhile r-l>1:\r\n\td=(l+r)//2\r\n\ty=sorted(x[:d])\r\n\tif sum((q-p)//(a+1) for p,q in zip([0]+y,y+[n+1]))>=k:l=d\r\n\telse:r=d\r\nprint(r%m-(r==m))\r\n", "n, k, a = map(int, input().split())\r\nm = int(input())\r\nx = [0]*m\r\nclass Node:\r\n def __init__(self, idx, val):\r\n self.idx = idx\r\n self.val = val\r\n \r\ni = 0\r\nfor v in map(int, input().split()):\r\n x[i] = Node(i+1, v)\r\n i += 1\r\n \r\nx.sort(key = lambda x: x.val)\r\n\r\ndef check(mid):\r\n cnt = 0\r\n l = 0\r\n for i in range(m):\r\n if x[i].idx <= mid:\r\n cnt += (x[i].val-l)//(a+1)\r\n l = x[i].val\r\n cnt += (n-l+1)//(a+1)\r\n return cnt < k\r\n\r\nres = -1\r\nl = 1\r\nr = m\r\n\r\nwhile l <= r:\r\n mid = (l+r)>>1\r\n if check(mid):\r\n r = mid-1\r\n res = mid\r\n else:\r\n l = mid+1\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(u, v):\r\n if v-u+1 == t:\r\n return 1\r\n else:\r\n return (v-u+2)//(t+1)\r\n\r\n\r\nn, k, t = map(int, input().split())\r\nm = int(input())\r\nw = list(map(int, input().split()))\r\n\r\nd = [0]*(n+2)\r\nd[0] = d[n+1] = 1\r\nfor i in w:\r\n d[i] = 1\r\na, c = 0, 0\r\nwhile a < n+2:\r\n if d[a] == 0:\r\n b = a\r\n while d[b] == 0:\r\n b += 1\r\n c += f(a, b-1)\r\n d[a] = d[b-1] = (a, b-1)\r\n a = b\r\n a += 1\r\nq = -1\r\nfor i in w[::-1]:\r\n if c < k:\r\n q = m+1\r\n elif c >= k and q != -1:\r\n q = m+1\r\n break\r\n m -= 1\r\n if d[i+1] == d[i-1] == 1:\r\n d[i] = (i, i)\r\n c += 1 if t == 1 else 0\r\n elif d[i+1] == 1:\r\n a, b = d[i-1]\r\n d[a] = d[i] = (a, i)\r\n x = f(a, i-1)\r\n y = f(a, i)\r\n c += y-x\r\n elif d[i-1] == 1:\r\n a, b = d[i+1]\r\n d[i] = d[b] = (i, b)\r\n x = f(i+1, b)\r\n y = f(i, b)\r\n c += y-x\r\n else:\r\n a, b = d[i-1]\r\n a1, b1 = d[i+1]\r\n d[a] = d[b1] = (a, b1)\r\n x = f(a, b)\r\n z = f(a1, b1)\r\n y = f(a, b1)\r\n c += y-x-z\r\nelse:\r\n if c >= k and q != -1:\r\n q = 1\r\nprint(q)\r\n", "import bisect\r\n\r\ndef can_place_ships(mid, shots, total_cells, ship_size, ship_count):\r\n segments = [0] + [shots[i] for i in range(mid)] + [total_cells + 1]\r\n segments.sort()\r\n possible_ships = sum([(segments[i] - segments[i - 1]) // (ship_size + 1) for i in range(1, len(segments))])\r\n return possible_ships >= ship_count\r\n\r\ndef first_cheating_move(total_cells, ship_count, ship_size, num_shots, shots):\r\n left, right = 1, num_shots + 1\r\n while left < right:\r\n mid = (left + right) // 2\r\n if can_place_ships(mid, shots, total_cells, ship_size, ship_count):\r\n left = mid + 1\r\n else:\r\n right = mid\r\n if left > num_shots:\r\n return -1\r\n return left\r\nn, b, a = map(int, input().split())\r\nm = int(input())\r\nx = list(map(int, input().split()))\r\nprint(first_cheating_move(n, b, a, m, x))" ]

[ "from math import gcd\r\ns1 = input()\r\ns2 = input()\r\nn = len(s1)\r\nm = len(s2)\r\ncnt = 0\r\ng = gcd(n,m)\r\nfor i in range(g):\r\n #curr=s1[:i+1]\r\n if n % (i+1) == 0 and m % (i+1) == 0:\r\n if s1[:i+1]*(n//(i+1)) == s1 and s1[:i+1]*(m//(i+1))==s2:\r\n cnt += 1\r\nprint(cnt)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns1 = input().strip('\\n')\r\ns2 = input().strip('\\n')\r\n\r\nset1, set2 = set(), set()\r\n\r\nfor i in range(1, len(s1) + 1):\r\n if len(s1) % i == 0:\r\n if s1[:i] * (len(s1) // i) == s1:\r\n set1.add(s1[:i])\r\n \r\nfor i in range(1, len(s2) + 1):\r\n if len(s2) % i == 0:\r\n if s2[:i] * (len(s2) // i) == s2:\r\n set2.add(s2[:i])\r\n\r\nprint(len(set1.intersection(set2)))", "import math\r\nfrom collections import defaultdict\r\ndef gcd(x,y):\r\n if(y==0):\r\n return x\r\n else:\r\n return gcd(y,x%y)\r\nx=input()\r\ny=input()\r\nans=0\r\nn=len(x)\r\nm=len(y)\r\ng=gcd(n,m)\r\nfor i in range(1,g+1):\r\n if(g%i==0):\r\n # print(\"i is \",i,g)\r\n if(x[:i]==y[:i]):\r\n if(x[:i]*(n//i)==x):\r\n if(y[:i]*(m//i)==y):\r\n # print(\"hii\")\r\n ans+=1\r\nprint(ans)", "s=input()\r\ns1=input()\r\nn=len(s)\r\nm=len(s1)\r\nif(n>m):\r\n a=m\r\n b=n\r\n p=s1\r\n q=s\r\nelse:\r\n a=n\r\n b=m \r\n p=s \r\n q=s1\r\ns2=\"\"\r\nd=0\r\nfor x in range(0,a):\r\n s2=s2+p[x]\r\n if(a%2!=0 and (x+1)%2==0):\r\n continue\r\n if(a%(x+1)!=0):\r\n continue\r\n if(s2*(a//(x+1))==p and s2*(b//(x+1))==q):\r\n d+=1\r\nprint(d)\r\n ", "from re import A\r\nimport sys\r\nimport math\r\nimport bisect\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict as dd\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\n\r\n# faster input\r\nLINES = sys.stdin.read().splitlines()[::-1]\r\ndef input(): return LINES.pop()\r\n\r\n# single integer\r\ninp = lambda: int(input())\r\n\r\n# string input\r\nstrng = lambda: input().strip()\r\n\r\n# words split on white space\r\nstrwords = lambda: strng().split()\r\n\r\n\r\n# string list\r\nstrl = lambda: list(input().strip())\r\n\r\n# multiple integers, mapped\r\nmul = lambda: map(int,input().strip().split())\r\n\r\n# multiple floats, mapped\r\nmulf = lambda: map(float,input().strip().split())\r\n\r\n# list of multiple integers\r\nseq = lambda: list(map(int,input().strip().split()))\r\nfl_seq = lambda: list(map(float,input().strip().split()))\r\n\r\nceil = lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv = lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\nMOD = 1000000007\r\n\r\nmod_add = lambda x, y: ((x % MOD) + (y % MOD)) % MOD\r\nmod_multiply = lambda x, y: ((x % MOD) * (y % MOD)) % MOD\r\nmod_division = lambda x, y: mod_multiply(x, math.pow(y, MOD - 2, MOD))\r\n\r\ninbounds = lambda x, y, grid: x >= 0 and x < len(grid) and y >= 0 and y < len(grid[0])\r\n\r\ndef solve():\r\n # Implemaentation goes here.\r\n s1 = strng()\r\n s2 = strng()\r\n\r\n len1 = len(s1)\r\n len2 = len(s2)\r\n # minlen = int(math.sqrt(min(len(s1), len(s2))))\r\n minlen = min(len(s1), len(s2))\r\n\r\n s = ''\r\n res = 0\r\n \r\n notlen1 = notlen2 = False\r\n for i in range(minlen):\r\n s += s1[i]\r\n if not (len1 % (i+1) == 0 and len2 % (i+1) == 0):\r\n continue\r\n\r\n # print(s)\r\n notlen = False\r\n for j in range(0, len1, len(s)):\r\n if s != s1[j:j+len(s)]:\r\n # print(s1[j:j+len(s)])\r\n notlen = True\r\n break\r\n if notlen:\r\n continue\r\n\r\n notlen = False\r\n for j in range(0, len2, len(s)):\r\n if s != s2[j:j+len(s)]:\r\n # print(s2[j:j+len(s)])\r\n notlen = True\r\n break\r\n if notlen:\r\n continue\r\n\r\n res += 1\r\n\r\n print(res)\r\n\r\ncases = 1\r\nfor i in range(cases):\r\n solve()", "s1 = input()\r\ns2 = input()\r\nl1 = len(s1)\r\nl2 = len(s2)\r\ns = ''\r\nl = 0\r\nans = 0\r\nfor i in s1:\r\n s = s+i\r\n l = l+1\r\n if l1 % l == 0 and l2 % l == 0:\r\n if s*int(l1/l) == s1 and s*int(l2/l) == s2:\r\n ans += 1\r\nprint(ans)\r\n", "\r\nimport math\r\n\r\ns1=input()\r\ns2=input()\r\n\r\nn = len(s1)\r\nm = len(s2)\r\n\r\n#print(s1)\r\n#print(s2)\r\n#print(n)\r\n#print(m)\r\n\r\nx = min(n,m)\r\n\r\ns=\"\"\r\n\r\nf = 0\r\nans = 0\r\n\r\nfor i in range(0,x):\r\n s=s+s1[i]\r\n if(n%(i+1)!=0 or (m%(i+1)!=0)):\r\n continue\r\n if(s1[i]!=s2[i]):\r\n break\r\n \r\n \r\n c1 = n//(i+1)\r\n c2 = m//(i+1)\r\n s11 = s*c1\r\n s22 = s*c2\r\n \r\n #print(s11+\" \"+s22+\" \"+s)\r\n if(s11==s1 and s22==s2):\r\n ans+=1\r\n\r\nprint(ans)\r\n \r\n \r\n ", "a = input()\r\nb = input()\r\nla = len(a)\r\nlb = len(b)\r\nans = 0\r\nif la > lb:\r\n a, b = b, a\r\n la, lb = lb, la\r\nfor i in range (1, la + 1):\r\n if la % i == 0 and lb % i == 0:\r\n s = a[:i]\r\n if (s * (la // i)) == a and (s * (lb // i)) == b:\r\n ans += 1\r\nprint(ans)", "from math import sqrt\r\ndef isDevisor(string1, string2, l):\r\n\tdevisor = string2[:l]\r\n\r\n\tfor i in range(0,len(string1),l):\r\n\t\tif string1[i:i+l] != devisor:\r\n\t\t\treturn False\r\n\r\n\tfor i in range(0,len(string2),l):\r\n\t\tif string2[i:i+l] != devisor:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef find_devisors(string1, string2):\r\n\tstrlen1 = len(string1)\r\n\t\r\n\tstrlen2 = len(string2)\r\n\t\r\n\tsqrt_len = int(min(strlen1, strlen2))\r\n\r\n\tlen_devisors = set()\r\n\tdevisors = 0\r\n\t\r\n\tfor i in range(1,sqrt_len+1):\r\n\t\tif strlen1 % i == 0 and strlen2 % i == 0:\r\n\t\t\tlen_devisors.add(i)\r\n\r\n\tfor i in len_devisors:\r\n\t\tif isDevisor(string1, string2, i):\r\n\t\t\tdevisors += 1 \r\n\r\n\treturn devisors\r\n\r\nif __name__ == '__main__':\r\n\ts1 = input()\r\n\ts2 = input()\r\n\tprint(find_devisors(s1, s2))\r\n", "a=input()\nb=input()\nif len(b)<=len(a):\n a,b=b,a\nz=[]\nfor j in range(1,len(a)+1):\n if len(a)%j==0 and len(b)%j==0:\n z.append(j)\nc=''\nd=0\nfor i in z:\n c=a[0:i]\n if a.count(c)==len(a)/len(c) and b.count(c)==len(b)/len(c):\n d=d+1\nprint(d)\n", "a= input()\r\nb = input()\r\nal,bl = len(a), len(b)\r\nn = min(al, bl)\r\nans=0\r\nlt=[]\r\nfor i in range(1,n+1):\r\n if al%i==0 and bl%i==0:\r\n lt.append(i)\r\nfor c in lt:\r\n if a[:c]*(al//c) == a and b[:c]*(bl//c)==b and a[:c]==b[:c]:\r\n ans+=1 \r\nprint(ans)", "a,b=input(),input()\r\np,o,q,w,r,t=len(a),len(b),\"\",\"\",{0},{0}\r\nfor i in range(p):\r\n q+=a[i]\r\n if q*(p//(i+1))==a:r.add(q)\r\nfor i in range(o):\r\n w+=b[i]\r\n if w*(o//(i+1))==b:t.add(w)\r\nprint(len(t&r)-1)", "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 divs(s, n):\r\n an = []\r\n for x in range(1, n + 1):\r\n if(n % x == 0):\r\n pt = s[:(n // x)]\r\n if(pt * x == s):\r\n an += [pt]\r\n return set(an)\r\n\r\ndef main():\r\n s1 = get()\r\n n = len(s1)\r\n s2 = get()\r\n m = len(s2)\r\n a1 = divs(s1, n)\r\n a2 = divs(s2, m)\r\n put(len(a1 & a2))\r\nmain()\r\n", "s1=input()\r\ns2=input()\r\na=[]\r\nb=[]\r\ns=''\r\nfor i in range(len(s1)):\r\n s+=s1[i]\r\n x=len(s1)//(i+1)\r\n if s*x==s1:\r\n a.append(s)\r\ns=''\r\nfor i in range(len(s2)):\r\n s+=s2[i]\r\n x=len(s2)//(i+1)\r\n if s*x==s2:\r\n b.append(s)\r\ncnt=0\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n if a[i]==b[j]:\r\n cnt+=1\r\nprint(cnt)\r\n", "def check_repeatation(string):\r\n l1 = len(string)\r\n factors = []\r\n for i in range(1,l1+1):\r\n if l1 % i == 0:\r\n factors.append(i)\r\n repeated = [] \r\n for i in range(len(factors)):\r\n found = True\r\n s1 = string[:factors[i]]\r\n j = factors[i]\r\n while j < l1:\r\n s2 = string[j:j+factors[i]]\r\n j += factors[i]\r\n if s1 != s2:\r\n found = False\r\n break \r\n if found:\r\n repeated.append(s1)\r\n \r\n return repeated \r\n \r\n \r\n \r\n\r\n\r\ndef Common_Divisors():\r\n stirng1 = input()\r\n string2 = input()\r\n s1_repeated = check_repeatation(stirng1)\r\n s2_repeated = check_repeatation(string2)\r\n \r\n common_divisor = 0 \r\n for i in range(len(s1_repeated)):\r\n if s1_repeated[i] in s2_repeated:\r\n common_divisor += 1 \r\n return common_divisor \r\n \r\n \r\nremained_test_cases = 1 \r\n# remained_test_cases = int(input())\r\nwhile remained_test_cases > 0:\r\n print(Common_Divisors())\r\n remained_test_cases -= 1 ", "def getDivs(s):\r\n n = len(s)\r\n ret = {s}\r\n size = 1\r\n while size * size <= n:\r\n if n % size == 0:\r\n sub1 = s[:size]\r\n sub2 = s[:n // size]\r\n if sub1 * (n // size) == s:\r\n ret.add(sub1)\r\n if sub2 * size == s:\r\n ret.add(sub2)\r\n size += 1\r\n return ret\r\n\r\ns1 = input()\r\ns2 = input()\r\ndivs1 = getDivs(s1)\r\ndivs2 = getDivs(s2)\r\nprint(len(divs1.intersection(divs2)))\r\n", "from functools import reduce\r\ndef allFactors(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\ndef m(x,y,z):\r\n for i in x:\r\n ar=i\r\n te=y[:i]\r\n f=True\r\n for a in range(0,len(y),ar):\r\n ce=y[a:a+i]\r\n if te != ce:\r\n f=False\r\n if f:\r\n z.add(te)\r\ns1=(input())\r\ns2=(input())\r\nk1=allFactors(len(s1))\r\nk2=allFactors(len(s1))\r\nd1=set()\r\nd2=set()\r\nm(k1,s1,d1)\r\nm(k2,s2,d2)\r\nprint(len(d1.intersection(d2)))\r\n", "s1, s2= input(), input()\r\nm = min(len(s1), len(s2))\r\nif s1[:m] != s2[:m] :\r\n print(0)\r\nelse :\r\n if s1 < s2:\r\n s1, s2 = s2, s1\r\n sm = s1[:m]\r\n ans = 0\r\n for i in range(1, m+1):\r\n if m % i == 0:\r\n x = len(s1) // i\r\n if sm[:i]*x == s1:\r\n ans += 1\r\n print(ans)", "s1=input()\r\ns2=input()\r\nl1=len(s1)\r\nl2=len(s2)\r\nd={}\r\nc=0\r\nif l1<=l2:\r\n s=s1\r\n a=s2\r\n l=l1\r\n k=l2\r\nelse:\r\n s=s2\r\n a=s1\r\n l=l2\r\n k=l1\r\nd[s]=l\r\nfor i in range(1,l//2+1):\r\n if s[0]==s[i]:\r\n if s[:i]*(l//i)==s:\r\n d[s[:i]]=i\r\nfor i in d:\r\n if k%d[i]==0 and i*(k//d[i])==a:\r\n c+=1\r\nprint(c)", "s1 = input()\r\ns2 = input()\r\n\r\nd1 = len(s1)\r\nd2 = len(s2)\r\n\r\ncounter = 0\r\nfor i in range(1, min(d1, d2)+1):\r\n if ((d1%i == 0) and (d2%i == 0)):\r\n new_str = s1[:i]\r\n if (new_str*(d1//i) == s1 and new_str*(d2//i) == s2):\r\n counter+=1\r\n \r\nprint(counter)\r\n ", "s1=input().strip()\r\ns2=input().strip()\r\n\r\nn1=len(s1)\r\nn2=len(s2)\r\n\r\nres=0\r\n\r\nfor i in range(1,min(n1,n2)+1):\r\n\tif(n1%i==0 and n2%i==0):\r\n\t\tcheck=True\r\n\t\tfor j in range(i,n1):\r\n\t\t\tif s1[j%i]!=s1[j]:\r\n\t\t\t\tcheck=False\r\n\t\t\t\tbreak\r\n\t\tfor j in range(0,n2):\r\n\t\t\tif(s1[j%i]!=s2[j]):\r\n\t\t\t\tcheck=False\r\n\t\t\t\tbreak\r\n\t\tif check:\r\n\t\t\tres+=1\r\n\t\t\t\r\nprint(res)\r\n\t\t\t", "from math import *\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nd1 = set()\r\nd2 = set()\r\n\r\nfor i in range(1, len(s1)+1):\r\n if len(s1) % i == 0:\r\n for j in range(i, len(s1)+1, i):\r\n if s1[:i] != s1[j-i:j]:\r\n break\r\n else:\r\n d1.add(s1[:i])\r\n\r\n\r\nfor i in range(1, len(s2)+1):\r\n if len(s2) % i == 0:\r\n for j in range(i, len(s2)+1, i):\r\n if s2[:i] != s2[j-i:j]:\r\n break\r\n else:\r\n d2.add(s2[:i])\r\n\r\n# print(d1, d2)\r\nprint(len(d1 & d2))", "s1=input()\ns2=input()\nres=0\nl1=len(s1)\nl2=len(s2)\nfor i in range(1,min(l1,l2)+1):\n if l1%i==0 and l2%i==0:\n s=s1[:i]\n #print(s)\n if s*(l1//i)==s1 and s*(l2//i)==s2:\n res+=1\nprint(res)\n\t \t \t\t \t \t\t \t \t \t \t\t \t", "a, b = input(), input()\nif len(a) < len(b):\n b, a = a, b\n\n\nlengths = set()\nfor i in range(1, min(len(a), len(b)) + 1):\n if len(a) % i == 0 and len(b) % i == 0:\n lengths.add(i)\n lengths.add(len(a) // i)\n lengths.add(len(b) // i)\n\n\ndef check(a, b, n):\n if len(a) % n != 0 or len(b) % n != 0:\n return False\n block = a[:n]\n for i in range(len(a)):\n if a[i] != block[i % n]:\n return False\n for i in range(len(b)):\n if b[i] != block[i % n]:\n return False\n return True\n\n\nans = 0\nfor length in lengths:\n if min(len(a), len(b)) >= length:\n ans += check(a, b, length)\n\n# print(lengths)\nprint(ans)", "import math as m\r\n\r\n\r\ns, t = input(), input()\r\n\r\ng = m.gcd(len(s), len(t))\r\ndivs = {1, g}\r\nfor d in range(2, int(m.sqrt(g)) + 1):\r\n if g % d == 0:\r\n divs.add(d)\r\n divs.add(g // d)\r\n\r\nprint(sum([s[:d] * (len(s) // d) == s and s[:d] * (len(t) // d) == t for d in sorted(divs)]))\r\n", "s1=input()\r\ns2=input()\r\nans=0\r\nif len(s1)>len(s2):\r\n\ttemp=s1\r\n\ts1=s2\r\n\ts2=temp\r\n\r\nfor i in range(len(s1)):\r\n\tif len(s2)%(i+1)!=0 or len(s1)%(i+1)!=0:continue\r\n\tx=len(s1)//(i+1)\r\n\ty=len(s2)//(i+1)\r\n\tif(s1[:i+1]*x == s1 and s1[:i+1]*y == s2):ans+=1\r\n\r\nprint(ans)\r\n", "def L(a, b):\r\n a, b = int(a), int(b)\r\n a, b = max(a,b), min(a,b)\r\n if b == 0: return a\r\n return L(a%b, b)\r\n\r\na, b = input(), input()\r\nla, lb = len(a), len(b)\r\nc = L(la,lb)\r\nif (a!=(la//c)*a[:c] or b!=(lb//c)*b[:c] or a[:c]!=b[:c]):\r\n print(\"0\")\r\n exit()\r\nelse:\r\n s = a[:c]\r\n res = 0\r\n for i in range(1,len(s)//2+1):\r\n if (len(s)%i==0):\r\n if s[:i]*(len(s)//i) == s:\r\n res = len(s)//i\r\n break\r\n r = 1\r\n for i in range(1, res//2+1):\r\n if res%i==0: r+=1\r\n print(r)\r\n ", "\ndef divisors(s):\n n = len(s)\n d = 1\n res = set()\n while d * d <= n:\n if n % d == 0:\n ds = [d, n // d] if d * d < n else [d]\n for k in ds:\n ok = True\n for i in range(k, n):\n if s[i] != s[i % k]:\n ok = False\n break\n if ok:\n res.add(s[:k])\n d += 1\n return res\n\n\ndef main():\n a = input()\n b = input()\n print(len(divisors(a) & divisors(b)))\n\n\nmain()", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappop, heappush\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import gcd\r\n\r\ns = input().rstrip()\r\nt = input().rstrip()\r\n\r\nn = len(s)\r\nm = len(t)\r\nif m > n:\r\n n,m, = m,n\r\n s,t = t, s\r\ng = gcd(n,m)\r\n\r\ndef fact(n):\r\n l = set()\r\n for i in range(1,int(pow(n,0.5))+1):\r\n if n % i == 0:\r\n l.add(i)\r\n l.add(n//i)\r\n return l\r\n\r\nfn= fact(g)\r\nans = 0\r\nfor num in fn:\r\n ok = 1\r\n for i in range(n):\r\n if i < num: \r\n ok &= s[i] == t[i]\r\n elif i < m:\r\n ok &= (s[i] == t[i]) & (s[i] == s[i-num]) & (t[i] == t[i-num])\r\n else:\r\n ok &= (s[i] == s[i-num])\r\n if not ok:break\r\n else:\r\n ans += 1\r\n \r\nprint(ans)\r\n\r\n", "if __name__ == '__main__':\n import sys\n s1 = input()\n s2 = input()\n res = 0\n for i in range(1, min(len(s1), len(s2)) + 1):\n if len(s1) % i == 0 and len(s2) % i == 0:\n s = s1[:i]\n if s * (len(s1) // i) == s1 and s * (len(s2) // i) == s2:\n res += 1\n print(res)\n ", "def check(s, j):\r\n for i in range(j+1):\r\n if s[i] != s[j+i]:\r\n return False\r\n return True\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\nx = []\r\n\r\ni = 1\r\nn = len(s1)\r\nn2 = len(s2)\r\nres = 0\r\nwhile i <= n:\r\n if n % i == 0:\r\n if s1 == s1[:i]*(n//i) and s2 == s1[:i]*(n2//i):\r\n res += 1\r\n i += 1\r\nprint(res)\r\n", "str1=str(input())\r\nstr2=str(input())\r\n\r\nif len(str1)<len(str2):\r\n min=len(str1)\r\nelse:\r\n min=len(str2)\r\ncounter=0\r\nCommon_Divisors=0\r\nwhile counter!=min:\r\n val=str1[0:counter+1]\r\n length=len(val)\r\n if len(str1)%length==0 and len(str2)%length==0:\r\n times1=int(len(str1)/length)\r\n times2=int(len(str2)/length)\r\n A=0\r\n B=0\r\n check1=\"\"\r\n check2=\"\"\r\n while A!=times1:\r\n check1+=val\r\n A+=1\r\n while B!=times2:\r\n check2+=val\r\n B+=1\r\n if check1==str1 and check2==str2:\r\n Common_Divisors+=1\r\n counter+=1\r\n\r\nprint(Common_Divisors)", "import sys\r\n\r\na = input()\r\nb = input()\r\n\r\ndiva = set()\r\ndivb = set()\r\n\r\ndef find(d,word,div):\r\n if len(word)%len(d) == 0:\r\n if d*(len(word)//len(d)) == word:\r\n div.add(d)\r\n\r\nfor i in range(len(a)):\r\n find(a[0:i+1],a,diva)\r\n\r\nfor i in range(len(b)):\r\n find(b[0:i+1],b,divb)\r\n\r\nprint(len(diva.intersection(divb)))", "s1=input()\r\ns2=input()\r\n\r\nsub1=set()\r\np=\"\"\r\nfor i in s1:\r\n\tp+=i\r\n\tif p*(len(s1)//len(p))==s1:\r\n\t\tsub1.add(p)\r\np=\"\"\r\nsub2=set()\r\nfor i in s2:\r\n\tp+=i\r\n\tif p*(len(s2)//len(p))==s2:\r\n\t\tsub2.add(p)\r\nprint(len(sub1 & sub2))\r\n", "s1,s2=input(),input()\r\nL1,L2=len(s1),len(s2)\r\nans,z=0,min(L1,L2)\r\n\r\nfor i in range(1,z+1):\r\n if L1%i!=0 or L2%i!=0:continue\r\n p=s1[:i]\r\n if p*(L1//i)==s1 and p*(L2//i)==s2:ans+=1\r\n \r\nprint(ans)\r\n", "'''input\nabcdabcd\nabcdabcdabcdabcd\n'''\nfrom sys import stdin\nimport math\n\n\n\ndef get_divisor(n):\n\tdivisor = []\n\ti = 1\n\twhile i <= math.sqrt(n): \n \n\t\tif (n % i == 0) : \n \n # If divisors are equal, print only one \n\t\t\tif (n / i == i) : \n\t\t\t\tdivisor.append(i) \n\t\t\telse : \n # Otherwise print both \n\t\t\t\tdivisor.append(i)\n\t\t\t\tdivisor.append(n // i) \n\t\ti = i + 1\n\tdivisor.sort()\n\treturn divisor\n\ndef common_divisor(div1, div2):\n\tdiv = []\n\ti = 0; j = 0\n\twhile i < len(div1) and j < len(div2):\n\t\tif div1[i] == div2[j]:\n\t\t\tdiv.append(div1[i])\n\t\t\ti += 1\n\t\t\tj += 1\n\t\telif div1[i] < div2[j]:\n\t\t\ti += 1\n\t\telse:\n\t\t\tj += 1\n\treturn div\n\n\n# main starts\ns1 = stdin.readline().strip()\ns2 = stdin.readline().strip()\ndiv1 = get_divisor(len(s1))\ndiv2 = get_divisor(len(s2))\ndiv = common_divisor(div1, div2)\naux = []\nif len(s1) < len(s2):\n\tans = 0\n\tfor i in div:\n\t\tif s1[: i] * (len(s1) // i) == s1:\n\t\t\taux.append(i)\n\tfor i in aux:\n\t\tif s1[:i] * (len(s2) // i) == s2:\n\t\t\tans += 1\n\tprint(ans)\n\texit()\nelse:\n\tans = 0\n\tfor i in div:\n\t\tif s2[: i] * (len(s2) // i) == s2:\n\t\t\taux.append(i)\n\tfor i in aux:\n\t\tif s2[:i] * (len(s1) // i) == s1:\n\t\t\tans += 1\n\tprint(ans)\n\texit()", "import math\r\n\r\n\r\ndef divisors(n):\r\n divs = [1]\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n divs.extend([i, n // i])\r\n divs.append(n)\r\n return sorted(list(set(divs)))\r\n\r\n\r\n# 83160 128\r\n# 100000×128\r\n# n = int(1e5)\r\n# mx = 0\r\n# ans = 0\r\n# for i in range(n + 1):\r\n# if len(divisors(i)) > mx:\r\n# mx = len(divisors(i))\r\n# ans = i\r\n# print(ans, mx)\r\n# print(divisors(ans))\r\n\r\ns1 = input()\r\ns2 = input()\r\nz = divisors(len(s2))\r\nctr = 0\r\nli = []\r\nfor i in z:\r\n x = s2[0:i]\r\n # print(x, '----------')\r\n for j in range(0, len(s2), i):\r\n # print(s2[j: j + i])\r\n if x == s2[j: j + i]:\r\n pass\r\n else:\r\n break\r\n else:\r\n li.append(x)\r\n# print(li)\r\n\r\nli2 = []\r\nfor i in divisors(len(s1)):\r\n x = s1[0:i]\r\n # print(x, '----------')\r\n for j in range(0, len(s1), i):\r\n # print(s1[j: j + i])\r\n if x == s1[j: j + i]:\r\n pass\r\n else:\r\n break\r\n else:\r\n li2.append(x)\r\n# print(li2)\r\nfor i in li:\r\n if i in li2:\r\n ctr += 1\r\nprint(ctr)\r\n", "a, b = input(),input()\r\n\r\n# Recursive function to return gcd of a and b\r\ndef gcd(a, b):\r\n while b < 0:\r\n a,b = (b, a%b)\r\n \r\n return a\r\n \r\n \r\n \r\n \r\n#abcdabcd\r\n#abcdabcdabcdabcd\r\n'''\r\n8 1 2 4 \r\n16 1 2 4 \r\n'''\r\ncount = 0 \r\nN, M = len(a), len(b)\r\n\r\nfor i in range(1, gcd(N,M)+1):\r\n \r\n if N%i == 0 and M%i == 0 :\r\n # print(i, a[:i] * (N//i))\r\n if a[:i] * (N//i) == a and a[:i] * (M//i) == b:\r\n \r\n count += 1 \r\n\r\nprint(count)", "import math\r\nimport bisect\r\n\r\nP = 31\r\nMOD = 1000000000 + 9\r\n\r\ndef get_strings(s1, s2):\r\n if len(s1) <= len(s2):\r\n return s1, s2\r\n else:\r\n return s2, s1\r\n\r\ndef main():\r\n s1 = input()\r\n s2 = input()\r\n small_string, big_string = get_strings(s1, s2)\r\n hsh_small = [0 for _ in range(0, len(small_string))]\r\n hsh_big = [0 for _ in range(0, len(big_string))]\r\n\r\n small_set = set()\r\n big_set = set()\r\n \r\n sz = 1\r\n for i in range(0, len(small_string)):\r\n if len(small_string) % sz == 0 and small_string[0:sz]*(len(small_string)//sz) == small_string:\r\n small_set.add(small_string[0:sz])\r\n sz += 1\r\n \r\n sz = 1\r\n for i in range(0, len(big_string)):\r\n if len(big_string) % sz == 0 and big_string[0:sz]*(len(big_string)//sz) == big_string:\r\n big_set.add(big_string[0:sz])\r\n sz += 1\r\n\r\n answer = len(small_set.intersection(big_set))\r\n\r\n print(answer)\r\n\r\n\r\n\r\nmain()", "def no_of_div(s):\r\n n = len(s)\r\n divisors = [s]\r\n for i in range(2,n+1):\r\n d = n//i\r\n if d*i==n and s[0:d]*i==s:\r\n divisors.append(s[0:d])\r\n return divisors\r\ns1 = input()\r\ns2 = input()\r\nprint(len(set(no_of_div(s1)).intersection(no_of_div(s2))))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nw = input()[:-1]\r\n\r\nc = 0\r\nfor i in range(1, min(len(s), len(w))+1):\r\n if len(s) % i == 0 and len(w) % i == 0:\r\n if len(s)//i * s[:i] == s and len(w)//i * s[:i] == w:\r\n c += 1\r\n\r\nprint(c)", "str1 = str(input())\nstr2 = str(input())\nn = len(str1)\nm = len(str2)\ncnt=0\nfor i in range(1, n+1):\n if n%i==0 and m%i==0 and str1[:i]==str2[:i] and str1[:i]*(n//i)==str1 and str2[:i]*(m//i)==str2:\n cnt+=1\nprint(cnt)\n", "MOD = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\ns1=si()\r\ns2=si()\r\nls1=len(s1)\r\nls2=len(s2)\r\nif ls1>ls2:\r\n s1,s2=s2,s1\r\n ls1,ls2=ls2,ls1\r\nc=0\r\nfor i in range(1,ls1+1):\r\n if ls1%i==0 and ls2%i==0:\r\n if s1[:i]*(ls1//i)==s1 and s1[:i]*(ls2//i)==s2:\r\n c+=1\r\nprint(c)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 13/07/2023 00:08:51 Hanoi, Vietnam\r\n# **/\r\n\r\na = input()\r\nb = input()\r\nna = len(a)\r\nnb = len(b)\r\n\r\nans = 0\r\nfor i in range(1, min(na, nb) + 1):\r\n if na % i == 0 and nb % i == 0:\r\n if a[:i] == b[:i]:\r\n if a[:i] * (na//i) == a and b[:i] * (nb//i) == b:\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)", "def getDivisors(s, d):\r\n i = 1\r\n n = len(s)\r\n while(n / i >= 1):\r\n if n % i == 0:\r\n div = s[0:i]\r\n start = i\r\n while(start < n):\r\n if div != s[start: start + i]:\r\n break\r\n start += i\r\n if start == n:\r\n d.add(div)\r\n i += 1\r\n\r\ns1 = input()\r\ns2 = input()\r\ns1d = set()\r\ns2d = set()\r\ngetDivisors(s1, s1d)\r\ngetDivisors(s2, s2d)\r\nprint(len(s1d.intersection(s2d)))\r\n", "a = input()\r\nb = input()\r\nl1 = len(a)\r\nl2 = len(b)\r\n\r\nif l1 > l2:\r\n a,b = b,a\r\n l1, l2 = l2, l1\r\n\r\nans = 0\r\nfor i in range(1, l1+1):\r\n if l1%i == 0 and l2%i == 0:\r\n div = a[:i]\r\n _a = div*(l1//i)\r\n _b = div*(l2//i)\r\n if _a == a and _b == b:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "def fs(k):\r\n init = k\r\n if s1[:k]!=s2[:k]:\r\n return False\r\n while init<=l1-k:\r\n if s1[:k]!=s1[init:init+k]:\r\n return False\r\n init += k\r\n init = k\r\n while init<=l2-k:\r\n if s2[:k]!=s2[init:init+k]:\r\n return False\r\n init += k\r\n return True\r\ncnt = 0\r\ns1 = input()\r\ns2 = input()\r\nl1 = len(s1)\r\nl2 = len(s2)\r\nfor i in range(1,min(l1,l2)+1):\r\n if l1%i==0 and l2%i==0:\r\n if fs(i):\r\n cnt += 1\r\nprint(cnt)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nimport math\r\ns1=[i for i in input() if i !='\\n']\r\ns2=[i for i in input() if i!= '\\n']\r\nans=0\r\ns=[]\r\nfor i in range(min(len(s1),len(s2))):\r\n s.append(s1[i])\r\n if len(s1)%len(s)==0 and len(s2)%len(s2)==0:\r\n if s*(len(s1)//len(s))==s1:\r\n if s*(len(s2)//len(s))==s2:\r\n ans+=1\r\n \r\n\r\nprint(ans)\r\n\r\n \r\n", "import math as mt \r\nMAXN = 100001\r\nspf = [0 for i in range(MAXN)] \r\ndef sieve(): \r\n spf[1] = 1\r\n for i in range(2, MAXN): \r\n spf[i] = i \r\n for i in range(4, MAXN, 2): \r\n spf[i] = 2\r\n \r\n for i in range(3, mt.ceil(mt.sqrt(MAXN))): \r\n if (spf[i] == i): \r\n for j in range(i * i, MAXN, i): \r\n if (spf[j] == j): \r\n spf[j] = i\r\nsieve();st=set()\r\nfor i in spf:\r\n st.add(i)\r\nst.remove(0);st.remove(1);primes=sorted(list(st))\r\ndef factorize(n):\r\n factors = []\r\n for p in primes:\r\n if p*p > n: break\r\n i = 0\r\n while n % p == 0:\r\n n //= p\r\n i+=1\r\n if i > 0:\r\n factors.append((p, i));\r\n if n > 1: factors.append((n, 1))\r\n ##divisors\r\n div = [1]\r\n for (p, r) in factors:\r\n div = [d * p**e for d in div for e in range(r + 1)]\r\n return div\r\ns1=input();s2=input();l1=len(s1);l2=len(s2);\r\nfac1=[];fac2=[]\r\nfor i in factorize(l1):\r\n if s1[:i]*(l1//i)==s1:\r\n fac1.append(s1[:i])\r\nfrom collections import *\r\nc1=defaultdict(int)\r\nfor i in fac1:\r\n c1[i]=1;\r\nfor i in factorize(l2):\r\n if s2[:i]*(l2//i)==s2:\r\n fac2.append(s2[:i])\r\nfor i in fac2:\r\n c1[i]+=1\r\nprint(list(c1.values()).count(2))\r\n", "s1 = input()\r\ns2 = input()\r\nans = 0\r\nfor i in range(0,min(len(s1),len(s2))):\r\n\tt1 = s1[i]\r\n\tt2 = s2[i]\r\n\tif t1!=t2:\r\n\t\tbreak\r\n\tif len(s1)%(i+1)==0 and len(s2)%(i+1)==0:\r\n\t\tg1 = s1[:i+1]*(len(s1)//(i+1))\r\n\t\tg2 = s2[:i+1]*(len(s2)//(i+1))\r\n\t\tif g1==s1 and g2==s2:\r\n\t\t\tans+=1\r\n\r\nprint(ans)", "a=input().strip()\r\nb=input().strip()\r\ndivisor=0\r\ntemp=''\r\nlena=len(a)\r\nlenb=len(b)\r\nfor i in range(lena):\r\n temp+=a[i]\r\n if(temp==b[:i+1]):\r\n if((lenb//(i+1))*temp==b and (lena//(i+1))*temp==a):\r\n divisor+=1\r\nprint(divisor)\r\n", "s1,s2=input(),input()\r\nlen1,len2=len(s1),len(s2)\r\nt,res='',0\r\nfor i,x in enumerate(s1):\r\n t+=x\r\n if len1%(i+1)==0 and len2%(i+1)==0:\r\n x1,x2=len1//(i+1),len2//(i+1)\r\n if t*x1==s1 and t*x2==s2:res+=1\r\nprint(res)", "s1=input()\r\ns2=input()\r\nn=len(s1)\r\nm=len(s2)\r\nif n>m:\r\n s1,s2=s2,s1\r\n n,m=m,n\r\n\r\nl=[]\r\nll=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n d=s1[:i]\r\n if d*(n//i)==s1:\r\n l.append(d)\r\nfor i in range(len(l)):\r\n f=len(l[i])\r\n if m%f==0:\r\n if l[i]*(m//f)==s2:\r\n ll.append(l[i])\r\nprint(len(ll))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "s=input()\nt=input()\nd=set()\nc=0\nfor x in range(1,len(s)+1):\n if len(s)%x==0:\n if s==s[:x]*(len(s)//x):\n d.add(s[:x])\nfor x in range(1,len(t)+1):\n if len(t)%x==0:\n if t==t[:x]*(len(t)//x):\n if t[:x] in d:\n c+=1\nprint(c)", "sa=input()\r\nsb=input()\r\na=len(sa)\r\nb=len(sb)\r\nif a>b:\r\n sa,sb=sb,sa\r\n a,b=b,a\r\nl=0\r\nss=\"\"\r\ns=set()\r\n\r\nfor i in sa:\r\n ss+=str(i)\r\n l+=1\r\n if b%l==0 and sb==ss*(b//l):\r\n if a%l==0 and sa==ss*(a//l):\r\n s.add(ss)\r\n \r\n\r\nprint(len(s))", "def gcd(a, b):\r\n c = a % b\r\n return gcd(b, c) if c else b\r\na, b = input(), input()\r\nu, v = len(a), len(b)\r\nif u > v: a, b, u, v = b, a, v, u\r\nif a == a[0] * u: d = 1\r\nelse: \r\n for i in range(1, int(u ** 0.5) + 1):\r\n if u % i == 0:\r\n k = u // i\r\n if a == a[: i] * k: \r\n d = i\r\n break\r\n if a == a[: k] * i: d = k\r\nif b == a[: d] * (v // d):\r\n k = gcd(u // d, v // d)\r\n if k == 1: print(1)\r\n else:\r\n s, l = 2, int(k ** 0.5)\r\n for i in range(2, l + 1):\r\n if k % i == 0: s += 2\r\n if k == l * l: s -= 1\r\n print(s)\r\nelse: print(0)", "s1 = input()\r\ns2 = input()\r\n\r\n\r\nif len(s1) < len(s2):\r\n s3 = s1\r\n s1 = s2\r\n s2 = s3\r\n\r\nn1 = len(s1) # smaller string\r\nn2 = len(s2)\r\n\r\ndivs = list()\r\n\r\nfor i in range(1, n1+1):\r\n if n1 % i != 0:\r\n continue\r\n\r\n grps = n1//i\r\n substring = s1[:i]\r\n if substring*grps == s1:\r\n if n2 % i == 0:\r\n grps2 = n2//i\r\n if substring * grps2 == s2:\r\n divs.append(substring)\r\n\r\nprint(len(divs))\r\n", "import sys\n\nstring1 = sys.stdin.readline().strip()\nstring2 = sys.stdin.readline().strip()\n\nlen1 = len(string1)\nlen2 = len(string2)\n\ndef check(string, sub):\n sublen = len(sub)\n for i in range(len(string)):\n if string[i] != sub[i % sublen]:\n return False\n return True\n\ncount = 0\nfor i in range(1, min(len1, len2) + 1):\n if len1 % i == 0 and len2 % i == 0:\n sub = string1[0:i]\n if check(string1, sub) and check(string2, sub):\n count += 1\n\nprint(count)\n", "\"\"\"\r\nx = abcabc = 2\r\ny = abcabcabcabc = 4\r\nx = 01334667998A\r\ngcd(|x|, |y|) = 3 ---> div | 3 ---> div E {1, 3} ---> x[:div] == y[:div] ---> \r\n\r\nn < m \r\n2^5 * 5^5\r\n36 \r\n\r\n\r\n\r\nlen(s) = len(t) = 10^5-3\r\nlen(s) = len(t) = 10^5-10\r\n\"\"\"\r\nfrom math import gcd as gcd_func\r\n\r\ns = input()\r\nt = input()\r\nlen_s, len_t = len(s), len(t)\r\ngcd = gcd_func(len_s, len_t)\r\nfacs = [i for i in range(1, gcd+1) if gcd%i == 0]\r\nr = 0\r\nfor div in facs:\r\n if s[:div] != t[:div]: \r\n continue\r\n if s.count(s[:div]) == len(s)//div and t.count(t[:div]) == len(t)//div: \r\n r += 1\r\n\r\nprint(r)", "s1=input()\r\ns2=input()\r\nl1=len(s1)\r\nl2=len(s2)\r\ns=''\r\nl=0\r\nans=0\r\nfor i in s1:\r\n s=s+i\r\n l=l+1\r\n if l1%l==0 and l2%l==0:\r\n if s*int(l1/l)==s1:\r\n if s*int(l2/l)==s2:\r\n ans+=1\r\nprint(ans)", "s1 = input()\r\ns2 = input()\r\nn1 = len(s1)\r\nn2 = len(s2)\r\nanswer = 0\r\nfor i in range(1, min(n1,n2) + 1):\r\n if n1%i > 0 or n2%i > 0:\r\n continue\r\n div=s1[:i]\r\n if div*(n1//i)==s1 and div*(n2//i)==s2:\r\n answer += 1\r\nprint(answer)# 1690471117.830586", "\r\ndef divisors(n):\r\n\tans = []\r\n\tfor i in range(1, n + 1):\r\n\t\tif n % i == 0:\r\n\t\t\tans.append(i)\r\n\treturn ans\r\n\r\n\r\ndef check_div(s, n):\r\n\tdiv = a[:n]\r\n\tfor i in range(len(s) // n):\r\n\t\tif s[n * i:n * (i + 1)] != div:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\n\r\na, b = input(), input()\r\ndivs = divisors(len(a))\r\nans = 0\r\nfor div in divs:\r\n\tif len(b) % div != 0:\r\n\t\tcontinue\r\n\tif not check_div(a, div):\r\n\t\tcontinue\r\n\tif not check_div(b, div):\r\n\t\tcontinue\r\n\tif a[:div] != b[:div]:\r\n\t\tcontinue\r\n\tans += 1\r\nprint(ans)\r\n", "s = input()\r\nt = input()\r\nls = len(s)\r\nlt = len(t)\r\nbase = min(ls, lt)\r\nbase_s = s\r\nif base != ls:\r\n base_s = t\r\nans = 0\r\nfor i in range(1, base + 1):\r\n if ls % i == 0 and lt % i == 0:\r\n p = base_s[:i]\r\n if p * (ls // i) == s and p * (lt // i) == t:\r\n ans = ans + 1\r\nprint(ans)", "import math\r\ns = input()\r\nt = input()\r\nx = math.gcd(len(s),len(t))\r\nans = 0\r\ni = 1\r\nwhile i <= math.sqrt(x):\r\n if (x%i == 0):\r\n if i*i == x:\r\n if s[:i] == t[:i] and s[:i]*(len(s)//i) == s and t[:i]*(len(t)//i) == t:\r\n ans+= 1\r\n else:\r\n if s[:i] == t[:i] and s[:i]*(len(s)//i) == s and t[:i]*(len(t)//i) == t:\r\n ans+= 1\r\n j = x//i\r\n if s[:j] == t[:j] and s[:j]*(len(s)//j) == s and t[:j]*(len(t)//j) == t:\r\n ans+= 1\r\n i += 1\r\nprint(ans)", "s1=input()\r\ns2=input()\r\n\r\n\r\n\r\ndef divisors(s):\r\n\tn=len(s)\r\n\tdiv=set()\r\n\tfor i in range(1,n+1):\r\n\t\tif n % i == 0 and all(s[:i] == s[j:j + i] for j in range(i, n, i)):\r\n\t\t\tdiv.add(s[:i])\r\n\treturn div\r\n\r\na=divisors(s1)\r\nb=divisors(s2)\r\n\r\nprint(len(a & b))\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n", "def common_divisors(a, b):\r\n c1=0\r\n l1=len(a)\r\n l2=len(b)\r\n for i in range(1, min(l1, l2) + 1):\r\n if (l1 % i == 0 and l2 % i == 0):\r\n rep1 = (l1 // i) * a[0 : i]\r\n rep2 = (l2 // i) * a[0 : i]\r\n if rep1 == a and rep2 == b:\r\n c1 += 1\r\n return(c1) \r\n\r\na=str(input())\r\nb=str(input())\r\n\r\nprint(common_divisors(a, b))\r\n ", "s=input()\r\nt=input()\r\nm=len(s)\r\nn=len(t)\r\nans=0\r\nfor i in range(1,min(m,n)+1):\r\n if m%i>0 or n%i>0:\r\n continue\r\n p=s[:i]\r\n if p*(m//i)==s and p*(n//i)==t:\r\n ans+=1\r\nprint(ans)", "t = 0\r\n\r\nfrom fractions import gcd\r\n\r\nx = input()\r\ny = input()\r\n\r\nlx = len(x)\r\nly = len(y)\r\n\r\ng = gcd(lx, ly)\r\n\r\nfor i in range(1, g+1):\r\n if g % i == 0:\r\n rep = x[:i]\r\n if x == (lx//i) * rep and y == (ly//i) * rep:\r\n t += 1\r\n\r\nprint(t)\r\n", "\r\ns=input()\r\nt=input()\r\nans=0\r\nfor i in range(1, len(s)+1):\r\n i = max(i,1)\r\n if len(s)%i==len(t)%i==0:\r\n ans+= (t[:i]==s[:i] and s==(len(s)//i)*s[:i] and t==(len(t)//i)*t[:i])\r\nprint(ans)", "from math import gcd\r\ndef divider(s1,s2):\r\n tmp=\"\"\r\n while(len(tmp)<=len(s2)):\r\n if (tmp==s2):\r\n return 1\r\n tmp+=s1\r\n return 0\r\n\r\n\r\ns1=str(input())\r\ns2=str(input())\r\n\r\n\r\nif (s1+s2!=s2+s1):\r\n print(0)\r\nelse:\r\n gcd_str=s1[0:gcd(len(s1),len(s2))]\r\n unit=\"\"\r\n length=0\r\n for i in range(len(gcd_str)):\r\n unit+=gcd_str[i]\r\n length+=1\r\n if (len(gcd_str)%length==0):\r\n if (divider(unit,gcd_str)):\r\n break\r\n tmp=unit\r\n slength=length\r\n ans=0\r\n for i in range(min(int(len(s1)/length),int(len(s2)/length))+1):\r\n if (min(len(s1),len(s2))%slength==0):\r\n if(divider(tmp,s1) and divider(tmp,s2)):\r\n ans+=1\r\n tmp+=unit\r\n slength+=length\r\n print(ans)\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "a=input()\r\nb=input()\r\nlist1=[]\r\nfor x in range(1, len(a)+1):\r\n\tif len(a)%x==0 and a[:x]*(len(a)//x)==a:\r\n\t\tlist1.append(a[:x])\r\nans=0\r\nfor x in range(1, len(b)+1):\r\n\tif len(b)%x==0 and b[:x]*(len(b)//x)==b and b[:x] in list1:\r\n\t\tans+=1\r\nprint(ans)\r\n", "# cook your dish here\nfrom copy import deepcopy\ns1=input()\ns2=input()\nif len(s1)>len(s2):\n s1,s2=deepcopy(s2),deepcopy(s1)\n\ndef func(s1,s2):\n if (len(s1)%len(s2)!=0):\n return False\n bla=len(s1)//len(s2)\n s2=s2*bla \n if s2==s1:\n return True\n return False\n\n\nans=0\nfor i in range(len(s1)):\n if func(s1,s1[:i+1]) and func(s2,s1[:i+1]):\n ans+=1 \nprint(ans)", "import sys\r\nimport math \r\n \r\ndef read_line():\r\n\treturn sys.stdin.readline()[:-1]\r\n \r\ndef read_int():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef read_int_line():\r\n\treturn [int(v) for v in sys.stdin.readline().split()]\r\n\r\ns1 = read_line()\r\ns2 = read_line()\r\n\r\nn1 = len(s1)\r\nn2 = len(s2)\r\n\r\ndiv1 = []\r\ndiv2 = []\r\n\r\nfor i in range(1,n1+1):\r\n\tif n1%i==0:\r\n\t\tt = n1//i\r\n\t\tif t*s1[:i] == s1:\r\n\t\t\tdiv1.append(s1[:i])\r\n\r\nfor i in range(1,n2+1):\r\n\tif n2%i==0:\r\n\t\tt = n2//i\r\n\t\tif t*s2[:i] == s2:\r\n\t\t\tdiv2.append(s2[:i])\r\n\r\nprint(len(list(set(div1)&set(div2))))", "def find_divisors(s):\r\n divisors = []\r\n n = len(s)\r\n for i in range(1, n + 1):\r\n if n % i == 0:\r\n divisor = s[:i] * (n // i)\r\n if divisor == s:\r\n divisors.append(s[:i])\r\n return divisors\r\n\r\ndef common_divisors(s1, s2):\r\n divisors_s1 = find_divisors(s1)\r\n divisors_s2 = find_divisors(s2)\r\n common = 0\r\n for divisor in divisors_s1:\r\n if divisor in divisors_s2:\r\n common += 1\r\n return common\r\n\r\n# Reading input and printing output\r\ns1 = input().strip()\r\ns2 = input().strip()\r\nprint(common_divisors(s1, s2))\r\n", "def is_div(s1, s2):\r\n s = s2\r\n while len(s)<len(s1):\r\n s += (s2)\r\n if s==s1:\r\n return True\r\n else:\r\n return False\r\n\r\na = input()\r\nb = input()\r\nfor i in range(1,len(a)+1):\r\n if len(a)%i != 0:\r\n continue\r\n if is_div(a,a[:i]):\r\n root_a = a[:i]\r\n break\r\n\r\nfor i in range(1,len(b)+1):\r\n if len(b)%i != 0:\r\n continue\r\n if is_div(b,b[:i]):\r\n root_b = b[:i]\r\n break\r\n\r\nif root_a != root_b:\r\n print(0)\r\nelse:\r\n p = len(root_a)\r\n q = len(root_b)\r\n la = len(a)\r\n lb = len(b)\r\n\r\n sieve = [0 for i in range(max(la,lb)+1)]\r\n res = 0\r\n for i in range(p, la+1, p):\r\n sieve[i] += 1\r\n for i in range(q, lb+1, q):\r\n sieve[i] += 1\r\n for i in range(1, min(la,lb)+1):\r\n if sieve[i]>=2 and la%i==0 and lb%i==0:\r\n res += 1\r\n print(res)", "a = input()\nb = input()\ndef check(s,m):\n hain =1\n for i in range(len(s)):\n if(s[i]!=a[i%m]):\n hain =0\n return hain\n return hain\nans=0\nif(len(a)==1 and len(b)==1 and a!=b):\n print(0)\nelse:\n for i in range(1,len(a)+len(b)):\n if(len(a)%i==0 and len(b)%i==0):\n k=check(a,i) and check(b,i)\n ans+=k\n print(ans)\n", "s1=input()\r\ns2=input()\r\nss1=set()\r\nss2=set()\r\nl1=len(s1)\r\nl2=len(s2)\r\nfor i in range(l1):\r\n if l1%(i+1)==0:\r\n x=l1//(i+1)\r\n str=s1[:i+1]\r\n str=str*x\r\n if str==s1:\r\n ss1.add(s1[:i+1])\r\nfor i in range(l2):\r\n if l2%(i+1)==0:\r\n x=l2//(i+1)\r\n str=s2[:i+1]\r\n str=str*x\r\n if str==s2:\r\n ss2.add(s2[:i+1])\r\nss=ss1.intersection(ss2)\r\nprint(len(ss))", "from sys import stdin, setrecursionlimit\r\n \r\n \r\ndef solve():\r\n s1 = input()\r\n s2 = input()\r\n c = 0\r\n for i in range(1, min(len(s1), len(s2)) + 1):\r\n if len(s1) % i == 0 and len(s2) % i == 0:\r\n if len(s1) // i * s1[:i] == s1 and len(s2) // i * s1[:i] == s2:\r\n c += 1\r\n print(c)\r\n \r\n \r\nif __name__ == '__main__':\r\n solve()", "s1=input()\ns2=input()\nn=len(s1)\nm=len(s2)\nans=0\nif n<=m:\n\tfor i in range(n):\n\t\tif n%(i+1)==0 and s1[:i+1]*(n//(i+1))==s1:\n\t\t\tif m%(i+1)==0 and s1[:i+1]*(m//(i+1))==s2:\n\t\t\t\tans+=1\nelse:\n\tfor i in range(m):\n\t\tif m%(i+1)==0 and s2[:i+1]*(m//(i+1))==s2:\n\t\t\tif n%(i+1)==0 and s2[:i+1]*(n//(i+1))==s1:\n\t\t\t\tans+=1\nprint(ans)", "import math\r\ncount = 0\r\n\r\ns1 = input()\r\ns2 = input()\r\nn1 = len(s1)\r\nn2 = len(s2)\r\n\r\ng = math.gcd(n1 , n2)\r\n\r\nfor i in range(1 , g+1):\r\n if g % i == 0 :\r\n res = s1[:i]\r\n #print((n1 // i ) * res)\r\n #print((n2//i) * res)\r\n\r\n if s1 == (n1 // i ) * res and s2 == (n2 // i ) * res :\r\n count +=1\r\n\r\nprint(count)", "def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\n\ndef find_common_divisors(s1, s2):\n n1, n2 = len(s1), len(s2)\n gcd_length = gcd(n1, n2)\n\n common_divisors = 0\n for length in range(1, gcd_length + 1):\n if gcd_length % length == 0:\n divisor = s1[:length]\n if divisor * (n1 // length) == s1 and divisor * (n2 // length) == s2:\n common_divisors += 1\n\n return common_divisors\n\n\nif __name__ == \"__main__\":\n s1 = input().strip()\n s2 = input().strip()\n\n result = find_common_divisors(s1, s2)\n print(result)" ]

[ "f = lambda: map(int, input().split())\r\nn, m, dx, dy = f()\r\np = [0] * n\r\nfor i in range(n): p[dx * i % n] = i\r\ns = [0] * n\r\nfor j in range(m):\r\n x, y = f()\r\n s[(y - dy * p[x]) % n] += 1\r\nprint(0, s.index(max(s)))" ]

[ "import sys\ninput = sys.stdin.readline\n\ndef inint():\n return(int(input()))\n\ndef inlst():\n return(list(map(int,input().split())))\n\n# returns a List of Characters, which is easier to use in Python as Strings are Immutable\ndef instr():\n s = input()\n return(list(s[:len(s) - 1]))\n\ndef invar():\n return(map(int,input().split()))\n\n############ ---- Input function template ---- ############\n\ndef isOdd(num):\n return (num & 1) == 1\n\nn, m = invar()\n\n# build function\ntree = [{'round_num':m, 'winner':-1} for _ in range(2*n+1, 0, -1)]\n\ndef modify(left, right, pair):\n left += n\n right += n\n while left <= right:\n if isOdd(left):\n tree[left] = pair\n\n if not isOdd(right):\n tree[right] = pair\n\n left = int((left+1)/2)\n right = int((right-1)/2)\n\n\ndef query(pos):\n pos += n\n min = 1000000\n winner = -1\n while pos > 0:\n if tree[pos]['round_num'] < min:\n winner = tree[pos]['winner']\n min = tree[pos]['round_num']\n\n pos >>= 1\n\n return winner + 1 if winner > -1 else 0\n\nrounds = []\nfor _ in range(m):\n li, ri, xi = invar()\n rounds.append({'left':li-1, 'right':ri-1, 'winner':xi-1})\n\nfor idx in range(m-1, -1, -1):\n round = rounds[idx]\n if round['winner'] > 0: modify(round['left'], round['winner']-1, {'round_num': idx, 'winner':round['winner']})\n if round['winner'] < n: modify(round['winner']+1, round['right'], {'round_num': idx, 'winner':round['winner']})\n\nprint(*[query(i) for i in range(n)])\n", "def KnightTournament():\n n, m = (int(k) for k in input().split())\n \n oncomingList = [i+1 for i in range(n+1)]\n \n answer = [0]*n\n \n for line in range(m):\n left, right, x = (int(k) for k in input().split())\n points = left\n while points <= right:\n if answer[points-1] == 0 and points != x:\n answer[points-1] = x\n nxt = oncomingList[points]\n if points < x:\n oncomingList[points] = x\n else:\n oncomingList[points] = right + 1\n points = nxt\n \n return answer\n \nprint(*KnightTournament())\n \t\t \t\t \t\t \t \t \t\t \t\t \t\t\t\t\t\t \t", "import sys\r\n\r\nclass SegmTree():\r\n def __init__(self, array=None, size=None):\r\n if array is not None:\r\n size = len(array)\r\n N = 1\r\n while N < size:\r\n N <<= 1\r\n self.N = N\r\n self.tree = [0] * (2*self.N)\r\n if array is not None:\r\n for i in range(size):\r\n self.tree[i+self.N] = array[i]\r\n self.build()\r\n\r\n def build(self):\r\n for i in range(self.N - 1, 0, -1):\r\n self.tree[i] = self.tree[i<<1] + self.tree[i<<1|1]\r\n\r\n def add(self, i, value=1):\r\n i += self.N\r\n while i > 0:\r\n self.tree[i] += value\r\n i >>= 1 \r\n \r\n def find_nonzeros(self, l, r):\r\n N = self.N\r\n l += N\r\n r += N\r\n cand = []\r\n while l < r:\r\n if l & 1:\r\n if self.tree[l]:\r\n cand.append(l)\r\n l += 1\r\n if r & 1:\r\n r -= 1\r\n if self.tree[r]:\r\n cand.append(r)\r\n l >>= 1\r\n r >>= 1\r\n ans = []\r\n while cand:\r\n i = cand.pop()\r\n if i < N:\r\n i <<= 1\r\n if self.tree[i]:\r\n cand.append(i)\r\n if self.tree[i|1]:\r\n cand.append(i|1)\r\n else:\r\n ans.append(i - N)\r\n return ans\r\n\r\n# inf = open('input.txt', 'r')\r\n# reader = (line.rstrip() for line in inf)\r\nreader = (line.rstrip() for line in sys.stdin)\r\ninput = reader.__next__\r\n\r\nn, m = map(int, input().split())\r\nst = SegmTree([1]*n)\r\nans = [0] * n\r\nfor _ in range(m):\r\n l, r, x = map(int, input().split())\r\n l -= 1\r\n x -= 1\r\n for i in st.find_nonzeros(l, r):\r\n if i != x:\r\n ans[i] = x + 1\r\n st.add(i, -1)\r\nprint(*ans)\r\n \r\n# inf.close()\r\n", "import sys\n#sys.setrecursionlimit(20000)\n#from collections import deque #Counter\nfrom collections import deque\n#from itertools import accumulate, product\n#from functools import reduce\nfrom math import sqrt\n\n\ndef rall():\n return [x.strip() for x in sys.stdin.readlines()]\ndef rl():\n return sys.stdin.readline().strip()\ndef rl_types(types):\n str_list = [x for x in sys.stdin.readline().strip().split(' ')]\n return [types[i](str_list[i]) for i in range(len(str_list))]\n\ndef pr( something='' ):\n sys.stdout.write( str(something) + '\\n')\ndef pra( array ):\n sys.stdout.write( ' '.join([str(x) for x in array]) + '\\n')\n\n\n\n\n\n\n\n\nclass SqrtDecomp:\n\n def __init__(self, array):\n self.data = array\n n = len(array)\n self.len = n\n bs = int(sqrt(n)+.999999999) # round up ;)\n nb = n//bs\n if bs*nb < n:\n nb += 1\n self.bs = bs\n self.nb = nb\n self.blocks = [None]*nb\n for bi in range(nb):\n l = bi*bs\n r = min(l+bs-1,n-1)\n self.blocks[bi] = [r-l+1,{array[i] for i in range(l,r+1)}]\n\n def _block(self,i):\n return (i-1)//self.bs# if i%self.bs==0 else i//self.bs\n\n # indices are 1-based\n def removeRemainingRange(self,l,r):\n elems = []\n lblock,rblock = self._block(l),self._block(r)\n #print(lblock,rblock)\n\n def rem_range(rng,bi):\n #print(f'rem_range: {rng} {bi}')\n ln,rem = self.blocks[bi]\n for i in rng:\n #print(i)\n val = self.data[i-1]\n if val in rem:\n rem.remove(val)\n #elems.append((i,val))\n elems.append(i)\n ln -= 1\n self.blocks[bi][0] = ln\n\n\n if lblock==rblock: # only affects this block!!!\n rng = range(l, r+1)\n rem_range(rng,lblock)\n else:\n\n lrange = range(l, (lblock+1)*self.bs+1)\n rrange = range((rblock)*self.bs+1,r+1)\n for rng,bi in [(lrange,lblock),(rrange,rblock)]:\n rem_range(rng,bi)\n\n # now handle all the full blocks in between\n for bi in range(lblock+1,rblock):\n if self.blocks[bi][0]==0:\n continue\n else:\n rem = self.blocks[bi][1]\n #rem_range([x for x in rem],bi)\n rem_range([x for x in rem],bi)\n self.blocks[bi][0] = 0\n\n return elems\n\n\n\n\nif __name__ == '__main__':\n\n N,M = map(int,rl().split(' '))\n\n st = SqrtDecomp(range(1,N+1))\n #print(st._tree)\n\n winners = [0]*N\n for _ in range(M):\n l,r,winner = map(int, rl().split(' '))\n #pra([l,r,winner,st.rangeQuery(l-1,r-1)])\n rem = []\n if winner>l:\n rem.extend( st.removeRemainingRange(l-1,winner-2) )\n #rem.extend( [x for x in st.rangeQuery(l-1,winner-2)] )\n if winner<r:\n rem.extend( st.removeRemainingRange(winner,r-1) )\n #rem.extend( [x for x in st.rangeQuery(winner,r-1)] )# winner-1+1\n #print(rem,st._tree)\n for v in rem:\n #st.remove(v-1)\n #print(st._tree)\n #winners[v-1] = winner\n winners[v] = winner\n pra(winners)\n", "n, m = (int(x) for x in input().split())\r\nresults = [0]*n # n = 3 -> [0, 0, 0] [kn-1]\r\npointers = [k for k in range(2, n+2)] # n = 3 -> [2, 3, 4] [kn-1]\r\nfor i in range(m):\r\n l, r, x = [int(k) for k in input().split()]\r\n\r\n while l <= r:\r\n if l != x and results[l-1] == 0: results[l-1] = x\r\n nxt = pointers[l-1]\r\n if l < x: pointers[l-1] = x\r\n else: pointers[l-1] = r+1\r\n l = nxt\r\n\r\n \r\nprint(*results)", "n, m = (int(x) for x in input().split(\" \"))\nfights = []\nfor i in range(m):\n fights.append([int(x)-1 for x in input().split(\" \")])\n\nknights = [{\"alive\": True, \"killed by\": -1, \"jump\": i+1} for i in range(n)]\n\nfor t in range(m):\n lt = fights[t][0]\n rt = fights[t][1]\n xt = fights[t][2]\n\n j = lt\n while j < xt:\n if knights[j][\"alive\"]:\n knights[j][\"alive\"] = False\n knights[j][\"killed by\"] = xt\n\n next_j = knights[j][\"jump\"]\n knights[j][\"jump\"] = xt\n j = next_j\n\n j = xt + 1\n while j <= rt:\n if knights[j][\"alive\"]:\n knights[j][\"alive\"] = False\n knights[j][\"killed by\"] = xt\n\n next_j = knights[j][\"jump\"]\n knights[j][\"jump\"] = knights[rt][\"jump\"]\n j = next_j\n\nprint(\" \".join([str(k[\"killed by\"]+1) for k in knights]))\n\n\n", "n, m = map(int, input().split())\r\n\r\nresult = [None] * (n + 1)\r\nnxt = [i + 1 for i in range(n + 2)]\r\n# print(result)\r\nstore = []\r\nfor _ in range(m):\r\n l, r, x = map(int, input().split())\r\n store.append([l, r, x])\r\n\r\nfor l, r, x in store:\r\n cur = l\r\n while cur < r + 1:\r\n tmp = nxt[cur]\r\n if not result[cur] and cur != x:\r\n result[cur] = x\r\n if cur < x:\r\n nxt[cur] = x\r\n else:\r\n nxt[cur] = r + 1\r\n cur = tmp\r\n # print(result)\r\nresult[x] = 0\r\nprint(*result[1:])", "from itertools import product\r\nimport os\r\nimport sys\r\nfrom bisect import bisect\r\nfrom io import BytesIO, IOBase\r\nimport math\r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=max):\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\ndef main():\r\n n,m=map(int,input().split())\r\n sol=[0]*n\r\n seg=[]\r\n i=0\r\n while i<n:\r\n seg.append(i)\r\n i+=1\r\n seg=SegmentTree(seg,-2)\r\n i=0\r\n while i<m:\r\n l,r,x=map(int,input().split())\r\n while seg.query(l-1,r)!=-1:\r\n sol[seg.query(l-1,r)]=x\r\n seg[seg.query(l-1,r)]=-1\r\n seg[x-1]=x-1\r\n sol[x-1]=0\r\n i+=1\r\n print(*sol)\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._file = file\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m = map(int, input().split())\np, d = [0] * (n + 2), list(range(1, n + 3))\nfor i in range(m):\n l, r, x = map(int, input().split())\n while l < x:\n if p[l]: \n k = d[l]\n d[l] = x\n l = k\n else: \n d[l], p[l] = x, x\n l += 1\n l += 1\n r += 1\n while p[r]: r = d[r]\n while l < r:\n if p[l]: \n k = d[l]\n d[l] = r\n l = k\n else:\n d[l], p[l] = r, x\n l += 1\nprint(' '.join(map(str, p[1: -1])))\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nimport math\r\nsys.setrecursionlimit(300005)\r\n\r\n# def build_tree(p,l,h):\r\n# if l==h:\r\n# st[p]=[arr[l]]\r\n# return\r\n\r\n# m=(l+h)//2\r\n# build_tree(2*p,l,m)\r\n# build_tree(2*p+1,m+1,h)\r\n\r\n# st[p]=[]\r\n# i=0\r\n# j=0\r\n# a=2*p\r\n# b=2*p+1\r\n# while i<len(st[a]) and j<len(st[b]):\r\n# if st[a][i]<st[b][j]:\r\n# st[p].append(st[a][i])\r\n# i=i+1\r\n# else:\r\n# st[p].append(st[b][j])\r\n# j=j+1\r\n# while i<len(st[a]):\r\n# st[p].append(st[a][i])\r\n# i=i+1\r\n# while j<len(st[b]):\r\n# st[p].append(st[b][j])\r\n# j=j+1\r\n \r\n \r\ndef update(p,l,r,s,e,x):\r\n if l>e or r<s:\r\n return \r\n\r\n if l<=s and r>=e:\r\n if st[p]==None:\r\n st[p]=x\r\n return \r\n \r\n m=(s+e)//2\r\n if st[2*p]==None:\r\n st[2*p]=st[p]\r\n\r\n if st[2*p+1]==None:\r\n st[2*p+1]=st[p]\r\n \r\n update(2*p,l,r,s,m,x)\r\n update(2*p+1,l,r,m+1,e,x)\r\n\r\ndef func(p,s,e):\r\n if s==e:\r\n if st[p]==None:\r\n ans[s]=0\r\n else:\r\n ans[s]=st[p]+1\r\n return \r\n\r\n\r\n m=(s+e)//2\r\n if st[2*p]==None:\r\n st[2*p]=st[p]\r\n\r\n if st[2*p+1]==None:\r\n st[2*p+1]=st[p]\r\n \r\n func(2*p,s,m)\r\n func(2*p+1,m+1,e)\r\n \r\n\r\n\r\n\r\n# def query_max(p,l,r,s,e,x):\r\n# if l>e or r<s:\r\n# return 0\r\n\r\n# if l<=s and r>=e:\r\n# i=0\r\n# j=len(st[p])-1\r\n# pos=j+1\r\n# while i<=j:\r\n# m=(i+j)//2\r\n\r\n# if st[p][m]>x:\r\n# j=m-1\r\n# pos=m\r\n# else:\r\n# i=m+1\r\n# return len(st[p])-pos \r\n \r\n# m=(s+e)//2\r\n# return query_max(2*p,l,r,s,m,x)+query_max(2*p+1,l,r,m+1,e,x)\r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\nx=math.ceil(math.log(n,2))+1\r\nL=1<<x\r\n\r\nst=[None]*(L)\r\n\r\n# build_tree(1,0,n-1)\r\n\r\nfor i in range(m):\r\n l,r,x=map(int,input().split())\r\n l=l-1\r\n r=r-1\r\n x=x-1\r\n\r\n if x>l:\r\n update(1,l,x-1,0,n-1,x)\r\n \r\n if x<r:\r\n update(1,x+1,r,0,n-1,x)\r\n \r\n\r\nans=[0]*(n)\r\nfunc(1,0,n-1)\r\nprint(*ans)\r\n", "n, m = (int(k) for k in input().split())\r\nlist_nxt = [i+1 for i in range(n+1)]\r\nresult = [0]*n\r\nfor line in range(m):\r\n l, r, x = (int(k) for k in input().split())\r\n pt = l\r\n while pt <= r:\r\n if result[pt-1] == 0 and pt != x:\r\n result[pt-1] = x\r\n nxt = list_nxt[pt]\r\n if pt < x:\r\n list_nxt[pt] = x\r\n else:\r\n list_nxt[pt] = r + 1\r\n pt = nxt\r\n\r\nprint(*result)", "# submission 68478211\r\ndef solve3(n, fights):\r\n ans = [0] * n\r\n a = [i for i in range(2, n + 5)]\r\n for l, r, w in fights:\r\n b = l\r\n while b <= r:\r\n if ans[b - 1] == 0 and b != w:\r\n ans[b - 1] = w\r\n nxt = a[b - 1]\r\n if b < w:\r\n a[b - 1] = w\r\n else:\r\n a[b - 1] = r + 1\r\n b = nxt\r\n\r\n return ans\r\n\r\n\r\ndef read():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef main():\r\n n, m = read()\r\n fights = [read() for _ in range(m)]\r\n ans = solve3(n, fights)\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "class KnightSegmentTree:\n def __init__(self, n: int) -> None:\n tree_size = 4 * n\n self.tree = [0] * tree_size\n self.size = n\n\n def update_with_round(self, li: int, ri: int, xi: int) -> None:\n # Need to 0-index li, ri, xi's\n # ri is inclusive, but segment tree is right-exclusive, so no need to subtract 1\n self._update_with_round(li - 1, ri, xi - 1, 0, 0, self.size)\n\n def _update_with_round(self, li: int, ri: int, xi: int, curr_node_idx: int, curr_left: int, curr_right: int) -> None:\n if curr_left >= ri or curr_right <= li:\n # Segment [tl, tr) that is being considered is out-of-bounds for update\n return\n\n # Check if the current segment is already completely covered\n # I.e. the knights from [tl, tr) have already been all defeated\n if self.tree[curr_node_idx] != 0:\n return\n \n # Reached a leaf-node (i.e. a single knight) that was defeated by xi\n if curr_right - curr_left == 1:\n # xi cannot defeat himself\n if curr_left != xi:\n self.tree[curr_node_idx] = xi + 1\n return\n\n # We are on a internal node - recurse left and right and check if all knights underneath have\n # been defeated \n midpt = (curr_left + curr_right) // 2\n self._update_with_round(li, ri, xi, curr_node_idx * 2 + 1, curr_left, midpt)\n self._update_with_round(li, ri, xi, curr_node_idx * 2 + 2, midpt, curr_right)\n if self.tree[curr_node_idx * 2 + 1] != 0 and self.tree[curr_node_idx * 2 + 2] != 0:\n self.tree[curr_node_idx] = -1\n\n def extract_values(self) -> list[int]:\n \"\"\"Extract the values of leaf-nodes into an array.\"\"\"\n output_arr = [0] * self.size\n self._extract_values(output_arr, 0, 0, self.size)\n return output_arr\n\n def _extract_values(self, output_arr: list[int], curr_node_idx: int, curr_left: int, curr_right: int):\n if curr_right - curr_left == 1:\n output_arr[curr_left] = self.tree[curr_node_idx]\n return\n\n midpt = (curr_left + curr_right) // 2\n self._extract_values(output_arr, curr_node_idx * 2 + 1, curr_left, midpt)\n self._extract_values(output_arr, curr_node_idx * 2 + 2, midpt, curr_right)\n\n\nimport sys\n\ndef main():\n lines = sys.stdin.readlines()\n n, m = list(map(int, lines[0].split(\" \")))\n rounds = [list(map(int, lines[1 + i].split(\" \"))) for i in range(m)]\n\n kst = KnightSegmentTree(n)\n for li, ri, xi in rounds:\n kst.update_with_round(li, ri, xi)\n\n print(\" \".join(map(str, kst.extract_values())))\n\nmain()\n\n", "n, m = list(map(int, input().split()))\r\nnext = [i for i in range(2, n + 3)]\r\nans = [0] * n\r\nfor i in range(m):\r\n l, r, x = map(int, input().split()) \r\n while(l <= r):\r\n if(ans[l - 1] == 0 and l != x):\r\n ans[l - 1] = x \r\n nxt = next[l - 1]\r\n if(l < x):\r\n next[l - 1] = x \r\n else:\r\n next[l - 1] = r + 1 \r\n l = nxt \r\nprint(*ans)\r\n ", "def ans():\r\n n,m = map(int,input().split())\r\n res,alive = [0]*n,[(i+1) for i in range(n+2)]\r\n from sys import stdin\r\n for _ in range(m):\r\n l,r,x = map(int,stdin.readline().split())\r\n i=l\r\n while i<=r:\r\n if res[i-1]==0 and i!=x:\r\n res[i-1] = x\r\n temp = alive[i]\r\n if i < x:\r\n alive[i] = x\r\n else:\r\n alive[i] = r+1\r\n i = temp\r\n print(*res)\r\nans()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n \r\nfrom bisect import bisect_left as lower_bound, bisect_right as upper_bound \r\n \r\nclass FenwickTree:\r\n def __init__(self, x):\r\n self.bit = []\r\n self.build(x)\r\n \r\n def build(self, x):\r\n \"\"\"transform x into a BIT\"\"\" \r\n self.bit[:] = x\r\n bit = self.bit\r\n size = self.size = len(x)\r\n for i in range(size):\r\n j = i | (i + 1)\r\n if j < size:\r\n bit[j] += bit[i]\r\n \r\n def update(self, idx, x):\r\n \"\"\"updates bit[idx] += x\"\"\"\r\n while idx < self.size:\r\n self.bit[idx] += x\r\n idx |= idx + 1\r\n \r\n def __call__(self, end):\r\n \"\"\"calc sum(bit[:end])\"\"\"\r\n x = 0\r\n while end:\r\n x += self.bit[end - 1]\r\n end &= end - 1\r\n return x\r\n \r\n def find_kth(self, k):\r\n \"\"\"Find largest idx such that sum(bit[:idx]) <= k\"\"\"\r\n idx = -1\r\n for d in reversed(range(self.size.bit_length())):\r\n right_idx = idx + (1 << d)\r\n if right_idx < self.size and self.bit[right_idx] <= k:\r\n idx = right_idx\r\n k -= self.bit[idx]\r\n return idx + 1, k\r\n \r\n \r\nblock_size = 700\r\nclass blocksorter:\r\n def __init__(self):\r\n self.macro = []\r\n self.micros = [[]]\r\n self.micro_size = [0]\r\n self.fenwick = FenwickTree([0])\r\n self.size = 0\r\n \r\n def lower_bound(self, x):\r\n i = lower_bound(self.macro, x)\r\n i -= i and self.micro_size[i - 1] and x <= self.micros[i - 1][-1]\r\n return self.fenwick(i) + lower_bound(self.micros[i], x)\r\n \r\n def upper_bound(self, x):\r\n i = upper_bound(self.macro, x)\r\n i -= i and self.micro_size[i - 1] and x < self.micros[i - 1][-1]\r\n return self.fenwick(i) + upper_bound(self.micros[i], x)\r\n \r\n def insert(self, x):\r\n i,j = self._lower_bound(x)\r\n self.micros[i].insert(j, x)\r\n self.size += 1\r\n self.micro_size[i] += 1\r\n self.fenwick.update(i, 1)\r\n if len(self.micros[i]) >= block_size:\r\n self.micros[i : i + 1] = self.micros[i][:block_size >> 1], self.micros[i][block_size >> 1:]\r\n self.micro_size[i : i + 1] = block_size >> 1, block_size >> 1\r\n self.fenwick.build(self.micro_size)\r\n self.macro [i : i + 1] = self.micros[i][0], self.micros[i + 1][0]\r\n if len(self.micros) == len(self.macro):\r\n self.macro.pop()\r\n \r\n def __delitem__(self, k):\r\n i,j = self.find_kth(k)\r\n del self.micros[i][j]\r\n self.size -= 1\r\n self.micro_size[i] -= 1\r\n self.fenwick.update(i, -1)\r\n if 1 < i + 1 < len(self.micro_size) and self.micro_size[i - 1] + self.micro_size[i] + self.micro_size[i + 1] < block_size:\r\n self.micros[i - 1] += self.micros[i]\r\n self.micros[i - 1] += self.micros[i + 1]\r\n self.micro_size[i - 1] += self.micro_size[i] + self.micro_size[i + 1]\r\n del self.macro[i - 1: i + 1], self.micros[i: i + 2], self.micro_size[i: i + 2]\r\n self.fenwick.build(self.micro_size)\r\n \r\n def __getitem__(self, k):\r\n i,j = self.find_kth(k)\r\n return self.micros[i][j]\r\n \r\n def __len__(self):\r\n return self.size\r\n \r\n def __contains__(self, x):\r\n i,j = self._lower_bound(x)\r\n return j < len(self.micros[i]) and self.micros[i][j] == x\r\n \r\n # Internal functions\r\n def find_kth(self, k):\r\n if k < 0:\r\n k += self.size\r\n i,j = self.fenwick.find_kth(k)\r\n return (i,j) if j < len(self.micros[i]) else (i - 1, -1)\r\n \r\n def _lower_bound(self, x):\r\n i = lower_bound(self.macro, x)\r\n i -= i and self.micro_size[i - 1] and x <= self.micros[i - 1][-1]\r\n return i, lower_bound(self.micros[i], x)\r\n \r\nn,m = [int(x) for x in input().split()]\r\n \r\nBS = blocksorter()\r\nfor i in range(1, n + 1):\r\n BS.insert(i)\r\n \r\nbeat = [0] * n\r\nfor _ in range(m):\r\n l,r,x = [int(x) for x in input().split()]\r\n for ind in reversed(range(BS.lower_bound(l), BS.upper_bound(r))):\r\n if BS[ind] != x: \r\n beat[BS[ind] - 1] = x\r\n del BS[ind]\r\nprint(*beat)", "n, m = map(int, input().split())\nvivo, vencedor = list(range(1, n + 3)), [0] * (n + 2)\nfor _ in range(m):\n l, r, x = map(int, input().split())\n while l < x:\n if vencedor[l]:\n vivo[l], l = x, vivo[l]\n else:\n vivo[l] = vencedor[l] = x\n l += 1\n l += 1\n r += 1\n while vencedor[r]:\n r = vivo[r]\n while l < r:\n if vencedor[l]:\n vivo[l], l = r, vivo[l]\n else:\n vivo[l], vencedor[l] = r, x\n l += 1\nprint(' '.join(map(str, vencedor[1: -1])))\n\t\t\t \t \t \t \t \t\t\t\t \t\t", "n, m = map(int, input().split())\r\nnext_ = [i for i in range(1, n+1)]\r\nans = [0] * n\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n j = l-1\r\n while j < r:\r\n if (ans[j] == 0 and x!=j+1):\r\n ans[j]=x\r\n nxt = next_[j]\r\n if j < x:\r\n next_[j] = max(x-1, next_[j])\r\n else:\r\n next_[j] = max(r, next_[j])\r\n j = nxt\r\nprint(*ans)", "n, m = map(int,input().split()); arr = [ i+1 for i in range(n+2)]; a = [ 0 for i in range(n+2)]\r\nfor i in range(m) : \r\n l, r, x = map(int,input().split()) \r\n while l <= r : \r\n if (not a[l] and l != x) : a[l] = x \r\n nx = arr[l]; arr[l] = x if l < x else r+1; l = nx\r\nprint(*a[1:n+1])\r\n", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom sys import stdin\n\ninp = stdin.readline\n\nn, m = map(int, inp().split())\nans = [0] * (n + 1)\nalive = [(i + 1) for i in range(n + 2)]\n\nwhile m:\n m -= 1\n l, r, x = map(int, inp().split())\n i = l\n while i <= r:\n if ans[i] == 0 and i != x:\n ans[i] = x\n temp = alive[i]\n if i < x:\n alive[i] = x\n else:\n alive[i] = r + 1\n i = temp\n\nprint(*ans[1:])\n", "def prog():\r\n n,m = map(int,input().split())\r\n res,anext = [0]*n,[i+1 for i in range(n+2)]\r\n from sys import stdin\r\n for _ in range(m):\r\n l,r,x = map(int,stdin.readline().split())\r\n i=l\r\n while i<=r:\r\n if res[i-1]==0 and i!=x:\r\n res[i-1]=x\r\n save = anext[i]\r\n if i<x:\r\n anext[i]=x\r\n else:\r\n anext[i]=r+1\r\n i=save\r\n print(*res)\r\nprog()", "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\n\"\"\"Sorted List\r\n==============\r\nhttps://github.com/grantjenks/python-sortedcontainers\r\n\"\"\"\r\nimport sys\r\nimport traceback\r\nfrom bisect import bisect_left, bisect_right, insort\r\nfrom itertools import chain, repeat, starmap\r\nfrom math import log\r\nfrom operator import add, eq, ne, gt, ge, lt, le, iadd\r\nfrom textwrap import dedent\r\ntry:\r\n from collections.abc import Sequence, MutableSequence\r\nexcept ImportError:\r\n from collections import Sequence, MutableSequence\r\nfrom functools import wraps\r\nfrom functools import reduce\r\ntry:\r\n from _thread import get_ident\r\nexcept ImportError:\r\n from _dummy_thread import get_ident\r\ndef recursive_repr(fillvalue='...'):\r\n def decorating_function(user_function):\r\n repr_running = set()\r\n @wraps(user_function)\r\n def wrapper(self):\r\n key = id(self), get_ident()\r\n if key in repr_running:\r\n return fillvalue\r\n repr_running.add(key)\r\n try:\r\n result = user_function(self)\r\n finally:\r\n repr_running.discard(key)\r\n return result\r\n return wrapper\r\n return decorating_function\r\nclass SortedList(MutableSequence):\r\n DEFAULT_LOAD_FACTOR = 1000\r\n def __init__(self, iterable=None, key=None):\r\n assert key is None\r\n self._len = 0\r\n self._load = self.DEFAULT_LOAD_FACTOR\r\n self._lists = []\r\n self._maxes = []\r\n self._index = []\r\n self._offset = 0\r\n if iterable is not None:\r\n self._update(iterable)\r\n def __new__(cls, iterable=None, key=None):\r\n if key is None:\r\n return object.__new__(cls)\r\n else:\r\n if cls is SortedList:\r\n return object.__new__(SortedKeyList)\r\n else:\r\n raise TypeError('inherit SortedKeyList for key argument')\r\n @property\r\n def key(self):\r\n return None\r\n def _reset(self, load):\r\n values = reduce(iadd, self._lists, [])\r\n self._clear()\r\n self._load = load\r\n self._update(values)\r\n def clear(self):\r\n self._len = 0\r\n del self._lists[:]\r\n del self._maxes[:]\r\n del self._index[:]\r\n self._offset = 0\r\n _clear = clear\r\n def add(self, value):\r\n _lists = self._lists\r\n _maxes = self._maxes\r\n if _maxes:\r\n pos = bisect_right(_maxes, value)\r\n if pos == len(_maxes):\r\n pos -= 1\r\n _lists[pos].append(value)\r\n _maxes[pos] = value\r\n else:\r\n insort(_lists[pos], value)\r\n self._expand(pos)\r\n else:\r\n _lists.append([value])\r\n _maxes.append(value)\r\n self._len += 1\r\n def _expand(self, pos):\r\n _load = self._load\r\n _lists = self._lists\r\n _index = self._index\r\n if len(_lists[pos]) > (_load << 1):\r\n _maxes = self._maxes\r\n _lists_pos = _lists[pos]\r\n half = _lists_pos[_load:]\r\n del _lists_pos[_load:]\r\n _maxes[pos] = _lists_pos[-1]\r\n _lists.insert(pos + 1, half)\r\n _maxes.insert(pos + 1, half[-1])\r\n del _index[:]\r\n else:\r\n if _index:\r\n child = self._offset + pos\r\n while child:\r\n _index[child] += 1\r\n child = (child - 1) >> 1\r\n _index[0] += 1\r\n def update(self, iterable):\r\n _lists = self._lists\r\n _maxes = self._maxes\r\n values = sorted(iterable)\r\n if _maxes:\r\n if len(values) * 4 >= self._len:\r\n _lists.append(values)\r\n values = reduce(iadd, _lists, [])\r\n values.sort()\r\n self._clear()\r\n else:\r\n _add = self.add\r\n for val in values:\r\n _add(val)\r\n return\r\n _load = self._load\r\n _lists.extend(values[pos:(pos + _load)]\r\n for pos in range(0, len(values), _load))\r\n _maxes.extend(sublist[-1] for sublist in _lists)\r\n self._len = len(values)\r\n del self._index[:]\r\n _update = update\r\n def __contains__(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return False\r\n pos = bisect_left(_maxes, value)\r\n if pos == len(_maxes):\r\n return False\r\n _lists = self._lists\r\n idx = bisect_left(_lists[pos], value)\r\n return _lists[pos][idx] == value\r\n def discard(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return\r\n pos = bisect_left(_maxes, value)\r\n if pos == len(_maxes):\r\n return\r\n _lists = self._lists\r\n idx = bisect_left(_lists[pos], value)\r\n if _lists[pos][idx] == value:\r\n self._delete(pos, idx)\r\n def remove(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n raise ValueError('{0!r} not in list'.format(value))\r\n pos = bisect_left(_maxes, value)\r\n if pos == len(_maxes):\r\n raise ValueError('{0!r} not in list'.format(value))\r\n _lists = self._lists\r\n idx = bisect_left(_lists[pos], value)\r\n if _lists[pos][idx] == value:\r\n self._delete(pos, idx)\r\n else:\r\n raise ValueError('{0!r} not in list'.format(value))\r\n def _delete(self, pos, idx):\r\n _lists = self._lists\r\n _maxes = self._maxes\r\n _index = self._index\r\n _lists_pos = _lists[pos]\r\n del _lists_pos[idx]\r\n self._len -= 1\r\n len_lists_pos = len(_lists_pos)\r\n if len_lists_pos > (self._load >> 1):\r\n _maxes[pos] = _lists_pos[-1]\r\n if _index:\r\n child = self._offset + pos\r\n while child > 0:\r\n _index[child] -= 1\r\n child = (child - 1) >> 1\r\n _index[0] -= 1\r\n elif len(_lists) > 1:\r\n if not pos:\r\n pos += 1\r\n prev = pos - 1\r\n _lists[prev].extend(_lists[pos])\r\n _maxes[prev] = _lists[prev][-1]\r\n del _lists[pos]\r\n del _maxes[pos]\r\n del _index[:]\r\n self._expand(prev)\r\n elif len_lists_pos:\r\n _maxes[pos] = _lists_pos[-1]\r\n else:\r\n del _lists[pos]\r\n del _maxes[pos]\r\n del _index[:]\r\n def _loc(self, pos, idx):\r\n if not pos:\r\n return idx\r\n _index = self._index\r\n if not _index:\r\n self._build_index()\r\n total = 0\r\n pos += self._offset\r\n while pos:\r\n if not pos & 1:\r\n total += _index[pos - 1]\r\n pos = (pos - 1) >> 1\r\n return total + idx\r\n def _pos(self, idx):\r\n if idx < 0:\r\n last_len = len(self._lists[-1])\r\n if (-idx) <= last_len:\r\n return len(self._lists) - 1, last_len + idx\r\n idx += self._len\r\n if idx < 0:\r\n raise IndexError('list index out of range')\r\n elif idx >= self._len:\r\n raise IndexError('list index out of range')\r\n if idx < len(self._lists[0]):\r\n return 0, idx\r\n _index = self._index\r\n if not _index:\r\n self._build_index()\r\n pos = 0\r\n child = 1\r\n len_index = len(_index)\r\n while child < len_index:\r\n index_child = _index[child]\r\n if idx < index_child:\r\n pos = child\r\n else:\r\n idx -= index_child\r\n pos = child + 1\r\n child = (pos << 1) + 1\r\n return (pos - self._offset, idx)\r\n def _build_index(self):\r\n row0 = list(map(len, self._lists))\r\n if len(row0) == 1:\r\n self._index[:] = row0\r\n self._offset = 0\r\n return\r\n head = iter(row0)\r\n tail = iter(head)\r\n row1 = list(starmap(add, zip(head, tail)))\r\n if len(row0) & 1:\r\n row1.append(row0[-1])\r\n if len(row1) == 1:\r\n self._index[:] = row1 + row0\r\n self._offset = 1\r\n return\r\n size = 2 ** (int(log(len(row1) - 1, 2)) + 1)\r\n row1.extend(repeat(0, size - len(row1)))\r\n tree = [row0, row1]\r\n while len(tree[-1]) > 1:\r\n head = iter(tree[-1])\r\n tail = iter(head)\r\n row = list(starmap(add, zip(head, tail)))\r\n tree.append(row)\r\n reduce(iadd, reversed(tree), self._index)\r\n self._offset = size * 2 - 1\r\n def __delitem__(self, index):\r\n if isinstance(index, slice):\r\n start, stop, step = index.indices(self._len)\r\n if step == 1 and start < stop:\r\n if start == 0 and stop == self._len:\r\n return self._clear()\r\n elif self._len <= 8 * (stop - start):\r\n values = self._getitem(slice(None, start))\r\n if stop < self._len:\r\n values += self._getitem(slice(stop, None))\r\n self._clear()\r\n return self._update(values)\r\n indices = range(start, stop, step)\r\n if step > 0:\r\n indices = reversed(indices)\r\n _pos, _delete = self._pos, self._delete\r\n for index in indices:\r\n pos, idx = _pos(index)\r\n _delete(pos, idx)\r\n else:\r\n pos, idx = self._pos(index)\r\n self._delete(pos, idx)\r\n def __getitem__(self, index):\r\n _lists = self._lists\r\n if isinstance(index, slice):\r\n start, stop, step = index.indices(self._len)\r\n if step == 1 and start < stop:\r\n if start == 0 and stop == self._len:\r\n return reduce(iadd, self._lists, [])\r\n start_pos, start_idx = self._pos(start)\r\n start_list = _lists[start_pos]\r\n stop_idx = start_idx + stop - start\r\n if len(start_list) >= stop_idx:\r\n return start_list[start_idx:stop_idx]\r\n if stop == self._len:\r\n stop_pos = len(_lists) - 1\r\n stop_idx = len(_lists[stop_pos])\r\n else:\r\n stop_pos, stop_idx = self._pos(stop)\r\n prefix = _lists[start_pos][start_idx:]\r\n middle = _lists[(start_pos + 1):stop_pos]\r\n result = reduce(iadd, middle, prefix)\r\n result += _lists[stop_pos][:stop_idx]\r\n return result\r\n if step == -1 and start > stop:\r\n result = self._getitem(slice(stop + 1, start + 1))\r\n result.reverse()\r\n return result\r\n indices = range(start, stop, step)\r\n return list(self._getitem(index) for index in indices)\r\n else:\r\n if self._len:\r\n if index == 0:\r\n return _lists[0][0]\r\n elif index == -1:\r\n return _lists[-1][-1]\r\n else:\r\n raise IndexError('list index out of range')\r\n if 0 <= index < len(_lists[0]):\r\n return _lists[0][index]\r\n len_last = len(_lists[-1])\r\n if -len_last < index < 0:\r\n return _lists[-1][len_last + index]\r\n pos, idx = self._pos(index)\r\n return _lists[pos][idx]\r\n _getitem = __getitem__\r\n def __setitem__(self, index, value):\r\n message = 'use ``del sl[index]`` and ``sl.add(value)`` instead'\r\n raise NotImplementedError(message)\r\n def __iter__(self):\r\n return chain.from_iterable(self._lists)\r\n def __reversed__(self):\r\n return chain.from_iterable(map(reversed, reversed(self._lists)))\r\n def reverse(self):\r\n raise NotImplementedError('use ``reversed(sl)`` instead')\r\n def islice(self, start=None, stop=None, reverse=False):\r\n _len = self._len\r\n if not _len:\r\n return iter(())\r\n start, stop, _ = slice(start, stop).indices(self._len)\r\n if start >= stop:\r\n return iter(())\r\n _pos = self._pos\r\n min_pos, min_idx = _pos(start)\r\n if stop == _len:\r\n max_pos = len(self._lists) - 1\r\n max_idx = len(self._lists[-1])\r\n else:\r\n max_pos, max_idx = _pos(stop)\r\n return self._islice(min_pos, min_idx, max_pos, max_idx, reverse)\r\n def _islice(self, min_pos, min_idx, max_pos, max_idx, reverse):\r\n _lists = self._lists\r\n if min_pos > max_pos:\r\n return iter(())\r\n if min_pos == max_pos:\r\n if reverse:\r\n indices = reversed(range(min_idx, max_idx))\r\n return map(_lists[min_pos].__getitem__, indices)\r\n indices = range(min_idx, max_idx)\r\n return map(_lists[min_pos].__getitem__, indices)\r\n next_pos = min_pos + 1\r\n if next_pos == max_pos:\r\n if reverse:\r\n min_indices = range(min_idx, len(_lists[min_pos]))\r\n max_indices = range(max_idx)\r\n return chain(\r\n map(_lists[max_pos].__getitem__, reversed(max_indices)),\r\n map(_lists[min_pos].__getitem__, reversed(min_indices)),\r\n )\r\n min_indices = range(min_idx, len(_lists[min_pos]))\r\n max_indices = range(max_idx)\r\n return chain(\r\n map(_lists[min_pos].__getitem__, min_indices),\r\n map(_lists[max_pos].__getitem__, max_indices),\r\n )\r\n if reverse:\r\n min_indices = range(min_idx, len(_lists[min_pos]))\r\n sublist_indices = range(next_pos, max_pos)\r\n sublists = map(_lists.__getitem__, reversed(sublist_indices))\r\n max_indices = range(max_idx)\r\n return chain(\r\n map(_lists[max_pos].__getitem__, reversed(max_indices)),\r\n chain.from_iterable(map(reversed, sublists)),\r\n map(_lists[min_pos].__getitem__, reversed(min_indices)),\r\n )\r\n min_indices = range(min_idx, len(_lists[min_pos]))\r\n sublist_indices = range(next_pos, max_pos)\r\n sublists = map(_lists.__getitem__, sublist_indices)\r\n max_indices = range(max_idx)\r\n return chain(\r\n map(_lists[min_pos].__getitem__, min_indices),\r\n chain.from_iterable(sublists),\r\n map(_lists[max_pos].__getitem__, max_indices),\r\n )\r\n def irange(self, minimum=None, maximum=None, inclusive=(True, True),\r\n reverse=False):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return iter(())\r\n _lists = self._lists\r\n if minimum is None:\r\n min_pos = 0\r\n min_idx = 0\r\n else:\r\n if inclusive[0]:\r\n min_pos = bisect_left(_maxes, minimum)\r\n if min_pos == len(_maxes):\r\n return iter(())\r\n min_idx = bisect_left(_lists[min_pos], minimum)\r\n else:\r\n min_pos = bisect_right(_maxes, minimum)\r\n if min_pos == len(_maxes):\r\n return iter(())\r\n min_idx = bisect_right(_lists[min_pos], minimum)\r\n if maximum is None:\r\n max_pos = len(_maxes) - 1\r\n max_idx = len(_lists[max_pos])\r\n else:\r\n if inclusive[1]:\r\n max_pos = bisect_right(_maxes, maximum)\r\n if max_pos == len(_maxes):\r\n max_pos -= 1\r\n max_idx = len(_lists[max_pos])\r\n else:\r\n max_idx = bisect_right(_lists[max_pos], maximum)\r\n else:\r\n max_pos = bisect_left(_maxes, maximum)\r\n if max_pos == len(_maxes):\r\n max_pos -= 1\r\n max_idx = len(_lists[max_pos])\r\n else:\r\n max_idx = bisect_left(_lists[max_pos], maximum)\r\n return self._islice(min_pos, min_idx, max_pos, max_idx, reverse)\r\n def __len__(self):\r\n return self._len\r\n def bisect_left(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return 0\r\n pos = bisect_left(_maxes, value)\r\n if pos == len(_maxes):\r\n return self._len\r\n idx = bisect_left(self._lists[pos], value)\r\n return self._loc(pos, idx)\r\n def bisect_right(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return 0\r\n pos = bisect_right(_maxes, value)\r\n if pos == len(_maxes):\r\n return self._len\r\n idx = bisect_right(self._lists[pos], value)\r\n return self._loc(pos, idx)\r\n bisect = bisect_right\r\n _bisect_right = bisect_right\r\n def count(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return 0\r\n pos_left = bisect_left(_maxes, value)\r\n if pos_left == len(_maxes):\r\n return 0\r\n _lists = self._lists\r\n idx_left = bisect_left(_lists[pos_left], value)\r\n pos_right = bisect_right(_maxes, value)\r\n if pos_right == len(_maxes):\r\n return self._len - self._loc(pos_left, idx_left)\r\n idx_right = bisect_right(_lists[pos_right], value)\r\n if pos_left == pos_right:\r\n return idx_right - idx_left\r\n right = self._loc(pos_right, idx_right)\r\n left = self._loc(pos_left, idx_left)\r\n return right - left\r\n def copy(self):\r\n return self.__class__(self)\r\n __copy__ = copy\r\n def append(self, value):\r\n raise NotImplementedError('use ``sl.add(value)`` instead')\r\n def extend(self, values):\r\n raise NotImplementedError('use ``sl.update(values)`` instead')\r\n def insert(self, index, value):\r\n raise NotImplementedError('use ``sl.add(value)`` instead')\r\n def pop(self, index=-1):\r\n if not self._len:\r\n raise IndexError('pop index out of range')\r\n _lists = self._lists\r\n if index == 0:\r\n val = _lists[0][0]\r\n self._delete(0, 0)\r\n return val\r\n if index == -1:\r\n pos = len(_lists) - 1\r\n loc = len(_lists[pos]) - 1\r\n val = _lists[pos][loc]\r\n self._delete(pos, loc)\r\n return val\r\n if 0 <= index < len(_lists[0]):\r\n val = _lists[0][index]\r\n self._delete(0, index)\r\n return val\r\n len_last = len(_lists[-1])\r\n if -len_last < index < 0:\r\n pos = len(_lists) - 1\r\n loc = len_last + index\r\n val = _lists[pos][loc]\r\n self._delete(pos, loc)\r\n return val\r\n pos, idx = self._pos(index)\r\n val = _lists[pos][idx]\r\n self._delete(pos, idx)\r\n return val\r\n def index(self, value, start=None, stop=None):\r\n _len = self._len\r\n if not _len:\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n if start is None:\r\n start = 0\r\n if start < 0:\r\n start += _len\r\n if start < 0:\r\n start = 0\r\n if stop is None:\r\n stop = _len\r\n if stop < 0:\r\n stop += _len\r\n if stop > _len:\r\n stop = _len\r\n if stop <= start:\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n _maxes = self._maxes\r\n pos_left = bisect_left(_maxes, value)\r\n if pos_left == len(_maxes):\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n _lists = self._lists\r\n idx_left = bisect_left(_lists[pos_left], value)\r\n if _lists[pos_left][idx_left] != value:\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n stop -= 1\r\n left = self._loc(pos_left, idx_left)\r\n if start <= left:\r\n if left <= stop:\r\n return left\r\n else:\r\n right = self._bisect_right(value) - 1\r\n if start <= right:\r\n return start\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n def __add__(self, other):\r\n values = reduce(iadd, self._lists, [])\r\n values.extend(other)\r\n return self.__class__(values)\r\n __radd__ = __add__\r\n def __iadd__(self, other):\r\n self._update(other)\r\n return self\r\n def __mul__(self, num):\r\n values = reduce(iadd, self._lists, []) * num\r\n return self.__class__(values)\r\n __rmul__ = __mul__\r\n def __imul__(self, num):\r\n values = reduce(iadd, self._lists, []) * num\r\n self._clear()\r\n self._update(values)\r\n return self\r\n def __make_cmp(seq_op, symbol, doc):\r\n def comparer(self, other):\r\n if not isinstance(other, Sequence):\r\n return NotImplemented\r\n self_len = self._len\r\n len_other = len(other)\r\n if self_len != len_other:\r\n if seq_op is eq:\r\n return False\r\n if seq_op is ne:\r\n return True\r\n for alpha, beta in zip(self, other):\r\n if alpha != beta:\r\n return seq_op(alpha, beta)\r\n return seq_op(self_len, len_other)\r\n seq_op_name = seq_op.__name__\r\n comparer.__name__ = '__{0}__'.format(seq_op_name)\r\n doc_str = \"\"\"Return true if and only if sorted list is {0} `other`.\r\n ``sl.__{1}__(other)`` <==> ``sl {2} other``\r\n Comparisons use lexicographical order as with sequences.\r\n Runtime complexity: `O(n)`\r\n :param other: `other` sequence\r\n :return: true if sorted list is {0} `other`\r\n \"\"\"\r\n comparer.__doc__ = dedent(doc_str.format(doc, seq_op_name, symbol))\r\n return comparer\r\n __eq__ = __make_cmp(eq, '==', 'equal to')\r\n __ne__ = __make_cmp(ne, '!=', 'not equal to')\r\n __lt__ = __make_cmp(lt, '<', 'less than')\r\n __gt__ = __make_cmp(gt, '>', 'greater than')\r\n __le__ = __make_cmp(le, '<=', 'less than or equal to')\r\n __ge__ = __make_cmp(ge, '>=', 'greater than or equal to')\r\n __make_cmp = staticmethod(__make_cmp)\r\n def __reduce__(self):\r\n values = reduce(iadd, self._lists, [])\r\n return (type(self), (values,))\r\n @recursive_repr()\r\n def __repr__(self):\r\n return '{0}({1!r})'.format(type(self).__name__, list(self))\r\n def _check(self):\r\n try:\r\n assert self._load >= 4\r\n assert len(self._maxes) == len(self._lists)\r\n assert self._len == sum(len(sublist) for sublist in self._lists)\r\n for sublist in self._lists:\r\n for pos in range(1, len(sublist)):\r\n assert sublist[pos - 1] <= sublist[pos]\r\n for pos in range(1, len(self._lists)):\r\n assert self._lists[pos - 1][-1] <= self._lists[pos][0]\r\n for pos in range(len(self._maxes)):\r\n assert self._maxes[pos] == self._lists[pos][-1]\r\n double = self._load << 1\r\n assert all(len(sublist) <= double for sublist in self._lists)\r\n half = self._load >> 1\r\n for pos in range(0, len(self._lists) - 1):\r\n assert len(self._lists[pos]) >= half\r\n if self._index:\r\n assert self._len == self._index[0]\r\n assert len(self._index) == self._offset + len(self._lists)\r\n for pos in range(len(self._lists)):\r\n leaf = self._index[self._offset + pos]\r\n assert leaf == len(self._lists[pos])\r\n for pos in range(self._offset):\r\n child = (pos << 1) + 1\r\n if child >= len(self._index):\r\n assert self._index[pos] == 0\r\n elif child + 1 == len(self._index):\r\n assert self._index[pos] == self._index[child]\r\n else:\r\n child_sum = self._index[child] + self._index[child + 1]\r\n assert child_sum == self._index[pos]\r\n except:\r\n traceback.print_exc(file=sys.stdout)\r\n print('len', self._len)\r\n print('load', self._load)\r\n print('offset', self._offset)\r\n print('len_index', len(self._index))\r\n print('index', self._index)\r\n print('len_maxes', len(self._maxes))\r\n print('maxes', self._maxes)\r\n print('len_lists', len(self._lists))\r\n print('lists', self._lists)\r\n raise\r\ndef identity(value):\r\n return value\r\nclass SortedKeyList(SortedList):\r\n def __init__(self, iterable=None, key=identity):\r\n self._key = key\r\n self._len = 0\r\n self._load = self.DEFAULT_LOAD_FACTOR\r\n self._lists = []\r\n self._keys = []\r\n self._maxes = []\r\n self._index = []\r\n self._offset = 0\r\n if iterable is not None:\r\n self._update(iterable)\r\n def __new__(cls, iterable=None, key=identity):\r\n return object.__new__(cls)\r\n @property\r\n def key(self):\r\n return self._key\r\n def clear(self):\r\n self._len = 0\r\n del self._lists[:]\r\n del self._keys[:]\r\n del self._maxes[:]\r\n del self._index[:]\r\n _clear = clear\r\n def add(self, value):\r\n _lists = self._lists\r\n _keys = self._keys\r\n _maxes = self._maxes\r\n key = self._key(value)\r\n if _maxes:\r\n pos = bisect_right(_maxes, key)\r\n if pos == len(_maxes):\r\n pos -= 1\r\n _lists[pos].append(value)\r\n _keys[pos].append(key)\r\n _maxes[pos] = key\r\n else:\r\n idx = bisect_right(_keys[pos], key)\r\n _lists[pos].insert(idx, value)\r\n _keys[pos].insert(idx, key)\r\n self._expand(pos)\r\n else:\r\n _lists.append([value])\r\n _keys.append([key])\r\n _maxes.append(key)\r\n self._len += 1\r\n def _expand(self, pos):\r\n _lists = self._lists\r\n _keys = self._keys\r\n _index = self._index\r\n if len(_keys[pos]) > (self._load << 1):\r\n _maxes = self._maxes\r\n _load = self._load\r\n _lists_pos = _lists[pos]\r\n _keys_pos = _keys[pos]\r\n half = _lists_pos[_load:]\r\n half_keys = _keys_pos[_load:]\r\n del _lists_pos[_load:]\r\n del _keys_pos[_load:]\r\n _maxes[pos] = _keys_pos[-1]\r\n _lists.insert(pos + 1, half)\r\n _keys.insert(pos + 1, half_keys)\r\n _maxes.insert(pos + 1, half_keys[-1])\r\n del _index[:]\r\n else:\r\n if _index:\r\n child = self._offset + pos\r\n while child:\r\n _index[child] += 1\r\n child = (child - 1) >> 1\r\n _index[0] += 1\r\n def update(self, iterable):\r\n _lists = self._lists\r\n _keys = self._keys\r\n _maxes = self._maxes\r\n values = sorted(iterable, key=self._key)\r\n if _maxes:\r\n if len(values) * 4 >= self._len:\r\n _lists.append(values)\r\n values = reduce(iadd, _lists, [])\r\n values.sort(key=self._key)\r\n self._clear()\r\n else:\r\n _add = self.add\r\n for val in values:\r\n _add(val)\r\n return\r\n _load = self._load\r\n _lists.extend(values[pos:(pos + _load)]\r\n for pos in range(0, len(values), _load))\r\n _keys.extend(list(map(self._key, _list)) for _list in _lists)\r\n _maxes.extend(sublist[-1] for sublist in _keys)\r\n self._len = len(values)\r\n del self._index[:]\r\n _update = update\r\n def __contains__(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return False\r\n key = self._key(value)\r\n pos = bisect_left(_maxes, key)\r\n if pos == len(_maxes):\r\n return False\r\n _lists = self._lists\r\n _keys = self._keys\r\n idx = bisect_left(_keys[pos], key)\r\n len_keys = len(_keys)\r\n len_sublist = len(_keys[pos])\r\n while True:\r\n if _keys[pos][idx] != key:\r\n return False\r\n if _lists[pos][idx] == value:\r\n return True\r\n idx += 1\r\n if idx == len_sublist:\r\n pos += 1\r\n if pos == len_keys:\r\n return False\r\n len_sublist = len(_keys[pos])\r\n idx = 0\r\n def discard(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return\r\n key = self._key(value)\r\n pos = bisect_left(_maxes, key)\r\n if pos == len(_maxes):\r\n return\r\n _lists = self._lists\r\n _keys = self._keys\r\n idx = bisect_left(_keys[pos], key)\r\n len_keys = len(_keys)\r\n len_sublist = len(_keys[pos])\r\n while True:\r\n if _keys[pos][idx] != key:\r\n return\r\n if _lists[pos][idx] == value:\r\n self._delete(pos, idx)\r\n return\r\n idx += 1\r\n if idx == len_sublist:\r\n pos += 1\r\n if pos == len_keys:\r\n return\r\n len_sublist = len(_keys[pos])\r\n idx = 0\r\n def remove(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n raise ValueError('{0!r} not in list'.format(value))\r\n key = self._key(value)\r\n pos = bisect_left(_maxes, key)\r\n if pos == len(_maxes):\r\n raise ValueError('{0!r} not in list'.format(value))\r\n _lists = self._lists\r\n _keys = self._keys\r\n idx = bisect_left(_keys[pos], key)\r\n len_keys = len(_keys)\r\n len_sublist = len(_keys[pos])\r\n while True:\r\n if _keys[pos][idx] != key:\r\n raise ValueError('{0!r} not in list'.format(value))\r\n if _lists[pos][idx] == value:\r\n self._delete(pos, idx)\r\n return\r\n idx += 1\r\n if idx == len_sublist:\r\n pos += 1\r\n if pos == len_keys:\r\n raise ValueError('{0!r} not in list'.format(value))\r\n len_sublist = len(_keys[pos])\r\n idx = 0\r\n def _delete(self, pos, idx):\r\n _lists = self._lists\r\n _keys = self._keys\r\n _maxes = self._maxes\r\n _index = self._index\r\n keys_pos = _keys[pos]\r\n lists_pos = _lists[pos]\r\n del keys_pos[idx]\r\n del lists_pos[idx]\r\n self._len -= 1\r\n len_keys_pos = len(keys_pos)\r\n if len_keys_pos > (self._load >> 1):\r\n _maxes[pos] = keys_pos[-1]\r\n if _index:\r\n child = self._offset + pos\r\n while child > 0:\r\n _index[child] -= 1\r\n child = (child - 1) >> 1\r\n _index[0] -= 1\r\n elif len(_keys) > 1:\r\n if not pos:\r\n pos += 1\r\n prev = pos - 1\r\n _keys[prev].extend(_keys[pos])\r\n _lists[prev].extend(_lists[pos])\r\n _maxes[prev] = _keys[prev][-1]\r\n del _lists[pos]\r\n del _keys[pos]\r\n del _maxes[pos]\r\n del _index[:]\r\n self._expand(prev)\r\n elif len_keys_pos:\r\n _maxes[pos] = keys_pos[-1]\r\n else:\r\n del _lists[pos]\r\n del _keys[pos]\r\n del _maxes[pos]\r\n del _index[:]\r\n def irange(self, minimum=None, maximum=None, inclusive=(True, True),\r\n reverse=False):\r\n min_key = self._key(minimum) if minimum is not None else None\r\n max_key = self._key(maximum) if maximum is not None else None\r\n return self._irange_key(\r\n min_key=min_key, max_key=max_key,\r\n inclusive=inclusive, reverse=reverse,\r\n )\r\n def irange_key(self, min_key=None, max_key=None, inclusive=(True, True),\r\n reverse=False):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return iter(())\r\n _keys = self._keys\r\n if min_key is None:\r\n min_pos = 0\r\n min_idx = 0\r\n else:\r\n if inclusive[0]:\r\n min_pos = bisect_left(_maxes, min_key)\r\n if min_pos == len(_maxes):\r\n return iter(())\r\n min_idx = bisect_left(_keys[min_pos], min_key)\r\n else:\r\n min_pos = bisect_right(_maxes, min_key)\r\n if min_pos == len(_maxes):\r\n return iter(())\r\n min_idx = bisect_right(_keys[min_pos], min_key)\r\n if max_key is None:\r\n max_pos = len(_maxes) - 1\r\n max_idx = len(_keys[max_pos])\r\n else:\r\n if inclusive[1]:\r\n max_pos = bisect_right(_maxes, max_key)\r\n if max_pos == len(_maxes):\r\n max_pos -= 1\r\n max_idx = len(_keys[max_pos])\r\n else:\r\n max_idx = bisect_right(_keys[max_pos], max_key)\r\n else:\r\n max_pos = bisect_left(_maxes, max_key)\r\n if max_pos == len(_maxes):\r\n max_pos -= 1\r\n max_idx = len(_keys[max_pos])\r\n else:\r\n max_idx = bisect_left(_keys[max_pos], max_key)\r\n return self._islice(min_pos, min_idx, max_pos, max_idx, reverse)\r\n _irange_key = irange_key\r\n def bisect_left(self, value):\r\n return self._bisect_key_left(self._key(value))\r\n def bisect_right(self, value):\r\n return self._bisect_key_right(self._key(value))\r\n bisect = bisect_right\r\n def bisect_key_left(self, key):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return 0\r\n pos = bisect_left(_maxes, key)\r\n if pos == len(_maxes):\r\n return self._len\r\n idx = bisect_left(self._keys[pos], key)\r\n return self._loc(pos, idx)\r\n _bisect_key_left = bisect_key_left\r\n def bisect_key_right(self, key):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return 0\r\n pos = bisect_right(_maxes, key)\r\n if pos == len(_maxes):\r\n return self._len\r\n idx = bisect_right(self._keys[pos], key)\r\n return self._loc(pos, idx)\r\n bisect_key = bisect_key_right\r\n _bisect_key_right = bisect_key_right\r\n def count(self, value):\r\n _maxes = self._maxes\r\n if not _maxes:\r\n return 0\r\n key = self._key(value)\r\n pos = bisect_left(_maxes, key)\r\n if pos == len(_maxes):\r\n return 0\r\n _lists = self._lists\r\n _keys = self._keys\r\n idx = bisect_left(_keys[pos], key)\r\n total = 0\r\n len_keys = len(_keys)\r\n len_sublist = len(_keys[pos])\r\n while True:\r\n if _keys[pos][idx] != key:\r\n return total\r\n if _lists[pos][idx] == value:\r\n total += 1\r\n idx += 1\r\n if idx == len_sublist:\r\n pos += 1\r\n if pos == len_keys:\r\n return total\r\n len_sublist = len(_keys[pos])\r\n idx = 0\r\n def copy(self):\r\n return self.__class__(self, key=self._key)\r\n __copy__ = copy\r\n def index(self, value, start=None, stop=None):\r\n _len = self._len\r\n if not _len:\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n if start is None:\r\n start = 0\r\n if start < 0:\r\n start += _len\r\n if start < 0:\r\n start = 0\r\n if stop is None:\r\n stop = _len\r\n if stop < 0:\r\n stop += _len\r\n if stop > _len:\r\n stop = _len\r\n if stop <= start:\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n _maxes = self._maxes\r\n key = self._key(value)\r\n pos = bisect_left(_maxes, key)\r\n if pos == len(_maxes):\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n stop -= 1\r\n _lists = self._lists\r\n _keys = self._keys\r\n idx = bisect_left(_keys[pos], key)\r\n len_keys = len(_keys)\r\n len_sublist = len(_keys[pos])\r\n while True:\r\n if _keys[pos][idx] != key:\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n if _lists[pos][idx] == value:\r\n loc = self._loc(pos, idx)\r\n if start <= loc <= stop:\r\n return loc\r\n elif loc > stop:\r\n break\r\n idx += 1\r\n if idx == len_sublist:\r\n pos += 1\r\n if pos == len_keys:\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n len_sublist = len(_keys[pos])\r\n idx = 0\r\n raise ValueError('{0!r} is not in list'.format(value))\r\n def __add__(self, other):\r\n values = reduce(iadd, self._lists, [])\r\n values.extend(other)\r\n return self.__class__(values, key=self._key)\r\n __radd__ = __add__\r\n def __mul__(self, num):\r\n values = reduce(iadd, self._lists, []) * num\r\n return self.__class__(values, key=self._key)\r\n def __reduce__(self):\r\n values = reduce(iadd, self._lists, [])\r\n return (type(self), (values, self.key))\r\n @recursive_repr()\r\n def __repr__(self):\r\n type_name = type(self).__name__\r\n return '{0}({1!r}, key={2!r})'.format(type_name, list(self), self._key)\r\n def _check(self):\r\n try:\r\n assert self._load >= 4\r\n assert len(self._maxes) == len(self._lists) == len(self._keys)\r\n assert self._len == sum(len(sublist) for sublist in self._lists)\r\n for sublist in self._keys:\r\n for pos in range(1, len(sublist)):\r\n assert sublist[pos - 1] <= sublist[pos]\r\n for pos in range(1, len(self._keys)):\r\n assert self._keys[pos - 1][-1] <= self._keys[pos][0]\r\n for val_sublist, key_sublist in zip(self._lists, self._keys):\r\n assert len(val_sublist) == len(key_sublist)\r\n for val, key in zip(val_sublist, key_sublist):\r\n assert self._key(val) == key\r\n for pos in range(len(self._maxes)):\r\n assert self._maxes[pos] == self._keys[pos][-1]\r\n double = self._load << 1\r\n assert all(len(sublist) <= double for sublist in self._lists)\r\n half = self._load >> 1\r\n for pos in range(0, len(self._lists) - 1):\r\n assert len(self._lists[pos]) >= half\r\n if self._index:\r\n assert self._len == self._index[0]\r\n assert len(self._index) == self._offset + len(self._lists)\r\n for pos in range(len(self._lists)):\r\n leaf = self._index[self._offset + pos]\r\n assert leaf == len(self._lists[pos])\r\n for pos in range(self._offset):\r\n child = (pos << 1) + 1\r\n if child >= len(self._index):\r\n assert self._index[pos] == 0\r\n elif child + 1 == len(self._index):\r\n assert self._index[pos] == self._index[child]\r\n else:\r\n child_sum = self._index[child] + self._index[child + 1]\r\n assert child_sum == self._index[pos]\r\n except:\r\n traceback.print_exc(file=sys.stdout)\r\n print('len', self._len)\r\n print('load', self._load)\r\n print('offset', self._offset)\r\n print('len_index', len(self._index))\r\n print('index', self._index)\r\n print('len_maxes', len(self._maxes))\r\n print('maxes', self._maxes)\r\n print('len_keys', len(self._keys))\r\n print('keys', self._keys)\r\n print('len_lists', len(self._lists))\r\n print('lists', self._lists)\r\n raise\r\nSortedListWithKey = SortedKeyList\r\n\r\n\r\n\r\ndef solution():\r\n n, m = [int(num) for num in input().split()]\r\n t = []\r\n for i in range(m):\r\n t.append((int(num) - 1 for num in input().split()))\r\n sl = SortedList(range(n))\r\n ans = [0 for i in range(n)]\r\n for l, r, x in t:\r\n i = sl.bisect_left(l)\r\n stack = []\r\n while i < len(sl) and sl[i] <= r:\r\n if sl[i] != x:\r\n ans[sl[i]] = x + 1\r\n stack.append(sl[i])\r\n i += 1\r\n while stack:\r\n sl.remove(stack.pop())\r\n print(*ans)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split())\nans = [0] * n\na = [i for i in range(2, n + 5)]\nfor _ in range(m) :\n\tl, r, w = map(int, input().split())\n\tb = l\n\twhile (b <= r):\n\t\tif ans[b - 1] == 0 and b != w:\n\t\t\tans[b - 1] = w\n\t\tnxt = a[b - 1]\n\t\tif b < w:\n\t\t\ta[b - 1] = w\n\t\telse:\n\t\t\ta[b - 1] = r + 1\n\t\tb = nxt\nprint(*ans)\n\n \t \t\t\t\t \t \t\t\t \t \t\t\t\t \t\t \t \t", "nKnights, nFights = map(int,input().split())\r\nanext = [i + 1 for i in range(nKnights + 1)]\r\nresult = [0] * nKnights\r\nfor _ in range(nFights):\r\n l, r, x = map(int,input().split())\r\n i = l\r\n while i <= r:\r\n if result[i-1]==0 and i!=x:\r\n result[i-1] = x\r\n temp = anext[i]\r\n if i < x:\r\n anext[i] = x\r\n else:\r\n anext[i] = r + 1\r\n i = temp\r\nprint(*result)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = [0]*(n+1)\r\ne = list(range(1, n+2))\r\nfor _ in range(m):\r\n l, r, x = map(int, input().split())\r\n i = l\r\n while i <= r:\r\n if d[i] == 0 and i != x:\r\n d[i] = x\r\n a = e[i]\r\n if e[i] < x and i < x:\r\n e[i] = x\r\n if e[i] < r and x < i < r:\r\n e[i] = r\r\n i = a\r\nprint(' '.join(map(str, d[1:])))", "import sys\n\ninput_str = sys.stdin.read().split()\ninput_str_idx = 0\n\n\ndef pop_int():\n global input_str_idx\n input_str_idx += 1\n return int(input_str[input_str_idx - 1])\n\n\nn, m = pop_int(), pop_int()\nlrx = [(pop_int(), pop_int(), pop_int()) for _ in range(m)]\n\n\ndef make_st(n):\n active = [0] * (4*n)\n active[0] = 1\n return [0] * (4 * n), active\n\n\ndef paint_st(n, v, active, targetl, targetr, x, idx=None, l=None, r=None):\n if idx == None:\n idx = 0\n l = 0\n r = n\n\n #print(f\"painting target: {targetl}-{targetr} <- {x} - idx{idx}:{l}-{r}\")\n if targetl == l and targetr == r:\n v[idx] = x\n active[idx] = 1\n return\n\n idx_l = idx * 2 + 1\n idx_r = idx_l + 1\n if active[idx]:\n active[idx] = 0\n active[idx_l] = 1\n active[idx_r] = 1\n v[idx_l] = v[idx]\n v[idx_r] = v[idx]\n mid = (l + r) // 2\n if targetr <= mid:\n paint_st(n, v, active, targetl, targetr, x, idx_l, l, mid)\n elif targetl >= mid:\n paint_st(n, v, active, targetl, targetr, x, idx_r, mid, r)\n else:\n paint_st(n, v, active, targetl, mid, x, idx_l, l, mid)\n paint_st(n, v, active, mid, targetr, x, idx_r, mid, r)\n\n\ndef st_repr(n, v, idx=None, l=None, r=None):\n if idx == None:\n idx = 0\n l = 0\n r = n\n if active[idx]:\n val = v[idx]\n return \" \".join(str(val) for i in range(l, r))\n else:\n mid = (l + r) // 2\n strl = st_repr(n, v, idx * 2 + 1, l, mid)\n strr = st_repr(n, v, idx * 2 + 2, mid, r)\n return strl + \" \" + strr\n\n\nv, active = make_st(n)\nfor l, r, x in reversed(lrx):\n if x == r:\n paint_st(n, v, active, l - 1, r-1, x)\n elif x == l:\n paint_st(n, v, active, l, r, x)\n else:\n paint_st(n, v, active, l - 1, x - 1, x)\n paint_st(n, v, active, x, r, x)\n\nprint(st_repr(n, v))\n", "from sys import stdin, stdout, setrecursionlimit\r\nfrom collections import deque, defaultdict, Counter\r\nfrom heapq import heappush, heappop\r\nimport math\r\n\r\nrl = lambda: stdin.readline()\r\nrll = lambda: stdin.readline().split()\r\nrli = lambda: map(int, stdin.readline().split())\r\nrlf = lambda: map(float, stdin.readline().split())\r\n\r\nINF, NINF = float('inf'), float('-inf')\r\n\r\nclass SegTree:\r\n\tdef __init__(self, size):\r\n\t\tself.n = size\r\n\t\tself.T = [[INF, INF] for _ in range(4*self.n)]\r\n\r\n\tdef _update_range(self, v, tl, tr, l, r, val):\r\n\t\tif l > r or tl > tr: return\r\n\t\t# print(f\"l, r = {l, r}, tl, tr = {tl, tr}\")\r\n\t\tif l == tl and r == tr:\r\n\t\t\t# self.T[v].append(val)\r\n\t\t\tif self.T[v] == [INF, INF]:\r\n\t\t\t\tself.T[v] = val\r\n\t\telse:\r\n\t\t\tmid = (tl + tr)//2\r\n\t\t\tself._update_range(2*v, tl, mid, l, min(r, mid), val)\r\n\t\t\tself._update_range(2*v+1, mid+1, tr, max(l, mid+1), r, val)\r\n\r\n\tdef update_range(self, l, r, val):\r\n\t\tself._update_range(1, 0, self.n-1, l, r, val)\r\n\r\n\r\n\tdef qry(self, index):\r\n\t\treturn self._qry(1, 0, self.n-1, index)\r\n\r\n\tdef _qry(self, v, tl, tr, index):\r\n\t\tif tl == tr:\r\n\t\t\tif self.T[v]:\r\n\t\t\t\treturn self.T[v]\r\n\t\t\telse:\r\n\t\t\t\treturn (INF, INF)\r\n\t\telse:\r\n\t\t\tmid = (tl + tr)//2\r\n\t\t\tcurr_x, curr_time = INF, INF\r\n\t\t\tif self.T[v]:\r\n\t\t\t \tcurr_x, curr_time = self.T[v]\r\n\t\t\tif index <= mid:\r\n\t\t\t\tprev_x, prev_time = self._qry(2*v, tl, mid, index)\r\n\t\t\telse:\r\n\t\t\t\tprev_x, prev_time = self._qry(2*v+1, mid+1, tr, index)\r\n\t\t\tif curr_time < prev_time:\r\n\t\t\t\treturn (curr_x, curr_time)\r\n\t\t\telse:\r\n\t\t\t\treturn (prev_x, prev_time)\r\n\r\ndef main():\r\n\t# n = number of knights\r\n\t# m = number of fights\r\n\tn, m = rli()\r\n\tans = [0 for _ in range(n)]\r\n\tST = SegTree(n)\r\n\tfor time in range(m):\r\n\t\tl, r, x = rli()\r\n\t\tl -= 1\r\n\t\tr -= 1\r\n\t\tx -= 1\r\n\t\tST.update_range(l, x-1, (x, time))\r\n\t\tST.update_range(x+1, r, (x, time))\r\n\r\n\tfor i in range(n):\r\n\t\tk, _ = ST.qry(i)\r\n\t\tans[i] = k + 1 if k < INF else 0\r\n\tprint(\" \".join(str(x) for x in ans))\r\n\tstdout.close()\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n, m = map(int, input().split())\r\np, d = [0] * (n + 2), [0] * (n + 2)\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n while l < x:\r\n if d[l]:\r\n k = d[l]\r\n d[l] = x - l\r\n l += k\r\n else:\r\n d[l], p[l] = x - l, x\r\n l += 1\r\n l += 1\r\n r += 1\r\n while d[r]: r += d[r]\r\n while l < r:\r\n if d[l]:\r\n k = d[l]\r\n d[l] = r - l\r\n l += k\r\n else:\r\n d[l], p[l] = r - l, x\r\n l += 1\r\nprint(' '.join(map(str, p[1: -1])))", "# submission 42135285\r\ndef solve(n, fights):\r\n ans = [0] * (n + 2)\r\n nxt = list(range(1, n + 3))\r\n\r\n for l, r, x in fights:\r\n while l < x:\r\n if ans[l]:\r\n k = nxt[l]\r\n nxt[l] = x\r\n l = k\r\n else:\r\n nxt[l] = ans[l] = x\r\n l += 1\r\n\r\n l += 1\r\n r += 1\r\n while ans[r]:\r\n r = nxt[r]\r\n\r\n while l < r:\r\n if ans[l]:\r\n k = nxt[l]\r\n nxt[l] = r\r\n l = k\r\n else:\r\n nxt[l] = r\r\n ans[l] = x\r\n l += 1\r\n\r\n return ans[1:-1]\r\n\r\n\r\ndef read():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef main():\r\n n, m = read()\r\n fights = [read() for _ in range(m)]\r\n ans = solve(n, fights)\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nn,m=map(int,input().split())\r\nans=[0 for i in range(n)]\r\nnextl=[i+1 for i in range(n+2)]\r\nfor j in range(m):\r\n\tl,r,x=map(int,input().split())\r\n\ti=l\r\n\twhile i<=r:\r\n\t\tif ans[i-1]==0 and i!=x:\r\n\t\t\tans[i-1]=x\r\n\t\ta=nextl[i]\r\n\t\tif i<x:\r\n\t\t\tnextl[i]=x\r\n\t\telse:\r\n\t\t\tnextl[i]=r+1\r\n\t\ti=a\r\nprint(*ans)", "# This code is contributed by Siddharth\r\n\r\nfrom sys import *\r\ninput = stdin.readline\r\n\r\n\r\n\r\n\r\nimport random\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nimport operator\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n# inverse modulo power pow(a,-1,mod) - it only works on py 3.8 ( *not in pypy )\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================\r\n\r\ndef build(v,l,r):\r\n if l==r:\r\n tree[v]=1\r\n else:\r\n mid=(l+r)//2\r\n build(v*2,l,mid)\r\n build(v*2+1,mid+1,r)\r\n tree[v]=tree[v*2]+tree[v*2+1]\r\n\r\n\r\ndef update(v,tl,tr,l,r,x):\r\n if tl>r or tr<l:\r\n return\r\n if tl==tr:\r\n if (tl!=x):\r\n tree[v]=0\r\n dic[tl]=x\r\n return\r\n mid=(tl+tr)//2\r\n if (tree[v*2]>0):\r\n update(v*2,tl,mid,l,r,x)\r\n if (tree[v*2+1]>0):\r\n update(v*2+1,mid+1,tr,l,r,x)\r\n tree[v]=tree[v*2]+tree[v*2+1]\r\n\r\nn,m=map(int,input().split())\r\ntree=[0]*(4*n)\r\ndic=defaultdict(int)\r\nbuild(1,1,n)\r\nfor _ in range(m):\r\n l,r,x=map(int,input().split())\r\n update(1,1,n,l,r,x)\r\nfor i in range(1,n+1):\r\n print(dic[i],end=\" \")", "n, m = map(int, input().split())\r\nres = [i + 1 for i in range(n)]\r\nans = [0] * n\r\nfor i in range(m):\r\n l, r, x = map(int, input().split())\r\n li ,xi = l - 1, x - 1\r\n while li < r:\r\n if ans[li] == 0 and li != xi:\r\n ans[li] = x\r\n a = res[li]\r\n if li < xi:\r\n res[li] = xi\r\n else:\r\n res[li] = r\r\n li = a\r\nprint(*ans)", "def torneio_cavaleiros():\n # Lê a quantidade de cavaleiros e lutas\n num_cavaleiros, num_lutas = map(int, input().split())\n\n # Inicializa os resultados e a próxima luta de cada cavaleiro\n resultados, proxima_luta = [0] * num_cavaleiros, [i + 1 for i in range(num_cavaleiros + 2)]\n\n # Processa cada luta\n for _ in range(num_lutas):\n # Lê os dados da luta (quem lutou e quem venceu)\n inicio_luta, fim_luta, vencedor = map(int, input().split())\n\n # Itera sobre os cavaleiros que participaram desta luta\n i = inicio_luta\n while i <= fim_luta:\n # Se o cavaleiro ainda não foi derrotado e não é o vencedor, registra o vencedor como quem o derrotou\n if resultados[i - 1] == 0 and i != vencedor:\n resultados[i - 1] = vencedor\n\n # Armazena a próxima luta deste cavaleiro\n prox_luta_salva = proxima_luta[i]\n\n # Se o cavaleiro lutou antes do vencedor, sua próxima luta é a do vencedor\n if i < vencedor:\n proxima_luta[i] = vencedor\n # Se o cavaleiro lutou depois do vencedor, sua próxima luta é a próxima após o fim desta luta\n else:\n proxima_luta[i] = fim_luta + 1\n\n # Avança para a próxima luta do cavaleiro\n i = prox_luta_salva\n\n # Imprime os resultados para cada cavaleiro\n print(*resultados)\n\n\n# Executa a função\ntorneio_cavaleiros()\n\n\t\t \t\t\t \t \t \t\t\t\t\t\t \t\t \t \t\t", "t=lambda:map(int,input().split())\r\nr,p=t();w=[0]*r;n=[i+1 for i in range(r+1)]\r\nfor i in range(p):\r\n o,d,k=t();j=o\r\n while j<=d:\r\n if w[j-1]==0 and j!=k:w[j-1]=k\r\n y=n[j]\r\n if j<k:n[j]=k\r\n else:n[j]=d+1\r\n j=y\r\nprint(*w)", "inp = lambda: map(int, input().split())\r\n\r\nn, m = inp()\r\nlink = [i+1 for i in range(n+3)]\r\nans = [0] * (n+1)\r\n\r\nfor _ in range(m):\r\n l, r, x = inp()\r\n pt = l\r\n while pt <= r:\r\n if ans[pt] == 0 and pt != x:\r\n ans[pt] = x\r\n nxt = link[pt]\r\n if pt < x:\r\n link[pt] = x\r\n else:\r\n link[pt] = r+1\r\n pt = nxt \r\n\r\nprint(*ans[1:])\r\n", "# n,m=map(int,input().split())\r\n\r\n# result=[None]*(n+1)\r\n# nxt=[i+1 for i in range(n+2)]\r\n# # print(result)\r\n# for _ in range(m):\r\n# l,r,x=map(int,input().split())\r\n# cur=l\r\n# while cur<r+1:\r\n# tmp=nxt[cur]\r\n# if not result[cur] and cur!=x:\r\n# if cur<x: nxt[cur]=x\r\n# else: nxt[cur]=r+1\r\n# result[cur]=x\r\n# cur=tmp\r\n# # print(result)\r\n# result[x]=0\r\n# print(*result[1:])\r\n\r\nfrom sys import stdin\r\n \r\ninp = stdin.readline\r\n \r\nn, m = map(int, inp().split())\r\nans = [0] * (n + 1)\r\nalive = [(i + 1) for i in range(n + 2)]\r\n \r\nwhile m:\r\n m -= 1\r\n l, r, x = map(int, inp().split())\r\n i = l\r\n while i <= r:\r\n if ans[i] == 0 and i != x:\r\n ans[i] = x\r\n temp = alive[i]\r\n if i < x:\r\n alive[i] = x\r\n else:\r\n alive[i] = r + 1\r\n i = temp\r\n \r\nprint(*ans[1:])", "from collections import *\r\nfrom sys import stdin\r\n\r\n\r\ndef arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return list(stdin.readline()[:-1])\r\n\r\n\r\nclass segmenttree:\r\n def __init__(self, arr, n):\r\n self.tree, self.n = [0] * (2 * n), n\r\n # build tree\r\n if arr:\r\n for i in range(2 * n - 1, 0, -1):\r\n if i >= n:\r\n self.tree[i] = arr[i - n]\r\n else:\r\n self.tree[i] = self.tree[i << 1] + self.tree[(i << 1) + 1]\r\n\r\n # get interval[l,r)\r\n def query(self, l, r, val):\r\n res = 0\r\n l += self.n\r\n r += self.n\r\n while l < r:\r\n if l & 1:\r\n self.tree[l] = val\r\n l += 1\r\n if r & 1:\r\n r -= 1\r\n self.tree[r] = val\r\n l >>= 1\r\n r >>= 1\r\n\r\n return res\r\n\r\n def search(self, ix):\r\n ix += self.n\r\n\r\n # move up\r\n ret = [0, 0]\r\n while ix > 1:\r\n if self.tree[ix] and self.tree[ix][1] >= ret[1]:\r\n ret = self.tree[ix].copy()\r\n ix >>= 1\r\n\r\n return ret\r\n\r\n\r\nn, m = map(int, input().split())\r\nans, tree = [0] * (n + 1), segmenttree([], n)\r\nquaries, c = [arr_inp(1) for i in range(m)], 0\r\n\r\nfor l, r, x in (quaries[::-1]):\r\n tree.query(l - 1, x - 1, [x, c])\r\n tree.query(x, r, [x, c])\r\n c += 1\r\n\r\nfor i in range(n):\r\n if quaries[-1][2] != i + 1:\r\n ans[i + 1] = tree.search(i)[0]\r\n\r\nprint(*ans[1:])\r\n", "from sys import stdout, stdin\r\n#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\nimport bisect\r\ncase = li()\r\nans=[0 for i in range(case[0])]\r\nnextl=[i+1 for i in range(case[0]+2)]\r\nfor j in range(case[1]):\r\n\tf = li()\r\n\ti=f[0]\r\n\twhile i<=f[1]:\r\n\t\tif ans[i-1]==0 and i!=f[2]:\r\n\t\t\tans[i-1]=f[2]\r\n\t\ta=nextl[i]\r\n\t\tif i<f[2]:\r\n\t\t\tnextl[i]=f[2]\r\n\t\telse:\r\n\t\t\tnextl[i]=f[1]+1\r\n\t\ti=a\r\nprint(*ans)\r\n", "\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\n# x = input()\r\n# sys.stdout.write(str(x) + \"\\n\")\r\nn,q = list(map(int, input().split()))\r\n\r\nnex = [i for i in range(n+2)]\r\nans = [0 for i in range(n+1)]\r\n\r\ndef findNext(l):\r\n # print(l, nex[l])\r\n if l == nex[l]:\r\n return l\r\n nex[l] = findNext(nex[l])\r\n return nex[l]\r\nfor i in range(q):\r\n l,r,w = list(map(int, input().split()))\r\n l = findNext(l)\r\n while l <= r and l <= n:\r\n if l < w:\r\n ans[l] = w\r\n nex[l] = w\r\n elif l > w:\r\n ans[l] = w\r\n nex[l] = r+1\r\n # print(nex)\r\n l = findNext(l+1)\r\n ans[w] = 0\r\nsys.stdout.write(\" \".join([str(i) for i in ans[1:]]) + \"\\n\")", "n, m = map(int, input().split())\r\nres = ['0'] * n\r\narr = [i for i in range(n)]\r\nfor _ in range(m):\r\n l, r, x = map(int,input().split())\r\n idx, max_idx, path = l - 1, r, []\r\n while idx < r:\r\n while idx < n and arr[idx] != idx:\r\n path.append(idx)\r\n idx = arr[idx]\r\n if idx < r and idx != x - 1:\r\n res[idx] = str(x)\r\n path.append(idx)\r\n if idx >= r:\r\n max_idx = idx\r\n idx += 1\r\n for i in path:\r\n if i < x - 1: arr[i] = x - 1\r\n else: arr[i] = max_idx\r\nprint(' '.join(res))\r\n", "knights, lutas = [int(x) for x in input().split()]\nresultado = [0 for _ in range(knights)]\narray = [i + 1 for i in range(1, knights + 1)]\n \nfor _ in range(lutas):\n k1, k2, w = [int(x) for x in input().split()]\n i = k1\n while i <= k2:\n proximo = array[i - 1]\n if i < w:\n array[i - 1] = w\n else:\n array[i - 1] = k2 + 1\n \n if resultado[i - 1] == 0 and i != w:\n resultado[i - 1] = w\n i = proximo\n \nprint(*resultado)\n \t\t \t \t\t\t\t \t\t \t \t \t\t\t\t\t\t\t\t\t", "n, m = [int(e) for e in input().split()]\n\nresult = [0 for e in range(n)]\nnext_alive = [e + 1 for e in range(n)]\n\n\nfor _ in range(m):\n l, r, x = [int(e) - 1 for e in input().split()]\n\n while l <= r:\n if l != x and result[l] == 0:\n result[l] = x + 1\n\n cache = next_alive[l]\n\n if l < x:\n next_alive[l] = x\n else:\n next_alive[l] = r + 1\n\n l = cache\n\nprint(*result)\n", "from sys import stdin\r\nn, m = map(int, input().split())\r\nN = n + 1\r\nlosers = [0] * n\r\nna = list(range(1, N+1))\r\nna[-1] = float('inf')\r\n\r\nfor line in stdin:\r\n l, r, x = map(int, line.split())\r\n current = l\r\n while current <= r:\r\n nxt = na[current]\r\n if current < x:\r\n na[current] = x\r\n if not losers[current-1]:\r\n losers[current-1] = x\r\n else:\r\n na[current] = na[r]\r\n if current != x and not losers[current-1]:\r\n losers[current-1] = x\r\n current = nxt\r\nprint(' '.join(map(str, losers)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\nans = [0 for i in range(n+2)]\r\nnext = [i+1 for i in range(n+2)]\r\nfor i in range(m):\r\n l,r,x = map(int,input().split())\r\n j = l\r\n if ans[j]!=0: j = next[j]\r\n while j<=r:\r\n if ans[j]==0 and j!=x:\r\n ans[j] = x\r\n y = next[j]\r\n if j<x: next[j] = x\r\n else: next[j] = r+1\r\n j = y\r\nprint(*ans[1:-1],sep=\" \")\r\n\r\n", "n, m=map(int,input().split())\r\n \r\nrecord=[0 for i in range(n)]\r\npc=[i+1 for i in range(1,n+1)]\r\n \r\nfor i in range(m):\r\n l, r, w=map(int,input().split())\r\n j=l \r\n while j<=r :\r\n next=pc[j-1]\r\n\r\n if j<w:\r\n pc[j-1]=w\r\n else:\r\n pc[j-1]=r+1\r\n \r\n if record[j-1]==0 and j!=w: \r\n record[j-1]=w\r\n j=next\r\n \r\n \r\n \r\nprint(' '.join(map(str,record))) ", "import sys\r\n\r\nI = lambda: int(input())\r\nreadline = lambda: sys.stdin.readline().strip('\\n')\r\nRM = readmap = lambda x=int: map(x,readline().split(' '))\r\n\r\nn,m = RM()\r\nconq = ['0']*(n+1)\r\nnxt = list(range(1,n+2))#contains the nxt person alive for each person\r\nfor _ in range(m):\r\n l,r,m = RM()\r\n cur = l\r\n while cur<=r:\r\n if conq[cur]=='0' and cur!=m: conq[cur]=str(m)\r\n nx = nxt[cur]\r\n nxt[cur] = [r+1,m][cur<m]#right most of the segment or the conqueror\r\n cur = nx\r\n\r\nprint(' '.join(conq[1:]))\r\n", "knights, fights = [int(x) for x in input().split()]\nres = [0 for _ in range(knights)]\narr = [i + 1 for i in range(1, knights + 1)]\n\nfor _ in range(fights):\n k1, k2, w = [int(x) for x in input().split()]\n i = k1\n while i <= k2:\n next = arr[i - 1]\n if i < w:\n arr[i - 1] = w\n else:\n arr[i - 1] = k2 + 1\n\n if res[i - 1] == 0 and i != w:\n res[i - 1] = w\n i = next\n\nprint(*res)\n\n\n\t\t \t \t\t\t \t\t \t\t\t\t\t \t \t \t\t" ]

[ "n, p = map(int, input().split())\r\ns = input()\r\nA = [list() for i in range(p)]\r\nfor i in range(len(s)):\r\n A[(i % p)].append(s[i])\r\nbad_index = -1\r\nchange = False\r\nchange1 = '0'\r\nchange2 = '0'\r\nfor i in range(p):\r\n if '.' in A[i] and A[i] != ['.']:\r\n bad_index = i\r\n change = True\r\n if '0' in A[i]:\r\n change1 = '1'\r\n change2 = '0'\r\n else:\r\n change1 = '0'\r\n change2 = '1'\r\n \r\n if '0' in A[i] and '1' in A[i]:\r\n bad_index = i\r\n change = False\r\n\r\nif bad_index == -1:\r\n print('No')\r\nelse:\r\n ans = list(s)\r\n cnt = 0\r\n for i in range(len(s)):\r\n if i % p == bad_index:\r\n if not change:\r\n if s[i] == '.':\r\n ans[i] = '0'\r\n if change:\r\n if s[i] == '.':\r\n if cnt == 0:\r\n ans[i] = change1\r\n cnt += 1\r\n else:\r\n ans[i] = change2\r\n else:\r\n if s[i] == '.':\r\n ans[i] = change1\r\n print(''.join(ans))", "n,p=map(int, input().split())\r\ns=input()\r\nt=s.replace('.', '0')\r\nif(all(t[i] == t[i + p] for i in range(n - p))):\r\n k=-1\r\n for r in range(p - 1, -1, -1):\r\n x=s[r::p].rfind('.')\r\n if(x!=-1 and s[r::p]!='.'):\r\n k=max(k,x*p+r)\r\n if(k==-1):\r\n print('No')\r\n else:\r\n print(t[:k]+'1'+t[(k+1):])\r\nelse:\r\n print(t)", "n=[int(num) for num in input().split()]\r\ns=input()\r\nflag=0\r\nfor i in range(0,n[0]-n[1]):\r\n if s[i]!=s[i+n[1]] and s[i]!='.' and s[i+n[1]]!='.':\r\n flag=1\r\n break\r\n elif s[i]==s[i+n[1]] and s[i]=='.':\r\n s=s[:i]+'0'+s[i+1:i+n[1]]+'1'+s[i+n[1]+1:]\r\n flag=1\r\n break\r\n elif s[i]=='.':\r\n if s[i+n[1]]=='1':\r\n s=s[:i]+'0'+s[i+1:]\r\n else:\r\n s=s[:i]+'1'+s[i+1:]\r\n flag=1\r\n break\r\n elif s[i+n[1]]=='.':\r\n if s[i]=='1':\r\n s=s[:i+n[1]]+'0'+s[i+n[1]+1:]\r\n else:\r\n s=s[:i+n[1]]+'1'+s[i+n[1]+1:]\r\n flag=1\r\n break\r\nif flag==1:\r\n for i in s:\r\n if i=='.':\r\n i='0'\r\n print(i,end='')\r\nelse:\r\n print('NO')\r\n", "from sys import stdin, stdout\r\n\r\n\r\nn, p = map(int, stdin.readline().split())\r\nans = list(stdin.readline().strip())\r\n\r\nfor i in range(n - p):\r\n if ans[i] != '.' and ans[i + p] != '.':\r\n continue\r\n \r\n if ans[i] != '.' and ans[i + p] == '.':\r\n if ans[i] == '1':\r\n ans[i + p] = '0'\r\n else:\r\n ans[i + p] = '1'\r\n elif ans[i] == '.' and ans[i + p] == '.':\r\n ans[i], ans[i + p] = '1', '0'\r\n else:\r\n if ans[i + p] == '1':\r\n ans[i] = '0'\r\n else:\r\n ans[i] = '1'\r\n\r\nans = ''.join(ans).replace('.', '1') \r\n\r\nlabel = 0\r\nfor i in range(n - p):\r\n if ans[i] != ans[i + p]:\r\n label = 1\r\n\r\nif not label:\r\n stdout.write('No')\r\nelse:\r\n stdout.write(''.join(ans))", "n, p = map(int, input().split(' '))\r\n\r\ncad = input()\r\n\r\ni = 0\r\nj = p\r\n\r\nnotp = False\r\nwhile i < n and j < n:\r\n if (cad[i] == '1' and cad[j]== '1') or (cad[i] == '0' and cad[j]== '0'):\r\n i+=1\r\n j+=1\r\n elif cad[i] == '1' and cad[j] == '0':\r\n print(cad.replace('.','0'))\r\n notp = True\r\n break\r\n elif cad[i] == '0' and cad[j] == '1':\r\n print(cad.replace('.','0'))\r\n notp = True\r\n break\r\n elif cad[i] == '.':\r\n notp = True\r\n listcad = list(cad)\r\n if cad[j] == '.':\r\n listcad[i] = '1'\r\n listcad[j] = '0'\r\n cad = \"\".join(listcad)\r\n print(cad.replace('.','0'))\r\n elif cad[j] == '1':\r\n print(cad.replace('.','0'))\r\n else:\r\n print(cad.replace('.','1'))\r\n break\r\n elif cad[j] == '.':\r\n notp = True\r\n listcad = list(cad)\r\n if cad[i] == '.':\r\n listcad[j] = '1'\r\n listcad[i] = '0'\r\n cad = \"\".join(listcad)\r\n print(cad.replace('.','0'))\r\n elif cad[i] == '1':\r\n print(cad.replace('.','0'))\r\n else:\r\n print(cad.replace('.','1'))\r\n break\r\n\r\nif not notp:\r\n print('No')", "n, p = map(int, input().split())\r\ns = input()\r\nfor i in range(n-p):\r\n\tc1, c2 = s[i], s[i+p]\r\n\tif c1 != c2:\r\n\t\tif c1 == '.':\r\n\t\t\tc3 = c2\r\n\t\telse:\r\n\t\t\tc3 = c1\r\n\t\tif c3 == '0':\r\n\t\t\tc3 = '1'\r\n\t\telse:\r\n\t\t\tc3 = '0'\r\n\t\tprint(s.replace('.', c3))\r\n\t\tbreak\r\n\telif c1 == '.':\r\n\t\ts = s.replace(c1, '0')\r\n\t\tprint(s[:i]+'1'+s[i+1:])\r\n\t\tbreak\r\nelse:\r\n\tprint('No')\r\n", "def func(st, sr, n):\r\n\t\"\"\"\r\n\t:param st: large string\r\n\t:param sr: small string\r\n\t:param n: int given\r\n\t:return:\r\n\t\"\"\"\r\n\tfor i in range(len(sr)):\r\n\t\tif (st[i] == '0' or st[i+n] == '0') and (st[i] == '.' or st[i+n]=='.'):\r\n\t\t\tprint(st.replace('.', '1'))\r\n\t\t\treturn 0\r\n\t\telif (st[i]=='1' or st[i+n]=='1') and (st[i]=='.' or st[i+n]=='.'):\r\n\t\t\tprint(st.replace('.', '0'))\r\n\t\t\treturn 0\r\n\t\telif st[i]==st[i+n]=='.':\r\n\t\t\tprint(st[:i+1].replace('.', '0') + st[i+1:].replace('.', '1'))\r\n\t\t\treturn 0\r\n\t\telif (st[i]=='0' or st[i+n]=='0') and (st[i]=='1' or st[i+n]=='1'):\r\n\t\t\tprint(st.replace('.', '0'))\r\n\t\t\treturn 0\r\n\tprint('No')\r\n\treturn 0\r\n\r\n\r\nnx = input().split()\r\n\r\n\r\nn = int(nx[0])\r\np = int(nx[1])\r\ns = input()\r\nst = s[:n-p]\r\nfunc(s, st, p)\r\n\r\n", "\r\nn,p = map(int, input().split())\r\n\r\n\r\ns = input()\r\n\r\nsep = len(s) - p\r\ns1 = list(s[0:sep])\r\ns2 = list(s[sep: p])\r\ns3 = list(s[p:len(s)])\r\n\r\n\"\"\"\r\nprint(sep)\r\nprint(len(s))\r\nprint(s1)\r\nprint(s2)\r\nprint(s3)\r\n\"\"\"\r\nif (s1 == s3 and '.' not in s1):\r\n print(\"No\")\r\n exit(0)\r\n\r\nfor i, ch in enumerate(s1):\r\n if (s1[i] == s3[i]):\r\n if (s1[i] == '.'):\r\n s1[i] = '1'\r\n s3[i] = '0'\r\n elif (s1[i] == '.'):\r\n if (s3[i] == '0'):\r\n s1[i] = '1'\r\n else:\r\n s1[i] = '0'\r\n elif (s3[i] == '.'):\r\n if s1[i] == '0':\r\n s3[i] = '1'\r\n else:\r\n s3[i] = '0'\r\n\r\n\r\n#print(\"s3[] = \", s3[len(s1)-p:])\r\nif (s2 == []):\r\n ans = s1 + s3[len(s1) - p:]\r\nelse:\r\n ans = s1 + s2 + s3\r\nfor i, ch in enumerate(ans):\r\n if (ch == '.'):\r\n ans[i] = '0'\r\nprint(\"\".join(ans))\r\n#print(len(ans))", "n, p = map(int, input().split())\r\ns = input()\r\nx = []\r\nfor j in s:\r\n\tx.append(j)\r\nind = False\r\nfor i in range(n):\r\n\tif i + p < n:\r\n\t\tif not ind and x[i + p] == \".\":\r\n\t\t\tif x[i] != \".\":\r\n\t\t\t\tx[i + p] = 1 - int(x[i])\r\n\t\t\telse:\r\n\t\t\t\tx[i] = 0\r\n\t\t\t\tx[i + p] = 1\r\n\t\t\tind = True\r\n\t\telif not ind and x[i] == \".\":\r\n\t\t\tx[i] = 1 - int(x[i + p])\r\n\t\t\tind = True\r\n\t\telif not ind and x[i] != x[i + p]:\r\n\t\t\tind = True\r\n\t\telif ind:\r\n\t\t\tif x[i] == \".\":\r\n\t\t\t\tx[i] = 0\r\n\telif x[i] == \".\":\r\n\t\tx[i] = 0\r\nif ind:\r\n\tfor j in range(n):\r\n\t\tprint(x[j], end = \"\")\r\nelse:\r\n\tprint(\"No\")\t\r\n\t\t\t\t\r\n", "n, p = map(int, input().split())\r\ns = input()\r\nans = True\r\nans2 = ['.'] * n\r\nfl = False\r\nfor i in range(n):\r\n ans2[i] = s[i]\r\nfor i in range(n - p):\r\n if ans2[i] != '.' and ans2[i + p] == '.':\r\n if ans2[i] == '0':\r\n ans2[i + p] = '1'\r\n else:\r\n ans2[i + p] = '0'\r\n for j in range(len(ans2)):\r\n if ans2[j] == '.':\r\n ans2[j] = '0'\r\n fl = True\r\n elif ans2[i] == '.' and ans2[i + p] != '.':\r\n if ans2[i + p] == '0':\r\n ans2[i] = '1'\r\n else:\r\n ans2[i] = '0'\r\n for j in range(len(ans2)):\r\n if ans2[j] == '.':\r\n ans2[j] = '0'\r\n fl = True \r\n elif ans2[i] == '.' and ans2[i + p] == '.':\r\n ans2[i] = '1'\r\n ans2[i + p] = '0'\r\n for j in range(len(ans2)):\r\n if ans2[j] == '.':\r\n ans2[j] = '0'\r\n fl = True\r\n elif s[i] != s[i + p] and s[i] != '.' and s[i + p] != '.':\r\n fl = True\r\n for j in range(n):\r\n if ans2[j] == '.':\r\n ans2[j] = '0'\r\n if fl:\r\n break\r\nif not fl:\r\n print('No')\r\nelse:\r\n for i in range(n):\r\n print(ans2[i], end='')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, p = map(int, input().split())\r\ns = list(input().rstrip())\r\nans = [-1] * n\r\nok = 0\r\nfor i in range(p):\r\n x = []\r\n for j in range(i, n, p):\r\n x.append(s[j])\r\n if len(x) == 1:\r\n ans[i] = max(x[0] - 48, 0)\r\n continue\r\n u = set(x)\r\n if len(u) >= 2 or 46 in u:\r\n ok = 1\r\n for j in range(i, n, p):\r\n if s[j] ^ 46:\r\n ans[j] = s[j] - 48\r\n else:\r\n if not 48 in u:\r\n u.add(48)\r\n ans[j] = 0\r\n else:\r\n u.add(49)\r\n ans[j] = 1\r\n else:\r\n for j in range(i, n, p):\r\n ans[j] = s[j] - 48\r\nans = \"\".join(map(str, ans)) if ok else \"No\"\r\nprint(ans)", "n, p = [int(item) for item in input().split()]\r\ns = list(input())\r\n\r\nno = True\r\n\r\nfor i in range(n - p):\r\n if s[i] == '.' and s[i + p] == '.':\r\n s[i] = '0'\r\n s[i + p] = '1'\r\n elif s[i] != '.' and s[i + p] != '.':\r\n if s[i] != s[i + p]: no = False\r\n continue\r\n elif s[i] != '.':\r\n s[i + p] = str(int(s[i]) ^ 1)\r\n elif s[i + p] != '.':\r\n s[i] = str(int(s[i + p]) ^ 1)\r\n \r\n no = False\r\n \r\n\r\nfor i in range(n):\r\n if s[i] == '.':\r\n s[i] = '0'\r\n\r\nif no: print(\"No\")\r\nelse: print(''.join(s))", "n, p = map(int, input().split())\r\ns = list(input())\r\n\r\nbad = True\r\nfor i in range(n - p):\r\n if s[i] == s[i + p] == '.':\r\n s[i] = 0\r\n s[i + p] = 1\r\n\r\n bad = False\r\n\r\n elif s[i] == '.':\r\n s[i] = 1 - int(s[i + p])\r\n\r\n bad = False\r\n\r\n elif s[i + p] == '.':\r\n s[i + p] = 1 - int(s[i])\r\n\r\n bad = False\r\n\r\n elif s[i] != s[i + p]:\r\n bad = False\r\n\r\nwhile '.' in s:\r\n s[s.index('.')] = 0\r\n\r\nif bad:\r\n print('No')\r\n exit()\r\n\r\nprint(''.join(map(str, s)))\r\n", "\r\nif __name__ == '__main__':\r\n\r\n nums = input()\r\n n = int(nums.split(' ')[0])\r\n p = int(nums.split(' ')[1])\r\n\r\n tar = input()\r\n tar = list(tar)\r\n\r\n\r\n fill_zero = False\r\n\r\n for i in range(len(tar)):\r\n if i+p >= n:\r\n break\r\n else:\r\n if tar[i] != '.' and tar[i+p] != '.':\r\n if tar[i] != tar[i+p]:\r\n fill_zero = True\r\n else:\r\n if tar[i] == '.' and tar[i + p] == '.':\r\n tar[i] = \"0\"\r\n tar[i+p] = \"1\"\r\n elif tar[i] == '.' and tar[i + p] != '.':\r\n tar[i] = str(1 - int(tar[i+p]))\r\n elif tar[i] != '.' and tar[i + p] == '.':\r\n tar[i + p] = str(1 - int(tar[i]))\r\n fill_zero = True\r\n\r\n if fill_zero == True:\r\n for i in range(len(tar)):\r\n if tar[i] == '.':\r\n tar[i] = \"0\"\r\n print(\"\".join(tar))\r\n else:\r\n print('No')\r\n\r\n", "# Problem: B. A Tide of Riverscape\r\n# Contest: Codeforces - Codeforces Round #487 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/989/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# User: anky\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\nn, k = map(int, input().split())\r\nss = input()\r\ns = []\r\nfor i in ss:\r\n\ts.append(i)\r\nf = 0\r\nfor\ti in range(n-k):\r\n\tif s[i]=='.':\r\n\t\tf = 1\r\n\t\tif s[i+k]=='.':\r\n\t\t\ts[i]='0'\r\n\t\t\ts[i+k]='1'\r\n\t\telif s[i+k]=='0':\r\n\t\t\ts[i]='1'\r\n\t\telif s[i+k]=='1':\r\n\t\t\ts[i]='0'\r\n\t\tbreak\r\n\telif s[i]=='0':\r\n\t\tif s[i+k]=='.':\r\n\t\t\tf = 1\r\n\t\t\ts[i+k]='1'\r\n\t\t\tbreak\r\n\t\telif s[i+k]=='1':\r\n\t\t\tf = 1\r\n\t\t\tbreak\r\n\telif s[i]=='1':\r\n\t\tif s[i+k]=='.':\r\n\t\t\tf = 1\r\n\t\t\ts[i+k]='0'\r\n\t\t\tbreak\r\n\t\telif s[i+k]=='0':\r\n\t\t\tf = 1\r\n\t\t\tbreak\r\n\t\r\n\r\n#print(*s)\r\nfor i in range(n):\r\n\tif s[i]=='.':\r\n\t\ts[i] = '0'\r\n#print(*s)\r\na = \"\"\r\nfor i in s:\r\n\ta = a + str(i)\r\nif f:\r\n\tprint(a)\r\nelse:\r\n\tprint(\"No\")\t\r\n\t\t\t", "import sys\r\nn,p=map(int,input().split())\r\ns=input()\r\nfor i in range(len(s)):\r\n if i+p<n:\r\n if s[i]!=s[i+p] or s[i]=='.':\r\n r=s.replace('.','0')\r\n r=list(r)\r\n if s[i]=='.' and s[i+p]=='.':\r\n r[i]='1'\r\n r[i+p]='0'\r\n elif s[i]=='.':\r\n r[i]=str(int(not int(s[i+p])))\r\n elif s[i+p]=='.':\r\n r[i+p]=str(int(not int(s[i])))\r\n print(''.join(r))\r\n sys.exit()\r\nprint('No')\r\n", "n, p = map(int, input().split())\r\ns = str(input())\r\na = list(s)\r\nfor i in range(n - p):\r\n if (s[i] != s[i + p]) or ((s[i] == s[i + p]) and (s[i] == '.')):\r\n if (s[i] == s[i + p]) and (s[i] == '.'):\r\n a[i] = '1'\r\n a[i+p] = '0'\r\n else:\r\n if s[i] == '.':\r\n a[i] = chr(49 - ord(s[i+p]) + 48)\r\n if s[i+p] == '.':\r\n a[i+p] = chr(49 - ord(s[i]) + 48)\r\n for i in range(n):\r\n if a[i] == '.':\r\n a[i] = '0'\r\n print(''.join(a))\r\n exit()\r\nprint('No')\r\n", "n, p = [int(i) for i in input().split()]\r\ns = list(input())\r\nk = 0\r\nfor index in range(n - p):\r\n if k != 0:\r\n break\r\n if s[index] == s[index + p] and s[index] == \".\":\r\n s[index] = str(0)\r\n s[index + p] = str(1)\r\n k += 1\r\n elif s[index] != s[index + p] and s[index] != \".\" and s[index + p] != \".\":\r\n k += 1\r\n elif s[index] != s[index + p] and (s[index] == \".\" or s[index + p] == \".\"):\r\n if s[index] == \".\":\r\n s[index] = str(int(not int(s[index + p])))\r\n else:\r\n s[index + p] = str(int(not int(s[index])))\r\n k += 1\r\ns = \"\".join(s)\r\nprint(\"No\" if k == 0 else s.replace(\".\", str(0)))", "n,m=map(int,input().split())\ns=list(input())\nl=len(s)\nf=False\nfor i in range(l-m):\n\tif not((s[i]==s[i+m]) and ((s[i]!=\".\") and (s[i+m]!=\".\"))):\n\t\tf=True\n\t\tif s[i]==\".\":\n\t\t\tif s[i+m]==\"1\":\n\t\t\t\ts[i]=\"0\"\n\t\t\telse:\n\t\t\t\ts[i]=\"1\"\n\t\tif s[i+m]==\".\":\n\t\t\tif s[i]==\"0\":\n\t\t\t\ts[i+m]=\"1\"\n\t\t\telse:\n\t\t\t\ts[i+m]=\"0\"\n\t\nif f==False:\n\tprint(\"No\")\n\tquit()\nfor i in range(len(s)):\n\tif s[i]=='.':\n\t\ts[i]='0'\nprint(\"\".join(s))", "def read_nums():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef main():\r\n n, p = read_nums()\r\n s = list(input())\r\n for i in range(n - p):\r\n one, two = s[i], s[i + p]\r\n if (one, two) == ('.', '.'):\r\n s[i] = '1'\r\n s[i + p] = '0'\r\n print(''.join(s).replace('.', '0'))\r\n return\r\n\r\n if one != two:\r\n if (one, two) == ('.', '0'):\r\n s[i] = '1'\r\n elif (one, two) == ('.', '1'):\r\n s[i] = '0'\r\n elif (one, two) == ('0', '.'):\r\n s[i + p] = '1'\r\n elif (one, two) == ('1', '.'):\r\n s[i + p] = '0'\r\n print(''.join(s).replace('.', '0'))\r\n return\r\n print('No')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, p = map(int, input().split())\r\ns = list(str(input()))\r\nisPossible = False\r\nfor i in range(0, n-p):\r\n if s[i] == \".\":\r\n if s[i+p] == \"1\":\r\n s[i] = \"0\"\r\n elif s[i+p] == \"0\":\r\n s[i] = \"1\"\r\n else:\r\n s[i] = \"1\"\r\n s[i+p] = \"0\"\r\n isPossible=True\r\n break\r\n elif s[i+p] == \".\":\r\n if s[i] == \"1\":\r\n s[i+p] = \"0\"\r\n elif s[i] == \"0\":\r\n s[i+p] = \"1\"\r\n else:\r\n print(\"Whoops! Error #1 occured!\")\r\n isPossible=True\r\n break\r\n elif s[i] != s[i+p]:\r\n isPossible=True\r\n break\r\nif isPossible:\r\n for j in range(0,n):\r\n if s[j] == \".\":\r\n s[j] = \"0\"\r\n print(''.join(s))\r\nelse:\r\n print(\"No\")\r\n", "n,p=map(int,input().split())\r\ns=input()\r\nt=s.replace('.','0')\r\nif any(t[i]!=t[i+p] for i in range(n-p)) :\r\n print(t)\r\n exit()\r\nelse :\r\n x=s.find('.')\r\n if x+p<n :\r\n print(t[:x]+'1'+t[x+1:])\r\n exit()\r\n x=s.rfind('.')\r\n if x-p>=0 :\r\n print(t[:x]+'1'+t[x+1:])\r\n exit()\r\nprint('No')", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 11.06.2018 19:02 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n n, p = map(int, input().split())\r\n s = list(input())\r\n ind = []\r\n f = 1\r\n for i in range(len(s)-p):\r\n if s[i] == s[i+p] and s[i] == \".\":\r\n s[i] = \"0\"\r\n s[i+p] = \"1\"\r\n f = 0\r\n break\r\n elif s[i] != s[i+p]:\r\n if s[i] == \".\":\r\n if s[i+p] == \"0\":\r\n s[i] = \"1\"\r\n else:\r\n s[i] = \"0\"\r\n elif s[i+p] == \".\":\r\n if s[i] == \"0\":\r\n s[i+p] = \"1\"\r\n else:\r\n s[i+p] = \"0\"\r\n f = 0\r\n break\r\n if f: print(\"No\")\r\n else:\r\n for i in range(len(s)):\r\n if s[i] == \".\": s[i] = \"0\"\r\n print(\"\".join(s))\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "tc=list(map(int, input().rstrip().split()))\r\nn=tc[0]\r\np=tc[1]\r\ns=input()\r\nar=[]\r\nfor i in range(n):\r\n ar.append(s[i])\r\nflg=0\r\nfor i in range(n-p):\r\n if(ar[i]==ar[i+p] and ar[i]!='.'):\r\n flg=0\r\n elif(ar[i]==ar[i+p]=='.'):\r\n ar[i]='1'\r\n ar[i+p]='0'\r\n flg=1\r\n break\r\n else:\r\n flg=1\r\n if(ar[i]=='.'):\r\n ar[i]=str(abs(int(ar[i+p])-1))\r\n break\r\n elif(ar[i+p]=='.'):\r\n ar[i+p]=str(abs(int(ar[i])-1))\r\n break\r\nfor i in range(n):\r\n if(ar[i]=='.'):\r\n ar[i]='0'\r\nif(flg==0):\r\n print('NO')\r\nelse:\r\n for i in range(n):\r\n print(ar[i],end=\"\")", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\nn,p=map(int,sys.stdin.readline().split())\r\ns=list(sys.stdin.readline()[:-1])\r\nl,r=0,p\r\nansl,ansr=-1,-1\r\nwhile r<n:\r\n if s[l]=='.' and s[r]=='.':\r\n s[l]='0'\r\n s[r]='1'\r\n ansl,ansr=l,r\r\n break\r\n elif s[l]=='.' and s[r]=='0':\r\n s[l]='1'\r\n ansl,ansr=l,r\r\n break\r\n elif s[l]=='.' and s[r]=='1':\r\n s[l]='0'\r\n ansl,ansr=l,r\r\n break\r\n elif s[l]=='1' and s[r]=='.':\r\n s[r]='0'\r\n ansl,ansr=l,r\r\n break\r\n elif s[l]=='0' and s[r]=='.':\r\n s[r]='1'\r\n ansl,ansr=l,r\r\n break\r\n elif int(s[l])^int(s[r])==1:\r\n ansl,ansr=l,r\r\n break\r\n r+=1\r\n l+=1\r\nfor i in range(ansl):\r\n if s[i]=='.':\r\n s[i]='0'\r\nfor i in range(ansl+1,ansr):\r\n if s[i]=='.':\r\n s[i]='0'\r\nfor i in range(ansr+1,n):\r\n if s[i]=='.':\r\n s[i]='0'\r\nif ansl==ansr==-1:\r\n print('No')\r\n sys.exit()\r\nelse:\r\n print(''.join(x for x in s))\r\n \r\n", "import sys\n\nn, p = map(int, sys.stdin.readline().split())\ns = list(sys.stdin.readline().strip())\n\nfor i in range(p):\n l = [s[j] for j in range(i, n, p)]\n if '0' in l and '1' in l:\n print(''.join(s).replace('.', '0'))\n sys.exit(0)\n elif set(l) == set(['.']) and len(l) >= 2:\n s[i] = '0'\n s[i + p] = '1'\n print(''.join(s).replace('.', '0'))\n sys.exit(0)\n elif len(set(l)) == 2:\n if '0' in l:\n print(''.join(s).replace('.', '1'))\n else:\n print(''.join(s).replace('.', '0'))\n sys.exit(0)\n\nprint('No')\n", "def main():\n N, P = map(int, input().split())\n S = list(input())\n\n ans = 'No'\n for i in range(N - P):\n if S[i] == '.' and S[i+P] == '.':\n S[i], S[i+P] = '0', '1'\n ans = 'Yes'\n elif S[i] != S[i+P]:\n ans = 'Yes'\n if S[i] == '.':\n S[i] = str(int(not int(S[i+P])))\n elif S[i+P] == '.':\n S[i+P] = str(int(not int(S[i])))\n if ans == 'Yes':\n print(''.join(S).replace('.', '0'))\n else:\n print(ans)\n\nmain()\n", "import sys\r\nn, p = map(int, sys.stdin.readline().split())\r\ns = sys.stdin.readline().strip()\r\nres = 'No'\r\ncnt = dict()\r\nfor start in range (p):\r\n cnt['0'] = 0\r\n cnt['1'] = 0\r\n cnt['.'] = 0\r\n id1 = -1\r\n id2 = -1\r\n for i in range (start, n, p):\r\n cnt[s[i]] += 1\r\n if s[i] == '.':\r\n if id1 == -1:\r\n id1 = i\r\n else:\r\n id2 = i\r\n if cnt['0'] > 0 and (cnt['1'] + cnt['.'])> 0:\r\n res = s.replace('.', '1')\r\n break \r\n if cnt['1'] > 0 and (cnt['0'] + cnt['.'])> 0:\r\n res = s.replace('.', '0')\r\n break \r\n if cnt['.'] > 1:\r\n res = s[:id1]+ '0' + s[id1+1:id2] + '1' + s[id2+1:]\r\n res = res.replace('.','0')\r\n break\r\n \r\nprint(res)\r\n", "a=[int(i) for i in input().split()]\r\nn=a[0]\r\np=a[1]\r\ns=str(input())\r\nflag=0\r\nfor i in range(len(s)):\r\n\tif(i+p<len(s)):\r\n\t\tif(s[i]!='.' and s[i+p]!='.'):\r\n\t\t\tif s[i]!=s[i+p]:\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\telif(s[i]=='.' and s[i+p]!='.'):\r\n\t\t\tflag=1\r\n\t\t\tif(s[i+p]=='1'):\r\n\t\t\t\ts=s[:i]+'0'+s[i+1:]\r\n\t\t\telse:\r\n\t\t\t\ts=s[:i]+'1'+s[i+1:]\r\n\t\t\tbreak\r\n\t\telif(s[i]!='.' and s[i+p]=='.'):\r\n\t\t\tflag=1\r\n\t\t\tif(s[i]=='1'):\r\n\t\t\t\ts=s[:i+p]+'0'+s[i+1+p:]\r\n\t\t\telse:\r\n\t\t\t\ts=s[:i+p]+'1'+s[i+1+p:]\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tflag=1\r\n\t\t\ts=s[:i]+'1'+s[i+1:]\r\n\t\t\ts=s[:i+p]+'0'+s[i+1+p:]\r\n\t\t\tbreak\r\n\r\nif(flag==0):\r\n\tprint(\"No\")\r\nelse:\r\n\tfor i in range(len(s)):\r\n\t\tif(s[i]=='.'):\r\n\t\t\ts=s[:i]+'0'+s[i+1:]\t\r\n\tprint(s)", "a,b=map(int,input().split())\r\nz=\"$\"+input()\r\nz=z.replace(\"\",\" \").split()\r\nfor i in range(1,a-b+1):\r\n if z[i]==z[i+b]==\".\":z[i]=\"1\";z[i+b]=\"0\";exit(print(\"\".join(z[1:]).replace(\".\",\"0\")))\r\n elif z[i] in \"01\" and z[i+b] in \"01\" and z[i]!=z[i+b]:exit(print(\"\".join(z[1:]).replace(\".\",\"1\")))\r\n elif z[i]=='.' and z[i+b]=='0' or z[i]=='0' and z[i+b]=='.':exit(print(\"\".join(z[1:]).replace(\".\",\"1\")))\r\n elif z[i] == '.' and z[i + b] == '1' or z[i] == '1' and z[i + b] == '.':\r\n exit(print(\"\".join(z[1:]).replace(\".\", \"0\")))\r\nprint(\"No\")", "import math\r\nimport sys\r\nimport queue\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, p = map(int, input().split())\r\n s = list(str(input()))\r\n\r\n flag = False\r\n for i in range(n - p):\r\n if s[i] != \".\":\r\n if s[i + p] == \".\":\r\n s[i + p] = str(1 - int(s[i]))\r\n flag = True\r\n else:\r\n if s[i] != s[i + p]:\r\n flag = True\r\n else:\r\n if s[i + p] != \".\":\r\n s[i] = str(1 - int(s[i + p]))\r\n else:\r\n s[i], s[i + p] = \"1\", \"0\"\r\n flag = True\r\n\r\n if flag:\r\n for i in range(n):\r\n if s[i] == \".\":\r\n print(\"1\", end=\"\")\r\n else:\r\n print(s[i], end=\"\")\r\n else:\r\n print(\"No\")\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(input())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n, p = map(int, input().split())\r\ns = str(input())\r\nt = [0]*n\r\nfor i in range(n):\r\n if s[i] != '.':\r\n t[i] = s[i]\r\n else:\r\n if i-p >= 0:\r\n t[i] = str(1-int(t[i-p]))\r\n else:\r\n if i+p <= n-1:\r\n if s[i+p] != '.':\r\n t[i] = str(1-int(s[i+p]))\r\n else:\r\n t[i] = '0'\r\n else:\r\n t[i] = '0'\r\n#print(t)\r\nflag = False\r\nfor i in range(n-p):\r\n if t[i] != t[i+p]:\r\n flag = True\r\nif flag:\r\n print(''.join(t))\r\nelse:\r\n print('No')\r\n", "n,p=map(int,input().split())\r\ns=list(input())\r\nflag=False\r\nfor i in range(n):\r\n if s[i]=='.':\r\n s[i]='0'\r\n if (i-p>=0 and s[i-p]=='0') or (i+p<n and s[i+p]=='0'): s[i]='1'\r\n if i+p<n and s[i+p]!=s[i]: flag=True\r\nprint(\"\".join(s)) if flag else print(\"No\")\r\n\r\n", "n, p = map(int, input().split())\r\ns = list(input())\r\nfor i in range(n - p):\r\n if s[i] != '.' and s[i + p] != '.' and s[i] == s[i + p]:\r\n pass\r\n elif s[i] != '.' and s[i + p] == '.':\r\n s[i + p] = '0' if s[i] == '1' else '1'\r\n elif s[i] == '.' and s[i + p] != '.':\r\n s[i] = '0' if s[i + p] == '1' else '1'\r\n else:\r\n j = i\r\n while j < n and s[j] == '.':\r\n j += p\r\n if j >= n:\r\n j = i + p\r\n s[i] = '1'\r\n while j < n:\r\n s[j] = '0' if s[j - p] == '1' else '1'\r\n j += p\r\n else:\r\n while i + p <= j:\r\n s[j - p] = '0' if s[j] == '1' else '1'\r\n j -= p\r\nfor i in range(n):\r\n if s[i] == '.':\r\n s[i] = '1'\r\nans = False\r\nfor i in range(n - p):\r\n if s[i] != s[i + p]:\r\n ans = True\r\n break\r\nprint(''.join(s) if ans else \"No\")\r\n", "t=int(input().split()[1])\n\n\nk=list(input())\n# tide\ni=next((i for i,(x,y)in enumerate(zip(k,k[t:]))if not x==y!='.'),-1)\n\nif i<0:print('No')\nelse:\n#reverse\n if k[i]=='.':k[i]='01'[k[i+t]in'.0']\n if k[i+t]=='.':k[i+t]='01'[k[i]=='0']\n\n# a tideof reverse\n print(''.join(k).replace('.','0'))\n\t \t\t\t\t \t\t\t \t \t\t\t\t\t \t\t\t \t \t\t", "n, m = map(int, input().split())\nl, r = list(input()), 'No'\nfor i in range(min(m, n - m)):\n d = {'0': 0, '1': 0, '.': 0}\n for j in range(i, n, m):\n d[l[j]] += 1\n z, o, p = (d[c] for c in '01.')\n if not (p or z and o):\n continue\n r = l\n if z and o:\n break\n t = ['0', '1'] if p > 1 else ['01'[not o]]\n while t:\n if l[i] == '.':\n l[i] = t.pop()\n i += m\n break\nprint(''.join(r).replace('.', '0'))", "n, p = map(int, input().split())\r\ns = input()\r\n\r\ni = 0\r\nflag = 0\r\nwhile i < len(s)-p:\r\n if s[i] != s[i+p] or s[i]==s[i+p]=='.':\r\n flag = 1\r\n if s[i] == s[i+p]:\r\n s = s[:i]+'0'+s[i+1:i+p]+'1'+s[i+p+1:]\r\n elif s[i] == '.':\r\n if s[i+p] == '1':\r\n s = s[:i]+'0'+s[i+1:]\r\n else:\r\n s = s[:i]+'1'+s[i+1:]\r\n elif s[i+p] == '.':\r\n if s[i] == '1':\r\n s = s[:i+p]+'0'+s[i+p+1:]\r\n else:\r\n s = s[:i+p]+'1'+s[i+p+1:]\r\n i += 1\r\n while i < len(s):\r\n if s[i] == '.':\r\n s = s[:i]+'0'+s[i+1:]\r\n i += 1\r\n i += 1\r\n \r\nif flag == 1:\r\n print(s)\r\nelse:\r\n print(\"No\")", "n, p = map(int, input().split())\r\ns = input()\r\nflag = 0\r\nfor i in range(len(s) - p):\r\n if flag == 1:\r\n break\r\n for j in range(i + p, len(s), p):\r\n if s[i] == '.' and s[j] == '.':\r\n s = s[:i] + '0' + s[i + 1:]\r\n s = s[:j] + '1' + s[j + 1:]\r\n flag =1\r\n # print('a', i, j)\r\n break\r\n elif s[i] != '.' and s[j] != '.' and s[i] != s[j]:\r\n flag = 1\r\n # print('b')\r\n break\r\n elif s[i] == '.' and s[j] != '.':\r\n ch = (1 + int(s[j])) % 2\r\n s = s[:i] + str(ch) + s[i + 1:]\r\n flag = 1\r\n # print('c')\r\n break\r\n elif s[i] != '' and s[j] == '.':\r\n ch = (1 + int(s[i])) % 2\r\n s = s[:j] + str(ch) + s[j + 1:]\r\n flag = 1\r\n #print('d')\r\n break\r\n#print(s)\r\n\r\nif flag == 0:\r\n print('No')\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] == '.':\r\n s = s[:i] + '1' + s[i + 1:]\r\n print(s)", "\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nstr1=input()\r\n\r\nd=n-m\r\nstr2=['-1']*n\r\nc=0\r\nfor i in range(d):\r\n\tif str1[i]=='.' and str1[i+m]!='.':\r\n\t\tif str1[i+m]=='1':\r\n\t\t\tstr2[i]='0'\r\n\t\t\tstr2[i+m]='1'\r\n\t\telse:\r\n\t\t\tstr2[i]='1'\r\n\t\t\tstr2[i+m]='0'\r\n\telif str1[i]!='.' and str1[i+m]=='.':\r\n\t\tif str1[i]=='1':\r\n\t\t\tstr2[i]='1'\r\n\t\t\tstr2[i+m]='0'\r\n\t\telse:\r\n\t\t\tstr2[i]='0'\r\n\t\t\tstr2[i+m]='1'\r\n\telif str1[i]!='.' and str1[i+m]!='.':\r\n\t\tif(str1[i]==str1[i+m]):\r\n\t\t\tc+=1\r\n\t\tstr2[i]=str1[i]\r\n\t\tstr2[i+m]=str1[i+m]\r\n\telse:\r\n\t\tstr2[i]='1'\r\n\t\tstr2[i+m]='0'\r\nif(c==d):\r\n\tprint(\"No\")\r\n\texit()\r\nfor i in range(d,m):\r\n\tif str1[i]=='.':\r\n\t\tstr2[i]='1'\r\n\telse:\r\n\t\tstr2[i]=str1[i]\r\nfor i in str2:\r\n\tprint(i,end=\"\")\r\n\t\t \r\n", "n, p = map(int, input().split(' '))\ns = input()\n\nres = True\n\ndef op(c):\n return '1' if c == '0' else '0'\n\ndef out(s):\n print(s.replace('.', '0'))\n exit(0)\n\nfor i in range(n - p):\n j = i + p\n if s[i] == s[j] == '.':\n out(s[0:i] + '1' + s[i+1:j] + '0' + s[j+1:])\n if s[i] == '.':\n out(s[0:i] + op(s[j]) + s[i+1:])\n if s[j] == '.':\n out(s[0:j] + op(s[i]) + s[j+1:])\n if s[i] != s[j]:\n out(s)\n \nprint('No')", "k=input().strip().split(\" \");\r\nn=int(k[0]);\r\np=int(k[1]);\r\nl=[i for i in input()];\r\n\r\n\r\ni=0;\r\nj=i+p;\r\nans=1;\r\nwhile(i<n and j<n):\r\n if(l[i]=='0' and l[j]=='0'):\r\n w=2;\r\n elif(l[i]=='1' and l[j]=='1'):\r\n s=0;\r\n else:\r\n ans=0;\r\n break;\r\n i+=1;\r\n j+=1;\r\n\r\nif(ans==1):\r\n\tprint('No');\r\nelse:\r\n if(l[i]=='.' and l[j]=='1'):\r\n l[i]='0';\r\n elif(l[j]=='.' and l[i]=='1'):\r\n l[j]='0';\r\n elif(l[i]=='.' and l[j]=='0'):\r\n l[i]='1';\r\n elif(l[j]=='.' and l[i]=='0'): \r\n l[j]='1';\r\n elif(l[i]=='.' and l[j]=='.'): \r\n l[i]='0';\r\n l[j]='1';\r\n for k in range(len(l)):\r\n if(l[k]=='.'):\r\n l[k]='0';\r\n print(l[k],end='');\t\r\n \t", "n,p=map(int,input().split())\r\ns=list(input())\r\nans=False\r\nfor i in range(n-p):\r\n if(s[i]!=s[i+p] or s[i]=='.'):\r\n ans=True\r\nif ans==False:\r\n print(\"No\")\r\n exit()\r\nfor i in range(n-p):\r\n if (s[i]=='.' or s[i+p]=='.'):\r\n if s[i]==s[i+p]:\r\n s[i]='1'\r\n s[i+p]='0'\r\n if s[i]=='.':\r\n if s[i+p]=='1':\r\n s[i]='0'\r\n else:\r\n s[i]='1'\r\n else:\r\n if s[i]=='1':\r\n s[i+p]='0'\r\n else:\r\n s[i+p]='1'\r\nfor i in range(n):\r\n if s[i]=='.':\r\n s[i]='1'\r\nprint(''.join(s))", "n, p = map(int, input().strip().split())\r\ns = list(input())\r\n \r\ndef get(x):\r\n return '0' if x == '1' else '1'\r\n \r\nfor i in range(n - p):\r\n if s[i] == '.' and s[i + p] != '.':\r\n s[i] = get(s[i + p])\r\n elif s[i] != '.' and s[i + p] == '.':\r\n s[i + p] = get(s[i])\r\n elif s[i] == '.' and s[i + p] == '.':\r\n s[i] = '0'\r\n s[i + p] = '1'\r\nfor i in range(n):\r\n if s[i] == '.':\r\n s[i] = '0'\r\nfor i in range(n - p):\r\n if s[i] != s[i + p]:\r\n print(''.join(map(str, s)))\r\n exit(0)\r\nprint('No')", "n, p = map(int, input().split())\r\n*A, = input()\r\nd = 0\r\nB = {\"0\":\"1\", \"1\":\"0\"}\r\nfor i in range(p):\r\n *Z, = A[i::p]\r\n for j in range(len(Z)):\r\n if Z[j] != \".\":\r\n break\r\n if Z[j] == \".\":\r\n Z[j] = \"0\"\r\n r = 0\r\n for k in range(len(Z)):\r\n if j != k:\r\n if Z[k] == \".\" or Z[k] != Z[j]:\r\n Z[k] = B[Z[j]]\r\n r = 1\r\n else:\r\n Z[k] = Z[j]\r\n if len(Z) != 1:\r\n d += r\r\n A[i::p] = Z\r\nif d:\r\n print(\"\".join(A))\r\nelse:\r\n print(\"No\")\r\n", "n, p = map(int, input().split())\r\ns = list(input())\r\n\r\nok = False\r\nfor i in range(0, n - p):\r\n if s[i] == '.' and s[i + p] == '.':\r\n s[i] = '1'\r\n s[i + p] = '0'\r\n\r\n if s[i] == '.':\r\n s[i] = str(1 - int(s[i + p]))\r\n\r\n if s[i + p] == '.':\r\n s[i + p] = str(1 - int(s[i]))\r\n\r\n if s[i] != s[i + p]:\r\n ok = True\r\n\r\nprint(''.join(s).replace('.', '1') if ok else 'No')\r\n", "str1 = list(map(int,input().split()))\r\nn = str1[0]\r\np = str1[1]\r\ns = input()\r\ncor = dict()\r\nflag = False\r\nfor i in range(n - p):\r\n if s[i] != '.' and s[i+p] != '.':\r\n if s[i] == s[i+p]:\r\n continue\r\n else:\r\n flag = True\r\n break\r\n elif s[i] == '.' and s[i+p] != '.':\r\n cor[i] = str(((int)(s[i+p]) + 1) % 2)\r\n flag = True\r\n break\r\n elif s[i] != '.' and s[i+p] == '.':\r\n cor[i+p] = str(((int)(s[i]) + 1) % 2)\r\n flag = True\r\n break\r\n elif s[i] == '.' and s[i+p] == '.':\r\n cor[i] = '0'\r\n cor[i+p] = '1'\r\n flag = True\r\n break\r\nans = []\r\nif flag:\r\n for i in range(n):\r\n if s[i] != '.':\r\n ans.append(s[i])\r\n elif cor.get(i,'-1') != '-1':\r\n ans.append(cor.get(i))\r\n else:\r\n ans.append('0')\r\n print (''.join(ans))\r\nelse:\r\n print ('No')\r\n", "n,m=[int(i) for i in input().split()]\r\ns=str(input())\r\ne=0\r\nfor i in range(0,len(s)-m):\r\n if(s[i]==s[i+m]):\r\n if(s[i]!='.'):\r\n e=e+1\r\nif(e==(n-m)):\r\n print('NO')\r\nelse:\r\n s=list(s)\r\n for j in range(0,len(s)-m):\r\n if(s[j]==s[j+m]):\r\n if(s[j]=='.'):\r\n s[j]='1'\r\n s[j+m]='0'\r\n else:\r\n pass\r\n else:\r\n if(s[j]=='.'):\r\n if(s[j+m]=='1'):\r\n s[j]='0'\r\n else:\r\n s[j]='1'\r\n elif(s[j+m]=='.'):\r\n if(s[j]=='1'):\r\n s[j+m]='0'\r\n else:\r\n s[j+m]='1'\r\n else:\r\n pass\r\n for j in range(0,len(s)):\r\n if(s[j]=='.'):\r\n s[j]='1'\r\n print(''.join(s))", "from sys import stdin,stdout\r\nimport math\r\nfrom collections import Counter\r\n \r\n# stdin = open(\"input.txt\", \"r\");\r\n# stdout = open(\"output.txt\", \"w\");\r\n \r\n \r\nn,p=stdin.readline().strip().split(' ')\r\nn,p=int(n),int(p)\r\ns=stdin.readline().strip()\r\n \r\n \r\narr=[[] for i in range(p)]\r\nfor i in range(n):\r\n\tarr[i%p].append(s[i])\r\n \r\ndctr=[None for i in range(p)]\r\n \r\nfor i in range(p):\r\n\tdctr[i]=Counter(arr[i])\r\n \r\nhave_option=[True for i in range(p)]\r\n \r\n \r\nfor i in range(p):\r\n\tif len(dctr[i])==1 and (('1' in dctr[i] or '0' in dctr[i]) or ('.' in dctr[i] and dctr[i]['.']==1)):\r\n\t\thave_option[i]=False\r\n \r\n \r\nif True in have_option:\r\n\tfor i in range(p):\r\n\t\tif have_option[i]==False:\r\n\t\t\tfor x in range(len(arr[i])):\r\n\t\t\t\tif arr[i][x]=='.':\r\n\t\t\t\t\tarr[i][x]='0'\r\n \r\n\t\telse:\r\n\t\t\tif '1' in dctr[i]:\r\n\t\t\t\tfor x in range(len(arr[i])):\r\n\t\t\t\t\tif arr[i][x]=='.':\r\n\t\t\t\t\t\tarr[i][x]='0'\r\n\t\t\telif '0' in dctr[i]:\r\n\t\t\t\tfor x in range(len(arr[i])):\r\n\t\t\t\t\tif arr[i][x]=='.':\r\n\t\t\t\t\t\tarr[i][x]='1'\r\n\t\t\telse:\r\n\t\t\t\tfor x in range(len(arr[i])):\r\n\t\t\t\t\tif arr[i][x]=='.':\r\n\t\t\t\t\t\tarr[i][x]='0'\r\n\t\t\t\tarr[i][0]='1'\r\n \r\n\tans=\"\"\r\n\tmaxlen=max([len(arr[i]) for i in range(p)])\r\n\t# for i in range(p):\r\n\t# \tprint(arr[i])\r\n\t# \tprint(have_option[i])\r\n \r\n\t# print(maxlen)\r\n\tfor i in range(maxlen):\r\n\t\tfor j in range(p):\r\n\t\t\tif len(arr[j])>i:\r\n\t\t\t\tans+=arr[j][i]\r\n\tstdout.write(ans+\"\\n\")\r\nelse:\r\n\tstdout.write(\"No\\n\");", "def joinalist(ns):\n s = \"\".join(ns)\n return s\n\ndef properize(s,n):\n ns = list(s)\n for i in range(n):\n if(ns[i]=='.'): ns[i]='0'\n return joinalist(ns)\n\n\ndef isThere(s, n, p):\n ns = list(s)\n for i in range(p,n):\n a = ns[i-p]\n b = ns[i]\n if(b=='.'):\n if(a=='.'):\n ns[i-p]='1'\n ns[i]='0' \n return joinalist(ns)\n elif(a=='1'):\n ns[i]='0'\n return joinalist(ns)\n else:\n ns[i]='1'\n return joinalist(ns)\n elif(b=='0'):\n if(a=='.'):\n ns[i-p]='1'\n return joinalist(ns)\n elif(a=='0'):\n continue\n else:\n return joinalist(ns)\n else:\n if(a=='.'):\n ns[i-p]='0'\n return joinalist(ns)\n elif(a=='1'):\n continue\n else:\n return joinalist(ns)\n return 0\n\nn_p = input()\nnp = n_p.split(' ')\nn = int(np[0])\np = int(np[1])\n\ns = input()\n\nns = isThere(s,n,p)\n\nif(ns==0): print('No')\nelse:\n print(properize(ns,n))\n", "def ans(st):\r\n str='';\r\n for i in st:\r\n if i=='.':\r\n str=str+'0'\r\n else:\r\n str=str+i;\r\n print(str)\r\n exit(0)\r\n \r\nst=input();\r\na=st.split(' ')\r\nn=int(a[0])\r\np=int(a[1])\r\na.clear()\r\nstt=input();\r\ni=0\r\nj=p\r\nst = list(stt)\r\nwhile j<len(st):\r\n if st[i]!=st[j]:\r\n if st[i]=='0':\r\n st[j]='1'\r\n elif st[i]=='1':\r\n st[j]='0'\r\n elif st[j]=='0':\r\n st[i]='1'\r\n elif st[j]=='1':\r\n st[i]='0'\r\n else: \r\n exit(2)\r\n ans(st)\r\n if st[i]=='.' and st[j]=='.':\r\n st[i]='0'\r\n st[j]='1'\r\n ans(st)\r\n j=j+1\r\n i=i+1\r\nprint('No')\r\nexit(0)\r\n \r\n ", "n, p = map(int, input().split())\r\ns = list(input())\r\nL = len(s)\r\nfor i in range(L-p) :\r\n if s[i] == s[i+p] and s[i] != '.' :\r\n continue\r\n\r\n if s[i] == '.' :\r\n if s[i+p] == '.' :\r\n s[i] = '0'\r\n s[i+p] = '1'\r\n elif s[i+p] == '0' :\r\n s[i] = '1'\r\n else :\r\n s[i] = '0'\r\n elif s[i] == '0' and s[i+p] == '.' :\r\n s[i+p] = '1'\r\n elif s[i] == '1' and s[i+p] == '.' :\r\n s[i+p] = '0'\r\n\r\n break\r\nelse :\r\n print('NO')\r\n exit()\r\n\r\nfor i in range(L) :\r\n if s[i] == '.' :\r\n s[i] = '0'\r\n\r\nprint(''.join(s))", "def solve():\r\n\tN, P = map(int, input().split())\r\n\tS = list(input())\r\n\tres = False\r\n\tfor n in range(N):\r\n\t\tif S[n] == '.':\r\n\t\t\tS[n] = '0'\r\n\t\t\tif (n - P >= 0 and S[n - P] == '0') or (n + P < N and S[n + P] == '0'): S[n] = '1'\r\n\t\tif n - P >= 0 and S[n - P] != S[n]: res = True\r\n\treturn ''.join(S) if res else 'No'\r\nprint (solve())", "IN = input().split()\nW = input()\nn = int(IN[0])\np = int(IN[1])\n\nS = [0] * n\n\nans = 0\n\nfor i in range (0, n) :\n if(W[i] == '.') :\n S[i] = -1\n else :\n S[i] = int(W[i])\n\n\nfor i in range (0, n - p) :\n if(S[i] == -1) :\n ans = 1\n if(S[i + p] == -1) : \n S[i] = 0\n S[i + p] = 1\n elif(S[i + p] == 1) :\n S[i] = 0\n else :\n S[i] = 1\n break\n elif(S[i] != S[i + p]):\n ans = 1\n if(S[i] == 1) :\n S[i + p] = 0\n else :\n S[i + p] = 1\n break\n\nif(ans == 0) :\n print(\"No\")\nelse :\n for i in range (0, n):\n if(S[i] == -1):\n S[i] = 1\n print (S[i], end=\"\")\n \n \n \n", "def process(S, p):\r\n n = len(S)\r\n d = [[[], [], []] for i in range(p)]\r\n answer = [S[i] for i in range(n)]\r\n for i in range(n):\r\n i1 = i % p\r\n if S[i]=='0':\r\n j = 0\r\n elif S[i]=='1':\r\n j = 1\r\n else:\r\n j = 2\r\n d[i1][j].append(i)\r\n works = False\r\n for i in range(p):\r\n zero, one, dot = d[i]\r\n # print(i, zero, one, dot)\r\n if len(zero) > 0 and len(one) > 0:\r\n works = True\r\n for i2 in dot:\r\n answer[i2] = '0'\r\n elif len(zero) > 0 and len(dot) > 0:\r\n works = True\r\n for i2 in dot:\r\n answer[i2] = '1'\r\n elif len(one) > 0 and len(dot) > 0:\r\n works = True\r\n for i2 in dot:\r\n answer[i2] = '0'\r\n elif len(dot) > 1:\r\n works = True\r\n I = 0\r\n for i2 in dot:\r\n answer[i2] = str(I % 2)\r\n I+=1\r\n else:\r\n for i2 in dot:\r\n answer[i2] = '0'\r\n if not works:\r\n print('No')\r\n else:\r\n print(''.join(answer))\r\n\r\nn, p = [int(x) for x in input().split()]\r\nS = input()\r\nprocess(S, p)", "a=[int(q) for q in input().strip().split()]\r\nb=list(input())\r\nt=0\r\nfor k in range(a[0]-a[1]):\r\n if (b[k]==b[k+a[1]]) and (b[k]=='1' or b[k]=='0'):\r\n t+=1\r\n elif (b[k]==b[k+a[1]]) and (b[k]=='.'):\r\n b[k]='0'\r\n b[k+a[1]]='1'\r\n elif b[k]=='.':\r\n if b[k+a[1]]=='1':\r\n b[k]='0'\r\n else:\r\n b[k]='1'\r\n elif b[k+a[1]]=='.':\r\n if b[k]=='1':\r\n b[k+a[1]]='0'\r\n else:\r\n b[k+a[1]]='1'\r\nif t==a[0]-a[1]:\r\n print('No')\r\nelse:\r\n for k in range(len(b)):\r\n if b[k]=='.':\r\n b[k]='1'\r\n print(''.join(b))", "n,p=map(int,input().split())\r\ns=list(map(str,input().strip()))\r\n#print(s)\r\nf=1\r\nfor i in range(n-p):\r\n\tif s[i]!='.' and s[i+p]!='.' and s[i]==s[i+p]:\r\n\t\tcontinue\r\n\telse:\r\n\t\tf=0\r\n\t\tbreak\r\nif f==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tfor i in range(n-p):\r\n\t\tif s[i]=='.' and s[i+p]=='.':\r\n\t\t\ts[i]='0'\r\n\t\t\ts[i+p]='1'\r\n\t\telif s[i]=='.':\r\n\t\t\tif s[i+p]=='1':\r\n\t\t\t\ts[i]='0'\r\n\t\t\telse:\r\n\t\t\t\ts[i]='1'\r\n\t\telif s[i+p]=='.':\r\n\t\t\tif s[i]=='1':\r\n\t\t\t\ts[i+p]='0'\r\n\t\t\telse:\r\n\t\t\t\ts[i+p]='1'\r\n\tfor i in range(n):\r\n\t\tif s[i]=='.':\r\n\t\t\ts[i]='0'\r\n\tprint(''.join(s))\r\n\r\n", "n, m = map(int, input().split())\r\ns = input()\r\nflag = 1\r\nfor i in range(1, m + 1):\r\n s1 = ''\r\n a, b, c = 0, 0, 0\r\n for j in range(-1 + i, n, m):\r\n if (s[j] == '.'):\r\n a += 1\r\n elif (s[j] == '0'):\r\n b += 1\r\n else:\r\n c += 1\r\n if not((a == 1 and b == 0 and c == 0)or(a == 0 and (b == 0 or c == 0))):\r\n flag = 0\r\n for j in range(-1 + i, n, m):\r\n if (s[j] == '.'):\r\n if (b == 0 and c == 0):\r\n s = s[:j] + '0' + s[j + 1:]\r\n b += 1\r\n elif (b != 0):\r\n s = s[:j] + '1' + s[j + 1:]\r\n else:\r\n s = s[:j] + '0' + s[j + 1:]\r\nif (flag == 1):\r\n print(\"NO\")\r\nelse:\r\n print(s)\r\n\r\n\r\n\r\n\r\n", "n, p = map(int, input().split())\r\nu = list(input())\r\ndef loop(k):\r\n global u\r\n for i in range(k, p + k):\r\n if i + p < n:\r\n if u[i] == '.':\r\n if u[i + p] == '.':\r\n u[i] = '0'\r\n u[i + p] = '1'\r\n elif u[i + p] == '0':\r\n u[i] = '1'\r\n else:\r\n u[i] = '0'\r\n return True\r\n elif u[i + p] == '.':\r\n if u[i] == '.':\r\n u[i] = '0'\r\n u[i + p] = '1'\r\n elif u[i] == '0':\r\n u[i + p] = '1'\r\n else:\r\n u[i + p] = '0'\r\n return True\r\n else:\r\n if u[i] != u[i + p]:\r\n return True\r\n return False\r\nok = False\r\nfor i in range(n // p):\r\n ok = loop(i * p)\r\n if ok:\r\n break\r\nif not ok:\r\n import sys\r\n print('No')\r\n sys.exit()\r\nfor i in u:\r\n if i == '.':\r\n print(0, end = '')\r\n else:\r\n print(i, end = '')\r\n", "n,p=map(int,input().split())\r\ns=input()\r\na=[]\r\nfor i in s:\r\n a+=[i]\r\nflag=0\r\nfor i in range(0,n-p):\r\n if a[i]==a[i+p] and a[i]!='.' and a[i+p]!='.':\r\n flag+=1\r\n elif a[i]=='.' and a[i+p]=='.':\r\n a[i]='0'\r\n a[i+p]='1'\r\n elif a[i]=='.':\r\n if a[i+p]=='0':\r\n a[i]='1'\r\n else:\r\n a[i]='0'\r\n elif a[i+p]=='.':\r\n if a[i]=='0':\r\n a[i+p]='1'\r\n else:\r\n a[i+p]='0'\r\nif flag==n-p:\r\n print(\"NO\")\r\nelse:\r\n for i in range(n):\r\n if a[i]=='.':\r\n a[i]='1'\r\n print(''.join(a))", "b,c=map(int,input().split())\r\na=input()\r\nd=[]\r\ne=0\r\nf=0\r\nfor i in range(b-c):\r\n if((a[i]=='0' and a[i+c]=='1') or (a[i]=='1' and a[i+c]=='0')):\r\n e=1\r\n f=-5\r\n break\r\n elif(a[i]=='.' and a[i+c]=='.'):\r\n f=i\r\n e=2\r\n break\r\n elif(a[i]=='.'):\r\n f=i\r\n e=1\r\n break\r\n elif(a[i+c]=='.'):\r\n f=i+c\r\n e=10\r\n break\r\n else:\r\n e=0\r\nif(e==0):\r\n print(\"NO\")\r\nelse:\r\n if(f==-5):\r\n for i in a:\r\n if(i!='.'):\r\n d.append(i)\r\n if(i=='.'):\r\n d.append(\"0\")\r\n elif(e==2):\r\n for i in range(len(a)):\r\n if(i==f):\r\n d.append(\"1\")\r\n elif(i==f+c):\r\n d.append(\"0\")\r\n elif(a[i]=='.'):\r\n d.append(\"0\")\r\n else:\r\n d.append(a[i])\r\n elif(e==10):\r\n for i in range(len(a)):\r\n if(i==f and f-c>-1 and a[f-c]==\"0\"):\r\n d.append(\"1\")\r\n elif(a[i]==\".\"):\r\n d.append(\"0\")\r\n else:\r\n d.append(a[i])\r\n else:\r\n for i in range(len(a)):\r\n if(i==f and f+c<=b and a[f+c]==\"0\"):\r\n d.append(\"1\")\r\n elif(a[i]==\".\"):\r\n d.append(\"0\")\r\n else:\r\n d.append(a[i])\r\n print(*d, sep='')\r\n", "n , p = map(int, input().split())\ns = list(input().strip())\nf = True\nfor i in range(p):\n k = s[i]\n if (k != '.'):\n for j in range(i + p, n, p): \n if s[j] == '.':\n s[j] = str((int(k) + 1) % 2) \n if s[j] != k:\n f = False\n else:\n for j in range(i, n, p):\n if s[j] != '.':\n k = s[j]\n if k == '.':\n k = '1'\n s[i] = k\n else:\n s[i] = str((int(k) + 1) % 2) \n f = False\n for j in range(i + p, n, p): \n if s[j] == '.':\n s[j] = str((int(k) + 1) % 2) \n if s[j] != k:\n f = False \nif f:\n print('No')\nelse:\n print(*s, sep = '')", "'''\r\njoy baba python r joy.....cpp akn sohoj\r\n\r\n\r\n\r\n'''\r\n\r\n#a = \"abc\"\r\n#b = 1\r\n#c = 5.9\r\n#d = 'd'\r\n#e = 101\r\n\r\n\r\n#a,b,c=map(int,raw_input().split())\r\n\r\n#a=10; b=20\r\n\r\n#print((a > b) - (a < b))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn,p= input().split(); n,p= int(n), int(p); ss=input()\r\ns=list(ss)\r\nsv=0\r\n\r\nfor i in range(n-p):\r\n if s[i]!=s[i+p] and s[i]!='.' and s[i+p]!='.':\r\n sv+=1\r\n break\r\n elif s[i]=='.' and s[i+p]!='.':\r\n if s[i+p]=='1': s[i]='0'\r\n else: s[i]='1'\r\n sv+=1; break\r\n \r\n elif s[i]!='.' and s[i+p]=='.':\r\n if s[i]=='1': s[i+p]='0'\r\n else: s[i+p]='1'\r\n sv+=1; break\r\n elif s[i]==s[i+p] and s[i]=='.':\r\n s[i]='0'; s[i+p]='1'\r\n sv+=1; break\r\n \r\nf1= ''.join(s)\r\nf2= f1.replace('.','0')\r\nif sv==0: print('No')\r\nelse: print(f2) \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 print_result(s):\n for i in range(0, len(s)):\n if s[i] == '.':\n s[i] = 0\n print(''.join(map(str, s)))\n\ndef solution(n, p, s):\n for i in range(0, len(s) - p):\n if s[i] == '0':\n if s[i + p] != '0':\n if s[i + p] == '.':\n s[i + p] = '1'\n print_result(s)\n return\n elif s[i] == '1':\n if s[i + p] != '1':\n if s[i + p] == '.':\n s[i + p] = '0'\n print_result(s)\n return\n else:\n if s[i + p] == '1':\n s[i] = '0'\n elif s[i + p] == '0':\n s[i] = '1'\n else:\n s[i] = '0'\n s[i + p] = '1'\n print_result(s)\n return\n print('No')\n return\n\nn, p = input().split()\nn = int(n)\np = int(p)\n\ns = list(input())\n\nsolution(n, p, s)\n", "n, p = [int(x) for x in input().split()]\ns = list(input())\n\nfound = False\nfor idx in range(n - p):\n if s[idx] == '.' and s[p + idx] == '1':\n s[idx] = '0'\n found = True\n break\n elif s[idx] == '.' and s[p + idx] == '0':\n s[idx] = '1'\n found = True\n break\n elif s[idx] == '.' and s[p + idx] == '.':\n s[idx] = '1'\n s[idx + p] = '0'\n found = True\n break\n elif s[idx] == '0' and s[p + idx] == '.':\n s[idx + p] = '1'\n found = True\n break\n elif s[idx] == '1' and s[p + idx] == '.':\n s[idx + p] = '0'\n found = True\n break\n elif s[idx] != s[idx + p]:\n found = True\n break\n\nif found:\n for idx in range(n):\n if s[idx] == '.':\n s[idx] = '0'\n print(''.join(s))\nelse:\n print('No')\n", "n,p= input().split(); n,p= int(n), int(p); ss=input()\r\ns=list(ss)\r\nsv=0\r\n\r\nfor i in range(n-p):\r\n if s[i]!=s[i+p] and s[i]!='.' and s[i+p]!='.':\r\n sv+=1\r\n break\r\n elif s[i]=='.' and s[i+p]!='.':\r\n if s[i+p]=='1': s[i]='0'\r\n else: s[i]='1'\r\n sv+=1; break\r\n \r\n elif s[i]!='.' and s[i+p]=='.':\r\n if s[i]=='1': s[i+p]='0'\r\n else: s[i+p]='1'\r\n sv+=1; break\r\n elif s[i]==s[i+p] and s[i]=='.':\r\n s[i]='0'; s[i+p]='1'\r\n sv+=1; break\r\n \r\nf1= ''.join(s)\r\nf2= f1.replace('.','0')\r\nif sv==0: print('No')\r\nelse: print(f2)", "n,p=input().split()\r\nn=int(n)\r\np=int(p)\r\ns=input()\r\nss=[]\r\nflag=0\r\nfor i in range(0,len(s)):\r\n\tss.append(s[i])\r\ns=ss\r\nfor i in range(0,len(s)-p):\r\n\tif s[i+p]!='.' and s[i]!='.' :\r\n\t\tif(s[i]=='0' and s[i+p]=='0') or (s[i]=='1' and s[i+p]=='1'):\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tflag=1\r\n\telif s[i]=='.' and s[i+p]=='.' :\r\n\t\ts[i]='0'\r\n\t\ts[i+p]='1'\r\n\t\tflag=1\r\n\telif s[i]=='.' :\r\n\t\tif s[i+p]=='0':\r\n\t\t\ts[i]='1'\r\n\t\t\tflag=1\r\n\t\telif s[i+p]=='1':\r\n\t\t\ts[i]='0'\r\n\t\t\tflag=1\r\n\telif s[i+p]=='.' :\r\n\t\tif s[i]=='0':\r\n\t\t\ts[i+p]='1'\r\n\t\t\tflag=1\r\n\t\telif s[i]=='1':\r\n\t\t\ts[i+p]='0'\r\n\t\t\tflag=1\r\n\t\r\n\tif flag==1:\r\n\t\tfor j in range(i,len(s)):\r\n\t\t\tif(j==i or j==i+p):\r\n\t\t\t\tcontinue\r\n\t\t\telif s[j]=='.':\r\n\t\t\t\ts[j]='1'\r\n\t\tbreak\r\nif(flag==1):\r\n\tprint(\"\".join(s))\r\nelse:\r\n\tprint(\"No\")\r\n\r\n\r\n", "yoar=list(map(int,input().split()))\nn=yoar[0]\np=yoar[1]\ns=list(input())\nflag=0\nfor i in range(n-p):\n\t#print(i)\n\tif s[i]==s[i+p]!=\".\":\n\t\tflag+=1\n\t\tcontinue\n\telif s[i]==s[i+p]==\".\":\t\n\t\ts[i]=\"0\"\n\t\ts[i+p]=\"1\"\n\telif s[i]==\"1\":\n\t\tif s[i+p]==\"0\":\n\t\t\tcontinue\n\t\t\t#flag=1\n\t\t\t#break\n\t\telif s[i+p]==\".\":\n\t\t\ts[i+p]=\"0\"\n\telif s[i+p]==\"1\":\n\t\tif s[i]==\"0\":\n\t\t\tcontinue\n\t\t\t# flag=1\n\t\t\t# break\n\t\telif s[i]==\".\":\n\t\t\ts[i]=\"0\"\t\t\t\t\n\telif s[i]==\"0\":\n\t\tif s[i+p]==\"1\":\n\t\t\tcontinue\n\t\t\t#flag=1\n\t\t\t#break\n\t\telif s[i+p]==\".\":\n\t\t\ts[i+p]=\"1\"\n\telif s[i+p]==\"0\":\n\t\tif s[i]==\"1\":\n\t\t\tcontinue\n\t\t\t# flag=1\n\t\t\t# break\n\t\telif s[i]==\".\":\n\t\t\ts[i]=\"1\"\n\nif flag==n-p:\n\tprint(\"No\")\nelse:\n\t#print(s)\n\tfor i in range(n):\n\t\tif s[i]==\".\":\n\t\t\ts[i]=\"0\"\n\n\n\tfor i in s:\n\t\tprint(i,end=\"\")\n\tprint()\t\t\t\t\t\t\t", "n,k=list(map(int,input().split()))\r\ns=input()\r\nt=True\r\nfor i in range(n-k):\r\n if s[i]!=s[i+k] or s[i]==\".\" or s[i+k]==\".\":\r\n t=False\r\n if (s[i]==\".\" and s[i+k]==\".\") or s[i+k]==\"0\":\r\n s=s[0:i]+\"1\"+s[i+1::]\r\n if s[i]==\"0\":\r\n s=s[0:i+k]+\"1\"+s[i+k+1::]\r\n break\r\nif t:\r\n print(\"No\")\r\nelse:\r\n while \".\" in s:\r\n s=s.replace(\".\",\"0\")\r\n print(s)\r\n", "n,p=map(int,input().split())\r\ns=list(input())\r\ncnt=0\r\nans=1\r\nfor i in range(n-p):\r\n\tif s[i]=='1' and s[i+p]=='.':\r\n\t\ts[i+p]='0'\r\n\t\tcnt+=1\r\n\telif s[i]=='0' and s[i+p]=='.':\r\n\t\ts[i+p]='1'\r\n\t\tcnt+=1\r\n\telif s[i]=='.' and s[i+p]=='1':\r\n\t\ts[i]='0'\r\n\t\tcnt+=1\r\n\telif s[i]=='.' and s[i+p]=='0':\r\n\t\ts[i]='1'\r\n\t\tcnt+=1\r\n\telif s[i]=='.' and s[i+p]=='.':\r\n\t\ts[i]='1'\r\n\t\ts[i+p]='0'\r\n\t\tcnt+=1\r\nif cnt>0:\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]=='.':\r\n\t\t\ts[i]='0'\r\nelse:\r\n\tflag=True\r\n\tfor i in range(n-p):\r\n\t\tif s[i]!='.' and s[i+p]!='.' and s[i]!=s[i+p]:\r\n\t\t\tflag=False\r\n\tif flag==False:\r\n\t\tfor i in range(n):\r\n\t\t\tif s[i]=='.':\r\n\t\t\t\ts[i]='0'\r\n\telse:\r\n\t\tans=0\r\nif ans==0:\r\n\tprint(\"No\")\r\nelse:\r\n\tfor m in s:\r\n\t print(m,end='')", "def solve(n,p,s):\r\n for i in range(n):\r\n if i + p < n:\r\n if s[i] != '.' and s[i+p] != '.' and s[i] != s[i+p] :\r\n return ''.join(s).replace('.','0')\r\n if s[i] == '.' and s[i+p] == '1':\r\n s[i] = '0'\r\n return ''.join(s).replace('.','0')\r\n if s[i] == '.' and s[i+p] == '0':\r\n s[i] = '1'\r\n return ''.join(s).replace('.','0')\r\n if s[i] == '.' and s[i+p] == '.':\r\n s[i] = '1'\r\n return ''.join(s).replace('.','0')\r\n if s[i] == '1' and s[i+p] == '.':\r\n s[i+p] = '0'\r\n return ''.join(s).replace('.','0')\r\n if s[i] == '0' and s[i+p] == '.':\r\n s[i+p] = '1'\r\n return ''.join(s).replace('.','0')\r\n return 'No'\r\n\r\n\r\nn,p = [int(x) for x in (input().split())]\r\ns = input()\r\nprint ( solve(n,p,list(s)))", "n,p=map(int,input().split())\r\ns=list(input())\r\nf=0\r\nfor i in range(n):\r\n if s[i]=='.':\r\n s[i]='0'\r\n if (i-p>=0 and s[i-p]=='0') or (i+p<n and s[i+p]=='0'):\r\n s[i]='1'\r\n if(i+p<n and s[i+p]!=s[i]): f=1\r\nif f==1:\r\n print(\"\".join(s))\r\nelse:print(\"No\")\r\n", "n,p = input().split()\r\nn = int(n)\r\np = int(p)\r\ns = input()\r\nsnew = \"\"\r\nfor i in range(p):\r\n k = i+p\r\n sym = s[i]\r\n if sym!='.':\r\n OK = True\r\n while k<n:\r\n if s[k]!=sym:\r\n OK = False\r\n break\r\n k+=p\r\n else:\r\n OK = False\r\n if OK==False and k<n:\r\n if sym=='1':\r\n snew = s[:k] + '0' + s[k+1:]\r\n elif sym=='0':\r\n snew = s[:k] + '1' + s[k+1:]\r\n elif sym=='.':\r\n if s[k]=='0':\r\n snew = s[:i] + '1' + s[i+1:]\r\n elif s[k]=='1':\r\n snew = s[:i] + '0' + s[i+1:]\r\n elif s[k]=='.':\r\n snew = s[:i] + '0' + s[i+1:k] + '1' + s[k+1:]\r\n break\r\nif snew!=\"\":\r\n rez = \"\"\r\n for i in range(len(snew)):\r\n if snew[i]!='.':\r\n rez+=snew[i]\r\n else:\r\n rez+='0'\r\n print(rez)\r\nelse:\r\n print(\"No\")\r\n \r\n", "def check(arr):\r\n\r\n if len(arr) == 1:\r\n return False, list(''.join(arr).replace('.','1'))\r\n ds = set(arr)\r\n if len(ds)>1:\r\n fail = True\r\n if '1' in ds:\r\n return True, list(''.join(arr).replace('.','0'))\r\n else:\r\n return True, list(''.join(arr).replace('.','1'))\r\n if '.' in ds:\r\n arr[0] = '0'\r\n arr[1] = '1'\r\n return True, list(''.join(arr).replace('.','1'))\r\n\r\n return False, list(''.join(arr).replace('.','1'))\r\n\r\n\r\nn, p = map(int, input().split())\r\ninst = list(input().strip())\r\nif n <p:\r\n print('No')\r\n exit()\r\nfail = False\r\nfor k in range(p):\r\n fail, inst[k::p] = check(inst[k::p])\r\n if fail:\r\n print(''.join(inst).replace('.','1'))\r\n exit()\r\nprint('No')", "per = False\r\nn, p = map(int, input().split())\r\ns = list(input())\r\nfor a in range(p):\r\n if per:\r\n break\r\n for b in range(a+p, n+n, p):\r\n if b >= n:\r\n break\r\n if s[a] != s[b] and s[a] != \".\" and s[b] != \".\":\r\n per = True\r\n break\r\n if s[a] == '.':\r\n if s[b] == \"1\":\r\n s[a] = '0'\r\n elif s[b] == '0':\r\n s[a] = \"1\"\r\n else:\r\n s[a] = '1'\r\n s[b] = '0'\r\n per = True\r\n break\r\n elif s[b] == '.':\r\n if s[a] == '1':\r\n s[b] = '0'\r\n else:\r\n s[b] = '1'\r\n per = True\r\n break\r\nif per:\r\n for i in range(n):\r\n if s[i] == \".\":\r\n s[i] = '1'\r\n print(''.join(s))\r\nelse:\r\n print(\"No\")", "n, p = input().strip().split()\r\nn, p = int(n), int(p)\r\ns=input()\r\n\r\n\r\nflag=True\r\nj=0\r\nfor i in range(len(s)-p):\r\n if(s[i]!=s[i+p] or s[i]== '.'):\r\n flag=False\r\n j=i\r\n break\r\n\r\nif(flag):\r\n print(\"No\\n\")\r\n\r\nelse:\r\n if(s[j]=='.' and s[j+p]!='.'):\r\n s = s[:j]+str(int(not bool(int(s[j+p]))))+s[j+1:]\r\n elif(s[j]!='.' and s[j+p]=='.'):\r\n s = s[:j+p]+str(int(not bool(int(s[j]))))+s[j+p+1:]\r\n elif s[j+p]=='.' and s[j]=='.':\r\n s=s[:j]+'0'+s[j+1:]\r\n s=s[:j+p]+'1'+s[j+p+1:]\r\n \r\n s = s.replace('.', '0')\r\n \r\n print(s)\r\n \r\n \r\n", "\n\nif __name__ == '__main__':\n\n length, period = map(int, input().split(' '))\n\n row = [ch for ch in input()]\n\n pairs = ((x, x+period) for x in range(0, length - period))\n\n is_period = False\n for x, y in pairs:\n\n # Случаи если есть точка (мы всегда можем сделать НЕ период)\n if row[x] == '.' and row[y] == '.':\n row[x] = '1'\n row[y] = '0'\n break\n elif row[x] == '.':\n if row[y] == '1':\n row[x] = '0'\n else:\n row[x] = '1'\n break\n elif row[y] == '.':\n if row[x] == '1':\n row[y] = '0'\n else:\n row[y] = '1'\n break\n\n else:\n if row[x] != row[y]:\n break\n else:\n is_period = True\n\n if is_period:\n print('No')\n else:\n response = \"\"\n for ch in row:\n if ch == '.':\n response += '1'\n else:\n response += ch\n print(response)\n", "stfn, stfp = input().split()\nn,p = int(stfn), int(stfp)\n\ns = list(str(input()))\n\ncorrected = False\n\nfor i in range(0, n-p):\n\tif corrected:\n\t\tif s[i] == '.':\n\t\t\ts[i] = '1'\n\n\t\tif s[i+p] == '.':\n\t\t\ts[i+p] = '0'\n\telse:\n\t\tif s[i] == '.':\n\t\t\tif s[i+p] == '.':\n\t\t\t\ts[i] = '0'\n\t\t\t\ts[i+p] = '1'\n\n\t\t\t\tcorrected = True\n\t\t\telif s[i+p] == '1':\n\t\t\t\ts[i] = '0'\n\n\t\t\t\tcorrected = True\n\t\t\telif s[i+p] == '0':\n\t\t\t\ts[i] = '1'\n\n\t\t\t\tcorrected = True\n\t\telif s[i] == '1':\n\t\t\tif s[i+p] == '.':\n\t\t\t\ts[i+p] = '0'\n\n\t\t\t\tcorrected = True\n\t\t\telif s[i+p] == '1':\n\t\t\t\tcontinue\n\t\t\telif s[i+p] == '0':\n\t\t\t\tcorrected = True\n\n\t\telif s[i] == '0':\n\t\t\tif s[i+p] == '.':\n\t\t\t\ts[i+p] = '1'\n\n\t\t\t\tcorrected = True\n\t\t\telif s[i+p] == '0':\n\t\t\t\tcontinue\n\t\t\telif s[i+p] == '1':\n\t\t\t\tcorrected = True\n\nif corrected:\n\tfor j in range(i+1, p):\n\t\tif s[j] == '.':\n\t\t\ts[j] = '1'\n\t\t\t\n\tprint(''.join(s))\nelse:\n\tprint(\"No\")\n\n\n\n", "n, p = list(map(int, input().split()))\nss1 = input()\nss = [x for x in ss1]\nimport sys\n\ndef gn(v):\n if v == '1':\n return '0'\n return '1'\n\nfor i in range(len(ss)):\n for j in range(i, len(ss), p):\n if i == j:\n continue\n if ss[i] != ss[j]:\n if ss[i] != '.' and ss[j] != '.':\n pass\n else:\n if ss[i] != '.':\n ss[j] = gn(ss[i])\n else:\n ss[i] = gn(ss[j])\n print(''.join(ss).replace('.', '0'))\n sys.exit()\n if ss[i] == ss[j] and ss[i] == '.':\n ss[i] = '1'\n ss[j] = '0'\n res = ''.join(ss).replace('.', '0')\n print(res)\n sys.exit()\n\nprint('No')\n", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nmod=1000000007\r\n#i am noob wanted to be better and trying hard for that\r\nn,p=vary(2)\r\ns=list(input())\r\nflag=0\r\nfor i in range(n):\r\n if i+p<n:\r\n if s[i]=='.' and s[i+p]=='.':\r\n s[i]='1'\r\n s[i+p]='0'\r\n flag=1\r\n break\r\n if s[i]=='.':\r\n s[i]=str(1^int(s[i+p]))\r\n flag=1\r\n break\r\n if s[i+p]=='.':\r\n s[i+p]=str(1^int(s[i]))\r\n flag=1\r\n break\r\n if s[i]!=s[i+p]:\r\n flag=1\r\n break\r\nif flag==0:\r\n print('No')\r\nelse:\r\n ans=''\r\n for i in range(n):\r\n if s[i]=='.':\r\n ans+='1'\r\n else:\r\n ans+=s[i]\r\n print(ans)\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "def rev(k):\r\n return '0' if k =='1' else '1'\r\nn,p=map(int,input().split())\r\na= input()\r\nb = list(a)\r\nf = False\r\nfor i in range(n-p):\r\n c = a[i]\r\n d=a[i+p]\r\n #print(c,d)\r\n if '.' in [c,d]:\r\n if c == '.' and d!='.':\r\n b[i] = rev(d)\r\n elif c != '.' and d=='.':\r\n b[i+p] = rev(c)\r\n else:\r\n b[i]='1'\r\n b[i+p] = '0'\r\n f = True\r\n elif d!=c:f= True\r\nif f:\r\n #b.replace('.','1')\r\n for i in b:print(i if i!='.' else '0',end='')\r\n print()\r\nelse:print('No')\r\n", "k=input().split()\nn=int(k[0])\np=int(k[1])\ns=input()\ns=list(s) # � ����� �������!\ncounter=0\nfor i in range(n-p):\n tec=s[i]\n next=s[i+p]\n if tec=='.':\n if next=='.':\n s[i]='1'\n s[i+p]='0'\n counter=1\n elif next=='1':\n s[i]='0'\n counter=1\n elif next=='0':\n s[i]='1'\n counter=1\n elif tec=='1':\n if next=='.':\n s[i+p]='0'\n counter=1\n elif next=='0':\n counter=1\n elif tec=='0':\n if next=='.':\n s[i+p]='1'\n counter=1\n elif next=='1':\n counter=1\n if counter==1:\n break\nif counter==0:\n print('No')\nelse:\n l=''\n for i in s:\n l+=i\n p=l.replace('.', '1')\n print(p)", "n,p=map(int,input().split())\r\ns=input()\r\nf=1\r\nfor i in range(len(s)-p):\r\n\tif s[i]!='.' and s[i+p]!='.' and s[i]==s[i+p]:\r\n\t\t\tcontinue\r\n\telse:\r\n\t\tf=0\r\n\t\tbreak\r\n\r\nif f==1:\r\n\tprint(\"No\")\r\nelse:\r\n\tx=[]\r\n\tfor i in s:\r\n\t\tx.append(i)\r\n\tfor i in range(len(s)-p):\r\n\t\tif x[i]=='.' and x[i+p]=='.':\r\n\t\t\tx[i]='1'\r\n\t\t\tx[i+p]='0'\r\n\t\tif x[i]=='.' and x[i+p]=='0':\r\n\t\t\tx[i]='1'\r\n\t\tif x[i]=='.' and x[i+p]=='1':\r\n\t\t\tx[i]='0'\r\n\t\tif x[i]=='1' and x[i+p]=='.':\r\n\t\t\tx[i+p]='0'\r\n\t\tif x[i]=='0' and x[i+p]=='.':\r\n\t\t\tx[i+p]='1'\r\n\tfor i in range(len(s)):\r\n\t\tif x[i]=='.':\r\n\t\t\tx[i]='0'\r\n\tprint(''.join(x))\r\n", "n,p=map(int,input().split())\r\ns=list(input())\r\ni=next((i for i,(x,y)in enumerate(zip(s,s[p:]))if not x==y!='.'),-1)\r\nif i<0:\r\n print('No')\r\nelse:\r\n if s[i]=='.':s[i]='01'[s[i+p]in'.0']\r\n if s[i+p]=='.':s[i+p]='01'[s[i]=='0']\r\n print(''.join(s).replace('.','0'))", "n, p = map(int, input().split())\r\ns = input()\r\nl = list(s)\r\nk = 0\r\na = 0\r\nfor i in range(len(s) - p):\r\n a = i\r\n if (i + p > len(s) - 1):\r\n break\r\n if (l[i] == l[i + p] and l[i] != \".\"):\r\n k += 1\r\n elif (l[i] != l[i + p]):\r\n if (l[i] == '.'):\r\n for j in range(len(l)):\r\n if (l[j] == \".\"):\r\n l[j] = \"0\"\r\n if (l[i + p] == \"0\"):\r\n l[i] = \"1\"\r\n else:\r\n l[i] = \"0\"\r\n print(\"\".join(l))\r\n break\r\n\r\n elif (l[i + p] == '.'):\r\n for j in range(len(l)):\r\n if (l[j] == \".\"):\r\n l[j] = \"0\"\r\n if (l[i] == \"0\"):\r\n l[i + p] = \"1\"\r\n else:\r\n l[i + p] = \"0\"\r\n print(\"\".join(l))\r\n break\r\n else:\r\n for j in range(len(l)):\r\n if (l[j] == \".\"):\r\n l[j] = \"0\"\r\n print(\"\".join(l))\r\n break\r\n elif (l[i]==l[i + p] and l[i] == \".\"):\r\n for j in range(len(l)):\r\n if (l[j] == \".\"):\r\n l[j] = \"0\"\r\n l[i] = \"1\"\r\n print(\"\".join(l))\r\n break\r\nif (k==a+1):\r\n print(\"NO\")\r\nif(p==n):\r\n print(\"NO\")", "n,p=map(int,input().split())\r\ns=input()\r\nans=s.replace('.','0')\r\nif all(ans[i]==ans[i+p] for i in range(n-p)):\r\n i=0\r\n while i<n and s[i]!='.': i+=1\r\n if i+p<n:\r\n ans=ans[:i]+'1'+ans[i+1:]\r\n print(ans)\r\n exit()\r\n i=n-1\r\n while i>=0 and s[i]!='.':i-=1\r\n if i-p>=0:\r\n ans=ans[:i]+'1'+ans[i+1:]\r\n print(ans) \r\n exit()\r\n print(\"No\")\r\nelse:\r\n print(ans)\r\n\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n# primes = [2,11,101,1009,10007,100003,1000003,10000019,102345689]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n#arr.sort(key=lambda x: (-d[x], x)) Sort with Freq\r\n\r\n#Code\r\n\r\ndef solve(s , k , n):\r\n st = set()\r\n for i in range(n):\r\n j = i + k\r\n if j <= n-1:\r\n if s[i]==s[j] :\r\n st.add(0)\r\n else:\r\n st.add(1)\r\n return st\r\n\r\nn , k = MAP()\r\ns = STR()\r\n\r\nfor i in range(n):\r\n x = i\r\n y = i + k\r\n if y <= n -1 :\r\n if s[x] == '.' and s[y] == '.':\r\n s[x] = '1'\r\n s[y] = '0'\r\n\r\n if s[x] == '.' and s[y] != '.':\r\n s[x] = str(1 - int(s[y]))\r\n\r\n if s[y] == '.' and s[x] != '.':\r\n s[y] = str(1 - int(s[x]))\r\n else:\r\n if s[x] == '.':\r\n s[x] = '1'\r\n\r\n#print(''.join(s))\r\nr = (solve(s , k , n ))\r\n#print(r)\r\n\r\nif len(r) == 2 or (len(r) == 1 and 1 in r) :\r\n print(''.join(s))\r\nelse:\r\n print('No')\r\n\r\n\r\n", "n,p = map(int,input().split())\ns = input()\nS = [ch for ch in s]\nok = False \nfor i in range(n-p):\n if S[i] == '0' and S[i+p] == '1':\n ok = True \n if S[i] == '1' and S[i+p] == '0':\n ok = True \n \n elif S[i] == '1' and S[i+p] == '.':\n S[i+p] = '0'\n ok = True \n elif S[i] == '0' and S[i+p] == '.':\n S[i+p] = '1'\n ok = True \n elif S[i+p] == '0' and S[i] == '.':\n S[i] = '1'\n ok = True \n elif S[i+p] == '1' and S[i] == '.':\n S[i] = '0'\n ok = True \n elif S[i] == '.' and S[i+p] == '.':\n S[i] = '0'\n S[i+p] = '1'\n ok = True \n \nif ok == False:\n print(\"No\")\nelse:\n for i in range(len(S)):\n if S[i] == '.':\n S[i] = '0'\n print(\"\".join(S))\n \n \n \n", "def main():\n n, p = map(int, input().split())\n s = list(input())\n\n no = True\n for i in range(n - p):\n if s[i] == '.' and s[i + p] == '.':\n s[i] = '1'\n s[i + p] = '0'\n no = False\n break\n elif s[i] == '.':\n s[i] = '1' if s[i + p] == '0' else '0'\n no = False\n break\n elif s[i + p] == '.':\n s[i + p] = '1' if s[i] == '0' else '0'\n no = False\n break\n else:\n if s[i] != s[i + p]:\n no = False\n break\n\n if not no:\n s = ''.join(s).replace('.', '0')\n print(s)\n else:\n print('No')\n\n\nif __name__ == '__main__':\n main()\n", "n,p = input().split()\r\nn=int(n)\r\np=int(p)\r\ns=input()\r\na=['1' if x=='.' else x for x in s]\r\nb=['0' if x=='.' else x for x in s]\r\nh=0\r\nfor i in range(n):\r\n if(i+p>=n):\r\n break\r\n if (s[i]=='.' and s[i+p]=='.'):\r\n a[i]='1'\r\n a[i+p]='0'\r\n h=1\r\n elif s[i]=='.':\r\n a[i]=str(1-int(s[i+p]))\r\n h=1\r\n elif s[i+p]=='.':\r\n a[i+p]=str(1-int(s[i]))\r\n h=1\r\n elif (a[i]!=a[i+p]):\r\n h=1\r\n elif (b[i]!=b[i+p]):\r\n h=2\r\nif h==2:\r\n print(\"\".join(b))\r\nelse:\r\n print(\"\".join(a)) if h else print(\"No\")\r\n ", "def sv():\n\tN, P = map(int, input().split())\n\tS = list(input())\n\tres = False\n\tfor n in range(N):\n\t\tif S[n] == '.':\n\t\t\tS[n] = '0'\n\t\t\tif (n-P >= 0 and S[n-P] == '0') or (n+P<N and S[n+P] == '0'): S[n] = '1'\n\t\tif n-P >= 0 and S[n-P] != S[n]: res=True\n\treturn ''.join(S) if res else 'No'\nprint (sv())\n", "import sys\r\nimport math\r\nimport bisect\r\nfrom math import sqrt\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\nn, p = rinput()\r\ns = input()\r\nf = True\r\nans = ['' for _ in range(n)]\r\n\r\nfor i in range(n-p):\r\n\tif s[i] == \".\" and s[i+p] == \".\":\r\n\t\tans[i] = \"0\"\r\n\t\tans[i+p] = \"1\"\r\n\t\tf = False\r\n\t\tbreak\r\n\t\r\n\tif s[i] == \".\":\r\n\t\tother = str(1-int(s[i+p]))\r\n\t\tans[i] = other\r\n\t\tf = False\r\n\t\tbreak\r\n\r\n\tif s[i+p] == \".\":\r\n\t\tother = str(1-int(s[i]))\r\n\t\tans[i+p] = other\r\n\t\tf = False\r\n\t\tbreak\t\r\n\r\n\tif s[i]!=s[i+p]:\r\n\t\tf = False\r\n\t\tbreak\r\n\r\nfor i in range(n):\r\n\tif ans[i] == \"\":\r\n\t\tif s[i] == \".\":\r\n\t\t\tans[i] = \"0\"\r\n\t\telse:\t\r\n\t\t\tans[i] = s[i]\r\n\r\nif f:\r\n\tprint(\"No\")\r\nelse:\r\n\tprint(\"\".join(ans))\t" ]

[ "istr = input()\nprint((0 - int('{0:08b}'.format(ord(istr[0]))[::-1], 2)) % 256)\nfor i in range(len(istr)-1):\n\tprint((int('{0:08b}'.format(ord(istr[i]))[::-1], 2) - int('{0:08b}'.format(ord(istr[i+1]))[::-1], 2)) % 256)\n\t# num = int('{0:08b}'.format(c)[::-1], 2)\n\n\n\n\t# num = '{0:08b}'.format(prev_value)[::-1]\n\t# print(num)\n\t# prev_value = ord(c)\n\t# num = (int(num, 2) - ord(c)) % 256\n\t# num = '{0:08b}'.format(num)[::-1]\n\t# num = int(num, 2)\n\t# print(num)\n", "#codeforces_132A\r\nline = input()\r\nlast = '0'*8\r\nci = '' #ith char bin representation\r\nfor e in line:\r\n\tci = bin(ord(e))[2:]\r\n\tci = '0'*(8-len(ci)) + ci\r\n\tprint((int(last[::-1],2)-int(ci[::-1],2))%256)\r\n\tlast = bin(ord(e))[2:]\r\n\tlast = '0'*(8-len(last))+ last\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nc = 0\r\nfor i in s:\r\n x = int((bin(ord(i))[2:].rjust(8, '0'))[::-1], 2)\r\n print((c - x)%256)\r\n c = x\r\n", "text = str(input())\r\nans = list()\r\nfor j in range(len(text)):\r\n ch_code_b = bin(ord(text[j]))\r\n l_ch_code_b = list(ch_code_b)\r\n second_step = int(0)\r\n while len(l_ch_code_b) < 10:\r\n l_ch_code_b.insert(2, 0)\r\n for i in range(2, len(l_ch_code_b)):\r\n second_step += int(l_ch_code_b[i]) * pow(2, i - 2)\r\n if j == 0:\r\n first_step = 0\r\n else:\r\n ch_code_b = bin(ord(text[j - 1]))\r\n l_ch_code_b = list(ch_code_b)\r\n first_step = int(0)\r\n while len(l_ch_code_b) < 10:\r\n l_ch_code_b.insert(2, 0)\r\n for i in range(2, len(l_ch_code_b)):\r\n first_step += int(l_ch_code_b[i]) * pow(2, i - 2)\r\n ans.append((first_step - second_step) % 256)\r\nfor i in ans:\r\n print(i)", "if __name__ == '__main__':\r\n s = input()\r\n e = 0\r\n for i in s:\r\n \ta = ord(i)\r\n \tb = format(a,'08b')\r\n \tc = str(b)[::-1]\r\n \td = int(c, 2)\r\n \tprint ((e-d)%256)\r\n \te = d", "def r(n):\r\n v = 0\r\n for i in range(8):\r\n n, v = n >> 1, (v << 1) + (n & 1)\r\n return v\r\ns = input()\r\nfor i in range(len(s)):\r\n print((r(ord(s[i - 1]) if i > 0 else 0) - r(ord(s[i]))) % 256)", "import math\r\nn = input()\r\n\r\np1 = 0\r\nfor i in n:\r\n x = (bin(ord(i))[2:]).zfill(8)\r\n x = int(x[::-1],2)\r\n p = x\r\n x= (p1-x)%256\r\n while x<0: x+=256-1\r\n while x>=256: x-=256-1\r\n print(x)\r\n p1 = p\r\n", "def f(x):\n\n return int(format(256 + x, 'b')[:: -1][: -1], 2)\n\nt, x = input(), 0\n\nfor i in t:\n\n y = f(ord(i))\n\n print((x - y) % 256)\n\n x = y", "s = list(input())\r\nprev = 0\r\nfor i in s:\r\n n = bin(ord(i))[2:]\r\n n = (8 - len(n)) * '0' + n\r\n n = n[::-1]\r\n d = int(n, 2)\r\n print((prev - d) % 256)\r\n prev = d\r\n", "def rev( x, k = None ):\r\n if k == None:\r\n k = 7\r\n if k == -1: return 0\r\n return ( ( x & 1 ) << k ) + rev( x >> 1, k - 1 )\r\n\r\nS = input()\r\n\r\nfor i in range( len( S ) ):\r\n print( ( rev( ord( S[ i - 1 ] ) if i > 0 else 0 ) - rev( ord( S[ i ] ) ) ) % 256 )\r\n", "# 132A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\nprev = 0\r\na = []\r\nfor c in stdin.readline().strip():\r\n rev = int(bin(ord(c))[2:].zfill(8)[::-1], 2)\r\n x = prev - rev if prev >= rev else 256 - rev + prev\r\n a.append(x)\r\n prev = rev\r\n\r\nfor x in a:\r\n print(x)", "text = input()\nn = len(text)\nprev_step = 0\nfor i in range(n):\n char = text[i]\n bit_char = str(bin(ord(char)))[2:]\n ascii_char = '0'*(8-len(bit_char))+bit_char\n reverse_ascii_char = ascii_char[::-1]\n reverse_bit_char = '0b'+reverse_ascii_char\n reverse_char = int(reverse_bit_char, 2)\n subbed = (prev_step - reverse_char) % 256\n prev_step = reverse_char\n print(subbed)\n", "s = input().strip()\r\nlast = 0\r\nfor c in s:\r\n oc = ord(c)\r\n boc = bin(oc)[2:]\r\n while len(boc) < 8:\r\n boc = \"0\"+boc\r\n boc = boc[::-1]\r\n ic = int(boc, 2)\r\n print((last-ic+256) % 256)\r\n last = ic\r\n", "s = input()\r\nprev = 0\r\n\r\nfor c in s:\r\n bn = int(bin(ord(c))[2:].zfill(8)[::-1],2)\r\n pprev = bn\r\n bn = (prev-bn) % 256\r\n prev = pprev\r\n print(bn)", "def btd(n):\r\n y=1\r\n r=0\r\n while(n):\r\n s=n%10\r\n r=r+s*y\r\n n=n//10\r\n y=y*2\r\n return r\r\n\r\n\r\nn=input()\r\np=list(n)\r\nv=0\r\nfor i in p:\r\n s=ord(i)\r\n q=bin(s)\r\n q=q.replace(\"0b\",\"\")\r\n q=q[::-1]\r\n t=len(q)\r\n q=str(q)\r\n q=int(q)\r\n if t<8:\r\n t=8-t\r\n q=q*(10**t)\r\n w=btd(q)\r\n print((v-w)%256)\r\n v=w", "def rev(x):\r\n r = 0\r\n for _ in range(8):\r\n r = r * 2 + x % 2\r\n x //= 2\r\n return r\r\na, last = [ord(c) for c in str(input())], 0\r\nfor i in a:\r\n x = rev(i)\r\n print((last - x) % 256)\r\n last = x", "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\nans = []\r\nla = 0\r\npow2 = [1]\r\nfor _ in range(8):\r\n pow2.append(2 * pow2[-1])\r\nfor i in s:\r\n x = 0\r\n for j in range(8):\r\n if i & pow2[j]:\r\n x ^= pow2[7 - j]\r\n ans.append((la - x) % 256)\r\n la = x\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "s = input()\r\nmod = 256\r\nprev = 0\r\nfor ch in s:\r\n\tm = str(''.join(reversed(bin(ord(ch))[2:])))\r\n\tif len(m)<8:\r\n\t\tm+=('0'*(8-len(m)))\r\n\tm = int(m, 2)\r\n\tsa = (prev-m)%mod\r\n\tprint(sa)\r\n\tprev = m", "s = input()\r\n \r\ne = 0\r\nfor i in s:\r\n\ta = ord(i)\r\n\tb = format(a,'08b')\r\n\tc = str(b)[::-1]\r\n\td = int(c, 2)\r\n\tprint ((e-d)%256)\r\n\te = d", "\r\nt = input()\r\n\r\n\r\nf=[0]\r\n\r\n\r\nfor j in range(len(t)):\r\n\r\n a=bin(ord(t[j]))[2:]\r\n\r\n if len(a)<8:\r\n a = '0'*(8-len(a))+a\r\n\r\n b=int(a[::-1],2)\r\n\r\n\r\n x=(f[-1]-b)%256\r\n print(x)\r\n f.append(b)\r\n\r\n \r\n" ]

[ "n=int(input())\r\nlst=[*map(int,input().split())]\r\nind=sorted(range(n),key=lst.__getitem__)\r\nelem=0\r\nfor i,x in enumerate(ind):\r\n elem=max(elem+1,lst[x])\r\n lst[x]=elem\r\nprint(''.join(map(lambda x:str(x)+' ',lst)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(enumerate(map(int, input().split())), key=lambda x:x[1])\r\nx = [0]*n\r\nc = 0\r\nfor i in range(n):\r\n if w[i][1] > c:\r\n x[w[i][0]] = w[i][1]\r\n c = w[i][1] + 1\r\n else:\r\n x[w[i][0]] = c\r\n c += 1\r\nprint(' '.join(map(str, x)))", "n = int(input())\r\narr = list(map(int,input().split()))\r\nsort = sorted(range(n), key=lambda i: arr[i])\r\ncurr = 0\r\nfor i in sort:\r\n if arr[i]<=curr:\r\n curr+=1\r\n arr[i]=curr\r\n else:\r\n curr=arr[i]\r\n # sort[i]=curr\r\n# print(curr)\r\nprint(*arr)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\ng = [input()[:-1] for _ in range(n)]\r\nd = [0]*m\r\n\r\nfor i in range(1, n):\r\n for j in range(m):\r\n if g[i][j] == 'R':\r\n if j + i < m:\r\n d[j+i] += 1\r\n elif g[i][j] == 'L':\r\n if j - i >= 0:\r\n d[j-i] += 1\r\n elif g[i][j] == 'U':\r\n if i % 2 == 0:\r\n d[j] += 1\r\nprint(' '.join(map(str, d)))\r\n", "n, m, k = map( int, input().split() )\n\nans = [0] * m\n\n\n\nfor i in range( n ):\n\n field = input()\n\n for j in range( m ):\n\n if ( field[j] == 'U' ) and ( i % 2 == 0 ): ans[j] += 1\n\n elif ( field[j] == 'L' ) and ( j >= i ): ans[j - i] += 1\n\n elif ( field[j] == 'R' ) and ( j + i < m ): ans[j + i] += 1\n\n\n\nprint ( ' '.join( map( str, ans ) ) )\n\n\n\n# Made By Mostafa_Khaled", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\ndx, dy = (0, 1, 0, -1, 1, -1, 1, -1), (1, 0, -1, 0, 1, -1, -1, 1)\r\ndir = {'L': 0, 'U': 1, 'R': 2, 'D': 3, '.': 4}\r\nvalid = lambda x, y: -1 < x < n and -1 < y < m\r\n\r\nn, m, k = map(int, input().split())\r\na, ans = [input() for _ in range(n)], [0] * m\r\nfor j in range(m):\r\n for i in range(1, n):\r\n for k in range(4):\r\n nx, ny = i + i * dx[k], j + i * dy[k]\r\n if valid(nx, ny) and dir[a[nx][ny]] == k:\r\n ans[j] += 1\r\nprint(*ans)\r\n", "import sys\n\ninput = sys.stdin.readline\n\ntest = False\n\nmod1, mod2 = 10 ** 9 + 7, 998244353\ninf = 10 ** 18 + 5\n\n\ndef test_case():\n\n n, m, k = map(int, input().split())\n\n grid = []\n\n for i in range(n):\n\n grid.append(list(input().rstrip('\\n')))\n\n for j in range(m):\n\n cnt = 0\n\n for i in range(n):\n\n cur = i\n\n if j + cur <= m - 1 and grid[i][j + cur] == 'L':\n\n cnt += 1\n\n if j - cur >= 0 and grid[i][j - cur] == 'R':\n\n cnt += 1\n\n if i + cur <= n - 1 and grid[i + cur][j] == 'U':\n\n cnt += 1\n\n if i - cur >= 0 and grid[i - cur][j] == 'D':\n\n cnt += 1\n\n print(cnt, end=' ')\n\n print()\n\n\nt = 1\n\nif test:\n\n t = int(input())\n\nfor _ in range(t):\n\n # print(f\"Case #{_+1}: \")\n test_case()\n", "n, m, k = map(int, input().split())\r\ninput()\r\ns = [0] * m\r\nfor i in range(1, n):\r\n for j, x in enumerate(input()):\r\n if x == 'L':\r\n if j - i >= 0: s[j - i] += 1\r\n elif x == 'R':\r\n if j + i < m: s[j + i] += 1\r\n elif x == 'U' and i & 1 == 0: s[j] += 1\r\nprint(' '.join(map(str, s)))", "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\ndx, dy = (0, 1, 0, -1, 1, -1, 1, -1), (1, 0, -1, 0, 1, -1, -1, 1)\r\ndir = {'L': 0, 'U': 1, 'R': 2, 'D': 3, '.': 4}\r\nvalid = lambda x, y: -1 < x < n and -1 < y < m\r\n\r\nn, m, k = map(int, input().split())\r\na, ans = [input() for _ in range(n)], [0] * m\r\nfor j in range(m):\r\n for i in range(1, n):\r\n for k in range(4):\r\n nx, ny = i + i * dx[k], j + i * dy[k]\r\n if valid(nx, ny) and dir[a[nx][ny]] == k:\r\n ans[j] += 1\r\nprint(*ans)\r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n, m, k = map(int, input().split())\r\n arr = []\r\n for i in range(n):\r\n arr.append([i for i in input().strip()])\r\n\r\n ans = [0 for i in range(m)]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n up, down, left, right = i-i, i+i, j-i, j+i\r\n\r\n if 0 <= up < n and arr[up][j] == \"D\":\r\n ans[j] += 1\r\n if 0 <= down < n and arr[down][j] == \"U\":\r\n ans[j] += 1\r\n if 0 <= left < m and arr[i][left] == \"R\":\r\n ans[j] += 1\r\n if 0 <= right < m and arr[i][right] == \"L\":\r\n ans[j] += 1\r\n\r\n print(*ans)\r\n", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n return nSpidersToSeeIn(tuple(input() for _ in range(int(input().split()[0]))))\r\n\r\n\r\ndef nSpidersToSeeIn(field):\r\n return ' '.join(map(str, tuple(sum(spiders(field, x, y)\r\n for y in range(1, len(field))) for x in range(len(field[0])))))\r\n\r\n\r\ndef spiders(field, iRow, iCol):\r\n nSpiders = 0\r\n iRight, iLeft = iRow - iCol, iRow + iCol\r\n if iRight >= 0 and field[iCol][iRight] == 'R':\r\n nSpiders += 1\r\n\r\n if iLeft < len(field[0]) and field[iCol][iLeft] == 'L':\r\n nSpiders += 1\r\n\r\n if not iCol%2 and field[iCol][iRow] == 'U':\r\n nSpiders += 1\r\n\r\n return nSpiders\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "I = lambda:map(int,input().split())\r\nn,m,k = I()\r\nf = [['.' for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n for j in range(len(s)):\r\n if s[j] != '.':\r\n f[i][j] = s[j]\r\nans = [0] * m\r\nfor i in range(n):\r\n for j in range(m):\r\n if j - i >= 0 and f[i][j - i] == 'R':\r\n ans[j] += 1\r\n if j + i < m and f[i][j + i] == 'L':\r\n ans[j] += 1\r\n if f[0][j] == 'D':\r\n ans[j] += 1\r\n if i + i < n and f[i + i][j] == 'U':\r\n ans[j] += 1\r\nprint (*ans)", "Rows, Columns = 0, 0\r\nSpiders = []\r\n\r\ndef ReadInput():\r\n global Rows, Columns, Spiders\r\n Rows, Columns, spiderCount = map(int, input().split())\r\n Spiders = [0 for i in range(0, Columns)]\r\n for x in range(0, Rows):\r\n line = input()\r\n for y in range(0, Columns):\r\n if line[y] == 'L':\r\n if y - x >= 0:\r\n Spiders[y - x] += 1\r\n elif line[y] == 'R':\r\n if y + x < Columns:\r\n Spiders[y + x] += 1\r\n elif line[y] == 'U':\r\n if x % 2 == 0:\r\n Spiders[y] += 1\r\n\r\ndef PrintOutput():\r\n global Rows, Columns, Spiders\r\n for y in range(0, Columns):\r\n print(Spiders[y], end = \" \")\r\n print(\"\\n\")\r\n\r\ndef main():\r\n ReadInput()\r\n PrintOutput()\r\n\r\nmain()", "def solve():\r\n answer = [0] * m\r\n for i in range(1, n):\r\n for j in range(m):\r\n if j - i >= 0:\r\n if park[i][j - i] == 'R':\r\n answer[j] += 1\r\n if j + i < m:\r\n if park[i][j + i] == 'L':\r\n answer[j] += 1\r\n if 2 * i < n:\r\n if park[2 * i][j] == 'U':\r\n answer[j] += 1\r\n return answer\r\n\r\nn, m, k = tuple(map(int, input().split()))\r\npark = [input() for i in range(n)]\r\nprint(' '.join(map(str, solve())))\r\n", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n return nSpidersToSeeIn(tuple(input() for _ in range(int(input().split()[0]))))\r\n\r\n\r\ndef nSpidersToSeeIn(field):\r\n return ' '.join(map(str, tuple(sum((y <= x and field[y][x-y] == 'R') +\r\n ((x+y) < len(field[0]) and field[y][x+y] == 'L') +\r\n (not y%2 and field[y][x] == 'U')\r\n for y in range(1, len(field))) for x in range(len(field[0])))))\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n" ]

[ "\r\n\r\narr= []\r\nfor i in range(3):\r\n l=list(map(int,input().split()))\r\n arr.append(l)\r\n\r\nans=[[\"1\",\"1\",\"1\"],[\"1\",\"1\",\"1\"],[\"1\",\"1\",\"1\"]]\r\nfor r in range(3):\r\n for c in range(3):\r\n row=r\r\n col=c\r\n temp= arr[row][col]\r\n if row-1>=0:\r\n temp+=arr[row-1][col]\r\n if row+1<=2:\r\n temp+=arr[row+1][col]\r\n if col+1<=2:\r\n temp+=arr[row][col+1]\r\n if col-1>=0:\r\n temp+=arr[row][col-1]\r\n \r\n if temp%2 !=0:\r\n ans[r][c]='0'\r\nprint(''.join(ans[0]))\r\nprint(''.join(ans[1]))\r\nprint(''.join(ans[2]))\r\n \r\n \r\n \r\n \r\n ", "a=input()\r\na=a.split()\r\na=list(map(int,a))\r\nb=input()\r\nb=b.split()\r\nb=list(map(int,b))\r\nc=input()\r\nc=c.split()\r\nc=list(map(int,c))\r\naa=''\r\nbb=''\r\ncc=''\r\nif (a[0]+b[0]+a[1])%2==0:\r\n aa+='1'\r\nelse:\r\n aa+='0'\r\nif (a[0]+b[1]+a[1]+a[2])%2==0:\r\n aa+='1'\r\nelse:\r\n aa+='0'\r\nif (a[2]+b[2]+a[1])%2==0:\r\n aa+='1'\r\nelse:\r\n aa+='0'\r\nif (a[0]+b[0]+c[0]+b[1])%2==0:\r\n bb+='1'\r\nelse:\r\n bb+='0'\r\nif (a[1]+b[0]+c[1]+b[1]+b[2])%2==0:\r\n bb+='1'\r\nelse:\r\n bb+='0'\r\nif (a[2]+b[2]+c[2]+b[1])%2==0:\r\n bb+='1'\r\nelse:\r\n bb+='0'\r\nif (c[0]+b[0]+c[1])%2==0:\r\n cc+='1'\r\nelse:\r\n cc+='0'\r\nif (c[0]+b[1]+c[1]+c[2])%2==0:\r\n cc+='1'\r\nelse:\r\n cc+='0'\r\nif (c[2]+b[2]+c[1])%2==0:\r\n cc+='1'\r\nelse:\r\n cc+='0'\r\nprint(aa)\r\nprint(bb)\r\nprint(cc)", "ans = [[1,1,1],[1,1,1],[1,1,1]]\n\ngrid = []\n\ndef solve(a):\n if a == 1:\n return 0\n else:\n return 1\n\nfor i in range(3):\n a = list(map(int,input().split()))\n grid.append(a)\n\n\nif grid[0][0] % 2 != 0:\n ans[0][0] = solve(ans[0][0])\n\n ans[1][0] = solve(ans[1][0])\n ans[0][1] = solve(ans[0][1])\n\nif grid[0][1] % 2 != 0:\n ans[0][1] = solve(ans[0][1])\n\n ans[0][0] = solve(ans[0][0])\n ans[0][2] = solve(ans[0][2])\n ans[1][1] = solve(ans[1][1])\n\nif grid[0][2] % 2 != 0:\n ans[0][2] = solve(ans[0][2])\n\n ans[0][1] = solve(ans[0][1])\n ans[1][2] = solve(ans[1][2])\n\nif grid[1][0] % 2 != 0:\n ans[1][0] = solve(ans[1][0])\n\n ans[0][0] = solve(ans[0][0])\n ans[1][1] = solve(ans[1][1])\n ans[2][0] = solve(ans[2][0])\n\nif grid[1][1] % 2 != 0:\n ans[1][1] = solve(ans[1][1])\n\n ans[0][1] = solve(ans[0][1])\n ans[1][0] = solve(ans[1][0])\n ans[1][2] = solve(ans[1][2])\n ans[2][1] = solve(ans[2][1])\n\nif grid[1][2] % 2 != 0:\n ans[1][2] = solve(ans[1][2])\n\n ans[0][2] = solve(ans[0][2])\n ans[1][1] = solve(ans[1][1])\n ans[2][2] = solve(ans[2][2])\n\nif grid[2][0] % 2 != 0:\n ans[2][0] = solve(ans[2][0])\n\n ans[1][0] = solve(ans[1][0])\n ans[2][1] = solve(ans[2][1])\n\nif grid[2][1] % 2 != 0:\n ans[2][1] = solve(ans[2][1])\n\n ans[2][0] = solve(ans[2][0])\n ans[1][1] = solve(ans[1][1])\n ans[2][2] = solve(ans[2][2])\n\nif grid[2][2] % 2 != 0:\n ans[2][2] = solve(ans[2][2])\n\n ans[1][2] = solve(ans[1][2])\n ans[2][1] = solve(ans[2][1])\n\nfor i in range(3):\n temp = ''\n for j in range(3):\n temp += str(ans[i][j])\n print(temp)\n\n \t\t\t \t \t \t \t\t\t \t \t\t\t", "def final_state(lights) :\r\n state = [[1 for i in range(3)]for j in range(3)]\r\n drow,dcol = [-1,0,1,0],[0,-1,0,1]\r\n\r\n for i in range(3) :\r\n for j in range(3) :\r\n time = lights[i][j]\r\n for t in range(time) :\r\n state[i][j] = 1 - state[i][j]\r\n for k in range(4) :\r\n nrow,ncol = drow[k] + i, dcol[k] + j\r\n if nrow >= 0 and ncol >= 0 and nrow < 3 and ncol < 3 :\r\n state[nrow][ncol] = 1 - state[nrow][ncol]\r\n\r\n return state\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef get_input() :\r\n lights = []\r\n for i in range(3) :\r\n x,y,z = map(int,input().split())\r\n lights.append([x,y,z])\r\n return lights\r\n\r\ndef print_output(op) :\r\n for i in range(3) :\r\n for j in range(3) :\r\n print(op[i][j],end = '')\r\n print()\r\n\r\n\r\nprint_output(final_state(get_input()))", "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\ta=[[1,1,1],[1,1,1],[1,1,1]]\r\n\tfor i in range(3):\r\n\t\tv=read_ints()\r\n\t\tfor j in range(3):\r\n\t\t\tif v[j]%2==1:\r\n\t\t\t\tfor (nx, ny) in [(i,j),(i-1,j),(i+1,j),(i,j-1),(i,j+1)]:\r\n\t\t\t\t\tif nx>=0 and ny>=0 and nx<3 and ny<3:\r\n\t\t\t\t\t\ta[nx][ny]=1-a[nx][ny]\r\n\tprint(\"\\n\".join(\"\".join(str(x) for x in v) for v in a))\r\n\r\nsolve()\r\n", "a = [list(map(int,input().split())) for i in range(3)]\r\nfor i in range(3):\r\n row = \"\"\r\n for j in range(3):\r\n temp = 0\r\n for x in range(3):\r\n for y in range(3):\r\n if abs(i-x)+abs(j-y)<2:\r\n temp += a[x][y]\r\n row+=str((temp+1)%2)\r\n print(row)\r\n", "(a,b,c)=[int(x) for x in input().split()]\r\n(d,e,f)=[int(x) for x in input().split()]\r\n(g,h,i)=[int(x) for x in input().split()]\r\nj=k=l=m=n=o=p=q=r=1\r\nfor z in range (a):\r\n if j==1:j=0 \r\n else:j=1\r\n if k==1:k=0 \r\n else:k=1\r\n if m==1:m=0 \r\n else:m=1\r\nfor z in range (b):\r\n if j==1:j=0 \r\n else:j=1\r\n if k==1:k=0 \r\n else:k=1\r\n if l==1:l=0 \r\n else:l=1\r\n if n==1:n=0 \r\n else:n=1\r\nfor z in range (c):\r\n if l==1:l=0 \r\n else:l=1\r\n if k==1:k=0 \r\n else:k=1\r\n if o==1:o=0 \r\n else:o=1\r\nfor z in range (d):\r\n if j==1:j=0 \r\n else:j=1\r\n if p==1:p=0 \r\n else:p=1\r\n if m==1:m=0 \r\n else:m=1\r\n if n==1:n=0 \r\n else:n=1\r\nfor z in range (e):\r\n if k==1:k=0 \r\n else:k=1\r\n if m==1:m=0 \r\n else:m=1\r\n if n==1:n=0 \r\n else:n=1\r\n if o==1:o=0 \r\n else:o=1\r\n if q==1:q=0 \r\n else:q=1\r\nfor z in range (f):\r\n if l==1:l=0 \r\n else:l=1\r\n if n==1:n=0 \r\n else:n=1\r\n if o==1:o=0 \r\n else:o=1\r\n if r==1:r=0 \r\n else:r=1\r\nfor z in range (g):\r\n if m==1:m=0 \r\n else:m=1\r\n if p==1:p=0 \r\n else:p=1\r\n if q==1:q=0 \r\n else:q=1\r\nfor z in range (h):\r\n if p==1:p=0 \r\n else:p=1\r\n if n==1:n=0 \r\n else:n=1\r\n if r==1:r=0 \r\n else:r=1\r\n if q==1:q=0 \r\n else:q=1\r\nfor z in range (i):\r\n if r==1:r=0 \r\n else:r=1\r\n if o==1:o=0 \r\n else:o=1\r\n if q==1:q=0 \r\n else:q=1\r\nprint(j,end='')\r\nprint(k,end='')\r\nprint(l,)\r\nprint(m,end='')\r\nprint(n,end='')\r\nprint(o)\r\nprint(p,end='')\r\nprint(q,end='')\r\nprint(r)", "arr = []\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\narr.append(a)\narr.append(b)\narr.append(c)\nx = [[1, 1, 1],[1, 1, 1],[1, 1, 1]]\nfor i in range(0,3):\n for j in range(0,3):\n if arr[i][j] % 2 != 0:\n # self\n if x[i][j] == 0:\n x[i][j] = 1\n else:\n x[i][j] = 0\n # right\n if j < 2 and x[i][j + 1] == 0:\n x[i][j + 1] = 1\n elif j < 2 and x[i][j + 1] == 1:\n x[i][j + 1] = 0\n # left\n if j > 0 and x[i][j - 1] == 0:\n x[i][j - 1] = 1\n elif j > 0 and x[i][j - 1] == 1:\n x[i][j - 1] = 0\n # bottom\n if i<2 and x[i+1][j] == 0:\n x[i + 1][j] = 1\n elif i<2 and x[i+1][j] == 1:\n x[i + 1][j] = 0\n # top\n if i > 0 and x[i - 1][j] == 0:\n x[i - 1][j] = 1\n elif i > 0 and x[i - 1][j] == 1:\n x[i - 1][j] = 0\nfor i in range(0,3):\n for j in range(0,3):\n print(x[i][j],end=\"\")\n print()\n\t \t\t\t\t \t\t\t\t \t\t \t \t \t \t", "l = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\ni = []\r\nfor _ in range(3): i.append(list(input().split()))\r\n\r\n\r\ndef switch(a):\r\n if int(a)==0:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nfor a in range(len(i)):\r\n for b in range(len(i[a])):\r\n if int(i[a][b]) % 2 == 0 and int(i[a][b])!=0:\r\n pass\r\n\r\n elif int(i[a][b]) % 2 == 1 and int(i[a][b])!=0:\r\n l[a][b]=switch(l[a][b])\r\n if a != 0:\r\n l[a - 1][b]=switch(l[a - 1][b]) # a!=0\r\n if a != 2:\r\n l[a + 1][b]=switch(l[a + 1][b]) # a!=2\r\n if b != 0:\r\n l[a][b - 1]=switch(l[a][b - 1]) # b!=0\r\n if b != 2:\r\n l[a][b + 1]=switch(l[a][b + 1])#b!=2\r\n\r\nfor i in range(3):\r\n print(str(l[i][0])+str(l[i][1])+str(l[i][2]))", "a = [list(map(int,input().split())) for _ in range(3)]\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n a[i][j] = a[i][j] % 2\r\n \r\nans = [[1 for i in range(3)] for _ in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]:\r\n for x, y in [(0, -1), (0, 1), (1, 0), (-1, 0), (0, 0)]:\r\n if i + x in range(3) and j + y in range(3):\r\n ans[i + x][j + y] = not ans[i + x][j + y]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(int(ans[i][j]), end='')\r\n print()\r\n \r\n\r\n\r\n", "a = [[8]*5 for i in range(5)]\r\nb = [[int(j) for j in input().split()] for i in range(3)]\r\nc = [[1]*5 for i in range(5)]\r\nn, k = 0, 0\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n a[i][j] = b[n][k]\r\n k+=1\r\n n+=1\r\n k = 0\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if a[i][j] % 2 == 0:\r\n a[i][j] = 0\r\n else:\r\n a[i][j] = 1\r\n\r\nfor i in range(len(a)-1):\r\n for j in range(len(a[i])-1):\r\n if i>=1 and i<=3 and j>=1 and j<=3:\r\n if a[i][j] % 2 != 0:\r\n c[i][j] = 1 - c[i][j]\r\n c[i+1][j] = 1 - c[i+1][j]\r\n c[i-1][j] = 1 - c[i-1][j]\r\n c[i][j+1] = 1 - c[i][j+1]\r\n c[i][j-1] = 1 - c[i][j-1]\r\n \r\n \r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print(c[i][j], end = \"\")\r\n print()", "on=[[1,1,1],[1,1,1],[1,1,1]]\r\nl=[]\r\nfor i in range(3):\r\n a,b,c=map(int,input().split())\r\n t=[a,b,c]\r\n l.append(t)\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if l[i][j]%2:\r\n on[i][j]=(on[i][j]+1)%2 #if the element is 1, it is toggled to (1+1)%2=0. else if it is 0 it is toggled to (0+1)%2=1\r\n if j!=2:\r\n on[i][j+1]=(on[i][j+1]+1)%2\r\n if j!=0:\r\n on[i][j-1]=(on[i][j-1]+1)%2\r\n if i!=0:\r\n on[i-1][j]=(on[i-1][j]+1)%2\r\n if i!=2:\r\n on[i+1][j]=(on[i+1][j]+1)%2\r\n \r\nfor i in on:\r\n for j in i:\r\n print(j, end='')\r\n print()", "inp = []\nfor _ in range(3):\n inp.append(list(map(int, input().split(' '))))\n\nlights = [[1, 1, 1], [1,1,1], [1,1,1]]\n#print(inp)\n\nfor i in range(3):\n for j in range(3):\n n = inp[i][j]\n if n % 2 == 0:\n isOdd = False\n else:\n isOdd = True\n if isOdd:\n lights[i][j] = int(not lights[i][j])\n if i+1<3:\n #print(i+1, j)\n lights[i+1][j] = int(not lights[i+1][j])\n if i-1 >= 0:\n lights[i-1][j] = int(not lights[i-1][j])\n if j+1<3:\n lights[i][j+1] = int(not lights[i][j+1])\n if j-1 >= 0:\n lights[i][j-1] = int(not lights[i][j-1])\n\nfor l in lights:\n print(str(l[0]) + str(l[1]) + str(l[2]))\n\n\n\n", "lights = []\r\nfor x in range(3):\r\n row = list(map(int, input().split()))\r\n lights.append(row)\r\nfor x in range(3):\r\n for y in range(3):\r\n total = 0\r\n total += lights[x][y]\r\n if y != 0:\r\n total += lights[x][y-1]\r\n if y != 2:\r\n total += lights[x][y+1]\r\n if x != 0:\r\n total += lights[x-1][y]\r\n if x != 2:\r\n total += lights[x+1][y]\r\n if total % 2 == 0:\r\n print('1', end='')\r\n else:\r\n print('0', end='')\r\n print(end='\\n')", "l=[]\r\nl.append([0,0,0,0,0])\r\nfor _ in range(3): \r\n l2=[]\r\n l2.append(0)\r\n l2.extend(list(map(int ,input().split())))\r\n l2.append(0)\r\n l.append(l2)\r\nl.append([0,0,0,0,0])\r\nfor i in range(1,4): \r\n for j in range(1,4): \r\n if (l[i][j]+l[i][j-1]+l[i][j+1]+l[i+1][j]+l[i-1][j])%2:print(0,end='')\r\n else:print(1,end='')\r\n print()", "output=[[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nr1=list(map(lambda x:int(x)%2,input().split()))\r\nr2=list(map(lambda x:int(x)%2,input().split()))\r\nr3=list(map(lambda x:int(x)%2,input().split()))\r\nl=[r1,r2,r3]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if l[i][j]:\r\n if i==0:\r\n if j==0:\r\n output[0][0]=int(not output[0][0])\r\n output[0][1]=int(not output[0][1])\r\n output[1][0]=int(not output[1][0])\r\n elif j==1:\r\n output[0][0]=int(not output[0][0])\r\n output[0][1]=int(not output[0][1])\r\n output[1][1]=int(not output[1][1])\r\n output[0][2]=int(not output[0][2])\r\n else:\r\n output[0][1]=int(not output[0][1])\r\n output[0][2]=int(not output[0][2])\r\n output[1][2]=int(not output[1][2])\r\n elif i==1:\r\n if j==0:\r\n output[0][0]=int(not output[0][0])\r\n output[1][0]=int(not output[1][0])\r\n output[1][1]=int(not output[1][1])\r\n output[2][0]=int(not output[2][0])\r\n elif j==1:\r\n output[1][0]=int(not output[1][0])\r\n output[0][1]=int(not output[0][1])\r\n output[1][1]=int(not output[1][1])\r\n output[1][2]=int(not output[1][2])\r\n output[2][1]=int(not output[2][1])\r\n else:\r\n output[1][1]=int(not output[1][1])\r\n output[2][2]=int(not output[2][2])\r\n output[0][2]=int(not output[0][2])\r\n output[1][2]=int(not output[1][2])\r\n else:\r\n if j==0:\r\n output[1][0]=int(not output[1][0])\r\n output[2][1]=int(not output[2][1])\r\n output[2][0]=int(not output[2][0])\r\n elif j==1:\r\n output[2][0]=int(not output[2][0])\r\n output[2][1]=int(not output[2][1])\r\n output[1][1]=int(not output[1][1])\r\n output[2][2]=int(not output[2][2])\r\n else:\r\n output[2][1]=int(not output[2][1])\r\n output[2][2]=int(not output[2][2])\r\n output[1][2]=int(not output[1][2])\r\n\r\nfor i in output:\r\n s=\"\"\r\n for j in i:\r\n s+=str(j)\r\n print(s)", "import sys\r\n\r\ndef main():\r\n inp = [[int(j) for j in i.split()] for i in sys.stdin.read().strip().split('\\n')]\r\n w = [[1,1,1,],[1,1,1,],[1,1,1,]]\r\n for i in range(3):\r\n for j in range(3):\r\n n = inp[i][j]\r\n if n%2:\r\n w[i][j] = int(not w[i][j])\r\n if i < 2: w[i+1][j] = int(not w[i+1][j])\r\n if i > 0: w[i-1][j] = int(not w[i-1][j])\r\n if j < 2: w[i][j+1] = int(not w[i][j+1])\r\n if j > 0: w[i][j-1] = int(not w[i][j-1])\r\n return [''.join(map(str, j)) for j in w]\r\n \r\nprint(*main(), sep='\\n')", "a=[]\r\nb=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n row=list(map(int,input().split()))\r\n a.append(row)\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]%2!=0 and a[i][j]!=0:\r\n b[i][j]^=1\r\n if j+1<3:\r\n b[i][j+1]^=1\r\n if j - 1 >=0:\r\n b[i][j - 1] ^= 1\r\n if i - 1 >=0:\r\n b[i-1][j] ^= 1\r\n if i + 1 <3:\r\n b[i+1][j] ^= 1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(b[i][j],end=\"\")\r\n print(end=\"\\n\")", "s1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\n\r\nl1 = s1.split()\r\nl2 = s2.split()\r\nl3 = s3.split()\r\n\r\nv1 = int(l1[0]) + int(l1[1]) + int(l2[0])\r\nv2 = int(l1[0]) + int(l1[1]) + int(l1[2]) + int(l2[1]) \r\nv3 = int(l1[2]) + int(l1[1]) + int(l2[2])\r\nv4 = int(l1[0]) + int(l2[0]) + int(l3[0]) + int(l2[1]) \r\nv5 = int(l2[0]) + int(l2[1]) + int(l2[2]) + int(l1[1]) + int(l3[1])\r\nv6 = int(l3[2]) + int(l1[2]) + int(l2[2]) + int(l2[1]) \r\nv7 = int(l3[0]) + int(l3[1]) + int(l2[0])\r\nv8 = int(l3[2]) + int(l2[1]) + int(l3[1]) + int(l3[0]) \r\nv9 = int(l3[2]) + int(l3[1]) + int(l2[2])\r\n\r\nr1 = ''\r\nif v1 % 2 == 0:\r\n r1 += '1'\r\nelse:\r\n r1 += '0'\r\nif v2 % 2 == 0:\r\n r1 += '1'\r\nelse:\r\n r1 += '0'\r\nif v3 % 2 == 0:\r\n r1 += '1'\r\nelse:\r\n r1 += '0'\r\n\r\nr2 = ''\r\nif v4 % 2 == 0:\r\n r2 += '1'\r\nelse:\r\n r2 += '0'\r\nif v5 % 2 == 0:\r\n r2 += '1'\r\nelse:\r\n r2 += '0'\r\nif v6 % 2 == 0:\r\n r2 += '1'\r\nelse:\r\n r2 += '0'\r\n\r\nr3 = ''\r\nif v7 % 2 == 0:\r\n r3 += '1'\r\nelse:\r\n r3 += '0'\r\nif v8 % 2 == 0:\r\n r3 += '1'\r\nelse:\r\n r3 += '0'\r\nif v9 % 2 == 0:\r\n r3 += '1'\r\nelse:\r\n r3 += '0'\r\n\r\nprint(r1)\r\nprint(r2)\r\nprint(r3)", "a,b,c=map(int,input().split())\nd,e,f=map(int,input().split())\ng,h,i=map(int,input().split())\nm=(a+b+d)%2\nn=(a+b+c+e)%2\no=(b+c+f)%2\np=(a+d+e+g)%2\nq=(b+d+e+f+h)%2\nr=(c+e+f+i)%2\ns=(d+g+h)%2\nt=(e+g+h+i)%2\nu=(f+h+i)%2\nv=[m,n,o,p,q,r,s,t,u]\nx=[]\nfor i in v:\n if i%2==0:\n x.append('1')\n else:\n x.append('0')\nprint(''.join(x[0:3]))\nprint(''.join(x[3:6]))\nprint(''.join(x[6:9]))\n \t\t \t\t \t \t\t\t \t \t\t \t\t\t \t", "g = []\r\ni = 0\r\nwhile i < 3:\r\n l = list(map(int, (input().split())))\r\n g.append(l)\r\n i += 1\r\n\r\ngc = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\r\ngc[0][0] = (g[0][0] + g[0][1]+g[1][0])\r\ngc[0][1] = (g[0][1]+g[0][0] + g[0][2] + g[1][1])\r\ngc[0][2] = (g[0][2]+g[0][1] + g[1][2])\r\ngc[1][0] = (g[1][0]+g[1][1] + g[0][0] + g[2][0])\r\ngc[1][1] = (g[1][1]+g[1][0]+g[1][2]+g[0][1]+g[2][1])\r\ngc[1][2] = (g[1][2]+g[1][1] + g[0][2] + g[2][2])\r\ngc[2][0] = (g[2][0]+g[2][1] + g[1][0])\r\ngc[2][1] = (g[2][1] + g[2][2] + g[2][0] + g[1][1])\r\ngc[2][2] = (g[2][2]+g[2][1] + g[1][2])\r\n\r\np = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\r\nj = 0\r\n\r\nwhile j < 3:\r\n temp = gc[j]\r\n k = 0\r\n while k < 3:\r\n if gc[j][k] % 2 == 0:\r\n p[j][k] = 1\r\n else:\r\n p[j][k] = 0\r\n k += 1\r\n j += 1\r\n\r\n\r\nfor r in p:\r\n for b in r:\r\n print(b, end='')\r\n print('')\r\n", "odd_count = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\r\n\r\nfor i in range(3):\r\n row = [int(x) for x in input().split()]\r\n for j in range(3):\r\n if row[j] % 2:\r\n odd_count[i][j] += 1\r\n if i < 2:\r\n odd_count[i+1][j] += 1\r\n if i > 0:\r\n odd_count[i-1][j] += 1\r\n if j < 2:\r\n odd_count[i][j+1] += 1\r\n if j > 0:\r\n odd_count[i][j-1] += 1\r\n\r\nfor i in range(3):\r\n print(\"\".join([str((x + 1) % 2) for x in odd_count[i]]))\r\n", "grid=[[1 for i in range(3)] for j in range(3)]\r\n\r\nfor i in range(3):\r\n n=list(map(int,input().split()))\r\n for j in range(3):\r\n if n[j]%2:\r\n grid[i][j]=abs(grid[i][j]-1)\r\n if 0<i:\r\n grid[i-1][j]=abs(grid[i-1][j]-1)\r\n if i+1<3:\r\n grid[i+1][j]=abs(grid[i+1][j]-1)\r\n if 0<j:\r\n grid[i][j-1]=abs(grid[i][j-1]-1)\r\n if j+1<3:\r\n grid[i][j+1]=abs(grid[i][j+1]-1)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(grid[i][j],end=\"\")\r\n print()", "def neighbors(a, x, y):\r\n total = 0\r\n for dx, dy in [ (-1, 0), \r\n ( 0, -1),( 0, 1),\r\n ( 0, 0), ( 1, 0)]:\r\n try:\r\n if (x+dx>=0) and (y+dy>=0):\r\n total += a[x+dx][y+dy]\r\n except:\r\n total+=0\r\n return total\r\na=[]\r\nfor i in range(3):\r\n a.append(list(map(int,input().strip().split())))\r\nb=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n b[i][j]+=neighbors(a,i,j)\r\n b[i][j]=str(b[i][j]%2)\r\nfor each in b:\r\n print(\"\".join(each))\r\n\r\n", "mat = [list(map(int,input().split())) for i in range(3)]\r\nswitches = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if mat[i][j]%2==1:\r\n switches[i][j]=1-switches[i][j]\r\n if i>0:\r\n switches[i-1][j]=1-switches[i-1][j] \r\n if i<2:\r\n switches[i+1][j]=1-switches[i+1][j]\r\n if j>0:\r\n switches[i][j-1]=1-switches[i][j-1]\r\n if j<2:\r\n switches[i][j+1]=1-switches[i][j+1]\r\nfor i in switches:\r\n print(*i,sep=\"\")", "res = [[1] * 3 for _ in range(3)]\r\nfor i in range(3):\r\n row = [int(i) % 2 for i in input().split()]\r\n for j in range(3):\r\n if row[j] == 1:\r\n res[i][j] = abs(res[i][j] - 1)\r\n if i > 0:\r\n res[i - 1][j] = abs(res[i - 1][j] - 1)\r\n if i < 2:\r\n res[i + 1][j] = abs(res[i + 1][j] - 1)\r\n if j > 0:\r\n res[i][j - 1] = abs(res[i][j - 1] - 1)\r\n if j < 2:\r\n res[i][j + 1] = abs(res[i][j + 1] - 1)\r\n\r\nfor row in res:\r\n for i in row:\r\n print(i, end='')\r\n print()\r\n", "def getAdj(a,b):\n pos_x=[a]\n if a-1>=0:\n pos_x.append(a-1)\n if a+1<=2:\n pos_x.append(a+1)\n pos_y=[b]\n if b-1>=0:\n pos_y.append(b-1)\n if b+1<=2:\n pos_y.append(b+1)\n fin=[]\n for x in pos_x:\n fin.append((x,b))\n for y in pos_y:\n if y!=b:\n fin.append((a,y))\n return fin\n\nmat=[['1' for i in range(3)] for j in range(3)]\nfor i in range(3):\n lst=list(map(int,input().split(' ')))\n for j in range(3):\n if lst[j]!=0:\n for pt in getAdj(i,j):\n if lst[j]%2==1:\n mat[pt[0]][pt[1]]=('0' if mat[pt[0]][pt[1]]=='1' else '1')\n \nfor i in range(len(mat)):\n print(\"\".join(mat[i]))", "l_l = list()\r\n\r\nd_x = [ 0, -1, 1, 0, 0]\r\nd_y = [-1, 0, 0, 1, 0]\r\n\r\nfor i in range(3):\r\n l_l.append(list(map(int, input().split())))\r\n\r\nl_c = list(list(1 for _ in range(3)) for _ in range(3))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if l_l[i][j] % 2 == 1:\r\n for k in range(5):\r\n x = j + d_x[k]\r\n y = i + d_y[k]\r\n if y >= 0 and y < 3 and x >= 0 and x < 3:\r\n l_c[y][x] = abs(1 - l_c[y][x])\r\n\r\nfor l in l_c:\r\n print(\"\".join(str(i) for i in l))", "\r\nlight_a = [[1 for i in range(3)] for j in range(3)]\r\npress_a = []\r\nfor i in range(3):\r\n l1 = list(map(int,input().split()))\r\n l2 = list(map(lambda x: x%2,l1))\r\n press_a.append(l2)\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if press_a[i][j]:\r\n try:\r\n if i == 0:\r\n pass\r\n elif light_a[i-1][j] == 1:\r\n light_a[i-1][j] = 0\r\n else:\r\n light_a[i-1][j] = 1\r\n except Exception:\r\n pass\r\n\r\n try:\r\n if light_a[i][j] == 1:\r\n light_a[i][j] = 0\r\n else:\r\n light_a[i][j] = 1\r\n except Exception:\r\n pass\r\n\r\n try:\r\n if light_a[i + 1][j] == 1:\r\n light_a[i + 1][j] = 0\r\n else:\r\n light_a[i + 1][j] = 1\r\n except Exception:\r\n pass\r\n\r\n try:\r\n if light_a[i][j+1] == 1:\r\n light_a[i][j+1] = 0\r\n else:\r\n light_a[i][j+1] = 1\r\n except Exception:\r\n pass\r\n\r\n try:\r\n if j == 0:\r\n pass\r\n elif light_a[i][j - 1] == 1:\r\n light_a[i][j - 1] = 0\r\n else:\r\n light_a[i][j - 1] = 1\r\n except Exception:\r\n pass\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(light_a[i][j],end=\"\")\r\n print()", "a = [[True] * 3 for i in range(3)]\n\nm = []\nfor i in range(3):\n m.append(list(map(int, input().split())))\n\nfor i in range(3):\n for j in range(3):\n if m[i][j] % 2 == 0:\n continue\n\n aff = [(i, j)]\n if i != 2:\n aff.append((i+1, j))\n if i != 0:\n aff.append((i-1, j))\n if j != 2:\n aff.append((i, j+1))\n if j != 0:\n aff.append((i, j-1))\n for pt in aff:\n a[pt[0]][pt[1]] = not a[pt[0]][pt[1]]\n\nfor r in range(3):\n print(''.join(\"1\" if d else \"0\" for d in a[r]))\n", "a = list()\r\nfor _ in range(3):\r\n\tx, y, z = map(int, input().split())\r\n\ta.append(x)\r\n\ta.append(y)\r\n\ta.append(z)\r\nfor i in range(9):\r\n\tif i%3==0 and i!=0:\r\n\t\tprint(\"\")\r\n\tif i==0:\r\n\t\tprint(\"1\" if (a[i]+a[i+1]+a[i+3])%2==0 else \"0\", end = '')\r\n\tif i==1:\r\n\t\tprint(\"1\" if (a[i]+a[i+1]+a[i+3]+a[i-1])%2==0 else \"0\", end = '')\r\n\tif i==2:\r\n\t\tprint(\"1\" if (a[i]+a[i+3]+a[i-1])%2==0 else \"0\", end = '')\r\n\tif i==3:\r\n\t\tprint(\"1\" if (a[i]+a[i+1]+a[i+3]+a[i-3])%2==0 else \"0\", end = '')\r\n\tif i==4:\r\n\t\tprint(\"1\" if (a[i]+a[i+1]+a[i+3]+a[i-3]+a[i-1])%2==0 else \"0\", end = '')\r\n\tif i==5:\r\n\t\tprint(\"1\" if (a[i]+a[i+3]+a[i-3]+a[i-1])%2==0 else \"0\", end = '')\r\n\tif i==6:\r\n\t\tprint(\"1\" if (a[i]+a[i+1]+a[i-3])%2==0 else \"0\", end = '')\r\n\tif i==7:\r\n\t\tprint(\"1\" if (a[i]+a[i+1]+a[i-3]+a[i-1])%2==0 else \"0\", end = '')\r\n\tif i==8:\r\n\t\tprint(\"1\" if (a[i]+a[i-3]+a[i-1])%2==0 else \"0\", end = '')", "a = [0]*9\r\n\r\nls = [int(i) for i in input().split(' ')]+[int(i) for i in input().split(' ')]+[int(i) for i in input().split(' ')]\r\n# print(ls)\r\nc = 0\r\nfor i in range(3):\r\n for j in range(3):\r\n a[c] += ls[c]\r\n if(i-1 >= 0):\r\n a[c] += ls[c-3] \r\n if(i+1 < 3):\r\n a[c] += ls[c+3] \r\n if(j-1 >= 0):\r\n a[c] += ls[c-1] \r\n if(j+1 < 3):\r\n a[c] += ls[c+1] \r\n # print(c, ' ', a[c])\r\n a[c] = 1 if(a[c] % 2 == 0) else 0\r\n print(a[c], end = '')\r\n c+=1\r\n print()", "_list = []\r\n_list_all = []\r\nfor i in range(3):\r\n _list.append(list(map(int, input().split())))\r\n _list_all.append([1, 1, 1])\r\nfor i in range(3):\r\n for j in range(3):\r\n if _list[i][j] == \"0\" or _list[i][j] % 2 == 0:\r\n continue\r\n if i + 1 <= 2:\r\n _list_all[i + 1][j] = (_list_all[i + 1][j] + 1) % 2\r\n if i - 1 >= 0:\r\n _list_all[i - 1][j] = (_list_all[i - 1][j] + 1) % 2\r\n if j + 1 <= 2:\r\n _list_all[i][j + 1] = (_list_all[i][j + 1] + 1) % 2\r\n if j - 1 >= 0:\r\n _list_all[i][j - 1] = (_list_all[i][j - 1] + 1) % 2\r\n _list_all[i][j] = (_list_all[i][j] + 1) % 2\r\nfor i in range(3):\r\n for j in range(3):\r\n print(_list_all[i][j], end=\"\")\r\n print()", "def read_int_row ( ):\r\n\treturn [int(x) for x in input().split()] \r\n\r\n\r\nl1 = 0b110100000\r\nl2 = 0b111010000\r\nl3 = 0b011001000\r\n\r\nl4 = 0b100110100\r\nl5 = 0b010111010\r\nl6 = 0b001011001\r\n\r\nl7 = 0b000100110\r\nl8 = 0b000010111\r\nl9 = 0b000001011\r\n\r\nlights = [[l1, l2, l3],\r\n\t\t [l4, l5, l6],\r\n\t\t [l7, l8, l9]]\r\n\r\nbase_board = 0b111111111\r\n\r\nboard = []\r\n\r\nfor _ in range(3):\r\n\tboard.append(read_int_row())\r\n\r\nfor i, row in enumerate(board):\r\n\tfor j, c in enumerate(row):\r\n\t\tboard[i][j] = c % 2\r\n\r\nfor i, row in enumerate(board):\r\n\tfor j, c in enumerate(row):\r\n\t\tif board[i][j] == 1:\r\n\t\t\tbase_board ^= lights[i][j]\r\n\r\np_board = format (base_board, '#011b').replace(\"0b\", \"\")\r\n\r\nprint (p_board[:3])\r\nprint (p_board[3:6])\r\nprint (p_board[6:])", "l = [list(map(int,input().split())) for i in range(3)]\r\nans = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if(l[i][j]&1==1):\r\n if(ans[i][j]==1):\r\n ans[i][j] = 0\r\n else:\r\n ans[i][j] = 1\r\n if(i-1>=0):\r\n if(ans[i-1][j]==1):\r\n ans[i-1][j] = 0\r\n else:\r\n ans[i-1][j] = 1\r\n if(j-1>=0):\r\n if(ans[i][j-1]==1):\r\n ans[i][j-1] = 0\r\n else:\r\n ans[i][j-1] = 1\r\n if(i+1<=2):\r\n if(ans[i+1][j]==1):\r\n ans[i+1][j] = 0\r\n else:\r\n ans[i+1][j] = 1\r\n if(j+1<=2):\r\n if(ans[i][j+1]==1):\r\n ans[i][j+1] = 0\r\n else:\r\n ans[i][j+1] = 1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j],end = \"\")\r\n print()", "a = [\n0b110100000,\n0b111010000,\n0b011001000,\n\n0b100110100,\n0b010111010,\n0b001011001,\n\n0b000100110,\n0b000010111,\n0b000001011,\n]\n\nb = (list(map(int, input().split())) + \n list(map(int, input().split())) +\n list(map(int, input().split())))\n\ns = 0b111111111;\nfor i,bb in enumerate(b):\n if (bb%2==1):\n s = s^a[i]\n\ndef asdf(n):\n return str(int(bool( s & (1<<n))))\n\nprint(asdf(8)+asdf(7)+asdf(6))\nprint(asdf(5)+asdf(4)+asdf(3))\nprint(asdf(2)+asdf(1)+asdf(0))\n\n", "matrix=[]\r\nfor i in range(3):\r\n m=input().split()\r\n for i in range(len(m)):\r\n m[i]=int(m[i])\r\n matrix.append(m)\r\nres_matrix=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n if matrix[i][j]%2==0:\r\n continue\r\n else:\r\n res_matrix[i][j]=int(not(res_matrix[i][j]))\r\n x=i\r\n y=j\r\n if (x-1)>=0:\r\n res_matrix[x-1][y]=int(not(res_matrix[x-1][y]))\r\n if (x+1)<=2:\r\n res_matrix[x+1][y]=int(not(res_matrix[x+1][y]))\r\n if (y-1)>=0:\r\n res_matrix[x][y-1]= int(not(res_matrix[x][y-1]))\r\n if (y+1)<=2:\r\n res_matrix[x][y+1]=int(not(res_matrix[x][y+1]))\r\nfor i in range(3):\r\n for j in range(3):\r\n print(res_matrix[i][j], end='')\r\n print(\" \"),\r\n", "a=[0,0,0]\r\nfor i in range(3):\r\n\ta[i]=list(map(int,input().split()))\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tsum=0\r\n\t\tsum+=a[i][j]\r\n\t\tif(i>0):\r\n\t\t\tsum += a[i - 1][j]\r\n\t\tif (i != 2):\r\n\t\t\tsum += a[i + 1][j]\r\n\t\tif (j > 0):\r\n\t\t\tsum += a[i][j - 1]\r\n\t\tif (j != 2):\r\n\t\t\tsum += a[i][j + 1]\r\n \r\n\t\tprint((1-sum)%2,end='')\r\n \r\n\tprint()", "def x(x, y, matrix):\r\n if matrix[x][y] == 0:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nrow1 = [int(n) for n in input().split()]\r\nrow2 = [int(n) for n in input().split()]\r\nrow3 = [int(n) for n in input().split()]\r\n\r\nm = [\r\n [1, 1, 1],\r\n [1, 1, 1],\r\n [1, 1, 1]\r\n]\r\n\r\nif row1[0] % 2 != 0:\r\n m[0][0], m[0][1], m[1][0] = x(0, 0, m), x(0, 1, m), x(1, 0, m)\r\n\r\nif row1[1] % 2 != 0:\r\n m[0][0], m[0][1], m[0][2], m[1][1] = x(0, 0, m), x(0, 1, m), x(0, 2, m), x(1, 1, m)\r\n\r\nif row1[2] % 2 != 0:\r\n m[0][1], m[0][2], m[1][2] = x(0, 1, m), x(0, 2, m), x(1, 2, m)\r\n\r\nif row2[0] % 2 != 0:\r\n m[0][0], m[1][0], m[2][0], m[1][1] = x(0, 0, m), x(1, 0, m), x(2, 0, m), x(1, 1, m)\r\n\r\nif row2[1] % 2 != 0:\r\n m[1][1], m[0][1], m[1][0], m[1][2], m[2][1] = x(1, 1, m), x(0, 1, m), x(1, 0, m), x(1, 2, m), x(2, 1, m)\r\n\r\nif row2[2] % 2 != 0:\r\n m[0][2], m[1][1], m[1][2], m[2][2] = x(0, 2, m), x(1, 1, m), x(1, 2, m), x(2, 2, m)\r\n\r\nif row3[0] % 2 != 0:\r\n m[2][0], m[1][0], m[2][1] = x(2, 0, m), x(1, 0, m), x(2, 1, m)\r\n\r\nif row3[1] % 2 != 0:\r\n m[2][0], m[2][1], m[2][2], m[1][1] = x(2, 0, m), x(2, 1, m), x(2, 2, m), x(1, 1, m)\r\n\r\nif row3[2] % 2 != 0:\r\n m[2][2], m[2][1], m[1][2] = x(2, 2, m), x(2, 1, m), x(1, 2, m)\r\n\r\nprint(''.join([str(n) for n in m[0]]))\r\nprint(''.join([str(n) for n in m[1]]))\r\nprint(''.join([str(n) for n in m[2]]))", "def f(x):\r\n if x%2==0:\r\n return 0\r\n return 1\r\ndef switch(x):\r\n if x=='1':\r\n return '0'\r\n else:\r\n return '1'\r\n\r\n\r\na1=list(map(int,input().split()))\r\na2=list(map(int,input().split()))\r\na3=list(map(int,input().split()))\r\n\r\nb1=list(map(lambda i:f(i),a1))\r\nb2=list(map(lambda i:f(i),a2))\r\nb3=list(map(lambda i:f(i),a3))\r\n\r\nmatrix=[['1','1','1'],['1','1','1'],['1','1','1']]\r\n\r\nc=[b1,b2,b3]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if c[i][j]==1:\r\n matrix[i][j]=switch(matrix[i][j])\r\n if i==0:\r\n if j==0:\r\n matrix[0][1]=switch(matrix[0][1])\r\n matrix[1][0]=switch(matrix[1][0])\r\n elif j==1:\r\n matrix[0][0]=switch(matrix[0][0]);matrix[0][2]=switch(matrix[0][2])\r\n matrix[1][1]=switch(matrix[1][1])\r\n else:\r\n matrix[0][1]=switch(matrix[0][1])\r\n matrix[1][2]=switch(matrix[1][2])\r\n elif i==1:\r\n if j==0:\r\n matrix[0][0]=switch(matrix[0][0])\r\n matrix[1][1]=switch(matrix[1][1])\r\n matrix[2][0]=switch(matrix[2][0])\r\n elif j==1:\r\n matrix[0][1]=switch(matrix[0][1]);matrix[1][2]=switch(matrix[1][2])\r\n matrix[2][1]=switch(matrix[2][1]);matrix[1][0]=switch(matrix[1][0])\r\n else:\r\n matrix[0][2]=switch(matrix[0][2])\r\n matrix[2][2]=switch(matrix[2][2])\r\n matrix[1][1]=switch(matrix[1][1])\r\n else:\r\n if j==0:\r\n matrix[1][0]=switch(matrix[1][0])\r\n matrix[2][1]=switch(matrix[2][1])\r\n elif j==1:\r\n matrix[2][0]=switch(matrix[2][0]);matrix[2][2]=switch(matrix[2][2])\r\n matrix[1][1]=switch(matrix[1][1])\r\n else:\r\n matrix[2][1]=switch(matrix[2][1])\r\n matrix[1][2]=switch(matrix[1][2])\r\n\r\ns1=''.join(matrix[0]);s2=''.join(matrix[1]);s3=''.join(matrix[2])\r\nprint(s1)\r\nprint(s2)\r\nprint(s3)", "l=[]\r\nfor i in range(3):\r\n x=input().split()\r\n c=[]\r\n for j in range(3):\r\n c.append(int(x[j]))\r\n l.append(c)\r\n#print(l)\r\nm=[['1','1','1'],['1','1','1'],['1','1','1']]\r\ndef toggle(n):\r\n if(n=='0'):\r\n return '1'\r\n else:\r\n return '0'\r\nfor i in range(3):\r\n for j in range(3):\r\n if((l[i][j]%2!=0)):\r\n m[i][j]=toggle(m[i][j])\r\n if(i<2):\r\n m[i+1][j]=toggle(m[i+1][j])\r\n if(i>0):\r\n m[i-1][j]=toggle(m[i-1][j])\r\n if(j<2):\r\n m[i][j+1]=toggle(m[i][j+1])\r\n if(j>0):\r\n m[i][j-1]=toggle(m[i][j-1])\r\n\r\nfor i in range(3):\r\n ans=\"\".join(m[i])\r\n print(ans)\r\n\r\n ", "x1 = [int(x) for x in input().split()]\nx2 = [int(x) for x in input().split()]\nx3 = [int(x) for x in input().split()]\nx11, x12, x13 = x1\nx21, x22, x23 = x2\nx31, x32, x33 = x3\n\nendliste = [[],[],[]]\nif (x11 + x12 + x21) % 2 == 0:\n\tendliste[0].append(\"1\")\nelse:\n\tendliste[0].append(\"0\")\n\nif (x11 + x12 + x13 + x22) % 2 == 0:\n\tendliste[0].append(\"1\")\nelse:\n\tendliste[0].append(\"0\")\n\nif (x13 + x12 + x23) % 2 == 0:\n\tendliste[0].append(\"1\")\nelse:\n\tendliste[0].append(\"0\")\n\nif (x11 + x22 + x31 + x21) % 2 == 0:\n\tendliste[1].append(\"1\")\nelse:\n\tendliste[1].append(\"0\")\n\nif (x22 + x12 + x32 + x21 + x23) % 2 == 0:\n\tendliste[1].append(\"1\")\nelse:\n\tendliste[1].append(\"0\")\n\nif (x23 + x13 + x33 + x22) % 2 == 0:\n\tendliste[1].append(\"1\")\nelse:\n\tendliste[1].append(\"0\")\n\nif (x31 + x21 + x32) % 2 == 0:\n\tendliste[2].append(\"1\")\nelse:\n\tendliste[2].append(\"0\")\n\nif (x32 + x31 + x33 + x22) % 2 == 0:\n\tendliste[2].append(\"1\")\nelse:\n\tendliste[2].append(\"0\")\n\nif (x33 + x32 + x23) % 2 == 0:\n\tendliste[2].append(\"1\")\nelse:\n\tendliste[2].append(\"0\")\n\nfor elem in endliste:\n\tprint(\"\".join(elem))", "class Switch:\r\n def __init__(self, m):\r\n self.matrix = m\r\n \r\n def mod2(self):\r\n for i in range(3):\r\n for j in range(3):\r\n self.matrix[i][j] = self.matrix[i][j] % 2\r\n \r\n def get(self, i, j):\r\n return self.matrix[i][j]\r\n\r\nclass Lights:\r\n def __init__(self):\r\n self.lights = [\r\n [True, True, True],\r\n [True, True, True],\r\n [True, True, True]\r\n ]\r\n\r\n def switch(self, s):\r\n for i in range(3):\r\n for j in range(3):\r\n if s.get(i, j) == 1:\r\n self.lights[i][j] = not self.lights[i][j]\r\n if i > 0: self.lights[i-1][j] = not self.lights[i-1][j]\r\n if i < 2: self.lights[i+1][j] = not self.lights[i+1][j]\r\n if j > 0: self.lights[i][j-1] = not self.lights[i][j-1]\r\n if j < 2: self.lights[i][j+1] = not self.lights[i][j+1]\r\n def print(self):\r\n for i in self.lights:\r\n for j in i:\r\n print(1 if j else 0, end='')\r\n print('')\r\n\r\nl = []\r\nfor i in range(3):\r\n l.append(list(map(int, input().split())))\r\ns = Switch(l)\r\ns.mod2()\r\nlights = Lights()\r\nlights.switch(s)\r\nlights.print()", "l = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\ndi = [0, -1, 0, 1, 0]\r\ndj = [0, 0, -1, 0, 1]\r\nfor i in range(3):\r\n row = list(map(int, input().split()))\r\n for j in range(3):\r\n if row[j] % 2 == 1:\r\n for k in range(5):\r\n ni = i + di[k] # i=1 j=1\r\n nj = j + dj[k]\r\n if ni >= 0 and nj >= 0 and ni < 3 and nj < 3:\r\n l[ni][nj] = 1 - l[ni][nj]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(l[i][j],end='')\r\n print('')", "n = [[1,1,1],[1,1,1],[1,1,1]]\r\nr = []*3\r\nfor i in range(3):\r\n r.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n if r[i][j]>0 and r[i][j]%2!=0:\r\n n[i][j] = 0 if n[i][j]==1 else 1\r\n if j!=2 and j!=0:\r\n n[i][j+1] = 0 if n[i][j+1]==1 else 1\r\n n[i][j-1] = 0 if n[i][j-1]==1 else 1\r\n if i!=2 and i!=0:\r\n n[i+1][j] = 0 if n[i+1][j]==1 else 1\r\n n[i-1][j] = 0 if n[i-1][j]==1 else 1\r\n if j!=2 and j==0:\r\n n[i][j+1] = 0 if n[i][j+1]==1 else 1\r\n if j==2 and j!=0:\r\n n[i][j-1] = 0 if n[i][j-1]==1 else 1\r\n if i!=2 and i==0:\r\n n[i+1][j] = 0 if n[i+1][j]==1 else 1\r\n if i==2 and i!=0:\r\n n[i-1][j] = 0 if n[i-1][j]==1 else 1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(n[i][j],end = \"\")\r\n print()\r\n", "def swap(arr,i,j):\r\n if arr[i][j]==0:\r\n arr[i][j]=1\r\n else:\r\n arr[i][j]=0\r\n\r\narr=[[1,1,1],[1,1,1],[1,1,1]]\r\nnum=[]\r\na,b,c=map(int,input().split())\r\nnum.append([a,b,c])\r\na,b,c=map(int,input().split())\r\nnum.append([a,b,c])\r\na,b,c=map(int,input().split())\r\nnum.append([a,b,c])\r\nfor i in range(3):\r\n for j in range(3):\r\n if num[i][j]%2==0:\r\n continue\r\n swap(arr,i,j)\r\n if i-1>=0:\r\n swap(arr,i-1,j)\r\n if i+1<3:\r\n swap(arr,i+1,j)\r\n if j-1>=0:\r\n swap(arr,i,j-1)\r\n if j+1<3:\r\n swap(arr,i,j+1)\r\nfor i in arr:\r\n print(*i,sep=\"\") \r\n", "lights = [[1 for i in range(3)] for j in range(3)]\r\nflips = []\r\n\r\nfor i in range(3):\r\n flips.append(list(map(int, input().split())))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n flip = flips[i][j]\r\n lights[i][j] += flip\r\n if i + 1 < 3:\r\n lights[i+1][j] += flip\r\n if i - 1 >= 0:\r\n lights[i-1][j] += flip\r\n if j + 1 < 3:\r\n lights[i][j+1] += flip\r\n if j - 1 >= 0:\r\n lights[i][j-1] += flip\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n lights[i][j] %= 2\r\n print(lights[i][j], end = '')\r\n print()\r\n", "tbmatrix = []\r\nlights = []\r\n\r\nlightsys = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\n\r\n\r\nfor i in range(3):\r\n x = str(input())\r\n p = x.split(\" \")\r\n t = []\r\n for i2 in range(len(p)):\r\n t.append(p[i2])\r\n if int(p[i2]) > 0:\r\n lights.append(str(i)+\" \"+str(i2)+\" \"+str(p[i2]))\r\n tbmatrix.append(t)\r\n\r\n\r\nfor i in range(len(lights)):\r\n xt = lights[i].split(\" \")\r\n x = int(xt[0])\r\n y = int(xt[1])\r\n z = int(xt[2])\r\n\r\n if x + 1 < 3:\r\n if lightsys[x+1][y] == 0 and z%2 != 0:\r\n lightsys[x+1][y] = 1\r\n elif z%2 != 0:\r\n lightsys[x+1][y] = 0\r\n\r\n if x - 1 > -1:\r\n if lightsys[x-1][y] == 0 and z%2 != 0:\r\n lightsys[x-1][y] = 1\r\n elif z%2 != 0:\r\n lightsys[x-1][y] = 0\r\n\r\n if y + 1 < 3:\r\n if lightsys[x][y+1] == 0 and z%2 != 0:\r\n lightsys[x][y+1] = 1\r\n elif z%2 != 0:\r\n lightsys[x][y+1] = 0\r\n\r\n if y - 1 > -1:\r\n if lightsys[x][y-1] == 0 and z%2 != 0:\r\n lightsys[x][y-1] = 1\r\n elif z%2 != 0:\r\n lightsys[x][y-1] = 0\r\n if lightsys[x][y] == 0 and z%2 != 0:\r\n lightsys[x][y] = 1\r\n elif z%2 != 0:\r\n lightsys[x][y] = 0\r\n\r\nfor i in range(len(lightsys)):\r\n for i2 in range(len(lightsys[i])):\r\n lightsys[i][i2] = str(lightsys[i][i2])\r\n\r\nr1 = \"\".join(lightsys[0])\r\nr2 = \"\".join(lightsys[1])\r\nr3 = \"\".join(lightsys[2])\r\n \r\nprint(r1+\"\\n\"+r2+\"\\n\"+r3)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Dec 16 09:44:25 2022\r\n\r\n@author: Rami\r\n\r\n\"\"\"\r\ndef toggle(arr,i,j):\r\n if arr[i][j] == \"0\":\r\n arr[i][j]=\"1\"\r\n else:\r\n arr[i][j]=\"0\"\r\n\r\ninit = [[\"1\",\"1\",\"1\"],\r\n [\"1\",\"1\",\"1\"],\r\n [\"1\",\"1\",\"1\"]]\r\n\r\nmatrix = [[int(x) for x in input().split()]\r\n ,[int(x) for x in input().split()]\r\n ,[int(x) for x in input().split()]]\r\n\r\ntest = [0,1,2]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(matrix[i][j]):\r\n up = i - 1\r\n left = j - 1\r\n right = j+ 1\r\n down = i + 1\r\n toggle(init,i,j)\r\n if up in test:\r\n toggle(init,up,j)\r\n if(left in test):\r\n toggle(init,i,left)\r\n if(right in test):\r\n toggle(init,i,right)\r\n if(down in test):\r\n toggle(init,down,j)\r\nfor i in range(3):\r\n print(\"\".join(init[i]))\r\n \r\n", "l=[]\r\nl2=[]\r\ns=''\r\np=''\r\nr=''\r\nfor i in range(3):\r\n li=list(map(int,input().split()))\r\n l.append(li)\r\ns1=l[0][0]+l[0][1]+l[1][0]\r\nl2.append(s1)\r\ns2=l[0][0]+l[0][1]+l[0][2]+l[1][1]\r\nl2.append(s2)\r\ns3=l[0][1]+l[0][2]+l[1][2]\r\nl2.append(s3)\r\ns4=l[0][0]+l[1][0]+l[1][1]+l[2][0]\r\nl2.append(s4)\r\ns5=l[0][1]+l[1][0]+l[1][1]+l[1][2]+l[2][1]\r\nl2.append(s5)\r\ns6=l[0][2]+l[1][1]+l[1][2]+l[2][2]\r\nl2.append(s6)\r\ns7=l[1][0]+l[2][0]+l[2][1]\r\nl2.append(s7)\r\ns8=l[1][1]+l[2][0]+l[2][1]+l[2][2]\r\nl2.append(s8)\r\ns9=l[1][2]+l[2][1]+l[2][2]\r\nl2.append(s9)\r\nfor i in range(0,9):\r\n if 0<=i<=2:\r\n if l2[i]%2==0:\r\n s+='1'\r\n else:\r\n s+='0'\r\n if 3<=i<=5:\r\n if l2[i]%2==0:\r\n p+='1'\r\n else:\r\n p+='0'\r\n if 6<=i<=8:\r\n if l2[i]%2==0:\r\n r+='1'\r\n else:\r\n r+='0'\r\nprint(s)\r\nprint(p)\r\nprint(r)\r\n", "board = [[1,1,1],\r\n [1,1,1],\r\n [1,1,1]]\r\n\r\ndef print_board(board):\r\n '''\r\n print out board\r\n '''\r\n for bulb in board:\r\n print(f\"{bulb[0]}{bulb[1]}{bulb[2]}\")\r\n\r\ndef switch(row, bulb):\r\n '''\r\n swiches light\r\n '''\r\n if board[row][bulb] == 0:\r\n board[row][bulb] = 1\r\n else:\r\n board[row][bulb] = 0\r\n\r\ndef lights_change(board, row, bulb):\r\n '''\r\n checks which lights will be changed and switches them\r\n '''\r\n switch(row, bulb)\r\n if bulb > 0 :\r\n switch(row, bulb-1) \r\n if bulb < 2 :\r\n switch(row, bulb+1) \r\n if row < 2:\r\n switch(row+1, bulb) \r\n if row > 0:\r\n switch(row-1, bulb) \r\n \r\nfor row in range(3):\r\n instructions = input().split()\r\n for bulb in range(3):\r\n for i in range(int(instructions[bulb])):\r\n lights_change(board, row, bulb)\r\n\r\nprint_board(board)", "lights = [[0,0,0,0,0] for i in range(5)]\r\non_off = [\"\" for i in range(3)]\r\nfor i in range(3):\r\n lights[i+1][1], lights[i+1][2], lights[i+1][3] = map(int,input().split())\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if (lights[i][j]+lights[i+1][j]+lights[i][j+1]+lights[i-1][j]+lights[i][j-1]) %2 == 0:\r\n on_off[i-1] += '1'\r\n else: on_off[i-1] +='0'\r\nfor i in range(3): print(on_off[i])", "lamp = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\nn = len(lamp[0])\r\nsw = []\r\nfor i in range(n):\r\n sw.append(list(map(int, input().split())))\r\n\r\nfor i in range(n):\r\n swi = sw[i]\r\n for j in range(len(swi)):\r\n if swi[j] % 2 != 0:\r\n lamp[i][j] = (lamp[i][j] + 1) % 2\r\n i1, i2, j1, j2 = i - 1, i + 1, j - 1, j + 1\r\n if i1 >= 0:\r\n lamp[i1][j] = (lamp[i1][j] + 1) % 2\r\n if i2 < n:\r\n lamp[i2][j] = (lamp[i2][j] + 1) % 2\r\n if j1 >= 0:\r\n lamp[i][j1] = (lamp[i][j1] + 1) % 2\r\n if j2 < n:\r\n lamp[i][j2] = (lamp[i][j2] + 1) % 2\r\n\r\nfor lm in lamp:\r\n print(*lm, sep=\"\")", "l = list()\r\n \r\ndx = [ 0, -1, 1, 0, 0]\r\ndy = [-1, 0, 0, 1, 0]\r\n \r\nfor i in range(3):\r\n l.append(list(map(int, input().split())))\r\n \r\nc = list(list(1 for _ in range(3)) for _ in range(3))\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if l[i][j] % 2 == 1:\r\n for k in range(5):\r\n x = j + dx[k]\r\n y = i + dy[k]\r\n if y >= 0 and y < 3 and x >= 0 and x < 3:\r\n c[y][x] = abs(1 - c[y][x])\r\n \r\nfor x in c:\r\n print(\"\".join(str(i) for i in x))", "def tog(i, j, lights):\r\n if lights[i][j] == 1:\r\n lights[i][j] = 0\r\n else:\r\n lights[i][j] = 1\r\n\r\ndef lights_out():\r\n # input\r\n lights = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n inp = []\r\n result = []\r\n for i in range(3):\r\n row = inp.append(list(map(int, input().split())))\r\n \r\n # main\r\n for i in range(3):\r\n for j in range(3):\r\n toggled = inp[i][j]\r\n for k in range(toggled):\r\n tog(i, j, lights)\r\n if j != 0:\r\n tog(i, j - 1, lights)\r\n if j != len(lights[0])-1:\r\n tog(i, j+1, lights)\r\n if i != 0:\r\n tog(i-1, j, lights)\r\n if i != len(lights)-1:\r\n tog(i+1, j, lights)\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n if j != 2:\r\n print(lights[i][j], end=\"\")\r\n else:\r\n print(lights[i][j])\r\n\r\nlights_out()", "one , two , three = map(int,input().split())\r\nfour , five , six = map(int,input().split())\r\nseven , eight , nine = map(int,input().split())\r\n\r\ndef calculator(a , b , c , d = 0 , e = 0) : return ((1 + a + b + c + d + e) % 2)\r\n\r\nprint(calculator(one , two , four) , end=\"\")\r\nprint(calculator(one , two , three , five) , end=\"\") \r\nprint(calculator(three , two , six) , end=\"\")\r\nprint()\r\nprint(calculator(one , four , five , seven) , end=\"\")\r\nprint(calculator(five , two , four , eight , six ), end=\"\")\r\nprint(calculator(six , three , five , nine) , end=\"\")\r\nprint()\r\nprint(calculator(seven , four , eight) , end=\"\")\r\nprint(calculator(eight , seven , nine , five) , end=\"\")\r\nprint(calculator(nine , six , eight) , end=\"\")\r\n", "def solve(matrix):\r\n ans = []\r\n row = len(matrix)\r\n col = len(matrix[0])\r\n \r\n for i in range(row):\r\n ans_row = \"\"\r\n for j in range(col):\r\n \r\n count = matrix[i][j]\r\n \r\n if i + 1 < row:\r\n count += matrix[i + 1][j]\r\n if i - 1 >= 0:\r\n count += matrix[i - 1][j]\r\n if j + 1 < col:\r\n count += matrix[i][j + 1]\r\n if j - 1 >= 0:\r\n count += matrix[i][j - 1]\r\n \r\n if count % 2 == 0:\r\n ans_row += \"1\"\r\n else:\r\n ans_row += \"0\"\r\n ans.append(ans_row)\r\n return ans\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # first_input = int(input())\r\n matrix = []\r\n n = 3\r\n \r\n for _ in range(n):\r\n grid_item = list(map(int, input().split()))\r\n matrix.append(grid_item)\r\n \r\n result = solve(matrix)\r\n print(\"\\n\".join(result))", "grid = []\r\nfor i in range(3):\r\n grid.append(list(map(int, input().split())))\r\nlights = [[1 for i in range(3)] for j in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n lights[i][j] += grid[i][j]\r\n if (i > 0):\r\n lights[i][j] += grid[i-1][j]\r\n if (i < 2):\r\n lights[i][j] += grid[i+1][j]\r\n if (j > 0):\r\n lights[i][j] += grid[i][j-1]\r\n if (j < 2):\r\n lights[i][j] += grid[i][j+1]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n lights[i][j] = lights[i][j] % 2\r\n print(lights[i][j], end=\"\")\r\n print()\r\n", "board = []\r\nfor j in range(3):\r\n new = [int(i) for i in input().split()]\r\n board.append(new)\r\ndef op(n):\r\n return 1-n\r\nstate = [[1]*3 for i in range(3)]\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if board[i][j]%2 != 0:\r\n state[i][j] = op(state[i][j])\r\n if i > 0:\r\n state[i-1][j] =op(state[i-1][j])\r\n if j > 0:\r\n state[i][j-1] = op(state[i][j-1])\r\n if j < 2:\r\n state[i][j+1] = op(state[i][j+1])\r\n if i < 2:\r\n state[i+1][j] = op(state[i+1][j])\r\n \r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(state[i][j], end=\"\")\r\n print()", "a = []\r\nl = [[1] * 3 for _ in range(3)]\r\nfor i in range(3):\r\n a.append(list(map(int, input().split())))\r\nx = [-1, 1, 0, 0]\r\ny = [0, 0, -1, 1]\r\nfor i in range(3):\r\n for j in range(3):\r\n t = a[i][j]\r\n for k in range(4):\r\n ii, jj = i + x[k], j + y[k]\r\n if ii >= 0 and ii < 3 and jj >= 0 and jj < 3:\r\n t += a[ii][jj]\r\n l[i][j] = l[i][j] if t % 2 == 0 else 1 - l[i][j]\r\nfor i in range(3):\r\n print(''.join(str(x) for x in l[i]))", "matrix = []\r\nfor i in range(3):\r\n\trow = list(map(int, input().split()))\r\n\tmatrix.append(row)\r\nans = [[0 for i in range(3)]for i in range(3)]\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tans[i][j] += matrix[i][j]\r\n\t\tif(i+1 < 3):\r\n\t\t\tans[i][j] += matrix[i+1][j]\r\n\t\tif(i-1 >= 0):\r\n\t\t\t ans[i][j] += matrix[i-1][j]\r\n\t\tif(j+1 < 3):\r\n\t\t\tans[i][j] += matrix[i][j+1]\r\n\t\tif(j-1 >= 0):\r\n\t\t\t ans[i][j] += matrix[i][j-1]\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif(ans[i][j] % 2 == 0):\r\n\t\t\tprint(1, end = \"\")\r\n\t\telse:\r\n\t\t\tprint(0, end=\"\")\r\n\tprint()", "lst = [[1, 1, 1], [1,1,1], [1,1,1]]\na = [list(map(int, input().split())) for i in range(3)]\nfor i in range(3):\n for j in range(3):\n if (i == 0 and j == 0):\n res = a[i][j] + a[i+1][j] + a[i][j+1]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 0 and j == 1):\n res = a[i][j] + a[i][j-1] + a[i][j+1] + a[i+1][j]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 0 and j == 2):\n res = a[i][j] + a[i][j-1] + a[i+1][j]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 1 and j == 0):\n res = a[i][j] + a[i][j+1] + a[i-1][j] + a[i+1][j]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 1 and j == 1):\n res = a[i][j] + a[i][j+1] + a[i][j-1] + a[i-1][j] + a[i+1][j]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 1 and j == 2):\n res = a[i][j] + a[i-1][j] + a[i+1][j] + a[i][j-1]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 2 and j == 0):\n res = a[i][j] + a[i][j+1] + a[i-1][j]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 2 and j == 1):\n res = a[i][j] + a[i-1][j] + a[i][j-1] + a[i][j+1]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\n elif (i == 2 and j == 2):\n res = a[i][j] + a[i-1][j] + a[i][j-1]\n if (res % 2 == 0 ):\n lst[i][j] = 1\n else:\n lst[i][j] = 0\nfor i in range(3):\n for j in range(3):\n print(lst[i][j], end = \"\")\n print()\n \n", "grid = [[1 for j in range(3)] for i in range(3)]\r\ni_grid = []\r\nfor _ in range(3):\r\n i_grid.append(list(map(int, input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n if i_grid[i][j] != 0:\r\n if i_grid[i][j] % 2 != 0:\r\n grid[i][j] = 1 if grid[i][j] == 0 else 0\r\n if j + 1 < 3:\r\n grid[i][j+1] = 1 if grid[i][j+1] == 0 else 0\r\n if j - 1 >= 0:\r\n grid[i][j-1] = 1 if grid[i][j-1] == 0 else 0\r\n if i - 1 >= 0:\r\n grid[i-1][j] = 1 if grid[i-1][j] == 0 else 0\r\n if i + 1 < 3:\r\n grid[i+1][j] = 1 if grid[i+1][j] == 0 else 0\r\nfor i in grid:\r\n for j in i:\r\n print(j, end=\"\")\r\n print()", "l=[list(map(int,input().split())),list(map(int,input().split())),list(map(int,input().split()))]\r\na=[[1]*3,[1]*3,[1]*3]\r\ndef f(a):\r\n if a==1:\r\n a=0\r\n elif a==0:\r\n a=1\r\n return a\r\nfor i in range(3):\r\n for j in range(3):\r\n l[i][j]%=2\r\n if l[i][j]==1:\r\n if i==0 and j==0:\r\n a[i][j]=f(a[i][j])\r\n a[i+1][j]=f(a[i+1][j])\r\n a[i][j+1]=f(a[i][j+1])\r\n if i==2 and j==0:\r\n a[i][j]=f(a[i][j])\r\n a[i-1][j]=f(a[i-1][j])\r\n a[i][j+1]=f(a[i][j+1])\r\n if i==2 and j==2:\r\n a[i][j]=f(a[i][j])\r\n a[i-1][j]=f(a[i-1][j])\r\n a[i][j-1]=f(a[i][j-1])\r\n if i==0 and j==2:\r\n a[i][j]=f(a[i][j])\r\n a[i+1][j]=f(a[i+1][j])\r\n a[i][j-1]=f(a[i][j-1])\r\n if i==0 and j==1:\r\n a[i][j]=f(a[i][j])\r\n a[i+1][j]=f(a[i+1][j])\r\n a[i][j+1]=f(a[i][j+1])\r\n a[i][j-1]=f(a[i][j-1])\r\n if i==1 and j==0:\r\n a[i][j]=f(a[i][j])\r\n a[i+1][j]=f(a[i+1][j])\r\n a[i-1][j]=f(a[i-1][j])\r\n a[i][j+1]=f(a[i][j+1])\r\n if i==2 and j==1:\r\n a[i][j]=f(a[i][j])\r\n a[i-1][j]=f(a[i-1][j])\r\n a[i][j+1]=f(a[i][j+1])\r\n a[i][j-1]=f(a[i][j-1])\r\n if i==1 and j==2:\r\n a[i][j]=f(a[i][j])\r\n a[i+1][j]=f(a[i+1][j])\r\n a[i-1][j]=f(a[i-1][j])\r\n a[i][j-1]=f(a[i][j-1])\r\n if i==1 and j==1:\r\n a[i][j]=f(a[i][j])\r\n a[i+1][j]=f(a[i+1][j])\r\n a[i-1][j]=f(a[i-1][j])\r\n a[i][j+1]=f(a[i][j+1])\r\n a[i][j-1]=f(a[i][j-1])\r\nfor i in range(3):\r\n for j in range(3):\r\n print(a[i][j],end='')\r\n print() \r\n ", "arr = []\r\nfor i in range(3):\r\n items = [int(x) for x in input().split()]\r\n arr.append(items)\r\n\r\nY = len(arr)\r\nX = len(arr[0])\r\n\r\nout = [[1 for _ in range(X)] for _ in range(Y)]\r\n\r\ndef transitions(y,x):\r\n yield y,x\r\n yield y,x+1\r\n yield y,x-1\r\n yield y+1,x\r\n yield y-1,x\r\n\r\ndef valid_transitions(y0,x0):\r\n for y,x in transitions(y0,x0):\r\n if 0 <= y < Y and 0 <= x < X:\r\n yield y,x\r\n\r\n\r\nfor y in range(Y):\r\n for x in range(X):\r\n total = 0\r\n for y1,x1 in valid_transitions(y,x):\r\n total += arr[y1][x1]\r\n out[y][x] = 1 if total % 2 == 0 else 0\r\n\r\nfor xs in out:\r\n xs = map(str, xs)\r\n print(\"\".join(xs))", "t = [[0 for i in range(5)]]\r\nt += [[int(v) for v in ['0']+input().split()+['0']] for i in range(3)]\r\nt += [[0 for i in range(5)]]\r\nl = [[1 for i in range(3)] for j in range(3)]\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n l[i-1][j-1] = (1 + t[i][j] + t[i-1][j] + t[i+1][j] + t[i][j-1] + t[i][j+1]) % 2\r\n \r\nfor i in range(3):\r\n for j in range(3): print(l[i][j], end='')\r\n print()", "arr = [[1, 1, 1] for i in range(3)]\r\ntmp = [[0, 0, 0] for i in range(3)]\r\n\r\nfor i in range(3):\r\n inp = list(map(int, input().split()))\r\n for j in range(3):\r\n tmp[i][j] = inp[j]\r\n if tmp[i][j] % 2 != 0:\r\n if arr[i][j]: arr[i][j] = 0\r\n else: arr[i][j] = 1\r\n\r\n if i != 0:\r\n if arr[i-1][j]: arr[i-1][j] = 0\r\n else: arr[i-1][j] = 1\r\n if i != 2:\r\n if arr[i+1][j]: arr[i+1][j] = 0\r\n else: arr[i+1][j] = 1\r\n if j != 0:\r\n if arr[i][j-1]: arr[i][j-1] = 0\r\n else: arr[i][j-1] = 1\r\n if j != 2:\r\n if arr[i][j+1]: arr[i][j+1] = 0\r\n else: arr[i][j+1] = 1\r\n\r\n\r\nfor i in range(3): \r\n for j in range(3):\r\n print(arr[i][j], end=\"\")\r\n print()\r\n ", "grid = [list(map(int, input().split())) for _ in range(3)]\n# print(grid)\n\ngrid_normalized = [[value % 2 for value in row] for row in grid]\n\ndef print_nice(g):\n\tprint('\\n'.join([''.join(map(str, row)) for row in g]))\n\n# print_nice(grid_normalized)\n\noffsets = [(0, 0), (0, 1), (1, 0), (0, -1), (-1, 0)]\n\nstate = [[1 for _ in range(3)] for _ in range(3)]\n\ndef in_the_box(x, y):\n\treturn x < 3 and x >= 0 and y < 3 and y >= 0 \n\nfor i in range(3):\n\tfor j in range(3):\n\t\ttoggled = grid_normalized[i][j]\n\t\tif not toggled:\n\t\t\tcontinue\n\t\tfor di, dj in offsets:\n\t\t\tlight_i = i + di\n\t\t\tlight_j = j + dj\n\t\t\tif not in_the_box(light_i, light_j):\n\t\t\t\tcontinue\n\t\t\tstate[light_i][light_j] ^= 1\nprint_nice(state)\n", "grid=[[1]*3 for _ in range(3)]\r\nnums=[[0]*3 for _ in range(3)]\r\nfor i in range(3):\r\n nums[i]=list(map(int,input().split()))\r\nfor j in range(3):\r\n for k in range(3):\r\n if nums[j][k]>0 and nums[j][k]%2!=0:\r\n grid[j][k]^=1\r\n if j==0:\r\n if k==0:\r\n grid[j+1][k]^=1\r\n grid[j][k+1]^=1\r\n elif k==2:\r\n grid[j][k-1]^=1\r\n grid[j+1][k]^=1\r\n else:\r\n grid[j+1][k]^=1\r\n grid[j][k-1]^=1\r\n grid[j][k+1]^=1\r\n if j==1:\r\n if k==0:\r\n grid[j+1][k]^=1\r\n grid[j-1][k]^=1\r\n grid[j][k+1]^=1\r\n elif k==1:\r\n grid[j][k+1]^=1\r\n grid[j][k-1]^=1\r\n grid[j+1][k]^=1\r\n grid[j-1][k]^=1\r\n else:\r\n grid[j+1][k]^=1\r\n grid[j-1][k]^=1\r\n grid[j][k-1]^=1\r\n if j==2:\r\n if k==0:\r\n grid[j][k+1]^=1\r\n grid[j-1][k]^=1\r\n elif k==1:\r\n grid[j][k-1]^=1\r\n grid[j][k+1]^=1\r\n grid[j-1][k]^=1\r\n else:\r\n grid[j][k-1]^=1\r\n grid[j-1][k]^=1\r\nfor t in range(3):\r\n for j in range(3):\r\n print(grid[t][j],end='')\r\n print(' ')", "matrix = []\r\nfor i in range(3):\r\n row = list(map(int,input().split()))\r\n matrix.append(row)\r\n\r\ngrid = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] % 2 == 1:\r\n grid[i][j] = int(not grid[i][j])\r\n if i > 0:\r\n grid[i - 1][j] = int(not grid[i - 1][j])\r\n if i < 2:\r\n grid[i + 1][j] = int(not grid[i + 1][j])\r\n if j > 0:\r\n grid[i][j - 1] = int(not grid[i][j - 1])\r\n if j < 2:\r\n grid[i][j + 1] = int(not grid[i][j + 1])\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(grid[i][j], end=\"\")\r\n print()\r\n", "t = []\r\nfor i in range(3):\r\n\ta=[]\r\n\tfor j in range(3):\r\n\t\ta.append(0)\r\n\tt.append(a)\r\n \r\nfor i in range(3):\r\n\tk = list(map(int,input().split()))\r\n\tfor j in range(3):\r\n\t\tt[i][j]+=k[j]\r\n\t\tif i-1>=0:\r\n\t\t\tt[i-1][j]+=k[j]\r\n\t\tif i+1<3:\r\n\t\t\tt[i+1][j]+=k[j]\r\n\t\tif j-1>=0:\r\n\t\t\tt[i][j-1]+=k[j]\r\n\t\tif j+1<3:\r\n\t\t\tt[i][j+1]+=k[j]\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif t[i][j]%2==0:\r\n\t\t\tprint(\"1\",end=\"\")\r\n\t\telse:\r\n\t\t\tprint(\"0\",end=\"\")\r\n\tprint(\"\")", "def getToggleCase(row, clm):\r\n global toggles, lights\r\n\r\n toggles[row][clm] -= 1\r\n\r\n if row == 0:\r\n if clm == 0:\r\n toggle(row, clm)\r\n toggle(row, clm + 1)\r\n toggle(row + 1, clm)\r\n elif clm == 1:\r\n toggle(row, clm)\r\n toggle(row, clm + 1)\r\n toggle(row, clm - 1)\r\n toggle(row + 1, clm)\r\n elif clm == 2:\r\n toggle(row, clm)\r\n toggle(row, clm - 1)\r\n toggle(row + 1, clm)\r\n elif row == 1:\r\n if clm == 0:\r\n toggle(row, clm)\r\n toggle(row - 1, clm)\r\n toggle(row + 1, clm)\r\n toggle(row, clm + 1)\r\n elif clm == 1:\r\n toggle(row, clm)\r\n toggle(row - 1, clm)\r\n toggle(row, clm - 1)\r\n toggle(row, clm + 1)\r\n toggle(row + 1, clm)\r\n elif clm == 2:\r\n toggle(row, clm)\r\n toggle(row - 1, clm)\r\n toggle(row + 1, clm)\r\n toggle(row, clm - 1)\r\n elif row == 2:\r\n if clm == 0:\r\n toggle(row, clm)\r\n toggle(row - 1, clm)\r\n toggle(row, clm + 1)\r\n elif clm == 1:\r\n toggle(row, clm)\r\n toggle(row - 1, clm)\r\n toggle(row, clm - 1)\r\n toggle(row, clm + 1)\r\n elif clm == 2:\r\n toggle(row, clm)\r\n toggle(row - 1, clm)\r\n toggle(row, clm - 1)\r\n\r\ndef toggle(row, clm):\r\n global lights\r\n\r\n if lights[row][clm] == 0:\r\n lights[row][clm] = 1\r\n else:\r\n lights[row][clm] = 0\r\n\r\nif __name__ == \"__main__\":\r\n toggles = []\r\n lights = [[1 for i in range(3)] for j in range(3)]\r\n\r\n for r in range(3):\r\n toggles.append(list(map(int, input().rstrip().split())))\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n while toggles[i][j] > 0:\r\n getToggleCase(i, j)\r\n \r\n print(''.join(str(x) for x in lights[0]))\r\n print(''.join(str(x) for x in lights[1]))\r\n print(''.join(str(x) for x in lights[2]))\r\n", "import copy\r\nlst=[]\r\nlst1=[]\r\nfor i in range(3):\r\n a,b,c=[int(x) for x in input().split()]\r\n lst.append(a)\r\n lst.append(b)\r\n lst.append(c)\r\n\r\nfor i in range(9):\r\n lst[i] = lst[i]%2\r\n\r\nlst1 = lst.copy()\r\nfor i in range(0,9):\r\n if lst[i] == 1:\r\n if i!=2 and i!=5 and i!=8:\r\n # 0,1,3,4,6,7 (not (2,5,8))\r\n lst1[i+1] += 1\r\n if i<=5:\r\n # 0,1,2,3,4,5\r\n lst1[i+3] += 1\r\n if i%3!=0:\r\n # 1,2,4,5,7,8 (not 0,3,6)\r\n lst1[i-1] += 1\r\n if i>=3:\r\n # 3,4,5,6,7,8\r\n lst1[i-3] += 1\r\n\r\nfor i in range(9):\r\n lst1[i] = lst1[i]%2\r\n if lst1[i] == 1:\r\n lst1[i] = 0\r\n else:\r\n lst1[i] = 1\r\n\r\nst = ''.join(str(x) for x in lst1)\r\nprint('{} \\n{} \\n{}'.format(st[0:3],st[3:6],st[6:9]))", "res = [[1, 1, 1] for _ in range(3)]\r\n# print(a)\r\noperations = [[0, 0, 0, 0, 0] for _ in range(5)]\r\nfor i in range(3):\r\n operations[i][0], operations[i][1], operations[i][2] = map(int, (input().split()))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n res[i][j] = (operations[i][j] + operations[i + 1][j] + operations[i - 1][j] + operations[i][j + 1] +\r\n operations[i][j - 1]) % 2 == 0\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(int(res[i][j]), end='')\r\n print()\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n B = []\r\n for i in range(n):\r\n B.append([1] * n)\r\n for i in range(n):\r\n for j in range(n):\r\n A[i][j] %= 2\r\n if A[i][j]:\r\n B[i][j] ^= 1\r\n if i - 1 >= 0:\r\n B[i-1][j] ^= 1\r\n if i + 1 < n:\r\n B[i+1][j] ^= 1\r\n if j - 1 >= 0:\r\n B[i][j-1] ^= 1\r\n if j + 1 < n:\r\n B[i][j+1] ^= 1\r\n return B\r\n\r\ndef main():\r\n A = []\r\n for i in range(3):\r\n A.append(list(map(int, input().split())))\r\n ans = solve(A)\r\n for i in range(len(ans)):\r\n print(''.join(list(str(a) for a in ans[i])))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "state = [[1]*3 for _ in range(3)]\r\npresses = [list(map(int, input().split())) for _ in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if presses[i][j] % 2 == 1:\r\n for x, y in [(0, 0), (0, -1), (0, 1), (-1, 0), (1, 0)]:\r\n if 0 <= i+x < 3 and 0 <= j+y < 3:\r\n state[i+x][j+y] = 1 - state[i+x][j+y]\r\n\r\n\r\nfor row in state:\r\n print(''.join(map(str, row)))\r\n", "m=[]\r\nfor x in range(3):\r\n m.append([int(x)%2 for x in input().split()])\r\ni=0\r\n#print(m)\r\nfor i in range(3):\r\n j=0\r\n state=0\r\n c_out=\"\"\r\n for j in range(3):\r\n state = m[i][j]\r\n\r\n if i!=0:\r\n state+=m[i-1][j]\r\n if i!=2:\r\n state+=m[i+1][j]\r\n if j!=0:\r\n state+=m[i][j-1]\r\n if j!=2:\r\n state+=m[i][j+1]\r\n \r\n if state%2:\r\n c_out+=\"0\"\r\n else:\r\n c_out+=\"1\"\r\n print(c_out)\r\n\r\n ", "a=[]\r\nfor i in range(3):\r\n a1=list(map(int,input().split()))\r\n a.append(a1)\r\nb=[[0,0,0],[0,0,0],[0,0,0]]\r\nif((a[0][0]+a[0][1]+a[1][0])%2==0):\r\n b[0][0]=1\r\nif((a[0][1]+a[0][0]+a[0][2]+a[1][1])%2==0):\r\n b[0][1]=1\r\nif((a[0][2]+a[0][1]+a[1][2])%2==0):\r\n b[0][2]=1\r\nif((a[1][0]+a[0][0]+a[2][0]+a[1][1])%2==0):\r\n b[1][0]=1\r\nif((a[1][1]+a[1][0]+a[1][2]+a[0][1]+a[2][1])%2==0):\r\n b[1][1]=1\r\nif((a[1][2]+a[0][2]+a[2][2]+a[1][1])%2==0):\r\n b[1][2]=1\r\nif((a[2][0]+a[1][0]+a[2][1])%2==0):\r\n b[2][0]=1\r\nif((a[2][1]+a[2][0]+a[2][2]+a[1][1])%2==0):\r\n b[2][1]=1\r\nif((a[2][2]+a[2][1]+a[1][2])%2==0):\r\n b[2][2]=1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(b[i][j],end=\"\")\r\n print()", "a = []\r\nfor i in range(3):\r\n b = list(map(int, input().split()))\r\n a.append(b)\r\nd = []\r\nfor i in range(3):\r\n c = []\r\n for j in range(3):\r\n if(i==1 and j==1):\r\n if((a[0][1]+a[1][0]+a[1][1]+a[1][2]+a[2][1])%2==0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n else:\r\n if(i==0 and j==0):\r\n if((a[i][j]+a[i][j+1]+a[i+1][j])%2==0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n elif(i==0 and j==2):\r\n if((a[i][j-1]+a[i][j]+a[i+1][j])%2==0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n elif (i == 2 and j == 0):\r\n if ((a[i][j] + a[i-1][j] + a[i][j+1]) % 2 == 0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n elif (i == 2 and j == 2):\r\n if ((a[i][j - 1] + a[i][j] + a[i-1][j]) % 2 == 0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n elif(i==0 and j==1):\r\n if((a[i][j-1]+a[i][j]+a[i][j+1]+a[i+1][j])%2==0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n elif (i == 2 and j == 1):\r\n if ((a[i][j - 1] + a[i][j] + a[i][j + 1] + a[i - 1][j]) % 2 == 0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n elif (i == 1 and j == 0):\r\n if ((a[i+1][j] + a[i][j] + a[i][j + 1] + a[i - 1][j]) % 2 == 0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n else:\r\n if((a[i-1][j]+a[i][j]+a[i+1][j]+a[i][j-1])%2==0):\r\n c.append(1)\r\n else:\r\n c.append(0)\r\n print(*c,sep='')\r\n", "mat=[]\r\nc=[]\r\n\r\nfor i in range(3):\r\n a=list(map(int,input().split()))\r\n mat.append(a)\r\n \r\nfor i in range(4):\r\n a=[]\r\n for j in range(4):\r\n a.append(0)\r\n c.append(a)\r\n#print(c)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n c[i][j]+=mat[i][j]\r\n try:\r\n c[i+1][j]+=mat[i][j]\r\n except:\r\n m=0\r\n try:\r\n c[i][j+1]+=mat[i][j]\r\n except:\r\n m=0\r\n try:\r\n c[i-1][j]+=mat[i][j]\r\n except:\r\n m=0\r\n try:\r\n c[i][j-1]+=mat[i][j]\r\n except:\r\n m=0\r\n\r\n #print(c)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(c[i][j]%2==0):\r\n c[i][j]=1\r\n else:\r\n c[i][j]=0\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(c[i][j],end=\"\")\r\n print()\r\n", "init = [[0 for i in range(5)] for i in range(5)]\r\nfin = [[0 for i in range(5)] for i in range(5)]\r\nfor i in range(1,4):\r\n l = list(map(int,input().split()))\r\n for j in range(1,4):\r\n init[i][j] = l[j-1]\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n fin[i][j] = init[i][j] + init[i-1][j] + init[i+1][j] + init[i][j-1] + init[i][j+1]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if fin[i][j]%2 == 0:\r\n print(1,end = '')\r\n else: print(0, end='')\r\n print('\\n', end = '')", "a=[]\r\nlights=[[1,1,1]*3]\r\ns=''\r\nfor _ in range(3):\r\n a.append(list(map(int,input().split(\" \"))))\r\nfor i in range(3):\r\n for j in range(3):\r\n sum1=a[i][j]\r\n if i+1<3:\r\n sum1+=a[i+1][j]\r\n if i-1>=0:\r\n sum1+=a[i-1][j]\r\n if j+1<3:\r\n sum1+=a[i][j+1]\r\n if j-1>=0:\r\n sum1+=a[i][j-1]\r\n if sum1%2==0:\r\n s+=\"1\"\r\n else:\r\n s+=\"0\"\r\nprint(s[0:3])\r\nprint(s[3:6])\r\nprint(s[6:9]) ", "a, b, c = [int(x) & 1 for x in input().split()]\nd, e, f = [int(x) & 1 for x in input().split()]\ng, h, i = [int(x) & 1 for x in input().split()]\nprint(a ^ b ^ d ^ 1, a ^ b ^ c ^ e ^ 1, b ^ c ^ f ^ 1, sep=\"\")\nprint(a ^ d ^ e ^ g ^ 1, b ^ d ^ e ^ f ^ h ^ 1, c ^ e ^ f ^ i ^ 1, sep=\"\")\nprint(d ^ g ^ h ^ 1, e ^ g ^ h ^ i ^ 1, f ^ h ^ i ^ 1, sep=\"\")\n", "arr = []\r\nfor i in range(3):\r\n arr.append(list(map(int, input().split())))\r\n\r\nans = [[1]*3 for i in range(3)]\r\n\r\ndef toggle(q, w):\r\n if(0<=q<3 and 0<=w<3):\r\n if(ans[q][w]==0):\r\n ans[q][w] = 1\r\n else:\r\n ans[q][w] = 0\r\n\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(arr[i][j]%2==1):\r\n toggle(i, j)\r\n toggle(i-1, j)\r\n toggle(i+1, j)\r\n toggle(i, j-1)\r\n toggle(i, j+1)\r\n \r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j], end=\"\")\r\n print()", "g = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\nfor y in range(3):\r\n a = [int(x) for x in input().split()]\r\n for p in range(3):\r\n g[y][p] = abs(g[y][p] - a[p]%2)\r\n if p != 0:\r\n g[y][p - 1] = abs(g[y][p - 1] - a[p] % 2)\r\n if p != 2:\r\n g[y][p + 1] = abs(g[y][p + 1] - a[p] % 2)\r\n if y != 0:\r\n g[y - 1][p] = abs(g[y - 1][p] - a[p] % 2)\r\n if y != 2:\r\n g[y + 1][p] = abs(g[y + 1][p] - a[p] % 2)\r\nprint(f'{g[0][0]}{g[0][1]}{g[0][2]}')\r\nprint(f'{g[1][0]}{g[1][1]}{g[1][2]}')\r\nprint(f'{g[2][0]}{g[2][1]}{g[2][2]}')", "table = [[0]*5] + [[0]+list(map(int,input().split()))+[0] for i in range(3)]\r\ntable += [[0] * 5]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print((table[i][j] + 1 + table[i][j-1] + table[i][j+1] + table[i-1][j] + table[i+1][j]) % 2,end=\"\")\r\n print()\r\n", "def switch(n: int):\n if n == 1:\n return 0\n elif n == 0:\n return 1\n\n\nlights = []\nfor i in range(3):\n lights.append([1, 1, 1])\n\nfirst, second, third = map(int, input().split())\nif first % 2 == 1:\n lights[0][0] = switch(lights[0][0])\n lights[0][1] = switch(lights[0][1])\n lights[1][0] = switch(lights[1][0])\nif second % 2 == 1:\n lights[0][0] = switch(lights[0][0])\n lights[0][1] = switch(lights[0][1])\n lights[0][2] = switch(lights[0][2])\n lights[1][1] = switch(lights[1][1])\nif third % 2 == 1:\n lights[0][1] = switch(lights[0][1])\n lights[0][2] = switch(lights[0][2])\n lights[1][2] = switch(lights[1][2])\n\nfirst, second, third = map(int, input().split())\nif first % 2 == 1:\n lights[0][0] = switch(lights[0][0])\n lights[1][0] = switch(lights[1][0])\n lights[1][1] = switch(lights[1][1])\n lights[2][0] = switch(lights[2][0])\nif second % 2 == 1:\n lights[0][1] = switch(lights[0][1])\n lights[1][0] = switch(lights[1][0])\n lights[1][1] = switch(lights[1][1])\n lights[1][2] = switch(lights[1][2])\n lights[2][1] = switch(lights[2][1])\nif third % 2 == 1:\n lights[0][2] = switch(lights[0][2])\n lights[1][1] = switch(lights[1][1])\n lights[1][2] = switch(lights[1][2])\n lights[2][2] = switch(lights[2][2])\n\nfirst, second, third = map(int, input().split())\nif first % 2 == 1:\n lights[1][0] = switch(lights[1][0])\n lights[2][0] = switch(lights[2][0])\n lights[2][1] = switch(lights[2][1])\nif second % 2 == 1:\n lights[1][1] = switch(lights[1][1])\n lights[2][0] = switch(lights[2][0])\n lights[2][1] = switch(lights[2][1])\n lights[2][2] = switch(lights[2][2])\nif third % 2 == 1:\n lights[1][2] = switch(lights[1][2])\n lights[2][1] = switch(lights[2][1])\n lights[2][2] = switch(lights[2][2])\n\nfor row in lights:\n print(\"\".join(str(e) for e in row))\n", "def main():\n state = [[0] * 5 for _ in range(5)]\n for i in range(3):\n state[i + 1][1:4] = list(map(int, input().split()))\n\n ansstr = \"\"\n for i in range(1, 4):\n for j in range(1, 4):\n lsum = (\n state[i][j]\n + state[i][j + 1]\n + state[i][j - 1]\n + state[i - 1][j]\n + state[i + 1][j]\n )\n if not lsum % 2:\n ansstr += \"1\"\n else:\n ansstr += \"0\"\n print(ansstr)\n ansstr = \"\"\n\n\nif __name__ == \"__main__\":\n main()\n", "k=[]\r\nfor i in range (3):\r\n m=list(map(int,input().split()))\r\n k.append(m)\r\n\r\nan=[[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0]]\r\n\r\nfor i in k :\r\n ko = (k.index(i)) + 1\r\n j=0\r\n while j < len(i):\r\n if i[j] %2 ==1 :\r\n an[ko][j+1] += 1\r\n an[ko][j + 2] += 1\r\n an[ko][j ] += 1\r\n an[ko + 1][j+1] += 1\r\n an[ko - 1][j+1] += 1\r\n j+=1\r\n\r\nfor i in an[1:4]:\r\n for j in i[1:4]:\r\n if j % 2 == 1 :\r\n print(0,end=\"\")\r\n if j % 2 == 0 :\r\n print(1,end=\"\")\r\n print()", "# -*- coding: utf-8 -*-\n\"\"\"Untitled0.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YcOTTyvJkKVFtTzIQJiFJyYcmGBZU1tt\n\"\"\"\n\nlights = [[1 for i in range(3)] for j in range(3)]\ninputs = []\nfor _ in range(3):\n inputs.append(list(map(int, input().split())))\n\nif inputs[0][0] %2 != 0:\n lights[0][0] = 0\n lights[0][1] = 0\n lights[1][0] = 0\n\nif inputs[0][1] % 2 != 0:\n lights[0][1] = int(not lights[0][1])\n lights[0][0] = int(not lights[0][0])\n lights[0][2] = int(not lights[0][2])\n lights[1][1] = int(not lights[1][1])\n\nif inputs[0][2] % 2 != 0:\n lights[0][1] = int(not lights[0][1])\n lights[0][2] = int(not lights[0][2])\n lights[1][2] = int(not lights[1][2])\n\nif inputs[1][0] % 2 != 0:\n lights[0][0] = int(not lights[0][0])\n lights[1][0] = int(not lights[1][0])\n lights[1][1] = int(not lights[1][1])\n lights[2][0] = int(not lights[2][0])\n\nif inputs[1][1] % 2 != 0:\n lights[1][0] = int(not lights[1][0])\n lights[1][1] = int(not lights[1][1])\n lights[1][2] = int(not lights[1][2])\n lights[0][1] = int(not lights[0][1])\n lights[2][1] = int(not lights[2][1])\n\nif inputs[1][2] % 2 != 0:\n lights[0][2] = int(not lights[0][2])\n lights[1][1] = int(not lights[1][1])\n lights[1][2] = int(not lights[1][2])\n lights[2][2] = int(not lights[2][2])\n\nif inputs[2][0] % 2 != 0:\n lights[2][0] = int(not lights[2][0])\n lights[2][1] = int(not lights[2][1])\n lights[1][0] = int(not lights[1][0])\n\nif inputs[2][1] % 2 != 0:\n lights[2][0] = int(not lights[2][0])\n lights[2][1] = int(not lights[2][1])\n lights[1][1] = int(not lights[1][1])\n lights[2][2] = int(not lights[2][2])\n\nif inputs[2][2] % 2 != 0:\n lights[2][2] = int(not lights[2][2])\n lights[2][1] = int(not lights[2][1])\n lights[1][2] = int(not lights[1][2])\n\nfor i in range(3):\n print(*lights[i], sep=\"\")\n\n", "board = []\r\nfor i in range(3):\r\n temp = [int(x) for x in input().split(\" \")]\r\n board.append(temp)\r\n\r\nline1 = \"\"\r\nadjacent = board[0][0] + board[0][1] + board[1][0]\r\nif adjacent % 2 == 1:\r\n line1 += \"0\"\r\nelse:\r\n line1 += \"1\"\r\nadjacent = board[0][0] + board[0][1] + board[0][2] + board[1][1]\r\nif adjacent % 2 == 1:\r\n line1 += \"0\"\r\nelse:\r\n line1 += \"1\"\r\nadjacent = board[0][2] + board[0][1] + board[1][2]\r\nif adjacent % 2 == 1:\r\n line1 += \"0\"\r\nelse:\r\n line1 += \"1\"\r\nline2 = \"\"\r\nadjacent = board[0][0] + board[1][1] + board[1][0] + board[2][0]\r\nif adjacent % 2 == 1:\r\n line2 += \"0\"\r\nelse:\r\n line2 += \"1\"\r\nadjacent = board[0][1] + board[1][1] + board[1][2] + board[1][0] + board[2][1]\r\nif adjacent % 2 == 1:\r\n line2 += \"0\"\r\nelse:\r\n line2 += \"1\"\r\nadjacent = board[0][2] + board[1][1] + board[1][2] + board[2][2]\r\nif adjacent % 2 == 1:\r\n line2 += \"0\"\r\nelse:\r\n line2 += \"1\"\r\nline3 = \"\"\r\nadjacent = board[2][0] + board[1][0] + board[2][1]\r\nif adjacent % 2 == 1:\r\n line3 += \"0\"\r\nelse:\r\n line3 += \"1\"\r\nadjacent = board[2][1] + board[2][0] + board[2][2] + board[1][1]\r\nif adjacent % 2 == 1:\r\n line3 += \"0\"\r\nelse:\r\n line3 += \"1\"\r\nadjacent = board[2][2] + board[2][1] + board[1][2]\r\nif adjacent % 2 == 1:\r\n line3 += \"0\"\r\nelse:\r\n line3 += \"1\"\r\n\r\nprint(\"{}\\n{}\\n{}\".format(line1, line2, line3))\r\n", "def valid(i,j):\r\n if i>=0 and i<=2 and j>=0 and j<=2:return True\r\n else:return False\r\nmat = [[1,1,1],[1,1,1],[1,1,1]]\r\ndef do_thing(i,j):\r\n mat[i][j] = 1-mat[i][j]\r\n if valid(i+1,j):mat[i+1][j] = 1-mat[i+1][j]\r\n if valid(i,j+1):mat[i][j+1] = 1-mat[i][j+1]\r\n if valid(i-1,j):mat[i-1][j] = 1-mat[i-1][j]\r\n if valid(i,j-1):mat[i][j-1] = 1-mat[i][j-1]\r\n\r\nl = []\r\nfor i in range(3):l.append(list(map(int,input().split())))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if l[i][j]%2==1:\r\n do_thing(i,j)\r\nfor i in mat:\r\n print(*i,sep='')", "matrix = []\r\nfor i in range(3):\r\n matrix.append(list(map(int,input().split())))\r\nmatrix2 = [[0]*3 for i in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] != 0:\r\n val = matrix[i][j]\r\n moves = [(1,0),(0,1),(-1,0),(0,-1)]\r\n for move in moves:\r\n cX = i + move[0]\r\n xY = j + move[1]\r\n\r\n if cX >= 0 and cX < 3 and xY >= 0 and xY < 3:\r\n matrix2[cX][xY] += val\r\n matrix2[i][j] += val\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix2[i][j]% 2 != 0:\r\n print(\"0\",end = \"\")\r\n else:\r\n print(\"1\",end = \"\")\r\n\r\n print(\"\")\r\n \r\n ", "inMatrix = []\r\nfor _ in range(3):\r\n inMatrix.append(list(map(int,input().split())))\r\noutMatrix = [[1 for i in range(3)] for j in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n pressCount = inMatrix[i][j]\r\n if i - 1 >= 0:\r\n pressCount += inMatrix[i-1][j]\r\n if j - 1 >= 0:\r\n pressCount += inMatrix[i][j-1]\r\n if i + 1 <= 2:\r\n pressCount += inMatrix[i+1][j]\r\n if j + 1 <= 2:\r\n pressCount += inMatrix[i][j+1]\r\n if pressCount % 2 != 0:\r\n outMatrix[i][j] = 0\r\n\r\nfor i in range(3):\r\n print(*outMatrix[i],sep = \"\" )", "\r\nres = [[0 for _ in range(3)]for i in range(3)]\r\nfor i in range(3):\r\n a = input().split(' ')\r\n for j in range(3):\r\n res[i] [j] = a[j]\r\n\r\nf = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nif int(res[0][0]) %2 != 0 :\r\n f[0][0] = 0 if f[0][0] == 1 else 1\r\n f[0][1] = 0 if f[0][1] == 1 else 1\r\n f[1][0] = 0 if f[1][0] == 1 else 1\r\n\r\nif int(res[0][1]) % 2 != 0:\r\n f[0][1] = 0 if f[0][1] == 1 else 1\r\n f[0][0] = 0 if f[0][0] == 1 else 1\r\n f[0][2] = 0 if f[0][2] == 1 else 1\r\n f[1][1] = 0 if f[1][1] == 1 else 1\r\n\r\nif int(res[0][2]) % 2 != 0:\r\n f[0][2] = 0 if f[0][2] == 1 else 1\r\n f[1][2] = 0 if f[1][2] == 1 else 1\r\n f[0][1] = 0 if f[0][1] == 1 else 1\r\n\r\nif int(res[1][0]) % 2 != 0:\r\n f[1][0] = 0 if f[1][0] == 1 else 1\r\n f[2][0] = 0 if f[2][0] == 1 else 1\r\n f[0][0] = 0 if f[0][0] == 1 else 1\r\n f[1][1] = 0 if f[1][1] == 1 else 1\r\n\r\nif int(res[1][1]) % 2 != 0:\r\n f[1][2] = 0 if f[1][2] == 1 else 1\r\n f[1][0] = 0 if f[1][0] == 1 else 1\r\n f[2][1] = 0 if f[2][1] == 1 else 1\r\n f[0][1] = 0 if f[0][1] == 1 else 1\r\n f[1][1] = 0 if f[1][1] == 1 else 1\r\n\r\nif int(res[1][2]) % 2 != 0:\r\n f[1][1] = 0 if f[1][1] == 1 else 1\r\n f[2][2] = 0 if f[2][2] == 1 else 1\r\n f[0][2] = 0 if f[0][2] == 1 else 1\r\n f[1][2] = 0 if f[1][2] == 1 else 1\r\n\r\nif int(res[2][0]) % 2 != 0:\r\n f[1][0] = 0 if f[1][0] == 1 else 1\r\n f[2][0] = 0 if f[2][0] == 1 else 1\r\n f[2][1] = 0 if f[2][1] == 1 else 1\r\n\r\nif int(res[2][1]) % 2 != 0:\r\n f[2][0] = 0 if f[2][0] == 1 else 1\r\n f[2][1] = 0 if f[2][1] == 1 else 1\r\n f[2][2] = 0 if f[2][2] == 1 else 1\r\n f[1][1] = 0 if f[1][1] == 1 else 1\r\n\r\nif int(res[2][2]) % 2 != 0:\r\n f[1][2] = 0 if f[1][2] == 1 else 1\r\n f[2][2] = 0 if f[2][2] == 1 else 1\r\n f[2][1] = 0 if f[2][1] == 1 else 1\r\nfor i in f:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()\r\n\r\n\r\n", "inp = [[int(number) for number in input().split()] for _ in range(3)]\n\ntoggle = [[0 for col in range(3)] for row in range(3)]\n\nfor row in range(3):\n for col in range(3):\n if inp[row][col]:\n toggle[row][col] += inp[row][col]\n if row != 0:\n toggle[row-1][col] += inp[row][col]\n if row != 2:\n toggle[row+1][col] += inp[row][col]\n if col != 0:\n toggle[row][col-1] += inp[row][col]\n if col != 2:\n toggle[row][col+1] += inp[row][col]\n\n\nfor row in range(3):\n for col in range(3):\n if toggle[row][col] % 2 == 0:\n print(\"1\",end=\"\")\n else:\n print(\"0\", end=\"\")\n print()\n\n ", "def tgl(n):\r\n n = 1 - n\r\n return n\r\n\r\nm = [[0 for i in range(5)] for i in range(5)]\r\nf = [[1 for i in range(5)] for i in range(5)]\r\n\r\nfor i in range(1,4):\r\n m[i][1:4] = list(map(int,input().split(' ')))\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if m[i][j]%2:\r\n f[i][j] = tgl(f[i][j])\r\n f[i+1][j] = tgl(f[i+1][j])\r\n f[i-1][j] = tgl(f[i-1][j])\r\n f[i][j+1] = tgl(f[i][j+1])\r\n f[i][j-1] = tgl(f[i][j-1])\r\n \r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print(f[i][j],end='')\r\n print()\r\n \r\n", "matrix = []\r\nans = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n a = list(map(int, input().split()))\r\n matrix.append(a)\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(matrix[i][j]%2 != 0):\r\n if(i < 2): \r\n ans[i+1][j] = 1 - ans[i+1][j]\r\n if(j < 2): \r\n ans[i][j+1] = 1 - ans[i][j+1]\r\n if(i > 0): \r\n ans[i-1][j] = 1 - ans[i-1][j]\r\n if(j > 0): \r\n ans[i][j-1] = 1 - ans[i][j-1]\r\n ans[i][j] = 1-ans[i][j]\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j],end=\"\")\r\n print()", "# https://codeforces.com/problemset/problem/275/A\n\n\n# Note: WORNG!! Thanks to python not throwing exception for -ve indices\n\n# matrix = []\n# matrix.append([int(num) for num in input().split()])\n# matrix.append([int(num) for num in input().split()])\n# matrix.append([int(num) for num in input().split()])\n\n# result = [[1,1,1],[1,1,1],[1,1,1]]\n\n# print(result)\n# row = 0\n# while(row < 3):\n# col = 0\n# while(col < 3):\n# if matrix[row][col]%2 == 1:\n# result[row][col] = 1 if (result[row][col] == 0) else 0\n# try:\n# result[row-1][col] = 1 if (result[row-1][col]==0) else 0\n# # print(\"marking \", row-1, col)\n# except:\n# # print(\"Here for \", row-1, col)\n# pass\n# try:\n# result[row][col-1] = 1 if (result[row][col-1]==0) else 0\n# # print(\"marking \", row, col-1)\n# except:\n# # print(\"Here for \", row, col-1)\n# pass\n# try:\n# result[row][col+1] = 1 if (result[row][col+1]==0) else 0\n# # print(\"marking \", row, col+1)\n# except:\n# # print(\"Here for \", row, col+1)\n# pass\n# try:\n# result[row+1][col] = 1 if (result[row+1][col]==0) else 0\n# # print(\"marking \", row+1, col)\n# except:\n# # print(\"Here for \", row+1, col)\n# pass\n# col += 1\n# row += 1\n\n# print(result)\n\n\nmatrix = []\nmatrix.append([int(num) for num in input().split()])\nmatrix.append([int(num) for num in input().split()])\nmatrix.append([int(num) for num in input().split()])\n\nresult = [[1,1,1],[1,1,1],[1,1,1]]\n\nrow = 0\nwhile(row < 3):\n col = 0\n while(col < 3):\n if matrix[row][col]%2 == 1:\n result[row][col] = 1 if (result[row][col] == 0) else 0\n if (row-1>=0 and row-1<=2 and col>=0 and col<=2):\n result[row-1][col] = 1 if (result[row-1][col]==0) else 0\n if (row>=0 and row<=2 and col-1>=0 and col-1<=2):\n result[row][col-1] = 1 if (result[row][col-1]==0) else 0\n if (row+1>=0 and row+1<=2 and col>=0 and col<=2):\n result[row+1][col] = 1 if (result[row+1][col]==0) else 0\n if (row>=0 and row<=2 and col+1>=0 and col+1<=2):\n result[row][col+1] = 1 if (result[row][col+1]==0) else 0 \n col += 1\n row += 1\n\nfor row in result:\n for num in row:\n print(num, end='')\n print()", "outgrid = [[1,1,1],[1,1,1],[1,1,1]]\r\ndef toggle(i,j):\r\n global outgrid\r\n if(outgrid[i][j] == 0):\r\n outgrid[i][j] = 1\r\n else:\r\n outgrid[i][j] = 0\r\ndef sim(i,j, times):\r\n global outgrid\r\n for t in range(times):\r\n toggle(i,j)\r\n if(i > 0):\r\n toggle(i - 1, j)\r\n if(i < 2):\r\n toggle(i + 1, j)\r\n if(j > 0):\r\n toggle(i, j - 1)\r\n if(j < 2):\r\n toggle(i, j + 1)\r\n\r\ngrid = []\r\nfor i in range(3):\r\n grid.append(list(map(int, input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n sim(i,j, grid[i][j])\r\nfor i in outgrid:\r\n temp = [str(x) for x in i]\r\n print(\"\".join(temp))", "import sys\r\n# sys.stdin = open(\"IO/input.txt\", \"r\")\r\n\r\na = [\r\n [1, 1, 1],\r\n [1, 1, 1],\r\n [1, 1, 1]\r\n]\r\n\r\nc = []\r\nfor i in range(3):\r\n c.append(list(map(int, input().split())))\r\n\r\n\r\nfor i in range(len(c)):\r\n for j in range(len(c[i])):\r\n if c[i][j] % 2 != 0:\r\n a[i][j] = 1 - a[i][j]\r\n if i > 0:\r\n a[i - 1][j] = 1 - a[i - 1][j]\r\n if i < 2:\r\n a[i + 1][j] = 1 - a[i + 1][j]\r\n if j > 0:\r\n a[i][j - 1] = 1 - a[i][j - 1]\r\n if j < 2:\r\n a[i][j + 1] = 1 - a[i][j + 1]\r\n\r\nfor i in a:\r\n for j in i:\r\n print(j, end=\"\")\r\n print()", "lights_switched = []\r\n\r\nfor i in range(3):\r\n lights_switched.append(list(map(int, input().split())))\r\n\r\nlights = []\r\n\r\nfor row in range(3):\r\n light_row = []\r\n for col in range(3):\r\n dirs = [[0, 1], [0, -1], [1, 0], [-1, 0]]\r\n val = lights_switched[row][col]\r\n\r\n for dir in dirs:\r\n nr = row + dir[0]\r\n nc = col + dir[1]\r\n if nr < 3 and nr >= 0 and nc < 3 and nc >= 0:\r\n val += lights_switched[nr][nc]\r\n\r\n if val % 2 == 0:\r\n light_row.append(1)\r\n else:\r\n light_row.append(0)\r\n lights.append(light_row)\r\n\r\nfor light_row in lights:\r\n for light in light_row:\r\n print(light, end=\"\")\r\n print()", "l = []\r\nresult = [[1 for i in range(3)] for i in range(3)]\r\nfor i in range(3):\r\n temp = [int(x) for x in input().split()]\r\n l.append(temp)\r\nfor i in range(3):\r\n for j in range(3):\r\n temp = 0\r\n for x in range(i-1, i+2):\r\n for y in range(j-1, j+2):\r\n if x >= 0 and x <= 2 and y >= 0 and y <= 2 and (abs(x-i) != abs(y-j)):\r\n temp += l[x][y] % 2\r\n temp += l[i][j] % 2\r\n result[i][j] -= temp % 2\r\nfor x in result:\r\n print(''.join([str(i) for i in x]))\r\n", "def switch(initial, times):\r\n if int(times) % 2 != 0:\r\n if initial == '1':\r\n return '0'\r\n else:\r\n return '1'\r\n\r\n return initial\r\n\r\n\r\ndef main():\r\n list1 = list(['0']*5 for _ in range(5))\r\n list2 = list(['1']*5 for _ in range(5))\r\n for i in range(1, 4):\r\n input_text = list(input().split())\r\n list1[i] = ['0'] + input_text + ['0']\r\n\r\n for i in range(1, 4):\r\n for j in range(1, 4):\r\n for (c,d) in (1, 0),(0,1),(-1,0),(0,-1),(0,0):\r\n list2[i+c][j+d] = switch(list2[i+c][j+d], list1[i][j])\r\n\r\n for i in list2[1:4]:\r\n for j in i[1:4]:\r\n print(j, end='')\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "grid = [list(map(int, input().split()[:3])) for _ in range(3)]\r\n\r\ndef toggle_lights(x):\r\n return 1 - x # Toggles 1 to 0 and 0 to 1\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n \r\n # Calculate the sum of the current cell and its adjacent cells\r\n total_presses = grid[i][j]\r\n if i > 0:\r\n total_presses += grid[i-1][j] # Upper cell\r\n if i < 2:\r\n total_presses += grid[i+1][j] # Lower cell\r\n if j > 0:\r\n total_presses += grid[i][j-1] # Left cell\r\n if j < 2:\r\n total_presses += grid[i][j+1] # Right cell\r\n\r\n # Determine the state of the light based on the total presses\r\n result = toggle_lights(total_presses % 2)\r\n print(result, end=\"\")\r\n \r\n print()", "game_field = []\r\nlight_change = []\r\ni = 0\r\nwhile i < 3:\r\n\tgame_field.append([1, 1, 1])\r\n\tlight_change.append([int(x) for x in input().split()])\r\n\ti += 1\r\ni = 0\r\nwhile i < 3:\r\n\tj = 0\r\n\twhile j < 3:\r\n\t\tif i == 0:\r\n\t\t\tif j == 0:\r\n\t\t\t\tchecker = light_change[i][j] + light_change[i][j+1] + light_change[i+1][j]\r\n\t\t\telif j ==1:\r\n\t\t\t\tchecker= light_change[i][j] + light_change[i][j+1] + light_change[i][j-1] + light_change[i+1][j]\r\n\t\t\telse:\r\n\t\t\t\tchecker = light_change[i][j] + light_change[i][j-1] + light_change[i+1][j]\r\n\t\telif i == 1:\r\n\t\t\tif j == 0:\r\n\t\t\t\tchecker = light_change[i][j] + light_change[i][j+1] + light_change[i+1][j] + light_change[i-1][j]\r\n\t\t\telif j ==1:\r\n\t\t\t\tchecker= light_change[i][j] + light_change[i][j+1] + light_change[i][j-1] + light_change[i+1][j] + light_change[i-1][j]\r\n\t\t\telse:\r\n\t\t\t\tchecker = light_change[i][j] + light_change[i][j-1] + light_change[i+1][j] + light_change[i-1][j]\r\n\t\telse:\r\n\t\t\tif j == 0:\r\n\t\t\t\tchecker = light_change[i][j] + light_change[i][j+1] + light_change[i-1][j]\r\n\t\t\telif j ==1:\r\n\t\t\t\tchecker= light_change[i][j] + light_change[i][j+1] + light_change[i][j-1] + light_change[i-1][j]\r\n\t\t\telse:\r\n\t\t\t\tchecker = light_change[i][j] + light_change[i][j-1] + light_change[i-1][j]\r\n\r\n\t\tif checker%2 == 0:\r\n\t\t\tgame_field[i][j] = 1\r\n\t\telse:\r\n\t\t\tgame_field[i][j] = 0\r\n\t\tj += 1\r\n\ti += 1\r\ni = 0\r\nwhile i < 3:\r\n\tgame_field[i] = ' '.join([str(x) for x in game_field[i]])\r\n\tprint(game_field[i].replace(' ', ''))\r\n\ti += 1", "\"\"\"\n Author: Apple Artic\n Contest: Codeforces Round-863\n Category: Div-3\n Date: 04/04/2023\n\"\"\"\nimport math\nimport sys\n\n# inputText considers '\\n' too. So length of a string is len(s)\ninputText = sys.stdin.readline\n\n\ndef is_prime(n):\n \"\"\" returns True value if n is prime else False \"\"\"\n for i in range(2, int(math.sqrt(n)) + 1):\n if n % i == 0:\n return False\n return True\ndef gcd(x, y):\n \"\"\"\n returns greatest common divisor of x and y->gcd(x,y)\n \"\"\"\n while y:\n x, y = y, x % y\n return x\ndef input_string():\n \"\"\" returns a list of characters in the string(since immutable) \"\"\"\n s1 = inputText()\n return list(s1[:len(s1) - 1])\ndef binary_exponentiation(a, b, m):\n \"\"\"\n returns pow(a,b)%m\n :param a: base\n :param b: power or exponent\n :param m: mod\n :return: power(a,b)%m\n \"\"\"\n a %= m\n res = 1\n while b > 0:\n if b & 1:\n res = res * a % m\n a = a * a % m\n b >>= 1\n return res\n\n\nmod1 = 1_000_000_007\nmod2 = 998_244_353\n# T = int(inputText())\n\nT = 1\nfor test in range(T):\n m = [[0] * 5] + [[0] + [int(i) for i in input().split()] + [0] for j in range(3)] + [[0] * 5]\n for i in range(1, 4):\n for j in range(1, 4):\n print((m[i][j] + m[i + 1][j] + m[i - 1][j] + m[i][j + 1] + m[i][j - 1] + 1) % 2, end='')\n print()\n", "pressed = [list(map(int, input().split())) for _ in range(3)]\r\nstate = [[0 for _ in range(3)] for _ in range(3)]\r\n# created a dummy outside 0 layer outside pressed, to easier the process of checking total sum of adjacents and escaping index errors\r\ndummy = [[0 for _ in range(5)] for _ in range(5)]\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n dummy[i][j] = pressed[i-1][j-1]\r\n\r\n# checking\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if (dummy[i][j] + dummy[i+1][j] + dummy[i-1][j] + dummy[i][j+1] + dummy[i][j-1]) % 2 == 0:\r\n state[i-1][j-1] = 1\r\n# printing state\r\nfor i in state:\r\n for j in i:\r\n print(j, end=\"\")\r\n print()", "old_list = [[1,1,1],[1,1,1],[1,1,1]]\r\ndef cheak(i,j,k):\r\n old_list[i][j] += k\r\n if (j + 1)<3:\r\n old_list[i][j+1] += k\r\n if (j - 1)>=0:\r\n old_list[i][j - 1] += k\r\n if (i + 1)<3:\r\n old_list[i+1][j] += k\r\n if (i - 1)>=0:\r\n old_list[i-1][j] += k\r\nfor i in range(3):\r\n s = input().split()\r\n for j in range(3):\r\n cheak(i,j,int(s[j]))\r\nfor i in range(3):\r\n for j in range(3):\r\n if old_list[i][j]%2==0:\r\n print(0,end=\"\")\r\n else:\r\n print(1,end=\"\")\r\n print(\"\")\r\n", "### https://codeforces.com/problemset/problem/275/A\r\n\r\ndef touch_light(grid: list, times: int, i: int, j: int) -> None:\r\n i_limit = len(grid) - 1\r\n j_limit = len(grid[0]) - 1\r\n\r\n for x in range(times):\r\n grid[i][j] = not grid[i][j]\r\n\r\n if i == 0:\r\n grid[i+1][j] = not grid[i+1][j]\r\n elif i == i_limit:\r\n grid[i-1][j] = not grid[i-1][j]\r\n else:\r\n grid[i-1][j] = not grid[i-1][j]\r\n grid[i+1][j] = not grid[i+1][j]\r\n\r\n if j == 0:\r\n grid[i][j+1] = not grid[i][j+1]\r\n elif j == j_limit:\r\n grid[i][j-1] = not grid[i][j-1]\r\n else:\r\n grid[i][j-1] = not grid[i][j-1]\r\n grid[i][j+1] = not grid[i][j+1]\r\n\r\nif __name__ == \"__main__\":\r\n operations = []\r\n for i in range(3):\r\n row = input()\r\n row_int = [int(x) for x in row.split(\" \")]\r\n operations.append(row_int)\r\n # print(operations)\r\n\r\n grid = [[True, True, True], [True, True, True], [True, True, True]]\r\n for i in range(len(operations)):\r\n for j in range(len(operations[0])):\r\n touch_light(grid, operations[i][j], i, j)\r\n # print(grid)\r\n\r\n for row in grid:\r\n line = \"\"\r\n for result in row:\r\n line += \"1\" if result else \"0\"\r\n print(line)", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\ndef inList():\r\n return(list(map(int,input().split())))\r\ndef inVar():\r\n return map(int,input().split()) \r\n\r\ndx = [0, 0, 0, -1, 1, -1, -1, 1, 1, 0]\r\ndy = [0, 1, -1, 0, 0, -1, 1, -1, 1, 0]\r\ndef Check_bound(xx , yy):\r\n if xx < 0 or yy < 0 or xx >= 3 or yy >= 3:\r\n return False\r\n return True\r\ndef main():\r\n ar = []\r\n ar.append(inList())\r\n ar.append(inList())\r\n ar.append(inList())\r\n for i in range(3):\r\n for j in range(3):\r\n ar[i][j] %= 2\r\n ans = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n for i in range(3):\r\n for j in range(3):\r\n if ar[i][j] == 1:\r\n for k in range(0,5):\r\n x = i + dx[k]\r\n y = j + dy[k]\r\n if Check_bound(x , y):\r\n ans[x][y] ^= 1\r\n for i in range(3):\r\n for j in range(3):\r\n output(str(ans[i][j]))\r\n output(\"\\n\")\r\nmain()", "g = [[0] + list(map(int, input().split())) + [0] for _ in range(3)]\r\nw = [[0]*5] + g + [[0]*5]\r\n\r\nfor i in range(1,4):\r\n print(''.join(map(str,[1-((w[i][j] + w[i+1][j] + w[i-1][j] + w[i][j-1] + w[i][j+1])%2) for j in range(1,4)])))", "def check(i,j):\n if i>=0 and j>=0 and j<=2 and i<=2:\n return True\n return False\n\narr = []\nfor _ in range(3):\n arr.append(list(map(int,input().split())))\n\nans = [[1,1,1],[1,1,1],[1,1,1]]\nfor i in range(3):\n for j in range(3):\n if arr[i][j]%2:\n ans[i][j]^=1\n if check(i+1,j):ans[i+1][j]^=1\n if check(i-1,j):ans[i-1][j]^=1\n if check(i,j+1):ans[i][j+1]^=1\n if check(i,j-1):ans[i][j-1]^=1\n\nfor i in ans:\n print(*i,sep='')\n", "# import inbuilt standard input output\nfrom sys import stdin, stdout\n\ndef main():\n arr = [0, 0, 0]\n for i in range(3):\n arr[i] = [int(x)%2 for x in stdin.readline().split(' ')]\n # print(arr)\n final_arr = [[0 for i in range(5)] for i in range(5)]\n for i in range(3):\n for j in range(3):\n real_i = i + 1\n real_j = j + 1\n if arr[i][j] == 1:\n # used a odd number of times:\n final_arr[real_i][real_j -1] +=1\n final_arr[real_i][real_j +1] +=1\n for m in range(real_i -1, real_i + 2):\n final_arr[m][real_j] +=1\n # print(final_arr)\n # final arr\n for i in range(3):\n arr = [str((x+1)%2) for x in final_arr[i +1][1:4]]\n stdout.write(''.join(arr)+'\\n')\n\nif __name__ == \"__main__\":\n main()", "times, cnt = [], []\nfor i in range(3):\n\trow = [int(x) for x in input().split()][:3]\n\ttimes.append(row)\n\tcnt.append([1, 1, 1])\nfor i in range(3):\n\tfor j in range(3):\n\t\tcnt[i][j] += times[i][j]\n\t\tif i > 0: cnt[i][j] += times[i-1][j]\n\t\tif i < 2: cnt[i][j] += times[i+1][j]\n\t\tif j > 0: cnt[i][j] += times[i][j-1]\n\t\tif j < 2: cnt[i][j] += times[i][j+1]\nfor i in range(3):\n\tfor j in range(3):\n\t\tif cnt[i][j] % 2: print(1, end = '')\n\t\telse: print(0, end = '')\n\tprint()\n\t \t \t \t\t \t \t\t", "toggled = [[0 for i in range(4)] for j in range(4)]\r\npressed = [[0 for m in range(4)] for n in range(4)]\r\ntemp = [[int(x) for x in input().split()] for _ in range(3)]\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n toggled[i][j] = temp[i - 1][j - 1]\r\n pressed[i][j] = temp[i - 1][j - 1]\r\n\r\nfor r in range(1, 4):\r\n for c in range(1, 4):\r\n toggled[r][c - 1] += pressed[r][c]\r\n toggled[r - 1][c] += pressed[r][c]\r\n\r\n if r + 1 < 4:\r\n toggled[r + 1][c] += pressed[r][c]\r\n if c + 1 < 4:\r\n toggled[r][c + 1] += pressed[r][c]\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if toggled[i][j] % 2:\r\n print(0, end='')\r\n else:\r\n print(1, end=\"\")\r\n print()\r\n", "inp=[]\r\nout=[[True,True,True],[True,True,True],[True,True,True]]\r\n\r\nfor i in range(3):\r\n inp.append(list(map(int,input().split())))\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if inp[i][j]%2==0:\r\n inp[i][j]=0\r\n else:\r\n inp[i][j]=1\r\nfor i in range(3):\r\n for j in range(3):\r\n k=out\r\n if inp[i][j]==1:\r\n out[i][j]=(not out[i][j])\r\n if i-1>=0:\r\n out[i-1][j]=(not out[i-1][j])\r\n if i+1<3:\r\n out[i+1][j]=(not out[i+1][j])\r\n if j-1>=0:\r\n out[i][j-1]=(not out[i][j-1])\r\n if j+1<3:\r\n out[i][j+1]=(not out[i][j+1])\r\nfor i in range(3):\r\n for j in range(3):\r\n if out[i][j]==True:\r\n out[i][j]=str(1)\r\n else:\r\n out[i][j]=str(0)\r\nprint(''.join(out[0]))\r\nprint(''.join(out[1]))\r\nprint(''.join(out[2]))\r\n", "def switch(n):\r\n if n==1:\r\n return 0\r\n else:\r\n return 1\r\n\r\na=[]\r\nfor i in range(3):\r\n x=list(map(int,input().split()))\r\n a.append(x)\r\nl=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]%2==0:\r\n continue\r\n else:\r\n if i==0:\r\n if j==0:\r\n l[0][0]=switch(l[0][0])\r\n l[0][1]=switch(l[0][1])\r\n l[1][0]=switch(l[1][0])\r\n elif j==1:\r\n l[0][1]=switch(l[0][1])\r\n l[0][0]=switch(l[0][0])\r\n l[0][2]=switch(l[0][2])\r\n l[1][1]=switch(l[1][1])\r\n else:\r\n l[0][2]=switch(l[0][2])\r\n l[0][1]=switch(l[0][1])\r\n l[1][2]=switch(l[1][2])\r\n elif i==1:\r\n if j==0:\r\n l[0][0]=switch(l[0][0])\r\n l[1][0]=switch(l[1][0])\r\n l[1][1]=switch(l[1][1])\r\n l[2][0]=switch(l[2][0])\r\n elif j==1:\r\n l[0][1]=switch(l[0][1])\r\n l[1][0]=switch(l[1][0])\r\n l[1][1]=switch(l[1][1])\r\n l[1][2]=switch(l[1][2])\r\n l[2][1]=switch(l[2][1])\r\n else:\r\n l[0][2]=switch(l[0][2])\r\n l[1][1]=switch(l[1][1])\r\n l[1][2]=switch(l[1][2])\r\n l[2][2]=switch(l[2][2])\r\n else:\r\n if j==0:\r\n l[2][0]=switch(l[2][0])\r\n l[2][1]=switch(l[2][1])\r\n l[1][0]=switch(l[1][0])\r\n elif j==1:\r\n l[2][1]=switch(l[2][1])\r\n l[2][0]=switch(l[2][0])\r\n l[2][2]=switch(l[2][2])\r\n l[1][1]=switch(l[1][1])\r\n else:\r\n l[2][2]=switch(l[2][2])\r\n l[2][1]=switch(l[2][1])\r\n l[1][2]=switch(l[1][2])\r\nfor i in range(3):\r\n for j in range(3):\r\n print(l[i][j],end=\"\")\r\n print(\"\")", "def isGood(x, y):\n if x >= 0 and x < 3 and y >= 0 and y < 3:\n return True\n return False\n\nlg = [[0, 0, 0] for _ in range(3)]\n\ng = [[1, 1, 1] for _ in range(3)]\n\nfor i in range(3):\n l = input().split()\n for (ii, li) in enumerate(l):\n lg[i][ii] = int(li) % 2\n\nfor (i, row) in enumerate(lg):\n for (j, cell) in enumerate(row):\n if lg[i][j] == 1:\n g[i][j] = 1 - g[i][j]\n if isGood(i -1, j):\n g[i-1][j] = 1 - g[i-1][j]\n if isGood(i, j -1):\n g[i][j-1] = 1 - g[i][j-1]\n if isGood(i + 1, j):\n g[i+1][j] = 1 - g[i+1][j]\n if isGood(i, j + 1):\n g[i][j+1] = 1 - g[i][j+1]\n\nfor row in g:\n print (''.join(list(map(lambda x: str(x), row))))\n", "from sys import stdin\r\n\r\ntable = [[1,1,1],[1,1,1],[1,1,1]]\r\ncnt = [[0,0,0],[0,0,0],[0,0,0]]\r\n\r\nfor i in range(3):\r\n row = list(map(int,stdin.readline().split()))\r\n for j in range(3):\r\n if row[j] % 2 == 0:\r\n row[j] = 0\r\n else:\r\n row[j] = 1\r\n\r\n for j in range(3):\r\n if row[j] == 1:\r\n cnt[i][j] += 1\r\n\r\n if i+1 < 3:\r\n cnt[i+1][j] += 1\r\n\r\n if i-1 >= 0:\r\n cnt[i-1][j] += 1\r\n\r\n if j+1 < 3:\r\n cnt[i][j+1] += 1\r\n\r\n if j-1 >= 0:\r\n cnt[i][j-1] += 1\r\n\r\n\r\nfor a in range(3):\r\n for b in range(3):\r\n if cnt[a][b] % 2 == 0:\r\n cnt[a][b] = 0\r\n else:\r\n cnt[a][b] = 1\r\n\r\nfor a in range(3):\r\n for b in range(3):\r\n if cnt[a][b] == 1:\r\n table[a][b] = 0\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(table[i][j],end='')\r\n print()", "a = [[0] * 3] * 3\r\nout = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\ndef printArr(a):\r\n for i in range(3):\r\n print(\"\".join(map(str, a[i])))\r\n\r\nfor i in range(3):\r\n a[i] = list(map(int, input().split()))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] > 0:\r\n out[i][j] = (a[i][j] + out[i][j]) % 2 \r\n if j < 2:\r\n out[i][j+1] = (a[i][j] + out[i][j+1]) % 2 \r\n if i < 2:\r\n out[i+1][j] = (a[i][j] + out[i+1][j]) % 2 \r\n if i > 0:\r\n out[i-1][j] = (a[i][j] + out[i-1][j]) % 2 \r\n if j > 0:\r\n out[i][j-1] = (a[i][j] + out[i][j-1]) % 2 \r\n\r\n\r\nprintArr(out)", "tab=[]\r\nresult=[]\r\nfor i in range(0,3):\r\n a=[int(i) for i in input().split()]\r\n tab.append(a)\r\n result.append([True,True,True])\r\n \r\n\r\n\r\nif(tab[0][0]%2 != 0):\r\n result[0][0] = not result[0][0]\r\n result[1][0] = not result[1][0]\r\n #result[1][1] = not result[1][1]\r\n result[0][1] = not result[0][1]\r\nif(tab[1][0]%2 != 0):\r\n result[0][0] = not result[0][0]\r\n result[1][0] = not result[1][0]\r\n result[2][0] = not result[2][0]\r\n #result[0][1] = not result[0][1]\r\n result[1][1] = not result[1][1]\r\n #result[2][1] = not result[2][1]\r\n \r\nif(tab[2][0]%2 != 0):\r\n #result[1][1] = not result[1][1]\r\n result[2][0] = not result[2][0]\r\n result[2][1] = not result[2][1]\r\n result[1][0] = not result[1][0]\r\nif(tab[0][1]%2 != 0):\r\n result[0][0] = not result[0][0]\r\n #result[1][0] = not result[1][0]\r\n result[0][1] = not result[0][1]\r\n result[1][1] = not result[1][1]\r\n #result[1][2] = not result[1][2]\r\n result[0][2] = not result[0][2]\r\nif(tab[1][1]%2 != 0):\r\n result[1][1] = not result[1][1]\r\n result[0][1] = not result[0][1]\r\n result[2][1] = not result[2][1]\r\n result[1][0] = not result[1][0]\r\n result[1][2] = not result[1][2]\r\nif(tab[2][1]%2 != 0):\r\n #result[1][0] = not result[1][0]\r\n result[1][1] = not result[1][1]\r\n #result[1][2] = not result[1][2]\r\n result[2][0] = not result[2][0];\r\n result[2][1] = not result[2][1]\r\n result[2][2] = not result[2][2]\r\nif(tab[0][2]%2 != 0):\r\n #result[1][1] = not result[1][1]\r\n result[0][1] = not result[0][1]\r\n result[0][2] = not result[0][2]\r\n result[1][2] = not result[1][2]\r\nif(tab[1][2]%2 != 0):\r\n #result[0][1] = not result[0][1]\r\n result[0][2] = not result[0][2]\r\n result[1][1] = not result[1][1]\r\n result[1][2] = not result[1][2]\r\n #result[2][1] = not result[2][1]\r\n result[2][2] = not result[2][2]\r\nif(tab[2][2]%2 != 0):\r\n result[2][2] = not result[2][2]\r\n result[2][1] = not result[2][1]\r\n result[1][2] = not result[1][2]\r\n #result[1][1] = not result[1][1]\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n print(int(result[i][j]),end=\"\")\r\n print()", "matrix = []\nfor i in range(3):\n row = list(map(int, input().split()))\n matrix.append(row)\n\nstate = [[1 for i in range(3)] for j in range(3)]\n\n\ndef toggle(row, col):\n state[row][col] = 1 - state[row][col]\n\n if row-1 >= 0:\n state[row-1][col] = 1 - state[row-1][col]\n\n if row + 1 < 3:\n state[row+1][col] = 1 - state[row+1][col]\n\n if col-1 >= 0:\n state[row][col-1] = 1 - state[row][col-1]\n\n if col+1 < 3:\n state[row][col+1] = 1 - state[row][col+1]\n\n\nfor r in range(3):\n for c in range(3):\n if matrix[r][c] % 2 == 1:\n toggle(r, c)\n\nfor k in range(3):\n state[k] = [str(elem) for elem in state[k]]\n print(\"\".join(state[k]))\n\t\t \t\t\t\t \t\t\t\t\t\t\t\t \t\t\t \t\t\t \t\t", "#-------------------------------------------------------------------------------\r\n# Name: module1\r\n# Purpose:\r\n#\r\n# Author: vkiefner\r\n#\r\n# Created: 07.06.2023\r\n# Copyright: (c) vkiefner 2023\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\n\r\ngrid = []\r\nfor _ in range(3):\r\n row = list(map(int, input().split()))\r\n grid.append(row)\r\n\r\ndef toggle_light(state):\r\n return 0 if state else 1\r\n\r\ncurrent_state = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n num_presses = grid[i][j]\r\n if num_presses % 2 == 1:\r\n current_state[i][j] = toggle_light(current_state[i][j])\r\n if i > 0:\r\n current_state[i-1][j] = toggle_light(current_state[i-1][j])\r\n if i < 2:\r\n current_state[i+1][j] = toggle_light(current_state[i+1][j])\r\n if j > 0:\r\n current_state[i][j-1] = toggle_light(current_state[i][j-1])\r\n if j < 2:\r\n current_state[i][j+1] = toggle_light(current_state[i][j+1])\r\n\r\nfor i in range(3):\r\n print(\"\".join(str(state) for state in current_state[i]))\r\n", "a = []\r\nans = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\r\nfor i in range(3):\r\n b = list(map(int, input().split()))\r\n a.append(b)\r\nfor i in range(3):\r\n for j in range(3):\r\n if i == 0:\r\n x1 = 0\r\n x2 = a[i + 1][j]\r\n elif i == 2:\r\n x1 = a[i - 1][j]\r\n x2 = 0\r\n else:\r\n x1 = a[i - 1][j]\r\n x2 = a[i + 1][j]\r\n if j == 0:\r\n y1 = 0\r\n y2 = a[i][j + 1]\r\n elif j == 2:\r\n y1 = a[i][j - 1]\r\n y2 = 0\r\n else:\r\n y1 = a[i][j - 1]\r\n y2 = a[i][j + 1]\r\n x = x1 + x2 + y1 + y2 + a[i][j] + 1\r\n ans[i][j] = str(x % 2)\r\nfor i in range(3):\r\n print(\"\".join(ans[i]))", "pressed = [[0 for p in range(4)] for _ in range(4)]\r\ntoggled = [[0 for q in range(4)] for _ in range(4)]\r\n# print(pressed)\r\n# print(toggled)\r\n\r\n\r\ntemp = [[int(x) for x in input().split()] for y in range(3)]\r\n# print(temp)\r\nm = 0\r\nfor i in range(1, 4):\r\n k = 0\r\n for j in range(1, 4):\r\n pressed[i][j] = temp[m][k]\r\n toggled[i][j] = temp[m][k]\r\n k += 1\r\n m += 1\r\n# t = pressed.copy()\r\n# toggled = t.copy()\r\n# print(pressed, 'p')\r\n# print(toggled, \"t\")\r\n# toggled[1][2] += pressed[1][1]\r\n# print(toggled)\r\n\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n # print(pressed[i][j], end='')\r\n # print(j)\r\n # if pressed[i][j] != 0:\r\n toggled[i][j - 1] = toggled[i][j - 1] + pressed[i][j]\r\n toggled[i - 1][j] = toggled[i - 1][j] + pressed[i][j]\r\n # toggled[i][j + 1] = toggled[i][j + 1] + pressed[i][j]\r\n # toggled[i + 1][j] = toggled[i + 1][j] + pressed[i][j]\r\n if j + 1 < 4:\r\n toggled[i][j + 1] += pressed[i][j]\r\n if i + 1 < 4:\r\n toggled[i + 1][j] += pressed[i][j]\r\n # print()\r\n\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if toggled[i][j] % 2:\r\n print(0, end='')\r\n else:\r\n print(1, end=\"\")\r\n print()\r\n\r\n# print(toggled)\r\n#i + 1 < len(toggled) and\r\n\r\n", "#!/usr/bin/env python\n\ng = [\n [1, 1, 1, 1, 1],\n [1, 1, 1, 1, 1],\n [1, 1, 1, 1, 1],\n [1, 1, 1, 1, 1],\n [1, 1, 1, 1, 1],\n]\n\nt = [\n [0, 0, 0, 0, 0],\n [0, *list(map(int, input().split())), 0],\n [0, *list(map(int, input().split())), 0],\n [0, *list(map(int, input().split())), 0],\n [0, 0, 0, 0, 0],\n]\n\nids = list((x, y) for x in range(1, 4) for y in range(1, 4))\n\nfor i, j in ids:\n p = pow(-1, t[i][j])\n g[i][j] *= p\n g[i-1][j] *= p\n g[i+1][j] *= p\n g[i][j-1] *= p\n g[i][j+1] *= p\n\nfor i, j in ids:\n g[i][j] = max(0, g[i][j])\n\nfor a in g[1:4]:\n print(''.join(map(str, a[1:4])))\n", "grid = []\r\ncrr = []\r\nfor i in range(3):\r\n crr.append([1] * 3)\r\n ele = list(map(int, input().split()))\r\n grid.append(ele)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n val = grid[i][j] % 2\r\n if val == 1:\r\n crr[i][j] = 1 - crr[i][j] \r\n direc = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n for dr, dc in direc:\r\n row = i + dr\r\n col = j + dc\r\n if 0 <= row < 3 and 0 <= col < 3:\r\n crr[row][col] = 1 - crr[row][col] \r\n\r\nfor ele in crr:\r\n p = \"\"\r\n for j in ele:\r\n p += str(j)\r\n print(p)\r\n", "l1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nl3 = list(map(int, input().split()))\r\nl = []\r\n\r\nl.append(l1)\r\nl.append(l2)\r\nl.append(l3)\r\n\r\nlight = {\r\n 0: {0: 1, 1: 1, 2: 1},\r\n 1: {0: 1, 1: 1, 2: 1},\r\n 2: {0: 1, 1: 1, 2: 1},\r\n}\r\n\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] % 2 == 0:\r\n l[i][j] = 0\r\n else:\r\n l[i][j] = 1\r\n\r\n# for i in l:\r\n# for j in range(len(i)):\r\n# print(i, end=' ')\r\n# print(\"\")\r\n\r\n\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if l[i][j] == 1:\r\n light[i][j] = abs(light[i][j] - 1)\r\n\r\n if j + 1 in light:\r\n light[i][j + 1] = abs(light[i][j + 1] - 1)\r\n\r\n if j - 1 in light:\r\n light[i][j - 1] = abs(light[i][j - 1] - 1)\r\n\r\n if i + 1 in light:\r\n light[i + 1][j] = abs(light[i + 1][j] - 1)\r\n\r\n if i - 1 in light:\r\n light[i - 1][j] = abs(light[i - 1][j] - 1)\r\n\r\nfor i in light.values():\r\n for j in i.values():\r\n print(j, end='')\r\n print(\"\")\r\n", "lights = [[1,1,1],[1,1,1],[1,1,1]]\r\npresses = [[0,0,0],[0,0,0],[0,0,0]]\r\nfor i in range(3):\r\n presses[i] = [int(j) for j in input().split()]\r\nfor i in range(3):\r\n for k in range(3):\r\n while presses[i][k]>0:\r\n lights[i][k] = 1-lights[i][k]\r\n if i>0:\r\n lights[i-1][k] = 1-lights[i-1][k]\r\n if i<2:\r\n lights[i+1][k] = 1-lights[i+1][k]\r\n if k>0:\r\n lights[i][k-1] = 1-lights[i][k-1]\r\n if k<2:\r\n lights[i][k+1] = 1-lights[i][k+1]\r\n presses[i][k]-=1\r\n\r\nfor i in range(3):\r\n print(str(lights[i][0])+str(lights[i][1])+str(lights[i][2]))", "lamps = [list(map(int, input().split())), list(map(int, input().split())), list(map(int, input().split()))]\r\nlamps1 = [[lamps[0][0] + lamps[0][1] + lamps[1][0], lamps[0][1] + lamps[0][0] + lamps[0][2] + lamps[1][1], lamps[0][2] + lamps[0][1] + lamps[1][2]]]\r\nlamps1.append([lamps[1][0] + lamps[0][0] + lamps[2][0] + lamps[1][1], lamps[0][1] + lamps[1][0] + lamps[1][1] + lamps[1][2] + lamps[2][1], lamps[1][2] + lamps[1][1] + lamps[0][2] + lamps[2][2]])\r\nlamps1.append([lamps[2][0] + lamps[1][0] + lamps[2][1], lamps[2][1] + lamps[2][0] + lamps[2][2] + lamps[1][1], lamps[2][2] + lamps[2][1] + lamps[1][2]])\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif lamps1[i][j] % 2 == 0:\r\n\t\t\tlamps[i][j] = 1\r\n\t\telse:\r\n\t\t\tlamps[i][j] = 0\r\nprint(*lamps[0], sep = '')\r\nprint(*lamps[1], sep = '')\r\nprint(*lamps[2], sep = '')", "import traceback\r\n\r\nsize=3\r\n\r\ndef dataInput():\r\n s=\"\"\r\n switches=bulidGrid2()\r\n solve(switches)\r\n for i in range(len(lights)):\r\n for j in range(len(lights[i])):\r\n s+=str(lights[i][j])\r\n s+=\"\\n\"\r\n print(s)\r\n\r\ndef bulidGrid(r):\r\n grid=[]\r\n rows,cols=size,size\r\n for i in range(rows):\r\n col=[]\r\n for j in range(cols):\r\n col.append(r)\r\n grid.append(col)\r\n return grid\r\n\r\ndef bulidGrid2():\r\n grid=[]\r\n rows,cols=size,size\r\n for i in range(rows):\r\n col=[]\r\n t=input().split(\" \")\r\n for j in range(cols):\r\n col.append(int(t[j]))\r\n grid.append(col)\r\n return grid \r\n\r\nlights=bulidGrid(1)\r\n\r\ndef solve(b):\r\n for i in range(len(b)):\r\n for j in range(len(b[i])):\r\n while b[i][j]>0:\r\n switchoffMatrx(i,j)\r\n switchoffMatrx(i+1,j)\r\n switchoffMatrx(i-1,j)\r\n switchoffMatrx(i,j+1)\r\n switchoffMatrx(i,j-1)\r\n b[i][j]-=1\r\n \r\ndef switchoffMatrx(i,j):\r\n try:\r\n if i<0 or i>=size or j<0 or j>=size:\r\n return\r\n elif lights[i][j]==0:\r\n lights[i][j]=1\r\n elif lights[i][j]==1:\r\n lights[i][j]=0\r\n except:\r\n pass\r\n \r\ndef main():\r\n dataInput()\r\n\r\nif __name__=='__main__':\r\n try:\r\n main()\r\n except:\r\n traceback.print_exc()", "a=[[int(i) for i in input().split(' ')] for j in range(3)]\r\n\r\nfor i in range(3):\r\n \r\n for j in range(3):\r\n sum=0\r\n sum+=a[i][j]\r\n if(i>0):\r\n sum+=a[i-1][j]\r\n if(i!=2):\r\n sum+=a[i+1][j]\r\n if(j>0):\r\n sum+=a[i][j-1]\r\n if(j!=2):\r\n sum+=a[i][j+1]\r\n print(1-sum%2,end='')\r\n print()", "matrix = []\r\nstart = [\r\n [1,1,1],\r\n [1,1,1],\r\n [1,1,1]\r\n]\r\n\r\ndef zeroOne(n):\r\n if n == 0:\r\n return 1\r\n return 0\r\n\r\nfor _ in range(3):\r\n matrix.append(list(map(int,input().split())))\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] > 0 and matrix[i][j]%2 == 1:\r\n start[i][j] = zeroOne(start[i][j])\r\n if i < 2:\r\n start[i+1][j] = zeroOne(start[i+1][j])\r\n if i > 0:\r\n start[i-1][j] = zeroOne(start[i-1][j])\r\n if j > 0:\r\n start[i][j-1] = zeroOne(start[i][j-1])\r\n if j < 2:\r\n start[i][j+1] = zeroOne(start[i][j+1])\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(start[i][j],end='')\r\n print()", "from sys import stdin\r\n\r\ndef cambios(a,b, tablero):\r\n if tablero[a][b] == 1:\r\n tablero[a][b] = 0\r\n else:\r\n tablero[a][b] = 1\r\n\r\n\r\ndef proceso(usos,tablero):\r\n for repf in range(1,4):\r\n for repc in range(1,4):\r\n if usos[repf][repc] != 0 and usos[repf][repc] % 2 != 0:\r\n cambios(repf,repc,tablero)\r\n cambios(repf+1, repc, tablero)\r\n cambios(repf-1, repc, tablero)\r\n cambios(repf, repc+1, tablero)\r\n cambios(repf, repc-1, tablero)\r\n\r\n for repf in range(1,4):\r\n a=\"\"\r\n for repc in range(1,4):\r\n a += str(tablero[repf][repc])\r\n print(a)\r\n\r\n\r\ndef main():\r\n usos = [[0,0,0,0,0]]\r\n tablero = [[0,0,0,0,0],[0,1,1,1,0],[0,1,1,1,0],[0,1,1,1,0],[0,0,0,0,0]]\r\n for rep in range(3):\r\n n = [int(x) for x in stdin.readline().strip().split()]\r\n n.append(0)\r\n n.insert(0,0)\r\n usos.append(n)\r\n usos.append([0,0,0,0,0])\r\n proceso(usos,tablero)\r\n\r\nmain()", "l=[[0]*5]+[[0]+list(map(int,input().split()))+[0] for _ in range(3)]+[[0]*5]\r\nans=[['']*3 for _ in range(3)]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n ans[i-1][j-1]=str(1-((l[i][j]+l[i][j-1]+l[i][j+1]+l[i-1][j]+l[i+1][j])%2))\r\nprint('\\n'.join(map(''.join,ans)))\r\n\"above solution is copied \"\r\n\"because what i tried is running perffectly on my pc\"", "arr = []\ninp = []\nfor i in range(3):\n\tsub = [int(x) for x in input().split()][:3]\n\tinp.append(sub)\n\tarr.append([1, 1, 1])\nfor i in range(3):\n\tfor j in range(3):\n\t\tn = inp[i][j]\n\t\tif n % 2:\n\t\t\tif arr[i][j] == 1: arr[i][j] = 0\n\t\t\telse: arr[i][j] = 1\n\n\t\t\tii = i - 1\n\t\t\tif ii >= 0 and ii <= 2:\n\t\t\t\tif arr[ii][j] == 1: arr[ii][j] = 0\n\t\t\t\telse: arr[ii][j] = 1\n\t\t\tii = i + 1\n\t\t\tif ii >= 0 and ii <= 2:\n\t\t\t\tif arr[ii][j] == 1: arr[ii][j] = 0\n\t\t\t\telse: arr[ii][j] = 1\n\t\t\tjj = j - 1\n\t\t\tif jj >= 0 and jj <= 2:\n\t\t\t\tif arr[i][jj] == 1: arr[i][jj] = 0\n\t\t\t\telse: arr[i][jj] = 1\n\t\t\tjj = j + 1\n\t\t\tif jj >= 0 and jj <= 2:\n\t\t\t\tif arr[i][jj] == 1: arr[i][jj] = 0\n\t\t\t\telse: arr[i][jj] = 1\nfor i in range(3):\n\tfor j in range(3):\n\t\tprint(arr[i][j], end = '')\n\tprint()\n \t\t \t\t \t \t \t\t \t\t\t \t \t", "n=3\r\nm=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n m.append(a)\r\n\r\nk00=(m[0][0]+m[0][1]+m[1][0])%2\r\nif k00 == 1:\r\n k00=0\r\nelse:k00=1\r\nk01=(m[1][1]+m[0][0]+m[0][2]+m[0][1])%2\r\nif k01 == 1:\r\n k01=0\r\nelse:k01=1\r\nk02=(m[0][1]+m[0][2]+m[1][2])%2\r\nif k02 == 1:\r\n k02=0\r\nelse:k02=1\r\nk20=(m[2][0]+m[1][0]+m[2][1])%2\r\nif k20 == 1:\r\n k20=0\r\nelse:k20=1\r\nk22=(m[2][2]+m[2][1]+m[1][2])%2\r\nif k22 == 1:\r\n k22=0\r\nelse:k22=1\r\n\r\n\r\n\r\nk10=(m[1][1]+m[0][0]+m[2][0]+m[1][0])%2\r\nif k10 == 1:\r\n k10=0\r\nelse:k10=1\r\n\r\nk12 = (m[1][1] + m[0][2] + m[2][2]+m[1][2]) % 2\r\nif k12 == 1:\r\n k12 = 0\r\nelse:k12 = 1\r\nk21=(m[1][1]+m[2][0]+m[2][2]+m[2][1])%2\r\nif k21 == 1:\r\n k21=0\r\nelse:k21=1\r\n\r\n\r\nk11=(m[1][1]+m[1][0]+m[1][2]+m[0][1]+m[2][1])%2\r\nif k11 == 1:\r\n k11=0\r\nelse:k11=1\r\n\r\nans=[[k00,k01,k02],[k10,k11,k12],[k20,k21,k22]]\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j],end='')\r\n print('\\n',end='')", "def toggle_lights(grid):\r\n dy = [-1, 1, 0, 0]\r\n dx = [0, 0, -1, 1]\r\n\r\n def is_valid(i, j):\r\n return 0 <= i < 3 and 0 <= j < 3\r\n\r\n newGrid = [[1,1,1] for _ in range(3)]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n # Toggle the current light based on its press count\r\n grid[i][j] %= 2\r\n\r\n # Toggle side-adjacent lights if the current light is switched on\r\n if grid[i][j] == 1:\r\n newGrid[i][j] ^= 1 # Toggle the current light\r\n\r\n for d in range(4):\r\n ni, nj = i + dy[d], j + dx[d]\r\n if is_valid(ni, nj):\r\n newGrid[ni][nj] ^= 1 # Toggle side-adjacent lights\r\n\r\n return newGrid\r\n\r\n# Input\r\ngrid = [list(map(int, input().split())) for _ in range(3)]\r\n\r\n# Toggle lights\r\nresult = toggle_lights(grid)\r\n\r\n# Output\r\nfor row in result:\r\n print(\"\".join(map(str, row)))\r\n", "mat=[]\r\nglobal lights\r\nlights=[]\r\n\r\nfor x in range(3):\r\n mat.append(list(map(int,input().split())))\r\n lights.append([1,1,1])\r\n\r\ndef toggle(i,j):\r\n global lights\r\n if(lights[i][j]==1):\r\n lights[i][j]=0\r\n else:\r\n lights[i][j]=1\r\n\r\nfor x in range(3):\r\n for y in range(3):\r\n if(mat[x][y]%2==0):\r\n continue\r\n else:\r\n toggle(x,y)\r\n if(x-1>=0):\r\n toggle(x-1,y)\r\n if(x+1<=2):\r\n toggle(x+1,y)\r\n if(y-1>=0):\r\n toggle(x,y-1)\r\n if(y+1<=2):\r\n toggle(x,y+1)\r\n\r\nfor x in range(3): \r\n print(\"\".join(map(str, lights[x])))", "a=[[int(x)%2 for x in input().split()] for i in range(3)]\r\nb=[[0,0,0],[0,0,0],[0,0,0]]\r\nfor i in range(3):\r\n for j in range(3):\r\n s=a[i][j]\r\n if i>0:\r\n s+=a[i-1][j]\r\n if i<2:\r\n s+=a[i+1][j]\r\n if j>0:\r\n s+=a[i][j-1]\r\n if j<2:\r\n s+=a[i][j+1]\r\n b[i][j]=(s+1)%2\r\nfor e in b:\r\n print(\"\".join(map(str,e)))", "def change(arr):\r\n a = [[1 for j in range(3)] for i in range(3)]\r\n for i in range(3):\r\n up = 1\r\n down = 1\r\n if (i-1<0):\r\n up = 0\r\n if (i+1>2):\r\n down = 0\r\n\r\n for j in range(3):\r\n left = 1\r\n right =1\r\n if (j-1<0):\r\n left = 0\r\n if (j+1>2):\r\n right = 0\r\n total = 0\r\n \r\n total += arr[i][j]\r\n\r\n if down:\r\n total += arr[i+1][j]\r\n if up:\r\n total += arr[i-1][j]\r\n if left:\r\n total += arr[i][j-1]\r\n if right:\r\n total += arr[i][j+1]\r\n\r\n if total%2 != 0:\r\n a[i][j] = int(not(a[i][j]))\r\n \r\n return a\r\n\r\n\r\n \r\n\r\narr = []\r\nfor i in range(3):\r\n a = list(map(int, input().split()))\r\n arr.append(a) \r\nout = change(arr)\r\nfor i in range(3):\r\n b = ''.join(list(map(str,out[i])))\r\n print(b)\r\n\r\n \r\n \r\n", "array = []\nfor i in range(3):\n array.append(list(map(int,input().split())))\nfor i in range(3):\n for j in range(3):\n s = 0\n if(i-1>=0):\n s+=array[i-1][j]\n if(i+1<3):\n s+=array[i+1][j]\n if(j-1>=0):\n s+=array[i][j-1]\n if(j+1<3):\n s+=array[i][j+1]\n s+=array[i][j]\n if(s%2==0):\n print(1,end='')\n else:\n print(0,end='')\n print()\n\n", "if __name__ == '__main__':\r\n grid = [[1 for i in range(3)]for j in range(3)]\r\n press = [[] for i in range(3)]\r\n for i in range(3):\r\n press[i] = list(map(int,input().split()))\r\n dir = ((0,1),(1,0),(-1,0),(0,-1),(0,0))\r\n for i in range(3):\r\n for j in range(3):\r\n if press[i][j] %2 == 1:\r\n for x,y in dir:\r\n if 0 <= x+i < 3 and 0 <= y+j < 3:\r\n grid[x+i][y+j] = 0 if grid[x+i][y+j] else 1\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n print(grid[i][j],end = \"\")\r\n print()", "n = []\r\nfor i in range(3):\r\n m = list(map(int, input().split()))\r\n for j in range(3):\r\n m[j] = m[j] % 2\r\n n.append(m)\r\n\r\nw = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n for x, y in [[-1, 0], [0, -1], [0, 0], [1, 0], [0, 1]]:\r\n if not(i + x < 0 or i + x > 2 or y + j < 0 or y + j > 2) and n[i][j] == 1:\r\n w[i + x][j + y] = 1 - w[i + x][j + y]\r\n\r\nfor i in range(3):\r\n print(\"\".join(map(str, w[i])))\r\n\r\n\r\n \r\n\r\n\r\n ", "import sys\n\ndef get_ints():\n return list(map(int, sys.stdin.readline().strip().split()))\n\n\n\ndef helper(lst):\n temp = []\n for i in range(3):\n temp.append([0]*3)\n\n # fill the temp\n for i in range(3):\n for j in range(3):\n temp[i][j] = lst[i][j]\n if i-1 >= 0:\n temp[i][j] += lst[i-1][j]\n if i+1 <= 2:\n temp[i][j] += lst[i+1][j]\n if j-1 >= 0:\n temp[i][j] += lst[i][j-1]\n if j+1 <= 2:\n temp[i][j] += lst[i][j+1]\n\n for i in range(3):\n for j in range(3):\n if temp[i][j] % 2 == 0:\n print('1', end='')\n else:\n print('0', end='')\n print()\n\n\n\nlst = []\nfor i in range(3):\n lst.append(get_ints())\nhelper(lst)", "a = [list(map(int, input().split())) for _ in range(3)]\r\nb = [[0 for _ in range(3)] for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] % 2 == 1:\r\n b[i][j] = 1\r\nfor i in range(3):\r\n for j in range(3):\r\n s = b[i][j]\r\n if i != 0:\r\n s += b[i-1][j]\r\n if i != 2:\r\n s += b[i+1][j]\r\n if j != 0:\r\n s += b[i][j-1]\r\n if j != 2:\r\n s += b[i][j+1]\r\n print(1 if s % 2 == 0 else 0, end='')\r\n print()\r\n", "n=[]*3\r\nli = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor _ in range(3):\r\n c = list(map(int,input().split()))\r\n n.append(c)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if n[i][j]%2!=0:\r\n li[i][j] = abs(li[i][j]-1)\r\n if i==0:\r\n li[i+1][j] = abs(li[i+1][j]-1)\r\n if i==2:\r\n li[i-1][j] = abs(li[i-1][j]-1)\r\n if j==0:\r\n li[i][j+1] = abs(li[i][j+1]-1)\r\n if j==2:\r\n li[i][j-1] = abs(li[i][j-1]-1)\r\n if j==1:\r\n li[i][j+1] = abs(li[i][j+1]-1)\r\n li[i][j-1] = abs(li[i][j-1]-1)\r\n if i==1:\r\n li[i+1][j] = abs(li[i+1][j]-1)\r\n li[i-1][j] = abs(li[i-1][j]-1)\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(li[i][j],end='')\r\n print('') ", "a=[[True,True,True,True,True] for i in range(5)]\r\nfor i in range(1,4):\r\n\tx=list(map(int,input().split()))\r\n\tfor t in range(1,4):\r\n\t\tif x[t-1]%2:a[i-1][t]=not a[i-1][t];a[i][t]=not a[i][t];a[i+1][t]=not a[i+1][t];a[i][t-1]=not a[i][t-1];a[i][t+1]=not a[i][t+1]\r\nfor i in range(1,4):\r\n\tprint(''.join(list(map(lambda x:str(int(x)),a[i]))[1:4]))", "from itertools import product\r\nfrom math import ceil\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [string[i: j] for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\n#for enumeration in range(int(input())):\r\ntable = []\r\ntable_l = [['1', '1', '1'], ['1', '1', '1'], ['1', '1', '1']]\r\nfor i in range(3):\r\n nums = [int(x) for x in input().split()]\r\n table.append(nums)\r\nfor i in range(3):\r\n for j in range(3):\r\n num = table[i][j]\r\n if num % 2:\r\n table_l[i][j] = str(int(not bool(int(table_l[i][j]))))\r\n if i != 2:\r\n table_l[i + 1][j] = str(int(not bool(int(table_l[i + 1][j]))))\r\n if i != 0:\r\n table_l[i - 1][j] = str(int(not bool(int(table_l[i - 1][j]))))\r\n if j != 2:\r\n table_l[i][j + 1] = str(int(not bool(int(table_l[i][j + 1]))))\r\n if j != 0:\r\n table_l[i][j - 1] = str(int(not bool(int(table_l[i][j - 1]))))\r\nfor i in table_l:\r\n print(''.join(i))", "res = []\nboard = []\n\nfor _ in range(3):\n\tb = [True, True, True]\n\tboard.append(b)\n\nfor _ in range(3):\n\tarr = list(map(int, input().split()))\n\tres.append(arr)\n\nfor i in range(3):\n\tfor j in range(3):\n\t\tif res[i][j] % 2 == 1:\n\t\t\tboard[i][j] = not board[i][j]\n\t\t\tif (i+1) < 3:\n\t\t\t\tboard[i+1][j] = not board[i+1][j]\n\t\t\tif (j+1) < 3:\n\t\t\t\tboard[i][j+1] = not board[i][j+1]\n\t\t\tif (i-1) > -1:\n\t\t\t\tboard[i-1][j] = not board[i-1][j]\n\t\t\tif (j-1) > -1:\n\t\t\t\tboard[i][j-1] = not board[i][j-1]\n\nfor i in range(3):\n\tfor j in range(3):\n\t\tif board[i][j] == True:\n\t\t\tboard[i][j] = 1\n\t\telse:\n\t\t\tboard[i][j] = 0\n\nfor i in range(3):\n\ts = [str(j) for j in board[i]]\n\tprint(\"\".join(s))", "pressed = [[0 for i in range(5)] for j in range(5)]\r\nfor i in range(1, 4):\r\n a = list(map(int, input().split()))\r\n for j in range(3):\r\n pressed[i][j + 1] = a[j]\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n cnt = pressed[i][j] + pressed[i - 1][j] + pressed[i][j + 1] + pressed[i + 1][j] + pressed[i][j - 1]\r\n if cnt % 2 == 1:\r\n print(0, end='')\r\n else:\r\n print(1, end='')\r\n print()\r\n", "a=[]\r\nfor i in range(3):\r\n s=[int(x) for x in input().split()]\r\n a.append(s)\r\no=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if(a[i][j]%2):\r\n if(i+1<3):\r\n o[i+1][j]=abs(o[i+1][j]-1)\r\n if(j+1<3):\r\n o[i][j+1]=abs(o[i][j+1]-1)\r\n if(i-1>=0):\r\n o[i-1][j]=abs(o[i-1][j]-1)\r\n if(j-1>=0):\r\n o[i][j-1]=abs(o[i][j-1]-1)\r\n o[i][j]=abs(o[i][j]-1)\r\nfor i in o:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()\r\n", "l=[]\r\ninitial=[]\r\nfor i in range(3):\r\n l.append(list(map(int,input().split())))\r\n\r\ninitial=[[1 for i in range(3)] for j in range(3)]\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(l[i][j]%2!=0):\r\n initial[i][j]=1-initial[i][j]\r\n if(i>0):\r\n initial[i-1][j]=1-initial[i-1][j]\r\n if(j<2):\r\n initial[i][j+1]=1-initial[i][j+1]\r\n if(j>0):\r\n initial[i][j-1]=1-initial[i][j-1]\r\n if(i<2):\r\n initial[i+1][j]=1-initial[i+1][j]\r\nfor i in range(3):\r\n for j in initial[i]:\r\n print(j,end=\"\")\r\n print()\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nlights = [ [ 1 ] * 3 for _ in range(3) ]\r\npressed = []\r\nfor i in range(3):\r\n pressed.append(list(map(int,input().split())))\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if ( pressed[i][j] != 0 and pressed[i][j] % 2 == 1 ):\r\n lights[i][j] = int(not(lights[i][j]))\r\n if i - 1 >= 0:\r\n lights[i-1][j] = int(not(lights[i-1][j]))\r\n\r\n if i + 1 < 3 :\r\n lights[i+1][j] = int(not(lights[i+1][j]))\r\n\r\n if j - 1 >= 0 :\r\n lights[i][j-1] = int(not(lights[i][j-1]))\r\n\r\n if j + 1 < 3 :\r\n lights[i][j+1] = int(not(lights[i][j+1]))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(lights[i][j],end=\"\")\r\n print()\r\n", "def toggle(s,t):\r\n for i in range(t):\r\n if s==0:\r\n s=1\r\n else:\r\n s=0\r\n return s\r\n\r\nl=[[1,1,1],[1,1,1],[1,1,1]]\r\ns=[]\r\nfor i in range(3):\r\n s.append(list(map(int,input().split())))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if (i==0 and j==0):\r\n l[0][0]=toggle(l[0][0],s[0][0])\r\n l[0][1]=toggle(l[0][1],s[0][0])\r\n l[1][0]=toggle(l[1][0],s[0][0])\r\n elif i==0 and j==1:\r\n l[0][0]=toggle(l[0][0],s[0][1])\r\n l[0][1]=toggle(l[0][1],s[0][1])\r\n l[0][2]=toggle(l[0][2],s[0][1])\r\n l[1][1]=toggle(l[1][1],s[0][1])\r\n elif i==0 and j==2:\r\n l[1][2]=toggle(l[1][2],s[0][2])\r\n l[0][1]=toggle(l[0][1],s[0][2])\r\n l[0][2]=toggle(l[0][2],s[0][2])\r\n elif (i==1 and j==0):\r\n l[0][0]=toggle(l[0][0],s[1][0])\r\n l[1][1]=toggle(l[1][1],s[1][0])\r\n l[1][0]=toggle(l[1][0],s[1][0])\r\n l[2][0]=toggle(l[2][0],s[1][0])\r\n elif i==1 and j==1:\r\n l[1][0]=toggle(l[1][0],s[1][1])\r\n l[0][1]=toggle(l[0][1],s[1][1])\r\n l[1][2]=toggle(l[1][2],s[1][1])\r\n l[1][1]=toggle(l[1][1],s[1][1])\r\n l[2][1]=toggle(l[2][1],s[1][1])\r\n elif i==1 and j==2:\r\n l[1][2]=toggle(l[1][2],s[1][2])\r\n l[2][2]=toggle(l[2][2],s[1][2])\r\n l[0][2]=toggle(l[0][2],s[1][2])\r\n l[1][1]=toggle(l[1][1],s[1][2])\r\n elif (i==2 and j==0):\r\n l[2][0]=toggle(l[2][0],s[2][0])\r\n l[2][1]=toggle(l[2][1],s[2][0])\r\n l[1][0]=toggle(l[1][0],s[2][0])\r\n elif i==2 and j==1:\r\n l[2][0]=toggle(l[2][0],s[2][1])\r\n l[2][1]=toggle(l[2][1],s[2][1])\r\n l[2][2]=toggle(l[2][2],s[2][1])\r\n l[1][1]=toggle(l[1][1],s[2][1])\r\n else:\r\n l[2][2]=toggle(l[2][2],s[2][2])\r\n l[1][2]=toggle(l[1][2],s[2][2])\r\n l[2][1]=toggle(l[2][1],s[2][2])\r\n\r\nfor i in l:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()", "x11 , x12 , x13 = map(int,input().split())\r\nx21 , x22 , x23 = map(int,input().split())\r\nx31 , x32 , x33 = map(int,input().split())\r\nprint((\"1\" if (x11 + x12 + x21) % 2 == 0 else \"0\"),\r\n (\"1\" if (x11 + x12 + x13 + x22) % 2 == 0 else \"0\"),\r\n (\"1\" if (x12 + x13 + x23) % 2 == 0 else \"0\"),sep=\"\")\r\nprint((\"1\" if (x11 + x21 + x22 + x31) % 2 == 0 else \"0\"),\r\n (\"1\" if (x12 + x21 + x22 + x23 + x32) % 2 == 0 else \"0\"),\r\n (\"1\" if (x13 + x22 + x23 + x33) % 2 == 0 else \"0\"),sep=\"\")\r\nprint((\"1\" if (x21 + x31 + x32) % 2 == 0 else \"0\"),\r\n (\"1\" if (x22 + x31 + x32 + x33) % 2 == 0 else \"0\"),\r\n (\"1\" if(x23 + x32 + x33) % 2 == 0 else \"0\"),sep=\"\")\r\n", "lights = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\ni = 0\r\nj = 0\r\na = 0\r\npress = []\r\nwhile a <= 2:\r\n line = []\r\n x, y, z = input().split()\r\n line.append(int(x))\r\n line.append(int(y))\r\n line.append(int(z))\r\n press.append(line)\r\n a = a + 1\r\nwhile i <= 2:\r\n j = 0\r\n while j <= 2:\r\n if i == 1 and j == 1:\r\n (lights[i])[j] = 1 + (press[i])[j] + (press[i + 1])[j] + (press[i])[j + 1] + (press[i - 1])[j] + (press[i])[\r\n j - 1]\r\n elif i == 0 and j == 1:\r\n lights[i][j] = 1 + press[0][0] + press[0][2] + press[1][1] + press[0][1]\r\n elif (i == 2 and j == 1):\r\n lights[i][j] = 1 + press[2][0] + press[2][2] + press[1][1] + press[2][1]\r\n elif (i == 0 and j == 0):\r\n lights[i][j] = 1 + press[0][0] + press[0][1] + press[1][0]\r\n elif (i == 0 and j == 2):\r\n lights[i][j] = 1 + press[0][2] + press[0][1] + press[1][2]\r\n elif i == 1 and j == 0:\r\n lights[i][j] = 1 + press[0][0] + press[1][1] + press[2][0] + press[1][0]\r\n elif i == 1 and j == 2:\r\n lights[i][j] = 1 + press[0][2] + press[1][1] + press[2][2] + press[1][2]\r\n elif j == 0 and i == 2:\r\n lights[i][j] = 1 + press[2][0] + press[1][0] + press[2][1]\r\n elif j == 2 and i == 2:\r\n lights[i][j] = 1 + press[2][2] + press[1][2] + press[2][1]\r\n j = j + 1\r\n i = i + 1\r\ni = 0\r\nj = 0\r\nwhile i <= 2:\r\n j = 0\r\n while j <= 2:\r\n if lights[i][j] % 2 == 0:\r\n lights[i][j] = 0\r\n else:\r\n lights[i][j] = 1\r\n j = j + 1\r\n i = i + 1\r\ni = 0\r\nj = 0\r\nwhile i <= 2:\r\n j = 0\r\n while j <= 2:\r\n lights[i][j] = str(lights[i][j])\r\n j = j + 1\r\n i = i + 1\r\nprint(\"\".join(lights[0]))\r\nprint(\"\".join(lights[1]))\r\nprint(\"\".join(lights[2]))\r\n", "\r\nmat = [[1,1,1],[1,1,1],[1,1,1]]\r\ndef sap(i,j):\r\n if(mat[i][j] == 1):\r\n mat[i][j] = 0\r\n else:\r\n mat[i][j] = 1\r\n\r\ndef ck(i,j):\r\n sap(i,j)\r\n if(i+1 <= 2):\r\n sap(i+1,j)\r\n if(j+1 <= 2):\r\n sap(i,j+1)\r\n if(i-1 >= 0):\r\n sap(i-1,j)\r\n if(j-1 >= 0):\r\n sap(i,j-1)\r\n # if(i+1 <= 2 and j+1 <= 2):\r\n # sap(i+1,j+1)\r\n # if(i-1 >= 0 and j-1 >= 0):\r\n # sap(i-1,j-1)\r\n # if(i-1 >= 0 and j+1 <= 2):\r\n # sap(i-1,j+1)\r\n # if(i+1 <= 2 and j-1 >= 0):\r\n # sap(i+1,j-1)\r\n \r\n\r\ninp=[]\r\nfor i in range(3):\r\n temp = list(map(int, input().split()))\r\n inp.append(temp)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(inp[i][j] %2 != 0):\r\n ck(i,j)\r\nfor x in mat:\r\n print(''.join(map(str,x)))\r\n \r\n\r\n", "a = [[0 for x in range(3)] for x in range(3)]\r\nc = [[0 for x in range(3)] for x in range(3)]\r\nb = [[1 for x in range(3)] for x in range(3)]\r\nk=0\r\na[0][0],a[0][1],a[0][2]=map(int,input().split())\r\na[1][0],a[1][1],a[1][2]=map(int,input().split())\r\na[2][0],a[2][1],a[2][2]=map(int,input().split())\r\n\r\nc[0][0]=a[0][0]+a[0][1]+a[1][0]\r\nc[0][1]=a[0][1]+a[0][2]+a[1][1]+a[0][0]\r\nc[0][2]=a[0][2]+a[0][1]+a[1][2]\r\n\r\nc[1][0]=a[1][0]+a[1][1]+a[2][0]+a[0][0]\r\nc[1][1]=a[1][1]+a[1][2]+a[1][0]+a[0][1]+a[2][1]\r\nc[1][2]=a[1][2]+a[0][2]+a[2][2]+a[1][1]\r\n\r\nc[2][0]=a[2][0]+a[2][1]+a[1][0]\r\nc[2][1]=a[2][1]+a[2][2]+a[2][0]+a[1][1]\r\nc[2][2]=a[2][2]+a[2][1]+a[1][2]\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if c[i][j]%2==1:\r\n b[i][j]=0\r\nfor row in b:\r\n print (\"\".join(map(str,row)))", "a = []\r\nfor i in range(3) :\r\n a.append((str)(input()).split())\r\ncnt = [[0,0,0],[0,0,0],[0,0,0]]\r\nfor i in range(3) :\r\n for j in range(3) :\r\n cnt[i][j] += (int)(a[i][j])\r\n if i!=2 : cnt[i+1][j] += (int)(a[i][j])\r\n if j!=2 : cnt[i][j+1] += (int)(a[i][j])\r\n if i : cnt[i-1][j] += (int)(a[i][j])\r\n if j : cnt[i][j-1] += (int)(a[i][j])\r\nfor i in range(3) : \r\n for j in range(3) :\r\n if cnt[i][j]%2 == 0 : print(1 , end = \"\")\r\n else : print(0 , end=\"\")\r\n print()", "arr=[]\r\narr.append(list(map(int,input().split())))\r\narr.append(list(map(int,input().split())))\r\narr.append(list(map(int,input().split())))\r\ntemp=[[0 for j in range(3)] for i in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if(arr[i][j]>=1):\r\n if(arr[i][j]%2!=0):\r\n temp[i][j]+=1\r\n if(i-1>=0):\r\n temp[i-1][j]+=1\r\n if(j+1<3):\r\n temp[i][j+1]+=1\r\n if(i+1<3):\r\n temp[i+1][j]+=1\r\n if(j-1>=0):\r\n temp[i][j-1]+=1\r\nfor i in range(3):\r\n for j in range(3):\r\n if(temp[i][j]%2==0):\r\n arr[i][j]=1\r\n else:\r\n arr[i][j]=0\r\nfor i in range(3):\r\n for j in arr[i]:\r\n print(j,end='') \r\n print() \r\n", "a=[]\r\nfor i in range(3):\r\n a.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n a[i][j]%=2\r\ndef t(i,j):\r\n x=[0,0,1,-1]\r\n y=[1,-1,0,0]\r\n ans[i][j]=1-ans[i][j]\r\n for k in range(4):\r\n if(i+x[k]<3 and j+y[k]<3 and i+x[k]>=0 and j+y[k]>=0):\r\n ans[i+x[k]][j+y[k]]=1-ans[i+x[k]][j+y[k]]\r\nans=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if(a[i][j]==1):\r\n t(i,j)\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j],end='')\r\n print()", "table = [[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0],[0,0,0,0,0]]\r\nans = [[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1]]\r\ndef change(i , j):\r\n ans[i][j] ^= 1\r\n ans[i - 1][j] ^= 1\r\n ans[i + 1][j] ^= 1\r\n ans[i][j + 1] ^= 1\r\n ans[i][j - 1] ^= 1\r\n\r\nfor i in range(1 , 4):\r\n row = input().split()\r\n table[i][1] = int(row[0])\r\n table[i][2] = int(row[1])\r\n table[i][3] = int(row[2])\r\n\r\nfor i in range(1 , 4):\r\n for j in range(1 , 4):\r\n if table[i][j] % 2 == 1:\r\n change(i , j)\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print(ans[i][j] , end=\"\")\r\n print(\"\")", "lights=[[True,True,True],[True,True,True],[True,True,True]]\r\ninp=[]\r\nfor _ in range(3):\r\n ro2=[int(x) for x in input().split()]\r\n inp.append(ro2)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(inp[i][j]%2==0):\r\n continue\r\n else:\r\n lights[i][j]=not lights[i][j]\r\n if(i!=0):\r\n lights[i-1][j]=not lights[i-1][j]\r\n if(i!=2):\r\n lights[i+1][j]=not lights[i+1][j]\r\n if(j!=0):\r\n lights[i][j-1]=not lights[i][j-1]\r\n if(j!=2):\r\n lights[i][j+1]=not lights[i][j+1]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(1 if lights[i][j] else 0, end=\"\")\r\n print()", "matrix=[]\r\nfor i in range (3):\r\n row=list(map(int,input().split()))\r\n matrix.append(row)\r\n\r\ninitial=[[1 for i in range (3)] for j in range (3)]\r\n\r\nfor i in range(3):\r\n for j in range (3):\r\n if matrix[i][j]%2==1:\r\n initial[i][j]= int(not initial[i][j])\r\n if i>0:\r\n initial[i-1][j]= int(not initial[i-1][j])\r\n if i <2:\r\n initial[i+1][j]= int(not initial[i+1][j])\r\n if j >0:\r\n initial[i][j-1]= int(not initial[i][j-1])\r\n if j<2:\r\n initial[i][j+1]= int(not initial[i][j+1])\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(initial[i][j], end=\"\")\r\n print()", "def isValid(i, j):\r\n if i < 0 or i >= 3 or j < 0 or j >= 3:\r\n return False\r\n else:\r\n return True\r\n\r\n\r\ndef toggle(mat, i, j):\r\n mat[i][j] = not mat[i][j]\r\n if isValid(i + 1, j):\r\n mat[i + 1][j] = not mat[i + 1][j]\r\n if isValid(i - 1, j):\r\n mat[i - 1][j] = not mat[i - 1][j]\r\n if isValid(i, j + 1):\r\n mat[i][j + 1] = not mat[i][j + 1]\r\n if isValid(i, j - 1):\r\n mat[i][j - 1] = not mat[i][j - 1]\r\n\r\n\r\nmat = []\r\nfor i in range(3):\r\n a = list(map(int, input().split()))\r\n mat.append(a)\r\nres = [\r\n [True, True, True],\r\n [True, True, True],\r\n [True, True, True]\r\n]\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(mat[i][j]):\r\n toggle(res, i, j)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if res[i][j]:\r\n print(\"1\", end=\"\")\r\n else:\r\n print(\"0\", end=\"\")\r\n print()", "z=[[0]*5]*2\r\nfor _ in range(1,4):z.insert(_,[0]+list(map(int,input().split()))+[0])\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print((((z[i-1][j]+z[i+1][j]+z[i][j-1]+z[i][j+1]+z[i][j])%2)+1)%2,end=\"\")\r\n print()", "lights = [[1,1,1],[1,1,1],[1,1,1]]\r\nx = [input().split()]\r\nx.append(input().split())\r\nx.append(input().split())\r\nfor i in range(3):\r\n for j in range(3):\r\n lights[i][j] = (lights[i][j]+ int(x[i][j]))%2\r\n if i-1 >= 0:\r\n lights[i-1][j] = (lights[i-1][j]+int(x[i][j]))%2\r\n if i+1 < 3:\r\n lights[i+1][j] = (lights[i+1][j]+int(x[i][j]))%2\r\n if j-1 >= 0:\r\n lights[i][j-1] = (lights[i][j-1]+int(x[i][j]))%2\r\n if j+1 < 3:\r\n lights[i][j+1] = (lights[i][j+1]+int(x[i][j]))%2\r\n\r\nrow1 = row2 = row3 = \"\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if(i == 0):\r\n row1+= str(lights[i][j])\r\n elif(i == 1):\r\n row2 += str(lights[i][j])\r\n else:\r\n row3+= str(lights[i][j])\r\nprint(row1)\r\nprint(row2)\r\nprint(row3)\r\n ", "arr=[[1 for i in range(3)] for j in range(3)]\r\nele=[]\r\nfor i in range(3):\r\n row = list(map(int, input().split()))\r\n ele.append(row)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(ele[i][j]%2==1):\r\n arr[i][j] = 1-arr[i][j]\r\n if(i>0):\r\n arr[i-1][j] = 1-arr[i-1][j]\r\n if(i<2):\r\n arr[i+1][j] = 1-arr[i+1][j]\r\n if(j>0):\r\n arr[i][j-1] = 1-arr[i][j-1]\r\n if(j<2):\r\n arr[i][j+1] = 1-arr[i][j+1]\r\nfor i in range(3):\r\n for j in range(3):\r\n print(arr[i][j],end=\"\")\r\n print()", "\r\nmatrix = [list(map(int, input().split())) for _ in range(3)]\r\n\r\nprint(1 if (matrix[0][0] + matrix[0][1] + matrix[1][0]) % 2 == 0 else 0, end=\"\")\r\nprint(1 if (matrix[0][0] + matrix[0][1] + matrix[0][2] + matrix[1][1]) % 2 == 0 else 0, end=\"\")\r\nprint(1 if (matrix[0][1] + matrix[0][2] + matrix[1][2]) % 2 == 0 else 0)\r\nprint(1 if (matrix[0][0] + matrix[1][0] + matrix[1][1] + matrix[2][0]) % 2 == 0 else 0, end=\"\")\r\nprint(1 if (matrix[0][1] + matrix[1][0] + matrix[1][1] + matrix[1][2] + matrix[2][1]) % 2 == 0 else 0, end=\"\")\r\nprint(1 if (matrix[0][2] + matrix[1][1] + matrix[1][2] + matrix[2][2]) % 2 == 0 else 0)\r\nprint(1 if (matrix[1][0] + matrix[2][0] + matrix[2][1]) % 2 == 0 else 0, end=\"\")\r\nprint(1 if (matrix[1][1] + matrix[2][0] + matrix[2][1] + matrix[2][2]) % 2 == 0 else 0, end=\"\")\r\nprint(1 if (matrix[1][2] + matrix[2][1] + matrix[2][2]) % 2 == 0 else 0)\r\n", "if __name__ == '__main__':\n\tarr=[]\n\tfor i in range(3):\n\t\tarr.append(list(map(int,input().split())))\n\tsides=[[0,0],[1,0],[0,1],[-1,0],[0,-1]]\n\tlight=[[1 for _ in range(3)] for _ in range(3)]\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\tsum=0\n\t\t\tfor s in sides:\n\t\t\t\tif 0<=i+s[0]<3 and 0<=j+s[1]<3:\n\t\t\t\t\tsum+=arr[i+s[0]][j+s[1]]\n\t\t\tif sum%2!=0:\n\t\t\t\tlight[i][j]=0\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\tprint(light[i][j],end=\"\")\n\t\tprint()\n\n\n", "l =[list(map(int,input().split())) for i in range (3)]\r\nfor i in range (3):\r\n for j in range (3):\r\n c=l[i][j]\r\n if i>=1:\r\n c=c+l[i-1][j]\r\n if i<=1:\r\n c=c+l[i+1][j]\r\n if j>=1:\r\n c=c+l[i][j-1]\r\n if j<=1:\r\n c=c+l[i][j+1]\r\n if c%2==0:\r\n print('1',end='')\r\n else:\r\n print('0',end='')\r\n print()", "n = 3\narr = [[1,1,1],[1,1,1],[1,1,1]]\narr2 = []\nfor i in range(n):\n arr2.append([int(i)for i in input().split()])\nfor i in range(n):\n for j in range(n):\n if arr2[i][j] %2 ==1:\n if arr [i][j]== 1:\n arr[i][j] = 0\n else:\n arr[i][j] = 1\n if j + 1 < n:\n if arr[i][j+1]== 0:\n arr [i][j+1] = 1\n else:\n arr[i][j+ 1] = 0\n if j - 1 >= 0:\n if arr[i][j-1]== 0:\n arr [i][j-1] = 1\n else:\n arr[i][j- 1] = 0\n if i + 1 < n:\n if arr[i+1][j]== 0:\n arr [i+1][j] = 1\n else:\n arr[i+1][j] = 0\n if i - 1 >= 0:\n if arr[i-1][j]== 0:\n arr [i-1][j] = 1\n else:\n arr[i-1][j] = 0\nfor i in range(n):\n for j in range(n):\n print(arr [i][j],end= '')\n print('')\n\n \t \t\t\t\t \t \t \t\t\t \t\t", "def valid(i, j):\r\n return 0 <= i < 3 and 0 <= j < 3\r\n\r\n\r\nif __name__ == \"__main__\":\r\n count = []\r\n for i in range(3):\r\n l = list(map(int, input().split()))\r\n count.append(l)\r\n di = [-1, 0, 1, 0]\r\n dj = [0, 1, 0, -1]\r\n\r\n finalState = [[0 for i in range(3)] for i in range(3)]\r\n for i in range(3):\r\n for j in range(3):\r\n if count[i][j] > 0:\r\n finalState[i][j] += count[i][j]\r\n for k in range(4):\r\n if valid(i + di[k], j + dj[k]):\r\n finalState[i + di[k]][j + dj[k]] += count[i][j]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n if finalState[i][j] % 2 == 0:\r\n print(\"1\", end=\"\")\r\n else:\r\n print(\"0\", end=\"\")\r\n print()\r\n", "x=[[0,0,0,0,0]]\r\ndef con(m):\r\n if(m==0):\r\n return 1\r\n else:\r\n return 0\r\nfor i in range(3):\r\n x.append([0]+list(map(int,input().split()))+[0])\r\nx.append([0,0,0,0,0]) \r\n\r\ny=[]\r\nfor i in range(5):\r\n a=[]\r\n for j in range(5):\r\n a.append(1)\r\n y.append(a) \r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if(x[i][j]%2!=0):\r\n y[i][j]=con(y[i][j])\r\n y[i][j-1]=con(y[i][j-1])\r\n y[i][j+1]=con(y[i][j+1])\r\n y[i-1][j]=con(y[i-1][j])\r\n y[i+1][j]=con(y[i+1][j])\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print(y[i][j],end=\"\")\r\n print() ", "\n\ng = []\nfor _ in range(3):\n g.append(list(map(int, input().split())))\n\n\nans = []\nfor r in range(3):\n ar = \"\"\n for c in range(3):\n t = g[r][c]\n\n if c > 0:\n t += g[r][c - 1]\n \n if 2 > c:\n t += g[r][c + 1]\n\n if r > 0:\n t += g[r - 1][c]\n\n if 2 > r:\n t += g[r + 1][c]\n\n if t % 2 == 0:\n ar += \"1\"\n else:\n ar += \"0\"\n\n ans.append(ar)\n\nfor r in ans:\n print(r)\n", "from sys import stdin, stdout\r\nline_1 = list(map(int, stdin.readline().strip().split())) \r\nline_2 = list(map(int, stdin.readline().strip().split()))\r\nline_3 = list(map(int, stdin.readline().strip().split())) \r\ngrid = [line_1, line_2, line_3]\r\noutput_grid = [[\"X\", \"X\", \"X\"], [\"X\", \"X\", \"X\"], [\"X\", \"X\", \"X\"]]\r\nfor j in range(len(grid)):\r\n for k in range(len(grid[j])):\r\n current = grid[j][k] \r\n if current%2==0:\r\n if output_grid[j][k]==\"X\":\r\n output_grid[j][k] = 1 \r\n if (j+1)<len(grid):\r\n if output_grid[j+1][k]==\"X\":\r\n output_grid[j+1][k] = 1 \r\n if (j-1)>=0:\r\n if output_grid[j-1][k]==\"X\":\r\n output_grid[j-1][k] = 1 \r\n if (k+1)<3:\r\n if output_grid[j][k+1]==\"X\":\r\n output_grid[j][k+1] = 1 \r\n if (k-1)>=0:\r\n if output_grid[j][k-1]==\"X\":\r\n output_grid[j][k-1] = 1 \r\n else:\r\n if output_grid[j][k]==\"X\":\r\n output_grid[j][k] = 0 \r\n else:\r\n if output_grid[j][k]==1:\r\n output_grid[j][k] = 0 \r\n else:\r\n output_grid[j][k] = 1\r\n if (j+1)<len(grid):\r\n if output_grid[j+1][k]==\"X\":\r\n output_grid[j+1][k] = 0 \r\n elif output_grid[j+1][k]==1:\r\n output_grid[j+1][k] = 0 \r\n else:\r\n output_grid[j+1][k] = 1\r\n if (j-1)>=0:\r\n if output_grid[j-1][k]==\"X\":\r\n output_grid[j-1][k] = 0 \r\n elif output_grid[j-1][k]==1:\r\n output_grid[j-1][k] = 0 \r\n else:\r\n output_grid[j-1][k] = 1 \r\n if (k+1)<3:\r\n if output_grid[j][k+1]==\"X\":\r\n output_grid[j][k+1] = 0 \r\n elif output_grid[j][k+1]==1:\r\n output_grid[j][k+1] = 0 \r\n else:\r\n output_grid[j][k+1] = 1 \r\n if (k-1)>=0:\r\n if output_grid[j][k-1]==\"X\":\r\n output_grid[j][k-1] = 0 \r\n elif output_grid[j][k-1]==1:\r\n output_grid[j][k-1] = 0 \r\n else:\r\n output_grid[j][k-1] = 1 \r\nfor j in output_grid:\r\n for k in j:\r\n stdout.write(f\"{k}\")\r\n stdout.write(\"\\n\")\r\n ", "a = []\r\n\r\nfor i in range (3):\r\n a.append([int(j) for j in input().split()])\r\n\r\nl = []\r\nfor i in range (3):\r\n l.append([0] * 3)\r\n\r\nl[0][0] = (a[0][0] + a[1][0] + a[0][1] + 1) % 2\r\nl[2][2] = (a[2][2] + a[1][2] + a[2][1] + 1) % 2\r\nl[2][0] = (a[2][0] + a[1][0] + a[2][1] + 1) % 2\r\nl[0][2] = (a[0][2] + a[1][2] + a[0][1] + 1) % 2\r\n\r\nl[1][0] = (a[1][0] + a[2][0] + a[1][1] + a[0][0] + 1) % 2\r\nl[0][1] = (a[0][1] + a[0][2] + a[1][1] + a[0][0] + 1) % 2\r\n\r\nl[1][2] = (a[1][2] + a[0][2] + a[1][1] + a[2][2] + 1) % 2\r\nl[2][1] = (a[2][1] + a[2][0] + a[1][1] + a[2][2] + 1) % 2\r\n\r\nl[1][1] = (a[1][1] + a[0][1] + a[1][0] + a[2][1] + a[1][2] + 1) % 2\r\n\r\nfor row in l:\r\n print (\"\".join([str(el) for el in row]))", "# Lang: pypy3.6-v7.1.0-win32\\pypy3.exe\r\n# Problem Name: LightsOut\r\n# Problem Serial No: 275\r\n# Problem Type: A\r\n# Problem Url: https://codeforces.com/problemset/problem/275/A \r\n# Solution Generated at: 2019-10-19 17:03:55.288149 UTC\r\n\r\ni = int\r\ncin = input\r\nle = len\r\n\r\nin_mat = [[j for j in list(map(i, cin().split()))] for _ in range(3)]\r\n\r\nmatrix = [\r\n [1, 1, 1],\r\n [1, 1, 1],\r\n [1, 1, 1]\r\n]\r\n\r\nfor y in range(3):\r\n for r in range(3):\r\n toggle = in_mat[y][r]\r\n # if odd\r\n if toggle & 1:\r\n matrix[y][r] ^= 1\r\n\r\n if y + 1 in range(0, 3):\r\n matrix[y+1][r] ^= 1\r\n if y - 1 in range(0, 3):\r\n matrix[y-1][r] ^= 1\r\n\r\n if r + 1 in range(0, 3):\r\n matrix[y][r + 1] ^= 1\r\n if r - 1 in range(0, 3):\r\n matrix[y][r - 1] ^= 1\r\n\r\nfor h in [\"\".join(map(str, k)) for k in matrix]:\r\n print(h)\r\n# Accepted", "import itertools\r\nfrom math import sqrt\r\nfrom collections import *\r\nimport bisect \r\nfrom itertools import *\r\nfrom functools import *\r\n\r\n\r\n\r\nbulb = [[\"1\"]*3 for _ in range(3)]\r\nmat = []\r\nfor i in range(3):\r\n t = list(map(int,(input().split())))\r\n mat.append(t)\r\ndef switch(i,j):\r\n # nonlocal bulb\r\n if i<0 or j<0 or i>2 or j>2:\r\n return\r\n else:\r\n if bulb[i][j]==\"1\":\r\n bulb[i][j] = \"0\"\r\n else:\r\n bulb[i][j] = \"1\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if mat[i][j]%2 != 0:\r\n switch(i,j)\r\n switch(i+1,j)\r\n switch(i-1,j)\r\n switch(i,j+1)\r\n switch(i,j-1)\r\n \r\nfor i in bulb:\r\n print(\"\".join(i))\r\n", "a, b, c = map(int,input().split())\r\nx, y, z = map(int,input().split())\r\nq, w, e = map(int,input().split())\r\nline1 = []\r\nline2 = []\r\nline3 = []\r\nif int(a+b+x)%2 == 1:\r\n line1.append(\"0\")\r\nif int(a+b+x)%2==0:\r\n line1.append(\"1\")\r\nif int(b+a+c+y)%2 == 0:\r\n line1.append(\"1\")\r\nif int(b+a+c+y)%2==1:\r\n line1.append(\"0\")\r\nif int(c+b+z)%2==1:\r\n line1.append(\"0\")\r\nif int(c+b+z)%2==0:\r\n line1.append(\"1\")\r\n\r\nif int(x+a+y+q)%2==1:\r\n line2.append(\"0\")\r\nif int(x+a+y+q)%2==0:\r\n line2.append(\"1\")\r\nif int(y+b+x+z+w)%2 == 0:\r\n line2.append(\"1\")\r\nif int(y+b+x+z+w)%2==1:\r\n line2.append(\"0\")\r\nif int(z+c+y+e)%2==1:\r\n line2.append(\"0\")\r\nif int(z+c+y+e)%2==0:\r\n line2.append(\"1\")\r\n\r\nif int(q+x+w)%2==1:\r\n line3.append(\"0\")\r\nif int(q+x+w)%2==0:\r\n line3.append(\"1\")\r\nif int(w+q+y+e)%2 == 0:\r\n line3.append(\"1\")\r\nif int(w+q+y+e)%2==1:\r\n line3.append(\"0\")\r\nif int(e+w+z)%2==1:\r\n line3.append(\"0\")\r\nif int(e+w+z)%2==0:\r\n line3.append(\"1\")\r\nprint(\"\".join(line1))\r\nprint(\"\".join(line2))\r\nprint(\"\".join(line3))", "a=[]\r\nfor _ in range(3):\r\n a.append(list(map(int,input().split())))\r\nans=[[0]*3 for i in range(3)]\r\n# print(ans)\r\nfor i in range(3):\r\n for j in range(3):\r\n if(i&1):\r\n if(j&1):\r\n if((a[i][j]+a[i-1][j]+a[i+1][j]+a[i][j-1]+a[i][j+1])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if(j==0):\r\n if((a[i][j]+a[i-1][j]+a[i+1][j]+a[i][j+1])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if((a[i][j]+a[i-1][j]+a[i+1][j]+a[i][j-1])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if(j&1):\r\n if(i==0):\r\n if((a[i][j]+a[i][j-1]+a[i][j+1]+a[i+1][j])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if((a[i][j]+a[i][j-1]+a[i][j+1]+a[i-1][j])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if(j==0):\r\n if(i==0):\r\n if((a[i][j]+a[i+1][j]+a[i][j+1])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if((a[i][j]+a[i-1][j]+a[i][j+1])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if(i==0):\r\n if((a[i][j]+a[i+1][j]+a[i][j-1])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n else:\r\n if((a[i][j]+a[i-1][j]+a[i][j-1])&1):\r\n ans[i][j]=0\r\n else:\r\n ans[i][j]=1\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j],end=\"\")\r\n print()", "mat=[[0,0,0,0,0]]\r\nfor i in range(3):\r\n mat.append([0]+list(map(int,input().split()))+[0])\r\nmat.append([0,0,0,0,0])\r\neq=[]\r\nfor i in range(1,4):\r\n eq_row=[]\r\n for j in range(1,4):\r\n eq_row+=[mat[i][j]+mat[i+1][j]+mat[i-1][j]+mat[i][j+1]+mat[i][j-1]]\r\n eq.append(eq_row)\r\nfor i in range(3):\r\n for j in range(3):\r\n print((eq[i][j]+1)%2,end='')\r\n print('')\r\n", "l=[[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1],[1,1,1,1,1]]\r\n\r\na=[[1,1,1,1,1]]\r\nfor _ in range(3):\r\n q=list(map(int,input().split()))\r\n q.insert(0,1)\r\n q.append(1)\r\n a.append(q)\r\na.append([1,1,1,1,1])\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if(a[i][j]%2==1):\r\n l[i][j]=abs(1-l[i][j])\r\n l[i+1][j]=abs(1-l[i+1][j])\r\n l[i][j+1]=abs(1-l[i][j+1])\r\n l[i-1][j]=abs(1-l[i-1][j])\r\n l[i][j-1]=abs(1-l[i][j-1])\r\nfor k in range(1,4):\r\n for p in range(1,4):\r\n print(l[k][p],end=\"\")\r\n print(\"\")\r\n \r\n", "g = []\r\nfor _ in range(3):\r\n s = list(map(int,input().split()))\r\n g.append(s)\r\n\r\no = [[1]*3 for _ in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if g[i][j] % 2 == 1:\r\n o[i][j] = 1 - o[i][j]\r\n\r\n if i>0:\r\n o[i-1][j] = 1-o[i-1][j]\r\n if i < 2:\r\n o[i+1][j] = 1 - o[i+1][j]\r\n if j>0:\r\n o[i][j-1] = 1-o[i][j-1]\r\n if j < 2:\r\n o[i][j+1] = 1-o[i][j+1]\r\n\r\nfor r in o:\r\n print(*r,sep='', end='\\n')\r\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nl=a,b,c\r\nfor i in range(3):\r\n for j in range(3):\r\n d=l[i][j]\r\n if i!=0:\r\n d+=l[i-1][j]\r\n if i!=2:\r\n d+=l[i+1][j]\r\n if j!=0:\r\n d+=l[i][j-1]\r\n if j!=2:\r\n d+=l[i][j+1]\r\n if d%2:\r\n print(\"0\",end=\"\")\r\n else:\r\n print(\"1\",end=\"\")\r\n print()", "l=[[0,0,0],[0,0,0],[0,0,0]]\r\nfor i in range(3):\r\n\tl2=list(map(int,input().split()))\r\n\tfor j in range(3):\r\n\t\tl[i][j]+=l2[j]\r\n\t\tif j!=0:\r\n\t\t\tl[i][j-1]+=l2[j]\r\n\t\tif j!=2:\r\n\t\t\tl[i][j+1]+=l2[j]\t\r\n\t\tif i!=0:\r\n\t\t\tl[i-1][j]+=l2[j]\r\n\t\tif i!=2:\r\n\t\t\tl[i+1][j]+=l2[j]\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif l[i][j]%2==0:\r\n\t\t\tprint(1,end=\"\")\r\n\t\telse:\r\n\t\t\tprint(0,end=\"\")\r\n\tprint()", "l = [[1, 1, 1],\n [1, 1, 1],\n [1, 1, 1]]\ns = [[int(i) for i in input().split()],\n [int(i) for i in input().split()],\n [int(i) for i in input().split()]]\nfor i in range(3):\n for j in range(3):\n if s[i][j] % 2 != 0:\n if l[i][j]:\n l[i][j] = 0\n else:\n l[i][j] = 1\n if i > 0:\n if l[i-1][j]:\n l[i-1][j] = 0\n else:\n l[i-1][j] = 1\n if i < 2:\n if l[i+1][j]:\n l[i+1][j] = 0\n else:\n l[i+1][j] = 1\n if j > 0:\n if l[i][j-1]:\n l[i][j-1] = 0\n else:\n l[i][j-1] = 1\n if j < 2:\n if l[i][j+1]:\n l[i][j+1] = 0\n else:\n l[i][j+1] = 1\nfor i in range(3):\n for j in range(3):\n print(l[i][j], end='')\n print()\n", "a1, a2, a3=[int(x) for x in input().split(\" \")] \r\nb1, b2, b3 =[int(x) for x in input().split(\" \")] \r\nc1, c2, c3=[int(x) for x in input().split(\" \")]\r\nprint(1, end=\"\") if (a1+a2+b1) %2==0 else print(0, end=\"\")\r\nprint(1, end=\"\") if (a1+a2+b2+a3) %2==0 else print(0, end=\"\")\r\nprint(1) if (a2+b3+a3) %2==0 else print(0)\r\nprint(1, end=\"\") if (a1+b2+b1+c1) %2==0 else print(0, end=\"\")\r\nprint(1, end=\"\") if (a2+b2+b1+c2+b3) %2==0 else print(0, end=\"\")\r\nprint(1) if (a3+b3+b2+c3) %2==0 else print(0)\r\nprint(1, end=\"\") if (c1+b1+c2) %2==0 else print(0, end=\"\")\r\nprint(1, end=\"\") if (c1+b2+c3+c2) %2==0 else print(0, end=\"\")\r\nprint(1) if (c3+b3+c2) %2==0 else print(0)", "a=input().split()\r\nb=input().split()\r\nc=input().split()\r\nout=[['1','1','1'],['1','1','1'],['1','1','1']]\r\nif (int(a[0])+int(a[1])+int(b[0]))%2!=0:\r\n out[0][0]='0'\r\nif (int(a[0])+int(a[1])+int(b[1])+int(a[2]))%2!=0:\r\n out[0][1]='0'\r\nif (int(a[1])+int(a[2])+int(b[2]))%2!=0:\r\n out[0][2]='0'\r\nif (int(a[0])+int(c[0])+int(b[1])+int(b[0]))%2!=0:\r\n out[1][0]='0'\r\nif (int(b[1])+int(a[1])+int(b[0])+int(b[2])+int(c[1]))%2!=0:\r\n out[1][1]='0'\r\nif (int(a[2])+int(b[1])+int(b[2])+int(c[2]))%2!=0:\r\n out[1][2]='0'\r\nif (int(b[0])+int(c[1])+int(c[0]))%2!=0:\r\n out[2][0]='0'\r\nif (int(c[0])+int(b[1])+int(c[1])+int(c[2]))%2!=0:\r\n out[2][1]='0'\r\nif (int(b[2])+int(c[1])+int(c[2]))%2!=0:\r\n out[2][2]='0'\r\nprint(''.join(out[0]))\r\nprint(''.join(out[1]))\r\nprint(''.join(out[2]))", "inp = []\nfor _ in range(3):\n inp.append(list(map(int, input().split(' '))))\n\nlights = [[1, 1, 1], [1,1,1], [1,1,1]]\n\ndef toggle(n):\n return (n+1)%2\n\nfor i in range(3):\n for j in range(3):\n inp[i][j] %= 2\n if inp[i][j] == 1:\n lights[i][j] = int(not lights[i][j])\n if i+1<3:\n #print(i+1, j)\n lights[i+1][j] = toggle(lights[i+1][j])\n if i-1 >= 0:\n lights[i-1][j] = toggle(lights[i-1][j])\n if j+1<3:\n lights[i][j+1] = toggle(lights[i][j+1])\n if j-1 >= 0:\n lights[i][j-1] = toggle(lights[i][j-1])\n\nfor l in lights:\n print(str(l[0]) + str(l[1]) + str(l[2]))\n\n\n\n", "def apply(dc, row, rNdx):\r\n for col, x in enumerate(row):\r\n if x % 2 == 1:\r\n dc[(rNdx,col)] = 1 - dc[(rNdx,col)]\r\n for k in [-1, 1]:\r\n if (rNdx + k, col) in dc:\r\n dc[(rNdx+k,col)] = 1 - dc[(rNdx+k, col)]\r\n if (rNdx, col + k) in dc:\r\n dc[(rNdx, col + k)] = 1 - dc[(rNdx, col + k)]\r\n\r\ndc = {(r,c) : 1 for r in range(3) for c in range(3)}\r\n\r\nfor r in range(3):\r\n apply(dc, list(map(int, input().split())), r)\r\n\r\nfor r in range(3):\r\n print(\"\".join(str(dc[(r,i)]) for i in range(3)))", "s=[[1]*5 for _ in range(5)]\r\n \r\nfor i in 1,2,3:\r\n \r\n\tfor j,v in zip((1,2,3),map(int,input().split())):\r\n \r\n\t\tfor k,d in (-1,0),(1,0),(0,-1),(0,1),(0,0):\r\n \r\n\t\t\ts[i+k][j+d]+=v\r\n \r\nfor i in 1,2,3:\r\n \r\n\tfor j in 1,2,3:\r\n \r\n\t\tprint(s[i][j]%2,end='')\r\n \r\n\tprint()\r\n", "def main():\r\n inp = []\r\n out = [[1 for _ in range(3)] for _ in range(3)]\r\n\r\n for _ in range(3):\r\n inp.append(list(map(lambda d: d % 2, map(int, input().split()))))\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n if inp[i][j] == 1:\r\n out[i][j] ^= 1\r\n\r\n if j > 0:\r\n out[i][j - 1] ^= 1\r\n\r\n if j < 2:\r\n out[i][j + 1] ^= 1\r\n\r\n if i > 0:\r\n out[i - 1][j] ^= 1\r\n\r\n if i < 2:\r\n out[i + 1][j] ^= 1\r\n\r\n for row in out:\r\n for elem in row:\r\n print(elem, end='')\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "board1, board = [], [[1, 1, 1] for i in range(3)]\r\nfor i in range(3):\r\n board1.append(list(map(lambda x: int(x), input().split())))\r\n\r\n\r\ndef toggle(x, y):\r\n if 3 > x >= 0 and 3 > y >= 0:\r\n board[y][x] = 0 if board[y][x] == 1 else 1\r\n\r\n\r\nfor x in range(3):\r\n for y in range(3):\r\n for times in range(board1[y][x]):\r\n toggle(x, y)\r\n toggle(x+1, y)\r\n toggle(x, y+1)\r\n toggle(x-1, y)\r\n toggle(x, y-1)\r\n\r\nfor i in board:\r\n for j in i:\r\n print(j, end='')\r\n print()\r\n", "a, b, c = map(int, input().split())\r\nd, e, f = map(int, input().split())\r\ng, h, i = map(int, input().split())\r\nans = \"\"\r\nli = []\r\nli.append(a+b+d)\r\nli.append(a+b+c+e)\r\nli.append(b+c+f)\r\nli.append(a+d+e+g)\r\nli.append(b+d+e+f+h)\r\nli.append(c+e+f+i)\r\nli.append(d+g+h)\r\nli.append(e+g+h+i)\r\nli.append(f+h+i)\r\nfor i in range(9):\r\n if li[i] % 2 == 0:\r\n ans += \"1\"\r\n else:\r\n ans += \"0\"\r\nprint(ans[0:3])\r\nprint(ans[3:6])\r\nprint(ans[6:9])", "grid = []\r\nfor _ in range(3):\r\n grid.append(list(map(int, input().split())))\r\ninti_grid = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j]%2!=0:\r\n inti_grid[i][j]= -~-inti_grid[i][j]\r\n if i-1>=0:\r\n inti_grid[i-1][j]= -~-inti_grid[i-1][j]\r\n if j-1>=0:\r\n inti_grid[i][j-1]= -~-inti_grid[i][j-1]\r\n if i+1<3:\r\n inti_grid[i+1][j]= -~-inti_grid[i+1][j]\r\n if j+1<3:\r\n inti_grid[i][j+1]= -~-inti_grid[i][j+1]\r\n \r\nfor _ in range(3):\r\n inti_grid[_] = map(str,inti_grid[_])\r\n print(''.join(inti_grid[_]))\r\n", "grid = [list(map(int, input().split())) for _ in range(3)]\r\nneighbours = [(-1, 0), (0,-1), (0,0), (0,1), (1,0)]\r\nans = [[\"0\" for _ in range(3)] for _ in range(3)]\r\n\r\nfor x,y in [(x,y) for x in range(3) for y in range(3)]:\r\n tmp_sum = 0\r\n for neigh in neighbours:\r\n if 0 <= neigh[0] + x < 3 and 0 <= neigh[1] + y < 3:\r\n tmp_sum += grid[neigh[0] + x ][neigh[1] + y]\r\n if tmp_sum % 2 == 0:\r\n ans[x][y] = \"1\"\r\nprint(\"\\n\".join([\"\".join(x) for x in ans]))", "matrix = []\r\nfor i in range(3):\r\n matrix.append(list(map(lambda x: int(x)%2, input().split())))\r\n\r\nfinal = [[1 for i in range(5)] for i in range(5)]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if matrix[i-1][j-1] == 1:\r\n final[i][j] = (final[i][j]+1) %2\r\n final[i-1][j] = (final[i-1][j]+1) %2\r\n final[i+1][j] = (final[i+1][j]+1) %2\r\n final[i][j-1] = (final[i][j-1]+1) %2\r\n final[i][j+1] = (final[i][j+1]+1) %2\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print(final[i][j], end = '')\r\n print()\r\n \r\n", "list = []\r\nlist.append([int(x) for x in input().split()])\r\nlist.append([int(x) for x in input().split()])\r\nlist.append([int(x) for x in input().split()])\r\n\r\narray = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\ndef solve(array, number, location):\r\n for i in range(3):\r\n if i > location[0] + 1:\r\n return array\r\n for j in range(3):\r\n if i == location[0] and j == location[1] or i == location[0] + 1 and j == location[1] or i == location[0] and j == location[1] + 1 or i == location[0] - 1 and j == location[1] or i == location[0] and j == location[1] - 1:\r\n array[i][j] = (array[i][j] + number % 2) % 2\r\n return array\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n array = solve(array, list[i][j], [i, j])\r\n\r\nfor i in range(3):\r\n print(\"\".join([str(x) for x in array[i]]))\r\n", "l = []\r\nfor i in range(3):\r\n\tl.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tx = l[i][j]\r\n\t\tif j-1>=0:\r\n\t\t\tx += l[i][j-1]\r\n\t\tif j+1 <3:\r\n\t\t\tx += l[i][j+1]\r\n\t\tif i-1>=0:\r\n\t\t\tx += l[i-1][j]\r\n\t\tif i+1 <3 :\r\n\t\t\tx += l[i+1][j]\r\n\t\tif x%2==0:print('1',end=\"\")\r\n\t\telse:print('0',end=\"\")\r\n\tprint()", "import itertools\nfrom math import inf\nfrom collections import *\nimport math, os, sys, heapq, bisect, random, threading\nfrom functools import lru_cache, reduce\nfrom itertools import *\nimport sys\n\n\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\ndef out(var): sys.stdout.write(str(var) + \"\\n\") # for fast output, always take string\n\n\ndef inpu(): return int(inp())\n\n\ndef lis(): return list(map(int, inp().split()))\n\n\ndef stringlis(): return list(map(str, inp().split()))\n\n\ndef sep(): return map(int, inp().split())\n\n\ndef strsep(): return map(str, inp().split())\n\n\ndef fsep(): return map(float, inp().split())\n\n\nM, M1 = 1000000007, 998244353\n\n\ndef get_divisors(n):\n a = 0\n for i in range(1, int(n / 2) + 1):\n if n % i == 0:\n a += i\n return a\n\n\ndef main():\n #sys.stdin = open(\"test2\", 'r')\n a = []\n for i in range(3):\n a.append(lis())\n\n res = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\n\n # row 1\n res[0][0] += a[0][0]\n res[0][0] += a[0][1]\n res[0][0] += a[1][0]\n\n res[0][1] += a[0][0]\n res[0][1] += a[0][1]\n res[0][1] += a[1][1]\n res[0][1] += a[0][2]\n\n res[0][2] += a[0][1]\n res[0][2] += a[0][2]\n res[0][2] += a[1][2]\n\n # row 2\n res[1][0] += a[0][0]\n res[1][0] += a[1][0]\n res[1][0] += a[1][1]\n res[1][0] += a[2][0]\n\n res[1][1] += a[0][1]\n res[1][1] += a[1][0]\n res[1][1] += a[1][1]\n res[1][1] += a[1][2]\n res[1][1] += a[2][1]\n\n res[1][2] += a[0][2]\n res[1][2] += a[1][2]\n res[1][2] += a[1][1]\n res[1][2] += a[2][2]\n\n\n # row 3\n res[2][0] += a[1][0]\n res[2][0] += a[2][1]\n res[2][0] += a[2][0]\n\n res[2][1] += a[2][0]\n res[2][1] += a[2][1]\n res[2][1] += a[1][1]\n res[2][1] += a[2][2]\n\n res[2][2] += a[2][1]\n res[2][2] += a[2][2]\n res[2][2] += a[1][2]\n\n\n for i in range(3):\n for j in range(3):\n res[i][j] = str(res[i][j] % 2)\n\n for i in res:\n print(''.join(i))\n\nif __name__ == '__main__':\n # sys.setrecursionlimit(1000000)\n # threading.stack_size(1024000)\n # threading.Thread(target=main).start()\n main()\n\n\t\t \t\t\t \t \t\t \t \t \t \t\t\t\t\t\t\t", "def func(x):\r\n\tp = [1] * 5\r\n\tq = [x - 3, x - 1, x + 1, x + 3, x]\r\n\tr = []\r\n\t\t\r\n\tif int(x / 3) == 0:\r\n\t\tp[0] = 0\t\r\n\tif x % 3 == 0:\r\n\t\tp[1] = 0\t\t\r\n\tif (x + 1) % 3 == 0:\r\n\t\tp[2] = 0\t\t\r\n\tif int(x / 3) == 2:\r\n\t\tp[3] = 0\r\n\t\t\r\n\tfor i in range(5):\r\n\t\tif p[i] == 1:\r\n\t\t\tr.append(q[i])\r\n\t\t\t\r\n\treturn r\r\n\t\r\n\r\ns, t = [], [1] * 9\r\n\r\nfor i in range(3):\r\n\ts.extend(list(map(int, input().split())))\r\n\t\r\nfor i in range(9):\r\n\tif s[i] % 2 != 0:\r\n\t\tfor j in func(i):\r\n\t\t\tt[j] = 1 - t[j]\r\n\t\t\t\r\nfor i in range(9):\r\n\tprint(t[i], end = \"\")\r\n\t\r\n\tif (i + 1) % 3 == 0:\r\n\t\tprint()", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\n# — For taking integer inputs.\r\ndef inp():\r\n return(int(input()))\r\n # — For taking List inputs.\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n # 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 # — For taking space seperated integer variable inputs.\r\ndef invr():\r\n return(map(int,input().split()))\r\n# --------------------------------------------------\r\ngrid = [\r\n [1,1,1],\r\n [1,1,1],\r\n [1,1,1],\r\n]\r\ninputGrid = []\r\nfor x in range(3):\r\n inputGrid.append(list(invr()))\r\nfor x in range(3):\r\n for i in range(3):\r\n num = inputGrid[x][i]\r\n for c in range(num):\r\n grid[x][i] = 1 - grid[x][i]\r\n if x+1 < 3:\r\n grid[x+1][i] = 1 - grid[x+1][i]\r\n if x-1 >= 0:\r\n grid[x-1][i] = 1 - grid[x-1][i]\r\n if i-1 >= 0:\r\n grid[x][i-1] = 1 - grid[x][i-1]\r\n if i+1 < 3:\r\n grid[x][i+1] = 1 - grid[x][i+1]\r\nfor x in range(3):\r\n print(''.join(map(str,grid[x])))", "lst = [[int(0) for i in range(5)] for j in range(5)]\r\nfor i in range(1, 4):\r\n x = [int(i) for i in input().split()]\r\n for j in range(1, 4):\r\n lst[i][j] = x[j - 1]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print((lst[i][j] + lst[i - 1][j] + lst[i + 1][j] + lst[i][j - 1] + lst[i][j + 1] + 1) % 2, end=\"\")\r\n print()", "def rev(n):\r\n if n == 0:\r\n return 1\r\n return 0\r\n\r\nlights = [[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]\r\nop = []\r\nfor i in range(3):\r\n op.append(list(map(int, input().strip().split(\" \"))))\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if op[i-1][j-1]%2 == 1:\r\n lights[i][j] = rev(lights[i][j])\r\n lights[i][j-1] = rev(lights[i][j-1])\r\n lights[i][j+1] = rev(lights[i][j+1])\r\n lights[i+1][j] = rev(lights[i+1][j])\r\n lights[i-1][j] = rev(lights[i-1][j])\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n print(lights[i][j], end = \"\")\r\n print()", "grid = []\r\nfor _ in range(3):\r\n row = list(map(int, input().split()))\r\n grid.append(row)\r\n\r\n\r\nmod_grid = [[0 for _ in range(3)] for _ in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n val = grid[i][j]\r\n if 0<=i-1 <3 and 0<=j<3:\r\n mod_grid[i-1][j] += val\r\n if 0<=i+1<3 and 0<=j<3:\r\n mod_grid[i+1][j] += val\r\n if 0<=i<3 and 0<=j-1<3:\r\n mod_grid[i][j-1] += val\r\n if 0<=i<3 and 0<=j+1<3:\r\n mod_grid[i][j+1] += val\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n grid[i][j] += mod_grid[i][j]\r\n\r\nstate_of_lights = [[0 for _ in range(3)] for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j]%2 == 0:\r\n state_of_lights[i][j] = 1\r\n else: state_of_lights[i][j] = 0\r\n\r\nfor row in state_of_lights:\r\n print(*row, sep = '')\r\n", "ans=[[0 for i in range(3)] for j in range(3)]\r\narr=[]\r\nfor i in range(3):\r\n tmp=list(map(int,input().split()))\r\n arr.append(tmp)\r\nfor i in range(3):\r\n for j in range(3):\r\n if arr[i][j]%2:\r\n ans[i][j]+=1\r\n if i+1<3:\r\n ans[i+1][j]+=1\r\n if i-1>=0:\r\n ans[i-1][j]+=1\r\n if j-1>=0:\r\n ans[i][j-1]+=1\r\n if j+1<3:\r\n ans[i][j+1]+=1\r\nfor i in range(3):\r\n for j in range(3):\r\n if ans[i][j]&1:\r\n print(0,end=\"\")\r\n else:\r\n print(1,end=\"\")\r\n print()\r\n", "\nI0 = lambda :map(int,input().split())\nI1 = lambda :int(input())\nI2 = lambda :list(map(int,input().split()))\n#####################################################\nl = list()\nlight = [[1]*3 for i in range(3)]\nfor i in range(3):\n l.append(I2())\nfor i in range(3):\n for j in range(3):\n if l[i][j] % 2 == 1:\n light[i][j]^=1\n if i!=0 :light[i-1][j]^=1\n if j!=0:light[i][j-1]^=1\n if j+1!=3:light[i][j+1]^=1\n if i+1!=3:light[i+1][j]^=1\nfor i in range(3):\n print(*light[i],sep=\"\")", "def main():\n\tm=[]\n\tfor i in range(3):\n\t\tl=[int(x)%2 for x in input().split()]\n\t\tm.append(l)\n\tml=[[1 for i in range(3)]for j in range(3)]\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\tif m[i][j]==1:\n\t\t\t\tml[i][j]=(ml[i][j]+1)%2\n\t\t\t\tif i-1>= 0:\n\t\t\t\t\tml[i-1][j]=(ml[i-1][j]+1)%2\n\t\t\t\tif i+1<3:\n\t\t\t\t\tml[i+1][j]=(ml[i+1][j]+1)%2\n\t\t\t\tif j+1<3:\n\t\t\t\t\tml[i][j+1]=(ml[i][j+1]+1)%2\n\t\t\t\tif j-1>=0:\n\t\t\t\t\tml[i][j-1]=(ml[i][j-1]+1)%2\n\tfor i in ml:\n\t\tfor j in i:\n\t\t\tprint(j,end='')\n\t\tprint()\nmain()\n", "def main():\r\n mat = [[0 for i in range(0, 3)] for i in range(0, 3)]\r\n\r\n dirs = [[0, 1], [1, 0], [0, -1], [-1, 0]]\r\n\r\n for i in range(0, 3):\r\n s = [int(i) for i in input().split()]\r\n for j in range(0, 3):\r\n mat[i][j] += s[j]\r\n for dir in dirs:\r\n ni = i + dir[0]\r\n nj = j + dir[1]\r\n if valid(ni, nj):\r\n mat[ni][nj] += s[j]\r\n\r\n for i in range(0, 3):\r\n answ = \"\"\r\n for j in range(0, 3):\r\n if mat[i][j] % 2 == 0:\r\n answ += \"1\"\r\n else:\r\n answ += \"0\"\r\n print(answ)\r\n\r\n\r\ndef valid(i, j):\r\n return i >= 0 and j >= 0 and i < 3 and j < 3\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "inp = []\r\nfor _ in range(5):\r\n inp.append([0]* 5)\r\n\r\nfor i in range(1, 4):\r\n inp1 = input().split(' ')\r\n for j in range(1, 4):\r\n inp[i][j] = int(inp1[j-1])\r\n\r\nfor i in range(1, 4):\r\n res = ''\r\n for j in range(1, 4):\r\n if((inp[i + 1][j] + inp[i - 1][j] + + inp[i][j + 1] + + inp[i][j - 1] + inp[i][j]) % 2 == 1):\r\n res = res + str(0)\r\n else:\r\n res = res + str(1)\r\n print(res)", "import sys\r\ninput = sys.stdin.readline\r\ndef strin() :\r\n return input()[:-1]\r\nl = [0, 0, 0, 0, 0]\r\nfor i in range(3):\r\n l += [0] + list(map(int, input().split())) + [0]\r\nelse : \r\n l += [0, 0, 0, 0, 0]\r\nfor i in range(1, 4) :\r\n for j in range(1, 4) : \r\n index = i*5 + j\r\n s = sum(l[index -1: index +2]) + l[index - 5] + l[index + 5]\r\n if s %2 == 0 :\r\n print(1, end = \"\")\r\n else :\r\n print(0, end= \"\")\r\n print()\r\n \r\n\r\n ", "data = [list(map(int, input().split())) for _ in range(3)]\r\nresult = [[1]*3 for _ in range(3)]\r\nd = [[0,0],[1,0],[-1,0],[0,1],[0,-1]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if data[i][j]%2==1:\r\n for n in d:\r\n if i+n[0]!=-1 and j+n[1]!=-1 and i+n[0]!=3 and j+n[1]!=3:\r\n result[i+n[0]][j+n[1]]^=1\r\n\r\nfor i in result:\r\n for j in i:\r\n print(j,end='')\r\n print()", "l=[]\r\nfor i in range(3):\r\n l.append(list(map(int,input().split())))\r\nt=[]\r\nt.append([0,0,0,0,0])\r\nfor i in range(3):\r\n li=[]\r\n li.append(0)\r\n for j in range(3):\r\n li.append(l[i][j])\r\n li.append(0)\r\n t.append(li)\r\nt.append([0,0,0,0,0])\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if (t[i][j]+t[i+1][j]+t[i-1][j]+t[i][j+1]+t[i][j-1])%2:\r\n l[i-1][j-1]=0\r\n else:\r\n l[i-1][j-1]=1\r\nfor i in l:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()", "matrix = []\r\n\r\nfor i in range(3):\r\n\r\n a=list(map(int,input().split()))\r\n \r\n matrix.append(a)\r\n\r\nmatrix1 = []\r\n\r\nfor i in range(3):\r\n\r\n y = [0] * 3\r\n matrix1.append(y)\r\n\r\n\r\nfor i in range(3):\r\n\r\n for j in range(3):\r\n\r\n x=matrix[i][j]\r\n matrix1[i][j] += x\r\n if i+1 <= 2 and i+1 >= 0:\r\n matrix1[i + 1][j] += x\r\n if j+1 <= 2 and j+1 >= 0: \r\n matrix1[i][j + 1] += x\r\n if i-1 <= 2 and i-1 >= 0:\r\n matrix1[i - 1][j] += x\r\n if j-1 <= 2 and j-1 >= 0: \r\n matrix1[i][j - 1] += x\r\nfor i in range(3):\r\n\r\n for j in range(3):\r\n\r\n b=(matrix1[i][j]+1)%2\r\n print(b, end=\"\")\r\n print()", "grid = [[1]*5 for i in range(5)]\r\n\r\nfor i in range(1, 4):\r\n for j, k in zip([1, 2, 3], map(int, input().split())):\r\n for n, m in [1, 0], [-1, 0], [0, 1], [0, -1], [0, 0]:\r\n grid[i+n][j+m]+=k\r\nfor i in range(1, 4):\r\n for k in range(1, 4):\r\n print(grid[i][k]%2, end='')\r\n print()\r\n", "def sideEffect(matrix, i, j):\n #print(\"1\", matrix)\n if(matrix[i][j] == \"1\"):\n matrix[i][j] = \"0\"\n elif(matrix[i][j] == \"0\"):\n matrix[i][j] = \"1\"\n #CIMA\n if(i-1 >= 0 and matrix[i-1][j]):\n #print(\"CIMA\")\n #print(matrix)\n if(matrix[i-1][j] == \"0\"):\n matrix[i-1][j] = \"1\"\n elif(matrix[i-1][j] == \"1\"):\n matrix[i-1][j] = \"0\"\n #DIREITA\n if(j+1 < 3 and matrix[i][j+1]):\n #print(\"DIREITA\")\n #print(matrix)\n if(matrix[i][j+1] == \"0\"):\n matrix[i][j+1] = \"1\"\n elif(matrix[i][j+1] == \"1\"):\n matrix[i][j+1] = \"0\"\n #BAIXO\n if(i+1 < 3 and matrix[i+1][j]):\n #print(\"BAIXO\")\n #print(matrix)\n if(matrix[i+1][j] == \"0\"):\n matrix[i+1][j] = \"1\"\n elif(matrix[i+1][j] == \"1\"):\n matrix[i+1][j] = \"0\"\n #ESQUERDA\n if(j-1 >= 0 and matrix[i][j-1]):\n #print(\"ESQUERDA\")\n #print(matrix)\n if(matrix[i][j-1] == \"0\"):\n matrix[i][j-1] = \"1\"\n elif(matrix[i][j-1] == \"1\"):\n matrix[i][j-1] = \"0\"\n #print(\"2\", matrix)\n return matrix\n \n \n\nmatrix01 = [[\"1\",\"1\",\"1\"],\n [\"1\",\"1\",\"1\"],\n [\"1\",\"1\",\"1\"]]\nmatrix = []\nfor i in range(3):\n line = input()\n line = line.split()\n matrix.append(line)\n\nfor i in range(3):\n for j in range(3):\n pos = matrix[i][j]\n for a in range(int(pos)):\n matrix01 = sideEffect(matrix01, i, j)\nfor line in matrix01:\n print(line[0] + line[1] + line[2])\n\n \t \t \t \t \t\t\t\t \t\t \t\t\t \t\t", "def ss(a,z):\r\n if x[a][z]==0:\r\n x[a][z]=1\r\n else:\r\n x[a][z]=0\r\n\r\n\r\na=-1\r\nx=[[1,1,1],[1,1,1],[1,1,1]]\r\nlst=[[int(t) for t in input().split()]for i in range(3)]\r\n##print('lst=',lst)\r\n\r\nfor i in lst:\r\n ## print('i=',i)\r\n a+=1\r\n z=-1\r\n ## print('a=',a)\r\n ## print('z=',z)\r\n for b in i:\r\n z+=1\r\n ## print('b=',b)\r\n ## print('zzzzz=',z)\r\n if b%2!=0:\r\n \r\n ss(a,z)\r\n ## print('x1=',x)\r\n if z-1>-1:\r\n ss(a,z-1)\r\n ## print('x2=',x)\r\n if z+1<3:\r\n ss(a,z+1)\r\n ## print('x3=',x)\r\n if a-1>-1:\r\n ss(a-1,z)\r\n ## print('x4=',x)\r\n if a+1<3:\r\n ss(a+1,z)\r\n## print('x5=',x)\r\n\r\n\r\n##print('x=',x)\r\n\r\nfor y in x:\r\n for e in y:\r\n print(e,end='')\r\n print() \r\n\r\n", "light = [[int(x) for x in input().split()] for _ in range(3)]\r\nout = [[0]*5 for _ in range(5)]\r\nfor i in range(1,4):\r\n for j in range(1, 4):\r\n out[i][j] += light[i- 1][j-1]\r\n out[i - 1][j] += light[i-1][j-1]\r\n out[i + 1][j] += light[i-1][j-1]\r\n out[i][j - 1] += light[i-1][j-1]\r\n out[i][j + 1] += light[i-1][j-1]\r\n \r\nfor i in range(1, 4):\r\n print(\"\".join([str(1) if out[i][j]%2 == 0 else str(0) for j in range(1, 4)]))", "touches=[]\r\nfor i in range(3):\r\n arr=list(map(int, input().split()))\r\n touches.append(arr)\r\nlamps=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range (3):\r\n for j in range(3):\r\n k=touches[i][j]\r\n if i-1>=0:\r\n k+=touches[i-1][j]\r\n if i+1<=2:\r\n k+=touches[i+1][j]\r\n if j-1>=0:\r\n k+=touches[i][j-1]\r\n if j+1<=2:\r\n k+=touches[i][j+1]\r\n if k%2==1:\r\n lamps[i][j]=0\r\nfor i in range (3):\r\n print(\"%d%d%d\"%(lamps[i][0],lamps[i][1],lamps[i][2]))", "from sys import stdin\r\nimport math\r\ninp = lambda : stdin.readline().strip()\r\n\r\nmatrix = []\r\nans = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n\tmatrix.append([int(x) for x in inp().split()])\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\t\tif matrix[i][j]%2 == 1:\r\n\t\t\t\tans[i][j] = abs(ans[i][j]-1)\r\n\t\t\t\tfor k in range(-1, 2, 1):\r\n\t\t\t\t\tfor l in range(-1, 2, 1):\r\n\t\t\t\t\t\tif 0<=i+k<3:\r\n\t\t\t\t\t\t\tans[i+k][j] = abs(ans[i+k][j]-1)\r\n\t\t\t\t\t\tif 0<=j+l<3:\r\n\t\t\t\t\t\t\tans[i][j+l] = abs(ans[i][j+l]-1)\r\nfor i in range(3):\r\n\tprint(\"\".join(map(str, ans[i])))", "# https://codeforces.com/contest/275/problem/A\r\n'''\r\n Author @Subhajit Das (sdsubhajitdas.github.io)\r\n SWE @Turbot HQ India PVT Ltd.\r\n 30/08/2020\r\n'''\r\n\r\n\r\ndef main():\r\n pressed = [[1]*3 for _ in range(3)]\r\n grid = list()\r\n for _ in range(3):\r\n grid.append(list(map(int, input().strip().split())))\r\n\r\n for row in range(3):\r\n for col in range(3):\r\n if(grid[row][col] != 0):\r\n countPressed(grid[row][col], row, col, pressed)\r\n\r\n for row in range(3):\r\n for col in range(3):\r\n pressed[row][col] %= 2\r\n\r\n for _ in range(3):\r\n print(*pressed[_], sep=\"\")\r\n\r\n\r\ndef countPressed(toggled, row, col, pressed):\r\n pressed[row][col] += toggled\r\n if(row+1 < 3):\r\n pressed[row+1][col] += toggled\r\n if(row-1 >= 0):\r\n pressed[row-1][col] += toggled\r\n if(col+1<3):\r\n pressed[row][col+1] += toggled\r\n if(col-1>=0):\r\n pressed[row][col-1] += toggled\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\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\tarr = matrix_input(3,3)\r\n\tans = [[True for _ in range(3)] for _ in range(3)]\r\n\r\n\tfor i in range(3):\r\n\t\tfor j in range(3):\r\n\t\t\tif arr[i][j]%2 == 1:\r\n\t\t\t\tans[i][j] = not ans[i][j]\r\n\t\t\t\tif i+1<3: ans[i+1][j] = not ans[i+1][j]\r\n\t\t\t\tif j+1<3: ans[i][j+1] = not ans[i][j+1] \r\n\t\t\t\tif i-1>=0: ans[i-1][j] = not ans[i-1][j] \r\n\t\t\t\tif j-1>=0: ans[i][j-1] = not ans[i][j-1]\r\n\r\n\tfor i in ans:\r\n\t\tfor j in i:\r\n\t\t\tprint(int(j),end=\"\")\r\n\t\tprint() \r\n\r\n\r\nif __name__ == '__main__':\r\n\tfor test in test_cases():\r\n\t\tmain()", "A=[\r\n list(map(int,input().strip().split()))\r\n for _ in range(3)\r\n]\r\n\r\nB = [[1]*3 for i in range(3)]\r\n\r\nfor i in range(9):\r\n r,c=divmod(i,3)\r\n B[r][c] += A[r][c]\r\n if r+1<3: B[r+1][c] += A[r][c]\r\n if c+1<3: B[r][c+1] += A[r][c]\r\n if r>0: B[r-1][c] += A[r][c]\r\n if c>0: B[r][c-1] += A[r][c]\r\n\r\nfor i in B:\r\n print(*map(lambda x:x%2,i),sep='')\r\n ", "\r\nfinal = []\r\nlights = [[0, 0, 0, 0, 0]]\r\nfor i in range(3):\r\n x = list(map(int, input().split()))\r\n x = [0] + x + [0]\r\n lights.append(x)\r\nlights.append([0, 0, 0, 0, 0])\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n final.append(lights[i][j] + lights[i-1][j] + lights[i][j-1] + lights[i+1][j] + lights[i][j+1])\r\nfor i in range(9):\r\n print(int(not final[i] % 2), end='')\r\n if (i + 1) % 3 == 0:\r\n print()\r\n\r\n# CodeForcesian\r\n# ♥\r\n# nobdo theaaryse ro akmihm\r\n", "count = [0,0,0,0,0,0,0,0,0]\r\ntally = {1:[4,1,2],2:[2,1,3,5],3:[3,2,6],4:[5,7,4,1],5:[2,5,6,8,4],6:[3,6,5,9],7:[4,7,8],8:[5,7,8,9],9:[6,8,9]}\r\ngiven = []\r\nfor i in range(3):\r\n a,b,c = map(int,input().split())\r\n \r\n given.append(a)\r\n given.append(b)\r\n given.append(c)\r\nfor i in range(1,10) :\r\n lincrement = tally[i]\r\n #print(lincrement)\r\n increment_value = given[i-1]\r\n for i in lincrement:\r\n count[i-1]+=increment_value\r\n \r\n #print(count) \r\nmyl = [] \r\nfor i in range(1,10):\r\n if count[i-1]%2 == 0:\r\n myl.append(\"1\")\r\n \r\n elif count[i-1]%2 != 0:\r\n myl.append(\"0\")\r\n \r\n \r\n \r\n if i%3 == 0 :\r\n print(\"\".join(myl))\r\n myl = []", "grid = []\r\nfor i in range(3):\r\n grid.append([])\r\n for j in range(3):\r\n grid[-1].append(1)\r\nswitching_grid = []\r\nfor i in range(3):\r\n row = [int(g) % 2 for g in input().split()]\r\n switching_grid.append(row)\r\nfor i in range(3):\r\n for j in range(3):\r\n if not switching_grid[i][j]:\r\n continue\r\n grid[i][j] = 1 - grid[i][j]\r\n if i - 1 > -1:\r\n grid[i - 1][j] = 1 - grid[i - 1][j]\r\n if j - 1 > -1:\r\n grid[i][j - 1] = 1 - grid[i][j - 1]\r\n if i + 1 < 3:\r\n grid[i + 1][j] = 1 - grid[i + 1][j]\r\n if j + 1 < 3:\r\n grid[i][j + 1] = 1 - grid[i][j + 1]\r\nfor i in range(3):\r\n for j in range(3):\r\n print(grid[i][j], end=\"\")\r\n print(\"\")\r\n", "def light_out(a):\r\n if a == 1:\r\n a = 0\r\n return a\r\n else:\r\n a = 1\r\n return a\r\n\r\nstatic = [1, 1, 1,\r\n 1, 1, 1,\r\n 1, 1, 1,]\r\nstat = [0, 3, 6]\r\n\r\nmass = []\r\nfor i in range(3):\r\n a, b, c = input().split()\r\n mass.append(int(a))\r\n mass.append(int(b))\r\n mass.append(int(c))\r\n\r\nfor i in range(len(mass)):\r\n for j in range(mass[i]):\r\n static[i] = light_out(static[i])\r\n if i//3 == 0:\r\n static[i+3] = light_out(static[i+3])\r\n elif i//3 == 2:\r\n static[i-3] = light_out(static[i-3])\r\n else:\r\n static[i+3] = light_out(static[i+3])\r\n static[i-3] = light_out(static[i-3])\r\n if i%3 == 0:\r\n static[i+1] = light_out(static[i+1])\r\n elif i%3 == 2:\r\n static[i-1] = light_out(static[i-1])\r\n else:\r\n static[i+1] = light_out(static[i+1])\r\n static[i-1] = light_out(static[i-1])\r\n\r\nfor i in stat:\r\n for j in range(2):\r\n print(static[i+j], end='')\r\n print(static[i+2])\r\n\r\n \r\n\r\n \r\n", "# Problem Statement - https://codeforces.com/problemset/problem/275/A\r\n\r\ndef lights(value):\r\n if value == 0:\r\n return 1 \r\n else:\r\n return 0\r\n\r\nmatrix = []\r\n\r\nfor i in range(3):\r\n matrix.append(list(map(int, input().split())))\r\n \r\nans = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\nif matrix[0][0] % 2 != 0:\r\n ans[0][0] = 0\r\n ans[0][1] = 0\r\n ans[1][0] = 0\r\n \r\nif matrix[0][1] % 2 != 0:\r\n ans[0][1] = lights(ans[0][1])\r\n ans[0][0] = lights(ans[0][0])\r\n ans[0][2] = lights(ans[0][2])\r\n ans[1][1] = lights(ans[1][1])\r\n \r\nif matrix[0][2] % 2 != 0:\r\n ans[0][2] = lights(ans[0][2])\r\n ans[0][1] = lights(ans[0][1])\r\n ans[1][2] = lights(ans[1][2])\r\n \r\nif matrix[1][0] % 2 != 0:\r\n ans[1][0] = lights(ans[1][0])\r\n ans[0][0] = lights(ans[0][0])\r\n ans[2][0] = lights(ans[2][0])\r\n ans[1][1] = lights(ans[1][1])\r\n \r\nif matrix[1][1] % 2 != 0:\r\n ans[1][1] = lights(ans[1][1])\r\n ans[0][1] = lights(ans[0][1])\r\n ans[1][0] = lights(ans[1][0])\r\n ans[1][2] = lights(ans[1][2])\r\n ans[2][1] = lights(ans[2][1])\r\n \r\nif matrix[1][2] % 2 != 0:\r\n ans[1][2] = lights(ans[1][2])\r\n ans[0][2] = lights(ans[0][2])\r\n ans[1][1] = lights(ans[1][1])\r\n ans[2][2] = lights(ans[2][2])\r\n \r\nif matrix[2][0] % 2 != 0:\r\n ans[2][0] = lights(ans[2][0])\r\n ans[1][0] = lights(ans[1][0])\r\n ans[2][1] = lights(ans[2][1])\r\n \r\nif matrix[2][1] % 2 != 0:\r\n ans[2][1] = lights(ans[2][1])\r\n ans[2][0] = lights(ans[2][0])\r\n ans[2][2] = lights(ans[2][2])\r\n ans[1][1] = lights(ans[1][1])\r\n \r\nif matrix[2][2] % 2 != 0:\r\n ans[2][2] = lights(ans[2][2])\r\n ans[2][1] = lights(ans[2][1])\r\n ans[1][2] = lights(ans[1][2])\r\n \r\nfor i in range(3):\r\n s = \"\"\r\n for j in range(3):\r\n s += str(ans[i][j])\r\n print(s)", "a,b,c = [int(x) for x in input().split()]\r\np,q,r = [int(x) for x in input().split()]\r\nx,y,z = [int(x) for x in input().split()]\r\n\r\n(a,b,c,p,q,r,x,y,z) = (a+b+p+1,b+a+c+q+1,c+b+r+1,p+a+q+x+1,q+b+p+r+y+1,r+c+q+z+1,x+p+y+1,y+x+q+z+1,z+y+r+1)\r\nprint(a%2,b%2,c%2,sep=\"\")\r\nprint(p%2,q%2,r%2,sep=\"\")\r\nprint(x%2,y%2,z%2,sep=\"\")", "grid = [list(map(int, input().split())) for i in range(3)]\r\ncnt = [[0 for i in range(3)] for j in range(3)]\r\n\r\nfor i in range(len(grid)):\r\n for j in range(len(grid[i])):\r\n if grid[i][j] > 0:\r\n cnt[i][j] += grid[i][j]\r\n if i + 1 < len(grid[i]):\r\n cnt[i+1][j] += grid[i][j]\r\n if i - 1 >= 0:\r\n cnt[i-1][j] += grid[i][j]\r\n if j + 1 < len(grid):\r\n cnt[i][j+1] += grid[i][j]\r\n if j - 1 >= 0:\r\n cnt[i][j-1] += grid[i][j]\r\n\r\nans = []\r\nfor i in range(len(grid)):\r\n base = ''\r\n for j in range(len(grid[i])):\r\n if cnt[i][j] % 2 == 0:\r\n base += '1'\r\n else:\r\n base += '0'\r\n ans.append(base)\r\n\r\nfor i in ans:\r\n print(i)\r\n\r\n\r\n\r\n\r\n", "M = []\r\nfor i in range(3):\r\n a, b, c = map(int, input().split())\r\n M.append([a, b, c])\r\nfor r in range(3):\r\n for c in range(3):\r\n t= M[r][c]\r\n\r\n if c != 0:\r\n t+= M[r][c - 1]\r\n if c != 2:\r\n t+= M[r][c + 1]\r\n \r\n if r != 0:\r\n t+= M[r - 1][c]\r\n if r != 2:\r\n t+= M[r + 1][c]\r\n \r\n print((t + 1)%2, end = '')\r\n print()\r\n", "# Input\r\ngrid = [list(map(int, input().split())) for _ in range(3)]\r\n\r\n# Function to toggle the lights\r\ndef toggle_lights(grid):\r\n result = [[1] * 3 for _ in range(3)]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n if grid[i][j] % 2 != 0:\r\n result[i][j] = 1 - result[i][j]\r\n if i > 0:\r\n result[i - 1][j] = 1 - result[i - 1][j]\r\n if i < 2:\r\n result[i + 1][j] = 1 - result[i + 1][j]\r\n if j > 0:\r\n result[i][j - 1] = 1 - result[i][j - 1]\r\n if j < 2:\r\n result[i][j + 1] = 1 - result[i][j + 1]\r\n\r\n return result\r\n\r\n# Toggle the lights based on the input\r\nresult = toggle_lights(grid)\r\n\r\n# Output\r\nfor i in range(3):\r\n print(\"\".join(map(str, result[i])))\r\n", "res=[[1,1,1],[1,1,1],[1,1,1]]\r\narr=[]\r\ndef tog(i,j):\r\n if res[i][j]==1:\r\n res[i][j]=0\r\n else:\r\n res[i][j]=1\r\nfor i in range(3):\r\n x=list(map(int,input().split()))\r\n arr.append(x)\r\nfor i in range(3):\r\n for j in range(3):\r\n if arr[i][j]!=0 and arr[i][j]%2!=0:\r\n if i==0 and j==0:\r\n tog(i,j)\r\n tog(i,j+1)\r\n tog(i+1,j)\r\n elif i == 0 and j == 1:\r\n tog(i,j)\r\n tog(i,j-1)\r\n tog(i,j+1)\r\n tog(i+1,j)\r\n elif i == 0 and j == 2:\r\n tog(i,j)\r\n tog(i+1,j)\r\n tog(i,j-1)\r\n elif i == 1 and j == 0:\r\n tog(i,j)\r\n tog(i,j+1)\r\n tog(i+1,j)\r\n tog(i-1,j)\r\n elif i ==1 and j ==1:\r\n tog(i,j)\r\n tog(i,j-1)\r\n tog(i,j+1)\r\n tog(i+1,j)\r\n tog(i-1,j)\r\n elif i == 1 and j == 2:\r\n tog(i,j)\r\n tog(i+1,j)\r\n tog(i,j-1)\r\n tog(i-1,j)\r\n elif i == 2 and j == 0:\r\n tog(i,j)\r\n tog(i,j+1)\r\n tog(i-1,j)\r\n elif i == 2 and j == 1:\r\n tog(i,j)\r\n tog(i,j-1)\r\n tog(i,j+1)\r\n tog(i-1,j)\r\n elif i == 2 and j == 2:\r\n tog(i,j)\r\n tog(i-1,j)\r\n tog(i,j-1)\r\nfor i in range(3):\r\n for j in range(3):\r\n print(res[i][j],end=\"\")\r\n print()\r\n ", "m = [[0] * 5] + [[0] + [int(x) for x in input().split(' ')] + [0] for row in range(3)] + [[0] * 5]\r\nfor i in range(1, 4):\r\n s = ''.join([str(sum([1, m[i-1][j], m[i+1][j], m[i][j], m[i][j+1], m[i][j-1]]) % 2) for j in range(1,4)])\r\n print(s)\r\n\r\n\r\n", "def switchLight(num,s):\r\n if (num%2==1 and s==0) or (num%2==0 and s==1):\r\n return 1\r\n return 0\r\n\r\n \r\n\r\n\r\ndef solve():\r\n l1 = list(map(int,input().split()))\r\n l2 = list(map(int,input().split()))\r\n l3 = list(map(int,input().split()))\r\n l = [l1,l2,l3]\r\n v = [[1,1,1],[1,1,1],[1,1,1]]\r\n for i in range(3):\r\n for j in range(3):\r\n v[i][j] = switchLight(l[i][j],v[i][j])\r\n if i-1>=0:\r\n v[i-1][j] = switchLight(l[i][j],v[i-1][j])\r\n if i+1<3:\r\n v[i+1][j] = switchLight(l[i][j],v[i+1][j])\r\n if j-1>=0: \r\n v[i][j-1] = switchLight(l[i][j],v[i][j-1])\r\n if j+1<3: \r\n v[i][j+1] = switchLight(l[i][j],v[i][j+1])\r\n out=\"\"\r\n for i in range(3):\r\n for j in range(3):\r\n out+=str(v[i][j])\r\n out+=\"\\n\" if i<2 else \"\"\r\n return out\r\nprint(solve())\r\n\r\n", "grid = []\nfor i in range(3):\n grid.append( list(map(int,input().split())))\nres = [[0,0,0] for i in range(3)] \nfor i in range(3):\n for j in range(3):\n sumi = grid[i][j]\n if i>0:\n sumi += grid[i-1][j]\n if i<2:\n sumi += grid[i+1][j]\n if j>0:\n sumi += grid[i][j-1]\n if j<2:\n sumi += grid[i][j+1]\n # print('my sum ', i,j, sumi)\n print(1-sumi%2,end='')\n print()", "state = [[\"1\",\"1\",\"1\"],[\"1\",\"1\",\"1\"],[\"1\",\"1\",\"1\"]]\r\nfor index in range(3):\r\n row = list(input().split())\r\n for press in range(3):\r\n if int(row[press])%2:\r\n if state[index][press] == \"1\":\r\n state[index][press] = \"0\"\r\n else:\r\n state[index][press] =\"1\"\r\n if 0<=press+1<3:\r\n if state[index][press+1] == \"1\":\r\n state[index][press+1] = \"0\"\r\n else:\r\n state[index][press+1] =\"1\"\r\n if 0<=press-1<3:\r\n if state[index][press-1] == \"1\":\r\n state[index][press-1] = \"0\"\r\n else:\r\n state[index][press-1] =\"1\"\r\n if 0<=index+1<3:\r\n if state[index+1][press] == \"1\":\r\n state[index+1][press] = \"0\"\r\n else:\r\n state[index+1][press] =\"1\"\r\n if 0<=index-1<3:\r\n if state[index-1][press] == \"1\":\r\n state[index-1][press] = \"0\"\r\n else:\r\n state[index-1][press] =\"1\"\r\n \r\nfor row in range(3):\r\n print(\"\".join(state[row]))\r\n\r\n\r\n", "t = []\r\nfor i in range(3):\r\n\tl = list(map(int,input().split()))\r\n\tt.append(l)\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif i == 0 and j == 0:\r\n\t\t\tt1 = t[0][0] + t[0][1] + t[1][0]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 0 and j == 1:\r\n\t\t\tt1 = t[0][1] + t[0][0] + t[0][2] + t[1][1]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 0 and j == 2:\r\n\t\t\tt1 = t[0][2] + t[1][2] + t[0][1]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 1 and j == 0:\r\n\t\t\tt1 = t[1][0] + t[0][0] + t[2][0] + t[1][1]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 1 and j == 1:\r\n\t\t\tt1 = t[1][1] + t[0][1] + t[2][1] + t[1][0] + t[1][2]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 1 and j == 2:\r\n\t\t\tt1 = t[1][2] + t[1][1] + t[0][2] + t[2][2]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 2 and j == 0:\r\n\t\t\tt1 = t[2][0] + t[1][0] + t[2][1]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 2 and j == 1:\r\n\t\t\tt1 = t[2][1] + t[2][0] + t[1][1] + t[2][2]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\t\telif i == 2 and j == 2:\r\n\t\t\tt1 = t[2][2] + t[2][1] + t[1][2]\r\n\t\t\tif t1%2 == 0:\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(0,end=\"\")\r\n\tprint()", "lights = [ [1 for x in range(3)] for x in range(3)] \r\nmatrix = []\r\nfor x in range(3):\r\n\trow = [int(x) for x in input().split()]\r\n\tmatrix.append(row)\r\n\r\nfor i,row in enumerate(matrix):\r\n\tfor j,cell in enumerate(row):\r\n\t\tfor x in range(cell):\r\n\t\t\tlights[i][j] = lights[i][j]^1\r\n\t\t\tif not i-1<0:\r\n\t\t\t\tlights[i-1][j] = lights[i-1][j]^1\r\n\t\t\tif not i+1==3:\r\n\t\t\t\tlights[i+1][j] = lights[i+1][j]^1\r\n\t\t\tif not j-1<0:\r\n\t\t\t\tlights[i][j-1] = lights[i][j-1]^1\r\n\t\t\tif not j+1==3:\r\n\t\t\t\tlights[i][j+1] = lights[i][j+1]^1\r\n\r\nfor row in lights:\r\n\tfor cell in row:\r\n\t\tprint(cell,end=\"\")\r\n\tprint()\r\n\t\t\t", "m=[list(map(int,input().split(\" \"))) for i in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n t=0\r\n a=0\r\n b=0\r\n c=0\r\n d=0\r\n if (i-1)>=0:\r\n a=a+m[i-1][j]\r\n if (i+1)<=len(m[0])-1:\r\n b=b+m[i+1][j]\r\n if (j-1)>=0:\r\n c+=m[i][j-1]\r\n if (j+1)<=len(m)-1:\r\n d+=m[i][j+1]\r\n t=t+m[i][j]+a+b+c+d\r\n if t%2==0:\r\n print(1,end=\"\")\r\n else:\r\n print(0,end=\"\")\r\n print(\"\")\r\n", "def lights_out():\r\n grid_changes = []\r\n grid = [[0, 0, 0, 0, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 1, 1, 1, 0], [0, 0, 0, 0, 0]]\r\n for i in range(3):\r\n grid_changes.append(list(map(int, input().split(\" \"))))\r\n plus_minus = [-1, 1]\r\n for row in range(3):\r\n row += 1\r\n for column in range(3):\r\n column += 1\r\n for toggle in range(grid_changes[row - 1][column - 1]): # how many changes\r\n grid[row][column] = (grid[row][column] + 1) % 2\r\n for length in range(2):\r\n grid[row + plus_minus[length]][column] = (grid[row + plus_minus[length]][column] + 1) % 2\r\n for height in range(2):\r\n grid[row][column + plus_minus[height]] = (grid[row][column + plus_minus[height]] + 1) % 2\r\n for row in range(3):\r\n pre_row = list(map(str, grid[row + 1]))\r\n column_adjust = []\r\n for column in range(3):\r\n column_adjust.append(pre_row[column + 1])\r\n print(\"\".join(column_adjust))\r\n\r\n\r\nlights_out()", "m = [[1 for i in range(3)] for _ in range(3)]\r\npressed = []\r\nfor _ in range(3):\r\n pressed.append(list(map(int, input().split())))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n cnt = pressed[i][j]\r\n if i - 1 >= 0:\r\n cnt += pressed[i - 1][j]\r\n if j + 1 < 3:\r\n cnt += pressed[i][j + 1]\r\n if i + 1 < 3:\r\n cnt += pressed[i + 1][j]\r\n if j - 1 >= 0:\r\n cnt += pressed[i][j - 1]\r\n if cnt % 2 == 1:\r\n m[i][j] = 1 - m[i][j]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(m[i][j], end='')\r\n print()", "l = [[],[],[]]\r\nfor i in range(3):\r\n a,b,c = map(int,input().split())\r\n l[i].append(a)\r\n l[i].append(b)\r\n l[i].append(c)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n x = 0\r\n if l[i][j]:\r\n x+=(l[i][j])\r\n if i!=2: \r\n x+=(l[i+1][j])\r\n if i!=0:\r\n x+=(l[i-1][j])\r\n if j!=2:\r\n x+=(l[i][j+1])\r\n if j!=0:\r\n x+=(l[i][j-1])\r\n if x%2== 0:\r\n print(1, end = '')\r\n else:\r\n print(0, end = '')\r\n \r\n print()\r\n \r\n", "mp = []\r\nreal = [[],[],[]]\r\nfor i in range(3):\r\n a = input().split()\r\n mp.append(a)\r\nfor x in range(3):\r\n for y in range(3):\r\n mp[x][y] = int(mp[x][y])\r\nreal[0].append(mp[0][1]+mp[1][0]+mp[0][0])\r\nreal[0].append(mp[0][0]+mp[0][2]+mp[1][1]+mp[0][1])\r\nreal[0].append(mp[0][1]+mp[1][2]+mp[0][2])\r\nreal[1].append(mp[0][0]+mp[2][0]+mp[1][1]+mp[1][0])\r\nreal[1].append(mp[0][1]+mp[1][0]+mp[1][2]+mp[2][1]+mp[1][1])\r\nreal[1].append(mp[0][2]+mp[1][1]+mp[2][2]+mp[1][2])\r\nreal[2].append(mp[1][0]+mp[2][1]+mp[2][0])\r\nreal[2].append(mp[2][0]+mp[2][2]+mp[1][1]+mp[2][1])\r\nreal[2].append(mp[2][1]+mp[1][2]+mp[2][2])\r\nfor x in range(3):\r\n for y in range(3):\r\n z = real[x][y]+1\r\n z = z % 2\r\n print(z, end = '')\r\n print('')\r\n\r\n\r\n\r\n", "a=[]\r\nfor i in range(3):\r\n c=[int(x) for x in input().split()]\r\n a.append(c)\r\nprint(1 if (a[0][0] + a[0][1] + a[1][0]) % 2 == 0 else 0,end=\"\")\r\nprint(1 if (a[0][1] + a[0][0] + a[0][2] +a[1][1]) % 2 == 0 else 0,end=\"\")\r\nprint(1 if (a[0][2] + a[0][1] + a[1][2]) % 2 == 0 else 0,end=\"\")\r\nprint()\r\nprint(1 if (a[1][0] + a[0][0] + a[2][0]+a[1][1]) % 2 == 0 else 0,end=\"\")\r\nprint(1 if (a[1][1] + a[0][1] + a[1][0]+ a[1][2]+a[2][1]) % 2 == 0 else 0,end=\"\")\r\nprint(1 if (a[1][2] + a[0][2] + a[2][2]+a[1][1]) % 2 == 0 else 0,end=\"\")\r\nprint()\r\nprint(1 if (a[2][0] + a[1][0] + a[2][1]) % 2 == 0 else 0,end=\"\")\r\nprint(1 if (a[2][1] + a[2][0] + a[1][1]+ a[2][2]) % 2 == 0 else 0,end=\"\")\r\nprint(1 if (a[2][2] + a[1][2] + a[2][1]) % 2 == 0 else 0,end=\"\")\r\nprint()", "Ogrid = [[1,1,1],[1,1,1],[1,1,1]]\n\ngrid = []\n\nfor x in range(3):\n grid.append([int(y) for y in input().split()])\n\nfor x in range(3):\n for y in range(3):\n if grid[x][y]%2 != 0:\n\n if Ogrid[x][y] == 1:\n Ogrid[x][y] = 0\n elif Ogrid[x][y] == 0:\n Ogrid[x][y] = 1\n\n if x+1 < 3 and Ogrid[x+1][y] == 1:\n Ogrid[x + 1][y] = 0\n elif x+1 < 3 and Ogrid[x+1][y] == 0:\n Ogrid[x + 1][y] = 1\n\n if x-1 >= 0 and Ogrid[x-1][y] == 1:\n Ogrid[x - 1][y] = 0\n elif x-1 >= 0 and Ogrid[x-1][y] == 0:\n Ogrid[x - 1][y] = 1\n\n if y+1 < 3 and Ogrid[x][y+1] == 1:\n Ogrid[x][y+1] = 0\n elif y+1 < 3 and Ogrid[x][y+1] == 0:\n Ogrid[x][y + 1] = 1\n\n if y-1 >= 0 and Ogrid[x][y-1] == 1:\n Ogrid[x][y-1] = 0\n elif y-1 >= 0 and Ogrid[x][y-1] == 0:\n Ogrid[x][y - 1] = 1\n\n\nfor m in range(3):\n for l in range(3):\n print(Ogrid[m][l], end=\"\")\n print(\"\")\n\t\t\t \t\t \t\t\t\t \t\t \t \t", "\r\n\r\nx = [int(x) for x in input().split()]\r\ny = [int(y) for y in input().split()]\r\nz = [int(z) for z in input().split()]\r\n\r\na1 = x[0] + x[1] + y[0]\r\nif a1 % 2 == 0:\r\n a1 = 1\r\nelse:\r\n a1 = 0\r\na2 = sum(x) + y[1]\r\nif a2 % 2 == 0:\r\n a2 = 1\r\nelse:\r\n a2 = 0\r\n\r\na3 = x[1] + x[2] + y[2]\r\nif a3 % 2 == 0:\r\n a3 = 1\r\nelse:\r\n a3 = 0\r\n\r\n\r\nb1 = x[0] + y[0] + z[0] + y[1]\r\nif b1 % 2 == 0:\r\n b1 = 1\r\nelse:\r\n b1 = 0\r\n\r\nb2 = sum(y) + x[1] + z[1]\r\nif b2 % 2 == 0:\r\n b2 = 1\r\nelse:\r\n b2 = 0\r\n\r\nb3 = x[2] + y[1] + y[2] + z[2]\r\nif b3 % 2 == 0:\r\n b3 = 1\r\nelse:\r\n b3 = 0\r\n\r\n\r\nc1 = y[0] + z[0] + z[1]\r\nif c1 % 2 == 0:\r\n c1 = 1\r\nelse:\r\n c1 = 0\r\n\r\nc2 = sum(z) + y[1]\r\nif c2 % 2 == 0:\r\n c2 = 1\r\nelse:\r\n c2 = 0\r\n\r\nc3 = y[2] + z[1] + z[2]\r\nif c3 % 2 == 0:\r\n c3 = 1\r\nelse:\r\n c3 = 0\r\n\r\n\r\nprint(str(a1) + str(a2) + str(a3))\r\nprint(str(b1) + str(b2) + str(b3))\r\nprint(str(c1) + str(c2) + str(c3))\r\n", "l=[1,1,1,1,1,1,1,1,1]\r\na,b,c=map(int,input().split())\r\nif a%2==1:\r\n\tl[0]=int(not(l[0]))\r\n\tl[1]=int(not(l[1]))\r\n\tl[3]=int(not(l[3]))\r\nif b%2==1:\r\n\tl[0]=int(not(l[0]))\r\n\tl[1]=int(not(l[1]))\r\n\tl[2]=int(not(l[2]))\r\n\tl[4]=int(not(l[4]))\r\nif c%2==1:\r\n\tl[2]=int(not(l[2]))\r\n\tl[1]=int(not(l[1]))\r\n\tl[5]=int(not(l[5]))\r\na,b,c=map(int,input().split())\r\nif a%2==1:\r\n\tl[0]=int(not(l[0]))\r\n\tl[6]=int(not(l[6]))\r\n\tl[3]=int(not(l[3]))\r\n\tl[4]=int(not(l[4]))\r\nif b%2==1:\r\n\tl[7]=int(not(l[7]))\r\n\tl[1]=int(not(l[1]))\r\n\tl[5]=int(not(l[5]))\r\n\tl[3]=int(not(l[3]))\r\n\tl[4]=int(not(l[4]))\r\nif c%2==1:\r\n\tl[2]=int(not(l[2]))\r\n\tl[8]=int(not(l[8]))\r\n\tl[5]=int(not(l[5]))\r\n\tl[4]=int(not(l[4]))\r\na,b,c=map(int,input().split())\r\nif a%2==1:\r\n\tl[6]=int(not(l[6]))\r\n\tl[7]=int(not(l[7]))\r\n\tl[3]=int(not(l[3]))\r\nif b%2==1:\r\n\tl[6]=int(not(l[6]))\r\n\tl[7]=int(not(l[7]))\r\n\tl[8]=int(not(l[8]))\r\n\tl[4]=int(not(l[4]))\r\nif c%2==1:\r\n\tl[7]=int(not(l[7]))\r\n\tl[8]=int(not(l[8]))\r\n\tl[5]=int(not(l[5]))\r\n\r\nprint(str(l[0])+str(l[1])+str(l[2]))\r\nprint(str(l[3])+str(l[4])+str(l[5]))\r\nprint(str(l[6])+str(l[7])+str(l[8]))", "a = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\nj1 = [1, 1, 1]\nj2 = [1, 1, 1]\nj3 = [1, 1, 1]\n\nfor i in range(0, 3):#a\n if a[i]%2 != 0:\n #self\n if j1[i]==0:\n j1[i] = 1\n else:\n j1[i] = 0\n #right\n if i<2 and j1[i+1]==0:\n j1[i+1] = 1\n elif i<2 and j1[i+1]==1:\n j1[i+1] = 0\n #left\n if i>0 and j1[i-1]==0:\n j1[i-1] = 1\n elif i>0 and j1[i-1]==1:\n j1[i-1] = 0\n #bottom\n if j2[i] == 0:\n j2[i] = 1\n else:\n j2[i] = 0\nfor i in range(0, 3):#b\n if b[i]%2 != 0:\n #self\n if j2[i]==0:\n j2[i] = 1\n else:\n j2[i] = 0\n #right\n if i<2 and j2[i+1]==0:\n j2[i+1] = 1\n elif i<2 and j2[i+1]==1:\n j2[i+1] = 0\n #left\n if i>0 and j2[i-1]==0:\n j2[i-1] = 1\n elif i>0 and j2[i-1]==1:\n j2[i-1] = 0\n #bottom\n if j3[i] == 0:\n j3[i] = 1\n else:\n j3[i] = 0\n # top\n if j1[i] == 0:\n j1[i] = 1\n else:\n j1[i] = 0\nfor i in range(0, 3):#c\n if c[i]%2 != 0:\n #self\n if j3[i]==0:\n j3[i] = 1\n else:\n j3[i] = 0\n #right\n if i<2 and j3[i+1]==0:\n j3[i+1] = 1\n elif i<2 and j3[i+1]==1:\n j3[i+1] = 0\n #left\n if i>0 and j3[i-1]==0:\n j3[i-1] = 1\n elif i>0 and j3[i-1]==1:\n j3[i-1] = 0\n # top\n if j2[i] == 0:\n j2[i] = 1\n else:\n j2[i] = 0\nprint(j1[0],end=\"\")\nprint(j1[1],end=\"\")\nprint(j1[2])\nprint(j2[0],end=\"\")\nprint(j2[1],end=\"\")\nprint(j2[2])\nprint(j3[0],end=\"\")\nprint(j3[1],end=\"\")\nprint(j3[2])\n\t \t\t\t\t\t\t \t\t\t \t \t \t\t \t \t", "arr = [input().split() for i in range(3)]\nbrr = [[1 for i in range(3)] for j in range(3)]\n\nfor i in range(3):\n for j in range(3):\n if int(arr[i][j])%2 == 1:\n brr[i][j] ^= 1\n if i-1>=0:\n brr[i-1][j] ^= 1\n if j-1>=0:\n brr[i][j-1] ^= 1\n if i+1<3 :\n brr[i+1][j] ^= 1\n if j+1<3:\n brr[i][j+1] ^= 1\nfor i in brr:\n print(\"\".join([str(j) for j in i]))\n", "def main() :\r\n array = []\r\n for i in range(3):\r\n l = list(map(int,input().strip().split()))\r\n array.append(l)\r\n newArray = [[1,1,1],[1,1,1],[1,1,1]]\r\n i = 0\r\n while 0<=i<3 :\r\n j=0\r\n while 0<=j<3 :\r\n if array[i][j] % 2 != 0 :\r\n if newArray[i][j] == 0 :\r\n newArray[i][j] = 1\r\n else :\r\n newArray[i][j] = 0\r\n if j+1 < 3 :\r\n if newArray[i][j+1] == 0 :\r\n newArray[i][j+1] = 1 \r\n else :\r\n newArray[i][j+1] = 0 \r\n if j-1 >= 0 :\r\n if newArray[i][j-1] == 0 :\r\n newArray[i][j-1] = 1 \r\n else :\r\n newArray[i][j-1] = 0 \r\n if i+1 < 3 :\r\n if newArray[i+1][j] == 0 :\r\n newArray[i+1][j] = 1 \r\n else :\r\n newArray[i+1][j] = 0 \r\n if i-1 >= 0 :\r\n if newArray[i-1][j] == 0 :\r\n newArray[i-1][j] = 1 \r\n else :\r\n newArray[i-1][j] = 0 \r\n j+=1 \r\n i+=1\r\n\r\n for e in newArray :\r\n print(\"\".join(map(str,e)))\r\n\r\n\r\nmain() ", "matrix = []\r\nfor _ in range(3):\r\n matrix.append(list(map(int,input().split())))\r\n\r\n\r\n\r\nfor r in range(3):\r\n res = ''\r\n for c in range(3):\r\n num = matrix[r][c]\r\n if r-1>=0:\r\n num+=matrix[r-1][c]\r\n if r+1<3:\r\n num+=matrix[r+1][c]\r\n if c-1>=0:\r\n num+=matrix[r][c-1]\r\n if c+1<3:\r\n num+=matrix[r][c+1]\r\n \r\n if num%2==0:\r\n res+='1'\r\n else:\r\n res+='0'\r\n print(res)", "l=[]\r\nans=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n a=list(map(int,input().split()))\r\n l.append(a)\r\n# print(l)\r\n# -----------------------------------------------------\r\nfor i in range(3):\r\n for j in range(3):\r\n x = i\r\n y = j\r\n if l[x][y]%2!=0:\r\n ans[x][y]=1-ans[x][y]\r\n if x>=0 and y+1>=0 :\r\n if l[x][y]%2!=0:\r\n if y+1<3:\r\n ans[x][y+1]=1-ans[x][y+1]\r\n if x+1>=0 and y>=0 :\r\n if l[x][y]%2!=0 and x+1<3:\r\n ans[x+1][y]=1-ans[x+1][y]\r\n if x>=0 and y-1>=0 :\r\n if l[x][y]%2!=0:\r\n ans[x][y-1]=1-ans[x][y-1]\r\n if x-1>=0 and y>=0 :\r\n if l[x][y]%2!=0:\r\n ans[x-1][y]=1-ans[x-1][y]\r\nfor i in ans:\r\n for j in range(3):\r\n print(i[j],end=\"\")\r\n print()\r\n\r\n", "a,b,c=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\ni,j,k=map(int,input().split())\r\na1=x+b+a\r\nb1=a+b+c+y\r\nc1=b+z+c\r\nx1=a+x+y+i\r\ny1=b+y+j+x+z\r\nz1=y+z+k+c\r\ni1=x+j+i\r\nj1=i+y+j+k\r\nk1=j+z+k\r\narr=[a1,b1,c1,x1,y1,z1,i1,j1,k1]\r\nbrr=[]\r\nfor i in range(len(arr)):\r\n if arr[i]%2==0:\r\n brr.append('1')\r\n else:\r\n brr.append('0')\r\nprint(brr[0]+brr[1]+brr[2])\r\nprint(brr[3]+brr[4]+brr[5])\r\nprint(brr[6]+brr[7]+brr[8])\r\n", "import copy\r\nlst=[]\r\nlst1=[]\r\nfor i in range(3):\r\n a,b,c=[int(x) for x in input().split()]\r\n lst.append(a)\r\n lst.append(b)\r\n lst.append(c)\r\n\r\nfor i in range(9):\r\n lst[i] = lst[i]%2\r\n\r\nlst1 = lst.copy()\r\n\r\nif lst[0] == 1:\r\n lst1[1] += 1\r\n lst1[3] += 1\r\nif lst[1] == 1:\r\n lst1[0] += 1\r\n lst1[2] += 1\r\n lst1[4] += 1\r\nif lst[2] == 1:\r\n lst1[1] += 1\r\n lst1[5] += 1\r\nif lst[3] ==1:\r\n lst1[0] +=1\r\n lst1[4] +=1\r\n lst1[6] +=1\r\nif lst[4] ==1:\r\n lst1[1] +=1\r\n lst1[3] +=1\r\n lst1[5] +=1\r\n lst1[7] +=1\r\nif lst[5] ==1:\r\n lst1[2] +=1\r\n lst1[4] +=1\r\n lst1[8] +=1\r\nif lst[6] ==1:\r\n lst1[3] +=1\r\n lst1[7] +=1\r\nif lst[7] ==1:\r\n lst1[4] +=1\r\n lst1[6] +=1\r\n lst1[8] +=1\r\nif lst[8] ==1:\r\n lst1[5] +=1\r\n lst1[7] +=1\r\n\r\nfor i in range(9):\r\n lst1[i] = lst1[i]%2\r\n\r\nfor i in range(9):\r\n if lst1[i] == 1:\r\n lst1[i] = 0\r\n else:\r\n lst1[i] = 1\r\n\r\nst = ''.join(str(x) for x in lst1)\r\nprint('{} \\n{} \\n{}'.format(st[0:3],st[3:6],st[6:9]))", "def count(a, i, j):\r\n total = 1\r\n for x, y in ((-1, 0), (0, -1), (0, 0), (0, 1), (1, 0)):\r\n if 0 <= i + x < 3 and 0 <= j + y < 3:\r\n total += a[i + x][j + y]\r\n return str(total % 2)\r\n\r\na = list(list(map(int, input().split())) for _ in range(3))\r\n\r\nfor i in range(3):\r\n print(''.join([count(a, i, j) for j in range(3)]))", "li = [0,0,0]\r\nli1 = [[0]*3 for i in range(3)]\r\nfor i in range(3):\r\n\t*li[i], = map(int, input().split())\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif i != 2:\r\n\t\t\tli1[i][j] += li[i][j] + li[i+1][j]\r\n\t\telse:\r\n\t\t\tli1[i][j] += li[i][j] + li[i-1][j]\r\n\t\t\tli1[1][j] += li[0][j]\r\nfor j in range(3):\r\n\tfor i in range(3):\r\n\t\tif j != 2:\r\n\t\t\tli1[i][j] += li[i][j+1]\r\n\t\telse:\r\n\t\t\tli1[i][j] += li[i][j-1]\r\n\t\t\tli1[i][1] += li[i][0]\r\nfor i in range(3):\r\n\ts1 = ''\r\n\tfor j in range(3):\r\n\t\ts1 += '0' if li1[i][j]%2 else '1'\r\n\tprint(s1)", "m = [list(map(int, input().split())) for i in range(3)]\r\nx = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\r\nfor i in range(3):\r\n for j in range(3):\r\n k = m[i][j]\r\n if i-1>=0:\r\n k+=m[i-1][j]\r\n if i+1<=2:\r\n k+=m[i+1][j]\r\n if j-1>=0:\r\n k+=m[i][j-1]\r\n if j+1<=2:\r\n k+=m[i][j+1]\r\n if k%2:\r\n x[i][j] = int(not(x[i][j]))\r\n if x[i][j]==1:\r\n x[i][j] = 0\r\n else:\r\n x[i][j] = 1\r\nfor i in x:\r\n print(*i, sep = '')", "ss1=list(map(int,input().split()))\r\nss2=list(map(int,input().split()))\r\nss3=list(map(int,input().split()))\r\ns1=[1,1,1]\r\ns2=[1,1,1]\r\ns3=[1,1,1]\r\nif ss1[0]%2==1:\r\n s1[0]=(s1[0]+1)%2\r\n s1[1]=(s1[1]+1)%2\r\n s2[0]=(s2[0]+1)%2\r\nif ss1[1]%2==1:\r\n s1[0]=(s1[0]+1)%2\r\n s1[1]=(s1[1]+1)%2\r\n s2[1]=(s2[1]+1)%2\r\n s1[2]=(s1[2]+1)%2\r\nif ss1[2]%2==1:\r\n s1[2]=(s1[2]+1)%2\r\n s1[1]=(s1[1]+1)%2\r\n s2[2]=(s2[2]+1)%2\r\nif ss2[0]%2==1:\r\n s1[0]=(s1[0]+1)%2\r\n s3[0]=(s3[0]+1)%2\r\n s2[0]=(s2[0]+1)%2\r\n s2[1]=(s2[1]+1)%2\r\nif ss2[1]%2==1:\r\n s1[1]=(s1[1]+1)%2\r\n s3[1]=(s3[1]+1)%2\r\n s2[1]=(s2[1]+1)%2\r\n s2[0]=(s2[0]+1)%2\r\n s2[2]=(s2[2]+1)%2\r\nif ss2[2]%2==1:\r\n s1[2]=(s1[2]+1)%2\r\n s3[2]=(s3[2]+1)%2\r\n s2[2]=(s2[2]+1)%2\r\n s2[1]=(s2[1]+1)%2\r\nif ss3[0]%2==1:\r\n s3[0]=(s3[0]+1)%2\r\n s3[1]=(s3[1]+1)%2\r\n s2[0]=(s2[0]+1)%2\r\nif ss3[1]%2==1:\r\n s3[0]=(s3[0]+1)%2\r\n s3[1]=(s3[1]+1)%2\r\n s3[2]=(s3[2]+1)%2\r\n s2[1]=(s2[1]+1)%2\r\nif ss3[2]%2==1:\r\n s3[2]=(s3[2]+1)%2\r\n s3[1]=(s3[1]+1)%2\r\n s2[2]=(s2[2]+1)%2\r\nprint(''.join(list(map(str,s1))))\r\nprint(''.join(list(map(str,s2))))\r\nprint(''.join(list(map(str,s3))))\r\n\r\n\r\n\r\n \r\n # s[]=(s[]+1)%2\r\n \r\n \r\n \r\n \r\n", "x=[[]*3]*3\r\nres=[ [1 for i in range(3)] for j in range(3)]\r\nx[0] = [int(i) for i in input().split()]\r\nx[1] = [int(i) for i in input().split()]\r\nx[2] = [int(i) for i in input().split()]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(x[i][j] %2 != 0):\r\n res[i][j] = 1- res[i][j]\r\n if(i==0):\r\n res[i+1][j] = 1 - (res[i+1][j])\r\n elif(i==1):\r\n res[i+1][j]=1 - (res[i+1][j])\r\n res[i-1][j]=1-(res[i-1][j])\r\n elif(i==2):\r\n res[i-1][j]=1-(res[i-1][j])\r\n if(j==0):\r\n res[i][j+1]=1-(res[i][j+1])\r\n elif(j==1):\r\n res[i][j-1]=1-(res[i][j-1])\r\n res[i][j+1]=1-(res[i][j+1])\r\n elif(j==2):\r\n res[i][j-1]=1-(res[i][j-1])\r\nprint(*res[0],sep=\"\")\r\nprint(*res[1],sep=\"\")\r\nprint(*res[2],sep=\"\")", "# https://codeforces.com/problemset/problem/275/A\r\n\r\nnum_pressed = []\r\nfor _ in range(3):\r\n num_pressed.append(list(map(int, input().split())))\r\nnum_pressed.insert(0, [0, 0, 0, 0, 0])\r\nnum_pressed[1].insert(0, 0)\r\nnum_pressed[1].append(0)\r\nnum_pressed[2].insert(0, 0)\r\nnum_pressed[2].append(0)\r\nnum_pressed[3].insert(0, 0)\r\nnum_pressed[3].append(0)\r\nnum_pressed.append([0, 0, 0, 0, 0])\r\n\r\ntot = [[0, 0, 0, 0, 0] for _ in range(5)]\r\n\r\nfor y in range(1, 4):\r\n for x in range(1, 4):\r\n tot[y][x] += num_pressed[y][x] + num_pressed[y][x+1] + num_pressed[y][x-1] + num_pressed[y+1][x] + num_pressed[y-1][x]\r\n\r\ntruths = []\r\nfor i in range(1, 4):\r\n truths.append([str(int(x % 2 == 0)) for x in tot[i][1:4]])\r\nprint(\"\\n\".join([''.join(x) for x in truths]))\r\n", "q=[0,0,0,0,0]\r\nmtx=[q]\r\nfor i in range(3):\r\n mtx.append([0]+list(map(int,input().split()))+[0])\r\nmtx.append(q) \r\n \r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print((mtx[i-1][j]+mtx[i][j]+mtx[i][j-1]+mtx[i][j+1]+mtx[i+1][j]+1)%2,end='')\r\n print()", "a, b, c = map(int, input().split())\r\nd, e, f = map(int, input().split())\r\ng, h, i = map(int, input().split())\r\n\r\nprint((a+b+d+1)%2, (a+b+c+e+1)%2, (b+c+f+1)%2, sep='')\r\nprint((a+d+e+g+1)%2, (b+d+e+f+h+1)%2, (c+e+f+i+1)%2, sep='')\r\nprint((d+g+h+1)%2, (e+g+h+i+1)%2, (f+h+i+1)%2, sep='')\r\n", "a = [list(map(int, input().split())) for i in [1, 2, 3]]\r\n\r\nd = [[1, 1, 1] for i in range(3)]\r\n\r\ndx = [-1, 0, 1, 0, 0]\r\ndy = [0, 0, 0, -1, 1]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] % 2:\r\n for k in range(len(dx)):\r\n xx, yy = i + dx[k], j + dy[k]\r\n if xx < 0 or xx > 2 or yy < 0 or yy > 2:\r\n continue\r\n d[xx][yy] = [1, 0][d[xx][yy]]\r\nfor r in d:\r\n print(*r, sep=\"\")", "lst=[]\r\nfor i in range(3):\r\n lst.append([int(x) for x in input().split()])\r\npos=[lst[0][0]+lst[0][1]+lst[1][0],lst[0][0]+lst[0][1]+lst[0][2]+lst[1][1],lst[0][1]+lst[0][2]+lst[1][2],lst[0][0]+lst[1][0]+lst[1][1]+lst[2][0],lst[0][1]+lst[1][0]+lst[1][1]+lst[1][2]+lst[2][1],lst[0][2]+lst[1][1]+lst[1][2]+lst[2][2],lst[1][0]+lst[2][0]+lst[2][1],lst[1][1]+lst[2][0]+lst[2][1]+lst[2][2],lst[1][2]+lst[2][1]+lst[2][2]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if pos[i*3+j]%2==0:\r\n print('1',end='')\r\n else:\r\n print('0',end='')\r\n print(end='\\n')", "l1=list(map(int,input().split())) \r\nl2=list(map(int,input().split())) \r\nl3=list(map(int,input().split())) \r\nL1=[1,1,1]\r\nL2=[1,1,1]\r\nL3=[1,1,1]\r\n\r\nif (l1[0]+l1[1]+l2[0])%2!=0:\r\n L1[0]=0\r\nif (l1[0]+l1[1]+l2[1]+l1[2])%2!=0:\r\n L1[1]=0 \r\nif (l1[1]+l2[2]+l1[2])%2!=0:\r\n L1[2]=0 \r\nif (l1[0]+l3[0]+l2[1]+l2[0])%2!=0:\r\n L2[0]=0 \r\nif (l1[1]+l3[1]+l2[1]+l2[0]+l2[2])%2!=0:\r\n L2[1]=0 \r\nif (l1[2]+l3[2]+l2[1]+l2[2])%2!=0:\r\n L2[2]=0 \r\nif (l3[0]+l3[1]+l2[0])%2!=0:\r\n L3[0]=0\r\nif (l3[0]+l3[2]+l2[1]+l3[1])%2!=0:\r\n L3[1]=0\r\nif (l3[2]+l3[1]+l2[2])%2!=0:\r\n L3[2]=0 \r\ns=\"\"\r\nt=\"\"\r\nu=\"\"\r\nfor i in L1:\r\n s+=str(i)\r\nfor i in L2:\r\n t+=str(i)\r\nfor i in L3:\r\n u+=str(i)\r\nprint(s)\r\nprint(t)\r\nprint(u)\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n ", "rows, cols = (3, 3)\r\narr = [[], [], []]\r\ncurrentMatrix = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\nfor i in range(0, 3):\r\n inputRow = input().split(' ')\r\n arr[i].append(int(inputRow[0]))\r\n arr[i].append(int(inputRow[1]))\r\n arr[i].append(int(inputRow[2]))\r\n\r\nfor i in range(0, len(arr)):\r\n for j in range(0, len(arr[i])):\r\n number = arr[i][j]\r\n if number % 2 != 0:\r\n currentMatrix[i][j] = 0 if currentMatrix[i][j] == 1 else 1\r\n top = i - 1\r\n right = j + 1\r\n bottom = i + 1\r\n left = j - 1\r\n if top >= 0:\r\n currentMatrix[top][j] = 0 if currentMatrix[top][j] == 1 else 1\r\n if right <= 2:\r\n currentMatrix[i][right] = 0 if currentMatrix[i][right] == 1 else 1\r\n if bottom <= 2:\r\n currentMatrix[bottom][j] = 0 if currentMatrix[bottom][j] == 1 else 1\r\n if left >= 0:\r\n currentMatrix[i][left] = 0 if currentMatrix[i][left] == 1 else 1\r\n\r\noutputString = ''\r\nfor row in currentMatrix:\r\n for col in row:\r\n outputString += str(col)\r\n print(outputString)\r\n outputString = ''\r\n", "#lightsout\r\nr1=list(map(int,input().split()))\r\nr2=list(map(int,input().split()))\r\nr3=list(map(int,input().split()))\r\nT=[r1,r2,r3]\r\ndef sumrem(s,t):\r\n sum=0\r\n if 0<=s-1:\r\n sum+=T[s-1][t]%2\r\n if s+1<=2:\r\n sum+=T[s+1][t]%2\r\n if 0<=t-1:\r\n sum+=T[s][t-1]%2\r\n if t+1<=2:\r\n sum+=T[s][t+1]%2\r\n sum+=T[s][t]%2\r\n return sum%2\r\n \r\nG=[['1','1','1'],['1','1','1'],['1','1','1']]\r\nfor i in range(3):\r\n for j in range(3):\r\n if sumrem(i,j)==1:\r\n G[i][j]='0'\r\nfor p in range(3): \r\n for q in range(3):\r\n print(G[p][q],end='') \r\n print()\r\n", "a=[]\r\nfor i in range(3):\r\n temp=list(map(int, input().split()))\r\n a.append(temp)\r\nb=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]&1:\r\n #middle\r\n if b[i][j]==1:\r\n b[i][j]=0\r\n else:\r\n b[i][j]=1\r\n #down\r\n if i+1<=2:\r\n if b[i+1][j]:\r\n b[i+1][j]=0\r\n else:\r\n b[i+1][j]=1\r\n #top\r\n if i-1>=0:\r\n if b[i-1][j]:\r\n b[i-1][j]=0\r\n else:\r\n b[i-1][j]=1\r\n #right\r\n if j+1<=2:\r\n if b[i][j+1]:\r\n b[i][j+1]=0\r\n else:\r\n b[i][j+1]=1\r\n #left\r\n if j-1>=0:\r\n if b[i][j-1]:\r\n b[i][j-1]=0\r\n else:\r\n b[i][j-1]=1\r\n '''#corner down right\r\n if i+1<=2 and j+1<=2:\r\n if b[i+1][j+1]:\r\n b[i+1][j+1]=0\r\n else:\r\n b[i+1][j+1]=1\r\n #corner down left\r\n if i+1<=2 and j-1>=0:\r\n if b[i+1][j-1]:\r\n b[i+1][j-1]=0\r\n else:\r\n b[i+1][j-1]=1\r\n #corner up right\r\n if i-1>=0 and j+1<=2:\r\n if b[i-1][j+1]:\r\n b[i-1][j+1]=0\r\n else:\r\n b[i-1][j+1]=1\r\n #corner up left\r\n if i-1<=2 and j-1>=0:\r\n if b[i-1][j-1]:\r\n b[i-1][j-1]=0\r\n else:\r\n b[i-1][j-1]=1'''\r\nfor i in range(3):\r\n for j in range(3):\r\n print(b[i][j],end=\"\")\r\n print()", "matrix = [[0]*5 for _ in range(5)]\r\nfor i in range(1,4):\r\n matrix[i][1:4] = [int(x) for x in input().split()]\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print((1+ matrix[i][j] + matrix[i-1][j] + matrix[i+1][j] + matrix[i][j-1] + matrix[i][j+1]) % 2, end = '')\r\n print()\r\n", "l = []\r\nfor i in range(3):\r\n x = list(map(int,input().split()))\r\n l.append(x)\r\nfor i in range(3):\r\n for j in range(3):\r\n s = 1\r\n s += l[i][j]\r\n if i > 0:\r\n s += l[i-1][j]\r\n if i != 2:\r\n s += l[i+1][j]\r\n if j > 0:\r\n s += l[i][j-1]\r\n if j!=2:\r\n s += l[i][j+1]\r\n print(s%2,end=\"\")\r\n print()", "opera = []\r\nfor i in range(3) :\r\n lst = list(map(int,input().split()))\r\n for j in range(3) :\r\n if lst[j] % 2 == 0 :\r\n lst[j] = 0\r\n else :\r\n lst[j] = 1\r\n opera.append(lst)\r\nlights = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3) :\r\n for j in range(3) :\r\n if opera[i][j] == 1 :\r\n \r\n if lights[i][j] == 1 :\r\n lights[i][j] = 0\r\n else :\r\n lights[i][j] = 1\r\n if j + 1 < 3 :\r\n \r\n if lights[i][j+1] == 1 :\r\n lights[i][j+1] = 0\r\n else :\r\n lights[i][j+1] = 1\r\n if j - 1 >= 0 :\r\n \r\n if lights[i][j-1] == 1 :\r\n lights[i][j-1] = 0\r\n else :\r\n lights[i][j-1] = 1\r\n if i - 1 >= 0 :\r\n \r\n if lights[i-1][j] == 1 :\r\n lights[i-1][j] = 0\r\n else :\r\n lights[i-1][j] = 1\r\n if i + 1 < 3 :\r\n \r\n if lights[i+1][j] == 1 :\r\n lights[i+1][j] = 0\r\n else :\r\n lights[i+1][j] = 1\r\nfor i in range(3) :\r\n print(''.join(map(str,lights[i])))\r\n", "a = [0 for i in range(9)]\na[0], a[1], a[2] = map(int,input().split())\na[3], a[4], a[5] = map(int,input().split())\na[6], a[7], a[8] = map(int,input().split())\n\nprint(1-(a[0]+a[1]+a[3])%2,end='')\nprint(1-(a[1]+a[0]+a[2]+a[4])%2,end='')\nprint(1-(a[1]+a[2]+a[5])%2)\nprint(1-(a[0]+a[3]+a[4]+a[6])%2,end='')\nprint(1-(a[1]+a[4]+a[3]+a[5]+a[7])%2,end='')\nprint(1-(a[4]+a[2]+a[5]+a[8])%2)\nprint(1-(a[3]+a[6]+a[7])%2,end='')\nprint(1-(a[4]+a[7]+a[6]+a[8])%2,end='')\nprint(1-(a[5]+a[7]+a[8])%2,end='')\n", "m=[[0]*5]+[[0]+[int(i) for i in input().split()]+[0] for j in range(3)]+[[0]*5]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print((m[i][j]+m[i+1][j]+m[i-1][j]+m[i][j+1]+m[i][j-1]+1)%2,end='')\r\n print()", "board = [[1 for _ in range(5)] for _ in range(5)]\r\npress = []\r\n\r\nfor _ in range(3):\r\n press.append([int(i) for i in input().split()])\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if press[i-1][j-1] % 2 == 1:\r\n board[i][j] = 1 - board[i][j]\r\n board[i-1][j] = 1 - board[i-1][j]\r\n board[i+1][j] = 1 - board[i+1][j]\r\n board[i][j-1] = 1 - board[i][j-1]\r\n board[i][j+1] = 1 - board[i][j+1]\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n print(board[i][j], end='')\r\n print()\r\n", "def swap(a, x):\r\n if a[x] == \"0\": a[x] = \"1\"\r\n else: a[x] = \"0\"\r\n\r\ng = [[\"1\", \"1\", \"1\"], [\"1\", \"1\", \"1\"], [\"1\", \"1\", \"1\"]]\r\na = []\r\nfor i in range(3):\r\n a.append(input().split(\" \"))\r\nif int(a[0][0]) % 2 == 1:\r\n swap(g[0], 1)\r\n swap(g[0], 0)\r\n swap(g[1], 0)\r\nif int(a[0][1]) % 2 == 1:\r\n swap(g[0], 1)\r\n swap(g[0], 0)\r\n swap(g[0],2)\r\n swap(g[1],1)\r\nif int(a[0][2]) % 2 == 1:\r\n swap(g[0],2)\r\n swap(g[0],1)\r\n swap(g[1],2)\r\nif int(a[1][0]) % 2 == 1:\r\n swap(g[1],0)\r\n swap(g[0],0)\r\n swap(g[2],0)\r\n swap(g[1],1)\r\nif int(a[1][1]) % 2 == 1:\r\n swap(g[1],1)\r\n swap(g[0],1)\r\n swap(g[1],2)\r\n swap(g[1],0)\r\n swap(g[2],1)\r\nif int(a[1][2]) % 2 == 1:\r\n swap(g[1],2)\r\n swap(g[1],1)\r\n swap(g[2],2)\r\n swap(g[0],2)\r\nif int(a[2][0]) % 2 == 1:\r\n swap(g[2],0,)\r\n swap(g[1],0)\r\n swap(g[2],1)\r\nif int(a[2][1]) % 2 == 1:\r\n swap(g[2],1)\r\n swap(g[1],1)\r\n swap(g[2],0)\r\n swap(g[2],2)\r\nif int(a[2][2]) % 2 == 1:\r\n swap(g[2],2)\r\n swap(g[1],2)\r\n swap(g[2],1)\r\nfor i in range(3):\r\n print(\"\".join(g[i]))\r\n\r\n", "# Storing input in 3x3 matrix\r\n\r\ngrid = []\r\n\r\nfor i in range(3):\r\n grid.append(list(map(int, input().split())))\r\n\r\n# Making a 5x5 null matirx\r\n\r\nrow, column = 5,5\r\n\r\narr = [[0 for i in range(column)] for j in range(row)]\r\n\r\n# Handling edge cases \r\n# modifying null matrix to fit the grid matrix in the center\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n arr[i][j] = grid[i-1][j-1]\r\n\r\n\"\"\"\r\nprint('Input Grid')\r\nfor ro in grid:\r\n print(ro)\r\n\r\nprint('Initial arr')\r\n\r\nfor ro in arr:\r\n print(ro)\r\n\r\n\"\"\"\r\n\r\n# if the sum of the element and its nearest neighbor elements is 1 \r\n# then the light at that element will be OFF '0'\r\n# else it will be ON '1'\r\n\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if sum([arr[i][j-1], arr[i][j+1], arr[i-1][j], arr[i+1][j]], arr[i][j]) % 2:\r\n print('0', end='')\r\n else:\r\n print('1', end='')\r\n print()", "inp = []\r\nfor i in range(3) :\r\n inp.append(list(map(int,input().split())))\r\narr = [\r\n [0,0,0],\r\n [0,0,0],\r\n [0,0,0]\r\n ]\r\n \r\nfor i in range(3) :\r\n for j in range(3) :\r\n if inp[i][j] > 0 :\r\n val = inp[i][j]\r\n arr[i][j] += val\r\n if i == j == 1 :\r\n arr[i][j+1] += val\r\n arr[i][j-1] += val\r\n arr[i-1][j] += val\r\n arr[i+1][j] += val\r\n if i == 0:\r\n if j == 0 :\r\n arr[i+1][j] += val\r\n arr[i][j+1] += val\r\n elif j == 1:\r\n arr[i+1][j] += val\r\n arr[i][j+1] += val\r\n arr[i][j-1] += val\r\n elif j == 2:\r\n arr[i][j-1] += val\r\n arr[i+1][j] += val\r\n if i == 1 :\r\n if j == 0 : \r\n arr[i+1][j] += val\r\n arr[i-1][j] += val\r\n arr[i][j+1] += val\r\n elif j == 2 :\r\n arr[i+1][j] += val\r\n arr[i-1][j] += val\r\n arr[i][j-1] += val\r\n if i == 2:\r\n if j == 0 :\r\n arr[i-1][j] += val\r\n arr[i][j+1] += val\r\n elif j == 1 :\r\n arr[i][j-1] += val\r\n arr[i][j+1] += val\r\n arr[i-1][j] += val\r\n elif j == 2:\r\n arr[i-1][j] += val\r\n arr[i][j-1] += val\r\n \r\nfor i in arr :\r\n for j in i :\r\n if j%2 == 0:\r\n print(1,end=\"\")\r\n else :\r\n print(0,end=\"\")\r\n print()", "while True:\r\n\ttry:\r\n\t\tclass Game:\r\n\t\t\tdef __init__(self,mtrx=[], tmtrx = []):\r\n\t\t\t self.mtrx = []\r\n\t\t\t self.tmtrx = [[1 for j in range(3)]for i in range(3)]\r\n\t\t\tdef inputt(self):\r\n\t\t\t for i in range(3):\r\n\t\t\t mx = list(map(int, input().split()))\r\n\t\t\t self.mtrx.append(mx)\r\n\t\t\t del mx\r\n\t\t\r\n\t\t\tdef solve(self):\r\n\t\t\t x = [-1,1,0,0,0];y = [0,0,1,-1,0]\r\n\t\t\t for i in range(3):\r\n\t\t\t for j in range(3):\r\n\t\t\t for k in range(5):\r\n\t\t\t if (i+x[k] >= 0 and i+x[k] <= 2) and (j+y[k] >= 0 and j+y[k] <= 2):\r\n\t\t\t if self.mtrx[i][j] %2 != 0:\r\n\t\t\t if self.tmtrx[i+x[k]][j+y[k]] == 0:\r\n\t\t\t self.tmtrx[i+x[k]][j+y[k]] = 1\r\n\t\t\t else:self.tmtrx[i+x[k]][j+y[k]] = 0\r\n\t #print(*self.tmtrx)\r\n\t\t\tdef print_res(self):\r\n\t\t\t t = str()\r\n\t\t\t for i in range(3):\r\n\t\t\t for j in range(3):\r\n\t\t\t t = t+str(self.tmtrx[i][j])\r\n\t\t\t print(t)\r\n\t\t\t del t\r\n\t\t\t t = str()\r\n\t\t\t \r\n\t\t\t \r\n\t\r\n\t\t\r\n\t\tif __name__ == \"__main__\":\r\n\t\t obj = Game()\r\n\t\t obj.inputt()\r\n\t\t obj.solve()\r\n\t\t obj.print_res()\r\n\texcept EOFError:\r\n\t\tbreak\r\n ", "from collections import defaultdict\r\narr = [[] for _ in range(3)]\r\nfor ar in arr:\r\n ar.extend(map(int, input().split()))\r\nddict = defaultdict(int)\r\nfor i in range(3):\r\n for j in range(3):\r\n ddict[(i, j)] = arr[i][j]\r\nfor i in range(3):\r\n pr = \"\"\r\n for j in range(3):\r\n arr[i][j] += ddict[(i, j + 1)] + ddict[(i, j - 1)] + ddict[(i - 1, j)] + ddict[(i + 1, j)]\r\n pr += '1' if arr[i][j] % 2 == 0 else '0'\r\n print(pr)\r\n", "Line1 = input().split(\" \")\r\nLine2 = input().split(\" \")\r\nLine3 = input().split(\" \")\r\n\r\n# OutputArr = array([[1,1,1],[1,1,1],[1,1,1]])\r\n\r\nOutputArr =[]\r\nOutputArr.append([1,1,1])\r\nOutputArr.append([1,1,1])\r\nOutputArr.append([1,1,1])\r\n\r\n# LineArr = np.array([[int(Line1[0]),int(Line1[1]),int(Line1[2])]\r\n# ,[int(Line2[0]),int(Line2[1]),int(Line2[2])]\r\n# ,[int(Line3[0]),int(Line3[1]),int(Line3[2])]])\r\n\r\nLineArr = []\r\nLineArr.append([int(Line1[0]),int(Line1[1]),int(Line1[2])]) \r\nLineArr.append([int(Line2[0]),int(Line2[1]),int(Line2[2])]) \r\nLineArr.append([int(Line3[0]),int(Line3[1]),int(Line3[2])]) \r\n\r\n\r\n\r\ndef CheckOut(i,j):\r\n if( i == 3 or j == 3 or j == -1 or i == -1):\r\n return 0\r\n else:\r\n return 1\r\n\r\ndef Toggel (x):\r\n if(x == 1):\r\n return 0\r\n else:\r\n return 1\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if(LineArr[i][j] % 2 != 0):\r\n OutputArr[i][j]= Toggel(OutputArr[i][j])\r\n if(CheckOut(i,j+1) == 1 ):\r\n OutputArr[i][j+1]=Toggel(OutputArr[i][j+1])\r\n\r\n if(CheckOut(i+1,j) == 1 ):\r\n OutputArr[i+1][j]=Toggel(OutputArr[i+1][j])\r\n\r\n if(CheckOut(i-1,j) == 1 ):\r\n OutputArr[i-1][j]=Toggel(OutputArr[i-1][j]) \r\n \r\n if(CheckOut(i,j-1) == 1 ):\r\n OutputArr[i][j-1]=Toggel(OutputArr[i][j-1])\r\n\r\nOutput=\"\"\r\nfor i in range(3):\r\n for j in range(3):\r\n Output+=str(OutputArr[i][j])\r\n Output+=\"\\n\"\r\n\r\nprint(Output)", "a,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\ng,h,i=map(int,input().split())\r\nm=(a+b+d)%2\r\nn=(a+b+c+e)%2\r\no=(b+c+f)%2\r\np=(a+d+e+g)%2\r\nq=(b+d+e+f+h)%2\r\nr=(c+e+f+i)%2\r\ns=(d+g+h)%2\r\nt=(e+g+h+i)%2\r\nu=(f+h+i)%2\r\nv=[m,n,o,p,q,r,s,t,u]\r\nx=[]\r\nfor i in v:\r\n if i%2==0:\r\n x.append('1')\r\n else:\r\n x.append('0')\r\nprint(''.join(x[0:3]))\r\nprint(''.join(x[3:6]))\r\nprint(''.join(x[6:9]))", "String =[[0 for i in range(5)] for j in range(5)]\r\nfor i in range(1,4): String[i][1:4] = [int(x)%2 for x in input().split()]\r\nfor i in range(1,4):\r\n for j in range(1,4): print((1+String[i][j] + String[i-1][j]+String[i+1][j]+String[i][j-1]+String[i][j+1])%2, end='')\r\n print()", "def c2I(array):\r\n for i in range(len(array)):\r\n array[i] = int(array[i])\r\n return array\r\n\r\n\r\nlights = [1, 1, 1], [1, 1, 1], [1, 1, 1]\r\n\r\na = input().split(\" \")\r\nb = input().split(\" \")\r\nc = input().split(\" \")\r\n\r\na = c2I(a)\r\nb = c2I(b)\r\nc = c2I(c)\r\n\r\n\r\ndef toggleLight(x, y):\r\n if x == 0 and y == 0:\r\n if(lights[0][0] == 1):\r\n lights[0][0] = 0\r\n else:\r\n lights[0][0] = 1\r\n if(lights[0][1] == 1):\r\n lights[0][1] = 0\r\n else:\r\n lights[0][1] = 1\r\n if(lights[1][0] == 1):\r\n lights[1][0] = 0\r\n else:\r\n lights[1][0] = 1\r\n elif x == 0 and y == 1:\r\n if(lights[0][1] == 1):\r\n lights[0][1] = 0\r\n else:\r\n lights[0][1] = 1\r\n if(lights[0][2] == 1):\r\n lights[0][2] = 0\r\n else:\r\n lights[0][2] = 1\r\n if(lights[1][1] == 1):\r\n lights[1][1] = 0\r\n else:\r\n lights[1][1] = 1\r\n if(lights[0][0] == 1):\r\n lights[0][0] = 0\r\n else:\r\n lights[0][0] = 1\r\n # print(lights[1])\r\n elif x == 0 and y == 2:\r\n if(lights[0][2] == 1):\r\n lights[0][2] = 0\r\n else:\r\n lights[0][2] = 1\r\n if(lights[1][2] == 1):\r\n lights[1][2] = 0\r\n else:\r\n lights[1][2] = 1\r\n if(lights[0][1] == 1):\r\n lights[0][1] = 0\r\n else:\r\n lights[0][1] = 1\r\n elif x == 1 and y == 0:\r\n if(lights[1][0] == 1):\r\n lights[1][0] = 0\r\n else:\r\n lights[1][0] = 1\r\n if(lights[0][0] == 1):\r\n lights[0][0] = 0\r\n else:\r\n lights[0][0] = 1\r\n if(lights[1][1] == 1):\r\n lights[1][1] = 0\r\n else:\r\n lights[1][1] = 1\r\n if(lights[2][0] == 1):\r\n lights[2][0] = 0\r\n else:\r\n lights[2][0] = 1\r\n elif x == 1 and y == 1:\r\n if(lights[1][1] == 1):\r\n lights[1][1] = 0\r\n else:\r\n lights[1][1] = 1\r\n if(lights[0][1] == 1):\r\n lights[0][1] = 0\r\n else:\r\n lights[0][1] = 1\r\n if(lights[1][2] == 1):\r\n lights[1][2] = 0\r\n else:\r\n lights[1][2] = 1\r\n if(lights[2][1] == 1):\r\n lights[2][1] = 0\r\n else:\r\n lights[2][1] = 1\r\n if(lights[1][0] == 1):\r\n lights[1][0] = 0\r\n else:\r\n lights[1][0] = 1\r\n elif x == 1 and y == 2:\r\n if(lights[1][2] == 1):\r\n lights[1][2] = 0\r\n else:\r\n lights[1][2] = 1\r\n if(lights[0][2] == 1):\r\n lights[0][2] = 0\r\n else:\r\n lights[0][2] = 1\r\n if(lights[2][2] == 1):\r\n lights[2][2] = 0\r\n else:\r\n lights[2][2] = 1\r\n if(lights[1][1] == 1):\r\n lights[1][1] = 0\r\n else:\r\n lights[1][1] = 1\r\n elif x == 2 and y == 0:\r\n if(lights[2][0] == 1):\r\n lights[2][0] = 0\r\n else:\r\n lights[2][0] = 1\r\n if(lights[1][0] == 1):\r\n lights[1][0] = 0\r\n else:\r\n lights[1][0] = 1\r\n if(lights[2][1] == 1):\r\n lights[2][1] = 0\r\n else:\r\n lights[2][1] = 1\r\n elif x == 2 and y == 1:\r\n if(lights[2][1] == 1):\r\n lights[2][1] = 0\r\n else:\r\n lights[2][1] = 1\r\n if(lights[1][1] == 1):\r\n lights[1][1] = 0\r\n else:\r\n lights[1][1] = 1\r\n if(lights[2][2] == 1):\r\n lights[2][2] = 0\r\n else:\r\n lights[2][2] = 1\r\n if(lights[2][0] == 1):\r\n lights[2][0] = 0\r\n else:\r\n lights[2][0] = 1\r\n elif x == 2 and y == 2:\r\n if(lights[2][2] == 1):\r\n lights[2][2] = 0\r\n else:\r\n lights[2][2] = 1\r\n if(lights[1][2] == 1):\r\n lights[1][2] = 0\r\n else:\r\n lights[1][2] = 1\r\n if(lights[2][1] == 1):\r\n lights[2][1] = 0\r\n else:\r\n lights[2][1] = 1\r\n\r\n\r\nfor i in range(len(a)):\r\n count = a[i]\r\n while(count > 0):\r\n toggleLight(0, i)\r\n count -= 1\r\nfor i in range(len(b)):\r\n count = b[i]\r\n while(count > 0):\r\n toggleLight(1, i)\r\n count -= 1\r\nfor i in range(len(c)):\r\n count = c[i]\r\n while(count > 0):\r\n toggleLight(2, i)\r\n count -= 1\r\nprint(\"\".join(map(str, lights[0])))\r\nprint(\"\".join(map(str, lights[1])))\r\nprint(\"\".join(map(str, lights[2])))\r\n", "a = []\r\nfor _ in range(3):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(3):\r\n ans = \"\"\r\n for j in range(3):\r\n s = 0\r\n s+=a[i][j]\r\n if i+1<3:\r\n s+=a[i+1][j]\r\n if i-1>=0:\r\n s+=a[i-1][j]\r\n if j+1<3:\r\n s+=a[i][j+1]\r\n if j-1>=0:\r\n s+=a[i][j-1]\r\n # print(s,end=\" \")\r\n if s%2==0:\r\n ans+=\"1\"\r\n else:\r\n ans+=\"0\"\r\n # print()\r\n print(ans)\r\n\r\n", "# 275A\r\nc = []\r\nfor i in range(3):\r\n a = input().split()\r\n a = list(map(int,a))\r\n c.append(a)\r\nfor i in range(3):\r\n for j in range(3):\r\n s = -c[i][j]\r\n for ki in range(max(0,i-1),min(3,i+2)):\r\n s += c[ki][j]\r\n for kj in range(max(0,j-1),min(3,j+2)):\r\n s += c[i][kj]\r\n d = 1 - s%2 \r\n print(d, end='')\r\n print('') ", "mat = []\r\n\r\nfor i in range(3):\r\n row = list(map(int, input().split()))\r\n mat.append(row)\r\n \r\nans = []\r\nfor i in range(3):\r\n temp = []\r\n for j in range(3):\r\n curr = mat[i][j] \r\n if (i-1) >= 0:\r\n curr += mat[i-1][j]\r\n if (i+1) < 3:\r\n curr += mat[i+1][j]\r\n if (j-1) >= 0:\r\n curr += mat[i][j-1]\r\n if (j+1) < 3:\r\n curr += mat[i][j+1]\r\n \r\n if curr % 2:\r\n temp.append(0)\r\n else:\r\n temp.append(1)\r\n ans.append(temp)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j], end=\"\")\r\n print()\r\n\r\n\r\n", "matrix=[]\r\nfor i in range(3):\r\n matrix.append(list(map(int,input().split())))\r\nfinal=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if(matrix[i][j]%2==1):\r\n if final[i][j]==1:\r\n final[i][j]=0\r\n else:\r\n final[i][j]=1\r\n if j-1 >=0:\r\n if final[i][j-1]==0:\r\n final[i][j-1]=1\r\n else :\r\n final[i][j-1]=0\r\n if i-1 >=0:\r\n if final[i-1][j]==0:\r\n final[i-1][j]=1\r\n else :\r\n final[i-1][j]=0\r\n if i+1 <=2:\r\n if final[i+1][j]==0:\r\n final[i+1][j]=1\r\n else :\r\n final[i+1][j]=0\r\n if j+1 <= 2:\r\n if final[i][j+1]==0:\r\n final[i][j+1]=1\r\n else :\r\n final[i][j+1]=0\r\nfor i in range(3):\r\n for j in range(3):\r\n print(final[i][j],end='')\r\n print()", "'''matrix=[]\r\nnewmatrix=[[0,0,0]]*3\r\nprint(newmatrix)\r\ndef helper(idx,matrix,newmatrix):\r\n directions= [(0,0),(0,1),(1,0),(0,-1),(-1,0)]\r\n for dx,dy in directions:\r\n newdx= idx[0]+dx\r\n newdy=idx[1]+dy\r\n if 0<=newdx<3 and 0<=newdy<3:\r\n newmatrix[newdx][newdy]+=matrix[idx[0]][idx[1]]\r\n \r\nfor _ in range(3):\r\n row= list(map(int, input().split()))\r\n matrix.append(row)\r\nprint(matrix)\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j]>0:\r\n helper((i,j),matrix,newmatrix)\r\nprint(newmatrix)\r\nfor row in newmatrix:\r\n for val in row:\r\n if val%2==0: print(1,end=\" \")\r\n else: print(0,end=\" \")\r\n print()'''\r\n\r\n\r\n\r\ngrid = [[1] * 3 for _ in range(3)]\r\n\r\n\r\nfor i in range(3):\r\n row = list(map(int, input().split()))\r\n for j in range(3):\r\n \r\n if row[j] % 2 == 1:\r\n grid[i][j] = 1 - grid[i][j]\r\n if i > 0:\r\n grid[i - 1][j] = 1 - grid[i - 1][j]\r\n if i < 2:\r\n grid[i + 1][j] = 1 - grid[i + 1][j]\r\n if j > 0:\r\n grid[i][j - 1] = 1 - grid[i][j - 1]\r\n if j < 2:\r\n grid[i][j + 1] = 1 - grid[i][j + 1]\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(grid[i][j], end=\"\")\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n ", "\nlights_matrix = []\nfor i in range(3):\n line = list(map(int,input().split(' ')))\n lights_matrix.append(line)\n \non_off = []\nfor i in range(len(lights_matrix)):\n on_off.append([])\n for j in range(len(lights_matrix[i])):\n toggle = lights_matrix[i][j]\n for x in [i-1,i+1]:\n if 0 <= x < len(lights_matrix):\n toggle += lights_matrix[x][j]\n for y in [j-1,j+1]:\n if 0 <= y < len(lights_matrix[i]):\n toggle += lights_matrix[i][y]\n if toggle%2 == 0:\n on_off[i].append(1)\n else:\n on_off[i].append(0)\n\nfor i in range(len(on_off)):\n line = ''\n for j in range(len(on_off[i])):\n line += str(on_off[i][j])\n print(line)\n", "x=[]\r\ny=[]\r\nfor i in range(3):\r\n a=list(map(int,input().split()))\r\n x.append(a)\r\n y.append([1]*3)\r\ny[0][0]=(x[0][0]+x[0][1]+x[1][0])%2\r\ny[0][1]=(x[0][1]+x[0][0]+x[0][2]+x[1][1])%2\r\ny[0][2]=(x[0][2]+x[0][1]+x[1][2])%2\r\ny[1][0]=(x[1][0]+x[0][0]+x[1][1]+x[2][0])%2\r\ny[1][1]=(x[1][1]+x[0][1]+x[2][1]+x[1][0]+x[1][2])%2\r\ny[1][2]=(x[1][2]+x[0][2]+x[1][1]+x[2][2])%2\r\ny[2][0]=(x[2][0]+x[1][0]+x[2][1])%2\r\ny[2][1]=(x[2][1]+x[1][1]+x[2][0]+x[2][2])%2\r\ny[2][2]=(x[2][2]+x[2][1]+x[1][2])%2\r\nfor i in y:\r\n for j in i:\r\n print(abs(1-j),end=\"\")\r\n print(\"\")\r\n", "lights = [[True,True,True],[True,True,True],[True,True,True]]\nfor i in range(3):\n switches = list(map(int,input().split()))\n for j in range(3):\n if switches[j]%2:\n lights[i][j] = not (lights[i][j])\n if j==0:\n lights[i][j+1] = not (lights[i][j+1])\n elif j==1:\n lights[i][j+1] = not (lights[i][j+1])\n lights[i][j-1] = not (lights[i][j-1])\n else:\n lights[i][j-1] = not lights[i][j-1]\n if i==0:\n lights[i+1][j] = not lights[i+1][j]\n elif i==1:\n lights[i+1][j] = not lights[i+1][j]\n lights[i-1][j] = not lights[i-1][j]\n else:\n lights[i-1][j] = not lights[i-1][j]\nfor row in range(3):\n s = \"\"\n for col in range(3):\n if lights[row][col]:\n s+=\"1\"\n else:\n s+=\"0\"\n print(s)\n ", "dx = [-1, 0, 1, 0,-1, 1, 1, -1]\r\ndy = [ 0, 1, 0,-1, 1, 1,-1, -1]\r\n\r\n\r\ndef valid(x, y):\r\n return (x >= 0) and (x <= 2) and (y <= 2) and (y >= 0)\r\n\r\n\r\ndef apply(_x, _y):\r\n grid[_x][_y] += inp[_x][_y]\r\n for d in range(0, 4):\r\n if valid(_x + dx[d], _y + dy[d]):\r\n grid[_x + dx[d]][_y + dy[d]] += inp[_x][_y]\r\n\r\n\r\ngrid = [[1, ] * 3 for _ in range(3)]\r\ninp = [list(map(int, input().split())) for i in range(3)]\r\n\r\nfor i in range(0, 3):\r\n for j in range(0, 3):\r\n if inp[i][j]:\r\n apply(i, j)\r\nfor i in range(0, 3):\r\n for j in range(0, 3):\r\n print(grid[i][j] % 2, end=\"\")\r\n print(\"\")\r\n", "def diver(n):\r\n return int(n)%2\r\n\r\n\r\na = [list(map(diver, input().split(' '))), list(map(diver, input().split(' '))), list(map(diver, input().split(' ')))]\r\nb = [[1,1,1], [1,1,1], [1,1,1]]\r\n\r\nfor y in range(3):\r\n for x in range(3):\r\n if a[y][x] == 1:\r\n b[y][x] = (b[y][x]+1)%2\r\n if(x < 2):\r\n b[y][x+1] = (b[y][x+1]+1)%2\r\n if(x > 0):\r\n b[y][x-1] = (b[y][x-1]+1)%2\r\n if(y < 2):\r\n b[y+1][x] = (b[y+1][x]+1)%2\r\n if(y > 0):\r\n b[y-1][x] = (b[y-1][x]+1)%2\r\n\r\nfor i in b:\r\n for j in i:\r\n print(j, end=\"\")\r\n print()", "m = [[0]*3 for _ in range(3)]\r\n\r\n\r\ndef modify(i, j, x):\r\n m[i][j] += x\r\n if i+1 < 3:\r\n m[i+1][j] += x\r\n if j+1 < 3:\r\n m[i][j+1] += x\r\n if i-1 >= 0:\r\n m[i-1][j] += x\r\n if j-1 >= 0:\r\n m[i][j-1] += x\r\n\r\n\r\ndef main():\r\n for i in range(3):\r\n for j, x in enumerate(input().split()):\r\n modify(i, j, int(x))\r\n\r\n for row in m:\r\n for ele in row:\r\n print(1 if ele%2==0 else 0, end='')\r\n print()\r\n\r\nmain()\r\n", "lst1=list(map(int,input().split()))\r\nlst2=list(map(int,input().split()))\r\nlst3=list(map(int,input().split()))\r\nlst=[lst1,lst2,lst3]\r\nlstm=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(lst[i][j]):\r\n if lstm[i][j]==1:\r\n lstm[i][j]=0\r\n else:\r\n lstm[i][j]=1\r\n if j-1>=0:\r\n if lstm[i][j-1]==1:\r\n lstm[i][j-1]=0\r\n else:\r\n lstm[i][j-1]=1\r\n if j+1<3:\r\n if lstm[i][j+1]==1:\r\n lstm[i][j+1]=0\r\n else:\r\n lstm[i][j+1]=1\r\n if i+1<3:\r\n if lstm[i+1][j]==1:\r\n lstm[i+1][j]=0\r\n else:\r\n lstm[i+1][j]=1\r\n if i-1>=0:\r\n if lstm[i-1][j]==1:\r\n lstm[i-1][j]=0\r\n else:\r\n lstm[i-1][j]=1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(lstm[i][j],end='')\r\n print()", "a = []\narr = [[1,1,1],[1,1,1],[1,1,1]]\nl=[1,0]*5\na1=b1=c1=d1=e1=f1=g1=h1=i1=0\nfor i in range(3):\n a.append(list(map(int,input().split())))\nif a[0][0]%2!=0:\n a1 += 1\n b1 += 1\n d1 += 1\n arr[0][0] = l[a1]\n arr[0][1] = l[b1]\n arr[1][0] = l[d1]\nif a[0][1]%2!=0:\n a1 += 1\n b1 += 1\n e1 += 1\n c1 += 1\n arr[0][0] = l[a1]\n arr[0][1] = l[b1]\n arr[1][1] = l[e1]\n arr[0][2] = l[c1]\nif a[0][2]%2!=0:\n b1 += 1\n c1 += 1\n f1 += 1\n arr[0][1] = l[b1]\n arr[0][2] = l[c1]\n arr[1][2] = l[f1]\nif a[1][0]%2!=0:\n a1 += 1\n e1 += 1\n d1 += 1\n g1 += 1\n arr[0][0] = l[a1]\n arr[1][1] = l[e1]\n arr[2][0] = l[g1]\n arr[1][0] = l[d1]\nif a[1][1]%2!=0:\n d1 += 1\n e1 += 1\n b1 += 1\n h1 += 1\n f1 += 1\n arr[1][0] = l[d1]\n arr[1][1] = l[e1]\n arr[0][1] = l[b1]\n arr[2][1] = l[h1]\n arr[1][2] = l[f1]\nif a[1][2]%2!=0:\n c1 += 1\n f1 += 1\n e1 += 1\n i1 += 1\n arr[0][2] = l[c1]\n arr[1][2] = l[f1]\n arr[1][1] = l[e1]\n arr[2][2] = l[i1]\nif a[2][0]%2!=0:\n d1 += 1\n g1 += 1\n h1 += 1\n arr[1][0] = l[d1]\n arr[2][0] = l[g1]\n arr[2][1] = l[h1]\nif a[2][1]%2!=0:\n g1 += 1\n h1 += 1\n e1 += 1\n i1 += 1\n arr[2][0] = l[g1]\n arr[2][1] = l[h1]\n arr[1][1] = l[e1]\n arr[2][2] = l[i1]\nif a[2][2]%2!=0:\n f1 += 1\n i1 += 1\n h1 += 1\n arr[1][2] = l[f1]\n arr[2][2] = l[i1]\n arr[2][1] = l[h1]\nfor i in arr:\n print(''.join(list(map(str,i))))", "a = []\r\nc = [[1 for i in range(3)] for j in range(3)]\r\nfor i in range(3):\r\n a.append(list(map(int,input().split())))\r\ndef isvalid(i,j):\r\n return (i>=0 and i<3) and (j>=0 and j<3) \r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] % 2 != 0:\r\n if c[i][j] == 1:\r\n c[i][j] = 0\r\n else:\r\n c[i][j] = 1\r\n if isvalid(i,j-1):\r\n if c[i][j-1] == 1:\r\n c[i][j-1] = 0\r\n else:\r\n c[i][j-1] = 1\r\n if isvalid(i,j+1):\r\n if c[i][j+1] == 1:\r\n c[i][j+1] = 0\r\n else:\r\n c[i][j+1] = 1\r\n if isvalid(i-1,j):\r\n if c[i-1][j] == 1:\r\n c[i-1][j] = 0\r\n else:\r\n c[i-1][j] = 1\r\n if isvalid(i+1,j):\r\n if c[i+1][j] == 1:\r\n c[i+1][j] = 0\r\n else:\r\n c[i+1][j] = 1\r\nfor i in range(3):\r\n print(''.join(list(map(str,c[i]))))", "# https://codeforces.com/contest/275/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\nlights_list = list()\r\nnew_light = list()\r\nfor i in range(3):\r\n lights_list.append(tuple(multi_integer()))\r\n\r\nfor i in range(3):\r\n temp = list()\r\n for j in range(3):\r\n ans = 0\r\n if i == 0:\r\n if j == 0:\r\n ans = lights_list[i][j] + lights_list[i + 1][j] + lights_list[i][j + 1]\r\n elif j == 2:\r\n ans = lights_list[i][j] + lights_list[i + 1][j] + lights_list[i][j - 1]\r\n else:\r\n ans = lights_list[i][j] + lights_list[i][j + 1] + lights_list[i][j - 1] + lights_list[i + 1][j]\r\n\r\n elif i == 2:\r\n if j == 0:\r\n ans = lights_list[i][j] + lights_list[i - 1][j] + lights_list[i][j + 1]\r\n elif j == 2:\r\n ans = lights_list[i][j] + lights_list[i - 1][j] + lights_list[i][j - 1]\r\n else:\r\n ans = lights_list[i][j] + lights_list[i][j + 1] + lights_list[i][j - 1] + lights_list[i - 1][j]\r\n\r\n else:\r\n if j == 0:\r\n ans = lights_list[i][j] + lights_list[i - 1][j] + lights_list[i][j + 1] + lights_list[i + 1][j]\r\n elif j == 2:\r\n ans = lights_list[i][j] + lights_list[i - 1][j] + lights_list[i][j - 1] + lights_list[i + 1][j]\r\n else:\r\n ans = lights_list[i][j] + lights_list[i][j + 1] + lights_list[i][j - 1] + lights_list[i - 1][j] + lights_list[i + 1][j]\r\n\r\n if ans % 2 == 0:\r\n temp.append(1)\r\n else:\r\n temp.append(0)\r\n\r\n new_light.append(temp)\r\n\r\nfor i in new_light:\r\n print(\"\".join(str(k) for k in i))\r\n", "a=[]\r\nbb=[0]*3\r\nb=[]\r\nfor i in range(3):\r\n l=list(map(int,input().split()))\r\n a.append(l)\r\n b.append(bb[:])\r\nfor i in range(3):\r\n for j in range(3):\r\n sum=0\r\n if i>0:\r\n sum+=a[i-1][j]\r\n if i<2:\r\n sum+=a[i+1][j]\r\n if j>0:\r\n sum+=a[i][j-1]\r\n if j<2:\r\n sum+=a[i][j+1]\r\n b[i][j]=sum+a[i][j]\r\nfor i in range(3):\r\n for j in range(3):\r\n if b[i][j]%2==0:\r\n print(1,end='')\r\n else:\r\n print(0,end='')\r\n print('')", "a= []\r\nl= []\r\nfor i in range(3):\r\n t= list(map(int, input().split()))\r\n t.append(0)\r\n l.append(t)\r\n a.append([1, 1, 1])\r\n \r\nl.append([0, 0, 0, 0])\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n state= l[i][j]+l[i+1][j]+l[i-1][j]+l[i][j+1]+l[i][j-1]\r\n if state%2== 1:\r\n a[i][j]= 0\r\n\r\nfor k in range(3):\r\n print(str(a[k][0])+str(a[k][1])+str(a[k][2]))\r\n ", "\r\n\r\nb=[]\r\nfor i in range(3):\r\n a=list(input().split())\r\n b.append(a)\r\nd=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(len(b)):\r\n for j in range(len(b[0])):\r\n if int(b[i][j])%2==1:\r\n d[i][j]=d[i][j]+1\r\n if i-1>=0:d[i-1][j]=d[i-1][j]+1\r\n if i+1<len(b):d[i+1][j]=d[i+1][j]+1\r\n if j-1>=0:d[i][j-1]=d[i][j-1]+1\r\n if j+1<len(b[0]):d[i][j+1]=d[i][j+1]+1\r\nfor i in range(len(d)):\r\n for j in range(len(d[0])):\r\n if d[i][j]%2==0:\r\n d[i][j]=\"0\"\r\n else:\r\n d[i][j]=\"1\"\r\nfor i in d:\r\n x=\"\".join(i)\r\n print(x)\r\n", "def switch(value):\n return (value + 1) % 2\n\ndef adjacent(starting_game, i, j):\n starting_game[i][j] = switch(starting_game[i][j])\n if i != 0:\n starting_game[i-1][j] = switch(starting_game[i-1][j])\n if j != 0:\n starting_game[i][j-1] = switch(starting_game[i][j-1])\n if i != 2:\n starting_game[i+1][j] = switch(starting_game[i+1][j])\n if j != 2:\n starting_game[i][j+1] = switch(starting_game[i][j+1])\n return starting_game\n\n\nstarting_game = [[1,1,1],[1,1,1],[1,1,1]]\n\npress_sequence = []\nfor i in range(3):\n pressing = input().split()\n pressing = [int(x) for x in pressing]\n press_sequence.append(pressing)\n\nfor i in range(3):\n for j in range(3):\n if (press_sequence[i][j]) % 2 != 0:\n starting_game = adjacent(starting_game, i, j)\n\nfor result in starting_game:\n result = [str(x) for x in result]\n print(''.join(result))\n \t \t\t \t\t\t\t\t \t\t \t\t\t \t\t\t \t \t", "import copy\r\n\r\na = [[0] * 5]\r\nfor _ in range(3):\r\n a.append([0, *map(int, input().split()), 0])\r\na.append([0] * 5)\r\n\r\nb = copy.deepcopy(a)\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if (a[i][j] + a[i - 1][j] + a[i + 1][j] + a[i][j - 1] + a[i][j + 1]) % 2:\r\n b[i][j] = 0\r\n else:\r\n b[i][j] = 1\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n print(b[i][j], end=\"\")\r\n print()\r\n", "#import os\r\n#file_directory=os.path.dirname(os.path.abspath(__file__))\r\n#inp_file=open(file_directory+\"/Lights out.INP\")\r\n\r\nans=[\r\n [1,1,1],\r\n [1,1,1],\r\n [1,1,1]\r\n]\r\n#print(ans)\r\ninp=[\r\n [1,1,1],\r\n [1,1,1],\r\n [1,1,1]\r\n]\r\nfor i in range(3):\r\n inp[i][0],inp[i][1],inp[i][2]=map(int,input().split())\r\n#print(ans)\r\nfor i in range(3):\r\n for j in range(3):\r\n #print('checking inp[',i,'][',j,']')\r\n #tmp=inp[i-1][j-1]+inp[i-1][j+1]+inp[i+1][j-1]+inp[i+1][j+1]\r\n tmp=inp[i][j]\r\n if i-1>=0:\r\n tmp+=inp[i-1][j]\r\n # print('added',inp[i-1][j],i-1,j)\r\n if j+1<3:\r\n tmp+=inp[i][j+1]\r\n # print('added',inp[i][j+1],i,j+1)\r\n if i+1<3:\r\n tmp+=inp[i+1][j]\r\n # print('added',inp[i+1][j],i+1,j)\r\n if j-1>=0:\r\n tmp+=inp[i][j-1]\r\n # print('added',inp[i][j-1],i,j-1)\r\n #print(tmp)\r\n if tmp%2==1:\r\n ans[i][j]=0\r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j],end='')\r\n print()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 19 21:17:20 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\nm = []\r\nfor i in range(3):\r\n l = input()\r\n l = l.split()\r\n m.append(l)\r\n\r\nout = []\r\nfor i in range(3):\r\n s = ''\r\n for j in range(3):\r\n soma = 0\r\n for x in range(i-1,i+2):\r\n if 0<=x<=2:\r\n soma += int(m[x][j])\r\n for y in range(j-1,j+2):\r\n if 0<=y<=2:\r\n soma+= int(m[i][y])\r\n soma -= int(m[i][j])\r\n if soma%2 == 0:\r\n s += '1'\r\n else:\r\n s+= '0' \r\n print(s)\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n ", "l=[]\r\nfor i in range(3):\r\n l.append(list(map(int,input().split(\" \"))))\r\nfor i in range(3):\r\n for j in range(3):\r\n s=l[i][j]\r\n if j-1>=0:\r\n s+=l[i][j-1]\r\n if j+1<3:\r\n s+=l[i][j+1]\r\n if i-1>=0:\r\n s+=l[i-1][j]\r\n if i+1<3:\r\n s+=l[i+1][j]\r\n if s%2==0:\r\n print(\"1\",end=\"\")\r\n else:\r\n print(\"0\",end=\"\")\r\n print()", "# author: violist\n# created: 28.07.2021 12:56:40\n\nimport sys\ninput = sys.stdin.readline\n\nmatrix = []\nfor i in range(3):\n matrix.append(list(map(int, input().split())))\nn = 3\nstate = [[1] * n for i in range(n)]\nfor i in range(n):\n for j in range(n):\n if (matrix[i][j] % 2):\n state[i][j] ^= 1\n if (i > 0):\n state[i - 1][j] ^= 1\n if (i < 2):\n state[i + 1][j] ^= 1\n if (j > 0):\n state[i][j - 1] ^= 1\n if (j < 2):\n state[i][j + 1] ^= 1\nfor i in range(n):\n for j in range(n):\n print(state[i][j], end = \"\")\n print()\n", "\r\nl = []\r\nfor _ in range(3):\r\n\tl.append(list(map(int, input().split())))\r\n\r\n\r\nlf = l[:]\r\n\r\nrow2 = [l[0][i] + l[2][i] for i in range(3)]\r\nrow = [l[1][i] for i in range(3)]\r\ncol = [l[i][1] for i in range(3)]\r\n\r\n\r\ncol2 = [l[i][0] + l[i][2] for i in range(3)]\r\n\r\nfor i in range(3):\r\n\tlf[1][i] += row2[i]\r\n\tlf[i][1] += col2[i]\r\n\tlf[0][i] += row[i]\r\n\tlf[2][i] += row[i]\r\n\tlf[i][0] += col[i]\r\n\tlf[i][2] += col[i]\r\n\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif lf[i][j] % 2 == 0:\r\n\t\t\tlf[i][j] = '1'\r\n\t\telse:\r\n\t\t\tlf[i][j] = '0'\r\n\r\nfor i in range(3):\r\n\tprint(''.join(lf[i]))", "a=[0,0,0]\r\nfor i in range(3):\r\n\ta[i]=list(map(int,input().split()))\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tsum=0\r\n\t\tsum+=a[i][j]\r\n\t\tif(i>0):\r\n\t\t\tsum += a[i - 1][j]\r\n\t\tif (i != 2):\r\n\t\t\tsum += a[i + 1][j]\r\n\t\tif (j > 0):\r\n\t\t\tsum += a[i][j - 1]\r\n\t\tif (j != 2):\r\n\t\t\tsum += a[i][j + 1]\r\n\r\n\t\tprint((1-sum)%2,end='')\r\n\r\n\tprint()\r\n# m = []\r\n# re = []\r\n# for i in range(3):\r\n# s = list(map(int, input().split()))\r\n# m.append(s)\r\n# t = [1,1,1]\r\n# re.append(t)\r\n# # print(re)\r\n# i=0\r\n# while(i<3):\r\n# for j in range(1,3+1):\r\n# if (m[i][j-1]==1):\r\n# if i<2 and j!=2:\r\n# if re[i][j-1]==0:\r\n# re[i][j-1]=1\r\n# else:\r\n# re[i][j-1] = 0\r\n#\r\n# if re[i][j]==0:\r\n# re[i][j] = 1\r\n# else:\r\n# re[i][j] = 0\r\n#\r\n# if re[i+1][j-1]==0:\r\n# re[i+1][j-1] = 1\r\n# else:\r\n# re[i+1][j-1] = 0\r\n#\r\n# if re[i+1][j]==0:\r\n# re[i + 1][j] = 1\r\n# else:\r\n# re[i+1][j]=0\r\n#\r\n# elif j==2 and i<2:\r\n# if re[i][j] == 0:\r\n# re[i][j] = 1\r\n# else:\r\n# re[i][j] = 0\r\n#\r\n# if re[i + 1][j] == 0:\r\n# re[i + 1][j] = 1\r\n# else:\r\n# re[i + 1][j] = 0\r\n#\r\n# if re[i][j - 1] == 0:\r\n# re[i][j - 1] = 1\r\n# else:\r\n# re[i][j - 1] = 0\r\n#\r\n# if re[i+1][j-1]==0:\r\n# re[i+1][j-1]=1\r\n# else:\r\n# re[i+1][j-1]= 0\r\n#\r\n# elif i==2 and j<2:\r\n# if re[i][j - 1] == 0:\r\n# re[i][j - 1] = 1\r\n# else:\r\n# re[i][j - 1] = 0\r\n#\r\n# if re[i-1][j - 1] == 0:\r\n# re[i-1][j - 1] = 1\r\n# else:\r\n# re[i-1][j - 1] = 0\r\n#\r\n# if re[i][j] == 0:\r\n# re[i][j] = 1\r\n# else:\r\n# re[i][j] = 0\r\n#\r\n# re[i+1][j]=0\r\n#\r\n# elif i == 2 and j == 2:\r\n# if re[i][j] == 0:\r\n# re[i][j] = 1\r\n# else:\r\n# re[i][j] = 0\r\n#\r\n# if re[i][j - 1] == 0:\r\n# re[i][j - 1] = 1\r\n# else:\r\n# re[i][j - 1] = 0\r\n#\r\n# if re[i-1][j] == 0:\r\n# re[i-1][j] = 1\r\n# else:\r\n# re[i-1][j] = 0\r\n#\r\n# if re[i-1][j - 1] == 0:\r\n# re[i-1][j - 1] = 1\r\n# else:\r\n# re[i-1][j - 1] = 0\r\n#\r\n# print(\"--------\")\r\n# for l in range(1,3+1):\r\n# print(re[l-1])\r\n# print(\"--------\")\r\n# print()\r\n# i+=1\r\n# print()\r\n#\r\n", "res = [[1,1,1],[1,1,1],[1,1,1]]\n\nfor i in range(3):\n arr = input().split(' ')\n for j in range(3):\n val = int(arr[j]) % 2\n if val == 1:\n res[i][j] = 0 if res[i][j] == 1 else 1\n if i+1 < 3:\n res[i+1][j] = 0 if res[i+1][j] == 1 else 1\n if i-1 > -1:\n res[i-1][j] = 0 if res[i-1][j] == 1 else 1\n if j+1 < 3:\n res[i][j+1] = 0 if res[i][j+1] == 1 else 1\n if j-1 > -1:\n res[i][j-1] = 0 if res[i][j-1] == 1 else 1\nfor i in range(3):\n temp = ''\n for j in range(3):\n temp += str(res[i][j])\n print(temp)", "z=[]\r\nfor t in range(5):\r\n k=[]\r\n for p in range(5):\r\n k.append(1)\r\n z.append(k)\r\nz1=[]\r\nfor t in range(3):\r\n z1.append(list(map(int, input().split())))\r\nfor t in range(len(z1)):\r\n for q in range(len(z1[t])):\r\n if z1[t][q]%2:\r\n t+=1\r\n q+=1\r\n z[t][q]+=1\r\n z[t+1][q]+=1\r\n z[t-1][q]+=1\r\n z[t][q+1]+=1\r\n z[t][q-1]+=1\r\n t-=1\r\n q-=1\r\nfor t in range(1,len(z)-1):\r\n print(str(z[t][1]%2)+str(z[t][2]%2)+str(z[t][3]%2))", "b=[];c=[]\r\nfor i in range(3):\r\n a=list(map(int,input().split()))\r\n b.append(a)\r\nfor i in range(5):\r\n c.append([1,1,1,1,1])\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(b[i][j]):\r\n if c[1+i][1+j]==1:\r\n c[1+i-1][1+j]=int(not c[1+i-1][1+j])\r\n c[1+i+1][1+j]=int(not c[1+i+1][1+j])\r\n c[1+i][1+j]=int(not c[1+i][1+j])\r\n c[1+i][1+j-1]=int(not c[1+i][1+j-1])\r\n c[1+i][1+j+1]=int(not c[1+i][1+j+1])\r\n else:\r\n c[1+i-1][1+j]=int(not c[1+i-1][1+j])\r\n c[1+i+1][1+j]=int(not c[1+i+1][1+j])\r\n c[1+i][1+j]=int(not c[1+i][1+j])\r\n c[1+i][1+j-1]=int(not c[1+i][1+j-1])\r\n c[1+i][1+j+1]=int(not c[1+i][1+j+1])\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print(c[i][j],end=\"\")\r\n print()", "def toggle(i,j):\r\n zoz[i][j]=flip(zoz[i][j])\r\n if i-1>=0:\r\n zoz[i-1][j]=flip(zoz[i-1][j])\r\n if i+1<=2:\r\n zoz[i+1][j]=flip(zoz[i+1][j])\r\n if j-1>=0:\r\n zoz[i][j-1]=flip(zoz[i][j-1])\r\n if j+1<=2:\r\n zoz[i][j+1]=flip(zoz[i][j+1])\r\n \r\n\r\ndef flip(i):\r\n if i==0:\r\n return 1\r\n return 0\r\n\r\nzoz=[[1,1,1],[1,1,1],[1,1,1]]\r\ninp=[]\r\n\r\nfor i in range(3):\r\n inp.append([int(x)%2 for x in input().split(\" \")])\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if inp[i][j]==1:\r\n toggle(i,j)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(zoz[i][j],end=\"\")\r\n print()\r\n\r\n\r\n", "# eu amo esse joguinho\n# tem que ficar seguindo as luzes até a última linha\n# não é isso que o problema perguntou mas é legal de saber\nmatrix = [\n [int(i) for i in input().split()],\n [int(j) for j in input().split()],\n [int(k) for k in input().split()]\n]\nsums_matrix = [\n [0, 0, 0],\n [0, 0, 0],\n [0, 0, 0]\n]\nresults_matrix = [\n [\"1\", \"1\", \"1\"],\n [\"1\", \"1\", \"1\"],\n [\"1\", \"1\", \"1\"]\n]\nfor y in range(0, 3):\n for x in range(0, 3):\n sums_matrix[y][x] += matrix[y][x]\n if y < 2:\n sums_matrix[y][x] += matrix[y+1][x]\n sums_matrix[y+1][x] += matrix[y][x]\n if x < 2:\n sums_matrix[y][x] += matrix[y][x+1]\n sums_matrix[y][x+1] += matrix[y][x]\n results_matrix[y][x] = \"1\" if sums_matrix[y][x] % 2 == 0 else \"0\"\n print(\"\".join(results_matrix[y]))\n\t \t \t \t \t \t \t \t \t \t \t", "m = [[1 for i in range(3)] for j in range(3)]\n\na = []\nfor i in range(3):\n a.append(list(map(int, input().split(\" \"))))\n\ndx = [0,0,-1,0,1]\ndy = [0,1,0,-1,0]\n\nfor i in range(3):\n for j in range(3):\n x,y = i,j\n if a[i][j]%2==0:\n continue\n for k in range(5):\n nx, ny = x+dx[k], y+dy[k]\n if nx<0 or ny<0 or nx>2 or ny>2 :\n continue\n if m[nx][ny] == 0 : \n m[nx][ny] = 1 \n else:\n m[nx][ny] = 0\n\nfor i in range(3):\n for j in range(3):\n print(m[i][j], end=\"\")\n print()\n", "inn = []\r\ntoggle = lambda x: 1 if x == 0 else 0\r\nstate = [[1 for a in range(3)] for a in range(3)]\r\n\r\n\r\ndef change_state(st, x, y):\r\n st[x][y] = toggle(st[x][y])\r\n if x > 0:\r\n st[x-1][y] = toggle(st[x-1][y])\r\n if x < 2:\r\n st[x+1][y] = toggle(st[x+1][y])\r\n if y > 0:\r\n st[x][y-1] = toggle(st[x][y-1])\r\n if y < 2:\r\n st[x][y+1] = toggle(st[x][y+1])\r\n return st\r\n \r\n\r\nfor j in range(3):\r\n i = input().split()\r\n inn.append([i[0], i[1], i[2]])\r\n for k in range(3):\r\n for _ in range(int(i[k])):\r\n state = change_state(state, j, k)\r\n \r\nfor a in state:\r\n for b in a:\r\n print(b, end=\"\")\r\n print()", "l1=list(map(int,input().strip(\" \").split(\" \")))\r\nl2=list(map(int,input().strip(\" \").split(\" \")))\r\nl3=list(map(int,input().strip(\" \").split(\" \")))\r\nx=[l1,l2,l3]\r\na=[[1 for i in range(len(x))]for j in range(len(x[0]))]\r\nfor i in range(3):\r\n for j in range(3):\r\n if x[i][j]%2!=0:\r\n a[i][j]=(0 if a[i][j]==1 else 1)\r\n if j<2:\r\n a[i][j+1]=(0 if a[i][j+1]==1 else 1)\r\n if i<2:\r\n a[i+1][j]=(0 if a[i+1][j]==1 else 1)\r\n if i>0:\r\n a[i-1][j]=(0 if a[i-1][j]==1 else 1)\r\n if j>0:\r\n a[i][j-1]=(0 if a[i][j-1]==1 else 1)\r\nans=\"\"\r\nfor i in range(3):\r\n print(ans+str(a[i][0])+str(a[i][1])+str(a[i][2]))", "k=[[0,0,0,0,0]]\r\nfor i in range(3):\r\n k.append([0]+list(map(int,input().split()))+[0])\r\nk.append([0,0,0,0,0])\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print((((k[i+1][j]+k[i-1][j]+k[i][j-1]+k[i][j+1]+k[i][j])&1)+1)&1,end=\"\")\r\n print()\r\n\r\n \r\n \r\n", "matrix_input = [list(map(int, input().split())) for i in range(3)]\r\n\r\nx = 1\r\nmatrix_output = [[x for i in range(3)] for j in range(3)]\r\n\r\ny = 0\r\nmatrix_sum = [[y for i in range(3)] for j in range(3)]\r\n\r\nmatrix_sum[0][0] = matrix_input[0][0] + matrix_input[0][1] + matrix_input[1][0]\r\nmatrix_sum[0][1] = matrix_input[0][1] + matrix_input[0][0] + matrix_input[0][2] + matrix_input[1][1]\r\nmatrix_sum[0][2] = matrix_input[0][2] + matrix_input[0][1] + matrix_input[1][2]\r\nmatrix_sum[1][0] = matrix_input[1][0] + matrix_input[0][0] + matrix_input[1][1] + matrix_input[2][0]\r\nmatrix_sum[1][1] = matrix_input[1][1] + matrix_input[0][1] + matrix_input[2][1] + matrix_input[1][0] + matrix_input[1][2]\r\nmatrix_sum[1][2] = matrix_input[1][2] + matrix_input[0][2] + matrix_input[2][2] + matrix_input[1][1]\r\nmatrix_sum[2][0] = matrix_input[2][0] + matrix_input[1][0] + matrix_input[2][1]\r\nmatrix_sum[2][1] = matrix_input[2][1] + matrix_input[1][1] + matrix_input[2][0] + matrix_input[2][2]\r\nmatrix_sum[2][2] = matrix_input[2][2] + matrix_input[1][2] + matrix_input[2][1]\r\n\r\n# print(matrix_sum)\r\n\r\nfor row in range(3):\r\n for col in range(3):\r\n if matrix_sum[row][col] % 2 == 0:\r\n matrix_output[row][col] = 1\r\n else:\r\n matrix_output[row][col] = 0\r\n\r\nfor row in matrix_output:\r\n print(\"\".join(map(str, row)))\r\n", "mat = [list(map(int,input().split())) for i in range(3)]\r\nres = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if mat[i][j] % 2 != 0:\r\n if res[i][j] == 1:\r\n res[i][j] = 0\r\n else:\r\n res[i][j] = 1\r\n if j+1 in [0,1,2]:\r\n if res[i][j+1] == 1:\r\n res[i][j+1] = 0\r\n else:\r\n res[i][j+1] = 1\r\n if i+1 in [0,1,2]:\r\n if res[i+1][j] == 1:\r\n res[i+1][j] = 0\r\n else:\r\n res[i+1][j] = 1\r\n if i-1 in [0,1,2]:\r\n if res[i-1][j] == 1:\r\n res[i-1][j] = 0\r\n else:\r\n res[i-1][j] = 1\r\n if j-1 in [0,1,2]:\r\n if res[i][j-1] == 1:\r\n res[i][j-1] = 0\r\n else:\r\n res[i][j-1] = 1\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(res[i][j],end='')\r\n print()", "def toggle(status, toggles):\r\n if toggles%2==1:\r\n return int(not bool(status))\r\n else:\r\n return status\r\n \r\n\r\nst = [[1 for col in range(3)] for row in range(3)]\r\nn_toggles = []\r\nfor _ in range(3):\r\n n_toggles.append(list(map(int, input().split())))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n nt = n_toggles[i][j]\r\n st[i][j] = toggle(st[i][j], nt)\r\n if i+1<3:\r\n st[i+1][j] = toggle(st[i+1][j], nt)\r\n if i-1>-1:\r\n st[i-1][j] = toggle(st[i-1][j], nt)\r\n if j+1<3:\r\n st[i][j+1] = toggle(st[i][j+1], nt)\r\n if j-1>-1:\r\n st[i][j-1] = toggle(st[i][j-1], nt)\r\n \r\nfor row in st: \r\n print(''.join(list(map(str,row))))", "# http://codeforces.com/problemset/problem/271/A\r\n# http://codeforces.com/problemset/problem/275/A\r\n\"\"\"\r\nThis is a question from codeforces.\r\n\"\"\"\r\n\r\n\r\ndef is_distinct(number: int) -> bool:\r\n \"\"\"\r\n :param number: input integer\r\n :return: boolean true/false\r\n \"\"\"\r\n key_map = [0] * 10\r\n\r\n while number:\r\n num = number % 10\r\n if key_map[num]:\r\n return False\r\n key_map[num] = 1\r\n number //= 10\r\n\r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n inp_space = []\r\n for _ in range(3):\r\n inp_space.append(list(map(int, input().split())))\r\n op_space = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n direction = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n for i in range(3):\r\n for j in range(3):\r\n if inp_space[i][j] % 2:\r\n op_space[i][j] = 1 - op_space[i][j]\r\n for dx, dy in direction:\r\n ni, nj = i + dx, j + dy\r\n if (0 <= ni < 3) and (0 <= nj < 3):\r\n op_space[ni][nj] = 1 - op_space[ni][nj]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n print(op_space[i][j], end='')\r\n print('')", "def toggle(integer):\n if integer == 1:\n return 0\n else:\n return 1\n\noriginal = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\nmatrix = []\nfor _ in range(3):\n cur_line = list(map(int, input().split()))\n matrix.append(cur_line)\n\nfor i in range(3):\n for j in range(3):\n sides = []\n if matrix[i][j] % 2 == 0:\n continue\n elif matrix[i][j] > 0:\n if j - 1 in range(3) and i in range(3):\n sides.append([j - 1, i])\n if i - 1 in range(3) and j in range(3):\n sides.append([j, i - 1])\n if j + 1 in range(3) and i in range(3):\n sides.append([j + 1, i])\n if i + 1 in range(3) and j in range(3):\n sides.append([j, i + 1])\n if i in range(3) and j in range(3):\n sides.append([j, i])\n if(len(sides) > 0):\n for _ in sides:\n original[_[1]][_[0]] = toggle(original[_[1]][_[0]])\n\nfor _ in original:\n for z in _:\n print(z, end=\"\")\n print('')\n \n\n\n\n", "def toggle(farr, i, j):\r\n if farr[i][j] == \"0\":\r\n farr[i][j] = \"1\"\r\n else:\r\n farr[i][j] = \"0\"\r\n\r\n\r\nfarr = [[1,1,1],[1,1,1],[1,1,1]]\r\nmatrix = []\r\nfor i in range(3):\r\n\ta = list(map(int, input().split()))\r\n\tmatrix.append(a)\r\n\r\ntest = [0,1,2]\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(matrix[i][j]):\r\n up = i - 1\r\n left = j - 1\r\n right = j + 1\r\n down = i + 1\r\n toggle(farr, i, j)\r\n if up in test:\r\n toggle(farr, up, j)\r\n if(left in test):\r\n toggle(farr, i, left)\r\n if(right in test):\r\n toggle(farr, i, right)\r\n if(down in test):\r\n toggle(farr, down, j)\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(farr[i][j], end = \"\")\r\n print()\r\n", "# Read input\r\ngrid = []\r\nfor _ in range(3):\r\n row = list(map(int, input().split()))\r\n grid.append(row)\r\n\r\nlights_grid = [[1] * 3 for _ in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j] % 2 == 1:\r\n lights_grid[i][j] = 1 - lights_grid[i][j]\r\n if i > 0:\r\n lights_grid[i - 1][j] = 1 - lights_grid[i - 1][j]\r\n if i < 2:\r\n lights_grid[i + 1][j] = 1 - lights_grid[i + 1][j]\r\n if j > 0:\r\n lights_grid[i][j - 1] = 1 - lights_grid[i][j - 1]\r\n if j < 2:\r\n lights_grid[i][j + 1] = 1 - lights_grid[i][j + 1]\r\nfor i in range(3):\r\n print(''.join(map(str, lights_grid[i])))\r\n", "arr = []\r\nbrr = []\r\nfor i in range(3):\r\n arr.append(list(map(int, input().split())))\r\n brr.append([1,1,1])\r\nfor i in range(3):\r\n for j in range(3):\r\n if arr[i][j] % 2 != 0:\r\n brr[i][j] = brr[i][j] * -1\r\n if i>0:\r\n brr[i-1][j] = brr[i-1][j] * -1\r\n if i<2:\r\n brr[i+1][j] = brr[i+1][j] * -1\r\n if j>0:\r\n brr[i][j-1] = brr[i][j-1] * -1\r\n if j<2:\r\n brr[i][j+1] = brr[i][j+1] * -1\r\nfor i in range(3):\r\n for j in range(3):\r\n if brr[i][j] == -1:\r\n brr[i][j] = '0'\r\n else:\r\n brr[i][j] = '1'\r\n print(''.join(brr[i]))\r\n ", "def solve(matrix):\r\n toggled = [[\"1\" for i in range(3)] for j in range(3)]\r\n for i in range(3):\r\n for j in range(3):\r\n if int(matrix[i][j]) % 2 != 0:\r\n if toggled[i][j] == \"0\":\r\n toggled[i][j] = \"1\"\r\n else:\r\n toggled[i][j] = \"0\"\r\n if i - 1 >= 0:\r\n if toggled[i - 1][j] == \"0\":\r\n toggled[i - 1][j] = \"1\"\r\n else:\r\n toggled[i - 1][j] = \"0\"\r\n if j - 1 >= 0:\r\n if toggled[i][j - 1] == \"0\":\r\n toggled[i][j - 1] = \"1\"\r\n else:\r\n toggled[i][j - 1] = \"0\"\r\n if i + 1 < 3:\r\n if toggled[i + 1][j] == \"0\":\r\n toggled[i + 1][j] = \"1\"\r\n else:\r\n toggled[i + 1][j] = \"0\"\r\n if j + 1 < 3:\r\n if toggled[i][j + 1] == \"0\":\r\n toggled[i][j + 1] = \"1\"\r\n else:\r\n toggled[i][j + 1] = \"0\"\r\n for i in range(3):\r\n print(\"\".join(toggled[i]))\r\n\r\n\r\ndef main():\r\n matrix = []\r\n for i in range(3):\r\n matrix.append(input().strip().split())\r\n solve(matrix)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = 3\np = [[int(i) for i in input().split()] for _ in range(n)]\nfor r in range(n):\n for c in range(n):\n cnt = p[r][c] + (p[r - 1][c] if r > 0 else 0) + (p[r + 1][c] if r < n - 1 else 0) + (p[r][c - 1] if c > 0 else 0) + (p[r][c + 1] if c < n - 1 else 0)\n print(1- cnt & 1, end=\"\")\n print()\n", "a=[]\nfor i in range(3):\n a.append(list(map(int, input().split())))\n\nb=[[0 for i in range(3)] for i in range(3)]\nb[0][0]=a[0][0]+a[0][1]+a[1][0]\nb[0][1]=a[0][1]+a[0][0]+a[0][2]+a[1][1]\nb[0][2]=a[0][2]+a[0][1]+a[1][2]\nb[1][0]=a[0][0]+a[1][1]+a[1][0]+a[2][0]\nb[1][1]=a[1][1]+a[1][0]+a[2][1]+a[0][1]+a[1][2]\nb[1][2]=a[1][2]+a[0][2]+a[1][1]+a[2][2]\nb[2][0]=a[2][0]+a[1][0]+a[2][1]\nb[2][1]=a[2][1]+a[2][0]+a[1][1]+a[2][2]\nb[2][2]=a[2][2]+a[2][1]+a[1][2]\nfor i in range(3):\n for j in range(3):\n if b[i][j]%2==0:\n print(1, end='')\n else:\n print(0, end='')\n print()\n\n", "x1=input().split()\r\nx2=input().split()\r\nx3=input().split()\r\nx1=[int(i) for i in x1]\r\nx2=[int(i) for i in x2]\r\nx3=[int(i) for i in x3]\r\ns=[0 for i in range(9)]\r\ns[0]+=x1[0]+x1[1]+x2[0]\r\ns[1]+=x1[0]+x1[1]+x1[2]+x2[1]\r\ns[2]+=x1[2]+x1[1]+x2[2]\r\ns[3]+=x1[0]+x2[1]+x2[0]+x3[0]\r\ns[4]+=x1[1]+x2[1]+x3[1]+x2[0]+x2[2]\r\ns[5]+=x1[2]+x2[1]+x2[2]+x3[2]\r\ns[6]+=x2[0]+x3[0]+x3[1]\r\ns[7]+=x3[0]+x3[1]+x3[2]+x2[1]\r\ns[8]+=x3[2]+x3[1]+x2[2]\r\ns1=[]\r\nfor i in s:\r\n if i%2:\r\n s1.append(0)\r\n else:\r\n s1.append(1)\r\n\r\nfor i in range(3):\r\n print(str(s1[3*i])+str(s1[3*i+1])+str(s1[3*i+2]))\r\n", "l = []\r\n\r\nstatus = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\nfor i in range(3):\r\n\tl.append(input().split())\r\n\t\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tl[i][j] = int(l[i][j])\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif l[i][j] % 2 != 0:\r\n\t\t\tstatus[i][j] = status[i][j] ^ 1\r\n\t\t\tif i-1 >= 0:\r\n\t\t\t\tstatus[i-1][j] = status[i-1][j] ^ 1\r\n\t\t\tif j-1 >= 0:\r\n\t\t\t\tstatus[i][j-1] = status[i][j-1] ^ 1\r\n\t\t\tif i+1 <= 2:\r\n\t\t\t\tstatus[i+1][j] = status[i+1][j] ^ 1\r\n\t\t\tif j+1 <= 2:\r\n\t\t\t\tstatus[i][j+1] = status[i][j+1] ^ 1\r\n\r\nfor i in status:\r\n\tfor j in i:\r\n\t\tprint(j, end = '')\r\n\tprint()\r\n", "x=[]\r\nx.append(list(map(int,input().split())))\r\nx.append(list(map(int,input().split())))\r\nx.append(list(map(int,input().split())))\r\nprint(f'{1-(x[0][0]+x[0][1]+x[1][0])%2}{1-(x[0][0]+x[0][1]+x[0][2]+x[1][1])%2}{1-(x[0][1]+x[0][2]+x[1][2])%2}')\r\nprint(f'{1-(x[0][0]+x[1][0]+x[2][0]+x[1][1])%2}{1-(x[1][0]+x[1][1]+x[1][2]+x[0][1]+x[2][1])%2}{1-(x[0][2]+x[1][2]+x[2][2]+x[1][1])%2}')\r\nprint(f'{1-(x[2][0]+x[2][1]+x[1][0])%2}{1-(x[2][0]+x[2][1]+x[2][2]+x[1][1])%2}{1-(x[2][1]+x[2][2]+x[1][2])%2}')\r\n", "dp = [list(map(int, input().split())) for i in range(3)]\r\n\r\na1 = (dp[0][0] + dp[0][1] + dp[1][0]+1)%2\r\na2 = (dp[0][1] + dp[0][0] + dp[0][2] + 1 + dp[1][1])%2\r\na3 = (dp[0][2] + dp[0][1] + dp[1][2] + 1)%2\r\na4 = (dp[1][0] + dp[0][0] + dp[1][1] + 1 + dp[2][0])%2\r\na5 = (dp[1][1] + dp[1][0] + dp[0][1] + 1 + dp[1][2] + dp[2][1])%2\r\na6 = (dp[1][2] + dp[1][1] + dp[0][2] + 1 + dp[2][2])%2\r\na7 = (dp[2][0] + dp[1][0] + dp[2][1] + 1)%2\r\na8 = (dp[2][1] + dp[2][0] + dp[2][2] + 1 + dp[1][1])%2\r\na9 = (dp[2][2] + dp[2][1] + dp[1][2] + 1)%2\r\n \r\n\r\nprint(str(a1)+str(a2)+str(a3))\r\nprint(str(a4)+str(a5)+str(a6))\r\nprint(str(a7)+str(a8)+str(a9))\r\n", "A=[]\r\nfor i in range(3):\r\n arr=list(map(int,input().split()))\r\n A.append(arr)\r\nans=[]\r\nres=[]\r\nfor i in range(3):\r\n \r\n for j in range(3):\r\n sum=A[i][j]\r\n \r\n if i==0:\r\n sum+=A[i+1][j]\r\n if j==0:\r\n sum+=A[i][j+1]\r\n elif j==1:\r\n sum+=A[i][j+1]\r\n sum+=A[i][j-1]\r\n else:\r\n sum+=A[i][j-1]\r\n \r\n \r\n elif i==1:\r\n sum+=A[i-1][j]\r\n sum+=A[i+1][j]\r\n if j==0:\r\n sum+=A[i][j+1]\r\n elif j==1:\r\n sum+=A[i][j-1]\r\n sum+=A[i][j+1]\r\n else:\r\n sum+=A[i][j-1]\r\n\r\n\r\n else:\r\n sum+=A[i-1][j]\r\n if j==0:\r\n sum+=A[i][j+1]\r\n elif j==1:\r\n sum+=A[i][j+1]\r\n sum+=A[i][j-1]\r\n else:\r\n sum+=A[i][j-1]\r\n \r\n\r\n\r\n\r\n if sum%2==0:\r\n res.append(1)\r\n else:\r\n res.append(0)\r\n #print(res)\r\n ans.append(res)\r\n res=[]\r\nfor i in ans:\r\n print(*i,sep='')\r\n", "matrizOriginal = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\ndirecciones = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n\r\nmatriz = []\r\nfor i in range(0, 3):\r\n fila = input().split()\r\n matriz.append(fila)\r\ndef cambiarMismo(i, j):\r\n if matrizOriginal[i][j] == 0:\r\n matrizOriginal[i][j] = 1\r\n else:\r\n matrizOriginal[i][j] = 0\r\ndef cambiarAdyacentes(i, j):\r\n for direccion in direcciones:\r\n if direccion[0] + i in range(0, 3) and direccion[1] + j in range(0, 3):\r\n if matrizOriginal[direccion[0] + i][direccion[1] + j] == 1:\r\n matrizOriginal[direccion[0] + i][direccion[1] + j] = 0\r\n else:\r\n matrizOriginal[direccion[0] + i][direccion[1] + j] = 1\r\n \r\n\r\n \r\n \r\nfor i in range(0, 3):\r\n for j in range(0, 3):\r\n if int(matriz[i][j]) %2 == 1:\r\n cambiarAdyacentes(i, j)\r\n cambiarMismo(i, j)\r\n \r\nlinea1 = str(matrizOriginal[0][0]) + str(matrizOriginal[0][1]) + str(matrizOriginal[0][2])\r\nlinea2 = str(matrizOriginal[1][0]) + str(matrizOriginal[1][1]) + str(matrizOriginal[1][2])\r\nlinea3 = str(matrizOriginal[2][0]) + str(matrizOriginal[2][1]) + str(matrizOriginal[2][2])\r\nprint (linea1)\r\nprint (linea2)\r\nprint (linea3)", "m=[]\r\nfor i in range(3):\r\n l=list(map(int,input().split()))\r\n m.append(l)\r\nfor i in range(3):\r\n for j in range(3):\r\n s=0\r\n #checking row 1st\r\n if (i-1>=0):\r\n #row up\r\n s+=m[i-1][j]\r\n if(i+1<3):\r\n #row down\r\n s+=m[i+1][j]\r\n if(j-1>=0):\r\n #column left\r\n s+=m[i][j-1]\r\n if(j+1<3):\r\n #column right\r\n s+=m[i][j+1]\r\n s+=m[i][j]\r\n if s%2==0:\r\n print(1,end=\"\")\r\n else:\r\n print(0,end=\"\")\r\n print()", "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\na=ll()\r\nb=ll()\r\nc=ll()\r\nk=[a[0]+a[1]+b[0],a[0]+a[1]+a[2]+b[1],a[1]+a[2]+b[2]]\r\n\r\nk1=[a[0]+b[0]+b[1]+c[0],a[1]+c[1]+sum(b),a[2]+c[2]+b[2]+b[1]]\r\nk2=[c[0]+b[0]+c[1],sum(c)+b[1],c[2]+c[1]+b[2]]\r\n\r\nans=k+k1+k2\r\nl=\"\"\r\nfor x in range(9):\r\n\r\n if ans[x]%2==0:\r\n l+=\"1\"\r\n else:\r\n l+=\"0\"\r\n if len(l)==3:\r\n print(l)\r\n l=\"\"", "qlist1 = list(map(int,input().split()))\r\nqlist2 = list(map(int,input().split()))\r\nqlist3 = list(map(int,input().split()))\r\n\r\nalist1 =[1,1,1]\r\nalist2 =[1,1,1]\r\nalist3 =[1,1,1]\r\n\r\ndef bit(i,alist):\r\n if alist[i] == 1:\r\n alist[i] = 0\r\n else:\r\n alist[i] = 1\r\n # print(alist,i)\r\nif qlist1[0]%2!=0:\r\n bit(0,alist1)\r\n bit(0,alist2)\r\n bit(1,alist1)\r\nif qlist1[1]%2!=0:\r\n bit(0,alist1)\r\n bit(1,alist1)\r\n bit(2,alist1)\r\n bit(1,alist2)\r\nif qlist1[2]%2!=0:\r\n bit(2,alist1)\r\n bit(1,alist1)\r\n bit(2,alist2)\r\nif qlist2[0]%2!=0:\r\n bit(0,alist1)\r\n bit(0,alist2)\r\n bit(0,alist3)\r\n bit(1,alist2)\r\nif qlist2[1]%2!=0:\r\n bit(0,alist2)\r\n bit(1,alist2)\r\n bit(2,alist2)\r\n bit(1,alist1)\r\n bit(1,alist3)\r\nif qlist2[2]%2!=0:\r\n bit(2,alist1)\r\n bit(2,alist3)\r\n bit(2,alist2)\r\n bit(1,alist2)\r\nif qlist3[0]%2!=0:\r\n bit(0,alist3)\r\n bit(0,alist2)\r\n bit(1,alist3)\r\nif qlist3[1]%2!=0:\r\n bit(0,alist3)\r\n bit(1,alist3)\r\n bit(2,alist3)\r\n bit(1,alist2)\r\nif qlist3[2]%2!=0:\r\n bit(2,alist3)\r\n bit(1,alist3)\r\n bit(2,alist2)\r\n \r\nprint(str(alist1[0])+str(alist1[1])+str(alist1[2]))\r\nprint(str(alist2[0])+str(alist2[1])+str(alist2[2]))\r\nprint(str(alist3[0])+str(alist3[1])+str(alist3[2]))\r\n", "matrix = []\r\nfor i in range(3):\r\n x = input().split()\r\n for i in range(len(x)):\r\n x[i] = int(x[i])\r\n matrix.append(x)\r\n#atas bawah kanan kiri\r\nmx = [0,0,1,-1]\r\nmy = [1,-1,0,0]\r\nfor y in range(3):\r\n for x in range(3):\r\n sum = matrix[y][x]\r\n for k in range(4):\r\n if(y+my[k]<0 or y+my[k]>2 or x+mx[k]<0 or x+mx[k]>2):\r\n continue\r\n else:\r\n sum+=matrix[y+my[k]][x+mx[k]]\r\n if(sum%2==0):\r\n print(1,end=\"\")\r\n else:\r\n print(0,end=\"\")\r\n print()\r\n\r\n\r\n\r\n", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n \r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef pr(x):\r\n\tprint()\r\n\tfor s in x:\r\n\t\tprint(s)\r\n\r\ndef solve():\r\n\tx = [[1 for _ in range(5)] for _ in range(5)]\r\n\tfor i in range(1,4):\r\n\t\tp = [q for q in map(int,input().split())]\r\n\t\tfor j in range(1,4):\r\n\t\t\tx[i-1][j] += p[j-1]\r\n\t\t\tx[i][j-1] += p[j-1]\r\n\t\t\tx[i][j] += p[j-1]\r\n\t\t\tx[i][j+1] += p[j-1]\r\n\t\t\tx[i+1][j] += p[j-1]\r\n\t\t\t# pr(x)\r\n\tfor i in range(5):\r\n\t\tfor j in range(5):\r\n\t\t\tx[i][j] %= 2\r\n\t# pr(x)\r\n\tfor i in range(1,4):\r\n\t\tprint(''.join([str(q) for q in x[i][1:4]]))\r\n\r\nsolve()", "\r\ngrid = [list(map(int, input().split())) for _ in range(3)]\r\n\r\n\r\nlights = [[1] * 3 for _ in range(3)]\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j] % 2 == 1:\r\n \r\n lights[i][j] = 1 - lights[i][j]\r\n if i > 0:\r\n lights[i - 1][j] = 1 - lights[i - 1][j]\r\n if i < 2:\r\n lights[i + 1][j] = 1 - lights[i + 1][j]\r\n if j > 0:\r\n lights[i][j - 1] = 1 - lights[i][j - 1]\r\n if j < 2:\r\n lights[i][j + 1] = 1 - lights[i][j + 1]\r\n\r\n\r\nfor row in lights:\r\n print(\"\".join(map(str, row)))", "a, b, c = [int(x) for x in input().split()]\r\nd, e, f = [int(x) for x in input().split()]\r\ng, h, i = [int(x) for x in input().split()]\r\n\r\nsa = 1 - ((a + b + d) & 1)\r\nsb = 1 - ((a + b + c + e) & 1)\r\nsc = 1 - ((b + c + f) & 1)\r\nsd = 1 - ((a + d + e + g) & 1)\r\nse = 1 - ((b + d + e + f + h) & 1)\r\nsf = 1 - ((c + e + f + i) & 1)\r\nsg = 1 - ((d + g + h) & 1)\r\nsh = 1 - ((e + g + h + i) & 1)\r\nsi = 1 - ((f + h + i) & 1)\r\n\r\nprint(sa, sb, sc, sep ='')\r\nprint(sd, se, sf, sep ='')\r\nprint(sg, sh, si, sep ='')", "grid = [[0] * 3 for _ in range(3)]\r\n\r\n\r\nfor i in range(3):\r\n row = input().split()\r\n for j in range(3):\r\n num = int(row[j])\r\n\r\n grid[i][j] += num\r\n if i > 0:\r\n grid[i - 1][j] += num\r\n if j > 0:\r\n grid[i][j - 1] += num\r\n if i < 2:\r\n grid[i + 1][j] += num\r\n if j < 2:\r\n grid[i][j + 1] += num\r\n\r\nfor row in grid:\r\n for col in row:\r\n print(1 if col % 2 == 0 else 0, end='')\r\n print()\r\n", "mat=[]\r\nfor i in range(3):\r\n mat.append(list(map(int,input().split())))\r\nfor i in mat:\r\n i.insert(0,0)\r\n i.append(0)\r\nmat.insert(0,[0,0,0,0,0])\r\nmat.append([0,0,0,0,0])\r\nans=[]\r\nfor i in range(1,4):\r\n temp=[]\r\n for j in range(1,4):\r\n temp.append(str(1-(mat[i][j]+mat[i-1][j]+mat[i+1][j]+mat[i][j-1]+mat[i][j+1])%2))\r\n ans.append(temp) \r\nfor i in ans:\r\n print(\"\".join(i))\r\n", "x=3\r\nbuttons=[]\r\nlights = [[1,1,1] for _ in range(3)]\r\nwhile x:\r\n buttonPress=list(map(int,input().split(' ')))\r\n buttons.append(buttonPress)\r\n x-=1\r\nfor l in range(3):\r\n for m in range(3):\r\n lights[l][m]+=buttons[l][m]\r\n if l > 0:\r\n lights[l-1][m]+=buttons[l][m]\r\n if l < 2:\r\n lights[l+1][m]+=buttons[l][m]\r\n if m < 2:\r\n lights[l][m+1]+=buttons[l][m]\r\n if m > 0:\r\n lights[l][m-1]+=buttons[l][m]\r\nfor i in range(3):\r\n for j in range(3):\r\n lights[i][j] = 0 if lights[i][j] %2 == 0 else 1\r\n print(lights[i][j], end='')\r\n print('')", "a=[]\r\nfor i in range(3):\r\n row=list(map(int,input().split()))\r\n a.append(row)\r\ninitial=[[1 for i in range(3)] for j in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]%2==1:\r\n initial[i][j]=1-initial[i][j]\r\n if i>0:\r\n initial[i-1][j]=1-initial[i-1][j]\r\n if i<2:\r\n initial[i+1][j]=1-initial[i+1][j]\r\n if j>0:\r\n initial[i][j-1]=1-initial[i][j-1]\r\n if j<2:\r\n initial[i][j+1]=1-initial[i][j+1]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(initial[i][j],end=\"\")\r\n print()", "light_turners = list()\r\nlight_turners.append([int(x) for x in input().split(\" \")])\r\nlight_turners.append([int(x) for x in input().split(\" \")])\r\nlight_turners.append([int(x) for x in input().split(\" \")])\r\n\r\nlights = [[True, True, True], [True, True, True], [True, True, True]]\r\n\r\n\r\ndef flip_adjacent(i, j):\r\n lights[i][j] = not lights[i][j]\r\n\r\n if i + 1 < 3:\r\n lights[i + 1][j] = not lights[i + 1][j]\r\n\r\n if j + 1 < 3:\r\n lights[i][j + 1] = not lights[i][j + 1]\r\n\r\n if i - 1 > -1:\r\n lights[i - 1][j] = not lights[i - 1][j]\r\n\r\n if j - 1 > - 1:\r\n lights[i][j - 1] = not lights[i][j - 1]\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n while light_turners[i][j] > 0:\r\n flip_adjacent(i, j)\r\n light_turners[i][j] -= 1\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(1 if lights[i][j] else 0, end='')\r\n print('')", "lst = [[0, 0, 0, 0, 0]]\nfor i in range(3):\n a = list(map(int, input().split()))\n lst.append([0] + a + [0])\nlst.append([0, 0, 0, 0, 0])\nfor i in range(1, 4):\n for j in range(1, 4):\n print((1 + lst[i][j] + lst[i-1][j] + lst[i+1][j] + lst[i][j-1] + lst[i][j+1])%2, end = \"\" )\n print()", "def toggle_lights(grid):\r\n result = [[1] * 3 for _ in range(3)] \r\n for i in range(3):\r\n for j in range(3):\r\n presses = grid[i][j]\r\n if presses % 2 == 1:\r\n result[i][j] = 1 - result[i][j] \r\n if i > 0:\r\n result[i - 1][j] = 1 - result[i - 1][j] \r\n if i < 2:\r\n result[i + 1][j] = 1 - result[i + 1][j] \r\n if j > 0:\r\n result[i][j - 1] = 1 - result[i][j - 1] \r\n if j < 2:\r\n result[i][j + 1] = 1 - result[i][j + 1] \r\n\r\n return result\r\ngrid = [list(map(int, input().split())) for _ in range(3)]\r\nresult = toggle_lights(grid)\r\nfor row in result:\r\n print(\"\".join(map(str, row)))\r\n\r\n\r\n\r\n", "a = [0,0,0]\r\nfor i in range(3):\r\n a[i] = list(map(int, input().split()))\r\nb = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if i==0 and j==0:\r\n c = a[i][j] + a[i+1][j] + a[i][j+1]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==0 and j==1:\r\n c = a[i][j] + a[i+1][j] + a[i][j+1] + a[i][j-1]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==0 and j==2:\r\n c = a[i][j] + a[i+1][j] + a[i][j-1]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==1 and j==0:\r\n c = a[i][j] + a[i+1][j] + a[i][j+1] + a[i-1][j]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==1 and j==1:\r\n c = a[i][j] + a[i+1][j] + a[i][j+1] + a[i][j-1] + a[i-1][j]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==1 and j==2:\r\n c = a[i][j] + a[i-1][j] + a[i][j-1] + a[i+1][j]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==2 and j==0:\r\n c = a[i][j] + a[i-1][j] + a[i][j+1]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==2 and j==1:\r\n c = a[i][j] + a[i-1][j] + a[i][j-1] + a[i][j+1]\r\n if c%2==1:\r\n b[i][j]=0\r\n if i==2 and j==2:\r\n c = a[i][j] + a[i-1][j] + a[i][j-1]\r\n if c%2==1:\r\n b[i][j]=0\r\n\r\nfor i in range(3):\r\n x = [str(x) for x in b[i]]\r\n print(\"\".join(x))", "list1=[[int(i) for i in input().split()]for j in range(3)]\r\nlist_data=[[1 for i in range(3)]for j in range(3)]\r\ndata=[(1,0),(-1,0),(0,1),(0,-1)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if list1[i][j]&1:\r\n list_data[i][j]=~(list_data[i][j])\r\n for k in range(4):\r\n data_x,data_y=data[k]\r\n if -1<data_x+i<3 and -1<data_y+j<3:\r\n list_data[data_x+i][data_y+j]=~(list_data[data_x+i][data_y+j])\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if list_data[i][j]==-2:\r\n print(0,end=\"\")\r\n else:\r\n print(1,end=\"\")\r\n print()\r\n", "I_start = [\n [1,1,1],\n [1,1,1],\n [1,1,1],\n]\n\nI = []\n\nfor i in range(3):\n row = list(map(int, input().split()))\n I.append(row)\n\ncorners = { \n (0, 0):((0, 1), (1, 0)),\n (0, 2):((0, 1), (1, 2)),\n (2, 0):((1, 0), (2, 1)),\n (2, 2):((2, 1), (1, 2)),\n}\n\ncentral = {\n (0, 1):((0, 0), (0, 2), (1, 1)),\n (1, 0):((0, 0), (2, 0), (1, 1)),\n (2, 1):((2, 0), (2, 2), (1, 1)),\n (1, 2):((0, 2), (2, 2), (1, 1)),\n}\n\ncenter = {\n (1, 1):((0, 1), (1, 0), (2, 1), (1, 2))\n}\n\ndef click(I_start, coordinate):\n x, y = coordinate\n if I_start[x][y] == 0:\n I_start[x][y] = 1\n return I_start\n I_start[x][y] = 0\n return I_start\n\nfor x, row in enumerate(I):\n for y, col in enumerate(row):\n if I[x][y] != 0:\n count = I[x][y]\n coordinate = (x, y)\n\n for i in range(count):\n if coordinate in corners:\n coords = corners[coordinate]\n elif coordinate in central:\n coords = central[coordinate]\n else:\n coords = center[coordinate]\n\n I_start = click(I_start, coordinate)\n for coord in coords:\n I_start = click(I_start, coord)\n\nrow_one = ''.join(str(elem) for elem in I_start[0])\nrow_two = ''.join(str(elem) for elem in I_start[1])\nrow_three = ''.join(str(elem) for elem in I_start[2])\n\nprint(row_one)\nprint(row_two)\nprint(row_three)", "arr = []\r\nfor i in range(3):\r\n\ta = [int(x) for x in input().split()]\r\n\tarr.append(a)\r\nsm = 0\r\nfor i in range(3):\r\n#\tprint(i)\r\n\tfor j in range(3):\r\n\t\tsm += arr[i][j]\r\n\t\tif (i-1) >= 0:\r\n\t\t\tsm += arr[i-1][j]\r\n\t\tif (i+1) <3:\r\n\t\t\tsm += arr[i+1][j]\r\n\t\tif (j-1) >= 0:\r\n\t\t\tsm += arr[i][j-1]\r\n\t\tif (j+1) <3:\r\n\t\t\tsm += arr[i][j+1]\r\n\t\tif sm%2 == 0:\r\n\t\t\tprint(1, end='')\r\n\t\telse:\r\n\t\t\tprint(0, end='')\r\n\t\tsm = 0\r\n\tprint()", "initial = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\nmat = []\r\nfor i in range(3):\r\n m = list(map(int, input().split()))\r\n mat.append(m)\r\n\r\nfor row in range(3):\r\n for i in range(3):\r\n if mat[row][i] % 2 == 1:\r\n initial[row][i] = int(not (initial[row][i]))\r\n\r\n if row-1 >= 0:\r\n initial[row-1][i] = int(not (initial[row-1][i]))\r\n\r\n if i-1 >= 0:\r\n initial[row][i-1] = int(not (initial[row][i-1]))\r\n\r\n if row+1 < 3:\r\n initial[row+1][i] = int(not (initial[row+1][i]))\r\n\r\n if i+1 < 3:\r\n initial[row][i+1] = int(not (initial[row][i+1]))\r\n\r\nfor i in initial:\r\n print(*i, sep=\"\")\r\n", "# Initialize the 3x3 grid with all lights switched on\r\ngrid = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\n# Read the number of times each light is pressed\r\nfor i in range(3):\r\n row = list(map(int, input().split()))\r\n for j in range(3):\r\n # Toggle the current light and adjacent lights based on the number of presses\r\n if row[j] % 2 == 1:\r\n grid[i][j] = 1 - grid[i][j] # Toggle the current light\r\n if i > 0:\r\n grid[i - 1][j] = 1 - grid[i - 1][j] # Toggle light above\r\n if i < 2:\r\n grid[i + 1][j] = 1 - grid[i + 1][j] # Toggle light below\r\n if j > 0:\r\n grid[i][j - 1] = 1 - grid[i][j - 1] # Toggle light to the left\r\n if j < 2:\r\n grid[i][j + 1] = 1 - grid[i][j + 1] # Toggle light to the right\r\n\r\n# Print the current state of each light\r\nfor i in range(3):\r\n for j in range(3):\r\n print(grid[i][j], end='')\r\n print()\r\n", "def toggle(a,i,j,ans):\r\n r = [-1,0,1,0]\r\n c = [0,-1,0,1]\r\n for k in range(4):\r\n if(i+r[k]>=0 and i+r[k]< 3 and j+c[k]<3 and j+c[k]>=0):\r\n if(ans[i+r[k]][j+c[k]]==1):\r\n ans[i+r[k]][j+c[k]]=0\r\n else:\r\n ans[i+r[k]][j+c[k]]=1\r\n\r\n\r\na = []\r\nfor i in range(3):\r\n b = list(map(int,input().split()))\r\n a.append(b)\r\nans = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if(a[i][j]%2==1):\r\n ans[i][j] = 1-ans[i][j]\r\n toggle(a,i,j,ans)\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(ans[i][j],end=\"\")\r\n print()\r\n", "a=[[0]+list(map(int, input().split()))+[0] for x in range(3)]\r\na=[[0,0,0,0,0]]+a+[[0,0,0,0,0]]\r\ns=\"\"\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n s+=str((a[i][j]+a[i+1][j]+a[i-1][j]+a[i][j-1]+a[i][j+1]+1)%2)\r\n s+=\"\\n\"\r\nprint(s)\r\n \r\n", "def flick(a):\r\n if a==0:\r\n return 1\r\n else:\r\n return 0\r\n\r\nr1=list(map(int,input().rstrip().split()))\r\nr2=list(map(int,input().rstrip().split()))\r\nr3=list(map(int,input().rstrip().split()))\r\n\r\nans=[[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nlst=[r1,r2,r3]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if lst[i][j]%2==1:\r\n ans[i][j]=flick(ans[i][j])\r\n if i<2:\r\n ans[i+1][j]=flick(ans[i+1][j])\r\n if j<2:\r\n ans[i][j+1]=flick(ans[i][j+1])\r\n if i>0:\r\n ans[i-1][j]=flick(ans[i-1][j])\r\n if j>0:\r\n ans[i][j-1]=flick(ans[i][j-1])\r\n\r\nans2=[]\r\nfor i in ans:\r\n nr=[str(j) for j in i]\r\n ans2.append(nr)\r\n\r\nfor i in ans2:\r\n print(''.join(i))", "x,y,z = map(int, input().split())\r\nk,l,m = map(int, input().split())\r\na,b,c = map(int, input().split())\r\n\r\nif (x + y + k) % 2 == 0:\r\n l1 = 1\r\nelse:\r\n l1 = 0\r\n\r\nif (x + y + z + l) % 2 == 0:\r\n l2 = 1\r\nelse:\r\n l2 = 0\r\n\r\nif (z + y + m) % 2 == 0:\r\n l3 = 1\r\nelse:\r\n l3 = 0\r\n\r\nif (x + a + k + l) % 2 == 0:\r\n l4 = 1\r\nelse:\r\n l4 = 0\r\n\r\nif (l + y + k + m + b) % 2 == 0:\r\n l5 = 1\r\nelse:\r\n l5 = 0\r\n\r\nif (z + l + m + c) % 2 == 0:\r\n l6 = 1\r\nelse:\r\n l6 = 0\r\n\r\nif (k + a + b) % 2 == 0:\r\n l7 = 1\r\nelse:\r\n l7 = 0\r\n\r\nif (l + a + b + c) % 2 == 0:\r\n l8 = 1\r\nelse:\r\n l8 = 0\r\n\r\nif (m + b + c) % 2 == 0:\r\n l9 = 1\r\nelse:\r\n l9 = 0\r\n\r\nprint(str(l1)+str(l2)+str(l3))\r\nprint(str(l4)+str(l5)+str(l6))\r\nprint(str(l7)+str(l8)+str(l9))", "def solve():\r\n l = []\r\n for i in range(3):\r\n a= input().split()\r\n l.append([int(a[0])%2,int(a[1])%2,int(a[2])%2])\r\n \r\n m = [[0,0,0],[0,0,0],[0,0,0]]\r\n m[0][0] = l[0][0] +l[0][1] + l[1][0]\r\n m[0][1] = l[0][1] + l[0][0] + l[0][2] + l[1][1]\r\n m[0][2] = l[0][2] + l[0][1] + l[1][2]\r\n m[1][0] = l[1][0] + l[0][0] + l[2][0] + l[1][1]\r\n m[1][1] = l[1][1] + l[1][0] + l[0][1] + l[2][1] + l[1][2]\r\n m[1][2] = l[1][2] + l[1][1] + l[2][2] + l[0][2]\r\n m[2][0] = l[2][0] + l[2][1] + l[1][0]\r\n m[2][1] = l[2][1] + l[2][0] + l[2][2] + l[1][1]\r\n m[2][2] = l[2][2] + l[1][2] + l[2][1]\r\n for i in range(3):\r\n for j in range(3):\r\n if(m[i][j]%2 == 0):\r\n l[i][j] = 1\r\n else:\r\n l[i][j] = 0\r\n for i in l:\r\n for j in i:\r\n print(j,end='')\r\n print()\r\nsolve()", "grid = [[1] * 3, [1] * 3, [1] * 3]\n\n\ndef toggle(i, j):\n grid[i][j] = 0 if grid[i][j] == 1 else 1\n\n\nfor i in range(3):\n inp = input()\n for j, num in enumerate([int(x) for x in inp.split(\" \")]):\n if num % 2 != 0:\n toggle(i, j)\n if i > 0:\n toggle(i - 1, j)\n if i < 2:\n toggle(i + 1, j)\n if j > 0:\n toggle(i, j - 1)\n if j < 2:\n toggle(i, j + 1)\n\nfor row in grid:\n print(\"\".join(map(str, row)))\n", "l1 = input().split()\nl2 = input().split()\nl3 = input().split()\n\nl1 = [int(i) for i in l1]\nl2 = [int(i) for i in l2]\nl3 = [int(i) for i in l3]\n\nm = [l1, l2, l3]\n\nn = [[0,0,0],[0,0,0],[0,0,0]]\np = [['0','0','0'],['0','0','0'],['0','0','0']]\n\n# 0,0\nn[0][0] += m[0][0]\nn[0][1] += m[0][0]\nn[1][0] += m[0][0]\n\n# 0,1\nn[0][0] += m[0][1]\nn[0][1] += m[0][1]\nn[0][2] += m[0][1]\nn[1][1] += m[0][1]\n\n# 0,2\nn[0][2] += m[0][2]\nn[0][1] += m[0][2]\nn[1][2] += m[0][2]\n\n# 1,0\nn[0][0] += m[1][0]\nn[1][0] += m[1][0]\nn[1][1] += m[1][0]\nn[2][0] += m[1][0]\n\n# 1,1\nn[0][1] += m[1][1]\nn[2][1] += m[1][1]\nn[1][2] += m[1][1]\nn[1][0] += m[1][1]\nn[1][1] += m[1][1]\n\n# 1,2\nn[0][2] += m[1][2]\nn[1][1] += m[1][2]\nn[1][2] += m[1][2]\nn[2][2] += m[1][2]\n\n# 2,0\nn[2][0] += m[2][0]\nn[2][1] += m[2][0]\nn[1][0] += m[2][0]\n\n# 2,1\nn[2][0] += m[2][1]\nn[2][1] += m[2][1]\nn[2][2] += m[2][1]\nn[1][1] += m[2][1]\n\n# 2,2\nn[2][2] += m[2][2]\nn[2][1] += m[2][2]\nn[1][2] += m[2][2]\n\nfor i in range(3):\n for j in range (3):\n if(n[i][j] % 2 == 0):\n p[i][j] = '1'\n\nfor i in range(3):\n print(p[i][0] + p[i][1] + p[i][2])\n\n \t\t\t\t \t\t \t\t \t \t \t \t", "lights = [[1 for _ in range(3)] for j in range(3)]\npress = [[int(i) for i in input().split()] for j in range(3)]\n\nfor i, row in enumerate(press):\n for j, n in enumerate(row):\n if n % 2 == 0:\n continue\n\n if i == 0:\n ni = [0, 1]\n elif i == 1:\n ni = [0, 1, 2]\n else:\n ni = [1, 2]\n if j == 0:\n nj = [0, 1]\n elif j == 1:\n nj = [0, 1, 2]\n else:\n nj = [1, 2]\n for a in ni:\n for b in nj:\n if abs(i - a) + abs (j - b) == 2:\n continue\n lights[a][b] = 1 if lights[a][b] == 0 else 0\n\n# print(press)\nans = ''\nfor i in range(3):\n for j in range(3):\n ans += str(lights[i][j])\n if i != 2:\n ans += '\\n'\n\nprint(ans)\n", "chk = [[0]*3 for _ in range(3)]\r\n\r\nl = []\r\n\r\nfor _ in range(3):\r\n j = [int(x) for x in input().split()]\r\n l.append(j)\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n xx = l[i][j]\r\n for x in range(max(0, j-1), min(j+1+1, 3)):\r\n chk[i][x] += xx\r\n for x in range(max(0, i-1), min(i+1+1, 3)):\r\n if x == i:\r\n continue\r\n chk[x][j] += xx\r\n# print(chk)\r\nfor i in chk:\r\n xx = [str((x+1) % 2) for x in i]\r\n print(\"\".join(xx))\r\n", "def t(l):\r\n if l == 0:\r\n l = 1\r\n else:\r\n l = 0\r\n return l\r\nrow1 = [int(x) for x in input().split()]\r\nrow2 = [int(x) for x in input().split()]\r\nrow3 = [int(x) for x in input().split()]\r\nout1 = [1,1,1]\r\nout2 = [1,1,1]\r\nout3 = [1,1,1]\r\nfor i in range(row1[0]):\r\n out1[0] = t(out1[0])\r\n out1[1] = t(out1[1])\r\n out2[0] = t(out2[0])\r\nfor i in range(row1[1]):\r\n out1[1] = t(out1[1])\r\n out1[0] = t(out1[0])\r\n out1[2] = t(out1[2])\r\n out2[1] = t(out2[1])\r\nfor i in range(row1[2]):\r\n out1[2] = t(out1[2])\r\n out1[1] = t(out1[1])\r\n out2[2] = t(out2[2])\r\nfor i in range(row2[0]):\r\n out2[0] = t(out2[0])\r\n out1[0] = t(out1[0])\r\n out2[1] = t(out2[1])\r\n out3[0] = t(out3[0])\r\nfor i in range(row2[1]):\r\n out2[1] = t(out2[1])\r\n out1[1] = t(out1[1])\r\n out2[0] = t(out2[0])\r\n out3[1] = t(out3[1])\r\n out2[2] = t(out2[2])\r\nfor i in range(row2[2]):\r\n out2[2] = t(out2[2])\r\n out1[2] = t(out1[2])\r\n out2[1] = t(out2[1])\r\n out3[2] = t(out3[2])\r\nfor i in range(row3[0]):\r\n out3[0] = t(out3[0])\r\n out2[0] = t(out2[0])\r\n out3[1] = t(out3[1])\r\nfor i in range(row3[1]):\r\n out3[1] = t(out3[1])\r\n out2[1] = t(out2[1])\r\n out3[0] = t(out3[0])\r\n out3[2] = t(out3[2])\r\nfor i in range(row3[2]):\r\n out3[2] = t(out3[2])\r\n out2[2] = t(out2[2])\r\n out3[1] = t(out3[1])\r\nout1 = \"\".join(map(str,out1))\r\nout2 = \"\".join(map(str,out2))\r\nout3 = \"\".join(map(str,out3))\r\nprint(out1)\r\nprint(out2)\r\nprint(out3)", "matrix = [[1 for i in range(5)] for j in range(5)]\r\ntemp = []\r\n\r\nfor i in range(1, 4):\r\n row = [int(i) for i in input().split()]\r\n for j in range(1, 4):\r\n matrix[i][j] = (1 + row[j - 1]) % 2\r\n if matrix[i][j] == 0:\r\n temp.append([i, j])\r\n\r\nfor i, j in temp:\r\n matrix[i + 1][j] = (matrix[i + 1][j] + 1) % 2\r\n matrix[i - 1][j] = (matrix[i - 1][j] + 1) % 2\r\n matrix[i][j + 1] = (matrix[i][j + 1] + 1) % 2\r\n matrix[i][j - 1] = (matrix[i][j - 1] + 1) % 2\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n print(matrix[i][j], end=\"\")\r\n print(\"\")", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\n\r\ndef get_digits(n):\r\n res = set()\r\n for i in str(n):\r\n res.add(i)\r\n return res\r\n\r\ndef main():\r\n table = []\r\n curr_sost = [[0,0,0], [0,0,0], [0,0,0]]\r\n for i in range(3):\r\n table.append(list(map(int, input().split())))\r\n for i in range(3):\r\n for j in range(3):\r\n if i == 0 and j == 0:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i][j+1] += table[i][j]\r\n curr_sost[i+1][j] += table[i][j]\r\n elif i == 0 and j == 2:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i+1][j] += table[i][j]\r\n curr_sost[i][j-1] += table[i][j]\r\n elif i == 2 and j == 0:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i - 1][j] += table[i][j]\r\n curr_sost[i][j + 1] += table[i][j]\r\n elif i == 2 and j == 2:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i - 1][j] += table[i][j]\r\n curr_sost[i][j - 1] += table[i][j]\r\n elif i == 0:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i + 1][j] += table[i][j]\r\n curr_sost[i][j - 1] += table[i][j]\r\n curr_sost[i][j+1] += table[i][j]\r\n elif i == 2:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i - 1][j] += table[i][j]\r\n curr_sost[i][j - 1] += table[i][j]\r\n curr_sost[i][j + 1] += table[i][j]\r\n elif j == 0:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i + 1][j] += table[i][j]\r\n curr_sost[i-1][j] += table[i][j]\r\n curr_sost[i][j + 1] += table[i][j]\r\n elif j == 2:\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i + 1][j] += table[i][j]\r\n curr_sost[i][j - 1] += table[i][j]\r\n curr_sost[i-1][j] += table[i][j]\r\n else:\r\n\r\n curr_sost[i][j] += table[i][j]\r\n curr_sost[i + 1][j] += table[i][j]\r\n curr_sost[i][j - 1] += table[i][j]\r\n curr_sost[i-1][j] += table[i][j]\r\n curr_sost[i][j+1] += table[i][j]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n print(1-(curr_sost[i][j] % 2), end='')\r\n print()\r\nif __name__ == \"__main__\":\r\n main()", "matrix = [\r\n [1,1,1],\r\n [1,1,1],\r\n [1,1,1]\r\n]\r\n\r\ninp = []\r\nfor i in range(3):\r\n inp.append( list(map(int, input().split())) )\r\n\r\nfor row in range(3):\r\n for col in range(3):\r\n if inp[row][col] % 2 == 0:\r\n continue\r\n else:\r\n if row > 0:\r\n matrix[row-1][col] *= -1\r\n if row < 2:\r\n matrix[row+1][col] *= -1\r\n if col < 2:\r\n matrix[row][col+1] *= -1\r\n if col > 0:\r\n matrix[row][col-1] *= -1\r\n matrix[row][col] *= -1\r\n\r\nfor row in matrix:\r\n res = [ 1 if i > 0 else 0 for i in row]\r\n print(''.join(map(str,res)))", "import sys \r\n# sys.stdin = open('input.txt', 'r') \r\n# sys.stdout = open('output.txt', 'w') \r\n \r\n\r\n\r\n# T = int(input())\r\n# for t in range(T):\r\nn=3\r\nmat =[]\r\nfor i in range(n):\r\n t = list(map(int,input().split()))\r\n mat.append(t)\r\nans=[[1 for i in range(3)] for j in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n s=mat[i][j]\r\n if(j-1>=0):\r\n s+=mat[i][j-1]\r\n if(j+1<3):\r\n s+=mat[i][j+1]\r\n if(i-1>=0):\r\n s+=mat[i-1][j]\r\n if(i+1<3):\r\n s+=mat[i+1][j]\r\n # print(i,j,s)\r\n if(s%2!=0):\r\n ans[i][j]=0\r\n \r\nfor i in ans:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()\r\n\r\n", "A=[]\r\nfor i in range(3):\r\n l=list(map(int,input().split()))\r\n A.append(l)\r\nfor i in range(3):\r\n for j in range(3):\r\n x=A[i][j]\r\n if j-1>=0:\r\n x+=A[i][j-1]\r\n if j+1<3:\r\n x+=A[i][j+1]\r\n if i-1>=0:\r\n x+=A[i-1][j]\r\n if i+1<3:\r\n x+=A[i+1][j]\r\n if x%2==0:\r\n print(1,end='')\r\n else:\r\n print(0,end='')\r\n print()\r\n \r\n", "state = [[1,1,1],[1,1,1],[1,1,1]]\nlights = [[int(x) for x in input().split()],[int(x) for x in input().split()],[int(x) for x in input().split()]]\nif lights[0][0]%2!=0:\n state[0][0]=1 if state[0][0]==0 else 0\n state[0][1]=1 if state[0][1]==0 else 0\n state[1][0]=1 if state[1][0]==0 else 0\nif lights[0][1]%2!=0:\n state[0][0]=1 if state[0][0]==0 else 0\n state[0][1]=1 if state[0][1]==0 else 0\n state[1][1]=1 if state[1][1]==0 else 0\n state[0][2]=1 if state[0][2]==0 else 0\nif lights[0][2]%2!=0:\n state[0][2]=1 if state[0][2]==0 else 0\n state[0][1]=1 if state[0][1]==0 else 0\n state[1][2]=1 if state[1][2]==0 else 0\n\n\nif lights[1][0]%2!=0:\n state[1][0]=1 if state[1][0]==0 else 0\n state[0][0]=1 if state[0][0]==0 else 0\n state[2][0]=1 if state[2][0]==0 else 0\n state[1][1]=1 if state[1][1]==0 else 0\nif lights[1][1]%2!=0:\n state[0][1]=1 if state[0][1]==0 else 0\n state[1][1]=1 if state[1][1]==0 else 0\n state[1][0]=1 if state[1][0]==0 else 0\n state[1][2]=1 if state[1][2]==0 else 0\n state[2][1]=1 if state[2][1]==0 else 0\nif lights[1][2]%2!=0:\n state[1][2]=1 if state[1][2]==0 else 0\n state[0][2]=1 if state[0][2]==0 else 0\n state[2][2]=1 if state[2][2]==0 else 0\n state[1][1]=1 if state[1][1]==0 else 0\n\n\nif lights[2][0]%2!=0:\n state[2][0]=1 if state[2][0]==0 else 0\n state[2][1]=1 if state[2][1]==0 else 0\n state[1][0]=1 if state[1][0]==0 else 0\nif lights[2][1]%2!=0:\n state[2][0]=1 if state[2][0]==0 else 0\n state[2][1]=1 if state[2][1]==0 else 0\n state[1][1]=1 if state[1][1]==0 else 0\n state[2][2]=1 if state[2][2]==0 else 0\nif lights[2][2]%2!=0:\n state[2][2]=1 if state[2][2]==0 else 0\n state[2][1]=1 if state[2][1]==0 else 0\n state[1][2]=1 if state[1][2]==0 else 0\n\nprint(''.join(map(str,state[0])))\nprint(''.join(map(str,state[1])))\nprint(''.join(map(str,state[2])))", "input_arr = []\r\n\r\ndef to_int(n):\r\n return int(n)\r\n\r\nfor i in range(0, 3):\r\n input_arr.append(list(map(to_int, input().split(' '))))\r\n\r\ndef cross_search_sum(i, j):\r\n sum = 0\r\n sum += input_arr[i][j]\r\n \r\n if (i + 1) < 3:\r\n sum += input_arr[i + 1][j]\r\n if i > 0:\r\n sum += input_arr[i - 1][j]\r\n if (j + 1) < 3:\r\n sum += input_arr[i][j + 1]\r\n if j > 0:\r\n sum += input_arr[i][j - 1]\r\n \r\n return sum%2 == 0\r\n\r\nstr1 = ''\r\nstr2 = ''\r\nstr3 = ''\r\n\r\nfor i in range(0, 3):\r\n for u in range(0, 3):\r\n if i == 0:\r\n str1 += str(int(cross_search_sum(i, u)))\r\n elif i == 1:\r\n str2 += str(int(cross_search_sum(i, u)))\r\n elif i == 2:\r\n str3 += str(int(cross_search_sum(i, u)))\r\n\r\nprint(str1)\r\nprint(str2)\r\nprint(str3)", "if __name__ == '__main__':\r\n grid = [[1 for j in range(3)] for i in range(3)]\r\n switches = []\r\n for i in range(3):\r\n line = input()\r\n switches.append([int(i) for i in line.split(' ')])\r\n\r\n for switch_row in range(3):\r\n for switch_col in range(3):\r\n if switches[switch_row][switch_col] % 2 == 0:\r\n continue\r\n\r\n grid[switch_row][switch_col] = int(not grid[switch_row][switch_col])\r\n\r\n if switch_row == 0:\r\n grid[switch_row+1][switch_col] = int(not grid[switch_row+1][switch_col])\r\n elif switch_row == 1:\r\n grid[switch_row+1][switch_col] = int(not grid[switch_row+1][switch_col])\r\n grid[switch_row-1][switch_col] = int(not grid[switch_row-1][switch_col])\r\n elif switch_row == 2:\r\n grid[switch_row-1][switch_col] = int(not grid[switch_row-1][switch_col])\r\n\r\n if switch_col == 0:\r\n grid[switch_row][switch_col+1] = int(not grid[switch_row][switch_col+1])\r\n elif switch_col == 1:\r\n grid[switch_row][switch_col+1] = int(not grid[switch_row][switch_col+1])\r\n grid[switch_row][switch_col-1] = int(not grid[switch_row][switch_col-1])\r\n elif switch_col == 2:\r\n grid[switch_row][switch_col-1] = int(not grid[switch_row][switch_col-1])\r\n\r\n print('\\n'.join([''.join(list(map(str, grid[i]))) for i in range(3)]))\r\n", "a=[[1 for i in range(3)]for j in range(3)]\r\nfor i in range(3):\r\n x = list(map(int, input().split(\" \")))\r\n for j in range(3):\r\n if x[j]%2!=0:\r\n a[i][j]+=1\r\n if i-1>-1:a[i-1][j]+=1\r\n if j-1>-1:a[i][j-1]+=1\r\n if j+1<3:a[i][j+1]+=1\r\n if i+1<3:a[i+1][j]+=1\r\nfor i in range(3):\r\n print(*(a[i][j]%2 for j in range(3)),sep=\"\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from copy import deepcopy\r\n\r\ngrid = [[0] * 3 for _ in range(3)]\r\nresult = [[0] * 3 for _ in range(3)]\r\n\r\nfor i in range(3):\r\n grid[i] = list(map(int, input().split()))\r\n\r\nresult = deepcopy(grid)\r\n\r\nresult[0][0] += grid[0][1] + grid[1][0]\r\nresult[0][1] += grid[0][0] + grid[1][1] + grid[0][2]\r\nresult[0][2] += grid[0][1] + grid[1][2]\r\n\r\nresult[1][0] += grid[0][0] + grid[1][1] + grid[2][0]\r\nresult[1][1] += grid[0][1] + grid[1][0] + grid[1][2] + grid[2][1]\r\nresult[1][2] += grid[0][2] + grid[1][1] + grid[2][2]\r\n\r\nresult[2][0] += grid[1][0] + grid[2][1]\r\nresult[2][1] += grid[2][0] + grid[1][1] + grid[2][2]\r\nresult[2][2] += grid[1][2] + grid[2][1]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n result[i][j] = 1 - (result[i][j] % 2)\r\n print(result[i][j], end = \"\")\r\n print()\r\n\r\n\r\n\r\n\r\n", "l=[[int(i) for i in input().split()],[int(i) for i in input().split()],[int(i) for i in input().split()]]\r\nm=[[0,0,0],[0,0,0],[0,0,0]]\r\n\r\nm[0][0]=(l[0][0]+l[1][0]+l[0][1]+1)%2\r\nm[1][0]=(l[1][0]+l[0][0]+l[1][1]+l[2][0]+1)%2\r\nm[2][0]=(l[1][0]+l[2][0]+l[2][1]+1)%2\r\n\r\nm[0][1]=(l[0][1]+l[1][1]+l[0][0]+l[0][2]+1)%2\r\nm[1][1]=(l[1][0]+l[0][1]+l[1][1]+l[1][2]+l[2][1]+1)%2\r\nm[2][1]=(l[2][0]+l[2][1]+l[1][1]+l[2][2]+1)%2\r\n\r\nm[0][2]=(l[0][1]+l[0][2]+l[1][2]+1)%2\r\nm[1][2]=(l[0][2]+l[1][1]+l[1][2]+l[2][2]+1)%2\r\nm[2][2]=(l[1][2]+l[2][1]+l[2][2]+1)%2\r\n\r\nfor i in range(0,3):\r\n print(str(m[i][0])+str(m[i][1])+str(m[i][2]))", "row1 = [int(x) for x in input().split(' ')]\r\nrow2 = [int(x) for x in input().split(' ')]\r\nrow3 = [int(x) for x in input().split(' ')]\r\n\r\nmatrix = [row1, row2, row3]\r\n\r\nsolved = [\r\n [True, True, True, True, True],\r\n [True, True, True, True, True],\r\n [True, True, True, True, True],\r\n [True, True, True, True, True],\r\n [True, True, True, True, True]\r\n]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] % 2 != 0:\r\n solved[i][j+1] = not solved[i][j+1]\r\n solved[i+1][j+1] = not solved[i+1][j+1]\r\n solved[i+1][j] = not solved[i+1][j]\r\n solved[i+1][j+2] = not solved[i+1][j+2]\r\n solved[i+2][j+1] = not solved[i+2][j+1]\r\n else:\r\n continue\r\n\r\nsolved = [solved[1][1:4], solved[2][1:4], solved[3][1:4]]\r\nsolved = [[int(x) for x in solved[0]], [int(x) for x in solved[1]], [int(x) for x in solved[2]]]\r\nsolved = [[str(x) for x in solved[0]], [str(x) for x in solved[1]], [str(x) for x in solved[2]]]\r\nsolved = [''.join(solved[0]), ''.join(solved[1]), ''.join(solved[2])]\r\nsolved = '\\n'.join(solved)\r\n\r\nprint(solved)", "L=[]\r\nL.append(list(map(int,input().split())))\r\nL.append(list(map(int,input().split())))\r\nL.append(list(map(int,input().split())))\r\nL=L[0]+L[1]+L[2]\r\nprint((L[0]+L[1]+L[3]+1)%2,end=\"\")\r\nprint((L[1]+L[0]+L[2]+L[4]+1)%2,end=\"\")\r\nprint((L[2]+L[1]+L[5]+1)%2)\r\nprint((L[0]+L[3]+L[6]+L[4]+1)%2,end=\"\")\r\nprint((L[1]+L[4]+L[7]+L[3]+L[5]+1)%2,end=\"\")\r\nprint((L[2]+L[5]+L[8]+L[4]+1)%2)\r\nprint((L[6]+L[7]+L[3]+1)%2,end=\"\")\r\nprint((L[7]+L[8]+L[6]+L[4]+1)%2,end=\"\")\r\nprint((L[8]+L[7]+L[5]+1)%2)", "l = []\r\nfor _ in range(3):\r\n l.append([int(x) for x in input().split()])\r\ng = [[0,0,0], [0,0,0], [0,0,0]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if i+1 <= 2:\r\n g[i+1][j] += l[i][j]\r\n if i-1 >= 0:\r\n g[i-1][j] += l[i][j]\r\n if j+1 <= 2:\r\n g[i][j+1] += l[i][j]\r\n if j-1 >= 0:\r\n g[i][j-1] += l[i][j]\r\n\r\n g[i][j] += l[i][j] \r\n\r\nans = ''\r\nfor p in range(3):\r\n if p > 0:\r\n ans += '\\n'\r\n for q in range(3):\r\n if g[p][q] % 2 == 0:\r\n ans += '1'\r\n else:\r\n ans += '0'\r\n\r\nprint(ans) ", "arr = []\r\ngame = [[True for i in range(3)] for j in range(3)]\r\nfor _ in range(3):\r\n arr.append(list(map(int, input().split())))\r\nind = []\r\nfor i in range(3):\r\n for j in range(3):\r\n if(arr[i][j] % 2 != 0):\r\n ind.append((i, j))\r\n# print(ind)\r\nfor i, j in ind:\r\n game[i][j] = not game[i][j]\r\n if i + 1 < 3:\r\n game[i+1][j] = not game[i+1][j]\r\n if j + 1 < 3:\r\n game[i][j+1] = not game[i][j+1]\r\n if i - 1 >= 0:\r\n game[i-1][j] = not game[i - 1][j]\r\n if j - 1 >= 0:\r\n game[i][j-1] = not game[i][j - 1]\r\nfor i in game:\r\n for j in i:\r\n print(1 if j == True else 0, end=\"\")\r\n print()\r\n", "l=[]\r\ni=0\r\nwhile i<3 :\r\n l0=list(map(int,input().split()))\r\n l.append(l0)\r\n i+=1\r\n\r\nl=[[0,0,0]]+l+[[0,0,0]]\r\ni=0\r\nwhile i<5 :\r\n l[i]=[0]+l[i]+[0]\r\n i+=1\r\nl1=[[0,0,0],[0,0,0],[0,0,0]]\r\ni=1\r\nwhile i<4 :\r\n j=1\r\n while j<4 :\r\n u=l[i][j]\r\n l[i][j]=l[i-1][j]+l[i+1][j]+l[i][j+1]+l[i][j-1]+l[i][j]\r\n if l[i][j]%2==0 :\r\n l1[i-1][j-1]+=1\r\n l[i][j]=u\r\n j+=1\r\n i+=1\r\ni=0\r\nwhile i<3 :\r\n j=0\r\n while j<3 :\r\n print(l1[i][j],end=\"\")\r\n j+=1\r\n i+=1\r\n print()", "l=[]\nfor i in range(3):\n l.append(list(input().split()))\nm=[[1,1,1],[1,1,1],[1,1,1]]\nif int(l[0][0])%2==1:\n m[0][0]^=1\n m[0][1]^=1\n m[1][0]^=1\nif int(l[0][1])%2==1:\n m[0][0]^=1\n m[1][1]^=1\n m[0][1]^=1\n m[0][2]^=1\nif int(l[0][2])%2==1:\n m[0][2]^=1\n m[0][1]^=1\n m[1][2]^=1\nif int(l[1][0])%2==1:\n m[1][0]^=1\n m[1][1]^=1\n m[0][0]^=1\n m[2][0]^=1\nif int(l[1][1])%2==1:\n m[0][1]^=1\n m[1][0]^=1\n m[1][1]^=1\n m[1][2]^=1\n m[2][1]^=1\nif int(l[1][2])%2==1:\n m[0][2]^=1\n m[1][1]^=1\n m[1][2]^=1\n m[2][2]^=1\nif int(l[2][0])%2==1:\n m[2][0]^=1\n m[2][1]^=1\n m[1][0]^=1\nif int(l[2][1])%2==1:\n m[2][1]^=1\n m[1][1]^=1\n m[2][0]^=1\n m[2][2]^=1\nif int(l[2][2])%2==1:\n m[2][2]^=1\n m[2][1]^=1\n m[1][2]^=1\nfor i in m:\n for j in range(0,3):\n print(i[j],end='')\n print()", "matrix = [list(map(int, input().split())) for _ in range(3)]\r\nstate = [[1] * 3 for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n toggle = matrix[i][j] % 2\r\n if toggle:\r\n state[i][j] ^= 1\r\n if i - 1 >= 0:\r\n state[i - 1][j] ^= 1\r\n if i + 1 < 3:\r\n state[i + 1][j] ^= 1\r\n if j - 1 >= 0:\r\n state[i][j - 1] ^= 1\r\n if j + 1 < 3:\r\n state[i][j + 1] ^= 1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(state[i][j], end=\"\")\r\n print()\r\n", "dim = 3\r\ncol = list()\r\nbulb_matrix = list()\r\n\r\n\r\ndef mark_neighbours(i, j):\r\n if i>=0 and i<=2 and j>=0 and j<=2:\r\n bulb_matrix[i][j] = (bulb_matrix[i][j] + 1) % 2\r\n\r\n\r\ndef call_mark_neighbour(i,j):\r\n mark_neighbours(i,j)\r\n mark_neighbours(i-1,j)\r\n mark_neighbours(i+1,j)\r\n mark_neighbours(i,j+1)\r\n mark_neighbours(i,j-1)\r\n\r\n\r\nfor i in range(3):\r\n row = input().split()\r\n row = [int(i) for i in row]\r\n col.append(row)\r\n bulb_matrix.append([1, 1, 1])\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if col[i][j] % 2 == 1:\r\n call_mark_neighbour(i, j)\r\nfor i in range(3):\r\n print(\"\".join(map(str,bulb_matrix[i])))\r\n", "A= [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=A[0]+A[1]+B[0]\r\na2=A[0]+A[2]+B[1]+A[1]\r\na3=A[2]+A[1]+B[2]\r\nb1=B[0]+A[0]+C[0]+B[1]\r\nb2=B[1]+A[1]+C[1]+B[0]+B[2]\r\nb3=A[2]+B[2]+C[2]+B[1]\r\nc1=C[0]+B[0]+C[1]\r\nc2=C[1]+B[1]+C[0]+C[2]\r\nc3=C[2]+C[1]+B[2]\r\nK=[a1,a2,a3,b1,b2,b3,c1,c2,c3]\r\ni=0\r\nT=[]\r\nwhile i<9:\r\n if K[i]%2==0:\r\n T.append(1)\r\n i+=1\r\n else:\r\n T.append(0)\r\n i+=1\r\nprint(str(T[0])+str(T[1])+str(T[2]))\r\nprint(str(T[3])+str(T[4])+str(T[5]))\r\nprint(str(T[6])+str(T[7])+str(T[8])) ", "a=[[0,*map(int,input().split()),0]for _ in[0]*3]\na=[[0]*5,*a,[0]*5]\ndy=[0,-1,0,0,1]\ndx=[0,0,-1,1,0]\nfor i in range(1,4):\n print(''.join([str(1-sum(a[i+y][j+x] for x,y in zip(dx,dy))%2)for j in range(1,4)]))", "# Read input\r\nlights = []\r\nfor _ in range(3):\r\n lights.append(list(map(int, input().split())))\r\n\r\n# Initialize the 3x3 grid\r\ngrid = [[1] * 3 for _ in range(3)]\r\n\r\n# Iterate through the grid and press each light the correct number of times\r\nfor i in range(3):\r\n for j in range(3):\r\n presses = lights[i][j]\r\n if presses % 2 == 1:\r\n grid[i][j] = 1 - grid[i][j]\r\n if i > 0:\r\n grid[i - 1][j] = 1 - grid[i - 1][j]\r\n if i < 2:\r\n grid[i + 1][j] = 1 - grid[i + 1][j]\r\n if j > 0:\r\n grid[i][j - 1] = 1 - grid[i][j - 1]\r\n if j < 2:\r\n grid[i][j + 1] = 1 - grid[i][j + 1]\r\n\r\n# Print the final state of the lights\r\nfor i in range(3):\r\n print(\"\".join(map(str, grid[i])))\r\n", "movx = [0, 0, -1, 1]\r\nmovy = [1, -1, 0, 0]\r\n\r\n\r\ndef valid(x, y):\r\n\tif 0 <= x < 3 and 0 <= y < 3:\r\n\t\treturn True\r\n\treturn False\r\n\r\n\r\nmat = []\r\nfor i in range(3):\r\n\tmat.append(list(map(int, input().split())))\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tsm = mat[i][j]\r\n\t\tfor k in range(4):\r\n\t\t\tif valid(i + movx[k], j + movy[k]):\r\n\t\t\t\tsm += mat[i + movx[k]][j + movy[k]]\r\n\t\tprint(1 -sm % 2,end='')\r\n\tprint()", "a=[]\r\nfor i in range(3):\r\n\tb=list(map(int,input().split()))\r\n\ta.append(b)\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tr=a[i][j]\r\n\t\tif i-1>=0:\r\n\t\t\tr+=a[i-1][j]\r\n\t\tif i+1<3:\r\n\t\t\tr+=a[i+1][j]\r\n\t\tif j-1>=0:\r\n\t\t\tr+=a[i][j-1]\r\n\t\tif j+1<3:\r\n\t\t\tr+=a[i][j+1]\r\n\t\tif r%2==0:\r\n\t\t\tprint(1,end='')\r\n\t\telse:\r\n\t\t\tprint(0,end='')\r\n\tprint()\r\n", "matrix = []\nfor i in range (3):\n x = [int(i) for i in input().split()]\n matrix.append(x)\n\nnew = [[0,0,0] , [0,0,0] , [0,0,0]]\nfor i in range (3):\n for j in range (3):\n if matrix[i][j] % 2 == 1 :\n new[i][j] += 1\n if i == 0:\n if j == 0:\n new[i][j+1] += 1\n new[i+1][j] += 1\n elif j == 1:\n new[i][j+1] += 1\n new[i+1][j] += 1\n new[i][j-1] += 1\n elif j == 2:\n new[i][j-1] += 1\n new[i+1][j] += 1\n elif i == 1:\n if j == 0:\n new[i][j+1] += 1\n new[i+1][j] += 1\n new[i-1][j] += 1\n elif j == 1:\n new[i][j+1] += 1\n new[i+1][j] += 1\n new[i][j-1] += 1\n new[i-1][j] += 1\n elif j == 2:\n new[i][j-1] += 1\n new[i+1][j] += 1\n new[i-1][j] += 1\n elif i == 2:\n if j == 0:\n new[i-1][j] += 1\n new[i][j+1] += 1\n elif j == 1:\n new[i-1][j] += 1\n new[i][j+1] += 1\n new[i][j-1] += 1\n elif j == 2:\n new[i-1][j] += 1\n new[i][j-1] += 1\n\nfor i in range (3):\n for j in range (3):\n if new[i][j] % 2 == 0:\n print(1,end='')\n else:\n print(0,end='')\n print()\n\t\t \t \t \t \t\t\t \t\t \t\t\t \t \t \t", "m = []\r\nfor i in range(3):\r\n x = list(map(int,input().split()))\r\n m.append(x)\r\nfor i in range(3):\r\n for j in range(3):\r\n sum = 1\r\n sum += m[i][j]\r\n if i > 0:\r\n sum += m[i-1][j]\r\n if i != 2:\r\n sum += m[i+1][j]\r\n if j > 0:\r\n sum += m[i][j-1]\r\n if j!=2:\r\n sum += m[i][j+1]\r\n print(sum%2,end=\"\")\r\n print()", "m = [[1, 1, 1],\r\n [1, 1, 1], \r\n [1, 1, 1]]\r\nl ,l2= [], []\r\n\r\nfor i in range(3):\r\n l1 =list(map(int, input().split()))\r\n l.append(l1)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if (l[i][j] % 2 == 0) or l[i][j]==0:\r\n continue\r\n else:\r\n for i2, j2 in [(i,j),(i-1,j),(i+1,j),(i,j-1),(i,j+1)]:\r\n if 0<=i2<3 and 0<=j2<3 :\r\n m[i2][j2] = 1 - m[i2][j2]\r\ns=[]\r\nfor i in m:\r\n o = ''\r\n for j in i:\r\n o += str(j)\r\n s.append(o)\r\n\r\nfor i in s:\r\n print(i)\r\n\r\n\r\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\ncur=[[\"1\",'1','1'],['1','1','1'],['1','1','1']] ; x1=[1,-1,0,0,0] ; y1=[0,0,-1,1,0]\r\nfor i in range(3):\r\n arr=list(map(int,input().split()))\r\n for j in range(3):\r\n if arr[j]%2==1:\r\n for h in range(5):\r\n x=i+x1[h] ; y=j+y1[h]\r\n if 0<=x<=2 and 0<=y<=2:\r\n if cur[x][y]=='1':\r\n cur[x][y]='0'\r\n else:\r\n cur[x][y]='1'\r\nfor i in cur:\r\n print(\"\".join(i))\r\n\r\n\r\n\r\n\r\n", "import sys,os,io,time\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\ndef main():\r\n mat=[]\r\n n=3\r\n for i in range(n):\r\n mat.append(list(map(int,input().split())))\r\n arr=[]\r\n for i in range(n):\r\n for j in range(n):\r\n res=mat[i][j]\r\n if i+1<n:\r\n res+=mat[i+1][j]\r\n if i-1>=0:\r\n res+=mat[i-1][j]\r\n if j+1<n:\r\n res+=mat[i][j+1]\r\n if j-1>=0:\r\n res+=mat[i][j-1]\r\n arr.append(res)\r\n for i in range(n):\r\n for j in range(n):\r\n if arr[(i*n)+j]%2==0:\r\n print(1,end=\"\")\r\n else:\r\n print(0,end=\"\")\r\n print(\"\")\r\nmain()", "v = []\na = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\n\n\ndef toggle(i, j):\n if i > 2 or j > 2 or i < 0 or j < 0:\n return\n a[i][j] = 1 - a[i][j]\n\n\nfor _ in range(0, 3):\n v.append(list(map(int, input().split())))\nfor i in range(0, 3):\n for j in range(0, 3):\n if v[i][j] % 2 == 1:\n toggle(i, j)\n toggle(i + 1, j)\n toggle(i, j + 1)\n toggle(i - 1, j)\n toggle(i, j - 1)\nfor x in a:\n print(*x, sep='')\n", "x=[]\r\nfor u in range(3):\r\n z=[]\r\n for j in range(3):\r\n z.append(0)\r\n x.append(z)\r\nfor s in range(3):\r\n b=list(map(int,input().split()))\r\n for i in range(3):\r\n x[s][i]+=b[i]\r\n if s-1>=0:\r\n x[s-1][i]+=b[i]\r\n if s+1<3:\r\n x[s+1][i]+=b[i]\r\n if i-1>=0:\r\n x[s][i-1]+=b[i]\r\n if i+1<3:\r\n x[s][i+1]+=b[i]\r\nfor y in range(3):\r\n for z in range(3):\r\n if x[y][z]%2==0:\r\n print(\"1\",end=\"\")\r\n else:\r\n print(\"0\",end=\"\")\r\n print(\"\") ", "a1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nc1, c2, c3 = map(int, input().split())\r\n \r\nx1 = a1 + a2 + b1\r\nx2 = a1 + a2 + a3 + b2\r\nx3 = a2 + a3 + b3\r\ny1 = a1 + b1 + b2 + c1\r\ny2 = a2 + b1 + b2 + b3 + c2\r\ny3 = a3 + b2 + b3 + c3\r\nz1 = b1 + c1 + c2\r\nz2 = b2 + c1 + c2 + c3\r\nz3 = b3 + c2 + c3\r\n \r\nprint(str(abs((x1%2)-1)) + str(abs((x2%2)-1)) + str(abs((x3%2)-1))) \r\nprint(str(abs((y1%2)-1)) + str(abs((y2%2)-1)) + str(abs((y3%2)-1))) \r\nprint(str(abs((z1%2)-1)) + str(abs((z2%2)-1)) + str(abs((z3%2)-1))) ", "r=[[0,0,0,0,0]]\r\nfor _ in range(3):\r\n r.append([0]+list(map(int,input().split()))+[0])\r\nr.append([0,0,0,0,0])\r\nfor i in 1,2,3:\r\n for j in 1,2,3:\r\n print((r[i][j]+r[i][j+1]+r[i+1][j]+r[i-1][j]+r[i][j-1]+1)%2,end=\"\")\r\n print()\r\n", "inp = []\ndef GetNeighbors(x, y, maxx, maxy):\n ret = []\n dx = [-1, 0, 0, 1]\n dy = [0, -1, 1, 0]\n for i in range(4):\n newx = x + dx[i]\n newy = y + dy[i]\n if newx >= 0 and newx < maxx and newy >= 0 and newy < maxy:\n ret.append((newx, newy))\n return ret\nfor i in range(3):\n inp.append(list(map(int,input().strip(\" \").split(\" \"))))\nfor i in range(3):\n row = ''\n for j in range(3):\n toggle_count = inp[i][j] + 1\n for x, y in GetNeighbors(i, j, 3, 3):\n toggle_count += inp[x][y]\n row += str(toggle_count % 2)\n print(row)\n\n\n \t\t\t\t \t\t\t \t \t\t\t \t \t\t\t", "def permitido(l,c):\r\n return l >= 0 and c >= 0 and l <= 2 and c <= 2\r\ndef muda_adjacentes(i,j):\r\n if grid[i][j] == \"0\":\r\n grid[i][j] = \"1\"\r\n else:\r\n grid[i][j] = \"0\"\r\n\r\n for m in range(4):\r\n l_destino = i + mv[m]\r\n c_destino = j + mh[m]\r\n\r\n if permitido(l_destino,c_destino):\r\n\r\n if grid[i + mv[m]][j + mh[m]] == \"0\":\r\n grid[i + mv[m]][j + mh[m]] = \"1\"\r\n\r\n else:\r\n grid[i + mv[m]][j + mh[m]] = \"0\"\r\n\r\n\r\nmv = [1,-1,0,0]\r\nmh = [0,0,1,-1]\r\n\r\napertos = []\r\n\r\nfor i in range(3):\r\n a,b,c = map(int,input().split())\r\n\r\n apertos.append([a,b,c])\r\n\r\ngrid = []\r\nfor i in range(3):\r\n grid.append(list(\"111\"))\r\n\r\nfor L in range(3):\r\n for C in range(3):\r\n if apertos[L][C] != 0:\r\n if apertos[L][C] % 2 != 0:\r\n muda_adjacentes(L,C)\r\n\r\nfor i in range(3):\r\n linha = \"\"\r\n for j in range(3):\r\n linha += grid[i][j]\r\n\r\n print(linha)\r\n", "def lightsOut(arr):\r\n \r\n final = [[0,0,0],[0,0,0],[0,0,0]]\r\n \r\n final[0][0] = 1 if (arr[0][0]+arr[1][0]+arr[0][1])%2 == 0 else 0\r\n final[0][1] = 1 if (arr[0][0]+arr[0][2]+arr[1][1]+arr[0][1])%2 == 0 else 0\r\n final[0][2] = 1 if (arr[0][1]+arr[1][2]+arr[0][2])%2 == 0 else 0\r\n final[1][0] = 1 if (arr[0][0]+arr[1][1]+arr[2][0]+arr[1][0])%2 == 0 else 0\r\n final[1][1] = 1 if (arr[0][1]+arr[1][0]+arr[2][1]+arr[1][2]+arr[1][1])%2 == 0 else 0\r\n final[1][2] = 1 if (arr[0][2]+arr[1][1]+arr[2][2]+arr[1][2])%2 == 0 else 0\r\n final[2][0] = 1 if (arr[2][0]+arr[1][0]+arr[2][1])%2 == 0 else 0\r\n final[2][1] = 1 if (arr[1][1]+arr[2][0]+arr[2][2]+arr[2][1])%2 == 0 else 0\r\n final[2][2] = 1 if (arr[2][1]+arr[2][2]+arr[1][2])%2 == 0 else 0\r\n \r\n return final\r\n \r\n \r\nif __name__ == \"__main__\":\r\n arr = []\r\n n1 = [int(i) for i in input().split()]\r\n n2 = [int(i) for i in input().split()]\r\n n3 = [int(i) for i in input().split()]\r\n \r\n arr.append(n1)\r\n arr.append(n2)\r\n arr.append(n3)\r\n \r\n ans = lightsOut(arr)\r\n for i in ans:\r\n for j in i:\r\n print(j, end='')\r\n print()\r\n \r\n ", "mat = []\r\n\r\nfor i in range(3):\r\n\tmat.append(list(map(int, input().split())))\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tmat[i][j] = (mat[i][j])%2\r\n\r\nans = [[1,1,1],[1,1,1],[1,1,1]]\r\nn=3\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif mat[i][j]!=0:\r\n\t\t\tans[i][j] = not ans[i][j]\r\n\t\t\tif j+1<n:\r\n\t\t\t\tans[i][j+1] = not ans[i][j+1]\r\n\t\t\tif j-1>=0:\r\n\t\t\t\tans[i][j-1] = not ans[i][j-1]\r\n\t\t\tif i+1<n:\r\n\t\t\t\tans[i+1][j] = not ans[i+1][j]\r\n\t\t\tif i-1>=0:\r\n\t\t\t\tans[i-1][j] = not ans[i-1][j]\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif ans[i][j]==False:\r\n\t\t\tans[i][j]=0\r\n\t\tif ans[i][j]==True:\r\n\t\t\tans[i][j]=1\r\n\t\tprint(ans[i][j], end='')\r\n\tprint()\r\n\r\n", "def main():\n m = [['1', '1', '1'] for _ in range(3)]\n l = []\n for n in range(3):\n l.append([int(x) for x in input().split()])\n for i in range(len(l)):\n for j in range(len(l[0])):\n if l[i][j] % 2 == 1:\n helper(m, i, j)\n return m\n\n\ndef helper(m, i, j):\n m[i][j] = '1' if m[i][j] == '0' else '0'\n if i > 0:\n m[i-1][j] = '1' if m[i-1][j] == '0' else '0'\n if j > 0:\n m[i][j-1] = '1' if m[i][j-1] == '0' else '0'\n if j < len(m[0]) - 1:\n m[i][j+1] = '1' if m[i][j+1] == '0' else '0'\n if i < len(m) - 1:\n m[i+1][j] = '1' if m[i+1][j] == '0' else '0'\n return m\n\n\nif __name__ == '__main__':\n result = main()\n for row in result:\n print(''.join(row))\n", "res = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\nfor i in range(3):\r\n ligne = list(map(int, input().split()))\r\n for j in range(3):\r\n if ligne[j]%2==0: continue\r\n \r\n if i > 0:\r\n res[i-1][j] = (1+res[i-1][j])%2\r\n \r\n if i < 2:\r\n res[i+1][j] = (1+res[i+1][j])%2\r\n \r\n if j > 0:res[i][j-1] = (1+res[i][j-1])%2\r\n if j < 2: res[i][j+1] = (1+res[i][j+1])%2\r\n res[i][j] = (1+res[i][j])%2\r\n\r\nfor e in res:\r\n print(\"\".join(map(str, e)))", "def adj(x,y):\r\n lst=[]\r\n lst.append((x,y))\r\n if x-1>=0:\r\n lst.append((x-1,y))\r\n if y-1>=0:\r\n lst.append((x,y-1))\r\n if x+1<=2:\r\n lst.append((x+1,y))\r\n if y+1<=2:\r\n lst.append((x,y+1))\r\n return lst\r\n\r\ninitial=[[1,1,1],[1,1,1],[1,1,1]]\r\nafter_clicks=[]\r\nfor i in range(3):\r\n after_clicks.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n if after_clicks[i][j]%2!=0:\r\n k=adj(i,j)\r\n for x,y in k:\r\n if initial[x][y]==1:\r\n initial[x][y]=0\r\n elif initial[x][y]==0:\r\n initial[x][y]=1\r\nfor i in initial:\r\n for j in i:\r\n print(j,end=\"\")\r\n print(\"\")", "lights=[]\r\nfor i in range(3):\r\n lights.append(list(map(int,input().split())))\r\ninstance=[[(lights[0][0]+lights[0][1]+lights[1][0]+1)%2,(lights[0][0]+lights[0][1]+lights[0][2]+lights[1][1]+1)%2,(lights[0][1]+lights[0][2]+lights[1][2]+1)%2],\r\n [(lights[0][0]+lights[1][1]+lights[1][0]+lights[2][0]+1)%2,(lights[0][1]+lights[1][1]+lights[1][0]+lights[1][2]+lights[2][1]+1)%2,(lights[0][2]+lights[1][1]+lights[1][2]+lights[2][2]+1)%2],\r\n [(lights[1][0]+lights[2][0]+lights[2][1]+1)%2,(lights[2][0]+lights[1][1]+lights[2][1]+lights[2][2]+1)%2,(lights[1][2]+lights[2][1]+lights[2][2]+1)%2]]\r\n\r\nfor i in instance:\r\n print(\"\".join(map(str,i)))", "G = [[1,1,1],[1,1,1],[1,1,1]]\r\nP = []\r\n\r\nfor i in range(3):\r\n row = [int(i) for i in input().split()]\r\n P.append(row)\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if P[i][j]%2==1:\r\n G[i][j]=0 if G[i][j]==1 else 1\r\n if i-1>=0:\r\n G[i-1][j]=0 if G[i-1][j]==1 else 1\r\n if i+1<3:\r\n G[i+1][j]=0 if G[i+1][j]==1 else 1\r\n if j-1>=0:\r\n G[i][j-1]=0 if G[i][j-1]==1 else 1\r\n if j+1<3:\r\n G[i][j+1]=0 if G[i][j+1]==1 else 1\r\n \r\nprint(str(G[0][0])+str(G[0][1])+str(G[0][2]))\r\nprint(str(G[1][0])+str(G[1][1])+str(G[1][2]))\r\nprint(str(G[2][0])+str(G[2][1])+str(G[2][2]))", "inp = []\r\nout = []\r\nfor _ in range(3):\r\n l = list(map(int, input().split()))\r\n inp.append(l)\r\n out.append([0,0,0])\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n ans = inp[i][j]\r\n if i + 1 < 3:\r\n ans += inp[i + 1][j]\r\n if i - 1 > -1:\r\n ans += inp[i - 1][j]\r\n if j + 1 < 3:\r\n ans += inp[i][j + 1]\r\n if j - 1 > -1:\r\n ans += inp[i][j - 1]\r\n if ans == 0:\r\n out[i][j] = 1\r\n elif ans % 2:\r\n out[i][j] = 0\r\n elif ans % 2 == 0:\r\n out[i][j] = 1 \r\n\r\nfor i in range(3):\r\n ans = \"\".join(map(str, out[i]))\r\n print(ans)", "light = []\r\nn = []\r\nfor i in range(3):\r\n n.append(input().split())\r\n light.append([1, 1, 1])\r\n\r\ni = 0\r\nc = 0\r\nfor m in n:\r\n for s in m:\r\n s = int(s)\r\n while s > 0:\r\n for j in range(i - 1, i + 2):\r\n if j >= 0 and j < 3:\r\n if light[j][c] == 0:\r\n light[j][c] = 1\r\n else:\r\n light[j][c] = 0\r\n\r\n for j in range(c - 1, c + 2):\r\n if j >= 0 and j < 3 and j != c:\r\n if light[i][j] == 0:\r\n light[i][j] = 1\r\n else:\r\n light[i][j] = 0\r\n\r\n s -= 1\r\n\r\n if c < 2:\r\n c += 1\r\n else:\r\n c = 0\r\n i += 1\r\n\r\nlit = \"\"\r\nsup = 0\r\n\r\nfor row in light:\r\n for num in row:\r\n lit += str(num)\r\n if sup < 2:\r\n lit += \"\\n\"\r\n sup += 1\r\n \r\nprint(lit)\r\n", "def fun(a,b):\r\n if (a[b[0]][b[1]]+a[b[0]-1][b[1]]+a[b[0]+1][b[1]]+a[b[0]][b[1]+1]+a[b[0]][b[1]-1])%2!=0:\r\n return \"0\"\r\n else:\r\n return \"1\"\r\n\r\na=[[0,0,0,0,0]]\r\nfor i in range(3):\r\n a.append([0]+[int(x) for x in input().split()]+[0])\r\na.append([0,0,0,0,0])\r\nfor i in range(1,len(a)-1):\r\n for j in range(1,4):\r\n print(fun(a,(i,j)),end=\"\")\r\n print(\"\")", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\n#from bisect import bisect_left,bisect_right,insort\r\nimport os\r\n# sys.setrecursionlimit(10000)\r\nindex=[(1,0),(0,1),(-1,0),(0,-1),(0,0)]\r\ninput = sys.stdin.readline\r\ndef solve():\r\n l=[]\r\n for i in range(3):l.append(list(map(int,input().strip().split())))\r\n dp=[[1]*3 for _ in range(3)]\r\n \r\n def get(u,v):\r\n for i,j in index:\r\n \r\n if 0<=i+u<3 and 0<=j+v<3:dp[i+u][j+v]^=1\r\n \r\n\r\n for i in range(3):\r\n for j in range(3):\r\n while l[i][j]:\r\n get(i,j); l[i][j]-=1\r\n for el in dp:print(\"\".join([str(i) for i in el]))\r\n \r\n\r\nif __name__ == '__main__':\r\n# for i in range(int(input())):\r\n solve()\r\n", "f=[]\r\nfor _ in range(3):\r\n f.append(list(map(int,input().split())))\r\nl=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n for j in range(3):\r\n if f[i][j]%2==1:\r\n l[i][j]= not l[i][j]\r\n try:\r\n l[i+1][j]= not l[i+1][j]\r\n except:\r\n pass\r\n try:\r\n if i-1>=0:\r\n l[i-1][j]= not l[i-1][j]\r\n except:\r\n pass\r\n try:\r\n l[i][j+1]= not l[i][j+1]\r\n except:\r\n pass\r\n try:\r\n if j-1>=0:\r\n l[i][j-1]= not l[i][j-1]\r\n except:\r\n pass\r\nfor i in range(3):\r\n for j in range(3):\r\n if l[i][j]:\r\n print(\"1\",end=\"\")\r\n else:\r\n print(\"0\" , end=\"\")\r\n print()", "def fliplights(i, j, lightmatrix):\r\n #vertical neighbouring lights\r\n for v in range(i - 1, i + 2):\r\n if v < 0: continue\r\n if v > 2: break\r\n if lightmatrix[v][j] == 0:\r\n lightmatrix[v][j] = 1\r\n else:\r\n lightmatrix[v][j] = 0\r\n #horizontal neighbouring lights\r\n for h in range(j - 1, j + 2):\r\n if h < 0 or h == j: continue\r\n if h > 2: break\r\n if lightmatrix[i][h] == 0:\r\n lightmatrix[i][h] = 1\r\n else: lightmatrix[i][h] = 0\r\n \r\n return lightmatrix\r\n\r\n\r\ndef main():\r\n lightmatrix = [[1,1,1],[1,1,1],[1,1,1]]\r\n # for i in range(3):\r\n # print(lightmatrix[i])\r\n \r\n switchmatrix = []\r\n for i in range(3):\r\n switchmatrix.append(list(map(int, input().split())))\r\n # print(switchmatrix)\r\n \r\n for i in range(3):\r\n for j in range(3):\r\n if switchmatrix[i][j] != 0 and switchmatrix[i][j]%2 != 0:\r\n fliplights(i, j, lightmatrix)\r\n \r\n for i in range(3):\r\n for j in range(3):\r\n print(lightmatrix[i][j], end = \"\")\r\n print() \r\n \r\nmain()", "def activate(x, y):\r\n if lightgrid[x][y]==0:\r\n lightgrid[x][y] = 1\r\n else:\r\n lightgrid[x][y] = 0\r\n\r\nlightgrid = [[1,1,1],[1,1,1],[1,1,1]]\r\npress = []\r\nfor ip in range(3):\r\n press.append(list(map(int, input().split())))\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(press[i][j]):\r\n activate(i,j)\r\n if i-1>=0:\r\n activate(i-1,j)\r\n if i+1<=2:\r\n activate(i+1,j)\r\n if j-1>=0:\r\n activate(i,j-1)\r\n if j+1<=2:\r\n activate(i,j+1)\r\nfor _ in lightgrid:\r\n for e in _:\r\n print(e, end='')\r\n print()\r\n", "import sys\r\nimport copy\r\n\r\na = [[0] * 5]\r\nfor _ in range(3):\r\n a.append([0, *map(int, sys.stdin.readline().split()), 0])\r\na.append([0] * 5)\r\n\r\nb = copy.deepcopy(a)\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if (a[i][j] + a[i - 1][j] + a[i + 1][j] + a[i][j - 1] + a[i][j + 1]) % 2:\r\n b[i][j] = 0\r\n else:\r\n b[i][j] = 1\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n sys.stdout.write(str(b[i][j]))\r\n sys.stdout.write('\\n')\r\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 switches = []\r\n for i in range(3):\r\n switches.append(read_ints())\r\n\r\n lights = [[1]*3 for i in range(3)]\r\n for i in range(3):\r\n for j in range(3):\r\n switch = switches[i][j]\r\n if switch%2 == 1:\r\n if lights[i][j] == 1:\r\n lights[i][j] = 0\r\n else:\r\n lights[i][j] = 1\r\n\r\n # check top, bottom and left,right boundaries\r\n if i != 0:\r\n if lights[i-1][j] == 1:\r\n lights[i-1][j] = 0\r\n else:\r\n lights[i-1][j] = 1\r\n\r\n if i != 2:\r\n if lights[i+1][j] == 1:\r\n lights[i+1][j] = 0\r\n else:\r\n lights[i+1][j] = 1 \r\n \r\n if j != 0:\r\n if lights[i][j-1] == 1:\r\n lights[i][j-1] = 0\r\n else:\r\n lights[i][j-1] = 1\r\n\r\n if j != 2:\r\n if lights[i][j+1] == 1:\r\n lights[i][j+1] = 0\r\n else:\r\n lights[i][j+1] = 1\r\n\r\n \r\n for i in range(3):\r\n for j in range(3):\r\n print(lights[i][j],end=\"\")\r\n print()\r\n\r\nif __name__ == '__main__':\r\n solve()", "g = []\nfor i in range(3):\n g.append(list(map(int, input().split(' '))))\n\nfor i in range(3):\n for j in range(3):\n g[i][j] %= 2\n\nc = [[1 for i in range(3)] for j in range(3)]\nfor i in range(3):\n for j in range(3):\n if not g[i][j]:\n continue\n\n c[i][j] += g[i][j]\n for dx in range(-1, 2):\n for dy in range(-1, 2):\n if (dx != 0 and dy == 0) or (dx == 0 and dy != 0):\n x = dx + i\n y = dy + j\n if 0 <= x and x < 3 and 0 <= y and y < 3:\n c[x][y] += g[i][j]\n\nfor i in range(3):\n for j in range(3):\n c[i][j] = str(c[i][j] % 2)\n\nfor i in range(3):\n print(''.join(c[i]))\n\n", "orig = [[1,1,1],[1,1,1],[1,1,1]]\r\nli_ = []\r\nfor inp in range(3):\r\n a = input().split(\" \")\r\n for z in range(len(a)):\r\n a[z] = int(a[z])%2\r\n li_.append(a)\r\n \r\n\r\nfor row in range(len(li_)):\r\n for column in range(len(li_[row])):\r\n orig[row][column] += li_[row][column]\r\n if row -1 >= 0:\r\n orig[row][column] += li_[row-1][column]\r\n if column -1 >=0 : \r\n orig[row][column] += li_[row][column-1]\r\n if column +1 <3 :\r\n orig[row][column] += li_[row][column+1]\r\n if row +1 <3 :\r\n orig[row][column] += li_[row+1][column]\r\n \r\n \r\nfor a in range(len(orig)):\r\n for b in range(len(orig[a])):\r\n orig[a][b] = orig[a][b]%2\r\nlist_ = []\r\nfor a in orig:\r\n string = \"\" \r\n for b in a:\r\n string+=str(b)\r\n \r\n list_.append(string)\r\n \r\nfor a in list_:\r\n print(a)", "def process():\r\n arr = []\r\n result = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n \r\n for i in range(3):\r\n row = list(map(int, input().split(' ')))\r\n for j, value in enumerate(row):\r\n value %= 2\r\n if value == 0:\r\n continue\r\n for x, y in [(0, 0), (0, 1), (1, 0), (0, -1), (-1, 0)]:\r\n if 0 <= i + x < 3 and 0 <= j + y < 3:\r\n result[i + x][j + y] ^= 1\r\n \r\n for row in result:\r\n print(''.join(str(r) for r in row))\r\n\r\nprocess()", "matrix = []\r\ninitial = [[1,1,1],[1,1,1],[1,1,1]]\r\nfor rows in range(3):\r\n matrix.append(list(map(int,input().split())))\r\nselect = [1,0]\r\nr = 0\r\nwhile r<3:\r\n c = 0\r\n while c<3:\r\n v = matrix[r][c]\r\n if v&1:\r\n initial[r][c] = select[initial[r][c]]\r\n if r==0 or r==1: # down\r\n initial[r+1][c] = select[initial[r+1][c]]\r\n if c==1 or c == 2: # left\r\n initial[r][c-1] = select[initial[r][c-1]]\r\n if c==0 or c==1: # right\r\n initial[r][c+1] = select[initial[r][c+1]]\r\n if r==1 or r==2: # up\r\n initial[r-1][c] = select[initial[r-1][c]]\r\n c+=1\r\n r+=1\r\nfor m in initial:\r\n for kk in m:\r\n print(kk,end=\"\")\r\n print()", "from functools import lru_cache\r\nfrom collections import defaultdict, deque, Counter\r\nclass Solution:\r\n def lightsOut(self, grid):\r\n # TODO write an algorithm here\r\n answer = [\r\n [1, 1, 1],\r\n [1, 1, 1],\r\n [1, 1, 1],\r\n ]\r\n for i in range(3):\r\n for j in range(3):\r\n if grid[i][j] % 2 == 1:\r\n if answer[i][j] == 1:\r\n answer[i][j] = 0\r\n else:\r\n answer[i][j] = 1\r\n neighbours = [(-1, 0), (1, 0), (0, -1), (0, 1)]\r\n for index in neighbours:\r\n current = (i+index[0], j+index[1])\r\n if current[0] >= 0 and current[0] < 3 and current[1] >= 0 and current[1] < 3:\r\n if answer[current[0]][current[1]] == 1:\r\n answer[current[0]][current[1]] = 0\r\n else:\r\n answer[current[0]][current[1]] = 1\r\n \r\n string_answer = []\r\n for ans in answer:\r\n string_answer.append(\"\".join([str(num) for num in ans]))\r\n \r\n return string_answer\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n grid = []\r\n for _ in range(3):\r\n array = list(map(int, input().split()))\r\n grid.append(array)\r\n result = solution.lightsOut(grid)\r\n for res in result:\r\n print(res)", "\"\"\"\nசெயல் பேசும் ஆழம் இங்கே சொற்கள் பேசுமா?\n\nFocus, Determination and Sheer-Will\n\nThe woods are lovely, dark and deep,\nBut I have promises to keep,\nAnd miles to go before I sleep,\nAnd miles to go before I sleep.\n\"\"\"\n\nimport os, sys, math, cmath, time, collections\nfrom collections import deque, Counter, OrderedDict, defaultdict\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\nfrom math import ceil, floor, log, log2, sqrt, gcd, factorial, pow, pi\nfrom bisect import bisect_left, bisect_right\nfrom functools import reduce\n\n\n# SOME GENERAL HELPER\ndef input_as_array():\n return list(map(int, input().split()))\n\n\ndef debug():\n if os.path.exists(\"data.in\"):\n print(\"*\" * 10)\n\n\ndef debug3():\n if os.path.exists(\"data.in\"):\n print(\"-\" * 10)\n\n\ndef debug2(value):\n if os.path.exists(\"data.in\"):\n print(value)\n\n\nstart_time = time.time()\n\n\ndef neighbours(r, c, R=3, C=3):\n for rows, cols in ((r - 1, c), (r, c - 1), (r + 1, c), (r, c + 1)):\n if 0 <= rows < R and 0 <= cols < C:\n yield rows, cols\n\n\ndef solve(A):\n G = [[1, 1, 1],[1, 1, 1], [1, 1, 1]]\n for i in range(3):\n for j in range(3):\n if A[i][j] % 2:\n G[i][j] ^= 1\n for nr, nc in neighbours(i, j):\n G[nr][nc] ^= 1\n\n for i in range(3):\n print(''.join(str(c) for c in G[i]))\n\ndef main():\n A = []\n for i in range(3):\n r = input_as_array()\n A.append(r)\n solve(A)\n debug()\n\n\nif __name__ == \"__main__\":\n if os.path.exists(\"data.in\"):\n sys.stdin = open(\"data.in\", \"r\")\n sys.stdout = open(\"data.out\", \"w\")\n\n testcases = 1\n for i in range(testcases):\n main()\n\n # If it's local - Print this O/P\n if os.path.exists(\"data.in\"):\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\n sys.stdout.close()", "lights = []\r\nfor i in range(3):\r\n lights.append(list(map(int, input().split())))\r\n\r\ndef updateState(i, j):\r\n output[i][j] = int(not output[i][j])\r\n\r\noutput = [[1 for i in range(3)] for i in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if lights[i][j] != 0 and lights[i][j] % 2:\r\n output[i][j] = int(not output[i][j])\r\n if i == 0:\r\n updateState(i+1, j)\r\n if j == 0:\r\n updateState(i, j+1)\r\n elif j == 1:\r\n updateState(i, j-1)\r\n updateState(i, j+1)\r\n else:\r\n updateState(i, j-1)\r\n \r\n elif i == 1:\r\n updateState(i-1, j)\r\n updateState(i+1, j)\r\n if j == 0:\r\n updateState(i, j+1)\r\n elif j == 1:\r\n updateState(i, j-1)\r\n updateState(i, j+1)\r\n else:\r\n updateState(i, j-1)\r\n else:\r\n updateState(i-1, j)\r\n if j == 0:\r\n updateState(i, j+1)\r\n elif j == 1:\r\n updateState(i, j-1)\r\n updateState(i, j+1)\r\n else:\r\n updateState(i, j-1)\r\n\r\nfor i in range(3):\r\n print(''.join([str(j) for j in output[i]]))\r\n \r\n\r\n\r\n ", "a = [[1]*3 for i in range(3)]\r\nb = [[int(i) for i in input().split()] for j in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if b[i][j] % 2 == 1:\r\n a[i][j] = 1 - a[i][j]\r\n if i > 0:\r\n a[i-1][j] = 1 - a[i-1][j]\r\n if j > 0:\r\n a[i][j-1] = 1 - a[i][j-1]\r\n if i < 2:\r\n a[i+1][j] = 1 - a[i+1][j]\r\n if j < 2:\r\n a[i][j+1] = 1 - a[i][j+1]\r\nfor i in range(3):\r\n print(''.join(map(str,a[i])))", "grid = [list(map(int, input().split())) for _ in range(3)]\r\n\r\n# Initialize a 3x3 matrix to represent the grid\r\nlights = [[1] * 3 for _ in range(3)]\r\n\r\n# Function to toggle a light and its adjacent lights\r\ndef toggle_light(i, j):\r\n for x, y in [(i, j), (i - 1, j), (i + 1, j), (i, j - 1), (i, j + 1)]:\r\n if 0 <= x < 3 and 0 <= y < 3:\r\n lights[x][y] = 1 - lights[x][y]\r\n\r\n# Iterate through each cell in the grid and toggle lights accordingly\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j] % 2 == 1:\r\n toggle_light(i, j)\r\n\r\n# Print the final state of the lights\r\nfor i in range(3):\r\n print(\"\".join(map(str, lights[i])))\r\n", "n = 3\narr = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\narr2 = []\nfor i in range(n):\n arr2.append([int(i) for i in input().split()])\nfor i in range(n):\n for j in range(n):\n if arr2[i][j] % 2 == 1:\n if arr[i][j] == 1:\n arr[i][j] = 0\n else:\n arr[i][j] = 1\n if j + 1 < n:\n if arr[i][j+1] == 0:\n arr[i][j+1] = 1\n else:\n arr[i][j+1] = 0\n if j - 1 >= 0:\n if arr[i][j - 1] == 0:\n arr[i][j - 1] = 1\n else:\n arr[i][j - 1] = 0\n if i + 1 < n:\n if arr[i+1][j] == 0:\n arr[i+1][j] = 1\n else:\n arr[i+1][j] = 0\n if i - 1 >= 0:\n if arr[i-1][j] == 0:\n arr[i-1][j] = 1\n else:\n arr[i-1][j] = 0\nfor i in range(n):\n for j in range(n):\n print(arr[i][j], end='')\n print()\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 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 ans = [ [1,1,1], [1,1,1], [1,1,1] ]\r\n M = []\r\n for s in wtf:\r\n M.append([x for x in map(int, s.split())])\r\n for i in range(3):\r\n for j in range(3):\r\n z = M[i][j]\r\n if z > 0 and z%2 != 0:\r\n ans[i][j] = 1 - ans[i][j]\r\n if j-1 >= 0:\r\n ans[i][j-1] = 1 - ans[i][j-1]\r\n if j+1 < 3:\r\n ans[i][j+1] = 1 - ans[i][j+1]\r\n if i-1 >= 0:\r\n ans[i-1][j] = 1 - ans[i-1][j]\r\n if i+1 < 3:\r\n ans[i+1][j] = 1 - ans[i+1][j]\r\n for i in range(3):\r\n print(''.join(map(str,ans[i])))\r\n", "# Codeforces A. Lights Out\r\n# Created by Abdulrahman Elsayed on 13/01/2021\r\n\r\ndef to_int(lis):\r\n for i in range(len(lis)):\r\n lis[i] = int(lis[i])\r\n return lis \r\n\r\nr1 = input().split()\r\nr2 = input().split()\r\nr3 = input().split()\r\nr1 = to_int(r1)\r\nr2 = to_int(r2)\r\nr3 = to_int(r3)\r\nr = [r1, r2, r3]\r\n\r\ngrid = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\nfor i in range(len(r)):\r\n for j in range(len(r)):\r\n t = r[i][j]\r\n if ((i + 1) < 3):\r\n t += r[i + 1][j]\r\n if ((i - 1) >= 0):\r\n t += r[i - 1][j]\r\n if ((j + 1) < 3):\r\n t += r[i][j + 1]\r\n if ((j - 1) >= 0):\r\n t += r[i][j - 1] \r\n if ((t % 2) != 0):\r\n if (grid[i][j] == 1):\r\n grid[i][j] = 0\r\n else:\r\n grid[i][j] = 1\r\n \r\nfor row in grid:\r\n for e in row:\r\n print(e, end='')\r\n print('') ", "initial = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nmatrix = []\r\nfor j in range(3):\r\n\trow = [i for i in map(int, input().split())]\r\n\tmatrix.append(row)\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif matrix[i][j] % 2 == 1:\r\n\t\t\tinitial[i][j] = abs(initial[i][j] - 1)\r\n\t\t\tif i-1 >= 0:\r\n\t\t\t\tinitial[i-1][j] = abs(initial[i-1][j] - 1)\r\n\t\t\tif j-1 >= 0:\r\n\t\t\t\tinitial[i][j-1] = abs(initial[i][j-1] - 1)\r\n\t\t\tif i+1 < 3:\r\n\t\t\t\tinitial[i+1][j] = abs(initial[i+1][j] - 1)\r\n\t\t\tif j+1 < 3:\r\n\t\t\t\tinitial[i][j+1] = abs(initial[i][j+1] - 1)\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tprint(initial[i][j],end=\"\")\r\n\tprint(\"\\n\",end=\"\")", "grid = [list(map(int, input().split())) for i in range(3)]\r\nans = [[1] * 3 for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n tot = grid[i][j]\r\n if i > 0:\r\n tot += grid[i - 1][j]\r\n if i < 2:\r\n tot += grid[i + 1][j]\r\n if j > 0:\r\n tot += grid[i][j - 1]\r\n if j < 2:\r\n tot += grid[i][j + 1]\r\n if tot % 2 == 1:\r\n ans[i][j] = 0\r\nfor i in ans:\r\n for j in i:\r\n print(j, end = '')\r\n print()\r\n", "arr=[\r\n [0,0,0,0,0],\r\n [0,1,1,1,0],\r\n [0,1,1,1,0],\r\n [0,1,1,1,0],\r\n [0,0,0,0,0]\r\n]\r\ninp_arr=[ list(map(int,input().split()))for j in range(3)]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n\r\n if inp_arr[i-1][j-1]%2!=0:\r\n\r\n arr[i-1][j],arr[i+1][j],arr[i][j-1],arr[i][j+1],arr[i][j]=int(not arr[i-1][j]),int(not arr[i+1][j]),int(not arr[i][j-1]),int(not arr[i][j+1]),int(not arr[i][j])\r\n\r\nfor i in arr[1:4]:\r\n print(f\"{i[1]}{i[2]}{i[3]}\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a,b=[],[]\r\n\r\ndef check(value):\r\n if value=='1':\r\n return '0'\r\n else:\r\n return '1' \r\n\r\nfor i in range(3):\r\n temp=list(input().split())\r\n a.append(temp)\r\n b.append(['1','1','1'])\r\nfor i in range(3):\r\n for j in range(3):\r\n if int(a[i][j])%2==0:\r\n continue\r\n else:\r\n b[i][j]=check(b[i][j])\r\n if i-1>=0:\r\n b[i-1][j]=check(b[i-1][j])\r\n if i+1<3:\r\n b[i+1][j]=check(b[i+1][j])\r\n if j+1<3:\r\n b[i][j+1]=check(b[i][j+1])\r\n if j-1>=0:\r\n b[i][j-1]=check(b[i][j-1])\r\nfor i in range(3):\r\n print(''.join(b[i]))", "if __name__ == '__main__':\n s = []\n for _ in range(0,3):\n s.append(list(map(int,input().rstrip().split())))\n res = []\n res.append([1,1,1])\n res.append([1,1,1])\n res.append([1,1,1])\n\n for i in range(0,3):\n for j in range(0,3):\n c = 0\n while c<s[i][j]:\n if res[i][j]==0:\n res[i][j]=1\n elif res[i][j]==1:\n res[i][j]=0\n if i>0:\n if res[i-1][j]==0:\n res[i-1][j]=1\n elif res[i-1][j]==1:\n res[i-1][j]=0\n if j<2:\n if res[i][j+1]==0:\n res[i][j+1]=1\n elif res[i][j+1]==1:\n res[i][j+1]=0\n if i<2:\n if res[i+1][j]==0:\n res[i+1][j]=1\n elif res[i+1][j]==1:\n res[i+1][j]=0\n if j>0:\n if res[i][j-1]==0:\n res[i][j-1]=1\n elif res[i][j-1]==1:\n res[i][j-1]=0\n c+=1\n\n a = (str(res[0][0])+str(res[0][1])+str(res[0][2]))\n print(a)\n print(str(res[1][0])+str(res[1][1])+str(res[1][2]))\n print(str(res[2][0])+str(res[2][1])+str(res[2][2]))", "import math as mt\nimport sys, string\nfrom collections import Counter, defaultdict\ninput = sys.stdin.readline\n\n# input functions\nI = lambda : int(input())\nM = lambda : map(int, input().split())\nARR = lambda: list(map(int, input().split()))\n\ndef main():\n mat = []\n grid = []\n for _ in range(3):\n mat.append(ARR())\n grid.append([1] * 3)\n \n for i in range(3):\n for j in range(3):\n if mat[i][j] % 2:\n grid[i][j] = not grid[i][j]\n if i - 1 >= 0:\n grid[i-1][j] = not grid[i-1][j]\n if i + 1 < 3:\n grid[i + 1][j] = not grid[i + 1][j]\n if j - 1 >= 0:\n grid[i][j - 1] = not grid[i][j - 1]\n if j + 1 < 3:\n grid[i][j + 1] = not grid[i][j + 1]\n \n for i in range(3):\n for j in range(3):\n print(int(grid[i][j]), end=\"\")\n print()\n\nmain()", "lis = []\r\nfor _ in range(3):\r\n lis.append(list(map(int, input().split())))\r\nout = [[1] * 3 for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if lis[i][j]%2==1:\r\n out[i][j]^=1\r\n if j+1<3:\r\n out[i][j+1]^=1\r\n if i+1<3:\r\n out[i+1][j]^=1\r\n if i-1>=0:\r\n out[i-1][j]^=1\r\n if j-1>=0:\r\n out[i][j-1]^=1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(out[i][j], end=\"\")\r\n print()", "bulbs=[]\r\nfor i in range(3):\r\n bulbs.append([1]*3)\r\narr=[]\r\nfor i in range(3):\r\n arr.append([int(x) for x in input().split()])\r\nfor i in range(3):\r\n for j in range(3):\r\n c=arr[i][j]\r\n if i+1<3:\r\n c+=arr[i+1][j]\r\n if j+1<3:\r\n c+=arr[i][j+1]\r\n if i-1>=0:\r\n c+=arr[i-1][j]\r\n if j-1>=0:\r\n c+=arr[i][j-1]\r\n if c%2!=0:\r\n bulbs[i][j]=0\r\nfor i in bulbs:\r\n for j in i:\r\n print(j,end='')\r\n print()\r\n \r\n \r\n", "def main():\r\n arr = [[1, 1, 1] for _ in range(3)]\r\n modifcation_arr = [list(map(int, input().split())) for _ in range(3)]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n times = modifcation_arr[i][j] % 2\r\n if times == 1:\r\n arr[i][j] = 1 - arr[i][j]\r\n if i > 0:\r\n arr[i - 1][j] = 1 - arr[i - 1][j]\r\n if i < 2:\r\n arr[i + 1][j] = 1 - arr[i + 1][j]\r\n if j > 0:\r\n arr[i][j - 1] = 1 - arr[i][j - 1]\r\n if j < 2:\r\n arr[i][j + 1] = 1 - arr[i][j + 1]\r\n \r\n for element in arr:\r\n for element2 in element:\r\n print(element2, end=\"\")\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\n\r\ninital = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n\r\nd = [a, b, c]\r\n\r\ndef change(inital, i, j):\r\n if inital[i][j] == 0:\r\n inital[i][j] = 1\r\n else:\r\n inital[i][j] = 0\r\n\r\n if i-1>= 0:\r\n if inital[i-1][j] == 0:\r\n inital[i-1][j] = 1\r\n else:\r\n inital[i-1][j] = 0\r\n\r\n if i+1<= 2:\r\n if inital[i+1][j] == 0:\r\n inital[i+1][j] = 1\r\n else:\r\n inital[i+1][j] = 0\r\n\r\n if j+1<=2:\r\n if inital[i][j+1] == 0:\r\n inital[i][j+1] = 1\r\n else:\r\n inital[i][j+1] = 0\r\n if j-1>=0:\r\n if inital[i][j-1] == 0:\r\n inital[i][j-1] = 1\r\n else:\r\n inital[i][j-1] = 0\r\n\r\n return inital\r\n\r\n\r\n\r\nfor i in range(len(d)):\r\n for j in range(len(d[i])):\r\n if d[i][j] == 0:\r\n continue\r\n else:\r\n if d[i][j] %2==0:\r\n continue\r\n\r\n else:\r\n inital = change(inital, i, j)\r\n\r\nfor i in range(len(inital)):\r\n for j in range(len(inital[i])):\r\n print(inital[i][j], end = \"\")\r\n print()\r\n\r\n\r\n\r\n", "res=[]\r\nfor i in range(3):\r\n res.append([True,True,True])\r\nmat=[]\r\n\r\nfor i in range(3):\r\n mat.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n if mat[i][j]%2!=0:\r\n res[i][j]=not res[i][j]\r\n if i!=0:\r\n res[i-1][j]=not res[i-1][j]\r\n if j!=0:\r\n res[i][j-1]=not res[i][j-1]\r\n if i!=2:\r\n res[i+1][j]=not res[i+1][j]\r\n if j!=2:\r\n res[i][j+1]=not res[i][j+1]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if res[i][j]:print(\"1\",end=\"\")\r\n else:print(\"0\",end=\"\")\r\n print()\r\n ", "\r\nimport sys\r\n\r\n# odd == on, even == off\r\ninitialGrid = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nfor row in range(3):\r\n line = sys.stdin.readline().strip().split()\r\n for i in range(3):\r\n if int(line[i]) != 0:\r\n initialGrid[row][i] += int(line[i])\r\n if i > 0:\r\n initialGrid[row][i - 1] += int(line[i])\r\n if i < 2:\r\n initialGrid[row][i + 1] += int(line[i])\r\n if row > 0:\r\n initialGrid[row - 1][i] += int(line[i])\r\n if row < 2:\r\n initialGrid[row + 1][i] += int(line[i])\r\n\r\nfor r in range(3):\r\n for c in range(3):\r\n if initialGrid[r][c] % 2:\r\n print(\"1\", end='')\r\n else:\r\n print(\"0\", end='')\r\n print()\r\n ", "# Bismillah\r\n# In the name of GOD\r\n\r\ngrid = [[0, 0, 0, 0, 0]]\r\ngrid.append([0] + list(map(int, input().split())) + [0])\r\ngrid.append([0] + list(map(int, input().split())) + [0])\r\ngrid.append([0] + list(map(int, input().split())) + [0])\r\ngrid.append([0, 0, 0, 0, 0])\r\nfor i in range(1, 4):\r\n\tfor j in range(1, 4):\r\n\t\tif grid[i][j] % 2:\r\n\t\t\tgrid[i][j] = 1\r\n\t\telse:\r\n\t\t\tgrid[i][j] = 0\r\ng = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tg[i][j] = grid[i + 1][j] + grid[i][j + 1] + grid[i + 1][j + 2] + grid[i + 2][j + 1] + grid[i + 1][j + 1]\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif g[i][j] % 2:\r\n\t\t\tg[i][j] = 1\r\n\t\telse:\r\n\t\t\tg[i][j] = 0\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tprint(0 if g[i][j] == 1 else 1, end='')\r\n\tprint()\r\n", "from copy import deepcopy\r\nlst = [list(map(int, input().split())) for _ in range(3)]\r\nlst2 = deepcopy(lst)\r\nfor y in range(3):\r\n for x in range(3):\r\n if y != 2: lst2[y][x] += lst[y+1][x]\r\n if x != 2: lst2[y][x] += lst[y][x+1]\r\n if y != 0: lst2[y][x] += lst[y-1][x]\r\n if x != 0: lst2[y][x] += lst[y][x-1]\r\n print(''.join(map(lambda x: str((x+1)%2), lst2[y])))", "def turn(n):\r\n return 0 if n == 1 else 1\r\n\r\ndef func(matrix):\r\n i = 0\r\n j = 0\r\n ans = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n for i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] % 2 != 0:\r\n ans[i][j] = turn(ans[i][j])\r\n if i != 2:\r\n ans[i + 1][j] = turn(ans[i + 1][j])\r\n if j != 2:\r\n ans[i][j + 1] = turn(ans[i][j + 1])\r\n if i != 0:\r\n ans[i - 1][j] = turn(ans[i - 1][j])\r\n if j != 0:\r\n ans[i][j - 1] = turn(ans[i][j - 1])\r\n return ans\r\n\r\ndef print2D(matrix):\r\n for row in matrix:\r\n print(*row, sep = '')\r\n\r\nmatrix = [list(map(int, input().split())) for i in range(3)]\r\nprint2D(func(matrix))\r\n", "def is_valid(i, j):\r\n if 0 <= i < 3 and 0 <= j < 3:\r\n return True\r\n return False\r\n\r\n\r\ngrid = []\r\nfor _ in range(3):\r\n row = list(map(int, input().split()))\r\n grid.append(row)\r\noutput = [[0] * 3 for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n neighbour_sum = grid[i][j]\r\n for k in range(-1, 2):\r\n for l in range(-1, 2):\r\n if k != l and (k == 0 or l == 0) and is_valid(i + k, j + l):\r\n neighbour_sum += grid[i + k][j + l]\r\n if neighbour_sum % 2 == 0:\r\n output[i][j] = 1\r\n else:\r\n output[i][j] = 0\r\nfor i in output:\r\n print(*i, sep='')", "mat=[]\r\nfor _ in range(3):\r\n arr=list(map(int,(input().split())))\r\n mat.append(arr)\r\n \r\nlights=[[1]*3 for _ in range(3)]\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n x=mat[i][j]\r\n x+=mat[i-1][j] if i-1>=0 else 0\r\n x+=mat[i+1][j] if i+1<3 else 0\r\n x+=mat[i][j-1] if j-1>=0 else 0\r\n x+=mat[i][j+1] if j+1<3 else 0\r\n \r\n if x%2==0:\r\n continue\r\n else:\r\n lights[i][j]=0\r\nfor i in lights:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()", "def show(l):\r\n\t\r\n\tfor i in range(3):\r\n\t\trow = \"\"\r\n\t\tfor j in range(3):\r\n\t\t\trow+=str(l[i][j])\r\n\t\tprint(row)\r\n\r\n\r\n\r\ndef change(l,i,j):\r\n\tif l[i][j] == 1:\r\n\t\tl[i][j] = 0\r\n\telse:\r\n\t\tl[i][j] = 1\r\n\r\n\r\ndef all01(matrix):\r\n\tfor i in range(3):\r\n\t\tfor j in range(3):\r\n\r\n\t\t\tif matrix[i][j]%2 == 0:\r\n\t\t\t\tmatrix[i][j] = 0\r\n\t\t\telse:\r\n\t\t\t\tmatrix[i][j] = 1\r\n\r\n\treturn matrix\r\n\r\n\r\n\r\nmain_matrix = []\r\nfor _ in range(3):\r\n\trow = [int(x) for x in input().split()]\r\n\tmain_matrix.append(row)\r\n\r\nmain_matrix = all01(main_matrix) \r\nindice_change = []\r\n\r\nnumpy = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\r\n\t\tif main_matrix[i][j] == 1:\r\n\t\t\tindice_change.append([i,j])\r\n\t\t\tif (i+1 < 3):\r\n\t\t\t\tindice_change.append([i+1,j])\r\n\t\t\tif (i-1 > -1):\r\n\t\t\t\tindice_change.append([i-1,j])\r\n\t\t\tif (j+1 < 3):\r\n\t\t\t\tindice_change.append([i,j+1])\r\n\t\t\tif (j-1 > -1):\r\n\t\t\t\tindice_change.append([i,j-1])\r\n\r\n\r\nfor kites in range(len(indice_change)):\r\n\r\n\tith = indice_change[kites][0]\r\n\tjth = indice_change[kites][1]\r\n\r\n\r\n\tif numpy[ith][jth] == 1:\r\n\t\tnumpy[ith][jth] = 0\r\n\r\n\telse:\r\n\t\tnumpy[ith][jth] = 1\r\n#print(\"main_matrix : \",numpy)\r\n\r\nshow(numpy)", "def al(i,j):\r\n # add list\r\n o = [(i,j)]\r\n if j>0 : o.append((i,j-1))\r\n if i>0 : o.append((i-1,j))\r\n if i<2 : o.append((i+1,j))\r\n if j<2 : o.append((i,j+1))\r\n return o\r\ndef main():\r\n #get input\r\n g = []\r\n for i in range(3):\r\n g.append(list(map(int,input().split())))\r\n s = [[1,1,1],[1,1,1],[1,1,1]]\r\n for i in range(3):\r\n for j in range(3):\r\n x = g[i][j]\r\n if x>0 :\r\n # add list\r\n a = al(i,j)\r\n for n in a :\r\n # add x\r\n s[n[0]][n[1]] += x\r\n # on or off\r\n s[n[0]][n[1]] %= 2\r\n # print output\r\n for i in range(3):\r\n s[i] = \"\".join(list(map(str,s[i])))\r\n print(s[i])\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def ch(x):\r\n if x == 0: \r\n return 1\r\n return 0\r\n\r\nmat = [[1,1,1,1,1] for i in range(0,5)]\r\n\r\nfor i in range(1,4):\r\n \r\n l = [int(x) for x in input().split()]\r\n \r\n for j in range(1,4):\r\n if l[j-1] %2 == 1:\r\n mat[i][j] =ch(mat[i][j])\r\n mat[i][j-1] = ch(mat[i][j-1])\r\n mat[i][j+1] = ch(mat[i][j+1])\r\n mat[i-1][j] = ch(mat[i-1][j])\r\n mat[i+1][j] = ch(mat[i+1][j])\r\n\r\n\r\nfor x in mat[1:4]:\r\n print(''.join(list(map(str,x[1:4]))))\r\n\r\n \r\n \r\n", "row1=list(map(int,input().split()))\nrow2=list(map(int,input().split()))\nrow3=list(map(int,input().split()))\n\nconfig1=[row1[0]+row1[1]+row2[0], sum(row1)+row2[1], row1[1]+row1[2]+row2[2]]\nconfig2=[row1[0]+row2[0]+row3[0]+row2[1], sum(row2)+row1[1]+row3[1], row1[2]+row2[2]+row3[2]+row2[1]]\nconfig3=[row2[0]+row3[0]+row3[1], sum(row3)+row2[1], row3[1]+row3[2]+row2[2]]\n\nfinal1=[]\nfinal2=[]\nfinal3=[]\nfor n in range(0,3):\n if config1[n]%2==1:\n final1.append(\"0\")\n else:\n final1.append(\"1\")\n if config2[n]%2==1:\n final2.append(\"0\")\n else:\n final2.append(\"1\")\n if config3[n]%2==1:\n final3.append(\"0\")\n else:\n final3.append(\"1\")\n\n\nprint(\"\".join(final1))\nprint(\"\".join(final2))\nprint(\"\".join(final3))", "arr = [[0] * 3 for _ in range(3)] \n\nfor i in range(3):\n arr[i][0], arr[i][1], arr[i][2] = map(int, input().split())\n \nfor i in range(3):\n for j in range(3):\n cnt = arr[i][j]\n if i-1>=0:\n cnt += arr[i-1][j]\n if j-1>=0:\n cnt += arr[i][j-1]\n if i+1<3:\n cnt += arr[i+1][j]\n if j+1<3:\n cnt += arr[i][j+1]\n \n if cnt % 2:\n print(0,end=\"\")\n else:\n print(1,end=\"\")\n print()\n", "import math\r\nfrom re import I\r\n\r\nlights = [[1, 1, 1] for i in range(3)]\r\n\r\nt = []\r\nfor i in range(3):\r\n c = list(map(int, input().split(' ')))\r\n t.append(c)\r\n\r\nnew_t = [[1,1,1] for i in range(3)]\r\nfor i in range(len(t)):\r\n for j in range(len(t[i])):\r\n total = 0\r\n top, bot, right, left = 0, 0, 0, 0\r\n if i-1 >= 0:\r\n top = t[i-1][j]\r\n if i + 1 < 3:\r\n bot = t[i+1][j]\r\n if j + 1 < 3:\r\n right = t[i][j+1]\r\n if j - 1 >= 0:\r\n left = t[i][j-1]\r\n center = t[i][j]\r\n \r\n total = top + bot + right + left + center\r\n if total % 2 == 0:\r\n new_t[i][j] = 1\r\n else:\r\n new_t[i][j] = 0\r\n\r\nfor row in new_t:\r\n print(f'{row[0]}{row[1]}{row[2]}')", "t=[]\r\nk=[['1','1','1'],['1','1','1'],['1','1','1']]\r\n\r\nfor i in range(3):\r\n a=list(map(int,input().split()))\r\n\r\n if a[0]==0:\r\n pass\r\n elif a[0]%2==0:\r\n pass\r\n else:\r\n k[i][0]= str(abs(int(k[i][0])-1))\r\n k[i][1]=str(abs(int(k[i][1])-1))\r\n if i==0:\r\n k[i+1][0]=str(abs(int(k[i+1][0])-1))\r\n elif i==1:\r\n k[i+1][0]=str(abs(int(k[i+1][0])-1))\r\n k[i-1][0]=str(abs(int(k[i-1][0])-1))\r\n else:\r\n k[i-1][0]=str(abs(int(k[i-1][0])-1))\r\n\r\n if a[1]==0:\r\n pass\r\n elif a[1]%2==0:\r\n pass\r\n else:\r\n k[i][1]= str(abs(int(k[i][1])-1))\r\n k[i][0]=str(abs(int(k[i][0])-1))\r\n k[i][2]=str(abs(int(k[i][2])-1))\r\n if i==0:\r\n k[i+1][1]=str(abs(int(k[i+1][1])-1))\r\n elif i==1:\r\n k[i+1][1]=str(abs(int(k[i+1][1])-1))\r\n k[i-1][1]=str(abs(int(k[i-1][1])-1))\r\n else:\r\n k[i-1][1]=str(abs(int(k[i-1][1])-1))\r\n if a[2]==0:\r\n pass\r\n elif a[2]%2==0:\r\n pass\r\n else:\r\n k[i][2]= str(abs(int(k[i][2])-1))\r\n k[i][1]=str(abs(int(k[i][1])-1))\r\n if i==0:\r\n k[i+1][2]=str(abs(int(k[i+1][2])-1))\r\n elif i==1:\r\n k[i+1][2]=str(abs(int(k[i+1][2])-1))\r\n k[i-1][2]=str(abs(int(k[i-1][2])-1))\r\n else:\r\n k[i-1][2]=str(abs(int(k[i-1][2])-1))\r\n\r\nfor h in k:\r\n print(''.join(h))\r\n\r\n\r\n", "inp = []\r\n\r\nfor i in range(3):\r\n row = input().split()\r\n inp.append(row)\r\n\r\nans = [[1,1,1],\r\n [1,1,1],\r\n [1,1,1]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if int(inp[i][j]) % 2 == 1:\r\n if (i - 1) >= 0:\r\n ans[i - 1][j] = 1 - ans[i - 1][j]\r\n if (j - 1) >= 0:\r\n ans[i][j - 1] = 1 - ans[i][j - 1]\r\n\r\n \r\nfor i in range(2, -1, -1):\r\n for j in range(2, -1, -1):\r\n if int(inp[i][j]) % 2 == 1:\r\n if (i + 1) <= 2:\r\n ans[i + 1][j] = 1 - ans[i + 1][j]\r\n if (j + 1) <= 2:\r\n ans[i][j + 1] = 1 - ans[i][j + 1]\r\n \r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if int(inp[i][j]) % 2 == 1:\r\n ans[i][j] = 1 - ans[i][j]\r\n print(ans[i][j], end = '')\r\n print('')", "g = [[0] + list(map(int, input().split())) + [0] for i in range(3)]\nw = [[0]*5] + g + [[0]*5]\nfor i in range(1,4):\n print(\"\".join(map(str, [1 - (w[i][j-1] + w[i][j+1] + w[i][j] + w[i-1][j] + w[i+1][j]) %2 for j in range(1,4)])))\n", "a=[[1,1,1],[1,1,1],[1,1,1]]\r\nc=[]\r\nfor i in range(3):\r\n b=list(map(int,input().split()))[:3]\r\n c.append(b)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if c[i][j]%2==1:\r\n if a[i][j]==0:\r\n a[i][j]=1\r\n else:\r\n a[i][j]=0\r\n if i-1>=0:\r\n if a[i-1][j]==0:\r\n a[i-1][j]=1\r\n else: \r\n a[i-1][j]=0\r\n if i+1<3: \r\n if a[i+1][j]==0:\r\n a[i+1][j]=1\r\n else:\r\n a[i+1][j]=0\r\n if j+1<3:\r\n if a[i][j+1]==0:\r\n a[i][j+1]=1\r\n else:\r\n a[i][j+1]=0\r\n if j-1>=0:\r\n if a[i][j-1]==0:\r\n a[i][j-1]=1\r\n else:\r\n a[i][j-1]=0\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(a[i][j],end='')\r\n print() ", "# 275A - Lights Out\r\ndef lol(x):\r\n if x == 1:\r\n return 0\r\n else:\r\n return 1\r\n\r\n\r\nl = [[1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [\r\n 1, 1, 1, 1, 1], [1, 1, 1, 1, 1], [1, 1, 1, 1, 1]]\r\nm = [[0, 0, 0, 0, 0]]\r\nfor i in range(3):\r\n m.append([0]+list(map(int, input().split()))+[0])\r\nm.append([0, 0, 0, 0, 0])\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if m[i][j] % 2 == 1:\r\n l[i][j-1] = (l[i][j-1]+1) % 2\r\n l[i][j+1] = lol(l[i][j+1])\r\n l[i-1][j] = lol(l[i-1][j])\r\n l[i+1][j] = lol(l[i+1][j])\r\n l[i][j] = lol(l[i][j])\r\nfor i in range(1, 4):\r\n print(*l[i][1:4], sep='')\r\n", "def lights_out():\r\n grid = [[1, 1, 1], [1, 1, 1], [1, 1, 1]]\r\n directions = [(0, 0), (0, 1), (0, -1), (1, 0), (-1, 0)]\r\n presses = [list(map(int, input().split())) for _ in range(3)]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n total_presses = 0\r\n for dx, dy in directions:\r\n x, y = i + dx, j + dy\r\n if 0 <= x < 3 and 0 <= y < 3:\r\n total_presses += presses[x][y]\r\n grid[i][j] = (total_presses + 1) % 2\r\n\r\n for row in grid:\r\n print(''.join(map(str, row)))\r\n\r\nlights_out()", "def lightsOut():\r\n l=[]\r\n for i in range(3):\r\n s=[int(x) for x in input().split()]\r\n l.append(s)\r\n i=0\r\n ans=[[1,1,1] for i in range(3)]\r\n while i<3:\r\n j=0\r\n while j<3:\r\n oc=0\r\n if l[i][j]%2!=0:\r\n oc=oc+l[i][j]\r\n if i+1<3:\r\n if l[i+1][j]%2!=0:\r\n oc=oc+l[i+1][j]\r\n if i-1>=0:\r\n if l[i-1][j]%2!=0:\r\n oc=oc+l[i-1][j]\r\n if j+1<3:\r\n if l[i][j+1]%2!=0:\r\n oc=oc+l[i][j+1]\r\n if j-1>=0:\r\n if l[i][j-1]!=0:\r\n oc=oc+l[i][j-1]\r\n if oc%2==0:\r\n ans[i][j]=1\r\n else:\r\n ans[i][j]=0\r\n j=j+1\r\n i=i+1\r\n for i in range(3):\r\n print(ans[i][0],ans[i][1],ans[i][2],sep='')\r\n\r\nlightsOut()\r\n\r\n\r\n", "a,b,c = map(int, input().split())\r\nd,e,f = map(int, input().split())\r\ng,h,i = map(int, input().split())\r\n\r\na1, b1, c1, d1, e1, f1, g1, h1, i1= 1,1,1,1,1,1,1,1,1\r\n\r\ndef lightControl(x):\r\n if x == 1:\r\n return x-1\r\n else:\r\n return x + 1\r\n \r\nif a>0 and a%2 == 1:\r\n a1 = lightControl(a1)\r\n b1 = lightControl(b1)\r\n d1 = lightControl(d1)\r\nif b>0 and b%2 == 1:\r\n a1 = lightControl(a1)\r\n b1 = lightControl(b1)\r\n c1 = lightControl(c1)\r\n e1 = lightControl(e1)\r\nif c>0 and c%2 == 1:\r\n b1 = lightControl(b1)\r\n c1 = lightControl(c1)\r\n f1 = lightControl(f1)\r\nif d%2 == 1 and d>0:\r\n a1 = lightControl(a1)\r\n d1 = lightControl(d1)\r\n e1 = lightControl(e1)\r\n g1 = lightControl(g1)\r\nif e%2 == 1 and e>0:\r\n b1 = lightControl(b1)\r\n d1 = lightControl(d1)\r\n e1 = lightControl(e1)\r\n f1 = lightControl(f1)\r\n h1 = lightControl(h1)\r\nif f%2 == 1 and f>0:\r\n c1 = lightControl(c1)\r\n e1 = lightControl(e1)\r\n f1 = lightControl(f1)\r\n i1 = lightControl(i1)\r\nif g%2 == 1 and g>0:\r\n d1 = lightControl(d1)\r\n g1 = lightControl(g1)\r\n h1 = lightControl(h1)\r\nif h%2 == 1 and h>0:\r\n e1 = lightControl(e1)\r\n g1 = lightControl(g1)\r\n h1 = lightControl(h1)\r\n i1 = lightControl(i1)\r\nif i%2 == 1 and i>0:\r\n f1 = lightControl(f1)\r\n h1 = lightControl(h1)\r\n i1 = lightControl(i1)\r\n\r\n\r\n\r\nlst1 = []\r\nlst1.append(str(a1))\r\nlst1.append(str(b1))\r\nlst1.append(str(c1))\r\n\r\nlst2 = []\r\nlst2.append(str(d1))\r\nlst2.append(str(e1))\r\nlst2.append(str(f1))\r\n\r\nlst3 = []\r\nlst3.append(str(g1))\r\nlst3.append(str(h1))\r\nlst3.append(str(i1))\r\n\r\nprint(''.join(lst1))\r\nprint(''.join(lst2))\r\nprint(''.join(lst3))", "# https://codeforces.com/problemset/problem/275/A\r\n\r\nimport sys\r\n#-----------------------------------------------------------------------------#\r\ntry:\r\n sys.stdin = open('inputs.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\nfinally:\r\n input = sys.stdin.readline\r\n print = sys.stdout.write\r\n\r\n#-----------------------------------------------------------------------------#\r\n\r\nlights = [[1] * 3 for _ in range(3)]\r\ntoggle = []\r\n\r\nfor r in range(3):\r\n\r\n toggle.append(list(map(int, input().split())))\r\n\r\nfor r in range(3):\r\n for c in range(3):\r\n toggles = toggle[r][c]\r\n if r > 0:\r\n toggles += toggle[r-1][c]\r\n if r < 2:\r\n toggles += toggle[r+1][c]\r\n if c > 0:\r\n toggles += toggle[r][c-1]\r\n if c < 2:\r\n toggles += toggle[r][c+1]\r\n if toggles & 1:\r\n lights[r][c] = 0\r\n print(\"\".join(list(map(str, lights[r]))))\r\n print('\\n')\r\n", "l1=[int(i) for i in input().split()]\r\nl2=[int(i) for i in input().split()]\r\nl3=[int(i) for i in input().split()]\r\ns1=[1,1,1]\r\ns2=[1,1,1]\r\ns3=[1,1,1]\r\nfor j in range(3):\r\n if l1[j]%2!=0:\r\n if j==0:\r\n s1[0]=1-s1[0]\r\n s1[1]=1-s1[1]\r\n s2[0]=1-s2[0]\r\n elif j==1:\r\n s1[0]=1-s1[0]\r\n s1[1]=1-s1[1]\r\n s1[-1]=1-s1[-1]\r\n s2[1]=1-s2[1]\r\n else :\r\n s1[-1]=1-s1[-1]\r\n s1[1]=1-s1[1]\r\n s2[-1]=1-s2[-1]\r\nfor k in range(3):\r\n if l2[k]%2!=0:\r\n if k==0:\r\n s1[0]=1-s1[0]\r\n s2[0]=1-s2[0]\r\n s3[0]=1-s3[0]\r\n s2[1]=1-s2[1]\r\n elif k==1:\r\n s2[0]=1-s2[0]\r\n s2[1]=1-s2[1]\r\n s2[-1]=1-s2[-1]\r\n s1[1]=1-s1[1]\r\n s3[1]=1-s3[1]\r\n else :\r\n s1[-1]=1-s1[-1]\r\n s2[-1]=1-s2[-1]\r\n s3[-1]=1-s3[-1]\r\n s2[1]=1-s2[1]\r\nfor l in range(3):\r\n if l3[l]%2!=0:\r\n if l==0:\r\n s3[0]=1-s3[0]\r\n s3[1]=1-s3[1]\r\n s2[0]=1-s2[0]\r\n elif l==1:\r\n s3[0]=1-s3[0]\r\n s3[1]=1-s3[1]\r\n s3[-1]=1-s3[-1]\r\n s2[1]=1-s2[1]\r\n else :\r\n s3[-1]=1-s3[-1]\r\n s3[1]=1-s3[1]\r\n s2[-1]=1-s2[-1]\r\nprint(*s1,sep=\"\")\r\nprint(*s2,sep=\"\")\r\nprint(*s3,sep=\"\")", "# mat = [ [1,1,1], [1,1,1], [1,1,1] ]\r\n\r\n# input_mat = []\r\n\r\n# for i in range(3):\r\n# llist = list(map(int, input().split()))\r\n# input_mat.append(llist)\r\n\r\n \r\n\r\n# for i in range(3):\r\n# for j in range(3):\r\n# if input_mat[i][j] % 2 != 0:\r\n# if mat[i][j] == 1:\r\n# mat[i][j] = 0\r\n# else:\r\n# mat[i][j] = 1\r\n \r\n# if i-1 >= 0 and mat[i-1][j] == 1:\r\n# mat[i-1][j] = 0\r\n# elif i-1 >= 0:\r\n# mat[i-1][j] = 1\r\n \r\n# if j-1 >= 0 and mat[i][j-1] == 1:\r\n# mat[i][j-1] = 0\r\n# elif j-1 >= 0:\r\n# mat[i][j-1] = 1\r\n\r\n# if j+1 < 3 and mat[i][j+1] == 1:\r\n# mat[i][j+1] = 0\r\n# elif j+1 < 3:\r\n# mat[i][j+1] = 1\r\n \r\n# if i+1 < 3 and mat[i+1][j] == 1:\r\n# mat[i+1][j] = 0\r\n# elif i+1 < 3:\r\n# mat[i+1][j] = 1\r\n\r\n# for i in range(3):\r\n# for j in range(3):\r\n# print(mat[i][j], end=\"\")\r\n# print()\r\n\r\n'''\r\n1 0 1\r\n8 8 8\r\n2 0 3\r\n'''\r\n\r\n'''\r\n0 1 0\r\n0 1 1\r\n1 0 0\r\n'''\r\n\r\n'''\r\nodd -> state change\r\neven -> state unchage\r\n'''\r\n\r\n\r\n#WITH FUNCTION\r\ndef isValid(position, max_range):\r\n if(position >= 0 and position < max_range):\r\n return True\r\n return False\r\n\r\ndef toggle(mat, i, j):\r\n if isValid(i, 3) and isValid(j, 3) and mat[i][j] == 0:\r\n mat[i][j] = 1\r\n elif isValid(i, 3) and isValid(j, 3) :\r\n mat[i][j] = 0\r\n\r\ndef printMatrix(matrix):\r\n for i in range(3):\r\n for j in range(3):\r\n print(mat[i][j], end=\"\")\r\n print()\r\n\r\nmat = [ [1,1,1], [1,1,1], [1,1,1] ]\r\n\r\ninput_mat = []\r\n\r\nfor i in range(3):\r\n llist = list(map(int, input().split()))\r\n input_mat.append(llist)\r\n\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n if input_mat[i][j] % 2 != 0: # change only needed if input number is odd, otherwise no toogle needed as even\r\n toggle(mat, i, j)\r\n toggle(mat, i-1, j)\r\n toggle(mat, i+1, j)\r\n toggle(mat, i, j-1)\r\n toggle(mat, i, j+1)\r\n\r\n\r\nprintMatrix(mat)\r\n\r\n\r\n'''\r\n1 0 1\r\n8 8 8\r\n2 0 3\r\n'''\r\n\r\n'''\r\n0 1 0\r\n0 1 1\r\n1 0 0\r\n'''\r\n\r\n'''\r\nodd -> state change\r\neven -> state unchage\r\n'''", "l=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n\tz=list(map(int,input().split()))\r\n\tfor j in range(3):\r\n\t\tif z[j]%2==1:\r\n\t\t\tif j+1<3:\r\n\t\t\t\tl[i][j+1]=(l[i][j+1]+1)%2\r\n\t\t\tif i+1<3:\r\n\t\t\t\tl[i+1][j]=(l[i+1][j]+1)%2\r\n\t\t\tif j-1>=0:\r\n\t\t\t\tl[i][j-1]=(l[i][j-1]+1)%2\r\n\t\t\tif i-1>=0:\r\n\t\t\t\tl[i-1][j]=(l[i-1][j]+1)%2\r\n\t\t\tl[i][j]=(l[i][j]+1)%2\r\nfor i in l:\r\n\tprint(''.join(list(map(lambda t:str(t),i))))", "l = [list(map(int, input().split())) for i in range(3)]\r\n\r\nmatrix = [[0 for _ in range(3)] for j in range(3)]\r\n\r\nfor i in range(3):\r\n ans = \"\"\r\n for j in range(3):\r\n cur = l[i][j]\r\n if i > 0:\r\n cur += l[i-1][j]\r\n if i < 2:\r\n cur += l[i+1][j]\r\n if j > 0:\r\n cur += l[i][j-1]\r\n if j < 2:\r\n cur += l[i][j+1]\r\n if not(cur%2):\r\n ans += \"1\"\r\n else:\r\n ans += \"0\"\r\n print(ans)\r\n", "a, b, c=map(int,input().split())\r\nd, e, f=map(int,input().split())\r\ng, h, i=map(int,input().split())\r\n \r\nA,B,C=1, 1, 1\r\nD,E,F=1,1,1\r\nG,H,I=1, 1, 1\r\n \r\nif a+b+d==0:\r\n A=1\r\nelif (a+b+d)%2!=0:\r\n A=0\r\nelse:\r\n A=1\r\n \r\nif a+b+c+e==0:\r\n B=1\r\nelif (a+b+c+e)%2!=0:\r\n B=0\r\nelse:\r\n B=1\r\n \r\nif b+c+f==0:\r\n C=1\r\nelif (b+c+f)%2!=0:\r\n C=0\r\nelse:\r\n C=1\r\n \r\nif a+d+e+g==0:\r\n D=1\r\nelif (a+d+e+g)%2!=0:\r\n D=0\r\nelse:\r\n D=1\r\n \r\nif b+d+e+f+h==0:\r\n E=1\r\nelif (b+d+e+f+h)%2!=0:\r\n E=0\r\nelse:\r\n E=1\r\n \r\nif c+e+f+i==0:\r\n F=1\r\nelif (c+e+f+i)%2!=0:\r\n F=0\r\nelse:\r\n F=1\r\n \r\nif d+g+h==0:\r\n G=1\r\nelif (d+g+h)%2!=0:\r\n G=0\r\nelse:\r\n G=1\r\n \r\nif e+g+h+i==0:\r\n H=1\r\nelif (e+g+h+i)%2!=0:\r\n H=0\r\nelse:\r\n H=1\r\n \r\nif f+h+i==0:\r\n I=1\r\nelif (f+h+i)%2!=0:\r\n I=0\r\nelse:\r\n I=1\r\n \r\nprint(str(A)+str(B)+str(C))\r\nprint(str(D)+str(E)+str(F))\r\nprint(str(G)+str(H)+str(I))", "import sys\n\ninput = sys.stdin.readline\n\ndef inlt():\n return (list(map(int, input().split())))\n\n\ndef solve(m):\n\n def helper(mat, i, j):\n direction = [(0,0), (-1, 0), (1, 0), (0, -1), (0, 1)]\n for d in direction:\n if i + d[0] > -1 and i + d[0] < 3 and j + d[1] > -1 and j + d[1] < 3:\n if mat[i + d[0]][j + d[1]] == 0:\n mat[i + d[0]][j + d[1]] = 1\n else:\n mat[i + d[0]][j + d[1]] = 0\n return mat\n\n mat = [[1] * 3 for _ in range(3)]\n for r in range(3):\n for c in range(3):\n if m[r][c] % 2 != 0:\n mat = helper(mat, r, c)\n return mat\n\n\nif __name__ == '__main__':\n m = []\n for i in range(3):\n m.append(inlt())\n mat = solve(m)\n\n for i in range(3):\n print(\"\".join(map(str, mat[i])))\n", "l=[]\r\nl.append([0 for i in range(5)])\r\nfor i in range(3): l.append([0]+list(map(int, input().split()))+[0])\r\nl.append([0 for i in range(5)])\r\nans=[[0 for j in range(3)]for i in range(3)]\r\nfor i in range(1,4):\r\n s=''\r\n for j in range(1,4):\r\n ans[i-1][j-1]=1-((l[i][j]+l[i][j-1]+l[i][j+1]+l[i-1][j]+l[i+1][j])%2)\r\n s+=str(ans[i-1][j-1])\r\n print(s)", "n = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\ninput_list = [n] + [m] + [y]\r\n\r\n\r\ngrid = [[1,1,1] for _ in range(3)]\r\n\r\ndef bulbs(row,col):\r\n grid[row][col] = 1 - grid[row][col] \r\n \r\n if row > 0:\r\n grid[row-1][col] = 1 - grid[row-1][col] \r\n\r\n if row < 2:\r\n grid[row+1][col] = 1 - grid[row+1][col] \r\n\r\n if col > 0:\r\n grid[row][col-1] = 1 - grid[row][col-1]\r\n\r\n if col < 2:\r\n grid[row][col+1] = 1 - grid[row][col+1] \r\n\r\n\r\nfor i , rows in enumerate(input_list):\r\n for j, k in enumerate(rows):\r\n if k%2==1:\r\n bulbs(i,j)\r\n\r\nfor row in grid:\r\n print(''.join(map(str, row)))\r\n", "def toggle_light(mat, i, j):\r\n\tmat[i][j] = not mat[i][j]\r\n\tif 0<=i<=1:\r\n\t\tmat[i + 1][j] = not mat[i + 1][j]\r\n\tif 0<=j<=1:\r\n\t\tmat[i][j + 1] = not mat[i][j + 1]\r\n\tif 1<=i<=2:\r\n\t\tmat[i - 1][j] = not mat[i - 1][j]\r\n\tif 1<=j<=2:\r\n\t\tmat[i][j - 1] = not mat[i][j - 1]\r\n\r\n\r\ndef main():\r\n\tmat = [[1] * 3 for _ in range(3)]\r\n\tfor i in range(3):\r\n\t\trow = list(map(int, input().split()))\r\n\t\tfor j in range(3):\r\n\t\t\tif row[j] % 2: # odd\r\n\t\t\t\ttoggle_light(mat, i, j)\r\n\tprint('\\n'.join(''.join(map(str, map(int, row))) for row in mat))\r\n\r\n\r\nmain()\r\n\r\n\r\n'''\r\n0 0 1\r\n0 1 0\r\n1 0 0\r\n'''\r\n", "pressed = [[0] * 6 for _ in range(6)]\r\ntoggled = [[0] * 6 for _ in range(6)]\r\n\r\nfor i in range(1, 4):\r\n row = input().strip().split()\r\n for j in range(1, 4):\r\n pressed[i][j] = int(row[j - 1])\r\n toggled[i][j] = pressed[i][j]\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if pressed[i][j] != 0:\r\n toggled[i][j - 1] += pressed[i][j]\r\n toggled[i][j + 1] += pressed[i][j]\r\n toggled[i - 1][j] += pressed[i][j]\r\n toggled[i + 1][j] += pressed[i][j]\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if toggled[i][j] % 2 == 1:\r\n print(\"0\", end=\"\")\r\n else:\r\n print(\"1\", end=\"\")\r\n print()\r\n", "import sys\r\nimport os\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef __perform_setup__():\r\n INPUT_FILE_PATH = \"./code/input.txt\"\r\n OUTPUT_FILE_PATH = \"./code/output.txt\"\r\n\r\n sys.stdin = open(INPUT_FILE_PATH, 'r')\r\n sys.stdout = open(OUTPUT_FILE_PATH, 'w')\r\n\r\n\r\nif \"MY_COMPETITIVE_PROGRAMMING_VARIABLE\" in os.environ:\r\n __perform_setup__()\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(R, C, grid):\r\n curr = [[1 for _ in range(C)] for _ in range(R)]\r\n\r\n for r in range(R):\r\n for c in range(C):\r\n times = grid[r][c]\r\n\r\n if times & 1:\r\n curr[r][c] = 1-curr[r][c]\r\n for dR, dC in [[-1, 0], [1, 0], [0, 1], [0, -1]]:\r\n nR, nC = dR+r, dC+c\r\n\r\n if 0 <= nR < R and 0 <= nC < C:\r\n curr[nR][nC] = 1 - curr[nR][nC]\r\n\r\n for r in range(R):\r\n print(\"\".join(map(str, [curr[r][c] for c in range(C)])))\r\n\r\n\r\nR, C = 3, 3\r\ngrid = []\r\n\r\nfor _ in range(R):\r\n grid.append(read_numeric_list())\r\n\r\nsolve(R, C, grid)\r\n", "def matsum(a):\r\n b=[[0 for i in range(5)] for j in range(5)]\r\n for i in range(1,4):\r\n for j in range(1,4):\r\n b[i][j]=((a[i][j]+a[(i+1)][j]+a[(i-1)][j]+a[i][(j+1)]+a[i][(j-1)])%2)\r\n return b\r\na=[[0 for i in range(5)] for j in range(5)]\r\nfor i in range(1,4):\r\n b=[int(i) for i in input().split()]\r\n a[i][1:4]=b\r\nb=matsum(a)\r\nfor i in range(1,4):\r\n c=''\r\n for j in range(1,4):\r\n if (b[i][j]==1):\r\n c=c+'0'\r\n else:\r\n c=c+'1'\r\n print(c)\r\n", "t = []\r\nfor i in range(3):\r\n m = list(map(int,input().split()))\r\n t.append(m)\r\np = []\r\nfor i in range(3):\r\n m = [1,1,1]\r\n p.append(m)\r\nfor i in range(3):\r\n for j in range(3):\r\n if t[i][j]%2 != 0:\r\n p[i][j] = int(not p[i][j])\r\n if i >0:\r\n p[i-1][j] = int(not p[i-1][j])\r\n if j>0:\r\n p[i][j-1] = int(not p[i][j-1])\r\n if i <2:\r\n p[i+1][j] = int(not p[i+1][j])\r\n if j < 2:\r\n p[i][j+1] = int(not p[i][j+1])\r\nfor i in range(3):\r\n for j in range(3):\r\n print(p[i][j],end=\"\")\r\n print()", "# https://codeforces.com/problemset/problem/275/A\r\n\r\n\"\"\"\r\nYou have a 3x3 grid of lights.\r\nAt the start all lights are on\r\nPressing any of the lights will toggle all side-adjacent lights\r\n(add 1 then mod 2)\r\n\r\nThe order in which you press the lights does not matter\r\nAs long as you press the same ones the same amount of times.\r\n\r\nThis is because consider an arbitrary point in the grid.\r\nAll it knows is whether it is on or off\r\nThis corresponds to how many moves have been performed on it.\r\n\r\nIf the total number of moves are performed on a bulb then its new state is\r\n 1 + number of moves % 2\r\n\"\"\"\r\n\r\nimport sys\r\n\r\nmatrix = []\r\n\r\nfor i in range(3):\r\n row = list(map(int, sys.stdin.readline().split()))\r\n matrix.append(row)\r\n\r\noutput_matrix = [\r\n [0, 0, 0],\r\n [0, 0, 0],\r\n [0, 0, 0]\r\n]\r\n\r\n\r\ndef check(i, j):\r\n return 0 <= i <= 2 and 0 <= j <= 2\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n\r\n output = matrix[i][j]\r\n\r\n if check(i, j+1):\r\n output += matrix[i][j+1]\r\n if check(i, j-1):\r\n output += matrix[i][j-1]\r\n if check(i+1, j):\r\n output += matrix[i+1][j]\r\n if check(i-1, j):\r\n output += matrix[i-1][j]\r\n\r\n output_matrix[i][j] = (1 + output) % 2\r\n\r\nfor row in output_matrix:\r\n sys.stdout.write(\"\".join(map(str, row)) + \"\\n\")\r\n\r\n", "# cook your dish here\r\ns=[]\r\nans=[]\r\nfor i in range(0,3):\r\n a=input()\r\n a=a.split(\" \")\r\n s.append(a)\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n s[i][j]=int(s[i][j])\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n if i==0:\r\n if j==0:\r\n a=((s[i][j])+s[i][j+1]+s[i+1][j])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0)\r\n elif j==1:\r\n a=(s[i][j]+s[i][j+1]+s[i+1][j]+s[i][j-1])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0)\r\n elif j==2:\r\n a=(s[i][j]+s[i][j-1]+s[i+1][j])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0) \r\n elif i==1:\r\n if j==0:\r\n a=(s[i][j]+s[i][j+1]+s[i+1][j]+s[i-1][j])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0)\r\n elif j==1:\r\n a=(s[i][j]+s[i][j+1]+s[i+1][j]+s[i][j-1]+s[i-1][j])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0)\r\n elif j==2:\r\n a=(s[i][j]+s[i+1][j]+s[i][j-1]+s[i-1][j])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0) \r\n elif i==2:\r\n if j==0:\r\n a=(s[i][j]+s[i][j+1]+s[i-1][j])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0)\r\n elif j==1:\r\n a=(s[i][j]+s[i][j+1]+s[i-1][j]+s[i][j-1])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0)\r\n elif j==2:\r\n a=(s[i][j]+s[i][j-1]+s[i-1][j])%2\r\n if a==0:ans.append(1)\r\n else:ans.append(0)\r\nfor i in range(9):\r\n if i==3 or i==6:\r\n print()\r\n print(ans[i],end=\"\")\r\nprint() \r\n ", "def is_good(y, x):\n return 0 <= y < 3 and 0 <= x < 3\n\n\nl = [[int(i) for i in input().split()] for _ in range(3)]\ntable = [[1 for i in range(3)] for _ in range(3)]\nfor i in range(3):\n for j in range(3):\n for k in range(l[i][j]):\n table[i][j] = (table[i][j] + 1) % 2\n for y,x in ((i + 1, j), (i, j+1), (i-1, j), (i, j-1)):\n if is_good(y, x):\n table[y][x] = (table[y][x] + 1) % 2\nfor i in range(3):\n print(''.join(map(str, table[i])))", "def invert(x,y):\r\n if matrix[x][y]==0:\r\n matrix[x][y]=1\r\n elif matrix[x][y]==1:\r\n matrix[x][y]=0\r\nif __name__ == '__main__':\r\n matrix=[[1,1,1],[1,1,1],[1,1,1]]\r\n count_matrix=[]\r\nfor i in range(0,3):\r\n l=list(map(int,input().split())) \r\n count_matrix.append(l) \r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n if count_matrix[i][j]!=0:\r\n for k in range(0,count_matrix[i][j]):\r\n invert(i,j)\r\n if (i+1)<3:\r\n invert(i+1,j)\r\n if (j+1)<3:\r\n invert(i,j+1)\r\n if (i-1)>=0:\r\n invert(i-1,j)\r\n if (j-1)>=0:\r\n invert(i,j-1)\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n print(matrix[i][j],end=\"\")\r\n print(\"\") \r\n\r\n", "grid = []\r\nfor _ in range(3):\r\n grid.append([int(x) for x in input().split()])\r\n \r\nresgrid = [[1 for x in range(3)] for x in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if grid[i][j]!=0 and grid[i][j]%2!=0: #odd clicks\r\n resgrid[i][j] = int(not resgrid[i][j])\r\n for r,c in [(1,0),(0,1),(-1,0),(0,-1)]:\r\n if i+r>=0 and i+r<3 and j+c>=0 and j+c<3:\r\n resgrid[i+r][j+c] = int(not resgrid[i+r][j+c])\r\nfor i in resgrid:\r\n print(*i,sep=\"\")\r\n ", "l=[]\r\nfor i in range(0,3):\r\n ls = list(map(int,input().split()))\r\n l.append(ls)\r\n\r\nmat = []\r\nfor i in range(0,3):\r\n mat.append([1,1,1])\r\n\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n if(l[i][j]%2 != 0):\r\n mat[i][j] = abs(mat[i][j]-1)\r\n if i>0:\r\n mat[i-1][j] = abs(mat[i-1][j]-1)\r\n if i<2:\r\n mat[i+1][j] = abs(mat[i+1][j]-1)\r\n if j>0:\r\n mat[i][j-1] = abs(mat[i][j-1]-1)\r\n if j<2: \r\n mat[i][j+1] = abs(mat[i][j+1]-1)\r\n\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n print(mat[i][j], end=\"\")\r\n print()\r\n", "matrix = []\r\nfor i in range(3):\r\n ls = list(map(int, input().split()))\r\n matrix.append(ls)\r\nfor i in range(3):\r\n for j in range(3):\r\n presses = matrix[i][j]\r\n if j+1 < 3:\r\n presses += matrix[i][j+1]\r\n if j-1 >= 0:\r\n presses += matrix[i][j-1]\r\n if i+1 < 3:\r\n presses += matrix[i+1][j]\r\n if i-1 >= 0:\r\n presses += matrix[i-1][j]\r\n if presses % 2 == 0:\r\n print(1, end=\"\")\r\n else:\r\n print(0, end=\"\")\r\n print()", "import math\r\ndef main():\r\n\t# t = int(input())\r\n\t# for _ in range(t):\r\n\tprint(case())\r\n\r\ndef case():\r\n\td = [[0]*5]\r\n\tf = []\r\n\tfor _ in range(5):\r\n\t\tf.append([0]*5)\r\n\r\n\tfor _ in range(3):\r\n\t\td.append([0]+list(map(int,input().split()))+[0])\r\n\r\n\td.append([0]*5)\r\n\tans = ''\r\n\tfor i in range(1,4):\r\n\t\tfor j in range(1,4):\r\n\t\t\tf[i][j] = d[i][j]+d[i+1][j]+d[i-1][j]+d[i][j+1]+d[i][j-1]\r\n\r\n\t\t\tf[i][j] = 0 if f[i][j] % 2 else 1\r\n\tans = ''\r\n\tfor i in range(1,4):\r\n\t\tans += f\"{''.join(map(str,f[i][1:4]))}\\n\"\r\n\treturn ans\r\nmain()", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndirections = [[0, -1], [0, 0], [0, 1], [1, 0], [-1, 0]]\r\ngrid = [[\"1\"] * 3 for i in range(3)]\r\nswitches = []\r\n\r\nfor i in range(3):\r\n switches += [list(map(int, input().split()))]\r\n\r\nfor row ,switch in enumerate(switches):\r\n for col, s in enumerate(switch):\r\n for direction in directions:\r\n new_col = col + direction[1]\r\n new_row = row + direction[0]\r\n\r\n if -1 < new_col < 3 and -1 < new_row < 3:\r\n if s % 2 == 0:\r\n continue\r\n else:\r\n if grid[new_row][new_col] == \"1\":\r\n grid[new_row][new_col] = \"0\"\r\n else:\r\n grid[new_row][new_col] = \"1\"\r\n\r\nfor row in grid:\r\n print(\"\".join(row))", "def odd(n):\r\n if(n%2!=0):\r\n return True\r\n else:\r\n return False\r\n \r\n\r\nstart=[[1,1,1,1,1],\r\n [1,1,1,1,1],\r\n [1,1,1,1,1],\r\n [1,1,1,1,1],\r\n [1,1,1,1,1]]\r\nmatrix=[]\r\nfor i in range(3):\r\n a=[]\r\n a = list(map(int,input().split()))\r\n matrix.append(a)\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n k = i+1\r\n f=j+1\r\n if(odd(matrix[i][j])):\r\n start[i+1][j+1]+=matrix[i][j]\r\n start[i+1][j+2]+= matrix[i][j]\r\n start[i+2][j+1]+= matrix[i][j]\r\n start[i+1][j]+= matrix[i][j]\r\n start[i][j+1]+= matrix[i][j]\r\n \r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n print(start[i][j]%2,end=\"\")\r\n print() ", "x = [[1,1,1] for _ in range(3)]\r\ny = [ [*map(lambda x: int(x)%2, input().split())] for _ in range(3) ]\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif y[i][j]:\r\n\t\t\tx[i][j] = 1 - x[i][j]\r\n\t\t\tif i < 2: x[i+1][j] = 1 - x[i+1][j]\r\n\t\t\tif j < 2: x[i][j+1] = 1 - x[i][j+1]\r\n\t\t\tif i > 0: x[i-1][j] = 1 - x[i-1][j]\r\n\t\t\tif j > 0: x[i][j-1] = 1 - x[i][j-1]\r\nprint('\\n'.join([''.join(map(str, a)) for a in x]))", "import math\r\nfrom sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n a = []\r\n for i in range(3):\r\n b = list_input(int)\r\n a.append(b)\r\n ans = [[1 for i in range(3)] for j in range(3)]\r\n dx = [1, 0, 0, -1]\r\n dy = [0, 1, -1, 0]\r\n for i in range(3):\r\n for j in range(3):\r\n if a[i][j] & 1:\r\n ans[i][j] = 1-ans[i][j]\r\n for r in range(4):\r\n ni = i+dx[r]\r\n nj = j+dy[r]\r\n if ni >= 0 and ni < 3 and nj >= 0 and nj < 3:\r\n ans[ni][nj] = 1-ans[ni][nj]\r\n for i in range(3):\r\n for j in range(3):\r\n print(f\"{ans[i][j]}\")\r\n print(\"\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "matrix = []\nfor _ in range(3):\n matrix.append(list(map(int, input().split())))\n\nmy_matrix = [[1 for _ in range(3)] for _ in range(3)]\n\nfor i in range(3):\n for j in range(3):\n if matrix[i][j]%2 == 1:\n my_matrix[i][j] = int(not my_matrix[i][j])\n if i-1 >= 0:\n my_matrix[i-1][j] = int(not my_matrix[i-1][j])\n if i+1 < 3:\n my_matrix[i+1][j] = int(not my_matrix[i+1][j])\n if j-1 >= 0:\n my_matrix[i][j-1] = int(not my_matrix[i][j-1])\n if j+1 < 3:\n my_matrix[i][j+1] = int(not my_matrix[i][j+1])\n\nfor row in my_matrix:\n print(*row, sep='')\n", "a = [int(i)%2 for i in input().split()]\r\nb = [int(i)%2 for i in input().split()]\r\nc = [int(i)%2 for i in input().split()]\r\nm = [a,b,c]\r\nl = [[0, 0, 0],[0, 0, 0],[0, 0, 0]]\r\n\r\nfor u in range(3):\r\n for i in range(3):\r\n if m[u][i] == 1:\r\n l[u][i] += 1\r\n if u<2:\r\n l[u+1][i] += 1\r\n if u>0:\r\n l[u-1][i] += 1\r\n if i<2:\r\n l[u][i+1] += 1\r\n if i>0:\r\n l[u][i-1] += 1\r\nfor i in range(3):\r\n for k in range(3):\r\n l[i][k] = int(l[i][k]%2==0)\r\nfor i in range(3):\r\n l[i] = \"\".join([str(y) for y in l[i]])\r\nprint(\"\\n\".join(l))", "input_grid=[]\r\nfor i in range(3):\r\n lst = list(map(int,input().split(\" \")))\r\n input_grid.append(lst)\r\n \r\n\r\ninitial_grid=[]\r\nfor i in range(3):\r\n lst=[]\r\n for j in range(3):\r\n lst.append(1)\r\n initial_grid.append(lst)\r\nfor row in range(3):\r\n for col in range(3):\r\n if input_grid[row][col] %2 != 0:\r\n initial_grid[row][col] = 1- initial_grid[row][col]\r\n if col+1 <3:\r\n initial_grid[row][col+1] = 1- initial_grid[row][col+1]\r\n if row+1<3:\r\n initial_grid[row+1][col]= 1- initial_grid[row+1][col]\r\n if col-1>=0:\r\n initial_grid[row][col-1] = 1- initial_grid[row][col-1]\r\n if row-1>=0:\r\n initial_grid[row-1][col] = 1- initial_grid[row-1][col]\r\n \r\n \r\n \r\nfor ele in initial_grid:\r\n for e in ele:\r\n print(e,end=\"\")\r\n print()", "from sys import *\n'''sys.stdin = open('input.txt', 'r') \nsys.stdout = open('output.txt', 'w') '''\nfrom collections import defaultdict as dd\nfrom math import *\nfrom bisect import *\n#sys.setrecursionlimit(10 ** 8)\ndef sinp():\n return input()\ndef inp():\n return int(sinp())\ndef minp():\n return map(int, sinp().split())\ndef linp():\n return list(minp())\ndef strl():\n return list(sinp())\ndef pr(x):\n print(x)\ndef is_valid(x, y):\n if 0 <= x < 3 and 0 <= y < 3:\n return True\n return False\nmod = int(1e9+7)\nd_x = [-1, 0, 0, 1, 0]\nd_y = [0, -1, 1, 0, 0]\nmat = []\nfor i in range(3):\n mat.append(linp())\nm = [[1 for j in range(3)] for i in range(3)]\nfor i in range(3):\n for j in range(3):\n while mat[i][j]:\n for k in range(5):\n x, y = i + d_x[k], j + d_y[k] \n if is_valid(x, y):\n m[x][y] = int(not(m[x][y]))\n mat[i][j] -= 1\nfor i in m:\n print(*i, sep=\"\")", "L=[]\r\nL.append(list(map(int,input().split())))\r\nL.append(list(map(int,input().split())))\r\nL.append(list(map(int,input().split())))\r\nL=L[0]+L[1]+L[2]\r\n# First \r\nprint((L[0]+L[1]+L[3]+1)%2,end=\"\")\r\nprint((L[1]+L[0]+L[2]+L[4]+1)%2,end=\"\")\r\nprint((L[2]+L[5]+L[1]+1)%2)\r\n# Second \r\nprint((L[0]+L[3]+L[6]+L[4]+1)%2,end=\"\")\r\nprint((L[4]+L[3]+L[5]+L[1]+L[7]+1)%2,end=\"\")\r\nprint((L[2]+L[5]+L[8]+L[4]+1)%2)\r\n# # Third\r\nprint((L[3]+L[6]+L[7]+1)%2,end=\"\")\r\nprint((L[6]+L[7]+L[8]+L[4]+1)%2,end=\"\")\r\nprint((L[7]+L[5]+L[8]+1)%2)", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\na=[[0]*5]\r\nfor _ in range(3):\r\n a.append([0]+list(map(int,input().split()))+[0])\r\na.append([0]*5)\r\nt=0\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n e=sum(a[i+p[0]][j+p[1]] for p in [[0,0],[1,0],[-1,0],\r\n [0,1],[0,-1]])\r\n if e%2:print(0,end='')\r\n else:print(1,end='')\r\n if t==2:\r\n print()\r\n t=0\r\n else:t+=1\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "import sys\ninput = sys.stdin.readline\n\nA = [list(map(int, input().split())) for _ in range(3)]\nR = [[-1]*3 for _ in range(3)]\n\nAWS = ((0, 0), (-1, 0), (0, 1), (1, 0), (0, -1))\nfor ri in range(3) :\n for ci in range(3) :\n s = 0\n for aw in AWS :\n NS = (ri+aw[0], ci+aw[1])\n if 0 <= NS[0] < 3 and 0 <= NS[1] < 3 :\n s += A[NS[0]][NS[1]]\n R[ri][ci] = int(s%2==0)\nprint(\"\\n\".join([\"\".join(map(str, r)) for r in R]))\n", "arr = []\nfor i in range(3):\n arr.append([1,1,1])\n\nmat = list()\nfor i in range(3):\n row = list(map(int,input().split()))\n mat.append(row)\n \nfor i in range(3):\n for j in range(3):\n# print(mat,arr,sep=\"\\n\")\n# print(\"=========================\")\n if mat[i][j]%2 != 0:\n if arr[i][j]: arr[i][j]=0\n else:arr[i][j] = 1\n if i!=0:\n if arr[i-1][j]:arr[i-1][j]=0\n else:arr[i-1][j]=1\n if i!=2:\n if arr[i+1][j]:arr[i+1][j]=0\n else:arr[i+1][j]=1\n if j!=2:\n if arr[i][j+1]:arr[i][j+1]=0\n else:arr[i][j+1]=1\n if j!=0:\n if arr[i][j-1]:arr[i][j-1]=0\n else:arr[i][j-1]=1\n \nfor i in arr:\n for j in i:\n print(j,end=\"\")\n print()\n", "l=[]\r\na=[[1,1,1],[1,1,1],[1,1,1]]\r\nfor i in range(3):\r\n l.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n if l[i][j]%2!=0:\r\n a[i][j]=(a[i][j]+1)%2\r\n if i>0:\r\n a[i-1][j]=(a[i-1][j]+1)%2\r\n if j>0:\r\n a[i][j-1]=(a[i][j-1]+1)%2\r\n if i<2:\r\n a[i+1][j]=(a[i+1][j]+1)%2\r\n if j<2:\r\n a[i][j+1]=(a[i][j+1]+1)%2\r\nfor i in range(3):\r\n for j in range(3):\r\n print(a[i][j],end=\"\")\r\n print()", "x11,x12,x13 = map(int, input().split())\r\nx21,x22,x23 = map(int, input().split())\r\nx31,x32,x33 = map(int, input().split())\r\nif (x11 + x12 + x21) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nif (x11 + x12 + x13 + x22) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nif (x12 + x13 + x23) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nprint()\r\nif (x11 + x21 + x22 + x31) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nif (x12 + x21 + x22 + x23 + x32) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nif (x13 + x22 + x23 + x33) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nprint()\r\nif (x21 + x31 + x32) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nif (x22 + x31 + x32 + x33) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\nif (x23 + x32 + x33) % 2 == 0 :\r\n print(\"1\", end=\"\")\r\nelse :\r\n print(\"0\", end=\"\")\r\n", "a=input().split()\r\nb=input().split()\r\nc=input().split()\r\nx=[]\r\ny=[]\r\nz=[]\r\nk=''\r\nl=''\r\nm=''\r\ncounter=0\r\nfor i in a:\r\n if counter==0:\r\n x.append(int(i)+int(a[1])+int(b[0]))\r\n counter+=1\r\n elif counter==1:\r\n x.append(int(i)+int(a[0])+int(b[1])+int(a[2]))\r\n counter+=1\r\n elif counter==2:\r\n x.append(int(i)+int(a[1])+int(b[2]))\r\n counter+=1\r\ncounter=0\r\nfor i in b:\r\n if counter==0:\r\n y.append(int(i)+int(a[0])+int(b[1])+int(c[0]))\r\n counter+=1\r\n elif counter==1:\r\n y.append(int(i)+int(a[1])+int(b[0])+int(b[2])+int(c[1]))\r\n counter+=1\r\n elif counter==2:\r\n y.append(int(i)+int(a[2])+int(c[2])+int(b[1]))\r\n counter+=1\r\ncounter=0\r\nfor i in c:\r\n if counter==0:\r\n z.append(int(i)+int(c[1])+int(b[0]))\r\n counter+=1\r\n elif counter==1:\r\n z.append(int(i)+int(c[0])+int(b[1])+int(c[2]))\r\n counter+=1\r\n elif counter==2:\r\n z.append(int(i)+int(c[1])+int(b[2]))\r\n counter+=1\r\nfor i in x:\r\n if int(i)%2==0:\r\n k+='1'\r\n else:\r\n k+='0'\r\nfor i in y:\r\n if int(i)%2==0:\r\n l+='1'\r\n else:\r\n l+='0'\r\nfor i in z:\r\n if int(i)%2==0:\r\n m+='1'\r\n else:\r\n m+='0'\r\nprint(k)\r\nprint(l)\r\nprint(m)", "a = [[1, 1, 1], [1, 1, 1],[1, 1, 1]]\nc = []\nfor i in range(3):\n b = list(map(int, input().split()))\n c.append(b)\nfor i in range(len(c)):\n for j in range(len(c)):\n if c[i][j] % 2 != 0:\n if a[i][j] == 0:\n a[i][j] = 1\n else:\n a[i][j] = 0\n if i + 1 < len(a):\n if a[i + 1][j] == 0:\n a[i + 1][j] = 1\n else:\n a[i + 1][j] = 0\n if i - 1 >= 0:\n if a[i - 1][j] == 0:\n a[i - 1][j] = 1\n else:\n a[i - 1][j] = 0\n if j + 1 < len(a):\n if a[i][j + 1] == 0:\n a[i][j + 1] = 1\n else:\n a[i][j + 1] = 0\n if j - 1 >= 0:\n if a[i][j - 1] == 0:\n a[i][j - 1] = 1\n else:\n a[i][j - 1] = 0\nfor i in range(len(a)):\n print(*a[i], sep = '')\n", "def switch(a):\r\n return 0 if a>0 else 1\r\n \r\narr = []\r\nfor i in range(3):\r\n k = list(map(int, input().split()))\r\n k = [i%2 for i in k]\r\n arr.append(k)\r\n \r\nlis = [[1,1,1] for _ in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if arr[i][j]==0:\r\n pass\r\n \r\n else:\r\n check = [(i,j),(i+1,j),(i-1,j),(i,j+1),(i,j-1)]\r\n for x,y in check:\r\n if x<0 or x>2 or y<0 or y>2:\r\n pass\r\n \r\n else:\r\n lis[x][y] = switch(lis[x][y])\r\n \r\nfor i in lis:\r\n print(''.join(map(str,i)))", "a = [[1 for i in range(5)] for k in range(5)]\r\n\r\nfor b in range(1, 4):\r\n d = list(map(int, input().split()))\r\n for e in range(1, 4):\r\n a[b][e] += d[e - 1]\r\n a[b - 1][e] += d[e - 1]\r\n a[b + 1][e] += d[e - 1]\r\n a[b][e - 1] += d[e - 1]\r\n a[b][e + 1] += d[e - 1]\r\n \r\n\r\n\r\nfor r in range(1, 4):\r\n print(\"\".join(list(map(lambda x : str(x % 2), a[r][1:4]))))", "res = [[1, 1, 1, 1, 1] for _ in range(5)]\r\narr = [[0 for _ in range(5)] for _ in range(5)]\r\nfor i in range(3):\r\n arr[i+1] = [0] + list(map(int, input().split())) + [0]\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n if arr[i][j] % 2 == 0: continue\r\n res[i][j] = 0 if res[i][j] == 1 else 1\r\n res[i-1][j] = 0 if res[i-1][j] == 1 else 1\r\n res[i][j-1] = 0 if res[i][j-1] == 1 else 1\r\n res[i+1][j] = 0 if res[i+1][j] == 1 else 1\r\n res[i][j+1] = 0 if res[i][j+1] == 1 else 1\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n print(res[i][j], end='')\r\n print()\r\n\r\n\r\n", "mat=[]\r\nsarr=[]\r\ns=\"\"\r\nfor i in range(3):\r\n a=list(map(int,input().split()))\r\n mat.append(a)\r\nansarr=[[0,0,0],[0,0,0],[0,0,0]]\r\nansarr[0][0]=mat[0][0]+mat[0][1]+mat[1][0]\r\nansarr[0][1]=mat[0][1]+mat[0][2]+mat[1][1]+mat[0][0]\r\nansarr[0][2]=mat[0][2]+mat[0][1]+mat[1][2]\r\nansarr[1][0]=mat[1][0]+mat[0][0]+mat[1][1]+mat[2][0]\r\nansarr[1][1]=mat[1][1]+mat[0][1]+mat[1][0]+mat[1][2]+mat[2][1]\r\nansarr[1][2]=mat[1][2]+mat[0][2]+mat[1][1]+mat[2][2]\r\nansarr[2][0]=mat[2][0]+mat[1][0]+mat[2][1]\r\nansarr[2][1]=mat[2][1]+mat[1][1]+mat[2][0]+mat[2][2]\r\nansarr[2][2]=mat[2][2]+mat[1][2]+mat[2][1]\r\nfor i in range(3):\r\n for j in range(3):\r\n if(ansarr[i][j]%2):\r\n s+=\"0\"\r\n else:\r\n s+=\"1\"\r\n sarr.append(s)\r\n s=\"\"\r\nfor i in sarr:\r\n print(i)", "grid = [[1] * 3 for _ in range(3)] # initialize grid to all lights on\r\n\r\nfor i in range(3):\r\n row = input().split()\r\n for j in range(3):\r\n n = int(row[j])\r\n if n % 2 == 1:\r\n grid[i][j] = 1 - grid[i][j]\r\n if i > 0:\r\n grid[i-1][j] = 1 - grid[i-1][j]\r\n if i < 2:\r\n grid[i+1][j] = 1 - grid[i+1][j]\r\n if j > 0:\r\n grid[i][j-1] = 1 - grid[i][j-1]\r\n if j < 2:\r\n grid[i][j+1] = 1 - grid[i][j+1]\r\n\r\nfor i in range(3):\r\n print(''.join(str(grid[i][j]) for j in range(3)))", "grid = []\nfor i in range(3):\n row = list(map(int, input().split()))\n grid.append(row)\n\nfor i in range(3):\n for j in range(3):\n # Calculate the number of adjacent cells that are pressed\n count = 0\n if i > 0:\n count += grid[i-1][j]\n if i < 2:\n count += grid[i+1][j]\n if j > 0:\n count += grid[i][j-1]\n if j < 2:\n count += grid[i][j+1]\n \n # Toggle the cell if it's pressed an odd number of times\n if (count + grid[i][j]) % 2 == 1:\n print(\"0\", end=\"\")\n else:\n print(\"1\", end=\"\")\n print()\n\n \t\t \t \t \t\t\t\t\t\t \t \t\t\t\t \t", "matrix = [[1,1,1],[1,1,1],[1,1,1]]\r\n\r\ndef solve():\r\n inputList = []\r\n mainList = []\r\n for i in range(3):\r\n inputList += map(int, input().split(' '))\r\n mainList.append(inputList)\r\n inputList = []\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n if mainList[i][j] != 0:\r\n while mainList[i][j]:\r\n toggle(i,j)\r\n\r\n if i-1 > -1:\r\n toggle(i-1,j)\r\n if i+1 < 3:\r\n toggle(i+1,j)\r\n if j-1>-1:\r\n toggle(i,j-1)\r\n if j+1<3:\r\n toggle(i,j+1)\r\n\r\n mainList[i][j] -= 1\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n print(matrix[i][j], end='')\r\n print()\r\n\r\ndef toggle(i,j):\r\n if matrix[i][j] == 0:\r\n matrix[i][j] = 1\r\n elif matrix[i][j] == 1:\r\n matrix[i][j] = 0\r\n\r\nsolve()", "lights = [[True,True,True],[True,True,True],[True,True,True]]\r\nswitches = [list(map(int,input().split())) for i in range(3)]\r\nfor k in range(3):\r\n for j in range(3):\r\n if switches[k][j] % 2 != 0:\r\n lights[k][j] = not lights[k][j]\r\n if k != 0:\r\n lights[k-1][j] = not lights[k-1][j]\r\n if k != 2:\r\n lights[k+1][j] = not lights[k+1][j]\r\n if j != 0:\r\n lights[k][j-1] = not lights[k][j-1]\r\n if j != 2:\r\n lights[k][j+1] = not lights[k][j+1] \r\n \r\nlights_ = [[str(int(i)) for i in light] for light in lights]\r\nfor light_ in lights_:\r\n print(\"\".join(light_))\r\n \r\n \r\n \r\n \r\n \r\n", "import sys\r\nlights = [\r\n [1, 1, 1],\r\n [1, 1, 1],\r\n [1, 1, 1]\r\n]\r\n\r\n\r\ndef toggle(i, j):\r\n if i >= 0 and i <= 2 and j >= 0 and j <= 2:\r\n if lights[i][j] == 0:\r\n lights[i][j] = 1\r\n else:\r\n lights[i][j] = 0\r\n\r\n\r\ni_lights = []\r\nfor _ in range(3):\r\n l = list(map(int, input().split()))\r\n i_lights.append(l)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(i_lights[i][j]):\r\n toggle(i, j)\r\n toggle(i, j+1)\r\n toggle(i, j-1)\r\n toggle(i+1, j)\r\n toggle(i-1, j)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n sys.stdout.write(str(lights[i][j]))\r\n sys.stdout.write('\\n')\r\n", "m = [[1, 1, 1],\r\n [1, 1, 1],\r\n [1, 1, 1]]\r\n\r\nfor i in range(3):\r\n r = input().split()\r\n for j in range(3):\r\n n = int(r[j])\r\n if n % 2 != 0:\r\n m[i][j] = 1 - m[i][j]\r\n if i > 0:\r\n m[i-1][j] = 1 - m[i-1][j]\r\n if i < 2:\r\n m[i+1][j] = 1 - m[i+1][j]\r\n if j > 0:\r\n m[i][j-1] = 1 - m[i][j-1]\r\n if j < 2:\r\n m[i][j+1] = 1 - m[i][j+1]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(m[i][j], end=\"\")\r\n print()\r\n", "a=[[1,1,1],[1,1,1],[1,1,1]]\r\nb=[[0,0,0],[0,0,0],[0,0,0]]\r\n\r\ndef switch(arr,i,j):\r\n if(i==1):\r\n if(j==1):\r\n arr=swtop(arr,i,j)\r\n arr=swbot(arr,i,j)\r\n arr=swleft(arr,i,j)\r\n arr=swright(arr,i,j)\r\n elif(j<1):\r\n arr=swtop(arr,i,j)\r\n arr=swbot(arr,i,j)\r\n arr=swright(arr,i,j)\r\n else:\r\n arr=swtop(arr,i,j)\r\n arr=swbot(arr,i,j)\r\n arr=swleft(arr,i,j)\r\n elif(i<1):\r\n if(j==1):\r\n arr=swbot(arr,i,j)\r\n arr=swleft(arr,i,j)\r\n arr=swright(arr,i,j)\r\n elif(j<1):\r\n arr=swbot(arr,i,j)\r\n arr=swright(arr,i,j)\r\n else:\r\n arr=swbot(arr,i,j)\r\n arr=swleft(arr,i,j)\r\n else:\r\n if(j==1):\r\n arr=swtop(arr,i,j)\r\n arr=swleft(arr,i,j)\r\n arr=swright(arr,i,j)\r\n elif(j<1):\r\n arr=swtop(arr,i,j)\r\n arr=swright(arr,i,j)\r\n else:\r\n arr=swtop(arr,i,j)\r\n arr=swleft(arr,i,j)\r\n return arr\r\n\r\ndef swtop(arr,i,j):\r\n if(arr[i-1][j]==1):\r\n arr[i-1][j]=0\r\n else:\r\n arr[i-1][j]=1\r\n return arr\r\n\r\ndef swbot(arr,i,j):\r\n if(arr[i+1][j]==1):\r\n arr[i+1][j]=0\r\n else:\r\n arr[i+1][j]=1\r\n return arr\r\n\r\ndef swleft(arr,i,j):\r\n if(arr[i][j-1]==1):\r\n arr[i][j-1]=0\r\n else:\r\n arr[i][j-1]=1\r\n return arr\r\n\r\ndef swright(arr,i,j):\r\n if(arr[i][j+1]==1):\r\n arr[i][j+1]=0\r\n else:\r\n arr[i][j+1]=1\r\n return arr\r\n\r\nfor i in range(3):\r\n c=input(\"\").split()\r\n for j in range(3):\r\n if(int(c[j])%2==0):\r\n c[j]=0\r\n else:\r\n c[j]=1\r\n b[i]=c\r\n\r\nfor i in range(len(b)):\r\n for j in range(len(b[i])):\r\n if(b[i][j]==1):\r\n if(a[i][j]==1):\r\n a[i][j]=0\r\n else:\r\n a[i][j]=1\r\n a=switch(a,i,j)\r\n\r\nar=[\"\",\"\",\"\"]\r\nfor i in range(len(a)):\r\n st=\"\"\r\n for e in a[i]:\r\n st+=str(e)\r\n ar[i]=st\r\n\r\nfor d in ar:\r\n print(d)\r\n", "import copy\r\narr=[]\r\nfor i in range(3):\r\n arr.append(list(map(int,input().split())))\r\nfor i in range(3):\r\n for j in range(3):\r\n if arr[i][j]&1==1:\r\n arr[i][j]=1\r\n else:\r\n arr[i][j]=0\r\nres=[[1]*3 for i in range(3)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if arr[i][j]==1:\r\n res[i][j]=res[i][j]^1\r\n if j+1<3: \r\n res[i][j+1]=res[i][j+1]^1\r\n if i+1<3:\r\n res[i+1][j]=res[i+1][j]^1\r\n if i>0:\r\n res[i-1][j]=res[i-1][j]^1\r\n if j>0:\r\n res[i][j-1]=res[i][j-1]^1\r\nfor i in range(3):\r\n for j in range(3):\r\n print(res[i][j],end=\"\")\r\n print()", "def rl():\n\treturn [int(x) for x in input().split(\" \")]\n\nmatrix = [rl(), rl(), rl()]\n\ndef sum_adjacent(matrix, y0, x0):\n\treturn sum(\n\t\tmatrix[y][x]\n\t\tfor x in range(x0 - 1, x0 + 2)\n\t\tfor y in range(y0 - 1, y0 + 2)\n\t\tif x >= 0 and x <= 2 and y >= 0 and y <= 2 and abs(x - x0) + abs(y - y0) <= 1\n\t)\n\nresult = [\n\t[0, 0, 0],\n\t[0, 0, 0],\n\t[0, 0, 0]\n]\n\nfor y in range(3):\n\tfor x in range(3):\n\t\tprint((sum_adjacent(matrix, y, x) + 1) % 2, end=\"\")\n\tprint()\n\n \t\t\t \t \t\t\t \t \t \t\t \t\t\t", "#!/usr/bin/env python3\n\ndef neighbours(i,j):\n\tglobal grid\n\tif i==0:\n\t\tif j == 0:\n\t\t\treturn grid[i][j+1] + grid[i+1][j]\n\t\telif j == 2:\n\t\t\treturn grid[i][j-1] + grid[i+1][j]\n\t\telse:\n\t\t\treturn grid[i][j+1] + grid[i][j-1] + grid[i+1][j]\n\telif i == 1:\n\t\tif j == 0:\n\t\t\treturn grid[i][j+1] + grid[i+1][j] + grid[i-1][j]\n\t\telif j == 2:\n\t\t\treturn grid[i][j-1] + grid[i+1][j] + grid[i-1][j]\n\t\telse:\n\t\t\treturn grid[i][j+1] + grid[i][j-1] + grid[i+1][j] + grid[i-1][j]\n\telif i == 2:\n\t\tif j == 0:\n\t\t\treturn grid[i][j+1] + grid[i-1][j]\n\t\telif j == 2:\n\t\t\treturn grid[i][j-1] + grid[i-1][j]\n\t\telse:\n\t\t\treturn grid[i][j+1] + grid[i][j-1] + grid[i-1][j]\n\t\t\t\nif __name__ == \"__main__\":\n\tgrid = []\n\tnew_grid = [[0 for x in range(3)] for x in range(3)]\n\tfor _ in range(3):\n\t\tgrid.append(list(map(int, input().split())))\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\tnew_grid[i][j] = grid[i][j] + neighbours(i,j)\n\t\t\tif new_grid[i][j] % 2 == 0:\n\t\t\t\tprint(1, end = \"\")\n\t\t\telse:\n\t\t\t\tprint(0, end = \"\")\n\t\tprint(\"\")\n\t#print(new_grid)\n", "def get_ints():\n # a,b,c,d = get_ints()\n return map(int, input().strip().split())\n\ndef get_list():\n return list(map(int, input().strip().split()))\n\ndef get_matrix(rows):\n return [list(map(int, input().strip().split())) for i in range(rows)]\n\nt = get_matrix(3)\n\nx = [[1 for j in range(3)] for i in range(3)]\n\nfor i in range(3):\n for j in range(3):\n toggles = t[i][j]\n if i + 1 in range(3):\n toggles += t[i + 1][j]\n if i - 1 in range(3):\n toggles += t[i - 1][j]\n if j + 1 in range(3):\n toggles += t[i][j + 1]\n if j - 1 in range(3):\n toggles += t[i][j - 1]\n \n if toggles & 1:\n x[i][j] = 0\n else:\n x[i][j] = 1\n print(x[i][j], end='')\n print()\n\n\n\n\n", "a=[]\r\nfor i in range(3):\r\n a.append(input().split(\" \"))\r\nb=[[1,1,1],[1,1,1],[1,1,1]]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if int(a[i][j])%2 == 1 :\r\n for x in range(3):\r\n for y in range(3):\r\n if abs(x-i)+abs(y-j)<2 :\r\n b[x][y]=(b[x][y]+1)%2\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(b[i][j], end=\"\")\r\n print(\"\")\r\n", "p = [[0, 0, 0, 0, 0]]\r\nfor i in range(3):\r\n p.append([0] + list(map(int, input().split())) + [0])\r\np.append([0, 0, 0, 0, 0])\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n print((p[i][j] + p[i - 1][j] + p[i + 1][j] + p[i][j - 1] + p[i][j + 1] + 1) % 2, end='')\r\n print()\r\n", "mat = []\r\nresMat = [[1,1,1],\r\n [1,1,1],\r\n [1,1,1]]\r\n\r\nfor i in range(3):\r\n row = [int(x)%2 for x in input().split()]\r\n mat.append(row)\r\n \r\ndef toogle(n):\r\n if(n==0):\r\n return 1\r\n return 0\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n val = mat[i][j]\r\n if(val==1):\r\n resMat[i][j] = toogle(resMat[i][j]) \r\n if(i+1<3): resMat[i+1][j] = toogle(resMat[i+1][j]) \r\n if(i-1>=0):resMat[i-1][j] = toogle(resMat[i-1][j]) \r\n if(j+1<3):resMat[i][j+1] = toogle(resMat[i][j+1]) \r\n if(j-1>=0):resMat[i][j-1] = toogle(resMat[i][j-1]) \r\n\r\nfor i in resMat:\r\n for j in i:\r\n print(j,end=\"\")\r\n print()", "toggle = []\r\nfor i in range(3):\r\n\ttoggle.append(list(map(int,input().split())))\r\n\r\nl = [[0]*5 for i in range(5)]\r\n\r\nfor i in range(1,4):\r\n\tl[i][1:4] = toggle[i-1]\r\n\t\r\nfor i in range(1,4):\r\n\tfor j in range(1,4):\r\n\t\tprint((1+l[i][j]+l[i][j-1]+l[i-1][j]+l[i+1][j]+l[i][j+1])%2,end = '')\r\n\tprint()", "# Receives matrix and current position as tuple of the form (R,C)\n# as input and returns list of tuples with side-adjacents\ndef get_side_adjacents(matrix, curr_pos):\n m_length = len(matrix[0]) - 1 # Counted from 0\n m_height = len(matrix) - 1 # Counted from 0\n \n # Top left\n if curr_pos[0] == 0 and curr_pos[1] == 0:\n return [(0,1), (1,0)]\n \n # Top right\n elif curr_pos[0] == 0 and curr_pos[1] == m_length:\n return [(0,m_length-1), (1,m_length)]\n \n # bottom left\n elif curr_pos[0] == m_height and curr_pos[1] == 0:\n return [(m_height-1,0), (m_height,1)]\n \n # bottom right\n elif curr_pos[0] == m_height and curr_pos[1] == m_length:\n return [(m_height,m_length-1), (m_height-1, m_length)]\n \n # left corner\n elif curr_pos[1] == 0:\n return [(curr_pos[0]-1, curr_pos[1]), (curr_pos[0] + 1, curr_pos[1]), \n (curr_pos[0], curr_pos[1] + 1)]\n \n # right corner \n elif curr_pos[1] == m_length:\n return [(curr_pos[0]+1, curr_pos[1]),(curr_pos[0]-1, curr_pos[1]),\n (curr_pos[0], curr_pos[1]-1)]\n\n # top corner\n elif curr_pos[0] == 0:\n return [(curr_pos[0], curr_pos[1]-1),(curr_pos[0], curr_pos[1]+1),\n (curr_pos[0]+1, curr_pos[1])]\n \n # bottom corner\n elif curr_pos[0] == m_height:\n return [(curr_pos[0], curr_pos[1]-1),(curr_pos[0], curr_pos[1]+1),\n (curr_pos[0]-1, curr_pos[1])]\n \n # Not on any corner\n else:\n return [(curr_pos[0],curr_pos[1]+1),(curr_pos[0], curr_pos[1]-1),\n (curr_pos[0]+1,curr_pos[1]),(curr_pos[0]-1,curr_pos[1])]\n\n\ndef get_light_state(matrix):\n for i in range(3):\n for j in range(3):\n if matrix[i][j] % 2:\n matrix[i][j] = 0\n else:\n matrix[i][j] = 1\n \n\nmatrix = []\nfor i in range(3):\n inp = input().split()\n inp = [int(x) for x in inp]\n\n matrix.append(inp)\n\n# Create a deep copy of matrix\nmatrix_copy = [x[:] for x in matrix]\n\nfor i in range(3):\n for j in range(3):\n curr_pos = (i,j)\n adjacents = get_side_adjacents(matrix, curr_pos)\n\n for adj in adjacents:\n matrix_copy[adj[0]][adj[1]] += matrix[i][j]\n\n# Change number of presses to on/off state\nget_light_state(matrix_copy)\n\nfor i in range(3):\n curr_line = \"\"\n for j in range(3):\n curr_line += str(matrix_copy[i][j])\n print(curr_line)\n", "grid=[]\r\nfor j in range(3):\r\n \r\n arr=list(map(int,input().split()))\r\n grid.append(arr)\r\n\r\n\r\nsumm=0\r\nn=3\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n summ=grid[i][j]\r\n \r\n if(i-1>=0):\r\n summ=summ+grid[i-1][j]\r\n if(j-1>=0):\r\n summ=summ+grid[i][j-1]\r\n if(i+1<3):\r\n summ=summ+grid[i+1][j]\r\n if(j+1<3):\r\n summ=summ+grid[i][j+1]\r\n \r\n \r\n print(1-summ%2,end='')\r\n print('')\r\n" ]

[ "n=int(input())\r\npr,cnt=0,1\r\nE=0\r\nfor i in range(n):\r\n s=input().split()\r\n a,b=int(s[0][1:3]),int(s[0][4:6])\r\n e='p' in s[1]\r\n a%=12\r\n t=60*a+b+12*60*e\r\n if(t==pr):\r\n E+=1\r\n if(E>10):\r\n cnt+=1\r\n E=1\r\n else:\r\n E=1\r\n if(t<pr):\r\n cnt+=1\r\n pr=t\r\n #print(a,b,e,t)\r\nprint(cnt)\r\n", "def parser(a):\r\n extra=12*60 if a[7]=='p' else 0\r\n a=a[1:6]\r\n hours=(int(a[0]))*10 +int(a[1])\r\n if hours==12:\r\n hours=0\r\n minutes=(int(a[3]))*10 +int(a[4])\r\n extra+=hours*60+minutes\r\n return extra\r\n \r\n\r\nx=[]\r\nfor i in range(int(input())):\r\n s=input()\r\n x.append(parser(s))\r\n\r\nlast=10000\r\nanswer=0\r\ncount=1\r\nfor i in range(len(x)):\r\n if last>x[i]:\r\n answer+=1\r\n count=1\r\n elif x[i]==last:\r\n count+=1\r\n if count==11:\r\n count=1\r\n answer+=1\r\n else:\r\n count=1 \r\n last=x[i]\r\n\r\nprint(answer)", "n = int(input())\nans = 0\n\nprevHr = 26\nprevMin = 26\ncnt = 1\n\nfor _ in range(n):\n\ts = input()[1:10]\n\thr = int(s[:2])\n\tmin = int(s[3:5])\n\tpm = s[-3] == 'p'\n\tif((hr != 12 and pm) or (hr == 12 and not pm)):\n\t\thr = (hr + 12) % 24\n\n\tif(hr < prevHr or (hr == prevHr and min < prevMin)):\n\t\tans += 1\n\tif(prevHr == hr and prevMin == min):\n\t\tcnt += 1\n\telse:\n\t\tcnt = 1\n\tif(cnt > 10):\n\t\tans += 1\n\t\tcnt = 1\n\tprevHr = hr\n\tprevMin = min\n\nprint(ans)\n\n\n\n", "n = int(input())\r\ncur_time = 0\r\nans = 1\r\nrep = 0\r\nfor i in range(n):\r\n s = input()\r\n hour = int(s[1:3])\r\n if hour == 12:\r\n hour = 0\r\n min = int(s[4:6])\r\n is_pm = s[7] == \"p\"\r\n time = hour * 60 + min + (1 if is_pm else 0) * 12 * 60\r\n # print(hour, min, is_pm, time)\r\n if time == cur_time:\r\n if rep == 10:\r\n ans += 1\r\n rep = 1\r\n else:\r\n rep += 1\r\n elif time > cur_time:\r\n cur_time = time\r\n rep = 1\r\n else:\r\n ans += 1\r\n rep = 1\r\n cur_time = time\r\nprint(ans)\r\n", "def gt(a):\r\n hr = a[:2]\r\n mi = a[3:5]\r\n t = a[6]\r\n p = (int(hr)%12)*60+int(mi)\r\n if t == \"p\":\r\n return p + 100000\r\n return p\r\n\r\n\r\nn = int(input())\r\ns = [input()[1:8] for i in range(n)]\r\ncnt = 1\r\nsc = 1\r\nfor i in range(1, n):\r\n\tif s[i] == s[i-1]:\r\n\t\tsc += 1\r\n\t\tif sc == 11:\r\n\t\t\tsc = 1\r\n\t\t\tcnt += 1\r\n\telse:\r\n\t\tsc = 1\r\n\tcnt += (gt(s[i-1]) > gt(s[i]))\r\nprint(cnt)", "# LUOGU_RID: 102111111\ndef main():\r\n n = int(input())\r\n last_time = -1\r\n repeats = 0\r\n days = 1\r\n for _ in range(n):\r\n line = input()\r\n e = line.index(']')\r\n line = line[1:e]\r\n h = int(line[:2])\r\n m = int(line[3:5])\r\n h %= 12\r\n if line[6] == 'p':\r\n h += 12\r\n time = 60 * h + m\r\n if time < last_time or (time == last_time and repeats == 10):\r\n days += 1\r\n repeats = 1\r\n elif time == last_time:\r\n repeats += 1\r\n else:\r\n repeats = 1\r\n last_time = time\r\n print(days)\r\nmain()", "p,c,v=1440,0,0\r\nfor i in range(int(input())):\r\n s=input()\r\n t=60*(int(s[1:3])%12)+int(s[4:6])\r\n if s[7]==\"p\":\r\n t+=720\r\n if t<p:\r\n c=1\r\n v+=1\r\n elif t==p:\r\n c+=1\r\n if c==11:\r\n c=1\r\n v+=1\r\n else:\r\n c=1\r\n p=t\r\nprint(v)" ]

[ "import math, sys\r\n\r\neps = 1e-8\r\nn = int(input())\r\nal = [list(map(int, input().split())) for _ in range(n + 1)]\r\nvp, vs = map(int, input().split())\r\npx, py, pz = map(int, input().split())\r\nal = [(x - px, y - py, z - pz) for x, y, z in al]\r\n\r\nd3 = lambda x, y, z: x*x + y*y + z*z\r\nt0 = 0\r\nrt, pt = None, 0\r\nts = 0\r\n \r\ndef tsol(t):\r\n global rt, pt\r\n if t0 - eps < t < te + eps and (rt is None or rt > t):\r\n rt, pt = t, [(x + a * t) / l for x, a in zip(s, v)]\r\n\r\nfor i in range(n):\r\n c = [y - x for x, y in zip(al[i], al[i + 1])]\r\n ll = d3(*c)\r\n l = ll ** 0.5\r\n ts += l\r\n te = ts / vs\r\n v = [vs * x for x in c]\r\n s = [l * x - a * t0 for x, a in zip(al[i], v)]\r\n a = d3(*v) - vp * vp * ll\r\n b = 2 * sum(x * i for x, i in zip(s, v))\r\n c = d3(*s)\r\n d = b * b - 4 * a * c\r\n fa = abs(a) < eps\r\n\r\n if fa:\r\n if abs(b) > eps:\r\n tsol(-c / b)\r\n elif d > -eps:\r\n if d < eps:\r\n d = 0\r\n a *= 2.0\r\n d **= 0.5\r\n tsol((-b + d) / a)\r\n tsol((-b - d) / a)\r\n \r\n t0 = te\r\n\r\nif rt is None:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(\"%.10f\" % rt)\r\n print(\"%.10f\" % (pt[0] + px), \"%.10f\" % (pt[1] + py), \"%.10f\" % (pt[2] + pz))\r\n" ]