Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "s = input()\r\ns1 = s\r\ns1 = s1.split(\":\")\r\ns1[0] = int(s1[0])\r\ns1[1] = int(s1[1])\r\nwhile(1):\r\n s1[1] += 1\r\n s1[1] = s1[1]%60\r\n if s1[1] == 0:\r\n s1[0] += 1\r\n s1[0] = s1[0]%24\r\n a = str(s1[0])\r\n b = str(s1[1])\r\n if len(a) == 1:\r\n a = \"0\" + a\r\n if len(b) == 1:\r\n b = \"0\" + b\r\n b1 = b[::-1]\r\n if a == b1:\r\n print(a+\":\"+b)\r\n break", "s = input().split(\":\")\r\n\r\n\r\ndef min(p):\r\n while int(p[1]) < 59:\r\n p[1] = [str(int(p[1]) + 1), \"0\" + str(int(p[1]) + 1)][p[1][0] == \"0\" and p[1][1] != \"9\"]\r\n if p[1] == (p[0])[::-1]:\r\n break\r\n\r\n\r\nwhile True:\r\n min(s)\r\n if s[1] == (s[0])[::-1]:\r\n break\r\n else:\r\n x = [str(int(s[0]) + 1), \"0\" + str(int(s[0]) + 1)][s[0][0] == \"0\" and s[0][1] != \"9\"]\r\n s = [x, \"00\"]\r\n min(s)\r\n if s[1] == (s[0])[::-1]:\r\n break\r\n\r\nif s[0] == \"24\":\r\n s = [\"00\", \"00\"]\r\nprint(\":\".join(s))\r\n\r\n\r\n\r\n", "a = [int(i) for i in input().split(\":\")]\r\nc = a[0] * 60 + a[1]\r\nwhile True:\r\n c += 1\r\n c %= (24 * 60)\r\n if str(100 + c // 60)[1:] == str(100 + c % 60)[1:][::-1]:\r\n print(str(100 + c // 60)[1:] + \":\" + str(100 + c % 60)[1:])\r\n break", "s=input()\r\nif s[0]==\"0\":\r\n h=s[1]\r\nelse:\r\n h=s[:2]\r\nif s[3]==\"0\":\r\n m=s[3]\r\nelse:\r\n m=s[3:]\r\ndef pallin(x,y):\r\n if len(x)==1:\r\n x=\"0\"+x\r\n if len(y)==1:\r\n y=\"0\"+y\r\n if x[0]==y[1] and x[1]==y[0]:\r\n return True\r\n else:\r\n return False\r\nwhile(1):\r\n if int(m)+1==60:\r\n h=str((int(h)+1)%24)\r\n m=str(0)\r\n else:\r\n m=str(int(m)+1)\r\n if pallin(h,m):\r\n if len(h)==1:\r\n h=\"0\"+h\r\n if len(m)==1:\r\n m=\"0\"+m\r\n print(h+\":\"+m)\r\n break\r\n \r\n \r\n ", "def is_palindromic(string):\r\n for i in range(0, int(len(string)/2)):\r\n if string[i] != string[len(string)-1-i]:\r\n return False\r\n return True\r\n\r\ndigits = str(input())\r\n\r\nhours = int(digits[0:2])\r\nminutes = int(digits[3:])\r\nwhile True:\r\n minutes += 1\r\n if minutes == 60:\r\n hours += 1\r\n minutes = 0\r\n if hours == 24:\r\n hours = 0\r\n str_hours = str(hours)\r\n str_minutes = str(minutes)\r\n if len(str_hours) == 1:\r\n str_hours = \"0\" + str_hours\r\n if len(str_minutes) == 1:\r\n str_minutes = \"0\" + str_minutes\r\n new_time = str_hours + \":\" + str_minutes\r\n if is_palindromic(new_time):\r\n print(new_time)\r\n break", "s=input()\r\na=int(s[:2])\r\nb=int(s[3:])\r\ncnt=0\r\nwhile(a!=23 or b!=59):\r\n b=b+1\r\n if(b==60):\r\n a=a+1\r\n b=00\r\n x=str(a)\r\n if(len(x)==1):\r\n x=\"0\"+str(a)\r\n y=str(b)\r\n if(len(y)==1):\r\n y=\"0\"+str(b)\r\n e=x+\":\"+y\r\n if(e==e[::-1]):\r\n print(e)\r\n cnt=1\r\n break\r\nif cnt==0:\r\n print(\"00:00\")", "h,m=map(int,input().split(':'))\nwhile 1:\n\tm+=1\n\tif m==60:h+=1;m=0\n\tif h==24:h=0\n\ta=str(h);a='0'*(2-len(a))+a\n\tb=str(m);a+=':'+'0'*(2-len(b))+b\n\tif(a==a[::-1]):print(a);exit()\n\t\t \t\t \t\t\t \t \t\t \t \t\t\t \t", "a, b = map(int, input().split(':'))\r\nif a == 23 and b > 31: print('00:00'); exit()\r\nfor i in range(b+1, 60):\r\n if 11*(a//10+a%10) == a + i:\r\n i = '0'*(a<10) + str(a)\r\n print(i+':'+i[::-1])\r\n exit()\r\nfor i in range(a+1, 24):\r\n for j in range(60):\r\n if 11*(i//10+i%10) == i + j:\r\n j = '0'*(i<10) + str(i)\r\n print(j+':'+j[::-1])\r\n exit()", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef minutes(s):\r\n h, m = s.split(':')\r\n h = int(h)\r\n m = int(m)\r\n return h*60 + m\r\n\r\ndef solve():\r\n s = '00:00,01:10,02:20,03:30,04:40,05:50,10:01,11:11,12:21,13:31,14:41,15:51,20:02,21:12,22:22,23:32'\r\n palindromes = s.split(',')\r\n t = I().strip()\r\n minutes_t = minutes(t)\r\n\r\n i = 0\r\n for j,p in enumerate(palindromes):\r\n if minutes(p) > minutes_t:\r\n i = j\r\n break\r\n print(palindromes[i])\r\n\r\n\r\nsolve()\r\n", "hour,minute = (int(x) for x in input().split(':'))\nwhile True:\n\tminute += 1\n\tif minute == 60:\n\t minute = 0\n\t hour += 1\n\tif hour == 24:\n\t hour = 0\n\tans = '{:02d}:{:02d}'.format(hour,minute)\n\tif ans==ans[::-1]:\n\t print(ans)\n\t break\n\n \t\t\t \t\t\t \t\t \t\t \t\t \t\t\t \t \t\t \t", "time = list(map(int, input().split(\":\")))\n\ndef checkpalindrome(tt):\n hh, mm = tt.split(\":\")\n ispalindrome = True\n for i in range(len(hh)):\n if hh[i] != mm[len(mm) - i - 1]:\n ispalindrome = False\n break\n return ispalindrome\n\nwhile True:\n time[1] += 1\n if time[1]> 59:\n time[1] = time[1] % 60\n time[0] += 1\n if time[0] > 23:\n time[0] = time[0] % 24\n ttc = \"\"\n if len(str(time[0])) == 1:\n ttc += \"0\" + str(time[0])\n else:\n ttc += str(time[0])\n if len(str(time[1])) == 1:\n ttc += \":\" + \"0\" + str(time[1])\n else:\n ttc += \":\" + str(time[1])\n if checkpalindrome(ttc):\n print(ttc)\n break\n", "time = input().split(':')\r\nfirst = time[0]\r\nsecond = time[1]\r\nif second < first[::-1] < '60':\r\n print(f\"{first}:{first[::-1]}\")\r\nelif first == '23':\r\n print('00:00')\r\nelif 15 <= int(first) <= 19:\r\n print('20:02')\r\nelif 5 <= int(first) <= 9:\r\n print('10:01')\r\nelse:\r\n new_first = int(first) + 1\r\n new_first = str(new_first)\r\n if len(str(new_first)) == 1:\r\n new_first = \"0\" + str(new_first)\r\n print(f\"{new_first}:{new_first[::-1]}\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nhh, mm = map(int, input().split(\":\"))\r\nwhile True:\r\n mm += 1\r\n if mm == 60:\r\n hh += 1\r\n mm = 0\r\n if hh == 24:\r\n hh = 0\r\n if hh % 10 == mm // 10 and hh // 10 == mm % 10:\r\n ans = \"\".join(map(str, [hh // 10, hh % 10, \":\", mm // 10, mm % 10]))\r\n break\r\nprint(ans)", "\ndef hourTOminute(s):\n h,m = s.split(\":\") \n return int(h)*60+ int(m)\n\n\n\n\npalin =['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31','14:41','15:51','20:02','21:12','22:22','23:32']\n\nh = input()\nflag = True\nfor i in palin:\n if(hourTOminute(i)> hourTOminute(h)):\n print(i)\n flag = False \n break\n\nif(flag):\n print(palin[0])\n \t\t\t \t \t \t \t\t \t\t\t\t \t \t", "time = input()\r\n\r\n# Convert time to minutes\r\nminutes = int(time[:2]) * 60 + int(time[3:])\r\n\r\n# Iterate over the next 24 hours in minutes\r\nfor i in range(1, 24 * 60 + 1):\r\n next_minutes = (minutes + i) % (24 * 60)\r\n next_time = f\"{next_minutes // 60:02}:{next_minutes % 60:02}\"\r\n if next_time == next_time[::-1]:\r\n print(next_time)\r\n break\r\n", "def to_string(n):\n\tif n<10:\n\t\treturn \"0\"+str(n)\n\treturn str(n)\ndef next(h,m):\n\tm+=1\n\tif m==60:\n\t\tm=0\n\t\th+=1\n\tif h==24:\n\t\th=0\n\treturn h,m\nh,m=map(int,input().split(':'))\nh,m=next(h,m)\nwhile to_string(h)!=to_string(m)[::-1]:\n\th,m=next(h,m)\nprint(\"%s:%s\"%(to_string(h),to_string(m)))\n\t\t \t \t \t\t \t\t \t\t\t\t \t \t", "l = ['00:00', '01:10', '02:20', '03:30', '04:40', '05:50', '10:01', '11:11', '12:21', '13:31', '14:41', '15:51', '20:02', '21:12', '22:22', '23:32']\n\ns = input()\nfor i in l:\n if i > s:\n print(i)\n break\nelse:\n print(l[0])\n\n \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t\t \t\t", "s = input().split(\":\")\r\nwhile True:\r\n s[1] = str(int(s[1]) + 1)\r\n s[1] = '0'+s[1] if len(s[1]) == 1 else s[1]\r\n if s[1] == '60':\r\n s[1] = '00'\r\n s[0] = str(int(s[0]) + 1)\r\n s[0] = '0'+s[0] if len(s[0]) == 1 else s[0]\r\n if s[0] == '24':\r\n s[0] = '00'\r\n if s[0] == s[1][::-1]:\r\n print(\":\".join(s))\r\n break\r\n", "def upper_bound(nums, target):\r\n l, r = 0, len(nums) - 1\r\n while l <= r:\r\n mid = (l + r)//2\r\n if nums[mid] > target:\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return l\r\n \r\nlt = ['00','01','02', '03', '04', '05', '10', '11','12', '13', '14', '15', '20', '21', '22', '23']\r\nmt=[]\r\nfor hr in lt:\r\n k = int(hr)*60 + int(hr[::-1])\r\n mt.append(k)\r\nh,m = input().split(\":\")\r\nh,m = int(h), int(m)\r\n\r\ntot = h*60 + m\r\n\r\nind = upper_bound(mt, tot)\r\nind = (ind)%16\r\n\r\ns = lt[ind] + \":\" + lt[ind][::-1]\r\nprint(s)\r\n", "s = input()\nh = s[0:2]\nm = s[3:5]\n\nwhile True:\n\tif int(m) == 59:\n\t\tm = \"00\"\n\t\tif int(h) == 23:\n\t\t\th = \"00\"\n\t\telse:\n\t\t\th = str(int(h)+1) if int(h)+1 > 9 else \"0\" + str(int(h)+1)\n\telse:\n\t\tm = str(int(m)+1) if int(m)+1 > 9 else \"0\" + str(int(m)+1)\n\n\tif h == m[::-1]:\n\t\tbreak\n\nprint(h+\":\"+m)\n \t\t \t\t \t\t\t \t\t \t \t\t \t\t\t", "def is_palindrome(s):\n return s == s[::-1]\n\nif __name__ == \"__main__\":\n hh, mm = input().split(\":\")\n hh = int(hh)\n mm = int(mm)\n while True:\n mm += 1\n if mm > 59:\n hh += 1\n mm = 0\n if hh > 23:\n hh = 0\n if is_palindrome(f\"{hh:02d}:{mm:02d}\"):\n break\n print(f\"{hh:02d}:{mm:02d}\")\n \t \t\t \t \t\t\t \t\t \t \t\t", "hh, mm = map(int, input().split(\":\"))\n\nwhile True:\n\tmm += 1\n\tif mm == 60:\n\t\thh += 1\n\t\tmm = 0\n\tif hh == 24:\n\t\thh = 0\n\taux = int(hh % 10) * 10 + hh // 10\n\tif aux == mm:\n\t\tbreak\n\t\t\nprint(\"%02d:%02d\" % (hh, mm))\n\n\t \t \t \t\t\t \t \t\t \t \t", "hh,mm=map(int,input().split(':'))\r\nmm+=1\r\nif mm == 60:\r\n hh+=1\r\n mm = 0\r\nif hh == 24:\r\n hh = 0\r\nwhile hh % 10 * 10 + hh // 10 != mm:\r\n mm+=1\r\n if mm == 60:\r\n hh+=1\r\n mm = 0\r\n if hh == 24:\r\n hh = 0\r\nif hh<10:\r\n hh='0'+str(hh)\r\nif mm<10:\r\n mm='0'+str(mm)\r\nprint(hh,\":\",mm,sep=\"\")", "h,m=map(int,input().split(':'))\r\nwhile True:\r\n m+=1\r\n if m==60:\r\n m=0\r\n h+=1\r\n if h==24:\r\n h=0\r\n \r\n\r\n if len(str(h))<2:\r\n soat='0'+str(h)\r\n else:\r\n soat=str(h)\r\n\r\n if len(str(m))<2:\r\n daqiqa='0'+str(m)\r\n else:\r\n daqiqa=str(m)\r\n\r\n vaqt=soat+':'+daqiqa\r\n if vaqt==vaqt[::-1]:\r\n break\r\nprint(vaqt)\r\n", "t = input()\r\nl,r = t.split(':')\r\ntime = ['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31'\r\n,'14:41','15:51','20:02','21:12','22:22','23:32']\r\nfor i in range(len(time)):\r\n #print(time[i])\r\n lt,rt = time[i].split(':')\r\n if lt==l:\r\n if rt<=r:\r\n print(time[(i+1)%16])\r\n break\r\n else:\r\n print(time[i])\r\n break\r\n elif lt>l:\r\n print(time[i])\r\n break\r\n", "def p(s):\r\n\tfor i in range(2):\r\n\t\tif s[i]!=s[~i]:\r\n\t\t\treturn False\r\n\treturn True\r\ns=input().split(':')\r\nwhile True:\r\n\to=int(s[1])+1\r\n\tt=o//60\r\n\to%=60\r\n\ts[0]=('0'+str((int(s[0])+t)%24))[-2:]\r\n\ts[1]=('0'+str(o))[-2:]\r\n\tif p(s[0]+s[1]):\r\n\t\tprint(s[0]+':'+s[1])\r\n\t\tbreak", "x = input()\r\nh = int(x[:2])\r\nm = int(x[3:])\r\n\r\nwhile 1:\r\n m+=1\r\n if m == 60:\r\n h+=1\r\n m = 0\r\n if h == 24:\r\n h = 0\r\n m = str(m).zfill(2)\r\n h = str(h).zfill(2)\r\n res = h+m\r\n if res[::-1] == res:\r\n print(f\"{h}:{m}\")\r\n break\r\n else:\r\n m = int(m)\r\n h = int(h)", "hour,minute = list(map(int,input().split(':')))\r\nwhile True:\r\n\tminute+=1\r\n\tif minute==60:\r\n\t\tminute = 0\r\n\t\thour+=1\r\n\tif hour==24:\r\n\t\thour = 0\r\n\tans = '{:02d}:{:02d}'.format(hour, minute)\r\n\tif ans==ans[-1::-1]:\r\n\t\tprint(ans)\r\n\t\tbreak", "h, m = input().split(\":\")\r\nn = [\r\n \"00\",\r\n \"01\",\r\n \"02\",\r\n \"03\",\r\n \"04\",\r\n \"05\",\r\n \"06\",\r\n \"07\",\r\n \"08\",\r\n \"09\",\r\n \"10\",\r\n \"11\",\r\n \"12\",\r\n \"13\",\r\n \"14\",\r\n \"15\",\r\n \"16\",\r\n \"17\",\r\n \"18\",\r\n \"19\",\r\n \"20\",\r\n \"21\",\r\n \"22\",\r\n \"23\",\r\n \"24\",\r\n \"25\",\r\n \"26\",\r\n \"27\",\r\n \"28\",\r\n \"29\",\r\n \"30\",\r\n \"31\",\r\n \"32\",\r\n \"33\",\r\n \"34\",\r\n \"35\",\r\n \"36\",\r\n \"37\",\r\n \"38\",\r\n \"39\",\r\n \"40\",\r\n \"41\",\r\n \"42\",\r\n \"43\",\r\n \"44\",\r\n \"45\",\r\n \"46\",\r\n \"47\",\r\n \"48\",\r\n \"49\",\r\n \"50\",\r\n \"51\",\r\n \"52\",\r\n \"53\",\r\n \"54\",\r\n \"55\",\r\n \"56\",\r\n \"57\",\r\n \"58\",\r\n \"59\",\r\n]\r\nhn, mn = int(h), int(m)\r\nwhile True:\r\n mn += 1\r\n if mn == 60:\r\n mn = 0\r\n hn += 1\r\n if hn == 24:\r\n hn = 0\r\n h = n[hn]\r\n m = n[mn]\r\n if h == m[::-1]:\r\n print(\"{}:{}\".format(h, m))\r\n break\r\n", "\r\nh,m=map(int,input().split(\":\"))\r\n\r\nt=h*60+m\r\n\r\nfor i in range(1000):\r\n t=(t+1)%(24*60)\r\n h=t//60\r\n m=t%60\r\n s=\"0\"*(1-int(h>=10))+str(h)+\":\"+\"0\"*(1-int(m>=10))+str(m)\r\n\r\n if s==s[::-1]:\r\n print(s)\r\n break", "import datetime\r\ndef fix(s):\r\n if len(s) < 5:\r\n return \"0\"+s\r\n return s\r\nhours, minutes = map(int,input().split(\":\"))\r\none = datetime.timedelta(minutes=1)\r\nday = datetime.timedelta(days=1)\r\ncurrent = datetime.timedelta(hours=hours,minutes=minutes) + one\r\nif current == day:\r\n print(\"00:00\")\r\n quit()\r\nwhile fix(str(current)[:-3]) != fix(str(current)[:-3])[::-1]:\r\n if current == day:\r\n print(\"00:00\")\r\n quit() \r\n current+=one\r\nprint(fix(str(current)[:-3]))", "time = input()\ntime = time.split(\":\")\nhour = int(time[0])\nminute = int(time[1])\n# print(hour,type(minute))\nwhile (True):\n minute = int(minute) + 1\n if minute > 59:\n minute = 0\n hour = int(hour) + 1\n if hour == 24:\n hour = 0\n hour = str(hour)\n minute = str(minute)\n\n if len(hour) == 2:\n time = str(hour)\n else:\n time = \"0\"\n time += hour\n time+=\":\"\n if len(minute) == 2:\n time += minute\n else:\n time += \"0\"\n time += minute\n if time[0] == time[4] and time[1] == time[3]:\n print(time)\n break", "palindromes = ['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31','14:41','15:51','20:02','21:12','22:22','23:32']\r\nt = input()\r\ncheck = 0\r\nfor i in range(16):\r\n if int(t[:2])==int(palindromes[i][:2]):\r\n check = 1\r\n if int(t[3:])>=int(palindromes[i][3:]):\r\n if i==15:\r\n print('00:00')\r\n else:\r\n print(palindromes[i+1])\r\n else:\r\n print(palindromes[i])\r\nif check==0:\r\n for i in range(16):\r\n if int(t[:2])<int(palindromes[i][:2]):\r\n print(palindromes[i])\r\n break\r\n", "def is_palindrome(s):\r\n return s == s[::-1]\r\n\r\ndef find_next_palindrome_time(input_time):\r\n hh, mm = map(int, input_time.split(':'))\r\n total_minutes = hh * 60 + mm\r\n\r\n while True:\r\n total_minutes = (total_minutes + 1) % (24 * 60)\r\n hh, mm = divmod(total_minutes, 60)\r\n hh_str = str(hh).zfill(2)\r\n mm_str = str(mm).zfill(2)\r\n time_str = f\"{hh_str}:{mm_str}\"\r\n\r\n if is_palindrome(time_str):\r\n return time_str\r\n\r\ninput_time = input().strip()\r\nnext_palindrome_time = find_next_palindrome_time(input_time)\r\nprint(next_palindrome_time)\r\n", "h, m = (int(x) for x in input().split(':'))\r\n \r\nwhile(1):\r\n\tm += 1\r\n\tif m == 60:\r\n\t\tm = 0\r\n\t\th += 1\r\n\tif h == 24:\r\n\t\th = 0\r\n\ts = '{:02d}:{:02d}'.format(h, m)\r\n\tif s == s[::-1]:\r\n\t\tprint(s)\r\n\t\tbreak", "def is_palindrome(s):\r\n return s == s[::-1]\r\n\r\ntime = input().strip()\r\nhh, mm = map(int, time.split(':'))\r\n\r\nwhile True:\r\n mm += 1\r\n if mm == 60:\r\n mm = 0\r\n hh = (hh + 1) % 24\r\n\r\n time = f\"{hh:02d}:{mm:02d}\"\r\n if is_palindrome(time):\r\n print(time)\r\n break", "#https://codeforces.com/problemset/problem/108/A\nt=input()\nh=int(t[0:2])\nm=int(t[3:])\ns=\"\"\nwhile True:\n\tm+=1\n\tif m>59:\n\t\tm=0\n\t\th+=1\n\tif h>23:\n\t\th=0\n\ts=\"\"\n\tif h<10:\n\t\ts=s+\"0\"\n\ts=s+str(h)+\":\"\n\tif m<10:\n\t\ts=s+\"0\"\n\ts=s+str(m)\n\tif s==s[::-1]:\n\t\tbreak\nprint(s)\n", "hh, mm = map(int, input().split(':'))\r\n\r\nwhile True:\r\n mm += 1\r\n if mm == 60:\r\n hh += 1\r\n mm = 0\r\n if hh == 24:\r\n hh = 0\r\n if hh % 10 * 10 + hh // 10 == mm:\r\n break\r\n\r\nprint(f\"{hh:02d}:{mm:02d}\")\r\n", "time = str(input())\r\ndef increase(hour, minute):\r\n hour, minute = int(hour), int(minute)\r\n minute += 1\r\n if minute == 60:\r\n minute = 0\r\n hour += 1\r\n if hour == 24:\r\n hour = 0\r\n hour, minute = str(hour), str(minute)\r\n if len(hour) != 2:\r\n hour = '0' + hour\r\n if len(minute) != 2:\r\n minute = '0' + minute\r\n return hour, minute\r\ndef palindrome(s):\r\n p1, p2 = 0, len(s) - 1\r\n while p1 < p2:\r\n if s[p1] != s[p2]:\r\n return False\r\n p1 += 1\r\n p2 -= 1\r\n return True\r\nhour, minute = time[: 2], time[3: 5]\r\nhour, minute = increase(hour, minute)\r\nwhile palindrome(hour + minute) == False:\r\n hour, minute = increase(hour, minute)\r\nprint(hour + \":\" + minute)\r\n", "Hour, Minute = input().split(\":\")\r\nHour = (int(Hour) if int(\"\".join(reversed(Hour))) > int(Minute) else (int(Hour) + 1) % 24)\r\nif Hour in range(6, 10) or Hour in range(16, 20):\r\n Hour = ((Hour + 4) // 10) * 10\r\nprint(str(Hour).rjust(2, \"0\") + \":\" + \"\".join(reversed(str(Hour).rjust(2, \"0\"))))", "s=input()\nh=int(s[0:2])\nm=int(s[3:5])\nwhile(1):\n\tm+=1\n\tif m==60:\n\t\th+=1\n\t\tm=0\n\t\tif h==24:\n\t\t\th=0\n\ta=str(h)\n\tb=str(m)\n\tif len(a)==1:\n\t\ta='0'+a\n\tif len(b)==1:\n\t\tb='0'+b\n\tif b[::-1]==a:\n\t\tprint(a+':'+b)\n\t\tbreak", "h,m=map(int,input().split(':'))\r\nwhile 1:\r\n\tm+=1\r\n\tif m==60:\r\n\t h+=1;\r\n\t m=0\r\n\tif h==24:\r\n\t h=0\r\n\ta=str(h);\r\n\ta='0'*(2-len(a))+a\r\n\tb=str(m)\r\n\ta+=':'+'0'*(2-len(b))+b\r\n\tif(a==a[::-1]):\r\n\t print(a);\r\n\t exit()\r\n ", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ns=input()\r\nh=int(s[0:2])\r\nm=int(s[3:])\r\nfor i in range(1000):\r\n\tm+=1\r\n\tif m==60:\r\n\t\th+=1\r\n\t\tif h==24:\r\n\t\t\th=0\r\n\t\tm=0\r\n\ts=str(h).zfill(2)+\":\"+str(m).zfill(2)\r\n\tif s==s[::-1]:\r\n\t\tprint(s)\r\n\t\tbreak", "Hour, Minute = input().split(\":\")\r\nHour = (int(Hour) if int(\"\".join(reversed(Hour))) > int(Minute) else (int(Hour) + 1) % 24)\r\nif Hour in range(6, 10) or Hour in range(16, 20):\r\n Hour = ((Hour + 4) // 10) * 10\r\nprint(str(Hour).rjust(2, \"0\") + \":\" + \"\".join(reversed(str(Hour).rjust(2, \"0\"))))\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: 641\r\n", "h,m=map(int,input().split(\":\"))\nfor i in range(0,1440):\n\tm+=1\n\tif(m>59):\n\t\tm%=60\n\t\th+=1\n\tif(h>23):\n\t\th%=24\n\tif(h==0 and m==0):\n\t\tprint(\"00:00\")\n\t\tbreak\n\tif(m<10):\n\t\tif(str(h)==str(m)+\"0\"):\n\t\t\tprint(str(h)+\":0\"+str(m))\n\t\t\tbreak\n\telif(h<10):\n\t\tif(\"0\"+str(h)==str(m)[::-1]):\n\t\t\tprint(\"0\"+str(h)+\":\"+str(m))\n\t\t\tbreak\n\telif(str(h)==str(m)[::-1]):\n\t\tprint(str(h)+\":\"+str(m))\n\t\tbreak\n", "n = input()\r\nh = int(n[:2])\r\nm = int(n[3:])\r\nwhile True:\r\n m+=1\r\n if m==60:\r\n m=0\r\n h+=1\r\n if h==24:\r\n h=0\r\n a=str(h)\r\n b=str(m)\r\n if len(a)==1:\r\n a='0'+a\r\n if len(b)==1:\r\n b='0'+b\r\n if a==b[::-1]:\r\n print(a+':'+b)\r\n break", "a,b=map(str,input().split(':'))\r\nif a[0]=='0':\r\n list(a).remove(a[0])\r\nif b[0]=='0':\r\n list(b).remove(b[0])\r\na=int(a)\r\nb=int(b)\r\nif a==23 and b>=32:\r\n print('00:00')\r\nelif (a==0 and b<=59)or(a==1 and b<=9):\r\n print('01:10')\r\nelif (a==1 and b>=10)or(a==2 and b<=19):\r\n print('02:20')\r\nelif (a==2 and b>=20)or(a==3 and b<=29):\r\n print('03:30')\r\nelif (a==3 and b>=30)or(a==4 and b<=39):\r\n print('04:40')\r\nelif (a==4 and b>=40)or(a==5 and b<=49):\r\n print('05:50')\r\nelif (a==5 and b>=50)or(6<=a<=9 and b<=59)or(a==10 and b==1):\r\n print('10:01')\r\nelif (a==10 and b>=1)or(a==11 and b<=10):\r\n print('11:11')\r\nelif (a==11 and b>=11)or(a==12 and b<=20):\r\n print('12:21')\r\nelif (a==12 and b>=21)or(a==13 and b<=30):\r\n print('13:31')\r\nelif (a==13 and b>=31)or(a==14 and b<=40):\r\n print('14:41')\r\nelif (a==14 and b>=41)or(a==15 and b<=50):\r\n print('15:51')\r\nelif (a==15 and b>=51)or(16<=a<=19 and b<=59)or(a==20 and b==2):\r\n print('20:02')\r\nelif (a==20 and b>=2)or(a==21 and b<=11):\r\n print('21:12')\r\nelif (a==21 and b>=12)or(a==22 and b<=21):\r\n print('22:22')\r\nelse:\r\n print('23:32')", "#é Feio? é. Mas não estou achando o erro. Se der depois eu volto\ntime = ['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31','14:41','15:51', '20:02', '21:12', '22:22', '23:32']\n\ntest = input()\n\nfor i in time:\n if i > test:\n print(i)\n exit()\n\nprint(time[0])\n \t\t \t\t\t\t\t \t \t \t \t \t", "def main():\r\n H,M = map(int, input().split(':'))\r\n while True:\r\n M += 1\r\n if M == 60:\r\n M = 0\r\n H += 1\r\n if H == 24:\r\n H = 0\r\n string = '{:02d}:{:02d}'.format(H, M)\r\n if string == string[::-1]:\r\n print(string)\r\n break\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "h, m = map(int, input().split(\":\"))\r\n\r\nwhile True:\r\n m += 1\r\n if m >= 60:\r\n m = 0\r\n h += 1\r\n if h >= 24:\r\n h = 0\r\n\r\n if str(h).zfill(2) == str(m).zfill(2)[::-1]:\r\n break\r\n\r\npalindromic_time = f\"{str(h).zfill(2)}:{str(m).zfill(2)}\"\r\nprint(palindromic_time)", "pal_time = ['00:00', '01:10', '02:20', '03:30', '04:40', '05:50', '10:01', '11:11', '12:21', '13:31', '14:41', '15:51',\r\n '20:02', '21:12', '22:22', '23:32']\r\ntime = input()\r\nflag = False\r\nfor t in pal_time:\r\n if t > time:\r\n print(t)\r\n flag = True\r\n break\r\nif not flag:\r\n print(pal_time[0])\r\n", "h,m = input().split(':')\nhi = int(h)\nmi = int(m)\nrh = int(h[::-1])\nadd = hi\ndef fet(s):\n d = str(s)\n if len(str(s)) == 1:\n d = \"0\" + str(s)\n return d\nif rh >= 60 or rh <= mi:\n add += 1\n if add >= 24:\n add = add - 24 \n while int(fet(add)[::-1]) >= 60:\n if add >= 24:\n add = add - 24\n add += 1\nf = str(add)\nif len(f) == 1:\n f = \"0\" + str(add)\nprint(f\"{f}:{f[1] + f[0]}\")", "def readln(inp=None): return tuple(map(int, (inp or input()).split()))\n\nstart = input()\nans = None\nfor h in range(24):\n for m in range(60):\n var = '%02d:%02d' % (h, m)\n if var == ''.join(reversed(list(var))) and var > start:\n ans = var\n break\n if ans:\n break\nprint(ans if ans else '00:00')\n", "def main():\r\n h, m = input().split(':')\r\n \r\n hint, mint = int(h), int(m)\r\n if hint < 23:\r\n rev = h[::-1]\r\n revint = int(rev)\r\n if mint < revint and revint < 60:\r\n print('{}:{}'.format(h,rev))\r\n else:\r\n nxth = hint + 1\r\n while 6 <= nxth % 10 <= 9:\r\n nxth += 1\r\n nxthstr = str(nxth)\r\n if len(nxthstr) == 1:\r\n nxthstr = '0' + nxthstr\r\n\r\n print('{}:{}'.format(nxthstr, nxthstr[::-1]))\r\n else:\r\n if mint < 32:\r\n print('23:32')\r\n else:\r\n print('00:00')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "time = input()\n\nh, m = time[:2], time[3:]\n# print(h, m)\nwhile True:\n if int(m) == 59:\n m = '00'\n if int(h) < 23:\n h = str(int(h)+1)\n if len(h) == 1:\n h = '0'+h\n else:\n h = '00'\n\n else:\n m = str(int(m)+1)\n if len(m) == 1:\n m = '0'+m\n\n num = h+m\n # print(num)\n\n if num == num[::-1]:\n print(h+\":\"+m)\n break\n", "# python 3\n\"\"\"\n\"\"\"\n# from operator import itemgetter\n\n\ndef palindromic_times(time_str) -> None:\n hours, minutes = list(map(int, time_str.split(\":\")))\n # print(hours, minutes)\n while True:\n minutes += 1\n if minutes == 60:\n hours += 1\n minutes = 0\n if hours == 24:\n hours = 0\n minutes_str = str(minutes)\n hours_str = str(hours)\n if len(minutes_str) == 1:\n minutes_str = \"0\" + minutes_str\n if len(hours_str) == 1:\n hours_str = \"0\" + hours_str\n if hours_str[0] == minutes_str[1] and hours_str[1] == minutes_str[0]:\n break\n\n return hours_str + \":\" + minutes_str\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n\n time = input()\n print(palindromic_times(time))\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Feb 8 14:57:51 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\nh = input()\r\nlis = []\r\nfor i in range(3):\r\n for j in range(6):\r\n lis.append(f'{i}{j}:{j}{i}')\r\nlis = lis[:16]\r\n\r\nif int(h[:2])==23:\r\n if int(h[3:])>32:\r\n print(lis[0])\r\n \r\n else:\r\n print(lis[-1])\r\nelse: \r\n\r\n for i in lis:\r\n if int(i[:2])==int(h[:2]):\r\n if int(i[3:])>int(h[3:]):\r\n print(i)\r\n break\r\n elif int(i[:2])>int(h[:2]):\r\n print(i)\r\n break\r\n \r\n \r\n \r\n ", "n = int(\"\".join(input().split(\":\")))\r\ns = [\"0110\",\"0220\",\"0330\",\"0440\",\"0550\",\"1001\",\"1111\",\"1221\",\"1331\",\"1441\",\"1551\",\"2002\",\"2112\",\"2222\",\"2332\",\"0000\"]\t\t\r\nb = 0\r\nfor i in range(len(s)):\r\n\tif n<int(s[i]):\r\n\t\tb = s[i]\r\n\t\tbreak\r\n\r\nif b:\r\n\tprint(b[0:2]+\":\"+b[2::])\r\nelse:\r\n\tprint(s[-1][0:2]+\":\"+s[-1][2::])\r\n\r\n", "s = input().split(\":\")\r\nh, m = s[0], s[1]\r\nfor i in range(1440):\r\n m = str(int(m) + 1)\r\n h = str(int(h) + int(m) // 60)\r\n m = str(int(m) % 60)\r\n h = str(int(h) % 24)\r\n if len(m) == 1:\r\n m = \"0\" + m\r\n if len(h) == 1:\r\n h = \"0\" + h\r\n if h == m[::-1]:\r\n break\r\nprint(f\"{h}:{m}\")\r\n", "from datetime import datetime, timedelta\r\ns = input()\r\ns = datetime.strptime(s, '%H:%M')\r\nwhile True:\r\n s = s + timedelta(minutes=1)\r\n s = s.strftime('%H:%M')\r\n if s == s[::-1]:\r\n print(s)\r\n quit()\r\n s = datetime.strptime(s, '%H:%M')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nh, m = map(int, input()[:-1].split(\":\"))\r\nd = [0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412, 1440]\r\n\r\ns = h*60+m+1\r\nfor i in d:\r\n if s <= i:\r\n print('%02d:%02d' % (i//60 if i!= 1440 else 0, i%60))\r\n break", "def is_palindrome(string):\n if string == string[::-1]:\n return True\n else:\n return False\n\n\ndef add_minute(time_str, number):\n hour = int(time_str[:2])\n minute = int(time_str[3:])\n if minute + number < 60:\n minute += number\n else:\n minute = minute + number - 60\n if hour < 23:\n hour += 1\n else:\n hour = 0\n return \"{0}{1}:{2}{3}\".format(\"0\" if hour < 10 else \"\", hour,\n \"0\" if minute < 10 else \"\", minute)\n\ntime = add_minute(input(), 1)\nwhile not is_palindrome(time):\n time = add_minute(time, 1)\n\nprint(time)\n\n", "hh , mm = input().split(\":\")\r\n\r\ndef adelante(hh, mm):\r\n mmp1 = int(mm) + 1\r\n mm = str((int(mm) + 1)%60)\r\n mmp2 = mmp1//60\r\n hh = str((int(hh) + mmp2)%24)\r\n if len(hh) <2 :\r\n hh= \"0\"+hh\r\n if len(mm) <2 : \r\n mm = \"0\"+ mm\r\n return hh, mm\r\n\r\ndef palindromo(hh, mm):\r\n if hh == mm[::-1]:\r\n return True\r\n else:\r\n return False\r\nhh, mm = adelante(hh,mm)\r\n\r\nwhile not palindromo(hh, mm):\r\n hh, mm = adelante(hh, mm)\r\n\r\nprint(hh + \":\" + mm)", "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#################################################\ndef isPalindrome(h,m):\n return str(h)==str(m)[::-1]\nh,m= map(int, input().split(':'))\nh1,m1=h,m\nwhile 1:\n m1+=1\n if m1==60:\n m1=0\n h1+=1\n if h1==24:\n h1=0\n h2=str(h1)\n m2=str(m1)\n if len(h2)==1:\n h2='0'+h2\n if len(m2)==1:\n m2='0'+m2\n if isPalindrome(h2,m2):\n print(h2+':'+m2)\n break\n\n", "s=input()\r\nh=int(s[:2])\r\n\r\nm=int(s[3:])\r\n\r\nmm=int(s[1]+s[0])\r\nif h==6 or h==7:\r\n print(\"10\"+':'+\"01\")\r\nelif h==8 or h==9:\r\n print(\"10\"+':'+\"01\")\r\nelif h==16 or h==17:\r\n print(\"20:02\")\r\nelif h==18 or h==19:\r\n print(\"20:02\")\r\nelif h==5 and m>49:\r\n print(\"10:01\")\r\nelif h==15 and m>50:\r\n print(\"20:02\")\r\nelse:\r\n \r\n if m<mm:\r\n print(s[0]+s[1]+':'+str(mm))\r\n else:\r\n h=(h+1)%24;\r\n \r\n if(h<10):\r\n h='0'+str(h)\r\n print(h+':'+h[1]+h[0])\r\n else:\r\n t=str(h)\r\n print(t+':'+t[1]+t[0])\r\n \r\n", "h, m = input().split(':')\r\nh, m = int(h), int(m)\r\nflag = False\r\npal = 0\r\n\r\nfor i in range(h, 24):\r\n for j in range(0, 60):\r\n if i < 10:\r\n hour = str('0' + str(i))\r\n else:\r\n hour = str(i)\r\n if j < 10:\r\n minute = str('0' + str(j))\r\n else:\r\n minute = str(j)\r\n time = hour + minute\r\n if time == time[::-1] and ((i == h and j > m) or (i > h)):\r\n pal = hour\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n\r\nif flag:\r\n pal = str(pal)\r\n print(pal + ':' + pal[::-1])\r\nelse:\r\n print('00:00')\r\n", "x,y=map(int,input().split(':'))\r\nfor i in range(1,24*60):\r\n k=(x+(i+y)//60)%24\r\n z=(i+y)%60\r\n s=str(k)+':'+str(z)\r\n if(len(str(k))==1):\r\n s='0'+str(k)+':'+str(z)\r\n if(len(str(z))==1):\r\n s=str(k)+':'+'0'+str(z)\r\n if(len(str(k))==1 and len(str(z))==1):\r\n s='0'+str(k)+':'+'0'+str(z)\r\n if(s==s[::-1]):\r\n print(s)\r\n break", "hh,mm = input().split(':')\r\nhh_rev = hh[::-1]\r\nif int(hh) == 23 and int(mm) >= 32:\r\n print('00:00')\r\nelif int(hh) in [6,7,8,9] or (int(hh)==5 and int(mm)>=50):\r\n print('10:01')\r\nelif int(hh) in [16,17,18,19] or (int(hh)==15 and int(mm)>=51):\r\n print('20:02')\r\nelif int(mm) >= int(hh_rev):\r\n print(hh[0]+str(int(hh[1])+1) + ':' + str(int(hh[1])+1) + hh[0])\r\nelse:\r\n print(hh + ':' +hh_rev)", "\n\ndef main():\n horario = input()\n \n for i in range(24):\n for j in range(60):\n if (i==int(horario[0:2]) and j > int(horario[3:])) or (i>int(horario[0:2])):\n if(i < 10):\n hora = \"0\"+str(i)\n else:\n hora = str(i)\n if (j < 10):\n minuto = \"0\"+str(j)\n else:\n minuto = str(j)\n if (minuto == hora[1]+hora[0]):\n print(f\"{hora}:{minuto}\")\n return\n print(\"00:00\")\nmain()\n \t\t \t \t \t \t \t \t\t\t\t\t\t", "n = input()\r\nvalue1 = int(n[1])\r\nvalue2 = int(n[3])\r\nans = n\r\nif value1 < 5:\r\n\tforward = 0\r\n\t\r\n\tif value1 >= value2:\r\n\t\tif int(n[1]) == int(n[3]):\r\n\t\t\tif int(n[4]) >= int(n[0]):\r\n\t\t\t\tforward = 1\r\n\t\t\telse:\r\n\t\t\t\tforward = 0\r\n\t\t\t\tans = ans[:4] + ans[0]\r\n\t\telse:\r\n\t\t\tans = ans[:3] + ans[1] + ans[0]\r\n\telse:\r\n\t\tforward = 1\r\n\tif value1 == 3 and int(n[0]) == 2:\r\n\t\tif int(n[3]) >= 3 and int(n[4])>=2:\r\n\t\t\tans = \"00:00\"\r\n\t\t\tforward = 0\r\n\tif forward == 1:\r\n\t\tadd = int(ans[1]) + 1\r\n\t\tans = ans[:1] + str(add) + ans[2:3] + str(add) + ans[:1]\r\nelse:\r\n\tadd = int(ans[0])+1\r\n\tans = str(add) + \"0:0\" + str(add)\r\nprint(ans)", "h, m = map(int, input().split(':'))\n\ndef next():\n global h, m;\n m+=1;\n if m == 60:\n h+=1\n m = 0\n if h == 24:\n h = 0\n\ndef rj(n):\n s = ''\n if n < 10:\n s += '0'\n return s + str(n)\n\nnext()\nwhile rj(h)+rj(m) != (rj(h)+rj(m))[::-1]:\n next()\n\nprint(rj(h)+':'+rj(m))\n", "s = input().split(':')\r\nres = ''\r\n\r\nif(s[0]=='00'):\r\n\tprint('01:10')\r\nelif(s[0]=='01'):\r\n\tif(int(s[1]) < 10):\r\n\t\tprint('01:10')\r\n\telse:\r\n\t\tprint('02:20')\r\nelif(s[0]=='02'):\r\n\tif(int(s[1]) < 20):\r\n\t\tprint('02:20')\r\n\telse:\r\n\t\tprint('03:30')\r\nelif(s[0]=='03'):\r\n\tif(int(s[1]) < 30):\r\n\t\tprint('03:30')\r\n\telse:\r\n\t\tprint('04:40')\r\nelif(s[0] == '04'):\r\n\tif(int(s[1]) < 40):\r\n\t\tprint('04:40')\r\n\telse:\r\n\t\tprint('05:50')\r\nelif(s[0] == '05'):\r\n\tif(int(s[1]) < 50):\r\n\t\tprint('05:50')\r\n\telse:\r\n\t\tprint('10:01')\r\nelif(s[0] == '06' or s[0] == '07' or s[0] == '08' or s[0] == '09'):\r\n\tprint('10:01')\r\nelif(s[0] == '10'):\r\n\tif(int(s[1]) < 1):\r\n\t\tprint('10:01')\r\n\telse:\r\n\t\tprint('11:11')\r\nelif(s[0] == '11'):\r\n\tif(int(s[1]) < 11):\r\n\t\tprint('11:11')\r\n\telse:\r\n\t\tprint('12:21')\r\nelif(s[0] == '12'):\r\n\tif(int(s[1]) < 21):\r\n\t\tprint('12:21')\r\n\telse:\r\n\t\tprint('13:31')\r\nelif(s[0] == '13'):\r\n\tif(int(s[1]) < 31):\r\n\t\tprint('13:31')\r\n\telse:\r\n\t\tprint('14:41')\r\nelif(s[0] == '14'):\r\n\tif(int(s[1]) < 41):\r\n\t\tprint('14:41')\r\n\telse:\r\n\t\tprint('15:51')\r\nelif(s[0] == '15'):\r\n\tif(int(s[1]) < 51):\r\n\t\tprint('15:51')\r\n\telse:\r\n\t\tprint('20:02')\r\nelif(s[0] == '16' or s[0] =='17' or s[0] == '18' or s[0]=='19'):\r\n\tprint('20:02')\r\nelif(s[0]=='20'):\r\n\tif(int(s[1]) < 2):\r\n\t\tprint('20:02')\r\n\telse:\r\n\t\tprint('21:12')\r\nelif(s[0] == '21'):\r\n\tif(int(s[1]) < 12):\r\n\t\tprint('21:12')\r\n\telse:\r\n\t\tprint('22:22')\r\nelif(s[0] == '22'):\r\n\tif(int(s[1]) < 22):\r\n\t\tprint('22:22')\r\n\telse:\r\n\t\tprint('23:32')\r\nelif(s[0] == '23'):\r\n\tif(int(s[1])<32):\r\n\t\tprint('23:32')\r\n\telse:\r\n\t\tprint('00:00')\r\n\r\n\r\n\r\n", "h, m = input().split(sep=':')\r\nx = int(h) * 60 + int(m) + 1\r\n\r\nwhile True:\r\n new_h = x // 60\r\n if new_h >= 24:\r\n new_h = 0\r\n new_m = x % 60\r\n \r\n s = '%.2d' % new_h + ':' + '%.2d' % new_m\r\n \r\n if s == s[::-1]:\r\n h = '%.2d' % new_h\r\n m = '%.2d' % new_m\r\n break\r\n else:\r\n x += 1\r\n\r\nprint(h, ':', m, sep='')", "h, m = [int(x) for x in input().split(':')]\r\nfor x in range((h * 60 + m) + 1, 24 * 60):\r\n hh, mm = x // 60, x % 60\r\n if f'{hh:02}' == ''.join(reversed(f'{mm:02}')):\r\n print(f'{hh:02}:{mm:02}')\r\n break\r\nelse:\r\n print('00:00')", "def check(t):\r\n if t[0] == t[-1] and t[1] == t[-2]:\r\n return True\r\n else:\r\n return False\r\n\r\ndef format(t):\r\n if t < 10:\r\n return \"0\"+str(t)\r\n else:\r\n return str(t)\r\n\r\ntime = input()\r\nhour = int(time[:2])\r\nminute = int(time[3:])\r\ndone = False\r\nfor h in range(hour, 24, 1):\r\n if h == hour:\r\n iterable = range(minute+1, 60, 1)\r\n else:\r\n iterable = range(60)\r\n \r\n for m in iterable:\r\n formath, formatm = format(h), format(m)\r\n if check(formath + formatm):\r\n print(f\"{formath}:{formatm}\")\r\n done = True\r\n break\r\n if done:\r\n break\r\n\r\nif not done:\r\n print(\"00:00\")\r\n", "h , m = input().split(\":\")\nh , m = int(h) , int(m)\n\nflag = False\ntth , ttm = h , m\nwhile(tth < 24):\n while(ttm < 59 ):\n ttm += 1\n tm = \"0\" * ( 2 - len(str(ttm)) ) + str(ttm)\n th = \"0\" * ( 2 - len(str(tth)) ) + str(tth)\n res = th + \":\" + tm\n if res == res[-1::-1]:\n print(res)\n flag = True\n break\n if flag:\n break\n ttm = 0\n tth += 1\n\nif not flag:\n print(\"00:00\")\n\t\t\t\t\t\t\t\t\t \t\t \t \t\t \t \t\t \t \t", "n,m=map(int,input().split(\":\"))\r\nM=1\r\ndef t(s):\r\n if(int(s)<10):\r\n return \"0\"+s\r\n else:\r\n return s\r\nwhile(True):\r\n a=((n*60+m+M)//60)%24\r\n b=(n*60+m+M)%60\r\n s=t(str(a))+\":\"+t(str(b))\r\n if(s==s[::-1]):\r\n print(s)\r\n break\r\n M+=1\r\n", "def add_time(h, m):\r\n if m == \"59\":\r\n if h == \"23\":\r\n h = \"00\"\r\n m = \"00\"\r\n else:\r\n h = str(int(h) + 1)\r\n m = \"00\"\r\n if int(h) < 10:\r\n h = \"0\" + h\r\n else:\r\n m = str(int(m) + 1)\r\n if int(m) < 10:\r\n m = \"0\" + m\r\n return h, m\r\n\r\ns = input()\r\nall_times = [\"00:00\", \"01:10\", \"02:20\", \"03:30\", \"04:40\", \"05:50\", \"10:01\", \"11:11\", \"12:21\", \"13:31\", \"14:41\", \"15:51\", \"20:02\", \"21:12\", \"22:22\", \"23:32\"]\r\nhour, minute = s.split(\":\")\r\nhour, minute = add_time(hour, minute)\r\nwhile hour+\":\"+minute not in all_times:\r\n hour, minute = add_time(hour, minute)\r\n\r\nprint(hour+\":\"+minute)", "def next(h):\r\n k=(int(h)+1)%24\r\n h=str(k)\r\n if len(str(k))==1:\r\n h='0'+h\r\n return h\r\nh,m=input().split(':')\r\nh2=h[::-1]\r\nif int(h2)>int(m) and int(h2)<60:\r\n print(h+':'+h2)\r\nelse:\r\n while True:\r\n k=next(h)\r\n \r\n if int(k[::-1])<60:\r\n print(k+':'+k[::-1])\r\n break\r\n h=k\r\n", "def next_palindromic_time():\r\n\thour, minutes = map(int, input().split(\":\"))\r\n\tminutes += 1\r\n\r\n\twhile int(hour) < 24:\r\n\t\tif int(hour) < 10:\r\n\t\t\t\thour = \"0{}\".format(hour)\r\n\r\n\t\tif int(str(hour)[::-1]) >= minutes and int(str(hour)[::-1]) < 60:\r\n\t\t\tprint(\"{}:{}\".format(hour, str(hour)[::-1]))\r\n\t\t\treturn\r\n\t\telse:\r\n\t\t\tminutes = 00\r\n\t\t\thour = int(hour) + 1\r\n\t\t\tif int(hour) > 23:\r\n\t\t\t\thour = 0\r\n\t\r\n\r\nnext_palindromic_time()", "def palindrome(hh, mm):\r\n while True:\r\n mm += 1\r\n if mm == 60:\r\n hh += 1\r\n mm = 0\r\n if hh == 24:\r\n hh = 0\r\n \r\n if hh % 10 * 10 + hh // 10 == mm:\r\n return f\"{hh:02d}:{mm:02d}\"\r\n\r\nhh, mm = map(int, input().split(':'))\r\nres = palindrome(hh, mm)\r\nprint(res)\r\n", "hh, mm = map(int, input().split(':'))\r\n\r\nif mm < 59:\r\n mm += 1\r\nelse:\r\n hh, mm = (hh + 1) % 24, 0\r\n\r\nwhile True:\r\n if hh // 10 == mm % 10 and hh % 10 == mm // 10:\r\n hh, mm = '0'[:hh<10] + str(hh), '0'[:mm<10] + str(mm)\r\n print(':'.join((hh, mm)))\r\n break\r\n \r\n if mm < 59:\r\n mm += 1\r\n else:\r\n hh, mm = (hh + 1) % 24, 0", "# LUOGU_RID: 100229615\nn=input()\na=[]\nfor i in range(1440):\n z=''\n l=str(i//60)\n d=str(i%60)\n if len(l)==1:\n z+='0'\n z+=l\n z+=':'\n if len(d)==1:\n z+='0'\n z+=d\n a.append(z)\nk=0\nfor i in a:\n if i==n:\n break\n k+=1\nn=0\ny=k+1\nwhile n==0:\n y=int(y%1440)\n if a[y][0]==a[y][4] and a[y][1]==a[y][3]:\n print(a[y])\n n=1\n y+=1", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\ndef check(t):\r\n h=t//60\r\n m=t%60\r\n return (h%10==m//10 and h//10==m%10)\r\n\r\ndef to(t):\r\n if t<10:\r\n return '0'+str(t)\r\n return str(t)\r\n\r\n\r\ns=input()\r\nh=int(s[0:2])\r\nm=int(s[3:5])\r\n\r\ntime=h*60+m\r\n\r\nfor i in range(1,60*24+1):\r\n tt=(i+time)%(60*24)\r\n if(check(tt)):\r\n print(to(tt//60)+':'+to(tt%60))\r\n break\r\n\r\n", "n,m=map(int,input().split(\":\"))\r\ns=1\r\ndef t(s):\r\n if(int(s)<10):\r\n return \"0\"+s\r\n else:\r\n return s\r\nwhile(True):\r\n a=((n*60+m+s)//60)%24\r\n b=(n*60+m+s)%60\r\n c=t(str(a))+\":\"+t(str(b))\r\n if(c==c[::-1]):\r\n print(c)\r\n break\r\n s+=1", "def func(x):\r\n\tif x[0] == \"0\":\r\n\t\tx = x[1:]\r\n\t\t\r\n\treturn int(x)\r\n\r\n\r\nl = list(map(func, input().split(\":\")))\r\n\r\nx = 0\r\n\r\nt = str(l[0]).zfill(2) + \":\" + str(l[1]).zfill(2)\r\n\r\nwhile t != t[::-1] or x == 0:\r\n\tl[1] = (l[1] + 1) % 60\r\n\t\r\n\tif l[1] == 0:\r\n\t\tl[0] = (l[0] + 1) % 24\r\n\t\t\r\n\tx += 1\r\n\r\n\tt = str(l[0]).zfill(2) + \":\" + str(l[1]).zfill(2)\r\n\t\r\nprint(t)\r\n\r\n", "\n# Task 108A\ntime = input('')\n\nx = time.split(\":\")\n\nhh = int(x[0])\nmm = int(x[1])\n\nmm+=1\nif (mm == 60):\n hh+=1\n mm = 0\nif (hh == 24):\n hh = 0\nwhile (hh % 10 * 10 + hh // 10 != mm):\n mm+=1\n if (mm == 60):\n hh+=1\n mm = 0\n if (hh == 24):\n hh = 0\nif (hh == 0 and mm == 0):\n print('00:00')\nelif (hh // 10 == 0):\n print('0' + str(hh) + \":\" + str(mm))\nelif (mm // 10 == 0):\n print(str(hh) + \":\" + '0' + str(mm))\nelse:\n print(str(hh) + \":\" + str(mm))\n", "h, m = input().split(':')\r\nx = [\"00\", \"01\", \"02\", \"03\", \"04\", \"05\", \"10\", \"11\", \"12\", \"13\", \"14\", \"15\", \"20\", \"21\", \"22\", \"23\"]\r\ny = [\"00\", \"10\", \"20\", \"30\", \"40\", \"50\", \"01\", \"11\", \"21\", \"31\", \"41\", \"51\", \"02\", \"12\", \"22\", \"32\"]\r\nif h == \"23\" and int(m) >= 32:\r\n print(x[0] + \":\" + y[0])\r\nelif int(h) > 5 and int(h) < 10:\r\n print(x[6] + \":\" + y[6])\r\nelif int(h) > 15 and int(h) < 20:\r\n print(x[12] + \":\" + y[12])\r\nelse:\r\n i = x.index(h)\r\n if int(m) < int(y[i]):\r\n print(x[i] + \":\" + y[i])\r\n else:\r\n i = i+1\r\n print(x[i] + \":\" + y[i])\r\n", "def is_palindromic(num):\r\n num = '0'*(4-len(str(num))) + str(num)\r\n return (num, True) if num[:2] == num[3:1:-1] else (num, False)\r\n\r\n\r\nt = input()\r\nn = int(t[:2]+t[3:5])\r\n\r\nfor i in range(1440):\r\n n = n + 1\r\n\r\n if n % 100 == 60:\r\n n += 40\r\n if n == 2400:\r\n n = 0\r\n\r\n val, flag = is_palindromic(n)\r\n\r\n if flag:\r\n print(val[:2]+':'+val[2:4])\r\n break\r\n", "hour,minute=map(int,input().split(':'))\r\nwhile True:\r\n minute+=1\r\n if(minute==60):\r\n minute=0\r\n hour+=1\r\n if(hour==24):\r\n hour=0\r\n s1=str(hour);s1='0'*(2-len(s1))+s1\r\n s2=str(minute);s1+=':'+'0'*(2-len(s2))+s2\r\n if(s1==s1[::-1]):\r\n print(s1)\r\n exit()", "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\ndef palindrome(h, m):\r\n h = str(h)\r\n if len(h) == 1:\r\n h = \"0\" + h\r\n m = str(m)\r\n if len(m) == 1:\r\n m = \"0\" + m\r\n\r\n last = h +\":\" + m\r\n return last\r\n\r\nh, m = map(int, input().split(\":\"))\r\nm += 1\r\nwhile True:\r\n if m == 60:\r\n m = 0\r\n h += 1\r\n if h == 24:\r\n h = 0\r\n ans = palindrome(h, m)\r\n if ans == ans[::-1]:\r\n print(ans)\r\n break\r\n m += 1\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "h, m = map(int, input().split(':'))\r\n\r\nfor i in range(24 * 60):\r\n m += 1\r\n if m == 60:\r\n m = 0\r\n h += 1\r\n if h == 24:\r\n h = 0\r\n\r\n if '{0:02d}'.format(h) == '{0:02d}'.format(m)[::-1]:\r\n print('{0:02d}:{1:02d}'.format(h, m))\r\n break\r\n", "hora, minuto = input().split(':')\n\nintHora = int(hora)\nintMinuto = int(minuto)\n\nhoraInvertida = hora[1] + hora[0]\nhoraInvertidaInt = int(horaInvertida)\n\nif horaInvertidaInt > 59:\n mesmaHora = False\n\nelif intMinuto < horaInvertidaInt:\n mesmaHora = True\n\nelse:\n mesmaHora = False\n\nif mesmaHora:\n print(hora + ':' + horaInvertida)\nelse:\n if hora == '23':\n print(\"00:00\")\n else:\n intHora += 1\n hora = str(intHora)\n\n if len(hora) == 1:\n hora = '0' + hora\n\n horaInvertida = hora[1] + hora[0]\n if int(horaInvertida) < 60:\n print(hora + ':' + horaInvertida)\n\n while(int(horaInvertida) > 59):\n intHora += 1\n hora = str(intHora)\n\n if len(hora) == 1:\n hora = '0' + hora\n\n horaInvertida = hora[1] + hora[0]\n \n if int(horaInvertida) < 60:\n print(hora + ':' + horaInvertida)\n\n \t \t \t\t\t \t\t \t\t \t \t \t\t\t", "time = input()\r\nh,m = map(int,time.split(\":\"))\r\nc = 0\r\nwhile c!=1:\r\n m+=1\r\n if m >59:\r\n h+=1\r\n m = 0\r\n if h >23:\r\n h = 0\r\n min,hour = str(m),str(h)\r\n if m < 10:\r\n min = \"0\" + str(m)\r\n if h < 10:\r\n hour = \"0\" + str(h)\r\n time = hour + \":\" + min\r\n if time[0] == time[4] and time[1] == time[3]:\r\n c+=1\r\nprint(time)", "def palindromic_time(s):\r\n h=s[0:2]\r\n m=s[3:]\r\n #print(h[-2])\r\n if int(h[-1])*10+int(h[-2])<60 and int(m)<int(h[-1])*10+int(h[-2]):\r\n fin=h+':'+h[-1]+h[-2]\r\n print(fin)\r\n else:\r\n if h=='23':\r\n print('00:00')\r\n else:\r\n d=int(h)\r\n d+=1\r\n if len(str(d))==1:\r\n h='0'+str(d)\r\n else:\r\n h=str(d)\r\n\r\n if (d<=15 or d>=20) and (d<6 or d>=10):\r\n fin=h+':'+h[-1]+h[-2]\r\n print(fin)\r\n elif d>=6 and d<=9:\r\n print('10:01')\r\n else:\r\n print('20:02')\r\n\r\n\r\n\r\n #if h[0]==m[1] and h[1]==m[0]: \r\n \r\n\r\n\r\ns=input('')\r\npalindromic_time(s)\r\n# s='23:54'\r\n# print(s[-1:-2])", "h,m = map(int,input().split(':'))\r\nwhile True:\r\n m = m+1\r\n if m == 60:\r\n h = h+1\r\n m = 00\r\n elif h == 24:\r\n h = 00\r\n m = 00\r\n s = '{:02d}:{:02d}'\r\n s = s.format(h,m)\r\n if s == s[::-1]:\r\n print(s)\r\n exit()\r\n", "#!/usr/bin/env python3\n\nhh, mm = input().split(\":\")\ncnt = 0\nwhile True:\n rm = hh[::-1]\n if (cnt > 0 or rm > mm) and int(rm) < 60:\n break\n hh = \"{:02}\".format((int(hh)+1) % 24)\n cnt += 1\n\nprint(\"{}:{}\".format(hh, rm))\n", "timeNow = input() # HH:MM\r\n\r\nhour = timeNow[:2]\r\nminuteNow = int(timeNow[3:])\r\n\r\nreverse = lambda x: x[::-1]\r\n\r\nreversedHour = reverse(hour)\r\n\r\nif int(reversedHour) > 59 or not int(reversedHour) > minuteNow:\r\n\thour = str(int(hour) + 1)\r\n\tif len(hour) < 2:\r\n\t\thour = f\"0{hour}\"\r\n\t\r\n\treversedHour = reverse(hour)\r\n\r\n\twhile (int(reversedHour) > 59):\r\n\t\thour = str(int(hour) + 1)\r\n\t\tif len(hour) < 2:\r\n\t\t\thour = f\"0{hour}\"\r\n\r\n\t\treversedHour = reverse(hour)\r\n\r\nif int(hour) > 23:\r\n\thour = 0\r\n\r\nhour = str(hour)\r\nif len(hour) == 1:\r\n\thour = f\"0{hour}\"\r\n\r\nprint(f\"{hour}:{reverse(hour)}\")\r\n", "palindrome_times = [\n \"00:00\",\n \"01:10\",\n \"02:20\",\n \"03:30\",\n \"04:40\",\n \"05:50\",\n \"10:01\",\n \"11:11\",\n \"12:21\",\n \"13:31\",\n \"14:41\",\n \"15:51\",\n \"20:02\",\n \"21:12\",\n \"22:22\",\n \"23:32\",\n]\n\ntime = input()\n\nfound = False\nfor i in range(len(palindrome_times) - 1):\n if palindrome_times[i] <= time < palindrome_times[i+1]:\n print(palindrome_times[i+1])\n found = True\n break\n\nif not found:\n print(\"00:00\")\n", "h,m = [y for y in input().split(\":\")]\r\nh1 = int(h[0])\r\nh2 = int(h[1])\r\nm1 = int(m[0])\r\nm2 = int(m[1])\r\ncond = True\r\nwhile cond:\r\n m2 += 1\r\n if m2 == 10:\r\n m2 = 0\r\n m1 += 1\r\n if m1 == 6:\r\n m1 = 0\r\n h2 += 1\r\n if h2 == 4 and h1 == 2:\r\n h1 = 0\r\n h2 = 0\r\n elif h2 == 10:\r\n h2 = 0\r\n h1 += 1\r\n if m2 == h1 and h2 == m1:\r\n print(h1,h2,end=\"\",sep=\"\")\r\n print(\":\",end=\"\")\r\n print(m1,m2,sep=\"\")\r\n break", "s = input()\r\nif(s[0] == '0'):\r\n if(int(s[1]) > 5):\r\n print(\"10:01\")\r\n elif(int(s[1]) < 5):\r\n if(int(s[1] + s[0]) <= int(s[3:])):\r\n print(\"0\" + str(int(s[1]) + 1) + \":\" + str(int(s[1]) + 1) + \"0\")\r\n else:\r\n print(\"0\" + s[1] + \":\" + s[1] + \"0\") \r\n else:\r\n if(int(s[3:]) >= 50):\r\n print(\"10:01\")\r\n else:\r\n print(\"05:50\")\r\nelif(s[0] == '1'):\r\n if(int(s[1]) > 5):\r\n print(\"20:02\")\r\n elif(int(s[1]) < 5):\r\n if(int(s[1] + s[0]) <= int(s[3:])):\r\n print(\"1\" + str(int(s[1]) + 1) + \":\" + str(int(s[1]) + 1) + \"1\")\r\n else:\r\n print(\"1\" + s[1] + \":\" + s[1] + \"1\") \r\n else:\r\n if(int(s[3:]) >= 51):\r\n print(\"20:02\")\r\n else:\r\n print(\"15:51\")\r\nelse:\r\n if(int(s[1]) < 3):\r\n if(int(s[1] + s[0]) <= int(s[3:])):\r\n print(\"2\" + str(int(s[1]) + 1) + \":\" + str(int(s[1]) + 1) + \"2\")\r\n else:\r\n print(\"2\" + s[1] + \":\" + s[1] + \"2\")\r\n else:\r\n if(int(s[1] + s[0]) <= int(s[3:])):\r\n print(\"00:00\")\r\n else:\r\n print(\"23:32\")", "x = input().split(\":\")\r\nh = x[0]\r\nm = x[-1]\r\nif int(h[::-1]) > int(m) and int(h[::-1]) <= 59:\r\n print(\"{}:{}\".format(h, h[::-1]))\r\nelse:\r\n if h == \"23\":\r\n print(\"00:00\")\r\n else:\r\n h = int(h) + 1\r\n if h < 16:\r\n if h < 10 and h > 5:\r\n h = \"10\"\r\n elif h < 10:\r\n h = \"0\" + str(h)\r\n h = str(h)\r\n print(\"{}:{}\".format(h, h[::-1]))\r\n else:\r\n h = \"20\"\r\n print(\"{}:{}\".format(h, h[::-1]))", "def increase(hh,mm):\n hour_increase = False\n mm = int(mm)\n hh = int(hh)\n if int(mm) == 59:\n mm = 0\n hour_increase = True\n else:\n mm += 1\n if hour_increase:\n if int(hh) == 23:\n hh = 0\n else:\n hh += 1\n return [hh,mm]\n\ndef stringFy(n):\n if n < 10:\n return f'0{n}'\n return f'{n}'\n\ndef solve(hh,mm):\n while True:\n hh,mm = increase(hh,mm)\n hh = stringFy(hh)\n mm = stringFy(mm)\n if hh == mm[::-1]:\n return ':'.join([hh, mm]) \n\n\ndef main():\n arr =list(input().split(\":\"))\n print(solve(*arr))\n\nmain()", "listt = input().split(':')\r\nflag = 0\r\nfor i in range(int(listt[0]),24):\r\n h = str(i)\r\n if int(h)<10:\r\n h = '0'+h\r\n m = listt[1]\r\n listh = list(h)\r\n new_m = listh[1]+listh[0]\r\n if int(new_m)<60:\r\n if int(h)==int(listt[0]) and int(new_m)>int(m):\r\n flag = 1\r\n print(h+':'+new_m)\r\n break\r\n elif int(h)>int(listt[0]):\r\n flag = 1\r\n print(h+\":\"+new_m)\r\n break\r\nif flag==0:\r\n print(\"00:00\")\r\n\r\n", "from bisect import bisect\r\nd = [0, 70, 140, 210, 280, 350, 601, 671, 741, 811, 881, 951, 1202, 1272, 1342, 1412]\r\nt = ['00:00', '01:10', '02:20', '03:30', '04:40', '05:50', '10:01', '11:11', '12:21', '13:31', '14:41', '15:51', '20:02', '21:12', '22:22', '23:32']\r\ns = input().split(':')\r\nc = int(s[0]) * 60 + int(s[1])\r\nj = bisect(d, c)\r\nif(j == len(d)):\r\n print(t[0])\r\nelse:\r\n print(t[j])", "# hh, mm = input().split(\":\")\ns = input()\npal = [\n \"00:00\", \"01:10\", \"02:20\", \"03:30\", \"04:40\", \"05:50\",\n \"10:01\", \"11:11\", \"12:21\", \"13:31\", \"14:41\", \"15:51\",\n \"20:02\", \"21:12\", \"22:22\", \"23:32\",\n]\nfrom bisect import bisect_left\ni = bisect_left(pal, s)\nn = len(pal)\nres = pal[i % n] if pal[i % n] != s else pal[(i + 1) % n]\nprint(res)\n\n# if int(mm) >= int(hh[::-1]):\n# hh = int(hh)\n# hh = hh + 1 if hh < 23 else 0\n# hh = hh if 10 <= hh < 16 and 0 <= hh < 6 else 20 if hh > 15 else 10\n# hh = f\"{hh:02d}\"\n# res = f\"{hh}:{hh[::-1]}\"\n# print(res)\n", "def check(a,b):\r\n\ta,b=str(a),str(b)\r\n\tp='0'*(2-len(a))+a+':'+'0'*(2-len(b))+b\r\n\tif p==p[::-1]:\r\n\t\tprint(p)\r\n\t\texit()\r\nh,m=input().split(':')\r\nh,m=int(h),int(m)\r\nwhile 1:\r\n\tm+=1\r\n\tif m==60:\r\n\t\tm=0\r\n\t\th+=1\r\n\tif h==24:\r\n\t\th=0\r\n\tcheck(h,m)\r\n", "ls = [\"00:00\",\"01:10\",\"02:20\",\"03:30\",\"04:40\",\"05:50\",\"10:01\",\"11:11\",\"12:21\",\"13:31\",\"14:41\",\"15:51\",\"20:02\",\"21:12\",\"22:22\",\"23:32\"]\r\ninp=input()\r\nans=0\r\nfor i in range(len(ls)):\r\n if ls[i]>inp:\r\n ans=ls[i]\r\n break\r\nif ans!=0:\r\n print(ans)\r\nelse:\r\n print('00:00')\r\n ", "def esPalindromo(tiempo):\r\n if tiempo[0]==tiempo[4] and tiempo[1]==tiempo[3]:\r\n return True\r\n else:\r\n return False\r\ntiempo = input()\r\npalindromo = False\r\nwhile not palindromo:\r\n valores = tiempo.split(\":\")\r\n horas = int(valores[0])\r\n minutos = int(valores[1])\r\n minutos += 1\r\n if minutos == 60:\r\n minutos = 0\r\n horas += 1\r\n if horas == 24:\r\n horas = 0\r\n tiempo = (\"0\" if horas < 10 else \"\") + str(horas) + \":\" + (\"0\" if minutos < 10 else \"\") + str(minutos)\r\n palindromo = esPalindromo(tiempo)\r\nprint(tiempo)\r\n\r\n\r\n", "a=[0,70,140,210,280,350,601,671,741,811,881,951,1202,1272,1342,1412]\r\nlst=['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31','14:41','15:51','20:02','21:12','22:22','23:32']\r\ns=input()\r\nn=int(s[:2])*60+int(s[3:])\r\nif n>=a[-1]:\r\n print('00:00')\r\nelse:\r\n for i in range(0,15):\r\n if a[i]<=n and a[i+1]>n:\r\n print(lst[i+1])\r\n break", "a, b = input().split(':')\na, b = int(a), int(b)\n\nif(b==59):\n\ta = (a + 1)%24\nb = (b+1)%60\n\nwhile(True):\n\thora = str(a)\n\tminuto = str(b)\t\t\n\t\n\tif(int(hora)<10):\n\t\thora = '0' + hora\n\tif(int(minuto)<10):\n\t\tminuto = '0' + minuto\t\n\t\t\n\tif(hora[0]==minuto[1] and hora[1]==minuto[0]):\n\t\tprint(hora+\":\"+minuto)\n\t\tbreak\n\tif(b==59):\n\t\ta = (a + 1)%24\n\tb = (b+1)%60\n\t\n", "h, m = map(int, input().split(\":\"))\r\nwhile True:\r\n m += 1\r\n if m == 60:\r\n m = 0\r\n h += 1\r\n if h == 24:\r\n h = 0\r\n a = str(h)\r\n if len(a)==1:\r\n a='0'+a\r\n b = str(m)\r\n if len(b)==1:\r\n b='0'+b\r\n\r\n if a == b[::-1]:\r\n print(a + \":\" + b)\r\n break\r\n\r\n", "from sys import stdin,stdout\r\ndef ii(): return int(stdin.readline())\r\ndef mi(): return map(int,stdin.readline().split())\r\ndef li(): return list(mi())\r\ndef si(): return stdin.readline()\r\nl1=['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31','14:41','15:51','20:02','21:12','22:22','23:32']\r\ns1=input()\r\nfor i in l1:\r\n if i>s1:\r\n print(i)\r\n break \r\nelse:\r\n print(l1[0])", "a=input().split(':')\r\nwhile 1:\r\n a=list(map(int,a))\r\n a[1]+=1\r\n if a[1]==60:a[0],a[1]=a[0]+1,a[1]-60\r\n if a[0]==24:a[0]-=24\r\n a=list(map(str,a))\r\n for i in [0,1]:\r\n if len(a[i])==1:a[i]='0'+a[i]\r\n if a[0]==a[1][::-1]:break\r\nprint(':'.join(a))", "d = [\r\n \"00:00\", \"01:10\", \"02:20\", \"03:30\", \"04:40\", \"05:50\",\r\n \"10:01\", \"10:01\", \"10:01\", \"10:01\", \"10:01\", \"11:11\",\r\n \"12:21\", \"13:31\", \"14:41\", \"15:51\", \"20:02\", \"20:02\",\r\n \"20:02\", \"20:02\", \"20:02\", \"21:12\", \"22:22\", \"23:32\", \"00:00\"\r\n ]\r\nh, m = input().strip().split(\":\")\r\nih = int(h)\r\nif 5<ih<10 or 15<ih<20 or m<h[::-1]:\r\n print(d[ih])\r\nelse:\r\n print(d[ih+1])", "a,b=map(str,input().split(':'))\r\n# print(a,b)\r\n# print(int(str(a)[::-1]))\r\nx=[\"00\",\"01\",\"02\",\"03\",\"04\",\"05\",\"10\",\"11\",\"12\",\"13\",\"14\",\"15\",\"20\",\"21\",\"22\",\"23\"]\r\nif int(a)==23 and int(b)>=32:\r\n print(\"00:00\")\r\nelse:\r\n if int(b)>=60 or int(a[::-1])>=60 or int(b)>=int(a[::-1]):\r\n for i in x:\r\n if int(i)>int(a):\r\n print(i+\":\"+i[::-1])\r\n break\r\n else:\r\n print(a+\":\"+a[::-1])\r\n\r\n\r\n", "n=input()\r\nl=[0,110,220,330,440,550,1001,1111,1221,1331,1441,1551,2002,2112,2222,2332]\r\ns=''\r\ns=s+n[0]+n[1]+n[3]+n[4]\r\na=int(s)\r\nif(a>2332):\r\n print(\"00:00\")\r\nelse: \r\n for i in range(len(l)-1):\r\n if(a>=l[i] and a<l[i+1]):\r\n b=str(l[i+1])\r\n if(len(b)==3):\r\n print('0'+b[0]+':'+b[1]+b[2])\r\n else:\r\n print(b[0]+b[1]+':'+b[2]+b[3])\r\n", "def main():\n h, m = map(int, input().split(\":\"))\n for t in range(h * 60 + m + 1, 9999):\n h, m = divmod(t % 1440, 60)\n if h // 10 + h % 10 * 10 == m:\n break\n print(\"{:02d}:{:02d}\".format(h, m))\n\n\nif __name__ == '__main__':\n main()", "hours, minutes = input().split(\":\")\r\ni = hours + minutes\r\nwhile hours[::-1] != minutes or i == hours + minutes:\r\n if hours == \"23\":\r\n if minutes == \"59\":\r\n hours = \"00\"\r\n minutes = \"00\"\r\n else:\r\n minutes = \"0\" * (2 - len(str(int(minutes) + 1))) + str(int(minutes) + 1)\r\n elif minutes == \"59\":\r\n hours = \"0\" * (2 - len(str(int(hours) + 1))) + str(int(hours) + 1)\r\n minutes = \"00\"\r\n else:\r\n minutes = \"0\" * (2 - len(str(int(minutes) + 1))) + str(int(minutes) + 1)\r\nprint(hours + \":\" + minutes)\r\n", "from datetime import *\na = input()\nhou = a[:2]\nmin = a[3:]\nif int(hou) == 23 and int(min)>31:\n print('00:00')\nelse:\n for i in range(3600):\n h_m = []\n t = timedelta(hours=int(hou),minutes=int(min))+timedelta(hours=0,minutes=1)\n t = str(t)\n if len(t) == 7:\n t = t[:4]\n if len(t) == 8:\n t = t[:5]\n for i in t.split(':'):\n h_m += [i]\n hou = int(h_m[0])\n min = int(h_m[1])\n if len(t) == 4:\n t = '0'+t\n if t == t[::-1]:\n print(t)\n break", "# LUOGU_RID: 100899366\r\nn=input()\r\na=[]\r\nfor i in range(1440):\r\n z=''\r\n l=str(i//60)\r\n d=str(i%60)\r\n if len(l)==1:\r\n z+='0'\r\n z+=l\r\n z+=':'\r\n if len(d)==1:\r\n z+='0'\r\n z+=d\r\n a.append(z)\r\nk=0\r\nfor i in a:\r\n if i==n:\r\n break\r\n k+=1\r\nn=0\r\ny=k+1\r\nwhile n==0:\r\n y=int(y%1440)\r\n if a[y]==a[y][::-1]:\r\n print(a[y])\r\n n=1\r\n y+=1", "def is_palindrome(st):\r\n return st == st[::-1]\r\n\r\na = input()\r\nb = a.split(\":\")\r\nhour, minutes = int(b[0]), int(b[-1])\r\n\r\nwhile True:\r\n s = (str(hour) if hour >= 10 else \"0\"+str(hour)) + \":\" + (str(minutes) if minutes >= 10 else \"0\"+str(minutes))\r\n check = is_palindrome(s)\r\n if check and s != a:\r\n print(s)\r\n break\r\n minutes += 1\r\n if minutes == 60:\r\n hour += 1\r\n minutes = 0\r\n if hour == 24:\r\n hour = 0\r\n minutes = 0", "h, m = map(int, input().split(':'))\r\ntot = h * 60 + m + 1\r\n\r\nif tot in range(0, 351):\r\n tmp = ((tot + 70 - 1) // 70) * 70\r\nelif tot in range(351, 602):\r\n tmp = 601\r\nelif tot in range(602, 952):\r\n tmp = ((tot - 601 + 70 - 1) // 70) * 70 + 601\r\nelif tot in range(952, 1203):\r\n tmp = 1202\r\nelif tot in range(1203, 1413):\r\n tmp = ((tot - 1202 + 70 - 1) // 70) * 70 + 1202\r\nelse:\r\n tmp = 0\r\n\r\nnh = tmp // 60\r\nnm = tmp % 60\r\n\r\nprint(\"%02d:%02d\" % (nh, nm))", "a=input()\r\nm=['00:00','01:10','02:20','03:30','04:40','05:50','10:01','11:11','12:21','13:31','14:41','15:51','20:02','21:12','22:22','23:32',]\r\nminn=int(a[3]+a[4])\r\nif a[0]=='2'and a[1]=='3' and minn>=32:\r\n print('00:00')\r\nfor i in range(1,len(m)):\r\n if a<m[i]:\r\n print(m[i])\r\n exit()", "hh , mm = [int(x) for x in input().split(\":\")]\r\n\r\ncount = -1\r\nwhile count < 24:\r\n count += 1\r\n newHour = (hh + count) % 24\r\n if newHour % 10 < 6:\r\n newHourString = format(str(newHour) , \"0>2\")\r\n rvrsd = newHourString[::-1]\r\n if int(rvrsd) > mm or count > 0:\r\n print(newHourString+\":\"+newHourString[::-1])\r\n break\r\n\r\n", "s=input()\r\nh=s.split(':')[0]\r\nm=int(s.split(':')[1])\r\n\r\nif int(h[::-1]) <= m or int(h[::-1]) > 59:\r\n h=str((int(h)+1)%24)\r\n if len(h)==1:\r\n h='0'+h\r\n while(int(h[::-1]) > 59):\r\n h=str((int(h)+1)%24)\r\n if len(h)==1:\r\n h='0'+h\r\n \r\nprint(f\"{h}:{h[::-1]}\")", "h,m=map(int,input().split(':'))\r\nwhile 1:\r\n\tm+=1\r\n\tif m==60:h+=1;m=0\r\n\tif h==24:h=0\r\n\ta=str(h);a='0'*(2-len(a))+a\r\n\tb=str(m);a+=':'+'0'*(2-len(b))+b\r\n\tif(a==a[::-1]):print(a);exit()", "t = input()\r\nh,m = int(t[:2]),int(t[3:])\r\nm += 1\r\ns = ''\r\nwhile 1:\r\n\tif m == 60:\r\n\t\th += 1\r\n\t\tm = 0\r\n\tif h == 24:\r\n\t\th = 0\r\n\tif m < 10 and h >= 10:\r\n\t\ts = \"{}:{}\".format(str(h),'0'+str(m))\r\n\telif h < 10 and m >= 10:\r\n\t\ts = \"{}:{}\".format('0'+str(h),str(m))\r\n\telif h < 10 and m < 10:\r\n\t\ts = \"{}:{}\".format('0'+str(h),'0'+str(m))\r\n\telse:\r\n\t\ts = \"{}:{}\".format(str(h),str(m))\r\n\tm += 1\r\n\tif s == s[::-1]:\r\n\t\tprint(s)\r\n\t\tbreak", "hh, mm = map(int, input().split(\":\"))\r\n\r\nfor i in range(hh, 24):\r\n for j in range(0 + [0, mm][hh==i], 60):\r\n if i != hh or mm != j:\r\n if i < 10:\r\n hh_ans = \"0\"+str(i)\r\n else:\r\n hh_ans = str(i)\r\n if j < 10:\r\n mm_ans = \"0\"+str(j)\r\n else:\r\n mm_ans = str(j)\r\n if mm_ans[::-1] == hh_ans:\r\n print(f\"{hh_ans}:{mm_ans}\")\r\n exit()\r\nelse:\r\n print(\"00:00\")\r\n", "'''input\n12:21\n'''\n\n\ndef main():\n h,m = map(int, input().split(':'))\n if h < 5:\n \n if m < int(str(h) + '0'):\n print(\"0\" + str(h) + ':' + str(h) + '0')\n else:\n print(\"0\" + str(h+1) + ':' + str(h+1) + '0')\n\n\n\n elif h == 5:\n \n if m < 50:\n print(\"05:50\")\n else:\n print(\"10:01\")\n\n\n elif h < 9:\n print(\"10:01\")\n\n elif h < 15:\n if m < int(str(h)[::-1]):\n print(str(h) + ':' + str(h)[::-1])\n else:\n print(str(h+1) + ':' + str(h+1)[::-1])\n\n\n\n elif h < 20:\n print(\"20:02\")\n\n elif h < 23:\n \n if m < int(str(h)[::-1]):\n print(str(h) + ':' + str(h)[::-1])\n else:\n print(str(h+1) + ':' + str(h+1)[::-1])\n\n\n else:\n if m < 32:\n print(\"23:32\")\n else:\n print(\"00:00\")\n\n\n \n\nif __name__ == \"__main__\":\n main()\n\n\n", "hora = input()\nh, m = hora.split(\":\")\n\nh = int(h)\nm = int(m)\n\nwhile True:\n m += 1\n if m == 60:\n m = 0\n h += 1\n\n if h > 23:\n h = 0\n\n hr = str(h)\n mi = str(m)\n\n if len(str(h)) == 1:\n hr = \"0\" + hr\n if len(str(m)) == 1:\n mi = \"0\" + mi\n\n\n if hr == mi[::-1]:\n hora = hr + \":\" + mi \n\n \n if int(hora[3:]) < 60:\n break\n\nprint(hora)\n \t\t \t \t \t \t \t \t \t\t", "h,m=map(int,input().split(':'))\r\nwhile True:\r\n\tm+=1\r\n\tif m==60:\r\n\t\th+=1\r\n\t\tm=0\r\n\tif h==24:\r\n\t\th=0\r\n\ta=str(h)\r\n\ta='0'*(2-len(a))+a\r\n\tb=str(m)\r\n\tb='0'*(2-len(b))+b\r\n\ta=a+\":\"+b\r\n\tif(a==a[::-1]):\r\n\t\tprint(a)\r\n\t\texit()", "\ndef next(h, m):\n m += 1\n if m == 60:\n m = 0\n h += 1\n if h == 24:\n h = 0\n return (h, m)\n\na, b = map(int, input().split(':'))\n\n\nfound = False\nresult = None\n\nwhile not found:\n a, b = next(a, b)\n a_pa, b_pa = '0'*(2 - len(str(a))) + str(a), '0'*(2 - len(str(b))) + str(b)\n if a_pa == b_pa[::-1]:\n result = (a_pa, b_pa)\n found = True\n\nprint(a_pa + \":\" + b_pa)\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\ndef check(h,m):\r\n s=\"\"\r\n if(len(str(h))==1):\r\n s+=\"0\"\r\n s+=str(h)\r\n s+=\":\"\r\n if(len(str(m))==1):\r\n s+=\"0\"\r\n s+=str(m)\r\n i=0\r\n j=len(s)-1\r\n while(i<j):\r\n if(s[i]!=s[j]):\r\n return(0)\r\n i+=1\r\n j-=1\r\n return(1)\r\n\r\ns=input().strip()\r\n\r\nh=int(s[0:2])\r\nm=int(s[3:5])\r\n\r\nif(check(h,m)==1):\r\n m=(m+1)%60\r\n if(m==0):\r\n h=(h+1)%24\r\nwhile(check(h,m)!=1):\r\n m=(m+1)%60\r\n if(m==0):\r\n h=(h+1)%24\r\n #print(str(h)+\":\"+str(m))\r\n\r\nif(len(str(h))==1):\r\n print(\"0\",end=\"\")\r\nprint(str(h)+\":\",end=\"\")\r\nif(len(str(m))==1):\r\n print(\"0\",end=\"\")\r\nprint(str(m))\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport sys\r\nimport string\r\nimport random\r\nfrom typing import List\r\nsys.setrecursionlimit(99999)\r\n\r\nt = [\"00:00\",\"01:10\",\"02:20\",\"03:30\",\"04:40\",\"05:50\",\"10:01\",\"11:11\",\"12:21\",\"13:31\",\"14:41\",\"15:51\",\"20:02\",\"21:12\",\"22:22\",\"23:32\"]\r\ns = input()\r\nif s>=t[-1]:\r\n print(t[0])\r\nelse:\r\n j= bisect.bisect_right(t,s)\r\n print(t[j])", "s1=input()\r\na=int(s1[0])*10+int(s1[1])\r\nb=int(s1[3])*10 +int(s1[4])\r\n\r\ndef increasetime(a,b):\r\n b+=1\r\n if b==60:\r\n a+=1\r\n b=0\r\n if a==24:\r\n a=0\r\n return a,b\r\na,b=increasetime(a,b)\r\nwhile a//10!=b%10 or a%10!=b//10:\r\n a,b=increasetime(a,b)\r\nif a<10:\r\n print(\"0\",end=\"\")\r\n print(str(a)+\":\",end=\"\")\r\nelse :\r\n print(str(a)+\":\",end=\"\")\r\nif b<10:\r\n print(\"0\",end=\"\")\r\n print(b)\r\nelse :\r\n print(b)", "time = input()\nres = \"\"\nhour = time[0:2]\nminute = time[3:5]\n\nreverseStr = []\n\nfor i in range(0, 24):\n reverseStr.append(str(i)[::-1] + '0' * (2-len(str(i))))\nreverseNum = list(map(int, reverseStr))\n\ni = int(hour)\nif reverseNum[i] <= int(minute):\n i = (i + 1) % 24\n\nwhile reverseNum[i] >= 60:\n i = (i + 1) % 24\n\nprint('0' * (2-len(str(i))) + str(i) + \":\" + reverseStr[i])\n\n \t\t \t\t \t \t \t\t \t", "a = ['00:00', '01:10', '02:20', '03:30', '04:40', '05:50', '10:01', '11:11', '12:21', '13:31', '14:41', '15:51', '20:02', '21:12', '22:22', '23:32']\r\ns = input()\r\nfor i in a:\r\n\tif i>s:\r\n\t\tprint(i)\r\n\t\texit()\r\nprint('00:00')\r\n", "# import sys\r\n# sys.stdin= (open('input.txt','r'))\r\n# sys.stdout = (open('output.txt','w'))\r\n\r\nh,m = (int(x) for x in input().split(':'))\r\nwhile(1) :\r\n m+= 1\r\n if m==60 :\r\n m= 0 \r\n h+=1\r\n if h==24 :\r\n h= 0 \r\n s = f\"{format(h,'02')}:{format(m,'02')}\"\r\n if s==s[::-1] :\r\n print(s)\r\n break", "s=input()\nh=int(s[0:2])\nm=int(s[3:])\nhh=int(s[1])*10+int(s[0])\nx='0'\nif hh>m:\n x=str(h)\n if h>14 and h<20:x='20'\n elif h>5 and h<10:x='10'\nelse:\n if h>14 and h<20:x='20'\n elif h>5 and h<10:x='10'\n else:x=str((h+1)%24)\nif len(x)==1:x='0'+x\nprint(x+':'+x[::-1])\n\t\t \t \t\t \t \t\t\t \t\t\t \t \t", "h,m=map(int,input().split(':'))\r\nm+=h*60\r\nwhile 1:\r\n m=(m+1)%1440 \r\n r=f'{m//60:02}:{m%60:02}'\r\n if r==r[::-1]:\r\n print(r)\r\n break\r\n", "time=input()\r\nh=int(time[0:2])\r\nm=int(time[3:])\r\ndef isPalindrome(a,b):\r\n s=''\r\n if a<10:\r\n a='0'+str(a)\r\n else:\r\n a=str(a)\r\n if b<10:\r\n b='0'+str(b)\r\n else:\r\n b=str(b)\r\n for i in b:\r\n s=i+s\r\n if s==a:\r\n return 'yes'\r\n else:\r\n return 'no'\r\n \r\nif h==23 and m>32:\r\n print('00:00')\r\nelse:\r\n while h<=23:\r\n m+=1\r\n if m==60:\r\n h+=1\r\n m=0\r\n if isPalindrome(h,m)=='yes':\r\n break\r\n if h<10:\r\n h='0'+str(h)\r\n else:\r\n h=str(h)\r\n if m<10:\r\n m='0'+str(m)\r\n else:\r\n m=str(m)\r\n print(h+':'+m)\r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# Most Frequently Used Number Theory Concepts\r\n# SOE(helper function of get gcd)\r\ndef sieve(N):\r\n primeNumbers = [True]*(N+1)\r\n primeNumbers[0] = False\r\n primeNumbers[1] = False\r\n i = 2\r\n while i*i <= N:\r\n j = i\r\n if primeNumbers[j]:\r\n while j*i <= N:\r\n primeNumbers[j*i] = False\r\n j += 1\r\n i += 1\r\n return primeNumbers\r\n \r\n# get prime number form 1 to N\r\ndef getPrime(N):\r\n primes = sieve(N)\r\n result = []\r\n for i in range(len(primes)):\r\n if primes[i]:\r\n result.append(i)\r\n return result\r\n \r\n# factors of n\r\ndef factor(N):\r\n factors = []\r\n i = 1\r\n while i*i <= N:\r\n if N % i == 0:\r\n factors.append(i)\r\n if i != N//i:\r\n factors.append(N//i)\r\n i += 1\r\n return sorted(factors)\r\n \r\n# reduce a string in number under range(1000000007)\r\ndef reduceB(b) : \r\n # Initialize result \r\n mod = 0\r\n # Calculating mod of b with a \r\n # to make b like 0 <= b < a \r\n for i in range(0, len(b)) : \r\n mod = (mod * 10 + ord(b[i])) % 1000000007 \r\n # print(b[i], ord(b[i]), mod)\r\n return mod\t # return modulo \r\n \r\n# gcd of two numbers\r\ndef gcd(a, b):\r\n if a < b:\r\n return gcd(b, a)\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n time = input()\r\n palindromeTime = [\"00:00\", \"01:10\", \"02:20\", \"03:30\", \"04:40\", \"05:50\",\r\n \"10:01\", \"11:11\", \"12:21\", \"13:31\", \"14:41\", \"15:51\",\r\n \"20:02\", \"21:12\", \"22:22\", \"23:32\", \"00:00\"]\r\n\r\n n = len(palindromeTime)\r\n hh = \"\"\r\n mm = \"\"\r\n hh += time[0]\r\n hh += time[1]\r\n mm += time[3]\r\n mm += time[4]\r\n hh = int(hh)\r\n mm = int(mm)\r\n for i in range(0, n-1):\r\n arrHH = \"\"\r\n arrHH += palindromeTime[i][0]\r\n arrHH += palindromeTime[i][1]\r\n arrHH = int(arrHH)\r\n if hh == int(arrHH):\r\n arrMM = \"\"\r\n arrMM += palindromeTime[i][3]\r\n arrMM += palindromeTime[i][4]\r\n arrMM = int(arrMM)\r\n if mm < arrMM:\r\n print(palindromeTime[i])\r\n return\r\n else:\r\n print(palindromeTime[i+1])\r\n return\r\n elif arrHH > hh:\r\n print(palindromeTime[i])\r\n return\r\n\r\n\r\n# for printing format\r\n# print(\"Case #{}: {}\".format(t+1, ans))\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef query_time_string(h, m):\r\n return str(h).zfill(2) + ':' + str(m).zfill(2)\r\n\r\ndef solve(h, m):\r\n m += 1\r\n if m == 60:\r\n m = 0\r\n h += 1\r\n if h == 24:\r\n h = 0\r\n while 1:\r\n s = query_time_string(h, m)\r\n if s == s[::-1]:\r\n return s\r\n m += 1\r\n if m == 60:\r\n m = 0\r\n h += 1\r\n if h == 24:\r\n h = 0\r\n return 'test'\r\n\r\ndef main():\r\n s = input()\r\n h = int(s[0:2])\r\n m = int(s[3:])\r\n print(solve(h, m))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import datetime\r\npalin_timings = ['00:00', '01:10', '02:20', '03:30', '04:40', '05:50', '10:01', '11:11', '12:21', '13:31', '14:41', '15:51', '20:02', '21:12', '22:22', '23:32']\r\nn = input()\r\nif n in palin_timings:\r\n ind = palin_timings.index(n)\r\n if ind+1 >= len(palin_timings):\r\n print(palin_timings[0])\r\n else:\r\n print(palin_timings[ind+1])\r\nelse:\r\n now = datetime.datetime.now()\r\n input_time = now.replace(hour=int(n[0:2]), minute=int(n[3:]), second=0, microsecond=0)\r\n special_time = now.replace(hour=int(palin_timings[-1][0:2]), minute=int(palin_timings[-1][3:]), second=0, microsecond=0)\r\n possible = []\r\n for i in palin_timings:\r\n time = now.replace(hour=int(i[0:2]), minute=int(i[3:]), second=0, microsecond=0)\r\n if input_time < time:\r\n possible.append(i)\r\n elif input_time > special_time:\r\n possible.append(palin_timings[0])\r\n print(possible[0])", "def digits_to_seconds(s):\r\n return int(s[0:2]) * 60 + int(s[3:])\r\n\r\ndef seconds_to_digits(n):\r\n h = n // 60\r\n m = n % 60\r\n return str(h).zfill(2) + ':' + str(m).zfill(2)\r\n\r\ndef is_palindrome(s):\r\n return s[0] == s[-1] and s[1] == s[-2]\r\n\r\ndigits = input()\r\nseconds = (digits_to_seconds(digits) + 1) % (24 * 60)\r\nwhile True:\r\n digits = seconds_to_digits(seconds)\r\n if is_palindrome(digits):\r\n print(digits)\r\n break\r\n seconds = (seconds + 1) % (24 * 60)", "a=input()\r\nb=a[:2]\r\nh=int(b)\r\nc=a[3:]\r\nm=int(c)\r\nif (h==0 and m>=0)or( h==1 and m<10):\r\n print(\"01:10\")\r\nif (h==1 and m>=10)or( h==2 and m<20):\r\n print(\"02:20\")\r\nif (h==2 and m>=20)or( h==3 and m<30):\r\n print(\"03:30\")\r\nif (h==3 and m>=30)or( h==4 and m<40):\r\n print(\"04:40\")\r\nif (h==4 and m>=40)or( h==5 and m<50):\r\n print(\"05:50\")\r\nif (h==5 and m>=50)or(h>5 and h<10)or(h==10 and m==0):\r\n print(\"10:01\")\r\nif (h==10 and m>=1) or ( h==11 and m<11):\r\n print(\"11:11\")\r\nif (h==11 and m>=11) or ( h==12 and m<21):\r\n print(\"12:21\")\r\nif (h==12 and m>=21) or ( h==13 and m<31):\r\n print(\"13:31\")\r\nif (h==13 and m>=31) or ( h==14 and m<41):\r\n print(\"14:41\")\r\nif (h==14 and m>=41) or ( h==15 and m<51):\r\n print(\"15:51\")\r\nif (h==15 and m>=51) or (h>15 and h<20) or(h==20 and m<2):\r\n print(\"20:02\")\r\nif (h==20 and m>=2) or ( h==21 and m<12):\r\n print(\"21:12\")\r\nif (h==21 and m>=12) or ( h==22 and m<22):\r\n print(\"22:22\")\r\nif (h==22 and m>=22) or ( h==23 and m<32):\r\n print(\"23:32\")\r\nif(h==23 and m>=32):\r\n print(\"00:00\")\r\n", "palindromes = {}\r\ntimes = []\r\nfor i in range(24):\r\n if len(str(i)) == 1:\r\n i = \"0\" + str(i)\r\n if int(str(i)[::-1]) < 60:\r\n palindromes[60*int(i) + int(str(i)[::-1])] = str(i) + \":\" + str(i)[::-1]\r\n times.append(60*int(i) + int(str(i)[::-1]))\r\n\r\n\r\ntime = input(\"\")\r\nmin = (60*int(time[0:2]) + int(str(time[3:])))%1440\r\nif min >= 1412:\r\n print(\"00:00\")\r\nelse:\r\n for j in times:\r\n if min < j:\r\n print(palindromes[j])\r\n break\r\n ", "timeNow = input() # HH:MM\r\n\r\nhour = int(timeNow[:2])\r\nminute = int(timeNow[3:]) + 1\r\n\r\nreverse = lambda x: x[::-1]\r\n\r\nfor _ in range(24 * 60):\r\n\tif minute > 59:\r\n\t\tminute = 0\r\n\t\thour += 1\r\n\t\r\n\tif hour > 23:\r\n\t\thour = 0\r\n\t\r\n\tclockTime = f'{f\"{hour}\" if len(f\"{hour}\") == 2 else f\"0{hour}\"}:{f\"{minute}\" if len(f\"{minute}\") == 2 else f\"0{minute}\"}'\r\n\r\n\tif clockTime == reverse(clockTime):\r\n\t\tprint(clockTime)\r\n\t\tbreak\r\n\r\n\tminute += 1", "from sys import stdin, stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor i in range(1):#nmbr()):\r\n hh,mm=input().split(':')\r\n hh=int(hh)\r\n mm=int(mm)\r\n while 1:\r\n mm+=1\r\n if mm==60:\r\n hh+=1\r\n mm=0\r\n if hh==24:hh=0\r\n h=str(hh)\r\n m=str(mm)\r\n if len(h)==1:h='0'+h\r\n if len(m)==1:m='0'+m\r\n ss=h+m\r\n if ss==ss[::-1]:\r\n print(h,':',m,sep='')\r\n break\r\n", "isPal = lambda h, m: str(h) == str (m % 10 * 10 + int (m / 10))\n\ndef Inc (h, m):\n m += 1\n if m == 60:\n m = 0\n h += 1\n if h == 24:\n h = 0\n return [h, m]\n\ndef Tr (s):\n if len(s) == 1:\n s = '0' + s[0]\n return s\n\nh, m = [int(i) for i in input().split(':')]\nh, m = Inc (h, m)\nwhile (not isPal (h, m)):\n h, m = Inc (h, m)\n\nprint (Tr (str(h)) + ':' + Tr (str(m)))\n" ]

[ "import itertools\nn, m = tuple(int(x) for x in input().split())\nlstN = [x for x in range(1,n+1)]\n\ndef funcP(seq):\n\tres = 0\n\tfor i in range(len(seq)):\n\t\tfor j in range(i, len(seq)):\n\t\t\tres += min(seq[i:j+1])\n\treturn res\n\nallPerm = [(perm,funcP(perm)) for perm in itertools.permutations(lstN)]\nallPerm.sort(key = lambda x: x[1], reverse = True)\nprint(\" \".join(str(x) for x in allPerm[m-1][0]))\n", "n,m = map(int,input().split())\r\nl = [0 for i in range(n)]\r\nlr = [0,n-1]\r\nfor i in range(n,0,-1):\r\n if m > 2**(i-2):\r\n l[lr[1]] = str(n-i+1)\r\n lr[1] -= 1\r\n m -= 2**(i-2)\r\n else:\r\n l[lr[0]] = str(n-i+1)\r\n lr[0] += 1\r\nprint(' '.join(l))\r\n", "n,m=map(int,input().strip().split())\nv=[0]*51\nleft=1\nright=n\nfor i in range(1,n+1):\n\tif(n-i-1<=0):\n\t\tpw=1\n\telse:\n\t\tpw=(1<<(n-i-1))\n\n\tif(m<=pw):\n\t\tv[left]=i\n\t\tleft+=1\n\telse:\n\t\tv[right]=i\n\t\tright-=1\n\t\tm-=pw\nfor i in range(1,n):\n\tprint(v[i], end=' ')\nprint(v[n])\n\t\t\t \t\t\t \t \t\t \t\t \t \t\t\t\t\t\t\t", "\r\n#If I ruled d wrld,\r\n#Evryday’d be d 1stday of spring,\r\n#Evry heart would’ve a new song2sing!\r\n\r\nn,m = map( int,input().split() )\r\narr = [ 0 for i in range( 0,n+1 ) ]\r\nfac = [1]\r\n\r\nfor i in range(1,n+1):\r\n fac.append( 2*fac[i-1] )\r\n\r\ndef dfs( x,lft,rgt,m ):\r\n if ( lft==rgt ):\r\n arr[lft] = x\r\n return\r\n elif ( m <= fac[n-x-1] ):\r\n arr[lft] = x\r\n dfs( x+1,lft+1,rgt,m )\r\n else:\r\n arr[rgt] = x\r\n dfs( x+1,lft,rgt-1,m-fac[n-x-1] )\r\n\r\ndfs( 1,1,n,m )\r\n\r\nfor i in range(1,n+1):\r\n print( arr[i],end = '' )\r\n if( i==n ):\r\n print( '\\n',end = '' )\r\n else:\r\n print( ' ',end = '' )\r\n\r\n\r\n\r\n", "from itertools import permutations\nn, m = [int(i) for i in input().split()]\nmaxsum = -1\nans = []\nfor per in permutations(range(1,n+1),n):\n thissum = 0\n for i in range(n):\n for j in range(i,n):\n thissum += min(per[i:j+1])\n if thissum > maxsum:\n maxsum = thissum\n ans = [per]\n elif thissum == maxsum:\n ans.append(per)\nprint(' '.join([str(i) for i in ans[m-1]]))\n", "n, m = map(int, input().split())\r\ns = 0\r\nflag = False\r\nk = 0\r\nmyset = set()\r\nflag1 = True\r\nfor j in range(n):\r\n if n in myset:\r\n for i in range(n, 0, -1):\r\n if i not in myset:\r\n print(i, end = ' ')\r\n flag1 = False\r\n if flag1 == False:\r\n break \r\n flag = False\r\n s = 0\r\n for i in range(n):\r\n if s < m <= s + 2**(n - i - 2 - k):\r\n print(i + 1 + k, end = ' ')\r\n myset.add(i + 1 + k)\r\n k = i + 1 + k\r\n flag = True\r\n break\r\n s += (2**(n - i - 2 - k))\r\n if flag == False:\r\n print(n, end = ' ')\r\n myset.add(n)\r\n k = n\r\n m -= s\r\n \r\n \r\n \r\n\r\n ", "def rek(s,t):\r\n global q,n\r\n for x in range(t+1,n+1):\r\n y=s[:n-x]+s[n-x:][::-1]\r\n q.append(y)\r\n rek(y,x)\r\n \r\nn,m=map(int,input().split())\r\na=''.join(map(str,range(1,n+1)))\r\nq=[a]\r\nrek(a,1)\r\nq.sort()\r\nprint(' '.join(q[m-1]))", "from sys import stdin, stdout\r\nfrom math import *\r\nfrom itertools import *\r\n\r\ndef solve(test):\r\n n, m = list(map(int, test.strip().split()))\r\n l, r = [], []\r\n m -= 1\r\n b = []\r\n for _ in range(n - 1):\r\n b.append(m % 2)\r\n m //= 2\r\n b = list(reversed(b)) + [0]\r\n for c in range(1, n + 1):\r\n if b[c - 1] == 0:\r\n l.append(c)\r\n else:\r\n r.append(c)\r\n return \" \".join(map(str, l + list(reversed(r))))\r\n \r\nstdout.write(str(solve(stdin.read())))\r\n", "n, m = map(int, input().split())\n\ndef ans(elems, m):\n n = len(elems)\n pow = 2 ** (n - 1)\n if m >= pow:\n return elems[::-1]\n pow //= 2\n j = 0\n while m > pow:\n j += 1\n m -= pow\n pow //= 2\n return [elems[j]] + ans(elems[j + 1:], m) + elems[:j][::-1]\n\nelems = [i + 1 for i in range(n)]\nprint(\" \".join(map(str, ans(elems, m))))\n\n\n", "def find_kth(i, j, p, n, k, a):\n d = j - i\n if d == 1:\n a[i] = p\n return a\n if k < (1 << (d - 2)):\n a[i] = p\n return find_kth(i + 1, j, p + 1, n, k, a)\n else:\n a[j - 1] = p\n return find_kth(i, j - 1, p + 1, n, k - (1 << (d - 2)), a)\n\nn, m = map(int, input().split())\nans = find_kth(0, n, 1, n, m - 1, [0] * n)\nprint(' '.join(map(str, ans)))\n", "def func(n, a, b):\r\n if a > n:\r\n return\r\n val = 2 ** (n - a - 1)\r\n if b >= val:\r\n func(n, a + 1, b - val)\r\n print(a, end=\" \")\r\n else:\r\n print(a, end=\" \")\r\n func(n, a + 1, b)\r\n\r\n\r\nif __name__ == '__main__':\r\n _n, _m = map(int, input().split())\r\n func(_n, 1, _m - 1)\r\n", "#file = open(\"\", 'r')\n#f = lambda:file.readline()\nf= lambda: input()\n\nn,m = map(int, f().split())\n\nmost = 0\n\np = []\n\nfor i in range(1, n+1):\n p.append(i)\n most += i * (n+1-i)\n\ndef next_perm():\n i = len(p)-1\n while i >0 and p[i-1] >= p[i]:\n i-=1\n\n if i <= 0:\n return False\n\n j = len(p)-1\n\n while p[j]<= p[i-1]:\n j-= 1\n\n p[i-1],p[j] = p[j],p[i-1]\n\n j = len(p)-1\n while(i < j):\n p[i],p[j] = p[j],p[i]\n i += 1\n j -= 1\n\n return True\n\ndef fp():\n s = 0\n for i in range(1, n+1):\n for j in range(i, n+1):\n s += min(p[i-1:j])\n return s\n\nwhile(m > 0):\n if (fp() == most):\n m-= 1\n if m == 0:\n break\n\n next_perm()\n\nprint(\" \".join(str(e) for e in p))\n \n", "from itertools import permutations as p\n\nn, m = map(int, input().split())\n\ndef f(p):\n ret = 0\n for i in range(len(p)):\n for j in range(i, len(p)):\n ret += min(p[i:j + 1])\n return ret\n\ndef get(n, last, avail, rank):\n if rank == n:\n return sorted(avail, reverse=True)\n\n n //= 2\n for x in sorted(avail)[:-1]:\n if x > last:\n if rank <= n:\n nx = avail[:]\n nx.remove(x)\n return [x] + get(n, x, nx, rank)\n rank -= n\n n //= 2\n\nprint(' '.join(map(str, get((1 << (n - 1)), 0, list(range(1, n + 1)), m))))\n", "import itertools\nimport collections\n\n\nf = lambda p: sum(itertools.starmap(lambda i, j: min(p[i: j + 1]), itertools.combinations_with_replacement(range(n), 2)))\n\nn, m = map(int, str.split(input()))\nmem = collections.defaultdict(list)\nfor p in itertools.permutations(range(1, n + 1), n):\n\n mem[f(p)].append(p)\n\nprint(str.join(\" \", map(str, mem[max(mem)][m - 1])))\n", "#!/usr/bin/env python3\nimport collections, itertools, fractions, functools, heapq, math, queue\n\ndef solve():\n n, m = map(int, input().split())\n found = []\n maxf = 0\n for p in itertools.permutations(list(range(1, n+1))):\n p = list(p)\n f = 0\n for i in range(n):\n M = p[i]\n for j in range(i, n):\n M = min(M, p[j])\n f += M\n if f > maxf:\n maxf = f\n found = [p]\n elif f == maxf:\n found.append(p)\n\n found.sort()\n return str.join(' ', map(str, found[m-1]))\n\nif __name__ == '__main__':\n print(solve())\n\n", "n, m = [int(_) for _ in input().split()]\r\na = [0] * (n + 1)\r\nl, r = 1, n\r\n\r\nfor i in range(1, n + 1):\r\n if m <= 1 << max((n - i - 1), 0):\r\n a[l] = i\r\n l += 1\r\n else:\r\n a[r] = i\r\n r -= 1\r\n m -= 1 << max((n - i - 1), 0)\r\n\r\na.pop(0)\r\nprint(\" \".join(map(str, a)))", "n,m=map(int, input().split())\r\nout=[n]\r\ni=n-1\r\nm-=1\r\nfor _ in range(n-1):\r\n if m%2:\r\n out.append(i)\r\n else:\r\n out=[i]+out\r\n \r\n m//=2\r\n i-=1\r\n\r\nfor i in out:\r\n print(i, end=\" \")\r\nprint()\r\n", "n,m = map(int, input().split())\r\na = [i for i in range(1,n+1)]\r\nused = [0] * (n+1)\r\nc = 0\r\nt = 0\r\n\r\ndef gen(ind):\r\n global c, t\r\n if t:\r\n return\r\n if ind == n:\r\n s=0\r\n for k in range(n):\r\n mi = a[k]\r\n for d in range(k,n):\r\n if mi > a[d]:\r\n mi = a[d]\r\n s+=mi\r\n if s == ma:\r\n c+=1\r\n if c == m:\r\n print(*a)\r\n t = 1\r\n return\r\n return\r\n for i in range(1,n+1):\r\n if t:\r\n return\r\n if not used[i]:\r\n used[i] = 1\r\n a[ind] = i\r\n gen(ind+1)\r\n a[ind] = 1\r\n used[i] = 0\r\n return\r\n\r\nma = 0\r\nfor i in range(n-1,-1,-1):\r\n ma+=(n-i)*a[i]\r\ngen(0)", "n,m=map(int,input().split())\r\narr=[0]*(n)\r\n\r\ndef dfs(pos,m,i,j):\r\n if pos==n+1:\r\n return\r\n if m>2**(n-pos-1):\r\n arr[j]=pos\r\n \r\n dfs(pos+1,m-2**(n-pos-1),i,j-1)\r\n else:\r\n arr[i]=pos\r\n dfs(pos+1,m,i+1,j)\r\ndfs(1,m,0,n-1)\r\nprint(*arr)", "from itertools import permutations\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\ndef f(p):\r\n res = 0\r\n for i in range(len(p)):\r\n for j in range(i, len(p)):\r\n res += min(p[i:j + 1])\r\n return res\r\n\r\nres = f(range(1, n + 1))\r\ni = 0\r\nfor p in permutations(range(1, n + 1)):\r\n if f(p) == res:\r\n i += 1\r\n if i == m:\r\n print(\" \".join(list(map(str, p))))\r\n break", "#!/usr/bin/python3\n\ndef gen(n, start, t):\n if n == 1:\n return [start]\n if t <= 2 ** (n - 2):\n return [start] + gen(n - 1, start + 1, t)\n else:\n return gen(n - 1, start + 1, t - 2 ** (n - 2)) + [start]\n\n\nn, t = map(int, input().split())\nprint(\" \".join(map(str, gen(n, 1, t))))\n", "'''\r\nCreated on Feb 11, 2015\r\n\r\n@author: mohamed265\r\n'''\r\ndef fun(n, m):\r\n m -= 1\r\n solu = [0] * n\r\n l = n - 1\r\n po = l - 1\r\n o = 0\r\n for i in range(n):\r\n # print (m , pow(2, po) )\r\n if m >= pow(2, po):\r\n solu[l] = i + 1\r\n m -= pow(2, po)\r\n l -= 1\r\n else:\r\n solu[o] = i + 1\r\n o += 1\r\n po -= 1\r\n print(*solu)\r\n\r\ntemp = [int(x) for x in input().split()]\r\nn = temp[0]\r\nm = temp[1]\r\n#for i in range(1,17):\r\nfun(n,m)\r\n \r\n \r\n", "def main():\n n, m = map(int, input().split())\n m -= 1\n aa = [0] * n\n lo, hi = 0, n - 1\n t = 2 ** (n - 2)\n for i in range(1, n + 1):\n if m < t:\n aa[lo] = i\n lo += 1\n else:\n aa[hi] = i\n hi -= 1\n m -= t\n t //= 2\n print(*aa)\n\n\nif __name__ == '__main__':\n main()", "arc = []\ndef sv(a,b,c,n,v):\n\tif n < c//2:\n\t\tarc[a] = v\n\t\tif b-a>1: sv(a+1,b,c//2,n,v+1)\n\telse:\n\t\tarc[b-1] = v\n\t\tif b-a>1: sv(a,b-1,c//2,n-c//2,v+1)\n\nn, m = map(int, input().split())\narc = [0]*n\nssc = 1<<(n-1)\nsv(0, n, ssc, m-1, 1)\nprint(' '.join(map(str, arc)))\n", "\r\nn, m = map(int, input().split())\r\n\r\ndef gen(n, m, now):\r\n if n == 1:\r\n return [now]\r\n if m <= 2 ** (n - 2):\r\n return [now] + gen(n - 1, m, now + 1)\r\n else:\r\n return gen(n - 1, m - 2 ** (n - 2), now + 1) + [now]\r\n\r\np = 2 ** (n - 2)\r\n\r\nprint(' '.join(map(str, gen(n, m, 1))))", "n, m = map(int, input().split())\r\na = [0 for i in range(n)]\r\nl, r = 0, n - 1\r\nm -= 1\r\n\r\nfor i in range(1, n + 1):\r\n cur = 2**(n - i - 1)\r\n\r\n if (m >= cur):\r\n m -= cur\r\n a[r] = i\r\n r -= 1\r\n else:\r\n a[l] = i\r\n l += 1\r\n \r\nprint(*a)\r\n", "def f(n, m):\r\n if n == 1:\r\n return [1]\r\n l = f(n - 1, (m + 1) // 2);\r\n d = l.index(n - 1);\r\n l.insert(d + m % 2, n);\r\n return l\r\nprint(*f(*map(int, input().split())))", "n, m = map(int, input().split())\r\nt = [n]\r\nfor i in range(1, n): t = t + [n - i] if m - 1 & 1 << i - 1 else [n - i] + t\r\nfor q in t: print(q)", "n, m = [int(x) for x in input().split()]\n\nbest = 0\nans = []\n\ndef foo(p):\n\tans = 0\n\tfor i in range(n):\n\t\tfor j in range(i,n):\n\t\t\tans += min(p[i:j+1])\n\treturn ans\n\ndef eval(p):\n\tglobal ans, best\n\tval = foo(p)\n\tif val > best:\n\t\tans = [p]\n\t\tbest = val\n\telif val == best:\n\t\tans.append(p)\n\ndef generate(l=[],remaining = list(range(1,n+1))):\n\tif not remaining:\n\t\teval(l)\n\telse:\n\t\tfor i, x in enumerate(remaining):\n\t\t\tgenerate(l+[x],remaining[:i] + remaining[i+1:])\n\ngenerate()\nprint(' '.join(str(x) for x in ans[m-1]))", "from itertools import *\r\nmaxans = 0\r\nposs = []\r\ndef getsum(perm):\r\n global maxans, poss\r\n ans = 0\r\n n = len(perm)\r\n h = [0] * n\r\n for i in range(n):\r\n for j in range(i, n):\r\n ans += min(perm[i:j + 1])\r\n# for k in range(i, j + 1):\r\n# h[k] += 1\r\n if ans > maxans:\r\n maxans = ans\r\n poss = [perm]\r\n elif ans == maxans:\r\n poss.append(perm)\r\n return ans\r\nn, m = map(int, input().split())\r\nlst = list(range(1, n + 1))\r\nperms = list(permutations(lst))\r\nfor i in range(len(perms)):\r\n getsum(perms[i])\r\n#print(maxans)\r\nprint(' '.join(map(str, poss[m - 1])))\r\n\r\n", "n, m = [int(i) for i in input().split()]\r\nbig = 1 << (n-1)\r\ndef r(i, m, half):\r\n half >>= 1\r\n if half == 0:\r\n print(i, end = ' ')\r\n return 0\r\n if m <= half:\r\n print(i, end = ' ')\r\n r(i + 1, m, half)\r\n else:\r\n r(i + 1, m - half, half)\r\n print(i, end = ' ')\r\nr(1, m, big)", "(n,m)=input().split()\r\n(n,m)=(int(n),int(m)-1)\r\npow2=[]\r\nu=1\r\nfor i in range(n):\r\n pow2.append(u)\r\n u*=2\r\nr=[]\r\nk=1\r\nwhile k<n:\r\n if m<pow2[n-k-1]:\r\n r.append(k)\r\n else:\r\n m-=pow2[n-k-1]\r\n k+=1\r\nz=[]\r\nfor i in range(n):\r\n if not (n-i in r):\r\n z.append(n-i)\r\nr+=z\r\nr=[str(i) for i in r]\r\nprint(' '.join(r))", "def func(n, a, b):\n\tif a > n:\n\t\treturn\n\tval = 2 ** (n - a - 1)\n\tif b >= val:\n\t\tfunc(n, a + 1, b - val)\n\t\tprint(a, end = \" \")\n\telse:\n\t\tprint(a, end = \" \")\n\t\tfunc(n, a + 1, b)\n\n\ndef main():\n\tn, m = map(int, input().split())\n\tfunc(n, 1, m - 1)\n\n\n\nif __name__ == '__main__':\n\tmain()\n\n\n", "n, m = map(int, input().split())\nlst = [0] * n\nl, r = 0, n - 1\ni = 1\nwhile (r > l):\n if m > 2 ** (r - l - 1):\n lst[r] = i\n m -= 2 ** (r - l - 1)\n r -= 1\n else:\n lst[l] = i\n l += 1\n i += 1\nlst[l] = i\nprint(' '.join(map(str, lst)))\n", "inp = input().split(' ')\r\nn = int(inp[0])\r\nm = bin(int(inp[1])-1)[2:]\r\nlenbin = n-1\r\nwhile len(m) < lenbin:\r\n m = '0' + m\r\nstart = []\r\nend = []\r\nfor x in range(n-1):\r\n if m[x] == '0':\r\n start = start + [x+1]\r\n else:\r\n end = [x+1] + end\r\nfinal = start + [n] + end\r\nfor x in final:\r\n print(x, end = ' ')\r\n", "import itertools\r\n\r\ndef factorial(n):\r\n x = 1\r\n for i in range(2,n+1):\r\n x *= i\r\n return x\r\n\r\ndef haha(t):\r\n l = []\r\n for i in range(len(t)):\r\n l.append(int(t[i]))\r\n p = 0\r\n for i in range(len(l)):\r\n for j in range(i,len(l)):\r\n p += min(l[i:j+1])\r\n return [p,l]\r\n \r\n\r\nn,m = map(int,input().split())\r\ns = ''\r\nfor i in range(1,n+1):\r\n s += str(i)\r\nl = [1,4,10,20,35,56,84,120]\r\nx = l[n-1]\r\nc = 0\r\nasdf = list(itertools.permutations(s))\r\nfor i in range(factorial(n)):\r\n y = haha(asdf[i])\r\n if y[0] == x:\r\n c += 1\r\n if c == m:\r\n y = y[1]\r\n for j in range(len(y)):\r\n y[j] = str(y[j])\r\n print(' '.join(y))\r\n break\r\n", "ip=[int(i) for i in input().split()]\r\nn,m=ip[0],(ip[1]-1)\r\n\r\nper='0'*(n+1-len(bin(m)))+bin(m)[2:len(bin(m))]\r\n\r\np=str(n)\r\n\r\nfor i in range (n-1,0,-1):\r\n if per[i-1]=='0':\r\n p=str(i)+' '+p\r\n else:\r\n p=p+' '+str(i)\r\n\r\nprint(p)\r\n", "n, m = map(int, input().split())\r\ns = 1\r\nc = n - 1\r\narr = [0] * n\r\ni = 0\r\nwhile i <= c:\r\n r = 0\r\n j = s\r\n while j <= n and r < m:\r\n if j < n:\r\n r += 2 ** (n - j - 1)\r\n j += 1\r\n #print(s, j, r, m)\r\n if j > s and j != n + 1:\r\n r -= 2 ** (n - j)\r\n m -= r\r\n j -= 1\r\n arr[i] = j\r\n while s < j:\r\n arr[c] = s\r\n c -= 1\r\n s += 1\r\n s += 1\r\n i += 1\r\nfor i in arr:\r\n print(i, end = ' ')", "n, m = map(int, input().split())\nt = [n]\nfor i in range(1, n): t = t + [n - i] if m - 1 & 1 << i - 1 else [n - i] + t\nfor q in t: print(q)\n\t \t \t \t \t \t\t\t\t\t\t\t\t \t\t\t \t\t", "import math\nn, m = tuple(int(x) for x in input().split())\nperm = list(range(1,n+1))\nchangeSeq = [m]\nwhile changeSeq[-1] > 1:\n binLen = len(bin(changeSeq[-1])) - 2\n power = 2**binLen if 2**(binLen - 1) != changeSeq[-1] else 2**(binLen - 1)\n changeSeq.append(power - changeSeq[-1] + 1)\n # print(changeSeq[-1])\n\nfor index in reversed(changeSeq):\n power = int(math.ceil(math.log2(index))) + 1\n perm[-power:] = reversed(perm[-power:])\n\nprint(\" \".join(str(x) for x in perm))\n", "n, m = map(int, input().split())\r\ncur = 1\r\nmaxn = 2 ** (n - 1)\r\nperm = [0] * n\r\nl = 0\r\nr = n - 1\r\nwhile (r >= l):\r\n if m > maxn // 2:\r\n perm[r] = cur\r\n m -= maxn // 2\r\n r -= 1\r\n else:\r\n perm[l] = cur\r\n l += 1\r\n cur += 1\r\n maxn //= 2\r\nprint(*perm)", "from itertools import permutations\n\ndef f(l):\n\tn = len(l)\n\tres = 0\n\tfor i in range(n):\n\t\tfor j in range(i + 1, n + 1):\n\t\t\tres += min(l[i:j])\n\treturn res\n\nn, m = (int(x) for x in input().split())\nres = 0\nresl = []\nfor perm in permutations(range(1, n + 1)):\n\tcur = f(perm)\n#\tprint(perm, cur)\n\tif cur > res:\n\t\tres = cur\n\t\tresl = []\n\tif cur == res:\n\t\tresl.append(perm)\n#print(res)\nprint(' '.join(str(x) for x in resl[m - 1]))\n", "from itertools import permutations\n\ndef f(perm):\n res = 0\n for i in range(len(perm)):\n for j in range(i, len(perm)):\n res += min(perm[i:j + 1])\n return res\n\nn, m = list(map(int, input().split()))\nres = f(range(1, n + 1))\n\ni = 0\nfor p in permutations(range(1, n + 1)):\n if f(p) == res:\n i += 1\n if i == m:\n print(\" \".join(list(map(str, p))))\n break\n\n", "__author__ = 'yushchenko'\r\n\r\ndef countf(f):\r\n sum = 0\r\n for i in range(len(f)):\r\n for j in range(len(f))[i:]:\r\n # print(i, j)\r\n # print(f[i:j + 1])\r\n sum += min(f[i:j + 1])\r\n return sum\r\n\r\nimport itertools\r\nn,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nmaxf = 0;\r\ncount = 0;\r\nsave = ()\r\nfor x in itertools.permutations(range(n + 1)[1:]):\r\n t = countf(x)\r\n if t > maxf:\r\n maxf = t\r\n count = 0\r\n if t == maxf:\r\n # print (x , '-' , t)\r\n count = count + 1\r\n if count == m:\r\n save = x\r\nprint(' '.join(str(e) for e in save))\r\n\r\n\r\n\r\n", "from sys import stdin, stdout\r\nfrom math import *\r\nfrom itertools import *\r\n\r\ndef f(p):\r\n s = 0\r\n for i in range(len(p)):\r\n for j in range(i + 1, len(p) + 1):\r\n s += min(p[i:j])\r\n return s\r\n\r\ndef solve(test):\r\n n, m = list(map(int, test.strip().split()))\r\n return \" \".join(list(map(str, \r\n sorted(\r\n map(lambda x: (x, f(x)), \r\n list(permutations(range(1, n + 1)))),\r\n key=lambda x: -x[1])\r\n [m - 1][0])))\r\n\r\nstdout.write(str(solve(stdin.read())))\r\n", "import sys\nn,m=map(int,input().split())\nsys.setrecursionlimit(1000001)\nl=[]\ncnt,ans=0,-2147483648\ndef perm(depth:int):\n global ans,cnt\n if cnt>m:return\n if depth==n+1:\n s=0\n for i in range(0,len(l)-1):\n for j in range(i+1,len(l)):s+=min(l[i:j+1])\n if s>ans:\n cnt=0\n ans=s\n if s==ans:cnt+=1\n if cnt==m:\n print(*l)\n sys.exit()\n return\n for i in range(1,n+1):\n if i in l:continue\n l.append(i)\n perm(depth+1)\n l.pop()\nperm(1)", "ii=lambda:int(input())\r\nkk=lambda:map(int, input().split())\r\nll=lambda:list(kk())\r\n\r\nn,k=kk()\r\npre,post = [],[]\r\nk-=1\r\nv = 1\r\nfor i in range(n-2,-1,-1):\r\n\tif k&(2**i):\r\n\t\tpost.append(v)\r\n\telse:\r\n\t\tpre.append(v)\r\n\tv+=1\r\nprint(*pre,n,*reversed(post))", "import sys\nimport math\nimport itertools\n\nTESTING = False\n\ndef helper(length, knum):\n if length <= 1: return [1]\n possibilties = pow(2, length - 1);\n if knum <= possibilties / 2:\n temp = helper(length - 1, knum)\n for i in range(len(temp)): temp[i]+=1\n return [1]+temp;\n res = helper(length, possibilties - knum + 1);\n return res[::-1]\n\ndef solve():\n n , m = read()\n return helper(n, m)\n\ndef read(mode=2):\n inputs = input().strip()\n if mode == 0: return inputs # String\n if mode == 1: return inputs.split() # List of strings\n if mode == 2: return list(map(int, inputs.split())) # List of integers\n\n\ndef write(s=\"\\n\"):\n if s is None: s = \"\"\n if isinstance(s, list): s = \" \".join(map(str, s))\n if isinstance(s, tuple): s = \" \".join(map(str, s))\n s = str(s)\n print(s, end=\"\")\n\n\ndef run():\n if TESTING: sys.stdin = open(\"test.txt\")\n res = solve()\n write(res)\n\n\nrun()" ]

[ "_, values,i,years = int(input()),[int(i) for i in input().split(\" \")],1,[]\nif 1 in values:\n\tyears.append(values.index(1))\n\ti=2\n\twhile i in values[years[-1]:]:\n\t\tyears.append(values[years[-1]:].index(i)+years[-1])\n\t\ti+=1\nprint(len(years))\nif len(years) !=0:\n\tfor year in years:\n\t\tprint(2001+year,end=\" \")\n\tprint()", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = []\r\ncurr = 1\r\nfor i in range(n):\r\n if arr[i]==curr:\r\n curr+=1\r\n ans.append(2001+i)\r\nif ans:\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n print(0)", "n = int(input())\r\na = list(map(int, input().split()))\r\nx, y, j = 1, [], 1\r\nfor i in a:\r\n if i == x:\r\n x += 1\r\n y.append(2000+j)\r\n j += 1\r\nprint(len(y))\r\nfor i in y:\r\n print(i, end=\" \")", "i=int(input())\r\nl=[]\r\nfor y,x in enumerate(list(map(int,input().split())),2001):\r\n if x-1==len(l): l.append(y)\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nout = []\r\nfor i in range(n):\r\n if l[i] == len(out)+1 :\r\n out.append(i+1)\r\nprint(len(out))\r\nfor i in out :\r\n print(2000+i, end=\" \")", "n = int(input())\r\nl = list(map(int, input().split()))\r\nk = 1\r\nr = []\r\n\r\nfor i in range(n):\r\n if l[i] == k:\r\n k += 1\r\n r.append(i + 2001)\r\n\r\nprint(len(r))\r\n\r\nfor item in r:\r\n print(item, end = ' ')\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\ns = 1\r\nl = []\r\nfor i, v in enumerate(a):\r\n if v == s:\r\n l.append(2001+i)\r\n s += 1\r\nle = len(l)\r\nprint(le)\r\nif le != 0:\r\n print(*l)\r\n \r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nres = []\r\ns = 2001\r\nt = 1\r\nfor i in range(n):\r\n if a[i] == t:\r\n res.append(s)\r\n t+=1\r\n s+=1\r\nprint(len(res))\r\nprint(*res)", "import sys\r\n\r\narr_size = sys.stdin.readline()\r\n\r\nwhile arr_size:\r\n arr_size = int(arr_size)\r\n #print('arr_size', arr_size)\r\n array = sys.stdin.readline().split()\r\n #print('array', array)\r\n\r\n array = list(map(int, array))\r\n #print(array)\r\n\r\n \r\n \r\n years = [2000 + i + 1 for i in range(len(array))]\r\n #print(years)\r\n \"\"\"\r\n ids_ommit = [i for i in range(1, len(array)) if array[i-1] != array[i]-1 ]\r\n ids_ommit_neg = [i for i in range(len(array)) if array[i] <0 ]\r\n print(ids_ommit)\r\n print(ids_ommit_neg)\r\n \"\"\" \r\n #ids_ommit = []\r\n last_number = 0\r\n ids_to_choose = []\r\n\r\n for i in range(len(array)):\r\n if array[i] > 0:\r\n if array[i]-1 != last_number:\r\n next\r\n else:\r\n ids_to_choose.append(i)\r\n last_number = array[i]\r\n else:\r\n next\r\n #ids_ommit.append(i)\r\n\r\n #print(ids_to_choose)\r\n #print(ids_ommit)\r\n\r\n\r\n if(len(ids_to_choose) > 0):\r\n print(len(ids_to_choose))\r\n str_arr = list(map(str, [years[i] for i in ids_to_choose]))\r\n #print(str_arr)\r\n print(' '.join(str_arr))\r\n #print(' '.join([years[i] for i in ids_to_choose]))\r\n else:\r\n print('0')\r\n\r\n\r\n\r\n #for i in range(len(array)):\r\n # if array[i] > 0:\r\n #print(\"-----\")\r\n arr_size = sys.stdin.readline()\r\n\r\n", "input()\nt = []\nfor y, d in enumerate(map(int, input().split()), 2001):\n if d == len(t) + 1: t.append(y)\nprint(len(t), *t)\n \t\t\t\t \t \t\t \t \t \t \t \t \t \t", "import sys\r\nn = int(sys.stdin.readline())\r\na = [int(x) for x in sys.stdin.readline().split()]\r\n\r\ni = 0\r\nneeded_income = 1\r\nyears = []\r\nwhile i < n:\r\n if a[i] == needed_income:\r\n years.append(str(2001+i))\r\n needed_income += 1\r\n i += 1\r\n\r\nn_years = len(years)\r\nprint(n_years)\r\nif n_years > 0:\r\n print(\" \".join(years))\r\n", "n = int(input())\r\nxs = [int(x) for x in input().split()]\r\nex = 1\r\nr = []\r\nfor i in range(n):\r\n if xs[i] == ex:\r\n r.append(2001 + i)\r\n ex += 1\r\nprint(len(r))\r\nif r:\r\n print(*r)", "n=int(input())\r\n\r\nlst=list(map(int,input().split()))\r\nyear=2000\r\nyear_lst=[]\r\nj=1\r\nwhile True:\r\n try:\r\n i=lst.index(j)\r\n j+=1\r\n \r\n lst=lst[i+1:]\r\n\r\n year+=i+1\r\n year_lst.append(str(year))\r\n except:\r\n break\r\n\r\nif year_lst:\r\n print(len(year_lst))\r\n print(' '.join(year_lst))\r\nelse:\r\n print(0)\r\n \r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\ncurr = 1\r\nfor i in range(n):\r\n if(a[i] == curr):\r\n curr += 1\r\n ans.append(2001+i)\r\nprint(len(ans))\r\nif(len(ans) > 0):\r\n print(*ans)\r\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nANS=[]\r\nnow=1\r\n\r\nfor i in range(n):\r\n if A[i]==now:\r\n ANS.append(2000+i+1)\r\n now+=1\r\n\r\nprint(len(ANS))\r\nprint(*ANS)\r\n", "n=int(input())\r\na= list(map(int,input().split()))\r\nj=1\r\nans=[]\r\nfor _ in range(n):\r\n if a[_]==j:\r\n ans.append(_+2001)\r\n j+=1\r\nprint(j-1)\r\nif ans:\r\n for _ in range(j-1):\r\n print(ans[_],end=' ')", "def main():\r\n args = int(input())\r\n tp = list(map(int, input().split(\" \")))\r\n count = 0\r\n n = 0\r\n arr = []\r\n for i in range(len(tp)):\r\n if tp[i] == n+1:\r\n n+=1\r\n arr.append(2000+i+1)\r\n print(n)\r\n print(*arr) \r\n return True\r\n\t\r\n \r\nif __name__ == \"__main__\":\r\n\tmain()", "\r\ndef main():\r\n d = input()\r\n vals = [int(v) for v in input().split()]\r\n cur = 0\r\n s = 1\r\n res = []\r\n for i, c in enumerate(vals):\r\n if c == s:\r\n s+=1\r\n res.append(2001+i)\r\n print(len(res))\r\n print(\" \".join([str(r) for r in res]))\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "d=input()\r\nl1=list(map(int,input().split()))\r\nk1=1\r\nk2=[]\r\nfor i in range(len(l1)):\r\n if(l1[i]==k1):\r\n k2.append(2001+i)\r\n k1+=1\r\n \r\nif(k1!=1):\r\n print(len(k2))\r\n for x in k2:\r\n print(x,end=\" \")\r\n print()\r\nelse:\r\n print(0)", "input()\r\nY = []\r\n\r\nfor y,a in enumerate(map(int, input().split()), 2001):\r\n if a == len(Y)+1:\r\n Y.append(y)\r\n\r\nprint(len(Y))\r\nprint(*Y)", "n = int(input())\r\na = list(map(int,input().split()))\r\ntf = False\r\nk = 1\r\nans = []\r\nfor i in range(0,len(a)):\r\n if (a[i]==k):\r\n k+=1\r\n tf = True\r\n ans.append(i+2001)\r\nprint(k-1)\r\nfor i in ans:\r\n print(i,end = ' ')", "n = int(input())\ndynamic = list(map(int, input().split()))\nres = []\n\nk = 1\nfor i in range(len(dynamic)):\n if dynamic[i] == k:\n k += 1\n res.append(i)\n\nk -= 1\nprint(k)\n\nif k != 0:\n for i in range(k - 1):\n print(res[i]+2001, end=\" \")\n print(res[k-1]+2001)\n", "import sys as sys\r\nn= int(input())\r\narr= list(map(int, input().split()))\r\nt=1 \r\nk=[]\r\nfor i in range(n):\r\n e= arr[i]\r\n if e==t:\r\n k.append(i)\r\n t+= 1\r\nif len(k)==0:\r\n print(0)\r\n sys.exit()\r\nprint(len(k))\r\nfor e in k:\r\n print(2001+e, end= \" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = []\r\ncurr = 1\r\nfor i, e in enumerate(a):\r\n if e == curr:\r\n curr += 1\r\n result.append(2001 + i)\r\nprint(len(result))\r\nif result:\r\n print(*result)", "n=int(input())\r\na=input().split()\r\np=1\r\nq=[]\r\nfor i in range (1,n+1):\r\n if int(a[i-1])==p:\r\n q.append(int(i+2000))\r\n p+=1\r\nprint(len(q))\r\nfor i in range (1,len(q)+1):\r\n print(q[i-1],end=\" \")\r\n", "n=int(input())\r\narr=1\r\na=[int(j) for j in input().split()]\r\nans=[]\r\nfor i in range(0,n) :\r\n if a[i]==arr :\r\n ans.append(2000+i+1)\r\n arr+=1\r\nprint(len(ans))\r\nfor i in range(0,len(ans)) :\r\n print(ans[i],end=\" \")", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\ncount=0\r\nt=1\r\nfor i in range(n):\r\n if a[i]==t:\r\n t+=1\r\n l.append(2001+i)\r\n count+=1\r\nprint(count)\r\nif count!=0:\r\n print(*l)", "n = int(input())\r\nyear = []\r\nnumber = [0]\r\ninput_data = str(input())\r\ndata = list(map(lambda x: int(x),input_data.split(' ')))\r\n\r\nfor i in range(0,len(data)):\r\n\tif data[i] == (number[-1])+1:\r\n\t\tnumber.append(data[i])\r\n\t\tyear.append(2000+i+1)\r\nif len(year) == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(len(year))\r\n\tprint(' '.join(str(e) for e in year))\r\n", "i=input\r\nn=i()\r\nm=list(map(int,i().split()))\r\nt=1\r\np=[]\r\nfor x in range(len(m)):\r\n if(t==m[x]):\r\n p.append(2001+x)\r\n t+=1\r\nprint(t-1)\r\nfor _ in range(len(p)):\r\n print(p[_],end=\" \")", "import sys\r\n\r\nk = sys.stdin.readline()\r\nwhile k:\r\n line = sys.stdin.readline()\r\n curr = 1\r\n years = []\r\n for i, x in enumerate(line.split()):\r\n if int(x) == curr:\r\n years.append(str(2000+int(i+1)))\r\n curr += 1\r\n if curr == 1:\r\n print(0)\r\n else:\r\n print(curr-1)\r\n print(' '.join(years))\r\n k = sys.stdin.readline()\r\n", "class solve:\r\n def __init__(self):\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n c,l,ans=1,0,[]\r\n for i in range(n):\r\n if a[i]==c:\r\n ans.append(2001+i)\r\n l+=1\r\n c+=1\r\n if l==0:\r\n print(0)\r\n else:\r\n print(l)\r\n print(*ans)\r\n \r\nobj=solve()", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nres = []\r\nd = 1\r\n\r\nfor i in range(n):\r\n if a[i]==d:\r\n d+=1\r\n res.append(2000+i+1)\r\n\r\nprint(len(res))\r\nfor i in res:\r\n print(i,end=\" \")", "n=int(input())\r\np=2000\r\na=list(map(int,input().split()))\r\nans=[]\r\nincome=0\r\nfor i in range(len(a)):\r\n if a[i]>0 and a[i]-income==1:\r\n ans.append(p+(i+1))\r\n income=a[i]\r\nprint(len(ans))\r\nif len(ans)==0:\r\n exit()\r\nprint(*ans)", "a=int(input());p=[]\r\nfor i,j in enumerate(map(int,input().split())):\r\n if j>0:\r\n p.append([2000+i+1,j])\r\np=sorted(p);t=1;ok=0;o=[]\r\nfor i in range(len(p)):\r\n if p[i][0]>ok and t==p[i][1]:o.append(p[i][0]);ok=p[i][0];t+=1\r\nprint(t-1);print(*o)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = []\r\ncur = 0\r\nfor i in range(n):\r\n if a[i] == cur + 1:\r\n b.append(2001 + i)\r\n cur += 1\r\nprint(len(b))\r\nprint(*b)\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\nr=1\r\nb=[]\r\nfor i in range(n):\r\n if a[i]==r:\r\n b.append(2000+i+1)\r\n r+=1\r\nprint(len(b))\r\nprint(*b)\r\n", "n = int(input())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nsol = []\r\n\r\nd = 1\r\n\r\nfor i in range(n):\r\n if a[i] == d:\r\n sol.append(2000 + i + 1)\r\n d += 1\r\nif len(sol) == 0:\r\n print(len(sol))\r\nelse:\r\n print(len(sol))\r\n print(*sol)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = []\r\nfor i in range(n) :\r\n if a[i] == len(b) + 1 :\r\n b.append(2001 + i)\r\n\r\nprint(len(b))\r\nprint(' '.join(map(str, b)))", "n=int(input())\nls=list(map(int,input().split()))\nif 1 not in ls:\n print(0)\nelse:\n c=1\n x=[ls.index(c)+1]\n ls=ls[ls.index(c):]\n l=n-len(ls)\n k=1\n while ls.index(c)<=(n-1):\n c+=1\n if c in ls:\n k+=1\n x.append(ls.index(c)+1+l)\n ls=ls[ls.index(c):]\n l = n - len(ls)\n else:\n break\n print(k)\n for i in range(k):\n if len(str(x[i]))==1:\n x[i]=\"200\"+str(x[i])\n elif len(str(x[i]))==2:\n x[i] = \"20\" + str(x[i])\n else:\n x[i] = \"2\" + str(x[i])\n print(*x)\n \t \t\t\t\t\t\t \t\t\t\t \t \t\t \t\t \t", "n = int(input())\na = list(map(int, input().split()))\ni = 1\nres = []\nfor j in range(n):\n\tif a[j] == i:\n\t\tres.append(2001 + j)\n\t\ti+=1\nprint(len(res))\nprint(*res)", "import sys\r\n\r\nn = sys.stdin.readline()\r\nwhile n:\r\n nums = [int(num) for num in sys.stdin.readline().split()]\r\n inc = 0\r\n years = []\r\n i = 1\r\n for num in nums:\r\n if num > 0:\r\n if num - inc == 1:\r\n inc += 1\r\n ans = 2000 + int(i)\r\n years.append(str(ans))\r\n i += 1\r\n res_1 = len(years)\r\n print(res_1)\r\n if res_1 != 0:\r\n res_2 = ' '.join(years)\r\n print(res_2)\r\n n = sys.stdin.readline()\r\n", "import math\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\n#a,b = map(int, input().strip().split(' '))\r\nif 1 not in lst:\r\n print(0)\r\nelse:\r\n ind=lst.index(1)\r\n p=2001+ind\r\n l=[p]\r\n c=1\r\n for j in range(ind+1,n):\r\n if lst[j]==c+1:\r\n c+=1\r\n l.append(2001+j)\r\n print(len(l))\r\n for j in range(len(l)):\r\n print(l[j],end=\" \")\r\n \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=1\r\nb=[]\r\nold=0\r\nwhile True:\r\n f=False\r\n for i in range(old,n):\r\n if x==a[i]:\r\n old=i\r\n f=True\r\n break\r\n if not f:\r\n break \r\n b.append(old+2001)\r\n x+=1\r\nprint(len(b))\r\nprint(*b)\r\n", "\r\nfrom sys import stdin, stdout\r\n\r\n\r\nyears = int(input())\r\n\r\nincomes = list(map(int,list(stdin.readline().split(' '))))\r\n\r\nrespuestas = list()\r\ncnt = 1\r\n\r\n\r\nfor x in range(years):\r\n if incomes[x] == cnt:\r\n respuestas.append(str(2000+x+1))\r\n cnt+=1\r\nprint(len(respuestas))\r\nif respuestas:\r\n print(' '.join(respuestas))", "import sys\r\nimport math\r\nimport os\r\n\r\n# To store no of test cases here (2).\r\n#t=int(sys.stdin.readline()) #\r\n# To store input here (0 1 1) and (0 1 2).\r\nn = int(sys.stdin.readline())\r\nb = sys.stdin.readline().split()\r\n\r\nnums = []\r\ncount = 1\r\nfor x in range(len(b)):\r\n\tnums.append(int(b[x]))\r\n\r\ndicty = {}\r\nlisty = []\r\nif max(nums) < 1:\r\n\tprint(0)\r\nelse:\r\n\tfor x,y in enumerate(nums):\r\n\t\tif y == count:\r\n\t\t\tlisty.append(str(2001+x))\r\n\t\t\tcount += 1\r\n\tprint(len(listy))\r\n\tprint(' '.join(listy))", "nums = int(input())\r\nlist2 = []\r\nm = 1\r\nlist1 = [int(h) for h in input().split()]\r\nfor i in range(len(list1)):\r\n if m == list1[i]:\r\n list2.append(i+1+2000)\r\n m += 1\r\nprint(len(list2))\r\nfor i in list2:\r\n print(i, end=' ')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nj = 1\r\nans = []\r\nfor i in range(len(a)):\r\n if a[i] == j:\r\n ans.append(2000 + i + 1)\r\n j += 1\r\nif len(ans) == 0:\r\n print(0)\r\nelse:\r\n print(len(ans))\r\n print(*ans)", "n = int(input())\r\ncontainer = list(map(int, input().split()))\r\n\r\nyears = list()\r\n\r\nif 1 in container:\r\n currentIndex = container.index(1, 0)\r\n years.append(2001+currentIndex)\r\n currentItem=1\r\n while True:\r\n if currentItem+1 in container[currentIndex:]:\r\n currentIndex=container.index(currentItem+1, currentIndex)\r\n if (currentIndex <=len(container)):\r\n currentItem+=1\r\n years.append(2001+currentIndex)\r\n if currentIndex==len(container)-1:\r\n break\r\n else:\r\n break\r\n\r\n\r\n'''if 1 in container:\r\n indexOfOne = container.index(1)\r\n years.append(2001 + indexOfOne)\r\n\r\n while indexOfOne < len(container) - 1:\r\n for j in range(indexOfOne + 1, len(container)):\r\n if (container[indexOfOne] + 1 == container[j]):\r\n years.append(2001 + j)\r\n indexOfOne = j\r\n indexOfOne -= 1\r\n break\r\n\r\n if j == len(container)-1:\r\n break\r\n indexOfOne += 1\r\n'''\r\n\r\n\r\nprint(len(years))\r\nfor item in years:\r\n print(item, end=\" \")", "n = int(input())\narr = [int(x) for x in input().split()]\ncurrent_looking_for = 1\ncurrent_year = 2001\noutput_arr = []\nfor element in arr:\n\tif(element == current_looking_for):\n\t\toutput_arr.append(current_year)\n\t\tcurrent_looking_for += 1\n\tcurrent_year += 1\nprint(len(output_arr))\nif(len(output_arr) > 0):\n\tprint(\" \".join([str(x) for x in output_arr]))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nst=2000\r\nx=1\r\nans=[]\r\n\r\nfor i in range(n):\r\n if a[i]==x:\r\n x+=1\r\n ans.append(st+i+1)\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=' ')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nd = []\r\nc = 1\r\nfor i in range(n):\r\n if w[i] == c:\r\n c += 1\r\n d.append(i+2001)\r\nprint(len(d))\r\nif len(d) != 0:\r\n print(' '.join(map(str, d)))", "n, c, v = int(input()), 1, []\r\nfor i, ai in enumerate(map(int, input().split())):\r\n if ai == c:\r\n v.append(i + 2001)\r\n c += 1\r\nprint(len(v))\r\nif v:\r\n print(' '.join(map(str, v)))" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n%2 == 0:\r\n print(\"NO\")\r\n exit()\r\nparent = list(map(int,input().split()))\r\nprint(\"YES\")\r\ns = [0]*n\r\nG = [[] for _ in range(n)]\r\nroot = -1\r\nfor i in range(n):\r\n parent[i] -= 1 \r\n if parent[i] != -1:\r\n G[parent[i]].append(i)\r\n else:\r\n root = i\r\n\r\nstk = [root]\r\nvis = [False]*n\r\nwhile stk:\r\n node = stk[-1]\r\n if not vis[node]:\r\n vis[node] = True\r\n for node0 in G[node]:\r\n stk.append(node0)\r\n else:\r\n stk.pop()\r\n s[node] += 1\r\n for node0 in G[node]:\r\n s[node] += s[node0]\r\n\r\nstk = [root]\r\nwhile stk:\r\n node = stk[-1]\r\n if vis[node]:\r\n vis[node] = False\r\n for node0 in G[node]:\r\n if s[node0]%2 == 0:\r\n stk.append(node0)\r\n else:\r\n stk.pop()\r\n print(node+1)\r\n for node0 in G[node]:\r\n if s[node0]%2 == 1:\r\n stk.append(node0)\r\n", "from collections import defaultdict,deque\r\nimport sys\r\nimport bisect\r\nimport math\r\ninput=sys.stdin.readline\r\nmod=1000000007\r\n\r\ndef bfs(root,count):\r\n q=deque([root])\r\n vis.add(root)\r\n while q:\r\n vertex=q.popleft()\r\n for child in graph[vertex]:\r\n if ans[child]==0:\r\n ans[child]=count+1\r\n count+=1\r\n if child not in vis:\r\n q.append(child)\r\n vis.add(child)\r\n \r\ngraph=defaultdict(list)\r\nn=int(input())\r\np=[int(i) for i in input().split() if i!='\\n']\r\nif n&1:\r\n for i in range(n):\r\n if p[i]!=0:\r\n graph[p[i]].append(i+1)\r\n graph[i+1].append(p[i])\r\n length=[0]*(n+1)\r\n for i in graph:\r\n length[i]=len(graph[i])\r\n CHECK,OBSERVE=1,0\r\n stack=[(OBSERVE,1,0)]\r\n ans=[0]*(n+1)\r\n count=0\r\n while stack:\r\n state,vertex,parent=stack.pop()\r\n if state==OBSERVE:\r\n stack.append((CHECK,vertex,parent))\r\n for child in graph[vertex]:\r\n if child != parent:\r\n stack.append((OBSERVE,child,vertex))\r\n else:\r\n if length[vertex]%2==0:\r\n count+=1\r\n ans[vertex]=count\r\n length[parent]-=1\r\n vis=set()\r\n bfs(1,count)\r\n out=[0]*(n)\r\n for i in range(1,n+1):\r\n out[ans[i]-1]=i\r\n print('YES')\r\n for i in out:\r\n sys.stdout.write(str(i)+'\\n')\r\nelse:\r\n print('NO')\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n" ]

[ "list1 = list(map(int,input().split()))\r\nn =0\r\nfor i in set(list1):\r\n if (list1.count(i)>1):\r\n n = max(n,i*min(3,list1.count(i)))\r\nprint(sum(list1)-n) \r\n ", "t = sorted(list(map(int, input().split())))\r\nb = []\r\nfor i in range(5):\r\n\tif t.count(t[i])>1:\r\n\t\tif t.count(t[i])>3:\r\n\t\t\tb.append(t[i]*3)\r\n\t\telse:\r\n\t\t\tb.append(t[i]*t.count(t[i]))\r\nif len(b)==0:\r\n\tprint(sum(t))\r\nelse:\r\n\tprint(sum(t)-max(b))", "L = sorted([int(x) for x in input().split()])\r\nif len(set(L)) == len(L): print(sum(L))\r\nelse:\r\n S = set()\r\n A = []\r\n for i in range(5):\r\n if L.count(L[i]) > 1: S = S.union({L[i]})\r\n for i in S:\r\n if L.count(i) == 2: A.append(2*i)\r\n else: A.append(3*i)\r\n print(sum(L) - max(A))\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\na=L()\r\nsuma=sum(a)\r\n\r\ncnt=Counter(a)\r\n\r\nans=suma\r\nfor i in cnt:\r\n if cnt[i]>=2:\r\n ans=min(ans,suma-2*i)\r\n if cnt[i]>=3:\r\n ans=min(ans,suma-3*i)\r\n\r\nprint(ans)", "if __name__ == '__main__':\n arr = sorted(list(map(int, input().split())))\n\n s = sum(arr)\n\n narr = []\n\n for x in arr:\n cnt = 0\n for y in arr:\n cnt += int(y == x)\n cnt = min(cnt, 3)\n if cnt > 1:\n narr.append(x * cnt)\n else:\n narr.append(0)\n\n print(s - max(narr))", "l=list(map(int,input().split()))\r\nl.sort()\r\nd,c,s={},1,0\r\nfor i in range(4):\r\n if l[i]==l[i+1]:\r\n c+=1 \r\n else:\r\n d[l[i]]=c \r\n c=1 \r\nd[l[4]]=c \r\nfor i in d:\r\n if d[i]>1:\r\n s=max(s,min(3,d[i])*i)\r\nprint(sum(l)-s)\r\n ", "t = [int(i) for i in input().split()]\r\n\r\ntwos = []\r\nthree = []\r\n\r\nfor i in set(t):\r\n x = t.count(i)\r\n if x == 2:\r\n twos.append(i)\r\n \r\n if x >= 3:\r\n three.append(i)\r\n\r\np = 0\r\nq = 0\r\n\r\nif twos:\r\n p = max(twos) * 2\r\nif three:\r\n q = three[0] * 3\r\n\r\nz = max(p, q)\r\nprint(sum(t) - z)\r\n", "a = list(map(int,input().split()))\r\nb = set(a)\r\nz ={}\r\nq =0\r\nfor i in a:\r\n\tif a.count(i)>1:\r\n\t\tz[i] = a.count(i)\r\nfor i in z:\r\n\tif z[i]>2:\r\n\t\tif i*3>q:q = i*3\r\n\telse:\r\n\t\tif i*2>q:q = i*2\r\nprint(sum(a)-q)\r\n", "t=list(map(int,input().split()))\r\nm={}\r\nfor i in range(5):\r\n if t[i] in m:\r\n m[t[i]]+=1\r\n else:\r\n m[t[i]]=1\r\nmax=0\r\nfor key in m:\r\n if m[key]>=2:\r\n if max<min(m[key],3)*key:\r\n max=min(m[key],3)*key\r\nprint(sum(t)-max)", "from collections import Counter\r\narr = list(map(int, input().split()))\r\nfreq = Counter(arr)\r\n\r\nmx = 0\r\n\r\nfor key, val in freq.items():\r\n if val > 1:\r\n mx = max(key*min(3,val), mx)\r\n\r\nprint(sum(arr)-mx)\r\n", "\r\n\r\n\r\ndef main():\r\n a = list(map(int, input().split()))\r\n if len(a) == len(set(a)):\r\n print(sum(a))\r\n else:\r\n s = sum(a)\r\n b = list()\r\n c = set(a)\r\n for i in c:\r\n if a.count(i) >= 3:\r\n b.append(s - i * 3)\r\n elif a.count(i) == 2:\r\n b.append(s - i * 2)\r\n \r\n print(min(b))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "entrada = input()\n\ncards = entrada.split(\" \")\ninteger_cards = []\n\nfor card in cards:\n integer_cards.append(int(card))\n\ninteger_cards.sort(reverse = True)\n\ndict_cards = {}\nfor card in integer_cards:\n if (dict_cards.get(card) != None):\n dict_cards[card] += 1\n else:\n dict_cards.update({card: 1})\n\nt1 = 0\nt2 = 0\nfor card in dict_cards:\n if dict_cards[card] == 2:\n t1 = max(t1, card)\n elif dict_cards[card] >= 3:\n t2 = max(t2, card)\n\nif t1*2 > t2*3:\n print(sum(integer_cards) - t1*2)\nelse:\n print(sum(integer_cards) - t2*3)\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\n\r\nd = {}\r\ns = 0\r\nfor el in a:\r\n if el in d:\r\n d[el] += 1\r\n else:\r\n d[el] = 1\r\n s += el\r\n \r\nc = 0\r\nfor el in d:\r\n if d[el] > 1:\r\n c = max(c, el * min(3, d[el]))\r\n \r\n#print(s, c * cnt)\r\nprint(s - c)", "from collections import Counter\n\nt = input().split(' ')\n\nfor i in range(5):\n t[i] = int(t[i])\n\ncounts = Counter(t)\n\nsum_removed_cards = []\n\nfor key, value in counts.items():\n if value == 2:\n sum_removed_cards.append(key * 2)\n elif value >= 3:\n sum_removed_cards.append(key * 3)\n\nif len(sum_removed_cards) > 0:\n print(sum(t) - max(sum_removed_cards))\nelse:\n print(sum(t))", "a=list(map(int,input().split()))\r\nx=[]\r\nfor i in a:\r\n if a.count(i)>=2 and i not in x:\r\n x.append(i)\r\nf=0\r\nz=0\r\nfor i in x:\r\n if i*a.count(i)>z:\r\n z=i*a.count(i)\r\n f=i\r\nfor i in range(3):\r\n if f in a:\r\n a.remove(f)\r\nprint(sum(a))\r\n", "a=list(map(int,input().split()))\r\nd=dict()\r\nsu=0\r\not=0\r\nfor i in a:\r\n d[i]=d.get(i,0)+1\r\n su=su+i\r\n if d[i]>1:\r\n ot=max(ot,i*min(d[i],3))\r\nprint(su-ot)", "a=[int(x) for x in input().split()]\r\na.sort()\r\npos2,pos3=[],[]\r\nfor i in range(1,5):\r\n if a[i]==a[i-1]:\r\n pos2.append(i)\r\nfor i in range(1,4):\r\n if a[i]==a[i-1] and a[i]==a[i+1]:\r\n pos3.append(i)\r\nif len(pos2)==0:\r\n print(sum(a))\r\nelif len(pos2)==1:\r\n print(sum(a)-2*a[pos2[0]])\r\nelif len(pos2)==2:\r\n if len(pos3)==1:\r\n print(sum(a)-3*a[pos3[0]])\r\n else:\r\n print(sum(a)-2*a[pos2[1]])\r\nelif len(pos2)==3:\r\n if len(pos3)==2:\r\n print(sum(a)-3*a[pos3[0]])\r\n else:\r\n if a[0]==a[1] and a[1]==a[2]:\r\n if 3*a[0]>2*a[3]:\r\n print(sum(a)-3*a[0])\r\n else:\r\n print(sum(a)-2*a[3])\r\n else:\r\n print(sum(a)-3*a[2])\r\nelif len(pos2)==4:\r\n print(a[0]*2)", "lst = sorted((list(map(int, input().split()))), reverse=True)\r\nmax_number = 0\r\n\r\nfor card in range(len(lst)):\r\n if lst.count(lst[card]) == 2:\r\n max_number = max(2*lst[card], max_number)\r\n elif lst.count(lst[card]) >= 3:\r\n max_number = max(3*lst[card], max_number)\r\nprint(sum(lst) - max_number)", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport string\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n arr=get_list()\r\n ans=sum(arr)\r\n counter=collections.Counter(arr)\r\n val=0\r\n for i in counter:\r\n freq=counter[i]\r\n if freq>=2:\r\n val=max(val,(min(freq,3)*i))\r\n print(ans-val)", "li=list(map(int,input().split()))\r\nki=[]\r\nfor i in range(len(li)):\r\n k=li.count(li[i])\r\n if k>1:\r\n if k==2:\r\n ki.append(sum(li)-li[i]*2)\r\n else:\r\n ki.append(sum(li) - li[i] * 3)\r\nif len(ki)>0:\r\n print(min(ki))\r\nelse:\r\n print(sum(li))", "lst=list(map(int,input().split()))\r\ndct=dict()\r\nfor ele in lst:\r\n if ele not in dct and lst.count(ele)>=2:\r\n dct[ele]=lst.count(ele)\r\nif len(dct)==1:\r\n tot=0\r\n for k,v in dct.items():\r\n if v>3:\r\n v=3\r\n tot=k*v\r\n print(sum(lst)-tot)\r\nelif len(dct)>1:\r\n tot=[]\r\n for k,v in dct.items():\r\n if v>3:\r\n v=3\r\n tot.append(k*v)\r\n print(sum(lst)-max(tot))\r\nelse:\r\n print(sum(lst))", "l=list(map(int,input().split()))\r\ns=set(l)\r\ny=[0]\r\nfor i in s:\r\n x=l.count(i)\r\n if(x==1):\r\n continue\r\n else:\r\n y.append(min(3,x)*i)\r\nprint(sum(l)-max(y))", "x = list(map(int, input() .split()))\r\nt = [-1]*(len(x))\r\nj,y = 0,0\r\nc = True\r\nfor i in range(len(x)):\r\n if x.count(x[i]) == 2 or x.count(x[i]) == 3 :\r\n t[j] = x.count(x[i]) * x[i]\r\n j+=1\r\n c = False\r\n elif x.count(x[i]) > 3:\r\n t[j] = x[i] * 3\r\n j+=1\r\n c = False \r\nfor k in range(len(x)):\r\n y+= x[k]\r\n\r\nif c == True:\r\n print(y)\r\nelse:\r\n r = max(t)\r\n print(y-r) ", "d = dict()\r\nlst = [*map(int, input().split())]\r\nfor card in lst:\r\n if card in d:\r\n d[card] += 1\r\n else:\r\n d[card] = 1\r\n\r\nopt = 0\r\nfor card in d:\r\n if d[card] >= 3:\r\n if opt <= card * 3:\r\n opt = card * 3\r\n elif d[card] == 2:\r\n if opt <= card * 2:\r\n opt = card * 2\r\n\r\nprint(sum(lst) - opt)\r\n", "a = list(map(int, input().split()))\r\nans = sum(a)\r\nfor i in a:\r\n c = a.count(i)\r\n if c > 1:\r\n ans = min(ans, sum(a) - min(c, 3) * i)\r\n\r\nprint(ans)", "import sys\r\nimport os\r\nfrom collections import Counter\r\n\r\n\r\ndef changeStdioToFile():\r\n path = os.path.dirname(os.path.abspath(__file__))\r\n sys.stdin = open(f'{path}/input.txt', 'r')\r\n sys.stdout = open(f'{path}/output.txt', 'w')\r\n\r\n\r\n#changeStdioToFile()\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n a = [int(x) for x in input().split()]\r\n l = Counter(a)\r\n r = s = sum(a)\r\n for k in l:\r\n if l[k] > 1:\r\n r = min(r, s - min(3, l[k]) * int(k))\r\n print(r)\r\n \r\n", "a = list(map(int,input().split()))\r\nnew_arr = sorted(a)\r\nmax_in_arr = []\r\nfor i in new_arr:\r\n if a.count(i) > 1 and a.count(i) <=3:\r\n max_in_arr+=[i*a.count(i)]\r\n if a.count(i) > 3:\r\n max_in_arr+=[i*3]\r\nif max_in_arr != []:\r\n print(sum(a)-max(max_in_arr))\r\nelse:\r\n print(sum(a))", "l = list(map(int,input().split()))\r\nif(len(set(l))==len(l)):\r\n print(sum(l))\r\nelse:\r\n l.sort()\r\n count=0\r\n for i in range(5):\r\n if(i+1<5 and l[i]==l[i+1]):\r\n count=max(count,2*l[i])\r\n if(i+2<5 and l[i]==l[i+2]):\r\n count = max(count,3*l[i])\r\n print(sum(l)-count)", "a=list(map(int,input().split()));b=0\r\nfor i in a:b=[b,[max(b,2*i),max(b,3*i)][a.count(i)>2]][a.count(i)>=2]\r\nprint(sum(a)-b)", "s=input()\r\nl=s.split()\r\nl1=[]\r\nsum=0\r\nfor i in range(len(l)):\r\n sum+=int(l[i])\r\n l1.append(int(l[i]))\r\ndic={}\r\n\r\nfor i in l1:\r\n if i not in dic:\r\n dic[i]=1\r\n else:\r\n dic[i]+=1\r\nt=0\r\nfor k,v in dic.items():\r\n if v>1:\r\n t=max(t,k*min(3,v))\r\nprint(sum-t)\r\n", "string = list(map(int,list(input().split())))\n\nletters = []\nindexes = []\n\nfor letter in string:\n if letter in letters:\n indexes[letters.index(letter)] += 1\n else:\n letters.append(letter)\n indexes.append(1)\n\ndupes = [0]\nfor r in range(0,len(letters)):\n if indexes[r] in [3,4,5]:\n dupes.append(letters[r] * 3)\n elif indexes[r] == 2:\n dupes.append(letters[r] * 2)\n\ndupes.sort()\nprint (sum(string) - dupes[-1])\n\n\t \t\t\t \t \t \t\t \t\t\t\t\t \t\t \t\t\t\t", "l_n = list(map(int, input().split()))\r\n\r\nd_n = {}\r\nm = 0\r\n\r\nfor n in l_n:\r\n if n not in d_n:\r\n d_n[n] = 1\r\n else:\r\n d_n[n] += 1\r\n if d_n[n] >= 2 and d_n[n] <= 3:\r\n m = max(m, d_n[n] * n)\r\nprint(sum(l_n) - m)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\ndef write(n,sep=\"\\n\"):\r\n\tstdout.write(str(n))\r\n\tstdout.write(sep)\r\ndef gil():\r\n\treturn list(map(int, input().split()))\r\n\t\r\nt = gil()\r\nfrom collections import Counter as C\r\nx = C(t)\r\nm = 0\r\nfor i in x:\r\n\tif x[i] > 1:\r\n\t\tv = min(3,x[i]) * i\r\n\t\tm = max(v,m)\r\na = sum(t) - m\r\nprint(a)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n A = list(map(int, wtf[0].split()))\r\n D = dict()\r\n for a in A:\r\n if a not in D:\r\n D[a] = 1\r\n else:\r\n D[a] += 1\r\n A2 = [k for k,v in D.items() if v >= 2]\r\n A3 = [k for k,v in D.items() if v >= 3]\r\n A2.append(0)\r\n A3.append(0)\r\n ans = sum(A) - max(max(A2)*2,max(A3)*3)\r\n print(ans)\r\n", "# https://codeforces.com/problemset/problem/680/A\r\n\r\nsample_dict = dict()\r\n\r\ntotal = 0\r\nfor i in map(int, input().split()):\r\n sample_dict[i] = sample_dict.get(i, 0) + 1\r\n total += i\r\n\r\n\r\nmax_value = float('-inf')\r\nfor key, value in sample_dict.items():\r\n if value >= 2:\r\n if max_value < key * (min(value, 3)):\r\n max_value = key * (min(value, 3))\r\nif max_value == float('-inf'):\r\n max_value = 0\r\n\r\nprint(total-max_value)\r\n", "l=list(map(int,input().split()))\r\nfreq={}\r\nfor i in l:\r\n if i in freq:\r\n freq[i]+=1\r\n else:\r\n freq[i]=1\r\nl1=[]\r\nfor i in freq:\r\n x=max(freq)\r\n if freq[i]>=2:\r\n s=0\r\n for j in l:\r\n if i!=j:\r\n s=s+j\r\n if freq[i]>3:\r\n s=s+i*(freq[i]-3)\r\n l1.append(s)\r\nif len(l1)>0: \r\n print(min(l1))\r\nelse:\r\n s=0\r\n for i in l:\r\n s=s+i\r\n print(s) \r\n ", "l=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nd=dict(sorted(d.items(),key= lambda x:x[0],reverse=True))\r\nk=list(sorted(set(l),reverse=True))\r\nans=0\r\nfor i in k:\r\n if d[i]>=3:\r\n ans=max(ans,i*3)\r\n elif d[i]>=2:\r\n ans=max(ans,i*2)\r\nprint(sum(l)-ans)\r\n \r\n\r\n", "def solve(arr):\n d = {}\n for i in arr:\n if d.get(i):\n d[i]+=1\n else:\n d[i] = 1\n max_val = 0\n for i in d:\n if d[i] > 1:\n count = d[i] if d[i] <= 3 else 3\n if count*int(i) > max_val:\n max_val = count*int(i)\n return sum(arr)-max_val\n \n\n \n\ndef main() :\n arr = list(map(int, input().split(' ')))\n print(solve(arr))\nmain()\n", "l=[]\r\nl.extend(map(int,input().split()))\r\nl.sort()\r\n\r\nhigh=[]\r\nx=0\r\nresL=[]\r\nfor i in range(len(l)):\r\n res = sum(l)\r\n count1=l.count(l[i])\r\n\r\n if count1==2 or count1==3:\r\n x= res-(count1*l[i])\r\n resL.append(x)\r\n elif count1>3:\r\n x = res-(2 * l[i])\r\n y= res- (3*l[i])\r\n print(min(x,y))\r\n break\r\n\r\n\r\nelse:\r\n if len(resL) > 1:\r\n print(min(resL))\r\n\r\n else:\r\n print(res)", "l=sorted(map(int,input().split()))[::-1]\r\ns,x=sum(l),0\r\nfor i in l:\r\n\tif l.count(i)==2:\r\n\t\tif x<2*i:x=2*i\r\n\tif l.count(i)>=3:\r\n\t\tif x<3*i:x=3*i\r\nprint(s-x)", "t = [int(i) for i in input().split()]\r\nt.sort()\r\nans = [sum(t)]\r\nfor i in range(3):\r\n if t[i] == t[i + 2]:\r\n ans.append(sum(t) - t[i] - t[i + 1] - t[i + 2])\r\nfor i in range(4):\r\n if t[i] == t[i + 1]:\r\n ans.append(sum(t) - t[i] - t[i + 1])\r\nans.sort()\r\nprint(ans[0])", "#%% 680a Bear and 5 cards \r\n\r\nt = [*map(int,input().split())]\r\nprint( min( [sum(t) - i*min(t.count(i),3)*(t.count(i)>1) for i in t ] )) ", "l=list(map(int, input().split()))\r\nmaxx=0\r\nfor i in set(l):\r\n if l.count(i)>=2:\r\n maxx=max(min(3,l.count(i))*i,maxx)\r\nprint(sum(l)-maxx)\r\n", "t=list(map(int,input().split()))\r\nmax=0\r\nfor i in t:\r\n if t.count(i)==2 and i*2>max:\r\n max=i*2\r\n if t.count(i)>=3 and i*3>max:\r\n max=i*3\r\nprint(sum(t)-max)", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\ta=sorted(read_ints())\n\tm=sum(a)\n\tif a[0]==a[1] and a[0]==a[2]:\n\t\tm=min(m, a[3]+a[4])\n\tif a[1]==a[2] and a[1]==a[3]:\n\t\tm=min(m, a[0]+a[4])\n\tif a[4]==a[3] and a[4]==a[2]:\n\t\tm=min(m, a[0]+a[1])\n\tfor i in range(1, 5):\n\t\tif a[i-1]==a[i]:\n\t\t\tm=min(m, sum(a[i+1:])+sum(a[:i-1]))\n\tprint(m)\n\nsolve()\n", "l = list(map(int,input().split()))\r\nx = float('inf')\r\nfor e in l:\r\n temp = l[:]\r\n if temp.count(e) >= 2:\r\n count = 0\r\n while e in temp and count < 3:\r\n temp.remove(e)\r\n count += 1\r\n x = min(x,sum(temp))\r\nprint(x)", "\r\nl =list(map(int,input().split()))\r\ns=sum(l)\r\nfor i in l:\r\n if(l.count(i)>=2):\r\n s = min(sum(l)-min(3,l.count(i))*i,s)\r\nprint(s)\r\n ", "def solve():\r\n ll = list(map(int, input().split()))\r\n mp = {}\r\n sm = 0\r\n for i in ll:\r\n if i in mp:\r\n mp[i] += 1\r\n else:\r\n mp[i] = 1\r\n sm += i\r\n ans = 999999999\r\n for i, j in sorted(mp.items()):\r\n if j == 2:\r\n ans = min(ans, sm - (2 * i))\r\n elif j >= 3:\r\n ans = min(ans, sm - (3 * i))\r\n else:\r\n ans = min(ans, sm)\r\n return ans\r\n\r\n'''\r\nt = int(input())\r\nwhile t != 0:\r\n res = solve()\r\n print(res)\r\n t -= 1\r\n'''\r\n\r\nres = solve()\r\nprint(res)", "a=list(map(int,input().split()));b=0\r\nfor i in a:\r\n if a.count(i)>=2:b=[max(b,2*i),max(b,3*i)][a.count(i)>2]\r\nprint(sum(a)-b)", "l = list(map(int,input().split()))\r\ns = set(l)\r\n\r\nb = []\r\nfor i in s:\r\n\tc = l.count(i)\r\n\tif c == 1:\r\n\t\tcontinue\r\n\telse:\r\n\t\tb.append(min(c,3)*i)\r\nif len(b) == 0:\r\n\tprint(sum(l))\r\nelse:\r\n\tprint(sum(l)-max(b))", "t = list(map(int, input().split()))\r\n\r\nt_sorted = sorted(t, reverse=True)\r\nthrowaway = 0\r\n\r\nfor i in range(len(t_sorted)-1):\r\n if i + 2 < len(t_sorted) and t_sorted[i] == t_sorted[i + 1] and t_sorted[i] == t_sorted[i + 2]:\r\n throwaway = max(3 * t_sorted[i], throwaway)\r\n if t_sorted[i] == t_sorted[i + 1]:\r\n throwaway = max(2 * t_sorted[i], throwaway)\r\n\r\nprint(sum(t_sorted)- throwaway)\r\n ", "x = input().split()\r\nlist1 = []\r\nfor i in x:\r\n list1.append(int(i))\r\nlist1.sort()\r\n\r\nlist2 =[]\r\nlist3 = []\r\nfor i in range(len(list1)-1):\r\n if list1[i] == list1[i+1]:\r\n list2.append(list1[i])\r\n\r\nfor i in range(len(list1)-2):\r\n if list1[i] == list1[i+1] and list1[i] == list1[i+2]:\r\n list3.append(list1[i])\r\n\r\nsum1 = 0\r\nfor i in list2:\r\n if i*2 > sum1:\r\n sum1 = i*2\r\nfor i in list3:\r\n if i*3 > sum1:\r\n sum1 = i*3\r\n\r\nprint(sum(list1)-sum1)", "arr = list(map(int,input().split()))\r\nss = sum(arr)\r\ns = [ss]\r\nfor num in set(arr):\r\n c = arr.count(num)\r\n if c > 1:\r\n c = min(c,3)\r\n s.append(ss - num * c)\r\n\r\nprint(min(s))\r\n\r\n", "t = list(map(int, input().split()))\r\nt.sort()\r\nbest_remove = 0\r\nfor i in range(5):\r\n if i + 1 < 5 and t[i] == t[i+1]:\r\n best_remove = max(best_remove, 2 * t[i])\r\n if i + 2 < 5 and t[i] == t[i+2]:\r\n best_remove = max(best_remove, 3 * t[i])\r\nprint(sum(t) - best_remove)\r\n", "\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nc=list(set(l))\r\np={}\r\nfor i in c:\r\n p[i]=0\r\nm=0\r\n\r\nfor i in sorted(l):\r\n p[i]+=1\r\n\r\nvk=s\r\n\r\nfor i in sorted(c)[::-1]:\r\n\r\n if p[i]>=2:\r\n if p[i]>=3:\r\n pk=s-3*(i)\r\n else:\r\n pk=s-2*i\r\n else:\r\n pk=s\r\n \r\n if vk>pk:\r\n vk=pk\r\n\r\n \r\nprint(vk)\r\n\r\n\r\n \r\n \r\n", "cards = input().split()\ncards = sorted([int(card) for card in cards])\n\ndelete_card = 0\ncard_sum = sum(cards)\ncard_number = []\ncard_repetition = []\n\n\nis_missing = True\nfor card in cards:\n if card_number == []:\n card_number.append(card)\n card_repetition.append(1)\n continue\n for numeration_idx, numeration in enumerate(card_number):\n if numeration == card:\n card_repetition[numeration_idx] += 1\n is_missing = False\n if is_missing:\n card_number.append(card)\n card_repetition.append(1)\n is_missing = True\n\nmax_subtraction = 0\n\nfor i in range(len(card_repetition)):\n if card_repetition[i] > 1:\n if card_repetition[i] > 3:\n max_subtraction_candidate = card_number[i] * 3\n else:\n max_subtraction_candidate = card_number[i] * card_repetition[i]\n if max_subtraction < max_subtraction_candidate:\n max_subtraction = max_subtraction_candidate\nprint(card_sum - max_subtraction)\n \t \t\t\t \t\t \t \t\t\t \t \t\t", "n = 5\r\ndata = list(map(int, input().split()))\r\nsum = 0\r\nmp = {}\r\nmx = 0\r\n\r\nfor x in data:\r\n sum += x\r\n if mp.get(x, 0) == 1:\r\n mx = max(mx, 2 * x)\r\n elif mp.get(x, 0) == 2:\r\n mx = max(mx, 3 * x)\r\n mp[x] = mp.get(x, 0) + 1\r\n\r\nprint(sum - mx)\r\n", "l=list(map(int,input().split()))\r\ns=sum(l)\r\nif(len(l)==len(set(l))):\r\n print(s)\r\nelse:\r\n m=[]\r\n for i in l:\r\n if(l.count(i)==2):\r\n m.append(s-(i*2))\r\n elif(l.count(i)>=3):\r\n m.append(s-(i*3))\r\n print(min(m)) ", "arr=[int(x) for x in input().split()]\r\n\r\nset1=set(arr)\r\nminsum=sum(arr)\r\nfor ele in set1:\r\n sum1=sum(arr)\r\n if arr.count(ele)>=2:\r\n count=arr.count(ele)\r\n if count>2:\r\n temp=0\r\n while temp<3:\r\n sum1-=ele\r\n temp+=1\r\n elif count==2:\r\n while count!=0:\r\n sum1-=ele\r\n count-=1\r\n if minsum>sum1:\r\n minsum=sum1\r\nprint(minsum)\r\n \r\n \r\n \r\n ", "cards = list(map(int, input().split()))\r\nmaximum = max(cards)\r\nans = 0\r\nsums = []\r\nif cards.count(maximum) == 2:\r\n ans = sum(cards) - (maximum*2)\r\nelif cards.count(maximum) >= 3:\r\n ans = sum(cards) - (maximum*3)\r\nelse:\r\n ans = sum(cards)\r\n\r\nfor x in cards:\r\n if cards.count(x) == 2:\r\n sums.append(sum(cards)-(2*x))\r\n elif cards.count(x) >= 3:\r\n sums.append(sum(cards) - (3 * x))\r\n\r\nif len(sums) > 0:\r\n ans = min(sums)\r\nelse:\r\n ans = sum(cards)\r\nprint(ans)", "t = list(map(int, input().split()))\nans = 0\nfor i in t:\n k = t.count(i)\n if k >= 2:\n ans = max(ans, min(k, 3) * i)\nprint(sum(t) - ans)\n", "n=list(map(int,input().split()))\r\ns=sum(n)\r\nnew = set(n)\r\nmax0=0\r\nfor i in new:\r\n x= n.count(i)\r\n if(x==1):\r\n x=0\r\n elif(x>3):\r\n x=3\r\n max0 =max(max0,x*i)\r\nprint(s - max0)\r\n", "a=3*[0]+sorted(map(int,input().split()))\r\nprint(sum(a)-max(2*z+(x==z)*z for x,y,z in zip(a,a[1:],a[2:]) if z==y))", "from collections import defaultdict\r\nl=[int(i) for i in input().split()]\r\nd=defaultdict(int)\r\nfor i in l:\r\n d[i]+=1\r\nif len(d)==5:\r\n print(sum(l))\r\nelse:\r\n z=[]\r\n k=list(d.keys())\r\n v=list(d.values())\r\n for i in range(len(d)):\r\n if v[i]==2:\r\n z.append(sum(l)-k[i]*2)\r\n elif v[i]==3:\r\n z.append(sum(l)-k[i]*3)\r\n elif v[i]>3:\r\n z.append(sum(l)-k[i]*3)\r\n print(min(z))\r\n", "mp = lambda:map(int, input().split())\r\nlmp = lambda:list(map(int, input().split()))\r\nintp = lambda:int(input())\r\ninp = lambda:input()\r\nfinp = lambda:float(input())\r\nsinp = lambda:input().split()\r\nlinp = lambda:list(input())\r\n\r\na = lmp()\r\na.sort()\r\nar = []\r\ncur = 0\r\nn = a[0]\r\nfor i in a:\r\n if n == i:\r\n cur += 1\r\n else:\r\n ar.append([cur, n])\r\n cur = 1\r\n n = i\r\nmx = 0\r\nfor i in ar:\r\n if i[0] > 1:\r\n mx = max(mx, min(i[0], 3) * i[1])\r\nif cur > 1:\r\n mx = max(mx, min(cur, 3) * n)\r\nprint(sum(a) - mx)\r\n", "from collections import Counter\ncards = [int(x) for x in input().split(\" \")]\ncard_counter = Counter(cards)\n\ndiscardable_cards_saving = {k: k*min(v, 3) for k, v in card_counter.items() if v > 1}\nsaving, card_to_discard = max(((v, k) for k, v in discardable_cards_saving.items()), default=(0, None))\n\nprint(sum(cards) - saving)\n\n \t \t\t \t\t \t\t\t\t\t \t\t \t \t", "import sys\nfrom time import perf_counter\n_DEBUG=False\nif _DEBUG:\n fd = open(\"input.txt\",\"r\")\n sys.stdin = fd\nstart = perf_counter()\ncards = list(map(int, sys.stdin.readline().split()))\nsum_elm = dict()\nfor i in range(5):\n if cards[i] in sum_elm:\n sum_elm[cards[i]] += 1\n else:\n sum_elm[cards[i]] = 1\nmaxk = min(cards)\nmx = sum_elm[maxk]\ncount=0\nfor k, v in sum_elm.items():\n count+=1\n if v>1 and maxk*mx < k*v:\n mx = v\n maxk = k\n\n# print(maxk, sum_elm)\nif not count==5:\n if mx <= 3:\n sum_elm.pop(maxk)\n else:\n sum_elm[maxk] -= 3\n\nprint(sum([k*v for k,v in sum_elm.items()]))\n", "arr = list(map(int, input().split(' ')))\r\nli = {}\r\nfor i in list(set(arr)):\r\n if arr.count(i) >= 2:\r\n li[i] = arr.count(i)\r\nx = sum(arr)\r\nres = x\r\nfor i in li:\r\n y = li.get(i)\r\n if y > 3:\r\n y = 3\r\n if x - (i*y) < res:\r\n res = x - (i*y)\r\nprint(res)", "a = list(map(int,input().split()))\r\nb = []\r\nsums = 0\r\nfor i in a:\r\n if a.count(i) == 1:sums+=i\r\n else:b.append(i)\r\nif b != []:\r\n if len(list(set(b))) == 1:\r\n if len(b) > 3:\r\n sums+=(len(b)-3)*b[0]\r\n else:\r\n b = sorted(b)\r\n j = 0\r\n for i in range(len(a)-1):\r\n if b[i] != b[i+1]:\r\n j =i\r\n break\r\n sums+=min(sum(b[:j+1]),sum(b[j+1:]))\r\nprint(sums)", "b=list(map(int,input().split()))\r\nmassive=[]\r\nsumm=sum(b)\r\ns=sorted(set(b))\r\nfor i in range(len(s)):\r\n cn=b.count(s[i])\r\n if cn>3:\r\n cn=3\r\n if cn>1 and cn<=3:\r\n massive.append(summ-cn*s[i])\r\nif len(s)==len(b):\r\n print(summ)\r\nelse:\r\n print(min(massive))", "li =list(map(int, input().split()))\r\nli.sort()\r\nsub =0\r\nfor i in range(5):\r\n\ta = li.count(li[i])\r\n\tif a>1:\r\n\t\tsub = max((min(a,3))*li[i], sub)\r\nprint(sum(li) - sub)\r\n", "from typing import Counter\r\n\r\nts = [int(x) for x in input().split()]\r\nc = Counter(ts)\r\nmx = 0\r\ns = 0\r\nfor k, v in c.items():\r\n s += k * v\r\n if v > 1:\r\n if v > 3:\r\n v = 3\r\n p = v * k\r\n if p > mx:\r\n mx = p\r\ns -= mx\r\nprint(s)", "class CountDict(dict):\n def __missing__(self, key):\n return 0\n\ncards = [int(i) for i in input().split(' ')]\ncounts = CountDict()\nfor l in cards:\n counts[l] += 1\n\ntotal_sum = sum([d * counts[d] for d in counts.keys()])\nsub_amounts = [0]\n\nfor digit, count in counts.items():\n if count > 1:\n max_mult = min(3, count)\n sub_amounts.append(digit*max_mult)\n\nprint(total_sum - max(sub_amounts))\n\t \t\t \t \t\t\t\t \t \t \t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nt = list(map(int, input().split()))\r\nl = 105\r\ncnt = [0] * l\r\nfor i in t:\r\n cnt[i] += 1\r\ns = sum(t)\r\nans = s\r\nfor i in range(l):\r\n if 1 < cnt[i]:\r\n ans = min(ans, s - min(cnt[i], 3) * i)\r\nprint(ans)", "# A. Bear and Five Cards\n\nt = list(map(int, input().split()))\nst = set(t)\n\nsm = sum(t)\nans = sm\n\nif len(st) < 5:\n for x in st:\n cnt = t.count(x)\n if cnt > 1:\n candidate_ans = sm - x * min(3, cnt)\n if candidate_ans < ans:\n ans = candidate_ans\n\nprint(ans)\n", "l = list(map(int, input().split()))\r\nmn = sum(l)\r\nfor i in range(1, 101):\r\n\tif l.count(i) >= 2:\r\n\t\tmn = min(mn, sum(l) - i * 2)\r\n\tif l.count(i) >= 3:\r\n\t\tmn = min(mn, sum(l) - i * 3)\r\nprint(mn)\r\n", "k=list(map(int,input().split()))\r\na,b,x,y,z=k[0],k[1],k[2],k[3],k[4]\r\ns=set(k)\r\nl=[0]\r\nfor i in s:\r\n c=k.count(i)\r\n if c>3:\r\n l.append(3*i)\r\n elif c>1:\r\n l.append(c*i)\r\n#print(l)\r\nm=max(l)\r\nprint(sum(k)-m)", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(99999)\r\n\r\narr = list(map(int,input().split()))\r\ns = sum(arr)\r\ncs = collections.Counter(arr)\r\nmx = 0\r\nfor k,v in cs.items():\r\n if v==2:\r\n mx = max(mx,2*k)\r\n elif v>2:\r\n mx = max(mx,3*k)\r\nprint(s-mx)\r\n\r\n\r\n", "arr = list(map(int,input().split()))\r\narr.sort()\r\nbest = 0\r\nfor i in range(len(arr)):\r\n if i + 1 < 5 and arr[i] == arr[i+1]:\r\n best = max(best , arr[i] * 2)\r\n if i + 2 < 5 and arr[i] == arr[i+2]:\r\n best = max(best, arr[i] * 3)\r\nprint(sum(arr)- best)\r\n\r\n", "cards = [int(x) for x in input().split()]\r\ncanremove = [[0, 0]]\r\n\r\nfor i in cards:\r\n if cards.count(i) >= 3 and [i, 3] not in canremove:\r\n canremove.append([i, 3])\r\n elif cards.count(i) >= 2 and [i, 2] not in canremove:\r\n canremove.append([i, 2])\r\n\r\nremovedcard = max([x[0] * x[1] for x in canremove])\r\n\r\nprint(sum(cards) - removedcard)", "l=list(map(int,input().split()))\r\nif(len(set(l))==len(l)):\r\n print(sum(l))\r\nelse:\r\n l1=list(set(l))\r\n l1.sort()\r\n m=0\r\n for i in l:\r\n if(l.count(i)>=2):\r\n m1=i*min(3,l.count(i))\r\n if(m1>m):\r\n m=m1\r\n print(sum(l)-m)", "list1 = list(map(int, input().split()))\r\nlist1.sort()\r\nsum1 = sum(list1)\r\ndic = {}\r\nfor i in range(5):\r\n if list1[i] not in dic:\r\n dic[list1[i]] = 1\r\n else:\r\n dic[list1[i]] += 1\r\nmin1 = sum1\r\nfor i in range(5):\r\n if dic[list1[i]] == 2:\r\n min1 = min(min1, sum1-2*list1[i])\r\n elif dic[list1[i]] >= 3:\r\n min1 = min(min1, sum1-list1[i]*3)\r\nprint(min1)\r\n", "t1,t2,t3,t4,t5=map(int,input().split())\r\nmassive1=[t1,t2,t3,t4,t5]\r\nmassive2=[]\r\nmassive3=[]\r\nsumm=sum(massive1)\r\ns=sorted(set(massive1))\r\nfor i in range(len(s)):\r\n cn=massive1.count(s[i])\r\n if cn>3:\r\n cn=3\r\n if cn>1 and cn<=3:\r\n massive2.append(cn*s[i])\r\nfor i in range(len(massive2)):\r\n summa=summ-massive2[i]\r\n massive3.append(summa)\r\nif len(s)==len(massive1):\r\n print(summ)\r\nelse:\r\n print(min(massive3))\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = list(map(int, input().split()))\r\ntmp = [i * min(data.count(i), 3) for i in set(data) if 2 <= data.count(i)]\r\nprint(sum(data) - (max(tmp) if tmp else 0))", "a=list(map(int,input().split()))\nv=sum(a)\nans=v\nfor i in range(5):\n for j in range(i+1,5):\n if a[i]==a[j]:\n ans=min(ans,v-a[i]-a[j])\nfor i in range(5):\n for j in range(i+1,5):\n for k in range(j+1,5):\n if a[i]==a[j]==a[k]:\n ans=min(ans,v-a[i]-a[j]-a[k])\nprint(ans)\n\n \t\t\t \t \t\t\t\t\t\t \t \t \t \t\t\t", "d = {}\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in l:\r\n d[i] = d.get(i, 0) + 1\r\n s += i\r\na = set()\r\na.add(0)\r\nfor i, j in d.items():\r\n if j == 2:\r\n a.add(i * 2)\r\n elif j >= 3:\r\n a.add(i * 3)\r\nprint(s - max(a))\r\n", "from collections import Counter\na = list(map(int,input().split()))\nQ = Counter(a)\n#print(Q)\nQQQ = []\nfor i in range(5):\n if Q[a[i]] == 2:\n QQQ.append(a[i]*2)\n if Q[a[i]] >= 3:\n QQQ.append(a[i]*3)\nif QQQ == []:\n print(sum(a))\nelse:\n print(sum(a)-max(QQQ))", "li=list(map(int,input().split()))\r\nli.sort()\r\ns=sum(li)\r\nx=s\r\nfor i in range(5):\r\n if i<=3 and li[i]==li[i+1]:\r\n x=min(x,s-(li[i]+li[i+1]))\r\n if i<=2 and li[i]==li[i+1]==li[i+2]:\r\n x=min(x,s-(li[i]+li[i+1]+li[i+2]))\r\nprint(x)", "t = list(map(int, input().split(' ')))\r\ntry:\r\n r = max(x * min(3, t.count(x)) for x in t if t.count(x) >= 2)\r\n print(sum(t) - r)\r\nexcept:\r\n print(sum(t))", "a = list(map(int,input().split(\" \")))\r\nd = dict()\r\nfor x in a:\r\n if(x in d.keys()):\r\n d[x] += 1\r\n else:\r\n d[x] = 1\r\nm = 0\r\nfor x in d.keys():\r\n if(d[x] >= 2):\r\n t = x*min(d[x],3)\r\n m = max(m,t)\r\nprint(sum(a) - m)\r\n", "l = list(map(int, input().split()))\r\nk = list(set(l))\r\ng = 0\r\nm = []\r\n\r\nif len(k) == len(l):\r\n print(sum(l))\r\nelse:\r\n for i in k:\r\n c = l.count(i)\r\n if c > 3:\r\n c = 3\r\n if c < 2:\r\n c = 0 \r\n\r\n m.append(sum(l) - i * c)\r\n\r\n print(min(m)) ", "from collections import Counter\na = list(map(int, input().split()))\nc = Counter(a)\nv = max(c.items(), key=lambda x: x[0] * [0, min(3, x[1])][x[1] > 1])\nprint(sum(a) - (v[0] * [0, min(3, v[1])][v[1] > 1]))\n", "t=list(map(int,input().split()))\r\nt=sorted(t)\r\nr=0\r\nfor i in range(5):\r\n if i+1<5 and t[i]==t[i+1]:\r\n r=max(r,2*t[i])\r\n if i+2<5 and t[i]==t[i+2]:\r\n r=max(r,3*t[i])\r\n\r\nprint(sum(t)-r)\r\n", "from collections import Counter\r\nlst = list(map(int, input().split()))\r\ns = sum(lst)\r\nif len(set(lst)) == 5:\r\n print(s)\r\nelse:\r\n c = Counter(lst)\r\n r = []\r\n for k, v in c.items():\r\n if v >= 3:\r\n r.append(s - 3 * k)\r\n elif v == 2:\r\n r.append(s - 2 * k)\r\n print(min(r))", "from collections import Counter\r\narr = [int(x) for x in input().split(' ')]\r\nm = 0\r\nfor n, cnt in Counter(arr).most_common():\r\n if cnt >= 2:\r\n m = max(m, n * min(cnt, 3))\r\nprint(sum(arr) - m)\r\n", "from collections import Counter\nvector = input()\nvector = list(map(int, vector.split(' ')))\n\nvector.sort()\nsuma = 0\ncounter = []\nfor i, x in enumerate(vector):\n suma +=1\n if i == len(vector)-1:\n counter.append([vector[i], suma])\n suma = 0\n else:\n if x != vector[i + 1]:\n counter.append([vector[i], suma])\n suma = 0\n\ntotals = []\nfor x in counter:\n if x[1] > 2:\n totals.append([x[0], x[0] * 3])\n if x[1] > 1 and x[1] < 3:\n totals.append([x[0], x[0] * 2])\ntotals.sort(key = lambda x:x[1])\nif len(totals) == 0:\n print(sum(vector))\nelse:\n print(sum(vector) - totals[-1][-1])\n", "arr=list(map(int,input().split()))\narr1=list(set(arr.copy()))\narr1.sort()\nSumm=sum(arr)\nSum=sum(arr)\nfor i in arr1:\n if arr.count(i)!=1:\n if arr.count(i)>3:\n temp=3\n else:\n temp=arr.count(i)\n\n if Summ-i*(temp)<Sum:\n Sum=Summ-i*(temp)\nprint(Sum)", "def _input(): return map(int ,input().split())\r\n\r\nlst = list(_input())\r\nl = list(set(lst))\r\nif len(l) == len(lst):\r\n print(sum(lst))\r\nelse:\r\n m=0\r\n for i in l:\r\n \r\n cnt = lst.count(i)\r\n if cnt > 1:\r\n \r\n if cnt <= 3 :\r\n m = max(m, i*cnt)\r\n else:\r\n m = max(m, i*3)\r\n print(sum(lst)-m)\r\n", "l=list(map(int,input().split()))\r\nmax=0\r\nfor i in l:\r\n\tif l.count(i)>=2 and i*2>max:\r\n\t\tmax=i*2\r\n\tif l.count(i)>=3 and i*3>max:\r\n\t\tmax=i*3\r\nprint(sum(l)-max)", "a = list(map(int,input().split()))\r\na.sort()\r\narr = []\r\narr.append(a[0]+a[1]+a[2]+a[3]+a[4])\r\nif a[2] == a[3] == a[4]:\r\n arr.append(a[0]+a[1])\r\nif a[1] == a[2] == a[3]:\r\n arr.append(a[0]+a[4])\r\nif a[0] == a[1] == a[2]:\r\n arr.append(a[3]+a[4])\r\nif a[0] == a[1]:\r\n arr.append(a[2]+a[3]+a[4])\r\nif a[1] == a[2]:\r\n arr.append(a[0]+a[3]+a[4])\r\nif a[2] == a[3]:\r\n arr.append(a[0]+a[1]+a[4])\r\nif a[3] == a[4]:\r\n arr.append(a[0]+a[1]+a[2])\r\nprint(min(arr))", "a, b, c, d, e = map(int, input().split())\r\nli = [a, b, c, d, e]\r\nli2 = set(li)\r\nl = [sum(li)]\r\nfor i in li2:\r\n if(li.count(i) >= 2):\r\n if(li.count(i) >= 3):\r\n l.append(sum(li)-(i*3))\r\n else:\r\n l.append(sum(li)-(i*2))\r\nprint(min(l))", "a = list(map(int, input().split()))\r\nd = {}\r\n\r\nfor i in a:\r\n x= a.count(i)\r\n if x>1:\r\n d[i] = x \r\n\r\ns = sum(a)\r\na = s\r\n\r\nfor i in d.keys():\r\n x = (s - i*min(d[i],3))\r\n if x < a:\r\n a = x\r\n\r\nprint(a)\r\n", "nums = input().split()\r\nall_nums = [0]*101\r\nfor i in range(len(nums)):\r\n nums[i] = int(nums[i])\r\n all_nums[nums[i]] += 1\r\ntotal_sum = sum(nums)\r\nmin_sum = total_sum\r\nfor i in range(101):\r\n current_sum = min_sum\r\n if all_nums[i] == 2:\r\n current_sum = total_sum - i - i\r\n elif all_nums[i] > 2:\r\n current_sum = total_sum - (3*i)\r\n min_sum = min(current_sum,min_sum)\r\nprint(min_sum)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\nli=inlt()\r\nfreq=[0]*102\r\nsum=0\r\nfor i in li :\r\n freq[i]=freq[i]+1\r\n sum+=i\r\nd=0\r\nfor i in range(102):\r\n if freq[i]==2 or freq[i]==3:\r\n d=max(d,freq[i]*i)\r\n elif freq[i]>3:\r\n d=max(d,i*3)\r\n\r\nprint(sum-d)", "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\nfrom collections import Counter\r\n\r\ndef main():\r\n a = IA()\r\n c = Counter(a)\r\n r = s = sum(a)\r\n for k, v in c.items():\r\n if v > 1:\r\n r = min(r, s-(k*min(3, v)))\r\n return r\r\n\r\nif __name__ == '__main__':\r\n print(main())", "cards = sorted(list(map(int, input().split())))[::-1]\r\ncardset = sorted(list(set(cards)))[::-1]\r\ns = sum(cards)\r\nfinals = 99999999\r\nfor x in cardset:\r\n a = x\r\n if cards.count(a) >= 3:\r\n finals = min(finals, s-3*a)\r\n if cards.count(x) == 2:\r\n finals = min(finals, s-2*a)\r\n\r\nprint(min(s,finals))\r\n ", "\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nsm1 = 0\r\nsm2 = 0\r\nx = sum(l)\r\nfor i in l :\r\n if l.count(i) >= 3 :\r\n sm1 = 3 * i\r\n\r\n if l.count(i) == 2 :\r\n sm2 = 2 * i\r\n\r\n\r\nprint(x - max(sm1 , sm2))\r\n", "# Code by Divyam Kakkar\r\n\r\ncards = list(map(int, input().split()))\r\n\r\nnet = {}\r\n\r\ndeducted = 0\r\n\r\nfor i in cards:\r\n if i in net:\r\n net[i] += 1\r\n else:\r\n net[i] = 1\r\n\r\nfor i in net:\r\n total = 0\r\n if net[i] > 1:\r\n if net[i] >= 3:\r\n total = (i * 3)\r\n elif net[i] >= 2:\r\n total = (i * 2)\r\n deducted = max(deducted, total)\r\n\r\nprint(sum(cards) - deducted)\r\n\r\n", "a = list(map(int,input().split()))\r\nr = []\r\nb = 0\r\nfor f in range(0,len(a)):\r\n b = b + a[f]\r\nfor i in range(0,len(a)):\r\n c = 0\r\n \r\n for y in range(0,len(a)):\r\n if(a[i] == a[y]):\r\n c = c + 1\r\n else:\r\n c = c + 0\r\n \r\n if(c>=2 and c<=3):\r\n s = b - (c*a[i])\r\n r.append(s)\r\n elif(c>3):\r\n s = b - (3*a[i])\r\n r.append(s)\r\n else:\r\n r.append(b) \r\nprint(min(r))\r\n", "A=list(map(int,input().split()))\r\nB=list(set(A))\r\nif len(A)==len(B):\r\n print(sum(A))\r\nelse:\r\n Max=0\r\n for i in range(len(B)):\r\n if (A.count(B[i])==2 and 2*B[i]>Max):\r\n Max=2*B[i]\r\n elif (A.count(B[i])>=3 and 3*B[i]>Max):\r\n Max=3*B[i]\r\n print(sum(A)-Max)", "a = list(map(int,input().split()))\r\na.sort()\r\nrem = 0\r\nfor i in range(5):\r\n if i+1 < 5 and a[i]==a[i+1]:\r\n rem = max(rem,2*a[i])\r\n if i+2 < 5 and a[i]==a[i+2]:\r\n rem = max(rem,3*a[i])\r\nprint(sum(a)-rem)", "l = list(map(int, input().split()))\r\nd = dict()\r\nfor e in l:\r\n if e not in d:\r\n d[e] = 1\r\n else:\r\n d[e] += 1\r\n\r\ns = sum(l)\r\n\r\nt = list()\r\nfor e in d:\r\n if d[e] >= 3:\r\n t.append(s - 3 * e)\r\n elif d[e] == 2:\r\n t.append(s - 2 * e)\r\n \r\n\r\nif len(t) > 0:\r\n print(min(t))\r\nelse:\r\n print(s)\r\n", "numbers = list(map(int, input().split()))\ndic = {}\n\ntotal = sum(numbers)\n\nfor i in range(len(numbers)):\n dic[numbers[i]] = dic.get(numbers[i], 0) + 1\n\ndiscard = 0\n\nfor key, value in dic.items():\n if value >= 2:\n discard = max(discard, key * min(3, value))\n\nprint(total - discard)\n\n\n", "a=list(map(int,input().split()))\r\nb=[sum(a)-min(3,a.count(i))*i for i in set(a) if a.count(i)>=2]\r\nprint(min(b) if len(b)!=0 else sum(a))", "x = input()\r\nx = x.split(\" \")\r\nmax1 = 0\r\nfor i in range(5):\r\n x[i] = int(x[i])\r\n if (3>=x.count(x[i])>=2) and (x.count(x[i])*x[i] > max1):\r\n max1 = x.count(x[i])*x[i]\r\n \r\nprint(sum(x) - max1)", "li = list(map(int, input().split()))\r\nli.sort()\r\nbest = 0\r\nfor i in range(5):\r\n if i+1 < 5 and li[i] == li[i+1]:\r\n best = max(best, 2*li[i])\r\n if i + 2 < 5 and li[i] == li[i+2]:\r\n best = max(best, 3*li[i])\r\n #print(li, best)\r\nprint(sum(li) - best)\r\n", "t = list(map(int, input().split(\" \")))\r\nt.sort()\r\n \r\nsum1 = 0\r\nsum2 = 0\r\n\r\nfor i in t:\r\n\tif t.count(i) >= 3:\r\n\t\tsum1 = 3 * i\r\n\tif t.count(i) == 2:\r\n\t\tsum2 = 2 * i\r\n \r\n \r\nprint(sum(t)-max(sum1,sum2))", "# Read the input numbers into a list\r\nnumbers = list(map(int, input().split()))\r\n\r\n# Calculate the total sum of numbers\r\ntotal_sum = sum(numbers)\r\n\r\n# Initialize a variable to store the minimum possible sum\r\nmin_sum = total_sum\r\n\r\n# Iterate through each unique number in the list\r\nfor num in set(numbers):\r\n # Count the occurrences of the current number in the list\r\n count = numbers.count(num)\r\n \r\n # Calculate the sum if we remove 2 or 3 occurrences of the current number\r\n if count >= 2:\r\n remove_two_sum = total_sum - (num * min(2, count))\r\n min_sum = min(min_sum, remove_two_sum)\r\n if count >= 3:\r\n remove_three_sum = total_sum - (num * min(3, count))\r\n min_sum = min(min_sum, remove_three_sum)\r\n\r\n# Print the minimum possible sum\r\nprint(min_sum)\r\n", "t = sorted(list(map(int, input().split())))\r\nif len(set(t)) == 5:\r\n print(sum(t))\r\nelse:\r\n prev = 0\r\n total = 0\r\n count = 0\r\n output = 0\r\n for i in t:\r\n if prev != i:\r\n count = 0\r\n total = 0\r\n if count != 3:\r\n total += i\r\n count += 1\r\n if count >= 2:\r\n output = max(total, output)\r\n prev = i\r\n print(sum(t) - output)", "import math\r\nfrom collections import defaultdict\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split())) \r\ndef solve():\r\n\r\n nums=IL()\r\n nums.sort()\r\n # obj=defaultdict(bool)\r\n max_=0\r\n sum=0\r\n for i in range(len(nums)-1):\r\n j=i+1\r\n count=1\r\n while j<len(nums) and nums[i]>=nums[j]:\r\n if count<3:\r\n count+=1\r\n j+=1\r\n if count!=1:\r\n count=count*nums[i]\r\n max_=max(max_,count)\r\n for i in range(len(nums)):\r\n sum+=nums[i]\r\n print(sum-max_)\r\n\r\n\r\n\r\n\r\n# T = I()\r\nT=1\r\nfor _ in range(T):\r\n solve()\r\n\r\n\r\n#3,3,7,7,20", "cards = list(map(int, input().split()))\r\n\r\ncards.sort()\r\ntest=[]\r\nfor i in cards:\r\n if cards.count(i)>1 and i not in test:\r\n test.append(i)\r\ncompare=0\r\ncheck=0\r\nnumber=0\r\nif test==[]:\r\n print(sum(cards))\r\nelse:\r\n for i in test:\r\n compare= cards.count(i)*i\r\n check=max(check, compare)\r\n if check==compare:\r\n number=i\r\n x= cards.count(number)\r\n x=min(x,3)\r\n for j in range(int(x)):\r\n cards.remove(number)\r\n print(sum(cards))", "import functools\nimport operator\n\nlul = input().split()\n\nlul1 = [int(i) for i in lul]\nlul2 = [int(i) for i in lul]\n\nlul1.sort(reverse = True)\nlul2.sort()\n\nlent1 = lul1.__len__()\n\nr1 = 0\nfor i in range(lent1):\n if i < lent1-1 and lul1[i] == lul1 [i+1]:\n if i < lent1-2 and lul1[i+1] == lul1 [i+2]:\n r1 += lul1[i+2]\n lul1.remove(lul1[i+2])\n r1 += lul1[i+1]\n lul1.remove(lul1[i+1])\n r1 += lul1[i]\n lul1.remove(lul1[i])\n break\n\nlent2 = lul.__len__()\nr2 = 0\nfor i in range(lent2):\n if i < lent2-1 and lul2[i] == lul2 [i+1]:\n if i < lent2-2 and lul2[i+1] == lul2 [i+2]:\n r2 += lul2[i+2]\n lul2.remove(lul2[i+2])\n r2 += lul2[i+1]\n lul2.remove(lul2[i+1])\n r2 += lul2[i]\n lul2.remove(lul2[i])\n break\n\nr1 = functools.reduce(operator.add,lul1)\nr2 = functools.reduce(operator.add,lul2)\nprint(min(r1,r2))\n\t \t \t \t\t\t \t\t\t\t \t \t\t \t\t\t \t", "l = list(map(int ,input().split()))\r\ns = sum(l)\r\nmn = [0]\r\nfor i in l : \r\n f = s \r\n x = l.count(i) \r\n if x >= 3 :\r\n mn.append(i * 3 )\r\n elif x == 2 : \r\n mn.append(i * 2) \r\nprint(s - max(mn))", "# coding=utf-8\r\na=[int(i) for i in input().split()]\r\nn=len(a)\r\na.sort(reverse=True)\r\na=a+[0,0,0,0]\r\ns=sum(a)\r\np=0\r\nfor i in range(n+1):\r\n if a[i]==a[i+1] and p<2*a[i]:\r\n p=2*a[i]\r\n if a[i]==a[i+2] and p<3*a[i]:\r\n p=3*a[i]\r\nprint(s-p)\r\n \t \t \t \t\t\t \t\t \t \t \t \t\t \t\t\t\t", "k1,k2,k3,k4,k5=map(int,input().split())\r\ns={}\r\ns[k1]=s.get(k1,0)+1\r\ns[k2]=s.get(k2,0)+1\r\ns[k3]=s.get(k3,0)+1\r\ns[k4]=s.get(k4,0)+1\r\ns[k5]=s.get(k5,0)+1\r\nm=0\r\nsu=k1+k2+k3+k4+k5\r\nfor i in s:\r\n if s[i]==2 or s[i]==3:\r\n m=max(m,i*s[i])\r\n if s[i]>3:\r\n m=max(m,i*3)\r\nprint(su-m)", "import time,sys,io,math\r\ninp=sys.stdin.readline\r\nfrom collections import Counter\r\npr=sys.stdout.write\r\n\r\ndef solve():\r\n a=[int(i) for i in inp().split()]\r\n a.sort(reverse=True)\r\n tot=sum(a)\r\n ans=tot\r\n d=Counter(a)\r\n for key in d.keys():\r\n if d[key]>=2:\r\n temp=tot-key*min(3,d[key])\r\n ans=min(ans,temp)\r\n pr(f\"{ans}\"+\"\\n\")\r\n\r\nstart=time.time()\r\nt=1\r\n#t=int(inp())\r\nfor _ in range(t):\r\n solve()\r\n#pr(f\"Time lapsed: {time.time()-start}\")", "a,b,c,d,e=sorted(list(map(int,input().split())))\r\nz=a+b+c+d+e\r\np,q,r,s,t,u,v=0,0,0,0,0,0,0\r\nif a==b:\r\n\tp=a+b\r\nif b==c:\r\n\tq=b+c\r\nif c==d:\r\n\tr=c+d\r\nif d==e:\r\n\ts=d+e\r\nif a==b==c:\r\n\tt=a+b+c\r\nif b==c==d:\r\n\tu=b+c+d\r\nif c==d==e:\r\n\tv=c+d+e\r\nprint(z-max([p,q,r,s,t,u,v]))", "# for testCase in range(int(input())):\narr = list(map(int ,input().split()))\ndic = {}\nfor i in arr:\n dic[i] = 0\ndec = sum = 0\nfor i in arr:\n dic[i] += 1\n sum += i\nsorted(dic)\nfor key ,value in dic.items():\n if value > 1:\n dec = max(dec ,(key*min(3 ,value)))\nprint(sum - dec)\n", "from collections import Counter\r\na=list(map(int, input().split()))\r\nb=sum(a)\r\ncnt=Counter(a)\r\nx=b\r\nfor i in cnt:\r\n if cnt[i]>=3:\r\n x=min(x, b-i*3)\r\n if cnt[i]>=2:\r\n x=min(x, b-i*2)\r\nprint(x)", "l=list(map(int,input().split()))\r\nd=[]\r\ns=sum(l)\r\nfor i in l:\r\n if(l.count(i)==2):\r\n d.append(s-i*2)\r\n elif(l.count(i)>=3):\r\n d.append(s-i*3)\r\nif(len(d)==0):\r\n print(s)\r\nelse:\r\n print(min(d))\r\n", "l=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nnewList=[]\r\nfor i in range(len(l)):\r\n if l.count(l[i])==2:\r\n newList.append(sum(l)-(l[i]*2))\r\n elif l.count(l[i])>=3:\r\n newList.append(sum(l)-(l[i]*3))\r\nnewList.append(sum(l)) \r\n\r\nprint(min(newList))", "cards = input().split()\r\ncards = sorted([int(x) for x in cards], reverse=True)\r\nbiggest = []\r\nmost_repeated = []\r\ntokens = 1\r\ncounter = 1\r\ncurrent = 0\r\nbig_count = 0\r\n\r\ntry:\r\n for z in cards:\r\n if z == cards[counter] == cards[counter + 1]:\r\n most_repeated.append(z)\r\n most_repeated.append(cards[counter])\r\n most_repeated.append(cards[counter + 1])\r\n break\r\n else:\r\n counter += 1\r\nexcept IndexError:\r\n pass\r\n\r\ncounter = 1\r\ntry:\r\n for y in cards:\r\n if y == cards[counter]:\r\n current = y\r\n break\r\n else:\r\n counter += 1\r\nexcept IndexError:\r\n pass\r\n\r\ncounter = 1\r\n\r\nfor num in cards:\r\n if num == current:\r\n big_count += 1\r\n\r\nif big_count <= 2:\r\n for m in range(0, big_count):\r\n biggest.append(current)\r\nelif big_count >= 3:\r\n for m in range(0, 3):\r\n biggest.append(current)\r\nsolution = min(sum(cards) - sum(biggest), sum(cards) - sum(most_repeated))\r\nprint(solution)", "# coding=utf-8\r\nli = list(map(int, input().split()))\r\n\r\nl2 = [0]*101\r\nfor i in li:\r\n l2[i] += 1\r\n \r\nm = 0\r\nfor i in range(1,101):\r\n if l2[i] >= 3 and i * 3 > m:\r\n m = i * 3\r\n elif l2[i] == 2 and i * 2 > m:\r\n m = i * 2\r\n\r\nprint(sum(li) - m)\r\n\t\t \t \t\t \t\t\t \t \t\t \t \t\t" ]

[ "I=input\r\ns=list(I())\r\nS=len(s)\r\nn=int(I())\r\nt=0\r\n*l,=sorted(map(int,I().split()))\r\nfor i in range(S//2):\r\n while t<n and l[t]<=i+1:t+=1\r\n if t%2:s[i],s[S-i-1]=s[S-i-1],s[i]\r\nprint(''.join(s))", "x=list(input())\r\nl=len(x)\r\nc=input()\r\nlst=[0]*(l//2+1)\r\nfor i in input().split():\r\n lst[int(i)-1]+=1\r\nfor i in range(1,(l//2+1)):\r\n lst[i]+=lst[i-1] \r\nfor i in range(l//2):\r\n if lst[i]%2==1:\r\n x[i],x[l-i-1]=x[l-i-1],x[i] \r\nprint(''.join(x))\r\n", "s=[i for i in input()]\r\nm=int(input());n=len(s)\r\narr=list(map(int,input().split()));dp=[0]*n\r\nfor i in arr:dp[i-1]+=1;dp[n-i]+=1\r\nfor i in range(1,n):dp[i]+=dp[i-1]\r\nfor i in range((n+1)//2):\r\n if dp[i]&1==1:s[i],s[n-i-1]=s[n-i-1],s[i]\r\nprint(\"\".join(s))\r\n", "import math\r\n\r\ns=input()\r\nm=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nfor i in range(len(l)):\r\n l[i]-=1\r\n\r\nn=len(s); q=[0]*n; ans=list(s); p=[\"#\"]*n\r\n\r\nfor i in range(len(l)):\r\n if p[l[i]]==\"#\":\r\n p[l[i]]=l[i]\r\n else:\r\n p[l[i]]=\"#\"\r\n\r\nc=0\r\n\r\nfor i in range(len(q)):\r\n if p[i]!=\"#\":\r\n c+=1\r\n q[i]=c%2\r\n else:\r\n q[i]=c%2\r\n\r\nfor i in range(int(math.ceil(len(q)/2))):\r\n if q[i]==1:\r\n ans[i],ans[n-i-1]=ans[n-i-1],ans[i]\r\n\r\nprint(''.join(ans))", "s = list(input())\r\nn = len(s)\r\nm = int(input())\r\na = list(map(int,input().split()))\r\nl = [0]*(n+1)\r\nfor i in a:\r\n\tl[i-1]+=1\r\n\tl[n-i+1]-=1\r\nk = 0\r\nl2 = []\r\nfor i in range(n):\r\n\tk += l[i]\r\n\tif k%2==0:\r\n\t\tl2.append(s[i])\r\n\telse:\r\n\t\tl2.append(s[n-i-1])\r\nprint(\"\".join(l2)) ", "\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\ndef array_print(arr):\r\n print(''.join(map(str, arr)))\r\n\r\ns = list(input())\r\ns.pop(-1)\r\n\r\nn = int(input())\r\na = list(multi_input())\r\n\r\nb=[0]*(len(s))\r\n\r\nfor i in range(n):\r\n b[a[i]-1] +=1\r\n\r\nfor i in range(len(s)//2):\r\n if i!=0:\r\n b[i] += b[i-1]\r\n\r\n if b[i]%2!=0:\r\n s[i], s[len(s)-i-1] = s[len(s)-i-1], s[i]\r\n\r\narray_print(s)", "s = [\" \"] + list(input())\nm = int(input())\na = list(map(int, input().rstrip().split()))\nn = len(s)\nli = [0] * (n // 2 + 4)\nfor x in a:\n li[x] += 1\nfor i in range(1, n // 2 + 1):\n li[i] += li[i - 1]\nfor i in range(n // 2 + 1):\n if li[i] & 1:\n s[i], s[n - i] = s[n - i], s[i]\nprint(''.join(s[1:]))\n", "def main():\r\n s = input()\r\n m = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n count = 0\r\n st = [0] * len(s)\r\n b = []\r\n for i in range(m):\r\n st[a[i] - 1] += 1\r\n st[len(s) - a[i]] += 1\r\n for i in range(len(s)):\r\n if i < len(s) / 2:\r\n count += st[i]\r\n if count % 2:\r\n b.append(s[len(s) - i - 1])\r\n else:\r\n b.append(s[i])\r\n if i >= len(s) / 2:\r\n count += st[i] \r\n b = ''.join(b)\r\n print(b)\r\nif __name__ == '__main__':\r\n main()\r\n", "s=list(input())\r\nn=int(input())\r\nq=list(map(int,input().split()))\r\ncnt=[0]*len(s)\r\nfor i in range(n): cnt[q[i]-1]+=1\r\nprefix=0\r\nfor i in range(len(s)//2):\r\n prefix+=cnt[i]\r\n if prefix%2:\r\n s[i],s[len(s)-i-1]=s[len(s)-i-1],s[i]\r\nprint(''.join(s))", "import sys\r\nfrom collections import defaultdict\r\n\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n word = [c for c in read().strip()]\r\n read()\r\n swaps = [int(i) for i in read().split()]\r\n swaps.sort()\r\n\r\n swaps_count = 0\r\n swap_idx = 0\r\n for i in range(len(word) // 2):\r\n while swap_idx < len(swaps) and swaps[swap_idx] - 1 == i:\r\n swaps_count += 1\r\n swap_idx += 1\r\n if swaps_count % 2 != 0:\r\n word[i], word[-i + -1] = word[-i + -1], word[i]\r\n\r\n print(''.join(word))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "s=input()\r\nl2=[]\r\nfor i in s:\r\n l2.append(i)\r\n\"\"\"3\r\n1 2 3\"\"\"\r\nl=[0]*((len(s)//2)+1)\r\na=int(input())\r\nl1=list(map(int,input().split()))\r\nfor i in l1:\r\n l[i]+=1\r\nfor i in range(1,len(l)):\r\n l[i]=l[i]+l[i-1]\r\ni,lengt=1,len(l)-1\r\nwhile i<=lengt:\r\n if l[i]%2==1:\r\n l2[i-1],l2[(len(s)-i)]=l2[(len(s)-i)],l2[i-1]\r\n i+=1 \r\ns1=\"\".join(l2)\r\nprint(s1)", "def main():\n import sys\n \n s = sys.stdin.readline().strip()\n m = int(sys.stdin.readline())\n \n d = [0 for i in range(len(s) + 1)]\n for i in sys.stdin.readline().split():\n d[int(i)] ^= 1\n \n rev = 0\n result = [i for i in s]\n for i in range(1, len(s) // 2 + 1):\n rev ^= d[i]\n if rev:\n result[i - 1], result[len(s) - i] = result[len(s) - i], result[i - 1]\n \n print(''.join(result))\n \n \n \nmain()\n", "import sys\r\nf = sys.stdin.readline\r\ns = list(f().strip())\r\nm = int(f().strip())\r\narr = [int(v) for v in f().strip().split()]\r\na = [0]*(len(s)+1)\r\nfor v in arr:\r\n a[v-1] += 1\r\n a[len(s)-v+1] -= 1\r\nfor i in range(1, len(s)+1):\r\n a[i] += a[i-1]\r\n\r\nfor i in range(len(s)//2):\r\n if a[i]%2 != 0:\r\n s[i], s[len(s)-1-i] = s[len(s)-1-i], s[i]\r\nprint(''.join(s))", "s=input()\r\nm=len(s)\r\nn=int(input())\r\nout=list(map(int,input().split()))\r\narr=[0 for _ in range(m+1)]\r\nfor x in out:\r\n arr[x]+=1\r\n if m-x+2<=m:\r\n arr[m-x+2]-=1\r\nfor y in range(1,m+1):\r\n arr[y]+=arr[y-1]\r\nout=list(s)\r\ni=1\r\nwhile i<=m//2:\r\n if arr[i]&1:\r\n out[i-1],out[m-i]=out[m-i],out[i-1]\r\n i+=1\r\nprint(''.join(out))", "def mp(c):\r\n return int(c)-1\r\n\r\ns = list(input())\r\nn = len(s)\r\nm = int(input())\r\narr = list(map(mp,input().split()))\r\narr.sort()\r\nst = []\r\nfor c in arr:\r\n if st and c==st[-1]:\r\n st.pop()\r\n else:\r\n st.append(c)\r\n\r\nwhile len(st)>1:\r\n a = st.pop(0)\r\n b = st.pop(0)\r\n a2 = n-1-a\r\n while a<b:\r\n s[a],s[a2] = s[a2],s[a]\r\n a+=1\r\n a2-=1\r\nif st:\r\n a = st.pop()\r\n b = n-1-a\r\n s[a:b+1] = s[a:b+1][::-1]\r\nprint(\"\".join(s))", "class CodeforcesTask525BSolution:\n def __init__(self):\n self.result = ''\n self.string = ''\n self.m = 0\n self.a = []\n\n def read_input(self):\n self.string = input()\n self.m = int(input())\n self.a = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n ns = list(self.string)\n n = len(ns)\n reve = [False] * (n // 2 + n % 2)\n for m in range(self.m):\n reve[self.a[m] - 1] = not reve[self.a[m] - 1]\n to_reve = [False] * (n // 2 + n % 2)\n doing = False\n for x in range(n // 2 + n % 2):\n if doing:\n if not reve[x]:\n to_reve[x] = True\n else:\n doing = False\n else:\n if reve[x]:\n doing = True\n to_reve[x] = True\n for x in range(n // 2 + n % 2):\n if to_reve[x]:\n ns[x], ns[n - x - 1] = ns[n - x - 1], ns[x]\n self.result = ''.join(ns)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask525BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "*s, = input()\r\ninput()\r\nl, cur = len(s), 0\r\nmid = l // 2\r\nc = [0] * (mid + 1)\r\na = [int(i) - 1 for i in input().split()]\r\nfor i in a:\r\n c[i] += 1\r\nfor i in range(mid):\r\n cur += c[i]\r\n if cur % 2:\r\n s[i], s[len(s) - i - 1] = s[len(s) - i - 1], s[i]\r\nprint(''.join(s))", "from sys import *\r\ninp = lambda : stdin.readline()\r\n\r\ndef main():\r\n s = inp()[:-1]\r\n n = int(inp())\r\n a = [0 for i in range(len(s)+5)]\r\n l = map(int,inp().split())\r\n for b in l:\r\n\r\n a[b-1] = (a[b-1] + 1)%2\r\n temp = [c for c in s]\r\n yet = 0\r\n for i in range(len(s)//2):\r\n yet = (yet+a[i])%2\r\n if yet == 1:\r\n temp[i],temp[len(s)-i-1] = temp[len(s)-i-1],temp[i]\r\n print(\"\".join(temp))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = list( input() )\nn = int( input() )\nmid = int( len(s)/2 )\ncnt = [0] * mid\nnums = list( map( int, input().split() ) )\nfor i in range( 0, n ):\n\tcnt[ nums[ i ] - 1 ] += 1\nacc = 0\nfor i in range( 0, mid ):\n\tif (acc + cnt[ i ])&1 == 1:\n\t\ts[ i ], s[ len(s)-i-1 ] = s[ len(s)-i-1 ], s[ i ]\n\tacc += cnt[ i ]\nprint( \"\".join( s ) )", "from collections import Counter\r\n\r\n\r\ndef main():\r\n string = input()\r\n n = len(string)\r\n input()\r\n switches = [int(c) for c in input().split()]\r\n switches = sorted(k for k, v in Counter(switches).items() if v % 2 != 0)\r\n\r\n acc = [0]\r\n i = 0\r\n for sw in sorted(switches):\r\n for j in range(i, sw - 1):\r\n acc.append(acc[-1])\r\n i += 1\r\n\r\n acc.append(acc[-1] + 1)\r\n i += 1\r\n\r\n for j in range(i, n // 2 + 1):\r\n acc.append(acc[-1])\r\n\r\n ans = [''] * n\r\n for i, c in enumerate(string):\r\n if (2 * i < n and acc[i+1] % 2 == 0) or\\\r\n (2 * i >= n and acc[n - i] % 2 == 0):\r\n ans[i] = c\r\n else:\r\n ans[n - i - 1] = c\r\n\r\n print(''.join(ans))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = list(input())\nm = int(input())\na = list(map(int, input().split()))\nswap = False;\na.sort();\ni, j = 0, 0;\nfor i in range( len(s) // 2):\n while j < m and a[j]-1 <= i:\n swap = not swap\n j += 1\n if swap:\n s[i], s[len(s) - i -1] = s[len(s) - i -1], s[i]\nprint(\"\".join(s))\n", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom collections import defaultdict\r\nfrom sys import stdin\r\n\r\ns, n, a, mem = input(), int(input()), arr_inp(), defaultdict(int)\r\nans, c, l = list(s), 0, len(s)\r\n\r\nfor k in a:\r\n mem[k] += 1\r\n\r\nfor i in range(l // 2):\r\n c += mem[i + 1]\r\n if c & 1:\r\n ans[i], ans[l - i - 1] = ans[l - i - 1], ans[i]\r\n\r\nprint(''.join(ans))\r\n", "st=str(input())\r\ns=[]\r\nfor i in range(0,1000):\r\n go=1\r\ns=list(st)\r\nn=int(input())\r\nb=[]\r\nfor i in range(0,1000):\r\n go=1\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nl=len(b)\r\nk=len(s)-1\r\nfor i in range(0,1000):\r\n go=1\r\nm=int((k+2)/2)\r\nfor i in range(0,1000):\r\n go=1\r\nb.append(m+1)\r\nwhile l>=0 :\r\n if(l%2==1):\r\n for i in range(b[l-1]-1,b[l]-1):\r\n t=s[i]\r\n s[i]=s[k-i]\r\n s[k-i]=t\r\n l-=1\r\nfor i in range(0,1000):\r\n go=1\r\nfor i in range(0,k+1):\r\n print(s[i], end=\"\")", "s = [\" \"] + list(input())\r\nn = len(s)\r\nm = int(input())\r\na = [0]*(n//2+10)\r\nfor x in input().split():\r\n a[int(x)] += 1\r\nfor i in range(1, n//2+1):\r\n a[i] += a[i-1]\r\nfor i in range(n//2+1):\r\n if a[i] & 1:\r\n s[i], s[n-i] = s[n-i], s[i]\r\nprint(''.join(s[1:]))", "s = list(input())\r\nm = int(input())\r\nn = len(s)\r\na = list(map(int, input().split()))\r\nd = [0] * (n + 1)\r\nfor i in range(m):\r\n c1 = min(a[i], n - a[i] + 1) \r\n c2 = max(a[i], n - a[i] + 1)\r\n d[c1 - 1] += 1 \r\n d[c2] -= 1\r\n \r\nfor i in range(1, n + 1):\r\n d[i] += d[i - 1]\r\n# print(d) \r\nfor i in range(n + 1):\r\n if(d[i] % 2):\r\n s[i], s[n - i - 1] = s[n - i - 1], s[i]\r\n d[n - i - 1] = 0\r\nprint(''.join(s))", "s = input()\r\nm = int(input())\r\nA = [int(c) for c in input().split()]\r\n\r\nn = len(s)\r\nprefix = [0 for _ in range(n//2)]\r\nfor a in A:\r\n prefix[a-1] += 1\r\n \r\nfor i in range(len(prefix) - 1):\r\n prefix[i+1] += prefix[i]\r\n \r\nstring_list = list(s)\r\nfor i in range(n//2):\r\n if prefix[i] % 2 == 1:\r\n string_list[i] = s[n - i - 1]\r\n string_list[n - i - 1] = s[i]\r\n \r\nprint(\"\".join(string_list))", "from sys import stdin\r\n\r\n\r\ndef main():\r\n s = list(input())\r\n m = int(stdin.readline())\r\n count = [0] * (len(s) + 1)\r\n ar = list(map(int, stdin.readline().split()))\r\n for tn in ar:\r\n count[tn] += 1\r\n for i in range(1, len(s) // 2 + 1):\r\n count[i] += count[i - 1]\r\n for i in range(len(s) // 2):\r\n if count[i + 1] % 2 == 1:\r\n s[i], s[len(s) - i - 1] = s[len(s) - i - 1], s[i]\r\n print(''.join(s))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=list(input())\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ncur=0\r\nmid=len(s)//2\r\nsum=[0]*(mid+1)\r\nfor i in l:\r\n sum[i-1]+=1\r\nfor i in range(mid):\r\n cur+=sum[i]\r\n if(cur%2!=0):\r\n s[i],s[len(s)-i-1]=s[len(s)-i-1],s[i]\r\nprint(''.join(s))\r\n ", "st = list(input())\r\nn = int(input())\r\nf = j = 0\r\na = sorted([*map(int, input().split())])\r\nfor i in range(1, len(st) // 2 + 1):\r\n try:\r\n while a[j] == i:\r\n f += 1\r\n j += 1\r\n except:\r\n pass\r\n if f % 2 == 1:\r\n st[i - 1], st[len(st) - i] = st[len(st) - i], st[i - 1]\r\nprint(\"\".join(st))\r\n \r\n", "s = list(input())\r\nm = int(input())\r\nn=len(s)\r\nlis = sorted(map(int,input().split()))\r\nhas=[0]*(n+3)\r\nfor i in range(m):\r\n a=lis[i]\r\n has[a-1]+=1\r\nfor i in range(1,n+2):\r\n has[i]+=has[i-1] \r\nfor i in range(n//2):\r\n if has[i]%2:\r\n s[i],s[n-i-1]=s[n-i-1],s[i]\r\nprint(''.join(s)) \r\n\r\n\r\n\r\n", "s = list(input())\r\nm = int(input())\r\na = list(map(int,input().split()))\r\n\r\n\r\nx = len(s)\r\nc = [0]*(x//2)\r\nfor i in range(m):\r\n c[a[i]-1]+=1\r\nflag = 0\r\nfor i in range(1, x//2):\r\n c[i] += c[i-1]\r\n\r\nfor i in range(x//2):\r\n if c[i]%2!=0:\r\n s[i], s[x-i-1] = s[x-i-1], s[i]\r\nprint(''.join(map(str,s)))\r\n", "from sys import stdout\r\ns=input()\r\nd={0:0}\r\nq=int(input())\r\nl=[int(x) for x in input().split()]\r\nfor a in l:\r\n if a>len(s)//2:\r\n a=len(s)-a+1\r\n if a in d:\r\n d[a]+=1\r\n else:\r\n d[a]=1\r\nar=[]\r\ntemp=0\r\nfor i in range(len(s)//2):\r\n if i+1 in d:\r\n temp+=d[i+1]\r\n ar.append(temp)\r\nans=[0]*len(s)\r\nfor i in range(len(ar)):\r\n if ar[i]%2==0:\r\n ans[i]=s[i]\r\n ans[len(s)-i-1]=s[len(s)-i-1]\r\n else:\r\n ans[i]=s[len(s)-i-1]\r\n ans[len(s)-i-1]=s[i]\r\nfinal=\"\"\r\nfor i in range(len(ans)):\r\n if ans[i]==0:\r\n final+=s[i]\r\n else:\r\n final+=ans[i]\r\nstdout.write(final)", "s = list(input())\r\nm = input()\r\na = sorted(list(map(int, input().split())), reverse=False)\r\ns = ['']+s\r\n\r\nd = [0]*(2*len(s))\r\nfor i in a: d[i] += 1\r\nfor i in range(2, (len(s)//2)+1): d[i] += d[i-1]\r\n#print(d)\r\n#print(s)\r\nfor i in range(1, ((len(s)-1)//2)+1):\r\n if d[i]%2 == 1: s[i], s[(len(s)-1)-i+1] = s[(len(s)-1)-i+1], s[i]\r\n\r\nprint(''.join(s[1:]))", "s = list(input())\nm = int(input())\ncnt = [0]*len(s)\nfor x in input().split():\n cnt[int(x) - 1] += 1\nfor i in range(1, len(s)):\n cnt[i] += cnt[i - 1]\nfor i in range(len(s)//2):\n if cnt[i] & 1:\n s[i], s[len(s) - i - 1] = s[len(s) - i - 1], s[i]\nprint(''.join(s))\n", "from sys import stdin, stdout\nrd = lambda: list(map(int, stdin.readline().split()))\nrds = lambda: stdin.readline().rstrip()\nii = lambda: int(stdin.readline())\nINF = 1 << 62\nmod = 10**9 + 7\n\ns = rds()\nn = len(s)\nm = ii()\n\niss = rd()\n\nops = [0 for _ in range(n+1)]\nfor i in range(m):\n j = iss[i] - 1\n k = n - j - 1\n ops[j] += 1\n ops[k+1] -= 1\n\n\nfinal = [0 for _ in range(n)]\ncurr = 0\nfor i in range(n):\n curr += ops[i]\n final[i] = curr % 2\n\nres = ['_' for _ in range(n)]\nfor i in range(n//2+1):\n j = n - i - 1\n if final[i]:\n res[i] = s[j]\n res[j] = s[i]\n else:\n res[i] = s[i]\n res[j] = s[j]\n\nstdout.write(''.join(res))\n#stdout.write(f'{res}')\n\n", "def string(s, m, A):\n n = len(s)\n t = ''.join(reversed(s))\n A.sort()\n p = 0\n f = True\n M = []\n N = []\n for a in A:\n q = a - 1\n if f:\n M.append(s[p:q])\n N.append(s[n-q:n-p])\n else:\n M.append(t[p:q])\n N.append(t[n-q:n-p])\n f = not f\n p = q\n if f:\n M.append(s[p:len(s)-p])\n else:\n M.append(t[p:len(s)-p])\n M.extend(reversed(N))\n return ''.join(M)\n\n\ndef main():\n s = input()\n m = readint()\n A = readintl()\n print(string(s, m, A))\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintl():\n return list(readinti())\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\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\nabcdef\n1\n2\n\"\"\", \"\"\"\\\naedcbf\n\"\"\"), (\"\"\"\\\nvwxyz\n2\n2 2\n\"\"\", \"\"\"\\\nvwxyz\n\"\"\"), (\"\"\"\\\nabcdef\n3\n1 2 3\n\"\"\", \"\"\"\\\nfbdcea\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "s, m, v = list(input()), int(input()), list(map(int, input().split()))\r\nn = len(s)\r\nd = [0]*(n+2)\r\nfor i in range(m):\r\n d[v[i]] += 1\r\n d[n-v[i]+2] -= 1\r\nfor i in range(1, n+1):\r\n d[i] += d[i-1]\r\n if d[i]&1 and 2*i <= n:\r\n s[i-1], s[n-i] = s[n-i], s[i-1]\r\nfor ch in s:\r\n print(ch, end = '')", "s = list(input())\r\nm = int(input())\r\na = [int(x) for x in input().split()]\r\nn = len(s) // 2\r\nsums = [0] * (n+1)\r\n\r\nfor i in a:\r\n sums[i-1] += 1\r\nfor i in range (1, len(sums)):\r\n sums[i] += sums[i-1]\r\nfor i in range(n):\r\n if sums[i] % 2 != 0:\r\n s[i], s[len(s) - i - 1] = s[len(s) - i - 1], s[i]\r\n\r\nprint(\"\".join(s))\r\n", "st = list(input())\r\nn = int(input())\r\ns = [0] * len(st)\r\nfor x in input().split():\r\n s[int(x)-1] += 1\r\nfor i in range(1 , len(st)):\r\n s[i] += s[i-1]\r\nfor i in range(len(st)//2):\r\n if s[i] & 1 :\r\n st[i] , st[len(st)-i-1] = st[len(st)-i-1] , st[i]\r\nprint(''.join(st))\r\n", "import math\r\ns=list(input())\r\na=len(s)\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nk=[0]*(math.ceil(a/2))\r\nfor i in l:\r\n\tk[i-1]+=1\r\nb=0\r\nfor i in range(math.ceil(a/2)):\r\n\tb+=k[i]\r\n\tif b%2==1:\r\n\t\ts[i],s[a-i-1]=s[a-i-1],s[i]\r\nprint(\"\".join(s))", "s = input()\r\nn = len(s)\r\nans = [\"a\"]*(n)\r\nif len(s)%2 == 1:\r\n x = n//2\r\n\r\nelse:\r\n x = (n//2)-1\r\n\r\np = [0]*(x+1)\r\nm = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in l:\r\n p[i-1] += 1\r\n\r\nfor i in range(len(p)):\r\n if p[i]%2 == 0:\r\n p[i] = 0\r\n\r\n else:\r\n p[i] = 1\r\n\r\nx = 0\r\nfor i in range(len(p)):\r\n v = p[i]\r\n r = v^x\r\n x = r\r\n if r%2 == 1:\r\n ans[i],ans[n-i-1] = s[n-i-1],s[i]\r\n\r\n else:\r\n ans[i], ans[n - i - 1] = s[i],s[n - i - 1]\r\n\r\nprint(\"\".join(ans))", "\r\ns=list(input())\r\nm=int(input())\r\nn=len(s)\r\nl=[0]*n\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=0\r\nj=0\r\ni=0\r\nwhile i<n and j<m:\r\n\tif i==a[j]-1:\r\n\t\tif x==0:\r\n\t\t\tl[i]=1\r\n\t\t\tx=1\r\n\t\telse:\r\n\t\t\tl[i]=0\r\n\t\t\tx=0\r\n\t\tj+=1\r\n\telse:\r\n\t\tif x==1:\r\n\t\t\tl[i]=1\r\n\t\ti+=1\r\nif x==1:\r\n\tk=i+1\r\n\twhile k<=(n-i-1)//2:\r\n\t\tl[k]=1\r\n\t\tk+=1\r\nfor i in range(n):\r\n\tif l[i]==1:\r\n\t\ts[i],s[n-i-1]=s[n-i-1],s[i]\r\nprint(\"\".join(s))", "def solve():\r\n s = input().strip()\r\n m = int(input())\r\n a = list(map(int, input().strip().split()))\r\n\r\n # print(s, m, a)\r\n\r\n s = [c for c in s]\r\n\r\n changes = [0] * len(s)\r\n\r\n for i in range(m):\r\n changes[a[i] - 1] += 1\r\n\r\n # Accumulate this changes\r\n for i in range(1, len(s) // 2):\r\n changes[i] += changes[i - 1]\r\n\r\n # Make the changes\r\n for i in range(len(changes)):\r\n if changes[i] % 2 == 1:\r\n s[i], s[len(s) - 1 - i] = s[len(s) - 1 - i], s[i]\r\n\r\n print(\"\".join(s))\r\n\r\n\r\nsolve()\r\n", "\ns = input()\ns = list(s)\nn=input()\nl=list(map(int,input().split()))\nl.sort()\nx = [0]*len(s)\ntoggle = 1\nfor i in range(len(l)):\n\tx[l[i]-1]+=1\nfor i in range(1,len(x)//2):\n\tx[i] += x[i-1]\n\nfor i in range(len(x)//2):\n\tif(x[i] %2== 1):\n\t\ts[i],s[len(s)-i-1]=s[len(s)-i-1],s[i]\nprint(''.join(s))\n", "import sys\r\n\r\nx = input()\r\nl=len(x)\r\na=int(input())\r\nb=map(int,sys.stdin.readline().split())\r\n\r\nrv = [False] * (l//2+1)\r\nfor i in b:\r\n rv[i] = not rv[i]\r\n \r\nsumx=[0]*len(x)+[0]\r\npt = 0\r\n\r\nfor i in range(1, l//2+1):\r\n\r\n sumx[i] = sumx[i-1]+rv[i]\r\n\r\n\r\nfor i in range(l//2):\r\n if sumx[i+1]%2==1:\r\n print(x[l-1-i], end = '')\r\n else:\r\n print(x[i], end = '')\r\n\r\nif l%2==1:\r\n print(x[l//2], end = '')\r\nfor i in range(l//2, l):\r\n if i == l // 2 and l%2==1:\r\n continue\r\n if sumx[l-i]%2!=1:\r\n print(x[i], end = '')\r\n else:\r\n \r\n print(x[l-1-i], end = '')\r\n", "s = input()\nm = int(input())\nn = len(s)\nl = (n + 1) // 2\na = [0] * l\nfor i in (int(x) for x in input().split()):\n\ta[i - 1] ^= 1\nh = []\nt = []\ntot = 0\nfor i in range(l):\n\ttot ^= a[i]\n\tif tot:\n\t\th.append(s[n - i - 1])\n\t\tt.append(s[i])\n\telse:\n\t\th.append(s[i])\n\t\tt.append(s[n - i - 1])\nprint(''.join(h), ''.join(t[:l - n % 2][::-1]),sep='')\n", "s = input().strip()\nm, = map(int, input().split())\nA = list(map(int, input().split()))\nn = len(s)\n\nflips = [0] * (n//2)\nfor a in A:\n flips[a-1] += 1\n\nans = list(s)\ncount = 0\nfor i in range(n//2):\n count += flips[i]\n if count % 2 == 1:\n ans[i],ans[n-1-i] = ans[n-1-i],ans[i]\n\nprint(\"\".join(ans))\n", "s = list(input())\r\nn = len(s)\r\nm = int(input())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\nz = 0\r\nfor i in range(m):\r\n if i % 2 != 0:\r\n temp = n - ai[i]\r\n temp2 = n - z \r\n temp3 = reversed(s[z:ai[i]-1])\r\n s[z:ai[i]-1] = reversed(s[temp+1:temp2])\r\n s[temp+1:temp2] = temp3\r\n z = ai[i] - 1\r\nif m % 2 != 0:\r\n s[ai[-1]-1:n-ai[-1]+1] = reversed(s[ai[-1]-1:n-ai[-1]+1])\r\nprint(\"\".join(s))\r\n", "s = [\" \"] + list(input())\r\nL = len(s)\r\n_ = input()\r\na = [0] * (L // 2 + 10)\r\n\r\n#zisti odkial budeme reversovat\r\nfor t in input().split():\r\n a[int(t)] += 1\r\n\r\n#zisti pokial\r\nfor i in range(1, L // 2 + 1):\r\n a[i] += a[i - 1]\r\n\r\n#ak sme na spravnom prvku, tak reverzni\r\nfor i in range(L // 2 + 1):\r\n if a[i] % 2:\r\n s[i], s[L - i] = s[L - i], s[i]\r\n\r\nprint(''.join(s[1:]))\r\n", "from bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop, heapify\r\nfrom math import *\r\nfrom collections import defaultdict, Counter, deque\r\nfrom sys import stdin, stdout\r\nimport io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda *x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\nceil = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\n\r\nt = 1\r\nfor _ in range(t):\r\n s = [i for i in sinput()]\r\n n = len(s)\r\n m = ninput()\r\n a = ainput()\r\n arr = [0] * (n // 2)\r\n for i in range(m):\r\n arr[a[i] - 1] += 1\r\n for i in range(1, n//2):\r\n arr[i] += arr[i-1]\r\n for i in range(n//2):\r\n if arr[i] & 1: \r\n s[i], s[n-1-i] = s[n-1-i], s[i]\r\n printt(\"\".join(s))\r\n\r\n", "s = input()\nm = int(input())\na = list(map(int, input().split()))\nn = len(s)\n\nflip = [0 for i in range(n)]\nfor x in a:\n x -= 1\n flip[x] ^= 1\n if x > 0:\n flip[n - x] ^= 1\n\nfor i in range(1, n):\n flip[i] ^= flip[i - 1]\n\nans = ['a' for i in range(n)]\nfor i in range(n):\n if flip[i] == 1:\n ans[i] = s[n - i - 1]\n else:\n ans[i] = s[i]\n\nprint(''.join(ans))\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/525/B\r\n\r\ns = list(input())\r\nm = int(input())\r\ns_s = [0] * len(s)\r\n\r\nfor a in map(int, input().split()):\r\n s_s[a - 1] += 1\r\n\r\ncur = 0\r\nfor i in range(len(s) // 2):\r\n cur += s_s[i]\r\n if cur & 1:\r\n s[i], s[len(s) - i - 1] = s[len(s) - i - 1], s[i]\r\n\r\nprint(\"\".join(s))", "from collections import defaultdict\r\nd=defaultdict(lambda : -1)\r\ns=list(input())\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\n\r\nfor n in x:\r\n d[n] = 1 if d[n]!=1 else 0\r\ncond = False\r\n# print(d)\r\nl=len(s)\r\nfor i in range(len(s)//2):\r\n if d[i+1] == 1:\r\n cond = True if cond==False else False\r\n\r\n if cond:\r\n t=s[i]\r\n s[i]=s[l-i-1]\r\n s[l-i-1] = t\r\nfor i in s:\r\n print(i,end=\"\")", "read = lambda: map(int, input().split())\r\ns = input()\r\nm = int(input())\r\na = [int(i) - 1 for i in input().split()]\r\nn = len(s)\r\nc = [0] * (n + 1)\r\nfor i in a: c[i] += 1\r\nmid = n // 2\r\ncnt = 0\r\nans = list(s)\r\nfor i in range(mid):\r\n cnt += c[i]\r\n if cnt % 2:\r\n ans[i], ans[n - i - 1] = ans[n - i - 1], ans[i]\r\nprint(''.join(ans))", "s=input()\r\nn=len(s)\r\nm=int(input())\r\na=[]\r\nss=input()\r\nfor x in ss.split(' '):\r\n a.append(int(x)-1)\r\na.append(n//2)\r\ns=list(s)\r\na.sort()\r\nfor i in range(0,m):\r\n if i%2==0:\r\n for j in range(a[i],a[i+1]):\r\n s[j],s[n-j-1]=s[n-j-1],s[j]\r\nprint(''.join(s))\r\n", "mlst=list(input())\r\nm = int(input())\r\nlst=[int(i) for i in input().split()]\r\nlenmlst = len(mlst)\r\nlst2=[]\r\nfor i in range(lenmlst+1):\r\n lst2.append(0)\r\nfor i in range(m):\r\n start=lst[i]\r\n end=(lenmlst-1) - (lst[i]-1) + 1\r\n lst2[start]+=1\r\n lst2[end]-=1\r\nfor i in range(1,int((lenmlst/2)+1)):\r\n lst2[i] += lst2[i-1]\r\n if((lst2[i]%2)!=0):\r\n mlst[i-1],mlst[((lenmlst-1)-(i-1))] = mlst[((lenmlst-1)-(i-1))],mlst[i-1]\r\nprint(''.join(mlst)) \r\n", "import sys\r\n\r\ns = list(sys.stdin.readline().strip())\r\nt = int(sys.stdin.readline())\r\n\r\nv = [0]*len(s)\r\nline = list(map(int, sys.stdin.readline().split()));\r\nfor x in line:\r\n v[x-1] = 1-v[x-1]\r\n\r\nk = len(s)\r\nacc = 0\r\nfor i in range(int(k/2)):\r\n acc += v[i]\r\n if(acc&1 > 0):\r\n s[i], s[k-i-1] = s[k-i-1], s[i]\r\n\r\nprint (\"\".join(s))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\ndef main():\n\tS = input()\n\tS = list(S)\n\tL = len(S)\n\ttroca = [False for i in range(math.ceil(L/2))]\n\tM = int(input())\n\tlinha = [int(i) for i in input().split()]\n\tfor i in range(M):\n\t\ttroca[linha[i] - 1] = not troca[linha[i] - 1]\n\ttemp = False\n\tfor i in range(len(troca)):\n\t\ttemp = (temp != troca[i])\n\t\tif temp:\n\t\t\ttemp2 = S[i]\n\t\t\tS[i] = S[L - 1 - i]\n\t\t\tS[L - 1 - i] = temp2\n\tprint(''.join(S))\n\treturn\n\n\nmain()\n\n# 1521829818229\n", "ss=input()\r\ns=list(ss)\r\nn=int(input())\r\na = list(map(int, input().split()))\r\ni=0\r\nl=len(s)\r\na.sort()\r\nk=0\r\nfor i in range(0,l//2):\r\n\twhile k<n and a[k]-1<=i:\r\n\t\tk+=1\r\n\tif k%2==1:\r\n\t\ts[i],s[l-i-1]=s[l-i-1],s[i]\r\nprint(\"\".join(s))\r\n", "def main():\r\n s = input()\r\n s = [s[i] for i in range(len(s))]\r\n m = int(input())\r\n a = [int(x) for x in input().split()]\r\n b = [0 for i in range(int(len(s) / 2 + 1))]\r\n for i in range(m):\r\n b[a[i] - 1] += 1\r\n for i in range(0, int(len(s) / 2)):\r\n if i > 0:\r\n b[i] += b[i - 1]\r\n if b[i] % 2 == 1:\r\n s[i], s[len(s) - i - 1] = s[len(s) - i - 1], s[i]\r\n return \"\".join(s)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "wc = input()\r\nn = len(wc)\r\nw = [wc[i] for i in range(n)]\r\nm = int(input())\r\n\r\n\r\n\r\ncnt = [0 for i in range(n+3)]\r\ny = [int(x) for x in input().split()]\r\nfor i in range(m):\r\n x = y[i]\r\n cnt[x]+=1\r\n cnt[n-x+2]-=1\r\n\r\nfor i in range(n+1):\r\n if i>0:\r\n cnt[i] += cnt[i-1]\r\n\r\nfor i in range(1, n+1, 1):\r\n if n-i+1 <= i:\r\n break\r\n\r\n if cnt[i] % 2 == 1:\r\n a = i - 1\r\n b = n - i\r\n tmp = w[a]\r\n w[a] = w[b]\r\n w[b] = tmp\r\n\r\nfor i in range(n):\r\n print(w[i], end=\"\")\r\nprint()\r\n", "s = list(input())\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nd = {i:0 for i in range(1,len(s)//2+1)}\r\nfor i in l : d[i]+=1\r\nfor i in range(2,len(s)//2+1) : d[i]+=d[i-1]\r\nfor i in range(len(s)//2,0,-1) : \r\n if d[i]%2 : s[i-1], s[len(s)-i] = s[len(s)-i], s[i-1]\r\nprint(''.join(s))", "s = input()\r\nm2 = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = {}\r\nm1 = set()\r\nfor i in range(m2):\r\n if a[i] not in m1:\r\n m1.add(a[i])\r\n m[a[i]] = 1\r\n else:\r\n m[a[i]] += 1\r\nif 1 in m1:\r\n k = [m[1]]\r\nelse:\r\n k = [0]\r\n\r\nfor i in range(1, len(s)//2):\r\n if i + 1 in m1:\r\n k.append(k[-1] + m[i + 1])\r\n else:\r\n k.append(k[-1])\r\ns1 = []\r\nfor i in range(len(s)):\r\n s1.append(s[i])\r\n\r\nfor i in range(len(s)//2):\r\n if k[i] % 2 == 1:\r\n t = s1[len(s) - i - 1]\r\n s1[len(s) - i - 1] = s[i]\r\n s1[i] = t\r\n\r\nfor i in range(len(s1)):\r\n print(s1[i], end = '')\r\n \r\n \r\n ", "import sys\n\ndef write_buffer(i0, a, l, r, buff, st, n):\n k = a-i0\n for j in range(k):\n buff[i0 + j] = st[l + j] if l <= r else st[l - j]\n buff[n + 1 - i0 - j] = st[r - j] if l <= r else st[r + j]\n return (l + k, r - k) if l <= r else (l - k, r + k)\n\ndef solve(st, n, xs):\n st = [\"\"] + st + [\"\"]\n l, r = 0, n + 1\n buff = [None]*(n + 2)\n i0 = 0\n xs.sort()\n xs.append((0 + n + 3)//2)\n for a in xs:\n l, r = write_buffer(i0, a, l, r, buff, st, n)\n i0 = a\n l, r = r, l\n return ''.join(buff)\n \ndef main():\n st = [ch for ch in sys.stdin.readline().strip()]\n m = int(sys.stdin.readline().strip())\n xs = list(map(int, sys.stdin.readline().strip().split()))\n res = solve(st, len(st), xs)\n print(res)\n\nif __name__ == '__main__':\n main()\n", "string = input()\r\nstring = list(string)\r\nSlen = len(string)\r\nm = int(input())\r\ninline = input().split()\r\na = []\r\nfor i in range (m):\r\n a.append(int(inline[i]))\r\na.append(Slen // 2 + 1)\r\na.sort()\r\nchanges = [0 for i in range(Slen)]\r\nflag = 0\r\nfor i in range(len(a) - 1):\r\n if flag == 0:\r\n for j in range(a[i], a[i + 1]):\r\n string[j - 1], string[Slen - j - 1 + 1] = string[Slen - j - 1 + 1], string[j - 1]\r\n flag = 1 - flag\r\nfor i in range(Slen):\r\n print (string[i], sep = '', end = '')\r\n ", "s = list(input())\r\nm = int(input())\r\nA = [int(a) for a in input().split()]\r\nn = len(s)\r\n\r\n# C[i] := Number of changes to the i-th index.\r\nC = [0] * n\r\nfor i in range(m):\r\n C[A[i] - 1] += 1\r\n\r\n# pr[i] = Number of changes to the indices i...n\r\npr = [0] * n\r\npr[0] = C[0]\r\nfor i in range(1, n):\r\n pr[i] = pr[i - 1] + C[i]\r\n\r\nans = ['.'] * (n)\r\nfor i in range((n + 1) // 2):\r\n if pr[i] % 2 == 0:\r\n ans[i] = s[i]\r\n ans[n - i - 1] = s[n - i - 1]\r\n else:\r\n ans[i] = s[n - i - 1]\r\n ans[n - i - 1] = s[i]\r\n\r\nprint(''.join(ans))", "from collections import Counter\r\narr = list(input())\r\nm = int(input())\r\ns = list(map(int,input().split()))\r\nn = len(arr)\r\nsum_arr = [0]*n\r\nfor i in s:\r\n sum_arr[i-1]+=1\r\nif sum_arr[0]%2!=0:\r\n arr[0],arr[-1] = arr[-1],arr[0]\r\nfor i in range(1,(len(arr)//2)):\r\n sum_arr[i]+=sum_arr[i-1]\r\n if sum_arr[i]%2!=0:\r\n arr[i],arr[-i-1] = arr[-i-1],arr[i]\r\nprint(''.join(arr))\r\n \r\n \r\n", "s = [\"#\"] + list(input())\r\ninput()\r\nnums = map(int, input().split())\r\nn = len(s)\r\na = [0] * (n // 2 + 1)\r\n\r\nfor x in nums:\r\n a[x] += 1\r\n\r\nfor i in range(1, n // 2 + 1):\r\n a[i] += a[i-1]\r\n\r\nfor i in range(1, n // 2 + 1):\r\n if a[i] % 2 == 1:\r\n s[i], s[n-i] = s[n-i], s[i]\r\n\r\nprint(str.join('', s[1:]))\r\n", "\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import *\r\n#import itertools\r\n#from operator import itemgetter\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#dirs = [[1,0],[0,1],[-1,0],[0,-1]]\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\n#sarr = [x for x in input().strip().split()]\r\n#import math\r\nfrom math import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(2**30)\r\n\r\n\r\n\r\ndef solve():\r\n s = [x for x in input().strip()]\r\n n = len(s)\r\n q = int(input())\r\n arr = [int(x) for x in input().split()]\r\n arr.sort()\r\n flip = [0]*(n//2)\r\n for el in arr:\r\n flip[el-1]^=1\r\n\r\n for i in range(1,len(flip)):\r\n flip[i]+=flip[i-1]\r\n #print(flip) \r\n for i in range(n//2):\r\n if flip[i]&1:\r\n s[i],s[n-i-1] = s[n-i-1],s[i]\r\n print(''.join(s))\r\n \r\n \r\n \r\n \r\ntt = 1#int(input())\r\nfor test in range(tt):\r\n solve()\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n#\r\n", "s = list(input())\nn = int(input())\na = list(map(int,input().split()))\nfor i in range(n):\n a[i] -= 1\na = sorted(a)\n# a = [1,2,2,3]\n# n = len(a)\ndef lower_bound(k):\n l = -1\n r = n-1\n while l<r:\n md = (l+r+1)//2\n # print(md)\n if a[md]<=k:\n l = md\n else:\n r = md-1\n return l\n\nfor i in range(len(s)//2):\n if (lower_bound(i)+1)%2==1:\n s[i],s[len(s)-i-1] = s[len(s)-i-1],s[i]\n\nprint(''.join(s))", "#!/c/Python34/python\r\n# coding: utf-8\r\n\r\n\r\ndef main():\r\n S = list(input())\r\n n = int(input())\r\n M = sorted(map(int, input().split()))\r\n R = [0] * len(S)\r\n for m in M:\r\n R[m-1] += 1\r\n for i in range(len(S)//2):\r\n if R[i] % 2 == 1:\r\n S[i], S[len(S)-i-1] = S[len(S)-i-1], S[i]\r\n R[(i+1)%len(S)] += R[i]\r\n print(''.join(S))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# Link: https://codeforces.com/contest/525/problem/B\n\ns = list(str(input()))\nm = int(input())\narr = list(map(int, input().split()))\nn = len(s)\nprefix = [0] * (n+1)\nmid = n // 2\nfor i in range(m):\n left = arr[i] - 1\n right = n - left - 1\n prefix[left] += 1\n prefix[right+1] -= 1\n\nfor i in range(1, mid + 1):\n prefix[i] += prefix[i-1]\n\nfor i in range(n//2):\n # If prefix[i] is even then then it means no reversing.\n # because reversing even number of times is no reversing.\n if prefix[i] % 2 != 0:\n s[i], s[n-i-1] = s[n-i-1], s[i]\nprint(\"\".join(s))\n", "import sys\r\nimport math \r\n\r\ns = list(input())\r\nl = len(s)\r\nm = int(input())\r\nai = list(map(int, input().split()))\r\nk = [0] * int(l / 2)\r\n\r\nfor i in ai:\r\n k[i - 1] += 1\r\n \r\nv = 0\r\nfor i in range(int(l / 2)):\r\n z = (k[i] + v) % 2\r\n if(z != 0):\r\n s[i], s[l - i - 1] = s[l - i - 1], s[i]\r\n\r\n v = z\r\n\r\nprint(\"\".join(s))", "\r\nstr = list(input())\r\nlen = len(str)\r\ninput()\r\na = [0] * (len//2+1)\r\nfor ai in map(int,input().split()):\r\n a[ai]+=1\r\nfor i in range(1,len//2+1):\r\n a[i] += a[i-1]\r\n if a[i] % 2 == 1:\r\n str[i-1], str[len-i] = str[len-i], str[i-1]\r\nprint(''.join(str))\r\n\r\n\r\n \r\n\r\n", "s = input()\r\np = len(s)\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nr = [0] * ((p + 1) // 2)\r\nz = [s[x] for x in range(p)]\r\nfor i in range(m):\r\n r[a[i] - 1] += 1\r\nif p % 2 != 0:\r\n e = p //2 + 1\r\nelse:\r\n e = p // 2\r\nsm = 0\r\nfor i in range(e):\r\n sm += r[i]\r\n if sm % 2 != 0:\r\n z[p - 1 - i], z[i] = z[i], z[p - 1 - i]\r\nprint(''.join(z))", "def fun(s,m,arr):\r\n n=len(s)\r\n s=list(s)\r\n li=[0]*(n//2)\r\n for i in arr:\r\n li[i-1]+=1\r\n for i in range(1,len(li)):\r\n li[i]=li[i-1]+li[i]\r\n for i in range(n//2-1,-1,-1):\r\n if li[i]&1:\r\n s[i],s[n-i-1]=s[n-i-1],s[i]\r\n return \"\".join(s)\r\n \r\n \r\n\r\n\r\ns=input()\r\nm=int(input())\r\narr=list(map(int,input().split()))\r\nprint(fun(s,m,arr))", "if __name__ == '__main__':\r\n s = list(input())\r\n input()\r\n data = sorted(map(lambda x: int(x) - 1, input().split()))\r\n data.append(len(s) // 2)\r\n\r\n tr = True\r\n for i in range(len(data) - 1):\r\n if tr:\r\n for j in range(data[i], data[i + 1]):\r\n s[j], s[-j - 1] = s[-j - 1], s[j]\r\n\r\n tr = not tr\r\n\r\n print(''.join(s))", "cs = list(input())\nm = int(input())\nis_ = list(map(int, input().split()))\n\nc_len = len(cs)\n\nis_.append(c_len//2+1)\nis_.sort()\nfor k in range(len(is_) - 1):\n if k%2 == 1: continue\n i = is_[k] - 1\n ni = is_[k+1] - 1\n for j in range(i, ni):\n cs[j], cs[c_len-j-1] = cs[c_len-j-1], cs[j]\nprint(''.join(cs))\n", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n\r\n\r\ndef solve():\r\n string = list(input().replace('\\n', ''))\r\n n = len(string)\r\n mask = [0 for _ in range(n)]\r\n m = int(input())\r\n for a_i in read_tuple(int):\r\n mask[a_i - 1] += 1\r\n inversions = 0\r\n for i in range(n // 2):\r\n inversions += mask[i]\r\n if inversions % 2:\r\n string[i], string[n - i - 1] = string[n - i - 1], string[i]\r\n print(''.join(string))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "s = list(input())\nm = int(input())\na = [int(i) for i in input().split()]\nn = len(s)\nsum = [0 for i in range(n//2)]\n\nfor i in range(m):\n\tsum[a[i]-1] += 1\n\nfor i in range(1, n//2):\n\tsum[i] += sum[i-1]\n\nfor i in range(n//2):\n\tif sum[i]%2:\n\t\ttemp = s[i]\n\t\ts[i] = s[n-i-1]\n\t\ts[n-i-1] = temp\n\nprint(''.join(s))", "import math\r\nimport random \r\n\r\ndef main(s,arr):\r\n\r\n\r\n r=[0]*len(s) \r\n \r\n for i in range(len(arr)):\r\n idx=arr[i]-1 \r\n r[idx]+=1 \r\n for i in range(1,len(r)//2):\r\n r[i]+=r[i-1]\r\n \r\n \r\n ans=[c for c in s] \r\n\r\n for i in range(len(r)//2):\r\n if r[i]&1:\r\n ans[i],ans[len(s)-i-1]=ans[len(s)-i-1],ans[i] \r\n return \"\".join(ans)\r\n\r\ns=input() \r\nm=int(input()) \r\narr=list(map(int,input().split()))\r\nprint(main(s,arr))\r\n\r\n", "import sys\r\nimport string\r\nimport math\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\nfrom collections import Counter\r\nfrom fractions import Fraction\r\n\r\ndef mi(s):\r\n return map(int, s.strip().split())\r\n\r\ndef lmi(s):\r\n return list(mi(s))\r\n\r\ndef tmi(s):\r\n return tuple(mi(s))\r\n\r\ndef mf(f, s):\r\n return map(f, s)\r\n\r\ndef lmf(f, s):\r\n return list(mf(f, s))\r\n\r\ndef js(lst):\r\n return \" \".join(str(d) for d in lst)\r\n\r\ndef jsns(lst):\r\n return \"\".join(str(d) for d in lst)\r\n\r\ndef line():\r\n return sys.stdin.readline().strip()\r\n\r\ndef linesp():\r\n return line().split()\r\n\r\ndef iline():\r\n return int(line())\r\n\r\ndef mat(n):\r\n matr = []\r\n for _ in range(n):\r\n matr.append(linesp())\r\n return matr\r\n\r\ndef matns(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append([c for c in line()])\r\n return mat\r\n\r\ndef mati(n):\r\n mat = []\r\n for _ in range(n):\r\n mat.append(lmi(line())) \r\n return mat\r\n\r\ndef pmat(mat):\r\n for row in mat:\r\n print(js(row))\r\n\r\ndef bin_search(arr, num):\r\n '''\r\n Return the number of elements <= num in the array.\r\n '''\r\n lo = 0\r\n hi = len(arr) - 1\r\n\r\n while lo <= hi:\r\n if lo == hi:\r\n if arr[lo] <= num:\r\n return lo + 1\r\n else:\r\n return lo\r\n elif lo == hi - 1:\r\n if arr[hi] <= num:\r\n return hi + 1\r\n elif arr[lo] <= num:\r\n return lo + 1\r\n else:\r\n return lo\r\n\r\n mid = (lo + hi) // 2\r\n if arr[mid] > num:\r\n # Everything to the right of mid is greater.\r\n hi = mid\r\n else:\r\n lo = mid\r\n\r\ndef main():\r\n S = [c for c in line()]\r\n line()\r\n reverse = lmi(line())\r\n reverse.sort()\r\n for i in range(1, len(S) + 1):\r\n if i * 2 > len(S):\r\n break\r\n\r\n num = bin_search(reverse, i)\r\n if num % 2 == 1:\r\n i1 = i\r\n i2 = len(S) - i + 1\r\n S[i1 - 1], S[i2 - 1] = S[i2 - 1], S[i1 - 1]\r\n print(jsns(S))\r\nmain()\r\n", "s = list(input())\r\nm = int(input())\r\nrev = list(map(int, input().split()))\r\ncnt = [0 for i in range((len(s) + 1) // 2)]\r\nfor i in range(m):\r\n cnt[rev[i] - 1] += 1\r\npref_sum = [cnt[i] for i in range((len(s) + 1) // 2)]\r\nfor i in range(1, (len(s) + 1) // 2):\r\n pref_sum[i] += pref_sum[i - 1]\r\nfor i in range((len(s) + 1) // 2):\r\n if pref_sum[i] % 2 == 1:\r\n s[i], s[len(s) - i - 1] = s[len(s) - i - 1], s[i]\r\nfor i in range(len(s)):\r\n print(s[i], end='')\r\nprint()# 1691335974.482381", "s = list(input())\r\nn = len(s) // 2\r\nm = int(input())\r\narr = [int(x) for x in input().split()]\r\ncumm = [0] * (n + 1)\r\nfor i in arr:\r\n cumm[i - 1] += 1\r\nfor i in range(1, n+1):\r\n cumm[i] += cumm[i-1]\r\nfor i in range(n):\r\n if (cumm[i] % 2 == 1):\r\n s[i], s[-i-1] = s[-i-1], s[i]\r\nprint(*s, sep='')", "\r\ns = input()\r\nm = len(s)\r\nn = int(input())\r\narr = [0 for _ in range(m+1)]\r\nout = list(map(int, input().split()))\r\n\r\nfor x in out:\r\n arr[x] = 1 + arr[x]\r\n if m-x+2<=m:\r\n arr[m-x+2] -= 1\r\n \r\n \r\nfor y in range(1, m+1):\r\n arr[y] = arr[y] + arr[y-1]\r\n\r\nout = list(s)\r\n\r\ni = 1\r\nwhile i <= m//2:\r\n if arr[i]&1:\r\n out[i-1], out[m-i] = out[m-i], out[i-1]\r\n i+=1\r\nprint(\"\".join(out))\r\n \r\n", "import copy\r\n\r\nst = input()\r\nm = int(input())\r\nin_arr = list(map(int, input().split()))\r\n\r\nlist_st = list(st)\r\n\r\nn = len(st)\r\narr = [0]* (n//2+1)\r\n\r\nfor i in in_arr:\r\n arr[i]+=1\r\n\r\nfor i in range(1,n//2+1):\r\n arr[i]+= arr[i-1]\r\n if arr[i] %2 ==1:\r\n temp = copy.deepcopy(list_st[i-1])\r\n list_st[i-1] = copy.deepcopy(list_st[n-i])\r\n list_st[n-i] = temp\r\n\r\nprint(\"\".join(list_st))\r\n\r\n\r\n\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip().decode())\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nn = len(s)\r\nc = [0] * n\r\nfor i in a:\r\n c[i - 1] ^= 1\r\nfor i in range(1, n):\r\n c[i] ^= c[i - 1]\r\nfor i in range(n // 2):\r\n if c[i]:\r\n s[i], s[n - i - 1] = s[n - i - 1], s[i]\r\nans = \"\".join(s)\r\nsys.stdout.write(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input()[:-1])\r\nn = len(s)\r\nd = [0]*(n//2+1)\r\nq = int(input())\r\nfor a in map(lambda x:int(x)-1, input().split()):\r\n d[a] += 1\r\n\r\nfor i in range(1, n//2+1):\r\n d[i] += d[i-1]\r\nfor i in range(n//2):\r\n if d[i] % 2:\r\n s[i], s[n-i-1] = s[n-i-1], s[i]\r\n\r\nprint(''.join(map(str, s)))", "from sys import stdin\r\ninput=stdin.readline\r\nstring=list(input().strip()) ; day=int(input()) ; lenth=len(string) ; indexes=input().strip().split() ; arr=[0]*lenth \r\nfor i in indexes:\r\n arr[int(i)-1]+=1\r\n arr[lenth-int(i)]-=1\r\ncum=[arr[0]]\r\nfor i in range(1,lenth):\r\n cum.append(arr[i]+cum[-1])\r\nfor i in range(lenth//2):\r\n if cum[i]%2==1:\r\n x,y=string[i],string[lenth-i-1]\r\n string[i],string[lenth-i-1]=y,x\r\n \r\nprint(\"\".join(string))", "s = list(input())\r\nn = len(s) // 2\r\nm = int(input())\r\na = [int(x) for x in input().split()]\r\nsums = [0] * (n + 1)\r\nfor i in a:\r\n sums[i - 1] += 1\r\nfor i in range(1, len(sums)):\r\n sums[i] += sums[i-1]\r\n\r\nfor i in range(n):\r\n if (sums[i] % 2 == 1):\r\n s[i], s[-i-1] = s[-i-1], s[i]\r\n\r\nprint(\"\".join(s))\r\n\r\n", "s = [i for i in input()]\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\narr.sort()\r\nr = 0\r\nj = 0\r\nfor i in range(len(s) // 2):\r\n while j < n and arr[j] <= i + 1:\r\n r += 1\r\n j += 1\r\n if r % 2 == 1:\r\n s[i], s[-i - 1] = s[-i - 1], s[i]\r\nprint(''.join(s))", "from sys import stdin, stdout\r\n\r\ns = list(stdin.readline().strip())\r\nreq = [0]*(len(s)//2)\r\nm = int(stdin.readline().strip())\r\narr = [int(num) for num in stdin.readline().strip().split()]\r\nfor i in range(m):\r\n req[arr[i]-1] += 1\r\nprev = req[0]\r\nfor i in range(1, len(s)//2):\r\n req[i] += prev\r\n prev = req[i]\r\nl = (len(s)//2) - 1\r\nr = l+1 if len(s)%2 == 0 else l+2\r\ni = (len(s)//2)-1\r\nwhile i>=0:\r\n if req[i]%2 != 0:\r\n s[l], s[r] = s[r], s[l]\r\n l -= 1\r\n r += 1\r\n i -= 1\r\nstdout.write(''.join(s))\r\n", "import string\ns = list(input())\nn= int(input())\nc= [0]*len(s)\ndata = input().split()\nfor i in data:\n c[int(i)-1]+=1\nfor i in range (len(s)//2):\n c[i+1]+=c[i]\n if c[i]%2==1:\n s[i], s[-i-1] = s[-i-1], s[i]\n\nfor i in s:\n print(i, end='')", "s = list(input())\r\nn = len(s)//2\r\nm = int(input())\r\nl = list(map(int,input().split()))\r\nsumm = [0] * (n+1)\r\n\r\nfor i in l :\r\n summ[i-1] +=1\r\n\r\nfor i in range(1,n+1):\r\n summ[i] += summ[i-1]\r\n\r\nfor i in range(n):\r\n if summ[i] % 2 ==1 :\r\n s[i] , s[-i-1] = s[-i-1] , s[i]\r\n\r\nprint(''.join(s))\r\n", "import math\r\ndata = list(input())\r\npr = [False]*math.ceil(len(data)//2)\r\nam = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nprSum = False\r\nfor i in range(am):\r\n prSum = not prSum\r\n end = 0\r\n if i < am-1:\r\n end = arr[i+1]\r\n else:\r\n end = len(pr)\r\n for g in range(arr[i]-1,end):\r\n pr[g] = prSum\r\n\r\nl = len(data)\r\nfor i in range(len(pr)):\r\n if pr[i]:\r\n f = data[i]\r\n\r\n data[i] = data[l-i-1]\r\n data[l-i-1] = f\r\nprint(*data,sep=\"\")", "s = list(\" \"+input())\r\nm = len(s)-1\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nsm = [0]*(m+1)\r\nfor i in arr:\r\n sm[i] += 1\r\n if m-i+2<=m:\r\n sm[m-i+2] -= 1\r\nfor i in range(1,m+1): sm[i] += sm[i-1]\r\nfor i in range(1,m//2+1):\r\n if sm[i]&1:\r\n s[i],s[m-i+1] = s[m-i+1],s[i]\r\nprint(\"\".join(s[1:]))", "import random, math\nfrom copy import deepcopy as dc\n\n# To Genrate Random Number for Test-Cases\ndef randomNumber(s, e):\n\treturn random.randint(s, e)\n\n# To Generate Random Array for Test-Cases\ndef randomArray(s, e, s_size, e_size):\n\tsize = random.randint(s_size, e_size)\n\tarr = [randomNumber(s, e) for i in range(size)]\n\treturn arr\n\n# To Generate Question Specific Test-Cases\ndef testcase():\n\tpass\n\n# Brute Force Approach to check Solution\ndef brute(s, m, li):\n\tn = len(s)\n\tfor i in li:\n\t\tst = i - 1\n\t\te = n - i\n\t\ts = s[:st] + s[st:e+1][::-1] + s[e+1:]\n\t\t# print(st, e, s)\n\treturn s\n\n# Efficient Approach for problem\ndef effe(s, m, li):\n\tli.sort()\n\tn = len(s)\n\tmid = n // 2\n\tswapper = [0]*mid\n\tk = 0\n\tk1 = 0\n\twhile k < mid and k1 < m:\n\t\t# print(k, k1, swapper[k] <= swapper[k - 1], end = \" \")\n\t\tif k and swapper[k] <= swapper[k - 1]:\n\t\t\tswapper[k] = swapper[k-1] if k else 0\n\t\tif k+1 == li[k1]:\n\t\t\tk1 += 1\n\t\t\tswapper[k] += 1\n\t\telif k+1 < li[k1]:\n\t\t\tk += 1\n\t\telse:\n\t\t\tk1 += 1\n\t\t# print(k, k1,swapper)\n\tk += 1\n\twhile k and k < mid:\n\t\tswapper[k] = swapper[k - 1]\n\t\tk += 1\n\t# print(swapper)\n\tfor i in range(mid):\n\t\tswapper[i] %= 2\n\ts = list(s)\n\tfor i in range(mid):\n\t\tif swapper[i]:\n\t\t\ts[i], s[n-i-1] = s[n-i-1], s[i]\n\treturn ''.join(s)\n\n# Function to call the actual solution\ndef solution(s, m, li):\n\treturn effe(s, m, li)\n\n\n# Function to take input\ndef input_test():\n\ts = input()\n\tm = int(input())\n\tli = list(map(int, input().strip().split(\" \")))\n\tout = solution(s, m ,li)\n\tprint(out)\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "a =list(input())\r\nn = int(input())\r\nt = [int(i) for i in input().split()]\r\nt = sorted(t)\r\ns = len(a)\r\nk=0\r\nfor i in range(s//2):\r\n while k<n and t[k]-1 <= i:\r\n k+=1\r\n if k%2==1:\r\n a[i],a[s-i-1] = a[s-i-1],a[i]\r\nprint(''.join(a))", "s = input()\r\nm = int(input())\r\na = [0]*(len(s)//2)\r\nb = input().split()\r\nb = list(map(int, b))\r\nfor i in range(m):\r\n n = b[i]\r\n n = n-1\r\n a[n] += 1\r\nsum1 = [0]*len(a)\r\nsum1[0] = a[0]\r\nfor i in range(1, len(a)):\r\n sum1[i] = a[i]+sum1[i-1]\r\ns = list(s)\r\nfor i in range(len(a)):\r\n if sum1[i] % 2 == 1:\r\n s[i], s[len(s)-i-1] = s[len(s)-i-1], s[i]\r\n\r\nprint(*s, sep=\"\")", "s=input()\r\nn=int(input())\r\nle=len(s)\r\npar=[0]*(le)\r\ny=[(False,-1)]\r\nli=list(map(int,input().split()))\r\nfor i in li:\r\n par[i-1]+=1\r\n par[le-i]-=1\r\nt=True\r\nco=0\r\nnum=0\r\nh=\"\"\r\nwhile co<le:\r\n num+=par[co]\r\n if par[co]>0:\r\n t=((t+par[co])%2)\r\n y.append((t,num))\r\n if t==False:\r\n h+=s[le-(co+1)]\r\n else:\r\n h+=s[co]\r\n elif par[co]<0:\r\n if t==False:\r\n h+=s[le-(co+1)]\r\n else:\r\n h+=s[co]\r\n t=((t-par[co])%2)\r\n else:\r\n if t == False:\r\n h += s[le - (co + 1)]\r\n else:\r\n h += s[co]\r\n\r\n co+=1\r\n\r\nprint(h)", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\ns = list(input())\r\nm, = Neo()\r\nA = Neo()\r\nn = len(s)\r\nmark = [0]*(n+1)\r\nfor i in A:\r\n l = i-1\r\n r = n-i-1\r\n mark[l] += 1\r\n mark[r+1] -= 1\r\nmark = list(accumulate(mark)) \r\n# print(mark)\r\nfor i in range(n//2):\r\n if mark[i]%2:\r\n s[i],s[n-i-1] = s[n-i-1],s[i]\r\nprint(''.join(s)) \r\n", "ss=input()\ns=list(ss)\nn=len(s)\nm=int(input())\narr=list(map(int,input().split()))\npr=[0]*((n+1)//2)\nfor i in arr:\n pr[i-1]=pr[i-1]+1\npref=[]\nfor i in range(len(pr)):\n if i==0:\n pref.append(pr[i])\n else:\n pref.append(pref[-1]+pr[i])\nfor i in range(len(pref)):\n if pref[i]%2==1:\n c=s[i]\n d=s[n-1-i]\n s[i]=d\n s[n-1-i]=c\nfor i in range(n):\n print(s[i], end=\"\")\n\n\t \t \t \t \t\t \t\t \t\t \t \t \t", "s = input()\r\nn = len(s)\r\npref = [0]*(n+1)\r\nm = int(input())\r\nfor x in input().split():\r\n x = int(x)\r\n x -= 1\r\n pref[x] += 1\r\n pref[n-x] -= 1\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += pref[i]\r\n if cnt%2==0:\r\n print(s[i],end=\"\")\r\n else:\r\n print(s[n-i-1],end=\"\")\r\n", "s = input()\r\nm = int(input())\r\na = list(map(int, input().split()))\r\nl = len(s)\r\nn = (l+1)//2\r\nk = [False]*n\r\n\r\nfor i in a:\r\n pos = min(i, l-i+1)-1\r\n k[pos] = not k[pos]\r\n\r\nif l % 2 == 0:\r\n k += [0]+k[::-1][:-1]\r\nelse:\r\n k += [0]+k[::-1][1:-1]\r\n\r\nnew = ''\r\nm = False\r\nfor i in range(l):\r\n if k[i]:\r\n m = not(m)\r\n if m:\r\n new += s[l-i-1]\r\n else:\r\n new += s[i]\r\n\r\nprint(new)" ]

[ "n = int(input())\nL = [tuple(map(int, input().split(' '))) for i in range(n)]\nans = []\ntry :\n for l,r in reversed(L) :\n d,a=1,\"(\"\n while d < l :\n d += len(ans[-1])\n a += ans.pop()\n if d > r : raise IndexError\n a += \")\"\n ans.append(a)\nexcept IndexError :\n print(\"IMPOSSIBLE\")\n exit()\nprint(\"\".join(reversed(ans)))\n \t\t \t \t\t\t\t \t\t \t\t \t \t\t \t\t\t" ]

[ "from collections import defaultdict, deque\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nl = list(input())\r\ndeg = [0 for i in range(n)]\r\ngraph = defaultdict(list)\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n graph[a].append(b)\r\n deg[b] += 1\r\nq = deque()\r\nfor i in range(n):\r\n if deg[i] == 0:\r\n q.append(i)\r\ncount = 0\r\nans = 0\r\ndp = [[0 for i in range(26)] for i in range(n)]\r\nwhile count < n and q:\r\n und = q.popleft()\r\n count += 1\r\n dp[und][ord(l[und]) - 97] += 1\r\n for i in graph[und]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[und][j])\r\n deg[i] -= 1\r\n if deg[i] == 0:\r\n q.append(i)\r\nif count != n:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n for i in range(n):\r\n ans = max(ans, max(dp[i]))\r\n print(ans)", "from collections import deque\r\nimport sys\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef get_ints():\r\n return map(int,sys.stdin.readline().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int,sys.stdin.readline().strip().split()))\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\n\r\nn,m = get_ints()\r\n\r\ns = get_string()\r\n\r\nindegree = [0]*n\r\n\r\nadj = [[] for _ in range(n)]\r\n\r\n\r\nfor i in range(m):\r\n u,v = get_ints()\r\n u-=1\r\n v-=1\r\n adj[u].append(v)\r\n \r\n indegree[v]+=1\r\n\r\n\r\nq = deque()\r\n\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if indegree[i]!=0:\r\n continue\r\n q.append(i)\r\n\r\ntopSort = []\r\n\r\nwhile q:\r\n node = q.popleft()\r\n cnt+=1\r\n topSort.append(node)\r\n\r\n for u in adj[node]:\r\n indegree[u]-=1\r\n\r\n if indegree[u]==0:\r\n q.append(u)\r\n\r\nif cnt<n:\r\n print(-1)\r\n exit()\r\n\r\n\r\n\r\nans = 0\r\n\r\nfor i in range(26):\r\n dp = [0]*n\r\n for x in topSort:\r\n if s[x]==chr(i+ord('a')):\r\n dp[x]+=1\r\n\r\n for y in adj[x]:\r\n dp[y] = max(dp[y],dp[x])\r\n\r\n ans = max(ans,dp[x])\r\n\r\nprint(ans)\r\n\r\n\r\n", "import sys\r\nfrom collections import deque\r\n \r\ninput = sys.stdin.readline\r\n \r\nn, m = map(int, input().split())\r\ns = list(input())\r\n \r\ngraph = [[] for _ in range(n)]\r\ndegree = [0 for _ in range(n)]\r\ndp = [[0 for _ in range(26)] for _ in range(n)]\r\n \r\nfor i in range(m):\r\n a, b = map(lambda x: int(x) - 1, input().split())\r\n graph[a].append(b)\r\n degree[b] += 1\r\n \r\n \r\nqueue = deque()\r\nfor i in range(n):\r\n if degree[i] == 0:\r\n queue.append(i)\r\n \r\n \r\ncount = 0\r\nwhile count < n and queue:\r\n count += 1\r\n node = queue.popleft()\r\n dp[node][ord(s[node]) - 97] += 1\r\n \r\n for i in graph[node]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[node][j])\r\n \r\n degree[i] -= 1\r\n if degree[i] == 0:\r\n queue.append(i)\r\n \r\nif count != n:\r\n print(-1)\r\nelse:\r\n result = 0\r\n for i in dp:\r\n result = max(result, max(i))\r\n print(result)", "from collections import defaultdict\nfrom collections import deque\nfrom heapq import heappush, heappop, heapify\nimport sys, threading\nimport math\nMOD = 10**9+7\n \ninput=sys.stdin.readline\ndef solution(t = 0):\n n,m=map(int,input().split())\n l=list(input())\n deg=[0 for i in range(n)]\n graph=defaultdict(list)\n for i in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n graph[a].append(b)\n deg[b]+=1\n q=deque()\n for i in range(n):\n if deg[i]==0:\n q.append(i)\n count=0\n ans=0\n dp=[[0 for i in range(26)] for i in range(n)]\n while count<n and q:\n und=q.popleft()\n count+=1\n dp[und][ord(l[und])-97]+=1\n for i in graph[und]:\n for j in range(26):\n dp[i][j]=max(dp[i][j],dp[und][j])\n deg[i]-=1\n if deg[i]==0:\n q.append(i)\n if count!=n:\n print(-1)\n else:\n ans=0\n for i in range(n):\n ans=max(ans,max(dp[i]))\n print(ans)\n \n\ndef main(): \n t = 1\n #t = int(input())\n for i in range(t):\n solution(i+1)\n\n\n#print=sys.stdout.write\n#------------------#\n# recursion Region #\n#------------------#\n \n#sys.setrecursionlimit(10**6)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import deque\r\nn, m = map(int, input().split())\r\ns = input()[:-1]\r\nd = [[] for i in range(n)]\r\nv = [0]*n\r\nfor i in range(m):\r\n a, b = map(lambda x:int(x)-1, input().split())\r\n d[a].append(b)\r\n v[b] += 1\r\nq = deque([i for i in range(n) if not v[i]])\r\nx = [[0 for i in range(26)] for j in range(n)]\r\nc = 0\r\nwhile q:\r\n a = q.popleft()\r\n c += 1\r\n x[a][ord(s[a])-97] += 1\r\n for i in d[a]:\r\n for j in range(26):\r\n x[i][j] = max(x[i][j], x[a][j])\r\n v[i] -= 1\r\n if v[i] == 0:\r\n q.append(i)\r\nif c != n:\r\n print(-1)\r\nelse:\r\n print(max(max(i) for i in x))", "from collections import defaultdict, deque, Counter\r\nimport sys\r\nimport bisect\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\nmod = 1000000007\r\n\r\nn ,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nl = list(input())\r\ndegree = [0 for i in range(n)]\r\ngraph = defaultdict(list)\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n graph[a].append(b)\r\n degree[b] += 1\r\nq = deque()\r\nfor i in range(n):\r\n if degree[i] == 0:\r\n q.append(i)\r\ncount = 0\r\nans = 0\r\n# print(degree)\r\ndp = [[0 for i in range(26)] for i in range(n)]\r\nwhile count < n and q:\r\n x = q.popleft()\r\n count += 1\r\n dp[x][ord(l[x]) - 97] += 1\r\n for i in graph[x]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[x][j])\r\n degree[i] -= 1\r\n if degree[i] == 0:\r\n q.append(i)\r\nif count != n:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n for i in range(n):\r\n ans = max(ans, max(dp[i]))\r\n print(ans)", "from collections import defaultdict, deque\r\n\r\ndef beauty(n, m, s, x, y):\r\n # Initialize degree and graph\r\n deg = [0 for i in range(n)]\r\n graph = defaultdict(list)\r\n \r\n # Populate graph and degree\r\n for i in range(m):\r\n a, b = x[i], y[i]\r\n a -= 1\r\n b -= 1\r\n graph[a].append(b)\r\n deg[b] += 1\r\n \r\n # Initialize queue with nodes with zero degree\r\n q = deque()\r\n for i in range(n):\r\n if deg[i] == 0:\r\n q.append(i)\r\n \r\n count = 0\r\n ans = 0\r\n dp = [[0 for i in range(26)] for i in range(n)]\r\n \r\n # Process nodes in topological order\r\n while count < n and q:\r\n und = q.popleft()\r\n count += 1\r\n dp[und][ord(s[und]) - 97] += 1\r\n for i in graph[und]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[und][j])\r\n deg[i] -= 1\r\n if deg[i] == 0:\r\n q.append(i)\r\n \r\n if count != n:\r\n return -1\r\n else:\r\n for i in range(n):\r\n ans = max(ans, max(dp[i]))\r\n return ans\r\n\r\nn, m = map(int, input().split())\r\ns = input().strip()\r\nx, y = [], []\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n x.append(a)\r\n y.append(b)\r\nresult = beauty(n, m, s, x, y)\r\nprint(result)\r\n", "from collections import deque\nimport sys\ninput=sys.stdin.readline\n \nn, m = map(int, input().strip().split())\ns = input().strip()\ndeg = [0] * n\nadj = [[] for i in range(n)]\nfor i in range(m):\n x, y = map(int, input().strip().split())\n x -= 1\n y -= 1\n adj[x].append(y)\n deg[y] += 1\n \nq = deque()\nfor i in range(n):\n if deg[i] == 0:\n q.append(i)\n \ncnt = 0\ndp = [[0 for i in range(26)] for j in range(n)]\nwhile q:\n node = q.popleft()\n dp[node][ord(s[node]) - 97] += 1\n cnt += 1\n for i in adj[node]:\n for j in range(26):\n dp[i][j] = max(dp[i][j], dp[node][j])\n deg[i] -= 1\n if deg[i] == 0:\n q.append(i)\n \nif cnt == n:\n ans = 0\n for i in range(n):\n ans = max(ans,max(dp[i]))\n print(ans)\nelse:\n print(-1)\n\t\t \t \t\t \t\t \t\t \t \t \t\t \t", "from collections import deque\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n s = input()\r\n graph = [[] for i in range(n)]\r\n dp = [[0] * 26 for i in range(n)]\r\n degree = [0] * n\r\n for i in range(m):\r\n x, y = map(int, input().split())\r\n graph[x - 1].append(y - 1)\r\n degree[y - 1] += 1\r\n d = deque()\r\n for i in range(n):\r\n if degree[i] == 0:\r\n dp[i][ord(s[i]) - ord('a')] += 1\r\n d.append(i)\r\n visited = 0\r\n while d and visited < n:\r\n visited += 1\r\n x = d.popleft()\r\n for i in graph[x]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[x][j])\r\n degree[i] -= 1\r\n if degree[i] == 0:\r\n dp[i][ord(s[i]) - ord('a')] += 1\r\n d.append(i)\r\n if visited != n:\r\n print(-1)\r\n else:\r\n res = 0\r\n for i in dp:\r\n res = max(res, max(i))\r\n print(res)\r\n", "from collections import defaultdict, deque, Counter\r\nimport sys\r\nimport bisect\r\nimport math\r\nn, m = map(int, input().split())\r\nl = list(input())\r\na = [0 for i in range(n)]\r\ngraph = defaultdict(list)\r\nfor i in range(m):\r\n x,y= map(int, input().split())\r\n graph[x-1].append(y-1)\r\n a[y-1] += 1\r\nqueue = deque()\r\nfor i in range(n):\r\n if a[i] == 0:\r\n queue.append(i)\r\ntemp_count = 0\r\nfinal_ans = 0\r\ndp = [[0 for i in range(26)] for i in range(n)]\r\nwhile temp_count < n and queue:\r\n x = queue.popleft()\r\n temp_count += 1\r\n dp[x][ord(l[x]) - 97] += 1\r\n for i in graph[x]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[x][j])\r\n a[i] -= 1\r\n if a[i] == 0:\r\n queue.append(i)\r\nif temp_count != n:\r\n print(-1)\r\nelse:\r\n final_ans = 0\r\n for i in range(n):\r\n final_ans = max(final_ans, max(dp[i]))\r\n print(final_ans)\r\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\nfrom collections import defaultdict\r\ndef main():\r\n n,m=rm()\r\n s=rs()\r\n g=defaultdict(list)\r\n d=[0]*n\r\n dp=[[0]*26 for i in range(n)]\r\n for i in range(m):\r\n u,v=rm();u-=1;v-=1\r\n g[u].append(v)\r\n d[v]+=1\r\n ans=0\r\n ok=[]\r\n rem=set(range(n))\r\n for i in range(n): \r\n if d[i]==0: ok.append(i);rem.discard(i)\r\n while ok:\r\n tp=[]\r\n for i in ok:\r\n for j in range(26):\r\n dp[i][j]+=int(ord(s[i])-97==j)\r\n ans=max(ans,dp[i][j])\r\n for v in g[i]:\r\n d[v]-=1\r\n for j in range(26): dp[v][j]=max(dp[v][j],dp[i][j])\r\n if d[v]==0: tp.append(v);rem.discard(v)\r\n ok=tp\r\n if rem: return -1\r\n return ans\r\n\r\n\r\nprint(main())", "from math import *\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#------------------------------------f**k dfs(TLE in python) let's do bfs\r\n\r\n\r\ndef main():\r\n how_much_noob_I_am = 1\r\n #how_much_noob_I_am = inpu()\r\n for case in range(how_much_noob_I_am):\r\n n,m = sep()\r\n s= inp()\r\n d=defaultdict(list)\r\n indegree=defaultdict(int)\r\n for i in range(m):\r\n x,y=sep()\r\n d[x].append(y)\r\n indegree[y]+=1\r\n # def dfs(visited, d, curr, arr, s):\r\n # nonlocal ans\r\n # ans = max(ans, max(arr))\r\n # visited[curr] = 1\r\n # for j in d[curr]:\r\n # if visited[j] == 1:\r\n # return True\r\n # list1 = arr.copy()\r\n # list1[ord(s[j - 1]) - 97] += 1\r\n # dfs(visited, d, j, list1, s)\r\n # visited[curr] = 2\r\n # return False\r\n # for i in range(1,n+1):\r\n # if visited[i]==0:\r\n # arr=[0]*(26)\r\n # arr[ord(s[i - 1]) - 97] += 1\r\n # if dfs(visited,d,i,arr,s):\r\n # print(-1)\r\n # break\r\n # else:\r\n # print(ans)\r\n q=deque()\r\n for i in range(1,n+1):\r\n if indegree[i]==0:\r\n q.append(i)\r\n count = 0\r\n ans = 0\r\n dp = [[0 for i in range(26)] for i in range(n+1)]\r\n while count < n and q:\r\n und = q.popleft()\r\n count += 1\r\n dp[und][ord(s[und-1]) - 97] += 1\r\n for i in d[und]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[und][j])\r\n indegree[i] -= 1\r\n if indegree[i] == 0:\r\n q.append(i)\r\n if count!=n:\r\n print(-1)\r\n continue\r\n for i in range(1,n+1):\r\n ans = max(ans,max(dp[i]))\r\n print(ans)\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\nfrom functools import lru_cache\nfrom collections import defaultdict, deque \ninput = sys.stdin.readline\n\n\ndef get_adj_list(edges, n):\n \n adj_list = defaultdict(list)\n incoming = [0] * n\n \n for src, dst in edges:\n adj_list[src].append(dst)\n incoming[dst] += 1\n \n return adj_list, incoming\n\ndef letter_to_int(letter):\n return ord(letter) - 97\n \ndef solve(letters, edges, n):\n \n adj_list, incoming = get_adj_list(edges, n)\n \n nodes = []\n for node in range(n):\n if incoming[node] == 0:\n nodes.append(node)\n \n longest_paths = [[0] * 26 for _ in range(n)]\n for i, letter in enumerate(letters):\n longest_paths[i][letter_to_int(letter)] = 1\n\n num_visited_nodes = 0\n max_path = 1\n while nodes:\n node = nodes.pop()\n num_visited_nodes += 1\n \n for child in adj_list[node]:\n incoming[child] -= 1\n for i in range(26):\n delta = 1 if i == letter_to_int(letters[child]) else 0\n longest_paths[child][i] = max(longest_paths[child][i], longest_paths[node][i] + delta)\n max_path = max(max_path, max(longest_paths[child]))\n \n if incoming[child] == 0:\n nodes.append(child)\n \n return max_path if n == num_visited_nodes else -1\n \n\nif __name__ == \"__main__\":\n n, m = [int(val) for val in input().split()]\n \n letters = [char for char in input().split()][0]\n edges = []\n for _ in range(m):\n edge = [int(val)-1 for val in input().split()]\n edges.append(edge)\n \n print(solve(letters, edges, n))\n \n \n", "from collections import deque\r\nn,m=map(int,input().split())\r\ns=input()\r\ngraph=[ [] for i in range(n)]\r\nfreq=[[0]*26 for i in range(n)]\r\ndegree=[0]*n\r\ndegree[0]=0\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n graph[x-1].append(y-1)\r\n degree[y-1]+=1\r\nd=deque()\r\nfor i in range(n):\r\n if degree[i]==0:\r\n d.append(i)\r\n freq[i][ord(s[i])-97]+=1\r\nc=0\r\nm=1\r\nwhile(d):\r\n c+=1\r\n x=d.popleft()\r\n for i in graph[x]:\r\n for j in range(26):\r\n freq[i][j]=max(freq[i][j],freq[x][j])\r\n degree[i]-=1\r\n if degree[i]==0:\r\n freq[i][ord(s[i])-97]+=1\r\n for j in range(26):\r\n m=max(m,freq[i][j])\r\n d.append(i)\r\nif c!=n:\r\n print(-1)\r\nelse:\r\n print(m)\r\n", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\ns = input()\r\n\r\ng = [[] for i in range(n+1)]\r\nid = [0 for i in range(n+1)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n id[v] += 1\r\n\r\nc = 0\r\nq = deque()\r\ndp = [[0 for i in range(26)] for i in range(n+1)]\r\nfor i in range(1, n+1):\r\n if id[i] == 0:\r\n q.append(i)\r\n\r\nwhile q and c < n:\r\n node = q.popleft()\r\n c += 1\r\n dp[node][ord(s[node-1])-ord('a')] += 1\r\n for i in g[node]:\r\n for j in range(26):\r\n dp[i][j] = max(dp[i][j], dp[node][j])\r\n id[i] -= 1\r\n if id[i] == 0:\r\n q.append(i)\r\n\r\n\r\nres = 0\r\nfor i in range(1, n+1):\r\n res = max(res, max(dp[i]))\r\nprint(-1 if c != n else res)\r\n", "from collections import deque, defaultdict\r\n\r\nn, m = map(int, input().split())\r\nletters = input().strip()\r\ngraph = defaultdict(list)\r\nindegree = [0] * n\r\nq = deque([])\r\nmat = [[0] * 26 for _ in range(n)]\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n graph[x-1].append(y-1)\r\n indegree[y-1] += 1\r\n\r\nfor i in range(n):\r\n if indegree[i] == 0:\r\n q.append(i)\r\ncnt = 0\r\nwhile q:\r\n cur = q.popleft()\r\n cnt += 1\r\n mat[cur][ord(letters[cur]) - ord('a')] += 1\r\n for nei in graph[cur]:\r\n for j in range(26):\r\n mat[nei][j] = max(mat[nei][j], mat[cur][j])\r\n indegree[nei] -= 1\r\n if indegree[nei] == 0:\r\n q.append(nei)\r\nif cnt != n:\r\n print(-1)\r\n exit(0)\r\nans = 0\r\nfor i in range(len(mat)):\r\n for j in range(26):\r\n ans = max(ans, mat[i][j])\r\nprint(ans)\r\n \r\n \r\n ", "import sys\r\nfrom collections import deque\r\ninput = lambda: sys.stdin.readline().strip()\r\nn, m = map(int, input().split())\r\ncolors = input()\r\ng = [[] for _ in range(n)]\r\ndeg = [0] * n\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n deg[v] += 1\r\nq = deque([u for u in range(n) if deg[u] == 0])\r\nf = [[0] * 26 for _ in range(n)]\r\ncnt = 0\r\nwhile q:\r\n cnt += 1\r\n u = q.popleft()\r\n f[u][ord(colors[u]) - ord('a')] += 1\r\n for v in g[u]:\r\n deg[v] -= 1\r\n for c in range(26):\r\n f[v][c] = max(f[v][c], f[u][c])\r\n if deg[v] == 0:\r\n q.append(v)\r\nif cnt != n:\r\n print(-1)\r\nelse:\r\n print(max(map(max, f)))", "MAX = 300005\r\nn, m = map(int, input().split())\r\ns = input()\r\ns = \" \"+s\r\nedges = []\r\nDP = []\r\nfor i in range(n+1):\r\n edges.append([])\r\n DP.append([0]*26)\r\nQ = [0]*MAX\r\nfront = 0\r\nrear = 0\r\ndeg = [0]*(n+1)\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n #print(x,y)\r\n edges[x].append(y)\r\n #print(edges)\r\n deg[y] += 1\r\n#print(edges)\r\n\r\n\r\ndef topSort():\r\n rear = front = 0\r\n cnt = 0\r\n for i in range(1, n+1):\r\n if(deg[i] == 0):\r\n Q[rear] = i\r\n rear += 1\r\n DP[i][ord(s[i])-97] = 1\r\n# for i in DP:\r\n# print(i)\r\n while(front != rear):\r\n u = Q[front]\r\n front += 1\r\n cnt += 1\r\n for i in range(len(edges[u])):\r\n v = edges[u][i]\r\n for j in range(26):\r\n x = DP[u][j]\r\n if(j == ord(s[v])-ord('a')):\r\n x += 1\r\n DP[v][j] = max(x, DP[v][j])\r\n deg[v] -= 1\r\n if(deg[v] == 0):\r\n Q[rear] = v\r\n rear += 1\r\n ans = -1\r\n for i in range(1, n+1):\r\n for j in range(26):\r\n ans = max(ans, DP[i][j])\r\n return cnt == n, ans\r\n\r\n\r\nif __name__ == \"__main__\":\r\n result = topSort()\r\n if(result[0]):\r\n print(result[1])\r\n else:\r\n print(-1)", "from collections import defaultdict,deque\r\nimport sys\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\ns = input()\r\nd=defaultdict(list)\r\ndegree = [0 for i in range(n)]\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n d[a-1].append(b-1)\r\n \r\n degree[b-1]+=1\r\n \r\nq = deque()\r\n \r\nfor i in range(n):\r\n if degree[i]==0:\r\n q.append(i)\r\ndp = [[0 for i in range(26)]for j in range(n)]\r\nc=0\r\nwhile q:\r\n p = q.popleft()\r\n dp[p][ord(s[p])-ord(\"a\")]+=1\r\n c+=1\r\n for i in (d[p]):\r\n for j in range(26):\r\n dp[i][j]=max(dp[i][j],dp[p][j])\r\n degree[i]-=1\r\n if degree[i]==0:\r\n q.append(i)\r\nif c!=n:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n for i in range(n):\r\n ans = max(ans,max(dp[i]))\r\n print(ans)", "from collections import defaultdict,deque\r\nimport sys\r\ninput=sys.stdin.readline \r\nn,m=map(int,input().split())\r\nl=list(input())\r\nbeauty=[0 for i in range(n)]\r\ngraph=defaultdict(list)\r\nfor i in range(m):\r\n\ta,b=map(int,input().split())\r\n\ta-=1\r\n\tb-=1\r\n\tgraph[a].append(b)\r\n\tbeauty[b]+=1\r\nq=deque()\r\nfor i in range(n):\r\n\tif beauty[i]==0:\r\n\t\tq.append(i)\r\ncount=0\r\nans=0\r\n# print(degree)\r\ndp=[]\r\nfor i in range(n):\r\n dp.append([0]*(26))\r\nwhile count<n and q:\r\n\tnum=q.popleft()\r\n\tcount+=1\r\n\t# print(ord(l[x])-97)\r\n\tdp[num][ord(l[num])-97]+=1\r\n\tfor i in graph[num]:\r\n\t\tfor j in range(26):\r\n\t\t\tdp[i][j]=max(dp[i][j],dp[num][j])\r\n\t\tbeauty[i]-=1\r\n\t\tif beauty[i]==0:\r\n\t\t\tq.append(i)\r\nif count!=n:\r\n\tprint(-1)\r\nelse:\r\n\tans=0\r\n\tfor i in range(n):\r\n\t\tans=max(ans,max(dp[i]))\r\n\tprint(ans)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef topological_sort():\r\n q, k = [], 0\r\n cnt = [0] * (n + 1)\r\n for i in range(1, n + 1):\r\n for j in G[i]:\r\n cnt[j] += 1\r\n for i in range(1, n + 1):\r\n if not cnt[i]:\r\n q.append(i)\r\n while len(q) ^ k:\r\n i = q[k]\r\n for j in G[i]:\r\n cnt[j] -= 1\r\n if not cnt[j]:\r\n q.append(j)\r\n k += 1\r\n return q\r\n\r\ndef f(u, v):\r\n return u * 26 + v\r\n\r\nn, m = map(int, input().split())\r\ns = [0] + list(input().rstrip())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n G[x].append(y)\r\ng = topological_sort()\r\nif len(g) ^ n:\r\n ans = -1\r\n print(ans)\r\n exit()\r\ndp = [0] * (26 * (n + 1))\r\nfor i in g:\r\n dp[f(i, s[i] - 97)] += 1\r\n for j in range(26):\r\n dp0 = dp[f(i, j)]\r\n for k in G[i]:\r\n u = f(k, j)\r\n dp[u] = max(dp[u], dp0)\r\nans = max(dp)\r\nprint(ans)", "from collections import defaultdict,deque,Counter\r\nimport sys\r\nimport bisect\r\nimport math\r\ninput=sys.stdin.readline\r\n \r\nvert,edge=map(int,input().split())\r\nl=list(input())\r\ndeg=[0 for i in range(vert)]\r\ngr=defaultdict(list)\r\nfor i in range(edge):\r\n k1,k2=map(int,input().split())\r\n k1-=1\r\n k2-=1\r\n gr[k1].append(k2)\r\n deg[k2]+=1\r\nq=deque()\r\nfor i in range(vert):\r\n if deg[i]==0:\r\n q.append(i)\r\ncount=0\r\nans=0\r\n# print(degree)\r\ndp=[[0 for i in range(26)] for i in range(vert)]\r\nwhile count<vert and q:\r\n x=q.popleft()\r\n count+=1\r\n # print(ord(l[x])-97)\r\n dp[x][ord(l[x])-97]+=1\r\n for i in gr[x]:\r\n for j in range(26):\r\n dp[i][j]=max(dp[i][j],dp[x][j])\r\n deg[i]-=1\r\n if deg[i]==0:\r\n q.append(i)\r\n# print(degree)\r\nif count!=vert:\r\n print(-1)\r\nelse:\r\n ans=0\r\n for i in range(vert):\r\n ans=max(ans,max(dp[i]))\r\n print(ans)", "import sys\r\nfrom collections import *\r\n\r\n# import itertools\r\n# import math\r\n# import os\r\n# import random\r\n# from bisect import bisect, bisect_left\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush\r\n# from io import BytesIO, IOBase\r\n# from string import *\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# from types import GeneratorType\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n n, m = mint()\r\n s = list(map(ord, input()))\r\n g = [[] for _ in range(n)]\r\n deg = [0] * n\r\n for _ in range(m):\r\n u, v = mint()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n deg[v] += 1\r\n # print(s)\r\n cnt = [[0] * 26 for _ in range(n)]\r\n ans = 0\r\n q = deque((i for i in range(n) if deg[i] == 0))\r\n path = 0\r\n while q:\r\n path += 1\r\n \r\n x = q.popleft()\r\n cnt[x][s[x] - 97] += 1\r\n for d in range(26):\r\n ans = max(ans, cnt[x][d])\r\n \r\n for y in g[x]:\r\n for d in range(26):\r\n cnt[y][d] = max(cnt[y][d], cnt[x][d])\r\n deg[y] -= 1\r\n if deg[y] == 0:\r\n q.append(y)\r\n if path != n:\r\n print(-1)\r\n else:\r\n print(ans)\r\n\r\nsolve()", "import sys\r\nimport math\r\nfrom sys import stdin,stdout\r\nimport itertools\r\nfrom collections import*\r\nfrom math import gcd,ceil,floor\r\nmod = int(1e9+7)\r\ninput=sys.stdin.readline\r\nv,e=map(int,input().split())\r\ns1=list(input())\r\ngraph=defaultdict(list)\r\nedges,m1,c=[],0,0\r\nindegree=[0 for i in range(v)]\r\nfor i in range(e):\r\n a,b=map(int,input().split())\r\n graph[a-1].append(b-1) \r\nfor i in graph:\r\n for j in graph[i]:\r\n edges.append((i,j))\r\nfor i in graph:\r\n for j in graph[i]:\r\n indegree[j]=indegree[j]+1\r\nq1=deque()\r\nfor i in range(v):\r\n if indegree[i]==0:\r\n q1.append(i)\r\nl2=[[0 for _ in range(26)] for _ in range(v)]\r\nwhile c<v and len(q1)!=0:\r\n a1=q1.popleft()\r\n c=c+1\r\n l2[a1][ord(s1[a1])-ord('a')]=l2[a1][ord(s1[a1])-ord('a')]+1\r\n for i in graph[a1]:\r\n for j in range(0,26):\r\n l2[i][j]=max(l2[i][j],l2[a1][j])\r\n indegree[i]=indegree[i]-1\r\n if indegree[i]==0:\r\n q1.append(i)\r\nif c!=v:\r\n print(\"-1\")\r\nelse:\r\n for i in l2:\r\n m1=max(m1,max(i))\r\n print(m1)\r\n" ]

[ "s=input()\r\ns=s[::-1]\r\ns=str(int(s))\r\nif s==s[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=list(input())\r\nx.reverse()\r\ng=False\r\nwhile len(x)>1:\r\n if x[0]=='0' and g==False:\r\n x.pop(0)\r\n else:\r\n g=True\r\n if x[0]!=x[-1]:\r\n print('NO')\r\n exit()\r\n else:\r\n x.pop(0)\r\n x.pop()\r\nprint(\"YES\")", "inputStr = input()\r\ntempRev = inputStr[::-1]\r\nok = False\r\nif(inputStr == tempRev):\r\n ok = True\r\nelse:\r\n zerosAdded = 0\r\n temp = list(inputStr)\r\n for i in reversed(temp):\r\n if(i != '0'):\r\n break\r\n else:\r\n zerosAdded += 1\r\n inputStr =inputStr.rjust(len(inputStr) + zerosAdded, \"0\")\r\n tempRev = inputStr[::-1]\r\n if(inputStr == tempRev):\r\n ok = True\r\nprint(\"YES\" if ok else \"NO\")", "x =input()\ns = \"\"\nt = 0\nfor i in range(len(x)):\n if x[len(x) - i -1] != \"0\":\n s += x[len(x) -i -1]\n t = 1\n elif t != 0:\n s += x[len(x) - i - 1]\nr = \"\"\nfor i in range(len(s)):\n r += s[len(s) - i -1]\nif r == s:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "Number = input()\r\nwhile Number[0] == '0':\r\n Number = Number[1:]\r\nNumber = \"\".join(reversed(Number))\r\nwhile Number[0] == '0':\r\n Number = Number[1:]\r\nprint(\"YES\" if Number==\"\".join(reversed(Number)) else \"NO\")\r\n\r\n\r\n\r\n", "x = input()\r\ny = []\r\np = True\r\nx = x.strip(\"0\")\r\nfor l in x:\r\n y.append(l)\r\nfor z in range(0, len(y)):\r\n if y[z] != y[len(y)-z-1]:\r\n p = False\r\nif p == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#ROUNIAUDI\r\nstring1=input().strip().strip(\"0\")\r\nstr1=string1[::-1]\r\nprint(\"YES\" if str1==string1 else \"NO\")", "x=input()\r\nwhile x[-1]=='0':\r\n x=x[0:-1]\r\nif x[::-1]==x:print('YES')\r\nelse:print('NO')", "n = input().strip('0')\r\nif len(n)%2:\r\n\tprint(['NO','YES'][n[:(len(n)//2)+1]==n[(len(n)//2):][::-1]])\r\nelse:\r\n\tprint(['NO','YES'][n[:(len(n)//2)]==n[(len(n)//2):][::-1]])", "n=int(input())\r\n123\r\n#print (n[0]) \r\nflag=0\r\nwhile n%10==0:\r\n n=n//10\r\n#print (n)\r\nn=str(n) \r\nif n[::-1]==n:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\") \r\n \r\n \r\n ", "s = input()\r\ns = s.strip('0')\r\nl = len(s)\r\nfor i in range(0, l//2):\r\n if s[i] != s[l - 1 - i]:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "import sys\r\ns = input()\r\n\r\ncnt1 = cnt2 = no = 0\r\np = -1\r\nq = len(s)\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n cnt1 += 1\r\n else:\r\n p = i\r\n break\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i] == '0':\r\n cnt2 += 1\r\n else:\r\n q = i\r\n break\r\n#print(s[p:q+1])\r\ns2 = s[p:q+1]\r\nif cnt1 > cnt2:\r\n no = 1\r\nelse:\r\n for i in range(len(s2)//2):\r\n if s2[i] != s2[len(s2) - 1 - i]:\r\n no = 1\r\n break\r\nif no == 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", "a = input()\r\nb = list(a)\r\nwhile b[-1]==\"0\":\r\n\tb.pop()\r\nz = \"\".join(b)\r\nif z == z[::-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = [i for i in input()]\r\nn.reverse()\r\ns = []\r\nfor i in range(len(n)):\r\n if n[i] == \"0\":\r\n continue \r\n else:\r\n for j in n[i:]:\r\n s.append(j)\r\n break\r\nif s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nctr = 0\r\nif s != s[::-1] :\r\n for x in s[::-1] :\r\n if x == '0' :\r\n ctr += 1\r\n else :\r\n break\r\n \r\n if ctr : sn = s[: -1 * ctr]\r\n else : sn = s\r\n \r\n if sn == sn[::-1] : print('YES')\r\n else : print('NO')\r\n \r\nelse :\r\n print('YES')", "class CodeforcesTask863ASolution:\n def __init__(self):\n self.result = ''\n self.number = 0\n\n def read_input(self):\n self.number = int(input())\n\n def process_task(self):\n last_zeros = 0\n for c in str(self.number)[::-1]:\n if c == \"0\":\n last_zeros += 1\n else:\n break\n palindrom_number = \"0\" * last_zeros + str(self.number)\n if palindrom_number == palindrom_number[::-1]:\n self.result = \"YES\"\n else:\n self.result = \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask863ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\n\r\ni = 0\r\nwhile True:\r\n if n%(10**i) == 0:\r\n i += 1\r\n continue\r\n else:\r\n break\r\nx = str(n)\r\nif i != 1:\r\n x = x[:-i+1]\r\ny = x[::-1]\r\nif y == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "st =(input().strip(\"0\"))\n\nif st==st[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "x=input()\r\nj=\"\"\r\ndef check(x):\r\n j=\"YES\"\r\n for i in range(len(x)//2):\r\n if x[i]!=x[(len(x)-1)-i]:\r\n j=\"NO\"\r\n return j\r\ncx=\"\"\r\nif check(x)==\"YES\":\r\n j=\"YES\"\r\nelse:\r\n j=\"NO\"\r\n for i in range(1,len(x)):\r\n cx=\"0\"*i\r\n cx=cx+x\r\n if check(cx)==\"YES\":\r\n j=\"YES\"\r\n break\r\nprint(j) \r\n\r\n", "\nn = input()\ni = len(n)-1\nwhile(n[i] == '0'):\n n = n[:len(n)-1]\n i -= 1\n \nif n == n[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from sys import exit\r\nn = input()\r\nfirst_idx, last_idx = 0, 0\r\ni = len(n) - 1\r\nwhile i > -1:\r\n if n[i] != '0':\r\n last_idx = i\r\n break\r\n i -= 1\r\nfor i in range(len(n)):\r\n if n[i] != '0':\r\n first_idx = i\r\n break\r\nprint('YES' if n[first_idx:last_idx + 1][::-1] == n[first_idx:last_idx + 1] else 'NO')", "n=input()\r\nif n==n[::-1]:print('YES')\r\nelse:\r\n\tif int(n)%10!=0:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\tfor x in range(len(n)-1,-1,-1):\r\n\t\t\tif n[x]!='0':\r\n\t\t\t\tp=x\r\n\t\t\t\tbreak\r\n\t\tk=n[:p+1]\r\n\t\tif k==k[::-1]:print('YES')\r\n\t\telse:print('NO')", "n = input()\nn= n.lstrip('0')\nn= n.rstrip('0')\nif(n==n[::-1]):\n\tprint(\"YES\")\nelse:\n\tprint('NO')\n\n \t \t \t \t \t \t \t\t \t\t\t \t \t", "num=int(input(\"\"))\r\nwhile num%10==0:\r\n num=num//10\r\nbad=False\r\nfor i in range(len(str(num))//2):\r\n if str(num)[i]!=str(num)[-(1+i)]:\r\n bad=True\r\n break\r\nyesNo=[\"YES\",\"NO\"]\r\nprint(yesNo[bad])\r\n", "#http://codeforces.com/problemset/problem/863/A\r\n\r\ndef quasi(string):\r\n if len(string)%2 == 0:\r\n front = string[:len(string)//2]\r\n back = \"\"\r\n temp = string[len(string)//2:]\r\n for i in range(len(temp)):\r\n back += temp[-1-i]\r\n return front == back\r\n else:\r\n front = string[:len(string)//2+1]\r\n back = \"\"\r\n temp = string[len(string)//2:]\r\n for i in range(len(temp)):\r\n back += temp[-1-i]\r\n return front == back\r\n\r\ndef check(string):\r\n adt = len(string)-1\r\n while adt >= 0:\r\n if quasi(string):\r\n return True\r\n string = \"0\"+string\r\n adt -= 1\r\n return False\r\n\r\nwhile True:\r\n try:\r\n case = input()\r\n if check(case):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n except EOFError:\r\n break\r\n", "\n\nA = list(input())\n\nwhile len(A) > 0 and A[-1] == '0':\n A.pop()\n\nB = list(reversed(A))\n\nprint(\"YES\" if A == B else \"NO\")\n", "x = input()\r\nx1 = x[::-1]\r\nt = str(int(x1))\r\nk = len(x) - len(t)\r\nt = '0'*k + x\r\nif t == t[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\nwhile string[-1] == '0': string = string[:len(string) - 1]\r\nif string == string[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input().strip(\"0\")\nres = \"YES\" if x == x[::-1] else \"NO\"\nprint(res)\n", "word = list(input())\n\ndef isPalindromic(s):\n length = len(s)\n\n for i in range(length):\n if s[i] != s[length - i - 1]:\n return False\n\n return True\n\nwhile word[0] == '0':\n word.pop(0)\n\nwhile word[-1] == '0':\n word.pop(-1)\n\nif isPalindromic(word):\n print('YES')\nelse:\n print('NO')\n \t \t\t\t\t\t\t \t\t \t \t\t \t \t \t\t", "s=input()\r\nc=0\r\nfor i in s[::-1]:\r\n\tif i==\"0\":\r\n\t\tc+=1\r\n\telse:\r\n\t\tbreak\r\ns=\"0\"*c+s\r\nif s==s[::-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "x = input()\r\nx = x[::-1]\r\nx1 = str(int(x))\r\nx2 = x1[::-1]\r\ncheck = [False] *(len(x1))\r\nfor i in range(len(x1)):\r\n if x1[i] == x2[i]:\r\n check[i] = True\r\nif check.count(False) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "num = input()\ncount_ends_zero = 0\nresult = \"NO\"\nfor i in num[::-1]:\n if i == \"0\":\n count_ends_zero += 1\n else:\n break\nfor i in range(count_ends_zero+1):\n if (\"0\"*i+num) == (\"0\"*i+num)[::-1]:\n result = \"YES\"\n break\nprint(result)\n", "def fun(a,b):\r\n if b==a:\r\n return 'YES'\r\n else :\r\n i=len(a)-1\r\n temp=a\r\n while temp[i]=='0':\r\n a='0'+a\r\n if a==a[::-1]:\r\n return 'YES'\r\n i=i-1\r\n return 'NO'\r\na=input()\r\nb=a[::-1]\r\nprint(fun(a,b))", "n=input()\ndef zcount(a):\n i=0\n for x in a:\n if x=='0':i+=1\n else:\n break\n return i\ndef palindrome(n):\n if n==n[::-1]:return 1\n else: return 0\nif palindrome(n) or palindrome('0'*(zcount(n[::-1])-zcount(n))+n):print('YES')\nelse:print('NO')\n", "x=int(input())\r\ns=str(x).rstrip('0')\r\nif str(x)==str(s[::-1]):\r\n print(\"YES\")\r\nelse:\r\n if s==s[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "x = input()\r\nm = []\r\nfor i in range(len(x)):\r\n m.append(x[i])\r\nm.reverse()\r\nx0 = 0\r\nfor i in range(len(m)):\r\n if m[i] == '0':\r\n m.append('0')\r\n x0 += 1\r\n else:\r\n break\r\nx = '0'*x0 + x\r\ncheck = [False]*len(m)\r\nfor i in range(len(m)):\r\n if x[i] == m[i]:\r\n check[i] = True\r\n else:\r\n check[i] = False\r\nif check.count(False) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "x = input()\nwhile(x[-1]=='0'):x=x[:-1]\nprint(('NO','YES')[x==x[::-1]])\n\t \t\t\t\t \t\t\t \t\t \t\t\t\t\t \t \t \t\t \t", "#complejidad O(n)\n\nn = input().strip('0') \n\nprint(['NO', 'YES'][n==n[::-1]])\n\t\t\t\t \t\t\t \t\t\t\t\t \t\t \t\t\t\t\t\t", "n=int(input())\r\nm=str(n)[::-1]\r\nif str(int(m))in str(n) or (str(int(n))) in m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input().rstrip(\"0\");print(\"YES\" if n==n[::-1] else \"NO\")", "a = input()\r\na = int(a[::-1])\r\nif str(a) == str(a)[::-1]: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n=input()\r\nn=n[::-1]\r\nn=int(n)\r\nn=str(n)\r\nif n==n[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "astring = input()\r\nfor i in reversed(astring):\r\n if i == \"0\":\r\n astring = astring[:-1]\r\n else:\r\n break\r\n\r\nans = \"YES\"\r\nfor i in range(len(astring)//2):\r\n if astring[i] != astring[- i -1]:\r\n ans = \"NO\"\r\n break\r\n \r\nprint(ans)", "listx = list(input())\n\nwhile (listx[-1] == '0'):\n\tlistx.pop()\n\t\nans = 'YES'\n\nfor i in range (len(listx) // 2):\n\tif (listx[i] != listx[-1-i]):\n\t\tans = 'NO'\n\t\t\nprint(ans)\n\t \t\t \t\t \t\t\t \t \t\t \t\t \t\t \t \t \t", "# Quasi-palindrome - CodeForces\r\n# Status: Unsolved\r\n\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef isPalindrome(s):\r\n i = 0\r\n l = len(s)\r\n # print(l)\r\n while i <= int(l / 2):\r\n # print(\"s:\", s[i], \"ss:\", s[l - 1 - i], i)\r\n if s[i] != s[l - i - 1]:\r\n return 0\r\n i += 1\r\n return 1\r\n\r\n\r\nx = \"\".join(reversed(input().replace('\\n', ''))).lstrip('0')\r\n\r\n# print(xx)\r\nprint(\"YES\" if isPalindrome(x) else \"NO\")\r\n", "def is_palindrome(s, left_index, right_index):\r\n if left_index >= right_index:\r\n return True\r\n if s[left_index] != s[right_index]:\r\n return False\r\n return is_palindrome(s, left_index + 1, right_index - 1)\r\n\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n s = input()\r\n end_point = None\r\n is_first_non_zero_found = False\r\n for i in range(len(s)):\r\n k = len(s) - 1 - i\r\n if not is_first_non_zero_found:\r\n if int(s[k]) == 0:\r\n if not end_point:\r\n end_point = -1\r\n else:\r\n end_point -= 1\r\n else:\r\n is_first_non_zero_found = True\r\n break\r\n s = s[:end_point]\r\n if is_palindrome(s, 0, len(s) - 1):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "a=list(input())\r\nfor x in range(1,len(a)+1):\r\n\tif a[-x]==\"0\":\r\n\t\ta.insert(0,\"0\")\r\n\telse:break\r\nb=a.copy()\r\na.reverse()\r\nprint([\"NO\",\"YES\"][a==b])", "def isPalindrome(string): \n return (string == string[::-1])\n\n\ndef solve(string):\n if isPalindrome(string): \n return \"YES\"\n\n \n n_of_suffix_zeros = 0\n\n i = -1\n while(string[i] == \"0\"): \n n_of_suffix_zeros += 1\n i -= 1\n \n newString = (\"0\" * n_of_suffix_zeros) + string\n\n return \"YES\" if isPalindrome(newString) else \"NO\"\n\n\n\nstring = input()\n\nprint(solve(string))\n\n\n\n \t\t \t\t \t \t\t\t\t\t \t \t \t\t\t", "s = input()\nwhile s[-1] == '0':\n\ts = s[:-1]\nprint(\"YES\" if s == s[::-1] else \"NO\")", "n = list (input())\n\nwhile (n[-1] == '0'):\n n.pop ()\n\nm = n[::-1]\n\nif (m == n):\n print (\"YES\")\nelse:\n print (\"NO\")\n \t\t\t\t\t \t \t\t \t\t\t\t\t \t \t", "# LUOGU_RID: 113737866\na=input()\r\nl=len(a)\r\nwhile a[l-1]=='0':\r\n l-=1\r\na=a[:l]\r\nif a==a[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "def checkPalindromic(n):\r\n while n%10==0:\r\n n//=10\r\n res,m=0,n\r\n while n!=0:\r\n res=res*10+n%10\r\n n//=10\r\n return res==m\r\nn=int(input())\r\nif checkPalindromic(n):\r\n print('YES')\r\nelse:\r\n print('NO')", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nx = input()\r\n\r\nfor i in range(10):\r\n y = '0'*i\r\n y = y+x\r\n ok = True\r\n for j in range(len(y)//2):\r\n if y[j] != y[len(y)-1-j]:\r\n ok = False\r\n break\r\n if ok:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n", "s = input()\r\ni, e, c = 0, len(s) - 1, 0\r\nwhile i < len(s) // 2:\r\n if s[i] == s[e]:\r\n c += 1\r\n i += 1\r\n e -= 1\r\nif c == len(s) // 2:\r\n ans = 'YES'\r\nelse:\r\n s1 = s[::-1]\r\n track, c1 = [], 0\r\n for i in range(len(s1)):\r\n if s1[i] != '0':\r\n track.append(s1[i])\r\n c1 += 1\r\n if s1[i] == '0' and c1 > 0:\r\n track.append(s1[i])\r\n w, q, c2 = 0, len(track) - 1, 0\r\n while w < len(track) // 2:\r\n if track[w] == track[q]:\r\n c2 += 1\r\n w += 1\r\n q -= 1\r\n if c2 == len(track) // 2:\r\n ans = 'YES'\r\n else:\r\n ans = 'NO'\r\nprint(ans)\r\n\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\n\r\nstring = input().strip()\r\nlength = len(string)\r\n\r\nj = length - 1\r\nwhile string[j] == \"0\":\r\n j-=1\r\n\r\nstring = string[:j+1]\r\nprint(\"YES\" if string == string[::-1] else \"NO\")", "n=input()\r\nl=len(n)\r\nwhile n[l-1]=='0':\r\n n=n[:l-1]\r\n l-=1\r\nprint([\"NO\", \"YES\"][n==n[::-1]])", "\r\nk=int(input(\"\"))\r\nwhile k%10==0:\r\n k=k/10\r\n\r\nnew=int(k)\r\ntemp=new\r\nrev=0\r\nwhile(new>0):\r\n dig=new%10\r\n rev=rev*10+dig\r\n new=new//10\r\nif (rev==temp):\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", "x=int(input())\r\nx=str(x)[::-1]\r\nx=int(x)\r\nx=str(x)\r\nif x==x[::-1]:print('Yes')\r\nelse:print('No')", "a = list(input())\r\nk = 0\r\nfor i in range(len(a)-1,-1,-1):\r\n if a[i] == \"0\": k += 1\r\n else: break\r\nb = a[0:len(a)-k]; d = []\r\nfor i in range(len(b)-1,-1,-1):\r\n d.append(b[i])\r\nfor i in range(len(b)):\r\n if b[i] != d[i]: print(\"NO\"); exit()\r\nprint(\"YES\")", "def numb(number):\r\n if number == number[::-1]:\r\n return 'YES'\r\n elif number[-1] == '0':\r\n for i in range(10):\r\n number = '0'+number\r\n if number == number[::-1]:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n else:\r\n return 'NO'\r\n \r\n \r\nif __name__ == '__main__':\r\n number = input()\r\n print(numb(number))", "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\nl=list(map(int,list(input()[:-1])))\r\nx,y=0,0\r\nfor i in l:\r\n if i==0:\r\n x+=1\r\n else:\r\n break\r\nfor i in l[::-1]:\r\n if i==0:\r\n y+=1\r\n else:\r\n break\r\nif x>y:\r\n print(\"NO\")\r\nelse:\r\n p=y-x\r\n l=[0]*p+l\r\n #print(l)\r\n n=len(l)\r\n i,j=0,n-1\r\n f=1\r\n while(i<j):\r\n if l[i]!=l[j]:\r\n f=0\r\n break\r\n i+=1\r\n j-=1\r\n if f:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "*s, = input()\r\nwhile s[-1] == '0':\r\n del s[-1]\r\nif s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = str(input())\r\nindex = len(num) - 1\r\nwhile index >= 0:\r\n if num[index] == '0':\r\n index -= 1\r\n else:\r\n break\r\noutput = \"YES\"\r\np1, p2 = 0, index\r\nwhile p1 < p2:\r\n if num[p1] == num[p2]:\r\n p1 += 1\r\n p2 -= 1\r\n else:\r\n output = \"NO\"\r\n break\r\nprint(output)\r\n", "s=input()\r\na=''\r\nif s==s[::-1]:\r\n print('YES')\r\nelse:\r\n for i in range(len(s)-1,-1,-1):\r\n if s[i]=='0':\r\n a+=s[i]\r\n else:\r\n break\r\n if a+s==(a+s)[::-1]:\r\n print('YES')\r\n else:\r\n print('NO')", "s = input()\r\nlst = [i for i in s]\r\ni = len(lst) - 1\r\nwhile (lst[i] == '0'):\r\n lst[i] = \"\"\r\n i -= 1\r\nans = \"\"\r\nfor i in lst:\r\n if i!=\"\":\r\n ans+=i\r\nif ans==ans[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t = input()\r\nfor i in range(len(t)-1, -1, -1):\r\n if t[i] != '0':\r\n break\r\nf = 0\r\nl = i\r\nOK = True\r\nwhile f < i:\r\n if t[f] != t[l]:\r\n OK = False\r\n break\r\n f += 1\r\n l -= 1\r\n\r\nif OK:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nwhile n[-1]=='0':\r\n n=n[0:-1]\r\nif n==n[::-1]:\r\n print(\"YES\")\r\nelse:print('NO')", "def is_palindrome(s):\r\n return s == s[::-1]\r\n\r\nnum = input()\r\n\r\nmax_len = 2 * len(num)\r\n\r\nans = False\r\n\r\nwhile len(num) <= max_len:\r\n if is_palindrome(num):\r\n ans = True\r\n break\r\n else:\r\n num = \"0\" + num\r\n\r\nprint(\"YES\" if ans else \"NO\")", "I = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\ns = input()\r\nprint('YES' if s.strip('0') == s.strip('0')[::-1] else 'NO')", "\r\nf = lambda l: 'YES' if l==l[::-1] else 'NO'\r\n\r\nn = input().strip('0')\r\n\r\nprint(f(n))", "s=input()\r\nlength=len(s)\r\nfor i in range (0,length):\r\n if(s[i]!='0'):\r\n a=i\r\n break\r\ni=length-1\r\nwhile(i>=0):\r\n if(s[i]!='0'):\r\n b=i\r\n break\r\n i-=1\r\nrequired=s[a:b+1]\r\nif(required==required[::-1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[int(q) for q in list(input())]\r\na=a[::-1]\r\nif a[0]==0 and len(a)==1:\r\n print('YES')\r\nelse:\r\n while(1):\r\n if a[0]==0:\r\n a.pop(0)\r\n else:\r\n break\r\n if a==a[::-1]:\r\n print('YES')\r\n else:\r\n print('NO')", "s = input()\r\ns = s.strip(\"0\")\r\n\r\n\r\n# print(s)\r\nif s == s[::-1]: print(\"YES\")\r\nelse: print(\"NO\")", "def is_palindrome(x):\r\n if x == x[::-1]: return True\r\n return False\r\n\r\nif is_palindrome(input().strip('0')):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=input()\r\n\r\nfor i in range(len(n)-1,-1,-1):\r\n if(n[i]=='0'):\r\n continue\r\n else:\r\n p=n[:i+1]\r\n if(p==p[::-1]):\r\n print(\"YES\")\r\n \r\n else:\r\n print(\"NO\")\r\n break", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1].strip('0')\r\nfor i in range(len(s)//2):\r\n if s[i] != s[len(s)-i-1]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "st = input()\r\nnum = int(st)\r\nnum = int(\"\".join(reversed(list(str(num)))))\r\nnum2 = int(\"\".join(reversed(list(str(num)))))\r\nif num == num2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\nch=str(x)\r\ntest=True\r\nfor i in (range((len(ch)//2))):\r\n if ch[i]!=ch[len(ch)-i-1]:\r\n test=False\r\n break\r\nif test==False:\r\n s=0\r\n for i in range(len(ch)):\r\n if ch[len(ch)-i-1]=='0':\r\n s+=1\r\n else:\r\n break\r\n if s!=0:\r\n test=True\r\n k=s*'0'+ch\r\n for i in (range((len(k)//2))):\r\n if k[i]!=k[len(k)-i-1]:\r\n test=False\r\n break\r\nif test==True:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n \r\n\r\n \r\n \r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n A = list(input())\r\n n = len(A)\r\n cnt = 0\r\n for i in range(n - 1, - 1, -1):\r\n if A[i] == '0':\r\n cnt += 1\r\n else:\r\n break\r\n A = ['0'] * cnt + A\r\n if A == A[::-1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input().strip('0')\r\nprint('YES' if list(a) == list(reversed(a)) else 'NO')", "n = input()\r\n\r\n\r\nwhile True:\r\n if n[0] == \"0\":\r\n n = n[1:]\r\n else:\r\n break\r\n\r\n\r\nwhile True:\r\n if n[len(n)-1] == \"0\":\r\n n = n[0:len(n)-1]\r\n else:\r\n break\r\n\r\n\r\nisPalindrome = True\r\n\r\nfor i in range(int(len(n)/2)):\r\n if n[i] != n[len(n)-i-1]:\r\n isPalindrome = False\r\n break\r\n\r\nprint(\"YES\" if isPalindrome else \"NO\")\r\n", "def main():\n\tnum = input()\n\tflag = False\n\trev = num[::-1]\n\tif num == rev:\n\t\tflag = True\n\telse:\n\t\tlength = len(num)\n\t\twhile num[length-1] == '0':\n\t\t\tlength = length-1\n\t\tnum = num[0:length]\n\t\trev = num[::-1]\n\t\tif num == rev:\n\t\t\tflag = True\n\t\n\tif flag == True:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nif __name__ == \"__main__\":\n\tmain()\t\t\t\t\t\n", "num = input().strip('0')\r\nprint('YES' if num[::-1] == num else 'NO')", "n=int(input())\r\nadd=0\r\nwhile n%10==0:\r\n n=n//10\r\nt=n\r\nwhile n!=0:\r\n add=add*10+n%10\r\n n=n//10\r\nif t==add:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-08 23:31:43\nLastEditTime: 2021-11-08 23:35:33\nDescription: Quasi-palindrome\nFilePath: CF863A.py\n'''\n\n\ndef func():\n num = input().strip()\n while num.endswith(\"0\"):\n num = num[:-1]\n\n print(\"YES\" if num == num[::-1] else \"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "x=list(input())\r\nfor i in range(len(x)-1,0,-1):\r\n if int(x[i])==0:x.pop(i)\r\n else:break\r\nprint(\"YES\" if x==x[::-1] else \"NO\")", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\na=list(input())\r\nwhile a[-1]=='0':\r\n\ta.pop()\r\nif a[::-1]==a :\r\n\tprint('Yes')\r\nelse:\r\n\tprint('No')\t\r\n", "x = input()\r\ny = x[::-1]\r\nyint = int(x[::-1])\r\nxint = int(str(yint)[::-1])\r\nif xint == yint:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x=int(input())\r\nwhile x%10==0:\r\n x=x//10\r\nx=str(x)\r\nn=len(x)\r\nf=True\r\nfor i in range(n//2):\r\n if x[i]!=x[n-i-1]:\r\n f=False\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[0]*10\r\nn=input()\r\nt=0\r\ns=len(n)-1\r\nwhile s>=0and n[s]=='0':t+=1;s-=1\r\nn='0'*t+n\r\nfor j in range(len(n)//2):\r\n if n[j]!=n[len(n)-1-j]:exit(print('NO'))\r\nprint('YES')\r\n\r\n\r\n", "s = input()\r\nc = 0\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == '0':\r\n c += 1\r\n else :\r\n break\r\nif s == s[::-1]:\r\n print('YES')\r\nelse :\r\n t = ''\r\n t += '0' * c\r\n t += s\r\n if t == t[::-1]:\r\n print('YES')\r\n else :\r\n print('NO')\r\n", "n = list(input())\r\nt = True\r\nwhile n[-1] == '0':\r\n del n[-1]\r\n\r\nfor i in range(len(n)//2):\r\n if n[i] != n[len(n)-1-i]:\r\n t = False\r\n break\r\nif t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = int(input())\r\n\r\nz_count = 0\r\n\r\nn = s\r\nwhile n % 10 == 0:\r\n n //= 10\r\n #z_count += 1\r\nif str(n) == str(n)[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s=input()\r\nt=s[::-1]\r\ncount=0\r\ncount1=0\r\nfor i in t:\r\n if(i=='0'):\r\n count+=1\r\n else:\r\n break\r\nfor j in s:\r\n if(j=='0'):\r\n count1+=1\r\n else:\r\n break \r\nif(t+max(count,count1)*('0')==max(count,count1)*('0')+s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n s = input().strip('0')\r\n print('YES' if s[::-1] == s else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=input()\r\ns=n[::-1]\r\na=int(s)\r\nb=str(a)\r\nc=b[::-1]\r\nif c==b:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "s=input().strip('0')\r\nprint(\"YES\" if s == s[::-1] else \"NO\")", "s = input()\r\nw = s[::-1]\r\nwhile w[0] == \"0\":\r\n w = w.replace(\"0\", \"\", 1)\r\nif w[::-1] == w:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input()[::-1])\r\nif str(n)==str(n)[::-1]:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\r\n", "number = int(input())\r\n\r\nwhile number % 10 == 0:\r\n number //= 10\r\n\r\nis_palendrom = True\r\nreversed_number = []\r\n\r\nwhile number != 0:\r\n reversed_number.append(number % 10)\r\n number //= 10\r\n\r\nfor i in range(len(reversed_number) // 2 + 1):\r\n if i > len(reversed_number) - 1 - i:\r\n break\r\n if reversed_number[i] != reversed_number[len(reversed_number) - 1 - i]:\r\n is_palendrom = False\r\n break\r\n\r\nif is_palendrom == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "t = input()\r\n\r\nif t[::-1] == t:\r\n print(\"YES\")\r\nelse:\r\n t_new = \"\"\r\n t_int = int(t)\r\n leading_zeros = 0\r\n while (t_int % 10 == 0):\r\n t_int /= 10\r\n leading_zeros += 1\r\n if (leading_zeros == 0):\r\n print(\"NO\")\r\n else:\r\n for i in range(leading_zeros):\r\n t_new += \"0\"\r\n t_new += t\r\n if t_new[::-1] == t_new:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\r\n\r\nans = \"NO\"\r\n\r\nif s == s[::-1]:\r\n ans = \"YES\"\r\nelse:\r\n for ch in s:\r\n if ch == \"0\":\r\n s = s.replace(\"0\",\"\",1)\r\n else:\r\n break\r\n\r\n\r\nif ans == \"NO\":\r\n s = s[::-1]\r\n for ch in s:\r\n if ch == \"0\":\r\n s = s.replace(\"0\",\"\",1)\r\n else:\r\n break\r\n\r\nprint(\"YES\") if s == s[::-1] else print(\"NO\")", "number = int(input())\n\nwhile number % 10 == 0:\n\tnumber = number // 10\n\nbits = []\nwhile number > 0:\n\tbits.append(number % 10)\n\tnumber = number // 10\n\nis_palindrom = True\nbits_length = len(bits)\nfor i in range(int(bits_length / 2)):\n\tif bits[i] != bits[bits_length - 1 - i]:\n\t\tis_palindrom = False\n\t\tbreak\nprint(\"YES\" if is_palindrom else \"NO\")\n", "def isQuasiPalindrome(x):\r\n while x % 10 == 0:\r\n x //= 10\r\n s = str(x)\r\n return s == s[::-1]\r\nx = int(input())\r\nprint('YES' if isQuasiPalindrome(x) else 'NO')\r\n", "num = input()\r\nif num[::-1] == num:\r\n print(\"YES\")\r\nelse:\r\n num = num[::-1]\r\n for i in range(len(num)):\r\n if num[i] != \"0\":\r\n new_num = (\"0\" * i) + num[::-1]\r\n break\r\n if new_num != new_num[::-1]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "s= input()\r\ni = len(s)-1\r\nwhile s[i]=='0':i-=1\r\ni+=1\r\np=s[0:i] \r\nprint( \"YES\" if p == p[::-1] else \"NO\")", "s = input()\r\nwhile len(s) > 1 and s[0] == '0': s = s[1:len(s)]\r\nwhile len(s) > 1 and s[-1] == '0': s = s[0:len(s) - 1]\r\nprint(\"YES\") if s == s[::-1] else print(\"NO\")", "n = input()\r\n\r\ncheck1 = True\r\ncheck2 = True\r\n\r\n\r\nl = len(n)-1\r\ncount1, count2 = 0, 0\r\n\r\nfor _ in range(len(n)):\r\n if int(n[_]) == 0 and check1:\r\n count1 += 1\r\n else:\r\n check1 = False\r\n\r\n if int(n[l]) == 0 and check2:\r\n count2 += 1\r\n else:\r\n check2 = False\r\n\r\n l -= 1\r\n\r\n\r\ncount = abs(count1 - count2)\r\n\r\ns = str(n)\r\nst = ''\r\n\r\nif count1 > count2:\r\n for _ in range(count):\r\n s += '0'\r\nelse:\r\n for _ in range(count):\r\n st += '0'\r\n s = st + s\r\n\r\nif str(s) == str(s)[::-1]: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = input().rstrip().rstrip('0')\r\n\r\nprint(\"YES\" if data == data[::-1] else \"NO\")", "X = input()\r\nwhile X[-1] == '0':\r\n X = X[0:-1]\r\nif X == X[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = str(input())\r\ns = s[::-1]\r\ns = str(int(s))\r\nn = len(s)\r\nflag = True\r\nfor i in range(n):\r\n if s[i] != s[n-1-i]:\r\n flag = False\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nwhile s[len(s)-1]=='0':\r\n s=s[:len(s)-1:]\r\nif s==s[::-1]:print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nif s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n a = len(s) - 1\r\n m = 0\r\n while s[a] == '0':\r\n m += 1\r\n a -= 1\r\n s = '0' * m + s\r\n if s == s[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = input()\r\nif n.strip('0') == n.strip('0')[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "l=input().strip('0')\r\nprint('YES'if l[::-1]==l else'NO')", "#from unit_test import unit_test\n\ndef main(var):\n while var and var[-1] == '0':\n var = var[:-1]\n\n x = var[:int(len(var)/2)]\n y = var[int(len(var)/2):]\n \n if len(x) != len(y):\n y = y[1:]\n \n x = list(x)\n y = list(reversed(y))\n\n\n # print(x,y)\n\n if x == y:\n return 'YES'\n else:\n return 'NO'\n \n\nif __name__ == '__main__':\n var = input()\n print(main(var))\n\n #var = [('131',),('320',),('2010200',),('1331',)]\n #answ = ['YES','NO','YES','YES']\n\n #unit_test(main,var,answ)\n", "n = int(input())\r\nwhile n%10 == 0:\r\n n /= 10\r\n n = int(n)\r\nprint(\"YES\" if str(n)[::-1] == str(n) else \"NO\")", "s=input().strip()\r\nl=[x for x in s]\r\nwhile len(s)>0 and l[-1]=='0':l.pop()\r\nif l==l[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=str(n)\r\ntt=s[::-1]\r\ni=0\r\nwhile i<len(tt):\r\n\tif tt[i]=='0':\r\n\t\ti+=1\r\n\telse:\r\n\t\tbreak\r\ns=(\"0\"*i)+s \r\nx=s[::-1]\r\n# print(s)\r\nif x==s:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import re\r\nsf = re.sub(r'0*$', r'', input())\r\nprint('YNEOS'[int(sf!=sf[::-1])::2])", "S = input()\r\nif (S == S[::-1]):\r\n print('YES')\r\nelse:\r\n N = len(S)\r\n i, j = 0, N-1\r\n while (i<N and S[i]=='0'):\r\n i += 1\r\n while (0<=j and S[j]=='0'):\r\n j -= 1\r\n #print(S[i:j+1])\r\n print(['NO','YES'][S[i:j+1] == S[i:j+1][::-1]])", "n=input()\r\nc=int(len(n)/2)\r\nz=0\r\nx=\"0\"\r\nfor i in range(0,c):\r\n if n[i]==n[len(n)-1-i]:\r\n continue\r\n else:\r\n z=1\r\n break\r\nif z==0:\r\n print(\"YES\")\r\nelse:\r\n t=0\r\n for i in range(0,len(n)):\r\n if n[len(n)-1-i]==\"0\":\r\n t+=1\r\n else:\r\n break\r\n for j in range(0,t-1):\r\n x=x+\"0\"\r\n x=x+n\r\n y=0\r\n w=int(len(x)/2)\r\n for j in range(0,w):\r\n if x[j]==x[len(x)-1-j]:\r\n continue\r\n else:\r\n y=1\r\n break\r\n if y==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n", "def f(string):\r\n if string == string[::-1]:\r\n return True\r\n return False\r\n\r\nnumber = input()\r\nright_zeros = len(number) - len(number.rstrip('0'))\r\nleft_zeros = len(number) - len(number.lstrip('0'))\r\nif left_zeros > right_zeros:\r\n print('NO')\r\nelse:\r\n if f(number.strip('0')):\r\n print('YES')\r\n else:\r\n print('NO')", "s = input()\r\nfor i in range(len(s)):\r\n if s[-1] == '0':\r\n s = s[0:-1]\r\n else:\r\n break\r\nif s == s[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = list(input())\r\ncount = 0\r\nfor i in range(len(s)-1,-1,-1):\r\n\tif s[i]==\"0\":\r\n\t\tcount += 1\r\n\telse:\r\n\t\tbreak\r\nfor k in range(count):\r\n\ts.pop()\r\nif s==s[::-1]:\r\n\tprint(\"YES\")\r\nelse:print(\"NO\")\t\t\t\t\t", "s=input()\r\nif s==s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n news=\"\"\r\n c=0\r\n start=0\r\n end=len(s)\r\n for i in range(len(s)):\r\n if s[i]!=\"0\":\r\n start=i\r\n break\r\n for i in range(len(s)-1,-1,-1):\r\n if s[i]!=\"0\":\r\n end=i+1\r\n break\r\n news=s[start:end]\r\n if news==news[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = input()\r\nrn = ''.join([list(n)[len(n) - 1 - i] for i in range(len(n))])\r\nif n.rstrip('0') == n:\r\n if n == rn:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if n.rstrip('0') == rn.lstrip('0'):\r\n print('YES')\r\n else:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = list(input().rstrip())\r\nx.reverse()\r\nans = \"NO\"\r\nfor _ in range(15):\r\n ok = 1\r\n for i in range(len(x)):\r\n if not x[i] == x[-(i + 1)]:\r\n ok = 0\r\n break\r\n if ok:\r\n ans = \"YES\"\r\n break\r\n x.append(\"0\")\r\nprint(ans)", "N = input()[::-1]\r\n\r\nwhile len(N) <= 20:\r\n if N == N[::-1]:\r\n print(\"YES\")\r\n break\r\n N += \"0\"\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\n\ndef check(str):\n tmp = str[::-1]\n return tmp == str\n \ndef solve():\n s = input()\n s += \"0\" # 哨兵\n\n while s[len(s) - 1] == '0':\n t = s[:-1]\n if check(t):\n print(\"YES\")\n return\n else: s = t\n print(\"NO\")\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t \t \t\t \t\t \t \t\t\t\t\t\t\t\t\t\t \t\t \t", "n=str(input())\r\nd=n[::-1]\r\nf=0\r\nfor i in range(0,len(d)):\r\n if(d[i]!='0'):\r\n f=i\r\n break\r\nn=n[0:(len(n)-f)]\r\ng=list((n))\r\nif(g==g[::-1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\ni=len(a)-1\r\nwhile(a[i]=='0'):i-=1\r\na=a[:i+1]\r\nif a==a[::-1]:print(\"YES\")\r\nelse: print(\"NO\")", "n = input()\r\nl = []\r\nfor char in n:\r\n l.append(char)\r\np = 0\r\nfor i in range(len(l)-1,-1,-1):\r\n if l[i] == '0':\r\n p += 1\r\n else:\r\n break\r\nn = '0'*p + n\r\n#print(n)\r\nj = n[::-1]\r\nif n==j:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "st= input()\r\nst=st.strip('0')\r\n\r\nif st==st[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = list(input())\r\nl = 0\r\nfor i in range(len(s)-1,-1,-1):\r\n if(s[i]=='0'):\r\n l+=1\r\n else:\r\n break\r\nfor i in range(l):\r\n s.insert(0,'0')\r\nl = []\r\nfor i in range(len(s)-1,-1,-1):\r\n l.append(s[i])\r\nif(l==s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\n\r\nwhile(n%10==0):\r\n\tn=n//10\r\np=n\r\nsum=0\r\nwhile(n>0):\r\n\tr=n%10\r\n\tsum=sum*10+r\r\n\tn=n//10\r\nif(sum==p):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "n = input().strip()\r\nwhile len(n) > 1 and n[-1] == '0':\r\n n = n[:-1]\r\nprint(\"YES\" if n == n[::-1] else \"NO\")", "n=input()\r\ns=n[::-1]\r\nq=int(s)\r\nif s==n:\r\n print(\"YES\")\r\nelse:\r\n #print(q)\r\n #print(int(str(q)[::-1]))\r\n if q==int(str(q)[::-1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "def is_palindrome(string):\r\n lenn = len(string)\r\n bound = int(lenn/2)\r\n for i in range(int(lenn/2)):\r\n if string[i] != string[lenn-i-1]:\r\n return False\r\n\r\n return True\r\n\r\n\r\ns = input()\r\ncan = is_palindrome(s)\r\nif not can:\r\n n = len(s)\r\n string_list = []\r\n for i in range(n):\r\n string_list.append(s[i])\r\n\r\n while string_list[n-1] == '0':\r\n string_list.pop()\r\n n = len(string_list)\r\n can = is_palindrome(string_list)\r\n\r\nif can: print(\"YES\")\r\nelse: print(\"NO\")", "s = input()\r\nif s == s[::-1]:\r\n print('YES')\r\n exit(0)\r\nif s[len(s)-1] == '0':\r\n c = 0\r\n for i in range(len(s)-1, 0, -1):\r\n if s[i] == '0':\r\n c += 1\r\n else:\r\n break\r\n a = list(s)\r\n for i in range(c):\r\n a.pop()\r\n d = ''\r\n for i in range(len(a)):\r\n d += a[i]\r\n if d == d[::-1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = input()\r\nwhile s != s[::-1]:\r\n s = '0' + s\r\n if len(s) > 40: break\r\nprint('YNEOS'[len(s) > 40::2])\r\n", "cv=int(input())\r\nwhile cv%10==0:\r\n cv=cv//10\r\ncv=str(cv)\r\nz=cv[::-1]\r\nif cv==z:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "s = input().strip('0')\r\nprint(\"YES\") if s == s[::-1] else print(\"NO\")", "a=input()\r\na=a[::-1]\r\na=int(a)\r\na=str(a)\r\nif a==a[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn=list(input())\r\nwhile n[-1]==\"0\":\r\n\tn.pop()\r\nif n==n[::-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=list(input())\r\n\r\np=n[::-1]\r\ns=0\r\nfor j in range(len(p)):\r\n if p[j]=='0':\r\n s+=1\r\n else:\r\n break\r\nfor k in range(s):\r\n p.append('0')\r\n\r\n\r\nif len(p)%2==0:\r\n if p[:len(p)//2]==p[(len(p)//2):][::-1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif len(p)%2!=0:\r\n if p[:len(p)//2]==p[(len(p)//2)+1:][::-1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n \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\ns = list(input())\r\nwhile len(s) > 0 and s[-1] == '0': s.pop()\r\nfor i in range(len(s)):\r\n if s[i] != s[-1-i]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "x = input()\r\n\r\nfor i in range(len(x)):\r\n a = \"0\" * i + x\r\n if a == a[::-1]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "s=input()\r\nif s[-1]==\"0\":\r\n i=-1\r\n while s[i]==\"0\":\r\n i-=1\r\n s=s[0:i+1]\r\nfl=True\r\nfor j in range(len(s)//2):\r\n if s[j]!=s[-j-1]:\r\n fl=False\r\nif fl:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n", "x=input().strip('0')\r\ny=x[::-1]\r\nif y==x:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = int(input())\r\ny = int(str(x)[::-1])\r\nprint('YES' if (str(x) == str(x)[::-1] or str(y) == str(y)[::-1]) else 'NO')\r\n", "x=input()\n_=len(x)-1\n__=0\nwhile(True):\n if x[_]=='0':\n __+=1\n else:\n break\n _-=1\n___=__*'0'+x\nprint(\"YES\" if ___==___[::-1] else \"NO\")\n\n#to kelas compiler time 10:51 \n", "str = input()\r\n\r\n# Remove trailing zero's\r\nfor char in reversed(str):\r\n if char == '0':\r\n str = str[:-1]\r\n else:\r\n break\r\n\r\nif str == str[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\np = False\r\nk = \"\"\r\no = 0\r\nfor i in range(len(n)-1,-1,-1):\r\n if n[i]!='0':\r\n \r\n o = i\r\n break\r\nfor i in range(o+1):\r\n k+=n[i]\r\nq=\"\"\r\nfor i in range(o,-1,-1):\r\n q+=n[i]\r\nif (k==q):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# LUOGU_RID: 101678631\ns = input().rstrip('0')\nprint(s == s[::-1] and 'YES' or 'NO')", "s = input(); trg = True\r\n\r\nwhile len(s) < 20:\r\n if s != s[::-1]:\r\n s = '0' + s\r\n else:\r\n trg = False\r\n break\r\n\r\nprint('YNEOS'[trg::2])\r\n", "s=input()\r\ns=list(s)\r\nwhile s[-1]=='0':\r\n s.pop()\r\nd=s[::-1]\r\nprint(\"YES\" if d==s else \"NO\")", "n = input()\r\nn = n.strip(\"0 \")\r\nprint(\"YES\" if list(reversed(n)) == list(n) else \"NO\")", "# https://codeforces.com/problemset/problem/863/A?csrf_token=fe59cf9cf23d3c29fa2e21f238f5f9b2\n# 900\n\nn = str(int(input()[::-1]))\nif (n == n[::-1]):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = list(input())\r\ndef palindrome(s):\r\n p = True\r\n for i in range(len(s) //2):\r\n if s[i] != s[-i-1]:\r\n p = False\r\n\r\n return p\r\n\r\nwhile True:\r\n if n[-1] == '0':\r\n n.pop()\r\n else:\r\n break\r\n\r\nif palindrome(n) == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\ns = input()\r\nn = len(s)\r\nk = 0\r\ni = n-1\r\nwhile s[i]=='0':\r\n i -= 1\r\n k += 1\r\ns = '0'*k+s\r\ns_p = ''.join(reversed(list(s)))\r\nif s==s_p: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n = int(input())\n\nif str(n) == str(n)[::-1]:\n print(\"YES\")\nelse:\n number_of_0 = len(str(n)) - len(str(int(str(n)[::-1])))\n new_number = number_of_0 * '0' + str(n)\n if new_number == new_number[::-1]:\n print('YES')\n else:\n print('NO')", "s = input()\r\n\r\nfor i in range(100):\r\n if s == s[::-1]:\r\n break\r\n s = '0' + s\r\nif s == s[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = a\r\nfor i in range(len(a)+1):\r\n if a == a[::-1]:\r\n print('YES')\r\n break\r\n if i == len(b):\r\n print('NO')\r\n a = '0' + a", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------03.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nx=int(input())\r\nwhile x%10==0:x//=10\r\nx=str(x)\r\nif x==x[::-1]:print(\"YES\")\r\nelse:\r\n print(\"NO\")", "number = input()[::-1]\r\n\r\nwhile number[0] == '0':\r\n number = number[1:]\r\n\r\nprint(('NO', 'YES')[number == number[::-1]])", "n=input()\r\nfor j in n[::-1]:\r\n\tif(j==\"0\"):\r\n\t\tn=n[:-1]\r\n\telse:\r\n\t\tbreak\r\nx=n[::-1]\r\nif(int(x)==int(n)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = input()\r\nif n[::-1] == n:\r\n print(\"YES\")\r\nelse:\r\n for i in range (len(n)-1,-1,-1):\r\n x = 0\r\n if n[i] != '0':\r\n string = n[:i+1]\r\n if string[::-1] == string:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n", "x = input().strip('0')\r\nif x==x[::-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=input()\r\nwhile n[-1]=='0':\r\n n=str(int(n)//10)\r\nif n==n[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = int(input())\r\ny = str(x)\r\n\r\nresult = \"\".join(reversed(y))\r\n\r\nu = result.strip(\"0\")\r\ni = y.strip(\"0\")\r\n\r\n\r\nif i == u:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nwhile n % 10 == 0:\r\n n //= 10\r\ntemp = n\r\ndn = 0\r\nwhile temp > 0:\r\n dn = dn * 10 + temp % 10\r\n temp //= 10\r\nif dn == n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\ns = s.strip('0')\nprint('YES' if int(s) == int(s[::-1]) else 'NO')", "string=int(input())\ndef rev_string(string):\n reve_string=''\n for i in range(0,len(string)):\n reve_string = string[i]+reve_string\n return reve_string\n\ndef palin_check(str):\n if str == rev_string(str):\n return True\n else:\n False\n\nwhile string%10==0:\n string= int(string/10)\nstring_1 = str(string)\nif palin_check(string_1)==True:\n print('YES')\nelse:\n print('NO')\n", "x = int(input())\r\ncount = 1\r\nif str(x) == \"\".join(reversed(str(x))):\r\n print(\"YES\")\r\nelse:\r\n new = \"\".join(reversed(str(x)))\r\n if new[0] == \"0\":\r\n for i in range(len(str(new))-1):\r\n if new[i] == new[i+1] == \"0\":\r\n count += 1\r\n if (\"0\"*count + str(x)) == \"\".join(reversed(\"0\"*count + str(x))):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n ", "s=input()\r\nd=0\r\nfor i in range(0,len(s)):\r\n if(s[len(s)-i-1]=='0'):\r\n d=d+1\r\n else:\r\n break;\r\nt=s[0:len(s)-d]\r\nif(t==t[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def is_palindrome(string):\r\n length = len(string)\r\n if length == 1:\r\n return True\r\n else:\r\n for i in range(length // 2):\r\n if string[i] != string[length - 1 - i]:\r\n return False\r\n return True\r\ndef remove_outer_zeros(number):\r\n count_front = count_back = i = 0\r\n while number[i] == '0' and i < len(number):\r\n count_front += 1\r\n i += 1\r\n i = len(number) - 1\r\n while number[i] == '0' and i >= 0:\r\n count_back += 1\r\n i -= 1\r\n return number[count_front:i + 1]\r\n\r\nnumber = input()\r\nif is_palindrome(remove_outer_zeros(number)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# # def f(n, t):\n# # q = []\n# # f = []\n# # for _ in range(t):\n# # q += [i for i in input().split()]\n# # s = input().split()\n# # for i in range(n):\n# # rr = q.index(s[i])\n# # if (len(q[rr]) <= len(q[rr+1])):\n# # f.append(q[rr])\n# # else: f.append(q[rr+1])\n# # print(*f, sep=\" \")\n\n\n# # n, t = map(int, input().split())\n# # f(n, t)\n# s = \"Четыре чёрненьких чумазеньких чертёнка чертили чёрными чернилами чертёж чрезвычайно чисто.\"\n# q = {i: round(s.count(i) / 90, 3) for i in s}\n# e = []\n# for i in q:\n# e.append([i, q[i]])\n# e.sort(key=lambda x: x[1], reverse=1)\n\n# q = {i[0]: \"\" for i in e}\n\n# while (len(e) != 1):\n# a = e.pop()\n# b = e.pop()\n# e.append(a[1] + b[1])\n# e.sort()\n\n# print(a, b)\n\n# # from math import sin, cos, pi\n\n# # def f(x):\n# # return (sin(x**2 - 4*x + 4) + (2*x - 4)*cos(x**2 - 4*x + 4))\n\n# # def s(x0, x1):\n# # return x0 - 2.5*f(x1) + 0.5*abs(x0 - x1)\n# # # print(f(11*pi/9))\n# # print(s(0, 4*pi/3))\n\n# n = int(input())\n# def f(a, b, n, S):\n# er = a*n + b\n# if (er == S): return \"YES\"\n# return 'NO'\n\n\n# for i in range(n):\n# a, b, n, S = map(int, [i for i in input().split()])\n# print(f(a, b, n, S))\n\ns = input()\ni, j = 0, len(s) - 1\nwhile (s[i] == \"0\"):\n i += 1\n s = s[i:]\nwhile (s[j] == \"0\"):\n j -= 1\n s = s[:j+1]\nprint('YES' if s == s[::-1] else \"NO\")", "def main():\r\n n = input()\r\n for i in range(11):\r\n v = '0'*i+n\r\n if ''.join(reversed(v))==v:\r\n print('YES')\r\n return\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\nnumber = input()\ndigits = []\ncount = 0\nanswer = \"YES\"\n\nfor num in number:\n if(int(num) == 0):\n count = count +1\n else:\n count = 0\n\nfor num in number:\n digits.append(int(num))\n\nsize = int((len(digits) - count)/2)\nfor i in range(size):\n if(number[i] != number[int((len(digits) - count)) - i - 1]):\n answer = \"NO\"\n \nprint(answer)\n\n\t \t \t\t \t \t \t \t\t \t \t\t", "def ispal(n):\r\n n = str(n)\r\n revn = \"\"\r\n for i in range(len(n)-1,-1,-1):\r\n revn += n[i]\r\n if revn == n:\r\n return True\r\n else:\r\n return False\r\nx = str(input())\r\nif ispal(x.strip(\"0\")) == True or ispal(x)== True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\npalindrome = lambda x : x == x[::-1]\r\n\r\nbase = \"\"\r\ncnt = 1\r\n\r\nwhile cnt < 20 :\r\n cnt += 1\r\n temp = base + s\r\n base += \"0\"\r\n if palindrome(temp) :\r\n print(\"YES\")\r\n quit()\r\n\r\nprint(\"NO\")\r\n\r\n", "x=input()\r\nwhile x[-1]=='0':\r\n x=x[0:-1]\r\nif x ==x [::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nstr_n = n\r\nfor i in n[::-1]:\r\n if i == '0':\r\n str_n = '0' + str_n\r\n else:\r\n break\r\n\r\nif str_n == str_n[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "c = input()\n\n\ndef ispalindrome(p):\n return p == p[::-1]\n\nif ispalindrome(c):\n print(\"YES\")\nelif c[-1] == '0':\n k = len(c) - len(c.rstrip(\"0\"))\n if ispalindrome(k * \"0\" + c):\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n", "def solve(n):\n n = str(n)\n while n and n[-1] == '0':\n n = n[:-1]\n \n for i in range(len(n)//2):\n if n[i] != n[len(n)-i-1]:\n return \"NO\"\n return \"YES\"\n\n\ndef main():\n n = int(input())\n print(solve(n))\n\n\nmain()\n", "x = input().strip()\r\nif x.strip('0') == x.strip('0')[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "t = input()\r\nif(t == t[::-1]) :\r\n\tprint('YES')\r\nelse :\r\n\tt = t[::-1]\r\n\ti = 0\r\n\tm = len(t)\r\n\tcount = 0\r\n\tstr = ''\r\n\twhile i < m :\r\n\t\tif(t[i] == '0') : \r\n\t\t\tcount += 1\r\n\t\telif (int(t[i]) > 0): \r\n\t\t\tbreak\r\n\t\ti += 1\r\n\r\n\tfor k in list(range(0,count)) :\r\n\t\tstr = '0' + str\r\n\r\n\tstr = str + t[::-1]\r\n\t\r\n\tif(str == str[::-1]) :\r\n\t\tprint('YES')\r\n\telse :\r\n\t\tprint('NO')", "# n(1)\n\nnum = input().strip('0')\nprint(['NO', 'YES'][num==num[::-1]])\n \t\t \t\t\t \t\t\t \t\t \t \t\t\t\t\t", "a = input()\r\npalin = False\r\nfor _ in range(10):\r\n if a == a[::-1]:\r\n palin = True\r\n a = \"0\"+a\r\nprint(\"YES\") if palin else print(\"NO\")", "n=list(input())\r\nwhile n[-1]==\"0\":\r\n\tn.pop()\r\nif n[::-1]==n:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def main():\n n = input()\n n = n.strip(\"0\")\n if n == n[::-1]:\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n main()\n\t\t\t \t\t \t\t \t \t\t \t\t \t", "k = input()\r\nlenk = len(k)\r\nstart = -1\r\nif(lenk==1):\r\n print(\"YES\")\r\nelse:\r\n for i in range(1,lenk+1):\r\n #print(\"i = \"+str(i)+\"/\"+str(lenk-i))\r\n #print(str(k[0])+\" \"+str(k[lenk-i]))\r\n if(k[0]==k[lenk-i]):\r\n start = lenk-i\r\n #print(\"HAYY\")\r\n break\r\n elif(int(k[lenk-i])!=0):\r\n #print(k[lenk-i])\r\n #print(\"YOO\")\r\n break\r\n if(start==-1):\r\n print(\"NO\")\r\n else:\r\n #print(\"start=\"+str(start))\r\n for i in range(0,start):\r\n if(i<start-i):\r\n if(k[i]!=k[start-i]):\r\n #print(str(k[i])+\" \"+str(k[start-i+1]))\r\n start = -1\r\n print(\"NO\")\r\n break\r\n else: break\r\n if(start!=-1): print(\"YES\")", "import sys\r\n\r\nn = input()\r\nno = cnt1 = cnt2 = 0\r\nfirst = -1\r\nlast = len(n)\r\nfor i in range(len(n)):\r\n if n[i] != '0':\r\n break\r\n else:\r\n cnt1 += 1\r\n first = i\r\nfor i in range(len(n)-1,-1,-1):\r\n if n[i] != '0':\r\n break\r\n else:\r\n cnt2 += 1\r\n last = i\r\n\r\ns = n[first+1:last]\r\n#print('s',s)\r\nfor i in range(len(s)//2):\r\n if s[i] != s[len(s)-1-i]:\r\n no = 1\r\n break\r\nif no == 1 or cnt1 > cnt2:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n = int(input())\r\nwhile n % 10 == 0:\r\n n //= 10\r\nn = str(n)\r\nprint(n == n[::-1] and 'YES' or 'NO')\r\n", "s = input()\ns= s.strip(\"0\")\nif s == s[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t\t\t \t\t \t\t \t\t", "inp = input()\r\ninp = inp.strip('0')\r\nif inp == inp[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import sys\r\nx = input()\r\nfor i in range(len(x)-1,-1,-1):\r\n if x[i] != '0':\r\n new = (i+1)\r\n for j in range(new//2):\r\n if(x[j] != x[new-j-1]):\r\n print(\"NO\")\r\n sys.exit(0)\r\n break\r\nprint(\"YES\")", "def is_palindrome(s):\r\n l, r = 0, len(s) - 1\r\n while l < r:\r\n if s[l] != s[r]:\r\n return False\r\n l += 1\r\n r -= 1\r\n return True\r\n\r\ns = input()\r\nr = len(s) - 1\r\nwhile s[r] == '0':\r\n r -= 1\r\nif is_palindrome(s[:r+1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "def rev(line):\n l=line[::-1]\n return l\n\ndef numGenerator(line):\n rev_f=rev(line)\n pos=0\n for i in rev_f:\n if i == \"0\":\n pos+=1\n else:\n break\n rev_f=rev_f[pos:]\n pos=0\n for i in range (1,len(rev_f)):\n if rev_f[-i] == \"0\":\n pos+=1\n else:\n break\n rev_f=rev_f[:len(rev_f)-pos]\n return rev_f\ndef numInitiator(line):\n pos=0\n for i in line:\n if i == \"0\":\n pos+=1\n else:\n break\n line=line[pos:]\n pos=0\n for i in range (1,len(line)):\n if line[-i] == \"0\":\n pos+=1\n else:\n break\n line=line[:len(line)-pos]\n return line\n \n\ndef palindrome(line):\n rev=numGenerator(line)\n line=numInitiator(line)\n if rev == line:\n print(\"YES\")\n else:\n print(\"NO\")\ndef main():\n line=input()\n palindrome(line)\n\nmain()\n", "#██████████ █ █ /█\\ █ █ ███ /█\\ ██████████████\r\n\"█ █ █ /███\\ █ █ █ ██ /███\\ /██/ \"\r\n#█ █ █ /█████\\ █ █ █ ██ /█████\\ /██/ \r\n\"█ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n#██████████ █████████ █(:| █ ████████ ████ █ █ /██/ \"\r\n\" █ █ █ █!:) █ █ █ █ ██ █ █ /██/ \"\r\n# █ █ █ ███████ █ █ █ ██ ███████ /██/\r\n\" █ █ █ █ █ █ █ █ ██ █ █ ██/ \"\r\n#██████████ █ █ █ █ █ █ ███ █ █ ██████████████\r\nn=input()\r\nop=n[::-1]\r\nif n==n[::-1]:\r\n print('YES')\r\nelse:\r\n cons_0=0\r\n for i in range(len(n)):\r\n if op[i]=='0':\r\n cons_0+=1\r\n else:\r\n break\r\n n=('0'*cons_0)+n \r\n #print(n)\r\n if n==n[::-1]:\r\n print('YES')\r\n else:\r\n print('NO')", "n = input()\n\nnum = n.strip(\"0\")\nif num[::-1] == num:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x=int(input())\r\ns=str(x)\r\np=s[::-1]\r\np=int(p)\r\nq=str(p)\r\nk=str(p)\r\nk=k[::-1]\r\nif k==q:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n=str(input())\r\nn=n.strip('0')\r\nx=len(n)\r\np=x//2\r\ncount=0\r\nfor i in range (p):\r\n if(n[i]==n[x-i-1]):\r\n count=count+1\r\nif(count==p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nwhile (n%10 == 0):\r\n\tn /= 10\r\nx = str(int(n))\r\nans = True\r\n# print(x)\r\nfor i in range(len(x)//2):\r\n\tif (x[i] != x[len(x)-i-1]):\r\n\t\tans = False\r\nif (ans):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a=input()\r\nn=len(a)\r\nc=n-len(a.rstrip('0'))\r\na='0'*c+a\r\nprint('YNEOS'[a!=a[::-1]::2])", "#Complejidad =O(x)\nx = input()\n\nwhile x and x[-1] == '0':\n x = x[:-1]\n\nif x == x[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t\t \t \t\t\t \t\t\t \t \t \t", "x = input()\r\nn = len(x)\r\nans1 = 0;ans2 = 0\r\nfor i in range(n):\r\n if(x[i] != '0'):\r\n ans1 = i\r\n break \r\nx = x[::-1]\r\nfor i in range(n):\r\n if(x[i] != '0'):\r\n ans2 = i\r\n break\r\nx = x[::-1]\r\nif(ans1<ans2):\r\n x = \"0\"*(ans2-ans1)+x\r\nelse:\r\n x = x+ \"0\"*(ans1-ans2)\r\nif(x==x[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\n\nwhile n[-1] == '0':\n n = n[:-1]\n\nprint('YES' if n == n[::-1] else 'NO')\n \t \t \t\t \t \t \t \t \t \t\t \t", "n=int(input())\nwhile n%10==0:n//=10\nn=str(n)\nprint(\"YES\" if(n==n[::-1]) else \"NO\")\n", "# Hello World program in Python\r\n \r\nnum =int(input())\r\nwhile num%10 == 0:\r\n num=num/10\r\nnum = int(num)\r\nans = str(num)\r\nif ans == ans[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "'''\nThose who are heartless,\nonce cared too much.\n'''\ns=input()\ntool = len(s)\nmm=\"\"\nfor i in range(tool-1,-1,-1):\n if s[i]!='0':\n mm=s[i::-1]\n mm+=('0'*(tool-i-1))\n break\nprint(\"YES\" if s==mm else \"NO\")", "def solve():\r\n N = input()\r\n N = N[::-1]\r\n \r\n if N == N[::-1]:\r\n print(\"YES\")\r\n return\r\n \r\n for i in range(9):\r\n N += \"0\"\r\n if N == N[::-1]:\r\n print(\"YES\")\r\n return\r\n \r\n print(\"NO\") \r\n \r\nsolve()\r\n", "s=input()\r\na=[]\r\nb=[]\r\nt=0\r\nm=0\r\nfor i in range(len(s)):\r\n if s[i]=='0':\r\n t+=1\r\n else:\r\n break\r\n\r\n \r\nfor j in range(len(s)-1,-1,-1):\r\n if s[j]=='0':\r\n m+=1\r\n else:\r\n break\r\n\r\nif m>t:\r\n s=(m-t)*'0'+s\r\nelif m<t:\r\n s=s+'0'*(t-m)\r\n\r\n\r\nfor i in range(len(s)):\r\n a.append(s[i])\r\n b.append(s[len(s)-1-i])\r\nif a==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "x=int(input())\r\nwhile x%10==0:\r\n x=int(x/10)\r\nx=str(x)\r\nif x==x[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=input()\r\nwhile(a[-1]=='0'):a=a[:-1]\r\nif a==a[::-1]:print(\"YES\")\r\nelse: print(\"NO\")", "import math\r\n\r\nn = input()\r\nnum = list(n)\r\nwhile num[len(num) - 1] == '0':\r\n num.pop(len(num) - 1)\r\nwhile num[0] == '0':\r\n num.pop(0)\r\n\r\nfor x in range(len(num)):\r\n if num[x] != num[len(num) - x - 1]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "t = input().strip('0')#o(t)\nprint(['NO','YES'][t==t[::-1]])\n\t\t \t \t\t \t\t \t \t\t \t\t\t", "p = input()\r\n\r\nprev = p[::-1]\r\n\r\nif p == prev:\r\n print(\"YES\")\r\nelse:\r\n\r\n s = 0\r\n\r\n for N in prev:\r\n if N == '0':\r\n s += 1\r\n else:\r\n break\r\n new = s*'0' + p\r\n\r\n if new == new[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s=input()\r\ns=s[::-1]\r\nfor i in range(len(s)):\r\n\tif s[i]!=\"0\":\r\n\t\ts=s[i:]\r\n\t\t# print(s)\r\n\t\tbreak\r\nif s==s[::-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=input()\r\nif(n==n[::-1]):\r\n print(\"YES\")\r\nelse:\r\n for i in range(len(n)):\r\n n=\"0\"+n\r\n if(n==n[::-1]):\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\n", "num = input()\r\nnum = num.strip('0')\r\ncopy = num[::-1]\r\nif num == copy:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = list(str(input()))\ncnt = 0\nfor i in reversed(range(len(s))):\n if s[i] != '0':\n break\n else:\n cnt += 1\ns = ['0']*cnt+s\nn = len(s)\nfor j in range(n):\n if s[j] != s[n-1-j]:\n print('NO')\n exit()\nelse:\n print('YES')\n", "def delZeroes(target):\r\n if target[0] == '0':\r\n return delZeroes(target[1:])\r\n elif target[-1] == '0':\r\n return delZeroes(target[:-1])\r\n else:\r\n return target\r\n\r\n\r\ndef isPalindrom(target):\r\n if target[:round(len(target)/2)] == ''.join(reversed(list(target[len(target)-round(len(target)/2):]))):\r\n return True\r\n else:\r\n return False\r\ns = input()\r\n\r\nif isPalindrom(delZeroes(s)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=input().rstrip(\"0\")\r\nfor i in range(len(a)):\r\n if a[i]==a[len(a)-1-i]:\r\n pass\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "S = input()\r\nS = S[::-1]\r\ni = 0\r\nlen = len(S)\r\nwhile i < len and S[i] == '0':\r\n i += 1\r\nsRest = S[i:]\r\n#check if sRest is a palindrome\r\nif sRest == sRest[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s=input()\r\na=s[::-1]\r\nc=0\r\nfor i in a:\r\n if i=='0':\r\n c+=1\r\n else:\r\n break \r\na=a[c:]\r\nif a==a[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nl = list(map(int, n))\r\nmid = len(n)//2\r\nwhile l[0] == 0 or l[-1] == 0:\r\n if l[0] == 0:\r\n l.pop(0)\r\n elif l[-1] == 0:\r\n l.pop(-1)\r\nprint('YES' if l == l[::-1] else 'NO')", "n=[i for i in str(input())]\r\nn.reverse()\r\nwhile n[0]=='0':del n[0]\r\ns=''.join(n)\r\nn.reverse()\r\nr=''.join(n)\r\nprint(\"YES\" if s==r else \"NO\")\r\n", "s = list(input())\r\nwhile len(s) and s[0]==\"0\":\r\n s.remove(\"0\")\r\nwhile len(s) and s[-1]==\"0\":\r\n s.pop()\r\nt = s.copy()\r\nt.reverse()\r\nif t ==s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = (input())\r\nlis1 = list(a)\r\nlis = lis1[::-1]\r\nans = []\r\nfor k in lis:\r\n if k != \"0\":\r\n ans.append((lis.index(k)))\r\n \r\nans1 = ((lis[(ans[0])::]))\r\nans2 = (lis1[:(len(lis)-ans[0]):])\r\nout1 = \"\"\r\nout2 = \"\"\r\nfor j in ans1:\r\n out1 += j\r\nfor jj in ans2:\r\n out2 += jj\r\n\r\nif out1 == out2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "\nnumber = int(input())\n# reminder, reverserNumber = 0, 0\n# tempNumber = number\ncounter = 0\narr = [i for i in str(number)]\nx = ''\n\nfor i in arr[::-1]:\n if i == '0':\n counter += 1\n else:\n break\n\nfor i in range(counter):\n arr.insert(0, '0')\n\nfor i in arr:\n x += i\n\n# while x != 0:\n# reminder = x % 10\n# reverserNumber = reverserNumber * 10 + reminder\n# x //= 10\n\nprint(\"YES\") if x == x[::-1] else print(\"NO\")\n\n \t\t \t \t \t \t \t\t \t\t \t\t\t", "# http://codeforces.com/contest/863/problem/A\r\ns = str(input())\r\nc = 0\r\nfor i in range(len(s)-1, -1, -1):\r\n\tif s[i] == \"0\":\r\n\t\tc += 1\r\n\telse:\r\n\t\tbreak\r\nans = \"\"\r\nwhile(c):\r\n\tans += \"0\"\r\n\tc -= 1\r\nans += s\r\n\r\nprint(\"YES\" if ans == ans[::-1] else \"NO\")", "n=input()\r\nn=n.strip('0')\r\nif n[::-1]==n:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# /**\r\n# * author: brownfox2k6\r\n# * created: 12/06/2023 17:00:44 Hanoi, Vietnam\r\n# **/\r\n\r\ns = input()\r\nwhile s.startswith('0'):\r\n s = s[1:]\r\nwhile s.endswith('0'):\r\n s = s[:-1]\r\nprint(\"YES\" if s == s[::-1] else \"NO\")", "x = input()\n\nn = len(x)\nr = n-1\n\nwhile r > 0 and x[r] == '0':\n r -= 1\n\nans = True\nl = 0\nwhile l < r:\n if x[l] != x[r]:\n ans = False\n break\n l += 1\n r -= 1\n\nprint('YES' if ans else 'NO')\n", "n = int(input())\r\nwhile n % 10 == 0:\r\n n //= 10\r\ns = str(n)\r\nt = s[::-1]\r\nif s == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=0\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i]==\"0\":\r\n c+=1\r\n else:\r\n break\r\ns=c*\"0\"+s\r\nif s==s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input().strip('0')\r\nprint(['NO','YES'][n==n[::-1]])", "x = input()\r\nk = 0\r\nfor i in range(len(x)-1,0,-1):\r\n if x[i] == \"0\":\r\n k +=1\r\n else:\r\n break\r\n \r\nz = x[:len(x)-k]\r\nm = len(z)-1\r\nflag = 0\r\nfor i in range(len(z)//2):\r\n if z[i] != z[m]:\r\n flag = 1\r\n break\r\n m -= 1\r\n\r\nif flag == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "x=input()\r\nwhile x[-1]==\"0\":\r\n x=x[0:-1]\r\nif x==x[::-1]:print(\"YES\")\r\nelse:print(\"No\")", "s=input()\r\nl=-1\r\nfor i in range(len(s)):\r\n if s[i]!='0':\r\n l=i\r\n break\r\nif l==-1:\r\n print(\"YES\")\r\nelse:\r\n r=len(s)\r\n for i in range(len(s)-1,-1,-1):\r\n if s[i]!='0':\r\n r=i\r\n break\r\n s1=s[l:r+1]\r\n s2=s1[::-1]\r\n if s1==s2:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")", "a = str(input())\nn = len(a) \ni = 0; \nj = n - 1\nflag = True\nwhile (i < n and a[i] == '0'):\n i = i + 1\nwhile(j >= 0 and a[j] == '0'):\n j = j - 1\nwhile(flag and i < j):\n if(a[i] != a[j]) : \n print(\"NO\")\n flag = False\n i = i + 1 \n j = j - 1 \n\nif(flag):\n print(\"YES\")", "n=list(input())\r\nk=0\r\ni=-1\r\nwhile n[i]==\"0\":\r\n k+=1\r\n i-=1\r\nn.reverse()\r\nfor i in range(k):\r\n n.append(\"0\")\r\nn.reverse()\r\nx=n[:]\r\nx.reverse()\r\nif x==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n\tn = input()\r\n\tprint(solver(n))\r\n\r\ndef solver(s):\r\n\tleading = leadingZeros(s)\r\n\tending = leadingZeros(s[::-1])\r\n\tif leading <= ending:\r\n\t\tif isPalindrome(s[leading: len(s) - ending]):\r\n\t\t\treturn \"YES\"\r\n\t\telse:\r\n\t\t\treturn \"NO\"\r\n\telse:\r\n\t\treturn \"NO\"\r\n\r\ndef isPalindrome(s):\r\n\tn = len(s)\r\n\tfor i in range(n // 2):\r\n\t\tif s[i] != s[n - i - 1]:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef leadingZeros(s):\r\n\tfor i in range(len(s)):\r\n\t\tif s[i] != '0':\r\n\t\t\treturn i\r\n\treturn len(s)\r\n\r\n#print(isPalindrome(\"122\"))\r\nmain()" ]

[ "def main():\r\n n, p, q, r = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ans = -float('inf')\r\n mx = -float('inf')\r\n mx1 = -float('inf')\r\n for i in range(n):\r\n mx = max(mx, a[i] * p)\r\n mx1 = max(mx1, mx + a[i] * q)\r\n ans = max(ans, mx1 + a[i] * r)\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "n,p,q,r=map(int,input().split())\r\narr=list(map(int,input().strip().split()))\r\npi,qj,rk= [],[],[]\r\n\r\nfor i in range(n):\r\n x=arr[i]\r\n pi.append(x*p)\r\n qj.append(x*q)\r\n rk.append(x*r)\r\nfor i in range(1,n):\r\n pi[i]=max(pi[i-1],pi[i])\r\n rk[n-i-1]=max(rk[n-i],rk[n-i-1])\r\ns=pi[0]+qj[0]+rk[0]\r\nfor i in range(1,n):s=max(s,pi[i]+qj[i]+rk[i])\r\nprint(s)", "n, p, q, r = map(int, input().split())\nnums = list(map(int, input().split()))\n\n# make a dp with each row as the running max\n# of p, q and r product with current element\n# add the value from the row above\n\ndp = [[0 for _ in range(n+1)] for _ in range(4)]\ndp[0][0] = 0\ncoef = [p, q, r]\nfor i in range(1, 4):\n for j in range(1, n+1):\n if j==1:\n dp[i][j] = dp[i-1][j] + coef[i-1]*nums[j-1]\n else:\n dp[i][j] = max(dp[i-1][j] + coef[i-1]*nums[j-1], dp[i][j-1])\n\n#for d in dp:\n# print(d)\n\nprint(dp[3][n])\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\nN,a,b,c = map(int,input().split())\nA = list(map(int,input().split()))\n\nZ = [[A[-1],A[-1]]]\nfor z in range(N-2,-1,-1):\n Z.append([max(Z[-1][0],A[z]),min(Z[-1][1],A[z])])\nZ = Z[::-1]\nans = -float('inf')\nMax,Mix = A[0],A[0]\nfor y in range(N):\n Max = max(Max,A[y])\n Mix = min(Mix,A[y])\n ans = max(ans,max(Max*a,Mix*a)+A[y]*b+max(Z[y][0]*c,Z[y][1]*c))\nprint(ans)", "I = lambda: map(int, input().rstrip().split())\nn, p, q, r = I()\na = list(I())\npp = -1e20\npq = -1e20\npr = -1e20\nfor x in a:\n pp = max(pp, p * x)\n pq = max(pq, pp + q * x)\n pr = max(pr, pq + r * x)\nprint(pr)", "n, p, q, r = [int(npqr) for npqr in input().split()]\na = [int(aa) for aa in input().split()]\n\ninf = float('-inf')\n\nmatrix = [[inf, inf, inf] for i in range(n+1)]\n\nfor i in range(1, n+1):\n matrix[i][0] = max(matrix[i-1][0], a[i-1]*p)\n matrix[i][1] = max(matrix[i-1][1], a[i-1]*q + matrix[i][0])\n matrix[i][2] = max(matrix[i-1][2], a[i-1]*r + matrix[i][1])\n\nprint(matrix[-1][-1])\n \t\t \t\t \t\t \t \t \t \t\t\t \t \t\t\t", "n, p, q, r = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nlength = len(arr)\r\n\r\npmax = [0] * length # way of declaring an array of size n\r\nsmax = [0] * length\r\npmax[0] = p*arr[0]\r\nsmax[length - 1] = r*arr[length - 1]\r\nanswer = -100000000000000000000000000000\r\n\r\n# pmax calculation-for arr[i]\r\nfor i in range(1, length):\r\n pmax[i] = max(pmax[i - 1], p*arr[i])\r\n\r\n# smax calculation-for arr[k]\r\nfor i in range(length - 2, -1, -1):\r\n smax[i] = max(smax[i + 1], r*arr[i])\r\n\r\n# middle element calculation as per condition (will vary as per condition)\r\nfor i in range(0, length):\r\n x = (pmax[i]) + (q*arr[i]) + (smax[i])\r\n answer = max(answer, x)\r\n\r\nprint(answer)\r\n", "a=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nn=a[0]\r\ndp=[ [0 for i in range(4)] for j in range(n+1)]\r\nfor i in range(4):\r\n dp[0][i]=(-10)**(27)\r\nfor i in range(1,n+1):\r\n for j in range(1,4):\r\n x=arr[i-1]*a[j]+dp[i][j-1]\r\n y=dp[i-1][j]\r\n dp[i][j]= max(x,y)\r\nprint(dp[n][3])", "# Problem: B. Marvolo Gaunt's Ring\r\n# Contest: Codeforces - Manthan, Codefest 17\r\n# URL: https://codeforces.com/problemset/problem/855/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# KAPOOR'S\r\n\r\nfrom sys import stdin, stdout \r\n\r\ndef INI():\r\n\treturn int(stdin.readline())\r\n\t\r\ndef INL():\r\n\treturn [int(_) for _ in stdin.readline().split()]\r\n\t\r\ndef INS():\r\n\treturn stdin.readline()\r\n\r\ndef MOD():\r\n return pow(10,9)+7\r\n\t\r\ndef OPS(ans):\r\n\tstdout.write(str(ans)+\"\\n\")\r\n\t\r\ndef OPL(ans):\r\n\t[stdout.write(str(_)+\" \") for _ in ans]\r\n\tstdout.write(\"\\n\")\r\n\r\n\t\r\nif __name__==\"__main__\":\r\n\tn,p,q,r=INL()\r\n\tX=INL()\r\n\t\r\n\tD=[float(\"-inf\") for _ in range(n+1)]\r\n\t\r\n\tfor _ in range(n):\r\n\t\tD[_+1]=max(D[_],p*X[_])\r\n\t\r\n\tfor _ in range(n):\r\n\t\tD[_+1]=max(D[_],D[_+1]+q*X[_])\r\n\t\t\r\n\tfor _ in range(n):\r\n\t\tD[_+1]=max(D[_],D[_+1]+r*X[_])\r\n\t\r\n\tprint(D[-1])", "n,p,q,r=map(int,input().split())\nan=list(map(int,input().split()))\na=-10**19\nb=-10**19\nc=-10**19\nfor i in range(len(an)):\n a=max(a,p*an[i])\n b=max(b,a+q*an[i])\n c=max(c,b+r*an[i])\nprint(c)\n\n\t \t\t \t\t\t \t \t \t \t \t\t \t", "import sys\n\ndef solve(n: int, p: int, q: int, r: int, a: list) -> int:\n \n dp = [[None for _ in range(n)], [None for _ in range(n)], [None for _ in range(n)]]\n \n dp[0][0] = p * a[0]\n \n for i in range(1, n):\n dp[0][i] = max(dp[0][i-1],p * a[i])\n \n dp[1][0] = dp[0][0] + q * a[0]\n \n for i in range(1, n):\n dp[1][i] = max(dp[1][i-1], dp[0][i] + q * a[i])\n \n dp[2][0] = dp[1][0] + r * a[0]\n \n for i in range(1, n):\n dp[2][i] = max(dp[2][i-1], dp[1][i] + r * a[i])\n \n return dp[2][n-1]\n \n\n# variables\nn, p, q, r = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\na = [int(x) for x in sys.stdin.readline().strip().split(\" \")]\nprint(solve(n=n, p=p, q=q, r=r, a=a))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, p, q, r = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\na = b = c = -float(\"inf\")\r\n\r\nfor i in w:\r\n a = max(a, p*i)\r\n b = max(b, a + q*i)\r\n c = max(c, b + r*i)\r\n\r\nprint(c)", "n,p,q,r = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nprefix_max_arr = []\r\nsuffix_max_Arr = [None]*n\r\n\r\ndef find_max(val1,val2):\r\n if val1>val2:\r\n return val1\r\n else:\r\n return val2\r\n\r\nprefix_max_arr.append(arr[0]*p)\r\nfor i in range(1,n):\r\n val = find_max(arr[i]*p,prefix_max_arr[i-1])\r\n prefix_max_arr.insert(i,val)\r\n\r\nsuffix_max_Arr[n-1]= arr[n-1]*r\r\nfor j in reversed(range(n-1)):\r\n suffix_max_Arr[j] = find_max(arr[j]*r,suffix_max_Arr[j+1])\r\n\r\nans = -999999999999999999999\r\nfor k in range(n):\r\n recent_max = prefix_max_arr[k] + suffix_max_Arr[k] + q*arr[k]\r\n ans = find_max(recent_max, ans)\r\nprint(ans)\r\n", "n,p,q,r = map(int,input().split())\r\nalist = list(map(int,input().split()))\r\na,b,c = -8e18,-8e18,-8e18\r\nfor i in range(n):\r\n \r\n a = max(a, alist[i]*p)\r\n b = max(b, a+alist[i]*q)\r\n c = max(c, b+alist[i]*r)\r\nprint(c)", "import sys\ninput = lambda:sys.stdin.readline().strip()\nn,p,q,r = map(int,input().split())\nl = list(map(int,input().split()))\na = -1e20\nb = -1e20\nc = -1e20\nfor i in l:\n a = max(a,i*p)\n b = max(b,a + i*q)\n c = max(c,b + i*r)\nprint(c)\n \t\t \t \t \t\t\t \t\t \t \t\t \t", "import math\nn,p,q,r = [int(i) for i in input().split()]\nv= [p,q,r]\nlista = [int(i) for i in input().split()]\n\ndp = []\nfor i in range(n):\n dp.append([0,0,0])\n\nfor j in range(3):\n for i in range(n):\n if j == 0:\n if i == 0:\n dp[i][j] = p*lista[i]\n else:\n dp[i][j] = max(lista[i]*p, dp[i-1][j])\n elif i == 0:\n dp[i][j] = lista[i]*v[j] + dp[i][j-1]\n else:\n dp[i][j] = max(lista[i]*v[j] + dp[i][j-1], dp[i-1][j])\n\nprint(dp[i][j])\n \t \t\t \t\t \t \t \t\t \t \t\t\t\t", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr():\r\n n,p,q,r=lst()\r\n a=lst()\r\n NI=float('-inf')\r\n dp1=[NI]*n\r\n dp2=[NI]*n\r\n dp3=[NI]*n\r\n for i in range(n):\r\n if i==0:dp1[i]=a[i]*p\r\n else:dp1[i]=max(dp1[i-1],a[i]*p)\r\n for i in range(n):\r\n if i==0:dp2[i]=dp1[i]+a[i]*q\r\n dp2[i]=max(dp1[i]+q*a[i],dp2[i-1])\r\n for i in range(n):\r\n if i==0:dp3[i]=dp2[i]+r*a[0]\r\n else:dp3[i]=max(dp3[i-1],dp2[i]+a[i]*r)\r\n # print(dp1)\r\n # print(dp2)\r\n # print(dp3)\r\n print(max(dp3))\r\n\r\n\r\n\r\n\r\n\r\n", "n,p,q,r=[int(s) for s in input().split()]\na=[int(s) for s in input().split()]\nx=-10e18\ny=-10e18\nz=-10e18\nfor i in a:\n x=max(x,p*i)\n y=max(y,x+q*i)\n z=max(z,y+r*i)\nprint(z)\n\n\t\t\t\t \t\t \t\t \t\t \t\t \t\t\t \t\t\t\t\t\t\t \t", "if __name__ == \"__main__\":\n\tn,p,q,r = map(int, input().split())\n\tinlist = list(map(int,input().split()))\n\t\n\t# Placeholder values for the result\n\tval = 0\n\t\n\t# Our dynamic programming list/structure of size n*3\n\tdp = [[0,0,0]]*n\n\t\n\t# So, we work with 3 cases, lets get all the values that maximize dp[i][0]\n\tdp[0][0] = p*inlist[0]\n\tdp[0][1] = dp[0][0] + q*inlist[0]\n\tdp[0][2] = dp[0][1] + r*inlist[0]\n\tfor i in range(1,n):\n\t\tdp[i][0] = max(dp[i-1][0], p*inlist[i])\n\t\tdp[i][1] = max(dp[i-1][1],dp[i][0] + q*inlist[i])\n\t\tdp[i][2] = max(dp[i-1][2], dp[i][1] + r*inlist[i])\n\t\n\tprint(dp[n-1][2])\n\t\n", "n,p,q,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\ntemp=-10**20\r\ndp=[[temp,temp,temp] for i in range(n+1)]\r\nfor i in range(n):\r\n dp[i+1][0]=max(dp[i][0],a[i]*p)\r\n dp[i+1][1]=max(dp[i][1],dp[i+1][0]+a[i]*q)\r\n dp[i+1][2]=max(dp[i][2],dp[i+1][1]+a[i]*r)\r\n# print(*dp,sep=\"\\n\")\r\nprint(dp[n][2])", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,p,q,r=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nk1,k2,k3=-math.inf,-math.inf,-math.inf\r\nfor i in range(n):\r\n k1=max(k1,p*l[i])\r\n k2=max(k2,k1+q*l[i])\r\n k3=max(k3,k2+r*l[i])\r\nprint(k3)", "'''\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press \"Run\" button to execute it.\n\n'''\ncin=lambda:map(int,input().split())\nn,p,q,r=cin()\nA=cin()\nmax_p,max_q,max_r=-1e20,-1e20,-1e20\nfor a in A:\n\tmax_p=max(max_p,p*a)\n\tmax_q=max(max_q,max_p+q*a)\n\tmax_r=max(max_r,max_q+r*a)\nprint(max_r)\n", "def maxValue(arr, n, p, q, r):\r\n preMap = [0]*n\r\n preMap[0] = p*arr[0]\r\n suffMap = [0]*n\r\n suffMap[n-1] = r*arr[n-1]\r\n\r\n for i in range(1, n):\r\n if preMap[i-1]>=p*arr[i]:\r\n preMap[i] = preMap[i-1]\r\n else:\r\n preMap[i] = p*arr[i]\r\n \r\n for i in range(n-2, -1, -1):\r\n if suffMap[i+1]>=r*arr[i]:\r\n suffMap[i] = suffMap[i+1]\r\n else:\r\n suffMap[i] = r*arr[i]\r\n\r\n maxm = float('-inf')\r\n\r\n for i in range(n):\r\n if suffMap[i]+preMap[i]+(q*arr[i]) >= maxm:\r\n maxm = suffMap[i]+preMap[i]+(q*arr[i])\r\n\r\n return maxm\r\n\r\n\r\nli = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\nprint(maxValue(arr, li[0], li[1], li[2], li[3]))\r\n\r\n", "n,p,q,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=p*a[0] + q*a[0] + r*a[0]\r\nb=[0]*n\r\nc=[0]*n\r\nd=[0]*n\r\ne=[0]*n\r\nb[0]=a[0]\r\nc[0]=a[0]\r\nfor i in range(1,n):\r\n b[i]=max(b[i-1],a[i])\r\n c[i]=min(c[i-1],a[i])\r\nd[n-1]=a[n-1]\r\ne[n-1]=a[n-1]\r\nfor i in range(n-2 , -1,-1):\r\n d[i]=max(d[i+1],a[i])\r\n e[i]=min(e[i+1],a[i])\r\nfor j in range(n):\r\n v=a[j]*q + (max(b[j]*p,c[j]*p)) + (max(d[j]*r,e[j]*r))\r\n ans=max(ans,v)\r\nprint(ans)\r\n\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\n\r\nfrom itertools import permutations\r\n\r\nn,p,q,r=R()\r\n\r\na=L()\r\n\r\ndp1=[-math.inf]*(n+1)\r\ndp2=[-math.inf]*(n+1)\r\ndp3=[-math.inf]*(n+1)\r\n\r\nfor i in range(n):\r\n dp1[i+1]=max(dp1[i],a[i]*p)\r\n dp2[i+1]=max(dp2[i],a[i]*q+dp1[i+1])\r\n dp3[i+1]=max(dp3[i],a[i]*r+dp2[i+1])\r\n\r\n\r\nprint(dp3[n])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\nfrom bisect import bisect_right as br\r\n\r\n#from statistics import mode\r\n\r\nfrom itertools import combinations as cb\r\n\r\ndef int_arr(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef str_arr(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\n#sys.stdout = open('Marvolo Gaunt Ring/output.txt', 'w')\r\n#sys.stdin = open('Marvolo Gaunt Ring/input.txt', 'r')\r\n\r\nt=int_arr()\r\narr=int_arr()\r\nans=[-float('inf')]*3\r\n\r\nfor i in range(t[0]):\r\n\tans[0]=max(ans[0],t[1]*arr[i])\r\n\tans[1]=max(ans[1],t[2]*arr[i]+ans[0])\r\n\tans[2]=max(ans[2],t[3]*arr[i]+ans[1])\r\n\r\nprint(ans[2])", "n,p,q,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\n# pre,suf=[p*a[0]],[r*a[n-1]]*n\r\n# for i in range(1,n):\r\n# pre.append(max(pre[i-1],p*a[i]))\r\n# suf[n-i-1]=max(suf[n-i],r*a[n-i-1])\r\n# #print(pre,suf)\r\n\r\nx,y,z=-float('inf'),-float('inf'),-float('inf')\r\nfor i in range(n):\r\n z=max(z,p*a[i])\r\n y=max(y,z+q*a[i])\r\n x=max(x,y+r*a[i])\r\nprint (x)", "n,p,q,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\nPMAX,SMAX=[p*a[0]],[r*a[n-1]]*n\r\nfor i in range(1,n) :\r\n PMAX.append(max(PMAX[i-1],p*a[i]))\r\n SMAX[n-i-1]=max(SMAX[n-i], r*a[n-i-1])\r\nans=-float('inf')\r\nfor i in range(n) :\r\n ans = max( ans,PMAX[i] + q*a[i] + SMAX[i] )\r\nprint (ans)\r\n\r\n\r\n\r\n", "import sys\r\nfrom math import sqrt, gcd, factorial, ceil, floor, pi, inf, isqrt, lcm\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import heapify, heappush, heappop\r\n#from sortedcontainers import SortedList\r\n#sys.setrecursionlimit(10**5)\r\nfrom functools import lru_cache\r\n#@lru_cache(None)\r\n\r\n#======================================================#\r\ninput = lambda: sys.stdin.readline()\r\nI = lambda: int(input().strip())\r\nS = lambda: input().strip()\r\nM = lambda: map(int,input().strip().split())\r\nL = lambda: list(map(int,input().strip().split()))\r\n#======================================================#\r\n\r\ndef bs(arr,x):\r\n low,high = 0,len(arr)-1\r\n ans = len(arr)\r\n while low<=high:\r\n mid = (low+high)//2\r\n #if arr[mid]==x:\r\n # return x\r\n if arr[mid]<x:\r\n low = mid+1\r\n else:\r\n high = mid-1\r\n ans = mid\r\n return ans\r\n \r\n\r\ndef addd(arr,x):\r\n t = bs(arr,x)\r\n ans = []\r\n if t!=0:\r\n ans = arr[:t]\r\n ans.append(x)\r\n if t!=len(arr):\r\n ans.extend(arr[t:])\r\n return ans\r\n\r\n\r\n\r\n\r\n#======================================================#\r\n\r\ndef factorial_inverse():\r\n mod=10**9+7\r\n upto=(10**3)*2+1 \r\n nfactorial=[1 for i in range(upto)]\r\n ninverse=[1 for i in range(upto)]\r\n finverse=[1 for i in range(upto)]\r\n for i in range(2,upto):\r\n nfactorial[i]=(nfactorial[i-1]*i)%mod\r\n ninverse[i]=(-(mod//i)*ninverse[mod%i])%mod\r\n finverse[i]=(finverse[i-1]*ninverse[i])%mod\r\n return nfactorial,finverse\r\n\r\ndef nCk(n,k):\r\n if n<0 or k<0:\r\n return 0\r\n if k>n:\r\n return 0\r\n return ((nfactorial[n]*finverse[k]%mod)*finverse[n-k])%mod\r\n#======================================================#\r\ndef primelist():\r\n L = [False for i in range((10**10)+1)]\r\n primes = [False for i in range((10**10)+1)]\r\n for i in range(2,(10**10)+1):\r\n if not L[i]:\r\n primes[i]=True\r\n for j in range(i,(10**10)+1,i):\r\n L[j]=True\r\n return primes\r\ndef isPrime(n):\r\n p = primelist()\r\n return p[n]\r\n#======================================================#\r\ndef bst(arr,x):\r\n low,high = 0,len(arr)-1\r\n ans = -1\r\n while low<=high:\r\n mid = (low+high)//2\r\n if arr[mid]==x:\r\n return x\r\n if arr[mid]<x:\r\n low = mid+1\r\n ans = mid\r\n else:\r\n high = mid-1\r\n return ans\r\n \r\n \r\ndef factors(x):\r\n l1 = []\r\n l2 = []\r\n for i in range(1,int(sqrt(x))+1):\r\n if x%i==0:\r\n if (i*i)==x:\r\n l1.append(i)\r\n else:\r\n l1.append(i)\r\n l2.append(x//i)\r\n for i in range(len(l2)//2):\r\n l2[i],l2[len(l2)-1-i]=l2[len(l2)-1-i],l2[i]\r\n return l1+l2\r\n#======================================================#\r\n\r\ndef power(n,x):\r\n if x==0:\r\n return 1\r\n k = (10**9)+7\r\n if n==1:\r\n return 1\r\n if x==1:\r\n return n\r\n ans = power(n,x//2)\r\n if x%2==0:\r\n return (ans*ans)%k\r\n return (ans*ans*n)%k\r\n\r\n#======================================================#\r\n\r\ndef f(b):\r\n a = p[:]\r\n b = format(b,'b')\r\n for i in range(len(b)):\r\n if b[len(b)-1-i]=='1':\r\n a[31-i]-=1\r\n ans = []\r\n for i in a:\r\n if i>0:\r\n ans.append(\"1\")\r\n else:\r\n ans.append(\"0\")\r\n b = int(b,2)\r\n return b-(int(\"\".join(ans),2)&b)\r\n \r\n \r\n\r\nn,p,q,r = M()\r\na = L()\r\nx = [p*i for i in a]\r\nfor i in range(1,n):\r\n x[i] = max(x[i],x[i-1])\r\ny = [q*i for i in a]\r\ny[0]+=x[0]\r\nfor i in range(1,n):\r\n y[i] = max(y[i-1],y[i]+x[i])\r\nz = [r*i for i in a]\r\nz[0]+=y[0]\r\nfor i in range(1,n):\r\n z[i] = max(z[i-1],z[i]+y[i])\r\nprint(z[-1])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 fdp():\r\n n,P,Q,R=list(map(int,input().split()))\r\n l=list(map(int,input().split()))\r\n dpP=[0 for j in range(n)]\r\n dpQ=[0 for j in range(n)]\r\n dpR=[0 for j in range(n)]\r\n dpP[0]=P*l[0]\r\n dpQ[0]=Q*l[0]+dpP[0]\r\n dpR[0]=R*l[0]+dpQ[0]\r\n for i in range(1,n):\r\n dpP[i]=max(dpP[i-1],P*l[i])\r\n dpQ[i]=max(dpP[i]+Q*l[i],dpQ[i-1])\r\n dpR[i]=max(dpQ[i]+R*l[i],dpR[i-1])\r\n # print(dpP)\r\n # print(dpQ)\r\n # print(dpR)\r\n print(dpR[n-1])\r\n\r\nfdp()", "n,p,q,r= map(int, input().split())\r\na=list(map(int,input().split()))\r\npmax=[None]*n\r\nsmax=[None]*n\r\npmax[0]=a[0]*p\r\nfor i in range (1,n): \r\n pmax[i]=max(pmax[i-1],a[i]*p)\r\n\r\nsmax[n-1]=r*a[n-1]\r\nfor i in range(n-2,-1,-1):\r\n smax[i]=max(smax[i+1],a[i]*r)\r\n\r\nanswer=-99999999999999999999999999999999999999999999999999\r\nfor i in range(0,n):\r\n x=pmax[i]+q*a[i]+smax[i]\r\n answer=max(x,answer)\r\nprint(answer)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn,p,q,r = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nmx1 = mx2 = mx3 = int(-9e18)\r\n\r\nfor i in range(0,n):\r\n mx1 = max(mx1,p*a[i])\r\n mx2 = max(mx2,mx1+q*a[i])\r\n mx3 = max(mx3,mx2+r*a[i])\r\n\r\nprint(mx3)", "R = lambda: map(int, input().split())\r\n\r\nn, p, q, r = R()\r\narr = list(R())\r\nps = [p * x for x in arr]\r\nfor i in range(1, n):\r\n ps[i] = max(ps[i], ps[i - 1])\r\npqs = [ps[i] + arr[i] * q for i in range(n)]\r\nfor i in range(1, n):\r\n pqs[i] = max(pqs[i], pqs[i - 1])\r\nprint(max(pqs[i] + r * arr[i] for i in range(n)))", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn,p,q,r = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nfirst = second = ans = int(-5e18)\r\n\r\nfor i in a:\r\n if first < p*i:\r\n first = p*i\r\n if second < first + q*i:\r\n second = first + q*i\r\n if ans < second + r*i:\r\n ans = second + r*i\r\n \r\nprint(ans)", "# n, p, q, r = map(int, input().split())\r\n# a = [int(i) for i in input().split()]\r\n# if a[i] > 0:\r\n# aa = max(a)\r\n# bb = max(a)\r\n# cc = max(a)\r\n# else:\r\n# aa = min(a)\r\n# bb = min(a)\r\n# cc = min(a)\r\n# print(p*aa + q*bb + r*cc)\r\nn, p, q, r = map(int, input().split())\r\nalist = list(map(int,input().split()))\r\na,b,c = -1e20,-1e20,-1e20 # a = p*ai, b = p*ai + q *aj, c = p*ai + q*aj + r*ak\r\nfor i in range(n):\r\n a = max(a, alist[i]*p)\r\n b = max(b, a + alist[i]*q)\r\n c = max(c, b+alist[i]*r)\r\nprint(c)\r\n\r\n", "#If you win, you live. You cannot win unless you fight.\r\n# remember hash hack use tuple\r\nimport string\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nsetrecursionlimit(10**5)\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom math import gcd, ceil, floor,log2,factorial\r\n'''\r\n(colstkaken ka sum coinsecutivee)*(rows taken ka sum)\r\n'''\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\n\r\nn,p,q,r=rd()\r\na=list(rd())\r\nmx=SegmentTree(a,default=-float(\"inf\"))\r\nmn=SegmentTree(a,default=float(\"inf\"),func=min)\r\nans=-float(\"inf\")\r\nfor j in range(n):\r\n lmn=mn.query(0,j+1)\r\n lmx=mx.query(0,j+1)\r\n rmn=mn.query(j,n)\r\n rmx=mx.query(j,n)\r\n ans=max(ans,max(p*lmx,p*lmn)+q*a[j]+max(r*rmx,r*rmn))\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,p,q,r=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ndpleft=[float('-inf') for _ in range(n)]\r\ndpright=[0 for _ in range(n)]\r\nleftmax=float('-inf')\r\nfor i in range(n):\r\n leftmax=max(leftmax,p*l[i])\r\n dpleft[i]=leftmax\r\n#print(dpleft)\r\nrightmax=float('-inf')\r\nfor i in range(n-1,-1,-1):\r\n rightmax=max(rightmax,r*l[i])\r\n dpright[i]=rightmax\r\n#print(dpright)\r\nans=float('-inf')\r\nfor i in range(n):\r\n ans=max(ans,dpleft[i]+q*l[i]+dpright[i])\r\nprint(ans)", "n,p,q,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\nPmax=[0]*n\r\nSmax=[0]*n\r\nPmax[0]=p*a[0]\r\nSmax[n-1]=r*a[n-1]\r\nans=float('-inf')\r\nfor i in range(1,n):\r\n Pmax[i]=max(Pmax[i-1],(p*a[i]))\r\nfor j in range(n-2,-1,-1):\r\n Smax[j]=max(Smax[j+1],(r*a[j]))\r\nfor k in range(0,n):\r\n temp=Pmax[k]+(q*a[k])+Smax[k]\r\n ans=max(ans,temp)\r\nprint(ans)", "\n\nn,p,q,r = tuple(map(int,input().split()))\narr = list(map(int,input().split()))\ndef max_sum(n,p,q,r):\n d_i = {}\n d_k = {}\n max_tn_ind = 0\n for i in range(n):\n if (p*arr[i])>(p*arr[max_tn_ind]):\n max_tn_ind= i\n d_i[i]=(p*arr[max_tn_ind])\n max_tn_ind= n-1\n for k in range(n-1, -1, -1):\n\n if (r*arr[k])>(r*arr[max_tn_ind]):\n max_tn_ind=k\n d_k[k] = r*arr[max_tn_ind]\n ans = (q*arr[0]) + d_k[0] +d_i[0]\n\n for j in range(n):\n x=((q*arr[j]) +d_i[j]+d_k[j])\n if x > ans:\n ans = x\n\n return ans\nprint(max_sum(n,p,q,r))\n\n\n\n\t \t \t\t \t \t \t\t \t \t\t \t\t\t", "def modified_pre_max(arr,p):\r\n n = len(arr)\r\n arr1 = ['None']*n\r\n arr1[0] = arr[0]*p\r\n for i in range(1,n):\r\n arr1[i] = max((arr1[i-1]),(arr[i]*p))\r\n return arr1\r\n\r\ndef modified_suf_max(arr,r):\r\n n = len(arr)\r\n arr1 = ['None'] * n\r\n arr1[n-1] = arr[n-1]*r\r\n for i in range (n-2,-1,-1):\r\n arr1[i] = max((arr1[i+1]),arr[i]*r)\r\n return arr1\r\n\r\nn,p,q,r = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = float(\"-inf\")\r\n\r\narr_pre_max = modified_pre_max(arr,p)\r\narr_suf_max = modified_suf_max(arr,r)\r\nfor i in range (0,n):\r\n current_ans = arr_pre_max[i] + arr[i]*q + arr_suf_max[i]\r\n ans = max(ans,current_ans)\r\n\r\nprint(ans)\r\n#print(arr_pre_max)\r\n#print(arr_suf_max)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "neg_inf= float('-inf')\n\ndef check_x():\n params=input().split()\n n,p,q,r=int(params[0]),int(params[1]),int(params[2]),int(params[3])\n arr=input().split()\n arr=[int(x) for x in arr]\n x=find_x(p,q,r,arr)\n print(x)\n\ndef find_x(p,q,r,n):\n x=0\n max_p=neg_inf\n max_q=neg_inf\n max_r=neg_inf\n for i in range(len(n)):\n max_p=max(max_p,p*n[i])\n max_q=max(max_q,q*n[i]+max_p)\n max_r=max(max_r,r*n[i]+max_q)\n\n return max_r\n\ncheck_x()\n", "n, x, y, z = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\na = -1e21\r\nb = -1e21\r\nc = -1e21\r\nfor i in range(n):\r\n temp = l[i]\r\n a = max(a, x*temp)\r\n b = max(b, a + y*temp)\r\n c = max(c, b + z*temp)\r\n \r\n \r\nprint(c)", "n,p,q,r=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\ndp0=[-1e15 for i in range(n)]\r\ndp1=[-1e15 for i in range(n)]\r\ndp2=[-1e15 for i in range(n)]\r\n\r\ndp0[0]=a[0]*p \r\ndp1[0]=a[0]*p+a[0]*q\r\ndp2[0]=a[0]*p+a[0]*q+a[0]*r \r\n\r\nfor i in range(1,n):\r\n dp0[i]=max(dp0[i-1],a[i]*p)\r\n \r\nfor i in range(1,n):\r\n dp1[i]=max(dp1[i-1],dp0[i]+a[i]*q)\r\n\r\nfor i in range(1,n):\r\n dp2[i]=max(dp2[i-1],dp1[i]+a[i]*r)\r\n \r\nprint(dp2[n-1]) ", "cin=lambda:map(int,input().split())\r\nn,p,q,r=cin()\r\nA=cin()\r\ntp,tq,tr=-1e20,-1e20,-1e20\r\nfor a in A:\r\n\ttp=max(tp,p*a)\r\n\ttq=max(tq,tp+q*a)\r\n\ttr=max(tr,tq+r*a)\r\nprint(tr)", "from sys import stdin,stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\nNI=float('-inf')\r\ndef fn(pos,state):\r\n if pos>=n:\r\n if state in [0,1,2]:return NI\r\n return 0\r\n if (pos,state) in dp:return dp[pos,state]\r\n if state==0:\r\n ans=max(fn(pos+1,0),a[pos]*p+fn(pos,1))\r\n elif state==1:\r\n ans=max(fn(pos+1,1),a[pos]*q+fn(pos,2))\r\n else:\r\n ans=max(fn(pos+1,2),a[pos]*r)\r\n dp[pos,state]=ans\r\n return ans\r\nfor _ in range(1):#nmbr()):\r\n n,p,q,r=lst()\r\n a=lst()\r\n dp=[[NI for _ in range(4)] for _ in range(n+1)]\r\n for i in range(n+1):\r\n dp[i][0]=0\r\n for i in range(n):\r\n for j in range(3):\r\n if j==0:\r\n dp[i+1][0]=max(dp[i+1][0],dp[i][j])\r\n dp[i][1]=max(dp[i][1],a[i]*p+dp[i][j])\r\n elif j==1:\r\n dp[i+1][1]=max(dp[i+1][1],dp[i][1])\r\n dp[i][2]=max(dp[i][2],a[i]*q+dp[i][1])\r\n else:\r\n dp[i+1][2]=max(dp[i+1][2],dp[i][2])\r\n dp[i][3]=max(dp[i][3],a[i]*r+dp[i][j])\r\n ans=NI\r\n # print(*dp,sep='\\n')\r\n for i in range(n+1):\r\n ans=max(ans,dp[i][3])\r\n print(ans)", "cin=lambda:map(int,input().split())\nn,p,q,r=cin()\nA=cin()\ntp,tq,tr=-1e20,-1e20,-1e20\nfor a in A:\n\ttp=max(tp,p*a)\n\ttq=max(tq,tp+q*a)\n\ttr=max(tr,tq+r*a)\nprint(tr)\n\t\t \t\t \t\t \t \t \t \t \t\t\t", "n,p,q,r = list(map(int, input().strip().split()))\r\nvalue_list = list(map(int, input().strip().split()))\r\nprefix_max = []\r\nsuffix_max = [ float('-inf') for _ in range(n)]\r\n\r\nresult = float('-inf')\r\nfor pre_index,suf_index in zip(range(n),range(n-1,-1,-1)):\r\n previous_val = float('-inf') if pre_index == 0 else prefix_max[pre_index-1]\r\n prefix_max.append(max(p*value_list[pre_index] , previous_val))\r\n suffix_val = float('-inf') if suf_index == n-1 else suffix_max[suf_index + 1]\r\n suffix_max[suf_index] = max(r*value_list[suf_index] , suffix_val)\r\nfor i in range(n):\r\n result = max(\r\n result,\r\n (value_list[i]*q + prefix_max[i] + suffix_max[i])\r\n )\r\nprint(result)", "from sys import stdin, stdout\r\n#stdin = open('Marvolo Gaunt Ring.txt', 'r') \r\ndef MI(): return map(int, stdin.readline().split())\r\ndef LI(): return list(map(int, stdin.readline().split()))\r\n\r\nn, p, q, r = MI()\r\na = LI()\r\ndp0 = [0 for i in range(n)]\r\ndp1 = [0 for i in range(n)]\r\ndp2 = [0 for i in range(n)]\r\n\r\ndp0[0] = p * a[0]\r\ndp1[0] = dp0[0] + q * a[0]\r\ndp2[0] = dp1[0] + r * a[0]\r\n\r\nfor i in range(1,n):\r\n dp0[i] = max( dp0[i-1], p * a[i])\r\n dp1[i] = max( dp1[i-1], dp0[i] + (q * a[i]))\r\n dp2[i] = max( dp2[i-1], dp1[i] + (r * a[i]))\r\n\r\nans = dp2[-1]\r\nstdout.write(\"{} \\n\".format(ans))\r\n", "import sys\r\nimport bisect\r\nimport heapq\r\nimport math\r\nfrom functools import lru_cache\r\nfrom collections import defaultdict,Counter\r\n\r\n\r\n#sys.setrecursionlimit(10**6)\r\ninput = sys.stdin.readline\r\nI = lambda: int(input())\r\nS = lambda: input()\r\nL = lambda: list(map(int, input().split()))\r\n###################################################\r\n\r\n\r\n\r\n\r\ndef solution(n,p,q,r):\r\n a = L()\r\n temp1 = float('inf')\r\n temp2 = float('-inf')\r\n left_min = []\r\n left_max = []\r\n right_min = []\r\n right_max = []\r\n for i in a:\r\n temp1 = min(i,temp1)\r\n temp2 = max(i,temp2)\r\n left_min.append(temp1)\r\n left_max.append(temp2)\r\n temp1 = float('inf')\r\n temp2 = float('-inf')\r\n for i in a[::-1]:\r\n temp1 = min(i,temp1)\r\n temp2 = max(i,temp2)\r\n right_min.append(temp1)\r\n right_max.append(temp2)\r\n right_min.reverse()\r\n right_max.reverse()\r\n res = float('-inf')\r\n n = len(a)\r\n for i in range(n):\r\n x = max(p*left_max[i],p*left_min[i])\r\n y = max(r*right_max[i],r*right_min[i])\r\n z = q*a[i]\r\n res = max(res,x+y+z)\r\n print(res)\r\nif __name__=='__main__':\r\n n,p,q,r = L()\r\n solution(n,p,q,r)", "n,p,q,r = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nmaxp = ai[-1] * p\r\nmaxq = ai[-1] * q\r\nmaxr = ai[-1] * r\r\nmaxqr = maxq + maxr\r\nans = maxqr + maxp\r\nfor i in range(n-2,-1,-1):\r\n maxr = max(maxr,ai[i] * r)\r\n maxqr = max(maxqr, ai[i] * q + maxr)\r\n ans = max(ans,maxqr + ai[i] * p)\r\nprint(ans)\r\n \r\n", "def preMax(arr,coeff):\r\n tempArr = [arr[0]*coeff]\r\n for n in range(1,len(arr)):\r\n tempArr.insert(n,max(arr[n]*coeff,tempArr[n-1]))\r\n return tempArr\r\n \r\ndef suffMax(arr, coeff):\r\n tempArr = [arr[-1]*coeff]\r\n for n in range(len(arr)-1,0,-1):\r\n tempArr.insert(0, max(arr[n-1]*coeff,tempArr[0]))\r\n return tempArr\r\n \r\nif __name__ == '__main__':\r\n coeff = list(map(int,input().split(' ')))\r\n arr = list(map(int,input().split(' ')))\r\n pMax = preMax(arr,coeff[1])\r\n sMax = suffMax(arr,coeff[3])\r\n ans = None\r\n \r\n for n in range(0,len(arr)):\r\n tempAns = pMax[n] + arr[n]*coeff[2] + sMax[n]\r\n if ans==None:\r\n ans = tempAns\r\n else:\r\n ans = max(ans, tempAns)\r\n \r\n print(ans)", "# LUOGU_RID: 119333105\nn,p,q,r=map(int,input().split())\r\na=[0]+list(map(int,input().split()))\r\nf=[[0]*4 for _ in range(n+1)]\r\nf[1][1]=a[1]*p\r\nfor i in range(2,n+1):\r\n f[i][1]=max(f[i-1][1],a[i]*p)\r\nf[1][2]=f[1][1]+a[1]*q\r\nfor i in range(2,n+1):\r\n f[i][2]=max(f[i-1][2],f[i][1]+a[i]*q)\r\nf[1][3]=f[1][2]+a[1]*r\r\nfor i in range(2,n+1):\r\n f[i][3]=max(f[i-1][3],f[i][2]+a[i]*r)\r\nprint(f[n][3])", "neg_inf = float('-inf')\n\ndef check_x():\n params = input().split()\n n, p, q, r = int(params[0]), int(params[1]), int(params[2]), int(params[3])\n arr = input().split()\n arr = [int(x) for x in arr]\n x = find_x(p, q, r, arr)\n print(x)\n\ndef find_x(p, q, r, a):\n x = 0\n max_p = neg_inf\n max_q = neg_inf\n max_r = neg_inf\n\n for i in range(len(a)):\n max_p = max(max_p, p*a[i])\n max_q = max(max_q, q*a[i] + max_p)\n max_r = max(max_r, r*a[i] + max_q)\n\n return max_r\n\ncheck_x()\n \t\t\t \t\t \t \t \t \t \t\t", "# Define a lambda function to take input as integers from standard input\ncin = lambda: map(int, input().split())\n\n# Read in the input values: n, p, q, r and the array A\nn, p, q, r = cin()\nA = list(cin())\n\n# Initialize the variables tp, tq, and tr to negative infinity\ntp, tq, tr = -float(\"inf\"), -float(\"inf\"), -float(\"inf\")\n\n# Loop through the elements in the array A\nfor a in A:\n # Compute the maximum value of p*a seen so far and store it in tp\n tp = max(tp, p * a)\n \n # Compute the maximum value of tp+q*a seen so far and store it in tq\n tq = max(tq, tp + q * a)\n \n # Compute the maximum value of tq+r*a seen so far and store it in tr\n tr = max(tr, tq + r * a)\n\n# Print the value of tr, which represents the maximum value of (p * A[i] + q * A[j] + r * A[k])\nprint(tr)\n\n \t \t\t \t \t \t \t\t\t \t\t\t \t\t\t\t\t\t", "n, p, q, r = map(int, input().split())\r\narr = list(map(int, input().split()))\r\npm = [0] * n\r\npm[0] = p * arr[0]\r\nsm = [0] * n\r\nsm[n - 1] = r * arr[n - 1]\r\nfor i in range(1, n):\r\n pm[i] = max(pm[i - 1], p * arr[i])\r\nfor i in range(n - 2, -1, -1):\r\n sm[i] = max(sm[i + 1], r * arr[i])\r\nans = float('-inf')\r\nfor i in range(n):\r\n x = pm[i] + q*arr[i] + sm[i]\r\n ans = max(ans, x)\r\nprint(ans)\r\n", "def get_prefix_max_array(arr, n, p):\r\n prefix_max_arr = [0] * n\r\n prefix_max_arr[0] = p * arr[0]\r\n for i in range(1, n):\r\n prefix_max_arr[i] = max(prefix_max_arr[i - 1], p * arr[i])\r\n # print('prefix_max_arr', prefix_max_arr)\r\n return prefix_max_arr\r\n\r\n\r\ndef get_suffix_max_array(arr, n, r):\r\n suffix_max_arr = [0] * n\r\n suffix_max_arr[n - 1] = r * arr[n - 1]\r\n for i in range(n - 2, -1, -1):\r\n suffix_max_arr[i] = max(suffix_max_arr[i + 1], r * arr[i])\r\n # print('suffix_max_arr', suffix_max_arr)\r\n return suffix_max_arr\r\n\r\n\r\ndef get_maximum_value(arr, n, p, q, r):\r\n if arr is None:\r\n raise Exception('arr cannot be None')\r\n if n is None or p is None or q is None or r is None:\r\n raise Exception('n, p, q, r cannot be None')\r\n arr_prefix_max = get_prefix_max_array(arr, n, p)\r\n arr_suffix_max = get_suffix_max_array(arr, n, r)\r\n maximum_value = float('-inf')\r\n for i in range(n):\r\n maximum_value = max(maximum_value, arr_prefix_max[i] + (q * arr[i]) + arr_suffix_max[i])\r\n # print('maximum_value', maximum_value)\r\n return maximum_value\r\n\r\n\r\ndef main():\r\n n, p, q, r = list(map(int, input().strip().split()))\r\n arr = list(map(int, input().strip().split()))\r\n try:\r\n maximum_value = get_maximum_value(arr, n, p, q, r)\r\n print(maximum_value)\r\n except Exception as e:\r\n print(e)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "\r\nn,p,q,r=input().split()\r\nx=[]\r\nx=list(map(int, input().split()))\r\np=int(p)\r\nq=int(q)\r\nr=int(r)\r\n\r\nfor i in range(int(n)):\r\n t=int(x[i])\r\n if i == 0:\r\n a = t * p\r\n b = a + t * q\r\n c = b + t * r\r\n else:\r\n if a < t * p:\r\n a = t * p\r\n if b < a + t * q:\r\n b = a + t * q\r\n if c < b + t * r:\r\n c = b + t * r\r\n\r\nprint(c)", "n,p,q,r = map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprefm=[0]*n\r\nprefm[0]=arr[0]*p\r\nfor i in range(1,n):\r\n prefm[i]=max(prefm[i-1],arr[i]*p)\r\nsuffm=[0]*n\r\nsuffm[n-1]=arr[n-1]*r\r\nfor i in range(n-2,-1,-1):\r\n suffm[i]=max(suffm[i+1],r*arr[i])\r\nmaxi=-10**19\r\nfor i in range(n):\r\n maxi=max(maxi,prefm[i]+q*arr[i]+suffm[i])\r\nprint(maxi)", "def f(n,p,q,r,a):\r\n dp=[[0 for i in range(n)] for j in range(3)]\r\n dp[0][0]=p*a[0]\r\n dp[1][0]=dp[0][0]+(q*a[0])\r\n dp[2][0]=dp[1][0]+(r*a[0])\r\n for i in range(1,n):\r\n dp[0][i]=max(dp[0][i-1],p*a[i])\r\n dp[1][i]=max(dp[1][i-1],dp[0][i]+q*a[i])\r\n dp[2][i]=max(dp[2][i-1],dp[1][i]+r*a[i])\r\n return dp[2][n-1]\r\nx=input()\r\nx1=x.split(' ')\r\nx2=[int(t) for t in x1] \r\ny=input()\r\ny1=y.split(' ')\r\ny2=[int(t) for t in y1] \r\nprint(f(x2[0],x2[1],x2[2],x2[3],y2))\r\n", "n, p, q, r = map(int, input().split())\r\na = list(map(int, input().split()))\r\nrl = [a[-1]*r]\r\npl = [a[0]*p]\r\nfor i in range(2,n+1):\r\n\trl.append(max(rl[-1], a[-i]*r))\r\n\tpl.append(max(pl[-1], a[i-1]*p))\r\nrl.reverse()\r\nans = pl[0] + a[0]*q + rl[0]\r\nfor i in range(1, n):\r\n\tans = max(ans,pl[i] + a[i]*q + rl[i])\r\nprint(ans)", "\r\ndef main():\r\n n, p, q, r = input().split()\r\n n, p ,q, r = int(n), int(p), int(q), int(r)\r\n nums = list(map(int, input().split()))\r\n num_length = len(nums)\r\n if num_length != n:\r\n print(-1)\r\n \r\n minimum_integer = float('-inf')\r\n maximum_integer = float('-inf')\r\n pre_max = [minimum_integer]*n\r\n pre_min = [maximum_integer]*n\r\n post_max = [minimum_integer]*n\r\n post_min = [maximum_integer]*n\r\n pre_max[0] = nums[0]\r\n pre_min[0] = nums[0]\r\n post_max[-1] = nums[-1]\r\n post_min[-1] = nums[-1]\r\n for i in range(1, num_length):\r\n pre_max[i] = max(nums[i], pre_max[i-1])\r\n # print(pre_max)\r\n \r\n for i in range(1, num_length):\r\n pre_min[i] = min(nums[i], pre_min[i-1])\r\n # print(pre_min)\r\n \r\n for i in range(num_length-2, -1, -1):\r\n post_max[i] = max(nums[i], post_max[i+1])\r\n # print(post_max)\r\n \r\n for i in range(num_length-2, -1, -1):\r\n post_min[i] = min(nums[i], post_min[i+1])\r\n # print(post_min)\r\n \r\n ans = minimum_integer\r\n for i in range(num_length):\r\n ans = max(ans, (max(p*pre_max[i], p*pre_min[i])+(q*nums[i])+(max(r*post_max[i], r*post_min[i]))))\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,p,q,r = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\npmax = [0]*n\r\npmax[0] = arr[0]*p\r\nfor i in range(1,n):\r\n pmax[i] = max(arr[i]*p,pmax[i-1])\r\n\r\nsmax = [0]*n\r\nsmax[-1] = arr[-1]*r\r\nfor i in range(n-1)[::-1]:\r\n smax[i] = max(arr[i]*r,smax[i+1])\r\n\r\n##print(pmax)\r\n##print(smax)\r\nans = float('-inf')\r\nfor i in range(n):\r\n ans = max(ans,pmax[i]+arr[i]*q + smax[i])\r\nprint(ans)\r\n", "def find_max_value(n, p, q, r, arr):\r\n Pmax = [None] * n\r\n Smax = [None] * n\r\n\r\n # Calculate the maximum value of ai for each index\r\n Pmax[0] = p * arr[0]\r\n for i in range(1, n):\r\n Pmax[i] = max(Pmax[i - 1], p * arr[i])\r\n\r\n # Calculate the maximum value of aj for each index\r\n Smax[n-1] = r * arr[n-1] \r\n for i in range(n-2,-1,-1):\r\n Smax[i] = max(Smax[i + 1], r * arr[i])\r\n\r\n # Calculate the maximum value of ak for each index\r\n ans = float('-inf')\r\n for i in range(n):\r\n temp = Pmax[i] + q*arr[i] + Smax[i]\r\n ans = max(ans,temp)\r\n\r\n return ans\r\n\r\n# Read input\r\nn, p, q, r = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\n# Calculate and print the maximum value\r\nprint(find_max_value(n, p, q, r, arr))\r\n", "n,p,q,r = map(int, input().split())\r\nli = []\r\n\r\nli = list(map(int,input().split()))\r\n\r\nfor i in range(len(li)):\r\n if i == 0:\r\n x = li[i]*p\r\n y = li[i]*q + x\r\n z = li[i]*r + y\r\n else:\r\n x = max((li[i]*p) , x)\r\n y = max((x + li[i]*q) , y)\r\n z = max((y + li[i]*r) , z)\r\n\r\nprint(z) \r\n", "n,p,q,r = map(int,input().split())\r\na = input()\r\nA = list(map(int,list(a.split())))\r\ndp = [[0 for i in range(n)] for j in range(3)]\r\ndp[0][0] = p*(A[0])\r\ndp[1][0] = p*(A[0])+q*(A[0])\r\ndp[2][0] = p*(A[0])+q*(A[0])+r*(A[0])\r\nfor i in range(1,n):\r\n dp[0][i] = max(dp[0][i-1],p*(A[i]))\r\n dp[1][i] = max(dp[1][i-1],dp[0][i]+q*A[i])\r\n dp[2][i] = max(dp[2][i-1],dp[1][i]+r*(A[i]))\r\nprint(dp[2][n-1])\r\n ", "n,p,q,r=map(int,input().split())\nA=map(int,input().split())\ntp,tq,tr=-1e20,-1e20,-1e20\nfor a in A:\n tp=max(tp,p*a)\n tq=max(tq,tp+q*a)\n tr=max(tr,tq+r*a)\nprint(tr)# 1692134445.589504", "n,p,q,r=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\n\r\nmaxP=[]\r\nmaxim=float('-inf')\r\nfor i in range(n):\r\n maxP.append(arr[i]*p)\r\n maxim=max(maxim,arr[i]*p)\r\n maxP[i]=maxim\r\n\r\nmaxim=float('-inf')\r\nmaxR=[float('-inf') for x in range(n)]\r\nfor i in range(n-1,-1,-1):\r\n maxR[i]=arr[i]*r \r\n maxim=max(maxim,arr[i]*r)\r\n maxR[i]=maxim\r\n \r\nans=float('-inf') \r\nfor i in range(n):\r\n ans=max(ans,maxP[i]+arr[i]*q+maxR[i])\r\nprint(ans)", "n, p, q, r = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\nsiz = len(arr)\r\npre_max = [0] * siz\r\nsuf_max = [0] * siz\r\npre_max[0] = p * arr[0]\r\nsuf_max[n - 1] = r * arr[n - 1]\r\nfor i in range(1, len(arr)):\r\n pre_max[i] = max(pre_max[i - 1], p * arr[i])\r\n# print(pre_max[idx])\r\nfor i in range(len(arr)-2, -1, -1):\r\n suf_max[i] = max(suf_max[i + 1], r * arr[i])\r\n# print(suf_max[idx])\r\nans = float('-inf')\r\nfor i in range(len(arr)):\r\n x = pre_max[i] + q * arr[i] + suf_max[i]\r\n ans = max(ans, x)\r\nprint(ans)\r\n", "n,p,q,r = map(int,input().split(\" \"))\nl = list(map(int,input().split(\" \")))\ndp = [[float('-inf') for i in range(n+1)] for j in range(3)]\nfor i in range(3):\n for j in range(1,n+1):\n if i == 0:\n dp[i][j] = max(dp[i][j-1],l[j-1]*p)\n if i == 1:\n dp[i][j] = max(dp[i][j-1],dp[i-1][j]+l[j-1]*q)\n if i == 2:\n dp[i][j] = max(dp[i][j-1],dp[i-1][j]+l[j-1]*r)\nprint(dp[2][n])", "def fun(n,p,q,r,li):\r\n sfmax=[0 for i in range(n)]\r\n sfmax[n-1]=r*li[n-1]\r\n for j in range(n-2,-1,-1):\r\n sfmax[j]=max(sfmax[j+1],r*li[j])\r\n ans=-float(\"inf\")\r\n pmax=[]\r\n pmax.append(p*li[0])\r\n for i in range(1,n):\r\n pmax.append(max(pmax[j-1],p*li[i]))\r\n for j in range(0,n):\r\n ans=max(ans,pmax[j]+li[j]*q+sfmax[j])\r\n return ans\r\n \r\nn,p,q,r=list(map(lambda x:int(x),input().split()))\r\nli=list(map(lambda x:int(x),input().split()))\r\nprint(fun(n,p,q,r,li))\r\n", "n,p,q,r = [int(x) for x in input().split()]\r\na= [int(x) for x in input().split()]\r\nm = len(a)\r\nmax1= [None]*m\r\npmax = [None]*m\r\nrmax= [None]*m\r\nj=m-1\r\npmax[0] = p*a[0]\r\nrmax[m-1] = r*a[m-1]\r\nfor i in range(1,m):\r\n pmax[i] = max(pmax[i-1], (p*a[i]))\r\n rmax[j-1] = max(rmax[j], (r*a[j-1]))\r\n j-=1\r\nmax1[0] = pmax[0]+q*a[0]+rmax[0] \r\nfor k in range(1,m):\r\n max1[k] = max(max1[k-1], pmax[k]+q*a[k]+rmax[k])\r\nprint(max1[m-1])\r\n", "inf=int(1e-12)\r\nm=inf\r\n\r\nn,p,q,r=map(int,input().split(\" \"))\r\narr=list(map(int,input().split(\" \")))\r\ndp=[[inf,inf,inf] for i in range(n+1)]\r\ndp[1][0]=arr[0]*p\r\ndp[1][1]=arr[0]*q+dp[1][0]\r\ndp[1][2]=arr[0]*r+dp[1][1]\r\n\r\nfor i in range(2,n+1):\r\n dp[i][0]=max(arr[i-1]*p,dp[i-1][0])\r\n dp[i][1]=max(dp[i][0]+arr[i-1]*q,dp[i-1][1])\r\n dp[i][2]=max(dp[i][1]+arr[i-1]*r,dp[i-1][2])\r\nprint(dp[n][2])\r\n", "n,p,q,r=map(int,input().split())\r\narr = list(map(int,input().split()))\r\nn=len(arr)\r\n\r\nif n==1:\r\n print(arr[0]*(p+q+r))\r\nelse:\r\n pref=[arr[0]]\r\n if(p>0):\r\n for i in range(1,n):\r\n pref.append(max(pref[-1],arr[i]))\r\n else:\r\n for i in range(1,n):\r\n pref.append(min(pref[-1],arr[i]))\r\n suff=[arr[-1]]\r\n if(r>0):\r\n for i in range(n-2,-1,-1):\r\n suff.append(max(suff[-1],arr[i]))\r\n else:\r\n for i in range(n-2,-1,-1):\r\n suff.append(min(suff[-1],arr[i]))\r\n suff=suff[::-1]\r\n ans= float('-inf')\r\n for i in range(n):\r\n ans=max(ans, p*pref[i]+q*arr[i]+r*suff[i])\r\n print(ans)\r\n\r\n\r\n \r\n\r\n", "n, p, q, r = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nparr = [arr[0]*p]\r\nrarr = [0]*len(arr)\r\nrarr[-1] = arr[-1]*r\r\n\r\nfor i in range(1,len(arr)):\r\n parr.append(max(parr[i-1],p*arr[i]))\r\n \r\nfor i in range(len(arr)-2,-1,-1):\r\n rarr[i] = max(rarr[i+1],r*arr[i])\r\n\r\n\r\nans = float('-inf')\r\nfor i in range(0,len(arr)):\r\n ans = (max(ans, q*arr[i]+parr[i]+rarr[i]))\r\n \r\nprint(ans)\r\n\r\n", "n, p, q, r = map(int,input().split())\nl = list(map(int,input().split()))\ndp = [[0 for i in range(n)] for j in range(3)]\n\nfor i in range(3):\n for j in range(n):\n if i== 0:\n if j == 0:\n dp[i][j] = l[j]*p\n else:\n dp[i][j] = max(dp[i][j-1],l[j]*p)\n elif i == 1:\n if j==0:\n dp[i][j] = dp[i-1][j]+l[j]*q\n else:\n dp[i][j] = max(dp[i][j-1],dp[i-1][j]+l[j]*q)\n else:\n if j == 0:\n dp[i][j] = dp[i-1][j]+ l[j]*r\n else:\n dp[i][j] = max(dp[i][j-1],dp[i-1][j]+l[j]*r)\nprint(dp[-1][-1])\n", "n,p,q,r = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\n\r\ndp = [[-float(\"inf\") for i in range(n)] for j in range(3)]\r\ndp[0][0] = a[0]*p\r\ndp[1][0] = dp[0][0]+a[0]*q\r\ndp[2][0] = dp[1][0]+a[0]*r\r\n\r\nfor i in range(1,n):\r\n dp[0][i] = max(dp[0][i-1],p*a[i])\r\n dp[1][i] = max(dp[1][i-1],dp[0][i]+a[i]*q)\r\n dp[2][i] = max(dp[2][i-1],dp[1][i]+a[i]*r)\r\n\r\n\r\nprint(dp[2][n-1])", "def maxe(a,b):\r\n if a>b:\r\n return a\r\n elif a<b:\r\n return b\r\n else:\r\n return a\r\ndef pmmax(a,p):\r\n x=0\r\n a[x]=a[x]*p\r\n max=a[0]\r\n y=x+1\r\n cap=len(a)-1\r\n while y!=cap+1:\r\n \r\n max=maxe(max,p*a[y])\r\n a[y]=max\r\n y=y+1\r\n return a\r\ndef smmax(a,r):\r\n x=len(a)-1\r\n a[x]=a[x]*r\r\n max=a[x]\r\n y=x-1\r\n while y!=-1:\r\n max=maxe(max,r*a[y])\r\n a[y]=max\r\n y=y-1\r\n return a\r\ndef main():\r\n \r\n n,p,q,r= list(map(int,input().strip().split()))[:4]\r\n a=[]\r\n a= list(map(int,input().strip().split()))[:n]\r\n b=list(a)\r\n b=pmmax(b,p)\r\n\r\n\r\n\r\n c=list(a)\r\n\r\n\r\n c=smmax(c,r)\r\n\r\n start=0\r\n finish=len(a)-1\r\n max=(a[0])*p+(a[0])*q+(a[0])*r\r\n\r\n max=maxe(max,((a[finish])*p+(a[finish])*q+(a[finish])*r))\r\n\r\n\r\n\r\n st=1\r\n\r\n i=0\r\n\r\n while start!=finish:\r\n max=maxe(max,((a[start])*p+(a[start])*q+(a[start])*r))\r\n\r\n max=maxe(max,(a[start]*p+(a[start])*q+c[start+1]))\r\n if start!=0: \r\n max=maxe(max,(b[start-1]+(a[start])*q+(a[start])*r))\r\n max=maxe(max,(b[start-1]+(a[start])*q+c[start+1]))\r\n \r\n\r\n start=start+1\r\n\r\n print(max)\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,p,q,r = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nINF = float('inf')\r\na1,a2 = [-INF]*N,[-INF]*N\r\n\r\nfor i in range(N):\r\n if i==0:\r\n a1[i] = A[i]*p\r\n else:\r\n a1[i] = max(a1[i-1], A[i]*p)\r\nfor i in range(N-1,-1,-1):\r\n if i==N-1:\r\n a2[i] = A[i]*r\r\n else:\r\n a2[i] = max(a2[i+1], A[i]*r)\r\n\r\nans = -INF\r\nfor i in range(N):\r\n tmp = a1[i]+A[i]*q+a2[i]\r\n ans = max(ans, tmp)\r\nprint(ans)\r\n\r\n\r\n", "import copy\r\n\r\nNPQR = list(map(int, input().split()))\r\nn, p, q, r = NPQR\r\n\r\narr = list(map(int, input().split()))\r\n\r\nprefixMax = copy.deepcopy(arr)\r\n\r\n\r\nfor i in range(0,n):\r\n prefixMax[i] *= p\r\n\r\nfor i in range(1,n):\r\n if prefixMax[i]<prefixMax[i-1]:\r\n prefixMax[i] = prefixMax[i-1]\r\n\r\nsuffixMax = copy.deepcopy(arr)\r\n\r\nfor i in range(0,n):\r\n suffixMax[i] *= r\r\n\r\nfor i in range(n-2,-1,-1):\r\n if suffixMax[i]<suffixMax[i+1]:\r\n suffixMax[i] = suffixMax[i+1]\r\n\r\nAns = prefixMax[0] + (q*arr[0]) + suffixMax[0]\r\n\r\nfor i in range(1,n):\r\n Ans = max(Ans, prefixMax[i] + q*arr[i] + suffixMax[i])\r\n\r\nprint(Ans)", "n, p, q, r = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nx = -10e18\ny = -10e18\nz = -10e18\n\nfor i in a:\n x = max(x, p * i)\n y = max(y, x + q * i)\n z = max(z, y + r * i)\nprint(z)\n\t \t\t\t\t \t \t\t \t\t\t\t\t \t\t\t\t\t \t \t \t\t", "n, p, q, r = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ndp1 = [0] * n\nfor i in range(n):\n if i == 0:\n dp1[i] = p * a[i]\n else:\n dp1[i] = max(dp1[i-1], p * a[i])\n\ndp2 = [0] * n\nfor i in range(n):\n if i == 0:\n dp2[i] = p * a[i] + q * a[i]\n else:\n dp2[i] = max(q*a[i] + dp1[i], dp2[i-1])\n\nans = -float('inf')\nfor i in range(n):\n ans = max(ans, r * a[i] + dp2[i])\nprint(ans)\n\n \t\t \t\t\t\t\t\t\t\t\t \t \t\t\t \t\t \t\t \t", "\r\ninp1 = [int(x) for x in input().split()]\r\nsize = inp1[0]\r\np = inp1[1]\r\nq = inp1[2]\r\nr = inp1[3]\r\n\r\narray = [int(x) for x in input().split()]\r\n\r\npre_sum = [None] * len(array)\r\npre_sum[0] = p * array[0]\r\nsuf_sum = [None] * len(array)\r\nsuf_sum[len(array) - 1] = r * array[len(array) - 1]\r\n\r\nfor i in range(1, len(array)) :\r\n pre_sum[i] = max(p * array[i], pre_sum[i - 1])\r\n\r\nfor i in range(len(array) - 2, -1, -1) :\r\n suf_sum[i] = max(r * array[i], suf_sum[i + 1])\r\n\r\nanswer = None\r\nfor i in range(len(array)) :\r\n temp_answer = q * array[i] + pre_sum[i] + suf_sum[i]\r\n if answer == None :\r\n answer = temp_answer\r\n elif temp_answer > answer :\r\n answer = temp_answer\r\n\r\nprint(answer)", "import math\r\nn,p,q,r = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\npre_max = [0]*n\r\npre_max[0] = p*arr[0]\r\nsuff_max = [0]*n\r\nsuff_max[n-1] = r*arr[n-1]\r\nsumm = -math.inf\r\nfor i in range(1,n):\r\n\tpre_max[i] =max(pre_max[i-1],p*arr[i])\r\nfor i in range(n-2,-1,-1):\r\n\tsuff_max[i] =max(suff_max[i+1],r*arr[i])\r\nfor i in range(n):\r\n summ = max(summ,pre_max[i]+q*arr[i]+suff_max[i])\r\nprint(summ)", "str1 = input().split()\r\nstr2 = input().split()\r\n\r\n\r\np,q,r = int(str1[1]),int(str1[2]),int(str1[3])\r\nl1 = []\r\n\r\nfor i in str2:\r\n l1.append(int(i))\r\n\r\n# pMax and sMax\r\n\r\npMax = [0]*len(l1)\r\nsMax = [0]*len(l1)\r\n\r\npMax[0] = p*l1[0]\r\nsMax[-1] = r*l1[-1]\r\n\r\nfor i in range(1,len(l1)):\r\n pMax[i] = max(pMax[i-1],p*l1[i])\r\n\r\nfor i in range(len(l1)-2,-1,-1):\r\n sMax[i] = max(sMax[i+1],r*l1[i])\r\n\r\n\r\n# get the maximum \r\nans = float(\"infinity\")*-1\r\n\r\nfor i in range(len(l1)): # \r\n value = pMax[i] + q* l1[i] + sMax[i]\r\n ans = max(value,ans)\r\n\r\nprint(ans)\r\n\r\n", "n,p,q,r = input().split(\" \")\r\narr = input().split(\" \")\r\nn = int(n)\r\np = int(p)\r\nq = int(q)\r\nr = int(r)\r\narr = [int(x) for x in arr]\r\n# to finnd the sum of arr[i]+arr[j]+arr[k] = max where i<j<k\r\n\r\nprefix_max = []\r\nmaximum = float('-inf')\r\nfor i in range(len(arr)):\r\n prefix_max.append(max(maximum,p*arr[i]))\r\n maximum = prefix_max[-1]\r\n \r\nmaxi = float('-inf')\r\nsuffix_max = [1**x for x in range(len(arr))]\r\nfor i in range(len(arr)-1,-1,-1):\r\n suffix_max[i] = (max(r*arr[i],maxi))\r\n maxi = suffix_max[i]\r\n \r\n\r\n\r\nmax_len = [1 for x in range(len(arr))]\r\n\r\n\r\nfor j in range(len(arr)):\r\n max_len[j] = prefix_max[j]+q*arr[j]+suffix_max[j]\r\n\r\n\r\nprint((max(max_len)))\r\n \r\n", "n,p,q,r=map(int,input().split())\narr=[int(i) for i in input().split()]\n# leftmax=[arr[0]]\n# for i in range(1,len(arr)):\n# leftmax.append(max(leftmax[-1],arr[i]))\n# print(leftmax)\n# rightmax=[arr[-1]]\n# for i in range(len(arr)-2,-1,-1):\n# rightmax.append(max(rightmax[-1],arr[i]))\n# rightmax.reverse()\n# print(rightmax)\n# ans=float('-inf')\n# for i in range(1,len(arr)-1):\n# temp=(p*leftmax[i-1])+(q*arr[i])+(r*rightmax[i+1])\n# print(temp)\n# ans=max(ans,temp)\nparr=[arr[0]*p]\nfor i in range(1,len(arr)):\n val=max(arr[i]*p,parr[i-1])\n parr.append(val)\nqarr=[arr[0]*q+(p*arr[0])]\nfor i in range(1,len(arr)):\n val=max(qarr[i-1],(arr[i]*q)+(parr[i]))\n qarr.append(val)\nrarr=[(arr[0]*q)+(p*arr[0])+(r*arr[0])]\nfor i in range(1,len(arr)):\n val=max(rarr[i-1],r*arr[i]+qarr[i])\n rarr.append(val)\nprint(rarr[-1])", "n,p,q,r = [int(_) for _ in input().split()]\r\n\r\narr = [int(_) for _ in input().split()]\r\n\r\n\r\ndp = [[0]*3 for _ in range(100005)]\r\n\r\n\r\ndp[0][0] = arr[0]*p\r\n\r\nfor i in range(1,n):\r\n dp[i][0] = max(dp[i-1][0], (p*arr[i]))\r\n\r\ndp[0][1] = dp[0][0]+ arr[0]*q\r\nfor i in range(1,n):\r\n dp[i][1] = max(dp[i-1][1], dp[i][0]+ q*arr[i])\r\n\r\ndp[0][2] = dp[0][1] + arr[0]*r\r\n\r\nfor i in range(1,n):\r\n dp[i][2] = max(dp[i-1][2], dp[i][1] + arr[i]*r)\r\n\r\n\r\nprint(dp[n-1][2])", "n, p, q, r = map(int, input().split())\na = list(map(int, input().split()))\n\n\ndp = [ [ 0 for _ in range(3) ] for _ in range(n) ]\ndp[0][0] = p*a[0]\ndp[0][1] = dp[0][0] + q*a[0]\ndp[0][2] = dp[0][1] + r*a[0]\n\nfor it in range(1, n):\n dp[it][0] = max(dp[it-1][0], p*a[it])\n dp[it][1] = max(dp[it-1][1], dp[it][0] + q*a[it])\n dp[it][2] = max(dp[it-1][2], dp[it][1] + r*a[it])\n\nprint(dp[n-1][2])\n", "n,p,q,r = list(map(int, input().strip().split()))\r\narr = list(map(int, input().strip().split()))\r\nresult = float('-inf')\r\n\r\n\r\npreMax = [0]*n\r\npreMax[0] = p*arr[0]\r\n\r\nfor i in range(1, n):\r\n\tpreMax[i] = max(preMax[i-1], p*arr[i])\r\n\t\r\n\r\nsufMax = [0]*n\r\nsufMax[n-1] = r*arr[n-1]\r\n\r\nfor j in range(n-2,-1,-1):\r\n\tsufMax[j] = max(sufMax[j+1], r*arr[j])\r\n\t\r\nfor k in range(0,n):\r\n\tresult = max(result,((preMax[k]+(q*arr[k])+sufMax[k])))\r\nprint(result)\r\n\t", "import sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nn,p,q,r = map(int,input().split())\r\nl = list(map(int,input().split()))\r\na = -1e20\r\nb = -1e20\r\nc = -1e20\r\nfor i in l:\r\n a = max(a,i*p)\r\n b = max(b,a + i*q)\r\n c = max(c,b + i*r)\r\nprint(c)", "firstInput = input()\nsecondInput = input()\n\nn = int(firstInput.split()[0])\np = int(firstInput.split()[1])\nq = int(firstInput.split()[2])\nr = int(firstInput.split()[3])\n\narray = [int(x) for x in secondInput.split()]\ndp = [[],[],[]] \n\nfor i in range(len(array)):\n if (i>0):\n dp[0].append(max(dp[0][i-1], p*array[i]))\n else:\n dp[0].append(p*array[i])\nfor j in range(len(array)):\n if (j>0):\n dp[1].append(max(dp[1][j-1], dp[0][j]+q*array[j]))\n else:\n dp[1].append(dp[0][j]+q*array[j])\nfor k in range(len(array)):\n if (k>0):\n dp[2].append(max(dp[2][k-1], dp[1][k]+r*array[k]))\n else:\n dp[2].append(dp[1][k]+r*array[k])\n\nprint(dp[2][n-1])\n \t\t\t\t\t \t\t \t \t\t \t \t \t\t", "#Pre-computation problem\r\nn,p,q,r = map(int,input().split())\r\nli = list(map(int,input().split())) [:n]\r\n\r\nsuffix_max = []\r\nfor i in range(n):\r\n suffix_max.append(0)\r\nsuffix_max[-1]=r*li[-1]\r\nfor i in range(len(li)-2,-1,-1):\r\n if r*li[i]<suffix_max[i+1]:\r\n suffix_max[i]=suffix_max[i+1]\r\n else:\r\n suffix_max[i]=r*li[i]\r\n\r\nans = -1e20\r\ntp= -1e20\r\nfor i in range(n):\r\n tp=max(tp,p*li[i])\r\n ans = max(ans, tp + q*li[i] + suffix_max[i])\r\nprint(ans)", "def main():\n n, p, q, r = map(int, input().split())\n a = list(map(int, input().split()))\n \n dp = [[0] * n for _ in range(3)] #inicializar matriz\n \n for i in range(n): #iterar la matriz\n if i == 0:\n dp[0][0] = a[0] * p\n dp[1][0] = dp[0][0] + a[0] * q\n dp[2][0] = dp[1][0] + a[0] * r\n else:\n dp[0][i] = max(dp[0][i - 1], a[i] * p)\n dp[1][i] = max(dp[1][i - 1], dp[0][i] + a[i] * q)\n dp[2][i] = max(dp[2][i - 1], dp[1][i] + a[i] * r)\n \n print(dp[2][n - 1])\n\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t \t \t\t \t \t", "from collections import defaultdict\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(s)\ndef invr():\n return(map(int,input().split()))\n\n\nz = 1\n\nfor _ in range(z):\n\n [n, p, q, r] = inlt()\n l = inlt()\n\n dp = [float('-inf'), float('-inf'),float('-inf')]\n\n for i in range(n):\n val = l[i]\n\n if(p * val > dp[0]):\n dp[0] = p * val \n\n dp[1] = max(dp[1], q*val + dp[0])\n dp[2] = max(dp[2], dp[1] + r * val)\n\n print(dp[2])\n\n\n \n\n\n\n", "(n, p, q, r) = map(int, input().split())\r\n\r\nlst = []\r\nfor num in input().split():\r\n lst.append(int(num))\r\n\r\na = - 10 ** 20\r\nb = - 10 ** 20\r\nc = - 10 ** 20\r\n\r\nfor num in lst:\r\n a = max(a, num * p)\r\n b = max(b, a + num * q)\r\n c = max(c, b + num * r)\r\n\r\nprint(c)", "#Lecture3 Maximize the expression ~ Timestamp 1:39\r\n#using prefix and suffix max\r\nimport copy\r\n\r\nN = input()\r\nN = list(map(int, N.split(' ')))\r\n\r\nArr = input()\r\nArr = list(map(int, Arr.split(' ')))\r\n\r\np=N[1]\r\nq=N[2]\r\nr=N[3]\r\n\r\nprefixmax = [i*p for i in Arr]\r\n\r\nsuffixmax = [i*r for i in Arr]\r\n\r\n#print(\"prefix max is: \", prefixmax)\r\n\r\nfor i in range(1, N[0]):\r\n# print(\"prefix max is: \", prefixmax)\r\n if p*Arr[i] > prefixmax[i-1]:\r\n prefixmax[i] = p*Arr[i]\r\n else:\r\n prefixmax[i] = prefixmax[i-1]\r\n \r\n#print(\"prefix max is: \", prefixmax)\r\n\r\n#print(\"suffix max is: \", suffixmax)\r\n\r\nfor i in range(N[0]-2,-1,-1):\r\n# print(\"suffix max is: \", suffixmax)\r\n if r*Arr[i] > suffixmax[i+1]:\r\n suffixmax[i] = r*Arr[i]\r\n else:\r\n suffixmax[i] = suffixmax[i+1]\r\n\r\n#print(\"suffix max is: \", suffixmax)\r\n\r\n#print(\"Arr = : \", Arr)\r\n\r\nMAX = list()\r\n\r\nfor i in range(0,len(Arr)):\r\n# print(prefixmax[i]+q*Arr[i]+suffixmax[i])\r\n MAX.append(prefixmax[i]+q*Arr[i]+suffixmax[i])\r\n\r\nprint(max(MAX))" ]

[ "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom bisect import *\r\n\r\nN,K = map(int, input().split())\r\nR = list(map(int, input().split()))\r\n\r\nA = sorted(R)\r\n\r\nP = [[] for _ in range(N)]\r\nfor _ in range(K):\r\n u,v = map(int, input().split())\r\n u-=1;v-=1\r\n P[u].append(R[v])\r\n P[v].append(R[u])\r\n \r\nans = []\r\nfor i in range(N):\r\n p = P[i]\r\n p.sort()\r\n idx = bisect_left(p, R[i])\r\n tmp = bisect_left(A, R[i])\r\n ans.append(tmp-idx)\r\n \r\nprint(*ans)", "# https://codeforces.com/contest/978\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k = map(int, input().split())\nr = list(map(int, input().split()))\nxy = [tuple(map(lambda x: int(x) - 1, input().split())) for _ in range(k)]\n\nidx = sorted(range(n), key=lambda i: r[i])\n\nans = [0] * n\nduplicate = 0\nfor i in range(1, n):\n if r[idx[i]] == r[idx[i - 1]]:\n ans[idx[i]] = ans[idx[i - 1]]\n duplicate += 1\n else:\n ans[idx[i]] = ans[idx[i - 1]] + 1 + duplicate\n duplicate = 0\n\nfor x, y in xy:\n if r[x] < r[y]:\n ans[y] -= 1\n elif r[x] > r[y]:\n ans[x] -= 1\n\nprint(*ans)\n", "import sys\r\nfrom math import sqrt, gcd, factorial, ceil, floor, pi, inf\r\nfrom collections import deque, Counter, OrderedDict\r\nfrom heapq import heapify, heappush, heappop\r\n#sys.setrecursionlimit(10**6)\r\n#from functools import lru_cache\r\n#@lru_cache(None)\r\n\r\n#======================================================#\r\ninput = lambda: sys.stdin.readline()\r\nI = lambda: int(input().strip())\r\nS = lambda: input().strip()\r\nM = lambda: map(int,input().strip().split())\r\nL = lambda: list(map(int,input().strip().split()))\r\n#======================================================#\r\n\r\n#======================================================#\r\ndef primelist():\r\n L = [False for i in range((10**10)+1)]\r\n primes = [False for i in range((10**10)+1)]\r\n for i in range(2,(10**10)+1):\r\n if not L[i]:\r\n primes[i]=True\r\n for j in range(i,(10**10)+1,i):\r\n L[j]=True\r\n return primes\r\ndef isPrime(n):\r\n p = primelist()\r\n return p[n]\r\n#======================================================#\r\ndef bst(arr,x):\r\n low,high = 0,len(arr)-1\r\n ans = -1\r\n while low<=high:\r\n mid = (low+high)//2\r\n if arr[mid]==x:\r\n return mid\r\n elif arr[mid]<x:\r\n ans = mid\r\n low = mid+1\r\n else:\r\n high = mid-1\r\n return ans\r\n \r\n \r\ndef factors(x):\r\n l1 = []\r\n l2 = []\r\n for i in range(1,int(sqrt(x))+1):\r\n if x%i==0:\r\n if (i*i)==x:\r\n l1.append(i)\r\n else:\r\n l1.append(i)\r\n l2.append(x//i)\r\n for i in range(len(l2)//2):\r\n l2[i],l2[len(l2)-1-i]=l2[len(l2)-1-i],l2[i]\r\n return l1+l2\r\n#======================================================#\r\n\r\nn,k =M()\r\na = L()\r\nb = [0 for i in range(n)]\r\nfor _ in range(k):\r\n x,y = M()\r\n if a[x-1]<a[y-1]:\r\n b[y-1]-=1\r\n elif a[x-1]>a[y-1]:\r\n b[x-1]-=1\r\np = [[a[i],i] for i in range(n)]\r\np.sort()\r\ni=1\r\nwhile i<n:\r\n if p[i][0]==p[i-1][0]:\r\n i+=1\r\n else:\r\n break\r\nj=i-1\r\nwhile i<n:\r\n if p[i][0]!=p[i-1][0]:\r\n j=i-1\r\n b[p[i][1]]+=j+1\r\n i+=1\r\nprint(*b)\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n,k = map(int, input().split())\r\nr = list(map(int, input().split()))\r\npairs = []\r\nfor i in range(k):\r\n pairs.append(list(map(int, input().split())))\r\n#ans[i] = (#smaller elements) - (#quarrels with smaller elements)\r\nquarrel = []\r\nfor i in range(len(r)):\r\n quarrel.append([])\r\nfor i in pairs:\r\n quarrel[i[0]-1].append(r[i[1]-1])\r\n quarrel[i[1]-1].append(r[i[0]-1])\r\nquarrelSmallerCnt = [0] * len(r)\r\nfor i in range(len(quarrel)):\r\n for j in quarrel[i]:\r\n if(j < r[i]):\r\n quarrelSmallerCnt[i] += 1\r\nidxDict=dict()\r\nfor i in range(len(r)):\r\n if(r[i] not in idxDict.keys()):\r\n idxDict[r[i]] = []\r\n idxDict[r[i]].append(i)\r\nsmallerThan = [0]*len(r)\r\nunique = sorted(list(set(r)))\r\ncurr = 0\r\nfor i in range(len(unique)):\r\n for j in idxDict[unique[i]]:\r\n smallerThan[j] = curr\r\n curr += len(idxDict[unique[i]])\r\nans = []\r\nfor i in range(len(r)):\r\n ans.append(smallerThan[i] - quarrelSmallerCnt[i])\r\nprint(*ans)\r\n\r\n ", "import bisect\r\n\r\n\r\n\r\n\r\n[n,k]=list(map(int, input().split(' ')))\r\np=list(map(int, input().split(' ')))\r\nr=sorted(p)\r\ny=[[p[i],i] for i in range (0,n)]\r\nans=[0]*n\r\nfor i in range (0,n):\r\n u=bisect.bisect_left(r,p[i])\r\n ans[i]=u\r\n\r\nfor i in range (0,k):\r\n x=list(map(int, input().split(' ')))\r\n a=x[0]-1\r\n b=x[1]-1\r\n if p[a]<p[b]:\r\n ans[b]-=1\r\n elif p[a]>p[b]:\r\n ans[a]-=1\r\n\r\nfor i in range (0,n):\r\n print(ans[i],end=' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\n\na = list(map(int, input().split()))\nb = sorted(a)\n\nd = {}\ns = 0\nfor i in range(n):\n if b[i] not in d:\n d[b[i]] = s\n\n s += 1\n\nsol = [d[a[i]] for i in range(n)]\n\nfor i in range(k):\n x, y = map(int, input().split())\n\n if d[a[x-1]] > d[a[y-1]]:\n sol[x-1] -= 1\n elif d[a[y-1]] > d[a[x-1]]:\n sol[y-1] -= 1\n\nprint(*sol)\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\nl = [[int(x), i] for i, x in enumerate(y)]\r\nl.sort()\r\nvals = {}\r\nadj = [[] for _ in range(n)] \r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n adj[a].append(b)\r\n adj[b].append(a)\r\nfor i in range(n): \r\n if l[i][0] in vals:\r\n vals[l[i][0]] += 1\r\n else:\r\n vals[l[i][0]] = 1\r\nvals = list(vals.values())\r\n\r\nans = [0] * n\r\nnum = 0\r\nprev = l[0][0]\r\nc = 0\r\nfor i, j in l:\r\n if prev != i:\r\n num += vals[c]\r\n c += 1\r\n sub = 0\r\n for x in adj[j]:\r\n if y[x] < i:\r\n sub += 1\r\n ans[j] = num - sub\r\n prev = i\r\nprint(*ans)", "import bisect\nt = 1\n\nfor _ in range(t):\n n,m = map(int,input().split())\n \n arr = list(map(int,input().split()))\n arr2 = sorted(arr)\n \n queries = []\n for _ in range(m):\n a,b = map(int,input().split())\n queries.append([a,b])\n res = [0]*n\n \n for i,ele in enumerate(arr):\n ind = bisect.bisect_left(arr2,ele)\n \n if arr2[ind] == ele:\n ind -= 1\n\n res[i] = max(0,ind+1)\n \n for q in queries:\n a,b = q\n a-=1\n b-=1\n if arr[a]< arr[b]:\n res[b] -= 1\n elif arr[a] > arr[b]:\n res[a] -= 1\n \n for r in res:\n print(r,end=' ') \n \n ", "import sys\r\ninput = sys.stdin.readline\r\nimport bisect\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nq = sorted(w)\r\nd = [[] for i in range(n)]\r\nfor i in range(k):\r\n a, b = map(lambda x:int(x)-1, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\n\r\nfor i in range(n):\r\n x = bisect.bisect_left(q, w[i])\r\n for j in d[i]:\r\n if w[j] < w[i]:\r\n x -= 1\r\n print(max(x, 0), end=' ')", "n ,m =(map (int, input().split(' ')) )\r\narr = list (map (int, input().split(' ')) )\r\nprogrammer = [ [arr[i],i ] for i in range (n)] \r\nans = [0 for _ in range (n) ] \r\nfor _ in range (m) :\r\n x ,y =(map (int, input().split(' ')) ) \r\n if arr[x-1] > arr[y-1] :\r\n ans[x-1] -=1\r\n if arr[x-1] < arr[y-1] :\r\n ans[y-1] -=1 \r\nprogrammer.sort() \r\nind = 1\r\nprev = programmer[0][0] \r\nleade = [ 0 for _ in range (n+5)]\r\n\r\nfor i in range (n) :\r\n if programmer[i][0] > prev: \r\n ind +=1 \r\n prev = programmer[i][0]\r\n programmer[i][0] = ind \r\n leade[ind+1] +=1 \r\nfor i in range (1,n+2) :\r\n leade[i] += leade[i-1] \r\nres = [ 0 for _ in range (n)]\r\nfor i in range (n) : \r\n res [programmer[i][1] ] = (leade[programmer[i][0]] + ans [programmer[i][1]])\r\n\r\nprint (*res,sep=' ')", "from bisect import *\r\nR=lambda: map(int,input().split())\r\nn,k=R()\r\nr=list(R())\r\nh=sorted(r)\r\nt=[bisect_left(h,x)for x in r]\r\nfor i in range(k):\r\n a,b=R()\r\n a-=1;b-=1\r\n if r[a]>r[b]:t[a]-=1\r\n elif r[a]<r[b]:t[b]-=1\r\nprint(*t)\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nres = [0] * n\r\nd = defaultdict(lambda: set())\r\n\r\nfor _ in range(k):\r\n x, y = map(int, input().split())\r\n x -= 1\r\n y -= 1\r\n\r\n d[x].add(y)\r\n d[y].add(x)\r\n\r\nlst = []\r\nfor i, v in enumerate(arr):\r\n lst.append((v, i))\r\n\r\nlst.sort()\r\n\r\nidx = 0\r\n\r\nfor i in range(n):\r\n while lst[idx][0] < lst[i][0]:\r\n idx += 1\r\n res[lst[i][1]] = idx\r\n\r\n for v in d[lst[i][1]]:\r\n if arr[v] < arr[lst[i][1]]:\r\n res[lst[i][1]] -= 1\r\n\r\nprint(*res)", "from collections import defaultdict\r\nimport bisect\r\nn,k = map(int, input().split())\r\nnums = [int(x) for x in input().split()]\r\n\r\n\r\nminus = defaultdict(int)\r\nfor _ in range(k):\r\n p1, p2 = [int(x)-1 for x in input().split()]\r\n if nums[p1] > nums[p2]:\r\n minus[p1]+=1\r\n elif nums[p2] > nums[p1]:\r\n minus[p2]+=1\r\n\r\nans = [0]*n\r\n\r\ncombined = []\r\nfor i in range(n):\r\n combined.append([nums[i], minus[i], i])\r\n\r\ncombined.sort()\r\nskills = []\r\ntmp = []\r\nfor i in range(n):\r\n skills.append(combined[i][0])\r\n tmp.append([combined[i][1], combined[i][2]])\r\n\r\nfor i in range(n):\r\n skill = skills[i]\r\n\r\n amt = bisect.bisect_left(skills, skill)\r\n\r\n amt-=tmp[i][0]\r\n\r\n idx = tmp[i][1]\r\n ans[idx] = amt\r\n\r\nprint(*ans)\r\n\r\n\r\n\r\n\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\nN,M = map(int,input().split())\nA = list(map(int,input().split()))\nP = [[] for _ in range(N)]\n\nfor _ in range(M):\n a,b = map(int,input().split())\n P[a-1].append(A[b-1])\n P[b-1].append(A[a-1])\n\nfor i in range(N):P[i].sort()\nA1 = sorted(A)\nans = []\nfor i in range(N):\n a = bisect_left(A1,A[i])\n b = bisect_left(P[i],A[i])\n ans.append(a-b)\nprint(*ans)", "# https://codeforces.com/contest/978\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k = map(int, input().split())\nr = list(map(int, input().split()))\n\nans = [0] * n\n\nidx = sorted(range(n), key=lambda i: r[i])\nduplicate = 0\nfor i in range(1, n):\n if r[idx[i]] == r[idx[i - 1]]:\n ans[idx[i]] = ans[idx[i - 1]]\n duplicate += 1\n else:\n ans[idx[i]] = ans[idx[i - 1]] + 1 + duplicate\n duplicate = 0\n\nfor _ in range(k):\n x, y = map(lambda x: int(x) - 1, input().split())\n if r[x] < r[y]:\n ans[y] -= 1\n elif r[x] > r[y]:\n ans[x] -= 1\n\nprint(*ans)\n", "f = lambda: map(int, input().split())\r\nn, m = f()\r\nr = list(f())\r\ns = [0] * n\r\np = sorted((a, i) for i, a in enumerate(r))\r\nfor k in range(n):\r\n a, i = p[k]\r\n b, j = p[k - 1]\r\n s[i] = s[j] if a == b else k\r\nfor i in range(m):\r\n a, b = f()\r\n a -= 1\r\n b -= 1\r\n s[a] -= r[a] > r[b]\r\n s[b] -= r[b] > r[a]\r\nprint(*s)", "n, k=[int(v) for v in input().split()]\r\nw=[int(v) for v in input().split()]\r\nz=[]\r\nq={}\r\nfor j in range(k):\r\n z.append([int(v) for v in input().split()])\r\n if z[-1][0]-1 in q:\r\n q[z[-1][0]-1].append(z[-1][1]-1)\r\n else:\r\n q[z[-1][0]-1]=[z[-1][1]-1]\r\n if z[-1][1]-1 in q:\r\n q[z[-1][1]-1].append(z[-1][0]-1)\r\n else:\r\n q[z[-1][1]-1]=[z[-1][0]-1]\r\neta=[(w[j], j) for j in range(n)]\r\neta.sort()\r\n#print(eta)\r\n#print(q)\r\nres=[0 for j in range(n)]\r\nfor j in range(n):\r\n if eta[j][1] in q:\r\n for k in q[eta[j][1]]:\r\n if w[k]>w[eta[j][1]]:\r\n res[k]-=1\r\n\r\nlast=0\r\nfor j in range(n):\r\n res[eta[j][1]]+=last\r\n if j!=n-1 and (eta[j+1][0]>eta[j][0]):\r\n last=j+1\r\nres=[max(0, x) for x in res]\r\nprint(\" \".join([str(k) for k in res]))", "import os\r\nimport sys\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom math import gcd, floor, ceil, sqrt\r\nfrom copy import deepcopy\r\nfrom itertools import permutations, combinations, product\r\nfrom bisect import bisect_left, bisect_right\r\nfrom functools import lru_cache, reduce\r\nimport operator\r\n\r\n# Para mejorar el rendimiento de la entrada/salida\r\ninput = lambda: sys.stdin.readline().strip()\r\nflush = lambda: sys.stdout.flush()\r\nprint = lambda *args, **kwargs: sys.stdout.write(' '.join(map(str, args)) + kwargs.get(\"end\", \"\\n\")) and flush()\r\n\r\n# Optimización de la recursión para Python\r\nsys.setrecursionlimit(100000)\r\n\r\n\r\n# Funciones para lectura de múltiples tipos de datos\r\ndef ints(): return map(int, input().split())\r\ndef strs(): return input().split()\r\ndef chars(): return list(input().strip())\r\ndef mat(n): return [list(ints()) for _ in range(n)] # Matriz de n x m donde m es el número de enteros en una línea\r\n\r\n\r\n# Constantes útiles\r\nINF = float('inf')\r\nMOD = 1000000007 # Modulo por defecto, cambiar si se necesita otro\r\n\r\n\r\n# Algunas funciones útiles\r\ndef add(x, y, mod=MOD): return (x + y) % mod\r\ndef sub(x, y, mod=MOD): return (x - y) % mod\r\ndef mul(x, y, mod=MOD): return (x * y) % mod\r\n\r\n\r\n# Fast power - a^b % mod\r\ndef powmod(a, b, mod=MOD):\r\n res = 1\r\n a = a % mod\r\n while b > 0:\r\n if b % 2:\r\n res = mul(res, a, mod)\r\n a = mul(a, a, mod)\r\n b //= 2\r\n return res\r\n\r\n\r\n# Inverso multiplicativo de a modulo m (cuando m es primo)\r\ndef invmod(a, mod=MOD): return powmod(a, mod - 2, mod)\r\n\r\n\r\n# GCD y LCM\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\n\r\n# Factorial con memoización\r\n@lru_cache(maxsize=None)\r\ndef factorial(n): return n * factorial(n - 1) if n else 1\r\n\r\n\r\n# Combinaciones con memoización (nCr)\r\n@lru_cache(maxsize=None)\r\ndef comb(n, r):\r\n if r == 0 or r == n: return 1\r\n return comb(n - 1, r - 1) + comb(n - 1, r)\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n habilidades = list(map(int, input().split()))\r\n peleas = [tuple(map(int, input().split())) for _ in range(k)]\r\n resultado = solve(n, k, habilidades, peleas)\r\n print(\" \".join(map(str, resultado)))\r\n\r\n\r\ndef solve(n, k, habilidades, peleas):\r\n programadores = [(hab, i) for i, hab in enumerate(habilidades)]\r\n programadores.sort(reverse=True)\r\n resultado = [0] * n\r\n peleas_dict = {i: set() for i in range(n)}\r\n for x, y in peleas:\r\n peleas_dict[x - 1].add(y - 1)\r\n peleas_dict[y - 1].add(x - 1)\r\n mapper = {}\r\n for i in range(0, n):\r\n mapper[programadores[i][0]] = i\r\n\r\n for i in range(n):\r\n resultado[programadores[i][1]] = n - mapper[programadores[i][0]] - 1\r\n\r\n for i in range(n):\r\n for j in peleas_dict[programadores[i][1]]:\r\n\r\n if programadores[i][0] > habilidades[j]:\r\n resultado[programadores[i][1]] -= 1\r\n\r\n return resultado\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\r\n\r\n", "import bisect\n\nN, K = map(int, input().split())\nA = list(map(int, input().split()))\nB = sorted(A)\n\nconflict_below = [0] * N\nfor _ in range(K):\n u, v = map(int, input().split())\n u, v = u - 1, v - 1\n if A[u] < A[v]:\n conflict_below[v] += 1\n elif A[v] < A[u]:\n conflict_below[u] += 1\n\ndef query(i):\n return bisect.bisect_left(B, A[i]) - conflict_below[i]\n\n\nprint(*[query(i) for i in range(N)])", "import bisect\n\n\ndef solve():\n n, k = (int(x) for x in input().split())\n skills = [int(x) for x in input().split()]\n assert len(skills) == n\n quarrel_student_num = [0] * n\n for _ in range(k):\n p1, p2 = (int(x) - 1 for x in input().split())\n skill_1, skill_2 = skills[p1], skills[p2]\n if skill_1 < skill_2:\n quarrel_student_num[p2] += 1\n elif skill_1 > skill_2:\n quarrel_student_num[p1] += 1\n else:\n pass # skill_1 == skill_2\n\n # print(quarrel_student_num)\n sorted_skill = sorted(skills)\n students = []\n for i in range(n):\n skill_i = skills[i]\n students_num = bisect.bisect_left(sorted_skill, skill_i)\n students.append(students_num - quarrel_student_num[i])\n\n print(*students)\n\n\nsolve()\n\n \t\t \t\t \t\t \t\t \t \t \t\t", "from bisect import *\nR = lambda: map(int, input().split())\n\nn, k = R()\n\nr = list(R())\nh = sorted(r)\nt = [bisect_left(h, x) for x in r]\nfor i in range(k):\n a, b = R()\n a -= 1; b -= 1\n if r[a] > r[b]: t[a] -= 1\n elif r[a] < r[b]: t[b] -= 1\n\nprint(*t)\n\t \t\t \t \t\t\t \t\t\t\t \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, k = map(int, input().split())\r\n ratings = list(map(int, input().split()))\r\n\r\n ans = [0] * n\r\n for _ in range(k):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n\r\n if ratings[a] < ratings[b]:\r\n ans[b] -= 1\r\n elif ratings[b] < ratings[a]:\r\n ans[a] -= 1\r\n\r\n A = sorted(ratings)\r\n for i in range(n):\r\n target = ratings[i]\r\n pos = bisect_left(A, target)\r\n ans[i] += pos\r\n\r\n print(*ans)\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "# n = int(input())\r\n# words = [input() for i in range(n)]\r\n# def shorter(word):\r\n# if len(word) <= 10:\r\n# return word\r\n# else:\r\n# return word[0] + str(len(word)-2) + word[-1]\r\n\r\n# for i in words:\r\n# print(shorter(i))\r\n\r\n\r\n# n = int(input())\r\n# sol = [input().split(\" \") for i in range(n)]\r\n# soln = 0\r\n# for item in sol:\r\n# if item.count(\"1\")>=2:\r\n# soln += 1\r\n# print(soln)\r\n\r\n\r\n# n, k = input().split(\" \")\r\n# score = input().split(\" \")\r\n# count = 0\r\n# for i in score:\r\n# if int(i) >= int(score[int(k) - 1]) and int(i) != 0:\r\n# count+=1\r\n# print(count)\r\n\r\n\r\nm, n = list(map(int,input().split(\" \")))\r\nprint(m*n//2)", "height, width = map(int, input().split())\r\nprint(int ((height * width) / 2))", "m, n = map(int, input().split())\r\nif ((int(m) * int(n)) % 2) == 0:\r\n y = ((int(m) * int(n) * 0.5))\r\n print(int(y))\r\nelif((int(m) * int(n)) % 2) == 1:\r\n y = (((int(m) * int(n)) - 1) * 0.5)\r\n print(int(y))\r\n", "a,b = [int(asdf) for asdf in input().split()]\r\nprint(a*b//2)", "m,n = input().split(' ')\nnum = int(m)*int(n)\nprint(int(num/2))", "M, N = map(int, input().split())\n\nfair_valid = int(M / 2) * N\n\nsides = (M % 2) * int(N / 2)\n\nprint(fair_valid + sides)", "size = input(\"\")\r\nsizz = size.split(\" \")\r\nspace = int(sizz[0])*int(sizz[1])\r\nprint(int(space/2))", "from tkinter import N\r\n\r\n\r\nm,n = list(map(int, input().split()))\r\nt= m*n\r\nc=0\r\nif n%2==0:\r\n c= n/2*m\r\nelif m%2==0:\r\n c= m/2*n\r\nelse:\r\n c= ((m-1)/2*n)+ (n-1)/2\r\nprint(int(c))", "first_multiple_input = input().rstrip().split()\r\nn = int(first_multiple_input[0])\r\nk = int(first_multiple_input[1])\r\nprint(n*k//2)", "val = [int(x) for x in input().split()]\r\nprint((val[0] * val[1])//2 if val[0]*val[1] % 2 == 0 else ((val[0]*val[1]) - 1)//2)", "if __name__ == '__main__':\r\n s = input()\r\n l = list(map(int, s.split()))\r\n print(l[0] * l[1] // 2)\r\n", "m,n=map(int,input().split())\r\na=m/2\r\nb=n/1\r\nc=a*b\r\nprint(int(c))", "m,n = map(int,input().split())\r\nd = m*n\r\nprint(d//2)", "m, n = [int(i) for i in input().split()]\r\nx = 2\r\nS = n * m\r\ns = 0\r\n\r\nprint(S // x)", "import sys\r\nimport bisect\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef yes():\r\n print(\"YES\")\r\n\r\n\r\ndef no():\r\n print(\"NO\")\r\n\r\n\r\nm, n = map(int, input().split())\r\ns = m * n\r\nprint(s // 2)", "m, n = [*open(0)][0].split();print(int(m)*int(n) // 2)", "x,y=map(int,input().split());\nsum=int(x*y/2);\nprint(sum);\n'''rrewtgwrfffffhgggtrjgrtghtghr'''\n\t \t \t \t\t\t\t\t\t \t\t \t \t \t \t \t\t\t", "m,n = map(int,input().split())\r\naria = m * n\r\nif aria %2 != 0:\r\n aria-=1\r\nprint(int(aria/2))", "M, N = map(int, input().split())\r\nif M > N:\r\n M, N = N, M\r\nmax_dominos = (M * N) // 2\r\nprint(max_dominos)\r\n", "m, n = map(int, input().split())\r\nif m == 1 and n == 1:\r\n print(0)\r\nelse:\r\n t=int(m * n) // 2\r\n print(t)", "m,n= map(int,input().split())\narea=m*n\nno_of_squares=area//2\nprint(no_of_squares)\n\n \t\t\t \t \t\t \t\t \t \t \t", "m, n= map(int,input().split())\r\ntotal = int(m*n / 2)\r\nprint(total)", "n, m = map(int, input().split())\r\nimport math\r\nprint(math.floor(n*m*0.5))", "import math\r\n\r\nip = input()\r\n\r\nnum = ip.split(\" \")\r\n\r\nl = int(num[0])\r\nb = int(num[1])\r\n\r\nop = math.floor((l * b) / 2)\r\n\r\nprint(op)\r\n", "n, m = map(int, input().split())\r\ncount = 0\r\nstop = m*n\r\nwhile stop >1:\r\n stop -= 2\r\n count += 1\r\nprint(count)", "a, b = map(int, input().split())\r\nmul = a * b\r\nprint(mul//2)\r\n", "m, n = map(int, input().split(' '))\r\nmaxNoOfDominos = m*n // 2\r\nprint(maxNoOfDominos)", "from math import floor\r\nm,n=map(int,input().split())\r\nk=(m*n)/2\r\nprint(floor(k))", "a,b=[int(x) for x in input().split()]\r\nd=int(a*b/2)\r\nprint(d)", "a = map(int, input().split())\r\ndata = list(a)\r\nprint (int(data[0] * data[1] / 2)) if (data[0] % 2 == 0 or data[1] % 2 == 0) \\\r\n else print (int((data[0] * data[1] - 1) / 2))", "m,n = (input().split())\r\narea = int(m)*int(n)\r\nprint(int(area/2))", "m,n = map(int,input().split())\r\nx = m*n\r\nprint(x//2)", "l,m = map(int, input().split())\r\n\r\nif l%2 == 0 or m %2 == 0:\r\n print((l//2) * m if l%2 == 0 else (m//2) * l)\r\nelse:\r\n print((max(m, l) - 1)//2 * min(m, l) + min(m, l) //2)\r\n", "m,n=map(int,input().split())\r\nk=n*m//2\r\nprint(k)", "from math import floor\r\nm,n=map(int,input().split())\r\narea=m*n\r\nprint(floor(area/2))", "n=input().split()\nprint(int(int(n[0])*int(n[1])/2))", "a,b=map(int,input().split())\r\nif a%2==0 or b%2==0:\r\n res=(a*b)//2\r\nelse:\r\n res=(a*b-1)//2\r\nprint(res)", "n,m=map(int,input().split())\r\nf=n*m\r\nr=int(f/2)\r\nprint(r)", "n = input()\r\nn = n.split()\r\nl = int(n[0])*int(n[1])\r\nplates = int(l / 2)\r\nprint(plates)", "m, n = list(int(num) for num in input().split(\" \"))\nsquares = m * n\nnumber = squares - (squares % 2)\nnumber = int(number / 2)\nprint(number)\n\t \t \t\t \t\t \t \t\t \t\t \t\t\t\t \t\t\t", "x = list(map(int,input().strip().split()))\r\na = x[0]\r\nb = x[1]\r\n\r\nif a%2==0 or b%2==0:\r\n print(int(a*b/2))\r\nif a%2!=0 and b%2!=0:\r\n print(int(((a-1)*b/2)+(b-1)/2))", "m, n = input().split()\r\nboard = int(m) * int(n)\r\nprint(int(board / 2))", "m,n=list(map(int,input().split()))\r\nans=(m*n)//2\r\nprint(ans) ", "c,d=map(int,input().split())\ns=c*d/2\nprint(int(s))\n \t \t \t\t\t\t\t\t \t\t \t \t\t \t \t \t\t\t \t", "M,N=input().split()\r\nm,n=int(M),int(N)\r\nprint(int(m*n//2))", "import math\nM,N = map(int, input().split()) # M = 9, N = 11\nvalue2 = 0\n\nvalue1 = math.floor(int(N)/2)*M\nif N%2 == 1:\n value2 = math.floor(int(M)/2)\n\nprint(f\"{value1+value2}\")", "n, m = [int(num) for num in input().split(\" \", 1)]\r\nprint(int((n * m) / 2))", "import math as mt\r\n\r\n[m, n] = input().split(\" \")\r\narea = int(m) * int(n)\r\n\r\nprint(mt.floor(area/2))", "w, l = map(int, input().split())\r\nprint(int((w * l) / 2))\r\n", "def domino_piling(m,n):\r\n if n % 2 ==0 and m % 2 ==0:\r\n print((n//2) * m)\r\n elif n % 2 == 0 :\r\n print((n//2) * m)\r\n elif m % 2 == 0 :\r\n print((m//2) * n)\r\n else:\r\n print(((n//2) * m) + m//2)\r\n\r\n\r\nn,m = map(int,input().split())\r\ndomino_piling(m,n)", "m,n=[int(x) for x in input().split()]\r\nprint(int(m*n//2))", "\"\"\"Each domino completely covers two squares. No two dominoes overlap.\nFind the maximum number of dominoes,\"\"\"\n\nx,y=map(int,input().split())\ns=x*y/2\nprint(int(s))\n\t \t \t\t \t \t \t\t\t \t\t \t \t \t", "x, y = input().split()\r\nx, y = int(x), int(y)\r\ntotal = x//2*y\r\nif x % 2 != 0:\r\n total += y//2\r\nprint(total)", "m, n = input().split()\r\n\r\nm = int(m)\r\nn = int(n)\r\n\r\nresult = int((m*n)/2)\r\n\r\nprint(result)", "# Domino piling (50A)\r\nm,n = map(int, input().split())\r\nprint((m*n)//2)", "def domino_piling(m, n):\n return m * n // 2\n\n\nif __name__ == \"__main__\":\n m, n = map(int, input().split())\n print(domino_piling(m, n))\n", "a = list(map(int,input().split(\" \")))\r\nb = a[0]\r\nc = a[1]\r\nd = b * c\r\nprint(d // 2)", "m,n=[int(x) for x in input(\"\").split()]\r\nk=m*n\r\nif 1<=m<=n<=16:\r\n a=k//2 \r\n print(a)", "m, n = map(int, input().split())\r\nif min(n, m) % 2 != 0:\r\n print(max(n, m)*(min(n,m)//2)+(max(n,m)//2))\r\nelse:\r\n print(max(n, m)*(min(n,m)//2))\r\n ", "m,n=map(int,input().split())\r\nd=(m*n)//2\r\nprint(d)", "from math import floor\r\nn, k = map(int, input().split())\r\nprint(floor((n*k)/2))", "data = input().split()\r\nm = int(data[0])\r\nn = int(data[1])\r\n\r\nprint(m * n // 2)", "m,n=map(int,input().split())\r\na=m*n\r\nprint(a//2)\r\n", "a,b=map(int,input().split())\r\nr=int(a*b)\r\nprint(int(r/2))", "M,N=map(int,input().split())\r\nif M%2==1 and N%2==1:\r\n n=((M-1)*N/2)+(N-1)/2\r\n print(int(n))\r\nelse:\r\n print(int(M*N/2))\r\n", "import math\r\n\r\nnum = input().split(' ')\r\nn = int(num[0])\r\nk = int(num[1])\r\n\r\nprint(math.floor(n*k/2))", "x,y = map(int,input().split())\n\narea = x*y\nans = area//2\n\nprint(ans)\n", "input_line = [int(a) for a in input().split(\" \")]\r\nn = input_line[0]\r\nm = input_line[1]\r\nprint((n*m)//2)", "dominos_m, dominos_n = map(int, input().split())\r\nprint(dominos_m * dominos_n // 2)\r\n", "a = list(map(int,input().split()))\r\nprint((a[0]*a[1])//2)\r\n", "line = input().split(' ')\r\n\r\nn = int(line[0])\r\nm = int(line[1])\r\n\r\nsize = n * m\r\n\r\nused = 0\r\ncon = True\r\n\r\n\r\nwhile(con):\r\n if(size < 2):\r\n con = False;\r\n break\r\n else:\r\n size = size - 2\r\n used = used + 1\r\n\r\nprint(used)", "m,n=map(int,input().split())\r\nres=0\r\nif(int(m%2)==0):\r\n res=n*(m//2)\r\nelse:\r\n if(int(n%2)==0):\r\n res=m*(n//2)\r\n else:\r\n res=(n*(m//2))+(n//2)\r\nprint(res)", "_, __ = map(int, input().split())\r\nprint((_ * __) // 2)", "m, n = map(int, input().split())\r\nif m >= 1 and n >= m and n <= 16:\r\n if (n == m and n % 2 == 0) or (n != m and n % 2 == 0):\r\n print((n//2)*m)\r\n if (n == m and n % 2 != 0) or (n % 2 != 0 and m % 2 != 0 and n != m):\r\n print(((n*m)-1)//2)\r\n if n != m and n % 2 != 0 and m % 2 == 0:\r\n print((m//2)*n)", "board = input()\r\nrboard = board.split()\r\nm,n = rboard\r\nprint((int(m)*int(n))//2)", "\r\nstr = list(input().split(' ')) #number of participants\r\n\r\nm = int(str[0]) #number of participants\r\nn = int(str[-1]) #k-th finisher score\r\n\r\nprint((m*n)//2)\r\n", "N,M = map(int,input().split())\r\nres = M*N\r\nprint(int(res/2))\r\n", "import sys\r\ninput = sys.stdin.readline()\r\ncontador = 0\r\nvalues = input.split()\r\na = int(values[0])\r\nb = int(values[1])\r\nTablero = a * b\r\n\r\nwhile Tablero >= 2:\r\n contador += 1\r\n Tablero -= 2\r\nprint(contador)", "x = list(map(int, input().strip().split(\" \")))\r\nprint(int((x[0]*x[1])/2))\r\n", "q = input()\r\nsList = q.split()\r\nproduct = int(sList[0])*int(sList[1])\r\nprint(product//2)", "import math\r\n\r\ntest_on = input()\r\n\r\ntest_num = test_on.split(\" \")\r\n\r\nloerd = int(test_num[0])\r\nboubd = int(test_num[1])\r\n\r\noperatiomn = math.floor((loerd * boubd) / 2)\r\n\r\nprint(operatiomn)\r\n\r\n\r\n\t\t\t\t\t \t\t \t\t\t\t\t \t\t \t\t \t\t\t \t\t", "a,b=[int(x) for x in input().split()]\r\nx= a*b\r\nprint(int(x/2))", "s = input()\r\ns = s.split()\r\nprint(int(s[0]) * int(s[1]) // 2)", "m,n=map(int,input().split())\r\nans=(m*n)//2\r\nprint(ans)", "x,y=map(int,input().split())\r\nt=x*y\r\nc=0\r\nfor i in range(1,t+1):\r\n if(2*i<=t):\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "m,n=map(int,input().split())\r\np=(m*n)//2\r\nprint(p)", "m, n = input().split()\nboard = []\nfor i in range(int(m)):\n board.append([])\n for j in range(int(n)):\n board[i].append(j)\n\ntotal = 0\nwhile True:\n if len(board) > 1 and board[1].index(board[0][0]):\n board[0].pop(0)\n board[1].pop(0)\n total += 1\n elif len(board) > 0 and len(board[0]) > 1:\n board[0].pop(0)\n board[0].pop(0)\n total += 1\n else:\n break\n while len(board) > 0 and len(board[0]) == 0:\n board.pop(0)\n\nprint(total)", "M, N = input().split()\r\n\r\nintM = int(M)\r\nintN = int(N)\r\n\r\narea = intM * intN\r\n\r\n# Domino = 2 digits from the area\r\nprint(area // 2)", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\nprint(int((m*n)/2))", "m, n = map(int, input().split())\r\nif m % 2 == 0 and n % 2 == 0:\r\n print((m//2)*n)\r\nelif m % 2 == 0 and n % 2 != 0:\r\n print((m//2)*n)\r\nelif m % 2 != 0 and n % 2 != 0:\r\n print(((m//2)*n)+n//2)\r\nelif m % 2 != 0 and n % 2 == 0:\r\n print(((m//2)*n)+n//2)", "M,N=map(int,input().split())\r\ns=int(M*N//2)\r\nprint(s)", "m,n = map(int,input().split())\r\na = m*n\r\nw = a//2\r\nprint(w)", "m, n = input().split()\r\nprint((int(m)*int(n)//2))", "rect = input().split()\r\nx = rect[0]\r\ny = rect[1]\r\n\r\narea = int(x)*int(y)\r\nprint(str(area//2))", "n, m = map(int, input().split())\r\nrectSize = n*m\r\ndominoCount = rectSize//2\r\nprint(dominoCount)\r\n", "m, n = map(int, input().split())\nmax_d = (m * n) // 2\nprint(max_d)\n \t \t\t\t\t\t\t\t\t\t \t\t\t \t \t \t\t", "import math\r\nm,n = map(int,input().split())\r\nprod = m*n\r\nno_of_dominoes = prod//2\r\nprint(no_of_dominoes)", "m,n=map(int,input().split())\r\nif m%2==0 and n%2==0:#2*4\r\n print((m//2)*n)\r\nelif m%2!=0 and n%2==0:#3*4\r\n print(m*(n//2))\r\nelif m%2==0 and n%2!=0:\r\n print(n*(m//2))\r\nelse:\r\n print((m*n)//2)\r\n", "n, m = map(int, input().split())\nans = (n * m) // 2\nprint(ans)\n \n\t\t \t\t\t\t \t \t \t\t \t\t\t\t\t\t\t \t", "m,n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nprint(m*n//2)", "a,b=map(int,input().split())\r\ntotal=int(a*b/2)\r\nprint(total)", "inp = input()\r\ndata = [int(i) for i in inp.split(\" \")]\r\nrec_area = 1\r\n\r\nfor num in data:\r\n rec_area *= num\r\nnum_dom = rec_area//2\r\nprint(num_dom)", "m, n = map(int, input().split())\r\n# first, calculate number of squares inside the board via calculating the size of it\r\nn_of_squares = m*n\r\n#second, we need to know whether n_of_squares is even or odd (is it divisalbe via 2 or not)\r\nif (n_of_squares%2 == 0):\r\n n_of_dominos = n_of_squares / 2\r\nelse:\r\n n_of_dominos = n_of_squares // 2 # taking the int only \r\nn_of_dominos = int(n_of_dominos)\r\nprint(n_of_dominos)", "x = input()\r\nlist_1 = list(map(int, x.split(' ')))\r\nsquare = list_1[0] * list_1[1]\r\nif list_1[0] == 0 and list[1] == 0:\r\n print(0)\r\nelse:\r\n print(square // 2)\r\n", "M,N=map(int,input().split(\" \"))\r\nif M<=16 and N<=16:\r\n size = M*N\r\n dominos = (M*N)//2\r\n print(dominos)", "import math\r\n\r\n# a = []\r\n# p = 0\r\n# \r\n# c = input()\r\n# c1 = c.split(\" \")\r\n# n = int(c1[0])\r\n# k = int(c1[1])\r\n# b = input()\r\n# b1 = b.split(\" \")\r\n# \r\n# for i in b1:\r\n# a.append(int(i))\r\n# \r\n# for s in a:\r\n# if s > 0 and s >= a[k-1]:\r\n# p += 1\r\n# \r\n# print(p)\r\n#\r\n\r\nc = input()\r\nc1 = c.split(\" \")\r\nn = int(c1[0])\r\nk = int(c1[1])\r\n\r\nprint(math.floor((n*k)/2))\r\n", "import math\r\n\r\nn = input().split(\" \")\r\ndim1 = int(n[0])\r\ndim2 = int(n[1])\r\ncount = 0\r\n\r\nif dim1 * dim2 < 2 : \r\n\tprint(0)\r\nelse:\r\n\tif dim1 == 1 and dim2 > 1 :\r\n\t\tcount = math.floor(dim2 / 2)\r\n\telif dim2 == 1 and dim1 > 1:\r\n\t\tcount = math.floor(dim1 / 2)\r\n\telif dim1 > 1 and dim2 > 1:\r\n\t\tif dim1 % 2 == 0:\r\n\t\t\tcount += ((dim1/2)*dim2)\r\n\t\telse:\r\n\t\t\tcount = math.floor(dim1*dim2/2)\r\n\t\t\r\n\r\n\tprint(int(count))\r\n\t\t", "a,b=map(int,input().split())\nprint(a*b//2)\n#11\n\n \t\t\t \t \t\t\t \t\t\t\t\t\t", "m,n=list(map(int,input().split()))\r\nif (m,n)==(1,1):\r\n print(0)\r\nelse:\r\n print(m*n//2)\r\n", "m, n= input().split()\r\nm=int(m)\r\nn=int(n)\r\n\r\nprint(int((m*n)/2))", "# cook your dish here\nn, m = list(map(int, input().split()))\nprint(str((m*n)//2))", "m,n=map(int,input().split())\r\nif m>=1 and m<=n and m<=16:\r\n print((m*n)//2)", "# LUOGU_RID: 117301689\na = input().strip().split(\" \")\r\nm, n = int(a[0]), int(a[1])\r\nprint(m*n//2)", "# Getting all the information\r\n\r\ninfo = input(\"\")\r\ninfo = info.split(\" \")\r\nfor i in range(len(info)):\r\n info[i] = int(info[i])\r\n\r\ntotal_squares = info[0] * info[1]\r\n\r\nif total_squares % 2 == 0:\r\n total_squares = total_squares / 2\r\n total_squares = int(total_squares)\r\n print(total_squares)\r\nelse:\r\n total_squares = total_squares / 2 - 0.5\r\n total_squares = int(total_squares)\r\n print(total_squares)\r\n", "m,n=map(int,input().split())\nt=int(m*n / 2)\nprint(t)\n \t \t \t\t \t\t \t\t\t\t\t\t \t \t \t \t\t", "l,b = map(int,input().split())\r\nds = 2*1\r\nno_of_do = (l*b)//ds\r\nprint(no_of_do)", "from math import floor\nn,m = map(int,input().split())\n\nprint(floor((n*m)/2))", "M,N = map(int, input().split())\r\nif N%2==0 or M%2==0:\r\n a = N * M / 2\r\nelif N > 2:\r\n a = (N - 1) * M / 2 + (M - 1) / 2\r\nelse:\r\n a = 0\r\nprint(int(a))\r\n", "M,N= [int(x) for x in input().split()]\r\nA=int(M*N/2)\r\nprint(A)", "x, y = map(int, input().split(\" \"))\r\n\r\nprint(int(x * y / 2))", "# -*- coding: utf-8 -*-\n\"\"\"domino.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1SuTcCGTisxqY5IGxKwxt8NeBDjsKoz-t\n\"\"\"\n\nm, n = map(int, input().split())\nif m == 1 and n == 1:\n print(0)\nelse:\n print(int(m * n) // 2)", "m,n=map(int,input().split())\r\nif m==1 and n==1:\r\n print(0)\r\nelse:\r\n print(n*m//2)\r\n", "M, N = map(int,input().split())\r\nif M*N %2 != 0:\r\n\tk = ((M*N)-1)//2\r\nelse:\r\n\tk = M*N //2\r\nprint(k)", "m,n = map(int, input().split())\r\narea = m*n\r\ndomino = area//2\r\nprint(domino)", "l = input()\r\npar = l.split()\r\nfor elem in range(len(par)):\r\n par[elem] = int(par[elem])\r\nsize = par[0] * par[1]\r\nprint(size // 2)", "def product(data: list):\n\tprodc = 1\n\tfor x in data:\n\t\tprodc *= x\n\treturn prodc\n\t\ndata = product(list(map(int, [x.strip() for x in input().split(\" \")])))\nprint(data//2)\n", "arr = [int (x) for x in input().split()]\r\n\r\nm = arr[0]\r\nn = arr[1]\r\n\r\ntotal = int(m*n / 2)\r\nprint(total)\r\n", "def domino_piling():\r\n mn = str(input()).split()\r\n m = int(mn[0])\r\n n = int(mn[1])\r\n \r\n if m % 2 == 0 and n % 2 == 0:\r\n print(int(m*n/2))\r\n return\r\n if m % 2 != 0 and n % 2 != 0:\r\n print (int(m*(n-1)/2 + (m-1)/2))\r\n return\r\n print (int(m*n/2))\r\n \r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n domino_piling()", "def main():\r\n cas = list(map(int, input().split()))\r\n print((cas[0]*cas[1])//2)\r\nmain()", "import math\r\nn,m = map(int, input().split())\r\nprint(math.floor((n*m)/2))", "inp = input()\r\ninp2 = inp.split(\" \")\r\nk = int(inp2[0]) * int(inp2[1])\r\nif k % 2 == 0:\r\n j = k/2\r\nelse:\r\n j = (k - 1)/2\r\nprint(int(j))\r\n", "# https://codeforces.com/problemset/problem/50/A\r\n\r\nx, y = map(int, input().split())\r\nprint((x * y) // 2)", "n,m=map(int,input().split())\r\nx=n*m\r\nprint(x//2)", "m,n=map(int,input().split())\r\np=m*n\r\nq=p//2\r\nprint(q)", "m, n = map(int, input().split())\r\n# Если произведение m и n четное, то количество доминошек равно произведению m и n, деленному на 2\r\nif (m * n) % 2 == 0:\r\n print((m * n) // 2)\r\n# Иначе количество доминошек равно произведению m и n, минус 1, деленное на 2\r\nelse:\r\n print((m * n - 1) // 2)", "def calculate_max_dominoes():\r\n m, n = map(int, input().split())\r\n total_squares = m * n\r\n max_dominoes = total_squares // 2\r\n return max_dominoes\r\nresult = calculate_max_dominoes()\r\nprint(result)", "n,b=map(int,input().split())\r\ncount=0\r\nif n%2==0 or b%2==0:\r\n count=(n*b)//2\r\nelse:\r\n count=((n*b)-1)//2\r\nprint(count)", "m,n=map(int, input().split())\r\narea=m*n\r\nnod=area//2\r\nprint(nod)", "grid = input().split()\r\nm = int(grid[0])\r\nn = int(grid[1])\r\nprint((m//2 * n) + (m%2 * n//2))", "n = list(map(int,input().split()))\r\nr = int(0)\r\nd = int(0)\r\n\r\nd = n[0]*n[1]\r\nr = int (d/2)\r\nprint(r)", "a = str(input()).split()\r\nb = (int(a[0])*int(a[1]))//2\r\nprint(b)\r\n", "a=list(map(int,input().split()))\r\n\r\narearect=a[0]*a[1]\r\nn=arearect//2\r\nprint(n)", "m, n = tuple(map(int, input().split()))\r\n\r\narea = m * n\r\n\r\nif area % 2 == 0:\r\n print(int(area/2))\r\nelse:\r\n print(int((area-1)/2)) ", "m, n = input().split()\r\nif (int(m) >= 1 and int(m) <= 16) and (int(n) >= 1 and int(n) <= 16):\r\n m, n = [int(m), int(n)]\r\n maximal_number = int(((m * n) / 2))\r\n print (maximal_number)\r\nelse:\r\n print (\"wrong value\")", "import math\r\ndef main():\r\n\r\n a = [int(entry) for entry in input().split()]\r\n area_of_square = a[0] * a[1]\r\n\r\n\r\n if 1 <= a[0] <= a[1] <= 16:\r\n b = area_of_square / 2\r\n print(math.floor(b))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "M, N = [int(num) for num in input().split()]\r\nprod = M*N\r\nprint(prod//2)", "M , N = input().split()\r\nt = int(M) * int(N)\r\nc = 0\r\nwhile True:\r\n if t >= 2:\r\n t -= 2\r\n c += 1\r\n else:\r\n break\r\nprint(c)\r\n", "from math import ceil\r\nm, n=[int(i) for i in input().split()]\r\nx=m*n\r\ny=x//2\r\nprint(y)", "n,m = input().split()\r\nn,m = int(n), int(m)\r\nans = int(n/2) * (m)\r\nans += int(n%2) * int(m/2)\r\nprint(ans)\r\n", "x = list(map(int, input().split()))\r\nres = x[0] * x[1]\r\nprint(res//2)", "m,n=map(int,input().split())\r\na=m*n\r\nb=a//2\r\nprint(b)\r\n", "n = input(\"\")\r\nn = n.split(\" \")\r\nk = int(n[0]) * int(n[1])\r\n\r\nprint(int(k // 2))", "M, N = map(int, input().split())\nm = (M * N) // 2\nprint(m)\n\n\t\t\t \t\t \t \t \t\t\t \t \t \t\t\t \t", "M,N= map(int,input().split())\r\nx=M*N\r\ny=x-1\r\nif x%2==0:\r\n print(x//2)\r\nelse:\r\n print(y//2)\r\n", "n = input() \r\nn = n.split() \r\n\r\na = int(n[0])*int(n[1]) \r\n\r\nif a%2 == 0: \r\n print(int(a/2))\r\nelse: \r\n print(int((a-1)/2))", "n1, n2 = map(int, input().split())\r\nprint(n1*n2//2)", "inp = input().split()\r\nm = int(inp[0])\r\nn = int(inp[1])\r\n\r\n\r\nprint((n * m - ((n * m) % 2)) // 2)\r\n", "input_ = input()\r\nfacts = input_.split()\r\nM = int(facts[0])\r\nN = int(facts[1])\r\n\r\nif M % 2 ==0 or N % 2 ==0:\r\n print(int((M*N)/2))\r\nelse:\r\n print(int((M*N-1)/2))\r\n", "a,b=map(int,input().split())\nt=a*b\nr=t%2\nprint((t-r)//2)\n \t\t \t \t\t\t\t\t\t\t\t \t \t \t\t\t\t\t \t\t\t", "import math\r\nm, n = input().split()\r\n\r\nm = int(m)\r\nn = int(n)\r\n\r\nprint(math.floor((m*n)/2))\r\n", "def main():\n\tm,n = map(int, input().split())\n\tif m%2:\n\t\tprint(n*(m//2)+n//2)\n\telse:\n\t\tprint(n*(m//2))\n\nmain()", "\r\ndimensiones = input().split()\r\nm, n = int(dimensiones[0]), int(dimensiones[1])\r\nprint((m*n)//2)", "x,y = [int(x) for x in input().split()]\nc = x*y//2\nprint(c)\n\n", "x, y = map(int,input().split())\r\nres = x*y\r\n#if( (x % 2) and (y % 2)):\r\n# res-= 1\r\nprint(int(res/2))", "x,y = map(int,input().split())\r\nu = (x*y) // 2\r\nprint(u)", "m,n = list(int(i) for i in input().split())\r\n\r\ns1 = m*n\r\ns2 = 2\r\nv = s1/s2\r\nprint(int(v))\r\n", "import math\r\na,b=map(int,input().split())\r\nprint(math.floor((a*b)/2))\r\n", "from math import floor\r\n\r\n[N, M] = list(map(int, input().split()))\r\n\r\nreturned = floor(M/2 * N)\r\n\r\nprint(returned)\r\n", "# def domino_pilling(m,n):\r\n(m,n) = [int(n) for n in input().split()]\r\nnumber_squares=m*n\r\ndominoes_number=number_squares//2\r\nprint(dominoes_number)", "a = input().split()\r\na = [int(x) for x in a]\r\nprint(a[0] * a[1] // 2)", "m_n = input().split(\" \")\r\nm = int(m_n[0])\r\nn = int(m_n[1])\r\nprint(m*n//2)\r\n\r\n", "M, N = input().split()\r\nM, N = int(M), int(N)\r\n\r\nprint(int((M*N)/2))", "nk = list(map(int, input().rstrip().split()))\r\nprint(int(nk[0]*nk[1]/2))", "x=input()\r\nif x[1] == \" \":\r\n mult = int(x[0]) * int(x[2:])\r\n \r\nelif x[2] == \" \" :\r\n mult = int(x[0]+ x[1]) * int(x[3:])\r\n \r\nif mult%2 == 0:\r\n r= mult//2 \r\n print(r)\r\nelse:\r\n r1= (mult-1)//2\r\n print (r1)\r\n", "a,b=map(int,input().split())\r\nif b>=2 and a<2:\r\n t=a\r\n a=b\r\n b=t\r\nif a>=2 and a%2==0:\r\n x=a//2\r\n print(x*b)\r\nelif a>=2 and a%2!=0:\r\n x=a//2\r\n y=b//2\r\n print(x*b + y)\r\nelse:\r\n print(0) ", "m,n=map(int, input(). split())\ndos=m*n\ndom=1*2\nif dos%dom==0:\n print(dos//dom)\nelse:\n print(dos//dom)\n# Tue May 17 2022 06:40:17 GMT+0000 (Coordinated Universal Time)\n\n# Tue May 17 2022 06:40:24 GMT+0000 (Coordinated Universal Time)\n", "m,n=input().split()\r\ns=int(m)*int(n)\r\nfor i in range(1,s+1):\r\n o=i*2\r\n if o>s:\r\n break\r\nprint(i-1)", "x=input()\r\ny=x.split()\r\na=int(y[0])\r\nb=int(y[1])\r\nif a%2==0 or b%2==0:\r\n c=int((a*b)/2)\r\n print(c)\r\nelse:\r\n c=int(((a-1)*b/2)+ (b-1)/2)\r\n print(c)", "def dominoes(m, n):\n return ((m*n)//2)\n\n\nif __name__ == \"__main__\":\n m, n = map(int, input().split())\n print(dominoes(m, n))\n\n \t\t \t \t \t \t \t\t \t\t\t\t\t\t \t", "area = [int(x) for x in input().split(\" \")]\narea = (area[0] * area[1]) - (area[0] * area[1] % 2)\nprint(area // 2)\n", "input=input()\ninp=input.split()\nM=int(inp[0])\nN=int(inp[1])\nL=M*N\nprint(L//2)\n\t\t\t\t\t \t \t \t \t\t \t \t\t \t \t \t", "\r\nm, n = map(int,input().split(\" \"))\r\narea = int(m * n)\r\nres = area / 2\r\n\r\nprint(\"{}\".format(int(res)))", "m,n=map(int,input().split())\r\ndomino=int((m*n)/(2*1))\r\nprint(domino)", "list1 = list(map(int, input().split()))\r\nM = list1[0]\r\nN = list1[1]\r\nif M*N % 2 ==0:\r\n print(int((M*N)/2))\r\nelse:\r\n print(int((M*N - 1)/2))", "n=input().split(' ')\r\ntotal=int(n[0])*int(n[1])\r\nprint(total//2)", "L=input().split()\r\nn=int(L[0])\r\nk=int(L[1])\r\n\r\nprint((n*k)//2)", "mn = input(\"\")\nmn = mn.split()\n\nmn = int(mn[0]) * int(mn[1])\nprint(mn // 2)\n\n", "m , n = map(int, input().split())\r\ndomino = m*n//2\r\nprint(domino)", "a = input(\"\")\n\nm, n = map(int, a.split(' '))\n\n\nb = (m*n) // (2*1)\nprint(b)\n", "M, N = map(int, input().split())\n\nNumberOfSquares = M*N\n\nprint(NumberOfSquares//2)\n\n", "kazzz,illl=map(int,input().split())\nif(1<=kazzz<=16 and 1<=illl<=16):\n tutha= kazzz*illl\n print(tutha//2)\n \t \t \t \t\t\t\t \t\t\t\t \t \t", "if __name__ == \"__main__\":\r\n n = list(map(int, input().split()))\r\n print((n[0]*n[1])//2)\r\n\r\n", "a, b = map(int,input().split())\r\nif a*b == 1:\r\n print(0)\r\nelse:\r\n print(int(a*b)//2)", "m,n = input().split()\r\nm=int(m)\r\nn=int(n)\r\n \r\na = m*n /2\r\n \r\nprint(int(a))", "n,k=map(int,input().split())\r\nprint(int(n*k/2))", "i = input()\r\nm, n = map(int, i.split())\r\no = (m*n)//2\r\nprint(o)", "c,d=map(int,input().split())\r\nprint((c*d)//2)\r\n", "onci,mati=map(int,input().split())\nprint(onci*mati//2)\n \t\t\t\t \t\t \t \t \t \t \t \t \t", "M , N = input().split()\r\nM = int(M)\r\nN = int(N)\r\nS = M*N\r\nprint(S//2)", "t = input().split()\r\nprint((int(t[0])*int(t[1])//2))", "#author: _arv78\r\nimport math\r\nn = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\n\r\nprint(math.floor(a*b / 2))\r\n", "# You are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares.\r\n# You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\r\n# 1. Each domino completely covers two squares.\r\n# 2. No two dominoes overlap.\r\n# 3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\r\n# Find the maximum number of dominoes, which can be placed under these restrictions.\r\n# Input\r\n# In a single line you are given two integers M and N — board sizes in squares (1 ≤ M ≤ N ≤ 16).\r\n# Output\r\n# Output one number — the maximal number of dominoes, which can be placed.\r\n# Examples\r\n# Input\r\n# 2 4\r\n# Output\r\n# 4\r\n# Input\r\n# 3 3\r\n# Output\r\n# 4\r\n\r\nm, n = list(map(int, input().split()))\r\nresult = m * n // 2\r\nprint(result)\r\n", "m, n = input().split()\n\nprint(int(int(m)* int(n) / 2))", "n,k = map(int, input().split())\r\nprint (n*k//2)\r\n", "def floor(num):\r\n return int(num)\r\n\r\n\r\nx = input().split()\r\n\r\nm = int(x[0])\r\nn = int(x[1])\r\n\r\na = m * n\r\n\r\nanswer = floor(a / 2)\r\n\r\nprint(answer)", "m, n = [int(x) for x in input().split()]\n# m, n = 3, 3\n\n\nif n % 2 == 0:\n print((n // 2) * m)\nelif m % 2 == 0:\n print((m // 2) * n)\nelse:\n # in this case, both m and n are odd\n print(((n-1) // 2) * m + m // 2)\n\n# if m % 2 == 0 and n % 2 == 0:\n# print(n * (m//2))\n# elif m % 2 == 0:\n# c = n * m // 2\n# if \n\n\n# x x x\n# x x x \n# x x x\n\n# 9 + 1 = 0", "a = list(map(int, input().split()))\r\n\r\nif a[0] == 1 and a[1] == 1:\r\n print(\"0\")\r\nelse:\r\n print((a[0]*a[1])//2)", "n = input()\r\ntam = n.split()\r\nsquare = int(tam[0]) * int(tam[1])\r\n\r\nprint(square // 2)", "# board of M x N squares \n# unlimited number of domino pieces of 2 x 1 squares (we are able to rotate)\nM, N = map(int, input().split())\nnum = 0\n\n# how many dominoes can we fit inside the MxN square? \narea = M * N\nwhile(area > 1):\n area -= 2 # fit a domino of area 2\n num += 1\n\nprint(num)", "n, m =input().split()\nn=int(n)\nm=int(m)\narea = n*m\nsquare = area//2\nprint(square)\n\n\t\t\t\t\t\t \t \t\t \t \t\t\t \t\t \t \t\t \t", "n,m=input().split()\r\n\r\narea=int(n)*int(m)\r\n\r\nfit=area//2\r\nprint(fit)", "m,n = list(map(int,input().split()))\r\nd = m*n//2\r\nprint(d)", "num1,num2 = map(int,input().split(\" \"))\r\nif num1 <= 16 or num1 >= 0 and y <= 16 or y >= 0:\r\n m = num1 *num2\r\n print(m//2)", "n1,n2=map(int,input().split())\r\nprint((n1*n2)//2)\r\n", "t = [int(x) for x in input().split(' ')]\r\npole = t[0]*t[1]\r\nif pole % 2 > 0:\r\n print(int((pole-1)/2))\r\nelse:\r\n print(int(pole/2))", "#byerainkaporababu\na,b=map(int,input().split())\nsum1=(a*b)//2\nprint(sum1)\n\t\t\t\t \t\t \t\t \t\t \t\t\t\t\t\t", "a,b =map(int, input().split())\ntotal_squares = a*b\n\nmax_dominoes =total_squares // 2\n\nprint(max_dominoes)\n\t\t \t \t \t \t\t\t \t \t \t\t\t\t \t\t", "M,N = list(map(int,input().split()))\r\nprint(M*N//2)", "import math\r\nm,n = map(int,input().split())\r\nprint(math.floor((m*n)/2))", "m, n = map(int, input().split())\r\ncnt = (m*(n//2))+((n%2)*(m//2))\r\nprint(cnt)\r\n", "M,N=map(int,input().split())\r\n\r\n\r\nif (M*N)%2==0:\r\n print(int(M*N/2))\r\nelse:\r\n print(int((M*N-1)/2))\r\n \r\n", "import math\nm,n=list(map(int,input().split()))\narea=m*n\nprint(math.floor(area/2))\n\t \t\t \t\t \t\t\t\t \t\t\t\t \t\t\t\t\t", "a,b=list(map(int,(input().split(sep=' '))))\r\nc=int(a*b/2)\r\nprint(c)", "n,m=map(int,input().split())\r\ns=n*m\r\nprint(int(s/2))\r\n", "a = input().split()\r\nb = int(a[0]) * int(a[1])\r\nprint(b // 2)", "nk = list(map(int, input().split()))\r\nn = nk[0]\r\nk = nk[1]\r\nprint((n*k)//2)", "import math\r\nn,m=map(int,input().split())\r\nprint(math.floor(n*m/2))", "str=(input())\r\n\r\nif(str[1]==' 'and len(str)==3):\r\n\r\n m=int(str[0])\r\n n=int(str[2])\r\n\r\nelif(str[1]==' ' and len(str)==4):\r\n\r\n m=int(str[0])\r\n n=int(str[2])*10 + int(str[3])\r\n\r\nelif(str[1]!=' ' and len(str)==4):\r\n\r\n m=int(str[0])*10 + int(str[1])\r\n n=int(str[3])\r\n\r\nelse:\r\n\r\n m=int(str[0])*10 + int(str[1])\r\n n=int(str[3])*10 + int(str[4])\r\n\r\nno_domino=(m*n)//2\r\n\r\nprint(no_domino)", "a = input().split()\r\nb = 2\r\nm = int(a[0])\r\nn = int(a[1])\r\nprint((m*n)//b)", "m,n=map(int,input().split())\r\ncount=m*n//2\r\nprint(count)", "# Matheus de Souza Oliveira - RA: 203407\n\nboardDimensions = list(map(int, input().split()))\narea = boardDimensions[0] * boardDimensions[1]\nnumberOfDominoes = area // 2\nprint(numberOfDominoes)\n\t \t \t \t\t\t \t \t \t\t \t\t \t\t", "a,b=map(int,input().split())\r\narea=a*b\r\ndomino=2\r\nprint(area//domino)", "m,n=input().split()\nm=int(m)\nn=int(n)\nif(m*n%2==0):\n print((m*n)//2)\nelse:\n print((m*n)//2)", "m, n = map(int, input().split())\n\nsquare = n*m\nresult = square // 2\n\nprint(result)\n", "\r\nwidht, length = (input().split())\r\n\r\ntotal_dominos = (int(widht) * int(length))//2\r\n\r\nprint(total_dominos)\r\n", "from math import floor\r\na = input().split(\" \")\r\nm, n = int(a[0]), int(a[1]) \r\nprint(floor((m*n)/ 2))", "\nn, k, = (int(a) for a in input().strip().split())\n\nprint((n * k) // 2)\n", "column, row = map(int, input().split())\r\nanswer = column * (int(row)/2)\r\nprint(int(answer))", "m,n = map(int, input().split())\r\nx = m*n/2\r\n\r\nprint(int(x))\r\n", "p = list(map(int, input().split()))\r\nM = p[0]\r\nN = p[1]\r\nS = M * N\r\nif 1 <= M <= N <= 16:\r\n if S % 2 == 0:\r\n print(S // 2)\r\n else:\r\n print((S - 1) // 2)", "mmm,nnn=map(int,input().split())\nprint(mmm*nnn//2)\n \t \t\t\t \t\t \t \t\t \t \t\t\t\t\t", "import math\r\na,b=map(int,input().split())\r\nc=(a*b)/2\r\nprint(math.floor(c))", "[a, b] = map(int, input().split())\n\nnumsquares = a * b\n\nprint(numsquares // 2)", "from math import *\r\na , b = map(int, input().split())\r\nc = (a*b)//2\r\nd = floor(c)\r\nprint(c)", "M,N = map(int,input().split())\r\ntotal_area = M * N\r\nmax_dominos = total_area // 2\r\nprint(max_dominos)", "def domino(x,y):\n return (x*y)//2\n\n \nuser_input = input()\nwidth_and_height = user_input.split(\" \")\nx=int(width_and_height[0])\ny=int(width_and_height[1])\n\nprint(domino(x,y))\n\n\n\n\n", "a,b=input().split()\r\na,b=int(a),int(b)\r\nif(a==1 and b==1):\r\n print(0)\r\nelse:\r\n x=int((a*b)//2)\r\n print(x)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 5 14:48:37 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nM,N=map(int,input().split())\r\nk=M*N//2\r\nprint(k)\r\n", "inp = input().split()\r\nw = int(inp[0])\r\nl = int(inp[1])\r\narea = w * l\r\ndom_num = area//2\r\nprint(dom_num)\r\n", "a,b=map(int,input().split())\nsum=int(a*b/2)\nprint(sum)\n\t \t\t\t\t\t\t \t\t \t \t\t \t\t \t \t\t\t \t \t", "m,n = map(int,input().split())\r\nr = (m*n)//2\r\nprint(r)\r\n", "n,k=map(int,input().split())\r\n\r\na=n*k\r\n\r\nprint(a//2)\r\n", "n, m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nboard=n*m\r\nDP=2*1\r\nFD=int(board/DP)\r\nprint(FD)", "import math\r\nn,m = map(int,input().split())\r\narea = math.floor((n*m)/2)\r\nprint(area)\r\n", "import math\r\nm, n = map(int, input().split(' '))\r\narea = m * n\r\nprint((math.floor(area / 2)))\r\n", "n,m=map(int,input().split())\r\ndominos=0\r\nrest=0\r\nwhile (m!=0) :\r\n dominos+=n // 2\r\n rest+=n % 2\r\n m-=1\r\nprint(dominos+(rest//2))", "M, N = map(int, input().split())\r\nnoOfDomino = (M*N)//2\r\nprint(noOfDomino)", "n , m = input().split()\r\nn,m = int(n), int(m)\r\nprint(int((n*m)/2))", "from sys import stdin, stdout\r\n \r\n# Reroute std in/out for testing purposes, remove for submission\r\n# stdin = open(\"work/input.txt\", \"r\")\r\n# stdout = open(\"work/output.txt\", \"w\")\r\n\r\ndef main():\r\n # Board M x N squares\r\n # Find max nr of domino stones (2x1)\r\n m, n = map(int, stdin.readline().rstrip().split())\r\n print(( m * n ) // 2 ) \r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\n\r\ndef fun(x):\r\n return int(x)\r\n\r\nm, n = map(fun,input().split(\" \"))\r\n\r\nbox = math.floor(m * n)\r\nbox = math.floor(box/2)\r\nprint(box)", "a, b = map(int, input().split())\r\nx = int(a*b / 2)\r\nprint(x)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nif m % 2 == 0 or n % 2 == 0:\r\n print(n*m//2)\r\nelse:\r\n print((n*m-1)//2)", "m, n=map(int, input().split())\r\nprint(n//2*m+n%2*(m//2))", "n,m=[int(i) for i in input().split()]\r\nparameter=n*m\r\nMaximum_number_of_dominoes=parameter//2\r\nprint(Maximum_number_of_dominoes)", "def maximum_dominoes(M, N):\r\n total_squares = M * N\r\n max_dominoes = total_squares // 2\r\n return max_dominoes\r\n\r\n# Example usage:\r\nM, N = map(int, input().split())\r\nmax_dominoes = maximum_dominoes(M, N)\r\nprint(max_dominoes)\r\n", "v,z=map(int,input().split())\nif(1<=v<=16 and 1<=z<=16):\n s=v*z\n print(s//2)\n\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\nprint((l[0]*l[1])//2)\r\n", "m,n=map(int,input().split())\r\nr=(m*n)//2\r\nprint(r)", "a,b=map(int,input().split())\r\nab=a*b\r\nif ab%2==1:\r\n print(ab//2)\r\nelse:\r\n print(ab//2)\r\n \r\n ", "x=input()\r\ny=x.split()\r\nz=(int(y[0])*int(y[1]))//2\r\n\r\nprint(z)\r\n\r\n\r\n\r\n\r\n\r\n", "# https://codeforces.com/contest/50/problem/A\nimport sys\nreader = (s.rstrip() for s in sys.stdin)\ninput = reader.__next__\n# do magic here\nn, m = map(int, input().split())\nans1 = (n//2)*m + (m//2 if n & 1 else 0)\nans2 = (m//2)*n + (n//2 if m & 1 else 0)\nprint(max(ans1, ans2))\n", "n,m=map(int, input().split(' '))\r\nimport math\r\nprint(math.floor((n*m)/2))\r\n\r\n", "def domino(m, n):\r\n return m * n // 2\r\n\r\nm, n = map(int, input().split())\r\nprint(domino(m, n))", "import sys\r\nn,m = map(int, input().split())\r\nif n>m:\r\n c=m\r\n m=n\r\n n=c\r\nc=n*m//2+(n*m%2)//2\r\nprint(c)", "m,n=input().split()\r\nm,n=int(m),int(n)\r\nprint((m*n)//2)", "M,N=map(int,input().split())\r\nif M%2==1 and N%2==1:\r\n i=(M*N-1)/2\r\n print(int(i))\r\nelse:\r\n i=M*N/2\r\n print(int(i))", "x=list(map(int,input().split()))\r\ntotalarea=1\r\nfor i in x:\r\n totalarea*=i\r\nfinal=totalarea//2\r\nprint(final)", "m,n=input().split()\r\na=int(m)*int(n)\r\nb=2\r\nif a%2==0:\r\n print(int(a/2))\r\nelse:\r\n print(int(a//2))\r\n", "def solve():\r\n n=input().split(\" \")\r\n for i in range(len(n)):\r\n if i==0:\r\n l=int(n[i])\r\n else:\r\n b=int(n[i])\r\n aa=l*b\r\n print(aa//2)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "M1, N = map(int, input().split())\ntotal_squares = M1 * N\nmax_dominoes = total_squares // 2\n#prints\nprint(max_dominoes)\n\t\t\t \t \t \t \t\t\t \t \t \t \t \t\t", "m, n = [int(v) for v in input().split()]\nprint((m * n) // 2)\n\n\t \t\t\t\t\t \t \t \t \t \t \t\t \t\t \t \t", "h,g=map(int,input().split())\r\nprint((h*g)//2)", "m,n = map(int,input().split())\r\nc=(m*n)//2\r\nprint(c)", "a = input()\r\nm, n = int(a.split()[0]), int(a.split()[-1])\r\nprint((m*n)//2)", "a = input()\na = a.split()\nb = int(a[0])\nc = int(a[1])\na = b*c\na = a/2\na = int(a)\nprint(a)\n\n \t\t \t\t \t\t\t\t \t\t\t \t\t\t\t\t\t\t\t", "\n\n\nif __name__ == '__main__':\n str = input().split(' ')\n if int(str[0]) > int(str[1]):\n m, n = int(str[0]), int(str[1])\n else:\n m, n = int(str[1]), int(str[0])\n if m % 2 == 0:\n print(int(m * n / 2))\n else:\n print(int(m / 2) * n + int(n / 2))\n", "a = input()\r\na = list(map(int, a.split(' ')))\r\nb = (a[0]*a[1]) // 2\r\nprint(b)", "n, k = map(int, input().split())\r\n\r\nx = 0 \r\nx += k * (n//2)\r\nif n%2 != 0:\r\n x += k//2\r\nprint(x)", "line = input().split()\r\ndominoSquare = 2*1\r\n\r\nfieldSquare = int(line[0])*int(line[1])\r\n# print(fieldSquare)\r\nnumberOfDominos = fieldSquare//dominoSquare\r\n\r\nprint (numberOfDominos)", "# Read the board dimensions\r\nM, N = map(int, input().split())\r\n\r\n# Calculate the total number of squares\r\ntotal_squares = M * N\r\n\r\n# Calculate the maximum number of dominoes\r\nmax_dominoes = total_squares // 2\r\n\r\n# Output the result\r\nprint(max_dominoes)", "a = input()\r\ns = a.split()\r\nx = int(s[0]) * int(s[1])\r\nprint(x // 2)", "i,j=map(int,input().split())\r\nk=i*j\r\nd=k//2\r\nprint(d)", "inp = [int(x) for x in input().split()]\r\n\r\nm = inp[0]\r\nn = inp[1]\r\n\r\nif m == 1 and n < 2:\r\n print(0)\r\nelif m % 2 == 0:\r\n col = m // 2\r\n\r\n print(col * n)\r\nelse:\r\n col = m // 2\r\n\r\n extra = n // 2\r\n\r\n print(col * n + extra)\r\n", "n,k = map(int,input().split())\r\na=n*k \r\nprint(int(a/2))", "n,m=map(int,input().split())\r\ns=n*m\r\nnb=s//2\r\nprint(nb)", "\r\n\r\n\r\ndef domino_piling():\r\n\r\n\r\n rows,cols = map(int,input().split())\r\n\r\n \r\n #horizontal \r\n\r\n \r\n values = ((rows,cols),(cols,rows))\r\n \r\n numbers = []\r\n for v1,v2 in values:\r\n dominos = v1//2 * v2\r\n\r\n if v1 % 2 == 1:\r\n dominos += v2//2\r\n\r\n numbers.append(dominos)\r\n\r\n\r\n\r\n dominos = max(numbers)\r\n print(dominos)\r\n\r\n\r\n\r\ndomino_piling()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "m, n = list(map(int, input().split(' ')))\r\nans = 0\r\ntmp1 = m//2\r\nans = tmp1 * n\r\ntmp2 = m % 2\r\nif tmp2==1:\r\n ans += n//2\r\nprint(ans)", "m,n = map(int,input().split())\r\nif m!=n:\r\n print(int(m*n/2))\r\nif m==n:\r\n print(m*n//2)\r\n", "num = [int(x) for x in input().split()]\r\nmulti = num[0] * num[1] \r\nprint(int(multi / 2))\r\n", "m,n=map(int,input().split())\ntot=m*n\nmax=tot//2\nprint(max)\n\t\t \t \t\t\t\t\t\t \t\t\t\t \t\t\t\t \t\t \t", "x, y = input().split()\n\nprint((int(x) * int(y)) // 2)\n\n", "def dompling():\r\n x = input()\r\n n = ''\r\n m = ''\r\n for i in range(2):\r\n if i == 0:\r\n n = x.split()[i]\r\n if i == 1:\r\n m = x.split()[i]\r\n n = int(n)\r\n m = int(m)\r\n s = n*m\r\n return s//2\r\n\r\nprint(dompling())\r\n\r\n", "a = input().split()\r\nm = int(a[0])\r\nn = int(a[1])\r\n\r\nout = (m * n) // 2\r\nprint(out)\r\n", "inp=input()\r\nalist=inp.split()\r\nm=int(alist[0])\r\nn=int(alist[1])\r\ndef domino_piling(m,n):\r\n return (m*n)//2\r\nprint(domino_piling(m,n))\r\n", "a,b=map(int,input().split())\r\nans=(a*b)//2\r\nprint(ans)", "inputs=input(\"\").rsplit(' ')\nm=int(inputs[0])\nn=int(inputs[1])\nprint(int((m * n) / 2))\n", "n,k=[int(x) for x in input().split()]\ntot_no=n*k\nprint(tot_no//2)\n\n\n\n", "xd=[int(i) for i in input().split()]\r\nm=xd[0]\r\nn=xd[1]\r\nprint(n*m//2)", "import math\nN, M = map(int,input().split())\ns = N * M\nif s % 2 == 0:\n print(s//2)\nelse:\n print(math.floor(s//2))", "l1=list(map(int,input().split()))\r\narea=l1[1]*l1[0]\r\ncount=0\r\nwhile(area>1):\r\n area-=2\r\n count+=1\r\nprint(count)", "M,N=input().split()\r\nM=int(M)\r\nN=int(N)\r\nif M*N%2==0:\r\n output=M*N//2\r\nelse:\r\n output=(M*N-1)//2\r\nprint(output)", "x, y = map(int, input().split())\r\narea = x*y\r\nprint(area // 2)", "from math import ceil\r\na, b=[int(i) for i in input().split()]\r\nc=a*b\r\nd=c//2\r\nprint(d)", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n m, n = map(int, stdin.readline().split())\r\n\r\n print(m * n // 2)\r\n\r\n\r\nsolve()\r\n", "a,b = list(map(int, input().split()))\r\nif 1<=a<=b<=16:\r\n k=a*b\r\n print(k//2)\r\n ", "n,m = map(int,input().split())\r\nans = n*m/2\r\nprint(int(ans))", "x,y=map(int,input().split())\r\nblock= x*y/2\r\nprint(int(block))", "v, w =map(int, input().split())\r\nif v==1 and w==1:\r\n print(0)\r\nelse:\r\n print(int(v * w) //2)", "m, n = map(int, input().split())\r\n\r\nres = m * n // 2\r\n\r\nprint(res)", "n,m=map(int,input().split(\" \"))\r\nprint(str(int((n*m)/2)))", "width, height = [int(chunk) for chunk in input().split(' ')]\r\nprint((width*height)//2)", "n,m=map(int,input().split())\r\nif n%2==0:\r\n output=n/2*m\r\nelif m%2==0:\r\n output=m/2*n\r\nelse:\r\n output=(n-1)/2*m+(m-1)/2\r\nprint(int(output))", "m, n = input().split(\" \")\nm = int(m)\nn = int(n)\ni = int(m*n/2)\nprint(i)", "import math\nn, m = [int(num) for num in input().split()]\nprint(math.floor(n*m/2))", "a=input()\r\nif a[1]==' ':\r\n b=a[0]\r\n c=a[2:]\r\nif a[2]==' ':\r\n b=a[:2]\r\n c=a[2:]\r\n#print(b,c)\r\nb=int(b)\r\nc=int(c)\r\n#print(b,c)\r\nif b%2==0:\r\n print(int(b/2*c))\r\nif b%2!=0:\r\n print(int((b//2)*c+c//2))", "line = input()\nnum1, num2 = line.split()\nnum1, num2 = int(num1), int(num2)\n\nmax_num = (num1 * num2) // 2\n\nprint(max_num)\n\t \t\t\t \t\t\t\t\t\t \t \t \t \t \t \t \t", "#!/usr/bin/env python\n\n# start with domino piling\n\ndef main():\n\ti = lambda:map(int, input(\"\").split())\n\tm,n = i()\n\tprint(m*n // 2)\n\nif __name__ == \"__main__\":\n\tmain()\n", "def max_dominoes(M, N):\n total_squares = M * N\n max_dominoes = total_squares // 2\n return max_dominoes\n\n# Read the board sizes\nM, N = map(int, input().split())\n\n# Calculate the maximum number of dominoes\nresult = max_dominoes(M, N)\n\n# Print the result\nprint(result)\n\n \t \t\t\t\t \t\t\t\t\t \t \t\t\t \t\t\t", "m, n = map(int, input().split())\r\nmul=m*n\r\nif mul%2==0:\r\n print(mul//2)\r\nelse:\r\n k=mul -1\r\n print(k//2)", "x, y = [int(i) for i in input().split()]\r\nsq = x*y\r\nprint(sq//2)\r\n", "l=map(int,input().split())\r\ns=1\r\nfor i in l :\r\n s*=i\r\nprint(s//2)", "a = list(input().split())\r\n\r\nprint(int((int(a[0]) * int(a[1]))/2))", "a=list(map(int,input().strip().split()))[:2]\r\nm=a[0]\r\nn=a[1]\r\nk=m*n\r\nt=k//2\r\nprint(t)\r\n", "line = input().split()\r\nm, n = int(line[0]), int(line[1])\r\nif(m % 2 == 0) and (n % 2 == 0):\r\n print(m * n // 2)\r\nelif(m % 2 == 0) or (n % 2 == 0):\r\n print(m * n // 2)\r\nelse:\r\n print((m * n - 1) // 2)", "inp = input().split()\nprint((int(inp[0])*int(inp[1]))//2)\n", "from xml.dom.xmlbuilder import DOMInputSource\r\n\r\n\r\nm,n = map(int,input().split())\r\nareaBoard = m*n\r\nareaDomino = 2*1\r\n\r\nprint(areaBoard//areaDomino)", "l_w=input()\r\nfi=list(map(int,l_w.split()))\r\nn=fi[0]*fi[1]\r\nfinal=n/2\r\nprint(int(final))", "M, N = map(int, input().split())\nx = 0\nif(N % 2 == 0):\n x = M * (N // 2)\nelse:\n x = M * (N // 2) + M // 2\nprint(x)", "n,m=map(int,input().split())\r\nprint(int(n*m//2))\r\n", "M, N = map(int, input().split())\r\n# Each domino will cover 2 squares, so we can place (M * N) // 2 dominos.\r\nprint((M * N) // 2)\r\n", "m,n=map(int, input().split())\r\nx=n*m\r\nprint(x//2)", "M, N = map(int, input().split())\r\nmaxd = (M * N) // 2\r\n \r\nprint(maxd)", "a=list(map(int,input().split()))\r\nm=a[0]\r\nn=a[1]\r\nif m%2==0 or n%2==0:\r\n print(m*n//2)\r\nelse:\r\n c=(m*n-1)\r\n print(c//2)\r\n", "# divide watermelon in 2 even halves\r\n\r\nm, n = [int(x) for x in input().split()]\r\narea = m*n\r\nprint(area//2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "m,n=map(int,input().split())\r\np=m*n\r\nprint(int(p/2))", "a= (input().split())\r\n\r\nM = int(a[0])\r\n\r\nN = int(a[1])\r\n\r\nx = (M * N) // 2\r\n\r\nprint(x)", "n,m = map(int,input().split())\r\ntotal_squares=n*m\r\nmax_dominoes=total_squares//2\r\nprint(max_dominoes)", "arr=input().split()\r\nif len(arr)==2:\r\n m=int(arr[0])\r\n n=int(arr[1])\r\n if m>=1 and n>=m and n<=16:\r\n print(m*n//2)\r\n else:\r\n print(0)\r\nelse:\r\n print(0)\r\n", "area = input().split(\" \")\r\narea = int(area[0]) * int(area[1])\r\ndomino = 2\r\nprint(area//domino)", "x=list(map(int,input().split()))\r\nm=x[0]\r\nn=x[1]\r\nprint((m*n)//2)", "base, altura = input().split(\" \")\r\n\r\nprint(int((int(base)*int(altura)/2)))", "import math\r\nn,m = [int(d) for d in input().split()]\r\nres = math.floor(float(n)*m/2)\r\nprint(res)\r\n\r\n", "n, k = map(int , input ().split())\r\nif (n*k)%2==0:\r\n print(int(n*k/2))\r\nelse:\r\n print(int(n*k/2))", "import math\r\n\r\narr = input().split(' ')\r\nm = int(arr[0])\r\nn = int(arr[1])\r\n\r\nprint(math.floor(m * n / 2))", "\r\na = input()\r\narea_board = a.split()\r\narea = int(area_board[0]) * int(area_board[1])\r\nnumber_domino = area//2\r\nprint(number_domino)\r\n", "M,N = map(int,input().split())\r\nif M*N/2 == 0:\r\n print(M*N/2)\r\nelse:\r\n print(M*N//2)", "values = input()\n\narray_values = values.split(' ')\n\nm = array_values[0]\nn = array_values[1]\n\nprint(int((int(m)*int(n)) / 2))\n", "\r\n\r\n\r\n\r\nm , n =map(int ,input ().split())\r\nall= (n*m )//2\r\n\r\nprint(all)\r\n ", "a,b=map(int,input().split())\r\nif(a==1 and b==1):\r\n print(0)\r\nelif(a%2==0):\r\n print((a//2)*b)\r\nelse:\r\n print((a//2)*b+b//2)", "m, an = map(int, input().split())\nprint((m * an) // 2)\n\t\t\t \t \t \t \t \t \t\t\t\t\t\t", "n, m = map(int, input().split())\r\nresult = (n * m) // 2\r\nprint(result)", "n,m = map(int,input().split())\r\nl = n*m\r\nprint(l//2)", "M,N = map(int, input().split())\r\narea = M*N\r\nprint(area//2)\r\n", "nums = input()\r\n\r\nnumList = nums.split(\" \")\r\n\r\nprint((int(numList[0]) * int(numList[1])) // 2)\r\n", "import math\r\n\r\nlength, width = map(int, input().split())\r\n\r\narea = length * width\r\ndomino = 2\r\ndomino_area = (length*width)/2\r\n\r\nprint(math.floor(domino_area))", "x,y = input().split()\r\nx = int(x)\r\ny = int(y)\r\nv = x * y\r\nd = v // 2\r\nprint(d)\r\n\r\n", "import math\r\n\r\ndef domino_piling():\r\n d = input()\r\n dimensions = [int(i) for i in d.split(\" \")]\r\n area = dimensions[0] * dimensions[1]\r\n print(math.floor(area/2))\r\n\r\nif __name__ == \"__main__\":\r\n domino_piling()", "l,l1=map(int, input().split())\r\ns=l*l1\r\nd=s//2\r\nprint(d)", "from sys import stdin, stdout\r\n\r\ndef main():\r\n input = [x for x in stdin.read().split()]\r\n # f = open(\"input.txt\", \"r\")\r\n # input = f.read().split()\r\n area = int(input[0])*int(input[1])\r\n print(area//2)\r\n # for i in range(int(input[0])):\r\n # pass\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\r\n", "m,n=map(int,input().split())\r\nx=m*n//2\r\nprint(x)", "inp = tuple(map(int, input().split()))\r\nprint(inp[0] * inp[1] // 2)", "M, N = [int(x) for x in input().split()]\r\nprint(M * N // 2)\r\n", "# Read the board sizes\nQ, E = map(int, input().split())\n\n# Calculate the total number of squares\ntotal_squares = Q * E\n\n# Calculate the maximum number of dominoes\nmax_dominoes = total_squares // 2\n\n# Print the maximum number of dominoes\nprint(max_dominoes)\n\n\t\t \t \t\t\t\t \t\t\t\t\t\t\t\t\t\t \t", "n , k = map(int , input().split())\r\ns = n * k\r\n\r\nif s % 2 == 0:\r\n print(int(s/2))\r\nelif s % 2 == 1:\r\n print(int((s - 1) /2))\r\n", "v,g = list(map(int, input().split()))\nprint((v*g)//2)\n \t \t \t \t \t \t\t\t \t \t\t \t", "dim = input().split(' ')\r\nM = int(dim[0])\r\nN = int(dim[1])\r\nmul = M*N\r\n\r\nif mul % 2 == 0:\r\n print(mul//2)\r\nelse :\r\n print((mul-1)//2) ", "\r\nm,n=[int(x) for x in input().split()]\r\nprint(int(m*n/2))", "a,b = map(int, input().split())\n\ntotal_squares = a*b\nmax_dominoes = total_squares // 2\n\nprint(max_dominoes)\n\n\t \t \t \t\t\t\t\t\t \t\t\t\t\t\t \t \t\t", "a=input().split()\r\nb=int(a[0])*int(a[1])\r\nprint(b//2)", "x,y=input().split()\r\na=int(x)\r\nb=int(y)\r\nc=a*b\r\nd=c//2\r\ne=int(d)\r\nprint(e)", "a = list(map(int,input().split()))\r\n\r\nb = a[0]/1 * a[1]/2\r\nc = a[0]/2 * a[1]/1\r\nif b > c:\r\n print(int(b))\r\nelse: print(int(c))", "def main():\n M, N = [int(inp) for inp in input().split()]\n\n # assume wide board\n if M > N:\n M, N = N, M\n \n # on each row, place 1x2 dominoes until zero or one column is remaining\n if N % 2 == 0:\n n_dominoes = int(M * N/2)\n else:\n n_dominoes = int(M * (N-1)/2)\n\n # place 2x1 dominoes in remaining single column\n n_dominoes += M//2\n print(n_dominoes)\n\nif __name__ == \"__main__\":\n main()", "import math\r\n\r\nI = input()\r\ninput_list = I.split()\r\n\r\nM = int(input_list[0])\r\nN = int(input_list[1])\r\n\r\nif M%2==0 and N%2==0:\r\n print(int(M/2)*N)\r\n\r\nelif M%2==0:\r\n print(int(M/2)*N)\r\n\r\nelif N%2==0:\r\n print(int(N/2)*M)\r\n\r\nelse:\r\n print(math.floor(M/2)*N + math.floor(N/2))", "n=list(map(int,input().split()))\r\na=n[0]\r\nb=n[1]\r\nc=a*b\r\nprint(c//2)", "n, k = map(int, input().split())\r\nprint (int((n * k + 1) / 2 - (n * k) % 2))", "MN = list(map(int, input().split()))\nM = MN[0]\nN = MN[1]\nMN_area = M * N \nMN_area = MN_area//2\nprint(MN_area)\n", "#1#арбуз\r\n# k = int(input())\r\n# if k >= 4 and k % 2 == 0:\r\n# print('YES')\r\n# else:\r\n# print(\"NO\")\r\n\r\n#2#слишком длинные слова\r\n# n = int(input())\r\n# a = []\r\n# for i in range(n):\r\n# j = input()\r\n# if len(j) <= 10:\r\n# a.append(j)\r\n# else: a.append(j[0] + str(len(j) - 2) + j[-1])\r\n# for i in a: print(i)\r\n\r\n#3#театральная площадь\r\n# n, m, a = map(int, input().split())\r\n# k = n // a + (n % a > 0) * 1\r\n# l = m // a + (m % a > 0) * 1\r\n# print(k * l)\r\n\r\n#4#команда\r\n# n = int(input())\r\n# count = 0\r\n# for i in range(n):\r\n# if sum([int(x) for x in input().split()]) > 1:\r\n# count += 1\r\n# print(count)\r\n\r\n#5#следующий раунд\r\n# n, k = map(int, input().split())\r\n# a = [int(x) for x in input().split()]\r\n# count = 0\r\n# for i in a:\r\n# if i >= a[k - 1] and i > 0: count += 1\r\n# print(count)\r\n\r\n#6#укладка доминошек\r\nm, n = map(int, input().split())\r\nprint((m * n) // 2)", "M, N = map(int, input().split()) \r\nif M == 1 and N == 1:\r\n print(0)\r\nelse:\r\n print(int((M * N) / 2))", "M, N = list(map(int,input().split()))\r\n\r\nprint((M*N)//2)\r\n\r\n", "n,m=map(int,input().split())\r\nif(n>=m):\r\n a=n\r\n b=m\r\nelse:\r\n a=m\r\n b=n\r\nt=(b//2)*(a//1)\r\nb=b-(2*(b//2))\r\nt+=(a//2)*b\r\nprint(t)", "def main():\r\n n, m = map(int, input().split())\r\n \r\n # By multiplying, we're essentially seeing how many 2x1 dominoess\r\n # fit in a line of n*m squares.\r\n totalSquares = n*m\r\n \r\n print(totalSquares // 2)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "M, N = map(int,input().split())\r\n\r\nprint((N * M) //2)", "n,m=map(int,input().split())\r\nif n%2==0:\r\n print(n//2*m)\r\nelif m%2==0:\r\n print(m//2*n)\r\nelse:\r\n n,m=max(n,m),min(n,m)\r\n print(m//2*n+n//2)", "a = input().split()\n\nm = int(a[0])\nn = int(a[1])\n\nnum = str((m * n) // 2)\nprint(num)\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)//2))", "#!/usr/bin/env python3\n\ndef main():\n m, n = [int(x) for x in input().split()]\n print((m * n) // 2)\n\nif __name__ == \"__main__\":\n main()\n", "import math\r\n\r\ndef main():\r\n m, n = input().split(\" \")\r\n print(math.floor(int(m) * int(n) / 2))\r\n\r\nmain()", "M, N = map(int, input().split())\n\nif M % 2 == 0 and N % 2 == 0:\n Z = M * (N // 2)\n print(Z)\nelif M % 2 == 0 or N % 2 == 0:\n Z = (M * N) // 2\n print(Z)\nelif M % 2 != 0 and N % 2 != 0:\n Z = (M * N - 1) // 2\n print(Z)\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\ns=(x*y)//2\r\nprint(s)\r\n\r\n", "m,n7=map(int,input().split())\nprint((m*n7)//2)\n\t\t\t \t \t\t \t \t\t\t\t\t\t \t\t\t \t \t", "x,y=map(int,input().split())\r\nz=((x*y)//2)\r\nprint(z)", "entrada = input().split()\r\n\r\ncalculo = int(entrada[0])*int(entrada[1])/2\r\nprint(int(calculo))\r\n", "n,m=list(map(int,input().split()))\nprint(n*m//2)\n#Q\n \t\t\t\t \t \t\t\t \t \t\t\t\t", "n,m=(int(i) for i in input().split())\r\nprint((n*m)//2) ", "n, m = map(int, input().split())\n\nif n % 2 != 0:\n n -+ -1\n\nif m % 2 != 0:\n m -+ -1\n\nprint(int((m*n)/2))\n\t \t \t \t\t \t \t\t \t \t\t\t \t", "n = input()\r\nlist1 = n.split(\" \")\r\nsq = 1\r\nfor i in list1:\r\n sq*=int(i)\r\nnum = sq//2\r\nprint(num)\r\n", "m , n = map(int,input().split())\r\ns = int(m*n/2)\r\nprint(s)", "import math\r\n\r\nn,m = map(float, input().split())\r\n\r\nprint(math.floor(n*m/2))\r\n\r\n", "k,l = map(int, input().split())\r\nprint((k*l)//2)", "import math\r\nm,n=map(int, input().split())\r\nprint(math.floor(m*n*0.5))\r\n", "m, n = input().split()\r\nm, n = int(m), int(n)\r\nprint((n*m)//2)", "M, N = map(int, input().split())\r\n\r\n# Each 2x1 domino covers 2 squares, so the total number of dominos is (M * N) / 2.\r\n# If M * N is odd, then we need to subtract 1 before performing the division.\r\ndomino_count = (M * N) // 2 if (M * N) % 2 == 0 else (M * N - 1) // 2\r\n\r\nprint(domino_count)\r\n", "a = list(map(int , input().split()))\r\nprint((a[0]*a[1])//2)", "n = input().split()\r\n\r\nl = int(n[0])\r\nb = int(n[1])\r\n\r\nprint(int((b*l)/2))", "#50A\r\nx,y = map(int,input().split())\r\nprint(x*y//2)", "NM = input().split()\r\nn = int(NM[0])\r\nm = int(NM[1])\r\n\r\nif n*m % 2 != 0:\r\n\tprint(int((n*m-1)/2))\r\nelse:\r\n\tprint(int(n*m/2))", "m,n= map(int,input().split())\r\nc= m*n\r\nif c%2==0:\r\n c//=2\r\nelse:\r\n c-=1\r\n c//=2\r\nprint(c)", "m,n = map(int,(input()).split())\r\nk=int((m*n)/2)\r\nprint(k)", "l=[int(x) for x in input().split()]\r\nc=0\r\nif l[0]==2:\r\n c+=l[1]\r\nelif l[0]==1:\r\n a=l[-1::-1]\r\n c+=(a[0]//2)\r\nelif l[0]>2:\r\n c+=((l[0]*l[1])//2)\r\nprint(c)", "m,n=map(int,input().split())\na=m*n\nb=a//2\nprint(b)#0591\n \t \t\t\t\t\t \t \t \t \t\t\t\t \t \t\t\t\t", "def max_dominoes(M, N):\r\n return (M * N) // 2\r\n\r\n# Input reading and function call\r\nif __name__ == \"__main__\":\r\n M, N = map(int, input().split())\r\n result = max_dominoes(M, N)\r\n print(result)\r\n\r\n", "\r\na, b = input().split(\" \")\r\na = int(a)\r\nb = int(b)\r\nx = int(a*b)\r\ny = int(x/2)\r\nprint(y)", "def pile_domino(m, n, domino_size=2):\r\n \"\"\" Takes two number from users, and with domino size = 2,\r\n it returns the max number of domino could fit inside the m x n board\r\n \"\"\"\r\n\r\n return (m * n) // domino_size\r\n\r\ndef main():\r\n \"\"\" The main function to take user input and process the \r\n domino count using the pile_domino function\r\n \"\"\"\r\n\r\n m, n = map(int, input().split())\r\n\r\n count = pile_domino(m, n)\r\n\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m,n=map(int,input().split())\r\n\r\nnum = m*n\r\nif n%2 == 1 and m%2==0:\r\n num=(m*n)/2\r\n \r\nelif m%2==1 and n%2==0:\r\n num=(m*n)/2\r\n \r\nelif n%2==1 and m%2==1:\r\n num=((m*n)-1)/2\r\n \r\nelse:\r\n num=m*n/2\r\n \r\nprint (int(num))\r\n", "cnt=0\r\nn,k=map(int,input().split())\r\n'''l=list(map(int,input().split()))\r\nfor i in l:\r\n if (i>=l[k-1]) & (i!=0):\r\n cnt+=1\r\n \r\nprint(cnt)'''\r\n\r\nprint(int(n*k/2)) ", "L=[int(y) for y in input().split()]\r\nx=L[0]*L[1]\r\nprint(x//2)", "m, n = map(int, input().split())\r\nif n % 2 == 0:\r\n ans = (n // 2) * m\r\n print(ans)\r\nelse:\r\n ans = (n // 2) * m\r\n ans += m // 2\r\n print(ans)", "m,n=map(int,input().split())\r\nif n%2==0:\r\n print((n//2)*m)\r\nelse:\r\n print((n//2)*m+(m//2))\r\n \r\n\r\n", "a = list(map(lambda x :int(x),input().split()))\r\na1 = a[0]\r\na2 = a[1]\r\ns = a1 * a2\r\nt = s//2\r\nprint(t)", "#from math import floor\r\n\r\nn, m = tuple(map(int, input().strip().split(' ')))\r\nprint((n*m)//2)", "nums = [int(x) for x in input().split()]\nprint(nums[0] * nums[1] // 2)\n", "x,y=(input().split())\r\nx=int(x)\r\ny=int(y)\r\nif x%2==0 or y%2==0:\r\n print(int((x*y)/2))\r\nelse:\r\n print(int(((x*y)-1)/2))", "num = input().split(' ')\nprint ((int(num[0])*int(num[1]))//2)\n\t \t\t\t \t \t\t \t \t \t\t \t\t\t\t \t", "import math\nm, n = map(int, input().split())\nprint(math.floor(m * n / 2))\n", "## CodeForces\r\n# A. Domino piling\r\n\r\n(n,m) = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nprint(n*m//2)", "al=list(map(int,input().split()))\r\nt=(al[0]*al[1])//2\r\nprint(t)", "m,n=map(int,input().split())\r\na=m*n\r\nb=int(a/2)\r\nprint(b)", "m,n = input().split()\nif (int(m)%2==0) or (int(n)%2==0):\n print(int(int(m)*int(n)/2))\nelse:\n print(int((int(m)*int(n)-1)/2))", "i = lambda:map(int, input().split())\n\nm, n = i()\n\nprint((m * n) // 2)\n", "import math\r\ndomino = 0\r\nboard = input().split(\" \")\r\nboardSize = int(board[0]) * int(board[1])\r\n\r\nprint(math.floor(boardSize / 2))", "inp = input().split(\" \")\r\ndimensions = [0, 0]\r\ndimensions[0] = int(inp[0])\r\ndimensions[1] = int(inp[1])\r\n#print(dimensions)\r\narea = dimensions[0]*dimensions[1]\r\nprint(area//2)", "n,s = map(int,input().split())\nk = n*s\nprint(k//2)\n", "a= input().split()\r\nd = int(a[0])*int(a[1])\r\nprint(d//2)", "a,b = map(int,input().split())\r\nif a % 2 == 0:print(int(a / 2 * b))\r\nelif b % 2 == 0:print(int(b / 2 * a))\r\nelif a > b:print(a // 2 * b + b // 2)\r\nelif b > a:print(b // 2 * a + a // 2) \r\nelse:print(b // 2 * a + a // 2)", "n, k = map(int, input().split())\r\n\r\nsquare = n * k\r\ndominoes = 0\r\n\r\nif square % 2 == 0:\r\n\tprint(square // 2)\r\nelse:\r\n\tprint((square // 2))", "s = input().split()\r\n\r\na = int(s[0]) * int(s[1])\r\n\r\nprint(a // 2)\r\n", "# Source: https://usaco.guide/general/io\r\n\r\n# a, b, c = map(int, input().split())\r\n# print(\"The sum of these three numbers is\", a + b + c)\r\nfrom math import prod\r\nN = prod([int(x) for x in input().split()])\r\nif N % 2 == 0:\r\n print(int(N/2))\r\nelse:\r\n print(int(N/2 - .5))\r\n\r\n\r\n", "import math\nm, n = input().split(' ')\nm = int(m)\nn = int(n)\ncount = math.floor(m*n*.5)\nprint(count)", "a,b = map(int,input().split())\r\nans=a*b\r\nif ans%2==0:\r\n print(int(ans/2))\r\nelse:\r\n print(int((ans/2)))\r\n\t \t \t\t", "n, m = ( int(i) for i in input().split() )\r\n\r\nif n % 2 == 0:\r\n print( (n // 2) * m )\r\nelif m % 2 == 0:\r\n print( (m // 2) * n )\r\nelse:\r\n print( (n // 2) * m + (m // 2) )\r\n \r\n", "m,n=map(int,input().split())\r\n\r\nx=m*n\r\nc=0\r\nfor i in range(0,x+1):\r\n if i%2==0 and i!=0:\r\n c+=1\r\nprint(c)", "a,b=map(int,input().split())\r\nn=a*b\r\nprint(n//2)\r\n", "M , N = map(int, input().split())\r\nx = int((M*N)/2)\r\nprint(x)", "m, n =map(int, input().split())\r\nans = (m*n)//2\r\nprint(ans)", "L=input().split(\" \")\r\narea=int(L[0])*int(L[1])\r\nprint(area//2)", "# cook your dish here\r\nM,N = map(int,input().split())\r\ntotal=M*N\r\nprint(total//2)\r\n", "a,b=map(int,input().split())\r\nc=int(a*b/2)\r\nprint(c)\r\n", "w= input().split()\r\nprint (int( w[0]) * int( w[1])//2)", "board = input().split(\" \")\r\nm = int(board[0])\r\nn = int(board[1])\r\narea = m * n\r\n\r\nprint(area // 2)", "import sys\r\nimport math\r\nfrom collections import defaultdict, Counter\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\ndef readInts():\r\n x = list(map(int, (sys.stdin.readline().rstrip().split())))\r\n return x[0] if len(x) == 1 else x\r\n \r\n \r\ndef readList(type=int):\r\n x = sys.stdin.readline()\r\n x = list(map(type, x.rstrip('\\n\\r').split()))\r\n return x\r\n \r\n \r\ndef readStr():\r\n x = sys.stdin.readline().rstrip('\\r\\n')\r\n return x\r\n \r\n \r\nwrite = sys.stdout.write\r\nread = sys.stdin.readline\r\n\r\n\r\n\r\n# ******************************************************************************************************************\r\n# String readStr(), List readList(), nums readInts(), write\r\n\r\n\r\n# t=readInts()\r\n# for _ in range(t):\r\nn,m=readList()\r\ntot=n*m\r\nprint(tot//2)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "m, n = map(int, input().split())\r\n\r\nmaxdom = (m*n)//2\r\n\r\nprint(maxdom)", "l=list(map(int,input().split()))\r\nprint(int(l[0]*l[1]/2))", "l=[int(x) for x in input().split()]\r\nm=l[0]\r\nn=l[1]\r\nif (m*n)%2==0:\r\n print(int((m*n)/2))\r\nelse:\r\n print(int((m*n-1)/2))", "m, n = map(int, input().split())\r\n\r\nk = m * n\r\nprint(int(k/2))\r\n", "n,k = [int(x) for x in input().split()]\r\nprint(int(n * k / 2))", "m,n = input().split()\ndominoCount = int(m) * int(n) // 2\nprint(dominoCount)\n\t \t \t\t \t\t \t\t \t \t \t \t \t\t\t", "m,n=map(int,input().split()) \r\nt=int((m*n)/2)\r\nprint(t)", "import math\r\n\r\nmn = input()\r\n\r\nbs = mn.split()\r\nfor i in range(len(bs)):\r\n bs[i] = int(bs[i])\r\n \r\ns = bs[0] * bs[1]\r\n\r\nprint(math.floor(s/2))", "m, n = map(int, input().split())\r\n\r\nsul= m*n \r\n\r\nsum_finali= sul // 2\r\n\r\nprint(sum_finali)", "st=str(input())\r\nm=int(st[0:2])\r\nn=int(st[2:])\r\np=m*n\r\nt=p//2\r\nprint(t)", "def main():\r\n data = input()\r\n\r\n (M, N) = map(int, data.split(\" \"))\r\n\r\n board = M * N\r\n\r\n if (board % 2) == 0:\r\n print(int(board / 2))\r\n else:\r\n print(int(board / 2 - 0.5))\r\n\r\n\r\nmain()\r\n", "m,n = map(int, input().split())\r\nS = m * n\r\nd = S // 2\r\n\r\n\r\n\r\nprint(d)", "from math import ceil, floor\r\n\r\n\r\nm,n=map(int,input().split())\r\na=floor((m*n)/2)\r\nprint(a)", "m, n = [int(i) for i in input().split(' ')]\n\ndomx = m // 2\n\ncount = domx * n\n\nif m % 2 == 1:\n count += n // 2\n\nprint(count)\n", "M, N = map(int, input().split()) # Read the board sizes\r\n\r\ntotal_squares = M * N # Calculate the total number of squares\r\nmax_dominoes = total_squares // 2 # Calculate the maximum number of dominoes\r\n\r\nprint(max_dominoes) # Print the result", "m,n = map(int, input().split())\r\nif 1<=m<=n<=16:\r\n s=m*n\r\n p=s//2\r\n print(p)\r\n \r\n\r\n", "n, m = map(int, input().split())\r\n\r\nif (n == 1):\r\n print(m // 2)\r\nelse:\r\n if(m % 2 == 0):\r\n print(n * (m // 2))\r\n else: \r\n print(n * (m // 2) + (n // 2))\r\n", "a,b=map(int,input().split())\nprint(a*b//2)\n\n# Tue May 17 2022 07:27:54 GMT+0000 (Coordinated Universal Time)\n", "us_i = [int(i) for i in input().split()]\r\n\r\nm = us_i[0]\r\nn = us_i[1]\r\n\r\nif m * n % 2 == 0:\r\n print(m * n // 2)\r\nelse:\r\n print(int(m * n / 2))\r\n", "m, n = input().split()\r\nsize = int(m) * int(n)\r\namount_of_dominoes = (size - size % 2) / 2\r\nprint(int(amount_of_dominoes))", "s=lambda:[*map(int, input().split())]\r\na, b=s()\r\nif a*b%2==0:\r\n print(a*b//2)\r\nelse: print(((a*b)-1)//2) ", "n, m = map(int, input().split())\r\narea = n * m\r\nficha = 2\r\nmax_fichas = area / ficha\r\nprint(int(max_fichas))", "squares=input()\r\nsquares_list=squares.split()\r\nsquares_list[0]=int(squares_list[0])\r\nsquares_list[1]=int(squares_list[1])\r\nprint((squares_list[0]*squares_list[1])//2)", "l, b = map(int, input().split())\r\narea = l * b\r\nprint(area // 2)", "def dominator(long, wide):\r\n if long == 1 and wide == 1:\r\n return 0\r\n if long == 1:\r\n return wide//2\r\n if wide == 1:\r\n return long//2\r\n numberOfDominoes=long*(wide//2)\r\n if wide%2!=0:\r\n numberOfDominoes+=long//2\r\n return numberOfDominoes\r\nlong,wide=map(int,input().split())\r\nprint(dominator(long,wide))", "width, height = map(int, input().split())\r\nprint(int((width*height/2) if (width*height) % 2 == 0 else (width*height-1)/2))\r\n", "m, n = [int(x) for x in input().split()]\r\namount = m*n//2\r\nprint(amount)", "n = input().split()\nM = int(n[0])\nN = int(n[1])\nprint ((M * N) // 2)\n", "\r\nn = input().split(' ')\r\np = int(n[0])*int(n[1])\r\nif p%2 == 0:\r\n print(int(p/2))\r\nelse:\r\n print(int((p-1)/2))", "input = input().split(' ')\r\nBoardSize = int(input[0])*int(input[1])\r\ndominoSize = 2\r\nPieces = round(BoardSize/dominoSize)\r\ncheck = Pieces * dominoSize\r\nif Pieces==0:\r\n print(Pieces)\r\n exit()\r\nif check>BoardSize:\r\n Pieces=Pieces-1\r\nprint(Pieces)", "n, k = map(int, input().split())\r\nprint(int(n * k / 2))", "mnsquares = list(map(int, input().split(\" \")))\r\nprint((mnsquares[0]*mnsquares[1])//2)", "\r\ndef solution():\r\n\r\n m, n = map(int, input().split())\r\n \r\n ans = 0\r\n if n%2 == 0:\r\n ans = m*(n//2)\r\n else:\r\n ans = m*(n//2) + (m//2)\r\n \r\n print(ans)\r\n\r\nsolution()\r\n", "vals = input().split(' ')\r\nN = int(vals[0])\r\nM = int(vals[1])\r\n\r\nprint((N*M)//2)", "from math import floor\r\nM, N = map(int, input().split())\r\n\r\nprint(floor(M*N/2))", "\r\nimport math\r\n\r\nm,n = map(int,input().split())\r\ns = 2*1\r\n\r\n\r\ndomino = int(math.floor(m * n )/2 ) \r\n\r\nprint(domino)\r\n ", "h, w = input().split()\r\nwidth = int(w)\r\nheight = int(h)\r\nintheight = height\r\ncount = 0\r\nif (width>=2)&((width%2)==0):\r\n x = width/2\r\n count = count+ (x*height)\r\nelif(width>=2)&((width%2)!=0):\r\n y = width-1\r\n z = y/2\r\n count = count +(z*height)\r\n if ((height%2)!=0):\r\n a = height-1\r\n b = a/2\r\n count = count+b\r\n\r\n else:\r\n c = height/2\r\n count = count+c\r\n\r\n\r\nprint(int(count))\r\n\r\n", "line = input()\r\nm = int(line.split()[0])\r\nn = int(line.split()[1])\r\n\r\nres = ((m * n) - (m * n) % 2) / 2\r\n\r\nprint(int(res))", "m, n = list(map(int, input().split()))\r\nsize = m * n\r\nprint(size // 2)", "m, n = map(int, input().split())\r\n\r\na = int(m*n)\r\nif a%2==0:\r\n print(int(a/2))\r\n\r\nif a%2!=0:\r\n print(int((a-1)/2))\r\n\r\n\r\n", "i=input()\r\nlst=i.split(\" \")\r\ncount=(int(lst[0])*int(lst[1]))//2\r\nprint(count)", "a,b=input().split()\r\ns=int(a)*int(b)\r\nc=int(s/2)\r\nprint(c)", "M,N = map(int,input().split())\r\nprint((M*N)//(2*1))\r\n", "n=input()\r\n# a=int(n[0])\r\n# b=int(n[2])\r\n# c=a*b\r\nif(len(n)==3 and n[1]==\" \"):\r\n a=int(n[0])\r\n b=int(n[2])\r\n c=a*b\r\n print(int(c/2))\r\n # if(c%2==0):\r\n # print(int(c/2))\r\n\r\n # else:\r\n # print(int(c/2))\r\nelif(len(n)==4 and n[1]==\" \"):\r\n a=int(n[0])\r\n e=int(n[2])\r\n f=int(n[3])\r\n g=(e*10)+f\r\n h=a*g\r\n print(int(h/2))\r\n\r\nelif(len(n)==4 and n[2]==\" \" ):\r\n a=int(n[0])\r\n i=int(n[1])\r\n j=(a*10)+i\r\n l=int(n[3])\r\n k=l*j\r\n print(int(k/2))\r\n\r\nelif(len(n)==5 and n[2]==\" \"):\r\n a=int(n[0])\r\n m=int(n[1])\r\n \r\n o=int(n[3])\r\n p=int(n[4])\r\n q=(o*10)+p\r\n n=(a*10)+m\r\n r=n*q\r\n print(int(r/2))\r\n\r\n", "_input = input()\r\n(m, n) = _input.split(' ')\r\nm = int(m)\r\nn = int(n)\r\nprint(m*n//2)", "size = input().split(\" \")\r\nsize = [int(i) for i in size]\r\n\r\nboardSize = size[0]*size[1]\r\n\r\ndom = int(boardSize // 2)\r\n\r\nprint(dom)", "a=list(map(int,input().split()))\r\nif (a[0]<=16)&(a[1]<=16):\r\n m=a[0]\r\n n=a[1]\r\n x=(m*n)//2\r\nprint(x)", "# 50A - Domino piling\r\n\r\nm, n = map(int, input().split())\r\nvalue = 0\r\n\r\nif (m % 2 == 0):\r\n value = (m // 2) * n\r\nelse:\r\n value = ((m // 2) * n) + (n // 2)\r\n\r\nprint(value)\r\n\r\n", "def check(num1,num2):\r\n if num1*num2 <= 1:\r\n return 0\r\n a = num1*num2\r\n ans = 0\r\n while a > 1:\r\n a = a-2\r\n ans = ans +1\r\n \r\n return ans\r\n\r\ninp, inp2 = map(int,input().split())\r\n\r\nprint(check(inp,inp2))", "num = list(map(int,(input().split())))\r\nx,y = num\r\nnun = (x*y)//2\r\nprint(nun)\r\n", "N,M = input().split()\r\nprint(int(N)*int(M)//2)", "lst = list(map(int, input().split()))\r\nlst = lst[0] * lst[1]\r\nprint(lst // 2)", "m,n=map(int,input().split())\r\nif m*n%2==0:\r\n luo=int(m*n/2)\r\nelif m>2 or n>2:\r\n c=max(m,n)\r\n b=min(m,n)\r\n luo=int((c//2)*b+(b//2))\r\nelse:\r\n luo=0\r\nprint(luo)", "import math\r\nn = input().split()\r\nM = int(n[0])\r\nN = int(n[1])\r\n\r\nif M % 2 == 0 and N % 2 == 0:\r\n V = M / 2\r\n # H = M / 2 - 1\r\n # 2 * V + N * H\r\n print(int(N*V))\r\nelif M % 2 == 0 and N % 2 == 1:\r\n V = M / 2\r\n # H = math.floor(N / 2)\r\n # M * V\r\n print(int(N * V))\r\nelif M % 2 == 1 and N % 2 == 0:\r\n H = N / 2\r\n V = math.floor(N / 2)\r\n # N * H\r\n print(int(M * H))\r\nelse:\r\n H = (N-1)/2 #1\r\n V = (M - 1) / 2 #1\r\n # 2*V + N * H\r\n print(int(N*V + 1 * H))", "from math import floor\r\n\r\nM,N = [int(i) for i in input().split(' ')]\r\n\r\n\r\ndef solve(M,N):\r\n M_odd = M%2!=0\r\n N_odd = N%2!=0\r\n\r\n if (M_odd and ~N_odd):\r\n return 0.5*(M-1)*N + floor(0.5*N)\r\n elif (~M_odd and N_odd):\r\n return 0.5*(N-1)*M + floor(0.5*M)\r\n elif (M_odd and N_odd):\r\n return 0.5*(N-1)*(M-1) + floor(0.5*M)+ floor(0.5*N)\r\n else:\r\n return 0.5*N*M\r\n \r\nprint(int(solve(M,N)))", "a,b=map(int,input().split())\r\nif (a*b)%2==0:\r\n print((a*b)//2)\r\nelse:\r\n print(((a*b)//2))", "m,n=map(int,input().split())\np=m*n\nif p%2==0:\n\tprint(int(p/2))\nelse:\n\td=(p-1)/2\n\tprint(int(d))\n\t \t \t\t\t\t\t\t\t \t \t \t \t\t\t \t\t", "m,n = map(int,input().split())\r\nprint(int(m*n/2))", "import math\r\n\r\nn,m = map(int,input().split())\r\nx = n* m\r\nr = math.floor(x/2)\r\nprint(r)", "m,n = map(int,input().split())\r\ntotal = int(m *n /2)\r\nprint(total)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nprint((m*n)//2)\r\n\r\n\r\n", "numbers = input().split()\r\nprint(int(int(numbers[0]) * int(numbers[1]) / 2))", "m=input()\nl=m.split(\" \")\na=int(l[0])\nb=int(l[1])\nprint(int((a*b)/2))\n \t \t\t \t \t \t \t\t \t \t\t \t", "M, N = [int(i) for i in input().split(\" \")]\nboard_size = M * N\n\nif board_size % 2 == 0:\n print(board_size // 2)\nelse:\n print((board_size - 1) // 2)\n", "n,m=map(int,input().split())\r\ns=2\r\nprint(n*m//s)", "n,k = map(int,input().split())\nc=(n*k)//2\nprint(c)\n \t \t\t \t\t \t\t\t \t\t \t \t", "\ndef cal_dominos(m, n):\n listo = []\n dominos=0\n for i in range(m):\n list0 = []\n for j in range(n):\n list0.append(0)\n listo.append(list0)\n for i in listo:\n for j in range((len(i))-1):\n if i[j] == 0 and i[j+1] == 0:\n i[j]=1\n i[j+1]=1\n dominos+=1\n \n for i in range(n):\n for j in range(m-1):\n if listo[j][i] == 0 and listo[j+1][i] == 0:\n listo[j][i] = 1 \n listo[j+1][i] = 1\n dominos+=1\n \n return dominos\n \n\nif __name__ == \"__main__\":\n m, n = map(int, input().split())\n print(cal_dominos(m, n))\n ", "#!/usr/bin/env python3\nfrom math import floor\n\ndef main():\n dims = input()\n [x,y] = [float(x) for x in dims.split()]\n \n print(floor(x*y*0.5))\n\nif __name__==\"__main__\":\n main()\n", "m, n = input().split()\r\nm, n = int(m), int(n)\r\ndomi = 2 * 1\r\nmaxdomi = (m * n) // domi\r\nprint(maxdomi)", "# Жанат: Задача 1)\r\n# 1) запросите ввод переменных m и n\r\n# 2) вычислите площадь доски\r\n# 3) вычислите сколько доминошек может вместиться на доске\r\n# 4) выведите это число на экран\r\na, b = map(int, input().split())\r\nprint(int((a*b)/2))", "m, n = input().split()\nif ((int(m) * int(n)) % 2 == 0): print((int(n) * int(m)) // 2)\nelse: print(((int(n) * int(m)) - 1) // 2)\n", "num = input().split()\r\n\r\nm = int(num[0])\r\nn = int(num[1])\r\n\r\nprint((m*n) // 2)", "inp=input().split()\r\nM = int(inp[0])\r\nN = int(inp[1])\r\n\r\n\r\nsquares=M*N\r\ncount=0;\r\n\r\n\r\nwhile (squares>1):\r\n count=count+1\r\n squares=squares-2\r\n \r\nprint(count)\r\n \r\n \r\n \r\n\r\n \r\n", "a, b = map(int, input().split())\nprint(a*b//2)\n# Tue May 17 2022 06:56:52 GMT+0000 (Coordinated Universal Time)\n", "inputValues = list(map(int, input().split()))\r\n\r\nh = inputValues[0]\r\nw = inputValues[1]\r\n\r\nmaxDom = int(h * w / 2)\r\n\r\nprint(maxDom)", "m_and_n = list(map(int, input().split())) # 2 4 # 3 3\n\nm = m_and_n[0]\n\nn = m_and_n[1]\n\nif 1 <= m <= 16 and 1 <= n <= 16:\n x = (m * n) // 2\nprint(x)\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 19 15:09:03 2023\n\n@author: huangxiaoyuan\n\"\"\"\nM,N=input().split()\nM=int(M) \nN=int(N)\nif 1<=M<=N<=16:\n if M%2==0 or N%2==0:\n s=M*N/2\n else:\n s=(M*N-1)/2\nprint(int(s))\n", "M,N = map(int,input().split())\r\nmul = M * N\r\nv = mul // 2\r\nprint(v)\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[4]:\n\n\nM, N = map(int, input().split())\nfrom math import *\nmax_domino = floor(M*N/2)\nprint(max_domino)\n\n\n# In[ ]:\n\n\n\n\n", "n,k=map(int,input().strip().split())\r\nres=int(int(n)*int(k)/2)\r\nprint(res)", "b,d=map(int,input().split())\r\nprint((b*d)//2)", "import math\r\ninp = input().split()\r\nheight = int(inp[0])\r\nlength = int(inp[1])\r\noutput = math.floor((height * length)/2)\r\nprint(output)", "m,n=map(int,input().split())\r\narea=m*n\r\nnu=area//2\r\nprint(nu)", "m,n = map(int,input().split())\r\nk=m*n\r\nif(k%2==0):\r\n print(int(k/2))\r\nelse:\r\n print(int((k-1)/2))\r\n", "M,N = list(map(int,input().split()))\r\nprint((M*N)//2)\r\n#or print(int((M//2) * N + (M%2) * (N//2)))\r\n", "n , m = list(map(int,input().split()))\r\nc=n*m//2\r\nprint(c)", "N,M=map(int,input().split())\r\nn=0\r\nwhile N*M>=2*n:\r\n n+=1\r\nprint(n-1)", "M,N = [int(x) for x in input().split()] \r\nif M%2==1 and N%2==1:\r\n print(int((M*N-1)/2))\r\nelse:\r\n print(int((M*N)/2))", "tinput=lambda:list(map(int, input().split()))\r\nm,n=tinput()\r\nprint((m*n)//2)", "#attempt3\na,b=input().split()\na=int(a)\nb=int(b)\narea=a*b\nresult=area//2\nprint(result)\n \t\t\t\t\t \t \t\t \t \t\t\t\t\t \t\t \t", "m,n=map(int,input().split())\r\nif m%2==1 and n%2==1:\r\n print(\"{}\".format(m*n//2))\r\nelse:\r\n print(\"{}\".format(m*n//2))\r\n", "x, y = input().split(\" \")\nprint(int(x)*int(y)//2)", "a,b = map(int,input().split())\nanswer = (a*b)//2\nprint(answer)\n# Tue May 17 2022 06:27:12 GMT+0000 (Coordinated Universal Time)\n\n# Tue May 17 2022 06:27:20 GMT+0000 (Coordinated Universal Time)\n", "# https://codeforces.com/problemset/problem/50/A\n\ninputs = input()\n\nn, m = inputs.split(\" \")\nn = int(n)\nm = int(m)\n\nused = set()\n\ndef fill_vertically():\n for row in range(0, m, 2):\n for col in range(n):\n if row + 1 < m:\n used.add((row, col))\n used.add((row + 1, col))\n\ndef fill_horizontally():\n for col in range(0, n, 2):\n for row in range(m):\n if col + 1 < n and (row, col) not in used and (row, col + 1) not in used:\n used.add((row, col))\n used.add((row, col + 1))\n\nfill_vertically()\nfill_horizontally()\nprint(len(used) // 2)", "arr=[int(x) for x in input().split()]\r\nres=arr[0]*arr[1]\r\nif res%2==0 : print(res//2)\r\nelse: print((res-1)//2)", "x,y = map(int, input().split())\r\nif x%2 == 0 and y%2 == 0:\r\n t = x//2 * y\r\nelif x%2 != 0 and y%2 == 0:\r\n t = y//2 * x\r\nelif x%2 == 0 and y%2 != 0:\r\n t = x//2 * y\r\nelif x%2 != 0 and y%2 != 0 and x!=1 and y!=1:\r\n t = (x-1)//2 * (y) + (y-1)//2\r\nelif x%2 != 0 and y == 1:\r\n t = (x-1)//2\r\nelif x == 1 and y%2 != 0:\r\n t = (y-1)//2\r\nelse:\r\n t = ''\r\nprint(t)", "def Dominopiling():\r\n num = input().split()\r\n M = int(num[0])\r\n N = int(num[1])\r\n max_domino = int((M*N)/2)\r\n return max_domino\r\n\r\nprint(Dominopiling())", "import math\r\na=list(map(int,input().split()))\r\nprint(math.floor(a[0]*a[1]/2))", "a = input()\r\nM = int(a[:a.find(' ')])\r\nN = int(a[a.find(' ')+1:])\r\nprint(M*N//2)", "m,n = map(int, input().split())\r\ns = m*n\r\nif (0<n<17) and (0<m<17):\r\n print(s//2)", "a,b=map(int,input().strip().split())\r\nc=a*b\r\nprint(c//2)", "n,k=map(int,input().split())\r\nprint(n*k//2)", "a, b = map(int,input().split())\r\nn = a * b\r\nn = int(n/2)\r\nprint(n)", "m , n = map(int,input().split( ))\r\n \r\nif m%2!=0 and n%2 !=0:\r\n print(int((m*n-1)/2))\r\n \r\nelse:\r\n print(int(m*n/2))", "x,y = map(int,input().split())\r\n\r\ny = (x*y)/2\r\nprint(\"%d\" %y)", "n,m=map(int,input().split())\r\nc=(n*m)//2\r\nprint(c)\r\n", "m,n=[int(i) for i in input().split()]\r\nprint(int((m*n)/2))", "ch=input()\r\nl=ch.split(\" \")\r\nn=int(l[1])\r\nm=int(l[0])\r\nif n==1 and m==1:\r\n print(0)\r\nelse:\r\n if n%2==0:\r\n print(int(n/2)*m)\r\n else:\r\n nb1=int(n/2)*m\r\n nb2=int(m/2)\r\n print(nb1+nb2)\r\n\r\n", "y,z=map(int,input().split())\r\nx=y*z//2\r\nprint(x)", "n,k= map(int,input().split())\r\n\r\na=(n*k)//2\r\n\r\nprint(a)", "p,q=input().split(\" \")\r\np=int(p)\r\nq=int(q)\r\nprint((p*q)//2)", "m,n = map(int,input().split())\r\n\r\nval = m*n\r\nprint(val//2)", "n,k=list(map(int,input().split()))\r\nif(n%2==0):\r\n print ((n//2)*k)\r\nelse:\r\n print ((n//2)*k+k//2)", "L = input().split(\" \")\nn, m = L = [int(x) for x in L]\nprint(n*m//2)", "N, M = map(int, input().split())\r\nprint(N * M // 2)\r\n", "ls = list(map(int,input().split()))\r\nprint((ls[0]*ls[1])//2)", "n=input()\r\na=n.split()\r\ny=list(map(int, a))\r\nb=y[0]*y[1]\r\nif b%2==0:\r\n x=(b/2)\r\n c=int(x)\r\n print(c)\r\nelif b%2==1:\r\n print(b//2)\r\n\r\n", "x,y=map(int,input().split())\r\na=x*y//2\r\nprint(a)", "n,m=input().split()\nn=int(n)\nm=int(m)\n\na = n*m\n\nd = a//2\nprint(d)\n \t\t \t\t \t \t\t\t\t \t\t \t\t\t", "m,n=map(int,input().split())\nif m<=n and n<=16:\n\tif m%2==0 :\n\t\tprint(int((m/2)*n))\n\telse:\n\t\tprint(int((int(m/2))*n)+int(n/2))\n \t\t\t\t \t\t\t \t \t \t\t \t \t \t\t", "first_multiple_input = input().rstrip().split()\r\n\r\nm = int(first_multiple_input[0])\r\n\r\nn = int(first_multiple_input[1])\r\n\r\n# See the pattern here. \r\n# if m == 1 and n == 1 then the answer is (1 * 1) // 2\r\nif m == 1 and n == 1:\r\n print(0)\r\n# if m == 1 and n > 1 then the answer is (1 * n) // 2\r\nelif m == 1:\r\n print(n//2)\r\n# if n == 1 and m > 1 then the answer is (m * 1) // 2\r\nelif n == 1:\r\n print(m//2)\r\nelse:\r\n# Therefore if m > 1 and n > 1 then the answer becomes (m * n) // 2\r\n print( (m * n) // 2 ) ", "m,n=map(int,input().split())\ns=m*n\npil=s//2\nprint(pil)\n\t \t\t\t\t\t \t \t\t\t \t\t \t \t\t\t", "m,n=input().split()\nif int(m)%2==0:\n\ts=int(n)*int(m)//2\nelif int(m)%2!=0 and int(n)%2!=0:\n\ts=int(n)*int(m)-1\n\ts=s//2\nelif int(m)%2!=0 and int(n)%2==0:\n\ts=int(m)*int(n)//2\nprint(s)\n", "m,n = map(int, input().split())\r\nx = (m*n)\r\nprint(x//2)", "n, m = map(int, input().split())\r\nd = 1 * 2\r\nprint((m*n) // d)", "def domino():\r\n n = list(map(int, input().split()))\r\n area = n[0] * n[1]\r\n print(int(area/2))\r\n\r\ndomino()", "from math import floor\r\n\r\nn, m = map(int, input().split())\r\nN = min(n, m)\r\nM = max(n,m)\r\nprint(floor(N / 2) * M + floor(M / 2) * int(N % 2 == 1))", "m,n = map(int, input().split(' '))\r\nA = m*n\r\nif A%2==0:\r\n print(int(A/2))\r\nelse:\r\n print(int((A-1)/2))", "n,m = map(int,input().split())\r\nh = (n*m)//2\r\nc = 0\r\nfor i in range(h):\r\n c+=1\r\nprint(c) ", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[4]:\n\n\n#50A\nnumbers = input().split()\n\nnum1 = int(numbers[0])\nnum2 = int(numbers[1])\n\nrect = 2\nif num1 == num2 :\n print(int((num1*num2)//rect))\n \nelse:\n maxx = max(num1,num2)\n minn = min(num1,num2)\n \n if maxx%2 == 0 :\n print(int(maxx/2 * minn))\n else :\n print(int(maxx//2 * minn + minn//2))\n\n", "M, N = map(int, input().split())\r\nsquares = M * N\r\ndomino = 2\r\ncount = 0\r\nwhile squares >= domino:\r\n count += 1\r\n squares -= 2\r\nprint(count)", "a = input()\r\nl = a.split()\r\n\r\nprint (int(l[0]) * int(l[1]) // 2)", "# b = int(input())\r\n\r\n\r\ndef inp():\r\n return list(map(int, input().split()))\r\n\r\n\r\n[x, y] = inp()\r\n\r\nprint(int(x*y/2))\r\n", "M,N=map(int,input().split())\r\nS=M*N\r\na=S//2\r\ncount=a\r\nprint(count)", "x,y=map(int,input().split())\r\ndef dom(x,y):\r\n if x%2==0 or y%2==0:\r\n return int(x*y/2)\r\n elif x%2!=0 and y%2!=0:\r\n return int(dom(x,y-1)+x//2)\r\nprint(dom(x,y))", "def read_int_list():\n return [int(s) for s in input().split()]\n\nm, n = read_int_list()\n\nif m % 2 == 0 or n % 2 == 0:\n print (m * n // 2)\nelse:\n print((m * n - 1) // 2)\n \n", "import math\r\nx = input()\r\nx = x.split()\r\nx = [int(i) for i in x]\r\nm = x[0]\r\nn = x[1]\r\nprint(math.floor((m*n)/2))", "x, y = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nprint(x*y // 2)", "M,N = map(int,input().split())\r\na = M*N/2\r\nprint(int(a))", "a,b=[int(z) for z in input().split()]\r\nprint((a*b)//2)", "m,k=map(int,input().split())\r\nprint((m*k)//2)", "import math\r\ninp = input().split()\r\nmax = (int(inp[0]) * int(inp[1])) / 2\r\nprint(math.floor(max))", "lista= list(map(int,input().split()))\r\nu=1\r\nfor i in lista:\r\n u*=i\r\nprint(u//2)", "n=input()\r\np = n.split()\r\nn1 = int(p[0])\r\nn2 = int(p[1])\r\nprod = n1*n2\r\nprint(prod//2)", "n,m=map(int,input().split())\r\nif(m==1 and n==1):\r\n print(0)\r\nelse:\r\n c=(m*n)//2\r\n print(c)\r\n", "\n# Online Python - IDE, Editor, Compiler, Interpreter\n\nm, n = map(int, input().split())\ntotal = int(m*n / 2)\nprint(total)", "o, p = map(int, input().split())\nmax_dominoes = (o * p) // 2\nprint (max_dominoes)\n \t\t \t \t\t \t \t\t\t\t\t \t \t\t", "n,m= map(int, input().split(' '))\r\nif n*m%2==0:\r\n\tprint(n*m//2)\r\nelse:\r\n\tprint((n*m-1)//2)", "text1 = input()\r\nfl = text1.split()\r\nfl = list(map(int, fl))\r\nop = int((fl[0] * fl[1]) / 2)\r\nprint(op)\r\n", "m, n = map(int, input().split())\r\nif m == 1 and n == 1:\r\n print(\"0\")\r\nelse:\r\n print(m * n // 2)", "from math import floor\r\na,b = map(int, input().split())\r\nprint((int(floor(a*b/2))))", "m, n = map(int, input().split())\r\ntot = m*n\r\n\r\nif tot // 2:\r\n print(tot // 2)\r\nelse:\r\n print(\"0\")", "input1=input()\r\nn=int(input1.split(\" \")[0])\r\nk=int(input1.split(\" \")[1])\r\nprint(n*k//2)", "x = [int(i) for i in input().split()]\r\ns = x[0] * x[1]\r\ns //= 2\r\nprint(s)", "import fileinput\ninp = [[int(c) for c in line.rstrip().split(' ')] for line in fileinput.input()][0]\nprint(inp[0]*inp[1]//2)\n", "a,b=input().split()\na=int(a)\nb=int(b)\nc=(a*b)/2\nprint(int(c))\n\t\t\t\t \t \t\t\t \t \t \t \t\t\t", "# Read the board size M and N\r\nM, N = map(int, input().split())\r\n\r\n# Calculate the maximum number of dominoes that can be placed\r\n# Each 2x1 domino covers 2 squares, so the total number of squares is M * N\r\n# The maximum number of dominoes that can be placed is half of the total number of squares\r\n# Since you can place them either horizontally or vertically.\r\nmax_dominoes = (M * N) // 2\r\n\r\n# Print the result\r\nprint(max_dominoes)\r\n", "B, N = map(int, input().split())\ntotal = B * N\nmaximum = total // 2\nprint(maximum)\n \t \t\t\t\t\t \t \t\t \t\t \t\t \t\t", "m, n = map(int, input().split())\r\nsq = m * n\r\nif sq % 2 != 0:\r\n sq -= 1\r\nprint(int(sq/2)) \r\n \r\n", "n,m=input().split()\r\nc=int(n);b=int(m)\r\nprint(c*b//2)", "m,n = map(int,input().split())\r\nS = m*n\r\n\r\nif (S%2) == 0 :\r\n res = S/2\r\nelse : \r\n res = S//2\r\n \r\nprint(int(res))", "li = list(map(int,input().split()))\r\nmul = li[0] * li[1]\r\nnum = mul // 2\r\nprint(num)", "m= input()\r\n\r\nnum=m.split()\r\nans=int(num[0])*int(num[1])\r\nf= ans/2\r\nif ans%2==0:\r\n print(int(ans/2))\r\nif ans%2!=0:\r\n print(int(f))\r\n", "d = list(map(int, input().split()))\r\n\r\nprint((d[0] * d[1]) // 2)\r\n", "x,y=map(int,input().split()) \nmulti=x*y\nL=2*1 \ndomp=multi//L\nprint(domp)\n \t\t \t \t \t \t \t \t \t\t\t\t \t \t\t", "l,b=map(int,input().split())\r\nprint(int((l*b)/2))", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\nx = n * k\r\n\r\nprint(x//2)", "m,n=map(int,input().split())\r\nq=m*n\r\ng=2\r\nprint(q//g)\r\n", "m,n=map(int,input().split())\r\nplochad=m*n\r\nprint(plochad//2)", "n=list(map(int,input().rstrip().split()))\r\narea=n[0]*n[1]\r\nprint(area//2)", "M,N= input().split()\r\n\r\ndomino_number=(int(M)*int(N))//2\r\n\r\nprint(domino_number)", "A=input()\r\nA=A.split()\r\nM,N=int(A[0]),int(A[1])\r\nprint(M*N//2)\r\n\r\n", "ligne = input()\r\nligne = ligne.split(\" \")\r\nx = int(ligne[0])\r\ny = int(ligne[1])\r\nfrom math import floor\r\nnb = floor(x*y/2)\r\nprint (nb)", "def main():\r\n m, n = input().split(\" \")\r\n print(int(m)*int(n) // 2)\r\n \r\n\r\nmain()", "def max_dominoes(M, N):\r\n max_dominoes = (M * N) // 2\r\n return max_dominoes\r\nM, N = map(int, input().split())\r\nresult = max_dominoes(M, N)\r\nprint(result)\r\n", "input_values = input()\r\nM, N = map(int, input_values.split())\r\nnumber = int(M/2) * N + (M % 2) * int(N/2)\r\nprint(number)", "m,n=map(int,input().split())\r\ns=m*n\r\nif s%2==0:\r\n a=s/2\r\nelse:\r\n a=s//2\r\nprint(int(a)) ", "a, b = map(int,input().split())\r\nprint(a * b // 2)\r\n", "m,n = map(int, input().split())\r\n\r\nres = int(m*n/2)\r\n\r\nprint(res)", "n,m = map(int,input().split())\r\nif n % 2 == 0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int((n-1)*m/2+m//2))", "x,y = map(int, input().split())\na = x * y\nb = a // 2\nprint(b)\n ", "nums = [int(x) for x in input().split()]\r\nprint((nums[0]*nums[1])//2)", "# your code goes here\nrow,coloumn=map(int,input().split())\na=(row*coloumn)\nz=(row*coloumn)//2\nprint(z)\n\t \t\t \t \t \t \t\t\t \t\t\t\t\t \t", "a,b=map(int,input().split())\r\nr=a*b/2\r\nprint(int(r))", "#Domino piling\nm, n = map(int, input().split())\ntotal = int(m*n / 2)\nprint(total)\n#m,n are inputs\n#total is the output\n\t \t\t \t\t \t \t \t\t \t \t \t \t\t", "# your code goes here\r\nn,m=map(int,input().split())\r\nprint((n*m)//2)\r\n", "m,n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nrow = int(m/2)\r\nresf = row*n\r\nresrow = m - row*2\r\nif resrow==1:\r\n print(int(resf+n/2))\r\nelse:\r\n print(resf)", "m,n=map(int,input().split())\r\nsquare=m*n \r\nprint(square//2)", "n,m=map(int,input().split())\ns=n*m\nprint(s//2)\n'''n and m takes the inputs'''\n'''s is the product of n and m'''\n\t \t \t\t \t\t \t \t\t \t\t\t \t \t\t \t", "x=input().split(\" \")\r\nM,N=int(x[0]),int(x[1])\r\nif M*N%2==0:\r\n print(int(M*N/2))\r\nelse:\r\n print(int((M*N-1)/2))", "r,c=map(int,input().split())\r\nif (r==c):\r\n if (r%2==0):\r\n print(int((c/2)*c))\r\n else:\r\n print((int(r/2)*r)+int(c/2))\r\nelse:\r\n if (c%2 != 0):\r\n print((int(c/2)*r)+int(r/2))\r\n elif (c%2 == 0):\r\n print(int((c/2)*r))\r\n", "inplist = input().split()\r\nprint(\"{:.0f}\".format((int(inplist[0])*int(inplist[1]))//2))", "a, b = list(map(int,input().split()))\r\n\r\narea = a * b\r\n\r\nprint(area // 2)", "m,n=input().split()\nm=int(m)\nn=int(n)\nres=(m*n/2)\nprint(int(res))\n\n\t\t \t\t \t \t\t \t\t \t \t\t\t \t \t", "M, N = map(int,input().split())\r\n\r\nif M < 1 and N < 1 :\r\n print(0)\r\n\r\nif M or N >=1 :\r\n import math\r\n A = M/2\r\n B = N/1\r\n print(math.floor(A*B))", "size=(input().split())\r\nm=int(size[0])\r\nn=int(size[1])\r\n\r\nboard=m*n\r\nmaxnum=int(board/2)\r\nprint (maxnum)\r\n", "m_n = input().split()\r\narea = int(m_n[0])*int(m_n[1])\r\n\r\nprint(area//2)", "m, n = map(int, input().split())\r\nmax_area = m * n\r\npossible_number_of_dominos = max_area // 2\r\nprint(possible_number_of_dominos)\r\n\r\n", "from math import *\r\nm,n = map(int,input().split())\r\nprint(floor(m*n/2))", "m, n = input().split()\r\nm, n = int(m), int(n)\r\n\r\nres = 0\r\n\r\ntable = [[0]*m for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if table[i][j] != 1:\r\n if j != m-1:\r\n table[i][j] = 1\r\n table[i][j+1] = 1\r\n res += 1\r\n elif i != n-1:\r\n table[i][j] = 1\r\n table[i+1][j] = 1\r\n res +=1 \r\n\r\nprint(res)", "list1 = [int(num) for num in input().split()]\r\n\r\nx = list1[0]\r\ny = list1[1]\r\ntotal = 0\r\n\r\nif y%2 != 0:\r\n total = int((y - 1) * x / 2) + int(x / 2)\r\nelse:\r\n total = int(y * x / 2)\r\nprint(total)", "Man,Nag=map(int,input().split())\r\nprint(int((Man*Nag)/2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 24 18:26:11 2021\r\n\r\n@author: Nikiq\r\n\"\"\"\r\n\r\nM, N = map(int, input().split())\r\n\r\n# for M>1\r\nif M%2 == 0:\r\n print(int(M/2*N))\r\nelif N%2 == 0:\r\n print(int(N/2*M))\r\nelif M%2 == 1:\r\n print(int((M-1)/2*N + int(N/2)))\r\nelif N%2 == 1:\r\n print(int((N-1)/2*M + int(M/2)-1))\r\n", "def max_dominoes(M, N):\r\n \r\n total_squares = M * N\r\n\r\n \r\n max_dominoes = total_squares // 2\r\n\r\n return max_dominoes\r\n\r\n\r\nM, N = map(int, input().split())\r\n\r\n\r\nmax_num_dominoes = max_dominoes(M, N)\r\nprint(max_num_dominoes)\r\n", "x, y = map(int, input().split())\r\na = int(x*y)\r\ncount = int(a/2)\r\nprint(count)", "capture = lambda:[int(i) for i in input().split(' ')]\r\nm, n = capture()\r\nprint((m*n)//2)", "n, k=map(int, input().split()) \r\nif(n>k):\r\n n,k=k,n\r\nif(n%2==0):\r\n print(n//2*k)\r\nelse:\r\n print(n//2*k+k//2)", "y=[int(x) for x in input().split()]\r\nprint((y[0]*y[1])//2)", "# Codeforces Domino piling\r\ndef inputTaker():\r\n return tuple(map(int,input().split(\" \")))\r\n\r\ndef function(*m):\r\n m = (m[0][0]*m[0][1])-1 if (m[0][0]*m[0][1])&1 else (m[0][0]*m[0][1])\r\n return m//2\r\n\r\nif __name__ == \"__main__\":\r\n print(function(inputTaker()))", "m,n = map(int,input().split())\r\narea = m*n\r\ncount = area//2\r\nprint(count)", "#A. Domino piling\r\n\r\nrec = input().split()\r\n\r\nm = int(rec[0])\r\nn = int(rec[1])\r\n\r\narea = m * n\r\n\r\nimport math\r\n\r\nif m % 2 == 0 or n % 2 == 0:\r\n print(int(area / 2))\r\nelse:\r\n print(int((area -1) / 2))", "M, T = map(int, input().split())\n\n# Calculate the total number of squares on the board\ntotal_squares = M * T\n\nmax_dominoes = total_squares // 2\n\nprint(max_dominoes)\n \t \t \t\t \t\t \t\t\t\t\t\t\t \t\t \t\t", "m,n=map(int,input().split())\r\nx=(m*n)//2\r\nprint(x)", "r,c=map(int,input().split())\r\nd=r*c\r\nprint(d//2)", "from math import floor\r\ndef main():\r\n\r\n a, b = map(int, input().split())\r\n\r\n pl = a * b\r\n if pl%2 == 0:\r\n print(int(pl/2))\r\n else:\r\n print(int(floor(pl/2)) )\r\nmain()\r\n", "lst = list(map(int, input().split()))\r\ntmp = (lst[0] * lst[1]) // 2\r\nprint(tmp)\r\n\r\n", "#!/usr/bin/env python\r\nimport sys,math\r\ninput = sys.stdin.readline\r\nexit = sys.exit\r\ndef inp():\r\n return(int(input()))\r\ndef inplst():\r\n return(list(map(int,input().split())))\r\ndef inpstr():\r\n return(input().rstrip())\r\ndef inpvar():\r\n return(map(int,input().split()))\r\ndef out(char):\r\n sys.stdout.write(str(char)+\"\\n\")\r\n return\r\n\r\n## ---- Main ---- ##\r\nr,c = inplst()\r\nout(r*c//2)", "n,m = map(int,input().split())\r\nif n%2==0 :\r\n nb= (n//2)*m\r\nelif (n%2!=0) and (m%2==0):\r\n nb=(m//2)*n\r\nelse:\r\n a=max(m,n)\r\n b=min(m,n)\r\n if b==1:\r\n nb= a//2\r\n else:\r\n nb=((b-1)//2)*a+ a//2\r\n \r\nprint(nb)\r\n", "# a = input()\r\n# a=a.replace(' ','')\r\n# k=int(a[0])*int(a[1])\r\n# print(int(k/2))\r\n\r\na,b=input().split()\r\nk=int(a)*int(b)\r\nprint(int(k/2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "m, n = [int(x) for x in input().split(' ')]\r\na = max(m, n)\r\nb = min(m, n)\r\nprint(a//2*b+a%2*b//2)", "input_numbers = [int(i) for i in input().strip().split()]\r\n\r\nM = input_numbers[0]\r\nN = input_numbers[1]\r\n\r\nresult = M * N\r\n\r\nif result % 2 == 0:\r\n\r\n print(int(result / 2))\r\nelse:\r\n result -= 1\r\n print(int(result / 2))\r\n", "x=input()\r\nl=x.split()\r\nm=int(l[0])\r\nn=int(l[1])\r\nprint((m*n)//2)", "import math\r\nm,n=map(int,input().split())\r\narea=m*n\r\nprint(math.floor(area/2))", "#take the input from the user m,n\nmI, n = map(int,input().split())\nprint(mI*n//2)\n\t\t \t \t\t \t\t\t \t\t \t \t\t \t", "m,n = input().split(\" \")\r\nm,n = int(m),int(n)\r\n\r\nx= m*n\r\n\r\nans=x//2\r\nprint(ans)", "m, n = map(int, input().split())\n\np = m * n\nd = p // 2\nprint(d)", "import math\r\na, b = tuple([int(x) for x in input().split(\" \")])\r\nprint(math.floor((a*b)/2))", "m,n=map(int,input().split())\r\narea=m*n\r\nprint(area//2)", "m,n=input(\"\").split()\r\nm=int(m)\r\nn=int(n)\r\nif((m>=1 and m<=n) and n<=16):\r\n result=(m*n)/2\r\n result=int(result)\r\n print(result)\r\nelse:\r\n exit", "(N, M) = map(int, input().split())\r\nprint((N * M) // 2)", "#Watermelon\r\n# w = int(input())\r\n# if w%2==0 and w!=2:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n#Way too long words\r\n# n = int(input())\r\n# for i in range(n):\r\n# s = input()\r\n# if len(s) <= 10:\r\n# print(s)\r\n# else:\r\n# print(s[0] + str(len(s)-2) + s[-1])\r\n\r\n# s = 'karan' \r\n# count = len(s[1:-1])\r\n# print(s[0]+str(count)+s[-1])\r\n\r\n#Team\r\n# n = int(input())\r\n# noa = 0\r\n# for i in range(n):\r\n# count = 0\r\n# l = list(map(int, input().split()))\r\n# for i in l:\r\n# if i == 1:\r\n# count +=1\r\n# if count >= 2:\r\n# noa +=1\r\n# print(noa)\r\n\r\n#Next Round\r\n# n, k = map(int, input().split())\r\n# scores = list(map(int, input().split()))\r\n# count = 0\r\n# for i in scores:\r\n# if i>0 and i>=scores[k-1]:\r\n# count+=1\r\n# print(count)\r\n\r\n#Domino Piling\r\nm,n = map(int, input().split())\r\nmax_dominos = (m*n) //2\r\nprint(max_dominos)", "import sys\r\n\r\ndef numberOfDominos(row, col):\r\n squares = row * col\r\n dominos = squares // 2\r\n return dominos\r\n\r\n# Read input from stdin\r\ninput_line = sys.stdin.readline().strip().split()\r\nrow, col = int(input_line[0]), int(input_line[1])\r\n\r\n# Calculate the number of dominos\r\ndominos = numberOfDominos(row, col)\r\n\r\n# Write output to stdout\r\nsys.stdout.write(str(dominos))\r\n", "x, y = map(int, input().split())\r\n\r\nacr = x * y\r\n\r\ndominos = acr // 2\r\n\r\nprint(dominos)", "n,m = input().split(\" \")\r\nn,m = int(n),int(m)\r\nprint(m * n // 2)\r\n", "n = input()\r\nx= n.split(' ')\r\na = x[0]\r\nb = x[1]\r\nm = (int(a)//2)*(int(b)//2)*2\r\n\r\nn = (int(a)%2)*(int(b)//2)\r\np = (int(b)%2)*(int(a)//2)\r\nprint(m+n+p)", "m,n=[int(x) for x in input().split()]\r\na=m*n\r\nb=a//2\r\nprint(b)", "m,n = list(map(int,input().split()))\r\n\r\ncount = n//2\r\ncount += (m-1)//2\r\n\r\nleft_over = (m*n)-count*2\r\ncount += left_over//2\r\nprint(count)", "# E Domino\n# source: https://www.tutorialspoint.com/python/number_min.htm\n\nn,m = input().split()\nn = int(n)\nm = int(m)\nx = min(n,m)\ny = x * x\nz = (n * m) - y\n\na = y // 2\nb = z // 2\nc = ((y % 2) + (z % 2)) // 2\n\nprint(a + b + c)\n \t \t \t \t \t\t \t\t \t\t\t\t", "x,y=map(int,input().split ())\r\na=x*y\r\ndomain=a/2\r\ndomain=int(domain)\r\nprint(domain)", "import math\r\n\r\n\r\nx, y = map(int, input().split())\r\n#n=int(input())\r\nprint(math.floor((x*y)/2))", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\nres=(m*n)//2\r\nprint(res)\r\n", "i,j = map(int, input().split())\r\nwhole = int(i*j / 2)\r\nprint(whole)", "m1,n1=map(int,input().split())\nprint(m1*n1//2)\n'''qtesoiarygsfkjagdjashdjsfha\ngsacfhsbfnsbhdgajw'''\n \t\t\t\t\t \t\t \t\t \t \t\t \t \t\t", "a,b = map(int,input().split())\nprint(a*b//2)#k\n\t\t\t \t\t \t\t\t \t\t \t\t\t \t\t \t\t", "i = input().split(' ')\r\na,b = [int(item) for item in i]\r\nprint(int(a*b/2))", "st = input()\r\nlst = st.split(\" \")\r\nm = int(lst[0])\r\nn = int(lst[1])\r\nans = (m * n) // 2\r\nprint(ans)\r\n", "def domino(M,N):\n\tH=(M*N)//2\n\tprint(H)\nM,N=map(int,input().split())\ndomino(M,N)\n\t\t\t \t\t \t\t \t\t \t\t \t\t\t \t \t \t", "# Read input\nM, N = map(int, input().split())\n\n# Calculate the maximum number of dominoes that can be placed\nmax_dominoes = (M * N) // 2\nprint(max_dominoes)", "m,n = map(int, input().split())\r\nespacios = (n * m)//2\r\nprint(espacios)", "m, n = list(map(int, input().split(' ')))\r\n\r\narea = m * n\r\nprint(area//2)\r\n", "p,q=map(int, input().split())\r\nc=(p*q)/2\r\nprint(int(c))\r\n", "inp=[int(i) for i in input().split()]\r\nM,N=inp[0],inp[1]\r\nres=(M*N)//2\r\nprint(res)\r\n", "M,N=map(int,input().split())\r\nans = (M*N)//2\r\nprint(ans)\r\n", "m,n=input().split()\nm=int(m);n=int(n)\nprint(m*n//2)", "i=input()\r\ni=i.split()\r\nprod=1\r\nfor x in i:\r\n prod=prod*int(x)\r\nprint(prod//2)", "m,n = map(int,input().split())\r\ntot = m*n\r\nans = 0\r\nif (m*n)%2 == 0:\r\n ans = m*n/2\r\n\r\nelse:\r\n ans = m*n//2\r\n\r\n\r\nans = int(ans)\r\nprint(ans)", "m,n=[int(i) for i in input().split()]\r\nfit=(m*n)//2\r\nprint(fit)", "m,n=map(int,input().split())\r\na=(m*n)//2\r\nprint(a)", "def domino_pilling(m,n):\r\n num = m * n \r\n return num//2\r\n\r\nif __name__ == \"__main__\":\r\n m,n = list(map(int,input().split()))\r\n result = domino_pilling(m,n)\r\n print(result)", "x,y = map(int,input().split())\r\nprint((x*y)//2)\r\n", "\r\ndef _main__():\r\n s = input()\r\n s1 = ''\r\n s2 = ''\r\n b = True\r\n for i in s:\r\n if i == ' ':\r\n b = False\r\n elif b:\r\n s1+=i\r\n else:\r\n s2 += i\r\n s1 = int(s1)\r\n s2 = int(s2)\r\n print(int((s1*s2)/2))\r\n\r\n_main__()\r\n", "w=input(\"\")\r\nk=w.split()\r\nm=int(k[0])\r\nn=int(k[1])\r\nif (m*n)%2==0:\r\n print(int(m*n/2))\r\nelif (m*n)%2!=0:\r\n print(int(m*n/2-0.5))", "# Read the board sizes\nJ, K = map(int, input().split())\n\n# Calculate the total number of 2x1 squares on the board\ntotal_squares = J * K\n\n# Calculate the maximum number of dominoes that can be placed\nmax_dominoes = total_squares // 2\n\n# Print the maximum number of dominoes\nprint(max_dominoes)\n \t\t\t \t\t\t\t \t\t\t\t \t \t\t\t \t \t", "m,n=map(int,input().split())\r\nv1=m*n\r\nv2=2\r\nprint(v1//v2)", "import math\r\n\r\nm, n = map(int, input().split())\r\n\r\nprint(int(math.floor(m * n / 2)))\r\n", "m, n = map(int, input().split())\r\nm, n = max(m, n), min(m, n)\r\nans = 0\r\nans = (m // 2) * n + (m % 2) * (n // 2) \r\nprint(ans)\r\n", "n,m = [int(s) for s in input().split()]\r\nprint((n*m)//2)", "m, n = map(int, input().split())\ndomino_size = 2 * 1\n# number of dominoes than can go into rectangular board\nprint(m*n//domino_size)\n", "arr1=list(map(int,input().split()))\r\nRazmerKletkix=arr1[0]\r\nRazmerKletkiy=arr1[1]\r\nDomino=RazmerKletkiy*RazmerKletkix/2\r\nprint(int(Domino))\r\n", "m, n = map(int, input().split())\r\ncount_domino = (n * m) // 2\r\nprint(count_domino)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "m, n = map(int, input().split())\r\n\r\nprint( (m * n)// 2 )\r\n", "a = input().split()\r\ni = min(int(a[0]) , int(a[1]))\r\nwhile 2 * i <= (int(a[0]) * int(a[1])):\r\n i += 1\r\nprint (i - 1)", "user_input = input().split()\n\nm = int(user_input[0])\nn = int(user_input[1])\n\nprint(int((m*n)/2))", "row,col = input().split(' ')\r\n\r\nprint(int((int(row)*int(col))/2))", "a, b = map(int, input().split())\r\nc = a*b\r\nd = c-1\r\nif c%2 == 0:\r\n print(c//2)\r\nelse:\r\n print(d//2)\r\n ", "integer_1,integer_2=[int(x) for x in input().strip().split(\" \")]\r\nif(integer_1%2==0): print(integer_1//2*integer_2)\r\nelif(integer_2%2==0): print(integer_2//2*integer_1)\r\nelse: print(integer_1//2*integer_2+integer_2//2)", "n,m=map(int,input().split())\r\nprint(n//2*m+n%2*(m//2))", "n, k = map(int, input().split(\" \"))\r\n\r\nprint(int((n*k)/2))", "n = input()\r\nsp = n.split()\r\na = int(sp[0])\r\nb = int(sp[-1])\r\nab = a * b\r\ntotal = int(ab / 2)\r\nprint(total)", "a=[int(i) for i in input().split()]\r\nm=a[0]\r\nn=a[1]\r\nif m%2==0:\r\n k=(m/2)*n\r\nelif n%2==0:\r\n k=(n/2)*m\r\nelse:\r\n k=(m//2)*n+(n//2)\r\nprint(int(k))", "x = input().split()\r\nm, n = int(x[0]), int(x[1])\r\nif m % 2 == 0 or n % 2 == 0:\r\n print((m * n) // 2)\r\nelse:\r\n print(((m * n) - 1) // 2)\r\n", "a, k = map(int, input().split())\r\n\r\nprint((a * k) // 2)", "temp = input()\r\nm,n = map(int,temp.split(\" \"))\r\n\r\ndef count(m,n):\r\n if n ==1:\r\n return m//2\r\n elif n == 1:\r\n return n//2\r\n elif m == 0 or n == 0:\r\n return 0\r\n elif m == 1 and n ==1 :\r\n return 0\r\n else:\r\n return 1+count(m,n-2)+count(m-1,2)\r\n\r\nprint (count(m,n))\r\n", "from math import floor\r\n\r\nvars = input().strip().split()\r\nm, n = int(vars[0]), int(vars[1])\r\n\r\nif m % 2 == 0:\r\n answer = m / 2 * n\r\n print(int(answer))\r\nelif n % 2 == 0:\r\n answer = n / 2 * m\r\n print(int(answer))\r\nelse: \r\n answer = (m - 1) / 2 * n + floor(n / 2)\r\n print(int(answer))\r\n \r\n", "size_string = input()\nsizelist = size_string.split(\" \")\nsize = int(sizelist[0]) * int(sizelist[1])\ndomino = size // 2\nprint(domino)", "s = input()\r\ndata = []\r\ndata.extend(int(i) for i in s.split())\r\n\r\nn = data[0]\r\nm = data[1]\r\n\r\nans = (n // 2) * (m // 2) * 2\r\n\r\nif not (n % 2 == 0 and m % 2 == 0):\r\n if n % 2 and m % 2:\r\n ans += n // 2 + m // 2\r\n elif n % 2:\r\n ans += m // 2\r\n else:\r\n ans += n // 2\r\n\r\nprint(ans)", "m,n=[int(x) for x in input().split()][:2]\r\narea=m*n\r\nmarea=area//2\r\nprint(int(marea))", "a = input().split()\r\nb = int(a[0])\r\nc = int(a[1])\r\nif (c * b) % 2 == 0:\r\n print(c*b//2)\r\nelse:\r\n print((c*b-1)//2)", "m,n=map(int,input().split())\r\nk=(m*n)//2\r\nprint(k)", "m, n = map(int,input().split())\r\nwhile True:\r\n o = m * n\r\n i = o // 2\r\n print (i)\r\n break", "m,n = map(int,input().split())\r\n\r\nif m!=0 and n!=0 :\r\n if m%2 == 0 or n%2 == 0:\r\n print((m*n)//2)\r\n \r\n else:\r\n print((m*n-1)//2)\r\n\r\nelse:\r\n print(0)", "m_n = input()\nm, n = m_n.split(\" \")\nprint(int((int(int(m) * int(n)) / (2 * 1))))", "import math\r\nA,B=map(int,input().split())\r\nC=math.floor(A*B)/2\r\nprint (int(C))", "row, col = map(int, input().split())\r\nprod = row*col\r\n\r\nsteps = 0\r\nwhile prod - 2 >= 0:\r\n prod -= 2\r\n steps += 1\r\n\r\nprint(steps)", "M,N =input().split()\r\n\r\nprint(int(int(M)*int(N)/2))\r\n\r\n ", "M,N=map(int,input().split())\r\nx=((M * N)//2)\r\nprint(x)\r\n\r\n", "m,n = list(map(int,input().split()))\nprint(int(m*n / 2))\n", "z=list(map(int,input().split()))\r\na=int(z[0])\r\nb=int(z[1])\r\nc=(a*b)//2\r\nprint(c)", "n, m = map(int, input().split())\r\ntotalSquares = n*m\r\nprint(totalSquares // 2)", "m,n = map(int, input().split())\r\n\r\nprint(int(m*n // 2))", "n,m=map(int,input().split())\nprint(n*m//2)#123124124125\n\t \t \t\t \t\t\t \t \t \t\t \t \t", "c = input().split(\" \")\r\nd = int(c[0])\r\ne = int(c[1])\r\nprint((e*d)//2)", "m,n=map(int,input().split())\r\nmulti=m*n\r\nx=2*1\r\ndomino=multi//x\r\nprint(domino)", "import sys\r\ninput = sys.stdin.readline\r\ninputLines = sys.stdin.readlines\r\n\r\n#region Helper Functions\r\ndef readIntList():\r\n return (list(map(int,input().split())))\r\ndef readStrList():\r\n return (list(map(lambda x: x.strip(), inputLines())))\r\ndef indexOf(l: list, elem: int):\r\n return l.index(elem) if elem in l else -1\r\ndef lastIndexOf(l: list, elem: int):\r\n indexes = [idx for idx, val in enumerate(l) if val == elem]\r\n return max(indexes) if len(indexes) > 0 else -1\r\n#endregion\r\n\r\ndef solution():\r\n board = readIntList()\r\n size = board[0] * board[1]\r\n result = size / 2 if size % 2 == 0 else (size - 1) / 2\r\n print(int(result))\r\n\r\nsolution()", "n,m =input().split()\nn =int(n)\nm =int(m)\na =n*m/2\nprint(int(a))\n \t \t\t\t \t\t\t\t\t \t\t\t \t \t \t \t", "m,n=map(int,input().split())\r\nk=m*n\r\nprint(k//2)\r\n", "\r\nm,n= map(int, input().split())\r\n\r\ny= (m*n)//2\r\nprint(y)", "dlina, shirina = map(int,input().split())\r\nprint((dlina*shirina)//(2*1))", "M,N = map(int,input().split())\r\nres = (M *N)/2\r\nprint(int(res))", "m,n =map(int,input().split())\r\ns=m*n\r\nprint(s//2)\r\n\r\n", "n = input()\r\nmylist = n.split(\" \")\r\nif int(mylist[0])%2 == 0 or int(mylist[1])%2 == 0 :\r\n\tprint(int(int(mylist[0])*int(mylist[1])/2))\r\nelse : print(int((int(mylist[0])*int(mylist[1])-1)/2))", "m, n = map(int, input().split())\r\nt = m*n\r\nprint(t//2)", "inp = input().split()\r\nn = int(inp[0])\r\ns = int(inp[1])\r\nresult = n * s\r\nresult = result //2\r\nprint(result)", "m,n=map(int ,input().split())\r\narea=m*n\r\nn=area//2\r\nprint(n)", "a,b=map(int,input().split())\r\nmax=(a*b)//2\r\nprint(max)", "import math\r\nn = input().split(' ')\r\nprint(math.floor((int(n[0])*int(n[1])/2)))", "inp = input()\r\nsides = inp.split(\" \")\r\narea = int(sides[0]) * int(sides[1])\r\n\r\nprint (int(area/2))", "m, n = list(map(int, input().split()))\r\nif m%2 == n%2 == 0:\r\n print(m//2 * n)\r\nelif m%2 == n%2 == 1:\r\n print((m-1)//2 * n + n//2)\r\nelse:\r\n odd = m if m%2 == 1 else n\r\n even = m if m%2 == 0 else n\r\n print(even//2 * odd)", "m=list(map(int, input().split()))\r\nprint(m[0]*m[1]//2)", "from math import prod\ni=lambda:map(int , input().split())\nl=list(i());z=1;re=prod(l)*z\nprint(int(re/2))", "number=input(\"\")\nnumber=number.split()\nnumber=[int(num) for num in number]\n\nk=number[-1]*number[0]\nm=0\nr=number[-1]\nr2=number[0]\n\nfor k in range (0,r,2):\n \n if(k==number[-1]-1):break \n \n for i in range (0,r2):\n \n \n \n m=m+1\n \n\nif(number[-1]%2!=0):\n \n for k1 in range(0,r2,2):\n \n if(k1==r2-1):\n \n break \n \n m=m+1\nprint(m) ", "def countMaxDominoes(M,N):\r\n if M % 2 == 0 or N % 2 == 0:\r\n return (M*N)//2\r\n else:\r\n return (M*N-1)//2\r\nM,N=map(int,input().split())\r\nresult=countMaxDominoes(M,N)\r\nprint(result)", "m,n=map(int,input().split())\r\ns=m*n\r\nk=s//2\r\nprint(k)", "import sys\r\nm, n = list(map(int, sys.stdin.readline().split()))\r\nprint(m * n // 2)\r\n", "m,n=list(map(int,input().split()))\r\nx=m*n\r\nprint(x//2)", "s=input().split()\r\nm,n=s\r\nm,n=int(m),int(n)\r\nprint((m*n)//2)", "L = [x for x in input().split(\" \")]\r\nx = int(L[0])\r\ny = int(L[1])\r\nA = x*y\r\na = 2*1\r\nprint(int(A/a))", "import sys\r\n\r\nboard = input()\r\ndims = board.split()\r\ndominoes = 0\r\n\r\n\r\nif dims[0] == '1' and dims[1] == '1':\r\n print(0)\r\n sys.exit()\r\n\r\n# actually calculating dominoes\r\n\r\nif int(dims[0]) % 2 == 0:\r\n dominoes = int(dims[0]) // 2 * int(dims[1])\r\n print(dominoes)\r\n\r\nelif int(dims[1]) % 2 == 0:\r\n dominoes = int(dims[1]) // 2 * int(dims[0])\r\n print(dominoes)\r\n\r\nelif int(dims[0]) > 1 and int(dims[1]) > 1:\r\n dominoes += int(dims[0]) * (int(dims[1]) - 1) // 2\r\n dominoes += int(dims[0]) // 2\r\n print(dominoes)\r\n\r\nelse:\r\n print(int(dims[dims.index('1') - 1]) // 2) \r\n", "n,m=map(int,input().split())\r\narea=n*m\r\nprint(int(area/2))", "x=str(input()).split(\" \")\r\n\r\nn=int(x[0])\r\ny=int(x[1])\r\nprint(n*y//2)", "# You are using Python\r\na,b=map(int,input().split())\r\nk=a*b//2\r\nprint(k)", "a=input()\r\nl=a.split()\r\nx=int(l[0])\r\ny=int(l[1])\r\nprint(int((x*y)/2))", "a=input()\r\nb=int(a[0:2])\r\nc=int(a[2:5])\r\nprint(b*c//2)", "m,n = map(int,input().split())\r\ncalc = m * n // 2\r\nprint(calc)\r\n", "x = input().split(' ')\r\n\r\na = int(x[0])\r\nb = int(x[1])\r\n\r\nif a%2 == 0:\r\n y = a/2 * b\r\nelif b%2 == 0:\r\n y = b/2 * a\r\nelse:\r\n if a >= b:\r\n y = a // 2 * b + b // 2\r\n else:\r\n y = b // 2 * a + a // 2\r\n\r\nprint(int(y))", "m, n = map(int, input().split())\r\nif m % 2 == 0:\r\n print((m * n) // 2)\r\nelse:\r\n print(((m - 1) * n // 2) + (n // 2))\r\n", "x,y = map(int,input().split())\r\na=int((x*y)/2)\r\nprint(a) \r\n", "import sys\nt = sys.stdin.readline().split()\nm = int(t[0])\nn = int(t[1])\nres = (m*n//2)\nprint(res)\n\t \t \t\t\t\t \t\t\t \t\t\t\t \t\t\t\t \t\t", "\r\nimport math\r\nM, N = map(int, input().split())\r\nmn = M * N\r\nresult = mn / 2\r\nprint(int(result))\r\n\r\n", "\"\"\"A solution to 50A Domino Piling.\"\"\"\r\n\r\ndef solution():\r\n v = input().split()\r\n m = int(v[0])\r\n n = int(v[1])\r\n\r\n p = m // 2\r\n q = n // 2\r\n sum = 2 * p * q;\r\n\r\n if ((m % 2 == 1) and (n % 2 == 1)):\r\n sum += p + q\r\n elif ((m % 2 == 1) and (n % 2 == 0)):\r\n sum += q\r\n elif ((m % 2 == 0) and (n % 2 == 1)):\r\n sum += p\r\n\r\n print(sum)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "m, n = map(int, input().split())\r\nsum = m * n\r\nprint(int(sum)//2)\r\n", "def read_str():\r\n return input()\r\ndef read_int():\r\n return int(input())\r\ndef read_str_array():\r\n return [str(i) for i in input().split()]\r\ndef read_int_array():\r\n return [int(i) for i in input().split()]\r\n\r\ndef solve(st):\r\n pass\r\nm,n = read_int_array()\r\nans = (m*n)//2\r\nprint(ans)", "x,y = map(int, input().split())\nif x * y % 2 == 0:\n print(int(x * y / 2))\nelse:\n print(int((x * y -1) /2)) ", "tablero=input().split(\" \")\r\ndimensiones=int(tablero[0])*int(tablero[1])\r\nif dimensiones%2==0:\r\n print(int(dimensiones/2))\r\nif dimensiones%2!=0:\r\n print(int((dimensiones-1)/2))", "import math\r\na,b=map(int,input().split())\r\nans=math.floor((a*b)/2)\r\nprint(ans)", "user_input = list(map(int, input().split()))\n\nm = user_input[0]\nn = user_input[1]\n\nprint(int((m*n)/2))", "import math\r\ni = list(map(int, input().split()))\r\nsize = i[0] * i[1]\r\nprint(math.floor(size / 2))", "x,y = map(int,input().split())\r\ns=x*y\r\n\r\nprint(s//2)", "M, N = (input().split(\" \"))\nM = int(M)\nN = int(N)\nprint(int(M * N / 2))", "M,N=map(int,input().split())\r\na=M*N\r\nb=a//2\r\nprint(b)", "from math import floor\r\na=input().split()\r\ns=floor(int(a[0])*int(a[1])/2)\r\nprint(s)", "m,n = map(int,input().split(\" \"))\r\n \r\nif(m%2 == 0):\r\n print((m//2)*n)\r\n\r\nelse:\r\n print(((m//2)*n)+n//2)", "x=input().split()\r\nn=int(x[0])\r\nm=int(x[1])\r\nc=0\r\nif n%2==0:\r\n c=(n/2)*m\r\nelse:\r\n c=int(n/2)*m+(1*int(m/2))\r\nprint(int(c))", "m, n = map(int, input().split())\r\narea = m * n\r\nmax_dominoes = area // 2\r\n\r\nprint(max_dominoes)", "p, N = map(int, input().split()) # Read M and N\n\n\nmax_dominoes = (p * N) // 2\n\nprint(max_dominoes)\n\t \t \t \t \t \t \t \t \t \t", "x, y = map(int, input().strip().split())\r\nprint(int(x*y/2))", "message = input().split()\r\nn = int(message[0]); m = int(message[1])\r\nif n % 2 == 0 or m % 2 ==0:\r\n print(int(n * m / 2))\r\nelse:\r\n print(int((n * m -1) / 2))", "temp = input().split()\r\nM = int(temp[0])\r\nN = int(temp[1])\r\ncount = 0\r\nresidue = 0\r\n\r\n\r\ndef maxPiles(M, N, count, residue):\r\n if M == N:\r\n if M % 2 == 0:\r\n count += M*M//2\r\n if residue == 2:\r\n count += 1\r\n return count, residue\r\n else:\r\n count += M*M//2\r\n residue += 1\r\n if residue == 2:\r\n count += 1\r\n residue = 0\r\n return count, residue\r\n\r\n elif M == 1 or N == 1:\r\n if M != 1:\r\n if M % 2 != 0:\r\n residue += 1\r\n if residue == 2:\r\n count += 1\r\n residue = 0\r\n count += M//2\r\n return count, residue\r\n else:\r\n if N % 2 != 0:\r\n residue += 1\r\n if residue == 2:\r\n count += 1\r\n residue = 0\r\n count += N//2\r\n return count, residue\r\n else:\r\n if M > N:\r\n if N % 2 != 0:\r\n residue += 1\r\n if residue == 2:\r\n count += 1\r\n residue = 0\r\n count += N*N//2\r\n return maxPiles(M-N, N, count, residue)\r\n else:\r\n if M % 2 != 0:\r\n residue += 1\r\n if residue == 2:\r\n count += 1\r\n residue = 0\r\n count += M*M//2\r\n return maxPiles(N-M, M, count, residue)\r\n\r\n\r\ncount, residue = maxPiles(M, N, count, residue)\r\nprint(count)\r\n", "M,N=map(int,input().split())\r\na=int(M*N/2)\r\nprint(a)", "m,n = input().split()\r\nm = int(m); n = int(n)\r\nif (m*n) % 2 == 0:\r\n print(int((m*n)/2))\r\nelse:\r\n print(int((m*n-1)/2))", "M,N=map(int,input( ).split( ))\nprint((M*N)//2)#Qb\n \t \t\t \t \t \t \t\t \t \t\t \t \t \t\t\t\t", "m, n = map(int, input().split())\r\ns_domino = 2\r\ns_rectangle = m*n\r\nn = s_rectangle//s_domino\r\n\r\nprint(n)", "n, m = [int(item) for item in input().split(' ')]\r\n\r\nprint((n*m)//2)", "m, n = map(int, input().split())\r\ncount = 0\r\nif m==2:\r\n count+=n\r\nelif m > 2:\r\n count += (m//2)*n \r\n if m%2==1:\r\n count += n//2\r\nelif m==1:\r\n count += n//2\r\nprint(count)\r\n", "dimensions = input()\r\ndimensions = dimensions.split()\r\nfor i in range(len(dimensions)):\r\n dimensions[i] = int(dimensions[i])\r\nif dimensions[0] % 2 == 0 or dimensions[1] % 2 == 0:\r\n print(int(dimensions[0] * dimensions[1] / 2))\r\nelse:\r\n print(int((dimensions[0] * dimensions[1] / 2) - 0.5))", "n, m = input().split()\r\nn, m = int(n), int(m)\r\nprint(int((n * m) / 2))\r\n", "a,b=map(int,input().split())\r\nc=a*b\r\nif c%2:\r\n c-=1\r\nprint(c//2)", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nd = a*b\r\noutput = (d//2)\r\nprint(output)", "def func(arg):\n cout = 0\n\n m, n = arg\n\n t = m * n\n\n return t // 2\n\n\ninp = list(map(int, input().split()))\n\nprint(func(inp))\n ", "a,b=list(map(int,input().split()))\ntemp=a//2\nans=b*temp\nif a%2!=0:\n\tans+=b//2\nprint(ans)", "m, n = map(int,input().split())\r\ndominos = (m * n) // 2\r\nprint(dominos)", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\narea = a*b\r\nprint(area//2)\r\n", "a=input().split()\r\nb=int(a[0])\r\nv=int(a[1])\r\ns=v*b\r\nr=2\r\ng=s//r\r\nprint(g)", "import math as g\r\nn,m=map(int,input().split())\r\nprint(g.floor((n*m)/2))", "n, m = map(int, input().split())\r\n\r\ns = m * n\r\n\r\nd = int(s/2)\r\n\r\nprint(d)\r\n", "m,n= list(map(int , input().split()))\r\nif m%2==1 and n%2==1: print (int(((m*n) -1)/2))\r\nelse : print (int(m*n/2))", "import sys\nx,y=map(int,input().split())\na=(x*y)//2\nsys.stdout.write(str(a))\n\t \t \t \t\t\t \t \t\t \t\t\t \t", "#domino\r\nm,n = map(int, input().split())\r\nAns =(m*n // 2)\r\nprint(Ans)\r\n", "M, N = [int(x) for x in input().split()]\nArea = M*N\nprint(Area//2)", "m,n = map(int, input().split())\r\nx = m*n\r\nif x%2 == 0:\r\n print(x//2)\r\nelse:\r\n print((x-1)//2)", "a,b = map(int, input().split())\r\ns=a*b\r\nprint(s//2)", "n, m = map(int,input().split())\r\nprint((n * m) // 2)", "(m,n)=list(map(int,input().split()))\r\narea=m*n\r\ndom_area=2\r\nprint(area//dom_area)", "m,n = map(int,input().split())\r\nif m%2==0:\r\n print((m//2)*n)\r\nelse:\r\n print((m//2)*n+(n//2))", "a,b=map(int,input().split())\r\ntotal=int(a*b /2)\r\nprint(total)", "inn = input().split()\r\nl = []\r\nl.extend(inn)\r\nprint((int(l[0])*int(l[1]))//2)\r\n", "pole = input()\r\na = pole.split(\" \")\r\na1 = int(a[0])\r\na2 = int(a[1])\r\ns = a1 * a2\r\nprint(s//2)", "m,n = map(int,input().split())\r\narea = m*n\r\nprint((m*n)//2)", "a, b = map(int,input().split())\nr = (a*b)//2\nprint(r)\n \t\t\t \t\t\t \t \t\t \t \t \t \t \t", "m, n = map(int, input().split())\r\n\r\nboard = int(m * n / 2)\r\n\r\nprint(board)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nif 1<=m and m<=n and n<=16:\r\n mn=m*n\r\n mn//= 2\r\nprint(mn)", "M, N = map(int, input().split())\r\na = M*N\r\nb = a//2\r\nprint(b)", "m,n=map(int,input().split())\r\nk=m*n\r\nn=int(k)\r\ns=n//2\r\nprint(s)", "x = input().split()\r\na = int(x[0]) * int(x[1])\r\nprint(a//2)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n \r\nS = n*m\r\n \r\nif n>=1 and m>=n and m<=16:\r\n T = S//2\r\n print(T)", "m,n=map(int,input().split())\r\nif(m>1 or n>1):\r\n tot=m*n\r\n cnt=tot//2 \r\nelse:\r\n cnt=0\r\nprint(cnt)\r\n", "a=input()\r\nlist=a.split(\" \")\r\nb=list[0]\r\nc=list[1]\r\nAr= int(b)*int(c)\r\nprint(int(Ar/2))", "d=input().split()\r\np=int(d[0])\r\nf=int(d[1])\r\ng=f*p\r\ns=g//2\r\nprint(s)", "a,b=map(int,input().split())\r\na=a*b\r\nb=2\r\nprint(a//2)", "m, n = map(int, input().split())\r\nif m%2==0:\r\n print((m//2)*n)\r\nelif n%2==0:\r\n print((n//2)*m)\r\nelse:\r\n print((n//2)*m + m//2)", "m, n = map(int,input().split())\nrectangular = (m*n)//2\nprint(rectangular)", "m,n=map(int,input().split())\r\ns=m*n\r\nq=s//2\r\nprint(q)", "arealist = input().split()\r\narea = int(arealist[0]) * int(arealist[1])\r\n\r\nprint(int(area/2))", "x,y=map(int,input().split())\r\nres=(x*y)//2\r\nprint(int(res))", "myin = input().split()\r\nm, n = [int(x) for x in myin]\r\n\r\nprint(int((m * n) // 2))\r\n", "arr = input().split()\r\ns = int(arr[0]) * int(arr[1])\r\nprint(s // 2)", "list1=list(map(int,input().split())) \r\nprint(list1[0]*list1[1]//2)", "import math\r\nm,n=map(int,input().split())\r\nx=math.floor(m*n/2)\r\nprint(x)\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[2]:\n\n\ninp=input().split()\nm,n=int(inp[0]),int(inp[1])\nprint((m*n)//2)\n\n\n# In[ ]:\n\n\n\n\n", "import math\r\n\r\na1 = input() + \" \"\r\n\r\narr = []\r\nnum = \"\"\r\n\r\nfor x in a1:\r\n if x != \" \":\r\n num += x\r\n elif x == \" \":\r\n arr.append(int(num))\r\n num = \"\"\r\nres = 0\r\nif arr[0]%2 == 0:\r\n res = (arr[0]/2)*arr[1]\r\nelif arr[1]%2 == 0:\r\n res = (arr[1]/2)*arr[0]\r\nelse :\r\n res = (arr[0]*arr[1])/(2*1)\r\nprint(math.floor(res))", "def f(sp):\r\n return sp[0] * sp[1]\r\n \r\nprint(f(list(map(int,input().split()))) // 2)", "p,q=map(int,input().split())\nA1=int(p*q/2)\nprint(A1)\n \t \t\t\t \t\t\t\t \t\t \t \t \t \t \t\t\t", "import math\nsize=list(map(int,input().split(' ')))\nm=size[0]\nn=size[1]\n\nprint(math.floor(m*n/2))\n", "m, n = [int(i) for i in input().split()]\r\nprint(m * n // 2)", "\r\ndim = list(map(int, input().split()))\r\n\r\nsize = int(dim[0]*dim[1]/2)\r\n\r\nprint(size)\r\n", "a,b = map(int, input().split())\r\narea = a*b\r\nc = area//2\r\nprint(c)", "import math\r\nn,m=[int(x) for x in input().split()]\r\n\r\nprint(((n*m)//2))", "m,n = input().split()\r\narea = int(m)*int(n)\r\nprint(area//2)", "def dominos(x,y):\r\n p = x*y\r\n domino = p//2;\r\n return domino\r\n\r\nx,y= map(int,input().split())\r\n\r\nd=dominos(x,y);\r\n\r\nprint(d)", "m,n=map(int,input().split())\r\nl=2\r\nb=1\r\nd1=int((m/l)*(n/b))\r\nd2=int((m/b)*(n/l))\r\nprint(max(d1,d2))", "m,n=map(int,input().split())\r\nprint(int((m*n/2)))\r\n", "def dominos(sq1, sq2):\r\n return (sq1*sq2)//2\r\n\r\nif __name__ == '__main__':\r\n sq1, sq2= map(int, input().split())\r\n result = dominos(sq1, sq2)\r\n print(result)", "a, b = map(int,input().split())\r\ns = a * b\r\nprint(int(s / 2))\r\n", "m, n = map(int, input().split())\r\narea_board = m * n\r\narea_domino = 2 * 1\r\nmax_domino = area_board // area_domino\r\nprint(max_domino)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Apr 28 19:26:35 2021\r\n\r\n@author: magma\r\n\"\"\"\r\n\r\nm,n = input().split()\r\nm=int(m)\r\nn=int(n)\r\nprint(m*n//2)", "x,y=map(int,input().split())\r\nz=x*y\r\nprint(z//2)", "m, n = input().split()\r\nm = int(m)\r\nn= int(n)\r\nx = m*n\r\nif x%2 == 0:\r\n print(int(x/2))\r\nelse:\r\n print(int((x-1)/2))", "m,n=map(int,input().split())\r\nprint(int(m*n/2))\r\n", "M,N=input().split()\r\nprint(int(M)*int(N)//2)", "L,B=map(int,input().split())\r\nprint((L*B)//2)", "a=list(map(int,input().split()))\r\narea=a[0]*a[1]\r\nprint(area//2)", "m, n = input().split()\nprint(int(int(m) * int(n) / 2))\n\n\t \t \t \t \t \t\t\t\t \t \t \t\t\t", "from math import floor\n\nm, n = map(int, input().split(' '))\n\nresult = (m*n)/2\n\nprint(floor(result))", "x=input().split(\" \")\r\nx=[int(num)for num in x]\r\nm=x[0]\r\nn=x[1]\r\narea=m*n\r\nprint(area//2)", "x,y=map(int ,input().split())\r\nz=x*y\r\nif z%2==0:\r\n print(int(z/2))\r\nelse:\r\n print(z//2)\r\n\r\n\r\n", "n = input()\r\n\r\nnum = n.split()\r\n\r\nsize = int(num[0]) * int(num[1])\r\nprint(size // 2)", "m, n = map(int, input().split())\r\nif m % 2 == 1 and n % 2 == 1:\r\n if m == 1:\r\n print(n // 2)\r\n else:\r\n print((n - 1) * m // 2 + m // 2)\r\nelse:\r\n print(n * m // 2)", "import os\r\nm, n = [int(i) for i in input().split()]\r\nprint(m*n//2)\r\nos.system('pause')", "m,n = map(int, input().split())\r\ne1 = m*n\r\ndom_piece = 2*1\r\nprint((e1)//dom_piece)", "import sys\n\n\ndef main():\n m, n = map(int, sys.stdin.readline().strip().split())\n return (m * n) // 2\n\n\nif __name__ == '__main__':\n print(main())\n", "m,n=input().split() #taking inputs\nprint((int(m)*int(n))//2) #printing themout\n\t\t \t \t \t\t\t \t\t\t \t\t\t \t\t\t \t\t\t", "x, y = map(int, input(\"\").split())\r\nprint(x * y // 2)", "m,n = map(int,input().split(' '))\r\nS = ((m / 2) * n )\r\nprint(int(S))", "a,b=map(int,input().split())\r\nn=(a*b)//2\r\nprint(n)", "x,y = map(int,input().split())\narea = x*y\nprint(area // 2)\n\t\t\t \t\t\t \t\t\t\t \t \t \t\t \t\t \t", "m,n=input().split()\r\nm= int(m)\r\nn= int(n)\r\narea= m*n\r\n\r\nif area %2==0:\r\n result= area/2\r\n print(int(result))\r\nelse:\r\n area=area-1\r\n result = area/2\r\n print(int(result))\r\n\r\n", "board = str(input())\r\nx= board.split()\r\nsize = 1\r\nfor i in x:\r\n y= int(i)\r\n size = size * y\r\n\r\ndomino = size //2\r\nprint(domino)", "# -*- coding: utf-8 -*-\n\"\"\"Domino piling.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/10h04xDpD21WjMLthS1ePOeyRpBbIRQ27\n\"\"\"\n\na,b=map(int,input().split())\nprint(a*b//2)", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\ni=(m*n//2)\r\n\r\nprint(i)\r\n", "n,m = map(int,input().split())\r\nb = (n * m)/2\r\nprint(int(b))", "rows,columns=input().split()\r\nprint((int(rows)*int(columns))//2)\r\n\r\n", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n, m = map(int, input().split())\n print((n*m)//2)\n\n \t\t \t \t\t\t\t\t\t\t\t \t\t\t\t \t \t", "M, N = map(int, input().split())\r\nnum = M * N // 2\r\nprint(num)", "num = input().split()\r\nlst = []\r\nfor i in num:\r\n x = int(i)\r\n lst.append(x)\r\na = lst[0]*lst[1]\r\nprint(int(abs(a/2)))", "M, N = map(int, input().split()) \r\nif M % 2 == 0 or N % 2 == 0:\r\n max_dominos = (M * N) // 2\r\nelse:\r\n max_dominos = (M * N - 1) // 2\r\nprint(max_dominos) \r\n", "dim=[int(dig) for dig in input().split(\" \")]\r\nprint((dim[0]*dim[1])//2)\r\n", "def dominoPilling():\r\n m,n=map(int,input().split())\r\n return m*n//2\r\n\r\nprint(dominoPilling())", "n=list(map(int,input().split()))\r\nx=n[0]*n[1]\r\nprint(x//2)", "m, n = map(int, input().split())\r\nmn = m*n\r\nprint(mn//2)", "\r\nm, n = map(int, input().split())\r\nprint( (n * m) // 2)", "v,n=map(int,input().split())\r\nvastus=0\r\nif v%2==0:\r\n vastus=v*n/2\r\nelse:\r\n if n%2==0:\r\n vastus=v*n/2\r\n else:\r\n vastus=((v*n)-1)/2\r\nvastus=int(vastus)\r\nprint(str(vastus))", "import math\n\ndef main():\n m,n=map(int,input().split())\n if int(n) % 2 == int(0):\n print(int((n/2)*m))\n else:\n a_1 = ((n-1)/2)*m\n if int(m) % 2 == int(0):\n a_2 = m/2\n print(int(a_1+a_2))\n else:\n a_2 = (m-1) / 2\n print(int(a_1 + a_2))\n\nmain()", "a,b=map(int,input().split())\r\nif((a*b)%2==0):\r\n print(a*b//2)\r\nelse:\r\n print(((a*b)-1)//2)", "m, n = map(int,input().split())\nx = n*m/2\ny = int(x)\nprint(y)\n\t\t\t \t\t\t\t \t\t\t \t\t \t \t \t\t\t \t", "n,m=list(map(int,input().split()))\r\ns=(m*n)//2\r\nprint(s)", "# Read the board sizes\nm, n = map(int, input().split())\n\n# Calculate the total number of squares on the board\ntotal_squares = m * n\n\n# Calculate the maximum number of dominoes that can be placed\nmax_dominoes = total_squares // 2\n\n# Print the result\nprint(max_dominoes)\n\n \t \t\t \t\t\t\t \t \t", "import math\r\n\r\ndef dominoPiling(m,n):\r\n if(m < 1 or n < 1):\r\n return 0\r\n area = m * n\r\n maxDominos = math.floor(area / 2)\r\n return maxDominos\r\n\r\ninput = input().split()\r\ndominoParams = []\r\n\r\nfor element in input:\r\n numElement = int(element)\r\n dominoParams.append(numElement)\r\n\r\nprint(dominoPiling(dominoParams[0], dominoParams[1]))", "n,m=map(int,input().split())\r\nprint(n//1*m//2)", "n,k = map(int,input().split())\r\ndomino=2\r\nspace=(n*k)\r\nnum_ofdomino=(int(space/2))\r\nprint(num_ofdomino)\r\n", "\r\nmn = input().split()\r\nmni=[]\r\nfor i in mn:\r\n mni.append(int(i))\r\n\r\nm=mni[0]\r\nn=mni[1]\r\nif m%2!=0 and n%2!=0:\r\n ans= (n-1)*m//2+m//2\r\nelse:\r\n ans=n*m//2\r\nprint(ans)", "M,N=map(int,input().split())\r\nif(1<=M and N<=16 and M<=N):\r\n n=(M*N)//2\r\n print(n)", "M,N=list(input().split(\" \"))\r\nM=int(M)\r\nN=int(N)\r\nans=(M//2)*N\r\nif M%2!=0:\r\n ans+=N//2\r\nprint(ans)\r\n ", "m,n=map(int,input().split())\r\nt=int(m*n/2)\r\nprint(t)", "b,h = map(int, input().split())\r\nans=(b*h)//(2*1)\r\nprint(ans)\r\n", "p, l = input().split()\np = int(p)\nl = int(l)\nluas = p*l\nprint(luas//2)", "qwe=input().split()\r\na=int(qwe[0])\r\nb=int(qwe[1])\r\nif (a*b)%2==0:\r\n print(a*b//2)\r\nelse:\r\n print((a*b-1)//2)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[22]:\n\n\nuser= input().split(\" \")\nx= int(user[0]) * int(user[1])\nprint(x//2)\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "a, b = map(int, input().split())\n\ntotal_dominoes = 0\n\npar_dom = a//2 * b\ntotal_dominoes += par_dom\n\nif (a%2 == 1):\n total_dominoes += b//2\nprint (total_dominoes)\n\t\t \t \t \t\t\t\t\t \t \t\t \t\t", "m, n = map(int, input().split())\nprint(m*n//2) # if no more than one odd - whole board is used, else one square remains unoccupied\n", "import math\r\nm, n = map(int, input().split())\r\na = m * n\r\nr = math.floor(a / 2)\r\nprint(r)", "k=list(map(int,input().split()))\r\nn=k[1]*k[0]\r\nprint((n//2))\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Generador de .py\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/16Daun10dttom85YSfr296SK11egu4Pic\n\"\"\"\n\na= input()\r\nb=list(a)\r\ncont=list()\r\nfinal= list()\r\n\r\nfor i in range(len(a)):\r\n\r\n if b[i]!=\" \":\r\n cont.append(b[i]) \r\n\r\nif len(cont)== 3: \r\n final.append(int(cont[0]))\r\n final.append(int(cont[1]+cont[2]))\r\nelif len(cont)== 4: \r\n final.append(int(cont[0]+cont[1]))\r\n final.append(int(cont[2]+cont[3]))\r\nelse:\r\n final.append(int(cont[0]))\r\n final.append(int(cont[1]))\r\n\r\n\r\nprint(str(int((final[0]*final[1])/2)))", "\r\nn, k = list(map(int, input().split()))\r\nprint(n*k//2)\r\n", "while True:\r\n m,n = map(int, input().split())\r\n if 1 <= m <= 16 and 1 <= n <= 16:\r\n break\r\n else:\r\n pass\r\nsize = m * n\r\nprint(size//2)", "m,n=list(map(int,input().split()))\r\ns=m*n\r\nd=0\r\nwhile s>=2:\r\n s-=2\r\n d+=1\r\n\r\nprint(d)", "#Problem E: Devise a program that ascertains the maximum number of 2-by-1 domino tiles that can occupy an MxN rectangle \n#subject to the constraint that the domino tiles must lie flat, cannot overlap, and cannot be stacked on top of each other.\nm,n = input().split()\nm = int(m)\nn = int(n)\nArea = m*n\nMax_Number_of_Domino_Tiles = Area//2\nprint(Max_Number_of_Domino_Tiles)\n \t \t\t \t \t\t \t \t \t \t\t \t\t\t", "def domain(x,y):\r\n return (x*y)//2\r\nx,y=map(int,input().split())\r\nprint(domain(x,y))\r\n", "M,N = input().split()\r\n\r\nsquares = int(M) * int(N)\r\nprint(squares // 2)", "size = input().split()\r\n\r\nsize_m = int(size[0])\r\nsize_n = int(size[1])\r\n\r\nsize_square = size_m * size_n\r\n\r\nprint(int(size_square / 2))\r\n\r\n", "M, N = input().split(\" \")\r\nM, N = int(M), int(N)\r\n\r\nprint(M * N // 2)", "a,b = map(int,input().split())\r\nc = a*b\r\nd = c/2\r\nprint(int(d))", "x=list(map(int,input().split()))\r\ns=x[0]*x[1]\r\nprint(s//2)", "m,n = list(map(int,input().strip().split()))\nc = int(m*n//2)\nprint(c)", "t=input()\r\nn=t.split(' ')\r\nx=int(n[0])*int(n[1])\r\nprint(x//2)", "inp=input().split()\r\ninp=[int(i) for i in inp]\r\nsquares=inp[0]*inp[1]\r\nprint(squares//2)", "a, b = map(int, input().split())\nprint(a*b//2)\n# Tue May 17 2022 06:21:02 GMT+0000 (Coordinated Universal Time)\n\n# Tue May 17 2022 06:21:10 GMT+0000 (Coordinated Universal Time)\n", "n,m=map(int,input().split())\r\nprint(m*(n//2)+m//2*(n%2))", "def squareOff(M:int, N:int)->int:\r\n dominoes = 0\r\n s = min(N, M)\r\n l = max(N, M)\r\n dominoes += s//2*l\r\n if s % 2 != 0:\r\n dominoes += l//2\r\n print(dominoes)\r\n \r\n \r\ninput = input().split(' ')\r\n \r\nM = int(input[0])\r\nN = int(input[1])\r\nsquareOff(M, N)", "from math import floor\r\nn,m=map(int,input().split())\r\ns=n*m\r\ny=s%2\r\nif y==0:\r\n f=s/2\r\n print(int(f))\r\nelse:\r\n g=s/2\r\n f=floor(g)\r\n print(f)", "num=str(input()).split(\" \")\nn=int(num[0])\nk=int(num[-1])\n\nprint(n*k//2)\n", "n, m=[int(el) for el in input().split()]\r\nprint(n*m//2) ", "(m,n)=[int(x) for x in input().split()]\r\nz=m*n\r\nif z%2==0:\r\n print(int(z/2))\r\nelse:\r\n print(z//2)\r\n\r\n", "h, w = map(int, input().split())\r\nprint(h*w // 2)", "x, y = [int(x) for x in input().split()]\r\n\r\nboard = x*y\r\n\r\nif board % 2 == 0 :\r\n print (board//2)\r\nelse: \r\n print (board//2)", "x, y = map(int, input().split())\r\nz = x * y\r\nk = z // 2\r\nprint(k)", "M, N = input().split()\n\nM = int(M)\nN = int(N)\n\nresult = M * N // 2\n\nprint(result)\n \n \t\t\t\t\t \t \t\t \t\t\t\t \t\t \t \t", "a, b = [int(i) for i in input().split(\" \")]\r\nsquare = a*b\r\ndominoes = square/2\r\nif (square % 2) == 0:\r\n print(int(dominoes))\r\nelse:\r\n print(int((square-1)/2))", "import math\r\nn,m=[int(i) for i in input().split()]\r\n#print((n*m)//2)\r\nprint(math.floor((m*n)/2))", "M, N = map(int, input().split()) # Board sizes\n\ntotal_squares = M * N # Total number of squares on the board\nmax_dominoes = total_squares // 2 # Maximum number of dominoes that can be placed\n\nprint(max_dominoes)\n\n\t \t\t\t\t\t \t\t \t \t \t\t\t \t \t\t \t\t\t\t\t\t", "m, n = map(int, input().split())\nif (m % 2 == 1) & (n % 2 == 1):\n print(int(((m * n) - 1) / 2))\nelse:\n print(int(m * n / 2))\n", "m,n = input().split()\r\nm,n = int(m), int(n)\r\nprint(int(m*n / 2))", "height_and_width = input()\r\nheight_and_width_split = height_and_width.split()\r\nheight = int(height_and_width_split[0])\r\nwidth = int(height_and_width_split[1])\r\nsurface = height * width\r\nif surface%2 == 0 :\r\n\tdominos = int(surface/2)\r\n\tprint(dominos)\r\nelse :\r\n\tdominos = int((surface-1)/2)\r\n\tprint(dominos)\r\n", "x,y = map(int,input().split())\r\narea= x*y\r\nif area%2==0:\r\n ans=int(area/2)\r\nelse:\r\n ans=int(area/2)\r\nprint(ans)", "m,n = map(int, input().split())\r\nresult = 0\r\nif (m % 2 ==0):\r\n result = (m//2)* n\r\nelse:\r\n result = ((m//2)* n) + n//2\r\nprint(result)", "num1,num2=input().split(\" \")\r\n#print(num1,num2)\r\nboard_size=int(num1)*int(num2)\r\ndomino_size=2\r\nprint(int(board_size//domino_size))", "inp = [int(x) for x in input().split(\" \")]\r\nm = inp[0]\r\nn = inp[1]\r\n#pustimo samo int dio\r\nprint(int((m*n)/2))", "from math import floor\r\nx = input().split()\r\nprint(floor((int(x[0])*int(x[1])/2)))\r\n", "q = input().split()\r\na = int(q[0])\r\nb = int(q[1])\r\nprint((a // 2) * b + ((a % 2) * b) // 2)", "m, n = input().split()\r\nn = int(n)\r\nm = int(m)\r\ns = m * n\r\na = 2 * 1\r\nd = s // a\r\nprint(d)", "n, m = tuple(int(i) for i in input().split())\r\n\r\nif n * m % 2:\r\n print((n * m - 1) // 2)\r\nelse:\r\n print(n * m // 2)", "if __name__ == '__main__':\r\n m, n = input().split()\r\n m, n = int(m), int(n)\r\n ctr = int(0)\r\n if m == 1 and n == 1:\r\n print(0)\r\n else:\r\n print((m*n) // 2)\r\n \r\n", "m, n=map(int, input().split())\ntotal=int(m*n/2)\nprint(total)#vishal\n\n\n\n \t \t \t\t\t \t \t\t \t \t\t \t\t\t\t\t", "m,n=[int(x) for x in input().split()]\r\nif (m*n)%2==0:\r\n print(m*n//2)\r\nelse:\r\n s=(m-1)*(n-1)//2+m//2+n//2\r\n print(s)\r\n ", "m,n = input().split()\nm = int(m)\nn = int(n)\nprint (int(m*n/2))\n \t \t \t \t\t\t\t \t\t \t \t\t\t\t \t\t", "m, n = [int(i) for i in input().split()]\r\nprint(m*n//2)", "import math\r\n\r\nm, n = [int(i) for i in input().split()]\r\n\r\nprint(math.floor(m*n/2))", "A = input().split(\" \")\r\nx,y = int(A[0]),int(A[1])\r\nprint(int(x*y / 2))", "m, n = map(int, input().split())\r\nfinal = m * n // 2\r\nprint(final)", "M, N = map(int, input().split())\r\ns= (M*N)//2\r\nprint(s)", "m,n = (input()).split()\r\nm = int(m)\r\nn = int(n)\r\ncount = 0\r\nfor i in range(1, n*m):\r\n if(2*i>n*m):\r\n break\r\n else:\r\n count=count+1\r\nprint(count)", "M,N=input().split()\r\nM,N=int(M),int(N)\r\nprint((M*N)//2)", "\r\n\r\nn,m=map(int,input().split())\r\nprint(int(n*m/2))\r\n# flags=[[False]*m for i in range(n)]\r\n# left=[0,0,1,-1]\r\n# right=[1,-1,0,0]\r\n#\r\n# ans=0\r\n# for i in range(n):\r\n# for j in range(m):\r\n# for k in range(4):\r\n# if", "M,N = input().split()\r\nM,N = int(M), int(N)\r\ndominos = 2\r\nArea = M*N\r\nmax_dominos = Area//dominos\r\nprint(max_dominos)", "n,k=map(int,input().split())\r\ns=n*k\r\nif s%2==0:\r\n print(int(s/2))\r\nelse:\r\n s=s-1\r\n print(int(s/2))", "a, b = map(int, input().split())\r\ntotal = 0\r\ntotal += (a // 2) * b\r\nif a % 2 == 1:\r\n total += b // 2\r\n\r\nprint(total)", "import sys\r\nfrom math import gcd,floor,sqrt,log,ceil\r\nfrom collections import defaultdict,Counter\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right \r\ndef iinp(): return int(input())\r\ndef linp():return list(map(int, input().split())) \r\ndef lsinp():return input().split()\r\ndef digit():return [int(i) for i in (list(input()))]\r\ndef char():return list(input())\r\n\r\n\r\ndef solve():\r\n a,b=linp()\r\n \r\n print(int(a*b/2))\r\n\r\n\r\n#q=iinp()\r\nfor i in range(1):\r\n solve()", "x,y = map(int,input().split())\r\n\r\nif (x*y) %2 ==0:\r\n print((x*y)//2)\r\nelse:\r\n print((x*y) //2)", "a,b=map(int,(input().split()))\r\nflag=True\r\ncnt=0\r\nprint(a*b//2)", "n,m = map(int, input().split())\r\nc=int((n*m)/2)\r\nprint(c)\r\n", "x = input()\r\nlst1 = x.split(' ')\r\nlst1 = [int(lst1[y])for y in range(len(lst1))]\r\nM,N = lst1\r\na = M//2\r\nif M%2 == 0:\r\n c=a*N\r\nelse: \r\n c=a*N + N//2\r\nprint(c)", "M, N = [int(i) for i in input().split()]\r\nprint(M*N//2)\r\n", "a = input()\r\na1, a2 = a.split()\r\nb = int(a1) * int(a2)\r\nc = b//2\r\nprint(c)", "def domino(m,n):\r\n result=int((m*n)/2)\r\n print(result)\r\nm,n=input().split(\" \")\r\ndomino(int(m),int(n))\r\n\r\n", "arr = list(map(int,input().split()))\r\nprint(arr[0]*arr[1]//2)", "n, m = map(int, input().split())\r\n# list(map(int, input().split()))\r\nd = 0\r\nif n % 2 == 0:\r\n d = n // 2 * m\r\nelse:\r\n d = n // 2 * m + m // 2\r\nprint(d)", "m,n = map(int,input().split())\r\nsize = m*n\r\nprint(size//2)", "num1, num2 = map(int, input().split())\r\nif num2 > num1:\r\n num1 , num2 = num2, num1\r\nprint(num1//2 * num2 + num1%2 * num2 //2)", "a, b=[int(x) for x in input().split()]\nc=a*b \nd=c//2 \nprint(d)\n \n\t \t \t \t\t \t\t\t\t\t\t \t \t\t\t \t \t", "m,n = [int(x) for x in input().split()]\r\na = m*n\r\ndom = a//2\r\nprint(dom)", "m,n=map(int,input().split())\r\ntotal= int (m*n/2)\r\nprint(total)", "s, t = map(int, input().split())\r\ntotal = int(s*t / 2)\r\nprint(total)", "\r\nx, y=input().split(\" \")\r\nw=int(x)\r\nz=int(y)\r\nprint(int((z*w)/2))\r\n\r\n", "m,n=map(int,input().split())\r\ntotal=int(m*n//2)\r\nprint(total)", "inp = input()\r\nM = int(inp.split()[0])\r\nN = int(inp.split()[1])\r\nprint(N*M//2)", "M, N=map(int, input().split())\r\nmaxDominoes=(M*N)//2\r\nprint(maxDominoes)", "import math\r\n\r\nm,n = (map(int,input().split()))\r\n# m = int(input(\"What is m \"))\r\n# n = int(input(\"what is n \"))\r\narea = m*n\r\n\r\nx = area/2\r\nprint(math.floor(x))\r\n", "i=lambda : map(int, input().split())\nx,y=i()\nprint(int(x*y/2))", "def dominoPiling(m, n):\r\n numOfDominos = (m*n) // 2\r\n return numOfDominos\r\n\r\ninp = input()\r\ninpList = inp.split()\r\nprint(dominoPiling(int(inpList[0]), int(inpList[1])))\r\n", "m, n = input().split()\r\nR = int(m) * int(n)\r\nD = (R/2)\r\nprint(int(D))", "M, N = map(int, input().split())\r\n\r\n# Formula: (M * N) // 2\r\n# Since each domino covers 2 squares, we calculate the floor division of (M * N) by 2.\r\n# This gives us the maximal number of dominoes that can be placed.\r\n\r\nmax_dominoes = (M * N) // 2\r\nprint(max_dominoes)\r\n", "M,N=map(int,input().split())\r\na=M*N\r\nprint(a//2)\r\n", "size= input().split()\r\na= int(size[0])\r\nb= int(size[1])\r\nc = (a*b)//2\r\nprint(c)", "m,n=list(map(int,input().split()))\r\ne=m*n\r\nw=2*1\r\nprint(e//w)", "n, m = map(int, input().split())\r\nn *= m\r\nn -= n % 2\r\nn //= 2\r\nif n > 0:\r\n\tprint(n)\r\nelse:\r\n\tprint(0)", "m,n=(input().split())\r\nm=int(m)\r\nn=int(n)\r\nprint((m*n)//2)", "n, k = map(int, input().split())\r\nprint((n*k-n*k%2)//2)", "m,n=list(map(int,input().split()))\r\nl= (m*n)\r\nif(l%2==0):\r\n print(l//2)\r\nelse:\r\n print((l-(l%2))//2)", "a,b=map(int,input().split())\r\nk=a*b\r\nprint(k//2)\r\n", "n, d= map(int, input().split())\r\nprint(int(n*d/2))\r\n", "m,n=map(int, input().split())\r\nif m % 2 == 0 :\r\n print((m//2)*n)\r\nif m%2 != 0 and n%2 ==0:\r\n print((((m-1)//2)*n)+(n//2))\r\nif m%2 != 0 and n % 2 != 0:\r\n print((((m-1)//2)*n)+((n-1)//2))", "n, m = map(int, input().split())\r\ntotal_size = n * m\r\nres = (total_size - (total_size % 2))//2\r\nprint(res)", "str = input().split()\r\nM,N = int(str[0]),int(str[1])\r\nprint(M*N//2)", "def main():\n\ta, b = (int(i) for i in input().split())\n\ts = a//2 * b + a%2 * b//2\n\tprint(s)\n\nif __name__ == '__main__':\n\tmain()", "M,N=map(int,input().split())\r\nc=M*N\r\nif c%2==0:\r\n f=(M*N)//2\r\n print(f)\r\nelse:\r\n f=(M*N)//2\r\n print(f)\r\n ", "m,n = map(int, input().split())\r\nd = (m*n) //2 if (m*n) %2 ==0 else ((m*n)-1) // 2\r\nprint(d)", "M,N=map(int,input().split())\r\nmax=M*N\r\nprint(max//2)\r\n \r\n", "m,n = map(int,input().split())\r\ng = int(m*n/2)\r\nprint(g)", "def func(m,n):\r\n #if m is even \r\n if( (m%2)==0 ): \r\n return (m//2)*n\r\n #if n is even \r\n if( (n%2)==0 ):\r\n return (n//2)*m\r\n #if both are odd\r\n return (func(m-1,n-1)+(m//2)+(n//2))\r\n\r\nm,n = [int(i) for i in input().split()]\r\nans = func(m,n)\r\nprint(int(ans))", "Q, Z = map(int, input().split())\r\nmax_dominoes = (Q * Z) // 2\r\nprint(max_dominoes)\r\n", "m,n = input().split()\r\nmax_num_domino = int(m)*int(n)\r\nprint(max_num_domino//2)", "#укладка доминошками\nf=input().split()\na=int(f[0])\nb=int(f[1])\nif a%2==0 or b%2==0:\n print(int(a*b/2))\nelse:\n print(int((a*b-1)/2))", "s = input().split(' ')\r\nx = [int(item) for item in s]\r\nprint((x[0] * x[1]) // 2)\r\n", "m, n = [int(x) for x in input().split(' ')]\r\nif m == n == 1:\r\n print(0)\r\nelse:\r\n print((m*n)>>1)", "nums = input().split()\r\nM = int(nums[0])\r\nN = int(nums[1])\r\nprint(int(M * N / 2))", "try:\r\n a=input().split()\r\n pro=(int(a[0])*int(a[1])//2)\r\n print(pro)\r\nexcept:\r\n print()", "m, n = map(int, input().split())\r\nar = m*n\r\nprint(ar//2)\r\n\r\n ", "x = [int(i) for i in input().split()]\r\nM = x[0]\r\nN = x[1]\r\nif N % 2 == 0:\r\n fits = N/2\r\n res = fits * M\r\nelse:\r\n fits = (N-1)/2\r\n res = fits * M\r\n if M % 2 == 0:\r\n res += M/2\r\n else:\r\n res += (M-1)/2\r\n \r\nprint(int(res))", "import math\r\na=input()\r\nb=a.split()\r\nm=int(b[0])\r\nn=int(b[1])\r\nans = m * n / 2\r\nif m%2!=0 and n%2!=0 :\r\n ans = math.floor(ans)\r\nprint(int(ans))", "import sys\r\narr = list(map(int, sys.stdin.readline().rstrip().split(\" \")))\r\nnum=arr[0]*arr[1]\r\nvar=num//2\r\nprint(var)", "import math\n\nn, k = [int(x) for x in input().split()]\nans = math.floor((n*k)/2)\nprint(ans)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n x, y = [int(i) for i in input().rstrip().split()]\r\n r = (x * y)//2\r\n output(str(r))\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "m,n = map(int,input().split())\r\ndominos=0\r\nif m*n % 2==0:\r\n dominos=int((m*n)/2)\r\nelse:\r\n dominos=round(int((m*n)/2))\r\nprint(dominos)", "length, breadth = list(map(int, input().split()))\narea = length * breadth\n\nprint(area // 2)\n\n", "M,N=map(int,input().split())\r\ntotal_squares=M*N\r\nmax_dominoes=total_squares//2\r\nprint(max_dominoes)", "\r\nlist = input()\r\nm,n = map(int, list.split())\r\nquant = 0\r\nwhile True:\r\n if m == 2:\r\n quant += n\r\n elif m > 2:\r\n quant += n\r\n else:\r\n quant += n//2\r\n m -= 2\r\n if m <= 0:\r\n break\r\nprint(quant)\r\n\r\n", "L = [int(x) for x in input().split()]\r\nM = L[0]; N = L[1]\r\nnb = 0\r\nif M%2==0:\r\n nb = (M/2)*N\r\nelif N%2==0:\r\n nb = (N/2)*M\r\nelse:\r\n nb = max((M//2)*N+N//2, (N//2)*M+M//2)\r\nprint(int(nb))", "m,n=map(int,input().split())\r\nif m%2==1 and n%2==1:\r\n x=(m*n-1)//2\r\nelse:\r\n x=m*n//2\r\nprint(x)", "query = input()\r\nquery = query.split(' ')\r\ndata = [int(q) for q in query]\r\nresult = (data[0] // 2) * data[1]\r\nresult += data[0] % 2 * data[1] //2\r\nprint(result)", "N, M = [int(x) for x in input().split()]\r\nk = N * M\r\nnumber = int(k / 2)\r\nprint(number)", "m = input()\r\ng = m.split()\r\n\r\na = int(g[0])\r\nb = int(g[1])\r\n\r\nif (a*b)%2==0:\r\n print(int((a*b)/2))\r\nelse:\r\n print(int((a*b)//2))\r\n", "n,t=map(int,input().split())\r\nb=n*t//2\r\nprint(b)", "p,b=map(int,input().split())\nans=p*b\nif ans%2==0:\n print(int(ans/2))\nelse:\n print(int((ans/2)))\n \t \t\t\t \t \t\t\t \t \t \t \t\t\t", "m,n = map(int,input().split())\r\n\r\nif m >= 1 and m <= n and n <= 16: \r\n output = (m * n)//2\r\n print(output)\r\nelse:\r\n print(0)", "a= [int(a) for a in input().split()]\r\nt= a[0]*a[1]\r\nprint(int(t/2))", "A,B=input().split()\r\nA=int(A)\r\nB=int(B)\r\nif(A*B % 2==0):\r\n N=int(A*B/2)\r\nelse:\r\n N=int((A*B-1)/2)\r\nprint(N)", "m, n = map(int, input().split())\ntotal = int(m*n / 2)\nprint(total)\n \t\t \t \t \t \t \t\t\t \t\t \t \t\t", "import math\r\nw=input()\r\nx=w.split( ' ' )\r\nif (len(x)>2):\r\n print('typo')\r\nelse:\r\n m=int(x[0])\r\n n=int(x[1])\r\n if(m<1 or n<1 or m>n or m>16 or n>16):\r\n print('typo')\r\n else:\r\n a=(m*n)/2\r\n print (math.floor(a))\r\n\r\n\r\n \r\n \r\n \r\n", "s = input()\r\nl = s.split()\r\nm = int(l[0])\r\nn = int(l[1])\r\nif m % 2 == 0 and n % 2 == 0:\r\n d = (m*n)/2\r\nelif m % 2 != 0 and n % 2 == 0:\r\n d = (m*n)/2\r\nelif m % 2 == 0 and n % 2 != 0:\r\n d = (m*n)/2\r\nelse:\r\n d = ((m*n)-1)/2\r\n\r\nprint(int(d))\r\n", "m, n = [int(x) for x in input().split(' ')]\r\nprint(n // 2 * m + m // 2 * (n % 2))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nm, n = map(int, input().strip().split())\r\nprint(m*n//2)", "board = input().split(\" \")\nm = int(board[0])\nn = int(board[1])\nsquares = m * n\ndominos = squares // 2\nprint(dominos)", "M,N=input().split()\r\nM=int(M)\r\nN=int(N)\r\nprint((M*N)//2)\r\n ", "n=input().split()\r\nprint((int(n[0])*int(n[-1]))//2)", "vvod = list(input())\r\nstr_vvod = []\r\notvet = 0\r\n\r\n\r\ndef from_vvod_to_list(dlina_lista, from_vvod, to_list, count=0, i=0, chisl=\"\"):\r\n while count < dlina_lista:\r\n try:\r\n while from_vvod[i] != \" \":\r\n chisl += from_vvod[i]\r\n i += 1\r\n else:\r\n to_list.append(chisl)\r\n chisl = \"\"\r\n i += 1\r\n except IndexError:\r\n to_list.append(chisl)\r\n chisl = \"\"\r\n i += 1\r\n count += 1\r\n return to_list\r\n\r\n\r\nfrom_vvod_to_list(len(vvod), vvod, str_vvod)\r\nn = int(str_vvod[0])\r\nk = int(str_vvod[1])\r\n\r\notvet = (n*k)//2\r\n\r\nprint(otvet)\r\n", "x,y = map(int,input().split())\r\nt = x*y\r\nprint(t//2)", "m,n=[(int)(i) for i in input().split(' ')]\r\nprint(m*(n//2)+(n%2)*(m//2))", "d=0\r\na , b =map(int,input().split())\r\nc = a*b\r\nif c%2==0:\r\n print(c//2)\r\nelif c%2!=0:\r\n d=c-1\r\n print(d//2)", "a=list(map(int, input().split()));print(int(min(a)*max(a)/2))", "x,y = input().split()\r\nprint((int(x)*int(y))//2)\r\n", "a = list(map(int,input().split()))\r\nb = a[0]*a[1]\r\nprint(b//2)", "import math\r\nn=list(map(int,input().split()))\r\nprint(math.floor((n[0]*n[1])/2))\r\n\r\n", "def domino():\r\n x,y = input().split()\r\n print(int(x)*int(y)//2)\r\ndomino()", "m,n = list(map(int,input().split(' ')))\nmax_dom = (m*n)//2\nprint(max_dom)", "i = input().split()\r\nm = int(i[0])\r\nn = int(i[1])\r\nMN = m*n\r\nprint(MN//2)", "#Donminoes problem : codeforces\r\nm,n = input().split()\r\nif m.isnumeric() and n.isnumeric():\r\n m = int(m) ; n = int(n)\r\n rectArea = m*n\r\n if rectArea%2 == 0:\r\n dominoes = rectArea/2\r\n print(int(dominoes))\r\n else:\r\n dominoes = rectArea/2\r\n print(int(dominoes))\r\n", "i,j=list(map(int,input().split()))\r\nm=(i*j)//2\r\nprint(m)", "N, M = input().split()\r\nN = int(N)\r\nM = int(M)\r\na = M // 2 * N #количество доминошек горизонатльно\r\nb = N// 2 * (M%2)\r\nprint(a+b)", "mp,ls=map(int,input().split()) \nmulti=mp*ls \nmu=2*1 \nlvd=multi//mu\nprint(lvd)\n\t \t\t \t \t \t \t\t\t \t \t\t\t\t \t\t\t", "\r\n\r\nM = 0\r\n\r\nN = 0\r\n\r\nM, N = map(int, input().split())\r\n\r\nres = (M * N)/2\r\n\r\nprint(int(res))\r\n\r\n", "M, N = map(int, input().split())\r\n\r\nif M == 1 and N == 1:\r\n print(0)\r\n \r\nelse:\r\n print((M * N) // 2)\r\n", "num = input()\nnum_list = num.split(' ')\nm = int(num_list[0])\nn = int(num_list[1])\nproduct = m * n\n\nif product % 2 == 0:\n print(int(product / 2))\nelse:\n print(int((product - 1) / 2))\n", "x,y=map(int,input().split())\r\nc=(x*y)//2\r\nprint(c)", "'''\nCreated on 3 Jun 2021\n\n@author: vadim\n'''\n\ni = lambda : map(int,input().split());\nm,n=i();\nprint(int((m*n)/2))\n", "a,b=map(int,input().split())\nprint(a*b//2)#f\n \t\t \t\t\t\t\t\t\t \t\t \t\t \t\t\t\t \t\t\t", "a=input().split()\r\nb=list(map(int,a))\r\nif b[0]*b[1]%2==0:\r\n print(int((b[0]*b[1])/2))\r\nelse: print(int((b[0]*b[1])//2))", "m, n = [int(s) for s in input().split()]\r\nprint((m*n)//2)\r\n", "m , n = map(int, input().split())\r\nc = (m*n)//2\r\nprint(c)", "M,N = map(int,input().split())\r\nb = M*N\r\nprint(int(b/2))\r\n", "from operator import mul\r\n\r\ns=list(map(int,input().split()))\r\nb=mul(s[0],s[1])\r\nprint(b//2)", "x, y = input().split()\r\na = int(x)*int(y)%2\r\nif a == 0:\r\n print(int(int(x)*int(y)/2))\r\nelif a == 1:\r\n print(int(int(x)*int(y)/2 - 0.5))", "A,B=list(map(int, input().split(\" \"))); print((A*B)//2)", "N,M = input().split()\nprint(int(N)*int(M)//2)\n\n#zzzzzzzz\n\t \t\t\t \t \t\t \t \t\t \t \t", "\r\n\r\n\r\nn,m= map(int, input().split())\r\n\r\nx = int(n/2)\r\ny = int(m/2)\r\nans = x*m\r\nif(x*2<n):\r\n ans+=y;\r\nprint(ans)\r\n\r\n", "k=input()\r\n\r\nnumbers=[int(x) for x in k.split(\" \")]\r\n\r\nm=numbers[0]\r\nn=numbers[1]\r\n\r\nplo=m*n\r\n\r\ndomino=plo//2\r\nprint(domino)\r\n", "size = input()\r\nsize = size.split(\" \")\r\n\r\nsizesq = int(size[0]) * int(size[1])\r\n\r\nout = sizesq // 2\r\n\r\nprint(out)", "m,n = map(int,input().split())\r\na = m*n//2\r\nprint(a)\r\n \r\n ", "m,n = map(int, input().split())\r\nif m*n%2==0:\r\n if n%2!=0:\r\n print((m//2)*n)\r\n# elif m%2!=0:\r\n# print(m*(n/2))\r\n else:\r\n print(m*(n//2))\r\nelif m*n%2!=0:\r\n print((m*(n//2))+m//2)", "[m,n] = [int(x) for x in input().split()]\r\nif (m * n) < 2:\r\n print(0)\r\nelif (m * n) %2 == 0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int((m*n-1)/2))", "def solve(n: int) -> int:\r\n return int(n/2)\r\n\r\nM, N = map(int, input().split())\r\nprint(solve(M * N))", "M,N= map(int,input().split())\r\narea=M*N\r\nmaxno=int(area/2)\r\nprint(maxno)\r\n", "#source code:\n\nM,N=map(int,input().split(\" \"))\n\nprint((M*N)//2)\n\n#source code along with output:\n\n\n\t \t\t\t \t \t\t \t\t \t\t\t\t\t\t \t\t \t \t", "test_time = 1\nfor i in range(test_time):\n M, N = [int(v) for v in input().split()]\n print(M * N // 2)\n\t\t\t \t \t \t \t \t \t\t \t\t\t\t\t \t", " \r\ndef dp():\r\n x = input().split()\r\n a = int(x[0])\r\n b = int(x[1])\r\n print(a*b//2)\r\n \r\ndp()\r\n ", "n , k = map(int,input().split())\r\ndomino =2*1\r\nif n and k >=1 and n and k <=16:\r\n print((n*k)//domino)", "x, y = input().split()\r\nprint('%d' % (int(int(x)*int(y))/2))", "x = input()\r\ny = x.split()\r\nz = int(y[0]) * int(y[1])\r\nprint(z // 2)\r\n\r\n", "s = input().split()\r\nM = int(s[0])\r\nN = int(s[1])\r\nif M % 2 == 0 or N % 2 == 0:\r\n print(int(M*N/2))\r\nelse:\r\n print(int((M*N -1)/2))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 27 19:54:50 2022\r\n\r\n@author: hp\r\n\"\"\"\r\n\r\nm,n = map(int, input().split())\r\na = m * n\r\nif a % 2 == 0:\r\n print(a//2)\r\nelse:\r\n print((a-1)//2)\r\n ", "q,w=map(int,input().split())\nprint(q*w//2)\na=76765487346587349534532\n \t\t\t \t \t \t \t\t \t \t \t\t \t", "x,y = input().split()\r\nsquares = int(x)* int(y)\r\nprint(squares//2)\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\n\r\nsum=0\r\n\r\nif(a>0 and a<17 and b>0 and b<17 and a<=b):\r\n if a/2==0: \r\n if b/2==0: #a=1 ar b=1 hoile\r\n print(\"0\")\r\n exit()\r\n else: #a=1 ar b=n hoile\r\n num=a\r\n wum=int(b/2)\r\n\r\n else: #a=n ar b=1 hoile\r\n num=int(a/2)\r\n wum=b\r\n if a%2!=0:\r\n if b>1:\r\n sum=int(b/2)\r\n \r\n\r\nprint(num*wum+sum)\r\n \r\n", "import math\r\nn,m = list(map(int,input().split()))\r\nx = math.floor((n*m)/2)\r\nprint(x)", "s=input()\r\na,b=s.split(\" \")\r\nc=int(a)\r\nd=int(b)\r\nif 1<=c<=16 and 1<=d<=16:\r\n print((c*d)//2)", "n,m=map(int,input().split())\r\nprint(int((n*m)/2))\r\n ", "m, n = map(int, input().split())\r\na = m*n\r\nprint(a//2)\r\n", "x,y=map(int,input().split())\r\nr=x*y\r\nprint(r//2)", "n,m = map(int,input().split())\r\nk = (n*m)//2\r\nprint(k)\r\n", "k,i=map(int,input().split())\nif(1<=k<=16 and 1<=i<=16):\n t= k*i\n print(t//2)\n\t \t\t \t \t\t \t\t\t\t \t \t \t\t\t\t", "n, k = input().split()\r\nf = int(n) * int(k)\r\nval = int(f / 2)\r\nprint(val)", "n,k=map(int,input().split())\r\nm=n*k\r\nprint(m//2)", "a,b=map(int,input().split())\r\nif a%2==0:\r\n print(b*a//2)\r\nelse:\r\n print(a//2*b+b//2)", "M, N = map(int, input().split())\ndominos = M + N == 2 and 0 or (M * N) // 2\nprint(dominos)\n\t \t \t\t\t\t \t \t \t \t\t \t", "def fun(a):\r\n arr=a.split(' ',2)\r\n m=int(arr[0])\r\n n=int(arr[1])\r\n return int(m*n/2)\r\nn=input()\r\n\r\nprint(fun(n))\r\n", "mn = input().split()\r\nm = int(mn[0])\r\nn = int(mn[1])\r\nres = int((m*n)/2)\r\nprint(res)", "area = input().split()\r\nlst = []\r\nfor number in area:\r\n lst.append(int(number))\r\narea1 = lst[0]* lst[1]\r\nsquares = area1 // 2\r\nprint(squares)\r\n", "n, l=map(int,input().split())\r\nprint(n*l//2)\n# Tue May 17 2022 06:33:13 GMT+0000 (Coordinated Universal Time)\n\n# Tue May 17 2022 06:33:18 GMT+0000 (Coordinated Universal Time)\n", "a,b=map(int,input().split())\r\nif 1<=a<=b<=16:\r\n n = a * b\r\n k = int(n / 2)\r\n print(k)\r\n", "X, N = map(int,(input(). split()))\ntotal = X * N \nrem = total % 2\nprint((total - rem)//2)\n\t \t\t\t\t\t \t\t\t \t \t \t \t\t\t \t\t\t\t \t", "M, N = map(int, input().split())\r\n\r\nDominoSize = 2 * 1\r\n\r\nprint(M * N // DominoSize)\r\n ", "M, N = input().split(\" \")\r\nM = int(M)\r\nN = int(N)\r\ntotal_tiles = M*N\r\nsolutions = total_tiles // 2\r\nprint(solutions)", "from math import floor \r\nn, m = map(int, input().split())\r\n\r\nprint(floor(n*m*0.5))", "# c=0\r\n# for i in range(int(input())):\r\n# s=input()\r\n# if s.count('1')>1:\r\n# c+=1\r\n# print(c)\r\n\r\nn,m=map(int,input().split())\r\nprint((n*m)//2)", "n1, n2 = input().strip().split()\r\nm, n = int(n1), int(n2)\r\nprint(m * n // 2)", "line = input()\nlinespl = line.split()\n\nM = linespl[0]\nN = linespl[1]\n\nx = int(M)*int(N)\n\nif x%2==0:\n print(int(x/2))\nif x%2==1:\n print(int((x-1)/2))\n \t\t \t \t\t\t\t \t \t \t \t \t", "m,n=input().split()\r\nm,n=int(m),int(n)\r\nif m==1 and n==1:\r\n print(0)\r\nelse:\r\n print((m*n)//2)", "s = input().split()\r\nn, m = int(s[0]), int(s[1])\r\nprint((m * n) // 2)", "m, n = input().split()\r\nm, n = int(m), int(n)\r\narea = m*n\r\nx = area // 2\r\nprint(x)", "m, n = map(int, input().split())\r\nz = m*n\r\nx = z//(2*1)\r\nprint(x)", "M, N = map(int, input().split())\r\n\r\n# Calculate the total number of squares on the board\r\ntotal_squares = M * N\r\n\r\n# Check if the number of squares is odd\r\nif total_squares % 2 == 1:\r\n # If the number of squares is odd, leave the last square blank\r\n total_squares -= 1\r\n\r\n# Calculate the maximum number of dominoes that can be placed\r\nmax_dominoes = total_squares // 2\r\n\r\nprint(max_dominoes)\r\n", "m,n=map(int,input().split())\r\nsquare=m*n\r\nprint(square//2)", "import math\r\n\r\nm, n = input().split(\" \")\r\nm, n = int(m), int(n)\r\n\r\na = math.floor((m * n)/2)\r\n\r\nprint(a)", "def main():\n\tno_lines = input('')\n\tm, n = map(int,no_lines.split(\" \", 1))\n\ttotal = m // 2 * n\n\tif m % 2 == 1 and n % 2 == 1: \n\t\ttotal += n //2 \n\telif m % 2 == 1 or n % 2 == 1: \n\t\ttotal = total * (n % 2) + n // 2 * m * (m % 2)\n\tprint(total)\nmain()", "m,n=[int(x) for x in input().split()]\r\nk=(m*n)//2\r\nprint(k)", "lists = input().split()\r\n\r\nnum_list = list(map(int, lists))\r\n\r\nm = num_list[0]\r\nn = num_list[1]\r\n\r\nprint(int(m*n/2))\r\n ", "M, N = map(int, input().split()) # Read board sizes M and N\r\ntotal_squares = M * N # Calculate the total number of squares\r\n\r\n# Calculate the maximum number of dominoes that can be placed\r\nmax_dominoes = total_squares // 2\r\n\r\nprint(max_dominoes)\r\n", "b = []\nb = input().split()\nif int(b[0]) * int(b[1]) <= 1:\n\tprint('0')\nelse:\n\tprint(int(b[0]) * int(b[1]) // 2)\n", "a,b=input().split()\r\nprint(int(int(a)*int(b)/2))", "'''\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press \"Run\" button to execute it.\n\n'''\n\nm,n=map(int,input().split())\nprint(m*n//2)", "n, m = map(int, input().split())\r\nans = 0\r\n\r\nif n % 2 == 0 :\r\n ans = n // 2 * m\r\nelif m % 2 == 0 :\r\n ans = m // 2 * n\r\nelse :\r\n ans = (n - 1) // 2 * m\r\n ans += m // 2\r\n\r\nprint(ans)", "def domino_piling(m, n):\r\n\tmax_nb_dominoes = m * (n // 2)\r\n\tif n%2 == 0:\r\n\t\treturn max_nb_dominoes\r\n\r\n\telse:\r\n\t\tmax_nb_dominoes += m//2\r\n\t\treturn max_nb_dominoes\r\n\r\ndef main():\r\n\tm, n = map(int, input().split(\" \"))\r\n\tprint(domino_piling(m, n))\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "X, Y = input().split()\r\nx, y = int(X), int(Y)\r\nw=x*y/2\r\nprint(int(w))", "m,n=map(int,input().split())\r\nif m<n:\r\n d=m\r\n m=n\r\n n=d\r\na=n//2\r\nb=m//2\r\nc=n*b+m%2*a\r\nprint(c)", "a,b=(int(x) for x in input().split())\r\ns=a*b\r\nif s%2==0:\r\n n=s/2\r\n print(int(n))\r\nelse:\r\n n=s//2\r\n print(int(n))", "n = input().split(\" \")\r\nprint((int(n[0]) * int(n[1]))//2)", "n, m=[int(x) for x in input().split()]\nprint((n*m)//2)\n", "mn = input()\r\nm = int(mn.split()[0])\r\nn = int(mn.split()[1])\r\n\r\nsize = m*n\r\npieces = 0\r\nwhile size > 0 and (size-2) >= 0:\r\n size -=2\r\n pieces += 1\r\nprint(pieces)", "one,two=map(int,input().split())\r\nprint(one*two//2)", "def algo(M,N):\n return (M*N) // 2\n\nif __name__ == '__main__':\n M, N = map(int, input().split())\n print(algo(M,N))\n ", "import math\r\n\r\nline = input().split()\r\nfirst_num = int(line[0])\r\nsecond_num = int(line[1])\r\nproduct = first_num * second_num\r\nanswer = product / 2\r\nprint(math.floor(answer))", "def solution(m: int, n: int) -> int:\n return m * n // 2\n\n\ndef main():\n line = input().split(\" \")\n print(solution(int(line[0]), int(line[1])))\n\n\nif __name__ == '__main__':\n main()\n", "\r\ndef solution(n):\r\n area = int(n[0]) * int(n[1])\r\n res = area // 2\r\n return res\r\n\r\nif __name__ == '__main__':\r\n n = list(map(int, input().rstrip().split()))\r\n\r\n print(solution(n))\r\n", "def dominoes(m, n):\r\n domino_count = 0\r\n for rows in range(m):\r\n for cols in range(n):\r\n domino_count += 1\r\n return domino_count // 2\r\n\r\ndef main():\r\n m, n = map(int, input().split())\r\n result = dominoes(m, n)\r\n print(result)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n'''def dominoes(m, n):\r\n domino_count = 0\r\n for rows in range(m):\r\n for cols in range(n):\r\n domino_count += (rows * cols) // 2\r\n return domino_count\r\n\r\ndef main():\r\n m, n = map(int, input().split())\r\n result = dominoes(m, n)\r\n print(result)\r\n \r\nif __name__ == '__main__':\r\n main()'''", "v=input()\r\nL=v.split()\r\nLv=[]\r\nfor i in L :\r\n Lv.append(int(i))\r\nprint((Lv[0]*Lv[1])//2)", "t=1\r\n # t = int(input())\r\nfor i in range(t):\r\n #n = int(input())\r\n\r\n a = input() ; a = a.split()\r\n m = int(a[0]) ; n = int(a[1])\r\n # a = input(); a = a.split()\r\n # a = [int(x) for x in a]\r\n # a.sort(reverse=True)\r\n if (m%2 == 0) or (n%2 == 0):\r\n print(m * n // 2)\r\n else:\r\n print(m * n // 2 )\r\n #print( a, a1, a2)", "a, b = input().split()\na = int(a)\nb = int(b)\nprint(a*b//2)\n\t\t\t \t \t \t \t \t \t \t\t\t \t \t\t\t\t\t\t\t", "m,n = input().split()\r\nm,n = int(m), int(n)\r\n\r\ni = m*n\r\n\r\nprint(i//2)\r\n", "import math\r\nm, n = list(map(int, input().split()))\r\n \r\nprint(math.floor(m * n / 2))", "M,N=map(int,input().split())\r\nif M==0 and N==0:\r\n print(0)\r\nelif (M,N)<=(16,16) and (M,N)>=(1,1):\r\n print((M*N)//2)\r\nelse:\r\n pass\r\n", "m,n=map(int,input().split())\r\np=m*n\r\nprint(p//2)", "def calculate_max_domines(M, N):\r\n return (M * N) // 2\r\n \r\n \r\ns = input()\r\nl = s.split(\" \")\r\n\r\nmax_domines = calculate_max_domines( int(l[0]), int(l[1]))\r\nprint (max_domines)\r\n", "a,b =map(int, input().split())\r\nc=a*b\r\nprint(c//2)\r\n\r\n\r\n# a,b =map(int, input().split())\r\n# y=list(map(int,input().split()))\r\n# for i in y:\r\n# if i<y[b-1] or i==0:\r\n# a-=1 \r\n# print(a)\r\n# n = int(input())\r\n# z=0\r\n# for i in range(n):\r\n# a = list(map(int, input().split()))\r\n# sum_of_list = sum(a)\r\n# if sum_of_list>=2:\r\n# z+=1\r\n# print(z) \r\n\r\n# def test():\r\n# s=input()\r\n# if len(s)>10:\r\n# print(f'{s[0]}{len(s)-2}{s[-1]}')\r\n# else:\r\n# print(s)\r\n\r\n# t = int(input())\r\n# for i in range(t):\r\n# test()\r\n", "M,N=input().split()\n\ntotal=int(M)*int(N)\n\nprint(total//2)\n\n", "m,n = map(int,input().split())\r\nl,b,rem = 0,0,0\r\nl = m//2\r\nb = n\r\nif m % 2 != 0:\r\n x = m*n - l*b*2\r\n rem = x // 2\r\nprint(l*b+rem)\r\n", "x, y = input().split()\r\nx= int(x)\r\ny = int (y)\r\nproduct = ((x*y)-(y*x)%2)/2\r\nprint(int(product))\r\n", "# n=int(input())\r\n# lst=[0, 0, 0]\r\n# k=0\r\n# for i in range(n):\r\n# lst[0], lst[1], lst[2]= map(int, input().split())\r\n# if sum(lst)>=2:k+=1\r\n# print(k)\r\n\r\n# n, k=map(int, input().split())\r\n# l=0\r\n# lst=list(map(int, input().split()))\r\n# for j in range(n):\r\n# if lst[j]>=lst[k-1] and lst[j]>0 : l+=1\r\n# print(l)\r\n\r\nm, n=map(int, input().split())\r\nl=m*n\r\nif (l)%2==1:l-=1\r\nprint(l//2)", "def maximum_dominoes(M, N):\r\n return (M * N) // 2\r\nM, N = map(int, input().split())\r\nprint(maximum_dominoes(M, N))", "m,n=input().split(' ')\r\nrectengular_area=int(m)*int(n)\r\ndominoes_num=rectengular_area//2\r\nprint(dominoes_num)", "def main():\n\tvalues = list(map(int,input(\"\").split()))\n\tif ((values[0] * values[1]) % 2) == 0:\n\t\tprint(str(int((values[0] * values[1]) / 2)))\n\telse:\n\t\tprint(str(int(((values[0] * values[1])-1) / 2)))\n\nif __name__ == '__main__':\n\tmain()", "def solve():\r\n m, n = [int(i) for i in input().split()]\r\n return int(n * m*0.5)\r\n\r\n\r\nprint(solve())", "m,n = (int(x) for x in input().split())\r\nif m*n>1:\r\n print((m*n)//2)\r\nelse:\r\n print(0)", "\r\n\r\nfrom math import floor\r\nm, n = map(int, input().split())\r\nboard = m * n\r\n\r\nmaxDomino = floor(board/2)\r\n\r\nprint(maxDomino)\r\n", "n,k = input('').split(' ')\r\nprint(int(n)*int(k)//2)\r\n", "m,n = input().split()\r\nif int(m)*int(n)%2==0 :\r\n print(int(int(m)*int(n)/2))\r\nelse:\r\n print(int(int(m)*int(n)/2))", "M, N = list(map(int, input().split()))\r\ntotal_squares = M * N\r\n\r\nprint(total_squares // 2)", "# 50A - Domino piling\r\n# http://codeforces.com/problemset/problem/50/A\r\n\r\nm, n = map(int, input().split())\r\nif m == 1 and n == 1:\r\n print(0)\r\nelse:\r\n print(int(m * n) // 2)", "n,m = map(int, input().split())\r\na = n * m\r\nx = 0\r\nwhile a >= 0:\r\n a = a - 2\r\n if a >= 0:\r\n x += 1\r\n\r\nprint(x)\r\n ", "m,n = map(int,input().split())\nif m >= 1 and m <=16 and n >= 1 and n <= 16:\n blocks = m * n\n domino = blocks // 2\n print(domino)\n", "import math\r\na=input().split()\r\na[0]=int(a[0])\r\na[1]=int(a[1])\r\np=a[0]*a[1]\r\nm=math.floor(p/2)\r\nprint(m)", "m, n = map(int,input().split())\r\nprint(m*n // 2)\r\n", "import math\r\n\r\nm,n = map(int,input().split())\r\nprint(math.floor(m*n /2))", "#jai shri krishna\r\nm, n = map(int, input().split())\r\nb = m//2\r\nif m%2 == 0:\r\n a=0\r\nelse:\r\n a = n//2\r\nprint(b*n + a)\r\n\r\n", "import math\r\nx,y=map(int,input().split())\r\nprint(math.floor(x*y*0.5))\r\n ", "m, n = map(int, input().split())\n\nx = (m*n) // 2\nprint(x)", "import math\r\n\r\na,b = input().split()\r\na = int(a)\r\nb = int(b)\r\narea = a*b\r\nneed = math.floor(area/2)\r\nprint(need)", "nums=input()\r\nlenght = len(nums)\r\n\r\nif lenght == 3:\r\n n = int(nums[0])\r\n m = int(nums[2])\r\n print ((n * m)//2)\r\nelif lenght == 4:\r\n n = int(nums[0])\r\n m = int(nums[-2]+nums[-1])\r\n print ((n * m)//2)\r\nelse:\r\n n = int(nums[0]+nums[1])\r\n m = int(nums[-2]+nums[-1])\r\n print ((n * m)//2)", "m, n = tuple(map(int, input().split()))\r\nprint(n*m//2)", "m,n=map(int,input().split())\r\na=m*n\r\nd=2\r\ng=a//d\r\n\r\nprint(g)", "m,n=map(int,input().split())\nprint(m*n//2)\n\n#def check(lst):\n\n'''for i in range(n):\n lst=list(map(int,input().split()))\n ans+=check(lst)\nprint(ans)'''\n\n\n\n\n\n\n\n\n", "m,n = map(int, input().split())\r\nk = m * n\r\nif k%2 == 0:\r\n print(int(k/2))\r\nelse:\r\n print(int((k-1) / 2))", "m,n = list(map(int,input().split()))\r\ndomino = m*n//2\r\nprint(domino)", "\r\ndef dominoPilling(M, N):\r\n\r\n if M * N < 2:\r\n return 0\r\n else:\r\n return (M * N) // 2\r\n\r\n\r\n(a, b) = map(int, input().split())\r\nprint(dominoPilling(a, b))\r\n", "def solution(m,n):\r\n if m == 1:\r\n if n == 1:\r\n return 0\r\n else:\r\n return n//2\r\n if m%2==0:\r\n return (m//2)*n\r\n if n%2==0:\r\n return (n//2)*m\r\n return ((m*n)-1)//2\r\n\r\ndef main():\r\n # T = int(input())\r\n # for t in range(1, T + 1):\r\n m, n = list(map(int, input().split()))\r\n # arr = list(map(int, input().split()))\r\n #arr = list(map(int, input().split()))\r\n out = solution(m, n)\r\n print(out)\r\n # print(f\"Case #{t}: {out}\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\nparameter = m*n\r\nmax_no_of_domino = int(parameter/2)\r\nprint(max_no_of_domino)", "domino = 2\r\nuser = input()\r\nuser = user.split(\" \")\r\narea = int(user[0]) * int(user[-1])\r\nprint(area//domino)", "Mm, On = map(int, input().split())\nmax_do = (Mm * On) // 2\nprint(max_do)\n\n\t\t\t\t\t \t\t\t\t\t \t \t \t \t\t \t\t\t\t", "# m,n=map(int,input().split())\r\n# ts=m*n\r\n# md =int(ts/2)\r\n# print(md)\r\n\r\n# [print([e for e in map(int,input().split())])]\r\n\r\nprint(((lambda e: e[0] * e[1])([int(e) for e in input().split()]))//2)\r\n\r\n", "n,m=map(int,input().split())\r\nif n==1 and m==1:\r\n print(0)\r\nelse:\r\n print(int((n*m)//2))", "# cook your dish here\r\nM,N=map(int,input().split())\r\nprint((M*N)//(2*1))", "M , N = map(int, input().split(\" \"))\r\nassert 1<= M <=N <=16\r\nanswer = (M*N) // 2\r\nprint(answer)", "a=input().split(\" \")\r\nm= int(a[0])\r\nn=int(a[1])\r\nprint(m*n//2)", "stroak = input()\nstroak = stroak.split(' ')\nfor i in range(len(stroak)):\n stroak[i] = int(stroak[i])\nprint((stroak[0]*stroak[1])//2)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled7.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Gj3P2tpZL2ueB_t5_C4M67SJkQ-svdIa\n\"\"\"\n\n#domino\nm,n = map(int, input().split())\nSol = (m*n // 2)\nprint(Sol)", "mn = input().split(' ')\r\nm = int(mn[0])\r\nn = int(mn[1])\r\nif m%2 != 0 and n%2 !=0:\r\n square = (m*n-1)/2\r\nelse:\r\n square = m*n/2\r\nprint(int(square))", "a,x=input().split()\r\na,x=int(a),int(x)\r\nm=(a*x)//2\r\nprint(m)", "def domino():\r\n w, h = [int(x) for x in input().split()]\r\n n = (w * h) // 2\r\n print(n)\r\n\r\n\r\ndomino()\r\n", "m,n=map(int,input().split())\r\ns=2\r\na=m*n\r\nnum= a//s\r\nprint(num)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\nline = inlt()\r\n\r\nheight = line[0]\r\nwidth = line[1]\r\n\r\nboard = []\r\nfor i in range(height):\r\n # Creates an array of width with 0 values\r\n row = [0] * width\r\n board.append(row)\r\n\r\nfree = 0\r\nused = 1\r\n\r\ndominos = 0\r\nfor i in range(len(board)):\r\n row = board[i]\r\n previous_status = 0\r\n c = 0\r\n for j in range(len(row)):\r\n # Check upper row\r\n if i > 0:\r\n # Check upper row\r\n if board[i - 1][j] == free:\r\n dominos += 1\r\n board[i][j] = used\r\n else:\r\n if j != 0:\r\n # Check previous position\r\n if board[i][j - 1] == free:\r\n dominos += 1\r\n board[i][j - 1] = used\r\n board[i][j] = used\r\n else:\r\n if j != 0:\r\n # Check previous position\r\n if board[i][j - 1] == free:\r\n dominos += 1\r\n board[i][j - 1] = used\r\n board[i][j] = used\r\n\r\nprint(dominos)", "x = input()\r\ny = x.split()\r\nM = int(y[0])\r\nN = int(y[1])\r\nvar_1 = M//2\r\nvar_2 = N//2\r\nvar_3 = M%2\r\nresult = N*var_1+var_2*var_3\r\nprint(result)\r\n", "m, n = map(int, input().split())\r\n\r\nx = m*n\r\n\r\nprint(x // 2)", "'''\nA. Domino piling: greedy, math\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\nYou are given a rectangular board of M×N squares. Also you are given an unlimited number of standard domino pieces of 2×1 squares.\nYou are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n2. No two dominoes overlap.\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.\n\nInput\nIn a single line you are given two integers M and N — board sizes in squares (1≤M≤N≤16).\n\nOutput\nOutput one number — the maximal number of dominoes, which can be placed.\n'''\n\ndef domino_piling():\n # print(eval(input().replace(' ', '*')) // 2)\n m, n = map(int, input().split())\n print(m * n // 2)\n\nif __name__ == '__main__':\n domino_piling()", "n,m = map(int, input().split())\r\nprdct = n * m\r\nans = prdct//2\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Domino pilling.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1cDSTPCXLZAs70u_DX7QlAAICu86L0WyX\n\"\"\"\n\na,b = map(int,input().split())\nresult = (a*b) // 2\nprint(result)", "MN = input('')\r\na = MN.find(' ')\r\nM = int(MN[0:a])\r\nN = int(MN[a+1:])\r\nS = M*N\r\nprint(S//2)\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n", "values = input()\r\nm,n = values.split(\" \")\r\nprint(int((int(m)*int(n))/2))", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nif n % 2 == 0 or m % 2 == 0:\r\n print(int(n * m / 2))\r\nelse:\r\n print(int((n * m - 1) / 2))", "a ,b = map (int,input().split())\r\nprint(a * b // 2)", "l,w=input().split()\r\nl=int(l)\r\nw=int(w)\r\narea=l*w\r\nprint(area//2)\r\n", "M, N = map(int, input().split())\ndom = (M * N) // 2\nprint(dom)\n#qwer\n \t\t \t \t\t\t\t\t\t \t\t \t\t\t\t\t", "in1=input()\r\nm_n_square=in1.split()\r\nif(int(m_n_square[0])%2==0):\r\n row_sq=int(m_n_square[0])//2\r\n totalsq=int(m_n_square[1])*row_sq\r\nelse:\r\n row_sq=int(m_n_square[0])//2\r\n addsq=(int(m_n_square[1]))//2\r\n totalsq=int(m_n_square[1])*row_sq+addsq\r\nprint(totalsq)", "import math\r\n\r\n#\r\nn, m = list(map(int, input().split()))\r\n\r\n# n, m = 1, 5\r\n\r\nif (n * m) % 2 == 0:\r\n print(n * m // 2)\r\nelse:\r\n if m < n:\r\n m, n = n, m\r\n y = (m - 1) * n / 2\r\n x = (m - 1) * n / 2 + math.floor(n / 2)\r\n print(int(x))\r\n", "M,N= map(int,input().split())\r\nprint (M*N//2)", "i = input(\"\")\r\ni = i.split()\r\nj = (int(i[0]) * int(i[1])) / 2\r\nprint(str(int(j)))", "numbers = [int(i) for i in input().split()]\r\nsize = numbers[0] * numbers[1]\r\ndomino = 0\r\ncount = 0\r\nwhile domino < size:\r\n count += 1\r\n domino += 2\r\n if domino > size:\r\n count -= 1\r\nprint(count)\r\n", "dimensions = input()\ndimensions = list(map(int, dimensions.split(' ')))\nrows, columns = dimensions\n\noccupied = [[False for j in range(columns)] for i in range(rows)]\n# print(occupied)\n\ncount = 0\n\nfor r in range(rows):\n for c in range(1, columns):\n if occupied[r][c] or occupied[r][c-1]:\n continue\n occupied[r][c] = occupied[r][c-1] = True\n count+=1\n\nfor c in range(columns):\n for r in range(1, rows):\n if occupied[r][c] or occupied[r-1][c]:\n continue\n occupied[r][c] = occupied[r-1][c] = True\n count += 1\n\nprint(count)\n", "m,n = input().split()\nx = int(m) * int(n)\ncount = 0\nfor i in range(1,x+1):\n if i % 2 == 0:\n count+=1\nprint(count)\n\n\t\t \t\t \t\t\t \t \t \t \t\t \t\t\t", "(m, n) = map(int, input().split())\r\nprint(int(m*n/2))", "def domino_area():\n x, y = input().rstrip().split()\n area: int = int(x) * int(y)\n max_dominos = area // 2\n return max_dominos\n\n\nprint(domino_area())\n", "M,N=map(int,input().split())\nmax_dominoes = (M * N) // 2\nprint(max_dominoes)\n#503\n \t \t \t\t\t\t \t\t\t \t \t \t\t \t", "import sys\r\n\r\na = sys.stdin.readline()\r\n\r\ntotal = int(a.split()[0])*int(a.split()[1])\r\n\r\nprint(int((total - int(total % 2))/2))\r\n\r\n", "def square(mn):\r\n mn = mn.split()\r\n m = int(mn[0])\r\n n=int(mn[1])\r\n return m*n //2\r\n\r\nmn = input()\r\nprint(square(mn))", "m, n = map(int, input().split())\r\n\r\nif (m >= 1 and m <= 16) and (n >= m and n <= 16):\r\n print((m * n) // 2)", "import math\r\n\r\n\r\nn, k = list(map(int, input().split(' ')))\r\n\r\nprint(math.floor(n*k/2))\r\n", "m, n = map(int, input().split())\r\n\r\n\r\n\r\narea = int(m)*int(n)\r\ntry:\r\n n_fichas = area//2\r\n\r\n print(n_fichas)\r\nexcept:\r\n print(0)\r\n", "m,n=map(int,input().split())\r\nsum=m*n\r\nprint(int(sum//2))", "n,m = map(int,input().split())\nno_tiles = (n*m)//2\nprint(no_tiles)\n \t\t\t \t \t \t\t\t \t \t\t \t\t \t \t\t\t", "m,n=map(int,input().split())\r\n\r\nprint(((n//2)*m)+(m//2)*(n%2))\r\n", "def dominoes(M, N):\r\n A = M * N\r\n max_dominoes = A // 2\r\n return max_dominoes\r\n \r\nM, N = map(int, input().split())\r\nmax_dominoes = dominoes(M, N)\r\nprint(max_dominoes)", "def calculateAmountOfPieces(width, height): \n pieceSquareFeet = 2\n\n print(int((width * height) / (pieceSquareFeet)))\n\nif __name__ == \"__main__\":\n widthAndHeight = input()\n widthAndHeightArray = widthAndHeight.split(' ')\n calculateAmountOfPieces(int(widthAndHeightArray[0]), int(widthAndHeightArray[1]))\n", "a = input().split()\r\nm = int(a[0])\r\nn = int(a[1])\r\n\r\nsquares = m * n\r\n\r\nif squares % 2 == 0:\r\n print(squares // 2)\r\nelse:\r\n print((squares - 1) // 2)\r\n", "n,m = map(int, input().split())\r\np = m*n\r\np /= 2 \r\nprint(int(p))", "\"\"\"\r\nnum1, num2 = input().split()\r\nnum1 = int(num1)\r\nnum2 = int(num2)\r\n\r\nfor i in range(1):\r\n num_list = list(map(int, input().split()))\r\n lowest_grade = num_list[(num2)-1]\r\n count = num_list.count(lowest_grade)\r\n if num_list[0] > 0:\r\n if num_list[(num2)-2] != num_list[(num2)-1] and lowest_grade != 0:\r\n print(num2+count-1)\r\n elif lowest_grade == 0:\r\n new_num_list2 = num_list[:num2]\r\n count3 = new_num_list2.count(0)\r\n print(num2-count3)\r\n else:\r\n new_num_list = num_list[num2:]\r\n count2 = new_num_list.count(lowest_grade)\r\n print(num2+count2)\r\n elif lowest_grade == 0 and num_list[0]==0:\r\n print(0)\r\n else:\r\n print(num2)\r\n\"\"\"\r\nn1, n2 = input().split()\r\nn1, n2 = int(n1), int(n2)\r\n#print(type(n1))\r\ns1 = n1/2 * (n2/1)\r\ns2 = n2/2 * (n1/1)\r\nif s1 > s2:\r\n print(int(s1))\r\nelse:\r\n print(int(s2))\r\n", "import math\r\n\r\nm,n = map(int, input().split())\r\n\r\nres = math.floor(m * n / 2)\r\nprint(res)", "m, n = map(int, input().split())\r\ns = m * n\r\nr = s // 2\r\nprint(r)", "i=input()\r\nl=i.split(\" \")\r\nl1=int(l[0])\r\nl2=int(l[1])\r\nk=l1*l2\r\nprint(k//2)\r\n", "m , n = map(int,input().split())\r\nif 1 <= m <= n <= 16 :\r\n m = m / 2\r\n max_d =int(m * n )\r\nprint(max_d) ", "m,n = input().split()\r\n\r\nm = int(m)\r\nn= int(n)\r\n\r\narea = m*n\r\ndominos = area//2\r\n\r\nprint(dominos)", "x = input()\r\nx=x.split()\r\ncount = 0\r\nz = (int(x[0])*int(x[1]))\r\nwhile(z>1):\r\n z-=2\r\n count+=1\r\nprint(count)\r\n", "Mm, Nn = map(int, input().split())\nmaxo = (Mm * Nn) // 2\nprint(maxo)\n\n\t \t \t \t \t\t\t \t \t\t\t\t\t\t\t", "s=str(input()).split(' ')\r\nm=int(s[0])\r\nn=int(s[1])\r\nprint (m*n//2)", "n,m = map(int,input().split())\r\nif n%2==0 or m%2==0:\r\n print(n*m//2)\r\nelse:\r\n print((n*m-1)//2)", "l, w = map(int, input().split())\r\ns = l*w\r\nif s%2 == 0:\r\n print(int(s/2))\r\nelse:\r\n print(int((s-1)/2))", "given = input()\r\nm, n = int(given.split()[0]), int(given.split()[1])\r\nprint((m*n)//2)\r\n", "length, width = [int(i) for i in input().split()]\r\n\r\narea = length * width\r\nprint(area//2)", "p = input()\r\nm = int(p.split(\" \")[0])\r\nn = int(p.split(\" \")[1])\r\nprint(((m*n)//2))", "x,y=map(int,input().split())\r\nres = (x*y) // 2\r\nprint(res)", "def place_dominoes(m, n):\r\n return (m * n) // 2\r\n\r\nm, n = map(int, input().split())\r\nprint(place_dominoes(m, n))\r\n", "import math as m\r\nx, y = input().split()\r\nd = m.floor(((int(x) * int(y)) / 2))\r\nprint(d)", "\"\"\"Укладка доминошками\"\"\"\r\n\r\ndef main():\r\n n, m = input().split(\" \")\r\n print((int(n) * int(m)//2))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nA. Domino piling\nhttps://codeforces.com/problemset/problem/50/A\n\n\"\"\"\n\nm,n=map(int,input().split())\nif m*n <2:\n print('0')\nelif m%2 == 0 or n%2 == 0:\n a=m*n/2\n print(int(a))\nelif m<=n:\n k = n//2\n q = k*m\n p = m//2\n b=p+q\n print(int(b))\n \n ", "m,n=map(int,input().split(\" \"))\r\nc=0\r\nif (m%2==0):\r\n c=(m//2)*n\r\nelse:\r\n c= (m//2)*n + n//2\r\nprint(c)", "x= input()\r\ny=x.split()\r\nx=int(y[0])\r\nz=int(y[1])\r\nprint((x*z)//2)", "import math\r\ndimensions = str(input())\r\ndimensions_sep = dimensions.split(\" \")\r\nM = int(dimensions_sep[0])\r\nN = int(dimensions_sep[1])\r\nprint(math.floor(M*N*0.5))", "n,k=0,0\r\ncon=False\r\nwhile (con!=True):\r\n n,k = map(int,input().split())\r\n if ((n>=1 and n<=16) and (k>=1 and k<=16)):\r\n con=True\r\nprint((n*k)//2)\r\n", "n = [int(n) for n in input().split()]\r\n\r\nsquare = n[0] * n[1]\r\n\r\nprint(int(square/2))\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\n############ ---- Output Functions ---- ############\r\ndef outp(num):\r\n output(str(num) + '\\n')\r\n\r\ndef outlt(lst):\r\n output(' '.join(lst) + '\\n')\r\n\r\ndef outsr(st):\r\n output(''.join(st) + '\\n')\r\n\r\n\r\n############ ---- Solution Functions ---- ############\r\ndef solution():\r\n m, n = inlt()\r\n\r\n outp( (m * n) // 2 )\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()", "import math\r\n\r\ndef cal_domino(n, m):\r\n result = 0\r\n if m % 2 == 0:\r\n result = (m / 2) * n \r\n else:\r\n result = (m // 2) * n + (n // 2) \r\n return int(result)\r\n\r\nif __name__ == '__main__':\r\n n, m= map(int, input().split())\r\n print(cal_domino(n, m))\r\n", "a,b = map(int, input().split())\r\nt = int(a*b / 2)\r\nprint(t)", "square = input()\r\nsquare_list = list(map(int, square.split()))\r\n\r\nM = square_list[0]\r\nN = square_list[1]\r\n\r\nif 1 <= M <= N <= 16:\r\n squares = M * N\r\n domino = int(squares / 2)\r\n\r\n print(domino)", "n, m = map(int, input().split())\r\nq = (m*n)//2\r\nprint(q)", "MN = input()\r\nMN = MN.split(\" \")\r\nif 1 <= int(MN[0]) <= int(MN[1]) <= 16 :\r\n print(( int(MN[0]) * int(MN[1]) ) // 2)\r\n \r\n", "boardSizeM, boardSizeN = input().split(\" \")\r\n\r\nrectangular = int(boardSizeM) * int(boardSizeN)\r\nprint(rectangular // 2)", "mn = list(map(int, input().split(' ')))\n\ndominos = 0\n\ndominos += (mn[0]//2) * mn[1]\ndominos += (mn[0]%2) * (mn[1]//2)\n\nprint(dominos)\n \t \t \t\t\t \t\t \t \t\t \t\t", "import math as mathematics\r\n\r\nM, N = map(int,input().split())\r\ndivide = 0\r\nif M >= 1 and N <= 16:\r\n board = M * N\r\n divide = mathematics.floor(board / 2)\r\n\r\nprint(divide)", "a,b=map(int,input().split())\nc=a*b//2\nprint(c)\n", "a = input()\r\nm = a.split(' ')[0]\r\nn = a.split(' ')[1]\r\nm = int(m)\r\nn = int(n)\r\n\r\nif m%2 == 0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int(((m-1)*n/2) + int(n/2)))", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\nif n % 2 == 0:\r\n print(n//2*m)\r\nelif m % 2 == 0:\r\n print(m//2*n)\r\nelse:\r\n print(int((n-1)/2*m + (m-1)/2))", "m,n=map(int,input().split())\r\n\r\ns=m*n\r\n\r\nif s%2==0:\r\n print(s//2)\r\nelse:\r\n print(s//2)", "\ninput_values=input()\ninput_values=input_values.split()\n\nM =int(input_values[0])\nN =int(input_values[1])\n\nprint(int((M*N)/2))\n\n", "a, b = map(int, input().split())\r\nprint((a * b // 2) if (a % 2 == 0 or b % 2 == 0) else ((a * b - 1) // 2))\r\n", "import sys\r\nM,N=map(int,sys.stdin.readline().split())\r\nsys.stdout.write(str(M*N//2)+\"\\n\")\r\nsys.stdout.flush()", "# -*- coding: utf-8 -*-\n\"\"\"dominoes.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/151GzdYgJO0URFbmEkMv0LpwgmPFIA-tH\n\"\"\"\n\nch=input()\nx,y=ch.split()\nm,n=int(x),int(y)\nif 1<=m<=n<=16:\n area=m*n\n if area%2==1:\n q=area-1\n print(q//2)\n elif area%2==0:\n print(area//2)", "m, n = map(int, input().split())\r\nM = int(m)\r\nN = int(n)\r\ncount = 0\r\nif (M>=1 and M<=16 and N>=1 and N<=16):\r\n if (M%2==0):\r\n count = (M/2)*N\r\n elif (N%2==0):\r\n count = (N/2)*M\r\n else:\r\n if (M>=N):\r\n count = ((N-1)/2)*M + (M-1)/2\r\n else:\r\n count = ((M-1)/2)*N + (N-1)/2\r\nprint(int(count))\r\n", "finput = input().split()\r\nm = int(finput[0])\r\nn = int(finput[1])\r\n\r\nif 1 <= m and m <= n and n <= 16:\r\n print(int(m*n/2))\r\n", "\r\nimport math\r\nm, n = map(int, input().split())\r\nprint (math.floor((m*n)/(2)))", "(length, breadth) = map(int, input().split(' '))\r\n\r\nprint(int((length * breadth)/2))", "n,k = [int(i) for i in input ().split ()]\r\nprint((n*k)//2)", "values = str(input())\nvalues = values.split(\" \")\n\na = int(values[0])\nb = int(values[1])\n\ndominos = int( (a * b) / 2)\nprint(dominos)\n \t \t\t\t\t \t \t \t \t \t\t\t \t\t\t\t", "from math import *\r\nn, m = map(int, input().split())\r\nprint(trunc(n * m / 2))", "a,b = map(int, input().split())\r\nres = a*b\r\nprint(int(res/2))", "m, n = map(int, input().split())\r\n\r\namount = 0\r\nsquare = 0\r\n\r\nwhile m * n > square:\r\n square += 2\r\n if m * n < square:\r\n break\r\n amount += 1\r\nprint(amount)\r\n\r\n", "M,N=map(int,input().split())\r\nprint(int(N*M/2))", "def main():\r\n x, y = map(int, input().split())\r\n print((x*y)//2)\r\n\r\nmain()", "import math\r\nval=input().split()\r\na=int(val[0])\r\nb=int(val[1])\r\nprint(math.floor(a*b/2))", "cord1, cord2 = map(int, input().split())\r\nif cord1*cord2 % 2 == 1:\r\n\toutput = ((cord1*cord2) - 1) // 2\r\nelse:\r\n\toutput = cord1*cord2 // 2\r\nprint(output)\t", "line=input()\r\nN ,M = line.split(\" \")\r\ns = int(N)*int(M)\r\nprint(s//2)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nm, n = list(map(int, input().split()))\r\nres = m // 2 * n\r\nif m & 1:\r\n res += n // 2\r\nprint(res)", "cases = input().split()\r\nm = int(cases[0])\r\nn = int(cases[1])\r\nprint((m*n)//2)\r\n", "m,n=map(int,input().split(\" \"))\r\nprod=m*n\r\nif prod%2==0:\r\n print(prod//2)\r\nelse:\r\n print((prod-1)//2)", "a = input()\na = [int(i) for i in a.split(\" \")]\nprint(a[0] * a[1] // 2)", "square_side = input().split(\" \")\r\nsquare_area = int(square_side[0]) * int(square_side[1])\r\n\r\ndomino_pieces = 2 * 1 \r\n\r\n\r\n\r\nmax_domino = square_area / domino_pieces\r\n\r\nprint(int(max_domino))", "m, n = [int(i) for i in input().split()]\nif (m * n) % 2 == 0:\n print(n * m // 2)\nelse:\n print((n * m - 1) // 2)\n", "m, n = map(int, input().split())\r\n\r\n# Calculate the number of 2x1 dominoes that can fit in a row of the board\r\n# If the row has an odd number of squares, we can fit (n-1)/2 dominoes\r\n# If the row has an even number of squares, we can fit n/2 dominoes\r\nnum_in_row = n // 2\r\n\r\n# Calculate the total number of dominoes that can fit on the board\r\n# If the board has an odd number of rows, we can fit (m-1)*num_in_row + (n//2) dominoes\r\n# If the board has an even number of rows, we can fit m*num_in_row dominoes\r\ntotal_num = m * num_in_row + (n % 2) * (m // 2)\r\n\r\nprint(total_num)\r\n", "m,n=map(int,input().split())\r\nk=m*n//2\r\nprint(k)", "n = input().split()\r\nfor i in range(len(n)):\r\n n[i] = int(n[i])\r\nprint((n[0]*n[1])//2)", "def main():\r\n import math\r\n arr=input()\r\n arr=arr.split(' ')\r\n l = int(arr[0])*int(arr[1])\r\n print(math.floor(l / 2))\r\n return 0\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x=input()\r\nx=x.split()\r\nraz=int(x[0])*int(x[1])\r\nprint(raz//2)\r\n", "n, m = map(int, input().split())\r\nprint ((n // 2) * m + (n % 2) * (m // 2))", "# # 158A - Next Round\n# # http://codeforces.com/problemset/problem/158/A\n\n# n, k = map(int, input().split())\n# a = list(map(int, input().split()))\n# c=0\n# for i in range (0,n):\n# if a[i] >=a[k-1] and a[i]>0:\n# c +=1\n# print(c)\nM,N=map(int,input().split())\nprint((M*N)//2)", "dimensions = str(input())\r\nif len(dimensions) == 3:\r\n width = int(dimensions[0])\r\n length = int(dimensions[2])\r\nelif len(dimensions) == 4:\r\n width = int(dimensions[0])\r\n length1 = dimensions[2] + dimensions[3]\r\n length = int(length1)\r\nelse:\r\n width1 = dimensions[0] + dimensions[1]\r\n width = int(width1)\r\n length1 = dimensions[3] + dimensions[4]\r\n length = int(length1)\r\n \r\narea = width * length\r\nremainder = area % 2\r\n\r\narea2 = area - remainder\r\n\r\nprint(area2 // 2)", "m,n=map(int,input().split())\r\nprint ((m*n)//2)\r\n ", "m, n = [int(x) for x in input().split()]\r\nprint(m * n // 2)", "def domino(m,n):\r\n return (m*n)//2\r\nm,n = map(int,input().split())\r\nprint(domino(m,n))\r\n", "a1,a2=map(int,input().split())\r\nprint((a1*a2)//2)", "import math\r\nM,N=[int(i) for i in input().split()]\r\nx=M*N/2\r\nprint(math.floor(x))\r\n", "m,n=map(int,input().split())\r\narea=m*n\r\ndomino=2\r\nprint(area//domino)", "i = input()\r\ni = i.split()\r\nj = []\r\nfor n in i:\r\n j.append(int(n))\r\n\r\nprod = j[1]*j[0]\r\n\r\nif prod %2 ==0:\r\n x = prod / 2\r\nelse:\r\n x = (prod -1)/2\r\n\r\nprint(int(x))\r\n", "def maximum_number(m, n):\n return (m * n) // 2\n\nm, n = input().split(' ')\nprint(maximum_number(int(m), int(n)))\n \t \t\t\t \t\t\t\t\t \t\t\t\t \t\t\t \t", "import sys\r\n\r\ninp = sys.stdin.readline()\r\nm,n = [int(elem) for elem in inp.split()]\r\n\r\narea = m*n\r\n\r\nnum = area//2\r\n\r\nsys.stdout.write(str(num))", "import sys\r\nmy_list = sys.stdin.readline().split()\r\nheight = int(my_list[0]) # высота\r\nwidth = int(my_list[1]) # ширина\r\nfield = height * width\r\nprint(int(field / 2))", "a,l = map(int,input().split())\r\nprint(a * l // 2)\r\n", "num = [int(i) for i in input().split()]\nn,m = num[0], num[1]\nq = n*m\nif q % 2 == 0:\n print(q//2)\nelse:\n print((q-1) // 2)", "a,b = map(int,input().split())\r\n\r\nq = a*b\r\n\r\nif(q%2==0):\r\n print(int(q/2))\r\nelse:\r\n (q%2==1)\r\n q=q-1\r\n print(int(q/2))\r\n \r\n", "import math\r\nm,n = map(int, input().split())\r\nprint(math.floor(n*m/2))", "m,k = map(int,input().split())\r\nprint((k*m) // 2)\r\n", "'''\r\nn (1 ≤ n ≤ 1000)\r\n'''\r\n# counter = [counter+1 for points in numbers_of_points if int(points) > min_number_of_points]\r\n\r\n# a = [input()]\r\n# print(a )\r\ndef func(length):\r\n a,b = int(length[0]), int(length[1])\r\n return (a*b)//2\r\n\r\nif __name__ == '__main__':\r\n length = list(input().split(' '))\r\n print(func(length))\r\n\r\n# if __name__ == '__main__':\r\n# length = int(input())\r\n# array = [list(input().split(' ')) for _ in range(length)]\r\n# print(func(length, array))\r\n\r\n\r\n# def func(length, array):\r\n# for word in range(length):\r\n# if len(array[word]) > 10:\r\n# b = len(array[word]) - 2\r\n# print(f'{array[word][0]}{b}{array[word][-1]}')\r\n# else:\r\n# print(array[word])\r\n\r\n\r\n# if __name__ == '__main__':\r\n# length = int(input())\r\n# array = [input() for _ in range(length)]\r\n# func(length, array)\r\n\r\n\r\n", "ne=input().split()\r\npe=list(map(int,ne))\r\nMe= pe[0]\r\nNe=pe[1]\r\n \r\ndef maxdomin(Me, Ne):\r\n return (Me * Ne) // 2\r\nprint(maxdomin(Me, Ne))", "t = [int(x) for x in input().split(' ')]\r\nprint((t[0]*t[1])//2)\r\n", "nember = input().split()\r\nnember1 = int(nember[0])\r\nnember2 = int(nember[1])\r\nprint(int (nember1 * nember2 / 2))\r\n", "nums = list(map(int,input().split()))\r\nprint((nums[0]*nums[1]) // 2)", "m,n = input().split(' ')\r\n\r\nm=int(m)\r\nn=int(n)\r\n\r\nprint(int(m*n/2))", "m,n = tuple(map(int,input().split()))\r\nprint((m*n)//2)", "a=input()\r\na=a.split(\" \")\r\nx=int(a[0])*int(a[1])\r\nprint(int(x/2))\r\n", "a, b = map(int, input().split())\r\nif (a % 2 == 0) :\r\n print (a // 2 * b)\r\nelse :\r\n print ((a - 1) // 2 * b + b // 2)", "l,b=map(int,input().split())\r\narea=l*b\r\nprint(area//2)\r\n", "m,n = map(int,input().split())\narea = m*n\ndomino = 2*1 \nresult = int(area/domino)\n\nprint(result)", "num=input().split()\nm=int(num[0])\nn=int(num[1])\nprint(int((m*n)/2))\n\n", "num,num2 = input().split()\r\nprt = int(num) * int(num2)\r\naveOf = prt//2\r\nprint(aveOf)\r\n", "n , k = list(map(int , input().split()))\r\nprint(n*k//2)", "numbers = input()\r\nlist = numbers.split()\r\nm,n = map(int, list)\r\n\r\nproduct = (m * n)//2\r\nprint(product)", "m,n=map(int,input().split())\r\na=m*n\r\nif a%2==0:\r\n print(a//2)\r\nelif a%2==1:\r\n print((a-1)//2)", "a,s=map(int,input().split())\r\nh=(a*s)/2\r\nprint(int(h))", "# DOMINO PILLING\r\na,b = map(int, input().split())\r\nans = (a*b) // 2\r\nprint(ans)", "array = list(map(int, input().strip().split()))\r\nM = array[0]\r\nN = array[1]\r\narea = M*N\r\nrisultato = 0\r\nif 1 <= M <= N <= 16:\r\n if area % 2 == 0:\r\n risultato = int(area / 2)\r\n else:\r\n risultato = int((area-1)/2)\r\nprint(risultato)\r\n", "\"\"\"\r\nm,n=map(int,input().split())\r\nprint((m*n)//2)\r\n\"\"\"\r\n\"\"\"\r\nl = list(map(int, input().split()))\r\nprint((l[0] * l[1])//2)\r\n\"\"\"\r\n\r\nchir, ris = input().split()\r\nchir, ris = int(chir), int(ris)\r\n \r\nprint(int(chir*ris/2))\r\n\"\"\"\r\nimport math\r\ndomino = 0\r\nboard = input().split(\" \")\r\nboardSize = int(board[0]) * int(board[1])\r\n \r\nprint(math.floor(boardSize / 2))\r\n\"\"\"", "n,m=map(int,input().split())\r\nif n%2==0:\r\n print(m*(n//2))\r\nelif m%2==0:\r\n print(n*(m//2))\r\nelse:\r\n print(n*(m//2)+n//2)", "\r\nif __name__=='__main__':\r\n size = input()\r\n mn = size.split(\" \")\r\n print(int((int(mn[0])*int(mn[1]))/2))", "import math\na, b = [int(x) for x in input().split(\" \")]\nprint(math.floor(a*b/2))\n\t \t\t \t\t \t \t\t \t\t \t\t \t \t", "import sys\n\nfor line in sys.stdin:\n line = line.rstrip()\n dimension = line.split(\" \")\n #print(dimension)\n \n m=int(dimension[0])\n n=int(dimension[1])\n\n c=m*n\n d=2*1\n\n print(int(c/d))\n exit()", "x,y = list(map(int,input().split()))\r\nprint((x*y)//2)", "\r\n\r\ndef aaa(m,n):\r\n total =int(m*n/2)\r\n\r\n return total\r\n\r\n\r\nm,n = list(map(int, input().split()))\r\n\r\n\r\nprint(aaa(m , n))\r\n\r\n\r\n\r\n", "m, n = input().split(' ')\r\nm, n = int(m), int(n)\r\nprint(int(m * n / 2))", "A,B = input().split()\na,b = int(A),int(B)\nc = a*b\nprint(c//2)", "m, n = map(int, input().split())\r\np= m*n\r\nprint(int(p/2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 2 18:17:10 2021\r\n\r\n@author: Asus\r\n\"\"\"\r\n\r\nm,n=map(int,input().split())\r\nprint(int((m*n)/2) if (m*n)%2==0 else (int((m*n)//2)))\r\n", "n,m=map(int,input().split())\r\na=n*m\r\nq=int(a/2)\r\nprint(q)", "str=input().strip()\r\nlist=str.split(sep=\" \")\r\nm=int(list[0])\r\nn=int(list[1])\r\nans=int((m*n)/2)\r\nprint(ans)", "o=list(map(int,input().split()))\r\nprint((o [0]*o [1]//2))", "ch=input()\r\nM,N=map(int,ch.split())\r\nk=M*N\r\nprint(k//2)", "board = input('')\r\ns = board.split()\r\n\r\ndef solve(s):\r\n \r\n board = int(s[0]) * int(s[1])\r\n dominos = board // 2\r\n return dominos\r\n\r\nprint(solve(s))", "numbers = (input())\r\n\r\nnumberschange = [list(s) for s in numbers.split(' ')]\r\n\r\nnumberscopy = numberschange[:]\r\n\r\nnumberscopy[0] = int(\"\".join(numberscopy[0]))\r\nnumberscopy[1] = int(\"\".join(numberscopy[1]))\r\n\r\nprint (((numberscopy[0]*numberscopy[1]))//2)", "m, n = map(int, input().split())\r\nd = int()\r\nd = (m // 2 * n) + (m % 2 * (n // 2))\r\nprint(d)\r\n", "import math\r\nuser1 = input()\r\nuser = user1.split(\" \")\r\na = int(user[0])\r\nb = int(user[1])\r\nfinal = math.floor((a*b)/2)\r\nprint(final)", "from math import floor\r\nn =input().split()\r\nsize = int(n[0]) * int(n[1])\r\nprint(floor(size/2))\r\n ", "n,m=map(int,input().split())\r\nmaxdom=((n*m)//2)\r\nprint(maxdom)", "\r\ninp = input()\r\n\r\nm = int(inp.split()[0])\r\n\r\nn = int(inp.split()[1])\r\n\r\narea = m*n\r\n\r\nprint(int(area/2))", "M, N = list(map(int,input().split()))\r\nanswer=0\r\ncounter=0\r\nwhile(answer<M*N):\r\n answer+=2\r\n\r\nif((M*N)%2==0):\r\n print(answer//2)\r\nelse:\r\n print(answer//2-1)\r\n\r\n", "a, b = map(int, input().split())\r\nprint(int(a * (b / 2)))", "inp = input()\ninputs = inp.split();\nprint(int(inputs[0]) * int(inputs[1])//2)\n ", "b,j=map(int,input().split())\r\nprint(b*j//2)", "m, n = input().split()\r\n\r\nm = int(m)\r\nn = int(n)\r\nnop = 0\r\nif (m%2 == 0):\r\n nop = (m/2)*n\r\nelif n>=2 and n%2==0:\r\n nop = ((m-1)/2)*n + (n/2)\r\nelif n>=2 and n%2==1:\r\n nop = ((m-1)/2)*n + (n-1)/2\r\n \r\nprint(int(nop))", "x,y=map(int, input().split())\r\nz=x*y\r\nprint(z//2)", "m,n = map(int,input().split())\r\nx=2\r\na = m*n\r\nprint(a//2)", "m,n=map(int,input().split())\r\ntotal=m*n\r\nx=total-((total)%2)\r\nz=x/2\r\nprint(int(z))", "m,n=map(int,input().strip().split())\r\nprint(int((m*n)/2))", "#j = list(map(int, input().split()))\r\n#n, k = j[0], j[1]\r\n#ll = []\r\n#if 1 <= k <= n <= 50:\r\n#\tb = list(map(int, input().split()))\r\n#\twhile k > 0:\r\n#\t\tb_max = max(b)\r\n#\t\tif (0 < b_max <= 100):\r\n#\t\t\tif k > 1:\r\n#\t\t\t\tll.append(b_max)\r\n#\t\t\t\tb.remove(b_max)\r\n#\t\t\telif b_max in ll and k == 1:\r\n#\t\t\t\tll.append(b_max)\r\n#\t\t\t\tb.remove(b_max)\r\n#\t\t\t\tk += 1\r\n#\t\tk -= 1 \r\n#print(len(ll))\r\n\t\r\n\r\nb = list(map(int, input().split()))\r\nm, n = b[0], b[1]\r\n\r\nif 1 <= m <= n <= 16:\r\n\tk = m * n \r\n\tresult = k // 2\r\nprint(result)\r\n", "n, m = map(int,input().split())\r\na = n*m\r\nprint(int(a/2))", "M,N =map(int,input().split())\r\nprint(((M*N)//2))", "m, n = map(int,input().split())\r\nif ((m%2 == 0) or (n%2 == 0)):\r\n\tprint(m*n//2)\r\nelse:\r\n\tprint((m//2)*n + n//2)", "a,b=map(int,input().split())\ns=a*b\nprint(s//2)\n\t\t\t \t \t\t \t \t\t \t\t \t \t \t", "import math\r\nm, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nres = m * n\r\nprint(math.floor(res/2))", "import sys\nimport math\n\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\n\n# For taking integer inputs.\ndef inp():\n return(int(input()))\n\n# For taking List inputs.\ndef inlt():\n return(list(map(int,input().split())))\n\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.\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n\n# For taking space seperated integer variable inputs.\ndef invr():\n return(map(int,input().split()))\n\ninput = list(invr())\n\nM = input[0]\nN = input[1]\n\nif(M % 2 == 0 or N % 2 == 0):\n print( int(M*N/2 ))\nelse:\n print( int(max(N,M)*(min(N,M)-1)/2 + math.floor(max(N,M)/2) ))\n", "scores = list(map(int, input().split()))\r\nm = scores[0]\r\nn = scores[1]\r\nmn = m*n\r\nprint(mn//2)\r\n\r\n", "def main():\r\n\tinput_list = input().split()\r\n\tm, n = [int(x) for x in input_list]\r\n\t\r\n\tif m % 2 == 0:\r\n\t\tdem = (m // 2) * n\r\n\telif n % 2 == 0:\r\n\t\tdem = (n // 2) * m\r\n\telse:\r\n\t\tdem = (m * n - 1) // 2\r\n\tprint(dem)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "M,N=map(int,input().split())\r\nresult=M*N\r\nprint(result//2)\r\n \r\n", "m,n = map(int,input().split())\r\npro = m*n\r\nprint(pro//2)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nans=int(n*m//2)\r\nprint(ans)", "lst1 = [int(i) for i in input().split()]\r\nprint(lst1[0] * lst1[1] // 2) ", "\r\n\r\ndef main():\r\n n, m = input().split()\r\n num = int(n) * int(m)\r\n ans = algo(num)\r\n print(ans)\r\n\r\n\r\n\r\ndef algo(num):\r\n if num == 0 or num == 1:\r\n result = 0\r\n\r\n else:\r\n result = algo(num - 2)\r\n result +=1\r\n\r\n return result\r\n\r\nmain()", "m,n=list(map(int,input().split()))\r\nprint(int((m*n)/2))\r\n", "m,n=map(int,input().split())\r\nd=m*n\r\nprint(d//2)", "m,n=map(int,input().split())\r\nif((m*n)%2==1):\r\n print( ( m*n )//2 )\r\nelse:\r\n print((m*n)//2)", "m, n = map(int, input().split())\r\nif m % 2 == 0:\r\n k = m / 2 * n\r\nelif m % 2 == 1 and n % 2 == 0:\r\n k = m // 2 * n + n / 2\r\nelse:\r\n k = m // 2 * n + n // 2\r\nprint(int(k))", "import math\r\nn=input()\r\nval = n.split(\" \")\r\nvalarr = list(map(int,val))\r\narea = valarr[0]*valarr[1]\r\nprint(math.floor(area/2))", "m, n = map(int, input().split())\r\n\r\nif 1 <= m <= n <= 16:\r\n print((m * n) // 2)", "n,m = map(int,input().split())\r\nif n % 2 == 1:\r\n print((n//2)*m+(m//2))\r\nelse:\r\n print((n//2)*m)", "x,y = map(int, input().split())\n\nmax_dominoes = (x*y)//2\n\nprint(max_dominoes)\n\n\t \t \t\t\t \t\t\t \t\t \t \t \t\t \t", "a = input()\r\na = a.split(' ')\r\ns = int(a[0])*int(a[1])\r\nprint(s//2)", "i = input().split()\r\n\r\nn = int(i[0])*int(i[1])//2\r\n\r\nprint(n)\r\n\r\n\r\n\r\n\r\n", "mn = [int(x) for x in input().split()]\r\n\r\ndomino_piece = 2*1\r\n\r\nproduct = 1\r\nfor num in mn:\r\n product = product * num\r\n\r\nresult = product // domino_piece\r\n\r\nprint(result)", "import math\n\nboard = list(map(int, input().split()))\nrez = math.floor((board[0]*board[1])/2)\nprint(rez)\n", "n = [int(i) for i in input().split()]\r\nanswer = n[0] * n[1] // 2\r\nprint(answer)\r\n", "M, N = [int(i) for i in input().split(' ')]\r\nif (M&1) and (N&1):\r\n print(((M-1)*(N-1) + (M-1) + (N-1))//2)\r\nelse:\r\n print(M * N // 2)", "import math\r\nMN = input().split()\r\nMN = int(MN[0]) * int(MN[1])\r\npice = 2\r\n\r\nprint(int(math.floor(MN / pice)))\r\n", "List = input().split()\r\nprint(int(int(List[0]) * int(List[1]) / 2))", "L=list(map(int,input().split(\" \",2)))\r\nM=L[0]\r\nN=L[1]\r\nif M%2==0:\r\n print(int(M/2*N))\r\nelif N%2==0:\r\n print(int((N/2*M)))\r\nelse:\r\n print(int((M//2)*N+N//2))\r\n", "m,n = (map(int, input().split()))\r\nb = m*n\r\na = 2\r\nprint(b//a)", "M,N=map(int,input().split())\nP=M*N//2\nprint(P)\n \t \t \t \t\t\t\t\t\t\t\t \t \t \t\t\t", "\r\ndimensions = input()\r\narea = 1\r\n\r\n\r\ndimensions = dimensions.split(\" \")\r\n\r\nfor i in dimensions:\r\n area *= int(i)\r\n\r\nprint(int(area/2))", "n, m = map(int, input().split())\r\nk = int((n * m) / 2)\r\nprint(k)", "n, k = map(int, input().split())\nans = n // 2 * k\nif n % 2:\n ans += k // 2\nprint(ans)\n", "raw = input()\r\n \r\ndelim = raw.split()\r\n \r\nm = int(delim[0])\r\nn = int(delim[1])\r\n \r\nprint((m*n)//2)", "width,length = map(int,input().split())\r\narea = width * length\r\n\r\nif area % 2 == 0:\r\n print(int(area / 2))\r\nelif area %2 != 0:\r\n print(int(area / 2))", "m,n=map(int,input().split())\na=m*n\nd=(m*n)//2\nprint(d)\n \t \t \t\t\t \t \t \t\t\t \t \t \t", "M,N=map(int,input().split())\r\nb=M*N\r\nx=b//2\r\nprint(x)", "x = input()\ny = x.split(' ')\nprint(int((int(y[0]) * int(y[1]))/2))\n\t \t\t\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t\t", "nan, red = map(int, input().split())\ntotal = int(nan*red / 2)\nprint(total)\n\t\t \t\t\t \t\t\t \t \t \t \t \t \t\t \t", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\n\ndef solve():\n m, n = inlt()\n \n # greedily consume even x even rectangle:\n rows, extra_row = (m, False) if m % 2 == 0 else (m - 1, True)\n cols, extra_col = (n, False) if n % 2 == 0 else (n - 1, True)\n \n count = int(rows * cols / 2)\n if extra_row and extra_col:\n count += int((m + n - 1) // 2)\n elif extra_row:\n count += int(n // 2)\n elif extra_col:\n count += int(m // 2)\n print(count)\n\n\nif __name__ == \"__main__\":\n solve()", "x = str(input()).split()\r\nprint((int(x[0])*int(x[1]))//2)", "line1=input().split()\r\nm,n=int(line1[0]),int(line1[1])\r\nprint((m*n)//2)", "m,n = [int(i) for i in input().split(' ')]\r\n\r\nprint(n*m//2)", "m,n=map(int,input().split())\r\nq=0\r\nfor i in range (2,max(m,n)+1,2):\r\n for j in range(min(m,n)):\r\n q+=1\r\nif max(m,n)%2!=0:\r\n q+=min(m,n)//2\r\nprint(q)\r\n", "import math\r\nl=list(map(int,input().strip().split()))\r\nm=l[0]\r\nn=l[1]\r\nres=m*n\r\nprint(math.floor(res/2))", "n = list(map(int,input().split()))\r\na = n[0]*n[-1]\r\nif a % 2 == 1:\r\n print(int((a-1)/2))\r\nelse:\r\n print(int(a/2))\r\n", "n,m=map(int,input().split())\ns=n*m\nprint(s//2)\n\t \t\t\t \t \t\t \t\t\t \t\t\t", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nprint(n*m//2)", "m,n=map(int,input().split())\nmd=(m*n)//2\nprint(md)\n\t \t \t\t \t\t \t \t \t \t\t \t \t\t \t", "m,n=map(int,input().split())\r\nif m%2==1 and n%2==1:\r\n print(int((n*m-1)/2))\r\nelse:\r\n print(int(m*n/2))", "import math\r\n\r\nn,m=input().split(' ')\r\nn=int(n)\r\nm=int(m)\r\n\r\nprint(math.floor((n*m)/2))", "m, n = input().split()\r\nmaxDominos = (int(m)*int(n))//2\r\nprint(maxDominos)\r\n", "multi=1\r\na=input()\r\na=a.split(\" \")\r\nfor j in range(2):\r\n multi*=int(a[j])\r\nif multi%2==0:\r\n print(int(multi/2))\r\nelse:\r\n multi-=1\r\n print(int(multi/2))", "from operator import mul\r\nfrom functools import reduce\r\n\r\nprint(reduce(mul, map(int, input().split())) //2)", "a,b=map(int,input().split())\r\ns=0\r\ns=s+(a//2)*b\r\nif a%2!=0:\r\n s=s+b//2\r\nprint(s)", "h, w = [int(x) for x in input().split()]\r\n\r\nanswer = int((h*w)/2)\r\nprint(answer)", "m,n=[int(x) for x in input().split()]\r\nprint(m*n//2)", "# Input\r\nM, N = map(int, input().split())\r\n\r\n# Calculate the maximum number of dominos\r\ntotal_squares = M * N\r\nmax_dominos = total_squares // 2\r\n\r\n# Output the result\r\nprint(max_dominos)\r\n", "n,m=map(int,input().split())\r\nans=(n*m)//2\r\nprint(int(ans))\r\n\r\n\r\n", "# Codeforces 50A\r\n\r\nm, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nprod = m*n\r\nif prod % 2 == 0:\r\n print(int(prod/2))\r\nelse:\r\n print(int((prod-1)/2))", "m, n = tuple (map (int, input ().split (' ')))\r\ndominos = int (m * n / 2)\r\nprint (dominos)", "a,b = map(int,input().split())\r\nif a*b%2==0:\r\n print(int(a*b/2))\r\nelse:\r\n print(int((a*b-1)/2))", "a, b = [int(i) for i in input().split()]\n\n\nz = a * b\nprint(z//2)", "A,b = input().split()\r\npill = int(A) * int(b)\r\nprint(pill//2)\r\n ", "from math import floor\r\nm, n = map(int, input().split())\r\nprint(floor(m * n // 2))\r\n", "m,n = map(int, input().split())\na=m*n\ncont=a//2 \nprint(cont)\n \t \t\t\t \t\t\t\t\t \t \t \t \t\t \t \t\t", "a, b = map(int, input().split())\r\ndef domino():\r\n c=a*b//2\r\n print(c)\r\n\r\ndomino()\r\n \r\n", "mbyn = input().split(\" \")\nm = int(mbyn[0])\nn = int(mbyn[1])\nmult = m * n\nif mult % 2 == 0:\n print(mult // 2)\nelse:\n print((mult - 1) // 2)\n", "n,m=(int(x) for x in input().split())\r\np=int(n*m/2)\r\nprint(p)", "m,n=input().split();m,n=int(m),int(n);a=m*n;e=0;r=0\r\nfor i in range(0,a):\r\n r+=2\r\n if r<=a:\r\n e+=1\r\nprint(e)", "inp=input()\r\nx,y=inp.split(\" \")\r\narea=(int(x)*int(y))//2\r\nprint(area)", "a , b = input().split()\na = int(a)\nb = int(b)\np = a*b\np = int(p)\nd =p/2\nprint(int(d))\n\t\t \t \t\t\t \t\t \t \t \t", "i = input().split()\r\nl = (i[0])\r\nb = (i[1])\r\nh = int(l)\r\nr = int(b)\r\nd = 2\r\nf = h*r//d\r\nprint(f)\r\n", "data=input().strip().split()\r\narea=int(data[0])*int(data[1])\r\nprint(area//2)", "a = list(map(int, input().split()[:2]))\r\ns = a[0] * a[1]\r\nanswer = s // 2\r\nprint(answer)\r\n", "m, n=map(int, input().split())\r\ns= n*m\r\n\r\nprint(s//2)\r\n", "v, a = list(map(int, input().split()))\r\nprint(f\"{(v * a) // (2 * 1)}\")", "x=input().split()\r\nm=int(x[0]);n=int(x[-1])\r\ns=int(m*n/2)\r\nprint(s)", "configuration = input().split(\" \")\nM = int(configuration[0])\nN = int(configuration[1])\n\nresult = M*N // 2\n\nprint(result)\n", "m,n = map(int, input().split())\r\nif m % 2 == 0 or n % 2 == 0:\r\n print(int(m * n / 2))\r\nelse:\r\n print(int((m * n -1) / 2))", "m,n=map(int,input().split())\r\nmax_dominoes=(m*n)//2\r\nprint(max_dominoes)", "\r\nm, n = map(int, input().split())\r\n\r\nif (m < 1) or (m > 16) or (n < 1) or (n > 16) or (m > n):\r\n print(\"Error\")\r\n\r\nx = m // 2\r\nout = x * n\r\n\r\nif (m % 2) != 0:\r\n out += (n // 2)\r\n\r\nprint(out)\r\n", "vals = input().split()\narea = []\nrow = []\nfor x in range(int(vals[1])):\n for y in range(int(vals[0])):\n row.append(\"\")\n area.append(row)\n row = []\n\n\ncounter = 0\nfull = False\nwhile not full:\n for col in range(len(area)-1):\n for row in range(len(area[0])):\n if area[col][row] == \"\" and area[col + 1][row] == \"\": #horizontal orient.\n area[col][row] = \"x\"\n area[col + 1][row] = \"x\"\n counter +=1\n \n for row in range(len(area[x])-1):\n for col in range(len(area)):\n if area[col][row] == \"\" and area[col][row + 1] == \"\":#vertical orient.\n area[col][row] = \"x\"\n area[col][row + 1] = \"x\"\n counter += 1\n full = True\n empty = 0\n for x in range(len(area)):\n for y in range(len(area[0])):\n if area[x][y] == \"\":\n empty += 1\n if empty > 1:\n full = False\n\n \nprint(counter)\n \n", "inp=input().split()\r\nM=int(inp[0])\r\nN=int(inp[1])\r\nS=M*N\r\nD=S//2\r\nprint(D)\r\n \r\n\r\n \r\n", "'''m, n = map(int, input().split()) \nprint(n*m//2)\n'''\n\nprint(eval(input().replace(' ','*'))//2)\n\n\n\n'''\n\nYou are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.\n\nInput\nIn a single line you are given two integers M and N — board sizes in squares (1 ≤ M ≤ N ≤ 16).\n\nOutput\nOutput one number — the maximal number of dominoes, which can be placed.\n'''", "x , y = map(int , input().split())\r\n\r\ns = x*y\r\n\r\nprint(s // 2)", "a = input()\r\na = a.split()\r\nm = int(a[0])\r\nn = int(a[1])\r\nboard = m*n\r\n\r\nres = board//2\r\nprint(res)\r\n", "m,n = map(int,input().split())\r\n\r\nproduct = m*n;\r\ndomino = product/2;\r\nprint(int(domino))\r\n", "x=input()\r\nm=int(x.split()[0])\r\nn=int(x.split()[1])\r\nif m==1 and n==1:\r\n print(0)\r\nelif m==1 and n>1:\r\n print(n//2)\r\nelif m>1 and n==1:\r\n print(m//2)\r\nelif m%2==0 or n%2==0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int((m-1)*(n-1)/2+(m-1)/2+(n-1)/2))\r\n", "M,N = map(int ,input().split())\r\nP = M*N\r\nprint(P//2)", "n, m = map(int, input().split())\r\n\r\nif n % 2 == 0 and m % 2 == 0:\r\n print(n * m // 2)\r\nelif n % 2 == 1 and m % 2 == 1:\r\n print((n - 1) * (m - 1) // 2 + (n + m - 2) // 2)\r\nelse:\r\n if n % 2 == 1:\r\n n, m = m, n\r\n print(n * (m - 1) // 2 + n // 2)", "l, w = map(int, input().split())\r\nprint(l * w // 2)\r\n", "M,N=(map(int,input().split()))#Domino pilling\r\nk=M*N\r\nmaximal=k//2\r\nprint(maximal)", "a = input()\r\nlista = a.split()\r\nb = int(lista[0]) * int(lista[-1])\r\n\r\nprint(b // 2)", "n,m=[int(d) for d in input().split()]\r\ns=n*m\r\na=s//2\r\nprint(a)", "data = input().split(\" \")\r\ndataint = [eval(i) for i in data]\r\narea = dataint[0] * dataint[1]\r\ncount = area // 2\r\nprint (count)", "A,B= map(int, input().split())\nmax_dominoes = (A* B) // 2\nprint(max_dominoes)\n\n\t\t \t\t\t \t \t\t \t \t \t \t \t \t", "a,b=map(int,input().split())\nif a%2==0 or b%2==0 or (a*b)%2==1:\n print((a*b)//2)\nelse:\n print((a*b-1)//2)\n \t\t \t\t \t \t\t\t\t\t\t\t \t\t\t\t \t \t", "p,q= [int(item) for item in input().split()]\r\nprint(p*q//2)", "a , b = map(int, input().split())\r\nc = 0\r\nif (a * b) % 2 == 0:\r\n c = (a * b) // 2\r\nelse:\r\n c = ( (a * b) // 2 ) \r\nprint (c)", "s = input()\r\n\r\nli = s.split()\r\n\r\nm = int(li[0])\r\nn = int(li[1])\r\n\r\n\r\ndn = int((m*n)/2)\r\n\r\nprint(dn)", "a,b= map(int, input().split())\r\nc=a*b\r\nprint(c // 2)", "import math as ma\r\nm,n=map(int,input().split())\r\nresault=0\r\nif m>=1 and m<=n and n<=16:\r\n resault=(n*m)/2\r\n\r\nprint(ma.floor(resault))", "m, n = map( int, input().split() )\ntotal_squares = m * n\nmax_dominoes = total_squares // 2\nprint(max_dominoes)\n\t\t\t\t \t \t \t \t\t\t\t\t \t\t \t\t", "inp = input()\nm, n = inp.split(\" \")\nm = int(m)\nn = int(n)\ns = m*n\n\noutput = s//2\nprint(output)\n", "m, n = map(int, input().split())\r\nc = max(m, n)\r\nif c%2 == 0:\r\n tot = min(m, n) * (c // 2)\r\nelse:\r\n tot = min(m, n) * (c // 2)\r\n tot += (min(m, n) // 2)\r\nprint(tot)", "r,y=map(int,input().split())\n\nz=((r*y)//2)\n\nprint(z)\n\n \t\t \t \t\t \t\t \t\t \t\t \t\t \t", "m,n=[int(i) for i in input().split()]\r\narea=m*n\r\nprint(int(area/2))", "inp = input().split()\r\narr = []\r\nfor el in inp:\r\n arr.append(int(el))\r\n\r\nm = arr[0]\r\nn = arr[1]\r\n\r\nresult = m//2*n\r\nif m%2:\r\n result += n//2\r\n\r\nprint(result)\r\n", "mm = list(map(int, input().split()))\r\nprint(mm[0]*mm[1]//2)\r\n", "#!/usr/bin/env python3\r\n\r\ndef inp(*, cf=lambda x: x): return cf(input())\r\ndef inpint(): return inp(cf=int)\r\ndef inp_line(*, cf=lambda x: x, s=' '): return list(map(cf, input().split(s)))\r\ndef inpints(): return inp_line(cf=int)\r\ndef intstostr(l): return ' '.join([str(x) for x in l])\r\ndef listtostr(l): return ' '.join(l)\r\n\r\ndef test_case(case):\r\n m, n = inpints()\r\n\r\n if m % 2 == 0 or n % 2 == 0:\r\n return (m * n) // 2\r\n else:\r\n return (m * n - 1) // 2\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "M,N=map(int,input().split())\r\ns=M*N\r\ns=s//2\r\nprint(int(s))\r\n", "m,n = map(int,input().split())\r\nmax_dominoes_number = int((m*n)/2)\r\nprint(max_dominoes_number)", "str =input().split(\" \")\r\nm =int(str[0])\r\nn =int(str[1])\r\n\r\n\r\nx = m * n/2\r\n\r\nprint(int(x))", "import math\r\n\r\nwidth, height = input(\"\").split(\" \")\r\nprint(math.floor(int(width)*int(height)/2))", "P,Q=map(int,input().split())\r\nif P == 1 and Q==1:\r\n print(0)\r\nelse:\r\n print((P*Q)//2)", "M,N=map(int,input().split())\r\nsum=int(M*N/2)\r\nprint(sum)\r\n", "count = 0\r\n\r\nset = input().split(\" \")\r\nnum = int(set[0])* int(set[1])\r\n\r\nif (num % 2) != 0:\r\n print(int((num - 1) / 2))\r\nelse:\r\n print(int(num / 2))", "import math\r\nip=input()\r\nnum=ip.split(\" \")\r\nl=int(num[0])\r\nb=int(num[1])\r\nop=math.floor((l*b)/2)\r\nprint(op)", "l, w = [int(x) for x in input().split()]\r\nif l %2 == 0:\r\n print(l//2 * w)\r\nelse:\r\n print(l//2 * w + w//2)", "m,n=map(int,input().split())\r\nsquare=m*n\r\nbox=2\r\nprint(square//box)", "x, y = map(int,input().split())\r\nz=(x*y)/2\r\nprint(int(z))", "a=input()\r\na=a.split()\r\nlength=int(a[0])\r\nwidth=int(a[1])\r\nnum=length*width//2\r\nprint(num)\r\n", "inp=input().split()\nm=int(inp[0])\nn=int(inp[1])\nprint(m*n//2)\n", "m, n = input().split(' ')\r\nm = int(m)\r\nn = int(n)\r\n\r\nx = m * n\r\n\r\nif x % 2 == 0:\r\n print(int(x/2))\r\n\r\nelif x % 2 == 1:\r\n print(int((x-1)/2))", "rectangle_board = input().split()\r\nm = int(rectangle_board[0])\r\nn = int(rectangle_board[1])\r\ndominos = (m*n)//2\r\nprint(dominos)\r\n", "n, m = map(int, input().split())\r\n\r\nif n % 2 == 0 and m % 2 == 1:\r\n n, m = m, n\r\n\r\nmax_dominoes = (n * m) // 2\r\n\r\nprint(max_dominoes)\r\n", "n,m = [int(c) for c in input().split()]\r\n\r\nprint(n*m // 2)", "a = input().split(\" \")\r\nm = int(a[0])\r\nn = int(a[1])\r\ndominos = 0\r\ndominos += (m//2)*n\r\nif m%2==1:\r\n dominos+= n//2\r\nprint(dominos)", "## Importamos de la libreria Math la funcion floor que aproxima los numeros decimales a su entero inferior mas cercano\r\nfrom math import floor\r\n## Definimos las variables m y n que deben ingresarse en la primera linea\r\nm,n = map(int,input().split())\r\n## Creamos una variable s que definiria la cantidad de dominos que cabrian, usando la función floor y la operacion de filas x columnas dividida en 2\r\ns=floor((m*n)/2)\r\n## mostramos el resultado de dominos que cabrian\r\nprint(s)", "dimensions_sq = input()\n\nnumbers = dimensions_sq.split()\n\narea_sq = int(numbers[0]) * int(numbers[1])\n\nnum_domino = int(area_sq / 2) \n\nprint(num_domino)\n\n", "a,b = map(int,input().split())\r\nc = a*b//2\r\nprint(c)", "\r\nwidth, height = map(int, input().split(\" \"))\r\n\r\nprint((width * height) // 2)\r\n", "m, n = [int(s) for s in input().split()]\nprint(m * n // 2)\n", "m,n=map(int,input().split())\r\nres=m*n//2\r\nprint(res)", "a,b = map(int, input().split())\n\nmax_dominoes = (a * b) // 2\n\nprint(max_dominoes)\n\n \t \t\t\t \t\t\t\t\t\t\t\t \t \t\t \t\t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\nm, n = map(int, input().split())\r\n\r\nout = (m*n)//2\r\n\r\nprint(out)", "n,m=map(int ,input().split())\r\na=n*m\r\nif a%2==0:\r\n print(a//2)\r\nelse:\r\n print((a//2))\r\n", "import math\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\nif (n * m) % 2 == 0:\r\n print(n * m // 2)\r\nelse:\r\n x = (m - 1) * n / 2 + math.floor(n / 2)\r\n print(int(x))", "p,q=map(int,input().split())\r\nprint((p*q)//2)", "m, n = map(int, input().split())\r\nans = m * n // 2\r\nprint(ans)", "def dominoes(m,n):\r\n return m * n // 2\r\nm,n = map(int,input().split(' '))\r\nprint(dominoes(m,n))", "m,n = map(int,input().split())\r\narea = m * n\r\nprint(area//2)\r\n", "d=input().split(\" \")\r\nm=int(d[0])\r\nn=int(d[1])\r\nif m%2==0 or n%2==0:\r\n print(m*n//2)\r\nelse:\r\n print((m*n-1)//2)\r\n", "m,n = input().split(' ')\r\nm = int(m)\r\nn = int(n)\r\nd = 2*1\r\nMax = (m*n) // d\r\nprint(Max)", "from sys import stdin,stdout \r\nimport math\r\na=list(map(int,stdin.readline().split()))\r\nn=a[0]\r\nm=a[1]\r\n\r\nprint((n*m)//2)", "a, b=map(int, input() .split() )\nprint(a*b//2)\n\t\t \t\t \t\t\t \t\t\t\t\t \t \t \t\t \t\t \t\t", "a=list(map(int,input().split()))\r\nm=a[0]\r\nn=a[1]\r\nprint((m//2)*(n//2)*2 + (m%2)*(n//2) + (m//2)*(n%2))", "board = input()\ncoords = board.split(\" \")\nx, y = int(coords[0]), int(coords[1])\nfields = x * y\nprint(fields // 2)\n", "def domino(a):\r\n probel = a.find(' ')\r\n n = int(a[0:probel])* int(a[probel:])\r\n print (n//2)\r\n \r\n\r\ndomino(input())\r\n", "import math\r\nM , N =map(int, input().split())\r\narea = M*N\r\n\r\nhow_many_blocks = math.floor(area/2)\r\n\r\nprint(how_many_blocks)", "n,m=map(int,input().split())\r\nprint(m//2*n+(m%2)*(n//2))\r\n", "xlist=input().split();\nm=int(xlist[0]);\nn=int(xlist[1]);\n\np=int((m*n)/2);\nprint(p);\n", "a=input().split()\r\nm=int(a[0])\r\nn=int(a[1])\r\ni=c=0\r\nwhile i>=0:\r\n if (m*n)<(2*i):\r\n c=i\r\n print(c-1)\r\n break\r\n elif (m*n)==(2*i):\r\n d=i\r\n print(d)\r\n break\r\n else:\r\n pass\r\n i+=1", "def largo(m):\r\n return m//2\r\ndef alto(n):\r\n return n\r\n\r\ndef todo(m,n):\r\n base = largo(m)*alto(n)\r\n b1 = 0\r\n if m%2 !=0:\r\n b1 = n//2\r\n return base + b1\r\n\r\nx = input()\r\nx = x.split()\r\nprint(todo(int(x[0]), int(x[1])))\r\n", "inp = input().split()\r\nM = int(inp[0])\r\nN = int(inp[1])\r\ntotal_count = 0;\r\nsmaller = min(N,M)\r\nbigger = max(N,M)\r\ntotal_count += int((bigger * (smaller - smaller % 2) / 2));\r\nif smaller % 2 == 1:\r\n smaller_fit = (bigger - bigger % 2)/2\r\n total_count += int(smaller_fit);\r\nprint(total_count);\r\n", "a,b=list(map(int,input().split()))\narea=a*b\ndomino=2*1\n\nnum_domino=int(area/domino)\nprint(num_domino)\n \t \t \t \t\t \t\t\t\t \t\t\t\t\t \t\t \t", "#PROBLEM - Return how many 2x1 domino pieces can fit perfectly into a board of M x N squares.\r\n\r\n\r\nm,n = map(int, input().split())\r\n\r\nm_n_parameter = m*n\r\n\r\nmax_dominos = m_n_parameter // 2\r\n\r\nprint(max_dominos)", "n,m=map(int,input().split())\no=n*m\nv=o//2\nprint(v)\n \t\t\t \t \t\t \t \t\t\t\t \t\t", "n, m = map(int, input().strip().split())\r\nres = (n * m) // 2\r\n\r\nprint(res)", "m,n = [int(x) for x in input().split(\" \")]\r\n\r\nt = (m * n)\r\n\r\nif t % 2 == 0:\r\n print(int(t / 2))\r\nelse:\r\n print(int((t - 1) / 2))", "def domino(n, m):\r\n if m % 2 == 0:\r\n return (m // 2) * n\r\n else:\r\n return ((m - 1) // 2) * n + n // 2\r\n\r\n\r\nm, n = map(int, input().split())\r\nprint(domino(n, m))", "m,n=input().split()\r\nd=2\r\nb=int(m)*int(n)\r\nc=b//d\r\nprint(c)", "M,N = list(map(int,input().split()))\r\nprint((M*N)//2)", "num = input().split(\" \")\r\narea = int(num[0]) * int(num[1])\r\ndominos = area // 2\r\nprint(str(dominos))\r\n", "n,m = map(int, input().split())\r\nprint ((n*m)//2)\r\n", "n , m = map(int, input().split())\r\ns=n*m\r\nprint(s//2)", "enter = input().strip().split()\r\nnum1, num2 = int(enter[0]), int(enter[1])\r\nprint(num1 * num2 // 2)\r\n", "m, n = map(int, input().split())\ntotal_square = m * n\nmax_domaines = total_square // 2\nprint(max_domaines)\n \t\t\t \t\t\t \t\t \t\t \t \t\t \t\t \t\t", "n=input().split(' ')\r\nfor i in range(len(n)):\r\n n[i]=int(n[i])\r\n# print(n)\r\nm=n[0]*n[1]\r\n\r\nprint(m//2)", "M,N = list(map(int, input().split()))\r\nprint(M*N//2)\r\n ", "# http://codeforces.com/problemset/problem/50/A\n\nm,n = map(int, input().split())\nprint(m * n // 2)", "nums = input().split()\nM = int(nums[0])\nN = int(nums[1])\n\nproduct = M*N\nif product%2 == 0:\n print(int(product/2))\nelse:\n print(int((product-1)/2))", "width, length=input().split() \r\nwidth, length=[int(width), int(length)] \r\nif width<1 or width>16 or length<1 or length>16:\r\n exit() \r\nelif width*length%2==0:\r\n print(int((width*length)/2))\r\nelif width*length%2!=0:\r\n print(int(((width*length)-((width*length)%2))/2))\r\n", "import sys\ninput = sys.stdin.readline\n\nM, N = map(int,input().split())\nprint(M*N//2)\n\n", "from math import *\r\nn, m = [int(i) for i in input().split()]\r\nres = floor(n*m*0.5)\r\nprint(res)", "import math as m\r\nn,k = list(map(int,input().strip().split()))\r\nmyVar = 2\r\n\r\nans = int(m.floor((n*k)//2))\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\narea=a*b\r\nn=area//2\r\nprint(n)", "m, n = map(int, input(). split())\r\narea = m*n\r\ndomino = int(area/2)\r\nprint(domino)", "#taking inputs\nm,n=map(int,input( ).split())\n#checking the condition\nif(m%2==0 or n%2==0):\n s=m*n\n F=s//2\nelse:\n s=m*n-1\n F=s//2\n#finding the output of the program\nprint(F)\n \t \t \t \t\t\t \t \t\t \t\t \t \t\t \t", "a,b = map(int,input().split())\r\nif a==2 and b==2:\r\n print(a)\r\nelif a%2==0:\r\n if b%2==0:\r\n print(int(b/2)*a)\r\n elif b%2==1:\r\n print((int(b/2)*a)+a//2)\r\nelif a%2==1:\r\n if b%2==0:\r\n print((int(b/2)*a))\r\n elif b%2==1:\r\n print((int(b/2)*a)+a//2)\r\n", "myArray = input()\r\nsplitArray = list(map(int,myArray.split()))\r\nArea = splitArray[0]*splitArray[1]\r\n\r\nprint(Area//2)", "m,n = map(int,input().split())\r\narea = m*n\r\nprint(int((m*n)/2))", "inp = list(map(int, input().split(' ')))\r\nm = inp[0]\r\nn = inp[1]\r\n\r\nif (m*n) % 2 == 0:\r\n print(m*n//2)\r\nelse:\r\n print((m*n-1)//2)", "m, n = map(int, input().split())\r\ntoplam = int(m*n / 2)\r\nprint(toplam)", "newW = []\r\nwords = input().split()\r\n\r\nnewW.append(words)\r\n\r\nprint(int(newW[0][0]) * int(newW[0][1]) // 2)", "m,n = map(int, input().split()) \r\nres = (m * n) // 2\r\nprint(res)", "a, b= map(int, input().split())\nprint(a*b // 2)\n\n\n\n'''Au soleil, sous la pluie \nA midi ou a minuit \nIl y a tout c'que vous voulez\nAux Champs-Elysees '''\n \t\t \t\t\t \t \t \t \t", "M,N=map(int,input().split())\r\nmax=(M*N)//2\r\nprint(max)\r\n", "M, N =map(int,input().split())\r\nif 1<=M<=N<=16:\r\n print(M*N // 2)", "m,n = map(int,input().split())\r\narea = m*n\r\ndom = area//2\r\nprint(dom)", "number = input()\r\n\r\nnumbers = number.split()\r\n\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\n\r\nc = a*b\r\n\r\nmodcheck = c % 2\r\n\r\nif modcheck == 0:\r\n print(int(c/2))\r\nelse:\r\n print(int((c-1)/2))", "n,m=map(int,input().split())\r\nx=n*m//2\r\nprint(x)", "m,n=map(int,input().split())\r\nif m%2==0 or n%2==0: print(int(m*n/2))\r\nelse: print(int((m*n-1)/2))\r\n", "q = input()\r\nn, k = q.split(' ')\r\nk = int(k)\r\nn = int(n)\r\n\r\nopen = n *k\r\n\r\nprint(int(open/2))", "a,b=map(int,input().split())\nprint(a*b//2)\n#n\n \t\t\t\t\t \t \t \t\t \t \t\t\t\t \t \t \t\t\t\t", "M,N=map(int,input().split())\nmulti=M*N\nx=2*1\ndomino=multi // x\nprint(domino)\n \t\t \t \t\t \t \t \t\t \t \t\t", "list1=list(map(int,input().split()))\r\nprint((list1[0]*list1[1])//2)", "n,m=map(int,input().split())\r\nprint(int(n*m/2))", "l, b = input().split()\r\nlength = int(l)\r\nbreadth = int(b)\r\nnumber_of_squares = length*breadth\r\nprint(number_of_squares // 2)", "M,N=input().split(\" \")\r\nprint(int((int(M))*(int(N)/2)))", "boat = input().split( )\r\nif (int(boat[0])*int(boat[1]))%2==0:\r\n about = ((int(boat[0])*int(boat[1]))//2)\r\n print(about)\r\nelse:\r\n about = (int((int(boat[0])*int(boat[1])-1)//2))\r\n print(about)", "m,n=input().split()\r\nm,n=int(m),int(n)\r\ntotal=m*n\r\ndi=2\r\nvalue=total//di\r\n\r\nprint(value)", "m,n=list(map(int,input().split()))\r\np=m*n\r\nres=p//2\r\nprint(res)", "m, n = input().split()\r\nm=int(m)\r\nn=int(n)\r\nif(m*n%2==0):\r\n print(int((m*n)/2))\r\n exit(0)\r\nprint(int((m*n-1)/2))\r\n", "tab_lero=input().split() # Permite al usuario ingresar valor; .split() permite ingresar varios valores al usuario (al dejarlo en blanco el separador es un espacio)\r\nM,N = int(tab_lero[0]), int(tab_lero[1]) # Se define las variables que se ingresan en el input por su posicion \r\n1<=M<=N<=16 # Restriccion dada por el ejercicio\r\nprint(M*N//(2)) ", "a,b=map(int,input().split())\r\nt=int(a*b/2)\r\nprint(t)", "import math\r\nmn = [int(x) for x in input().split()]\r\nb = (mn[0]*mn[1])*.5\r\nprint(int(b-math.modf(b)[0]))\r\n", "# Read the board sizes\r\nm, n = map(int, input().split())\r\n\r\n# Calculate the maximum number of dominoes that can be placed\r\nnum_dominoes = m * n // 2\r\n\r\n# Print the result\r\nprint(num_dominoes)\r\n", "\r\ni = input()\r\nn = int(i[:i.find(\" \")])\r\nk = int(i[i.find(\" \"):])\r\n\r\nprint((n * k) // 2)", "from cgitb import reset\r\nimport math\r\n\r\ndef fun(x):\r\n return int(x)\r\n\r\nm, n = map(fun,input().split(\" \"))\r\n\r\nresult = (m * n)/2\r\nprint(math.floor(result))", "M,N=map(int, input().split())\r\nans=int((M*N)/2)\r\nprint(ans)", "import math\r\n\r\nm, n = input(\"\").split()\r\n\r\nrow = []\r\nfor i in range(int(m)):\r\n column = []\r\n for j in range(int(n)):\r\n column.append(0)\r\n row.append(column)\r\nnumbers = sum(map(len, row))\r\nprint(math.floor(numbers / 2))", "a,b=map(int,input().split())\r\ns=a*b\r\nif s%2==0:\r\n print(int(s/2))\r\nelse:\r\n print(int(s/2))", "m,n = input().split(\" \")\r\nm = int(m)\r\nn = int(n)\r\nd = 2\r\nmn = m*n\r\nprint(mn//2)", "polja = input()\r\npolja = polja.split(\" \")\r\nm,n = int(polja[0]), int(polja[1])\r\n\r\nprint(m*n//2)", "m,n=map(int,input().split())\r\na=m*n//2\r\nprint(a)", "line = input()\na, b = line.split(' ')\nprint(int(a)*int(b)//2)\nprint(\"\\n\")\n \t \t \t \t \t\t\t\t\t \t \t\t", "x=0\r\ndata=input().split(\" \")\r\nm = int(data[0])\r\nn = int(data[1])\r\nx= m * n / 2\r\nx=int(x)\r\nprint(x)", "n = input().split()\r\nprint((int(n[0])*int(n[1]))//2)", "h,w=map(int,input().split())\r\nprint(int((h*w)/2))", "x,y=map(int,input().split())\r\nif x==1 and y==1:\r\n print(0)\r\nelse:\r\n print(int(x*y)//2)", "a = input()\r\nb =int(a.split()[0]) \r\nc = int(a.split()[1])\r\nprint((b*c)//2)", "m , n = map(int,input().split())\r\n\r\ndomena = (m * n)//2\r\nprint(domena)", "M,N = map(int,input().split())\r\nres = int((M*N)/2)\r\nprint(res)", "m, n = map(int, input().split())\r\ndosk = m * n\r\nif dosk % 2 == 0:\r\n print(round(dosk / 2))\r\nelse:\r\n print(round(dosk // 2))", "from math import *\r\nM,N=list(map(int, input().split()))\r\nsizeDomino=int(M)*int(N)\r\nresult=sizeDomino/2\r\nprint(floor(result))", "m,n =(int(x) for x in input().split())\r\nprint (int(m * n / 2))\r\n\r\n", "inp = input().split(' ')\r\n(n, m) = (int(inp[0]), int(inp[1]))\r\nprint(n*m // 2)\r\n", "\r\nm,n = map(float,input().split())\r\nprint(int((m*n)/2))", "m,n = [int(x) for x in input().split()]\r\nw = m*n\r\nif w/2 == int(w/2):\r\n print(int(w/2))\r\nelse:\r\n print(int((w-1)/2))", "M,N=[int(x) for x in input().split()]\r\nprint(M*N//2)", "m=input()\r\nM=m.split()\r\nM=list(map(int,M))\r\na=M[0]*M[1]\r\nr=a//2\r\nprint(int(r))", "o, p =map(int, input().split())\r\n\r\nprint(int(o*p/2))", "n , m = map(int,input().split())\r\ns = n*m\r\nprint(s//2)", "# https://codeforces.com/problemset/problem/50/A\r\n\r\nm, n = map(int, input().split())\r\nprint(m * n // 2)\r\n", "m,n=input().split(\" \")\r\nm=int(m)\r\nn=int(n)\r\narea=m*n\r\nnum=area//2\r\nprint(num)\r\n", "n,m=map(int,(input().split()))\r\nb=int(n*m)\r\ntotal=int(b/2)\r\nprint(total)\r\n\r\n", "i1, i2 = input().split()\r\n\r\nsum = int(i1)*int(i2) / 2\r\n\r\nprint(int(sum))", "# n, k = map(int, input().split())\r\n# lst = [int(i) for i in input().split()]\r\n# counter = 0\r\n# key = lst[k - 1]\r\n# mas = []\r\n# for el in lst:\r\n# if el >= key and el > 0:\r\n# counter += 1\r\n# print(counter)\r\n\r\n\r\na, b = map(int, input().split())\r\nprint((a * b) // 2)\r\n", "dlina, shirina = map(int, input().split())\r\nprint((dlina * shirina)//2)", "u_input = input().split()\r\nn = int(u_input[0])\r\nm = int(u_input[1])\r\ns = m * n\r\n\r\nif s == 1:\r\n print(0)\r\nelif s % 2 == 1:\r\n print(int((s - 1) / 2))\r\nelse:\r\n print(int(s / 2))", "n, m = input().split()\r\nprint((int(n) * int(m)) // 2)", "import math\n\nss = input()\ns = ss.split()\ni1 = int(s[0])\ni2 = int(s[1])\nif((i1%2==0)or(i2%2==0)):\n if(i1%2==0):\n n = i1/2\n print(int(n*i2))\n else:\n n=i2/2\n print(int(n*i1))\nelse:\n print(int((i1*i2 - 1)/2))\n\n", "a , b = map(int, input ().split())\r\nprint(int((a*b) / 2))", "M,N = map(int,input().split())\r\nprint(int(M*N*0.5))\r\n", "m,n=input().split(\" \")\r\nm,n=int(m),int(n)\r\nsquare = m*n\r\nif square%2==0:\r\n result=square/2\r\nelse:\r\n result=(square-1)/2\r\nprint(int(result))\r\n", "M, N = input().split()\r\n# M, N = [int(x) for x in input().split()]\r\nM, N = int(M), int(N)\r\n\r\narea = M * N\r\n\r\nnumDominos = area // 2\r\nprint(numDominos)\r\n", "l = input().split()\r\nm = int(l[0])\r\nn = int(l[1])\r\nz = (m * n) // 2\r\nprint(z)", "n,m = map(int,input().split())\r\nif n % 2 == 0 :\r\n print(int(n/2)*m)\r\nelse:\r\n print((int(n/2))*m+int(m/2))", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nprint(int(a*b/2))", "n , m = input().split()\r\nni = int(n)\r\nmi = int(m)\r\ntotal = 0\r\nwhile(ni > 1 and mi > 0):\r\n total += mi\r\n ni -= 2\r\nwhile(mi > 1 and ni>0) :\r\n total += ni\r\n mi -= 2\r\n\r\nprint(total)", "m,k=map(int,input().split())\r\nprint(m*k//2)", "if __name__ == '__main__':\r\n m, n = input().split()\r\n print(divmod(int(m) * int(n), 2)[0])\r\n", "m,n = map(int,input().split())\r\n\r\nsmi = m * n\r\nif m == 1 and n == 1:\r\n print(0)\r\n \r\nelse:\r\n print(smi // 2)", "n, m = map(int,input().split())\r\n\r\nres = n*m//2\r\nprint(res)", "# Code_11 Status: Still Working\r\n\r\nn, m = map(int, input().split())\r\n\r\nprint((n * m) // 2)\r\n", "something = list(map(int,input().split()))\r\nres = something[0]*something[1]/2\r\nres = int(res)\r\nprint(res)\r\n", "nums = input().strip().split()\r\nnum1, num2 = int(nums[0]), int(nums[1])\r\narea = num1 * num2\r\nprint(int((area - (area%2))/2))", "a,b=map(int,input().split())\r\nt=a*b\r\nprint(t//2)", "n=input().replace(\" \",\"*\")\r\nprint(eval(n)//2)", "m, n = map(int, input().split())\r\np = m * n\r\n\r\nprint(p // 2)\r\n", "x, y = [int(x) for x in input().split()]\r\nc=x*y\r\nd=c//2\r\nprint(d)", "def domino_pilling(m,n):\r\n domino=2*1\r\n board=m*n\r\n result=board//domino\r\n return result \r\n\r\n\r\ninputs = list(map(int, input().split()))\r\nprint(domino_pilling(inputs[0],inputs[1]))\r\n\r\n", "M, N = input().split()\r\nM = int(M)\r\nN = int(N)\r\nif M % 2 != 0 and N % 2 != 0:\r\n print(int(M*(N-1)/2 + (M-1)/2))\r\nelse:\r\n print(int(M*N/2))", "\r\nm, n = input().split()\r\n\r\narea_board = int(m) * int(n)\r\ndominos_inserted = int(area_board/2)\r\n\r\nprint(dominos_inserted)", "a,b=map(int,input().split())\r\nif(a==1 and b==1):\r\n print(0)\r\nelse:\r\n print(int(a*b)//2)", "i = lambda: map(int, input().split());\r\nn, m = i();\r\nprint(int((m*n)/2))", "m,n = [int(x) for x in input().split()]\r\nprint(f'{int((m*n)/2)}')", "m, n = map(int, input().split())\r\nnum_squares = m * n\r\nif num_squares % 2 == 0:\r\n max_dominoes = num_squares // 2 # // used for returning integer value not float \r\nelse:\r\n max_dominoes = (num_squares - 1) // 2\r\nprint(max_dominoes)\r\n", "m,n =map(int,input().split())\r\nif m%2!=0 and n%2!=0:\r\n print((m*n)//2)\r\nif m%2==0 and n%2==0:\r\n print((m*n)//2)\r\nif m%2==0 and n%2!=0:\r\n print((m*n)//2)\r\nif m%2!=0 and n%2==0:\r\n print((m*n)//2)", "n,m=map(int,input().split())\r\na=n*m\r\nprint(a//2)\r\n", "ch=input()\r\nl=[]\r\nl.append(ch.split())\r\nl1=l[0]\r\np=int(l1[1])\r\nq=int(l1[0])\r\ns=0\r\nif p%2==0:\r\n s= s+ (p//2)*q\r\nelse:\r\n s= s+ (p//2)*q+ q//2\r\nprint(s)\r\n ", "dominos_and_space = input().split()\r\nprint(int(dominos_and_space[1]) * int(dominos_and_space[0]) // 2)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"Domino pile\"\"\"\nM, N = map(int, input().split())\n\ndef max_dominos(base, height):\n if base % 2 != 0 and height % 2 != 0:\n return ((base * height + 1) / 2) - 1\n return base * height / 2\n\nprint(int(max_dominos(M, N)))", "x = input()\r\nn1, m1 = x.split()\r\nn = int(n1)\r\nm = int(m1)\r\nres = n*m\r\ncount = res//2\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 23 10:40:57 2023\r\n\r\n@author: 87540\r\n\"\"\"\r\n\r\nm,n=map(int,input().split())\r\nprint(2*(m//2)*(n//2)+(m*n-4*(m//2)*(n//2))//2)", "# -*- coding: utf-8 -*-\r\na,b=input().split()\r\nA,B=int(a),int(b)\r\nif A%2==0 or B%2==0:\r\n print(int(A*B/2))\r\nelse:\r\n print(int(B*(A-1)/2+(B-1)/2))", "size = list(map(int, input().split()))\r\nx = (size[0] * size[1]) // 2\r\nprint(x)", "m,n = input().split(\" \")\r\nm,n=int(m),int(n)\r\nif 1<=m<=n<=16:\r\n print((m*n)//2)", "x, y = map(int, input().split())\r\nboard_size = x*y\r\nnum_dominoes = board_size // 2\r\nprint(num_dominoes)", "solve = input().split()\r\nm = int(solve[0])\r\nn = int(solve[1])\r\noutputs = (m * n) // (2*1)\r\nprint(outputs)", "a,b =map (int , input() .split() )\r\nprint(a *b // 2) ", "x,y=map(int,input().split())\r\nprint(int(x*y/2))", "x, y = input().split()\nsize = int(x) * int(y)\nif size % 2 == 0:\n print(int((size/2)))\nelse:\n print(int((size-1)/2))\n", "\r\n\r\nan,ba=map(int,input().split())\r\ntol=an*ba\r\nprint(tol//2)", "m, n = [int(x) for x in input().strip().split()]\r\nfull = m // 2 * n\r\nleft = m % 2 * (n // 2)\r\nprint(full + left)\r\n", "m,n=map(int,input().strip().split())\r\narea=m*n\r\nprint(area//2)\r\n", "M, N = map(int, input().split())\np = M * N\nif p % 2 == 0:\n p = p//2\nelse:\n p = (p - 1)//2\nprint(p)", "a, b =map(int,input().split())\r\nanswer=a*b//2\r\nprint(answer)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Oct 3 11:22:53 2021\n\n@author: lijialin\n\"\"\"\n\nM,N=map(int,input().split())\nif M%2==0 and N%2==0 or M%2==0 and N%2==1:\n print(M//2*N)\nelif M%2==1 and N%2==1:\n print((M-1)//2*N+(N-1)//2)\nelse:\n print((M-1)//2*N+N//2)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nsize = n*m\r\nprint(size //2)", "import math\r\na = list(map(int, input().split(\" \")))\r\nprint(math.floor(a[0]*a[1]/2))", "i,j = map(int,input().split())\ntotal = int(i*j/2)\nprint(total)\n\t\t\t\t\t \t\t \t \t \t\t\t\t \t\t\t \t\t", "def dominoReq(m, n):\r\n x = n\r\n y = m//2\r\n req = x*y\r\n if(m%2 != 0):\r\n req += n//2\r\n return req\r\n\r\ninp = list(map(int, input().split()))\r\nprint(dominoReq(inp[0], inp[1]))", "#To find max no of tiles(2x1) from inputed area of board\r\nm,n = map(int, input().split())\r\nif m <= n and 1 <= m <= 16 and 1<= n <=16 :\r\n print ((m*n)//2)", "x,y = input().split()\r\nx,y = int(x),int(y)\r\nprint((x*y)//2)", "# https://codeforces.com/problemset/problem/50/A\r\n\r\nfrom math import floor\r\n\r\nm, n = [int(x) for x in input().split(\" \")]\r\nprint(floor(m * n / 2))\r\n", "def dominoes(m,n):\n mn=m*n\n if mn%2==0:\n print(mn//2)\n else:\n print(((m-1)*n//2)+((n-1)//2))\n \na=input()\nb=a.split()\nd1, d2=int(b[0]), int(b[1])\ndominoes(d1,d2) \n", "a,b = map(int , input().split())\r\nprint((a*b)//2)", "n = input().split()\r\narea = int(n[0]) * int(n[1])\r\nprint(area//2)", "m,n = list(map(int,input().split()))\r\nif 1<=m and m<=n and n<=16:\r\n print((m*n)//2)", "m, n = map(int, input().split())\r\nS = m * n\r\nif(S % 2 == 0):\r\n print(S // 2)\r\nelse:\r\n print(S // 2)", "m,n=map(int,input().split())\r\np=m*n\r\nans=p//2\r\nprint(ans)", "num = [int(i) for i in input().split(\" \")]\r\nprint((num[0] * num[1]) // 2)", "a,k=map(int,input().split())\r\nr=a*k\r\nprint(r//2)", "vec=[int(x) for x in input().split()]\r\n\r\na,b=vec[0],vec[1]\r\nif a%2==0 or b%2==0:\r\n kres=a*b/2\r\nelse:\r\n p1=int(a/2)*b\r\n p2=int(b/2)\r\n kres= p1+p2\r\nprint(int(kres))", "nums = input()\r\nnumLst = nums.split(\" \")\r\nm = int(numLst[0])\r\nn = int(numLst[1])\r\nsize = m*n\r\ndomNum = size//2\r\nprint(domNum)", "w = input()\r\nl,z = w.split(' ')\r\ns = int(l)*int(z)\r\nz = s/2\r\nprint(int(z))\r\n", "m,n = map(int,input().split())\r\nd = 0\r\nif n%2==0:\r\n d = n//2\r\n d*=m\r\nelif m%2==0:\r\n d = m//2\r\n d*=n\r\nelse:\r\n d = (n-1)//2\r\n d*=m\r\n d+=(m-1)//2\r\nprint(d)", "str = input().split()\r\nM = int(str[0])\r\nN = int(str[1])\r\n\r\nr = M * N / 2\r\n\r\nprint(int(r))", "k, m = map(int, input().split())\r\nprint(k*m//2)", "n,m = map(int,input().split())\r\n\r\nprint(int((n*m)/2))", "import math\r\nm,n=map(int,input().split())\r\na=math.floor(m*n/2)\r\nprint(a)", "m,n=map(int,input().split())\r\nans=0\r\nif m*n%2==0:\r\n ans=m*n/2\r\nelse :\r\n ans=(m-1)*n/2+n//2\r\nprint(int(ans))", "l = list(map(int,input().split()))\r\na = l[0]*l[1]\r\nprint(a//2)", "n,m=input().split()\nn=int(n)\nm=int(m)\nif (n*m)%2!=0:\n print(int(((n*m-1)/2))) \nelse:\n print(int(n*m/2))\n \t \t\t \t\t\t\t\t\t\t\t \t \t \t \t\t\t \t\t", "a, b = map(int, input().split())\nt = int(a*b / 2)\nprint(t)\n\n \t\t\t\t\t \t\t\t\t\t \t\t\t \t \t \t\t \t \t\t", "if __name__ == '__main__' :\r\n m,n = [int(i) for i in input().split()]\r\n print ((m*n)//2)", "# https://codeforces.com/problemset/problem/50/A\r\n# Code Forces Easy Problem\r\n\r\nm , n = map(int, input().split())\r\nprint((m*n)//2)\r\n", "m,n = input().split()\nm = int(m)\nn = int(n)\nc = (m*n)/2\nc = int(c)\nprint(c)\n \t\t\t \t\t \t\t \t \t\t\t \t\t\t \t\t\t\t\t", "a,b = [int(i) for i in input().strip().split()]\r\nprint((a*b)//2)\r\n", "n = input()\na = [int(i) for i in n.split(' ')]\n\nm = a[0]*a[1]\n\nprint(m//2)", "m,n = map(int,input().split())\r\nr = int(m*n/2)\r\nprint(r)", "import math\r\nlist1 = list(input(\" \").split())\r\nm = (list1[0])\r\nn = (list1[1])\r\nf = ((int(m) * int(n)) / 2)\r\nx = math.trunc(f)\r\nprint(x)", "m = input().split()\r\nanswer = (int(m[0])*int(m[1]))/2\r\nprint(int(answer))", "import math\r\nprint(int(math.prod(list(map(int, input().split())))/2))", "f=list(map(int,input().split()))\r\nif f[0]%2==0:\r\n u=int(f[0]/2)\r\n a=u*f[1]\r\n print(a)\r\nelse:\r\n u=int(f[0]/2)\r\n a=u*f[1]\r\n z=int(f[1]/2)\r\n a=a+z\r\n print(a)", "P, N = map(int, input().split()) \n\n\nmax_dominoes = (P * N) // 2\n\nprint(max_dominoes)\n#####\n \t\t\t\t\t\t\t \t \t \t \t\t\t \t \t \t\t\t", "import math\n\ninp = input().split()\nprint(math.floor((int(inp[0])*int(inp[1]))/2))", "m,n = map(int,input().split())\r\na = m*n\r\nif(a/2 == 0):\r\n\tprint(a/2)\r\nelse:\r\n\tprint(a//2)\r\n ", "a,b=map(int,input().split())\nc=a*b/2\nprint(int(c))\n\n\n\t\t\t\t\t\t \t \t\t\t\t \t\t \t\t\t \t", "m, n = map(int, input().split())\r\noutput = (m*n) // 2\r\nprint(output)", "area = str(input()).split(\" \")\r\n\r\nfor x in range(len(area)):\r\n area[x] = int(area[x])\r\n\r\n[m, n] = area\r\n\r\narea = m*n\r\n\r\nnoOfDominoes = 0\r\n\r\nif area % 2 == 0:\r\n noOfDominoes = area//2\r\nelse:\r\n area -=1\r\n noOfDominoes = area//2\r\n \r\nprint(noOfDominoes)", "ab = list(map(int, input().split()))\r\ns = ab[0] * ab[1]\r\nprint(s // 2)", "n, m = map(int, input().split())\r\n\r\ntotal_sq = n * m\r\n\r\nprint(total_sq//2)", "m,n=map(int,input().split())\na=m*n\nb=a//2\nprint(b)#592\n \t\t \t \t \t \t\t \t \t\t \t\t \t", "m,n=map(int,input().split())\r\ncount=(m*n)//2\r\nprint(count)\r\n", "t = input()\r\nl = list(map(int , t.split(\" \")))\r\nar_dom = 2\r\nar_til = l[0]*l[1]\r\nprint(int(ar_til/ar_dom))", "a,b = list(map(int,input().split()))\nprint((a*b)//2)\n\t\t\t \t \t\t \t\t\t \t", "M, N = [int(s) for s in input().split()] #enter board sizes in squares\r\n\r\nsize = M * N\r\ndomino = 2*1 #domino's standard squares\r\nd = 1\r\n\r\nwhile d*domino < size:\r\n d += 1\r\nif size % 2 != 0:\r\n d -= 1\r\n\r\nprint(d)", "m, n = [int(i) for i in input().split()]\n\ndominos = (m*n)//2\n\nprint(dominos)", "# -*- coding: utf-8 -*-\n\"\"\"domino piling\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1qynsGFzid_Dolj39Nx3eXyziFPD89re9\n\"\"\"\n\nm,n = map(int, input().split())\nprint(m*n//2)", "import math\r\ns,d=input().split()\r\ns=int(s)\r\nd=int(d)\r\nj=s*d/2\r\nc=math.floor(j)\r\nprint(c)", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nprint((m*n)//2)\r\n\r\n", "m, n = map(int, input().split())\r\nr = (n//2)*m\r\nif n%2 != 0:\r\n r += m//2\r\nprint(r)", "A = input()\r\nX = A.split(\" \")\r\n\r\ndef atLeastOneEven(X):\r\n answer = int(int(X[0]) * int(X[1]) / 2)\r\n print(str(answer))\r\n\r\ndef bothOdd(X):\r\n answer = int(int(X[0]) * int(X[1]) / 2)\r\n print(str(answer))\r\n\r\nif(int(X[0])%2 == 1 and int(X[1])%2 == 1):\r\n bothOdd(X)\r\nelse:\r\n atLeastOneEven(X)", "def solve(m, n):\n print((m * n - (m * n) % 2) // 2) \n\ndef main():\n m, n = [int(i) for i in input().split()]\n solve(m, n)\n\nif __name__ == \"__main__\":\n main()", "# def bubble_sort(arr):\r\n# def swap(i, j):\r\n# arr[i], arr[j] = arr[j], arr[i]\r\n\r\n# n = len(arr)\r\n# swapped = True\r\n \r\n# x = -1\r\n# while swapped:\r\n# swapped = False\r\n# x = x + 1\r\n# for i in range(1, n-x):\r\n# if arr[i - 1] > arr[i]:\r\n# swap(i - 1, i)\r\n# swapped = True\r\n# return arr \r\n# arr = [6, 1, 5, 2, 4, 3]\r\n# print(bubble_sort(arr))\r\n\r\n# def selection_sort(arr): \r\n# for i in range(len(arr)):\r\n# minimum = i\r\n \r\n# for j in range(i + 1, len(arr)):\r\n# # Выбор наименьшего значения\r\n# if arr[j] < arr[minimum]:\r\n# minimum = j\r\n\r\n# # Помещаем это перед отсортированным концом массива\r\n# arr[minimum], arr[i] = arr[i], arr[minimum]\r\n \r\n# return arr\r\n# arr = [6, 1, 5, 2, 4, 3]\r\n# print(selection_sort(arr))\r\n\r\n# def merge_sort(arr):\r\n# # Последнее разделение массива\r\n# if len(arr) <= 1:\r\n# return arr\r\n# mid = len(arr) // 2\r\n# # Выполняем merge_sort рекурсивно с двух сторон\r\n# left, right = merge_sort(arr[:mid]), merge_sort(arr[mid:])\r\n# \t# Объединяем стороны вместе\r\n# return merge(left, right, arr.copy())\r\n# def merge(left, right, merged):\r\n# \tleft_cursor, right_cursor = 0, 0\r\n# while left_cursor < len(left) and right_cursor < len(right):\r\n# \t# Сортируем каждый и помещаем в результат\r\n# if left[left_cursor] <= right[right_cursor]:\r\n# merged[left_cursor+right_cursor]=left[left_cursor]\r\n# left_cursor += 1\r\n# else:\r\n# merged[left_cursor + right_cursor] = right[right_cursor]\r\n# right_cursor += 1 \r\n# for left_cursor in range(left_cursor, len(left)):\r\n# merged[left_cursor + right_cursor] = left[left_cursor] \r\n# for right_cursor in range(right_cursor, len(right)):\r\n# merged[left_cursor + right_cursor] = right[right_cursor]\r\n# return merged\r\n\r\n# arr = [6, 5, 3, 1, 8, 7, 2, 4]\r\n# a = merge_sort(arr)\r\n# print(merge(a)) \r\n\r\n# def factorial(a):\r\n# \tif a == 0:\r\n# \t\treturn 1\r\n# \telse:\r\n# \t\treturn a * factorial(a - 1)\t\r\n# a = int(input())\r\n# print(factorial(a))\r\n\r\n# def find(A, n, x):\r\n# \tp = 1\r\n# \tr = n\r\n# \twhile p <= r:\r\n# \t\tq = (p + r)//2\r\n# \t\tif A[q] == x:\r\n# \t\t\treturn q + 1\r\n# \t\telif A[q] != 0 and x < a[q]:\r\n# \t\t\tr = q - 1\r\n# \t\telse:\r\n# \t\t\tr = q + 1\r\n# \treturn \"NOT-FOUND\"\t\t\t\r\n# A = []\r\n# a = input().split()\r\n# x = int(input())\r\n# for i in range(len(a)):\r\n# \ta[i] = int(a[i])\r\n# \tA.append(a[i])\r\n# n = len(A)\r\n# print(find(A, n, x))\r\n\r\nn = input().split()\r\nfor i in range(len(n)):\r\n\tn[i] = int(n[i])\r\nprint(n[0] * n[1] // 2)", "l = input().split()\r\nm = int(l[0])\r\nn = int(l[1])\r\nprint(m * n // 2)", "import math\r\nn, m = [int(i) for i in input().split()]\r\n\r\nanswer = math.floor(n * m * 0.5)\r\n\r\nprint(answer)", "m,n = map(int,input().split())\r\n\r\nres = (m * n) // 2\r\n\r\nprint(res)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nmn = m*n\r\nif mn & 1:\r\n print(int((mn-1)/2))\r\nelse:\r\n print(int(mn/2))", "import math\r\nargs = input()\r\nargs = args.split(\" \")\r\nargs = [float(args[0]), float(args[1])]\r\nprint(math.floor(args[0]*args[1]*0.5))", "q = input().split()\r\nprint((int(q[0])*int(q[1]))//2)", "# Read the board sizes M and N\nM, N = map(int, input().split())\n\n# Calculate the total number of squares on the board\ntotal_squares = M * N\n\n# Calculate the maximum number of dominoes that can be placed\nmax_dominoes = total_squares // 2\n\n# Print the result\nprint(max_dominoes)\n\n \t \t\t \t\t \t \t \t\t\t \t\t\t \t \t \t\t", "a, b = input().split()\r\na, b = int(a), int(b)\r\n\r\nAreaofBoard = a*b\r\n\r\nAreaofDomino = 2\r\n\r\nif (AreaofBoard % 2 != 0):\r\n\r\n NDomino = (AreaofBoard-1)/2\r\n\r\nelse:\r\n NDomino = AreaofBoard/2\r\n\r\nprint(int(NDomino))", "n,k=map(int,input().split())\r\nn=n*k\r\nprint(n//2)", "m, n = map(int, input().split())\n\nif m % 2 == 0 or n % 2 == 0:\n print(n * m // 2)\nelse:\n print((n * (m - 1) // 2) + n // 2)\n", "def main(m, n):\r\n k = (n // 2) * m\r\n if (n //2 != n / 2): k += m // 2\r\n\r\n return k\r\n\r\nif __name__ == \"__main__\":\r\n m, n = map(int, input().split())\r\n\r\n print(main(m, n))", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\n\r\nif (a%2==1):\r\n a-=1\r\n k=(a/2)*b\r\n k+=int(b/2)\r\n print(int(k))\r\nelse:\r\n k=(a/2)*b\r\n print(int(k))", "m,n=map(int,input().split())\r\ntotal=int(m*n/2)\r\nprint(total)", "m,n=input().split()\r\nproduct=int(m)*int(n)\r\nprint(product//2)", "a,b=map(int,input().split())\nk=(a*b)//2\nprint(k)\n \t\t \t \t\t \t\t\t \t \t \t\t \t \t", "def max_dom(M,N):\r\n if M%2==0 or N%2==0:\r\n return int((M*N)/2)\r\n else:\r\n return int(((M*(N+1))/2)-(1+((M-1)/2)))\r\ndimensions=input()\r\ndimensions=dimensions.split()\r\nM,N=int(dimensions[0]),int(dimensions[1])\r\nprint(max_dom(M,N))", "import math\r\ninput = input().split(\" \")\r\nprint(int(math.floor(int(input[0]) * int(input[1])) / 2))", "n, m=map(int,input().split())\r\na=m*n//2\r\nprint(a)", "M , N = map(int, input().split())\r\n\r\n\r\nx = M * N\r\n\r\ny = x // 2\r\n\r\nprint(y)", "a,b = map(int,input().split());\r\nar = a*b\r\nprint(ar//2)\r\n ", "import sys\r\n\r\ndef solution(m:int, n:int):\r\n return int(((m*n) - (m*n)%2)/2)\r\n\r\ndef main():\r\n M, N = sys.stdin.readline().split(\" \")\r\n M, N = int(M), int(N)\r\n print(solution(M,N))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "input_list = input().split(\" \")\r\nm, n = map(int , input_list)\r\nprint((m * n) // 2)", "x,y = list(map(int, input().split()))\r\nprint(int((x*y)/2))", "m,n=[int(num)for num in input().split()]\r\nmulti=m*n\r\nif multi%2==0:\r\n print(int(multi/2))\r\nelse:\r\n multi-=1\r\n print(int(multi/2))", "inp = input().split()\r\nx = int(inp[0])\r\ny = int(inp[1])\r\nif x % 2 == 0:\r\n print(y * (x // 2))\r\nelse:\r\n print((y * (x // 2)) + (y // 2))", "a,b=(map(int,input().split()))\r\nm=(a*b)//2\r\nprint(m)", "n,m = map(int,input().split())\r\nimport math\r\n\r\nk = m*n\r\nS = k//2\r\n\r\nprint(S)", "n = str(input())\r\nxy = n.split()\r\nt = int(xy[0]) * int(xy[1])\r\nif t%2==0:\r\n print(t//2)\r\nelse:\r\n print((t-1)//2)", "M,N=input().split()\r\nM=int(M)\r\nN=int(N)\r\n\r\nr=M*N \r\n\r\nprint(int(r/2))", "g,p=map(int,input().split())\r\nprint((g*p)//(1+1))", "# Domino squares\r\nM,N=input().split()\r\nM=int(M)\r\nN=int(N)\r\nprint(int(M*N/2))", "E, F = map(int, input().split())\n\nmax_dominoes = (E * F) // 2\n\nprint(max_dominoes)\n\n \t \t \t \t\t\t\t \t\t \t \t \t\t\t", "x = input().split(\" \")\r\nn = eval(x[0]) * eval(x[1])\r\nif( n % 2 != 0):\r\n print(int((n-1)/2))\r\nelse:\r\n print(int(n/2))", "a,b = map(int,input().split())\r\nM=a*b\r\nN=2*1\r\nprint(M//N)", "n,m=list(map(int,input().split()))\r\narea=n*m\r\ncount=area/2\r\nprint(int(count))", "import math\nx=list(map(int, input().split()))\nm=x[0]\nn=x[1]\nq= m*n\nz=q/2\nv= math.floor(z)\nprint(v)", "import math\nm,n = map(int,input().split())\nif(m==1 and n==1):\n print(0)\nelse:\n print(int(m*n)//2)", "m,n=map(int,input().split())\r\nk=int((m*n)/2)\r\nprint(k)", "n,k =[int(i) for i in input().split()]\r\nprint(n*k//2)", "def main():\r\n m, n = map(int, input().split())\r\n\r\n if m % 2 >= 0:\r\n d = (m // 2) * n\r\n \r\n if m % 2 > 0:\r\n d += (n // 2)\r\n print(d)\r\n elif n % 2 >= 0:\r\n d = m * (n // 2)\r\n \r\n if n % 2 > 0:\r\n d += (m // 2)\r\n print(d)\r\n else:\r\n print(0)\r\n\r\nif __name__ == '__main__':\r\n main()", "m,n = input().split()\nm,n=int(m),int(n)\nprint((m*n)//2)\n", "l, w = list(map(int, input().split()))\r\n\r\narea = l*w\r\ndominos = 0\r\nwhile 1:\r\n if area <= 1:\r\n break\r\n area = area - 2\r\n dominos = dominos+1\r\nprint(dominos)\r\n", "a,b=map(int,input().split())\r\nif a>=1 and b<=16:\r\n print((a*b)//2)", "info = input().split()\narea = int(info[0]) * int(info[1])\nprint(area // 2)", "l = input().split(' ')\r\nn = int(l[0])\r\nk = int(l[1])\r\nprint(int(n*k/2))\r\n", "from functools import reduce\r\nfrom operator import mul\r\nimport math\r\nprint(math.floor(reduce(mul, list(map(int, input().split())), 1)/2))", "nk=input().split(\" \")\r\nn=int(nk[0])\r\nk=int(nk[1])\r\nar=n*k\r\nc=2\r\nprint(ar//c)", "m,n=map(int,input().split())\r\nif (1<=n<=16 and 1<=m<=16 and m<=n):\r\n k=n*m\r\n s=k//2\r\n print(s)\r\n", "a = input()\r\na = a.split()\r\nb = int(a[0]) * int(a[1])\r\nprint(int(b//2))", "x = input()\r\nsize = []\r\nsize.append(x)\r\nsize = x.split(\" \")\r\nsize = [int(i) for i in size]\r\nprint(int(size[0] * size [1] / 2))", "a,b=map(int,input().split())\nprint(a*b//2)#abc\n \t\t \t\t \t \t\t\t\t \t\t \t \t\t\t \t", "import math\r\nn,m=map(int,input().split())\r\na1=m*n\r\na=math.floor(a1/2)\r\nprint(a)", "m,n = map(int, input().split())\r\narea = n*m\r\nans = area // 2\r\nprint(ans)\r\n\r\n", "m,n =list(map(int,input().split()))\r\n\r\nres = m*n\r\n\r\nprint(res // 2)", "l1=list(map(int,input(\"\").split(\" \")))\r\nb=l1[0]*l1[1]\r\nif b%2==0:\r\n print(int((b/2)))\r\nelse:\r\n b-=1\r\n print(int(b/2))\r\n", "line = input().split(\" \")\r\nm = int(max(line))\r\nn = int(min(line))\r\n\r\ntiles = 0\r\nif(m % 2 == 0):\r\n tiles = int(m / 2) * n\r\nelif(n % 2 == 0):\r\n tiles = int(n / 2) * m\r\nelse:\r\n tiles = int(m / 2) * n + int(n / 2)\r\n\r\nprint(tiles)\r\n", "\r\nimport string\r\n\r\nm,n = map(int, input().split())\r\n\r\n\r\narea = m*n\r\n\r\nif area%2 == 0:\r\n number = int(area/2)\r\nelse :\r\n number = int((area-1)/2)\r\n\r\n\r\nprint(number)\r\n\r\n", "m, n = map(int, input().split())\n\ndef domino(m, n):\n A = m * n\n if A % 2 == 0:\n print(A // 2)\n elif A % 2 != 0:\n print((A - 1) // 2)\n\ndomino(m, n)\n \t \t\t \t\t\t\t\t\t\t\t\t\t\t \t \t\t\t\t\t\t \t", "m, n = map(int, input().split())\r\nif (m * n) % 2 == 0:\r\n print(int((m * n) / 2))\r\nelse:\r\n print(int(((m * n)-1) / 2))\r\n", "x,y=map(int,input().split())\nmulti=x*y \nz=2*1 \ndomino=multi//z\nprint(domino)\n \t\t\t \t \t\t \t\t\t\t \t \t", "m,n = input().split()\nm = int(m)\nn = int(n)\nans= (m*n/2)\nans = int(ans)\nprint(ans)\n \t \t\t\t \t \t \t \t\t\t \t\t\t \t\t\t\t", "N, H = map(int, input().split())\r\n \r\nD = (N * H) // 2\r\n \r\nprint(D)", "m , n = map(int, input().split())\r\narea = m * n\r\nif (m % 2 == 0) or (n % 2 == 0):\r\n max = (m*n)//2\r\nelse:\r\n max = (m*n - 1)//2\r\n\r\nprint(max)", "c, n = map(int, input().split())\r\ntotal = int(c*n / 2)\r\nprint(total)", "rows, columns = input().split()\nnum_of_squares = int(rows) * int(columns)\ndominos = num_of_squares // 2\nprint(dominos)", "a,x=input().split()\r\nm=(int(a)*int(x))//2\r\nprint(m)", "a,b = map(int, input().split(\" \"))\r\n\r\nmax_hox = (a*b)//2\r\n\r\nprint(max_hox)", "m,n=map(int,input().split())\r\nmd=(m*n)//2\r\nprint(md)", "m,n=map(int,input().split())\nans=m*n\nif ans%2==0:\n print(int(ans/2))\nelse:\n print(int((ans/2)))\n\t\t\t\t \t\t\t\t\t\t\t\t \t \t \t\t \t\t\t\t \t\t\t", "m, n = map(int,input().split())\ncounter = 0\nfor i in range(n):\n for j in range(2,m+1,2):\n counter += 1\nif m%2==1:\n for i in range (2,n+1,2):\n counter += 1\nprint(counter)", "n,m = map(int,input().split())\r\nsum = 0\r\nx = n*m\r\nsum = x /2\r\nprint(int(sum))", "def domino(x,y):\r\n return (x*y)//2\r\n\r\n\r\nuser_input = input()\r\nwidth_and_height = user_input.split(\" \")\r\nx=int(width_and_height[0])\r\ny=int(width_and_height[1])\r\n\r\nprint(domino(x,y))\r\n", "sizes = input().split()\r\nn = int(sizes[0])\r\nm = int(sizes[1])\r\nprint(m*n//2)", "x,y = map(int, input().split())\r\nprint(int((x*y - ((x*y)%2))/2))\r\n", "import sys\r\nfrom math import floor\r\ninput = sys.stdin.readlines\r\n\r\nlines = input()\r\nparsed_input =[line[:-1].split(\" \") for line in lines]\r\n\r\nsquares = int(parsed_input[0][0]) * int(parsed_input[0][1])\r\n\r\nprint(floor(squares/2))", "m,n=map(int,input().split())\na=m*n\nprint(a//2)\n#fghjk\n \t\t\t\t\t\t \t \t\t\t\t \t\t \t \t \t", "a,b = map(int, input().split());\r\nkox = int((a * b) / 2);\r\nprint(kox);", "x,y=map(int,input().split())\r\nprint(int((x*y)/2))", "n ,t= map(int,input().split())\r\ns=int((n*t) / 2)\r\nprint(s)", "m,n=map(int,input().split())\r\nd=(int (m*n)//2)\r\nprint (d)", "m,n=map(int,input().split())\r\nif m%2: n,m=m,n\r\nprint(m//2*n+n//2*(m%2>0))\r\n", "first_num, second_num = map(int, input().split(\" \"))\r\nprint((first_num * second_num) // 2)", "a1=input()\r\na2=a1.split(\" \")\r\nb=int(a2[0])*int(a2[1])\r\nc=b//2\r\nprint(c)", "def check(n,m):\r\n s=(n*m)/2\r\n return int(s)\r\nn,m=map(int,input().split())\r\nprint(check(n,m))", "def sum(a, b):\r\n return (a + b)\r\n\r\ns = str(input())\r\ns = s.split(\" \")\r\n\r\na = int(s[0])\r\nb = int(s[1])\r\nc = 0\r\ngg = a*b\r\nwhile gg-1>=1 :\r\n gg=gg-2\r\n c=c+1\r\nprint(c)", "m,n = list(map(int,input().split()))\r\nmax_domino = m*n//2\r\nprint(max_domino)\r\n", "M,N=[int(x) for x in input().split()]\r\nif M%2==0:\r\n print(M//2*N)\r\nelif N%2==0:\r\n print(M*N//2)\r\nelse:\r\n print(M//2*N+N//2)", "s = input()\r\ns = s.split()\r\nq = s[0]\r\nr = s[1]\r\nq, r = int(q), int(r)\r\nm = []\r\nfor n in range(0, 10000):\r\n if n * 2 <= (q * r):\r\n m.append(n)\r\nprint(max(m))", "m, n = input().split()\r\nm=int(m)\r\nn=int(n)\r\nprint((m*n)//2)", "first_line = [int(i) for i in input().split(' ')]\r\nn, m = first_line\r\n\r\nprint(n*m//2)", "if __name__ == \"__main__\":\r\n m, n = map(int, input().split())\r\n calculate = int((m * n) / 2)\r\n \r\n print(calculate)\r\n", "print((lambda list_2str: int(list_2str[0])*int(list_2str[1]))(input().split())//2)", "m,n = map(int, input().split())\r\n\r\nres = (m*n)/2 ;\r\nres = int(res) ;\r\n\r\nprint(res) ;", "import math\nl, w = map(int, input().split())\n\nprint(math.floor((l*w)/2))", "M,N = input().split()\r\nM = int(M)\r\nN = int(N)\r\nproduct = M*N\r\nprint (product//2)\r\n", "n,x=list(map(int,input().split()))\r\nres=(n*x)//2\r\nprint(res)", "m,n = map(int,input().split())\r\nif m*n%2==0:\r\n print(int(m*n/2))\r\n\r\nelse:\r\n print(int(m*n//2 ))\r\n", "m,n=map(int,input().split())\r\na=m*n\r\n#print(a)\r\nc=0\r\nwhile(a>=2):\r\n c+=1\r\n a=a-2\r\nprint(c)\r\n\r\n ", "import sys\n\n(m, n) = map(int, sys.stdin.read().strip().split())\nsys.stdout.write(f'{m * n // 2}')\n\n", "fn=[item for item in input().split()]\r\nn=int(fn[0])\r\nm=int(fn[1])\r\nif n>=m:\r\n print((int(m/2)*n)+(m%2)*int(n/2))\r\nelse:\r\n print((int(n/2)*m)+(n%2)*int(m/2))", "m,n=map(int,input().split())\r\nr=m*n//2\r\nprint(r)", "n=list(map(int,input().split()))\r\na=(n[0]*n[1])//2\r\nprint(a)", "l = input().split()\na=int(l[0])\nb = int(l[1])\nc = a*b\nprint(c//2)", "\"\"\"\nXXX\nXXX\nXXX -> 8\n\nXXXX\nXXXX\nXXXX\n\nXXXXX if m % 2 == 0 or n % 2 == 0: m * n // 2\nXXXXX\n\nXXXXX\nXXXXX\nXXXXX else: (m * n - 1) // 2?\n\nXXXXXXX\nXXXXXXX\nXXXXXXX\nXXXXXXX\nXXXXXXX\n\"\"\"\n\n\nm, n = map(int, input().split())\nprint(m * n // 2)\n", "m,k = map(int, input().split())\r\nt = m*k//2\r\nprint(t)", "m,n=map(int,input().split())\r\nif 1<=m<=n<=16:\r\n s=m*n\r\n p=s//2\r\n print(p)", "t = input().split(' ')\r\nm = int(t[0])\r\nn = int(t[1])\r\nprint((m * n) // 2)", "n,m=map(int,input().split())\r\na=n*m\r\nb=a//2\r\nprint(b)", "s=input()\r\nss=s.split(\" \")\r\nM=int(ss[0])\r\nN=int(ss[1])\r\nmn=M*N \r\nprint(mn//2)", "m,n=map(int,input().split())\r\nif (m==1 and n==1):\r\n print(0)\r\nelse:\r\n print((m*n)//2)", "# domino pilling\r\nM, N = map(int, input().split())\r\narea = M * N\r\nprint(area//2)\r\n", "a,b = map(int, input().split())\r\n\r\nresult = int(a * b / 2)\r\n\r\nprint(result)", "x = input()\r\nx = x.split(\" \")\r\nm = x[0]\r\nn = x[1]\r\nm = int(m)\r\nn = int(n)\r\n\r\nif (m*n)%2:\r\n print(int((m*n-1)/2))\r\n\r\nelse:\r\n print(int(m*n/2))", "a, b = map(int, input().split())\r\nans2 = (a*b) // 2\r\nprint(ans2)\r\n", "n,m=map(int,input().split())\r\nif(m>=1 and n<=16):\r\n q=n*m//2\r\nprint(q)", "#47A - Domino piling\r\nimport re\r\nx=input()\r\nx=re.split(\" \",x)\r\na=int(x[0])*int(x[1])\r\nprint(int(a/2))", "# -*- coding: utf-8 -*-\n\"\"\"cf.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YrEK_r6YRGFj-T8dg-QY4vaz0e7RNn62\n\"\"\"\n\ns = input()\ns = s.split(\" \")\nsl = []\nfor i in s:\n i = int(i)\n sl.append(i)\na = sl[0] * sl[1]\nop = a // 2\nprint(op)", "import sys\r\n\r\nm, n = [int(i) for i in input().split()]\r\n\r\nif m % 2 == 0 or n % 2 == 0:\r\n print(int((m*n)/2))\r\nelse:\r\n if m == 1:\r\n print(n//2)\r\n elif n==1:\r\n print(m//2)\r\n else:\r\n\r\n ans = int(((m - 1)*n) / 2)\r\n\r\n ans += int(n//2)\r\n print(ans)\r\n", "import math \r\nn,m = input().rstrip().split()\r\nn = int(n)\r\nm = int(m)\r\nprint(math.floor(n*m*0.5))", "inputs = input().split()\narea = int(inputs[0]) * int(inputs[1])\nprint(area // 2)", "a = input(); a = a.split(\" \"); x = int(a[0]); y = int(a[1]); print((x*y)//2)", "# -*- coding: utf-8 -*-\n\"\"\"domino.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1KIEK-EyC2oqMlHcpk6NeIzbMFVlm-SgU\n\"\"\"\n\nm,n = map(int, input().split())\nprint(m*n//2)", "kpr,k=map(int,input().split()) \nmulti=kpr*k \nL=2*1 \ndomp=multi//L\nprint(domp)\n \t\t\t\t\t\t\t\t\t \t\t\t \t\t\t \t \t \t \t", "i = input()\r\ns = i.split()\r\nw = int(s[0])\r\nl = int(s[1])\r\na = w * l\r\nresult = int(a / 2)\r\nprint(str(result))", "N, M = map(int, input().split())\r\nmultiplied = N * M\r\nprint(multiplied // 2)", "a, b = list(map(int, input().split()))\r\n\r\nprint(int(a * b / 2))\r\n", "m,n = input().split()\nm = int(n) * int(m)\nprint(m // 2)\n", "a,b=map(int,input().split())\r\nk=(a*b)//2\r\nprint(k)", "m, n = map(int, input().split())\r\nb = m*n\r\nd = 2*1\r\nr = b // d\r\nprint(r)", "m,n=input().split()\r\ns=int(m)*int(n)//2\r\nprint(s)", "m,n=map(int,input().split())\r\nc=m*n\r\nv=c//2\r\nprint(v)", "r = list(map(int, input().split()))\r\nprint((r[0]*r[1])//2)", "inputs = input().split()\r\n\r\nm = int(inputs[0])\r\nn = int(inputs[1])\r\n\r\ncociente = int((m * n)/(2*1))\r\n\r\nprint(cociente)", "m_and_n = list(map(int, input().split()))\r\n\r\nm = m_and_n[0]\r\nn = m_and_n[1]\r\n\r\nprint(m*n//2)\r\n", "import sys\r\n\r\nnumbers=[int(i)for i in sys.stdin.readline().split()]\r\n\r\nm=numbers[0]\r\nn=numbers[1]\r\n\r\n\r\nprint(int(m*n/2))\r\n", "from math import ceil\r\nm, n=[int(i) for i in input().split()]\r\na=m*n\r\nb=a//2\r\nprint(b)", "M, N = map(int, input().split())\n\n# Calculate the total number of squares on the board\ntotal_squares = M * N\n\n# Calculate the maximum number of dominos that can be placed\nmax_dominos = total_squares // 2\n\nprint(max_dominos)\n\t \t\t \t \t\t\t\t\t \t \t \t\t \t\t", "nums = input()\r\nnumbers = nums.split()\r\nm = int(numbers[0])\r\nn = int(numbers[1])\r\nprint((m*n)//2)", "m,n=[int(x) for x in input().split()]\r\nif m*n%2!=0:\r\n num=(m*n-1)//2\r\nelse:\r\n num=(m*n)//2\r\nprint(num)\r\n", "x = str(input())\r\nspace_index = 0\r\nfor i in range(len(x)):\r\n if x[i]==\" \":\r\n space_index = i\r\n\r\nnum_1 = int(x[:space_index])\r\n\r\nnum_2 = int(x[space_index+1:])\r\n\r\nmult = num_1 * num_2\r\nprint(mult//2)\r\n", "import sys\r\nfrom os import path\r\n\r\nFILE = False # if needed change it while submitting\r\n\r\nif FILE:\r\n sys.stdin = open('C:/Users/vag/PycharmProjects/Genetic_Algo/peos.txt', 'r')\r\n\r\ndef get_n_m():\r\n return sys.stdin.readline()\r\n\r\ndef get_list():\r\n return sys.stdin.readline().strip()\r\n\r\nfirst_line = get_n_m()\r\nfrst = first_line.split(\" \")\r\n\r\nn = int(frst[0])\r\nm = int(frst[1])\r\n\r\nprint(n*m//2)", "import math\r\na, b = map(int, input().split())\r\nprint(math.floor(a*b/2))\r\n\r\n\r\n", "M, N = map(int, input().split())\r\nts = M * N\r\nmh = ts // 2\r\nmv= ts // 2\r\nmd = min(mh, mv)\r\nprint(md)", "'''\r\nAuthor: KasperFan && [email protected]\r\nDate: 2023-09-23 20:03:05\r\nLastEditTime: 2023-09-23 20:07:14\r\nFilePath: /ACM/CodeForces/A. Domino piling.py\r\ndescribes: This file is created for learning Code.\r\nCopyright (c) 2023 by KasperFan in WFU, All Rights Reserved. \r\n'''\r\n\r\nif __name__ == \"__main__\":\r\n M, N = map(int,input().split())\r\n print(M * N // 2)\r\n", "\"\"\"n=int(input())\r\no1=\"No\"\r\nfor i in range(n):\r\n x=int(input())\r\n y=str(input())\r\n for j in range(x):\r\n if y[j]=='Q':\r\n for a in y[j:]:\r\n if a=='A':\r\n o1=\"Yes\"\r\n else:\r\n o1=\"No\"\r\n print(o1)\r\n\r\n\"\"\"\r\n\"\"\"\r\n_______________________________________________ yet\r\nn=int(input())\r\nsum=0\r\n\r\nfor i in range(n):\r\n x=\"no\"\r\n line1=input().split()\r\n sum=int(line1[0])\r\n if (int(line1[1])+int(line1[2]))==sum:\r\n x=\"yes\" \r\n sum=int(line1[2])\r\n if (int(line1[0])+int(line1[1]) )==sum:\r\n x=\"yes\"\r\n sum=int(line1[1])\r\n if (int(line1[0])+int(line1[2])==sum):\r\n x=\"yes\"\r\n\r\n print(x)\r\n____________________________________________________________Done\r\n\"\"\" \r\n\"\"\" \r\nn=int(input())\r\nfor i in range(n):\r\n x=input().split()\r\n t1=x[0]\r\n t2=x[1]\r\n max='>'\r\n if t1==t2:\r\n max='='\r\n if t2[-1]=='S'and t1[-1]=='S':\r\n if len(t1)>len(t2):\r\n max='<'\r\n if t2[-1]=='L' and t1[-1]=='L':\r\n if len(t2)>len(t1):\r\n max='<'\r\n if t2[-1]=='L' and t1[-1]=='M':\r\n max='<'\r\n if t2[-1]=='L' and t1[-1]=='S':\r\n max='<'\r\n if t2[-1]=='M' and t1[-1]=='S':\r\n max='<'\r\n print(max)\r\n ___________________________________________________________Done\r\n\"\"\"\r\n\"\"\"\r\nw=int(input())\r\nx=w/2\r\ny=w/2\r\nif w>2:\r\n if x%2==0 and y%2==0:\r\n print(\"YES\")\r\n else:\r\n x+=1\r\n y-=1\r\n if x%2==0 and y%2==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n____________________________________________________________________Done\r\n\"\"\"\r\n\"\"\"\r\nn=int(input())\r\na=''\r\nb=''\r\n\r\nfor i in range(n):\r\n x=str(input())\r\n w=len(x)\r\n if w<=10:\r\n print(x)\r\n else:\r\n for j in x:\r\n if j in x[0] :\r\n a=j\r\n b=j\r\n if j in x[-1]:\r\n b=j \r\n o=(a+str(len(x)-2)+b)\r\n print(o)\r\n\"\"\"\r\n\"\"\"\r\nn=int(input())\r\no=0\r\nfor i in range(n):\r\n c0=0\r\n c1=0\r\n x=input().split()\r\n for i in x:\r\n if i=='0':\r\n c0+=1\r\n else:\r\n c1+=1\r\n if c1>=2:\r\n o+=1\r\nprint(o)\r\n_______________________________________________________________Done\r\n\"\"\"\r\n\"\"\"\r\n\r\na= input().split()\r\nn=int(a[0])\r\nx=int(a[1])\r\nc=0\r\nk=input().split()\r\nk1=[]\r\nfor d in k:\r\n d=int(d)\r\n k1.append(d)\r\ncount=0\r\nfor i in k1:\r\n count+=1\r\n if count==x:\r\n x=i\r\n break\r\nfor j in k1:\r\n if j>0 and j>=x:\r\n c+=1\r\nprint(c) \r\n_______________________________________________________Done\r\n\"\"\" \r\nn=input().split()\r\na=int(n[0])\r\nb=int(n[1])\r\nx=0\r\nr=a*b\r\nc=0\r\nfor i in range(r):\r\n if r-2>=x:\r\n x+=2\r\n c+=1\r\nprint(c)\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n ", "m,n = map(int,input().split())\r\na = m*n\r\np = int(a/2)\r\nprint(p)", "m,n=[int(i) for i in input().split()]\r\na=m*n\r\nif a%2==0:\r\n out=int(a/2)\r\nelse:\r\n out=int((a-1)/2)\r\nprint(out)", "'''''''''''''''''''''''''''''\r\n Author : man_in_errors\r\n Created : 2023-04-07 00:02:09\r\n'''''''''''''''''''''''''''''\r\nimport os,io,sys,time,random,heapq\r\nfrom itertools import permutations as p\r\nfrom random import randint as R\r\nfrom bisect import bisect_left\r\nfrom sys import stdin,stdout\r\n#input = stdin.readline\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nstart_time = time.time()\r\nII = lambda: int(input())\r\nINS = lambda: input().strip()\r\nINSD = lambda: input().strip().decode()\r\nRI = lambda: [int(i) for i in input().split()]\r\nPR = lambda i: print(i,end=\" \")\r\nPI = lambda i: stdout.write(str(i)+'\\n')\r\n''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''\r\ndef solve():\r\n a,b=RI()\r\n print(int(a*b*.5))\r\n \r\n\r\n''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''\r\n#sys.stdin = open(\"input.txt\",\"r\")\r\n#sys.stdout = open(\"output.txt\",\"w\")\r\nfor _ in range(1,2):\r\n solve()\r\n#print(\"Time Elapsed :\",time.time() - start_time,\"seconds\")", "s=input()\r\nl=s.split()\r\nM=int(l[0])\r\nN=int(l[1])\r\nif M%2==0 or N%2==0:\r\n\tprint(M*N//2)\r\nelse:\r\n\tprint(M*(N-1)//2 +M//2)", "# sheet I\n# input\nm, n = input().split()\nm = int(m)\nn = int(n)\n# process\nans = m * n / 2\nans = int(ans)\n# output\nprint(ans)\n \t \t\t\t \t\t\t\t \t\t \t", "x,y=map(int,input().split())\r\nz=x*y\r\nm=z//2\r\nprint(m)", "\r\nt=input().split()\r\nsquare=int(t[0])*int(t[1])\r\nprint(square//2)\r\n", "m,n=map(int,input().split())\r\nl=(m*n)\r\nprint(l//2)", "a = input().split()\r\nb = a[0]\r\nc = a[1]\r\nprint(int(b) * int(c) // 2)\r\n\r\n", "M,N = input().split()\r\nM= int(M)\r\nN= int(N)\r\nArea= M*N\r\nprint(int(Area/2))", "line = input().split()\r\nn = int(line[0])\r\nm = int(line[1])\r\na = 2\r\n\r\nresult = n * m //2\r\nprint(result)", "Ma,Na=map(int,input().split())\r\nif Ma%2==0 or Na%2==0:\r\n print(Ma*Na//2)\r\nelse:\r\n print(((Ma-1)*Na//2)+Na//2)", "abbas,bainmach=map(int,input().split())\nprint(int((abbas*bainmach)/2))\n \t \t \t\t \t \t \t\t \t\t\t \t\t\t", "m,n = map(int,input().split())\r\nboard= m*n\r\ndominos = board//2\r\nprint(dominos)", "m, n = map(int, input().split())\nif m == 1 and n == 1:\n print(\"0\")\nelse:\n print((m*n)//2)\n", "M,N = input().split()\r\nM = int(M)\r\nN = int(N)\r\nprint(M*N//2)", "\r\nN, M = map(int, input().split())\r\narea = N*M\r\nprint(area//2)", "x,y=map(int, input().split())\r\ns=x*y\r\nans=int(s/2)\r\nprint(ans)", "initialInput = str.split(input())\r\nnumSplit = list(map(int, initialInput))\r\nprint(numSplit[0] * numSplit[1] // 2)\r\n", "n , m = map(int , input().split())\r\ns = m*n\r\nprint(s//2)\r\n", "import sys\r\nnumbers=[int(i)for i in sys.stdin.readline().split()]\r\nm=numbers[0]\r\nn=numbers[1]\r\nprint(int(m*n/2))", "x = list(map(int,input().split()))\r\nprint((x[0]*x[1])//2)", "q, z = map(int, input().split())\r\ntotal = int(q*z / 2)\r\nprint(total)", "m, n = input().split()\r\n\r\nresult = int(m) * int(n) / 2\r\n\r\nprint(int(result))\r\n", "n,m = map(int,input().split())\r\nans = n*m\r\nprint(ans//2)", "#Homework 1 Letter E\na,b = input().split()\nm = int(a)\nn =int(b)\nmaxdom = m*n// 2\nif m < 0 or m > 16:\n print(\"Out of range\")\nelif n < 0 or n > 16:\n print(\"Out of range\")\nelse:\n print(maxdom)\n \t\t \t\t\t\t \t\t \t \t\t\t \t\t \t", "from math import trunc\r\n\r\n\r\nM,N=map(int,input().split())\r\np=trunc((M*N)/2)\r\nprint(p)\r\n", "import math\r\nx,y = input().split(\" \")\r\na,b = int(x),int(y)\r\nprint(math.floor((a*b)/2))\r\n", "m, n = map(int, input().split())\n\nif m == 0 and n == 0:\n\tprint(0)\nelse:\n\tprint(int((m*n)//2))", "a=input().split() #7 3 \r\na=list(map(int,a))\r\nx=0\r\nif a[0]%2==0:\r\n print(a[1]*a[0]//2)\r\nelif a[0]==1:\r\n if a[1]>1 and a[1]%2==0:\r\n print(a[1]//2)\r\n elif a[1]>1 and a[1]%2!=0:\r\n print((a[1]-1)//2)\r\n elif a[1]==1:\r\n print(0)\r\nelif a[0]%2!=0:\r\n print((a[1]//2)+(a[1]*(a[0]-1)//2))", "m,n=input().split()\r\nm,n=int(m),int(n)\r\n\r\nif m%2==0 or n%2==0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int(m*n/2-1/2))", "aa, bb = map(int, input().split())\nmax_dominoes = (aa * bb) // 2\nprint(max_dominoes)\n \t \t \t\t\t \t\t \t\t \t\t \t \t\t\t \t", "a,b=map(int,input().split())\nx=a*b\nprint(x//2)\n#rjghidghiahdifghuiodhg\n\t\t\t\t\t \t \t\t \t\t\t \t\t \t \t\t", "M, N = input().split()\r\nM = int(M)\r\nN = int(N)\r\nprint(int((M*N/2)))", "m, n = list(map(int, input().split()))\r\n\r\nsquares = n * m\r\n\r\ndominos = squares // 2\r\n\r\nprint(dominos)\r\n", "import math\r\nbSize = input() \r\nbSize = bSize.split()\r\nbSize = int(bSize[0])*int(bSize[1])\r\ntotalDom = math.floor(bSize / 2)\r\nprint(totalDom)", "\"\"\"\n1 <= M <= N <= 16\nif M == 1: N // 2\nif M == 2: N\nif even(M): M // 2 * N\nif odd(M): F(1, N) + F(M-1, N)\n\"\"\"\nif __name__ == '__main__':\n M, N = map(int, input().split())\n if M % 2:\n print(N // 2 + (M - 1) // 2 * N)\n else:\n print(M // 2 * N)\n", "l , b = map(int,input().split())\r\nprint((l*b)//2)\r\n", "m, n = map(int, input().split())\r\ntotal_squares = m * n\r\nmax_dominoes = total_squares // 2\r\nprint(max_dominoes)\r\n", "M,N = map(int, input().split())\r\nresult = (M*N)//2\r\nprint(result)", "import sys, time, random\r\ninput = sys.stdin.readline\r\ndef gl(i = \"i\"):\r\n\tif i == \"s\":\r\n\t\treturn list(map(int, input().split()))\r\n\treturn list(map(int, input().split()))\r\ndef gi(am = 1):\r\n\tif am == 1:\r\n\t\treturn int(input())\r\n\treturn map(int, input().split())\r\nnn = \"\\n\"\r\n\r\n\r\ndef main():\r\n\tm, n = gi(2)\r\n\tprint((m*n)//2)\r\n\r\nmain()\r\n\r\n\r\n", "m,k= map(int, input().split())\r\nprint(m*k//2)", "x,y=map(int,input().split())\r\nj=x*y\r\nwhile j%2!=0:\r\n j-=1\r\nprint(j//2)\r\n", "number = input().split()\r\nn = int(number[0])\r\nk = int(number[1])\r\narea = n*k\r\nprint(int(area/2))", "m,n=map(int,input().split())\r\nr=m*n/2\r\nr=int(r)\r\nprint(r)", "import math\r\n\r\ndef solution():\r\n dim = input()\r\n \r\n m, n = [int(e) for e in dim.split()]\r\n \r\n # m and n are even - divisible\r\n # either m or n is odd - divisible\r\n # m and n are odd - remain one\r\n print(math.floor(m * n / 2))\r\n \r\nsolution()", "n = list(map(int, input().split()))\r\n\r\n\r\nm = n[0]\r\nn = n[1]\r\n\r\nif m * n % 2 == 0:\r\n\tprint(int((m * n) / 2))\r\nelse:\r\n\tprint(int((m * n - 1) / 2))", "def dominoPilling():\n return (m*n)//2\n\n\nm,n = map(int, input().split())\nans = dominoPilling()\nprint(ans)\n\t \t\t\t\t\t \t\t \t\t\t \t\t\t\t \t \t \t", "a = input().split()\r\nM=int(a[0])\r\nN=int(a[1])\r\nk=(M*N)//2\r\nprint(\"\",k)", "m,n=map(int,input().split())\r\nres=(m*n)/2\r\nprint(int(res))\r\n", "def myfun(M,N):\r\n dom_vert=(N//2)*M\r\n dom_hori=(M//2)*N\r\n sq_rem_vert=((M*N)-((N//2)*M)*2)//2\r\n sq_rem_hor=((M*N)-((M//2)*N)*2)//2\r\n print(max(dom_hori+sq_rem_hor,dom_vert+sq_rem_vert))\r\nM,N=list(map(int,input().split()))\r\nmyfun(M,N)\r\n", "a = input()\r\nb,c = map(int, a.split())\r\nd = b * c\r\nprint(d//2)", "M,N = map(int, input().split())\r\nx = M*N//2\r\nprint(x)", "import math\r\n\r\nentrada=input().split()\r\nm,n=map(int,entrada)\r\nsalida=math.floor((m*n)/2)\r\nprint(salida)", "# A. Domino piling\r\n\r\nsize = tuple(map(int, input().split()))\r\nprint(int(((size[0]-(size[0]%2))*size[1] + size[0]%2*(size[1]-(size[1]%2)))/2))", "a,b=list(map(int,input().split()))\r\nif a*b%2==0:\r\n print(round((a*b)/2))\r\nelse:\r\n print(round((a*b-1)/2))\r\n", "m, n = map(int,input().split())\r\nsquares_covered = (m * n) // 2\r\nprint(squares_covered)", "N , M = map(int, input().split())\ns = N * M \nprint(s//2)\n\n\n\n", "n,m=map(int,input().split())\r\nar=n*m\r\ninA=0\r\nc=0\r\nfor i in range(ar):\r\n if inA+2<=ar:\r\n c+=1\r\n inA+=2\r\nprint(c)", "m, n = [int(x) for x in input().split()]\r\n\r\n\r\na = 1\r\nb = 2\r\n\r\nif m < n and m % a == 0:\r\n side1 = m / a\r\n side2 = n / b\r\n result = side1 * side2\r\nif m == n and m % a ==0 or n % a == 0:\r\n side1 = m / a\r\n side2 = n / b\r\n result = int(side1 * side2)\r\n\r\nprint(result)", "a = [int(x) for x in input().split()]\r\nprint(int((a[0]*a[1])/2))", "n,m=map(int,input().split())\r\nsq=n*m\r\nprint(sq//2)\r\n ", "import math\r\nx,y = [int(i) for i in input().split()]\r\nprint(math.floor(x*y/2))", "import math\r\nm, n = input().split()\r\ntotal_squares = int(m) * int(n)\r\nno_of_domino = math.floor(total_squares / 2)\r\nprint(no_of_domino)\r\n", "m,n = list(map(int, input().split()))\r\nx = int(m*n/2)\r\nprint (x)", "M,N = map(int,input().split())\r\nif 1<=M<=N<=16:\r\n print(M*N//2)", "arr=[int(i) for i in input().split()]\nm=arr[0]\nn=arr[1]\ns=2\nprint((m*n)//2)\n", "n, k = map(int, input().split())\r\nif (n * k) % 2 == 0:\r\n print(int((n*k)/2))\r\nelse:\r\n print(int((n * k - 1) / 2))", "M, N = map(int,input().split())\r\nx = M * N\r\ny = x//2\r\nprint(y)", "in_ar = list(map(int,input().split()))\r\nresult = (in_ar[0]*in_ar[1]) // 2\r\nprint(result)\r\n", "x,y=[int(z) for z in input().split()]\r\nn=x*y\r\nprint(n//2)", "n,m=map(int,input().split())\r\nsum=n*m\r\nx=int(sum/2)\r\nprint(x)", "def main():\r\n n, m = pair()\r\n if n*m % 2 == 0:\r\n p(int(n*m/2))\r\n else:\r\n p(int((n*m-1)/2))\r\ndef parray(a):\r\n for i in a:\r\n print(i, end = \" \")\r\n print()\r\n\r\ndef solve():\r\n n, m = pair()\r\n \r\nimport itertools\r\nimport bisect, math\r\nimport copy\r\nimport fractions\r\n\r\ndef s(e): return sum(e)\r\ndef l(e): return len(e)\r\ndef num(): return int(input()) \r\ndef array(): return list(map(int, input().split()))\r\ndef pair(): return (map(int, input().split()))\r\ndef p(x=\"\", end = \"\\n\"): return print(x, end = end)\r\ndef sort(a): return sorted(a)\r\ndef fpair(x): return str(fractions.Fraction(x)).split(\"/\")\r\n\r\ndef parray(a):\r\n for i in a:\r\n p(i, end = \" \")\r\n p()\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain()", "one, two = input().split()\r\none, two = int(one), int(two)\r\nn = one * two\r\nif n % 2 == 1:\r\n n = one * two - 1\r\nprint(int(n/2))", "import math\r\n\r\nl = list(map(int, input().split()))\r\n\r\nprint(math.floor(l[0] * l[-1] / 2))", "r,c=map(int,input().split())\r\nans=0\r\nif(r%2==0):\r\n ans=(r//2)*c\r\nelif(c%2==0):\r\n ans=(c//2)*r\r\nelse:\r\n ans=((r//2)*c)+(c//2)\r\n\r\nprint(ans)\r\n", "#T he first line of the program will take the input from user\nn ,m=map(int ,input().split())\nprint((m*n)//2)\n \t \t \t \t \t \t\t \t\t \t\t\t \t\t \t", "a=input().rstrip().split()\r\nn=int(a[0])\r\nm=int(a[1])\r\nprint((n*m)//2)", "import math\r\n\r\na,b=map(int,input().split())\r\n\r\nx=math.floor((a*b)/2)\r\nprint(x)", "def solution():\r\n m,n = map(int, input().split())\r\n area = m*n\r\n\r\n return (area - 1) // 2 if area % 2 != 0 else area // 2\r\n \r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n result = solution()\r\n print(result)", "x, y = [int(x) for x in input().split()]\r\nprint((x * y) // 2)", "import math\r\n\r\nm, n = map(int, input().split())\r\nmn = m*n\r\nx = mn/2\r\nx = math.floor(x)\r\nprint(x)", "# Read the board sizes M and N\r\nM, N = map(int, input().split())\r\n\r\n# Calculate the maximum number of dominoes that can be placed\r\nmax_dominoes = (M * N) // 2\r\n\r\n# Print the result\r\nprint(max_dominoes)", "import sys\r\n\r\ndef solve():\r\n m, n = map(int, input().rstrip().split())\r\n print(m*n//2)\r\n\r\nif __name__ == \"__main__\":\r\n #sys.stdin = open('input.txt','r')\r\n\r\n solve()", "m, n = input().split()\r\na = (int(m)*int(n))//2\r\nprint(a)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "T = input()\r\nM,N = T.split(\" \")\r\nM = int(M)\r\nN = int(N)\r\nprint(int((M*N)/2))", "m,n=map(int,input().split())\r\ntot=m*n\r\nprint(tot//2)", "n = input().split()\nprint(int(n[0]) * int(n[1]) // 2)", "from math import trunc\r\n\r\nx = [int(i) for i in input().split()]\r\n\r\narea = x[0]*x[1]\r\n\r\nprint(int(area/2)) if area % 2==0 else print(trunc(area/2))", "a,b =map(int,input().split())\nprint(a*b//2)#s\n \t\t\t\t \t\t\t\t\t \t \t\t \t \t \t\t \t", "line = list(map(int,input().split()))\r\nM = line[0]\r\nN = line[1]\r\nmul = M*N\r\nif (mul%2==0):\r\n div = mul/2\r\nelse:\r\n div = mul/2\r\nprint(int(div))\r\n", "m, n = input().split()\nm = int(m)\nn = int(n)\ndominos = 0\nif 1 <= m <= 16 and 1 <= n <= 16:\n if m % 2 == 0:\n dominos = (int(m/2) * n)\n elif m % 2 != 0:\n dominos = (int(m/2) * n) + int(n/2)\n\nprint(int(dominos))\n\t\t \t \t\t \t \t \t \t \t \t \t\t\t\t", "m,n= map( int, input().split())\r\nprint((m*n)//2)", "a,b=map(int,input().split())\r\narea=a*b\r\nprint(area//2)", "b = [int(a) for a in input().split()]\r\n\r\nif (b[0]*b[1])%2==0:\r\n print(b[0]*b[1]//2)\r\nelse:\r\n print(b[0]*b[1]//2)\r\n", "inp=input().split()\r\nm=int(inp[0])\r\nn=int(inp[1])\r\nx=n*m\r\nif(x%2==0):\r\n ans=x//2\r\nelse:\r\n ans=(x-1)//2\r\nprint(ans)", "N,M=[int(x) for x in input().split()]\r\nnum = (N*M)/2\r\n\r\nprint(int(num))", "n=input().split(\" \")\r\narea=int(n[0])*int(n[1])\r\nprint(int(area/2))", "m,n = list(map(int, input().split()))\r\nif m ==1 and n == 1:\r\n print(0)\r\nelse:\r\n print(int(m*n) //2)", "n, m = [int(i) for i in input().split()]\r\nif n % 2 == 0:\r\n print(m * n // 2)\r\nelse:\r\n print(m * (n - 1) // 2 + m // 2)", "[a,b] = list(map(int,input().split()))\r\nprint(int((a*b)/2))", "m,n = map(int, input().split());q = m * n ;w = 2*1;e = q // w;print(e)", "a,b=map(int,input().split())\r\nx=a*b\r\nr=x//2\r\nprint(r)\r\n", "n1,n2=[int (i) for i in input().split()]\r\nprint(int((n1*n2)/2))", "m, n = [int(x) for x in input().split()]\r\n\r\nif (m * n) % 2 == 0:\r\n domino = (m * n) / 2\r\n print(int(domino))\r\nelse:\r\n domino = ((m * n) - 1) / 2\r\n print(int(domino))", "kaza,ill=map(int,input().split())\nif(1<=kaza<=16 and 1<=ill<=16):\n tutha= kaza*ill\n print(tutha//2)\n\t \t \t \t \t\t \t \t \t \t \t \t", "dims = [int(i) for i in input().split()]\n\ncount = (dims[0] // 2) * dims[1]\n\nif dims[0] % 2 != 0:\n count += dims[1] // 2\n\nprint(count)", "n,m = map(int,input().split())\r\nrta = (n*m)//2\r\nprint(rta)", "masse = input().split()\nh = int(masse[0])\nm = int(masse[1])\narea = h * m\nprint(area//2)\n\n\n\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 16 14:15:07 2021\r\n\r\n@author: Rahul\r\n\"\"\"\r\nimport math\r\nm,n = list(map(int,input().split()))\r\nprint(math.floor(m*n/2))", "a,b = map(int,input().split())\r\nc = (a*b)//(2*1)\r\nprint(c)", "m, n = map(int, input().split())\r\nraz = int(m*n)\r\nk = 0\r\nwhile raz >= 2:\r\n k += 1\r\n raz -= 2\r\nprint(k)", "x,y = input().split()\r\n\r\nsurface = int(x) * int(y)\r\n\r\nresult = surface/2\r\nprint(int(result))\r\n", "w, h = map(int, input().split())\r\nprint(str(int(w*h/2)))", "arr = [int(i) for i in input().split()]\r\nprint((arr[0]*arr[1])//2)", "m , n = map(int,input().split())\r\n\r\nr = (m*n) // 2\r\n\r\nprint(r)", "dim = list(map(int, input().split()))\r\nprint((dim[0]*dim[1])//2)", "line1 = input()\n\nM = int(line1.split(\" \")[0])\nN = int(line1.split(\" \")[1])\n\nArea = M*N\nprint(M*N//2)", "from math import floor\r\nm, n = map(int, input().strip().split(\" \"))\r\nprint(floor(m*n/2))\r\n", "m,n = map(int,input().split())\r\nk = (m*n//2)\r\nprint(k)", "board=input()\r\n\r\nx=board.split()\r\n\r\nboardSize=1\r\n\r\nfor square in x :\r\n boardSize*=int(square)\r\n \r\nprint(boardSize//2)\r\n", "(m,n) = map(int, input().split(' '))\r\nif m%2==0:\r\n num=(m//2)*n\r\nelif n%2==0:\r\n num=(n//2)*m\r\nelse:\r\n num=((m-1)//2)*n+(n//2)\r\nprint(num)", "M,N=input().split()\r\ns=int(M)*int(N)\r\nf=2\r\nn=s//2\r\nprint(n)", "def int_list_input():\r\n return(list(map(int,input().split())))\r\nm,n = int_list_input()\r\nres = int(n/2) *m\r\nif n%2 !=0: res += int(m/2)\r\nprint(res)", "input_line = str(input())\r\nfor a in range(1, len(input_line)):\r\n if input_line[a] == \" \":\r\n n1 = int(input_line[0:a])\r\n n2 = int(input_line[a+1:len(input_line)])\r\n pass\r\ndominoes = int(n1*n2/2)\r\nprint(dominoes)", "ls=[]\r\nls=input().split()\r\nm=int(ls[0])\r\nn=int(ls[1])\r\np=int((m*n)/2)\r\nprint(p)\r\n", "nums = input().split(' ')\r\n\r\n[m,n] = [ int(i) for i in nums]\r\n\r\nprint((m * n)//2)", "\nm, n= [*map(int, input().split())]\n\nsquare = m * n\nif square % 2 == 0:\n print(square // 2)\nelse:\n print((square - 1) // 2)\n", "def invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ninputs = list(invr())\r\nnumber_of_cells = inputs[0]*inputs[1]\r\nprint(number_of_cells//2)\r\n", "line1 = input().split(\" \")\r\n\r\nn = int(line1[0])\r\nm = int(line1[1])\r\nx = n // 2\r\ny = m\r\nz = 0\r\nif n % 2 == 1:\r\n z = m // 2\r\n\r\nprint(x*y+z)", "m, n = tuple(map(int, input().split(' ')))\r\nx = (m*n) // 2\r\nprint(x)", "x,y = [int(x) for x in input().split()]\r\nt = x*y\r\nif t%2!=0: t=t-1\r\nprint(int(t/2))\r\n ", "#reading the input values\nm,n=map(int,input().split())\ns=m*n//2\nprint(s)\n \t\t \t\t\t\t\t \t\t\t\t \t \t \t \t\t", "entradas = input().split()\r\nm = int(entradas[0])\r\nn = int(entradas[1])\r\n\r\nif n < m:\r\n print(\"O valor de m não deve superar o de n. Execute novamente o programa\")\r\nelse:\r\n if m % 2 == 1 and n % 2 == 1:\r\n print(int((m * n - 1) / 2))\r\n else:\r\n print(int(m * n / 2))", "m,n=input().split()\r\nplate=int(m)*int(n)\r\ndomino=2\r\nresult=int(plate)/domino\r\nprint(int(result))", "m,n=map(int,input().split())\r\narea=m*n\r\nif area<2:\r\n print(0)\r\nelse:\r\n print(area//2)", "x,y=map(int,input().split())\r\nc=x*y\r\nprint(c//2)", "from tkinter import N\r\n\r\n\r\ni = [ int(i) for i in input().split()]\r\n\r\nm=i[0]\r\nn=i[1]\r\nprint(int((m*n)/2))", "n,m=input().split()\r\nc=int(n)*int(m)\r\nd=c//2\r\nprint(d)", "x, y = map(int, input(\"\").split())\r\n \r\narea = x * y\r\ndominos = area // 2\r\nprint(dominos)", "m, n = map(int, input().split())\n\nif (m*n) % 2 == 1:\n print(round((m*n-1)/2))\nelse:\n print(round((m*n)/2))", "m,n = list(map(int,input().split()))\r\nv = m*n\r\nprint(int(v//2))", "m, n = map(int , input().split())\r\nif m%2 == 0 and n%2 ==0 or m%2 ==0 and n%2==1 or m%2==1 and n%2 ==0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int((m*n-1)/2))", "m, n = map(int, input().split())\r\nif m % 2 == 0:\r\n print(int(m/2*n))\r\nelif n % 2 == 0:\r\n print(int(n/2*m))\r\nelse:\r\n print(int(m//2*n + n//2))\r\n", "d,n=map(int,input().split())\r\nt=(d*n)/2\r\nprint(int(t))", "m,n=[int(x) for x in input().split()]\r\ns=0\r\nif m%2==0:\r\n print(int((m/2)*n))\r\nelif m%2!=0:\r\n if(n%2==0):\r\n print(int((n/2)*m))\r\n elif n%2!=0:\r\n s=int(m/2)\r\n o=int(n/2)\r\n print((s*n)+o)", "data = [int(a) for a in input().split(' ')]\r\nprint(int((data[0] * data[1]) / 2))", "import math\r\nm,n=map(int, input().split())\r\nx=math.floor (m*n/2)\r\nprint(x)", "tri = input()\na = tri.split()\n\nx = int(a[0])\ny = int(a[1])\n\na = x * y\n\nif a % 2 == 0:\n o = a / 2\n print(int(o))\n\nelse:\n o2 = (a - 1) / 2\n print(int(o2))", "def domino(m,n):\r\n area=int(m)*int(n)\r\n total_sqrt=area/2\r\n return total_sqrt\r\n\r\nm,n=input().split()\r\n\r\nprint(int(domino(m,n)))", "x,y=map(int,input().split())\r\nsquares_sum=x*y\r\na=int(squares_sum)/2\r\nprint(int(a))", "#This program was submitted to codeforces.com\r\nm,n=map(int, input().split())\r\nif(1<=m<=n<=16):\r\n print((m*n)//(2))", "n, m = map(int, input().split())\r\nprint(int(n*m*0.5))\r\n", "from sys import stdin\r\n\r\ndef main():\r\n m, n = list(map(int, stdin.readline().strip().split()))\r\n print(m * n // 2)\r\nmain()\r\n", "n, m = input().split()\nn = int(n)\nm = int(m)\n\nres = int(m*n/2)\n\nprint(res)\n \t\t\t\t \t \t\t \t\t\t\t \t\t\t \t \t\t\t", "from math import *\r\nle = [int(i) for i in input().split()]\r\nn = le[0]\r\nk = le[1]\r\ntotal = floor(n * k/2)\r\nprint(total)", "import math\nm,n=[int(x)for x in input().split()]\nprint(math.floor(m*n/2))\n \t \t \t\t\t\t \t\t\t\t\t\t\t \t\t\t\t \t\t", "M, N = input().split()\r\nfrom math import *\r\n\r\nif int(M) * int(N) % 2 == 0:\r\n print(int(int(M) * int(N) / 2))\r\nelse:\r\n print(floor(int(M) * int(N) / 2))", "m,n = map(int,input().split())\r\ns = m*n\r\nt = s // 2\r\nprint(t)", "M, N = [int(x) for x in input().split()]\r\n\r\nmax_dominoes = (M * N) // 2\r\n\r\nprint(max_dominoes)", "h, s = map(int, input().split())\r\ntotal = int(h*s / 2)\r\nprint(total)", "r,h=map(int,input().split()) \nmulti=r*h\nL=2*1 \ndomp=multi//L\nprint(domp)\n\t \t\t\t \t\t \t \t \t \t\t\t \t\t \t", "a = [int(a) for a in input().split()]\r\nsize = int(a[0]) * int(a[1])\r\nprint(size // 2)", "M,N=input().split(sep=\" \")\r\nM=int(M)\r\nN=int(N)\r\n\r\nsq=M*N\r\nprint(int(sq/2))", "n,m=map(int,input().split())\r\nr=n*m\r\nprint(r//2)", "M,N=map(int,input().split())\r\nmul=M*N\r\nprint(int(mul/2))", "(M,N)=map(int,input().split())\r\nprint(int(M/2*N))", "M, N = input().split(' ')\r\nM = int(M)\r\nN = int(N)\r\nArea = M*N\r\n\r\nprint(int((Area - (Area%2)) /2))", "size = input()\r\nM = int(size.split(\" \")[0])\r\nN = int(size.split(\" \")[1])\r\ndominoArea = 2\r\nboardArea = M * N\r\nprint(boardArea// dominoArea)", "largura, altura = input('').split()\r\nlargura, altura = int(largura), int(altura)\r\n\r\nif largura* altura%2 == 0:\r\n print(int((largura*altura)/2))\r\nelif largura* altura%2 != 0:\r\n print(int((largura*altura)/2-1/2))", "m,n = input().split()\r\nm=int(m) \r\nn=int(n)\r\n\r\nif m%2==0 or n%2==0:\r\n\tmax_dom = m*n/2\r\nelse:\r\n\tmax_dom = (m-1)*(n-1)/2+(m+n-2)/2\r\n\r\nprint(int(max_dom))", "M, N = map(int, input().split())\nd = 2\nprint(int(M * N / d))", "M,N=map(int,input().split())\n#Enter the input value\nn=M*N\np=n//2\nprint(p)\n\n\n\n \t\t\t \t \t\t \t\t\t \t \t\t\t \t \t", "l,b=map(int,input().split(' '))\r\nprint((l*b)//2)", "m, n, = map(int, input().split())\r\ncap = m*n\r\nprint(cap // (2*1))", "m, n = map(int, input().split())\r\ntotal_sqrs = m * n\r\nempty_boxes = total_sqrs % 2\r\nused_dominos = (total_sqrs - empty_boxes) / 2\r\nprint(int(used_dominos))", "N,M = [int(e) for e in input().split()]\r\nA = N * M\r\nnod = A // 2\r\nprint(nod)", "# math solution\r\n\r\nboard_size = [int(size) for size in input().split()]\r\n\r\narea = board_size[0] * board_size[1]\r\n\r\nprint(int(area / 2))", "l = list(map(int,input().split()))\nM = l[0]\nN = l[1]\n\nprint(int((M*N)/2))\n", "m, n = map(int, input().split())\r\nans = 0\r\nif m % 2 == 0 or n % 2 == 0:\r\n ans = m*n/2\r\nelse:\r\n ans = ((m*n) - 1)/2\r\nprint(int(ans))", "#!/usr/bin/python3\n\nm, n = [int(x) for x in input().split(\" \")]\ntotal_tile = m*n\n\nprint(total_tile//2)\n", "m, n = (int(i) for i in input().split()[:2])\r\nprint(int(m*n/2))\r\n", "a,b=input().split()\r\na,b=int(a),int(b)\r\nboard=a*b\r\npiece=board//2\r\nprint(piece)\r\n", "n = list(map(int, input().split()))\r\nw = n[0] * n[1]\r\n\r\nif w % 2 == 0:\r\n print(int(w / 2))\r\nelse:\r\n print(int((w-1) / 2))", "m,n = [int(x) for x in input().split()]\r\ns = (m*n)//2\r\nprint(s)", "m,n = map(int,input().split())\r\nt = m*n\r\nprint(t//2)", "import math\n[m, n] = map(int, input(\"\").split(\" \"))\n\ntotal_odd = 0\neven_m = m\nif m % 2:\n even_m = m - 1\n total_odd += math.floor(n/2)\neven_n = n\nif n % 2:\n even_n = n - 1\n total_odd += math.floor(m/2)\ntotal_even = even_n * even_m / 2\n\n\n\nprint(int(total_even + total_odd))\n", "m, n = input().split()\r\nres = int(m) * int(n) // 2\r\nprint(res)", "import math\r\na=list(map(int,input().split()))\r\nprint(math.floor((a[0]*a[1])/2))\r\n", "m, n = [int(_) for _ in input().split()]\r\n\r\n# 2M * 2N region, must filled\r\na = m - m % 2\r\nb = n - n % 2\r\nresult = int(a * b / 2)\r\n\r\nif (m % 2 == 1):\r\n result += n // 2\r\n\r\nif (n % 2 == 1):\r\n result += m // 2\r\n\r\nprint(result)\r\n", "[n, m] = list(map(int,input().split()))\r\nboard = m * n\r\ndomino = 2\r\nnumdobo = board//domino\r\nprint(numdobo)", "# read the input\r\nm, n = map(int, input().split())\r\n\r\n# calculate the maximum number of dominoes that can be placed\r\nmax_dominoes = (m * n) // 2\r\n\r\n# print the result\r\nprint(max_dominoes)\r\n", "n = input().split(\" \")\r\nb = int(n[0]) * int(n[1])\r\np = 0\r\nwhile(b >= 2):\r\n p += 1\r\n b -= 2\r\nprint(p)", "x = input()\r\ny, z = x.split(\" \")\r\nk = (int(y) * int(z)) / 2\r\n\r\nprint(int(k))\r\n", "n,m=map(int,input().split())\r\nx=int(n*m/2)\r\nprint (x)", "raw_input= input()\r\nliczba1,liczba2 = map(int,raw_input.split())\r\nwynik= int((liczba1*liczba2)/2)\r\nprint (wynik)", "m, n = input().split()\r\nprint(int((int(m)*int(n))/2))\r\n\r\n", "M, N = input().split()\nM=int(M)\nN=int(N)\nprint((M*N)//2)", "m, n = map(int, input().split())\r\nif(m*n)%2==0:\r\n print(m*n//2)\r\nelse:\r\n print(((m*n)-1)//2)", "M,N=map(int,input().split())\r\nn=(M*N)//2\r\nif 1<=M<=N<=16:\r\n print(n)", "m,n=map(int,input().split()) \r\np=m*n \r\nprint(p//2)", "r = [int(i) for i in input().split()]\r\nprint((r[-1] * r[0]) // 2)", "def dominos(M, N):\n Area = M * N\n num_pieces = Area / 2\n \n print(int(num_pieces))\n \nM, N = map(int, input().split())\ndominos(M, N)\n\t \t \t \t\t \t \t\t \t\t\t\t\t \t\t\t\t", "sizeM,sizeN = str(input(\"\")).split()\r\nsizeM = int(sizeM)\r\nsizeN = int(sizeN)\r\ntotalSize = sizeM * sizeN\r\ncounter = 0\r\ndomino =0\r\nwhile True:\r\n if domino > totalSize or domino + 2 > totalSize:\r\n break\r\n else :\r\n domino +=2\r\n counter +=1\r\nprint(counter)", "M, N = map(int, input().split())\r\nif M in range(1, N+1) and N in range(N, 16+1):\r\n number_pilting = (M*N) // 2\r\nprint(number_pilting)", "\n\ntc = input().split()\nM = int(tc[0])\nN = int(tc[1])\n\nx = (N//2)*M\nif N%2 != 0:\n x += M//2\n \nprint(x)\n ", "M, N = list(map(int, input().split()))\r\n\r\nc = M * N // 2\r\n\r\nprint(c)", "m, n = (int(x) for x in input().split())\r\nprint((m * n - 1)//2 if m & 2 == 1 or n & 2 == 1 else m * n // 2)", "n, k = map(int, input().split(' '))\r\ns = n*k\r\nif s%2!=0:\r\n s-=1\r\nprint(s//2)", "l=[int(i) for i in input().split()]\r\narea=l[0]*l[1]\r\nprint(area//2)", "def solve(m,n): \n x = max(m,n)\n if x==m: \n ans=int(m/2)*n\n if m%2!=0: \n ans+=int(n/2)\n return ans\n else:\n ans=int(n/2)*m\n if n%2!=0: \n ans+=int(m/2)\n return ans\n \nM,N = [int(i) for i in input().split()]\nprint(solve(M,N)) \n", "n,m=map(int,input().split())\nif (n*m)%2==0:\n print((n*m)//2)\nelse:\n print((n*m-1)//2)\n \t \t \t \t \t \t \t\t \t\t \t", "bord_shape = input().split()\r\nm = int(bord_shape[0])\r\nn = int(bord_shape[-1])\r\nbord_area = m * n\r\ntotal_domino = bord_area // 2\r\nprint(total_domino)\r\n", "inp = input()\r\nll = list(map(int, inp.split()))\r\n\r\nval = ll[0] * ll[1]\r\n\r\nif val % 2 == 0:\r\n print(int(val/2))\r\nelse:\r\n print(int((val-1)/2))", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Oct 8 18:49:12 2023\n\n@author: khabl\n\"\"\"\n\ndef dominos(M, N):\n Area = M * N #find out the area of the board\n num_pieces = Area / 2 # figure out the number of pieces needed by dividing by the area of the 2x1\n \n print(int(num_pieces)) # print the output\n \nM, N = map(int, input().split()) # user input\ndominos(M, N) # call the function\n \t\t\t \t \t\t \t \t\t \t\t\t \t \t\t", "M,N=map(int,input().split())\r\nx=(M*N)//2\r\nprint(x)", "#Since there is N*M cells on the board and each domino covers\n#exactly two of them we cannot place more for sure.\n\nnums = [int(x) for x in input().split()]\nret = nums[0] * nums[1]//2\n\nprint(ret)\n", "N, M=map(int, input(). split())\nprint((N*M)//2)\n \t\t\t \t \t \t\t \t \t\t\t\t \t\t \t\t\t \t", "n=list(map(int,input().split(\" \")))\r\na=n[0]\r\nb=n[1]\r\nif a%2==0 or b%2==0:\r\n print(int((a*b)/2))\r\nelse:\r\n c=int(a/2)*b\r\n d=int(b/2)\r\n print(c+d)", "a,b=input().split()\r\nc=int(a)*int(b)\r\nprint(c//2)", "n, m = map(int, input().split())\r\nprint(int(n*m/2))", "e, t = map(int, input().split())\nt_squares = e * t\nmax_do = t_squares // 2\nprint(max_do)\n#domino\n \t\t \t \t\t \t \t \t \t \t\t \t", "num = input().split()\r\n\r\nx = int(num[0]) * int(num[1])\r\n\r\nprint(x // 2)", "numbers = [int(num) for num in input().split(\" \", 1)]\nm = numbers[0]\nn = numbers[1]\ncount = 0\n \nif m%2==0 :\n count = n*m/2\nelse:\n count = n*(m-1)/2+n/2\n \nprint(int(count))\n \t \t\t\t \t \t\t\t\t\t \t\t\t", "import sys\r\nm,n = [list(map(int,line.split())) for line in sys.stdin][0]\r\nif m*n%2==0:\r\n print(int((m*n)/2))\r\nelse:\r\n print(int(((m*n)-1)/2))\r\n", "s=list(map(int,input().split()))\r\nprint((s[0]*s[1])//2)", "size = input().split()\r\n\r\narea = int(size[0])*int(size[1])\r\n\r\nif area%2==0:\r\n print(int(area/2))\r\nelse:\r\n print(area//2)", "s=input().split(\" \")\r\nm=int(s[0])\r\nn=int(s[1])\r\nprint((m*n)//2)\r\n", "list1=[int(item) for item in input(\"\").split()]\r\nif(len(list1)==2):\r\n print((list1[0]*list1[1])//2)\r\n", "arr = list(map(int, input().split()))\narea = arr[0] * arr[1]\nx = area// 2\nprint(x)", "dims = input().split(\" \")\r\nprint(int(dims[0]) * int(dims[1]) // 2)", "def rectfilldomino():\r\n row,col = map(int,input().split())\r\n mult = row * col\r\n maxnum = mult//2\r\n return maxnum\r\n\r\n\r\nprint(rectfilldomino())\r\n", "k,n = map(int,input().split())\r\nprint((k*n)//2)", "m,n = [int(x) for x in input().split()]\r\nl = []\r\ncnt = 0\r\nfor r in range(0,m*n):\r\n l.append(1)\r\nfor i in range(0,len(l)-1):\r\n c= l[i] + l[i+1]\r\n if c==2:\r\n l[i] = c\r\n l[i+1] = c\r\n cnt +=1\r\nprint(cnt)", "m_and_n = input()\r\nm_n = m_and_n.split()\r\nm = int(m_n[0])\r\nn = int(m_n[1])\r\n\r\nsquares = m*n\r\n\r\nif squares < 2:\r\n print(\"0\")\r\nelse:\r\n if (squares % 2) == 0:\r\n print(int(squares/2))\r\n else:\r\n print(int((squares-1)/2))", "n,m=input().split()\nn=int(n)\nm=int(m)\n\ndom1 = (m // 2) * n\nif (m % 2 > 0):\n dom2 = n // 2\nelse:\n dom2 = 0\ndom1+= dom2\nprint(dom1)\n\t \t \t \t \t \t\t\t\t\t\t\t\t \t\t\t\t\t \t\t\t\t\t", "m,n = [int(x) for x in input().split()]\r\nans = 0\r\nhorizontal = n // 2\r\nans = ans + m*horizontal\r\nif n % 2 != 0:\r\n ans = ans + (m//2)\r\nprint(ans)", "mk,nk = map(int,input().split())\r\n\r\nprint(mk*nk//2)", "m,n = [int(x) for x in input().split()]\r\nans = (m*n) // 2\r\nprint(ans)", "inp1 = input()\r\nl1 = inp1.split()\r\narea = int(l1[0])*int(l1[1])\r\nprint(area//2)\r\n", "n, m = map(int, input().split())\r\nstop = m*n\r\nprint(stop//2)\r\n", "import math\r\n\r\nm, n = input().split()\r\nnum_of_squares = int(m)*int(n)\r\nprint((math.floor(num_of_squares/2)))", "def parse():\n m, n = input().split()\n m = int(m)\n n = int(n)\n return m, n\n\n\ndef process(m, n):\n return m * n // 2\n\n\nprint(process(*parse()))\n", "a,b = map(int, input().split())\r\nprint((a//2)*b+(b//2)*(a%2))", "import math\r\nm= input()\r\nm_l= m.split(\" \")\r\nm_l= [int(i) for i in m_l]\r\n\r\nprint (math.floor((m_l[0] * m_l[1])/2))", "a=list(map(int,input().split()))\r\nb=a[0]\r\nc=a[1]\r\nd=b*c\r\ne=d//2\r\nprint(e)", "lst=list(map(int,input().split()))\r\nmaxi=max(lst)\r\nmini=min(lst)\r\ntotal=0\r\nif mini==1:\r\n total=int(maxi//2)\r\nelse:\r\n total+=(mini//2)*maxi\r\n if mini%2==1:\r\n total+=maxi//2\r\nprint(int(total))", "s = input()\r\nt = 0\r\nwhile s[t] != \" \":\r\n t = t + 1\r\nm = int(s[0:t:1])\r\nn = int(s[t+1:len(s):1])\r\n\r\nprint(int(m*n/2))", "n,m = map(int,input().split())\r\ntotal =n*m\r\nnumber = (total-(total%2))//2\r\nprint(number)", "# Read M and N\r\nM, N = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nprint((M * N) // 2)\r\n", "m_n=input().split()\r\nm_n.sort()\r\nvalue=0\r\n\r\nm=int(m_n[0])\r\nn =int(m_n[1])\r\n\r\n\r\nif(n%2 == 0):\r\n value=m*n/2\r\nelse:\r\n n-=1\r\n value=m*n/2\r\n if(m%2 == 0):\r\n value+= m/2\r\n else:\r\n value+= (m-1)/2\r\n\r\nprint(int(value))\r\n\r\n\r\n", "def main():\r\n M,N=map(int,input().split())\r\n max_dominos=(M*N)//2\r\n print(max_dominos)\r\nif __name__==\"__main__\":\r\n main()", "m,n=map(int,input().split())\narea=m*n\ncount=0\nfor i in range(1,area,2):\n count+=1\nprint(count) ", "input_number_of_squares = input().split()\r\n\r\nmultiply_the_number = int(\r\n input_number_of_squares[0]) * int(input_number_of_squares[1])\r\nprint(multiply_the_number // 2)\r\n", "m,n = input().split(\" \")\r\nm = int(m)\r\nn = int(n)\r\n\r\nprint(n*m//2)", "a, b = map(int, input().split())\r\ns = a * b\r\nprint((s - s % 2) // 2)\r\n", "input1,input2 = input().split()\nmulti = int(input1)*int(input2)\nprint(multi//2)\n\t\t \t \t \t \t\t \t\t\t\t\t \t\t \t\t", "\na,b=map(int,input().split())\nif a==1 and b==1:\n print(0)\nelse:\n print(a*b//2)\n\t\t \t\t\t \t \t \t\t\t\t\t \t\t\t \t\t \t \t", "m, n = map (int, input().split())\r\nprint (int(m*n/2))", "x, y = input().split() \r\nm = int(x)\r\nn = int(y)\r\nz = m*n\r\nif (1 <= m) and (m<=n) and (n<=16) :\r\n if z%2==0 :\r\n K = z/2\r\n else:\r\n K = (z-1)/2\r\nprint (int(K))", "import sys,math\r\nl = sys.stdin.readline().strip().split(\" \")\r\nsys.stdout.write(str(math.floor((int(l[0])*int(l[1]))/2)))\r\n ", "a,b=map(int,input().split())\r\nc=a*b\r\nm=0\r\nfor i in range (c-1):\r\n if i %2==0:\r\n m+=1\r\nprint(m)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\n\r\nCreated on Tue Apr 4 17:37:07 2023\r\n\r\n@author: lenovo\r\n\"\"\"\r\nm,n=map(int,input().split())\r\ns=(m*n)//2\r\nprint(s)", "m, n = map(int, input().split())\r\ncount = n // 2\r\nif n % 2 == 0:\r\n count *= m\r\nelse:\r\n count = count * m + m//2\r\n\r\nprint(count)", "try:\r\n n, m = list(map(int, input().split()))\r\n print((n*m) // 2)\r\nexcept:\r\n pass", "M,N= map(int,input().split())\r\nif M*N%2 == 0:\r\n print(int(M*N/2))\r\nelse: \r\n print(int(M*N/2 - 1/2))", "dimensions = list(map(int, input().split()))\r\nm = dimensions[0]\r\nn = dimensions[1]\r\ndomino_paradigms = 2\r\nprint((m*n)//domino_paradigms)", "m,n=map(int,input().split())\nif m%2==0:\n sum1=m//2*n\nelse:\n sum1=m//2*n+n//2\nif n%2==0:\n sum2=n//2*m\nelse:\n sum2=n//2*m+m//2\n\nif sum1>=sum2:\n print(sum1)\nelse:\n print(sum2)\n \n", "m, n = map(int, input().split())\nif(m%2==0):\n print(int(m/2)*n)\nelse:\n print((int(m/2)*n)+int(n/2))\n \n\t\t \t\t\t \t\t\t\t\t \t\t \t \t \t\t\t", "a,b=map(int,input().split())\r\nl=a*b\r\nk=(l//2)\r\nprint(k)", "a, b = map(int, input().split())\r\nc = a * b\r\nn = int(c / 2)\r\nprint(n)\r\n", "m,n=input().split()\nm=int(m)\nn=int(n)\nd=m*n/2\nd=int(d)\nprint(d)\n\t\t \t \t\t \t\t\t \t \t \t\t", "import re\nimport sys\n\na=input()\nints=re.findall(r'\\d+', a)\nints2=[]\nfor i in range(2):\n ints2.append(int(ints[i]))\n if ints2[-1] >16 or ints2[-1]<1:\n sys.exit()\nprint(int(ints2[0]*ints2[1]/2))\n \t \t\t\t\t\t\t\t\t\t \t \t \t \t\t", "l = input()\r\nm = int(l.split()[0])\r\nn = int(l.split()[1])\r\n\r\nif m*n % 2 == 0:\r\n print(int(m*n / 2))\r\nelse:\r\n print(int((m*n - 1) / 2)) ", "\r\nx,y=map(int,input().split())\r\nn=x*y\r\nprint(n//2)", "m, n = map(int, input().split())\ntd = m * n\nmaxd = td // 2\nprint(maxd)\n", "m,n=map(int,input().split())\na=m*n\nb=a//2\nprint(b)\n\t \t \t\t\t \t \t\t\t\t\t \t\t \t \t\t \t", "A , B = map(int, input().split())\r\nif A == 1 and B == 1:\r\n print(0)\r\nelse:\r\n print(int(A * B) // 2)", "x , y = map(int,input().split())\r\nprint(int(x*y/2))", "m, n = map(int, input().split())\r\noutput = int(m*n / 2)\r\nprint(output)", "In = input()\nx = In.split()\nm = int(x[0])\nn = int(x[1])\nArea = m*n \nprint(Area//2)\n \t \t \t\t \t\t\t\t \t \t \t", "m, n = map(int, input().split())\nif m%2 == 0 or n%2==0:\n x = (m*n)/2\n print(int(x))\nelse:\n x = ((m*n)-1)/2\n print(int(x))\n", "import sys\r\n\r\nM, N = map(int, sys.stdin.readline().split())\r\n\r\nprint((M*N)//2)", "m, n = map(lambda v: int(v), input().split())\r\n\r\nif m*n % 2 == 0: print(m*n//2)\r\nelse: print(m*(n-1)//2 + (m-1)//2)\r\n", "m,n = map(int, input().split())\r\nans=0\r\nans+=(n//2)*m\r\nif n%2==1:\r\n ans+=m//2\r\nprint(ans)", "\nlength, width = [int(i) for i in input().split()]\narea = length*width\nnumber = area // 2\nprint(number)\n\n", "x, y = map(int, input().split())\r\nprint(x*y//2)", "s=input().split()\r\nm=int(s[0])\r\nn=int(s[1])\r\na=m*n//2\r\nprint(a)\r\n", "from tkinter import W\r\n\r\n\r\nw, h = input().split()\r\noutput = int(w)*int(h)//2\r\nprint(output)\r\n", "inp = input().split()\r\ninp = [int(x) for x in inp]\r\n\r\nm, n = inp[0], inp[1]\r\n \r\nif (m <= n):\r\n print((m*n)//2);", "M, N = input().split()\r\nif 1 <= int(M) <= int(N) <=16:\r\n maxdominos=int(M)*int(N)//2\r\n print(maxdominos)", "import math\r\n\r\nnums = input().split(\" \")\r\ns = int(nums[0]) * int(nums[1])\r\n\r\nres = math.floor(s / 2)\r\n\r\nprint(res)", "l, m = map(int, input().split())\r\ntotal = int(l*m / 2)\r\nprint(total)", "M, N = map(int, input().split())\n\nif M % 2 == 0 or N % 2 == 0:\n print((M*N)//2)\nelse:\n print((M*N-1)//2)\n\n\n \t \t \t\t \t \t \t \t\t\t\t", "from math import floor\r\nx = input().split()\r\nm,n = int(x[0]), int(x[-1])\r\nprint(floor(m*n*0.5))", "M, N = input().split()\r\nans = int(M)*int(N)\r\nprint(int(ans/2))", "num = input(\"\").split()\r\n\r\nM = int(num[0])\r\nN = int(num[1])\r\n\r\nprint((N*M) // 2)\r\n", "m,n = map(int,input().split())\r\nc = (m*n)%2\r\nprint(((m * n) - c) //2)", "a=input().split()\r\na=[int(i) for i in a]\r\nm=a[0]\r\nn=a[1]\r\nx=m*n\r\n\r\nif x%2==0:\r\n print(int(x/2))\r\nelse:\r\n print(int(x//2))\r\n ", "[n , m] = input().split()\r\nn = int(n)\r\nm = int(m)\r\narea = m*n \r\nanswer = area // 2\r\nprint(answer)", "m, n = map(int, input().split())\r\ntotal = int(m*n // 2)\r\nprint (total)", "piece = 2 * 1\r\nboard = input().split()\r\nrow = int(board[0])\r\ncol = int(board[1])\r\n\r\nif row * col != 0:\r\n\r\n maxI = (row * col) // piece\r\n print(maxI)\r\nelse:\r\n maxI = 0\r\n print(0)\r\n", "m,n=map(int,input().split())\r\nif m*n%2==0:\r\n\tprint(int(m*n/2))\r\nelse:\r\n\tprint(int((m*n)//2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Aug 1 17:02:54 2021\r\n\r\n@author: pena\r\n\"\"\"\r\nimport math\r\n\r\n[m,n] = map(int,input().split())\r\n\r\nprint(math.floor(m*n / 2))\r\n", "def domino_piling(m: int, n: int) -> int:\r\n\treturn int((m * n) / 2)\r\n\r\nif __name__ == '__main__':\r\n\t[m, n] = [int(s) for s in input().split()]\r\n\tprint(domino_piling(m, n))", "import sys\r\nimport math \r\n\r\ninputt = sys.stdin.readline\r\nprintt = sys.stdout.write\r\n\r\nm,n = map(int,inputt().split())\r\nprint((m*n)//2)", "import sys\r\ninput= sys.stdin.readline\r\ngi= lambda: list(map(int, input().split()))\r\nr=gi() \r\nN=r[0] #N\r\nM=r[1] #M\r\n\r\nif N==1:\r\n p=int(M/2)\r\nelif N%2!=0:\r\n p=M*int(N/2)+int(M/2)\r\nelse:\r\n p=M*(N/2)\r\n\r\n \r\nprint(int(p))\r\n\r\n", "numbers = [int(i) for i in input().split()]\r\n\r\nm = numbers[0]\r\nn = numbers[1]\r\n\r\nprint(int(m*n / 2))", "class solution:\r\n def domino(m,n):\r\n squares = m * n\r\n maximum = squares // 2\r\n return maximum\r\n \r\nm,n = map(int,input().split())\r\nres = solution.domino(m,n)\r\nprint(res)\r\n", "import math\r\nb,v=map(int,input().split())\r\nprint(math.floor(b*v/2))", "c = input().strip().split(\" \")\r\nM = int(c[0])\r\nN = int(c[1])\r\n\r\nj = M%2\r\nk = M//2\r\nl = (j*N)//2\r\ne = k*N +l\r\n\r\nprint(e)", "m, n=input().split()\nm=int(m)\nn=int(n)\n\nprint((m*n)//2)\n \t\t\t\t\t \t\t \t \t \t\t\t \t\t \t\t\t\t", "from sys import stdin\r\n\r\nM, N = map(int, stdin.readline().strip().split())\r\n\r\n# M et N sont pairs\r\nif M%2 == 0 and N%2 == 0:\r\n reponse = M * N//2\r\n\r\n# M est pair et N est impair\r\nif M%2 == 0 and N%2 != 0:\r\n reponse = M * (N-1)//2 + M//2\r\n \r\n# M est impair et N est pair\r\nif M%2 != 0 and N%2 == 0:\r\n reponse = M * N//2\r\n \r\n# M et N sont impairs\r\nif M%2 != 0 and N%2 != 0:\r\n reponse = M * (N-1)//2 + M//2\r\n\r\n# réponse\r\nprint(reponse)\r\n\r\n\r\n\r\n\r\n", "a = str(input()).split()\r\n#for i in a:\r\nif (int(a[0]) * int(a[1]))%2 == 0:\r\n print((int(a[0]) * int(a[1]))//2)\r\nelif (int(a[0]) * int(a[1]))%2 != 0:\r\n print((int(a[0]) * int(a[1]))//2 )\r\n", "import math as mt\r\nn,m = input().split()\r\n\r\nn,m = int(n), int(m)\r\n\r\nk = n*m\r\nprint(mt.floor(k/2))", "def domino(size:str):\n a, b = size.split()\n a = int(a)\n b = int(b)\n return (a * b)//2\n\nprint(domino(input()))\n\n#aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\t\t\t \t \t \t\t\t\t\t \t \t\t \t", "[n,m] = list(map(lambda x:int(x),input().split()))\r\nprint((n*m)//2)", "a, b = map(int, input().split())\r\ns = a*b\r\ns_d = 2\r\nprint(s//s_d)", "x,y=(int(x) for x in input().split())\r\nprint(x*y//2)", "a,b=input().split()\r\nx=int(a)\r\ny=int(b)\r\np=x*y\r\nz=p//2\r\nr=int(z)\r\nprint(r)", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nif b % 2 == 0:\r\n print(int(b/2*a))\r\nelif a % 2 == 0:\r\n print(int(a/2*b))\r\nelif a == b:\r\n print(int(a//2*b+b//2))\r\nelse:\r\n print(int(max(a, b) // 2 * min(a, b)+min(a, b) // 2))\r\n", "x = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\nif (a * b) % 2 == 0:\r\n print(int((a * b) / 2))\r\nelse:\r\n print(int((((a-1) * b) / 2) + b//2))", "a,b=[int(i) for i in input().split()]\r\nprint((a*b)//2)", "inputs = input().split(\" \")\r\nm = int(inputs[0])\r\nn = int(inputs[1])\r\n\r\nboard = m * n\r\n\r\nmax_dominoes = int((board - (board % 2)) / 2)\r\nprint(max_dominoes)\r\n", "m,n = input().split(' ')\r\nm=int(m)\r\nn=int(n)\r\nx = int(m*n)\r\ny = int(x/2)\r\nprint(y)\r\n", "M ,N= map(int,input().split(' '))\nsum = M*N/2\nprint(int(sum))", "\n\ndef numdomino(a,b):\n \n if (a*b)%2 == 0:\n return int((a*b)/2)\n else:\n return int(((a*b)-1)/2)\n\nl1=[int(i) for i in input().split()][:2]\n[a,b]=[l1[0],l1[1]]\nprint(numdomino(a,b))\n\n", "try:\r\n m,n = [int(i) for i in input().split(\" \")]\r\n\r\n if m >= 1 and m >= 1 and n >= m and m <= 16 and n <= 16:\r\n print(int(m*n//2))\r\n\r\nexcept: pass", "from math import floor\r\n\r\nm, n = map(int, input().split())\r\n\r\n\r\nprint(floor(m * n / 2))\r\n", "import math\r\nm,n = map(int, input().split())\r\n# hitung luas persegi panjangnya terlebih dulu\r\nluas = m*n\r\n#karena 1 domino mengambil 2 kotak maka dibagi dengan 2\r\nisi = luas/2\r\n# dibulatkan ke bawah supaya hasilnya bilangan bulat\r\nprint(math.floor(isi))", "n=list(map(int,input().split(\" \")))\r\nx=n[0]*n[1]\r\nprint(int(x/2))", "if __name__ == '__main__':\n m, n = map(int, input().split())\n m, n = min(m,n), max(m,n)\n\n print(m * n // 2)\n", "m, n = map(int, input().split())\r\nif (m*n)%2==0 :\r\n a = (m*n)/2\r\n a = int(a)\r\n print (a)\r\nelse :\r\n b = ((m*n) - 1) /2\r\n b = int(b)\r\n print (b)", "import sys\r\nnumera = [int(i)for i in sys.stdin.readline().split()]\r\nm = numera[0]\r\nn = numera[1]\r\nprint(int(m*n/2))", "a,b=map(int,input().split())\r\nif a*b%2==0:\r\n print(a*b//2)\r\nelse:print((b-1)*a//2+a//2)\r\n", "m , n = map(int,input().split())\r\na = m*n\r\nprint(a//2)", "x, y= map(int, input().split())\r\nLENGTH = 2\r\nWIDTH = 1\r\nnumber_of_dominos = 0\r\n\r\nif (x%LENGTH) != 0:\r\n number_of_dominos = ((x//LENGTH)*(y//WIDTH))+(1 * (y//2))\r\nelse:\r\n number_of_dominos = ((x//LENGTH)*(y//WIDTH))\r\n\r\nprint(number_of_dominos)\r\n", "x=list(map(int,input().strip().split()))[:2]\r\nm=x[0]\r\nn=x[1]\r\nprint((m*n)//2)", "surface=input()\r\nn,m=surface.split()\r\nn=int(n)\r\nm=int(m)\r\narea=n*m\r\ndomino=int(2)\r\nnum_domino=area//domino\r\nprint(num_domino)\r\n", "n , m = map(int, input().split())\r\nprint(int((n*m)/2))", "a=input().split()\r\n\r\nif int(a[0])==int(a[1]):\r\n max=min=int(a[0])\r\nelif int(a[0])>int(a[1]):\r\n max=int(a[0])\r\n min=int(a[1])\r\n\r\nelse:\r\n max=int(a[1])\r\n min=int(a[0])\r\n\r\nans=(max*1)*(min//2)+(min%2)*(max//2)\r\nprint(ans)\r\n", "m, n = str(input()).split(\" \")\r\nm = int(m)\r\nn = int(n)\r\n\r\noutput = 0\r\n\r\nremainingSpace = m*n\r\n\r\nwhile remainingSpace > 1:\r\n output += 1\r\n remainingSpace -= 2\r\n\r\nprint(output)", "import math\r\nx=input()\r\nb=[]\r\nb=x.split()\r\nprint(math.floor((int(b[0])*int(b[1]))/2))", "import math\r\n\r\na, b = map(int, input().strip().split(\" \"))\r\n\r\nprint(math.floor(a*b/2))\r\n", "r, c = map(int, input().split())\r\nprint((r*c)//2)", "def dominopilling():\r\n n,m = map(int,input().split())\r\n prod = (n * m ) \r\n val_1 = prod//2\r\n print(val_1)\r\ndominopilling()", "n, m = map(int, input().split())\r\n# a = list(map(int, input().split()))\r\nif (n * m) % 2 == 1:\r\n print(int(((n * m) - 1) / 2))\r\nelse:\r\n print(int((n * m) / 2))\r\n", "M,N=[int(i) for i in input().split()]\nfrom math import floor\nprint(floor(N*M/2))", "M ,N = input().split()\r\nM = int(M)\r\nN = int(N)\r\ncount = int((N*M)/2) if N*M%2 ==0 else (N*M)//2\r\nprint(count)", "M, N = [int(num) for num in input().split()]\r\nprint((M*N)//2)", "class Solver:\r\n \r\n def solve(self, n, m):\r\n return n * m // 2\r\n\r\nif __name__ == \"__main__\":\r\n \r\n i = 0\r\n teamAnswers = list()\r\n n, m = map(int, input().split())\r\n\r\n solver = Solver()\r\n print(solver.solve(n, m))", "n , k = map(int , input().split())\r\nprint((n*k)//2)", "import math\r\n\r\nx=input().split(' ')\r\nn=int(x[0])\r\nm=int(x[1])\r\nprint((m*n)//2)", "n,k=map(int,input().split())\r\nprint(int((n*k )/2))", "L =list(map(int,input().split()))\r\nm = 1\r\nfor i in range(2):\r\n m = m*L[i]\r\nprint(m//2)", "ip1,ip2=map(int,input().split())\nprint(ip1*ip2//2)#aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n \t \t\t \t\t \t \t \t\t \t\t\t \t\t\t\t\t\t", "linea = input()\r\nvalores = linea.split(' ')\r\n\r\nN = int(valores[0])\r\nM = int(valores[1])\r\narea = N * M\r\n\r\nif area % 2 == 0:\r\n minimo = area / 2\r\n\r\nelse:\r\n minimo = area // 2\r\n\r\nprint(int(minimo))", "def max_dominos(m,n):\r\n totalSquares=m*n\r\n maxDominos=totalSquares // 2\r\n return maxDominos\r\n\r\nm,n=map(int,input().split())\r\n\r\nprint(max_dominos(m,n))", "a,b = map(int,input().split())\r\nnum = a * b // 2\r\nprint(num)", "x,y = map(int,input().split())\r\ns = (x*y)\r\nv = s//2\r\nprint(v)", "a , b = map(int,input().split())\r\nn = (a*b)//2\r\nprint(n)", "a = str(input()).split()\r\nb,c = int(a[0]), int(a[1])\r\nprint(b*c//2)\r\n", "m, n = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nprint(int(m*n/2))\r\n\r\n", "problem = input().split()\nproblemInt = list(map(int, problem))\nif problemInt[0] >= 1 and problemInt[0] <= problemInt[1] and problemInt[1] <= 16:\n tamanho = (problemInt[0] * problemInt[1]) / 2\n print(int(tamanho))\n \t\t \t\t\t \t\t \t \t \t\t\t \t\t \t\t\t \t\t", "x = [int(x) for x in input().split(\" \")]\r\n\r\nluas = x[0] * x[1]\r\n\r\nprint(luas//2)", "if __name__ == \"__main__\":\r\n a,b = map(int, input().split(\" \"))\r\n A = a*b\r\n x= 2*1\r\n print(A//x)\r\n #print(a)\r\n #print(b)\r\n", "from math import floor\r\nm,n=map(int,input().split())\r\nv=(m/2)*(n/1)\r\nprint(floor(v))", "def compute_numberofdominoes(x, y):\r\n squareofnumbers = x * y\r\n squareofdominoes = 2 * 1\r\n numberofdominoes = squareofnumbers // squareofdominoes\r\n return numberofdominoes\r\n\r\nnum1, num2 = input().split()\r\nnum1 = int(num1)\r\nnum2 = int(num2)\r\nnumberofdominoes = compute_numberofdominoes(num1, num2)\r\nprint(numberofdominoes)\r\n\r\n", "a, b = (input().split(\" \"))\r\na = int(a)\r\nb = int(b)\r\narea = a*b\r\nans = area // 2\r\n \r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jul 14 15:01:09 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nMN = input()\r\nMN_list = MN.split()\r\nM = int(MN_list[0])\r\nN = int(MN_list[1])\r\n\r\nx = M*N\r\n\r\nif x % 2 == 1:\r\n print(int((x-1) / 2))\r\nelse:\r\n print(int(x / 2))", "#M,N=map(int,input.split())\r\nM, N=[int(x) for x in input().split()]\r\nprint((M*N)//2)\r\n", "m,n=input().split()\nx=int((int(m)*int(n))/2)\nprint(x)\n \t\t \t\t \t\t\t\t\t\t\t \t\t \t\t\t\t\t \t", "M,N=map(int,(input().split()))\r\ns=M*N\r\nprint(int(s/2))", "import math\r\nm,n = [int(x) for x in input().split()]\r\nm,n = max(m,n),min(m,n)\r\n\r\nresult = (m*n)//2\r\n\r\nprint(result)", "n,m = map(int,input().split())\r\n\r\nprint(n*m // 2)", "M , N = [int(A) for A in input().split()]\r\n\r\nprint(int((M * N) / 2))", "m,n = map(int, input().split())\ndomin = 2\n\ns = m * n\n\nprint(int(s / domin))", "def domino_piling():\r\n number = list(map(int, input().split()))\r\n total = number[0] * number[1]\r\n\r\n print(int(total/2))\r\n\r\n\r\ndomino_piling()", "mn = [int(i) for i in input().split()]\r\n\r\nsquarestotal = mn[0] * mn[1]\r\n\r\ndominoes = squarestotal//2\r\n\r\nprint(dominoes)\r\n", "n,m = map(int , input().split())\r\nprint((n*m)//2)", "x,y=map(int,input().split())\r\nprint((x*y)//2)", "a, b = map(int, input().split())\r\nmaxx, minn = max(a, b), min(a, b)\r\nif maxx % 2 and minn % 2:\r\n print((maxx // 2) * minn + minn // 2)\r\nelif not maxx % 2:\r\n print((maxx // 2) * minn)\r\nelse:\r\n print((minn // 2) * maxx)\r\n", "a, b = map(int, input().split())\n\narea = a*b\n\nnum = area//2\nprint(num)\n \n \n", "m , n = input().split()\r\nprint(int(int(m)*int(n)/2))", "n,x = map(int,input().split())\r\nk = n*x\r\nprint(k//2)", "a,b=map(int,input().split())\r\nc=0\r\nwhile(a>=2):\r\n c+=b\r\n a=a-2 \r\nif(a==1):\r\n while(b>=2):\r\n c+=1\r\n b=b-2\r\nprint(c)", "m,n = input().split();\r\nm = int(m);\r\nn= int(n);\r\nd_pices = 2*1;\r\nbord_size = m*n;\r\n\r\nprint(int(bord_size/d_pices))", "import math\r\nM, N = input(\"\").split()\r\nM, N = int(M), int(N)\r\nnumber = (M * N) / 2\r\nprint(math.floor(number))\r\n", "import math\r\na,b=input().split()\r\n\r\nx=(int(a)*int(b))/2\r\n\r\nprint(math.floor(x))\r\n", "import math\r\n\r\nm, n = map(int, input().split())\r\n\r\nresult = m // 2\r\nresult *= n\r\n\r\nif m % 2 != 0:\r\n result += n // 2\r\n\r\nprint(result)\r\n", "m,n=input().split()\r\nn = int(n)\r\nm = int(m)\r\nprint(m*n//2)\r\n", "M,N=map(int,input().split())\r\noutput=0\r\nnumberOfSquares=0\r\n# the main solution for the problem will be written here\r\nif M<=1 and N<=1:\r\n print(output)\r\nelse:\r\n numberOfSquares=M*N\r\n output=numberOfSquares//2\r\n print(output)", "m,n = input().split(' ')\r\nm = int(m)\r\nn = int(n)\r\nhold = (m*n)/2\r\nhold = int(hold)\r\nprint(hold)", "a=list(map(int,input().split()))\r\nprint((a[0]*a[1])//2)", "MandN = input().split()\n\nif (int(MandN[0]) *int( MandN[1]) % 2) == 0:\n print(int(int(MandN[0]) * int(MandN[1]) / 2))\nelse:\n print(int(int(MandN[0]) *int( MandN[1]) / 2 - 0.5 ))\n", "a, b = map(int, input().split())\r\nprint(int(a*b/2))\r\n", "x, y = input().split()\r\n\r\nx = int(x)\r\ny = int(y)\r\nrect_sq = x*y\r\nn = rect_sq // 2\r\n\r\nprint(n)\r\n\r\n\r\n", "M,N=map(int,input().split())\nif 1<=M and 1<=N and M<=N and M<=16 and N<=16:\n print((M*N)//2)\n\t \t\t \t \t \t\t \t\t \t \t \t", "p = input().split()\r\n\r\nvp = int(p[0]) * int(p[1])\r\nprint(vp // 2)", "def main():\r\n a = input()\r\n m = str(); n = str()\r\n nx = False\r\n for i in a:\r\n if i == ' ':\r\n nx = True\r\n if nx:\r\n n += i\r\n else:\r\n m += i\r\n m = int(m); n = int(n)\r\n size = 2*1\r\n k = int(m*n/size)\r\n print(k)\r\n \r\nif __name__ == '__main__':\r\n main()", "m, n = map(int, input().split(\" \"))\r\n\r\nboard = m * n\r\n\r\nmax_dominno = board // 2\r\n\r\nprint(max_dominno)", "x,y= map(int, input().split())\r\na=x*y\r\nprint(a//2)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nprint (int(n * m /2))", "m,n = map(int,input().split())\r\nif(m%2==0):\r\n print(int((m*n)/2))\r\nelse:\r\n print(int(((m-1)*n)/2 + n/2 ) )\r\n", "import math\r\nm_n = input().split()\r\nif m_n[0] == 1 and m_n[1] == 1:\r\n print(0)\r\nelse:\r\n z = math.floor(int(m_n[0]) * int(m_n[1]) / 2)\r\n print(z)", "x = [int(a) for a in input().split()] \r\nif(1 <= x[0] <= x[1] <= 16):\r\n a = x[0]/2 * x[1]\r\n if(a == int(a)):\r\n print(int(a))\r\n else:\r\n print(int(a - 0.5))\r\n", "num=(input())\r\nm,n=num.split(\" \")\r\n\r\nm=int(m)\r\nn=int(n)\r\n\r\narea=m*n\r\n\r\nprint(area//2) ", "l=input()\r\ni = int(l.index(\" \"))\r\nx=int(l[:i])\r\ny=int(l[i+1:])\r\nif (x * y)%2 == 0:\r\n print((x*y)//2)\r\nelse:\r\n print(((x*y)-1)//2)", "v = input().split(' ')\r\nm = int(v[0])\r\nn = int(v[1])\r\nt1 = m%2\r\nt2 = n%2\r\n\r\nif t1==0:\r\n temp = m//2\r\n print(temp*n)\r\nif t2==0 and t1!=0:\r\n temp = n//2\r\n print(temp*m)\r\nif t1!=0 and t2!=0:\r\n print(n*(m//2)+(n//2))\r\n ", "dim = input()\nx, y = [int(i) for i in dim.split(' ')]\nprint((x*y) // 2)\n", "x,y=map(int,input().split())\nif x%2==0 and y%2==0:\n\tprint(x*y//2)\nelif x%2==1:\n\tr1=(x-1)*y//2\n\tr2=y//2\n\tprint(r1+r2)\nelse:\n\tr1=(y-1)*x//2\n\tr2=x//2\n\tprint(r1+r2)\n \t \t \t \t\t \t \t\t \t\t \t\t \t", "m, n = map(int, input().split())\r\n\r\ndef num_doms(m, n):\r\n area = m*n\r\n num_doms = int(area/2)\r\n print(num_doms)\r\n \r\nnum_doms(m, n)", "M, N = map(int, input().split())\r\nif M % 2 == 0:\r\n print((M // 2) * N)\r\nelse:\r\n print((M // 2) * N + (N // 2))", "m, n = [int(i) for i in input().split()]\r\nprint((m*n)//(2))", "m,n=map(int,input().split())\r\nx=m*n\r\nans=x//2\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\nif (a*b) % 2 == 1:\r\n print(int((a*b-1)/2))\r\nelse: print(int((a*b)/2))", "n,k=[int(i)for i in input().split()]\r\nprint(n*k//2)", "m,n = input().split()\r\n\r\nm,n = int(m), int(n)\r\n\r\nprint ( (m * n) // 2)", "n, m = map(int, input().split())\r\nx=m*n\r\n\r\nif x==1:\r\n print(0)\r\nif x>1:\r\n if x%2==0:\r\n print(int(x/2))\r\n else:\r\n print(int(x//2))", "E,D = map(int, input().split())\ntotal_squares = E * D\nmax_dominoes = total_squares // 2\nprint(max_dominoes)\n \t \t \t \t\t\t \t\t\t \t\t \t \t", "l=[int(x) for x in input().split()]\r\nsq=l[0]*l[1]\r\nreq=sq//2\r\nprint(req)", "n = list(map(int,input().split()))\narea = n[0]*n[1]\nprint(area//2)\n", "a , b = input().split(' ')\nm = int(a)\nn = int(b)\ns = m*n\nf = int(s/2)\nprint(f)", "m, n = input().split()\nm = int(m)\nn = int(n)\n\nif m % 2 != 0 and n % 2 != 0:\n new_n = n // 2\n ans = new_n * m\n ans += m // 2\n print(ans)\nelse:\n print(m * n // 2)\n", "rectangle_size = input().split()\r\nm = int(rectangle_size[0])\r\nn = int(rectangle_size[1])\r\ndomino = (m*n)//2\r\nprint(domino)", "\r\nm,n = [int(i) for i in input().split(\" \")]\r\ncuadrados = m * n\r\nif cuadrados % 2 == 0:\r\n cuadrados = cuadrados / 2\r\nelse:\r\n cuadrados = (cuadrados - 1) / 2\r\nprint(int(cuadrados))\r\n", "M , N = input().split()\nM = int(M) ; N = int(N)\nprint(int((M*N)/2))\n\t\t \t \t \t \t \t\t\t\t\t \t \t\t\t \t\t \t\t", "a = input().split(' ')\r\ns = int(a[0]) * int(a[1])\r\nif s%2 == 0:\r\n print(int(s/2))\r\nelse:\r\n print(int((s-1)/2))", "import sys\r\nl = [int(x) for x in sys.stdin.readline().split()]\r\nprint(int((l[1] * l[0])/2))", "m,n=map(int,input().split())\r\nif m%2==n%2==0:\r\n print((m*n)//2)\r\nelif (m%2==1 and n%2==0) or (m%2==0 and n%2==1):\r\n print((m*n)//2)\r\nelse:\r\n print((m*n)//2)\r\n \r\n", "from math import floor\r\nm,n=map(eval,input().split())\r\np=m*n\r\ni=p//2\r\nprint(i)\r\n", "Width, Length = map(int, input().split())\r\n\r\nif Width*Length % 2 == 0 :\r\n print(str(int(Width*Length/2)))\r\nelse:\r\n print(str(int(Width*Length/2-0.5)))", "num_array=input().split()\r\na=num_array[0]\r\nb=num_array[1]\r\nm = int(a)*int(b)\r\nx =int(m/2)\r\nprint(x)\r\n", "import math\r\nm,n=map(int,input().split())\r\nsize=m*n\r\noutput=math.floor(size/2)\r\n\r\nprint(output)", "def maxDominos(size):\r\n values = size.split(\" \")\r\n max_dom = (int(values[0]) * int(values[1]))//2\r\n return max_dom\r\n\r\n\r\nsize = input()\r\nresult = maxDominos(size)\r\nprint(result)", "m,n = map(int,input().split())\r\nx = int((m*n)/2)\r\nprint(x)\r\n", "m,n =map(int,input().split())\r\nif m*n%2 == 0:\r\n print(int(m*n/2))\r\nelse:\r\n if m*n == 1:\r\n print(0)\r\n else:\r\n x = (m*n-1)/2\r\n print(int(x))", "def main():\r\n arr = input().split()\r\n m = int(arr[0])\r\n n = int(arr[1])\r\n print(int((m*n)/2))\r\nmain()", "# -*- coding: utf-8 -*-\n\"\"\"Untitled4.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1us923IrBz7UMZxLi5A0XMZnEUfWSYsAC\n\"\"\"\n\nm, n = map(int, input().split())\nsize_of_box = m * n\nsize_of_domino = 2\ntotal_number = size_of_box // size_of_domino\nprint(total_number)\n\n", "m, n =[int(x) for x in input().split()]\r\nans = 0\r\nif m%2 != 0 and n%2 !=0:\r\n ans = (m*n - 1)/2\r\nelse:\r\n ans = (m*n)/2\r\nprint(int(ans))", "\nnumber = input()\nM = int(number.split()[0])\nN = int(number.split()[1])\n\nif M == 1 and N == 1:\n print ( 0)\nelse:\n print( M*N//2)", "x=input().split()\r\na,b=int(x[0]),int(x[1])\r\nc=int(a*b/2)\r\nprint(c)", "[row, col] = [eval(x) for x in (input().split())]\r\narea = row*col\r\nprint(area//2)\r\n", "n=list(map(int,input().split()))\r\nprint((n[0]*n[1])//2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 22 21:56:39 2023\r\n\r\n@author: marvi\r\n\"\"\"\r\nimport math\r\nm,n = map(int,input().split())\r\n\r\nprint(int(math.floor(m*n/2)))", "if __name__ == '__main__':\n n, m = map(int, input().split(' '))\n\n print(int(n*m/2))\n\n\t\t \t\t\t\t \t\t \t\t\t\t \t \t \t", "import math\r\nm,n=map(int,input().split())\r\nprint(math.floor((m*n)/2))", "#sherlocked \r\nn,m=[int(n) for n in input().split()]\r\nif n>=1 and m>=1 and n<=16 and m<=16:\r\n\ts=((n*m)/2)\r\nprint(int(s)) \r\n", "a,b=map(int,input().split())\r\nq=(min(a,b)//2)*max(a,b)+min(a,b)%2*max(a,b)//2\r\nprint(q)\r\n", "size = list(map(int, input().split(' ')))\r\n\r\narea = size[0]*size[1]\r\n\r\nprint(area // 2)", "line = input()\ntt = line.split(\" \")\nx = int(tt[0])\ny = int(tt[1])\n\nfx = x - (x%2)\nfy = y - (y%2)\n\nfz = fx * fy//2\ngy = (y%2) * x//2 \ngx = (x%2) * y//2\n\nans = fz + gy + gx\nprint(ans)", "m,n=map(int,input().split())\r\nx=m*n\r\nif (x%2==0):\r\n print(x//2)\r\nelse:\r\n print((x-1)//2)\r\n ", "rows,cols=map(int,input().split())\r\ndominos=0\r\nif cols%2==0 :\r\n dominos=(cols/2)*rows\r\n print(int(dominos))\r\nelse :\r\n dominos=((cols//2)*rows)+(rows//2)\r\n print(int(dominos))", "import math\r\n\r\ndef read_input():\r\n global M \r\n global N \r\n M, N = [int (x) for x in input().split()]\r\n\r\ndef print_output():\r\n result = math.floor(M/2 * N)\r\n print(result)\r\n\r\ndef main():\r\n read_input()\r\n print_output()\r\n\r\nmain()", "import math\r\nM, N =[int(i) for i in input().split()]\r\nprint(M*N // 2)", "m,n = map(int,input().split())\r\nprint(int(m*n)//2)", "n,m = input(\"\").split()\r\nn = int(n)\r\nm = int(m)\r\nresult = int(n*m/2)\r\nprint(result)", "# M and N are the sides of the rectangular board\n\nM, N = map(int, input().split())\n\nboard_area = M*N\n\n#Domino dimenstions = 2x1; given\ndomino_area = 2\n\nnum_of_dominos=board_area//domino_area\n\nprint(num_of_dominos)\n", "a, b= map(int, input().split())\r\n\r\nx=a*b\r\ny=x//2\r\nprint(y)", "def solve(m: int, n: int):\r\n\tv = m*n\r\n\tv_domino = 2\r\n\tif v%2 != 0:\r\n\t\tv -= 1\r\n\treturn v//v_domino\r\n\r\nm, n = [int(x) for x in input().split()]\r\nprint(solve(m, n))", "# cook your dish\r\nl,b = list(map(int, input().rstrip().split(' ')))\r\n# arr = list(map(int, input().rstrip().split(' ')))\r\nprint((l*b)//2)\r\n", "\r\ndomino=input().split()\r\ndomino=int(domino[0])*int(domino[1])\r\n\r\nif domino%2!=0:\r\n domino-=1\r\n\r\nprint(domino//2)\r\n", "def domino_fit(x, y):\r\n return (x*y)//2\r\n\r\n\r\nwhile True:\r\n m, n = [int(x) for x in input().split()]\r\n if(m>=1 and m<=n and m<=16 and n<=16 and n>=1):\r\n break\r\n\r\nprint(domino_fit(int(m), int(n)))\r\n", "str1, str2 = input().split(\" \")\r\nfi = int(str1)\r\nsi = int(str2)\r\nif 1 <= fi <= si <= 16:\r\n if fi % 2 == 0:\r\n print(int((fi / 2) * si))\r\n else:\r\n if si % 2 == 0:\r\n print(int(((fi - 1) / 2) * si + (si/2)))\r\n else:\r\n print(int(((fi - 1) / 2) * si + ((si -1) / 2)))", "m , n=[int(num) for num in input().split(\" \", 1)]\r\nprint((m*n)//2)", "import math\r\nn, m =map(int, input().split())\r\ncount=(m*n)/2\r\nprint(math.floor(count))", "m,n = map(int, input().split())\r\nresult = ((m*n)//2)\r\nprint(result)", "import sys\n\nif __name__ == '__main__':\n\n input_line = sys.stdin.readline()\n m, n = input_line.rstrip('\\n').split(' ')\n area = int(m) * int(n)\n if area % 2 == 0:\n print(int(area / 2))\n else:\n print(int((area - area % 2) / 2))\n", "m, n = map(int, input().split())\r\ns = (m * n) / 2\r\ncounter = 0\r\nn = True\r\nwhile s >= 1:\r\n counter += 1\r\n s -= 1\r\nprint(counter)\r\n", "M, N = input().split() \r\nM = int(M)\r\nN = int(N)\r\nprint(int(M*N/2))\r\n", "ans = input()\r\nans = list(map(int,ans.split(\" \")))\r\n\r\ndef dominos(m,n):\r\n if m == 0 or n == 0:\r\n return 0\r\n\r\n elif m == 2:\r\n return n\r\n elif n == 2 :\r\n return m\r\n\r\n elif m == 1:\r\n return n//2\r\n elif n == 1:\r\n return m//2\r\n\r\n else:\r\n return dominos(m-2,n) + n\r\n\r\nprint(dominos(ans[0],ans[1]))", "M, N = input().split()\r\narea = int(M) * int(N)\r\nprint(area//2)", "m,n = map(int,input().split())\r\narea = m*n\r\nsquares = 2\r\nprint(area//squares)", "a = input()\r\na = a.split()\r\nli1 = []\r\nfor i in a:\r\n li1.append(int(i))\r\n\r\nb = li1[0] * li1[1]\r\n\r\nc = b // 2\r\nprint(c)", "m, n = list(map(int, input().split(\" \")))\n\nif m % 2 == 0 and n % 2 == 0:\n print(int(m * n /2))\nif m % 2 == 1 and n % 2 == 0:\n print(int(int(m/2) * n + n/2))\nif m % 2 == 0 and n % 2 == 1:\n print(int(int(n/2) * m + m/2))\nif m * n % 2 == 1:\n print(int(int(n/2) * m + int(m/2)))\n\n\t\t \t \t\t\t\t\t \t \t \t\t\t\t\t\t\t\t\t \t", "M, N = map(int, input().split())\r\ns=M*N\r\nprint(s//2)", "inpt = input()\r\n\r\ninpt = inpt.split()\r\nM = int(inpt[0])\r\nN = int(inpt[1])\r\n\r\nif (M*N)%2 == 1:\r\n\tprint(int((M*N-1)/2))\r\nelse:\r\n\tprint(int(M*N/2))", "n, m = map(int, input().split())\n\nres = n//2*m + n%2*m//2\nprint(res)", "mn = input().split(' ')\r\n\r\nm = int(mn[0])\r\nn = int(mn[1])\r\n\r\ncount = 0\r\n\r\ndomino = 2 * 1\r\nboard = m * n\r\n\r\nprint(board // domino)\r\n", "a = input().split()\r\ntemp = list(map(int, a))\r\nn, m = temp[0], temp[1]\r\nprint((n * m) // 2)", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\nif(m==1 and n==1):\r\n print(0)\r\nelse:\r\n print((m*n)//2)", "x,y=map(int,input().split(\" \"))\nif (x*y)%2==0:\n print(int((x*y)/2))\nelse:\n print(int((((x*y)+1)/2)-1))\n \t\t\t\t\t\t\t \t \t\t \t\t\t\t\t \t\t\t\t \t\t", "m,n = list( map(int, input().split()) )\r\nprint(int((m*n)/2))", "a = list(map(int,input().split()))\r\nm=a[0]\r\nn=a[1]\r\n\r\nif(m==1 and n==1):\r\n print(\"0\")\r\n\r\nelif(m%2==0):\r\n print(m//2 * n)\r\n\r\nelif(n%2==0):\r\n print(n//2 * m)\r\n\r\nelse:\r\n a=max(m,n)\r\n b=min(m,n)\r\n print( ((a-1)//2)*b + b//2)\r\n \r\n", "data = input().split(\" \")\r\nm = int(data[0])\r\nn = int(data[1])\r\n\r\ntotal = ((n // 2) * m) + ((n % 2) * (m // 2))\r\nprint(total)", "# You are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n# - Each domino completely covers two squares.\n# - No two dominoes overlap.\n# - Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n# Find the maximum number of dominoes, which can be placed under these restrictions.\nstr = input( ).split(\" \")\nm = int(str[0])\nn = int(str[1])\n\nif m == 1 and n == 1:\n print(0)\nelse:\n print(int(m * n)//2)", "dimensions = list(map(int,input().split()))\nprint((dimensions[0]*dimensions[1])//2)", "m,n = list(map(int,input().strip().split()))\r\nprint(m*n//2)", "d=[int(x) for x in input().split(' ')]\r\nploca=d[1] * d[0]\r\n\r\nif ploca%2==0 :\r\n print(int(ploca/2))\r\nelse:\r\n if (int(ploca/2) % 2) == 0:\r\n print(int(round(ploca/2)))\r\n else:\r\n \r\n print(int(round(ploca/2))-1)\r\n", "m,n = map(int,input().split())\r\nc = m*n\r\nd =c//2\r\nprint(d)", "m, n = map(int,input().split())\n\nif m<1 or m>16 or n<1 or n>16:\n print(\"Wrong Range\")\nelse:\n print(m*n//2)\n\t\t \t\t\t\t\t\t \t\t \t \t\t \t\t\t\t \t\t", "def main():\n [M, N] = list(map(int, input().split(\" \")))\n count_dominoes = 0\n\n for _ in range(N):\n for _ in range(1, M, 2):\n count_dominoes += 1\n \n if M % 2 != 0:\n # if there is another row that was not considered\n for _ in range(1, N, 2):\n count_dominoes += 1\n \n print(count_dominoes)\n\nif __name__ == \"__main__\":\n main()", "x, y = map(int,input().split())\r\na = x * y \r\nif a // 2 >= 0:\r\n b = a // 2 \r\n print(b)", "M,N=map(int,input().split())\r\nk=M*N\r\nprint(k//2)", "import math\nn,m = input().split()\nn = int(n)\nm = int(m)\nz = math.floor((n*m)/2)\nh = int(z)\nprint(h)\n \t\t \t \t\t \t \t\t \t \t\t \t \t", "M, N = map(int, input().split())\r\nnum = (M*N) // 2\r\nprint(num)", "board_size = list(map(lambda x: int(x), input().split(\" \")))\r\n \r\nm = board_size[0]\r\nn = board_size[1]\r\n\r\ndef number_of_dominos(n, m):\r\n if m <= 1 and n <= 1:\r\n print(0)\r\n return\r\n \r\n dominos = n * (m // 2)\r\n if m % 2 != 0:\r\n dominos += n // 2\r\n \r\n print(dominos)\r\n\r\nnumber_of_dominos(n, m)", "n = input()\r\nnum = int(n[0:n.find(\" \")])*int(n[n.find(\" \")+1:])\r\n\r\nif num % 2 == 0:\r\n print(num//2)\r\nif num % 2 != 0:\r\n print(num//2)", "try:\r\n m,n=map(int,input().split())\r\n c=m*n\r\n d=c//2\r\n print(d)\r\nexcept:\r\n pass ", "a,b = map(int,input().split())\r\ns = a*b\r\nprint(s//2)", "h, c = map(int, input().split())\nmax_dominoes = (h * c) // 2\nprint(max_dominoes)\n\t\t \t \t \t\t\t\t\t \t \t \t \t\t \t", "a,b=map(int,input().split())\r\nc=((a*b)//2)\r\nprint(c)", "l=list(map(int,input().split()))[:2]\r\nprint((l[0]*l[1])//2)", "M, N = list(map(int, input().split(\" \")))\r\nanswer = 0\r\nwhile M > 1:\r\n for _ in range(N):\r\n answer += 1\r\n M -= 2\r\n\r\nif M == 1:\r\n answer += N//2\r\nprint(answer)", "info=list(map(int,input().split()))\r\na=info[0]\r\nb=info[1]\r\nif (a*b)%2==0:\r\n print(int(a*b/2))\r\nelse:\r\n print(int(((a*b)-1)/2))", "def main():\r\n stdin = input().split()\r\n stdin_ = list(map(int, stdin))\r\n n,m = stdin_[1],stdin_[0]\r\n pole = m * n\r\n pole_domino = 2\r\n return pole//pole_domino\r\n\r\nx = main()\r\nprint(x)", "M,N=map(int,str(input()).split())\r\nif M!=1 or N!=1:\r\n if (M*N)%2==0:\r\n print(int((M*N)/2))\r\n else:\r\n print(int((M*N-1)/2))\r\nelse:\r\n print(0)", "m,n = (int(i) for i in input('').split(' '))\nk = n\ncnt = 0\nwhile m > 1:\n k = n\n while k > 0:\n cnt += 1\n k -= 1\n m -= 2\nif m > 0:\n while n > 1:\n n -= 2\n cnt +=1\nprint(cnt)\n\n", "a,b=map(int,input().split())\r\nc=(a*b)//2\r\nprint(c)", "nb=input()\r\nx=nb.split(\" \")\r\nif (len(x)==2):\r\n L=[]\r\n for j in range(int(x[1])):\r\n L.append(0)\r\n List=[]\r\n for i in range(int(x[0])):\r\n L1=L.copy()\r\n List.append(L1) \r\n k=0\r\n for i in range(len(List)):\r\n for j in range(len(L)):\r\n if (i != len(List)-1 and j != len(L)-1) :\r\n if(List[i][j]==0 and List[i][j+1]==0):\r\n List[i][j]=1\r\n List[i][j+1]=1\r\n k+=1\r\n elif (List[i][j]==0 and List[i+1][j]==0):\r\n List[i][j]=1\r\n List[i+1][j]=1\r\n k+=1\r\n elif(i == len(List)-1 and j != len(L)-1):\r\n if(List[i][j]==0 and List[i][j+1]==0):\r\n List[i][j]=1\r\n List[i][j+1]=1\r\n k+=1\r\n elif(j == len(L)-1 and i != len(List)-1):\r\n if (List[i][j]==0 and List[i+1][j]==0):\r\n List[i][j]=1\r\n List[i+1][j]=1\r\n k+=1\r\n print(k)\r\nelse:\r\n print('erreur')", "m,n=map(int,input().split())\na=m*n\nans=a//2\nprint(ans)\n\t \t \t\t \t \t\t\t\t\t \t\t\t \t \t\t\t", "import math\n\nfirst = input().split()\n\nM, N = [int(x) for x in first]\n\nprint(math.floor((M * N) / 2 ))\n", "a,b=map(int,input().split())\r\nprint(int((a*b)/2))", "def maximumDomino(size1,size2):\r\n area=size1 * size2\r\n result=area // 2\r\n return result\r\nsize1, size2 = map(int, input().split())\r\nprint(maximumDomino(size1,size2))", "height, weight = map(int, input().split(' '))\r\ncapacity = height*weight\r\nprint(int(capacity / 2))", "def main():\r\n [n, m] = [int(x) for x in input().split()]\r\n return n*m // 2\r\n\r\nif __name__ == \"__main__\":\r\n print(main())\r\n", "my_input = str(input()).split()\r\nwidth, height = int(my_input[0]), int(my_input[1])\r\n\r\ndimention = width * height\r\n\r\nprint(dimention // 2)", "user = input()\r\nspliter = user.split(' ')\r\nm = int(spliter[0])\r\nn = int(spliter[1])\r\nprint((m*n)//2)", "in_nm = input()\r\nint_nm = [int(x) for x in in_nm.split(' ')]\r\nprint(int(int_nm[0] * int_nm[1] / 2))", "a, b=map(int,input().split())\r\npro = a * b\r\ndiv = pro//2\r\nprint(div)", "import math\r\nm, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nans = m * n / 2\r\nprint(int(ans))\r\n\r\n", "n,m=map(int,input().split())\r\ns=n*m\r\nc=0\r\nwhile s>1:\r\n s-=2\r\n c+=1\r\nprint(c)", "x, y =map(int, input().split(\" \"))\r\nprint((x*y)//2)", "a, b = map(int, input().split())\ndef domino(c,d):\n return int((a*b)/2)\nprint(domino(a, b))\n \n\n", "n=input()\r\nlst=n.split()\r\nm=int(lst[0])\r\ns=int(lst[1])\r\na=m*s\r\nq=a/2\r\nprint(int(q))\r\n", "M,N=map(int,input().split())\r\nmax_domi=(M*N)//2\r\nprint(max_domi)", "m,n=map(int,input().split())\r\na=m*n\r\nc=a//2\r\nprint(c)", "m,n=input().split()\r\nprint(str((int(m)*int(n))//2))", "all_inputs = input().split(' ')\r\nn = int(all_inputs[0])\r\nm = int(all_inputs[1])\r\n \r\n\r\ncount = 0\r\n\r\nif (m * n) % 2 == 0:\r\n count = (m * n) / 2 \r\n\r\nif (m * n) % 2 != 0:\r\n count = (m * n) // 2\r\n \r\nprint(int(count))\r\n", "a, b = map(int, input().split())\n\nif a % 2 == 0:\n ans = (a/2)*b\nelif b % 2 == 0:\n ans = (b/2)*a\nelse:\n ans = (((a-1)/2)*b) + ((b-1)/2)\n\nans = int(ans)\nprint(ans)\n", "#DOMINO PILING\r\nm,n = map(int, input().split())\r\n\r\ndef domino(m,n):\r\n if m <=16 and m>=1 and n <=16 and n>=1:\r\n LW = m*n\r\n return(LW//2)\r\n\r\nprint(domino(m,n))", "a, b=map(int,input().split())\r\nm=(a*b)//2\r\nprint(m)", "m, n = list(map(int, str.split(input())))\r\nif m%2 != 0 and n%2 != 0:\r\n print(int((m * n -1) / 2))\r\nelse:\r\n print(int((m * n) /2))", "a,b=map(int,input().split())\r\nsq=a*b\r\nprint(sq//2)", "b = list(map(int,input().split()))\r\nn = b[0]\r\nm = b[1]\r\nk = 0\r\nwhile(True):\r\n if(n > m):\r\n n,m = m,n\r\n if(n == 0):\r\n break\r\n elif(m == 1):\r\n break\r\n elif(n == 1 and m == 2):\r\n k = k+1\r\n break\r\n elif(n == 2 and m == 2):\r\n k += 2\r\n break\r\n elif(n%2 == 0):\r\n k = k + n//2*m\r\n break\r\n else:\r\n k = k + (n//2 + n//2 + 1)*(m//2)\r\n m = m%2\r\nprint(k)", "n,k=map(int,input().split())\r\na=n*k\r\nprint(int(a//2))", "a,b=map(int,input().split())\r\nc=a*b//2\r\nprint(c)", "input = input()\ninput = input.split()\nprint((int(input[0])*int(input[1])) // 2)\n", "a,b=map(int,input().split())\r\np=a*b\r\nprint(p//2)", "M, N = input().split()\r\nM = int(M)\r\nN = int(N)\r\nif (M*N)%2!=0:\r\n\ti = (M*N-1)/2\r\nelse:\r\n\ti = (M*N)/2\r\nprint(round(i))", "n,p=[int(x) for x in input().split()]\r\nif p>=n and p<=16 and n<=p and n>=1:\r\n c=n*p\r\n if c%2==0:\r\n k=int(c/2)\r\n print(k)\r\n elif c%2!=0:\r\n k=int(c//2)\r\n print(k)", "import math\r\n\r\nn = 17\r\nm = 17\r\nwhile(m>16 and n>16):\r\n n, m = map(int, input(\" \").split())\r\nif(m%2==0 and n%2==0):\r\n print(int((m*n)/2))\r\nelif(m%2!=0 and n%2==0):\r\n print(int(m*(n/2)))\r\nelif(m%2==0 and n%2!=0):\r\n print(int(n*(m/2)))\r\nelif(m%2!=0 and n%2!=0):\r\n print(int(math.floor(m/2) + (m*(n-1))/2))\r\n\r\n", "mn = input().split()\r\n\r\narea = int(mn[0]) * int(mn[1])\r\n\r\nprint(area // 2)", "m,n = input().split()\nprint(int(m)*int(n)//2)\n#jgppgnpenbpenbpnebnpienpeipbniprenbpinerp\n\t\t \t\t\t\t \t\t\t \t \t\t \t\t \t\t\t\t\t\t", "m,n=map(int,input().split())\r\nif m%2==0:\r\n a=m/2\r\n answer=a*n\r\nif m%2!=0:\r\n b=(m-1)/2\r\n answer=b*n+n//2\r\nprint(int(answer))", "square = input().split()\r\nM = int(square[0])\r\nN = int(square[1])\r\nif M % 2 == 0 or N % 2 == 0:\r\n number = M*N/2\r\nelse:\r\n number = (M*N-1)/2\r\nprint(int(number))", "from math import floor\r\nm,n=map(eval,input().split())\r\np=m*n\r\ni=p/2\r\nprint(floor(i))\r\n", "x=input().split()\r\nc=int(x[0])\r\nv=int(x[1])\r\ny=c*v\r\nprint(y//2)", "\r\nr, s = map(int, input().split())\r\nif r == 1 and s == 1:\r\n print(0)\r\nelse:\r\n print(int(r * s) // 2)", "str = input()\r\nstr = [int(i) for i in str.split()]\r\n\r\nres = str[0] * str[1] // 2\r\n\r\nprint(res)", "n,m=map(int,input().split())\r\narea=n*m\r\nprint(area//2)\r\n ", "n, k = [int(n) for n in input(\"\").split()]\r\nar = n*k\r\nprint(ar//2)", "m,n=map(int,input().split())\r\nh=0\r\nv=(m//2)*(n//1)\r\nif m%2!=0:\r\n h=h+((m%2)//1)*(n//2)\r\nprint(h+v)", "n , m = map(int , input().split())\r\nif (n % 2 ==0):\r\n print(n * m //2)\r\nelse:\r\n print(((n-1) * m // 2) + (m // 2))", "n = input()\n\nn, m = n.split()\n\nprint((int(n)*int(m))//2)\n", "def main():\r\n m, n = [int(x) for x in input().strip().split()]\r\n print(m * n // 2)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "write = input().split()\r\nn = int(write[0])\r\nm = int(write[1])\r\nprint((m*n)//2)", "a, b = map(int, input().split()) \r\npieces = a * b\r\nprint(pieces // 2)\r\n", "board = input()\r\nm, n = eval(board[:2]), eval(board[-2:])\r\n\r\nif 1 <= m <= n <= 16:\r\n board_size = m * n\r\nelse:\r\n pass\r\n\r\nprint(board_size // 2)", "m,n = map(int,input().split()) \r\nn >= m \r\nt = m*n // 2 \r\nprint(t)", "c = input().split(\" \") \r\nm = int(c[0])\r\nn = int(c[1])\r\nif m <= 16 and n <= 16:\r\n dOMINO = (m * n) // 2\r\n print(dOMINO)", "x = input().split()\r\n\r\ncarp= int(x[0])*int(x[1])\r\n\r\nprint(carp//2)\r\n", "def fun4(input):\r\n m,n=map(int,input.split())\r\n count=m//2*n\r\n if m%2 != 0:\r\n count+=n//2\r\n return count\r\n\r\nn=input()\r\nprint(fun4(n))\r\n", "a, b= map(int, input().split(' '))\ntotal_squares = a*b\nif total_squares % 2 ==0:\n print(int(total_squares/2))\nelse:\n print(int((total_squares - 1)/2))", "M, N = map(int, input().split())\r\nnewNumber = round(int(M*N / 2))\r\nprint(newNumber)", "mn = input()\r\nm, n = [int(x) for x in mn.split()]\r\n\r\nif m % 2 == 0 or n % 2 == 0:\r\n ans = int((m*n) / 2)\r\nelse:\r\n ans = int(((m*n) - 1) / 2)\r\n\r\nprint(ans)", "def domino_piling(board):\r\n board = board.split()\r\n board_size = int(board[0]) * int(board[1])\r\n \r\n max_domino = board_size // 2\r\n return max_domino\r\n\r\n\r\nboard = input()\r\nprint(domino_piling(board))", "M, N = map(int, input().split())\ntotal = M * N\n\nmax_dominoes = total // 2\n\nprint(max_dominoes)\n \t\t\t \t\t\t \t\t \t \t \t \t \t \t", "import sys\n\n\nproportions = input().split(' ')\n\nprint(int(proportions[0]) * int(proportions[1])//2)\n\nsys.exit(0)\n\n", "# your code goes here\r\n\r\n(n,k) = map(int, input().split(' '))\r\nif n%2==0:\r\n\tg = n//2\r\n\tprint(g*k)\r\nelse:\r\n\tg = (n//2)*k\r\n\tm = (k//2)\r\n\tprint(g+m)\r\n\t\r\n\t", "import math\r\na,b = map(int,input().split())\r\ntt = (a*b)/2\r\nt = int(math.floor(tt))\r\nprint(t)", "m,n = map(int,input().split())\r\nprint(m * n // 2)", "m,n = input().split(\" \")\r\nm = int(m)\r\nn = int(n)\r\nmn = m*n\r\nrslt = mn//2\r\nprint(rslt)", "p,q=map(int,input().split())\r\nz=p*q//2\r\nprint(z)", "a,b=map(int,input().strip().split())\r\na=a*b\r\nprint(a//2)", "\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n m,n=map(int,input().split())\r\n numbers=m*n\r\n\r\n if numbers%2==0:\r\n print(int(numbers/2))\r\n else:\r\n numbers=numbers-1\r\n print(int(numbers/2))\r\n", "m , n = map(int, input().split())\r\ndominos = (m * n) // 2\r\nprint(dominos)", "x=list(map(int,input().split())) \r\ny=x[0]*x[1]\r\nxy=int(y/2)\r\n\r\nprint(xy)", "# https://codeforces.com/problemset/problem/50/A\r\nm, n = input().split()\r\nprint(int(int(m)*int(n)/2))", "\r\nm, n, = map(int, input().split())\r\nprint(m * n // 2)", "import math\r\nmy_string = str(input())\r\nm,n = [int(x) for x in my_string.split()]\r\n\r\nresultado = (m*n)/2\r\n\r\nprint(math.floor(resultado))", "import math \r\na,b=map(int,input().split())\r\n\r\nif a%2==0:\r\n print(int((a/2)*b))\r\nelse: \r\n print(int( b*math.floor(a/2)+math.floor(b/2)))\r\n ", "x, y = map(int, input().split())\r\nif x%2==0:\r\n print(x//2*y)\r\nelif y%2==0:\r\n print(y//2*x)\r\nelse :\r\n print((x//2*y)+y//2)", "# Domino pilling 50A\r\n\r\nDOMINO_SIZE = 2 * 1\r\n\r\ndef find_max_dominoes_placed(board_h, board_w):\r\n board_area = board_h * board_w\r\n \r\n return board_area // DOMINO_SIZE\r\n\r\nm, n = map(int, input().split())\r\n\r\nif(m >= 1 and m <= 16 and n >= 1 and n <= 16):\r\n max_dominoes = find_max_dominoes_placed(m, n)\r\n print(max_dominoes)\r\n", "M,N = map(int,input().split()) #M*N squares\no=(M*N)//2\nprint(o)\n \t \t \t \t \t \t \t \t\t \t\t\t", "from sys import stdin, stdout\r\n\r\nm, n = [int(i) for i in stdin.readline().split()]\r\n\r\nstdout.write(str(m*n // 2))", "import sys\r\nimport math\r\n\r\ninput = []\r\nfor line in sys.stdin:\r\n input.append(line)\r\n \r\nmAndn = input[0].split()\r\narea = int(mAndn[0]) * int(mAndn[1])\r\nif area % 2 != 0:\r\n print(int(math.floor(area/2)))\r\nelse:\r\n print(int(area/2))", "m,n=map(int,input().split())\n\nif m%2==0 or n%2==0:\n print((m*n)//2)\nelse:\n print(((m*n)-1)//2)\n \t \t \t\t \t \t\t \t \t\t\t \t", "a,b=[int(i) for i in input().split()]\r\nprint(int((a*b)/2))", "num1,num2=map(int,input().split())\r\nres=num1*num2\r\nprint(res//2)", "#if both even, m*n/2\r\n#if one odd, (m*n)//2\r\n#if both odd (m*n)//2\r\nm, n = (int(i) for i in input().split())\r\nprint((m*n)//2)", "import math\r\nx = list(map(int,input().split()))\r\ny =x[0] * x[1]\r\ny = y/2\r\nprint(math.trunc(y))", "m,n=map(int,input().split())\r\np=m*n;l=0\r\nwhile p>=2:\r\n l+=1\r\n p-=2\r\nprint(l)\r\n", "m, n = list(map(int, input().split()))\n\nproduct = m * n\nif product % 2 == 1:\n product -= 1\n\nres = product // 2\nprint(res)", "n1,n2 = map(int,input().split())\r\nprint(int((n1*n2)/2))", "m,n = map(int,input().split())\r\nans = m*n\r\nprint(ans//2)", "n,k=map(int,input().split())\r\nprint((n*k)//2)", "dim = input()\r\ndimsp = dim.split()\r\nM = int(dimsp[0])\r\nN = int(dimsp[1])\r\nboard = M*N\r\nif board % 2 == 0:\r\n b = board/2\r\n print(int(b))\r\nelse:\r\n b = board/2\r\n a = int(b)\r\n print(a)", "l,m=list(map(int,input().split()))\r\nq=l*m\r\nprint(q//2)", "from functools import reduce\r\ninput_s = []\r\ninput_s = input().split()\r\ninput_s = list(map(int, input_s))\r\nprint(int(input_s[0]*input_s[1]/2))\r\n", "m, n = list(map(int, input().split()))\r\nnum = (int((m/2)*(n/1)))\r\nprint(num)", "from math import floor\r\nm, n = [int(i) for i in input().split(' ')]\r\nprint(floor((m*n)/2))", "i = lambda : map(int,input().split(' ')) \r\nn,m=i(); \r\nprint(n*m//2)\r\n", "rows,cols=[int(x) for x in input().split()]\r\narea_of_board=rows*cols\r\narea_of_domino=2\r\nno_of_dominos=area_of_board//area_of_domino\r\nprint(no_of_dominos)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nfrom math import *\r\nprint(floor((m*n)/2))", "x = input(\"\")\r\ny = x.split()\r\nassert 1<=int(y[0])<=16 and 1<=int(y[1])<=16\r\nprint((int(y[0])*int(y[1]))//2)\r\n", "napis = input().split()\r\nwymiarX = int(napis[0])\r\nwymiarY = int(napis[1])\r\npole = wymiarX * wymiarY\r\nbezRzutowania = pole / 2\r\nprint(int(bezRzutowania))\r\n", "m,n = map(int, input().split())\r\nresult =int((m*n)//2)\r\nprint(result)", "m, n = map(int, input(). split())\r\nans = m*n//2\r\nprint(ans)\r\n", "pole = [int(i) for i in input().split()]\r\n\r\nprint((pole[0]*pole[1])//2)", "o,p=map(int,input().split())\r\nu=o*p\r\nv=2*1\r\nm=u//v\r\nprint(m)\r\n", "m,n=map(int,input().split())\na=m*n\nprint(a//2)\n \t \t \t\t \t\t\t \t \t\t", "M,N = map(int,input().split()) \no=(M*N)//2\nprint(o)\n\t\t \t \t\t \t \t \t\t \t\t \t\t", "x, y = map(int, input().split())\r\nif y > x:\r\n x, y = y, x\r\nif y >= 1 and x >= 2:\r\n count = x * (y // 2)\r\n if y % 2 != 0:\r\n count += x//2\r\n print(count)\r\nelse:\r\n print(0)\r\n", "n = tuple([int(x)for x in input().split()])\r\nd=0\r\ni = n[0]*n[1]\r\nfor c in range(0,i):\r\n if i -2 > -1:\r\n i-=2\r\n d +=1\r\n else:\r\n break\r\nprint(d)", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = a*b\r\nprint(c//2)", "import math\n\nm, n = list(map(int, input().split()))\n\narea = m * n\n\nprint(math.floor(area / 2))\n \t\t\t\t \t \t \t \t \t \t\t\t", "raw=input()\r\nrl=raw.split()\r\nm=int(rl[0])\r\nn=int(rl[1])\r\ns=int(m*n)\r\nif s%2==0:\r\n print(int(s/2))\r\nelse:\r\n print(int((s-1)/2))", "import math\r\nn,k = list(map(int,input().strip().split()))[:int(2)]\r\narea = n * k\r\ndomino = math.floor(area / 2)\r\nprint(domino)\r\n\r\n", "#!/usr/bin/env python3\n\nimport fileinput\nfrom math import floor\n\ndims = []\nfor i, line in enumerate(fileinput.input()):\n\tline = line.strip()\n\tdims.append(list(map(lambda n: int(n), line.split(' '))))\n\ndomino_area = 2\nfor d in dims:\n\t[w,h] = d\n\tprint(floor(w*h / 2), end='')\n\n\n\n\n\t\t\n", "inpu = input()\r\nm = int(inpu.split()[0])\r\nn = int(inpu.split()[1])\r\ns = n*m\r\nprint( s//2)", "m , n = map(int, input().split())\r\nif not (m * n) % 2:\r\n print((m * n)//2)\r\nelse:\r\n result = ((max(m, n) - 1) * min(m, n)) // 2\r\n result += min(m, n) // 2\r\n print(result)", "n, m = map(int, input().split())\r\na = n * (m // 2)\r\nif m % 2 != 0:\r\n a += n // 2\r\nb = m * (n // 2)\r\nif n % 2 != 0:\r\n b += m // 2\r\nprint(max(a, b))", "def domino():\r\n dimension = input()\r\n nums = dimension.split(\" \")\r\n return (int(nums[0]) * int(nums[1])) // 2\r\nprint(domino())", "m,n = [int(i) for i in input().strip().split()]\r\n \r\nmaxDom = 0\r\n\r\nif m%2 == 0 or n%2 == 0:\r\n maxDom = m*n / 2\r\n\r\nelse:\r\n maxDom = (m*n - 1) / 2\r\n\r\nprint(int(maxDom))", "n = input()\nn = n.split()\na = int(n[0]) * int(n[1])\nif a % 2 == 0: \n print(a//2)\nelse:\n print((a-1)//2)\n \t\t\t\t\t\t \t\t \t\t \t\t \t \t \t \t\t\t\t\t", "M, N = map(int, input().split())\r\nx=M*N//2\r\nprint(x)", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\nif(1<=m and m<=n and n<=16):\r\n p=m*n\r\n t=p//2\r\n print(t)\r\nelse:\r\n print('Invalid Input')", "\r\n\r\ns = list(map(int, input().split()))\r\na = max(s[0], s[1])\r\nb = min(s[0], s[1])\r\nsum = a * (b // 2)\r\nif(b % 2 == 0):\r\n print(sum)\r\nelse:\r\n print(sum + a // 2)", "#You can't do anything until you try it\r\n\"\"\" \r\nx = eval((input().replace(\" \", \"*\")))\r\nprint(int(x/2))\r\n\"\"\"\r\nprint(int(eval(input().replace(\" \",\"*\"))/2))\r\n#eval funtion can evaluate a mathematical expressions\r\n#.replace can replace anything", "n, m = map(int, input().split())\r\nr = (n*m)//2\r\nprint(r)", "m, n = input(\"\").split()\r\nM = int(m)\r\nN = int(n)\r\no = M*N/2\r\nprint(int(o))", "def main():\r\n m, n = list(map(int, input().split()))\r\n count = 0\r\n\r\n # считаем горизонтальные доминошки\r\n count += (m - m % 2) // 2 * n\r\n\r\n # Если ширина не кратна двум, значит ещё остался ряд справа,\r\n # куда также могут поместиться доминошки (вертикально):\r\n if m % 2 == 1:\r\n count += n // 2\r\n print(count)\r\n\r\n\r\nmain()\r\n", "m, n = map(int, input().split())\r\n\r\nmax_pieces = int(m / 2 * n)\r\n\r\nprint(max_pieces)", "a, b = map(int, input().split())\r\nS = a * b\r\nprint(S // 2)", "m,n=map(int,input().split())\r\nprint(int(m*n//2))", "n=input()\nl=n.split()\na=int(l[0])*int(l[1])\ndominos=0\nwhile a>1:\n dominos+=1\n a-=2\nprint(dominos)", "M,N = map(int, input().split())\r\ntemp = M * N // 2\r\nprint(temp)", "n,m = list(map(int,input().split()))\r\n\r\nT = n * m\r\ncount = 0\r\nif (T % 2) == 0:\r\n count = T / 2\r\nelse:\r\n count = (T - 1) / 2\r\nprint(int(count))\r\n\r\n\r\n\r\n", "a = list(map(int, input().split()))\r\nif a[0] % 2 == 0:\r\n print(a[0] // 2 * a[1])\r\nelif a[1] % 2 == 0:\r\n print(a[1] // 2 * a[0])\r\nelse :\r\n print(a[0] // 2 * a[1] + (a[0] % 2) * a[1] // 2)\r\n", "m,n=list(map(int,input().split()))\r\ns=m*n\r\nprint(int(s/2))", "list1 = [int(x) for x in input().split()]\r\n#print (list1)\r\nn = int(list1[0])\r\nm = int(list1[1])\r\na = int(2)\r\n#print (n, m, a)\r\narea = m * n\r\n\r\nif (area % a == 0):\r\n print (area//a)\r\nelse:\r\n print (area//a)", "import math\r\nm,n=map(int,input().split(' '))\r\nprint(math.floor(max(m/2*n,n/2*m)))", "# The same file will be used throughout tonight by saving after writing different codes\r\nM, N = map(int, input().split());\r\nA = M * N;\r\nprint(A // 2);\r\n", "a, N = map(int, input().split())\nmax_dominoes = (a * N) // 2\nprint(max_dominoes)\n \t\t \t\t\t\t \t \t\t \t \t\t\t \t\t \t \t", "dies = [int(x) for x in input().split()]\r\nprint((dies[0]*dies[1])//2)", "row, col = map(int, input().split())\r\n\r\nprint((row * col) // 2)", "import math\r\nn = input()\r\nnum = n.split(\" \")\r\nl = int(num[0])\r\nb = int(num[1])\r\nx = math.floor((l*b)/2)\r\nprint(x)", "liste=list(map(int,input().split()))\r\nprint((liste[0]*liste[1])//2)", "n, m = map(int, input().split())\r\np = n*m\r\nprint(p//2)", "x,y=[int(x) for x in input().split()]\r\nc=x*y//2\r\nif(x*y%2==0):\r\n \r\n print(int(x*y/2))\r\nelse:\r\n \r\n \r\n print(int(c))", "m,n=map(int,input().split());\r\nres=(m*n)//2;\r\nprint(res);", "m, n = map(int, input().split())\r\nnum_sq = m * n\r\nif num_sq % 2 == 0:\r\n max_dom = num_sq // 2\r\nelse:\r\n max_dom = (num_sq - 1) // 2\r\nprint(max_dom)", "n,k = map(int,input().split())\r\nres = (n*k) // 2\r\nprint(res)", "#https://codeforces.com/problemset/problem/50/A\r\n\r\n#2 inputs given which form a matrix\r\n\r\n#check how many 2x1 pieces of dominos fit in those matrix\r\n\r\ndominos_m,dominos_n = input().split()\r\ndominos_m = int(dominos_m)\r\ndominos_n = int(dominos_n)\r\n\r\n#floor divide the product of m*n by 2\r\nprint((dominos_m*dominos_n)//2)", "mmm,nnn=map(int,input().split())\r\nprint(mmm*nnn//2)", "m,n = list(map(int,input().split()))\r\nprint(m*n//2)", "print((lambda x, y: (x*y)//2)(*map(int, input().split())))", "#first line contains M and N squares\n#second line it can divide by two and printing the dominos\nM,N=map(int,input().split())\nprint((M*N)//2)\n\t\t \t\t\t\t \t \t \t\t \t \t\t\t\t \t \t", "a=input().split()\r\nx=int(a[0])\r\ny=int(a[1])\r\nprint((x*y)//2)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\nc = (m*n)//2\r\nprint(c)\r\n", "n, m = list(map(int, input().split()))\r\nprint(int(n*m)//2)", "# Read the board sizes\nM, N = map(int, input().split())\n\n# Calculate the total number of 2x1 squares on the board\ntotal_squares = M * N\n\n# Calculate the maximum number of dominoes that can be placed\nmax_dominoes = total_squares // 2\n\n# Print the maximum number of dominoes\nprint(max_dominoes)\n \t\t\t\t \t \t \t \t \t\t\t\t\t \t \t", "N,M=input().split()\r\nN,M=int(N),int(M)\r\nprint((N*M)//2)", "lst = [int(i) for i in input().split()]\r\nm = lst[0]\r\nn = lst[1]\r\n\r\na = m * n\r\nprint(a // 2)\r\n", "m, n = map (int, input().split())\r\nprint (int((m * n) / 2))", "a,b =list(map(int,input().split()))\r\narea = a*b\r\nprint(area//2)\r\n", "halfpro=lambda x,y:x*y//2; print(halfpro(*map(int, input().split())));", "if __name__ == '__main__':\r\n\r\n m, n = map(int, input().split())\r\n\r\n print(m*n//2)", "import math\r\n\r\ntempStr = input().split(' ')\r\nm = int(tempStr[0])\r\nn = int(tempStr[1])\r\n\r\nprint(math.floor(m * n / 2))", "m,n=map(int,input().split()) \r\narea=m*n \r\nprint(area//2)", "inp = input()\r\n\r\ninp = inp.split()\r\n\r\narea = int(inp[0])*int(inp[1])\r\n\r\nprint(area // 2)", "n,m = [int(item) for item in input().split(' ')]\r\nans = 0\r\nprint (n * m // 2)", "a = input().split()\r\nil = [int(a[item]) for item in range(len(a))]\r\narea = il[0] * il[1]\r\nif area % 2 == 0:\r\n print(int(area/2))\r\nelse:\r\n print(int(area//2))", "m,n=map(int,input().split())\r\nif m%2==0:\r\n ans=(m//2)*n\r\nelif n%2==0:\r\n ans=(n//2)*m\r\nelse:\r\n ans=(m//2)*n+n//2\r\nprint(ans)", "# Read in multiple numbers in one line\r\nnumbers = input()\r\n\r\n# Split the input string into individual numbers\r\nnum_list = numbers.split()\r\n\r\n\r\nle = len(num_list)\r\n\r\n# Convert each number from string to int\r\nfor i in range(le):\r\n\tnum_list[i] = int(num_list[i])\r\n\r\n\r\na = num_list[0]\r\nb = num_list[1]\r\nc = a * b\r\nd = c / 2\r\nd = int(d)\r\nprint(d)", "w, h = input().split()\r\na = int(w) * int(h)\r\nprint(a // 2)", "u = input().split(\" \")\r\nm = int(u[0])\r\nn = int(u[1])\r\nif 1 <= m and m <= 16 and 1 <= n and n <= 16:\r\n d = float(m * n) / 2\r\n print(int(d))", "x, y = map(int, input().split())\r\nt= int(x*y / 2)\r\nprint(t)", "num1, num2 = input().split()\r\nnum3 = int(num1) * int(num2)\r\nnum4 = num3 // 2\r\nprint (num4)", "'''\n R E X\n\n Date - 13th March 2021\n\n Platform - CodeForces, Practice\n\n @author: kunalverma19\n'''\nimport sys,math\n#sys.stdin=open(\"input.txt\",\"r\")\nm,n=map(int,input().split())\nprint((m*n)//2)\n", "z = [int(i) for i in input().split()]\r\nprint(z[0]*z[1]//2)", "m, n=map(int, input().split())\ntotal=int(m*n/2)\nprint(total)\n \t \t \t \t \t \t\t\t\t\t\t \t \t\t\t\t", "\ndef func():\n pass\nevr,dist = map(int,input().split())\ns = evr * dist\n\nprint(s//2)\n", "r,c=map(int,input().split())\r\nres=r*c\r\nprint(res//2)", "def domino_piling():\n board = input().split()\n board = int(board[0]) * int(board[1])\n if board % 2 == 0:\n return int(board/2)\n return int((board-1)/2)\n\nprint(domino_piling())\n", "a,b = map(int,input().split())\nprod = a*b\nprint(prod//2)\n#\n\n\n\n#\n\t \t\t\t \t\t\t\t\t \t\t\t \t \t \t \t", "a,s=map(int,input().split())\r\nb=int(a*s/2)\r\nprint(b)", "def main():\r\n pieces = m*n \r\n return pieces // 2\r\n\r\nm,n = input().split()\r\nm,n = int(m),int(n)\r\nwhile m > n or m >16 or n >16:\r\n m,n = input().split()\r\n m,n = int(m),int(n)\r\n \r\nprint(main())", "n=input().split(\" \")\r\ns=int(n[0])\r\np=int(n[1])\r\nprint((s*p)//2)", "import sys\r\nm, n = map(int, sys.stdin.read().split())\r\n\r\nprint(n*(m//2) + (m%2) * n//2, sep='\\n', end=None)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 4 09:16:14 2021\r\n\r\n@author: mayank\r\n\"\"\"\r\n\r\nm,n=map(int , input().split())\r\nif (m*n)%2==0:\r\n print(int((m*n)/2))\r\nelse:\r\n print(int((m*n)//2))", "a = input().split()\r\nm, n = int(a[0]), int(a[-1])\r\nif m % 2 != 0 and n % 2 != 0:\r\n print((m*n-1)//2)\r\nelse:\r\n print(m*n//2)\r\n", "a,b=map(int,input().split())\r\nsize=a*b\r\nno_of_pizza = (size // 2)\r\nprint(no_of_pizza)", "if __name__ == \"__main__\":\r\n n, m = (int(x) for x in input().split())\r\n print(n*m//2)", "input_str = input()\r\nnum1, num2 = map(int, input_str.split())\r\nnbr=int((num1*num2)/2)\r\nprint(nbr)\r\n\r\n", "'''\r\nA. Domino piling\r\ntime limit per test2 seconds\r\nmemory limit per test256 megabytes\r\ninputstandard input\r\noutputstandard output\r\nYou are given a rectangular board of M × N squares.\r\n Also you are given an unlimited number of standard \r\n domino pieces of 2 × 1 squares. You are allowed to \r\n rotate the pieces. You are asked to place as many \r\n dominoes as possible on the board so as to meet the \r\n following conditions:\r\n\r\n1. Each domino completely covers two squares.\r\n\r\n2. No two dominoes overlap.\r\n\r\n3. Each domino lies entirely inside the board. It is \r\nallowed to touch the edges of the board.\r\n\r\nFind the maximum number of dominoes, which can be \r\nplaced under these restrictions.\r\n\r\nInput\r\nIn a single line you are given two integers \r\nM and N — board sizes in squares (1 ≤ M ≤ N ≤ 16).\r\n\r\nOutput\r\nOutput one number — the maximal number of dominoes, which can be placed.\r\n'''\r\n\r\ndef howManyDominoes():\r\n x = input().split()\r\n M = int(x[0])\r\n N = int(x[1])\r\n prod = M*N\r\n print(prod//2)\r\n\r\nhowManyDominoes()\r\n\r\n\r\n\r\n", "n,m=input().split()\r\nn,m=int(n),int(m)\r\narea=n*m\r\nprint(area//2)", "ont=list(map(int,input().split()))\r\nzero=ont[0]\r\none=ont[1]\r\nprint(int(zero*one/2))", "m,n=map(int,input().split())\r\nt=m*n\r\nif t%2!=0 :\r\n t-=1\r\nprint(int(t/2))", "a=2\r\nb=1\r\nM,N=map(int,input().split())\r\narea_of_domino = (a * b)\r\narea_of_board = M * N\r\ncount=0\r\nwhile area_of_board>=area_of_domino:\r\n\r\n count+=1\r\n area_of_domino+=2\r\n\r\nprint(count)\r\n", "#доска с размерами M*N\r\nm, n,= map(int, input().split())\r\na = m*n\r\nif a%2 == 0 and a > 1:\r\n print(int(a/2))\r\nelse:\r\n print(int(a/2-0.5))", "M, N = map(int,input().split())\ndom = (M * N) // 2\nprint(dom)\n \t\t \t\t\t\t \t \t\t\t \t \t", "a, k = input().split(' ')\nprint(int(a)*int(k)//2)\n", "s=input()\r\ns=[int(z) for z in s.split()]\r\nprint(int(s[0]*s[1]/2))", "\r\nm , n = map(int,input().split(\" \"))\r\nprint(int((m/2)*(n/1)))\r\n", "M,N=map(int,input().split())\r\na=(M*N)//2\r\nprint(a)\r\n", "k = list(map(int,input('').split(' ')))\r\nprint(k[0]*k[1]//2)", "import sys\r\nlength,width=sys.stdin.read().split()\r\nlength=int(length)\r\nwidth=int(width)\r\nf=0\r\narea=length*width\r\nwhile (area>=2):\r\n f=f+1\r\n area = area -2\r\nprint(f)\r\n", "N,M=map(int,input().split())\nprint((N*M)//2)\n'''aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\naaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa'''\n\t \t\t\t \t \t\t\t \t\t\t \t\t", "\nM, N = map(int, input().split())\ntotal_squares = M * N\nmax_domi = total_squares // 2\nprint(max_domi)\n\n\t \t \t \t\t \t\t \t \t \t\t\t", "# Domino piling\r\nM,N=map(int,input().split())\r\nif M*N%2 == 0:\r\n print(int(M*N/2))\r\nelif M*N%2 == 1:\r\n print(int((M*N-1)/2))", "from math import *\r\nn,m=map(float,input().split())\r\nresult=floor((n*m)/2)\r\nprint(result)\r\n", "N = 0\r\nl = input().split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\nwhile True:\r\n if(N*2>(l[0]*l[1])):\r\n break\r\n else:\r\n N+=1\r\nprint((N-1))", "import math\r\nanswer = 0\r\nm,n = map(int,input().split())\r\nif m%2==0:\r\n number_of_2_rows = math.floor(m/2)\r\n answer = number_of_2_rows*n\r\nelse:\r\n number_of_2_rows = math.floor(m/2)\r\n last_row = math.floor(n/2)\r\n answer = number_of_2_rows*n + last_row\r\nprint(answer)\r\n ", "tab_lero=input().split()\r\nM,N = int(tab_lero[0]), int(tab_lero[1])\r\n1<=M<=N<=16\r\nprint(M*N//(2))", "import sys, math\r\n\r\nn = sys.stdin.readline().strip().split()\r\nn, m = int(n[0]), int(n[1])\r\nprint(math.floor((n*m)/2))", "(m,n) = map(int, input().split())\r\nprint(int(m*n/2))\r\n", "M, N = map(int, input().split())\n\ntotal_squares = M * N\nmax_dominoes = total_squares // 2\n\nprint(max_dominoes)\n\n\t\t\t \t \t\t \t \t\t \t\t \t \t \t\t", "w, h = map(int, input().split())\r\n\r\nif w % 2 == 0:\r\n print(int((w/2)*h))\r\nelse:\r\n if h % 2 == 0:\r\n print(int((h/2)*w))\r\n else:\r\n print(int((((h-1)/2)*w)+((w-1)/2)))", "Inp=input().split(\" \")\r\nnumber_of_board=int(Inp[0])*int(Inp[1])\r\nresult=int(number_of_board/2)\r\nprint(result)\r\n", "def Domino(n,m):\r\n p = (m*n)//2\r\n return p\r\nm, n = map(int, input().split())\r\nprint(Domino(m,n))\r\n", "\r\nm_n=list(map(int,input().split()))\r\n\r\nprint( m_n[0]*m_n[1] // 2 )\r\n \r\n ", "m,n=map(int,input().split())\r\nif m%2==0 or n%2==0:\r\n print(int(m*n/2))\r\nelse :\r\n print(int((m*n-1)/2))", "data = input()\r\ndata_list = data.split(' ')\r\nm = int(data_list[0])\r\nn = int(data_list[1])\r\n\r\nprint('{}'.format((n*m) // 2))", "M,N = map(int,input().split(' '))\r\nprint((M//2)*N+(M%2)*(N//2))", "m,n = map(int, input().split())\r\na = m*n\r\nif (a%2)==0:\r\n x= a//2\r\nelse:\r\n a-=1\r\n x=a//2\r\nprint(x)", "from sys import stdin\r\n\r\nm, n = map(int, stdin.readline()[:-1].split())\r\n\r\nprint(str(int(((m*n)/2))))", "import math\r\ndef domino():\r\n x, y = [int(y) for y in input().split(\" \")]\r\n total = math.trunc((x*y)/2)\r\n print(f\"{total:.0f}\")\r\ndomino()\r\n", "m,n = map(int,input().split())\r\nz = 0\r\nA = m*n\r\n\r\nwhile A>1:\r\n A = A-2\r\n z += 1\r\n\r\nprint(z)\r\n", "from math import *\r\ndim=input().split()\r\ndim=[int(x) for x in dim]\r\nM=dim[0]\r\nN=dim[1] ##N>M\r\n\r\nx=N/2\r\ny=M/1\r\nif N%2!=0:\r\n x=ceil(x)\r\np1=M*N\r\np2=x*y\r\n\r\nwhile p2*2>p1:\r\n p2=p2-1\r\n\r\nprint(int(p2))", "from sys import stdin\r\n\r\nsquare = list(map(int, stdin.readline().split()))\r\nsquare.sort(reverse=True)\r\n\r\ncnt = 0\r\nwhile square[1] > 1:\r\n cnt += 1\r\n square[1] -= 2\r\n\r\nresult = (square[0] * cnt) + (square[1] * (square[0] // 2))\r\n\r\nprint(result)", "def dominos():\r\n m_n = [int(x) for x in input().split()]\r\n size = m_n[0] * m_n[1]\r\n print(size // 2)\r\n\r\nif __name__ == \"__main__\":\r\n dominos()", "# 50А. Укладка доминошками\n# \n# Входные данные\n# В единственной строке записано два целых числа M и N — размеры доски в \n# клетках (1 ≤ M ≤ N ≤ 16).\n# \n# Выходные данные\n# Выведите одно число — максимальное количество доминошек,\n# которое можно уложить.\n\nm, n = [int(i) for i in input().split()]\n\nprint((m // 2) * n + (m % 2) * (n // 2))\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\nprint(int((n*k)/2))", "# https://codeforces.com/problemset/problem/50/A\r\n\r\n\r\nn,m=map(int,input().split())\r\nprint(n*m//2)", "m,n=map(int,input().split())\r\na=2\r\nprint(int(m*n / a))", "m,n=map(int, input(). split())\ndos=m*n\ndom=1*2\nif dos%dom==0:\n print(dos//dom)\nelse:\n print(dos//dom)\n\n# Tue May 17 2022 07:30:51 GMT+0000 (Coordinated Universal Time)\n\n# Tue May 17 2022 07:30:57 GMT+0000 (Coordinated Universal Time)\n", "a, b = input().split(\" \")\r\narea = (int(a) * int(b))\r\ntotal = area//2\r\nprint (total)\r\n", "numbers = [int(num) for num in input().split(\" \", 1)]\r\nm = numbers[0]\r\nn = numbers[1]\r\ncount = 0\r\n\r\nif m%2==0 :\r\n count = n*m/2\r\nelse:\r\n count = n*(m-1)/2+n/2\r\n\r\nprint(int(count))\r\n", "n,m = map(int,input().split())\r\nprint(int(n*m*0.5))", "x=input().split()\r\nx=[int(i) for i in x]\r\ny=x[0]*x[1]/2\r\nprint(int(y))", "def ans():\r\n m, n = map(int,input().split())\r\n squares = m*n\r\n print(squares//2)\r\n\r\nans()\r\n", "i = input()\r\nix = i.split(\" \")\r\nm = int(ix[0])\r\nn = int(ix[1])\r\nprod = m * n\r\nsum = 0\r\nif prod % 2 == 0:\r\n sum = prod/2\r\nelse:\r\n sum = prod//2\r\nprint(int(sum))", "m, n = [int(i) for i in input().split()]\r\nans = int((m*n)/2)\r\nprint(ans)\r\n", "a = input().split()\r\notvet = (int(a[0])*int(a[1]))//2\r\nprint(otvet)", "from functools import *\r\nprint(reduce(lambda x, y: x*y, list(map(int, input().split())))//2)\r\n", "m,n = tuple(map(int, input().split()))\r\nmi = min(m,n)\r\nmx = max(m,n)\r\n\r\nif m+n < 3:\r\n print(0)\r\nelse:\r\n ans = int(mx*int(mi/2)) if mi >= 2 else 0\r\n if mi % 2 != 0:\r\n ans += int(mx/2)\r\n print(ans)", "first = input().split()\r\nM = int(first[0])\r\nN = int(first[1])\r\n\r\nprint(divmod(M*N, 2)[0])\r\n", "M,N = input().split()\r\nM=int(M)\r\nN=int(N)\r\nif M>=1 and M<=N:\r\n if N<=16:\r\n print((M*N)//2)", "m, n = list(map(int,input().split()))\r\ns = m*n\r\nif s < 2:\r\n print(0)\r\nelse:\r\n print(s//2)", "m, n = map(int, input().split())\r\ntotal = (m * n) // 2\r\nprint(total)", "M, N = map(int, input().split())\ntotal_square = M * N\nmax_dominoes = total_square // 2\n\nprint(max_dominoes)\n\n\t\t \t\t \t\t\t\t\t \t\t \t \t \t \t \t\t", "rows, cols = map(int, input().strip().split())\nprint((rows * cols) // 2)", "m,n=map(int,input().split())\r\nmaxx=m*n//2\r\nprint(maxx)\r\n", "m,n=list(map(int,input().split()))\nres=m*n\nprint(res//2)\n \t\t \t \t\t \t\t\t \t\t \t \t\t\t\t\t\t", "x = input()\r\n\r\nx = x.split(\" \")\r\n\r\nfor i in range(0,len(x)):\r\n x[i] = int(x[i])\r\n \r\nprint(x[0]*x[1]//2)", "import math\r\nm,n=input().split(\" \")\r\nm=int(m)\r\nn=int(n)\r\nsize=m*n\r\nresult=(size/2)\r\nprint(math.floor(result))\r\n\r\n", "m, n = map(int, input().split())\r\nans = int((m*n)/2)\r\nprint(ans)\r\n", "lst = [int(k) for k in input().split(\" \")]\r\nprint((lst[0]*lst[1])//2)", "p, q = map(int, input().split())\nmax_dominoes = (p * q) // 2\nprint(max_dominoes)\n \t \t \t\t \t\t\t \t\t\t\t \t \t\t \t\t", "[M, N] = [int(x) for x in input().split()]\r\n\r\nboard_size = (M*N)*2\r\n9\r\nprint(int((board_size/4)))", "s=0\r\na1,a2=map(int,input().strip().split())\r\ns=(a1*a2)/2\r\nprint(int(s))", "n, m = input().split()\r\nn, m = int(n), int(m)\r\nif n == 1 and m == 1:\r\n print(\"0\")\r\nelif (n > 1 and m == 1):\r\n print(n//2)\r\nelif m > 1 and n == 1:\r\n print(m//2)\r\nelse:\r\n print((n*m)//2)\r\n", "M,N=map(int,input().split())\r\narea=M*N\r\ncount=area//2\r\nprint(count)\r\n", "m,n = map(int,input().split())\r\ntotal = int(m*n/2)\r\nprint(total)", "def max_dominoes(M, N):\r\n if M % 2 == 0 or N % 2 == 0:\r\n return M * N // 2\r\n else:\r\n return (M * N - 1) // 2\r\n\r\n# Read input\r\nM, N = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nprint(max_dominoes(M, N))\r\n", "M,N = input().split()\nM = int(M)\nN = int(N)\nd = M*N//2\n\nprint(d)\n\t\t \t\t \t \t\t\t \t\t \t \t\t\t\t\t\t", "M, N = map(int, input().split())\n\nif 1 <= M <= N <= 16:\n max_dominoes = (M * N) // 2\n \n print(max_dominoes)\nelse:\n print(\"Las restricciones no se cumplen.\")\n\n\t\t \t\t\t \t\t\t \t\t \t\t \t\t \t\t\t \t", "L, N = map(int, input().split())\nmax_dominoes = (L * N) // 2\nprint(max_dominoes)\n\n\t\t \t\t\t\t \t \t\t\t \t\t \t\t\t \t\t \t \t", "n, m = map(int, input().split())\r\n\r\nif m > n:\r\n n, m = m, n\r\n\r\nif m > 1:\r\n div = n//2\r\n if n % 2 == 0:\r\n print(div*m)\r\n else:\r\n print(div*m+m//2)\r\n\r\n\r\nelse:\r\n print(n//2)\r\n", "n = input()\r\nl = n.split()\r\nnum = int(l[0]) * int(l[1])\r\nans = num//2\r\nprint(ans)", "a,b=map(int,input().split())\ns=b*a\nprint(s//2)\n#_______________________________________\n \n\n\t \t\t\t\t\t\t \t\t \t\t \t\t \t\t\t\t", "x = list(map(int, input().split()))\n\nsize = x[0] * x[1]\n\ndomi_area = 2\n\nprint(int(size / domi_area))", "M, N = map(int, input().split())\r\n\r\n# Calculate the maximum number of dominoes that can fit vertically (2x1)\r\nvertical_dominoes = (M * N) // 2\r\n\r\nprint(vertical_dominoes)\r\n #polling", "a = input().split()\r\nc = int(a[0]) * int(a[1])\r\nprint(c // 2)", "a=[int(x) for x in input().split()]\r\nprint((a[0]*a[1])//2)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\np = n * k\r\nif p % 2 == 0:\r\n print(int(p/2))\r\nelse:\r\n print(int((p - 1) / 2))", "if __name__ == '__main__':\r\n list1 = input().split(\" \")\r\n m = int(list1[0])\r\n n = int(list1[1])\r\n if (m%2 != 0) and (n%2 != 0):\r\n a = int((min(m,n)-1)/2) * max(m,n)\r\n b = int((max(m,n)-1)/2)\r\n num = a+b\r\n else:\r\n num = int((m*n)/2)\r\n print(num)\r\n", "m,n=input().split()\nm=int(m)\nn=int(n)\nz=m*n/2\nprint(int(z))", "r=input().split()\r\nm=int(r[0])\r\nn=int(r[1])\r\nd=(m*n)//2\r\nprint(d)", "n=input().split()\r\na=int(n[0])\r\nb=int(n[1])\r\nif a%2==0 and b%2==0:\r\n print(int(a*b/2))\r\nif a%2==0 and b%2!=0:\r\n print(int(a*b/2))\r\nif b%2==0 and a%2!=0:\r\n print(int(a*b/2))\r\nif a%2!=0 and b%2!=0:\r\n print(int((a*b-1)/2))", "import math\n\nm,n = map(int,input().split())\n\nk = math.floor((m*n)/2)\nprint(k)\n\n\n\n ", "m,n=map(int,input().split())\r\nprint(n*m//2)", "n,m = map(int, input().split())\r\np = (m//2)*n\r\nprint(p+(n//2) if m%2 else p)\r\n", "#how many dominoes\nm_n = list(map(int, input().split()))\nboardSize = m_n[0]*m_n[1]\nprint(boardSize//2)\n", "m,n=map(int, input().split())\r\na=m*n\r\nif a%2==0:\r\n d=int(a/2)\r\n print(d)\r\nelse:\r\n c=int(a/2)\r\n print(c)", "m,n=map(int,input().split())\r\nprint(f'{(m*n)//2}')", "m,n = map(int, input().split())\r\np = m*n\r\nprint(p//2)", "st = input().split(' ')\r\nm = int(st[0])\r\nn = int(st[1])\r\nval = 0\r\n\r\nif (m*n)%2==0:\r\n val = m*n//2\r\nelse:\r\n val = (m*n - 1)//2\r\n \r\nprint(val)", "x,y=map(int,input().split())\r\nz=x*y\r\nprint(int(z/2))", "a, b = input().split()\na = int(a)\nb = int(b)\nval = a * b\nprint(val // 2)\n\t \t\t \t\t\t\t \t\t\t \t \t\t\t \t \t\t\t\t", "M,N = map(int,input().split(\" \"))\r\nsum= M*N\r\n\r\nprint(sum//2)", "length,breadth=map(int,input().split())\r\narea=length*breadth\r\nanswer=area//2\r\nprint(answer)", "from sys import stdin\n# n=int(stdin.readline())\nm,n=map(int,stdin.readline().split())\nprint(int((m*n)/2))\n \t \t\t\t\t\t\t\t \t \t\t\t \t \t\t \t\t", "#jeboufckvrciukgjblrtujgbcolrtjcgb\np, q = map(int,input().split())\nprint((p*q)//2)\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\nm = l[0]\r\nn = l[1]\r\nprint(n*m//2)", "a,b = map(int, input().split())\r\nif a==1 and b==1:\r\n print(0)\r\nelse:\r\n print((a*b)//2)", "m , n = list(map(int,input().split()))\r\nprint(int(m*n/2))", "m, n= map(int, input().split())\r\nsquares_covered = (m * n) // 2\r\nprint(squares_covered)\r\n\r\n ", "a = list(map(int, input().split()))\r\nm = a[0]\r\nn = a[1]\r\nif m % 2 == 1 and n % 2 == 1:\r\n print(int((m * n - 1) / 2))\r\nelse:\r\n print(int((m * n) / 2))", "a = input().split()\r\nproduct = int(a[0])*int(a[1])\r\nif product % 2 == 0:\r\n print(int(product / 2))\r\nelse:\r\n print(int((product - 1) / 2))\r\n", "M, N = list(map(int, input().split()))\r\nprint(M*N //2)", "m,n=map(int,input().split())\na=m*n\nb=a//2\nprint(b)\n#ghjj\n\t \t \t\t \t\t\t\t \t \t \t \t\t\t", "from math import *\r\nm,n = map(int, input().split())\r\n\r\nif m % 2 == 0:\r\n\tprint(floor((m/2)*n))\r\nelse:\r\n\tc = m % 2\r\n\tprint(floor((m//2)*n+(n/2)))", "m,n = map(int, input().split(' '))\nspaces = m*n\nspaces = spaces //2\nprint(spaces)\n\t\t\t\t \t\t \t\t \t \t \t \t\t \t \t \t \t\t", "import math\r\nd = list(map(int, input().split()))\r\n\r\nprint(math.floor(d[0]*d[1]/2))", "n,m=list(map(int,input().split()))\nprint(n*m//2)\n# print the domino needed\n \t \t \t\t \t \t \t\t \t\t\t \t", "grid = input()\r\na, b = tuple(grid.split(\" \"))\r\nprint(int(a)*int(b)//2)", "(n, m) = [int(x) for x in input().split()]\n\ndef Solve(a, b):\n if not (a % 2 and b % 2):\n return a * b // 2\n return Solve(a, b - 1) + (a // 2)\n\nprint(Solve(n, m))\n", "import math\n\n\nthing = input().split()\nm = int(thing[0])\nn = int(thing[1])\n\n\nmaxdoms = math.floor((m * n) / 2)\n\nprint(str(maxdoms))\n\n", "n, k = map(int, input().split())\nfield = n*k\namount = field//2\nprint(amount)", "a,b=list(map(int,input().split()))\r\nc=a*b\r\nprint(c//2)", "n1,n2=map(int,input().split())\nsum1=(n1*n2)//2\nprint(sum1)\n \t\t \t \t \t\t \t\t \t \t\t \t\t \t\t\t \t\t", "n, m = [int(x) for x in input().split()]\r\n\r\nif n < m:\r\n n, m = m, n\r\n\r\nhor = m / 2\r\nhor = int(hor)\r\n\r\nver = hor * n\r\n\r\nif m % 2 > 0:\r\n ver += int(n / 2)\r\n\r\nprint(ver)", "A= input()\r\nB= A.split()\r\nm= int(B[0])\r\nn= int(B[1])\r\n\r\narea= m*n\r\nprint(area//2)", "m, n = input().split(\" \")\nm, n = int(m), int(n)\nprint(int(m*n/2))\n", "m,n=input().split()\nprint (int(int(m)*int(n)/2))", "m,n=map(int,input().split())\r\na=m*n\r\nb=a/2\r\nprint(int(b))", "a, b = input().split()\r\na= int(a)\r\nb= int(b)\r\nc=(a*b)//2 \r\nprint(c)", "M, N = map(int, input().split())\n\nnum_squares = M * N\nmax_dominoes = num_squares // 2\n\nprint(max_dominoes)\n \t \t\t \t\t \t \t \t\t \t\t \t \t \t", "m,n=[int(i) for i in input().split()]\r\ns=m*n\r\nprint(s//2)", "def main():\n area_of_block = 2 * 1\n x, y = map(int, input().split(' '))\n print(x * y // area_of_block)\nif __name__ == '__main__':\n main()", "(m,n) = [int(n) for n in input().split()]\r\n\r\nif m%2!=0 and n%2!=0:\r\n dominoes = ((m-1)//2)*n + (n-1)//2\r\n print(dominoes)\r\n\r\nelif m%2==0:\r\n dominoes = (m//2)*n\r\n print(dominoes)\r\n\r\nelif n%2==0:\r\n dominoes = (n//2)*m\r\n print(dominoes)\r\n", "start = list(map(int, input().split()))\nprint((start[0]*start[1])//2)", "n , m = map(int,input().split())\r\n#evenism = True\r\n#if (m%2 == 0 or n%2 == 0):\r\nprint (int(m*n/2))\r\n", "m, n = map(int, input().split())\r\n\r\narea = m*n\r\n\r\ncount = area//2\r\n\r\nprint(count)", "inp = list(map(int, input().split()))\r\n\r\nA = inp[0]*inp[1]\r\n\r\nn = int(A/2)\r\n\r\nprint(n)\r\n", "M, N = map(int, input().split())\r\n\r\nif M % 2 == 0 or N % 2 == 0:\r\n print((M * N) // 2)\r\nelse:\r\n print(((M * N) - 1) // 2)", "x,y=map(int,input().split())\r\nif x+y==2:\r\n print(0)\r\nelse:\r\n if x==1:\r\n print(y//2)\r\n elif y==1:\r\n print(x//2)\r\n else:\r\n print(x*y//2)\r\n ", "n = input().split()\r\nm = list(map(int, n))\r\noutput = (m[0]*m[1])/2\r\nprint(int(output))", "o,p = map(int, input().split())\r\nif o == 1 and p == 1:\r\n print(0)\r\nelse:\r\n print(int(o * p) // 2)", "length , height = map(int, input().split(' '))\r\n\r\nprint(int(length * height / 2))", "if __name__ == '__main__':\r\n M,N = tuple(map(int,input().split()))\r\n print((M*N) >> 1)", "k = input().split()\r\nm = int(k[0])\r\nn = int(k[1])\r\ns = m*n\r\nf = 2*1\r\nq = int(s/f)\r\nprint(q)\r\n", "m,n=input().split()\r\nm,n=[int(x) for x in [m,n]]\r\nprint((m*n)//2)", "x = input()\r\na, b= tuple(map(int, x.split()))\r\nmasahat = a *b\r\ndomino = masahat // 2\r\nprint(domino)", "M,N=[int(M)for M in input().split()]\r\na=int((M*N)/2)\r\nprint(a)", "import math\r\n\r\nw,h = map(int, input().split(\" \"))\r\na = w*h\r\nd = 2\r\nprint(math.floor(a/2))", "m,n = map(int,input().split())\n\nres = m*n \n\nprint(int(res//2))\n", "#50A\n'''\nA. Domino piling\ntime limit per test2 seconds\nmemory limit per test256 megabytes\ninputstandard input\noutputstandard output\nYou are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions:\n\n1. Each domino completely covers two squares.\n\n2. No two dominoes overlap.\n\n3. Each domino lies entirely inside the board. It is allowed to touch the edges of the board.\n\nFind the maximum number of dominoes, which can be placed under these restrictions.\n\nInput\nIn a single line you are given two integers M and N — board sizes in squares (1 ≤ M ≤ N ≤ 16).\n\nOutput\nOutput one number — the maximal number of dominoes, which can be placed.\n'''\nn = input()\nl=[]\nl = n.split(\" \")\n#domino peice = 2x1\nx=[]\nfor i in range(len(l)):\n x.append(int(l[i]))\npro = x[0]*x[1]\nreq = 2\nprint(pro//req)", "m, n = input().split(\" \")\r\nm, n = int(m), int(n)\r\nr = (m * n) // 2\r\nprint(r)", "\r\na, b = map(int, input().split())\r\ny = (a * b) / 2\r\ny = y - (y - int(y))\r\nprint(int(y))", "M,N=map(int,input().split())\r\nk=M*N\r\nl=k//2\r\nprint(l)\r\n", "from math import floor\r\nm,n = map(int, input().split())\r\n\r\nprint(floor((m*n)/2))", "m, n = map(int, input().split())\r\n\r\narea = m * n\r\ndomino = area // 2\r\nprint(domino)", "m, n = map(int, input().split())\nif not (m % 2 and n % 2):\n print(m * n // 2)\nelse:\n print((m * (n - 1) + (m - 1)) // 2)\n", "M, N = input().split()\r\n\r\nM = int(M)\r\nN = int(N)\r\n\r\nsquares = M * N\r\n\r\ndominoes = squares // 2\r\n\r\nprint(dominoes)", "m, n = input().split(\" \")\r\nsquares = int(m) * int(n)\r\n\r\nif squares % 2 == 0:\r\n print(int(squares/2))\r\nelse:\r\n print(int((squares - 1)/2))", "m,n=map(int, input().split())\r\nc=0\r\nif max(m,n)%2==0 :\r\n c=c+max(m,n)/2\r\n c=c*min(m,n)\r\nelif max(m,n)%2!=0 and min(m,n)%2==0:\r\n c=c+max(m,n)\r\n c=c*(min(m,n)/2)\r\nelif max(m,n)%2!=0 and min(m,n)%2!=0:\r\n c=c+max(m,n)\r\n c*=int(min(m,n)/2)\r\n c+=int(max(m,n)/2)\r\n# elif max(m,n)%2!=0 and min(m,n)==1:\r\n# c+=int(max(m,n)/2)\r\nprint(int(c))\r\n\r\n", "n,m=[int(s) for s in input().split()]\r\nprint(n*m//2)", "m,n=map(int,input().split())\na=m*n\nb=a//2\nprint(b)#qqq\n \t\t\t \t\t \t \t \t \t\t\t\t \t\t\t\t", "m,n = list(map(int,input().split()))\r\n# print(m,n)\r\n\r\ncount = 0\r\nif m%2 == 0 :\r\n count += ( m//2 ) * n\r\nelse:\r\n count += ( m//2 ) * n\r\n count += n//2 \r\n\r\nprint(count)", "#Domino pilling\nM,N=map(int,input().split())\na=M*N\n\ndominos=int(a/2)\n\nprint(dominos)\n", "dims = input().split(' ')\r\n\r\narea = int(dims[0]) * int(dims[1])\r\n\r\nif (area % 2 == 1 ):\r\n print(((area -1) // 2))\r\nelse:\r\n print((area // 2))", "m,n = map(int,input().split())\r\nresult = m*n\r\ndomino = 2\r\nprint(int (result / domino))", "import math\r\n\r\nms, ns = input().split()\r\nm, n = int(ms), int(ns)\r\n\r\nprint(math.floor((m * n) / 2))", "numbers= list(map(int, input().split(\" \")))\r\nprint(int((numbers[0]* numbers[1])/ 2))", "m,n=map(int,input().split())\nx=m*n\nprint(x//2)\n#98765\n \t\t\t\t\t\t \t\t\t\t\t \t \t \t \t\t \t\t \t", "m,n = map(int, input().split())\r\nsqr = m * n\r\ndomino = sqr // 2\r\nprint(domino)", "m, n = map(int, input().split())\r\n\r\ndomino_square = 2\r\nboard_square = m * n\r\n\r\nprint(board_square // domino_square)", "M,N=map(int,input().split())\r\ndominoNum=M*(N//2)+M*(N%2)//2\r\nprint(dominoNum)", "kolvo = input().split()\r\nvivod = int(kolvo[0]) * int(kolvo[1]) // 2\r\nprint(vivod)\r\n", "m,n = [int(i) for i in input().split()]\r\nif m % 2 == 0 and n % 2 == 0:\r\n dominos = (m/2)*(n/1)\r\nelif m % 2 != 0 and n % 2 != 0:\r\n dominos = (m//2)*(n/1) + (n//2) \r\nelif m % 2 == 0 and n % 2 != 0:\r\n dominos = (m/2)*(n/1)\r\nelse:\r\n dominos = (m//2)*(n/1) + (n//2)\r\nprint(int(dominos)) \r\n", "a=str(input())\r\nb=a.split()\r\nc=int(b[0])\r\nd=int(b[1])\r\nif c%2==0:\r\n e=c/2\r\n f=e*d\r\nelse:\r\n e=int(c/2)\r\n g=int(d/2)\r\n f=e*d+g\r\nprint(int(f))\r\n", "n = list(map(int, input().split()))\r\nmul = n[0]*n[1]\r\nprint(mul//2)", "n,m=map(int,input().split())\r\nprint (n * m // 2)", "m,n = map(int, input().split())\r\n\r\nif (m%2!=0) and (n%2!=0):\r\n res = (((m-1)*n)//2)+n//2\r\nelse:\r\n res = (m*n)//2\r\nprint(res)", "m, n = map(int, input().split())\r\n\r\n\r\nif 0 < m <= 16:\r\n if m <= n:\r\n s = m * n\r\n d = s // 2\r\n print(d)", "n,k=map(int,input().split())\r\nprint(n * k // 2)", "m, n = map(int, input().split())\r\npr= m*n\r\ntl= pr//2\r\nprint(tl)\r\n", "\n\n\n\n\n\n\n\n\n\n\n\n\n\nx,y = map(int,input().split())\nt = x*y\nprint(t//2)\n\t \t\t \t \t \t\t\t \t\t \t \t\t \t\t \t \t", "M,N=map(int,input().split())\r\nba=M*N\r\nprint(ba//2)", "import math\r\n\r\nip = input()\r\nm,n = int(ip.split(\" \")[0]), int(ip.split(\" \")[1])\r\nif (m>n) or (n>16) or (m<1):\r\n print(\"\")\r\n\r\nres = math.floor((m*n)/2)\r\nprint(res)", "(a,b)=map(int,input().split())\r\nc=a*b\r\nd=c//2\r\nprint(d)\r\n", "n = input().split(' ')\r\narea1 = int(n[0])\r\narea2 = int(n[1])\r\n\r\narea = area1*area2\r\n\r\nif area%2 == 0:\r\n dominoes = area/2\r\nelse:\r\n while area%2 != 0:\r\n area = (area - 1)\r\n dominoes = area/2\r\nprint(int(dominoes))", "n,m=map(int,input().split())\r\nans=0\r\nans+=(n*(m//2))\r\nif(m%2):\r\n ans+=n//2\r\nprint(ans)", "num_array = input().split()\r\n \r\nx = int(num_array[0])\r\nz = int(num_array[1])\r\n\r\nprint(int(x*z/2))", "m, n = map(int, input().split())\r\nshell = n * m\r\nif (n * m) % 2 == 0:\r\n print(shell // 2)\r\nelse:\r\n print((shell - 1)//2)\r\n", "aa,bb = map(int,input().split(' '))\nprint((aa*bb)//2)\n\t\t\t \t\t \t\t \t \t\t \t \t \t \t \t \t", "x = input()\r\n\r\nsplit_index = 0\r\n\r\nfor i in range(len(x)):\r\n if(x[i] == \" \"):\r\n split_index = i\r\n break\r\n\r\nwidth, length = int(x[:split_index]), int(x[split_index+1:])\r\n\r\nprint((int(width*length/2)))\r\n", "w = input()\r\nn, m = w.split()\r\nn = int(n)\r\nm = int(m)\r\nprint((n // 2 * m) + (n % 2)*(m // 2))", "def calc(lenth,width):\r\n return((m*n) // 2)\r\n \r\nm,n = list(map(int,input().split()))\r\nprint(calc(m,n))", "n=input()\r\nn=n.split()\r\nn=list(n)\r\nn=list(map(int,n))\r\nprint ((n[0]*n[1])//2)\r\n\r\n", "#qwertyuio\r\nprint(eval(input().replace(' ','*'))//2)\r\n#sdfghj", "def domino(n,m):\r\n return (n*m)//2\r\nn,m=list(map(int,input().split()))\r\nprint(domino(n,m))\r\n", "x,y=map(int,input().split())\r\nm=x*y\r\nif(m%2==1):\r\n r=(m-1)/2\r\n print(int(r))\r\nelse:\r\n print(int(m/2))", "x = list(map(int, input().split()))\r\nprint(x[1]*x[0]//2)", "from unittest import result\n\n\nnum_1, num_2 = map(int,input().split())\nresult = num_1 * num_2\nprint(result//2)", "a,b=map(int,input().split())\r\nif (a==1) or (b==1):\r\n print(max(a,b)//2)\r\nelif (a%2==0 and b%2!=0) or (a%2!=0 and b%2!=0):\r\n print(a*(b//2)+(a//2))\r\nelif (a%2==0 and b%2==0):\r\n print(a*(b//2))\r\nelse:\r\n print(a*(b//2))\r\n", "a = input()\r\na = list(a.split(\" \"))\r\na = [ int(x) for x in a ]\r\n\r\nlength = a[0]\r\nwidth = a[1]\r\n\r\n# each domino is 2*1 and board is length*width\r\n\r\nif (length % 2 != 0 and width % 2 != 0):\r\n print(int(((length*width)-1)/2))\r\n\r\nelse:\r\n print(int((length*width)/2))", "n,m = input().split()\nn = int(n) \nm=int(m)\nif (n*m)%2!=0:\n print(int(((n*m-1)/2)))\nelse:\n print(int(n*m/2))\n\n \t \t \t \t\t \t\t\t \t \t \t", "n, m = map(int, input().split())\r\nrectArea = n*m\r\n\r\nif(rectArea % 2 == 0):\r\n print(int(rectArea/2));\r\n\r\nelse:\r\n print(int((rectArea-1)/2));\r\n\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/50/A\n\n(m, n) = map(int, input().split(' '))\nminimum = min(m, n)\ncount = 0\n\ncount += (minimum ** 2) // 2\nremaining = abs(m - n)\ncount += (remaining * minimum) // 2\n\nif ((minimum % 2) != 0):\n if ((remaining % 2) != 0):\n count += 1\n\nprint(count)", "m,n = map(int, input().split())\r\npeices= ((m*n)//2)\r\nprint(peices)", "m,n=[int(x) for x in input().split()]\r\n\r\ntotal = int(m*n / 2)\r\nprint(total)\r\n \r\n ", "class hlo:\r\n def sq(m,n):\r\n return (m*n)//2\r\n \r\n\r\n\r\n\r\nm , n = map(int,input().split())\r\nres = hlo.sq(m,n)\r\nprint(res)\r\n ", "import math\r\nm,n=map(int,input().split())\r\nans=math.floor(m*n/2)\r\nprint(ans)", "st = input().split()\r\nm = int(st[0])\r\nn = int(st[1])\r\nmul = m*n\r\nmul = mul//2\r\nprint(mul)", "a=input()\r\nlst=list(a.split(\" \"))\r\nprint(int(lst[1])*int(lst[0])//2)", "rook=input()\r\nrole=rook.split()\r\nM=int(role[0])\r\nN=int(role[1])\r\nimport math\r\nprint(math.floor(M*N/2))", "M,N= map(int, input().split())\nmax_ds = (M * N) // 2\nprint(max_ds)\n\t\t \t\t\t \t \t\t \t \t \t\t \t", "from math import floor\r\nx = input()\r\nm = int(x[:x.find(' ')])\r\nn = int(x[x.find(' ')+1:])\r\nz = floor((m*n)/2)\r\nprint(z)", "#region Header\r\n#!/usr/bin/env python3\r\n# from typing import *\r\n\r\nimport sys\r\nimport io\r\nimport math\r\nimport collections\r\nimport decimal\r\nimport itertools\r\nimport bisect\r\nimport heapq\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\nsys.setrecursionlimit(1000000)\r\n#endregion\r\n\r\n# _INPUT = \"\"\"# paste here...\r\n# \"\"\"\r\n# sys.stdin = io.StringIO(_INPUT)\r\n\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n ans = a * b // 2\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "str1 = input().split(\" \")\r\nn = int(str1[0])\r\nm = int(str1[1])\r\n\r\nprint(int((n*m)/2))", "n,p=map(int,input().split())\r\nk=int(n*p/2)\r\nprint(k)", "r,s = map(int, input().split())\r\ntotal = int(r*s / 2)\r\nprint(total)", "N,M = map(int,input().split())\r\nprint(N*M//2)", "a,b=map(int,input().split())\r\nfinal=int(a*b/2)\r\nprint(final)", "n,m=map(int,input().split())\r\np=n*m\r\ns=p//2\r\nprint(s)", "res = [int(i) for i in input().split()]\r\nmult = res[0] * res[-1]\r\nprint(mult // 2)\r\n\r\n", "\r\nboard = list(input().split(' '))\r\n\r\ngrid = int(board[0]) * int(board[1])\r\n\r\nprint(int(grid/ 2))", "txt = input()\ntxt = txt.split()\nm = int(txt[0])\nn = int(txt[1])\nprint(m * n //2)\n", "input1 = list(map(int,input().split()))\r\na = input1[0]\r\nb = input1[1]\r\nprint((a*b)//2)", "area = input()\r\nareaList = area.split(\" \")\r\ntotalArea = int(areaList[0]) * int(areaList[1])\r\n \r\nprint(totalArea//2)", "l = list(map(int,input().split()))\r\n\r\nans = 1\r\nfor i in l:\r\n ans = ans*i\r\n\r\nprint( ans //2 )", "n, m = list(map(int, input().split()))\r\na = int((n*m)/2)\r\nprint(a)\r\n", "a,b=map(int , input().split())\r\nprint((a*b)//2)\r\n", "acc= (input().split())\r\nn= int(acc[0])\r\nm = int(acc[1])\r\na = int(m*n)\r\np= int(a//2)\r\nprint (p)", "m, n = input().split()\r\n\r\nm = int(m)\r\nn = int(n)\r\n\r\nnumberOfSquares = m*n\r\n\r\nprint(numberOfSquares // 2)\r\n", "m,n=map(int, input().split())\r\nif (m*n)%2==0:\r\n a=(m*n)//2\r\n print(a)\r\nelse:\r\n b=((m*n)-1)//2\r\n print(b) ", "m, n = map(int,input().split())\r\nS = m*n\r\nkol = S//2\r\nprint (kol)", "M,N= [int(M) for M in input().split()]\r\nif (N%2==0)and(M%2==0):\r\n k=(N//2)*M\r\nelif (N%2==0)and(M%2!=0):\r\n k=(N//2)*M\r\nelif (N%2!=0)and(M%2==0):\r\n k=(M//2)*N\r\nelse:\r\n k=((M-1)//2)*(N-1)+((N-1)//2)+((M-1)//2)\r\nprint(k)", "x=str(input())\r\nspaceindex=int(x.index(\" \"))\r\nm=int(x[0:spaceindex])\r\nn=int(x[(spaceindex+1):])\r\nif n<2 and m<2:\r\n print(0)\r\nelif n%2==1 and m%2==1:\r\n print(int((n*m-1)/2))\r\nelse:\r\n print(int(n*m/2))", "import math\r\nvalues = input().split()\r\nprint(math.floor(int(values[0])*int(values[1]) / 2))", "m,n = map(int,input().split())\r\nif m%2==0 or n%2==0:\r\n max_number = (m*n)/2\r\nelse:\r\n max_number = (m*n-1)/2\r\nprint(int(max_number))", "n, m = map(int, input().split())\r\n\r\n\r\nmax_dominoes = (n * m) // 2\r\n\r\nprint(max_dominoes)", "#50A Domino piling\r\nx,y=map(int,input().split())\r\na=x*y\r\nprint(a//2)", "M, N = map(int, input().split())\r\nmaximum_dominoes = (M * N) // 2\r\nprint(maximum_dominoes)\r\n", "a,b=[int(x) for x in input().split()]\r\nc=a*b\r\nprint(c//2)", "a = str(input())\r\na = a.split(\" \")\r\na[0] = int(a[0])\r\na[1] = int(a[1])\r\nprint(((a[1])*(a[0]))//2)", "import sys\r\nnum = 0\r\ninput = sys.stdin.readline().split()\r\na = int(input[0])\r\nb = int(input[1])\r\nnum = (a * b) // 2\r\nprint(num)", "(m,n)=map(int,input().split())\r\nprint(m*n//2)\r\n\r\n\r\n\r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n \r\nif __name__ == '__main__':\r\n \r\n line1 = inlt()\r\n \r\n m = line1[0]\r\n n = line1[1]\r\n \r\n domino_count = (m * n) // 2\r\n \r\n print(domino_count)", "import math\r\nM, N = map(int, input().split())\r\ntemp = M*N\r\nresult = math.floor(temp/2)\r\nprint(result)", "num = input()\r\nalist = num.split(' ')\r\nm = int(alist[0])\r\nn = int(alist[1])\r\n\r\nnum1 = m*n\r\n\r\nnum2 = num1//2\r\n\r\nprint(num2)", "m, n = (int(e) for e in input().split())\r\nprint(m*n//2)", "M, N = map(int, input().split())\n\n# Calculate the total number of squares on the board\ntotal_squares = M * N\n\n# Calculate the maximum number of dominoes\nmax_dominoes = total_squares // 2\n\n# Print the result\nprint(max_dominoes)\n\n \t \t\t\t\t \t\t\t \t \t \t\t\t", "inputline = input()\ninputline = inputline.split(' ')\nM = int(inputline[0])\nN = int(inputline[1])\nboard_size = M * N\nif board_size % 2 == 0:\n print(int(board_size / 2))\nelse:\n print(int((board_size-1)/2))", "x,y=input().split()\r\nif int(x)*int(y)%2==0:\r\n\tprint(int((int(x)*int(y))/2))\r\n\t\r\nelse:\r\n\tprint(int(((int(x)*int(y))-1)/2))\r\n", "m,n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nd = (m*n)//2\r\nprint(d)", "x,y = input().split(\" \")\nx =int(x)\ny =int(y)\nproduct = x*y\nstand = 2\n\nprint(int(product//stand))\n\n \n \n \n \t \t\t \t \t \t \t\t \t \t\t \t", "Mond, N = map(int, input().split())\r\nprint((Mond*N)//2)", "import sys\ninput = sys.stdin.readline\ndef main():\n m, n = [int(num) for num in input().strip().split(' ')]\n\n if n % 2 == 0:\n return n // 2 * m\n return n // 2 * m + (n % 2 * m // 2)\n\n\n\n\n\nif __name__ == \"__main__\":\n print(main())\n", "import math\r\nm, n = input().split()\r\n\r\narea = math.floor((float(m) * float(n)) / 2)\r\nprint(area)", "M,N = map(int,input().split())\r\nif M*N %2==0:\r\n print(\"{0:.0f}\".format(M*N/2))\r\nelse:\r\n print(M*N//2)", "print(__import__('math').prod(map(int,input().split()))//2)", "domino_area = 2\r\nm, n = map(int, input().split())\r\nboard_area = m*n\r\ndomino_count = board_area//domino_area\r\nprint(domino_count)\r\n", "l = input().split()\r\nx = int(l[0])\r\ny = int(l[1])\r\nA = x * y\r\nc = 0\r\nwhile A != 0:\r\n if A >= 2:\r\n A = A - 2\r\n c = c + 1\r\n elif A < 2:\r\n break\r\nprint(c)", "m,n = list(map(int,input().split())); \r\nif m%2 == 0:\r\n max = (m/2)*n\r\nelse :\r\n max = ((m-1)/2)*n + int(n/2)\r\n \r\nprint(int(max))", "m, n = map(int, input().split())\r\nlet = int(m*n / 2)\r\nprint(let)", "M,N=[int(x) for x in input().split()]\r\nS=M*N\r\nif S%2==0:\r\n print(int(S/2))\r\n pass\r\nelse:\r\n print(int((S-1)/2))", "M, N = map(int, input().split())\r\nprint(max(M // 2 * N + M % 2 * N // 2, N // 2 * M + N % 2 * M // 2))\r\n", "m, n = map(int, input().split())\r\nprint(divmod(m * n, 2)[0])", "if __name__ == '__main__':\r\n n, m = map(int, input().split(' '))\r\n print(n * m // 2)\r\n", "x,y = map(int, input().split())\nif x%2 == 0:\n print(int(y*(x/2)))\nelse:\n if y%2 ==0:\n print(int(x*(y/2)))\n else:\n print(int(((x*y)-1)/2))\n \t\t\t \t \t\t \t\t \t \t\t \t\t\t \t\t \t", "def numOfDominoes():\r\n inp = input()\r\n inp = inp.split()\r\n p = 1\r\n for item in inp:\r\n p *= int(item)\r\n return p//2\r\nprint(numOfDominoes())", "#c = 1\r\n#while c == 1:\r\n# n, m = map(int, input(\"Entra el número de filas y columnas:\\n\" ).split())\r\nn, m = map(int, input().split())\r\n #print (n)\r\n #print (m)\r\ns= n * m\r\nprint (s//2)\r\n # c = int (input (\"Quieres continuar? 0:No, 1:Sí ?\"))\r\n # if c == 0: \r\n # break;\r\n#rint (\"Gracias por jugar\")\r\n#if c == 0:\r\n #print (\"c=0\")\r\n#else:\r\n #print (\"c=\", c)", "map = input().split()\r\nn = int(map[0])\r\nm = int(map[1])\r\nprint((n * m) // 2)", "a = input()\r\nargs = a.split()\r\na = int(args[0])\r\nb = int(args[1])\r\nmultiply = a * b\r\nif multiply % 2 == 0:\r\n print(int(multiply / 2))\r\nelse:\r\n multiply = multiply - 1\r\n print(int(multiply / 2))", "m,n = map(int,input().split())\r\nb=m*n\r\nprint(b//2)", "# 50A-Domino piling\r\n\r\nn, k = map(int, input().split())\r\nprint((n*k)//2)", "l, w = map(int, input().split(\" \"))\r\nprint(0) if l * w < 2 else print(l * w // 2)", "import sys\r\n\r\nnumb = [int(i) for i in sys.stdin.readline().split()]\r\nM = numb[0]\r\nN = numb[1]\r\nprint(int(M*N/2))", "import math\r\nn,m = map(int,input().split())\r\nprint(math.trunc((m*n)/2))", "str=input()\r\nm=str.split(' ')\r\nprint(int(m[0])*int(m[1])// 2)", "nums = input()\r\nx = nums.split(' ')\r\ncasillas = int(x[0])*int(x[1])\r\nif casillas%2 == 0:\r\n print(int(casillas/2))\r\nelse:\r\n print(int((casillas-1)/2))", "n,m=map(int,input().split())\ns=0\nif n%2:\n s+=m//2\nif m%2:\n s+=n//2\nn-=n%2;m-=m%2\ns+=(n//2)*m\nprint(s)", "import math\r\nn,k=map(int,input().split(\" \"))\r\np=(n*k)/2\r\nprint(math.floor(p))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\nx=input(\"\").split()\r\nwhile int(x[0]) < 1 or int(x[0]) > int(x[1]) or int(x[1]) > 16 :\r\n x=input(\"\").split()\r\nz = int(x[0]) *int(x[1])\r\nif z%2 > 0 :\r\n z = z -1\r\n z=math.floor(z)\r\nprint(int(z/2))", "m, n = map(int, input().split())\r\nS = m * n\r\nprint(int(S / 2))", "l = input().split(' ')\r\nM = int(l[0])\r\nN = int(l[1])\r\nprint((M // 2) * N + (N // 2) * (M % 2))", "a,b=map(int,input().split())\r\nl=a*b \r\nprint(int(l/2))", "m, n = map(int, input().split())\r\na = int(m*n / 2)\r\nprint(a)", "# 코드포스 50A Domino piling\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nM, N = map(int, put().split())\r\nprint(M * N // 2)", "m,n = map(int,input().split())\r\nd=2\r\nc=m*n\r\nprint(c//d)\r\n", "l=list(map(int,input().strip().split()))\r\nm=l[0]\r\nn=l[1]\r\nprint((m*n)//2)\r\n", "l,b=map(int, input( ) . split( ) )\nprint( (l*b)//2 )\n\t \t\t\t\t \t \t \t\t \t \t\t", "z, s = map(int, input().split())\r\ntotal = int(z*s / 2)\r\nprint(total)", "m,n = map(int, input().split())\r\n\r\ngained = []\r\nfor y in range(1, n+1):\r\n for x in range(1, m+1):\r\n if x%2 == 0:\r\n t1 = (x-1, y)\r\n t2 = (x, y)\r\n gained.append(t1)\r\n gained.append(t2)\r\n\r\nfor x in range(1, m+1):\r\n for y in range(1, n+1):\r\n if y%2 == 0 and (x, y) not in gained:\r\n t1 = (x, y) \r\n t2 = (x, y-1)\r\n gained.append(t1)\r\n gained.append(t2)\r\n\r\nprint(round(len(gained)/2))", "M, N = map(int, input().split(' '))\r\nprint(int(M*N/2))", "r,k=map(int,input().split()) \nmulti=r*k \nL=2*1 \ndomp=multi//L\nprint(domp)\n \t\t \t\t \t\t\t \t\t \t\t \t\t \t\t", "\r\nl=[]\r\n#n=int(input())\r\n#for i in range(n):\r\ntemp=input().split()\r\ntemp = list(map(int, temp))\r\n\r\nmul=1\r\nfor i in range(len(temp)):\r\n mul*=temp[i]\r\nprint((mul//2))\r\n\r\n\r\n \r\n ", "m,n = [int(x)for x in input().split()]\r\narea = m*n\r\nans = int(area/2)\r\nprint(ans)", "import math\r\nM,N=map(int,input().split())\r\nprint(math.floor(M*N/2))", "m, n = (int(i) for i in input().split())\r\nif m % 2 == 0:\r\n print(m // 2 * n)\r\nelif n % 2 == 0:\r\n print(n // 2 * m)\r\nelse:\r\n print((m - 1) // 2 * (n-1) + m // 2 + n // 2)", "m,n=map(int,input().split())\r\nif n%2 != 0 and m%2 != 0:\r\n\tx=(m*n)//2\r\nelse:\r\n\tx=(m*n)/2\r\nprint(int (x))", "M,N=input().split()\r\nM=int(M)\r\nN=int(N)\r\nif M*N!=1:\r\n if N%2==0 and M%2==0 or N%2!=0 and M%2==0 or N%2==0 and M%2!=0:\r\n s= int(M*N/2)\r\n else:\r\n s=int((M*N/2))\r\nelse:\r\n s=0\r\n\r\nprint(s)\r\n", "import math\r\nn,m=map(int,input().split())\r\ntotal=0\r\nsum=n*m\r\nif (sum%2==0 or sum%2!=0):\r\n total=sum/2\r\nprint(math.floor(total))", "m ,n = map(int, input().split())\n\nans = (m*n)/(2*1)\n\nprint(int(ans))\n", "try:\r\n m,n=map(int,input().split())\r\n area=m*n\r\n print((m*n)//2)\r\nexcept:\r\n pass", "#Укладка доминошками\r\ndLen,dWid=list(map(int,input().split(\" \")))\r\nfLen,fWid=[2,1]\r\nprint(dLen*dWid//(fLen*fWid))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "m,n=map(int,input().split())\r\nif m*n%2==0:\r\n print(int(m*n/2))\r\nelse:\r\n t=m*n-1\r\n print(int(t/2))", "m, n = map(int, input().split())\nif n % 2 == 0:\n print(m*(n//2))\nelse:\n print((m*((n-1)//2))+(m//2))\n", "import math\r\n\r\nM,N = list(map(int, input().split()))\r\n\r\nprint(math.floor(M*N/2))", "mn = input()\r\nL=mn.split()\r\nm=int(L[0])\r\nn=int(L[1])\r\narea_board = m * n\r\n\r\nif area_board % 2 == 0:\r\n print(int(area_board / 2))\r\nelif area_board % 2 != 0:\r\n area_board = area_board - 1\r\n print(int(area_board / 2))", "M,N=map(int,input().split())\r\na=M*N\r\nprint(int(a/2))", "firstInput = input().split()\r\nproduct = int(firstInput[0]) * int(firstInput[1])\r\nif product % 2 == 0:\r\n print(int(product/2))\r\nelse:\r\n print(int((product-1)/2))\r\n", "r=[int(x) for x in input().split(\" \")]\r\nbroj_mogucih=0\r\nif r[0]%2==0:\r\n broj_mogucih=r[0]/2*r[1]\r\nif r[0]%2==1:\r\n broj_mogucih=((r[0]-1)/2*r[1])\r\n if r[1]%2==0:\r\n broj_mogucih=broj_mogucih+r[1]/2\r\n if r[1]%2==1:\r\n broj_mogucih=broj_mogucih+(r[1]-1)/2\r\nprint(int(broj_mogucih))\r\n", "import math\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n\r\n print(math.floor(n * m * 0.5))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m, n = [int(i) for i in input().split()]\r\nprint(int((m*n)/2))", "m,n=map(int,input().split())\r\nx=m*n\r\nc=0\r\nwhile x>1:\r\n x-=2\r\n c+=1\r\nprint(c)", "import math\r\nm,n=map(int,input().split())\r\np=math.floor(m*n/2)\r\nprint(p)", "M, N = map(int, input().split())\r\nif M % 2 == 0 or N % 2 == 0:\r\n print(int(M * N / 2))\r\nelse:\r\n print(int((M * N - 1) / 2))\r\n", "x , y = input().split()\r\nx = int(x)\r\ny = int(y)\r\nproduct = x * y\r\nprint(product//2)", "m,n = tuple(map(int, input().split(' ')))\r\nif m % 2 != 0:\r\n blocks = ((m-1)*n)//2\r\n if n % 2 != 0: blocks += (n - 1) // 2\r\n else: blocks += n // 2\r\nelse:\r\n blocks = (m*n) // 2\r\nprint(blocks)", "m,n=map(int,input().split())\r\nif 1<=n<=16 and 1<=m<=16:\r\n print(int((m*n)/2))", "a=list(map(int,input().split()))\r\nm = a[0]\r\nn = a[1]\r\nb =m*n\r\nprint(b//2)", "x = input()\r\nx = x.split()\r\nn = int(x[0]) * int(x[1])\r\nprint(int(n/2))", "m, n = map(int, input().split(' '))\r\nprint(m//2*n+(m%2)*n//2)", "n, k = [int(c) for c in input().split()]\r\n\r\nprint((n * k) // 2)", "num = input().split(\" \")\r\nprint((int(num[0]) * int(num[1])) // 2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 13 20:45:40 2022\r\n\r\n@author: lpf\r\n\"\"\"\r\n\r\na,b=input().split()\r\nm=int(a);n=int(b)\r\nif m%2==0:\r\n print(int(m*n/2))\r\nelse:\r\n if n%2==0:\r\n print(int(m*n/2))\r\n else:\r\n print(int(m*n/2))\r\ntype(m)\r\n", "def sol(m,n):\r\n return m*n//2\r\n\r\nm,n=map(int ,input().split())\r\nprint(sol(m,n))", "m, n = list(map(int, input().split()))\nprint((n*m) // 2)\n", "import math\r\n\r\nm, n = map(int,input().split(\" \"))\r\nprint(math.floor((m*n)/2))", "m, n = map(int, input().split())\r\nDOMINO = 2\r\ndeskSquare = m * n\r\n\r\nprint(deskSquare // DOMINO)\r\n", "M,N=map(int, input(). split())\nn=M*N\np=n//2\nprint(p)\n\t\t\t\t\t \t \t \t\t\t \t \t \t \t", "def main():\r\n n, m = map(int, input().split())\r\n s = n*m\r\n print(s//2)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k =map(int, input().split(\" \"))\r\narea = n*k\r\nprint(area//2)\r\n\r\n\r\n \r\n\r\n", "M, N = [int(i) for i in input().split()]\r\ndomino_count = M//2*N\r\nif M % 2 != 0:\r\n domino_count += N//2\r\nprint(domino_count)", "m , n = map(int, input().split())\r\nif m % 2 == 0:\r\n print(m // 2 * n)\r\nelif n % 2 == 0:\r\n print(n // 2 * m)\r\nelse: print((m * n - 1) // 2)", "s = input()\r\nn = int(s.split(\" \")[0])\r\nm = int(s.split(\" \")[1])\r\nprint(n * m // 2)", "M,N = map(int,input().split())\r\na = (M * N) // 2\r\nprint(a)", "import math\r\n\r\nM, N = map(int, input().split())\r\n\r\na = 0\r\nb = 0\r\n\r\nif N > 1:\r\n if N%2 == 0:\r\n a = N // 2\r\n else:\r\n a = int(math.floor(N / 2))\r\n b = 1\r\n print(a * M + b * int(math.floor(M / 2)));\r\nelse:\r\n if M>1:\r\n print(int(math.floor(M / 2)));\r\n else:\r\n print(\"0\");", "x=input().split()\r\nprint(int(x[0])*int(x[1])//2)", "a,b = list(map(int,input().split()))\r\nprint(int((a*b)/2))", "m,n=map(int,input().split())\nmax=(m*n)//2\nprint(max)\n\t\t \t \t \t\t\t \t\t\t \t \t \t\t\t \t\t", "li = list(map(int, input().split()))\r\n\r\nm = li[0]\r\nn = li[1]\r\n\r\ns = m*n\r\n\r\nmax_domino = s/2\r\n\r\nprint(int(max_domino))\r\n", "m,n=map(int,input().split())\r\nif((m==n)and (m==1)):\r\n h=0\r\nelse:\r\n h=(m*n)//2\r\nprint(h)", "import sys\r\nrow, col = [int(dimension) for dimension in input().strip().split(' ')]\r\nprint( (row * (col // 2)) + (row // 2) if col % 2 == 1 else row * (col // 2))\r\n", "M, N = map(int, input().split())\r\nx = (M*N)//2\r\nprint(x)", "M, N = map(int, input().split())\r\nk= (M * N) // 2\r\nprint(k)\r\n\r\n\r\n", "M,N=map(int, input(). split())\nn=M*N\np=n//2\nprint(p) #Domino piling program, the divided pieces should be an even number\n\n \t \t \t\t \t\t\t\t \t\t\t\t \t\t \t \t", "import math\r\n\r\na = input().split(\" \")\r\nb = int(a[0])\r\nc = int(a[1])\r\n\r\narea = b*c\r\n\r\nprint(math.floor(area/2))", "m,n=map(int,input().split()) \r\nmultiply = m*n\r\nresult = multiply//2\r\nprint(result)", "i,j=input().split()\r\nk=int((int(i)*(int(j)))/2)\r\nprint(k)", "m, n=map(int,input().split())\r\nr=m*n\r\nc=0;\r\nv=2;\r\nfor i in range(0,r, 2):\r\n c=c+1;\r\nif(r%2!=0):\r\n c=c-1\r\nprint(c)", "n, m = map(int, input().split())\r\no = (n * m) // 2\r\nprint(o)", "m,n=map(int,input().split())\r\nk=m*n\r\ni=1\r\nwhile i>0:\r\n d=2*i\r\n if(d==k):\r\n print(i)\r\n break\r\n if(d>k):\r\n print(i-1)\r\n break\r\n i+=1\r\n ", "\r\n\r\na, b = map(int, input().split())\r\nnumber = a * b\r\nif (number != 9):\r\n number = int(number/2)\r\n print(number)\r\nelse:\r\n print(4)", "x,yu=map(int,input().split())\nd=(x*yu)/2\nprint(int(d))\n\t\t \t\t\t\t\t \t \t \t\t \t", "M, N = input().split(\" \")\r\narea = int(M)* int(N) // 2\r\nprint(area)\r\n", "m, n = input().split()\nm = float(m)\nn = float(n)\nx = n*m\ny = float(x/2)\nprint(int(y))", "inpt = list(map(int, input().split()))\r\nsize = inpt[0]*inpt[1]\r\nif size % 2 == 0:\r\n print(int(size/2))\r\nelse:\r\n print(int((size-1)/2))", "M,N=map(int,input().split())\r\nprint(int((M*N)/2))", "a,b=[int(x) for x in input().split()]\r\nprint(int(a*b/2))", "numb = list(map(int, input().split()))\r\nide = numb[1] * numb[0]/2\r\nprint(int(ide))", "#!/usr/bin/python3\r\ndef get_int_list(string_list):\r\n return list(map(lambda a: int(a), string_list.split(' ')))\r\n\r\n\r\nif __name__ == '__main__':\r\n board_dimensions = get_int_list(input())\r\n board_size = board_dimensions[0] * board_dimensions[1]\r\n number_of_dominos = board_size // 2\r\n print(number_of_dominos)\r\n", "m,n = (input().split(\" \"))\r\nboard = int(m) * int(n)\r\ndominoes = 0\r\nif board%2 == 0:\r\n dominoes = board/2\r\nelif board%2 != 0:\r\n board = board - 1\r\n dominoes = board/2\r\n\r\nprint(int(dominoes))", "l = input().split(\" \")\r\nm = int(l[0])\r\nn = int(l[1])\r\nprint((m*n)//2)\r\n", "import math\r\nm,n=map(int,input().split())\r\n\r\narea = m*n\r\n\r\nans=math.floor(area/2)\r\n\r\nprint(ans)", "def dominos(a,b):\n c=a*b/2\n print(int(c))\n\n\na,b=map(int,input().split())\ndominos(a,b)\n \t \t \t \t\t \t \t \t \t\t\t\t \t\t", "m, n = map(int, input().split())\nsquares = m * n\ndominoes_in_squares = squares / 2\n\nprint(int(dominoes_in_squares))", "input_data = input().split()\r\nM, N = int(input_data[0]), int(input_data[1])\r\n\r\ntotal_squares = M * N\r\nmax_dominoes = total_squares // 2\r\n\r\nprint(max_dominoes)", "size=list(map(int,input().split()))\r\ni=1\r\nfor x in size:\r\n i=i*x\r\nprint(i//2) ", "n,m,=input().split()\nn=int(n)\nm=int(m)\nz=(n*m)/2\nx=int(z)\nprint(x)\n \t \t \t\t\t\t\t\t\t\t\t \t \t\t \t \t \t", "l= list(map(int, input().split(\" \")))\r\na=int(l[0])\r\nb=int(l[1])\r\nm=(a*b)//2\r\nprint(m)", "m,n = map(int,input().split())\r\nS = m * n\r\nprint(S//2)", "n,m= input().split()\r\nn=int(n)\r\nm=int(m)\r\nb=(m*n)/2\r\nprint(int(b))", "from math import floor\r\nm,n = map(eval,input( ).split())\r\np=m*n\r\ni=p/2\r\nprint(floor(i))\r\n", "def alada(gukha):\r\n str = gukha.split()\r\n m = str[0]\r\n n = str[1]\r\n\r\n m = int(m)\r\n n = int(n)\r\n\r\n p = int(m*n)\r\n a = int(p/2)\r\n\r\n print(a)\r\n\r\nlol = input()\r\n\r\nalada(lol)", "all = input()\r\nall = all.split()\r\nsigr = int(all[0])\r\nsiga = int(all[1])\r\njam = (sigr*siga)//2\r\nprint(jam)", "m,n=map(int,input().split())\r\ns=2;count=0\r\nfor i in range(1,m*n):\r\n if m*n>=i*s:\r\n count+=1\r\nprint(count) ", "n,m = map(int,input().split())\r\nj =0\r\nd = n*m\r\nk = 0\r\nwhile k < d / 2:\r\n k += 1\r\n if d % 2 ==0:\r\n \r\n j += 1\r\n else:\r\n \r\n j = k - 1\r\nprint(j)", "m, n = map(int, input().split())\n\nmatrix = [[0 for _ in range(n)] for _ in range(m)]\n\ncounter = 0\n\nfor r in range(m):\n for col in range(0, n, 2):\n \n if matrix[r][col]:\n continue\n\n if col == n - 1:\n if r != m - 1:\n if not matrix[r+1][col]:\n matrix[r+1][col] = 1\n counter += 1\n \n elif not matrix[r][col+1]:\n counter += 1\n matrix[r][col+1] = 1\n\nprint(counter)\n", "m,n = input().split()\nm = int(m)\nn = int(n)\n\nque = int(m*n)\nsum = int(que/2)\n\n\nprint(sum)\n\n\t\t \t\t\t \t\t \t\t\t \t \t \t\t \t", "# 5 Domino piling 28m https://codeforces.com/problemset/problem/50/A\r\n# O()t | O()s 9:15-9:24 = 9m\r\ndef domino_piling(m, n):\r\n horizontal = n // 2\r\n horizontal *= m\r\n if n % 2 == 1:\r\n horizontal += (m//2)\r\n print(horizontal)\r\n \r\nm, n = input().split(' ')\r\nm, n = int(m), int(n)\r\ndomino_piling(m, n)", "a , n = map(int, input().split())\r\nb = a*n\r\nprint(b//2)\r\n", "m, n = map(int, input().split())\r\nprint(\"{0:.0f}\".format((m*n/2)//1))", "M,N=map(int,input().split())\r\nx=int(M*N/2)\r\nprint(x) \r\n\r\n\r\n ", "l=list(map(int,input().split(' ')))\r\nif l[0]%2==0:\r\n print(int(l[1]*(l[0]/2)))\r\nelse:\r\n if l[1]%2==0:\r\n print(int((l[1]*((l[0]-1)/2))+l[1]/2))\r\n else:\r\n print(int((l[1]*((l[0]-1)/2))+(l[1]-1)/2))", "(M , N) = map(int , input().split() )\r\nx = (M*N)/2\r\na = (M*N)%2\r\nif a>0 :\r\n x = ((M*N)-a)/2\r\nprint(int(x))\r\n", "x,y = input().split()\r\nx=int(x)\r\ny=int(y)\r\nresult = x*y\r\n\r\n\r\nif result % 2 == 0:\r\n print(f\"{int(result/2)}\")\r\nelse:\r\n print((int((result-1)/2)))", "dimensions = input().split(\" \")\r\nmults = []\r\nfor i in dimensions:\r\n mults.append(int(i))\r\nprint((mults[0]*mults[1])//2)", "M, N = map(int, input().split())\r\nS = M * N\r\nprint(S//2)", "def solve():\r\n m, n = map(int, input().split())\r\n a = m*n\r\n b = a % 2\r\n c = a/2\r\n\r\n if b == 0:\r\n print(int(c))\r\n else:\r\n a -= 1\r\n c = a/2\r\n print(int(c))\r\n\r\n\r\n#T = int(input())\r\nT = 1\r\nfor _ in range(T):\r\n solve()\r\n", "m, n=map(int, input( ).split( ))\ntotal=int(m*n/2)\nprint(total)#code done\n\n\n\t\t\t\t \t\t\t\t \t\t\t \t \t \t \t \t\t", "line = input()\r\nline = line.replace(\"\\n\",\"\").split(\" \")\r\ntotalSquare = int(line[0]) * int(line[1])\r\nprint(totalSquare // 2)", "a = input().split()\r\nb = int(a[0])\r\nc = int(a[1])\r\nprint((b * c) // 2)", "m,n = map(int, input().split())\r\nif m == 1 and n == 1:\r\n print(0)\r\n \r\nelse:\r\n mad = int(m*n) // 2\r\n print(mad)", "x, y = map(int, input().split(' '))\n\nmax = (x * y)/2\n\nprint(int(max))\n", "n,m=map(int,input().split())\r\nk=n*m\r\nprint(k//2)", "numbers = input()\r\nM = numbers.split()[0] \r\nN = numbers.split()[1]\r\n\r\nimport math\r\nprint(math.floor(int(M)*int(N)/2))", "a,b=map(int,input().split())\r\ntotal=a*b\r\nprint(total//2)", "M, N = map(int, input().split())\r\n\r\nif M % 2 == 1:\r\n print((M - 1) // 2 * N + N // 2)\r\nelse:\r\n print(M * N // 2)", "n = input()\r\nm = int(n[0:2]) * int(n[2::])\r\n\r\np = m // 2\r\n\r\nprint(p)", "l=list(map(int,input().split()))\r\nm=l[0]\r\nn=l[1]\r\nans=m*n\r\nres=ans//2\r\nprint(res)\r\n\r\n", "m,n=map(int,input().split())\nt=m*n\na=t//2\nprint(a)\n \t \t\t \t \t\t \t\t\t\t\t\t\t\t\t \t\t", "n, m = map (int, input().split())\nA = n * m\nprint (A // 2)\n \t \t \t\t \t \t \t \t \t \t\t\t\t\t \t\t\t", "A, B = map(int, input().split())\r\nmax_dominoes = (A * B) // 2\r\nprint(max_dominoes)", "m,n = map(int,input().split())\r\nx=m*n\r\na=int(x/2)\r\nprint(a)", "s = input().split()\r\nsquares = int(s[1]) * int(s[0])\r\nif squares%2 == 0:\r\n print(squares//2)\r\nelse:\r\n print((squares-1)//2)", "inp = list(map(int, input().split(\" \")))\r\nproduct = inp[0] * inp[1]\r\n\r\nprint(product // 2)", "def max_no_dominos_finder(board_size):\r\n board_size = board_size.split()\r\n area = int(board_size[0]) * int(board_size[1])\r\n return int(area/2)\r\n\r\nboard_size = input()\r\nprint(max_no_dominos_finder(board_size))", "ch = input().split()\r\nch = list(map(int, ch))\r\nprint(ch[0] * ch[1] // 2)", "m, n = input().split()\r\nm, n = int(m), int(n)\r\n\r\nif m*n % 2 == 0:\r\n print(int((m*n)/2))\r\nelse:\r\n print(int((m*n-1)/2))", "w, h = map(int, input().split())\r\nnum = (w*h)//2 if w*h % 2 == 0 else ((w*h)-1)//2\r\nprint(num)\r\n", "c=list(map(int, input().split()))\na=c[0]\nb=c[1]\nif (a*b)%2==0:\n print(a*b//2)\nelse:\n print((a*b-1)//2)\n\n\n\n", "a,b = map(int,input().split(' '))\n# mmmmm\nprint((a*b)//2)\n \t \t\t\t\t \t\t\t\t\t\t\t \t\t", "x,y=map(int,input().split())\nprint(x*y//2)\n'''yrsfayudhgyafikshgfdhagskfj\narfgkdjahsgdcdvgiashgfdta'''\n\t\t\t \t\t\t\t\t \t\t\t\t\t \t\t\t \t \t \t \t", "import math\r\n\r\nm, n = input().split()\r\ntotal_area = int(m) * int(n)\r\n\r\nblocks = math.floor(total_area/2)\r\nprint(blocks)", "a,b=[int(x) for x in input().split()]\r\n\r\n#d=list(map(int,input().split()))\r\nr=int(a*b/2)\r\n\r\n\r\nprint(r)\r\n", "m,n=map(int,input().split())\r\nre=m*n\r\nk=re//2\r\nprint(k)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled27.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ONKGvMvyIXfuNPFvaUpUzugGy0kZpyjf\n\"\"\"\n\nimport math\nm,n=map(int,input().split())\narea = m*n\nfinal = math.floor(area /2)\nprint(final)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Dec 15 15:37:30 2021\r\n\r\n@author: mlee39\r\n\"\"\"\r\nimport math\r\nN, M = map(int, input().split())\r\n\r\nprint(math.floor(N*M/2))", "m,n = input().split()\r\nprint(int(m)*int(n)//2)", "a = [int(i) for i in input().split()]\r\nprint((a[0]*a[1])//2)\r\n", "l,b=map(int,input().split())\ntotal=int(l*b/2)\nprint(total)\n#vishal\n\t \t \t\t \t\t \t \t \t \t\t\t\t\t \t", "x, y = [int(x) for x in input().split()]\r\n\r\nprint(int(x * y / 2));", "import math\r\narray=input().split()\r\nm=int(array[0])\r\nn=int(array[1])\r\nprint(math.floor(m*n/2))", "size = input()\r\nsize = size.split(' ')\r\nm = size[0]\r\nn = size[1]\r\nif m is not int:\r\n m = int(size[0])\r\nif n is not int:\r\n n = int(size[1]) \r\n\r\nif (m and n):\r\n print((m * n) // 2)", "a=input()\r\n\r\ndominosize=a.split()\r\nm=int(dominosize[0])\r\nn=int(dominosize[1])\r\n\r\nif (m*n)%2==0:\r\n print(int(m*n/2))\r\n\r\nelse:\r\n print(int((((m*n)-1)/2)))", "m,n=map(int,input().split())\nif 1<=m and m<=n and n<=16:\n print(int((m*n)/2))\n\n\t \t\t \t\t\t \t\t\t\t\t\t \t\t\t", "n, m = [int(i) for i in input().split()]\r\narea = (n*m) // 2\r\nprint(area)", "def domino():\r\n dom = input()\r\n y = dom.split(' ')\r\n return (int(y[0]) * int(y[1])) // 2\r\n\r\nprint(domino())", "def solution():\n numbers = input().split()\n height, width = int(numbers[0]), int(numbers[1])\n\n half_height = int(height / 2)\n half_width = int(width / 2)\n\n result = 2 * half_height * half_width\n if height % 2 == 1 and width % 2 == 1:\n result += half_height + half_width\n elif height % 2 == 1 and width % 2 == 0:\n result += half_width\n elif height % 2 == 0 and width % 2 == 1:\n result += half_height\n\n print(result)\n\n\nif __name__ == \"__main__\":\n solution()\n", "obm=input().split()\r\na,b=int(obm[0]),int(obm[1])\r\nprint(a*b//2)\r\n", "m, n = map(int, input().split())\r\ntotal = 0\r\nif n%2==0:\r\n total = (n/2)*m\r\nelse:\r\n a = (n-1)/2*m\r\n if m%2==0:\r\n b = m/2\r\n else:\r\n b = (m-1)/2\r\n total = a+b\r\nprint(int(total))", "input = input()\r\nlista = input.split(' ')\r\nm = int(lista[0])\r\nn = int(lista[1])\r\nif (1<=m<=n<=16):\r\n print((m*n)//2)\r\nelse:\r\n exit()", "m,n=[int(x)for x in input().split()]\r\nboard=m*n\r\ndomino=2*1\r\nif board%domino==0:\r\n print(board//domino)\r\nelse:\r\n print(board//domino)", "\r\nm,n=map(int,input().split())\r\nk=0\r\nif n%2==0 or m%2==0:\r\n k=m*n/2\r\nelse:\r\n k=(m-1)*(n)/2+(n-1)/2\r\nprint(int(k))", "inputData = input ( '' )\n\ninputStrList = inputData.split ( ' ' )\n\nM = int ( inputStrList [ 0 ] )\nN = int ( inputStrList [ 1 ] )\n\nif M % 2 == 0:\n\n result = M / 2 * N\n\n print ( int ( result ) )\n exit ( )\nelse:\n\n result = int ( M / 2 ) * N + int ( N / 2 )\n\n print ( int ( result ) )\n exit ( )\n", "m,n=map(int,input().split())\r\nt=int(m*n / 2)\r\nprint(t)", "def main():\r\n a,b = [int(i) for i in input().split()]\r\n print(a*b//2)\r\nmain()\r\n", "n,k =map(int, input() .split())\r\na= int(n*k)\r\n\r\nb=int(2)\r\nc=int(a/b)\r\nprint(c)", "m,n=input().split()\r\nm,n=int(m),int(n)\r\nimport math\r\nprint(math.floor(m*n/2))", "F,S=map(int,input().split())\nmax_no_of_dominos=int(F*S/2)\nprint(max_no_of_dominos)\n \t \t\t \t \t \t \t \t \t \t\t \t\t\t\t", "\"\"\"https://codeforces.com/problemset/problem/50/A 800\"\"\"\r\n\r\n\r\ndef count_domino_pieces(n: int, m: int) -> int:\r\n return n * m // 2\r\n\r\n\r\nprint(count_domino_pieces(*list(map(int, input().split()))))\r\n", "a,b =input().split()\r\n\r\nx=int(a)\r\ny=int(b)\r\n\r\nmultiply=x*y\r\n\r\nresult=int(multiply/2)\r\n\r\nprint(result)", "import math \r\na =list(map(int, input().split()))\r\ns1 = a[0] * a[1]\r\ns2 = 2 \r\nprint(math.floor(s1 / s2))", "a,b=map(int,input().split())\nc=int(a*b)\nd=int(c/2)\nprint(d)\n\t\t\t \t \t \t\t\t \t\t \t \t\t\t \t \t", "def squares(m,n):\r\n\treturn (m * n) // 2\r\n\r\nm,n = [int(n) for n in input().split()]\r\nprint(squares(m,n))", "\nM, N = map(int, input().split())\na = 2 * 1\n\nprint(M * N // 2)\n", "m,n = map(int,input().split())\r\nd = (m*n)//2\r\nprint(d)", "a, b = input().split()\r\nboard = int(a)*int(b)\r\nprint(int(board/2))", "a,b = map(int,input().split())\r\n\r\nsol = int((a*b)/2)\r\nprint(sol)\r\n\r\n", "l = input().split(\" \")\r\nm = int(l[0])\r\nn = int(l[1])\r\n\r\nprint(int((m*n) / 2))\r\n", "m,n=map(int,input().split())\nres=int(m*n/2)\nprint(res)\n \t \t\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t\t \t\t", "import math\r\ndimensions = input().split(\" \")\r\ndimensions[0] = int(dimensions[0])\r\ndimensions[1] = int(dimensions[1])\r\nresult = math.prod(dimensions)//2\r\nprint(result)", "a,b=map(int,input().split())\r\na1=a*b\r\nprint(a1//2)", "# socks=[int(i) for i in input().split()]\r\n# red_socks = socks[0]\r\n# blue_socks = socks[1]\r\n# if red_socks <= blue_socks:\r\n# first_result = red_socks\r\n# else:\r\n# first_result = blue_socks\r\n# secod_result = abs(red_socks - blue_socks) // 2\r\n# print(str(first_result)+' '+str(secod_result))\r\n \r\n# nums = [int(i) for i in input().split()]\r\n# k = 0\r\n# for i in range(0, nums[0]//2+1):\r\n# print('#' * nums[1])\r\n# if i == nums[0] // 2:\r\n# break\r\n# if k == 0:\r\n# print('.' * (nums[1]-1) + '#')\r\n# k = 1 \r\n# else:\r\n# print('#' + '.' * (nums[1] - 1))\r\n# k = 0\r\n \r\n# num = [int(i) for i in input().split()]\r\n# max = num[0]\r\n# result=''\r\n# for i in range(len(num)):\r\n# if num[i] >= max:\r\n# max = num[i]\r\n# res=i\r\n# for i in range(len(num)):\r\n# if i != res:\r\n# print(str(max-num[i]),end=' ')\r\n\r\n# num = [int(i) for i in input().split()]\r\n# k = 10\r\n\r\n# while True:\r\n# s=k/num[0]\r\n# d = (k + num[1]) / num[0]\r\n# m = num[1] / num[0]\r\n# if m - int(m) == 0:\r\n# print(int(m))\r\n# break\r\n# elif s - int(s) == 0:\r\n# print(int(s))\r\n# break\r\n# elif d - int(d) == 0:\r\n# print(int(d))\r\n# break\r\n# else:\r\n# k += 10 \r\n\r\n# l=[]\r\n# for i in range(5):\r\n# l.append(input().split())\r\n# for i in range(5):\r\n# for j in range(5):\r\n# if int(l[i][j]) == 1:\r\n# k = i\r\n# d = j\r\n# print(str(abs(k-2)+abs(d-2))) \r\n\r\n# weight = int(input())\r\n# if weight % 2 == 0 and weight != 2:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n# n = int(input())\r\n# l=[int(i) for i in input().split()]\r\n# max = l[0]\r\n# for i in range(len(l)):\r\n# if l[i] > max:\r\n# max = l[i]\r\n# s=0\r\n# for i in range(len(l)):\r\n# s += max - l[i]\r\n# print(s)\r\n\r\n# n = int(input())\r\n# l = [int(i) for i in input().split()]\r\n# s1 = 0\r\n# s2 = 0\r\n# for i in range(n):\r\n# if i%2==0:\r\n# max1 = max(l[0],l[-1])\r\n# s1+=max1\r\n# l.remove(max1)\r\n# else:\r\n# max2 = max(l[0],l[-1])\r\n# s2 += max2\r\n# l.remove(max2)\r\n# print(s1,s2,sep=' ') \r\n\r\n# l = [int(i) for i in input().split()]\r\n# s = 0\r\n# for i in range(l[-1]):\r\n# s += l[0] * (i + 1)\r\n# s = s - l[1]\r\n# if s < 0:\r\n# s = 0\r\n# print(s)\r\n\r\nl = [int(i) for i in input().split()]\r\nprint((l[0]*l[1])//2)", "m,n = input().split( )\r\nm = int(m)\r\nn = int(n)\r\nsq = m*n\r\ntotal_tiles = sq/2\r\nprint(int(total_tiles))", "m,n=map(int, input().split())\r\ns=m*n\r\np=s//2\r\nprint(p)", "if __name__ == \"__main__\":\n\tm, n = input().split()\n\tdom_x, dom_y = 2, 1\n\tprint((int(m) * int(n)) // (dom_x * dom_y))", "m = input().split()\r\n\r\nn = int(m[0]) * int(m[1])\r\nprint(n // 2)", "m, n = map(int, input().split())\r\nif m % 2 == 0:\r\n max_tiles = m / 2 * n\r\nelif n % 2 == 0:\r\n max_tiles = n / 2 * m\r\nelse:\r\n max_tiles = m // 2 + n // 2 * m\r\nprint(int(max_tiles))", "M,N=map(int,input().split())\r\nprint(M*(N//2)+(N%2)*(M//2))\r\n", "n = [int(i) for i in input().split(' ')]\r\npro = n[0] * n[1]\r\nprint(pro // 2)", "m, n = map(int, input().split())\r\nif m % 2 == 0:\r\n print(m*n//2)\r\nelse: print((m//2)*n+n//2)", "m,n=map(int,input().split(' '))\r\ncnt=(m*n)/2\r\nprint(int(cnt))", "i = input().split()\r\nprint(int(i[0]) * int(i[1]) // 2)", "def tile(m,n):\r\n a=max(m,n)\r\n b=min(m,n)\r\n if b%2==0:\r\n return a*(b//2)\r\n else:\r\n return (a*(b//2))+(a//2)\r\nx,y=input().split()\r\nprint(tile(int(x),int(y)))\r\n\r\n\r\n\r\n ", "n = [int(x) for x in input().split()]\r\narea = 2\r\nprint(n[0]*n[1]//2)\r\n", "M , N = input().split()\r\na = int(M) * int(N) / 2\r\nprint(int(a))", "n=list(map(int,input().split()))\r\nnum=n[0]*n[1]\r\ncnt=0\r\nwhile num!=1 and num>0:\r\n num-=2\r\n cnt+=1\r\nprint(cnt)", "m,n=map(int,input().split())\r\nx=m*n\r\nprint(x//2)", "import math\r\nm,n=map(int,input().split())\r\nprint(math.floor(m*n/2))", "m, n = input().split()\nm = int(m)\nn = int(n)\nif m % 2 == 0:\n sum = n * m / 2\nelse:\n sum = (m // 2) * n + n // 2\nsum = int(sum)\nprint(sum)\n \t \t\t \t \t \t\t \t \t \t \t\t \t\t", "desk = input().split(' ')\r\nm = int(desk[0])\r\nn = int(desk[1])\r\nsq = m * n\r\ndomino = sq // 2\r\nprint(domino)\r\n", "M,N=input().split()\r\nprint(int(int(M)*int(N)/2))", "a, b = [int(i) for i in input().split(sep=' ')]\r\nprint(a * b // 2)", "# read the board size\nm, n = map(int, input().split())\n\n# calculate the maximum number of dominoes\nmax_dominoes = (m * n) // 2\n\n# print the result\nprint(max_dominoes)\n\n\t \t \t\t\t\t \t\t \t\t \t \t\t\t \t", "M, N = map(int, input().split())\r\n\r\nanswer = N // 2 * M if 0 == N % 2 else N // 2 * M + M // 2\r\n\r\nprint(answer)", "x=(input().split())\r\nresult = 1\r\nfor i in map(int,x):\r\n result= result*i\r\noutput= int(result/2)\r\nprint(output)", "a=input().split()\r\na=[int(i) for i in a]\r\nm=a[0]\r\nn=a[1]\r\n\r\nprint(m*n//2)", "x, y = map(int, input().split())\n\nsum = x * y\n\nif sum % 2 == 0:\n sum /= 2\nelse:\n sum -= 1\n sum /= 2\n\n\nprint(\"%.0f\" % sum)", "print((lambda x: int(x[0]) * int(x[1]) // 2)(input().split()))\n", "mk=str(input())\r\n(m,k)=mk.split( )\r\nm,k=int(m),int(k)\r\n\r\na=m//2\r\nn=a*k\r\nif (m%2!=0) :\r\n n+=k//2\r\nprint(n)", "m,n = map(int,input().split(' '))\nrespuesta=(m*n)//2\nprint(respuesta)", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\n\r\nif m%2==0:\r\n print(int(m/2*n))\r\nelse:\r\n if n%2==0:\r\n print(int( ((m-1)/2*n) + (n/2)))\r\n else:\r\n print( int( ((m-1)/2*n) + ((n-1)/2) ) )", "import math\n\nx = input().split()\nn = int(x[0])\nm = int(x[1])\ny = 0\n\nif n % 2 == 0 or m % 2 == 0:\n y = n * m // 2\n\nelse:\n y = (n - 1) * m // 2\n y += m // 2\n\nprint(y)", "n, k = map(int, input().split())\r\nprint(n*k//2)", "n, m = map(int, input().split())\r\n\r\nif n >= m:\r\n n, m = m, n\r\n\r\nk = 0\r\nif m % 2 == 0:\r\n k += (m//2)*n\r\nelse:\r\n k += (m//2)*n\r\n k += (n//2)\r\nprint(k)\r\n", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nprint(int((m*n)/2))", "a, b = map(int,input().split())\r\nc = a * b\r\nprint(c//2)", "\r\nmylist = []\r\nrow = input().split()\r\nmylist = row\r\n\r\nprint((int(mylist[1])*int(mylist[0]))//2)", "\"\"\" input\r\n2 4\r\noutput\r\n4\r\ninput\r\n3 3\r\noutput\r\n4 \"\"\"\r\n\r\nm,n = input().split()\r\n\r\nrectLen = int(m) * int(n)\r\nnumberOfDominoes = (rectLen / 2)\r\nconvert = int(numberOfDominoes)\r\n\r\nprint(convert)\r\n", "x,y = map(int,input().split())\r\nn = x*y\r\nc = n//2\r\nprint(c)", "n=input()\r\n[a,b]=list(map(int,n.split(\" \")))\r\nprint(a*b//2)", "n,k=map(int,input().split())\r\na=n*k\r\nprint(a//2)", "m,n=input().split()\r\nm,n=int(m),int(n)\r\nresult = int(m*n//2)\r\nprint(result)", "s=input()\r\ns=s.split()\r\nm=int(s[0])\r\nn=int(s[1])\r\nans=int((n*m)/2)\r\nprint(ans)", "x,y = input().split()\r\nx = int(x)\r\ny = int(y)\r\nz = x * y\r\nif z % 2 == 0:\r\n print(z // 2)\r\nelse:\r\n z = z - 1\r\n print(z // 2)", "n,m=list(map(int,input().split()))\r\nk=(n*m)//2\r\nprint(k)", "a=input().split()\r\nx=int(a[0])*int(a[1])\r\nprint(x//2)\r\n \r\n ", "a,b = map(int,input().split())\r\nif(a%2 == 0):\r\n ans = (a//2)*b\r\nelse:\r\n ans = (a//2)*b + b//2 \r\nprint(ans)", "x, y = list(map(int, input().split()))\r\n \r\ntotal = print(int((x * y/2 -0.5) if (x * y % 2) != 0 else (x * y/2)))\r\n", "m,n = map(int, input().split())\ntotal_square = m*n\nmax_dominoes = total_square // 2\n\nprint(max_dominoes)\n \t \t \t \t\t\t\t \t\t\t \t\t", "n=input().split()\r\nM=int(n[0])\r\nN=int(n[1])\r\n\r\nprint((M*N)//2)", "m, n = input(\" \").split()\nm = int(m)\nn = int(n)\nif m * n % 2 == 0:\n result = (m * n) // 2 \nelse:\n result = (m * n) // 2 \nprint(result)", "# Дана прямоугольная клеточная доска размера M × N клеток. Также дано неограниченное количество стандартных доминошек размера 2 × 1 клетку. Доминошки можно поворачивать. Требуется уложить как можно больше доминошек на доску так, чтобы соблюдались следующие условия:\r\n\r\n# 1. Каждая доминошка полностью покрывает две клетки доски.\r\n\r\n# 2. Никакие две доминошки не перекрываются.\r\n\r\n# 3. Каждая доминошка полностью лежит внутри доски. Касание краев доски допускается.\r\n\r\n# Найдите максимальное количество доминошек, которое можно уложить с данными ограничениями.\r\n\r\nN = []\r\nN = input()\r\n\r\nszam = N.split(' ')\r\n\r\nkod = int(szam[0]) * int(szam[1])\r\n\r\ndomino = kod / 2\r\n\r\nprint(int(domino))", "import math\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nprint(math.floor(m*n/2))", "def solition():\r\n a, b = map(int, input().split())\r\n print((a * b) // 2)\r\n \r\n\r\nif __name__ == '__main__':\r\n solition()", "numList = []\r\nnum = str(input())\r\nnumList.append(int(num[0:2]))\r\nnumList.append(int(num[2:]))\r\n\r\ntotal = (int(numList[0])*int(numList[1]))//2\r\nprint(total)", "import math\r\n\r\na, b = map(int, input().split())\r\ns = a // 2 * b\r\nif s > (a * b // 2):\r\n print(s)\r\nelse:\r\n print(a * b // 2)", "x, y = input().split()\r\na = int(x)\r\nb = int(y)\r\n\r\n\r\nif (a*b) % 2 == 0:\r\n print((a*b)//2)\r\nelse:\r\n print(((a*b)-1)//2)", "M,N=map(int,input().split())\r\nif M%2==0 and N%2==0:\r\n Number= M*N/2\r\n print(int(Number))\r\nelif M%2!=0 and N%2==0:\r\n Number=M*N/2\r\n print(int(Number))\r\nelif M%2==0 and N%2!=0:\r\n Number=M*N/2\r\n print(int(Number))\r\nelif M%2!=0 and N%2!=0:\r\n Number=(M-1)*N/2 + (N-1)/2\r\n print(int(Number))\r\n", "x,y = [int(i) for i in input().split()]\r\nprint((x*y)//2)\r\n", "m,n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nd = 0\r\nprd = m*n\r\nif (prd%2 == 0 and prd != 0):\r\n d = prd/2\r\nelse:\r\n d = prd//2\r\nd = int(d)\r\nprint(d)\r\n", "l=input()\r\ns=l.split(\" \")\r\nif int(s[1])%2==0:\r\n print(int(s[0])*(int(s[1])//2))\r\nelse:\r\n print((int(s[0])*((int(s[1])-1)//2))+(int(s[0])//2))", "from math import floor\r\na = input()\r\nb = a.split(' ')\r\nn = int(b[0])\r\nm = int(b[1])\r\nprint(floor((n * m) / 2))", "a,b = input().split()\r\ns = int(a) * int(b)\r\nn = s // 2\r\nprint(n)\r\n", "inp = input().split()\r\nm = int(inp[0])\r\nn = int(inp[1])\r\n\r\nprint(int(m/2)*n+(m%2)*int(n/2))", "n, m = map(int, input().split())\narea = n * m\nprint(area // 2)\n", "m,n =map(int,input().split())\r\narea = m*n\r\nif (area%2==0):\r\n print(int(area/2))\r\nelse:\r\n print(int((area-1)/2))", "\r\nM,N=map(int,input().split())\r\nprint(M * N//2)", "def dominoSolver(m, n):\r\n return (m * n // 2) if (m * n % 2 == 0) else ((m * n - 1) // 2)\r\n\r\n\r\n(m, n) = tuple(map(int, input().split()))\r\nprint(dominoSolver(m, n))\r\n\r\n\r\n# if (m%2==0): dominoes = (m*n)/2\r\n# if (n%2==0): dominoes = (m*n)/2\r\n# else dominoes = (m*n)\r\n", "def max_dominoes(M, N):\r\n if M % 2 == 0 or N % 2 == 0:\r\n return (M * N) // 2\r\n else:\r\n return ((M * N) - 1) // 2\r\n\r\n# Example usage\r\nM, N = map(int, input().split()) # Read the board dimensions\r\nmax_num_dominoes = max_dominoes(M, N)\r\nprint(max_num_dominoes)\r\n", "m, n = list(map(int,input().split()))\r\nsquare = int((m * n)/2)\r\nprint(square)", "x, y = input().split()\r\nx=int(x)\r\ny=int(y)\r\nq= x*y\r\ne=q/2\r\ne=int(e)\r\nprint(e)", "\r\nlist_board = list(map(int, input().split()))\r\nM, N = list_board[0], list_board[1]\r\nsize_board = M * N\r\nif size_board % 2 == 0:\r\n print(size_board // 2)\r\nelse:\r\n print((size_board - 1) // 2)\r\n", "MU,NU = map(int,input().split())\no = (MU*NU)//2\nprint(o)\n \t\t\t\t \t \t\t\t \t\t\t\t \t\t \t \t \t", "from functools import reduce\n\ndef f(m, n):\n a, b = m // 2, m % 2\n \n if b == 0:\n print(n * a)\n else:\n print(n * a + n // 2)\n\n\nif __name__ == \"__main__\":\n m, n = tuple(map(lambda x: int(x), input().split(\" \")))\n f(m, n)", "a,b = map(int,input().split())\r\na,b= int(a),int(b)\r\nprint(int(((a*b)/2)/1))", "'''M=int(input())\r\nN=int(input())'''\r\nM,N=map(int,input().split())\r\na=M*N\r\nif a%2==0:\r\n print(int(M*N/2))\r\nelif a==1:\r\n print(0)\r\nelse:\r\n print(int(M*N//2))\r\n", "n, m = map(int, input().split())\r\ntotal = n * m\r\nprint(total // 2)", "import sys\r\ninp = sys.stdin.readline()\r\ns = \"\"\r\nf = [int(some) for some in inp.split()]\r\nx = f[0]\r\ny = f[1]\r\neven = 0\r\nodd = 0\r\nsquares = []\r\nc = \"\"\r\nfor i in range(1, x+1):\r\n f = str(\"X\"*y)\r\n squares.append(f)\r\nfor i in squares:\r\n while len(i) >= 3 or len(i) >= 2:\r\n if len(i)%2 == 0:\r\n even += 1\r\n i = i[0:len(i)-2]\r\n elif len(i)%2 != 0:\r\n odd += 1\r\n i = i[0:len(i)-2]\r\n c += i\r\nif len(c) >= 2 and len(c)%2 == 0:\r\n while len(c) > 0:\r\n c = c[0:len(c)-2]\r\n even += 1\r\nelif len(c) >= 3 and len(c)%2 !=0:\r\n while len(c) > 1:\r\n c = c[0:len(c)-2]\r\n odd += 1\r\n\r\nprint(even + odd)", "from sys import stdin, stdout\r\n\r\ndef main():\r\n m, n = map(int, stdin.readline().split(' '))\r\n c = (m*n)//2\r\n stdout.write(str(c)+'\\n')\r\n\r\nif __name__ == \"__main__\":\r\n main()", "L=[]\r\nL=list(map(int,input().split()))\r\nprint((L[0]*L[1])//2)", "m,n = map(int,input().split())\r\nans = (m*n)//2\r\nprint(ans)", "m, n = map(int, input(). split())\r\nmesto = m*n\r\n\r\nans = mesto // 2\r\n\r\nprint(ans)\r\n\r\n ", "m,n = [int(n) for n in input().split()]\r\nnumber_squares = m*n\r\ndomino_pillings = number_squares//2\r\nprint(domino_pillings)", "import math\nPapan = list(map(int,input().split()))\nPanjang = Papan[0]\nLebar = Papan[1]\nBanyak = Panjang*Lebar/2\nBanyak = int(math.floor(Banyak))\nprint(Banyak)", "\nl , w = map(int,input().split())\nif l*w % 2 == 0:\n print(int(l*w/2))\nelse:\n print(int(((l*w)-1)/2))\n\t\t\t \t \t \t\t\t \t\t\t \t \t\t \t \t\t\t \t", "a,b=map(int,input().split())\r\nc=a*b\r\nx=int(c/2)\r\nprint(x)\r\n", "x, y = map(int, input().split())\ntiles = int(x*y / 2)\nprint(tiles)\n \t \t\t \t \t\t \t\t \t\t", "n,m = map(int,input().split())\r\nar = n*m\r\ndom = ar//2\r\nprint(dom)", "a = input()\r\nb = int(a.split()[1])\r\na = int(a.split()[0])\r\n\r\nprint(int(a*b/2))", "M,N=map(int,input().split())\r\nA=M*N\r\nd=2*1\r\nZ=A//d\r\nprint(Z)", "board = input()\r\n\r\nif(len(board) == 4):\r\n x = board[0]\r\n y = board[len(board)-2] + board[len(board) - 1]\r\nelif(len(board) == 5):\r\n x = board[0] + board[1]\r\n y = board[len(board)-2] + board[len(board) - 1]\r\nelse:\r\n x = board[0]\r\n y = board[len(board) - 1]\r\nx = int(x)\r\ny = int(y)\r\n\r\nproduct = x * y\r\nprint(product // 2)\r\n", "x,y=map(int,input().split())\r\nempty=0\r\nif(x>y) :\r\n l=x\r\n b=y\r\nelse :\r\n l=y\r\n b=x\r\nquo=l//2\r\nif(l%2==1) :\r\n empty=b\r\n empty=empty//2\r\n print(quo*b+empty)\r\nelse :\r\n print(quo*b)\r\n", "mick,nick=map(int,input().split())\r\nres=mick*nick//2\r\nprint(res)", "def f(m,n):\r\n if not 1 <= (m and n) <= 16:\r\n raise Exception\r\n else:\r\n count = 0\r\n if m % 2 != 0 and n % 2 != 0:\r\n count = (m*n-1)/2\r\n else:\r\n count = (m*n)/2\r\n return int(count)\r\n\r\nm,n = map(int,input().split())\r\n\r\nprint(f(m,n))", "m,n=map(int,input().split())\r\nif m%2==0:\r\n num=(m/2)*n\r\nelse:\r\n s=(m//2)*n\r\n num=(s+(n//2))\r\nprint(int(num)) ", "n , m = map(int,input().split())\r\nsize = n*m\r\nprint(size//2)", "m, n=map(int,(input().split()))\r\np=m*n\r\nprint(int(p/2))", "A,B=map(int,input().split())\r\nS=int(A*B//2)\r\nprint(S)", "n = list(map(int, input().strip().split(\" \")));\r\n\r\nsqr = n[0] * n[1];\r\n\r\ndom = sqr / 2;\r\n\r\nprint(int(dom))", "a, b = map(int, input().split())\r\n\r\nif (a*b%2) == 0:\r\n\tprint(int((a*b)/2))\r\nelse :\r\n\tprint (int(((a*b)-1)/ 2))", "import math\r\nl,b=map(int,input().split())\r\nres=math.floor((l*b)/2)\r\nprint(res)", "def main():\n n,m = [int(x) for x in input().split()]\n print(n*m//2)\n\nif __name__ == \"__main__\":\n main()", "m, n = map(int, input().split())\r\nif m % 2 == 1 and n % 2 == 1:\r\n # odd x odd board, add 1 domino to cover center square\r\n print((m * n - 1) // 2)\r\nelse:\r\n # even x anything board, or even x even board\r\n print((m * n) // 2)", "# https://codeforces.com/problemset/problem/50/A\n\n\nm, n = list(map(int, input().split(' ')))\n\nprint((m*n)//2)\n", "m, n = (input().split())\nm = int(m)\nn = int(n)\nsummation = m * n\ncount = 0\n\nfor i in range(summation+1):\n if (i % 2 == 0) and (i != 0):\n count = count + 1\n\nprint (count)\n", "q,r = map(int,input().split())\r\nprint(q*r//2)", "import math as m\r\nM,N =map(int,input().split())\r\nprint(m.floor((M/2)*(N/1)))", "import math\r\nwidth, height = map(int, input().split())\r\n\r\nif width + height == 2:\r\n print(0)\r\nelse:\r\n sec1 = width / 1\r\n sec2 = height / 2\r\n remainder = height % 2\r\n total1 = sec1 * sec2\r\n total2 = math.floor(remainder / 2)\r\n total = total1 + total2\r\n print(int(total))\r\n\r\n\r\n", "M,N = map(int,input().split())\r\narea = M* N\r\n\r\nprint(int(area/2))", "a, b = map(int, input().split())\ntotal = int(a*b / 2)\nprint(total)\n\t \t \t \t \t \t \t\t\t \t\t \t \t\t\t", "m, n = map(int, input().split())\r\nx = m * n // 2 \r\nprint(x)", "m, n = list(map(int, input().strip().split()))\r\n\r\nprint((n//2)*m + ((n%2)*m)//2)", "\r\n\r\nx, y = map(int, input(\"\").split())\r\n\r\nboard_size = x*y\r\n\r\ndomino_fit = board_size//2\r\n\r\nprint(domino_fit)\r\n\r\n\r\n", "m,n=[int(i) for i in input().split()]\r\nl=m*n\r\nprint(l//2)", "a, b = map(int, input().split())\r\nprod = a*b \r\nprint(prod//2)", "l = list(map(int,input().split()))\r\nM = l[0]\r\nN = l[1]\r\nprint((M*N)//2)", "n,m= map(int,input().split())\r\nif m%2 ==0 or n%2== 0 :\r\n print(int(n/2*m))\r\nelse :\r\n \r\n print(int(m//2*n)+n//2) \r\n ", "def cal(m, n):\r\n if m == n == 1 or min(m, n) == 0: # 排除无法拼接的情况\r\n return 0\r\n if n > m: # 使得行数大于列数\r\n m, n = n, m\r\n remain = m % 2\r\n get = m // 2 * n\r\n if remain != 0:\r\n return get + cal(remain, n)\r\n else:\r\n return get\r\n\r\n\r\nm, n = [int(i) for i in input().split()]\r\nprint(cal(m, n))", "a,b = map(int,input().split())\r\nc = a*b\r\nprint(c//2)", "a = input().split()\r\nS = int(a[0]) * int(a[1])\r\n\r\nprint(S//2)", "m, n = map(int, input().split())\ntotalMatriz=m*n\npiezasDomino=totalMatriz//2\nprint(piezasDomino)\n\n \t\t\t \t\t\t\t \t\t \t \t\t\t\t\t \t\t \t", "a,b=map(int,input().split())\nprint(a*b//2)\n#nikky\n\t \t\t \t \t \t \t \t \t\t\t \t \t\t", "m,n=map(int,input().split())\r\nif n%2==0:\r\n print(int(m/1*(n/2)))\r\nelse:\r\n print(int(m/1*((n-1)/2)+int(m/2)))", "import sys\r\nsys.setrecursionlimit(4000)\r\nimport math\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\nimport heapq \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) -1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\narr = inlt()\r\nprint((arr[0]*arr[1])//2)", "M,N= map(int ,input().split())\r\nif 1<=M<=16 and 1<=N<=16:\r\n\tprint(M*N//2)\r\nelse: print(0)", "import math\r\nM , N = map(int,input().split())\r\n\r\nnumber_of_sqaure = M * N \r\n\r\nprint(math.floor(number_of_sqaure / 2))", "m,n=map(int,input().split())\r\ny=0\r\ny=m*n\r\nprint(y//2)", "import sys\r\n\r\nnumbers = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nn = numbers[0]\r\nm = numbers[1]\r\n\r\na = 2 * 1 # размер доминошки\r\n\r\nres = 0\r\n\r\nif (n * m) % 2 != 0:\r\n res = (n * m - 1) / a\r\nelse:\r\n res = (n * m) / a\r\n\r\nprint(int(res))", "mn=input()\r\nl=mn.split(\" \")\r\nm=int(l[0])\r\nn=int(l[1])\r\nprint((m*n)//2)", "from math import *\r\nm,n=map(int,input().split())\r\nif m>=2:\r\n if m%2==0:\r\n x1=int(m/2)\r\n print(x1*n)\r\n else:\r\n x1=floor(m/2)\r\n if n>=2:\r\n x2=floor(n/2)\r\n print(x2+(x1*n))\r\nelif n>=2:\r\n if n%2==0:\r\n x1=int(n/2)\r\n print(x1*m)\r\n else:\r\n x1=floor(n/2)\r\n print(x1*m)\r\nelif n<=1 and m<=1:\r\n print(0) ", "r,c=map(int,input().split())\r\nprint(r*c//2)", "a, b = map(int, input().split())\r\nprint((max(a, b) // 2) * min(a, b) + (max(a, b) % 2) * (min(a, b) // 2))\r\n", "a = input()\r\nlist = a.split(\" \")\r\nM = int(list[0])\r\nN = int(list[1])\r\nd = 2\r\nS = M * N\r\nR = S // d\r\nprint(R)\r\n", "matrix_size = input().split()\r\nDOMINO_SIZE = 2\r\n\r\nmatrix_size = [int(matrix_size[i]) for i in range(len(matrix_size))]\r\n\r\n\r\ntotal_domino = (matrix_size[0]*matrix_size[1])//DOMINO_SIZE\r\n\r\nprint(total_domino)\r\n", "m,n=map(int, input().split())\r\nx=(m*n)/2\r\nx=int(x)\r\nprint(x)", "M,N=map(int,input( ).split( ) )\nn=M*N\np=n//2\nprint(p)\n#KTGGH'LSKH';HJM'JMG'LFHJM'HM'LSFMJlk;mj';mj\n \t \t \t \t \t \t \t\t \t\t \t", "\nl1 = [int(x) for x in input().split()]\n\nsquare = l1[0] * l1[1]\n\nprint(square // 2)\n\n\n", "m, n = input().split()\r\nprint(int((int(m) * int(n) - int(n) * int(m) % 2) / 2))", "n=input().split()\r\nif n[0]=='1' and n[1]=='1':\r\n ar=0\r\nelse:\r\n ar=int(n[0])*int(n[1])\r\nprint(ar//2)", "from math import floor\r\n(x,y) = map(int,input().split())\r\nprint(floor(x*y/2))", "y = input()\r\nu = y.split(\" \")\r\nn = int(u[0])\r\na = int(u[1])\r\ns = n * a\r\nprint(s // 2)", "x, y = map(int,input().split())\r\na=(x*y)//2\r\nprint(a)", "import math\r\nn, k = input().split()\r\na = int(n) * int(k)\r\nprint(math.floor(a/2))", "M, N =input().split()\nM= int(M)\nN = int(N)\nans=int(M*N/2)\nprint(ans)\n\n\t \t\t\t\t \t \t \t \t\t \t\t \t \t\t\t\t", "def maximum(row: int, column: int) -> int:\r\n return (row * column)//2\r\n\r\n\r\ndef read_input(filename: str = None) -> None:\r\n from sys import stdin\r\n stdin = open(filename) if filename else stdin\r\n row, column = tuple(map(int, stdin.readline().split()))\r\n print(maximum(row, column))\r\n \r\n\r\ndef main():\r\n read_input()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import math\r\nm,n = input().split()\r\nprint(math.floor((int(m)*int(n))/2))", "a=input().split()\r\nb=int(a[1])*int(a[0])\r\nc=b//2\r\nprint(c)\r\n", "m,n = map(int, input().split())\r\nlaukums = m * n\r\nc = 0\r\nfor i in range(2, laukums + 1, 2):\r\n c = c + 1\r\nprint(c)\r\n", "from math import floor\r\nM, N = map(int, input().split())\r\nprint(int(floor(M*N/2)))", "#A. Domino piling:\r\narea_perameters=[int(ch) for ch in input().split(' ')]\r\narea= area_perameters[0]*area_perameters[-1]\r\nresult=area//2\r\nprint(result)", "n, m = map(int, input().split())\r\nnum = (n//2) * m\r\nif n % 2 == 1:\r\n num += (m//2)\r\nprint(num)\r\n", "m,n = map(int, input().split())\r\ndem = 0\r\nif n%2==0:\r\n dem += (n//2)*m\r\nelse:\r\n dem += m + ((n-2)//2)*m + m//2\r\nprint(dem)", "s = str(input())\r\nd = s.split()\r\n\r\nm = int(d[0])\r\nn = int(d[1])\r\n\r\ndum = m * n \r\n\r\nans = int(dum / 2)\r\n\r\nprint(ans)", "m,n = map(int, input().split())\r\nnum = n*m\r\nprint(num//2)\r\n", "m,n=map(int,input().split())\r\nans=(m*n)/2\r\nprint(int(ans))\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\nx = n*k\r\nprint(math.floor(x/2))", "inp = input().split()\r\nM = int(inp[0])\r\nN = int(inp[1])\r\n\r\nlength = N // 2\r\n\r\nvert = 0 if N % 2 == 0 else M // 2\r\n\r\nres = M * length + vert\r\nprint(res)", "M,N= [int(M) for M in input().split()]\r\nprint((N//2)*M+((N%2)*M)//2)", "m,n = map(int, input().split())\r\n\r\ns = m*n\r\nc = 0\r\nwhile s>=2:\r\n c+=1\r\n s-=2\r\nprint(c)\r\n\r\n\r\n", "M,N=map(int,input().split())\r\nif M%2==0:\r\n print(int(M/2*N))\r\nelse:\r\n if N%2==0:\r\n print(int(N/2*M))\r\n else:\r\n print(int(M//2*N+N//2))\r\n", "List = input().split()\r\nM = int(List[0])\r\nN = int(List[1])\r\nif (M % 2) * (N % 2) == 0:\r\n print(int(M * N / 2))\r\nelse:\r\n print(int(M * N / 2))\r\n", "m, n = map(int, input().split())\r\nk = m*n\r\nprint(k//2)", "n,m=map(int,input().strip().split())\r\nif n==1:\r\n print(int(m//2))\r\nelif m%2==0:\r\n print(int(n*(m//2)))\r\nelif n%2==0:\r\n print(int(m*(n//2)))\r\nelse:\r\n print(int(n*(m/2)))", "m,n = input().split(\" \")\r\nprint((int(m) * int(n)) // 2)", "m,n = map(int, input().split())\r\na = m*n\r\nr = a//2\r\nprint(r)", "a,b = input().split()\nc = int(a)*int(b)\nd= c//2\nprint(d)\n \t\t \t \t \t \t\t\t \t \t\t \t \t", "\nM, N =map(int, input().split())\ntotal_square = M * N\nmax_dominoes = total_square // 2\n\nprint(max_dominoes)\n \t \t \t\t \t \t\t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 19 16:45:22 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\na=input()\r\nlist1=a.split( )\r\nprint((int(list1[0])*int(list1[1]))//2)", "def solve(m, n):\r\n area = m * n\r\n print(area // 2)\r\n\r\ndef main():\r\n m, n = list(map(int, input().split()))\r\n solve(m, n)\r\n\r\nif __name__ == '__main__':\r\n main()", "m,n = map(int, input().split())\r\n\r\nprod = m*n\r\n\r\nprint(prod//2)", "x, y = list(map(int, input().split()))\r\nprint(x*y//2)", "# -*- coding: utf-8 -*-\n\"\"\"problem50a\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1b9j1Rf3pTc3MQY3dpawBIs24vyl0oJEn\n\"\"\"\n\nm, n= map(int, input().split())\narea = m*n\n\nif (area % 2 == 0):\n print(int(area/2))\n\nelse:\n print(int((area-1)/2))", "arr = list(map(int, input().split()))\r\nprint(int((arr[0] * arr[1]) / 2))", "line = (input().split(\" \"))\r\nm = int(line[0])\r\nn = int(line[1])\r\nprint(int((m*n-(m*n % 2))/2))", "m, n = map(int, input().split())\r\n\r\nprint(\" \", n * m // 2)\r\n", "n, m = map(int, input().split())\r\nif(n%2==0 and m%2==0):\r\n count = n//2\r\n x = count*m\r\n print(x)\r\n \r\nelif(n%2!=0 and m%2==0):\r\n count = m//2\r\n x = count*n\r\n print(x)\r\n \r\nelif(n%2==0 and m%2!=0):\r\n count = n//2\r\n x = count*m\r\n print(x)\r\n\r\nelif(n%2!=0 and m%2!=0):\r\n n = n-1\r\n count = n//2\r\n x = count*m\r\n x+=m//2\r\n print(x)\r\n \r\n", "i,j=map(int,input().split())\r\nmul=i*j\r\nprint(mul//2)", "from math import ceil\r\na,b=input().split()\r\na,b=int(a),int(b)\r\nprint(ceil(a*b)//2)", "x, y = [int(k) for k in input().split(\" \")]\r\nif x % 2 == 0 or y % 2 == 0:\r\n if x % 2 == 0:\r\n print(int((x/2) * y))\r\n else:\r\n print(int((y/2) * x))\r\nelse:\r\n print(int(((x-1)/2 * y) + (y-1)/2))\r\n", "M,N = map(int,input().split())\r\nnum_domino = M*N//2\r\nprint(num_domino)\r\n\r\n", "N = input() .split()\r\nprint((int(N[0]) * int(N[1])) // 2)\r\n", "import math\r\nn=input()\r\nnum=n.split(\" \")\r\nl=int(num[0])\r\nb=int(num[1])\r\nq=math.floor((l*b)/2)\r\nprint(q)", "p = input().split()\r\nm, n = p\r\nm = int(m)\r\nn = int(n)\r\nif m % 2 == 0 and (n % 2 == 0 or n % 2 != 0):\r\n print((m//2)*n)\r\nelif m % 2 != 0 and (n % 2 == 0 or n % 2 != 0):\r\n print(((m//2)*n) + (n // 2))\r\n", "def max_dominoes():\r\n M, N = map(int, input().split()) # Read the board sizes\r\n \r\n # Calculate the number of dominoes that can be placed\r\n max_dominoes = (M * N) // 2\r\n \r\n print(max_dominoes) # Print the maximal number of dominoes\r\n\r\n\r\nmax_dominoes()", "k,m=map(int,input().split())\nif(1<=k<=16 and 1<=m<=16):\n s=k*m\n print(s//2)\n\t\t\t\t\t\t \t \t\t\t\t\t \t\t \t\t\t \t\t \t\t", "n = [int(i) for i in input().split()]\r\narea = n[0] * n[1]\r\nprint(area//2)", "line = input().split()\r\nm, n = int(line[0]), int(line[1])\r\nprint(m * n // 2)", "a,b=map(int,input().split())\r\n#m=list(map(int,input().split()))\r\n#k=0\r\n#for i in range(a):\r\n# if m[i]>=m[b-1] and m[i]!=0:\r\n# k += 1\r\n# else: break\r\nif b%2==0:\r\n a=(b // 2)*a\r\nelse: a=(b//2)*a+(a//2)\r\nprint(a)\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nif n%2 == 0 or m%2==0:\r\n print((m*n)//2)\r\nelse:\r\n print(((m*n)-1)//2)", "from math import floor\r\nm,n = map(int, input().split())\r\nresult = floor((m*n)/2)\r\nprint(result)", "_5 = '50A'\r\nm, n = map(int, input().split())\r\nresult = (m * n) / 2\r\nprint(int(result))", "m,n=map(int,input().split())\r\nif (m%2!=0 and n%2!=0):\r\n d=((m*n)-1)/2\r\nelse:\r\n d=(m*n)/2\r\nc=int(d)\r\nprint(c)", "area = 1\r\nmn = list(map(int, input().split()))\r\nfor i in mn:\r\n area *= i\r\ntotal = area // 2\r\nprint(total)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 10 15:04:50 2023\r\n\r\n@author: ljy\r\n\"\"\"\r\n\r\nm,n=map(int,input().split())\r\nx=(m*n)//2\r\nprint(x)", "inp=input().split(\" \")\r\ns=2*1\r\n\r\na=int(inp[0])*int(inp[1])\r\nb=a//s\r\nprint(b)", "def dominopiling(arr):\r\n max_number_of_dominos = (arr[0]*arr[1])//2\r\n print(max_number_of_dominos)\r\narr=list(map(int, input().rstrip().split()))\r\ndominopiling(arr)", "n , m = map(int,input().split())\r\nif(n<=16 and m<=16):\r\n p=n*m/2\r\nprint(int(p))", "firstline = input().split()\nm = int(firstline[0])\nn = int(firstline[1])\nprint(m*n//2)", "a,b=map(int,input().split(\" \"))\r\nc=int((a*b)/2)\r\nprint(c)", "n, m = map(int,input().split())\r\n\r\nif n % 2 == 0:\r\n\tprint(int(m*(n/2)))\r\nelif m % 2 == 0:\r\n\tprint(int(n*(m/2)))\r\nelse:\r\n\tprint(int(n*(m//2)+(n//2)))", "m , n = map(int,input().split())\r\ns = m*n\r\nprint(int(s/2))", "m,n=map(int,input().split())\nv=m*n\nx=2*1\nd=v//x\nprint(d)\n \t\t \t \t \t\t\t\t \t \t\t \t\t\t", "liss=list(map(int,input().split()))\r\nm=liss[0]\r\nn=liss[1]\r\nprint((m*n)//2)\r\n", "M, N = input().split()\r\nM = int(M)\r\nN = int(N)\r\n\r\nprint(N * M // 2)\r\n", "M,N=map(int,input().split())\nx=M*N\ny=x//2\nprint(y)\n \t \t\t\t \t \t \t \t \t\t \t \t \t \t", "M,N = input().split()\r\nM =int(M)\r\nN =int(N)\r\nC = (M*N)//2\r\nprint(C)", "import math\r\ni =input(\"\")\r\na,b=i.split()\r\nc = int(a)*int(b)\r\nprint(math.floor(c/2))", "h = input().split()\r\nm = int(h[0])\r\nn = int(h[1])\r\narea = (m * n)\r\nprint(area // 2)\r\n", "\nn, m = map(int, input().split())\n\nmaxD = n * m \n\nprint(maxD // 2)\n\t \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\"\"\"\nCreated on Thu Mar 11 20:10:50 2021\n\n@author: zikrullohkhuzhakulov\n\"\"\"\n\nr = input()\nm_n = r.split(' ')\n\nM = int(m_n[0])\nN = int(m_n[1])\n\ndom_num = (M*N)//2\nprint(dom_num)", "import math\r\nx,y=map(int,input().split())\r\nif(x%2==0 or y%2==0):\r\n print(int((x*y)/2))\r\nelif(x%2!=0 and y%2!=0):\r\n print(int(x*(y-1)/2+math.floor(x/2)))", "a, b = map(int, input().split())\r\nif a % 2 == 0 or b % 2 == 0:\r\n c = (a * b) // 2\r\nelse:\r\n c = (a * b - 1) // 2\r\nprint(c)\r\n\r\n", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\nprint(m*n//2)\r\n", "def domino_pailling(l,b):\r\n #print(l,b)\r\n each_domino_area = 2 * 1\r\n area = l * b\r\n dominoes = area // each_domino_area\r\n return dominoes\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n l,b = list(map(int,input().split()))\r\n print(domino_pailling(l,b))", "\r\nm, n = str(input()).split(\" \")\r\n\r\nprint((int(m) * int(n)) // 2)\r\n", "lid = input()\r\nlid = lid.split()\r\nx = int(lid[0])\r\ny = int(lid[1])\r\n\r\nsq = x*y\r\n\r\nprint(sq//2)\r\n", "x, y = map(int, input().split())\r\nif x == 1 and y == 1:\r\n print(0)\r\nelse:\r\n print((x * y) // 2)", "import math\r\nm,n = map(int, input().split())\r\nboard=m*n\r\nprint (math.floor(board/2))\r\n\r\n \r\n", "v,h=map(int,input().split())\r\nprint(v*h//2)", "# your code goes here\r\n \r\nimport sys\r\n\r\n \r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read().split('\\n')\r\n \r\n wtf0 = wtf[0].split(' ')\r\n #print(wtf0)\r\n M = int(wtf0[0])\r\n N = int(wtf0[1])\r\n \r\n ans = M * N // 2\r\n \r\n print(ans)", "from math import floor\nm, n = map(int, input().split())\nprint(floor(m*n/2))\n", "a = list(map(int,input().split()))\r\n\r\nj = a[0]*a[1]\r\nprint(int(j/2))\r\n", "import math\r\nx=input()\r\nx=x.split(\" \")\r\nx=list(x)\r\na=int(x[0])\r\nb=int(x[1])\r\nz=int((a*b)/2)\r\nprint(z)", "def max_dominoes(M, N):\r\n # The number of dominoes that can be placed is equal to half of the total squares.\r\n # Since each domino occupies 2 squares, we can place at most half of the total squares.\r\n return (M * N) // 2\r\n\r\ndef main():\r\n M, N = map(int, input().split())\r\n max_dominoes_count = max_dominoes(M, N)\r\n print(max_dominoes_count)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m,n=(map(int, input().split()))\r\ny=m*n\r\nz=int(y/2)\r\nprint(z)\r\n", "def main():\r\n board_size = input()\r\n board_size = board_size.split()\r\n m = int(board_size[0])\r\n n = int(board_size[1])\r\n total = m * n\r\n print(total //2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "\r\n\r\nm, n = input().split()\r\nm = int(m)\r\nn = int (n)\r\ny = int((m*n)/2)\r\nprint(y)\r\n", "def main():\r\n m, n = map(int, input().split())\r\n print(m*n//2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def main():\n\tx_, y_ = input().split(\" \")\n\tx, y = int(x_), int(y_)\n\t\n\tif x % 2 == 0 or y % 2 == 0:\n\t\treturn int(x * y / 2)\n\telse:\n\t\treturn int((x - 1) * y / 2 + (y - 1) / 2) \n\t\t\nif __name__ == \"__main__\":\n\tprint(main())\n\t\n", "M,N=map(int,input().split())\r\nmax_dominos=(M*N)//2\r\nprint(max_dominos)", "m, n = map(int, input().split())\r\nmaxdominoes = 0\r\n\r\nif m:\r\n\tmaxdominoes = (n*m) // 2\r\nprint (maxdominoes)", "x,y =(input().split())\r\nn = int(x)\r\no = int(y)\r\ntotal = n*o\r\nmax_domino = total//2\r\nprint(max_domino)\r\n\r\n", "M,N=map(int,input().split())\r\nif 1<=M and N<=16:\r\n result=(M*N)//2 \r\n print(result)", "nk = [int(num) for num in input().split(\" \", 1)]\r\ncount = 0\r\narea = nk[0]*nk[1]\r\nif (area%2 != 0):\r\n area -= 1\r\ncount = int(area / 2)\r\nprint(count)\r\n", "a = input()\r\nb = a.split()\r\nc = int(b[0])\r\nd = int(b[1])\r\nq = c*d\r\nw = int(q/2)\r\nprint(w)", "m,n=map(int,input().split())\r\nw= (m*n)//2\r\nprint(w)\r\n", "inp = input().split()\r\nm = int(inp[0])\r\nn = int(inp[1])\r\nprint(int((m*n)/2))", "l=list(map(int,input().split()))\r\nnum=l[0]*l[1]\r\nres=num//2\r\nprint(res)", "n , m = input().split()\r\nn , m = int(m) , int(n)\r\nprint((n*m)//(2))", "a,b = map(int,input().split())\r\n\r\n\r\nc = a * b\r\nd = c // 2\r\n\r\nprint(d)\r\n", "size = str(input())\r\nwidth, height = size.split(\" \")\r\n\r\narea = int(width) * int(height)\r\nif area % 2 == 1:\r\n area -= 1\r\n\r\nprint( int(area/2))", "M,N=list(map(int,input().split()))\r\na1=M*N\r\na2=2*1\r\nif a1<a2:\r\n print(0)\r\nelse:\r\n print(int(a1/a2))\r\n\r\n", "m, n = map(int, input().split())\r\nif m % 2 == 0:\r\n print(m // 2 * n)\r\nelif n % 2 == 0:\r\n print(n // 2 * m)\r\nelif n%2==0 and m%2!=0:\r\n print(m//2*n + n//2)\r\nelif n%2!=0 and m%2==0:\r\n print(n//2*n)\r\nelif n%2!=0 and m%2!=0:\r\n print(m*n//2)\r\n", "def max_dominoes(m, n):\r\n return (m * n) // 2\r\n\r\ndef main():\r\n # Read input\r\n m, n = map(int, input().split())\r\n\r\n # Calculate the maximum number of dominoes\r\n result = max_dominoes(m, n)\r\n\r\n # Print the result\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m, n = map(int, input().split())\r\n\r\ns = m*n\r\n\r\nprint((s-s%2)//2)\r\n\r\n", "n,m = input().split()\nn = int(n)\nm = int(m)\nprint( int(n*m/2))\n \t\t\t\t\t\t \t \t\t \t \t\t\t\t \t \t", "# n = int(input())\n# if n % 2 == 0 and n > 2:\n# print(\"YES\")\n# else:\n# print(\"NO\")\n\n# import math\n# n, m, a = map(int, input().split())\n# print(math.ceil(n/a) * math.ceil(m/a))\n\n# x = int(input())\n# if x % 5 == 0:\n# print(x // 5)\n# else:\n# print(x // 5 + 1)\n\na, b = map(int, input().split())\nprint(int(a*b/2))", "a, b = [int(i) for i in input().split()]\r\n\r\ne = a*b\r\nprint(e//2)", "import math\r\n\r\ndef domino_piling(m, n):\r\n return math.floor((m * n) / 2)\r\n \r\ninput = input().split()\r\n\r\nprint(domino_piling(int(input[0]), int(input[1])))", "X, N = map(int, (input(). split()))\n\ntotal = X * N \nrem = total % 2\n\nprint((total - rem)//2)\n \t \t\t\t \t \t\t\t\t \t \t \t \t \t \t", "n,m=list(map(int,input().split()))\nr=m*n\nprint(r//2)\n\t \t \t\t\t\t\t \t\t \t \t \t \t \t\t\t", "m, n = map(int, input().split(\" \"))\r\nx = m * n\r\nif x % 2 == 1:\r\n x = x - 1\r\nprint(int(x/2))", "import math\r\nt = input().split()\r\nprint(math.floor((int(t[0])*int(t[1]))/2))\r\n\r\n\r\n", "m, n = map(int, input().split())\r\ns = m*n\r\nprint(s//2)", "m,n=map(int,input().split())\r\na=2\r\nprint((m*n)//a)\r\n", "m,n=map(int,input().strip().split())\r\nc=m*n\r\nprint(c//2)", "m, n = map(int, input().strip().split(\" \"))\nif m % 2 == 0 and n % 2 == 0:\n ans = m * n // 2\nelif m % 2 == 0:\n ans = (m * (n - 1)) // 2 + m // 2\nelif n % 2 == 0:\n ans = ((m - 1) * n) // 2 + n // 2\nelse:\n ans = ((m - 1) * (n - 1)) // 2 + m // 2 + n // 2\nprint(ans)\n", "def domino_piling():\r\n m, n = list(map(int, input().split()))\r\n return (m * n) // 2\r\n\r\n\r\nprint(domino_piling())\r\n", "dimensions = list(map(int, input('').split()))\nprint(int(dimensions[0] * dimensions[1]/2))", "i=input()\r\nl=i.split()\r\na,b=int(l[0]),int(l[1])\r\nn,m=a//2,b//2\r\nx,y=a%2,b%2\r\nprint(2*n*m+ x*m + y*n)", "x, y = input().split(' ')\nx = int(x)\ny = int(y)\narea = x*y\nif area%2 == 0:\n tiles = area/2\nelse:\n tiles = (area-1)/2\nprint(int(tiles))", "m, n = [int(c) for c in input().split()]\r\nprint((m*n)//2)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nprint((n*m)//2)", "k,l=list(map(int,input().split()))\r\nprint(int((k*l)/2))", "def main():\r\n n,m = tuple(map(int,input().split()))\r\n \r\n print(int((n*m)//2))\r\nmain()\r\n", "a, b = input().split()\r\nc = int((int(a) * int(b)) / 2)\r\nprint(c)", "sq = input().split()\r\ns = int(sq[0])\r\nq = int(sq[1])\r\na= (s*q)\r\nprint(a//2)\r\n", "M, N= map(int, input().split())\r\nprint(M * N // 2)", "mn = input().split(\" \")\r\nm = int(mn[0])\r\nn = int(mn[1])\r\n\r\narea = m*n\r\nprint(area//2)", "M, N = map(int, input().split(' '))\r\nC = int(M*N/ 2)\r\nprint(C)\r\n", "n,m=map(int,input().split())\r\nn=(n*m)//2\r\nprint(n)", "M, N = map(int, input().split(' '))\r\narea=M*N\r\nprint(area//2)", "data = str(input()).split(' ')\r\n\r\nresult = int(data[0])*int(data[1])\r\n\r\nif result % 2 == 0:\r\n print(int(result/2))\r\nelse:\r\n print(int((result-1)/2))", "M,N = [int(_) for _ in input().split()]\r\na = (N*M) // 2\r\nprint(a)\r\n", "square = input().split()\r\nlist= []\r\nfor n in square :\r\n list.append(int(n))\r\n\r\nsize = list[0] * list[-1]\r\n\r\nif size % 2 == 0 :\r\n total = int(size / 2)\r\nelif size % 2 == 1 :\r\n total = int((size-1)) / 2\r\n\r\nprint(int(total))", "a,b=map(int,input().split())\r\nif a%2!=0 and b%2!=0:\r\n print(int((a*b-1)/2))\r\nelse:\r\n print(int(a*b/2))", "a,b = input(\"\").split()\r\nc = int(a)*int(b)\r\nprint(c//2)", "arr = list(map(int,input().split()))\r\na=arr[0]\r\nb=arr[1]\r\nd=a*b\r\ns=d//2\r\nprint(s)", "n, m = map(int, input().split())\nmaxSquare = n * m // 2\nprint(maxSquare)", "M, N = map(int, input().split())\r\n\r\nans = int(M*N/2)\r\n\r\nprint(ans)", "inp = input().split(' ')\n\nm = int(inp[0])\nn = int(inp[1])\n\nprint(m*n//2)\n", "m, n = map(int, input().split())\r\ns = m * n\r\nprint(s // 2)", "x = input()\r\nxlist = x.split(\" \")\r\n\r\nS = int(xlist[0]) * int(xlist[1])\r\n\r\nAns = S // 2\r\nprint(Ans)", "m,n=map(int,input().split())\r\ndef by(n, m):\r\n return m*n//2\r\nprint(by(n, m))", "n = list(map(int,str(input()).split(\" \")))\r\nprint(int(n[0]*n[1]/2))", "u, f = map(int, input().split())\r\n#reads i/p print o/p required accordingly\r\nif u == 1 and f == 1:\r\n print(0)\r\nelse:\r\n print(int(u * f) // 2)", "m, n = input().strip().split()\nif (int(m) * int(n)) % 2 == 0:\n print(int(int(m) * int(n) / 2))\nelse:\n print(int((int(m) * int(n) - 1) / 2))", "m,n=map(int,input().split())\r\nval=(m*n)//2\r\nprint(val)", "M,N = [int(m) for m in input().split()]\r\nprint((M*N)//2)", "import math\r\nn=list(map(int, input().split()))\r\nb=n[0]*n[1]\r\na=2*1\r\ny=math.floor(b/a)\r\nprint(y)", "def calc(grid):\r\n return grid[0]*grid[1]//2\r\n\r\ntest = list(map(int, input().split()))\r\nprint(calc(test))", "n, m = list(map(int, input().split()))\r\nif n%2==0 or m%2==0:\r\n print((n*m)//2)\r\nelse:\r\n print((n*m)//2)", "m, n = list(map(int, input().split()))\r\nboard = m * n\r\nif board % 2 == 0:\r\n max = board / 2\r\nelse:\r\n board -= 1\r\n max = board / 2\r\nprint(round(max))\r\n", "def Team(N):\n output=0\n temp=list(N.split(\" \"))\n multi=1\n for i in temp:\n multi*=int(i)\n output=multi//2\n \n \n return output\n \nuser=input()\nprint(Team(user))", "m, n = map(int, input().split())\r\nans = int(m * n /2)\r\nprint(ans)", "linhas, colunas = [int(x) for x in input().split()]\r\npar = colunas%2 == 0\r\nif par: print(colunas//2*linhas)\r\nelse:\r\n if linhas%2 == 0: print((colunas-1)//2*linhas +linhas//2)\r\n else: print((colunas-1)//2*linhas+(linhas-1)//2)", "b=[int(x) for x in input().split()]\r\nprint(((b[0]*b[1])//2))", "dim=input(\"\") #se crea un input para ingresar las dimnesiones \r\ndim_lista=dim.split(\" \") #este comando separa los elementos ingresado al input \r\ndim_entero=[int(i)for i in dim_lista] #transfromar en entero los elementos el int y se agregan a una lista \r\nespacio=dim_entero[0]*dim_entero[1] #el espacio disponible va a ser el area del rectangulo\r\ndomino=2 #una piez de domino ocuoa dos espacios \r\nif espacio%domino==0:\r\n print(int(espacio/domino)) #si el modulo del espacion entre 2(domino) es 0,caben (espacio/domino) piezas\r\nelif espacio%domino!=0:\r\n print(int((espacio-1)/2)) #si el modulo del espacion entre 2(domino) es !=0,caben (espacio-1/2) piezas", "a,b=map(int,input().split())\r\nmax_dominos=(a*b)//2\r\nprint(max_dominos)", "m, n = list(map(int,list(input().split())))\r\nd = 2\r\nprint((m*n)//d)", "a,b=map(int,input().split())\nprint(a*b//2)#jhg\n\t \t \t \t\t\t\t\t\t\t \t\t \t \t", "def main():\r\n M, N = map(int, input().split())\r\n pole = M * N\r\n if pole%2 == 0:\r\n liczbaDomino = pole//2\r\n else:\r\n pole = pole - 1\r\n liczbaDomino = pole//2\r\n print(f\"{liczbaDomino}\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nnumbers = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nm = numbers[0]\r\nn = numbers[1]\r\n\r\nprint(int(m*n /2))\r\n", "import sys\na, b = sys.stdin.readline().split()\nsys.stdout.write(str((int(a)*int(b))//2))\n\t \t \t\t\t \t \t\t \t\t\t \t", "import math\r\nm, n = [int(i) for i in input().split()]\r\nprint(math.floor(m*n / 2))", "m,n = map(int,input().split())\r\ndomino = (m*n)//2\r\nprint(domino)", "aa,b=map(int,input().split())\r\nprint(int(aa * b / 2))\r\n\r\n", "a=list(input().split(\" \"))\r\nprint((int(a[0])*int(a[1])//2))", "\"\"\" 50A: Domino Piling \"\"\"\n\nx, y = list(map(int, input().split()))\nsqr = x * y\nprint(sqr//2)", "from math import floor\r\n\r\nm, n = input().split(' ')\r\nm, n = int(m), int(n)\r\n\r\n# Both are odd\r\nif m*n % 2:\r\n a = max(m, n) - 1\r\n total = (a/2 * min(m, n)) + floor(min(m, n) / 2)\r\n# Both are even\r\nelif not(m % 2) and not(n % 2):\r\n a = max(m, n)\r\n total = a/2 * min(m, n)\r\n# One is odd, other is even\r\nelse:\r\n total = (m * n) / 2\r\n\r\nprint(int(total))", "x = input()\r\nx = x.split(\" \")\r\nM = int(x[0])\r\nN = int(x[1])\r\n\r\nAreaTotal = M * N\r\nprint(AreaTotal // 2)\r\n", "m, n=map(int, input().split())\nTotal=int(m*n//2)\nprint(Total)\n\t \t \t \t \t \t \t\t \t\t \t \t", "A,B = map(int, input().split())\n\ntotal_squares = A*B\nmax_dominoes = total_squares // 2\n\nprint(max_dominoes)\n\t\t\t \t \t \t \t \t \t \t \t\t\t\t\t\t", "M,N = [int(a) for a in input().split()]\r\nA = M*N\r\nB = 2\r\nprint(A//B)", "m,n=[int(x) for x in input().split()]\r\na=0\r\ns=m*n\r\nif s<=1:\r\n print(a)\r\nelse:\r\n if s%2==0:\r\n print(s//2)\r\n else:\r\n for i in range(1,s):\r\n a=2*i\r\n if a>s:\r\n a=a-2\r\n print(a//2)\r\n break\r\n", "M,N=map(int,input().split())\nn=M*N\np=n//2\nprint(p)\n#thgefhwe\n \t \t \t\t\t \t \t\t \t \t\t\t\t \t\t\t \t", "j,k = map(int, input().split())\n\nmax_dominoes = (j * k) // 2\n\nprint(max_dominoes)\n\t\t\t\t\t \t \t \t \t\t\t \t\t \t\t\t \t \t\t", "lw = input()\r\narea=int(lw[:lw.index(' ')])*int(lw[lw.index(' ')+1:])\r\nprint(area//2)\r\n", "m,n=map(int,input().split())\r\nc=m*n\r\nd=c//2\r\nprint(d)", "num=input()\r\nnum=num.split(\" \")\r\nlast=int(num[0])*int(num[1])\r\nfin=last//2\r\nprint(fin)", "import sys\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ndef inp():\n return(int(input()))\ndef inlt():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n\nM, N = inlt()\n\nprint( (M*N)//2 )", "# print(eval(input().replace(' ','*'))//2)\r\nr,c=map(int,input().split())\r\nd=(r*c)//2\r\nprint(d)", "m,n=map(int,input().split())\r\nv1=m*n\r\nv2=2\r\nif v1%v2==0:\r\n print(v1//v2)\r\nelse:\r\n print(v1//v2)", "x = input()\r\ny = x.split(' ')\r\nq = int(y[0])\r\nw = int(y[1])\r\nsize = int((q*w)/2)\r\nprint(size)", "l=map(int,input().split())\r\ns=1\r\nfor i in l :\r\n s*=i\r\nm=s//2\r\nprint(m)", "m,n = map(int, input().split(' '))\r\nif m%2 ==0 and n%2 ==0:\r\n print(int((m*n)/2))\r\nif (m%2 ==0 and n%2!=0) or(m%2!=0 and n%2==0): \r\n print(int((m*n)/2))\r\nif m%2 !=0 and n%2 !=0:\r\n print(int(((m*n)-1)/2))", "m,n=[int(i) for i in input().split()]\r\nprint((m*n)//2)", "m, n = map(int, input().split())\r\n\r\nif n%2==0:\r\n print(m*(n//2)) \r\n \r\nelif m%2==0:\r\n print(n*(m//2)) \r\n \r\nelse:\r\n print(m*((n-1)//2)+(m-1)//2)", "n = list(map(int,input().split()))\r\nm = max(n)\r\nn = min(n)\r\ncount = m//2*n + m%2*n//2\r\nprint(count)", "n,m=map(int,input().split(' '))\r\nprint(int(n*m*0.5))", "n,m= map(int, input().split())\r\ncount = 0\r\nwhile n>=2:\r\n count+=m\r\n n=n-2\r\nif n!=0:\r\n count+=int(m/2)\r\n\r\nprint(count)", "m,n = input().split()\r\nprint(int(m) * int(n) // 2)", "m, n = map(int,input().split())\r\nif m % 2 ==0:\r\n print(m//2*n)\r\nelif n % 2 == 0:\r\n print(n//2*m)\r\nelse:\r\n print(m*n//2)", "def remove(string):\r\n return string.replace(\" \", \"\")\r\n\r\nx,y=map(int,input().split())\r\n\r\n\r\nboardsize_float=x*y\r\n\r\nprint(int(boardsize_float/2))\r\n", "ans = []\r\n\r\ndef sol(m,n):\r\n if m % 2 == 0:\r\n return n * (m // 2)\r\n return n * (m//2) + n // 2\r\n\r\nm, n = map(int, input().split())\r\nans.append(sol(m, n))\r\n\r\nfor i in ans:\r\n print(i)", "from math import *\nm, n = map(int, input().split())\nt = m * n\nif(t < 2):\n print(0)\nelse:\n print(floor(t/2))\n", "m,n=[int(ele) for ele in input().split(' ') ] \r\nmn = m*n\r\nx = mn//2\r\nprint(x)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\ns = m * n\r\nif n % 2 == 0 and m % 2 == 0:\r\n print(s // 2)\r\nelif m % 2 == 0 or n % 2 == 0:\r\n print(s // 2)\r\nelse:\r\n print((s - 1) // 2)", "m,n = (int(i) for i in input(\"\").split(\" \"))\n\nif (m%2==0 and n%2 ==0) or (m%2==0 and n%2 ==1):\n print(int((m/2)*n))\nelif m%2==1 and n%2 ==0:\n print(int((n/2)*m))\nelse:\n f = int(((n-1)/2)*m)+int((m-1)/2)\n s = int(((m-1)/2)*n)+int((n-1)/2)\n if f>s:\n print(f)\n else:\n print(s)\n\n\n\t\t \t \t\t \t \t \t \t \t\t\t \t", "a=[]\r\na=(input().split(maxsplit = 2))\r\n##m=int(input())\r\nif int(a[0])%2==0 or int(a[1])%2==0 or (int(a[0])%2==0 and int(a[1])%2==0):\r\n print(int(int(a[0])*int(a[1])/2))\r\nelse:\r\n print(int((int(a[0])*int(a[1])-1)/2))\r\n", "import math\r\nn,m=map(int,input().split())\r\nif n%2==0:\r\n print(int(m*(n/2)))\r\nelif n%2==1:\r\n a=m*(math.floor(n/2))\r\n print(a+math.floor(m/2))", "M,N=map(int,input().split())\r\nprint(round(M*N//2))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jan 22 21:08:30 2022\r\n\r\n@author: ASUS\r\n\"\"\"\r\n\r\na=list(map(int, input().split(\" \")))\r\nmul=a[0]*a[1]\r\nmain=mul/2\r\nprint(int(main))", "n,m=input().split() \r\nn,m=int(n),int(m)\r\n\r\nrect_area = n * m\r\n\r\ndomino = int(rect_area/2)\r\nprint(domino)", "n,m=map(int,input().split())\r\nif(n<2 and m>n):\r\n n,m=m,n\r\ncount=0\r\nif(n>=2 and m>=1):\r\n rem=n//2\r\n rem1=n%2\r\n count=count+rem*m\r\n if(rem1%2==1):\r\n if(m>2):\r\n rem3=m//2\r\n count=count+rem3\r\nprint(count)", "d, a = input().split()\r\nd = int(d)\r\na = int(a)\r\ni = d * a / 2\r\nprint(int(i))\r\n\r\n", "n = list(map(int, input().split()))\r\n\r\ncount = n[0] * n[1]\r\n\r\nt = count / 2\r\n\r\nt = int(t)\r\nprint(t)", "M,N = input().split()\r\nm = int(M)\r\nn = int(N)\r\n##if((n*m)%2 == 0):\r\nprint((m*n)//2)\r\n\r\n \r\n", "import math as m\r\nm,n=map(int,input().split())\r\nx = (m*n)/2\r\nx = int(x)\r\nprint(x)", "a = input().split(\" \")\nprint(int(((int(a[0]))*int(a[1])/2)-(int(a[0])*int(a[1]))%2+0.5))", "size = input()\r\nnum1 = \"\"\r\narray = []\r\nfor x in size:\r\n if x != \" \":\r\n num1 += x\r\n else:\r\n array.append(int(num1))\r\n num1 = \"\"\r\narray.append(int(num1))\r\nsize = array[0]*array[1]\r\nprint(size//2)", "m,n= input().split(\" \")\r\ndominos = ( int(m)*int(n) ) // 2\r\nprint(dominos)", "m, n = [int(j) for j in input().split()]\r\nif m * n % 2 == 0:\r\n print(m * n // 2)\r\nelse:\r\n print((m * n - 1) // 2)", "import math\r\nip=input()\r\nnum=ip.split(\" \")\r\nl= int(num[0])\r\nb= int(num[1])\r\nop = math.floor((l*b)/2)\r\nprint(op)", "x,y=input().split()\r\nM=int(x)\r\nN=int(y)\r\nprint(int((M*N)/2))", "m,n=map(int, input().strip().split(' '))\r\na=m*n\r\nif(a%2==0):\r\n\tprint(int(a/2))\r\nelse:\r\n\tprint(int(a//2))", "x, y = list(map(int, input().split(' ')))\r\na = (x*y) / 2\r\nprint(int(a))", "input_str=input()\r\nmn=input_str.split()\r\nm,n=map(int, mn)\r\nn=(m*n)//2\r\nprint(n)", "n,k = map(int, input().split())\r\nif n*k >=2:\r\n print((n*k)//2)\r\nelse:\r\n print(0)", "sides = input().split()\r\nsquares = int(sides[0]) * int(sides[1])\r\nmax_dominoes = int(squares / 2)\r\nprint(max_dominoes)", "M,N=map(int,input().split())\r\nt=(M*N//2*1)\r\nprint(t)", "m,n= input().split()\r\nm=int(m)\r\nn=int(n)\r\ndef no_dominos(m,n):\r\n return (m*n)//2\r\nprint(no_dominos(m,n))", "\" \" \"domino piling problem statement\" \" \"\na,b=map(int,input( ).split( ))\ns=a*b/2\nprint(int(s))\n \t\t \t \t \t\t\t \t\t \t \t \t\t\t \t", "dimensiones = input()\ndimensioness = dimensiones.split(\" \")\nmenor = int(dimensioness[0])\nmayor = int(dimensioness[1])\n\narea = mayor * menor\n\nif area % 2 == 0 :\n print(int(area / 2))\nelse :\n print(int((area -1) / 2)) \n\t \t\t\t \t\t \t\t \t\t\t \t \t\t\t \t\t \t\t \t", "x = [int(i) for i in input().strip().split()]\r\nprint((x[0]*x[1])//2)", "l,w=input().split()\nl=int(l)\nw=int(w)\nprint((l*w)//2) \n \t\t \t\t\t \t\t \t\t \t \t\t\t\t", "widthHeight = input().split()\r\nm = int(widthHeight[0])\r\nn = int(widthHeight[1])\r\narea = m * n \r\nsize = int(area//2)\r\nprint(size)", "import math\r\nip = input().split()\r\nM = int(ip[0])\r\nN = int(ip[1])\r\n\r\nprint(math.floor(M*N/2))", "m, n = map(int,input().split())\r\n\r\ncount = 0\r\nif (m // 2 == 0):\r\n if (n//2 == 0):\r\n count = 0\r\n else:\r\n count = n // 2\r\nelse:\r\n if (m %2 != 0):\r\n count = (n * (m//2)) + n//2\r\n if (m%2 == 0):\r\n count = (n*(m//2))\r\n\r\n\r\n\r\nprint(count)", "m, n = list(map(int, input(). split()))\r\nS = m * n\r\nif S % 2 == 1:\r\n print((S - 1) // 2)\r\nelse:\r\n print(S // 2)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[3]:\n\n\nm,n= map(int,input().split())\n\nprint(m*n//2)\n\n\n# In[ ]:\n\n\n\n\n", "lin1 = input().split()\r\nprint((int(lin1[0])*int(lin1[1]))//2)\r\n", "\r\nimport math\r\n\r\nn, m = map(int, input().split())\r\n\r\n\r\np = n * m\r\n\r\nh = math.floor(p / 2)\r\nprint(h)", "n, k = map(int, input().split())\r\n\r\na=(n*k)//2\r\nprint(a)\r\n", "from math import floor\r\nm,n = map(int,input().split())\r\n\r\ndoms = floor(m*n*0.5)\r\n\r\nprint(doms)", "m,n=map(int,input().split())\r\nsquares_covered=(m*n)//2\r\nprint(squares_covered)", "M_and_N=input ( )\r\nM_and_Nlist =M_and_N.split( )\r\nM =int (M_and_Nlist[0])\r\nN =int (M_and_Nlist[1])\r\nprint (M *N //2)", "import math\r\nfirstLine = input()\r\nm, n = firstLine.split(' ')\r\nm = int(m)\r\nn = int(n)\r\nans = math.trunc(m*n/2)\r\nprint(ans)", "\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nres = n * m \r\nprint(int(res/2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a,b=input(\"\").split()\r\na=int(a)\r\nb=int(b)\r\nif b%2==0:\r\n c=a*(b/2)\r\nelif a%2==0:\r\n c=b*(a/2)\r\nelse :\r\n c=(a*(b//2))+(a//2)\r\n\r\n\r\nprint(int(c))\r\n", "dim = input().split()\r\nsquares = int(dim[0])*int(dim[1])\r\nprint(squares//2)", "inp = input().split()\r\n\r\nboard = int(inp[0]) * int(inp[1])\r\n\r\nif board % 2 == 0:\r\n print(int(board / 2))\r\nelse:\r\n print(int((board - 1)/2))", "num = input()\r\nnum = num.split()\r\nsum_num = int(num[0]) * int(num[1])\r\nresult = sum_num // 2\r\nprint(result)\r\n", "m, n = map(int,input().split())\r\n\r\nboxes = m*n\r\nprint(boxes//2)", "import math\r\n\r\nx , y = input().split()\r\nm = int(x)\r\nn = int(y)\r\n\r\nif m % 2 == 0:\r\n num_square = n * (m/2)\r\nelse:\r\n m1 = math.floor(m/2)\r\n num_square = n * m1\r\n #counting number of dominoes possible in the odd row(horizontal aligned domino)\r\n if n % 2 == 0: #if no. of columns is even\r\n num_square += (n/2) # then no. of dominoes is just half of no. of columns (eg. 4 columns -> 2 dominoes in the last odd row)\r\n else: #if noc is odd\r\n n1 = math.floor(n/2) #floor the value obtained after dividing by 2 and add it to number of domino\r\n num_square += n1\r\n\r\nprint(int(num_square))", "m,n=map(int,input().split())\r\nif m%2!=0 and n%2!=0:\r\n max_dom=(m*n-1)//2\r\nelse:\r\n max_dom=m*n//2\r\nprint(max_dom)", "L=input().split()\nM=int(L[0])\nN=int(L[1])\nif(1<=M<=N<=16):\n print(((M*N)-(M*N%2))//2)\n \t \t \t \t \t \t\t \t\t \t\t\t \t\t", "m,n=input().split()\r\ny=int(m)\r\nz=int(n)\r\nx=y*z\r\nf=(x//2)\r\nprint(f)", "m,n=[int(j) for j in input().split()]\r\nif n%2==0:\r\n print(m*(n//2))\r\nelse:\r\n print(m*(n//2)+(m//2))", "m , n = map(int, input().split())\r\ncount=(m*n)//2\r\nprint(count)", "inp = input()\narr = inp.split(\" \")\nmasa = int(arr[0]) * int(arr[1])\nif masa%2 == 0:\n print(int(masa/2))\nelse: print(int((masa-1)/2))", "# this is my solution for problem 50A at codeforces \r\n# date: 23 khordad 1402\r\n\r\nM , N = map(int , input().split(\" \"))\r\n\r\nprint(M*N // 2)", "M, N = input().split()\r\nprint(int((int(M)*int(N))/2))", "# n,k = input().split(\" \")\n# n = int(n)\n# k = int(k)\n# while(k>0):\n# \ttemp = n%10\n# \tif temp!=0:\n# \t\tn-=1\n# \telse:\n# \t\tn//=10\n# \tk-=1\n# print(n)\n# name = input()\n# name = set(name)\n# if len(name)%2 == 0:\n# \tprint(\"CHAT WITH HER!\")\n# else:\n# \tprint(\"IGNORE HIM!\")\n\n# w = int(input())\n\n# if w!=2 and w%2 == 0:\n# \tprint(\"YES\")\n# else:\n# \tprint(\"NO\")\n# n = int(input())\n# l1 = []\n# for i in range(n):\n# \tl1.append(input())\n# for i in range(len(l1)):\n# \tif len(l1[i]) <= 10:\n# \t\tprint(l1[i])\n# \telse:\n# \t\tprint(l1[i][0] + str(len(l1[i])-2) + l1[i][-1])\n# n = int(input())\n# l1 = []\n# ct=0\n# for i in range(n):\n# l1.append((input().split(\" \")))\n# for i in range(len(l1)):\n# if l1[i].count(\"1\")>=2:\n# ct+=1\n# print(ct)\n# n,k = input().split(\" \")\n# n,k = int(n),int(k)\n# fn = int\n# l1 = input().split(\" \")\n# cutoff = fn(l1[k-1])\n# ct=0\n\n# for i in range(len(l1)):\n# if fn(l1[i]) > 0 and fn(l1[i]) >= cutoff:\n# ct+=1\n# print(ct)\nm,n = input().split(\" \")\nm,n = int(m),int(n)\narea = m*n \nprint(area//2)\n", "\r\n\r\ndef prime_factors(n):\r\n factors = []\r\n\r\n while n % 2 == 0:\r\n factors.append(2)\r\n n //= 2\r\n\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n factors.append(i)\r\n n //= i\r\n\r\n if n > 2:\r\n factors.append(n)\r\n\r\n return factors\r\n\r\n\r\ndef convert_to_decimal(N, X):\r\n decimal = 0\r\n power = 0\r\n size = len(N)\r\n\r\n for i in range(size - 1, -1, -1):\r\n digit = N[i]\r\n value = int(digit) if digit.isdigit() else ord(digit) - ord('A') + 10\r\n decimal += value * X**power\r\n power += 1\r\n\r\n return decimal\r\n\r\ndef convert_from_decimal(N, X):\r\n baseX = ''\r\n\r\n while N > 0:\r\n remainder = N % X\r\n\r\n if remainder < 10:\r\n baseX = str(remainder) + baseX\r\n else:\r\n baseX = chr(ord('A') + remainder - 10) + baseX\r\n\r\n N //= X\r\n\r\n return baseX\r\n\r\ndef add_large_numbers(num1, num2):\r\n sum_str = ''\r\n carry = 0\r\n i, j = len(num1) - 1, len(num2) - 1\r\n\r\n while i >= 0 or j >= 0 or carry > 0:\r\n digit1 = int(num1[i]) if i >= 0 else 0\r\n digit2 = int(num2[j]) if j >= 0 else 0\r\n\r\n sum_digits = digit1 + digit2 + carry\r\n carry = sum_digits // 10\r\n sum_str = str(sum_digits % 10) + sum_str\r\n\r\n i -= 1\r\n j -= 1\r\n\r\n return sum_str\r\n\r\ndef multiply_large_number(num, multiplier):\r\n product_str = ''\r\n carry = 0\r\n\r\n for i in range(len(num) - 1, -1, -1):\r\n digit = int(num[i])\r\n product_digits = digit * multiplier + carry\r\n carry = product_digits // 10\r\n product_str = str(product_digits % 10) + product_str\r\n\r\n if carry > 0:\r\n product_str = str(carry) + product_str\r\n\r\n return product_str\r\n\r\n\r\n\r\ndef redirect_io():\r\n sys.stdin = open(\"input.txt\", \"r\") # Redirect standard input to read from 'input.txt'\r\n sys.stdout = open(\"output.txt\", \"w\") # Redirect standard output to write to 'output.txt'\r\n\r\ndef factors_n(n):\r\n factors = []\r\n for i in range(1, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n factors.append(i)\r\n if n // i != i:\r\n factors.append(n // i)\r\n return factors\r\n\r\ndef sum_n(n):\r\n return (n * (n + 1)) // 2\r\n\r\ndef solve_quadratic_equation(a, b, c):\r\n discriminant = b * b - 4 * a * c\r\n roots = []\r\n\r\n if discriminant > 0:\r\n roots.append((-b + math.sqrt(discriminant)) / (2 * a))\r\n roots.append((-b - math.sqrt(discriminant)) / (2 * a))\r\n elif discriminant == 0:\r\n roots.append(-b / (2 * a))\r\n\r\n return roots\r\n\r\n\r\n\r\ndef factorial(n, memo):\r\n if n <= 1:\r\n return 1\r\n\r\n if n in memo:\r\n return memo[n]\r\n\r\n result = ((n % MOD) * (factorial(n - 1, memo) % MOD)) % MOD\r\n memo[n] = result\r\n return result\r\n\r\ndef combination(n, r):\r\n if r > n:\r\n return 0\r\n\r\n memo = {}\r\n numerator = factorial(n, memo)\r\n denominator = factorial(r, memo) * factorial(n - r, memo)\r\n\r\n return numerator // denominator\r\n\r\ndef permutation(n, r):\r\n if r > n:\r\n return 0\r\n\r\n memo = {}\r\n numerator = factorial(n, memo)\r\n denominator = factorial(n - r, memo)\r\n\r\n return numerator // denominator\r\n\r\nfrom math import *\r\nimport sys\r\n\r\nINF = 998244353\r\nMOD = 10**9 + 7\r\n\r\n\r\ndef solve(tc):\r\n n,m=map(int,input().split())\r\n print(max(floor(n/2 *m ),floor(m/2 *n )))\r\n\r\n\r\ndef main():\r\n\r\n\r\n t=1\r\n # t = int(input())\r\n for i in range(1, t + 1):\r\n solve(i)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a , b = map(int,input().split())\nprint(a*b//2)\n", "m, n = map(int, input().split())\r\n\r\nif m > n:\r\n r = (m // 2) * n\r\n if m % 2 == 1:\r\n r += n // 2\r\nelse:\r\n r = (n // 2) * m\r\n if n % 2 == 1:\r\n r += m // 2\r\nprint(r)\r\n", "inp = input()\r\na = inp.split(\" \")\r\nm = int(a[0])\r\nn = int(a[1])\r\n\r\n\r\ndef domino_piling(m, n):\r\n return (m * n) // 2\r\n\r\n\r\nprint(domino_piling(m, n))", "m,n = map(int,input().split())\n\nz = m*n \n\nprint(z//2)", "l=input().strip().split(\" \")\r\na=int(l[0])*int(l[1])//2\r\nprint(a)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled0.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Waz_FxYDlUD0mib3FFOT9XKkEDEaQL32\n\"\"\"\n\nx=input()\nx=x.split(' ')\np=(int(x[0])*int(x[1]))//2\nprint(p)\n\n\n\n", "mas = list(map(int, input().split()))\r\nprint(mas[0] * mas[1] // 2)", "a=input()\r\na=a.split()\r\nm=int(a[0])\r\nn=int(a[1])\r\nprint(int(m*n/2))", "m, n = input().split()\r\nm, n = int(m), int(n)\r\nDOMINO_SIZE = 2\r\n\r\nboard_size = m * n\r\n\r\nprint(board_size // DOMINO_SIZE)\r\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nproduct = a*b\r\nans = product//2\r\nprint(ans)\r\n", "m,n=map(int,input().split())\r\nprint((min(m,n)//2)*max(m,n)+((min(m,n)%2)*max(m,n)//2))", "M,N=map(int,input().split())\r\nprint(int((N*M)/2))", "m,n = map(int,input().split())\r\nans = int(m*n/2)\r\nprint(ans)", "o, k = map(int, input().split())\r\ntotal = int(o*k / 2)\r\nprint(total)", "m,n=map(int,input().split())\r\nif (m>=1 and m<=16) and (n>=1 and n<=16):\r\n print((m*n)//2)", "m, n = map(int, input().split())\r\narea = m * n\r\ndomino = 2\r\nt = area//domino \r\nprint(t)", "m, n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nif n*m % 2 == 0:\r\n print(int((m*n)/2))\r\nelse:\r\n print(int((m*n)/2))", "m, n=input().split()\r\ns=int(m)*int(n)\r\nr=s // 2\r\nprint(r)\r\n", "n,m=map(int,input().split(\" \"))\r\nb=(n*m)//2\r\nprint(b)", "a,m = map(int, input().split())\r\nprint((a*m)//2)", "n, k = [int(x) for x in input().split()]\r\nd=0\r\nif n%2 == 0:\r\n d=(n//2)*k\r\nelif n<2:\r\n if k>=2:\r\n d=k//2\r\nelse:\r\n d=(n//2)*k+(k//2)\r\nprint(d)", "m=input().split()\r\nprint(int(int(m[0])*int(m[-1])/2))", "m,n =map(int, input().split())\r\nif m == 1and n == 1:\r\n print(0)\r\nelse:\r\n print(int(m*n)//2) \r\n", "m,n=map(int,input().split())\nx=m*n\nprint(x//2)\n#5a2\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\nprint(( N*M ) // 2)", "inp = input()\r\nMN = inp.split()\r\nMN = list(map(int,MN))\r\nskolko = 0\r\nif MN[0] * MN[1] % 2 == 0 :\r\n skolko = MN[0] * MN[1] / 2\r\nelse : \r\n skolko = MN[0] * MN[1] - 1\r\n skolko /= 2\r\nprint(int(skolko))", "n, m = list(map(int, input().split()))\r\nmat = n*m\r\nprint(int(mat/2))", "m, n = input().split()\r\nr = int(m) * int(n)\r\nq = int(r / 2)\r\nprint(q)\r\n", "##n=int(input( ))\r\n##a=0\r\n##cek=True\r\n##if(n>3):\r\n## for i in range(2,n):\r\n## if(n%i==0):\r\n## if(i%2==0):\r\n## cek=True\r\n## a=a+n-i\r\n## break\r\n## else:\r\n## cek=False\r\n##else:\r\n## cek=False\r\n##if(a%2!=0):\r\n## cek=False\r\n##if cek:\r\n## print(\"YES\")\r\n##else:\r\n## print(\"NO\")\r\n\r\n##n,m,a = input().split()\r\n##x=0\r\n##y=0\r\n##if(int(n)%int(a)!=0):\r\n## x=(int(n)/int(a))+1\r\n##elif(int(n)%int(a)==0):\r\n## x=(int(n)/int(a))\r\n##if(int(m)%int(a)!=0):\r\n## y=(int(m)/int(a))+1\r\n##elif(int(m)%int(a)==0):\r\n## y=(int(m)/int(a))\r\n##print(int(x)*sint(y))\r\n\r\n\r\n##n=int(input())\r\n##m=[]\r\n##x=0\r\n##for i in range(n):\r\n## x=input()\r\n## m.append(x)\r\n##for i in range(len(m)):\r\n## if(len(m[i])<=10):\r\n## print(m[i])\r\n## else:\r\n## print(m[i][0]+str(len(m[i])-2)+m[i][len(m[i])-1])\r\n\r\n##n=int(input())\r\n##b=0\r\n##for i in range(n):\r\n## x=0\r\n## a=0\r\n## x=input().split()\r\n## for j in range(len(x)):\r\n## if(x[j]=='1'):\r\n## a=int(x[j])+a\r\n## if(a>1):\r\n## b=b+1\r\n##print(b)\r\n\r\n##n,m=input().split()\r\n##x=input().split()\r\n##a=0\r\n##for i in range(len(x)):\r\n## if(int(x[i])>=int(x[int(m)-1]) and int(x[i])>0):\r\n## a=a+1\r\n##print(a)\r\n\r\nn,m=input().split()\r\nprint(int(int(n)*int(m)/2))\r\n", "def maxNum(n, m):\r\n return n*m // 2\r\n\r\nif __name__ == \"__main__\":\r\n p = input().split()\r\n n = int(p[0])\r\n m = int(p[1])\r\n solution = maxNum(n,m)\r\n print(solution)", "a,b=map(int,input().split())\nprint(a*b//2)#njk\n\t \t\t\t\t\t\t\t \t\t \t \t\t\t \t", "a,b = [int(x) for x in input().split()]\r\nif a==1 and b==1:\r\n print(0)\r\nelse:\r\n print(int(a*b/2))", "a,g=map(int,input().split())\r\ns=a*g//2\r\nprint(s)", "a,b = map(int, input().split())\r\ncount = int((a*b)/2)\r\nprint(count)", "num=input()\r\nnum=num.split(\" \")\r\nm=int(num[0])\r\nn=int(num[1])\r\nif m*n%2==0:\r\n print(m*n//2)\r\nelse:\r\n print((m*n-1)//2)", "m, n = map(int,input().split())\r\nprint((m * n) // 2)", "rectangle = [int(x) for x in input().split()]\r\narea = rectangle[0] * rectangle[1]\r\n\r\nif area % 2 == 0:\r\n print(area//2)\r\nelse:\r\n print(area//2)", "l1 = list(map(int,input().split()))\r\nm = l1[0]\r\nn= l1[1]\r\nif m%2==0 or n%2==0:\r\n dominoes = (m*n)/2\r\nelse:\r\n dominoes = (((m-1)*n)/2)+((n-1)/2)\r\nprint(int(dominoes))", "m,n=(int(x) for x in input().split())\r\np=m*n\r\nif(p%2==0):\r\n print(p//2)\r\nelse:\r\n print((p-1)//2)", "m, n = [ int(x) for x in input().split(\" \") ]\n\nif m*n % 2 == 0:\n print(m*n//2)\nelse:\n print(((m*n)//2))", "input1 = input().split()\r\nm = int(input1[0])\r\nn = int(input1[1])\r\nprint((m*n)//2)\r\n\r\n\r\n\r\n\r\n", "def solution():\n inputs = input().split()\n board_height = int(inputs[0])\n board_width = int(inputs[1])\n\n half_board_height = board_height // 2\n half_board_width = board_width // 2\n area_sum = 2 * half_board_height * half_board_width\n\n if ((board_height % 2 == 1) and (board_width % 2 == 1)):\n area_sum += half_board_height + half_board_width\n\n elif ((board_height % 2 == 1) and (board_width % 2 == 0)):\n area_sum += half_board_width\n\n elif ((board_height % 2 == 0) and (board_width % 2 == 1)):\n area_sum += half_board_height\n\n print(area_sum)\n\n\nif __name__ == \"__main__\":\n solution()\n", "import math\r\nN,M = input() .split()\r\nArea = int(N) * int(M)\r\nno = math.floor(Area/2)\r\nprint(no)", "dimensions = input()\r\n\r\ndim = dimensions.split(\" \")\r\n\r\narea = int(dim[0]) * int(dim[1])\r\n\r\nremainder = area % 2\r\n\r\nprint(int((area - remainder) / 2))", "n,m=map(int, input().split())\r\nb=n*m\r\nprint(int(b/2))", "n,k = input().split()\nn = int(n)\nk = int(k)\nc = n*k\ns = c//2\nprint(s)\n", "def main():\r\n m , n = map(int,input().split())\r\n print(m*n//2)\r\nmain()\r\n", "i,j=map(int,input().split())\r\nprint(int(j*i/2))", "import math\r\nraw = input().split()\r\nm, n = int(raw[0]), int(raw[1])\r\narea_size = m * n\r\nprint(math.floor(area_size / 2))", "n, m=map(int, input(). split())\nprint((n*m)//2)\n\t \t \t \t\t \t\t\t\t\t\t\t \t\t\t\t \t\t\t\t", "def main():\n n, m = map(int, input().split())\n area_of_domino = 2\n area_of_board = n * m\n print(area_of_board // area_of_domino)\n\n\nmain()", "a,b=[int(a) for a in input().split()]\r\nc=a*b\r\nif c%2==0:\r\n d=int(c/2)\r\n print(d)\r\nelse:\r\n e=c-1\r\n s=int(e/2)\r\n print(s)", "n=input()\r\nn=n.split()\r\nk=int(n[1])\r\nn=int(n[0])\r\nprint(n*k//2)", "a,k=input().split()\r\nj=int(a)*int(k)\r\nprint(j//2)", "a=list(map(int,input().split()))\r\nprint(int((a[0]*a[1])/2))", "s=input().split(' ')\r\nm = int(s[0])\r\nn = int(s[1])\r\nprint(m*n // 2)", "num = input().split()\r\nm = num[0]\r\nn = num[1]\r\n\r\nsum = int(n)*int(m) / 2\r\n\r\n\r\nprint(int(sum))", "dom=2\r\nnum=list(map(int,input().split(' ')))\r\nar=num[0]*num[1]\r\nsum=0\r\nc=0\r\nwhile True:\r\n sum=sum+dom\r\n if sum<=ar:\r\n c+=1\r\n else:\r\n break\r\nprint(c)\r\n", "m,n=list(map(int, input().split()))\r\na=m*n\r\nprint(a//2)", "enter = input()\r\nl1 = enter.split(\" \")\r\nfor i in range(len(l1)):\r\n l1[i] = int(l1[i])\r\nc1 = l1[0] // 1\r\nc2 = l1[1] // 2\r\nc3 = c1 * c2\r\nif l1[1] % 2 != 0:\r\n v = l1[0] // 2\r\n c3 += v\r\nprint(c3)", "a=list(map(int,input().split()))\r\nc=a[0]*a[1]//2\r\nprint(c)\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[8]:\n\n\nn, k = map(int, input().split())\nout = int((n*k)/2)\nprint(out)\n\n\n\n# In[ ]:\n\n\n\n\n", "l=list(map(int,input().split()))\r\nprint((l[0]*l[1])//2)", "n=input()\r\nnlist=[int(a) for a in n.split()]\r\nwidth=nlist[0]\r\nlength=nlist[1]\r\nif length%2==0:\r\n\tprint(int(length*width/2))\r\nelse:\r\n\tprint(int(length//2*width+width//2))\r\n", "a = [int(i) for i in input().split()]\r\nh = 1\r\nfor i in a:\r\n h *= i\r\nprint(h//2)", "#q6 Domino piling\r\ndef func6():\r\n m,n=[int(x) for x in input().split()]\r\n print((m*n)//2)\r\nfunc6()", "m, n = map(int, input().split())\r\nprint(m * (n - (n%2))//2 + (n%2) * m//2)", "number_str = input().split(\" \")\r\nfirst = int(number_str[0])\r\nsecond = int(number_str[1])\r\nans = first * second // 2\r\nprint(ans)", "x,y=map(int,input().split())\r\nif x==1 and y==1: print(0)\r\nelse: print(int(x*y) // 2)", "M, N = map(int, input().split())\nmax_pizza = (M * N) // 2\nprint(max_pizza)\n\n \t\t \t\t \t \t \t \t \t\t \t", "x, y =input().split()\r\nz= 2*1\r\nA= int(x)*int(y) \r\nc=A/z\r\nprint (int(c))\r\n", "def domino(M, N):\r\n if M % 2 == 0:\r\n return M * N // 2\r\n elif N % 2 == 0:\r\n return M * N // 2\r\n else:\r\n return (M * N - 1) // 2\r\n\r\nM, N = map(int, input().split())\r\n\r\nprint(domino(M, N))\r\n", "def dominoPiling():\r\n (m, n) = map(int, input().split())\r\n square = m*n\r\n print(int(square/2))\r\n return\r\ndominoPiling()", "import math\r\na,b = (map (int ,input().split()))\r\n\r\nc = a * b\r\nd = math.floor(c//2)\r\nprint(d)", "length, breadth = [int(x) for x in input().split()]\r\narea = length * breadth\r\nmax_dominoes = area // 2\r\nprint(max_dominoes)", "import math\r\nn,m=map(int,input().split())\r\nprint(math.floor((n*m)/2))", "m, n = map(int, input().split())\r\n\r\ni = 0\r\n\r\nk = m*n\r\n\r\nwhile k != 0 and k != 1:\r\n k = k - 2\r\n i = i + 1\r\n \r\nprint(i)", "a=list(map(int,input().split()))\r\nc=a[0]*a[1]\r\nb=2\r\nd=c/b\r\nprint(int(d))\r\n\r\n \r\n\r\n \r\n\r\n\r\n", "m,n=map(int,input().split())\r\nmax_num=(m*n)//2\r\nprint(max_num)\r\n", "import math\r\nM, N = map(int, input().split())\r\nprint(math.floor(N*M*0.5))", "a = input().split()\r\ns = int(a[0])*int(a[1])\r\nif s % 2 == 1:\r\n s -= 1\r\nprint(int(s/2))\r\n", "#a,b=map(int,input().split())\r\n#print(a*b//2)\r\nfrom math import *\r\nprint(round(exp(sum(map(lambda x:log(int(x)),input().split()))))//2)\r\n", "length, width = map(int, input().split())\nprint(length * width // 2)\n", "class Solution:\r\n def domino(l,b):\r\n area = l*b\r\n if area % 2 != 0:\r\n return (area - 1) // 2\r\n else:\r\n return area // 2 \r\n \r\n\r\n\r\nl, b = input().split()\r\nans = Solution.domino(int(l), int(b))\r\nprint(ans) ", "def print_hi(name):\r\n\r\n list1 = list(map(lambda x: int(x), name.split(' ')))\r\n print((list1[0]*list1[1])//2)\r\n\r\n\r\nif __name__ == '__main__':\r\n print_hi(input())", "if __name__==\"__main__\":\r\n m, n = [int(x) for x in input().split()]\r\n print((m*n)//2)", "import sys\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\nprint(n*m//2)\r\n", "a,b = map(int,input().split())\r\nres = a*b // 2\r\nprint(res)", "def Dominepiling(j,k):\r\n return (j * k) // 2\r\nj,k= map(int, input().split())\r\nprint(Dominepiling(j,k))", "import sys\r\ndef main():\r\n d, s = map(int, sys.stdin.readline().split())\r\n print((d*s)//2)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "a, b = input().split()\r\na, b = int(a), int(b)\r\nprint((a*b)//2)", "l = list(map(int, input().split()))\r\nFinal=0\r\nFinal =(l[0]*l[1])//2\r\nprint(Final)\r\n", "n,m = map(int,input().split())\r\neq=n*m\r\nprint(eq//2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue May 4 16:03:26 2021\r\n\r\n@author: david\r\n\"\"\"\r\nimport math\r\nm , n = [ int(x) for x in input().split()]\r\n\r\n\r\nuntilm = math.floor( m / 2)\r\nntiles= untilm * n\r\nif m % 2 == 1:\r\n ntiles += math.floor(n/2)\r\n \r\nprint(ntiles)\r\n \r\n ", "count = 0\r\nn,m = map(int,input().split())\r\ntotal = m*n\r\nwhile(total>1):\r\n count += 1\r\n total -= 2\r\nprint(count)", "m=input().split()\r\nm=list(map(int,m))\r\np=m[0]*m[1]\r\nd=p//2\r\nprint(d)\r\n\r\n", "M, N = input().split()\nM, N = int(M), int(N)\nA1= int(M*N/2)\nif M <= N: print(A1)\n\t\t \t \t\t\t \t \t\t\t\t \t \t \t \t", "mn=[int(i) for i in input().split()]\r\nprint(int(mn[0]*mn[1]/2))", "x,y = list(map(int, input().split()))\r\nprint((x*y)//2)", "m,n=map(int,input().split())\nres=(m*n)//2\nprint(res)", "a,b=(int(x) for x in input().split())\r\nm=a*b\r\nif m%2==1:\r\n print(int((m-1)/2))\r\nelse:\r\n print(int(m/2))\r\n", "dim=input()\nm,n = dim.split(\" \")\nm=int(m)\nn=int(n)\nresult = (m*n)//2\nprint(result)\n", "\r\n\r\n\r\n\r\nm,n = map(int, input().split())\r\nproduct = m*n\r\n\r\nif product < 2:\r\n print(0)\r\nelse:\r\n print(product//2)\r\n", "'''\r\nm, n = map(int, input().split())\r\ns = m * n\r\nprint(s//2)\r\n'''\r\n\r\nm, n = map(int, input().split())\r\nans = (n // 2) * m\r\nif n % 2 == 1:\r\n if m >= 2:\r\n ans += m // 2\r\nprint(ans)\r\n", "m,n = map(int,input().split(' '))\nprint(int((m*n)/2))", "m, n = [int(e) for e in input().strip().split()]\r\n\r\ncells_amount = m * n\r\nprint((m*n)//2)\r\n", "m,n = map(int,input().split())\nmaxi = (m*n)//2\nif maxi != 0:\n print(maxi)\nelse:\n print(0)\n", "m,n=[int(x) for x in input().split()]\r\nprint((m*n)//2)", "num = input().split()\r\nnum1 = [int(a) for a in num]\r\nm = num1[0]\r\nn = num1[1]\r\ns = m * n\r\n\r\nprint(s // 2)", "a,b=map(int,input().split())\r\nx=(a*b)/2\r\nprint(int(x))", "n,m = map(int,input().split())\r\nif m % 2 == 0:\r\n ans = int(m / 2) * n\r\nelse:\r\n ans = int(m // 2) * n + int(n // 2)\r\nprint(ans)", "a,b = map(int,input().split())\r\ns = a*b\r\ns = s//2\r\nprint(s)", "a = input().split(\" \")\r\nnum1 = int(a[0])\r\nnum2 = int(a[1])\r\nb = (num1 * num2) // 2\r\nprint(b)\r\n", "me,nu=map(int,input().split())\r\nprint(me*nu//2)", "n,m =list(map(int,input().split()))\r\np=n*m\r\na=2\r\nc=0\r\nwhile p>=a:\r\n c+=1\r\n a+=2\r\nprint(c)", "m, n = input().split()\r\nif 1 <= int(m) <= int(n) <= 16:\r\n b_s = int(m) * int(n)\r\n print(b_s // 2)", "a,b=input().split()\r\nc=int(a)*int(b)\r\nif(c%2==0):\r\n print(c//2)\r\nelse:\r\n print((c-1)//2)", "M, N = map(int, input().split())\r\n\r\n# Calculate the number of 2x1 cells in the MxN board\r\n# Each 2x1 cell can accommodate one domino.\r\nmax_dominoes = (M * N) // 2\r\n\r\nprint(max_dominoes)\r\n", "ba=input()\r\nsize = ba.split(\" \")\r\nb,a = int(size [0]),int(size[1])\r\narea = b*a\r\nprint(area//2)", "n,m = map(int,input().split())\nc = ((m*n)//2)\nprint(c)\n \t \t\t \t \t \t \t\t\t \t \t\t \t", "import math\ndominopiling=input()\ndominopiling_2=dominopiling.split()\nM=int(dominopiling_2[0])\nN=int(dominopiling_2[1])\nnumer=math.floor(M*N/2)\nprint(numer)", "a , b =map(int , input().split())\nmas=a*b\nprint(mas//2)\n\n", "def max_dominoes(M, N):\r\n if M % 2 == 1 or N % 2 == 1:\r\n return (M * N) // 2\r\n else:\r\n return (M * N) // 2\r\n\r\n# Read input\r\nM, N = map(int, input().split())\r\n\r\n# Calculate and print the maximum number of dominoes\r\nprint(max_dominoes(M, N))\r\n", "k,n=map(int,input().split())\r\nf=k*n \r\nprint(f//2)\r\n", "a,b = map(int,input().split())\r\nif a*b < 2:\r\n print(0)\r\nelif (a*b)%2 == 0:\r\n print(int(a*b/2))\r\nelse:\r\n print(int((a*b - 1)/2))\r\n\r\n", "m,n = ( int(x) for x in str(input()).split(' ') )\nprint(int(m*n//2))\n", "n,m = map(int , input().split())\r\nif n*m%2==0:\r\n print(int(n*m/2))\r\nelse:\r\n print(int(((m*n)-1)/2))", "m,n = map(int, input().split())\r\na = m * n\r\nif a % 2 == 0:\r\n print(int(a / 2))\r\nelse:\r\n a = a - 1\r\n print(int(a / 2))", "s = [int(i)for i in input().split()]\r\nprint(s[0]*s[1]//2)", "k = input().split()\nm=k[0]\nn=k[1]\nif int(n)==0 and int(m)==0:\n print(0)\nelse:\n print((int(m)*int(n))//2)\n\n ", "# Problem: A. Domino piling\r\n# Contest: Codeforces - Codeforces Beta Round #47\r\n# URL: https://codeforces.com/problemset/problem/50/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\n\"\"\" Python 3 compatibility tools. \"\"\"\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\nl = inlt()\r\nm = l[0]\r\nn = l[1]\r\n\r\nimport math\r\ntotal = 0\r\nper_row = math.floor(m / 2)\r\nper_col = math.ceil(n / 1)\r\n# print(per_row, per_col, per_row * per_col)\r\n\r\ntotal = per_row * per_col\r\nif m % 2 == 1:\r\n total += math.floor(n / 2)\r\n \r\nprint(total)\r\n ", "M,N = map(int, input().split())\r\nArea = M*N\r\nprint(Area//2)", "m, n = map(int, input().split())\nans = (m * n) // 2\nprint(ans)\n\n\t \t \t \t \t\t\t\t \t \t \t \t \t", "m,n = input().split()\r\ncasillas = int(m)*int(n)\r\np = 0\r\nfinal = 0\r\n\r\n\r\nfor i in range(casillas):\r\n p = p + 2\r\n if p <= int(casillas):\r\n final += 1\r\n elif p == casillas:\r\n print(final)\r\n exit()\r\n elif p > casillas:\r\n print(final)\r\n exit()\r\n", "a,b = [int(x) for x in input().split()]\nprint(int((a*b)/2))\n\t\t\t\t\t \t \t \t \t\t \t \t\t \t\t", "LOCAL=False\r\nif LOCAL:\r\n input_file = open('input.txt')\r\n\r\ndef read():\r\n if LOCAL:\r\n return input_file.readline()\r\n return input()\r\n\r\nM, N = map(int, read().split())\r\nb = M*N\r\nd = 2*1\r\nprint(b//d)\r\n", "M, N = map(int, input().split())\r\nif M % 2 == 0 or N % 2 == 0:\r\n a = (M * N) // 2\r\nelse:\r\n a = (M * N -1) // 2\r\nprint(a)\r\n", "N,M = map(int,input().split())\r\nprint((N*M)//2)", "x, y = input().split()\r\nmax_pieces = (int(x) * int(y)) // 2\r\nprint(max_pieces)", "m, n = map(int, input().split())\r\n\r\nresult = (m * n) // 2\r\n\r\nprint(result)\r\n", "m, n = map(int, input().split())\r\ntotal = int(m*n / 2)\r\nprint(total)", "from math import floor\r\nM,N = input().split()\r\nM = int(M)\r\nN = int(N)\r\nc = (M*N)/2\r\nprint(floor(c))\r\n", "num1, num2 = map(int,input().split())\r\nprint((num1 * num2) // 2)", "def main():\n l, w = input().split()\n area = int(l) * int(w)\n return area//2\n\nprint(main())", "import math\r\nBoard = input().split(\" \")\r\nBoardSize = int(Board[0]) * int(Board[1])\r\nprint(math.floor(BoardSize/2))", "n = input().split(' ')\n\nif int(n[0]) * int(n[1]) % 2 == 0:\n print(int(int(n[0]) * int(n[1]) / 2))\nelse:\n print(int((int(n[0]) * int(n[1]) - 1)/2))\n", "from math import floor\nlst = input().split()\nm = int(lst[0])\nn = int(lst[1])\n\nprint(floor((m*n)/2))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 13 17:19:56 2022\n\n@author: calvinzhu\n\"\"\"\na,b = (input().split(' '))\na = int(a)\nb = int(b)\n\nif a%2==0 or b%2==0:\n print(int(a*b/2))\nelse:\n print(int((a*b-1)/2))\n", "n,k=map(int,input().strip().split())\r\nk=(n*k)//2\r\nprint(k)", "a, b = map(int,input().split())\nprint((a*b) // 2)\n \t \t\t \t\t\t \t \t \t \t\t\t \t", "m,n = map(int,input().split())\r\nprint(m*(n//2) + (m*(n%2))//2)", "n, m = map(int, input().split())\r\nprint (str(n * m // 2))", "a,b = input().split(\" \")\r\nprint((int(a)*int(b))//2)", "x,y=input().split(' ')\r\nm=int(x)\r\nn=int(y)\r\ndef number(a,b):\r\n return int((a*b)/2)\r\nprint(number(m,n))\r\n", "m,n = map(int, input().split())\r\na = m * n // 2 * 2\r\nprint(a//2)", "m,n = map(int,input().split())\r\nif m%2==0:\r\n a = m//2\r\n ans = a*n\r\n print(ans)\r\nelse:\r\n a = m//2\r\n d = a*n\r\n b = n//2\r\n ans = d+b\r\n print(ans)", "l,b=list(map(int,input().strip().split()))\r\nprint((l*b)//2)", "x=input()\r\na=int(x.split()[0])*int(x.split()[1])\r\nprint(a//2)", "m, n=input().split()\nm=int(m)\nn=int(n)\nA=(m*n)/2\nprint(int(A))\n\t\t \t \t\t\t \t \t\t\t \t \t\t\t\t\t\t", "c = [int(x) for x in input().split()]\r\nM = c[0]\r\nN = c[1]\r\nif M == 1 and N == 1:\r\n print(0)\r\nelif M % 2 == 0:\r\n print(int((M/2)*N))\r\nelif N % 2 == 0:\r\n print(int((N/2)*M))\r\nelse:\r\n if N > M:\r\n N -= 1\r\n temp = (N/2)*M\r\n temp += (M-1)/2\r\n print(int(temp))\r\n else:\r\n M -= 1\r\n temp = (M/2)*N\r\n temp += (N-1)/2\r\n print(int(temp))", "M1, N=map(int, input().split())\ntotal_squares=M1 * N\nmax_dominoes=total_squares // 2\n#print\nprint(max_dominoes)\n \t\t \t \t \t\t \t \t \t\t \t\t\t \t\t \t", "list1=list(map(int, input().rstrip().split()))\r\na=list1[0]\r\nb=list1[1]\r\n\r\narea=a*b\r\n\r\nprint(area//2)\r\n", "import math\nimport sys\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\n\nm, n = get_ints()\nprint(math.floor((m*n)/2))\n", "n, k = map(int,input().rstrip().split())\r\nx = n*k\r\nprint(x//2)\r\n\r\n ", "m, n = map(int,input().split(' '))\r\ns = m*n\r\n\r\nif s < 2:\r\n print(0)\r\nelif s >= 2 and s % 2 == 0:\r\n print(int(s/2))\r\nelse:\r\n print(int((s-1)/2))\r\n", "M, N = map(int, input().split())\r\nanswer = M * N // 2\r\nprint(answer)", "MandN = input().split()\r\n\r\nprint(int(int(MandN[0])*int(MandN[1])/2))", "m , n = map(int,input().split(\" \"))\r\na1 = m/2\r\na2 = n/1\r\nprint(int(a1*a2))", "import math\n\nheight, width = input().split(\" \")\nmax_n_dominos = math.floor(int(height) * int(width) / 2)\nprint(max_n_dominos)", "'''\na = int(input())\nif(a % 2 == 0):\n print(\"Mahmoud\")\nelse:\n print(\"Ehab\")\n\nn = int(input())\ni = int(n // 111)\nif n % 111 != 0:\n i += 1\nprint(i * 111)\n\nN, K = map(int, input().split())\nn = K * 2 - 1\nif(n <= N):\n print(\"YES\")\nelse:\n print(\"NO\")\n\nc = input()\nans = str()\nif(c == \"a\"):\n ans = \"vowel\"\nelif(c == \"e\"):\n ans = \"vowel\"\nelif(c == \"i\"):\n ans = \"vowel\"\nelif(c == \"o\"):\n ans = \"vowel\"\nelif(c == \"u\"):\n ans = \"vowel\"\nelse:\n ans = \"consonant\"\nprint(ans)\n\na, b = map(int, input().split())\nans = \"\"\nif(a % 3 == 0):\n ans = \"Possible\"\nelif(b % 3 == 0):\n ans = \"Possible\"\nelif((a + b) % 3 == 0):\n ans = \"Possible\"\nelse:\n ans = \"Impossible\"\nprint(ans)\n\na, b = map(int, input().split())\nans = (a + b) / 2 + 0.5\nprint(int(ans))\n\nA, B, C = map(int, input().split())\nans = max(10 * A + B + C, A + 10 * B + C, A + B + 10 * C)\nprint(ans)\n\nA, D = map(int, input().split())\nans = min((A + 1) * D, A * (D + 1))\nprint(ans)\n\nN = int(input())\nans = N + 1\nif(ans > 12):\n print(ans - 12)\nelse:\n print(ans)\n\nN = int(input())\nprint(N - 1)\n\nN = input()\nans = list(N)\nwhile(ans and N[-1] == \"0\"):\n N.pop()\nif N == N[::-1]:\n print(\"Yes\")\nelse:\n print(\"No\")\n\na, b, c = input().split()\nans = a[0] + b[0] + c[0]\nprint(ans.upper())\n\nname = input()\nprint(\"YES\" if name[::-1] == name else \"NO\")\n\nA, B = map(int, input().split())\nans = max(A, B)\nprint(ans)\n\ns = input()\nans = s[0] + str(len(s) - 2) + s[-1]\nprint(ans)\n\n\ndef isSame(var):\n if(var[0] == var[1] and var[1] == var[2] and var[2] == var[3]):\n return \"SAME\"\n else:\n return \"DIFFERENT\"\n\n\nn = input()\nprint(isSame(n))\n\nm = int(input())\nprint(48 - m)\n\nN = int(input())\nprint((N - 2) * 180)\n\ns = input()\ncnt = 0\nfor i in range(len(s)):\n if(s[i] == 'x'):\n cnt += 1\nprint(\"YES\" if cnt <= 7 else \"NO\")\n\nr = int(input())\nresult = (3 * r)**2\nprint(result)\n\ns = input()\nprint(s.count(\"1\"))\n\na, b = map(int, input().split())\nab = (a - 1) * (b - 1)\nprint(ab)\n\ns = input()\nif (s[0] == s[1] and s[1] == s[2]):\n print(\"Yes\")\nelif (s[1] == s[2] and s[2] == s[3]):\n print(\"Yes\")\nelse:\n print(\"No\")\n\nx, a, b = map(int, input().split())\nda = abs(a - x)\ndb = abs(b - x)\nif(da < db):\n print(\"A\")\nelse:\n print(\"B\")\n\na = int(input())\nb = int(input())\nc = input()\nif(c == \"/\"):\n print(a // b)\nelif(c == \"+\"):\n print(a + b)\nelif(c == \"-\"):\n print(a - b)\nelse:\n print(a * b)\n\nc = input()\nif(c == \"A\"):\n print(\"Vowel\")\nelif(c == \"E\"):\n print(\"Vowel\")\nelif(c == \"I\"):\n print(\"Vowel\")\nelif(c == \"O\"):\n print(\"Vowel\")\nelif(c == \"U\"):\n print(\"Vowel\")\nelse:\n print(\"Consonant\")\n\nt = int(input())\nfor i in range(t):\n a, b, c = map(int, input().split())\n ans = a + b + c\n if(ans == 180):\n print(\"YES\")\n else:\n print(\"NO\")\n\ns = input()\nprint(s.count(\"1\"))\n\nn = int(input())\na = int(input())\nif(n % 500 <= a):\n print(\"Yes\")\nelse:\n print(\"No\")\n\na = input()\nb = input()\nans = len(a) * len(b)\nprint(ans)\n\nW, H = map(int, input().split())\nif(3*W == 4*H):\n print(\"4:3\")\nelse:\n print(\"16:9\")\n\ns1, e1 = map(int, input().split())\ns2, e2 = map(int, input().split())\ns3, e3 = map(int, input().split())\nans = (s1 * e1 + s2 * e2 + s3 * e3) // 10\nprint(ans)\n\nl1, l2, l3 = map(int, input().split())\nif(l1 == l2):\n print(l3)\nelif(l2 == l3):\n print(l1)\nelse:\n print(l2)\n\n\ndef dstring(s):\n return s + s\n\n\ns = input()\n\nprint(dstring(s))\na = [0, 1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1]\nx, y = map(int, input().split())\nprint(\"Yes\" if a[x] == a[y] else \"No\")\n\nA = int(input())\nprint(7 - A)\n\nN, K = map(int, input().split())\nif(N % K == 0):\n print(0)\nelse:\n print(1)\n\nA1, A2, A3 = map(int, input().split())\nans = max(A1, A2, A3) - min(A1, A2, A3)\nprint(ans)\n\na, b, c, d = map(int, input().split())\nif abs(c-a) <= d:\n print(\"Yes\")\nelif abs(b-a) <= d and abs(c-b) <= d:\n print(\"Yes\")\nelse:\n print(\"No\")\n\na, b, x = map(int, input().split())\no = x >= a and x <= a + b\nif(o):\n print(\"YES\")\nelse:\n print(\"NO\")\n\nN = int(input())\nprint(N//3)\n\n\ndef square(var):\n return var**2\n\n\ndef cube(var):\n return var**3\n\n\ndef root(var):\n return var**0.5\n\n\nprint(root(2))\n\n\ndef bubbleSort(a):\n for i in range(len(a)):\n for j in range(len(a)-i-1):\n if a[j] > a[j+1]:\n a[j], a[j+1] = a[j+1], a[j]\n\n\nl = [3, 2, 1, 8, 4]\nbubbleSort(l)\nprint(l)\n\nt = int(input())\nfor i in range(t):\n case = int(input())\n if(case % 4 == 0):\n print(\"Even\")\n elif(case % 2 == 0 and case % 4 != 0):\n print(\"Same\")\n else:\n print(\"Odd\")\n\nK, X = map(int, input().split())\nif(500*K >= X):\n print(\"Yes\")\nelse:\n print(\"No\")\n\nac, test = map(int, input().split())\nif(ac == test):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n\ndef main():\n a, b = input().split()\n if(a < b):\n print(\"<\")\n elif(a == b):\n print(\"=\")\n else:\n print(\">\")\n\n\nif __name__ == \"__main__\":\n main()\n\nN = int(input())\nprint(N * 800 - (N // 15) * 200)\n\nx, a, b = map(int, input().split())\nif(-a + b <= 0):\n print(\"delicious\")\nelif(-a + b <= x):\n print(\"safe\")\nelse:\n print(\"dangerous\")\n\na, b, c = map(int, input().split())\nif(a == (b+c) or b == (c+a) or c == (b+a)):\n print(\"Yes\")\nelse:\n print(\"No\")\n\nd = sorted(list(map(int, input().split())))\nprint(\"YES\" if (d[0] == 1 and d[1] == 4 and d[2] == 7 and d[3] == 9) else \"NO\")\n\na = input()\nprint(len(a) * \"?\")\n\n\nclass Solution:\n def isPalindrome(self, x: int):\n x = str(x)\n if(x[::-1] != x):\n return \"false\"\n elif(\"-\" in x):\n return \"false\"\n else:\n return \"true\"\n\n\nclass Solution:\n def strStr(self, haystack: str, needle: str) -> int:\n if(needle in haystack):\n return haystack.index(needle)\n else:\n return -1\n\n\na = int(input())\nans = a // 2\nprint(ans ** 2)\n\nx, y, z = map(int,input().split())\nprint((y * z - 1) // x)\n\nA,B = map(int,input().split())\nif A == 1:\n A = 14\nif B == 1:\n B = 14\n\nif A>B:\n print(\"Alice\")\nelif B>A:\n print(\"Bob\")\nelse:\n print(\"Draw\")\n\nC = input()\nif(C[0] == C[1] and C[1] == C[2]):\n print(\"Won\")\nelse:\n print(\"Lost\")\n\ns = input()\nif(\"AC\" in s):\n print(\"YES\")\nelse:\n print(\"NO\")\n\na, b, c, d = map(int,input().split())\nteam_a = max(a, b) / min(a,b)\nteam_b = max(c, d) / min(c, d)\nif(team_a > team_b):\n print(\"AOKI\")\nelif(team_a == team_b):\n print(\"DRAW\")\nelse:\n print(\"TAKAHASHI\")\n\nA = int(input())\nB = int(input())\nif(A > B):\n print(\"GREATER\")\nelif(A == B):\n print(\"EQUAL\")\nelse:\n print(\"LESS\")\n\nN,M = map(int,input().split())\nif(M == 2):\n print(1)\nelse:\n print(2)\n\nn = int(input())\nfor i in range(n):\n s = input()\n takahashi = s.count(\"R\")\n aoki = s.count(\"B\")\nif(takahashi == aoki):\n print(\"DRAW\")\nelif(takahashi > aoki):\n print(\"TAKAHASHI\")\nelse:\n print(\"AOKI\")\nA,B,C = map(int,input().split())\nans = A**2 + B**2\nif(C**2 > ans):\n print(\"Yes\")\nelse:\n print(\"No\")\n\nN = int(input())\na = list(map(int,input().split()))\nb= list(map(int,input().split()))\nx=a[0]\ny=b[0]\nfor i in range(1,N):\n x=max(x,a[i])\n y=min(y,b[i])\nprint(max(y-x+1,0))\n\nn = int(input())\nprint(input().count(\"ABC\"))\n\nn = int(input())\ns, t = input().split()\nans = ''\nfor i in range(n):\n ans += s[i]\n ans += t[i]\nprint(ans)\n\nn, x = map(int,input().split())\nprint(x-1 if n - x > x - 1 else n - x)\n\nprint(int(input()) - 1)\n\na, b, c = map(int,input().split())\nl = [a, b, c]\nl = sorted(l)\nif(l[0] == 5 and l[1] == 5 and l[2] == 7):\n print(\"YES\")\nelse:\n print(\"NO\")\n\na, b, c = map(int,input().split())\nans = 0\nif(a <= b):\n print(c // a)\nelse:\n print(c // b)\n\na, b, c = map(int,input().split())\nprint(2 * (a * b + a * c + b * c))\n\ndef push(var, var_2):\n return var.append(var_2)\ndef pop(var):\n if isEmpty(var):\n return False\n else:\n var.pop()\ndef isEmpty(var):\n if not var:\n raise IndexError(\"Index Out Of Range\")\n else:\n return False\n\ndef sort(a):\n for i in range(len(a)):\n for j in range(len(a) - i - 1):\n if(a[j] > a[j + 1]):\n a[j], a[j + 1] = a[j + 1], a[j]\n\ns = input()\nans = s[:4] + \" \" + s[4:]\nprint(ans)\n\ns = input()\nprint(\"Yes\" if s[:4] == \"YAKI\" else \"No\")\n\nt = int(input())\nfor i in range(t):\n m,s = map(int,input().split())\n print(m // s)\n\na, b, c, d = map(int,input().split())\nans = min(a, c) * max(a, c) + min(b, d) * max(b, d)\nprint(ans)\n\nn = int(input())\nif(n%5 == 0 and n%11 != 0 or n%11 == 0 and n%5 != 0):\n print(\"ONE\")\nelif(n%5 == 0 and n%11 == 0):\n print(\"BOTH\")\nelse:\n print(\"NONE\")\n\na = int(input())\nb = int(input())\nc = int(input())\nl = [a, b, c]\nlist.sort(l)\nprint(l[1])\n\nn = int(input())\nif(n%5 == 0 or n%6 == 0):\n print(\"YES\")\nelse:\n print(\"NO\")\n\nn = int(input())\na = map(int,input().split())\na = list(a)\nlist.reverse(a)\na = str(a)\na = a.replace(\"[\",\"\")\na = a.replace(\"]\",\"\")\na = a.replace(\", \",\" \")\nprint(a)\n\nn = int(input())\nprint(n**2, n**2+n)\n\ns = input()\nprint(s.count(\"ZONe\"))\n\nl, r = map(int,input().split())\nfor i in range(l, r + 1):\n if i%2 != 0:\n print(i, end=\" \")\n\nt = int(input())\nfor i in range(t):\n r, b, d = map(int,input().split())\n print(\"YES\" if(min(r, b) * (d + 1) >= max(r, b)) else \"NO\")\n\nclass maths:\n def power(n, m):\n return pow(n, m)\n def square(n):\n return n**2\n def squareRoot(n):\n return n**0.5\n def cube(n):\n return n**3\n\nn, k = map(int,input().split())\nfor i in range(n):\n a = map(int,input().split())\n if(k in a):\n print(1)\n else:\n print(-1)\n\nt = int(input())\nfor i in range(t):\n l, b = map(int,input().split())\n print(l - b)\n\nclass Node:\n def __init__(self, data):\n self.data = data\n self.right = None\n self.left = None\n def insert(self, data):\n if self.data:\n if data < self.data:\n if self.left is None:\n self.left = Node(data)\n else:\n self.left.insert(data)\n elif data > self.data:\n if self.right is None:\n self.right = Node(data)\n else:\n self.right.insert = Node(data)\n else:\n self.data = data\n def display(self):\n if self.left():\n self.left.display()\n print(self.data)\n if self.right():\n self.right.display()\nroot = Node(20)\n\nx, y = map(float,input().split())\nif(x % 5 == 0 and x < y):\n print(y - x - 0.50)\nelse:\n print(y)\n\nl = [1, 2, 3]\ndef reverse(n):\n return l[::-1]\nprint(reverse(l))\n\nn, m = map(int,input().split())\nprint(n*m//2)\n\nx = int(input())\nprint(x // 4)\n\nt = int(input())\nfor i in range(t):\n m, s = map(int,input().split())\n print(m // s)\n\nt = int(input())\nfor i in range(t):\n x, y, z = map(int,input().split())\n l = [x, y, z]\n list.sort(l)\n if(l[0] + l[1] == l[2]):\n print(\"YES\")\n else:\n print(\"NO\")\n\nr = int(input())\nif r>=1 and r<=50:\n print(100)\nelif r>= 51 and r<=100:\n print(50)\nelse:\n print(0)\n\nn = int(input())\nA=[]\nfor i in range(1, n + 1):\n if n%i == 0:\n A.append(i)\nprint(len(A))\nprint(*A)\n\ns = input()\nt = input()\nn = len(s)\nans = 0\nfor i in range(n):\n if s[i] != t[i]:\n ans += 1\nprint(ans)\n\ni = int(input())\ns = input()\nif s[:i//2] == s[i//2:]:\n print(\"Yes\")\nelse:\n print(\"No\")\n\nt = int(input())\nfor i in range(t):\n x, a, b = map(int,input().split())\n ans = (a + (100 - x) * b) * 10\n print(ans)\n\nt = int(input())\nfor i in range(t):\n a, b, c = map(int,input().split())\n s = (a + 1)%c\n if b%c == 0 or b%c == s:\n print(\"YES\")\n else:\n print(\"NO\")\n\nn = int(input())\nif n%100==0:\n print(n // 100)\nelse:\n print(n // 100+1)\n\nn, k = map(int,input().split())\nfor i in range(k):\n if n%200 == 0:\n n = n // 200\n else:\n n = str(n) + \"200\"\n n = int(n)\nprint(n)\n\nh1, m1, h2, m2, k = map(int,input().split())\nprint(60 * (h2 - h1) + m2 - m1 - k)\n\nn = int(input())\nans = pow(10, n)\nprint(ans + 7)\n\nu, l = input().split()\nif l == u.lower() and u == l.upper():\n print(\"Yes\")\nelse:\n print(\"No\")\n\ns = input()\nprint(s.replace(\"Left\", \"<\").replace(\"Right\", \">\").replace(\"AtCoder\", \"A\"))\n\nn = int(input())\nprint((9 / 5 * n) + 32)\n\nn = int(input())\nprint(\"Blue\" if n%2 == 0 else \"Red\")\n\nx = input()\ns = input()\nprint(s.replace(x, \"\"))\n\ns = input()\nans = s[0].upper() + s[1:].lower()\nprint(ans)\n\na, b = map(int,input().split())\nans = a * (max(a, b) + min(a, b)) * b\nif ans >= 1:\n print(\"Positive\")\nelif ans == 0:\n print(\"Zero\")\nelse:\n print(\"Negative\")\n\nn = int(input())\nb = []\nfor i in range(n):\n a = int(input())\n b.append(a)\nprint(min(b))\n\nt = input()\ns = input()\nif t[::-1] == s:\n print(\"YES\")\nelse:\n print(\"NO\")\n\nn = int(input())\na = list(map(int,input().split()))\nlist.sort(a)\nprint(*a)\n\na, b = map(int,input().split())\nans = str(a) + str(b)\nans = int(ans)\nc = ans**0.5\nc = int(c)\nif c**2 == ans:\n print(\"Yes\")\nelse:\n print(\"No\")\n\ns = input()\nsum_s = sum(int(i) for i in s)\nprint(\"Yes\" if int(s) % sum_s == 0 else \"No\")\n\ns = input()\nn = \"\"\nfor i in range(len(s)):\n if i % 2 == 0:\n n = n + s[i]\nprint(n)\n\nprint(input().replace(\"4\", \"5\"))\n\nn = int(input())\na = list(map(int,input().split()))\nprint(abs(max(a) - min(a)))\n\narr = [1, 2, 6, 78]\nfor i in range(len(arr)):\n print(arr[i])\n\nn=int(input())\nS=[]\nfor i in range(n):\n x,y=input().split()\n S.append([int(y),x])\nS.sort()\nprint(S[-2][1])\n\nn = int(input())\nans = n**0.5\nans = int(ans)\nprint(ans**2)\n\nwhile True:\n n = int(input())\n if n == 42:\n break\n print(n)\n\na, b, c = map(int,input().split())\na, b = b, a\na = a*c\nb = c+b\nprint(a, b)\n\na, b, c = map(int,input().split())\nprint(21-a-b-c)\n\ns = input()\ns = s[::-1]\nans=\"\"\nfor ele in s:\n if ele==\"9\":\n ans+=\"6\"\n elif ele==\"6\":\n ans+=\"9\"\n else:\n ans+=ele\nprint(ans)\n\na, b, k = map(int,input().split())\nans = \"b\"*(b//2) + \"a\"*a + \"b\"*(b//2)\ntotal = \"b\"*b + \"a\"*a\nif len(ans) <= 32:\n print(ans)\nelse:\n print(total)\n\nn, a, b = map(int,input().split())\nprint(n-a+b)\n\nn = int(input())\nif n%2 == 0:\n print(\"White\")\nelse:\n print(\"Black\")\n\nn = int(input())\nprint(n)\n\nn = int(input())\nif n%6 == 0 or n%5 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\ns = input()\ni = len(s) - 2\nif s[i] == \"7\":\n print(1)\nelse:\n print(0)\n\nn = int(input())\nl = list(map(int,input().split()))\nprint(*l[::-1])\n\nn, k = map(int,input().split())\na = list(map(int,input().split()))\nif k in a:\n print(1)\nelse:\n print(-1)\n\nn = int(input())\nif n%3 == 0 and n%2 != 0:\n print(1)\nelif n%2 == 0 and n%3 == 0:\n print(0)\nelse:\n print(-1)\n\na = int(input())\nb = int(input())\nc = int(input())\nl = []\nl.append(a)\nl.append(b)\nl.append(c)\nl.sort()\nprint(l[1])\n\nn = input()\nif n[::-1] == n:\n print(\"YES\")\nelse:\n print(\"NO\")\n\nfrom math import gcd\na, b = map(int,input().split())\ndef lcm(a,b):\n return (a // gcd(a,b))* b\nprint(gcd(a, b), lcm(a, b))\n\ns = input()\nl = []\nfor ele in s:\n l.append(int(ele))\n ans = sum(l)\ns = int(s)\nif s%ans == 0:\n print(\"Yes\")\nelse:\n print(\"No\")\n\ndef binarySearch(a, low, high, key):\n while low<=high:\n mid = (low+high)//2\n if a[mid]<key:\n low=mid+1\n elif a[mid]>key:\n high=mid-1\n else:\n return mid\n return -1\na = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\nprint(binarySearch(a, 0, 9, 10))\n\ndef selectionSort(a, n):\n minimum = 0\n for i in range(n-1):\n minimum = i\n for j in range(i+1, n):\n if(a[j] < a[minimum]):\n minimum = j\n a[minimum], a[i] = a[i], a[minimum]\narr = [9, 3, 6, 1]\nn = len(arr)\nselectionSort(arr, n)\nprint(arr)\n\ns = input()\nans = \"\"\nfor ele in s:\n if ele.isupper():\n ans+=ele.replace(ele.upper(), ele.lower())\n else:\n ans+=ele.replace(ele.lower(), ele.upper())\nprint(ans)\n\nn, m = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\nprint(sum(a[:m]))\n\na, b, c = map(int,input().split())\nif a == c:\n print(b)\nelif a == b:\n print(c)\nelif b == c:\n print(a)\nelse:\n print(0)\n\nl = []\nn, m = map(int,input().split())\nfor i in range(n, m+1):\n if i%2 != 0:\n l.append(i)\nprint(*l)\n\nimport math\nt=int(input())\nfor i in range(t):\n n = int(input())\n print(math.factorial(n))\n\nt = int(input())\nfor i in range(t):\n s = input()\n print(int(s[0]) + int(s[-1]))\n\nt = int(input())\nl = []\nfor i in range(t):\n n = int(input())\n l.append(n)\n l.sort()\nfor j in range(len(l)):\n print(l[j])\n\nt = int(input())\nl = []\nfor i in range(t):\n n = int(input())\n l.append(n)\n l.sort()\ns = f\"{l}\"\ns = s.replace(\"[\", \"\")\ns = s.replace(\"]\", \"\")\ns = s.replace(\",\", \"\")\ns = s.replace(\" \", \"\\n\")\nprint(s)\n\nt = int(input())\nfor i in range(t):\n s = input()\n print(s.count(\"4\"))\n\nt = int(input())\nfor i in range(t):\n n = int(input())\n print(int(n**0.5))\n\nt = int(input())\nfor i in range(t):\n n = int(input())\n if n<10:\n print(\"Thanks for helping Chef!\")\n else:\n print(-1)\n\nt = int(input())\ns = input().split()\nlst1 = []\nlst2 = []\nfor ele in s:\n ele = int(ele)\n if ele%2 == 0:\n lst1.append(ele)\n else:\n lst2.append(ele)\nif len(lst1) > len(lst2):\n print(\"READY FOR BATTLE\")\nelse:\n print(\"NOT READY\")\n\nt = int(input())\nfor i in range(t):\n s = input()\n print(\"wins\" if s[::-1] == s else \"loses\")\n\nn1 = int(input())\nn2 = int(input())\nif n1 > n2:\n print(n1-n2)\nelse:\n print(n1+n2)\n\nt = int(input())\nfor i in range(t):\n s = input().upper()\n if s == \"B\":\n print(\"BattleShip\")\n elif s == \"C\":\n print(\"Cruiser\")\n elif s == \"D\":\n print(\"Destroyer\")\n else:\n print(\"Frigate\")\n\nfrom math import gcd\nt = int(input())\nfor i in range(t):\n a, b = map(int,input().split())\n def lcm(a,b):\n return (a // gcd(a,b))* b\n print(gcd(a, b), lcm(a, b))\n\ns = input()\nl = len(s)\nprint(l if l <= 3 else \"More than 3 digits\")\n\nt = int(input())\nfor _ in range(t):\n l = [2010, 2015, 2016, 2017, 2019]\n n = int(input())\n if n in l:\n ans = \"HOSTED\"\n else:\n ans = \"NOT HOSTED\"\n print(ans)\n\nt = int(input())\nfor i in range(t):\n x, x2, xa, xb = map(int,input().split())\n ans = xa // x\n ans2 = xb // x2\n print(ans+ans2)\n\nt = int(input())\nl = []\nans = 0\nfor _ in range(t):\n a = input().split()\n ans = a.count(\"1\")\n if ans == 0:\n print(\"Beginner\")\n elif ans == 1:\n print(\"Junior Developer\")\n elif ans == 2:\n print(\"Middle Developer\")\n elif ans == 3:\n print(\"Senior Developer\")\n elif ans == 4:\n print(\"Hacker\")\n else:\n print(\"Jeff Dean\")\n\nt = int(input())\nfor _ in range(t):\n ans = 0\n D, d, P, Q = map(int,input().split())\n for i in range(D):\n ans+=(P+(i//d)*Q)\n print(ans)\n\nt = int(input())\nl = []\nk = []\nh = []\nfor _ in range(t):\n n, m = map(int,input().split())\n\nt = int(input())\nfor i in range(t):\n n, m = map(int,input().split())\n s = input()\n if s.count(\"**\") >= 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\nt = int(input())\nfor i in range(t):\n a, b, c = map(int,input().split())\n n = a*b\n m = b+c\n k = min(a*b, a+c)\n l = a*b\n o = b+c\n print(min(n, m, k, l, o))\n\na = int(input())\nb, c = map(int,input().split())\ns = input()\nprint(a+b+c, s)\n\nx, y = map(int,input().split())\nprint(x if x == y else 3-x-y)\n\nn = int(input())\nA = list(map(int,input().split()))\nans = 0\nfor a in A:\n if a>10:\n ans += a - 10\nprint(ans)\n\nn, k = map(int,input().split())\nans = 0\nfor i in range(1, n+1):\n for j in range(1, k+1):\n ans += 100*i + j\nprint(ans)\n\ndef push(a, n):\n a.append(n)\ndef pop(a):\n if isEmpty(a):\n return False\n else:\n a.pop()\ndef isEmpty(n):\n if not n:\n return True\n else:\n return False\ndef top(n):\n return n[0]\ndef isFull(m):\n if len(m)>=1:\n return True\n else:\n return False\n\nt = int(input())\nl = []\nfor i in range(t):\n r, n = input().split()\n l.append([n])\nc = int(input())\nfor j in range(c):\n b = int(input())\n print(l[b-1][0])\n\na = int(input())\nb = int(input())\nc = str(a-b)\nd = str(a*b)\ne = str(a+b)\nans = c+d+e\nprint(ans)\n\nn = int(input())\ns = input().split()\nl = []\ncnt = ''\nfor i in range(len(s)):\n ans = s[i]\n d = ans[-1]\n cnt += d\nprint(\"Yes\" if int(cnt)%10 == 0 else \"No\")\n\nt = int(input())\nl = []\nfor i in range(t):\n a, b = map(int,input().split())\n cnt = 0\n if a > b:\n cnt = a-b\n else:\n cnt = b-a\n l.append(cnt)\nans = max(l)\nidx = l.index(ans)\nprint(idx+1, ans)\n\na = list(map(int,input().split()))\nk = int(input())\nl = []\nfor i in range(len(a)):\n if a[i] == k:\n pass\n else:\n l.append(a[i])\nprint(len(l), l)\n\nn = int(input())\ndef solve(n):\n if n%2 == 0 and n>2:\n return \"YES\"\n else:\n return \"NO\"\nprint(solve(n))\n\nt = int(input())\nfor _ in range(t):\n s = input()\n def solve(s):\n ans = ''\n if len(s) > 10:\n ans = s[0] + str(len(s)-2) + s[-1]\n return ans\n return s\n print(solve(s))\n'''\na, b = map(int,input().split())\nprint((a*b)//2)", "x = list(map(int,input().split()))\r\nt = x[0]*x[1]\r\nprint(t//2)", "m,n = map(int,input().split())\r\ntotal_dominios=(m*n)//2\r\nprint(total_dominios)", "m_and_n = list(map(int, input().split()))\r\nprint(((m_and_n[0])*(m_and_n[1]))//2)\r\n", "M,N=map(int,input().split())\r\nmax_dominoes=(M*N)//2\r\nprint(max_dominoes)", "a, b = map(int, input().split())\r\nresult = (a*b)//2\r\nprint(result)\r\n", "def countDominos():\r\n nums = input()\r\n ints = [int(i) for i in nums.split()]\r\n m = ints[0]\r\n n = ints[1]\r\n area = n * m\r\n dominosCount = area / 2\r\n print(int(dominosCount))\r\n\r\n\r\ncountDominos()\r\n", "from math import floor\n\na, b = input().split()\na, b = map(int, [a,b])\n\nprint(floor(a*b*0.5))", "def solve(m,n):\r\n tot=m*n\r\n maximum=tot//2\r\n return maximum\r\nm,n=map(int,input().split())\r\nres=solve(m,n)\r\nprint(res)", "M, N = map(int, input().split())\r\n\r\n# Find the maximum number of dominoes that can be placed on the board\r\nmax_dominoes = (M * N) // 2\r\n\r\nprint(max_dominoes)\r\n", "a= input()\r\na1= a.split( )\r\narea = int(a1[0])*int(a1[1])\r\nnum= area//2\r\nprint(num)", "m, n = map(int, input().split())\r\nsquare = m*n\r\nprint(square//2)", "m,n=map(int,input().split())\r\nq=m*n\r\nif q%2==0:\r\n print(q//2)\r\nelse:\r\n print((q-1)//2)\r\n", "m,n=map(int,input().split())\r\nupper=m*n\r\nlower=2\r\nc=int(upper/lower)\r\nprint(c)\r\n\r\n", "package= input().split()\r\nnum,num2=int(package[0]),int( package[1])\r\nresult = num * num2//2\r\n\r\nprint(result)\r\n", "inp=input()\r\nM,N=inp.split(\" \")\r\nnumbers=int(M)*int(N)/2\r\nprint(int(numbers))", "#Each 2 x 1 domino covers 2 squares\r\n#No domino covers the same 1 or 2 squares\r\n#edges are allowed\r\n\r\nboard_dimension = input().split(' ')\r\n#output max # of dominoes that can be placed\r\n\r\n\r\n#area of board/2\r\nprint(int((int(board_dimension[0])*int(board_dimension[1]))/2))\r\n\r\n\r\n\"\"\"\r\n2x2 --> max of 2 \r\n[d2 d1] \r\n[d2 d1]\r\n\r\n\r\n3 x 2 --> max of 3\r\n[d1 d2]\r\n[d1 d2]\r\n[d3 d3]\r\n\r\n2 x 3 --> max of 3\r\n[d1 d2 d3]\r\n[d1 d2 d3]\r\n\r\n2 x 4 --> max of 4\r\n\r\n[d1 d2 d3 d4]\r\n[d1 d2 d3 d4]\r\n\r\n\r\n\r\n3 x 3 --> max of 4\r\n\r\n[d1 d1 d2]\r\n[d3 d3 d2]\r\n[d4 d4 ]\r\n\r\nboard = [[0]*int(board_dimension[1])]*int(board_dimension[0])\r\nprint(board)\r\nmax_dom = 0\r\n\r\nfor c in range(int(board_dimension[1])-1):\r\n for r in range(int(board_dimension[0])-1):\r\n if board_dimension[c][r] == 0 and board_dimension[c+1][r] == 0:\r\n max_dom +=1\r\n board_dimension[c][r] == 1\r\n board_dimension[c+1][r] == 1\r\n \r\n elif board_dimension[c][r] == 0 and board_dimension[c][r+1] == 0:\r\n max_dom +=1\r\n board_dimension[c][r] == 1\r\n board_dimension[c][r+1] == 1\r\n \r\n \r\nprint(max_dom)\r\n\"\"\"\r\n", "board_size = input().split(' ')\r\nm = int(board_size[0])\r\nn = int(board_size[1])\r\nprint(int((m*n-(m*n)%2)/2))", "f=input()\r\nN,M=f.split()\r\nS=int(M)*int(N)\r\nP=S//2\r\nprint(P)\r\n", "a,b=list(map(int,input().split()))\r\nfinal=a*b/2\r\nprint(int(final))", "n,m=map(int,input().split())\r\nk=n*m\r\np=k//2\r\nprint(p)", "m,n= map(int,input().split())\r\ns=m*n//2\r\nprint(s)", "x = str(input())\r\nx = x.split(' ')\r\n\r\nM = int(x[0])\r\nN = int(x[1])\r\n\r\ncount = M*N\r\nout = N*M // 2\r\nprint(out)", "m=(input()).split()\r\nprint(int(m[0])*int(m[1])//2)", "x = list(map(int, input().split()))\r\nproiz = x[0] * x[1]\r\nans = proiz // 2\r\nprint(ans)", "from math import floor\r\na,b=map(int,input().split( ))\r\nprint(floor(a*b//2))", "m,n = input().split()\nm=int(m)\nn=int(n)\nif m%2==0 or n%2==0:\n i=m*n/2 \nelse: \n i=(m*n-1)/2\ni=int(i)\nprint(i) \n\n", "M, Q = map(int, input().split())\n\ntotal_squares = M * Q\n\nmaxdominoes = total_squares // 2\n\nprint(maxdominoes)\n\n \t \t\t \t \t\t\t\t\t\t \t\t \t \t", "a, b = map(int, input().split())\r\nc = (a*b)// 2\r\nprint(c)", "a,b=map(int,input().split())\r\nx=a*b\r\nprint(int(x/2))\r\n", "string = input()\r\n\r\nspace = string.index(\" \")\r\n\r\nm = int(string[0:space])\r\nn = int(string[space+1:len(string)])\r\n\r\nsolution = m*n//2\r\nprint(solution)\r\n", "n,m=map(int,input().split())\r\nans=n*(int)(m/2)\r\nans+=(m%2)*(int)(n/2)\r\nprint(int(ans))", "def demo(m,n):\n\ta=(m*n)//2\n\tprint(a)\ni,j=map(int,input().split())\ndemo(i,j)\n \t\t\t\t\t \t \t\t \t \t \t\t\t\t\t \t\t\t\t\t\t", "x,y=map(int,input().split())\r\nif x>y:\r\n x,y=y,x\r\nif y<1 or x<1:\r\n print(0)\r\nelse:\r\n k=0\r\n if x==1:\r\n s=y//2\r\n else:\r\n s=y*(x//2)\r\n k=x%2\r\n if k>0:\r\n s=s+y//2\r\n \r\n print(s)\r\n", "import math\r\nN,M=map(int,input().split())\r\nx=(int(N)*int(M))/2\r\nnoofsquares=math.floor(x)\r\nprint(noofsquares)", "m,n=map(int,input().split())\r\nk = n*(m/2)\r\nprint(int(k))", "x,y=map(int,input().split())\r\n\nblk=x*y/2\r\n\nprint(int(blk))", "# Арбуз\r\n# w = int(input())\r\n# if w%2==0:\r\n# flag=0\r\n# for i in range(1,w//2+1):\r\n# if i%2==0:\r\n# flag=1\r\n# if flag==1:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# Слова\r\n# a = int(input())\r\n# array = []\r\n# for i in range(0,a):\r\n# word = input()\r\n# if len(word)>10:\r\n# array.append(word[0]+str(len(word)-2)+word[len(word)-1])\r\n# else:\r\n# array.append(word)\r\n# for i in array:\r\n# print(i)\r\n\r\ndata = str(input())\r\nM = int(data.split(' ')[0])\r\nN = int(data.split(' ')[1])\r\nif (M%2==0):\r\n print(M//2*N)\r\nelse:\r\n if N%2==0:\r\n print(N//2*M)\r\n else:\r\n print((M-1)//2*N + (N-1)//2)\r\n\r\n\r\n", "import math\r\na,b = map(int,input().split(\" \"))\r\nx = a*b\r\nif x%2 == 0:\r\n y = x/2\r\nelse:\r\n y = (x/2)-1\r\n y=math.ceil(y)\r\nprint(int(y)) \r\n\r\n", "m,n = list(map(int, input().split()))\r\nmn = (m*n)//2\r\nprint(mn)\r\n", "m,n=map(int,input().split())\nif m%2==0:\n\tprint((m//2)*n)\nelse:\n\tprint((m//2)*n+(n//2))\n\t \t \t\t \t \t\t\t\t \t \t\t \t \t\t\t \t\t", "nm = input().split()\r\nnm = list(map(int,nm))\r\n\r\nz = nm[0] * nm[1]\r\n\r\nprint(int(z / 2))\r\n", "boardSize = input().split()\r\nrows = int(boardSize[0])\r\ncols = int(boardSize[1])\r\nprint(int(rows * cols) // 2)\r\n\r\n", "n, m = [int(item) for item in input().split(' ')]\r\nprint(n * m // 2)", "m , n = map(int , input().split())\r\nprint((m * n) // 2)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nprint(n*m//2)", "lst = list (map (int, input().split()))\r\narea = lst[0]*lst[1]\r\nprint (int(area/2))", "m, n = input().split()\nprint(int(int(m)*int(n)/2))\n\n", "a=input()\r\nb=a.split()\r\nm=int(b[0])\r\nn=int(b[-1])\r\nc=int(m/2)\r\nd=m%2\r\nif d>=1:\r\n e=int(n/2)\r\n \r\nelse:\r\n e=0\r\nf=(n*c)+e\r\nprint(f) ", "x, y = input().split(\" \")\r\nx = int(x)\r\ny = int(y)\r\n\r\noutput = x * y / 2\r\n\r\nprint(int(output))\r\n", "l=list(map(int, input().split()))\r\nx=l[0]*l[1]\r\nif x%2==0:\r\n print(int(x/2))\r\nelse:\r\n print(int((x-1)/2))", "board = input().split()\nm = int(board[0])\nn = int(board[1])\nif m*n % 2 == 0:\n print(round(m*n/2))\nelse:\n print(round((m*n-1)/2))\n", "s=input()\r\n\r\ns=s.split(\" \")\r\n\r\nm=int(s[0])\r\nn=int(s[1])\r\n\r\nk = m*n\r\n\r\nif(k%2==1):\r\n k-=1\r\n\r\nk/=2\r\n\r\nprint(int(k))", "def dominoPiling():\r\n measurements= tuple(input().split())\r\n (a, b) = measurements\r\n a = int(a)\r\n b = int(b)\r\n area = a * b\r\n return area//2\r\n\r\n\r\nprint(dominoPiling())", "m, n = list(map(int, input().split()))\r\narea = (m * n)\r\nmaxima = area//2\r\nprint(maxima)", "m,n=map(int,input().split())\r\nd=m*n\r\ns=0\r\nwhile(d>0):\r\n if d%2==0:\r\n s+=1\r\n d-=1\r\nprint(s) ", "s = input().split()\r\nk = 0\r\nif int(s[0]) * int(s[1]) % 2 == 0:\r\n k = (int(s[0]) * int(s[1])) / 2\r\nelse:\r\n k = ((int(s[0]) * int(s[1])) - 1) / 2\r\nprint(int(k))", "s = input()\r\nll = s.split()\r\n\r\nm = int(ll[0])\r\nn = int(ll[1])\r\n\r\nprint(int( (m*n)/2 )) ", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\nz=x*y\r\nif z%2==0:\r\n print(z//2)\r\nelse:\r\n print((z-1)//2)", "m, n = map(int, input().split())\r\nprint((m * n) // 2 if (m * n) % 2 == 0 else ((m * n) - 1) // 2)\r\n\r\n\r\n", "# code force file\r\n\r\ndef main():\r\n mn = input().split()\r\n m_n = [int(i) for i in mn]\r\n s = m_n[0] * m_n[1]\r\n print(s // 2)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys,math,time\r\nfrom collections import Counter\r\nfrom itertools import combinations,permutations\r\ninput = sys.stdin.readline\r\n'''\r\nbegin=time.time()\r\nend=time.time()\r\nprint(format(end-begin,\".7f\"))\r\n'''\r\n'''\r\nd={} d.keys d.values\r\nd=dict(Counter(data)) # {'l': 3, 'o': 2, 'h': 1, 'e': 1, ' ': 1, 'w': 1, 'r': 1, 'd': 1}\r\nk=Counter('hello world').most_common(1) # [('l', 3)]\r\nsort()\r\n'''\r\n'''\r\ndata=list(map(int,input().rstrip().split()))\r\ndata=map(int,input().rstrip().split())\r\ndata=list(input().rstrip())\r\ndata=[list(map(int,input().rstrip().split())) for _ in range(100)]\r\ndata=[int(input().rstrip()) for _ in range(100)]\r\ndata=input().rstrip()\r\ndata=[input().rstrip() for _ in range(n)]\r\n\r\nfor _ in range(int(input())):\r\n'''\r\nm,n=map(int,input().rstrip().split())\r\nres=0\r\nif m%2==0:\r\n res=n*(m//2)\r\nelse:\r\n res=(m//2)*n +(n//2)\r\nprint(res)", "a = input().split(' ')\r\nm = int(a[0]) * int(a[1])\r\nprint(m // 2)", "a, b = map(int, input().split())\nl = a * b\nprint(l // 2)\n#DF\n \t\t\t \t\t \t\t \t \t \t \t\t \t\t\t\t", "m,n=map(int,input().split())\r\nif m<2 and n<2:\r\n print(0)\r\nelif(m*n)%2==0:\r\n print(m*n//2)\r\nelse:\r\n print((m*n-1)//2)", "a,b=map(int,input().split())\r\nprint(int([a*b/2,(a*b-1)/2][a%2==1 and b%2==1]))", "a = input()\na = a.split()\nprint((int(a[0]) * int(a[1]))//2)", "a, b = input().split()\r\nprint(int(a)*int(b)//2)\r\n", "n,m = input().split()\nn = int(n)\nm = int(m)\nA = n*m/2\nif m%2 == 1:\n A = n*(int(m/2))+int(n/2)\nprint(int(A))\n\t\t\t \t \t \t\t\t\t\t\t \t\t\t\t\t \t\t", "M,N=map(int,input().split())\r\nM=M*N\r\nM=M/2\r\nprint(int(M))\r\n", "m,n = map(int,input().split())\r\ndominos = int((m*n)/2)\r\nprint(dominos)", "a,b=map(int,input().split())\r\nif a<=b and b<=16:\r\n print(a*b//2)", "# -*- coding: utf-8 -*-\n\"\"\"Problema 5 - Domino Piling.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1vRUYoSG6eFklWmBmy5bxfB46kdx7X0BJ\n\"\"\"\n\ndimensionesTablero = input()\nnumeroDeDominos = 0\n\nlistaDeDigitos = [int(s) for s in dimensionesTablero.split() if s.isdigit()]\n\nm = int(listaDeDigitos[0])\nn = int(listaDeDigitos[1])\n\nnumeroDeDominos = (m * n) // 2\n\nprint(numeroDeDominos)", "a, b = [int(x) for x in input().split()]\r\nprint((a * b) // 2)", "M,N = map(int,input().split())\r\nA = M*N\r\na = int(2)\r\nresult = int(A//a)\r\nprint(result)", "M, N = [int(j) for j in input().split()]\nif M % 2 == 0 or N % 2 == 0:\n print(M * N // 2)\nelse:\n print((M * N - 1) // 2)\n \n", "def max_dominos(M, N):\r\n return (M * N) // 2\r\n\r\nM, N = map(int, input(\"\").split())\r\n\r\nprint(max_dominos(M, N))\r\n", "m, n = map(int, input().split())\narea = ((m * n) - (m * n) % 2) // 2\n\nprint(area)\n", "def Domino_Piling(x):\r\n x = x.split(\" \")\r\n a = int(int(x[0])*int(x[1])/2)\r\n return a\r\nprint(Domino_Piling(input()))", "n = list(map(int, input().split()))\r\n\r\nboard = n[0] * n[1]\r\n\r\nreminder = board % 2\r\n\r\nresult = (board-reminder) // 2\r\n\r\nprint(result)\r\n", "def maximal_number_of_dominoes(m, n):\n return min(m, n) * max(m, n) // 2\n\nm, n = map(int, input().split())\nprint(maximal_number_of_dominoes(m, n))\n", "# domino piling\r\ndef get_int(): return map(int, input().strip().split())\r\ndef get_ints(): return list(map(int, input().strip().split()))\r\n\r\nm,n = get_int()\r\n\r\nprint(int((m*n)/2))", "firstline = input()\r\nfirstlinehelper = firstline.split()\r\n\r\nm = int(firstlinehelper[0])\r\nn = int(firstlinehelper[1])\r\n\r\nif m % 2 == 0:\r\n print(int((m/2) * n))\r\nelse:\r\n m = m-1\r\n print(int(((m / 2) * n) + n // 2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "board = list(map(int, input().split()))\r\nanswer = (board[0]*board[1]) // 2\r\nprint(answer)\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[55]:\n\n\nm, n=map(int, input().split())\nk=0\n\n \nif m<2 and n<0:\n print(0)\nelse:\n if m>=n:\n if m%2!=0:\n k=int(m/2)*n+int(n/2)\n \n else:\n k=int(m/2)*n\n\n else:\n if n%2!=0:\n k=int(n/2)*m+int(m/2)\n else:\n k=int(n/2)*m\nprint(int(k))\n \n \n\n\n# In[ ]:\n\n\n\n\n", "#2300011786\r\nN,M=map(int,input().split())\r\nif N%2==0 or M%2==0:\r\n num=int(N*M/2)\r\nelse:\r\n num=int((M-1)*N/2+(N-1)/2)\r\nprint(num)", "import math\r\nstring = input()\r\nmy_list = string.split(\" \")\r\nx = int(my_list[0])\r\ny = int(my_list[1])\r\nprint(math.floor((x * y) / 2))", "\r\nm, n = map(int, input().split())\r\n\r\ntotal_squares = m * n\r\n\r\nmax_dominoes = total_squares // 2\r\n\r\nprint(max_dominoes)\r\n\r\n\r\n\r\n\r\n\r\n", "'''he was imagining things, which he had never hoped before, because he\r\ndidn't approve of imagination.\r\nAs he pulled into the driveway of number four, the first thing he saw --\r\nand it didn't improve his mood -- was the tabby cat he'd spotted that\r\nmorning. It was now sitting on his garden wall. He was sure it was the\r\nsame one; it had the same markings around its eyes.\r\n\"Shoo!\" said Mr. Dursley loudly. The cat didn't move. It just gave him a\r\nstern look. Was this normal cat behavior? Mr. Dursley wondered. Trying\r\nto pull himself together, he let himself into the house. He was still\r\ndetermined not to mention anything to his wife.\r\nMrs. Dursley had had a nice, normal day. She told him over dinner all\r\nabout Mrs. Next Door's problems with her daughter and how Dudley had\r\nlearned a new word (\"Won't!\"). Mr. Dursley tried to act normally. When\r\nDudley had been put to bed, he went into the living room in time to\r\ncatch the last report on the evening news:\r\n\"And finally, bird-watchers everywhere have reported that the nation's\r\nowls have been behaving very unusually today. Although owls normally\r\nhunt at night and are hardly ever seen in daylight, there have been\r\nhundreds of sightings of these birds flying in every direction since\r\nsunrise. Experts are unable to explain why the owls have suddenly\r\nchanged their sleeping pattern.\" The newscaster allowed himself a grin.\r\n\"Most mysterious. And now, over to Jim McGuffin with the weather. Going\r\nto be any more showers of owls tonight, Jim?\"\r\n\"Well, Ted,\" said the weatherman, \"I don't know about that, but it's not\r\nonly the owls that have been acting oddly today. Viewers as far apart as\r\nKent, Yorkshire, and Dundee have been phoning in to tell me that instead\r\nof the rain I promised yesterday, they've had a downpour of shooting\r\nstars! Perhaps people have been celebrating Bonfire Night early -- it's\r\nnot until next week, folks! But I can promise a wet night tonight.\"\r\nMr. Dursley sat frozen in his armchair. Shooting stars all over Britain?\r\nOwls flying by daylight? Mysterious people in cloaks all over the place?\r\nAnd a whisper, a whisper about the Potters...\r\nMrs. Dursley came into the living room carrying two cups of tea. It was\r\nno good. He'd have to say something to her. He cleared his throat\r\nnervously. \"Er -- Petunia, dear -- you haven't heard from your sister\r\nlately, have you?\"'''\r\nn,m=map(int,input().split())\r\n'''really has gone, Dumbledore?\"\r\n\"It certainly seems so,\" said Dumbledore. \"We have much to be thankful\r\nfor. Would you care for a lemon drop?\"\r\n\"A what?\"\r\n\"A lemon drop. They're a kind of Muggle sweet I'm rather fond of\"\r\n\"No, thank you,\" said Professor McGonagall coldly, as though she didn't\r\nthink this was the moment for lemon drops. \"As I say, even if\r\nYou-Know-Who has gone -\"\r\n\"My dear Professor, surely a sensible person like yourself can call him\r\nby his name? All this 'You- Know-Who' nonsense -- for eleven years I\r\nhave been trying to persuade people to call him by his proper name:\r\nVoldemort.\" Professor McGonagall flinched, but Dumbledore, who was\r\nunsticking two lemon drops, seemed not to notice. \"It all gets so\r\nconfusing if we keep saying 'You-Know-Who.' I have never seen any reason\r\nto be frightened of saying Voldemort's name.\r\n\"I know you haven 't, said Professor McGonagall, sounding half\r\nexasperated, half admiring. \"But you're different. Everyone knows you're\r\nthe only one You-Know- oh, all right, Voldemort, was frightened of.\"\r\n\"You flatter me,\" said Dumbledore calmly. \"Voldemort had powers I will\r\nnever have.\"\r\n\"Only because you're too -- well -- noble to use them.\"\r\n\"It's lucky it's dark. I haven't blushed so much since Madam Pomfrey\r\ntold me she liked my new earmuffs.\"\r\nProfessor McGonagall shot a sharp look at Dumbledore and said, \"The owls\r\nare nothing next to the rumors that are flying around. You know what\r\neveryone's saying? About why he's disappeared? About what finally\r\nstopped him?\"\r\nIt seemed that Professor McGonagall had reached the point she was most\r\nanxious to discuss, the real reason she had been waiting on a cold, hard\r\nwall all day, for neither as a cat nor as a woman had she fixed\r\nDumbledore with such a piercing stare as she did now. It was plain that\r\nwhatever \"everyone\" was saying, she was not going to believe it until\r\nDumbledore told her it was true. Dumbledore, however, was choosing\r\nanother lemon drop and did not answer.\r\n\"What they're saying,\" she pressed on, \"is that last night Voldemort\r\nturned up in Godric's Hollow. He went to find the Potters. The rumor is\r\nthat Lily and James Potter are -- are -- that they're -- dead. \"\r\nDumbledore bowed his head. Professor McGonagall gasped.\r\n\"Lily and James... I can't believe it... I didn't want to believe it...\r\nOh, Albus...\"\r\nDumbledore reached out and patted her on the shoulder. \"I know... I\r\nknow...\" he said heavily.\r\nProfessor McGonagall's voice trembled as she went on. \"That's not all.\r\nThey're saying he tried to kill the Potter's son, Harry. But -- he\r\ncouldn't. He couldn't kill that little boy. No one knows why, or how,\r\nbut they're saying that when he couldn't kill Harry Potter, Voldemort's\r\npower somehow broke -- and that's why he's gone.\r\nDumbledore nodded glumly.\r\n\"It's -- it's true?\" faltered Professor McGonagall. \"After all he's\r\ndone... all the people he's killed... he couldn't kill a little boy?\r\nIt's just astounding... of all the things to stop him... but how in the\r\nname of heaven did Harry survive?\"\r\n\"We can only guess,\" said Dumbledore. \"We may never know.\"\r\nProfessor McGonagall pulled out a lace handkerchief and dabbed at her\r\neyes beneath her spectacles. Dumbledore gave a great sniff as he took a\r\ngolden watch from his pocket and examined it. It was a very odd watch.\r\nIt had twelve hands but no numbers; instead, little planets were moving\r\naround the edge. It must have made sense to Dumbledore, though, because\r\nhe put it back in his pocket and said, \"Hagrid's late. I suppose it was\r\nhe who told you I'd be here, by the way?\"\r\n\"Yes,\" said Professor McGonagall. \"And I don't suppose you're going to\r\ntell me why you're here, of all places?\"\r\n\"I've come to bring Harry to his aunt and uncle. They're the only family\r\nhe has left now.\"'''\r\na=n*m\r\n'''Once, Aunt Petunia, tired of Harry coming back from the barbers looking\r\nas though he hadn't been at all, had taken a pair of kitchen scissors\r\nand cut his hair so short he was almost bald except for his bangs, which\r\nshe left \"to hide that horrible scar.\" Dudley had laughed himself silly\r\nat Harry, who spent a sleepless night imagining school the next day,\r\nwhere he was already laughed at for his baggy clothes and taped glasses.\r\nNext morning, however, he had gotten up to find his hair exactly as it\r\nhad been before Aunt Petunia had sheared it off He had been given a week\r\nin his cupboard for this, even though he had tried to explain that he\r\ncouldn't explain how it had grown back so quickly.\r\nAnother time, Aunt Petunia had been trying to force him into a revolting\r\nold sweater of Dudley's (brown with orange puff balls) -- The harder she\r\ntried to pull it over his head, the smaller it seemed to become, until\r\nfinally it might have fitted a hand puppet, but certainly wouldn't fit\r\nHarry. Aunt Petunia had decided it must have shrunk in the wash and, to\r\nhis great relief, Harry wasn't punished.\r\nOn the other hand, he'd gotten into terrible trouble for being found on\r\nthe roof of the school kitchens. Dudley's gang had been chasing him as\r\nusual when, as much to Harry's surprise as anyone else's, there he was\r\nsitting on the chimney. The Dursleys had received a very angry letter\r\nfrom Harry's headmistress telling them Harry had been climbing school\r\nbuildings. But all he'd tried to do (as he shouted at Uncle Vernon\r\nthrough the locked door of his cupboard) was jump behind the big trash\r\ncans outside the kitchen doors. Harry supposed that the wind must have\r\ncaught him in mid- jump.\r\nDudley thought for a moment. It looked like hard work. Finally he said\r\nslowly, \"So I'll have thirty ... thirty...\"\r\n\"Thirty-nine, sweetums,\" said Aunt Petunia.\r\n\"Oh.\" Dudley sat down heavily and grabbed the nearest parcel. \"All right\r\nthen.\"\r\nUncle Vernon chuckled. \"Little tyke wants his money's worth, just like\r\nhis father. 'Atta boy, Dudley!\" He ruffled Dudley's hair.\r\nAt that moment the telephone rang and Aunt Petunia went to answer it\r\nwhile Harry and Uncle Vernon watched Dudley unwrap the racing bike, a\r\nvideo camera, a remote control airplane, sixteen new computer games, and\r\na VCR. He was ripping the paper off a gold wristwatch when Aunt Petunia\r\ncame back from the telephone looking both angry and worried.\r\n\"Bad news, Vernon,\" she said. \"Mrs. Figg's broken her leg. She can't\r\ntake him.\" She jerked her head in Harry's direction.\r\nDudley's mouth fell open in horror, but Harry's heart gave a leap. Every\r\nyear on Dudley's birthday, his parents took him and a friend out for the\r\nday, to adventure parks, hamburger restaurants, or the movies. Every\r\nyear, Harry was left behind with Mrs. Figg, a mad old lady who lived two\r\nstreets away. Harry hated it there. The whole house smelled of cabbage\r\nand Mrs. Figg made him look at photographs of all the cats she'd ever\r\nowned.\r\n\"Now what?\" said Aunt Petunia, looking furiously at Harry as though he'd\r\nplanned this. Harry knew he ought to feel sorry that Mrs. Figg had\r\nbroken her leg, but it wasn't easy when he reminded himself it would be\r\na whole year before he had to look at Tibbles, Snowy, Mr. Paws, and\r\nTufty again.\r\n\"We could phone Marge,\" Uncle Vernon suggested.\r\n\"Don't be silly, Vernon, she hates the boy.\"\r\nThe Dursleys often spoke about Harry like this, as though he wasn't\r\nthere -- or rather, as though he was something very nasty that couldn't\r\nunderstand them, like a slug.\r\n16\"What about what's-her-name, your friend -- Yvonne?\"\r\n\"On vacation in Majorca,\" snapped Aunt Petunia.\r\n\"You could just leave me here,\" Harry put in hopefully (he'd be able to\r\nwatch what he wanted on television for a change and maybe even have a go\r\non Dudley's computer).\r\nAunt Petunia looked as though she'd just swallowed a lemon.\r\n\"And come back and find the house in ruins?\" she snarled.\r\n\"I won't blow up the house,\" said Harry, but they weren't listening.\r\n\"I suppose we could take him to the zoo,\" said Aunt Petunia slowly, \"...\r\nand leave him in the car....\"\r\n\"That car's new, he's not sitting in it alone....\"\r\nDudley began to cry loudly. In fact, he wasn't really crying -- it had\r\nbeen years since he'd really cried -- but he knew that if he screwed up\r\nhis face and wailed, his mother would give him anything he wanted.\r\n\"Dinky Duddydums, don't cry, Mummy won't let him spoil your special\r\nday!\" she cried, flinging her arms around him.\r\n\"I... don't... want... him... t-t-to come!\" Dudley yelled between huge,\r\npretend sobs. \"He always sp- spoils everything!\" He shot Harry a nasty\r\ngrin through the gap in his mother's arms.\r\nJust then, the doorbell rang -- \"Oh, good Lord, they're here!\" said Aunt\r\nPetunia frantically -- and a moment later, Dudley's best friend, Piers\r\nPolkiss, walked in with his mother. Piers was a scrawny boy with a face\r\nlike a rat. He was usually the one who held people's arms behind their\r\nbacks while Dudley hit them. Dudley stopped pretending to cry at once.\r\nHalf an hour later, Harry, who couldn't believe his luck, was sitting in\r\nthe back of the Dursleys' car with Piers and Dudley, on the way to the\r\nzoo for the first time in his life. His aunt and uncle hadn't been able\r\nto think of anything else to do with him, but before they'd left, Uncle\r\nVernon had taken Harry aside.\r\n\"I'm warning you,\" he had said, putting his large purple face right up\r\n17close to Harry's, \"I'm warning you now, boy -- any funny business,\r\nanything at all -- and you'll be in that cupboard from now until\r\nChristmas.\"\r\n\"I'm not going to do anything,\" said Harry, \"honestly..\r\nBut Uncle Vernon didn't believe him. No one ever did.\r\nThe problem was, strange things often happened around Harry and it was\r\njust no good telling the Dursleys he didn't make them happen.\r\nOnce, Aunt Petunia, tired of Harry coming back from the barbers looking\r\nas though he hadn't been at all, had taken a pair of kitchen scissors\r\nand cut his hair so short he was almost bald except for his bangs, which\r\nshe left \"to hide that horrible scar.\" Dudley had laughed himself silly\r\nat Harry, who spent a sleepless night imagining school the next day,\r\nwhere he was already laughed at for his baggy clothes and taped glasses.\r\nNext morning, however, he had gotten up to find his hair exactly as it\r\nhad been before Aunt Petunia had sheared it off He had been given a week\r\nin his cupboard for this, even though he had tried to explain that he\r\ncouldn't explain how it had grown back so quickly.\r\nAnother time, Aunt Petunia had been trying to force him into a revolting\r\nold sweater of Dudley's (brown with orange puff balls) -- The harder she\r\ntried to pull it over his head, the smaller it seemed to become, until\r\nfinally it might have fitted a hand puppet, but certainly wouldn't fit\r\nHarry. Aunt Petunia had decided it must have shrunk in the wash and, to\r\nhis great relief, Harry wasn't punished.\r\nOn the other hand, he'd gotten into terrible trouble for being found on\r\nthe roof of the school kitchens. Dudley's gang had been chasing him as\r\nusual when, as much to Harry's surprise as anyone else's, there he was\r\nsitting on the chimney. The Dursleys had received a very angry letter\r\nfrom Harry's headmistress telling them Harry had been climbing school\r\nbuildings. But all he'd tried to do (as he shouted at Uncle Vernon\r\nthrough the locked door of his cupboard) was jump behind the big trash\r\ncans outside the kitchen doors. Harry supposed that the wind must have\r\ncaught him in mid- jump.\r\nBut today, nothing was going to go wrong. It was even worth being with\r\nDudley and Piers to be spending the day somewhere that wasn't school,\r\nhis cupboard, or Mrs. Figg's cabbage-smelling living room.\r\n18While he drove, Uncle Vernon complained to Aunt Petunia. He liked to\r\ncomplain about things: people at work, Harry, the council, Harry, the\r\nbank, and Harry were just a few of his favorite subjects. This morning,\r\nit was motorcycles.\r\n\"... roaring along like maniacs, the young hoodlums,\" he said, as a\r\nmotorcycle overtook them.\r\nI had a dream about a motorcycle,\" said Harry, remembering suddenly. \"It\r\nwas flying.\"\r\nUncle Vernon nearly crashed into the car in front. He turned right\r\naround in his seat and yelled at Harry, his face like a gigantic beet\r\nwith a mustache: \"MOTORCYCLES DON'T FLY!\"\r\nDudley and Piers sniggered.\r\nI know they don't,\" said Harry. \"It was only a dream.\"\r\nBut he wished he hadn't said anything. If there was one thing the\r\nDursleys hated even more than his asking questions, it was his talking\r\nabout anything acting in a way it shouldn't, no matter if it was in a\r\ndream or even a cartoon -- they seemed to think he might get dangerous\r\nideas.\r\nIt was a very sunny Saturday and the zoo was crowded with families. The\r\nDursleys bought Dudley and Piers large chocolate ice creams at the\r\nentrance and then, because the smiling lady in the van had asked Harry\r\nwhat he wanted before they could hurry him away, they bought him a cheap\r\nlemon ice pop. It wasn't bad, either, Harry thought, licking it as they\r\nwatched a gorilla scratching its head who looked remarkably like Dudley,\r\nexcept that it wasn't blond.\r\nHarry had the best morning he'd had in a long time. He was careful to\r\nwalk a little way apart from the Dursleys so that Dudley and Piers, who\r\nwere starting to get bored with the animals by lunchtime, wouldn't fall\r\nback on their favorite hobby of hitting him. They ate in the zoo\r\nrestaurant, and when Dudley had a tantrum because his knickerbocker\r\nglory didn't have enough ice cream on top, Uncle Vernon bought him\r\nanother one and Harry was allowed to finish the first.\r\nHarry felt, afterward, that he should have known it was all too good to\r\nlast.'''\r\ncount=a//2\r\n'''Railview Hotel\r\nCokeworth\r\nHarry made a grab for the letter but Uncle Vernon knocked his hand out\r\nof the way. The woman stared.\r\n\"I'll take them,\" said Uncle Vernon, standing up quickly and following\r\nher from the dining room.\r\nWouldn't it be better just to go home, dear?\" Aunt Petunia suggested\r\ntimidly, hours later, but Uncle Vernon didn't seem to hear her. Exactly\r\nwhat he was looking for, none of them knew. He drove them into the\r\nmiddle of a forest, got out, looked around, shook his head, got back in\r\nthe car, and off they went again. The same thing happened in the middle\r\nof a plowed field, halfway across a suspension bridge, and at the top of\r\na multilevel parking garage.\r\n\"Daddy's gone mad, hasn't he?\" Dudley asked Aunt Petunia dully late that\r\nafternoon. Uncle Vernon had parked at the coast, locked them all inside\r\nthe car, and disappeared.\r\nIt started to rain. Great drops beat on the roof of the car. Dud ley\r\nsniveled.\r\n\"It's Monday,\" he told his mother. \"The Great Humberto's on tonight. I\r\nwant to stay somewhere with a television. \"\r\nMonday. This reminded Harry of something. If it was Monday -- and you\r\ncould usually count on Dudley to know the days the week, because of\r\ntelevision -- then tomorrow, Tuesday, was Harry's eleventh birthday. Of\r\ncourse, his birthdays were never exactly fun -- last year, the Dursleys\r\nhad given him a coat hanger and a pair of Uncle Vernon's old socks.\r\nStill, you weren't eleven every day.\r\n32Uncle Vernon was back and he was smiling. He was also carrying a long,\r\nthin package and didn't answer Aunt Petunia when she asked what he'd\r\nbought.\r\n\"Found the perfect place!\" he said. \"Come on! Everyone out!\"\r\nIt was very cold outside the car. Uncle Vernon was pointing at what\r\nlooked like a large rock way out at sea. Perched on top of the rock was\r\nthe most miserable little shack you could imagine. One thing was\r\ncertain, there was no television in there.\r\n\"Storm forecast for tonight!\" said Uncle Vernon gleefully, clapping his\r\nhands together. \"And this gentleman's kindly agreed to lend us his\r\nboat!\"\r\nA toothless old man came ambling up to them, pointing, with a rather\r\nwicked grin, at an old rowboat bobbing in the iron-gray water below\r\nthem.\r\n\"I've already got us some rations,\" said Uncle Vernon, \"so all aboard!\"\r\nIt was freezing in the boat. Icy sea spray and rain crept down their\r\nnecks and a chilly wind whipped their faces. After what seemed like\r\nhours they reached the rock, where Uncle Vernon, slipping and sliding,\r\nled the way to the broken-down house.\r\nThe inside was horrible; it smelled strongly of seaweed, the wind\r\nwhistled through the gaps in the wooden walls, and the fireplace was\r\ndamp and empty. There were only two rooms.\r\nUncle Vernon's rations turned out to be a bag of chips each and four\r\nbananas. He tried to start a fire but the empty chip bags just smoked\r\nand shriveled up.\r\n\"Could do with some of those letters now, eh?\" he said cheerfully.\r\nHe was in a very good mood. Obviously he thought nobody stood a chance\r\nof reaching them here in a storm to deliver mail. Harry privately\r\nagreed, though the thought didn't cheer him up at all.\r\nAs night fell, the promised storm blew up around them. Spray from the\r\nhigh waves splattered the walls of the hut and a fierce wind rattled the\r\nfilthy windows. Aunt Petunia found a few moldy blankets in the second\r\n33room and made up a bed for Dudley on the moth-eaten sofa. She and Uncle\r\nVernon went off to the lumpy bed next door, and Harry was left to find\r\nthe softest bit of floor he could and to curl up under the thinnest,\r\nmost ragged blanket.\r\nThe storm raged more and more ferociously as the night went on. Harry\r\ncouldn't sleep. He shivered and turned over, trying to get comfortable,\r\nhis stomach rumbling with hunger. Dudley's snores were drowned by the\r\nlow rolls of thunder that started near midnight. The lighted dial of\r\nDudley's watch, which was dangling over the edge of the sofa on his fat\r\nwrist, told Harry he'd be eleven in ten minutes' time. He lay and\r\nwatched his birthday tick nearer, wondering if the Dursleys would\r\nremember at all, wondering where the letter writer was now.\r\nFive minutes to go. Harry heard something creak outside. He hoped the\r\nroof wasn't going to fall in, although he might be warmer if it did.\r\nFour minutes to go. Maybe the house in Privet Drive would be so full of\r\nletters when they got back that he'd be able to steal one somehow.\r\nThree minutes to go. Was that the sea, slapping hard on the rock like\r\nthat? And (two minutes to go) what was that funny crunching noise? Was\r\nthe rock crumbling into the sea?\r\nOne minute to go and he'd be eleven. Thirty seconds... twenty ... ten...\r\nnine -- maybe he'd wake Dudley up, just to annoy him -- three... two...\r\none...\r\nBOOM.\r\nThe whole shack shivered and Harry sat bolt upright, staring at the\r\ndoor. Someone was outside, knocking to come in.\r\nCHAPTER FOUR\r\nTHE KEEPER OF THE KEYS\r\nBOOM. They knocked again. Dudley jerked awake. \"Where's the cannon?\" he\r\nsaid stupidly.\r\nThere was a crash behind them and Uncle Vernon came skidding into the\r\nroom. He was holding a rifle in his hands -- now they knew what had been\r\nin the long, thin package he had brought with them.\r\n34\"Who's there?\" he shouted. \"I warn you -- I'm armed!\"\r\nThere was a pause. Then --\r\nSMASH!\r\nThe door was hit with such force that it swung clean off its hinges and\r\nwith a deafening crash landed flat on the floor.\r\nA giant of a man was standing in the doorway. His face was almost\r\ncompletely hidden by a long, shaggy mane of hair and a wild, tangled\r\nbeard, but you could make out his eyes, glinting like black beetles\r\nunder all the hair.\r\nThe giant squeezed his way into the hut, stooping so that his head just\r\nbrushed the ceiling. He bent down, picked up the door, and fitted it\r\neasily back into its frame. The noise of the storm outside dropped a\r\nlittle. He turned to look at them all.\r\n\"Couldn't make us a cup o' tea, could yeh? It's not been an easy\r\njourney...\"\r\nHe strode over to the sofa where Dudley sat frozen with fear.\r\n\"Budge up, yeh great lump,\" said the stranger.\r\nDudley squeaked and ran to hide behind his mother, who was crouching,\r\nterrified, behind Uncle Vernon.\r\n\"An' here's Harry!\" said the giant.\r\nHarry looked up into the fierce, wild, shadowy face and saw that the\r\nbeetle eyes were crinkled in a smile.\r\n\"Las' time I saw you, you was only a baby,\" said the giant. \"Yeh look a\r\nlot like yet dad, but yeh've got yet mom's eyes.\"\r\nUncle Vernon made a funny rasping noise.\r\nI demand that you leave at once, sit!\" he said. \"You are breaking and\r\nentering!\"\r\n35\"Ah, shut up, Dursley, yeh great prune,\" said the giant; he reached over\r\nthe back of the sofa, jerked the gun out of Uncle Vernon's hands, bent\r\nit into a knot as easily as if it had been made of rubber, and threw it\r\ninto a corner of the room.\r\nUncle Vernon made another funny noise, like a mouse being trodden on.\r\n\"Anyway -- Harry,\" said the giant, turning his back on the Dursleys, \"a\r\nvery happy birthday to yeh. Got summat fer yeh here -- I mighta sat on\r\nit at some point, but it'll taste all right.\"\r\nFrom an inside pocket of his black overcoat he pulled a slightly\r\nsquashed box. Harry opened it with trembling fingers. Inside was a\r\nlarge, sticky chocolate cake with Happy Birthday Harry written on it in\r\ngreen icing.\r\nHarry looked up at the giant. He meant to say thank you, but the words\r\ngot lost on the way to his mouth, and what he said instead was, \"Who are\r\nyou?\"\r\nThe giant chuckled.\r\n\"True, I haven't introduced meself. Rubeus Hagrid, Keeper of Keys and\r\nGrounds at Hogwarts.\"\r\nHe held out an enormous hand and shook Harry's whole arm.\r\n\"What about that tea then, eh?\" he said, rubbing his hands together.\r\n\"I'd not say no ter summat stronger if yeh've got it, mind.\"\r\nHis eyes fell on the empty grate with the shriveled chip bags in it and\r\nhe snorted. He bent down over the fireplace; they couldn't see what he\r\nwas doing but when he drew back a second later, there was a roaring fire\r\nthere. It filled the whole damp hut with flickering light and Harry felt\r\nthe warmth wash over him as though he'd sunk into a hot bath.\r\nThe giant sat back down on the sofa, which sagged under his weight, and\r\nbegan taking all sorts of things out of the pockets of his coat: a\r\ncopper kettle, a squashy package of sausages, a poker, a teapot, several\r\nchipped mugs, and a bottle of some amber liquid that he took a swig from\r\nbefore starting to make tea. Soon the hut was full of the sound and\r\nsmell of sizzling sausage. Nobody said a thing while the giant was\r\nworking, but as he slid the first six fat, juicy, slightly burnt'''\r\nprint(count)\r\n'''Railview Hotel\r\nCokeworth\r\nHarry made a grab for the letter but Uncle Vernon knocked his hand out\r\nof the way. The woman stared.\r\n\"I'll take them,\" said Uncle Vernon, standing up quickly and following\r\nher from the dining room.\r\nWouldn't it be better just to go home, dear?\" Aunt Petunia suggested\r\ntimidly, hours later, but Uncle Vernon didn't seem to hear her. Exactly\r\nwhat he was looking for, none of them knew. He drove them into the\r\nmiddle of a forest, got out, looked around, shook his head, got back in\r\nthe car, and off they went again. The same thing happened in the middle\r\nof a plowed field, halfway across a suspension bridge, and at the top of\r\na multilevel parking garage.\r\n\"Daddy's gone mad, hasn't he?\" Dudley asked Aunt Petunia dully late that\r\nafternoon. Uncle Vernon had parked at the coast, locked them all inside\r\nthe car, and disappeared.\r\nIt started to rain. Great drops beat on the roof of the car. Dud ley\r\nsniveled.\r\n\"It's Monday,\" he told his mother. \"The Great Humberto's on tonight. I\r\nwant to stay somewhere with a television. \"\r\nMonday. This reminded Harry of something. If it was Monday -- and you\r\ncould usually count on Dudley to know the days the week, because of\r\ntelevision -- then tomorrow, Tuesday, was Harry's eleventh birthday. Of\r\ncourse, his birthdays were never exactly fun -- last year, the Dursleys\r\nhad given him a coat hanger and a pair of Uncle Vernon's old socks.\r\nStill, you weren't eleven every day.\r\n32Uncle Vernon was back and he was smiling. He was also carrying a long,\r\nthin package and didn't answer Aunt Petunia when she asked what he'd\r\nbought.\r\n\"Found the perfect place!\" he said. \"Come on! Everyone out!\"\r\nIt was very cold outside the car. Uncle Vernon was pointing at what\r\nlooked like a large rock way out at sea. Perched on top of the rock was\r\nthe most miserable little shack you could imagine. One thing was\r\ncertain, there was no television in there.\r\n\"Storm forecast for tonight!\" said Uncle Vernon gleefully, clapping his\r\nhands together. \"And this gentleman's kindly agreed to lend us his\r\nboat!\"\r\nA toothless old man came ambling up to them, pointing, with a rather\r\nwicked grin, at an old rowboat bobbing in the iron-gray water below\r\nthem.\r\n\"I've already got us some rations,\" said Uncle Vernon, \"so all aboard!\"\r\nIt was freezing in the boat. Icy sea spray and rain crept down their\r\nnecks and a chilly wind whipped their faces. After what seemed like\r\nhours they reached the rock, where Uncle Vernon, slipping and sliding,\r\nled the way to the broken-down house.\r\nThe inside was horrible; it smelled strongly of seaweed, the wind\r\nwhistled through the gaps in the wooden walls, and the fireplace was\r\ndamp and empty. There were only two rooms.\r\nUncle Vernon's rations turned out to be a bag of chips each and four\r\nbananas. He tried to start a fire but the empty chip bags just smoked\r\nand shriveled up.\r\n\"Could do with some of those letters now, eh?\" he said cheerfully.\r\nHe was in a very good mood. Obviously he thought nobody stood a chance\r\nof reaching them here in a storm to deliver mail. Harry privately\r\nagreed, though the thought didn't cheer him up at all.\r\nAs night fell, the promised storm blew up around them. Spray from the\r\nhigh waves splattered the walls of the hut and a fierce wind rattled the\r\nfilthy windows. Aunt Petunia found a few moldy blankets in the second\r\n33room and made up a bed for Dudley on the moth-eaten sofa. She and Uncle\r\nVernon went off to the lumpy bed next door, and Harry was left to find\r\nthe softest bit of floor he could and to curl up under the thinnest,\r\nmost ragged blanket.\r\nThe storm raged more and more ferociously as the night went on. Harry\r\ncouldn't sleep. He shivered and turned over, trying to get comfortable,\r\nhis stomach rumbling with hunger. Dudley's snores were drowned by the\r\nlow rolls of thunder that started near midnight. The lighted dial of\r\nDudley's watch, which was dangling over the edge of the sofa on his fat\r\nwrist, told Harry he'd be eleven in ten minutes' time. He lay and\r\nwatched his birthday tick nearer, wondering if the Dursleys would\r\nremember at all, wondering where the letter writer was now.\r\nFive minutes to go. Harry heard something creak outside. He hoped the\r\nroof wasn't going to fall in, although he might be warmer if it did.\r\nFour minutes to go. Maybe the house in Privet Drive would be so full of\r\nletters when they got back that he'd be able to steal one somehow.\r\nThree minutes to go. Was that the sea, slapping hard on the rock like\r\nthat? And (two minutes to go) what was that funny crunching noise? Was\r\nthe rock crumbling into the sea?\r\nOne minute to go and he'd be eleven. Thirty seconds... twenty ... ten...\r\nnine -- maybe he'd wake Dudley up, just to annoy him -- three... two...\r\none...\r\nBOOM.\r\nThe whole shack shivered and Harry sat bolt upright, staring at the\r\ndoor. Someone was outside, knocking to come in.\r\nCHAPTER FOUR\r\nTHE KEEPER OF THE KEYS\r\nBOOM. They knocked again. Dudley jerked awake. \"Where's the cannon?\" he\r\nsaid stupidly.\r\nThere was a crash behind them and Uncle Vernon came skidding into the\r\nroom. He was holding a rifle in his hands -- now they knew what had been\r\nin the long, thin package he had brought with them.\r\n34\"Who's there?\" he shouted. \"I warn you -- I'm armed!\"\r\nThere was a pause. Then --\r\nSMASH!\r\nThe door was hit with such force that it swung clean off its hinges and\r\nwith a deafening crash landed flat on the floor.\r\nA giant of a man was standing in the doorway. His face was almost\r\ncompletely hidden by a long, shaggy mane of hair and a wild, tangled\r\nbeard, but you could make out his eyes, glinting like black beetles\r\nunder all the hair.\r\nThe giant squeezed his way into the hut, stooping so that his head just\r\nbrushed the ceiling. He bent down, picked up the door, and fitted it\r\neasily back into its frame. The noise of the storm outside dropped a\r\nlittle. He turned to look at them all.\r\n\"Couldn't make us a cup o' tea, could yeh? It's not been an easy\r\njourney...\"\r\nHe strode over to the sofa where Dudley sat frozen with fear.\r\n\"Budge up, yeh great lump,\" said the stranger.\r\nDudley squeaked and ran to hide behind his mother, who was crouching,\r\nterrified, behind Uncle Vernon.\r\n\"An' here's Harry!\" said the giant.\r\nHarry looked up into the fierce, wild, shadowy face and saw that the\r\nbeetle eyes were crinkled in a smile.\r\n\"Las' time I saw you, you was only a baby,\" said the giant. \"Yeh look a\r\nlot like yet dad, but yeh've got yet mom's eyes.\"\r\nUncle Vernon made a funny rasping noise.\r\nI demand that you leave at once, sit!\" he said. \"You are breaking and\r\nentering!\"\r\n35\"Ah, shut up, Dursley, yeh great prune,\" said the giant; he reached over\r\nthe back of the sofa, jerked the gun out of Uncle Vernon's hands, bent\r\nit into a knot as easily as if it had been made of rubber, and threw it\r\ninto a corner of the room.\r\nUncle Vernon made another funny noise, like a mouse being trodden on.\r\n\"Anyway -- Harry,\" said the giant, turning his back on the Dursleys, \"a\r\nvery happy birthday to yeh. Got summat fer yeh here -- I mighta sat on\r\nit at some point, but it'll taste all right.\"\r\nFrom an inside pocket of his black overcoat he pulled a slightly\r\nsquashed box. Harry opened it with trembling fingers. Inside was a\r\nlarge, sticky chocolate cake with Happy Birthday Harry written on it in\r\ngreen icing.\r\nHarry looked up at the giant. He meant to say thank you, but the words\r\ngot lost on the way to his mouth, and what he said instead was, \"Who are\r\nyou?\"\r\nThe giant chuckled.\r\n\"True, I haven't introduced meself. Rubeus Hagrid, Keeper of Keys and\r\nGrounds at Hogwarts.\"\r\nHe held out an enormous hand and shook Harry's whole arm.\r\n\"What about that tea then, eh?\" he said, rubbing his hands together.\r\n\"I'd not say no ter summat stronger if yeh've got it, mind.\"\r\nHis eyes fell on the empty grate with the shriveled chip bags in it and\r\nhe snorted. He bent down over the fireplace; they couldn't see what he\r\nwas doing but when he drew back a second later, there was a roaring fire\r\nthere. It filled the whole damp hut with flickering light and Harry felt\r\nthe warmth wash over him as though he'd sunk into a hot bath.\r\nThe giant sat back down on the sofa, which sagged under his weight, and\r\nbegan taking all sorts of things out of the pockets of his coat: a\r\ncopper kettle, a squashy package of sausages, a poker, a teapot, several\r\nchipped mugs, and a bottle of some amber liquid that he took a swig from\r\nbefore starting to make tea. Soon the hut was full of the sound and\r\nsmell of sizzling sausage. Nobody said a thing while the giant was\r\nworking, but as he slid the first six fat, juicy, slightly burnt'''\r\n", "'''\r\n2 4\r\n4\r\n'''\r\nm,n = list(map(int, input().split()))\r\n\r\nboard = m*n\r\nresult=0\r\n\r\nif board%2==0:\r\n result=board/2\r\nelse:\r\n result=(board-1)/2\r\n\r\nprint(int(result))", "N, M = map(int, input().split())\r\n\r\nprint(N*M // 2)", "m,n=map(int,input().split())\r\nx=int(m*n/2)\r\nprint(x)", "width, height = map(int, input().split())\r\nprint(width // 2 * height + width % 2 * height // 2)", "m,n = input().split()\r\nm = int(m)\r\nn = int(n)\r\nt = m*n\r\nk = t//2\r\nprint(k)", "f = input()\r\nf = f.split()\r\nm = int(f[0])\r\nn = int(f[1])\r\ncolvo = 0\r\ns = n * m\r\ncolvo = s // 2\r\nprint(colvo)", "x = input()\r\np = x.split()\r\nm = int(p[0])\r\nn = int(p[1])\r\nresult = (m*n)//2\r\nprint(result)", "m, n = tuple([int(x) for x in input().split()])\r\nprint(int((m/2))*n + (m % 2)*int((n/2)))\r\n", "r, y = map(int, input().split())\r\nz = ((r*y)//2)\r\nprint(z)\r\n", "M,N = tuple(map(int,input().split(\" \")))\r\nsize = M*N\r\nprint(size//2)\r\n\r\n", "m,n = map(int,input().split())\r\ntotal=int(m*n/2)\r\nprint(total)", "inp = list(map(int, input().split()))\r\npro = inp[0]*inp[1]\r\nans = pro//2\r\nprint(ans)", "m, n = list(map(int, input().split()))\r\nres = m * n\r\nprint(res // 2)", "info = input().split(\" \")\r\nM = int(info[0])\r\nN = int(info[1])\r\nprint(M * N // 2) if M * N >= 2 else print(0)", "n, m = map(int, input().split())\r\nn *= m\r\nprint(n//2)", "sides=input()\r\nx=sides.index(\" \")\r\nm=int(sides[:x])\r\nn=int(sides[x+1:])\r\nprint(m*n//2)", "inp = input()\r\ninp = inp.split()\r\nM = int(inp[0])\r\nN = int(inp[1])\r\n\r\nprint(int(M*N/2))\r\n\r\n", "m,n = map(int,input().split())\r\n\r\ns = m*n\r\n\r\nprint(int(s/2))", "y=[int(item) for item in input().split()]\r\n\r\nprint(y[0]*y[1]//2)", "m,n = input().split()\r\nx = int(m) * int(n)\r\nif x%2 == 0:\r\n print( int((x)/2))\r\nelse:\r\n print( int((x-1)//2)) \r\n", "import math\r\nM, N = map(int, input().split())\r\n\r\nn = M * N\r\n\r\nif n%2 == 0:\r\n ans = int(n/2)\r\n print(ans)\r\n \r\nelse:\r\n ans = math.floor(n/2)\r\n print(ans)", "a=str(input())\r\nb=a.split(\" \")\r\nd=0\r\ntotal=int(b[0])*int(b[1])\r\nif total%2==0:\r\n d=total/2\r\nelif total%2==1:\r\n d=(total-1)/2\r\nelif total==0:\r\n d=0\r\nd=int(d)\r\n\r\nprint(d)\r\n", "# for _ in range(int(input())):\r\n# ans=11\r\n# a,b=map(int,input().split())\r\n# if a>b:\r\n# bada=a\r\n# small=b\r\n# elif b>a: \r\n# bada=b\r\n# small=a\r\n# elif b==a:bada=small=a\r\n\r\n# if a%3==0 or b%3==0: \r\n# ans=0\r\n# print(0)\r\n \r\n# elif a==b:ans=1\r\n# n=0\r\n# # bada- (n*small)%3==0, iska nikalo count, which is n\r\n# if ans!=1 or ans!=0:\r\n# while True:\r\n# if (bada-(n*small))%3!=0:n+=1\r\n# else: \r\n# ans=n\r\n# # print(n)\r\n# break\r\n# print(ans)\r\n \r\n\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nprint((a*b)//2)", "v, w = [int(i) for i in input().split()]\r\nprint(int((v*w)/2))", "x, y = list(map(int, input().split()))\r\ndominos = (x * y) // 2\r\nprint(dominos)", "n, m = map(int, input().split())\nprint((n*m)//(2*1))\n#vz\n \t \t \t\t \t \t \t \t \t\t \t", "m,n=map(int, input().split())\r\nx=int(m*n)\r\nprint(0) if m==1 and n==1 else print(x//2)", "row, col = map(int, input().split())\nboard_area = row * col\n\nprint(board_area//2)\n", "dim = input().split(\" \")\n\nprint(int(dim[0])*int(dim[1]) // 2)\n", "M, N = [int(x) for x in input().split()]\r\nb = []\r\nfor i in range(M):\r\n b.append(N)\r\nb.append(0)\r\ntotal = 0\r\nfor i in range(M+1):\r\n for _ in range(N//2):\r\n if b[i] > 1:\r\n b[i] -= 2\r\n total += 1\r\n if b[i] == 1 and b[i+1] > 0:\r\n b[i] -= 1\r\n b[i+1] -= 1\r\n total += 1\r\nprint(total)", "M, N = input().split(' ')\r\n\r\nM = int(M)\r\nN = int(N)\r\n\r\nif M < N:\r\n M, N = N, M\r\n\r\nonLength = M\r\n\r\nonWidth = int(N/2)\r\n\r\ntotal = int(onLength*onWidth)\r\n\r\nif N%2 != 0:\r\n total += int(onLength/2)\r\n\r\nprint(total)", "c = 0\nn,m = map(int,input().split())\nwhile n >= 2:\n c+=m\n n-=2\nwhile n ==1:\n c+=(m//2)\n n-=1\nprint(c)\n \t \t\t \t\t \t \t \t \t\t\t \t\t\t\t", "m,n = map(int,input().split())\r\nmang = []\r\nfor i in range(m) :\r\n mang.append([1]*n)\r\ntong = 0 \r\nfor i in range(len(mang)) :\r\n for j in range(len(mang[i])) :\r\n if mang[i][j] != 0 :\r\n mang[i][j] = 0\r\n if i+1 <= len(mang)-1 and mang[i+1][j] != 0:\r\n tong += 1\r\n mang[i+1][j] = 0\r\n continue\r\n if j+1 <= len(mang[0])-1 and mang[i][j+1] != 0 :\r\n tong += 1\r\n mang[i][j+1] = 0\r\n continue\r\nprint(tong)", "m,n = map(int, input().split())\r\ns = m*n\r\nk = s // 2\r\nprint(k)", "n,m =map(int , input().split())\r\nx = n*m // 2\r\nprint(x)", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nprint (int(round((a*b-0.1)/2)))\r\n \r\n", "def main():\r\n m, n = map(int, input().split());\r\n if m < 2:\r\n if n < 2:\r\n print(0);\r\n else:\r\n ans = int(n / 2);\r\n print(ans);\r\n else:\r\n if n < 2:\r\n ans = int(m / 2);\r\n print(ans);\r\n else:\r\n ans = (int(m*n/4)*2)+int(((m*n) % 4)/2);\r\n print(ans);\r\n\r\nif __name__ == '__main__':\r\n main();", "(m,n)=map(int,input().split(' '))\r\nd=int((m*n)/2)\r\nprint(d)", "n, m = list(map(int, input().split()))\n\nres = 0\nres += n * (m // 2)\nif (m % 2 == 1):\n res += n//2\n\nprint(res)\n", "def main():\r\n\tinPut=input().split()\r\n\tM=int(inPut[0])\r\n\tN=int(inPut[1])\r\n\tif M%2==0:\r\n\t\tans=M/2*N\r\n\t\tprint(int(ans))\r\n\telse:\r\n\t\tans=int(M/2)*N+N/2\r\n\t\tprint(int(ans))\r\nmain()", "n,m = map(int,input().split())\r\narea = n*m\r\narea = area//2\r\nprint(area)", "x,y=input().split()\r\nprint(int(x)*int(y)//2)", "a = input() ; s = int(a[0:2])*int(a[2:5]) ; print(s//2)", "\r\nI = lambda: list(map(int, input().rstrip().split()))\r\nM, N = I()\r\n\r\nprint((M * N) //2)\r\n", "m,n = map(int,input().split())\r\narea = m*n\r\ndomenoArea = 2\r\nprint(area//domenoArea)", "import math\r\nl = input().split()\r\na = int(l[0])\r\nb = int(l[1])\r\ne = a*b\r\nc = 2 #розмір доміно\r\nd = math.floor(e/c)\r\nprint(d)", "m,n=input().split()\r\nm=int(m)\r\nn=int(n)\r\nif(m%2==0)and(n%2!=0):\r\n print(int(m*n/2))\r\nelif(m%2==0)and(n%2==0):\r\n print(int(m*n/2))\r\nelif(m%2!=0)and(n%2!=0):\r\n print(int((m*n-1)/2))\r\nelse:\r\n print(int(m*n/2))", "# Переменные \r\nMN = input()\r\nMN = MN.split()\r\nM = int(MN[0])\r\nN = int(MN[1])\r\n\r\ndominoshki = 0\r\nif (1 <= M <= N <= 16) and (not(len(MN) > 2)):\r\n if (N%2 == 0):\r\n dominoshki = (M * N)/2\r\n else:\r\n if (M%2 == 0):\r\n dominoshki = ((N-1)*M)/2 + M/2\r\n else:\r\n dominoshki = ((N-1)*M)/2 + (M-1)/2\r\n \r\n print(int(dominoshki))\r\n \r\n \r\n ", "s = input()\r\nl = s.split(\" \")\r\nn = int(l[0])\r\nm = int(l[1])\r\nprint(m*n//2)", "numbers = input()\r\nnumbers = numbers.split()\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\n\r\nif m*n % 2 == 0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int((m*n-1)/2))", "mn=input()+\" \"\r\nmn_list=[]\r\na=\"\"\r\nfor x in mn:\r\n if x!=\" \":\r\n a+=x\r\n else:\r\n mn_list.append(a)\r\n a=\"\" \r\nsurface=int(mn_list[0])*int(mn_list[1])\r\nprint(surface//2)", "m,n= map(int,(input().split()))\r\nif(m%2==0):\r\n\tprint(n*(m//2))\r\nelse:\r\n\tprint(n*(m//2)+n//2)", "M,N = map(int,input().split())\r\nsize = M*N\r\nprint(size//2)", "n, m = [int(i) for i in input().split()]\r\n\r\nn = n*m //2\r\nprint(n)", "n = str(input())\r\nl = n.split()\r\nval = int(l[0])*int(l[1])\r\nprint(val//2)", "a, b = map(int, input().split())\r\nc = a*b\r\nprint(c//2)", "while True:\r\n try:\r\n s = list(map(int, input().split(' ')))\r\n print(s[0] * s[1] // 2)\r\n except:\r\n break", "nk=input().split()\r\nn,k=int(nk[0]),int(nk[1])\r\nprint((n*k)//2)\r\n", "x=list(map(int,input().split()))\r\nq= x[0]*x[1]\r\nprint(int(q/2))", "x = input()\r\nx =x.split(\" \" )\r\na = int(x[0])\r\nb =int(x[1])\r\nc=int(a*b)\r\nout=int(c/2)\r\nprint(out)", "l = input().split()\r\nnm = list(map(int, l))\r\nn = nm[0]\r\nm = nm[1]\r\nprint(n*m//2)\r\n", "n,p=map(int,input().split())\r\nprint((n*p)//2)", "n,m=map(int,input().split())\r\nr=(n*m)//2\r\nprint(r)", "import math\r\nl = list(map(int, input().split()))\r\nd = math.floor((l[0]*l[1])/2)\r\nprint(d)", "inp = input()\r\nMN = inp.split()\r\n\r\nans = (int(MN[0]) * int(MN[1])) / 2\r\nprint(int(ans))\r\n\r\n\r\n\r\n", "n = input()\r\na = n.split()\r\n\r\nprint((int(a[0])*int(a[1]))//2)", "a, g = map(int, input().split())\r\nk = a*g // 2\r\nif k == 4.5:\r\n print(k - 0.5)\r\nprint(k)\r\n\r\n", "m, n = (int(i) for i in input().split())\r\ns = m * n\r\nprint(s // 2)", "m, n = map(int,input().split())\r\nnum_sq = m*n ;\r\nprint(int(num_sq/2))", "import math\r\n\r\nm, n = map(int,input().rstrip().split())\r\n\r\narea = (m*n) // 2\r\nprint(area)", "n, m = map(int,input().split())\r\nnum=n*m\r\nprint(num//2)", "d, a = input().split()\r\nd = int(d)\r\na = int(a)\r\ni = d*a//2\r\n\r\nprint(i)\r\n", "shuru=input().split()\r\nm=int(shuru[0])\r\nn=int(shuru[1])\r\nprint(int(m*n/2))", "import math\nx = input('')\nvariables = x.split(' ')\na = int(variables[0])\nb = int(variables[1])\ns = a * b / 2\nprint(math.floor(s))\n", "m,n = map(int,input().split())\r\n\r\nres=(n>1)*m*(n//2)+(n%2)*(m//2)\r\nprint(res)\r\n", "M, N = map(int, input().split())\r\n\r\ntot = M * N\r\n\r\nif tot % 2 == 0:\r\n print(tot//2)\r\nelse:\r\n print((tot-1)//2)", "import sys\n\nm,n=input().split()\nm = int(m)\nn = int(n)\n\np = m * n\nprint(p // 2)\n", "\r\n\r\n\r\ndef domino_stacking(n : str):\r\n n, m = map(int, n.split())\r\n return int(m * n) // int(1 * 2)\r\n \r\nprint(domino_stacking(input()))", "from collections import Counter\nm,n = map(int,input(\"\").split(\" \"))\nprint((m*n)//2)\n\n\n", "a,b=map(int,input().split()) \nmulti=a*b\nk=2*1 \ndomp=multi//k\nprint(domp)\n \t \t\t\t\t \t\t \t\t \t \t \t \t", "m,n = map(int, input().split()) \r\nsquare = m * n\r\ndomino = 2\r\nresult = square // domino\r\nprint(result)", "s=input()\r\nm,n = [int(x) for x in s.split()]\r\ncount=0\r\nif m%2==0:\r\n count=n*m/2\r\nelif n%2==0:\r\n count=n*(m//2)+n/2\r\nelse:\r\n count = n * (m // 2) + n // 2\r\nprint(int(count))\r\n\r\n", "m, n = map(int, input().split())\r\nx = (m * n) // 2\r\nprint(x)\r\n", "X,Y=map(int,input().split())\r\nprint((X*Y)//2)", "ch=str(input())\r\na=ch.split(' ')\r\nM=int(a[0])\r\nN=int(a[1])\r\nif N%2==0:\r\n print(int(N*M/2))\r\nelse:\r\n print(int(M//2+(N-1)*M/2))\r\n", "[m,n]=[int(x) for x in input().split()]\r\nprint(m*n//2)", "def domino(m,n):\r\n return (m*n)//2\r\n\r\nm, n = map(int, input().split())\r\nprint(domino(m, n))", "arr = list(map(int,input().split()))\r\nprint (int(arr[0]*arr[1]/2))", "m, n = input().split()\n\nm, n = int(m), int(n)\n\nans = (m * n) // 2\n\nprint(ans)\n", "m,n=map(int,input().split())\r\narea=(m*n//2)\r\nprint(area)", "i,j=map(int,input().split()[:2])\r\nprint((i*j)//2)\r\n", "import math\r\nfirst_line = input().split()\r\nx, y = first_line[0], first_line[1]\r\nboard_size = int(x) * int(y)\r\nif not board_size % 2 == 0:\r\n board_size -= 1\r\nprint(int(board_size/2))", "m, n = map(int, input().split())\ndef d():\n return (m * n) // 2\nprint(d())\n\n \t \t \t\t\t \t \t \t\t\t \t", "# {_@_A_b_d_u_l___M_a_l_i_k_@_}\r\n\r\n# A. Domino piling\r\n\r\na,b = map(int,input().split())\r\nc = (a*b)//2\r\nprint(c)\r\n\r\n# {_@_A_b_d_u_l___M_a_l_i_k_@_}\r\n", "def domino_piling(a,b):\n return ((a*b)//2)\nm,n = map(int,input().split())\n\nprint(domino_piling(m,n))\n\t \t \t \t\t\t \t \t \t \t \t", "def max_number_of_dominos(M, N):\r\n return (M * N) // 2\r\n\r\n\r\n# Input\r\nM, N = map(int, input().split())\r\n\r\n# Calculate and output the mx. number of dominoes\r\nresult = max_number_of_dominos(M, N)\r\nprint(result)\r\n", "lrg, lng = map(int, input().split())\n\naire = lrg * lng\n\nprint(aire//2)\n", "r=str(input())\r\nr=r.split()\r\na=int(r[0])\r\nb=int(r[-1])\r\ns=a*b\r\nn=s//2\r\nprint (n)\r\n", "n,m = map(int,input().split())\r\nno_tiles = (n*m)//2\r\nprint(no_tiles)", "i = input()\r\ni = i.split()\r\nn = int(i[0])\r\nm = int(i[1])\r\np = n*m\r\n\r\nif(p%2==0):\r\n print(int(p/2))\r\nelse:\r\n print(int((p-1)/2))", "d = [int(i) for i in input().split() if i.isdigit()]\nif (1<=d[0]<=d[1]<=16):\n print((d[0]*d[1]) // 2)", "n,w=map(int,input().split())\r\nt=n*w\r\nif t%2==0:\r\n print(t//2)\r\nelse:\r\n print((t-1)//2)\r\n ", "n1, n2 = list(map(int, input().split()))\n\n\na = n1 * n2\n\nif a // 2 > int(a // 2):\n print(a // 2 + 1)\nelse:\n print(a // 2)\n", "text= tuple(map(int, input().split()))\r\na = text[0]\r\nb = text[1]\r\nc = text[0]*text[1]//2\r\nprint(c)", "n, m = map(int, input().split())\r\nc = n*m\r\nif(c%2==0):\r\n print(c//2)\r\nelse:\r\n print((c-1)//2)", "a = list(input (). split (\" \"))\r\nprint ((int (a[0])*int (a[1]))//2)", "m,n= map(int,input().split())\noutput=(m*n//2)\nprint(output)\n\t \t\t \t \t\t\t \t \t \t", "import math\nm,n = list(map(int,input().split(' ')))\nprint(math.floor(m*n/2))\n\n\n\n\n\n\n\n\n\n\n\n#ints = list(map(int,input().split()))\n#for _ in range(count):\n# strs.append(input())\n#res =0\n#for a in ints:\n# if a >= ints[int(k)-1] and a > 0:\n# res+=1\n#print(res)\n\n#for a in strs:\n# res = ''\n# if len(a) > 10:\n# res = a[0] + str(len(a[1:-1])) + a[-1]\n# else:\n# res = a\n# print(res)\n", "m,n=(input()).split()\r\nm=int(m)\r\nn=int(n)\r\nprint((m*n)//2)", "#Mers\r\n\r\nn , m = input().split()\r\nn , m = int ( n ), int ( m )\r\nprint ( int(n*m/2) )\r\n\r\n", "x,y=map(int,input().split())\r\nz=x*y\r\nif z%2==0:\r\n print(z//2)\r\nelse:\r\n print((z-1)//2)\r\n", "n = [int(i) for i in input().split()]\r\ncounter = 0\r\ns = n[0] * n[1]\r\nwhile s != 0 and s != 1:\r\n s -= 2\r\n counter += 1\r\nprint(counter)", "import math\r\ndef calculateDomino(m,n):\r\n print(math.floor((m*n)/2))\r\n \r\n\r\ndef read_input():\r\n m,n = input().split(\" \")\r\n calculateDomino(int(m), int(n))\r\nread_input()", "m,n=map(int,input().split())\r\nprint(int((m*n)//2))", "n=input()\r\nm=int(n.split(\" \")[0])\r\nk=int(n.split(\" \")[1])\r\nprint((k*m)//2)", "mn = input()\r\nmn = mn.split(\" \")\r\nm = int(mn[0])\r\nn = int(mn[1])\r\nprint((m*n)//2)", "rc = input(\"\").split(' ')\r\nr = int(rc[0])\r\nc = int(rc[1])\r\nts = r*c\r\nds = ts//2\r\nprint(ds)", "import math\r\ndimensions = input().strip().split(' ')\r\nx=int(dimensions[0])*int(dimensions[1])\r\nprint(math.floor(x/2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 3 20:08:12 2022\r\n\r\n@author: Dehong\r\n\"\"\"\r\nn , m = map(int, input().split())\r\ns = n*m\r\nprint(s//2)", "import math\r\n\r\nsize=input()\r\nsize_list=list(map(int,size.split()))\r\nsquares=size_list[0]*size_list[1]\r\nprint(math.floor(squares/2))", "w,l = map(int,input().split())\r\n\r\nprint(w*l//2)", "X = input()\r\ny = X.split(' ')\r\nM = int(y[0])\r\nN = int(y[1])\r\n\r\nif (M%2 == 0):\r\n print(int((M/2)*N))\r\nif (M%2 != 0 and M>2):\r\n print(int((((M-1)/2)*N)+N/2))\r\nif M<2:\r\n print(int((N/2)))", "# word=input()\r\n# print(word[0].upper()+word[1:])\r\n\r\nM,N=map(int,input().split())\r\nprint(M*N//2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n , k = input().split()\r\nprint(int(n) * int(k) // 2)", "M, N = [int(i) for i in input().split()]\r\nprint((M * N) // 2)\r\n", "a = list(map(int, input().split(' '))) # 2 4\r\n\r\nz = a[0] * a[1]\r\n\r\nif z % 2 == 0:\r\n print(z // 2)\r\nelse:\r\n print(z // 2)", "array = input().split()\r\nm, n = int(array[0]), int(array[1])\r\nprint(int(0.5*m*n))", "line1 = input()\nlinespl2 = line1.split()\n\nM = linespl2[0]\nN = linespl2[1]\n\nx = int(M)*int(N)\n\nif x%2==0:\n print(int(x/2))\nif x%2==1:\n print(int((x-1)/2))\n \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", "c = list(map(int,input().split(\" \")))\r\nprint(c[0] * c[1] // (2*1))\r\n", "M,N=[int(x) for x in input().split()]\r\nn=N//2\r\nm=M//2\r\nif N%2==1:\r\n print(n*M+m)\r\nelse:\r\n print(n*M)\r\n\r\n", "# Function to calculate the maximum number of dominoes\ndef calculate_max_dominoes(M, N):\n # Since each domino covers 2 squares, the maximum number of dominoes is half of the total number of squares.\n # We divide by 2 and take the floor to ensure that we place full dominoes.\n max_dominoes = (M * N) // 2\n return max_dominoes\n\n# Main function to read input and calculate the maximum number of dominoes\ndef main():\n M, N = map(int, input().split()) # Board sizes\n result = calculate_max_dominoes(M, N)\n print(result)\n\nif __name__ == \"__main__\":\n main()\n\n\t\t\t\t \t\t \t\t\t\t\t \t \t \t\t \t \t \t\t", "from collections import defaultdict\r\nfrom tkinter import N\r\n\r\n# n=int(input())\r\n# c=0\r\n# for _ in range(n):\r\n# l=list(map(int,input().split()))\r\n# o=0\r\n# for i in l:\r\n# if(i==1):\r\n# o+=1\r\n# if(o>1):\r\n# c+=1\r\n# print(c)\r\n# def firstRepeated(arr, n): \r\n# d=defaultdict(list)\r\n# for i in range(len(arr)):\r\n\r\n# d[arr[i]].append(i)\r\n# for i,j in d.items():\r\n# if(len(j)>1):\r\n# return j[0]\r\n \r\n# arr=[1,2,5,3,4,9,3,5]\r\n# n=len(arr)\r\n# print(firstRepeated(arr,n))\r\n\r\n# a=1\r\n# b=4\r\n# c=a^b\r\n# a=c^a\r\n# b=c^b\r\n# print(a,b)\r\n# import bisect\r\n# a=[1,1,5,5,5,6,4,4,4,4]\r\n# k=5\r\n# # print(bisect.bisect_left(a,8))\r\n\r\n# # Python3 program to implement\r\n# # the above approach\r\n\r\n# # Function to get\r\n# # the closest value\r\n# import math\r\n# def clostVal(arr, N, k):\r\n# arr.sort()\r\n# j=arr.index(k)\r\n# for i in range(j+1,N):\r\n# if(k+arr[i]):\r\n# aux=math.floor((k+arr[i])/2)\r\n# if(aux in arr):\r\n# continue\r\n# else:\r\n# return aux\r\n \r\n\r\n\r\n# arr=[ 1,2,3,4,5,6]\r\n# K = 6\r\n# N = len(arr)\r\n# print(clostVal(arr, N, K))\r\n\r\n# n=13\r\n# v=0\r\n# i=2\r\n# mask=~(1<<i)\r\n# cl=n&mask\r\n# print((v<<i))\r\n# n=cl|(v<<i)\r\n# print(n)\r\n\r\n# # n=13\r\n# # print(bin(13))\r\n# # mask=(-1<<2)\r\n# # print(mask,bin(mask))\r\n# # n=n&mask\r\n# # print(n,bin(n))\r\n\r\n# t =input()\r\n# k=int(input())\r\n\r\n# class Pair:\r\n# def __init__(self, c, ctr):\r\n# self.c = c\r\n# self.ctr = ctr\r\n# class Solution:\r\n# def reduced_String(self, k, s):\r\n# if (k == 1):\r\n# return \"\" \r\n# st = []\r\n# for i in range(len(s)):\r\n# if (len(st) == 0):\r\n# st.append((Pair(s[i], 1)))\r\n# continue\r\n# if (st[-1].c == s[i]):\r\n# pair = st.pop()\r\n# pair.ctr += 1\r\n# if (pair.ctr == k):\r\n# continue\r\n# else:\r\n# st.append(pair)\r\n# else:\r\n# st.append((Pair(s[i], 1)))\r\n# ans = \"\"\r\n# while (len(st) > 0):\r\n# c = st[-1].c\r\n# cnt = st[-1].ctr\r\n# while (cnt > 0):\r\n# ans = c + ans\r\n# cnt -= 1\r\n# st.pop()\r\n# return (ans)\r\n\r\n# obj = Solution()\r\n# print(obj.reduced_String(k, t))\r\n# def cnt(n):\r\n# return (n * (n + 1)) // 2\r\n# def solve(A):\r\n# MOD = int(1e9 + 7)\r\n# ans = 0\r\n# n = len(A)\r\n# for b in range(27):\r\n# c = 0\r\n# C = cnt(n)\r\n \r\n# for i in range(n):\r\n# if A[i] & 1:\r\n# print(b,i,A[i])\r\n# C -= cnt(c)\r\n# c = 0\r\n# else:\r\n# c += 1\r\n# A[i] >>= 1\r\n# C -= cnt(c)\r\n# ans = (ans + (1 << b) * C) % MOD\r\n# return ans\r\n# A=[1,2,3,4]\r\n# print(solve(A))\r\n\r\n\r\n\r\n# ans = []\r\n# curr = []\r\n# def solve(i, n, A):\r\n# global ans,curr\r\n# if i == n:\r\n# ans.append(sorted(curr.copy()))\r\n# return\r\n# solve(i+1,n,A)\r\n# curr.append(A[i])\r\n# solve(i+1,n,A)\r\n# curr.pop()\r\n# def subsets(A):\r\n# global ans,curr\r\n# ans = []\r\n# n = len(A)\r\n# solve(0, n, A)\r\n# return sorted(ans)\r\n# su=[4,1,7]\r\n# print(subsets(su))\r\n# for _ in range(int(input())):\r\n# ma=\"Timur\"\r\n# met=len(ma)\r\n# n=int(input())\r\n# s=input()\r\n# for i in range(len(s)):\r\n# if(s[i] in ma):\r\n# idx=ma.index(s[i])\r\n# ma=ma[:idx]+ma[idx+1:]\r\n# if(ma==\"\" and i==met-1):\r\n# print(\"Yes\")\r\n# else:\r\n# print(\"No\")\r\n\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\n# s1=input()\r\n# s2=input()\r\n# aux=[\"G\",\"B\"]\r\n# i=0\r\n# flag=\"Yes\"\r\n# j=0\r\n# while(i<len(s1) and j<len(s2)):\r\n# if(s1[i] in aux and s2[j] in aux):\r\n# i+=1\r\n# j+=1\r\n# elif(s1[i]==\"R\" and s2[j]==\"R\"):\r\n# i+=1\r\n# j+=1\r\n# else:\r\n# flag=\"No\"\r\n# break\r\n# print(flag)\r\n\r\n# RGBRRGBR\r\n# RGGRRBGR\r\n\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\n# a=input()\r\n# b=input()\r\n# c=input()\r\n# a=a.split()\r\n# b=b.split()\r\n# c=c.split()\r\n# d=defaultdict(lambda:1)\r\n# for i in range(n):\r\n# if(a[i] in b):\r\n# if(a[i] in d):\r\n# d[a[i]]+=1\r\n# else:\r\n# d[a[i]]=2\r\n# if(a[i] in c):\r\n# if(a[i] in d):\r\n# d[a[i]]+=1\r\n# else:\r\n# d[a[i]]=2\r\n# else:\r\n# d[a[i]]=1\r\n# print(d)\r\n \r\n\r\n# orz for qaq\r\n# qaq orz for\r\n# cod for ces\r\n\r\n# m,n=map(int,input().split())\r\n# l=list(map(int,input().split()))\r\n# c=0\r\n# for i in l:\r\n# if(i>=l[n-1] and i>0):\r\n# c+=1\r\n# print(c)\r\n# num=31\r\n# print(num.bit_length())\r\n# a, b = map(int, input().split())\r\n \r\n# k = 2**(a^b).bit_length()\r\n# print(k-1)\r\n\r\n# l,r=tuple(map(int,input().split(\" \")))\r\n# x=l^r\r\n# pow=1\r\n# while(pow<=x) :\r\n# pow*=2\r\n \r\n# print(pow-1)\r\n\r\n# class Node:\r\n# def __init__(self, x):\r\n# self.val = x\r\n# self.left = None\r\n# self.right = None\r\n# def dfs(root, maxsofar):\r\n# if root == None:\r\n# return 0\r\n# ans = 0\r\n# if root.val > maxsofar:\r\n# ans = 1\r\n# maxsofar = root.val\r\n# ans = ans + dfs(root.left, maxsofar)\r\n# ans = ans + dfs(root.right, maxsofar)\r\n# return ans\r\n\r\n# def solve(A):\r\n# return dfs(A, 0)\r\n# root = Node(4)\r\n# root.left = Node(5)\r\n# root.right = Node(2)\r\n# root.right.left=Node(3)\r\n# root.right.right=Node(6)\r\n# actual = solve(root)\r\n# print(actual)\r\n# print(bin(100))\r\n# n=32\r\n# c=0\r\n# while(n):\r\n# c+=n&1\r\n# n=n>>1\r\n# print(c)\r\n# 3>>1\r\n# 3/2**1\r\n# a>>i = a/2**i\r\n# 1 1 0 0 1\r\n# 1 1 0 0 \r\n \r\n# a<<i= a*2**i\r\n# 1 1 0 0 1\r\n# 1 1 0 0 1 0\r\n\r\n# -2 3 -4\r\n# maxval=-2\r\n# minval=-2\r\n# maxprod=-2\r\n# i=3\r\n\r\n# maxval= 3,-2*3==max(3,-2*3) =max(3,-6)=3\r\n\r\n# minval=min(3,-2*3) ==min(3,-6)= -6\r\n\r\n# maxprod=max(minval,maxval)==max(-6,3)==3\r\n\r\n# i=-4\r\n# if(-4<0):\r\n# temp=maxval temp=3\r\n# maxval=minval maxval=-6\r\n# minval=temp minval =3\r\n \r\n\r\n\r\n# maxval=max(-4,-4*3)==max(-4,-12)== -4 maxval=max(-4,-4*-6)==max(-4,24)==24\r\n\r\n# minval=min(-4,-4*-6)==min(-4,24)==-4 minval=min(-4,-4*3)===min(-4,-12)== -12\r\n\r\n\r\n# maxprod=max(-4,-4)=-4 maxprod=24\r\n\r\n# -2 3 -4 -5\r\n# i=-5\r\n \r\n# temp=maxval temp=24\r\n# maxval=minval maxval = -12\r\n# minval=temp mival=24\r\n \r\n \r\n \r\n# maxval=max(-5,-5*-4)==max(-5,20)== 20 maxval=max(-5,-5*-12)==max(-5,60)==60\r\n \r\n# minval=min(-5,-5*-4)=min(-5,20)= -5 minval=min(-5,-5*24)=min(-5,-120)==-120\r\n \r\n# maxprod=max(20,-5)==20 maxprod=max(60,-120)==60\r\n \r\n# class Node:\r\n# def __init__(self, x):\r\n# self.val = x\r\n# self.left = None\r\n# self.right = None\r\n# def minDepth(root):\r\n# if(root is None):\r\n# return 0\r\n# children=[root.left,root.right]\r\n \r\n# if(not any(children)):\r\n# return 1\r\n# min_depth=float(\"inf\")\r\n# for c in children:\r\n# if(c):\r\n# min_depth=min(minDepth(c),min_depth)\r\n# return min_depth+1\r\n# root = Node(3)\r\n# root.left = Node(9)\r\n# root.right = Node(20)\r\n# root.right.left=Node(15)\r\n# root.right.right=Node(7)\r\n# actual = minDepth(root)\r\n# print(actual)\r\n\r\n\r\n# n=7\r\n# l=[5,2,7,4,1,6,3]\r\n# k=3\r\n\r\n# def minSwaps(input1,input2,input3):\r\n\r\n# global c\r\n# c=0\r\n# j=0\r\n# def right(l,n):\r\n# if n>len(l):\r\n# n= int(n%len(l))\r\n# l = (l[-n:] + l[:-n])\r\n# return l\r\n# l_d=right(input2,input3)\r\n# def swap(l,i,j):\r\n# global c\r\n# c+=1\r\n# l[i],l[j]=l[j],l[i]\r\n# return l\r\n# for i in range(len(input2)):\r\n# if(input2==l_d):\r\n# break\r\n# if(input2[i]!=l_d[j]):\r\n# idx=input2.index(l_d[j])\r\n# j+=1\r\n# swap(input2,i,idx)\r\n# return c\r\n# print(minSwaps(7,[5,2,7,4,1,6,3],3))\r\n \r\n \r\n# input1=5\r\n# input2=[2,0,2,0,0]\r\n# input3=[1,0,-1,0,0]\r\n# input4=3\r\n\r\n# def phermone(input1,input2,input3,input4):\r\n# i=0\r\n# total=input2\r\n# while(i<input4):\r\n# aux=[0]*input1\r\n# for j in range(i,input1):\r\n# if(input3[j]==1):\r\n# aux[j+1]+=input2[j]\r\n# if(input3[j]==0):\r\n# continue\r\n# if(input3[j]==-1):\r\n# aux[j-1]+=input2[j]\r\n\r\n# i+=1\r\n# print(aux)\r\n# for k in range(input1):\r\n# total[k]=total[k]+aux[k]\r\n# print(total)\r\n \r\n \r\n# print(phermone(input1,input2,input3,input4))\r\nfrom math import floor\r\nm,n=map(int,input().split())\r\nprint(floor((m*n)/2)) \r\n \r\n \r\n \r\n ", "import sys\ninput = sys.stdin.readline\n\n\nif __name__ == \"__main__\":\n n, m = map(int, input().split())\n print(n*m//2)\n\n\t \t \t \t\t \t \t\t \t\t\t \t \t\t \t\t", "m,n = map(int, input().split());\nf = int(m * n);\nprint(int(f/2));\n\n", "m,n=input().split()\r\narea=int(m)*int(n)\r\nprint(int(area/2))", "mn = input()\r\n\r\nsplit = mn.split()\r\n\r\nM = int(split[0])\r\nN = int(split[1])\r\n\r\nprint((M*N)//2)", "def max_dominoes(M, N):\r\n return (M * N) // 2\r\n\r\n# Read the board sizes M and N\r\nM, N = map(int, input().split())\r\n\r\n# Calculate and print the maximal number of dominoes that can be placed\r\nresult = max_dominoes(M, N)\r\nprint(result)\r\n", "t, e = map(int, input().split())\r\nres = int(t*e / 2)\r\nprint(res)", "a=list(map(int,input().split()))\nn=a[0]*a[1]\nprint(n//2)\n", "def sert(a, b):\n\tx = a*b\n\tx = x//2\n\tprint(x)\n\na,b = map(int, input().split())\t\nsert(a,b)", "def dominos(a):\r\n sq = a[0]*a[1]\r\n return sq//2\r\n\r\nif __name__==\"__main__\":\r\n a = [int(x) for x in input().split()]\r\n # print(a)\r\n print(dominos(a))", "import math as x\r\nj,k=map(int,input().split())\r\nprint(x.floor((j*k)/2))", "wandh = input().split()\r\n\r\nboard = int(wandh[0]) * int(wandh[1])\r\n\r\nprint(int(board)//2)\r\n", "M, N = map(int,input().split())\r\nprint(int(M*N/2))", "from math import floor\r\nm, n = map(int,input().split())\r\na = floor((m*n)/2)\r\nprint(a)\r\n", "m,n=map(int,input().split())\r\nprint(int((m/2)*(n/1)))", "s = input()\r\nls = s.split()\r\nM = int(ls[0])\r\nN = int(ls[1])\r\nif M >= 1 and M <= 16 and N >= 1 and N <= 16 and M <= N:\r\n print((M*N)//2)\r\n", "mn_input = input()\r\nmn_input = mn_input.split()\r\nm = int(mn_input[0])\r\nn = int(mn_input[1])\r\n\r\nresult = (m*n)//2\r\nprint(result)", "m, n = map(int, input().split())\r\n\r\nif m % 2 == 1:\r\n # odd number of rows\r\n smaller_set = (m * n) // 2 \r\nelse:\r\n # even number of rows\r\n smaller_set = (m * n) // 2\r\n\r\nprint(smaller_set)\r\n", "m, n = map(int, input().split())\r\nsquare = m * n\r\nprint(square // 2)", "a,b=map(int,input().split())\r\nz=a*b\r\nz=z//2\r\nprint(z)", "x,y= input().split()\r\nm,n=int(x),int(y)\r\nprint((m*n)//2)", "board = input().split()\r\nboard = int(board[0]) * int(board[1])\r\ndominoes = 0\r\nwhile board > 1:\r\n dominoes = dominoes + 1\r\n board = board - 2\r\nprint(dominoes)", "m, n = map(int, input().split())\r\n\r\nres = (n // 2) * m + (n % 2) * (m // 2)\r\n\r\nprint(res)\r\n", "class domino:\n a = [int(x) for x in input().split()]\n x = a[0] * a[1]\n print(int(x/2))", "\"\"\"\n\"\"\"\n\n\nclass DominoPiling:\n def solve(self, h, w):\n area = h * w\n\n return area // 2\n\n\nif __name__ == \"__main__\":\n h, w = map(int, input().split(\" \"))\n\n dp = DominoPiling()\n\n print(dp.solve(h, w))\n", "import math\r\n\r\nm, n = [int(i) for i in input().split()]\r\nprint(math.floor((m * n) / 2))", "m,n = map(int, input().split())\r\nval1=m\r\nval2=n//2\r\n\r\nif n%2==0:\r\n\tprint(val1*val2)\r\nelse:\r\n\tprint((val1*val2)+m//2)", "a,b=map(int,input().split())\r\n\r\npro=a*b\r\nprint(pro//2)", "M,N=map(int, input().split())\nmulti=M*N\nx=2*1\ndomino=multi // x\nprint(domino)\n \t\t\t\t\t\t \t \t \t \t \t\t\t\t \t\t", "t,s = map(int,input().split())\np = t*s\nd = p//2\nprint(d)\n\t \t\t \t \t\t\t \t \t\t\t\t \t\t", "l,b=map(int,input().split())\r\nprint(l*b //2)", "a,b = map(int, input().split())\r\nif (a*b)%2 == 0:\r\n print(round((a*b)/2))\r\nelif (a*b)/2 < 0 :\r\n print('0')\r\nelse:\r\n print((a*b)//2)\r\n", "a,b=map(int,input().split())\r\ns = a*b\r\nprint(int(s/2))", "a,b=map(int,input().split())\r\nc=a*b\r\nif c%2==0:\r\n print(int(c/2))\r\nelse:\r\n print(int((c-1)/2))", "board = input().split(\" \")\r\narea = int(board[0]) * int(board[1])\r\n\r\ndomino = area//2\r\nprint(domino)", "# Read input from standard input\r\nM, N = map(int, input().split())\r\n\r\n# Calculate the maximum number of dominoes that can be placed\r\nmaxDominoes = (M * N) // 2\r\n\r\n# Print the result\r\nprint(maxDominoes)\r\n", "def Solution(m,n,sum=0,extra=0):\r\n \r\n smallest = min(m,n)\r\n largest = max(m,n)\r\n sum=sum\r\n extra=extra\r\n \r\n if m==0 or n==0:\r\n return sum, extra\r\n\r\n if smallest == 1:\r\n if largest % 2 == 0:\r\n \r\n sum = sum + max(m,n)/2\r\n return sum, extra\r\n \r\n else:\r\n \r\n sum = sum + (max(m,n)-1)/2\r\n extra+=1\r\n return sum, extra\r\n \r\n \r\n \r\n if smallest > 1:\r\n tsum, textra = Calculate_square(smallest)\r\n sum+=tsum\r\n extra+=textra\r\n \r\n tsum, textra = Solution(smallest,largest-smallest,sum,extra)\r\n sum = tsum\r\n extra = textra\r\n \r\n if m == n:\r\n return sum, extra \r\n \r\n return sum, extra\r\ndef Calculate_square(x):\r\n if x % 2 == 0:\r\n return (x * x / 2), 0\r\n \r\n else:\r\n return (((x-1) * (x-1) / 2) + (x-1)), 1\r\n\r\n\r\nn, m = input().split(' ')\r\nn = int(n)\r\nm = int(m)\r\n\r\nsum , extra = Solution(m,n)\r\nextra = extra / 2 if extra > 1 else 0\r\n\r\nprint(int(sum + extra))", "n = list(map(int, input().split(\" \")))\r\nm = n[0] * n[1]\r\nprint(m // 2)", "def res(n, m): \r\n return m * (n // 2) + (n % 2) * (m // 2) \r\n\r\nn, m = map(int, input().split())\r\nprint(max(res(n,m), res(m,n)))", "M, N = input().split()\r\n\r\narea_size = int(M) * int(N)\r\ncount_domino = area_size // 2\r\nprint(count_domino)", "x = list(map(int, input().split(' ')))\r\nres = 0\r\nmax = int(x[0]) * int(x[1])\r\nwhile(max > 1):\r\n res += 1\r\n max -= 2\r\nprint(res)\r\n", "def main():\r\n m,n = [int(y) for y in input().split()]\r\n counter = (m*n)//2\r\n print(counter)\r\n \r\nif __name__==\"__main__\": main()", "\r\n\r\nk, l = map(int, input().split())\r\nif k == 1 and l == 1:\r\n print(0)\r\nelse:\r\n print(int(k * l) // 2)", "from sys import stdin, stdout\r\n\r\nn, m = map(int, stdin.readline().split())\r\nstdout.write(str((n * m) // 2))", "a=input().split()\r\nl=int(a[0])\r\nw=int(a[1])\r\narea=l*w\r\nprint(area//2)", "from math import *\r\nm,n=input().split()\r\nm,n=int(m),int(n)\r\nmulti=m*n\r\nresult=floor(multi/2)\r\nprint(result)", "m, n = map(int, input().split())\r\nk = (n // 2) * m \r\nif n * m > k * 2:\r\n k += (m // 2)\r\nprint(k)\r\n", "a = list(map(int, input().split()))\r\nprint((a[0] * a[1])//2)", "strane = input().split(' ')\r\n\r\na = int(strane[0])\r\nb = int(strane[1])\r\n\r\nbrojDomina = (a * b) // 2\r\n\r\nprint(brojDomina)\r\n", "\r\n\r\n\r\n\r\n\r\nx = input().split()\r\n\r\n\r\nx[0] = int(x[0])\r\nx[1] = int(x[1])\r\n\r\n\r\nif (x[0] % 2 == 0) and (x[1] % 2 == 0) or (((x[0] % 2 == 0) and (x[1] % 2 == 1)) or ((x[0] % 2 == 1) and (x[1] % 2 == 0))):\r\n print(int((x[0] * x[1])/2))\r\nelif (x[0] % 2 == 1) and (x[1] % 2 == 1):\r\n print(int(((x[0] * x[1])-1)/2))", "from math import floor as fl\ng= input().split()\nM= int(g[0])\nN= int(g[1])\n\nprint(fl((M* N)/ 2))\n", "a=input().split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nprint (a[0]*a[1]//2)", "x=input().split(' ')\r\nm=int(x[0])\r\nn=int(x[1])\r\nareaavailable=m*n\r\ny=areaavailable%2\r\nif(y==0):\r\n noofdomino=int(areaavailable/2)\r\nelse:\r\n evenarea=areaavailable-1\r\n noofdomino=int(evenarea/2)\r\nprint(noofdomino)\r\n", "board = str(input())\r\nboard = board.split()\r\nboards = [int(i) for i in board]\r\n\r\nrec = boards[0] * boards [1]\r\n\r\ndomino = rec / 2\r\n\r\nprint(int(domino))", "lst = input().split(\" \")\r\nn = int(lst[0])\r\nm = int(lst[1])\r\nprint((m*n)//2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 21 15:20:24 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\ninp = input().split()\r\nm = int(inp[0])\r\nn = int(inp[1])\r\n\r\nif (m*n) % 2 == 1:\r\n print(int((m*n - 1) / 2))\r\nelif (m*n) % 2 == 0:\r\n print(int(m*n / 2))", "M,N =tuple(map(int,input().split()))\r\ncol_wise=(N*(M//2))+((M%2)*(N//2))\r\nrow_wise=(M*(N//2))+((N%2)*(M//2))\r\nprint(max(col_wise,row_wise))", "a = list(map(int,input().split()))\r\nb=a[0]\r\nc=a[1]\r\nd=(b*c)/2\r\ne=int(d)\r\nprint(e)", "m,n=map(int,input().split())\r\nans=m*n//2\r\nprint(ans)", "m,n=list(map(int,input().split()))\nx=(m*n)//2\nprint(x)#18\n\t\t\t\t \t\t\t\t \t \t \t\t \t\t \t\t \t\t", "m,n=map(int,input().split())\nans=m*n\nprint(ans//2)\n \t\t \t\t \t \t\t\t \t\t\t \t \t \t\t \t", "a,b=map(int, input().split())\r\nk=(a*b)//2\r\nprint(k)", "# Read the board dimensions M and N\nM, N = map(int, input().split())\n\n# Calculate the maximum number of dominoes that can be placed\n# Each domino covers 2 squares, and a 2x1 board has 2 squares, so it can accommodate 1 domino\n# Therefore, the maximum number of dominoes that can be placed is half the total number of squares\nmax_dominoes = (M * N) // 2\n\n# Print the maximum number of dominoes that can be placed\nprint(max_dominoes)\n \t \t\t\t\t \t \t\t\t\t\t \t \t\t\t\t\t", "def domino(x,y):\r\n return (x*y)//2\r\nI=input()\r\nl=I.split(\" \")\r\nx=int(l[0])\r\ny=int(l[1])\r\nprint(domino(x,y))", "s,b=map(int,input().split())\r\nprint(int((s*b)/2))", "import math \r\nm,n=map(int,input().split())\r\nprint(int(math.floor(m*n)/2))", "m,n = map(int, input().split())\r\nif m%2==0:\r\n print(int(n*m/2))\r\nelse:\r\n print(int(n*(m//2)+n//2))", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\n\r\narea=x*y\r\n\r\nprint(area//2)", "m,n = map(int, input().split())\ntotal_square = m * n\nmax_dominoes = total_square // 2\nprint(max_dominoes)\n\t\t \t \t\t \t \t\t\t\t\t\t \t\t", "x, y = input().split()\r\nz = int(x)*int(y)/2\r\nprint(int(z))\r\n", "n,m=input().split()\nn=int(n)\nm=int(m)\n\nresult = int(n*m)\ncount = 0 \nwhile result > 1:\n\tresult -= 2 \n\tcount += 1\nprint(count)\n\t\t\t \t \t \t \t \t \t\t \t\t", "\r\nm,n = map(int,input().split())\r\nprint(((m*n)//2))\r\n", "m,n=map(int,input().split())\r\nl=int(m*n/2)\r\nprint(l)\r\n", "m,n = input().split()\r\nm = int(m)\r\nn = int(n)\r\n\r\ns = (m*n)//2\r\nprint(s)\r\n", "x,y = [int(x) for x in input().split()]\nif (x*y)%2 == 0:\n print(int((x*y)/2))\nelse:\n print(int((x*y-1)/2))", "a = input().split()\nprint(int((int(a[0])*int(a[1])) / 2))", "n, m = list(map(int,input().split()))\nres = n*m\nprint(res//2)\n \t\t\t\t \t \t\t \t\t \t \t \t\t\t \t \t\t\t\t\t", "m,n = map(int,input().split(\" \"))\r\n\r\nif (m*n)%2==0:\r\n print(int(m*n/2))\r\nelse:\r\n print(int((m*n-1)/2))", "b,l=map(int,input().split())\nn=0\nwhile b>=2:\n\tn=n+l\n\tb=b-2\nif b==1:\n\tn=n+l//2\nprint(n)", "m, n = map(int, input().split())\r\nif n%2 == 0: print(n//2 * m)\r\nelif m%2 == 0: print(m//2 *n)\r\nelse: print(n//2 * m + m//2)\r\n\r\n", "line = input().split()\narea = int(line[0]) * int(line[1])\nprint(area // 2)", "M,N = map(int,input().split())\r\ns = M*N\r\nprint(s//2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jun 13 21:11:49 2023\r\n\r\n@author: hritik\r\n\"\"\"\r\nx=input()\r\nlat=x.split()\r\na=[int(num) for num in lat]\r\nsm=a[0]*a[1]\r\nprint(sm//2)\r\n", "n,m=map(int,input().split())\r\nprint(n*(m//2)+(m-(m//2)*2)*n//2)", "param = input().split()\r\n\r\ntarget = int(param[0]) * int(param[1]) // 2 \r\nprint(target)", "n, k = (input()).split()\r\ns = int(n) * int(k)\r\nprint(s // 2)", "# -*- coding: utf-8 -*-\n\"\"\"Domino Piling.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1yxDjsI5Fc49oURB85xOfY_9B-NdfZ4IY\n\"\"\"\n\n#Domino_Piling\n\nM, N = map(int, input().split( ))\ndominos_piling_in_rectangular_board = \"n\"\nn = (M*N)//2\nprint(n)", "m,n = [int(i) for i in input().split()]\r\nif m and n <= 1:\r\n print(\"0\")\r\nelif m%2==0 and n%2==0:\r\n print(int(m*n/2))\r\nelif m%2!=0 and n%2!=0:\r\n print((m*n)//2)\r\nelse:\r\n print(int(m*n/2))", "M, N = map(int, input().split())\ntotalsquares = M * N\nmaxdominoes = totalsquares // 2\nprint(maxdominoes)\n\n \t\t\t\t\t \t\t \t\t\t\t \t \t\t\t \t", "M,N=map(int,input().split())\r\nx=M*N\r\nif x < 2:\r\n print(\"0\")\r\nelif x % 2 == 0:\r\n print(int(x/2))\r\nelse:\r\n print(int(x/2))", "m, n = map(int, input().split())\r\n\r\nif m % 2 and n % 2:\r\n print((m*n - 1) // 2)\r\nelse:\r\n print(m*n//2)", "# Domino Piling \n\n\"\"\" \nQuestion : Rectangular board M x N squares\n A domino of 2 x 1 squares \n \n Can rotate the pieces\n\n print the maximum possible number of dominos \n No dominos overlab\n\n\n\n\"\"\"\n\nMN = map(int,input().split())\nMN = list(MN)\n# it will return a list\n# where i0 will length and i1 breadth \n\n# taking large side and calculatng how many domino can we fit\narea = MN[0] * MN[1]\nif area < (2*1): \n print(0)\n exit()\n\n\nlarge_side = max(MN)\nsmall_side = min(MN)\n\n\n# calculating in one row \ndef dominos(l_s,s_s):\n one_row = (l_s//2)\n t_w_col = one_row * s_s\n return t_w_col\n\n\nn_dominos = dominos(large_side,small_side)+dominos(small_side,1) if large_side%2!=0 else dominos(large_side,small_side)\n\nprint(n_dominos)\n\n\n\n\n\n", "m,n=map(int,input().split())\r\nx= int((m*n)/2)\r\nprint(x)\r\n" ]

[ "\r\nimport sys\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nprint = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/570/E\r\n\r\n输入 n m (1≤n,m≤500) 和 n 行 m 列的字符矩阵，只包含小写字母。\r\n你需要从左上角的 (1,1) 出发，到达右下角的 (n,m)。\r\n每次只能向下或向右走。\r\n问：有多少条路径对应的字符串是回文串？（见右图）\r\n模 1e9+7。\r\n输入\r\n3 4\r\naaab\r\nbaaa\r\nabba\r\n输出 3\r\n解释 见右图\r\n\"\"\"\r\n\"\"\"https://codeforces.com/problemset/submission/570/209046565\r\nhttps://codeforces.com/problemset/submission/570/209046793 循环优化\r\n\r\n做法类似 741. 摘樱桃\r\n\r\n转换成两个人同时从左上和右下出发，定义 f[i][r1][r2] 表示走了 i 步，两人分别在第 r1 行和第 r2 行的方案数。这样只需要三个数就能表示坐标 (r1,c1) 和 (r2,c2)。\r\nf[0][1][n] = 1（如果 a[1][1] != a[n][m] 直接输出 0）\r\n如果 a[r1][c1] = a[r2][c2]，那么 f[i][r1][r2] = f[i-1][r1][r2] + f[i-1][r1][r2+1] + f[i-1][r1-1][r2] + f[i-1][r1-1][r2+1]，否则就是 0\r\n代码实现时，第一个维度可以去掉。\r\n\r\n最后答案按照字符串长度的奇偶性讨论。\r\n如果是奇回文串，那么答案为 sum(f[i][i])，否则答案为 sum(f[i][i]+f[i][i+1])。\"\"\"\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = RI()\r\n g = []\r\n for _ in range(n):\r\n s, = RS()\r\n g.append(s)\r\n if n == m == 1:\r\n print(1)\r\n exit()\r\n if g[0][0] != g[n - 1][m - 1]:\r\n print(0)\r\n exit()\r\n f = [[0] * n for _ in range(n)]\r\n p = [[0] * n for _ in range(n)]\r\n f[0][n - 1] = 1\r\n for i in range((n + m - 1 - 1) // 2):\r\n for x1 in range(max(0, i - m), min(n, i + 1)):\r\n # for x2 in range(min(n - 1, n - 1 - (i - m)), max(n - 1 - i - 1, -1), -1):\r\n for x2 in range(max(n - 1 - i, 0), min(n, n - (i - m))):\r\n y1 = i - x1\r\n y2 = m - 1 - (i - (n - 1 - x2))\r\n if not f[x1][x2]: continue\r\n for a1, b1 in (x1 + 1, y1), (x1, y1 + 1):\r\n if a1 >= n or b1 >= m: continue # 出界，寄\r\n for a2, b2 in (x2 - 1, y2), (x2, y2 - 1):\r\n if a2 < a1 or b2 < b1 or g[a1][b1] != g[a2][b2]: continue # 这个点必须在上个点右下方\r\n p[a1][a2] = (p[a1][a2] + f[x1][x2]) % MOD\r\n f[x1][x2] = 0 # 清空，就不用担心了\r\n f, p = p, f\r\n\r\n print(sum(sum(row) for row in f) % MOD)\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\nm, n = list(map(int, input().strip().split()))\r\ngrid = [input().strip() for _ in range(m)]\r\nMod = 10 ** 9 + 7\r\nif grid[0][0] != grid[m - 1][n - 1]:\r\n print(0)\r\n exit()\r\n\r\ndp = [[0] * m for _ in range(n)]\r\ndp[0][0] = 1\r\npre = [[0] * m for _ in range(n)]\r\nans = 0\r\nfor i in range(m):\r\n for j in range(min((m + n) // 2 - i, n)):\r\n for d in range(min(i + j + 1, m)):\r\n k = m - 1 - d\r\n l = n - 1 - (i + j - d)\r\n if k < i or l < j:\r\n continue\r\n if grid[i][j] != grid[k][l]:\r\n continue\r\n if i > 0 and l < n - 1:\r\n dp[j][d] += pre[j][d]\r\n if i > 0 and k < m - 1:\r\n dp[j][d] += pre[j][d - 1]\r\n if j > 0 and l < n - 1:\r\n dp[j][d] += dp[j - 1][d]\r\n if j > 0 and k < m - 1:\r\n dp[j][d] += dp[j - 1][d - 1]\r\n dp[j][d] %= Mod\r\n if k - i == (m + n) % 2 and l == j or l - j == (m + n) % 2 and k == i:\r\n ans += dp[j][d]\r\n ans %= Mod\r\n pre = dp\r\n dp = [[0] * m for _ in range(n)]\r\nprint(ans)", "import os,sys,collections,heapq,itertools\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce \r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd \r\nimport functools \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\ndef solution(): \r\n mod = 1000000007 \r\n m , n = readis() \r\n grid = [reads() for _ in range(m)] \r\n for d in range((m+n)//2):\r\n if not d:\r\n F = [[0] * (_+2) for _ in range(m+1)]\r\n if grid[0][0] == grid[-1][-1]: \r\n F[m-1][0] = 1 \r\n else : \r\n for i2 in range(m):\r\n for i1 in range(i2,-1,-1):\r\n j1 , j2 = d - i1 , m+n-2-d-i2 \r\n if 0<=j1<=j2<n and grid[i1][j1] == grid[i2][j2] and not(m+n-1&1 and d == (m+n)//2 -1 and i1 != i2) : \r\n F[i2][i1] = (F[i2+1][i1-1] + F[i2][i1-1] + F[i2+1][i1] + F[i2][i1]) % mod \r\n else : F[i2][i1] = 0\r\n print(sum(sum(v) for v in F) % mod)\r\nfor i in range(1 ):\r\n solution() ", "import math\r\nimport sys\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom random import *\r\nfrom string import *\r\nfrom types import GeneratorType\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\nMOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n n, m = mint()\r\n g = []\r\n for _ in range(n):\r\n g.append(list(input()))\r\n \r\n if g[0][0] != g[-1][-1]:\r\n print(0)\r\n return\r\n\r\n dp = [[0] * (n + 2) for _ in range(n + 1)]\r\n dp[1][n] = 1\r\n for i in range(1, (n + m - 2) // 2 + 1): # step: i\r\n for r1 in range(min(n, i + 1), max(0, i - m + 1), -1):\r\n c1 = i + 2 - r1\r\n for r2 in range(max(1, n - i), min(n + 1, n - i + m)):\r\n c2 = m - i + n - r2\r\n if g[r1 - 1][c1 - 1] == g[r2 - 1][c2 - 1]:\r\n dp[r1][r2] = (dp[r1][r2] + dp[r1][r2 + 1] + dp[r1 - 1][r2] + dp[r1 - 1][r2 + 1]) % MOD\r\n else:\r\n dp[r1][r2] = 0\r\n \r\n if (n + m) & 1:\r\n ans = sum(dp[i][i] + dp[i][i + 1] for i in range(1, n + 1)) % MOD\r\n else:\r\n ans = sum(dp[i][i] for i in range(1, n + 1)) % MOD\r\n\r\n '''\r\n ans = 0\r\n\r\n q = deque([(0, 0, n - 1, m - 1)])\r\n while q:\r\n x1, y1, x2, y2 = q.popleft()\r\n for nx1, ny1 in (x1 + 1, y1), (x1, y1 + 1):\r\n for nx2, ny2 in (x2 - 1, y2), (x2, y2 - 1):\r\n if nx1 > nx2 or ny1 > ny2 or g[nx1][ny1] != g[nx2][ny2]: continue\r\n if (nx1 == nx2 and ny1 == ny2) or (nx1 == nx2 and ny1 + 1 == ny2) or (nx1 + 1 == nx2 and ny1 == ny2): ans = (ans + 1) % MOD\r\n else: q.append((nx1, ny1, nx2, ny2))\r\n '''\r\n\r\n print(ans)\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache\r\nfrom math import factorial, comb, sqrt, gcd, lcm, log2\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef main():\r\n MOD = 10**9 + 7\r\n m, n = map(int, input().split())\r\n mat = []\r\n for _ in range(m):\r\n s = input()[:-1]\r\n mat.append(s)\r\n if mat[0][0] != mat[-1][-1]:\r\n print(0)\r\n return\r\n # print(mat)\r\n # dp[i][j][k] 表示 左端点在第 i 行，右端点在第 j 行, 当前走第 k 个单元格的回文串的个数\r\n dp = [[[0] * m for _ in range(m)] for i in range(2)]\r\n dp[0][0][m - 1] = 1\r\n if (m + n - 1) % 2 == 0:\r\n step = (m + n - 1) // 2\r\n else:\r\n step = (m + n - 1) // 2 + 1\r\n ans = 0\r\n for k in range(step):\r\n if k == step - 1:\r\n # print(dp[k % 2])\r\n for i in range(m):\r\n ans = (ans + sum(dp[k % 2][i])) % MOD\r\n continue\r\n for i in range(m):\r\n for j in range(i, m):\r\n dp[(k + 1) % 2][i][j] = 0\r\n for i in range(m):\r\n for j in range(i, m):\r\n if dp[k % 2][i][j] == 0:\r\n continue\r\n one_col = k - i\r\n two_col = m + n - 2 - j - k\r\n if 0 <= one_col and one_col <= two_col and two_col < n:\r\n if one_col < two_col:\r\n # 考虑第一步往右移\r\n if j > i and mat[i][one_col + 1] == mat[j - 1][two_col]:\r\n # 第二步往上移\r\n dp[(k + 1) % 2][i][j - 1] = (dp[(k + 1) % 2][i][j - 1] + dp[k % 2][i][j]) % MOD\r\n if two_col - one_col >= 2 and mat[i][one_col + 1] == mat[j][two_col - 1]:\r\n # 第二步往左移\r\n dp[(k + 1) % 2][i][j] = (dp[(k + 1) % 2][i][j] + dp[k % 2][i][j]) % MOD\r\n if i < j:\r\n # 考虑第一步往下移\r\n if j - i >= 2 and mat[i + 1][one_col] == mat[j - 1][two_col]:\r\n # 第一步往上移\r\n dp[(k + 1) % 2][i + 1][j - 1] = (dp[(k + 1) % 2][i + 1][j - 1] + dp[k % 2][i][j]) % MOD\r\n if two_col > one_col and mat[i + 1][one_col] == mat[j][two_col - 1]:\r\n # 第二步往左移\r\n dp[(k + 1) % 2][i + 1][j] = (dp[(k + 1) % 2][i + 1][j] + dp[k % 2][i][j]) % MOD\r\n\r\n # print(dp[k % 2])\r\n print(ans % MOD)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "n , k = [int(x) for x in input().split()]\r\n\r\ncords = [int(x) for x in input().split()]\r\n\r\ncounter = 1\r\nfor e in range(k):\r\n changed = False\r\n while not changed:\r\n if cords[counter] - cords[counter - 1] > 1 and cords[counter] - cords[counter + 1] > 1:\r\n changed = True\r\n cords[counter] -= 1\r\n counter += 2\r\n\r\n[print(i , end = \" \") for i in cords]\r\n", "n,k= map(int, input().split())\r\narr =[int(x) for x in input().split()]\r\n\r\n# f = 0\r\nfor i in range(0,2*n+1):\r\n if i%2==1 and k and arr[i]>arr[i+1]+1 and arr[i]>arr[i-1]+1:\r\n k-=1\r\n print(str(arr[i]-1),end=\" \")\r\n else:\r\n print(str(arr[i]),end=\" \")", "from itertools import product\r\nfrom math import ceil, gcd, sqrt\r\nimport string\r\nfrom decimal import Decimal\r\n\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\nn, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\n\r\nfor i in range(len(array)):\r\n if not k:\r\n break\r\n if not (i + 1) % 2 and i != 0 and i != len(array) - 1:\r\n if array[i] - 1 > array[i - 1] and array[i] - 1 > array[i + 1]:\r\n array[i] -= 1\r\n k -= 1\r\n\r\nprint(*array)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(0, 2 * n + 1):\r\n if i % 2 == 1 and k and a[i] > a[i - 1] + 1 and a[i] > a[i + 1] + 1:\r\n k -= 1\r\n print(a[i] - 1, end=\" \")\r\n else:\r\n print(a[i], end=\" \")\r\n", "n,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nfor i in range(2*n+1):\r\n if i % 2:\r\n if w[i] != w[i-1] + 1 and w[i] != w[i+1] + 1:\r\n w[i] -= 1\r\n k -= 1\r\n if k == 0:\r\n break\r\nprint(*w)\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\npoints = [int(i) for i in input().split()]\r\npeaks = {}\r\nfor i in range(2 * n - 1):\r\n if points[i] < points[i + 1] and points[i + 1] > points[i + 2]:\r\n if points[i] < points[i + 1] - 1 and points[i + 1] - 1 > points[i + 2]:\r\n peaks[i + 1] = points[i + 1] - 1\r\nhigh = list(peaks.keys())\r\nselected = high[:k]\r\nfor i in range(len(points)):\r\n if i in selected:\r\n print(peaks[i], end=\" \")\r\n else:\r\n print(points[i], end=\" \")\r\n", "def main():\r\n n, k = map(int, input().split())\r\n r = [int(c) for c in input().split()]\r\n cnt = 0\r\n for i in range(1, 2*n + 1, 1):\r\n prv, peak, nxt = r[i-1], r[i], r[i+1]\r\n if peak - 1 > max(prv, nxt):\r\n cnt += 1\r\n r[i] -= 1\r\n\r\n if k == cnt:\r\n print(*r)\r\n return\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nr = list(map(int, input().split()))\r\nfor i in range(1, 2 * n + 1, 2):\r\n if max(r[i - 1], r[i + 1]) + 1 < r[i]:\r\n r[i] -= 1\r\n k -= 1\r\n if not k:\r\n break\r\nsys.stdout.write(\" \".join(map(str, r)))", "\"\"\"A. Mountain Scenery\"\"\"\r\nn, k = map(int, input().split())\r\nvals = list(map(int, input().split()))\r\n\r\nfor i in range(1, len(vals), 2):\r\n if k > 0 and vals[i] -1 > vals[i-1] and vals[i] -1 > vals[i+1]:\r\n vals[i] -= 1\r\n k -= 1\r\n if k == 0:\r\n break\r\nif \"__main__\" == __name__:\r\n print(' '.join(map(str,vals)))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(1, 2*n, 2):\r\n if not(k):\r\n break\r\n if a[i-1] < a[i]-1 > a[i+1]:\r\n a[i] -= 1\r\n k -= 1\r\n\r\nprint(*a)\r\n", "# https://codeforces.com/contest/218/problem/A\r\n# \r\n# Author: eloyhz\r\n# Date: Sep/02/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n i = 1\r\n while k > 0:\r\n if a[i - 1] < a[i] - 1 > a[i + 1]:\r\n a[i] -= 1\r\n k -= 1\r\n i += 2\r\n for x in a:\r\n print(f'{x} ', end='')\r\n print()\r\n", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\nn=2*n+1\ncount=k\ni=1\nwhile count!=0:\n\tif l[i]-1>l[i+1] and l[i]-1>l[i-1]:\n\t\tl[i]-=1\n\t\tcount-=1\n\ti+=2\n\tif i>=n:\n\t\ti=1\nprint (*l)", "n, k = map(int, input().split())\nmountains = list(map(int, input().split()))\n\nfor i in range(1, 2*n):\n if mountains[i] - 1 > mountains[i - 1] and mountains[i] - 1 > mountains[i + 1] and k > 0 and i%2 == 1:\n mountains[i] -= 1\n k -= 1\nprint(' '.join(map(str, mountains)))\n", "n, k = map(int, input().split())\r\nah = 2*n\r\nl = list(map(int, input().split()))\r\ni = 1\r\nwhile i < ah:\r\n if k == 0:\r\n break\r\n if l[i]-l[i-1] > 1 and l[i]-l[i+1] > 1:\r\n l[i] -= 1\r\n k -= 1\r\n\r\n i += 1\r\nfor j in l:\r\n print(j, end=' ')\r\n", "n,k = map(int, input().split())\r\ny = [x for x in map(int, input().split())]\r\noriginal = [x for x in y]\r\n\r\nfor i in range(2*n+1):\r\n if i%2 == 1:\r\n test = y[i] - 1\r\n if test > max(y[i-1], y[i+1]):\r\n original[i] = test\r\n k -= 1\r\n if k == 0:\r\n break\r\n\r\nprint (' '.join([str(x) for x in original]))", "x=input()\r\nxx=x.split(' ')\r\nl=[]\r\nn,k=int(xx[0]),int(xx[1])\r\nxxx=input()\r\nl=xxx.split(' ')\r\n\r\nl2=[]\r\nfor i in l:\r\n l2.append(int(i))\r\n\r\nfor i in range(1,(2 * n) + 1,2):\r\n\r\n if (l2[i] - 1)> l2[i - 1] and (l2[i] - 1) > l2[i + 1] and k > 0:\r\n k-=1\r\n l2[i] = l2[i] - 1\r\n\r\nfor i in l2:\r\n print(i,end=' ')", "n,k=[int(_) for _ in input().split()]\r\nl=[int(_) for _ in input().split()]\r\nlength=len(l)\r\nc=0\r\npre=-1\r\nnxt=-1\r\nfor i in range(length):\r\n if i==0:\r\n prev=0\r\n else:\r\n prev=l[i-1]\r\n if i==length-1:\r\n nxt=0\r\n else:\r\n nxt=l[i+1]\r\n if i%2!=0 and prev<l[i]-1 and nxt<l[i]-1:\r\n l[i]-=1 \r\n c+=1 \r\n if c==k:\r\n break\r\nprint(*l)\r\n ", "def mountain(n, k, arr):\n ranges = (n*2) + 1\n for i in range(ranges):\n if (i % 2 == 1 and k and (arr[i]-1) > arr[i-1] and (arr[i]-1) > arr[i+1]):\n arr[i] -= 1\n k -= 1\n arr_aux = \" \".join(map(str, arr))\n return arr_aux\n\n\narrs = []\narrs = list(map(int, input().strip().split()))\nn = arrs[0]\nk = arrs[1]\narr = []\narr = list(map(int, input().strip().split()))\nprint(mountain(n, k, arr))\n \t\t \t\t \t \t\t\t \t \t \t\t \t\t \t\t", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn,k = li()\r\nl = li()\r\nfor i in range(1,2*n):\r\n if not k:\r\n break\r\n if l[i-1] < l[i] - 1 > l[i+1]:\r\n k -= 1\r\n l[i] -= 1\r\nprint(*l)", "a,b=map(int,input().split())\nc=list(map(int,input().split()))\nd=0\nfor i in range(1,2*a+1,2):\n\tif c[i]-1 >c[i-1] and c[i]-1>c[i+1]:\n\t\tc[i]-=1\n\t\td+=1\n\t\tif d==b:\n\t\t\tbreak\nprint(*c,sep =' ')\n", "nk = input().strip().split(' ')\r\nn = int(nk[0])\r\nk = int(nk[1])\r\n\r\npks = input().strip().split(' ')\r\npks = [int(p) for p in pks]\r\n\r\n\r\nfor i in range(1, 2*n, 2):\r\n if pks[i]-1>pks[i-1] and pks[i]-1>pks[i+1]:\r\n pks[i]-= 1\r\n k -= 1\r\n if k==0:\r\n break\r\nfor i in range(2*n+1):\r\n print(pks[i], end=' ')\r\n \r\n \r\n \r\n", "n,k = [int(i) for i in input().split()]\r\n \r\nl = [int(i) for i in input().split()]\r\nfor num in range(1,2*n):\r\n help=l[num]-1\r\n if help>l[num-1] and help>l[num+1]:\r\n l[num]=l[num]-1\r\n k-=1\r\n if not k:break\r\nfor num in l:\r\n print(num,end=' ')", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nlis=input().split()\r\nfor i in range(len(lis)):\r\n lis[i]=int(lis[i])\r\n \r\nlis1=[]\r\nfor i in range(1,2*n+1,2):\r\n if lis[i]-lis[i-1]>1 and lis[i]-lis[i+1]>1:\r\n lis1.append(i)\r\n\r\nfor j in range(k):\r\n lis[lis1[j]]-=1\r\n\r\nfor i in range(len(lis)):\r\n lis[i]=str(lis[i])\r\n\r\nprint(' '.join(lis))\r\n\r\n \r\n", "n,k = map(int,input().split())\r\npeaks = list(map(int,input().split()))\r\nfor i in range(0,2*n+1):\r\n if i%2!=0 and k:\r\n if(peaks[i-1]< peaks[i]-1 and peaks[i]-1 > peaks[i+1]):\r\n peaks[i]-=1\r\n k-=1\r\n print(peaks[i], end=\" \")", "n, k = [int(x) for x in input().split()]\r\ncoordinates = [int(x) for x in input().split()]\r\nresult = [coordinates[0]]\r\nfor i in range(1, 2*n):\r\n if coordinates[i] - 1 > coordinates[i-1] and coordinates[i]-1 > coordinates[i+1] and k > 0:\r\n result.append(coordinates[i]-1)\r\n k -= 1\r\n else:\r\n result.append(coordinates[i])\r\nresult.append(coordinates[2*n])\r\nfor i in result:\r\n print(i, end=\" \")\r\n\r\n", "n, k = map(int, input().split())\nys = list(map(int, input().split()))\nfor i in range(1, len(ys), 2):\n\tif ys[i] > ys[i-1]+1 and ys[i] > ys[i+1]+1:\n\t\tys[i] -= 1\n\t\tk -= 1\n\t\tif k == 0:\n\t\t\tbreak\nprint(' '.join(map(str, ys)))\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(1, 2 * n, 2):\r\n\tif a[i - 1] < a[i]-1 and a[i]-1 > a[i + 1] and k > 0:\r\n\t\ta[i] -= 1\r\n\t\tk -= 1\r\n\r\nprint(*a)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n,k = [int(item) for item in input().split()]\r\n arr = [int(item) for item in input().split()]\r\n\r\n for i in range(1,len(arr),2):\r\n besar = max(arr[i-1],arr[i+1])\r\n if( (arr[i]-1) > besar):\r\n if(k>0):\r\n arr[i]-=1\r\n k-=1\r\n else:\r\n break\r\n print(*arr)\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "\r\n\r\nif __name__ == '__main__':\r\n n,k = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n for i in range(1,len(l),2):\r\n if l[i]-1 > l[i-1] and l[i]-1 > l[i+1]:\r\n l[i] -= 1\r\n k -= 1\r\n if k == 0:\r\n break\r\n print(*l,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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 = map(int, input().split())\npicture = list(map(int, input().split()))\n\nc = 0\n\ni = 1\n\noriginal = picture.copy()\n\nwhile c < k and i < 2*n + 1:\n if picture[i-1] + 1 < picture[i] > picture[i + 1] + 1:\n original[i] = picture[i] - 1\n c += 1\n i += 2\n\n\nprint(' '.join(map(str, original)))\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 26 14:03:31 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 73 - CF218-DIV2A\r\n\"\"\"\r\n\r\nsz, lowerBy = map(int,input().split())\r\ntrack = 0\r\nans = [0]*(2*sz+1)\r\nfinalPic = list(map(int,input().split()))\r\nfor i in range(2*sz+1):\r\n if i%2 == 0:\r\n ans[i] = finalPic[i]\r\n else:\r\n if finalPic[i] > finalPic[i-1]+1 and finalPic[i] > finalPic[i+1]+1 and track < lowerBy:\r\n ans[i] = finalPic[i]-1\r\n track += 1\r\n else:\r\n ans[i] = finalPic[i]\r\nprint(*ans)", "n,k = [int(x) for x in input().split()]\r\nr = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if r[2*i + 1] > r[2*i] + 1 and r[2*i + 1] > r[2*i + 2] + 1:\r\n r[2*i + 1]-=1\r\n k-=1\r\n if k==0:\r\n break\r\nprint(*r)", "a,b=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nk=0\r\nfor i in range(1,len(c),2):\r\n if(k==b):\r\n break\r\n else:\r\n if(c[i]-c[i-1]>1 and c[i]-c[i+1]>1):\r\n c[i]=c[i]-1\r\n k=k+1\r\nprint(*c)", "'''\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>> বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\r\n\r\n >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@\r\n''::::::::::_^_;;;;;;;;;;;;;;;;;;;;_^_%%%%%%%%%%%%%%%%_^_@@@@@@@@@@@@@@@\r\n\r\n PROBLEM :A. Mountain Scenery\r\n SOLUTATOIN:........\r\n\r\n ========================================================================\r\n ========================================================================\r\n '''\t\t\t\r\nn, k = map(int, input().split())\r\nr = list(map(int, input().split()))\r\n \r\nfor i in range(0, 2 * n + 1):\r\n if i % 2 == 1 and k and r[i] > r[i - 1] + 1 and r[i] > r[i + 1] + 1:\r\n k -= 1\r\n print(r[i] - 1, end=\" \")\r\n else:\r\n print(r[i], end=\" \")", "import math\r\nimport sys\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\nres=list(input().split())\r\nres2=list(input().split())\r\ntest_list = [int(i) for i in res2]\r\nsl=sorted(test_list, reverse=True)\r\nm=0\r\nmp=0\r\n\r\n# for i in range(int(res[1])):\r\n \r\n# #=test_list[mp:]\r\n# m =test_list.index(sl[i])\r\n# if(test_list[m]>test_list[m+1]+1 and test_list[m]>test_list[m-1]+1 ):\r\n# test_list[m]=test_list[m]-101\r\n# #print(*test_list)\r\n# test_list = [i+100 if(i<0) else i for i in test_list ]\r\nfor i in range(2*int(res[0])):\r\n #=test_list[mp:]\r\n if(i and test_list[i]>test_list[i+1]+1 and test_list[i]>test_list[i-1]+1 and m<int(res[1]) ):\r\n test_list[i]=test_list[i]-1\r\n m=m+1\r\nsl=sorted(test_list)\r\nprint(*test_list)", "n, k = map(int, input().split())\r\ncoordinates = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(len(coordinates)):\r\n if coordinates[i - 1] + 1 < coordinates[i] > coordinates[i + 1] + 1 and count < k:\r\n coordinates[i] -= 1\r\n count += 1\r\n else:\r\n continue\r\nprint(*coordinates)\r\n", "\nn, k = map(int, input().split())\na = [int(x) for x in input().split()]\n\nj = 0\nfor i in range(2*n+1):\n if a[i] > 0 and a[i] > a[i-1] + 1 and a[i] > a[i+1] + 1:\n a[i] = a[i] - 1\n j += 1\n if j == k: break\n\n\n\n\nprint(*a)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\nj = 0\r\nfor i in range(1, 2 * n + 1, 2):\r\n if l[i] > (l[i-1] + 1) and l[i] > (l[i+1] + 1):\r\n l[i] -= 1\r\n j += 1\r\n if j == k:\r\n break\r\n\r\nprint(\" \".join(map(str, l)))\r\n", "n , k = list(map(int,input().split()))\r\nl = input().split()\r\n\r\nfor j in range(len(l)):\r\n if k !=0:\r\n if j % 2 != 0 :\r\n if int(l[j]) -1 > int(l[j-1]) and int(l[j]) -1 > int(l[j+1]):\r\n l[j]=str(int(l[j]) -1)\r\n k -=1\r\n\r\n else:\r\n break\r\nprint(' '.join(l))", "n,k = map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(1,2*n,2):\r\n if k==0:\r\n break\r\n if l[i-1]<l[i]-1 and l[i+1]<l[i]-1:\r\n l[i]-=1\r\n k-=1 \r\nprint(*l)", "n, k = map(int, input().split())\nlis = list(map(int, input().split()))\ncount = 0\nwhile k > 0:\n if count % 2 != 0 and lis[count-1] < lis[count] - 1 and lis[count+1] < lis[count] - 1:\n k = k - 1\n lis[count] = lis[count] - 1\n count = count + 1\nprint(\" \".join(str(x) for x in lis))\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nfor index in range(len(arr)-1, -1, -1):\r\n if (index + 1) % 2 == 1:\r\n continue\r\n decrease = arr[index]-1\r\n if decrease <= arr[index-1] or decrease <= arr[index+1]:\r\n continue\r\n arr[index] = decrease\r\n k -= 1\r\n if k <= 0:\r\n break\r\n\r\nfor index in range(len(arr)):\r\n print(arr[index], end=\" \")\r\nprint()", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗ \r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝ \r██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗ \r\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\r\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\r\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\r\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\r\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\n\"\"\"\r\nn, k = map(int, input().split())\r\nm = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(1, 2 * n + 1, 2):\r\n\tif m[i] - 1 > m[i - 1] and m[i] - 1 > m[i + 1]:\r\n\t\tm[i] -= 1\r\n\t\tcnt += 1\r\n\t\tif cnt == k:\r\n\t\t\tbreak\r\nprint(* m, sep = \" \")\r\n\r\n\r\n\r\n\t\r\n\t\n", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\ndef print_arr(arr):\r\n print(*arr, sep=' ')\r\n\r\nn, k = map(int, input().split())\r\ny = arr_inp()\r\n\r\nfor i in range(1, n * 2, 2):\r\n if (k == 0):\r\n break\r\n if (y[i] - y[i - 1] > 1 and y[i] - y[i + 1] > 1):\r\n y[i] -= 1\r\n k -= 1\r\nprint_arr(y)", "n, k = [int(x) for x in input().split()]\r\nv = [int(x) for x in input().split()]\r\nfor i in range(1, 2*n+1, 2):\r\n if v[i]-1 > v[i+1] and v[i]-1 > v[i-1]:\r\n v[i] -= 1\r\n k -= 1\r\n if k == 0:\r\n break\r\nprint(*v)\r\n", "n,k=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(r)//2):\r\n if c==k:\r\n break\r\n elif r[(2*i)]<r[(2*i)+1]-1>r[(2*i)+2]:\r\n r[(2*i)+1]=r[(2*i)+1]-1\r\n c=c+1\r\n \r\nprint(*r)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n", "#one day im gonna in sha allah\r\n\r\nfrom lib2to3.pgen2.token import NEWLINE\r\nimport math\r\n\r\ndef main():\r\n\r\n n, k = input().split()\r\n n = int(n) * 2 + 1\r\n k = int(k)\r\n line = input().split()\r\n\r\n for i in range(1, n-1):\r\n if(k == 0):\r\n break \r\n\r\n num = int(line[i]) - 1\r\n num2 = int(line[i+1])\r\n num3 = int(line[i-1])\r\n \r\n if(num > num2 and num > num3):\r\n line[i] = str(num)\r\n k -= 1\r\n \r\n for i in range(n):\r\n print(line[i], end = \" \")\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, k = readln()\np = list(readln())\nfor i in range(1, 2 * n + 1, 2):\n if p[i] - p[i - 1] > 1 and p[i] - p[i + 1] > 1 and k:\n p[i] -= 1\n k -= 1\nprint(*p)\n", "def check(line, i):\r\n new_value = line[i] - 1\r\n return new_value > line[i - 1] and new_value > line[i + 1]\r\n\r\n\r\nn, k = map(int, input().split(\" \"))\r\n\r\n\r\nline = [int(i) for i in input().split(\" \")]\r\n\r\nfor i in range(1, len(line), 2):\r\n if k == 0:\r\n break\r\n if check(line, i):\r\n line[i] -= 1\r\n k -= 1\r\nprint(\" \".join(str(i) for i in line))\r\n", "n, k = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\nfor i in range(1, 2 * n + 1, 2):\r\n if k == 0:\r\n break\r\n if r[i] - r[i - 1] > 1 and r[i] - r[i + 1] > 1:\r\n r[i] -= 1\r\n k -= 1\r\nprint(*r)\r\n ", "from sys import stdin\r\n\r\nn,k = map(int,stdin.readline().split())\r\n\r\nl = list(map(int,stdin.readline().split()))\r\n\r\nfor i in range(1,(2*n)):\r\n\tif l[i]>(l[i-1]+1) and l[i]>(l[i+1]+1):\r\n\t\tl[i]-=1\r\n\t\tk-=1\r\n\tif k==0:\r\n\t\tbreak\r\n\r\nfor i in l:\r\n\tprint(str(i)+\" \",end=\"\")", "n, k = map(int, input().split())\ny = list(map(int, input().split()))\n\nfor i in range(1, len(y), 2):\n if k and y[i - 1] + 1 < y[i] and y[i] > y[i + 1] + 1:\n y[i] -= 1\n k -= 1\n\nprint(*y)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor i in range(1, len(arr), 2):\r\n if (k > 0 and arr[i] - 1 > max(arr[i-1], arr[i+1])):\r\n arr[i] -= 1\r\n k -= 1\r\nprint(*arr)\r\n", "import sys\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, k = (int(i) for i in read().split())\r\n coordinates: list[int] = [int(i) for i in read().split()]\r\n for i in range(1, len(coordinates), 2):\r\n val = coordinates[i]\r\n # check if by decreasing this mountain, we still preserve the constrain\r\n if coordinates[i - 1] < val - 1 > coordinates[i + 1]:\r\n k -= 1\r\n coordinates[i] -= 1\r\n if k == 0:\r\n break\r\n print(' '.join((str(j) for j in coordinates)))\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n(n, m) = tuple(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\n\r\ni = 2\r\n\r\nwhile i < (2*n + 1):\r\n\r\n if (lst[i - 1] - 1 > lst[i - 2]) and (lst[i - 1] - 1 > lst[i]):\r\n lst[i - 1] -= 1\r\n m -= 1\r\n\r\n if m == 0:\r\n break\r\n \r\n i += 2\r\n\r\nprint(*lst)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor i in range(1, n*2+1, 2):\r\n if k == 0:\r\n break\r\n if arr[i] > arr[i-1]+1 and arr[i] > arr[i+1]+1:\r\n arr[i] -= 1\r\n k -= 1\r\nprint(*arr)", "from sys import stdin\n\nf = stdin\n#f = open('be.txt')\n\ntext = f.read().splitlines()\n\nn, k = map(int, text[0].split())\nr = list(map(int, text[1].split()))\n\nfor i in range(1, len(r)+1, 2):\n if k == 0:\n break\n if r[i]>r[i-1]+1 and r[i] > r[i+1]+1:\n k-=1\n r[i]-=1\n\nprint(\" \".join(map(str, r)))\n\t\t \t\t\t\t \t\t \t\t\t \t\t \t \t\t\t\t \t", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tn,k = map(int,input().split())\r\n\ta = list( map(int,input().split()) )\r\n\tfor i in range(len(a)-2):\r\n\t\t# print(i)\r\n\t\t# print(a)\r\n\t\tif a[i+1]-1>a[i] and a[i+1]-1>a[i+2]:\r\n\t\t\ta[i+1]-=1\r\n\t\t\tk-=1\r\n\t\t\tif k==0:\r\n\t\t\t\t# print(\"hello\")\r\n\t\t\t\tbreak\r\n\tfor x in a:\r\n\t\tprint(x,end=' ')\r\n\tprint()\r\nmain()\r\n\r\n\r\n\r\n# t= int(input())\r\n# while t:\r\n# \tmain()\r\n# \tt-=1", "n,k = map(int,input().split())\r\nl1 = list(map(int,input().split()))\r\ntry:\r\n for i in range(1,len(l1),2):\r\n if k!=0:\r\n if l1[i-1]<l1[i]-1 and l1[i]-1>l1[i+1]:\r\n l1[i]-=1\r\n k-=1\r\nexcept:\r\n pass\r\nfor i in l1:\r\n print(i,end =' ')", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(1,2*n,2):\r\n if (l[i]-1)>max(l[i-1],l[i+1]) and m>0:\r\n l[i]-=1\r\n m-=1\r\nprint(*l)", "n,k=list(map(int,input().split(\" \")))\r\nheights=list(map(int,input().split(\" \")))\r\nindex,changed=1,0\r\nwhile changed<k:\r\n if heights[index-1]<heights[index]-1 and heights[index]-1>heights[index+1]:\r\n heights[index]-=1\r\n changed+=1\r\n index += 2\r\nprint(\" \".join(map(str,heights)))", "n,k = map(int,input().split())\r\nr = list(map(int,input().split()))\r\nfor i in range(1,len(r),2):\r\n if r[i]-1 > r[i-1] and r[i]-1 > r[i+1]:\r\n r[i] -= 1\r\n k -= 1\r\n if k==0:\r\n break\r\nprint(*r)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor i in range(1, 2 * n, 2):\r\n if (arr[i] - 1) > max(arr[i - 1], arr[i + 1]) and m > 0:\r\n arr[i] -= 1\r\n m -= 1\r\nprint(*arr)", "def solve():\r\n global k\r\n for i in range(1,2*n,2):\r\n if a[i]-a[i+1]>=2 and a[i]-a[i-1]>=2:\r\n a[i]-=1;k-=1\r\n if not(k):break\r\n print(*a)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n,k=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n solve()", "def main():\n n,k = [int(i) for i in input().split()]\n pts = [int(i) for i in input().split()]\n countout = 30\n while k > 0 and countout > 0:\n countout = countout -1\n for i in range(len(pts)):\n if pts[i] > 0 and pts[i-1] < pts[i] - 1 and pts[i+1] < pts[i] -1 and k > 0:\n pts[i] = pts[i] -1\n k = k -1\n output = \"\"\n for i in range(2*n):\n ptss = str(pts[i])\n output = output + ptss + \" \"\n ptss = str(pts[2*n])\n output = output + ptss\n print(output)\n\n\nif __name__ == \"__main__\": main()", "n, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\n\r\ni = 1\r\nif p[0] > p[1]:\r\n i = 0\r\nwhile k > 0:\r\n temp = p[i] - 1\r\n if temp > p[i - 1] and temp > p[i + 1]:\r\n p[i] = temp\r\n k -= 1\r\n i += 2\r\n\r\nprint(*p)", "n, k = map(int, input().split())\ndata = list(map(int, input().split()))\nstart = 1\ni = 0\nwhile i < k:\n if data[start] - 1 > data[start + 1] and data[start] - 1 > data[start - 1]:\n data[start] -= 1\n i += 1\n start += 2\nprint(*data)\n", "n, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nl_out = []\r\nfor i in range(len(l)):\r\n if i == 0 or i == len(l) - 1:\r\n l_out.append(l[i])\r\n elif i%2 == 0:\r\n l_out.append(l[i])\r\n else:\r\n if k > 0 and l[i] - l[i-1] > 1 and l[i] - l[i+1] > 1:\r\n l_out.append(l[i] - 1)\r\n k -= 1\r\n else:\r\n l_out.append(l[i])\r\nprint(*l_out)\r\n \r\n", "n,k=list(map(int,input().split()))\r\narr=[int(i) for i in input().split()]\r\nfor i in range(2*n-1,0,-2):\r\n if k==0:\r\n break\r\n x=arr[i]-1\r\n if x>arr[i+1] and x>arr[i-1]:\r\n arr[i]=x\r\n k-=1\r\nprint(*arr)\r\n \r\n \r\n ", "n,k = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nfor i in range(len(l)-1):\r\n if max(l[i - 1], l[i + 1]) + 1 < l[i]:\r\n l[i]-=1\r\n k-=1\r\n if not k:\r\n break\r\nprint(*l)", "nb_peaks, k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nn = len(l)\r\n\r\nfor i in range(1,n,2):\r\n potential_peak = l[i] - 1\r\n if potential_peak > max(l[i - 1],l[i + 1]):\r\n k -= 1\r\n l[i] = l[i] - 1\r\n if k == 0:\r\n break\r\n\r\nprint(' '.join(map(str,l)))", "n,k = map(int,input().split())\nmounts = list(map(int,input().split()))\nfor i in range(1,2*n):\n if not k :\n continue\n if mounts[i] - mounts[i-1] <2 :\n continue\n if mounts[i] - mounts[i+1] <2 :\n continue\n k-=1\n mounts[i]-=1\nprint(*mounts)", "n, k = map(int, input().split())\r\nr = list(map(int, input().split()))\r\nchange = 0\r\nfor i in range(1, 2 * n + 1, 2):\r\n if r[i] - 1 > r[i - 1] and r[i] - 1 > r[i + 1]:\r\n r[i] -= 1\r\n change += 1\r\n if change == k:\r\n break\r\nfor j in range(2 * n + 1):\r\n print(r[j], end=' ')", "n, k = map(int, input().strip().split())\r\nys = [*map(int, input().strip().split())]\r\nnew_ys = [ y - 1 if 2 <= i + 1 <= 2 * n and not (i + 1) % 2 and ys[i - 1] < y - 1 > ys[i + 1] and k >= 1 and (k := k - 1) + 1 else y for i, y in enumerate(ys) ]\r\nprint(' '.join(str(y) for y in new_ys))", "n, k = map(int, input().split())\r\n\r\npoints = list(map(int, input().split()))\r\n\r\nc = 0\r\ni = 1\r\nwhile c < k:\r\n if points[i-1]<(points[i]-1) and (points[i]-1)>points[i+1]:\r\n points[i]-=1\r\n c+=1\r\n #print(c)\r\n i+=2\r\n\r\nprint(\" \".join(list(map(str, points))))\r\n", "n, k = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\nfor i in range(1, len(lst) - 1, 2):\r\n\tif lst[i] - lst[i - 1] > 1 and lst[i] - lst[i + 1] > 1 and k > 0:\r\n\t\tlst[i] -= 1\r\n\t\tk -= 1\r\nprint(*lst)", "inp=input().split()\r\nn=int(inp[0])\r\nk=int(inp[1])\r\n\r\ninp1=input().split()\r\nl=[]\r\nfor i in range(len(inp1)):\r\n l.append(int(inp1[i]))\r\n \r\nfor i in range(1,len(l)-1):\r\n if(l[i-1]<(l[i]-1) and (l[i]-1)>l[i+1]):\r\n l[i]=l[i]-1\r\n k=k-1\r\n if(k==0):\r\n break\r\n \r\n\r\nif(k!=0):\r\n \r\n for j in range(len(l)):\r\n if(j%2==0 and l[j]!=0):\r\n l[j]=l[j]-1\r\n k=k-1\r\n if(k==0):\r\n break\r\nfor i in range(len(l)):\r\n print(l[i],end=' ')", "n, k = map(int, input().split())\n\nH = list(map(int, input().split()))\n\nfor i, h in enumerate(H):\n if i % 2 != 0:\n if H[i] - H[i-1] > 1 and H[i] - H[i+1] > 1:\n H[i] -= 1\n k -= 1\n if k == 0:\n break\n\nfor h in H:\n print(h, end=\" \")\nprint()\n\n \n \n", "inn = list(map(int, input().split(\" \")))\nmnts = list(map(int, input().split(\" \")))\npks = inn[0]\ncngd = inn[1]\nk = []\nfor i in range(1,len(mnts)-1):\n if mnts[i] > (mnts[i-1]+1) and mnts[i] > (mnts[i+1]+1):\n k.append(i)\nfor j in range(cngd):\n mnts[k[j]] = mnts[k[j]]-1\nprint(\" \".join(map(str, mnts)))\n", "n,k = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\n\r\nc = 1\r\nwhile k > 0:\r\n if l[c-1] < l[c]-1 > l[c+1]:\r\n k -= 1\r\n l[c] -= 1\r\n c += 2\r\nprint(*l)", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(-2,-(n*2+2),-2):\r\n if lst[i]-1>lst[i+1] and lst[i]-1>lst[i-1]:\r\n lst[i]-=1\r\n count+=1\r\n if count==k:\r\n break\r\nfor j in lst:\r\n print(j,end=' ')\r\n", "line=input().split()\r\n \r\nn = int(line[0])\r\nk = int(line[1])\r\n\r\nline = input().split()\r\n\r\nl = []\r\nfor i in line:\r\n l.append(int(i))\r\n\r\nfor i in range(2*n+1):\r\n if i%2!=0:\r\n if l[i]-1>l[i-1] and l[i]-1>l[i+1] and k>0:\r\n k-=1\r\n l[i]-=1\r\n\r\nfor item in l:\r\n print(item)\r\n\r\n", "l = input().split()\nn, k = int(l[0]), int(l[1])\n\nl = [int(x) for x in input().split()]\nprint(l[0], end=\" \")\nfor i in range(1, 2*n):\n v = l[i]\n if i % 2 == 1 and k > 0 and v-1 > l[i-1] and v-1>l[i+1]:\n print(v-1, end=\" \")\n k -= 1\n else:\n print(v, end=\" \")\nprint(l[-1], end=\" \")\n\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split())) #0 5 3 5 1 5 2\r\nres=[]\r\ncount=0\r\nfor i in range(1,len(arr)-1):\r\n if arr[i]-1> arr[i-1] and arr[i]-1>arr[i+1] and count<k :\r\n res.append(arr[i]-1)\r\n count+=1\r\n else:\r\n res.append(arr[i])\r\nres= [arr[0]]+res+[arr[-1]]\r\nresult = ' '.join(str(num) for num in res)\r\nprint(result,end=\" \")\r\n\r\n", "#!/usr/bin/env python3\r\n\r\nn, k = map(int,input().split())\r\ny_points = list(map(int,input().split()))\r\n\r\nk_tot=0\r\nlast_odd = len(y_points)-2 if (len(y_points)-1)%2==0 else len(y_points)-1\r\nfor i in range(last_odd,0,-2):\r\n\tif k_tot<k:\r\n\t\tif (y_points[i]-1)>y_points[i+1] and (y_points[i]-1)>y_points[i-1]:\r\n\t\t\tk_tot += 1\r\n\t\t\ty_points[i]-=1\r\n\r\nprint(\" \".join(map(str,y_points)))", "n,k=map(int,input().split())\r\n\r\ntotal=list(map(int,input().split()))\r\ns=0\r\nfor i in range(len(total)):\r\n try:\r\n if k==0:\r\n break\r\n if i%2==1:\r\n if total[i]-1>total[i-1] and total[i]-1>total[i+1]:\r\n total[i]-=1\r\n s+=1\r\n if s==k:\r\n break\r\n except:\r\n pass\r\nprint(*total)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\narr=list(map(int,input().split()))\r\ncount=0\r\nfor index in range(1,(2*n)+1,2):\r\n if arr[index]-1>arr[index-1] and arr[index]-1>arr[index+1] and count<k:\r\n arr[index]=arr[index]-1\r\n count=count+1\r\nprint(*arr)", "n,k = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nv = n\r\nfor i in range(v):\r\n if k==0:\r\n break\r\n if l[i*2+1]-1>l[i*2] and l[i*2+1]-1>l[i*2+2]:\r\n l[i*2+1]-=1\r\n k-=1\r\nprint(*l)\r\n\r\n \r\n", "z = input().split(); n = int(z[0]); k = int(z[1])\r\nl = input().split()\r\nfor i in range(2*n+1):\r\n l[i] = int(l[i])\r\n\r\nc = 1\r\nwhile k > 0:\r\n if l[c] > l[c-1]+1 and l[c] > l[c+1]+1:\r\n l[c] = l[c]-1\r\n k -= 1\r\n c += 2\r\n else:\r\n c += 2\r\n\r\ns = ''\r\nfor i in range(2*n+1):\r\n s += str(l[i])+' '\r\n\r\nprint(s)", "from sys import stdin,stdout,exit\r\nimport math\r\nfrom fractions import gcd\r\ndef sin(): \r\n\treturn stdin.readline().rstrip()\r\ndef listInput():\r\n\treturn list(map(int,sin().split()))\r\ndef printBS(li):\r\n\tif not li: return\r\n\tfor i in range(len(li)-1):\r\n\t\tstdout.write(\"%d \"%(li[i]))\r\n\tstdout.write(\"%d\\n\"%(li[-1]))\r\nn,k=listInput()\r\nli=listInput()\r\nfor i in range(2*n+1):\r\n\tif i%2==1:\r\n\t\tif (li[i]-li[i-1])>1 and (li[i]-li[i+1])>1 :\r\n\t\t\tli[i]-=1\r\n\t\t\tk-=1\r\n\tif k==0: break\r\nprintBS(li)", "a, b=map(int, input().split())\r\nl=[int(x) for x in input().split()]\r\nd=0\r\nfor i in range(1, 2*a+1, 2):\r\n if l[i]-1>l[i-1] and l[i]-1>l[i+1]:\r\n d+=1\r\n l[i]-=1\r\n if d==b:\r\n break\r\nprint(*l)", "n, k = map(int, input().split())\r\nr = list(map(int, input().split()))\r\n\r\ncount, i = 0, 0\r\n\r\nfor i in range(len(r)):\r\n if r[i - 1] < r[i] - 1 and r[i + 1] < r[i] - 1:\r\n r[i] = r[i] - 1\r\n count += 1\r\n if count == k:\r\n break\r\n\r\nprint(\" \".join([str(each) for each in r]))\r\n", "n, k = map(int, input().strip().split())\r\npoints = list(map(int, input().strip().split()))\r\n\r\np=1\r\nwhile(p<=(2*n+1) and k>0):\r\n if((p+1)%2==0):\r\n if points[p]-1 > points[p-1] and points[p]-1 > points[p+1]:\r\n points[p] -= 1\r\n k -= 1\r\n p+=1\r\nprint(' '.join(str(e) for e in points))", "def main():\n n, k = map(int, input().split())\n a, *r = map(int, input().split())\n print(a, end=' ')\n for i, b in zip(range(0, n * 2, 2), r[1::2]):\n if a < r[i] - 1 > b:\n r[i] -= 1\n k -= 1\n if not k:\n break\n a = b\n print(*r)\n\n\nif __name__ == '__main__':\n main()\n", "n , k = map(int , input().split())\r\na = list(map(int , input().split()))\r\n\r\nfor i in range(1 , 2*n + 1):\r\n if k >= 1:\r\n if a[i] - 1 > a[i - 1] and a[i] - 1 > a[i + 1]:\r\n a[i] = a[i] - 1\r\n k = k - 1\r\n else: break\r\n\r\na = map(str , a)\r\nprint(\" \".join(a))", "n , k = map(int , input().split())\r\nl = list(map (int , input().split()))\r\ni = 1\r\nwhile k:\r\n if l[i-1] < l[i]-1 and l[i+1] < l[i]-1 :\r\n l[i]-=1\r\n k-=1\r\n i+=2\r\nprint(*l)", "n, k = tuple(map(int, input().split()))\r\nnodes = list(map(int, input().split()))\r\ni = 1\r\nif nodes[0] > nodes[1]:\r\n i = 0\r\nwhile k > 0:\r\n temp = nodes[i] - 1\r\n if temp > nodes[i - 1] and temp > nodes[i + 1]:\r\n nodes[i] = temp\r\n k -= 1\r\n i += 2\r\nprint(' '.join(map(str, nodes)), end = '')", "n, k = [int(x) for x in input().split()]\nx = [int(x) for x in input().split()]\nfor i in range(1,2*n,2):\n if x[i]-x[i-1] > 1 and x[i]-x[i+1] > 1:\n x[i] -= 1\n k -= 1\n if k==0:\n break\nprint(*x) \n\n\n", "n,k = [int(x) for x in input().split()]\r\narray = [int(x) for x in input().split()]\r\ni=0\r\nwhile k>0 and i<len(array):\r\n if (i+1)%2!=0:\r\n i+=1\r\n else:\r\n if array[i]-1>array[i-1] and array[i]-1>array[i+1]:\r\n array[i] = array[i]-1\r\n k -=1 \r\n i+=1\r\n if k==0:\r\n break\r\nfor i in array:\r\n print(i,end=\" \")", "n, k = list(map(int, input().split()))\r\npeaks = list(map(int, input().split()))\r\ni = 1\r\nwhile k:\r\n t = (peaks[i] - 1)\r\n if t > peaks[i-1] and t > peaks[i+1]:\r\n peaks[i] = peaks[i] - 1\r\n k -= 1\r\n i = i + 2\r\n\r\nprint(' '.join(list(map(str, peaks))))", "n, m = map(int, input().split())\r\ntmp = list(map(int, input().split()))\r\nfor i in range(1, 2 * n, 2):\r\n if (tmp[i] - 1) > max(tmp[i - 1], tmp[i + 1]) and m > 0:\r\n tmp[i] -= 1\r\n m -= 1\r\nprint(*tmp)", "# author: kh0i\r\n# created: 10.01.2022 11:05:59\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(1, 2*n+1, 2):\r\n if a[i] > a[i-1] + 1 and a[i] > a[i+1] + 1:\r\n a[i] = a[i] - 1\r\n k = k - 1\r\n if k == 0:\r\n break\r\n\r\nfor i in a:\r\n print(i, end = \" \")\r\n\r\n", "n,k=map(int,input().split())\r\np = list(map(int,input().split()))\r\n\r\nfor i in range(2*n+1):\r\n if k==0:\r\n break\r\n if (i+1)%2==0:\r\n if p[i]>p[i+1]+1 and p[i]>p[i-1]+1:\r\n p[i]-=1\r\n k-=1\r\nprint(*p)\r\n", "\n\nn, k = map(int, input().split())\n\ntab = [int(x) for x in input().split()]\n\ni = 1\nwhile k > 0:\n if tab[i - 1] < tab[i] - 1 and tab[i + 1] < tab[i] - 1:\n tab[i] -= 1\n k -= 1\n i += 2\n\nprint(' '.join(map(str, tab)))\n", "n,k=map(int,input().split())\r\nll=list(map(int,input().split()))\r\nfor i in range(1,(2*n)+1,2):\r\n while k>0:\r\n if ll[i]>ll[i-1]+1 and ll[i]>ll[i+1]+1:\r\n ll[i]=ll[i]-1\r\n k-=1\r\n break\r\nprint(*ll)", "n, k = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\nc=0\r\nfor i in range(2*n+1):\r\n if i%2!=0 and abs(r[i-1]-r[i]) > 1 and abs(r[i+1]-r[i]) > 1 and c != k:\r\n r[i]-=1\r\n c+=1\r\nprint(*r)", "n, k = [int(x) for x in input().split()]\r\nheights = [int(x) for x in input().split()]\r\nheights.append(heights[-1] * int(len(heights) % 2 != 0) * 2)\r\n\r\n\r\ndef still_mountain_peak(peak, left, right):\r\n new_height = peak - 1\r\n if new_height > left and new_height > right:\r\n return True\r\n return False\r\n\r\n\r\nrestored_peaks = 0\r\nfor i in range(1, 2 * n + 1, 2):\r\n current_peak = heights[i]\r\n # print(f'heights[{i}]: {heights[i]}, heights[{i - 1}]: {heights[i - 1]}, heights[{i + 1}]: {heights[i + 1]}')\r\n if still_mountain_peak(heights[i], heights[i - 1], heights[i + 1]):\r\n heights[i] -= 1\r\n restored_peaks += 1\r\n if restored_peaks == k:\r\n break\r\nheights.pop(-1)\r\n[print(height, end=' ') for height in heights]", "n, k = map(int, input().split())\n\narr = list(map(int, input().split()))\n\ncount = k\n\ni = 0\n\nwhile i < n and count > 0:\n curr = (2*i)+1\n\n res = arr[curr]-1\n\n if res > arr[curr-1] and res > arr[curr+1]:\n arr[curr]-=1\n count-=1\n \n i+=1\n\nprint(*arr)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\ncount = 0\nz = 2 * n + 1\nfor i in range(1, z, 2):\n if (arr[i] - 1 > arr[i+1] and arr[i] - 1 > arr[i-1]):\n arr[i] -= 1\n count += 1\n\n if count == k:\n break\n\nfor i in arr:\n print(i, end=' ')\nprint()\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nr = 0\r\nfor i in range(1,2*n+1,2):\r\n \tif a[i-1] < a[i]-1 and a[i]-1 > a[i+1]:\r\n \t\ta[i] = a[i] - 1\r\n \t\tr = r + 1\r\n \tif r == k:\r\n \t\tbreak\r\nprint(*a)", "n,k=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nfor i in range(1,2*n,2):\r\n if l[i]-1>max(l[i-1],l[i+1]) and k>0:\r\n l[i]-=1\r\n k-=1\r\nprint(*l)", "import sys\nimport math\ninput = sys.stdin.readline\n\nn, m = map(int, input().strip().split())\na = list(map(int, input().strip().split()))\nfor i in range(1, 2 * n):\n if m and i % 2 and a[i] - 1 > a[i - 1] and a[i] - 1 > a[i + 1]:\n a[i] -= 1\n m -= 1\nfor i in range(0, 2 * n + 1): print(a[i], end = ' ')\n\n\n", "n, k = list(map(int, input().split()))\r\n\r\npeaks = list(map(int, input().split()))\r\n\r\ni = 1\r\nwhile k > 0:\r\n if peaks[i - 1] < peaks[i] - 1 and peaks[i] - 1 > peaks[i + 1]:\r\n peaks[i] -= 1\r\n k -= 1\r\n i += 2\r\n\r\nprint(*peaks)", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn, k = map(int, inpu().split())\r\nlis = list(map(int, inpu().split(' ')))\r\ncount = 0\r\nfor i in range(1, 2*n, 2) :\r\n if lis[i] - 1 > lis[i + 1] and lis[i] - 1 > lis[i - 1] :\r\n lis[i] -= 1\r\n count += 1\r\n if count == k :\r\n break\r\nprin(' '.join(map(str, lis)) + '\\n')", "I = lambda: map(int, input().split())\r\n\r\n_, k = I()\r\nR = list(I())\r\ni = 1\r\n\r\nfor _ in range(k):\r\n while not R[i-1]+1 < R[i] > R[i+1]+1:\r\n i += 2\r\n R[i] -= 1\r\n i += 2\r\n\r\nprint(*R)", "n, k = map(int, input().split())\r\npeaks = [int(hight) for hight in input().split()]\r\nfor i in range(1, 2*n, 2):\r\n if peaks[i - 1] < peaks[i] - 1 > peaks[i + 1]:\r\n peaks[i] -= 1\r\n k -= 1\r\n if k == 0:\r\n break\r\nprint(*peaks)", "import math\r\nimport time\r\nimport random\r\n\r\nn, k = map(int, input().split(' '))\r\narray = list(map(int, input().split(' ')))\r\n\r\nd = 0\r\nfor i in range(len(array)):\r\n if i%2 == 1:\r\n if array[i]-1>array[i+1] and array[i]-1>array[i-1]:\r\n d+=1\r\n array[i]-=1\r\n if d == k:\r\n break;\r\n\r\nprint(array.__str__().replace(']', '').replace('[', '').replace(',', ''))", "n, k = map(int, input().split())\r\ntemp = list(map(int, input().split()))\r\nfor i in range(1, 2 * n, 2):\r\n if k != 0:\r\n if temp[i] != 1 and temp[i] != 0 and (temp[i] - 1) != temp[i - 1] and (temp[i] - 1) != temp[i + 1]:\r\n temp[i] -= 1\r\n k -= 1\r\n else:\r\n break\r\nprint(*temp, sep=' ')\r\n\r\n", "n, k = map(int, input().split())\npoints = list(map(int, input().split()))\n\ncount = 0\nfor i in range(2*n + 1):\n if i % 2 == 0:\n continue\n else:\n temp = points[i] - 1\n if temp > points[i-1] and temp > points[i+1]:\n points[i] = temp\n count += 1\n\n if count == k:\n break\n\npoints = [str(elem) for elem in points]\nprint(\" \".join(points))\n \t\t \t \t\t \t \t \t \t\t \t \t\t\t\t", "n, k = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\nct = 0\r\n#print(l)\r\nfor i in range(1, 2*n+1, 2):\r\n tt = l[i]-1\r\n if tt>l[i-1] and tt>l[i+1]:\r\n l[i] = tt\r\n ct+=1\r\n #print(l, ct)\r\n if ct==k:\r\n break\r\nans = ''\r\nfor i in range(2*n+1):\r\n ans+=str(l[i])+' '\r\nprint(ans)", "\r\nn,x=map(int,input().rstrip().split())\r\narr=list(map(int,input().rstrip().split()))\r\nfor i in range(1,2*n,2):\r\n if (arr[i]-1)>max(arr[i-1],arr[i+1]) and x>0:\r\n arr[i]-=1\r\n x-=1\r\nprint(*arr)", "def yzd_solution(n ,k ,verticies):\r\n\r\n\r\n for i in range(1, len(verticies), 2):\r\n if ((verticies[i-1] != verticies[i]-1) and (verticies[i+1] != verticies[i]-1)):\r\n verticies[i] -= 1\r\n k -= 1\r\n if k == 0: break\r\n \r\n print(\" \".join(map(str, verticies)))\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\nverticies = list(map(int, input().split())) \r\nyzd_solution(n,k,verticies)", "n,k = map(int,input().split())\ns = list(map(int,input().split()))\n#print(s,a)\nfor i in range(n):\n if (s[2*i+1]-1)>max(s[2*i],s[2*i+2]):\n s[2*i+1] -= 1\n k -=1\n if k==0:\n print(' '.join(map(str,s)))\n exit(0)", "#Q45 Mountain Scenery\r\nn, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nfor i in range(len(lst)-1,0,-1):\r\n \r\n if i % 2 == 0:\r\n continue\r\n mns = lst[i]-1\r\n \r\n if mns <= lst[i-1] or mns <= lst[i+1]:\r\n continue\r\n \r\n lst[i] = mns\r\n k -= 1\r\n if k <= 0:\r\n break\r\n\r\nprint(*lst)", "x = input()\r\nl = x.split()\r\nn = int(l[0])\r\nk = int(l[1])\r\nch = 0\r\nz = input()\r\nl2 = z.split()\r\n\r\nfor i in range(len(l2)-2 , 0 , -2):\r\n if int(l2[i])-1 > int(l2[i-1]) and int(l2[i])-1 > int(l2[i+1]):\r\n a = int(l2[i])\r\n a -= 1 \r\n l2[i] = a\r\n ch += 1 \r\n if ch == k :\r\n break \r\n \r\n \r\n \r\n \r\nfor i in l2:\r\n print(i , end = \" \")", "n,k=map(int,input().split())\r\n\r\nL=list(map(int,input().split()))\r\n\r\nfor i in range(1,len(L),2):\r\n if(L[i]-1>L[i-1] and L[i]-1>L[i+1] and k>0):\r\n k-=1\r\n L[i]-=1\r\nfor i in range(len(L)):\r\n if(i==len(L)-1):\r\n print(L[i])\r\n else:\r\n print(L[i],end=\" \")\r\n", "n, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\n\r\nfor i in range(1, len(t) - 1):\r\n x = t[i] - 1\r\n if t[i - 1] < x and t[i + 1] < x:\r\n t[i] = x\r\n k -= 1\r\n if not k: break\r\nprint(' '.join(str(i) for i in t))", "n, k = map(int, input().split())\r\nthe_list = list(map(int, input().split()))\r\nfor i in range(1, len(the_list)):\r\n if (\r\n the_list[i] - the_list[i - 1] >= 2\r\n and the_list[i] - the_list[i + 1] >= 2\r\n and k > 0\r\n ):\r\n the_list[i] -= 1\r\n k -= 1\r\nprint(\" \".join(list(map(str, the_list))))" ]

[ "I = lambda:list(map(int, input().split()))\r\nn,x1,x2 = I()\r\nservers = I()\r\nidx = list(range(n))\r\nidx.sort(key = lambda i : servers[i])\r\n\r\ndef solve(a, b, rev):\r\n j = len(idx)-1\r\n while j >= 0 and (n-j)*servers[idx[j]] < b:\r\n j -= 1\r\n if j < 0:\r\n return\r\n i = j-1\r\n while i >= 0 and (j-i)*servers[idx[i]] < a:\r\n i -= 1\r\n if i < 0:\r\n return\r\n print(\"Yes\")\r\n if not rev:\r\n print(j-i, n-j)\r\n print(\" \".join(map(lambda x:str(x+1),idx[i:j])))\r\n print(\" \".join(map(lambda x:str(x+1), idx[j:])))\r\n else:\r\n print(n-j, j-i)\r\n print(\" \".join(map(lambda x:str(x+1), idx[j:])))\r\n print(\" \".join(map(lambda x:str(x+1),idx[i:j])))\r\n exit()\r\n\r\nsolve(x1,x2,False)\r\nsolve(x2,x1,True)\r\nprint(\"No\")\r\n", "import sys\nfrom collections import namedtuple\n\n\nif not __debug__:\n sys.stdin = open(\"hack.txt\")\n\ninput = sys.stdin.readline\n\nServer = namedtuple(\"Server\", [\"index\", \"value\"])\n\ndef solve(n, x1, x2, servers):\n C = [Server(i+1, v) for i, v in enumerate(servers)]\n C.sort(key=lambda x: x.value, reverse=True)\n\n flag = False\n for i in range(n-1):\n cnt = i+1\n k = x1 // cnt\n if x1 % cnt != 0:\n k += 1\n \n if C[i].value >= k:\n for j in range(i+1, n):\n cnt1 = j - i\n k1 = x2 // cnt1\n if x2 % cnt1 != 0:\n k1 += 1\n if C[j].value >= k1:\n flag = True\n print(\"Yes\")\n print(cnt, cnt1)\n for x in range(cnt):\n print(C[x].index, end=' ')\n print()\n for x in range(cnt, cnt+cnt1):\n print(C[x].index, end = ' ')\n print()\n break\n break\n\n if not flag:\n for i in range(n-1):\n cnt = i+1\n k = x2 // cnt\n if x2 % cnt != 0:\n k += 1\n \n if C[i].value >= k:\n for j in range(i+1, n):\n cnt1 = j - i\n k1 = x1 // cnt1\n if x1 % cnt1 != 0:\n k1 += 1\n if C[j].value >= k1:\n flag = True\n print(\"Yes\")\n print(cnt1, cnt)\n for x in range(cnt, cnt+cnt1):\n print(C[x].index, end = ' ')\n print()\n for x in range(cnt):\n print(C[x].index, end=' ')\n print()\n break\n break\n if not flag:\n print(\"No\")\n return 0\n \n \n\nif __name__ == \"__main__\":\n n, x1, x2 = list(map(int, input().split(' ')))\n servers = list(map(int, input().split(' ')))\n\n res = solve(n, x1, x2, servers)\n\n", "n, a, b = [int(x) for x in input().split()]\r\n\r\nhs = [int(x) for x in input().split()]\r\n\r\nhs = sorted(enumerate(hs), key=lambda x: x[1])\r\n\r\nfor i in range(1, n+1):\r\n if hs[-i][1] * i >= a:\r\n break\r\nelse:\r\n print('No')\r\n exit()\r\n\r\nfor j in range(i+1, n+1):\r\n if hs[-j][1] * (j - i) >= b:\r\n print('Yes')\r\n print(i, j - i)\r\n print(\" \".join(map(str, [index+1 for index,_ in hs[-i:]])))\r\n print(\" \".join(map(str, [index+1 for index,_ in hs[-j:-i]])))\r\n break\r\nelse:\r\n for i in range(1, n+1):\r\n if hs[-i][1] * i >= b:\r\n break\r\n else:\r\n print('No')\r\n exit()\r\n \r\n for j in range(i+1, n+1):\r\n if hs[-j][1] * (j - i) >= a:\r\n print('Yes')\r\n print(j - i, i)\r\n print(\" \".join(map(str, [index+1 for index,_ in hs[-j:-i]])))\r\n print(\" \".join(map(str, [index+1 for index,_ in hs[-i:]])))\r\n break\r\n else:\r\n print('No')\r\n", "import sys\nif locals()['__file__'][-2:] == 'py':\n sys.stdin = open('in.txt', 'r')\nrd = lambda: map(int, input().split())\nn, x1, x2 = rd()\na = list(rd())\nb = list(zip(a, range(n)))\nb.sort()\nc, rank = zip(*b)\nrank = list(rank)\nl, r = 0, 0\ndef check(x, y):\n global l\n global r\n i = n - 1\n while i and (n - i) * a[rank[i]] < y:\n i -= 1\n if i == -1:\n return 0\n j = i - 1\n while j >= 0 and (i - j) * a[rank[j]] < x:\n j -= 1\n l = j\n r = i\n return j != -1\nif check(x1, x2):\n print('Yes')\n print(r - l, n - r)\n res = []\n for i in range(l, r):\n res.append(rank[i] + 1)\n print(*res)\n res = []\n for i in range(r, n):\n res.append(rank[i] + 1)\n print(*res)\n exit()\nif check(x2, x1):\n print('Yes')\n print(n - r, r - l)\n res = []\n for i in range(r, n):\n res.append(rank[i] + 1)\n print(*res)\n res = []\n for i in range(l, r):\n res.append(rank[i] + 1)\n print(*res)\n exit()\nprint('No')\n", "# python3\n\ndef readline(): return tuple(map(int, input().split()))\n\n\ndef ceil_div(num, den): return (num - 1) // den + 1\n\n\ndef main():\n n, x1, x2 = readline()\n c = readline()\n\n xx = (x1, x2)\n\n servers = sorted(enumerate(c, start=1), key=lambda p: p[1])\n for (i, a) in enumerate(servers):\n for (j, x) in enumerate(xx):\n kj = ceil_div(x, a[1])\n if i + kj < n and (n - i - kj) * servers[i + kj][1] >= sum(xx) - x:\n print(\"Yes\")\n l1 = servers[i:i+kj]\n l2 = servers[i+kj:]\n if j: l1, l2 = l2, l1\n print(len(l1), len(l2))\n print(\" \".join(str(d[0]) for d in l1))\n print(\" \".join(str(d[0]) for d in l2))\n return\n print(\"No\")\n\n\nmain()\n\n\n\n\n# Made By Mostafa_Khaled", "import sys\r\n\r\n\r\nn,x1,x2=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n a[i]=[a[i],i+1]\r\na.sort()\r\n#print(a)\r\nfor i in range(1,n+1):\r\n if(a[n-i][0]*(i)>=x1):\r\n break\r\npt=i\r\n#print(pt)\r\nans=-1\r\nfor i in range(pt+1,n+1):\r\n if(a[n-i][0]*(i-pt)>=x2):\r\n ans=i\r\n break\r\n\r\nif(ans!=-1):\r\n print('Yes')\r\n print(pt,ans-pt)\r\n b=[]\r\n c=[]\r\n for i in range(n-1,n-1-pt,-1):\r\n b.append(a[i][1])\r\n for i in range(n-1-pt,n-1-ans,-1):\r\n c.append(a[i][1])\r\n print(*b)\r\n print(*c)\r\n sys.exit()\r\n\r\nfor i in range(1,n+1):\r\n if(a[n-i][0]*(i)>=x2):\r\n break\r\npt=i\r\nans=-1\r\nfor i in range(pt+1,n+1):\r\n if(a[n-i][0]*(i-pt)>=x1):\r\n ans=i\r\n break\r\n#print(pt)\r\nif(ans!=-1):\r\n print('Yes')\r\n print(ans-pt,pt)\r\n b=[]\r\n for i in range(n-1-pt,n-1-ans,-1):\r\n b.append(a[i][1])\r\n c=[]\r\n for i in range(n-1,n-1-pt,-1):\r\n c.append(a[i][1])\r\n print(*b)\r\n print(*c)\r\n sys.exit()\r\nprint('No')\r\n\r\n\r\n\r\n", "n, x1, x2 = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nc = [(ci, i) for i, ci in enumerate(c)]\r\nc.sort(reverse=True)\r\n\r\n\r\ndef check(x1,x2,reverse=False):\r\n sum1 = sum2 = 0\r\n i = i1 = i2 = 0\r\n\r\n while i < len(c):\r\n sum1 += c[i][0]\r\n i += 1\r\n if sum1 >= x1 and 1.0*x1/i <= c[i-1][0]: break\r\n i1 = i\r\n \r\n if i1 == n: return False\r\n \r\n while i < len(c):\r\n sum2 += c[i][0]\r\n i += 1\r\n if sum2 >= x2 and 1.0*x2/(i-i1) <= c[i-1][0]:\r\n print('Yes')\r\n if reverse:\r\n print(i-i1, i1)\r\n print(' '.join(map(str, [ci[1]+1 for ci in c[i1:i]])))\r\n print(' '.join(map(str, [ci[1]+1 for ci in c[:i1]])))\r\n else:\r\n print(i1, i-i1)\r\n print(' '.join(map(str, [ci[1]+1 for ci in c[:i1]])))\r\n print(' '.join(map(str, [ci[1]+1 for ci in c[i1:i]])))\r\n return True\r\n\r\n return False\r\n\r\nif not (check(x1, x2) or check(x2, x1,reverse=True)):\r\n print('No')\r\n", "def fin(c, x):\r\n return (x + c - 1) // c \r\n\r\ndef ck(x, b):\r\n r = (n, n)\r\n for i in range(b, n):\r\n r = min(r, (i + fin(c[i][0], x), i))\r\n return r\r\n\r\ndef sol(r, l):\r\n if r[0] <= n and l[0] <= n and r[1] < n and l[1] < n :\r\n print(\"Yes\")\r\n print(r[0] - r[1], l[0]- l[1])\r\n print(' '.join([str(x[1]) for x in c[r[1]:r[0]]]))\r\n print(' '.join([str(x[1]) for x in c[l[1]:l[0]]]))\r\n return True\r\n else:\r\n return False\r\n \r\nn, x1, x2 = [int(x) for x in input().split()]\r\nc = sorted([(int(x), i + 1) for i, x in enumerate(input().split())])\r\n\r\nr1 = ck(x1, 0)\r\nl1 = ck(x2, r1[0])\r\nr2 = ck(x2, 0)\r\nl2 = ck(x1, r2[0])\r\n\r\nif not sol(r1, l1) and not sol(l2, r2):\r\n print(\"No\")\r\n# 6 8 16\r\n# 3 5 2 9 8 7" ]

[ "def f():\n ipt = input().strip().split()\n k = int(ipt[1])\n ns = ipt[0]\n a = [int(i) for i in ns]\n n = len(a)\n flag = 1\n for i in a:\n if i== 0:\n flag = 0\n break\n \n if n< k+1:\n if flag==0:\n print(n-1)\n return\n print(n)\n return\n count = 0\n d = 0\n for i in reversed(a):\n if count == k:\n print( d-count)\n return\n if i == 0:\n count += 1\n d += 1\n if flag == 0:\n print(n-1)\n return\n print(n)\nf()\n", "n,k = input().split()\nk = int(k)\ncnt = 0\nrem = 0\nfor i in n[::-1]:\n\ti = int(i)\n\tif i==0:\n\t\tcnt += 1\n\telse:\n\t\trem += 1\n\tif cnt==k:\n\t\tprint(rem)\n\t\tbreak\n\nif cnt<k:\n\tprint(cnt+rem-1)\n", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n n = list(str(n))\r\n n.reverse()\r\n note = list()\r\n s, t = len(n), 0\r\n for i in range(s):\r\n if n[i] == '0':\r\n note.append(i)\r\n t += 1\r\n if t < k:\r\n print(s - 1)\r\n else:\r\n print(note[k - 1] - (k - 1))\r\n", "from sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn,k = get_ints()\r\n\r\ns = str(n)\r\nc = 0\r\ni = len(s)-1\r\nwhile i >-1 and k >0:\r\n\r\n\tif s[i] !=\"0\":\r\n\t\tc+=1\r\n\telse:\r\n\t\tk-=1\r\n\ti-=1\r\nif k > 0:\r\n\tprint(c+str(n).count(\"0\")-1)\r\nelse:\r\n\tprint(c)", "n,k=map(int,input().split())\r\nn = str(n)\r\nl = len(n)\r\ni=-1\r\ncount=0\r\nwhile (-1)*i<=l:\r\n if count==k:\r\n break\r\n if n[i]=='0':\r\n count+=1\r\n i-=1\r\n#print(i,count)\r\nif count==k:\r\n print((-1)*i-count-1)\r\nelse:\r\n print(l-1)", "# 20:00\n\nnum, k = [x for x in input().split(' ')]\n\ndef main():\n\tzeros, dropped = 0, 0\n\tfor numb in num[::-1]:\n\t\tif zeros < int(k):\n\t\t\tif numb == '0':\n\t\t\t\tzeros += 1\n\t\t\telse:\n\t\t\t\tdropped += 1\n\t\telse:\n\t\t\treturn dropped\n\t# Если не делится нацело\n\treturn len(num) - 1\nprint(main())", "n, k = input().split()\nk = int(k)\ncount = 0\nfor c in n[::-1]:\n if not int(c):\n k -= 1\n else:\n count += 1\n if not k: break\nelse:\n print(len(n)-1)\n exit(0)\nprint(count)\n", "a,b=map(int,input().split())\r\nz=list(str(a))\r\nzeroc=z.count('0')\r\nif zeroc<b:\r\n print(len(str(a))-1)\r\n exit()\r\nc=0\r\nx=len(z)-1\r\nwhile int(''.join(z)) %10**b>0:\r\n if z[x]!='0':\r\n del z[x]\r\n c+=1\r\n x-=1\r\nprint(c)", "n,k=input().split()\r\nk=int(k)\r\nm=[]\r\na=0\r\nb=0\r\nfor i in range(len(n)):\r\n m.append(n[i])\r\nfor j in range(len(n)-1,-1,-1):\r\n if m[j]=='0':\r\n a+=1\r\n if a==k:\r\n break\r\n else:\r\n del m[j]\r\n b+=1\r\nif a<k or m[0]=='0':\r\n print(len(n)-1)\r\nelse:\r\n print(b)\r\n", "from sys import maxsize, stdout, stdin, stderr\r\n# mod = int(1e9 + 7)\r\nimport re # can use multiple splits\r\ntup = lambda: map(int, stdin.readline().split())\r\nI = lambda: int(stdin.readline())\r\nlint = lambda: [int(x) for x in stdin.readline().split()]\r\nS = lambda: stdin.readline().replace('\\n', '').strip()\r\ndef grid(r, c): return [lint() for i in range(r)]\r\ndef debug(*args, c=6): print('\\033[3{}m'.format(c), *args, '\\033[0m', file=stderr)\r\nstpr = lambda x : stdout.write(f'{x}' + '\\n')\r\nstar = lambda x : print(' '.join(map(str , x)))\r\n# pp = '123455677'\r\n# print(pp[-3:])\r\ns , k = S().split()\r\nk, n , s, c = int(k) , len(s) , list(s) , 0\r\ncnt =0\r\nif s =='0':print(0)\r\nfor i in range(n-1,-1,-1):\r\n if s[i] =='0':\r\n cnt+=1\r\n if cnt==k:\r\n print(n- i - k ) #last k characters that were removed\r\n exit()\r\nprint(n-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys, math, itertools, functools, collections\r\ninput = sys.stdin.readline\r\n#sys.setrecursionlimit(10**6)\r\n\r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\npa = lambda x: print (\" \".join(map(str, x)))\r\n\r\ntest_case = 1\r\n\r\n#-------- DIFFERENT WAYS TO UNSTUCK ------------ \r\n# 1. Frequency/Value domain and Pigeon Hole Principle \r\n# 2. Search from end to start instead of start to end\r\n# 3. Prefix Suffix\r\n# 4. Brute force if small input size\r\n\r\ndef solve():\r\n s = str(n)\r\n cnt0 = s.count('0')\r\n if cnt0 < k:\r\n return len(s) - 1\r\n i = len(s) - 1\r\n ans = 0\r\n cur = 0\r\n while i >= 0 :\r\n if s[i] == '0':\r\n cur += 1\r\n else:\r\n ans += 1\r\n if cur == k:\r\n break\r\n i -= 1\r\n return ans\r\n pass\r\n\r\nfor _ in range(test_case):\r\n n, k = rmi()\r\n\r\n print(solve())", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(s, m):\r\n n = len(s)\r\n cnt = 0\r\n for i in range(n - 1, -1, -1):\r\n if s[i] == '0':\r\n cnt += 1\r\n if cnt == m:\r\n return n - i - m\r\n return n - 1\r\n\r\ndef main():\r\n s, m = input().split()\r\n m = int(m)\r\n ans = solve(s, m)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m=map(str,input().split())\r\nm=int(m)\r\np=n.count('0')\r\nif p<m :\r\n if p>0 :\r\n print(len(n)-1)\r\n else :\r\n print(len(n))\r\nelse :\r\n k=0\r\n p=0\r\n for i in range(len(n)-1,0,-1) :\r\n if n[i]=='0' :\r\n p=p+1\r\n else :\r\n k=k+1\r\n if p==m :\r\n break\r\n print(k)\r\n \r\n", "import sys\r\n\r\nfin = sys.stdin\r\nfout = sys.stdout\r\nn, k = fin.readline().split()\r\nk = int(k)\r\nk = 10 ** k\r\nans = 10 ** 9\r\n\r\n\r\ndef gen(cur, pos):\r\n global ans\r\n if pos == len(n):\r\n res = ''\r\n for i in range(len(n)):\r\n if not cur[i]:\r\n res += n[i]\r\n if len(res) > 0 and int(res) != 0 and int(res) % k == 0:\r\n ans = min(ans, cur.count(True))\r\n else:\r\n cur[pos] = False\r\n gen(cur, pos + 1)\r\n cur[pos] = True\r\n gen(cur, pos + 1)\r\n\r\n\r\ngen([False] * len(n), 0)\r\nif '0' in set(list(n)):\r\n ans = min(ans, len(n) - 1)\r\nfout.write(str(ans))\r\n", "a=input().split()\r\nb=[int(q) for q in list(a[0])]\r\nk=int(a[1])\r\nif b.count(0)<k:\r\n print(len(b)-1)\r\nelse:\r\n b=b[::-1]\r\n ct=0\r\n t=0\r\n for r in range(len(b)):\r\n if b[r]==0:\r\n t+=1\r\n if t==k:\r\n break\r\n else:\r\n ct+=1\r\n print(ct)", "'''\r\nhttp://codeforces.com/problemset/problem/779/B\r\n'''\r\nn, k = map(int, input().split())\r\n\r\nw = 0\r\nwhile n % (10 ** k) != 0:\r\n n = list(str(n))\r\n for index in range(len(n) - 1, -1, -1):\r\n digit = int(n[index])\r\n if digit != 0:\r\n w += 1\r\n del(n[index])\r\n break\r\n if int(''.join(n)) == 0:\r\n w += len(n) - 1\r\n break\r\n else:\r\n n = int(''.join(n))\r\n\r\nprint(w)\r\n", "n,k=list(map(int,input().split()))\r\nans,c=0,0\r\nwhile k>0 and n>0:\r\n if n % 10 == 0: k -= 1\r\n else: ans += 1\r\n n //= 10\r\n c += 1\r\nprint(ans if n>0 else max(0,c-1))", "s, k = input().split()\nk = int(k)\nn = len(s)\ntot = 0\ncount = 0\nfor i in range(n-1,-1,-1):\n\tif s[i] == '0':\n\t\ttot += 1\n\telse:\n\t\tcount += 1\n\tif tot == k:\n\t\tprint(count)\n\t\tbreak\nelse:\n\tprint(len(s)-1)\n", "n,k = map(int,input().split())\r\n\r\nx = str(n)\r\nlx = len(x)\r\nans = 0\r\nc0 = x.count('0')\r\n\r\nif c0 < k:\r\n exit(print(lx-1))\r\nc0 = 0\r\nfor i in range(lx-1,-1,-1):\r\n if x[i] != '0':\r\n ans += 1\r\n else:\r\n c0 += 1\r\n if c0 == k:\r\n break\r\nprint(ans)", "n, k = input().split()\r\nk = int(k)\r\n\r\nif (n.count('0') < k):\r\n print(len(n) - 1)\r\nelse:\r\n cnt = 0\r\n zcnt = 0\r\n for i in range(len(n) - 1, -1, -1):\r\n if n[i] == '0':\r\n zcnt += 1\r\n else:\r\n cnt += 1\r\n if (zcnt == k):\r\n print(cnt)\r\n break\r\n \r\n", "n, m = input().split()\r\nm = int(m)\r\nk = m\r\nremove = 0\r\nn = str(n)\r\nfor i in range(n.__len__()-1,-1,-1):\r\n if k<=0:\r\n break\r\n if n[i]=='0':\r\n k-=1\r\n else:\r\n remove+=1\r\n\r\nif m == k:\r\n print(n.__len__())\r\nelif k>0:\r\n print(n.__len__()-1)\r\nelse:\r\n print(remove)", "p=input().rstrip().split(' ')\r\nx=list(p[0])\r\ny=int(p[1])\r\nB=0;\r\nG=0;\r\nfor i in range(len(x)-1,-1,-1):\r\n if y!=0:\r\n if x[i]=='0':\r\n y-=1;\r\n else:\r\n B+=1;\r\n else:\r\n G=1;\r\n break;\r\nif G==1:\r\n print(B)\r\nelse:\r\n print(len(x)-1)", "a,b=map(int,input().split())\r\n \r\na=str(a)\r\na=a[::-1]\r\nr=0\r\nc=0\r\nfor i in a:\r\n if c<b:\r\n if i=='0':\r\n c+=1\r\n else:\r\n r+=1\r\nif c==b:\r\n print(r)\r\nelse:\r\n print(len(a)-1)", "s,n=input().split()\r\ndiv=int('1'+'0'*int(n))\r\nx=len(s)-1\r\ncount=0\r\nans=len(s)-1\r\nwhile x>=0 :\r\n\tif int(s)%div==0:\r\n\t\tans=count\r\n\t\tbreak\r\n\tif s[x]!='0':\r\n\t\ts=s[:x]+s[x+1:]\r\n\t\tcount+=1\r\n\tx-=1\r\nprint(ans)", "s,n=(z for z in input().split())\r\nn=int(n)\r\nif(s.count('0')<n):\r\n print(len(s)-1)\r\nelse:\r\n cnt=0\r\n i=1\r\n while cnt<n:\r\n if s[-i]=='0':\r\n cnt+=1\r\n i+=1\r\n print(i-1-cnt)", "num, k = input().split()\nk = int(k)\nnum = list(map(int, num))\nnum = num[::-1]\n\nif num.count(0) >= k:\n\tc0 = 0\n\tg = 0\n\tfor n in num:\n\t\tif n == 0:\n\t\t\tc0 += 1\n\t\telse:\n\t\t\tg += 1\n\t\tif c0 == k:\n\t\t\tbreak\n\tprint(g) \nelse:\n\tif 0 in num:\n\t\tprint(len(num) - 1)\n\telse:\n\t\tprint(len(num))\n", "n,k=map(int,input().split())\r\nk=10**k\r\nr=str(n)\r\ni=len(r)-1\r\nc=0\r\nwhile 1:\r\n if int(r)%k==0 or len(r)-r.count('0')==1:\r\n break\r\n if r[i]!='0':\r\n r = r[:i]+r[i+1:]\r\n c+=1\r\n i-=1\r\nif int(r)<k:\r\n print(len(str(n))-1)\r\nelse:\r\n print(c)\r\n", "s, k = input().split()\r\nk = int(k)\r\nif s == '0':\r\n print(0)\r\nelif s.count('0') < k:\r\n print(len(s) - 1)\r\nelse:\r\n s = s[::-1]\r\n cnt = 0\r\n for x in s:\r\n if k == 0:\r\n break\r\n if x == '0':\r\n k -= 1\r\n else:\r\n cnt += 1\r\n print(cnt)", "n, k = input().split()\r\nk = int(k)\r\ndig = 0\r\nzeros = 0\r\nfor i in range(len(n) - 1, 0, - 1):\r\n if n[i] != \"0\":\r\n dig += 1\r\n else:\r\n zeros += 1 \r\n if zeros >= k:\r\n print(dig)\r\n exit()\r\nprint(len(n) - 1)", "a,b=map(int,input().split())\r\ns=str(a)\r\ns=s[::-1]\r\nc=0\r\np=0\r\nif(s.count('0')<b):\r\n print(len(s)-1) \r\nelse:\r\n i=0\r\n while(b!=p):\r\n if(s[i]!='0'):\r\n c+=1\r\n if(s[i]=='0'):\r\n p+=1\r\n i+=1\r\n print(c)", "n, k = map(int, input().split())\r\n\r\nn = str(n)\r\n\r\nchanges = 0\r\nzeros = 0\r\n\r\nfor digit in n[::-1]:\r\n if zeros == k:\r\n break\r\n\r\n if digit == \"0\":\r\n zeros += 1\r\n else:\r\n changes += 1\r\n\r\nif zeros != k:\r\n print(len(n) - 1)\r\nelse:\r\n print(changes)", "n, k = input().split()\r\nzero = 0\r\nfor i in n[::-1]:\r\n if i == \"0\":\r\n zero += 1\r\n else:\r\n break\r\n \r\nk = int(k)\r\n\r\nif zero >= k:\r\n print(0)\r\nelse:\r\n ans = 0\r\n zero = 0\r\n for i in n[::-1]:\r\n if i != \"0\":\r\n ans += 1\r\n else:\r\n zero += 1\r\n if zero >= k:\r\n break\r\n if zero >= k:\r\n print(ans)\r\n else:\r\n print(len(n)-1)\r\n", "n,k=map(int,input().split())\r\nans=0\r\nc0=0\r\nn=str(n)\r\ni=len(n)-1\r\nwhile c0!=k and i>=0:\r\n if c0==k:\r\n break\r\n if n[i]==\"0\":\r\n c0+=1\r\n else:\r\n ans+=1\r\n i-=1\r\nif c0!=k:\r\n print(len(n)-1)\r\nelse:\r\n print(ans)", "a, b = list(map(int, input().split()))\nst = str(a)\nif (st.count('0') < b):\n print(len(st)-1)\nelse:\n ans = 0\n cnt = 0\n st = st[::-1]\n for i in range(len(st)):\n if (st[i] == '0'):\n cnt += 1\n if (cnt == b):\n break\n else:\n ans += 1\n print(ans)\n \t\t\t \t\t\t\t \t\t\t\t\t\t\t \t\t\t \t\t \t", "a=input()\na=a.split()\nfindInstr=a[0]\na[1]=int(a[1])\nrecommendedZeroCounter=0\nminimumCounter=0\nzeroEnough=0\nfor i in range(len(a[0])-1,0,-1):\n if(findInstr[i]=='0'):\n recommendedZeroCounter+=1\nif(recommendedZeroCounter<a[1]):\n print(len(a[0])-1)\nelse:\n for i in range(len(a[0])-1,0,-1):\n if(findInstr[i]!='0'):\n minimumCounter+=1\n if(findInstr[i]=='0'):\n zeroEnough+=1\n if(zeroEnough==a[1]):\n break\n print(minimumCounter)", "X = list(input().split())\r\nif X[0].count(\"0\") < int(X[1]):\r\n print(len(X[0]) - 1)\r\n exit()\r\nDeleted, Need = 0, int(X[1])\r\ni = len(X[0]) - 1\r\nwhile Need != 0:\r\n if X[0][i] == '0':\r\n Need -= 1\r\n else:\r\n Deleted += 1\r\n i -= 1\r\nprint(Deleted)\r\n\r\n# UB_CodeForces\r\n# Advice: Be on your own\r\n# Location: Based on popular demand \"\" \"\" \"\" \"\"\r\n# Caption: Last breath\r\n# CodeNumber: 573\r\n", "a,b=map(int,input().split())\r\na=list(str(a))\r\nc=a.count('0')\r\nif c<b:print(len(a)-1)\r\nelse:\r\n a.reverse()\r\n t=b\r\n r=0\r\n for i in a:\r\n if i=='0':\r\n t-=1\r\n if t==0:\r\n break\r\n continue\r\n r+=1\r\n print(r)\r\n", "n, k = [int(x) for x in input().split(' ')]\r\nzc = 0\r\nnzc = 0\r\nfor char in str(n)[::-1]:\r\n if zc == k:\r\n break\r\n if char == '0':\r\n zc += 1\r\n else:\r\n nzc += 1\r\n\r\nif zc < k:\r\n ans = len(str(n)) - 1\r\n print(ans)\r\nelse:\r\n print(nzc)", "n,k = map(str,input().split())\r\nk = int(k)\r\nans = 0\r\nfor i in n[-1::-1]:\r\n if k == 0:\r\n break\r\n else:\r\n if i == '0':\r\n k -= 1\r\n else:\r\n ans += 1\r\nif k == 0:\r\n print(ans)\r\nelse:\r\n print(len(n)-1)\r\n", "A=input().split()\nn=A[0]\nk=int(A[1])\nc=0\nfor i in range(len(n)-1,-1,-1):\n if(k<=0):\n break\n if(n[i]=='0'):\n k=k-1\n else:\n c+=1\nif(k<=0):\n print(c)\nelse:\n print(len(n)-1)\n\t \t \t \t\t\t \t \t\t \t\t \t \t", "data = list(map(int, input().split()))\r\n\r\nn = str(data[0])\r\nn_str = str(n)\r\nk = data[1]\r\nz = 10 ** k\r\n\r\ncounter = 0\r\n\r\n\r\ndef remove_last_digit(number):\r\n numero = list(str(number))\r\n\r\n for i in range(len(numero) - 1, -1, -1):\r\n if numero[i] != \"0\":\r\n numero = numero[0:i] + numero[i + 1: len(numero)]\r\n break\r\n if numero[0] == \"0\":\r\n global counter\r\n for i in range(0, len(numero) - 1):\r\n counter += 1\r\n\r\n return \"\".join(numero)\r\n\r\n\r\nif n == 0:\r\n print(0)\r\nelse:\r\n while True:\r\n if int(n) % z != 0:\r\n n = remove_last_digit(n)\r\n counter += 1\r\n else:\r\n break\r\n\r\nprint(counter)", "a = list(map(int,input().split()))\r\nn,k = a[0],a[1]\r\nstr1 = str(n)\r\nif str1.count('0') < k:\r\n print (len(str(n)) - 1)\r\nelse:\r\n i = len(str1) - 1\r\n s = 0\r\n while int(str1) % (10 ** k) != 0:\r\n if str1[i] == '0':\r\n i -= 1\r\n else:\r\n str1 = str1[:i] + str1[i + 1:]\r\n s += 1\r\n i -= 1\r\n print (s)\r\n", "n,k=input().split()\r\nk=int(k)\r\nl=len(n)-1\r\ncnt=0\r\nwhile l>=0 and k:\r\n\tif n[l]==\"0\":\r\n\t\tk-=1\r\n\telse:\r\n\t\tcnt+=1\r\n\tl-=1\r\nif k==0:\r\n\tprint(cnt)\r\nelse:\r\n\tprint(len(n)-1)", "k,m = map(int,input().split())\r\nlst = [int(i) for i in str(k)]\r\ncnt0 = lst.count(0)\r\nif m > cnt0:\r\n print(len(lst)-1)\r\nelse:\r\n cnt2 = 0\r\n i = len(lst)-1\r\n otv = 0\r\n while cnt2 < m:\r\n if lst[i] != 0:\r\n otv += 1\r\n else:\r\n cnt2 += 1\r\n i -= 1\r\n print(otv)\r\n\r\n\n# Wed Jan 04 2023 11:33:43 GMT+0300 (Moscow Standard Time)\n", "n, k = list(map(int, input().split()))\r\n\r\nden = 10**k\r\nif n % den == 0:\r\n print(0)\r\n exit()\r\n \r\nn = str(n)\r\nw = 0\r\nfor i in range(len(n)- 1, -1, -1):\r\n if n[i] != '0':\r\n w += 1\r\n n = n[:i] + n[i+1:]\r\n# print(\"n:\", n)\r\n if n.strip('0') == '':\r\n print(w + len(n) - 1)\r\n break\r\n if int(n) % den == 0:\r\n print(w)\r\n break\r\n\r\n \r\n", "entrada = input().split()\n\ndig = 0\nzero = 0\n\nif entrada[0].count(\"0\") >= int(entrada[1]):\n\tfor i in range(1,len(entrada[0])):\n\t\tif int(entrada[0][-i]) != 0:\t\n\t\t\tdig+=1\n\t\telse:\n\t\t\tzero+=1\n\t\t\tif zero == int(entrada[1]):\n\t\t\t\tbreak\n\tprint(dig)\nelse:\n\tprint(len(entrada[0]) - 1)", "n, k = input().strip().split()\nk = int(k)\nif n.count('0') >= k:\n\tans = 0\n\tzeros = 0\n\tfor i in range(len(n)-1, -1, -1):\n\t\tif n[i] == '0':\n\t\t\tzeros += 1\n\t\tif zeros == k:\n\t\t\tbreak\n\t\tif n[i] != '0':\n\t\t\tans += 1\n\tprint(ans)\nelse:\n\tprint(len(n)-1)\n", "# Coding is about expressing your feeling, and\r\n# there is always a better way to express your feeling_feelme\r\nimport sys\r\nimport math\r\n# sys.stdin=open('input.txt','r')\r\n# sys.stdout=open('output2.txt','w')\r\nfrom sys import stdin,stdout\r\nfrom collections import deque,defaultdict\r\nfrom math import ceil,floor,inf,sqrt,factorial,gcd,log2\r\nfrom copy import deepcopy\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=int(1e9 + 7)\r\n\r\nn,k=iia()\r\nn=str(n)[::-1]\r\ncount=0\r\nsubcount=0\r\nfor i in n:\r\n if i=='0':\r\n count+=1\r\n else:\r\n subcount+=1\r\n if count==k:\r\n break\r\nif count<k:\r\n print(len(n)-1)\r\nelse:\r\n print(subcount)\r\n", "n,k = [x for x in input().split()]\n\nk = int(k)\nans = 0\nstack = 0\nif k == 0:\n\tprint(0)\nif n.count('0') < k:\n\tprint(len(n)-1)\nelse:\n\tfor i in n[::-1]:\n\t\tif stack == k:\n\t\t\tbreak\n\t\tif i==\"0\":\n\t\t\tstack+=1\n\t\telse:\n\t\t\tans += 1\n\tprint(ans)\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n", "n, k = map(str, input().split())\r\ns = list(n)\r\n\r\ncount = 0\r\nfor x in s:\r\n if x == '0':\r\n count += 1\r\n\r\nif count < int(k):\r\n print(len(s)-1)\r\n\r\nelse:\r\n def main(a, x, ans):\r\n count = 0\r\n for i in range(len(a) - 1, -1, -1):\r\n if a[i] == '0':\r\n count += 1\r\n else:\r\n break\r\n if count >= int(x):\r\n return ans\r\n for i in range(len(a) - 1, -1, -1):\r\n if a[i] != '0':\r\n a.pop(i)\r\n ans += 1\r\n return main(a, x, ans)\r\n\r\n print(main(s, k, 0))", "n, k = input().strip().split()\r\nk = int(k)\r\nn = list(n)\r\nres, cnt = 0, 0\r\nn.reverse()\r\nfor c in n:\r\n if c == '0': cnt += 1\r\n else: res += 1\r\n if cnt == k: break\r\nprint(res if cnt == k else len(n) - 1)\r\n", "var1, var2 = input().split()\nvar2 = int(var2)\nvar1 = var1[::-1]\nk=0\nr=0\nfor i in var1:\n if (k==var2):\n break\n if(i == '0'):\n k+=1\n else:\n r+=1\nprint(r if k==var2 else max(0,len(var1)-1))", "n,k=map(int,input().split())\r\nn=str(n)\r\nif n.count(\"0\")<k:\r\n print(len(n)-1)\r\nelse:\r\n z=0\r\n count_=0\r\n n=n[::-1]\r\n for i in n:\r\n if i==\"0\":\r\n count_+=1\r\n else:\r\n z+=1\r\n if count_==k:\r\n break\r\n print(z)\r\n", "n, k = map(int, input().split())\r\nn = str(n)\r\nv = 0\r\nanswer = 0\r\nt = False\r\nfor i in range(len(n) - 1, 0, -1):\r\n if n[i] == '0':\r\n v += 1\r\n else:\r\n answer += 1\r\n if v == k:\r\n t = True\r\n break\r\nif t:\r\n print(answer)\r\nelse:\r\n print(len(n) - 1)\r\n \r\n", "n,k=input().split()\r\nn=list(n)\r\nk=int(k)\r\nif len(n)<=k:\r\n print(len(n)-1)\r\nelse:\r\n s=0\r\n j=0\r\n for i in n:\r\n if i=='0':\r\n j=j+1\r\n if j<k:\r\n print(len(n)-1)\r\n else:\r\n for i in n[::-1]:\r\n if i=='0':\r\n k=k-1\r\n else:\r\n s=s+1\r\n if k==0:\r\n print(s)\r\n break\r\n ", "l ,k = (int(x) for x in input().split())\r\nl ,i,cnt= list(str(l)),1,0\r\nif l.count('0') < k: cnt = len(l)-1\r\nelse:\r\n while k > 0: \r\n if l[-i] == \"0\": k -= 1\r\n else:cnt +=1\r\n i += 1\r\nprint(cnt)\r\n", "n, k = input().split()\r\n\r\nn = list(n)\r\nk = int(k)\r\n\r\nzeroes = 0\r\ndigits_to_remove = 0\r\n\r\ni = len(n) - 1\r\n\r\nwhile True:\r\n if zeroes < k:\r\n if i == 0:\r\n digits_to_remove += len(n) - 1\r\n break\r\n elif n[i] == '0':\r\n zeroes += 1\r\n else:\r\n del n[i]\r\n digits_to_remove += 1\r\n \r\n i -= 1\r\n else:\r\n break\r\n\r\nprint(digits_to_remove)\r\n", "n,k=[int(n) for n in input().split()]\r\nnumstr=str(n)\r\nindex=len(numstr)-1\r\nchardel=0\r\nnumzero=0\r\nfor i in numstr:\r\n if i=='0':\r\n numzero+=1\r\nif(len(numstr)<=k):\r\n chardel=len(numstr)-1\r\n print(chardel)\r\nelif numzero<k:\r\n print(len(numstr)-1)\r\nelse:\r\n while(k!=0):\r\n if numstr[index]!='0':\r\n chardel+=1\r\n else:\r\n k-=1\r\n index-=1\r\n print(chardel)", "import sys,math\nn, k = map(int,input().split())\na = list(str(n))\ni = len(a)-1\nc=0\nwhile i>=0 and a[i:].count('0')!=k:\n if a[i]!='0':\n a[i]=None\n c+=1\n i-=1\nprint(c if i>=0 else len(a)-1)\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn, m = map(int, input().split())\r\nn = str(n)\r\ncount = 0\r\nans = 0\r\nfor i in range(len(n) - 1, -1, -1):\r\n if n[i] != \"0\":\r\n ans += 1\r\n if count == m:\r\n break\r\n else:\r\n count += 1\r\n if count == m:\r\n break\r\nif count == m:\r\n print(ans)\r\nelse:\r\n print(len(n) - 1)\r\n", "n,k = map(str,input().split())\r\nz = n.count('0')\r\nif z<int(k): print(len(n)-1)\r\nelse:\r\n\tn = n[::-1]\r\n\tcount = 0\r\n\tcnt = 0\r\n\tfor i in n:\r\n\t\tif count==int(k): print(cnt);break\r\n\t\telif i=='0': count+=1\r\n\t\telse: cnt+=1\r\n\telse: print(cnt)", "n, k = input().split()\r\nk, ans = int(k), 0\r\nfor s in list(reversed(n)):\r\n if k <= 0:\r\n break\r\n if s == '0':\r\n k -= 1\r\n else:\r\n ans += 1\r\nelse:\r\n ans = len(n) - 1\r\nprint(ans)\r\n", "x=input()\r\nx=x.split()\r\na=int(x[0])\r\nb=10**(int(x[1]))\r\nconnumeros=0\r\nconceros=0\r\nk=0\r\nn = (len(str(a)))\r\nwhile k<n and conceros<=int(x[1]):\r\n ultimo = a%10\r\n if ultimo!=0:\r\n connumeros+= 1\r\n else:\r\n conceros+=1\r\n if conceros==int(x[1]):\r\n break\r\n a = a//10 \r\n k += 1\r\n\r\nif k==n:\r\n print(n-1)\r\nelse:\r\n print(connumeros)", "number, k = input().split()\r\nk = int(k)\r\nif number.count('0') < k:\r\n print(len(number)-1)\r\nelse:\r\n list_of_zeros = []\r\n for i in range(len(number)):\r\n if number[-i-1] == '0': list_of_zeros.append(-i-1)\r\n answer = len(number) - number.rfind('0') - 1\r\n for i in range(k-1):\r\n answer += list_of_zeros[i] - list_of_zeros[i+1] - 1\r\n print(answer)", "n,k=[x for x in input().split()]\r\ncnt=0\r\nk=int(k)\r\nl=len(n)\r\nfor i in range(l-1,-1,-1):\r\n if k<=0:\r\n break\r\n elif n[i]=='0':\r\n k-=1\r\n else:\r\n cnt+=1\r\nif k<=0:\r\n print(cnt)\r\nelse:\r\n print(l-1)\r\n ", "import math\r\n\r\ndef main_function():\r\n n, k = [i for i in input().split(\" \")]\r\n zero_counter = 0\r\n for i in range(len(n)):\r\n if n[i] == \"0\":\r\n zero_counter += 1\r\n if zero_counter < int(k):\r\n print(len(n) - 1)\r\n else:\r\n couter = 0\r\n count_0 = 0\r\n for i in range(len(n)):\r\n j = len(n) - i - 1\r\n if int(n[j]) != 0:\r\n couter += 1\r\n else:\r\n count_0 += 1\r\n if count_0 == int(k):\r\n break\r\n print(couter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n,k = input().split()\r\nk = int(k)\r\nlength = len(n)-1\r\ncount = 0\r\nwhile length >= 0 and k:\r\n\tif n[length] == \"0\":\r\n\t\tk -= 1\r\n\telse:\r\n\t\tcount += 1\r\n\tlength -= 1\r\nif k:\r\n print(len(n)-1)\r\nelse:\r\n print(count)\r\n\r\n", "#B. Weird Rounding\r\nn,k=map(int,input().split())\r\nns=len(str(n))\r\nn=str(n)\r\nn=n[::-1]\r\ncount=0\r\nfor i in range(len(n)):\r\n if k<=0:\r\n break\r\n if n[i]=='0':\r\n k-=1\r\n else:\r\n count+=1\r\nif k<=0:\r\n print(count)\r\n \r\nelse:\r\n print(len(n)-1)\r\n", "n,k=map(int,input().split())\r\nn=list(repr(n))\r\nx=0\r\nfor i in range(len(n)-1,-1,-1):\r\n if(k==0):\r\n break\r\n elif(n[i]=='0'):\r\n k-=1\r\n else:\r\n x+=1\r\nif(k):\r\n print(len(n)-1)\r\nelse:\r\n print(x)", "n, k = input().split()\nk = int(k)\ntot = n.count('0') \nif tot < k:\n print(len(n)-1)\nelse:\n zeros, ans = 0, 0\n j = len(n)-1\n while zeros < k:\n if n[j] == '0':\n zeros += 1\n else:\n ans += 1\n j -= 1\n print(ans)\n", "import itertools\n\n\nN, K = input().split()\nK = int(K)\ngroups = itertools.groupby(N)\nlst = []\nfor key, vals in groups:\n lst.append((key, len(list(vals))))\n\nlst.reverse()\nzero_cnt = 0\nans = 0\nfor l in lst:\n if zero_cnt >= K:\n print(ans)\n exit()\n if l[0] == \"0\":\n zero_cnt += l[1]\n else:\n ans += l[1]\nprint(len(N) - 1)\n", "s, k = input().split()\r\nk = int(k)\r\nremK = k\r\nif len(s) < remK: print(len(s)-1)\r\nelse:\r\n for i in range(len(s)-1, -1, -1):\r\n if s[i] == '0': remK -= 1\r\n if not remK:\r\n print(len(s)-i-k)\r\n break\r\n else: print(len(s)-1)", "n, k = input().split()\nn = list(n)\nst_len = len(n)\nk = int(k)\nres = 0\nwhile k > 0 and n:\n if n[-1] == '0':\n k -= 1\n else:\n res += 1\n n.pop()\nif n:\n print(res)\nelse:\n print(st_len - 1)", "s1,n=map(str,input().split())\r\nn=int(n)\r\ns=s1[::-1]\r\n# print(s)\r\nans=0\r\nif s.count(\"0\")<n:\r\n print(len(s)-1)\r\nelse:\r\n for i in range(1,len(s)+1):\r\n if s[:i].count(\"0\")==n:\r\n ans=len(s[:i])-n\r\n break\r\n # print(s[:i])\r\n print(ans)", "n,k=(map(int,input().split()))\r\nif n==0:\r\n print(0)\r\nelse:\r\n a=[]\r\n while n!=0:\r\n a.append(n%10)\r\n n=n//10\r\n c=0\r\n z=0\r\n x=0\r\n g=0\r\n q=0\r\n \r\n for i in range(len(a)):\r\n if a[i]==0:\r\n c+=1\r\n else:\r\n z+=1\r\n i=0\r\n while g!=k and i<len(a):\r\n if a[i]==0:\r\n g+=1\r\n else:\r\n x+=1\r\n i+=1\r\n \r\n \r\n if x==z:\r\n print(len(a)-1)\r\n else:\r\n print(x)\r\n \r\n ", "import sys\r\nimport math\r\nfrom collections import OrderedDict\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn,k=map(str,input().split())\r\nif n=='0':print('0')\r\nelif n.count('0')<int(k):print(len(n)-1)\r\nelse:\r\n\tfor i in range(1,len(n)):\r\n\t\tif n[i]=='0' and n[i:].count('0')==int(k):\r\n\t\t\tprint(len(n[i:])-int(k))\r\n\t\t\tbreak\r\n", "a, b = input().split(' ')\nz_count = a.count('0')\nif z_count < int(b) and z_count > 0:\n print(len(a) - 1)\nelse:\n a = a[-1::-1]\n z_count = 0\n nz_count = 0\n for c in a:\n if z_count == int(b):\n break\n if c == '0':\n z_count += 1\n else:\n nz_count += 1\n print(nz_count)\nexit(0)", "def solve():\r\n if n == '0':\r\n return 0\r\n cur = 0\r\n for i in range(len(n) - 1, -1, -1):\r\n if n[i] == '0':\r\n cur += 1\r\n if cur == k:\r\n return (len(n) - i - k)\r\n return len(n) - 1\r\n\r\nread = lambda: map(int, input().split())\r\nn, k = read()\r\nn = str(n)\r\nprint(solve())", "import math\r\nn,k=list(map(str,input().split()))\r\nzeroes,even,odd=0,0,0\r\ni=len(n)-1\r\ncount=0\r\nans=0\r\nwhile count!=int(k) and i>=0:\r\n if n[i]=='0':\r\n count+=1\r\n else:\r\n ans+=1\r\n i-=1\r\nif i>=0:\r\n print(ans)\r\nelse:\r\n print(len(n)-1)\r\n \r\n", "num, d = input().split()\r\nd = int(d)\r\n\r\ncount = 0\r\nres = 0\r\n\r\nif num.count('0') < d:\r\n print(len(num) - 1)\r\n\r\nelse:\r\n index = num[::-1].replace('0', '1', d-1).find('0')\r\n print(index - d + 1)", "n, k = input().split()\nk = int(k)\n\nn = list(n)[::-1]\nans = 0\nhas_zero = False\n\nfor i in range(len(n)):\n if n[i] != '0':\n ans += 1\n else:\n has_zero = True\n k -= 1\n if k == 0:\n print(ans)\n exit()\n\n\nprint(len(n) - has_zero)\n", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\n\ndef ri():\n return map(int, input().split())\n\nn, k = input().split()\n\nk = int(k)\n\nzcnt = 0\nrcnt = 0\nfor i in range(len(n)-1, 0, -1 ):\n if n[i] == '0':\n zcnt+=1\n else:\n rcnt+=1\n\n if zcnt == k:\n print(rcnt)\n exit()\n\nprint(len(n)-1)\n\n", "[n, k] = map(int, input().split())\r\nns = str(n)\r\nif k == 0:\r\n print(len(ns)-1)\r\nelse:\r\n ct = 0\r\n ct0 = 0\r\n for i in range(len(ns)):\r\n if ns[len(ns)-i-1] != '0':\r\n ct += 1\r\n else:\r\n ct0 += 1\r\n if ct0==k:\r\n break\r\n if ct0==k:\r\n print(ct)\r\n else:\r\n print(len(ns)-1)", "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())\nn,k=M()\ns=str(n)\nif(s.count('0')>=k):\n z=0\n c=0\n i=len(s)-1\n while(z!=k):\n if(s[i]=='0'):\n z+=1\n else:\n c+=1\n i-=1\n print(c)\nelse:\n print(len(s)-1)\n \n", "n, k = map(int, input().split())\r\nimport sys\r\n\r\nnumber_of_digit, number_of_zero = 0, 0\r\nfor digit in str(n)[::-1]:\r\n if digit == '0':\r\n number_of_zero += 1\r\n else:\r\n number_of_digit += 1\r\n if number_of_zero >= k:\r\n print(number_of_digit)\r\n sys.exit()\r\n # print(number_of_digit, number_of_zero, digit)\r\n\r\nprint(len(str(n)) - 1)", "s,k=[i for i in input().split()]\r\nk=int(k)\r\ns=s[::-1]\r\nc=0\r\ncou=0\r\nflag=0\r\nfor i in range(len(s)):\r\n\tif(s[i]=='0'):\r\n\t\tc+=1\r\n\t\tif(c%k==0):\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\telse:\r\n\t\tcou+=1\r\nif(flag==1):\r\n\tprint(cou)\r\nelse:\r\n\tprint(len(s)-1)\r\n\r\n", "n,k=input().split()\r\nk=int(k)\r\nl=len(n)-1\r\nc=0\r\nwhile l>=0 and k:\r\n\tif n[l]==\"0\":\r\n\t\tk-=1\r\n\telse:\r\n\t\tc+=1\r\n\tl-=1\r\nif k==0:\r\n\tprint(c)\r\nelse:\r\n\tprint(len(n)-1)", "num,n=input().split()\r\nn=int(n)\r\ni=len(num)-1\r\nj=0\r\ntot=0\r\nwhile i>=0 and j<n:\r\n\tif(num[i]=='0'):\r\n\t\tj+=1\r\n\telse:\r\n\t\ttot+=1\r\n\ti-=1\r\nif(j==n):\r\n\tprint(tot)\r\nelse:\r\n\tprint(len(num)-1)", "s,k = input().split()\r\nk = int(k)\r\nn = len(s)\r\nans = 0\r\ncnt = 0\r\nfor i in range(n-1,-1,-1):\r\n if cnt == k:\r\n print(ans)\r\n break\r\n elif s[i] == '0':\r\n cnt += 1\r\n else:\r\n ans += 1\r\nelse:\r\n print(n-1)\r\n ", "n, k = map(str, input().split())\r\n\r\nlength = len(n)\r\n\r\ncount0 = 0\r\ncount1 = 0\r\nflag = 0\r\n#print(\"hi\")\r\nfor x in range(0, length):\r\n\t#print(x)\r\n\tif n[length-x-1] == \"0\":\r\n\t\tcount0 += 1\r\n\t\t#print(length-x-1, \"000\")\r\n\telse:\r\n\t\t#del(n[length-x-1])\r\n\t\tcount1 += 1\r\n\t\t#print(length-x-1, n)\r\n\tif count0 == int(k):\r\n\t\tflag = 1\r\n\t\tbreak\r\n\r\nif flag == 1:\r\n\tprint(count1)\r\nelse:\r\n\tprint(length - 1)\r\n", "n , k = map(str,input().split())\r\nnum = int(n)\r\nnd = int(len(n))\r\nans = int(1e9)\r\nfor i in range(2**nd):\r\n tmp = '0'\r\n for j in range(nd):\r\n if i & (1<<j) :\r\n tmp += n[j]\r\n #print(tmp)\r\n ntmp = int(tmp[0:])\r\n kk = 10 ** int(k)\r\n if(ntmp != 0 and ntmp %kk == 0):\r\n ans = min(ans , len(n) - len(tmp[1:]))\r\n if(ntmp % kk == 0 and ntmp == 0):\r\n ans = min(ans, len(n)-1)\r\nprint(ans)", "#RAVENS\n#TEAM_2\n#ESSI-DAYI_MOHSEN-LORENZO\nn,k = map(str,input().split())\nl=len(n)-1\nres=zero=0\nfor i in range(l,-1,-1):\n if n[i] == '0':\n zero+=1\n if zero == int(k):\n break\n else:\n res+=1\nif zero!=int(k):\n print(l)\nelse:\n print(res)\n", "n, k = input().split()\r\nk = int(k)\r\nans = 0\r\ncount = 0\r\nfor num in n[::-1]:\r\n\tif count == k:\r\n\t\tprint(ans)\r\n\t\texit()\r\n\tif num == '0':\r\n\t\tcount += 1\r\n\tif num != '0':\r\n\t\tans += 1\r\nprint(ans + count - 1)", "l = [s for s in input().split()]\n\nn = l[0][::-1]\nk = int(l[1])\n\nans = 0\ncnt = 0\nfor i in n:\n\tif i != '0':\n\t\tans += 1\n\telse:\n\t\tcnt += 1\n\t\tif cnt == k:\n\t\t\tbreak\n\nif cnt == k:\n\tprint(ans)\nelse:\n\tprint(len(n) - 1)", "s,m=input().split()\r\nn=int(m)\r\ns=s[::-1]\r\nk=0\r\nd=0\r\nsd=''\r\nfor i in s:\r\n\tif k!=n:\r\n\t\tif i==\"0\":\r\n\t\t\tk+=1\r\n\t\telse:\r\n\t\t\td+=1\r\nprint(d if k==n else len(s)-1)", "n, k = input().strip().split()\r\nk = int(k)\r\nn = list(n)\r\ncnt_zero = n.count('0')\r\nif cnt_zero < k:\r\n print(len(n) - 1)\r\nelse:\r\n res, cnt = 0, 0\r\n n.reverse()\r\n for c in n:\r\n if c == '0': cnt += 1\r\n else: res += 1\r\n if cnt == k: break\r\n print(res)\r\n", "import sys\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\ninput = lambda:sys.stdin.readline().strip()\r\nli = lambda:list(map(int,input().split()))\r\nI = lambda: int(input())\r\nn,k= li()\r\nst =[]\r\nsn = str(n)[::-1]\r\nzc=0\r\ndc=0\r\nfor i in sn:\r\n\tif i==\"0\":\r\n\t\tzc+=1\r\n\t\tst.append(i)\r\n\telse:\r\n\t\tif zc<k:\r\n\t\t\tdc+=1\r\n\t\telse:\r\n\t\t\tst.append(i)\r\nfn=int(\"\".join(st)[::-1])\r\nif fn==0:\r\n\tdc+=(len(st)-1)\r\nprint(dc)", "n,k=map(int,input().split())\r\nn=str(n)\r\nans=0\r\n\r\nfor i in range(len(n)-1,-1,-1):\r\n if k<=0:\r\n break \r\n elif n[i]=='0':\r\n \r\n k=k-1\r\n else:\r\n\r\n ans+=1\r\nif k<=0:\r\n print(ans)\r\nelse:\r\n print(len(n)-1)\r\n ", "n, k = map(int, input().split())\r\nlen_n = len(str(n))\r\nif len_n < k + 1:\r\n\tprint(len_n - 1)\r\nelse:\r\n\tn = str(n)\r\n\tmn = 0\r\n\tkol_nul = 0\r\n\ti = len_n - 1\r\n\twhile i > -1:\r\n\t\tif kol_nul == k:\r\n\t\t\tbreak\r\n\t\tif n[i] == \"0\":\r\n\t\t\tkol_nul += 1\r\n\t\telse:\r\n\t\t\tmn += 1\r\n\t\ti -= 1\r\n\telse:\r\n\t\tmn = len_n - 1\r\n\tprint(mn)\r\n", "a,k = input().split()\r\nk = int(k)\r\ncnt = 0\r\n\r\nfor i in range(len(a)-1,-1,-1):\r\n if k<=0:\r\n break\r\n \r\n if a[i]=='0':\r\n k-=1\r\n else:\r\n cnt+=1\r\n \r\nif k<=0:\r\n print(cnt)\r\nelse:\r\n print(len(a)-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 1 14:42:50 2017\r\n\r\n@author: kyle\r\n\"\"\"\r\nn,k = input().split()\r\nk=int(k)\r\nn=n[::-1]\r\nzeros = 0\r\ni=0\r\nde = 0\r\nwhile zeros<k and i<len(n):\r\n if n[i] == '0':\r\n zeros += 1\r\n else:\r\n de += 1\r\n i += 1\r\n\r\nif i == len(n):\r\n print(i-1)\r\nelse:\r\n print(de)", "inp = input().split()\r\ns = inp[0]\r\nk = int(inp[1])\r\nans = 0\r\ni = len(s) - 1\r\nwhile i >=0 and k>0:\r\n\tif s[i]!='0':\r\n\t\tans=ans+1\r\n\telse:\r\n\t\tk=k-1\r\n\ti = i - 1\r\n\r\nif k==0:\r\n\tprint(ans)\r\nelse:\r\n\tif '0' in s:\r\n\t\tprint(len(s)-1)\r\n\t", "n,k = map(int, input().split(\" \"))\r\ns = str(n)\r\ns = s[::-1]\r\ncount = 0\r\nres = 0\r\nfor i in range(len(s)):\r\n if s[i] == '0':\r\n count += 1\r\n else:\r\n res += 1\r\n if count == k:\r\n print(res)\r\n exit()\r\nprint(len(s)-1)", "n, k = map(int, input().split())\nn = str(n)\ncnt = 0\nif n.count('0') >= k:\n i = 1\n while cnt != k:\n if n[-i] == '0':\n cnt += 1\n if cnt == k:\n break\n i += 1\n print(i - cnt)\nelse:\n print(len(n) - 1)\n", "inp = input()\r\ndata = inp.split()\r\nn = int(data[0])\r\nk = int(data[1])\r\n\r\ndef allZero(s):\r\n\tfor i in s:\r\n\t\tif i != \"0\":\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef removeChar(s, n):\r\n\treturn s[:n] + s[n+1:]\r\n\r\nnStr = data[0]\r\n\r\n#Count zeros\r\nzeros = 0\r\nfor char in nStr:\r\n if char == \"0\":\r\n zeros += 1\r\n\r\n#if k > len(nStr):\r\n#\t# Leave a 0\r\n#\tprint(len(nStr) - 1)\r\nif nStr == \"0\":\r\n print(0)\r\nelif zeros < k:\r\n print(len(nStr) - 1)\r\nelse:\r\n\r\n\tfailed = True\r\n\tcuts = 0\r\n\twhile failed:\r\n\t\tfailed = False\r\n\t\tjj = 0\r\n\t\tfor i in range(len(nStr)-1, -1, -1):\r\n\t\t\t\r\n\t\t\tif nStr[i] == \"0\":\r\n\t\t\t\tjj += 1\r\n\t\t\telse:\r\n\t\t\t\tfailed = True\r\n\t\t\t\tcuts += 1\r\n\t\t\t\tnStr = removeChar(nStr, i)\r\n\r\n\t\t\tif jj >= k:\r\n\t\t\t\tfailed = False\r\n\t\t\t\tbreak\r\n\r\n\tprint(cuts)\r\n", "n,k=list(map(int,input().split()))\r\na=str(n)\r\nb=0\r\nd=0\r\ne=0\r\nfor i in range(len(a)-1,-1,-1):\r\n if a[i]==\"0\":\r\n b=b+1\r\n else:\r\n d=d+1\r\n if b==k:\r\n e=1\r\n break\r\nif e==1:\r\n print(d)\r\nelse:\r\n print(len(a)-1)", "# from scipy.special import comb,perm\n# import math\n# x=1-2*(0.1587)\n# for i in range(1,10):\n# print(1-(1-x)**i)\n\nn,k=input().split()\nk=int(k)\nn=list(n)\n# print(n)\nans=0\nzeros=0\nfor i in n:\n if i =='0':\n zeros+=1\nif zeros>=k:\n i=len(n)-1\n while k:\n if n[i]=='0':\n k-=1\n else:\n ans+=1\n i-=1\n print(ans)\nelse:\n print(len(n)-1)\n \t \t \t \t\t \t\t\t\t \t \t\t\t \t", "n, k = input().split()\nn, k = n[::-1], int(k)\nr = 0\nfor i in range(len(n)):\n if n[i] != '0':\n r += 1\n if i-r+1 == k:\n break\nelse:\n r = len(n)-1\nprint(r)\n", "\r\nn,k=map(int,input().split())\r\nnz=0\r\nans=0\r\nn=str(n)\r\nl=len(n)\r\nfor i in range(l-1,-1,-1):\r\n if n[i]!=\"0\":\r\n ans+=1\r\n else:\r\n nz+=1\r\n if nz==k:\r\n break\r\nif nz!=k:\r\n print(l-1)\r\nelse:\r\n print(ans)", "nk = list(map(int, input().split()))\r\nn = str(nk[0])\r\nk = nk[1]\r\nnol = 0\r\nans = 0\r\nl = n.count('0')\r\nif l >= k:\r\n for i in range(len(n)-1, 0, -1):\r\n if nol == k:\r\n break\r\n if int(n[i]) == 0:\r\n nol += 1\r\n else:\r\n ans += 1\r\nelse:\r\n ans = len(n) - 1\r\n \r\nprint(ans)", "\r\nn,k= map(int,input().split())\r\nln = len(str(n))\r\nc = 0\r\nd = 0\r\nb = 0\r\nwhile n:\r\n y = n%10\r\n if y:\r\n d+=1\r\n else:\r\n c+=1\r\n if c==k:\r\n b = 1\r\n break\r\n n//=10\r\nprint(min(d,ln-1) if b else ln-1)", "n,k = input().split()\r\nn = n[::-1]\r\nk = int(k)\r\ntot_zeros = 0\r\ni = 0\r\n\r\nwhile i < len(n) and tot_zeros < k:\r\n tot_zeros += n[i] == '0'\r\n i+=1\r\n\r\n\r\nif i == len(n):\r\n print(len(n) - 1)\r\nelse:\r\n print(i-k)\r\n", "x,y=input().split(' ')\r\nif x.count('0')< int(y):\r\n print(len(x)-1)\r\nelse:\r\n num_z=0\r\n to_del=0\r\n for j in x[::-1]:\r\n if num_z>=int(y):\r\n break\r\n elif j=='0':\r\n num_z+=1\r\n else:\r\n to_del+=1\r\n print(to_del)", "n, k = input().split()\r\nk = int(k)\r\n\r\ndef isDivide(n, k):\r\n\tln = len(n)\r\n\tnumZero = 0\r\n\tfor i in range(ln-1, -1, -1):\r\n\t\tif (n[i] != \"0\"):\r\n\t\t\tbreak\r\n\t\tnumZero += 1\r\n\treturn (numZero >= k or numZero == ln)\r\n\r\nlst = list(n)\r\nsteps = 0\r\ni = 0\r\nwhile (not isDivide(\"\".join(lst), k)):\r\n\tfor i in range(len(lst)-1, -1, -1):\r\n\t\tif (lst[i] == \"0\"):\r\n\t\t\tcontinue\r\n\t\tdel lst[i]\r\n\t\tbreak\r\n\tsteps += 1\r\n\r\nif (\"\".join(lst) == \"0\"*len(lst)):\r\n\tsteps += len(lst) -1\r\nprint (steps)", "n,k=map(int,input().strip().split())\r\ns=list(str(n))\r\ns=s[::-1]\r\nco=0\r\nif s.count('0')<k:\r\n if s.count('0')==0:\r\n print(0)\r\n if s.count('0')>=1:\r\n print(len(s)-1)\r\nelse: \r\n for i in range(len(s)):\r\n if s[i]=='0':\r\n k-=1\r\n if k==0:\r\n break\r\n else:\r\n co+=1\r\n print(co)\r\n \r\n \r\n \r\n \r\n\r\n", "\"\"\" Created by Shahen Kosyan on 2/26/17 \"\"\"\n\nif __name__ == '__main__':\n n, k = [int(x) for x in input().split()]\n\n count = 0\n o_count = 0\n x = n\n\n for i in range(len(str(x))):\n if x % 10 != 0:\n count += 1\n else:\n o_count += 1\n\n x //= 10\n\n if o_count == k:\n break\n\n if o_count < k:\n count = len(str(n)) - 1\n\n print(count)\n", "n,k=input().split()\r\nk=int(k)\r\nz=n.count('0')\r\nif(z < k):\r\n print(len(n)-1)\r\nelse:\r\n n=n[::-1]\r\n p=0\r\n ans=0\r\n while(p!=k):\r\n if(n[p]=='0'):\r\n p=p+1\r\n else:\r\n ans=ans+1\r\n n=n[1:]\r\n print(ans)\r\n", "i, k = map(int,input().split())\r\nt = 0\r\n\r\nfor x in list(reversed(list(str(i)))):\r\n if x == '0':\r\n k -= 1\r\n else: t +=1\r\n if k == 0: print(t); exit()\r\nprint(len(str(i))-1)", "n,k=map(int,input().split())\r\nl=list(str(n))\r\nq=0\r\nif(n%10**k==0):\r\n print(0)\r\n\r\nelse:\r\n i=len(l)-1\r\n c=0\r\n while(i>0):\r\n s=''\r\n \r\n if(l[i]!='0'):\r\n l.pop(i)\r\n c+=1\r\n \r\n if(int(s.join(l))%(10**k)==0):\r\n q=1\r\n break\r\n \r\n i-=1\r\n if(q==1):\r\n print(c)\r\n else:\r\n if(l.count('0')>=1):\r\n print(len(str(n))-1)\r\n else:\r\n print(len(str(n)))", "n, k = map(int, input().split())\r\n\r\nn = str(n)\r\n\r\nif n.count('0') < k:\r\n print(len(n)-1)\r\nelse:\r\n number_of_digit, number_of_zero = 0, 0\r\n for digit in str(n)[::-1]:\r\n if digit == '0':\r\n number_of_zero += 1\r\n else:\r\n number_of_digit += 1\r\n if number_of_zero >= k:\r\n print(number_of_digit)\r\n break", "a,b=map(int,input().split())\r\nc=0\r\nc1=0\r\nl=[]\r\nl=list(map(int,str(a)))\r\ncount=l.count(0)\r\nle=len(l)\r\nif(b>count):\r\n print(le- 1)\r\nelse:\r\n for i in l[::-1]:\r\n if c==b:\r\n break\r\n if i==0:\r\n c+=1\r\n else:\r\n c1+=1\r\n print(c1)\r\n", "n , k = map(int,input().split())\nn = list(str(n))\ncounter = 0\nzero_counter = 0\nif n.count('0') >= k :\n\tfor i in range(len(n)-1 , -1 , -1):\n\t\tif (n[i] != '0'):\n\t\t\tcounter += 1\n\t\tif (n[i] == '0'):\n\t\t\tzero_counter += 1\n\t\tif (zero_counter == k):\n\t\t\tbreak\n\tprint(counter) \nelse: \n print(len(n) - 1)", "n, k = input().split()\r\nk = int(k)\r\nans = temp = 0\r\nfor i in range(len(n)-1, -1, -1):\r\n if n[i] == '0': \r\n temp += 1\r\n if temp == k: break\r\n else:\r\n ans += 1\r\nif temp < k: ans = len(n) -1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = input()[:-1].split()\r\nk = int(k)\r\nc = n.count('0')\r\nx = len(n)\r\nif c < k:\r\n print(x-1)\r\nelse:\r\n d = 0\r\n for i in range(x-1, -1, -1):\r\n if n[i] == '0':\r\n k -= 1\r\n if k == 0:\r\n break\r\n else:\r\n d += 1\r\n print(d)", "line = list(input().split())\r\nk = int(line[1])\r\nstring = line[0]\r\ncnt = 0\r\nn = 0\r\nb = False\r\nfor i in range(len(string) - 1, -1, -1):\r\n if string[i] != '0':\r\n cnt += 1\r\n else:\r\n n += 1\r\n if n == k:\r\n break\r\n if i == 0:\r\n b = True\r\nif b:\r\n print(cnt + n - 1)\r\nelse:\r\n print(cnt)", "# http://codeforces.com/contest/779/problem/A <<--finsihed\n# http://codeforces.com/contest/779/problem/B\n\ndef Pupils_redistribution():\n n = int(input())\n g1 = input().split()\n g1d = [0]*5\n g2 = input().split()\n g2d = [0]*5\n for i in g1:\n g1d[int(i)-1] += 1\n for i in g2:\n g2d[int(i)-1] += 1\n nd = [0] * 5\n for i in range(len(g1d)):\n a = g1d[i]-g2d[i]\n if a%2 == 0:\n nd[i] = a/2\n else:\n print(\"-1\")\n break\n else:\n if sum(nd) ==0:\n sums = 0\n for i in nd:\n if i >0:\n sums += i\n print(int(sums))\n else:\n print(\"-1\")\n#Pupils_redistribution()\ndef Weird_rounding():\n r= input().split()\n\n n = r[0]\n lenn = len(n)\n n2 = n\n k = int(r[1])\n ten = 10**k\n count = 0\n for i in range(lenn):\n if int(n2) % ten == 0:\n break\n if int(n2[lenn-i-1]) != 0:\n count += 1\n n2 = n2[:(lenn-i-1)] + n2[(lenn-i):]\n if int(n2) == 0 and len(n2) >1:\n print(count + len(n2) - 1)\n else:\n print(count)\n\n\nWeird_rounding()", "n, k = input().split(' ')\r\nk = int(k)\r\ncur = 0\r\nans = 0\r\ngreat = False\r\nfor c in reversed(n):\r\n if cur >= k:\r\n great = True\r\n break\r\n if c == '0':\r\n cur += 1\r\n else:\r\n ans += 1\r\nif great:\r\n print(ans)\r\nelse:\r\n print(len(n) - 1)", "a,k = [i for i in input().strip().split(' ')]\na = [int(i) for i in a]\nk = int(k)\nalen = len(a)\nindex = alen-1\ncuts = 0\nbadInput = False\nwhile k != 0:\n if index == -1:\n badInput = True\n break\n if a[index] == 0:\n k -= 1\n else:\n cuts += 1\n index -= 1\nif badInput:\n print(alen-1)\nelif k == 0:\n print(cuts)\nelse:\n print('you fucked it')\n", "import sys\r\n\r\ndef debug(x, table):\r\n for name, val in table.items():\r\n if x is val:\r\n print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)\r\n return None\r\n\r\ndef solve():\r\n n, k = input().split()\r\n k = int(k)\r\n zcnt = 0\r\n ans = 0\r\n\r\n for d in reversed(n):\r\n if d == '0':\r\n zcnt += 1\r\n\r\n if zcnt == k:\r\n print(ans)\r\n return\r\n else:\r\n ans += 1\r\n\r\n ans = len(n) - 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "import math\n\nn, k = [x for x in input().split()]\nk = int(k)\nv = []\nfor i in n:\n v.append(int(i))\ni = 0\ncount = 0\nwhile i < k and len(v) != 0:\n x = v.pop()\n if x != 0:\n count += 1\n else:\n i += 1\nif i == k:\n print(count)\nelse:\n print(len(n) - 1)\n\n\n", "x=list(map(int,input().split()))\r\nk=x[1]\r\nnu=str(x[0])\r\nl=len(nu)\r\nre=0\r\nflag=False\r\nfor i in range(l):\r\n if k == 0:\r\n flag=True\r\n break\r\n elif nu[l-1-i]== '0':\r\n k=k-1\r\n elif nu[l-1-i]!= '0':\r\n \r\n re+=1\r\nif flag:\r\n print(re)\r\nelse :\r\n print(re+(l-re-1))\r\n \r\n ", "from collections import Counter\n\ndef count_delete_digits(n, k):\n if n == 0:\n return 0\n n_str = str(n)\n length = len(n_str)\n if k >= length:\n if '0' in n_str:\n return length - 1\n else:\n return length\n\n if '0' not in n_str:\n return length\n\n if k > Counter(n_str)['0']:\n return length - 1\n deletes = 0\n zeros = 0\n for character in n_str[::-1]:\n if character == '0':\n zeros += 1\n if zeros == k:\n return deletes\n else:\n deletes += 1\n\n\ndef main():\n n, k = map(int, input().strip().split())\n print(count_delete_digits(n, k))\n\n\nif __name__ == '__main__':\n main()", "n,k=map(int,input().split())\r\ns=str(n)[::-1]\r\nc=0\r\nd=0\r\nif(s.count('0')<k):\r\n print(len(s)-1)\r\nelse:\r\n for i in range(len(s)):\r\n if(s[i]=='0'):\r\n c+=1\r\n else:\r\n d+=1\r\n if(c==k):\r\n break\r\n print(d)\r\n\r\n", "def f():\r\n n, k = [int(i) for i in input().split()]\r\n n = str(n)\r\n ans = len(n) - 1\r\n m = 0\r\n moves = 0\r\n while n:\r\n if n[-1] == \"0\":\r\n m += 1\r\n if m == k:\r\n break\r\n else:\r\n moves += 1\r\n n = n[:-1]\r\n else:\r\n moves = float(\"inf\")\r\n print(min(moves, ans))\r\n\r\n\r\nf()\r\n", "n, k = input().split()\r\nk = int(k)\r\nn = n[::-1]\r\ns = 0\r\nfor c in n:\r\n if k == 0:\r\n break\r\n if c != '0':\r\n s += 1\r\n else:\r\n k -= 1\r\nif k == 0:\r\n print(s)\r\nelse:\r\n print(len(n)-1)", "n, k = [str(j) for j in input().split()]\r\nk = int(k)\r\nzc = n.count('0')\r\nif zc >= k and len(n) > zc:\r\n count, zero_c = 0, 0\r\n for j in range(len(n) - 1, -1, -1):\r\n if n[j] == '0':\r\n zero_c += 1\r\n if zero_c == k:\r\n break\r\n else:\r\n count += 1\r\n print(count)\r\nelse:\r\n print(len(n) - 1)\r\n", "n, k = input().split()\r\nk = int(k)\r\nif n.count(\"0\")<k:\r\n print(len(n)-1)\r\n quit()\r\na = 0\r\nfor i in n[::-1]:\r\n if k==0:\r\n break\r\n if i==\"0\":\r\n k -= 1\r\n else:\r\n a += 1\r\nprint(a)", "n,k=list(map(int,input().split()))\r\nans=cnt=0\r\nwhile k and n:\r\n if n%10==0: k-=1\r\n else: ans+=1\r\n n//=10\r\n cnt+=1\r\nif(n>0): print(ans)\r\nelse :print(max(0,cnt-1))", "import sys\r\n\r\nn,k = input().split()\r\nk = int(k)\r\ncnt = cnt_zero = no = 0\r\nif len(n) < k and '0' in n:\r\n print(len(n)-1)\r\nelse:\r\n for i in range(len(n)-1,-1,-1):\r\n if n[i] == '0':\r\n cnt_zero += 1\r\n else:\r\n if i == 0 and k > cnt_zero:\r\n no = 1\r\n if k > cnt_zero:\r\n cnt += 1\r\n if no == 0:\r\n print(cnt)\r\n else:\r\n print(len(n)-1)\r\n", "a = input().split()\r\nn = int(a[0])\r\nk = int(a[1])\r\n\r\ns = str(n)\r\nlen_ = len(s)\r\nzeros = 0\r\nnzeros = 0\r\nflag = True\r\nfor i in range(len_-1, -1, -1):\r\n\tif(s[i] == '0'):\r\n\t\tzeros += 1\r\n\t\tif(zeros == k):\r\n\t\t\tprint(nzeros)\r\n\t\t\tflag = False\r\n\t\t\tbreak\r\n\telse:\r\n\t\tnzeros += 1\r\nif(flag):\r\n\tif(zeros > 0):\r\n\t\tprint(len_ - 1)\r\n\telse:\r\n\t\tprint(len_)\r\n", "n,k=input().split()\r\ni=len(n)-1\r\nj=len(n)-1\r\ncount=0\r\nindex=0\r\nindex1=0\r\nk=int(k)\r\nwhile j>=0:\r\n if n[j]=='0':\r\n index=j\r\n break\r\n j=j-1\r\nwhile i>=0:\r\n if n[i]=='0':\r\n count=count+1\r\n if count==k:\r\n index1=i\r\n break\r\n i=i-1\r\nif i==-1:\r\n print(len(n)-1)\r\nelse:\r\n ans=(index-index1)-1-(k-2)+len(n)-index-1\r\n print(ans)\r\n\r\n \r\n \r\n \r\n", "st = input().strip().split(' ')\ns = st[0]\nk = int(st[1])\nans = 0\nzc =0\nfor i in range(len(s) -1,-1,-1):\n if k > 0:\n if s[i]=='0':\n k -= 1\n zc +=1\n else: \n ans +=1\n else:\n break\nif k > 0:\n print(len(s) - 1)\nelse:\n print(ans)\n", "from math import log10\r\nn,k=map(int,input().split())\r\nans=0\r\ns=str(n)\r\np=s.count(\"0\")\r\nif p<k:\r\n print(len(s)-1)\r\nelse:\r\n while n%10**k!=0:\r\n rem=str(n%10**k)\r\n z=rem.count(\"0\")\r\n n=int(str(n)[:-len(rem)]+\"0\"*z)\r\n ans+=len(rem)-z\r\n print(ans)", "x,k=map(str,input().split())\r\nk=int(k)\r\nx=list(x)\r\nz=pow(10,k)\r\nx.reverse()\r\nm=0\r\nl=x.count('0')\r\nif(l==0):\r\n print(len(x))\r\nelif(l>0 and l<k):\r\n print(len(x)-1)\r\nelse:\r\n for i in range(len(x)):\r\n if(x[i]=='0'):\r\n m+=1\r\n if(m==k):\r\n s=i\r\n break\r\n print(i-k+1)\r\n", "n, k = map(int, input().split())\r\nn = str(n)\r\nind = -1\r\nf = 0\r\nfor i in range(1, len(n)+1):\r\n if n[-i] == \"0\":\r\n f += 1\r\n if f == k:\r\n ind = i\r\n break\r\n \r\nif ind == -1:\r\n print(len(n) - 1)\r\nelse:\r\n print(ind - k)", "s, k = input().split()\r\nk = int(k)\r\nN = len(s)\r\ns = s[::-1]\r\nn1 = 0\r\nn2 = 0\r\nl = float('inf')\r\nfor i in range(N):\r\n if s[i] == '0':\r\n n1 += 1\r\n if n1 == k:\r\n l = n2\r\n else:\r\n n2 += 1\r\n\r\nprint(min(l, N - 1))\r\n", "n,k=map(int,input().split())\r\nn=str(n)\r\nn=n[::-1]\r\nc=0\r\nfor i in range(len(n)):\r\n if n[i] == '0':\r\n c+=1\r\n if c==k:\r\n print(i-c+1)\r\n break\r\nelse:\r\n if c==0:\r\n print(len(n))\r\n elif c<k:\r\n print(len(n)-1)\r\n", "a, b = input().split()\nb = int(b)\nr = 0\n\ndef check(a, b):\n return a[-b:] == '0'*b\n\nif check(a, b):\n print(0)\n exit(0)\nfor i in range(len(a)-1, -1, -1):\n if a[i] != '0':\n a = a[:i] + a[i+1:]\n r += 1\n if check(a, b):\n print(r)\n exit(0)\n\nzeros = True\nfor i in a:\n if i != '0':\n zeros = False\n\nif not zeros:\n print(r)\nelse:\n print(r+len(a)-1)\n", "n, k = map(int, input().split())\r\nnLen = len(str(n))\r\n\r\nif nLen < k + 1:\r\n print(nLen - 1)\r\n exit()\r\n\r\ntotal = 0\r\nzeros = 0\r\n\r\nwhile zeros < k:\r\n digit = n % 10\r\n n //= 10\r\n total += 1 if digit != 0 else 0\r\n zeros += 1 if digit == 0 else 0\r\n\r\nprint(total if nLen - total > k else (nLen - 1))", "#!/usr/bin/env python\r\n\r\ndef main():\r\n n, k = input().split()\r\n k = int(k)\r\n\r\n if k == 0:\r\n print(0)\r\n return\r\n \r\n zeros = ans = 0\r\n for i in range(len(n)-1, -1, -1):\r\n if n[i] == '0':\r\n zeros += 1\r\n else:\r\n ans += 1\r\n \r\n if zeros == k:\r\n break\r\n else:\r\n ans = len(n) - 1\r\n\r\n print(ans)\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "def main():\r\n num , n =[int(i) for i in input().split()]\r\n s = str(num)\r\n if(n>=len(s)):\r\n print(len(s)-1)\r\n\r\n else:\r\n n_o = 0\r\n for i in s:\r\n if(i=='0'):\r\n n_o +=1\r\n if(n_o<n):\r\n print(len(s)-1)\r\n return\r\n\r\n i=len(s)-1\r\n ans=0\r\n while(i>=0 and n>0):\r\n if(s[i]=='0'):\r\n n-=1\r\n else:\r\n ans+=1\r\n\r\n i-=1\r\n print(ans)\r\nif __name__=='__main__':\r\n main()", "a,b=input().split()\r\nb=int(b)\r\nn=len(a)\r\nm=a.count('0')\r\nx=0\r\nif m<b:\r\n print(str(n-1))\r\nelse:\r\n for i in range(1,n+1):\r\n if a[-i]=='0':\r\n b-=1\r\n else:\r\n x+=1\r\n if b==0:\r\n break\r\n print(x)\r\n \r\n \r\n \r\n", "\r\ndef _input(): return map(int, input().split())\r\n\r\nn, k = _input()\r\nres = 0\r\ns = str(n); i = len(s)-1\r\ncnt=0\r\nwhile i>=0:\r\n if s[i]=='0': cnt+=1\r\n else: res+=1\r\n if cnt==k: break\r\n i-=1\r\nif cnt != k:\r\n if cnt > 0: res = len(s)-1\r\n else: res=len(s)\r\nprint(res)\r\n", "def solve(test):\n n, k = test.split()\n k = int(k)\n cnt = 0\n rm_cnt = 0\n res = []\n for d in reversed(n):\n if d == '0' and cnt < k:\n res.append(d)\n cnt += 1\n elif cnt >= k:\n res.append(d)\n else:\n rm_cnt += 1\n if cnt < k:\n return len(n) - 1\n return rm_cnt\n\n\ndef get_input():\n return input()\n\n\ndef go():\n print(solve(get_input()))\n\ngo()", "a,b=[int(i) for i in input().split()]\r\na=str(a)\r\nc=a.count('0')\r\nif(c>=b):\r\n a=a[::-1]\r\n e=0\r\n for i in range(0,len(a)):\r\n if(a[i]=='0'):\r\n e=e+1\r\n if(e==b):\r\n l=i\r\n break\r\n a=a[0:l]\r\n print(len(a)-a.count('0'))\r\nelse:\r\n print(len(a)-1)", "n,k=map(int,input().split())\r\nn=str(n)\r\nif n.count('0')<k:\r\n print(len(n)-1)\r\nelse:\r\n n=n[::-1]\r\n ans=0\r\n j=0\r\n for i in range(0,len(n)):\r\n if n[i]=='0' and j<k:\r\n j+=1\r\n ans=i\r\n print(ans-j+1)\r\n ", "n,k=input().split()\r\nk=int(k)\r\nc=v=0\r\nfor u in n[::-1]:\r\n if u=='0':v+=1\r\n else:c+=1\r\n if v==k:break\r\nprint([c,len(n)-1][v<k])", "\r\n\r\nn, k = input().split(\" \")\r\nk = int(k)\r\nzeros=0\r\ni = 0\r\nnn = list(n)\r\nwhile len(nn) > 0:\r\n a = nn.pop(-1)\r\n if a == '0':\r\n zeros += 1\r\n else:\r\n i+=1\r\n if zeros == k:\r\n print(i)\r\n break\r\n if len(nn) == 0:\r\n i += (zeros-1)\r\n print(i)\r\n break\r\n", "n, k = input().split()\r\nnn = len(n)\r\nkk = int(k)\r\n\r\nif nn < kk:\r\n print(nn - 1)\r\nelse:\r\n p = kk\r\n i = len(n) - 1\r\n l = 0\r\n while p > 0 and i >= 0:\r\n if n[i] != '0':\r\n n = n[:i] + n[i + 1:]\r\n l += 1\r\n i -= 1\r\n else:\r\n p -= 1\r\n i -= 1\r\n\r\n if len(n) < kk:\r\n print(nn - 1)\r\n else:\r\n print(l)\r\n", "n,k=map(int,input().split())\r\nkk=int(\"1\"+\"0\"*k)\r\nans=0\r\nif n<kk or list(str(n)).count(\"0\")<k:\r\n ans=len(str(n))-1\r\nelse:\r\n n=list(str(n))\r\n zc=0\r\n ec=0\r\n for i in range(len(n)-1,-1,-1):\r\n if n[i]==\"0\":\r\n zc+=1\r\n else:\r\n ec+=1\r\n if zc==k:\r\n ans=ec\r\n break\r\nprint(ans)\r\n \r\n \r\n", "#!/usr/bin/env python3\n# -*- coding='utf-8' -*-\n\nn, k = input().split()\nk = int(k)\n\nnum_0 = n.count('0')\ncnt = 0\nans = 0\nif num_0 >= k:\n for ch in n[::-1]: \n if ch == '0':\n cnt+=1\n else:\n ans+=1\n if cnt >= k:\n break\nelse:\n ans = len(n) - 1\n\nprint(ans)\n\n", "n, k= input().split()\nk = int(k)\nif n.count('0') < k:\n\tprint(len(n)-1)\nelse:\n\tcount = 0\n\tfor i in n[::-1]:\n\t\tif k > 0:\n\t\t\tif i != \"0\":\n\t\t\t\tcount+=1\n\t\t\telse:\n\t\t\t\tk-=1\n\t\telse:\n\t\t\tbreak\n\tprint(count)\n", "n, k = input().split()\nk = int(k)\nn = list(n)\ni = len(n) - 1\ncount = 0\nwhile i >= 0 and k > 0:\n if n[i] == '0':\n k -= 1\n i -= 1\n else:\n i -= 1\n count += 1\nif i == -1:\n count = len(n) -1\nprint(count)\n", "m,k=input().split()\n\nc=0\n\nfor i in range(-1,-1*len(m),-1):\n\n if m[i]=='0':c+=1\n\n if c==int(k):break\n\nprint (-1*i-c if c==int(k) else len(m)-1)\n\n\n\n# Made By Mostafa_Khaled", "def solve(l):\r\n for i in range(5):\r\n if(abs(l[i]&1)):\r\n return -1\r\n ans = 0\r\n for i in range(5):\r\n if(l[i]>0):\r\n ans+=(l[i]//2)\r\n\r\n return ans\r\nn, k = map(int, input().split())\r\nn =str(n)\r\nans = 0\r\nfor i in range(len(n)):\r\n if(k<=0):\r\n break\r\n if(n[len(n)-i-1]!=\"0\"):\r\n ans+=1\r\n\r\n else:\r\n k-=1\r\n\r\nif k<=0:\r\n print(ans)\r\nelse:\r\n print(len(n)-1)", "n, k = input().split()\r\nk = int(k)\r\nw = 0\r\nzeros = 0\r\n\r\nfor digit in n[::-1]:\r\n if(digit == '0'):\r\n zeros += 1\r\n if(zeros == k):\r\n break\r\n else:\r\n w += 1\r\n\r\nif(zeros != k):\r\n w = len(n) - 1\r\n\r\nprint(w)", "import sys\r\nn, k = map(int, input().split())\r\nn = str(n)\r\nif (n.count('0') >= k):\r\n p = len(n) - 1\r\n ctr = 0\r\n dell = 0\r\n while (p >= 0):\r\n if ctr == k:\r\n break\r\n if n[p] == '0':\r\n ctr += 1\r\n else:\r\n dell += 1\r\n p -= 1\r\n print(dell)\r\nelse:\r\n print(len(n) - 1)\r\n", "n,k = map(int, input().split())\r\n\r\n\r\nans = 0\r\nn = str(n)\r\ncnt= 0\r\nfor i in range(len(n)-1,-1,-1):\r\n if k<=0: break\r\n if n[i]==\"0\":\r\n k-=1\r\n else:\r\n cnt+=1\r\n \r\nif k<=0: \r\n print(cnt)\r\nelse:\r\n print(len(str(n))-1)", "n,k=list(map(int,input().split()))\nans,c=0,0\nwhile k>0 and n>0:\n if n % 10 == 0: k -= 1\n else: ans += 1\n n //= 10\n c += 1\nprint(ans if n>0 else max(0,c-1))\n", "n, k = input().split()\nk = int(k)\nc = 0\nt = len(n)\nfor i in range(t):\n\tif n[i] == '0':\n\t\tc += 1\nif c<k:\n\tprint(t-1)\nelse:\n\tx = 0\n\tfor i in range(1, t+1):\n\t\tif n[-i] == '0':\n\t\t\tx += 1\n\t\tif x == k:\n\t\t\tprint(i - x)\n\t\t\tbreak\n\t\n", "#leer datos\r\na=input()\r\na=a.split()\r\nn=int(a[0])\r\nk=int(a[1])\r\n#invertir numero para comparar ceros\r\nm=list(str(n))\r\nm.reverse()\r\nres=0\r\ncero=0\r\nceros=0\r\nfor r in m:\r\n if r=='0':\r\n ceros+=1\r\n#cuando\r\nif ceros<k:\r\n res=(len(str(n))-1)\r\nelse:\r\n for j in m:\r\n if j!='0':\r\n res+=1\r\n else:\r\n cero+=1\r\n if cero==k:\r\n break\r\nprint(res)\r\n", "n,k=input().split()\r\nk=int(k)\r\nn=list(n)[::-1]\r\ncnt0=0\r\nans=0\r\ncnt=0\r\nfor x in n:\r\n if cnt0==k: break\r\n cnt+=1\r\n if x=='0': cnt0+=1\r\n else: ans+=1\r\nif cnt0==k and cnt<len(n): print(ans)\r\nelse: print(len(n)-1)", "n, k = input().split()\nk = int(k)\ncurrent_nulls = 0\ncurrent = 0\nfor letter in n[::-1]:\n if letter == '0':\n current_nulls += 1\n else:\n current += 1\n if current_nulls == k:\n print(current)\n break\nelse:\n print(len(n)-1)\n", "n, k = input().split()\r\nk = int(k)\r\n\r\nc = 0\r\nd = 0\r\nfor i in range(len(n)):\r\n if n[len(n) - i - 1] == \"0\":\r\n c += 1\r\n if c == k:\r\n print(d)\r\n quit()\r\n else:\r\n d += 1\r\nprint(len(n) - 1)\r\n", "n, k = input().split()\r\ni, j, k = 0, 0, int(k)\r\n\r\nfor ch in n[::-1]:\r\n if ch == '0':\r\n i += 1\r\n if i == k:\r\n print(j)\r\n break\r\n else:\r\n j += 1\r\nelse:\r\n print(len(n) - 1)", "s, n = input().split()\r\nn = int(n)\r\nres = 0\r\nc = 0\r\nfor i in range(len(s)):\r\n if s[-1-i] == \"0\":\r\n c += 1\r\n else:\r\n res += 1\r\n if c == n:\r\n break\r\nif c != n:\r\n print(len(s) - 1)\r\nelse:\r\n print(res)\r\n \r\n", "n, k = map(int, input().split())\r\ne = 10**k\r\nstr(n)\r\nif(int(n)<e):\r\n print(len(str(n))-1)\r\nelse:\r\n a = list(str(n))\r\n ans = 0\r\n iter = list(range(0, len(a)))\r\n iter.reverse()\r\n for i in iter:\r\n if a[i]=='0':\r\n ans+=1\r\n if ans<k:\r\n print(len(str(n))-1)\r\n else:\r\n q = 0\r\n w = 0\r\n for i in iter:\r\n if a[i]=='0':\r\n q+=1\r\n else:\r\n w+=1\r\n if q == k:\r\n print(w)\r\n break", "# Author : Mohamed Yousef \r\n# Date : 2022-12-04\r\nimport sys,math,bisect,collections,itertools,heapq\r\nfrom collections import defaultdict,deque\r\nn,k =map(int,sys.stdin.readline().split())\r\nn=str(n)\r\n# print(n)\r\nzero=0\r\nremoved=0\r\nfor i in n[::-1]:\r\n # print(i)\r\n if zero==k:\r\n print(removed)\r\n quit()\r\n if i==\"0\":\r\n zero+=1\r\n else:\r\n removed+=1\r\n\r\nprint(len(n)-1)\r\n\r\n\r\n", "#100 9\r\nn, k = input().split()\r\nk = int(k)\r\nl = len(n)\r\nif l < k or n.count('0')<k:\r\n print (l-1)\r\nelse:\r\n reverse = n[::-1]\r\n remove = 0\r\n z = 0\r\n for x in reverse:\r\n remove += x!='0'\r\n z += x=='0'\r\n if z == k:\r\n print (remove)\r\n break" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn=int(input())\r\nE=[[] for i in range(n+1)]\r\n\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n E[x].append(y)\r\n E[y].append(x)\r\n\r\nK=list(map(int,input().split()))\r\n\r\ndef dfs(fr,target):\r\n Q=[fr]\r\n USE=[-1]*(n+1)\r\n\r\n USE[fr]=0\r\n\r\n while Q:\r\n x=Q.pop()\r\n\r\n for to in E[x]:\r\n if USE[to]==-1:\r\n USE[to]=x\r\n Q.append(to)\r\n\r\n ANS=[target]\r\n now=target\r\n\r\n while now!=fr:\r\n now=USE[now]\r\n ANS.append(now)\r\n\r\n \r\n return ANS[::-1]\r\n \r\nANS=[]\r\n\r\nnow=1\r\nK.append(1)\r\n\r\nfor k in K:\r\n X=dfs(now,k)\r\n now=k\r\n\r\n if ANS and ANS[-1]==X[0]:\r\n ANS.pop()\r\n ANS+=X\r\n else:\r\n ANS+=X\r\n\r\nif len(ANS)==n*2-1:\r\n print(*ANS)\r\nelse:\r\n print(-1)\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 visit = [0] * (n + 1)\r\n visit[s] = 1\r\n parent = [-1] * (n + 1)\r\n while q:\r\n i = q.popleft()\r\n for j in G[i]:\r\n if not visit[j]:\r\n q.append(j)\r\n visit[j] = 1\r\n parent[j] = i\r\n return parent\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\nx = [1] + list(map(int, input().split())) + [1]\r\nans = [1]\r\nfor i in range(len(x) - 1):\r\n s, t = x[i], x[i + 1]\r\n parent = bfs(s)\r\n p = []\r\n while s ^ t:\r\n p.append(t)\r\n t = parent[t]\r\n for j in reversed(p):\r\n ans.append(j)\r\nif len(ans) ^ (2 * n - 1):\r\n ans = [-1]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "marked = [False] * 300\r\npath = []\r\n\r\ndef dfs(node, target):\r\n path.append(node+1)\r\n if node == target:\r\n return True\r\n marked[node] = True\r\n for n in g[node]:\r\n if not marked[n]:\r\n added = dfs(n, target)\r\n if not added:\r\n path.pop()\r\n else:\r\n return True\r\n \r\n return False\r\n\r\n\r\ndef valid(p):\r\n for i in range(len(p)-1):\r\n start = p[i]\r\n end = p[i+1]\r\n for j in range(i+1,len(p)-1):\r\n if p[j] == start and p[j+1] == end:\r\n return False\r\n \r\n return True\r\n\r\n\r\n\r\nN = int(input())\r\ng = [[] for i in range(300)]\r\n\r\nfor i in range(N-1):\r\n a, b = [int(x)-1 for x in input().split()]\r\n g[a].append(b)\r\n g[b].append(a)\r\n\r\norder = [int(x)-1 for x in input().split()]\r\norder.insert(0,0)\r\norder.append(0)\r\n\r\nfor i in range(len(order)-1):\r\n marked = [False] * 300\r\n dfs(order[i],order[i+1])\r\n path.pop()\r\npath.append(1)\r\n\r\nif valid(path):\r\n print(\" \".join([str(x) for x in path]))\r\nelse:\r\n print('-1')", "n = int(input())\r\nadj = [[] for i in range(n)]\r\nadj2 = [[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v = map(int,input().split())\r\n adj[u-1].append(v-1)\r\n adj[v-1].append(u-1)\r\n\r\nleaf = {}\r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n leaf[a[i]-1] = i\r\ninf = 200000\r\ndef dfs1(v,frm,adj2):\r\n if len(adj[v]) == 1 and v!=0:\r\n return (inf if v not in leaf else leaf[v],v)\r\n best = float(\"inf\")\r\n for u in adj[v]:\r\n if u != frm:\r\n c = dfs1(u,v,adj2)\r\n adj2[v].append(c)\r\n best = min(best,c[0])\r\n return (best,v)\r\n\r\ndfs1(0,-1,adj2) \r\npath = []\r\nfor i in range(n):\r\n adj2[i].sort()\r\n#print(*adj2)\r\ndef dfs2(v,frm,path):\r\n path.append(v+1)\r\n for _,u in adj2[v]:\r\n if u!=frm:\r\n dfs2(u,v,path)\r\n if frm!=-1:\r\n path.append(frm+1) \r\ndfs2(0,-1,path)\r\ngd = []\r\nfor i in path:\r\n if i-1 in leaf:\r\n gd.append(i)\r\n\r\nif gd == a:\r\n print(*path)\r\nelse:\r\n print(-1)\r\n", "def solve():\r\n\tn = int(input())\r\n\tg = [[] for _ in range(n + 1)]\r\n\tfor i in range(n - 1):\r\n\t\ta, b = map(int, input().split(' '))\r\n\t\tg[a].append(b)\r\n\t\tg[b].append(a)\r\n\r\n\tlfs = list(map(int, input().split(' ')))\r\n\tk = len(lfs)\r\n\r\n\tpar = [0 for _ in range(n + 1)]\r\n\tdef gp(x, p):\r\n\t\tpar[x] = p\r\n\t\tfor y in g[x]:\r\n\t\t\tif y != p:\r\n\t\t\t\tgp(y, x)\r\n\tgp(1, 0)\r\n\r\n\tleaf_sub = [{} for _ in range(n + 1)]\r\n\r\n\tfor i in range(1, n + 1):\r\n\t\tif len(g[i]) > 1:\r\n\t\t\tcontinue\r\n\t\t\r\n\t\tv = par[i]\r\n\t\tpre = i\r\n\t\twhile v > 0:\r\n\t\t\tleaf_sub[v][i] = pre\r\n\t\t\tpre = v\r\n\t\t\tv = par[v]\r\n\t\t\r\n\tcount = {}\r\n\tdef inc(a, b):\r\n\t\tif a > b:\r\n\t\t\ta, b = b, a\r\n\t\tif (a, b) not in count:\r\n\t\t\tcount[(a, b)] = 1\r\n\t\telse:\r\n\t\t\tif count[(a, b)] >= 2:\r\n\t\t\t\tprint(-1)\r\n\t\t\t\texit(0)\r\n\t\t\tcount[(a, b)] = 2\r\n\r\n\tans = [1]\r\n\tcur = 1\r\n\tfor x in lfs:\r\n\t\twhile x not in leaf_sub[cur]:\r\n\t\t\tinc(par[cur], cur)\r\n\t\t\tcur = par[cur]\r\n\t\t\tans.append(cur)\r\n\t\t\tassert cur > 0\r\n\t\twhile cur != x:\r\n\t\t\tnex = leaf_sub[cur][x]\r\n\t\t\tinc(cur, nex)\r\n\t\t\tcur = nex\r\n\t\t\tans.append(cur)\r\n\r\n\twhile cur != 1:\r\n\t\tinc(par[cur], cur)\r\n\t\tcur = par[cur]\r\n\t\tans.append(cur)\r\n\t\r\n\tprint(' '.join(map(str, ans)))\r\n\r\n\r\nsolve()", "import sys\ninput = sys.stdin.readline\nfrom collections import deque\n\ndef build_tree(edges, root):\n children = dict()\n parent = dict()\n stack = deque()\n stack.append(root)\n parent[root] = -1\n while stack:\n u = stack.pop()\n children[u] = []\n for v in edges[u]:\n if v != parent[u]:\n stack.append(v)\n children[u].append(v)\n parent[v] = u\n return children, parent\n\n# def visit(u, children, parent, data):\n# return\n\n# def postvisit(u, children, parent, data):\n# data[u] = set().union(*[data[v] for v in children[u]])\n# data[u].add(u)\n \n# def explore_tree(children, parent, root, data):\n# stack = deque()\n# stack.append((root, 0))\n# while stack:\n# u, b = stack.pop()\n# if b == 0:\n# visit(u, children, parent, data)\n# stack.append((u, 1))\n# for v in children[u]:\n# stack.append((v, 0))\n# else:\n# postvisit(u, children, parent, data)\n\ndef get_route(parent, root, u):\n route = []\n while u != root:\n route.append(u)\n u = parent[u]\n route.append(u)\n return list(reversed(route))\n\ndef find_path(children, parent, root, route, l):\n path = []\n seen = set()\n seen_count = dict()\n stack = deque()\n stack.append((root, 0))\n i = 0\n while stack:\n u, depth = stack.pop()\n path.append(u)\n seen.add(u)\n if i == len(l):\n continue\n\n if not children[u]:\n if depth + 1 != len(route[l[i]]) or route[l[i]][depth] != u:\n return path, False\n i += 1\n else:\n if u not in seen_count:\n seen_count[u] = 0\n if seen_count[u] == len(children[u]):\n continue\n if len(route[l[i]]) < depth + 2:\n return path, False\n if route[l[i]][depth] != u:\n return path, False\n if route[l[i]][depth + 1] in seen:\n return path, False\n if route[l[i]][depth + 1] not in children[u]:\n return path, False\n stack.append((u, depth))\n stack.append((route[l[i]][depth + 1], depth + 1))\n seen_count[u] += 1\n return path, i == len(l)\n\nn = int(input())\nedges = dict()\nfor _ in range(n - 1):\n u, v = map(int, input().split())\n if u not in edges:\n edges[u] = []\n if v not in edges:\n edges[v] = []\n edges[u].append(v)\n edges[v].append(u)\nchildren, parent = build_tree(edges, 1)\nl = [int(i) for i in input().split()]\nroute = dict()\nfor i in l:\n route[i] = get_route(parent, 1, i)\npath, valid = find_path(children, parent, 1, route, l)\nif valid:\n print(\" \".join(map(str, path)))\nelse:\n print(-1)\n", "def ni(): return int(input())\r\ndef ia(): return list(map(int, input().split()))\r\n\r\n\r\ndef pod(g, root=0):\r\n n = len(g)\r\n par = [-1 for _ in range(n)]\r\n odr = [-1 for _ in range(n)]\r\n dep = [-1 for _ in range(n)]\r\n vis = [False for _ in range(n)]\r\n\r\n odr[root] = 0\r\n dep[root] = 0\r\n\r\n ptr = 1\r\n for i in range(n):\r\n cur = odr[i]\r\n vis[cur] = True\r\n for nex in g[odr[i]]:\r\n if not vis[nex]:\r\n par[nex] = cur\r\n odr[ptr] = nex\r\n dep[nex] = dep[cur] + 1\r\n ptr += 1\r\n\r\n return par, odr, dep\r\n\r\n\r\ndef is_subsequence(arr1, arr2):\r\n i, j = 0, 0\r\n\r\n while i < len(arr1) and j < len(arr2):\r\n if arr1[i] == arr2[j]:\r\n i += 1\r\n j += 1\r\n\r\n return i == len(arr1)\r\n\r\n\r\ndef dfs(g, cur, vis, cost, ans):\r\n vis[cur] = True\r\n ans.append(cur + 1)\r\n for nex in sorted(g[cur], key=lambda x: cost[x]):\r\n if not vis[nex]:\r\n dfs(g, nex, vis, cost, ans)\r\n ans.append(cur + 1)\r\n\r\n\r\nn = ni()\r\ng = [[] for _ in range(n)]\r\n\r\nfor i in range(n - 1):\r\n x, y = ia()\r\n g[x - 1].append(y - 1)\r\n g[y - 1].append(x - 1)\r\n\r\nleaves = ia()\r\ncost = [10000 for _ in range(n)]\r\nfor idx, leaf in enumerate(leaves):\r\n cost[leaf - 1] = idx\r\n\r\npar, odr, dep = pod(g)\r\n\r\nfor node in odr[::-1]:\r\n for nex in g[node]:\r\n if nex != par[node]:\r\n cost[node] = min(cost[nex], cost[node])\r\n\r\nans = []\r\ndfs(g, 0, [False for _ in range(n)], cost, ans)\r\nprint(\" \".join(map(str, ans)) if is_subsequence(leaves, ans) else -1)\r\n", "class Node:\n def __init__(self, data=None):\n self.data = data\n self.connections = []\n self.path = []\n\n\nclass Tree:\n def __init__(self):\n self.root = None\n self.nodes = {}\n\n def addConnections(self, p, c):\n if p not in self.nodes:\n parent = Node(p)\n self.nodes[p] = parent\n else:\n parent = self.nodes[p]\n if c not in self.nodes:\n child = Node(c)\n self.nodes[c] = child\n else:\n child = self.nodes[c]\n if p == 1:\n self.root = parent\n self.root.path = [1]\n if c == 1:\n self.root = child\n self.root.path = [1]\n parent.connections.append(child)\n child.connections.append(parent)\n\n def dfsWithPath(self, nodeDict):\n currentNode = self.root\n stack = [currentNode]\n visited = []\n while stack:\n currentNode = stack.pop()\n visited.append(currentNode.data)\n stack.extend([x for x in currentNode.connections if x.data not in visited])\n for node in currentNode.connections:\n node.path = currentNode.path + [node.data]\n nodeDict[node.data] = node.path\n\n\nn = int(input())\ntree = Tree()\n\nfor i in range(n - 1):\n [p, c] = [int(x) for x in input().split()]\n tree.addConnections(p, c)\n\nnodeDict = {}\ntree.dfsWithPath(nodeDict)\n\nleaves = [int(x) for x in input().split()]\nroot = tree.root\ntotalPath = [root.data]\ncurrentNode = root.data\ncurrentNumber = root.data\ncurrentPath = []\n\nfor leaf in leaves:\n found = False\n while not found:\n if currentNode in nodeDict[leaf]:\n found = True\n totalPath = totalPath + nodeDict[leaf][nodeDict[leaf].index(currentNode) + 1:]\n currentNode = leaf\n currentPath = nodeDict[leaf].copy()\n currentNumber = -2\n else:\n currentNode = currentPath[currentNumber]\n totalPath.append(currentNode)\n currentNumber -= 1\n\ntotalPath = totalPath + nodeDict[leaf][::-1][1:]\n\nif len(totalPath) == 2 * n - 1:\n res = \"\"\n for i in totalPath:\n res = res + str(i) + \" \"\n print(res)\nelse:\n print('-1')\n", "import sys\nreadline = sys.stdin.readline\n\nN = int(readline())\ntree = [[] for _ in range(N + 1)]\nweights = [[N + 1 + i, -1] for i in range(N + 1)]\n\n\ndef clear_tree(node: int, parent: int):\n tree[node] = list(set(tree[node]) - {parent})\n if len(tree[node]) == 0:\n return\n for child in tree[node]:\n clear_tree(child, node)\n weights[node][0] = min(weights[node][0], weights[child][0])\n weights[node][1] = max(weights[node][1], weights[child][1])\n # buf = list(tree[node])\n tree[node].sort(key=lambda x: weights[x][0])\n for i in range(len(tree[node]) - 1):\n if N > weights[tree[node][i]][1] > weights[tree[node][i + 1]][0]:\n print(-1)\n exit(0)\n\ndef travel_tree(node: int) -> list:\n result = [node]\n for child in tree[node]:\n result.extend(travel_tree(child))\n result.append(node)\n return result\n\nfor _ in range(N - 1):\n a, b = [int(w) for w in readline().split()]\n tree[a].append(b)\n tree[b].append(a)\norder = [int(w) for w in readline().split()]\nfor idx, node in enumerate(order):\n if len(tree[node]) != 1 or node == 1:\n print(-1)\n exit(1)\n weights[node] = [idx, idx]\n\nclear_tree(1, -1)\n\nprint(*travel_tree(1))", "from collections import defaultdict\r\n\r\nclass Solution:\r\n def __init__(self):\r\n pass \r\n\r\n def solve_and_print(self):\r\n tree = Tree()\r\n parents = [None] * (tree.n+1)\r\n parents[1] = 1 \r\n tree.set_parents(1, parents)\r\n leaves_path = defaultdict(list)\r\n for leaf in tree.leaves:\r\n node = leaf\r\n path = []\r\n while node != 1:\r\n path.append(node)\r\n node = parents[node]\r\n path.append(1)\r\n leaves_path[leaf] = list(reversed(path))\r\n path = tree.create_path(leaves_path)\r\n counter = defaultdict(int)\r\n for i in range(len(path) - 1):\r\n counter[(min(path[i], path[i + 1]), max(path[i], path[i + 1]))] += 1\r\n counter = counter.values()\r\n if max(counter) == 2 and min(counter) == 2:\r\n print(' '.join([str(i) for i in tree.create_path(leaves_path)]))\r\n else:\r\n print(-1)\r\n\r\nclass Tree:\r\n def __init__(self):\r\n self.n = int(input())\r\n self.tree = defaultdict(list)\r\n for _ in range(self.n-1):\r\n u, v = [int(x) for x in input().split()]\r\n self.tree[u].append(v)\r\n self.tree[v].append(u)\r\n self.leaves = [int(x) for x in input().split()]\r\n \r\n def set_parents(self, node, parents):\r\n for i in self.tree[node]:\r\n if parents[i] is None:\r\n parents[i] = node\r\n self.set_parents(i, parents)\r\n\r\n def create_path(self, leaves_path):\r\n output = []\r\n node = 0\r\n for i in range(len(self.leaves) - 1):\r\n leaf = self.leaves[i]\r\n output += leaves_path[leaf][node:]\r\n j = 0\r\n while j < len(leaves_path[leaf]) and j < len(leaves_path[self.leaves[i + 1]]) and \\\r\n leaves_path[leaf][j] == leaves_path[self.leaves[i + 1]][j]:\r\n j += 1\r\n node = j - 1\r\n output += list(reversed(leaves_path[leaf][j:-1]))\r\n leaf = self.leaves[-1]\r\n output += leaves_path[leaf][node:]\r\n output += list(reversed(leaves_path[leaf][:-1]))\r\n return output\r\n\r\nif __name__ == \"__main__\":\r\n Solution().solve_and_print()", "def process(T, A):\r\n g = {}\r\n for a, b in T:\r\n if a not in g:\r\n g[a] = [None, set([])]\r\n if b not in g:\r\n g[b] = [None, set([])]\r\n g[a][1].add(b)\r\n g[b][1].add(a)\r\n start = [1]\r\n while len(start) > 0:\r\n next_s = []\r\n for x in start:\r\n for y in g[x][1]:\r\n if g[y][0] is None:\r\n g[y][0] = x\r\n next_s.append(y)\r\n start = next_s\r\n seen = {1: [0]}\r\n answer = [1]\r\n for x in A:\r\n L = []\r\n while x not in seen:\r\n L.append(x)\r\n x = g[x][0]\r\n while x !=answer[-1]:\r\n x1 = g[answer[-1]][0]\r\n if x1 not in seen:\r\n seen[x1] = []\r\n seen[x1].append(len(answer))\r\n if len(seen[x1]) > len(g[x1][1]):\r\n return [-1]\r\n answer.append(x1)\r\n if len(answer) > 2*len(T)+10:\r\n break\r\n m = len(L)\r\n for i in range(m):\r\n x1 = L[m-1-i]\r\n if x1 not in seen:\r\n seen[x1] = []\r\n seen[x1].append(len(answer))\r\n if len(seen[x1]) > len(g[x1][1]):\r\n return [-1]\r\n answer.append(x1)\r\n while answer[-1] != 1:\r\n x1 = g[answer[-1]][0]\r\n if x1 not in seen:\r\n seen[x1] = []\r\n seen[x1].append(len(answer))\r\n if x1 != 1 and len(seen[x1]) > len(g[x1][1]):\r\n return [-1]\r\n answer.append(x1)\r\n return answer\r\n \r\nn = int(input())\r\nT = []\r\nfor i in range(n-1):\r\n a, b = [int(x) for x in input().split()]\r\n T.append([a, b])\r\nA = [int(x) for x in input().split()]\r\nanswer = process(T, A)\r\nprint(' '.join(map(str, answer)))", "t=int(input())\r\nmy_dict={i+1:[] for i in range(t)}\r\nfor i in range(t-1):\r\n a,b=map(int,input().split())\r\n my_dict[a].append(b)\r\n my_dict[b].append(a)\r\ns=list(map(int,input().split()))\r\nmy_dict2={i+1:[] for i in range(t)}\r\nqueue=[1]\r\nvis=[1]*(t)\r\nvis[0]=0\r\nwhile queue:\r\n ele=queue.pop(0)\r\n for i in my_dict[ele]:\r\n if vis[i-1] :\r\n vis[i-1]=0\r\n my_dict2[ele].append(i)\r\n queue.append(i)\r\nlistt=[]\r\nele=1\r\n\r\ndef logic(my_dict2,ele):\r\n listt=[]\r\n for i in my_dict2[ele]:\r\n listt2=logic(my_dict2,i)\r\n for j in listt2:\r\n listt.append([ele]+j)\r\n if len(listt)==0:\r\n return [[ele]]\r\n return listt\r\nlistt=logic(my_dict2,1)\r\nlistt2=[-1]*t\r\nfor i in listt:\r\n listt2[i[-1]-1]=i\r\nans=[]\r\ndef logic2(listt1,listt2):\r\n for i in range(min(len(listt1),len(listt2))-1):\r\n if listt1[i+1]!=listt2[i+1]:\r\n a=list(listt1[i:-1])\r\n a.reverse()\r\n return a+list(listt2[i+1:])\r\nans=listt2[s[0]-1]\r\nfor i in range(len(s)-1):\r\n a=listt2[s[i]-1]\r\n b=listt2[s[i+1]-1]\r\n ans.extend(logic2(a,b))\r\na=listt2[s[-1]-1][:-1]\r\na.reverse()\r\nans.extend(a)\r\nif len(ans)>2*(t-1)+1:\r\n print(-1)\r\nelse:\r\n print(*ans)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nadj = [[] for _ in range(n + 1)]\r\ndeg = [0] * (n + 1)\r\ndeg[1] = 1\r\n\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n deg[u] += 1\r\n deg[v] += 1\r\n\r\nks = list(map(int, input().split()))\r\npriority = [10**9] * (n + 1)\r\nfor i, v in enumerate(ks):\r\n priority[v] = i\r\n\r\n\r\nstack = [v for v in range(1, n + 1) if deg[v] == 1]\r\n\r\nwhile stack:\r\n v = stack.pop()\r\n deg[v] = 0\r\n adj[v].sort(key=lambda i: priority[i])\r\n\r\n for dest in adj[v]:\r\n if deg[dest] == 0:\r\n continue\r\n priority[dest] = min(priority[dest], priority[v])\r\n deg[dest] -= 1\r\n if deg[dest] == 1:\r\n stack.append(dest)\r\n\r\n\r\nks = ks[::-1]\r\nstack = [(1, 0, -1)]\r\nans = []\r\n\r\nwhile stack:\r\n v, ei, par = stack.pop()\r\n ans.append(v)\r\n if ks and ks[-1] == v:\r\n ks.pop()\r\n\r\n if ei < len(adj[v]) and adj[v][ei] == par:\r\n ei += 1\r\n if len(adj[v]) == ei:\r\n continue\r\n\r\n stack.extend(((v, ei + 1, par), (adj[v][ei], 0, v)))\r\n\r\nif not ks:\r\n print(*ans)\r\nelse:\r\n print(-1)\r\n" ]

[ "import sys\nMOD = 10 ** 9 + 7\ndef is_lucky(n):\n n = str(n)\n return n.count('4') + n.count('7') == len(n)\ndef get_inv(n):\n return pow(n, MOD - 2, MOD)\ndef c(n, k):\n if n < k or k < 0:\n return 0\n global fact, rfact\n return (fact[n] * rfact[k] * rfact[n - k]) % MOD\n \nfact = [1]\nrfact = [1]\n \nfor i in range(1, 100500):\n fact.append((i * fact[-1]) % MOD)\n rfact.append((get_inv(i) * rfact[-1]) % MOD)\n \nn, k = map(int,sys.stdin.readline().split())\na = list(map(int,sys.stdin.readline().split()))\n \nd = dict()\nfor x in a:\n if is_lucky(x):\n d[x] = d.get(x, 0) + 1\ndp = [0]*(len(d)+2)\ndp[0] = 1\nfor x in d:\n for i in range(len(dp) - 1, 0, -1):\n dp[i] += dp[i - 1] * d[x]\n dp[i] %= MOD\n \nunlucky = n - sum(d.values())\nans = 0\nfor i in range(len(dp)):\n if k >= i:\n ans += dp[i] * c(unlucky, k - i)\nprint(ans % MOD)\n\n \t\t\t \t\t \t \t \t \t \t \t\t \t \t \t\t", "import sys\r\ninput = sys.stdin.readline\r\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\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nmod = 10**9+7\r\n\r\ndef j(n):\r\n flg = 1\r\n while n:\r\n flg &= (n % 10 == 4 or n % 10 == 7)\r\n n //= 10\r\n return flg\r\n\r\nln = defaultdict(int)\r\nno = 0\r\nfor i in a:\r\n if j(i):\r\n ln[i] += 1\r\n else:\r\n no += 1\r\n \r\nks = list(ln.keys())\r\nm = len(ks)\r\ndp = [[0]*(m+1) for i in range(m+1)]\r\ndp[0][0] = 1\r\nfor i in range(1,m+1):\r\n kk = ks[i-1]\r\n for j in range(m+1):\r\n dp[i][j] += dp[i-1][j]\r\n if j >= 1:\r\n dp[i][j] += dp[i-1][j-1] * ln[kk] % mod\r\n dp[i][j] %= mod\r\n\r\n\r\n#nCk\r\ndef com(n,mod):\r\n fact = [1,1]\r\n factinv = [1,1]\r\n inv = [0,1]\r\n for i in range(2,n+1):\r\n fact.append((fact[-1]*i)%mod)\r\n inv.append((-inv[mod%i]*(mod//i))%mod)\r\n factinv.append((factinv[-1]*inv[-1])%mod)\r\n return fact, factinv\r\n\r\nf,fi = com(2*10**5, mod)\r\n\r\ndef ncr(n,r):\r\n return f[n] * fi[r]%mod * fi[n-r]%mod\r\n\r\nans = 0\r\nfor i in range(m+1):\r\n if i > k: break\r\n num = dp[-1][i]\r\n left = k - i\r\n if no < left: continue\r\n ans += num * ncr(no, left) % mod\r\n ans %= mod\r\nprint(ans)\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef comb(n, r):\r\n return fact[n] * inv[r] % mod * inv[n - r] % mod if n >= r >= 0 else 0\r\n\r\nn, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nl = n + 5\r\nfact = [1] * (l + 1)\r\nfor i in range(1, l + 1):\r\n fact[i] = i * fact[i - 1] % mod\r\ninv = [1] * (l + 1)\r\ninv[l] = pow(fact[l], mod - 2, mod)\r\nfor i in range(l - 1, -1, -1):\r\n inv[i] = (i + 1) * inv[i + 1] % mod\r\na = list(input().rstrip().decode().split())\r\nd = dict()\r\nm = 0\r\npow2 = [1]\r\nfor _ in range(10):\r\n pow2.append(2 * pow2[-1])\r\nfor l in range(1, 10):\r\n for i in range(pow2[l]):\r\n u = \"\".join([\"4\" if i & pow2[j] else \"7\" for j in range(l)])\r\n d[u] = m\r\n m += 1\r\ncnt, c = [0] * m, 0\r\nfor i in a:\r\n if i in d:\r\n cnt[d[i]] += 1\r\n else:\r\n c += 1\r\nl = min(m, k)\r\ndp = [0] * (l + 1)\r\ndp[0] = 1\r\nfor i in cnt:\r\n if not i:\r\n continue\r\n for j in range(l - 1, -1, -1):\r\n dp[j + 1] = (dp[j] * i % mod + dp[j + 1]) % mod\r\nans = 0\r\nfor i in range(l + 1):\r\n ans += dp[i] * comb(c, k - i) % mod\r\nans %= mod\r\nprint(ans)" ]

[ "n = int(input())\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\nc = list(map(int, input().split(' ')))\nd = list(map(int, input().split(' ')))\ncost = []\ncost.append(min(a[0],a[1])+min(a[2],a[3]))\ncost.append(min(b[0],b[1])+min(b[2],b[3]))\ncost.append(min(c[0],c[1])+min(c[2],c[3]))\ncost.append(min(d[0],d[1])+min(d[2],d[3]))\ny = min(cost)\nif(y > n):\n print(\"-1\")\nelse:\n if(y==cost[0]):\n print(\"1 \"+str(min(a[0],a[1]))+\" \"+str(n-min(a[0],a[1])))\n elif(y==cost[1]):\n print(\"2 \"+str(min(b[0],b[1]))+\" \"+str(n-min(b[0],b[1])))\n elif(y==cost[2]):\n print(\"3 \"+str(min(c[0],c[1]))+\" \"+str(n-min(c[0],c[1])))\n else:\n print(\"4 \"+str(min(d[0],d[1]))+\" \"+str(n-min(d[0],d[1])))", "n=int(input())\r\nfor i in range(4):\r\n a,b,c,d=map(int,input().split())\r\n a=min(a,b)\r\n c=min(c,d)\r\n if a+c<=n:\r\n print(i+1,a,n-a)\r\n break\r\nelse: print(-1)\r\n", "def main():\n n = int(input())\n g = []\n for i in range(4):\n g.append(list(map(int, input().split(' '))))\n for i in range(4):\n a = min(g[i][0], g[i][1])\n b = min(g[i][2], g[i][3])\n if a + b <= n:\n return \"{} {} {}\".format(i + 1, a, b + (n - a - b))\n return -1\nprint(main())\n\n", "# LUOGU_RID: 101541280\n(n, ), *a = [[*(map(int, s.split()))] for s in open(0)]\r\nfor i, (a, b, c, d) in enumerate(a):\r\n if min(a, b) + min(c, d) <= n:\r\n exit(print(i + 1, min(a, b), n - min(a, b)))\r\nprint(-1)\r\n", "n = int(input())\n\nfor i in range(1, 5):\n\n a, b, c, d = map(int, input().split())\n\n p = min(a, b)\n\n if p + min(c, d) <= n:\n\n print(i, p, n - p)\n\n exit()\n\nprint(-1)\n\n# Made By Mostafa_Khaled", "n = int(input())\r\nw = False\r\narr = []\r\n\r\nfor i in range(4):\r\n arr.append([int(x) for x in input().split()])\r\n\r\nfor i in range(4):\r\n a,b,c,d = arr[i]\r\n m1 = min(a,b)\r\n m2 = min(c,d)\r\n\r\n if m1+m2<=n:\r\n print(str(i+1) + \" \" + str(m1) + \" \" + str(n-m1))\r\n w = True\r\n break\r\n\r\nif not w:\r\n print(-1)", "def solve():\n n = int(input())\n for i in range(1, 5):\n a, b, c, d = map(int, input().split())\n if min(a, b) + min(c, d) <= n:\n print(i, min(a, b), n - min(a, b))\n exit()\n print(-1)\n\nif __name__ == \"__main__\":\n solve()\n", "for _ in range(1):\r\n# for _ in range(int(input())):\r\n n = int(input())\r\n ans = 10**9\r\n v = -1\r\n for i in range(4):\r\n a, b, c, d = map(int, input().split())\r\n x = min(a, b)\r\n y = min(c, d)\r\n if x + y > n:\r\n continue\r\n y += n - x - y\r\n print(i + 1, x, y)\r\n break\r\n else:\r\n print(-1)\r\n ", "n = int(input())\r\nfor i in range(4):\r\n a = list(map(int, input().split()))\r\n if n >= min(a[0], a[1]) + min(a[2], a[3]):\r\n print(i + 1, min(a[0], a[1]), n - min(a[0], a[1]))\r\n exit()\r\nprint(-1)", "n = int(input())\r\n\r\nl= []\r\nfor i in range(4):\r\n\tl.append(list(map(int, input().split())))\r\n\r\nj = -1\r\nm = 0\r\nq = 0\r\nfor i in range(4):\r\n\ta = l[i][0]\r\n\tb = l[i][1]\r\n\tc = l[i][2]\r\n\td = l[i][3]\r\n\tif min(a, b) + min(c, d) <= n:\r\n\t\tj = i + 1\r\n\t\tm = min(a, b)\r\n\t\tq = n - min(a, b)\r\n\t\tbreak\r\n\r\nif j < 0:\r\n\tprint(j)\r\nelse:\r\n\tprint(j, m, q)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\nc=int(l[2])\r\nd=int(l[3])\r\nz=min(a,b)\r\ny=min(c,d)\r\nif(z+y<=n):\r\n print(1,z,n-z)\r\n quit()\r\nl=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\nc=int(l[2])\r\nd=int(l[3])\r\nz=min(a,b)\r\ny=min(c,d)\r\nif(z+y<=n):\r\n print(2,z,n-z)\r\n quit()\r\nl=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\nc=int(l[2])\r\nd=int(l[3])\r\nz=min(a,b)\r\ny=min(c,d)\r\nif(z+y<=n):\r\n print(3,z,n-z)\r\n quit()\r\nl=input().split()\r\na=int(l[0])\r\nb=int(l[1])\r\nc=int(l[2])\r\nd=int(l[3])\r\nz=min(a,b)\r\ny=min(c,d)\r\nif(z+y<=n):\r\n print(4,z,n-z)\r\n quit()\r\nprint(-1)\r\n", "n=int(input())\r\na=[]\r\nb=[]\r\nc=[]\r\nd=[]\r\nfor i in range(4):\r\n w,x,y,z=map(int,input().split())\r\n a.append(w)\r\n b.append(x)\r\n c.append(y)\r\n d.append(z)\r\nq=0\r\nfor j in range(4):\r\n if a[j]+c[j]<=n:\r\n print(j+1,end=\" \")\r\n print(a[j],end=\" \")\r\n print(n-a[j],end=\" \")\r\n break \r\n else:\r\n q+=1 \r\n if a[j]+d[j]<=n:\r\n print(j+1,end=\" \")\r\n print(a[j],end=\" \")\r\n print(n-a[j],end=\" \")\r\n break\r\n else:\r\n q+=1\r\n if b[j]+c[j]<=n:\r\n print(j+1,end=\" \")\r\n print(b[j],end=\" \")\r\n print(n-b[j],end=\" \")\r\n break \r\n else:\r\n q+=1 \r\n if b[j]+d[j]<=n:\r\n print(j+1,end=\" \")\r\n print(b[j],end=\" \")\r\n print(n-b[j],end=\" \")\r\n break \r\n else:\r\n q+=1 \r\nif q==16:\r\n print(\"-1\")", "n = int(input())\nfor _ in range(4):\n a,b,c,d = map(int,input().split())\n for i in [a,b]:\n for j in [c,d]:\n if i+j<=n:\n print(_+1,i,n-i)\n exit(0)\nprint(-1)", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\nn = INT()\r\nv = []\r\n\r\nfor i in range(4):\r\n m = n\r\n a , b , c , d = MAP()\r\n k1 = min(a , b)\r\n m-=k1\r\n f = 1\r\n if m <= 0 :\r\n f = 0\r\n if f != 0 :\r\n k2 = min(c , d)\r\n if m >= k2 :\r\n v.append([k1 , m , i+1])\r\n\r\n#print(v)\r\nif len(v) == 0 :\r\n print('-1')\r\n\r\nelse:\r\n print(v[0][2] , v[0][0] , v[0][1])\r\n\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\ninput=sys.stdin.readline\r\n\r\np = 10**9+7\r\n\r\nn = int(input())\r\na=[[int(i) for i in input().split()] for j in range(4)]\r\nvalid=False\r\nind=1\r\nfor i in a:\r\n x,y=min(i[0],i[1]),min(i[2],i[3])\r\n if x+y<=n:\r\n valid= True\r\n y+=n-x-y\r\n break\r\n ind+=1\r\nif valid:\r\n print(ind,x,y)\r\nelse:\r\n print(-1)", "n = int(input())\nguardposts = []\n\nfor i in range(4):\n guardposts.append([int(i) for i in input().split()])\n\nachou = False\nfor i in range(4):\n for j in range(2):\n for k in range(2,4):\n if (guardposts[i][j] + guardposts[i][k]) <= n:\n print(i + 1, guardposts[i][j], n - guardposts[i][j], sep=' ')\n achou = True\n break\n if achou:\n break\n if achou:\n break\n\nif not achou:\n print(-1)\n \t\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t \t \t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Apr 13 09:21:59 2021\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\n\r\nn = int(input())\r\ns = []\r\nfor _ in range(4):\r\n s.append(list(map(int, input().split())))\r\na = -1\r\nb = -1\r\nc = -1\r\nfor i in range(4):\r\n x1 = min(s[i][0], s[i][1])\r\n x2 = min(s[i][2], s[i][3])\r\n if x1 + x2 > n:\r\n continue\r\n else:\r\n a = i + 1\r\n b = x1\r\n c = n - x1\r\n break\r\nif a < 0:\r\n print(-1)\r\nelse:\r\n print(a, b, c)\r\n", "L = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nn, t = I(), [L() for i in range(4)]\r\np = [min(i[0], i[1]) + min(i[2], i[3]) for i in t]\r\nx = min(p)\r\nif x > n: print(-1)\r\nelse:\r\n k = p.index(x)\r\n p = min(t[k][0], t[k][1])\r\n print(k + 1, p, n - p)", "n=int(input())\r\nfor i in range(4):\r\n u=0\r\n a,b,c,d=map(int,input().split())\r\n e=min(a,b)\r\n f=min(c,d)\r\n if e+f<=n:\r\n print(i+1,e,n-e)\r\n u=1\r\n break\r\nif u==0:\r\n print(\"-1\")", "import sys\r\n\r\nn = int(input())\r\n\r\nfor i in range(4):\r\n a, b, c, d = map(int, input().split())\r\n if min(a, b) + min(c, d) <= n:\r\n print(\"{} {} {}\".format(i + 1, min(a, b), n - min(a, b)))\r\n sys.exit(0)\r\n\r\nprint(-1)", "n = int(input())\r\narr = [list(map(int, input().split())) for _ in range(4)]\r\n\r\nans = -1\r\n\r\nfor i in range(4):\r\n for j in [0,1]:\r\n for k in [2,3]:\r\n val = arr[i][j] + arr[i][k]\r\n if val <= n:\r\n ans = i\r\n a = arr[i][j]\r\n b = n - arr[i][j]\r\nif ans == -1:\r\n print(-1)\r\nelse:\r\n print(ans+1, a, b)", "n = int(input())\narr = []\nfor i in range(0,4):\n a = [int(x) for x in input().split()]\n arr.append(a)\n\nfound = False\n\nfor a in arr:\n m1 = min(a[0],a[1])\n m2 = min(a[2],a[3])\n \n if m1+m2 <= n:\n found = True\n print(str(arr.index(a)+1)+' '+str(m1)+' '+str(n-m1))\n break\n\nif found == False:\n print('-1')", "def solve(arr, n):\n for i,v in enumerate(arr):\n c1 = min(v[0], v[1])\n c2 = min(v[2], v[3])\n if c1+c2 <= n:\n return [i+1, c1,n-c1]\n return [-1]\n \n\n \n\n \ndef main() :\n n = int(input())\n arr = []\n for _ in range(4):\n i = list(map(int, input().split(' ')))\n arr.append(i)\n print(*solve(arr, n))\nmain()\n", "n = int(input())\nflag = False\nfor i in range(4):\n l = [int(i) for i in input().split()]\n if not flag and n >= min(l[0],l[1]) + min(l[2],l[3]):\n print(i+1, min(l[0],l[1]), n-min(l[0],l[1]))\n flag = True\nif not flag:\n print(-1)\n\n\n \t\t \t\t\t\t\t\t\t \t \t \t \t \t\t \t", "__author__ = 'Lipen'\r\n\r\ndef actions(n, data):\r\n\tfor i in range(4):\r\n\t\tv = data[i]\r\n\t\tx = min(v[0],v[1])\r\n\t\ty = min(v[2],v[3])\r\n\t\tif x+y<=n:\r\n\t\t\treturn '{} {} {}'.format(i+1, x, n-x)\r\n\r\n\treturn -1\r\n\r\ndef main():\r\n\tn = int(input())\r\n\ta1 = list(map(int, input().split()))\r\n\ta2 = list(map(int, input().split()))\r\n\ta3 = list(map(int, input().split()))\r\n\ta4 = list(map(int, input().split()))\r\n\r\n\tprint(actions(n, [a1,a2,a3,a4]))\r\n\r\nif __name__=='__main__': main()", "n = int(input())\nfor i in range(4):\n\ta, b, *l = [int(x) for x in input().split()]\n\tfor c in [a, b]:\n\t\tfor d in l:\n\t\t\tif c + d <= n:\n\t\t\t\tprint(i + 1, c, n - c)\n\t\t\t\texit()\nprint(-1)\n", "n=int(input())\r\ng1=list(map(int,input().split()))\r\ng2=list(map(int,input().split()))\r\ng3=list(map(int,input().split()))\r\ng4=list(map(int,input().split()))\r\na1=g1[:2]\r\na2=g1[2:]\r\nb1=g2[:2]\r\nb2=g2[2:]\r\nc1=g3[:2]\r\nc2=g3[2:]\r\nd1=g4[:2]\r\nd2=g4[2:]\r\nsg1=min(a1)+min(a2)\r\nsg2=min(b1)+min(b2)\r\nsg3=min(c1)+min(c2)\r\nsg4=min(d1)+min(d2)\r\nif sg1<=n:\r\n print(\"1\",min(a1),min(a2)+(n-sg1))\r\nelif sg2<=n:\r\n print(\"2\",min(b1),min(b2)+(n-sg2))\r\nelif sg3<=n:\r\n print(\"3\",min(c1),min(c2)+(n-sg3))\r\nelif sg4<=n:\r\n print(\"4\",min(d1),min(d2)+(n-sg4))\r\nelse:\r\n print(\"-1\")\r\n", "n=int(input())\r\nM=[list(map(int,input().split())) for i in range(4)]\r\nt=0\r\nfor x in M :\r\n t+=1\r\n if min(x[0],x[1])+min(x[2],x[3])>n :\r\n continue\r\n else :\r\n print(t,min(x[0],x[1]),n-min(x[0],x[1]))\r\n exit()\r\nprint(-1)\r\n \r\n", "n = int(input())\r\nres = [-1]\r\nfor i in range(4):\r\n a, b, c, d = map(int, input().split())\r\n if min(a, b) + min(c, d) <= n:\r\n res = [i + 1, min(a, b), n - min(a, b)]\r\n break\r\nprint(*res)", "n = int(input())\nw = 0\n\nfor i in range(4):\n l = list(map(int,input().split()))\n k = i+1\n if l[0]+l[2] <= n:\n w = 1\n print(k,l[0],n-l[0])\n break\n elif l[0]+l[3] <= n:\n w = 1\n print(k,l[0],n-l[0])\n break\n elif l[1]+l[2] <= n:\n w = 1\n print(k,l[1],n-l[1])\n break\n elif l[1]+l[3] <= n:\n w = 1\n print(k,l[1],n-l[1])\n break\n\nfor j in range(k,4):\n list(map(int,input().split()))\n\nif not w:\n print(-1)", "def vahta(x, lst):\r\n for elem in lst:\r\n ra, rb = min(elem[0], elem[1]), min(elem[2], elem[3])\r\n if ra + rb <= x:\r\n return lst.index(elem) + 1, ra, x - ra\r\n return [-1]\r\n\r\n\r\nn = int(input())\r\na = list()\r\nfor i in range(4):\r\n t = [int(j) for j in input().split()]\r\n a.append(t)\r\nprint(*vahta(n, a))\r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n arr, flag = [], True\r\n for i in range(4):\r\n arr.append([int(k) for k in input().split()])\r\n\r\n for i in range(4):\r\n x, y = min(arr[i][0], arr[i][1]), min(arr[i][2], arr[i][3])\r\n if x + y <= n:\r\n print(i+1, x, n - x)\r\n flag = False\r\n break\r\n if flag:\r\n print(-1)\r\n", "n = int(input())\nmi = 1e6, 1e6\nimi = -1\nfor i in range(4):\n m = tuple(map(int,input().split()))\n if min(m[0],m[1]) + min(m[2],m[3]) <= n:\n if min(m[0],m[1]) + min(m[2],m[3]) < mi[0] + mi[1]:\n if n-min(m[0],m[1]) >= min(m[2],m[3]):\n mi = min(m[0],m[1]), n-min(m[0],m[1])\n else:\n mi = n-min(m[2],m[3]), min(m[2],m[3])\n imi = i+1\nif imi==-1:\n print(imi)\nelse:\n print(imi, mi[0], mi[1])\n", "#como temos uma entrada constante, vamos realizar com força bruta\n\ndef return_solution(posto, dinheiro):\n presentes = []\n for presente_a in posto[:2]:\n for presente_b in posto[2:]:\n if presente_a + presente_b <= dinheiro:\n presentes.append(presente_a)\n presentes.append(presente_b)\n break\n \n if not presentes:\n return (False, None)\n else:\n return(True, [presentes[0], dinheiro - presentes[0]])\n\n\n#inicializando variaveis\ndinheiro = int(input())\npostos = []\nfor p in range(4):\n postos.append([int(i) for i in input().split()])\n\nsolution_found = False\nfor posto in range(len(postos)):\n ans = return_solution(postos[posto], dinheiro)\n if ans[0]:\n print(posto + 1, ans[1][0], ans[1][1])\n solution_found = True\n break\n\nif not solution_found:\n print(-1)\n\n \t\t\t\t \t \t\t\t \t \t\t\t\t\t", "n = int(input())\r\nl = []\r\n\r\nfor i in range(4):\r\n l.append(list(map(int, input().split())))\r\n\r\nfor i in range(4):\r\n x, y = min(l[i][:2]), min(l[i][2:4])\r\n\r\n if x + y <= n:\r\n print(i + 1, x, n - x)\r\n break\r\n\r\n if i == 3:\r\n print(-1)", "def guardpost(m, cash):\n for v in range(4):\n a = m[v][0]\n b = m[v][1]\n c = m[v][2]\n d = m[v][3]\n\n minimo = min(a, b) + min(c, d)\n if minimo <= cash:\n print(str(v + 1) + \" \" + str(min(a, b)) + \" \" + str(cash - min(a, b)))\n return None\n\n print(\"-1\")\n return None\n\n\ncash = int(input())\nmatriz = []\n\nfor i in range(4):\n matriz.append([int(item) for item in input().split()])\n\nguardpost(matriz, cash)\n \t\t\t \t\t \t\t \t \t \t\t \t\t", "r = int(input())\r\np = 0\r\nfor i in range(4):\r\n g1c,g1j,g2c,g2j = map(int,input().split())\r\n if min(g1c,g1j)+min(g2c,g2j) <= r:\r\n p,g1,g2 = i+1, min(g1c,g1j), min(g2c,g2j)\r\nif p == 0:\r\n print(-1)\r\nelse: print(p,g1,r-g1)", "Money = int(input())\r\nfor i in range(4):\r\n X = list(map(int, input().split()))\r\n if min(X[0], X[1]) + min(X[2], X[3]) <= Money:\r\n print(i+1, min(X[0], X[1]), Money - min(X[0], X[1]))\r\n exit()\r\nprint(-1)\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: 654\r\n", "n = int(input())\nl = []\nfor x in range(4):\n\ta = [int(x) for x in input().split()]\n\tl.append(a)\n\nfound = False\nfor a in l:\n\tm1 = min(a[0], a[1])\n\tm2 = min(a[2], a[3])\n\tif m1+m2 <= n:\n\t\tfound = True\n\t\tprint( str(l.index(a)+1)+' '+str(m1)+' '+str(n-m1) )\n\t\tbreak\n\nif not found:\n\tprint('-1')\n", "def min(a,b):\n if(a>b):\n return b\n else:\n return a\n\nmatriz = [0]*4\nqtd = int(input())\ntotal = [0]*4\nfor i in range(4):\n matriz[i] = input().split()\n qtd1 = min(int(matriz[i][0]),int(matriz[i][1]))\n qtd2 =min(int(matriz[i][2]),int(matriz[i][3]))\n total[i] = qtd1+qtd2\nflag = 0\nfor i in range(4):\n if(total[i]<=qtd):\n print(f\"{i+1} {min(int(matriz[i][0]), int(matriz[i][1]))} {qtd - min(int(matriz[i][0]), int(matriz[i][1]))}\")\n flag = 1\n break\nif(flag == 0):\n print(\"-1\")\n\t \t \t \t \t \t \t\t \t \t \t\t\t", "def main():\n amount = int(input())\n prices = []\n\n for i in range(4):\n prices.append(input().split(' '))\n for j in range(4):\n prices[-1][j] = int(prices[-1][j])\n\n for i in range(4):\n\n guard_1 = min(prices[i][0], prices[i][1])\n guard_2 = min(prices[i][2], prices[i][3])\n\n if guard_1 + guard_2 == amount:\n print(f'{i + 1} {guard_1} {guard_2}')\n return\n \n elif guard_1 + guard_2 < amount:\n print(f'{i + 1} {guard_1} {guard_2 + (amount - guard_2 - guard_1)}')\n return\n\n print(-1)\n return\n \n\n\n\n\n\n\n\nmain()\n \t\t\t \t \t \t \t \t \t\t \t\t \t \t\t", "n = int(input())\n\n\np,q= 1000000,1000000\nline= 0\nabc = False\nfor i in range(4):\n a,b,c,d = map(int,input().split())\n r = min(a,b)\n s = min(c,d)\n if r < p and s<q and r+s <= n :\n p=r\n q=s\n line = i+1\n abc =True\nif abc:\n print(line , p ,n-p)\nelse:\n print(-1)", "\r\nN = int(input())\r\n\r\nans = -1\r\n\r\nfor i in range(4):\r\n a,b,c,d = map(int, input().split())\r\n if min(a, b) + min(c, d) <= N:\r\n ans = 1\r\n print(i + 1, end=' ')\r\n print(min(a, b), end=' ')\r\n print(N - min(a, b))\r\n break\r\nif ans == -1:\r\n print(ans)\r\n ", "n=int(input())\r\na=[]\r\na.append(list(map(int,input().split())))\r\na.append(list(map(int,input().split())))\r\na.append(list(map(int,input().split())))\r\na.append(list(map(int,input().split())))\r\nfor i in range(4):\r\n a[i][0]=min(a[i][0],a[i][1])\r\n a[i][1]=min(a[i][2],a[i][3])\r\n if a[i][0]+a[i][1]<=n:\r\n print(i+1,a[i][0],n-a[i][0])\r\n exit(0)\r\nprint(-1)\r\n", "n = int(input())\r\njijuur = -1\r\nminab = 10**9\r\nmincd = 10**9\r\nfor i in range(1,5):\r\n a,b,c,d = map(int, input().split())\r\n \r\n if min(a,b) + min(c,d) <= n:\r\n ab = min(a, b)\r\n cd = n - ab\r\n \r\n if minab > ab:\r\n minab = ab\r\n mincd = n - minab\r\n jijuur = i\r\nif jijuur == -1:\r\n print(jijuur)\r\nelse:\r\n print(jijuur, minab, mincd)", "n=int(input())\r\nflag=0\r\nfor i in range(4):\r\n a,b,c,d=map(int,input().split())\r\n f=n-min(a,b)-min(c,d)\r\n if f>=0 and flag==0:\r\n print(i+1,min(a,b),n-min(a,b))\r\n flag=1\r\nif flag==0:\r\n print(-1)\r\n\r\n\r\n", "def read_args():\r\n n = int(input())\r\n guards = []\r\n for i in range(4):\r\n a = list(map(int, input().split()))\r\n guards.append(get_couples(a))\r\n return n, guards\r\n\r\n\r\ndef get_couples(a):\r\n return [\r\n (a[0], a[2]),\r\n (a[0], a[3]),\r\n (a[1], a[2]),\r\n (a[1], a[3])\r\n ]\r\n\r\n\r\ndef get_guards(n, guards):\r\n index = 1\r\n for guard in guards:\r\n for couple in guard:\r\n if couple[0] + couple[1] <= n:\r\n return str(index) + \" \" + str(couple[0]) + \" \" + str(n - couple[0])\r\n index += 1\r\n return -1\r\n\r\n\r\ndef main():\r\n n, guards = read_args()\r\n print(get_guards(n, guards))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "'''input\n1000\n500 500 550 550\n450 450 500 500\n999 1 1 999\n1 999 1 999\n'''\nn = int(input())\nfor g in range(4):\n\ti = list(map(int, input().split()))\n\ta, b = min(i[:2]), min(i[2:])\n\tif a + b <= n:\n\t\tprint(g + 1, a, n - a)\n\t\tbreak\nelse:\n\tprint(-1)", "n=int(input())\n\nL1=list(map(int,input().split()))\nL2=list(map(int,input().split()))\nL3=list(map(int,input().split()))\nL4=list(map(int,input().split()))\n\n#Post 1\n\nif(min(L1[0],L1[1])+min(L1[2],L1[3])<=n):\n print(1,min(L1[0],L1[1]),n-min(L1[0],L1[1]))\n\nelif(min(L2[0],L2[1])+min(L2[2],L2[3])<=n):\n print(2,min(L2[0],L2[1]),n-min(L2[0],L2[1]))\n\nelif(min(L3[0],L3[1])+min(L3[2],L3[3])<=n):\n print(3,min(L3[0],L3[1]),n-min(L3[0],L3[1]))\n\nelif(min(L4[0],L4[1])+min(L4[2],L4[3])<=n):\n print(4,min(L4[0],L4[1]),n-min(L4[0],L4[1]))\n\nelse:\n print(-1)\n", "n=int(input())\nm_min=n+1\ntmp_min=n+1\nm_i=0\nj=0\nb=0\nc=0\nfor i in range(4):\n\tj+=1\n\ta = list(map(int, input().split()))\n\ttemp_min = min(a[0], a[1])+min(a[2], a[3])\n\tm_min=min(m_min, temp_min)\n\tif m_min==temp_min:\n\t\tm_i=j\n\t\tb = min(a[0], a[1])\n\t\tc = min(a[2], a[3])\nif m_min>n:\n\tprint(\"-1\")\nelse:\n\tprint(m_i, b, n-b) \n\n# Sun Sep 29 2019 20:33:34 GMT+0300 (MSK)\n", "n = int(input())\nl = []\n\nfor _ in range(4):\n l.append(list(map(int, input().split())))\n\nx=min(l, key=lambda x: (min(x[0], x[1]) + min(x[2], x[3])))\ni = l.index(x)\nif min(l[i][0], l[i][1]) + min(l[i][2], l[i][3]) <= n:\n print(i+1, min(l[i][0], l[i][1]), n - min(l[i][0], l[i][1]))\nelse: \n print(-1)", "n = int(input())\r\nfor i in range(1, 5):\r\n a,b,c,d = list(map(int, input().split()))\r\n m1, m2 = min(a,b), min(c,d)\r\n if m1 + m2 > n:\r\n continue\r\n if m2 <= n - m1:\r\n print(i, m1, n - m1)\r\n exit()\r\n if m1 <= n - m2:\r\n print(i, n - m2, m2)\r\nprint(-1)\n# Mon Oct 14 2019 17:37:00 GMT+0300 (MSK)\n", "if __name__ == \"__main__\":\n n = int(input())\n\n l1 = [int(v) for v in input().split()]\n l2 = [int(v) for v in input().split()]\n l3 = [int(v) for v in input().split()]\n l4 = [int(v) for v in input().split()]\n\n if min(l1[0],l1[1]) + min(l1[2],l1[3]) <= n:\n print(\"1 %d %d\" % (min(l1[0],l1[1]), n-min(l1[0],l1[1])))\n elif min(l2[0],l2[1]) + min(l2[2],l2[3]) <= n:\n print(\"2 %d %d\" % (min(l2[0],l2[1]), n-min(l2[0],l2[1])))\n elif min(l3[0],l3[1]) + min(l3[2],l3[3]) <= n:\n print(\"3 %d %d\" % (min(l3[0],l3[1]), n-min(l3[0],l3[1])))\n elif min(l4[0],l4[1]) + min(l4[2],l4[3]) <= n:\n print(\"4 %d %d\" % (min(l4[0],l4[1]), n-min(l4[0],l4[1])))\n else:\n print(\"-1\")", "I = lambda: map(int, input().split())\r\n\r\nn = int(input())\r\n\r\nfor i in range(4):\r\n a, b, c, d = I()\r\n x = min(a,b)\r\n if x+min(c,d) <= n:\r\n print(i+1, x, n-x)\r\n break\r\nelse:\r\n print(-1)", "n = int(input())\n\nlista = []\nfor i in range(4):\n lista.append(input().split())\n aux = [int(i) for i in lista[-1]]\n lista[-1] = aux\nflag = 0\nfor i in range(4):\n m1 = min(lista[i][0], lista[i][1])\n m2 = min(lista[i][2], lista[i][3])\n\n if m1+m2 <= n:\n print(i+1, end=' ')\n print(m1, end=' ')\n print(n-m1)\n flag = 1\n break\nif flag ==0:\n print(-1)\n\t\t \t\t \t \t \t \t\t\t\t \t\t \t", "n=int(input())\r\na=[]\r\nfor _ in range(4):\r\n l=list(map(int,input().strip().split()))\r\n a.append(l)\r\nf=ans=x=y=0\r\nfor i in range(4):\r\n g=n-min(a[i][0],a[i][1])\r\n if g>=min(a[i][2],a[i][3]):\r\n f=1\r\n ans=i+1\r\n break\r\nif f==0:print(-1)\r\nelse:\r\n print(ans,n-g,g)", "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]\nind=0\nans1,ans2=10**6, 10**6\nfor i in range(4):\n a,b,c,d=RI()\n a=min(a,b)\n c=min(c,d)\n if a+c < ans1+ans2:\n ind=i+1\n ans1=a\n ans2=c\nif n-ans1<ans2:\n print(-1)\nelse:\n print(ind, ans1,n-ans1)\n\n\n\n\n\n" ]

[ "n,x1,y1,x2,y2 =map(int, input().split())\r\ndef f(x,y,n):\r\n if y==0 or x==n:\r\n return x+y\r\n else:\r\n return 4*n - x - y\r\na = abs(f(x1,y1,n) - f(x2,y2,n))\r\nprint(min(a, 4*n-a))\r\n", "def dis(x,y,d):\r\n if y==0 or x==d:\r\n return x+y\r\n else:\r\n return 4*d - x - y\r\nd,x1,y1,x2,y2 = map(int, input().split())\r\na = abs(dis(x1,y1,d) - dis(x2,y2,d))\r\nprint(min(a, 4*d-a))", "I = input().split()\r\nn = int(I[0])\r\nP1 = (int(I[1]), int(I[2]))\r\nP2 = (int(I[3]), int(I[4]))\r\nl = [0, n]\r\nadjacent = False\r\nopposite = False\r\nfor i in range(2):\r\n if P1[i] in l:\r\n if P2[int(not i)] in l:\r\n adjacent = True\r\n if P2[i] in l:\r\n if P1[i] == P2[i]:\r\n adjacent = True\r\n else:\r\n opposite = True\r\n\r\nif adjacent:\r\n shortest_distance = abs(P1[0] - P2[0]) + abs(P1[1] - P2[1])\r\n print(shortest_distance)\r\n\r\nif opposite and not adjacent:\r\n distance = []\r\n if P1[0] in l and P2[0] in l:\r\n distance.append(abs(P1[0] - P2[0]) + abs(P1[1] - P2[1]) + 2*(min(P1[1], P2[1])))\r\n distance.append(abs(P1[0] - P2[0]) + abs(P1[1] - P2[1]) + 2*(n - max(P1[1], P2[1])))\r\n\r\n else:\r\n distance.append(abs(P1[0] - P2[0]) + abs(P1[1] - P2[1]) + 2 * (min(P1[0], P2[0])))\r\n distance.append(abs(P1[0] - P2[0]) + abs(P1[1] - P2[1]) + 2 * (n - max(P1[0], P2[0])))\r\n\r\n shortest_distance = min(distance)\r\n print(shortest_distance)", "def next_clockwise(x, y):\r\n if x == 0:\r\n return (1, n) if y == n else (0, y + 1)\r\n if x == n:\r\n return (n - 1, 0) if y == 0 else (n, y - 1)\r\n if y == 0:\r\n return (0, 1) if x == 0 else (x - 1, 0)\r\n if y == n:\r\n return (n, n-1) if x == n else (x + 1, n)\r\n \r\n \r\nn, x1, y1, x2, y2 = map(int, input().split())\r\nc = 0\r\np = (x1, y1)\r\nwhile p != (x2, y2):\r\n p = next_clockwise(*p)\r\n c += 1\r\nprint(min(c, 4 * n - c))", "n, x, y, x_target, y_target = map(int, input().split())\n\ndist = 0\n\nwhile True:\n if (x == 0 and x == x_target):\n break\n if (x == n and x == x_target):\n break\n if (y == 0 and y == y_target):\n break\n if (y == n and y == y_target):\n break\n if x == 0 and y != n:\n dist += n - y\n x, y = 0, n\n elif y == n and x != n:\n dist += n - x\n x, y = n, n\n elif x == n and y != 0:\n dist += y\n x, y = n, 0\n else:\n dist += x\n x, y = 0, 0\n\ndist += abs(x_target - x + y_target - y)\nresult = min(dist, 4 * n - dist)\nprint(result)\n\n", "import math\r\nn, x1, y1, x2, y2 = [int(i) for i in input().split()]\r\nobw = 4*n\r\ndist_from_zero1 = 0\r\ndist_from_zero2 = 0\r\n\r\n# trzeba to rozbic na 4 cwiartki\r\n\r\nif x1 == 0 and y1 >= 0:\r\n dist_from_zero1 = x1 + y1\r\nelif y1 == n and x1 != 0:\r\n dist_from_zero1 = n + x1\r\nelif x1 >= 0 and y1 == 0:\r\n dist_from_zero1 = obw - x1\r\nelif y1 != 0 and x1 == n:\r\n dist_from_zero1 = 3*n - y1\r\n\r\n\r\nif x2 == 0 and y2 >= 0:\r\n dist_from_zero2 = x2 + y2\r\nelif y2 == n and x2 != 0:\r\n dist_from_zero2 = n + x2\r\nelif x2 >= 0 and y2 == 0:\r\n dist_from_zero2 = obw - x2\r\nelif y2 != 0 and x2 == n:\r\n dist_from_zero2 = 3*n - y2\r\n\r\n\r\nprint(min(int(math.fabs(dist_from_zero2 - dist_from_zero1)), int(obw - dist_from_zero1 + dist_from_zero2), int(obw - dist_from_zero2 + dist_from_zero1)))", "n,a,b,c,d=map(int,input().split())\r\nr=abs(a-c)\r\ns=abs(b-d)\r\nans=0\r\nif r==n or s==n:\r\n ans=a+b+c+d\r\nelse:\r\n ans=r+s\r\nprint(min(ans,4*n-ans))", "# https://codeforces.com/problemset/problem/57/A\n# input\nside, x1, y1, x2, y2 = [int(i) for i in input().split()]\n\n# the distance between points 1 & 2 and the origin\ndistance1 = x1 + y1\ndistance2 = x2 + y2\n\n# if the two points are at two opposite directions, the output should be the minimum sum of the two distances\noutput = min(distance1 + distance2, side * 4 - distance1 - distance2)\n\n# Case 1: two points are at the edge of y-axis\nif x1 == x2 and x1 == 0:\n output = distance2 - distance1\n# Case 2: two points are at the other vertical edge\nelif x1 == x2 and x1 == side:\n output = distance2 - distance1\n# Case 3: two points are at the edge of x-axis\nelif y1 == y2 and y1 == 0:\n output = distance2 - distance1\n# Case 4: two points are at the other horizontal edge\nelif y1 == y2 and y1 == side:\n output = distance2 - distance1\nelse:\n # Case 5: two points are at sides located in the upper part of the square divided by y=x\n if x1 == 0 and y2 == side:\n output = distance2 - distance1\n # switch the two points (Case 5)\n elif x2 == 0 and y1 == side:\n output = distance2 - distance1\n # Case 6: two points are at sides located in the lower part of the square divided by y=x\n elif x1 == side and y2 == 0:\n output = distance2 - distance1\n # switch the two points (Case 6)\n elif x2 == side and y1 == 0:\n output = distance2 - distance1\n\n# get the absolute value of the distance\nif output < 0:\n output = -output\nprint(output)", "\nn,x,y,p,q=map(int,input().split())\nd=abs(x-p)+abs(y-q)\n\nif(abs(x-p)==n):\n d=min(n+y+q,3*n-(y+q))\nif(abs(y-q)==n):\n d=min(n+x+p,3*n-(x+p))\nprint(d)\n\n\t\t\t\t\t \t\t \t \t\t \t \t \t \t\t", "n,x1,y1,x2,y2=map(int,input().split())\r\nif((y1>=x1 and y2>=x2) or (y1<x1 and y2<x2)):\r\n ans=abs(x1+y1-x2-y2)\r\nelse:\r\n dis=x1+x2+y1+y2\r\n if(dis<2*n):\r\n ans=dis\r\n else:\r\n ans=4*n-dis\r\nprint(ans)\r\n", "def f(x, y, n): return x + y if y == 0 or x == n else 4 * n - x - y\nn, x1, y1, x2, y2 = map(int, input().split())\nd = abs(f(x1, y1, n) - f(x2, y2, n))\nprint(min(d, 4 * n - d))", "n, x1, y1, x2, y2 = map(int, input().split(' '))\r\nd = abs(x1 - x2) + abs(y1 - y2)\r\nif abs(y1 - y2) != n and abs(x1 - x2) != n: \r\n print(min(d, n*4-d))\r\nelse:\r\n d = x1 + y1 + x2 + y2\r\n print(min(d, n*4-d))", "n, x1, y1, x2, y2 = map(int, input().split())\r\n\r\nr = abs(x1 - x2)\r\nd = abs(y1 - y2)\r\n\r\nans = 0\r\n\r\nif r == n or d == n:\r\n ans = x1 + x2 + y1 + y2\r\nelse:\r\n ans = r + d\r\nprint(min(ans, 4 * n - ans))\r\n", "n,x1,y1,x2,y2=map(int,input().split())\r\nif (x1==0 and x2==n) or (x1==n and x2==0):\r\n ans=min(y1+n+y2 , (n-y1+n-y2+n))\r\nelif (y1==0 and y2==n) or (y1==n and y2==0):\r\n ans=min(x1+n+x2 , (n-x1+n-x2+n))\r\n\r\n \r\n \r\nelse:\r\n ans = abs(x1-x2) + abs(y1-y2)\r\nprint(ans)\r\n \r\n\r\n", "n,a,b,c,d=map(int,input().split())\nr=abs(a-c)\ns=abs(b-d)\nans=0\nif r==n or s==n:\n ans=a+b+c+d\nelse:\n ans=r+s\nprint(min(ans,4*n-ans))", "from sys import stdin,stdout\r\nfrom collections import defaultdict\r\ninput=stdin.readline\r\n#print=stdout.write\r\nfrom random import randint\r\nimport math\r\nimport sys \r\n\r\n###-----------Code Begins----------##\r\nn,x1,y1,x2,y2 = map(int,input().split())\r\nV=[]\r\nV.append((0,0))\r\nV.append((0,n))\r\nV.append((n,0))\r\nV.append((n,n))\r\nfor i in range(1,n):\r\n V.append((0,i))\r\n V.append((i,0))\r\n V.append((n,i))\r\n V.append((i,n))\r\n\r\nE = defaultdict(list)\r\nE[(0,0)]= [(1,0),(0,1)]\r\nE[(n,0)]= [(n-1,0),(n,1)]\r\nE[(0,n)]= [(0,n-1),(1,n)]\r\nE[(n,n)]= [ (n-1,n),(n,n-1) ]\r\n\r\nfor i in range(1,n):\r\n E[(i,0)]= [(i-1,0),(i+1,0)]\r\n E[(0,i)]= [(0,i+1),(0,i-1)]\r\n E[(n,i)]= [(n,i+1),(n,i-1)]\r\n E[(i,n)]= [(i-1,n),(i+1,n)]\r\n\r\nd=defaultdict(int)\r\nfor v in V:\r\n d[v]= 3*n\r\nd[(x1,y1)]=0\r\nstart=[ (x1,y1)]\r\nVisited=defaultdict(bool)\r\nVisited[start[0]]=True\r\nwhile(len(start)>0):\r\n next= []\r\n for item in start:\r\n for i1 in E[item]:\r\n if(Visited[i1]==False):\r\n next.append(i1)\r\n for item in next:\r\n pp= E[item]\r\n d[item]= min(d[pp[0]],d[pp[1]])+1\r\n Visited[item]=True\r\n start=next\r\n \r\nprint(d[(x2,y2)])\r\n", "n,x,y,a,b=map(int,input().split())\r\n#points on adjacent sides\r\nu=abs(x-a)+abs(y-b)\r\n#points on opposite sides\r\nif abs(x-a)==n:\r\n u=min(n+y+b,3*n-(y+b))\r\nif abs(y-b)==n:\r\n u=min(n+a+x,3*n-(a+x))\r\nprint(u)", "n,x1,y1,x2,y2=map(int,input().split())\r\nd=abs(x1-x2)+abs(y1-y2)\r\nif abs(x1-x2)==n:\r\n d=min(n+y1+y2,3*n-y1-y2)\r\nif abs(y1-y2)==n:\r\n d=min(n+x1+x2,3*n-x1-x2)\r\nprint(d)", "'''\n handle - pruvi007\n questionName - SquareEarth\n Contest - NA\n Topic - DFS/BFS\n Platform - CF\n'''\nfrom sys import stdin, stdout\nfrom collections import defaultdict\n\ndef main():\n dx,dy = [1,-1,0,0], [0,0,-1,1]\n n,x1,y1,x2,y2 = map(int,input().split())\n path = set()\n # 00-n0\n for i in range(n+1):\n path.add((i,0))\n # n0-nn\n for i in range(n+1):\n path.add((n,i))\n # nn-0n\n for i in range(n,-1,-1):\n path.add((i,n))\n #0n-00\n for i in range(n,-1,-1):\n path.add((0,i))\n \n q = [[x1,y1,0]]\n vis = set()\n ans = 10**10\n while len(q):\n f = q.pop(0)\n x,y = f[0], f[1]\n if x==x2 and y==y2:\n ans = min(ans,f[2])\n vis.add((x,y))\n for i in range(4):\n nx, ny = x+dx[i], y+dy[i]\n if (nx,ny) in path and (nx,ny) not in vis:\n q.append([nx,ny,f[2]+1])\n print(ans)\n\nmain()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b, c, d = map(int, input().split())\r\n\r\nif a == 0:\r\n if c == 0:\r\n print(abs(b-d))\r\n elif c == n:\r\n print(min(b + n + d, n-b + n + n-d))\r\n elif d == 0:\r\n print(b + c)\r\n else:\r\n print(n-b+c)\r\nelif a == n:\r\n if c == n:\r\n print(abs(b-d))\r\n elif c == 0:\r\n print(min(b + n + d, n - b + n + n - d))\r\n elif d == 0:\r\n print(n-c + b)\r\n else:\r\n print(n-c + n-b)\r\nelif b == 0:\r\n if d == 0:\r\n print(abs(a-c))\r\n elif d == n:\r\n print(min(a+n+c, n-a+n+n-c))\r\n elif c == 0:\r\n print(a + d)\r\n else:\r\n print(n-a+ d)\r\nelif b == n:\r\n if d == n:\r\n print(abs(a-c))\r\n elif d == 0:\r\n print(min(a + n + c, n - a + n + n - c))\r\n elif c == 0:\r\n print(a+n-d)\r\n else:\r\n print(n-a+n-d)\r\n", "n, x1, y1, x2, y2 = map(int, input().split())\r\nind1 = 0\r\nind2 = 0\r\nfor i in range(n):\r\n if 0 == x1 and y1 == i:\r\n ind1 = i\r\n if 0 == x2 and y2 == i:\r\n ind2 = i\r\nfor i in range(n):\r\n if i == x1 and y1 == n:\r\n ind1 = i + n\r\n if i == x2 and y2 == n:\r\n ind2 = i + n\r\nfor i in range(n):\r\n if n == x1 and y1 == n - i:\r\n ind1 = i + n * 2\r\n if n == x2 and y2 == n - i:\r\n ind2 = i + n * 2\r\nfor i in range(n):\r\n if n - i == x1 and y1 == 0:\r\n ind1 = i + n * 3\r\n if n - i == x2 and y2 == 0:\r\n ind2 = i + n * 3\r\nprint(min((ind1 - ind2 + (4 * n)) % (4 * n), (ind2 - ind1 + (4 * n)) % (4 * n)))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-28 16:02:40\nLastEditTime: 2021-11-28 16:12:06\nDescription: Square Earth?\nFilePath: CF57A.py\n'''\n\n\ndef func():\n n, x1, y1, x2, y2 = map(int, input().strip().split())\n if abs(x1 - x2) == n:\n print(n + min(y1 + y2, 2 * n - y1 - y2))\n elif abs(y1 - y2) == n:\n print(n + min(x1 + x2, 2 * n - x1 - x2))\n else:\n print(abs(x1 - x2) + abs(y1 - y2))\n\n\nif __name__ == '__main__':\n func()\n", "n, x1, y1, x2, y2 = map(int, input().split())\r\n\r\nfirstx = ''\r\nsecondx = ''\r\nfirsty = ''\r\nsecondy = ''\r\n\r\nif x1 == n:\r\n firstx = 'right'\r\nelif x1 == 0:\r\n firstx = 'left'\r\nif y1 == n:\r\n firsty = 'top'\r\nelif y1 == 0:\r\n firsty = 'bottom'\r\n\r\nif x2 == n:\r\n secondx = 'right'\r\nelif x2 == 0:\r\n secondx = 'left'\r\nif y2 == n:\r\n secondy = 'top'\r\nelif y2 == 0:\r\n secondy = 'bottom'\r\n\r\n\r\nif firstx == 'right' and secondx == 'right':\r\n print(abs(y1 - y2))\r\nelif firstx == 'left' and secondx == 'left':\r\n print(abs(y1 - y2))\r\nelif firsty == 'top' and secondy == 'top':\r\n print(abs(x1 - x2))\r\nelif firsty == 'bottom' and secondy == 'bottom':\r\n print(abs(x1 - x2))\r\nelse:\r\n if firstx == 'right' and secondx == 'left':\r\n clockwise = y1 + n + y2\r\n anticlockwise = n - y1 + n + n - y2\r\n if clockwise > anticlockwise:\r\n print(anticlockwise)\r\n elif anticlockwise > clockwise:\r\n print(clockwise)\r\n elif anticlockwise == clockwise:\r\n print(clockwise)\r\n elif firstx == 'left' and secondx == 'right':\r\n clockwise = n - y1 + n + n - y2\r\n anticlockwise = y1 + n + y2\r\n if clockwise > anticlockwise:\r\n print(anticlockwise)\r\n elif anticlockwise > clockwise:\r\n print(clockwise)\r\n elif anticlockwise == clockwise:\r\n print(clockwise)\r\n elif firsty == 'top' and secondy == 'bottom':\r\n clockwise = n - x1 + n + n - x2\r\n anticlockwise = x1 + n + x2\r\n if clockwise > anticlockwise:\r\n print(anticlockwise)\r\n elif anticlockwise > clockwise:\r\n print(clockwise)\r\n elif anticlockwise == clockwise:\r\n print(clockwise)\r\n elif firsty == 'bottom' and secondy == 'top':\r\n clockwise = x1 + n + x2\r\n anticlockwise = n - x1 + n + n - x2\r\n if clockwise > anticlockwise:\r\n print(anticlockwise)\r\n elif anticlockwise > clockwise:\r\n print(clockwise)\r\n elif anticlockwise == clockwise:\r\n print(clockwise)\r\n else:\r\n if firstx == 'left':\r\n if secondy == 'top':\r\n print(n - y1 + x2)\r\n elif secondy == 'bottom':\r\n print(y1 + x2)\r\n elif firstx == 'right':\r\n if secondy == 'top':\r\n print(n - y1 + n - x2)\r\n elif secondy == 'bottom':\r\n print(y1 + n - x2)\r\n elif firsty == 'top':\r\n if secondx == 'left':\r\n print(x1 + n - y2)\r\n elif secondx == 'right':\r\n print(n - x1 + n - y2)\r\n elif firsty == 'bottom':\r\n if secondx == 'left':\r\n print(x1 + y2)\r\n elif secondx == 'right':\r\n print(n - x1 + y2)\r\n", "n,x1,y1,x2,y2=map(int,input().split())\r\nqueue=[(x1,y1)]\r\ndistance={(x1,y1):0}\r\nfx=[0,0,1,-1]\r\nfy=[1,-1,0,0]\r\nwhile queue:\r\n s=queue.pop(0)\r\n for i in range(4):\r\n x,y=p=(s[0]+fx[i],s[1]+fy[i])\r\n if 0<=x<=n and 0<=y<=n and (0 in p or n in p):\r\n if distance.get(p)==None:\r\n distance[p]=distance[s]+1\r\n queue.append(p)\r\nprint(distance[(x2,y2)])", "n,x1,y1,x2,y2 = [int(i) for i in input().split()]\n\nif x1 == n and x2 == 0 or x2 == n and x1 == 0:\n print(min(y1+y2+n, n - y1 + n + n - y2))\n \nelif y1 == n and y2 == 0 or y2 == n and y1 == 0:\n print(min(x1+x2+n , n - x1 + n + n - x2))\n\nelse: \n print(abs(x1-x2)+abs(y1-y2))\n\n\t\t\t \t \t\t\t\t\t \t\t \t\t \t\t \t\t", "### Codeforces handle - \"@titanalpha\"\r\n#Email id - [email protected]\r\n\r\nfrom collections import Counter, deque\r\nimport math\r\nfrom random import randint\r\nfrom bisect import bisect\r\nimport sys\r\nimport re\r\nimport copy\r\nfrom decimal import Decimal,getcontext\r\ngetcontext().prec = 32\r\n\r\nMOD = 1000000007\r\nMAX = sys.maxsize\r\nMIN = -sys.maxsize\r\nprime = []\r\n\r\nclass get:\r\n def int():\r\n return list(map(int,input().split()))\r\n def str():\r\n return input().split()\r\n def float():\r\n return list(map(float,input().split()))\r\n def map():\r\n return map(int,input().split())\r\n\r\ndef sqrt(x):\r\n return int(math.sqrt(x))+1\r\n\r\ndef gcd(*args):\r\n result = args[0]\r\n for item in args:\r\n result = math.gcd(result,item)\r\n return result\r\n\r\ndef LCM(a,b):\r\n return (a*b)//(math.gcd(a,b))\r\n\r\ndef isPrime(n):\r\n if n == 1:\r\n return False\r\n for i in range(2,sqrt(n)):\r\n if n%i == 0:\r\n return False\r\n return True\r\n\r\ndef solve():\r\n n,x1,y1,x2,y2 = get.int()\r\n if x1 == x2 and x1 in [0,n]:\r\n print(abs(y1-y2))\r\n return\r\n if y1 == y2 and y1 in [0,n]:\r\n print(abs(x1-x2))\r\n return\r\n if (x1 == 0 and y2 == 0) or (x2 == 0 and y1 == 0):\r\n print(y1+x2+x1+y2)\r\n return\r\n if x1 == 0 and y2 == n:\r\n print(n-y1+x2)\r\n return\r\n if x2 == 0 and y1 == n:\r\n print(n-y2+x1)\r\n return\r\n if y1 == n and x2 == n:\r\n print(n-x1+n-y2)\r\n return\r\n if y2 == n and x1 == n:\r\n print(n-x2+n-y1)\r\n return\r\n if y1 == 0 and x2 == n:\r\n print(y2 + n-x1)\r\n return\r\n if y2 == 0 and x1 == n:\r\n print(y1+n-x2)\r\n return\r\n if (x1 == 0 and x2 == n) or (x2 == 0 and x1 == n):\r\n k1 = n + n - y1 + n - y2\r\n k2 = n + y1+y2\r\n print(min(k1,k2))\r\n return\r\n if (y1 == 0 and y2 == n) or (y2 == 0 and y1 == n):\r\n k1 = n + n - x1+n-x2\r\n k2 = n+x1+x2\r\n print(min(k1,k2))\r\n return\r\n\r\n#for _ in range(int(input())):\r\nsolve()", "def check(n, x, y):\r\n if x == 0:\r\n return y\r\n if y == n:\r\n return x + n\r\n if x == n:\r\n return 3 * n - y\r\n return 4 * n - x\r\n\r\n\r\ndef earth(n, x1, y1, x2, y2):\r\n r1, r2 = check(n, x1, y1), check(n, x2, y2)\r\n result = abs(r1 - r2)\r\n return min(result, 4 * n - result)\r\n\r\n\r\nN, X1, Y1, X2, Y2 = [int(i) for i in input().split()]\r\nprint(earth(N, X1, Y1, X2, Y2))\r\n", "# LUOGU_RID: 101451613\nn, a, b, c, d = map(int, input().split())\r\nx = abs(a - c)\r\ny = abs(b - d)\r\nif x == n or y == n:\r\n print(min(a + b + c + d, n * 4 - a - b - c - d))\r\nelse:\r\n print(min(x + y, n * 4 - x - y))" ]

[ "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\nimport math\r\nfrom copy import deepcopy\r\nfrom itertools import combinations, permutations, product, combinations_with_replacement\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nimport sys\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\ndef getN():\r\n return int(input())\r\ndef getNM():\r\n return map(int, input().split())\r\ndef getList():\r\n return list(map(int, input().split()))\r\ndef getListGraph():\r\n return list(map(lambda x:int(x) - 1, input().split()))\r\ndef getArray(intn):\r\n return [int(input()) for i in range(intn)]\r\n\r\nmod = 10 ** 9 + 7\r\nMOD = 998244353\r\n# sys.setrecursionlimit(1000000)\r\ninf = float('inf')\r\neps = 10 ** (-10)\r\ndy = [0, 1, 0, -1]\r\ndx = [1, 0, -1, 0]\r\n\r\n#############\r\n# Main Code #\r\n#############\r\n\r\ndp = [[[0 for k in range (51)] for j in range (31)] for i in range (31)]\r\n\r\ndef calc (n, m, k) :\r\n #print(n,m,k)\r\n if (dp[n][m][k] != 0) or (n*m == k) or (k == 0) :\r\n return dp[n][m][k]\r\n\r\n ans = 10**9\r\n\r\n for i in range (1,n//2 + 1) :\r\n for j in range (k+1) :\r\n #print(i,j,'a')\r\n if (i*m >= (k-j)) and ((n-i)*m >= j) :\r\n ans = min(ans, m*m + calc(i,m,k-j) + calc(n-i,m,j))\r\n\r\n for i in range (1,m//2 + 1) :\r\n for j in range (k+1) :\r\n #print(i,j,'b')\r\n if (i*n >= (k-j)) and ((m-i)*n >= j) :\r\n ans = min(ans, n*n + calc(n,i,k-j) + calc(n,m-i,j))\r\n\r\n dp[n][m][k] = ans\r\n\r\n return ans\r\n\r\nfor _ in range (getN()):\r\n N, M, K = getNM()\r\n\r\n print(calc(N, M, K))", "def relaxMin(a, b):\r\n return min(a, b)\r\ndef Eval(n, m, k):\r\n if n > m:\r\n n, m = m, n\r\n if k == 0:\r\n return 0\r\n if n * m == k:\r\n return 0\r\n if n * m < k:\r\n return float('inf')\r\n if dp[n][m][k] >= 0:\r\n return dp[n][m][k]\r\n val = float('inf')\r\n cost = m ** 2\r\n for tn in range(1, n):\r\n a, b = tn, n - tn\r\n if a > b:\r\n break\r\n for tk in range(k + 1):\r\n val = relaxMin(val, Eval(a, m, tk) +\r\n Eval(b, m, k - tk) +\r\n cost)\r\n val = relaxMin(val, Eval(a, m, k - tk) +\r\n Eval(b, m, tk) +\r\n cost)\r\n cost = n ** 2\r\n for tm in range(1, m):\r\n a, b = tm, m - tm\r\n if a > b:\r\n break\r\n for tk in range(k + 1):\r\n val = relaxMin(val, Eval(n, a, tk) +\r\n Eval(n, b, k - tk) +\r\n cost)\r\n val = relaxMin(val, Eval(n, a, k - tk) +\r\n Eval(n, b, tk) +\r\n cost)\r\n dp[n][m][k] = val\r\n return val\r\ndp = [[[ -1 for _ in range(55)] for _ in range(33)] for _ in range(33)]\r\nq = int(input())\r\nfor _ in range(q):\r\n a, b, c = map(int, input().split())\r\n print(Eval(a, b, c))# 1691833418.8259263", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\ndp=[[[10**9]*51 for i in range(31)] for i in range(31)]\r\n\r\nfor n in range(1,31):\r\n for m in range(1,31):\r\n for k in range(51):\r\n if k==0:\r\n dp[n][m][k]=0\r\n continue\r\n if n*m<k:\r\n continue\r\n if n*m==k:\r\n dp[n][m][k]=0\r\n continue\r\n res=10**9\r\n for i in range(1,n):\r\n for j in range(k+1):\r\n res=min(res,dp[i][m][j]+dp[n-i][m][k-j]+m*m)\r\n \r\n for i in range(1,m):\r\n for j in range(k+1):\r\n res=min(res,dp[n][i][j]+dp[n][m-i][k-j]+n*n)\r\n \r\n dp[n][m][k]=res\r\n\r\nfor _ in range(int(input())):\r\n n,m,k=map(int,input().split())\r\n print(dp[n][m][k])" ]

[ "import sys\r\n\r\n_gcd = lambda s, m, n : m if n==0 else _gcd(s, n, m % n)\r\ngcd = lambda m, n : _gcd(_gcd, m, n)\r\nlcm = lambda m, n : m // gcd(m, n) * n\r\n\r\n\r\n(x, y, a, b) = list(map(int, input().split()))\r\n\r\nz = lcm(x, y)\r\n\r\nprint(b//z-(a-1)//z)\r\n", "def main():\n x, y, a, b = map(int, input().split())\n u, v = x, y\n while v:\n u, v = v, u % v\n v = x * y // u\n print(b // v - (a - 1) // v)\n\n\nif __name__ == '__main__':\n main()\n", "def editor():\r\n\timport sys\r\n\tsys.stdin=open(\"input.txt\",'r')\r\n\tsys.stdout=open(\"output.txt\",'w')\r\n\r\ndef solve():\r\n\tx,y,a,b=I()\r\n\timport math\r\n\t# hcf=math.gcd(a, b)\r\n\t# lcm= a*b//hcf\r\n\t# print(lcm)\r\n\t# ans=(b-a)//hcf\r\n\t# ans=b//hcf - (a-1)//hcf\r\n\tlcm=x*y//math.gcd(x,y)\r\n\tans=b//lcm - (a-1)//lcm\r\n\tprint(ans)\r\n\r\nif __name__ == \"__main__\":\r\n\t# editor()\r\n\ttc=1\r\n\t# tc=int(input())\r\n\tI=lambda:list(map(int,input().split()))\r\n\tfor t in range(tc):\r\n\t\tsolve()", "import math\r\n\r\nif __name__ == '__main__':\r\n x, y, a, b = str(input()).split()\r\n x, y, a, b = int(x), int(y), int(a), int(b)\r\n n = x * y // math.gcd(x, y)\r\n print(1 + b // n - (a + n - 1) // n)\r\n", "import math\nx, y, a, b = map(int, input().split())\nlcm = x * y // math.gcd(x, y)\nnum_multiples = (b // lcm) - ((a - 1) // lcm)\nprint(num_multiples)\n\n\t \t\t\t \t\t \t\t \t\t \t\t \t\t", "from math import gcd\r\n\r\ndef lcm(x,y):\r\n return int(x*y/gcd(x,y))\r\n\r\nx,y,a,b=map(int,input().split())\r\nL=lcm(x,y)\r\nif a%L==0:\r\n l=a//L\r\nelse:\r\n l=a//L+1\r\nu=b//L\r\nprint((u-l)+1)", "from math import gcd,ceil,floor\r\ndef lcm(a,b):\r\n\treturn a*b// gcd(a,b)\r\n\r\n\r\nx,y,a,b=map(int,input().split())\r\n\r\nm=lcm(x,y)\r\n\r\nr1=ceil(a/m)\r\nr2=floor(b/m)\r\n\r\n\r\nprint(r2-r1+1)\r\n\r\n\r\n", "x,y,a,b=map(int,input().split())\nA=1\nwhile A%x or A%y:A+=1\nprint(b//A-(a-1)//A)\n'''21bce278'''\n\t\t \t\t\t\t \t\t\t\t\t\t \t \t\t \t\t\t\t", "import fractions\n\nx, y, a, b = map(int, input().split())\nd = fractions.gcd(x, y)\nd = x * y // d\nprint(b // d - (a - 1) // d)\n", "import math\r\nx,y,a,b=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\nlcm=(x*y)//math.gcd(x,y)\r\nval=(b)//lcm-math.ceil(a/lcm)+1\r\n\r\nprint(val)", "from math import gcd\r\nx,y,a,b=map(int,input().split())\r\nl=((x)*(y)//gcd(x,y))\r\n\r\nprint(b//l-(a-1)//l)\r\n", "import math\r\n \r\nx, y, a, b = map(int, input().split())\r\nl = x * y // math.gcd(x, y)\r\nprint(b // l - (a - 1) // l)", "from math import *\r\nx,y,a,b=map(int,input().split())\r\ng=gcd(x,y)\r\nl=x*y//g\r\nprint((b//l)-((a-1)//l))\r\n", "import math\nnum1, num2, lower_bound, upper_bound = map(int, input().split())\n\nleast_common_multiple = math.lcm(num1, num2)\ncount = (upper_bound // least_common_multiple) - ((lower_bound - 1) // least_common_multiple)\n\nprint(count)\n\n\t \t\t \t \t \t\t \t \t \t \t\t\t", "def gcd(a,b) :\n return a if b==0 else gcd(b,a%b)\n\ndef lcm(a,b) : return a/gcd(a,b)*b\n\nt = input().split(' ')\nx,y,a,b = (int(i) for i in t)\nl = lcm(x,y)\nprint(int(b//l-(a-1)//l+0.5))\n", "from fractions import gcd\r\n[x,y,a,b]=[int(x) for x in input().split()]\r\nh=gcd(x,y)\r\nx=x//h\r\ny=y//h\r\nh=h*x*y\r\nprint(int(b//h - (a-1)//h))\r\n", "\r\ndef gcd(x, y):\r\n\twhile y!= 0:\r\n\t\tx, y = y, x%y\r\n\treturn x\r\n\tpass\r\n\r\ndef lcm(x, y):\r\n\treturn (x*y)/gcd(x,y)\r\n\r\ndata = input().split(\" \")\r\nx = int(data[0])\r\ny = int(data[1])\r\na = int(data[2])\r\nb = int(data[3])\r\nm = int(lcm(x,y))\r\na1 = int(b/m)\r\na2 = int((a-1)/m)\r\nprint(\"%s\" %(a1-a2))", "from fractions import gcd\r\ndef lcm(a, b):\r\n return a * b / gcd(a, b)\r\na,b,c,d = map(int,input().split()) \r\nprint (int(d//lcm(a,b)-(c-1)//lcm(a,b)))", "import math\r\n\r\nx, y, a, b = map(int, input().split())\r\ngcd = math.gcd(x, y)\r\n\r\nlcm = (x // gcd) * (y // gcd) * gcd\r\n\r\na_i = (a - 1) // lcm\r\nb_i = b // lcm\r\n\r\nprint(b_i - a_i)", "from math import *\r\n\r\n\r\nx, y, a, b = map(int, input().split())\r\nm = x * y // gcd(x, y)\r\nprint(b // m - (a - 1) // m)", "import math\r\nx,y,a,b=map(int,input().split())\r\nm=(x*y)//(math.gcd(x,y))\r\nres=b//m-(a-1)//m\r\nprint(res)\r\n ", "from math import gcd\r\n\r\n\r\nx, y, a, b = map(int, input().split())\r\nf = x * y // gcd(x, y)\r\nk1 = b // f\r\nk2 = (a - 1) // f\r\nans = k1 - k2\r\nprint(ans)# 1689333676.0851424", "def kmm(x,y):\r\n i=max(x,y)\r\n while 1:\r\n if i%x==0 and i%y==0:\r\n return i\r\n i+=1\r\nx,y,a,b=list(map(int,input().split()))\r\nprint(b//kmm(x,y)-(a-1)//kmm(x,y))", "def gcd(a, b):\n c = a % b\n while c != 0:\n a = b\n b = c\n c = a % b\n return b\n\ndef main():\n x, y, a, b = map(int, input().split())\n gc = gcd(x, y)\n num = x * y // gc\n result = b // num - (a - 1) // num\n print(result)\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t \t\t \t\t \t\t\t\t\t\t \t \t", "x, y, a, b = [int(x) for x in input().split()]\r\nimport math\r\nl=x*y/math.gcd(x,y)\r\nr=math.floor(b/l)-math.ceil(a/l)+1\r\nprint(r)", "x, y, a, b = map(int, input().split())\r\n\r\nlcm = 1\r\nc_i = 1\r\nwhile c_i <= x or c_i <= y:\r\n if x % c_i == 0 and y % c_i == 0:\r\n lcm= c_i\r\n c_i += 1\r\nlcm = (x * y) // lcm\r\nprint(int(b // lcm - (a - 1) // lcm))", "def GCD(a, b):\n while a % b != 0:\n a, b = b, a % b\n return b\n\ndef LCM(a, b):\n return a * b // GCD(a, b)\n\nx, y, a, b = map(int,input().split())\nlcm = LCM(x, y)\nprint(b // lcm - (a - 1) // lcm)\n# 1524251734227\n", "def GCD(n, b):\n while n % b != 0:\n n, b = b, n % b\n return b\n\ndef LCM(n, b):\n return n * b // GCD(n, b)\n\nl = input().split(' ')\nx, y, n, b = int(l[0]), int(l[1]), int(l[2]), int(l[3])\nlcm = LCM(x, y)\nprint(b // lcm - (n - 1) // lcm)\n\t\t \t\t \t \t\t \t \t \t\t \t \t", "x,y,a,b=map(int,input().split())\r\nfrom math import*\r\nl=x*y//gcd(x,y)\r\nprint(b//l-a//l+int(a%l==0))", "x,y,a,b=map(int,input().split())\r\nA=1\r\nwhile A%x or A%y:A+=1\r\nprint(b//A-(a-1)//A)\r\n", "from math import floor\n\n\ndef gcd(x, y):\n return x if y == 0 else gcd(y, x % y)\n\n\n(x, y, a, b) = [int(x) for x in input().split(' ')]\nr = x * y / gcd(x, y)\no = floor(b / r) - floor((a - 1) / r)\nprint(o)\n# 1524255634659\n", "from collections import defaultdict, deque, Counter, OrderedDict\r\nimport threading,sys\r\nfrom math import gcd\r\n\r\ndef main():\r\n x,y,a,b = map(int,input().split())\r\n l = (x*y)/gcd(x,y)\r\n ans = int(b//l - (a-1)//l)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\"\"\"\r\n main()", "x,y,a,b=map(int,input().split())\r\nf=lambda x,y:f(y%x,x)if x else y\r\nx=x//f(x,y)*y\r\nprint(b//x-(a-1)//x)", "import math\r\nlx = [int(x) for x in input().split()]\r\na,b=lx[0],lx[1]\r\nl,r=lx[2],lx[3]\r\n\r\nd = (a*b)/math.gcd(a,b)\r\n\r\nprint(int((r/d)-math.ceil(l/d)+1))", "import fractions\r\nx, y, a, b = map(int, input().split())\r\nlcd = x // fractions.gcd(x, y) * y\r\nprint(b // lcd - (a - 1) // lcd)", "import math\nimport sys\nfrom fractions import gcd\n\nx,y,a,b=map(int,sys.stdin.readline().split())\n\ng=(x*y)//gcd(x,y)\n\ns=math.ceil(a/g)\n\ne=math.floor(b/g)\n\nprint(e-s+1)\n\n", "from math import gcd\r\nx, y, a, b=[int(k) for k in input().split()]\r\nc=x*y//gcd(x, y)\r\nprint(b//c-a//c+int(bool(a%c==0)))", "x,y,a,b=map(int,input().split())\np=0\nm=max(x,y)\nwhile True:\n\tif m%x==0 and m%y==0:\n\t\tp=m\n\t\tbreak\n\tm+=1\np1=0\nif a%p==0:\n\tp1=a\nelse:\n\tp1=a+p-a%p\nif p1>b:\n\tprint(0)\nelse:\n\tprint((b-p1)//p+1)\n\t\t\n\t\t", "x,y,a,b=map(int,input().split())\n \nC=1\nwhile C%x or C%y:\n C+=1\nprint(b//C-(a-1)//C)\n\t \t\t\t\t \t\t \t\t\t\t \t\t\t\t \t", "import math\r\nstring = input()\r\nx, y, a, b = map(int, string.split())\r\nm = x * y // math.gcd(x, y)\r\nprint(math.floor(b / m) - math.ceil(a / m) + 1)", "x, y, a, b = map(int, input().split())\n\ncurrent_multiple = 1\nwhile current_multiple % x or current_multiple % y:\n current_multiple += 1\n\nresult = b // current_multiple - (a - 1) // current_multiple\nprint(result)\n\n\t\t \t \t \t\t\t\t\t \t\t\t\t \t\t \t \t\t", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\nfrom fractions import gcd\r\n\r\n\r\ndef main() -> int:\r\n (x, y, a, b) = map(int, input().split())\r\n lcm = x * y // gcd(x, y)\r\n\r\n print(b // lcm - (a - 1) // lcm)\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "def gcd(a,b):\n if a == 0:\n return b\n else:\n return gcd(b%a,a)\ndef main():\n x,y,a,b = map(int,input().split())\n if a > b:\n return 0\n else:\n lcm = (x*y)//gcd(x,y)\n ans = b//lcm - a//lcm\n if a%lcm == 0:\n ans += 1\n print(max(0,ans))\n\nif __name__ == '__main__':\n main()\n", "import math\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\nx,y,a,b = map(int, input().split())\r\nprint(b//(x//gcd(x,y)*y)-(a-1)//(x//gcd(x,y)*y))\r\n", "from math import *\r\nfrom collections import *\r\ndef inp(): return map(int,input().split())\r\ndef inp_arr(): return list(map(int,input().split()))\r\ndef lcm(a,b):return (a*b)/gcd(a,b)\r\nx,y,lb,ub = inp()\r\nprint(int(ub//lcm(x,y)-(lb-1)//lcm(x,y)))", "z=[int(i) for i in input().split()]\r\nx,y,a,b=z[0],z[1],z[2],z[3]\r\n\r\ndef gcd(x,y):\r\n for i in range(1,y+1):\r\n if (x*i)%y==0:\r\n return x*i\r\n\r\n\r\nprint(int(b//(gcd(x,y))-a//(gcd(x,y))+(a%(gcd(x,y))==0)))\r\n \r\n", "x, y, a, b = map(int, input().split())\r\ng = 1\r\nwhile g % x or g % y:\r\n g += 1\r\nprint(b//g - (a-1)//g)", "def gcd(a,b):\r\n if b ==0:\r\n return a\r\n return gcd(b , a%b)\r\nx, y, a, b = map(int, input().split())\r\nGCD = x*y // gcd(x,y)\r\nprint(b // GCD - (a-1) // GCD)\r\n", "from math import gcd\r\na,b,c,d=map(int,input().split())\r\nlcmm=(a*b)//gcd(a,b)\r\ndiv_c=(d//lcmm)-((c-1)//lcmm)\r\nprint(div_c)\r\n", "from math import ceil\r\n\r\ndef gcd(a, b):\r\n return b and gcd(b, a%b) or a\r\n\r\nx,y,a,b = map(int, input().split(\" \"))\r\nlcm = x//gcd(x,y)*y\r\nprint(b//lcm - ceil(a/lcm) + 1)", "from math import gcd\r\nx,y,a,b=map(int,input().split())\r\nx=x*y//gcd(x,y)\r\nprint(b//x-(a-1)//x)#+(a%x==0))", "import math\nx,y,a,b = map(int, input().split())\nlcm = x * y // math.gcd(x, y)\nnum = (b // lcm) - ((a - 1) // lcm)\nprint(num)\n\n \t \t\t\t \t\t \t \t \t\t", "def gcd(x, y):\n\tif y == 0:\n\t\treturn x\n\treturn gcd(y, x % y)\n\nx, y, a, b = map(int, input().split())\nlcm = x * y // gcd(x,y)\nprint(b // lcm - (a - 1) // lcm)", "def GCD(a, b):\r\n while a % b != 0:\r\n a, b = b, a % b\r\n return b\r\n\r\ndef LCM(a, b):\r\n return a * b // GCD(a, b)\r\n\r\nl = input().split(' ')\r\nx, y, a, b = int(l[0]), int(l[1]), int(l[2]), int(l[3])\r\nlcm = LCM(x, y)\r\nprint(b // lcm - (a - 1) // lcm)\r\n", "x,y,a,b = list(map(int, input().split()))\r\n\r\ndef gcd(a,b):\r\n c = a%b\r\n \r\n while c!=0:\r\n a=b\r\n b=c\r\n c=a%b\r\n \r\n return b\r\n\r\ng = gcd(x,y)\r\nnum = (x*y)//g\r\n\r\nprint(b//num - (a-1)//num)", "# -*- coding: utf-8 -*-\r\n\r\ndef gcd(a, b):\r\n x, y = max(a, b), min(a, b)\r\n while x % y:\r\n x, y = y, x % y\r\n return y\r\n\r\ndef test():\r\n assert gcd(1071, 462) == 21\r\n assert gcd(462, 1071) == 21\r\n assert gcd(81, 135) == 27\r\n print(\"test passes\")\r\n\r\ndef solve(x, y, a, b):\r\n tmp = x * y // gcd(x, y)\r\n #print(x, y, gcd(x, y))\r\n #print(b // tmp, a // tmp)\r\n return b // tmp - (a - 1) // tmp\r\n\r\nx, y, a, b = map(int, input().split())\r\nprint(solve(x, y, a, b))\r\n \r\n", "from math import gcd\r\nx,y,a,b=list(map(int,input().split()))\r\nlcm=(x*y)//(gcd(x,y))\r\nprint(b//lcm-(a-1)//lcm)\r\n", "#!/usr/bin/python3\n\nx, y, a, b = tuple(map(int, input().split()))\n\ndef gcd(i, j):\n while i:\n i, j = j % i, i\n return j\n\ns = x * y // gcd(x, y)\nprint(b // s - (a - 1) // s)\n", "import math\r\n\r\n\r\n\r\ndef gcd(a, b):\r\n a, b = sorted([a, b])\r\n while True:\r\n if b == 0:\r\n return a\r\n else:\r\n a, b = b, a % b\r\n\r\n\r\ndef main_function():\r\n x, y, a, b = [int(i) for i in input().split(\" \")]\r\n z = (x * y) // gcd(x, y)\r\n numb_min_x = (a // z) * z + bool(a % z) * z\r\n numb_max_x = (b // z) * z\r\n if numb_min_x > numb_max_x:\r\n print(0)\r\n else:\r\n s = numb_min_x // z\r\n e = numb_max_x // z\r\n print(e - s + 1)\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#main_function()", "def compute_lcm(x, y):\r\n if x > y:\r\n greater = x\r\n else:\r\n greater = y\r\n while(True):\r\n if((greater % x == 0) and (greater % y == 0)):\r\n lcm = greater\r\n break\r\n greater += 1\r\n return lcm\r\n\r\nx,y,a,b=map(int,input().split())\r\nc=compute_lcm(x, y)\r\ncount=0\r\np=a%c\r\nq=b%c\r\nif p==0:\r\n p=a//c\r\nelse:\r\n p=a//c+1\r\nif q==0:\r\n q=b//c\r\nelse:\r\n q=b//c\r\nprint(q-p+1)\r\n", "from math import gcd\nx, y, a, b = map(int, input().split())\nnum = (x * y) // gcd(x, y)\nans = (b // num) - (a // num)\nif a % num == 0:\n ans += 1\nprint(ans)\n", "import math\r\ndef function(x, y, a, b):\r\n d=math.gcd(x, y)\r\n l=int((x*y)/d)\r\n #print(l)\r\n a1=0\r\n b1=0\r\n if a%l!=0:\r\n a1=int(math.ceil(a/l))*l\r\n if a%l==0:\r\n a1=a\r\n if b%l==0:\r\n b1=b\r\n if b%l!=0:\r\n b1=b-(b%l)\r\n #print(a1)\r\n #print(b1)\r\n print(int((b1-a1)/l)+1)\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n x, y, a, b=map(int, input().rstrip().split())\r\n function(x, y, a, b)", "import math\n\nx, y, a, b = map(int, input().split())\n\nl = x * y // math.gcd(x, y)\nprint(b // l - (a-1) // l )\n \t \t\t \t\t\t\t\t \t\t\t\t\t\t\t\t\t \t\t\t\t\t", "def gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\nx, y, a, b = map(int, input().split())\r\nn = x * y // gcd(x, y)\r\nprint(b // n - (a - 1) // n)", "from math import gcd\r\ndef solve(x, y, uppBound):\r\n lcm = x * y // gcd(x, y);\r\n return uppBound // lcm;\r\nx, y, a, b = map(int, input().split())\r\nprint(solve(x, y, b) - solve(x, y, a - 1));\r\n", "from fractions import gcd\n\ndef lcd(a, b):\n g = gcd(a, b)\n return a*b//g\n\nif __name__ == '__main__':\n x, y, a, b = [int(x) for x in input().split()]\n l = lcd(x, y)\n print(b//l-(a-1)//l)\n", "from math import gcd\r\n\r\nx, y, a, b = map(int,input().split())\r\nlc = x*y/gcd(x, y)\r\nt1 = a%lc\r\nif t1==0:\r\n print(int(((b-a)//lc)+1))\r\nelse:\r\n a+=(lc-t1)\r\n print(int(((b-a)//lc)+1))", "import fractions\r\nx,y,a,b=map(int,input().split())\r\nd=fractions.gcd(x,y)\r\nd=x*y // d\r\nprint(b // d -(a-1)//d)\r\n", "def gcd(a, b):\n\twhile a:\n\t\ta, b = b % a, a\n\treturn b\n\ndef lca(a, b):\n\treturn a * b // gcd(a, b)\n\nx, y, a, b = [int(x) for x in input().split()]\nl = lca(x, y)\nprint(b // l - (a - 1) // l)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import gcd\r\n\r\nx, y, a, b = map(int, input().split())\r\n\r\nc = (x*y) // gcd(x, y)\r\na = (a-1)//c\r\nb = b//c\r\nprint(b-a)", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\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\nx,y,a,b = rm()\r\nl = x*y // math.gcd(x,y)\r\nprint(b//l-(a-1)//l)\r\n", "from math import *\r\ndef lcm(x, y):return x*y//gcd(x, y)\r\na,b,x,y=map(int,input().split())\r\nt=lcm(a,b)\r\np=floor(y/t)-ceil(x/t)\r\nif p<0: print(0)\r\nelse: print(p+1)", "def gcd(a,b):\r\n if a<b:\r\n if a==0:return b\r\n return gcd(b%a,a)\r\n else:\r\n if b==0:return a\r\n return gcd(b,a%b)\r\na,b,x,y=map(int,input().split())\r\ntemp=(a*b)//gcd(a,b)\r\nprint(((temp)*(y//(temp))-((temp)*(x//(temp))+x%(temp)))//(temp)+1)\r\n", "import math\r\n\r\n# Function to calculate the number of common bricks between a and b for x and y\r\ndef common_bricks(x, y, a, b):\r\n lcm = (x * y) // math.gcd(x, y)\r\n \r\n # Calculate the number of common bricks within [1, b]\r\n common_up_to_b = b // lcm\r\n \r\n # Calculate the number of common bricks within [1, a-1]\r\n common_up_to_a_minus_1 = (a - 1) // lcm\r\n \r\n return common_up_to_b - common_up_to_a_minus_1\r\n\r\n# Read input\r\nx, y, a, b = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = common_bricks(x, y, a, b)\r\nprint(result)\r\n", "\r\n\r\n\r\nx,y,a,b = map(int,input().split())\r\nu=0\r\nimport math\r\n\r\n\r\nf = math.gcd(x,y)\r\nlcm = x*y//f\r\n\r\nprint(b//lcm - (a-1)//lcm)\r\n", "import math\r\n\r\ndef get(x,y,n):\r\n g = math.gcd(max(x,y),min(x,y))\r\n lcm = x*y//g\r\n\r\n return n//lcm\r\n\r\ndef main():\r\n x,y,a,b = map(int,input().split())\r\n\r\n total = get(x,y,b)-get(x,y,a-1)\r\n print(total)\r\n \r\nmain()\r\n", "x,y,a,b = input().split()\r\nx=int(x)\r\ny=int(y)\r\na=int(a)\r\nb=int(b)\r\np=0\r\n\r\nif(x>y):\r\n temp=x\r\n x=y\r\n y=temp\r\ni=y\r\nwhile(i>0):\r\n if(x%i==0 and y%i==0):\r\n p=(x*y)//i\r\n break\r\n i-=1\r\n\r\nfor i in range(a,b+1):\r\n if(i%p==0):\r\n q=i\r\n r=1\r\n break\r\n else:\r\n q=a\r\n r=0\r\nprint(b//p-q//p+r)\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\ndef gcd(a,b):\r\n\twhile b > 0:\r\n\t\tc = a%b\r\n\t\ta = b\r\n\t\tb = c\r\n\treturn a\r\n\r\ndef lcm(a,b):\r\n\treturn a*b//gcd(a,b)\r\n\r\nx, y, a, b = mints()\r\nz = lcm(x, y)\r\naa = (a+z-1)//z\r\nbb = b//z\r\nprint(bb+1-aa)\r\n", "from fractions import gcd\r\nx, y, a, b = map(int,input().split())\r\nnok = (x * y) // gcd(x, y)\r\nxx = (a // nok) * nok\r\nif a%nok != 0:\r\n xx += nok\r\nyy= (b //nok) * nok\r\nif xx > b:\r\n print(0)\r\nelse:\r\n if yy% nok == 0:\r\n f = 1\r\n else:\r\n f = 0\r\n print((yy-xx) // nok + f)", "def GCD(a,b):\r\n\twhile True:\r\n\t\ts = a%b\r\n\t\ta = b\r\n\t\tb = s\r\n\t\t# print(a,b)\r\n\t\tif b == 0:\r\n\t\t\treturn a\r\nx,y,a,b = map(int,input().split())\r\n# print(GCD(2,3))\r\n\r\nLCM = int(x*y//GCD(x,y))\r\n\r\nprint(int(b//LCM-(a-1)//LCM))\r\n# print(LCM)", "def gcd(x, y):\n while x % y != 0:\n x, y = y, x%y\n return y\n\nx,y,a,b = map(int, input().split())\nd = x*y//gcd(x,y)\nprint(b//d - (a-1)//d)\n\n", "import math\r\nx,y,a,b = map(int,input().split())\r\nlcm = x*y//(math.gcd(x,y))\r\n\r\nans = (b//lcm) - (a//lcm)\r\n\r\nif(a%lcm==0):\r\n ans+=1\r\nprint(ans)", "import math\r\ndef gcd(x,y):\r\n if x > y:\r\n return gcd(x - y, y)\r\n elif y > x:\r\n return gcd(x, y - x)\r\n else:\r\n return x\r\n\r\nn = 1\r\nfor i in range(n):\r\n thing = input().split()\r\n for j in range(len(thing)):\r\n thing[j] = int(thing[j])\r\n d = gcd(thing[0], thing[1])\r\n lcm = thing[0] * thing[1] / d\r\n print(math.floor(thing[3] / lcm) - math.floor((thing[2] - 1) / lcm))", "import math\r\nx, y, a, b = map(int, input().split())\r\nz = x * y // math.gcd(x, y)\r\nres = b // z - a // z\r\nif (a % z == 0):\r\n print(res + 1)\r\nelse:\r\n print(res)\r\n", "from fractions import gcd\n\n\ndef main():\n x, y, a, b = map(int, input().split())\n xy = x * y // gcd(x, y)\n print(b // xy - (a - 1) // xy)\n\n\nif __name__ == '__main__':\n main()\n", "x, y, a, b = map(int, input().split())\r\ndef gcd(a, b):\r\n while a > 0 and b > 0:\r\n if a > b:\r\n a %= b\r\n else:\r\n b %= a\r\n return a + b\r\nnok = (x * y) // gcd(x, y)\r\nans = b // nok - ((a - 1) // nok)\r\nprint(ans)\r\n", "from math import gcd \r\nx,y,a,b = map(int,input().split())\r\nlcm = (x * y) // gcd(x, y) \r\ncount1 = (a - 1) // lcm \r\ncountr = b // lcm \r\nans = countr - count1 \r\nprint(ans)", "x, y, a, b = map(int, input().split())\r\n\r\ngcd, d = x, y\r\nwhile d > 0:\r\n gcd, d = d, gcd % d\r\n\r\nlcm = x * y // gcd\r\nprint(b//lcm - (a-1)//lcm)\r\n", "x,y,a,b = map(int,input().split())\r\ndef n(x,y):\r\n if min(x,y) == 0:\r\n return max(x,y)\r\n else:\r\n return n(min(x,y),max(x,y) % min(x,y))\r\nk = (x * y) // n(x,y)\r\nprint(b // k - (a-1) // k)", "from fractions import gcd\r\nx, y, a, b = (int(x) for x in input().split())\r\nm = x * y // gcd(x, y)\r\nprint(b // m - (a + m - 1) // m + 1)", "import math\r\n\r\nx, y, a, b = map(int, input().split())\r\nl = max(x, y) * min(x, y) // math.gcd(x, y)\r\nprint(b//l - (a-1)//l)\r\n", "from fractions import *\r\nx,y,a,b = map(int,input().split())\r\nnok = (x*y)//gcd(x,y)\r\nfirst = (a // nok) * nok + (nok if a%nok != 0 else 0)\r\nsecond = (b//nok) * nok\r\nif first > b:\r\n print(0)\r\nelse:\r\n print((second-first)//nok +(1 if second % nok == 0 else 0))\r\n\r\n", "def gcd(a, b):\r\n\twhile b:\r\n\t\ta, b = b, a % b\r\n\treturn a\r\n\r\ndef main(x,y,a,b):\r\n\tt = x*y//gcd(x,y)\r\n\tanswer = b//t-a//t\r\n\r\n\tif a%t==0:\r\n\t\tanswer+=1\r\n\r\n\treturn answer\r\n\r\ndef init():\r\n\tx,y,a,b = list(map(int, input().split()))\r\n\r\n\tprint(main(x,y,a,b))\r\n\r\ninit()", "import math\ndef main():\n [x,y,a,b] = input().split(' ')\n x = int(x)\n y = int(y)\n a = int(a)\n b = int(b)\n mmc = x*y/math.gcd(x,y)\n ini = math.ceil(a/mmc)\n fim = math.floor(b/mmc)\n print(fim - ini + 1)\nmain()\n\n# 1503615804259\n", "def gcd(a,b):\n while b > 0:\n a, b = b, a % b\n return a\n \ndef lcm(a, b):\n\treturn a * b / gcd(a, b)\n\n(x, y, a, b) = (int(x) for x in input().split())\n\nflag = False\naux = a\n\n\nwhile aux <= b:\n\tif aux % x == 0 and aux % y == 0:\n\t\tflag = True\n\t\tstart = aux + 1\n\t\tbreak\n\t\t\n\taux += 1\n\nif flag:\n\tstep = lcm(x, y)\n\t\n\tprint(1 + int((b - start + 1) / step))\n\t\nelse:\n\tprint(0)\n \n\n# 1524257712579\n", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(100000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nx,y,l,r=invr()\r\n\r\nsame=x*y//math.gcd(x,y)\r\n\r\ntot=r//(same)-(l-1)//same\r\n\r\nprint(tot)\r\n\t\t\r\n\t\t\t\r\n\r\n\t\r\n", "def GCD(a,b):\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\ndef LCM(a,b):\r\n return a*b//GCD(a,b)\r\nl=input().split(' ')\r\nx,y,a,b=int(l[0]),int(l[1]),int(l[2]),int(l[3])\r\nlcm=LCM(x,y)\r\nprint(b//lcm-(a-1)//lcm)", "from math import gcd\r\nx, y, a, b = map(int, input().split())\r\nprint(b//((x*y)//gcd(x,y))-(a-1)//((x*y)//gcd(x,y)))", "from math import gcd\r\n\r\n\r\ndef getLCM(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\ns = input().split(\" \")\r\n\r\nfor i in range(len(s)):\r\n s[i]=int(s[i])\r\n\r\ny=getLCM(s[0],s[1])\r\n\r\nif y>s[3]:\r\n print(0)\r\nelse:\r\n print((s[3]//y)-((s[2]-1)//y))", "def GCD(a,b):\r\n while a%b !=0:\r\n a,b=b,a%b\r\n return b\r\ndef LCM(a,b):\r\n return a*b//GCD(a,b)\r\nq=input().split(' ')\r\nx,y,a,b=int(q[0]),int(q[1]),int(q[2]),int(q[3])\r\nl=LCM(x,y)\r\nprint(b//l-(a-1)//l)", "import math\n\ndef lcm(x, y):\n return x * y // math.gcd(x, y)\n\ndef count_bricks(x, y, a, b):\n lcm_xy = lcm(x, y)\n painted_bricks_b = b // lcm_xy\n painted_bricks_a_minus_1 = (a - 1) // lcm_xy\n common_painted_bricks = painted_bricks_b - painted_bricks_a_minus_1\n return common_painted_bricks\n\nx, y, a, b = map(int, input().split())\n\nresult = count_bricks(x, y, a, b)\nprint(result)\n\t \t \t\t\t\t\t\t\t\t \t\t \t \t \t\t \t\t\t", "def gcd(x, y):\n while y != 0:\n x, y = y, x % y\n return x\n\ndef solve(x, y, uppBound):\n lcm = (x * y) // gcd(x, y)\n return uppBound // lcm\n\ndef main():\n x, y, A, B = map(int, input().split())\n result = solve(x, y, B) - solve(x, y, A - 1)\n print(result)\n\nif __name__ == \"__main__\":\n main()\n\n\t\t \t \t\t \t\t \t\t \t\t \t \t \t", "from math import *\ndef gcd(x,y):\n\tif y==0:\n\t\treturn x\n\telse:\n\t\treturn gcd(y, x%y)\ndef lcm(x,y):\n\treturn (x*y)//gcd(x,y)\nx,y,a,b= map(int, input().split())\nnum=lcm(x,y)\nprint(floor(b/num)-ceil(a/num) + 1)\n", "x,y,a,b=map(int,input().split())\r\nl,r,i=min(x,y),max(x,y),1\r\nwhile(True):\r\n if(l%i==0):\r\n if(r%int(l/i)==0):\r\n break\r\n i+=1\r\np=int((l*r)/int(l/i))\r\nif(a%p==0):\r\n print(int(b//p)-int(a//p)+1)\r\nelse:\r\n print(int(b//p)-int(a//p))", "x,y,a,b = map(int,input().split())\r\n\r\n\r\nfrom math import gcd\r\ng = gcd(x,y)\r\ng = x*y//g\r\nprint((b//g)-(a-1)//g)", "line = input()\r\n\r\ndef gcd(x, y):\r\n \r\n while(y):\r\n x, y = y, x % y\r\n \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\nline = line.split(\" \")\r\n\r\nx = int(line[0])\r\ny = int(line[1])\r\na = int(line[2])\r\nb = int(line[3])\r\n\r\n\r\nlcm = lcm(x,y)\r\n \r\nleft = int((a-1) / lcm)\r\nright = int(b / lcm)\r\n\r\ndiff = right - left\r\n\r\n \r\nprint(diff)", "x,y,a,b=map(int,input().split())\nfrom math import*\nl=x*y//gcd(x,y)\nprint(b//l-(a-1)//l)\n \t \t\t \t \t\t \t\t\t\t\t\t \t \t \t", "from math import gcd\r\nx,y,a,b=list(map(int,input().split()));print(b//((x*y)//gcd(x,y))-(a-1)//((x*y)//gcd(x,y)))", "import math\n\ndef count_common_bricks(x, y, a, b):\n lcm = (x * y) // math.gcd(x, y) \n\n first_common_brick = max(a, lcm)\n\n last_common_brick = b - (b % lcm)\n\n common_bricks = (last_common_brick - first_common_brick) // lcm + 1\n\n return common_bricks\n\nx, y, a, b = map(int, input().split())\n\nresult = count_common_bricks(x, y, a, b)\nprint(result)\n\n\t\t \t \t \t\t \t\t\t\t\t\t\t \t\t \t \t\t", "import math\n\ndef calculate_common_bricks(x_dim, y_dim, start_range, end_range):\n least_common_multiple = (x_dim * y_dim) // math.gcd(x_dim, y_dim)\n common_bricks_until_end = end_range // least_common_multiple\n common_bricks_until_start_minus_1 = (start_range - 1) // least_common_multiple\n \n return common_bricks_until_end - common_bricks_until_start_minus_1\n\n# Read input\nx_dimension, y_dimension, range_start, range_end = map(int, input().split())\n\n# Calculate and print the result\nresult = calculate_common_bricks(x_dimension, y_dimension, range_start, range_end)\nprint(result)\n\n\t \t\t \t \t \t \t\t \t\t\t \t", "import math\r\n\r\ndef fruit(i, j, k, l):\r\n a=math.gcd(i,j)\r\n lc=(i*j)//a\r\n tmp=l//lc\r\n tmp2=(k-1)//lc\r\n return tmp-tmp2\r\n\r\ni,j,k,l=map(int,input().split())\r\nprint(fruit(i,j,k,l))\r\n\r\n\r\n", "import math\r\nx,y,l,r=map(int,input().split())\r\ntemp=x*y/math.gcd(x,y)\r\nprint(math.floor(r/temp)-math.ceil(l/temp)+1)", "from math import*\n\ndef gcd(a, b):\n\tif b == 0:\n\t\treturn a\n\telse:\n\t\treturn gcd(b, a % b)\n\nx, y, a, b = list(map(int, input().split()))\nnok = (x * y) // gcd(x, y)\na += (nok - a % nok) % nok\nb -= b % nok\nprint((b - a) // nok + 1)", "x,y,a,b=map(int,input().split())\nt1=x\nt2=y\nwhile(x%y):\n c = x%y\n x = y\n y = c\nc = (t1*t2)//y\nprint((b//c)-(a-1)//c)\n \t\t \t \t\t \t \t \t\t \t\t\t\t \t\t", "x,y,a,b=map(int,input().split())\r\n \r\nA=1\r\nwhile A%x or A%y:\r\n A+=1\r\nprint(b//A-(a-1)//A)", "def findlcm(a, b):\n if(a > b):\n maximum = a\n else:\n maximum = b\n\n while(True):\n if(maximum % a == 0 and maximum % b == 0):\n lcm = maximum;\n break;\n maximum = maximum + 1\n return lcm\n\nclass CodeforcesTask340ASolution:\n def __init__(self):\n self.result = ''\n self.x_y_a_b = []\n\n def read_input(self):\n self.x_y_a_b = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n mult = findlcm(self.x_y_a_b[0], self.x_y_a_b[1])\n res = 0\n left = self.x_y_a_b[2] if not self.x_y_a_b[2] % mult else mult + (self.x_y_a_b[2] // mult) * mult\n right = self.x_y_a_b[3] if not self.x_y_a_b[3] % mult else (self.x_y_a_b[3] // mult) * mult\n res = right // mult - left // mult + 1\n self.result = str(res)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask340ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from fractions import gcd\r\n\r\nx, y, a, b = [int(x) for x in input().split()]\r\n\r\nd = x * y // gcd(x, y)\r\nif a % d == 0:\r\n lowerFactor = a // d\r\nelse:\r\n lowerFactor = a // d + 1\r\n\r\nhigherFactor = b // d\r\nprint(higherFactor - lowerFactor + 1)", "def gcd(x,y):\n if y%x==0:\n return x\n else:\n return gcd(y%x,x)\n\n\nif __name__=='__main__':\n inp = input()\n arr = inp.split(' ')\n x = int(arr[0])\n y = int(arr[1])\n a = int(arr[2])\n b = int(arr[3])\n g = gcd(min(x,y),max(x,y))\n l = (x*y)//g\n i = 0\n for i in range(a,a+l+1):\n if i > b:\n break\n if i%l==0:\n break\n ans = 0\n if b>=i:\n ans=(b-i)//l + 1\n print(ans)\n", "def gcd(a, b):\r\n if b == 0 :\r\n return a\r\n return gcd(b , a % b )\r\nx , y , a , b = map(int , input().split())\r\nz = x * y / gcd(x , y)\r\nprint(int(b // z - (a-1) // z))", "from math import gcd\n\nx, y, a, b = map(int, input().split())\n\nmmc = x * y // gcd(x, y)\n\nr = b // mmc\nl = (a-1) // mmc\n\nprint(r-l)\n\t \t \t\t \t\t\t \t\t \t\t \t\t \t", "def gcd(a,b):\n while b:\n a,b=b,a%b\n return a\n\ndef lcm(a,b):\n return a*b//gcd(a,b)\nx,y,a,b=map(int,input().split())\nz=lcm(x,y)\nprint(b//z-(a+z-1)//z+1)", "import math\r\nx,y,a,b=map(int,input().split())\r\ng=math.lcm(x,y)\r\nif a%g!=0:\r\n a+=(g-(a%g))\r\nif b%g!=0:\r\n b-=b%g\r\nprint(1+(b-a)//g)", "def gcd(x, y):\n if y == 0:\n return x\n return gcd(y, x % y)\n\ndef solve(x, y, uppbound):\n lcm = 1 * x * y\n lcm = lcm // gcd(x, y)\n return uppbound // lcm\n\ndef main():\n x, y, a, b = map(int, input().split())\n result = solve(x, y, b) - solve(x, y, a - 1)\n print(result)\n\nif __name__ == \"__main__\":\n main()\n\n\t\t \t\t \t\t \t \t \t \t\t \t \t\t \t", "\nx, y, a, b = map(int, input().split())\n\nfrom math import gcd\n\naux = x * y // gcd(x, y)\n\nprint(b//aux - (a-1)//aux)\n\t \t\t\t\t\t \t\t\t \t \t\t\t\t\t \t\t \t\t \t\t", "def NOK(a, b):\r\n m=min(a, b)\r\n M=max(a, b)\r\n i=1\r\n while (i*M)%m!=0: i+=1\r\n return i*M\r\n\r\nI=[int(i) for i in input().split()]\r\nx, y, a, b = I[0], I[1], I[2], I[3]\r\nnok=NOK(x,y)\r\nans=0\r\nstart=a\r\nfor i in range(a,b+1):\r\n if start%x==0 and start%y==0: break\r\n else: start+=1\r\nif start>b: print(ans)\r\nelse: print(int((b-start)/nok)+1)\r\n", "import math\n\n# This function calculates the number of common bricks between two specified ranges.\ndef calculate_common_bricks(x_dim, y_dim, start_range, end_range):\n # Calculate the least common multiple (LCM) of the dimensions.\n least_common_multiple = (x_dim * y_dim) // math.gcd(x_dim, y_dim)\n \n # Calculate the number of common bricks until the end of the range.\n common_bricks_until_end = end_range // least_common_multiple\n \n # Calculate the number of common bricks until the brick before the start of the range.\n common_bricks_until_start_minus_1 = (start_range - 1) // least_common_multiple\n \n # Calculate the total number of common bricks in the specified range and return it.\n return common_bricks_until_end - common_bricks_until_start_minus_1\n\n# Read input values for dimensions and range.\nx_dimension, y_dimension, range_start, range_end = map(int, input().split())\n\n# Calculate the number of common bricks and print the result.\nresult = calculate_common_bricks(x_dimension, y_dimension, range_start, range_end)\nprint(result)\n\n \t \t \t\t \t \t\t \t\t \t\t\t\t \t", "def 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\nx,y,a,b=map(int,input().split())\r\n\r\nlc=lcm(x,y)\r\nprint((b//lc)-((a-1)//lc))\r\n", "import sys\nfrom fractions import gcd\nf = sys.stdin\n# f = open(\"input.txt\", \"r\")\nx, y, a, b = map(int, f.readline().strip().split())\ndef lcm(x, y):\n return x * y // gcd(x, y)\nl = lcm(x, y)\nprint(b//l - (a-1)//l)", "import math\n\ndef count_bricks_painted(x, y, a, b):\n red_bricks = b // x - (a - 1) // x\n pink_bricks = b // y - (a - 1) // y\n return red_bricks, pink_bricks\ndef lcm(a, b):\n return a * b // math.gcd(a, b)\nx, y, a, b = map(int, input().split())\nred_bricks, pink_bricks = count_bricks_painted(x, y, a, b)\ncommon_bricks = b // lcm(x, y) - (a - 1) // lcm(x, y)\nprint(common_bricks)\n\n \t \t \t \t\t\t\t \t \t \t \t \t", "from fractions import gcd\n\ndef lcd(a, b):\n g = gcd(a, b)\n return a*b//g\n\nif __name__ == '__main__':\n x, y, a, b = [int(x) for x in input().split()]\n l = lcd(x, y)\n r = a%l\n if r == 0:\n print((b-a)//l+1)\n else:\n print((b-(a+(l-r)))//l+1)\n", "import math\n\n\ndef common_bricks(x, y, a, b):\n lcm = (x * y) // math.gcd(x, y)\n \n\n common_up_to_b = b // lcm\n\n \n common_up_to_a_minus_1 = (a - 1) // lcm\n \n return common_up_to_b - common_up_to_a_minus_1\n\n# Read input\nx, y, a, b = map(int, input().split())\n\n\nresult = common_bricks(x, y, a, b)\nprint(result)\n \t \t \t\t\t\t\t\t \t\t \t\t\t \t \t\t \t", "import math\r\n\r\n\r\ndef main() -> None:\r\n x, y, a, b = map(int, input().split())\r\n g = x * y // math.gcd(x, y)\r\n print(b // g - (a - 1) // g)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x,y,a,b=map(int,input().split())\r\nfrom math import gcd \r\ndef lcm(a1,b1):\r\n return a1*b1//gcd(a1,b1)\r\nl=lcm(x,y)\r\nprint(b//l-(a-1)//l)", "a, b, x, y = map(int, input().split())\r\nif a > b:\r\n a, b = b, a\r\nn = a*b\r\nwhile b - a > 0 and a*b != 0:\r\n a, b = b, a\r\n a = a % b\r\n#print(b)\r\nn = n // b\r\nprint(y // n - (x - 1) // n)", "def nod (a, b):\r\n a, b = max(a, b), min(a, b);\r\n while (a%b !=0):\r\n a %= b\r\n a, b = b, a\r\n return b\r\nx, y, a, b = map(int, input().split())\r\nr = x*y/nod(x, y)\r\nl = (a + r - 1)//r\r\nri = b//r\r\nprint(max(0, int(ri-l+1)))\r\n \r\n", "x, y, a, b = map(int, input().split())\r\n\r\ndef arch(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\nc = x * y // arch(x, y)\r\nprint(b // c - (a - 1) // c)\r\n", "x,y,a,b=map(int,input().split())\n \nA=1\nwhile A%x or A%y:\n A+=1\nprint(b//A-(a-1)//A)\n\n \t\t \t \t\t \t\t\t \t \t\t\t \t\t", "from math import ceil\r\ndef gcd(a,b):\r\n while b:\r\n a,b=b,a%b\r\n return a\r\na=list(map(int,input().split()))\r\nb=a[0]*a[1]//gcd(a[0],a[1])\r\nprint(int(a[3]/b)-ceil(a[2]/b)+1)\r\n", "def gcd(a,b):\r\n while b:\r\n a,b=b,a%b\r\n return a\r\nx,y,a,b=map(int,input().split())\r\nk=(x*y)//gcd(x,y)\r\nm=int(a%k==0)\r\nprint((b//k)-(a//k)+m)", "x,y,a,b = map(int,input().strip().split())\r\n\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\ndef lcm(a, b):\r\n return (a * b) / gcd(a, b)\r\nj = lcm(x,y)\r\nn1 = a//j + 1\r\nif (n1-1)*j < a:\r\n n1 += 1\r\nn2 = b//j + 1\r\nif (n2-1)*j > b:\r\n n2 -= 1\r\nprint(int(n2 - n1 + 1))", "import math\nx, y, a, b = map(int, input().split())\nlcms = x * y // math.gcd(x, y)\nnum_multiple = (b // lcms) - ((a - 1) // lcms)\nprint(num_multiple)\n\n\t \t \t\t\t\t \t\t\t \t \t\t\t \t\t\t\t \t", "def gcd(x, y):\n\twhile (x>0):\n\t\tif x<y: x, y = y, x\n\t\tx=x%y;\n\treturn y\n\nx, y, a, b = ( int(i) for i in input().split(' ') )\nz=x*y\nif z==0: print(0)\nelse :\n\tz=z//gcd(x, y)\n\ta1=a//z\n\tif a%z !=0: a1=a1+1\n\tb1=b//z\n\tprint (b1-a1+1)\n", "def gcd(a,b):\r\n if b==a:\r\n return a\r\n else:\r\n if a>b:\r\n return gcd(a-b,b)\r\n else:\r\n return gcd(a,b-a)\r\ninpList = input()\r\ninp = inpList.split()\r\nx = int(inp[0])\r\ny = int(inp[1])\r\na = int(inp[2])\r\nb = int(inp[3])\r\n\r\ng = gcd(x,y)\r\nl = (x*y)/g\r\n\r\ncount = int(b/l) - int((a-1)/l)\r\n\r\nprint(count)\r\n", "import math\r\n\r\nx, y, a, b = map(int, input().split(\" \"))\r\ngcd = math.gcd(x, y)\r\nlcs = (x * y) // gcd\r\nprint(b // lcs - (a - 1) // lcs)\r\n", "def gcd(a, b):\r\n c = a % b\r\n return gcd(b, c) if c else b\r\n\r\nx, y, a, b = map(int, input().split())\r\nz = (x * y) // gcd(x, y)\r\nprint(b // z - (a - 1) // z)", "x, y, a, b = map(int, input().split())\r\n\r\n# находим НОК(x, y)\r\ndef lcm(x, y):\r\n from math import gcd\r\n return x*y//gcd(x, y)\r\n\r\nl = lcm(x, y)\r\n\r\n# находим первый кирпич после a, который будет закрашен как красный и розовый одновременно\r\nk = (a-1)//l + 1\r\n\r\n# находим последний кирпич до b, который будет закрашен как красный и розовый одновременно\r\nm = b//l\r\n\r\n# количество кирпичей, которые будут закрашены как красный и розовый одновременно\r\nans = m - k + 1 if m >= k else 0\r\n\r\nprint(ans)", "import math\r\n\r\nx, y, a, b = map(int, input().split())\r\n\r\n# Calculate the least common multiple (LCM) of x and y\r\nlcm = x * y // math.gcd(x, y)\r\n\r\n# Calculate the number of multiples of lcm within [a, b]\r\nnum_multiples = (b // lcm) - ((a - 1) // lcm)\r\n\r\nprint(num_multiples)\r\n", "import math\r\n\r\nx, y, a, b = map(int, input().split())\r\nl = x * y // math.gcd(x, y)\r\nprint(b//l - (a-1)//l)\r\n" ]

[ "\r\n\r\nfrom math import gcd\r\n\r\n\r\ndef LCM(a, b):\r\n if min(a, b) == 0: return max(a, b)\r\n return a // gcd(a, b) * b\r\n\r\n\r\nclass Eqn():\r\n def __init__(self, r, mod):\r\n self.r = r\r\n self.mod = mod\r\n\r\n\r\ndef bye():\r\n print(\"NO\")\r\n exit(0)\r\n\r\n\r\ndef exgcd(a, b):\r\n if b == 0:\r\n return (1, 0)\r\n xp, yp = exgcd(b, a % b)\r\n x = yp\r\n y = xp - a // b * yp\r\n return (x, y)\r\n\r\n\r\ndef merge(a, b):\r\n newmode = LCM(a.mod, b.mod)\r\n if (a.r - b.r) % gcd(a.mod, b.mod) != 0:\r\n bye()\r\n newr = exgcd(a.mod, b.mod)[0] * (b.r - a.r) // gcd(a.mod, b.mod) * a.mod + a.r\r\n newr %= newmode\r\n return Eqn(newr, newmode)\r\n\r\n\r\nx, y = 0, 0\r\nn, m, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n x = LCM(x, i)\r\n if x > n:\r\n bye()\r\ncur = Eqn(0, 1)\r\nfor i in range(0, len(a)):\r\n cur = merge(cur, Eqn((-i) % a[i], a[i]))\r\ny = cur.r\r\n\r\nif y == 0: y += x\r\nfor i in range(0, len(a)):\r\n if gcd(x, y + i) != a[i]:\r\n bye()\r\n\r\nif x > n or y + k - 1 > m: bye()\r\nprint(\"YES\")\r\n", "from sys import stdin\r\nfrom math import gcd\r\n\r\ndef lcm(a,b):\r\n return a*b//gcd(a,b)\r\n\r\ndef exgcd(a,b)->(int,int,int):\r\n if b == 0:\r\n return (a,1,0)\r\n d,x,y = exgcd(b,a%b)\r\n t = x\r\n x = y\r\n y = t - (a//b)*y\r\n return (d,x,y)\r\n\r\ndef cal(v:list)->int:\r\n now = v[0]\r\n for i in range(1,len(v)):\r\n a = now[0]\r\n b = -v[i][0]\r\n c = v[i][1] - now[1]\r\n g,x,y = exgcd(a,b)\r\n x*=c//g\r\n y*=c//g\r\n lc = lcm(a,b)\r\n now = (lc,(a*x+now[1])%lc)\r\n return now[1]\r\n\r\ndef no():\r\n print(\"NO\")\r\n exit(0)\r\ndef yes():\r\n print(\"YES\")\r\n exit(0)\r\n\r\nn,m,k = list(map(int,stdin.readline().split()))\r\na = list(map(int,stdin.readline().split()))\r\nll = a[0]\r\nfor x in a:\r\n ll = lcm(ll,x)\r\n if ll > n:\r\n no()\r\nv = [(x,x-i%x) for i,x in enumerate(a)]\r\nans = cal(v)\r\nans = ans%ll\r\nif ans<=0:ans+=ll\r\nif ans+k-1 > m:\r\n no()\r\nfor i,x in enumerate(a):\r\n if gcd(ll,ans+i)!=x:\r\n no()\r\nyes()", "class problem3_2:\r\n def solution(self):\r\n def hcf(value1, value2):\r\n if value2 == 0:\r\n return value1\r\n return hcf(value2, value1 % value2)\r\n\r\n def extend_euclid(a, b):\r\n if b == 0:\r\n return 1, 0\r\n else:\r\n y, x = extend_euclid(b, a % b)\r\n y = y - (a // b) * x\r\n return x, y\r\n\r\n n, m, k = map(int, input().split())\r\n inputList1 = list(map(int, input().split()))\r\n\r\n lcm_variable = 1\r\n for i in inputList1:\r\n lcm_variable = (lcm_variable * i) // hcf(lcm_variable, i)\r\n if lcm_variable > n:\r\n print('NO')\r\n exit()\r\n j = 0\r\n m1_variable = 1\r\n flag = True\r\n i = 0\r\n while i < k:\r\n x, y = extend_euclid(m1_variable, inputList1[i])\r\n result = m1_variable * x + inputList1[i] * y\r\n if (-i - j) % result != 0:\r\n flag = False\r\n break\r\n result = (-i - j) // result\r\n x, y = x * result, y * result\r\n j += m1_variable * x\r\n t = m1_variable * inputList1[i]\r\n if j > t:\r\n j -= (j // t) * t\r\n if j < 0:\r\n j += ((-j + t - 1) // t) * t\r\n if j == 0:\r\n j = t\r\n m1_variable = (m1_variable * inputList1[i]) // hcf(m1_variable, inputList1[i])\r\n i += 1\r\n\r\n if j + k - 1 > m or flag == False:\r\n print('NO')\r\n exit()\r\n list2 = [hcf(lcm_variable, j + i) for i in range(k)]\r\n\r\n i = 0\r\n while i < k:\r\n if (inputList1[i] != list2[i]):\r\n print('NO')\r\n exit()\r\n i += 1\r\n print('YES')\r\n\r\nobject = problem3_2()\r\nobject.solution()", "def gcd(a,b):\r\n if b == 0:\r\n return a \r\n return gcd(b, a%b) \r\ndef extend_euclid(a,b):\r\n if b == 0:\r\n return 1,0 \r\n else:\r\n y,x = extend_euclid(b, a%b)\r\n y = y - (a//b)*x\r\n return x,y \r\n \r\nn,m,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n \r\nlcm = 1\r\nfor i in a:\r\n lcm = (lcm*i)//gcd(lcm, i)\r\n if lcm>n:\r\n print('NO')\r\n exit()\r\nj = 0\r\nm1 = 1\r\ns = True\r\nfor i in range(k):\r\n x,y = extend_euclid(m1, a[i])\r\n res = m1*x + a[i]*y \r\n if (-i-j)%res != 0:\r\n s = False\r\n break\r\n res = (-i-j)//res \r\n x,y = x*res , y*res \r\n j += m1*x \r\n t = m1*a[i]\r\n if j>t:\r\n j -= (j//t)*t \r\n if j<0:\r\n j += ((-j+t-1)//t)*t \r\n if j == 0:\r\n j = t \r\n m1 = (m1*a[i])//gcd(m1, a[i])\r\n \r\nif j+k-1 >m or s == False:\r\n print('NO')\r\n exit()\r\nb = [gcd(lcm, j+i) for i in range(k)]\r\nfor i in range(k):\r\n if (a[i] != b[i]):\r\n print('NO')\r\n exit()\r\nprint('YES')", "from math import gcd\r\n \r\ndef lcm(a, b):\r\n if min(a, b) == 0: return max(a, b)\r\n return a // gcd(a, b) * b \r\n \r\nclass equation():\r\n def __init__(self, r, mod):\r\n self.r = r\r\n self.mod = mod\r\n \r\n \r\ndef goodBye():\r\n print(\"NO\")\r\n exit(0)\r\n \r\ndef exgcd(a,b):\r\n if b == 0:\r\n return (1,0)\r\n xp,yp = exgcd(b,a % b)\r\n x = yp\r\n y = xp-a // b * yp\r\n return (x,y)\r\n\r\ndef merge(a, b):\r\n newmode = lcm(a.mod,b.mod)\r\n if (a.r-b.r)%gcd(a.mod,b.mod)!=0:\r\n goodBye()\r\n newr = exgcd(a.mod,b.mod)[0]*(b.r-a.r)//gcd(a.mod,b.mod)*a.mod+a.r\r\n newr%=newmode\r\n return equation(newr,newmode)\r\n \r\nx, y = 0, 0\r\nn, m, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n x = lcm(x, i)\r\n if x>n:\r\n goodBye()\r\ncur = equation(0, 1)\r\nfor i in range(0, len(a)):\r\n cur = merge(cur, equation((-i) % a[i], a[i]))\r\ny = cur.r\r\n \r\nif y == 0: y += x\r\nfor i in range(0, len(a)):\r\n if gcd(x, y + i) != a[i]:\r\n goodBye()\r\n \r\nif x > n or y + k - 1 > m: goodBye()\r\nprint(\"YES\")", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef extend_euclid(a, b):\r\n if b == 0:\r\n return 1, 0\r\n else:\r\n y, x = extend_euclid(b, a % b)\r\n y = y - (a // b) * x\r\n return x, y\r\n\r\n\r\nn, m, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nlcm = 1\r\nfor i in a:\r\n lcm = (lcm * i) // gcd(lcm, i)\r\n if lcm > n:\r\n print('NO')\r\n exit()\r\nj = 0\r\nm1 = 1\r\ns = True\r\nfor i in range(k):\r\n x, y = extend_euclid(m1, a[i])\r\n res = m1 * x + a[i] * y\r\n if (-i - j) % res != 0:\r\n s = False\r\n break\r\n res = (-i - j) // res\r\n x, y = x * res, y * res\r\n j += m1 * x\r\n t = m1 * a[i]\r\n if j > t:\r\n j -= (j // t) * t\r\n if j < 0:\r\n j += ((-j + t - 1) // t) * t\r\n if j == 0:\r\n j = t\r\n m1 = (m1 * a[i]) // gcd(m1, a[i])\r\n\r\nif j + k - 1 > m or s == False:\r\n print('NO')\r\n exit()\r\nb = [gcd(lcm, j + i) for i in range(k)]\r\nfor i in range(k):\r\n if (a[i] != b[i]):\r\n print('NO')\r\n exit()\r\nprint('YES')" ]

[ "a,b = list(map(int,input().split()))\r\nans = 0\r\nwhile True:\r\n if b>a:\r\n a,b = b,a\r\n if a%b==0:\r\n ans+=a//b\r\n break\r\n else:\r\n ans+=a//b\r\n a = a%b\r\nprint(ans)", "a, b = [int(i) for i in input().split()]\r\nq = a//b\r\nans = q\r\nwhile (a - q*b != 0):\r\n x = a - q*b\r\n a = b\r\n b = x\r\n q = a//b\r\n ans += q\r\nprint(ans)\r\n ", "n,m= map(int,input().split())\r\nans =0\r\nwhile n%m>0:\r\n c = n\r\n d = m\r\n ans = ans +n//m\r\n n = max(c%d,d)\r\n m = min(c%d,d)\r\nprint(ans+n//m)\r\n", "a, b = map(int, input().split())\r\nans = 0\r\nwhile a != b:\r\n a, b = max(a, b), min(a, b)\r\n if b == 0:\r\n break\r\n ans += a // b\r\n a %= b\r\nprint(ans)\r\n", "def solver(a, b):\r\n resp = 0\r\n\r\n while b != 0:\r\n resp += a//b\r\n aux = a\r\n a = b\r\n b = aux % b\r\n \r\n return resp\r\n\r\na, b = list(map(int, input().split()))\r\nprint(solver(a, b))", "import math, os, sys\r\nimport string, re\r\nimport itertools, functools, operator\r\nfrom collections import Counter\r\n\r\ndef inputint():\r\n return int(input())\r\n\r\ndef inputarray(func=int):\r\n return map(func, input().split())\r\n\r\n\r\na, b = inputarray()\r\n\r\ndef ans(a, b):\r\n if a == b:\r\n return 1\r\n elif b == 0:\r\n return 0\r\n else:\r\n return a//b + ans(b, a%b)\r\n\r\nprint(ans(a, b))\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/527/A\r\n# originally implemented with recursive function made below, but exceeded recursion depth.\r\n'''\r\ndef get_ship_count(a, b):\r\n if a == b:\r\n return 1\r\n if a - b > b:\r\n return 1 + get_ship_count(a - b, b)\r\n else:\r\n return 1 + get_ship_count(b, a - b)\r\n'''\r\n\r\na, b = map(int, input().split())\r\n\r\nt = 0\r\nwhile b != 0:\r\n t += a // b\r\n h = a % b\r\n a = b\r\n b = h\r\n\r\nprint(t)", "raw = str(input()).split()\r\na = int(raw[0])\r\nb = int(raw[1])\r\nc = 0\r\n\r\nwhile(a != 0 and b != 0):\r\n if (a > b):\r\n c += int(a/b)\r\n a = a % b\r\n else:\r\n c += int(b/a)\r\n b = b % a\r\n\r\nprint(c)\r\n\r\n", "a , b = map(int , input().split())\r\nans = 0\r\nwhile b>0:\r\n n = a//b\r\n temp = b\r\n b = a-(n*b)\r\n a = temp\r\n ans += n\r\nprint(ans)", "a, b = [int(x) for x in input().split()]\r\npieces = int(a/b)\r\na -= b * pieces\r\nc = a\r\nwhile c != 0:\r\n a = b\r\n b = c\r\n pieces += int(a/b)\r\n c = a % b\r\nprint(pieces)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\ndef gcd(x, y):\r\n return x//y + gcd(y, x%y) if y else 0\r\na = list(map(int, input().split(' ')))\r\nprint(gcd(a[0], a[1]))\r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\n# mem=dict()\r\n# mem.setdefault(1, 1)\r\n# mem.setdefault(2, 1)\r\n# def fib(a):\r\n# if not mem.get(a): mem.setdefault(a, fib(a-1) + fib(a-2))\r\n# return mem[a]\r\n\r\na,b = map(lambda v: int(v), input().split())\r\n\r\ni=1\r\nwhile a!=b and a*b>0:\r\n if a>b:\r\n i += a // b\r\n a-=a//b*b\r\n else:\r\n i += b // a\r\n b-=b//a*a\r\n\r\nprint(i-1)\r\n\r\n\r\n\r\n\r\n", "a,b = [int(x) for x in input().split()]\r\nans = 0\r\n\r\nwhile a > 0 and b > 0:\r\n if a >= b:\r\n ans += int(a/b)\r\n a = a%b\r\n else:\r\n ans += int(b/a)\r\n b = b%a\r\n\r\nprint(ans)", "ab = [int(x) for x in input().split()]\r\na = ab[0]\r\nb = ab[1]\r\ncount = 0\r\nwhile (a!=b and a!=0 and b!=0):\r\n if a>b:\r\n count+=int(a/b)\r\n a-=b*int(a/b)\r\n else:\r\n count+=int(b/a)\r\n b-=a*int(b/a)\r\nif a==b:\r\n count+=1\r\nprint(count)", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2018-10-17 19:41:42\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\na, b = sorted(read_ints())\r\ncnt = 0\r\nwhile b:\r\n cnt += a // b\r\n a, b = b, a % b\r\nprint(cnt)\r\n\r\n", "def main():\r\n a, b = map(int, input().split())\r\n result = 0\r\n\r\n while a != b:\r\n if a >= b:\r\n result += a//b\r\n a = a%b\r\n else:\r\n result += b//a\r\n b = b%a\r\n if a*b == 0:\r\n break\r\n print(result)\r\n\r\nmain()", "# Problem 527A\n# Playing with Paper\n\ndim = list(map(int, input().split(\" \")))\nlength = dim[0]\nbreadth = dim[1]\nno_of_ships = 0\n\nwhile (length - breadth) > 0:\n no_of_ships += length // breadth\n length -= (breadth * (length // breadth))\n if (length > 0) and (length < breadth):\n temp = breadth\n breadth = length\n length = temp\n\nprint(no_of_ships)\n", "# You lost the game.\nfrom math import *\na,b = map(int, input().split())\nr = 0\nwhile a > b:\n s = a//b-(a%b == 0)\n r += s\n e = a\n a = b\n b = e - s*b\n \nprint(r+1)\n", "#!/usr/bin/env python3\n\na, b = map(int, input().split())\n\nstep = 0\nwhile a > b:\n x = (a -1) // b\n step += x\n a, b = max(a - b *(x), b), min(a - b * (x), b)\nprint(step + 1)\n\n", "import sys\r\nfrom collections import *\r\nimport math\r\ninput = sys.stdin.readline\r\na,b = [int(x) for x in input().split()]\r\nres = 0\r\nwhile a!=0 and b!=0:\r\n if a<b:\r\n a,b = b,a\r\n x = a//b\r\n a-=b*x\r\n res+=x\r\nprint(res)", "a = input(\"\").split(\" \")\nb = int(a[0])\nc = int(a[1])\nans = 0\nwhile b!=0 and c!=0:\n e = max(b, c)\n f = min(b, c)\n ans = ans + int(e/f)\n e = e-int(e/f)*f\n b = e\n c = f\nprint(ans)\n \n", "import sys\r\n\r\nif __name__ == '__main__':\r\n a,b = map(int,input().split())\r\n if a < b:\r\n sys.exit(0)\r\n result = 0\r\n while b > 0:\r\n result += a//b\r\n a %= b\r\n if a < b:\r\n a,b = b,a\r\n print(result)", "a,b=map(int,input().split())\r\ncount=0\r\nwhile b>1:\r\n\tt=a%b\r\n\tcount+=a//b\r\n\ta=b\r\n\tb=t\r\nif b!=0:\r\n #because now b will be 1 for sure\r\n #bcz it is not zero and it is less than 1\r\n #so we can have a//b=a//1=a more sails\r\n\tprint(count+a)\r\nelse:\r\n\tprint(count)\r\n\t\r\n\t\r\n'''\r\nthis wont work bitch!!\r\ndont be naive\r\nwhile a > 0 and b > 0:\r\n if a ⩾ b:\r\n a = a - b\r\n else:\r\n b = b - a\r\n ans = ans + 1\r\n'''", "def f(a,b):\r\n\tc=0\r\n\twhile b!=0:\r\n\t\t# print(a,b)\r\n\t\tc+=a//b\r\n\t\ta,b=b,a%b\r\n\treturn c\r\na,b=map(int,input().split())\r\nprint(f(a,b))", "dlug, szer = (int(i) for i in input().split())\r\n\r\nwyn = 1\r\nwhile dlug != szer:\r\n # print(dlug, szer, wyn)\r\n if dlug > szer: \r\n # print(1, (szer // dlug if szer % dlug != 0 else szer // dlug - 1))\r\n wyn += (dlug // szer if dlug % szer != 0 else dlug // szer - 1)\r\n dlug -= (dlug // szer if dlug % szer != 0 else dlug // szer - 1) * szer\r\n else:\r\n # print(2, (szer // dlug if szer % dlug != 0 else szer // dlug - 1))\r\n wyn += (szer // dlug if szer % dlug != 0 else szer // dlug - 1)\r\n szer -= (szer // dlug if szer % dlug != 0 else szer // dlug - 1) * dlug\r\n\r\nprint(wyn)", "a,b=map(int,input().split())\r\ncount=0\r\nwhile b>1:\r\n\tt=a%b\r\n\tcount+=a//b\r\n\ta=b\r\n\tb=t\r\nif b!=0:\r\n\tprint(count+a)\r\nelse:\r\n\tprint(count)", "def calc(x, y, ans=0):\n\tif y == 0:\n\t\treturn ans\n\telse:\n\t\tans += x // y\n\t\treturn calc(y, x % y, ans)\n\n\na, b = map(int, input().split())\nprint(calc(a, b))\n", "a, b, i = *map(int, input().split()), 0\r\nwhile b != 0:\r\n b, a, i = *sorted([a % b, b]), i + a // b\r\nprint(i)\r\n", "a, b = [int(i) for i in input().split()]\r\nc = 0\r\nk = max(a, b)\r\nl = min(a, b)\r\nwhile k % l != 0:\r\n c += k // l\r\n k, l = l, k % l\r\nc += k // l\r\nprint(c)", "a, b = [int(i) for i in input().split()]\r\na, b = min(a, b), max(a, b)\r\nans = 0\r\nwhile (a > 0):\r\n ans += b // a\r\n a, b = b % a, a\r\nprint(ans)", "def solve(a,b):\r\n ans=0\r\n while True:\r\n if a==1 or b==1 :\r\n ans+=max(a,b)\r\n break\r\n if a==0 or b==0:\r\n break\r\n w=a\r\n z=b\r\n ans+=w//z \r\n b=w%z \r\n a=z\r\n # print(a,b,ans)\r\n return ans\r\nimport sys\r\na,b=map(int, sys.stdin.readline().split())\r\nans=solve(a,b)\r\nprint(ans)", "x,y =map(int, input().split())\r\ncount1 = 0\r\nwhile min(x,y)>0:\r\n\t(x,y) = (max(x,y), min(x,y))\r\n\tcount1 += x//y\r\n\tx = x%y\r\n\r\nprint(count1)\r\n", "import os\n\nx,y = input().split()\nx = int(x)\ny = int(y)\nans = 0\nwhile x > 0 and y > 0:\n\tif x > y:\n\t\tans += int(x / y)\n\t\tx = x % y;\n\telse:\n\t\tans += int(y / x);\n\t\ty = y % x\n\nprint(ans)\n", "(a, b) = map(int, input().split())\r\n\r\nc = 0\r\n\r\ndef this_mfin_recursive_function(a, b):\r\n if b != 0:\r\n global c\r\n c += a//b\r\n this_mfin_recursive_function(b, a%b)\r\n\r\nthis_mfin_recursive_function(a, b)\r\nprint(c)", "def c(a,b):\r\n return a and b and b//a+c(b%a,a)\r\na,b=[int(x) for x in input().split()]\r\nprint(c(a,b))", "a,b = map(int,input().split())\r\ncnt_s = 0\r\nwhile a>0 and b>0:\r\n #print(a,b)\r\n cnt_s += a//b\r\n a_0 = a\r\n a = b\r\n b = a_0- (b*(a_0//b))\r\n \r\nprint(cnt_s)", "(a,b) = list(int(x) for x in input().split())\r\nif a<b:\r\n a,b = b,a\r\nk = 0\r\nwhile(a!=0 and b!=0):\r\n k+=a//b\r\n a = a%b\r\n a,b = b,a\r\nprint(k)", "a,b=map(int,input().split());s=0\nwhile a!=b:\n\ta,b=sorted((a,b));s+=b//a\n\tif b%a==0:break\n\tb-=b//a*a\nprint(s)\n\n", "import sys\r\nimport math\r\n\r\na, b = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nres = 0\r\nwhile(True):\r\n v = int(a / b)\r\n k = a % b\r\n res += v\r\n if(k == 0):\r\n print(res)\r\n exit()\r\n else:\r\n a = b\r\n b = k\r\n \r\n\r\n", "a,b=[int(i) for i in input().split()]\r\nt=0\r\nwhile b!=0:\r\n t=t+a//b\r\n h=a%b\r\n a=b\r\n b=h\r\nprint(t)\r\n", "# 527A\r\n\r\n__author__ = 'artyom'\r\n\r\na, b = sorted(map(int, input().split()))\r\nc = 1\r\nwhile b > a:\r\n d = b - a\r\n r = d // a\r\n if d % a > 0:\r\n r += 1\r\n c += r\r\n a, b = b - r * a, a\r\nprint(c)", "def gcd(x, y): return 0 if y == 0 else x // y + gcd(y, x % y)\r\nx, y = list(map(int, input().split()))\r\nprint(gcd(x, y))\r\n", "a,b=map(int,input().split())\r\nans=0\r\na,b=max(a,b),min(a,b)\r\nwhile b!=0:\r\n ans+=a//b\r\n a,b=b,a%b\r\nprint(ans)", "a, b = [int(i) for i in input().split()]\ncont = 0\nwhile a > 0 and b > 0:\n if a > b:\n r = a//b\n a -= r*b\n else:\n r = b//a\n b -= r*a\n cont += r\nprint(cont)\n \t\t \t \t \t \t \t \t\t \t \t\t\t", "a, b = map(int, input().split())\r\ntotal = 0\r\n\r\nwhile a != 0 and b != 0:\r\n a , b = min(a, b), max(a, b)\r\n total += b // a\r\n b = b % a\r\n\r\nprint(total)\r\n\r\n", "a,b = map(int,input().split())\r\nk = 0\r\nwhile b > 0:\r\n k += a // b\r\n a, b= b, a % b\r\nprint(k)", "import sys\r\nn,m = map(int,input().split(' '))\r\n\r\nanswer = 0\r\nif n==1 or m==1 :\r\n print(n*m)\r\n sys.exit(0)\r\nwhile n>0 and m>0 :\r\n if n>m :\r\n answer+= int(n/m)\r\n n %=m\r\n else :\r\n answer += int(m/n)\r\n m %=n\r\nprint(answer)\r\n", "def main():\r\n a, b = (int(i) for i in input().split())\r\n n = 0\r\n\r\n while a % b:\r\n n += a // b\r\n a, b = b, a % b\r\n n += a // b\r\n print(n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b = map(int, input().split())\nv = 1\nwhile a != b:\n c = (a - 1) // b\n a, b, v = b, a - b * c, v + c\nprint(v)\n", "a,b = map(int, input().split())\r\nsteps = 0\r\nwhile a!=b and b>0:\r\n div = a//b\r\n a -= b*(div)\r\n a,b = max(b, a),min(b, a)\r\n steps+= div\r\nprint (steps)", "def main():\r\n a, b = map(int, input().split())\r\n count = 0\r\n mx = max(a,b)\r\n while a:\r\n if a < b:\r\n a,b=b,a\r\n less = a // b\r\n count += less\r\n a -= b*less\r\n print(count)\r\nif __name__ == '__main__':\r\n main()\r\n", "a, b = (int(x) for x in input().split())\nans = 0\nwhile a * b != 0:\n tmp = a // b\n ans += tmp\n a -= tmp * b\n if a < b:\n a, b = b, a\nprint(ans)\n", "a,b = input().split()\na,b = int(a),int(b)\nn = 0\ncount = 0\nwhile a != 1 and b != 1:\n if a==b:\n n=1\n count =count+1\n break\n elif a>b:\n \n count = count +int(a/b)\n a = a%b\n if a == 0:\n break\n elif a<b:\n \n count = count +int(b/a)\n b = b%a\n if b ==0:\n break\nif n == 1:\n print(count)\nelse:\n print(count + a*b)\n\n", "read = lambda: map(int, input().split())\r\na, b = read()\r\ncnt = 0\r\nwhile b:\r\n cnt += a // b\r\n a, b = b, a % b\r\nprint(cnt)\r\n", "import sys\n\nif 'PyPy' in sys.version:\n from _continuation import continulet\nelse:\n import threading\n\n\ndef solve(a, b):\n a, b = sorted([a, b])\n if a == 0:\n return 0\n if a == 1:\n return b\n return b//a+solve(*sorted([a, b % a]))\n\n\ndef main():\n print(solve(*tuple(map(int, input().split()))))\n pass\n\n\nif __name__ == '__main__':\n if 'PyPy' in sys.version:\n\n def bootstrap(cont):\n call, arg = cont.switch()\n while True:\n call, arg = cont.switch(to=continulet(\n lambda _, f, args: f(*args), call, arg))\n\n cont = continulet(bootstrap)\n cont.switch()\n\n main()\n\n else:\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", "a, b = [int(x) for x in input().split()]\n\nif a > b: \n a, b = b, a\ncnt = 0\nwhile a != 0:\n if a > b: \n a, b = b, a\n if a == 0: break\n cnt += int(b/a);\n a, b = a, b%a\n\nprint(cnt)\n \n", "a,b=map(int,input().split())\r\nn=0\r\nwhile a>0 and b>0:\r\n\tif a>b:\r\n\t\tn+=a//b\r\n\t\ta=a%b\r\n\telse:\r\n\t\tn+=b//a\r\n\t\tb=b%a\r\nprint(n)\r\n", "wynik = 0\r\ndef kwadrat(a,b):\r\n global wynik\r\n if b == 0:\r\n return\r\n else:\r\n wynik += a // b\r\n kwadrat(b,a%b)\r\n\r\na,b = map(int,input().split())\r\nkwadrat(a,b)\r\nprint(wynik)", "def gcd(pair):\r\n a, b = pair\r\n answer = 0\r\n while b != 0:\r\n answer += a // b\r\n a, b = b, a % b\r\n return answer\r\n\r\nprint(gcd([int(next) for next in input().split()]))", "a, b = map(int, input().split())\r\ncount = 0\r\nwhile a != b and a != 0 and b != 0:\r\n if a > b:\r\n count += (a//b)\r\n a = a%b\r\n elif b > a:\r\n count += (b//a)\r\n b = b%a\r\nprint(count)", "a,b = map(int,input().split())\r\nresult = 0\r\nwhile b > 0:\r\n result += a//b\r\n a %= b\r\n if b > a:\r\n a,b = b,a\r\nprint(result)", "a,b=list(map(int,input().split()))\ncount=0\nwhile a!=0 and b!=0 :\n if a<=b:\n count+=b//a\n b=b%a\n else:\n count+=a//b\n a=a%b\nprint(count) \n \n # div=min(a,b)\n # =max(a,b)-div", "from copy import copy\r\na, b = map(int, input().split())\r\ncnt = 0\r\nwhile a>0 and b>0:\r\n #print(a, b)\r\n na = copy(b)\r\n cnt += a // b\r\n nb = a % b\r\n \r\n a = max(na, nb)\r\n b = min(na, nb)\r\nprint(cnt)\r\n", "a,b=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nans=0\r\nif(a%b==0):\r\n print(int(a/b))\r\nelse:\r\n while(a!=0 and b!=0):\r\n if(a>b):\r\n ans+=int(a/b)\r\n a=a%b\r\n else:\r\n ans+=int(b/a)\r\n b=b%a\r\n print(ans)\r\n", "a,b=[int(i) for i in input().split()]\r\n\r\nk=0\r\n\r\nwhile a!=0 and b!=0:\r\n if a>b:\r\n k=k+a//b\r\n a=a%b\r\n else:\r\n k=k+b//a\r\n b=b%a\r\n \r\nprint(k)\r\n", "a, b = map(int, input().split())\r\n\r\nans = 0 \r\nwhile True:\r\n if a == 0 or b == 0:\r\n break\r\n\r\n if a < b:\r\n a,b = b, a\r\n\r\n ans += a//b\r\n a = a % b\r\n\r\nprint(ans)", "a,b=map(int, input().split())\r\nk=0\r\nwhile (a!=0) and (b!=0):\r\n if (a>b):\r\n x=(a//b)\r\n a-=x*b\r\n k+=x\r\n else:\r\n x=(b//a)\r\n b-=x*a\r\n k+=x\r\nprint(k)", "a, b = tuple(map(int, input().split(' ')))\r\n\r\nships = 0\r\nwhile a != b and a > 0 and b > 0:\r\n resp = a // b\r\n a = a % b\r\n if b > a:\r\n a, b = b, a\r\n\r\n ships += resp\r\n\r\nprint(ships)\r\n", "a, b = map(int, input().split())\r\nnum = 0\r\n\r\nwhile a*b != 0:\r\n a, b = sorted([a, b])\r\n num += b//a\r\n b = b%a\r\n \r\nprint(int(num))", "a,b = map(int,input().split())\r\nnum = 0\r\nwhile not 0 in {a,b}:\r\n if a > b:\r\n num += a // b\r\n a %= b\r\n else:\r\n num += b // a\r\n b %= a\r\nprint(num)", "s=[int(n) for n in input().split()]\r\na=max(s)\r\nb=min(s)\r\nif a%b==0:\r\n\tprint(a//b)\r\nelse:\r\n\tl=0\r\n\twhile 1:\r\n\t\tl+=a//b\r\n\t\td=a%b\r\n\t\tg=b\r\n\t\th=d\r\n\t\ta=max(g,h)\r\n\t\tb=min(g,h)\r\n\t\tif d==0:\r\n\t\t\tbreak\r\n\tprint(l)", "a, b = [int(s) for s in input().split(' ')]\r\nres = 0\r\nwhile a * b > 0:\r\n res += a // b\r\n a %= b\r\n a, b = b, a\r\nprint(res)\r\n", "def sp(w, h):\n if w < h:\n w, h = h, w\n if h == 0:\n return 0\n return w//h + sp(h, w%h)\n\n\n[a, b] = list(map(int, input().split(\" \")))\nprint(sp(a,b))\n", "'''input\n100000 1\n'''\na, b = map(int, input().split())\nt = 0\nwhile a != b and a > 0 and b > 0:\n\tif a > b:\n\t\tt += a//b\n\t\ta %= b\n\telse:\n\t\tt += b//a\n\t\tb %= a\nprint(t)\n\n\n\n\n\n", "Count = 0\r\nA, B = map(int, input().split())\r\nwhile 0 not in [A, B]:\r\n A, B = max(A, B), min(A, B)\r\n if B <= A - B:\r\n Count += (A // B)\r\n A = A % B\r\n else:\r\n A = A - B\r\n Count += 1\r\nprint(Count)\r\n\r\n# UB_CodeForces\r\n# Advice: Do what is Right, not what is easy\r\n# Location: Behind my desk at my own room\r\n# Caption: Busy with TOEFL preparation, and also stuck with math tags\r\n# CodeNumber: 516\r\n", "a,b = map(int,input().split());cnt=0\r\nwhile b: cnt+=a//b;a,b=b,a%b\r\nprint(cnt)", "n,m = map(int,input().split())\r\ns = 0\r\nwhile ((n > 0) and (m > 0)):\r\n if (n > m):\r\n s = s + (n // m)\r\n n = n % m\r\n else:\r\n s = s + (m // n)\r\n m = m % n\r\nprint(s)", "A = input()\r\nA = list(map(int , A.split(' ')))\r\na = A[0]\r\nb = A[1]\r\ncont = 0\r\nwhile a != b:\r\n\tmini = min(a,b)\r\n\tmaxi = max(a,b)\r\n\tcont = cont + maxi//mini\r\n\ta = mini\r\n\tb = maxi%mini\r\n\tif b == 0:\r\n\t\tbreak\r\nif b != 0:\r\n\tcont = cont +1\r\nprint(cont)", "a,b=map(int,input().split())\r\n\r\nres=0\r\n\r\nwhile a>0 and b>0:\r\n if a>=b:\r\n res+=(a//b)\r\n a%=b\r\n else:\r\n res+=(b//a)\r\n b%=a\r\n\r\nprint(res)", "x,y = map(int,input().split())\r\noutput = 0\r\nwhile min(x,y) != 0:\r\n r = x // y\r\n output += r\r\n x -= r*y\r\n x,y = max(x,y),min(x,y)\r\nprint(output)", "a,b = map(int,input().split())\r\ncount = 0\r\nwhile a%b!=0:\r\n count += a//b\r\n a,b = b,a%b\r\ncount += a//b\r\nprint(count)\r\n", "def main():\n\tA, B = input().split()\n\tA = int(A)\n\tB = int(B)\n\tqtd = 0\n\twhile(A!= 0 and B!= 0):\n\t\tif(A > B):\n\t\t\tqtd += A//B\n\t\t\tA %= B\n\t\telse:\n\t\t\tqtd += B//A\n\t\t\tB %= A\n\tprint(qtd)\n\nmain()\n\n# 1504288459032\n", "a,b=map(int,input().split())\r\nn=0\r\n\r\nwhile b!=0:\r\n n+=int(a/b)\r\n temp=a\r\n a=b\r\n b=temp%b\r\n\r\nprint(n)", "\n# coding: utf-8\n\n# In[1]:\n\n\n[a,b] = list(map(int, input().rstrip().split()))\n\ntik = 0\nwhile a:\n\tif a<b:\n\t\ta,b = b,a\n\ttik += a//b\n\ta = a%b\n\nprint(tik)\n\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nans = a//b\r\nrem = a%b\r\nwhile(rem!=0):\r\n a = b\r\n b = rem\r\n ans += a//b\r\n rem = a%b\r\nprint(ans)\r\n", "a, b = map(int, input().split())\n\ni = 0\nwhile True:\n i += a // b\n a = a % b\n if a < b:\n t = a\n a = b\n b = t\n if (a == 0 or b == 0):\n break\n\nprint(i)\n\n\n", "count = 0\r\na, b = list(map(int, input().split(\" \")))\r\nwhile a > 0 and b > 0:\r\n count += a//b\r\n x = b\r\n b = a % b\r\n a = x\r\nprint(count)", "a, b = map(int, input().split())\r\ncount = 0\r\nwhile (a>0 and b>0):\r\n temp = b\r\n count += int(a/b)\r\n b = a - b*int(a/b)\r\n a = temp\r\nprint(count)\r\n", "a,b = map(int, input().split())\r\ns = 0\r\nwhile a > 0 and b > 0 and a!= b:\r\n s += a//b\r\n a ,b = b, a%b\r\n \r\nprint(s)", "\"\"\"\nBrandt Smith, Lemuel Gorion and Peter Haddad\n\ncodeforces.com\n\nProblem 527A\n\"\"\"\nimport sys\n\na, b = map(int, input().split(' '))\ncount = 0\n\nwhile a > 0 and b > 0:\n if a > b:\n count += a // b\n a = a % b\n else:\n count += b // a\n b = b % a\n\n \n\nprint(count)\n", "a, b = (int(x) for x in input().split())\r\n\r\nk = 0\r\nwhile a != b and a > 0 and b > 0:\r\n #print(a, b)\r\n k += a // b\r\n a, b = reversed(sorted((b, a % b)))\r\n\r\nprint(k)\r\n", "\r\n\r\ndef main_function():\r\n a, b = [int(i) for i in input().split(\" \")]\r\n counter = 0\r\n while True:\r\n a, b = sorted([a, b], reverse=True)\r\n if a % b == 0:\r\n counter += a // b\r\n break\r\n else:\r\n ratio = a // b\r\n counter += ratio\r\n a = a - b * ratio\r\n print(counter)\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n", "a, b = input(\"\").split()\r\na=int(a)\r\nb=int(b)\r\nans=0\r\nwhile b:\r\n ans+=a//b\r\n a,b=b,a%b\r\nprint(int(ans))\r\n", "a,b=map(int,input().split())\r\nk = 0\r\nwhile b:\r\n\tk+=a//b\r\n\ta,b =b,a%b\r\nprint(k)", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nHomura = [int(i) for i in input().split()]\r\na = Homura[0]\r\nb = Homura[1]\r\n\r\nans = 0\r\nwhile a*b > 0:\r\n\tif a >= b:\r\n\t\tans += a//b\r\n\t\ta = a%b\r\n\telse:\r\n\t\tans += b//a\r\n\t\tb = b%a\r\n\r\nprint(ans)\r\n", "a,b=map(int,input().split());k=0\r\nwhile b:k+=a//b;a,b=b,a%b\r\nprint(k)", "a, b = map(int, input().split())\ncnt = 0\n\nif a < b:\n\ta, b = b, a\n\nwhile a > 0 and b > 0 and a != b:\n\tcnt += a // b\n\ta, b = b, a % b\n\nprint(cnt)\n", "def f(a,b):\r\n if(a<b):\r\n return f(b,a)\r\n if(a%b==0):\r\n return a//b\r\n return f(b,a%b) + a//b\r\n \r\na,b = map(int,input().split())\r\nprint(f(a,b))\r\n", "a, b = map(int, input().strip().split())\n# a, b = 78945612378, 212\nc = 0\nwhile True:\n\tif a < b:\n\t\ta, b = b, a\n\tif a%b == 0:\n\t\tprint(c+(a//b))\n\t\tbreak\n\tif a == b:\n\t\tprint(c+1)\n\t\tbreak\n\tc += a//b\n\ta = a%b\n", "a,b=map(int,input().split())\r\nc=0\r\nwhile b:c+=a//b;a,b=b,a%b\r\nprint(c)\r\n", "import math\r\n\r\na,b = map(int,input().split(\" \"))\r\n#b = int(input())\r\nc = 0\r\nr = 1\r\nwhile (r != 0):\r\n c = c + math.floor(a/b)\r\n r = a % b\r\n a = b\r\n b = r\r\n\r\nprint(c)", "a,b=[int(e) for e in input().split()]\r\nc=0\r\nwhile min(a,b):\r\n if b>a:\r\n a,b=b,a\r\n c+=a//b\r\n a%=b\r\nprint(c)", "def paper(c, d):\r\n count = 0\r\n while d != 0:\r\n count += c // d\r\n c, d = d, c % d\r\n return count\r\n\r\n\r\na, b = [int(i) for i in input().split()]\r\nprint(paper(a, b))\r\n", "#!/usr/bin/env python3\n\"\"\"\nCodeforces\n527 A. Playing with Paper\n\n@author yamaton\n@date 2015-08-04\n\"\"\"\n\n\ndef solve(a, b):\n cnt = 0\n while b > 0:\n cnt += a // b \n a, b = b, a % b\n return cnt\n\n\ndef main():\n [a, b] = [int(i) for i in input().strip().split()]\n result = solve(a, b)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "def f(a,b):\r\n if a*b == 0:\r\n return 0\r\n if a < b:\r\n a,b = b,a\r\n return f(a%b,b)+a//b\r\na,b = map(int,input().split())\r\nprint(f(a,b))", "a,b=map(int,input().split())\r\nk=0\r\nwhile a!=0 and b!=0:\r\n if(a>=2*b):\r\n k+=(a-a%b)/b\r\n a=a%b\r\n elif(b>=2*a):\r\n k+=(b-b%a)/a\r\n b=b%a\r\n elif(a>b):\r\n k+=1\r\n a-=b\r\n elif(b>a):\r\n k+=1\r\n b-=a\r\nprint(round(k))", "def helper(a,b):\r\n\ttot=0\r\n\twhile a!=b and a>0 and b>0:\r\n\t\t# print(a,b)\r\n\t\tif b>a:\r\n\t\t\ta,b=b,a\r\n\t\ttot+=a//b\r\n\t\ta=a-((a//b)*b)\r\n\tif a!=0:\r\n\t\ttot+=1\r\n\treturn tot\r\nnums=input().split()\r\nprint(helper(int(nums[0]),int(nums[1])))", "string = input()\r\nlengths = string.split(\" \")\r\na = int(lengths[0])\r\nb = int(lengths[1])\r\nships = 0\r\nwhile b != 0:\r\n if a < b:\r\n a, b = b, a\r\n ships += a // b\r\n a, b = b, (a - b * (a // b))\r\nprint(ships)", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out1.out\",'w')\r\na,b=map(int,input().split())\r\nres=0\r\nwhile a>0 and b>0:\r\n\tif a>b:\r\n\t\tres+=a//b\r\n\t\ta=a%b\r\n\telse:\r\n\t\tres+=b//a\r\n\t\tb=b%a\r\nprint(res)\t\t\r\n", "a,b=map(int,input().split())\r\nc,cnt=0,0\r\nwhile (a!=b and a!=0 and b!=0):\r\n if a>b:a,b=b,a\r\n c=b//a\r\n b=b%a\r\n cnt+=c\r\nprint(cnt)", "a,b = map(int,input().split())\r\nc = 0\r\nwhile b: c += a//b; a,b = b,a%b\r\nprint(c)", "a, b = map(int, input().split())\n\nr = 0\nwhile a > 0 and b > 0:\n if a < b:\n a, b = b, a\n\n n = a // b\n a -= n * b\n \n r += n\n\nprint(r)\n", "a, b = (int(i) for i in input().split())\r\nc = 0\r\nwhile b > 0:\r\n c += a // b\r\n a %= b\r\n if b > a:\r\n a, b = b, a\r\nprint(c)", "import fileinput as f\n\nfor line in f.input():\n if f.lineno() == 1:\n [a, b] = list(map(int, line.split()))\n\ncount = 0\nwhile a > 0 and b > 0: \n ma = max(a, b)\n mi = a + b - ma\n n = ma // mi\n a = ma % mi\n b = mi\n count += n\n\nprint(count)\n", "a,b = list(map(int, input().split()))\r\ns = 0\r\nwhile True:\r\n# print(a,b,s)\r\n if b == 0:\r\n break\r\n else:\r\n s+=(a//b)\r\n temp=a%b\r\n a=b\r\n b=temp\r\nprint(s)", "a, b = (int(x) for x in input().split())\nans = 0\nwhile a:\n\tans += b // a\n\tb %= a\n\ta, b = b, a\nprint(ans)\n", "def main() -> object:\r\n a, b = map(int, input().split())\r\n res = 0\r\n while b > 0:\r\n res += int(a / b)\r\n tmp = a % b\r\n a = b\r\n b = tmp\r\n return res\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())", "a, b = map(int, input().split(' '))\nans = a//b\nc = a - ans * b\nwhile (c!=0):\n a = b\n b = c\n buff = a//b\n c = a - buff * b\n ans += buff\nprint(int(ans))\n", "#get input a,b\r\n#count until max(min(a,b),max(a,b)-min(a,b)) == 1\r\na,b = list(map(int,input().split()))\r\ncount = a // b\r\nwhile a % b != 0:\r\n temp = b\r\n b = a % b\r\n a = temp\r\n count += a//b\r\nprint(count)", "__author__ = 'ruckus'\n\na, b = map(int, input().split())\nn = 0\nwhile a != 0 and b != 0:\n if a > b:\n k = int(a/b)\n a -= k * b\n n += k\n else:\n k = int(b/a)\n b -= k * a\n n += k\nprint(n)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b = map(int, input().split())\r\nans = 0\r\nwhile a:\r\n ans += b // a\r\n b %= a\r\n a, b = b, a\r\nprint(ans)", "n,v=map(int,input().split())\r\nsum=int(0)\r\nwhile n!=0 and v!=0:\r\n if n<=v and n!=0:\r\n sum=sum+int(v/n)\r\n v=v%n\r\n elif v<n and v!=0:\r\n sum=sum+int(n/v)\r\n n=n%v\r\nprint(int(sum))\r\n", "contador = 0\n\ndef dobrar_papel(a,b):\n global contador\n if (a <= 0 or b <= 0):\n return None\n \n if(a == b):\n\n contador = contador + 1;\n return None\n \n elif (b>a):\n max_fator = binario(b,a)\n contador = contador + max_fator\n dobrar_papel(a,b-max_fator*a)\n else:\n max_fator = binario(a,b)\n contador+=max_fator\n dobrar_papel(a-max_fator*b,b)\n\ndef binario(grande ,pequeno):\n aux = -1\n limite_superior = grande\n limite_inferior = 1\n while(limite_inferior<=limite_superior):\n media = (limite_superior+limite_inferior)//2\n if(media == aux):\n break\n if(media*pequeno>=grande):\n limite_superior = media-1\n elif(media*pequeno < grande):\n limite_inferior = media\n aux = media\n return media\n\ndef main():\n entrada = input()\n entrada = entrada.split(\" \")\n a = int(entrada[0])\n b = int(entrada[1])\n dobrar_papel(a,b)\n print(contador)\nmain()\n \t\t\t \t \t \t\t\t \t\t \t \t \t\t\t\t\t", "a,b=map(int,input().split());s=0\nwhile b:s+=a//b;a,b=b,a%b\nprint(s)\n\n", "if __name__ == '__main__':\n papel, resto = map(int, input().split())\n ships = 0\n while resto > 0:\n ships = ships + int(papel/resto)\n novo_resto = papel % resto\n papel = resto\n resto = novo_resto\n if papel < resto:\n papel, resto = resto, papel\n print(ships)\n\t\t\t\t\t\t\t\t \t \t \t \t \t", "a, b = map(int, input().split())\r\n\r\ns = 0\r\n\r\ndef put(a, b):\r\n global s\r\n s += a // b\r\n l = a % b\r\n if l != 0:\r\n put(b, l)\r\n\r\nput(a, b)\r\nprint(s) ", "a, b = [int(i) for i in input().split()]\r\ncount = 0\r\nwhile min(a, b) != 0:\r\n count += a // b\r\n a, b = max(b, a % b), min(b, a % b)\r\nprint(count)\r\n", "a, b = [int(i) for i in input().split()]\r\n\r\ncnt = 0\r\n\r\nwhile True:\r\n if a == 0 or b == 0:\r\n break\r\n if a == b:\r\n cnt += 1\r\n break\r\n else:\r\n if a < b:\r\n c = b\r\n b = a\r\n a = c\r\n cnt += a // b\r\n c = a % b\r\n a = b\r\n b = c\r\n\r\nprint(cnt)", "a, b=[int(k) for k in input().split()]\r\nres=0\r\nwhile b!=0:\r\n res+=a//b\r\n a, b=b, a%b\r\nprint(res)", "# A. Playing with Paper\n\na, b = map(int, input().split())\nn = 0\nwhile b:\n n += a // b\n a, b = b, a % b\nprint(n)\n", "# MC521 - Desafios de Programacao I - 1s2021\n# Contest: 19/03/2021\n# Problema F: Playing with Paper\n\n# le as dimensoes do papel\na, b = map(int, input().split())\n\n# inicializa a variavel auxiliar e o contador\naux = 0\nres = 0\n\n# realiza o procedimento descrito pelo enunciado (ate que todo papel seja utilizado)\nwhile(b > 0):\n # soma ao contador o numero de barcos feitos utilizando quadrados do mesmo formato \n res += a//b\n \n # atualiza as variaveis de forma a simular tal procedimento\n aux = a % b\n a = b\n b = aux\n\n# imprime o resultado\nprint(res)\n\t\t \t\t \t \t\t\t\t \t\t\t \t\t\t", "\r\n\r\ndef main():\r\n a, b = [int(x) for x in input().split()]\r\n ans = 0\r\n while a > 0 and b > 0:\r\n if a < b:\r\n a, b = b, a\r\n ans += a//b\r\n a %= b\r\n print(ans)\r\n\r\nmain()\r\n", "def nori(a,b):\n if a%b == 0:\n return int(a/b)\n s = 0\n res = a%b\n while res != 0:\n d = int(a/b)\n res = a%b\n if res > b:\n a = res\n b = b\n elif b > res:\n a = b\n b = res\n s+=d\n return s\n\na = input().split()\na = [int(a[i]) for i in range(len(a))]\n\nprint(nori(a[0],a[1]))\n \t \t\t\t\t\t \t \t\t\t\t\t\t \t\t \t", "[a, b] = [int(i) for i in input().split()]\r\n\r\nc = a\r\nd = b\r\n\r\nlcz = 0\r\nwhile c>0 and d>0:\r\n lcz += c//d\r\n c = c%d\r\n if d>c:\r\n x = c\r\n c = d\r\n d = x\r\nprint(lcz)", "a,b=map(int,input().split());x=0\r\nwhile b:x+=a//b;a,b=b,a%b\r\nprint(x)", "'''\n# Recusie gaat te diep, dan maar zonder recursie\ndef num_squares(a, b):\n\t# a >= b\n\n\tif a == b:\n\t\treturn 1\n\t\n\tres = 1\n\n\tremainder = a - b\n\n\tif remainder >= b:\n\t\tres += num_squares(remainder, b)\n\telse:\n\t\tres += num_squares(b, remainder)\n\n\treturn res\n'''\n\na, b = [int(i) for i in input().split()]\n\nnum_squares = 0\n\nwhile 1:\n\tnum_squares += a // b\n\t#print(a, b) \n\tremainder = a % b\t\n\ta = b\t\n\tb = remainder\n\n\tif a == b or a == 0 or b == 0:\n\t\tbreak\n\nprint(num_squares)\n", "a,b=map(int,input().split())\r\nsum=0\r\nwhile True :\r\n if a>b: \r\n sum+=(a//b)\r\n #print(a,b,sum)\r\n a-=((a//b)*b)\r\n else:\r\n sum+=(b//a)\r\n b-=((b//a)*a)\r\n #print (a,b,sum)\r\n if a==0 or b==0:break\r\nprint(sum)\r\n", "from math import floor\nif __name__ == '__main__':\n a_b = [int(i) for i in input().split()]\n quadrados = 0\n while a_b[0] != 0 and a_b[1] != 0:\n if a_b[0] > a_b[1]:\n quadrados = quadrados + floor(a_b[0] / a_b[1])\n a_b[0] = a_b[0] % a_b[1]\n else:\n quadrados = quadrados + floor(a_b[1] / a_b[0])\n a_b[1] = a_b[1] % a_b[0]\n print(quadrados)\n\t \t\t\t\t\t \t \t\t \t\t \t \t\t\t \t \t\t", "x, y = [int(i) for i in input().split()]\r\nz = 0\r\nwhile x != 0:\r\n if x < y:\r\n x, y = y, x\r\n z += x//y\r\n x = x%y\r\nprint(z)\r\n", "counter = 0\r\na, b = [int(i) for i in input().split()]\r\nwhile 1:\r\n\tif a > b:\r\n\t\tcounter += int(a/b)\r\n\t\ta = a%b\r\n\t\tif a == 0:\r\n\t\t\tbreak\r\n\telif b > a:\r\n\t\tcounter += int(b/a)\r\n\t\tb = b%a\r\n\t\tif b == 0:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tcounter += 1\r\n\t\tbreak\r\nprint(counter)", "class CodeforcesTask527ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.dims = []\r\n\r\n def read_input(self):\r\n self.dims = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n i = 0\r\n a = self.dims[0]\r\n b = self.dims[1]\r\n while a != b:\r\n if a % b:\r\n i += a // b\r\n a = a % b\r\n if a < b:\r\n swap = a\r\n a = b\r\n b = swap\r\n else:\r\n i += a // b\r\n break\r\n self.result = str(i)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask527ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "import sys, math\r\ninp = input().split()\r\n\r\na = int(inp[0])\r\nb = int(inp[1])\r\nans = 0\r\nwhile a > 0 and b > 0:\r\n if(a >= b):\r\n ans += a // b\r\n a = a % b\r\n else:\r\n ans += b // a\r\n b = b % a\r\n #print(a,b)\r\nprint(ans)", "lst = list(map(int, input().split()))\r\nres = 0\r\nlst.sort()\r\nwhile lst[1] % lst[0] != 0:\r\n res += lst[1] // lst[0]\r\n lst[1] = lst[1] % lst[0] \r\n lst.sort()\r\nres += lst[1] // lst[0]\r\nprint(res)", "import time\nimport collections\n\nclass Time_test:\n def __enter__(self):\n self.enter_time = time.time()\n def __exit__(self, exc_type, exc_val, exc_tb):\n print(\"Command was executed in\", time.time()-self.enter_time)\n\nn, m = [int(x) for x in input().split()]\n\ncounter = 0\nwhile True:\n tmp = max(n, m) // min(n, m)\n if m > n:\n m -= n*tmp\n else:\n n -= m*tmp\n counter += tmp\n if n == 0 or m == 0:\n break\n\nprint(counter)\n", "def how_many_squares(A, B):\r\n remainder = 0\r\n if A > B:\r\n return A // B, A % B, B\r\n elif B > A:\r\n return B // A, B % A, A\r\n else:\r\n return 1, 0, 0\r\n\r\nA, B = [int(x) for x in input().split()]\r\n\r\ntotal_count = 0\r\nwhile A != 0 and B != 0:\r\n count, A, B = how_many_squares(A, B)\r\n total_count += count\r\n\r\nprint(total_count)", "a, b = map(int, input().split())\r\nans = 0\r\n\r\nwhile a % b:\r\n ans += a // b\r\n b, a = a % b, b\r\n\r\nprint(ans + a // b)", "string = input().split()\na = int(string[0])\nb = int(string[1])\ncount = 0\nwhile((a != 0) and (b != 0)):\n \n if(a > b):\n lastA = a\n count = count + int(a/b)\n a = b\n b = lastA%b\n else:\n lastB = b\n count = count + int(b/a)\n b = a\n a = lastB%a\n\nprint(count)\n \t\t \t\t \t \t \t \t\t \t\t\t \t \t \t", "a, b = map(int,input().split())\r\ns = 0\r\nwhile (a>0 and b>0):\r\n\tif(a<b):\r\n\t\ts = s + int(b/a)\r\n\t\tb = b%a\r\n\telse:\r\n\t\ts = s + int(a/b)\r\n\t\ta = a%b\r\nprint(s)", "a,b = input().split(\" \")\r\na = int(a)\r\nb = int(b)\r\ns = 0\r\nc = 0\r\nwhile (a!=b):\r\n if(not(a==0 or b==0)):\r\n if(a>b):\r\n c = a//b\r\n a%=b\r\n else:\r\n c = b//a\r\n b%=a\r\n s+=c\r\n else:\r\n break\r\nprint(s)", "a, b = map(int, input().split())\r\n\r\ncnt = 0\r\n\r\nwhile (b != 0 and a != b):\r\n cnt = cnt + (a // b)\r\n a, b = b, a % b\r\n\r\nprint (cnt)", "# जय श्री राम\r\n\r\nimport sys; import math; from collections import *\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef get_ints(): return map(int, input().split())\r\ndef get_list(): return list(get_ints())\r\ndef printspx(*args): return print(*args, end=\"\")\r\ndef printsp(*args): return print(*args, end=\" \")\r\n\r\nUGLYMOD = int(1e9+7); SEXYMOD = 998244353; MAXN = int(1e5)\r\n\r\n# sys.stdin = open(\"input.txt\",\"r\"); sys.stdout = open(\"output.txt\",\"w\")\r\n\r\n# for _testcases_ in range(int(input())):\r\na, b = get_ints()\r\na, b, ans = max(a, b), min(a, b), 0\r\nwhile b:\r\n ans += a // b\r\n a = a % b\r\n a, b = max(a, b), min(a, b)\r\nprint(ans)\r\n\r\n'''\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\nTHE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )\r\nLink may be copy-pasted here if it's taken from other source.\r\nDO NOT PLAGIARISE.\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\n'''", "# coding: utf-8\na, b = [int(i) for i in input().split()]\nans = 0\nwhile a%b!=0:\n ans += a//b\n a, b = b, a%b\nans += a//b\nprint(ans)\n", "import sys\r\na,b=[int(i) for i in input().split(\" \")]\r\na2=max([a,b])\r\nb2=min([a,b])\r\nsumma=0\r\nwhile a2!=0 and b2!=0:\r\n summa+=int(a2/b2)\r\n b=a2%b2\r\n a=b2\r\n a2=a\r\n b2=b\r\nprint(summa)\r\n", "a,b=[int(x)for x in input().split()]\r\ncounter = 0\r\na,b=max(a,b),min(a,b)\r\nwhile a != b and b!= 0:\r\n\tcounter += a//b\r\n\ta,b = b,a%b\r\nprint(counter)", "a, b = map(int, input().split())\nres = 0\nwhile b:\n res += a // b\n a, b = b, a % b\nprint(res)", "def f(l):\r\n a,b = l #a is bigger\r\n c = 0\r\n while b>0:\r\n c += (a//b)\r\n t = b\r\n b = a%b\r\n a = t\r\n return c\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "def cortar_quadrados(a, b):\n if a > b and b > 0:\n return (a // b) + cortar_quadrados(b, a % b)\n return 0\n\n\npaper = [int(x) for x in input().split()]\nres = cortar_quadrados(paper[0], paper[1])\nprint(res)\n \t \t\t\t \t\t \t\t\t \t\t \t\t\t\t\t\t\t\t\t", "s = input()\r\na = s.split()\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\r\ni = 0\r\nwhile a[1] != a[0]:\r\n\tif a[1] > a[0]:\r\n\t\ti += int(a[1]/a[0])\r\n\t\ta[1] %= a[0]\r\n\telse:\r\n\t\ti += int(a[0]/a[1])\r\n\t\ta[0] %= a[1]\r\n\tif a[1] == 0 or a[0] == 0:\r\n\t\tbreak\r\n\t\t\r\nprint(i)", "def paper(a, b):\r\n num = 0\r\n a, b = (a, b) if a > b else (b, a)\r\n\r\n while True:\r\n increase = a // b\r\n num += increase\r\n temp = b\r\n b = a % b\r\n a = temp\r\n if b == 0:\r\n break\r\n # print a, b\r\n return num\r\n\r\ninput_str = [int(p.strip()) for p in input().split(' ') if p != '']\r\nprint(paper(input_str[0], input_str[1]))\r\n", "import math\r\n\r\na, b = map(int, input().split())\r\nans = 1\r\nwhile a != b:\r\n\tif a > b:\r\n\t\tans += math.ceil((a - b) / b)\r\n\t\ta -= b * math.ceil((a - b) / b)\r\n\telse:\r\n\t\tans += math.ceil((b - a) / a)\r\n\t\tb -= a * math.ceil((b - a) / a)\r\nprint(ans)", "a,b=map(int,input().split())\r\nc=0\r\nwhile a>0 and b>0:\r\n\tif(a>b):\r\n\t\tc=c+a//b\r\n\t\ta=a%b\r\n\telse:\r\n\t\tc=c+b//a\r\n\t\tb=b%a\r\nprint(c)", "import math\r\nfrom decimal import *\r\ngetcontext().prec = 30\r\na,b=map(int,input().split())\r\nans=0\r\ndef fn():\r\n global a,b\r\n if a<b:\r\n a,b=b,a\r\n if (a-b)%b==0:\r\n x=(a-b)//b\r\n a-=a\r\n b-=b\r\n return x+1\r\n x=math.ceil((a-b)/b)\r\n a-=x*b\r\n return x\r\nwhile a*b:\r\n #print(a,b)\r\n ans+=fn()\r\nprint(ans)\r\n", "#\"from dust i have come, dust i will be\"\r\n\r\na,b=map(int,input().split())\r\n\r\ncount=0\r\nwhile a>0 and b>0:\r\n\r\n if a>=b :\r\n count+=(a//b)\r\n a=a%b\r\n else:\r\n count+=(b//a)\r\n b=b%a\r\n\r\nprint(count)\r\n\r\n", "a,b = [int(i) for i in input().split()]\r\n\r\ni = 0\r\nwhile True:\r\n \r\n if b == 0:\r\n break\r\n else:\r\n i += a//b\r\n a,b = b,a%b\r\n\r\nprint(i)\r\n", "x,y=map(int,input().split())\r\ns=x//y\r\nr=x%y\r\nwhile(r!=0):\r\n x=y\r\n y=r\r\n s=s+x//y\r\n r=x%y\r\nprint(s)\r\n", "import math\na, b = map(int, input().split())\nres = 0\na, b = min(a, b), max(a, b)\nwhile(b > 0):\n res += math.floor(a/b)\n aux = a\n a = b\n b = aux % b\nprint(res)\n \t\t \t\t\t \t\t\t\t \t\t \t \t\t \t\t", "ab=input()\na = int(ab.split(\" \")[0])\nb = int(ab.split(\" \")[1])\n\nn = 0\nwhile (((a-b)>=0 or (b-a)>=0) and a>0 and b>0):\n if (a>b):\n n+=a//b\n a=a%b\n else:\n n+=b//a\n b=b%a\n\nprint(n)\n\t\t\t\t \t\t\t\t \t\t \t \t\t\t \t\t \t", "#527a, origami paper, dec 15 2015\r\nx,y=map(int,input().split())\r\nctr=0\r\nwhile x>0:\r\n if y>x:\r\n x,y=y,x\r\n ctr+=x//y\r\n x=x%y\r\nprint(ctr)\r\n", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n a, b = str(input()).split()\r\n a = int(a)\r\n b = int(b)\r\n value = 0\r\n while True:\r\n if a % b == 0:\r\n value += int(a / b)\r\n break\r\n value += int(a / b)\r\n c = a\r\n a = b\r\n b = c % b\r\n print(value)\r\n", "a,b=map(int,input().split())\r\nc=0\r\np=1\r\nwhile (p==1):\r\n\tif a>b:\r\n\t\tif a%b==0:\r\n\t\t\tc+=a//b\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tc+=a//b\r\n\t\t\ta=a%b\r\n\telse:\r\n\t\tif b%a==0:\r\n\t\t\tc+=b//a\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tc+=b//a\r\n\t\t\tb=b%a\r\nprint(c)", "a,b=map(int,input().split())\r\ns=0\r\nwhile b!=0:\r\n s=s+int(a/b)\r\n a,b=b,a%b\r\n\r\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 14 21:27:37 2019\r\n\r\n@author: avina\r\n\"\"\"\r\nn,m = map(int, input().strip().split())\r\nk = 0\r\n \r\nwhile n != 0 and m != 0:\r\n if n > m:\r\n k += int(n/m)\r\n n = n%m\r\n else:\r\n k += int(m/n)\r\n m = m%n\r\nprint(k) \r\n\r\n", "a, b = map(int, input().split())\r\nans = 0\r\n\r\nwhile min(a, b) != 0:\r\n ans += max(a, b) // min(a, b)\r\n a, b = min(a, b), max(a, b) % min(a, b)\r\nprint(ans)\r\n\r\n", "def main():\r\n a, b = list(map(int, input().split()))\r\n\r\n counter = 0\r\n while a > 0 and b > 0:\r\n if a >= b:\r\n counter += a // b\r\n a = a % b\r\n else:\r\n counter += b // a\r\n b = b % a\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b = map(int,input().split())\r\nz =0\r\nwhile 1:\r\n\tif b==0:\r\n\t\tprint(z)\r\n\t\tbreak\r\n\telse:\r\n\t\tz+=a//b\r\n\t\ta,b= b,a%b", "l = []\nl = input().split()\na = int(l[0])\nb = int(l[1])\n\ncount = 0\nwhile a != b and a > 0 and b > 0:\n if a%b < a-1:\n count = count + int(a/b)\n aux = a%b\n else:\n count = count + 1\n aux = a-b\n if aux > b:\n a = aux\n else:\n a = b\n b = aux\n\nprint(count)\n \t\t \t\t \t\t\t \t\t \t \t\t\t \t \t", "a,b = list(map(int,input().split()))\nif a<b:\n a,b = b,a\nk = 0\nwhile (a != 0 and b != 0):\n k+= a//b\n a = a%b\n a,b = b,a\nprint(k)\n", "a , b= map(int , input().split())\r\nc =0 \r\nwhile b : # when b will be zero the loop will be stop \r\n c+=a//b\r\n a, b = b , a%b \r\n \r\nprint(c)", "a,b=map(int,input().split())\r\nc=0\r\nwhile(a!=0 and b!=0):\r\n a1=max(a,b)\r\n b1=min(a,b)\r\n c+=a1//b1\r\n a=a1%b1\r\n b=b1\r\nprint(c)", "# https://codeforces.com/problemset/problem/527/A\r\n\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n w = 0\r\n \r\n while a > 0 and b > 0:\r\n if a - b > 0:\r\n ile_razy = a // b\r\n a -= ile_razy * b\r\n w += ile_razy\r\n else:\r\n if a == b:\r\n w += 1\r\n \r\n print(w)\r\n return\r\n \r\n if a < b:\r\n a, b = b, a\r\n \r\n if a == b:\r\n w += 1\r\n \r\n print(w)\r\n return\r\n \r\nmain()", "a, b = map(int, input().split())\r\nk = 0\r\nwhile a != b and a != 0 and b != 0:\r\n k += a // b\r\n t = a\r\n a = b\r\n b = t % b\r\nif a == b and a != 0:\r\n k += 1\r\nprint(k)", "def gcd(a, b):\r\n if a == 0:\r\n return b, 0\r\n g, x1 = gcd(b%a, a)\r\n x = x1 + b//a\r\n return g, x\r\na, b = map(int, input().split(' '))\r\nprint(gcd(a, b)[-1])\r\n", "n,m=map(int,input().split(' '))\r\nres=0\r\nwhile( n>0 and m>0 ):\r\n if(n>m):\r\n n,m=m,n\r\n res+=m//n\r\n r=m%n\r\n m=n\r\n n=r\r\nprint(res)", "def ii(): return int(input())\r\ndef fi(): return float(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n\r\nimport math\r\n\r\na,b=mi()\r\nc=0\r\nwhile a>0 and b>0:\r\n\tc+=a//b\r\n\ta=a%b\r\n\ta,b=b,a\r\nprint(c)", "a, b = map(int, input().split())\r\n# print(n, m)\r\nans = 0\r\nif b > a:\r\n tmp = a\r\n a = b \r\n b = tmp\r\n# a > b\r\ntotal = a * b\r\nwhile b != 0 : \r\n qua = b*b\r\n s = int(total / qua)\r\n ans += s\r\n total = total - s * qua\r\n a = a - s*b\r\n tmp = a\r\n a = b\r\n b = tmp\r\nprint(ans)", "\na, b, = (int(a) for a in input().strip().split())\n\nif a > b:\n a, b = b, a\n\nn = 0\nwhile a > 0:\n if a > b:\n a, b = b, a\n\n n += b // a\n a, b = b % a, a\n\nprint(n)\n", "a,b=[int(x) for x in input().split()]\r\nres=0\r\nwhile a!=b:\r\n if a>b:\r\n if a%b==0:\r\n res+=(a//b-1)\r\n a-=(a//b-1)*b\r\n else:\r\n res+=a//b\r\n a-=(a//b)*b\r\n else:\r\n if b%a==0:\r\n res+=(b//a-1)\r\n b-=(b//a-1)*a\r\n else:\r\n res+=b//a\r\n b-=(b//a)*a\r\nprint(res+1)", "a,b = map(int, input().split())\r\n\r\n\r\ndef origami(a,b):\r\n\tcount = 0\r\n\twhile a>0 and b>0:\r\n\t\ta,b = max(a,b), min(a,b)\r\n\t\tcount += a//b\r\n\t\ta = a%b\r\n\treturn count\r\n\r\nprint(origami(a,b))", "import sys;input = sys.stdin.readline;import queue\r\nn,m=map(int,input().split())\r\nc=0\r\n\r\nwhile(n!=m and n!=0 and m!=0):\r\n\ta=max(n,m)\r\n\tb=min(n,m)\r\n\tco=a//b\r\n\tc+=co\r\n\tn=a-(b*co)\r\n\tm=b\r\nprint(c)", "a, b, i = *map(int, input().split()), 0\r\nwhile b:\r\n b, a, i = a % b, b, i + a // b\r\nprint(i)\r\n", "import math\n\nentrada = str(input()).split()\na = int(entrada[0])\nb = int(entrada[1])\nqtd = 0\n\nwhile a != b and a != 0 and b != 0:\n if a > b:\n resto = a % b\n qtd = qtd + a // b\n a = resto\n else:\n resto = b % a\n qtd = qtd + b // a\n b = resto\n\nprint(qtd)\n\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\nc=0\r\nwhile min(l)>0:\r\n\ta=l.index(max(l))\r\n\tc+=l[a]//l[1-a]\r\n\tl[a]=l[a]%l[1-a]\r\nprint(c)", "a, b = map(int, input().split())\r\n\r\nboats = 0\r\n\r\nwhile b:\r\n x, y = divmod(a, b)\r\n a, b, boats = b, y, boats + x\r\n\r\nprint(boats)", "a,b=map(int,input().split())\nans=0\nwhile a>0 and b>0:\n if a>=b:\n ans+=(a//b)\n a=a%b\n else:\n ans+=b//a\n b=b%a\nprint(ans)", "a, b = [int(x) for x in input().split()]\r\nans = 0\r\n\r\nwhile a > b:\r\n ans += a//b\r\n a %= b\r\n x = a\r\n a = b\r\n b = x\r\n if b == 0:\r\n break\r\n\r\nprint(ans)", "a,b=map(int,input().split())\r\nans=0\r\nwhile a>b:\r\n ans=ans+a//b\r\n c=b\r\n b=a-(a//b)*b\r\n a=c\r\n if b==0:\r\n break\r\nprint(ans)", "a,b = map(int,input().split())\r\nans = 0\r\nwhile(a != b and a > 0 and b > 0):\r\n\tif(a>b):\r\n\t\tans += int(a/b)\r\n\t\ta = a - int(a/b) * b\r\n\telif(b > a):\r\n\t\tans += int(b/a)\r\n\t\tb = b - int(b/a) * a\r\n\t\t\r\nprint(ans)", "s = input()\r\ns = s.split()\r\na = int(s[0])\r\nb = int(s[1])\r\ncount = 0\r\nwhile a > 1 and b > 1:\r\n\tcount += a // b\r\n\ta, b = (b , a % b)\r\nif a != 0 and b != 0:\r\n\tcount += a\r\nprint(count)", "ent = list(map(int,input().strip().split()))[:2]\n\nent.sort()\n\na = ent[1]\nb = ent[0]\n\ncont = 0\n\nwhile a >= 1:\n \n if(a < b):\n sup = a\n a = b\n b = sup\n\n \n cont += a//b\n a = a % b\n \n \nprint(cont)\n\t\t\t\t\t\t \t\t \t\t \t\t\t \t\t\t\t\t\t \t\t\t \t", "__author__ = 'catman'\r\na,b = map(int, input().split())\r\ncount = 0\r\nwhile True:\r\n #print(a,b)\r\n if a>b:\r\n t = a//b\r\n a = a-t*b\r\n else:\r\n t = b//a\r\n b = b-t*a\r\n count += t\r\n if a == 0 or b==0:\r\n break\r\n elif a == 1 or b == 1:\r\n if a == 1: count += b\r\n else: count += a\r\n break\r\nprint(count)", "def fun(a,b):\r\n j=a//b\r\n return (j,a-(b*j))\r\na,b=map(int,input().split())\r\nif a%b==0:\r\n print(a//b)\r\nelse:\r\n c=0\r\n while True:\r\n j,a=fun(a,b)\r\n c+=j\r\n if a<b:\r\n b,a=a,b\r\n if a%b==0:\r\n break\r\n if a!=b:\r\n c+=a//b \r\n print(c)", "import math\r\na, b = map(int, input().split())\r\nc = 0\r\nwhile b != 0:\r\n c += a//b\r\n a, b = b, a % b\r\n\r\n #print(a, b)\r\n'''\r\nwhile a != b:\r\n a, b = (max(a, b) - min(a, b)), min(a, b)\r\n c += 1\r\n print(a, b)\r\n'''\r\n\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\nc=0\r\nwhile(1):\r\n if a==0 or b==0:\r\n break\r\n else:\r\n if a>=b:\r\n c+=a//b\r\n a=a%b\r\n else:\r\n c+=b//a\r\n b=b%a\r\n # print(a,b)\r\nprint(c)", "w, h = map(int, input().split())\r\nturns = 0\r\nwhile (h != w) and (h != 0) and (w != 0):\r\n if h > w:\r\n turns += h // w\r\n h = h % w\r\n else:\r\n turns += w // h\r\n w = w % h\r\nprint (turns)", "# coding: utf-8\n\n__author__ = '(Lambdell)'\n\n\ndef solve(a, b):\n a, b = max(a, b), min(a, b)\n\n if a % b == 0:\n return a // b\n else:\n return solve(a % b, b) + a // b\n\n\nif __name__ == '__main__':\n a, b = map(int, input().strip().split())\n print(solve(a, b))", "a,b=map(int,input().split())\r\nc=0\r\nif(a!=1 and b==1):\r\n print(a)\r\nelse:\r\n while(a>=1 and b>=1):\r\n a,b=sorted([a,b])\r\n c+=b//a\r\n b=b%a\r\n print(c)", "def main():\r\n a, b = map(int, input().split())\r\n\r\n answer = 0\r\n \r\n while (a>0 and b>0):\r\n if (a>b):\r\n a, b = b, a\r\n\r\n answer += b//a\r\n b %= a\r\n\r\n print(answer)\r\n \r\n\r\nmain()\r\n", "#!/usr/bin/env python3\n\na, b = map(int, input().split(' '))\n\nships_num = 0\n\nwhile b != 0:\n ships_num += a // b\n a, b = b, a % b\n\nprint(ships_num)\n", "def f(a, b):\r\n if a % b > 0:\r\n return int(a / b) + f(b, a % b)\r\n return int(a / b)\r\n\r\na, b = map(int,input().split())\r\nprint(f(a, b))\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nx=0\r\nwhile a!=b:\r\n if a-100000000*b>0:\r\n a-=100000000*b\r\n if a<b:\r\n b,a=a,b\r\n x+=100000000\r\n else:\r\n if a-1000000*b>0:\r\n a-=1000000*b\r\n if a<b:\r\n b,a=a,b\r\n x+=1000000\r\n else:\r\n if a-10000*b>0:\r\n a-=10000*b\r\n if a<b:\r\n b,a=a,b\r\n x+=10000\r\n else:\r\n if a-100*b>0:\r\n a-=100*b\r\n if a<b:\r\n b,a=a,b\r\n x+=100\r\n else:\r\n if a-b>0:\r\n a-=b\r\n if a<b:\r\n b,a=a,b\r\n x+=1\r\nprint(x+1)\r\n", "S=input().split()\r\na=int(S[0])\r\nb=int(S[1])\r\nk=0\r\nost=0\r\nwhile a>=1 and b>=1 :\r\n k=k+(a//b)\r\n ost=a%b\r\n a=b\r\n b=ost\r\nprint(k)\r\n \r\n \r\n \r\n", "def gcd(a,b,cnt):\n if b==0:\n return (a,cnt)\n else:\n return gcd(b,a%b,cnt+a//b)\na,b = map(int,input().split())\nd,ans = gcd(a,b,0)\nprint(ans)", "a, b = [int(i) for i in input().split()]\ni = 0\nwhile a != 0 and b != 0:\n if a > b:\n i += a//b\n a = a%b\n else:\n i += b//a\n b = b%a\nprint(i)\n", "# RawCoder : https://bit.ly/RCyouTube\r\n# Author : MehulYK\r\n \r\nimport math as m\r\n\r\ndef lmap():\r\n return list(map(int, input().split()))\r\n \r\ndef mmap(): \r\n return map(int, input().split())\r\n\r\na, b =mmap()\r\n\r\nans = 0\r\n\r\nwhile a > 0 and b > 0:\r\n if a >= b:\r\n ans += a // b\r\n a = a % b\r\n else:\r\n ans += b // a\r\n b = b % a\r\n\r\nprint(ans) ", "a, b = list(map(int, input().split()))\r\nr = 0\r\nwhile a!=b and a > 0 and b > 0:\r\n if a>b:\r\n r+=a//b\r\n a -= a//b * b\r\n elif a<b:\r\n r+=b//a\r\n b -= b//a * a\r\nprint(r)", "a,b = map(int,input().split())\r\nr = 0\r\nwhile b:\r\n r+=a//b\r\n a,b=b,a%b\r\nprint(r)", "a,b=map(int,input().split());c=0\r\nwhile not 0 in [a,b]:\r\n if b>a: b,a=a,b\r\n c,a=c+a//b,a%b\r\nprint(c)", "finished=False\nlado = list(map(int, input().split()))\nnavios=0\nbase=lado[0]\naltura=lado[1]\nwhile altura!=0:\n navios+=(base//altura)\n (base,altura)=(altura, base%altura)\nprint(navios)\n\t \t\t\t \t \t\t\t\t\t\t\t\t \t \t \t\t\t\t \t", "a, b = map(int, input().split())\nans = 0\nwhile b:\n ans += a//b\n a = a%b\n a, b = b, a\nprint(ans)\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\ni = 0\r\n\r\nwhile a != b:\r\n if a%b == 0:\r\n i = i + a/b\r\n break\r\n \r\n else:\r\n i = i + a//b\r\n c = b\r\n b = a%b\r\n a = c\r\n \r\nprint (int(i))", "#n=int(input())\r\n#lst = list(map(int, input().strip().split(' ')))\r\nn,k = map(int, input().strip().split(' '))\r\nt=0\r\nc=0\r\nwhile(True):\r\n if n%k==0:\r\n print(c+n//k)\r\n break\r\n else:\r\n t=n//k\r\n c+=t\r\n n-=t*k\r\n n,k=k,n\r\n ", "str = input().split()\r\n\r\na = int(str[0])\r\nb = int(str[1])\r\n\r\nboat = 0\r\n\r\nwhile a >= 0 or b >= 0:\r\n \r\n if a==0 or b==0:\r\n break\r\n\r\n if a//b >0:\r\n this_boat = a//b\r\n boat += this_boat\r\n a = a-(b*this_boat)\r\n if a==0:\r\n break\r\n if b//a >0:\r\n this_boat = b//a\r\n boat += this_boat\r\n b = b-(a*this_boat)\r\n if b==0:\r\n break\r\n\r\n\r\n\r\nprint(boat)\r\n", "a,b = map(int,input().split())\r\nk = 0 \r\nt = 0\r\nwhile True:\r\n\tif a <= 1 or b <= 1 or a == b:\r\n\t\tif a == 1:\r\n\t\t\tt = b//a\r\n\t\t\tk = k + t\r\n\t\t\tbreak\r\n\t\telif b == 1:\r\n\t\t\tt = a//b\r\n\t\t\tk = k + t\r\n\t\t\tbreak\r\n\t\tbreak\r\n\telse:\r\n\t\tif a > b:\r\n\t\t\tt = a//b\r\n\t\t\ta = a - t*b\r\n\t\t\tk = k + t\r\n\t\telif b > a:\r\n\t\t\tt = b//a\r\n\t\t\tb = b - t*a\r\n\t\t\tk = k + t\r\nprint(k)\r\n\r\n", "l = list(map(int, input().split()))\r\nc = 0\r\nl[0], l[1] = min(l), max(l)\r\nwhile l[0] > 0 and l[1] > 0:\r\n c += l[1] // l[0]\r\n l[0], l[1] = l[1] % l[0], l[0]\r\nprint(c)", "a, b = sorted([int(i) for i in input().split()], reverse = True)\n\nr = 0\nwhile a != 0 and b != 0:\n s = 0\n if a > b:\n s = int(a / b)\n a -= b * s\n else:\n s = int(b / a)\n b -= a * s\n \n r += s\n\nprint(r)\n\t\t\t\t\t \t \t\t \t \t \t\t\t \t\t", "from math import floor\nif __name__ == '__main__':\n sizes = [int(m) for m in input().split(' ')]\n n = 0\n test = True\n while test:\n if sizes[0] > sizes[1]:\n n += floor(sizes[0]/sizes[1])\n sizes[0] = sizes[0] % sizes[1]\n test = not sizes[0] == 0\n else:\n n += floor(sizes[1] / sizes[0])\n sizes[1] = sizes[1] % sizes[0]\n test = not sizes[1] == 0\n\n print(n)\n \t \t\t \t\t \t \t\t\t \t\t \t", "s = input()\r\na,b = [int(x) for x in s.split()]\r\nc,ans = 0,0;\r\nwhile True:\r\n c = min(a,b)\r\n a = max(a,b)\r\n b = c\r\n ans += a // b\r\n a = a % b\r\n if a % b == 0:\r\n break;\r\nprint(ans)\r\n ", "n,m = [int(i) for i in input().split()]\r\ndef swap(n,m):\r\n\tif n < m :\r\n\t\tnn = n\r\n\t\tn = m\r\n\t\tm = nn\r\n\treturn n,m\r\ndef f(n,m):\r\n\tn,m = swap(n,m)\r\n\tif n%m == 0 :\r\n\t\treturn n//m\r\n\tif m == 1:\r\n\t\treturn n\r\n\t#print(n%m)\r\n\treturn n//m+f(n-n//m*m,m)\r\nprint(f(n,m))\r\n", "a, b = map(int, input().split())\n\nship = 0\nwhile a > 0 and b > 0 and a != b:\n ship += a // b\n a, b = b, a % b\nprint(ship)", "f = lambda: input()\n\na,b = map(int, f().split())\nc = 0\nwhile( a != b and a != 0 and b != 0):\n lo = min(a, b)\n hi = max(a, b)\n a = hi % lo\n b = lo\n c += int(hi / lo)\n\nprint(c)\n", "a,b=map(int,input().split())\r\nf=True\r\ns=0\r\nwhile(f):\r\n if a==b:\r\n s+=1\r\n f=False\r\n break\r\n elif b==1:\r\n s+=a\r\n f=False\r\n break\r\n elif a%b==0:\r\n s+=a//b\r\n f=False\r\n break\r\n else:\r\n if a>2*b:\r\n k=a//b\r\n s+=k\r\n a=a-k*b\r\n c = min([a, b])\r\n d = max([a, b])\r\n a = d\r\n b = c\r\n else:\r\n a=a-b\r\n c=min([a,b])\r\n d=max([a,b])\r\n a=d\r\n b=c\r\n s+=1\r\nprint(s)", "#!/c/Python34/python\r\n# coding: utf-8\r\n\r\n\r\ndef main():\r\n [a, b] = map(int, input().split())\r\n ans = 0\r\n\r\n while 1:\r\n if a > b:\r\n ans += a//b\r\n if a % b == 0:\r\n break\r\n a = a % b\r\n else:\r\n ans += b//a\r\n if b % a == 0:\r\n break\r\n b = b % a\r\n\r\n print(ans)\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\r\ns=0\r\nwhile n!=m and n!=0 and m!=0:\r\n n,m=max(n,m),min(n,m)\r\n s+=n//m\r\n n=n%m\r\nprint(s)\r\n", "a,b = map(int,input().split())\r\ns = 0\r\nwhile a%b!=0:\r\n s+= a//b\r\n a,b = max(a%b,b),min(a%b,b)\r\ns+=a//b\r\nprint(s)\r\n", "\r\nmy_str = input().split()\r\na, b = int(my_str[0]), int(my_str[1])\r\nc = 0\r\nwhile a>b and b>0:\r\n t = a\r\n a = b\r\n c += int(t/b)\r\n b = t % b\r\n if b>a:\r\n t = a\r\n a = b\r\n b = t\r\nprint (c)\r\n", "a,b = map(int, input().split())\nc=0\nwhile a and b:\n\tc += a//b\n\ta = a%b\n\ta,b = b,a\nprint(c)\n", "def getInput() :\n\ttableau = input().split()\n\ttableau[0] = int(tableau[0])\n\ttableau[1] = int(tableau[1])\n\n\treturn tableau[0], tableau[1]\n\ndef solve(a, b) :\n\tcompteur = 0\n\twhile b > 0 :\n\t\tcompteur += a//b\n\t\ta -= (a//b)*b\n\t\tif a < b :\n\t\t\t(a, b) = (b, a)\n\n\treturn compteur\n\n(a, b) = getInput()\nprint(solve(a, b))", "inp = input()\r\ninp = inp.split()\r\na = int(inp[0])\r\nb = int(inp[1])\r\nans = 0\r\nwhile(b > 0):\r\n ans += a//b\r\n c = a % b\r\n a = b\r\n b = c\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\ncount = 0\r\n\r\nwhile a > 0 and b > 0:\r\n if a >= b:\r\n cnt, a = divmod(a, b)\r\n count += cnt\r\n else:\r\n cnt, b = divmod(b, a)\r\n count += cnt\r\n\r\nprint(count)\r\n", "import math\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\na, b = _input()\r\nres = 0\r\nwhile True:\r\n if a > b: \r\n res+=a//b\r\n if a%b==0: break\r\n else: a%=b\r\n elif a==b: res+=1; break\r\n else: \r\n res+=b//a\r\n if b%a==0: break\r\n else: b%=a\r\nprint(res)", "a,b=map(int, input().split())\r\nn=1\r\nwhile a!=b and a!=0 and b!=0:\r\n if b>a:\r\n x=b\r\n b=a\r\n a=x\r\n n+=a//b\r\n a=abs(a-((a//b)*b))\r\nprint(n-1)", "a, b = map(int, input().split())\r\n\r\ncnt = 1 if a == b else 0\r\n\r\nwhile a != b:\r\n a, b = min(a, b), max(a, b)\r\n if a == 0:\r\n break\r\n cnt += b // a\r\n b -= a*(b // a)\r\n\r\nprint(cnt)\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\na, b = map(int, input().split())\r\n\r\nans = 0\r\n\r\nwhile a % b != 0:\r\n ans += a//b\r\n rem = a%b\r\n a, b = b, rem\r\n\r\nans += a//b\r\n\r\nprint(ans)\r\n\r\n", "import sys\r\na,b=input().split()\r\nx,y=a,b\r\nc=0\r\na,b=int(x),int(y)\r\nif b==1:\r\n print(a)\r\n sys.exit()\r\nwhile a>0 and b>0:\r\n if a>b:\r\n c+=int(a/b)\r\n a=int(a%b)\r\n else :\r\n c+=int(b/a)\r\n b=int(b%a)\r\nprint(c)\r\n", "def f(a,b,c):return f(b,a%b,c+a//b)if b else c\r\na=list(map(int,input().split()))\r\nprint(f(a[0],a[1],0))\r\n", "a,b=map(int,input().split())\r\ni=0\r\nwhile a*b!=0:\r\n a,b=sorted([a,b])\r\n i+=b//a\r\n a,b=a,b%a\r\nprint(i)", "text=[int(i) for i in input().split(\" \")]\na=text[0]\nb=text[1]\nn=0\nwhile a!=b and b>0:\n\tn+=a//b\n\tt=a\n\ta=b\n\tb=t-(t//b)*b\n\tif a<b:\n\t\tt=a\n\t\ta=b\n\t\tb=t\nprint(n)\n", "import os,sys,io,math\r\nfrom tokenize import Triple\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\n\r\na,b=map(int,input().split())\r\nres=0\r\nwhile a>0 and b>0:\r\n if a>b:\r\n res+=a//b\r\n a%=b\r\n else:\r\n res+=b//a\r\n b%=a\r\nprint(res)", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\ninput=sys.stdin.readline\r\nints = lambda : list(map(int,input().split()))\r\n\r\np = 10**9+7\r\n\r\na,b=sorted(ints())\r\nans=0\r\nwhile True:\r\n if a==0:\r\n break\r\n ans+=b//a\r\n x=b%a\r\n b=a\r\n a=x\r\nprint(ans)", "a, b = map(int, input().split(' '))\n\na, b = max(a, b), min(a, b)\n\nans = 0\n\nwhile b > 1:\n ans += int(a / b)\n a = int(a % b)\n a, b = max(a, b), min(a, b)\n\n # print(a, b)\n\nans += (a * b)\n\nprint(ans)\n\n \t\t \t\t \t\t\t \t \t\t\t\t\t \t", "a, b = list(map(int, input().split()))\r\nans = 0\r\nwhile (a != b):\r\n if (a < b):\r\n a, b = b, a\r\n ans += (a - 1) // b\r\n a -= ((a - 1) // b) * b\r\nprint(ans + 1)", "a,b = map(int,input().split())\r\n\r\ndef f(a,b):\r\n if a==b:\r\n return 1\r\n elif a==0 or b==0:\r\n return 0\r\n else:\r\n return a//b + f(max(a-b*(a//b),b),min(a-b*(a//b),b))\r\n\r\nprint(f(a,b))", "a,b = map(int,input().split())\r\nans = 0\r\nwhile True:\r\n if a%b==0:\r\n ans+=(a//b)\r\n break\r\n else:\r\n c= a//b\r\n l1 = a%b\r\n a = max(b,l1)\r\n b = min(b,l1)\r\n ans+=c\r\nprint(ans)", "lista = input().split(' ')\nladoHorizontal = int(lista[0])\nladoVertical = int(lista[1])\nnum_barcos = 0\n\nwhile(ladoHorizontal != ladoVertical):\n if ladoHorizontal > ladoVertical:\n quociente = ladoHorizontal//ladoVertical\n ladoHorizontal -= quociente*ladoVertical\n \n else:\n quociente = ladoVertical//ladoHorizontal\n ladoVertical -= quociente*ladoHorizontal\n\n num_barcos += quociente\n if(ladoHorizontal == 0 or ladoVertical == 0):\n break\n\n\nprint(num_barcos)\n \t\t\t \t\t\t \t \t \t\t \t \t", "s=str(input())\r\nn=s.split()\r\na=int(n[0])\r\nb=int(n[1])\r\nc=0\r\nx=0\r\nwhile (a%b!=0):\r\n c=a//b\r\n x=x+c\r\n d=b\r\n b=a%b\r\n a=d\r\nx=x+a//b\r\nprint(x)\r\n", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\na,b = map(int, input().split())\r\n\r\na=max(a,b)\r\nb=min(a,b)\r\nans = 0\r\n\r\nwhile b > 1:\r\n\tans += a//b\r\n\ta,b = b,a%b\r\n\tif not b: break\r\nif b == 1: ans+=a\r\n\r\nprint(ans)", "import sys\na, b = map(int, sys.stdin.readline().split())\nans = 0\nwhile b != 0:\n ans += a//b\n a, b = b, a%b\nprint(ans)\n", "#!/usr/bin/env python\n# coding=utf-8\n\na, b = map(int, input().split())\ncount = 0\nwhile a > 0 and b > 0:\n count += a // b\n x = b\n b = a % b\n a = x\nprint(count)\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nship = 0\r\nwhile not b==0:\r\n ship += int(a/b)\r\n a,b = b,a%b\r\nprint(ship)", "a, b = map(int, str.split(input()))\ncount = 0\nwhile a and b:\n\n a, b, count = b, a % b, count + a // b\n\nprint(count)\n", "f = input()\r\na, b = (int(x) for x in f.split())\r\ncount = 0\r\nwhile a != 0 and b != 0:\r\n count += a // b\r\n a, b = max(b, a % b), min(b, a % b)\r\nprint(count)\r\n", "ans = 0\r\na, b = map(int, input().split())\r\nif (a < b) :\r\n\ta, b = b, a\r\n\t\r\n\r\nwhile (b > 0) :\r\n\tans += a // b;\r\n\ta, b = b, a % b\t\r\n\r\nprint(ans)", "def calc(x, y, ans=0):\n\treturn ans if y == 0 else calc(y, x % y, ans + x // y)\n\n\na, b = map(int, input().split())\nprint(calc(a, b))\n", "n, m = map(int, input().rstrip().split(\" \"))\r\nc = 0\r\nwhile n * m != 0:\r\n if n < m:\r\n n, m = m, n\r\n c += n // m\r\n n = n % m\r\n\r\nprint(c)", "ins=input().split()\r\na=int(ins[0])\r\nb=int(ins[1])\r\nans=0\r\nwhile b!=0:\r\n ans+=a // b\r\n a=a % b\r\n if a<b:\r\n q=a\r\n a=b\r\n b=q\r\nprint(ans)\r\n", "'''\nCreated on May 5, 2016\n\n@author: Md. Rezwanul Haque\n'''\na,b = map(int,input().split())\nans = 0\nwhile a>0 and b>0:\n if a>=b:\n ans = ans + a//b\n a = a%b\n else:\n ans = ans + b//a \n b = b%a \nprint(ans)", "import math\r\n\r\nnum = input()\r\nnumlista = []\r\nnumlista = num.split(' ')\r\n\r\nif(int(numlista[0])>=int(numlista[1])):\r\n maior = int(numlista[0])\r\n menor = int(numlista[1])\r\nelse:\r\n maior = int(numlista[1])\r\n menor = int(numlista[0])\r\n\r\nresposta = 0\r\ncounter = 0\r\nwhile counter == 0:\r\n if(maior%menor == 0):\r\n resposta += maior/menor\r\n counter = 1 \r\n else:\r\n x = maior - (math.floor(maior/menor)*menor)\r\n resposta += math.floor(maior/menor)\r\n maior = menor\r\n menor = x\r\n \r\nprint(int(resposta))", "a, b = [int(x) for x in input().split()]\r\nc = 0\r\nwhile a > 0 and b > 0:\r\n if a > b:\r\n c += a // b\r\n a = a % b\r\n elif b > a:\r\n c += b // a\r\n b = b % a\r\nprint(c)\r\n", "v = [int(i) for i in input().split()]\r\na = min(v)\r\nb = max(v)\r\nc=0\r\nwhile a!=b and (a!=0 and b!=0):\r\n c+=b//a\r\n b=b%a\r\n b,a = max(a,b),min(a,b)\r\nprint(c)\r\n ", "R = lambda:list(map(int,input().split()))\r\na,b = R()\r\nx = 1\r\nwhile a != b:\r\n if a > 2*b:\r\n w = a // b\r\n if a % b == 0:\r\n w -= 1\r\n x += w\r\n a -= b * w\r\n else:\r\n a -= b\r\n x += 1\r\n if a < b:\r\n y = a\r\n a = b\r\n b = y\r\n\r\nprint(x)", "a, b = map(int, input().split())\nans = 0\n\nwhile a % b:\n ans += a // b\n b, a = a % b, b\n\nprint(ans + a // b)\n \t\t \t \t \t\t \t \t\t\t \t\t \t", "a, b = map(int, input().split())\n\nans = 0\nwhile a % b != 0:\n ans += a // b\n tmp = a\n a = b\n b = tmp % a\nans += a // b\nprint(ans)\n", "def main():\n\ta, b = map(int, input().split())\n\tcount = 0\n\twhile a % b != 0 :\n\t\tcount += (a//b)\n\t\t\n\t\ta = a % b\n\t\tif a < b:\n\t\t\ta, b = b, a\n\tcount += a // b\n\tprint(count )\n\nif __name__ == '__main__':\n\tmain()\n\t\t\n\n\n", "import sys,math\n\nfor line in sys.stdin:\n\ta=[]\n\tfor word in line.split():\n\t\ta.append(int(word))\n\tmayor=max(a[0],a[1])\n\tmenor=min(a[0],a[1])\n\tcont=0\n\tflag=0\n\twhile((mayor!=1 and menor!=1)):\n\t\tres=mayor%menor\n\t\tres1=int(mayor/menor)\n\t\tcont+=res1\n\t\tmayor=menor\n\t\tmenor=res\n\t\tif(mayor==0 or menor==0):\n\t\t\tflag=1\n\t\t\tbreak\n\tif(flag==1):\n\t\tprint(str(cont))\n\telse:\n\t\tcont+=mayor\n\t\tprint(str(cont))\n", "[a, b] = [int(i) for i in input().split()]\n\nn = 0\n\nwhile True:\n div = a // b\n n += div\n a -= div * b\n if a == 0:\n break\n a, b = b, a\n\nprint(n)\n\t\t\t \t \t \t \t \t\t\t \t \t\t \t \t\t\t", "entrada = [int(item) for item in input().split()]\n\na = entrada[0]\nb = entrada[1]\n\nships = 0\n\nwhile a > 0:\n a, b = max(a, b), min(a, b)\n ships += a//b\n a = a % b\n\nprint(ships)\n\n\t\t\t\t \t \t\t\t \t \t \t \t \t\t\t \t", "import math\nv = [int(i) for i in input().split()]\na = v[0]\nb = v[1]\nn = 0\nwhile a > 0 and b > 0:\n if a >= b:\n t = int(math.floor(a/b))\n a = a-t*b\n n+=t\n else:\n t = int(math.floor(b/a))\n b = b-t*a\n n+=t\nprint(n)\n\n \t\t\t\t \t\t\t \t\t \t\t\t\t\t\t \t \t\t \t \t \t", "def f(a, b):\n if a == b:\n return 1\n if b == 1:\n return a\n if a <= 0 or b <= 0:\n return 0\n r = 0\n while a > 0 and b > 0:\n if a >= b:\n r += a // b\n a = a % b\n else:\n r += b // a\n b = b % a\n return r\n \n \n\ndef main():\n return f(*list(map(int, input().split(' '))))\n\nprint(main())\n", "a, b = map(int, input().split())\r\nnum = 0\r\nwhile b > 0:\r\n temp = b\r\n num += (a // b)\r\n b = a % b\r\n a = temp\r\nprint(num)\r\n \r\n", "a, b = map(int, input().split())\r\nres = 0\r\na, b = max(a, b), min(a, b)\r\nwhile (b != 0):\r\n res += a // b\r\n a, b = b, a % b\r\nprint(res)", "[a, b] = [int(x) for x in input().split()]\n\nwynik = 0\nwhile b != 0:\n\twynik += a // b\n\ta %= b\n\t[a, b] = [b, a]\n\nprint(wynik)", "a=list(map(int,input().split()))\r\nc=0\r\nwhile (max(a)!=0) and ( max(a)%min(a)!=0 ):\r\n c+=max(a)//min(a)\r\n p=max(a)%min(a)\r\n a=[min(a),p]\r\nif max(a)%min(a)==0:\r\n c+=max(a)//min(a)\r\nprint(c) ", "#codeforces527A\r\ngi = lambda : list(map(int,input().strip().split()))\r\na, b = gi()\r\nans = 0\r\nwhile a and b:\r\n\ta, b = max(a, b), min(a, b)\r\n\tans += a//b\r\n\ta -= (a//b)*b\r\nprint(ans)", "ch = input()\r\nch = ch.split()\r\nch = [int(x) for x in ch]\r\na, b = max(ch), min(ch)\r\n\r\ni = 1\r\nwhile a != b:\r\n i += a // b\r\n a, b = max (a % b, b), min (a % b, b)\r\n if b == 0:\r\n b = a\r\n i -= 1\r\n\r\n\r\n\r\nprint(i)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 17:02\r\n\r\n\"\"\"\r\n\r\n# a, b\r\n# a-b, b\r\n# ... => b, a-kb\r\n#\r\n\r\ndef cal(a, b):\r\n if a < b:\r\n return cal(b, a)\r\n\r\n if a == b:\r\n return 1\r\n if a == 0 or b == 0:\r\n return 0\r\n\r\n k = a//b\r\n\r\n return k + cal(b, a-k*b)\r\n\r\n\r\n\r\na, b = map(int, input().split())\r\n\r\n\r\nprint(cal(a, b))", "#!/usr/bin/env python\n# paper.py - Codeforces 572A Paper 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\"\"\"\nAfter making a paper ship from the square piece, Vasya looked on the remaining\n(a-b) mm x b mm strip of paper. He got the idea to use this strip of paper\nin the same way to make an origami, and then use the remainder (if it exists)\nand so on. At the moment when he is left with a square piece of paper, he will\nmake the last ship from it and stop.\n\nCan you determine how many ships Vasya will make during the lesson?\n\nInput\n\nThe first line of the input contains two integers a, b (1<=b<a<10^12) -\nthe sizes of the original sheet of paper.\n\nOutput\n\nPrint a single integer - the number of ships that Vasya will make\n\n\"\"\"\n\n# Standard libraries\nimport unittest\nimport sys\nimport re\nimport random\n\n# Additional libraries\n\n\n###############################################################################\n# Paper Class\n###############################################################################\n\n\nclass Paper:\n \"\"\" Paper representation \"\"\"\n\n def __init__(self, args):\n \"\"\" Default constructor \"\"\"\n\n self.args = args\n self.cur = self.args\n self.num = 0\n\n def iterate(self):\n\n # Re-order with higher number first\n if self.cur[0] < self.cur[1]:\n self.cur = (self.cur[1], self.cur[0])\n\n # calculate\n self.num += self.cur[0] // self.cur[1]\n remainder = self.cur[0] % self.cur[1]\n self.cur = (remainder, self.cur[1])\n\n return 1 if remainder else 0\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n while self.iterate():\n pass\n return self.num\n\n###############################################################################\n# Executable code\n###############################################################################\n\n\ndef decode_inputs(inputs):\n \"\"\" Decoding input string tuple into base class args tuple \"\"\"\n\n # Decoding input into a tuple of integers\n ilist = [int(i) for i in inputs.split()]\n args = tuple(ilist)\n\n return args\n\n\ndef calculate(inputs):\n \"\"\" Base class calculate method wrapper \"\"\"\n return Paper(decode_inputs(inputs)).calculate()\n\n\ndef main():\n \"\"\" Main function. Not called by unit tests \"\"\"\n\n # Read test input string tuple\n inputs = (input())\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(decode_inputs(\"2 5\"), (2, 5))\n\n def test_Paper_class__basic_functions(self):\n \"\"\" Paper class basic functions testing \"\"\"\n d = Paper((1, 2))\n self.assertEqual(d.args[0], 1)\n\n # Iteration variable\n self.assertEqual(d.cur[0], 1)\n\n # Iterate on a square sheet, return 0 - finished\n d = Paper((2, 2))\n self.assertEqual(d.iterate(), 0)\n self.assertEqual(d.num, 1)\n\n # Iterate on a rect sheet, return 1 - not finished\n d = Paper((10, 3))\n self.assertEqual(d.iterate(), 1)\n self.assertEqual(d.cur, (1, 3))\n self.assertEqual(d.num, 3)\n\n def test_calculate(self):\n \"\"\" Main calculation function \"\"\"\n\n # Sample test 1\n self.assertEqual(calculate(\"2 2\"), 1)\n\n # Sample test 2\n self.assertEqual(calculate(\"10 3\"), 6)\n\n # Other tests\n self.assertEqual(calculate(\"10 7\"), 6)\n self.assertEqual(calculate(\"1000000000000 1\"), 1000000000000)\n\n\nif __name__ == \"__main__\":\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n main()\n", "s=input()\r\na,b=s.split(' ')\r\na,b=int(a),int(b)\r\nans=1\r\nwhile a!=b and a and b:\r\n if a<b:\r\n a,b=b,a\r\n d=a//b\r\n if a%b==0:\r\n d-=1\r\n ans+=d\r\n a,b=b,a-d*b\r\nprint(ans)\r\n \r\n", "a,b=map(int,input().split())\r\nif(a==b):\r\n print(\"1\")\r\n exit(0)\r\ncount=0\r\nwhile(a!=b):\r\n if(a>b):\r\n count+=int(a/b)\r\n a=a%b\r\n elif(b>a):\r\n count+=int(b/a)\r\n b=b%a\r\n if(a==0 or b==0):\r\n break\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nans = 0\r\nwhile n > 0 and m > 0:\r\n ans += n//m\r\n n, m = m, n % m\r\nprint(ans)", "a, b = [int(i) for i in input().split()]\r\n\r\nif a % b == 0:\r\n res = a//b\r\nelif b % a == 0:\r\n res = b // a\r\nelse:\r\n res = 0\r\n while a != b:\r\n a, b = max(a, b), min(a, b)\r\n res += a // b\r\n if a % b == 0:\r\n break\r\n else:\r\n a, b = b, a % b\r\n else:\r\n res += 1\r\nprint(res)\r\n", "def f(a,b,c):\r\n\tif b==0:\r\n\t\treturn c\r\n\tc+=a//b\r\n\treturn f(b,a%b,c)\r\na,b=map(int,input().split())\r\nprint(f(a,b,0))", "a, b = map(int, input().split())\r\ns = 0\r\nwhile b > 0:\r\n i = a//b\r\n m = b\r\n b = a-b*i\r\n a = m\r\n s += i\r\nprint(s)\r\n", "a, b = [int(i) for i in input().split()]\r\ncount = 0\r\nwhile a and b:\r\n if a > b:\r\n n, a = divmod(a, b)\r\n else:\r\n n, b = divmod(b, a)\r\n count += n\r\n\r\nprint(count)\r\n", "entrada = str(input()).split(' ')\na = int(entrada[0])\nb = int(entrada[1])\nships = 0\nwhile a >= 1:\n if a < b:\n aux = a\n a = b\n b = aux\n ships = ships + int(a/b)\n a = a % b\nprint(ships)\n\n\t\t \t\t \t \t \t\t\t \t\t \t\t\t\t \t \t", "a,b = map(int, input().split())\nn = 0\nwhile (a%b>0):\n\tn+= a//b\n\tc = a%b\n\ta = b\n\tb = c\nif (a%b==0):\n\tn+=a//b\nprint(n)", "a, b = map(int, input().split())\n\ndef solve(x, y):\n\tif (x == 0):\n\t\treturn 0\n\tif (y < x):\n\t\treturn solve(y, x)\n\tif (y == x):\n\t\treturn 1\n\tsq = y // x\n\treturn sq + solve(x, y - sq * x)\n\nsol = solve(a, b)\nprint(sol)\n", "'''input\r\n10 7\r\n'''\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter as ccd\r\nfrom itertools import permutations as pp\r\nfrom itertools import combinations as cc\r\nfrom random import randint as rd\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nimport heapq as hq\r\nimport math \r\n'''\r\nAuthor : dhanyaabhirami\r\nHardwork beats talent if talent doesn't work hard\r\n'''\r\n'''\r\nStuck?\r\nSee github resources\r\nDerive Formula\r\nKmcode blog\r\nCP Algorithms Emaxx\r\n'''\r\nmod=pow(10,9) +7\r\ndef inp(flag=0):\r\n if flag==0:\r\n return list(map(int,input().strip().split(' ')))\r\n else:\r\n return int(input())\r\n\r\n# Code credits\r\n# assert(debug()==true)\r\n# for _ in range(int(input())):\r\n\r\na,b=inp()\r\n# a=max(a,b)\r\n# b=min(a,b)\r\nships = 0\r\nwhile a>0 and b>0:\r\n if a>=b:\r\n ships+=a//b\r\n a = a%b\r\n else:\r\n ships+=b//a\r\n b=b%a\r\n\r\nprint(ships)", "a,b=map(int,input().split())\r\ns=0\r\nt=0\r\nwhile(b):\r\n t=b\r\n s=s+a//b\r\n b=a%b\r\n a=t\r\n\r\nprint(s)", "a,b = map(int, input().split())\r\nkol=0\r\nwhile b!=0:\r\n kol += a//b\r\n a = a%b\r\n if a<b:\r\n a,b = b,a\r\nprint(kol)", "a, b = [int(i) for i in input().split()]\r\n\r\nships = a // b\r\nwhile a % b != 0:\r\n\ta, b = b, a % b\r\n\tships += a // b\r\n\r\nprint(ships)", "a,b = map(int,input().split())\r\nori = 0\r\nwhile a>0 and b>0:\r\n if a>b:\r\n ori = ori + a//b\r\n a = a%b\r\n else:\r\n ori = ori + b//a\r\n b = b%a\r\nprint(ori)\r\n", "def main():\r\n x, y = map(int, input().split())\r\n squares = 0\r\n while x != 0 and y != 0:\r\n if x < y:\r\n squares += y//x\r\n y -= (y//x)*x\r\n else:\r\n squares += x//y\r\n x -= (x//y)*y\r\n print(squares)\r\n\r\nmain()", "total = 0\r\n\r\ndef origami(a,b):\r\n global total\r\n if (a % b == 0):\r\n total += int(a / b)\r\n return False\r\n else:\r\n if(a/b>1):\r\n total += int((a-a%b)/b)\r\n origami(max(b,a%b),min(b,a%b))\r\n else:\r\n total += 1\r\n origami(max(b,a-b),min(b,a-b))\r\n\r\na, b = map(int,input().split())\r\norigami(a,b)\r\nprint(total)\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nl=0\r\nx,y=a,b\r\nwhile(1):\r\n if(x==y):\r\n print (l+1)\r\n break\r\n else:\r\n if(x<y):\r\n x,y=y,x\r\n l+=(x//y)\r\n if(x%y!=0):\r\n x=x-(x//y)*y\r\n else:\r\n print(l)\r\n break\r\n", "def cnt(a, b):\r\n if (a < b):\r\n a, b = b, a\r\n if b == 0:\r\n return 0\r\n if a == b:\r\n return 1\r\n return a // b + cnt(b, a % b)\r\n\r\na, b = map(int, input().split())\r\nprint(cnt(a, b))", "a, b = [int(i) for i in input().split()]\n\ntotal = 0\n\nwhile b > 0:\n total += a//b\n b, a = a%b, b\n\nprint(total)\n", "a, b = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nwhile (b > 0):\r\n count += a // b\r\n max_side = max(b, a % b)\r\n min_side = min(b, a % b)\r\n a = max_side\r\n b = min_side\r\n\r\nprint(count)# 1690488201.0509486", "a,b=map(int,input().split());k=0\nwhile b:k+=a//b;a,b=b,a%b\nprint(k)", "def gao(a, b):\n\tif b == 0:\n\t\treturn 0\n\treturn gao(b, a%b) + a // b\n\n\nn, m = list(map(int, input().split()))\nprint(gao(n, m))\n", "s = str(input()).split()\na = int(s[0])\nb = int(s[1])\nr = 0\nwhile (0 != b):\n d = a // b\n r += d\n a, b = b, a - b * d\n if (b > a):\n a, b = b, a\nprint(r)\n\n\n \t \t \t\t \t\t \t\t \t \t\t \t \t\t\t\t\t", "a,b=map(int,input().split())\r\nc=0\r\nwhile a>0 and b>0:\r\n\tif a>=b:\r\n\t\tc+=a//b\r\n\t\ta%=b\r\n\telse:\r\n\t\tc+=b//a\r\n\t\tb%=a\r\nprint(c)", "a, b = [int(elem) for elem in input().split()]\r\ncount = 0\r\ntemp = 0\r\nwhile (a and b):\r\n if (a > b):\r\n temp = a % b\r\n a //= b\r\n count += a\r\n a = temp\r\n else:\r\n temp = b % a\r\n b //= a\r\n count += b\r\n b = temp\r\nprint(count)" ]

[ "n, a = [int(next_token) for next_token in input().split()]\r\nd = [int(next_token) for next_token in input().split()]\r\ns = sum(d)\r\nans = []\r\nfor i in range(n):\r\n k_min = max(a - s + d[i], 1)\r\n k_max = min(a - n + 1, d[i])\r\n ans.append(k_min - 1 + d[i] - k_max)\r\nprint(' '.join(map(str, ans)))", "n, a = map(int, input().split())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\n\r\ndef solve():\r\n for x in d:\r\n yield max(x - (a - n + 1), 0) + max(a - (s - x) - 1, 0)\r\n\r\nprint(' '.join(map(str, solve())))\r\n", "r = lambda: map(int, input().split())\r\n(n, a), d = r(), list(r()); s = sum(d)\r\n[print(i - min(a - n + 1, i) + max(a - s + i, 1) - 1, end = ' ') for i in d]", "n, A = map(int, input().split())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\nfor i in range(n):\r\n k = max(A + d[i] - s - 1, 0)\r\n l = max(d[i] - A + n - 1, 0)\r\n print(k + l, end = ' ')\r\n\r\n", "import sys\ndef input(): return sys.stdin.readline().strip()\n\nn, A = map(int, input().split())\na = [int(i) for i in input().split()]\n\ntotal = sum(a)\nfor i in range(n):\n\tl = A - (total - a[i])\n\tr = A - (n-1)\n\n\tprint(max(0, l - 1) + max(0, a[i] - r), end=\" \")\n\nprint()", "s=input().split()\r\nn=int(s[0]);a=int(s[1]);d=[];sum=0\r\ns=input().split()\r\nfor i in range(n):\r\n d.append(int(s[i]));sum=sum+d[i]\r\nfor i in range(n):\r\n print(max(0,d[i]+n-a-1)+max(0,a-sum+d[i]-1),end=\" \")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, a = map(int, input().split())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\nans = []\r\nfor i in d:\r\n u, v = n - 1, s - i\r\n l, r = max(a - v, 1), min(a - u, i)\r\n ans0 = i - (r - l + 1)\r\n ans.append(ans0)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n,a = map(int,input().split())\r\nd = list(map(int,input().split()))\r\nx = sum(d)\r\nb = []\r\nfor i in range(n):\r\n x -= d[i]\r\n dif = 0\r\n if a>x:\r\n dif = a-x-1\r\n if a-n+1<d[i]:\r\n dif += d[i]-a+n-1\r\n if x==0:\r\n dif = d[i]-1\r\n b.append(dif)\r\n x += d[i]\r\nprint(' '.join(map(str,b)))", "[n,A]=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\ntot=0\r\nfor x in a:\r\n\ttot+=x\r\nfor x in a:\r\n\tup=min(x,A-(n-1))\r\n\tdown=max(A-(tot-x),1)\r\n\t#print(up,down)\r\n\tprint(x-(up-down+1),end=\" \")\r\nprint()", "n, A = map(int, input().split())\nd = list(map(int, input().split()))\n\ns = 0\nfor x in d:\n s += x\n\nfor i in range(n):\n print(d[i] - (min(d[i], A - n + 1) - max(A - s + d[i], 1) + 1), end=' ')\n", "from sys import stdin ,stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn,m=map(int,input().split()) ; arr=list(map(int,input().split())) ; arr2=[]; Msumm=0 ; msumm=n\r\nfor i in range(n):\r\n if arr[i]>=m:\r\n arr2.append(m-(n-1))\r\n else:\r\n arr2.append(arr[i])\r\n Msumm+=arr2[i]\r\nfor i in range(n):\r\n l=1 ; r=arr[i]\r\n val=msumm-1\r\n while l<=r:\r\n mid=(l+r)//2\r\n if mid +val <=m:\r\n a=mid\r\n l=mid+1\r\n else:\r\n r=mid-1\r\n l=1 ; r=arr[i] ; val=Msumm-arr2[i]\r\n while l<=r:\r\n mid=(l+r)//2\r\n if val+mid>=m:\r\n b=mid\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n print(b-1+arr[i]-a,end=\" \")\r\n \r\n", "\r\nimport sys\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n, target_sum = (int(i) for i in read().split())\r\n dice_values: list[int] = [int(i) for i in read().split()]\r\n # Max possible sum of all dices\r\n s: int = sum(dice_values)\r\n\r\n result: list[str] = []\r\n # Iter over every dice\r\n for d_i in dice_values:\r\n # right inclusive bound of valid x (x <= a - n + 1)\r\n # Note that right bound cannot be larger than d_i, so we constrain it\r\n x_right_bound = min(target_sum - n + 1, d_i)\r\n\r\n\r\n # left inclusive bound A - s + d_i <= s)\r\n # Note that smallest value cannot be less than 1\r\n x_left_bound = max(target_sum - s + d_i, 1)\r\n\r\n # Invalid values (every val that is not within the valid range)\r\n invalid_values = d_i - (x_right_bound - x_left_bound + 1)\r\n result.append(str(invalid_values))\r\n print(' '.join(result))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, A = map(int, input().split())\r\nd = list(map(int, input().split()))\r\n\r\nmax_sum = sum(d)\r\n\r\nresult = [None] * n\r\nfor i in range(0, n):\r\n upper_bound = min(d[i], A - (n - 1))\r\n lower_bound = max(1, A - (max_sum - d[i]))\r\n \r\n possible_values_count = (upper_bound - lower_bound) + 1\r\n impossible_value_count = d[i] - possible_values_count\r\n \r\n result[i] = impossible_value_count\r\n \r\nprint(*result)", "from sys import stdin\n\ninput = stdin.readline\n\nn, A = map(int, input().split())\nd = [int(x) for x in input().split()]\n\ns = sum(d)\n\nres = [x - max(0, min(x, A - n + 1) - max(1, A - s + x) + 1) for x in d]\nprint(*res)\n", "n, A = [int(i) for i in input().split()]\nd = [int(i) for i in input().split()]\ns = sum(d)\nans = []\nfor dd in d:\n left = max(0, A-s+dd)\n right = min(dd, A-n+1)\n cnt = 0\n if left > 1:\n cnt += left-1\n if right < dd:\n cnt += dd-right\n ans.append(cnt)\nprint(' '.join([str(i) for i in ans]))\n", "def getIntersection(l1, r1, l2, r2):\r\n ans = -1\r\n\r\n if l1 > l2:\r\n l1, l2 = l2, l1\r\n r1, r2 = r2, r1\r\n\r\n if l2 > r1: ans = 0\r\n elif r2 >= r1: ans = r1 - l2 + 1\r\n else: ans = r2 - l2 + 1\r\n \r\n return ans\r\n\r\ndef solve(d, a):\r\n total = sum(d)\r\n n = len(d)\r\n\r\n ans = []\r\n for i in d:\r\n l, r = n-1, total-i\r\n tgtl, tgtr = a-i, a-1\r\n intersect = getIntersection(l, r, tgtl, tgtr)\r\n ans.append(i-intersect) \r\n\r\n return ans\r\n\r\nn, a = (int(x) for x in input().split())\r\nd = [int(x) for x in input().split()]\r\nprint(*(i for i in solve(d, a)))\r\n", "n, a = [int(i) for i in input().split()]\r\nd = [int(i) for i in input().split()]\r\ns = sum(d)\r\nm = a - n + 1\r\n\r\nfor i in range(n):\r\n el = d[i]\r\n col = 0\r\n end = ' ' if i < n - 1 else ''\r\n ss = s - el\r\n col += max(0, a - ss - 1)\r\n col += max(0, el - m)\r\n print(col, end=end)", "from collections import defaultdict,Counter,deque\nimport math\nimport bisect\nfrom itertools import accumulate\nfrom math import ceil, log,gcd\nfrom functools import lru_cache\nfrom sys import stdin, stdout\nimport time\nimport atexit\nimport io\nimport sys\nimport string\n\n\n\n\n\n\n\ndef write(*args, **kwargs):\n sep = kwargs.get('sep', ' ')\n end = kwargs.get('end', '\\n')\n stdout.write(sep.join(str(a) for a in args) + end)\n\ndef read():\n return stdin.readline().rstrip()\n\n\n\nn,k =[*map(int,read().split())]\nx = [*map(int,read().split())]\n\n\ndef get(a,b,c,d):\n return max(0, min(b,d)-max(a,c)+1)\n\n\nmns = n\nmxs = sum(x)\n\nret = []\n\nfor z in x:\n t0 = mns-1\n t1 = mxs-z\n \n t2 = k-z\n t3 = k-1\n ret.append(z-get(t0,t1,t2,t3))\n \n\nwrite(*ret)\n\n\n\n\n# total = int(read())\n# for i in range(total):\n# n,k =[*map(int,read().split())]\n \n# a = ([*map(int,read().split())])\n \n# dp = [[0 for j in range(k)] for i in range(n+1)]\n# dp[0][0] = 1\n \n# for i in range(n):\n# for j in range(k):\n# if dp[i][j] ==1:\n# dp[i+1][(j+a[i])%k] = 1\n# dp[i+1][(j-a[i])%k] = 1\n# if dp[n][0]:\n# print('Divisible')\n# else:\n# print('Not divisible')", "n, A = [int(x) for x in input().split(' ')]\r\nd = [int(x) for x in input().split(' ')]\r\n\r\nS = sum(d)\r\np = []\r\nfor dice in d:\r\n q = 0\r\n q += max(dice - (A - (n - 1)), 0)\r\n q += max(0, A - (S - dice) - 1)\r\n\r\n p.append(q)\r\nprint(*p)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\ndef inp(): #int input\r\n return(int(input()))\r\ndef inlt(): #int list input\r\n return(list(map(int,input().split())))\r\ndef insr(): #string input (list of chars)\r\n s = input()\r\n return(list(s[:-1]))\r\ndef invr(): #space separated ints\r\n return(map(int,input().split()))\r\n\r\nt = 1\r\nfor _ in range(t):\r\n\tn, A = invr()\r\n\td = inlt()\r\n\t\r\n\ts = sum(d)\r\n\t\r\n\tret = []\r\n\tfor i in range(n):\r\n\t\t#in the best case, how low can we go?\r\n\t\tremaining = A - (s - d[i])\r\n\t\tif remaining < 1:\r\n\t\t\tret += [0]\r\n\t\telse:\r\n\t\t\tret += [remaining - 1]\r\n\t\t\t\r\n\t\t#print(ret)\r\n\t\t#in the worst case, how high can we go?\r\n\t\tremaining = A - (n - 1)\r\n\t\tif remaining <= d[i]:\r\n\t\t\tret[-1] += d[i] - remaining\r\n\t\t#print(ret)\r\n\t\r\n\tprint(*ret)\r\n\t\t\t\r\n\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, A = map(int, input().split())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\n\r\nfor i in range(n):\r\n l = max(1, d[i]-s+A)\r\n r = min(d[i], -n+1+A)\r\n \r\n if l<=r:\r\n ans = d[i]-(r-l+1)\r\n else:\r\n ans = d[i]\r\n \r\n if i<n-1:\r\n print(ans, end=' ')\r\n else:\r\n print(ans)", "[n, A] = [int(x) for x in input().split()]\n\nd = [0] + [int(x) for x in input().split()]\n\nsigma = sum(d)\n\nans = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n at_least = A - sigma + d[i] - 1\n at_least = max(at_least, 0)\n ans[i] += at_least\n\n at_most = d[i] - A + n - 1\n at_most = max(at_most, 0)\n ans[i] += at_most\n\nans = ans[1:]\nans = [str(x) for x in ans]\nprint(\" \".join(ans))\n\n\n\n\n\n\n\n\n\n\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,a = map(int, input().split())\r\nD = list(map(int, input().split()))\r\n\r\ntotal = sum(D)\r\nans = []\r\nfor i in range(N):\r\n t = total-D[i]\r\n mi,ma = max(1,a-t),min(D[i],a-(N-1))\r\n #print(D[i],mi,ma)\r\n tmp = D[i]-ma+mi-1\r\n ans.append(tmp)\r\nprint(*ans)", "n,A = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ns = sum(arr)\r\nfor i in range(n):\r\n v = s-arr[i]\r\n if n-1>=A:\r\n print(arr[i],end=' ')\r\n else:\r\n print(arr[i]-((min(A-(n-1),arr[i]))-max(1,A-v)+1),end=' ')", "# import sys\n# input = sys.stdin.readline\n\nimport math\n\n\ndef solve():\n # n = int(input())\n n, A = list(map(int, input().split(\" \")))\n d = list(map(int, input().split(\" \")))\n S = sum(d)\n\n # if n == 1:\n # print(d[0] - 1)\n # return\n\n impossible = [0] * n\n for i, v in enumerate(d):\n low = n - 1\n high = S - v\n minOkD = min(v, A - low)\n maxOkD = max(1, A - high)\n # good range: [maxOkD, minOkD]\n impossible[i] = (maxOkD - 1) + (v - minOkD)\n\n print(\" \".join(map(str, impossible)))\n\n\nt = 1\nif False:\n t = int(input())\nfor _ in range(t):\n solve()\n", "n, a = map(int, input().split())\r\nd = list(map(int, input().split()))\r\ns = sum(d)\r\nb = [0]*n\r\nfor i in range(n):\r\n b[i] += max(d[i] - a + n - 1, 0)\r\n b[i] += max(d[i] - s + a - 1, 0)\r\nprint(' '.join(str(i) for i in b))\r\n", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n, s = map(int, stdin.readline().split())\r\n ar = list(map(int, stdin.readline().split()))\r\n total = sum(ar)\r\n ans = [0] * n\r\n for i in range(n):\r\n curr_total = total - ar[i]\r\n max_x = min(ar[i], s - (n - 1))\r\n min_x = max(1, s - curr_total)\r\n ans[i] = ar[i] - (max_x - min_x + 1)\r\n print(*ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, A = map(int,input().split())\r\nkosti = list(map(int,input().split()))\r\nsumm = 0\r\ntemp = 0\r\nfor i in kosti:\r\n summ += i\r\nfor i in kosti:\r\n temp = summ - i\r\n temp2 = min(A-(n-1),i)\r\n ans = i - temp2 + max(0,A - temp - 1)\r\n print(ans,end=\" \")\r\n", "n, a=[int(k) for k in input().split()]\r\nw=[int(k) for k in input().split()]\r\nz=sum(w)\r\nres=[]\r\nfor j in w:\r\n eta=max(0, a-(z-j)-1)\r\n eta+=max(0, j-a+(n-1))\r\n res.append(eta)\r\nprint(\" \".join([str(k) for k in res]))", "n, A = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n sum += d[i]\r\nfor i in range(n):\r\n left = max(1, A - (sum - d[i]))\r\n right = min(d[i], A - (n - 1))\r\n ans = d[i] - (right - left + 1)\r\n print(ans)\r\n", "n,A=map(int,input().split())\nf=list(map(int,input().split()))\nsumf=sum(f)\nfor i in range(n):\n lma=min(f[i],A-n+1)\n lmi=max(1,A-sumf+f[i])\n if lma>=lmi:\n print(f[i]-(lma-lmi+1),end=\" \")\n else:\n print(0,end=\" \")\n \t \t\t\t\t \t\t\t \t\t\t \t \t\t\t\t\t\t \t", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n\r\n# n,m=map(int,input().split())\r\n# arr=list(map(int, input().split()))\r\n\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\n\r\n\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\n\r\ndef main():\r\n n,a=map(int,input().split())\r\n arr=list(map(int, input().split()))\r\n s=sum(arr)\r\n ans=[0]*(n)\r\n for i in range(n):\r\n ub=min((a-n+1),arr[i])\r\n lb=max(1,(a-s+arr[i]))\r\n ans[i]=min(arr[i],max(0,arr[i]-(ub-lb+1)))\r\n print(*ans)\r\nmain()", "n,a=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nMs=sum(d)\r\nms=n\r\nans=[]\r\nfor i in range(n):\r\n Mss=Ms-d[i]\r\n mss=n-1\r\n ans.append(max(a-Mss-1,0)+max(d[i]-a+mss,0))\r\nprint(*ans)", "#!/usr/bin/env python3\r\n\r\nfrom sys import stdin, stdout\r\nfrom math import *\r\nfrom itertools import *\r\n\r\nlmap = lambda x, y: list(map(x, y))\r\nlfilter = lambda x, y: list(filter(x, y))\r\n\r\ndef solve(test):\r\n inp = lmap(int, test.strip().split())\r\n n, s = inp[:2]\r\n d = inp[2:]\r\n ans = [0 for _ in range(n)]\r\n max_value = s - n + 1\r\n total_values = sum(d)\r\n for i in range(n):\r\n \tans[i] += min(max(0, d[i] - max_value), d[i])\r\n \tmin_value = s - (total_values - d[i])\r\n \tans[i] += min(max(0, min_value - 1), d[i])\r\n return \" \".join(map(str, ans))\r\n \r\nstdout.write(str(solve(stdin.read())))\r\n", "def readline():\r\n return [int(c) for c in input().split()]\r\n\r\n\r\ndef main():\r\n n, A = readline()\r\n d = readline()\r\n\r\n tot = sum(d)\r\n x = A - n + 1\r\n y = A - tot\r\n ans = (di - min(x, di) + max(y + di, 1) - 1 for di in d)\r\n print(*ans)\r\n\r\n\r\nmain()", "def readline():\r\n return [int(c) for c in input().split()]\r\n\r\n\r\ndef main():\r\n n, A = readline()\r\n d = readline()\r\n\r\n tot = sum(d)\r\n ans = [di - min(A - n + 1, di) + max(A - tot + di, 1) - 1 for di in d]\r\n\r\n print(*ans)\r\n\r\n\r\nmain()", "n, a = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nmaxx = sum(d)\r\nminn = n - 1\r\nfor i in range(n):\r\n l = 1\r\n r = d[i]\r\n ansl = r+1\r\n maxx-=d[i]\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if a - mid <= maxx:\r\n r = mid - 1\r\n ansl=mid\r\n else:\r\n l = mid + 1\r\n l = 1\r\n r = d[i]\r\n ansr = l-1\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if a - mid >= minn:\r\n l = mid + 1\r\n ansr = mid\r\n else:\r\n r = mid - 1\r\n maxx+=d[i]\r\n print(d[i]-(ansr-ansl+1), end=' ')\r\n\r\n\r\n", "R = lambda:map(int,input().split())\r\nn,a = R()\r\nb = list(R())\r\nsum = 0\r\nfor i in range(n):\r\n sum += b[i]\r\nfor i in range(n):\r\n print(b[i]-min(b[i],a-n+1)+max(1,a-sum+b[i])-1),\r\n\r\n\r\n", "n, A = map(int, input().split())\r\nd = list(map(int, input().split()))\r\n\r\ns = sum(d)\r\nfor i in d:\r\n lb = max(1, A - (s - i))\r\n ub = min(i, A - (n - 1))\r\n possible = ub - lb + 1\r\n impossible = i - possible\r\n print(impossible, end=' ')", "n, a = map(int, input().split())\r\nld = list(map(int, input().split()))\r\ns = sum(ld)\r\nres = []\r\nfor d in ld:\r\n l = max(a - (s - d), 1)\r\n r = min(a - (n - 1), d)\r\n # print(l, r)\r\n res.append(d - (r - l + 1))\r\nprint(' '.join(map(str, res)))\r\n", "n, A = map(int, input().split())\r\nd = list(map(int, input().split()))\r\n\r\ns = sum(d)\r\nsol = []\r\nfor di in d:\r\n min_d = max(1, A - (s-di))\r\n max_d = min(di, A - (n-1))\r\n sol.append(di - max_d + min_d - 1)\r\n\r\nprint(' '.join(map(str, sol)))\r\n", "n,a=map(int, input().split())\nans=0\nsum=0\nb=list(map(int, input().split()))\nfor i in range(n):\n sum=sum+b[i]\nfor i in range(0,n):\n ans=0\n x = a-n+1\n if x<b[i]:\n ans += b[i]-x\n x = a-(sum-b[i])\n if x>1:\n ans=ans+x-1\n if i!=n-1:\n print(ans,end=' ')\n else :\n print(ans)", "import math\r\nfrom os import startfile\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\n\r\n\r\n\r\ndef main(arr,a):\r\n\r\n s=sum(arr)\r\n ans=[]\r\n for i in range(len(arr)):\r\n x,y=0,0 \r\n\r\n sub_sum=s-arr[i] \r\n x=a-sub_sum \r\n y=a-(len(arr)-1)\r\n val=0\r\n \r\n if y+1<=arr[i]:\r\n val+=(arr[i]-y)\r\n if x-1>=1:\r\n val+=(x-1)\r\n ans.append(val)\r\n \r\n \r\n \r\n print(*ans)\r\n return \r\n\r\nn,a=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nmain(arr,a)", "n, k = map(int, input().split())\r\nd = list(map(int, input().split()))\r\ntot, res = sum(d), []\r\nfor i in range(n):\r\n x = max(0, k + d[i] - tot - 1)\r\n y = max(0, -k + d[i] + n - 1)\r\n res.append(x+y)\r\nprint(*res)\r\n", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n n, A = [int(num) for num in input().split()]\r\n d = [int(num) for num in input().split()]\r\n s = sum(d)\r\n ans = [0 for i in range(n)]\r\n dn = A - n\r\n ds = s - A\r\n for i, di in enumerate(d):\r\n y1 = max(0, di - dn - 1)\r\n y2 = max(0, di - ds - 1)\r\n ans[i] = min(di, y1 + y2)\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, A = map(int, input().split())\nds = list(map(int, input().split()))\ntotal = sum(ds)\n\nothers_max = [total - d for d in ds]\nothers_min = n - 1\n\nmins = [max(A - o - 1, 0) for o in others_max]\nfor i in range(n):\n\tif ds[i] > A - others_min:\n\t\tmins[i] += ds[i] - (A - others_min)\nprint(' '.join(map(str, mins)))\n", "n,a=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nif n==1:\r\n print(l[0]-1)\r\nelse:\r\n ans=[]\r\n diff=s-a\r\n for i in range(n):\r\n le=max(1,a-(s-l[i]))\r\n ri=min(a-(n-1),l[i])\r\n ans.append(l[i]-(ri-le+1))\r\n print(*ans)\r\n\r\n", "n,a=map(int,input().split())\r\nd=[*map(int,input().split())]\r\nfrom sys import exit\r\nif n==1:print(d[0]-1);exit()\r\ns=sum(d)\r\nmn=n-1\r\nanswer=[]\r\nfor i,x in enumerate(d):\r\n mx=s-x\r\n res=0\r\n if mx<a:res+=(a-mx-1)\r\n if mn+x>a:res+=(mn+x-a)\r\n answer.append(res)\r\nprint(*answer)", "n, A = [int(x) for x in input().split()]\nd = [int(x) for x in input().split()]\ns = sum(d)\nfor i in range(n):\n min_d_i = max(1, A - (s - d[i]))\n max_d_i = min(d[i], A - (n - 1))\n print(d[i] - max_d_i + min_d_i - 1, end = ' ')\n", "n,s=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=[]\r\ng=sum(arr)\r\nfor el in arr:\r\n t=s-(n-1)\r\n res=max(0,el-t)\r\n g1=g-el\r\n e=g1\r\n need=0\r\n need=s-min(s-1,e)-1\r\n \r\n ans.append(need+res)\r\nprint(*ans)", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nn, a = map(int, inp().split())\r\narr = [int(x) for x in inp().split()]\r\ns = sum(arr)\r\nans = [0]*n\r\nfor i, d, in enumerate(arr):\r\n ans[i] = d - min(a-n+1, d) + max(a-s+d, 1) - 1\r\n\r\nprint(*ans)\r\n", "def main():\r\n n, A = list(map(int, input().split()))\r\n C = list(map(int, input().split()))\r\n Csum = sum(C)\r\n for i in range(n):\r\n if i: print(\" \",end=\"\")\r\n cantup = max(0, C[i] - (A - (n - 1)))\r\n otherssum = Csum - C[i]\r\n cantlow = A - min(otherssum, A - 1) - 1\r\n print(cantup + cantlow,end=\"\")\r\n print()\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, A = map(int, input().split())\r\nd, ans = list(map(int, input().split())), []\r\ns = sum(d)\r\nfor di in d:\r\n min_d, max_d = max(A - max(s - di, 0), 1), min(s - (n - 1), di, A - (n - 1))\r\n ans.append(str(min_d - 1 + di - max_d))\r\nprint(\" \".join(ans))", "n , m = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\ns = sum(lis)\r\nfor i in range(n):\r\n t = s-lis[i]\r\n z=n-1\r\n ans = max(0,m-t-1)\r\n ans+=max(0,lis[i]-m+z)\r\n print(ans,end=' ')", "n, A = map(int, input().split())\r\nd = [int(x) for x in input().split()]\r\ns = sum(d)\r\nprint(' '.join([str(x - min(x, A - n + 1) + max(1, A - s + x) - 1) for x in d]))", "#!/usr/bin/python3\r\n\r\nimport sys\r\n\r\nn, A = list(map(int, sys.stdin.readline().split()))\r\nd = list(map(int, sys.stdin.readline().split()))\r\n\r\ns = sum(d)\r\n\r\nfor x in d:\r\n z = min(A - n + 1, x) - max(1, A - s + x) + 1\r\n if z < 0:\r\n z = 0\r\n sys.stdout.write(\"%d \" % (x - z))\r\n\r\nsys.stdout.write('\\n')\r\n", "'''input\n2 3\n2 3\n'''\nimport math\nfrom sys import stdin, stdout\n\n\n\n# main starts\nn, a = list(map(int, stdin.readline().split()))\narr = list(map(int, stdin.readline().split()))\nSUM = sum(arr)\nans = []\nfor i in range(n):\n\tremain_max = SUM - arr[i]\n\tremain_min = n - 1\n\thigh = min(arr[i], a - remain_min)\n\tlow = max(1, a - remain_max)\n\tans.append(arr[i] - (high - low + 1))\nprint(*ans)", "def main():\r\n n, A = (int(i) for i in input().split())\r\n di = [int(i) for i in input().split()]\r\n sdi = sum(di)\r\n\r\n for d in di:\r\n print(max(1, A - sdi + d) - 1 + max(0, d - A + n - 1))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef solve(n, a, dice):\n sm = a\n mx = sum(dice)\n ans = []\n for d in dice:\n diff = (mx - d) - sm\n total = 0\n if diff < 0:\n total += abs(diff) - 1\n\n smdiff = (sm) - (n - 1) - d\n if smdiff < 0:\n total += abs(smdiff)\n ans.append(total)\n return ans\n\n\ndef printOutput(ans):\n for ele in ans:\n sys.stdout.write(str(ele) + \" \") # add to me\n\n\ndef readinput():\n n, A = getInts()\n dice = list(getInts())\n printOutput(solve(n, A, dice))\n\n\nreadinput()\n", "def main():\n n, a = map(int, input().split())\n dd = list(map(int, input().split()))\n lo = sum(dd) - a + 1\n hi = a - n + 1\n for i, d in enumerate(dd):\n dd[i] = (d - hi if d > hi else 0) + (d - lo if d > lo else 0)\n print(' '.join(map(str, dd)))\n\n\nif __name__ == '__main__':\n main()\n", "n,s=input().strip().split(\" \")\r\nn,s=[int(n),int(s)]\r\n\r\na=list(map(int,input().strip().split(\" \")))\r\np=s-(n-1)\r\nd=[]\r\nr=min(a)\r\nkpq=sum(a)\r\n\r\nfor j in a:\r\n pp=s-kpq+j\r\n if pp<=0:\r\n pp=1\r\n kp=min(p,j)\r\n if kp-pp<0:\r\n d.append(0)\r\n else:\r\n d.append(j-(kp-pp+1))\r\n\r\nprint(*d)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, A = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nx = sum(w)\r\nfor i in w:\r\n a = A - (x-i)\r\n b = A - (n-1)\r\n if a > i:\r\n print(0, end=' ')\r\n else:\r\n print(i-(min(b, i)-max(a, 1)+1), end=' ')\r\n", "# link: https://codeforces.com/contest/534/submission/61924545\r\n# link: https://codeforces.com/contest/534/problem/C\r\n\r\nfor _ in range(1):\r\n n, A = map(int, input().split())\r\n dices = list(map(int, input().split()))\r\n dice_sum = sum(dices)\r\n for i in range(n):\r\n # I take maximum and others take minimum\r\n max_afford = max(0, dices[i]-(A-(n-1)))\r\n # I take minimum and others take maximum\r\n others_max = dice_sum - dices[i]\r\n min_afford = A - min(others_max, A-1) - 1\r\n dices[i] = max_afford + min_afford\r\n print(*dices) ", "#! /usr/bin/python3\r\n\r\n#http://codeforces.com/contest/534/problem/C\r\n\r\nn, sum = map(int, input().split())\r\nt = input().split()\r\narray = [0] * n\r\nfor i in range(0, n):\r\n array[i] = int(t[i])\r\n\r\ntotal = 0\r\nfor i in range(0, n):\r\n total = total + array[i]\r\n \r\nfor i in range(0, n):\r\n k = total - array[i]\r\n top = sum - (n - 1)\r\n below = sum - k\r\n if below <= 0:\r\n below = 1\r\n if top > array[i]:\r\n top = array[i]\r\n print(array[i] - top + below - 1, end=' ')\r\n \r\nprint()", "n,a=[int(x) for x in input().split()]\nval=[int(x) for x in input().split()]\nvsum=0\nfor i in val:\n\tvsum+=i\nans=[0]*n\nfor i in range(n):\n\tif a-(vsum-val[i])>1:\n\t\tans[i]+=a-(vsum-val[i])-1\n\tif val[i]>a-n+1:\n\t\tans[i]+=val[i]-(a-n+1)\nfor i in ans:\n\tprint(i,end=' ')\n", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\nn,s = Neo()\r\nA = Neo()\r\ntot = sum(A)\r\nAns = []\r\nfor i in A:\r\n t = i - min(i,s-n+1)\r\n k = tot-i\r\n t += max(0,s-k-1)\r\n Ans.append(t)\r\nprint(*Ans) ", "n, s = map(int, input().split())\na = list(map(int, input().split()))\n\ntotal = sum(a)\n\nans = []\nfor i in range(n):\n high = s - (total - a[i])\n low = s - (n - 1)\n \n cur = 0\n if low <= a[i]:\n cur += a[i] - low\n if high > 0:\n cur += high - 1\n\n ans.append(cur)\n\nprint(' '.join(map(str, ans)))\n", "n, S = map(int, input().split())\r\nd = [*map(int, input().split())]\r\n\r\ntotal = sum(d)\r\nfor i in range(n):\r\n print(max(0, S-total+d[i]-1) + max(0, d[i]-(S-n+1)), end=\" \")", "from sys import stdin\r\n\r\n\r\ndef arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return list(stdin.readline()[:-1])\r\n\r\n\r\nn, A = arr_inp(1)\r\nd = arr_inp(1)\r\ns = sum(d)\r\nfor i in range(n):\r\n tem = 0\r\n if s - d[i] + 1 < A:\r\n tem += A - (s - d[i] + 1)\r\n if n + d[i] - 1 > A:\r\n tem += (n + d[i] - 1) - A\r\n\r\n print(tem, end=' ')\r\n", "n,a = map(int,input().split())\r\nd = list(map(int,input().split()))\r\ns = sum(d)\r\nans = []\r\nfor i in range(n):\r\n l = max(1,a-(s-d[i]))\r\n r = min(d[i],a-(n-1))\r\n ans.append(d[i]-(r-l+1))\r\nprint(' '.join(map(str,ans)))\r\n" ]

[ "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nA = list(map(int, input().split()))\r\ng = [set() for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a, b = a-1, b-1\r\n g[a].add(b)\r\n g[b].add(a)\r\n\r\nimport itertools\r\nINF = 10**18\r\nans = INF\r\nfor c in itertools.combinations(range(n), 3):\r\n p, q, r = c\r\n if q in g[p] and r in g[q] and p in g[r]:\r\n temp = A[p]+A[q]+A[r]\r\n ans = min(ans, temp)\r\nif ans != INF:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\nN=list(I())\r\np=set()\r\nfor i in range(m):\r\n\tx,y=I();x-=1;y-=1\r\n\tp.add((x,y)if x<y else(y,x))\r\nr=1e9\r\nfor i in range(n):\r\n\tfor j in range(i):\r\n\t\tfor k in range(j):\r\n\t\t\tif(j,i)in p and(k,i)in p and(k,j)in p:\r\n\t\t\t\tr = min(r,N[i]+N[j]+N[k])\r\nprint(-1 if r>1e8 else r)", "import itertools\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nmigr=float(\"inf\")\r\nol=[[0 for i in range(n)] for i in range(n)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n ol[a-1][b-1]=1\r\n ol[b-1][a-1]=1\r\npp=list(range(n))\r\nfor p in itertools.combinations(pp,3):\r\n x,y,z=p[0],p[1],p[2]\r\n if ol[x][y]==1 and ol[x][z]==1 and ol[y][z]==1:\r\n migr=min(migr,l[x]+l[y]+l[z])\r\nif migr==float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(migr)", "\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(par , node , h , price):\r\n l = []\r\n for i in graph[node]:\r\n if i != par and i in h :\r\n l.append(price[i-1])\r\n\r\n if len(l)>0:\r\n return min(l)\r\n else:\r\n return -1\r\nn , m = MAP()\r\nprice = LIST()\r\ngraph = defaultdict(list)\r\n\r\nfor i in range(m):\r\n x , y = MAP()\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n\r\nv = []\r\nfor i in range(1 , n + 1):\r\n if len(graph[i]) >= 2 :\r\n for j in graph[i]:\r\n k = solve(i,j,graph[i] , price)\r\n if (k) > 0 :\r\n v.append(price[i-1] + price[j-1] + k )\r\n\r\n#print(v)\r\nif len(v) > 0 :\r\n print(min(v))\r\nelse:\r\n print('-1')\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = [[] for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n d[a-1].append(b)\r\n d[b-1].append(a)\r\n\r\nx = []\r\nfor i in range(n):\r\n if len(d[i]) > 1:\r\n for i1 in range(len(d[i])):\r\n for i2 in range(i1+1, len(d[i])):\r\n if (i+1 in d[d[i][i1]-1]) and (d[i][i2] in d[d[i][i1]-1]) and (i+1 in d[d[i][i2]-1]) and (d[i][i1] in d[d[i][i2]-1]):\r\n z = (i+1, d[i][i1], d[i][i2])\r\n x.append(z)\r\nc1 = 1e9\r\nfor a,b,c in x:\r\n c1 = min(c1, w[a-1]+w[b-1]+w[c-1])\r\n\r\nprint(c1 if c1 != 1e9 else -1)", "import sys\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = [[0] * 101 for _ in range(101)]\r\nans = sys.maxsize\r\n\r\nfor _ in range(m):\r\n v, u = map(int, input().split())\r\n c[v][u] = 1\r\n c[u][v] = 1\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n for k in range(1, n + 1):\r\n if c[i][j] and c[j][k] and c[i][k]:\r\n ans = min(ans, a[i - 1] + a[j - 1] + a[k - 1])\r\nif ans == sys.maxsize:\r\n print(-1)\r\nelse:\r\n print(ans)# 1698328261.9404912", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nG = [[0] * (n + 1) for _ in range(n + 1)]\r\na = [0] + list(map(int, input().split()))\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n G[u][v] = 1\r\n G[v][u] = 1\r\ninf = pow(10, 9) + 1\r\nans = inf\r\nfor i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if not G[i][j]:\r\n continue\r\n s = a[i] + a[j]\r\n if s > ans:\r\n continue\r\n for k in range(j + 1, n + 1):\r\n if G[i][k] and G[j][k]:\r\n ans = min(ans, s + a[k])\r\nans = (ans + 1) % (inf + 1) - 1\r\nprint(ans)", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import *\r\nfrom itertools import accumulate\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\nen = lambda x: list(enumerate(x))\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\na, b = r()\r\narr = [0] + rr()\r\nbrr = defaultdict(set)\r\nfor _ in range(b):\r\n x, y = r()\r\n brr[x].add(y)\r\n brr[y].add(x)\r\n\r\n\r\nc = inf\r\nfor i in brr.keys():\r\n x = brr[i]\r\n for j in x:\r\n for k in x:\r\n if j != k and j in brr[k]:\r\n c = min(c, arr[i] + arr[j] + arr[k])\r\n\r\nprint(c if c != inf else -1)\r\n", "import poplib\r\nimport string\r\nimport math\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n prices = [1] + [int(i) for i in input().split(\" \")]\r\n # print(prices)\r\n data = [[] for i in range(n + 2)]\r\n for i in range(m):\r\n a, b = [int(i) for i in input().split(\" \")]\r\n data[a].append(b)\r\n data[b].append(a)\r\n min_val = 10000000000000000\r\n is_found = False\r\n for i in range(1, len(data)):\r\n for j in data[i]:\r\n for k in data[j]:\r\n if i in data[k]:\r\n is_found = True\r\n total_price = prices[i] + prices[j] + prices[k]\r\n if total_price < min_val:\r\n min_val = total_price\r\n if is_found:\r\n print(min_val)\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "n,m=map(int,input().split())\r\nll=list(map(int,input().split()))\r\ndict1={i:set()for i in range(1,n+1)}\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n dict1[x].add(y)\r\n dict1[y].add(x)\r\nc=10**7\r\nfor i in range(1,n+1):\r\n for t in dict1[i]:\r\n for z in dict1[i]:\r\n if z in dict1[t]:\r\n r=ll[i-1]+ll[t-1]+ll[z-1]\r\n if r<c:\r\n c=r\r\nprint(-1)if c==10**7 else print(c)\r\n", "n, m = map(int, input().split())\r\ncost = list(map(int, input().split()))\r\ncosts = dict()\r\nfor i in range(n):\r\n costs[i + 1] = cost[i]\r\ndicti = dict()\r\nfor el in range(m):\r\n a, b = map(int, input().split())\r\n dicti[a] = dicti.get(a, []) + [b]\r\n dicti[b] = dicti.get(b, []) + [a]\r\nmini = float('inf')\r\nfor el1 in dicti:\r\n for el2 in dicti[el1]:\r\n for el3 in dicti[el2]:\r\n if el1 != el2 != el3 != el1 and el3 in dicti[el1]:\r\n summa = costs[el1] + costs[el2] + costs[el3]\r\n if summa < mini:\r\n mini = summa\r\nif mini == float('inf'):\r\n print(-1)\r\nelse:\r\n print(mini)\r\n", "ans = float('inf')\r\nN, M = map(int, input().split())\r\nprice = [0] + list(map(int, input().split()))\r\nmatch = [set() for _ in range(N+1)]\r\nfor _ in range(M):\r\n a,b = map(int, input().split())\r\n match[a].add(b)\r\n match[b].add(a)\r\n\r\nfor i in range(1,N+1):\r\n for j in range(i+1, N+1):\r\n for k in range(j+1, N+1):\r\n mi = i in match[j] and i in match[k]\r\n mj = j in match[i] and j in match[k]\r\n mk = k in match[i] and k in match[j]\r\n if mi and mj and mk:\r\n p = price[i] + price[j] + price[k]\r\n ans = min(ans, p)\r\nprint(-1 if ans == float('inf') else ans)\r\n", "n,m=map(int,input().split())\r\npr=list(map(int,input().split()))\r\ng=[[0]*(n+1) for i in range(n+1)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n g[a][b]=g[b][a]=1\r\nans=float('inf')\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n for k in range(j+1,n+1):\r\n if(g[i][j]==g[i][k]==g[k][j]==1):\r\n ans=min(ans,pr[i-1]+pr[j-1]+pr[k-1])\r\nif(ans==float('inf')):ans=-1\r\nprint(ans)", "import math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n f = [[0 for i in range(n)] for j in range(n)]\r\n\r\n for i in range(m):\r\n c, b = map(int, input().split())\r\n f[c - 1][b - 1] = 1\r\n f[b - 1][c - 1] = 1\r\n\r\n min_cost = 1 << 60\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if len(set([i, j, k])) == 3:\r\n if f[i][j] == 1 and f[i][k] == 1 and f[j][k] == 1:\r\n cost = a[i] + a[j] + a[k]\r\n if cost < min_cost:\r\n min_cost = cost\r\n\r\n if min_cost != 1 << 60:\r\n print(min_cost)\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n,m=map(int,input().split())\r\nprices=list(map(int,input().split()))\r\nmatch=[[False for _ in range(n+1)]for j in range(n+1)]\r\nfor i in range(m):\r\n v,u=map(int,input().split())\r\n match[u][v]=match[v][u]=True\r\nt=-1\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n if not match[i][j]:continue\r\n for k in range(j+1,n+1):\r\n if match[k][i] and match[j][k]:\r\n price=prices[i-1]+prices[j-1]+prices[k-1]\r\n if t==-1 or price<t:\r\n t=price\r\nprint(t)" ]

[ "from math import sqrt\n\nn, h = map(int, input().split())\n\nfor i in range(1, n):\n print(h*sqrt(i/n), end=' ' if i +1 < n else '\\n')\n\t\t\t\t\t\t\t \t\t \t\t\t \t\t \t\t\t \t\t \t\t\t", "from math import sqrt\r\n\r\nn,hn = list(map(int,input().split()))\r\nkn = sqrt(n)\r\nh = hn/kn\r\nfor i in range(1,n):\r\n print(h*sqrt(i),end = ' ')", "import sys\r\nfrom math import sqrt\r\n\r\ndef solve():\r\n n, h = map(int, input().split())\r\n\r\n ans = [0]*(n - 1)\r\n\r\n for i in range(1, n):\r\n ans[i - 1] = h * sqrt(i / n)\r\n\r\n print(*ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "import sys\r\ninput = sys.stdin.readline\r\nn, h = [int(xx) for xx in input().split()]\r\nx = 0\r\nans = []\r\nfor i in range(n - 1):\r\n y = (x ** 2 + (1 / n)) ** 0.5\r\n ans.append(y * h)\r\n x = y\r\nprint(*ans)\r\n", "n, h = map(int, input().split())\r\nfrom math import sqrt\r\nfor i in range(n - 1):\r\n print(h * sqrt((i + 1) / n), end = ' ')\r\n", "n, H = (int(x) for x in input().split())\r\nlist_of_h = [H * ((i / n) ** 0.5) for i in range(1, n)]\r\nprint(*list_of_h)", "# area of similar triangles is proportional to the squares of the corresponding sides\r\n# therefore, areas are proportional to squares of heights, h2=sqrt(A2/A1)xh1=sqrt((A1/n)xi/A1)xh1=sqrt(i/n)xh1\r\nimport math\r\nn,h=map(int, input().split())\r\nfor i in range(1,n):\r\n print(math.sqrt(i/n)*h)\r\n", "n,h=map(int,input().split())\r\nl=[h]\r\nb1=1\r\nhc=h\r\nop=(hc)/(2*n)\r\nfor i in range(n-1):\r\n a=b1/l[-1]\r\n b=-2*b1\r\n c=2*op\r\n x1=(-b+(b*b-4*a*c)**0.5)/(2*a)\r\n x2=(-b-(b*b-4*a*c)**0.5)/(2*a)\r\n if x1<l[-1]:\r\n b1=b1*(l[-1]-x1)/l[-1]\r\n l.append(l[-1]-x1)\r\n else:\r\n b1=b1*(l[-1]-x2)/l[-1]\r\n l.append(l[-1]-x2)\r\nfor i in range(n-1,0,-1):\r\n print(l[i],end=\" \")\r\nprint()", "n,h=map(int,input().split())\r\nfor i in range(n-1,0,-1):\r\n t=((h*h*(n-i))/n)**0.5\r\n print(t,end=' ')", "import math\n\nx = input().split(' ')\n\nn = int(x[0])\nh = int(x[1])\n\nA = 1*h/2\na = A / n\npasso = a\n\nfor i in range(n-1):\n\tprint( (((h-2*(A-a))*h)**(1/2)) , end=' ' )\n\ta += passo\n\t\n\t\n", "__author__ = 'Alexander'\r\n\r\nimport math\r\ndef Task(inp1):\r\n n, h = map(int,inp1.split())\r\n # elems = [int(elem) for elem in inp2.split()]\r\n # res = [[0, 0] for i in range(n)]\r\n res = [0]*n\r\n res[0] = h\r\n for i in range(1, n):\r\n res[i] = math.sqrt((n-i)/(n-i+1))*res[i-1]\r\n # print(sorted(res[1:]))\r\n answer = sorted(res[1:])\r\n answer = [str(elem) for elem in answer]\r\n return answer\r\n\r\ndef Main():\r\n inp1 = input()\r\n # inp2 = input()\r\n outp = Task(inp1)\r\n print(' '.join(outp))\r\n\r\ndef Test():\r\n #These \"asserts\" using only for self-checking and not necessary for auto-testing\r\n assert Task('2 100000') == '70710.678118654752'\r\n assert Task('3 2') == '1.154700538379 1.632993161855'\r\n\r\nMain()\r\n# Test()\r\n# print([0,0]*2)", "from math import sqrt\nn, h = map(int, input().split())\n\nfor i in range(n-1):\n print(h*sqrt((i+1)/n))\n\n\t \t\t \t\t \t\t \t \t \t\t\t \t\t\t \t\t\t", "# 764B\n# Cutting Carrot\n\nimport math\n\nfstline = list(map(float,input().split(' ')))\nn, h, i, ans = fstline[0], fstline[1], 1, ''\nwhile i < n:\n ans+=str(math.sqrt(i/n)*h)+' '\n i+=1\nprint(ans[:-1])\n", "n, h = map(int, input().split())\r\nfor i in range(1, n):\r\n print(((i/n)**(1/2))*h, end=\" \")", "import math\r\nn, h = map(int, input().split())\r\nfor i in range(1, n):\r\n print(\"%.10f\"%(h*math.sqrt(i/n)), end=' ')", "# -*- coding: utf-8 -*-\n\nimport sys\nimport os\nimport math\n\n# input_text_path = __file__.replace('.py', '.txt')\n# fd = os.open(input_text_path, os.O_RDONLY)\n# os.dup2(fd, sys.stdin.fileno())\n\nn, h = map(int, input().split())\n\nX = []\nfor i in range(1, n):\n c = math.sqrt(i / n) * h\n X.append(c)\n\nprint(*X)", "n, h = map(int, input().split())\nans = (n - 1) * [0]\nfor i in range(1, n):\n ans[i - 1] = ((i / n) ** 0.5 * h)\nprint(*ans)\n", "N, H = map(int, input().split())\nprev = 0.0\nans = []\nfor i in range(N - 1):\n now = pow((i + 1) / N, 0.5) * H\n ans.append(\"{:.20f}\".format(now - prev))\n now = prev\nprint(*ans)\n", "from math import sqrt as s\r\nt =(input()).split(\" \")\r\nn=int(t[0])\r\nh=int(t[1])\r\nfor i in range(1,n):\r\n print(s(i*h*h/n))\r\n", "import math\r\nn, h = map(int,input().split())\r\nfor x in range(1, n):\r\n height = h * math.sqrt(x / n)\r\n print(height, end = \" \")", "from math import sqrt\r\n\r\nn,h = map(int,input().split())\r\n\r\nt = h/sqrt(n)\r\n\r\nfor i in range(1,n):\r\n\r\n\tprint(sqrt(i)*t,end=\" \")", "import math\r\n\r\nn, h = map(int, input().split())\r\n\t\r\ndef calc_x(s):\r\n\treturn math.sqrt(s / h) * h\r\n\r\nreq_s = h / n\r\n\r\nfor i in range(1, n):\r\n\tprint(calc_x(req_s*i))\r\n", "n, h = map(int, input().split())\r\nrec = []\r\nfor i in range(1, n):\r\n rec.append(h * (i / n) ** 0.5)\r\n\r\nprint(*rec)", "# @Author: Lakshya Singh <target_x>\r\n# @Date: 2020-01-14T22:28:02+05:30\r\n# @Email: [email protected]\r\n# @Filename: 794B.py\r\n# @Last modified by: target_x\r\n# @Last modified time: 2020-01-14T22:43:49+05:30\r\n\r\n# ______ __ _ __\r\n# /_ __/___ __________ ____ / /_ | |/ /\r\n# / / / __ `/ ___/ __ `/ _ \\/ __/ | /\r\n# / / / /_/ / / / /_/ / __/ /_ / |\r\n# /_/ \\__,_/_/ \\__, /\\___/\\__/ ______ /_/|_|\r\n# /____/ /_____/\r\n\r\nfrom sys import stdin, stdout\r\nimport math\r\n\r\n\r\ndef target_X():\r\n n, h = map(float, stdin.readline().split())\r\n n = int(n)\r\n h = h / math.sqrt(n)\r\n for x in range(1, n):\r\n h1 = h * math.sqrt(x)\r\n print(h1, end=' ')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n target_X()\r\n", "from math import sqrt\n\nn, h = map(int, input().split())\n\nA = h/2\n\nres = []\n\nfor i in range(1, n):\n x = sqrt(i*h*h/n) \n res.append(x)\n\nprint(*res)\n\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\n\r\nfor i in range(1, n):\r\n print(\"%6f\"%(((i/n)**0.5)*h), end = \" \")\r\n", "from math import sqrt\r\n[n,h] = list(map(int,input().split()))\r\nans = \"\"\r\nfor i in range(1,n):\r\n ans = ans + str(sqrt(i/n)*h) + \" \"\r\nprint(ans)\r\n", "n, h = map(int, input().split())\r\nfor i in range(n - 1):\r\n print(((i + 1) * h ** 2 / n) ** 0.5, end=' ')\r\n", "n, h = [int(i) for i in input().split()]\r\ns = (h / 2) / n\r\na = []\r\nosp = 0\r\nhp = 0\r\neps = 0.000000001\r\nfor i in range(n - 1):\r\n l = eps\r\n r = h + eps\r\n while abs(l - r) > eps:\r\n cur = (l + r) / 2\r\n os = cur / h\r\n if (osp + os) / 2 * (cur - hp) > s:\r\n r = cur\r\n else:\r\n l = cur\r\n a.append(l)\r\n hp = l\r\n osp = l / h\r\nprint(*a)\r\n", "def solve(p, a):\r\n for i in range(1, p):\r\n tmp = i/p\r\n print( (tmp**0.5) * a )\r\n return\r\n\r\np,a = map(int,input().split())\r\nsolve(p,a)\r\n", "#\n# Joseph Matsushita\n# Problem F\n#\n\nimport math\n\nn, h = map(int, input().split())\n\na = h**2 / 2\ns = a / n\n\nfor i in range(1, n):\n print(math.sqrt(2 * i * s))\n\t \t\t \t\t\t\t\t\t \t\t\t\t\t \t \t", "n, h = map(int, input().split())\nans = []\nfor i in range(1, n):\n ans.append((i / n)**0.5 * h)\n\nprint(' '.join(map(str, ans)))\n", "import math\r\nn,h=map(int,input().split())\r\nfor i in range(1,n):\r\n print(h*math.sqrt(i/n))\r\n", "read = lambda: map(int, input().split())\r\nn, h = read()\r\nx = [0] * (n - 1)\r\nx[0] = (h * h / n) ** 0.5\r\nfor i in range(1, n - 1):\r\n x[i] = (h * h / n + x[i - 1] ** 2) ** 0.5\r\nprint(*x)", "n, h = map(int, input().split())\nt = (h/2)/n\n\nfor i in range(1, n):\n print((2 * i * t * h) ** 0.5,)\n \t \t\t \t \t \t \t \t \t\t\t", "from math import hypot\n\nn, h = list(map(int, input().split()))\n\nsquare = (0.5 * h)\none = square / n\nhyp = hypot(0.5, h)\n\ndef get_square(d):\n\tup = (1 - d) * 0.5\n\treturn 2 * ((up * h * d) + (0.5 - up) * h * d / 2)\n\n\nrez = []\n_prev = 0\nfor i in range(n - 1):\n\tleft = _prev\n\tright = 1\n\tfor i in range(50):\n\t\tmid = (left + right) / 2\n\t\tif get_square(mid) - get_square(_prev) > one:\n\t\t\tright = mid\n\t\telse:\n\t\t\tleft = mid\n\n\t_prev = left\n\trez.append(h - left * h)\nprint(*reversed(rez))\n", "from math import sqrt\r\n\r\nn, h = map(int, input().split(' '))\r\n\r\nfor i in range(1, n):\r\n r = h*sqrt(i/n)\r\n print(str(r), end=\" \")", "from math import sqrt\r\nn,h=map(int,input().split())\r\nh = h*1.00\r\nl = []\r\nfor i in range(0,1500):\r\n\tl.append(sqrt(i))\r\narea = sqrt((h*h)/n)\r\nfor i in range(1,n):\r\n\tprint(l[i]*area,end=\" \")\r\n\r\n", "import fileinput\nimport math\n\ndef main():\n f = fileinput.input()\n line = next(f)\n c = line.split(\" \")\n n = int(c[0])\n h = int(c[1])\n s = 1.0 * h / (2.0 * n)\n d = 0.0\n # s = h / 2.0 * a * a\n for k in range(1, n):\n a = math.sqrt(k * s * 2.0 / h) * h\n print(a) \n\nif __name__ == \"__main__\":\n main()\n", "R=lambda:map(int,input().split())\nn,h=R()\nc=h*h/n\nprev=0\nfor i in range(n-1):\n curr = (c + prev**2)**0.5\n print (curr, end=' ')\n prev = curr\n", "n,h=input().strip().split(' ')\r\nn,h=(int(n),int(h))\r\narea=(0.5*0.5*h)\r\na=area/n\r\nh1=(4*a*h)**0.5\r\nlist1=[h1]\r\nfor i in range(n-2):\r\n h2=((h1**2)+(4*a*h))**0.5\r\n list1.append(h2)\r\n h1=h2\r\nprint(*list1)", "n,h = map(int,input().split())\r\nfor x in range(1,n):\r\n print(\"%.10f\"%(h*(x/n)**0.5),end=' ')", "import math\r\n\r\nn, h = map(int, input().split())\r\nbase = 1/n\r\nprev = base\r\nprint(h*math.sqrt(prev), end=' ')\r\n\r\nfor x in range(n - 2):\r\n curr = prev + base\r\n print(h*math.sqrt(curr), end=' ')\r\n prev = curr", "[n , h] = list(map(int , input().split()))\r\n\r\ntemp = h/(n**0.5)\r\nfor i in range(1, n):\r\n print(temp * (i**0.5))", "n, h = map(int, input().split())\nres = []\nfor cut_i in range(1, n):\n res.append(h * ((cut_i / n)**0.5))\n\nprint(*res)\n\n\t\t\t \t \t\t \t\t \t \t\t \t\t \t \t \t\t", "n,h= map(int,input().split())\r\nimport math\r\nfor i in range(1,n):\r\n x= h*(math.sqrt(i/n))\r\n print(x,end=\" \")", "n, h = map(int, input().split())\r\n\r\ndef f(x):\r\n return x / h\r\n \r\ndef integrate(a, b):\r\n return (b * b - a * a) / (2 * h)\r\n\r\ns = h / (2 * n)\r\nprev = 0\r\nans = []\r\n\r\nwhile len(ans) < n - 1:\r\n x1 = prev\r\n l = prev\r\n r = 1000000\r\n while(r - l > 1e-9):\r\n m = (r + l) * 0.5\r\n bad = integrate(prev, m) < s\r\n if(bad):\r\n l = m\r\n else:\r\n r = m\r\n prev = (r + l) * 0.5\r\n ans.append(prev)\r\n \r\nprint(' '.join([str(x) for x in ans]))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\nimport math\nN, H = map(int, input().split())\nret = []\nfor n in range(1, N):\n ret.append(H * math.sqrt(n / N))\nfor i in range(len(ret)):\n if i == 0:\n print(\"{:.15f}\".format(ret[i]), end=\"\")\n else:\n print(\" {:.15f}\".format(ret[i]), end=\"\")\n \n", "n, h = map(int, input().split())\r\none = h / (2 * n)\r\nans = []\r\nfor i in range(1, n):\r\n ans.append((((one * i) / (h / 2)) ** 0.5) * h)\r\nprint(*ans)", "from math import sqrt\r\nn,h=map(int,input().split())\r\nfor i in range(1,n):\r\n print('{:.12f}'.format(h*sqrt(i/n)),end=' ')", "import math\r\nn,h=map(int,input().split())\r\nfor i in range(1,n):\r\n x=math.sqrt(i/n)*h\r\n print(x,end=' ')", "def find_cuts(n, h):\n cuts = []\n for i in range(1, n):\n height = h * (i / n)**0.5\n cuts.append(height)\n return cuts\n\n# Input\nn, h = map(int, input().split())\ncuts = find_cuts(n, h)\n\n# Output\nprint(*cuts)\n", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, h = map(int, input().split())\r\nu = h * h\r\nans = []\r\nfor i in range(1, n):\r\n ans0 = math.sqrt(u * (i / n))\r\n ans.append(ans0)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "n,h=map(int,input().split())\r\ncuts=[]\r\nfor i in range(n-1,0,-1):\r\n cuts.append(((i/n)*(h*h))**0.5)\r\ncuts.sort()\r\n\r\nprint(' '.join(list(map(str,cuts))))\r\n", "n,h=map(int,input().split())\r\nfor i in range(1,n):\r\n print((h**2 * (i/n))**0.5,end=\" \")\r\n\r\n ", "from math import sqrt\r\n\r\n(n,h)= map(int , input().split())\r\n\r\nfor i in range(1,n):\r\n hi=sqrt(i/n)*h\r\n print(hi,end=\" \")", "n, h = map(int,input().split())\r\nunit = h*h/n\r\nfor i in range(1,n):\r\n print((unit*i)**0.5, end=' ')", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nimport math\r\n\r\n[n, h] = list(map(int, input().split()))\r\n\r\ntot = 0.5*1*h\r\nres = []\r\nfor i in range(1, n):\r\n y = math.sqrt(2*h*tot/n*i)\r\n res.append(y)\r\nprint(' '.join(map(str, res)))\r\n\r\n", "x, y = map(int, input().split())\nfor i in range(1,x):print(y*(i/x)**0.5)\n", "n,h=map(int,input().split())\r\nfor i in range(1,n):print(h*(i/n)**.5)", "from math import sqrt\r\n\r\nn,h = list(map(int,input().split()))\r\nprint(*[ h*sqrt(i/n) for i in range(1,n)])\r\n", "n,h = map(int,input().split())\r\nfor i in range(1,n):\r\n print(h*((i/n)**.5),end=\" \")", "from math import *\r\n\r\nn, h = map(int, input().split())\r\n\r\nfor i in range(1, n):\r\n print(h * sqrt(i/n), end=' ')\r\n\r\n\r\n", "n, h = map(int, input().split())\r\nfor i in range(1,n):\r\n print(h*(i/n)**(0.5), end= ' ')", "import math\r\n\r\nn, h = map(int, input().split())\r\n\r\np = 0\r\nh2n = h * h / n\r\nfor _ in range(n - 1):\r\n x = math.sqrt(h2n + p * p) - p\r\n p += x\r\n print(p, end=\" \")\r\n", "def main():\n n, h = map(int, input().split())\n\n for i in range(1, n):\n print(h * (i/n) ** .5)\n\n\n\nif __name__ == '__main__':\n main()\n\t\t\t\t\t\t \t \t\t \t \t\t \t \t\t \t\t\t", "from math import *\r\nn,h=input().split()\r\nn=int(n)\r\nh=int(h)\r\nfor i in range(1,n):\r\n print(h*sqrt(i/n),end=\" \")\r\n", "n, h = map(int, input().split())\nh *= h;\n\nprint(' '.join([str((h * i / n)**0.5) for i in range(1, n)]))\n", "import math\r\nn,h=map(int ,input().split())\r\na=1/2*(h)\r\nans=[]\r\nfor i in range(1,n):\r\n ans.append(h*math.sqrt(i/n))\r\nprint(*ans)\r\n ", "import math\r\nn,h=map(int,input().split())\r\npi=math.pi\r\ns=pi*.5*(h+(h*h+.25)**.5)\r\no=s/n\r\nl=[]\r\nfor i in range(1,n):\r\n S=o*i\r\n l+=[(2*h*S/(((1+1/(4*h*h))**.5+1)*pi))**.5]\r\nprint(*l)", "import math\r\nn, h = map(int, input().split())\r\na = h / n # area of each segment\r\nres = []\r\nfor i in range(1, n):\r\n # x (x / h) = i * a\r\n # => x^2/h = i*a\r\n # => x = sqrt(i*a*h)\r\n res.append(math.sqrt(i*a*h))\r\nprint(\" \".join(map(str, res)))", "x=input()\r\nn,h=map(int , x.split())\r\nfor i in range(1,n):\r\n print((i**(1/2))*h/((n)**(1/2)))\r\n\r\n\r\n", "n,h=map(int,input().split())\r\nfor x in range(1,n):print(h*(x/n)**0.5)", "n, h = map(int, input().split())\r\nfor i in range(1, n):\r\n print((i/n)**0.5*h, end = ' ')", "n, h = map(int, input().split())\r\ntmp1 = h * h / n\r\nfor i in range(1,n):\r\n print(\"%.10f\" % ((tmp1 * i) ** (1 / 2)), end=' ')\r\n", "# url: https://codeforces.com/contest/794/problem/b\n# tag:\n# difficulty:\nfrom typing import List\nfrom math import sqrt\n\nINF = float(\"inf\")\nNINF = float(\"-inf\")\n\n\ndef read_string():\n return input()\n\n\ndef read_string_line():\n return [x for x in input().split(\" \")]\n\n\ndef read_int_line():\n return [int(x) for x in input().split(\" \")]\n\n\ndef read_int():\n return int(input())\n\n\ndef get_int_arr(s):\n return [int(x) for x in s.split()]\n\n\ndef get_sum(acc, l, r):\n \"\"\"\n l, r are original index\n \"\"\"\n return acc[r] - acc[l]\n\n\nP = int(1e9 + 7)\n\n\ndef exgcd(x, y):\n if y == 0:\n return x, 1, 0\n g, a, b = exgcd(y, x % y)\n t = x // y\n return g, b, a - t * b\n\n\ndef inv(x):\n g, a, b = exgcd(x, P)\n return a\n\n\ndef calc_acc(arr):\n ans = [0]\n for a in arr:\n ans.append(a + ans[-1])\n return ans\n\n\nlines: List[str] = [*open(0)]\nn, h = get_int_arr(lines[0])\nfor i in range(1, n):\n print(\"%s%s\" % (\"\" if i == 1 else \" \", sqrt(i * h * h / n)), end=\"\")\n", "import math\na = input()\nx = [int(i) for i in a.split()]\nnumber = x[0]\nheight = x[1]\noutput = \"\"\nfor i in range(1, number):\n if(number == 1):\n print(math.sqrt(i/number) * height)\n else:\n output = output + str(math.sqrt(i/number) * height) + \" \"\nprint(output)", "import math\nn, h = map(int, input().split())\ns=float(1)/2*h/n\nfor i in range(1,n):\n a=math.sqrt(i/n)\n print(s*i*2/a)", "n,h=map(int,input().split())\r\ncuts=[]\r\nfor i in range(1,n,1):\r\n cuts.append(h*(i/n)**(1/2))\r\nprint(*cuts)\r\n", "from sys import stdin,stdout\nn,h = [int (x) for x in stdin.readline().split()]\nfor i in range(1,n):\n res = ((i/n)**.5)*h\n stdout.write(str(res))\n if i < n-1:\n stdout.write(' ')\n\nstdout.write('\\n')\n", "import math\r\nn,h = map(int,input().split())\r\nl = []\r\nfor i in range(1,n):\r\n temp = (math.sqrt((i)/(n)))*h\r\n l.append(temp)\r\nprint(*l)", "import sys\r\nimport math\r\n\r\nn,h = map(int, input().split())\r\nfor i in range(n-1):\r\n print(\"%f\" % (h * math.sqrt((i+1) / n)), end = \" \" )", "n, h = map(int, input().split())\ns = ''\nfor i in range(1, n):\n\ts += \"%.6f \" % (i * h * h / n) ** 0.5\nprint(s)", "from math import sqrt\r\n\r\nn, h = [int(x) for x in input().split()]\r\n\r\narea = h / (2 * n)\r\ntan_a = 0.5 / h\r\n\r\nfor i in range(1, n):\r\n print(sqrt((i * area) / tan_a), end=' ')\r\n", "import math\r\nn, h = map(int, input().split())\r\nfor i in range(1, n):\r\n print(math.sqrt(i/n)*h, end=\" \")", "mas = list(map(int, input().split()))\r\nn = mas[0]\r\nh = mas[1]\r\nlst = [str((i / n) ** 0.5 * h) for i in range(1, n)]\r\nprint(' '.join(lst))", "n, h = map(int, input().split())\r\nprint(' '.join(str(h / (n / i) ** 0.5) for i in range(1, n)))", "n, H = map(int, input().split())\r\n\r\n'''S = H / 2\r\ns = S / n\r\nprint(S, s)\r\n\r\nh = (2 * H * s) ** 0.5\r\na1 = h / H\r\nh2 = H * (2 * s / h - a1)\r\nprint(h, h2)'''\r\n\r\nfor i in range(1, n):\r\n ans = (i / n) ** 0.5 * H\r\n print(ans, end = ' ')\r\n", "import sys\r\nread=lambda:sys.stdin.readline().rstrip()\r\nreadi=lambda:int(sys.stdin.readline())\r\nwriteln=lambda x:sys.stdout.write(str(x)+\"\\n\")\r\nwrite=lambda x:sys.stdout.write(x)\r\nn,h=map(int, read().split())\r\nfor i in range(n-1):\r\n write(\"%.12f \" % ((((i+1)/float(n))**0.5)*h))", "from math import sqrt\r\ncut,height=map(int,input().split())\r\nfor i in range(1,cut):\r\n print(sqrt(i/cut)*height,end=\" \")", "n, h=map(int, input (). split ())\nfrom decimal import *\nk=Decimal (1000000) \nh=h*k\nfrom math import sqrt \ngetcontext().prec=50\nC=Decimal (1)/Decimal (h)\nTot=Decimal(Decimal(h)/Decimal (2) )\nPart=Decimal(Tot/Decimal(n)) \nx1 =Decimal (sqrt(Decimal (2)*Decimal (Part)/C)) \nfor i in range (0,n-1):\n curAr=Decimal(Part*(i+1))\n curX=Decimal (sqrt(Decimal (2)*Decimal(curAr) /C) )\n print (curX/k) \n ", "import sys\r\ninput = sys.stdin.readline\r\ndef prog():\r\n n,h = map(int,input().split())\r\n for i in range(1,n):\r\n print(h/(n/i)**0.5)\r\nprog()", "from math import sqrt\n\nn,h = map(int,input().split())\nl = []\n\nfor i in range(1,n):\n base = sqrt(i/n)\n # print(base)\n l.append(str(h*base))\n\nprint(' '.join(l))\n \t \t \t \t \t \t \t \t", "from math import sqrt\n\nn, h = map(int, input().split())\neach = h/(2*n)\nfor i in range(n-1):\n ans = sqrt(2*(i+1)*each*h)\n print(ans, end = \" \")\n\t\t\t\t \t \t \t \t \t \t \t \t", "b,a=map(int,input().split())\r\nfor i in range(1,b):\r\n print(a*(i/b)**0.5,end=' ')\r\nprint()", "n,h=map(int,input().split(' '))\r\na=0\r\nx=h**2/n\r\nfor i in range(n-1):\r\n a=(x+a**2)**0.5\r\n print(a)", "import math\nfirst_line = list(map(int, input().split()))\nn, h = first_line\n\ntotal_area = .5*h\narea = total_area / 3\n\nans = \"\"\nfor i in range(n-1):\n ans += str(math.sqrt(2*h*((total_area*(i+1)/n))))\n\n ans += \" \"\n\nprint(ans.strip())\n", "from math import sqrt\r\n\r\n(n,h)= map(int , input().split())\r\nhi = 0\r\nA = h/2\r\na = A/n\r\n\r\nfor i in range(1,n):\r\n hi=sqrt(2*i*a*h)\r\n print(hi,end=\" \")", "a=input()\r\nb=a.split(\" \")\r\nc=float(b[1])/float(b[0])**(1/2)\r\nprint(c)\r\nfor i in range (2,int(b[0])):\r\n print((i**(1/2))*c)", "import math\ninput = list(map(int, input().split()))\n\nn = input[0]\nabc = input[1]\nwidth = 1\nh = float(abc)\npiece_area = float(h/(2*n))\narea = float(h/(2*n))\noutput = []\n\nfor x in range (n):\n areaFactor = area/(h/2)\n sideFactor = math.sqrt(areaFactor)\n output.append(h*sideFactor)\n area += piece_area\n \noutputString = \"\"\n\nfor x in range(len(output)-1):\n outputString += str(output[x]) + \" \"\n\n\nprint(outputString)\n \t\t \t\t\t\t \t \t\t \t \t \t\t\t\t\t \t\t", "from decimal import *\nimport math\n\nn, h = [int(x) for x in input().split()]\n\ngetcontext().prec = 30\n\nfor i in range(1, n):\n print(h * Decimal(math.sqrt(Decimal(i) / Decimal(n))), end = '')\n if i < n - 1:\n print(' ', end = '')\n\n \t\t \t\t\t\t\t \t \t \t \t \t \t\t \t\t", "n, _h = map(int, input().split())\r\nh = float(_h)\r\nans = [0.0]*n\r\n\r\nfor i in range(1, n):\r\n area = h / 2 * (i / n)\r\n ok, ng = 0.0, h\r\n for _ in range(50):\r\n mid = (ok + ng) / 2\r\n if mid * (mid / h) / 2 <= area:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\n ans[i] = ok\r\n\r\nprint(*ans[1:], sep=' ')\r\n", "from math import sqrt\r\n\r\n\r\nn,h = map(int,input().strip().split())\r\n\r\ndelt = (h*h)/n\r\nx = 0\r\n\r\nfor i in range(n-1):\r\n x = sqrt(delt + x*x)\r\n print(x,end = ' ')\r\n\r\n\"\"\"\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡴⢋⠵⠉⠀⠀⠀⡠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠳⣄⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡠⠋⠀⡎⠀⠀⡀⠔⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢢⡀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠎⠀⠀⠀⠈⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠱⡀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡰⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢳⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡸⠁⠀⣀⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡸⠁⠀⠀⠀⠀⠀⠀⠈⠉⠒⠂⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠰⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠉⠐⠒⠤⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠇⠀⠀⢰⠊⠉⢉⡁⠒⠢⣄⠀⣰⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠒⢄⡀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡔⡛⠀⠀⠀⠘⢆⡀⠈⠃⠀⠀⡸⠀⠇⠀⠀⠀⠀⠀⡠⠤⠤⢀⣀⠀⠀⠀⠀⠀⠀⠁⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⢡⠇⠀⠀⠀⠀⠀⠉⠓⠒⠒⠉⠀⡼⠀⠀⠀⠀⠀⢸⠀⠀⠀⣤⠈⠉⠲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡎⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇⠸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡴⠀⠀⠀⠀⠀⠀⠀⠣⡀⠀⠀⠀⠀⠀⡸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠃⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢁⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡜⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⠒⠒⠒⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡞⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⣾⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⠀⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠋⠉⠉⢆⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⡴⡲⢳⡸⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠐⣶⣤⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣾⠱⠁⡇⣎⠃⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠹⣍⠀⠈⠉⠑⠒⠒⠀⣤⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣟⠟⠀⢠⢫⠋⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⡆⠀⠀⠀⠀⠀⠀⠀⠈⠑⠂⠀⠀⠐⠒⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⠟⠋⠀⠀⡿⠃⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠠⠒⠒⠐⠒⡠⠊⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠒⠒⢤⠋⠘⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣪⢵⠶⡶⠚⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡠⠔⠂⠉⣴⠀⢰⠃⠀⠀⠸⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⡾⡏⠁⠘⡄⢣⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⢀⠔⢸⠉⠗⠉⠀⠀⠀⠀⡇⢀⠇⠀⠀⠀⡰⠙⢦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⡴⠟⠋⠀⡇⠀⠀⢣⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⢠⠊⠀⠸⠈⡄⠀⠀⠀⠀⠘⠀⠈⠀⠀⠀⡰⠁⡰⠋⢙⠦⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⣠⣴⠶⠛⠉⠀⠀⠀⠀⡇⠀⠀⢸⢸⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⡇⠀⠀⠀⢧⠈⣢⢴⡺⡟⠑⠢⣄⠀⠀⡰⣡⠊⠀⢠⠎⣠⡞⡏⠙⠛⠳⠶⠶⠿⠟⠛⠓⠉⠉⠀⠀⠀⠀⠀⠀⣀⠔⠃⠀⠀⡏⢸⠉⠲⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⣴⠀⠀⠀⠘⣴⢡⠋⣠⢃⣠⣤⡘⣆⣼⠟⠁⠀⣰⡣⢫⠎⠀⢰⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠤⠊⠁⠀⡆⠀⡸⠀⡞⠀⠀⠘⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⡜⠈⢧⠀⠀⠀⡇⠈⠉⣴⣿⣿⣿⣷⡿⠁⠀⠀⣰⠟⠀⡜⠀⠀⠘⠳⣄⠀⠀⠀⠀⠀⠀⠀⠀⣀⠤⠐⠋⠀⠀⠀⠀⠀⡇⢠⠃⢀⠃⠀⠀⣄⠙⠤⣀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⢰⠁⠀⠈⢧⠀⠀⠻⡅⣼⣿⣿⣿⡿⠋⠀⠀⠀⡴⠃⠀⠀⡗⠀⠀⠇⠀⠀⠈⠑⠒⠒⠒⠒⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⢰⠃⡎⠀⣸⠀⠀⢀⣿⠀⠀⠀⠉⠒⢤⡀⠀⠀⠀\r\n⠀⡌⠀⠀⠀⠈⢣⡀⠀⠈⠛⠛⠛⠉⠀⠀⠀⣀⠞⡇⠀⠀⠀⢡⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡸⢰⠁⢀⠇⠀⠀⣸⠇⠀⠀⠀⠀⠀⠀⠈⠢⡀⠀\r\n⢠⠇⠀⠀⡄⠀⠀⢱⣄⠀⠀⠀⠀⠀⠀⣠⣾⠋⠀⡇⠀⠀⠀⠈⣧⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣴⠊⡇⡄⠀⣸⠀⠀⢀⡏⠀⠀⠀⠀⠀⠀⢀⡴⠂⠙⡄\r\n\"\"\"", "from math import sqrt\r\nn, h = map(int, input().split())\r\nfor i in range(1, n):\r\n print(sqrt(i/n)*h, end=' ')\r\nprint()\r\n", "n, h = map(float, input().split(' '))\nprint(' '.join(['%.12f' % (((k + 1) / n) ** 0.5 * h) for k in range(int(n) - 1)]))\n", "arr= list(map(int, input().rstrip().split()))\r\nn=arr[0]\r\nh=arr[1]\r\nht=[]\r\nr1=(1/n)**0.5\r\nh1=round(r1*h,12)\r\nht.append(h1)\r\nfor i in range(2,n):\r\n\tgg=i**0.5\r\n\th2=round(r1*gg*h,12)\r\n\tht.append(h2)\r\nprint(*ht)\r\n", "\nn, h = map (int, input().split())\n\nimport decimal\nn=decimal.Decimal(n)\nh=decimal.Decimal(h)\n\narea_total = h/2\n\narea_pedazo = area_total/n\nimport math\n\nmedidas = []\nbase = 1\naltura = h\nfor i in range(int(n)-1):\n f_a = 1/(2*h)\n f_b = -base\n f_c = area_pedazo\n\n x1 = (-f_b - decimal.Decimal(math.sqrt(f_b**2 - 4*f_a*f_c)))/(2*f_a)\n\n medidas.append(altura-x1)\n altura = altura-x1\n\n base = base-x1/h\n\nfor i in range(int(n)-1, 0, -1):\n print(medidas[i-1], end=\" \")\n \t\t\t \t\t \t\t\t\t\t\t \t \t\t\t \t \t \t\t", "from math import *\r\nn,h=map(int,input().split())\r\np=h/sqrt(n)\r\nfor i in range(1,n):\r\n print(p*sqrt(i),end=' ')\r\nprint()", "import math\r\nn,h=input().split()\r\nfor i in range(1,int(n)):\r\n print(math.sqrt(i)*int(h)/math.sqrt(int(n)),end=\" \")", "import cmath\r\nlineIn = input().split(' ')\r\nnumBun = int(lineIn[0])\r\nheightCar = int(lineIn[1])\r\ntriA = heightCar/2\r\nAreaPer = triA/numBun\r\nproportion = 1/heightCar\r\nprevHeights = 0\r\nanswer = []\r\ndef calcHeightTrapez(area, prevHeights):\r\n a = prevHeights*proportion\r\n #area = (prevHeights*proportion+(height + prevHeights)*proportion)/2 * height\r\n #area = (prevHeights*proportion)*height + (height*proportion)/2 * height\r\n #0 = (proportion/2)*height**2 + a*height - area\r\n d = (a**2) - (4*(-area)*(proportion/2))\r\n sol1 = (-a + d**(1/2))/(proportion)\r\n #sol2 = -a - cmath.sqrt(d)/(proportion)\r\n return sol1\r\n \r\ndef calcIso(area):\r\n height = (area * 2 / proportion)**(1/2)\r\n return height\r\nprevHeights = calcIso(AreaPer)\r\nanswer.append(prevHeights)\r\nfor i in range(1, numBun-1):\r\n prevHeights += calcHeightTrapez(AreaPer, prevHeights)\r\n answer.append(prevHeights)\r\nprint(\" \".join(map(str, answer)))", "n, h = map(int, input().split())\r\nans = []\r\nfor i in range(1, n):\r\n ans.append(h * ((i / n) ** 0.5))\r\nprint(*ans)", "#author: riyan\r\n\r\nimport math\r\n\r\nif __name__ == '__main__':\r\n n, h = map(int, input().strip().split())\r\n \r\n a = 0.5 * h\r\n sa = a / n\r\n b = 1\r\n for i in range(n - 1):\r\n sh = math.sqrt( (i + 1) * 2 * sa * h )\r\n print(sh, end = '') if i == (n - 2) else print(sh, end = ' ')\r\n \r\n print()", "import math\r\nn,h = map(int,input().split())\r\nfor i in range(1,n):\r\n print(h*math.sqrt(i/n))", "import math\n\nn, h = map(int,input().split())\ns = h*h/n\nfor i in range( 1, n ):\n\tif i != 1:\n\t\tprint(\" \",end=\"\")\n\tprint(math.sqrt(s*i), end=\"\")\nprint()", "n, h = map(int, input().split())\r\nimport math\r\nans = []\r\nfor i in range(1, n):\r\n x = h*math.sqrt(i/n)\r\n ans.append(x)\r\nprint(*ans)\r\n", "import math\nn, h = [float(x) for x in input().split()]\nbase=1\nctgL= (base/2)/h\n\nexpectedArea = (1*h/2)/n\nexpectedArea=expectedArea/2\n\nnew_base = base/2\ncurr_height = h\n\ndef bin_search(new_base, min_height, max_height):\n try_height = (min_height+max_height)/2\n area = ((2*new_base - try_height*ctgL)/2)*try_height\n if(abs(area-expectedArea)<1e-9):\n return try_height\n else:\n if area>expectedArea:\n return bin_search(new_base, min_height,try_height)\n else:\n return bin_search(new_base, try_height, max_height)\ndef calculate_new_base(old_base, height):\n return old_base-height*ctgL\ncuts = []\nfor i in range(int(n)-1):\n cut_height = bin_search(new_base, 0, curr_height)\n # print(cut_height)\n cuts.append(cut_height)\n new_base = calculate_new_base(new_base,cut_height)\n curr_height = curr_height - cut_height\n # print(new_base, curr_height)\ncuts_sum=0\nto_print = []\nfor cut in cuts:\n cuts_sum+=cut\n to_print.append((h-cuts_sum))\nfor x in reversed(to_print):\n print(x, end=\" \")\n", "import math\r\nn,h = map(int, input().split())\r\nans = []\r\nfor i in range(1,n):\r\n ans.append(str(h * math.sqrt(i/n)))\r\nprint(' '.join(ans))", "#\n# Joseph Matsushita\n# Problem F\n#\n\nimport math\n\nn, h = map(int, input().split())\n\nfor i in range(1, n):\n print(h * math.sqrt(i / n))\n\t\t \t\t\t \t\t\t \t \t \t\t\t \t \t\t", "n,h=map(int,input().split());print(*[h*(i/n)**.5 for i in range(1,n)])", "import math\r\n\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\ndef ri():\r\n return int(input())\r\n\r\nn,h=rl()\r\n\r\ndef check(x,s):\r\n global h\r\n ss=x/h*x/2\r\n if ss>s:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nfor i in range(n-1):\r\n s=h/2/n*(i+1)\r\n f=0\r\n e=h\r\n while e-f>0.0000001:\r\n mid=(f+e)/2\r\n if check(mid,s):\r\n e=mid\r\n else:\r\n f=mid\r\n print(f)", "n, h = map(int, input().split())\nfor i in range(1, n):\n print((i / n) ** 0.5 * h, end=' ')\n", "import math\r\nn, h = [int(i) for i in input().split()]\r\n\r\npp = h / 2\r\n\r\nprzydzial = pp / n\r\n\r\nz = math.sqrt(2*przydzial*h)\r\n\r\nfor i in range(n-1):\r\n print(math.sqrt(2*przydzial*(i+1)*h), end=\" \")", "import math\r\n\r\nn, h = map(int, input().split())\r\n\r\nsqrt_n = math.sqrt(n)\r\n\r\nfor i in range(1, n):\r\n sqrt_i = math.sqrt(i)\r\n print(sqrt_i * sqrt_n * h / n, end=\" \")", "n, h = map(int, input().split())\nx = 0\nres = []\nfor i in range(n - 1):\n p = 2 * x / h\n ok, ng = x, h\n while ng - ok > 1e-10:\n m = (ok + ng) / 2\n q = 2 * m / h\n if (p + q) * (m - x) / 2 < h / n:\n ok = m\n else:\n ng = m\n x = ok\n res.append(x)\nprint(*res)", "import sys\nimport math\ninp = sys.stdin.readline().replace(\"\\n\",\"\").split()\n\nn = int(inp[0])\nh = int(inp[1])\n\nfor i in range(1,n):\n print(math.sqrt(h*h/n*i), end=' ')\n \t \t \t \t\t \t\t\t\t\t\t \t\t \t\t \t\t\t\t", "n, h = [int(x) for x in input().split(' ')]\n\n\nx = [h / (n ** 0.5)]\nfor i in range(n-2):\n x.append((h ** 2 / n + x[i] ** 2) ** 0.5)\nprint(' '.join([str(i) for i in x]))\n\t\t\t\t \t\t\t\t \t \t\t\t \t \t\t \t\t", "N, H = map(int, input().split())\nfor i in range(1, N):\n print('%.10f' % (i ** 0.5 * H / N ** 0.5))\n", "n, h = map(int, input().strip().split())\n\ns = h / 2 / n # для одного кроли\n\ntg = h * 2\n\nh1 = (s * tg) ** (1 / 2)\nprint(h1, end=' ')\n\nfor i in range(n - 2):\n x = h1 / tg * 2\n l, r = h1, h\n for j in range(1000):\n m = (l + r) / 2\n h2 = m - h1\n #print(x, m / tg)\n ss = (x + m / tg * 2) / 2 * h2\n #print(ss, s)\n if (ss > s):\n r = m\n else:\n l = m\n h1 = (l + r) / 2\n print(h1, end =' ')\n \n\n", "import math\r\nn,h=map(int,input().split())\r\nfor i in range(n-1):\r\n print(math.sqrt((i+1)*((h**2)/n)),end=\" \")", "import math\r\nn,h=map(int,input().split())\r\nll,b=[],1\r\nwhile n>1:\r\n h=h*(math.sqrt(b**2-((b**2)/n)))/b\r\n b=math.sqrt(b**2-((b**2)/n))\r\n n-=1\r\n ll.append(h)\r\nll.sort()\r\nprint(*ll)", "import math\n\nn, h = [int(x) for x in input().split()]\n\n# area de cada parte\nparte = (1*h/2)/n\n# cortes a hacer\ncortes = list()\n\nfor i in range(1, n):\n hcorte = math.sqrt(2*i*parte*h)\n cortes.append(hcorte)\n\nprint(' '.join([str(c) for c in cortes]))\n\n \t \t \t\t \t \t\t \t\t \t \t\t\t \t \t", "#794B\r\nfrom math import sqrt\r\n[n,h] = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n print(sqrt(i/n)*h,end=' ')", "entrada = input()\nentrada = entrada.split(' ')\n\nn = int(entrada[0])\nh = int(entrada[1])\n\narea_comum = (h/2)/n\n\nlista_alturas = []\n\ncorte_atual = h\n\nfor i in range(n):\n base = ((i/n)**0.5)*h\n lista_alturas.append(str(base))\n\nlista_alturas.pop(0)\nprint(' '.join(lista_alturas))\n\t\t \t\t\t\t\t\t\t\t\t\t\t \t \t\t \t \t\t", "n,h = input().split()\r\nn,h = int(n),int(h)\r\n\r\nfor i in range(1,n):\r\n a = (i**0.5)/(n**0.5)*h\r\n print(\"%.12f\"%a)", "import math\r\nn,h=[int(x) for x in input().split(' ')]\r\nfor i in range(n-1):\r\n\tprint(math.sqrt((i+1)/(n))*h,end=\" \")\r\nprint()\r\n", "n, h = map(int, input().split())\r\nfor i in range(1,n):\r\n res = (i / n)**(1/2) * h\r\n print(res, end=' ')", "# from math import atan2, degrees\nimport math\n# # h = 25 # Monitor height in cm\n# # d = 60 # Distance between monitor and participant in cm\n# # r = 768 # Vertical resolution of the monitor\n\n# x=input()\n# x=x.split(' ')\n# h=1\n# d=float(int(x[1]))\n# # Calculate the number of degrees that correspond to a single pixel. This will\n# # generally be a very small value, something like 0.03.\n# deg = degrees(atan2(.5*h, d)) / (.5)\n# # print '%s degrees correspond to a single pixel' % deg_per_px\n\n# area=1/2\n# area*=h*d\n# n=int(x[0])\n\n# want=area/n\n# n_area=0\n# sine=math.sin(deg)\n# hyp=math.sqrt(.25+d*d)\n\n# while(n>1):\n# \tn_area+=want\n# \tn_hyp=n_area*2/sine\n# \tn_hyp=math.sqrt(n_hyp)\n# \tprint(d*(n_hyp/hyp),\" \",)\n# \tn-=1\n\nx=input()\nx=x.split(' ')\nn=int(x[0])\nh=int(x[1])\narea=h/2\nwant=area/n\nn_want=0;\nwhile(n>1):\n\tn-=1;\n\tn_want+=want;\n\tratio=area/n_want;\n\tratio=math.sqrt(ratio);\n\t# cout<<h/ratio<<\" \";\n\tprint(h/ratio, end=' ')\n", "n, h = map(int, input().split())\narr = list()\nfor i in range(1, n):\n ans = h * (i / n) ** 0.5\n arr.append(ans)\ns = \"\"\nfor el in arr:\n s += str(el)\n s += \" \"\nprint(s)\n \t\t \t \t\t\t \t \t\t \t \t \t \t\t\t", "\r\nimport math\r\n\r\n[n,h]=list(map(int,input().split()))\r\n\r\nfor i in range(1,n):\r\n answer=h*math.sqrt(i/n)\r\n print (answer, \" \", end='')\r\n\r\n", "import math\r\nimport sys\r\n\r\nn,h=map(int,input().split())\r\n\r\nfor i in range(1,n):\r\n new_h=(h*h*i/n)**0.5\r\n print(\"%.12f\"%(new_h))\r\n\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\nimport heapq\r\nn,h=map(int,sys.stdin.readline().split())\r\ncnt=1\r\narea=h/2\r\nans=[0 for _ in range(n-1)]\r\nind=0\r\nsmallarea=area/n\r\nwhile cnt<n:\r\n\tans[ind]=math.sqrt((2*smallarea*cnt)/h)*h\r\n\tind+=1\r\n\t#print(ans)\r\n\tcnt+=1\r\nprint(*ans)\r\n\r\n", "from math import pi\r\n\r\n\r\ndef main():\r\n n, h = [int(i) for i in input().split()]\r\n s = h / 2 / n\r\n tg = 0.5 / h\r\n for i in range(1, n):\r\n sep = ' ' if i < n - 1 else ''\r\n _s = s * i\r\n print((_s / tg) ** 0.5, end=sep)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, h = map(int, input().split())\r\n\r\nfor i in range(1, n):\r\n print(h*(i/n)**0.5, end=' ')", "def solve(n,h):\n\n area_p = h/(2*n)\n resp = []\n areas = [0]\n\n for _ in range(n-1):\n \n cut = (2*h*(area_p+areas[-1]))**0.5\n resp.append(cut)\n areas.append(cut**2/(2*h))\n\n return resp\n\n\n\narr = [int(a) for a in input().split(\" \")]\n\nn = arr[0]\nh = arr[1]\n\nprint(\" \".join([str(a) for a in solve(n,h)]))\n\t\t \t\t\t\t \t\t \t\t\t\t\t\t \t\t\t\t\t \t", "from math import sqrt\nn,h = map(int, input().split())\nx1 = h/(sqrt(n))\nprint(\" \".join([str(sqrt(i)*x1) for i in range(1,n)]))", "import math\nn,h=[int(x) for x in input().split()]\nfor i in range(1,n):\n print(math.sqrt(i/n)*h,end=' ')", "n,h=map(int,input().split())\r\n\r\nh_unit=h/(n**.5)\r\nresults=[None]*(n-1)\r\nfor i in range(n-1):\r\n\tresults[i]=h_unit*((i+1)**.5)\r\nprint(' '.join(map(str,results)))", "import math\r\nn,h=list(map(int,input().split()))\r\nf=math.sqrt(n)\r\nf=h/f\r\nj=0\r\nfor i in range(1,n):\r\n j=math.sqrt(i)\r\n print(j*f,end=' ')\r\n", "n,h=map(int,input().split())\r\nss=h/2\r\nH=[0]*n\r\nfor i in range(n):\r\n x=ss/n\r\n k=(x*(i+1)/ss)**(1/2)\r\n H[i]=x*(i+1)/k*2\r\nfor i in range(n-1):\r\n print(H[i],end=\" \")", "n, h = map(int,input().split())\r\ns = h / 2 / n\r\nk = 0\r\nfor i in range (1, n):\r\n k = ((s * n) / (s * i)) ** 0.5\r\n print (h / k, end = \" \")", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(n, h):\r\n answer = []\r\n for i in range(1, n):\r\n answer.append(h*(i/n)**0.5)\r\n return answer\r\n #ai*(ai/h)/2 = (h*i)/(2*n)\r\n #ai\r\nn, h = [int(x) for x in input().split()]\r\nanswer = process(n, h)\r\nsys.stdout.write(' '.join(map(str, answer))+'\\n')", "import math\r\nn, h = map(int, input().split())\r\nfor num in range(1, n):\r\n print(math.sqrt(num/n) * h)", "from math import sqrt\nn, h = map(int, input().split())\ns = []\nfor i in range(1,n):\n s.append(h*sqrt(i/n))\nprint(*s)", "import sys\r\nfrom math import sqrt\r\n\r\ndef main():\r\n n,h=list(map(int,sys.stdin.readline().split()))\r\n \r\n sn=sqrt(n)\r\n result=[]\r\n for i in range(n-1):\r\n result.append(sqrt(i+1)*h/sn)\r\n \r\n sys.stdout.write(' '.join(map(str,result))+'\\n')\r\n \r\nmain()\r\n\r\n", "import math\r\ndef main():\r\n chunk, h = list(map(int, input().split()))\r\n # print(chunk, h)\r\n for i in range(1, chunk):\r\n print(h * math.sqrt(i)/math.sqrt(chunk))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\n\r\nnow = input().split()\r\nn = int(now[0])\r\nh = int(now[1])\r\n\r\nprint(math.sqrt(h*h/n),end='')\r\nfor x in range(2,n):\r\n print(end=\" \")\r\n print(math.sqrt(h*h/n*x))\r\n\r\n", "digit,height = map(int,input().split())\nfor i in range(1,digit):\n print(height*(i/digit)**.5)\n \t \t\t \t \t\t\t \t\t\t\t\t\t", "import math\r\nn,h = map(int,input().split())\r\nres = []\r\nfor i in range(1,n):\r\n x = h*(math.sqrt(i/n))\r\n res.append(x)\r\nprint(*res)", "from math import sqrt\r\nn,h=map(int, input().split())\r\nresult=[]\r\nfor i in range(1,n):\r\n result.append(h*sqrt(i/n))\r\nprint(*result)", "n , h = input().split(' ')\r\nn = int(n)\r\nh = int(h)\r\n\r\n#In two similar triangles, the ratio of their\r\n# areas is the square of the ratio of their sides.\r\nfor i in range(1,n):\r\n print(((i/n)**0.5)*h)\r\n\r\n \r\n\r\n", "\nimport sys\nimport os\nimport math\nimport re\n\nn,h = map(int,input().split())\n\nfor i in range(1,n):\n print(str(h*math.sqrt(i/n)) + \" \",end = \"\")\n\nprint()\n", "n,h=map(int,input().split())\r\nfor i in range(1,n):\r\n print(h*(i/n)**.5,end=' ')\r\n ", "[n,h] = list(map(int, input().split()))\r\noutput = []\r\nfor i in range(1, n):\r\n output.append(((i/n)**0.5)*h)\r\nprint(\" \".join(list(map(str,output))))\r\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\nfrom decimal import Decimal\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\nn, h = rint()\n\nAs = Decimal(h) / Decimal(2*n)\nx = []\nfor i in range(1, n):\n x.append(Decimal(i*As*2*h).sqrt())\n\nprint(*x)\n", "import math\r\nn, h = map(int, input().split())\r\nfor i in range(1, n):\r\n if i > 1:\r\n print(' ', end='')\r\n print(math.sqrt(i / n / 1.0) * h, end='')\r\n", "n,h = map(int,input().split())\r\na = []\r\nfor i in range(1,n):\r\n a.append(h*(((n-i)/n))**0.5)\r\nprint(*a[::-1])", "from math import sqrt\r\n\r\nn,h=[int(element) for element in input().split(' ')]\r\n\r\nanswer=[]\r\nfor i in range(1,n):\r\n answer.append(str(h*sqrt(i/n)))\r\n\r\nprint(('\\n').join(answer))" ]

[ "def mask(x):\n s = \"\"\n for i in str(x):\n if i == '4' or i == '7':\n s += i\n return int(s)\n\na, b = map(int, input().split())\nfor i in range(a + 1, 177778):\n if '4' in str(i) or '7' in str(i):\n if mask(i) == b:\n print(i)\n break", "import sys\r\n\r\ndef fx(a):\r\n sa=str(a)\r\n m=\"\"\r\n for i in range(len(sa)):\r\n if sa[i]=='4' or sa[i]=='7':\r\n m+=sa[i]\r\n\r\n if len(m)>0:\r\n n=int(m)\r\n else:\r\n n=0\r\n \r\n return n\r\n\r\na,b=map(int,input().split())\r\n\r\nwhile 1:\r\n a+=1\r\n x=fx(a)\r\n if x==b:\r\n print(a)\r\n exit(0)\r\n", "def mask(a):\r\n x1 = str(a)\r\n new_str = \"\"\r\n len1 = 0\r\n \r\n for i in range(len(x1)):\r\n if x1[i] =='4' or x1[i] =='7':\r\n new_str += x1[i]\r\n \r\n #print(new_str)\r\n if len(new_str)>0:\r\n len1 = int(new_str)\r\n #print(n)\r\n \r\n return len1\r\n\r\na, b = map(int,input().split())\r\nwhile 1:\r\n a += 1\r\n \r\n if mask(a)==b:\r\n print(a)\r\n break", "'''\r\nCreated on Feb 11, 2015\r\n\r\n@author: mohamed265\r\n'''\r\ndef mask (a):\r\n temp = ''\r\n lenA = len(a)\r\n for i in range(lenA): \r\n if a[i] == '4' or a[i] == '7':\r\n temp += a[i]\r\n return temp\r\ntemp = input().split()\r\na = int(temp[0]) + 1 \r\nb = temp[1]\r\nwhile mask(str(a)) != b:\r\n a += 1\r\nprint(a)", "def main():\n s, mask = input().split()\n chk = lambda x: ''.join(c for c in str(x) if c in ('4,7')) == mask\n i = int(s) + 1\n for i in range(i, i + 10):\n if chk(i):\n return print(i)\n for i in range(max(i, int(mask)) // 10 * 10 + int(mask[-1]), 999999, 10):\n if chk(i):\n return print(i)\n\n\nif __name__ == '__main__':\n main()\n", "\r\ndef mask(x,k):\r\n t=\"\"\r\n for i in x:\r\n if i in \"47\":t+=i\r\n return t!=k\r\na,b=map(int,input().split())\r\nz=a\r\nwhile mask(str(a),str(b)) or a<=z:a+=1\r\nprint(a)", "def readln(): return tuple(map(int, input().split()))\n\na, b = readln()\n\ndef getmask(d):\n v = ''.join([_ for _ in list(str(d)) if _ in ['4', '7']])\n return 0 if v == '' else int(v)\nc = a + 1\nwhile True:\n if getmask(c) == b:\n break\n c += 1\nprint(c)\n", "def get_mask(x):\n ans = ''\n for c in str(x):\n if c == '4' or c == '7':\n ans += c\n return ans\n\ndef solve_case():\n a, b = map(str, input().split())\n a = int(a)\n\n while True:\n a += 1\n if get_mask(a) == b:\n print(a)\n break\n\nsolve_case()\n", "s = input()\n\na = int(s.split()[0])\nb = int(s.split()[1])\n\ndef getMask(num):\n s = str(num)\n l = [c for c in s if c=='4' or c=='7']\n if len(l) == 0:\n return 0\n return int(''.join(l))\n\nans = a + 1\nwhile not getMask(ans) == b:\n ans = ans + 1\n\nprint(ans) \n", "import sys\r\n\r\ndef fx(rf):\r\n ed=str(rf)\r\n xc=\"\"\r\n for md in range(len(ed)):\r\n if ed[md]=='4' or ed[md]=='7':\r\n xc+=ed[md]\r\n\r\n if len(xc)>0:\r\n ha=int(xc)\r\n else:\r\n ha=0\r\n \r\n return ha\r\n\r\nrf,kav=map(int,input().split())\r\n\r\nwhile 1:\r\n rf+=1\r\n gb=fx(rf)\r\n if gb==kav:\r\n print(rf)\r\n exit(0)", "def lucky(x):\n s = str(x)\n ans = \"\"\n for char in s:\n if char == '4' or char == '7':\n ans += char\n\n if ans == \"\":\n return 0\n else:\n return int(ans)\n \na, b = [int(i) for i in input().split()]\nwhile True:\n a += 1\n x = lucky(a)\n if x == b:\n print(a)\n break\n\t\t\t\t\t\t \t\t \t \t\t\t \t \t\t \t \t\t", "a,b=map(str,input().split())\r\n\r\ndef mask(x):\r\n st=''\r\n for i in str(x):\r\n if i=='7' or i=='4':\r\n st+=i\r\n return(st)\r\n\r\n\r\nfor i in range(int(a)+1,177778):\r\n if mask(i)!=b:\r\n pass\r\n else:\r\n print(i)\r\n quit()\r\n", "\r\nimport math \r\n\r\ndef mask(x):\r\n tmp,res=0,0\r\n while(x):\r\n if(x%10==4 or x%10==7):\r\n tmp=tmp*10+(x%10)\r\n x//=10\r\n while(tmp):\r\n res=res*10+(tmp%10)\r\n tmp//=10\r\n return res\r\ntry:\r\n t=1\r\n while(t):\r\n t-=1\r\n a,b=map(int,input().split())\r\n a+=1\r\n while(mask(a)!=b):\r\n a+=1\r\n print(a)\r\n\r\n\r\n\r\nexcept:\r\n pass\r\n", "a, b = map(int, input().split())\r\nc = -1\r\nwhile c != b:\r\n a += 1\r\n c, pow10 = a, 1\r\n while pow10 <= c:\r\n if c // pow10 % 10 in (4, 7):\r\n pow10 *= 10\r\n else:\r\n c = c % pow10 + c // pow10 // 10 * pow10\r\nprint(a)\r\n", "a, b = list(map(int, input().split()))\r\nwhile True:\r\n a += 1\r\n sta = str(a)\r\n m = \"\"\r\n n = 0\r\n for i in range(len(sta)):\r\n if sta[i] == '4' or sta[i] == '7':\r\n m += sta[i]\r\n if len(m) > 0:\r\n n = int(m)\r\n\r\n if n == b:\r\n print(a)\r\n break\r\n", "# Nome: Matheus de Souza Oliveira RA: 203407\n\ninputNumbers = input().split(\" \")\na = int(inputNumbers[0])\nb = int(inputNumbers[1])\narrayForA = list(map(int, inputNumbers[0]))\n\nlukcyNumbersForA = \"\"\nluckMask = 0\n\nwasNumberCFound = False\n\nwhile wasNumberCFound == False:\n a += 1\n arrayForA = list(map(int, str(a)))\n\n for number in arrayForA:\n if number == 4 or number == 7:\n lukcyNumbersForA += str(number)\n\n if len(lukcyNumbersForA) > 0:\n luckMask = int(lukcyNumbersForA)\n\n if luckMask == b:\n print(a)\n wasNumberCFound = True\n else:\n lukcyNumbersForA = \"\"\n\n\t\t \t \t \t \t\t \t\t\t \t\t \t\t \t\t", "def solve(str_):\n res=\"\"\n for i in str_:\n if i == \"7\" or i == \"4\":\n res+=i\n if len(res)>0:\n ans=int(res)\n else:\n ans=0\n return ans\n\na,b=map(int,input().split())\nwhile True:\n a+=1\n a_str=str(a)\n res=\"\"\n if solve(a_str) == b:\n print(a)\n break\n \t\t\t \t \t\t\t\t \t \t\t\t\t\t \t\t\t \t\t", "def lucky(a):\r\n s=str(a)\r\n n=\"\"\r\n for i in s:\r\n if i=='4' or i=='7':\r\n n+=i\r\n if len(n)>0:\r\n n=int(n)\r\n else:\r\n n=0\r\n return n\r\n\r\na,b=map(int,input().split())\r\nwhile True:\r\n a+=1\r\n x=lucky(a)\r\n if x==b:\r\n print(a)\r\n break", "import sys\r\n\r\ndef wear(dul):\r\n qok=str(dul)\r\n xc=\"\"\r\n for md in range(len(qok)):\r\n if qok[md]=='4' or qok[md]=='7':\r\n xc+=qok[md]\r\n\r\n if len(xc)>0:\r\n ha=int(xc)\r\n else:\r\n ha=0\r\n \r\n return ha\r\n\r\ntho,yu=map(int,input().split())\r\nwhile 1:\r\n tho+=1\r\n sam=wear(tho)\r\n if sam==yu:\r\n print(tho)\r\n exit(0)", "# https://codeforces.com/problemset/problem/146/B\ndef get_mask(number):\n mask = ''\n for digit in str(number):\n if digit in {'4', '7'}:\n mask += digit\n if mask == '':\n return 0\n return int(mask)\n\n\ndef find_minimum_c(a, b):\n c = a + 1\n while True:\n if get_mask(c) == b:\n return c\n c += 1\n\n\n# Example usage:\na, b = map(int, input().split())\nresult = find_minimum_c(a, b)\nprint(result) # Output: 7\n", "a, b = input().split()\r\nfor i in range(max(int(a) + 1, int(b)), 999999):\r\n if ''.join(c for c in str(i) if c in ('4,7')) == b:\r\n print(i)\r\n break", "from collections import deque,Counter\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\nfrom sys import stdin\nfrom heapq import *\nimport copy\ninput = lambda: sys.stdin.readline().rstrip()\n\n'''\nfor _ in range(int(input())):\n n = int(input())\n a = list(map(int,input().split()))\n b = list(map(int,input().split()))\n heapq._heapify_max(a) \n heapq._heapify_max(b) \n ans = 0\n while len(a)!=0:\n x = heapq._heappop_max(a) \n y = heapq._heappop_max(b) \n var = 0\n while x!=y:\n if x>y:\n x = floor(log10(x))+1\n var+=1\n else:\n y = floor(log10(y))+1\n var+=1\n ans+=var \n print(ans)\n'''\ndef islucky(n,b):\n ans = 0\n first = floor(log10(n))\n while n!=0:\n v = n//pow(10,first)\n if v==4 or v==7:\n ans = ans*10 + v\n n-=(v*(pow(10,first)))\n first-=1\n return int(ans)==b\n\na,b = map(int,input().split())\nif b>a:\n print(b)\nelse:\n a+=1\n while islucky(a,b)==False:\n a+=1\n print(a)\n\n\n\n\n\n\n\n\n", "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\na,b = map(int,input().split())\r\n\r\ns = set([4,7])\r\nfor i in range(a+1, 2*10**6):\r\n bb = b\r\n ii = i\r\n aa = []\r\n while i:\r\n if i % 10 in s:\r\n aa.append(i%10)\r\n i //= 10\r\n ans = 0\r\n for i in aa[::-1]:\r\n ans *= 10\r\n ans += i\r\n if ans == bb:\r\n print(ii)\r\n break\r\n", "import sys\r\nimport math\r\n\r\na, b = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nfor i in range(a + 1, 1000000):\r\n \r\n \r\n \r\n p = 10\r\n k = 1\r\n vs = 0\r\n n = 1\r\n while(int(i / p) > 0):\r\n t = int(i % p / k)\r\n if(t == 4 or t == 7):\r\n vs += t * n\r\n n *= 10\r\n p *= 10\r\n k *= 10\r\n t = int(i % p / k) \r\n if(t == 4 or t == 7):\r\n vs += t * n\r\n n *= 10\r\n if(vs == b):\r\n print(i)\r\n break\r\n ", "def mask(s):\r\n\tt='0'\r\n\tfor i in s:\r\n\t\tif i=='4' or i=='7':\r\n\t\t\tt+=i\r\n\treturn t\r\n\r\na,b=map(int,input().split())\r\n\r\nc=a\r\n\r\nwhile True:\r\n c=c+1\r\n if int(mask(str(c)))==b:\r\n print(c)\r\n exit(0)", "def f(x):\r\n s=\"0\"\r\n for c in str(x):\r\n if c=='7' or c=='4':\r\n s+=c\r\n return int(s)\r\n\r\na,b=map(int,input().split())\r\nx=a+1\r\nwhile f(x)!=b:\r\n x+=1\r\nprint(x)\r\n\r\n", "def mask(x):\n string_x = str(x)\n mask = \"\"\n \n for i in range(len(string_x)):\n if string_x[i] == '4' or string_x[i] == '7':\n mask += string_x[i]\n \n if len(mask) > 0:\n return int(mask)\n else:\n return 0\n \nif __name__ == \"__main__\":\n a_b = input().split(' ')\n a = int(a_b[0])\n b = int(a_b[1])\n \n while True:\n a += 1\n aux = mask(a)\n \n if aux == b:\n print(a)\n break\n \t \t\t \t\t\t\t \t\t\t\t\t \t \t", "a=input()\r\nlist1 = a.split(' ')\r\nnum1=list1[0]\r\nnum2=list1[1]\r\n\r\ndef mask(num):\r\n num=str(num)\r\n str1=\"\"\r\n for i in range(0,len(num)):\r\n if (ord(num[i])-48)==7 or (ord(num[i])-48)==4:\r\n str1=str1+num[i]\r\n return str1\r\n\r\nfor i in range(int(num1)+1,1000000):\r\n if mask(i)==num2:\r\n print(i)\r\n quit()\r\n\r\n", "s=input()\r\na,b=(s.split()[0]),(s.split()[1])\r\ndif=len(a)-len(b)\r\n\r\nmask=''\r\ntmp=int(a)\r\ntmp+=1\r\nt=str(tmp)\r\nwhile(1):\r\n for i in t:\r\n if(i in ['4','7']):\r\n mask+=i\r\n if(mask==b):\r\n break\r\n else:\r\n tmp+=1\r\n t=str(tmp)\r\n mask=''\r\n\r\n \r\nprint(tmp)\r\n", "a, b = map(int, input().split())\r\nans = 0\r\nwhile True:\r\n a += 1\r\n if(a == b):\r\n ans = b\r\n break\r\n else:\r\n temp = list(str(a))\r\n tempAns = \"\"\r\n for ch in temp:\r\n if(ch == '7' or ch == '4'):\r\n tempAns += ch\r\n if(len(tempAns) > 0):\r\n tempNum = int(tempAns)\r\n if(tempNum == b):\r\n ans = a\r\n break\r\nprint(ans)", "a, b= input().split()\r\nhap= True\r\nx, dig=int(a)+1, int(0)\r\n# while(x!=0):\r\n# x/=10\r\n# dig+=1\r\nwhile (hap):\r\n mask=\"\"\r\n for y in str(x):\r\n if(int(y)==4 or int(y)==7):\r\n mask+=y\r\n if(mask==b):\r\n hap=False\r\n print(x)\r\n x+=1\r\n # a+=pow(10,dig)", "def check(N,B):\r\n checking = \"\"\r\n for i in range(len(N)):\r\n if N[i] == \"4\" or N[i] == \"7\":\r\n checking += N[i]\r\n if checking == B:\r\n return True\r\n return False \r\n \r\ndef question2():\r\n A,B = input().split()\r\n A = int(A) + 1\r\n while True:\r\n if check(str(A),B):\r\n return int(A)\r\n A += 1 \r\n \r\n \r\n \r\n# remained_test_cases = int(input())\r\nremained_test_cases = 1 \r\nwhile remained_test_cases > 0:\r\n print(question2())\r\n remained_test_cases -= 1 ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b = map(int, input().split())\r\nb = str(b)\r\nans = a + 1\r\nwhile True:\r\n u = list(str(ans))\r\n v = []\r\n for i in u:\r\n if i == \"4\" or i == \"7\":\r\n v.append(i)\r\n if \"\".join(v) == b:\r\n break\r\n ans += 1\r\nprint(ans)" ]

[ "a = [int(i) for i in input().split()]\nprint(min(a[0], a[1], a[2] // 2, a[3] // 7, a[4] // 4))", "a,b,c,d,e = map(int,input().split())\nprint(min(a,b,c // 2,d // 7,e // 4))", "cnt = [1, 1, 2, 7, 4]\narr = list(map(int, input().split(\" \")))\n \nfor i in range(5):\n arr[i] //= cnt[i]\n \nprint(min(arr))\n", "from collections import defaultdict, deque\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n##############################################################################\r\na = list(map(int,input().split()))\r\nprint(min(a[0],a[1],a[2]//2,a[3]//7,a[4]//4))", "# LUOGU_RID: 112765057\n[a, b, c, d, e] = [int(x) for x in input().split()]\nprint(min(a, b, c // 2, d // 7, e // 4))", " \r\na = list(map(int, input().split()))\r\nb = [ 1, 1, 2, 7, 4 ]\r\n \r\nprint(min([ x//y for x, y in zip(a,b) ]))", "a, b, c, d, e = map(int, input().split(' '))\r\nprint(min(a, b, c // 2, d // 7, e // 4))", "a = list(map(int,input().split()))\r\nprint(min(a[0],a[1],a[2]//2,a[3]//7,a[4]//4))\r\n\r\n", "a = list(map(int, input().split()))\r\nres = a[0]\r\nres = min(res, a[1])\r\nres = min(res, a[2] // 2)\r\nres = min(res, a[3] // 7)\r\nres = min(res, a[4] // 4)\r\nprint(res)\r\n", "a,b,c,d,e=map(int,input().split());print(min(a,b,c//2,d//7,e//4))", "a=list(map(int,input().split()))\r\nans=min(a[0],a[1],a[2]/2,a[3]/7,a[4]/4)\r\nprint(int(ans))", "a = list(map(int, input().split()))\r\nprint(min(\r\n a[0],\r\n a[1],\r\n a[2] // 2,\r\n a[3] // 7,\r\n a[4] // 4\r\n))\r\n", "a=input().split()\r\n#a=list(map(int,a))\r\na=[int(i) for i in a]\r\nprint(int(min(a[0],a[1],a[2]/2,a[3]/7,a[4]/4)))", "i = list(map(int,input().split()))\r\n\r\n\r\ndef MagnumOpus(arr):\r\n\treturn min([arr[0],arr[1],arr[2]//2,arr[3]//7,arr[4]//4])\r\n\r\nif __name__ == '__main__':\r\n\tprint(MagnumOpus(i))", "a = list(map(int, input().split(' ')))\r\nprint(int(min(a[0],a[1],a[2]/2,a[3]/7,a[4]/4)))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 23:38:45\nLastEditTime: 2021-11-04 23:44:38\nDescription: \nFilePath: CF409C.py\n'''\n\n\ndef func():\n lst = list(map(int, input().strip().split()))\n recipe = [1, 1, 2, 7, 4]\n return min(map(lambda x, y: x//y, lst, recipe))\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "a,b,c,d,e = [int(x) for x in input().split()]\nprint(min(a,b,c//2,d//7,e//4))\n" ]

[ "from collections import defaultdict, Counter,deque\r\nfrom math import sqrt, log10, log, floor, factorial,gcd\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import permutations,combinations\r\nimport sys, io, os\r\ninput = sys.stdin.readline\r\n# input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# sys.setrecursionlimit(10000)\r\ninf = float('inf')\r\nmod = 10 ** 9 + 7\r\ndef yn(a): print(\"YES\" if a else \"NO\")\r\nceil = lambda a, b: (a + b - 1) // b\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nclass masks:\r\n def all_masks_sos(self,arr,lim=22):\r\n lim = 22\r\n maxbits = lim\r\n self.masks=masks = 1 << lim\r\n self.dp = [-1] * masks\r\n for i in arr:\r\n self.dp[i] = i\r\n for i in range(masks):\r\n for j in range(maxbits):\r\n if self.dp[i] == -1 and i & (1 << j):\r\n self.dp[i] = self.dp[i - (1 << j)]\r\n\r\nt=1\r\nm=masks()\r\nfor i in range(1):\r\n n=int(input())\r\n l=[int(i) for i in input().split()]\r\n m.all_masks_sos(l,22)\r\n ans = [m.dp[i ^ (m.masks - 1)] for i in l]\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "input()\r\nm=1<<22\r\na=list(map(int,input().split()))\r\ndp=m*[-1]\r\nfor k in a:dp[k]=k\r\nfor i in range(m):\r\n for b in range(22):\r\n z=dp[i^1<<b]\r\n if 1<<b&i and z!=-1:dp[i]=z\r\nfor x in a: print(dp[m-1-x], end=' ')\r\n", "from collections import defaultdict, Counter,deque\r\nfrom math import sqrt, log10, log, floor, factorial,gcd\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import permutations,combinations\r\nimport sys, io, os\r\ninput = sys.stdin.readline\r\ninput=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# sys.setrecursionlimit(10000)\r\ninf = float('inf')\r\nmod = 10 ** 9 + 7\r\ndef yn(a): print(\"YES\" if a else \"NO\")\r\nceil = lambda a, b: (a + b - 1) // b\r\nlim=22\r\npo=[1<<j for j in range(lim+1)]\r\nmaxbits=lim\r\nmasks=po[lim]\r\ndp=[-1]*masks\r\nt=1\r\n\r\nfor i in range(1):\r\n n=int(input())\r\n l=[int(i) for i in input().split()]\r\n for i in l:\r\n dp[i]=i\r\n for i in range(masks):\r\n for j in range(maxbits):\r\n if dp[i]==-1 and i&(1<<j):\r\n dp[i]=dp[i-(1<<j)]\r\n ans=[dp[i^(masks-1)] for i in l]\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys,io,os,math\r\ntry:yash=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nexcept:yash=lambda:sys.stdin.readline().encode()\r\nI=lambda:[*map(int,yash().split())]\r\nimport __pypy__;an=__pypy__.builders.StringBuilder()\r\nn,=I();lis=I();N=22;dp=[-1]*(1<<22)\r\nfor i in range(n):\r\n dp[lis[i]]=lis[i]\r\n for j in range(22):\r\n lis[i]^=(1<<j)\r\nfor mask in range(1<<22):\r\n for i in range(22):\r\n if (mask&(1<<i)) and dp[mask^(1<<i)]!=-1:dp[mask]=dp[mask^(1<<i)]\r\nfor num in lis:\r\n an.append(\"%s \"%(dp[num]))\r\nan.append(\"\\n\")\r\nos.write(1, an.build().encode())", "n=int(input())\r\na=[int(e) for e in input().split()]\r\nu=[0]*(1<<22)\r\nfor e in a:\r\n u[e]=1\r\nF=[0]*(1<<22)\r\nfor i in range(1,(1<<22)):\r\n if u[i]:\r\n F[i]=i\r\n else:\r\n for j in range(22):\r\n if (i&(1<<j)) and F[i-(1<<j)]:\r\n F[i]=F[i-(1<<j)]\r\n break\r\nb=[-1]*n\r\nfor i in range(n):\r\n x=(1<<22)-1-a[i]\r\n if F[x]:\r\n b[i]=F[x]\r\nprint(*b)", "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\npow2 = [1]\r\nfor _ in range(22):\r\n pow2.append(2 * pow2[-1])\r\nm = pow2[22]\r\ndp = [-1] * m\r\nfor i in a:\r\n dp[i] = i\r\np = pow2[:22]\r\nfor i in range(1, m):\r\n dpi = dp[i]\r\n if dpi == -1:\r\n continue\r\n for j in p:\r\n if dp[i | j] == -1:\r\n dp[i | j] = dpi\r\nans = []\r\nz = m - 1\r\nfor i in a:\r\n ans.append(dp[i ^ z])\r\nsys.stdout.write(\" \".join(map(str, ans)))", "\r\ndef solve(n, a):\r\n m = (1<<22)\r\n dp = [-1 for _ in range(m)]\r\n \r\n for k in a:\r\n dp[k] = k\r\n \r\n for i in range(m):\r\n for j in range(22):\r\n if (i & (1<<j)) and dp[i^(1<<j)] != -1:\r\n dp[i] = dp[i^(1<<j)]\r\n \r\n for k in a:\r\n print (dp[m-1-k], end=' ')\r\n print ()\r\n \r\n\r\ndef run():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n solve(n, a)\r\n\r\nif __name__ == '__main__':\r\n run()" ]

[ "import collections\r\n\r\nn, m = map(int, input().split())\r\nans, A, B, C = [''] * n, [], [], []\r\nd = collections.defaultdict(list)\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n d[y - 1].append(x - 1)\r\n d[x - 1].append(y - 1)\r\nfor k, v in d.items(): #set 'b'\r\n if len(v) == n - 1:\r\n ans[k] = 'b'\r\n B.append(k)\r\nfor i in range(n): #set 'a'\r\n if ans[i] == '':\r\n ans[i] = 'a'\r\n A.append(i)\r\n de = collections.deque()\r\n de.append(i)\r\n while(len(de) != 0):\r\n cur = de.popleft()\r\n for j in d[cur]:\r\n if ans[j] == '':\r\n ans[j] = 'a'\r\n A.append(j)\r\n de.append(j)\r\n break\r\nfor i in range(n): #set 'c'\r\n if ans[i] == '':\r\n ans[i] = 'c'\r\n C.append(i)\r\ntemp = sorted(A + B)\r\nfor i in A: #check 'a'\r\n d[i].append(i)\r\n if sorted(d[i]) != temp:\r\n print('No')\r\n exit(0)\r\ntemp = sorted(B + C)\r\nfor i in C:\r\n d[i].append(i)\r\n if sorted(d[i]) != temp:\r\n print('No')\r\n exit(0)\r\n\r\nprint('Yes')\r\nprint(''.join(ans))\r\n \r\n", "f = lambda: map(int, input().split())\r\nn, m = f()\r\np = [1 << i for i in range(n)]\r\nfor i in range(m):\r\n x, y = f()\r\n x -= 1\r\n y -= 1\r\n p[x] |= 1 << y\r\n p[y] |= 1 << x\r\ns = set(p)\r\nb = (1 << n) - 1\r\nt = {}\r\nif b in s:\r\n t[b] = 'b'\r\n s.remove(b)\r\nif len(s) == 2:\r\n a, c = s\r\n if a | c == b and bool(a & c) == (b in t):\r\n t[a], t[c] = 'ac'\r\n s.clear()\r\nprint('No' if s else 'Yes\\n' + ''.join(map(t.get, p)))", "from math import *\r\nN, M = 510, 3 * 10 ** 5 + 10\r\n\r\ng = [[] for _ in range(M)] \r\nn , m = map(int, input().split())\r\nmx = [[False] * N for _ in range(N + 1)] \r\n\r\nfor _ in range(m):\r\n\tu, v = map(int, input().split())\r\n\tmx[u][v] = mx[v][u] = True\r\n\r\nall_eq = True\r\nmark = [False] * N\r\nfor i in range(1, n + 1):\r\n\tfor j in range(i + 1, n + 1):\r\n\t\tif not mx[i][j]:\r\n\t\t\tall_eq = False\r\n\t\t\tmark[i] = True\r\n\t\t\tg[i].append(j)\r\n\t\t\tg[j].append(i)\r\n\r\nif all_eq:\r\n\tprint(\"YES\")\r\n\tprint(n * 'a')\r\n\texit(0)\r\nans = [-1] * N\r\n\r\ndef dfs(v, c):\r\n\tans[v] = c\r\n\tres = False\r\n\tfor u in g[v]:\r\n\t\tif ans[u] == -1:\r\n\t\t\tres |= dfs(u, 2 - c)\r\n\t\telif ans[u] == ans[v]:\r\n\t\t\treturn False\r\n\treturn res\r\n\r\nfor i in range(1, n + 1):\r\n\tif mark[i] and ans[i] == -1 and dfs(i, 0):\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\n\r\nfor i in range(1, n + 1):\r\n\tif len(g[i]) == 0:\r\n\t\tans[i] = 1\r\n\tif ans[i] == -1:\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\nfor i in range(1, n + 1):\r\n\tfor j in range(i + 1, n + 1):\r\n\t\tif mx[i][j] != (abs(ans[i] - ans[j]) != 2):\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit(0)\r\n\r\nprint(\"YES\")\r\nfor i in range(1, n + 1):\r\n\tprint(chr(ans[i] + ord('a')), end = '')\r\nprint()\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nfrom string import ascii_lowercase\n\ndef indx(c):\n global ascii_lowercase\n\n return ascii_lowercase.index(c)\n\ndef read_list():\n return [int(i) for i in input().split()]\ndef new_list(n):\n return [0 for i in range(n)]\ndef new_matrix(n, m=0):\n return [[0 for i in range(m)] for i in range(n)]\n\nn, m = read_list()\nn += 1\n\nstring = new_list(n)\n\nv = new_matrix(n, n)\n\nfor i in range(m):\n v1, v2 = read_list()\n\n v[v1][v2] = True\n v[v2][v1] = True\n\nfor i in range(1, n):\n l = v[i].count(True)\n\n if l == n-2:\n string[i] = 'b'\n\nfor i in range(1, n):\n if string[i]:\n continue\n string[i] = 'a'\n\n for j in range(1, n):\n if string[j]:\n continue\n if v[i][j] == True:\n string[i] = 'a'\n else:\n string[i] = 'c'\n\nfor i in range(1, n):\n for j in range(1, n):\n if i == j:\n continue\n if (abs(indx(string[i])-indx(string[j])) == 2 and v[i][j]) or (abs(indx(string[i])-indx(string[j])) < 2 and not v[i][j]):\n print(\"No\")\n exit()\nprint(\"Yes\")\nfor i in range(1, n):\n print(string[i], end=\"\")\nprint()\n", "def main():\n n, m = map(int, input().split())\n links = [[False] * n for i in range(n)]\n for i in range(n):\n links[i][i] = True\n for _ in range(m):\n u, v = map(int, input().split())\n u -= 1\n v -= 1\n links[u][v] = links[v][u] = True\n res = [0] * n\n ref1 = ref3 = None\n for i, link in enumerate(links):\n if all(link):\n res[i] = 2\n if not all(res):\n i = res.index(0)\n res[i] = 1\n ref1 = links[i]\n for i, f in enumerate(ref1):\n if f and not (res[i]):\n res[i] = 1\n if not all(res):\n i = res.index(0)\n res[i] = 3\n ref3 = links[i]\n for i, f in enumerate(ref3):\n if f:\n mark = res[i]\n if mark == 1:\n print(\"No\")\n return\n if not mark:\n res[i] = 3\n ref = [None, ref1, None, ref3]\n for i, mark in enumerate(res):\n if not mark:\n print(\"No\")\n return\n if mark & 1:\n if ref[mark] != links[i]:\n print(\"No\")\n return\n print(\"Yes\")\n print(''.join(\" abc\"[mark] for mark in res))\n\n\nif __name__ == '__main__':\n main()\n", "import 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\ndef BFS(s,Adj):\r\n level = {s:0}\r\n parent = {s:None}\r\n i=1\r\n frontier = [s]\r\n while frontier:\r\n next1 = []\r\n for u in frontier:\r\n for v in Adj[u]:\r\n if v not in level:\r\n level[v] = i\r\n parent[v] = u\r\n next1.append(v)\r\n frontier = next1\r\n i += 1\r\n return level\r\ndef BFS_2(s,Adj, b_dict):\r\n level = {s:0}\r\n for vertex in b_dict:\r\n level[vertex] = 0\r\n parent = {s:None}\r\n i=1\r\n frontier = [s]\r\n while frontier:\r\n next1 = []\r\n for u in frontier:\r\n for v in Adj[u]:\r\n if v not in level:\r\n level[v] = i\r\n parent[v] = u\r\n next1.append(v)\r\n frontier = next1\r\n i += 1\r\n for vertex in b_dict:\r\n del level[vertex]\r\n return level\r\nn, m = map(int, input().split())\r\nadj_list = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n adj_list[u].append(v)\r\n adj_list[v].append(u)\r\nb_dict = {}\r\nfor i in range(1, n+1):\r\n if len(adj_list[i]) == n-1:\r\n b_dict[i] = True\r\nunique_count = {}\r\nfor i in range(1, n+1):\r\n if len(adj_list[i]) != n-1:\r\n if len(adj_list[i]) not in unique_count:\r\n unique_count[len(adj_list[i])] = True\r\nif len(unique_count) > 2:\r\n print('No')\r\nelif len(unique_count) == 0:\r\n print('Yes')\r\n ans = 'b'*n\r\n print(ans)\r\nelif len(unique_count) == 1:\r\n if len(b_dict) > 0:\r\n a_val = c_val = -1\r\n a_dict = {}\r\n c_dict = {}\r\n for i in range(1, n+1):\r\n if len(adj_list[i]) != n-1:\r\n level = BFS_2(i, adj_list, b_dict)\r\n break\r\n ans = []\r\n for i in range(1, n+1):\r\n if len(adj_list[i]) == n-1:\r\n ans.append('b')\r\n elif i in level:\r\n a_val = len(adj_list[i])\r\n a_dict[i] = True\r\n ans.append('a')\r\n else:\r\n c_val = len(adj_list[i])\r\n c_dict[i] = True\r\n ans.append('c')\r\n if a_val == len(b_dict) + len(a_dict) - 1 and c_val == len(b_dict) + len(c_dict) - 1:\r\n print('Yes')\r\n print(''.join(ans))\r\n else:\r\n print('No')\r\n\r\n else:\r\n level = BFS(1, adj_list)\r\n a_val = c_val = -1\r\n a_dict = {}\r\n c_dict = {}\r\n ans = []\r\n for i in range(1, n+1):\r\n if i in level:\r\n a_val = len(adj_list[i])\r\n a_dict[i] = True\r\n ans.append('a')\r\n else:\r\n c_dict[i] = True\r\n c_val = len(adj_list[i])\r\n ans.append('c')\r\n if a_val == len(a_dict) - 1 and c_val == len(c_dict) - 1:\r\n print('Yes')\r\n print(''.join(ans))\r\n else:\r\n print('No')\r\nelse:\r\n a_dict = {}\r\n c_dict = {}\r\n a_val = -1\r\n c_val = -1\r\n for i in range(1, n+1):\r\n if len(adj_list[i]) != n-1:\r\n if a_val == -1:\r\n a_val = len(adj_list[i])\r\n a_dict[i] = True\r\n elif len(adj_list[i]) == a_val:\r\n a_dict[i] = True\r\n elif c_val == -1:\r\n c_val = len(adj_list[i])\r\n c_dict[i] = True\r\n else:\r\n c_dict[i] = True\r\n if a_val == len(b_dict) + len(a_dict) - 1 and c_val == len(b_dict) + len(c_dict) - 1:\r\n ans = []\r\n for i in range(1, n+1):\r\n if i in a_dict:\r\n ans.append('a')\r\n elif i in b_dict:\r\n ans.append('b')\r\n else:\r\n ans.append('c')\r\n print('Yes')\r\n print(''.join(ans))\r\n else:\r\n print('No')", "def bfs(k):\n fila=[k]\n flag=[0]*(n+1)\n flag[k]=1\n while len(fila) != 0:\n v=fila[0]\n mark[v]=mark[k]\n fila.pop(0)\n for i in g[v]:\n if flag[i]==0 and mark[i]!='b':\n fila.append(i)\n flag[i]=1\nn,m=[int(x) for x in input().split()]\ng=[[] for i in range(n+1)]\nres=1\nfor i in range(m):\n u,v=[int(x) for x in input().split()]\n g[u].append(v)\n g[v].append(u)\ndeg=[0]*(n+1)\nmark=[0]*(n+1)\ncontb=0\nfor i in range(n+1):\n deg[i]=len(g[i])\n if deg[i]==(n-1):\n mark[i]='b'\n contb+=1\nfor i in range(1,n+1):\n if mark[i]==0:\n mark[i]='a'\n bfs(i)\n break\nfor i in range(1,n+1):\n if mark[i]==0:\n mark[i]='c'\n bfs(i)\n break\nconta=0\ncontc=0\nfor i in mark:\n if i=='a':\n conta+=1\nfor i in mark:\n if i=='c':\n contc+=1\nfor i in range(1,n+1):\n if mark[i]=='a' and deg[i]!=(conta-1+contb):\n res=0\n if mark[i]=='c' and deg[i]!=(contc-1+contb):\n res=0\n if mark[i]==0:\n res=0\nif res==0:\n print(\"No\")\nelse:\n mark.pop(0)\n r=''.join(mark)\n print(\"Yes\")\n print(r)\n \t\t \t\t\t \t \t\t\t\t\t \t\t\t\t\t", "edge=[[0 for _ in range(510)] for _ in range(510)]\r\ncnt = [0]*510\r\ns=[0]*510\r\nn,m = map(int,input().split())\r\nfor _ in range(m):\r\n\tu,v = map(int,input().split())\r\n\tu-=1\r\n\tv-=1\r\n\tedge[u][v]=1\r\n\tedge[v][u]=1\r\n\tcnt[u]+=1\r\n\tcnt[v]+=1\r\nfor i in range(n):\r\n\tif(cnt[i]==n-1):s[i]='b'\r\nfor i in range(n):\r\n\tif s[i]==0:\r\n\t\ts[i]='a'\r\n\t\t#print(i)\r\n\t\tfor j in range(n):\r\n\t\t\tif s[j]==0:\r\n\t\t\t\t#print(j)\r\n\t\t\t\t#print(edge[i][j])\r\n\t\t\t\tif edge[i][j]!=0:s[j]='a'\r\n\t\t\t\telse:s[j]='c'\r\n\t\t\t\t#print(s[j])\r\n\t\t\t\t\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i == j : continue\r\n\t\tif (abs(ord(s[i])-ord(s[j])==2 and edge[i][j]==1))or(abs(ord(s[i])-ord(s[j]))<2 and edge[i][j]==0):print('No');exit()\r\nprint('Yes')\r\nno = ''\r\nfor i in s:\r\n\tif i == 0:break\r\n\tno+=str(i)\r\nprint(no)\t\r\n\r\n\t \r\n\t\r\n\t", "n, m = map(int, input().split())\r\ns = [[0] * n for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n s[a - 1][b - 1] = 1\r\n s[b - 1][a - 1] = 1\r\nfor i in range(n):\r\n s[i][i] = 1\r\nanswer = [0] * n\r\nfor i in range(n):\r\n flag = True \r\n for j in range(n):\r\n if s[i][j] == 0:\r\n flag = False\r\n if flag:\r\n answer[i] = 'b'\r\nfor i in range(n):\r\n if answer[i] == 0:\r\n answer[i] = 'a'\r\n for j in range(n):\r\n if s[i][j] == 0:\r\n answer[j] = 'c'\r\n if s[i][j] == 1 and answer[j] != 'b':\r\n answer[j] = 'a'\r\n break\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j] == 1:\r\n if (answer[i] == 'a' and answer[j] == 'c') or (answer[i] == 'c' and answer[j] == 'a'):\r\n flag = False\r\n if s[i][j] == 0:\r\n if abs(ord(answer[i]) - ord(answer[j])) < 2:\r\n flag = False\r\nif flag:\r\n print('Yes')\r\n answer = ''.join(answer)\r\n print(answer)\r\nelse:\r\n print(\"No\")\r\n", "def build(n, m):\r\n\tg = [ [0 for i in range(n)] for i in range(n) ]\r\n\tfor i in range(m):\r\n\t\tu, v = map(int, input().split(' '))\r\n\t\tg[v - 1][u - 1] = 1\r\n\t\tg[u - 1][v - 1] = 1\r\n\treturn g\r\n\r\ndef dfs(v, c):\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\tif v != i and g[v][i] == 0:\r\n\t\t\tcnt += 1\r\n\tif cnt != 0:\r\n\t\tused[v] = 1\r\n\t\tans[v] = c\r\n\t\tfor i in range(n):\r\n\t\t\tif not used[i] and g[v][i] == 0:\r\n\t\t\t\tcTo = 'a'\r\n\t\t\t\tif c == 'a':\r\n\t\t\t\t\tcTo = 'c'\r\n\t\t\t\tdfs(i, cTo)\r\n\r\ndef check():\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif i == j:\r\n\t\t\t\tcontinue\r\n\t\t\tif g[i][j] == 1:\r\n\t\t\t\tif ans[i] == 'a' and ans[j] == 'c':\r\n\t\t\t\t\treturn False\r\n\t\t\t\tif ans[i] == 'c' and ans[j] == 'a':\r\n\t\t\t\t\treturn False\r\n\t\t\telse:\r\n\t\t\t\tif ans[i] == ans[j]:\r\n\t\t\t\t\treturn False\r\n\t\t\t\tif ans[i] == 'a' and ans[j] == 'b':\r\n\t\t\t\t\treturn False\r\n\t\t\t\tif ans[i] == 'b' and ans[j] == 'a':\r\n\t\t\t\t\treturn False\r\n\t\t\t\tif ans[i] == 'b' and ans[j] == 'c':\r\n\t\t\t\t\treturn False\r\n\t\t\t\tif ans[i] == 'c' and ans[j] == 'b':\r\n\t\t\t\t\treturn False\t\r\n\treturn True\r\n\r\n\r\nn, m = map(int, input().split())\r\nused = [ 0 for i in range(n) ]\r\nans = [ 'b' for i in range(n) ]\r\n\r\ng = build(n, m)\r\nfor i in range(n):\r\n\tif not used[i]:\r\n\t\tdfs(i, 'a')\r\n\r\nif check() == True:\r\n\tprint(\"Yes\")\r\n\tfor i in range(n):\r\n\t\tprint(ans[i], end='')\r\nelse:\r\n\tprint(\"No\")\r\n\r\n", "n, m = [int(i) for i in input().split(' ')]\nadj = [[1] * n for _ in range(n)]\nfor i in range(n):\n adj[i][i] = 0\nfor _ in range(m):\n u, v = [int(i) - 1 for i in input().split(' ')]\n adj[u][v], adj[v][u] = 0, 0\nb = set([i for i in range(n) if not any(adj[i])])\na = None\nfor i in range(n):\n if i in b:\n continue\n r = adj[i]\n if a is None:\n a = r\n continue\n for j in range(n):\n if (adj[i][j] and a[j] == a[i]) or (not adj[i][j] and j not in b and a[i] != a[j]):\n print('No')\n exit()\ns = ''\nfor i in range(n):\n if i in b:\n s += 'b'\n elif a[i]:\n s += 'c'\n else:\n s += 'a'\nprint('Yes')\nprint(s)\n\n\t \t \t \t\t\t\t \t \t \t \t\t\t\t\t \t", "def dfs(v):\r\n visit[v] = cnt\r\n for u in vertex[v]:\r\n if not visit[u] and u in challengers:\r\n dfs(u)\r\n \r\nn, m = map(int, input().split())\r\nvertex = [[] for i in range(n + 1)]\r\nchallengers = set()\r\nans = [''] * (n + 1)\r\nmiddle = set()\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n vertex[a].append(b)\r\n vertex[b].append(a)\r\n\r\nfor i in range(1, n + 1):\r\n s = set(j for j in range(1, n + 1))\r\n s.discard(i)\r\n if s == set(vertex[i]):\r\n ans[i] = 'b'\r\n middle.add(i)\r\n else:\r\n challengers.add(i)\r\n \r\nvisit = [0] * (n + 1)\r\ncnt = 0\r\nfor c in challengers:\r\n if not visit[c]:\r\n cnt += 1\r\n dfs(c)\r\n\r\nif cnt > 2 or cnt == 1:\r\n print('No')\r\nelif cnt == 2:\r\n first = set()\r\n second = set()\r\n for i in range(1, n + 1):\r\n if visit[i] == 1:\r\n first.add(i)\r\n elif visit[i] == 2:\r\n second.add(i)\r\n for c in first:\r\n s = first\r\n s.discard(c)\r\n if set(vertex[c]) - middle != s:\r\n print('No')\r\n break\r\n s.add(c)\r\n else:\r\n for c in first:\r\n ans[c] = 'a'\r\n for c in second:\r\n s = second\r\n s.discard(c)\r\n if set(vertex[c]) - middle != s:\r\n print('No')\r\n break\r\n s.add(c)\r\n else:\r\n for c in second:\r\n ans[c] = 'c'\r\n\r\nif not ans[1:].count(''):\r\n print('Yes', ''.join(ans[1:]), sep = '\\n')" ]

[ "n1,n2,k1,k2=map(int,input().split())\r\nif n1>n2:\r\n\tprint(\"First\")\r\nelif n1<n2:\r\n\tprint(\"Second\")\r\nelif n1==n2:\r\n\tprint(\"Second\")", "n1, n2, k1, k2=map(int, input().split())\nif(n1>n2):\n print(\"First\")\nif(n1<=n2):\n print(\"Second\")\n", "n1, n2, a, b = [int(i) for i in input().split()]\r\nif n1 > n2: print(\"First\")\r\nelse: print(\"Second\")", "# LUOGU_RID: 101572685\nn1, n2, k1, k2 = map(int, input().split())\r\nprint(n1 > n2 and 'First' or 'Second')", "n1,n2,k1,k2 = map(int,input().split())\nif n1<=n2:\n print(\"Second\")\nelse:\n print(\"First\")\n\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-06 14:54:29\nLastEditTime: 2021-11-06 14:58:43\nDescription: Game\nFilePath: CF513A.py\n'''\n\n\ndef func():\n n1, n2, k1, k2 = map(int, input().strip().split())\n print(\"First\" if n1 > n2 else \"Second\")\n\n\nif __name__ == '__main__':\n func()\n", "string = input()\r\nnumbers = string.split(\" \")\r\nif int(numbers[0]) > int(numbers[1]):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Feb 18 19:24:54 2020\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\n\r\n#https://codeforces.com/problemset/problem/513/A\r\n\r\n\r\ndef game():\r\n array = input().split()\r\n \r\n array = [int(i) for i in array]\r\n \r\n while array[0] > 0 and array[1] > 0:\r\n array[0] -= 1\r\n if array[0] == 0:\r\n print(\"Second\")\r\n return\r\n array[1] -= 1\r\n if array[1] == 0:\r\n print(\"First\")\r\n return\r\n \r\n \r\ngame()\r\n ", "i=input().split();\r\nprint('First' if int(i[0])>int(i[1]) else 'Second')", "A=[int(i) for i in input().split()]\r\nif A[0]<=A[1]:\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "n1, n2, k1, k2 = [int(i) for i in input().split()]\r\nprint('Second' if n1 <= n2 else 'First')", "n1, n2,k1,k2=list(map(int,str.split(input())))\r\nif n1>n2:\r\n print('First')\r\nelse:\r\n print('Second') ", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n1, n2):\r\n return n1 > n2\r\n\r\ndef main():\r\n n1, n2, k1, k2 = map(int, input().split())\r\n if solve(n1, n2):\r\n print('First')\r\n else:\r\n print('Second')\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "l = list(map(int, input().split()))\r\nprint(\"First\") if(l[0]>l[1]) else print(\"Second\")", "x = input().split(\" \")\n\nn1 = int(x[0])\nn2 = int(x[1])\nk1 = int(x[2])\nk2 = int(x[3])\n\nif n1 <= n2:\n\tprint(\"Second\")\nelse:\n\tprint(\"First\")\n\t\n\t \t \t \t \t \t \t\t\t \t \t \t", "a,b,c,d=map(int,input().split())\r\nprint([\"Second\",\"First\"][a>b])", "l=input().split()\nif int(l[0])<=int(l[1]):\n print(\"Second\")\nelse:\n print(\"First\")", "n1,n2,k1,k2=map(int,input().split())\r\ns=[\"Second\",\"First\"]\r\nprint(s[n1>n2])", "n,m,k,l=map(int,input().split())\r\nt=max(n,m)\r\nfor i in range(3*t):\r\n\tif i%2==0:\r\n\t\tn-=1\r\n\telse:\r\n\t\tm-=1\r\n\tif m<0:\r\n\t\tprint(\"First\")\r\n\t\tbreak\r\n\telif n<0:\r\n\t\tprint(\"Second\")\r\n\t\tbreak", "n1, n2, k1, k2 = map(int, input().split())\r\nif n1>n2: print(\"First\")\r\nelse: print(\"Second\")\r\n", "__author__ = 'yushchenko'\r\n\r\nn1,n2,k1,k2 = map(int, input().split())\r\n\r\n\r\nif (n1 > n2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "x ,y ,z,n= map(int, input().split(\" \"))\r\nif x >y :\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "f,s,_,_ = list(map(int, input().split()))\r\nprint(\"SFeicrosntd\"[f>s::2])", "import sys\r\n\r\ndef main():\r\n \r\n n1,n2,k1,k2 = map(int, sys.stdin.readline().split())\r\n\r\n while True:\r\n n1-=1\r\n if n1 == 0:\r\n sys.stdout.write('Second')\r\n break\r\n n2-=1\r\n if n2 == 0:\r\n sys.stdout.write('First')\r\n break\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input().split(' ')\r\nprint(\"Second\" if int(s[0]) <= int(s[1]) else \"First\")", "a,b,*_=map(int,input().split())\r\nprint(['Second','First'][b<a])", "''' Idea is quite simple. One having more number of stone will remove only one stone from his pile during his turn so that other person's stones gets exhausted before him( since he has to remove atleast one stone during his turn and he has less number of stones with him)'''\r\n\r\nn1,n2,k1,k2=map(int,input().split())\r\ns=[\"Second\",\"First\"]\r\nprint(s[n1>n2])", "n1,n2,k1,k2=map(int,input().split())\r\nprint('First' if n1>n2 else 'Second')", "n = input()\r\nn1 , n2 , k1 , k2 = n.split()\r\n\r\nif int(n1) == int(n2) :\r\n print (\"Second\")\r\nelif int(n1) < int(n2) :\r\n print (\"Second\")\r\nelse:\r\n print (\"First\")\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "s = input().split(' ')\r\nif int(s[0]) > int(s[1]):\r\n print('First')\r\nelse:\r\n print('Second')", "n1,n2,k1,k2=map(int,input().split())\r\nif (n1-k1)==0:\r\n\tprint(\"Second\")\r\nelif n2<n1:\r\n\tprint(\"First\")\t\r\nelse:\r\n\tprint(\"Second\")\t\t\r\n", "n1,n2,k1,k2 = input().split()\nn1,n2,k1,k2 = int(n1),int(n2),int(k1),int(k2)\nif n1>n2:\n print('First')\nelse:\n print('Second')", "a,b,c,d=map(int,input().split())\r\nprint('SFeicrosntd'[a>b::2])", "a,b,c,d=input().split()\r\nif int(a)>int(b):\r\n print('First')\r\nelse:\r\n print('Second')", "def solve() -> str:\r\n n1,n2,k1,k2 = map(int, input().split())\r\n\r\n while True:\r\n\r\n if n1 - 1 < 0:\r\n return \"Second\"\r\n else:\r\n n1 -=1\r\n\r\n if n2 - 1 < 0:\r\n return \"First\"\r\n else:\r\n n2 -=1\r\n\r\nprint(solve())", "x = input\r\n\r\na,b,c,d=map(int,input().split())\r\n\r\nif a==b:\r\n print('Second')\r\nif a>b:\r\n \r\n print('First')\r\nif b>a:\r\n print('Second')\r\n\r\n", "n1, n2, _, _ = [int(x) for x in input().split()]\r\nprint(\"Second\") if n1 <= n2 else print(\"First\")", "if __name__ == \"__main__\":\n array = [int(i) for i in input().split()]\n if array[0] > array[1]:\n print(\"First\")\n else:\n print(\"Second\")\n \t\t\t \t \t \t\t\t \t\t \t \t\t \t \t", "a,b=map(int,input().split()[:2]);print(\"First\" if a>b else \"Second\")", "s=[int(a) for a in input().split()]\r\nn1=s[0]\r\nn2=s[1]\r\nk1=s[2]\r\nk2=s[3]\r\nwhile True:\r\n if n1<1:\r\n print('Second')\r\n break\r\n else:\r\n n1=n1-1\r\n if n2<1:\r\n print('First')\r\n break\r\n else:\r\n n2=n2-1\r\n\r\n", "import sys\n\ndef Main():\n n1, n2, k1, k2 = [int(x) for x in input().split()]\n\n if n1 > n2:\n print(\"First\")\n else:\n print(\"Second\")\n\n \nif __name__ == '__main__':\n\tMain()\n\n \t \t\t\t\t\t\t \t \t\t \t \t", "n_1, n_2, k_1, k_2 = list(map(int, input().split()))\r\nprint('First' if n_1 > n_2 else 'Second')", "line = input()\r\nn = []\r\nn = line.split()\r\nfor i in range(4):\r\n n[i] = int(n[i])\r\nn1 = n[0]\r\nn2 = n[1]\r\n\r\nwhile True:\r\n n1 -= 1\r\n if n1 != 0:\r\n n2 -= 1\r\n if n1 == 0 or n2 == 0:\r\n break\r\n\r\nif n1 != 0:\r\n print(\"First\")\r\nelif n2 != 0:\r\n print(\"Second\")\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output4.out\",'w')\r\nn1,n2,k1,k2=map(int,input().split())\r\nprint(\"First\" if n1>n2 else \"Second\")", "n = list(map(int, input().split()))\n\nif n [0] > n[1] :\n print('First')\nelse:\n print('Second')", "n = [int(i) for i in input().split(\" \")]\r\nprint('First') if n[0] > n[1] else print('Second')", "a, b, c, d = [int(i) for i in input().split()]\r\nif a > b:\r\n\tprint('First')\r\nelse:\r\n\tprint('Second')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 13 20:15:41 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn1,n2,k1,k2 = map(int, input().split())\r\n\r\nif n1 > n2 :\r\n print('First')\r\nelse:\r\n print('Second')", "n1, n2, k1, k2 = map(int, input().split())\r\nwith open('test.txt', 'w') as f:\r\n f.write('hello')\r\nif n1 > n2:\r\n print(\"First\")\r\nelse:\r\n print('Second')\r\n", "l=input().split()\nq=0\nif int(l[0])<=int(l[1]):\n print(\"Second\")\nelse:\n print(\"First\")", "s = input()\ns = s.split(\" \")\n\nn1 = int(s[0])\nn2 = int(s[1])\nk1 = int(s[2])\nk2 = int(s[3])\n\nn = max(n1, n2)\n\nfim = False\n\nwin = \"\"\nwhile not fim:\n if (n1 == 0):\n fim = True\n win = \"Second\"\n else:\n n1 -= 1\n if (n2 == 0):\n fim = True\n win = \"First\"\n else:\n n2 -= 1\n\nprint(win)\n", "a,b,c,d = map(int,input().split())\r\nprint(\"First\") if a>b else print(\"Second\")", "n, n_aux, k1, k2 = input().split(\" \")\nn1 = int(n)\nn2 = int(n_aux)\nif(n1 <= n2):\n print(\"Second\")\nelse:\n print(\"First\")\n", "n,k,l,r= map(int, input().split())\r\nif (k>=n):\r\n print ('Second')\r\nelse :\r\n print('First')", "import sys\r\n\r\ndef main():\r\n n, m, *_ = map(int, sys.stdin.read().strip().split())\r\n return n > m and 'First' or 'Second'\r\n \r\nprint(main())", "n,k,i,v = map(int,input().split())\r\nif(n>k):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a, b, c, d = [int(x) for x in input().split()]\nprint(\"First\" if a > b else \"Second\")", "b1,b2,k1,k2=map(int,input().split())\r\nprint(\"First\" if max(b1,b2)==b1 and b1!=b2 else \"Second\")", "p1_balls, p2_balls, k1, k2 = [int(a) for a in input().strip().split()]\r\n\r\nif p1_balls == p2_balls:\r\n print(\"Second\")\r\nelif p1_balls > p2_balls:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "[n1,n2,k1,k2] = [int(i) for i in input().split()]\r\n\r\nprint(\"First\") if n1 > n2 else print(\"Second\")", "n1,n2,k1,k2=map(int,input().split())\r\nwhile(1>0):\r\n n1-=1\r\n if(n1<0):\r\n print('Second')\r\n break\r\n n2-=1\r\n if n2<0:\r\n print('First')\r\n break\r\n", "a = list(map(int, input().split()))\r\nwin,turn = 0,0\r\nwhile a[0] > 0 and a[1] > 0:\r\n if turn == 0:\r\n a[0] -= 1\r\n else:\r\n a[1] -= 1\r\n turn = (turn + 1) % 2\r\nif a[0] == 0:\r\n win = \"Second\"\r\nelse:\r\n win = \"First\"\r\nprint (win)\r\n", "line=input()\r\nl=line.split()\r\nif int(l[0])<=int(l[1]):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "s = input()\r\na = s.split()\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\r\nwhile a[0] > 0 and a[1] > 0:\r\n\ta[0] -= 1\r\n\ta[1] -= 1\r\n\r\nif a[0] <= 0:\r\n\tprint('Second')\r\nelse:\r\n\tprint('First')", "a, b = map(int, input().split()[:2])\r\nprint('First' if a > b else 'Second')", "n1, n2, k1, k2 = map(int, input().split())\r\n\r\nfor i in range(200):\r\n if i % 2 == 0:\r\n n1 -= 1\r\n if n1 < 0:\r\n print(\"Second\")\r\n break\r\n elif i % 2 == 1:\r\n n2 -= 1\r\n if n2 < 0:\r\n print(\"First\")\r\n break", "a, b, c, d = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n if a == 0:\r\n print(\"Second\")\r\n break\r\n if b == 0:\r\n print(\"First\")\r\n break\r\n if i % 2 == 0:\r\n a -= 1\r\n else:\r\n b -= 1\r\n i += 1\r\n", "n,b,k,l = map(int,input().split())\r\nif (n>b):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n,n2,k,k2=map(int,input().split())\r\nif n<=n2:\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "a,b,c,e=input().split()\na=int(a)\nb=int(b)\nc=int(c)\ne=int(e)\nif a<=b:\n print(\"Second\")\nelse:\n print(\"First\")\n\n \t \t \t \t\t \t \t\t\t\t \t \t\t\t\t", "n,m,a,b=map(int,input().split())\r\nif(n==m):\r\n print(\"Second\")\r\nelif(n>m):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "numbers = [int(x) for x in input().split()]\r\nn1=numbers[0]\r\nn2=numbers[1]\r\nk1=numbers[2]\r\nk2=numbers[3]\r\nwhile True :\r\n if n1 !=0 :\r\n n1 -=1\r\n else :\r\n print(\"Second\")\r\n break\r\n \r\n if n2 !=0 :\r\n n2 -=1\r\n else :\r\n print (\"First\")\r\n break\r\n", "temp = [int(x) for x in input().split()]\r\nn1 = temp[0]\r\nn2 = temp[1]\r\nk1 = temp[2]\r\nk2 = temp[3]\r\nif n1>n2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "\r\n__author__ = 'Hierony'\r\n\r\ndef solve():\r\n\r\n\tn1,n2,k1,k2 = input().split()\r\n\tn1 = int(n1)\r\n\tn2 = int(n2)\r\n\tk1 = int(k1)\r\n\tk2 = int(k2)\r\n\t\t\r\n\r\n\tif n1 <= n2: print (\"Second\")\r\n\telse: print (\"First\")\r\n\r\nsolve()\r\n", "a,b,*_=map(int,input().split())\r\nprint(\"SFeicrosntd\"[a>b::2])", "l=list()\r\ns=str(input()).split()\r\nfor k in s:\r\n l.append(int(k))\r\nn1=l[0]\r\nn2=l[1]\r\nk1=l[2]\r\nk2=l[3]\r\nif n1==n2:\r\n print(\"Second\")\r\nelse:\r\n if n1>n2:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")", "n1, n2, k1, k2 = input().split()\nn1, n2, k1, k2 = int(n1), int(n2), int(k1), int(k2)\n\nif n1 > n2:\n\tprint('First')\nelse:\n\tprint('Second')", "n,m,k,l=map(int,input().split())\nif n==m:\n print(\"Second\")\nelif n>m:\n print(\"First\")\nelse:\n print(\"Second\")", "a = list(map(int,input().split()))\r\n\r\nprint('First' if a[0]>a[1] else 'Second')\r\n", "n,m,a,b=map(int,input().split(\" \"))\nif n>m:\n\tprint(\"First\")\nelif m>n:\n\tprint(\"Second\")\nelif m==n:\n\tprint(\"Second\")", "w = list(input().split())\nw2 = list(map(int,w))\n\nwhile True:\n if w2[0] == 0 and w2[1] >= 0:\n print ('Second')\n break\n if w2[0] >= 0 and w2[1] == 0:\n print ('First')\n break\n w2[0] += -1\n w2[1] -= 1\n\t\t \t\t\t \t\t\t\t\t \t\t \t\t\t \t\t\t\t", "S = [int(i) for i in input().split()]\r\nif S[0] == S[1]:\r\n print(\"Second\")\r\nelif S[0] > S[1]:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "a,b,c,d = map(int , input().split())\r\nif(a<=b):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "n1, n2, k1, k2 = (int(i) for i in input().split())\nres = \"Second\" if n2 >= n1 else \"First\"\nprint(res)\n", "def game(ls):\r\n i = 0\r\n while(ls[0] != 0 and ls[1] != 0):\r\n ls[i] = ls[i] - 1\r\n i = i + 1\r\n if(i > 1):\r\n i = 0\r\n if(ls[0] == 0):\r\n return \"Second\"\r\n else:\r\n return \"First\"\r\n\r\nls = [int(i) for i in input().split()]\r\nprint(game(ls))", "line = input().split()\n\nn1 = int(line[0])\nn2 = int(line[1])\nk1 = int(line[2])\nk2 = int(line[3])\n\nif n1 > n2:\n print(\"First\")\nelse:\n print(\"Second\")\n\t\t \t\t\t \t \t \t\t \t \t \t\t\t", "a=list(map(int, input().split()))\r\ni=1\r\nwhile a[0]>0 and a[1]>0:\r\n if int(i%2)!=0:\r\n a[0]-=1\r\n if a[0]==0:\r\n s=\"Second\"\r\n break;\r\n else:\r\n a[1]-=1\r\n if a[1]==0:\r\n s=\"First\"\r\n break;\r\n i+=1\r\nprint(s)", "#!/usr/bin/env python3\n\nn1, n2, k1, k2 = map(int, input().split())\n\nprint(\"First\" if n1 > n2 else \"Second\")\n", "a, b, *c = map(int, input().split())\r\nprint('SFeicrosntd'[a > b::2])", "balls_p1, balls_p2, max_takes_p1, max_takes_p2 = map(int, input().split())\nprint('First' if balls_p1 > balls_p2 else 'Second')\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn1,n2,k1,k2=(int(i) for i in input().split())\r\nif(n1>n2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "#!/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 n1,n2,k1,k2 = map(int, wtf[0].split())\r\n print('First' if n1 > n2 else 'Second')\r\n", "(a,b,c,d)=input().split(maxsplit=3)\r\n(a,b)=(int(a),int(b))\r\nif a>b:\r\n print('First')\r\nelse:\r\n print('Second')", "n1,n2,k1,k2=map(int,input().split())\r\nwhile True:\r\n n1-=1\r\n n2-=1\r\n if n1==0:\r\n print('Second')\r\n break\r\n elif n2==0:\r\n print('First')\r\n break\r\n", "''' Hey stalker :) '''\nINF = 10 ** 10\nMAX = 10**4 + 32\nfactors = [[1] for _ in range(MAX)]\nfor i in range(2, MAX):\n for j in range(i, MAX, i): factors[j].append(i)\ndef main():\n print = out.append\n ''' Cook your dish here! '''\n n1, n2 , k1, k2 = get_list()\n if n1>n2:\n print(\"First\")\n else: print(\"Second\")\n\nclass SegTreeSum:\n def __init__(self, size):\n self.n = 1 << size.bit_length()\n self.li = [0]*(self.n<<1)\n\n def modify(self, index, ele):\n index += self.n\n self.li[index] = ele\n while index>1:\n self.li[index>>1] = self.li[index] + self.li[index^1]\n index >>= 1\n\n def get(self, index):\n return self.li[self.n + index]\n\n def query(self, l, r):\n #[print(i, self.li[i]) for i in range(len(self.li))]\n res = 0\n l, r = l+self.n, r+self.n\n while l<=r:\n #print(l, r)\n if l&1==1: res += self.li[l]\n if r&1!=1: res += self.li[r]\n l = (l+1)>>1\n r = (r-1)>>1\n return res\n''' Pythonista fLite 1.1 '''\nimport sys\nfrom collections import defaultdict, Counter, deque\n# from bisect import bisect_left, bisect_right\n# from functools import reduce\n# import math\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\nout = []\nget_int = lambda: int(input())\nget_list = lambda: list(map(int, input().split()))\nmain()\n#[main() for _ in range(int(input()))]\nprint(*out, sep='\\n')\n", "x1, x2, y1, y2 = map(int, input().split())\r\n\r\nif x1+y2 > x2+y2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n1,n2,k1,k2=map(int,input().split())\r\nif n1>n2 and k1>k2:\r\n\tprint('First')\r\nelif n1>n2 and k1==k2:\r\n\tprint('First')\r\nelif n1>n2 and k1<k2:\r\n\tprint('First')\r\nelse:\r\n\tprint('Second')", "def main():\r\n s = input().split()\r\n n1 = int(s[0])\r\n n2 = int(s[1])\r\n k1 = int(s[2])\r\n k2 = int(s[3])\r\n turn = 0\r\n while n1 >= 0 and n2 >= 0:\r\n if turn % 2 == 0:\r\n n1 -= 1\r\n elif turn % 2 == 1:\r\n n2 -= 1\r\n turn += 1\r\n if n1 > -1:\r\n print('First')\r\n elif n2 > -1:\r\n print('Second')\r\nmain() \r\n", "n1, n2, k1, k2 = map(int, input().split())\r\nif n1 > n2: print(\"First\")\r\nelse: print(\"Second\")", "import sys\r\ninput = sys.stdin.readline\r\nins = lambda: input().rstrip()\r\nini = lambda: int(input().rstrip())\r\ninm = lambda: map(int, input().rstrip().split())\r\ninl = lambda: list(map(int, input().split()))\r\nout = lambda x, s='\\n': print(s.join(map(str, x)))\r\n\r\nn1, n2, k1, k2 = inm()\r\nprint(\"First\" if n1 > n2 else \"Second\")\r\n", "n1, n2, k1, k2 = map(int, input().split())\r\nn1, n2 = n1 - min(n1, n2), n2 - min(n1, n2)\r\nif n1 == 0:\r\n print('Second')\r\nelse:\r\n print('First')", "ls = [int(i) for i in input().split()]\n\nif ls[0]==ls[1] or ls[0]<ls[1]:\n print(\"Second\")\nelse:\n print(\"First\")", "x,y,a,b=map(int,input().split())\r\nif(x<=y):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "a, b, *c = map(int, input().split())\r\nprint('SFeicrosntd'[b < a :: 2])", "a,b,c,d=map(int,input().split())\r\nwhile a>0 and b>0:\r\n a-=1\r\n b-=1\r\nif a>b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a ,b ,c ,d = map(int ,input() .split())\r\nif a > b and a >= c:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "n1,n2,k1,k2 = [int(x) for x in input().split()]\r\nprint(['Second', 'First'][n1>n2])", "x,y,m,n = [int(x) for x in input().split(' ')]\nif x != y:\n if x == max(x,y):\n print('First')\n else:\n print('Second')\nelse:\n print('Second')\n", "a = list(map(int, input().split()))[:2]\nprint('Second' if max(a) == a[1] else 'First')", "lst= list(input().split(\" \"))\r\nn_1=int(lst[0])\r\nn_2=int(lst[1])\r\nk_1=int(lst[2])\r\nk_2=int(lst[3])\r\nc=0\r\n\r\nwhile(c==0):\r\n n_1-=1\r\n n_2-=1\r\n if(n_1==0):\r\n c=2\r\n elif(n_2==0):\r\n c=1\r\nif(c==1):\r\n print(\"First\")\r\nelif(c==2):\r\n print(\"Second\")", "import math\nn1,n2,k1,k2 = [int(x) for x in input().split()]\n\njogadorUm = math.ceil(n1/k1)\njogadorDOis = math.ceil(n2/k2)\n\nif n1 > n2 :\n print(\"First\")\nelse:\n print(\"Second\")\n\n \t\t \t \t\t \t \t \t\t \t \t\t\t\t \t\t", "def main():\r\n [n1, n2, k1, k2] = [int(_) for _ in input().split()]\r\n print('First' if n1 > n2 else 'Second')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n1, n2, k1, k2 = input().split()\r\nn1, n2, k1, k2 = int(n1), int(n2), int(k1), int(k2)\r\nprint('First' if n1 > n2 else 'Second')", "from sys import stdin\r\nn1,n2,k1,k2 = map(int,stdin.readline().rstrip().split())\r\nprint (('First','Second')[n1<=n2])", "def answer():\r\n a = [int(x) for x in input().split()]\r\n n1=a[0]\r\n n2=a[1]\r\n if n1>n2: return \"First\"\r\n else: return \"Second\"\r\nprint(answer())", "n1,n2,k1,k2=map(int, input().split())\nfir=2*n1-1\nsec=2*n2\nif fir>sec: print(\"First\")\nelse: print(\"Second\")\n \t \t\t \t\t\t \t \t \t \t\t\t", "# The stupid horrible game version 2\n[n1,n2,k1,k2] = map(int,input().split())\nif n1>n2:\n print(\"First\")\nelse:\n print(\"Second\")\n", "n1,n2,k1,k2=map(int,input().split())\r\nif n1>n2: print(\"First\")\r\nelse:print(\"Second\")", "t = list(map(int,input().split()))\r\nn1 = t[0]\r\nn2 = t[1]\r\nk1 = t[2]\r\nk2 = t[3]\r\nif n1 > n2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a, b, c, d = map(int, input().split())\r\nprint(\"First\") if a > b else print(\"Second\")", "a,b,c,d=map(int,input().strip().split())\r\nif a>b:\r\n print(\"First\")\r\nelif a<b:\r\n print(\"Second\")\r\nelif a==b:\r\n print(\"Second\") ", "n1,n2,k1,k2=map(int,input().split(\" \"))\r\n\r\nwhile(n1>0 and n2>0):\r\n n1=n1-1\r\n #print(n1)\r\n if(n1==0):\r\n print(\"Second\")\r\n break\r\n n2=n2-1\r\n #print(n2)\r\n if(n2==0):\r\n print(\"First\")\r\n break", "def solve():\r\n n1,n2,k1,k2 = list(map(int,input().split()))\r\n if n1 <= n2:\r\n return 'Second'\r\n return 'First'\r\nprint(solve())", "n1,n2,k1,k2 = map(int,input().split())\r\nif n1//1<=n2//1:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"First\")", "str = input().split()\r\nn1, n2 = int(str[0]), int(str[1])\r\n\r\nif n1 > n2:\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Second\")", "nums = list(map(int, input().split()))\nif nums[0] > nums[1]:\n\tprint(\"First\") \nelse:\n\tprint(\"Second\")", "a,b=list(map(int,input().split()))[:2]\r\nprint(['First','Second'][b>=a])", "#codeforces_513A\r\ns = [int(e) for e in input().split()]\r\nprint([\"Second\",\"First\"][(s[0]-1)>=s[1]])", "[n_1, n_2, k_1, k_2] = map(int, input().split())\nif n_1 <= n_2:\n print(\"Second\")\nelse:\n print(\"First\")", "a, b, x, y = map(int, input().split())\r\nprint(['Second', 'First'][a > b])", "n= input().split()\r\n\r\nn1= int(n[0])\r\nn2= int(n[1])\r\nk1= int(n[2])\r\nk2= int(n[3])\r\n\r\n\r\nif n1>n2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n1, n2, k1, k2 = map(int, input().split())\n\nwhile n1 > 0 and n2 > 0:\n n2 -= 1\n n1 -= 1\n\nif n1 > 0:\n print(\"First\")\nelse:\n print(\"Second\")\n \t\t \t \t\t \t \t \t\t\t\t\t \t \t\t", "n1, n2, k1, k2 = [int(s) for s in input().split(\" \")]\r\nif n1 > n2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "def main() -> object:\r\n \"\"\"\r\n\r\n :rtype : string\r\n :return: Who wins.\r\n \"\"\"\r\n n1, n2, k1, k2 = [int(i) for i in input().split()]\r\n if n1 > n2:\r\n return \"First\"\r\n else:\r\n return \"Second\"\r\n\r\nif __name__ == \"__main__\":\r\n print(main())", "def main():\r\n n, m, k, l = map(int, input().split())\r\n if n > m:\r\n print('First')\r\n else:\r\n print('Second')\r\n k = 0\r\n l = 0\r\nmain()", "n1, n2, k1, k2 = map(int, input().split())\nans = ['Second', 'First']\nprint(ans[n1 > n2])", "a=input().split()\r\n\r\nif(int(a[0])<=int(a[1])):\r\n print(\"Second\")\r\nelif(int(a[0])>int(a[1])):\r\n print(\"First\")\r\n", "import sys\r\n\r\ndef main():\r\n \r\n n1,n2,k1,k2 = map(int, sys.stdin.readline().split())\r\n\r\n if n1 <= n2:\r\n sys.stdout.write('Second')\r\n else:\r\n sys.stdout.write('First')\r\n\r\nif __name__ == '__main__':\r\n main()", "a,b,c,d=[int(i) for i in input().split()]\r\nans=0\r\nwhile(a>0 or b>0):\r\n a=a-1\r\n if(a<=0):\r\n ans='Second'\r\n break\r\n b=b-1\r\n if(b<=0):\r\n ans='First'\r\n break\r\n if(a<=0 or b<=0):\r\n break\r\nprint(ans)\r\n", "k = input()\r\ne = ' '\r\nb = ''\r\nl = len(k)\r\narray = [0 for i in range(4)]\r\nc = 0\r\nc1 = 0\r\na = 0\r\n\r\nfor i in range(l):\r\n if(k[i] == e):\r\n c = c + 1\r\nfor i in range(l):\r\n if(k[i] != e):\r\n b = b + k[i]\r\n else:\r\n array[a] = int(b)\r\n b = ''\r\n a = a + 1\r\n c1 = c1 + 1\r\n if(c1 == l):\r\n array[a] = int(b)\r\n \r\nn1 = array[0]\r\nn2 = array[1]\r\nk1 = array[2]\r\nk2 = array[3]\r\n\r\n\r\nsupp_1 = n1\r\nsupp_2 = n2\r\n\r\nif((supp_1) > supp_2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "data = [int(x) for x in input().split()][:2]\r\nprint('First' if data[0] > data[1] else 'Second')", "*n, k1, k2 = map(int, input().split())\r\n\r\ni = 0\r\nwhile True:\r\n if n[1] == 0 :\r\n print('First')\r\n break\r\n if n[0] == 0:\r\n print('Second')\r\n break\r\n\r\n n[i % 2] -= 1\r\n i += 1\r\n", "from sys import stdin, stdout\r\nfrom math import *\r\n\r\ndef solve(test):\r\n n, m, _, _ = list(map(int, test.strip().split()))\r\n return \"First\" if n > m else \"Second\"\r\n\r\nstdout.write(str(solve(stdin.read())))\r\n", "l=list(map(int,(input()).split()))\r\nif l[0]==l[1]:\r\n print('Second')\r\nelif l[0]>l[1]:\r\n print('First')\r\nelse:\r\n print('Second')\r\n\r\n \r\n\r\n", "x = list(map(int,input().split()))\nif x[1]>=x[0]:\n\tprint(\"Second\")\nelse:\n\tprint(\"First\")\n\n", "X = list(map(int , input().split()))\r\nprint(\"Second\" if X[0]<=X[1] else \"First\")", "ф,и,с,в=map(int, input().split());\r\nif(ф>и): print(\"First\");\r\nelse : print(\"Second\");", "n1, n2, k1, k2 = map(int,input().split())\nif n1 > n2:\n\tprint(\"First\")\nelse:\n\tprint(\"Second\")\n", "n1, n2, k1, k2 = map(int, input().split())\r\nres = n1 - n2\r\nif res > 0: print(\"First\")\r\nelse: print(\"Second\")\r\n", "s=input().split()\r\nif int(s[0])<=int(s[1]):\r\n print('Second')\r\nelse:\r\n print('First')", "n1, n2, k1, k2 = [int(i) for i in input().split()]\ns1 = n1 // k1\ns2 = n2 // k2\nif n2 >= n1:\n print('Second')\nelse:\n print('First')", "q,w,e,r=map(int,input().split())\r\nprint(\"First\"if q>w else\"Second\")", "def game(arr):\r\n if arr[0]==arr[1]:\r\n return \"Second\"\r\n if arr[0]<arr[1]:\r\n return \"Second\"\r\n if arr[0]>arr[1]:\r\n return \"First\" \r\narr = list(map(int,input().split()))\r\nprint(game(arr))", "n1,n2,k1,k2=map(int,input().split())\r\nprint(['Second','First'][n1>n2])", "line=input().split()\r\n\r\nm=[]\r\nfor i in line:\r\n m.append(int(i))\r\n\r\nn1=m[0]\r\nn2=m[1]\r\nk1=m[2]\r\nk2=m[3]\r\n\r\nn=0\r\nfor n in range(0,100):\r\n n1=n1-1\r\n if n1 <=0:\r\n print('Second')\r\n break\r\n n2=n2-1\r\n if n2 <=0:\r\n print('First')\r\n break\r\n \r\n", "a=input().split()\nif int(a[0])>int(a[1]):\n\tprint(\"First\")\nelse:\n\tprint(\"Second\")\n", "q, w, e, r = input().split()\nq = int(q)\nw = int(w)\ne = int(e)\nr = int(r)\nif (q > w):\n print(\"First\")\nelse:\n print(\"Second\")\n \t\t \t \t \t \t\t \t\t \t\t\t \t", "n1, n2, k1, k2 = map(int, input().split())\r\nwhile True:\r\n\tif n1 == 0:\r\n\t\tprint (\"Second\")\r\n\t\texit()\r\n\telif n2 == 0:\r\n\t\tprint (\"First\")\r\n\t\texit()\r\n\tn1 -= 1\r\n\tn2 -= 1", "n1, n2, k1, k2 = [int(x) for x in input().split(' ')]\r\nprint('First' if n1 > n2 else 'Second')", "x, y, a, b = [int(i) for i in input().split()]\r\nif y < x:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "line = input()\nn1 = int(line.split(\" \")[0])\nn2 = int(line.split(\" \")[1])\nk1 = int(line.split(\" \")[2])\nk2 = int(line.split(\" \")[3])\n\nif n1==n2:\n print(\"Second\")\nelif n1<n2:\n print(\"Second\")\nelse:\n print(\"First\")", "number_string=input().split()\r\nn1=int(number_string[0])\r\nn2=int(number_string[1])\r\nk1=int(number_string[2])\r\nk2=int(number_string[3])\r\nif n2>=n1:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "n1,n2,k1,k2 = map(int,input().split())\nprint(\"Second\" if n1<=n2 else \"First\") ", "n1,n2,k1,k2=[int(e) for e in input().split()]\r\nprint(\"First\" if n1>n2 else \"Second\")", "c, w, e, r = input().split()\nc = int(c)\nw = int(w)\ne = int(e)\nr = int(r)\nif (c > w):\n print(\"First\")\nelse:\n print(\"Second\")\n \t \t \t \t \t \t\t \t\t \t\t\t\t \t", "a, b, c, d=[int(k) for k in input().split()]\r\nif a>b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "(number_of_balls_of_first_player, number_of_balls_of_second_player, best_throw_of_first_player, best_throw_of_second_player) = map(int, input().split(' '))\n\nwhile True:\n number_of_balls_of_first_player -= 1\n if number_of_balls_of_first_player == 0 and number_of_balls_of_second_player > 0:\n print('Second')\n break\n\n number_of_balls_of_second_player -= 1\n\n if number_of_balls_of_second_player == 0 and number_of_balls_of_first_player > 0:\n print('First')\n break", "n,m,k,l=map(int,input().split())\r\nif n <= m: print(\"Second\")\r\nelse: print(\"First\")", "na,nb,ka,kb = map(int,input().split())\r\nif na<=nb:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "[n_1,n_2,k_1,k_2] = map(int,input().split())\nif n_1 <= n_2:\n print(\"Second\")\nelse:\n print(\"First\")", "from collections import defaultdict as dfd\nimport math\nimport sys\ndef II(): return int(sys.stdin.readline())\ndef MI(): return map(int, sys.stdin.readline().split())\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\n\ndef main():\n n1,n2,k1,k2 = MI()\n x = math.ceil(n1/k1)\n y = math.ceil(n2/k2)\n if(n1>n2):\n print(\"First\")\n else:\n print(\"Second\")\n\n\n\n\n\n\nmain()", "k=input().split(\" \")\r\nn1=int(k[0])\r\nn2=int(k[1])\r\nif n1>n2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "x,w=list(map(int,input().split()))[:2]\r\nprint(['First','Second'][w>=x])", "n1,n2,k1,k2 = list(map(int,input().split()))\r\nprint('First' if n1>n2 else 'Second')\r\n", "a = input()\r\nn1,n2,k1,k2 = map(int,a.split())\r\nprint(\"First\" if n1>n2 else \"Second\")", "def transform(x):\n return int(x)\n\n(n1, n2, k1, k2) = tuple(map(transform,input().split()))\n\nif n2 >= n1: print(\"Second\")\nelse: print(\"First\")\n\n \t \t \t\t \t \t \t\t \t\t \t \t \t", "import sys\r\n\r\n(N1, N2, K1, K2) = map(int, sys.stdin.readline().split())\r\n\r\nif (N1 > N2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,c,d = map(int, input().rstrip().split())\r\nprint(['Second', 'First'][a>b])", "n1,n2,k1,k2 = map(int, input().split())\nwhile (n1 > 0) and (n2> 0):\n n1-=1\n if (n2>0):\n n2-=1\nif (n1>0):\n print('First')\nelse:\n print('Second')\n\n\t\t\t\t \t\t \t \t\t \t \t \t\t \t \t \t \t", "g = input().split()\r\nn1= int(g[0])\r\nn2 = int(g[1])\r\nif n1 <= n2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "n1,n2,k1,k2=input().split()\r\nif int(n1)>int(n2):\r\n print('First')\r\nelse:\r\n print('Second')", "n1,n2,k1,k2=map(int,input().split())\r\nm = max(n1,n2)\r\nf=0\r\nwhile(m>0):\r\n\tn1-=1\r\n\tn2-=1\r\n\tif n1<0:\r\n\t\tf=1\r\n\t\tbreak\r\n\telif n2<0:\r\n\t\tf=0\r\n\t\tbreak\r\nif f==1:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"First\")\r\n", "a=input().split()\r\nb=int(a[0])\r\nc=int(a[1])\r\nif b>c:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "a,b,c,d = [int(i) for i in input().split()]\r\nif a > b :\r\n\tprint('First')\r\nelse:\r\n\tprint('Second')\r\n", "n,m,a,b=map(int,input().split())\r\nprint(['First','Second'][n<=m])", "n1,n2,k1,k2=list(map(int,input().split()))\r\nif(n1>n2):\r\n print('First')\r\nelif(n1<n2):\r\n print('Second')\r\nelif(n1==n2):\r\n print(\"Second\")\r\n", "n1,n2,k1,k2 = map(int,input().split())\r\nif n1>n2: print('First')\r\nelse: print('Second')", "x = list(map(int,input().split()))\nn1,n2,k1,k2=x[0],x[1],x[2],x[3]\nk2 =1\nk1 =1\nwhile(1):\n n1 = n1 -k1\n if n1 <= 0:\n print(\"Second\")\n break\n \n n2 = n2 -k2\n if n2 <= 0:\n print(\"First\")\n break", "m,n,x,y=map(int,input().split())\r\nif m<=n:\r\n print('Second')\r\nelse:\r\n print('First')", "def get_value():\n n1, n2, k1, k2 = [int(val) for val in input().split()]\n\n return 'First' if n1 > n2 else 'Second'\n\nif __name__ == '__main__':\n print(get_value())\n", "li = list(map(int, input().split()))\r\n\r\nif li[0] <= li[1]:\r\n\tprint('Second')\r\nelse:\r\n\tprint('First')\r\n", "a = []\r\n\r\nfor i in input().split():\r\n a.append(int(i))\r\n\r\nif(a[0] <= a[1]):\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"OUTPUX.out\",\"w\")\r\nn1,n2,k1,k2=map(int,input().split())\r\nif n1>n2:print(\"First\")\r\nelse:print(\"Second\")\r\n\r\n", "a, b, _, _ = map(int, input().split())\r\nprint(\"First\" if a > b else \"Second\")", "n1,n2,k1,k2 = map(int,input().split())\r\n\r\ni = 1\r\nwhile n1 >= 0 and n2 >= 0:\r\n n1 -= 1\r\n if n1 == -1:\r\n print('Second')\r\n break\r\n n2 -= 1\r\n if n2 == -1:\r\n print('First')\r\n break\r\n\r\n \r\n \r\n \r\n \r\n \r\n", "a, b, c, d = map(int, input().split())\r\nif a > b: print(\"First\")\r\nelse: print(\"Second\")", "n1, n2, k1, k2 = map(int, input().split())\r\n\r\nprint(\"First\") if n1 > n2 else print(\"Second\")", "a = input().split()\r\nif int(a[0]) > int(a[1]):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n1,n2,k1,k2=map(int, input().split())\r\nif n1<=n2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "a,b,c,d = map(int,input().split())\r\nwhile a>0 or b>0:\r\n a -=1\r\n b -=1\r\n if a==0:\r\n print('Second')\r\n break\r\n if b==0:\r\n print('First')\r\n break\r\n", "n,nn = list(map(int,input().split()))[0:2]\r\nprint(\"Second\" if nn>=n else \"First\")", "b = list(map(int, input().split()))\r\ni = 0\r\nif b[0] > b[1]:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "n1,n2,k1,k2=[int(i) for i in input().split()]\r\nturns1=0\r\nturns2=0\r\nif n1>n2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a=list(map(int,input().split()));print(\"Second\" if a[0]==a[1] else [\"First\",\"Second\"][a[0]<a[1]])", "a=input().split();print(['Second','First'][int(a[0])>int(a[1])])", "# coding=utf-8\r\n\r\nif __name__ == '__main__':\r\n n1, n2, k1, k2 = str(input()).split()\r\n n1 = int(n1)\r\n n2 = int(n2)\r\n k1 = int(k1)\r\n k2 = int(k2)\r\n if n1 > n2:\r\n print('First')\r\n else:\r\n print('Second')\r\n", "a,b,_,_=map(int,input().split()); #k1,k2没有用\r\nif a>b:print(\"First\")\r\nelse:print(\"Second\")", "w = list(map(int, input().split()))\nprint('First')if(w[0] > w[1]) else print(\"Second\")", "# Problem: https://vjudge.net/contest/565749#problem/F\nn1, n2, k1, k2 = [int(x) for x in input().split(' ')]\n\nwhile all([n1, n2]):\n n1 -= 1\n n2 -= 1\n\nif n1:\n print('First')\nelse:\n print('Second')\n \t\t \t \t \t \t\t\t \t \t \t \t\t \t\t", "a,b,c,E = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nE = int(E)\nif a <= b:\n print(\"Second\")\nelse:\n print(\"First\")\n\t \t \t \t \t\t \t\t\t \t\t", "import sys\n\n\ndef solve():\n n1, n2, k1, k2 = map(int, input().strip().split())\n if n1 > n2:\n return \"First\"\n else:\n return \"Second\"\n\n\nfilename = \"input.txt\"\n# sys.stdin = open(filename, \"r\")\nresult = solve()\nprint(result)\n\nsys.stdin = sys.__stdin__\n\n \t\t \t \t\t\t \t \t\t\t\t\t\t\t \t", "n1,n2,k1,k2=map(int,input().split())\r\nwhile n1>0 and n2>0:\r\n n1-=1\r\n n2-=1\r\nprint('First' if n1>n2 else \"Second\")", "n = input()\r\ns1,s2,s3,s4 = n.split()\r\ns1 = int(s1)\r\ns2 = int(s2)\r\ns3 = int(s3)\r\ns4 = int(s4)\r\nif s1 == s2: \r\n if s3 == s4:\r\n print(\"Second\")\r\n elif s1 == s3:\r\n print(\"First\")\r\n elif s2 == s4:\r\n print(\"Second\")\r\n elif s3 > s4:\r\n print(\"Second\")\r\n elif s4 > s3:\r\n print(\"First\")\r\nelif s1 > s2:\r\n print(\"First\")\r\nelif s2 > s1:\r\n print(\"Second\")", "#!/usr/bin/env python3\n\"\"\"\nCodeForces\n513 A. Game\n\n@author yamaton\n@date 2015-08-01\n\"\"\"\n\n\ndef solve(n1, n2, k1, k2):\n return n1 > n2\n\n\ndef tf_to_msg(tf):\n return 'First' if tf else 'Second'\n\n\ndef main():\n [n1, n2, k1, k2] = [int(i) for i in input().strip().split()]\n result = solve(n1, n2, k1, k2)\n print(tf_to_msg(result))\n\n\nif __name__ == '__main__':\n main()\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,m,k1,k2=map(int,input().split())\r\na=min(n,m)\r\nfor i in range(a+2):\r\n\tn-=1\r\n\tm-=1\r\n\tif n==0:\r\n\t\tprint('Second')\r\n\t\tbreak\r\n\tif m==0:\r\n\t\tprint('First')\r\n\t\tbreak\t", "a, b, n, k = map(int, input().split())\r\nif a <= b:\r\n print('Second')\r\nelse:\r\n print('First')", "def test():\n n1, n2, k1, k2 = map(int, input().split())\n\n print(\"First\" if n1 > n2 else \"Second\")\n\n\nif __name__ == \"__main__\":\n # t = int(input())\n t = 1\n for _ in range(t):\n test()\n", "\r\nn1,n2,k1,k2=map(int,input().split())\r\nwhile n1>0 and n2>0:\t\r\n\tn1=n1-1\r\n\tn2=n2-1\r\nif n1>n2:\r\n\tprint(\"First\")\r\nelse:print(\"Second\")\r\n", "def main():\n numbers = [int(x) for x in input().split(\" \")]\n if (numbers[1] >= numbers[0]):\n print(\"Second\")\n else:\n print(\"First\")\n\n\n\n\nif __name__ == '__main__':\n main()\n", "a1, a2, b, c = list(map(int, input().split()))\r\nif a1 > a2:\r\n print('First')\r\nelse:\r\n print('Second')", "l=list(map(int,input().split()))\r\nif l[0]>l[1]:\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Second\")", "n1,n2,k1,k2 = map(int,input().split())\nif n1>n2:print('First')\nelse:print('Second')\n \t\t\t\t \t \t \t \t\t \t\t \t\t\t \t", "a=list(map(int,input().split(\" \")))\r\nif (a[0]>a[1]):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Nov 8 11:11:47 2018\r\n\r\n@author: Quaint Sun\r\n\"\"\"\r\n\r\n\r\nn1,n2,k1,k2=map(int,input().split())\r\n\r\nif n1>n2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "actions = input().split()\n\nboxes = [int(actions[0]), int(actions[1])]\nmoves = [actions[2], actions[3]]\n\nplayer_1_wins = False\nplayer_2_wins = False\n\nwhile not player_1_wins or not player_2_wins:\n \n boxes[0] -= 1\n boxes[1] -= 1\n\n if boxes[0] == 0:\n player_2_wins = True\n break\n if boxes[1] == 0:\n player_1_wins = True\n break\n\nif player_1_wins:\n print(\"First\")\nelse:\n print(\"Second\")\n \t \t \t \t\t\t\t\t \t\t \t\t\t\t \t \t", "a,b,c,d=map(int,input().split())\nif a > b:\n print(\"First\")\nelse:\n print(\"Second\")\n#pity][kprylpjy\n\t\t \t\t \t \t \t\t\t\t\t \t\t \t\t\t\t", "n1, n2, k1, k2 = input().split(' ')\r\nn1 = int(n1)\r\nn2 = int(n2)\r\nk1 = int(k1)\r\nk2 = int(k2)\r\n\r\nif n1>n2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "s=input()\r\nlst=s.split()\r\nn1=int(lst[0])\r\nn2=int(lst[1])\r\nk1=int(lst[2])\r\nk2=int(lst[3])\r\nif n1>n2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "nk = input().split()\r\nif int(nk[0])>int(nk[1]) :\r\n print(\"First\")\r\nelse :\r\n print(\"Second\")\r\n", "a , b , c , d=(map(int ,input().split()))\r\nif(a>b):\r\n print('First')\r\nelif(b>a):\r\n print('Second')\r\nelif(a==b):\r\n print('Second')\r\n", "arr = list(map(int,input().split()))\r\nif arr[0]<=arr[1]:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"First\")\t", "# http://codeforces.com/problemset/problem/513/A\r\nn1, n2, k1, k2 = [int(x) for x in input().split()]\r\nif (n1 == n2):\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"First\" if n1 > n2 else \"Second\")", "n1,n2 = map(int,list(input().split())[:2])\r\nprint(('First','Second')[n1<=n2])", "n,k,l,m=map(int,input().split())\r\nif n > k :\r\n print(\"First\")\r\nelse :\r\n print(\"Second\")\r\n", "#import sys\r\n#sys.stdin = open('in.txt')\r\n#sys.setrecursionlimit(10000)\r\nn, m, k, t = map(int, input().split())\r\nif n <= m:\r\n print('Second')\r\nelse:\r\n print('First')", "a = input()\r\na = a.split()\r\nb = int(a[0])\r\nc = int(a[1])\r\nif b>c:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n1, n2, k1, k2 = [int(num) for num in input().split()]\r\nif n1 > n2:\r\n print('First')\r\nelse:\r\n print('Second')", "m,n,k,l=map(int,input().split())\r\nif m==n:\r\n print(\"Second\")\r\nelif m>n:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "\r\na,s,d,f=list(map(int,input().split()))\r\nprint('First') if a>s else print('Second')\r\n", "n1, n2, k1, k2 = map(int, input().split())\r\nif n1 <= n2: print(\"Second\")\r\nelse: print(\"First\")", "n1,n2,k1,k2=map(int,input().split())\nwhile(True):\n\tn1=n1-1\n\tif(n1==0 and n2>0):\n\t\tprint(\"Second\")\n\t\tbreak\n\telif(n2==0 and n1>0):\n\t\tprint(\"First\")\n\t\tbreak\n\telif(n1==0 and n2==0):\n\t\tprint(\"Second\")\n\t\tbreak\n\tn2=n2-1\n\tif(n1==0 and n2>0):\n\t\tprint(\"Second\")\n\t\tbreak\n\telif(n2==0 and n1>0):\n\t\tprint(\"First\")\n\t\tbreak\n\telif(n1==0 and n2==0):\n\t\tprint(\"Second\")\n\t\tbreak\n\n", "n, m, a, b = map(int, input().split())\r\nif n > m :\r\n print('First')\r\nelif n <= m :\r\n print('Second')", "a,b,c,d = map(int,input().split())\r\nif(a>b):print(\"First\")\r\nelse:print(\"Second\")", "line = list(map(int,input().split()))\r\nprint('First' if line[0] > line[1] else 'Second')\r\n", "n,b,c,d=input().split()\nn=int(n)\nb=int(b)\nc=int(c)\nd=int(d)\nif n<=b:\n print(\"Second\")\nelse:\n print(\"First\")\n \t\t\t \t\t \t \t\t\t \t \t \t\t\t \t", "n1,n2,k1,k2 = map(int,input().split())\r\nif n1 == n2:print(\"Second\")\r\nelse:\r\n if n1 > n2:print(\"First\")\r\n else:print(\"Second\")", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\nn1, n2, k1, k2 = map(int, input().split())\r\nfor i in range(10000000):\r\n if i % 2 == 0:\r\n if n1 == 0:\r\n print(\"Second\")\r\n break\r\n else:\r\n n1 -= 1\r\n else:\r\n if n2 == 0:\r\n print(\"First\")\r\n break\r\n else:\r\n n2 -= 1\r\n", "def getWinner(n1,n2,k1,k2):\r\n if n1 == 0:\r\n print(\"Second\")\r\n return\r\n elif n2 == 0:\r\n print(\"First\")\r\n return\r\n\r\n n1 = n1 - 1\r\n n2 = n2 - 1\r\n getWinner(n1,n2,k1,k2)\r\n\r\ninput_array = input().split()\r\n\r\nn1 = int(input_array[0])\r\nn2 = int(input_array[1])\r\nk1 = int(input_array[2])\r\nk2 = int(input_array[3])\r\n\r\n\r\ngetWinner(n1,n2,k1,k2)", "a,b,c,d=map(int,input().split())\r\na1=a\r\nb1=b\r\nfor i in range(1,max(a,b,c,d)+1):\r\n if a-i==0:\r\n print('Second')\r\n break\r\n elif b-i==0:\r\n print('First')\r\n break\r\n", "inp = input().split()\r\na,b = int(inp[0]),int(inp[1])\r\n\r\nif a<=b: print(\"Second\")\r\nelse: print(\"First\")", "a, b, n, m = map(int, input().split())\r\nprint(\"First\" if a > b else \"Second\")", "n1 , n2 , k1 , k2 = list(map(int,input().split()))\r\nif n1<=n2:\r\n\tprint(\"Second\")\r\nelif n1>n2:\r\n\tprint(\"First\")\t", "\r\na = list(map(int, input().strip().split()))\r\nif a[0] - 1 > a[1] - 1:\r\n print(\"First\")\r\nif a[0] - 1 < a[1] - 1:\r\n print(\"Second\")\r\nif a[0] - 1 == a[1] - 1:\r\n print(\"Second\")\r\n\r\n \r\n", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nif a>b:\r\n print('First')\r\nelse:\r\n print('Second')", "a,b,c,d=map(int,input().split())\nif a>b:print(\"First\")\nelse:print(\"Second\")", "n=input()\r\nn=n.split(\" \")\r\nwhile int(n[0])>0<int(n[1]):\r\n n[0]=int(n[0])-1\r\n n[1]=int(n[1])-1\r\nif int(n[0])>int(n[1]):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "s=list(map(int,input().split()))\r\nif s[0]>s[1]:print(\"First\")\r\nelse: print(\"Second\")\r\n", "a=input()\r\nb=a.split(\" \")\r\nb[0]=int(b[0])\r\nb[1]=int(b[1])\r\nif(b[0] > b[1]):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "__author__ = 'myduomilia'\n\nn1, n2, k1, k2 = list(map(int, input().split()))\nprint(\"Second\" if n2 >= n1 else \"First\")", "a = list(map(int, input().split(' ')))\r\nprint('First') if a[0] > a[1] else print('Second')\r\n", "lul = input().split()\n\nif(int(lul[0]) > int(lul[1])):\n print(\"First\")\nelse:\n print(\"Second\")\n \t\t \t \t\t \t\t\t\t\t\t \t \t\t\t \t\t\t\t\t \t\t", "n1,n2,k1,k2=input().split()\r\nn1,n2=int(n1),int(n2)\r\nif n1>n2:\r\n print('First')\r\nelif n1<=n2:\r\n print('Second')", "n1, n2, k1, k2 = tuple(map(int, input().split()))\r\nif n2 > n1 - 1:\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "from sys import stdin\r\n_input = stdin.readline\r\n_int = int\r\ndef solution():\r\n n, n_2, _, _ = [_int(i) for i in _input().split()]\r\n if n > n_2:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\nsolution()", "a,b,c,g=input().split()\na=int(a)\nb=int(b)\nc=int(c)\ng=int(g)\nif a<=b:\n print(\"Second\")\nelse:\n print(\"First\")\n\t \t\t \t \t \t \t \t \t\t\t \t\t\t\t\t\t\t\t", "a,b,c,d=map(int,input().split())\r\nprint(\"First\" if a>b else \"Second\")", "l = list(map(int, input().split()))\r\nif l[0]>l[1] :\r\n print('First') \r\nelse: \r\n print('Second')", "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 no():\r\n print(\"NO\")\r\n return\r\n\r\ndef yes():\r\n print(\"YES\")\r\n return\r\n\r\ndef solve(case_no):\r\n a, b, c, d = map(int, input().split())\r\n print(\"Second\" if a <= b else \"First\")\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "line = [int(i) for i in input().split()]\r\nif line[0]> line[1]:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n1,n2,k1,k2 = map(int,input().split())\r\nif n2<n1:\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Second\")", "a,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\nif a>b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "# Pradnyesh Choudhari\r\n# Sat Jul 11 19:37:52 2020\r\n\r\nn1, n2, k1, k2 = map(int, input().split())\r\nif n1==n2:\r\n print('Second')\r\nelif n1>n2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n \r\n\r\n\r\n", "v1, v2, t1, t2 = map(int, input().split())\r\nif v1 > v2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "# 513A\r\n\r\n__author__ = 'artyom'\r\n\r\nn = list(map(int, input().split()))\r\nprint('First' if n[0] > n[1] else 'Second')", "x,y,b,d=map(int,input().split())\r\nif x==y:\r\n\tprint(\"Second\")\r\nelif x>y:\r\n\tprint(\"First\")\r\nelse:\r\n\tx<y\r\n\tprint(\"Second\")", "a,b,c,d = (input().split())\na = int (a) # bolas 1 j\nb = int (b) # bolas 2 j\nc = int (c) \nd = int (d)\n\n\nif (a <= b):\n print(\"Second\")\nelse:\n print(\"First\")\n \t \t\t \t\t \t \t \t\t\t\t\t\t\t \t", "from math import ceil\r\ns = input().split(\" \")\r\nn1=int(s[0])\r\nn2=int(s[1])\r\nk1=int(s[2])\r\nk2=int(s[3])\r\nif(n1>n2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n\r\n", "t1=1\r\nfor _ in range(t1):\r\n n,n1,k,k1=map(int,input().split())\r\n if n>n1:\r\n print('First')\r\n else:\r\n print('Second')\r\n", "n1,n2,k1,k2=map(int,input().split())\r\nx=n1//1\r\ny=n2//1\r\nif(x>y):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "x = input()\r\nn1, n2, k1, k2 = (x.split(' '))\r\ny = int(n1)\r\np = int(n2)\r\nif y <= p:\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "x=input().split()\r\nn1=int(x[0])\r\nn2=int(x[1])\r\nk1=int(x[2])\r\nk2=int(x[3])\r\nif n1>n2:\r\n print('First')\r\nelif n1<n2:\r\n print('Second')\r\nelse:\r\n print('Second')", "n1,n2,k1,k2 = [int(i) for i in input().split()[:4]]\r\n\r\nj=0\r\nwhile(n1!=0 and n2!=0):\r\n if(j%2==0):\r\n n1 = n1-1\r\n else:\r\n n2 = n2-1\r\n j+=1\r\n\r\n\r\nif(n1==0):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "n1, n2, k1, k2 = input().split()\r\nprint({True: 'First', False: 'Second'}[int(n1)>int(n2)])", "l = list(map(int, input().split()))\r\nn1 = l[0]\r\nn2 = l[1]\r\nk1 = l[2]\r\nk2 = l[3]\r\n\r\nif (n1 == n2):\r\n print(\"Second\")\r\n exit(0)\r\nminVal = min(n1, n2)\r\nif (minVal == n1):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "li = [int(i) for i in input().split()]\r\nif(li[0] == li[1]):\r\n print(\"Second\")\r\nelif(li[0] > li[1]):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n, m, p, q = map(int,input().split())\r\nif n > m:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "num = list(map(int,input().split()))\nprint(\"First\") if num[0] > num[1] else print(\"Second\")\n\n \t\t \t\t \t \t\t \t \t\t\t\t \t\t \t", "if __name__ == \"__main__\":\r\n\tn1, n2, k1, k2 = list(map(int, input().split()))\r\n\r\n\tfirst = True\r\n\r\n\twhile n1 != 0 and n2 != 0:\r\n\t\tif first:\r\n\t\t\tn1 -= 1\r\n\t\t\tfirst = False\r\n\t\telse:\r\n\t\t\tn2 -= 1\r\n\t\t\tfirst = True \r\n\r\n\r\n\tif n1:\r\n\t\tprint('First')\r\n\telse:\r\n\t\tprint('Second')", "n1 , n2 , k1 , k2 = map(int,input().split())\r\nprint( [\"First\",\"Second\"] [ n2 >= n1 ] )\r\n", "n1,n2,k1,k2=[int(x) for x in input().split()]\r\n\r\n\"\"\"while(n1!=0 and n2!=0):\r\n if n1>0:\r\n n2=n2-1\r\n if n2>0:\r\n n1=n1-1\"\"\"\r\n\r\nif n1>n2:\r\n print(\"First\")\r\nelif n1<n2:\r\n print(\"Second\")\r\nelse:\r\n print(\"Second\")\r\n\r\n", "n1, n2, k1, k2 = map(int, input().split())\r\n\r\nif n1 > n2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n\r\n'''\r\nEach player can take from 1 to k1 balls (for the first player) or \r\nfrom 1 to k2 balls (for the second player) in each move.\r\nSo each player would try to throw as less balls as possible, possibly 1.\r\nSo, the one with more balls in their box will eventually win.\r\n'''", "n,m=map(int,input().split()[:2]);print('SFeicrosntd'[m<n::2])", "n1,n2,k1,k2=input().split(' ')\r\nn1=int(n1)\r\nn2=int(n2)\r\nk1=int(k1)\r\nk2=int(k2)\r\nn11=0\r\nn22=0\r\n\r\nwhile n1!=0:\r\n\tn1=n1-1\r\n\tn11=n11+1\r\nwhile n2!=0:\r\n\tn2=n2-1\r\n\tn22=n22+1\r\nif n11>n22:\r\n\tprint('First')\r\nelse:\r\n\tprint('Second')", "n_1,n_2,t_1,t_2 = map(int,input().split())\r\n\r\nwhile n_1 != -1 and n_2 != -1:\r\n n_1 -= 1\r\n n_2 -= 1\r\n\r\nif n_1 == -1:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n ", "a,b,c,d=map(int,input().split())\nif a>b: print(\"First\")\nelse: print(\"Second\")", "\r\nx = [int(x) for x in input().split()]\r\n\r\nif x[0] <= x[1]:\r\n print('Second')\r\nelse:\r\n print('First')", "n1,n2,k1,k2 = map(int,input().split())\r\nprint('First' if n1>n2 else 'Second')", "import sys\r\nimport math\r\n\r\nn1, n2, k1, k2 = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nif(n1 > n2):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "a, b, c, d=map(int, input().split())\r\nif a<= b :\r\n\tprint (\"Second\")\r\nelse :\r\n\tprint (\"First\")", "a, b, _, _ = [int(i) for i in input().split()]\nif a > b:\n print('First')\nelse:\n print('Second')\n", "a,b,*c=map(int,input().split())\r\nprint('SFeicrosntd'[a>b::2])", "a=input().split();print('First' if int(a[0])>int(a[1]) else 'Second')", "a,b,x,y=map(int,input().split())\nif b>=a:\n\tprint(\"Second\")\nelse:\n\tprint(\"First\")", "n1, n2, k1, k2 = map(int,input().split())\r\nprint('First' if (n1>n2) else 'Second')\r\n", "bang=input().split()\nn1=int(bang[0])\nn2=int(bang[1])\nif n1>n2:\n print(\"First\")\nelse:\n print(\"Second\")\n", "# Game\ndef game(n, m, k, l):\n if n == m:\n return \"Second\"\n if n > m:\n return \"First\"\n return \"Second\"\n\n\nx = list(map(int, input().rstrip().split()))\nprint(game(x[0], x[1], x[2], x[3]))", "a, b, c, d = map(int, input().split())\r\ne = [\"First\", \"Second\"]\r\nprint(e[b >= a])\r\n", "nn=input()\r\nnn=nn.split()\r\nn1=int(nn[0])\r\nn2=int(nn[1])\r\nk1=int(nn[2])\r\nk2=int(nn[3])\r\nif n1>n2:\r\n print('First')\r\nelse:\r\n print('Second')\r\n ", "n,m,k1,k2=map(int,input().split())\r\nif n==m:\r\n print(\"Second\")\r\nelif n>m:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n1,n2,k1,k2=map(int,input().split())\r\nwhile n1 and n2:\r\n n1,n2=n1-1,n2-1\r\nelse:\r\n print(\"First\" if n1 else \"Second\")", "n1, n2, k1, k2 = (int(x) for x in input().split())\r\nif n1 is n2:\r\n print('Second')\r\nelse:\r\n print(('First', 'Second')[n1 < n2])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jun 30 12:29:50 2021\r\n\r\n@author: adity\r\n\"\"\"\r\n\r\nn1,n2,k1,k1=map(int, input().split(\" \"))\r\nif(n1==n2):\r\n print(\"Second\")\r\nelif(n1>n2):\r\n print(\"First\")\r\nelif(n2>n1):\r\n print(\"Second\")", "temp = input()\nn1, n2, k1, k2 = temp.split(\" \")\nn1, n2, k1, k2 = int(n1), int(n2), int(k1), int(k2)\n\nif (n1 > n2):\n print(\"First\")\nelse:\n print(\"Second\")", "def str_list(s, char):\r\n output_list = []\r\n collector = \"\"\r\n for i in range(len(s)):\r\n if s[i] == char:\r\n if collector:\r\n output_list.append(int(collector))\r\n collector = \"\"\r\n else:\r\n collector += s[i]\r\n output_list.append(int(collector))\r\n return output_list\r\n\r\n\r\ndef list_str(l, char):\r\n output_str = \"\"\r\n for i in range(len(l) - 1):\r\n output_str += str(l[i]) + char\r\n output_str += str(l[len(l) - 1])\r\n return output_str\r\n\r\n\r\ndef main_function():\r\n n_1, n_2, k_1, k_2 = str_list(input(), \" \")\r\n ratio_1 = n_1 // k_1\r\n ratio_2 = n_2 // k_2\r\n if n_1 > n_2:\r\n return \"First\"\r\n else:\r\n return \"Second\"\r\n\r\n\r\nprint(main_function())\r\n\r\n", "def main():\n\tstring = input()\n\tstring = string.split(\" \")\n\t\n\tn1 = int(string[0])\t\n\tif n1 < 0 or n1 > 50:\n\t\treturn 0\n\tn2 = int(string[1])\n\tif n2 < 0 or n2 > 50: \n\t\treturn 0\n\t\n\tk1 = int(string[2])\n\tif k1 < 0 or k1 > 50:\n\t\treturn 0\n\tk2 = int(string[3])\n\tif k2 < 0 or k2 > 50:\n\t\treturn 0\n\t\n\n\tif n1 > n2:\n\t\tprint(\"First\")\n\t\treturn 0;\n\n\tprint(\"Second\") \n\treturn 0;\n\nmain()", "n1, n2, _, _ = map(int, input().split())\n\nif n1 > n2:\n\tprint('First')\nelse:\n\tprint('Second')", "n1,n2,k1,k2=map(int,input().split())\r\na,b=min(1,k1),min(1,k2)\r\nif(n1-a==n2-b):\r\n print('Second')\r\nelse:\r\n if(n1-a > n2-b):\r\n print('First')\r\n else:\r\n print('Second')", "N,n,K,k=map(int,input().split())\r\nif N>n: print('First')\r\nelse: print('Second')", "n1,n2,k1,k2 = list(map(int,input().split(' ')))\nif n1==n2 or n2>n1:\n print('Second')\nelse:\n print('First')", "n1,n2,k1,k2=map(int,input().split())\r\nif ((n1+n2)%2==0 or (n2>n1))and not n1>n2:\r\n print('Second')\r\nelse:\r\n print('First')", "def main():\r\n line = input().rstrip().split()\r\n n1 = int(line[0])\r\n n2 = int(line[1])\r\n if n1 > n2:\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\n \r\nmain()\r\n", "d = [int(x) for x in input().split()]\r\nif d[0]>d[1]:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "n1,n2,k1,k2 =map(int, input().split())\r\nprint([\"Second\",\"First\"][n1>n2])", "inpt = [int(i) for i in input().split()]\nif inpt[0] > inpt[1]:\n print(\"First\")\nelse:\n print(\"Second\")\n\n\t\t \t \t \t \t\t\t \t\t\t \t \t\t\t\t", "n1,n2,k1,k2 = list(map(int, input().split()))\r\n\r\nif n2 >= n1:\r\n print('Second')\r\nelse:\r\n print('First')", "n = list(map(int, input().split()))\r\nif n[0] > n[1]:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,c,d=list(map(int ,input().split()))\r\nif(a==b):\r\n\tprint(\"Second\")\r\nelse:\r\n\tif(max(a,b)==a):\r\n\t\tprint(\"First\")\r\n\telse:\r\n\t\tprint(\"Second\")", "a,b,k1,k2=map(int,input().split())\r\nwhile 1:\r\n a=a-1\r\n b=b-1\r\n if a==0:\r\n print(\"Second\")\r\n break\r\n elif b==0:\r\n print(\"First\")\r\n break\r\n ", "n,m,a,p=map(int,input().split())\r\nif (n<=m):print('Second')\r\nelse:print('First')", "\r\n\r\ndef solve(a, b, c, d):\r\n\r\n if a > b:\r\n return 'First'\r\n\r\n return 'Second'\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a, b, c, d = map(int, input().split())\r\n print(solve(a, b, c, d))", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/22 22:59\r\n\r\n\"\"\"\r\n\r\nn1, n2, k1, k2 = map(int, input().split())\r\n\r\nif n1 <= n2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "n1,n2,k1,k2 = [int(x) for x in input().split()]\r\nif(n2>=n1):\r\n\tprint ('Second')\r\nelse:\r\n\tprint ('First')", "n1,n2,k1,k2 = map(int,input().split())\r\noutput = 'Second'\r\n\r\nif n1 > n2:\r\n\toutput ='First'\r\n\r\nprint(output)\r\n", "def solve(n1, n2, k1, k2):\n if n1 > n2:\n return \"First\"\n else:\n return \"Second\"\n\n\ndef main():\n n1, n2, k1, k2 = list(map(int, input().split()))\n print(solve(n1, n2, k1, k2))\n\n\nmain()\n", "n1, n2, k1, k2 = input().split()\nn1 = int(n1)\nn2 = int(n2)\n\nif n1 <= n2:\n print(\"Second\")\n\nelse:\n print(\"First\")", "x = input().split()\r\ntemp = []\r\nfor i in x:\r\n temp.append(int(i))\r\nx = temp.copy()\r\nn1 = x[0]\r\nn2 = x[1]\r\nk1 = x[2]\r\nk2 = x[-1]\r\nc1 = False\r\nwhile c1==False:\r\n if n1==0:\r\n print(\"Second\")\r\n break\r\n n1 -= 1\r\n if n2 == 0:\r\n print(\"First\")\r\n break\r\n n2 -= 1\r\n \r\n ", "n=str(input()).split()\r\nn1=int(n[0])\r\nn2=int(n[1])\r\nif n1<=n2:\r\n print('Second')\r\nelif n1>n2:\r\n print('First')", "st=input()\r\nl=[int(x) for x in st.split(' ')]\r\n\r\nif l[0]>l[1]:\r\n print('First')\r\nelif l[0]==l[1]:\r\n print('Second')\r\nelse:\r\n print('Second')\r\n", "n1,n2,k1,k2=[int(x) for x in input().split()]\r\nprint(\"First\" if n1>n2 else \"Second\")\r\n", "import math\r\nimport os\r\nimport sys\r\n\r\nimport re\r\nimport string\r\n\r\nimport itertools\r\nimport functools\r\nimport operator\r\n\r\na, b, c, d = map(int, input().split())\r\nprint('First' if a > b else 'Second')", "\r\nn_1, n_2, k_1, k_2 = map(int,input().split())\r\nratio_1 = n_1 // k_1\r\nratio_2 = n_2 // k_2\r\nif n_1 > n_2:\r\n print(\"First\")\r\nelse:\r\n print( \"Second\")", "a=list(map(int,input().split()))\nif a[0]>a[1]:\n\tprint('First')\nelif a[0]<a[1]:\n\tprint('Second')\nelse:\n\tprint('Second')\t\t", "n1,n2,k1,k2 = [int(x) for x in input().split()]\r\n\r\nwhile True:\r\n n1 -= 1\r\n n2 -= 1\r\n if n1 == 0:\r\n print(\"Second\")\r\n break\r\n elif n2 == 0:\r\n print(\"First\")\r\n break", "a,b,c,d=map(int,input().split())\r\nif a>b :print('First')\r\nelse :print('Second')\r\n", "n1, n2, k1, k2 = input().split()\nn1, n2 = int(n1), int(n2)\n\nif n1 > n2:\n\tprint('First')\nelse:\n\tprint('Second')", "n1,n2,k1,k2 = map(int,input().split())\r\nflag1 = 0\r\nflag2 = 0\r\ni=1\r\nwhile True:\r\n if i%2!=0:\r\n if n1 < 1:\r\n flag1=1\r\n break\r\n else:\r\n n1 -=1\r\n if n1<1:\r\n flag1=1\r\n break\r\n else:\r\n if n2 < 1:\r\n flag2=1\r\n break\r\n else:\r\n n2-=1\r\n if n2 < 1:\r\n flag2=1\r\n break\r\n i+=1\r\nif flag1==1:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n \r\n", "l=list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n\tif l[0]>l[1]:\r\n\t\tprint(\"First\")\r\n\t\tbreak\r\n\telif l[0]==l[1]:\r\n\t\tprint(\"Second\")\r\n\t\tbreak\r\n\t\t\r\n\telse:\r\n\t\tprint(\"Second\")\r\n\t\tbreak", "a = list(map(int,input().split()))\r\n\r\nif a[0] == a[1] :\r\n print(\"Second\")\r\n\r\nif a[0] > a[1] :\r\n print(\"First\")\r\n\r\nif a[0] < a[1] :\r\n print(\"Second\")", "n_1, n_2 , k_1 , K_2 = map(int, input().split())\r\nwhile True :\r\n if n_1 !=0 :\r\n n_1 -=1\r\n else :\r\n print(\"Second\")\r\n break\r\n \r\n if n_2 !=0 :\r\n n_2 -=1\r\n else :\r\n print (\"First\")\r\n break", "# testCaseNum = int(input())\n# for testCase in range(testCaseNum):\n# n = map(int ,input().split())\n# print(min(n-1 ,abs(a - b)+x))\nn1 ,n2 ,k1 ,k2 = map(int ,input().split())\nif n2 >= n1:\n print(\"Second\")\nelse:\n print(\"First\")\n", "n, m,a, b = map(int, input().split())\r\nif(m>=n):\r\n print('Second')\r\nelse:\r\n print('First')", "a,b,c,d=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\nif a>b:\n print(\"First\")\nelse:\n print(\"Second\")\n#vjhvolujh\n\t \t\t\t \t\t \t \t\t \t\t\t\t \t\t\t", "import math\r\ndef solve():\r\n words = input().split()\r\n first = int(words[0])\r\n second = int(words[1])\r\n while first !=0 and second !=0:\r\n first = first -1\r\n second = second-1\r\n if first == 0:\r\n print(\"Second\")\r\n elif second == 0:\r\n print(\"First\")\r\n \r\n\r\n# for _ in range(int(input())):\r\nsolve()", "[a,b,c,d] = map(int,input().split())\r\nif a>b:\r\n print(\"First\")\r\nelse:\r\n print (\"Second\")\r\n\r\n", "nk = list(map(int, input().split()))\r\nif nk[0] <= nk[1]:\r\n\tprint('Second')\r\nelse:\r\n\tprint('First')", "#The stupid horrible game\n[n1,n2,k1,k2] = map(int, input().split())\nif n2>n1:\n print(\"Second\")\nelif n1==n2:\n print(\"Second\")\nelse:\n print(\"First\")\n", "x=input()\r\nn1=int(x.split()[0])\r\nn2=int(x.split()[1])\r\nif n1>n2: print(\"First\")\r\nelse: print(\"Second\")\r\n", "x, y, a, b = [int(i) for i in input().split()]\r\nprint('First' if x > y else 'Second')\r\n", "line=input()\r\nline=line.split()\r\na=int(line[0])\r\nb=int(line[1])\r\nc=int(line[2])\r\nd=int(line[3])\r\n\r\nif a>b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n = list(map(int,input().split()))\r\nif n[0] > n[1] :\r\n print('First')\r\nelse:\r\n print(\"Second\")", "n, m, k1, k2 = map(int, input().split())\n\nprint(\"First\" if n > m else \"Second\")", "n1_n2_k1_k2 = list(map(int, input().split()))\r\nn1 = n1_n2_k1_k2[0]\r\nn2 = n1_n2_k1_k2[1]\r\nk1 = n1_n2_k1_k2[2]\r\nk2 = n1_n2_k1_k2[3]\r\nif n2 >= n1:\r\n print('Second')\r\nelse:\r\n print('First')", "n1, n2, k1, k2 = map(int, input().split())\r\nprint([\"First\",\"Second\"][n2 >= n1])", "a,b,c,d=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\nif a<=b:\n print(\"Second\")\nelse:\n print(\"First\")\n\t \t\t\t\t\t\t\t \t \t \t\t\t \t\t\t \t\t \t", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\nif m >= n:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "import sys\nn1, n2, k1, k2 = map(int, sys.stdin.readline().split())\nn = n1+n2\nF = [ [0]*n for i in range(n) ]\ndef f(a1, a2):\n if F[a1][a2] == 0:\n if a1 == 0:\n F[a1][a2] = 2\n else:\n for i in range(1,min(k1+1,a1+1)):\n if f(a2, a1-i) == 2:\n F[a1][a2] = 1\n break\n else:\n F[a1][a2] = 2\n return F[a1][a2]\nif f(n1,n2) == 1:\n print('First')\nelse:\n print('Second')\n", "line = list(map(int,input().split()))\r\nif line[0] > line[1]:\r\n print('First')\r\nelse:\r\n print('Second')\r\n", "n,k,A,B = [int(x) for x in input().split()]\nif n==k:\n print('Second')\nelif n>k:\n print('First')\nelse:\n print(\"Second\")\n# 1512497245763\n", "w = list(map(int, input().split()))\nif(w[0] > w[1]):\n print('First')\nelse:\n print(\"Second\")", "a,b,c,d=[int(i) for i in input().split()]\r\nif a>b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n1,n2,k1,k2=map(int,input().split())\r\nwhile(1):\r\n\tif(n1>0):\r\n\t\tn1=n1-1\r\n\tif(n2>0):\r\n\t\tn2=n2-1\r\n\tif(n1==0):\r\n\t\tprint('Second')\r\n\t\tbreak\r\n\tif(n2==0):\r\n\t\tprint('First')\r\n\t\tbreak", "a,b,c,d=map(int,input().split())\nwhile True:\n a-=1\n if a<0 or a==0:\n print('Second')\n break\n b-=1\n if b<0 or b==0:\n print('First')\n break\n", "a = list(map(int,input().split()))\r\nif a[0] > a[1]: print('First')\r\nelse: print('Second')\r\n", "line = input()\nnumbers = line.split()\n\nn1 = int(numbers[0])\nn2 = int(numbers[1])\nk1 = int(numbers[2])\nk2 = int(numbers[3])\n\nif(n1 > n2):\n print(\"First\")\nelif (n1 == n2):\n print(\"Second\")\nelse:\n print(\"Second\")", "n1, n2, k1, k2=input().split()\r\nn1=int(n1)\r\nn2=int(n2)\r\nk1=int(k1)\r\nk2=int(k2)\r\nfor i in range(999999999):\r\n n1-=1\r\n if n1<0:\r\n print(\"Second\")\r\n break\r\n n2-=1\r\n if n2<0:\r\n print(\"First\")\r\n break" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nsize = ['S', 'M', 'L', 'XL', 'XXL', 'XXXL']\r\nnum = {size[i]: i for i in range(6)}\r\n\r\n\r\ndef distribute():\r\n for i in range(n):\r\n if len(want[i]) == 1:\r\n w = want[i][0]\r\n if cnt[w] == 0:\r\n return False\r\n ans[i] = size[w]\r\n cnt[w] -= 1\r\n return True\r\n\r\ndef distribute2(x):\r\n for i in range(n):\r\n if len(want[i]) == 2:\r\n w1, w2 = want[i]\r\n if w1 == x:\r\n if cnt[w1] > 0:\r\n ans[i] = size[w1]\r\n cnt[w1] -= 1\r\n elif cnt[w2] > 0:\r\n ans[i] = size[w2]\r\n cnt[w2] -= 1\r\n else:\r\n return False\r\n return True\r\n\r\n\r\ncnt = list(map(int, input().split()))\r\nn = int(input())\r\nwant = []\r\nfor _ in range(n):\r\n w = sorted(num[s] for s in input()[:-1].split(','))\r\n want.append(w)\r\n\r\nans = [0] * n\r\nif not distribute():\r\n print('NO')\r\n exit()\r\n\r\nfor i in range(5):\r\n if not distribute2(i):\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\nfor s in ans:\r\n print(s)\r\n", "def clothes_giver():\r\n sizes = ['S', 'M', 'L', 'XL', 'XXL', 'XXXL']\r\n size_num = dict(zip(sizes, range(6)))\r\n num_size = dict(zip(range(6), sizes))\r\n amount = list(map(int, input().split()))\r\n in_stock = dict(zip(sizes, amount))\r\n ordered = dict(zip(sizes, [0] * 6))\r\n distributed = {}\r\n for key in sizes:\r\n distributed[key] = [0, 0]\r\n undefined = [0] * 6\r\n result = []\r\n n = int(input())\r\n for i in range(n):\r\n cus_choice = input().split(',')\r\n if len(cus_choice) == 1:\r\n if ordered[cus_choice[0]] + 1 <= in_stock[cus_choice[0]]:\r\n ordered[cus_choice[0]] += 1\r\n else:\r\n return ['NO']\r\n result.append(cus_choice[0])\r\n else:\r\n result.append(cus_choice)\r\n undefined[size_num[cus_choice[0]]] += 1\r\n # отдаем все, если хватает футболок меньшего размера или только то, что есть\r\n distributed[num_size[0]][0] += min(undefined[0], in_stock[num_size[0]] - ordered[num_size[0]])\r\n ordered[num_size[0]] += distributed[num_size[0]][0]\r\n undefined[0] -= distributed[num_size[0]][0]\r\n for i in range(1, len(undefined)):\r\n # отдаем размер больше тем, кому меньшего размера не хватило\r\n distributed[num_size[i-1]][1] += min(undefined[i-1],\r\n in_stock[num_size[i]] - ordered[num_size[i]])\r\n # М-ки отданные в выборах SM\r\n undefined[i-1] -= distributed[num_size[i-1]][1]\r\n distributed[num_size[i]][0] += min(undefined[i], in_stock[num_size[i]] - ordered[num_size[i]] -\r\n distributed[num_size[i-1]][1])\r\n\r\n ordered[num_size[i]] += distributed[num_size[i]][0]\r\n # Вычитаются M-ки для выборов ML\r\n undefined[i] -= distributed[num_size[i]][0]\r\n\r\n for i in undefined:\r\n if i != 0:\r\n return ['NO']\r\n\r\n actual_res = []\r\n for size in result:\r\n if type(size) is not list:\r\n actual_res.append(size)\r\n else:\r\n if (distributed[size[0]][0] > 0):\r\n distributed[size[0]][0] -= 1\r\n actual_res.append(size[0])\r\n else:\r\n distributed[size[0]][1] -= 1\r\n actual_res.append(size[1])\r\n\r\n return ['YES'] + actual_res\r\n\r\nif __name__ == '__main__':\r\n for i in clothes_giver():\r\n print(i)", "dressing = {k:v for k,v in zip('S M L XL XXL XXXL'.split(),map(int,input().split()))}\n\nn = int(input())\nans = True\nlistans = ['']*n\nasked = []\nfor i in range(n):\n line = input().split(',')\n if len(line)==1:\n listans[i] = line[0]\n dressing[line[0]] -= 1\n if dressing[line[0]]<0:\n ans = False\n else:\n asked.append(line+[i])\n\nasked.sort(key=lambda x:'S M L XL XXL XXXL'.split().index(x[0]))\n\nfor low,up,i in asked:\n if dressing[low] == 0:\n if dressing[up] == 0:\n ans = False\n else:\n listans[i] = up\n dressing[up] -= 1\n else:\n listans[i] = low\n dressing[low] -= 1\n\nprint('NO' if not ans else 'YES')\nif ans: print(*listans,sep='\\n')\n\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\nn = int(input())\r\nss = ['S', 'M', 'L', 'XL', 'XXL', 'XXXL']\r\nd={}\r\ndoubs = []\r\nhave ={}\r\nvals={}\r\ncnt={}\r\nfor i in range(6):\r\n\td[ss[i]]=i\r\n\tif(i<5):\r\n\t\thave[(i, i+1)]=0\r\n\t\tvals[(i,i+1)]=0\r\n\t\tcnt[(i, i+1)]=0\r\n\r\nfor i in range(n):\r\n\tx = list(input().split(','))\r\n\tif(len(x)==1):\r\n\t\tst =d[x[0]]\r\n\t\tL[st]-=1\r\n\t\tdoubs.append((st, -1))\r\n\telse:\r\n\t\ta, b = d[x[0]], d[x[1]]\r\n\t\tdoubs.append((min(a, b), max(a, b)))\r\n\t\thave[doubs[i]]+=1\r\nfor i in range(6):\r\n\tif(L[i]<0):\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\nfor k, v in have.items():\r\n\tif(v==0):\r\n\t\tcontinue\r\n\ta,b = k\r\n\tif(L[a]+L[b])<v:\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\n\th = L[a]+L[b]-v\r\n\tpb = L[b]\r\n\tL[b]=min(L[b], h)\r\n\tbused = pb-L[b]\r\n\taused = v-bused\r\n\tvals[k]= aused\r\n\t#print(k, aused, bused,h)\r\nans=[]\r\nfor x in doubs:\r\n\tif(x[1]==-1):\r\n\t\tans.append(ss[x[0]])\r\n\t\tcontinue\r\n\tif cnt[x]>=vals[x]:\r\n\t\tans.append(ss[x[1]])\r\n\telse:\r\n\t\t\r\n\t\tans.append(ss[x[0]])\r\n\t\tcnt[x]+=1\r\nprint(\"YES\")\r\nfor y in ans:\r\n\tprint(y)\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\na, n, ans = [int(x) for x in input().split()], int(input()), ['YES']\r\nsz = ['S', 'M', 'L', 'XL', 'XXL', 'XXXL']\r\ndic = {sz[i]: a[i] for i in range(6)}\r\n\r\nfor _ in range(n):\r\n s = input().split(',')\r\n if len(s) == 1:\r\n ans.append(s[0])\r\n dic[s[0]] -= 1\r\n else:\r\n ans.append(s)\r\n if dic[s[0]] == -1:\r\n exit(print('NO'))\r\n\r\nfor j in range(5):\r\n for i in range(1, n + 1):\r\n if type(ans[i]) is list and ans[i] == sz[j:j + 2]:\r\n s1, s2 = ans[i]\r\n if dic[s1]:\r\n dic[s1] -= 1\r\n ans[i] = s1\r\n elif dic[s2]:\r\n dic[s2] -= 1\r\n ans[i] = s2\r\n else:\r\n exit(print('NO'))\r\n\r\nprint('\\n'.join(ans))\r\n", "shirt = 'S M L XL XXL XXXL'.split()\n\ndef solve():\n stock = list(map(int,input().split()))\n ans, needs = [], []\n for i in range(int(input())):\n *asked, = input().split(',')\n if len(asked) == 1:\n a = shirt.index(asked[0])\n stock[a] -= 1\n if stock[a] < 0:\n return None\n else:\n ans.append((i, a))\n else:\n a, b = sorted((shirt.index(asked[0]), shirt.index(asked[1])))\n needs.append((a, b, i))\n needs.sort()\n for a, b, i in needs:\n if stock[a] > 0:\n stock[a] -= 1\n ans.append((i, a))\n elif stock[b] > 0:\n stock[b] -= 1\n ans.append((i, b))\n else:\n return None\n return ans\n\nassignment = solve()\nif assignment is None:\n print('NO')\nelse:\n print('YES')\n assignment.sort()\n for i, a in assignment:\n print(shirt[a])\n \t\t\t \t \t \t\t\t\t\t \t \t \t\t\t \t\t", "import sys\r\ndef gg():\r\n print('NO')\r\n sys.exit()\r\ns,m,l,xl,xxl,xxxl=map(int,input().split())\r\nr={'S':s,'M':m,'L':l,'XL':xl,'XXL':xxl,'XXXL':xxxl}\r\nt={'S,M':[],'M,L':[],'L,XL':[],'XL,XXL':[],'XXL,XXXL':[]}\r\nn=int(input())\r\nz=['']*n\r\nfor i in range(n):\r\n s=input()\r\n if ',' not in s:\r\n if r[s]<=0: gg()\r\n r[s]-=1\r\n z[i]=s\r\n else: t[s].append(i)\r\nfor v,p in t.items():\r\n f,s=v.split(',')\r\n for i in range(len(p)):\r\n if r[f]>0:\r\n r[f]-=1\r\n z[p[i]]=f\r\n elif r[s]>0:\r\n r[s]-=1\r\n z[p[i]]=s\r\n else:\r\n gg()\r\nprint('YES')\r\nfor i in z: print(i)\r\n \r\n ", "def fail():\r\n print('NO')\r\n exit()\r\n\r\nread = lambda: map(int, input().split())\r\nd = {'S': 0, 'M': 1, 'L': 2, 'XL': 3, 'XXL': 4, 'XXXL': 5}\r\nd2 = ['S', 'M', 'L', 'XL', 'XXL', 'XXXL']\r\nc = list(read())\r\nn = int(input())\r\nc2 = [0] * 6\r\nind = [list() for i in range(6)]\r\nans = [0] * n\r\nfor i in range(n):\r\n t = input()\r\n if ',' not in t:\r\n c[d[t]] -= 1\r\n ans[i] = t\r\n else:\r\n a, b = t.split(',')\r\n c2[d[a]] += 1\r\n ind[d[a]].append(i)\r\nif min(c) < 0: fail()\r\nfor i in range(5):\r\n x = c2[i]\r\n while c[i] and x:\r\n c[i] -= 1\r\n x -= 1\r\n cur = ind[i].pop()\r\n ans[cur] = d2[i]\r\n while c[i + 1] and x:\r\n c[i + 1] -= 1\r\n x -= 1\r\n cur = ind[i].pop()\r\n ans[cur] = d2[i + 1]\r\n if x: fail()\r\nprint('YES')\r\nprint('\\n'.join(map(str, ans)))", "cs = list(map(int, input().split(\" \")))\n\ncamisas = {}\ncamisas['S'] = cs[0]\ncamisas['M'] = cs[1]\ncamisas['L'] = cs[2]\ncamisas['XL'] = cs[3]\ncamisas['XXL'] = cs[4]\ncamisas['XXXL'] = cs[5]\n\np = int(input())\n\nresposta = {}\npossivel = True\ns = []\nm = []\nl = []\nxl = []\nxxl = []\n\nfor i in range(p):\n camisa_pessoa = list(input().split(\",\"))\n if len(camisa_pessoa) == 1:\n camisa = camisa_pessoa[0]\n if camisas[camisa] > 0:\n resposta[i] = camisa\n camisas[camisa] = camisas[camisa] - 1\n else:\n possivel = False\n else:\n if camisa_pessoa[0] == 'S': s.append(i)\n elif camisa_pessoa[0] == 'M': m.append(i)\n elif camisa_pessoa[0] == 'L': l.append(i)\n elif camisa_pessoa[0] == 'XL': xl.append(i)\n elif camisa_pessoa[0] == 'XXL': xxl.append(i)\n\nif possivel:\n for i in s:\n if camisas['S'] > 0:\n camisas['S'] = camisas['S'] - 1\n resposta[i] = 'S'\n elif camisas['M'] > 0:\n camisas['M'] = camisas['M'] - 1\n resposta[i] = 'M'\n else:\n possivel = False\n break\nif possivel:\n for i in m:\n if camisas['M'] > 0:\n camisas['M'] = camisas['M'] - 1\n resposta[i] = 'M'\n elif camisas['L'] > 0:\n camisas['L'] = camisas['L'] - 1\n resposta[i] = 'L'\n else:\n possivel = False\n break\nif possivel:\n for i in l:\n if camisas['L'] > 0:\n camisas['L'] = camisas['L'] - 1\n resposta[i] = 'L'\n elif camisas['XL'] > 0:\n camisas['XL'] = camisas['XL'] - 1\n resposta[i] = 'XL'\n else:\n possivel = False\n break\nif possivel:\n for i in xl:\n if camisas['XL'] > 0:\n camisas['XL'] = camisas['XL'] - 1\n resposta[i] = 'XL'\n elif camisas['XXL'] > 0:\n camisas['XXL'] = camisas['XXL'] - 1\n resposta[i] = 'XXL'\n else:\n possivel = False\n break\nif possivel:\n for i in xxl:\n if camisas['XXL'] > 0:\n camisas['XXL'] = camisas['XXL'] - 1\n resposta[i] = 'XXL'\n elif camisas['XXXL'] > 0:\n camisas['XXXL'] = camisas['XXXL'] - 1\n resposta[i] = 'XXXL'\n else:\n possivel = False\n break\n\nif not possivel:\n print('NO')\nelse:\n print('YES')\n for k in range(p):\n print(resposta[k])\n \t\t\t\t \t \t\t \t\t \t\t \t \t", "def solve(n, sizes, allocation, demands):\n for i in range(n):\n curr = input()\n if len(curr.split(',')) == 1:\n if sizes[curr] > 0:\n sizes[curr] -= 1\n allocation[i] = curr\n else:\n return False\n else:\n demands[curr].append(i)\n\n for demand, people in demands.items():\n poss_1, poss_2 = demand.split(',')\n for i in range(len(people)):\n if sizes[poss_1] > 0:\n sizes[poss_1] -= 1\n allocation[people[i]] = poss_1\n elif sizes[poss_2] > 0:\n sizes[poss_2] -= 1\n allocation[people[i]] = poss_2\n else:\n return False\n return True\n\ns, m, l, xl, xxl, xxxl = map(int, input().split())\nn = int(input())\n\nsizes = { 'S': s, 'M': m, 'L': l, 'XL': xl, 'XXL': xxl, 'XXXL': xxxl }\nallocation = ['' for _ in range(n)]\ndemands = { 'S,M': [], 'M,L': [], 'L,XL': [], 'XL,XXL': [], 'XXL,XXXL': [] }\n\nif not solve(n, sizes, allocation, demands):\n print('NO')\nelse:\n print('YES')\n for a in allocation:\n print(a)", "#!/usr/bin/env python3\n\ntailles = list(map(int, input().split()))\nN = int(input())\n\nwanted = [-1] * N\nchoices = [-1] * N\n\nletters = ['S', 'M', 'L', 'XL', 'XXL', 'XXXL']\nkeys = {letters[i]:i for i in range(6)}\n\nfor i in range(N):\n val = input().split(',')\n if (len(val) == 2):\n wanted[i] = keys[val[0]]\n else:\n choices[i] = keys[val[0]]\n\n if not tailles[keys[val[0]]]:\n print('NO')\n exit()\n\n tailles[keys[val[0]]] -= 1\n\nfor l in range(6):\n for i in range(N):\n if wanted[i] == l:\n if tailles[l]:\n choices[i] = l\n tailles[l] -= 1\n elif l < 5 and tailles[l + 1]:\n choices[i] = l + 1\n tailles[l + 1] -= 1\n else:\n print('NO')\n exit()\n\nprint('YES')\nfor i in range(N):\n print(letters[choices[i]])\n \t \t \t \t\t\t\t\t\t\t\t \t\t \t\t", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\r\n# n,m=map(int,input().split())\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n \r\ndef main():\r\n dic={'S':'0','M':'1','L':'2','XL':'3','XXL':'4','XXXL':'5'}\r\n arr=list(map(int, input().split()))\r\n n=int(input())\r\n lis=[0]*n\r\n for i in range(n):\r\n s=strinp(90).split(',')\r\n if(len(s)==1):\r\n lis[i]=[dic[s[0]],i]\r\n else:\r\n lis[i]=[dic[s[0]]+dic[s[1]],i]\r\n lis.sort()\r\n trig=False\r\n ans=[0]*n\r\n for i in range(n):\r\n no=lis[i][1]\r\n req=lis[i][0]\r\n a=int(req[0])\r\n b=int(req[-1])\r\n if(arr[a]!=0):\r\n ans[no]=a\r\n arr[a]-=1\r\n elif(a!=b and arr[b]!=0):\r\n ans[no]=b\r\n arr[b]-=1\r\n else:\r\n trig=True\r\n break\r\n if(trig):\r\n print('NO')\r\n return()\r\n dic={0:'S',1:'M',2:'L',3:'XL',4:'XXL',5:'XXXL'}\r\n print('YES')\r\n for i in range(n):\r\n print(dic[ans[i]])\r\n\r\nmain()" ]

[ "m = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nwd = ['monday', 'tuesday', 'wednesday', \"thursday\", \"friday\", \"saturday\", \"sunday\"]\na, b = [wd.index(input()) for i in range(2)]\nfor i in range(7):\n cur = i\n for j in range(11):\n nxt = (cur + m[j]) % 7\n if cur == a and nxt == b:\n print('YES')\n exit(0)\n cur = nxt\nprint('NO')", "days = \"monday tuesday wednesday thursday friday saturday sunday\".split()\r\n\r\noffs = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nd1 = days.index(input())\r\nd2 = days.index(input())\r\n\r\nfor o in offs:\r\n if (d1 + o) % 7 == d2:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "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 week = [ \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n s1 = input()\r\n s2 = input()\r\n if (week.index(s2) - week.index(s1) + 7) % 7 in [0, 2, 3]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\n\r\nd = dict()\r\n\r\nd['monday'] = 1\r\nd['tuesday'] = 2\r\nd['wednesday'] = 3\r\nd['thursday'] = 4\r\nd['friday'] = 5\r\nd['saturday'] = 6\r\nd['sunday'] = 0\r\n\r\nif (d[s1] + 31 % 7) % 7 == d[s2] or (d[s1] + 30 % 7) % 7 == d[s2] or (d[s1] + 28 % 7) % 7 == d[s2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "days = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\nmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nday1 = input()\r\nday2 = input()\r\n\r\nd1 = days.index(day1)\r\nd2 = days.index(day2)\r\n\r\ndiff = d2 - d1\r\nif diff < 0:\r\n diff += 7\r\n\r\nans = \"NO\"\r\nfor month in months:\r\n if month % 7 == diff:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)\r\n", "from sys import stdin, stdout\ncin = stdin.readline\ncout = stdout.write\nmp = lambda:list(map(int, cin().split()))\n\nf = cin()[:-1]\ns = cin()[:-1]\n\nd = {'saturday': 1, 'sunday': 2, 'monday': 3, 'tuesday': 4, 'wednesday': 5, 'thursday': 6, 'friday': 7}\nl = [0,2,3]\ny = (d[f] > d[s])*(d[s]-d[f])%7 + (d[f]<d[s])*(d[s]-d[f])\nif y in l:\n\tcout('YES')\nelse:\n\tcout('NO')\n\t\t\t \t\t \t \t \t \t\t \t\t \t \t", "day=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\na=day.index(str(input()))\r\nb=day.index(str(input()))\r\nans=\"NO\"\r\nif (b-a)%7 in [3,0,2]:\r\n ans=\"YES\"\r\nprint(ans)", "l=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nx=input()\r\ny=input()\r\nf=[]\r\nfor n in [28,30,31]:\r\n d=n%7\r\n f.append(d)\r\nc=l.index(x)\r\nv=l.index(y)\r\nfor i in range(3):\r\n f[i]+=c\r\n f[i]=f[i]%7\r\nif v in f :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "day1 = input()\r\nday2 = input()\r\nvalues = {\"sunday\" : 1, \"monday\" : 2, \"tuesday\" : 3, \"wednesday\" : 4, \"thursday\" : 5, \"friday\" : 6, \"saturday\" : 7}\r\nif(values[day1] == values[day2]):\r\n print(\"YES\")\r\nelif(values[day2]-values[day1] == 3) or (7+values[day2]-values[day1] == 3):\r\n print(\"YES\")\r\nelif(values[day2]-values[day1] == 2) or (7+values[day2]-values[day1] == 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "weekday = {\"monday\" : 1,\n \"tuesday\" : 2,\n \"wednesday\" : 3,\n \"thursday\" : 4,\n \"friday\" : 5,\n \"saturday\" : 6,\n \"sunday\" : 7\n }\n\nday1 = weekday[input()]\nday2 = weekday[input()]\n\ndelt = (day2 - day1 + 7) %7\nif delt == 0 or delt == 2 or delt == 3:\n print('YES')\nelse:\n print('NO')\n\t \t\t \t\t\t \t\t\t \t \t \t\t\t \t\t", "D = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nweek = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nweek += week\r\nY1 = input()\r\nY2 = input()\r\ns, t = -1, -1\r\nfor i in range(7):\r\n if Y1 == week[i]:\r\n s = i\r\n\r\nfor i in range(s, 14):\r\n if Y2 == week[i]:\r\n t = i\r\n\r\nd = (t - s) % 7\r\nfor i in range(11):\r\n if D[i] % 7 == d:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n\r\n\r\n", "s1=input()\r\ns2=input()\r\nif s1==s2:\r\n print(\"YES\")\r\nelse:\r\n d={\"monday\":1,\"tuesday\":2,\"wednesday\":3,\"thursday\":4,\"friday\":5,\"saturday\":6,\"sunday\":7}\r\n if d[s2]>d[s1]:\r\n x=d[s2]-d[s1]\r\n else:\r\n x=7-d[s1]+d[s2]\r\n # print(d[s1],d[s2],x)\r\n if x==2 or x==3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "MONTH_LENGTHS = [28, 30, 31]\r\n\r\nDAYS = {\r\n 'monday': 0,\r\n 'tuesday': 1,\r\n 'wednesday': 2,\r\n 'thursday': 3,\r\n 'friday': 4,\r\n 'saturday': 5,\r\n 'sunday': 6,\r\n}\r\n\r\nstart_day_current = input()\r\nstart_day_next = input()\r\n\r\nstart_day_current_index = DAYS[start_day_current]\r\nstart_day_next_index = DAYS[start_day_next]\r\n\r\nfor length in MONTH_LENGTHS:\r\n if (start_day_current_index + length) % 7 == start_day_next_index:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "week = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\na, b = input(), input()\r\ntmp = [0, 2, 3] # [28, 30, 31]\r\nx = week.index(b) - week.index(a)\r\nif x % 7 in tmp:\r\n print('yes')\r\nelse:\r\n print('no')\r\n# FMZJMSOMPMSL\r\n", "def check(days,start,end):\r\n total = 0\r\n while total < days:\r\n start += 1\r\n if start == 7:\r\n start = 0\r\n total += 1\r\n #print(start,total)\r\n #print(total,start,end)\r\n if start == end:\r\n return True\r\n\r\n return False\r\n\r\ndef main1():\r\n days = {}\r\n days['monday'] = 0\r\n days['tuesday'] = 1\r\n days['wednesday'] = 2\r\n days['thursday'] = 3\r\n days['friday'] = 4\r\n days['saturday'] = 5\r\n days['sunday'] = 6\r\n n1 = days[input()]\r\n n2 = days[input()]\r\n\r\n if check(30,n1,n2) or check(31,n1,n2) or check(28,n1,n2):\r\n print('YES')\r\n return\r\n print('NO')\r\n \r\n\r\nmain1()", "one = input()\r\ntwo = input()\r\n\r\ndays = {el: i for i, el in enumerate(('monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday'), 1)}\r\n\r\ndelta = (days[two] - days[one]) % 7\r\n\r\nprint(('NO', 'YES')[delta in {0, 2, 3}])\r\n", "from calendar import day_name\r\n\r\nDAY_NAME = list(day_name)\r\n\r\nf = lambda: DAY_NAME.index(input().title())\r\n\r\nprint('YES' if (f()-f())%7 in (0,4,5) else 'NO')", "# LUOGU_RID: 113692970\na={'monday':1,'tuesday':2,'wednesday':3,'thursday':4,'friday':5,'saturday':6,'sunday':7}\r\nx=a[input()]\r\ny=a[input()]\r\nif (y+7-x)%7==0 or (y+7-x)%7==2 or(y+7-x)%7==3:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\nn1 = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"].index(s1)\r\nn2 = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"].index(s2)\r\nif n1 == n2:\r\n print(\"YES\")\r\nelse:\r\n if (n2 - n1 + 7) % 7 in [2, 3]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\nl=['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\r\nx1,x2=l.index(s1),l.index(s2)\r\nxx=x2-x1\r\nif xx<0: xx+=7\r\nif xx==0 or xx==2 or xx==3: print(\"YES\")\r\nelse: print(\"NO\")", "s = str(input())\r\nt = str(input())\r\n\r\nd = {'monday': 0, 'tuesday':1, 'wednesday':2, 'thursday':3, 'friday':4, 'saturday':5, 'sunday':6}\r\n\r\ns = d[s]\r\nt = d[t]\r\n\r\nif (t-s)%7 == 2 or (t-s)%7 == 3 or (t-s)%7 == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "m = [3,0,2]\r\n\r\na = input()\r\nb = input()\r\n\r\nmonth = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\nif (month.index(b) - month.index(a)) % 7 in m:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=['su','mo','tu','we','th','fr','sa']\n \nb=a.index(input()[:2])\n \nc=a.index(input()[:2])\n \nprint('YES'if (c-b)%7 in[0,2,3]else'NO')\n\n# class Node:\n# def __init__(self, v):\n# self.data = v\n# self.next=self.prev=None\n\n\n# class DLL:\n# def __init__(self):\n# self.head = None\n# self.tail = None\n\n\n# def DelLargest(self):\n# head = self.head\n# largest = self.head.data\n# while head is not None:\n# if head.", "s1=input()\r\ns2=input()\r\na=['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\r\npos1,pos2=a.index(s1),a.index(s2)\r\nif pos1==pos2:\r\n print('YES')\r\nelif pos1<pos2:\r\n if pos2-pos1==3 or pos2-pos1==2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if pos1-pos2==4 or pos1-pos2==5:\r\n print('YES')\r\n else:\r\n print('NO')", "days = [28, 30, 31]\nweek = ['monday',\n 'tuesday',\n 'wednesday',\n 'thursday',\n 'friday',\n 'saturday',\n 'sunday']\n\na = input()\nb = input()\n\nfor index, name in enumerate(week):\n if name == a:\n ind = index\n\nflag = False\nfor mo in days:\n if week[(ind + mo) % 7] == b:\n flag = True\nif flag:\n print('YES')\nelse:\n print('NO')\n", "arr = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"] * 2\r\n\r\na = input()\r\nb = input()\r\n\r\nif (a == b):\r\n print(\"YES\")\r\nelse:\r\n pos1, pos2 = None, None\r\n\r\n for i in range(14):\r\n if (arr[i] == a):\r\n pos1 = i\r\n break\r\n \r\n for i in range(i+1, 14):\r\n if (arr[i] == b):\r\n pos2 = i\r\n break\r\n \r\n if ((pos2 - pos1) in (2, 3)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n n = str(input())\r\n b = ('monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday')\r\n n = b.index(n)\r\n v = str(input())\r\n print('YES' if v in (b[n], b[(n + 2) % 7], b[(n + 3) % 7]) else 'NO')\r\n", "days = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\na = days.index(input())\r\nb = days.index(input())\r\n\r\nif b in [a, a+2, a+3, a-4, a-5]: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "a=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nd1=a.index(input())\r\nd2=a.index(input())\r\ncnt=0\r\nwhile(d1!=d2):\r\n d1+=1;d1%=7;cnt+=1\r\nprint((\"YES\") if ((cnt==0) or (cnt==2) or (cnt==3)) else (\"NO\"))", "# LUOGU_RID: 101647072\na = {'monday': 0, 'tuesday': 1, 'wednesday': 2, 'thursday': 3, 'friday': 4, 'saturday': 5, 'sunday': 6}\r\ns, t = input(), input()\r\nx = a[s]\r\ny = a[t]\r\nprint((y - x) % 7 in [0, 2, 3] and 'YES' or 'NO')", "from math import fabs\na = input()\nb = input()\nif (a==\"monday\"):\n a = 1\nelif (a==\"tuesday\"):\n a = 2\nelif (a==\"wednesday\"):\n a = 3\nelif (a==\"thursday\"):\n a = 4\nelif (a==\"friday\"):\n a = 5\nelif (a==\"saturday\"):\n a = 6\nelse:\n a = 7\nif (b==\"monday\"):\n b = 1\nelif (b==\"tuesday\"):\n b = 2\nelif (b==\"wednesday\"):\n b = 3\nelif (b==\"thursday\"):\n b = 4\nelif (b==\"friday\"):\n b = 5\nelif (b==\"saturday\"):\n b = 6\nelse:\n b = 7\ns = a - b\nif (s==0 or s==4 or s==-3 or s==-2 or s==5):\n print(\"YES\")\nelse:\n print(\"NO\")", "names = {\"monday\":0, \"tuesday\":1, \"wednesday\":2, \"thursday\":3, \"friday\":4, \"saturday\":5, \"sunday\":6,}\n\na = names[input().strip()]\nb = names[input().strip()]\n\nif (a == b) or ((a + 2) % 7 == b) or ((a + 3) % 7 == b):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n", "w=[\"mo\",\"tu\",\"we\",\"th\",\"fr\",\"sa\",\"su\"]\r\nexec('a,b=['+2*'w.index(input()[:2]),'+']')\r\nprint('YNEOS'[all((a+x)%7!=b for x in[0,2,3])::2])\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na = input().rstrip().decode()\r\nb = input().rstrip().decode()\r\nx = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nu, v = x.index(a), x.index(b)\r\nans = \"NO\"\r\nfor i in [28, 30, 31]:\r\n if (u + i) % 7 == v:\r\n ans = \"YES\"\r\n break\r\nprint(ans)", "a=input()\r\nb=input()\r\nd={\"monday\":0, \"tuesday\":1,\r\n \"wednesday\":2, \"thursday\":3,\r\n \"friday\":4,\"saturday\":5,\r\n \"sunday\":6}\r\n \r\nif d[a]==d[b] or (d[a]+2)%7==d[b] or (d[a]+3)%7==d[b]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nl = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\ns = input()[:-1]\r\nw = input()[:-1]\r\na = l.index(w) - l.index(s)\r\nif a < 0:\r\n a += 7\r\nif a in [0, 2, 3]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f = input()\r\ns = input()\r\n\r\ndef strToDay(s):\r\n\tif s == 'monday':\r\n\t\treturn 1\r\n\telif s == 'tuesday':\r\n\t\treturn 2\r\n\telif s == 'wednesday':\r\n\t\treturn 3\r\n\telif s == 'thursday':\r\n\t\treturn 4\r\n\telif s == 'friday':\r\n\t\treturn 5\r\n\telif s == 'saturday':\r\n\t\treturn 6\r\n\telse:\r\n\t\treturn 7\r\n\r\ndef dayPlusN(t, n):\r\n\tfor i in range(n):\r\n\t\tt += 1\r\n\t\tif t == 8:\r\n\t\t\tt = 1\r\n\treturn t\r\n\r\nff = strToDay(f)\r\nss = strToDay(s)\r\n\r\nif ff == ss:\r\n\tprint('YES')\r\nelif ff < ss and (ff + 2 == ss or ff + 3 == ss):\r\n\tprint('YES')\r\nelif ff > ss and (dayPlusN(ff, 2) == ss or dayPlusN(ff, 3) == ss):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "\r\ndias_mes = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ndias = ['monday','tuesday','wednesday','thursday',\r\n 'friday','saturday','sunday']\r\n\r\ncadena_dia_1 = input() \r\ncadena_dia_2 = input()\r\n\r\nfor i in range(7):\r\n if cadena_dia_1 == dias[i]:\r\n dia1 = i\r\n if cadena_dia_2 == dias[i]:\r\n dia2 = i\r\n\r\nanio = 2010\r\nencontrado = False\r\n\r\ndia_mes_1 = 4\r\nwhile anio < 2020 and not(encontrado):\r\n mes = 0\r\n while mes < 11:\r\n dia_mes_2 = (dia_mes_1 + dias_mes[mes]) % 7\r\n if dia_mes_1 == dia1 and dia_mes_2 == dia2:\r\n encontrado = True\r\n break\r\n else:\r\n dia_mes_1 = dia_mes_2 \r\n mes = mes+1\r\n \r\n dia_mes_1 = dia_mes_2 \r\n anio = anio+1\r\n if anio % 4 == 0:\r\n anio = anio + 1\r\n \r\nif encontrado:\r\n print('YES')\r\nelse:\r\n print('NO')", "m = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\nd2 = m.index(input())\r\nd1 = m.index(input())\r\n\r\nif d1 >= d2:\r\n if d1 - d2 == 0 or d1 - d2 == 3 or d1 - d2 == 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if d2 - d1 == 4 or d2 - d1 == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") ", "\ndays = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\n\na = days.index(input())\nb = days.index(input())\n\ntemp = b - a\nif temp < 0:\n temp += 7\nif temp == 0 or temp == 2 or temp == 3:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t\t \t\t\t \t\t\t\t \t \t \t\t", "d1 = input()\r\nd2 = input()\r\nd = {\"monday\" : 0, \"tuesday\" : 1, \"wednesday\" : 2, \"thursday\" : 3, \"friday\" : 4, \"saturday\" : 5, \"sunday\" : 6}\r\nd1 = d[d1]\r\nd2 = d[d2]\r\nif (d1 + 28) % 7 == d2:\r\n print(\"YES\")\r\nelif (d1 + 30) % 7 == d2:\r\n print(\"YES\")\r\nelif (d1 + 31) % 7 == d2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n a = input().strip()\r\n b = input().strip()\r\n q = [28, 30, 31]\r\n days = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\n f = False\r\n for x in q:\r\n if (days.index(a) + x) % 7 == days.index(b):\r\n f = True\r\n break\r\n if f:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nmain()", "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\ndays = {1:\"monday\", 2:\"tuesday\", 3:\"wednesday\", 4:\"thursday\", 5:\"friday\", 6:\"saturday\", 0:\"sunday\"}\r\n\r\nmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\npre_sum = []\r\n\r\nfor i in range(12):\r\n if not pre_sum:\r\n pre_sum.append(months[i])\r\n else:\r\n pre_sum.append(pre_sum[-1] + months[i])\r\n\r\nans = []\r\ntemp = \"\"\r\nfor i in range(7):\r\n for num in pre_sum:\r\n num += i\r\n temp += days[num%7]\r\n ans.append(temp)\r\n\r\ns1 = input()\r\ns2 = input()\r\nss = s1+s2\r\nfor row in ans:\r\n if ss in row:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n\r\n", "days = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nd1, d2 = input(), input()\r\nif (days.index(d2) + 7 - days.index(d1)) % 7 in [0, 2, 3]:\r\n print('YES')\r\nelse:\r\n print('NO')", "days = 'monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday'\r\n\r\na = days.index(input())\r\nb = days.index(input())\r\n\r\nif b in (a, (a+2) % len(days), (a+3) % len(days)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\n\r\n\r\n\r\n\r\nt =[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\nf=[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\n\r\na = input()\r\nb = input()\r\nx=0\r\nfor k in range(len(f)-1):\r\n h = f[k]%7\r\n\r\n g = (t.index(a)+h)%7\r\n if t[g]==b:\r\n print('YES')\r\n x+=1\r\n break\r\n\r\n\r\nif x==0:\r\n print('NO')\r\n", "t = {'monday' : 0, 'tuesday' : 1, 'wednesday' : 2, 'thursday' : 3, 'friday' : 4, 'saturday' : 5, 'sunday' : 6}\na = t[input()]\nb = t[input()]\n\nif a == b or (a + 3) % 7 == b or (a + 2) % 7 == b:\n print('YES')\nelse:\n print('NO')\n\n", "ind=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\nd1=ind.index(input())\r\nd2=ind.index(input())\r\nd2+=7\r\ndiff=(d2-d1)%7\r\nif((diff)==0 or (diff)==2 or (diff)==3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "week = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\ndays = [31, 28, 31, 30, 31]\n\nm1 = week.index(input())\nm2 = week.index(input())\n\nb = False\nfor i in days:\n if (m1+i)%7 == m2:\n b = True\n break\n\nif b:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s = input()\ns1 = input()\ndef getnum(s):\n if s == \"monday\":\n return 0\n elif s == \"tuesday\":\n return 1\n elif s == \"wednesday\":\n return 2\n elif s == \"thursday\":\n return 3\n elif s == \"friday\":\n return 4\n elif s == \"saturday\":\n return 5\n else:\n return 6\nn = getnum(s)\nn1 = getnum(s1)\na = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nfor i in range(10):\n if (n + a[i]) % 7 == n1:\n print(\"YES\")\n exit(0)\nprint(\"NO\")", "def compute_possible(day1, day2, month):\r\n num_days = days_per_month[month]\r\n val = ((num_days % 7) + day1)\r\n if val > 7:\r\n next_month_start_day = val - 7\r\n else:\r\n next_month_start_day = val\r\n return next_month_start_day == day2\r\n\r\n\r\nif __name__ == '__main__':\r\n days_per_month = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n days_of_the_week = {\r\n 'monday': 1,\r\n 'tuesday': 2,\r\n 'wednesday': 3,\r\n 'thursday': 4,\r\n 'friday': 5,\r\n 'saturday': 6,\r\n 'sunday': 7\r\n }\r\n first_day = str(input())\r\n second_day = str(input())\r\n first_day_num = days_of_the_week[first_day]\r\n second_day_num = days_of_the_week[second_day]\r\n ans = \"NO\"\r\n for m in range(11):\r\n if compute_possible(first_day_num, second_day_num, m):\r\n ans = \"YES\"\r\n print(ans)\r\n", "import sys,io,math\r\nfrom tokenize import Triple\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\ndays=[28,30,31]\r\nweek=['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\r\n\r\n \r\na = IS()\r\nb = IS()\r\n \r\nfor index, name in enumerate(week):\r\n if name == a:\r\n ind = index\r\n \r\nflag = False\r\nfor mo in days:\r\n if week[(ind + mo) % 7] == b:\r\n flag = True\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nt = input()\r\nx = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nss = x.index(s)\r\ntt = x.index(t)\r\nif s == t:\r\n\tprint (\"YES\")\r\n\texit()\r\n\r\nif tt-ss == 2 or tt-ss == 3:\r\n\tprint (\"YES\")\r\nelif tt-ss+7 == 2 or tt-ss+7 == 3:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "map={\r\n \"monday\":1,\r\n \"tuesday\":2,\r\n \"wednesday\":3,\r\n \"thursday\":4,\r\n \"friday\":5,\r\n \"saturday\":6,\r\n \"sunday\":7\r\n}\r\na=input()\r\nb=input()\r\n\r\na_int=map.get(a)\r\nb_int=map.get(b)\r\n\r\nif(a_int==b_int):\r\n print(\"YES\")\r\nelif(b_int-a_int==3 or b_int+7-a_int==3):\r\n print(\"YES\")\r\nelif (b_int-a_int==2 or b_int+7-a_int==2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "v =[ \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\na = input()\r\nb = input()\r\nq = v.index(a)\r\nf =0\r\nz =[q,q+3,q+2]\r\nfor i in z:\r\n\tif v[i%7]\t== b:\r\n\t\tf=1\r\nif f ==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "a = input()\r\nb = input()\r\ndic = {\"sunday\":0, \"monday\":1, \"tuesday\":2, \"wednesday\":3, \"thursday\":4, \"friday\":5, \"saturday\":6}\r\nc = dic[b]-dic[a]\r\nif(dic[b]<dic[a]):\r\n c+=7\r\nif(c==0 or c==2 or c==3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "FirstDay = input()\r\nSecondDay = input()\r\nWeekDay = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\nNumOfFirstDay = WeekDay.index(FirstDay)\r\nNumOfSecondDay = WeekDay.index(SecondDay)\r\nNumOfMonth = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nCur = NumOfFirstDay\r\nflag=False\r\nfor k in range(7):\r\n if flag:\r\n break\r\n for i in range(12):\r\n Cur = NumOfFirstDay\r\n NumOfFirstDay+=int(NumOfMonth[i])%7\r\n NumOfFirstDay%=7\r\n if Cur==WeekDay.index(FirstDay) and NumOfFirstDay==NumOfSecondDay:\r\n print('YES')\r\n flag=True\r\n break\r\nelse:\r\n print('NO')\r\n \r\n", "array = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\", \"monday\", \"tuesday\", \"wednesday\"]\r\nx = input()\r\ny = input()\r\nif x == y:\r\n print(\"YES\")\r\nelse:\r\n for i in range(len(array)):\r\n try:\r\n if x == array[i] and y == array[i+2]:\r\n print(\"YES\")\r\n break\r\n elif x == array[i] and y == array[i+3]:\r\n print(\"YES\")\r\n break\r\n except: pass\r\n else:\r\n print(\"NO\")", "#!/usr/bin/env python3\r\n\r\n\r\ndef main():\r\n days = [\"sunday\", \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\"]\r\n try:\r\n while True:\r\n a = days.index(input())\r\n b = days.index(input())\r\n print(\"YES\" if (b - a) % 7 in (0, 2, 3) else \"NO\")\r\n\r\n except EOFError:\r\n pass\r\n\r\n\r\nmain()\r\n", "days_in_months = [31,28,30]\r\n\r\ndays = [\r\n \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"\r\n]\r\n\r\na = input()\r\nb = input()\r\n\r\nptr1 = days.index(a)\r\nptr2 = days.index(b)\r\n\r\npossible = False\r\n\r\nfor i in days_in_months:\r\n k = (ptr1 + i) % 7\r\n\r\n if k == ptr2:\r\n possible = True\r\n break\r\n\r\nif possible:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\na = l.index(input())\r\nb = (l.index(input())-a+7)%7\r\nif b == 0 or b == 2 or b == 3:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n\r\n", "monthlist=[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ndaylist={\"monday\":0, \"tuesday\":1, \"wednesday\":2, \"thursday\":3, \"friday\":4, \"saturday\":5, \"sunday\":6}\r\ns1=daylist[input().strip()]\r\ns2=daylist[input().strip()]\r\nflag=0\r\nfor i in range(11):\r\n\tif((monthlist[i]+s1)%7==s2):\r\n\t\tprint(\"YES\")\r\n\t\tflag=1\r\n\t\tbreak\r\nif(flag==0):\r\n\tprint(\"NO\")", "day_name=dict()\nday_name['monday'] = 1\nday_name['tuesday'] = 2\nday_name['wednesday'] = 3\nday_name['thursday'] = 4\nday_name['friday'] = 5\nday_name['saturday'] = 6\nday_name['sunday'] = 7\n\nday1 = input()\nday2 = input()\n\ndays_in_months = [31,28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nday_gap = (day_name[day2] - day_name[day1]) % 7\n\nfor i in days_in_months:\n\tif i % 7 == day_gap:\n\t\tprint('YES')\n\t\texit()\n\nprint('NO')\n", "a=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nb=a.index(input())\r\nc=a.index(input())\r\nprint(\"Yes\" if b-c in [0,-2,-3,5,4] else \"NO\")", "first = input()\nsecond = input()\n\narr = ['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\ndays_of_year = [32, 29, 32, 31, 32, 31, 32, 32, 31, 32, 31, 32]\ndayArr = []\n\norderFirst = 0\norderSecond = 0\n\nfor i in range(len(arr)):\n if arr[i] == first:\n orderFirst = i\n if arr[i] == second:\n orderSecond = i \n\nfor j in range(len(days_of_year)):\n x = orderFirst\n for z in range(days_of_year[j]):\n dayArr.append(x % 7)\n x += 1\n\n if dayArr[0] == orderFirst and dayArr[len(dayArr)-1] == orderSecond:\n print(\"YES\")\n exit()\n\n dayArr = []\n\nprint(\"NO\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\ndef solve():\n first = input()\n second = input()\n \n days = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n names = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\n \n for offset in range(7):\n cnt = offset\n records = [ names[cnt] ]\n for m in range(11):\n cnt += days[m]\n records.append( names[cnt % 7] )\n if records[-2:] == [first,second]:\n return \"YES\"\n return \"NO\"\n\nprint(solve())\n \n \n", "f = input()\r\ns = input()\r\nl = ['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\r\nind_f = l.index(f)\r\nind_s = l.index(s)\r\nif ind_f > ind_s:\r\n gap = 7 - ind_f + ind_s\r\nelse:\r\n gap = ind_s - ind_f\r\n\r\nif gap in (0,2,3):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\n first_day = input()\n second_day = input()\n days = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\n first = days.index(first_day)\n possibles = [\n days[first],\n days[first + 2 if first < 5 else first - 5],\n days[first + 3 if first < 4 else first - 4],\n ]\n\n print('YES' if second_day in possibles else 'NO')\n\n\nif __name__ == '__main__':\n main()\n", "day1 = input()\r\nday2 = input()\r\n\r\ndm = {\r\n 'monday': 1,\r\n 'tuesday': 2,\r\n 'wednesday': 3,\r\n 'thursday': 4,\r\n 'friday': 5,\r\n 'saturday': 6,\r\n 'sunday': 7\r\n}\r\n\r\ndf = dm[day2] - dm[day1]\r\n\r\nif any((d - df) % 7 == 0 for d in [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "first_day = input()\r\nsecond_day = input()\r\ndays_name = [\"monday\",\"tuesday\",\"wednesday\",\"thursday\",\"friday\",\"saturday\",\"sunday\"]\r\nfirst_day_number = days_name.index(first_day)\r\nsecond_day_number = days_name.index(second_day)\r\ndays_number = [28,30,31]\r\nfor number in days_number:\r\n if (number-28+first_day_number)%7 == second_day_number:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "a1 = str(input())\r\na2 = str(input())\r\nl = [\"monday\",\"tuesday\",\"wednesday\",\"thursday\",\"friday\",\"saturday\",\"sunday\"]\r\n\r\nind = l.index(a1)\r\nif a2 in [l[ind],l[(ind+3)%7],l[(ind+2)%7]]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "day_names = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\ndays = {day_names[i]: i for i in range(len(day_names))}\r\nfirst = days[input().strip()]\r\nsecond = days[input().strip()]\r\ncal = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nyup = 'NO'\r\nfor month in range(len(cal) - 1):\r\n\tif (cal[month] + first) % 7 == second:\r\n\t\tyup = 'YES'\r\nprint (yup)", "lookup = {\n \"monday\": 0,\n \"tuesday\": 1,\n \"wednesday\": 2,\n \"thursday\": 3,\n \"friday\": 4,\n \"saturday\": 5,\n \"sunday\": 6\n}\n\nd1 = lookup[input()]\nd2 = lookup[input()]\n\ndiffs = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\nfor i in range(len(diffs)):\n if (d1 + diffs[i]) % 7 == d2:\n print('YES')\n exit(0)\nprint('NO')\nexit(0)\n", "days = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\nmonths = [[31, 28], [28, 31], [31, 30], [30, 31], [31, 31]]\r\n\r\nday1, day2 = days.index(input()), days.index(input())\r\nres = 'NO'\r\n\r\nfor ms in months:\r\n\tif (day1 + ms[0] % 7) % 7 == day2:\r\n\t\tres = 'YES'\r\n\t\tbreak\r\n\r\nprint(res)\r\n", "months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nweekday1 = input()\nweekday2 = input()\n\ndays = {\n 'monday': 0,\n 'tuesday': 1,\n 'wednesday': 2,\n 'thursday': 3,\n 'friday': 4,\n 'saturday': 5,\n 'sunday': 6\n}\n\ndef main():\n for mon in months[:-1]:\n if (mon + days[weekday1]) % 7 == days[weekday2]:\n print(\"YES\")\n return\n print(\"NO\")\n return\n \nmain()", "days = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nmonLens = [i % 7 for i in [28, 30, 31]]\r\ndaysDiff = - (days.index(input()) - days.index(input())) % 7\r\nif daysDiff in monLens:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\ndays = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\ndef gi(s):\r\n\tfor i in range(len(days)):\r\n\t\tif days[i] == s:\r\n\t\t\treturn i\r\n\r\ndef solve():\r\n\tstart = input()\r\n\tend = input()\r\n\tfor i in range(len(l) - 1):\r\n\t\tf = l[i]\r\n\t\tdiff = f % 7\r\n\t\tstarti = gi(start)\r\n\t\tif days[(starti + diff) % 7] == end:\r\n\t\t\treturn True\r\n\treturn False\r\n\r\n\r\n\r\nres = solve()\r\nprint(\"YES\" if res else \"NO\")", "one = input()\r\ntwo = input()\r\n\r\nt = {\"monday\": 0,\r\n \"tuesday\": 1,\r\n \"wednesday\": 2,\r\n \"thursday\": 3,\r\n \"friday\": 4,\r\n \"saturday\": 5,\r\n \"sunday\": 6,\r\n }\r\n\r\nif (t[two] - t[one])%7 in [3,2,0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "days = set([31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31])\nweek = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\n\nd1 = week.index(input())\nd2 = week.index(input())\n\nfound = False\nfor d in days:\n if (d1 - d2 + d) % len(week) == 0:\n found = True\n break\nif found:\n print('YES')\nelse:\n print('NO')", "s = input()\r\nt = input()\r\nd = {\"monday\": 1, \"tuesday\": 2, \"wednesday\": 3, \"thursday\": 4, \"friday\": 5, \"saturday\": 6, \"sunday\": 7}\r\na = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nfor i in range(0, 11):\r\n if a[i] % 7 == (7 - d[s] + d[t]) % 7:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "a=[\"monday\",\"tuesday\",\"wednesday\",\"thursday\",\"friday\",\"saturday\",\"sunday\"]\r\ns=input()\r\ns1=input()\r\nx=a.index(s)\r\ny=a.index(s1)\r\nif(y-x)%7 in [0,-3,3,2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nm1 = a.index(input())\r\nm2 = a.index(input())\r\nif (m2 - m1)%7 in [0,2,3] :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "day = (\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\")\r\na = input()\r\nb = input()\r\ni = day.index(a)\r\nif day[i] == b or day[(i + 2) % 7] == b or day[(i + 3) % 7] == b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "d = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\n\r\na, b = input(), input()\r\nx, y = d.index(a), d.index(b)\r\n\r\nif (y - x) % 7 in {0, 2, 3}:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\nimport time\r\nimport itertools\r\nimport math\r\n\r\ndef inp():\r\n ln = input().split()\r\n return int(ln[0]) if len(ln) == 1 else [int(i) for i in ln]\r\n\r\ndef prl(x):\r\n print(' '.join([str(i) for i in x]))\r\n\r\n# Problem A\r\n\r\nl = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nfirst = input()\r\nsecond = input()\r\nf=l.index(first)\r\ns=l.index(second)\r\nprint(['NO','YES'][((s-f)%7) in [0,2,3]])\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n\r\n\r\n# Problem B\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n\r\n\r\n# Problem C\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n\r\n\r\n# Problem D\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n\r\n\r\n# Problem E\r\n\r\n# testcases = inp()\r\n#\r\n# for testcase in range (testcases):\r\n#\r\n", "day = [-1,\"monday\",\"tuesday\",\"wednesday\",\"thursday\",\"friday\",\"saturday\",\"sunday\"]\r\na,b = day.index(input().strip()),day.index(input().strip())\r\nprint('YES'if((b - a + 7)% 7 in[0,2,3])else'NO')", "days = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\ndic = {d: i + 1 for i, d in enumerate(days)}\n\nA = input()\nB = input()\na = dic[A]\nb = dic[B]\nx = b - a\nif x < 0:\n x += 7\n\nif x == 3 or x == 0 or x == 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "Days = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\nMonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nFirst, Second = input(), input()\r\nfor i in range(len(Months) - 1):\r\n if Days[(Days.index(First) + Months[i]) % 7] == Second:\r\n print(\"YES\")\r\n exit()\r\nprint('NO')\r\n", "week = \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"\na, b = input(), input()\nprint(('NO', 'YES')[any((week.index(a) + i) % 7 == week.index(b) for i in (0, 2, 3))])\n ", "w1 = input()\nw2 = input()\n\n\ndef w_to_num(w):\n to_num = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\n return to_num.index(w)\n\nn1 = w_to_num(w1)\nn2 = w_to_num(w2)\n\nfor m in [28, 30, 31]:\n if (n1 + m) % 7 == n2:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n", "\r\nweekDays=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\",\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\",]\r\ndif=[0,2,3]\r\na=input()\r\nb=input()\r\ndef verif():\r\n for i in dif :\r\n if weekDays[weekDays.index(a)+i] ==b:\r\n print('YES')\r\n return\r\n print('NO')\r\nverif()\r\n", "d = {'monday': 1, 'tuesday': 2, 'wednesday': 3, 'thursday': 4, 'friday': 5, 'saturday': 6, 'sunday': 7}\r\n\r\nfirst = d[input()]\r\nsecond = d[input()]\r\n\r\ncnt = (second + 7 - first) % 7\r\n\r\ns = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30}\r\n\r\nfor v in s:\r\n if v % 7 == cnt:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "a = input()\nb = input()\nD = {'monday': 0, 'tuesday':1, 'wednesday':2, 'thursday':3, 'friday':4, 'saturday':5, 'sunday':6}\nx, y = D[a], D[b]\nif (y - x)%7 == 2 or (y - x)%7 == 3 or (y - x)%7 == 0:\n print('YES')\nelse:\n print('NO')\n", "a=['su','mo','tu','we','th','fr','sa']\r\nb=a.index(input()[:2])\r\nc=a.index(input()[:2])\r\nprint('YES'if (c-b)%7 in[0,2,3]else'NO')", "day_num = {\"monday\":0, \"tuesday\":1, \"wednesday\":2, \"thursday\":3, \"friday\":4,\n \"saturday\":5, \"sunday\":6}\n\nd1 = input()\nd2 = input()\n\nday_diff = 0\nif day_num[d1] > day_num[d2]:\n day_diff = 7 - day_num[d1] + day_num[d2]\nelse:\n day_diff = day_num[d2] - day_num[d1]\n\n#print(day_diff)\n\nres = \"NO\"\nif day_diff == 3:\n res = \"YES\"\nif day_diff == 2: \n res = \"YES\"\nif day_diff == 0:\n res = \"YES\" \n\nprint(res)\n", "\r\na=['su','mo','tu','we','th','fr','sa']\r\nb=a.index(input()[:2])\r\nc=a.index(input()[:2])\r\nif (c-b)%7 in [0,2,3]:print('YES')\r\nelse:print('NO')", "days_name = [\"monday\",\"tuesday\",\"wednesday\",\"thursday\",\"friday\",\"saturday\",\"sunday\"]\r\nfirst_day_number = days_name.index(input())\r\nsecond_day_number = days_name.index(input())\r\nfor number in [28,30,31]:\r\n if (number+first_day_number-28)%7 == second_day_number:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nM='mo','tu','we','th','fr','sa','su'\nn=(M.index(input()[:2])-M.index(input()[:2]))%len(M)\nprint('YES'if 1>n or 3<n<6 else'NO')\n", "s1=input()\r\ns2=input()\r\nweek=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nif week[(week.index(s1)+31)%7]==s2:print(\"YES\")\r\nelif week[(week.index(s1)+28)%7]==s2:print(\"YES\")\r\nelif week[(week.index(s1)+30)%7]==s2:print(\"YES\")\r\nelse:print(\"NO\")", "\nInput=lambda:map(int,input().split())\n\ndays = ['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\n\na = input()\nb = input()\nif a == b: #28\n print(\"YES\")\n exit()\n\n# 31\ny = days.index(a)\ny = (y+3)%7\nif b == days[y]:\n print(\"YES\")\n exit()\n# 30\ny = days.index(a)\ny = (y+2)%7\nprint(\"YES\" if b == days[y] else \"NO\")", "f = input()\r\ns = input()\r\nday = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\", \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\"]\r\nlength = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nfor i in range(11):\r\n if day[(day.index(f) + length[i]) % 7] == s:\r\n print('YES')\r\n exit()\r\nprint('NO')", "s1 = input()\r\ns2 = input()\r\nd = {}\r\nif s1 == 'sunday':\r\n if s2 == 'tuesday' or s2 == 'wednesday' or s2 == 'sunday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nif s1 == 'monday':\r\n if s2 == 'wednesday' or s2 == 'thursday' or s2 == 'monday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nif s1 == 'tuesday':\r\n if s2 == 'thursday' or s2 == 'friday' or s2 == 'tuesday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nif s1 == 'wednesday':\r\n if s2 == 'friday' or s2 == 'saturday' or s2 == 'wednesday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nif s1 == 'thursday':\r\n if s2 == 'saturday' or s2 == 'sunday' or s2 == 'thursday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif s1 == 'friday':\r\n if s2 == 'sunday' or s2 == 'monday' or s2 == 'friday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif s1 == 'saturday':\r\n if s2 == 'monday' or s2 == 'tuesday' or s2 == 'saturday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "# ol = [0, 3, 3, 6, 1, 4, 6, 2, 5, 0, 3, 5]\r\n# dl = [3, 0, 3, 2, 3, 2, 3, 3, 2, 3, 2]\r\nwl = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\n\r\na = wl.index(input())\r\nb = wl.index(input())\r\n\r\nif (b - a) % 7 in (0, 2, 3):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = str(input())\r\nb = str(input())\r\n\r\nk = {'monday':1,'tuesday':2,'wednesday':3,'thursday':4,'friday':5,'saturday':6,'sunday':7}\r\n\r\na=k[a]-1\r\nb=k[b]-1\r\n\r\nres = False\r\nres = res or ((a+2)%7+1)%7==b\r\nres = res or ((a+1)%7+1)%7==b\r\nres = res or ((a+6)%7+1)%7==b\r\nif res:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "dw = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nprint('YES' if (-dw.index(input()) + dw.index(input()) + 7) % 7 in (0, 2, 3) else 'NO')", "def is_possible(first_day, second_day):\r\n days_of_week = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n days_in_months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\n first_day_index = days_of_week.index(first_day)\r\n second_day_index = days_of_week.index(second_day)\r\n\r\n for days in days_in_months:\r\n if days % 7 == (second_day_index - first_day_index + 7) % 7:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\nfirst_day = input()\r\nsecond_day = input()\r\n\r\nresult = is_possible(first_day, second_day)\r\n\r\nprint(result)\r\n", "s1=input()\r\ns2=input()\r\np=dict(zip(['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday'],[1,2,3,4,5,6,7]))\r\na1=int(p[s1])\r\na2=int(p[s2])\r\nif a2<a1:\r\n a2+=7\r\nj=a2-a1\r\nif j==3 or j==2 or j==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\np1,p2=0,0\r\nD=[ \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nd=[31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nfor i in range(7):\r\n if D[i]==a:\r\n p1=i\r\n if D[i]==b:\r\n p2=i\r\nB=False\r\n\r\nfor i in range(len(d)-1):\r\n S=(p1+d[i]%7)%7\r\n \r\n \r\n if S==p2:\r\n B=True\r\n break\r\n\r\nif B:\r\n print(\"YES\")\r\n \r\nif B==False:\r\n print(\"NO\")\r\n", "def checking_the_calendar():\r\n\r\n\tmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\tdays = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\n\r\n\ttext = input()\r\n\ttext += input()\r\n\r\n\tfor i in range(7):\r\n\t\tres = days[i]\r\n\t\tnext_day = i\r\n\t\tfor j in range(11):\r\n\t\t\tnext_day += months[j]\r\n\t\t\tnext_day = next_day % 7\r\n\t\t\tres += days[next_day]\r\n\t\tif text in res:\r\n\t\t\treturn 'YES'\r\n\treturn 'NO'\r\n\r\n\r\nprint(checking_the_calendar())\r\n\r\n", "d = {\"monday\": 0, \"tuesday\": 1, \"wednesday\": 2, \"thursday\": 3, \"friday\": 4, \"saturday\": 5, \"sunday\": 6}\n\n# print(\"Input day 1\")\ndayone = input()\n# print(\"Input day 2\")\ndaytwo = input()\n\noneint = d[dayone]\ntwoint = d[daytwo]\n\nif oneint == twoint:\n print(\"YES\")\nelif (oneint + 2) % 7 == twoint:\n print(\"YES\")\nelif (oneint + 3) % 7 == twoint:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "days=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nli=[[[\"monday\",\"monday\"],[\"monday\",\"wednesday\"],[\"monday\",\"thursday\"]],\r\n [[\"tuesday\",\"tuesday\"],[\"tuesday\",\"thursday\"],[\"tuesday\",\"friday\"]],\r\n [[\"wednesday\",\"wednesday\"],[\"wednesday\",\"friday\"],[\"wednesday\",\"saturday\"]],\r\n [[\"thursday\",\"thursday\"],[\"thursday\",\"saturday\"],[\"thursday\",\"sunday\"]],\r\n [[\"friday\",\"friday\"],[\"friday\",\"sunday\"],[\"friday\",\"monday\"]],\r\n [[\"saturday\",\"saturday\"],[\"saturday\",\"monday\"],[\"saturday\",\"tuesday\"]],\r\n [[\"sunday\",\"sunday\"],[\"sunday\",\"tuesday\"],[\"sunday\",\"wednesday\"]]\r\n ]\r\nd1=input()\r\nd2=input()\r\nind=days.index(d1)\r\nif(li[ind][0][1]==d2 or li[ind][1][1]==d2 or li[ind][2][1]==d2):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\nt = input()\nA = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\nx = A.index(s) + 1\ny = A.index(t) + 1\nsos = [31 % 7, 30 % 7, 28 % 7]\nif (y - x) % 7 in sos:\n print('YES')\nelse:\n print('NO')", "d = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\", \"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nf = str(input())\r\ns = str(input())\r\nx = d.index(f)\r\na = 28%7\r\nb = 30%7\r\nc = 31%7\r\nif d[x+a]==s or d[x+b]==s or d[x+c]==s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Define the days of the week and their order\r\ndays = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nday_order = {day: i for i, day in enumerate(days)}\r\n\r\n# Read the input\r\nday1 = input().strip()\r\nday2 = input().strip()\r\n\r\n# Determine the difference in days between the two input days\r\ndiff = (day_order[day2] - day_order[day1]) % 7\r\n\r\n# Check if there are two consecutive months with the required difference in days\r\nif diff in [0, 2, 3]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b = input(), input()\r\nd = {'monday': 1, 'tuesday': 2, 'wednesday': 3, 'thursday': 4, 'friday': 5, 'saturday': 6, 'sunday': 7}\r\nx, y = d[a], d[b]\r\nflag = (y - x) % 7 in {0, 2, 3}\r\nprint('YES' if flag else 'NO')\r\n", "s1 = input();\r\ns2 = input();\r\n\r\nweekDay = {\r\n\t\"monday\" : 0,\r\n\t\"tuesday\" : 1,\r\n\t\"wednesday\" : 2,\r\n\t\"thursday\" : 3,\r\n\t\"friday\" : 4,\r\n\t\"saturday\" : 5,\r\n\t\"sunday\" : 6\r\n}\r\n\r\nn = weekDay[s1];\r\nm = weekDay[s2];\r\n\r\np = (n+2)%7;\r\nq = (n+3)%7\r\nr = n;\r\n\r\nif p==m or q==m or r==m:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "#!/usr/bin/env python3\ndia_uno= input()\ndia_dos=input()\nif(dia_uno==dia_dos):\n print(\"YES\")\n quit()\ndias=[\"monday\", \"tuesday\", \"wednesday\",\"thursday\", \"friday\", \"saturday\", \"sunday\",\"monday\", \"tuesday\", \"wednesday\"]\nindice= dias.index(dia_uno)\nif (dias[indice+2]==dia_dos or dias[indice+3]==dia_dos):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "cal = {i:j for i, j in zip('monday tuesday wednesday thursday friday saturday sunday'.split(), range(7))}\r\nfst = cal[input()]\r\nsnd = cal[input()]\r\ngre = {0, 2, 3}\r\nprint('YES' if (snd - fst) % 7 in gre else 'NO')", "s=['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\r\nI=input\r\na=I()\r\nprint(['NO','YES'][I()in[s[(s.index(a)+i)%7]for i in (28,30,31)]])", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\ndom = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\nwd = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\n\nday1 = input()\nday2 = input()\n\nday1 = wd.index(day1)\nday2 = wd.index(day2)\n\nfor d in dom[:-2]:\n if (day1 + d )%7 == day2:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "s1 = input()\r\ns2 = input()\r\nindex = 0\r\na = {1:\"monday\", 2:\"tuesday\", 3:\"wednesday\", 4:\"thursday\", 5: \"friday\", 6:\"saturday\", 7:\"sunday\",8:\"monday\", 9:\"tuesday\", 10:\"wednesday\", 11:\"thursday\", 12: \"friday\", 13:\"saturday\", 14:\"sunday\"}\r\nfor i in range(1,15):\r\n if a[i] == s1:\r\n index = i\r\n break\r\nif s2 == a[index] or s2 == a[index+3] or s2 == a[index+2]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n d = {\"monday\": 6, \"tuesday\": 5, \"wednesday\": 4, \"thursday\": 3, \"friday\": 2, \"saturday\": 1, \"sunday\": 0}\n dif = (d[input()] - d[input()]) % 7\n print((\"NO\", \"YES\")[any(a % 7 == dif for a in (31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31))])\n\n\nif __name__ == '__main__':\n main()\n", "\r\n\r\ndef judge(day):\r\n if day == 'monday':\r\n return 0\r\n elif day == 'tuesday':\r\n return 1\r\n elif day == 'wednesday':\r\n return 2\r\n elif day == 'thursday':\r\n return 3\r\n elif day == 'friday':\r\n return 4\r\n elif day == 'saturday':\r\n return 5\r\n elif day == 'sunday':\r\n return 6\r\n\r\ndef cal(day1, day2):\r\n num = judge(day2)-judge(day1)\r\n if num<0: \r\n num += 7\r\n return num\r\n\r\n\r\nfirst = input()\r\nsecond = input()\r\nnum = cal(first, second)\r\nif num in [0,2,3]:\r\n print('YES')\r\nelse:\r\n print('NO') ", "n1=input()\r\nn2=input()\r\nl=[\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\na=l.index(n1)\r\nb=l.index(n2)\r\n\r\nif b>=a:\r\n x=b-a\r\n # print(x)\r\n if x == 0 or x==2 or x==3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n x=(6-a)+(b+1)\r\n # print(x)\r\n if x == 0 or x == 2 or x == 3:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\na = input()\r\nb = input()\r\n\r\npos = s.index(a)\r\n\r\nif s[pos] == b or s[(pos+2)%7] ==b or s[(pos+3)%7] ==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\r\ncin = stdin.readline\r\ncout = stdout.write\r\nmp = lambda:list(map(int, cin().split()))\r\n\r\nf = cin()[:-1]\r\ns = cin()[:-1]\r\n\r\nd = {'saturday': 1, 'sunday': 2, 'monday': 3, 'tuesday': 4, 'wednesday': 5, 'thursday': 6, 'friday': 7}\r\nl = [0,2,3]\r\ny = (d[f] > d[s])*(d[s]-d[f])%7 + (d[f]<d[s])*(d[s]-d[f])\r\nif y in l:\r\n\tcout('YES')\r\nelse:\r\n\tcout('NO')", "a = input()\r\nb = input()\r\n\r\ndays = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\nflag = False\r\nfor i in [28, 30, 31]:\r\n if days[(days.index(a) + i) % 7] == b:\r\n flag = True\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "a = {'monday':0,'tuesday':1,'wednesday':2,'thursday':3,'friday':4,'saturday':5,'sunday':6}\r\n\r\np = a[input()]\r\nq = a[input()]\r\n\r\nk = (q - p + 7)%7\r\nif(k==0 or k==3 or k==2):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "first = input()\r\nsecond = input()\r\n\r\nall_week = [\"monday\",\"tuesday\",\"wednesday\",\"thursday\",\"friday\",\"saturday\",\"sunday\"]\r\n\r\nall_month = [28, 30, 31]\r\nall_month_mod = [0, 2, 3]\r\nfor i in range(len(all_week)):\r\n\tif all_week[i] == first:\r\n\t\tfirst = i\r\n\tif all_week[i] == second:\r\n\t\tsecond = i\r\nvar = 0\r\nif second < first:\r\n\tvar = second + 7 - first\r\nelse:\r\n\tvar = second - first\r\nfound = False\r\nfor mod in all_month_mod:\r\n\tif mod == var:\r\n\t\tprint(\"YES\")\r\n\t\tfound = True\r\nif not found:\r\n\tprint(\"NO\")\r\n", "MONTH_DAYS = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nDAY_NAMES = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n\r\ndef solve(name1, name2):\r\n dayDiff = computeDayDiff(name1, name2)\r\n return any(MONTH_DAYS[i] % 7 == dayDiff for i in range(len(MONTH_DAYS) - 1))\r\n\r\ndef computeDayDiff(name1, name2):\r\n return (findIndex(name2) - findIndex(name1) + 7) % 7\r\n\r\ndef findIndex(name):\r\n return [i for i, day in enumerate(DAY_NAMES) if day == name][0]\r\n\r\nname1 = input()\r\nname2 = input()\r\nprint(\"YES\" if solve(name1, name2) else \"NO\")", "import math\r\n\r\n\r\n\r\ndef main_function():\r\n day_1 = input()\r\n day_2 = input()\r\n months = [28 % 7 , 30 % 7, 31 % 7]\r\n weeks = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n int_day_1 = weeks.index(day_1)\r\n int_day_2 = weeks.index(day_2)\r\n is_answer_found = False\r\n if int_day_2 >= int_day_1:\r\n dif = int_day_2 - int_day_1\r\n else:\r\n dif = 7 - int_day_1 + int_day_2\r\n if dif in months:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "d = {\r\n \"monday\":0,\r\n \"tuesday\":1,\r\n \"wednesday\":2,\r\n \"thursday\":3,\r\n \"friday\":4,\r\n \"saturday\":5,\r\n \"sunday\":6\r\n}\r\nd1 = d[input()] \r\nd2 = d[input()] \r\nif (28-d2+d1) % 7 == 0 or (30-d2+d1) % 7 == 0 or (31-d2+d1) % 7 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a = [28, 30, 31]\r\nb = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nc = {}\r\nfor i in range(7):\r\n c[b[i]] = i\r\nd1 = c[input()]\r\nd2 = c[input()]\r\nfor i in a:\r\n if ((d1 + i) % 7) == d2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n", "months = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\ndays = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\n\nd1 = str(input())\nd2 = str(input())\nn = days.index(d1)\nb = False\nfor m in months:\n if days[(m + n) % 7] == d2:\n b = True\n break\nprint(\"YES\" if b else \"NO\")\n", "__author__ = 'Think'\r\nday1=input()\r\nday2=input()\r\ndays={\"monday\":1, \"tuesday\":2, \"wednesday\":3, \"thursday\":4, \"friday\":5, \"saturday\":6, \"sunday\":7}\r\nnum1=days[day1]\r\nnum2=days[day2]\r\ndiff=(num2-num1)%7\r\nif diff in [0, 2, 3]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "d = {\r\n 'monday': 0,\r\n 'tuesday': 1,\r\n 'wednesday': 2,\r\n 'thursday': 3,\r\n 'friday': 4,\r\n 'saturday': 5,\r\n 'sunday': 6\r\n}\r\n\r\nfirst = d[input()]\r\n\r\nsecond = d[input()]\r\n\r\n\r\nmonths = (31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31)\r\n\r\nfor i in range(11):\r\n m1, m2 = months[i], months[i+1]\r\n if (m1 + first) % 7 == second:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "d={\"monday\":1,\"tuesday\":2,\"wednesday\":3,\"thursday\":4,\"friday\":5,\"saturday\":6,\"sunday\":7}\r\n\r\na=d[input()]\r\nb=d[input()]\r\nif b>=a and b-a in [0,2,3]:\r\n print(\"YES\")\r\nelif b<a and b-a in [-4,-5]:\r\n print(\"YES\")\r\nelse:\r\n print(\"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\ns=['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\r\nI=input\r\na=I()\r\nprint(['NO','YES'][I()in[s[(s.index(a)+i)%7]for i in (28,30,31)]])", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\na = get_string()\r\nb = get_string()\r\ndays = {\r\n \"monday\": 0,\r\n \"tuesday\": 1,\r\n \"wednesday\": 2,\r\n \"thursday\": 3,\r\n \"friday\": 4,\r\n \"saturday\": 5,\r\n \"sunday\": 6\r\n}\r\n\r\nvalid = {0,2,3}\r\n\r\nif (days[b] - days[a])%7 in valid:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "il=[4,7,7,3,5,1,3,6,2,4,7,2]\r\nid = {\"monday\":1, \"tuesday\":2, \"wednesday\":3, \"thursday\":4, \"friday\":5, \"saturday\":6, \"sunday\":7}\r\na,b = id.get(input()),id.get(input())\r\nans = False\r\nfor i in range(11):\r\n if il[i]-a == il[i+1]-b:\r\n ans = True\r\n break\r\nprint([\"NO\",\"YES\"][ans])\r\n", "d = {'monday': 1, 'tuesday': 2, 'wednesday': 3, 'thursday': 4, 'friday': 5, 'saturday': 6, 'sunday': 7}\r\na, b = input(), input()\r\nflag = (d[b] - d[a]) % 7 in {0, 2, 3}\r\nprint('YES' if flag else 'NO')\r\n", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nimport datetime as dt\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 a = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\n c = input()\r\n n = input()\r\n print(\"YNEOS\"[not ((a.index(n) - a.index(c) + 7) % 7 in (0, 2, 3))::2])", "day={\"monday\":1, \"tuesday\":2, \"wednesday\":3, \"thursday\":4, \"friday\":5, \"saturday\":6, \"sunday\":7}\r\na,b=day[input()],day[input()]\r\nif b>=a: c=b-a\r\nelse: c=7+b-a\r\nif str(c) in '023': print(\"YES\")\r\nelse: print(\"NO\")", "s = input()\r\ns1 = input()\r\nif s == 'monday' and (s1 == 'thursday' or s1 == 'wednesday' or s1 == 'monday'):\r\n print('YES')\r\nelif s == 'tuesday' and (s1 == 'friday' or s1 == 'thursday' or s1 == 'tuesday'):\r\n print('YES')\r\nelif s == 'wednesday' and (s1 == 'saturday' or s1 == 'friday' or s1 == 'wednesday'):\r\n print('YES')\r\nelif s == 'thursday' and (s1 == 'sunday' or s1 == 'saturday' or s1 == 'thursday'):\r\n print('YES')\r\nelif s == 'friday' and (s1 == 'monday' or s1 == 'sunday' or s1 == 'friday'):\r\n print('YES')\r\nelif s == 'saturday' and (s1 == 'tuesday' or s1 == 'monday' or s1 == 'saturday'):\r\n print('YES')\r\nelif s == 'sunday' and (s1 == 'wednesday' or s1 == 'tuesday' or s1 == 'sunday'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s, e = input(), input()\nm = {\n \"monday\": 0,\n \"tuesday\": 1,\n \"wednesday\": 2,\n \"thursday\": 3,\n \"friday\": 4,\n \"saturday\": 5,\n \"sunday\": 6,\n}\nres = \"YES\" if any((m[e] - m[s]) % 7 == d % 7 for d in [28, 31, 30]) else \"NO\"\nprint(res)\n", "s1 = input()\ns2 = input()\na = ['sunday', 'monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', ]\nfor i in range(7):\n if a[i] == s1:\n d1 = i\n if a[i] == s2:\n d2 = i\n\nif (d1 + (31 % 7)) % 7 == d2 or (d1 + (30 % 7)) % 7 == d2 or (d1 + (28 % 7)) % 7 == d2:\n print('YES')\nelse:\n print('NO')", "d = {\"monday\": 0, \"tuesday\": 1, \"wednesday\": 2, \"thursday\": 3, \"friday\": 4, \"saturday\": 5, \"sunday\": 6}\r\nl_n = list([31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31])\r\n\r\nx = input()\r\ny = input()\r\n\r\nfor i in range(0, 11):\r\n if (l_n[i] + d[x]) % 7 == d[y]:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "day1=input()\r\nday2=input()\r\ndays=['monday','tuesday','wednesday','thursday','friday','saturday','sunday']\r\nmonths=[31,28,31, 30, 31, 30, 31, 31, 30,31,30]\r\nlistik=[]\r\ndef pryntfirstdays():\r\n\t# prints 7 lists in one list containting 12 first days of months\r\n\tdaysmega=100*days\r\n\tfor a in range(7):\r\n\t\t\r\n\t\tmnam =[daysmega[(0+a)]]\r\n\t\t\r\n\t\tf=a\r\n\t\tfor bay in months:\r\n\t\t\tf+=bay\r\n\t\t\t\r\n\t\t\tmnam.append(daysmega[f])\r\n\t\t\r\n\t\tlistik.append(mnam)\r\n\treturn listik\r\nlistik=pryntfirstdays()\r\n\r\n\r\n\r\nbol='NO'\r\n\r\nfor year in listik:\r\n\ta=-1\r\n\tfor firstday in year:\r\n\t\ta+=1\r\n\t\tif firstday==day1:\r\n\t\t\tif a!=11:\r\n\t\t\t\tif year[a+1]==day2:\r\n\t\t\t\t\tbol='YES'\r\nprint(bol)\r\n\t\r\n\t\t\t\r\n\t\r\n\t\t\r\n\t\t\r\n\t\r\n\t", "d = {\"monday\":0, \"tuesday\":1, \"wednesday\":2, \"thursday\":3, \"friday\":4, \"saturday\":5, \"sunday\":6}\r\n\r\nf = d[input()]\r\ns = d[input()]\r\n\r\nmonths = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\n\r\nfor i in range(11):\r\n cf, cs = months[i], months[i+1]\r\n if (cf+f)%7 == s:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def week(m,n):\r\n\tif m-n>0:\r\n\t\treturn (7-m+n)\r\n\telif m-n<0:\r\n\t\treturn (-m+n)\r\n\telse:\r\n\t\treturn 0\r\n\r\n\r\n\r\n\r\nd={}\r\nd={'monday':1,'tuesday':2,'wednesday':3,'thursday':4,'friday':5,'saturday':6,'sunday':7 }\r\nm=input()\r\nn=input()\r\nm=d[m]\r\nn=d[n]\r\nif week(m,n)==3 or week(m,n)==2 or week(m,n)==0:\r\n\tprint ('YES')\r\nelse:\r\n\tprint ('NO')\r\n", "days = ['monday', 'tuesday', 'wednesday', 'thursday', 'friday', 'saturday', 'sunday']\r\nfrstDay, scndDay = input(), input()\r\nif (days[days.index(scndDay)] == days[days.index(frstDay)]) or \\\r\n (days[days.index(scndDay) - 2] == days[days.index(frstDay)]) or \\\r\n (days[days.index(scndDay) - 3] == days[days.index(frstDay)]):\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-14 17:23:30\nLastEditTime: 2021-11-14 17:37:41\nDescription: Checking the Calendar\nFilePath: CF724A.py\n'''\n\n\ndef func():\n week = [\"monday\", \"tuesday\", \"wednesday\",\n \"thursday\", \"friday\", \"saturday\", \"sunday\"]\n\n a, b = input().strip(), input().strip()\n if a == b and a in week:\n print(\"YES\")\n elif week[(week.index(a) + 2) % 7] == b:\n print(\"YES\")\n elif week[(week.index(a) + 3) % 7] == b:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "d={\"monday\":0, \"tuesday\":1, \"wednesday\":2, \"thursday\":3, \"friday\":4, \"saturday\":5, \"sunday\":6}\r\na=input().strip()\r\nb=input().strip()\r\nans = \"YES\" if (7+d[b]-d[a])%7 in [0,2,3] else \"NO\"\r\nprint(ans)", "#n = int(input())\r\n#a,b = map(int,input().split())\r\n#A = list(map(int,input().split()))\r\n#A = [int(input()) for i in range(n)]\r\n#for i in range(n):\r\na = input()\r\nb = input()\r\nif a=='monday':\r\n if b =='monday' or b =='wednesday' or b =='thursday':\r\n print('YES')\r\n else:\r\n print('NO')\r\nif a=='tuesday':\r\n if b =='tuesday' or b =='friday' or b =='thursday':\r\n print('YES')\r\n else:\r\n print('NO')\r\nif a=='wednesday':\r\n if b =='friday' or b =='wednesday' or b =='saturday':\r\n print('YES')\r\n else:\r\n print('NO')\r\nif a=='thursday':\r\n if b =='saturday' or b =='sunday' or b =='thursday':\r\n print('YES')\r\n else:\r\n print('NO')\r\nif a=='friday':\r\n if b =='friday' or b =='sunday' or b =='monday':\r\n print('YES')\r\n else:\r\n print('NO')\r\nif a=='saturday':\r\n if b =='saturday' or b =='tuesday' or b =='monday':\r\n print('YES')\r\n else:\r\n print('NO')\r\nif a=='sunday':\r\n if b =='sunday' or b =='tuesday' or b =='wednesday':\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "d = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\nm = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\r\nd1 = input()\r\nd2 = input()\r\ni = d.index(d1)\r\nc = 0\r\nwhile True:\r\n if d[i] == d2:\r\n break\r\n i = (i + 1) % 7\r\n c += 1\r\nif c == 0 or c == 2 or c == 3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "W = [\"monday\", \"tuesday\", \"wednesday\", \"thursday\", \"friday\", \"saturday\", \"sunday\"]\r\na,b=W.index(input()),W.index(input())\r\nprint(\"YES\" if [True, False, True, True, False, False, False][(b-a)%7] else \"NO\")" ]

[ "R=lambda:map(int,input().split())\r\nn=int(input())\r\na=sorted(R())\r\nc=[0]*n\r\nfor i,(_,j) in enumerate(sorted(zip(R(),range(n)))):\r\n c[j]=a[-1-i]\r\nprint(' '.join(map(str,c)))", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\na.sort()\r\nb = sorted([(b[i],i) for i in range(n)])\r\na2 = [0]*n\r\n\r\nfor s in range(n):\r\n le = n - 1-s\r\n a2[b[s][1]] = str(a[le])\r\n \r\nprint(' '.join(a2))\r\n", "# F[n,k]=(n+1)/(k+1)\r\n# sort a in increasing order and\r\n# sort b in decreasing order\r\nn=int(input())\r\na,b=list(map(int,input().split())),list(map(int,input().split()))\r\nc=[]\r\na.sort(reverse=True)\r\nfor i in range(n):\r\n c.append([b[i],i])\r\nc=sorted(c,key=lambda x:(x[0],-x[1]))\r\nd=[0]*n\r\nfor i in range(n):\r\n d[c[i][1]]=a[i]\r\nprint(*d)\r\n", "\"\"\"\r\n Author : Arif Ahmad\r\n Date : \r\n Algo : \r\n Difficulty : \r\n\"\"\"\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport threading\r\n\r\n\r\ndef main():\r\n m = int(stdin.readline().strip())\r\n a = [int(_) for _ in stdin.readline().strip().split()]\r\n b = [int(_) for _ in stdin.readline().strip().split()]\r\n\r\n c = []\r\n for i, v in enumerate(b):\r\n c.append((v, i))\r\n\r\n a = sorted(a, reverse=True)\r\n c = sorted(c)\r\n\r\n ans = [0 for i in range(m)]\r\n j = 0\r\n for v, i in c:\r\n ans[i] = a[j]\r\n j += 1\r\n\r\n stdout.write(' '.join(str(_) for _ in ans))\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n # the following 4 lines of code are required to increase \r\n # the recursion limit and stack size\r\n # * if is cause any problem, comment out the lines, \r\n # * and just call main()\r\n setrecursionlimit(10**6)\r\n threading.stack_size(134217728) # 128MB\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n ", "n=int(input())\r\narr=list(map(int,input().split()))\r\nbrr=list(map(int,input().split()))\r\narr.sort()\r\nt=[(el,i) for i,el in enumerate(brr)]\r\n\r\nt.sort(key=lambda x:(x[0]))\r\nans=[0]*(n)\r\nfor el,i in t:\r\n ans[i]=arr.pop()\r\nprint(*ans)", "m = int(input())\r\nla = sorted(list(map(int, input().split())), reverse=True)\r\nlb = list(map(int, input().split()))\r\nanswer = [0 for i in range(m)]\r\nlb = [(lb[i], i) for i in range(m)]\r\nlb.sort()\r\nfor i in range(m):\r\n answer[lb[i][1]] = la[i]\r\nfor ans in answer:\r\n print(ans, end=' ')\r\n\r\n", "a=int(input())\r\nb=sorted(map(int,input().split()),reverse=True)\r\nc=sorted(zip(map(int,input().split()),range(a)))\r\nans=[0]*a\r\nfor i in range(a):ans[c[i][1]]=b[i]\r\nprint(*ans)", "m = int(input())\nA = sorted(list(map(int, input().split())))\nB = list(map(int, input().split()))\n\nB_idx = sorted([(v, i) for (i, v) in enumerate(B)], reverse=True)\nfor i in range(m):\n B[B_idx[i][1]] = A[i]\nprint(\" \".join([str(v) for v in B]))\n\n", "m = int(input())\r\na = sorted(map(int, input().split()), reverse=True)\r\nb = sorted((bi, i) for i, bi in enumerate(map(int, input().split())))\r\nv = [None] * m\r\nfor i in range(m):\r\n v[b[i][1]] = str(a[i])\r\nprint(' '.join(v))", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nfrom collections import defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nl=L()\nm=L()\nx=[]\nfor i in range(n):\n x.append((m[i],i))\nx.sort(key=lambda x:(x[0]))\nl.sort(reverse=True)\nd=[0]*n\nfor i in range(len(x)):\n d[x[i][1]]=l[i]\nprint(*d)\n", "m = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb_s = sorted(b)\r\na_s = sorted(a, reverse = True)\r\nd = {}\r\nans = [0 for i in range(m)]\r\n\r\nfor i in range(m):\r\n d[b_s[i]] = d.get(b_s[i], [])\r\n d[b_s[i]].append(a_s[i])\r\n\r\nlast = {}\r\n\r\nfor i in range(m):\r\n last[b[i]] = last.get(b[i], -1)+1\r\n ans[i] = d.get(b[i])[last[b[i]]]\r\n\r\nprint(*ans)\r\n \r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())), reverse = True)\r\nb = list(map(int, input().split()))\r\nc = sorted([(i, b[i]) for i in range(n)], key = lambda x : x[1])\r\nres = [0] * n\r\nfor i in range(n):\r\n res[c[i][0]] = a[i]\r\nprint(*res)\r\n", "m=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nfor i in range(m):\r\n b[i]=(b[i],i)\r\nb.sort(key=lambda b:b[0])\r\na.sort(reverse=True)\r\nfor i in range(m):\r\n a[i]=(a[i],b[i][1])\r\na.sort(key=lambda a:a[1])\r\nfor i in a:\r\n print (i[0], end=\" \")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\na.sort()\r\na.reverse()\r\nj=[]\r\nfor i in range(n):\r\n j.append([b[i],i])\r\nj.sort()\r\nans=[0]*n\r\nfor i in range(n):\r\n ans[j[i][1]]=str(a[i])\r\nprint(' '.join(ans))\r\n ", "n = int(input())\r\n\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\n\r\nr1 = []\r\nr2 = []\r\nans = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n\tr1.append((l1[i],i+1))\r\n\r\nfor j in range(n):\r\n\tr2.append((l2[j],j+1))\r\n\r\nr1.sort(reverse=True)\r\nr2.sort()\r\nfor i in range(n):\r\n\tans[r2[i][1]] = r1[i][0]\r\n\r\n# print(r)\r\nans = ans[1:]\r\nprint(*ans)", "import sys\r\nimport math\r\nimport collections\r\ninp= lambda : sys.stdin.readline()\r\nm=998244353\r\nn=int(inp())\r\na=list(map(int,inp().split()))\r\nb=list(map(int,inp().split()))\r\nia={}\r\nib={}\r\nfor i in range(n):\r\n if a[i] not in ia:\r\n ia[a[i]]=[]\r\n if b[i] not in ib:\r\n ib[b[i]]=[]\r\n ia[a[i]].append(i)\r\n ib[b[i]].append(i)\r\na.sort(reverse=True)\r\nb.sort()\r\nans=[0]*n \r\nfor i in range(n):\r\n idx=ib[b[i]].pop()\r\n ans[idx]=a[i]\r\nprint(*ans)\r\n", "m = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nl = [0]*len(a)\r\nd = {}\r\nfor i in range(len(b)):\r\n x = b[i]\r\n if x in d:\r\n e = d[x]\r\n e.append(i)\r\n d[x] = e\r\n\r\n else:\r\n d[x] = [i]\r\na.sort(reverse = True)\r\nb.sort()\r\nfor i in range(len(b)):\r\n x = b[i]\r\n y = a[i]\r\n r = d[x]\r\n j = r.pop()\r\n d[x] = r\r\n l[j] = y\r\nprint(*l)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\np =[]\r\nfor i in range(n):\r\n p.append((b[i],i+1));\r\n#print(p)\r\np.sort()\r\n#print(p)\r\na.sort()\r\n#print(a)\r\na.reverse()\r\n#print(a)\r\nc = [0]*(n+1)\r\nfor i in range(n):\r\n #print(p[i][1],a[i])\r\n c[p[i][1]]=a[i]\r\nfor i in range(n):\r\n print(c[i+1],end=\" \")\r\n", "def f(a,b,m):\r\n\tb=list(zip(b,range(m)))\r\n\tb=sorted(b,key=lambda s:s[0])\r\n\ta=sorted(a,reverse=True)\r\n\tans=[None]*m\r\n\tfor i in range(m):\r\n\t\tans[b[i][1]]=a[i]\r\n\treturn ans\r\n\r\nm=int(input())\r\na=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\nprint(*f(a,b,m))", "import sys\r\nfrom math import sqrt,ceil,floor,gcd\r\nfrom collections import Counter\r\n\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef int_arr(): return list(map(int,input().split()))\r\ndef str_arr(): return list(map(str,input().split()))\r\ndef get_str(): return map(str,input().split())\r\ndef get_int(): return map(int,input().split())\r\ndef get_flo(): return map(float,input().split())\r\ndef lcm(a,b): return (a*b) // gcd(a,b)\r\n\r\nmod = 1000000007\r\n\r\ndef solve(n,a,b):\r\n d = {}\r\n for i in range(n):\r\n if b[i] in d:\r\n d[b[i]].append(i)\r\n else:\r\n d[b[i]] = [i]\r\n\r\n b.sort()\r\n res = [0 for i in range(n)]\r\n a.sort(reverse = True)\r\n\r\n ind = 0\r\n seen = {}\r\n for i in range(n):\r\n if b[i] not in seen:\r\n lis = d[b[i]]\r\n seen[b[i]] = 1\r\n for j in range(len(lis)):\r\n res[lis[j]] = a[ind]\r\n ind += 1\r\n print(*res)\r\n\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\na = int_arr()\r\nb = int_arr()\r\nsolve(n,a,b)\r\n ", "n = int(input())\r\na = sorted(map(int,input().split()),reverse=True)\r\nb = list(map(int,input().split()))\r\nb=[[b[i],i] for i in range(n)]\r\nb.sort()\r\nans=[0]*(n)\r\nfor i in range(n):\r\n ans[b[i][1]]=a[i]\r\nprint(*ans)\r\n", "m=int(input())\r\nA=[int(e) for e in input().split()]\r\nB=[int(e) for e in input().split()]\r\nB=sorted((B[i],i) for i in range(m))\r\nA.sort(reverse=1)\r\na=[None]*m\r\nfor i in range(m):\r\n a[B[i][1]]=A[i]\r\nprint(*a)", "n=int(input())\r\na = list(map(int, input().split()))\r\nb = list(zip(map(int, input().split()), range(n)))\r\na.sort(reverse=True)\r\nb.sort()\r\nc = list(zip((r[1] for r in b), a))\r\nc.sort()\r\nprint(*(r[1] for r in c))\r\n", "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\nB = list(map(int, input().split()))\r\n\r\nAC = Counter(A)\r\n\r\nB1 = []\r\nfor i,b in enumerate(B):\r\n\tB1.append([b,i,-1])\r\nB1.sort()\r\n\r\nfor i in range(N):\r\n\td = B1[i][0]\r\n\tif d in AC and AC[d]>0:\r\n\t\tAC[d]-=1\r\n\t\tB1[i][2] = d\r\n\r\nA.sort()\r\nfor i in range(N):\r\n\tif B1[i][2]>0:continue\r\n\ta = A.pop()\r\n\twhile AC[a]==0:\r\n\t\ta = A.pop()\r\n\r\n\tAC[a]-=1\r\n\tB1[i][2] = a\r\n\r\nB1.sort(key=lambda x:x[1])\r\nprint(*[i[2] for i in B1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = input().split()\r\nb = [(int(d[i]), i) for i in range(n)]\r\nb.sort()\r\na.sort(reverse = True)\r\n\r\nans = [-1] * n\r\nfor i in range(n):\r\n ans[b[i][1]] = a[i]\r\n\r\nprint(*ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()), reverse=True)\r\ns = sorted(enumerate(map(int, input().split())), key=lambda x:x[1])\r\nd = [0]*n\r\nfor i in range(n):\r\n d[s[i][0]] = w[i]\r\nprint(' '.join(map(str, d)))", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nidx = [int(x) for x in input().split()]\r\n\r\narr.sort(reverse=True)\r\nidx = sorted(range(n), key=lambda x: idx[x])\r\n\r\nperm = [0] * n\r\nfor i in range(n):\r\n perm[idx[i]] = arr[i]\r\nprint(*perm, sep=' ')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\na.sort()\r\nt1= []\r\nfor i in range(n):\r\n t1.append([b[i], i])\r\nt1.sort(reverse = True)\r\nind = []\r\nfor i in t1:\r\n ind.append(i[1])\r\nans = [0] * n\r\nfor i in range(n):\r\n ans[ind[i]] = a[i]\r\nprint(*ans)", "m = int(input())\na = map(int, input().split())\nb = list(zip(map(int, input().split()), range(m)))\nb.sort(key=lambda x: x[0])\nans = []\na = list(zip(sorted(a, reverse=True), [x[1] for x in b]))\na.sort(key=lambda x: x[1])\nprint(*[x[0] for x in a])\n", "\r\n\r\n\r\nn = int(input())\r\na= list(map(int,input().split()))\r\n\r\n\r\nb= list(map(int,input().split()))\r\n\r\n\r\na.sort()\r\n\r\nu=[]\r\n\r\n\r\nfor j in range(n):\r\n u.append([b[j],j])\r\nu.sort()\r\n\r\n\r\np=[0]*n\r\n\r\ny=n-1\r\nfor j in u:\r\n p[j[1]]=a[y]\r\n y-=1\r\n\r\nprint(*p)\r\n", "def main():\n n = int(input())\n aa = sorted(map(int, input().split()), reverse=True)\n bb = list(map(int, input().split()))\n ij = sorted(range(n), key=bb.__getitem__)\n for i, j in enumerate(ij):\n bb[j] = aa[i]\n print(' '.join(map(str, bb)))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ninp = lambda : [*map(int, input().split())]\r\na = sorted(inp(), reverse = True)\r\nb = inp()\r\nc = sorted([(i, b[i]) for i in range(n)], key = lambda x : x[1])\r\nans = [\"\"] * n\r\nfor i in range(n):\r\n ans[c[i][0]] = str(a[i])\r\nprint(\" \".join(ans))\r\n\r\n", "m = int(input())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nc = [(b[i], i) for i in range(m)]\r\nc.sort()\r\na.sort(reverse=True)\r\n\r\nres = [0] * m\r\n\r\nfor i in range(m):\r\n\tidx = c[i][1]\r\n\tres[idx] = a[i]\r\n\r\nfor x in res:\r\n\tprint(x, end=' ')\r\n\t", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nA.sort(reverse=True)\r\nB1 = sorted(enumerate(B), key=lambda x: x[1])\r\nB2 = sorted(enumerate(B1), key=lambda x: x[1])\r\n\r\nans = [A[b[0]] for b in B2]\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "m = int(input())\n\na = list(map(int, input().split()))\nb = list(zip(map(int, input().split()), range(m)))\n\na.sort(reverse=True)\nb.sort()\n\nc = list(zip((t[1] for t in b), a))\nc.sort()\n\nprint(*(t[1] for t in c))\n\n\n\n# Made By Mostafa_Khaled", "m = int(input())\nA = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\n_B = [(B[i], i) for i in range(m)]\n_B.sort()\nA.sort(reverse = True)\nans = [0 for i in range(m)]\nfor i in range(m):\n ans[_B[i][1]] = A[i]\nfor i in ans:\n print(i, end = ' ')\nprint()\n\n", "import sys\r\ninf = float('inf')\r\nip = lambda : sys.stdin.readline().rstrip()\r\nsplit = lambda : ip().split(' ')\r\nip1 = lambda : map(int,split())\r\narr = lambda : list(ip1())\r\narr1 = lambda n : [arr() for _ in range(n)]\r\n# mod = 998244353\r\nn=int(ip())\r\na=arr()\r\nb=arr()\r\nb=[[b[i],i] for i in range(n)]\r\na.sort()\r\nb.sort(reverse=True)\r\n# print(b)\r\n# print(a)\r\nans=[0]*n\r\nwhile b:\r\n rmv=b.pop()\r\n val,idx=rmv[0],rmv[1]\r\n ans[idx]=a.pop()\r\nprint(*ans)", "ii = lambda: int(input())\r\nmi = lambda: map(int, input().split())\r\nli = lambda: list(mi())\r\nsi = lambda: input()\r\nmsi = lambda: map(int, stdin.readline().split())\r\nlsi = lambda: list(msi())\r\n\r\n\r\nm = int(input())\r\n \r\na = list(map(int, input().split()))\r\nb = list(zip(map(int, input().split()), range(m)))\r\n \r\na.sort(reverse=True)\r\nb.sort()\r\n \r\nc = list(zip((t[1] for t in b), a))\r\nc.sort()\r\n \r\nprint(*(t[1] for t in c))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ntmp=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n b.append([tmp[i],i])\r\na.sort(reverse=True)\r\nb.sort()\r\ntmp=[]\r\nfor i in range(n):\r\n tmp.append([a[i],b[i][1]])\r\nans=[-1]*n\r\nfor i in range(n):\r\n ans[tmp[i][1]]=tmp[i][0]\r\nprint(*ans)", "n = int(input())\na = [*map(int, input().split())]\nb = [*map(int, input().split())]\nb = [(b[i], i) for i in range(n)]\n\nb.sort()\na.sort(reverse=True)\n\nres = [0] * n\n\nfor i in range(n):\n res[b[i][1]] = a[i]\n\nprint(*res)", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(lambda x: (int(x[1]), x[0]), enumerate(input().split())))\nres = [0]*n\na.sort(reverse=True)\nb.sort()\nfor i in range(n):\n res[b[i][1]] = a[i]\nprint(\" \".join(map(str, res)))\n", "import math\r\n\r\n\r\ndef bcof(x, y):\r\n a = math.factorial(x)\r\n b = math.factorial(y)\r\n c = math.factorial(x - y) # that appears to be useful to get the correct result\r\n return a // (b * c)\r\n\r\n\r\ndef F(n, k):\r\n return bcof(n + 1, k + 1)\r\n\r\n\r\nclass CodeforcesTask840ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.m = 0\r\n self.a = []\r\n self.b = []\r\n\r\n def read_input(self):\r\n self.m = int(input())\r\n self.a = [int(x) for x in input().split(\" \")]\r\n self.b = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n b = [(i, x) for i, x in enumerate(self.b)]\r\n b.sort(key=lambda tup: tup[1])\r\n self.a.sort(reverse=True)\r\n new_a = [0 for x in range(len(b))]\r\n for x in range(len(b)):\r\n new_a[b[x][0]] = self.a[x]\r\n self.result = \" \".join([str(x) for x in new_a])\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask840ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nbb = list(enumerate(b))\r\nbb = sorted(bb, key = lambda x:x[1])\r\n#print (bb)\r\na.sort(reverse=True)\r\nc = [0] * n\r\nfor i in range(n):\r\n\t#print (bb[i][0])\r\n\tc[bb[i][0]] = a[i]\r\nprint (*c)", "\r\ndef getSum(a, b):\r\n \r\n cont = 0\r\n for i in range(0, len(a)):\r\n cont += (a[i] + 1) / (b[i] + 1)\r\n \r\n return cont\r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nordenadoB = []\r\nordenadoA = []\r\nfor i in range(0, len(a)):\r\n ordenadoB.append((i, b[i]))\r\n ordenadoA.append((i, a[i]))\r\n\r\nordenadoB = sorted(ordenadoB, key=lambda x: x[1])\r\nordenadoA = sorted(ordenadoA, key=lambda x: x[1], reverse=True)\r\n\r\nres = []\r\n# print(ordenadoB, ordenadoA)\r\nfor i in range(0, len(ordenadoA)):\r\n res.append( (ordenadoB[i][0], ordenadoA[i][1]))\r\n\r\nres = sorted(res, key=lambda x: x[0])\r\nfor i in res:\r\n print(i[1], end=\" \")\r\n \r\nprint('')\r\n ", "import sys,math,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nl=L()\nm=L()\nx=[]\nfor i in range(n):\n x.append([-m[i],i])\nx.sort(key=lambda x:x[0])\nx=x[-1::-1]\nl.sort(reverse=True)\nd=[0]*n\nfor i in range(n):\n d[x[i][1]]=l[i]\nprint(*d)\n\n", "n=int(input())\r\na=list(map(int,input().strip().split(' ')))\r\nb=list(map(int,input().strip().split(' ')))\r\nc=[]\r\na.sort(reverse=True)\r\nfor i in range(n):\r\n d=[]\r\n d.append(b[i])\r\n d.append(i)\r\n c.append(d)\r\nc = sorted(c)\r\nd=[0 for i in range(n)]\r\nfor i in range(n):\r\n d[c[i][1]]=a[i]\r\nfor i in range(n):\r\n print(d[i],end=' ')", "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\nm = int(input())\r\na = listin()\r\nb = listin()\r\nd = defaultdict(list)\r\nfor i in range(m):\r\n d[b[i]].append(i)\r\nnums = deque(sorted(d.keys()))\r\na.sort(reverse = True)\r\na = deque(a)\r\nans = [0 for i in range(m)]\r\nwhile nums:\r\n while d[nums[0]]:\r\n ans[d[nums[0]].pop()] = a.popleft()\r\n nums.popleft()\r\nprint(*ans)", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, B):\r\n n = len(A)\r\n A.sort(reverse= True)\r\n B2 = [[B[i], i] for i in range(n)]\r\n B2.sort()\r\n answer = [None for i in range(n)]\r\n for i in range(n):\r\n bi, I = B2[i]\r\n ai = A[i]\r\n answer[I] = ai \r\n answer = ' '.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n \r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nprocess(A, B)", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\na.sort()\nt1= []\nfor i in range(n):\n t1.append([b[i], i])\nt1.sort(reverse = True)\nind = []\nfor i in t1:\n ind.append(i[1])\nans = [0] * n\nfor i in range(n):\n ans[ind[i]] = a[i]\nprint(*ans)\n\t \t \t\t \t\t \t\t\t \t \t \t\t\t\t\t\t\t \t\t", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/21 13:33\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\n\r\nA = sorted([(x, i) for i,x in enumerate(A)], reverse=True)\r\nB = sorted([(x, i) for i,x in enumerate(B)])\r\n\r\nans = [0] * N\r\nfor i in range(N):\r\n a, ia = A[i]\r\n b, ib = B[i]\r\n ans[ib] = a\r\n\r\nprint(' '.join(map(str, ans)))", "m = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\na_streak = a.copy()\r\nb_streak = b.copy()\r\n\r\na_streak.sort(reverse=True)\r\nb_streak.sort()\r\n\r\nmapping = {}\r\n\r\nfor ind, b_i in enumerate(b_streak):\r\n if b_i not in mapping:\r\n mapping[b_i] = [a_streak[ind]]\r\n else:\r\n mapping[b_i].append(a_streak[ind])\r\n\r\n# print(mapping)\r\n\r\nans = []\r\nfor b_i in b:\r\n ans.append(mapping[b_i].pop())\r\n\r\nprint(*ans)\r\n", "# http://codeforces.com/problemset/problem/840/A\r\nclass Element(object):\r\n def __init__(self, val, index, asigned=-1):\r\n self.val = val\r\n self.index = index\r\n self.asigned = asigned\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n b_el = [Element(0, 0) for i in range(n)]\r\n\r\n for i in range(0, n):\r\n b_el[i].val = b[i]\r\n b_el[i].index = i\r\n # sort a by vals\r\n a = sorted(a)\r\n # sort b by vals\r\n b_el = sorted(b_el, key=lambda x: x.val)\r\n # asigna valores mayores a los menores\r\n for i in range(0, n):\r\n b_el[i].asigned = a[n - 1 - i]\r\n # reordenar b, esta vez por indices y print de valores asignados\r\n b_el = sorted(b_el, key=lambda x: x.index)\r\n for i in b_el:\r\n print(i.asigned, end=' ')\r\nmain()", "m=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=[0]*m\r\nz=[]\r\nfor i in range(m):\r\n z.append([b[i],i])\r\nz.sort()\r\na.sort()\r\na=a[::-1]\r\nfor i in range(m):\r\n j=z[i][1]\r\n ans[j]=a[i]\r\nprint(*ans)", "n=int(input())\r\naa=list(map(int,input().split()))\r\nbb=list(map(int,input().split()))\r\nll=aa.copy()\r\nkk=bb.copy()\r\nll.sort()\r\nkk.sort()\r\n\"\"\"dict1,dict2=dict(),dict()\r\nfor i in ll:\r\n if i in dict1:\r\n dict1[i]+=1\r\n else:\r\n dict1[i]=1\r\nfor i in kk:\r\n if i in dict1:\r\n if i in dict2:\r\n dict2[i]+=1\r\n else:\r\n dict2[i]=1\r\nprint(dict2)\"\"\"\r\ndict1=dict()\r\nfor i in range(n):\r\n if kk[i] in dict1:\r\n dict1[kk[i]].append(ll[-i-1])\r\n else:\r\n dict1[kk[i]]=[ll[-i-1]]\r\n\"\"\"print(ll)\r\nprint(kk)\r\nprint(dict1)\"\"\"\r\nfor i in bb:\r\n print(dict1[i][-1],end=\" \")\r\n dict1[i].pop(-1)\r\n" ]

[ "def check(a, b, n):\n\treturn a>=0 and b>=0 and a<n and b<n\n\ndef solve():\n\tn = int(input())\n\tar = []\n\tfor i in range(n):\n\t\tar.append(input())\n\n\tcross = [[0]*n for _ in range(n)]\n\n\taddc = [(1, 0), (2, 0), (1, -1), (1, 1)]\n\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif ar[i][j] == \"#\" and cross[i][j] == 0:\n\t\t\t\tcross[i][j] = 1\n\t\t\t\tfor a, b in addc:\n\t\t\t\t\tif check(i+a, j+b, n):\n\t\t\t\t\t\t#print(ar[i+a][j+b], cross[i+a][j+b])\n\t\t\t\t\t\tif ar[i+a][j+b] == \"#\" and cross[i+a][j+b] == 0:\n\t\t\t\t\t\t\tcross[i+a][j+b] = 1\n\t\t\t\t\t\telse:\n\t\t\t\t\t\t\tprint(\"NO\")\n\t\t\t\t\t\t\treturn\n\t\t\t\t\telse:\n\t\t\t\t\t\tprint(\"NO\")\n\t\t\t\t\t\treturn\n\tprint(\"YES\")\n\n\nsolve()", "#fdf_2791\nn = int(input())\na = [list(input()) for i in range(n)]\nfor i in range(1,n-1):\n\tfor j in range(1,n-1):\n\t\t\tif a[i][j]==a[i-1][j]==a[i][j+1]==a[i+1][j]==a[i][j-1]=='#':\n\t\t\t\ta[i][j]=a[i-1][j]=a[i][j+1]=a[i+1][j]=a[i][j-1]='.'\n\nprint((sum(a[i].count('#')for i in range(n)))==0 and \"YES\" or \"NO\")\n \t \t \t\t \t\t \t \t\t\t\t \t", "def cross(i, j, v, n):\n\tv[i*n+j] = '.'\n\tif v[(i+1)*n+j] == '#':\n\t\tv[(i+1)*n+j] = '.'\n\t\tif v[(i+2)*n+j] == '#':\n\t\t\tv[(i+2)*n+j] = '.'\n\t\t\tif v[(i+1)*n+j+1] == '#':\n\t\t\t\tv[(i+1)*n+j+1] = '.'\n\t\t\t\tif v[(i+1)*n+j-1] == '#':\n\t\t\t\t\tv[(i+1)*n+j-1] = '.'\n\t\t\t\t\treturn True\n\t\t\t\telse:\n\t\t\t\t\treturn False\n\t\t\telse:\n\t\t\t\treturn False\n\t\telse:\n\t\t\treturn False\n\telse:\n\t\treturn False\n\n\nn = int(input())\nv = ['.'] * n * n\nans = True\n\nfor i in range(n):\n\ts = input()\n\tfor j in range(n):\n\t\tv[i*n+j] = s[j]\n\nfor i in range(n):\n\tif ans:\n\t\tfor j in range(n):\n\t\t\tif v[i*n+j] == '#':\n\t\t\t\tif j == 0 or j == (n - 1) or i > (n - 3):\n\t\t\t\t\tans = False\n\t\t\t\t\tbreak\n\t\t\t\telse:\n\t\t\t\t\tans = cross(i, j, v, n)\n\telse:\n\t\tbreak\n\nif ans:\n\tprint('YES')\nelse:\n\tprint('NO')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(1,n-1):\r\n for j in range(1,n-1):\r\n if a[i][j]=='#' and a[i+1][j]=='#' and a[i-1][j]=='#' and a[i][j-1]=='#' and a[i][j+1]=='#':\r\n a[i][j]='.'\r\n a[i][j+1]='.'\r\n a[i][j-1]='.'\r\n a[i+1][j]='.'\r\n a[i-1][j]='.'\r\nfor i in a:\r\n for j in i:\r\n if j=='#':\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "import sys\r\nimport bisect\r\nfrom collections import Counter,defaultdict as dd\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(str(var))\r\ndef l(): return list(sp())\r\ndef strl(): return list(strsp())\r\ndef sp(): return map(int, data().split())\r\ndef strsp(): return map(str, data().split())\r\n\r\nn=int(data())\r\na=[]\r\nfor _ in range(n):\r\n a.append(list(data()))\r\nb=0\r\nfor i in range(1,n-1):\r\n for j in range(1,n-1):\r\n if a[i][j]=='#' and a[i-1][j]=='#' and a[i][j-1]=='#' and a[i][j+1]=='#' and a[i+1][j]=='#': \r\n a[i][j]='.'\r\n a[i-1][j]='.'\r\n a[i+1][j]='.'\r\n a[i][j-1]='.'\r\n a[i][j+1]='.'\r\nfor i in range(n):\r\n b+=a[i].count(\"#\")\r\nif b==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\ns = [list(input()) for _ in range(n)]\nfor i in range(1, n-1):\n\tfor j in range(1, n-1):\n\t\tif len(set([s[i][j], s[i-1][j], s[i+1][j], s[i][j+1], s[i][j-1]])) != 1:\n\t\t\tcontinue\n\t\ts[i][j] = s[i-1][j] = s[i+1][j] = s[i][j+1] = s[i][j-1] = '.'\nprint(\"NO\" if any([x==\"#\" for ys in s for x in ys]) else \"YES\")\n", "n = int(input())\r\na = [list(input()) for i in range(n)]\r\nfor i in range(1,n-1):\r\n\tfor j in range(1,n-1):\r\n\t\tif a[i][j] == a[i-1][j] == a[i+1][j] == a[i][j-1] == a[i][j+1] == '#':\r\n\t\t\ta[i][j] = a[i-1][j] = a[i+1][j] = a[i][j-1] = a[i][j+1] = '.'\r\nprint (\"NO\" if sum(a[i].count('#') for i in range(n)) else \"YES\")\r\n", "n = int(input())\r\nrows = [list(input()) for x in range(n)]\r\na = 0\r\nfor x in rows:\r\n a += x.count(\"#\")\r\nif a % 5 == 0:\r\n for x in range(1, n - 1):\r\n for y in range(1, n - 1):\r\n if rows[x][y] == \"#\" and rows[x - 1][y] == \"#\" and rows[x + 1][y] == \"#\" and rows[x][y - 1] == \"#\" and rows[x][y + 1] == \"#\":\r\n rows[x][y] = rows[x - 1][y] = rows[x + 1][y] = rows[x][y - 1] = rows[x][y + 1] = \".\"\r\n for x in rows:\r\n for y in x:\r\n if y == \"#\":\r\n print(\"NO\")\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nrows = [['.']*(n+2)]\r\nfor i in range(n):\r\n rows.append(['.'] + list(input()) + ['.'])\r\nrows.append(['.']*(n+2))\r\ndef checkPlus(centerX, centerY):\r\n if(rows[centerY][centerX]=='#' and rows[centerY-1][centerX]=='#' and \r\n rows[centerY+1][centerX]=='#' and rows[centerY][centerX+1]=='#' and \r\n rows[centerY][centerX-1]=='#'):\r\n rows[centerY][centerX]='.' \r\n rows[centerY-1][centerX]='.'\r\n rows[centerY+1][centerX]='.'\r\n rows[centerY][centerX+1]='.'\r\n rows[centerY][centerX-1]='.'\r\n\r\nfor y in range(1, n+1):\r\n for x in range(1, n+1):\r\n checkPlus(x, y)\r\n\r\nfor y in range(1, n+1):\r\n for x in range(1, n+1):\r\n if(rows[y][x]=='#'):\r\n print('NO')\r\n break\r\n else:\r\n continue\r\n break\r\nelse:\r\n print('YES')", "grid = []\nn = 0\n\ndef main():\n global grid, n\n def clear(i, j):\n if i - 1 < 0 or i + 1 >= n or j < 0 or j + 2 >= n:\n return False\n if grid[i][j] == '.' or grid[i][j + 1] == '.' or grid[i][j + 2] == '.':\n return False\n grid[i][j] = '.'\n grid[i][j + 1] = '.'\n grid[i][j + 2] = '.'\n if grid[i + 1][j + 1] == '.' or grid[i - 1][j + 1] == '.':\n return False\n grid[i + 1][j + 1] = '.'\n grid[i - 1][j + 1] = '.'\n return True\n\n n = int(input())\n for i in range(n):\n grid.append(list(input()))\n for j in range(n):\n for i in range(n):\n if grid[i][j] == '#':\n if not clear(i, j):\n return False\n for i in range(n):\n for j in range(n):\n if grid[i][j] == '#':\n return False\n return True\n\n\nprint(\"YES\" if main() else \"NO\")\n", "n = int(input());\n\ns = [['.'] * n] * n;\n\nfor i in range(0, n):\n s[i] = list(input());\n\nflag = 1;\n\nfor i in range(0, n - 2):\n for j in range(1, n - 1):\n if (s[i][j] == '#'):\n flag &= s[i + 1][j] == '#';\n flag &= s[i + 1][j - 1] == '#';\n flag &= s[i + 1][j + 1] == '#';\n flag &= s[i + 2][j] == '#';\n flag &= s[i][j] == '#';\n s[i + 1][j] = '.';\n s[i + 1][j - 1] = '.';\n s[i + 1][j + 1] = '.';\n s[i + 2][j] = '.';\n s[i][j] = '.';\n\nfor i in range(0, n):\n for j in range(0, n):\n flag &= s[i][j] == '.';\n\n\n\nif (flag == 1):\n print(\"YES\");\nelse:\n print(\"NO\");\n\n\n\n\n", "import sys\r\nlis = list()\r\nn = int (input())\r\nfor i in range (n) :\r\n lis.append (list (input()))\r\nfor line in range (1, n - 1) :\r\n for j in range (1, n - 1) :\r\n if lis[line][j] == '#' and\\\r\n (lis[line + 1][j] == '#') and (lis[line - 1][j] == '#') and \\\r\n (lis[line][j + 1] == '#') and (lis[line][j - 1] == '#') :\r\n lis[line][j] = '.'\r\n lis[line + 1][j] = '.'\r\n lis[line - 1][j] = '.'\r\n lis[line][j + 1] = '.'\r\n lis[line][j - 1] = '.'\r\nfor i in lis :\r\n for j in i :\r\n if j == '#' :\r\n print (\"NO\")\r\n sys.exit()\r\nprint ('YES')\r\n", "n = int(input())\r\na = []\r\nerr = 0\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(1, n-1):\r\n for j in range(1, n-1):\r\n if (a[i][j]=='#'):\r\n if (a[i+1][j]=='#') and (a[i][j+1]=='#') and (a[i-1][j]=='#') and (a[i][j-1]=='#'):\r\n a[i+1][j]='.'\r\n a[i][j+1]='.'\r\n a[i-1][j]='.'\r\n a[i][j-1]='.'\r\n a[i][j]='.'\r\nfor i in range(n):\r\n for j in range(n):\r\n if (a[i][j]=='#'):\r\n err = 1\r\n break\r\nif (err == 1):\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\nb = [list(input()) for _ in range(n)]\r\n\r\nfor i in range(1, n - 1):\r\n for j in range(1, n - 1):\r\n if b[i][j] == b[i-1][j] == b[i+1][j] == b[i][j-1] == b[i][j+1] == '#':\r\n b[i][j] = b[i-1][j] = b[i+1][j] = b[i][j-1] = b[i][j+1] = '.'\r\nprint('NO' if any(True for r in b if '#' in r) else 'YES')", "n = int(input())\r\ncnt = 0\r\nchk = [[False]*n for j in range(n)]\r\nfor i in range(n):\r\n dt = input()\r\n for j in range(n):\r\n if chk[i][j] == True:\r\n if dt[j] != '#':\r\n cnt = 1\r\n break\r\n if dt[j] == '#':\r\n cnt += 1\r\n if chk[i][j] == False:\r\n try:\r\n chk[i][j] = True\r\n chk[i+1][j] = True\r\n chk[i+1][j - 1] = True\r\n chk[i+1][j + 1] = True\r\n chk[i+2][j] = True\r\n except Exception as e:\r\n cnt = 1\r\n break\r\n\r\n# print(cnt)\r\nif cnt%5 == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n# 4\r\n# .#...\r\n# ####.\r\n# .####\r\n# ....#", "def valid(a, b, c):\r\n return a[1] == '#' and b == ['#','#','#'] and c[1] == '#'\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr += [list(input())]\r\nfor i in range(n-2):\r\n for j in range(n-2):\r\n if valid(arr[i][j:j+3], arr[i+1][j:j+3], arr[i+2][j:j+3]):\r\n arr[i][j+1] = '.'\r\n arr[i+1][j:j+3] = '...'\r\n arr[i+2][j+1] = '.'\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j] == '#':\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n = int(input())\r\nres = \"YES\"\r\nc = []\r\nfor i in range(n):\r\n c.append(['.'])\r\n r = input()\r\n for C in r:\r\n c[i].append(C)\r\nfor i in range(n):\r\n for j in range(n + 1):\r\n if(c[i][j] == '#'):\r\n if(i >= n - 2 or j == n):\r\n res = \"NO\"\r\n continue\r\n if(c[i + 1][j] == '.' or c[i + 1][j - 1] == '.' or c[i + 1][j + 1] == '.'):\r\n res = \"NO\"\r\n continue\r\n if(c[i + 2][j] == '.'):\r\n res = \"NO\"\r\n c[i][j] = '.'\r\n c[i + 1][j] = '.'\r\n c[i + 2][j] = '.'\r\n c[i + 1][j - 1] = '.'\r\n c[i + 1][j + 1] = '.'\r\nprint(res)\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\nn=ii()\r\nl=[]\r\nc=0\r\nc1=0\r\nfor _ in range(n):\r\n x=ls()\r\n c+=x.count('#')\r\n l.append(x)\r\nfor i in range(1,n-1):\r\n for j in range(1,n-1):\r\n if l[i][j]+l[i-1][j]+l[i+1][j]+l[i][j-1]+l[i][j+1]=='#####':\r\n l[i][j]='.'\r\n l[i-1][j]='.'\r\n l[i+1][j]='.'\r\n l[i][j-1]='.'\r\n l[i][j+1]='.'\r\n c1+=5\r\nprint('YNEOS'[c1!=c::2])", "def main():\r\n n = int(input())\r\n grid = [list(input()) for _ in range(n)]\r\n\r\n neighbors = [(0, 0), (1, 0), (-1, 0), (0, 1), (0, -1)] \r\n for r in range(1, n-1):\r\n for c in range(1, n-1):\r\n coords2remove = []\r\n for neigh in neighbors:\r\n a, b = r + neigh[0], c + neigh[1]\r\n if grid[a][b] == '#':\r\n coords2remove.append((a, b))\r\n\r\n if len(coords2remove) == 5:\r\n for a, b in coords2remove:\r\n grid[a][b] = '.'\r\n\r\n\r\n for r in range(n):\r\n for c in range(n):\r\n if grid[r][c] == '#':\r\n print('NO')\r\n return\r\n\r\n print('YES')\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\na = [list(input()) for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == '#':\r\n if (i < n - 2 and j >= 1 and j <= n - 2 and a[i + 1][j - 1] == '#' and a[i + 1][j] == '#' and a[i + 1][j + 1] == '#' and a[i + 2][j] == '#'):\r\n a[i][j] = '.'\r\n a[i + 1][j - 1] = '.'\r\n a[i + 1][j] = '.'\r\n a[i + 1][j + 1] = '.'\r\n a[i + 2][j] = '.'\r\n else:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "import sys\r\n\r\n\r\ndef delete_plus(center_column, center_row):\r\n global area\r\n try:\r\n if (area[center_column - 1][center_row] == \"#\" and area[center_column + 1][center_row] == \"#\" and\r\n area[center_column][center_row - 1] == \"#\" and area[center_column][center_row + 1] == \"#\" and\r\n area[center_column][center_row] == \"#\") is True:\r\n area[center_column - 1][center_row] = \".\"\r\n area[center_column + 1][center_row] = \".\"\r\n area[center_column][center_row - 1] = \".\"\r\n area[center_column][center_row + 1] = \".\"\r\n area[center_column][center_row] = \".\"\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\n except IndexError:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\n\r\nlength = int(input())\r\narea = [None]*length\r\nfor i in range(length):\r\n area[i] = [j for j in input()]\r\n\r\nwhile True:\r\n flag = True\r\n for i in range(length):\r\n for j in range(length):\r\n if area[i][j] == \"#\":\r\n empty = 0\r\n side = \"\"\r\n if i == 0 or area[i-1][j] == \".\":\r\n empty += 1\r\n else:\r\n side = \"up\"\r\n if i == length - 1 or area[i+1][j] == \".\":\r\n empty += 1\r\n else:\r\n side = \"down\"\r\n if j == 0 or area[i][j-1] == \".\":\r\n empty += 1\r\n else:\r\n side = \"left\"\r\n if j == length - 1 or area[i][j+1] == \".\":\r\n empty += 1\r\n else:\r\n side = \"right\"\r\n if empty == 3:\r\n if side == \"up\":\r\n delete_plus(i - 1, j)\r\n if side == \"down\":\r\n delete_plus(i + 1, j)\r\n if side == \"left\":\r\n delete_plus(i, j - 1)\r\n if side == \"right\":\r\n delete_plus(i, j + 1)\r\n flag = False\r\n\r\n if flag:\r\n n = True\r\n for row in area:\r\n if \"#\" in row:\r\n n = False\r\n\r\n if n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\n", "import math\r\nimport string\r\n\r\ndef can_i_draw_cross(i, j, t):\r\n if j < 1 or j > len(t) - 2 or i > len(t) - 3:\r\n return False\r\n if t[i + 1][j] == \"#\" and t[i + 2][j] == \"#\" and t[i + 1][j + 1] == \"#\" and t[i + 1][j - 1] == \"#\":\r\n t[i][j] = \".\"\r\n t[i + 1][j] = \".\"\r\n t[i + 1][j + 1] = \".\"\r\n t[i + 1][j - 1] = \".\"\r\n t[i + 2][j] = \".\"\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n table = [list(input()) for i in range(int(input()))]\r\n cant_make_it = False\r\n for i in range(len(table)):\r\n for j in range(len(table)):\r\n if table[i][j] == \"#\":\r\n if not can_i_draw_cross(i, j, table):\r\n print(\"NO\")\r\n cant_make_it = True\r\n break\r\n if cant_make_it:\r\n break\r\n if not cant_make_it:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "def out(matri):\n verdade = True\n\n for i in matri:\n if '#' in i:\n verdade = False\n\n if verdade:\n print('YES')\n \n else:\n print('NO')\n\ndef main():\n n = int(input())\n matri = []\n for _ in range(n):\n matri.append(list(input()))\n\n for i in range(n):\n for j in range(n):\n if (matri[i][j] == '.'):\n continue\n\n devePintar = 0\n estaem = [\n #não esta \n j + 1 != n, #a direita\n j != 0, #a esquerda\n i != 0, #em cima\n i + 1 != n #em baixo\n ]\n \n if (estaem[0] and matri[i][j + 1] == '#'):\n devePintar += 1\n \n if (estaem[1] and matri[i][j - 1] == '#'):\n devePintar += 1\n \n if (estaem[2] and matri[i - 1][j] == '#'):\n devePintar += 1\n \n if (estaem[3] and matri[i + 1][j] == '#'):\n devePintar += 1\n\n if devePintar == 4:\n matri[i][j] = '.'\n if (estaem[0] and matri[i][j + 1] == '#'):\n matri[i][j + 1] = '.'\n \n if (estaem[1] and matri[i][j - 1] == '#'):\n matri[i][j - 1] = '.'\n \n if (estaem[2] and matri[i - 1][j] == '#'):\n matri[i - 1][j] = '.'\n \n if (estaem[3] and matri[i + 1][j] == '#'):\n matri[i + 1][j] = '.' \n \n out(matri)\n \n \n\nif __name__ == '__main__':\n main()\n \t\t \t\t\t\t\t \t \t \t \t\t \t\t\t", "n = int(input())\r\na = list()\r\n\r\n\r\ndef x(i, j): return a[i][j] == '#' and a[i + 1][j] == '#' and a[i -\r\n 1][j] == '#' and a[i][j - 1] == '#' and a[i][j + 1] == '#'\r\n\r\n\r\nfor i in range(n):\r\n a.append([c for c in input()])\r\n\r\nfor i in range(1, n-1):\r\n for j in range(1, n-1):\r\n if x(i, j):\r\n a[i][j] = a[i + 1][j] = a[i - 1][j] = a[i][j - 1] = a[i][j + 1] = '.'\r\n\r\nprint('YES' if all(a[i][j] == '.' for i in range(n)\r\n for j in range(n)) else 'NO')\r\n", "def canDraw(n, matrix):\n can = True\n for i in range(n):\n for j in range(n):\n if matrix[i][j] == \"#\":\n if matrix[i+1][j] == \"#\" and matrix[i+2][j] == \"#\" and matrix[i+1][j-1] == \"#\" and matrix[i+1][j+1] == \"#\":\n matrix[i][j] = \".\"\n matrix[i+1][j] = \".\"\n matrix[i+2][j] = \".\"\n matrix[i+1][j-1] = \".\"\n matrix[i+1][j+1] = \".\"\n else:\n can = False\n break\n if not can:\n break\n return can\n \n\n\n### MAIN\nn = int(input())\nmatrix = []\nhash = 0\nfor i in range(n):\n string = input()\n hash += string.count(\"#\")\n matrix.append(list(string))\nif hash % 5 != 0:\n print(\"NO\")\nelse:\n if canDraw(n, matrix):\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", "n = int(input())\r\na = [[0] * n for i in range(n)]\r\nans = 'YES'\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n if s[j] == '#':\r\n a[i][j] = 1\r\n#print(a)\r\nfor i in range(n - 2):\r\n for j in range(1, n - 1):\r\n if a[i][j] == 1:\r\n if a[i + 1][j] == 1 and a[i + 2][j] == 1 and a[i + 1][j - 1] == 1 and a[i + 1][j + 1] == 1:\r\n a[i][j] = 0\r\n a[i + 1][j] = 0\r\n a[i + 2][j] = 0\r\n a[i + 1][j - 1] = 0\r\n a[i + 1][j + 1] = 0\r\n else:\r\n ans = 'NO'\r\n#print(a)\r\nfor i in range(n):\r\n if sum(a[i]) != 0:\r\n ans = 'NO'\r\nprint(ans)\r\n ", "h = int(input())\r\nl = [c == '#' for _ in range(h) for c in input()]\r\nw = len(l) // h\r\ncross = (0, w - 1, w, w + 1, 2 * w)\r\nfor i in range(1, (h - 2) * w - 1):\r\n if all(l[_ + i] for _ in cross):\r\n for _ in cross:\r\n l[_ + i] = False\r\nprint(('YES', 'NO')[any(l)])\r\n\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled", "import sys\n\nn = int(sys.stdin.readline())\nlines = []\nfor i in range(n):\n lines.append(list(sys.stdin.readline().strip()))\n \ndef check(lines, x, y, n):\n if x < 0 or x >= n or y < 0 or y >= n:\n return False\n if lines[x][y] != '#':\n return False\n lines[x][y] = '.'\n return True\n \ndef tryPaint(lines, i, j, n):\n return check(lines, i, j, n) and \\\n check(lines, i-1, j+1, n) and \\\n check(lines, i, j+1, n) and \\\n check(lines, i+1, j+1, n) and \\\n check(lines, i, j+2, n)\n \nfailed = False\n \nfor j in range(n):\n for i in range(n):\n if lines[i][j] == '#':\n if not tryPaint(lines, i, j, n):\n failed = True\n break\n if failed:\n break\n\nif not failed:\n for i in range(n):\n if \"#\" in set(lines[i]):\n failed = True\n break\n\nif failed:\n print(\"NO\")\nelse:\n print(\"YES\")\n \n \n", "def verificar_cruzes(matriz, n):\n\n for i in range(1, n - 1):\n for j in range(1, n - 1):\n if(matriz[i][j] == \"#\"):\n if(matriz[i - 1][j] == \"#\" and matriz[i + 1][j] == \"#\" and matriz[i][j + 1] == \"#\" and matriz[i][j - 1] == \"#\"):\n matriz[i][j] = \".\"\n matriz[i + 1][j] = \".\"\n matriz[i - 1][j] = \".\"\n matriz[i][j + 1] = \".\"\n matriz[i][j - 1] = \".\"\n \n for i in range(n):\n for j in range(n):\n if(matriz[i][j] == \"#\"):\n print(\"NO\")\n return\n \n print(\"YES\")\n \n\n\ndef main():\n\n matriz = []\n\n velhas = 0\n\n n = int(input())\n\n for i in range(n):\n linha = input()\n for i in range(n):\n matriz.append([])\n if(linha[i] == \"#\"):\n velhas += 1\n matriz[i].append(\"#\")\n else:\n matriz[i].append(\".\")\n\n\n if(velhas % 5 != 0):\n print(\"NO\")\n return\n if(matriz[0][0] == \"#\" or matriz[n - 1][0] == \"#\" or matriz[0][n - 1] == \"#\" or matriz[n - 1][n - 1] == \"#\"):\n print(\"NO\")\n return\n else:\n verificar_cruzes(matriz, n)\n\n\n\nmain()\n\t \t\t \t\t\t\t \t \t\t\t\t \t\t\t\t\t", "from math import gcd\r\n\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n res = 'YES'\r\n cnt = []\r\n for i in range(n):\r\n cnt.append(['.'])\r\n s = input()\r\n\r\n for c in s:\r\n cnt[i].append(c)\r\n\r\n for i in range(n):\r\n for j in range(n+1):\r\n if cnt[i][j]=='#':\r\n if i>=n-2 or j==n:\r\n res = \"NO\"\r\n continue\r\n if cnt[i+1][j]=='.' or cnt[i+1][j-1]=='.' or cnt[i+1][j+1]=='.':\r\n res = \"NO\"\r\n continue\r\n if cnt[i+2][j]=='.':\r\n res='NO'\r\n cnt[i][j]='.'\r\n cnt[i+1][j]='.'\r\n cnt[i+2][j]='.'\r\n cnt[i+1][j-1]='.'\r\n cnt[i+1][j+1]='.'\r\n print(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "n = int(input())\r\nli = []\r\nfor i in range(n):\r\n l = input()\r\n s = []\r\n for i in l: s.append(i)\r\n li.append(s)\r\ncount = 0\r\nfor i in li:\r\n for j in i:\r\n if j == \"#\":\r\n count +=1\r\nyes = True\r\nif count%5!=0:\r\n print(\"NO\")\r\nelse: \r\n for i in range(n):\r\n for j in range(n):\r\n if li[i][j]==\"#\":\r\n try:\r\n li[i][j] = li[i+1][j] = li[i+2][j] = li[i+1][j+1] = li[i+1][j-1] = \".\"\r\n except:\r\n yes = False\r\n for i in li:\r\n if \"#\" in i:\r\n yes = False\r\n if yes: print(\"YES\")\r\n else: print(\"NO\")\r\n", "n = int(input())\nar = [list(input()) for _ in range(n)]\nfor i in range(1, n-1):\n for j in range(1, n-1):\n if ar[i][j] == \"#\" and ar[i-1][j] == \"#\" and ar[i+1][j] == \"#\" and ar[i][j+1] == \"#\" and ar[i][j-1] == \"#\":\n ar[i][j] = ar[i+1][j] = ar[i-1][j] = ar[i][j+1] = ar[i][j-1] = \".\"\nflag = True\nfor i in range(n):\n if ar[i].count(\"#\") > 0:\n flag = False\n break\nprint(\"YES\" if flag else \"NO\")", "my = [0, 1, 1, 1, 2]\r\nmx = [0, 0, -1, 1, 0]\r\n\r\nn = int(input())\r\n\r\nboard = []\r\nfor i in range(n):\r\n board.append(list(input()))\r\n\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if board[i][j] == '#':\r\n for (dy, dx) in zip(my, mx):\r\n y = i + dy\r\n x = j + dx\r\n if y < 0 or y >= n or x < 0 or x >= n:\r\n flag = False\r\n break\r\n if board[y][x] == '.':\r\n flag = False\r\n board[y][x] = '.'\r\n '''\r\n for line in board:\r\n print(''.join(line))\r\n print('--')\r\n '''\r\n if flag == False:\r\n break\r\nprint('YES' if flag else 'NO')", "n = int(input())\r\nA = [list(input()) for _ in range(n)]\r\n\r\nfor x in range(1, n-1):\r\n for y in range(1, n-1):\r\n if A[x-1][y]=='#' and A[x+1][y]=='#' and not '.' in A[x][y-1:y+2]:\r\n A[x][y-1:y+2] = '...'\r\n A[x-1][y], A[x+1][y] = '..'\r\n\r\nprint('NO' if any('#' in row for row in A) else 'YES')", "n = int(input())\ns = []\nfor _ in range(n):\n s.append(list(input()))\n#print(s)\nfor i in range(n):\n for j in range(n):\n if s[i][j]=='#':\n if i>n-3:\n print('NO')\n exit(0)\n if j==0 or j==n-1:\n print('NO')\n exit(0)\n if s[i+1][j-1]=='#' and s[i+1][j]=='#' and s[i+1][j+1]=='#' and s[i+2][j]=='#':\n s[i + 1][j - 1] = '.'\n s[i + 1][j] = '.'\n s[i + 1][j + 1] = '.'\n s[i + 2][j] = '.'\n else:\n print('NO')\n exit(0)\nprint('YES')", "c=set()\r\nfor i in range(int(input())):\r\n row=input()\r\n s=[(i,j) for j in range(len(row)) if row[j]=='#']\r\n c|=set(s)\r\n for i,j in s:\r\n p=set([(i,j),(i-1,j),(i-1,j-1),(i-1,j+1),(i-2,j)])\r\n if p<=c:c-=p\r\nprint('YNEOS'[len(c)!=0::2])", "n = int(input())\r\nal = []\r\nsl = set()\r\nfor i in range(n):\r\n al.append(list(input()))\r\nfor i in range(n-2):\r\n for j in range(1, n-1):\r\n if al[i][j]==al[i+1][j]==al[i+1][j-1]==al[i+1][j+1]==al[i+2][j]==\"#\":\r\n al[i][j]=al[i+1][j]=al[i+1][j-1]=al[i+1][j+1]=al[i+2][j]=\".\"\r\nfor i in range(n):\r\n sl=sl.union(set(al[i]))\r\nif len(sl)==1:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ndef solve():\r\n n=int(input());a=[]\r\n for r in range(n):s=list(input());a.append(s)\r\n for r in range(n):\r\n\r\n for c in range (n):\r\n\r\n if (a[r][c]=='#' and (c==0 or c==n-1)) or (a[r][c]=='#' and r>=n-2):print(\"NO\");return\r\n\r\n if a[r][c]==\"#\":\r\n\r\n if a[r][c]==a[r+1][c]==a[r+1][c-1]==a[r+1][c+1]==a[r+2][c]==\"#\":\r\n\r\n a[r][c],a[r+1][c],a[r+1][c-1],a[r+1][c+1],a[r+2][c]=\".\",\".\",\".\",\".\",\".\"\r\n\r\n else:print(\"NO\");return\r\n print(\"YES\")\r\nsolve()\r\n#for _ in range(int(input())):solve()", "def str_inp(n):\r\n return [list(input()) for x in range(n)]\r\n\r\n\r\nn = int(input())\r\na = str_inp(n)\r\nfor i in range(1, n - 1):\r\n for j in range(1, n - 1):\r\n if a[i][j] == '#':\r\n exp = (a[i - 1][j] == '#') and (a[i + 1][j] == '#') and (a[i][j - 1] == '#') and (a[i][j + 1] == '#')\r\n if exp:\r\n a[i - 1][j] = a[i + 1][j] = a[i][j - 1] = a[i][j + 1] = a[i][j] = '.'\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == '#':\r\n exit(print('NO'))\r\nprint('YES')\r\n", "h = int(input())\nl = [c == '#' for _ in range(h) for c in input()]\nw = len(l) // h\npattern = (0, w - 1, w, w + 1, 2 * w)\nfor idx in range(1, (h - 2) * w - 1):\n if all(l[_ + idx] for _ in pattern):\n for _ in pattern:\n l[_ + idx] = False\nprint(('YES', 'NO')[any(l)])\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\tk = list(input())\r\n\ta.append(k)\r\nl=0\r\nfor i in range(1,len(a)-1):\r\n\tfor j in range(1,len(a)-1):\r\n\t\tif(a[i][j]=='#' and a[i+1][j]=='#' and a[i-1][j]=='#' and a[i][j+1]=='#' and a[i][j-1]=='#'):\r\n\t\t\tl+=5\r\n\t\t\ta[i][j]='+'\r\n\t\t\ta[i+1][j]='+'\r\n\t\t\ta[i-1][j]='+'\r\n\t\t\ta[i][j+1]='+'\r\n\t\t\ta[i][j-1]='+'\r\nplu = 0\r\nhas=0\r\nfor i in range(len(a)):\r\n\tplu+=a[i].count('+')\r\n\thas+=a[i].count('#')\r\nif(plu+has==l):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\t\t\t", "mat = [] # 0 is '.'; 1 is unused \"#\" ; 2 is used'#';\nn = int(input())\nfor i in range(0,n):\n line = list(input())\n mat.append([])\n for j in range(0,n):\n if line[j]=='.':\n mat[i].append(0)\n else:\n mat[i].append(1)\nfor i in range(1,n-1):\n for j in range(1,n-1):\n if mat[i][j] == 1 and mat[i+1][j]==1 and mat[i-1][j]==1 and mat[i][j+1]==1 and mat[i][j-1]==1:\n mat[i][j] = 2\n mat[i+1][j] = 2\n mat[i-1][j] = 2\n mat[i][j+1] = 2\n mat[i][j-1] = 2\nunused_harshtags = 0\nfor i in range(0,n):\n for j in range(0,n):\n if mat[i][j] ==1:\n unused_harshtags +=1\nif unused_harshtags >0:\n print(\"NO\")\nelse:\n print(\"YES\")\n \t \t \t\t \t\t\t\t\t \t\t\t\t\t", "import sys,math\r\nfrom collections import defaultdict,Counter\r\ndef li(): return list(map(int,sys.stdin.readline().split()))\r\ndef ls(): return list(map(int,list(input())))\r\ndef la(): return list(input())\r\ndef ii(): return int(input())\r\nn = ii()\r\nmatrix= []\r\nfor _ in range(n):\r\n matrix.append(la())\r\nfor i in range(1,n-1):\r\n for j in range(1,n-1):\r\n if matrix[i][j] == \"#\" and matrix[i-1][j] == \"#\" and matrix[i+1][j] == \"#\" and matrix[i][j-1] == \"#\" and matrix[i][j+1] == \"#\" :\r\n matrix[i][j] = \".\"\r\n matrix[i-1][j] = \".\"\r\n matrix[i+1][j] = \".\"\r\n matrix[i][j-1] = \".\"\r\n matrix[i][j+1] = \".\"\r\n \r\nfor i in range(n):\r\n flag = 0\r\n for j in range(n):\r\n if matrix[i][j] == \"#\":\r\n flag = 1\r\n break\r\n if flag :\r\n break\r\n \r\nif flag :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "n = int(input())\r\na = [[x for x in input()] for x in range(n)]\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif (i>0 and i+1<n and j>0 and j+1<n and\r\n\t\ta[i-1][j] == '#' and a[i][j] == '#' and \r\n\t\ta[i+1][j] == '#' and a[i][j-1] == '#' and\r\n\t\ta[i][j+1] == '#'):\r\n\t\t\ta[i-1][j] = a[i][j] = a[i+1][j] = '.'\r\n\t\t\ta[i][j-1] = a[i][j+1] = '.'\r\n\r\nkey = True\r\nfor i in a:\r\n\tif '#' in i:\r\n\t\tkey = False\r\nprint('YES' if key else 'NO')", "n = int(input())\na = []\nfor i in range(n):\n\ta.append(list(1 if c == '#' else 0 for c in input()))\nfor i in range(n):\n\tfor j in range(n):\n\t\tif a[i][j]:\n\t\t\tif i + 2 >= n or j + 1 >= n or j == 0:\n\t\t\t\tprint('NO')\n\t\t\t\texit()\n\t\t\tif a[i + 1][j] + a[i + 2][j] + a[i + 1][j - 1] + a[i + 1][j + 1] != 4:\n\t\t\t\tprint('NO')\n\t\t\t\texit()\n\t\t\ta[i][j] = a[i + 1][j] = a[i + 2][j] = a[i + 1][j - 1] = a[i + 1][j + 1] = 0\nprint('YES')\n", "n = int(input())\n\nmatrix = []\n\nfor i in range(n):\n row = input()\n matrix.append([*row])\n\ncount = 0\nimp = False\n\nfor i in range(n):\n for j in range(n):\n if matrix[i][j] == \"#\":\n if i > n - 2 or j == 0 or j == n - 1:\n imp = True\n break\n else:\n if matrix[i+1][j-1] == '#' \\\n and matrix[i+1][j] == '#' \\\n and matrix[i+1][j+1] == '#' \\\n and matrix[i+2][j] == '#':\n matrix[i][j] = '.'\n matrix[i+1][j-1] = '.'\n matrix[i+1][j] = '.'\n matrix[i+1][j+1] = '.'\n matrix[i+2][j] = '.'\n else:\n imp = True\n break\n \n if imp:\n break\n\nif imp:\n print(\"NO\")\nelse:\n print(\"YES\")", "n = int(input())\r\nd = []\r\nfor i in range(n):\r\n d.append(list(input()))\r\nfor i in range(1, n - 1):\r\n for j in range(1, n - 1):\r\n if d[i][j] == '#' and d[i - 1][j] == '#' and d[i + 1][j] == '#' and d[i][j - 1] == '#' and d[i][j + 1] == '#':\r\n d[i][j] = d[i - 1][j] = d[i + 1][j] = d[i][j - 1] = d[i][j + 1] = '.'\r\nfor i in range(n):\r\n for j in range(n):\r\n if d[i][j] == '#':\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n \r\n", "\r\n\r\n\r\ndef solve(n , lst):\r\n for i in range(n):\r\n for j in range(n):\r\n if lst[i][j] == '#' :\r\n if i < n - 2 and 1 <= j <= n - 2 and lst[i+1][j-1] == '#' and lst[i+1][j] == '#' and lst[i+1][j+1] == '#' and lst[i+2][j] == '#':\r\n lst[i][j] = '.'\r\n lst[i+1][j-1] = '.'\r\n lst[i+1][j] = '.'\r\n lst[i+1][j+1] = '.'\r\n lst[i+2][j] = '.'\r\n else:\r\n return 'NO'\r\n return 'YES'\r\n\r\nn = int(input())\r\ng = []\r\nfor i in range(n):\r\n g.append(list(input()))\r\n\r\nprint(solve(n , g))", "n = int(input())\r\na = [[0]*(n+1) for i in range(n+1)]\r\nans = 0\r\n\r\nfor i in range(n):\r\n l = input()\r\n for j in range(n):\r\n a[i][j]=l[j]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j] == '#' and a[i + 1][j] == '#' and a[i - 1][j] == '#' and a[i][j + 1] == '#' and a[i][j - 1] == '#':\r\n a[i][j] = a[i + 1][j] = a[i - 1][j] = a[i][j + 1] = a[i][j - 1] = 0\r\n ans += 5\r\n elif a[i][j] == '.':\r\n ans += 1\r\n\r\nif ans == n * n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(input()))\r\nk = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j] == '#':\r\n if i+2<=n-1 and j-1>=0 and j+1<=n-1:\r\n if arr[i+1][j-1] == '#' and arr[i+1][j] == '#' and arr[i+1][j+1] == '#' and arr[i+2][j] == '#':\r\n arr[i+1][j-1] = '.'\r\n arr[i+1][j] = '.'\r\n arr[i+1][j+1] = '.'\r\n arr[i+2][j] = '.'\r\n arr[i][j] = '.'\r\n else:\r\n k = 0\r\n break\r\n else:\r\n k = 0\r\n break\r\nif k == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\ndef f():\r\n n = int(input())\r\n t = [list(input()) for i in range(n)]\r\n for i in range(n - 2):\r\n if t[i][0] == '#' or t[i][-1] == '#': return 'NO'\r\n for j in range(1, n - 1):\r\n if t[i][j] == '#':\r\n if '#' == t[i + 1][j - 1] == t[i + 1][j] == t[i + 1][j + 1] == t[i + 2][j]:\r\n t[i + 1][j - 1] = t[i + 1][j] = t[i + 1][j + 1] = t[i + 2][j] = '.'\r\n else: return 'NO'\r\n if '#' in t[-2] or '#' in t[-1]: return 'NO'\r\n return 'YES'\r\nprint(f())\r\n", "n = int(input())\r\na = [list(input()) for i in range(n)]\r\nfor x in range(n):\r\n\tfor y in range(n):\r\n\t\tif a[x][y] == '#':\r\n\t\t\tfor dx, dy in (1,-1),(1,0),(1,1),(2,0):\r\n\t\t\t\txx = x + dx\r\n\t\t\t\tyy = y + dy\r\n\t\t\t\tif xx < 0 or xx >= n or yy < 0 or yy >= n or a[xx][yy] != '#':\r\n\t\t\t\t\tprint(\"NO\")\r\n\t\t\t\t\texit(0)\r\n\t\t\t\telse:\r\n\t\t\t\t\ta[xx][yy] = '.'\r\nprint('YES')\r\n", "n = int(input())\na = [list(input()) for _ in range(n)]\ndef check(i,j):\n if (i,j) in [(0,0),(0,n-1),(n-1,0),(n-1,n-1)]:\n return False\n if(i >= n-2 or j == 0 or j == n-1):\n return False\n if a[i+1][j] != '#' or a[i+1][j-1] != '#' or a[i+1][j+1] != '#' or a[i+2][j] != '#':\n return False\n a[i+1][j] = '.'\n a[i+1][j+1] = '.'\n a[i+1][j-1] = '.'\n a[i+2][j] = '.'\n a[i][j] = '.'\n return True\n\nfor i in range(n):\n for j in range(n):\n if a[i][j] == '#':\n if not check(i,j):\n print(\"NO\")\n # print(a)\n exit()\nprint(\"YES\")", "def check_board(b):\r\n possible = 'YES'\r\n b_size = len(b)\r\n for i in range(board_size):\r\n for j in range(b_size):\r\n if b[i][j] == \"#\":\r\n if j == 0 or j == b_size - 1 or i > b_size - 3:\r\n possible = 'NO'\r\n return possible\r\n elif b[i+1][j-1] != \"#\" or b[i+1][j] != \"#\" or b[i+1][j+1] != \"#\" or b[i+2][j] != \"#\":\r\n possible = 'NO'\r\n return possible\r\n else:\r\n b[i + 1][j - 1] = \"used\"\r\n b[i + 1][j] = \"used\"\r\n b[i + 1][j + 1] = \"used\"\r\n b[i + 2][j] = \"used\"\r\n return possible\r\n\r\n\r\nif __name__ == \"__main__\":\r\n board_size = int(input())\r\n board = []\r\n for n in range(board_size):\r\n line = list(input())\r\n board.append(line)\r\n print(check_board(board))", "def solve(grid, n):\r\n for i in range(n):\r\n for j in range(n):\r\n if(i >= n-2):\r\n if(grid[i][j] == '#'):\r\n return 'NO'\r\n elif(grid[i][j] == '#'):\r\n if(grid[i+1][j-1] == '.' or grid[i+1][j] == '.' or grid[i+1][j+1] == '.' or grid[i+2][j] == '.'):\r\n return 'NO'\r\n else:\r\n grid[i][j] = '.'\r\n grid[i+1][j-1] = '.'\r\n grid[i+1][j] = '.'\r\n grid[i+1][j+1] = '.'\r\n grid[i+2][j] = '.'\r\n return 'YES'\r\n\r\nn = int(input())\r\ngrid = [list(input()) for _ in range(n)]\r\nprint(solve(grid, 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\n\r\ndef vaild(x,y):\r\n return 0<=x<n and 0<=y<n and arr[x][y]==\"#\"\r\n\r\ndef check(r,c):\r\n ind=[(r+1,c),(r+2,c),(r+1,c-1),(r+1,c+1)]\r\n for i in ind:\r\n x,y=i\r\n if not vaild(x,y):\r\n return False\r\n arr[x][y]=\"x\"\r\n return True\r\n\r\nn=int(input()) ; arr=[] ; ans=False\r\nfor i in range(n):\r\n s=list(input().strip()) ; arr.append(s)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j]==\"#\":\r\n if not check(i,j):\r\n print(\"NO\") ;ans=True; break\r\n if ans:\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\narr = [list(input()) for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if arr[i][j] == '#':\r\n if i > 0 and arr[i-1][j] == '#' and j > 0 and arr[i][j-1] == '#' and i < n-1 and arr[i+1][j] == '#' and j < n-1 and arr[i][j+1] == '#':\r\n arr[i][j] = '.'\r\n arr[i-1][j] = '.'\r\n arr[i+1][j] = '.'\r\n arr[i][j-1] = '.'\r\n arr[i][j+1] = '.'\r\n\r\nf = True\r\nfor i in arr:\r\n if '#' in i:\r\n f = False\r\n\r\nprint(\"YES\" if f else \"NO\")", "n = int(input())\r\ns = [list(input()) for _ in range(n)]\r\ndef TryCross(i, j):\r\n if 0 <= i < n - 2 and 0 < j < n - 1:\r\n c = [(i, j), (i + 1, j - 1), (i + 1, j), (i + 1, j + 1), (i + 2, j)]\r\n if not all(s[x][y] == \"#\" for x, y in c):\r\n return False\r\n for x, y in c:\r\n s[x][y] = \".\"\r\n return True\r\n return False\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i][j] == \"#\" and not TryCross(i, j):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "def verify_cross(i, j, matrix):\n\n for k in range(3):\n try:\n if matrix[i+k][j] == '0':\n return False\n except:\n return False\n\n for k in [-1, 0, 1]:\n try:\n if matrix[i+1][j+k] == '0':\n return False\n \n except:\n return False\n \n return True\n\ndef main():\n\n n = int(input())\n\n matrix = []\n crosses = \"\"\n\n for i in range(n):\n st_row = input()\n crosses += st_row\n row = [i for i in st_row]\n matrix.append(row)\n\n if (crosses.count(\"#\") % 5 != 0):\n print(\"NO\")\n return\n \n for i in range(n):\n for j in range(n):\n\n if matrix[i][j] == '#':\n if verify_cross(i,j, matrix):\n\n try:\n matrix[i+2][j] = '0'\n matrix[i][j] = '0'\n matrix[i+1][j] = '0'\n matrix[i+1][j-1] = '0'\n matrix[i+1][j+1] = '0'\n \n except:\n print('NO')\n return\n\n else:\n print('NO')\n return\n\n\n print('YES')\n\n\nmain()\n \t \t\t \t \t\t \t \t\t \t\t \t\t\t", "k = int(input())\r\na = []\r\nfor i in range(k):\r\n ai = []\r\n s = input()\r\n for ch in s:\r\n if ch != '.':\r\n ai.append(1)\r\n else:\r\n ai.append(0)\r\n a.append(ai)\r\nfailed = False\r\nfor i in range(k):\r\n for j in range(k):\r\n if a[i][j] == 1:\r\n if j == 0 or j == k - 1 or i > k - 3:\r\n failed = True\r\n break\r\n if a[i + 1][j - 1] == a[i + 1][j] == a[i + 1][j + 1] == a[i + 2][j] == 1:\r\n a[i][j] = 0\r\n a[i + 1][j - 1] = 0\r\n a[i + 1][j] = 0\r\n a[i + 1][j + 1] = 0\r\n a[i + 2][j] = 0\r\n else:\r\n failed = True\r\n break\r\n if failed:\r\n break\r\nif not failed:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def pos_possivel(i, j, n):\n if i < 0 or j < 0:\n return False\n if i >= n or j >= n:\n return False\n return True\n\ndef posso_desenhar_cruz(board, n, i, j):\n board[i][j] = \".\"\n for k in range(-1, 2):\n if not pos_possivel(i+1, j+k, n): return False\n if board[i+1][j+k] == \".\": return False\n board[i+1][j+k] = \".\"\n if not pos_possivel(i+2, j, n): return False\n if board[i+2][j] == \".\": return False\n board[i+2][j] = \".\"\n return True\n \n\ndef solve(board, c_count, n):\n if c_count % 5 != 0: \n return False\n for i in range(n):\n for j in range(n):\n if board[i][j] == \"#\":\n if not posso_desenhar_cruz(board, n, i, j):\n return False\n \n return True\n\nn = int(input())\n\nboard = []\nc_count = 0\n\nfor i in range(n):\n line = []\n texto = [c for c in input()]\n for j in range(n):\n line.append(texto[j])\n if texto[j] == \"#\": c_count += 1\n board.append(line)\n\nif solve(board, c_count, n):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t\t \t \t\t \t\t \t \t\t\t\t \t\t\t", "n=int(input())\r\na=[[] for i in range(n)]\r\nfor i in range(n):\r\n s=input().strip()\r\n for j in s:\r\n a[i]+=[j]\r\nkr=0\r\nfor i in range(n):\r\n for j in range(n):\r\n #print(i,j)\r\n if a[i][j]=='#':\r\n kr+=1\r\n if 0<i<n-1 and 0<j<n-1 and a[i][j]=='#':\r\n if a[i][j-1]==a[i][j+1]==a[i-1][j]==a[i+1][j]=='#':\r\n kr-=3\r\n a[i][j-1],a[i][j+1],a[i-1][j],a[i+1][j],a[i][j]='.','.','.','.','.'\r\nif kr:\r\n print('NO')\r\nelse:\r\n print('YES')", "def check():\n for i in range(n):\n for j in range(n):\n if board[i][j] == '#':\n return False\n return True\n\nn = int(input())\nboard = []\nfor i in range(n):\n board.append([char for char in input()])\n\nfor i in range(1,n-1):\n for j in range(1,n-1):\n if board[i][j] == '#' and board[i][j-1] == board[i][j+1] == board[i-1][j] == board[i+1][j] == '#':\n board[i][j] = board[i][j-1] = board[i][j+1] = board[i-1][j] = board[i+1][j] = '@'\n\nprint(\"YES\" if check() else \"NO\")\n\t\t\t \t\t \t \t\t\t \t\t \t \t\t\t \t", "n=int(input())\r\nl=[]\r\ns=0\r\nfor i in range(n):\r\n o=input()\r\n s+=o.count(\"#\")\r\n l+=[list(o)]\r\nq=[[1 for i in range(n)]for i in range(n)]\r\nfor i in range(1,n-1):\r\n for j in range(1,n-1):\r\n if l[i][j]==\"#\"and q[i][j]:\r\n if l[i+1][j]==\"#\" and q[i+1][j]:\r\n if l[i-1][j]==\"#\" and q[i-1][j]:\r\n if l[i][j+1]==\"#\" and q[i][j+1]:\r\n if l[i][j-1]==\"#\" and q[i][j-1]:\r\n s-=5\r\n q[i+1][j]=q[i-1][j]=q[i][j-1]=q[i][j+1]=0\r\nprint(\"YNEOS\"[s!=0::2])", "grid = []\r\nyes = True\r\nsize = int(input())\r\nfor x in range(size):\r\n grid.append(list(input()))\r\nfor y in range(size):\r\n if not yes:\r\n break\r\n for x in range(size):\r\n if grid[y][x] == \"#\":\r\n if x == 0 or x == size-1 or y >= size-2:\r\n print(\"NO\")\r\n yes = False\r\n break\r\n if grid[y+1][x-1] == \".\" or grid[y+1][x] == \".\" or grid[y+1][x+1] == \".\" or grid[y+2][x] == \".\":\r\n print(\"NO\")\r\n yes = False\r\n break\r\n else:\r\n grid[y+1][x-1] = \".\"\r\n grid[y+1][x] = \".\"\r\n grid[y+1][x+1] = \".\"\r\n grid[y+2][x] = \".\"\r\nif yes:\r\n print(\"YES\")", "def f(a,b,c):\r\n if a[1]=='#' and b==['#','#','#'] and c[1]=='#':\r\n return 1\r\n return 0\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(input()))\r\nfor i in range(n-2):\r\n for j in range(n-2):\r\n if f(a[i][j:j+3],a[i+1][j:j+3],a[i+2][j:j+3])!=0:\r\n a[i][j+1]='.'\r\n a[i+1][j:j+3]='...'\r\n a[i+2][j+1]='.'\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i][j]=='#':\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\") \r\n \r\n \r\n \r\n", "\r\n\r\n\r\nt=[]\r\n\r\nn = int(input())\r\n\r\n\r\nfor j in range(n):\r\n y= list(input())\r\n\r\n t.append(y)\r\n\r\n\r\nfor i in range(1,n-1):\r\n for j in range(1,n-1):\r\n\r\n if t[i][j]=='#' and t[i+1][j]=='#' and t[i-1][j]=='#'and t[i][j+1]=='#'and t[i][j-1]=='#':\r\n t[i][j]='a'\r\n t[i+1][j]='a'\r\n t[i-1][j]='a'\r\n t[i][j+1]='a'\r\n t[i][j-1]='a'\r\nh=0\r\nfor i in t:\r\n \r\n\r\n if '#' in i:\r\n print('NO')\r\n h+=1\r\n break\r\n\r\nif h==0:\r\n print('YES')\r\n", "from itertools import chain\n\nif __name__ == '__main__':\n n = int(input())\n tab = [list(c == '#'for c in input()) for _ in range(n)]\n flag = {True}.issubset(chain.from_iterable(tab))\n if(flag):\n for i in range(1, n-1):\n for j in range(1, n-1):\n if tab[i-1][j] and tab[i][j-1] and tab[i][j] and tab[i][j+1] and tab[i+1][j]:\n tab[i-1][j] = False\n tab[i][j-1] = False\n tab[i][j] = False\n tab[i][j+1] = False\n tab[i+1][j] = False\n flag = {True}.issubset(chain.from_iterable(tab))\n if(flag):\n print('NO')\n else:\n print('YES')\n\n \t\t\t \t \t \t \t \t \t \t" ]

[ "n= int(input())\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\nw = input()\r\nlet = input()\r\nbad=[]\r\nfor i in range(len(w)):\r\n bad.append(True)\r\nfor i in range(len(w)):\r\n mx = 0\r\n for j in range(n):\r\n if w[i:].lower().startswith(b[j].lower()):\r\n mx =max(mx,len(b[j]))\r\n for j in range(mx):\r\n bad[i + j] = False\r\nans = ''\r\nfor i in range(len(w)):\r\n if bad[i]:\r\n ans += w[i]\r\n else:\r\n if w[i].lower() == let:\r\n newlet = 'a' if let != 'a' else 'b'\r\n ans += newlet.lower() if w[i].lower() == w[i] else \\\r\n newlet.upper()\r\n else:\r\n if w[i].lower() == w[i]:\r\n ans += let\r\n else:\r\n ans+=let.upper()\r\n\r\nprint(ans)\r\n", "\r\ndef print_ranges(r,s):\r\n for i in r:\r\n print(s[i[0]:i[1]])\r\ndef replace_ranges(r,s,char):\r\n final_s=''\r\n for i in range(len(r)):\r\n if r[i]:\r\n if s[i].lower()==char:\r\n #print(\"after low==char\")\r\n if s[i].islower():\r\n if s[i]=='a':\r\n final_s+='b'\r\n else:\r\n final_s+='a'\r\n else:\r\n if s[i]=='A':\r\n #print('from A should B')\r\n final_s+='B'\r\n else:\r\n final_s+='A'\r\n else:\r\n if s[i].isupper():\r\n final_s+=char.upper()\r\n else:\r\n final_s+=char\r\n else:\r\n final_s += s[i]\r\n return final_s\r\n \r\nn = int(input())\r\nfd = [input().lower() for i in range(n)]\r\ns = input()\r\ns_lower= s.lower()\r\ns = list(s)\r\nchar = input().lower()\r\nr = [False]*len(s)\r\nfinal_s = ''\r\nfor i in fd:\r\n for j in range(len(s)-len(i)+1):\r\n for k in range(len(i)):\r\n if s_lower[j+k]!=i[k]:\r\n break\r\n else:\r\n for k in range(len(i)):\r\n r[j+k]=True\r\nfinal_s=replace_ranges(r,s,char)\r\n#s= ''.join(s)\r\nprint(final_s)\r\n\r\n \r\n", "s = [input().lower() for i in range(int(input()))]\r\nu, x = input(), input()\r\ny = 'ab'[x == 'a']\r\nd = [(x, y), (x.upper(), y.upper())]\r\nv = u.lower()\r\nn = len(v)\r\nk = [0] * (n + 1)\r\nfor q in s:\r\n i = v.find(q)\r\n while i != -1:\r\n k[i] += 1\r\n k[i + len(q)] -= 1\r\n i = v.find(q, i + 1)\r\np = ''\r\nfor i in range(n):\r\n k[i + 1] += k[i]\r\n p += d[u[i] != v[i]][x == v[i]] if k[i] else u[i]\r\nprint(p)", "n= int(input())#how many word\nb = []\nfor i in range(n):\n b.append(input())# put the word in a list\nw = input()#what we whant to change\nlet = input()#which we change in to \nbad=[]\nfor i in range(len(w)):\n bad.append(True)\nfor i in range(len(w)):\n mx = 0\n for j in range(n):\n if w[i:].lower().startswith(b[j].lower()):\n mx =max(mx,len(b[j]))\n for j in range(mx):\n bad[i + j] = False\nans = ''\nfor i in range(len(w)):\n if bad[i]:\n ans += w[i]\n else:\n if w[i].lower() == let:\n newlet = 'a' if let != 'a' else 'b'\n ans += newlet.lower() if w[i].lower() == w[i] else \\\n newlet.upper()\n else:\n if w[i].lower() == w[i]:\n ans += let\n else:\n ans+=let.upper()\nprint(ans)\n\n\t\t \t\t\t\t\t \t \t\t\t \t\t \t \t\t \t\t\t" ]

[ "'''Vipin'''\n# cook your dish here\nn,m,a=map(int,input().split())\nif a>n and a>m:\n print(\"1\")\nelse:\n if n%a>0:\n n=n//a+1 \n else:\n n=n//a\n \n if m%a>0:\n m=(m//a)+1 \n else:\n m=m//a\n \n ans = n*m \n print(ans)\n \n \n\t\t \t \t\t\t\t\t\t \t\t \t\t \t\t \t\t", "from math import ceil\r\n\r\np=input()\r\na = p.split(' ')\r\nm=int(a[0])\r\nn=int(a[1])\r\na=int(a[2])\r\n\r\n\r\nprint(ceil(m/a)*ceil(n/a))", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\na = int(s[2])\r\nvert = 0\r\nhor = 0\r\nif n % a == 0:\r\n vert = n // a\r\nelse:\r\n vert = n // a + 1\r\nif m % a == 0:\r\n hor = m // a\r\nelse:\r\n hor = m // a + 1\r\nprint(vert*hor)", "n, m, a = map(int, input().split())\r\nif n % a == 0:\r\n r1 = n // a\r\nelse: r1 = (n // a) + 1\r\n\r\nif m % a == 0:\r\n r2 = m // a\r\nelse: r2 = (m // a) + 1\r\nprint(r1 * r2)", "from math import ceil\nn,m,a=map(int, input().split())\n\nprint(ceil(n/a)*ceil(m/a))", "n, m, a = input().split()\nn, m, a = int(n), int(m), int(a)\nx = (n + a - 1) / a\ny = (m + a - 1) / a\nprint(int(x)*int(y))\n\n", "n, m, a = map(int, input().split())\r\nwidth_stones = -(-n // a) \r\nlength_stones = -(-m // a) \r\ntotal_stones = width_stones * length_stones\r\nprint(total_stones)", "n,m,a=map(int,input().split())\r\nl1=n//a\r\nl2=m//a\r\nif n//a<n/a:\r\n l1=n//a+1\r\nif m//a<m/a:\r\n l2=m//a +1\r\nsoni=l1*l2\r\nprint(soni)\r\n", "l=list(map(int,input().split()))\r\nm,n,a=l[0],l[1],l[2]\r\nans=((m-1)//a+1)*((n-1)//a+1)\r\nprint(ans)", "a,b,c=map(int,input().split())\r\nn=a//c;\r\nif (a%c>0):\r\n n=n+1\r\nm=b//c\r\nif (b%c>0):\r\n m=m+1\r\nprint(n*m)", "import math\n\n# Read input values for n, m, and b\nn, m, b = map(int, input().split())\n\n# Calculate the number of flagstones needed for the rows (lengthwise)\nrow = math.ceil(n / b)\n\n# Calculate the number of flagstones needed for the columns (widthwise)\ncol = math.ceil(m / b)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = row * col\n\n# Print the total number of flagstones\nprint(total_flagstones)\n \t \t \t \t\t\t\t \t \t \t\t \t \t", "x=input()\r\nn1,m1,a1=x.split()\r\nn,m,a=int(n1),int(m1),int(a1)\r\nif m%a==0 :\r\n v1=m//a\r\nelse :\r\n v1=m//a + 1 \r\nif n%a==0 :\r\n v2=n//a\r\nelse :\r\n v2=n//a + 1\r\nprint(v1*v2) ", "import math\r\n\r\ndef calculate_flagstones(n, m, a):\r\n length_flagstones = math.ceil(n / a)\r\n width_flagstones = math.ceil(m / a)\r\n total_flagstones = length_flagstones * width_flagstones\r\n return total_flagstones\r\n\r\n\r\nn, m, a = map(int, input().split())\r\nprint(calculate_flagstones(n, m, a))", "import math\nn,m,a = [int (i) for i in input().split()]\nresult = math.ceil(n/a)*math.ceil(m/a)\nprint(result)\n \t \t \t \t \t\t\t\t\t\t\t \t\t\t \t", "n, m, a = map(int, input().split())\r\nrow, col = (n//a) + 1 if n % a else (n//a), (m//a) + 1 if m % a else (m//a)\r\nprint(row*col)\r\n", "inp = input()\r\ninp = inp.split()\r\nfor i in range(3):\r\n inp[i] = int(inp[i])\r\nD1 = inp[0]/inp[2]\r\nif D1 > int(D1):\r\n D1 = int(D1)+1\r\nelse:\r\n D1 = int(D1)\r\nD2 = inp[1]/inp[2]\r\nif D2 > int(D2):\r\n D2 = int(D2)+1\r\nelse:\r\n D2 = int(D2)\r\n\r\n\r\n \r\nnum_b = D1*D2\r\nprint(num_b)\r\n", "def main():\r\n [n, m, a] = [int(x) for x in input().split()]\r\n return((n // -a)*(m // -a))\r\n\r\nif __name__ == \"__main__\":\r\n print(main())\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nwidth_stones = math.ceil(n / a)\r\nlength_stones = math.ceil(m / a)\r\n\r\nresult = width_stones * length_stones\r\nprint(result)", "x,y,z=map(int,input().split())\r\nif x%z==0:\r\n x=x//z\r\nelse:\r\n x=x//z+1\r\nif y%z==0:\r\n y=y//z\r\nelse:\r\n y=y//z+1\r\nprint(x*y) ", "# Read the input numbers\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required for the length of the square\r\nlength_flagstones = n // a\r\nif n % a != 0:\r\n length_flagstones += 1\r\n\r\n# Calculate the number of flagstones required for the width of the square\r\nwidth_flagstones = m // a\r\nif m % a != 0:\r\n width_flagstones += 1\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\n# Print the total number of flagstones\r\nprint(total_flagstones)\r\n", "# Codeforces 1A Theatre Square\n\ndef tiles(size, length):\n\treqd = size // length\n\trem = size % length\n\treturn reqd if rem == 0 else reqd + 1\n\nn, m, a = (int(i) for i in input().split())\nprint(tiles(n, a) * tiles(m, a))", "n, m, a = (int(i) for i in input().split())\r\nh = n // a\r\nif n % a > 0:\r\n h += 1\r\nw = m // a\r\nif m % a > 0:\r\n w += 1\r\nprint(h * w) \r\n", "n,m,a=map(int,input().split())\r\nif (n%a==0):\r\n X=n//a\r\nelse:\r\n X=(n//a)+1\r\nif (m%a==0):\r\n Y=m//a\r\nelse:\r\n Y=(m//a)+1\r\nprint(X*Y)", "import math\r\nn,m,a=map(int,input().split())\r\nleng=math.ceil(n/a)\r\nbre=math.ceil(m/a)\r\ntotal=leng*bre\r\nprint(total)", "n, m, a = map(int, input().split())\r\n\r\nw = (n + a - 1) // a \r\nh = (m + a - 1) // a\r\n\r\ntotal = w * h\r\nprint(total)", "#initializes variables to be used\r\nvariables = input().split(' ')\r\nn = int(variables[0])\r\nm = int(variables[1])\r\na = int(variables[2])\r\n\r\n#floor divides dimensions n and m with a to get number of flagstones are needed to cover, assuming it can go beyond the dimension\r\nflagstones = ((-n // a) * (-m // a))\r\nprint(flagstones)", "n,m,a = map(int, input().split())\r\nif n % a > 0:\r\n b = n//a + 1\r\nelse:\r\n b = n//a\r\nif m % a > 0:\r\n c = m//a + 1\r\nelse:\r\n c = m//a\r\nprint(b*c)", "b,c,a=map(int,input().split())\r\nprint(-b//a*(-c//a))", "m,n,a=map(int,input().split())\nif m%a==0:\n va1=m//a\nelse:\n va1=m//a+1\nif n%a==0:\n va2=n//a\nelse:\n va2=n//a+1\nprint(va1*va2)\n#24\n \n \t\t \t \t \t \t\t\t\t \t \t\t\t \t \t\t", "i=input().split()\nn=int(i[0])\nm=int(i[1])\na=int(i[2])\nif m%a!=0:\n\tm=m-m%a+a\nif n%a!=0:\n n=n-n%a+a\nprint (int(m*n/a**2))\n", "#!/usr/bin/env python3\n\nfrom math import ceil\n\nm, n, a = map(int,input().split(\" \")) \n\nres = ceil(m/a) * ceil(n/a)\n\nprint(\"{}\".format(res))\n", "import math\r\nnums = list(map(int , input().split()))\r\n\r\nn = nums[0]\r\nm = nums[1]\r\na = nums[2]\r\n\r\na1 = math.ceil(n/a)\r\na2 = math.ceil(m/a)\r\n\r\nprint(a1 * a2)\r\n\r\n\r\n", "def main():\r\n n, m, a = [int(x) for x in input().split()]\r\n x = (n + a - 1) // a\r\n y = (m + a - 1) // a\r\n print(x * y)\r\n\r\nif __name__ == '__main__':\r\n main()", "from math import *\r\ni1 = [float(i) for i in input().split(' ')]\r\nprint(ceil(i1[1] / i1[2]) * ceil(i1[0] / i1[2]))\r\n", "n,m,a = list(map(int,input().split()))\n\nx = int(n/a) + (n%a>0)\ny = int(m/a) + (m%a>0)\nprint(x*y)\n", "import math\r\ndef soluton(n,m,p):\r\n print(math.ceil(n/p)*math.ceil(m/p))\r\n \r\nn,m,p=map(int,input().split())\r\nsoluton(n,m,p) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nprint((n//a + (n%a>0))*(m//a + (m%a>0)))", "x,y,a=list(map(int,input().split()))\r\nn=x//a\r\nm=y//a\r\nif(x%a!=0):\r\n\tn+=1\r\nif(y%a!=0):\r\n\tm+=1\r\nprint(n*m)\t", "import math\r\nm,n,a=map(int,input().split())\r\nmm=max(m,n);nn=min(m,n)\r\nprint(math.ceil(mm/a)*math.ceil(nn/a))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 20:22:47 2023\r\n\r\n@author: 雷雨松\r\n\"\"\"\r\n\r\na,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\ns=a//c\r\nif(a%c!=0):\r\n s+=1\r\nt=b//c\r\nif(b%c!=0):\r\n t+=1\r\nprint(s*t) ", "import math\r\nvar = [0,0,0]\r\nx = input()\r\nvar = x.split(\" \")\r\nn = var[0]\r\nm = var[1]\r\na = var[2]\r\ntemp_1 = math.ceil(float(n)/float(a))\r\ntemp_2 = math.ceil(float(m)/float(a))\r\nprint(str(temp_1*temp_2))\r\n", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for each dimension\r\nflagstones_needed_n = (n + a - 1) // a\r\nflagstones_needed_m = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones_needed = flagstones_needed_n * flagstones_needed_m\r\n\r\nprint(total_flagstones_needed)\r\n", "from math import ceil \r\nn,m,a=input().split() \r\nn,m,a=int(n),int(m),int(a) \r\nc=ceil(n/a)*ceil(m/a) \r\nprint(c) ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 21:48:50 2023\r\n\r\n@author: pranto\r\n\"\"\"\r\nfrom math import ceil\r\n\r\nn,m,k=map(int,input().split())\r\nA=ceil(n/k)\r\nB=ceil(m/k)\r\nprint(A*B)", "n, m , a = map(int, input().split(\" \"))\r\n\r\nif n%a == 0:\r\n width = n//a\r\nelif n%a != 0:\r\n width = n//a + 1\r\n\r\nif m%a == 0:\r\n length = m//a\r\nelif m%a != 0:\r\n length = m//a + 1\r\n\r\nprint(length*width)\r\n", "\r\nfrom math import ceil\r\n\r\nm , n , a = input().split()\r\n\r\nx = int(ceil(int(m)/int(a)))\r\ny = int(ceil(int(n) / int(a)))\r\nprint(x * y)", "#!/usr/bin/env python\n# coding: utf-8\n\n# A. Theatre Square\n# time limit per test\n# 1 second\n# memory limit per test\n# 256 megabytes\n# input\n# standard input\n# output\n# standard output\n# \n# Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a × a.\n# \n# What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.\n# Input\n# \n# The input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).\n# Output\n# \n# Write the needed number of flagstones.\n\n# In[2]:\n\n\nn,m,a=map(int,input().split())\nx1 = 0\nx2 = 0\nif n%a == 0:\n x1 = n//a\nelse:\n x1 = (n//a) + 1\n \nif m%a == 0:\n x2 = m//a\nelse:\n x2 = (m//a) + 1\n \nprint(x1*x2)\n\n", "x=list(map(int, input().split(\" \")))\r\nimport math\r\nprint(math.ceil(x[0]/x[2])*math.ceil(x[1]/x[2]))\r\n", "import math\r\na = input().split(\" \")\r\nj = 1\r\nj *= -1 * math.floor(-1 * int(a[0])/int(a[2]))\r\nj *= -1 * math.floor(-1 * int(a[1])/int(a[2]))\r\nprint(j)\r\n", "n,m,a=map(int,input().split())\r\nhor=-(-n//a)\r\nver=-(-m//a)\r\ntotal=hor*ver\r\nprint(total)", "n, m, a = map(int, input().split())\r\nx = int(n / a)\r\ny = int(m / a)\r\n\r\nif n % a != 0:\r\n x += 1\r\nif m % a != 0:\r\n y += 1\r\nprint(x * y)", "i,j,n=[int(x) for x in input().split()]\r\na=i//n\r\nb=j//n\r\nif (i%n)!=0:\r\n a=a+1\r\nif (j%n)!=0:\r\n b=b+1\r\nprint(a*b)", "n,m,a = map(int,input().split())\r\nif n % a == 0:\r\n x1 = n//a\r\nelse:\r\n x1 = n//a +1\r\nif m % a == 0:\r\n x2 = m//a\r\nelse:\r\n x2 = m//a +1\r\nx = x1*x2\r\nprint(x)", "n, m, a = map(int, input().split())\r\nside1 = n % a\r\nside2 = m % a\r\nif side1 != 0:\r\n val1 = n // a + 1\r\nelse:\r\n val1 = n // a\r\nif side2 != 0:\r\n val2 = m // a + 1\r\nelse:\r\n val2 = m // a \r\nprint(val1 * val2)", "m,n,a=[int(b) for b in input().split()]\r\nP=(m+a-1)//a\r\nA=(n+a-1)//a\r\nprint(P*A)", "n, m, a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\namount_x = n - (n%a)\r\namount_y = m - (m%a)\r\n\r\nif amount_x < n:\r\n amount_x += a\r\n\r\nif amount_y < m:\r\n amount_y += a\r\n\r\nprint(int(amount_x/a * amount_y/a))\r\n", "import math\r\n\r\n# Считываем строку с входными данными\r\ninput_str = input()\r\n\r\n# Разделяем строку на список строк, используя пробелы в качестве разделителя\r\ninput_list = input_str.split()\r\n\r\n# Преобразуем строки в целые числа\r\nn = int(input_list[0])\r\nm = int(input_list[1])\r\na = int(input_list[2])\r\n\r\nK = math.ceil(n/a)*math.ceil(m/a)\r\nprint(K)\r\n", "n, m, a = map(int, input().split())\r\nflag_ar = a*a\r\n\r\nif (n <= a) & (m <= a):\r\n print(1)\r\nelse:\r\n r1 = n%a\r\n r2 = m%a\r\n\r\n if r1 == 0:\r\n n = n+r1\r\n else:\r\n n = n + abs(a-r1)\r\n\r\n if r2 == 0:\r\n m = m+r2\r\n else:\r\n m = m+abs(a-r2)\r\n\r\n thea_ar = n * m\r\n print(int(round(thea_ar/flag_ar)))", "def theater(n,m,a):\r\n if n%a==0:\r\n x=n/a\r\n else:\r\n x=n//a+1\r\n \r\n if m%a==0:\r\n y=m/a\r\n else:\r\n y=m//a+1\r\n \r\n print (int(x*y))\r\n\r\nstr=input()\r\nj=0\r\nfor i in range(len(str)):\r\n if str[i]==\" \":\r\n if j==0:\r\n n1=int(str[:i])\r\n j=i+1\r\n else:\r\n m1=int(str[j:i])\r\n a1=int(str[i+1:])\r\ntheater(n1,m1,a1)\r\n", "import math\r\nn,m,a=map(int,input().split())\r\ns= math.ceil(m/a)\r\nk= math.ceil(n/a)\r\nprint(s*k)", "w,n,a = input().split()\r\nw = int(w)\r\nn = int(n)\r\na = int(a)\r\nif (w > a and w % a > 0):\r\n wid = int((w/a) // 1 + 1)\r\nelif (w % a == 0):\r\n wid = w / a\r\nelse:\r\n wid = 1\r\nif (n > a and n % a > 0):\r\n leng = int((n/a) // 1 + 1)\r\nelif (n % a ==0):\r\n leng = n / a\r\nelse:\r\n leng = 1\r\n \r\nprint (int(wid * leng))", "num=input()\r\nnum=num.split(\" \")\r\nn=int(num[0])\r\nm=int(num[1])\r\na=int(num[2])\r\n\r\ndef the(n,m,a):\r\n if n>=m:\r\n longeur=n\r\n houteur = m\r\n else:\r\n longeur = m\r\n houteur = n\r\n\r\n if longeur % a == 0:\r\n long = longeur // a\r\n else:\r\n long = longeur // a + 1\r\n if houteur % a == 0:\r\n cont = houteur // a\r\n else:\r\n cont = houteur// a + 1\r\n\r\n return (long*cont)\r\n\r\nprint(the(n,m,a))", "n,m,a = tuple(map(int,input().split(\" \")))\r\nn = n//a if n//a == n/a else (n//a) + 1\r\nm = m//a if m//a == m/a else (m//a) + 1\r\nprint(n*m)\r\n", "import math\n\ndef count_flagstones(n, m, a):\n flagstones_n = math.ceil(n / a)\n flagstones_m = math.ceil(m / a)\n\n total_flagstones = flagstones_n * flagstones_m\n\n return total_flagstones\n\nn, m, a = map(int, input().split())\n\ncount = count_flagstones(n, m, a)\n\nprint(count)\n\n\t \t \t \t \t \t \t\t\t \t \t \t", "n=0\r\nl,h,a=map(int,input().split())\r\nk=h\r\ng=l\r\nm=0\r\nif a==1:\r\n m=l\r\n n=h\r\nelse:\r\n if l%a==0:\r\n n=l//a\r\n if h%a==0:\r\n m=h//a\r\n if l%a!=0:\r\n n=l//a+1\r\n if h%a!=0:\r\n m=h//a+1\r\nprint(m*n)\r\n\r\n ", "import math\r\nn,m,a = map(int,input().split())\r\nx = math.ceil(n / a) * math.ceil(m / a)\r\nprint(x)\r\n", "import math\r\na = input()\r\ny = [int(x) for x in a.split(\" \")]\r\nprint(math.ceil(y[0]/y[2]) * math.ceil(y[1]/y[2]))\r\n", "import math\r\nm,n,a = map(int, input().strip().split(\" \"))\r\nprint(int(math.ceil(m/a)*math.ceil(n/a)))", "n, m, a = map(int, input().split())\r\nprint((n // a + (n % a > 0)) * (m // a + (m % a > 0)))", "import math\r\nn,m,a = map(int,input().split())\r\nA =math.ceil(n/a)\r\nB =math.ceil(m/a)\r\nprint(int(A*B))", "import math\n\n# Read input values\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for the length and width\nlength_stones = math.ceil(n / a)\nwidth_stones = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_stones = length_stones * width_stones\n\n# Print the result\nprint(total_stones)\n\n \t \t\t\t \t\t\t \t\t\t\t", "def main():\n str_line = input().split()\n val1 = int(str_line[0])\n val2 = int(str_line[1])\n val3 = int(str_line[2])\n s1 = int(val1 / val3)\n s1 += (val1 % val3 != 0)\n s2 = int(val2 / val3)\n s2 += (val2 % val3 != 0)\n print(s1*s2)\nmain()", "a,b,c=map(int,input().split())\r\nif b%c==0:\r\n s1=b//c\r\nelse:\r\n s1=b//c+1\r\nif a%c==0:\r\n s2=a//c\r\nelse:\r\n s2=a//c+1\r\nprint(s1*s2)", "#https://codeforces.com/problemset/problem/1/A\r\nls = input().split(' ')\r\nfor i in range(len(ls)):\r\n ls[i] = int(ls[i])\r\nn = ls[0]\r\nm = ls[1]\r\na = ls[2]\r\nmax_int_n = n // a\r\nmax_int_m = m // a\r\nm_addrow = bool(m % a)\r\nn_addrow = bool(n % a)\r\nsquare_flagstones = (max_int_m + m_addrow) * (max_int_n + n_addrow)\r\nprint(square_flagstones)", "# 1000\r\n# A. Theatre Square\r\ndef theatre_square():\r\n n, m, a = list(map(int, input().split()))\r\n\r\n num = ((n // a) + 1 * (n % a != 0)) * ((m // a) + 1 * (m % a != 0))\r\n print(num)\r\n\r\ntheatre_square()", "l=[int(x) for x in input().split()]\r\nn=l[0]\r\nm=l[1]\r\na=l[2]\r\nif m%a==0:\r\n s=m//a\r\nelse:\r\n s=m//a+1\r\nif n%a==0:\r\n s1=n//a\r\nelse:\r\n s1=n//a+1\r\nprint(s*s1)", "n,m,a= input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nprint(-n//a*(-m//a))", "from math import ceil\r\nn,m,a = map(int,input().split())\r\nA = ceil(n/a)\r\nB = ceil(m/a)\r\nprint(int(A*B))\r\n\r\n\r\n\r\n\r\n'''n,m,a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nl = 0\r\nw = 0\r\nif n % a == 0:\r\n l = 0\r\nelse:\r\n l = 1\r\n\r\nif m % a == 0:\r\n w = 0\r\nelse:\r\n w = 1\r\n\r\nlength = (n/a) + l\r\nwidth = (m/a) + w\r\n\r\nprint(length)\r\nprint(width)'''\r\n\r\n\r\n\r\n'''def hcf(x,y):\r\n if x>y:\r\n smaller = y\r\n else:\r\n smaller = x\r\n for i in range(1, smaller+1):\r\n if((x % i == 0) and (y % i == 0)):\r\n hcf = i\r\n return hcf'''\r\n", "n,m,a=map(int,input().split())\r\nif(m%a==0 and n%a!=0):\r\n res=(m//a)*(n//a+1);\r\nelif(m%a!=0 and n%a==0):\r\n\tres=(m//a+1)*(n//a);\r\nelif(m%a!=0 and n%a!=0):\r\n\tres=(m//a+1)*(n//a+1);\r\nelse:\r\n\tres=(m//a)*(n//a);\r\nprint(res);", "n, m, a = map(int, input().split())\r\nl = (n+a-1)//a\r\nu = (m+a-1)//a\r\nt = l*u\r\nprint(t)", "n,m,a = map(int,input().split())\r\n\r\nif n%a == 0: \r\n r1 = n//a \r\nelse : r1 = (n//a)+1 \r\nif m%a == 0: \r\n r2 = m//a \r\nelse : r2 = (m//a)+1\r\n\r\nprint(int(r1*r2))", "n, m, a = map(int, input().split())\r\nflagstones_length = n // a \r\nif n % a != 0: \r\n flagstones_length += 1\r\nflagstones_width = m // a \r\nif m % a != 0: \r\n flagstones_width += 1\r\ntotal_flagstones = flagstones_length * flagstones_width\r\nprint(total_flagstones)\r\n", "import math\r\nl,b,a=[int(x) for x in input().split()]\r\nalong_len=math.ceil(l/a)\r\nalong_bre=math.ceil(b/a)\r\nprint(along_len*along_bre)", "n,m,a=map(int ,input().split(' '))\r\n\r\n \r\nx=n//a \r\ny=m//a\r\n\r\nif n%a != 0 :\r\n x+=1\r\n \r\nif m%a != 0: \r\n y+=1\r\n \r\n \r\nprint (x*y) ", "input1=input()\r\n\r\nn,m,a=map(int, input1.split())\r\n\r\nna=n/a\r\nif na>int(na):\r\n na=int(na)+1\r\nelse:\r\n na=int(na)\r\n\r\nma=m/a\r\nif ma>int(ma):\r\n ma=int(ma)+1\r\nelse:\r\n ma=int(ma)\r\n\r\nprint(int(na*ma))\r\n", "def min_flagstones(n, m, a):\r\n flagstones_in_length = (n + a - 1) // a # ceil(n / a)\r\n flagstones_in_width = (m + a - 1) // a # ceil(m / a)\r\n return flagstones_in_length * flagstones_in_width\r\n\r\n# Read the input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate and print the needed number of flagstones\r\nresult = min_flagstones(n, m, a)\r\nprint(result)\r\n", "n,m,a = [int(x) for x in input().split()]\r\n\r\nans = 0\r\n\r\nif n % a == 0:\r\n ans += n // a\r\nelse:\r\n ans += (n // a)+1\r\n\r\nif m % a == 0:\r\n ans *= m // a\r\nelse:\r\n ans *= (m // a) + 1\r\nprint(ans)", "firstline = input().split()\n#firstline = ['6', '6', '4']\nfor i in range(3):\n n = int(firstline[0])\n m = int(firstline[1])\n a = int(firstline[2])\nprint(((n+a-1)//a)*((m+a-1)//a))", "def fun(c,d):\r\n if c%d==0:\r\n return c//d\r\n else:\r\n p=c//d+1\r\n return p\r\nn,m,a=map(int,input().split())\r\nx=fun(n,a)\r\ny=fun(m,a)\r\nprint(x*y)", "m, n, a = map(int, input().split())\r\nif m%a == 0:\r\n val1 = m//a\r\nelse:\r\n val1 = m//a+1\r\nif n%a == 0:\r\n val2 = n//a\r\nelse:\r\n val2 = n//a+1 \r\nprint(val1*val2) ", "n,m,a = map(int,input().split())\r\n\r\nx = m//a\r\ny = n//a\r\nx1 = m%a\r\ny1 = n%a\r\nif x1 > 0:\r\n x += 1\r\nif y1 > 0:\r\n y += 1\r\nprint(x*y) ", "def num_sqrs(l, b, a):\r\n return ((l + a - 1) // a) * ((b + a - 1) // a)\r\n\r\nl, b, a = map(int, input().split())\r\n\r\nprint(num_sqrs(l, b, a))\r\n\r\n\r\n# def num_sqrs(l,b,a):\r\n# \tif l<=0 or b<=0:\r\n# \t\treturn 0\r\n# \tif l<=a and b<=a :\r\n# \t\treturn 1\r\n# \tif a==1:\r\n# \t\treturn l*b\r\n# \treturn num_sqrs(a,a,a)+ num_sqrs(l-a,a,a)+num_sqrs(a,b-a,a)+num_sqrs(l-a,b-a,a)\r\n\r\n# l,b,a = map(int,input().split())\r\n\r\n# print(num_sqrs(l,b,a))", "import math\r\n\r\n# Read input from standard input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones for the length and width\r\nlength_flagstones = math.ceil(n / a)\r\nwidth_flagstones = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\n# Print the result to standard output\r\nprint(total_flagstones)", "import math\nn, m, a = [int(i) for i in input().split()]\nprint(int(math.ceil(n/a)*math.ceil(m/a)))", "import math\r\nm,n, a = input().split(\" \")\r\nprint(math.ceil(math.ceil(int(m)/int(a))*math.ceil(int(n)/int(a))))", "n, m, a = input().split(' ')\r\n\r\ncount_n = 0\r\ncount_m = 0\r\n\r\ncount_n = -(-int(n)//int(a))\r\ncount_m = -(-int(m)//int(a))\r\n\r\nprint(count_n * count_m)", "from math import ceil\r\nm,n,a= list(map(int, input().split()))\r\n\r\ndef flagstones(m,n,a):\r\n flags = ceil(m/a)\r\n \r\n \r\n if n%a ==0:\r\n flags*=(n//a)\r\n elif n%a !=0:\r\n flags*=((n//a)+1)\r\n \r\n return flags\r\n\r\n\r\n\r\nprint(flagstones(m,n,a))\r\n\r\n\r\n\r\n \r\n \r\n", "n,m,a=map(int,input().split())\r\nprint((-n//a)*(-m//a))", "size=input().split()\r\n\r\nn,m,a=size\r\nwidth=int(n)/int(a)\r\nif int(n)%int(a)>0:\r\n\twidth=int(width)+1\r\nheight=int(m)/int(a)\r\nif int(m)%int(a)>0:\r\n\theight=int(height)+1\r\nprint(int(height*width))", "import math\r\na = [int(i) for i in input().split()]\r\n\r\nprint(str(math.ceil(a[0] / a[2]) * math.ceil(a[1] / a[2])))", "k=input()\r\nk=k.split(' ')\r\nm=int(k[0])\r\nn=int(k[1])\r\na=int(k[2])\r\nif m//a==m/a:\r\n l=m/a\r\nelse:\r\n l=(m//a)+1\r\n\r\nif n//a==n/a:\r\n b=n/a\r\nelse:\r\n b=(n//a)+1\r\n\r\nprint(int(l*b))", "n, m, a = [int(i) for i in input().split()]\r\n\r\nprint(((n-1)//a+1)*((m-1)//a+1))", "import math\r\n\r\ndimension = input()\r\ndimLst = [int(i) for i in dimension.split()]\r\nn = dimLst[0]\r\nm = dimLst[1]\r\na = dimLst[2]\r\n\r\nvert = math.ceil((n/a))\r\nhor = math.ceil((m/a))\r\nnum = vert*hor\r\nprint(num)\r\n", "import math\r\n\r\n\r\ndef chal():\r\n cur = list(map(int, input().split()))\r\n side1 =cur[0]\r\n side2 = cur[1]\r\n side_s = cur[2]\r\n print(math.ceil(side1/side_s) * math.ceil(side2/side_s))\r\nchal()", "n, m, a = [int(x) for x in input().split()]\r\nprint((n // -a) * (m // -a))", "n,m,a=map(int,input().split())\r\n\r\n\r\nif(n%a==0):\r\n b=n//a\r\nelif(n%a>0):\r\n b=n//a+1\r\n\r\nif(m%a==0):\r\n c=m//a\r\nelif(m%a>0):\r\n c=m//a+1\r\n\r\nd=b*c\r\n\r\nprint(d)", "from math import ceil\r\nx,a,b=map(int,input().split())\r\ny=ceil(x/b)\r\nz=ceil(a/b)\r\nprint(int(z*y))", "m,n,a=input().split()\r\nm=int(m)\r\nn=int(n)\r\na=int(a)\r\n\r\nm1=m//a\r\nn1=n//a\r\n\r\nif m%a>0:\r\n m1+=1\r\nif n%a>0:\r\n n1+=1\r\nprint(m1*n1)\r\n", "li=input().split()\r\nls=[int(i) for i in li]\r\na=ls[0]\r\nb=ls[1]\r\nc=ls[2]\r\nif a%c!=0:\r\n a=(a//c+1)*c\r\nif b%c!=0:\r\n b=(b//c+1)*c\r\nc=c*c\r\nprint((a*b)//c)", "def calculate(width, height, sqr_side):\r\n w = width // sqr_side\r\n h = height // sqr_side\r\n \r\n if w * sqr_side != width:\r\n w += 1\r\n \r\n if h * sqr_side != height:\r\n h += 1\r\n \r\n print(\"{}\".format(h * w))\r\n \r\n\r\nif __name__ == \"__main__\":\r\n width, height, side = input().split()\r\n calculate(int(width), int(height), int(side))", "import math\r\nn,m,x=input().split()\r\n\r\nn=int(n)\r\nm=int(m)\r\nx=int(x)\r\n\r\nans=math.ceil(n/x) * math.ceil(m/x)\r\n\r\nprint(ans)\r\n\r\n", "import math\r\np,q,s=map(int,input().split())\r\nif p==1 and q==1 and s==1:\r\n print(1)\r\nelse:\r\n print(math.ceil(p/s)*math.ceil(q/s))", "s = input().split(\" \")\r\nw, h, a = float(s[0]), float(s[1]), float(s[2])\r\nhn = int(h/a)+1 if not h % a == 0 else int(h/a)\r\nwn = int(w/a)+1 if not w % a == 0 else int(w/a)\r\n\r\nprint(hn * wn)\r\n\r\n", "n,m,a=map(int, input().split())\r\nprint(((n//a)+(int((n%a))!=0))*(((m//a)+(int((m%a))!=0))))\r\n", "n,m,sq=map(int,input().split())\r\ns1,s2=0,0\r\n\r\nif n%sq==0:\r\n s1=n//sq\r\nif n%sq!=0:\r\n s1=(n//sq) +1\r\nif m%sq==0:\r\n s2=m//sq\r\nif m%sq!=0:\r\n s2=(m//sq )+1\r\nprint(s1*s2)", "m, n, a = map(int,input().split())\r\nif(m % a == 0 ):\r\n x = m//a\r\nelse:\r\n x = (m//a) +1\r\n\r\nif(n%a == 0):\r\n y = n//a\r\nelse:\r\n y = (n//a) +1\r\nprint(x*y)", "from math import ceil\nn1,n2,n3=map(int,input().split(\" \"))\na=ceil(n1/n3)\nb=ceil(n2/n3)\nprint(int(a*b))\n \t\t \t\t \t \t \t\t\t\t \t\t\t\t \t", "from math import ceil\r\njärjend = list(map(int,input().split()))\r\nvaja_1_kylg = ceil(järjend[0]/järjend[2])\r\nvaja_2_kylg = ceil(järjend[1]/järjend[2])\r\nprint(vaja_1_kylg*vaja_2_kylg)", "import math\r\n\r\nn, m, a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nprint(math.ceil((n/a)) * math.ceil((m/a)))\r\n\r\n\r\n", "from math import ceil\r\nn,m,a=map(int, input().split())\r\nn1=ceil(n/a)\r\nn2=ceil(m/a)\r\nprint(n1*n2)", "n, m, a=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nme1=int(n/a)\r\nme2=m//a\r\ne1=n%a\r\ne2=m%a\r\nif e1>0 :\r\n me1=me1+1\r\nif e2>0 :\r\n me2=me2+1\r\nprint(me1*me2)", "import math\r\nn,m,a=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nflagstone_length=math.ceil(n/a)\r\nflagstone_breadth=math.ceil(m/a)\r\nflagstones=flagstone_breadth*flagstone_length\r\nprint(flagstones)", "def least_flagstones(n, m, a):\n fwidth, remainder_width = divmod(n, a)\n fheight, remainder_height = divmod(m, a)\n\n if remainder_width > 0:\n fwidth += 1\n if remainder_height > 0:\n fheight += 1\n\n total_flagstones = fwidth * fheight\n\n return total_flagstones\n\nn, m, a = map(int, input().split())\n\nresult = least_flagstones(n, m, a)\nprint(result)\n \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\n\r\nif x%z==0:\r\n a=x//z\r\nelse:\r\n a=x//z + 1\r\n \r\nif y%z==0:\r\n b=y//z\r\nelse:\r\n b=y//z + 1\r\n \r\nprint(a*b)", "n,m,a= map(int, input().split())\r\nl=int(n/a)\r\nb=int(m/a)\r\nif n%a==0:\r\n l1=l\r\nelse:\r\n l1=(l+1)\r\nif m%a==0:\r\n b1=b\r\nelse:\r\n b1=(b+1)\r\nA1=l1*b1\r\nprint(A1)", "x,y,z=map(int,input().split(' '))\r\nif x%z == 0:\r\n k = 0\r\nelse:\r\n k = 1\r\nif y%z == 0:\r\n p = 0\r\nelse:\r\n p = 1\r\ntemp = (x//z)+k\r\ntemp1 = (y//z)+p\r\nprint(temp*temp1)", "import math\n\nn, m, a = map(int, input().split())\n\nlength = math.ceil(n / a)\nwidth = math.ceil(m / a)\n\ntotal= length * width\nprint(total)\n \t \t\t\t\t \t\t\t\t \t\t \t \t\t \t", "import math\ndef min(n,m,a):\n num = math.ceil(n/a) * math.ceil(m/a)\n return num\nn,m,a = map(int,input().split())\nres = min(n,m,a)\nprint(res)", "x,y,z=map(int,input().split())\r\nif x<=z:\r\n one = 1\r\nif x>z:\r\n one = x//z \r\n if x%z!=0:\r\n one+=1\r\nif y<=z:\r\n two = 1\r\nif y>z:\r\n two = y//z\r\n if y%z!=0:\r\n two+=1\r\nprint(two*one)", "n, m, a = [int(x) for x in input().strip().split()]\r\nrow_count = n // a + (1 if n % a != 0 else 0)\r\ncol_count = m // a + (1 if m % a != 0 else 0)\r\nprint(row_count * col_count)", "mylist = list(map(int,input().split()))\r\n\r\n\r\ndef check_kostke(a,b,c):\r\n \r\n hor_cntr = 0\r\n vert_cntr = 0\r\n\r\n if c > a % c > 0: \r\n hor_cntr += a//c + 1\r\n else: \r\n hor_cntr += a/c\r\n \r\n if b > b % c > 0:\r\n vert_cntr += b//c + 1\r\n else:\r\n vert_cntr = b/c\r\n \r\n if 1 > hor_cntr >= 0 or 1 > vert_cntr >= 0:\r\n return 1\r\n else:\r\n return int(hor_cntr*vert_cntr)\r\n\r\nprint(check_kostke(mylist[0],mylist[1],mylist[2]))\r\n", "import math\r\n\r\nwhile True:\r\n try:\r\n okkati, rendu, muudo = map(float, input().split())\r\n except:\r\n break\r\n naalufu = okkati * rendu\r\n hhg = math.ceil(rendu/muudo) * math.ceil(okkati/muudo)\r\n print(int(hhg))\r\n", "#chat\r\nimport math\r\n\r\ndef least_flagstones():\r\n n, m, a = map(int, input().split())\r\n # calculate the number of flagstones needed for each dimension\r\n n_flagstones = math.ceil(n / a)\r\n m_flagstones = math.ceil(m / a)\r\n # calculate the total number of flagstones needed\r\n total_flagstones = n_flagstones * m_flagstones\r\n print(total_flagstones)\r\nleast_flagstones()", "import sys\r\nimport math\r\n\r\nfor daneStart in sys.stdin:\r\n daneStart = daneStart.split()\r\n a = int(daneStart[0])\r\n b = int(daneStart[1])\r\n p = int(daneStart[2])\r\n\r\n def liczenie(bokA,bokB,bokP):\r\n if (bokA*bokB)<(bokP*bokP):\r\n return 1\r\n else:\r\n return math.ceil((bokA/bokP))*math.ceil((bokB/bokP))\r\n print(liczenie(a,b,p))", "from math import *\r\na,b,c = map(int,input().split())\r\nprint(ceil(a/c)*ceil(b/c))\r\n", "n, m, c = map(int, input().split())\r\n\r\nprint(((m + c - 1) // c) * ((n + c - 1) // c))\r\n", "m, n, a = map(int, input().split())\n\nweight = m // a\nheight = n // a\n\nif m % a != 0:\n weight += 1\nif n % a != 0:\n height += 1\n\ncount = weight * height\n\nprint(count)\n", "import math\r\nd=input().split()\r\na=math.ceil(int(d[0])/int(d[2]))*math.ceil(int(d[1])/int(d[2]))\r\nprint(a)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nstones_per_row = math.ceil(n / a)\r\nstones_per_column = math.ceil(m / a)\r\n\r\ntotal_stones = stones_per_row * stones_per_column\r\n\r\nprint(total_stones)", "s=input()\r\ndef sqz(a,b):\r\n if a%b!=0:\r\n return int((a-a%b)/b+1)\r\n else:\r\n return int(a/b)\r\nA=[]\r\nfor x in range(len(s)):\r\n if s[x]==' ':\r\n A.append(x)\r\nm=int(s[:A[0]])\r\nn=int(s[A[0]+1:A[1]])\r\na=int(s[A[1]+1:])\r\nprint(sqz(m,a)*sqz(n,a))", "l=list(map(int,input().split()))\nimport math\nn,m,a=l[0],l[1],l[2]\nprint(math.ceil(n/a)*math.ceil(m/a))", "a, b, c = map(int, input().split())\r\nd=a//c+1\r\ne=b//c+1\r\nif a%c==0:\r\n d=d-1\r\nif b%c==0:\r\n e=e-1\r\nprint(d*e)", "n,m,a=list(map(int,input().split()))\r\n\r\nif m%a==0:\r\n x=m//a\r\nelse:\r\n x=(m//a)+1\r\nif n%a==0:\r\n y=n//a\r\nelse:\r\n y=(n//a)+1\r\n\r\nprint(x*y)", "from math import ceil\r\n\r\nn, m, a = list(map(int, input().split()))\r\n\r\nprint(ceil((n/a)) * ceil((m/a)))", "n,m,a = map(int,input().split())\r\nrow = n//a\r\ncolumn = m//a\r\nif n%a != 0:\r\n row += 1\r\nif m%a != 0:\r\n column += 1\r\ntotal = row*column\r\nprint(total)\r\n", "import math\nbb, mm, aa = map(int, input().split())\nflagstones = math.ceil(bb / aa) * math.ceil(mm / aa)\nprint(flagstones)\n\n\t \t \t\t\t \t\t\t\t \t\t\t\t\t \t\t \t \t\t\t\t", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed\r\n# Use integer division to ensure you get a whole number\r\nneeded_flagstones = ((n + a - 1) // a) * ((m + a - 1) // a)\r\n\r\n# Print the result\r\nprint(needed_flagstones)\r\n\r\n", "n,m,a= map(int,input(\" \").split())\r\nrow=n//a\r\ncol=m//a\r\nif n%a!=0:\r\n row=(n//a )+ 1\r\nif m%a!=0:\r\n col=(m//a )+ 1\r\nprint(row*col)\r\n", "import math\r\n\r\ndef solve():\r\n n,m,a = map(int, input().split())\r\n glength = math.ceil(n / a)\r\n gwidth = math.ceil(m / a)\r\n print(glength * gwidth)\r\n\r\nif __name__ == '__main__':\r\n solve()", "# https://codeforces.com/problemset/problem/1/A\n# A. Theatre Square\nfrom math import ceil\n\n\nif __name__ == \"__main__\":\n n, m, a = map(int, input().split())\n print(ceil(n/a) * ceil(m/a))\n", "def ceiling(a):\n if a > int(a):\n return int(a) + 1 \n else:\n return int(a)\n\nn, m, a = map(int, input().split())\nprint(ceiling(n / a) * ceiling(m / a))", "import math\r\nx = [int(i) for i in input().split()]\r\nn, m, a, count = x[0], x[1], x[2], 0\r\nh = math.ceil(n / a)\r\nb = math.ceil(m / a)\r\nprint(h * b)", "import math\r\nn,m,a = map(int, input().split())\r\nflagstones_width = math.ceil(m/a)\r\nflagstones_length = math.ceil(n/a)\r\ntotal_flagstones = flagstones_width * flagstones_length\r\nprint(total_flagstones)", "x,y,a=map(int,input().split())\r\nans=0\r\nl=0\r\nb=0\r\nif x%a>0:\r\n l+=1\r\nif y%a>0:\r\n b+=1\r\nl+=x//a\r\nb+=y//a\r\nprint(l*b)", "from math import ceil\r\nt=[int(x) for x in input().split()]\r\nprint(ceil(t[0]/t[2])*ceil(t[1]/t[2]))\r\n", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for each dimension\r\nnum_flagstones_n = (n + a - 1) // a\r\nnum_flagstones_m = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = num_flagstones_n * num_flagstones_m\r\n\r\nprint(total_flagstones)\r\n", "import math\r\nx,y,z = map(int , input().split())\r\n\r\nl = math.ceil(x/z)\r\nw = math.ceil(y/z)\r\nprint(l*w)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nflagstones_per_row = math.ceil(n/a)\r\nrows_of_flagstones = math.ceil(m/a)\r\n\r\nprint(flagstones_per_row * rows_of_flagstones)\r\n", "import math\r\n\r\n\r\ndef dimentions_are(m,n,a) :\r\n return math.ceil(m/a) * math.ceil(n/a)\r\n \r\nm,n,a=list(map(int, input().split(\" \")))\r\nprint(dimentions_are(m,n,a))", "p,k,v=map(int,input().split())\r\n\r\nprint(-p // v * (-k // v))\r\n", "(n,m,a) = map(int, input().split())\r\nM=m//a\r\nN=n//a\r\nif n<=a and m<=a:\r\n print(1)\r\nif n<=a and m>a:\r\n if m%a==0:\r\n print(M)\r\n else:\r\n print(M+1)\r\nif m<=a and n>a:\r\n if n%a==0:\r\n print(N)\r\n else:\r\n print(N+1)\r\nif m>a and n>a:\r\n if m%a==0 and n%a==0:\r\n print(M*N)\r\n if m%a!=0 and n%a==0:\r\n print((M+1)*N)\r\n if m%a==0 and n%a!=0:\r\n print(M*(N+1))\r\n if m%a!=0 and n%a!=0:\r\n print((M+1)*(N+1))", "import math\nn, m, a = map(int, input().split())\n\nsurface_area = n * m\narea_of_a = a * a\nif n == m:\n num_blocks = math.ceil(n / a) ** 2\n print(num_blocks)\n\nelse:\n num_blocks = math.ceil(n / a) * math.ceil(m / a)\n print(num_blocks)", "n,m,a=map(int,input().split())\r\nans=((m+a-1)//a)*((n+a-1)//a)\r\nprint(ans)", "\"\"\"\nTheatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a × a.\n\nWhat is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.\n\nInput\nThe input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).\n\nOutput\nWrite the needed number of flagstones.\n\n\n\"\"\"\n\nn,m,a = map(int,input().split(\" \"))\nrows = n//a + 1 - int((n//a)*a == n)\ncols = m//a + 1 - int((m//a)*a == m)\nprint(rows * cols)\n\n", "n,m,a = map(int,input().split())\r\nif n%a == 0 and m % a == 0:\r\n print((n//a)*(m//a))\r\nelif n%a != 0 and m % a == 0:\r\n print((n//a+1)*(m//a))\r\nelif n%a == 0 and m % a != 0:\r\n print((n//a)*(m//a+1))\r\nelse:\r\n print((n//a+1)*(m//a+1))", "n, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\nx = n//a + int(n%a != 0)\r\ny = m//a + int(m%a != 0)\r\nprint(x*y)", "import math\r\nllist=list(map(int,input().strip().split()))\r\nnum_of_tile=1\r\nn=llist[0]\r\nm=llist[1]\r\na=llist[2]\r\nl=n/a\r\nw=m/a\r\nif type(l)==float or type(w)==float:\r\n ac_l=math.ceil(l)\r\n ac_w=math.ceil(w)\r\n\r\n num_of_tile*=ac_l*ac_w\r\nelse:\r\n num_of_tile*=l*w\r\nprint(num_of_tile)\r\n", "n, m, a = map(int,input().split())\r\ns = n // a\r\nif n % a > 0:\r\n s += 1\r\nr = m // a\r\nif m % a > 0:\r\n r += 1\r\nprint(s * r)\r\n", "n, m, a = map(int, input().split(' '))\r\nif not n % a == 0:\r\n amount_in_length = n//a + 1\r\nelse:\r\n amount_in_length = n // a\r\nif not m % a == 0:\r\n amount_in_width = m//a + 1\r\nelse:\r\n amount_in_width = m // a\r\namount_plate = amount_in_width*amount_in_length\r\nprint(amount_plate)\r\n", "x,y,a=map(int,input().split())\r\nwi=-(-x//a)\r\nhe=-(-y//a)\r\ntotal=wi*he\r\nprint(total)", "import string\nfrom bisect import bisect, bisect_left, bisect_right\nfrom collections import Counter, defaultdict, deque\nfrom functools import cache, lru_cache\nfrom math import *\nfrom sys import stdin, stdout\n\ninput = stdin.readline\n\nMOD = 10**9+7\n\n\ndef add(a, b):\n return a+b-MOD if a+b > MOD else a+b\n\n\ndef sub(a, b):\n return a-b+MOD if a-b < 0 else a-b\n\n\ndef inp():\n return(int(input()))\n\n\ndef inlt():\n return(list(map(int, input().split())))\n\n\ndef floatl():\n return(list(map(float, input().split())))\n\n\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef ins():\n s = input()\n return s[:len(s) - 1]\n\n\ndef invr():\n return(map(int, input().split()))\n\n\ndef print_arr(arr):\n for v in arr:\n print(v, end=' ')\n print()\n\n\nt = 1\n# t = inp()\nfor _ in range(t):\n n, m, a = inlt()\n nrows = ceil(n*1.0/a)\n ncols = ceil(m*1.0/a)\n print(nrows*ncols)\n", "n,m,a = map(int,input().split())\r\n\r\nif n % a == 0: \r\n r1 = n // a \r\nelse: \r\n r1 = (n // a) + 1 \r\n\r\nif m % a == 0: \r\n r2 = m // a \r\nelse: \r\n r2 = (m // a) + 1\r\n\r\nprint(int(r1 * r2))", "var = input()\r\nlist = var.split(\" \")\r\nrec1 = int(list[0])\r\nrec2 = int(list[1])\r\nsqu = int(list[2])\r\n\r\nval1 = rec1 // squ\r\nif val1 < rec1 / squ:\r\n val1 += 1\r\nval2 = rec2 // squ\r\nif val2 < rec2 / squ:\r\n val2 += 1 \r\nprint(val1*val2)\r\n", "import math\n\ndef main():\n n, m, a = map(int, input().split())\n\n n_rows = math.ceil(n / a)\n n_cols = math.ceil(m / a)\n n_flagstones = n_rows * n_cols\n print(n_flagstones)\n\nif __name__ == \"__main__\":\n main()", "n, m, a= list(map(int, input().split()))\r\narea_s= n*m\r\narea_f= a*a\r\nn_s= n//a\r\nm_s= m//a\r\nif n%a!=0:\r\n n_s+=1\r\nif m%a!=0:\r\n m_s+=1\r\nprint(n_s*m_s)\r\n", "import math\r\nn,m,a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nx = math.ceil(n / a)\r\ny = math.ceil(m / a)\r\nprint(x * y)", "n, m , a = map(int, input().split())\r\n\r\nnecessaryStoneToCoverWidth = int(n / a) + (n % a > 0)\r\nnecessaryStoneToCoverHeight = int(m / a) + (m % a > 0)\r\n\r\nprint(necessaryStoneToCoverWidth * necessaryStoneToCoverHeight)", "# n, m, a\r\nv = [int(x) for x in input().split(' ')]\r\nn = v[0]\r\nm = v[1]\r\na = v[2]\r\nside1 = ((n/a) if (n/a == n//a) else (n//a) + 1)\r\nside2 = ((m/a) if (m/a == m//a) else (m//a) + 1)\r\n# side2 = (m//a) + 1\r\n\r\nprint(int(side1 * side2))", "l,b,a=map(int,input().split())\r\nif(l%a==0):\r\n v=l//a\r\nelse:\r\n v=(l//a)+1\r\nif(b%a==0):\r\n m=b//a\r\nelse:\r\n m=b//a+1\r\nprint(v*m)", "import math\r\n[n, m, a] = [int(i) for i in input().split()]\r\nl = math.ceil(n/a)\r\nw = math.ceil(m/a)\r\ntotal = l * w\r\nprint(total)", "x,y,z=map(int,input().split())\ns=((y+z-1)//z)\nr=((x+z-1)//z)\nprint(s*r)#1\n \t \t \t \t \t \t \t \t \t \t", "import math\n\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for the length and width of the Square\nlength_flagstones = math.ceil(n / a)\nwidth_flagstones = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed by multiplying the number of flagstones for length and width\ntotal_flagstones = length_flagstones * width_flagstones\n\nprint(total_flagstones)\n\t \t\t \t \t\t\t \t\t\t\t \t \t\t\t\t\t\t\t\t\t\t", "n,m,a=map(int,input().split())\r\nimport math\r\nprint(math.ceil(n/a)*math.ceil(m/a))\r\n", "l=list(map(int,input().split()))\r\nk=l[0]//l[2]\r\nm=l[1]//l[2]\r\nif l[2]*k!=l[0]:\r\n k=k+1\r\nif l[2]*m!=l[1]:\r\n m=m+1\r\nprint(k*m)", "import math\nnn, mm, aa = map(int, input().split())\nflagstones = math.ceil(nn / aa) * math.ceil(mm / aa)\nprint(flagstones)\n\n\t\t \t\t \t \t \t\t\t\t\t\t \t\t\t\t \t\t", "n, m, a = map(int, input().split())\r\n\r\nif n%a == 0 :\r\n lado1 = n//a\r\nelif n<a:\r\n lado1 = 1\r\nelse:\r\n lado1 = (n//a)+1\r\n\r\nif m%a <= 0:\r\n lado2 = (m//a)\r\nelse:\r\n lado2 =(m//a)+1\r\n\r\nqtdPlacas = lado1*lado2\r\n\r\nprint(qtdPlacas)", "import math\r\nn,m,a=map(int,input().split())\r\nx=n/a\r\ny=m/a\r\n\r\n\r\nr=math.ceil(x)*math.ceil(y)\r\nprint(r)", "from sys import stdin\r\n\r\n\r\ndef pav(linea):\r\n if linea[0] % linea[2] > 0:\r\n ancho = (linea[0] // linea[2]) + 1\r\n else:\r\n ancho = linea[0] // linea[2]\r\n if linea[1] % linea[2] > 0:\r\n largo = (linea[1] // linea[2]) + 1\r\n else:\r\n largo = linea[1] // linea[2]\r\n return largo*ancho\r\n\r\n\r\ndef main():\r\n n = stdin.readline().strip()\r\n while n:\r\n n = n.split()\r\n n = list(map(int, n))\r\n print(pav(n))\r\n n = stdin.readline().strip()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m,n,a=map(int,input().split())\r\nprint(m//-a*(n//-a))", "n, m, a = map(int, input().split())\r\nsumm = 1\r\nif n > a:\r\n summ *= (n + a - 1) // a\r\nif m > a:\r\n summ *= (m + a - 1) // a\r\nprint(summ)\r\n", "import math\r\n\r\nm,n,a = map(int, input('').split())\r\n\r\nm = math.ceil( m / a )\r\nn = math.ceil( n / a )\r\nval = m * n\r\nprint(val)\r\n", "from math import ceil \r\nn,m,a=map(int,input().split()) \r\nA=ceil(n/a) \r\nB=ceil(m/a) \r\nprint(int(A*B))", "n,m,a=map(int,input().split())\r\nif n%a!=0:\r\n x=n//a +1\r\nelse:\r\n x=n//a\r\nif m%a!=0:\r\n y=m//a +1\r\nelse:\r\n y=m//a\r\nprint(x*y)\r\n", "n, m, a = map(int, input().split())\nx1 = 1 if n % a > 0 else 0\nx2 = n // a + x1\ny1 = 1 if m % a > 0 else 0\ny2 = m // a + y1\nprint(x2 * y2)", "def cal(a, b):\r\n\treturn (a//b) + ((a%b)!=0)\r\n\r\nn, m, a = map(int, input().split())\r\nprint(cal(n, a)*cal(m, a))", "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\ninput_list = inlt()\r\nn, m, a = input_list[0], input_list[1], input_list[2]\r\nif a == 1:\r\n print(n * m)\r\nelse:\r\n print(((n - 1) // a + 1) * ((m - 1) // a + 1))", "import math\r\n\r\nn,m,a=map(int,input().split())\r\n\r\nh=math.ceil(n/a)\r\n\r\nv=math.ceil(m/a)\r\n\r\nminimum_squares=h*v\r\n\r\nprint(minimum_squares)\r\n", "from math import ceil\r\n\r\nvals = input().split(' ')\r\nvals = [int(val) for val in vals]\r\nx, y = ceil(vals[0] / vals[2]), ceil(vals[1] / vals[2])\r\nprint(x * y)", "n,m,a=map(int,input().split())\nx=n//a\nif n%a!=0:\n x+=1\ny=m//a\nif m%a!=0:\n y+=1\nprint(x*y)\n \t\t\t \t \t\t \t\t\t \t\t\t \t \t", "x,y,a=map(int,input().split())\r\nprint(-x//a*(-y//a))", "inp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\na = int(inp[2])\r\n\r\nlr = n/a\r\nif int(lr) < lr:\r\n lr = int(lr) + 1\r\nelse:\r\n lr = int(lr)\r\nud = m/a\r\nif int(ud) < ud:\r\n ud = int(ud) + 1\r\nelse:\r\n ud = int(ud)\r\n\r\nprint(lr*ud)", "from math import ceil\r\nnumbers=list(map(int,input().split()))\r\nn=numbers[0]\r\nm=numbers[1]\r\nt=numbers[2]\r\nfla=0\r\nxfla=0\r\n\r\nif int(n/t) == n/t:\r\n xfla=n/t\r\nelse:\r\n xfla=int(n/t) +1\r\n\r\n \r\nprint(int(xfla*ceil(m/t))) \r\n\r\n", "inp = input()\r\n\r\nm, n, a = map(int, inp.split(\" \"))\r\n\r\nf = lambda x: (x // a) + (x % a > 0)\r\n\r\nprint(f(m) * f(n))", "n,m,a= map(int,(input().split()))\r\nif(n%a!=0):\r\n\tn1=n//a+1\r\nelse:\r\n\tn1=n//a\r\nif(m%a!=0):\r\n\tm1=m//a+1\r\nelse:\r\n\tm1=m//a\r\nprint(n1*m1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 23:04:29 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nimport math\r\n\r\nn,m,a=map(int,input().split())\r\n\r\nz=(math.ceil(n/a)*math.ceil(m/a))\r\n\r\nprint(z)\r\n \r\n\r\n", "import math\r\n\r\nsize = input().split()\r\nm, n, a = int(size[0]), int(size[1]), int(size[2])\r\n\r\ncount = math.ceil(m / a)\r\ncount *= math.ceil(n / a)\r\n\r\nprint(count)\r\n", "import math\r\nn,m,a = [int(x) for x in input().split()] \r\nans = math.ceil(n/a)*math.ceil(m/a)\r\nprint(ans)", "a,b,c = map(int,input().split())\nx = a//c\ny = b // c\nif a % c != 0:\n x+=1\nif b % c != 0:\n y+=1\nprint(y*x)\n", "number=input().split()\r\nn=int(number[0])\r\nm=int(number[1])\r\na=int(number[2])\r\n\r\nif n%a!=0:\r\n n=(n-(n%a))/a+1\r\nelse:\r\n n=n/a\r\n\r\nif m%a!=0:\r\n m=(m-(m%a))/a+1\r\nelse:\r\n m=m/a\r\n\r\nprint(int(m*n))", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n s=n//a\r\nelse:\r\n s=(n//a)+1\r\nif m%a==0:\r\n x=m//a\r\nelse:\r\n x=(m//a)+1\r\nprint(x*s)", "import math\r\n\r\nm, n, a = input().split()\r\nm=int(m)\r\nn=int(n)\r\na=int(a)\r\n\r\nres = math.ceil(m / a ) * math.ceil(n / a)\r\nprint(res)\r\n", "n,m,a=map(int,(input().split()))\r\n#print(int(((n+a-1)/a)*((m+a-1)/a)))\r\nprint(n // -a * (m // -a) )\r\n", "import math\r\nm,n,a=input().split()\r\nm=int(m)\r\nn=int(n)\r\na=int(a)\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "import math\r\n\r\na, b, c = input().split()\r\nx = int(a)\r\ny = int(b)\r\nz = int(c)\r\ni = math.ceil(x/z)\r\nj = math.ceil(y/z)\r\nprint(i*j)", "from math import ceil\r\nn,m,a =map(int,input().split())\r\noutput=ceil(m/a)*ceil(n/a)\r\nprint(output)", "import math\n\nx, y, a = map(int, input().split())\n\nwidth_flagstones = math.ceil(x / a)\nlength_flagstones = math.ceil(y / a)\n\ntotal_flagstones = width_flagstones * length_flagstones\n\nprint(total_flagstones)\n\n\t\t \t\t\t \t\t \t\t \t\t\t \t \t\t \t\t\t\t", "n, m, a = map(int, input().split())\nx, y = 0, 0\nif a > n:\n x = 1\nelse:\n if n % a != 0:\n x = n // a + 1\n else:\n x = n // a\n \nif a > m:\n y = 1\nelse:\n if m % a != 0:\n y = m // a + 1\n else:\n y = m // a\n\nprint(x * y)\n", "import sys, os, math\nn, m, a = map(int, sys.stdin.readline().split())\nprint(math.ceil(n / a) * math.ceil(m / a))\n", "w= input()\r\n[n,m,a] = w.split(\" \")\r\nimport math\r\nq = math.ceil(int(n)/int(a));\r\np = math.ceil(int(m)/int(a));\r\nprint(p*q)\r\n", "z=input()\r\nb=0\r\ne=[]\r\nword=\"\"\r\nfor i in z:\r\n if z[b]==\" \":\r\n e.append(word)\r\n word=\"\"\r\n else:\r\n word=word+i\r\n b=b+1\r\ne.append(word)\r\n\r\nn=int(e[0])\r\nm=int(e[1])\r\na=int(e[2])\r\n\r\n\r\nif n%a==0:\r\n x=n//a\r\nelse:\r\n x=(n//a)+1\r\n\r\n\r\nif m%a==0:\r\n y=m//a\r\nelse:\r\n y=(m//a)+1\r\n\r\nprint(x*y)", "n,m,a = map(int,input().split())\r\nif n%a == 0:\r\n k = 0\r\nelse:\r\n k = 1\r\nif m%a == 0:\r\n p = 0\r\nelse:\r\n p = 1\r\n\r\ntemp = (n//a)+k\r\ntemp1 = (m//a)+p\r\nprint (temp*temp1)", "n, m, a = map(int,input().split())\r\nt = ((n // a) + (1 if n % a != 0 else 0)) * ((m // a) + (1 if m % a != 0 else 0))\r\nprint(t)", "import sys,io,os\r\ntry:Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nexcept:Z=lambda:sys.stdin.readline().encode()\r\nY=lambda:map(int,Z().split())\r\nn,m,a=Y()\r\nceil=lambda a,b:(a-1)//b+1\r\nprint(ceil(n,a)*ceil(m,a))", "import math\r\nn,m,a=map(int,str(input()).split())\r\nx=math.ceil(n/a)\r\ny=math.ceil(m/a)\r\nprint(x*y)", "n, m, a = map(int, input().split())\r\nl = n // a\r\nw = m // a\r\nif n % a != 0:\r\n l+=1\r\nif m % a != 0:\r\n w+=1\r\ntotal_tiles = l * w\r\nprint(total_tiles)", "n,m,a = [int(x) for x in input().split()]\r\nif (n%a): n=int(n/a+1)\r\nelse: n=int(n/a)\r\nif(m%a): m=int(m/a+1)\r\nelse: m=int(m/a)\r\nprint(n*m)", "import math\r\nn,m,a=map(int,input().split())\r\nl=math.ceil(m/a)\r\nw=math.ceil(n/a)\r\ntotal=l*w\r\nprint(total)", "import sys\r\nimport math\r\n\r\ntry:\r\n sys.stdin = open (\"1a.txt\", \"r\")\r\nexcept:\r\n pass\r\n\r\nn,m,a = map(int, input().split())\r\n\r\nt_n = math.ceil(n/a)\r\nt_m = math.ceil(m/a)\r\n\r\ntiles = t_n * t_m\r\nprint (tiles)", "import sys\r\nimport math\r\ndef main():\r\n n,m,x=map(int,input().split())\r\n a=math.ceil(n/x)\r\n b=math.ceil(m/x)\r\n print(a*b)\r\n\r\nif __name__=='__main__':\r\n main()", "import math\nm,n,a=map(int,input().split())\nc=math.ceil(m/a)\nd=math.ceil(n/a)\nprint(c*d)\n", "n, m, a = [int(x) for x in input().split()]\r\nb=n//a\r\nif n%a!=0:\r\n b+=1 \r\nc=m//a\r\n\r\nif m%a!=0:\r\n c+=1\r\nd=c*b\r\nprint(d) ", "import math\r\n\r\ns = [int(e) for e in input().split(' ')]\r\nn, m, a = s[0], s[1], s[2]\r\ncn, cm = math.ceil(n / a), math.ceil(m / a)\r\nprint(cn * cm)\r\n", "import sys\r\n\r\nn,m,a = map(int, sys.stdin.readline().split())\r\n\r\nif n%a == 0:\r\n result_n = n // a\r\nelse:\r\n result_n = n // a + 1\r\n\r\nif m%a == 0:\r\n result_m = m // a\r\nelse:\r\n result_m = m // a + 1\r\n\r\nresult = result_m * result_n\r\n\r\nsys.stdout.write(str(result))", "from math import ceil\r\n\r\n\r\nn,m,a = [int(x) for x in input().split()]\r\ntot =0\r\n\r\nif n*m <= a*a:\r\n print(1)\r\n\r\nelif n%a==0 and m%a ==0:\r\n print(n*m//(a*a))\r\n\r\nelif n%a!=0 and m%a !=0:\r\n print((ceil(n/a)) * (ceil(m/a)))\r\n\r\nelif n%a != 0:\r\n print(m//a * (ceil(n/a)))\r\n\r\nelif m%a != 0:\r\n print(n//a * (ceil(m/a)))", "m, n, a=map(int, input().split())\r\nif m%a==0:\r\n x=m//a\r\nelse:\r\n x=m//a +1\r\nif n%a==0:\r\n y=n//a\r\nelse:\r\n y=n//a +1\r\nprint(x*y)\r\n", "import math\r\nn,m,a = map(int,input().split())\r\np = math.ceil(n/a)\r\nq = math.ceil(m/a)\r\nprint(int(p*q))", "m,n,a=map(int,input().split())\r\ndef mf(x,y):\r\n if x%y == 0:\r\n return x//y\r\n else:\r\n return x//y + 1\r\nprint(mf(m,a)*mf(n,a))\r\n\r\n", "palavra = input()\nvetor = palavra.split()\nn = int(vetor[0])\nm = int(vetor[1])\na = int(vetor[2])\n\nbase = (int)(n / a)\naltura = (int)(m / a)\n\nif n % a != 0:\n base = base + 1\n\nif m % a != 0:\n altura = altura + 1\n\nprint(base * altura)", "n,m,a = map(int, input().split(\" \"))\nsuma = 1\nif n>a:\n suma*=int((n+a-1)/a)\nif m>a:\n suma*=int((m+a-1)/a)\nprint(suma)\n", "import math\n\nn, m, a = map(int, input().split())\nout = math.ceil(n / a) * math.ceil(m / a)\nprint(out)\n", "n, m, a = map(int, input().split())\nlength = (n + a - 1) // a\nwidth = (m + a - 1) // a\ntotal = length* width\nprint(total)\n\t\t\t \t \t\t \t\t\t \t\t\t \t \t \t \t\t\t\t \t", "d=str(input())\r\nn,m,a =d.split()\r\nif int(n)%int(a)==0:\r\n c=int(n)//int(a)\r\nelse:\r\n c=(int(n)//int(a))+1\r\nif int(m)%int(a)==0:\r\n d=int(m)//int(a)\r\nelse:\r\n d=(int(m)//int(a))+1\r\nprint(d*c)", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed\r\n# in the x and y directions\r\nflagstones_x = (n + a - 1) // a\r\nflagstones_y = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\nflagstones = flagstones_x * flagstones_y\r\n\r\n# Print the result\r\nprint(flagstones)", "s,t,r=map(int,input().split())\r\nif t%r==0:\r\n c=t//r \r\nelse:\r\n c=(t//r)+1\r\n#print(c)\r\nif s%r==0:\r\n c1=s//r \r\nelse:\r\n c1=(s//r)+1\r\n \r\nprint(c*c1)", "import itertools\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ndef solve(n, m, a):\r\n print(((n+(a-1))//a )* ((m+(a-1))//a))\r\n\r\nn, m, a = invr()\r\nsolve(n, m, a)", "n, m, a = map(int, input().split(\" \"))\r\nf1 = n // a\r\nif n % a != 0:\r\n f1 += 1\r\nf2 = m // a\r\nif m % a != 0:\r\n f2 += 1\r\nprint(f1*f2) ", "import math\n\nn, m, a = map(int, input().split())\n\nlen = math.ceil(n / a)\nwid = math.ceil(m / a)\n\nstones = len * wid\n\nprint(stones)\n \t \t\t\t\t\t\t \t \t\t \t \t\t \t\t \t\t", "import math\n\n\nproblem_input = list(map(int, input().split(\" \")))\n\na = problem_input[0]\nb = problem_input[1]\nn = problem_input[2]\n\nprint(math.ceil(a/n) * math.ceil(b/n))\n", "from math import ceil\r\nn, m, a = map(int, input().split())\r\nb = ceil(n/a)\r\nc = ceil(m/a)\r\nprint(b*c)", "x=[int(i) for i in input().split()]\r\nwhile(x[0]%x[2]!=0):\r\n x[0]=x[2]*(int(x[0]/x[2])+1)\r\nwhile(x[1]%x[2]!=0):\r\n x[1]=x[2]*(int(x[1]/x[2])+1)\r\nprint(int((x[0]*x[1])/(x[2]*x[2])))", "from math import ceil\r\nentrada = input()\r\nentrada = entrada.split()\r\n\r\nn = int(entrada[0])\r\nm = int(entrada[1])\r\na = int(entrada[2])\r\n\r\nprint(ceil(n/a) * ceil(m/a))", "import math\r\ncon = list(map(int,input().split(' ')))\r\nn = con[0]\r\nm = con[1]\r\na = con[2]\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "from math import ceil\r\n\r\nn, m, a = input().split()\r\n\r\nprint(ceil(int(n) / int(a)) * ceil(int(m) / int(a)))\r\n", "# ██████╗\r\n# ███ ███═█████╗\r\n# ████████╗ ██████╗ ████████╗ ████ █████ ████╗\r\n# ██╔═════╝ ██╔═══██╗ ██╔═════╝ ████ █ ███║\r\n# ██████╗ ██║ ╚═╝ ██████╗ ████ ████╔╝\r\n# ██╔═══╝ ██║ ██╗ ██╔═══╝ ███ ███╔══╝\r\n# ████████╗ ╚██████╔╝ ████████╗ ███ ██╔═╝\r\n# ╚═══════╝ ╚═════╝ ╚═══════╝ ███╔══╝\r\n# Legends ╚══╝\r\n\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nn, m, a = map(int, input().split())\r\nprint(math.ceil(n/a) * math.ceil(m/a))\r\n", "n, m, a = input().split()\nn = int(n)\nm = int(m)\na = int(a)\nif n % a == 0:\n if m % a == 0:\n print(\"%s\" %int((m*n/a/a)))\n else:\n print(\"%s\" %int(((m//a+1)*n/a)))\nelse:\n if m % a == 0:\n print(\"%s\" %int((m/a*(n//a+1))))\n else:\n print(\"%s\" %((m//a+1)*(n//a+1)))", "from math import *\r\nn,m,a=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nn1=ceil(n/a)\r\nn2=ceil(m/a)\r\nprint(n1*n2)", "a,b,c=list(map(int,input().split()))\r\nfrom math import *\r\nprint(ceil(b/c)*ceil(a/c))", "n, m, a = map(int, input().split())\r\nlen=-(-n//a)\r\nwid=-(-m//a)\r\ntotal= len* wid\r\nprint(total)", "import math\n\nall_vars = input()\nfirst_space = 0\nm = \"\"\na = \"\"\nfor i in range(len(all_vars)):\n if all_vars[i] == \" \":\n n = int(all_vars[0:i])\n first_space = i\n break\ntwovars = all_vars[first_space+1:]\nfor j in range(len(twovars)):\n if twovars[j] == \" \":\n m = int(twovars[0:j])\n a = int(twovars[j+1:])\n break\n\nprint(math.ceil(m / a) * math.ceil(n / a))", "import math\r\n \r\ninput_string = input()\r\nn, m, a = input_string.split(\" \")\r\nn, m, a = int(n), int(m), int(a)\r\n\r\nresult = math.ceil(n / a) * math.ceil(m / a)\r\n\r\nprint(result)", "nma = [int(i) for i in input().split()]\r\nn = nma[0]\r\nm = nma[1]\r\na = nma[2]\r\nif n == a:\r\n flagn = 1\r\nelse:\r\n if n % a == 0:\r\n flagn = n // a\r\n else:\r\n flagn = (n // a + 1)\r\nif m == a:\r\n flagm = 1\r\nelse:\r\n if m % a == 0:\r\n flagm = m // a\r\n else:\r\n flagm = (m // a + 1)\r\nprint(flagn * flagm)", "import math\r\nn, m, a = [int(x) for x in input().split()]\r\nl = math.ceil(n/a)\r\nw = math.ceil(m/a)\r\nprint(l*w)", "n, m, a = map(int, input().split())\r\nt1 = m//a if m%a == 0 else m//a + 1\r\nt2 = n//a if n%a == 0 else n//a + 1 \r\nprint(t1*t2) ", "n, m, a = map(int, input( ).split( ) )\n\nif m % a==0:\n x = m // a\nelse:\n x = m // a+1\n\nif n % a==0:\n y = n // a\nelse:\n y = n // a+1\n\nprint(x*y)\n\n\t \t \t\t \t \t \t\t \t\t\t \t \t\t \t\t", "def solve():\r\n n, m, a = map(int, input().split())\r\n print(((n+a-1)//a)*((m+a-1)//a))\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "l=list(map(int,input().split()))\r\nx,y=0,0\r\nif l[0]%l[2]==0 :\r\n x=l[0]//l[2]\r\nelse :\r\n x=l[0]//l[2]+1\r\nif l[1]%l[2]==0 :\r\n y=l[1]//l[2]\r\nelse :\r\n y=l[1]//l[2]+1\r\nprint(x*y)\r\n", "import sys\r\nexec('a, b, c = map(int, input().split())')\r\nexec('x = (a + c - 1) // c')\r\nexec('y = (b + c - 1) // c')\r\nexec('print(x * y)')", "n, m, a = map(int, input().split())\r\n\r\nif n <= a:\r\n x = 1\r\nelif n % a == 0:\r\n x = n // a\r\nelse:\r\n x = (n // a) + 1\r\n\r\nif m <= a:\r\n y = 1\r\nelif m % a == 0:\r\n y = m // a\r\nelse:\r\n y = (m // a) + 1\r\n\r\nprint(x * y)", "n,m,a=map(int,input().split())\r\nt=((n//a)+(1 if n%a!=0 else 0))*((m//a)+(1 if m%a!=0 else 0))\r\nprint(t)", "\nn, m, a = map(int, input().split())\n\nwidth_flagstones = -(-n // a) # This rounds up the division result\n\nlength_flagstones = -(-m // a) # This rounds up the division result\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = width_flagstones * length_flagstones\n\n# Print the result\nprint(total_flagstones)\n\n\t\t\t \t\t\t\t\t \t \t\t\t \t\t \t\t\t\t\t \t", "import math \r\nn,m,a=map(int,input().split())\r\nns=math.ceil(n/a)\r\nms=math.ceil(m/a)\r\nprint(ns*ms)", "n,m,a=map(int,input().split())\r\nif(n<=a):\r\n v1=1\r\nelse:\r\n if(n%a==0):\r\n v1=n//a\r\n else:\r\n v1=(n//a)+1\r\n \r\nif(m<=a):\r\n v2=1\r\nelse:\r\n if(m%a==0):\r\n v2=m//a\r\n else:\r\n v2=(m//a)+1\r\n \r\nprint(v1*v2)", "n,m,a=map(int,input().split())\r\nif n%a== 0:\r\n l=n//a\r\nelse:\r\n l=n//a+1\r\nif m%a== 0:\r\n h=m//a\r\nelse:\r\n h=m//a+1\r\nprint(l*h)\r\n", "\r\nfrom math import ceil\r\nn,m,a=map(int,input().split())\r\nM=ceil(n/a)\r\nN=ceil(m/a)\r\nprint(int(M*N))", "n, m, a = map(int, input().split())\r\nif n % a == 0:\r\n x = n//a\r\nelse:\r\n x = n//a+1\r\nif m%a == 0:\r\n y = m//a\r\nelse:\r\n y = m//a+1\r\nprint(x*y)\r\n", "x=input().split()\r\na,b,c=int(x[0]),int(x[1]),int(x[2])\r\nif a%c:\r\n y=int(a/c)+1\r\nelse:\r\n y=int(a/c)\r\nif b%c:\r\n z=int(b/c)+1\r\nelse:\r\n z=int(b/c)\r\nprint(z*y)", "ns, ms, ast = input().split()\r\nn = int(ns)\r\nm = int(ms)\r\na = int(ast)\r\nstoneslength = n\r\nstoneswidth = m\r\nif n%a == 0:\r\n stoneslength = n//a\r\nelif n%a > 0:\r\n stoneslength = n//a + 1\r\nif m%a == 0:\r\n stoneswidth = m//a\r\nelif m%a > 0:\r\n stoneswidth = m//a + 1\r\ntotal = stoneswidth*stoneslength\r\nprint(total)\r\n", "n, m, a = map(int, input().split())\r\nif (n % a == 0):\r\n x = n//a\r\nelse:\r\n x = n//a + 1\r\nif (m % a == 0):\r\n y = m//a\r\nelse:\r\n y = m//a + 1\r\nprint(x*y)", "n,m,a = input().split()\r\nimport math\r\n\r\nprint(math.ceil(int(n)/int(a))*math.ceil(int(m)/int(a)))", "import math\r\n\r\ndef solve():\r\n n, m, a = map(int, input().split())\r\n res = math.ceil(n / a) * math.ceil(m / a)\r\n return res\r\n \r\n\r\nt = 1\r\nfor _ in range(t):\r\n print(solve())", "import math\r\ninput_data=input().split()\r\nn = int(input_data[0])\r\nm = int(input_data[1])\r\na = int(input_data[2])\r\n\r\noutput_data=math.ceil(n/a)*math.ceil(m/a)\r\noutput_data=int(output_data)\r\nprint(output_data)", "import math\r\nn,m,a=map(int,input().split())\r\nA=math.ceil(n/a)\r\nB=math.ceil(m/a)\r\nprint(int(A*B))", "n, m, a = input().split()\r\nn,m,a = int(n),int(m),int(a)\r\ns1=n//a\r\nif(n%a != 0):\r\n s1+=1\r\ns2=m//a\r\nif(m%a !=0):\r\n s2+=1\r\nprint(s1*s2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 29 21:32:40 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\n\r\nn,m,a=[int(x) for x in input().split()]\r\nif n%a==0: \r\n x=n//a\r\nelse:\r\n x=n//a+1\r\nif m%a==0: \r\n y=m//a\r\nelse:\r\n y=m//a+1\r\nprint(x*y)\r\n", "import math\r\nn, m, a = map(int, input().split())\r\nans = 0\r\nn = math.ceil(n/a) * a\r\nm = math.ceil(m/a) * a\r\nans = int(n * m / (a ** 2))\r\nprint(ans)", "n=[int(x) for x in input().split(' ')]\r\nn1=0\r\nn2=0\r\nif(n[0]%n[2]==0):\r\n n1=n[0]/n[2]\r\nelse:\r\n n1=(n[0]//n[2])+1\r\nif(n[1]%n[2]==0):\r\n n2=n[1]/n[2]\r\nelse:\r\n n2=(n[1]//n[2])+1\r\nprint(int(n1*n2))", "#Theatre Square\r\nimport math\r\nn, m, a = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\narea_region = n*m\r\narea_flagstone = a*a\r\n\r\nif m % a ==0 and n % a ==0:\r\n number = int((m*n)/(a*a))\r\n\r\nelse:\r\n number = int(math.ceil(m/a) * math.ceil(n/a))\r\n\r\nprint(number)\r\n", "n, m, a = map(int, input().split())\r\n\r\nnum_flagstones_length = (n + a - 1) // a\r\nnum_flagstones_width = (m + a - 1) // a\r\n\r\nnum_flagstones = num_flagstones_length * num_flagstones_width\r\n\r\nprint(num_flagstones)", "from math import ceil\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nans = ceil(m / a) * ceil(n / a)\r\nprint(ans)\r\n", "n, m, a = map(int, input().split())\r\n\r\n\r\ndef delenie(a, b):\r\n if a % b != 0:\r\n return a // b + 1\r\n return int(a / b)\r\n\r\nprint(delenie(n, a) * delenie(m, a))", "import sys\r\n\r\nn, m, a = map(int, sys.stdin.readline().split())\r\n\r\nn = n // a if n % a == 0 else n // a + 1\r\nm = m // a if m % a == 0 else m // a + 1\r\nprint(m * n)\r\n", "import math\r\nNMA = input()\r\nNMA = NMA.split()\r\nN = int(NMA[0])\r\nM = int(NMA[1])\r\nA = int(NMA[2])\r\nx = math.ceil(M/A) * math.ceil(N/A)\r\nprint (x)\r\n", "n, m, a = input().split()\r\n\r\nwidth = int(int(n)/int(a)) + (1 if int(n)%int(a) != 0 else 0)\r\nheight = int(int(m)/int(a)) + (1 if int(m)%int(a) != 0 else 0)\r\nprint(width * height)", "\r\nn,m,a=map(int,input().split())\r\nl=(n+a-1)//a\r\nk=(m+a-1)//a\r\nprint(k*l)", "n,m,a =map(int,input().split())\r\nimport math\r\nn1=math.ceil(n/a)\r\nm1=math.ceil(m/a) \r\nk=n1*m1\r\nprint(k)\r\n", "# theater\r\nimport math \r\nn, m, a = input().split()\r\noutput = 1\r\nflag1 = True\r\nflag2 = True\r\nif int(n) <= int(a):\r\n flag1 = False\r\nif int(m) <= int(a):\r\n flag2 = False\r\nif flag2 == False and flag1 == False:\r\n output = 1\r\nelse:\r\n if flag1:\r\n output *= math.ceil(int(n) / int(a))\r\n if flag2:\r\n output *= math.ceil(int(m) / int(a))\r\n\r\nprint(int(output))\r\n", "a, b, c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nnum1=0\nnum2=0\nif a % c==0:\n num1=int(a/c)\nelse:\n num1=int(a/c)+1\n\nif b % c==0:\n num2=int(b/c)\nelse:\n num2=int(b/c)+1\nprint(num1*num2)\n\n\t \t\t \t \t \t\t\t \t\t \t\t \t\t \t\t \t\t", "import math\nn,m,a=map(int,input().split())\nrows=math.ceil(n/a)\ncol=math.ceil(m/a)\nans=rows*col\nprint(ans)\n\n\t \t\t \t\t \t \t \t\t\t \t \t", "n,m,a = map(int, input().split())\r\nlength = n//a + 1 if n%a != 0 else n//a\r\nheight = m // a + 1 if m%a != 0 else m // a\r\nprint(length * height)", "lst= input().split(\" \")\r\nn = int(lst[0])\r\nm = int(lst[1])\r\na = int(lst[2])\r\n\r\nif n % a == 0:\r\n length = (n // a)\r\nelse:\r\n length = (n // a) + 1\r\nif m % a == 0:\r\n breadth = (m // a)\r\nelse:\r\n breadth = (m // a) + 1\r\n \r\nprint(length * breadth)\r\n ", "n, m, a = map(int, input().split())\r\n\r\nma = m//a + (1 if m%a > 0 else 0)\r\n\r\nif (n-a) >= a:\r\n na = n // a + (1 if n % a > 0 else 0) - 1\r\nelif (n-a) > 0:\r\n na = 1\r\nelse:\r\n na = 0\r\n\r\nprint(ma + na*ma)", "import math\r\n \r\ninputs_list = input().split(' ')\r\n \r\nn = float(inputs_list[0])\r\nm = float(inputs_list[1])\r\na = float(inputs_list[2])\r\n \r\nif n < m:\r\n n, m = m, n\r\n \r\nwidth = math.ceil(n/a)\r\nheight = math.ceil(m/a)\r\narea = width*height\r\nprint(area)", "b = list(map(int,input().split()))\r\nn = b[0]\r\nm = b[1]\r\na = b[2]\r\nk = 0\r\nwhile(True):\r\n if(n== 0 or m==0):\r\n break\r\n elif(n < a and m < a):\r\n k = k+1\r\n break\r\n elif(n < a and m >= a):\r\n (n,m,a,k) = (n,m-a,a,k+1)\r\n elif(m < a):\r\n (n,m,a,k)= (n-a,m,a,k+1)\r\n else:\r\n boo = 0\r\n if(n < m):\r\n boo = (n+a-1)//a\r\n f = m//a\r\n (n,m,a,k)= (n,m%a,a,k+boo*f)\r\n else:\r\n boo = (m+a-1)//a\r\n (n,m,a,k)= (n%a,m,a,k+boo*(n//a))\r\nprint(k)", "import fileinput\r\nfrom math import ceil\r\n \r\nfor line in fileinput.input():\r\n line = line.rstrip('\\n').split(\" \")\r\n m = int(line[0])\r\n n = int(line[1])\r\n a = int(line[2])\r\n print(ceil(n/a)*ceil(m/a))", "import math\r\nn, m, a = input().split()\r\n\r\nn, m, a = int(n), int(m), int(a)\r\n\r\nboxes = math.ceil(n / a) * math.ceil(m / a)\r\n\r\nprint (boxes)", "n, m, a = map(int, input().split())\r\nprint((n//a+(n%a!=0)) * (m//a+(m%a!=0)))", "n,m,a = input().split()\n\nn = int(n)\nm = int(m)\na = int(a)\n\nans1 = n/a\n\nif n%a:\n ans1 += 1\nans1 = int(ans1)\n\nans2 = m/a\n\nif m%a:\n ans2 += 1\nans2 = int(ans2)\n\nprint(ans2 * ans1)\n\n\t \t \t \t\t \t\t\t\t\t \t\t \t\t \t\t", "n,m,a = map(int,input().split())\r\nif n%a == 0:\r\n n1 = n//a\r\nelse:\r\n n1 = n//a+1\r\nif m%a == 0:\r\n m1 = m//a\r\nelse:\r\n m1 = m//a+1\r\n\r\nres = n1*m1\r\nprint(res)", "s = input().split(' ')\r\nn = int(s[0])\r\nm = int(s[1])\r\na = int(s[2])\r\nrlt = int(int((n + a - 1) / a) * int((m + a - 1) / a))\r\n# print((n + a - 1) / a)\r\n# print((m + a - 1) / a)\r\nprint(rlt)", "import math\r\nn,m,a = map(int,input().split())\r\nx,y = m/a, n/a\r\nprint(math.ceil(x)*math.ceil(y))", "n,m,a=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\n\r\nif m%a==0:\r\n\tx=m//a\r\nelse:\r\n\tx=m//a+1\r\n\r\nif n%a==0:\r\n\ty=n//a\r\nelse:\r\n\ty=n//a+1\r\n\r\nprint(int(x*y))\r\n\t\t\t\r\n\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, a = map(int, input().split())\r\nans = (n // a + min(n % a, 1)) * (m // a + min(m % a, 1))\r\nprint(ans)", "m, n, a = map(int, input().split())\nif m%a != 0:\n width = m//a + 1\nelse:\n width = m//a\nif n%a != 0:\n height = n//a + 1\nelse:\n height = n//a\nprint(width*height)", "a,b,c = [int(x) for x in input().split()]\r\nn=int(((a-1)/c))+1\r\nm=int(((b-1)/c))+1\r\nprint(n*m)", "import math\r\ndef f(n, m, a):\r\n return math.ceil(n/a)*math.ceil(m/a)\r\nn,m,a=map(int, input().split())\r\nprint(f(n, m, a))\r\n", "(n,m,a) = map(int,input().split())\r\nwidthtiles = n//a\r\nif n%a > 0:\r\n widthtiles += 1\r\nheighttiles = m//a\r\nif m%a > 0:\r\n heighttiles += 1\r\nprint(widthtiles*heighttiles)", "import math\n\ndef least_flagstones(y, m, a):\n return math.ceil(y/a) * math.ceil(m/a)\n\ny, m, a = map(int, input().split())\nprint(least_flagstones(y, m, a))\n\t\t\t \t \t \t\t\t\t\t \t\t \t \t\t \t \t", "from math import ceil\r\n\r\nx,y,z = map(int,input().split())\r\nXx = ceil(x/z) \r\nYy = ceil(y/z) \r\nprint(int(Xx*Yy))", "inp = input().split()\r\n\r\na = int(inp[0])\r\nb = int(inp[1])\r\nc = int(inp[2])\r\n\r\nif b%c==0: \r\n r1=b//c\r\nelse: \r\n r1=b//c+1 \r\n \r\nif a%c==0: \r\n r2=a//c\r\nelse: \r\n r2=a//c+1 \r\n \r\nprint(r1*r2)", "import math\r\na,b,c=map(int,input().split())\r\nx=math.ceil(a/c)\r\ny=math.ceil(b/c)\r\nprint(x*y)", "from math import ceil\r\nn,m,c = map(int,input().split())\r\nA = ceil(n/c)\r\nB = ceil(m/c)\r\nprint(int(A*B))", "l,l1,l2=map(int,input().split())\r\nif (l%l2==0):\r\n s=l//l2\r\nelse:\r\n s=l//l2+1\r\n\r\n\r\n\r\nif (l1%l2==0):\r\n s1=l1//l2\r\nelse:\r\n s1=l1//l2+1\r\n \r\nprint(s*s1)", "import math\r\nn, m, a = map(int, input().split())\r\nprint(math.ceil((n / a)) * math.ceil((m / a)))", "import math\r\n\r\nn, m, a = [int(num) for num in input().split()]\r\n\r\nn_squares = math.ceil(n/a)\r\nm_squares = math.ceil(m/a)\r\n\r\ntotal_square = math.ceil(n_squares*m_squares)\r\n\r\nprint(total_square)", "import math\r\n\r\nstr = input()\r\nstr = str.split()\r\nn = int(str[0])\r\nm = int(str[1])\r\na = int(str[2])\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "n,m,a=map(int,input().split())\r\ndef leastflage(n,m,a):\r\n return ((n+a-1) //a) * ((m+a-1)//a)\r\nprint(leastflage(n,m,a))", "a = input()\r\nb = a.split()\r\nc= []\r\nfor i in b:\r\n c.append(int(i))\r\nif c[0]%c[2]==0:\r\n if c[1]%c[2]==0:\r\n print(int((c[0]/c[2])*(c[1]/c[2])))\r\n else:\r\n print(int((c[0]/c[2])*(c[1]//c[2]+1)))\r\nelif c[1]%c[2]==0:\r\n print(int((c[0]//c[2]+1)*(c[1]/c[2])))\r\nelse:\r\n print(int((c[0]//c[2]+1)*(c[1]//c[2]+1)))\r\n", "n_m_a = input().split(\" \")\r\nn, m, a = int(n_m_a[0]), int(n_m_a[1]), int(n_m_a[2])\r\n\r\nif n // a == n / a :\r\n x_flagstones = n // a\r\nelse :\r\n x_flagstones = n // a + 1\r\n\r\nif m // a == m / a :\r\n y_flagstones = m // a\r\nelse :\r\n y_flagstones = m // a + 1\r\nprint(x_flagstones * y_flagstones)", "k = input() \r\nk = k.split() \r\n\r\nn = int(k[0])\r\nm = int(k[1])\r\na = int(k[2])\r\n\r\nif m%a == 0: \r\n i = int(m/a)\r\nelse: \r\n i = int(m/a + 1)\r\n\r\nif n%a == 0: \r\n j = int(n/a)\r\nelse: \r\n j = int(n/a + 1)\r\n\r\nprint(i*j)", "n, m, a = map(int, input().split())\r\n\r\nx = m // a\r\ny = n // a\r\nif m % a != 0:\r\n x +=1\r\n\r\nif n % a != 0:\r\n y +=1\r\n\r\nprint(x * y)", "#二分 深度，宽度优先搜索 动态规划\r\nm,n,a = map(int,input().split(' '))\r\ndef f(m,a):\r\n if a>m:\r\n return 1\r\n else:\r\n if m%a==0:\r\n return int(m/a)\r\n else:\r\n return int((m//a)+1)\r\nprint(f(m,a)*f(n,a))", "import math \r\na, b, c = map(int, input().split())\r\na1 = math.ceil(a/c)\r\nb1 = math.ceil(b/c)\r\nif c >= b:\r\n print(a1)\r\nelse:\r\n print(a1*b1)", "n, m, a = map(int, input().split())\r\n\r\nif a*a >= n*m:\r\n print(1)\r\nelif (n%a)==0 and (m%a)==0:\r\n print((n//a)*(m//a))\r\nelif (n%a)==0 and (m%a)!=0:\r\n print((n//a)*(m//a)+(n//a))\r\nelif (n%a)!=0 and (m%a)==0:\r\n print((n//a)*(m//a)+(m//a))\r\nelse:\r\n print((n//a)*(m//a)+(m//a)+(n//a)+1)", "# you will input the length and width of the theater => M for length N for width\r\n# you will also input the side length of the flagstone used => a\r\ninput=input()\r\ninput_list=input.split()\r\nvariables= [int(variable) for variable in input_list]\r\nl=variables[0]\r\nw=variables[1]\r\nf=variables[2]\r\n# if theater area was smaller than flagstone area\r\nif l*w <= f*f:\r\n print(1)\r\nelse:\r\n if l % f == 0:\r\n fl= l / f\r\n else:\r\n fl= int(l/f)+1\r\n if w % f ==0:\r\n fw= w/f\r\n else:\r\n fw=int(w/f)+1\r\n # here is the number of needed flagstones:\r\n fn=fw*fl\r\n print (int(fn))\r\n ", "n,m,a=map(int,input().split())\r\nif n%a:n=(n//a)+1\r\nelse:n=n//a\r\nif m%a:m=(m//a)+1\r\nelse:m=m//a\r\nprint(n*m)\r\n", "from math import ceil\n\nN, M, A = map(int, input().split())\n\nprint(ceil(N/A) * ceil(M/A))", "# LUOGU_RID: 118371828\ninp = input()\r\nm, n, a = map(int, inp.split())\r\nprint(((m + a - 1) // a) * ((n + a - 1) // a))", "import math\r\n\r\nn, m, a = map(float, input().split())\r\n\r\nheight = math.ceil(n / a);\r\nlarge = math.ceil(m / a);\r\n\r\nif (large) <= 0:\r\n large = 1;\r\nif (height) <= 0:\r\n height = 1;\r\n\r\nresult = height * large;\r\n\r\nprint(result);", "import math\r\n\r\ndef flagstones_needed(n, m, a):\r\n length_flagstones = math.ceil(n/a)\r\n width_flagstones = math.ceil(m/a)\r\n total_flagstones = length_flagstones * width_flagstones\r\n return total_flagstones\r\nn, m, a = map(int, input().split())\r\nresult = flagstones_needed(n, m, a)\r\nprint(result)\r\n", "import math\r\n\r\ninput_values = input()\r\nn, m, a = map(int, input_values.split())\r\n\r\nwhile n <= 0:\r\n print(\"Invalid number detected for n, please re-enter.\")\r\n input_values = input(\"Enter n, m, a (space-separated): \")\r\n n, m, a = map(int, input_values.split())\r\n\r\nwhile m <= 0:\r\n print(\"Invalid number detected for m, please re-enter.\")\r\n input_values = input(\"Enter n, m, a (space-separated): \")\r\n n, m, a = map(int, input_values.split())\r\n\r\nwhile a <= 0:\r\n print(\"Invalid number detected for a, please re-enter.\")\r\n input_values = input(\"Enter n, m, a (space-separated): \")\r\n n, m, a = map(int, input_values.split())\r\n\r\nnumber = math.ceil(n / a)\r\nif m - a > 0:\r\n number = number * math.ceil(m/a)\r\n\r\nprint(number)", "from math import ceil\r\nn,m,a = map(int,input().split())\r\nn = ceil(n/a)\r\nm = ceil(m/a)\r\nprint(n*m)", "import math\r\n\r\ninp = input()\r\ndata = inp.split(' ')\r\nm = int(data[0])\r\nn = int(data[1])\r\na = int(data[2])\r\nw = math.ceil(m/a)\r\nh = math.ceil(n/a)\r\nprint(w*h)", "n, m, a = map(int, input().split())\r\n\r\nif n % a != 0:\r\n nn = n // a + 1\r\nelse:\r\n nn = n // a\r\n\r\nif m % a != 0:\r\n mm = m // a + 1\r\nelse:\r\n mm = m // a\r\n\r\nprint(nn * mm)\r\n", "# code force file\r\n\r\ndef a_func():\r\n nums = input().split()\r\n n = [int(i) for i in nums]\r\n h = n[0] // n[2] + (n[0] % n[2] != 0)\r\n w = n[1] // n[2] + (n[1] % n[2] != 0)\r\n return h * w\r\n \r\ndef main():\r\n print(a_func())\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "numbers=input()\r\nn,m,a= numbers.split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\ntmp = int(n/a)*int(m/a)\r\nif(n%a!=0):\r\n tmp=tmp+int(m/a)+1\r\nif(m%a!=0):\r\n tmp=tmp+int(n/a)+1\r\nif(n%a!=0 or m%a!=0):\r\n tmp=tmp-1\r\nprint(tmp)\r\n# 1A\r\n", "import math\r\nmath.ceil(3.01)\r\nm, n, a = map(int, input().split())\r\nlong = math.ceil(m / a)\r\nwidth = math.ceil(n / a)\r\nprint(long * width)", "def main():\r\n n, m, a = [int(x) for x in input().split()]\r\n w = h = 0\r\n if n % a: w = n//a + 1\r\n else: w = n // a\r\n if m % a: h = m//a + 1\r\n else: h = m // a\r\n print(w*h)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "import math\r\n\r\nn,m,a=map(int,input().split())\r\nr=math.ceil(n/a)\r\nc=math.ceil(m/a)\r\nprint(c*r)", "m,n,a=map(int,input().split())\r\ndef cal(a,b):\r\n if a%b==0:\r\n return(a//b)\r\n else:\r\n return(a//b+1)\r\nx=cal(m,a)\r\ny=cal(n,a)\r\nprint(x*y)", "def flagstones_number(m, n, a):\r\n i = m // a + ((m % a) > 0)\r\n j = n // a + ((n % a) > 0)\r\n return i * j\r\nm,n,a = map(int, input().split())\r\nprint(flagstones_number(m, n, a))", "(m,n,a) = map(int,input().split())\r\nif m % a == 0:\r\n l =int(m / a)\r\nelse: l = m // a + 1\r\nif n % a == 0:\r\n w = int(n / a)\r\nelse: w = n // a + 1\r\nnum = l * w\r\nprint(num)\r\n", "import math\r\nn,m,a=map(int,input().split(\" \"))\r\n\r\nx=math.ceil(m/a)\r\n\r\nc=math.ceil(n/a)\r\n\r\nprint(x*c)", "n, m, a = [int(e) for e in input().split()]\r\n\r\nif n /a == int(n/a):\r\n f = int(n/a)\r\nelse:\r\n f= 1 + int(n/a)\r\nif m /a == int(m/a):\r\n s = int(m/a)\r\nelse:\r\n s= 1 + int(m/a)\r\nprint(f*s)\r\n", "def sl():\r\n n, m, a = map(int, input().split())\r\n\r\n cw = n // a\r\n if n % a != 0:\r\n cw += 1\r\n ch = m // a\r\n if m % a != 0:\r\n ch += 1\r\n\r\n print(cw * ch)\r\n\r\nsl()\r\n", "a=list(input().split())\r\nx=int(a[0])\r\ny=int(a[1])\r\nz=int(a[2])\r\nif x%z==0:\r\n x=int(x/z)\r\nelif x%z!=0:\r\n x=int(x/z)+1\r\nif y%z==0:\r\n y=int(y/z)\r\nelif y%z!=0:\r\n y=int(y/z)+1\r\nt=int(x)*int(y)\r\nprint(t)\r\n", "from math import ceil\r\na,b,c = map(int, input().split())\r\nprint(ceil(a/c) * ceil(b/c))", "num1,num2,num3=map(int,input().split())\r\nif num1%num3==0:\r\n x=(num1/num3)\r\nelse:\r\n x=(int(num1/num3)+1)\r\n\r\nif num2%num3==0:\r\n y=(num2/num3)\r\nelse:\r\n y=(int(num2/num3)+1)\r\nprint(int(x*y))", "data=input()\r\ndata_list=data.split()\r\nn=int(data_list[0])\r\nm=int(data_list[1])\r\na=int(data_list[2])\r\nlong=int((n-n%a)/a+min(1,n%a))\r\nshort=int((m-m%a)/a+min(1,m%a))\r\nprint(long*short)", "a,b,c=map(int,input().split())\r\nsum=(a//-c*(b//-c))\r\nprint(sum)\r\n", "a,b,c=list(map(int,input().split()))\r\nif a%c==0:\r\n d=a//c\r\nelse:\r\n d=a//c + 1\r\nif b%c==0:\r\n e=b//c\r\nelse:\r\n e=b//c + 1\r\nprint(d*e)", "\r\ndef v(x):\r\n return 1<=x<=10**9\r\n\r\nwhile True:\r\n m,n,a = map(int,input().split(\" \"))\r\n if v(a) and v(m) and v(n): break\r\n \r\nprint(-n//a*(-m//a))\r\n\r\n", "[n, m, a] = input().split(' ')\r\nn, m, a = int(n), int(m), int(a)\r\nL = n // a\r\nif n % a != 0:\r\n L += 1\r\nl = m // a\r\nif m % a != 0:\r\n l += 1\r\nprint(L * l)", "n,m,a=[int(i) for i in input().split()]\r\nif n%a==0:\r\n X=n//a\r\nelse:\r\n X=(n//a)+1\r\nif m%a==0:\r\n Y=m//a\r\nelse:\r\n Y=(m//a)+1\r\nprint(X*Y)", "n,m,a=list(map(int,input().split()))\r\np=max(n,m)\r\nq=m+n-p\r\nv=p//a\r\nif p%a!=0:\r\n v=v+1\r\nw=q//a\r\nif q%a!=0:\r\n w+=1\r\nprint(v*w)\r\n", "n, m, a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nwidth = n//a\r\nheight = m//a\r\nif n%a != 0:\r\n width += 1\r\nif m%a != 0:\r\n height += 1\r\nprint(width*height)", "n, m, a = map(int, input().split())\r\n\r\ndef ceildiv(x, y):\r\n if x % y == 0:\r\n return x // y\r\n else:\r\n return x // y + 1\r\n\r\nprint(ceildiv(n, a) * ceildiv(m, a))\r\n", "a,b,c=map(int,input().split())\r\nd=-(-a//c)\r\ne=-(-b//c)\r\nf=d*e\r\nprint(f)", "import math\n\nn, m, a = map(int, input().split()) # Read the dimensions of the square and the size of a flagstone\n\n# Calculate the number of flagstones needed by dividing the area of the square by the area of a flagstone\n# Use the ceil function to round up to the nearest integer\nflagstones_needed = math.ceil(n / a) * math.ceil(m / a)\n\nprint(flagstones_needed)\n\n\t \t\t \t \t \t \t\t \t\t\t \t\t", "import math\r\nn,m,a = map(int,input().split())\r\n\r\ns = math.ceil(n/a) * math.ceil(m/a)\r\nprint(s)", "#!/bin/python\n\nfrom math import ceil\n\nn,m,a = map(int, input().split())\n\nx = ceil(n / a)\ny = ceil(m / a)\n\nprint(x*y)\n", "k=list(map(int,input().split()))\r\nn=k[0]\r\nm=k[1]\r\na=k[2]\r\ns=int(((n-0.1)//a+1)*((m-0.1)//a+1))\r\nprint(s)", "import math\n\nf, g, h = map(int, input().split())\nnum_flagstones = math.ceil(f/h) * math.ceil(g/h)\n\nprint(num_flagstones)\n\t\t\t \t\t\t \t\t\t \t \t\t \t\t \t\t \t", "from math import ceil\r\na,b,c=map(int,input().split())\r\nm=ceil(a/c)*ceil(b/c)\r\nprint(m)\r\n\r\n", "import math\r\nn,m,a=map(int,input().split())\r\nans=math.ceil(n/a)*math.ceil(m/a)\r\nprint(ans)", "s=input().split()\r\na=int(s[0])\r\nb=int(s[1])\r\nc=int(s[2])\r\nif a%c==0:\r\n k=a//c\r\nelse:\r\n k=(a//c)+1\r\nif b%c==0:\r\n k2=b//c\r\nelse:\r\n k2=(b//c)+1\r\nprint(k*k2)", "n, m, a = input().split()\n\nn = int(n)\nm = int(m)\na = int(a)\nif n//a == n/a:\n k = n/a\nelif n//a != n/a:\n k = (n//a)+1\n\nif m//a == m/a:\n f = m/a\nelif m//a != m/a:\n f = (m//a)+1\nprint(int(k*f))\n", "n, m, a = map(int, input().split())\r\n\r\nif (n % a != 0):\r\n k1 = n // a + 1\r\nelse:\r\n k1 = n // a\r\n\r\nif (m % a != 0):\r\n k2 = m // a + 1\r\nelse:\r\n k2 = m // a\r\n\r\nprint(k1 * k2)\r\n", "n,m,a = [int(num) for num in input().split()]\r\nif n%a==0:\r\n n = n//a\r\nelse:\r\n n = n//a +1\r\nif m%a==0:\r\n m = m//a\r\nelse:\r\n m = m//a +1\r\nprint(m*n)", "import math\r\na,b,x=tuple([int(i) for i in input().split()])\r\nprint(math.ceil(a/x)*math.ceil(b/x))", "n,m,a = map(int,input().split())\nx = n//a\ny = m//a\nif(n%a!=0):\n\tx += 1\nif(m%a!=0):\n\ty += 1\t\nprint(x*y)\t\t", "n = input()\r\nh = [int(i) for i in n.split() if i.isdigit()]\r\npav1 = h[0]\r\npav2 = h[1]\r\nflg = h[2]\r\nans = 0\r\nans1 = 0\r\nif pav1 % flg == 0:\r\n ans = ans + pav1//flg\r\nelse:\r\n ans = ans + pav1//flg +1\r\nif pav2 % flg == 0:\r\n ans1 = ans1 + pav2//flg\r\nelse:\r\n ans1 = ans1 + pav2//flg +1 \r\nprint(ans*ans1) \r\n \r\n \r\n \r\n \r\n \r\n ", "n, m, a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n \r\nif (n % a) != 0:\r\n ln = (n // a) + 1\r\nelse:\r\n ln = (n//a)\r\nif (m % a) != 0:\r\n lm = (m//a) + 1\r\nelse:\r\n lm = (m//a)\r\nprint(ln * lm)", "import math\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for length and width separately\r\nlength_flagstones = math.ceil(n / a)\r\nwidth_flagstones = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\n# Output the result\r\nprint(total_flagstones)\r\n", "import math\r\nn1=input()\r\nn1=n1.split(\" \")\r\nL=list(n1)\r\nn=int(L[0])\r\nm=int(L[1])\r\na=int(L[2])\r\nl=n/a\r\nd=m/a\r\nl1=math.ceil(l)\r\nd1=math.ceil(d)\r\nprint((d1)*(l1))", "import math\r\n\r\nn,m,a = map(int,input().split())\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a) \r\nprint(x*y)\r\n", "a=[int(i) for i in input().split()]\r\nif a[0]<a[2]:\r\n b=1\r\nelif a[0]%a[2]==0:\r\n b=a[0]//a[2]\r\nelse:\r\n b=a[0]//a[2]+1\r\n\r\nif a[1]<a[2]:\r\n c=1\r\nelif a[1]%a[2]==0:\r\n c=a[1]//a[2]\r\nelse:\r\n c=a[1]//a[2]+1\r\nprint(b*c)", "m,n,a=map(int,input().split())\r\nif m%a==0:\r\n value1=m//a\r\nelse:\r\n value1=m//a + 1\r\nif n%a==0:\r\n value2=n//a\r\nelse:\r\n value2=n//a +1\r\nprint(value1*value2)", "m,n,a=map(int,input().split())\r\ne=m//a\r\nf=n//a\r\nif m%a==0 and n%a!=0: print(int(e*(f+1)))\r\nelif m%a!=0 and n%a==0: print(int(f*(e+1)))\r\nelif m%a==0 and n%a==0: print(int(f*e))\r\nelse: print(int((e+1)*(f+1)))\r\n", "import math\r\nn, m, a = map(int, input().split())\r\nx = 0\r\nif a == 1:\r\n x = (m*n)//a\r\n\r\nelif a*a > m*n:\r\n x = 1\r\nelse:\r\n hor = math.ceil(n/a)\r\n ver = math.ceil(m/a)\r\n x = hor * ver\r\n\r\nprint(x)", "import math\r\n\r\nm, n, a = input().split(' ')\r\nprint(math.ceil(int(m)/int(a)) * math.ceil(int(n)/int(a)))\r\n", "data=input().split(\" \")\r\nnum=0\r\nn=int(data[0])\r\nm=int(data[1])\r\na=int(data[2])\r\nx=n//a\r\ny=m//a\r\nif n%a!=0:\r\n x=x+1\r\nif m%a!=0:\r\n y=y+1\r\nnum=x*y\r\nprint(num)", "from math import ceil\r\nnma=[int(_) for _ in input().split()]\r\nn,m,a=nma[0],nma[1],nma[2]\r\nprint(f'{ceil(m/a)*ceil(n/a)}')", "import math\r\na, b, c = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nprint(math.ceil(a/c)*math.ceil(b/c))", "import math\nn, m, a = map(int, input().split())\nflagstones_width = math.ceil(n / a)\nflagstones_height = math.ceil(m / a)\ntotal_flagstones = flagstones_width * flagstones_height\nprint(total_flagstones)\n\n\t \t \t \t \t \t\t \t\t \t\t \t \t\t", "a=input()\r\na.split(\" \")\r\nb=int(a.split(\" \")[0])\r\nc=int(a.split(\" \")[1])\r\nd=int(a.split(\" \")[2])\r\ne=-((-b//d))\r\nf=-((-c//d))\r\nprint(e*f)\r\n ", "import math\r\ndef main():\r\n n, m, a = map(int, input().split())\r\n if m%a == 0:\r\n s= m//a\r\n else:\r\n s= m//a + 1\r\n if n%a == 0:\r\n d= n//a\r\n else:\r\n d=n//a+1\r\n print(s*d)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "n, m, a = map(int, input().strip().split())\r\nres = 0\r\n\r\nn_count = n // a if n % a == 0 else n // a + 1\r\nm_count = m // a if m % a == 0 else m // a + 1\r\n\r\nres = n_count * m_count\r\nprint(res)", "x,y,z=map(int,input().split())\nfrom math import ceil as a\nprint((a(x/z)*a(y/z)))", "n, m, a = map(int,input().split())\r\nprint((n+(a-1))//a*((m+(a-1))//a))", "import math\nn, m, a = map(int, input().split(\" \"))\n\nrows = math.ceil(n/a)\ncols = math.ceil(m/a)\n\nprint(rows * cols)\n", "line = input()\r\n\r\nn, m, a = map(int, line.split())\r\nx = (n + a - 1) // a\r\ny = (m + a - 1) // a\r\n# print(x, y)\r\nprint( x * y)", "import math\r\n\r\nn,m,a = map(int, input().split())\r\n\r\nx = math.floor(n / a)\r\nif n % a is not 0: x += 1\r\ny = math.floor(m / a)\r\nif m % a is not 0: y += 1 \r\n\r\nprint(x * y)", "n, m, a=map(int, input().split())\r\n\r\nif n%a == 0:\r\n fn = n/a\r\nelse: \r\n fn = n//a + 1\r\nif m%a == 0:\r\n fm = m/a\r\nelse: \r\n fm = m//a + 1\r\nf = fn*fm\r\nprint(int(f))\r\n", "import math\r\nn,m,a = map(int,input().split())\r\n\r\nt1,t2 = 0,0\r\nt1 += math.ceil(n/a)\r\nt2 += math.ceil(m/a)\r\n\r\nprint(t1*t2)", "from math import ceil\r\nstr = input().split(' ')\r\nprint(ceil(int(str[0])/int(str[2]))*ceil((int(str[1])/int(str[2]))))", "n,m,a = map(int, input().split())\r\nans = 0\r\nif n % a == 0 and m % a == 0:\r\n ans = (m * n) // a ** 2\r\nelif n % a == 0 and m % a != 0:\r\n ans = ((m - (m % a)) * n // a ** 2) + n // a\r\nelif n % a != 0 and m % a == 0:\r\n ans = (m * (n - (n % a)) // a ** 2) + m // a\r\nelif n % a != 0 and m % a != 0:\r\n p1 = (((m - (m % a)) * (n - (n % a))) // a ** 2)\r\n p2 = (m - (m % a)) // a\r\n p3 = (n - (n % a)) // a \r\n ans = p1 + p2 + p3 + 1\r\n\r\nprint(ans)", "n,m,a=map(int,input().split())\r\nr=n//a\r\nc=m//a\r\nif n%a!=0:\r\n r+=1\r\nif m%a!=0:\r\n c+=1\r\nprint(r*c)\r\n", "\r\nn, m, a = list(map(int, input().split()))\r\nif n % a == 0:\r\n r1 = ((n//a))\r\nelse:\r\n r1 = ((n//a)+1)\r\nif m % a == 0:\r\n r2 = ((m//a))\r\nelse:\r\n r2 = ((m//a)+1)\r\n\r\nprint(r1 * r2)\r\n", "import math\r\n\r\n# Read the input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for each dimension\r\nhorizontal = math.ceil(n / a)\r\nvertical = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal = horizontal * vertical\r\n\r\n# Output the result\r\nprint(total)\r\n", "from math import ceil\r\n\r\nn, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\nc = ceil(n / a) * ceil(m / a)\r\nprint(c) ", "n,m,a=map(int,input().split())\r\nif(n%a==0):\r\n n=n//a\r\nelse:\r\n n=(n//a)+1\r\nif(m%a==0):\r\n m=m//a\r\nelse:\r\n m=(m//a)+1\r\nprint(n*m)\r\n", "n,m,a = map(int,input().split()) \r\n\r\nif n % a != 0:\r\n nmin = n//a+1\r\nelse:\r\n nmin = n//a\r\n\r\nif m % a != 0:\r\n mmin = m//a+1\r\nelse:\r\n mmin = m//a\r\n\r\nprint(nmin*mmin)\r\n", "data = list(map(int, input().split()))\r\nn = data[0]\r\nm = data[1]\r\na = data[2]\r\nsum = 1\r\nif n > a:\r\n sum *= (n + a - 1) // a\r\nif m > a:\r\n sum *= (m + a - 1) // a\r\nprint(sum)", "import math\nn, m, a = map(int, input().split())\nwidth_flagstones = math.ceil(n / a)\nheight_flagstones = math.ceil(m / a)\ntotal_flagstones = width_flagstones * height_flagstones\nprint(total_flagstones)\n\n\t \t \t \t\t\t \t\t\t\t \t\t \t \t \t\t \t", "n,m,a=map(int,input().split())\nl,b=0,0\nif (n/a)==(n//a):\n l=n//a\nelse:\n l=(n//a)+1\nif (m/a)==(m//a):\n b=m//a\nelse:\n b=(m//a)+1\nprint(l*b)\n \t\t\t \t \t\t\t\t\t \t \t\t\t\t\t \t\t \t \t", "n, m, a = [int(num) for num in input().split()]\r\n\r\nlength = (n // a) + (0 if n % a == 0 else 1)\r\nwidth = (m // a) + (0 if m % a == 0 else 1)\r\n\r\nprint(length * width)", "import math\n\nn, m, a = map(int, input().split()) # input the dimensions of the square and the size of a flagstone\n\n# Calculate the number of flagstones needed\nnum_flagstones = math.ceil(n / a) * math.ceil(m / a)\n\nprint(num_flagstones)\n\n\t \t \t \t\t \t\t \t \t \t \t \t\t \t", "n,m,a = map(int,input().split())\r\nc = 0\r\nd = 0\r\ntotal = 0\r\nif (n % a == 0):\r\n c = n // a\r\nelse:\r\n c = n // a + 1\r\nif (m % a == 0):\r\n d = m // a\r\nelse: \r\n d = m // a + 1\r\ntotal = c * d\r\nprint(total)\r\n ", "n, m, a = map(int, input().split())\n\nif (n % a == 0): N = (n // a)\nelse: N = (n // a) + 1\n\nif (m % a == 0): M = (m // a)\nelse: M = (m // a) + 1\n\nprint(N * M)\n\t \t\t\t \t\t\t \t\t \t\t \t \t\t\t\t", "# LUOGU_RID: 124966131\nimport math\nn, m, a = map(int,input().split())\nl = math.ceil(n / a)\nw = math.ceil(m / a)\nprint(l * w)", "n, m, a =[int(i) for i in input().split()]\r\nx, y = [n/a, m/a]\r\nif int(x) < x:\r\n x = int(x) + 1\r\nif int(y) < y:\r\n y = int(y) + 1\r\nprint(int(x*y))", "n,m,a = map(int,input().split())\r\nprint(((n+a-1)//a)*((m+a-1)//a))", "a, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\n\r\nif a % c != 0 and b % c != 0:\r\n print((a // c + 1)*(b // c + 1))\r\nelif a % c == 0 and b % c != 0:\r\n print((a // c)*(b // c + 1))\r\nelif a % c != 0 and b % c == 0:\r\n print((a // c + 1)*(b // c))\r\nelse:\r\n print((a // c)*(b // c))", "n, m, a= input().split()\r\nc=0\r\nx = int(n)\r\ny = int(m)\r\nz = int(a)\r\nif(x<= z and y<= z):\r\n print(1)\r\nelif((x>z and y<=z) or (y>z and x<=z)):\r\n if(max(x,y)%z ==0):\r\n print(max(x,y)//z)\r\n elif(max(x,y)%z !=0):\r\n print((max(x,y)//z)+1)\r\nelif(y>z and x>z):\r\n if(x%z == 0 and y%z == 0):\r\n print((x*y)//(z*z))\r\n elif(x%z != 0 and y%z == 0): \r\n print(((x//z)+1)*(y//z))\r\n elif(x%z == 0 and y%z != 0):\r\n print(((y//z)+1)*(x//z))\r\n elif(x%z != 0 and y%z != 0):\r\n print(((x//z)+1)*((y//z)+1))\r\n\r\n", "from math import ceil\r\narray = input().split()\r\nn, m, a = float(array[0]), float(array[1]), float(array[2])\r\np = max(n,m)\r\nl = min(n,m)\r\nprint(ceil(p/a) * ceil(l/a))", "import math\r\nm, n, a = map(int, input().split())\r\nprint(math.ceil (m/a) * math.ceil(n/a))", "from math import ceil\r\nm, n, a = map(int,input().split())\r\nres = ceil(m/a) * ceil(n/a)\r\n\r\nprint(res)", "# 1A on Codeforces 1000\r\nstr_n, str_m, str_a = input().split()\r\nn, m, a = int(str_n), int(str_m), int(str_a)\r\n\r\n\r\ndef round_up(x):\r\n round_down = int(x)\r\n diff = x-round_down\r\n if diff == 0:\r\n return x\r\n else:\r\n return round_down + 1\r\n\r\n\r\nnb_m = round_up(m/a)\r\nnb_n = round_up(n/a)\r\nif m == a:\r\n nb_m = 1\r\nif n == a:\r\n nb_n = 1\r\n\r\n\r\nprint(int(nb_n*nb_m))\r\n\r\n", "import math\r\n\r\na,b,c=[int(x) for x in input().split()]\r\nans = math.ceil(a/c) * math.ceil(b/c)\r\nprint(ans)", "import math\r\n\r\nx = list(input().split())\r\nn = int(x[0])\r\nm = int(x[1])\r\na = int(x[2])\r\n\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "import math\r\nn,m,a=map(int,input().split())\r\nwidth=math.ceil(n/a)\r\nheight=math.ceil(m/a)\r\ntotal=width*height\r\nprint(total)", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required for the length and width of the square\r\nnum_flagstones_length = n // a if n % a == 0 else n // a + 1\r\nnum_flagstones_width = m // a if m % a == 0 else m // a + 1\r\n\r\n# Calculate the total number of flagstones required\r\nnum_flagstones = num_flagstones_length * num_flagstones_width\r\n\r\nprint(num_flagstones)\r\n", "from math import ceil\r\n\r\nn,m,a = map(int,input().split())\r\nresult = ceil(n/a) * ceil(m/a)\r\nprint(result)", "s = list(int(i) for i in input().split())\r\nm,n,a = s\r\n\r\nif m%a==0:\r\n x= m/a\r\nelse:\r\n x = m//a+1\r\n\r\nif n%a==0:\r\n y = n/a\r\nelse:\r\n y = n//a+1\r\nprint(int(x*y))\r\n", "n,m,a=map(int,input().split())\r\nprint((n+a-1)//a*((m+a-1)//a))", "from math import ceil\r\nn,m,a = map(int,input().split())\r\nA = ceil(n/a)\r\nB = ceil(m/a)\r\nprint(int(A*B))", "from statistics import *\r\nfrom collections import *\r\nmapInput = lambda: map(int, input().split())\r\nlistInput = lambda: list(mapInput())\r\nceil = lambda x, y: -(-x//y)\r\nbinary = lambda x: bin(x)[2:]\r\nMOD = 1000000007\r\n\r\nm,n,a = mapInput()\r\nif a >= max(m,n):\r\n print(ceil(max(m,n),a))\r\nelse:\r\n print(ceil(m,a)*ceil(n,a))", "import math\r\n \r\ninput_string = input()\r\nstring_list = input_string.split(\" \")\r\nint_list = [int(a) for a in string_list]\r\na = math.floor(int_list[0]/int_list[2])\r\nb = math.floor(int_list[1]/int_list[2])\r\nif(int_list[0]%int_list[2] != 0):\r\n a += 1\r\nif(int_list[1]%int_list[2] != 0):\r\n b += 1\r\nprint(a*b)", "nos, usu, po = map(int,input().split())\r\nprint((nos+(po-1))//po*((usu+(po-1))//po))\r\n", "n,m,a=input().split()\nn=int(n)\nm=int(m)\na=int(a)\nx=n//a\nif n % a != 0:\n x += 1\ny=m//a\nif m % a != 0:\n y += 1\nans = x*y\nprint(ans)\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\t\t \t \t\t\t \t\t\t\t\t\t\t\t", "import math\r\nn,m,a=map(int,input().split())\r\nb=math.ceil(n/a)\r\nd=math.ceil(m/a)\r\nprint(b*d)", "import sys\nimport math\n\nn, m, a = sys.stdin.readlines()[0].split()\n\nprint(math.ceil(int(n) / int(a)) * math.ceil(int(m) / int(a)))\n", "n,m,a = [int(a) for a in input().split()]\r\nif((n == a) and (m>n)):\r\n if(m%a == 0):\r\n print(m//a)\r\n else: \r\n print((m//a)+1) \r\nelif ((m == a) and (n > m)):\r\n if(n%a == 0):\r\n print(n//a)\r\n else: \r\n print((n//a)+1)\r\nelif((n<=a) and (m<=a)):\r\n print(1) \r\nelse:\r\n if((n%a == 0) and (m%a != 0)):\r\n print((n//a)*((m//a)+1))\r\n elif ((m % a == 0) and (n % a != 0)):\r\n print((m//a)*((n//a)+1))\r\n elif((n%a == 0) and (m%a == 0)):\r\n print((m//a)*((n//a)))\r\n else: \r\n print(((n//a)+1)*((m//a)+1)) \r\n \r\n \r\n", "from math import ceil\r\nn,m,a = map(int,input().split())\r\nprint(ceil((n/a))*ceil(m/a))", "x = list(map(int,input().split())) \r\nn = x[0]; m = x[1]; a = x[2]\r\nx = n//a\r\ny = m//a \r\nif n%a != 0: \r\n x+=1 \r\nif m%a != 0: \r\n y+=1 \r\nprint(x*y)", "import math\r\nar = input().split(' ')\r\nn,m,a = int(ar[0]), int(ar[1]), int(ar[2])\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "import math\r\ninp = input().split()\r\nn, m ,a = int(inp[0]), int(inp[1]), int(inp[2])\r\nif (n%a == 0 and m%a == 0):\r\n print(int((n*m)/(a*a)))\r\nelif (n%a == 0 and m%a != 0):\r\n print(int((n/a)) * (math.ceil(m/a)))\r\nelif (n%a != 0 and m%a != 0):\r\n print((math.ceil(n/a)) * (math.ceil(m/a)))\r\nelse:\r\n print(int((m/a)) * (math.ceil(n/a)))", "a,b,c = map(int, input().split())\nd = a//c + (a%c!=0)\ne = b//c + (b%c!=0)\nprint(d*e)\n \t \t\t\t \t \t \t\t\t \t\t \t\t \t\t", "L=list(map(int,input().split()))\r\nn=L[0]\r\nm=L[1]\r\na=L[2]\r\nr1=(n+a-1)/a\r\nr2=(a+m-1)/a\r\nr=int(r1)*int(r2)\r\nprint(r)\r\n", "n,m,a =map(int,input().split())\r\n\r\nif n%a==0:\r\n n=(n//a)\r\nelse:\r\n n=(n//a)+1\r\n\r\nif m%a!=0:\r\n m=(m//a)+1\r\nelse:\r\n m=m//a\r\n\r\nprint(m*n)", "import math\nn,m,a = list(map(int,input().split()))\n\nans = math.ceil(n/a) * math.ceil(m/a)\nprint(ans)\n \t \t\t \t \t\t \t\t\t\t \t\t\t \t\t\t \t", "import math\n\n# Input the values of n, m, and a\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\nflagstones = math.ceil(n / a) * math.ceil(m / a)\n\n# Print the result\nprint(flagstones)#v\n\t\t \t\t \t \t \t \t\t\t \t\t", "x,y,z=map(int,input().split())\r\nk=0\r\np=0\r\nif(x%z==0):\r\n k=0\r\nelse:\r\n k=1\r\nif(y%z==0):\r\n p=0\r\nelse:\r\n p=1\r\nt=(x//z)+k\r\nt1=(y//z)+p\r\nprint(t*t1)", "n,m,a=map(int,input().split())\r\nif n%a==0 and m%a==0:print((n*m)//(a*a))\r\nelif n%a!=0 and m%a==0:print((n//a+1)*(m//a))\r\nelif n%a==0 and m%a!=0:print((n//a)*(m//a+1))\r\nelse:print((n//a+1)*(m//a+1))\r\n", "import math\nn, m, a = (input().split(\" \"))\nn = int(n)\nm = int(m)\na = int(a)\nresult = math.ceil(n/a) * math.ceil(m/a)\nprint(result)\n", "import math\r\nn,m,a = map(int,input().split())\r\nle,wid = 0,0\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "n, m, a = map(int, input().split())\r\nrows = n // a\r\ncols = m // a\r\nif n % a != 0:\r\n rows += 1\r\nif m % a != 0:\r\n cols += 1\r\ntotal = rows * cols\r\nprint(total)\r\n", "from math import ceil as ceil\r\nn,m,a = map(int, input().split())\r\nprint(ceil(m/a)*ceil(n/a))", "n,m,a=map(int,input().split())\r\nwhile 1<=n<=10**9 and 1<=m<=10**9 and 1<=a<=10**9:\r\n if n%a==0 and m%a==0:\r\n print(int(n*m/(a*a)))\r\n break\r\n elif n%a==0 and m%a!=0:\r\n print(int(n*(m//a+1)/a))\r\n break\r\n elif m%a==0 and n%a!=0:\r\n print(int(m/a*(n//a+1)))\r\n break\r\n print(int((m//a+1)*(n//a+1)))\r\n break\r\n", "n,m,a=map(int,input().split())\r\nx = n // a\r\ny = m //a\r\nif n%a !=0: x+=1\r\nif m%a !=0: y+=1\r\nprint(x*y)", "def main():\r\n\tfrom math import ceil \r\n\tarr = input().split(' ')\r\n\tlst = [int(i) for i in arr if int(i) >= 1]\r\n\tarr.clear()\r\n\tprint(ceil(lst[0]/lst[2]) * ceil(lst[1]/lst[2]))\r\nif __name__ == '__main__':\r\n\tmain()", "m, n, a = map(int, input().split())\r\nif m > 0 and n > 0 and a > 0:\r\n print((-m // a) * (-n // a))", "n,m,a=input().split(' ')\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nt=0\r\nif(n%a>=1):\r\n t+=(n//a)+1\r\nelse:\r\n t+=(n//a)\r\nif(m%a>=1):\r\n t*=((m//a)+1)\r\nelse:\r\n t*=(m//a)\r\nprint(t)", "import math\r\na,b,c=[int(x) for x in input().split()]\r\nprint(math.ceil(1.0*a/c)*math.ceil(1.0*b/c))\r\n\r\n\r\n", "import math\r\nm,n,a=list(map(float, input().split())) \r\nprint(math.ceil(m/a)*math.ceil(n/a))", "n,m,a = map(int, input().split())\nformula = int((m+a-1)/a) * int((n+a-1)/a)\nprint(formula)", "from math import ceil\r\ntake = list(map(int, input().strip().split()))[:3]\r\nn = take[0]\r\nm = take[1]\r\na = take[2]\r\nprint(ceil(n/a)*ceil(m/a))", "w = list(input())\r\nx = 0\r\nn = 0\r\nm = 0\r\na = 0\r\ny = 0\r\nz = 0\r\nh = \"\"\r\nv = list(\"\")\r\nv.clear()\r\nfor l in w:\r\n x = x + 1\r\n if l != \" \":\r\n h = h + l\r\n else:\r\n v.append(h)\r\n h = \"\"\r\n if x == len(w):\r\n v.append(h)\r\nx = 0\r\nfor o in v:\r\n x = x + 1\r\n if x == 1:\r\n n = o\r\n if x == 2:\r\n m = o\r\n if x == 3:\r\n a = o\r\nif int(n)%int(a) == 0:\r\n y = int(n)/int(a)\r\nelse:\r\n y = (int(n)-(int(n)%int(a)))/int(a) + 1\r\nif int(m)%int(a) == 0:\r\n z = int(m)/int(a)\r\nelse:\r\n z = (int(m)-(int(m)%int(a)))/int(a) + 1\r\nprint(int(y*z))", "import math\r\nn,m,a = map(int, input().split())\r\nflagstones = math.ceil(n/a)*math.ceil(m/a)\r\nprint(flagstones)\r\n", "n,m,a=map(int,input().split())\r\nneeded=(n//a)*(m//a)\r\nif n%a!=0 and m%a!=0:\r\n needed+=m//a+n//a+1\r\nelif n%a!=0 and m%a==0:\r\n needed+=m//a\r\nelif n%a==0 and m%a!=0:\r\n needed+=n//a\r\n\r\nprint(needed)\r\n", "\r\ndef solution():\r\n\r\n m, n, a = map(int, input().split())\r\n ans=0\r\n if m<a and n<a:\r\n ans = 1\r\n elif m<=a and n>=a:\r\n if n%a != 0:\r\n ans+=1\r\n ans+=n//a\r\n elif m>a and n<a:\r\n if m%a != 0:\r\n ans+=1\r\n ans+=m//a\r\n else:\r\n if n%a != 0:\r\n ans+=1\r\n ans+=n//a\r\n\r\n temp = 0\r\n if m%a != 0:\r\n temp+=1\r\n temp+=m//a\r\n ans*=temp\r\n \r\n print(ans)\r\n\r\nsolution()\r\n", "n, m, a = map(int, input().split())\r\nn_side, m_side = 0, 0\r\nif n%a == 0:\r\n n_side = n//a\r\nelse:\r\n n_side = (n//a)+1\r\nif m%a == 0:\r\n m_side = m//a\r\nelse:\r\n m_side = (m//a)+1\r\nprint(m_side*n_side)\r\n", "h, k, g = map(int, input().split())\r\n\r\nif k % g == 0:\r\n r1 = k // g\r\nelse:\r\n r1 = (k // g) + 1\r\n\r\nif h % g == 0:\r\n r2 = h // g\r\nelse:\r\n r2 = (h // g) + 1\r\n\r\nprint(r1 * r2)\r\n", "import math\r\nn,m,a = [int(x) for x in input().split()]\r\nprint((math.ceil(n/a))*(math.ceil(m/a)))", "import math\r\nn= input()\r\nn=n.split()\r\nx = math.ceil(int(n[0])/int(n[2]))\r\ny = math.ceil(int(n[1])/int(n[2]))\r\nz = x*y\r\n\r\nprint(z)\r\n", "x, y, z = map(int,input().split())\r\nif y % z == 0:\r\n rain1 = y // z\r\nelse:\r\n rain1 = y // z + 1\r\nif x % z == 0:\r\n rain2 = x // z\r\nelse:\r\n rain2 = x // z + 1\r\nprint(rain1 * rain2)", "from math import ceil\r\n\r\ndimension = input().split(\" \")\r\nm= int(dimension[0])\r\nn=int(dimension[1])\r\na=int(dimension[2])\r\n\r\nprint(ceil(m/a)*ceil(n/a))", "import math\na, b, s=map(int, input().split())\nr=math.ceil(a/s)\nc=math.ceil(b/s)\nprint(r*c)#a\n\t \t \t\t\t \t\t\t\t \t \t \t\t\t", "from math import ceil\r\ndef main():\r\n n ,m, a = map(int, input().split())\r\n x = ceil(n/a)\r\n y = ceil(m/a)\r\n print(x*y)\r\n\r\nmain()", "import math\n\nn, m, T = map(int, input().split())\n\nwidth_flagstones = math.ceil(n / T)\nlength_flagstones = math.ceil(m / T)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = width_flagstones * length_flagstones\n\nprint(total_flagstones)\n\t\t\t \t \t \t\t\t\t\t \t\t \t \t\t\t \t\t", "m,n,a = map(int,input().split())\r\ndef amount(m,a):\r\n if m%a == 0:\r\n x = m//a\r\n else:\r\n x = m//a +1\r\n return x\r\n\r\nx = amount(m,a)\r\ny = amount(n,a)\r\n\r\nprint(x*y)\r\n", "import math\n\nn, m, a = [int(x) for x in input().split()]\n\nans = math.floor((n+a-1)/a) * math.floor((m+a-1)/a)\n\nprint(ans)\n\n \t\t \t \t \t \t\t \t\t \t \t", "n, m, a = map(int, input().split())\r\nnum_flagstones_width = n // a + (n % a != 0)\r\nnum_flagstones_height = m // a + (m % a != 0)\r\ntotal_flagstones = num_flagstones_width * num_flagstones_height\r\n\r\nprint(total_flagstones)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 13:35:06 2023\r\n\r\n@author: 86139\r\n\"\"\"\r\nn,m,a=map(int,input().split())\r\nif 1<=n<=10**(9) and 1<=m<=10**(9) and 1<=a<=10**(9):\r\n if n%a==0 and m%a==0:\r\n count=(n//a)*(m//a)\r\n if n%a!=0 and m%a==0:\r\n count=((n//a)+1)*(m//a)\r\n if m%a!=0 and n%a==0:\r\n count=(n//a)*((m//a)+1)\r\n if m%a!=0 and n%a!=0:\r\n count=((n//a)+1)*((m//a)+1)\r\nprint(count)", "n, m, a = map(int, input().split())\r\n# 1- calculate number of rocks for class row n / a\r\n# 2 - calculate number of rocks for class column m / a\r\n# 3 - calculate final number of rocks\r\nif n % a == 0:\r\n r1 = n // a\r\nelse:\r\n r1 = n // a + 1\r\n\r\nif m % a == 0:\r\n r2 = m // a\r\nelse:\r\n r2 = m // a + 1\r\n\r\nprint(r1*r2)\r\n", "n, m, a= input().split()\nn = int(n)\nm = int(m)\na = int(a)\n\nx = n//a\nif n % a != 0:\n x += 1\ny = m//a\nif m % a != 0:\n y += 1\nans = x*y\nprint(ans)\n \t \t\t \t \t \t\t \t\t \t\t\t\t \t \t \t", "n,m,a = map(int, input().split(\" \"))\r\nw = (m+a-1) // a\r\nl = (n+a-1) // a\r\nprint(w*l)", "n, m, a = [int(x) for x in input().split()]\n\nx = n // a \nif x * a < n:\n\tx += 1\n\ny = m // a \nif y * a < m:\n\ty += 1\n\nprint(x * y)", "from math import ceil\n\nn,m,a = input().split()\nn,m,a = int(n),int(m),int(a)\nprint(ceil(n/a)*ceil(m/a))\n", "import math\r\nn, m, a = map(int, input().split())\r\nnn = n / a\r\nmm = m / a\r\nprint(math.ceil(nn)*math.ceil(mm))\r\n\r\n# n, m, a = map(int, input().split())\r\n# print(n // -a * (m // -a) )", "import math\r\nx = input()\r\nList = x.split()\r\nn = int(List[0])\r\nm = int(List[1])\r\na = int(List[2])\r\na_n = math.ceil(n / a)\r\na_m = math.ceil(m / a)\r\nprint(a_n * a_m)\r\n", "import sys\r\nfrom math import ceil\r\n\r\ninput = sys.stdin.readline\r\nm, n, a = [int(x) for x in input().split()]\r\n\r\nres = ceil(m / a) * ceil(n / a)\r\nprint(res)", "import math\r\ndef readint():\r\n return int(input())\r\n \r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\nn, m, a = readarray(int)\r\n\r\nn1 = math.ceil(n/a)\r\nm1 = math.ceil(m/a)\r\n\r\nprint(n1*m1)", "import math\r\n\r\ndef main():\r\n\r\n c = input().split()\r\n\r\n b = int(c[0]) / int(c[2]) #Division of n/a\r\n e = int(c[1]) / int(c[2]) #Division of m/a\r\n\r\n b = math.ceil(b)\r\n e = math.ceil(e)\r\n f = b * e\r\n print(f)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "N,M,a=map(int,input().split())\r\nif M%a==0:\r\n r1=M//a\r\nelse:\r\n r1=M//a+1\r\nif N%a==0:\r\n r2=N//a\r\nelse:\r\n r2=N//a+1\r\nprint(r1*r2)", "import math\r\nnma = [int(i) for i in input().split(\" \")]\r\nn = nma[0]\r\nm = nma[1]\r\na = nma[2]\r\nprint(math.ceil(n/a)*math.ceil(m/a))\r\n", "c=str(input())\r\na=c.split(' ')\r\nn=int(a[0])\r\nm=int(a[1])\r\nb=int(a[2])\r\nif n%b!=0:\r\n e=((n//b)+1)\r\nelse:\r\n e=(n//b)\r\nif m%b!=0:\r\n f=((m//b)+1)\r\nelse:\r\n f=m//b\r\ng=e*f\r\nprint(g)", "n, m, a = map(int, input().split())\r\n\r\nINF = 1000000000\r\n\r\nif n > INF or m > INF or a > INF:\r\n print(\"ERROR\")\r\n \r\nrow = n // a\r\nif n % a != 0: row += 1\r\n\r\ncol = m // a\r\nif m % a != 0: col += 1\r\n\r\nprint(row * col)", "from math import*\r\nm, n, a = map(int, input().split())\r\nprint(ceil(m/a)*ceil(n/a))", "import sys\r\nimport math\r\n\r\ndef main():\r\n n, m, a = map(int, input().split())\r\n ans = math.ceil(n / a) * math.ceil(m / a)\r\n print(ans)\r\n return 0\r\n\r\nif __name__ == '__main__':\r\n sys.exit(main())\r\n", "l=list(map(int,input().split()));\r\nn=l[0];\r\nm=l[1];\r\na=l[2];\r\nlength=n//a;\r\nif(n%a!=0):\r\n\tlength+=1;\r\nbreadth=m//a;\r\nif(m%a!=0):\r\n\tbreadth+=1;\r\nprint(length*breadth);", "n,m,a=map(int,input().split()) \r\n \r\nif n%a==0:\r\n _n=n/a\r\nelse:\r\n _n=(n//a)+1\r\nif m%a==0:\r\n _m=m/a\r\nelse:\r\n _m=(m//a)+1\r\nprint(int(_n*_m))", "import math\r\nst = str(input())\r\nst = st.split()\r\n\r\nprint( math.ceil(int(st[0])/int(st[2])) * math.ceil(int(st[1])/int(st[2])))", "import math\n\n# Read the values\nn, m, a = map(int, input().split())\n\n# Calculate number of flagstones needed\nneeded_flagstones = math.ceil(n / a) * math.ceil(m / a)\n\n# Print result\nprint(needed_flagstones)\n \t \t \t \t \t \t \t\t \t", "arr = [i for i in input().split()]\r\nn = int(arr[0])\r\nm = int(arr[1])\r\na = int(arr[2])\r\n\r\nA = n // a if n % a == 0 else n // a + 1\r\nB = m // a if m % a == 0 else m // a + 1\r\n\r\nprint(A*B)", "import math\r\nm,n,a=map(int,input().split())\r\nvalor1=math.trunc(m/a)\r\nvalor2=math.trunc(n/a)\r\nif m%a!=0 and m!=a:\r\n valor1+=1\r\nif n%a!=0 and n!=a:\r\n valor2+=1\r\nprint(valor1*valor2)", "n, m, a = map(int, input().split())\r\nn_fs = (n + a - 1) // a\r\nm_fs = (m + a - 1) // a\r\ntotal_fs = n_fs * m_fs\r\n\r\nprint(total_fs)\r\n", "from math import ceil\n\nm,n,a = [int(a) for a in input().strip().split(\" \")]\nprint( (ceil(m/a))*(ceil(n/a)) )", "from math import ceil\nn,m,a = map(int, input().split())\nprint(ceil(n/a) * ceil(m/a))", "from math import ceil\r\n\r\nm, n, a = map(int, input().split())\r\n\r\nprint(ceil(m / a) * ceil(n / a))", "import math\r\n\r\n\r\ndef solution(x, y, z):\r\n return math.ceil(x / z) * math.ceil(y / z)\r\n\r\n\r\nm, n, a = map(int, input().split())\r\nprint(solution(int(m), int(n), int(a)))\r\n", "import math\nx, y, a = input().split()\nx = int(x)\ny = int(y)\na = int(a)\n\nlength = math.ceil(x / a)\nheight = math.ceil(y / a)\narea = length * height\n\nprint(area)\n \t \t \t \t\t\t\t\t\t\t \t\t \t \t", "import math\nn, m, a = map(int, input().split())\nlength_flagstones = math.ceil(n / a)\nwidth_flagstones = math.ceil(m / a)\ntotal_flagstones = length_flagstones * width_flagstones\nprint(total_flagstones)\n\n\t\t \t \t \t\t\t \t\t \t\t\t \t \t\t\t \t", "#!/usr/bin/env python\r\n# -*- coding:utf-8 -*-\r\n# @FileName :codeforces.py\r\n# @Time :2022/9/7 19:07\r\n# @Author :Lsh\r\ndef count(x,a):\r\n if bool(x % a):\r\n return x // a + 1\r\n else:\r\n return x // a\r\n\r\n\r\nx,y,a=map(int,input().split())\r\nprint(count(x,a)*count(y,a))\r\n", "import math\r\n\r\nlst = list(str(input()).split(' '))\r\nn = int(lst[0])\r\nm = int(lst[1])\r\na = int(lst[2])\r\nprint(str(math.ceil(m/a) * math.ceil(n/a)))", "from math import ceil\r\nn, m, a = [int(x) for x in input().split()]\r\nprint(ceil(m / a) * ceil(n / a))\r\n", "# 获取输入的数据\r\nn, m, a = map(int, input().split())\r\n# 计算需要的石板数量\r\nnum_rows = n // a if n % a == 0 else n // a + 1\r\nnum_cols = m // a if m % a == 0 else m // a + 1\r\ntotal1 = num_rows * num_cols\r\n# 输出结果\r\nprint(total1 )", "# using the arr module\r\ndef round_up(number):\r\n return int(-1 * number //1 * -1)\r\n\r\ndef get_user_inputs():\r\n '''This function gets multi-line inputs from the userry.\r\n '''\r\n input_array = []\r\n input_array = list(map(int, input().split()))\r\n \r\n return input_array\r\n \r\ndef matrix_transformation(theatre_width, theatre_height, paving):\r\n \"\"\" This function calculates the result of the bit operations\r\n \"\"\"\r\n n_width = 0\r\n n_height = 0\r\n \r\n n_width = round_up(theatre_width / paving)\r\n n_height = round_up(theatre_height / paving)\r\n \r\n return n_width * n_height\r\n \r\ndef main():\r\n inputs = get_user_inputs()\r\n result = matrix_transformation(theatre_width=inputs[0], theatre_height=inputs[1], paving=inputs[2])\r\n print(result)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "def calc_flagstones(n, m, a):\r\n num_horiz = (n + a - 1) // a\r\n num_vert = (m + a - 1) // a\r\n return num_horiz * num_vert\r\n\r\n# Taking input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculating the number of flagstones needed\r\nnum_flagstones = calc_flagstones(n, m, a)\r\n\r\n# Printing the result\r\nprint(num_flagstones)\r\n", "from math import ceil\r\nind=(input()).split()\r\nfor i in range (len(ind)):\r\n a=int(ind[0])\r\n b=int(ind[1])\r\n c=int(ind[2])\r\n A=ceil(a/c)\r\n B=ceil(b/c)\r\nprint(A*B)", "a,b,c=map(int,input().split())\r\nk1=a//c\r\nif a%c!=0:\r\n k1=k1+1\r\nk2=b//c\r\nif b%c!=0:\r\n k2=k2+1\r\nprint(k1*k2)", "import math\r\n\r\n[n, m, a]=[int(x) for x in input().split()]\r\n# print(n, m, a)\r\nprint(math.ceil(n/a) * math.ceil(m/a))", "n, m, a = map(int, input().split())\r\n\r\nhorizontal_flagstones = n // a\r\nif n % a != 0:\r\n horizontal_flagstones += 1\r\n\r\nvertical_flagstones = m // a\r\nif m % a != 0:\r\n vertical_flagstones += 1\r\n\r\ntotal_flagstones = horizontal_flagstones * vertical_flagstones\r\nprint(total_flagstones)", "import math\n\ninp = input()\nx = inp.split()\n\nans = math.ceil(int(x[0])/int(x[2])) * math.ceil(int(x[1])/int(x[2]))\nprint(ans)", "import math\r\nn, m, a = map(int, input().split())\r\nlf = math.ceil(n / a)\r\nwf = math.ceil(m / a)\r\ntotal = lf * wf\r\nprint(total)", "n,m,a=map(int,input().split())\r\nif(n%a==0):\r\n val1=n//a\r\nelse:\r\n val1=(n//a)+1\r\nif(m%a==0):\r\n val2=m//a\r\nelse:\r\n val2=(m//a)+1\r\nprint(val1*val2)", "n,m,a=map(int,input().split())\r\nif n%a == 0:\r\n val1 = n // a\r\nelse:\r\n val1 = n // a+1\r\nif m%a == 0:\r\n val2 = m // a\r\nelse:\r\n val2 = m // a+1\r\nprint(val1*val2)", "import math\r\nn, m, a = [int(i) for i in input().split()]\r\n\r\nanswer = math.ceil(n/a)\r\nanswer2 = math.ceil(m/a)\r\nanswer3 = answer2 * answer\r\n\r\nprint(answer3)", "def s(n,n2):\r\n a = n//n2\r\n if n % n2 > 0:\r\n a += 1\r\n return a\r\n\r\nn , m , a = map(int,(input().split()))\r\nprint(s(n,a) * s(m,a))", "def stdInput(type):\r\n if type == \"TC\": # test case count\r\n return int(input())\r\n if type == \"SI\": # spaced integers\r\n return [int(i) for i in input().split()]\r\n if type == \"SS\": # spaced strings\r\n return [i for i in input().split()]\r\n if type == \"TCSI\": # needs test case count, spaced integers\r\n fin = []\r\n for _ in range(stdInput(\"TC\")):\r\n x = [int(i) for i in input().split()]\r\n fin.append(x)\r\n return fin\r\n if type == \"TCSS\": # needs test case count, spaced strings, gives string of each line\r\n fin = []\r\n for _ in range(stdInput(\"TC\")):\r\n x = [i for i in input().split()]\r\n fin.append(x)\r\n return fin\r\n if type == \"S\": # single string\r\n return input()\r\n if type == \"I\": # single integer\r\n return int(input())\r\n\r\nimport math\r\nn, m, a = stdInput(\"SI\")\r\n\r\nprint(math.ceil(n/a) *math.ceil(m/a))", "n , m, a = map(int,input().split())\r\nif m%a == 0:\r\n count1 = m //a\r\nelse:\r\n count1 = m//a+1\r\nif n%a == 0:\r\n count2 = n//a\r\nelse:\r\n count2 = n//a +1\r\nprint(count1*count2)", "n,m,a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nnewn = int(n/a)\r\nnewm = int(m/a)\r\nif n%a != 0:\r\n newn+= 1\r\nif m%a != 0:\r\n newm+= 1\r\nres = newn*newm\r\nprint(res)", "import math\n\nn, x, a = map(int, input().split()) \n#eeee\nnum_flagstones = math.ceil(n / a) * math.ceil(x / a)\n\nprint(num_flagstones)\n \t\t \t\t \t\t\t \t\t \t\t \t \t\t\t\t\t", "import math\r\nm ,n ,a=input().split()\r\nm=float(m)\r\nn=float(n)\r\na=float(a)\r\nz=(math.ceil((m/a))*(math.ceil((n/a))))\r\nprint(z)\r\n", "s=0\r\nimport math \r\nx=input().split()\r\nm=int(x[0])\r\nn=int(x[1])\r\na=int(x[2])\r\nb=(n/a)\r\nc=(m/a)\r\ns=(math.ceil(b))*(math.ceil(c))\r\nprint(s)", "import math\r\n\r\ndef solve():\r\n n, k, a = map(int, input().split())\r\n s1 = math.ceil(n/a)\r\n s2 = math.ceil(k/a)\r\n return s1*s2\r\n\r\ndef main():\r\n print(solve())\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nstr=input().split()\r\nn, m, a = str\r\nn=eval(n)\r\nm=eval(m)\r\na=eval(a)\r\nrow = math.ceil(n / a)\r\ncolmun = math.ceil(m / a)\r\nprint(row * colmun)", "import math\r\n\r\ninput = input()\r\ninputList = input.split()\r\n\r\ninN = math.ceil(int(inputList[0])/int(inputList[2]))\r\ninM = math.ceil(int(inputList[1])/int(inputList[2]))\r\n\r\ntiles = inM * inN\r\n\r\n\r\n#area = int(inputList[0]) * int(inputList[1])\r\n#tile = int(inputList[2])**2\r\n\r\n#tiles = math.ceil(area/tile)\r\nprint(tiles)\r\n", "n, m, a=map(int, input().split())\r\nk=(n - 1)//a+1\r\nb=(m - 1)//a + 1\r\nprint(k*b)", "import math\r\n\r\nn, m, a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\np = math.ceil(n / a)\r\nq = math.ceil(m / a)\r\nprint(p * q)\r\n", "import math\r\nn,a,b = input().split()\r\nn,a,b = int(n),int(a),int(b)\r\nres = math.ceil(n/b) * math.ceil(a/b)\r\nprint(res)", "a = input().split(\" \")\r\na = [int(i) for i in a]\r\n\r\nsum = (a[0]//a[2]) * (a[1]//a[2]) + int((a[0] % a[2])>0) *a[1]//a[2] + int((a[1] % a[2])>0) * a[0]//a[2] + int((a[0] % a[2])>0)*int((a[1] % a[2])>0)\r\n\r\nprint(sum)", "import math\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the length and width\r\nflagstones_length = math.ceil(n / a)\r\nflagstones_width = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = flagstones_length * flagstones_width\r\n\r\n# Output the result\r\nprint(total_flagstones)\r\n", "import math\r\ninsert = input()\r\n\r\nnumbers = insert.split()\r\n\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\na = int(numbers[2])\r\n\r\nsquareHorizontal = math.ceil(n/a)\r\nsquareVertical = math.ceil(m/a)\r\n\r\nprint(squareHorizontal*squareVertical)", "import math\n\nn, m, a = map(int, input().split())\n\n\nlength_flagstone = math.ceil(n / a)\nwidth_flagstone = math.ceil(m / a)\n\ntotal_flagstone = length_flagstone * width_flagstone\n\nprint(total_flagstone)\n\n\t \t \t\t \t\t \t\t\t\t\t \t\t \t\t \t \t\t", "n = input()\r\nn1 = n.split()\r\nif (int(n1[0])%int(n1[2])) == 0:\r\n a = (int(n1[0])//int(n1[2]))\r\nelse:\r\n a = (int(n1[0])//int(n1[2])) + 1\r\nif (int(n1[1])%int(n1[2])) == 0:\r\n a1 = (int(n1[1])//int(n1[2]))\r\nelse:\r\n a1 = (int(n1[1])//int(n1[2])) + 1\r\nprint((a*a1))", "import math\r\n\r\narr = list(map(int, input().split()))\r\n\r\nprint(math.ceil(arr[0]/arr[2]) * math.ceil(arr[1]/arr[2]))\r\n ", "import math \r\n\r\nn, m, a = map(int,input().split())\r\ns = math.ceil(m/a)\r\nk = math.ceil(n/a)\r\n \r\nprint(s*k)", "f = input().split()\r\nf = list(map(int, f))\r\nn, m, a = f[0], f[1], f[2]\r\n\r\n\r\nif ((n // a) * a) == n:\r\n cnt1 = n // a\r\nelse:\r\n cnt1 = (n // a) + 1\r\nif ((m // a) * a) == m:\r\n cnt2 = m // a\r\nelse:\r\n cnt2 = (m // a) + 1\r\nprint(cnt1 * cnt2)\r\n", "x,y,z=map(int,input ().split())\ns=((y+z-1)//z)\nr=((x+z-1)//z)\nprint(s*r)#7\n\t\t\t \t\t\t\t\t \t \t\t \t \t\t\t \t \t", "n,m,a = list(map(int,input().split()))\nn = n-(n*2)\nm = m-(m*2)\nprint(n//a*(m//a))", "n, m, a = map(int,input().split())\r\narea = n*m\r\nflagstone = a*a\r\nx = n//a\r\nx1 = 0\r\ny = m//a\r\ny1 = 0\r\nif n%a!=0:\r\n x1 = x+1\r\nelse:\r\n x1 = x\r\nif m%a != 0:\r\n y1 = y+1\r\nelse:\r\n y1 = y\r\n\r\nprint(x1*y1)", "\r\nimport math\r\n\r\nnums=input().split(\" \")\r\nn=int(nums[0]); m=int(nums[1]); a=int(nums[2])\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "m , n , a = map(int , input().split())\r\nprint(int((m+a-1)//a)*int((n+a-1)/a))", "n,m,a=map(int,input().split())\r\nn=n//a+(n%a!=0)\r\nm=m//a+(m%a!=0)\r\nprint(n*m)\r\n", "import math\r\na,b,c = map(int,input().split())\r\nr = math.ceil(a/c)\r\nco = math.ceil(b/c)\r\nprint(r*co)", "import math\r\nn,m,a=tuple(map(int,input().split()))\r\nnum = math.ceil(n/a)*math.ceil(m/a)\r\nif(n==a and m==a or(n<a and m<a)):\r\n print(1)\r\nelif(n!=m):\r\n print(num)\r\nelse:\r\n print(num)", "dimen = input()\r\n\r\nr1 = 0\r\nr2 = 0\r\n\r\nn = int(dimen.split()[0])\r\nm = int(dimen.split()[1])\r\na = int(dimen.split()[2])\r\n\r\nif m%a == 0 :\r\n r1 = m//a\r\nelse:\r\n r1 = m//a + 1\r\n\r\nif n%a == 0:\r\n r2 = n//a\r\nelse:\r\n r2= n//a +1\r\n\r\n\r\nprint(r1*r2)", "n,m,a=map(int, input().split())\r\nif n%a==0 :\r\n n_number=n/a\r\nelse:\r\n n_number=(n//a+1)\r\nif m%a==0 :\r\n m_number=m/a\r\nelse:\r\n m_number=(m//a+1)\r\nnumber=n_number*m_number\r\nprint(int(number))", "n,m,a=map(int,input().split())\r\nif(n%a==0):\r\n s1=n//a\r\nelse:\r\n s1=(n//a)+1\r\nif(m%a==0):\r\n s2=m//a\r\nelse:\r\n s2=(m//a)+1\r\nprint(s1*s2)", "k,j,a=map(int,input().split())\r\nprint(-k//a*(-j//a))", "n,m,a = map(int,input().split())\r\nimport math\r\nres = math.ceil(n/a)*math.ceil(m/a)\r\nprint(res)", "# LUOGU_RID: 125628116\nimport sys\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n \r\n\r\nn,m,a = get_ints()\r\n\r\nn1 = n//a;\r\nif n%a != 0:\r\n n1 += 1\r\nm1 = m//a;\r\nif m%a !=0:\r\n m1 += 1\r\nprint(n1*m1)", "# n, m, a\r\n# so vien gach\r\n\r\nn, m, a = list(map(int, input().split()))\r\n\r\ncolumn = n // a\r\n\r\nif n % a != 0:\r\n column += 1\r\n\r\nrow = m // a\r\n\r\nif m % a != 0:\r\n row += 1\r\n\r\nprint(row * column)", "n,m,a=map(int,input().split())\nk=0\nx=0\nif n%a!=0:\n k=n//a+1\nelse:\n k=n//a\nif m%a!=0:\n x=m//a+1\nelse:\n x=m//a\nprint (k*x) \n \n", "n,m,a = map(int, input().split())\n\nif m%a == 0:\n distance1 = m//a\nelse:\n distance1 = m//a+1\n\nif n%a == 0:\n distance2 = n//a\nelse:\n distance2 = n//a+1\n\nprint(distance1*distance2)\n \t\t\t\t \t \t \t \t\t \t \t \t \t\t \t", "n,m,a=map(int,input().split())\r\nif n%a!=0:\r\n d=(n//a)+1\r\nelse:\r\n d=(n//a)\r\nif m%a!=0:\r\n e=(m//a)+1\r\nelse:\r\n e=(m//a)\r\nprint(d*e)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n# Compute the number of flagstones required for each dimension\r\nnum_flagstones_n = math.ceil(n/a)\r\nnum_flagstones_m = math.ceil(m/a)\r\n\r\n# Compute the total number of flagstones required\r\nnum_flagstones = num_flagstones_n * num_flagstones_m\r\n\r\nprint(num_flagstones)\r\n", "import math\r\n\r\ninp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\na = int(inp[2])\r\n\r\nprint(math.ceil(n/a)*math.ceil(m/a))\r\n", "import math\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for both dimensions\r\nhorizontal = math.ceil(n / a)\r\nvertical = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones required\r\ntotal_flagstones = horizontal * vertical\r\n\r\n# Output the result\r\nprint(total_flagstones)\r\n", "import math\r\nm, n, a = map(int, input().split())\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "from math import ceil\r\n\r\ninput = input()\r\ninput = input.split()\r\nn = int(input[0])\r\nm = int(input[1])\r\na = int(input[2])\r\n#output; num of flagstones\r\nnum_fs = 0\r\n\r\nnum_fs = ceil(n / a) * ceil(m / a)\r\n\r\nprint(num_fs)\r\n\r\n", "# A. Theatre Square\r\nn, m, a = map(int,input().split())\r\nlength = n // a\r\nif(n % a != 0):\r\n length += 1\r\nbreadth = m // a\r\nif(m % a != 0):\r\n breadth += 1\r\nprint(length*breadth)", "import sys\r\nimport math\r\n\r\nm, n, a = map(int, sys.stdin.readline().split())\r\n\r\nans = math.ceil(m/a) * math.ceil(n/a)\r\n\r\nprint(ans)\r\n", "import math\r\ndef main():\r\n\r\n x = [int(k) for k in input().split()]\r\n a = x[0]\r\n b = x[1]\r\n c = x[2]\r\n print(math.ceil(a/c) * math.ceil(b/c))\r\nmain()", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n v=m//a\r\nelse: v=m//a +1\r\nif n%a==0:\r\n v2=n//a\r\nelse:\r\n v2=n//a+1\r\nprint(v*v2)", "n,m,a=map(int,input().split())\r\nans=(n+a-1)//a\r\nres=(m+a-1)//a\r\nresult=ans*res\r\nprint(result)", "n, m, a = input().split()\r\nn, m, a = [int(n), int(m), int(a)]\r\nk=0\r\np=0\r\nk=m%a\r\nm=m//a\r\np=n%a\r\nn=n//a\r\nif (k>0):\r\n m=m+1\r\nif (p>0):\r\n n=n+1\r\np=m*n\r\nprint(p)\r\n", "x=input().split()\r\nx[0],x[1],x[2]=int(x[0]),int(x[1]),int(x[2])\r\nl,w=0,0\r\n\r\nif x[0]<=x[2]:\r\n l=1\r\nelif x[0]%x[2]==0:\r\n l=x[0]//x[2]\r\nelse:\r\n l=x[0]//x[2]+1\r\n\r\nif x[1]<=x[2]:\r\n w=1\r\nelif x[1]%x[2]==0:\r\n w=x[1]//x[2]\r\nelse:\r\n w=x[1]//x[2]+1\r\n\r\nprint(l*w)", "import math\r\n\r\nn,m,a = map(int,input().split())\r\nfirst = math.ceil(n/a)\r\nsecond = math.ceil(m/a)\r\nprint(first*second)", "n,m,o=map(int,input().split())\ns=((m+o-1)//o)\nr=((n+o-1)//o)\nprint(s*r)\n\t\t \t \t \t \t\t\t \t\t\t\t\t \t \t\t\t", "n,m,a = map(int,input().split())\r\nl = n//a\r\nif n%a != 0:\r\n l += 1\r\nb = m//a\r\nif m % a != 0:\r\n b += 1\r\nprint(l*b)", "m,n,a=map(int,input().split())\r\nw=m // -a\r\ns=n // -a\r\nprint(s*w)", "import math\r\n\r\ndef main():\r\n n, m, a = input().split()\r\n n=float(n) \r\n m=float(m)\r\n a=float(a)\r\n print(math.ceil(n/a)+(math.ceil((m-a)/a))*math.ceil(n/a))\r\n\r\nmain()", "entered_staff = input ()\nfinal_entered_staff = entered_staff.split()\nm = int (final_entered_staff[0])\nn = int (final_entered_staff[1])\na = int (final_entered_staff[2]) \nbricks_n_side = 0 \nbricks_m_side = 0 \nif not m/a == int(m/a):\n bricks_m_side = (int (m/a)) + 1\nelse:\n bricks_m_side = m/a\nif not n/a == int (n/a): \n bricks_n_side = (int(n/a)) + 1 \nelse:\n bricks_n_side = n/a \nprint (int(bricks_m_side * bricks_n_side)) \n", "x=(input())\r\ny=x.split()\r\nn=int(y[0])\r\nm=int(y[1])\r\na=int(y[2])\r\n\r\n\r\nif n%a!=0:\r\n c=int(n/a)+1\r\n \r\n \r\nelse:\r\n c=int(n/a)\r\nif m%a!=0:\r\n d=int(m/a)+1\r\nelse:\r\n d=int(m/a) \r\nprint(c*d) \r\n", "user_input = input(\"\")\n\ndef check(user_input):\n values = user_input.split()\n numbers = [int(num) for num in values]\n calculate(numbers[0], numbers[1], numbers[2])\n\ndef calculate(n, m, flagstone):\n width = 1\n height = 1\n width = analyse(n, flagstone)\n height = analyse(m, flagstone)\n print(width * height)\n \ndef analyse(number, flagstone):\n result = 0\n if number % flagstone != 0:\n result = int(number / flagstone)\n result += 1\n else:\n result = int(number / flagstone)\n return result\n\nif __name__ == \"__main__\":\n check(user_input)", "n,m,a=map(int,input().split())\r\nif ((n%a==0) and (m%a==0)):\r\n print((n*m)//(a*a))\r\nelif (n%a==0):\r\n print((n//a)*((m//a)+1) )\r\nelif(m%a==0):\r\n print(((n//a)+1)*(m//a) )\r\nelse:\r\n print(((n//a)+1)*((m//a)+1) )\r\n", "n, m, a = list(map(int, input().split()))\r\n\r\nx = (m // a) if (m % a) == 0 else ((m // a) + 1)\r\ny = (n // a) if (n % a) == 0 else ((n // a) + 1)\r\n\r\nprint(x * y)", "a,b,c = map(int,input().split())\r\nif a%c==0:\r\n r1 = a//c\r\nelse:\r\n r1 = a//c+1\r\nif b%c==0:\r\n r2 = b//c\r\nelse:\r\n r2 = b//c+1\r\nprint(r1*r2)", "(m,n,a) = map(int,input().split())\r\ndef f(x,y):\r\n if x % y == 0:\r\n return x // y\r\n else:\r\n return 1+x//y\r\nprint(f(m,a)*f(n,a))", "from math import ceil\n\n\nline = list(map(int , input().split()))\nn = line[0]\nm = line[1]\na = line[2]\nprint(ceil(n / a) * ceil(m / a))", "from math import ceil\r\ninfo=input().split(' ')\r\nn,m,a=int(info[0]),int(info[1]),int(info[2])\r\nprint(ceil(n/a)*ceil(m/a))", "import math\n\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed in each dimension\nflagstones_width = math.ceil(n / a)\nflagstones_height = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = flagstones_width * flagstones_height\n\nprint(total_flagstones)\n#the\n \t \t\t \t \t\t \t\t \t\t\t\t \t\t\t", "import math\r\n\r\ndef least_flagstones(n, m, a):\r\n # Calculate the number of flagstones needed for each dimension\r\n flagstones_n = math.ceil(n / a)\r\n flagstones_m = math.ceil(m / a)\r\n \r\n # Return the total number of flagstones needed\r\n return flagstones_n * flagstones_m\r\n\r\n# Read the input\r\nn, m, a = map(int, input().split())\r\n\r\n# Call the function and print the result\r\nresult = least_flagstones(n, m, a)\r\nprint(result)\r\n", "n,m,a = map(int , input().split())\r\nif n %a == 0 :\r\n val1 = n//a \r\nelse :\r\n val1 = n//a+1 \r\nif m%a == 0 :\r\n val2 = m//a \r\nelse :\r\n val2 = m//a +1 \r\nprint(val1 * val2 )", "m,n,a=map(int,input().split())\r\nx=0\r\nif m%a==0:\r\n\tx+=(m//a)\r\nelse:\r\n\tx+=(m//a+1)\r\nn-=a\r\nif n%a==0:\r\n\tx+=(n//a)*x\r\nelse:\r\n\tx+=(n//a+1)*x\r\nprint(x)", "import math\r\n\r\nn,m,a = map(int, input().split())\r\nresult = math.ceil(n/a) * math.ceil(m/a)\r\n\r\n\r\nprint (result)", "n, m, a = list(map(int, input().split()))\r\nx = n//a #1\r\ny = m//a #0\r\nif n % a != 0:\r\n x += 1\r\nif m % a != 0:\r\n y += 1\r\nprint(x*y)", "import math\r\n\r\nn,m,a = map(int, input().split())\r\n\r\nlen = n//a\r\nbre = m//a\r\n\r\nif n%a != 0:\r\n len += 1\r\n\r\nif m%a != 0:\r\n bre += 1\r\n\r\nprint(len * bre)\r\n\r\n\r\n", "import math\r\na,b,c=map(int,input().split())\r\nd= math.ceil(a/c)*math.ceil(b/c)\r\nprint(d)", "import math\nn, m, a = input().split()\nn = int(n)\nm = int(m)\na = int(a)\nprint(math.ceil(n/a)*math.ceil(m/a))\n", "n,m,a=map(int,input().split())\r\ndef lamtron(i):\r\n if i%1==0:\r\n return int(i)\r\n else:return int(i)+1\r\nprint(lamtron((n/a))*lamtron(m/a))", "n, m, a = list(map(int, input().split()))\r\nif n % a == 0:\r\n print((n//a)*(m//a)) if m % a == 0 else print((n//a)*(m//a+1))\r\nelse:\r\n print((n//a+1)*(m//a)) if m % a == 0 else print((n//a+1)*(m//a+1))", "n,m,a=map(int,input().split())\r\ns=0;\r\ns2=0;\r\nif n%a==0:\r\n s+=n//a\r\nelse:\r\n s+=n//a+1\r\nif m%a==0:\r\n s2+=m//a\r\nelse:\r\n s2+=m//a+1\r\nprint(s*s2)", "import math\r\nn,m,a = map(int, input().split())\r\nx = math.ceil(n / a)\r\ny = math.ceil(m / a)\r\nprint(x*y)\r\n", "import math\n\ndef least_flagstones(s, m, a):\n return math.ceil(s/a) * math.ceil(m/a)\n\ns, m, a = map(int, input().split())\nprint(least_flagstones(s, m, a))\n \t\t\t\t\t \t\t\t\t\t \t\t \t\t \t\t\t\t \t\t", "n,m,a = [int(i) for i in input().split()]\r\nif n%a ==0 :\r\n res = n//a\r\nelse:\r\n res = (n//a) + 1\r\nif m%a == 0:\r\n res = res *(m//a)\r\nelse:\r\n res = res *((m//a )+ 1)\r\nprint(res)\r\n", "from math import ceil\r\na,b,c=list(map(int,input().split()))\r\nn=ceil(a/c)\r\nm=ceil(b/c)\r\nfinal=n*m\r\nprint(final)", "from math import *\r\ndef solve():\r\n n, m, a = map(int, input().split(' '))\r\n \r\n # print(ceil(n / a))\r\n \r\n width = ceil(n / a)\r\n height = ceil(m / a)\r\n\r\n siz = width * height\r\n\r\n if siz < 1:\r\n siz = 1\r\n print(siz)\r\n \r\nsolve()\r\n \r\n \r\n ", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nlength = math.ceil(n/a)\r\nwidth = math.ceil(m/a)\r\nans = length * width\r\n\r\nprint(ans)", "\r\nfrom math import ceil\r\n\r\n# f = open('..\\\\input_output_text_files\\\\input.txt', 'r') # LOCAL\r\n# n = f.readline().strip() # LOCAL\r\n\r\nn = input().strip() # CODEFORCES\r\n\r\nl, b, w = map(int, n.split(\" \"))\r\n\r\nprint(ceil(l / w) * ceil(b / w))\r\n", "m,n,a = map (int,input().split())\r\nif m%a==0:\r\n val1 = m // a\r\nelse:\r\n val1 = m // a + 1 \r\nif n%a==0:\r\n val2= n // a\r\nelse:\r\n val2= n // a +1 \r\nprint (val1*val2)", "import math\r\n\r\ndef main():\r\n (m,n,a) = [int(x) for x in input().rstrip().split(\" \")]\r\n ans = math.ceil(m/a) * math.ceil(n/a)\r\n print(ans)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "def f(a, b):\r\n if a % b == 0:return a // b\r\n else:return a // b + 1\r\n \r\nn, m, k = map(int, input().split())\r\nfirst = f(n, k)\r\nscond = f(m, k)\r\nprint(first * scond)\r\n", "import math\r\na,b,c=map(int,input().split())\r\nx=math.ceil(a/c)*math.ceil(b/c)\r\nprint(int(x))", "n, m, a = map(int, input().split())\r\ntmp1, tmp2 = 0, 0\r\n\r\nif (n % a != 0):\r\n tmp1 += n//a + 1\r\nelse:\r\n tmp1 += n//a\r\n\r\nif (m % a != 0):\r\n tmp2 += m//a + 1\r\nelse:\r\n tmp2 += m//a\r\nprint(tmp1 * tmp2)", "n, m, a = map(int, input().split())\r\n\r\nrow = n // a\r\nif n % a > 0:\r\n\trow += 1\r\n\r\ncol = m // a\r\nif m % a > 0:\r\n\tcol += 1\r\n\r\nans = row * col\r\n\r\nprint(ans)", "import math\r\n\r\n\r\na, b, c = [int(x) for x in input().split()]\r\nt1 = int(math.ceil(a/c))*int(math.ceil(b/c))\r\n\r\n\r\nprint(t1)\r\n\r\n", "import math\n#\nn, m, a = map(int, input().split())\n\nrows = math.ceil(n / a)\ncolumns = math.ceil(m / a)\n\ntotal_flagstones = rows * columns\n\nprint(total_flagstones)\n\n \t \t\t \t\t\t \t\t\t \t \t\t\t \t \t", "n,m,a=map(int,input().split())\r\nsize=n*m\r\nflagstone=a*a\r\nb1=n//a\r\nb2=m//a\r\nif n%a !=0:\r\n b1+=1\r\nif m%a !=0:\r\n b2+=1\r\n\r\n \r\n \r\nprint(b1*b2)", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn, m, a = map(int,input().split())\r\n\r\nprint((math.ceil(n/a)) * (math.ceil(m/a)))", "import math\r\na,b,s = map(int,input().split())\r\nprint(math.ceil(a / s) * math.ceil(b / s))", "import math\r\nnumlist = input().split(\" \")\r\nfirst=int(numlist[0])\r\nsecond=int(numlist[1])\r\nthird = int(numlist[2])\r\nprint(str(math.ceil(first/third)*math.ceil(second/third)))", "# Program to find the least number of flagstones needed to pave the Square\r\n\r\nn,m,a=map(int,input().split())\r\n\r\nif n%a==0 and m%a==0 :\r\n k=n/a\r\n l=m/a\r\nelif n%a!=0 and m%a!=0:\r\n k=(n//a)+1\r\n l=(m//a)+1\r\nelif n%a==0 and m%a!=0:\r\n k=n/a\r\n l=(m//a)+1\r\nelif m%a==0 and n%a!=0:\r\n k=(n//a)+1\r\n l=m/a\r\nprint(int(k*l))", "n,m,a=map(int,input().split())\nnum_flagstones_n=-(-n//a)\nnum_flagstones_m=-(-m//a)\ntotal_flagstones=num_flagstones_n*num_flagstones_m\nprint(total_flagstones)\n\t \t \t \t \t\t \t \t \t\t\t\t \t\t", "#Theatre Square\r\n\r\nn,m,a = map(int,input().split())\r\n\r\ni = 0\r\nj = 0\r\n\r\nif(n%a == 0):\r\n\r\n\ti = n//a\r\nelse:\r\n\r\n\ti = (n//a) + 1\r\n\t# print(n//a)\r\n\r\nif(m%a == 0):\r\n\r\n\tj = m//a\r\nelse:\r\n\r\n\tj = (m//a) + 1\r\n\r\n# print(i,j)\r\nprint(i*j)\r\n", "n, m, a = [int(x) for x in input().split()]\r\np, q = n // a, m // a\r\nif a * p != n:\r\n p += 1\r\nif a * q != m:\r\n q += 1\r\nprint(p * q)", "import math\n\nn, m, a = map(int, input().split())\nnum_flagstones = math.ceil(n/a) * math.ceil(m/a)\nprint(num_flagstones)\n\t\t \t\t \t \t\t\t\t\t\t\t\t \t\t\t \t \t \t", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nvalue = math.ceil(m/a) * math.ceil(n/a)\r\nprint(value)\r\n", "def n_square(dims: list):\n dims[0] += (1 if dims[0]%dims[2] else 0) * dims[2] - dims[0]%dims[2]\n dims[1] += (1 if dims[1]%dims[2] else 0) * dims[2] - dims[1]%dims[2]\n return dims[0] // dims[2] * dims[1] // dims[2]\n\nprint(n_square(list(map(int, input().split())))) ", "all = input()\r\nall = all.split()\r\nsigr = int(all[0])\r\nsiga = int(all[1])\r\nplit = int(all[2])\r\nnam = 0\r\nif sigr%plit == 0 :\r\n nam += sigr/plit\r\nelse:\r\n nam += (sigr // plit)+1\r\nif siga%plit == 0:\r\n nam *= siga/plit\r\nelse:\r\n nam *= (siga//plit)+1\r\nprint(int(nam))", "n,m,a=map(int,input().split())\r\nl=n//a\r\nif (n%a!=0):\r\n l+=1\r\nb=m//a\r\nif (m%a!=0):\r\n b+=1\r\nprint(l*b)", "import math\n\nX,Y,A = list(map(lambda x:int(x),input(\"\").split(\" \")))\nprint(math.ceil(Y/A)*math.ceil(X/A))\n", "import math\r\n\r\nnumbers = [int(x) for x in input(\"\").split()]\r\nprint(math.ceil(numbers[0] / numbers[2]) * math.ceil(numbers[1] / numbers[2]))\r\n ", "from math import ceil\r\nn,m,a = map(int,input().split())\r\ni = ceil(n/a)\r\nj = ceil(m/a)\r\nprint(int(i*j))", "from math import ceil\r\n\r\nx, y, z = [int(x) for x in input().split()]\r\nans = ceil(x/z)*ceil(y/z)\r\nprint(ans)", "import math\r\n\r\nnma = input().split()\r\nprint(math.ceil((int(nma[0])/int(nma[2]))) * math.ceil((int(nma[1])/int(nma[2]))))", "a,b,c = map(int,input().split())\r\nf = a/c\r\ng = b/c\r\nif f % 1 == 0:\r\n d = f\r\nelse:d = int(f)+1\r\nif g % 1 == 0:\r\n e = g\r\nelse:e = int(g)+1\r\nprint(int(d*e))", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n p1=m//a\r\nelse:\r\n p1=m//a+1\r\n\r\nif n%a==0:\r\n p2=n//a\r\nelse:\r\n p2=n//a+1\r\n\r\nprint(p1*p2)", "n, m, a = map(int, input().split())\r\nif n%a == 0:\r\n nflags = n/a\r\nelse:\r\n nflags = n//a + 1\r\nif m%a == 0:\r\n mflags = m/a\r\nelse:\r\n mflags = m//a + 1\r\n \r\nprint(int(nflags*mflags))", "import math\r\ndef main():\r\n\tinput_string = input()\r\n\tinput_list = input_string.split()\r\n\tn, m, a = [int(x) for x in input_list]\r\n\tkq = math.ceil(n / a) * math.ceil(m / a)\r\n\tprint(kq)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "# n = 0\r\n# for _ in range(int(input())):\r\nimport math\r\nn, m, a = map(int,input().split())\r\nprint(math.ceil(m / a) * math.ceil(n / a))", "import math\r\nx, y, l = list(map(lambda e: int(e), input().split(\" \")))\r\nprint(math.ceil(x / l) * math.ceil(y / l))", "n, m, a = input().split()\na = int(a)\nn = int(n)\nm = int(m)\n\nx = int(n / a) # 6 / 4 => 1.5\nif n % a != 0:\n x += 1\n\ny = int(m / a) # 6 / 4 => 1.5\nif m % a != 0:\n y += 1\n\nprint(x * y)\n\n\t \t\t \t \t\t \t\t \t \t \t\t\t\t \t\t\t\t", "import math\r\n\r\np, r, d = map(int, input().split())\r\n\r\nnumFlagstone = math.ceil(p/d) * math.ceil(r/d)\r\n\r\nprint(numFlagstone)", "i = input().split()\ni = [int(x) for x in i]\nn, m, a = i\n\nres = 0\nnr = 0\nmr = 0\nif n<a or n == a:\n nr = 1\nelse:\n if n%a == 0:\n nr = int(n/a)\n else: \n nr = int(n/a)+1 \n \nif m<a or m == a:\n mr = 1\nelse:\n if m % a == 0:\n mr = int(m/a)\n else: \n mr = int(m/a)+1\n\nprint(nr*mr)", "i = input()\n\nn,m,a = [int(x) for x in i.split(\" \")]\n\nprint(((n+a-1)//a)*((m+a-1)//a))\n\n\n", "import math\r\nn, m, a=map(int, input().split())\r\nx, y=0, 0\r\nxa, ya=0, 0\r\nif n%a==0:\r\n x=n//a\r\nelse:\r\n x=n//a\r\n xa=1\r\nif m%a==0:\r\n y=m//a\r\nelse:\r\n y=m//a\r\n ya=1\r\ns=x*y\r\nif xa!=0 and ya==0:\r\n y=math.ceil(m/a)\r\n s=s+y\r\nelif ya!=0 and xa==0:\r\n x=math.ceil(n/a)\r\n s=s+x\r\nelif ya!=0 and xa!=0:\r\n y=math.floor(m/a)\r\n x=math.floor(n/a)\r\n s=s+y+x+1\r\nprint(s)\r\n \r\n \r\n \r\n", "n,m,a = map(int,input().split())\nx = 0\nk = 0\nif n % a != 0:\n k = n // a + 1\nelse:\n k = n // a\nif m % a != 0:\n x = m // a + 1\nelse:\n x = m // a\nprint(k * x)\n", "n, m, a = map(int, input().split())\r\n\r\n# Tính số lượng flagstones theo chiều dài và rộng của sân khấu\r\n# Số lượng flagstones cần là ceil(n/a) * ceil(m/a), với ceil(x) là hàm trần của x\r\nimport math\r\n\r\nnum_flagstones = math.ceil(n/a) * math.ceil(m/a)\r\n\r\nprint(num_flagstones)\r\n", "import math\r\nn, m, a=map(int, input().split())\r\n\r\nleft=math.ceil(n/a)\r\ntop=math.ceil(m/a)\r\na=top*left\r\n\r\nprint(a)", "def ceil(m):\n if m != int(m):\n return int(m) + 1\n else:\n return int(m)\n\nn, m, a = map(int, input().split())\nprint(ceil(m / a) * ceil(n / a))", "import math\nn,m,a=input().split()\nn=int(n)\nm=int(m)\na=int(a)\n\nif m%a==0:\n base=m/a\nelse:\n base=math.floor(m/a+1)\nif n%a==0:\n height=n/a\nelse:\n height=math.floor(n/a+1)\nprint(int(base*height))\n\t \t \t\t\t\t \t \t\t\t\t \t \t", "# your code goes here\r\nimport math\r\n\r\ndef get_input():\r\n\t'''This function gets n inputs (integers) from the user and stores them in the list l'''\r\n\tinput_ = input()\r\n\treturn(input_.split())\r\n\t\r\ndef get_number_of_flagstones(n, m, a):\r\n\treturn(math.ceil(n/a)*math.ceil(m/a))\r\n\t\r\ninputs = [int(i) for i in get_input()]\r\n\r\nprint(get_number_of_flagstones(inputs[0], inputs[1], inputs[2]))", "str = input('')\r\nlist = str.split(' ')\r\nm = int(list[0])\r\nn = int(list[1])\r\na = int(list[2])\r\n\r\nb = m//a if m%a==0 else (m//a)+1\r\nc = n//a if n%a==0 else (n//a)+1\r\n\r\nprint(b*c)", "a,b,c = map(int,input().split())\r\nif(a%c==0) and(b%c==0):\r\n print(a//c * b//c)\r\nelif(a%c==0 and b%c!=0) :\r\n print((a//c)*(b//c +1))\r\nelif(b%c==0 and a%c!=0) :\r\n print((a//c + 1)*(b//c ))\r\nelif(b%c!=0 and a%c!=0) :\r\n print((a//c + 1)*(b//c + 1 ))\r\n ", "import math\r\nsize = input()\r\nn, m, a = size.split(\" \")\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nprint(math.ceil(m/a)*math.ceil(n/a))\r\n", "n, m, a= map(int, input().split())\r\nif m%a== 0:\r\n res_1= m//a\r\nelse:\r\n res_1= m//a+ 1\r\n \r\nif n%a== 0:\r\n res_2= n//a\r\nelse:\r\n res_2= n//a+ 1\r\nprint(res_1*res_2)", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n x1=n//a\r\nelse:\r\n x1=n//a +1\r\nif m % a == 0:\r\n x2 = m // a\r\nelse:\r\n x2 = m // a + 1\r\n\r\nprint(x1*x2)\r\n", "n,m,a = map(int,input().split())\r\n\r\nans = 0\r\n\r\nt1 = 0\r\nt2 = 0\r\nif n%a:\r\n t1 += 1\r\nif m%a:\r\n t2 +=1\r\n\r\nt1 += n//a\r\nt2 += m//a\r\nprint(t1*t2)\r\n", "import math\r\na,b,c=map(int,input().split())\r\nm=math.ceil(a/c)\r\nn=math.ceil(b/c)\r\nprint(m*n)", "import math\r\n\r\nn, m, a = input().split()\r\n\r\nflags = math.ceil(int(n)/int(a)) * math.ceil(int(m)/int(a))\r\n\r\nprint(flags)", "n, m, a = list(map(int, input().split()))\r\n\r\nl = n / a\r\nif (l - int(l) > 0):\r\n l = int(l) + 1\r\nelse:\r\n l = int(l)\r\n\r\ns = m / a\r\nif (s - int(s) > 0):\r\n s = int(s) + 1\r\nelse:\r\n s = int(s)\r\n\r\nprint(l*s)", "from math import ceil\r\n\r\n\r\ndef theatre_square(value):\r\n values =value.split()\r\n width = (int)(values[0])\r\n height =(int)(values[1])\r\n square =(int)(values[2])\r\n possible_on_width = ceil(width/square)\r\n possible_on_height = ceil(height/square)\r\n return possible_on_height * possible_on_width\r\n\r\nvalue =input()\r\nprint(theatre_square(value))\r\n\r\n", "length, width, stone = map(int, input().split())\r\nnum_stones = ((length // stone) + (length % stone > 0)) * ((width // stone) + (width % stone > 0))\r\nprint(num_stones)", "import math\n\ndef least_flagstones(n, m, a):\n num_rows = math.ceil(n / a)\n num_columns = math.ceil(m / a)\n total_flagstones = num_rows * num_columns\n return total_flagstones\n\n# Read input\nn, m, a = map(int, input().split())\n\n# Calculate the least number of flagstones needed\nresult = least_flagstones(n, m, a)\n\n# Print the result\nprint(result)\n \t\t\t\t \t\t \t \t\t \t \t \t\t \t \t\t\t", "n,m,a=map(int,input().split())\r\nprint((-n//a)*(m//-a))\r\n", "import math\nn, m, a = map(int, input().split())\nflagstones = math.ceil(n / a) * math.ceil(m / a)\nprint(flagstones)\n\n \t\t\t \t\t \t \t \t \t \t\t\t \t \t", "import math\r\ndetails=(input(''))\r\ninfo=details.split()\r\ntheatre_hieght=int(info[0])\r\ntheatre_width=int(info[1])\r\nflagstone_hieght=int(info[2])\r\nnum_flagstone=math.ceil(theatre_hieght/flagstone_hieght)*math.ceil(theatre_width/flagstone_hieght)\r\nprint(num_flagstone)", "m, n, a = map(int, input().split())\n\ndef count(lth, s=a):\n l, r = 0, lth\n while 1:\n mid = int((l + r) / 2)\n if (mid - 1) * s > lth :\n r = mid\n elif mid * s < lth:\n l = mid + 1\n elif (mid - 1) * s < lth <= mid * s:\n return mid\n\nprint(count(m) * count(n))\n", "\r\nimport math\r\nn,m,a=map(int, input().split())\r\nn=math.ceil(n/a)\r\nm=math.ceil(m/a)\r\nprint(m*n)\r\n\r\n ", "n, m, a = list(map(lambda x: int(x), list(input().split())))\r\n\r\nox = n // a + 1 if n % a != 0 else n // a\r\noy = m // a + 1 if m % a != 0 else m // a\r\n\r\nprint(ox * oy)\r\n", "import math\r\n\r\na, b, c = [int(x) for x in input().split()]\r\nl = math.ceil(a / c)\r\nw = math.ceil(b / c)\r\nprint(l * w)", "import math\r\n\r\n# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required for rows and columns separately\r\nrows = math.ceil(n / a)\r\ncolumns = math.ceil(m / a)\r\n\r\n# Total flagstones required is the product of rows and columns\r\ntotal_flagstones = rows * columns\r\n\r\n# Print the result\r\nprint(total_flagstones)\r\n", "import math\n\n# Read input values\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for length and width\nnum_flagstones_length = math.ceil(n / a)\nnum_flagstones_width = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = num_flagstones_length * num_flagstones_width\n\n# Print the result\nprint(total_flagstones)\n\n\t\t \t \t\t \t\t\t\t \t\t\t \t\t \t \t \t", "n,m,a=map(int,input().split())\r\n\r\nif m%a==0:\r\n r1 = m//a\r\nelse:\r\n r1 = m//a+1\r\n\r\nif n%a==0:\r\n r2 = n//a\r\nelse:\r\n r2 = n//a+1\r\n\r\nprint(r1*r2)\r\n", "from math import ceil\r\nn,m,a = list(map(int, input().split()))\r\nprint(ceil(m/a) * ceil(n/a))", "import math\r\ndef main(s):\r\n n=int(s.split()[0])\r\n m=int(s.split()[1])\r\n a=int(s.split()[2])\r\n l=math.ceil(n/a)\r\n b=math.ceil(m/a)\r\n print(l*b)\r\nif __name__== \"__main__\" :\r\n s=input()\r\n main(s)\r\n", "import math\r\na = list(map(int, input().split()))\r\n\r\nprint(math.ceil(a[0]/a[2]) * math.ceil(a[1]/a[2]))", "from math import ceil\r\na,b,c = map(int, input().split())\r\nd = 1\r\ncount = 0\r\nd = d * ceil(a/c)\r\ncount = d\r\ncount = count *(ceil(b/c))\r\nprint(count)", "l = [int(x) for x in input().split()]\r\nn = l[0]\r\nm = l[1]\r\na = l[2]\r\nif n % a != 0 and m % a != 0:\r\n\tprint((n // a + 1) * (m // a + 1))\r\nelif n % a != 0 and m % a == 0:\r\n\tprint((n // a + 1) * (m // a))\r\nelif n % a == 0 and m % a != 0:\r\n\tprint((n // a) * (m // a + 1))\r\nelif n % a == 0 and m % a == 0:\r\n\tprint((n // a) * (m // a))", "n, m, a = [int(x) for x in input().split()]\r\ninitial_number = n // a + m // a\r\nreminder_n = (n % a == 0)\r\nreminder_m = (m % a == 0)\r\nreminder_width = n // a + int(reminder_n)\r\nreminder_height = m // a + int(reminder_m)\r\nprint((m // a + int(m % a != 0)) * (n // a + int(n % a != 0)))\r\n", "import math\r\nn,m,a=[int(i) for i in input().split(\" \")]\r\n\r\nrn=math.ceil(n/a)*math.ceil(m/a)\r\nprint(rn)", "n, m, a = map(int, input().split())\r\n\r\nrows = n // a\r\nif n % a != 0:\r\n rows += 1\r\n\r\ncolumns = m // a\r\nif m % a != 0:\r\n columns += 1\r\n\r\ntotal_flagstones = rows * columns\r\n\r\nprint(total_flagstones)\r\n", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom math import ceil\r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n,m,a = II()\r\n\r\n print(ceil(n/a)*ceil(m/a))\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nsolve()\r\n", "import math\r\nn, m, a = map(int, input().split())\r\npl=0\r\ni=0\r\n \r\nm-=a\r\nn/=a\r\npl+=math.ceil(n)\r\n\r\nif m!=0:\r\n pl+=pl*math.ceil(m/a)\r\n\r\nprint(pl)", "X,Y,Z=map(int,input().split())\r\nprint(-X//Z*(-Y//Z))", "import math\r\n\r\no, j, k = map(int, input().split())\r\n\r\n# calculate the number of flagstones required for width and length\r\nwidth = math.ceil(o / k)\r\nlength = math.ceil(j / k)\r\n\r\n# calculate the total number of flagstones required\r\ntotal = width * length\r\n\r\nprint(total)\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nx = math.ceil(n / a)\r\ny = math.ceil(m / a)\r\ntotal = x * y\r\n\r\nprint(total)\r\n", "import math\r\nn = input()\r\na = int(n.split()[0])\r\nb = int(n.split()[1])\r\nc = int(n.split()[2])\r\nprint(math.ceil(a/c)*math.ceil(b/c))\r\n\r\n", "m,n,a=map(int, input().split())\r\nif m%a==0:\r\n v1=m//a\r\nelse:\r\n v1=m//a+1\r\n\r\n\r\nif n%a==0:\r\n v2=n//a\r\nelse:\r\n v2=n//a+1\r\n\r\nprint(v1*v2)", "hi,wi,f=map(int,input().split())\r\nnumber_wi=wi/f\r\nnumber_hi=hi/f\r\ns=number_hi -int(number_hi) \r\nif s >0 or s >0.0 :\r\n number_hi+=1-s\r\ns=number_wi -int(number_wi)\r\nif s >0 or s >0.0 :\r\n number_wi+=1-s\r\nprint(int(number_wi*number_hi))", "a,b,c=map(int,input().split())\r\nflagstone=((a+c-1)//c)*((b+c-1)//c)\r\nprint(flagstone)", "# LUOGU_RID: 128613040\nn,m,a=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\n\r\nif not(m % a):\r\n m = m // a\r\nelse :\r\n m = m // a +1\r\n \r\nif not(n % a):\r\n n = n // a\r\nelse :\r\n n = n // a +1\r\n\r\nprint(m*n)", "# #\r\nimport math\r\nn , m , a = [int(x) for x in input().split()]\r\nprint(math.ceil(n/a) * math.ceil(m/a))", "# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the width and length\r\nwidth_flagstones = -(-n // a) # Equivalent to ceil(n/a)\r\nlength_flagstones = -(-m // a) # Equivalent to ceil(m/a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = width_flagstones * length_flagstones\r\n\r\n# Print the result\r\nprint(total_flagstones)\r\n", "import math\r\nk = input()\r\nk = k.split(\" \")\r\na = math.ceil(int(k[0]) / int(k[2]))\r\nb = math.ceil(int(k[1]) / int(k[2]))\r\nprint(a * b)\r\n", "from math import ceil\na, b, c = map(int, input().split())\nprint(int(ceil(a / c)) * int(ceil(b / c)))", "from math import ceil\r\nn, m, a = [int(x) for x in input().split()]\r\nnum_flagstone = ceil(m/a)*ceil(n/a)\r\nprint(num_flagstone)", "n, m, a = map(int, input().split())\r\n\r\nprint(((n // a + 1) if n % a != 0 else n // a) * ((m // a + 1) if m % a != 0 else m // a))", "import math\r\n\r\nn, m, a = input().split()\r\nx = float(n)/float(a)\r\ny = float(m)/float(a)\r\nz = math.ceil(y)*math.ceil(x)\r\nprint(z)\r\n\r\n", "#-------------------------------------------------------------------------------\r\n# Name: module1\r\n# Purpose:\r\n#\r\n# Author: vayun\r\n#\r\n# Created: 05/06/2022\r\n# Copyright: (c) vayun 2022\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\n\r\nimport sys\r\nimport math\r\n\r\n##def test(did_pass):\r\n## \"\"\" Print the result of a test. \"\"\"\r\n## linenum = sys._getframe(1).f_lineno # Get the caller's line number.\r\n## if did_pass:\r\n## msg = \"Test at line {0} ok.\".format(linenum)\r\n## else:\r\n## msg = (\"Test at line {0} FAILED.\".format(linenum))\r\n## print(msg)\r\n\r\ndef theatre(n, m, a):\r\n s1 = (n // a)\r\n s2 = (m // a)\r\n if n % a != 0:\r\n s1 += 1\r\n if m % a != 0:\r\n s2 += 1\r\n return s1 * s2\r\n(n, m, a) = map(int, input().split())\r\nprint(theatre(n, m, a))", "\r\n\r\nfrom math import ceil\r\n\r\n\r\ndef theatre_square(square: str):\r\n n, m, a = map(int, square.split())\r\n return ceil(n/a)*ceil(m/a)\r\n \r\nprint(theatre_square(input()))", "n,m,a = map(int, input().split())\n\nx = n//a\ny = m//a\n\nif n % a > 0:\n x = x + 1\n\nif m % a > 0:\n y = y + 1\n\nprint(x*y)\n \t \t\t\t \t \t \t \t\t\t\t \t \t \t \t", "import math\n\ndef least_flagstones(n, i, k):\n return math.ceil(n/k) * math.ceil(i/k)\n\nn, i, k = map(int, input().split())\nprint(least_flagstones(n, i, k))\n \t \t \t \t \t \t \t \t\t \t \t\t\t\t\t", "x,m,a=map(int,input().split())\r\nif x%a==0:\r\n\tc=0\r\nelse:\r\n\tc=1\r\nif m%a==0:\r\n\tc1=0\r\nelse:\r\n\tc1=1\r\nsq=(x//a)+c\r\nsq1=(m//a)+c1\r\nprint(sq*sq1)", "n, m, a = map(int, input().split())\r\n \r\n# Calculate the number of flagstones required for length\r\nlength_flagstones = n // a + (1 if n % a else 0)\r\n \r\n# Calculate the number of flagstones required for width\r\nwidth_flagstones = m // a + (1 if m % a else 0)\r\n \r\n# Calculate total flagstones and print the result\r\nprint(length_flagstones * width_flagstones)", "n, m, a = input().split()\r\nif int(n) % int(a) == 0:\r\n first = int(n) // int(a)\r\nelse:\r\n first = int(n) // int(a) + 1\r\nif int(m) % int(a) == 0:\r\n second = int(m) // int(a)\r\nelse:\r\n second = int(m) // int(a) + 1\r\nprint(first * second)", "import math\r\nn,m,a =map(int,input().split())\r\nflag_n=math.ceil(n/a)\r\nflag_m=math.ceil(m/a)\r\ntotal_flag=flag_n*flag_m\r\nprint(total_flag)", "from math import ceil as c\r\nx,y,z=[int(i) for i in input().split()]\r\nprint(c(x/z)*c(y/z))", "from math import ceil\n\ndef main():\n n, m, a = map(int, input().split())\n print(ceil(n / a) * ceil(m / a))\n\n\nif __name__ == \"__main__\":\n main()\n", "a = list(map(int, input().split()))\n\n#Square side X = a[0]\nx1 = a[0]\n#Square side Y = a[1]\ny1 = a[1]\n\n#side of smaller square = a[2]\nsquare_side_x = a[2]\nsquare_side_y = a[2]\n\nnum1 =1 \nnum2 = 1\n\nif x1 > square_side_x:\n\tif (x1%square_side_x == 0):\n\t\tnum1 = int(x1/square_side_x) \n\telse:\n\t\tnum1 = int(x1/square_side_x) +1\n\t# e.g. theatre side = 7, square = 3, num1 to cover = 7/3+1 = 2+1 = 3 because 3*3 = 9>7\n\n\nif y1 > square_side_y:\n\tif (y1%square_side_y == 0):\n\t\tnum2 = int(y1/square_side_y) \n\telse:\n\t\tnum2 = int(y1/square_side_y) +1\n\n\nprint(num1*num2)", "import math\n\nn, m, a = map(int, input().split()) # read the input values\n\n# calculate the number of flagstones needed\nnum_flagstones = math.ceil(n/a) * math.ceil(m/a)\n\nprint(num_flagstones)\n\n\t \t \t \t \t \t \t\t \t\t \t \t \t \t", "import math\n\ndef least_flagstones(aaa, www, eee):\n return math.ceil(aaa/eee) * math.ceil(www/eee)\n\naaa, www, eee = map(int, input().split())\nprint(least_flagstones(aaa, www, eee))\n\t \t\t \t\t\t\t\t\t\t \t\t\t \t \t\t\t\t", "n, m, a = map(int,input().split())\r\nrow = n // a\r\nif (n % a) > 0 :\r\n row += 1\r\ncolumn = m // a\r\nif (m % a) > 0 :\r\n column += 1\r\nres = row * column\r\nprint(res)\r\n", "\r\nx,y,z=map(int,input().split())\r\n\r\nif y%z==0:\r\n a=y//z\r\n \r\nelse:\r\n a=y//z+1\r\n \r\nif x%z ==0:\r\n d=x//z\r\n \r\nelse:\r\n d=x//z+1\r\n \r\nprint(a*d)", "import sys\r\n\r\ninputs = []\r\nfor line in sys.stdin:\r\n inputs.append(line)\r\n\r\ninput = inputs[0].strip().split()\r\nfor i in range(0, len(input)):\r\n input[i] = int(input[i])\r\nn = input[0]\r\nm = input[1]\r\na = input[2]\r\n\r\nnDirection = (n // a) + 1 if n % a != 0 else int(n / a)\r\nmDirection = (m // a) + 1 if m % a != 0 else int(m / a)\r\nprint(nDirection * mDirection)", "n,m,a = map(int,input().split())\r\nif 1<=n and m and a<=10**9:\r\n if n%a == 0:\r\n k = 0\r\n else:\r\n k = 1\r\n if m%a == 0:\r\n p = 0\r\n else:\r\n p = 1\r\n temp = (n//a)+k\r\n temp1 = (m//a)+p\r\n print (temp*temp1)\r\nelse:\r\n print(\"wrong input\")", "import math\r\nn, m, a = map(int, input().split())\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nimport math\r\nlst = [int(x) for x in input().split()]\r\nn = lst[0]\r\nm = lst[1]\r\na = lst[2]\r\n\r\nl = math.ceil(n/a)\r\nw = math.ceil(m/a)\r\nprint(l*w)\r\n", "import math\r\nn, m, k = map(int, input().split())\r\n\r\nh = math.ceil(m/k)\r\nw = math.ceil(n/k)\r\n\r\nprint(h*w)", "import math\r\nn,m,a = [int(x) for x in input().split()]\r\nx = int(math.ceil(n/a))\r\ny = int(math.ceil(m/a))\r\nprint(x*y)\r\n", "import math\n\ndef flagstones_needed(n, m, a):\n # Calculate the number of flagstones required along length\n length_flagstones = math.ceil(n/a)\n \n # Calculate the number of flagstones required along width\n width_flagstones = math.ceil(m/a)\n \n # Return the total number of flagstones\n return length_flagstones * width_flagstones\n\n# Example usage:\nn, m, a = map(int, input().split())\nprint(flagstones_needed(n, m, a))\n\n \t \t\t \t \t\t \t \t\t\t \t \t \t", "# __________________________\r\n# | { Meow Meow } |\r\n# |________________________|\r\n# \\(^ < ^)/\r\n# | | \r\n# |___| \r\n# | |\r\n# |_|_\r\ndef Solve():\r\n a,b,c=[int(i) for i in input().split()]\r\n r,t=a//c,b//c\r\n r += 1 if a % c > 0 else 0 \r\n t += 1 if b % c > 0 else 0\r\n print(r*t) \r\n# _________________________________________________________________ # \r\ndef meow():\r\n # t = int(input())\r\n # while t != 0:\r\n # Solve()\r\n # t-=1\r\n Solve()\r\nmeow() \r\n", "array=input().split()\r\nm=int(array[0])\r\nn=int(array[1])\r\na=int(array[2])\r\nx=m//a\r\ny=n//a\r\nif (m%a!=0):\r\n x=x+1\r\nif (n%a!=0):\r\n y=y+1 \r\nprint(x*y)", "ls = input().split(\" \")\r\nm,n,a = int(ls[0]),int(ls[1]),int(ls[2])\r\n \r\ndef bet(m):\r\n if m%a != 0:\r\n return m//a +1\r\n else : \r\n return m//a\r\nprint (bet(m)*bet(n))", "[n, m, a] = [int(i) for i in input().split()]\r\nif n%a==0:\r\n x=int(n/a)\r\nelse:\r\n x=int(n/a) + 1\r\n\r\nif m%a==0:\r\n y = int(m/a)\r\nelse:\r\n y = int(m/a) + 1\r\n\r\nprint(x*y)", "n, m, a = map(int, input().split())\r\nif n%a ==0:\r\n n1 = n//a\r\nelse:\r\n n1 = n//a+1\r\n\r\nif m%a == 0:\r\n m1 = m//a\r\nelse: \r\n m1 = m//a+1\r\n\r\nprint(m1*n1)\r\n", "import math\r\nm,n,a=map(int,input().split())\r\nx1=math.ceil(m/a)\r\nx2=math.ceil(n/a)\r\nprint(x1*x2)", "import math\n\n# Read the input\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\nnumFlagstones = math.ceil(n / a) * math.ceil(m / a)\n\n# Print the result\nprint(numFlagstones)\n\t\t \t\t \t \t\t \t\t\t\t \t\t\t\t\t\t\t\t \t", "sizes = input().split(\" \")\r\nn = int(sizes[0])\r\nm = int(sizes[1])\r\na = int(sizes[2])\r\n \r\nsquare_area = n * m\r\nstone_area = a * a\r\n \r\nx_stones = n // a\r\nif n % a != 0:\r\n x_stones += 1\r\n\r\ny_stones = m // a\r\nif m % a != 0:\r\n y_stones += 1\r\n\r\nprint (x_stones * y_stones)\r\n", "a , b ,c = map(int,input().split())\r\nd = a // c;\r\ne = b // c;\r\nif a % c != 0: d+=1\r\nif b % c != 0: e+=1\r\nprint(str(d*e))\r\n\r\n", "#!/usr/bin/env python3\n# https://codeforces.com/contest/1/problem/A\nm, n, a = map(int, input().split())\nprint(((m - 1) // a + 1) * ((n - 1) // a + 1))\n", "import math\n\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for the length and width separately\nlength_flagstones = math.ceil(n / a)\nwidth_flagstones = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = length_flagstones * width_flagstones\n\nprint(total_flagstones)\n\n\t\t\t\t\t\t\t \t \t \t \t \t\t\t\t", "from math import ceil\r\n\r\n\r\nx,y,t = [int(i) for i in input().split()]\r\na = ceil(x/t)\r\nb = ceil(y/t)\r\nprint(a*b)", "a,b,c=map(int,input().split())\r\nif a%c==0:\r\n x=a//c\r\nelse:\r\n x=a//c+1\r\nif b%c==0:\r\n y=b//c\r\nelse:\r\n y=b//c+1\r\nprint(x*y)", "#math library imported for ceil() function to round up value\r\nimport math\r\n\r\n#splits 3 inputted nums on same line into 3 strings in list with no spaces\r\nn, m, a =input().split(' ')\r\n\r\n#finds the number of tiles that will fit on the n side of the square, rounds it up to whole val\r\nnumaons = math.ceil(int(n)/int(a))\r\n\r\n#\" \" but on m side\r\nnumaoms = math.ceil(int(m)/int(a))\r\n\r\n#finds the no. tiles in rectangle and casts to string for printing\r\nprint(str(numaoms*numaons))\r\n", "inp = list(map(int, input().split()))\nm,n,a = inp[0], inp[1], inp[2]\nans = ((m+a-1)//a)*((n+a-1)//a)\nprint(ans)", "n, m, a = map(int, input().split())\n\nd = n + (a - (n % a)) % a\nr = m + (a - (m % a)) % a\nsqe = a ** 2\n\nif n * m <= a ** 2:\n num_flagstones = 1\nelse:\n num_flagstones = (d * r) // sqe\n\nprint(num_flagstones)\n", "\r\n\r\nn,m,a = [int(i) for i in input().split()]\r\n\r\nprint(n//-a*(m//-a))\r\n", "n, m, o = map( int, input().split() ) \nnum_flagstones_n = (n + o - 1) // o\nnum_flagstones_m = (m + o - 1) // o\ntotal_flagstones = num_flagstones_n * num_flagstones_m\nprint(total_flagstones)\n \t \t\t\t\t\t\t \t \t \t\t \t\t \t\t\t", "N,M,O=map(int,input().split())\r\nif M%O == 0:\r\n sol = M//O\r\nelse:\r\n sol = M//O+1\r\nif N%O == 0:\r\n res = N//O\r\nelse:\r\n res = N//O+1\r\nprint(sol*res) \r\n ", "n,m,a = map(int,input().split())\r\nca,cb = 0,0\r\nif(n%a == 0):\r\n ca += n//a\r\nelse:\r\n ca += (n//a + 1)\r\nif(m%a == 0):\r\n cb += m//a\r\nelse:\r\n cb += (m//a + 1)\r\nprint(ca*cb)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nflagstones_needed_length = math.ceil(n / a)\r\nflagstones_needed_width = math.ceil(m / a)\r\n\r\ntotal_flagstones_needed = flagstones_needed_length * flagstones_needed_width\r\n\r\nprint(total_flagstones_needed)\r\n", "n, m, a = map(int, input().split())\r\n\r\nq1, r1 = divmod(n, a)\r\nif r1:\r\n q1 += 1\r\n\r\nq2, r2 = divmod(m, a)\r\nif r2:\r\n q2 += 1\r\n\r\nprint(q1*q2)\r\n", "n, m, a = map(int, input().split())\r\nflagstones_in_length = (n + a - 1) // a\r\nflagstones_in_width = (m + a - 1) //a\r\ntotal_flagstones = flagstones_in_length * flagstones_in_width\r\nprint(total_flagstones)\r\n", "import math\r\nm,n,a=map(int, input().split())\r\nc=math.ceil(m/a)\r\ns=math.ceil(n/a)\r\nS=c*s\r\nprint(S)", "import math\r\nn, m, a = list(map(int, input().split()))\r\nnflags = math.ceil(n/a)\r\nmflags = math.ceil(m/a)\r\nprint(nflags*mflags)", "n,m,a = map(int,input().split())\r\nif m%a == 0:\r\n val1= m //a\r\nelse:\r\n val1= m//a +1\r\nif n%a ==0:\r\n val2=n//a\r\nelse:\r\n val2=n//a+1\r\nprint(val1*val2)", "from math import ceil\r\nn, m, a = map(int, input().split())\r\nanswer = ceil(m / a) * ceil(n / a)\r\nprint(answer)", "def ceil(a,b,c):\r\n if a%c==0:\r\n if b%c==0:\r\n print(a//c*b//c)\r\n else:\r\n print(a//c*(b//c+1))\r\n else:\r\n if b%c==0:\r\n print((a//c+1)*(b//c))\r\n else:\r\n print((a//c+1)*(b//c+1))\r\ns=input().split()\r\nceil(int(s[0]),int(s[1]),int(s[2]))\r\n", "from math import *\r\n\r\nn,m,a=map(int,input().split())\r\n\r\nresult=ceil(n/a)*ceil(m/a)\r\nprint(result)", "import math\r\nn, m, a= map(int,(input().split()))\r\nop=math.ceil(n/a)* math.ceil(m/a)\r\nprint(op)\r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n[n, m, a] = inlt()\r\nprint(math.ceil(n/a) * math.ceil(m/a))", "x=input().split()\r\nn=int(x[0])\r\nm=int(x[1])\r\na=int(x[2])\r\nl=0\r\nw=0\r\nif n%a==0:\r\n x=int(n/a)\r\nelse:\r\n x=int(n/a)+1\r\nif m%a==0:\r\n y=int(m/a)\r\nelse:\r\n y=int(m/a)+1\r\nprint(x*y)", "n, m, k = [int(s) for s in input().split()]\r\nif (n % k != 0):\r\n n = n + (k - n % k)\r\nif (m % k != 0):\r\n m = m + (k - m % k)\r\nprint(n * m // (k * k))\r\n", "import math\r\nnma= input()\r\nnma = nma.split()\r\nn= int(nma[0])\r\nm = int(nma[1])\r\na = int(nma[2])\r\nhight = round(m/a)\r\nwidth = round(n/a)\r\nif hight*a < m:\r\n hight += 1\r\nif width*a < n:\r\n width += 1\r\nif hight == 0 and width == 0:\r\n print(1)\r\nelif width == 0:\r\n print(hight)\r\nelif hight == 0:\r\n print(width)\r\nelse:\r\n print(hight * width)\r\n", "import math\r\nn, m, a = map(int, input().split())\r\n\r\nresult = 0\r\n\r\nif n % a == 0 or m % a == 0:\r\n result += (math.ceil(n/a)) * (math.ceil(m/a))\r\nelse:\r\n result += (math.ceil(n/a) * math.ceil(m/a))\r\n\r\nprint(int(result))", "# Theatre Square\r\n# https://codeforces.com/problemset/problem/1/A\r\n\r\n# Input and formatting:\r\nn, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\n\r\n# Processing:\r\nif n % a == 0:\r\n n = n / a\r\nelse:\r\n n = int(n / a) + 1\r\n\r\nif m % a == 0:\r\n m = m / a\r\nelse:\r\n m = int(m / a) + 1\r\n\r\n\r\nn_tiles = m * n\r\n\r\n# Output:\r\nprint(int(n_tiles))\r\n", "import math\r\nnums = [int(x) for x in input().split(\" \")]\r\nprint(math.ceil(nums[0] / nums[2]) * math.ceil(nums[1] / nums[2]))\r\n", "import math\r\n\r\ndef min_flagstones_to_pave_theatre_square(n, m, a):\r\n flagstones_in_n = math.ceil(n / a)\r\n flagstones_in_m = math.ceil(m / a)\r\n total_flagstones = flagstones_in_n * flagstones_in_m\r\n\r\n return total_flagstones\r\nn, m, a = map(int, input().split())\r\nresult = min_flagstones_to_pave_theatre_square(n, m, a)\r\nprint(result)\r\n", "def ceildiv(x, d):\r\n\tif x % d == 0:\r\n\t\treturn x // d\r\n\telse:\r\n\t\treturn 1 + (x // d)\r\n\r\nn, m, k = map(int, input().split())\r\nprint(ceildiv(n, k) * ceildiv(m, k))", "x,c,v=map(int,input().split())\r\nwidth=int(x/v)\r\nlength=int(c/v)\r\nif x%v >0:\r\n width=width+1\r\n \r\nif c%v >0:\r\n \r\n length =length+1\r\n \r\nprint( width*length )\r\n ", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required for rows and columns\r\nnum_rows = n // a\r\nnum_cols = m // a\r\n\r\n# Check if there are any remaining rows or columns\r\nif n % a != 0:\r\n num_rows += 1\r\nif m % a != 0:\r\n num_cols += 1\r\n\r\n# Calculate the total number of flagstones required\r\nnum_flagstones = num_rows * num_cols\r\n\r\nprint(num_flagstones)\r\n", "n,m,a = map(int,input().split())\ny = n//a\nx = m//a\nif n%a!=0:\n\ty+=1\nif m%a!=0:\n\tx+=1\nprint(x*y)", "line = input()\r\nline = line.split(\" \")\r\nn = int(line[0])\r\nm = int(line[1])\r\na = int(line[2])\r\nlargo = int(n/a)\r\nif n % a > 0:\r\n largo += 1\r\nancho = int(m/a)\r\nif m % a > 0:\r\n ancho += 1\r\nresult = ancho * largo\r\nprint(int(result))", "import math\r\nn,m,a = map(int,input().split())\r\n\r\nr = m*n\r\ns = a*a\r\n\r\nprint(math.ceil(m/a)*math.ceil(n/a))\r\n\r\n", "import math\r\ndef math_life(n,m,a):\r\n return math.ceil(m/a)*math.ceil(n/a)\r\nn,m,a=map(int,input().split())\r\nprint(math_life(n,m,a))\r\n", "import math\nn, m, a = map(int, input().split())\nflagstones_width = math.ceil(n / a)\nflagstones_length = math.ceil(m / a)\ntotal_flagstones = flagstones_width * flagstones_length\nprint(total_flagstones)\n\n \t \t\t\t\t \t\t\t \t\t\t\t\t\t \t \t\t \t", "n, m, a = map(int,input().split())\r\n\r\nxn = n // a\r\nif n%a != 0:\r\n xn += 1\r\nxm = m // a\r\nif m%a != 0:\r\n xm += 1\r\nprint(xn *xm)", "def row_counter(n, m, a):\r\n row = max(n, m)//a\r\n if max(n, m) % a != 0:\r\n row += 1\r\n return row\r\n\r\n\r\ndef colm_counter(n, m, a):\r\n rem = min(n, m)-a\r\n colm = 0\r\n if rem > 0:\r\n colm = rem//a\r\n if rem % a != 0:\r\n colm += 1\r\n return colm\r\n\r\n\r\nn, m, a = map(int, input().split())\r\nnumber_of_needed = row_counter(n, m, a)*(colm_counter(n, m, a)+1)\r\nprint(number_of_needed)\r\n", "from math import ceil\r\na,b,c = map(int,input().split())\r\nX = ceil(a/c)\r\nY = ceil(b/c)\r\nprint(int(X*Y))", "lista = list(map(int, input().split()))\nn = lista[0]\nm = lista[1]\na = lista[2]\n\nwid = n/a\nlent = m/a\n\nif (n%a) > 0:\n wid = wid+1\n\nif (m%a) > 0:\n lent = lent+1\n\nnumber = int(wid) * int(lent)\nprint(number)\n", "n,m,a=[int(x) for x in input().split()]\r\nif n%a==0:\r\n n=n//a\r\nelse:\r\n n=n//a+1\r\nif m%a==0:\r\n m=m//a\r\nelse:\r\n m=m//a+1\r\nprint(n*m)", "x,y,z=map(int,input().split())\r\na=(x+z-1) // z\r\nb=(y+z-1) // z\r\ntotal=a*b\r\nprint(total)\r\n\r\n", "n , m , a = map(int,(input().split()))\r\nif 1 > n and m and a > 10**9:\r\n print(\"invalid input\")\r\nelse:\r\n if n % a == 0:\r\n n1 = n / a\r\n else:\r\n n1 = int((n / a) + 1)\r\n if m % a == 0:\r\n m1 = m / a\r\n else:\r\n m1 = int((m / a) + 1)\r\n count = n1 * m1\r\n print('%d' %(count))\r\n\r\n\r\n", "n,m,a=map(int,input().split())\r\ni=n//a\r\nj=m//a\r\nif(i*a)!=n:\r\n i+=1\r\nif(j*a)!=m:\r\n j+=1\r\nprint(i*j)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n\r\nlength = math.ceil(n / a)\r\nwidth = math.ceil(m / a)\r\n\r\n\r\ntotal_flagstones = length* width\r\n\r\nprint(total_flagstones)\r\n", "import math\r\nn,m,a=map(int,input().split())\r\nb = math.ceil(m/a)\r\nc = math.ceil(n/a)\r\nprint(b*c)", "n,m,a=tuple(map(int, input().split()))\r\nif m%a==0:\r\n \r\n i=(m//a)\r\nelse:\r\n i=(m//a)+1\r\nif n%a==0:\r\n \r\n j=(n//a)\r\nelse:\r\n j=(n//a)+1\r\nprint(i*j)\r\n", "a=list(map(int,input().split()))\r\nprint(((a[0]+a[2]-1)//a[2])*((a[1]+a[2]-1)//a[2]))\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the rows and columns separately\r\nrows_needed = math.ceil(n / a)\r\ncolumns_needed = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = rows_needed * columns_needed\r\n\r\nprint(total_flagstones)\r\n\r\n", "a, b, c = map(int, input().split())\r\nd = a // c\r\nif d * c < a:\r\n d += 1\r\ne = b // c\r\nif e * c < b:\r\n e += 1\r\nprint(d*e)", "import math\r\n\r\nn_str = input()\r\n\r\nn_list = n_str.split()\r\n\r\nn_arr = []\r\n\r\nfor i in n_list:\r\n n_arr.append(i)\r\n\r\nn = int(n_arr[0])\r\nm = int(n_arr[1])\r\na = int(n_arr[2])\r\n\r\nst1 = math.ceil(n/a)\r\nst2 = math.ceil(m/a)\r\n\r\nsol = st1*st2\r\n\r\nprint(sol)\r\n", "n,m,a = map(int,input().split())\r\nr = n%a\r\nc = m%a\r\nr1 = int(n/a)\r\nc1 = int(m/a)\r\nif(n>=a and m>=a):\r\n if (r>=1 and c>=1):\r\n print(((r1+1)*(c1+1)))\r\n elif(r==0 and c>=1):\r\n print((r1*(c1+1)))\r\n elif(r>=1 and c==0):\r\n print(((r1+1)*c1))\r\n elif(a==1):\r\n print(n*m)\r\n elif(r ==0 and c == 0):\r\n print(r1*c1)\r\n else:\r\n print(\"\")\r\n \r\nelse:\r\n print(\"1\")", "nma = input()\r\nnma = nma.split(\" \")\r\nn = int(nma[0])\r\nm = int(nma[1])\r\na = int(nma[2])\r\ndim1 = int(n/a)\r\nif not n%a==0:\r\n dim1+=1\r\ndim2 = int(m/a)\r\nif not m%a==0:\r\n dim2+=1\r\nprint(dim1*dim2)\r\n", "n,m,a=map(int,input().split())\r\nside1=n//a\r\nside2=m//a\r\nif (n%a!=0):\r\n side1+=1\r\nif (m%a!=0):\r\n side2+=1\r\nprint(side1*side2)", "p, m, a = map(int, input().split())\nprint(((p + a - 1) // a) * ((m + a - 1) // a))\n \t\t \t \t \t \t \t\t\t\t \t \t \t\t\t", "import math\r\ns=str(input())\r\nentrada=s.split(\" \")\r\nm=int(entrada[0])\r\nn=int(entrada[1])\r\nx=int(entrada[2])\r\ndiv1= math.ceil(m/x)\r\ndiv2= math.ceil(n/x)\r\nif m*n<=x*x:\r\n divf=1\r\nelse:\r\n divf=div1*div2\r\n\r\nprint(int(divf))", "a,b,c=map(int,input().split())\r\nif a%c==0:\r\n r=a//c\r\nelse:\r\n r=(a//c)+1\r\nif b%c==0:\r\n r1=b//c\r\nelse:\r\n r1=(b//c)+1\r\nprint(r1*r)", "n, m, a = map(int, input().split())\r\n\r\nnum_tiles_n = n // a\r\nif n % a != 0:\r\n num_tiles_n += 1\r\n\r\nnum_tiles_m = m // a\r\nif m % a != 0:\r\n num_tiles_m += 1\r\n\r\nnum_tiles = num_tiles_n * num_tiles_m\r\n\r\nprint(num_tiles)", "# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the rows and columns\r\nrows = (n + a - 1) // a\r\ncolumns = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = rows * columns\r\n\r\n# Print the result\r\nprint(total_flagstones)\r\n", "import math \r\nn,m,a = list(map(int, input().split()))\r\ncount1 = 0\r\ncount2 = 0\r\n\r\ncount1 = math.ceil(m/a)\r\ncount2 = math.ceil(n/a)\r\n\r\nprint(count2*count1)\r\n ", "import math\r\ninput = input(\"\")\r\nlist = input.split()\r\n\r\nm = int(list[0])\r\nn = int(list[1])\r\na = int(list[2])\r\n\r\nprint(math.ceil(m/a) * math.ceil(n/a))", "import math\r\nn , m , a = map(int,input().split())\r\ntot = 0\r\n\r\nif n >= a and m >= a:\r\n tot = math.ceil(n / a) * math.ceil(m / a)\r\n\r\nelif n >= a and m < a:\r\n tot = math.ceil(n / a)\r\nelif n < a and m >= a:\r\n tot = math.ceil( m / a)\r\nelse:\r\n tot = 1\r\n \r\nprint(tot)", "import sys\r\nfrom operator import mul\r\nn, m, a = map(int, sys.stdin.readline().split())\r\nprint (((n + a - 1) // a) * ((m + a - 1) // a), sep=';')", "import math\r\n\r\nrow, column, side = map(int, input().split())\r\n\r\nvert = math.ceil(row / side)\r\nhori = math.ceil(column / side)\r\n\r\nprint(vert * hori)", "# @Date : 2023-03-28 16:48:11\r\n# @Author : man_in_errors\r\n\r\n\r\nimport os\r\nfrom math import ceil \r\nii = lambda: int(input())\r\nmi = lambda: [int(i) for i in input().split()]\r\npi = lambda i: print(i,end=\" \")\r\ndef solve():\r\n m,n,a=mi()\r\n print(ceil(m/a)*ceil(n/a))\r\n \r\n\r\n#for _ in range(1,ii()+1):\r\nsolve()\r\n", "n, m, a = [int(x) for x in input().split()]\r\n\r\nif n%a == 0:\r\n r1 = n//a\r\nelse:\r\n r1 = (n//a) + 1\r\nif m%a == 0:\r\n r2 = m//a\r\nelse:\r\n r2 = (m//a) +1\r\nprint(r1*r2)", "import math\r\nn, m, a = map(int, input().split())\r\nflagstones_in_n = math.ceil(n / a)\r\nflagstones_in_m = math.ceil(m / a)\r\ntotal_flagstones = flagstones_in_n * flagstones_in_m\r\nprint(total_flagstones)", "n,m,a=map(int,input().split())\r\nneeded=((n+a-1)//a)*((m+a-1)//a)\r\nprint(needed)", "from math import ceil\r\nn, P, a = map(int, input().split())\r\nA = ceil(n/a)\r\nV = ceil(P/a)\r\nprint(int(A*V))\r\n", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the length and width\r\nlength_flagstones = (n + a - 1) // a\r\nwidth_flagstones = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\n# Output the result\r\nprint(total_flagstones)", "import sys\r\nfrom math import ceil\r\nn,m,a=list(map(int,sys.stdin.readline().split()))\r\nsys.stdout.write(str(ceil(m/a)*ceil(n/a))+'\\n')\r\n", "a,b,c=map(int,input().split())\r\nprint(a//-c*(b//-c))", "\r\nn, m, a = map(int, input().split())\r\n\r\nforn = n // a\r\nif n % a != 0:\r\n forn += 1\r\n\r\nform = m // a\r\nif m % a != 0:\r\n form += 1\r\n\r\nprint(form * forn)", "import math\na = input()\nn, m, a = a.split(' ')\nn = float(n)\nm = float(m)\na = float(a)\n\nprint(math.ceil(n / a) * math.ceil(m / a))\n", "import math\n\nn, m, a = map(int, input().split())\n\nnum_flagstones_n = math.ceil(n/a)\nnum_flagstones_m = math.ceil(m/a)\n\ntotal_flagstones = num_flagstones_n * num_flagstones_m\n\nprint(total_flagstones)\n\n \t\t\t \t\t \t\t \t\t\t\t \t \t\t \t \t", "import math\r\n\r\ninputString = input().split()\r\ncountOfN = math.ceil(int(inputString[0]) / int(inputString[2]))\r\ncountOfM = math.ceil(int(inputString[1]) / int(inputString[2]))\r\n\r\nprint(countOfN * countOfM)", "n, m, a = map(int, input().split())\r\nif n % a == 0:\r\n kp = n//a\r\nelse:\r\n kp = (n//a) + 1\r\n\r\nif m % a == 0:\r\n kp *= (m//a)\r\nelse:\r\n kp *= ((m//a) + 1)\r\n\r\nprint(kp)\r\n", "import math\r\n\r\ni = input()\r\nmeasures = i.split()\r\nn = int(measures[0])\r\nm = int(measures[1])\r\na = int(measures[2])\r\n\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a)\r\nfinal = str(x * y)\r\n\r\nprint(final)", "import math\r\np,q,a=map(int,input().split())\r\nflagstones=math.ceil(p/a)*math.ceil(q/a)\r\nprint(flagstones)", "n,m,a = map(int,input().split())\r\nif m%a == 0:\r\n v1 = m//a\r\nelse:\r\n v1 = m//a+1\r\nif n%a == 0:\r\n v2 = n//a\r\nelse:\r\n v2 = n//a+1\r\nprint(v1*v2)", "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\n\ndef solve():\n n, m, a = inlt()\n\n length = math.ceil(n / a)\n width = math.ceil(m / a)\n print(length*width)\n\n\nif __name__ == \"__main__\":\n solve()", "import math\r\n\r\nn,m,a=map(int,input().split())\r\n\r\nx=math.ceil(n/a)\r\ny=math.ceil(m/a)\r\n\r\nprint(x*(y))", "n, m, a = list(map(int, input().split()))\r\nl1 = n // a + (n % a > 0)\r\nl2 = m // a + (m % a > 0)\r\nprint(l1 * l2)", "import math\n\n# Read input\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for the width and length\nwidth_stones = math.ceil(n / a)\nlength_stones = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_stones = width_stones * length_stones\n\n# Print the result\nprint(total_stones)\n\n \t \t\t\t\t \t \t\t\t \t \t \t \t \t\t", "import math\r\nn, m, a = list(map(lambda x: int(x), input().split(\" \")))\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "n, m, a = map(int, input().split())\r\nn_count = int(n/a) + (n % a != 0)\r\nm_count = int(m/a) + (m % a != 0)\r\ncount = n_count * m_count\r\nprint(count)", "import math\r\nn,m,a=input().split(\" \")\r\nprint(math.ceil(int(n)/int(a))*math.ceil(int(m)/int(a)))", "import math\r\n\r\ndef main():\r\n n,m,a = [int(x) for x in input(\"\").split()]\r\n print(math.ceil(n/a)*math.ceil(m/a))\r\nmain()\r\n", "def square(n,m,a):\r\n if n%a>0:\r\n d1=(n//a)+1\r\n else:\r\n d1=n//a\r\n if m%a>0:\r\n d2=(m//a)+1\r\n else:\r\n d2=m//a\r\n return d1*d2\r\n \r\n\r\nn,m,a=map(int,input().split())\r\nprint(square(n,m,a))", "import math\r\n\r\nm,n,a=input().split(\" \")\r\nm,n,a=int(m),int(n),int(a)\r\nmnum,nnum=0,0\r\nmnum=math.ceil(m/a)\r\nnnum=math.ceil(n/a)\r\nprint(nnum*mnum)", "import math\r\n \r\nn, m, a = map(int, input().split())\r\n \r\nrows = math.ceil(n / a)\r\ncolumns = math.ceil(m / a)\r\n \r\nanswer = rows * columns\r\n \r\nprint(answer)", "n,m,a=map(int,input().split())\r\ns=1\r\nif n>a:\r\n s=s*((n+a-1)//a)\r\nif m>a:\r\n s=s*((m+a-1)//a)\r\nprint(s)\r\n", "x,y,z=map(int,input().split())\r\nc=0\r\nd=0\r\nif(x%z == 0):\r\n c=0\r\nelse:\r\n c=1\r\nif(y%z == 0):\r\n d=0\r\nelse:\r\n d=1\r\nt=(x//z)+c\r\nt1=(y//z)+d\r\nprint(t*t1)", "length, width, side_length = map(int, input().split())\r\n\r\nif length % side_length == 0:\r\n extra_length = 0\r\nelse:\r\n extra_length = 1\r\n\r\nif width % side_length == 0:\r\n extra_width = 0\r\nelse:\r\n extra_width = 1\r\n\r\nnumber_of_squares_in_length = (length // side_length) + extra_length\r\nnumber_of_squares_in_width = (width // side_length) + extra_width\r\n\r\ntotal_squares = number_of_squares_in_length * number_of_squares_in_width\r\nprint(total_squares)\r\n", "a=input().split()\r\nq=int(a[0])\r\nw=int(a[1])\r\ne=int(a[2])\r\ny=((q+e)-1)//e\r\nu=((w+e)-1)//e\r\nprint(y*u)", "import math\r\nnumbers = input().split()\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\na = int(numbers[2])\r\nif m/a == 1 and n/a == 1:\r\n print(1)\r\nelse:\r\n print(math.ceil(m/a) * math.ceil(n/a))", "n, m, a = map(int,input().split())\r\nif (n < a) or (m < a):\r\n if (n % a == 0) or (m % a == 0):\r\n print(max(n,m) // a)\r\n else:\r\n print(max(n,m) // a + 1)\r\nelif (n % a == 0) and (m % a == 0):\r\n print((n*m) // (a*a))\r\nelif n % a == 0:\r\n print((n//a)*(m//a) + n // a)\r\nelif m % a == 0:\r\n print((n//a)*(m//a) + m // a)\r\nelse:\r\n print((n//a)*(m//a) + m // a + n // a + 1)", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required to cover the length of the square\r\nlength_flagstones = (n + a - 1) // a\r\n\r\n# Calculate the number of flagstones required to cover the width of the square\r\nwidth_flagstones = (m + a - 1) // a\r\n\r\n# Multiply the two numbers to get the total number of flagstones required\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\nprint(total_flagstones)\r\n", "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\nk=ll();print(((k[0]-1)//k[2]+1)*((k[1]-1)//k[2]+1))", "import math\n\ndef least_flagstones(b, m, v):\n return math.ceil(b/v) * math.ceil(m/v)\n\nb, m, v = map(int, input().split())\nprint (least_flagstones(b, m, v))\n \t \t\t \t \t\t \t\t \t \t \t\t \t\t", "import math\nn,m,a=map(int,input().split())\nt=math.ceil(n/a)\ns=math.ceil(m/a)\nr=t*s\nprint(int(r))\n \t\t \t\t\t \t\t \t \t \t", "length,width,tile= map(int, input().split())\r\n#length,width,area=input().split()\r\n#length = int(lenght)\r\n#width = int(width)\r\narea = int(length*width)\r\nif length%tile==0:\r\n squaresx = int(length//tile)\r\n #print('q')\r\nelse:\r\n squaresx = int(length // tile) + 1\r\n #print('w')\r\nif width%tile == 0:\r\n squaresy = int(width//tile)\r\n #print('e')\r\nelse:\r\n squaresy = int(width//tile) + 1\r\n #print('r')\r\n\r\nprint (squaresx*squaresy)", "import math\n\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed to cover the length and width\nflagstones_length = math.ceil(n / a)\nflagstones_width = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = flagstones_length * flagstones_width\n\nprint(total_flagstones)\n\n \t\t \t \t\t \t \t \t \t \t \t\t\t", "theatre_height, theatre_width, flagstone_side = map(int, input().split())\n\nnumber_of_flagstones_per_column = theatre_height // flagstone_side + (1 if theatre_height % flagstone_side != 0 else 0)\nnumber_of_columns = theatre_width // flagstone_side + (1 if theatre_width % flagstone_side != 0 else 0)\n\nprint(number_of_flagstones_per_column * number_of_columns)\n", "import math\r\nn,m,a = map(int,input().split())\r\nnum = math.ceil(m/a) * math.ceil(n/a)\r\nprint(num)", "import math as ma\r\nm,n,a = list(map(int,input().split()))\r\nprint(ma.ceil(m/a)*ma.ceil(n/a))", "n,m,a=input().split()\ntime=0\nif n==m:\n if int(m)%int(a)==0:\n time=int(m)//int(a)\n else:\n time=(int(m)//int(a))+1\n print(time*time)\nelse:\n if int(m)%int(a)==0:\n time=(int(m)//int(a))\n if int(n)%int(a)==0:\n time=time*(int(n)//int(a))\n print(time)\n else:\n time=time*((int(n)//int(a))+1)\n print(time)\n else:\n time=(int(m)//int(a))+1\n if int(n)%int(a)==0:\n time=time*(int(n)//int(a))\n print(time)\n else:\n time=time*((int(n)//int(a))+1)\n print(time)", "n, m, a = map(int, input().split())\r\n\r\nl = n // a\r\nif n % a != 0:\r\n l += 1\r\n \r\nr = m // a\r\nif m % a != 0:\r\n r += 1\r\n \r\nprint(l * r)", "n,m,a=map(int,input().split())\r\nx = n%a\r\nlength=n//a\r\nif x>0 or length==0:\r\n length += 1\r\ny = m%a\r\nwidth=m//a\r\nif y>0 or width==0:\r\n width += 1\r\nprint(length*width)", "n, m, a = list(map(int, input().split()))\r\nrem1 = n % a\r\nif rem1 == 0:\r\n l = (n//a) \r\nelse:\r\n l = (n//a) + 1\r\nrem2 = m % a\r\nif rem2 == 0:\r\n w = (m//a) \r\nelse:\r\n w = (m//a) + 1\r\nprint(l * w )", "import math\n\n# Input: n, m, a\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for the length and width\nflagstones_needed_length = math.ceil(n / a)\nflagstones_needed_width = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones_needed = flagstones_needed_length * flagstones_needed_width\n\n# Output the result\nprint(total_flagstones_needed)\n\n \t \t\t \t \t\t \t\t \t\t\t\t \t\t \t \t \t", "from math import ceil\r\nn,m,b = map(int,input().split())\r\nA = ceil(n/b)\r\nB = ceil(m/b)\r\nprint(int(A*B))", "from math import ceil\nX,Y,Z = list(map(int,input().split()))\nN = ceil(X/Z)\nM = ceil(Y/Z)\nprint(int(N*M))\n\t\t \t \t \t\t\t \t\t\t \t\t \t \t\t \t\t\t", "from math import ceil\r\nn1,m1,a1 = map(int,input().split())\r\nA1 = ceil(n1/a1)\r\nB1 = ceil(m1/a1)\r\nprint(int(A1*B1))\r\n", "import math\r\nn, m, a = [ int(x) for x in input().split() ]\r\nif n*m <= a*a:\r\n print(1)\r\nelse:\r\n if n > a :\r\n n = int ( math.ceil( n /a ) ) * a\r\n if m > a :\r\n m = int ( math.ceil( m /a ) ) * a\r\n print(int((n*m)/(a*a)))", "x, y, z = map(int, input().split())\r\n\r\nif x%z == 0:\r\n ans = x//z\r\nelse:\r\n ans = x//z + 1\r\n\r\nif y%z == 0:\r\n ans = (y//z)*ans\r\nelse:\r\n ans = ans*(y//z + 1)\r\n \r\nprint(ans)", "\nfrom math import ceil\n\ndef solution(): \n n, m, a = map(int, input().split())\n \n print(ceil(m / a) * ceil(n / a))\n \nsolution()", "from math import ceil\r\n\r\nline=input().split()\r\nn=int(line[0])\r\nm=int(line[1])\r\na=int(line[2])\r\n\r\nres= ceil(n/a)*ceil(m/a)\r\nprint(res)", "import math\r\nm, n, a = [int(i) for i in input().split()]\r\nprint(math.ceil(m/a)*math.ceil(n/a))\r\n", "\r\nimport math\r\nn , m , a = list(map(int , input().split()))\r\nprint(math.ceil(n/a) * math.ceil(m/a))", "import math\nn, m, a = map(int, input().split())\nflagstone = math.ceil(n/a) * math.ceil(m/a)\nprint(flagstone)\n\n \t \t \t \t\t \t\t\t \t \t", "\ndef main():\n\t\n\tv = [int (x) for x in input().split(' ')]\n\tn = v[0]\n\tm = v[1]\n\ta = v[2]\n\t\n\tnumH = n // a\n\tnumW = m // a\n\t\n\tif n%a == 0 and m%a == 0:\n\t\tprint(numH * numW)\n\telif n%a == 0 and m%a != 0:\n\t\tprint(numH * (numW + 1))\n\telif m%a == 0 and n%a != 0:\n\t\tprint((numH + 1) * numW)\n\telse:\n\t\tprint((numH + 1) * (numW + 1))\n\t\t\n\nif __name__ == \"__main__\":\n\tmain()\n", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed in width and height directions\r\nwidth_flagstones = (n + a - 1) // a # Ceiling division\r\nheight_flagstones = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = width_flagstones * height_flagstones\r\n\r\nprint(total_flagstones)\r\n", "n,m,a= input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\n\r\nif (m%a==0):\r\n i=0\r\nelse:\r\n i=1\r\n \r\nif (n%a==0):\r\n j=0\r\nelse:\r\n j=1\r\nt1=(m//a)+i\r\nt2=(n//a)+j\r\n\r\nprint(t1*t2)\r\n\r\n \r\n", "n,m,a=list(map(int,input().split()))\r\nif n%a==0:\r\n r=n//a\r\nelse:\r\n r=n//a+1\r\nif m%a==0:\r\n r1=m//a\r\nelse:\r\n r1=m//a+1\r\nprint(r1*r)", "m,n,a = [int(x) for x in input().split(\" \")]\r\nprint(((m//a)+int(m%a!=0))*((n//a)+int(n%a!=0)))", "n, m, a = map(int, input().split())\r\n\r\nancho = n // a if n % a == 0 else n // a + 1\r\nlargo = m // a if m % a == 0 else m // a + 1\r\n\r\narea = ancho * largo\r\n\r\nprint(area)", "n, m, a = map(int, input().split(\" \"))\r\n\r\nma = m//a\r\nif m % a > 0: ma += 1\r\n\r\nna = n//a\r\nif n % a > 0: na += 1\r\n\r\nprint(na*ma)", "n, m, a = map(int, input().split())\r\nost1 = 0\r\nif n % a != 0:\r\n ost1 = 1\r\nd = n // a + ost1\r\nost2 = 0\r\nif m % a != 0:\r\n ost2 = 1\r\ns = m // a + ost2\r\nprint(d * s)", "import math\r\nn , m , a = map(int , input().split())\r\narea1 = m/a\r\nx = math.ceil(area1)\r\narea2 = n / a\r\ny = math.ceil(area2)\r\nprint(x*y)", "n,m,a = list(map(int,input().split(' ')))\r\nans = n//a\r\nif n%a != 0 :\r\n ans += 1\r\nif m%a != 0:\r\n ans *= (m//a + 1)\r\nelse:\r\n ans *= (m//a)\r\nprint(ans)", "text = input().split(\" \")\r\ntext = [int(x) for x in text]\r\n\r\nn = text[0]\r\nm = text[1]\r\na = text[2]\r\n\r\nnumber_from_n = n//a\r\nif n % a != 0:\r\n number_from_n += 1\r\n\r\nnumber_from_m = m//a\r\n\r\nif m % a != 0:\r\n number_from_m += 1\r\n\r\nprint(number_from_n*number_from_m)", "n, m, a = list(map(int, input().split()))\r\nf = 0\r\ng = 0\r\n\r\nif n % a == 0:\r\n f = n // a\r\nelse:\r\n f = n // a + 1\r\n\r\nif m % a == 0:\r\n g = m // a\r\nelse:\r\n g = m // a + 1\r\n\r\nprint(f*g)\r\n", "n,m,a=map(int,input().split())\nprint(int((n-1)/a+1)*int((m-1)/a+1))", "m,n,a = map(int,input().split())\r\nh = m // a\r\nk = n // a\r\nif(m%a!=0):\r\n h+=1\r\nif(n%a!=0):\r\n k+=1\r\nprint(h*k)", "n, m, a = list(map(int, input().split(\" \")))\r\n\r\ndef how_many_squares(n, m, a):\r\n na = n // a\r\n ma = m // a\r\n if n % a != 0: na += 1\r\n if m % a != 0: ma += 1\r\n return na*ma\r\n\r\nprint(how_many_squares(n, m, a))\r\n", "\r\nimport math\r\nnumber = input()\r\nnumbers = number.split(' ')\r\n\r\n\r\nm = int(numbers[0])\r\nn = int(numbers[1])\r\na = int(numbers[2])\r\nan = math.ceil(n/a)\r\nam = math.ceil(m/a)\r\nprint(an * am)\r\n", "stri=input().split()\r\nn=int(stri[0])\r\nm=int(stri[1])\r\na=int(stri[2])\r\n\r\nif a==1:\r\n print(n*m)\r\nelif a>m and a>n:\r\n print(1)\r\nelif a<=m and a<=n:\r\n mu=m%a\r\n nu=n%a\r\n if mu!=0:\r\n mu=1\r\n if nu!=0:\r\n nu=1\r\n print((n//a+nu)*(m//a+mu))\r\nelse:\r\n if a>m:\r\n nu=n%a\r\n if nu!=0:\r\n nu=1\r\n print(n//a+nu) \r\n \r\n if a>n:\r\n mu=m%a\r\n if mu!=0:\r\n mu=1\r\n print(n//a+mu)", "n, m, a = map(int, input().split())\r\n\r\ndef cs(n, m, a):\r\n if n%a ==0:s1= n//a\r\n else:s1= n//a+1\r\n if m%a ==0:s2= m//a\r\n else:s2= m//a+1\r\n return s1*s2\r\n\r\nprint(cs(n, m, a))", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nancho = math.ceil(n/a)\r\nlargo = math.ceil(m/a)\r\narea = ancho * largo\r\nprint(area)", "import math\r\n\r\nx = input().split(' ')\r\n\r\nprint(math.ceil(int(x[0])/int(x[2]))*math.ceil(int(x[1])/int(x[2])))", "import math\r\n\r\nn, m, a = map(int, input().split())\r\ns1 = math.ceil(n/a)\r\ns2 = math.ceil(m/a)\r\n\r\nprint(s1*s2)", "import math\r\na=list(map(int,input().split()))\r\nprint(math.ceil(a[0]/a[-1])*math.ceil(a[-2]/a[-1]))", "n,m,a=map(int,input().split())\r\nif (n % a == 0):\r\n w = int(n / a)\r\nelse:\r\n w = int(n / a + 1)\r\n\r\nif (m % a == 0):\r\n h = int(m / a)\r\nelse:\r\n h = int(m / a + 1)\r\n\r\nprint(h * w)", "n,m,a=map(int,input().split())\r\nif n%a==0 and m%a==0:\r\n print((n//a)*(m//a))\r\nelif n%a!=0 and m%a==0:\r\n print(((n//a)+1)*(m//a))\r\nelif n%a==0 and m%a!=0:\r\n print((n//a)*((m//a)+1))\r\nelse:\r\n print(((n//a)+1)*((m//a)+1))", "a , b , c = map(int , input().split(' '))\r\n\r\nimport math\r\nm = math.ceil(a/c)*math.ceil(b/c)\r\n\r\nprint(m)\r\n", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n b=0\r\nelse:\r\n b=1\r\nif m%a==0:\r\n c=0\r\nelse:\r\n c=1\r\nn1=(n//a)+b\r\nm1=(m//a)+c\r\nprint(n1*m1)", "# LUOGU_RID: 125268743\nimport math\n# Theatre Square\n\ninput_set = input().split(' ')\ninput_set = [int(item) for item in input_set]\n\nn = int(input_set[0])\nm = int(input_set[1])\na = int(input_set[2])\n\nnum1 = math.ceil(n/a)\nnum2 = math.ceil(m/a)\n\nprint(num1*num2)\n", "from math import ceil\r\ns = input()\r\nls = list(s.split())\r\nm, n, a = int(ls[0]), int(ls[1]), int(ls[2])\r\nprint(ceil(n/a)*ceil(m/a))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m,a=map(int,input().split())\r\nif n%a>0:\r\n n=n//a+1\r\nelse:\r\n n=n//a\r\nif m%a>0:\r\n m=m//a+1\r\nelse:\r\n m=m//a\r\nprint(n*m) \r\n", "\r\nlist1 = list(map(int,input().split()))\r\nn = list1[0]\r\nm = list1[1]\r\na = list1[2]\r\nans = 0\r\npiece1 = n//a\r\npiece2 = m//a\r\nif n%a > 0:\r\n piece1 += 1\r\nif m%a > 0:\r\n piece2 += 1\r\nprint(piece1*piece2)", "n, m, a = map(int, input().split()) # Read the input values\n\n# Calculate the number of flagstones needed in both dimensions\n# Use integer division to round up if needed\nrows = -(-n // a)\ncols = -(-m // a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = rows * cols\n\nprint(total_flagstones) # Print the result\n\n\t \t \t\t \t \t\t\t \t \t\t \t", "n, m, a = map(int, input().split()) \r\nwidth_flagstones = (n + a - 1) // a\r\nlength_flagstones = (m + a - 1) //a\r\ntotal_flagstones = width_flagstones * length_flagstones\r\nprint(total_flagstones)\r\n", "def w(f,g):\r\n if f%g == 0:\r\n return(f//g)\r\n else:\r\n return(((f-f%g)//g)+1)\r\n\r\nx = input()\r\ny = str(x).split()\r\ny = [int(i) for i in y]\r\nn = y[0]\r\nm = y[1]\r\na = y[2]\r\nb = w(n,a)\r\nc = w(m,a)\r\nprint(b*c)", "details = input().split()\r\nn = int(details[0])\r\nm = int(details[1])\r\na = int(details[2])\r\n\r\nif n % a == 0:\r\n long = n // a\r\nelse:\r\n long = n // a + 1\r\n\r\nif m % a == 0:\r\n width = m // a\r\nelse:\r\n width = m // a + 1\r\n\r\nprint(long * width)", "import math\n\nn, m, a = map(int, input().split(\" \"))\n\nrow = math.ceil(n / a)\ncol = math.ceil(m / a)\nprint(row * col)\n", "import sys\r\nfrom math import ceil\r\n\r\n[n, m, a] = list(map(int, sys.stdin.readline().split()))\r\nprint(ceil(m / a) * ceil(n / a))", "m, n, a = input().split()\r\nm = int(m)\r\nn = int(n)\r\na = int(a)\r\nx = m // a\r\ny = n // a\r\nif m % a > 0:\r\n x = x + 1\r\nif n % a > 0:\r\n y = y + 1\r\nprint(x*y)", "from math import ceil\n\nn,m,a = map(int, input().split())\nx = int(ceil(n/a))\ny = int(x * ceil(m/a))\nif m < a:\n print(f\"{x}\")\nelse:\n print(f\"{y}\")\n\n\n", "data = input()\r\n\r\nnums = list(map(int, data.split()))\r\n\r\nn = nums[0]\r\nm = nums[1]\r\na = nums[2]\r\n\r\nprint(((n + a - 1) // a) * ((m + a - 1) // a))\r\n\r\n\r\n", "n,m,a = map(int , input().split(' '))\r\nx = m // a\r\ny = n // a\r\nif m%a > 0:\r\n\tx += 1\r\nif n%a > 0:\r\n\ty += 1\r\n\r\nsum = x*y\r\nprint(sum)", "a,b,c=map(int,input().split())\r\nd=-a//c\r\nprint(d*(-b//c))", "import math\r\n\r\nx, y, z = map(int, input().split())\r\na = math.ceil(x/z)\r\nb = math.ceil(y/z)\r\nprint(a*b)\r\n", "# cook your dish here\r\nimport math\r\n\r\nn, m, a = map(int, input().split())\r\nans = math.ceil(n/a)*math.ceil(m/a)\r\nprint(ans)", "Inp=input().split(\" \")\r\ntemp1=int(Inp[0])//int(Inp[2])\r\nif temp1==int(Inp[0])/int(Inp[2]):\r\n temp1=temp1\r\nelse:\r\n temp1+=1\r\ntemp2=int(Inp[1])//int(Inp[2])\r\nif temp2==int(Inp[1])/int(Inp[2]):\r\n temp2=temp2\r\nelse:\r\n temp2+=1\r\nresult=temp1*temp2\r\nprint(result)", "p,k,v=map(int,input().split())\r\nprint(-p//v*(-k//v))", "import math \r\nn, m, a = map(int, input().split())\r\nhorizontal_flagstone = math.ceil(n / a)\r\nvertical_flagstone = math.ceil(m / a)\r\ntotal_flagstone = horizontal_flagstone * vertical_flagstone\r\n\r\nprint(total_flagstone)", "n, m, a = [int(x) for x in input().split(\" \")]\r\nx = n // a\r\nif n % a > 0:\r\n x += 1\r\ny = m // a\r\nif m % a > 0:\r\n y += 1\r\nprint(x*y) ", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n v1=m//a\r\nelse:\r\n v1=m//a+1\r\nif n%a==0:\r\n v2=n//a\r\nelse:\r\n v2=n//a+1\r\nprint(v1*v2) \r\n ", "import math\r\nz =input().split()\r\nm=float(z[0])\r\nn=float(z[1])\r\na=float(z[2])\r\ni = math.ceil(m/a)*math.ceil(n/a)\r\nprint(i)\r\n", "h, j, p=map(int, input().split())\r\n\r\nres=((h // p) + (1 if h % p != 0 else 0))*((j // p) + (1 if j % p != 0 else 0))\r\n\r\nprint(res)", "import math\r\n\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nflagstones_n = math.ceil(n / a)\r\nflagstones_m = math.ceil(m / a)\r\n\r\ntotal_flagstones = flagstones_n * flagstones_m\r\n\r\nprint(total_flagstones)\r\n", "ch=input()\r\nn,m,a=map(int,ch.split())\r\nk=n%a\r\nl=m%a\r\nif k==0 and l==0 :\r\n print((n//a)*(m//a))\r\nelif k==0 and l!=0:\r\n print((n//a)*((m//a)+1))\r\nelif k!=0 and l ==0:\r\n print((m//a)*((n//a)+1))\r\nelse:\r\n print(((m//a)+1)*((n//a)+1))\r\n", "n,m,a =[int(i) for i in input().split()]\r\nlen1=n//a;\r\nif(n%a!=0):\r\n \r\n len1+=1\r\nbre=m//a\r\nif(m%a!=0):\r\n \r\n bre+=1\r\nprint(bre*len1)", "import math\r\n\r\nlength, width, flagstone = [int(f) for f in input().split()]\r\n\r\nwidth_flagstones = math.ceil(length / flagstone)\r\nlength_flagstones = math.ceil(width / flagstone)\r\n\r\ntotal_flagstones = width_flagstones * length_flagstones\r\n\r\nprint(total_flagstones)", "import math\r\nb=input()\r\nc=b.split()\r\nn=int(c[0])\r\nm=int(c[1])\r\na=int(c[2])\r\no=math.ceil(n/a)\r\np=math.ceil(m/a)\r\nprint(o*p)", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n c1=n//a\r\nelse:\r\n c1=(n//a)+1\r\nif m%a==0:\r\n c2=m//a\r\nelse:\r\n c2=(m//a)+1\r\nres=c1*c2\r\nprint(res)", "n, m, a = map(int, input().split())\r\n\r\nlength_flagstones = n // a if n % a == 0 else n // a + 1\r\nwidth_flagstones = m // a if m % a == 0 else m // a + 1\r\n\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\nprint(total_flagstones)\r\n", "n, m, a = map(int, input().split())\r\nq = n // a\r\nif n % a != 0:\r\n q += 1\r\nt = m // a\r\nif m % a != 0:\r\n t += 1\r\nprint(t * q)", "import math\r\n\r\nn, m, a = tuple(int(i) for i in input().split())\r\nk = math.ceil(m / a)\r\nl = math.ceil(n / a)\r\nprint(k*l)", "n, m, a = map(int, input().split())\r\nc1 = 1\r\nc2 = 1\r\nt = n // a\r\nr = m // a\r\nif n % a != 0:\r\n t += 1\r\nif m % a != 0:\r\n r += 1\r\nprint(t * r)", "line_input = input()\r\ninputs = line_input.split()\r\nn = int(inputs[0])\r\nm = int(inputs[1])\r\na = int(inputs[2])\r\ndef ceil(x):\r\n if int(x) - x == 0:\r\n return int(x)\r\n else:\r\n return int(x+1)\r\n \r\nb = ceil(n/a)\r\nc = ceil(m/a)\r\nd = b*c\r\nprint(d)\r\n", "# def f(arr):\n\narr = list(map(int,input().split()))\n\nn,m,a = arr[0],arr[1],arr[2]\n\nres=1\nif n%a==0:\n res*=(n//a)\nelse:\n res*=(n//a+1)\n\nif m%a==0:\n res*=(m//a)\nelse:\n res*=(m//a+1)\n\nprint(res)\n\n# print(count)\n", "countx = 0\r\ncounty = 0\r\nn,m,a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nif (m%a == 0):\r\n countx = m//a\r\nelse:\r\n countx = m//a +1\r\nif (n%a == 0):\r\n county = n//a\r\nelse:\r\n county = n//a +1\r\nprint(countx * county)", "import math\r\n\r\nn, m, a = [int(a) for a in input().split()]\r\n\r\nprint(math.ceil(n / a) * math.ceil(m / a))\r\n", "ch=input()\r\nch=ch.split( )\r\nm=int(ch[0])\r\nn=int(ch[1])\r\na=int(ch[2])\r\nif m%a!=0 :\r\n m=a*(m//a+1)\r\nif n%a!=0:\r\n n=a*(n//a+1)\r\nprint((m*n)//(a*a))\r\n", "import math\r\nn,m,a = map(int,input().split())\r\nflag=math.ceil(n/a)*math.ceil(m/a)\r\nprint(flag)", "import math\r\na,b,c = map(int,input().split())\r\nprint(math.ceil(a/c)*math.ceil(b/c))", "import math\nsr,t,xi=map(int,input().split())\nVal=math.ceil(sr/xi)*math.ceil(t/xi)\nprint(Val)\n \t\t \t \t\t \t \t \t\t\t\t \t\t \t\t", "import math\r\ndef domino(numbers):\r\n num = numbers.split(\" \")\r\n n= int(num[0])\r\n m=int(num[1])\r\n a=int(num[2])\r\n return (math.ceil(n/a) * math.ceil(m/a))\r\nnumbers=input(\"\")\r\nprint(domino(numbers))\r\n", "n, m, a = map(int, input().split())\r\nlength_flagstones = (n + a - 1) // a\r\nwidth_flagstones = (m + a - 1) // a\r\n\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\nprint(total_flagstones)\r\n", "import math as mt\r\n\r\nn,m,a=map(int,input().split())\r\n\r\nl1=mt.ceil(n/a)\r\nl2=mt.ceil(m/a)\r\n\r\nprint(l1*l2)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the width and length separately\r\nwidth_flagstones = math.ceil(n / a)\r\nlength_flagstones = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = width_flagstones * length_flagstones\r\n\r\nprint(total_flagstones)\r\n", "a,b,c=map(int,input().split())\r\nd=a%c\r\nx=a//c\r\ne=b%c\r\ny=b//c\r\nif d>0:\r\n x=x+1\r\nif e>0:\r\n y=y+1\r\ns=x*y\r\nprint(s)\r\n\r\n", "n, m, a = map(int,input().split())\r\n\r\nif n%a > 0:\r\n nn = n//a + 1\r\nelse:\r\n nn = int(n/a)\r\n\r\nif m%a > 0:\r\n mm = m//a + 1\r\nelse:\r\n mm = int(m/a)\r\n\r\nprint(nn*mm)", "entry=input()\narr=entry.split(' ')\nbase=int(arr[0])\naltura=int(arr[1])\nloza=int(arr[2])\nejex=0\nejey=0\nif (base % loza)==0:\n ejex=base//loza\nelse:\n ejex=base//loza\n ejex = ejex + 1\n\nif (altura % loza)==0:\n ejey=altura//loza\nelse:\n ejey=altura//loza\n ejey=ejey+1\n\nrespuesta=ejex*ejey\nprint(respuesta)\n\n", "n,m,a=input().split()\r\ndef y():\r\n y=0\r\n if int(m)%int(a)==0:\r\n y=int(m)//int(a)\r\n else:\r\n y=int(m)//int(a)+1\r\n return y\r\ndef x():\r\n x=0\r\n if int(n)%int(a)==0:\r\n x=int(n)//int(a)\r\n else:\r\n x=int(n)//int(a)+1\r\n return x\r\nprint(x()*y())", "n, m, a = map(int, input().split())\r\nif m % a == 0 and n % a == 0:\r\n p = m // a\r\n q = n // a\r\nelif m % a == 0 and n % a != 0:\r\n p = m // a\r\n q = n // a + 1\r\nelif m % a != 0 and n % a == 0:\r\n p = m // a + 1\r\n q = n // a\r\nelse:\r\n p = m // a + 1\r\n q = n // a + 1\r\nprint(p * q)\r\n", "p,r,l=map(int,input().split()) \r\n \r\nif r%l==0: \r\n q1=r//l\r\nelse: \r\n q1=r//l+1 \r\n \r\nif p%l==0: \r\n q2=p//l \r\nelse: \r\n q2=p//l+1 \r\n \r\nprint(q1*q2)", "from math import ceil\r\na,b,c=map(int,input().split())\r\nA=ceil(a/c)\r\nB=ceil(b/c)\r\nprint(int(A*B))", "from math import ceil\r\nm,n,a=map(int,input().split())\r\nprint(ceil(n/a)*ceil(m/a))", "n,m,a=map(int,input().split())\r\nl=-(-n//a)\r\nw=-(-m//a)\r\nans=l*w\r\nprint(ans)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nx = math.ceil(n / a)\r\ny = math.ceil(m / a)\r\nresult = x * y\r\nprint(result)", "# LUOGU_RID: 100949263\nn, m, a = map(int, input().split())\nx = (n + a - 1) // a\ny = (m + a - 1) // a\nprint(x * y)", "'''\n A. Theatre Square\n https://github.com/0xPand0ra\n'''\n\ndef func(n, m, a):\n if m%a > 0:\n m+=(a-m%a)\n if n%a > 0:\n n+=(a-n%a) \n\n print(int(m/a)*int(n/a))\n\n \n\n\nif __name__ == '__main__':\n n, m, a = input().split()\n m = int(m)\n n = int(n)\n a = int(a)\n\n func(n, m, a)\n ", "n, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for the length and width\nlength_flagstones = (n + a - 1) // a\nwidth_flagstones = (m + a - 1) // a\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = length_flagstones * width_flagstones\n\nprint(total_flagstones)\n\n\t \t \t\t\t \t\t\t\t\t \t\t\t\t \t", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\nx = int(a[2])\r\ncnt = 0\r\n#############\r\ncnt1 = n//x\r\nif (n%x) != 0:\r\n cnt1 += 1\r\ncnt2 = m//x\r\nif (m%x) != 0:\r\n cnt2 += 1\r\ntotal = cnt1 * cnt2\r\n#############\r\nprint (total)\r\n", "\r\ndef getint():\r\n return [int(i) for i in input().split()]\r\ndef get():\r\n return int(input())\r\ndef getstr():\r\n return [i for i in input().split()]\r\ndef S():\r\n for test in range(int(input())):\r\n solve()\r\nimport math\r\nimport itertools as it\r\nimport bisect\r\nimport time\r\nimport collections as ct\r\n\r\ndef lower_bound(a,x):\r\n l=-1\r\n r=len(a)\r\n while l+1!=r:\r\n mid=l+r>>1\r\n if a[mid]<x:\r\n l=mid\r\n else:\r\n r=mid\r\n return r\r\ndef upper_bound(a,x):\r\n l=-1\r\n r=len(a)\r\n while l+1!=r:\r\n mid=l+r>>1\r\n if a[mid]<=x:\r\n l=mid\r\n else:\r\n r=mid\r\n return r\r\ndef solve():\r\n n,m,a=getint()\r\n ans=math.ceil(n/a)*math.ceil(m/a)\r\n print(ans)\r\n\r\n\r\n\r\nsolve()\r\n", "import math\r\nn,m,a =map(int,input().split())\r\n\r\nwidth=math.ceil(n/a)\r\nlength=math.ceil(m/a)\r\nprint(width*length)", "import math\r\nn = input()\r\nx = n.split()\r\nl = math.ceil(int(x[0])/int(x[2]))\r\nw = math.ceil(int(x[1])/int(x[2]))\r\nprint(l*w)", "import math\r\na,b,c = map(int,input().split())\r\nd = math.ceil(a/c)\r\ne = math.ceil(b/c)\r\nx = d*e \r\nprint(x)", "n, m, a = map(int, input().split())\r\nl = n // a\r\nif n % a != 0:\r\n l += 1\r\nb = m // a\r\nif m % a != 0:\r\n b += 1\r\nprint(l * b)\r\n ", "# Function to calculate the least number of flagstones needed to pave the Square\r\ndef calculate_flagstones(n, m, a):\r\n # Calculate the number of flagstones needed for each dimension\r\n flagstones_n = (n + a - 1) // a\r\n flagstones_m = (m + a - 1) // a\r\n\r\n # Calculate the total number of flagstones needed\r\n total_flagstones = flagstones_n * flagstones_m\r\n\r\n return total_flagstones\r\n\r\n# Read the dimensions of the Square and the size of the flagstones\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the least number of flagstones needed\r\nresult = calculate_flagstones(n, m, a)\r\n\r\n# Print the result\r\nprint(result)\r\n", "n, m, a = map(int, input().split())\r\nrow_flagstones = (n + a - 1) // a\r\ncol_flagstones = (m + a - 1) // a\r\ntotal_flagstones = row_flagstones * col_flagstones\r\nprint(total_flagstones)\r\n", "def ceilTheValue(value, forA):\r\n \r\n reminder = value % forA\r\n if reminder == 0:\r\n # print(value)\r\n return value\r\n else:\r\n newCeildValue = value + (forA - reminder)\r\n # print(newCeildValue)\r\n return newCeildValue\r\n \r\ndef theatreSquare():\r\n m, n, a = map(int, input().split())\r\n m = ceilTheValue(m,a)\r\n n = ceilTheValue(n,a)\r\n count = int((m*n)/(a**2))\r\n print(count)\r\n\r\ntheatreSquare()", "from math import ceil\n\n\nn,m,a = map(int,input().split())\nx = ceil(n/a) * ceil(m/a)\nprint(x)", "n, m, a = [int(x) for x in input().strip().split()]\r\nx = n // a\r\nif n % a:\r\n x += 1\r\ny = m // a\r\nif m % a:\r\n y += 1\r\n\r\nprint(x * y)\r\n'''\r\n6 6 4\r\n4\r\n\r\n5 4 2\r\n6\r\n'''", "import math\r\nn, m, a = list(map(int, input().split()))\r\nn = math.ceil(n / a)\r\nm = math.ceil(m / a)\r\nprint(n * m)", "n, m, a = map(int, input().split())\r\n\r\nx = n // a\r\ny = m // a\r\n\r\nif n % a != 0:\r\n x += 1\r\n\r\nif m % a != 0:\r\n y += 1\r\n\r\nprint(x*y)", "import math\r\n\r\nn,m,a=map(int,input().split())\r\ns=math.ceil(n/a)*math.ceil(m/a)\r\nprint(s)", "n, m, a = map(int, input().split())\r\nl = n//-a\r\no = m // -a\r\nprint(l*o)", "n,m,a=map(int,input().split())\r\n\r\nif m % a == 0:\r\n plita1=m//a\r\nelse:\r\n plita1=m//a+1\r\n \r\nif n % a == 0:\r\n plita2=n//a\r\nelse:\r\n plita2=n//a+1\r\n \r\nprint(plita1*plita2)", "dimensions = str(input())\r\n\r\ndim_list = dimensions.split(\" \")\r\nhght = int(dim_list[0])\r\nwdth = int(dim_list[1])\r\nflagstn = int(dim_list[2])\r\n\r\nheight_req = hght/flagstn\r\nif(int(height_req) < height_req):\r\n height_req = int(height_req) + 1\r\n\r\nwidth_req = wdth/flagstn\r\nif(int(width_req) < width_req):\r\n width_req = int(width_req) + 1\r\n \r\nprint(int(height_req*width_req))", "n,m,a= map(int, input().split())\r\nh = n//a\r\nw = m//a\r\nif n%a!=0:\r\n h+=1\r\nif m%a!=0:\r\n w+=1\r\nprint(h*w)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 8 01:23:47 2023\r\n\r\n@author: dell\r\n\"\"\"\r\nimport math\r\n\r\nl=list(map(int,input().split()))\r\na=math.ceil(l[0]/l[2])\r\nb=math.ceil(l[1]/l[2])\r\nprint(a*b)", "from math import ceil, floor\r\nn, m, a = [int(x) for x in input().split()]\r\n\r\nside_1 = n/a\r\nside_2 = m/a\r\n\r\nprint(ceil(side_1)*ceil(side_2))", "a,b,c=map(int,input().split())\r\nif a%c==0:\r\n m=a//c\r\nelse:\r\n m=(a//c)+1\r\nif b%c==0:\r\n n=b//c\r\nelse:\r\n n=(b//c)+1\r\nprint(m*n)", "m, n, a = map(int, input().split())\r\nimport math\r\nprint(math.ceil(m / a) * math.ceil(n / a)) \r\n\r\n", "n,m,a = map(int, input().split())\r\ns = 0\r\np = 0\r\nif n%a > 0:\r\n s += n//a+1\r\nelse:\r\n s += n//a\r\nif m%a > 0:\r\n p += m//a+1\r\nelse:\r\n p += m//a\r\nprint(s*p)", "import math\r\nn, m, a = map(int, input().split())\r\nrows_need = math.ceil(n / a)\r\ncols_need = math.ceil(m / a)\r\nt_flagstones = rows_need * cols_need\r\nprint(t_flagstones)\r\n", "\r\nfrom math import ceil\r\n#arr = [int(x) for x in input().split()]\r\n\r\nm, n, a=[int(x) for x in input().split()]\r\ndef solve(m,n,a):\r\n print(ceil(m/a)*(ceil(n/a)))\r\n\r\nsolve(m,n,a)\r\n", "import math\r\nn,m,a=map(int,input().split())\r\nd=math.ceil(n/a)\r\nk=math.ceil(m/a)\r\nprint(d*k)\r\n", "import math\r\nx=input().split()\r\nl=math.ceil(float(x[1])/float(x[2]))\r\nb=math.ceil(float(x[0])/float(x[2]))\r\nprint(math.ceil(l)*math.ceil(b))\r\n", "n,m,a = map(int,input().split())\r\nif m % a == 0:\r\n r1 = m // a\r\nelse:\r\n r1 = m // a + 1\r\nif n % a == 0:\r\n r2 = n // a\r\nelse:\r\n r2 = n // a+1\r\nprint(r1 * r2) \r\n \r\n", "(m,n,k) = map(int, input().split())\r\nrow=0\r\ncolumn= 0\r\nif n%k ==0:\r\n row= n//k\r\nelse:\r\n row= n//k +1\r\n \r\nif m%k==0:\r\n column=m//k\r\nelse:\r\n column=m//k +1\r\nprint(column*row)", "y = list(map(int, input().split()))\r\nx = (y[0] + y[2]-1) // y[2]\r\nh = (y[1] + y[2]-1) // y[2]\r\nprint(x*h)\r\n", "\r\nx, y, z = map(int, input().split())\r\nif x % z == 0:\r\n a = x // z\r\nelse:\r\n a = (x // z) + 1\r\n\r\nif y % z == 0:\r\n b = y // z\r\nelse:\r\n b = (y // z) + 1\r\n \r\nprint(a * b)\r\n", "n, m, a = map(int, input().split())\r\nlenght = n // a\r\nwidth = m // a\r\nif n % a != 0:\r\n lenght += 1\r\nif m % a != 0:\r\n width += 1\r\n\r\ntiles_need = lenght * width\r\nprint(tiles_need)\r\n", "import math\na,b,s=map(int,input().split())\nm=math.ceil(a/s)\nn=math.ceil(b/s)\nprint(m*n)\n \t\t\t \t\t \t \t\t\t \t \t\t\t", "import math\r\n\r\nif __name__ == '__main__':\r\n n, m, a = input().split(' ')\r\n rh = math.ceil(float(n)/float(a))\r\n rw = math.ceil(float(m)/float(a))\r\n print(int(rh*rw))\r\n", "import math\r\n[n, m, a] =(int(shuju) for shuju in input().split())\r\nl=math.ceil(n/a)\r\nw=math.ceil(m/a)\r\nprint(l*w)", "import math \nn,m,a = list(map(int,input().split()))\ni = math.ceil(n/a)\nj = math.ceil(m/a)\nmul = i * j\nprint(mul)\n \t\t\t \t \t\t \t \t\t\t\t\t \t \t \t", "# LUOGU_RID: 120809791\nfrom math import ceil\r\nn,m,a = map(int,input().split())\r\ni = ceil(n/a);j = ceil(m/a)\r\nprint(int(i*j))", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n x=0\r\nelse:\r\n x=1\r\nif m%a==0:\r\n y=0\r\nelse:\r\n y=1\r\nt=(n//a)+x\r\nt1=(m//a)+y\r\nprint(int(t*t1))", "import math\r\n\r\nm,n,a = [int(x) for x in input().split()]\r\nprint(math.ceil(m/a) * math.ceil(n/a))", "p=input()\np=p.split(' ')\nn,m,a=p\nn=int(n)\nm=int(m)\na=int(a)\n\nr=0\nif n%a==0 and m%a==0:\n r=(n*m)/(a*a)\n print(int(r))\nelif n%a==0 and m%a!=0:\n r = (n/a)*(m//a)+n//a\n print(int(r))\nelif n%a!=0 and m%a==0:\n r = (n//a)*(m/a)+m//a\n print(int(r))\nelif n%a!=0 and m%a!=0:\n r = (n//a)*(m//a)+n//a+m//a+1\n print(int(r))", "import math as m\r\nx, y, z = map(int, input().split())\r\nprint(m.ceil(x/z)*m.ceil(y/z))\r\n", "import math\r\ns=list(map(int,input().split()))\r\nn,m,a=min(s[0],s[1]),max(s[0],s[1]),s[2]\r\nx=math.ceil(n/a)\r\ny=math.ceil((m-a)/a)\r\nif (m-a)/a==0:\r\n print(x)\r\nelif (m-a)/a>0:\r\n print(x*(y+1))\r\nelse:\r\n print(x*x)", "from math import ceil\r\n\r\n\r\nwidth,height,stone=map(int,input().split())\r\ntotal=ceil(width/stone) * ceil(height/stone)\r\nprint(total)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nneeded_flags = math.ceil(n/a) * math.ceil(m/a)\r\nprint(needed_flags)\r\n", "a, b, c = [int(i) for i in input().split()]\r\n\r\nif (a // c) * c == a:\r\n a_1 = a // c\r\nelse:\r\n a_1 = a // c + 1\r\n\r\nif (b // c) * c == b:\r\n a_2 = b // c\r\nelse:\r\n a_2 = b // c + 1\r\n\r\nprint(a_1 * a_2)\r\n", "details = input()\r\ndetails_examined_unprocessed = details.split()\r\ndetails_examined = [int(x) for x in details_examined_unprocessed]\r\nm = details_examined[0]\r\nn = details_examined[1]\r\na = details_examined[2]\r\nlength_wise = int(m/a)\r\nwidth_wise = int(n/a)\r\nif m % a != 0:\r\n length_wise = length_wise + 1\r\nif n % a != 0:\r\n width_wise = width_wise + 1\r\nnumber_of_flagbricks = length_wise * width_wise\r\nprint(number_of_flagbricks)", "n,m,a = [int(_) for _ in input().split()]\r\nt1 = (n+a-1)/a\r\nt2 = (m+a-1)/a\r\nprint(int(t1)*int(t2))", "n, m, a = map(int, input().split())\r\n\r\n# حساب عدد البلاطات في الاتجاه الأفقي والعمودي\r\nhorizontal_tiles = n // a\r\nvertical_tiles = m // a\r\n\r\n# التحقق مما إذا كان هناك تجاوز للمساحة الأفقية أو العمودية\r\nif n % a != 0:\r\n horizontal_tiles += 1\r\nif m % a != 0:\r\n vertical_tiles += 1\r\n\r\n# حساب العدد الإجمالي للبلاطات\r\ntotal_tiles = horizontal_tiles * vertical_tiles\r\n\r\n# طباعة النتيجة\r\nprint(total_tiles)", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of tiles horizontally and vertically\r\nnum_horizontal = n // a\r\nnum_vertical = m // a\r\n\r\n# If the area is not divisible by the tile size, add an extra tile horizontally or vertically\r\nif n % a != 0:\r\n num_horizontal += 1\r\nif m % a != 0:\r\n num_vertical += 1\r\n\r\n# Calculate the total number of tiles\r\nnum_tiles = num_horizontal * num_vertical\r\n\r\nprint(num_tiles)\r\n", "str=input()\nm,n,a=str.split()\nsquareArea=int(m)*int(n)\ntileArea=int(a)**2\nm=int(m)\nn=int(n)\na=int(a)\nx=(m//a) + int(bool(m%a))\ny=(n//a) + int(bool(n%a))\nprint(f\"{x*y}\")\n", "import math\r\nm,n,a = map(int, input().split())\r\n\r\npieces = math.ceil(m/a) * math.ceil(n/a) \r\nprint(pieces)", "a,b,c=map(int,input().split())\r\nif b%c==0:\r\n t=b//c\r\nelse:\r\n t=b//c+1\r\nif a%c==0:\r\n u=a//c\r\nelse:\r\n u=a//c+1\r\nprint(t*u)", "n,m,a=map(int,input().split())\r\nans=(n+a-1)//a\r\nres=(m+a-1)//a\r\nprint(ans*res)", "n, m, a = map(int, input().split())\r\n\r\nnum_rows = n // a\r\nif n % a != 0:\r\n num_rows += 1\r\n\r\nnum_cols = m // a\r\nif m % a != 0:\r\n num_cols += 1\r\n\r\nnum_flagstones = num_rows * num_cols\r\n\r\nprint(num_flagstones)\r\n", "import math\r\nn,m,a = input().split(\" \")\r\n\r\narea_r = int(n)/int(a)\r\narea_s = int(m)/int(a)\r\nnumber = math.ceil(area_r)*math.ceil(area_s)\r\nprint(number)\r\n", "i = [int(a) for a in input().split()]\r\nif i[0]%i[2]!=0:\r\n l = int(i[0] / i[2])+1\r\nif i[1] % i[2] != 0:\r\n d = int(i[1] / i[2])+1\r\nif i[0] % i[2] == 0:\r\n l = int(i[0] / i[2])\r\nif i[1] % i[2] == 0:\r\n d = int(i[1] / i[2])\r\nif l*d==0:\r\n print(1)\r\nelse:\r\n print(l*d)", "from math import ceil\ns = list(map(int,input().split(' ')))\nv = 0\nn,m,a = s[0],s[1],s[2]\nv = ceil(n/a) * ceil(m/a)\nprint(v)#shuchu\n", "# codeforces3\nn, m, a = map(int, input().split())\n\nif n % a == 0:\n d = n // a\nelse:\n d = n // a + 1\n\nif m % a == 0:\n r = m // a\nelse:\n r = m // a + 1\n\ntotal = d * r\nprint(total)", "def comp(ez, number):\r\n if ez / flagstone > ez // flagstone:\r\n return ez // flagstone + 1\r\n else:\r\n return ez // flagstone\r\n\r\n\r\ntheater_square_length, theater_square_width, flagstone = map(int, input().split())\r\nbiggest = 0\r\nif theater_square_length > theater_square_width:\r\n biggest = theater_square_length\r\nelse:\r\n biggest = theater_square_width\r\nif flagstone >= biggest:\r\n print(1)\r\nelse:\r\n ez = theater_square_length - flagstone\r\n ez1 = theater_square_width - flagstone\r\n flagstone_needed_x = 1 + comp(ez, flagstone)\r\n flagstone_needed_y = 1 + comp(ez1, flagstone)\r\n print(flagstone_needed_y * flagstone_needed_x)\r\n", "x,y,a=map(int,input().split())\r\nq=0\r\nw=0\r\nif x %a == 0 :\r\n q=int(x/a)\r\nelse :\r\n x=x+(a-(x%a))\r\n q=int(x/a)\r\nif y %a == 0 :\r\n w=int(y/a)\r\nelse :\r\n y=y+(a-(y%a))\r\n w=int(y/a)\r\nprint(q*w)", "from math import ceil\r\n\r\nn, m, a = [int(i) for i in input().split()]\r\n\r\nm=ceil(m/a)\r\nn=ceil(n/a)\r\n\r\nprint(m*n)", "def ceil_div(x, y):\r\n return (x + y - 1) // y\r\n\r\nn, m, a = list(map(int, input().split()))\r\nprint(ceil_div(n, a) * ceil_div(m, a))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 10 18:26:57 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nm,n,a=input().split()\r\ni=int(m)/int(a)\r\nj=int(n)/int(a)\r\nif i%1:\r\n i=int(i)+1\r\nelse:\r\n i=int(i)\r\nif j%1:\r\n j=int(j)+1\r\nelse:\r\n j=int(j)\r\nprint(i*j)\r\n", "n,m,a =map(int,input().split())\r\nif (n/a)%1==0:\r\n n1=n//a\r\nelse :\r\n n1=(n//a)+1\r\nif (m/a)%1==0:\r\n n2=m//a\r\nelse:\r\n n2=(m//a)+1\r\nprint(n1*n2)", "n,m,a=input().split()\r\na=int(a)\r\nm=int(m)\r\nn=int(n)\r\n\r\nif n%a==0 and m%a==0:\r\n l=int((n/a))\r\n b=int((m/a))\r\n print(b*l)\r\nelif n%a==0 and m%a!=0:\r\n l=int((n/a))\r\n b=int((m/a)+1)\r\n print(b*l)\r\nelif n%a!=0 and m%a==0:\r\n l=int((n/a)+1)\r\n b=int((m/a))\r\n print(b*l)\r\nelse:\r\n l=int((n/a)+1)\r\n b=int((m/a)+1)\r\n print(b*l)", "import math as mt\r\ninput_state = input()\r\nlist_size = input_state.split()\r\nfor i in range(len(list_size)) :\r\n list_size[i] = int(list_size[i])\r\nlength = list_size[0]/list_size[2]\r\nwidth = list_size[1]/list_size[2]\r\nlength = mt.ceil(length)\r\nwidth = mt.ceil(width)\r\noutput = length*width\r\nprint(output)", "def ceiling(x):\r\n if int(x)==x:\r\n return x\r\n else:\r\n return int(x)+1\r\n \r\n[a,b,c] = [int(x) for x in input().split()]\r\nprint(int(ceiling(a/c)*ceiling(b/c)))", "n,m,a=map(int,input().split())\r\nl=n//a\r\nw=m//a\r\nif n%a!=0:\r\n l+=1\r\nif m%a!=0:\r\n w+=1\r\nprint(l*w)", "import math\r\nm ,n ,a= map(int, input().split())\r\nma=math.ceil(m/a)\r\nna=math.ceil(n/a)\r\ng=int(na*ma/a*a)\r\nprint(g)", "import math\r\np = [int(x) for x in input().split()]\r\na = (math.ceil(p[0]/p[2])) * (math.ceil(p[1]/p[2]))\r\nprint(a)", "import math\r\n\r\n# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the Theater Square\r\n# Use the formula: (n + a - 1) // a * (m + a - 1) // a\r\n# Explanation: We add (a - 1) to both n and m to make sure we cover the entire square.\r\n# Then, we divide by 'a' and use integer division to round up if needed.\r\nflagstones_needed = math.ceil(n / a) * math.ceil(m / a)\r\n\r\n# Print the result\r\nprint(flagstones_needed)\r\n", "#input\nn,m,a = input().split()\nn = int(n)\nm = int(m)\na = int(a)\n#process\nl = n/a;\nl = int(l)\nif n%a:\n l+=1\nw = m/a\nw = int(w)\nif m%a:\n w+=1\nprint(l * w)\n \t \t\t \t\t\t\t \t\t \t \t \t\t\t\t\t \t\t\t", "import math\r\n\r\ndef count(n, a):\r\n c = n // a\r\n if n % a != 0:\r\n c += 1\r\n return c\r\n\r\ndef solve(n, m, a):\r\n return count(n, a) * count(m, a)\r\n\r\nn, m, a = [int(s) for s in input().split()]\r\nprint(solve(n, m, a))", "import math\r\n \r\ndef least_flagstones(n, m, d):\r\n return math.ceil(n/d) * math.ceil(m/d)\r\n \r\nn, m, d = map(int, input().split())\r\nprint(least_flagstones(n, m, d))", "n, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed using integer division\nnum_flagstones = -(-n // a) * -(-m // a)\n\nprint(num_flagstones)\n\n \t\t\t \t\t \t\t\t \t\t \t\t", "import math\nn,m,a = map(int,input().split())\nneeded = math.ceil(n/a) * math.ceil(m/a)\nprint(needed)\n \t\t \t\t\t\t \t\t\t \t \t \t\t", "import math\nnn, mm, aa = map(int, input().split())\nnum_flagstones = math.ceil(nn / aa) * math.ceil(mm / aa)\nprint(num_flagstones)\n\t \t \t \t\t \t\t \t\t\t \t \t", "n,m,a=map(int,input().split(' '))\nx=0\nif n%a==0:\n x=n//a\nelse:\n x=n//a+1\ny=0\nif m%a==0:\n y=m//a\nelse:\n y=m//a+1\nprint(x*y)\n", "n,m,a=map(int,input().split())\r\nwidth = n //a if n % a == 0 else n // a + 1\r\nlength = m // a if m% a == 0 else m // a + 1\r\nprint(width * length)", "[n, m, a] = list(map(int,input().split()))\r\n\r\nif n%a !=0:\r\n Ln = n + (a-(n%a))\r\nelse :\r\n Ln =n\r\nif m%a !=0:\r\n Lm = m + (a-(m%a))\r\nelse :\r\n Lm = m\r\nlnlm = Ln*Lm\r\nbricka = a * a #bricka te3 marbre dal de sol ghali elkarlej\r\nresulta = int(lnlm/bricka)\r\nprint(resulta)", "# LUOGU_RID: 119760186\na,b,c=map(int,input().split())\nd,e=a/c,b/c\nif d%1==0:\n d=int(d)\nelse:\n d=int(d)+1\nif e%1==0:\n e=int(e)\nelse:\n e=int(e)+1\nprint(d*e)", "n, m, a = map(int, input().split())\r\n\r\n\r\nnum_flagstones_n = (n + a - 1) // a\r\nnum_flagstones_m = (m + a - 1) // a\r\n\r\n\r\ntotal_flagstones = num_flagstones_n * num_flagstones_m\r\n\r\nprint(total_flagstones)\r\n", "import math\r\nn,m,a=map(int,input().split())\r\nax=a*a\r\narea=n*m\r\narn=math.ceil(n/a)\r\narm=math.ceil(m/a)\r\nprint(arn*arm)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 19 23:21:23 2023\r\n\r\n@author: xzt\r\n\"\"\"\r\n\r\nn,m,a = map(int, input().split())\r\nprint((n//a+1 if n%a!=0 else n//a)*(m//a+1 if m%a!=0 else m//a))\r\n", "import math\r\n\r\nn, m, a = input().split()\r\nn, m, a = [int(n), int(m), int(a)]\r\n\r\nq = math.ceil(m / a) * math.ceil(n / a)\r\nprint(q)", "import math\na1,n,b=map(int,input().split())\nprint(math.ceil(a1/b) * math.ceil(n/b))\n \t\t \t\t \t\t \t\t \t \t \t \t\t", "n,m,a= map(int,input().split())\r\n\r\nif (n%a==0): \r\n count1=n//a \r\nelse: \r\n count1=n//a+1 \r\n \r\nif (m%a==0): \r\n count2=m//a \r\nelse: \r\n count2=m//a+1 \r\n \r\nprint(count1*count2)", "from math import ceil\nb=input().split()\nc=[int(x) for x in b]\nprint(ceil(c[0]/c[2])*ceil(c[1]/c[2]))", "n,m,a = map(int,input().split(\" \"))\r\nx = n//a\r\ny = m//a\r\n\r\nif(n%a != 0):\r\n x=x+1\r\nif(m%a != 0):\r\n y=y+1\r\n\r\nprint(x*y)\r\n", "from math import ceil\r\n\r\n\r\n\r\nn, m, a = map(float, input().split())\r\n\r\n\r\np = ceil(m / a) * ceil(n / a)\r\n\r\nprint(p)\r\n", "import math\nm, n, a = map(int, input().split())\nprint(math.ceil(m/a) * math.ceil(n/a))\n\t\t \t\t\t \t\t \t\t\t\t \t \t\t \t \t\t", "m=input()\r\nn=m.split()\r\na=int(n[0])\r\nb=int(n[1])\r\nc=int(n[2])\r\nif a%c==0:\r\n d=a//c\r\nelse:\r\n d=a//c+1\r\nif b%c==0:\r\n e=b//c\r\nelse:\r\n e=b//c+1\r\nf=int(d*e)\r\nprint(f)", "n,m,a = map(int,input().split())\r\nprint(((n-1)//a+1)*((m-1)//a+1))", "import math\r\n\r\ntmp_str = input()\r\nary = tmp_str.split(' ')\r\nn, m, a = eval(ary[0]), eval(ary[1]), eval(ary[2])\r\n\r\nif n % a != 0:\r\n row = math.ceil(n/a)\r\nelse:\r\n row = int(n/a)\r\n\r\nif m % a != 0:\r\n col = math.ceil(m/a)\r\nelse:\r\n col = int(m/a)\r\n\r\nprint(int(row*col))", "n,m,a=input().split()\r\nx=int(n)\r\ny=int(m)\r\nz=int(a)\r\nif (x%z==0 and y%z==0):\r\n print((x//z)*(y//z))\r\nelif (x%z!=0 and y%z==0):\r\n print(((x//z)+1)*(y//z))\r\nelif (x%z==0 and y%z!=0):\r\n print((x//z)*((y//z)+1))\r\nelif (x%z!=0 and y%z!=0):\r\n print(((x//z)+1)*((y//z)+1))", "m, n, a = map(int,input().split())\nx =m//a\ny = n//a\nif m%a:\n x += 1\nif n%a:\n y += 1\n\nprint(x*y)\n \t\t\t\t \t\t\t\t \t\t\t\t\t \t \t \t \t", "n, m, a = [int(_) for _ in input().split()]\r\nif n%a != 0: \r\n l = n//a + 1\r\nelse: l = n//a\r\nif m%a != 0:\r\n w = m//a + 1\r\nelse: w = m//a\r\nprint(l*w)", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n r1=n//a\r\nelse:\r\n r1=n//a+1\r\nif m%a==0:\r\n r2=m//a\r\nelse:\r\n r2=m//a+1\r\nprint(r1*r2)", "n,m,a= map(int, input().split())\r\n\r\nif (n%a==0 and m%a==0):\r\n print(int(n/a)*int(m/a))\r\nelif(n<a or m<a):\r\n print(1)\r\nelif(n%a!=0 and m%a==0):\r\n x=(n//a)+1\r\n y=(m//a)\r\n print(int(x*y))\r\nelif(m%a!=0 and n%a==0):\r\n x=(n//a)\r\n y=(m//a)+1\r\n print(int(x*y))\r\nelse:\r\n x=(n//a)+1\r\n y=(m//a)+1\r\n print(int(x*y))", "n,m,a = map(int, input().split())\r\n\r\nif n % a != 0: a1 = n // a + 1\r\nelse:\r\n a1 = n // a\r\nif m % a != 0: a2 = m // a + 1\r\nelse:\r\n a2 = m // a\r\nprint (a1*a2)", "a = input()\r\ns = a.split()\r\ndef tinh(a , b):\r\n if a % b ==0:\r\n return a/b\r\n else:\r\n z = a//b +1 \r\n return z\r\n\r\ndoc = tinh(int(s[0]) , int(s[2]))\r\nngang = tinh(int(s[1]) , int(s[2]))\r\nprint(int(doc*ngang))", "ss=input()\r\nss1=ss.split(\" \")\r\nn=int(ss1[0])\r\nm=int(ss1[1])\r\na=int(ss1[2])\r\ns1=n//a \r\nif (n%a!=0):\r\n s1+=1 \r\ns2=m//a \r\nif (m%a!=0):\r\n s2+=1 \r\ns=s1*s2\r\nprint(s)", "m, n , a = map(int, input().split())\r\ndef theatreSquare(m,n,a):\r\n if m % a == 0 and n % a == 0:\r\n temp = (m / a)*(n /a) \r\n elif m % a == 0 and n % a != 0:\r\n temp = (m / a)*( n // a + 1)\r\n elif m % a != 0 and n % a == 0:\r\n temp = (m // a + 1)*(n / a)\r\n else:\r\n temp = (m // a + 1)*(n // a + 1)\r\n return int(temp)\r\nprint(theatreSquare(m,n,a))", "import math\r\n\r\nm, n, a = input().split() \r\nm=int(m)\r\nn = int(n)\r\na = int(a)\r\n\r\nprint(math.ceil(m/a)*math.ceil(n/a))\r\n", "# LUOGU_RID: 91586879\nimport math\r\nm,n,a = map(int,input().split())\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "import math\r\nn, m , a = map(int, input().split())\r\nS = n*m\r\nc1 = int(math.ceil(n/a))\r\nc2 = int(math.ceil(m/a))\r\nprint(c1*c2)\r\n", "n,m,a=map(int,input().split())\r\nprint (n//-a*(m//-a))", "from math import *\r\nn,m,a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nn = ceil(n/a)\r\nm = ceil(m/a)\r\nprint(m*n)\r\n\r\n", "import math\r\n\r\nn, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\n\r\nprint(math.ceil(n / a) * math.ceil(m/a))\r\n", "a, b, x = map(int,input().split())\r\nlen = a // x\r\nif(a % x != 0):\r\n len+= 1\r\nbreadth = b // x\r\nif(b % x != 0):\r\n breadth += 1\r\nprint(len*breadth)", "from math import ceil\r\nn,m,a = input().split(\" \")\r\nn,m,a = int(n),int(m),int(a)\r\nx = ceil(n/a)\r\ny = ceil(m/a)\r\nprint (x*y)", "n,m,a = map(int,input().split())\r\n\r\n\r\n\r\n\r\nif m%a ==0:\r\n val1 = m//a\r\n \r\nelse:\r\n val1 = m//a +1\r\n \r\nif n%a == 0:\r\n val2 = n//a\r\n \r\nelse:\r\n val2 = n//a +1\r\n \r\nprint(val1*val2)", "n= [int(i) for i in input().split()]\r\na=((n[0]//n[2]))\r\nb=((n[1]//n[2]))\r\nif n[0]%n[2]!=0:\r\n a+=1\r\nif n[1]%n[2]!=0:\r\n b+=1\r\nprint(a*b)\r\n \r\n \r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n# تقريب عدد الصفوف للأعلى والعمودين للأعلى\r\nnum_rows = math.ceil(n / a)\r\nnum_cols = math.ceil(m / a)\r\n\r\n# ضرب عدد الصفوف في العمودين للحصول على عدد البلاطات المطلوبة\r\nnum_tiles = num_rows * num_cols\r\n\r\nprint(num_tiles)\r\n", "import math\r\ninput = tuple(map(int, input().split(' ')))\r\nn, m, a = input[0], input[1], input[2]\r\n\r\ni = math.ceil(n / a)\r\nj = math.ceil(m / a)\r\n \r\nprint(i*j)", "\r\nn,m,a = map(int,input().split())\r\n\r\nif a == 1:\r\n print(n*m)\r\nelse:\r\n if (n <= a) and (m <= a):\r\n n = 1\r\n m = 1\r\n elif (n <= a) and (m > a):\r\n n = 1\r\n if m % a == 0:\r\n m = m//a\r\n else:\r\n m = (m//a)+1\r\n elif (n>a) and (m <= a):\r\n m = 1\r\n if n%a == 0:\r\n n = n//a\r\n else:\r\n n = (n//a)+1\r\n else:\r\n if n%a == 0:\r\n n = n//a\r\n else:\r\n n = (n//a)+1\r\n if m%a == 0:\r\n m = m//a\r\n else:\r\n m = (m//a)+1\r\n print(n*m)", "m,n,p=map(int,input().split())\r\nprint(-m//p*(-n//p))", "n,m,a=input().split()\r\nm=int(m)\r\na=int(a)\r\nn=int(n)\r\nmm=m//a\r\nif m%a!=0:\r\n mm+=1\r\nnn=n//a\r\nif n%a!=0:\r\n nn+=1\r\nprint(mm*nn)\r\n", "n, m, a = map(int, input().split())\r\nprint(((n-1)//a + 1) * ((m-1)//a + 1))\r\n", "n,m,a = list(map(int, input().split()))\nsid1,sid2=0,0\nif n%a==0: sid1=n//a\nelse: sid1=n//a+1\nif m%a==0: sid2=m//a\nelse: sid2=m//a+1\n\nprint(sid2*sid1)", "import math\r\nl=list(map(float, input().strip().split()))\r\n\r\nprint(math.ceil(l[0]/l[2])*math.ceil(l[1]/l[2]))", "z=[int(i) for i in input().split()]\r\nn=z[0]\r\nm=z[1]\r\na=z[2]\r\nif m%a==0: \r\n r1=m//a \r\nelse: \r\n r1=m//a+1 \r\nif n%a==0: \r\n r2=n//a \r\nelse: \r\n r2=n//a+1 \r\nprint(r1*r2) ", "import math\r\na,b,c = map(int, input().strip().split(\" \"))\r\nprint(int(math.ceil(a/c)*math.ceil(b/c)))", "r = list(map(int, input().split()))\r\nn = r[0]\r\nm = r[1]\r\na = r[2]\r\n\r\nif a >= n:\r\n n = 1\r\nif a >= m:\r\n m = 1\r\n\r\nif n % a == 0:\r\n n = n // a\r\nelse:\r\n n = n // a + 1\r\n\r\nif m % a == 0:\r\n m = m // a\r\nelse:\r\n m = m // a + 1\r\n\r\nprint(m * n)", "import math\n\n# Read input: n, m, and a\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed in both dimensions\n# Divide n by a and round up to get the number of flagstones in rows\n# Divide m by a and round up to get the number of flagstones in columns\n# The total number of flagstones needed is the product of these two numbers\nnum_flagstones = math.ceil(n/a) * math.ceil(m/a)\n\n# Print the result\nprint(num_flagstones)\n\n\t\t \t\t \t \t \t\t \t \t\t \t\t", "line = input().split()\r\n\r\nn = int (line[0])\r\nm = int (line[1])\r\na = int (line[2])\r\n\r\nn_flags = n // a\r\nm_flags = m // a\r\n\r\nif n % a != 0:\r\n n_flags += 1\r\nif m % a != 0:\r\n m_flags += 1\r\n\r\nprint (n_flags * m_flags)", "n,m,a=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nc=int(n/a)\r\nd=int(m/a)\r\nif n%a!=0:\r\n c+=1\r\nelse:\r\n c+=0\r\nif m%a!=0:\r\n d+=1\r\nelse:\r\n d+=0\r\nprint(c*d)", "from math import ceil\r\n\r\nif __name__ == '__main__':\r\n values = input().split(' ')\r\n n = int(values[0])\r\n m = int(values[1])\r\n a = int(values[2])\r\n \r\n print(int(ceil(n/a) * ceil(m/a)))", "def ceil(x):\r\n int_x=int(x)\r\n return int_x+1 if int_x < x else int_x\r\ndef theatre_square():\r\n numbers=input().split()\r\n n=int(numbers[0])\r\n m=int(numbers[1])\r\n a=int(numbers[2])\r\n square=ceil(n/a)*ceil(m/a)\r\n print(square)\r\n return\r\nif __name__=='__main__':\r\n theatre_square()\r\n", "n,m,a=[int(i) for i in input().split()]\r\nfrom math import ceil\r\nre=ceil(n/a)\r\nre2=ceil(m/a)*re\r\nprint(re2)\r\n", "import sys\r\n\r\nn, m, a = map(int, sys.stdin.readline().split())\r\n\r\nif m%a==0: \r\n d1=m//a \r\nelse: \r\n d1=m//a+1 \r\n \r\nif n%a==0: \r\n d2=n//a \r\nelse: \r\n d2=n//a+1 \r\n \r\nprint(d1*d2) \r\n\r\n", "def f(x, a):\r\n fin = x // a\r\n if (x % a) != 0:\r\n return fin + 1\r\n else:\r\n return fin\r\n\r\n\r\n\r\nn, m, a = map(int, (input().split()))\r\n\r\nprint(f(n, a) * f(m, a))", "class Solution:\r\n def TheatreSquare(self, n, m, a):\r\n if(m % a == 0):\r\n x = m // a\r\n else:\r\n x = (m // a) + 1\r\n\r\n if(n % a == 0):\r\n y = n // a\r\n else:\r\n y = (n // a) + 1\r\n\r\n return x*y\r\n\r\nif __name__ == '__main__':\r\n \r\n # a = int(input())\r\n # b = int(input())\r\n # arr = list(map(int, input().split(' ')))\r\n n, m, a = [int(x) for x in input().split(' ')]\r\n \r\n ob = Solution()\r\n print(ob.TheatreSquare(n, m, a))", "a=list(map(int,input().split()))\r\nx=a[0]//a[2]\r\nif(a[0]%a[2]):\r\n x+=1\r\ny=a[1]//a[2]\r\nif(a[1]%a[2]):\r\n y+=1\r\nprint(x*y) \r\n", "s = input().split()\r\nn = int(s[0])\r\nm = int(s[1])\r\na = int(s[2])\r\nt1, t2 = 1, 1\r\nif n % a == 0:\r\n t1 = n//a\r\nelse:\r\n t1 = n//a + 1\r\nif m % a == 0:\r\n t2 = m//a\r\nelse:\r\n t2 = m//a + 1\r\nprint(t1*t2)", "import math\r\n\r\ndata = list(map(int,input().split()))\r\nprint(math.ceil(data[0]/data[2]) * math.ceil(data[1]/data[2]))", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n x=(n//a)\r\nelse:\r\n x=(n//a)+1\r\nif m%a==0:\r\n y=(m//a)\r\nelse:\r\n y=(m//a)+1\r\nprint(x*y)", "info = str(input()).split(\" \")\r\n\r\nn = int(info[0])\r\nm = int(info[1])\r\na = int(info[2])\r\n\r\nwidth = n // a + (n % a > 0)\r\nlength = m // a + (m % a > 0)\r\nprint( max(width * length, width, length) )", "n, m, a = map(int, input().split())\r\nif n % a:\r\n l = n // a + 1\r\nelse:\r\n l = n // a\r\nif m % a:\r\n w = m // a + 1\r\nelse:\r\n w = m // a\r\nprint(l * w)", "import math\r\nx=list(map(int,input().split()))\r\nn=x[0]\r\nm=x[1]\r\nprint(int(math.ceil(n/x[2])*math.ceil(m/x[2])))", "m, n, a = input().split()\nm = int(m)\nn = int(n)\na = int(a)\nans1 = n / a\nif n % a:\n ans1 += 1\nans1 = int(ans1)\nans2 = m / a\nif m % a:\n ans2 += 1\nans2 = int(ans2)\nprint(ans1 * ans2)\n\n \t \t \t \t \t\t \t \t \t \t\t \t\t \t \t", "import math\r\nm, n ,i= map(int, input().split(' '))\r\nx= math.ceil(n/i)\r\ny=math.ceil(m/i)\r\nresult=x*y\r\nprint(result)\r\n", "data = input()\r\ndata = [int(x) for x in data.strip().split(' ')]\r\nm, n, a = data\r\nprint((-m//a)*(-n//a))", "from math import ceil\r\nx,y,z=map(int,input().split())\r\np=ceil(x/z)\r\nq=ceil(y/z)\r\nprint(int(p*q))", "import math\r\nm,n,a=map(int,input().split())\r\nl1=math.ceil(m/a)\r\nl2=math.ceil(n/a)\r\nprint(math.ceil(l1*l2))", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nsquare_size = n*m\r\nflag_stone = a*a\r\nbottom_side = math.ceil (m / a)\r\nheight_side = math.ceil (n /a)\r\ntotal_need = bottom_side*height_side\r\nprint(total_need)", "import math\r\ninp = list(map(int, input().split()))\r\nn = inp[0]\r\nm = inp[1]\r\na = inp[2]\r\n\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n count=m//a\r\nelse:\r\n count=m//a+1\r\nif n%a==0:\r\n c2=n//a\r\nelse: \r\n c2=n//a+1\r\n \r\nprint(count*c2)", "d=[int(i) for i in input().split()]\r\nn=d[0]\r\nm=d[1]\r\na=d[2]\r\nif n%a==0:\r\n x=n/a\r\nelse:\r\n x=int(n/a)+1\r\nif m%a==0:\r\n y=m/a\r\nelse:\r\n y=int(m/a)+1\r\nprint(\"%d\" % int(x*y))\r\n", "import math\r\n\r\ndef flagstone_count(dim):\r\n return (math.ceil(dim[0]/dim[2])*math.ceil(dim[1]/dim[2]))\r\n\r\ninp = list(map(int, input().split()))\r\n\r\nprint(flagstone_count(inp))", "import math\r\nn,m,a = map(int,input().split())\r\n\r\nl = math.ceil(n/a)*math.ceil(m/a)\r\nprint(l)\r\n", "#Accepted code for Theatre Square in Python3\nimport math\n \nk=input()\nX=list(map(int,k.split()))\nsol=math.ceil(X[0]/X[2])*math.ceil(X[1]/X[2])\nprint(sol)\n \t \t \t\t \t \t \t \t \t\t\t\t\t\t \t\t\t \t", "inp= list(map ( int,input().split() ))\n\nn=inp[0]\nm=inp[1]\na=inp[2]\n\nr=m//a\nc=n//a\n\n# print(r,c)\n\n\nif n%a!=0 and m%a!=0:\n \n print((r+1)*(c+1))\n\nelif n%a==0 and m%a==0:\n print((r)*(c))\n\nelif n%a==0 and m%a!=0:\n \n print((r+1)*(c))\n \nelif n%a!=0 and m%a==0:\n \n print((r)*(c+1))\n\n", "import math\na,b,c=map(int,input().split())\nmin=math.ceil(a/c)*math.ceil(b/c)\nprint(min)\n\n\t\t\t\t \t \t\t \t\t\t \t\t\t \t \t\t \t\t", "a = input()\r\nnumber = a.split(' ')\r\nlength = int(number[0])\r\nwidth = int(number[1])\r\nlong = int(number[2])\r\nprint(length // long * (width // long) + ((length % long) != 0) * (width // long) + ((width % long) != 0) *\r\n (length // long) + (((width % long) != 0) and (length % long) != 0) * 1)\r\n\r\n\r\n\r\n", "import math\n\ndef count_flagstones(n, m, a):\n # Calculate the number of flagstones needed to cover the area\n flagstones_needed = math.ceil(n/a) * math.ceil(m/a)\n\n return flagstones_needed\n\n\n# Read n, m, and a\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\nflagstones_needed = count_flagstones(n, m, a)\n\n# Print the result\nprint(flagstones_needed)\n\n\t\t\t \t \t\t\t \t\t \t \t \t\t \t \t", "from math import ceil\r\n\r\na,b,c=input().split()\r\n\r\na=ceil(int(a)/int(c))\r\nb=ceil(int(b)/int(c))\r\n\r\nprint(a*b)", "n,m,k=map(int,input().split())\r\nprint(int(((n+k-1)//k)*((m+k-1)//k)))", "import math\r\n\r\ndef run():\r\n n, m, a = map(int, input().split())\r\n base = math.ceil(m/a)\r\n height = math.ceil(n/a)\r\n total_number = base * height\r\n print(total_number)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n run()", "import math\r\nl = list(int(x) for x in input().split())\r\nprint(math.ceil(l[0]/l[2])*math.ceil(l[1]/l[2]))", "import math\na,b,s=map(int,input().split())\nprint(math.ceil\n(a/s)*math.ceil(b/s))\n \t\t \t \t\t\t\t\t \t\t \t\t\t\t\t\t \t\t \t", "n, m, a = map(int, input().split())\r\nx_flagstones = (n + a - 1) // a\r\ny_flagstones = (m + a - 1) // a\r\ntotal_flagstones = x_flagstones * y_flagstones\r\nprint(total_flagstones)\r\n", "from math import ceil as cc\r\na,b,c = map(int, input().split())\r\nprint(cc(a/c)*cc(b/c))", "n, m, a = map(int,input().split())\r\nif n%a == 0:\r\n width = n//a\r\nelse:\r\n width = n//a + 1\r\nif m%a == 0:\r\n length = m//a\r\nelse:\r\n length = m//a + 1\r\nprint(width*length)\r\n", "from math import ceil\r\nn,m,a=map(int,input().split())\r\np=ceil(m/a)\r\nq=ceil(n/a)\r\nprint(p*q)", "from math import ceil\nn,m,a=list(map(int,input().split()))\nprint(ceil(m/a)*ceil(n/a))", "from math import ceil\r\nstr = [int(x) for x in input().split()]\r\nn = str[0]\r\nm = str[1]\r\na = str[2]\r\nnx = ceil(n / a)\r\nmx = ceil(m / a)\r\nprint(mx * nx)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 21 14:42:26 2022\r\n\r\n@author: Lemon_Sherry\r\n\"\"\"\r\n\r\ninp = input().split()\r\nm = int(inp[0])\r\nn = int(inp[1])\r\na = int(inp[2])\r\n\r\nl = (m - m%a) / a\r\nif m%a != 0:\r\n l += 1\r\nw = (n - n%a) / a\r\nif n%a != 0:\r\n w += 1\r\nprint(int(l * w))", "# Read the input values for n, m, and a\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\nhorizontal_flagstones = (n + a - 1) // a\nvertical_flagstones = (m + a - 1) // a\n\n# Calculate the total number of flagstones\ntotal_flagstones = horizontal_flagstones * vertical_flagstones\n\n# Print the result\nprint(total_flagstones)\n\n \t \t\t \t\t \t \t\t \t \t \t \t\t \t\t", "inf = input()\r\nlis = []\r\nfor i in range(len(inf)):\r\n if inf[i] == ' ':\r\n lis.append(i)\r\nx = int(lis[0])\r\ny = int(lis[1])\r\nn = int(inf[0:x])\r\nm = int(inf[x+1:y])\r\na = int(inf[y+1:])\r\nif n % a == 0:\r\n b = n // a\r\nelse:\r\n b = n // a + 1\r\nif m % a == 0:\r\n c = m // a\r\nelse:\r\n c = m // a + 1\r\nprint(b * c)", "b=str(input())\r\nc=b.split()\r\na=int(c[0])\r\nd=int(c[1])\r\ne=int(c[2])\r\nif a%e==0:\r\n h=a/e\r\nelse:\r\n h=int(a/e)+1\r\nif d%e==0:\r\n g=d/e\r\nelse:\r\n g=int(d/e)+1\r\nprint(int(g*h))\r\n\r\n", "n,m,a = map(int,input().split())\r\n\r\nnum_box = 0\r\n\r\nget_column = n // a\r\nif n % a != 0:\r\n get_column += 1\r\n\r\n\r\nget_row = m // a\r\nif m % a != 0:\r\n get_row += 1\r\n\r\n\r\nnum_box = get_column*get_row\r\nprint(num_box)\r\n\r\n\r\n", "import math\na, b, s=map(int, input().split())\nm=math. ceil(a/s)\nn=math. ceil(b/s)\nprint(m*n)\n\t\t \t \t \t \t\t \t \t \t \t\t\t \t\t\t\t\t", "n,m,a = map(int,input().split())\r\nif n%a==0:\r\n\tx=n//a\r\nelse:\r\n\tx=(n//a)+1\r\nif m%a==0:\r\n\ty=m//a\r\nelse:\r\n\ty=(m//a)+1\r\n\r\nprint(x*y)", "a, b, c = map(int, input(\"\").split())\r\n\r\nx = 0 \r\ny = 0\r\n\r\n\r\n\r\nif a % c == 0 and a >= c:\r\n x = a//c\r\n\r\n\r\nelif a < c: \r\n x += 1\r\n\r\nelse:\r\n x = a//c + 1\r\n\r\nif b % c == 0 and b >= c:\r\n y = b//c\r\n\r\nelif b < c:\r\n y = 1\r\n\r\nelse:\r\n y = b//c + 1\r\n\r\n\r\n\r\nprint(x*y)", "n,m,a=map(int,input().split())\r\nx=0\r\ny=0\r\nif n%a==0:\r\n x=int(n/a)\r\nelse:\r\n x=int(n/a)+1\r\nif m%a==0:\r\n y=int(m/a)\r\nelse:\r\n y=int(m/a)+1\r\n\r\nprint(x*y)", "import math\r\n\r\nvalues = [int(x) for x in input().split()]\r\n\r\nn = values[0]\r\n\r\nm = values[1]\r\n\r\na = values[2]\r\n\r\nans = 0\r\n\r\nif n == a:\r\n\r\n\tans = math.ceil(m / a)\r\n\r\nelif m == a:\r\n\r\n\tans = math.ceil(n / a) \r\n\r\nelse:\r\n\r\n\tans = int(math.ceil(n / a) * math.ceil(m / a))\r\n\r\n\r\nprint(ans)\r\n", "class Solution:\r\n def numOfStones(self, a: int, b: int, c: int) -> int:\r\n x = a // c if a % c == 0 else a // c + 1\r\n y = b // c if b % c == 0 else b // c + 1\r\n return x * y\r\n\r\n\r\nif __name__ == '__main__':\r\n line = input().split()\r\n print(Solution().numOfStones(int(line[0]), int(line[1]), int(line[2])))\r\n", "nl = list(map(int, input().split()))\r\nn = nl[0]\r\nm = nl[1]\r\na = nl[2]\r\nif n%a==0:\r\n b =n/a\r\nelse:\r\n b = (n - n%a) / a + 1\r\nif m%a==0:\r\n c =m/a\r\nelse:\r\n c = (m - m%a) / a + 1\r\nf = b * c\r\nprint(int(f))", "from math import ceil\n\n\nvalues = input().split()\nfor index,value in enumerate(values):\n values[index] = int(value)\nprint(ceil(values[0]/values[2]) * ceil(values[1]/values[2]))", "import math\r\n\r\nstrng = input()\r\n\r\nstrng_lst = strng.split(\" \")\r\n\r\nn = int(strng_lst[0]) #Length of rectangle\r\nm = int(strng_lst[1]) #Breadth of rectangle\r\na = int(strng_lst[2]) \r\n\r\nnum_for_length = math.ceil(n/a) #How to solve without using math.ceil()?\r\nnum_for_breadth = math.ceil(m/a)\r\n\r\ntotal_num = num_for_length * num_for_breadth\r\n\r\nprint(total_num)\r\n", "lst1=input().split()\n\nn=int(lst1[0])\nm=int(lst1[1])\na=int(lst1[2])\n\n\nrows,columns=(0,0)\n\nif m%a == 0:\n\n rows = m/a\n\nelse:\n\n rows = (m - m%a)/a + 1\n\nif n%a == 0:\n\n columns = n/a\n\nelse:\n\n columns = (n - n%a)/a + 1\n\nprint(int(rows*columns))\n", "# https://codeforces.com/problemset/problem/1/A\n\nimport math\n\nline = input()\nn, m, a = line.split(\" \")\nn = int(n)\nm = int(m)\na = int(a)\n\ntiles_required = math.ceil(n / a)\n\nm -= a\n\nif m > 0:\n tiles_required += math.ceil(m / a) * tiles_required\n\nprint(tiles_required)", "import math\n\na, b, c = map(int, input().split())\none = math.ceil(a/c)\ntwo = math.ceil(b/c)\nanswer = one * two\nprint(answer)", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n n1=int(n/a)\r\nelse:\r\n n1=n//a+1\r\nif m%a==0:\r\n n2=int(m/a)\r\nelse:\r\n n2=m//a+1\r\nprint(n2*n1)", "nums=input().split()\r\nm=int(nums[0]) % int(nums[2])\r\nif m==0:\r\n n=int(nums[0]) / int(nums[2])\r\nelse:\r\n n=(int(nums[0])-m) / int(nums[2])+1\r\n\r\np=int(nums[1]) % int(nums[2])\r\nif p==0:\r\n q=int(nums[1]) / int(nums[2])\r\nelse:\r\n q=(int(nums[1])-p) / int(nums[2])+1\r\n\r\nw=int(n)*int(q)\r\nprint(w)", "from math import ceil\r\nn,m,a = map(int,input().split())\r\nx = ceil(n/a)\r\ny = ceil(m/a)\r\nprint(int(x*y))", "import math\r\n\r\na,b,c = map(int, input().split())\r\n\r\nnum_flagstones = math.ceil(a/c)*math.ceil(b/c)\r\n\r\nprint(num_flagstones)", "m,n,a=input().split()\nm=int(m)\nn=int(n)\na=int(a)\nif m%a!=0:\n b=(m/a)\n b=int(b)\n b=(b+1)*a\nelse:\n b=m\nif n%a!=0:\n c=(n/a)\n c=int(c)\n c=(c+1)*a\nelse:\n c=n\nd=(b*c)/(a*a)\nd=int(d)\nprint(d)\n\t \t \t\t\t\t\t \t\t \t\t \t\t\t \t \t\t\t \t", "n,m,a=map(int,input().split())\r\nif n%a==0 and m%a==0:\r\n print(n//a*m//a)\r\nelif n%a!=0 and m%a==0:\r\n print((n//a+1)*m//a)\r\nelif n%a==0 and m%a!=0:\r\n print((n//a)*(m//a+1))\r\nelif n%a!=0 and m%a!=0:\r\n print((n//a+1)*(m//a+1))", "import math\r\nx,y,z=map(int,input().split())\r\na=math.ceil(x/z)\r\nb=math.ceil(y/z)\r\nprint(a*b)", "n,m,a = map(int,input().split())\r\nif n%a==0:\r\n x=n/a\r\nelse:\r\n x=int(n/a)+1\r\nif m%a==0:\r\n y=m/a\r\nelse:\r\n y=int(m/a)+1\r\nprint(int(x*y))", "ints = lambda: list(map(int, input().split()))\r\nfrom math import ceil\r\ndef main():\r\n n,m,a=ints()\r\n res = ceil(m/a)*ceil(n/a)\r\n print(res)\r\n\r\nt=1\r\n#t=int(input())\r\nfor _ in range(t): main()\r\n", "from math import ceil\r\na1,a2,a3=map(int, input().split())\r\nprint(ceil(a1/a3) * ceil(a2/a3))", "a,b,c=map(int,input().split())\na1=-(a//-c)\na2=-(b//-c)\nprint(a1*a2)\n \t\t \t \t \t \t \t\t \t\t\t", "n, m, a = map(int, input().split())\r\nif (n, m, a >= 1) and (n, m, a <= 10**9):\r\n if (n % a != 0):\r\n n = n // a + 1\r\n else:\r\n n = n / a\r\n if (m % a != 0):\r\n m = m // a + 1\r\n else:\r\n m = m / a\r\nresult = m * n\r\nprint(int(result))", "n,m,a=map(int,input().split())\r\nif n%a!=0 and m%a!=0 :\r\n print(((n//a)+1)*((m//a)+1))\r\nelif n%a==0 and m%a!=0 :\r\n print(((n//a))*((m//a)+1))\r\nelif n%a!=0 and m%a==0 :\r\n print(((n//a)+1)*((m//a)))\r\nelse :\r\n print(((n//a))*((m//a)))\r\n", "n, m, a = map(int, input().split())\r\n\r\n\r\ndef f(x):\r\n if x % a == 0:\r\n s = x // a\r\n else:\r\n s = x // a + 1\r\n return s\r\n\r\n\r\nprint(f(n) * f(m))\r\n", "a=input()\r\nst=a.split()\r\na=int(st[2])\r\nn=int(st[0])\r\nm=int(st[1])\r\na1=int()\r\na2=int()\r\n\r\nif n%a==0:\r\n a1=n//a\r\nelse:a1=n//a+1\r\nif m%a==0:\r\n a2=m//a\r\nelse:a2=m//a+1\r\n\r\nprint(a1*a2)", "n,m,a = [int(x) for x in input().split()]\r\nif n%a == 0 and m%a == 0:\r\n num = n//a*m//a\r\n print(num)\r\nelif n%a == 0 and m%a != 0:\r\n num = n//a*(m//a+1)\r\n print(num)\r\nelif n%a != 0 and m%a == 0:\r\n num = (n//a+1)*m//a\r\n print(num)\r\nelif n%a != 0 and m%a != 0:\r\n num = (n//a+1)*(m//a+1)\r\n print(num)", "import math\n\n# Read the input values\ns, f, d = map(int, input().split())\n\n# Calculate the number of flagstones needed\nnum_flagstones = math.ceil(s/d) * math.ceil(f/d)\n\n# Print the result\nprint(num_flagstones)\n\t \t\t\t\t\t \t \t\t \t\t\t \t", "n,m,a = input().split()\r\nx = int(n)//int(a) if int(n)%int(a) == 0 else int(n)//int(a)+1\r\ny = int(m)//int(a) if int(m)%int(a) == 0 else int(m)//int(a)+1\r\nprint(x*y)\r\n", "import math\nx = [int(y) for y in input().split()]\nprint(math.ceil(float(x[0])/float(x[2]))*math.ceil(float(x[1])/float(x[2])))", "import math\r\nn,m,a=map(int, input().split())\r\nn=math.ceil(n/a);m=math.ceil(m/a)\r\nprint(m*n)", "s=input()\r\ns=[int(z) for z in s.split()]\r\nn=s[0]\r\nm=s[1]\r\na=s[2]\r\nif m%a==0: \r\n p=m//a \r\nelse: \r\n p=m//a+1 \r\n \r\nif n%a==0: \r\n q=n//a \r\nelse: \r\n q=n//a+1 \r\n \r\nprint(p*q)", "n, m, a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nans = 0\r\nother = 0\r\nif n % a == 0:\r\n ans = ans + n//a\r\nelse:\r\n ans = ans + n//a + 1\r\nif m % a == 0:\r\n other = other + m//a\r\nelse:\r\n other = other + m//a + 1\r\nprint(ans * other)", "import math\r\nn, m, a =[float(x) for x in input().split()]\r\nl = math.ceil(n/a)\r\nk = math.ceil(m/a)\r\nprint(int(l*k))\r\n\r\n\r\n", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n k1=n//a\r\nelse:\r\n k1=n//a+1\r\nif m%a==0:\r\n p=m//a\r\nelse:\r\n p=m//a+1\r\n\r\nprint(k1*p)", "#theatre square:\r\nimport math\r\narr = list(map(int,input().split()))\r\n\r\nn = arr[0]\r\nm = arr[1]\r\na = arr[2]\r\n\r\nprint( math.ceil(n/a) * math.ceil(m/a))\r\n", "n, m, l = map(int, input().split())\n\nif m % l == 0:\n x = m // l\nelse:\n x = m // l + 1\n\nif n % l == 0:\n y = n // l\nelse:\n y = n // l + 1\n\nprint(x * y)\n\n \t \t \t\t\t \t\t\t \t \t \t \t", "m,n,a= [int(x) for x in input().split()]\r\nif m%a==0:\r\n c=int(m/a)\r\nelse:\r\n c=int(m/a)+1\r\nif n%a==0:\r\n k=int(n/a)\r\nelse:\r\n k=int(n/a)+1\r\nprint(c*k)", "import math\r\nn,m,a=map(int,input().split())\r\nresult=math.ceil(n/a)*math.ceil(m/a)\r\n\r\nprint(result)\r\n\r\n", "n, m , a = map(int,input().split())\r\nif n%a ==0:\r\n count_l = n//a \r\nelse:\r\n count_l = n//a +1\r\nif m%a ==0:\r\n count_w = m//a \r\nelse:\r\n count_w = m//a +1\r\n\r\nprint(count_w * count_l)", "import math\r\nn,m,a = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n\r\nres = math.ceil(n/a) *math.ceil(m/a)\r\nprint(res)", "n, m, a = map(int, input().split())\r\n\r\nif m%a == 0:\r\n w=m//a\r\nelse:\r\n w=m//a+1\r\n\r\n\r\nif n%a == 0:\r\n l=n//a\r\nelse:\r\n l=n//a+1\r\nprint(l*w)", "import math\r\nl, w, s = map(int, input().split())\r\nl_s = math.ceil(l / s)\r\nw_s = math.ceil(w / s)\r\nprint(l_s * w_s)\r\n", "x,y,z=map(int,input().split())\r\na=x//z\r\nb=y//z\r\nif(x%z!=0):\r\n\ta+=1\r\nif(y%z!=0):\r\n\tb+=1\r\nprint(a*b)", "# LUOGU_RID: 115186630\nn,m,a=map(int,input().split())\nprint(((n-1)//a+1)*((m-1)//a+1))", "import math\r\nn, m, a = map(int, input().split())\r\nprint(math.ceil((n/a))*math.ceil((m/a)))\r\n ", "a , b, c=[int(i) for i in input().split()]\r\nans = (a//-c)\r\nansw = (b//-c)\r\nanswer = ans*answ\r\nprint(answer)", "h = input().split(' ')\r\nn = int(h[0])\r\nm = int(h[1])\r\na = int(h[2])\r\ndef c(x, y):\r\n if x % y == 0:\r\n return x // y\r\n return x // y + 1\r\nprint(c(n,a) * (c(m,a)))", "from math import ceil\r\n\r\nm, n , a = map(int, input().split())\r\nprint(ceil(m/a)*ceil(n/a))", "import math\r\ndef theatreSquare(lst):\r\n m,n,a = lst[0],lst[1],lst[2]\r\n return math.ceil(m/a)*math.ceil(n/a)\r\n \r\n \r\nlst = (input().split())\r\nlst = [int(a) for a in lst]\r\n#print(lst)\r\nprint(theatreSquare(lst))\r\n", "import math\ns,t,u = list(map(int, input().split()))\nprint(math.ceil(s/u)*math.ceil(t/u))\n \t \t\t\t \t\t\t\t\t\t \t\t\t\t\t\t \t", "def theatreSquare():\r\n n,m,a=map(int,input().split())\r\n modulo_side=n%a\r\n modulo_top=m%a\r\n if modulo_side==0:\r\n result_side=n // a\r\n else:\r\n result_side=n // a+1\r\n\r\n if modulo_top==0:\r\n result_top=m // a\r\n else:\r\n result_top=m //a +1\r\n\r\n return result_side*result_top\r\n\r\nprint(theatreSquare())", "import math\r\nx,y,a=map(int,input().split())\r\nprint(math.ceil(x/a) * math.ceil(y/a))", "x,y,z=[int(i) for i in input().split()]\r\nif(x%z!=0):\r\n x=((x//z)+1)*z\r\nif(y%z!=0):\r\n y=((y//z)+1)*z\r\nprint(int((x*y)/z**2))", "n, m, a= map(int, input().split())\nn1= n//a\nif n%a != 0:\n n1 = n1 + 1\nn2=m//a\nif m%a != 0:\n n2 = n2 + 1\nprint (n1*n2)", "h,j,k=map(int,input().split())\r\nr=h//k\r\nif h%k!=0:\r\n r+=1\r\nc=j//k\r\nif j%k!=0:\r\n c+=1\r\ntot=r*c\r\nprint(tot)\r\n ", "c,d, a=map(int,input().split()); print(c//-a*(d //-a))\r\n", "n, m, a = [int(x) for x in input().split(' ')]\r\n\r\n# Flagstones needed to fill up 'a' rows\r\nrow_fs = n // a # Counts max number of rows filled with flagstones\r\nif n % a != 0:\r\n row_fs += 1 # Adds extra flagstone if more space had remained\r\n\r\n# Number of 'row_fs x a' blocks present\r\ncol_fs = m // a\r\nif m % a != 0:\r\n col_fs += 1\r\n\r\nresult = row_fs * col_fs\r\nprint(result)\r\n", "n,m,a=map(int,input().split())\r\nf1=0\r\nf2=0\r\nif n%a==0:\r\n f1=n/a\r\nelse:\r\n f1=int(n/a)+1\r\nif m%a==0:\r\n f2=m/a\r\nelse:\r\n f2=int(m/a)+1\r\nf=f1*f2\r\nif f>0:\r\n print(int(f))\r\nelse:\r\n print(1)", "n, m, a = map(int, input().split())\nwidth_flagstones = (n + a - 1) // a\nheight_flagstones = (m + a - 1) // a\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = width_flagstones * height_flagstones\nprint(total_flagstones)\n\n\t \t\t \t\t\t \t \t\t \t \t\t \t\t \t\t", "k,h,y = map(int,input().split())\r\nv = k//y if k % y == 0 else k // y + 1\r\na = h // y if h % y == 0 else h // y + 1\r\nprint(v * a)", "n, b, a = map(int, input().split()) \r\n\r\nrows = (n + a - 1) // a \r\ncols = (b + a - 1) // a \r\nmin_flagstones = rows * cols\r\n\r\nprint(min_flagstones)\r\n", "#Nếu muốn nhập 3 giá trị trong 1 hàng ngang trong python => xài map\r\n\r\nn, m, a = map(int,input().split())\r\n\r\n###Cách 1:\r\n# Hàm ceil() trong Python trả về số nguyên nhỏ nhất mà không nhỏ hơn x. \r\n# Hàm ceil() được sử dụng để làm tròn số lên. Ví dụ ceil(4.3) = 5, ceil(4.8) = 5\r\nimport math\r\nx=math.ceil(n/a)\r\ny=math.ceil(m/a)\r\n\r\nprint(x*y)", "N = input()\r\nn = N.split(' ')\r\na, b, c = n\r\nhor = int(a) // int(c)\r\nost = int(a) % int(c)\r\nif ost > 0:\r\n hor += 1\r\nvert = int(b) // int(c)\r\nost1 = int(b) % int(c)\r\nif ost1 > 0:\r\n vert += 1\r\nprint(hor * vert)", "userInput = [int(x) for x in input().split(' ')]\r\nn = userInput[0]\r\nm = userInput[1]\r\na = userInput[2]\r\nlenS = n//a\r\nwidS = m//a\r\nif n%a !=0:\r\n lenS+=1\r\nif m%a !=0:\r\n widS +=1\r\nprint(lenS*widS)\r\n", "from math import ceil;\r\na,b,c=map(int, input().split());\r\nprint(ceil(b/c)*ceil(a/c));", "import math\r\nn, m, a = map(int, input().split())\r\nx = math.ceil(m/a)*math.ceil(n/a)\r\nprint(x)\r\n", "q,w,e=map(int, input().split())\r\ns=((q//e)+(1 if q%e!=0 else 0))*((w//e)+(1 if w%e!=0 else 0))\r\nprint(s)", "#find the minimum number of flagstones to cover the square\r\nimport math\r\n#the theatre square m*n and flagstone a*a\r\nm,n,a=input().split()\r\nm=int(m)\r\nn=int(n)\r\na=int(a)\r\nnum=math.ceil(n/a)*math.ceil(m/a)\r\nprint(num)\r\n", "line = input()\r\ns = line.split()\r\nn = int(s[0])\r\nm = int(s[1])\r\na = int(s[2])\r\n\r\nif n//a==n/a:\r\n z=n/a\r\nelse:\r\n z=(n//a)+1\r\n\r\n\r\nif m//a==m/a:\r\n y=m/a\r\nelse:\r\n y=(m//a)+1\r\n\r\n\r\nprint(int(z*y))\r\n\r\n\r\n", "import math \r\na,b,c=map(int,input().split())\r\nx=math.ceil(b/c)\r\ny=math.ceil(a/c)\r\nprint(x*y)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nrows = math.ceil(n / a)\r\ncolumns = math.ceil(m / a)\r\nresult = rows * columns\r\n\r\nprint(result)\r\n", "n, m, a = map(int, input().split())\r\nkol = 0\r\nif n < a:\r\n min_g = 1\r\nelse:\r\n min_g = n // a + int(bool(n % a))\r\nif m < a:\r\n min_v = 1\r\nelse:\r\n min_v = m // a + int(bool(m % a))\r\nprint(min_g * min_v)", "n, m, a = [int(x) for x in input().split()]\r\nif not n % a:\r\n n = n // a\r\nelse:\r\n n = n // a + 1\r\nif not m % a:\r\n m = m // a\r\nelse:\r\n m = m // a + 1\r\nprint(n*m)", "n,m,a = map(int,input().split())\r\n\r\nprint(int((m+a-1)/a)*int((n+a-1)/a))", "a,b,c = map(int,input().split())\r\nimport math\r\nnum1 = math.ceil(a / c)\r\nnum2 = math.ceil(b / c)\r\nsum_num = num1 * num2\r\nprint(sum_num)", "import math\r\na,b,c=map(float,input().split())\r\nprint(math.ceil(a/c)*math.ceil(b/c))", "import math\r\n\r\nline = [int(x) for x in input().split(' ')]\r\nn, m, a = line[0], line[1], line[2]\r\n\r\nbase = math.ceil(n/a)\r\nheight = math.ceil(m/a)\r\n \r\nprint(base*height)\r\n\r\n\r\n", "from math import ceil\r\na,b,c= [int(i) for i in input().split()]\r\nprint((ceil((a/c)) * (ceil(b/c))))", "import sys, io, os;\r\ninput = sys.stdin.readline;\r\n\r\ndef run_case():\r\n n, m, a = (int(i) for i in input().split())\r\n w = (n // a)\r\n if (n % a != 0):\r\n w += 1\r\n d= (m // a)\r\n if (m % a != 0):\r\n d += 1\r\n print(d * w) \r\n\r\nif __name__ == \"__main__\":\r\n #t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n run_case()\r\n\r\n", "import math\r\ns = input()\r\nx = s.split()\r\nneededflags = math.ceil(int(x[0])/int(x[2])) * math.ceil(int(x[1])/int(x[2]))\r\nprint(neededflags)\r\n", "import math\r\nnma = input().split(' ')\r\nn = int(nma[0])\r\nm = int(nma[1])\r\na = int(nma[2])\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "from math import ceil\r\n\r\nn, m, a = map(int, input().split())\r\nres = ceil(n/a) * ceil(m/a)\r\nprint(res)", "n ,m ,a = map(int,input().split())\r\nnum1 = (n//a)\r\nnum2 = (m//a) \r\nif n%a : \r\n num1+=1\r\nif m%a :\r\n num2+=1\r\ncount = num1 * num2\r\nprint(int(count))", "l = input().split(' ')\r\nn = int(l[0])\r\nm = int(l[1])\r\na = int(l[2])\r\nprint( (n//a if n%a == 0 else (n//a + 1)) * ( m//a if m%a == 0 else (m//a + 1)))", "import math\r\n\r\ns = input().split(' ')\r\n\r\nn = int(s[0])\r\nm = int(s[1])\r\na = int(s[2])\r\n\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "sm = 1\r\nn, m, a = map(int, input().split())\r\nif n>a:\r\n sm*=(n+a-1)//a\r\nif m>a:\r\n sm*=(m+a-1)//a\r\nprint(sm)\r\n", "import math\n\ndef calculate_flagstones(n, m, a):\n return math.ceil(n / a) * math.ceil(m / a)\n\nn, m, a = map(int, input().split())\nresult = calculate_flagstones(n, m, a)\nprint(result)\n\t\t \t \t \t \t\t\t\t \t\t \t\t \t \t\t", "import math\r\ninput_list = input().split(\" \")\r\nnum = list(map(int , input_list))\r\nl = math.ceil(num[0] / num[2])\r\nw = math.ceil(num[1] / num[2])\r\nprint(l * w) \r\n", "n,m,a=map(int,input().split())\r\nif m%a == 0:\r\n v1 = m // a\r\nelse:\r\n v1 = m // a + 1\r\nif n%a == 0:\r\n v2 = n // a\r\nelse:\r\n v2 = n // a + 1\r\nprint(v1*v2)", "a , b , c = map( int , input().split())\r\nx = int( a / c );\r\nx1 = int( b / c );\r\nif ( a % c != 0 ):\r\n x+=1;\r\nif ( b % c != 0 ):\r\n x1+=1;\r\nprint( x * x1 ) ", "# LUOGU_RID: 125135735\nn,m,a=map(int,input().split())\r\nif n%a==0:\r\n p=n/a\r\nelse:\r\n p=int(n/a)+1\r\nif m%a==0:\r\n q=m/a\r\nelse:\r\n q=int(m/a)+1\r\nprint(int(p*q))", "def calculate_flagstones(n, m, a):\r\n import math\r\n return math.ceil(n/a) * math.ceil(m/a)\r\n\r\ninp = input()\r\nn, m, a = map(int, inp.split())\r\nprint(calculate_flagstones(n, m, a))\r\n", "from math import ceil\r\nn , m , a = map(int , input().split())\r\nres1 = ceil(n/a)\r\nres2 = ceil(m/a)\r\n\r\n\r\nprint(res1 * res2)", "import math\r\nn,m,a = (int(i) for i in input().split(' '))\r\nprint(math.ceil(n/a)*math.ceil(m/a))\r\n", "p,q,r = map(int, input().split())\r\nresp = (p + r - 1)//r\r\nresq = (q + r - 1)//r \r\ntot_res = resp*resq\r\nprint(tot_res)", "n,m,a=map(int,input().split())\r\nif n%a == 0 : r1=n//a\r\nelse: r1=(n//a)+1\r\nif m%a == 0: r2=m//a\r\nelse: r2=(m//a)+1\r\nprint(r1*r2)\r\n", "n, m, a = list(map(int, input().split(\" \")))\r\nif n/a != int(n/a):\r\n x = int(n/a) + 1\r\nelse:\r\n x = int(n/a)\r\nif m/a != int(m/a):\r\n y = int(m/a) + 1\r\nelse:\r\n y = int(m/a)\r\n\r\nprint(x*y)", "unos=input()\r\nniz=[]\r\nfor i in unos.split():\r\n broj=int(i)\r\n niz.append(broj)\r\nm=niz[0]\r\nn=niz[1]\r\na=niz[2]\r\nduz=0\r\nif m%a==0:\r\n duz=duz+m//a\r\nelse:\r\n duz=(duz+m//a)+1\r\nsir=0\r\nif n%a==0:\r\n sir=sir+n//a\r\nelse:\r\n sir=(sir+n//a)+1\r\nrez=duz*sir\r\nprint(rez)", "import math\n\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed for rows and columns\nrows = math.ceil(n / a)\ncols = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\nflagstones = rows * cols\n\nprint(flagstones)\n \t\t\t\t\t\t \t \t \t \t \t\t\t \t\t", "x=[int(x) for x in input().split()]\r\n\r\nfor _ in range(len(x)):\r\n if x[0]%x[2]==0:\r\n l=x[0]//x[2]\r\n else:\r\n l=x[0]//x[2]+1\r\nfor _ in range(len(x)):\r\n if x[1]%x[2]==0:\r\n l2=x[1]//x[2]\r\n else:\r\n l2=x[1]//x[2]+1\r\nprint(l*l2)\r\n", "m,n,a=[int(x) for x in input().split()]\r\nprint(-m//a*(-n//a))", "a,b,c=map(int,input().split())\r\nprint((a//-c)*(b//-c))", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nnum_flagstones_horizontal = math.ceil(m/a)\r\nnum_flagstones_vertical = math.ceil(n/a)\r\nnum_flagstones = num_flagstones_horizontal * num_flagstones_vertical\r\nprint(num_flagstones)", "a,b,c = map(int,input().split())\r\nd,e = 0,0 \r\nif a % c == 0:\r\n d = a//c\r\nelse:\r\n d = a//c + 1\r\nif b % c == 0:\r\n e = b//c\r\nelse:\r\n e = b//c + 1\r\nprint(d*e)", "n = input().split(\" \")\r\nresult_1,result_2 = int(n[0])/int(n[2]),(int(n[1])/int(n[2]))\r\n\r\nif result_1 % 1 != 0:\r\n result_1 = int(result_1) + 1\r\nelse:\r\n result_1 = int(result_1)\r\nif result_2 % 1 != 0:\r\n result_2 = int(result_2) + 1\r\nelse:\r\n result_2 = int(result_2)\r\nprint(result_1*result_2)", "x = input()\r\narr=x.split(\" \")\r\nn=int(arr[0])\r\nm=int(arr[1])\r\na=int(arr[2])\r\n\r\ndef Required(n,m,a):\r\n if(n%a==0):\r\n c=n//a\r\n else:\r\n c=n//a+1\r\n if(m%a==0):\r\n c1=m//a\r\n else:\r\n c1=m//a+1\r\n\r\n return c*c1\r\nprint(Required(n,m,a))", "# https://codeforces.com/problemset/problem/1/A\nimport math\n\n\ndef solve(n, m, a):\n n = n - a\n m = m - a\n n_added = math.ceil(n/a)\n m_added = math.ceil(m/a)\n f_added = n_added * m_added\n \n return 1 + n_added + m_added + f_added\n\n\nn, m, a = [int(e) for e in input().split()]\nprint(solve(n, m, a))\n", "import math\r\nimport sys\r\n\r\n# Read the input values from standard input\r\ninput_values = sys.stdin.readline().split()\r\nn, m, a = map(int, input_values)\r\n\r\n# Calculate the number of flagstones needed\r\nnum_flagstones = math.ceil(n/a) * math.ceil(m/a)\r\n\r\n# Print the result to standard output\r\nsys.stdout.write(str(num_flagstones))", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n adad1 = m//a\r\nelse:\r\n adad1 = m//a+1\r\nif n%a==0:\r\n adad2 = n//a\r\nelse:\r\n adad2 = n//a+1\r\nprint(adad1*adad2)\r\n", "(n,m,a) = map(int,input().split())\r\ncount = 0\r\nif n%a == 0:\r\n\tcount += n//a\r\nelse:\r\n\tcount += n//a + 1\r\nm = m - a\r\ntemp = 0\r\nif m%a == 0:\r\n\ttemp = m//a\r\nelse:\r\n\ttemp = m//a + 1\r\ncount += count*temp\r\nprint(count)\r\n\r\n\r\n", "a,b,c=map(int,str(input()).split())\r\nA=a//c;B=b//c\r\nif a%c!=0:\r\n A+=1\r\nif b%c!=0:\r\n B+=1\r\nprint(A*B)\r\n \r\n\r\n ", "a,b,c=[int(i) for i in input().split()]\r\nprint((-a//c)*(-b//c))", "a, b, c = map(int, input().split())\r\nchirina = a // c\r\ndlina = b // c\r\nif a % c != 0:\r\n chirina += 1\r\nif b % c !=0:\r\n dlina += 1\r\nprint(chirina*dlina)", "import sys\r\nimport math\r\ninput=sys.stdin.readline\r\nn,m,a=list(map(int,input().split(\" \")))\r\nseg1=math.ceil(n/a)\r\nseg2=math.ceil(m/a)\r\nprint(seg1*seg2)", "def num(s,hw):\r\n if s >0 :\r\n hw+=1-s\r\n return hw\r\n\r\nhi,wi,f=map(int,input().split())\r\nnumber_wi=wi/f\r\nnumber_hi=hi/f\r\ns=number_hi -int(number_hi) \r\nnumber_hi= num(s,number_hi)\r\ns=number_wi -int(number_wi)\r\nnumber_wi=num(s,number_wi)\r\nw=(int(number_wi*number_hi))\r\nprint(w)", "import math\r\na = input()\r\nb = a.split()\r\nfor i in range (len(b)):\r\n b[i] = int(b[i])\r\nprint(math.ceil((b[0]/b[2]))*math.ceil((b[1]/b[2])))", "import math\r\n\r\ndef least_number_of_flagstones(n, m, a):\r\n # Calculate the number of flagstones needed for the width and length\r\n width_flagstones = math.ceil(n / a)\r\n length_flagstones = math.ceil(m / a)\r\n \r\n # Return the total number of flagstones\r\n return width_flagstones * length_flagstones\r\n\r\n# Get the input values from the user\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the least number of flagstones\r\nresult = least_number_of_flagstones(n, m, a)\r\n\r\n# Print the result\r\nprint(result)\r\n", "x,y,a=map(int,input().split());\r\nprint(x//-a*(y//-a))", "m,n,a = [int(x) for x in input().split()]\r\nif m % a == 0:\r\n b = m / a\r\nelse:\r\n b = m // a + 1\r\nif n % a == 0:\r\n c = n / a\r\nelse:\r\n c = n // a + 1\r\nprint(int(b * c))", "import math\r\nn,m,a = map(int,input().split())\r\nnumber = math.ceil(n/a) * math.ceil(m/a)\r\nprint(number)", "import math \nn , m , a = [int(n) for n in input().split()]\nprint(math.ceil(n / a) * math.ceil(m / a))", "a,b,c=map(int,input().split())\r\nprint(-a//c*(-b//c))", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef 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\nstrInput = inlt()\r\nprint(math.ceil(strInput[0] / strInput[2]) * (math.ceil(strInput[1] / strInput[2])))", "# LUOGU_RID: 115927687\nn, m, a = map(int, input().split())\np, q = n // a, m // a\nif n % a != 0: \n\tp += 1\nif m % a != 0: \n\tq += 1\nprint(p * q)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Apr 27 19:31:11 2022\r\n\r\n@author: kiril\r\n\"\"\"\r\n\r\nimport math\r\nn, m, a = map(int, input().split())\r\nX = math.ceil(n / a)\r\nY = math.ceil(m / a)\r\nprint(X * Y)\r\n", "n,m,a=map(int,input().split())\r\ntiles=(n//a)*(m//a)\r\nif n%a==0 and m%a==0:\r\n pass\r\nelif n%a==0:\r\n tiles+=n//a\r\nelif m%a==0:\r\n tiles+=m//a\r\nelse:\r\n tiles+=n//a+m//a+1\r\nprint(tiles)", "x, y, a = map(int, input().split())\nif(x<=a and y<=a):\n print(1)\nelse:\n if(x%a==0 and y%a==0):\n print((y//a)*(x//a))\n elif(x%a!=0 and y%a==0):\n print((y//a)*((x//a)+1))\n elif(x%a==0 and y%a!=0):\n print(((y//a)+1)*(x//a))\n else:\n print(((x//a)+1)*((y//a)+1))\n \n\t \t\t \t\t \t \t\t\t\t\t \t\t\t\t\t \t \t", "n,m,a = map(int,input().split())\nsqArea=n*m\nflArea=a*a\nif n%a==0:\n count=n//a*(m//a)\n if m%a!=0:\n count+=n//a\nelse:\n nFl=n//a+1\n count=nFl*(m//a)\n if m%a!=0:\n count+=nFl\n \n \nprint(count)\n\n", "import math\r\nst = input().split(\" \")\r\nx = 0\r\nn, m ,a = int(st[0]), int(st[1]), int(st[2])\r\nprint(math.ceil(n/a) * math.ceil(m/a))", "n, m, a = map(int, input().split())\r\n\r\nx = m//a\r\ny = n//a\r\n\r\nif m%a > 0:\r\n x += 1\r\nif n%a > 0:\r\n y += 1\r\n\r\nprint(x*y)\r\n", "\n\n\n\n\n\nn, m, a = input().split()\nn = int(n)\na = int(a)\nm = int(m)\nz=n//a\nh=m//a\nif n%a != 0:\n z = z + 1\nif m%a != 0:\n h = h + 1\nu=z*h\nprint(u)\n", "n, m, a =map(int,input().split())\r\nif(m%a != 0):\r\n x= m // a + 1\r\nelse: \r\n x= m // a\r\n\r\nif(n%a != 0):\r\n y= n // a + 1 \r\nelse:\r\n y = n // a\r\n\r\nprint(x*y)", "# Ввод данных\r\nn, m, a = map(int, input().split())\r\n\r\n# Найдем количество плит вдоль длины площади (n)\r\nq1 = n // a\r\nif n % a != 0:\r\n q1 += 1\r\n\r\n# Найдем количество плит вдоль ширины площади (m)\r\nq2 = m // a\r\nif m % a != 0:\r\n q2 += 1\r\n\r\n# Вычислим общее количество плит\r\ntotal_plits = q1 * q2\r\n\r\n# Вывод результата\r\nprint(total_plits)\r\n", "from math import ceil\r\n\r\n\r\n(n, m, x) = map(int, input().split())\r\n\r\nl, s = min([n, m]), max([n, m])\r\n\r\nf = ceil(l/x)\r\nck = ceil(s/x)\r\n\r\nprint(f*ck)", "n,m,a=map(int,input().split())\r\nif m%a!=0 and n%a!=0:\r\n x=(m//a)+1\r\n y=(n//a)+1\r\nif m%a!=0 and n%a==0:\r\n x=(m//a)+1\r\n y=(n//a)\r\nif m%a==0 and n%a!=0:\r\n x=(m//a)\r\n y=(n//a)+1\r\nif m%a==0 and n%a==0:\r\n x=(m//a)\r\n y=(n//a)\r\n \r\nl=y*x\r\nprint(l)\r\n \r\n", "import math\n\ni = input()\ni = i.split(\" \")\nn = math.ceil(int(i[0]) / int(i[2]))\nm = math.ceil(int(i[1]) / int(i[2]))\n\nprint(n*m)\n\t\t \t \t \t \t \t \t \t \t\t \t\t", "import math\r\nm,n,a=map(int,input().split())\r\np=math.ceil(m/a)\r\nq=math.ceil(n/a)\r\nprint(q*p)", "n,m,a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\ni = n//a\r\nj = m//a\r\nif n%a != 0:\r\n i = i+1\r\nif m%a !=0:\r\n j = j+1\r\nprint(i*j)", "my_list=input().split()\r\na=int(my_list[0])\r\nb=int(my_list[1])\r\nc=int(my_list[2])\r\nfark=int(a/c)\r\nfark_2=int(b/c)\r\nif a%c!=0:\r\n fark+=1\r\nif b%c!=0:\r\n fark_2+=1\r\nsonuc=fark*fark_2\r\nprint(sonuc)", "import sys\r\nh=list(map(int,input().split()))\r\ng,k=0,0\r\nif h[0]%h[2]==0:\r\n g=h[0]//h[2]\r\nelse:\r\n g=h[0]//h[2]+1\r\nif h[1]%h[2]==0:\r\n k=h[1]//h[2]\r\nelse:\r\n k=h[1]//h[2]+1\r\nprint(g*k)", "import math\r\nimport bisect\r\nfrom collections import Counter\r\n# n=int(input())\r\n# count=0\r\n# for i in range(n):\r\na=list(map(int,input().split()))\r\nb=((math.ceil(a[0]/a[2]))*(math.ceil(a[1]/a[2])))\r\nprint(b)\r\n \r\n \r\n", "n,m,a=map(int,input().split())\r\nif m % a == 0:\r\n x = m//a\r\nelse:\r\n x = m//a+1\r\nif n % a == 0:\r\n y = n//a\r\nelse:\r\n y = n//a+1\r\nprint(x * y)", "#PROBLEM:A. Theatre Square\r\nn,m,a=map(int,input().split())\r\nr=(-n//a)*(-m//a)\r\nprint(r)\r\n", "def code(m, n ,a):\r\n l = -(-n//a)\r\n b = -(-m//a)\r\n return l*b\r\n \r\n[m, n, a] = [int(x) for x in input().split()]\r\nprint(code(m, n, a))\r\n", "n, m, a = map(int,input().split())\r\nif n % a > 0 : \r\n l = (n // a) + 1\r\nelse:\r\n l = n // a\r\nif m % a > 0 :\r\n w = (m // a) + 1\r\nelse:\r\n w = m // a\r\nprint (l * w)\r\n", "m,n,a=map(int,input().split())\r\nimport math\r\nval=math.ceil(m/a)*math.ceil(n/a)\r\nprint(val)", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n n=int(n/a)\r\nelse:\r\n n=int(n/a)+1\r\nif m%a==0:\r\n m=int(m/a)\r\nelse:\r\n m=int(m/a)+1\r\nprint(n*m)", "m,n,a=list(map(int,input().split()))\r\nif m%a==0:\r\n p=m//a \r\nelse:\r\n p=m//a+1\r\nif n%a==0:\r\n q=n//a \r\nelse:\r\n q=n//a+1\r\nprint(p*q)\r\n ", "n,m,a= map(int,input().split())\nif(m%a==0):\n\tr1=m//a\nelse:\n\tr1 = m//a+1\nif(n%a==0):\n\tr2=n//a\nelse:\n\tr2=n//a+1\nprint(r1*r2)\n \t\t\t \t \t\t\t\t\t \t \t \t \t \t\t", "def solve():\r\n inp = input()\r\n l = inp.split(\" \")\r\n n = int(l[0])\r\n m = int(l[1])\r\n a = int(l[2])\r\n x = int(n/a)\r\n y = int(m/a)\r\n if x*a != n:\r\n \tx += 1\r\n if y*a != m:\r\n \ty += 1\r\n print(x*y)\r\n \r\nsolve()", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\nn, m, a = map(int, input().split())\r\nn, m = max(n, m), min(n, m)\r\nif m <= a:\r\n print(f\"{n // a + (n % a > 0)}\\n\")\r\nelse:\r\n print(f\"{(n // a + (n % a > 0)) * (m // a + (m % a > 0))}\\n\")", "# t = int(input())\nt = 1\nfrom math import ceil\ndef cp():\n # code here\n x,y,z = tuple(map(int,input().split()))\n a = ceil(x/z)\n b = ceil(y/z)\n print(a*b)\n\n\n\n\n\n\n\n\n\n\n\nfor i in range(t):\n cp()\n", "import math as m\r\na,b,c=map(int,input().split())\r\nprint(m.ceil(a/c)*m.ceil(b/c))", "from math import ceil\r\nn,m,a = map(int,input().split())\r\nflag_stone1 = ceil((n/a))\r\nflag_stone2 = ceil((m/a))\r\nprint(flag_stone1 * flag_stone2)", "n,m,a=map(int,input().split())\r\nif(n%a==0 and m%a==0):\r\n x=int((n*m)/(a*a))\r\n print(x)\r\nelif(n%a==0 and m%a!=0):\r\n m=((m//a)+1)*a\r\n x=int((n*m)/(a*a))\r\n print(x)\r\nelif(n%a!=0 and m%a==0):\r\n n=((n//a)+1)*a\r\n x=int((n*m)/(a*a))\r\n print(x)\r\nelse:\r\n m=((m//a)+1)*a\r\n n=((n//a)+1)*a\r\n x=int((n*m)/(a*a))\r\n print(x)\r\n ", "from math import ceil\r\np,q,r=map(int,input().split())\r\nprint(int(ceil(p/r)*ceil(q/r)))", "n,m,a=[int(e) for e in input().split()]\r\nprint(((n+a-1)//a)*((m+a-1)//a))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 13 16:11:51 2022\n\n@author: calvinzhu\n\"\"\"\n\nstr = input()\n\nlist = str.split(' ')\nn = int(list[0])\nm = int(list[1])\na = int(list[2])\n\nif n%a == 0:\n x = n//a\nelse:\n x = n//a+1\n \nif m%a == 0:\n y = m//a\nelse:\n y = m//a+1\n\nprint(x*y)", "n, m, a = tuple (map (int, input ().split (' ')))\r\nstones = (int ((n - 1) / a) + 1) * (int ((m - 1) / a) + 1)\r\nprint (stones)", "import math\r\n\r\nn, m, a = map(float, input().split())\r\n\r\nif m < n:\r\n temp = m\r\n m = n\r\n n = temp\r\n\r\nif a >= m:\r\n print(math.ceil(n/a))\r\nelse:\r\n print(math.ceil(m/a)*math.ceil(n/a))", "import math\n\ninput1 = str(input()).split()\nb = list(map(int, input1))\nprint(math.ceil(b[0] / b[2]) * math.ceil(b[1] / b[2]))\n\n", "import math\r\nN = str(input(\"\"))\r\nN = N.split()\r\nN = [int(i) for i in N]\r\nFINAL_NUMBER = (math.ceil(N[0]/N[2]))*(math.ceil(N[1]/N[2]))\r\nprint(FINAL_NUMBER)", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nprint(ceil(m/a)*ceil(n/a))", "if __name__ == '__main__':\r\n n, m, a = list(map(int, input().split()))\r\n x = n // a if n % a == 0 else n // a + 1\r\n y = m // a if m % a == 0 else m // a + 1\r\n print(x * y)\r\n", "n, m, a = [int(item) for item in input().split()] # n,m wdith and height of square. a width and height of flagstone\r\n\r\nx = n // a # number of flagstones that fit vertically inside the square\r\ny = m // a # number of flagstones that fit horizontally inside the square\r\n\r\n# if either horizontally or vertically doesnt exactly match we need an extra flagstone for that direction\r\nif n % a != 0:\r\n x += 1\r\nif m % a != 0:\r\n y += 1\r\n\r\n# return the total number of flagstones needed\r\ntotal = x*y \r\n\r\nprint(total)", "n, m, a = map(int, input().split())\r\n\r\nif m % a == 0:\r\n x1 = m//a\r\nelse:\r\n x1 = m//a+1\r\n\r\nif n % a == 0:\r\n x2 = n//a\r\nelse:\r\n x2 = n//a+1\r\n\r\n\r\nprint(x1*x2)", "from math import ceil\r\nnum1, num2, num3 = map(int,input().split()) \r\nprint(ceil(num1/num3)* ceil(num2/num3)) ", "M_input = input().split()\r\nM_int =list(map(int,M_input))\r\n\r\na = M_int[0]\r\nb = M_int[1]\r\nc = M_int[2]\r\n\r\nif (a%c > 0):\r\n B = int(a/c + 1)\r\n\r\nelse:\r\n B = int(a/c)\r\n\r\n\r\nif (b%c > 0):\r\n C = int(b/c + 1)\r\n\r\nelse:\r\n C = int(b/c)\r\n\r\nA = B*C\r\n\r\nprint(A)", "x,y,z=map(int,input().split())\r\na=(x+z-1)//z\r\nb=(y+z-1)//z\r\nprint(a*b)", "import math as m\r\n\r\nl = list(map(int, input().split()))\r\nprint( m.ceil(l[0]/l[2]) * m.ceil(l[1]/l[2]) )", "n, m, a = map(int, input().split())\r\nprint((n//a+1 if n//a != n/a else n//a)*(m//a+1 if m//a != m/a else m//a))\r\n", "import math\nx,y,z=list(map(float,input().split()))\nprint(math.ceil(x/z)*math.ceil(y/z))\n\t\t\t \t\t \t\t \t\t \t \t\t \t\t\t \t", "\r\nimport math\r\nn, m, a = map(int, input().split())\r\n\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a)\r\n\r\nsoul = x * y\r\nprint(soul)", "import math\r\na=[int(I) for I in input().split()]\r\nprint(math.ceil(a[0]/a[2])*math.ceil(a[1]/a[2]))\r\n", "n, m, a = map(int, input().split())\r\nn_flagstones = n // a\r\nif n % a > 0:\r\n n_flagstones += 1\r\nm_flagstones = m // a\r\nif m % a > 0:\r\n m_flagstones += 1\r\ntotal_flagstones = n_flagstones * m_flagstones\r\nprint(total_flagstones)\r\n", "# import sys\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\nm, n, a = map(int, input().split())\nl1 = (m - 1) // a + 1\nl2 = (n - 1) // a + 1\nprint(l1 * l2)", "\r\ndef square(n,m,a):\r\n count=1\r\n count1=1\r\n first=n%a\r\n second=m%a\r\n if first!=0:\r\n count1=n//a+1\r\n if second!=0:\r\n count=m//a+1\r\n if first==0:\r\n count1=n/a\r\n if second==0:\r\n count=m/a\r\n print(int(count*count1))\r\ntemp = input().split()\r\nn = int(temp[0])\r\nm = int(temp[1])\r\na = int(temp[2])\r\n\r\nsquare(n,m,a)", "inp = list(map(int, input().split()))\r\na=inp[0]\r\nb=inp[1]\r\nc=inp[2]\r\nh=c*c\r\nif ((a*b)<h):\r\n print(1)\r\nelse:\r\n if((a%c!=0) and (b%c!=0)):\r\n d=c-(a%c)\r\n f=c-(b%c)\r\n a=a+d\r\n b=b+f\r\n g=(a//c)*(b//c)\r\n print(g)\r\n elif(a%c!=0) or (b%c!=0):\r\n if(a%c!=0):\r\n k=c-(a%c)\r\n a+=k\r\n print((a//c)*(b//c))\r\n elif (b%c!=0):\r\n h=c-(b%c) \r\n b+=h\r\n print((a//c)*(b//c))\r\n elif((a%c!=0) and (b%c!=0)):\r\n d=c-(a%c)\r\n f=c-(b%c)\r\n a=a+d\r\n b=b+f\r\n g=(a/c)*(b/c)\r\n print(g)\r\n else:\r\n print((a//c)*(b//c))", "import math\r\na,b,c = map(int, input().split())\r\na = math.ceil(a/c)\r\nb = math.ceil(b/c)\r\nprint(int(a*b))", "n,m,a=map(int,input().split())\r\nif n%a==0 and m%a==0:\r\n print(int((m/a)*(n/a)))\r\nelif n%a==0:\r\n print(int((int(m/a)+1)*(n/a)))\r\nelif m%a==0:\r\n print(int((int(n/a)+1)*(m/a)))\r\nelse:\r\n print((int(m/a)+1)*(int(n/a)+1))", "n,m,a=map(int,input().split())\r\nsq_n=n//a\r\nif n%a!=0:\r\n sq_n+=1\r\nsq_m=m//a\r\nif m%a!=0:\r\n sq_m+=1\r\nr=sq_n*sq_m\r\nprint(r)", "p,q,z=map(int,input().split())\nif p%z==0:a=p//z\nelif p%z!=0:a=(p//z)+1\nif q%z==0:b=q//z\nelif q%z!=0:b=(q//z)+1\nprint(a*b)\n\n \t\t\t\t\t\t \t\t\t \t\t\t\t\t\t \t \t \t", "import math\r\n\r\ndef function(a, b, c):\r\n ans = math.ceil(a/c) * math.ceil(b/c)\r\n return ans\r\n\r\n\r\ninp = list(map(int, input().split()))\r\na = inp[0]\r\nb = inp[1]\r\nc = inp[2]\r\nans = function(a, b, c)\r\nprint(ans)\r\n\r\n \r\n ", "import math\r\n\r\nn, m, a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n\r\nrowW = math.ceil(n / a)\r\ncolumnW = math.ceil(m / a) \r\nprint(rowW * columnW)", "n, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\nr = -n//a*(-m//a)\r\nprint(int(r))", "n, m, a = map(int, input().split())\r\nt = ((n//a)+(1 if n%a !=0 else 0))*((m//a)+(1 if m%a!=0 else 0))\r\nprint(t)", "a = list(map(int, input().split()))\r\nm = int(a[0])\r\nn = int(a[1])\r\na = int(a[2])\r\n\r\n\r\nif m % a != 0:\r\n j = m//a+1\r\nelse:\r\n j = m//a\r\nif n % a != 0:\r\n k = n//a+1\r\nelse:\r\n k = n//a\r\nans = k*j\r\n\r\n\r\nprint(ans)\r\n", "from math import ceil\r\nm,n,x=map(int,input().split())\r\na=ceil(m/x)\r\nb=ceil(n/x)\r\nprint(int(a*b))", "n,m,a=list(map(int,input().split()))\r\nif(n%a!=0):\r\n na=n//a+1\r\nelse:\r\n na=n//a\r\nif(m%a!=0):\r\n ma=m//a+1\r\nelse:\r\n ma=m//a\r\nprint(na*ma)", "# Leer entradas\nn, m, a = map(int, input().split())\n\n# Clacular nuemro necesario\nn_flagstones = n // a + (n % a != 0)\nm_flagstones = m // a + (m % a != 0)\n\n# Calcular total de flagstone\ntotal_flagstones = n_flagstones * m_flagstones\n\n# Imprimir\nprint(total_flagstones)\n\t \t\t \t \t\t\t\t\t \t \t \t\t \t \t", "import math\r\n\r\nm,n,a = input().split()\r\nside = int(m)/int(a) \r\nlength = int(n)/int(a) \r\nfinalnum = math.ceil(side) * math.ceil(length)\r\nprint(finalnum)\r\n", "n,m,a=map(int,input().split())\r\nx=-n//a\r\ny=-m//a\r\nprint(x*y)", "import math\n\ndef least_flagstones(n, m, a):\n num_flagstones = math.ceil(n / a) * math.ceil(m / a)\n return num_flagstones\nn, m, a = map(int, input().split())\nresult = least_flagstones(n, m, a)\nprint(result)\n\n\n \t \t\t \t\t \t \t\t \t \t\t \t\t", "n,m,a = map(int,input().split())\r\nx = 0\r\ny = 0\r\nif n%a == 0:\r\n x = n//a\r\nelse :\r\n x = n//a + 1\r\n \r\nif m%a == 0 :\r\n y = m//a\r\nelse :\r\n y = m//a + 1\r\n\r\nprint(x*y)", "# Name Problem: A. Theatre Square\n# link: https://codeforces.com/problemset/problem/1/A\n# Author: Ricardo Andrade\n# Date: 23/09/22\n\n# Exemple imput:\n# 6 6 4\n# output:\n# 4\n\nimport math\n\nm, n, a = [int(item) for item in input().split()]\nprint(math.ceil(m/a) * math.ceil(n/a))", "str=list(map(int,input().split(' ')))\r\nn=str[0]\r\nm=str[1]\r\na=str[2]\r\n\r\nif n%a==0:\r\n x=n//a\r\nif n%a!=0:\r\n x=(n//a)+1\r\nif m%a==0:\r\n y=m//a\r\nif m%a!=0:\r\n y=(m//a)+1\r\n\r\nans=(x)*(y)\r\nprint(ans)", "import math\r\nx,y,a = map(int, input().strip().split(\" \"))\r\nprint(int(math.ceil(x/a)*math.ceil(y/a)))", "n,m,a=map(int,input().split())\r\nnum_n=-(-n//a)\r\nnum_m=-(-m//a)\r\nt=num_n*num_m\r\nprint(t)", "from sys import stdin\r\n\r\ndef main():\r\n n, m, a = map(int, stdin.readline().split())\r\n\r\n ln = n // a\r\n lm = m // a\r\n\r\n if (n % a < a and n % a > 0):\r\n ln += 1\r\n \r\n if (m % a < a and m % a > 0):\r\n lm += 1\r\n \r\n print(ln * lm)\r\n\r\nif __name__ == '__main__':\r\n main()", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n\r\ntiles_width = math.ceil(n / a)\r\ntiles_length = math.ceil(m / a)\r\n\r\n\r\ntotal_tiles = tiles_width * tiles_length\r\n\r\n\r\nprint(total_tiles)", "from math import ceil\r\n\r\ndef theatre_square():\r\n n,m,a = map(int,input().split())\r\n count = ceil(n/a) * ceil(m/a)\r\n print(count)\r\n\r\ntheatre_square()", "n,m,a = map(int, input().split())\r\n\r\nif m%a == 0:\r\n flagstones1 = m//a\r\nelse:\r\n flagstones1 = (m//a) + 1\r\n \r\nif n%a == 0:\r\n flagstones2 = n//a\r\nelse:\r\n flagstones2 = (n//a) + 1\r\n \r\nnumber_of_needed_flagstones = flagstones1 * flagstones2\r\nprint(number_of_needed_flagstones)", "n,m,a=map(int,input().split())\r\ni=int(n/a)\r\nif n%a!=0:\r\n i+=1\r\nj=int(m/a)\r\nif m%a!=0:\r\n j+=1\r\nprint(i*j)", "Input=input()\r\nInput=Input.split()\r\nn,m,a=int(Input[0]),int(Input[1]),int(Input[2])\r\ndef Flagstones(m,n,a):\r\n if m%a==0:\r\n p1=m//a\r\n else:\r\n p1=(m//a)+1\r\n if n%a==0:\r\n p2=n//a\r\n else:\r\n p2=(n//a)+1\r\n return p1*p2\r\nprint(Flagstones(n,m,a))", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n new=m//a\r\nelse:\r\n new=m//a +1\r\nif n%a==0:\r\n mew=n//a\r\nelse:\r\n mew=n//a +1\r\nprint(new*mew)\r\n\r\n \r\n", "a=list(map(int,input().split()))\r\nn=int(a[0]/a[2])\r\nif(a[0]%a[2]!=0):\r\n n=n+1\r\nm=int(a[1]/a[2])\r\nif(a[1]%a[2]!=0):\r\n m=m+1\r\n\r\nprint(n*m)\r\n", "n = 1\r\nfor i in range(n):\r\n s=[int(m) for m in input().split()]\r\n if s[0] > 0 and s[1] > 0 and s[2] > 0 :\r\n if s[0]%s[2]==0:\r\n x=s[0]/s[2]\r\n else:\r\n x=s[0]//s[2] + 1\r\n if s[1]%s[2]==0:\r\n y=s[1]/s[2]\r\n else:\r\n y=s[1]//s[2] + 1\r\n print(int(x*y))\r\n else:\r\n print(\"wrong input\")", "import math\r\na,b,c = map(int, input().split())\r\nA1=math.ceil(a/c)\r\nA2=math.ceil(b/c)\r\nprint(A1*A2)", "def theatreSquare():\r\n\tnums=input().split()\r\n\tn=int(nums[0])\r\n\tm=int(nums[1])\r\n\ta=int(nums[2])\r\n\twidth=n/a if n%a==0 else n//a+1\r\n\theight=m/a if m%a==0 else m//a+1\r\n\treturn int(width*height)\r\nprint(theatreSquare())", "import math\n\nn = []\nwhile len(n) != 3:\n try:\n n = list(map(int, input().split()))\n except KeyboardInterrupt:\n exit()\n except:\n pass\n \nno_of_tiles = math.ceil(n[0]/n[2]) * math.ceil(n[1]/n[2])\nprint(no_of_tiles)\n\n", "n, m, a = map(int, input().split())\r\nflagstones_n = (n + a - 1) // a \r\nflagstones_m = (m + a - 1) // a\r\ntotal_flagstones = flagstones_n * flagstones_m\r\nprint(total_flagstones)\r\n", "import math\nl = input()\nn = int(l.split(\" \")[0])\nm = int(l.split(\" \")[1])\na = int(l.split(\" \")[2])\nprint(math.ceil(n/a)*math.ceil(m/a))\n", "import math\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required in the horizontal direction\r\nhorizontal_flagstones = math.ceil(n / a)\r\n\r\n# Calculate the number of flagstones required in the vertical direction\r\nvertical_flagstones = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = horizontal_flagstones * vertical_flagstones\r\n\r\n# Output the result\r\nprint(total_flagstones)\r\n", "from math import ceil\r\nx,y,a=map(int,input().split())\r\n#print(((x+a-1)//a)*((y+a-1)//a))\r\nprint(ceil(x/a)*ceil(y/a))", "import math\r\n\r\ndef pave_square(n, m, a):\r\n horizontal = math.ceil(n / a)\r\n vertical = math.ceil(m / a)\r\n return horizontal * vertical\r\n\r\n# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = pave_square(n, m, a)\r\nprint(result)", "from math import ceil\r\nt,a,n = map(int,input().split())\r\nu = ceil(t/n)\r\ns = ceil(a/n)\r\nprint(int(u*s))", "import math\n\ndef ts():\n strl = input().split(' ')\n n,m,a = int(strl[0]),int(strl[1]),int(strl[2])\n if a == 1:\n print(n*m)\n else:\n print(math.ceil((n/a))*math.ceil((m/a)))\nts()", "m,n,a=map(int,input().split())\r\nk=1 if m%a!=0 else 0\r\np=1 if n%a!=0 else 0\r\nprint((m//a+k)*(n//a+p))\r\n", "import math\r\n\r\nn, m, a = input().split()\r\n# print(type (n))\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n#print(type (n))\r\np = 1\r\nq = 1\r\nif a < n :\r\n p = n / a\r\n ceiled_valuep = math.ceil(p)\r\nelif a >= n:\r\n ceiled_valuep = 1\r\ntiles_1 = ceiled_valuep\r\n\r\nif a < m :\r\n q = m / a\r\n ceiled_valueq = math.ceil(q)\r\nelif a >= m :\r\n ceiled_valueq = 1\r\n#print(p)\r\n#print(q)\r\ntiles_2 = ceiled_valueq\r\ntotal_tiles = tiles_1 * tiles_2\r\nprint (total_tiles)", "a, b, c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nd = 0\nf = 0\nif a % c == 0:\n d = a // c\nelse:\n d = a // c + 1\nif b % c == 0:\n f = b // c\nelse:\n f = b // c + 1\nprint(d*f)\n\t\t\t \t \t\t \t\t \t\t \t \t\t \t", "import math\r\nl=input().split()\r\nl=[int(x) for x in l]\r\nn=l[0]\r\nm=l[1]\r\na=l[2]\r\np=n/a\r\nk=m/a\r\nv=math.ceil(p)*math.ceil(k)\r\nprint(v)\r\n", "n,m,a=map(int,input().split())\r\nif m%a == 0:\r\n d1 = m//a\r\nelse:\r\n d1 = m//a+1\r\n \r\nif n%a == 0:\r\n d2 = n//a\r\nelse:\r\n d2 = n//a+1\r\nprint(d1*d2)", "import math\r\n\r\n\r\nn, m, a = [int(x) for x in input().split()]\r\nx = math.ceil(n / a)\r\ny = math.ceil(m / a)\r\nprint(x*y)\r\n", "if __name__ == \"__main__\":\r\n n, m, a = map(int, input().split())\r\n\r\n an = n // a if n % a == 0 else (n // a + 1)\r\n am = m // a if m % a == 0 else (m // a + 1)\r\n\r\n print(an*am)\r\n", "\"\"\" Input\r\nThe input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).\r\n\r\nOutput\r\nWrite the needed number of flagstones. \"\"\"\r\n\r\nimport math\r\n\r\ninput_string = input()\r\nstring_list = input_string.split(\" \")\r\nint_list = [int(x) for x in string_list]\r\nx = math.floor(int_list[0]/int_list[2])\r\ny = math.floor(int_list[1]/int_list[2])\r\nif(int_list[0]%int_list[2] != 0):\r\n x += 1\r\nif(int_list[1]%int_list[2] != 0):\r\n y += 1\r\nprint(x*y)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 18 19:52:52 2022\r\n\r\n@author: lwrns\r\n\"\"\"\r\n\r\nn,m,a=map(int,input().split()) \r\n \r\nif m%a==0: \r\n r1=m//a \r\nelse: \r\n r1=m//a+1 \r\n \r\nif n%a==0: \r\n r2=n//a \r\nelse: \r\n r2=n//a+1 \r\n \r\nprint(r1*r2)\r\n", "n,m,a = [int(x) for x in input().split()]\r\nif n%a==0:\r\n b = int(n//a)\r\nelse :\r\n b = int(n//a)+1\r\nif m%a==0:\r\n c = int(m//a)\r\nelse :\r\n c = int(m//a)+1\r\nd = b*c\r\nprint(d)", "n,m,a = map(int,input().split())\r\nnn = n//a\r\nmm = m//a\r\nif n % a:\r\n nn += 1\r\nif m % a:\r\n mm += 1\r\nprint(nn*mm)", "n,m,a=list(map(int,input().split()))\r\nif n%a==0:\r\n x=int(n/a)\r\nelse:\r\n x=int(n/a)+1\r\nif m%a==0:\r\n y=x*int(m/a)\r\nelse:\r\n y=x*(int(m/a)+1)\r\nprint(y)", "import math\r\ns = input().strip().split(\" \")\r\nlist1 = []\r\nfor i in s:\r\n list1.append(int(i))\r\n\r\nn = list1[0]\r\nm = list1[1]\r\na = list1[2]\r\n\r\nimport math\r\n\r\nprint(math.ceil(m / a) * math.ceil(n / a))", "import sys\nn,m,a = tuple(map(int, sys.stdin.readline().strip().split()))\nprint(((n-1)//a+1)*((m-1)//a+1))", "import math\r\nl,b,a=map(int,input().split())\r\nc=0\r\nif(l%a==0):\r\n c1=math.floor(l/a)\r\nelse:\r\n c1=math.floor(l/a)+1\r\nif(b%a==0):\r\n c2=math.floor(b/a)\r\nelse:\r\n c2=math.floor(b/a)+1\r\nprint(c1*c2)", "def solve_theatre_square(n, m, a):\r\n # Calculate the number of flagstones required along each dimension\r\n horizontal_flagstones = (n + a - 1) // a\r\n vertical_flagstones = (m + a - 1) // a\r\n \r\n # Calculate the total number of flagstones required\r\n total_flagstones = horizontal_flagstones * vertical_flagstones\r\n \r\n return total_flagstones\r\n\r\n# Input: n, m, and a\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = solve_theatre_square(n, m, a)\r\nprint(result)", "n, m, a = (int(s) for s in input().split())\n\ncols = n // a\nif n % a > 0:\n cols += 1\n\nrows = m // a\nif m % a > 0:\n rows += 1\n \nprint(cols * rows)\n\n", "import math\n\npp= input()\np,pppp,ppp = pp.split()\np = float(p)\nppp = float(ppp)\npppp = float(pppp)\nmath1= p/ppp\nmath2= pppp/ppp\nnilai1 = math.ceil(math1)\nnilai2 = math.ceil(math2)\nprint(nilai2*nilai1)", "import math\r\n\r\nd = input()\r\nc = d.split()\r\n\r\nm = int(c[0])\r\nn = int(c[1])\r\na = int(c[2])\r\n\r\nres = math.ceil(m/a) * math.ceil(n/a)\r\n\r\nprint(res)\r\n", "n, m, a = tuple([eval(x) for x in input().split()])\r\n# logic\r\nimport math\r\n\r\nprint(math.ceil(m / a) * math.ceil(n / a))", "st = list(map(int,input().split()))\ncnt = 0\nct = 0\nif st[0] % st[2] == 0:\n cnt = st[0] // st[2]\nelse:\n cnt = st[0]//st[2]+1\nif st[1] % st[2] == 0:\n ct = st[1] // st[2]\nelse:\n ct = st[1]//st[2]+1\nprint(cnt*ct)\n\n\t \t \t \t \t\t \t\t \t\t \t \t \t\t\t\t", "n,m,a = map(int,input().split())\r\nl=0\r\nb=0\r\nif n%a==0:\r\n l=n//a\r\nelif not n%a==0:\r\n l=(n//a)+1\r\n\r\nif m%a==0:\r\n b=m//a\r\nelif not m%a==0:\r\n b=(m//a)+1\r\nprint(l*b)", "import math\r\ninput_data=input().split()\r\nn = int (input_data [0])\r\nm = int (input_data [1])\r\na = int (input_data [2])\r\n\r\noutput_data=math.ceil(n/a)*math.ceil(m/a)\r\noutput_data=int(output_data)\r\nprint(output_data)", "import shlex\r\nimport math\r\n\r\nline = input()\r\n\r\nvalues = shlex.split(line)\r\n\r\nn, m, a = map(float, values)\r\n\r\nif m < n:\r\n temp = m\r\n m = n\r\n n = temp\r\n\r\nif a >= m:\r\n print(math.ceil(n / a))\r\nelse:\r\n print(math.ceil(m / a) * math.ceil(n / a))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, a = map(int, input().split())\r\nx = n // a\r\ny = m // a\r\n\r\nif (n % a) != 0:\r\n x += 1\r\nif (m % a) != 0:\r\n y += 1\r\nprint(x*y)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nc = math.ceil\r\n\r\nprint(c(n/a) * c(m/a))", "n,m,a=[int(x) for x in input().split()]\r\nif n%a==0:\r\n kenar1=int(n/a)\r\nelse:\r\n kenar1=int(n/a)+1\r\nif m%a==0:\r\n kenar2=int(m/a)\r\nelse:\r\n kenar2=int(m/a)+1\r\nprint(kenar1*kenar2)\r\n\r\n", "a, b, c = map(int, input().split())\r\na1 = a // c\r\nb1 = b // c\r\nif a%c > 0:\r\n\ta1+=1\r\nif b%c > 0:\r\n\tb1+=1\r\nc1 = a1*b1\r\nprint(c1)", "# LUOGU_RID: 126170382\nimport math\r\nm, n, a = [int(x) for x in input().split()]\r\nnum = math.ceil(m/a) * math.ceil(n/a)\r\nprint(num)", "a,b,c=map(int,input().split())\nd=a//c\ne=b//c\nif(a%c!=0):\n d=d+1\nif(b%c!=0):\n e+=1\nprint(d*e)\n \t \t \t\t\t\t \t \t\t\t\t \t \t \t\t", "n,m,a=map(int,input().split())\r\nif m%a ==0:\r\n v1=m//a\r\nelse:\r\n v1=m//a +1\r\nif n%a==0:\r\n v2=n//a\r\nelse:\r\n v2=n//a +1\r\nprint(v1*v2)", "import math\r\nn,m,a=map(int, input().split())\r\nprint(math.ceil(n/a)+math.ceil(n/a)*(math.ceil(m/a)-1))", "n, m, a = map(int, input().split())\nif (n%a != 0): \n n = n // a + 1 \nelse: \n n =n// a\nif (m%a != 0): \n m = m // a + 1 \nelse: \n m= m//a\nprint(n*m)\n", "n,x,i=map(int,input().split());print(n//-i*(x//-i))", "n, m , a =map(int, input(\" \").split())\r\n\r\nif m%a == 0:\r\n val1 = m//a \r\nelse:\r\n val1 = m//a+1\r\n\r\nif n%a == 0:\r\n val2 = n//a \r\nelse:\r\n val2 = n//a+1\r\n\r\nprint(val1*val2)", "n,m,a=map(int,input().split())\r\ns=((n+(a-1))//a)*((m+(a-1))//a)\r\nprint(s)", "n, m, a = map(int, input().split())\r\nk = 0\r\nc = 0\r\nif n % a == 0:\r\n k = n//a\r\nelse:\r\n k = (n//a) + 1\r\nif m % a == 0:\r\n c = m//a\r\nelse:\r\n c = (m//a) + 1\r\nprint(k*c)", "from math import ceil\na, b, c = map(int, input().split())\n\nd1 = ceil(a / c)\nd2 = ceil(b / c)\n\nprint(d1 * d2)", "import math\r\n\r\nnums = input()\r\n\r\nx , y , z = map(int, nums.split())\r\n\r\nans = math.ceil(x / z) * math.ceil(y / z)\r\n\r\nprint(ans)", "import sys\r\nn = list(map(int,input().split(\" \")))\r\n\r\nx,y = 0,0\r\nif n[0]%n[2] == 0:\r\n x = n[0]//n[2]\r\nelse:\r\n x = n[0]//n[2] + 1\r\nif n[1]%n[2] == 0:\r\n y = n[1]//n[2]\r\nelse:\r\n y = n[1]//n[2] + 1\r\nprint(x*y)\r\n", "a=input()\r\nb=a.split(\" \")\r\nc=int(b[0])\r\nd=int(b[1])\r\ne=int(b[2])\r\nif c>=1 and e<=10**9:\r\n f=c/e\r\n if (c%e!=0):\r\n f=(int(c/e))+1\r\n g=d/e\r\n if d%e!=0:\r\n g=(int(d/e))+1\r\n total=int(f*g)\r\nprint(total)", "from math import ceil\r\na,b,c = [int(i) for i in input().split()]\r\nv = ceil(a/c)*ceil(b/c)\r\nprint(v)\r\n", "n, m, a = map(int, input().split())\r\n\r\nn_, m_ = n / a, m / a\r\n\r\nn_ = int(n_) + (1 if n_ != int(n_) else 0)\r\nm_ = int(m_) + (1 if m_ != int(m_) else 0)\r\n\r\nprint(n_ * m_)\r\n", "n,m,a=map(int,input().split())\r\nan=n//a\r\nif n%a!=0:\r\n an+=1\r\nam=m//a\r\nif m%a!=0:\r\n am+=1 \r\nprint(an*am)", "o, p, a = map( int, input().split() ) \nnum_flagstones_o = (o + a - 1) // a\nnum_flagstones_p = (p + a - 1) // a\ntotal_flagstones = num_flagstones_o * num_flagstones_p\nprint(total_flagstones)\n \t \t\t\t \t \t \t\t \t\t \t\t\t \t\t\t", "from io import BytesIO\r\nfrom os import fstat, read\r\nfrom sys import stdout\r\nfrom math import sqrt\r\nfrom turtle import st\r\n\r\ndef fast_input(file_no = 0):\r\n byte_stream = BytesIO(read(file_no, fstat(file_no).st_size))\r\n return byte_stream\r\n\r\n\r\n#fi = open(PATH_INPUT, \"r\")\r\n#io_byte_input = fast_input(fi.fileno())\r\nio_byte_input = fast_input()\r\n#fi.close()\r\nf_input = lambda: io_byte_input.readline().decode().strip()\r\n\r\ndef f_print(*output, sep = \"\\n\"):\r\n for i in output:\r\n stdout.write(str(i) + sep)\r\n #if sep != \"\\n\":\r\n # stdout.write(\"\\n\")\r\nn, m, a = map(int, f_input().split())\r\nrow = n // a + (n % a != 0)\r\ncolumn = m // a + (m % a != 0)\r\nf_print(row * column)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\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\nl=input().split()\r\nn=int(l[0])\r\nm=int(l[1])\r\na=int(l[2])\r\n\r\nx=int(math.ceil(n/a))\r\ny=int(math.ceil(m/a))\r\n\r\nprint(x*y)", "n, m, a = list(map(int,input().split()))\r\nq = n // a\r\nw = m // a\r\nif n % a != 0:\r\n q += 1\r\nif m % a != 0:\r\n w += 1\r\nprint(q*w)", "n,m,a=map(int,input().split())\nna=0\nma=0\nans=0\nna=int(n//a)\nif n%a!=0:\n na+=1\nma=int(m//a)\nif m%a!=0:\n ma+=1\nans=ma*na\nprint(int(ans))\n \t \t\t \t\t \t \t\t \t\t\t\t\t\t\t \t \t", "n,m,a =map(int,input().split())\r\nnum_flagstones_width = n // a\r\nnum_flagstones_height = m // a\r\nif n%a != 0:\r\n num_flagstones_width += 1\r\nif m%a != 0:\r\n num_flagstones_height += 1\r\ntotal_flagstones = num_flagstones_width * num_flagstones_height\r\nprint(total_flagstones)", "\r\na,b,c= [int(i) for i in input().split()]\r\ndef ceil(x,y):\r\n if x%y==0:\r\n d=x//y\r\n else:\r\n d=(x//y)+1\r\n return d\r\nprint(ceil(a,c)*(ceil(b,c)))", "import math\r\nn, m, a = map(int, input().split())\r\nb = math.ceil(n / a)\r\nd = math.ceil(m / a)\r\nif(b*d==0):\r\n print(\"0\")\r\nelse:\r\n print(b * d)\r\n", "n,m,a = map(int,input().split())\r\n\r\nif n % a == 0 :\r\n c= n / a\r\nelse :\r\n c= n//a + 1\r\n\r\nif m % a == 0 :\r\n d= m / a\r\nelse :\r\n d= m//a + 1\r\n\r\nnumberofflagstones = c * d\r\n\r\nprint(\"{0:.0f}\".format(numberofflagstones))", "import math\r\na,b,c=map(int,input().split())\r\nif math.trunc(a/c)==a/c:\r\n s=a/c\r\nelse:\r\n s=math.trunc(a/c+1)\r\nif math.trunc(b/c)==b/c:\r\n e=b/c\r\nelse:\r\n e=math.trunc(b/c+1)\r\nprint(math.trunc(s*e))", "n = [int(i) for i in input().split()]\r\n\r\nprint(((n[0] + n[2] - 1) // n[2]) * ((n[1] + n[2] - 1) // n[2]))", "n, m, a = map(int, input().split())\r\n\r\nlength_flagstones = n // a\r\nif n % a != 0:\r\n length_flagstones += 1\r\nwidth_flagstones = m // a\r\nif m % a != 0:\r\n width_flagstones += 1\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\nprint(total_flagstones)\r\n", "n,m,a=map(int,input().split())\r\ns=n*m\r\np=a*a\r\nh1=(n-1)//a+1\r\nh2=(m-1)//a+1\r\nl=h1*h2\r\nprint(l)\r\n", "from math import *\r\nx=list(map(int,input().split()))\r\nn,m,a=x[0],x[1],x[2]\r\nprint(ceil(n/a)*ceil(m/a))\r\n", "n,m,a = map(int, input().split())\r\nx=n//a\r\ny=m//a\r\nif n%a!=0:\r\n x=n//a+1\r\nif m%a!=0:\r\n y=m//a+1\r\nprint(x*y)\r\n", "import math\r\nn, m , a = [x for x in map(int,input(\"\").split(\" \"))]\r\nprint(\"%i\"%(max(1,math.ceil(m / a)) * max(1,math.ceil(n / a)) ))", "\r\nb, m, a = map(int, input().split())\r\nif m % a == 0:\r\n x = m // a\r\nelse:\r\n x = m//a + 1\r\nif b%a == 0:\r\n y=b//a\r\nelse:\r\n y=b//a + 1\r\nprint(x * y)\r\n", "if __name__ == \"__main__\":\r\n n, m, a = list(map(int, input().split()))\r\n if n%a == 0:\r\n val1 = n // a\r\n else:\r\n val1 = n // a + 1\r\n\r\n if m%a == 0:\r\n val2 = m // a\r\n else:\r\n val2 = m // a + 1\r\n\r\n print(val1*val2)", "shape_info = input().split()\r\n\r\nn = int(shape_info[0])\r\nm = int(shape_info[1])\r\na = int(shape_info[2])\r\n\r\nfactor_1 = (n // a) if n % a == 0 else (n // a) + 1\r\nfactor_2 = (m // a) if m % a == 0 else (m // a) + 1\r\n\r\nprint(factor_1*factor_2)", "x, y, z = map(int, input().split())\r\nflag_x = (x + z - 1) // z\r\nflag_y = (y + z - 1) // z\r\ntotal = flag_x * flag_y\r\nprint(total)\r\n", "from math import ceil\r\nn,m,a=map(int,input().split())\r\ne=ceil(n/a)\r\nr=ceil(m/a)\r\nprint(int(e*r))", "from sys import stdin\r\nimport math\r\n\r\nn, m, a = stdin.readline().split()\r\nn, m, a = int(n), int(m), int(a)\r\n\r\nlength = math.ceil(n/a)\r\nwidth = math.ceil(m/a)\r\n\r\nprint(length * width)", "love,q,l=map(int,input().split()) \r\n \r\nif q%l==0: \r\n r1=q//l\r\nelse: \r\n r1=q//l+1 \r\n \r\nif love%l==0: \r\n r2=love//l \r\nelse: \r\n r2=love//l+1 \r\n \r\nprint(r1*r2)", "import math\n\nn, m, a = map(int, input().split())\nnf = math.ceil(n/a) * math.ceil(m/a)\nprint(nf)\n \t\t \t\t\t \t \t \t\t \t\t\t \t\t\t \t", "m,n,a=map(int,input().split())\r\nimport math\r\nM=math.ceil(m/a)\r\nN=math.ceil(n/a)\r\ncount=M*N\r\nprint(count)", "n,m,a = input().split(\" \")\nn = int(n)\nm = int(m)\na = int(a) \nif n%a == 0:\n x = int(n/a)\nelse:\n x = (int(n/a)+1)\nif m%a == 0:\n y = int(m/a)\nelse:\n y = (int(m/a)+1)\nk = x*y \nprint(k)\n\n", "def square(n, m, a):\r\n if m % a == 0:\r\n r1 = m // a\r\n else:\r\n r1 = m // a + 1\r\n if n % a == 0:\r\n r2 = n // a\r\n else:\r\n r2 = n // a + 1\r\n return r1 * r2\r\n\r\n\r\n\r\n\r\nn, m, a = map(int, input().split())\r\nprint(square(n, m, a))", "import math\r\nn,m,a=map(int,input().split())\r\nvalue=math.ceil(n/a)*math.ceil(m/a)\r\nprint(value)\r\n", "import math\n\ndef least_flagstones(b, m, y):\n return math.ceil(b/y) * math.ceil(m/y)\n\nb, m, y = map(int, input().split())\nprint(least_flagstones(b, m, y))\n\t\t \t\t \t \t \t\t \t \t\t \t \t\t \t\t\t\t\t\t", "m, n, a = [int(x) for x in input().split()]\r\n\r\nif m > a and n > a:\r\n x = 0\r\n if m % a == 0:\r\n x = m // a\r\n else:\r\n x = (m // a) + 1\r\n y = 0\r\n if n % a == 0:\r\n y = n // a\r\n else:\r\n y = (n // a) + 1\r\n res = x * y\r\n print(res)\r\nelif m <= a and n <= a:\r\n print(1)\r\nelif m > a >= n:\r\n if m % a == 0:\r\n x = m // a\r\n else:\r\n x = (m // a) + 1\r\n print(x)\r\nelif n > a >= m:\r\n if n % a == 0:\r\n y = n // a\r\n else:\r\n y = (n // a) + 1\r\n print(y)\r\n", "x,y,z=map(int,input().split())\r\nif y%z==0:\r\n n=y//z\r\nelse:\r\n n=y//z+1\r\nif x%z==0:\r\n m=x//z\r\nelse:\r\n m=x//z+1\r\nprint(n*m)\r\n ", "n,m,a=map(int,input().split())\nres=0\nfirst=0\nsecond=0\nif n%a==0:\n first=n//a\nelse:\n first=n//a+1\nif m%a==0:\n second=m//a\nelse:\n second=m//a+1\n\nprint(first*second)", "from math import ceil\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nglobal nDimensionCount\r\nglobal mDimensionCount\r\nif n < a < m:\r\n nDimensionCount = 1\r\n mDimensionCount = ceil(m / a)\r\nif m < a < n:\r\n mDimensionCount = 1\r\n nDimensionCount = ceil(n / a)\r\nelse:\r\n nDimensionCount = ceil(n / a)\r\n mDimensionCount = ceil(m / a)\r\nprint(nDimensionCount * mDimensionCount)\r\n", "import math\r\nn, m, a = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nh = math.ceil(n/a)\r\nw = math.ceil(m/a)\r\ntotal = h*w\r\nprint(total)", "from math import ceil\na,b,c =map(int, input().split())\n\nans = ceil(a/c)*ceil(b/c)\nprint(ans)", "# LUOGU_RID: 125158631\nimport math\r\nm,n,a=input().split()\r\nminsum=math.ceil(int(m)/int(a))*math.ceil(int(n)/int(a))\r\nprint(minsum)\r\n", "import sys\r\n\r\n\r\ndef find(a: list[int], q: int) -> bool:\r\n i = find_lower(a, q)\r\n return i >= 0 and a[i] == q\r\n\r\n\r\ndef find_lower(a: list[int], x: int) -> int:\r\n \"\"\"max i: a[i] <= x\"\"\"\r\n l = -1 # a[l] <= x\r\n r = len(a) # a[r] > x\r\n while r > l + 1:\r\n m = (l + r) // 2\r\n if a[m] <= x:\r\n l = m\r\n else:\r\n r = m\r\n\r\n return l\r\n\r\n\r\ndef find_upper(a: list[int], x: int) -> int:\r\n \"\"\"min i: a[i] >= x\"\"\"\r\n l = -1\r\n r = len(a)\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if a[m] >= x:\r\n r = m\r\n else:\r\n l = m\r\n\r\n return r\r\n\r\n\r\ndef print_matrix(graph: dict[list[int]]) -> None:\r\n for row in graph.values():\r\n sys.stdout.write(\" \".join(str(x) for x in row))\r\n sys.stdout.write(\"\\n\")\r\n\r\n\r\ndef print_answer(flag: bool) -> None:\r\n sys.stdout.write(\"YES\\n\") if flag else sys.stdout.write(\"NO\\n\")\r\n\r\n\r\ndef solve() -> bool:\r\n input = sys.stdin.readline\r\n n, m = map(int, input().split())\r\n graph = {}\r\n for i in range(1, n + 1):\r\n graph[i] = [0] * (n + 1)\r\n flag = True\r\n while m > 0 and flag:\r\n m -= 1\r\n u, v = map(int, input().split())\r\n if u == v or graph[u][v] > 0:\r\n flag = False\r\n graph[u][v] += 1\r\n graph[v][u] += 1\r\n\r\n return flag\r\n\r\n\r\ndef solve_int() -> int:\r\n import math\r\n n, m, a = map(int, input().split())\r\n return math.ceil(n / a) * math.ceil(m / a)\r\n\r\n\r\ndef main():\r\n input = sys.stdin.readline\r\n # t = int(input().strip())\r\n # while t > 0:\r\n # t -= 1\r\n # input().strip()\r\n # flag = solve()\r\n # print_answer(flag)\r\n answer = solve_int()\r\n sys.stdout.write(f\"{answer}\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import ceil\r\n\r\n\r\nstrIn = input().split()\r\nn = int(strIn[0])\r\nm = int(strIn[1])\r\na = int(strIn[2])\r\n\r\nprint(ceil(m/a) * ceil(n/a))", "import math\r\n\r\n\r\nl1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nm=l1[1]\r\na=l1[-1]\r\nif n%a==0:\r\n if m%a==0:\r\n print(int((n*m)/(a*a)))\r\n else :\r\n k=math.floor(m/a)+1\r\n print(int((n*k)/a))\r\nelse :\r\n if m%a==0:\r\n l=math.floor(n/a)+1\r\n print(int((l*m)/a))\r\n else :\r\n x=math.floor(n/a)+1\r\n y=math.floor(m/a)+1\r\n print(x*y)", "a,b,c=map(int,input().split())\r\nb=b+(c-1)\r\na=a+(c-1)\r\nprint((a//c)*(b//c))\r\n", "import math\nn1, m, a = map(int, input().split())\nnf = math.ceil(n1/a) * math.ceil(m/a)\nprint(nf)\n \t\t \t\t \t\t\t \t \t \t \t\t \t\t\t", "import math\n\ndef least_flagstones(d, c, i):\n return math.ceil(d/i) * math.ceil(c/i)\n\nd, c, i = map(int, input().split())\nprint(least_flagstones(d, c, i))\n \t \t \t\t\t \t\t\t \t \t \t\t", "k = input().split()\r\nn = int(k[0])\r\nm = int(k[1])\r\na = int(k[2])\r\nprint(((n + a - 1) // a) * ((m + a - 1) // a))\r\n", "list_1=[int(w) for w in input().split()]\r\nm,n,a=list_1[0],list_1[1],list_1[2] \r\nif a<=10**9:\r\n if m%a==0 and m>=1:\r\n y=m//a\r\n else:\r\n y=m//a+1\r\n if n%a==0 and n>=1:\r\n z=n//a\r\n else:\r\n z=n//a+1\r\n print(y*z)", "n, m, a=map(int, input().split())\r\nk1=0\r\nk2=0\r\nif n%a==0:\r\n k1=n//a\r\nelse:\r\n k1=n//a+1\r\nif m%a==0:\r\n k2=m//a\r\nelse:\r\n k2=m//a+1\r\nprint(k1*k2)", "from re import A\r\n\r\n\r\nn,m,a = map(int,input().split())\r\nx = n // a\r\nif (n%a != 0):\r\n x+=1\r\ny = m // a\r\nif (m%a != 0):\r\n y+=1\r\nprint(x*y)", "#Coder_1_neel\r\nl,w,a =map(int,input().split())\r\nif l%a!=0 and w%a!=0:\r\n x=int(l/a)+1\r\n y=int(w/a)+1\r\nelif l%a!=0 and w%a==0:\r\n x=int(l/a)+1\r\n y=int(w/a)\r\nelif l%a==0 and w%a!=0:\r\n x=int(l/a)\r\n y=int(w/a)+1 \r\nelse:\r\n x=int(l/a)\r\n y=int(w/a)\r\n\r\nprint(x*y) ", "l = []\r\nx = input()\r\nl.append(x.split(\" \"))\r\n\r\nh = int(l[0][0])\r\nw = int(l[0][1])\r\na = int(l[0][2])\r\n\r\nprint(((h + a - 1) // a) * ((w + a -1) // a))\r\n", "m,n,p=map(int,input().split())\r\nif n%p==0:\r\n a=n//p\r\nelse:\r\n a=n//p+1\r\n\r\nif m%p==0:\r\n b=m//p\r\nelse:\r\n b=m//p+1\r\nprint(a*b)", "import math\r\nm, n, a = map(int, input().split())\r\narea = math.ceil(m/a) * math.ceil(n/a)\r\nprint(area)", "m,n,a = map(int,input().split())\r\n\r\nif m%a == 0 :\r\n x = m//a \r\nelse:\r\n x= m//a + 1 \r\n \r\nif n%a == 0 :\r\n y = n//a \r\nelse:\r\n y= n//a + 1 \r\n \r\nprint (x*y)", "n,m,a = input().split()\ncount1 = int(n) // int(a) \ncount2 = int(m) // int(a) \nif(int(n) % int(a) != 0):\n count1 += 1 \nif(int(m) % int(a) != 0):\n count2 += 1 \nprint(count1 * count2)\n\t \t \t\t\t\t \t\t\t \t\t \t \t\t\t\t\t \t", "# Read the input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed to cover the width and length of the Square\r\nnum_width = n // a if n % a == 0 else n // a + 1\r\nnum_length = m // a if m % a == 0 else m // a + 1\r\n\r\n# Print the result\r\nprint(num_width * num_length)\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\ncount_na = math.ceil(n/a)\r\ncount_ma = math.ceil(m/a)\r\n\r\nprint(count_na*count_ma)", "from math import ceil\n\n\nl = input()\nl = l.split()\nn = int(l[0])\nm = int(l[1])\na = int(l[2])\nans = ceil(n/a)*ceil(m/a)\nprint(ans)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "n,m,a = [int(i) for i in input().split()]\r\nif m%a==0:\r\n x = m//a\r\nelse:\r\n x = m//a +1\r\nif n%a==0:\r\n y = n//a\r\nelse:\r\n y = n//a +1\r\nprint(x*y)\r\nexit(0)", "# LUOGU_RID: 98551808\nn, m, a = map(int, input().split())\ni = n // a\nj = m // a\nif n % a != 0:\n i += 1\nif m % a != 0:\n j += 1\nprint(i * j)", "import math\r\na,b,c=map(int,input().split())\r\nprint(math.ceil(a/c)*math.ceil(b/c))", "import math\r\nm, n, a = map(int, input(\" \").split())\r\nrec=m*n\r\ntil=a*a\r\nprint( math.ceil(n/a)*math.ceil(m/a))\r\n\r\n", "import fileinput\r\nTEST_MODE = False\r\nif TEST_MODE:\r\n ITERABLE_INPUT = fileinput.input()\r\n\r\ndef entrada():\r\n if TEST_MODE:\r\n line = ITERABLE_INPUT.readline()\r\n return line.rstrip()\r\n else:\r\n return input()\r\n\r\nlinea = entrada()\r\nn, m, a = [int(i) for i in linea.split()]\r\nrows = n//a\r\nif n % a:\r\n rows += 1\r\ncolumns = m//a\r\nif m % a:\r\n columns += 1\r\nprint(rows * columns)", "import math\r\n\r\nn, m, a = map(int,input(\"\").split())\r\n# Cálculo do número de lajes necessárias\r\nlajesHorizontal = math.ceil(n / a)\r\nlajesVertical = math.ceil(m / a)\r\n# Cálculo do total de lajes necessárias\r\ntotalLajes = lajesHorizontal * lajesVertical\r\nprint(totalLajes)", "import math\r\ndef is_positive(x):\r\n return x > 0\r\nn, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\narea = n*m\r\nflagstone = a*a\r\nxn = 1\r\nxm = 1\r\nif n >= a:\r\n if n%a == 0:\r\n xn = int(math.floor(n/a))\r\n else:\r\n xn = int(math.floor(n/a)) + 1\r\nif m >= a:\r\n if m%a == 0:\r\n xm = int(math.floor(m/a))\r\n else:\r\n xm = int(math.floor(m/a)) + 1\r\nprint(xn*xm)", "import math\r\nn,m,a=[int(x) for x in input().split()]\r\nx=math.ceil(n/a)\r\ny=math.ceil(m/a)\r\nprint(x*y)", "n, m, a = map(int, input().split()) \r\nlength = (n + a - 1) // a\r\nwidth = (m + a - 1) // a\r\ntotal = length * width\r\nprint(total)", "n = list(input().split())\r\n\r\nnl = []\r\nfor i in n:\r\n nl.append(int(i))\r\n\r\n\r\nif nl[0]%nl[2] == 0:\r\n x1 = nl[0]//nl[2]\r\nelse:\r\n x1 = nl[0]//nl[2] + 1\r\n \r\nif nl[1]%nl[2] == 0:\r\n x2 = nl[1]//nl[2]\r\nelse:\r\n x2 = nl[1]//nl[2] + 1\r\n \r\nprint(x1*x2)", "n, m, a = map(int, input().split())\r\n\r\nnum_flagstone = (((n+a-1)//a)*((m+a-1)//a))\r\n\r\nprint(num_flagstone)", "a,b,c=list(map(int,input().split(\" \")))\r\nprint(((a+c-1)//c)*((b+c-1)//c))", "import math\r\na,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nn=math.ceil(a/c)*math.ceil(b/c)\r\nprint(n)\r\n", "n, m, a = str(input()).split(\" \")\nn, m, a = int(n), int(m), int(a)\n\nimport math\nprint(int(math.ceil(n/a) * math.ceil(m/a)))", "n, m, a = map(int, input().split())\nsideN, sideM = None, None\nif n % a: sideN = int(n / a) + 1\nelse: sideN = int(n / a)\nif m % a: sideM = int(m / a) + 1\nelse: sideM = int(m / a)\nprint(sideN * sideM)\n\t \t\t\t\t\t\t \t \t \t \t\t \t \t\t \t\t\t", "n,m,a=map(int,input().split())\nif m%a==0:\n val1=m//a\nelse:\n val1=m//a+1\nif n%a==0:\n val2=n//a\nelse:\n val2=n//a+1\nprint(val1*val2)\n\n \t \t \t\t\t \t\t \t \t\t\t\t\t\t\t\t\t\t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\nn,m,a=map(int,input().split())\r\nc=n//a\r\nif n%a!=0:\r\n c+=1\r\nd=m//a\r\nif m%a!=0:\r\n d+=1\r\nprint(c*d)", "n,m,a=map(int,input().split()) \r\n \r\nif m%a==0: \r\n r1=m//a \r\nelse: \r\n r1=m//a+1 \r\n \r\nif n%a==0: \r\n r2=n//a \r\nelse: \r\n r2=n//a+1 \r\n \r\nprint(r1*r2) ", "[n,m,a]=map(int, input().split(\" \"))\r\ndef number_of_tiles(n,m,a):\r\n if n%a==0:\r\n n_a=n//a\r\n else:\r\n n_a=n//a+1\r\n if m%a==0:\r\n m_a=m//a\r\n else:\r\n m_a=m//a+1\r\n return m_a*n_a\r\nprint(number_of_tiles(n,m,a))\r\n", "arr = input().split()\r\nx, y, z = int(arr[0]), int(arr[1]), int(arr[2])\r\nprint(((x + z - 1) // z) * ((y + z - 1) // z))", "# -*- coding: utf-8 -*-\n\"\"\"theatre square\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/16la4MLRva1lC_hKDCmJ_Ne6fNAGs4q1N\n\"\"\"\n\nimport math\ns=input()\nx=s.split()\nh = math.ceil(int(x[0])/int(x[2]))\nw = math.ceil(int(x[1])/int(x[2]))\nprint(w*h)\n\n\n\n2/4\n\nmath.floor(2/4)", "import math\nx,y,z=map(int,input().split())\nprint(math.ceil(x/z)*math.ceil(y/z))\n#5432145609\n\t \t\t\t \t \t \t\t\t\t \t \t\t\t\t \t\t\t", "import math\r\n\r\ns = input().split(\" \")\r\nprint(math.ceil(int(s[1]) / int(s[2])) *math.ceil(int(s[0]) / int(s[2])))", "import math\nn,m,a=map(int,input().split())\nprint(math.ceil(m/a)*math.ceil(n/a))\n\t \t\t \t\t \t\t\t \t\t \t \t \t \t \t\t", "from math import ceil\r\na,b,c = map(int,input().split())\r\nprint(ceil(a/c)*ceil((b)/c))", "# LUOGU_RID: 98937382\nfrom math import ceil\nn,m,a=map(int,input().split())\nprint(ceil(n/a)*ceil(m/a))", "from math import ceil\r\nn, m, a = map(int, input().split())\r\nkn = ceil(n / a)\r\nkm = ceil(m / a)\r\nprint(kn * km)", "n,m,a= map(int, input().split())\r\nq = (n // -a * (m // -a))\r\nprint(q)", "value = input()\r\nn, m, a = value.split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nif a > n:\r\n n = 1\r\nelse:\r\n if n % a > 0:\r\n n = n // a + 1\r\n else:\r\n n = n // a\r\nif a > m:\r\n m = 1\r\nelse:\r\n if m % a > 0:\r\n m = m // a + 1\r\n else:\r\n m = m // a\r\nprint(n * m)", "import math\r\nn,m,a = map(int,input().split())\r\nnum_rows = math.ceil(n/a)\r\nnum_cols = math.ceil(m/a)\r\nnum_flagstones = num_rows * num_cols\r\nprint(num_flagstones)", "from math import ceil\r\nw,e,r = map(int,input().split())\r\nP= ceil(w/r)\r\nO= ceil(e/r)\r\nprint(int(P*O))", "import math\r\nn,m,a=[int(x) for x in input().split()]\r\nl=math.ceil(n/a)\r\nw=math.ceil(m/a)\r\nprint(l*w)", "x, y, a = map(int, input().split())\r\nfs_needed = (x // a) * (y // a)\r\nif x % a != 0:\r\n fs_needed += y // a\r\nif y % a != 0:\r\n fs_needed += x // a\r\nif x % a != 0 and y % a != 0:\r\n fs_needed += 1\r\nprint(fs_needed)\r\n", "import math\r\nn,m,a=map(int,input().split())\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "import math\r\n\r\nt = 1\r\nfor _ in range(t):\r\n n, m, a = [int(i) for i in input().split()]\r\n req = int(math.ceil(n / a))\r\n m -= a\r\n ans = req\r\n if m > 0:\r\n ans += int(math.ceil(m / a)) * req\r\n print(ans)\r\n", "n,m,a=map(int,input().split())\r\nif n % a ==0:\r\n val1=n//a\r\nelse:\r\n val1=n//a+1\r\nif m% a ==0:\r\n val2=m//a\r\nelse:\r\n val2=m//a+1\r\nprint(val1*val2)", "import math\r\n\r\nx, y, a = map(int, input().split())\r\nm = math.ceil(x/a)\r\nn = math.ceil(y/a)\r\nprint(n*m)", "import math\r\n\r\nnuuu, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required for the width and height\r\nnum_w = math.ceil(nuuu / a)\r\nnum_h = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones required\r\nnum_flagstones = num_w * num_h\r\n\r\nprint(num_flagstones)", "n, m, a = map(int, input().split(' '))\r\n\r\nx = n + (a - n%a) if n % a != 0 else n\r\ny = m + (a - m%a) if m % a != 0 else m\r\n\r\nprint((x // a) * (y // a))\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nn1 = math.ceil(n / a)\r\nm1 = math.ceil(m / a)\r\nprint(n1 * m1)\r\n", "a = list(map(int, input().split()))\r\nprint((a[0]//(-a[2]))*(a[1]//(-a[2])))", "ch=input()\r\nL=ch.split(' ')\r\nn=int(L[0])\r\nm=int(L[1])\r\na=int(L[2])\r\nif m%a==0:\r\n x=m//a\r\nelse:\r\n x=m//a+1\r\nif n%a==0:\r\n y=n//a\r\nelse:\r\n y=n//a+1\r\nprint(x*y)\r\n ", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nif n%a==0 and m%a==0:\r\n print(((n-(n%a))*(m-(m%a))//a**2))\r\nelif n%a==0 and m%a!=0:\r\n print(((n-(n%a))*(m-(m%a))//a**2)+(n//a))\r\nelif m%a==0 and n%a!=0:\r\n print(((n-(n%a))*(m-(m%a))//a**2)+(m//a))\r\nelse:\r\n print(((n-(n%a))*(m-(m%a))//a**2)+(ceil(n/a)+(m//a)))\r\n", "import math\r\nn,m,a=map(int,str(input()).split())\r\nx,y=math.ceil(n/a),math.ceil(m/a)\r\nprint(x*y)", "a,b,c = map(int, input().split())\ndef ceil(a,b):\n return -(a//-b)\nprint(ceil(a,c)*ceil(b,c))\n \t\t\t \t \t\t \t\t\t \t \t \t\t \t \t\t", "import math\r\nn,m,a=list(map(float,input().split()))\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "from math import ceil\r\nentry = input()\r\nn, m, a = entry.split()\r\nn, m, a = int(n), int(m), int(a)\r\nprint(ceil(n/a) * ceil(m/a))\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nnum_flagstones_x = math.ceil(n/a)\r\nnum_flagstones_y = math.ceil(m/a)\r\nnum_flagstones = num_flagstones_x * num_flagstones_y\r\nprint(num_flagstones)\r\n", "n,m,a=map(int, input().split())\r\nflag_need = ((n+a-1)//a)*((m+a-1)//a)\r\nprint(flag_need)", "import math\n\ndef least_flagstones(n, m, a):\n return math.ceil(n/a) * math.ceil(m/a)\n\nn, m, a = map(int, input().split())\nprint(least_flagstones(n, m, a))\n\t \t \t \t\t \t \t \t \t \t\t", "import math\n\n\ndef calculate_flagstones(n, m, a):\n num_flagstones_n = math.ceil(n / a)\n num_flagstones_m = math.ceil(m / a)\n\n total_flagstones = num_flagstones_n * num_flagstones_m\n\n return total_flagstones\n\n\nn, m, a = map(int, input().split())\n\nresult = calculate_flagstones(n, m, a)\nprint(result)\n\t \t\t \t\t\t\t \t\t \t \t \t \t", "import math as mt\r\nn,m,a=map(int,input().split())\r\nprint(mt.ceil(n/a)*mt.ceil(m/a))", "import math \r\nn,m,a = map(int,input().split())\r\nflag = math.ceil(m/a) * math.ceil(n/a)\r\nprint(flag)", "from math import *\r\nn,m,a=map(int ,input().split())\r\np=ceil(n/a)*ceil(m/a)\r\nprint(p)", "n,m,a = map(int,input().split())\r\n\r\nif n%a == 0 :\r\n x=n//a\r\nelse :\r\n x=n//a+1\r\n\r\nif m%a == 0 :\r\n y=m//a\r\nelse :\r\n y=m//a+1\r\n\r\nprint(x*y)\r\n", "str = input()\r\na, b, c = str.split(\" \")\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nx = int(a / c)\r\ny = int(b / c)\r\np = a % c\r\nq = b % c\r\nif p != 0:\r\n x = x + 1\r\nif q != 0:\r\n y = y + 1\r\nprint(x * y)", "import math\n\nm, n, a = map(int, input().split())\nprint(math.ceil(m / a) * math.ceil(n / a))", "import math\r\n\r\nn,m, a = map(int , input().split()) \r\n\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a)\r\n\r\n\r\n \r\nprint(x*y)\r\n ", "# Lê os valores de n, m e a da entrada\r\nn, m, a = map(int, input().split())\r\n\r\n# Calcula o número de lajotas de largura e altura necessárias\r\nnum_lajotas_largura = (n + a - 1) // a # arredonda para cima\r\nnum_lajotas_altura = (m + a - 1) // a # arredonda para cima\r\n\r\n# Calcula o número total de lajotas necessárias\r\nnum_lajotas_total = num_lajotas_largura * num_lajotas_altura\r\n\r\n# Imprime o resultado\r\nprint(num_lajotas_total)\r\n", "from math import ceil\r\nm, n, a=[int(i) for i in input().split()]\r\nx=ceil(m/a)\r\ny=ceil(n/a)\r\nprint(x * y)", "from math import ceil\r\na,b,c=map(int,input().split())\r\nx=ceil(a/c)\r\ny=ceil(b/c)\r\nprint(int(x*y))", "n, m, a = map(int, input().split())\n\nif n%a != 0:\n v1 = n//a + 1\nelse:\n v1 = n//a\n\nif m%a != 0:\n v2 = m//a + 1\nelse:\n v2 = m//a\n\nprint(v1*v2)", "import math\r\nlength,width,ribSquarelength=map(int,input().split())\r\nhorizantel=math.ceil(width/ribSquarelength)\r\nvirtical= math.ceil(length/ribSquarelength)\r\nprint(horizantel*virtical)\r\n\r\n", "i = input()\r\nn,m,a = i.split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nif 1 <= n and n <= 1000000000 and 1 <= m and m <= 1000000000 and 1 <= a and a <= 1000000000:\r\n number1 = n//a\r\n if n%a>0:\r\n number1+=1\r\n number2 = m//a\r\n if m%a>0:\r\n number2+=1\r\n \r\nprint(number1*number2)", "from math import ceil\np = input(\"\")\nn, m , a = p.split(\" \")\nn = int(n)\nm = int(m)\na = int(a)\n\nprint(ceil(n / a) * ceil(m / a))", "import math\r\nlist = input().split(\" \",-1)\r\nn = list[0]\r\nm = list[1]\r\na = list[-1]\r\n\r\nn_number = math.ceil(int(n) / int(a))\r\nm_number = math.ceil(int(m) / int(a))\r\n\r\noutput = m_number * n_number\r\nprint(output)\r\n", "import math\r\nn,m,a = list(map(int,input().split(' '))) \r\n \r\nprint(math.ceil(max(n/a,m/a))*math.ceil(min(n/a,m/a)))", "list=input().split(\" \")\r\nM=int(list[0])\r\nm=int(list[1])\r\na=int(list[2])\r\ncount=0\r\nif M%a==0:\r\n num1=M//a\r\nelse:\r\n num1=M//a+1\r\nif m%a==0:\r\n num2=m//a\r\nelse:\r\n num2=m//a+1\r\nprint(num1*num2)", "n,m,a=map(int,input().split())\r\npl=(n-1)//a+1\r\nps=(m-1)//a+1\r\nprint(pl*ps)", "import math\r\np, q, a = map(int, input().split())\r\nhorizontal = math.ceil(p / a)\r\nvertical = math.ceil(q / a)\r\ntotal = horizontal * vertical\r\nprint(total)", "# take first input (number of problems)\r\n# for loop - take each line's inputs (3 each line)\r\nx, y, z = input().split()\r\nx = int(x)\r\ny = int(y)\r\nz = int(z)\r\n\r\nhorizontal = 0\r\nvertical = 0\r\n\r\n\r\nif x % z == 0:\r\n horizontal = x // z\r\nelse:\r\n horizontal = x // z + 1\r\n\r\nif y % z == 0:\r\n vertical = y // z\r\nelse:\r\n vertical = y // z + 1\r\n\r\nprint(vertical * horizontal)", "n, m, a = map(int, input().split())\r\nx = (n//a)\r\ny = (m//a)\r\nif n%a > 0: x += 1\r\nif m%a > 0: y += 1\r\nprint(x*y)", "import math\r\n\r\ndef min_flagstones(n, m, a):\r\n flagstones_horizontal = math.ceil(n / a)\r\n flagstones_vertical = math.ceil(m / a)\r\n total_flagstones = flagstones_horizontal * flagstones_vertical\r\n \r\n return total_flagstones\r\nn, m, a = map(int, input().split()) \r\nresult = min_flagstones(n, m, a)\r\nprint(result)\r\n", "# LUOGU_RID: 100725490\nimport math\na = input().split()\n\nprint(math.ceil(int(a[0])/int(a[2])) * math.ceil(int(a[1])/int(a[2])))\n", "n, m, a = input().split()\r\ncontadorDeN = 0\r\ncontadorDeM = 0\r\nareaPavimentada = int(n)*int(m)\r\nbaldosas = int(a)*int(a)\r\ndivision = int(areaPavimentada)//int(baldosas)\r\nif baldosas > areaPavimentada:\r\n print(\"1\")\r\nelse:\r\n if division == 0:\r\n print (division)\r\n else:\r\n contadorDeN = int(n) // int(a) + (int(n)%int(a) != 0)\r\n contadorDeM = (int(m))//int(a) + ((int(m))%int(a) != 0)\r\n \r\n print (contadorDeM * contadorDeN)", "n, m, a = map(int, input().split())\r\nb=(n+a-1)//a\r\nc=(m+a-1)//a\r\nprint(c*b) ", "import math\r\na, b, c = map(int, input(). split())\r\nz = (math.ceil(a / c))\r\nx = (math.ceil(b / c))\r\nprint(z * x)", "from math import ceil\r\n\r\ndef checker(n, m, s):\r\n length = ceil(n/s) \r\n breadth = ceil(m/s)\r\n return length * breadth\r\n\r\nif __name__ == '__main__':\r\n n, m, s = map(int, input().split())\r\n ans = checker(n, m, s)\r\n print(ans)\r\n", "n,m,a = map(int,input().split())\r\nh = n // a\r\nif n % a != 0:\r\n h = h + 1\r\nb = m // a\r\nif m % a != 0:\r\n b = b + 1\r\nprint(h * b)", "n,m,a=map(int,input().split())\naaa=((m+a-1)//a)*((n+a-1)//a)\nprint(aaa)\n\n \t\t \t\t\t \t\t \t \t \t\t\t\t\t\t \t", "n, m, a = map(int, input().split())\r\n \r\nh = n//a\r\nif n%a != 0: h+=1\r\n \r\nw = m//a\r\nif m%a != 0: w+=1\r\n \r\nprint(h*w)", "n,m,a = map(int,input().split())\r\nimport math\r\n#ans = math.ceil(m/a)*math.ceil(n/a)\r\nans = ((m+a-1)//a)*((n+a-1)//a)\r\nprint(ans)", "import math\r\nn,m,a = map(int,input().split())\r\nb = math.ceil(n/a) * math.ceil(m/a)\r\nprint(b)", "import math\r\na, b, c = map(int,input().split())\r\nx = math.ceil(a / c)\r\ny = math.ceil(b / c)\r\nprint(x*y)", "import math\r\nn,m,a=map(int,input().split())\r\nx=math.ceil(n/a)\r\ny=math.ceil(m/a)\r\nif n>=a and m>=a:\r\n print(x*y)\r\nelif n<a and m<a:\r\n print(1)\r\nelif n<a and m>=a:\r\n print(y)\r\nelif n>=a and m<a:\r\n print(x)", "n,m,a = map(int,input().split())\r\n\r\nif m%a==0: \r\n x=m//a \r\nelse: \r\n x=m//a+1 \r\n \r\nif n%a==0: \r\n y=n//a \r\nelse: \r\n y=n//a+1 \r\n \r\nprint(x*y) ", "n, m, a = map(int, input().split())\r\nres = 0\r\nif n % a != 0 and m % a != 0:\r\n res = (((n // a) + 1) * ((m // a) + 1))\r\nelif n % a != 0:\r\n res = (((n // a) + 1) * ((m // a)))\r\nelif m % a != 0:\r\n res = (((n // a)) * ((m // a) + 1))\r\nelse:\r\n res = ((n//a)*(m//a))\r\nprint(res)", "import math\r\n\r\ndef theatreSquare(m, n, a):\r\n return math.ceil(m/a)*math.ceil(n/a)\r\n\r\nif __name__ == \"__main__\":\r\n m, n, a = [int(n) for n in input().split(\" \")]\r\n print(theatreSquare(m, n, a))", "import math\r\nn, m, a = map(int,input().split(' '))\r\nk = math.ceil(n/a)\r\nl = math.ceil(m/a)\r\nprint (k*l)", "x,y,z=map(int,input().split())\r\ns=(-x)//z\r\nl=(-y)//z\r\nprint(s*l)", "j,i,n=map(int,input().split())\r\nprint(-j//n*(-i//n))", "import math as x\r\nm,n,a=map(int,input().split())\r\nprint(x.ceil(m/a)*x.ceil(n/a))", "n, m, a = map(int, input().split())\r\nnSize = (n + a - 1) // a\r\nmSize = (m + a - 1) // a\r\ntotal = nSize * mSize \r\nprint(total)", "import math\r\nm,n,a=map(int,input().split())\r\nx=math.ceil(m/a)\r\ny=math.ceil(n/a)\r\nprint(x*y)", "value1, value2, value3 = map(int, input().split())\r\nheight = -(-value1//value3)\r\nbase = -(-value2//value3)\r\n\r\nprint(base*height)", "\nn, m, a = map(int, input().split())\n\nflagstones_length = (n + a - 1) // a\nflagstones_width = (m + a - 1) // a\n\n\ntotal_flagstones = flagstones_length * flagstones_width\n\n\nprint(total_flagstones)\n\n \t \t\t \t\t\t \t \t\t\t\t\t\t\t\t \t", "values=list(map(int,input().split()))\r\na=0\r\nif (values[0]%values[2]==0 and values[1]%values[2]==0):\r\n a=values[0]//values[2]\r\n b=values[1]//values[2]\r\n print(a*b)\r\nelif(values[0]%values[2]==0 or values[1]%values[2]==0):\r\n if(values[0]%values[2]==0):\r\n a=values[0]//values[2]\r\n b=values[1]//values[2]+1\r\n print(a*b)\r\n elif(values[1]%values[2]==0):\r\n a=values[0]//values[2]+1\r\n b=values[1]//values[2]\r\n print(a*b)\r\nelse:\r\n a=values[0]//values[2]+1\r\n b=values[1]//values[2]+1\r\n print(a*b)\r\n", "import math\r\nn, m, a = input().split()\r\nf = math.ceil(int(n)/int(a)) * math.ceil(int(m)/int(a))\r\nprint(f)", "import math\r\nn, m, a=list(map(int,input().split( )))\r\nnum = math.ceil(int(n)/int(a)) * math.ceil(int(m)/int(a))\r\nprint(num)", "\r\nimport math\r\n\r\ndef a():\r\n a, b, c = map(int, input().split())\r\n a = math.ceil(a/c)\r\n b = math.ceil(b/c)\r\n return int(a*b)\r\n\r\n\r\nif __name__ == '__main__':\r\n # t = int(input())\r\n # for i in range(t):\r\n # print(a())\r\n print(a())", "from math import ceil as c\r\n\r\nn, m, a = map(int, input().split())\r\nanswer = c(m/a) * c(n/a)\r\nprint(answer)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the length and width of the square\r\nnum_flags_length = math.ceil(n / a)\r\nnum_flags_width = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flags = num_flags_length * num_flags_width\r\n\r\nprint(total_flags)\r\n", "m,n,a=map(int,input().split())\r\nx=m//a\r\ny=n//a\r\nif m%a!=0:\r\n x=x+1\r\nif n%a!=0:\r\n y=y+1\r\nprint(x*y)\r\n", "# LUOGU_RID: 112870062\nn, m, a = map(int, input().split())\nans = ((m + a - 1) // a) * ((n + a - 1) // a)\nprint(ans)", "x,y,z=input().split()\r\nn=int(x)\r\nm=int(y)\r\na=int(z)\r\np=0\r\nq=0\r\nif n%a==0 and m%a==0:\r\n p=n//a\r\n q=m//a\r\nelif n%a==0 and m%a!=0:\r\n p=n//a\r\n q=(m//a)+1\r\nelif n%a!=0 and m%a==0:\r\n p=(n//a)+1\r\n q=m//a\r\nelse:\r\n p=(n//a)+1\r\n q=(m//a)+1\r\nprint(p*q)\r\n\r\n\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nif not (1 <= n <= 10**9) or not (1 <= m <= 10**9) or not (1 <= a <= 10**9):\r\n raise ValueError(\"Invalid input\")\r\n\r\nnum_flagstones = math.ceil(n / a) * math.ceil(m / a)\r\n\r\nprint(num_flagstones)\r\n", "n, m, a = map(int,input().split())\r\nimport math \r\nprint((math.ceil(n / a)) * (math.ceil(m / a)))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[47]:\n\n\n#1A\nnumbers = input().split()\nsquare = int(numbers[2])\nfirst = int(numbers[0])\nsecond = int(numbers[1])\n\nif square >= first:\n first = 1\n\nelse :\n if first%square == 0:\n first = first//square\n \n else:\n first = first//square + 1\n \n\nif square >= second :\n second = 1\n \nelse :\n if second%square ==0 :\n second = second//square\n \n else:\n second = second//square + 1\n \nprint(first*second)\n\n", "import sys\r\nx = input().split()\r\na = int(x[2])\r\nb = int(x[0])\r\nc = int(x[1])\r\nd = 0\r\ne = 0\r\nif a == 1 and b >= 10000000 and c >= 10000000:\r\n print(b * c)\r\n sys.exit()\r\nwhile b > d:\r\n d += a\r\nwhile c > e:\r\n e += a\r\nprint(int((d * e) / (a ** 2)))", "def main():\r\n o=1\r\n n,m,a=map(int,input().split())\r\n if n>a:\r\n o*=((n+a-1)//a)\r\n if m>a:\r\n o*=((m+a-1)//a)\r\n print(o)\r\nmain()", "arr = input()\r\narr = arr.split(' ')\r\na = int(arr[2])\r\nm = 1\r\nfor i in range(2):\r\n x = int(arr[i])\r\n if x%a == 0:\r\n m *= x//a\r\n else:\r\n m *= x//a+1\r\nprint(m)", "m, n, a = (int(i) for i in input().split())\r\ns1 = n // a\r\ns2 = m // a\r\nif m <= a or n <= a:\r\n s = max(m, n) // a\r\n if max(m, n) % a != 0:\r\n s +=1\r\n print(s)\r\nelse:\r\n if n % a != 0:\r\n s1 += 1\r\n if m % a != 0:\r\n s2 += 1\r\n print(s1 * s2)", "from math import ceil\n\n\nn, m, a = map(int, input().split(\" \"))\n\nwidth = ceil(n/a)\n\nheight = ceil(m/a)\n\nprint(width * height)\n", "n,m,a=input().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\ndef cal(x):\r\n if x%a==0:\r\n return x/a\r\n else:\r\n return x//a+1\r\n\r\n\r\nprint(int(cal(m)*cal(n)))\r\n", "import math\r\nn , m, a = map(int , input().split())\r\nneededflags = math.ceil(n/a) * math.ceil(m/a)\r\nprint(neededflags)\r\n", "import math\n\ndef least_flagstones(n, m, a):\n x = math.ceil(n / a)\n y = math.ceil(m / a)\n\n # Calculate the total number of flagstones\n return x * y\n\n# Input the values for n, m, and a\nn, m, a = map(int, input().split())\n\n# Call the function and print the result\nresult = least_flagstones(n, m, a)\nprint(result)\n \t \t \t \t \t \t \t\t \t \t \t", "from math import ceil as ceil\r\nn,m,a = map(int, input().split())\r\nanswer = ceil(m/a) * ceil(n/a)\r\nprint(answer)\r\n", "n, m, a = map(int, input().split())\r\nl=n//a\r\nw=m//a\r\nif n%a!=0:\r\n l+=1\r\nif m%a!=0:\r\n w+=1\r\nprint(l*w)\r\n", "n, m, a = map(int, input().split())\r\n\r\nwidth_flagstones = n // a if n % a == 0 else n // a + 1\r\nlength_flagstones = m // a if m % a == 0 else m // a + 1\r\n\r\ntotal_flagstones = width_flagstones * length_flagstones\r\n\r\nprint(total_flagstones)\r\n", "from math import*\r\nnum=input()\r\nl=num.split()\r\nlo=int(l[0])/int(l[2])\r\nla=int(l[1])/int(l[2])\r\noutput=ceil(lo)*ceil(la)\r\nprint(output)", "a,b,c=map(int,input().split())\r\ncount=0\r\nif c==1:\r\n count=a*b\r\nelse:\r\n if a%c==0 and b%c==0:\r\n count=(max(a,b)//c)*(min(a,b)//c)\r\n if a%c==0 and b%c!=0:\r\n count=(a//c)*((b//c)+1)\r\n\r\n if b%c==0 and a%c!=0:\r\n count=(b//c)*((a//c)+1)\r\n if a%c!=0 and b%c!=0:\r\n count=((a//c)+1)*((b//c)+1)\r\nprint(count)", "import math\r\nm, n, a = [int(x) for x in input().split(' ')]\r\nprint(math.ceil(m / a) * math.ceil(n / a))", "import math\r\n\r\nl = list(map(int,input().split()))\r\ncount = math.ceil(l[0]/l[2]) * math.ceil(l[1]/l[2])\r\nprint(count)", "figure =input()\r\nlist = figure.split()\r\nn = int(list[0])\r\nm = int(list[1])\r\na = int(list[2])\r\nimport math\r\nnum = math.ceil(n/a)*math.ceil(m/a)\r\nprint(num)", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nb=ceil(n/a)\r\nc=ceil(m/a)\r\nprint(int(b*c))", "import math\r\n\r\ndef calculate_flagstones(n, m, a):\r\n b = math.ceil(n / a)\r\n l = math.ceil(m / a)\r\n total_flagstones = b*l\r\n return total_flagstones\r\n\r\nn,m,a=map(int,input().split())\r\nresult = calculate_flagstones(n, m, a)\r\nprint(result)\r\n", "# 2212051 Sacheth Koushik\r\n# from collections import Counter\r\n# from collections import OrderedDict\r\n# from decimal import Decimal\r\nimport math\r\n# from heapq import *\r\n# import bisect\r\nimport sys\r\nimport os\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\n\r\ndef strin(): return sys.stdin.readline().strip()\r\ndef arrin(): return list(map(int, sys.stdin.readline().split()))\r\ndef intin(): return int(sys.stdin.readline())\r\n\r\n#########################START######################\r\ndef solve():\r\n n,m,a = arrin()\r\n ans = math.ceil(n/a) * math.ceil(m/a)\r\n print(ans)\r\n\r\n\r\n# t = int(sys.stdin.readline())\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n\r\n\r\nsys.stdout.close()\r\nsys.stdin.close()", "n,m,a = map(int,input().split())\r\nk = (n+a-1)//a\r\nl = (m+a-1)//a\r\nprint(k*l)", "import math\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\n# Divide the length and width of the square by the size of each flagstone\n# Take the ceiling of the results to ensure that the entire square is covered\nflagstones_needed = math.ceil(n / a) * math.ceil(m / a)\nprint(flagstones_needed)\n \t \t\t\t \t\t \t\t \t \t \t \t", "import math\r\n\r\narr = [int(x) for x in input().split()]\r\nflagstones=arr[-1]\r\nw=arr[0]\r\nh=arr[1]\r\nprint(math.ceil(w/flagstones)*math.ceil(h/flagstones))", "import math\r\nn,m,a = map(int, input().split())\r\nx=(math.ceil(n/a))\r\ny=(math.ceil(m/a))\r\nprint(math.ceil(x*y))\r\n", "n,m,a=input().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nif n%a==0:\r\n top=int(n/a)\r\nelse:\r\n top=int(n/a)+1\r\nif m%a==0:\r\n bottom=int(m/a)\r\nelse:\r\n bottom=int(m/a)+1\r\nprint(top*bottom)", "import math\r\nx=input(\"\").split()\r\nwhile int(x[0]) <1 or int(x[1]) <1 or int(x[2]) < 1:\r\n x=input(\"\").split()\r\nz=int(int(x[0])/int(x[2]))\r\nif int(x[0]) % int(x[2]) > 0 :\r\n z += 1\r\n z=math.floor(z)\r\ny=float(int(x[1])/int(x[2]))\r\nif int(x[1]) % int(x[2])> 0 :\r\n y+=1\r\n y=math.floor(y)\r\nsum=int(z*y)\r\nprint(sum)", "n, m , a = map(int, input().split())\r\n\r\nif m % a == 0:\r\n plita1 = m // a\r\nelse:\r\n plita1 = m // a + 1\r\n\r\nif n % a == 0:\r\n plita2 = n // a\r\nelse:\r\n plita2 = n // a + 1\r\n\r\nprint(plita1 * plita2)\r\n ", "import math\r\n\r\ninputs = input()\r\nvalues = [int(x) for x in inputs.split()]\r\n\r\nprint(math.ceil(values[0] / values[2]) * math.ceil(values[1] / values[2]))", "n,m,a = map(int, input().split())\r\nx = n // a + int(bool(n % a))\r\ny = m // a + int(bool(m % a))\r\nres = x * y\r\nprint(res)", "a,b,c=map(int,input().split())\r\nif b%c==0:\r\n x=b//c\r\nelse:\r\n x=b//c+1\r\n \r\nif a%c==0:\r\n y=a//c\r\nelse:\r\n y=a//c+1\r\n \r\nprint(x*y) ", "from math import ceil\r\nk=list(map(int,input().split()))\r\nm,n,a=k[0],k[1],k[2]\r\nprint(ceil(m/a)*ceil(n/a))\r\n", "import math\r\n\r\ndef calc(m, n, a):\r\n res = math.ceil(n/a) * math.ceil(m/a)\r\n return res\r\n\r\nm, n, a = map(int, input().split())\r\nprint(calc(m, n, a))", "info=input().split()\r\nm=int(info[0])\r\nn=int(info[1])\r\na=int(info[-1])\r\np=int((m+a-1)/a)\r\nq=int((n+a-1)/a)\r\nprint(p*q)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nnum_flags_n = math.ceil(n/a)\r\nnum_flags_m = math.ceil(m/a)\r\n\r\ntotal_flags = num_flags_n * num_flags_m\r\n\r\nprint(total_flags)\r\n", "n, m, a = map(int, input().split())\r\nans = (n // a + (1 if n % a != 0 else 0)) * (m // a + (1 if m % a != 0 else 0))\r\nprint(ans)\r\n", "import math\r\nn, m, a = list(map(int, input().split()))\r\n\r\nr = math.ceil(n/a)\r\nc = math.ceil(m/a)\r\n\r\nflag = r*c\r\n\r\nprint(flag)\r\n", "bok , bok2 , bok3 = (map(int, input().split()))\r\n \r\nif bok%bok3 ==0:\r\n sciana1 = bok // bok3\r\nelse: \r\n sciana1 = bok// bok3 +1\r\n \r\nif bok2%bok3 == 0:\r\n sciana2 = bok2//bok3 \r\nelse:\r\n sciana2 = bok2//bok3 +1\r\n \r\nprint(sciana1*sciana2)", "a,b,c=6,8,9\nd=c*c\nr=a*b\ns=a/c\nt=b/c\nif a%c==0:\n u=0\nelse:\n u=1\nif b%c==0:\n i=1\nelse:\n i=0\nan=(a/c)+u\na2=(b/c)+i\n\"\"\"print(round(an*a2))\n\"\"\"\nn,m,a = map(int,input().split())\n \nif n%a == 0: r1 = n//a \nelse : r1 = (n//a)+1 \nif m%a == 0: r2 = m//a \nelse : r2 = (m//a)+1\n \nprint(int(r1*r2))\n\t \t\t\t \t \t \t\t \t\t\t\t", "n, m, a= map(int, input().split())\r\nf= n//a\r\nif not not (n % a) >= 1:\r\n f= f+1\r\n\r\ng= m//a\r\nif not not (m % a) >= 1:\r\n g= g+1\r\n\r\nw= f * g\r\nprint(w)", "from math import ceil\r\nn, m, a = map(int, input().split())\r\nanswer = ceil(m/a) * ceil(n/a)\r\nprint(answer)\r\n", "ns, ms, ass = input().split()\r\nn, m, a = int(ns), int(ms), int(ass)\r\nif n % a == 0:\r\n x = n//a\r\nelse :\r\n x = n//a + 1\r\nif m % a == 0:\r\n y = m//a\r\nelse:\r\n y = m//a +1\r\nprint(x*y)", "import math\r\nx,y,z=map(int,input().split())\r\nprint(math.ceil(x/z)*math.ceil(y/z))", "def count(m, n, a):\r\n x = int(m / a)\r\n y = int(n / a)\r\n if m % a != 0:\r\n x += 1\r\n if n % a != 0:\r\n y += 1\r\n print(x * y)\r\n\r\n\r\nb, c, e = map(int, input().split())\r\ncount(b, c, e)", "n,m,a=map(int,input().split())\nx=((n+a-1)//a)\ny=((m+a-1)//a)\nprint(x*y)#T\n \t \t\t\t \t \t\t \t \t \t \t", "def main():\r\n mystical_length, mystical_width, mystical_stone = map(int, input().split())\r\n mystical_num_stones = ((mystical_length // mystical_stone) + (mystical_length % mystical_stone > 0)) * ((mystical_width // mystical_stone) + (mystical_width % mystical_stone > 0))\r\n print(mystical_num_stones)\r\n\r\n# Invoke the main function\r\nmain()\r\n", "import math\r\n\r\nm, n, a = map(int, input().split())\r\n\r\nrow = math.ceil(m/a) \r\ncollumn = math.ceil(n/a) \r\n\r\ntotal = row * collumn\r\n\r\nprint(total)", "import math\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed\r\nnum_flagstones_width = math.ceil(n / a)\r\nnum_flagstones_height = math.ceil(m / a)\r\ntotal_flagstones = num_flagstones_width * num_flagstones_height\r\n\r\n# Output the result\r\nprint(total_flagstones)\r\n", "def calculate_flagstones(n, m, a):\r\n # Calculate the number of flagstones along the length (n)\r\n flagstones_length = (n + a - 1) // a\r\n\r\n # Calculate the number of flagstones along the width (m)\r\n flagstones_width = (m + a - 1) // a\r\n\r\n # Multiply the number of flagstones along the length and width to get the total number of flagstones needed\r\n total_flagstones = flagstones_length * flagstones_width\r\n\r\n return total_flagstones\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Output\r\nprint(calculate_flagstones(n, m, a))\r\n", "from math import ceil\r\nn, m, a=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nprint(ceil(n/a)*ceil(m/a))", "r,c,a = list(map(int,input().split(\" \")))\r\nans = 0\r\nans = r//a\r\nr = r%a\r\nans2 = 0\r\nif r>0:\r\n ans+=1\r\nc = c-a\r\nif c==0:\r\n print(ans)\r\nelse:\r\n ans2 = c//a\r\n c = c%a\r\n if c>0:\r\n ans2+=1\r\n ans2*=ans\r\n ans+=ans2\r\n print(ans)", "n,m,a=([int(x) for x in input().split()])\r\nc=max(n,m)\r\nd=min(n,m)\r\ne=0\r\nf=0\r\nif c%a==0:\r\n e=c//a\r\nelse:\r\n e=(c//a)+1\r\n\r\nif d%a==0:\r\n f=(d//a)\r\nelse:\r\n f=(d//a)+1\r\nprint(f*e)", "n,m,a=list(map(int,input().split()))\r\nif n%a == 0:\r\n r1=n//a\r\nelse:\r\n r1=n//a +1\r\nif m%a== 0:\r\n r2=m//a\r\nelse:\r\n r2=m//a+1\r\nprint(r1*r2)", "ch=input()\r\nl=ch.split(\" \")\r\nn=int(l[0])\r\nm=int(l[1])\r\na=int(l[2])\r\ns=n*m\r\nc=a*a\r\nt=0\r\no=0\r\nif m%a==0:\r\n t=int(m/a)\r\nelse:\r\n t=int(m/a)+1\r\n\r\nif n%a==0:\r\n o=int(n/a)\r\nelse:\r\n o=int(n/a)+1\r\nprint(o*t)\r\n\r\n", "import math\nx = [int(i) for i in input().split()]\nn,m,a = x\nna = math.ceil(n/a)\nma = math.ceil(m/a)\nprint(na*ma)", "import math\r\nn,m,a = map(int,input().split())\r\nc1,c2 = 0,0\r\nif n > a:\r\n c1 = math.ceil(n/a)\r\nelse:\r\n c1 = 1\r\nif m > a:\r\n c2 = math.ceil(m/a)\r\nelse:\r\n c2 = 1\r\nprint(c1*c2)", "from math import ceil\r\n\r\nm, n, a = [int(i) for i in input().split()]\r\n\r\nclass Square:\r\n def __init__(self, length, width):\r\n self.length = length\r\n self.width = width\r\n self.square = length * width\r\n\r\n def total_plits(self, other):\r\n if self.square <= other ** 2:\r\n result = 1\r\n else:\r\n x = ceil(self.length / other)\r\n y = ceil(self.width / other)\r\n result = x * y\r\n return result\r\n\r\n\r\nsquare = Square(m, n)\r\nprint(square.total_plits(a))\r\n", "import math\r\ni=input().split(' ')\r\nn=int(i[0])\r\nm=int(i[1])\r\na=int(i[2])\r\nif 1<=n<=10**9 and 1<=m<=10**9 and 1<=a<=10**9:\r\n c=math. ceil(n/a)\r\n d=math. ceil(m/a)\r\n print(c*d)", "import math\r\n\r\nn,m,a = map(int, input().split())\r\nfila = math.ceil(n/a)\r\ncolumnas = math.ceil(m/a)\r\nrespuesta = fila * columnas\r\nprint(respuesta)", "# Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters.\r\n# On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones.\r\n# Each flagstone is of the size a × a.\r\n\r\n# What is the least number of flagstones needed to pave the Square?\r\n# It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered.\r\n# It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.\r\n\r\n# Input\r\n# The input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).\r\n\r\n# Output\r\n# Write the needed number of flagstones.\r\n\r\nimport math\r\n\r\nn, m, a = input().split()\r\n\r\nnum_flagstones = math.ceil(int(n)/int(a)) * math.ceil(int(m)/int(a))\r\n\r\nprint(num_flagstones)", "def count(n, m, a):\r\n x = n // -a\r\n y = m // -a\r\n return x * y\r\n\r\n\r\nn, m, a = map(int, input().split())\r\nprint(count(n, m, a))", "n,m,a=map(int,input().split())\r\n\r\nif n%a==0:\r\n val1=n//a\r\nelse:\r\n val1=n//a+1\r\n \r\nif m%a==0:\r\n val2=m//a\r\nelse:\r\n val2=m//a+1\r\n \r\nprint(val1*val2) ", "# 6 6 4\r\nimport math\r\ninput1 = input()\r\ninput1 = input1.split(' ')\r\n\r\nn = int(input1[0])\r\nm = int(input1[1])\r\na = int(input1[2])\r\n\r\nsquare_n = math.ceil(float (n / a))\r\nsquare_m = math.ceil(float(m / a))\r\n\r\nprint(square_n * square_m)", "n, m, a = map(int, input().split())\r\n\r\nn += (a - n % a) * (n % a != 0)\r\nm += (a - m % a) * (m % a != 0)\r\n\r\nprint(m * n // a ** 2)\r\n", "m,n,a=map(int,input().split())\r\nt=m+a-1\r\ns=n+a-1\r\nx=int(s/a)\r\ny=int(t/a)\r\nprint(x*y)\r\n", "import math\r\n\r\ndef calculate_flagstones(n, m, a):\r\n return math.ceil(n / a) * math.ceil(m / a)\r\n\r\n# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate and print the needed number of flagstones\r\nneeded_flagstones = calculate_flagstones(n, m, a)\r\nprint(needed_flagstones)\r\n", "a,b,c=map(int,input().split())\r\na1=-(a//-c)\r\na2=-(b//-c)\r\nprint(a1*a2)", "n,m,a=map(int,input().split())\ns=((m+a-1)//a)\nr=((n+a-1)//a)\nprint(s*r)\n \t\t \t\t \t\t\t\t \t\t \t\t \t\t\t\t \t\t\t", "n,m,a=map(int,input().split())\r\nres1=(n//a)+(1 if n%a!=0 else 0)\r\nres2=(m//a)+(1 if m%a!=0 else 0)\r\nprint(res1*res2)", "n,m,a = map(int,input().split())\r\nprint(n//-a*(m//-a))", "#input\nn, m, a = input().split()\nn=int(n)\nm=int(m)\na=int(a)\n\n#process\n\n#flagstones we need\nf1=(n + a - 1) // a\n#divide to avoid fraction\nf2=(m + a - 1) // a\n#result\nprint(f1*f2)\n \t\t\t\t\t \t\t\t\t\t \t \t\t \t \t\t\t", "import math\r\nn,m,a = input().split(' ')\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\ndef TheaterSq():\r\n if(a>=n and a>=m):\r\n return(1)\r\n else:\r\n return (int(math.ceil(m/a))*int(math.ceil(n/a)))\r\n\r\nprint(TheaterSq())\r\n\r\n", "import math\r\ndef ma_(n,m,a):\r\n return math.ceil(m/a)*math.ceil(n/a)\r\nn,m,a=map(int,input().split())\r\nprint(ma_(n,m,a))\r\n", "l=list(map(int,input().split()))\r\nn,m,a=l[0],l[1],l[2]\r\nif n%a==0 and m%a==0:\r\n print((m*n)//(a**2))\r\nelif n%a==0:\r\n print((n//a)*(m//a+1))\r\nelif m%a==0:\r\n print((m//a)*(n//a+1))\r\nelse:\r\n print((m//a+1)*(n//a+1))\r\n\r\n", "n,m,a=list(map(int,input().split()))\r\nif n%a==0:\r\n l=n//a\r\nelse:\r\n l=n//a+1\r\nif m%a==0:\r\n p=m//a\r\nelse:\r\n p=m//a+1\r\nprint(p*l) ", "m,n,a=map(int,input().split())\nprint(((m+(a-1))//a)*((n+(a-1))//a))", "import math \n# theater\nn, m, a = input().split()\noutput = 1\nflag1 = True\nflag2 = True\nif int(n) <= int(a):\n flag1 = False\nif int(m) <= int(a):\n flag2 = False\nif flag2 == False and flag1 == False:\n output = 1\nelse:\n if flag1:\n output *= math.ceil(int(n) / int(a))\n if flag2:\n output *= math.ceil(int(m) / int(a))\n\nprint(int(output))\n\n \t\t \t \t \t \t \t\t\t \t \t\t \t", "import math\r\nn,m,a = list(map(int, input().split()))\r\nc = math.ceil((n/a))\r\nb = math.ceil(m/a)\r\nprint(c*b)", "m,n,a=map(int,input().split())\r\nif m>=1 and n>=1 and a<=10**9:\r\n area=m*n\r\n\r\n flagstone=a*a\r\n\r\n flagstones_needed = (n + a - 1) // a * ((m + a - 1) // a)\r\n r=round(flagstones_needed)\r\nprint(r) ", "import math\nn,m,a = l = [int(i) for i in input().split()]\n\n\nx = n / a \ny = m / a\nans = math.ceil(x) * math.ceil(y)\nprint(str(ans))", "import math\r\n\r\nm, n, a = map(int, input().split())\r\nanswer = math.ceil(m/a) * math.ceil(n/a);\r\nprint(answer)", "n,m,a = map(int, input().split())\r\nprint(((m+a-1)//a)*((n+a-1)//a))", "# https://codeforces.com/problemset/problem/1/A\r\n\r\ninput_values = input()\r\ninput_values = input_values.split()\r\n\r\nn = int(input_values[0])\r\nm = int(input_values[1])\r\na = int(input_values[2])\r\n\r\nif n / a > int(n / a):\r\n x = int(n / a) + 1\r\nelse:\r\n x = n / a\r\n\r\nif m / a > int(m / a):\r\n y = int(m / a) + 1\r\nelse:\r\n y = m / a\r\n\r\nprint(int(x * y))\r\n", "from math import ceil\r\na,b,c = map(int,input().split())\r\nn = ceil(a/c)*ceil(b/c)\r\nprint(n)", "c=[]\r\nm,n,a=[int(x) for x in input().split()]\r\nfor i in (m,n):\r\n if i%a==0:\r\n c.append(int(i/a))\r\n else:\r\n c.append(int(i/a)+1)\r\nprint(c[0]*c[1])", "le,wid,st = map(int,input().split())\r\nif(le%st>0):\r\n s1 = 1\r\nelse:\r\n s1 = 0\r\n \r\nif(wid%st>0):\r\n s12 = 1\r\nelse:\r\n s12 = 0\r\nresult = (le//st+s1) * (wid//st+s12)\r\nprint(result)", "n,m,a= map(int, input().split())\r\nif n%a==0:\r\n l=int(n/a)\r\nelse: \r\n l=int((n/a)+1)\r\nif m%a==0:\r\n b=int(m/a)\r\nelse:\r\n b=int((m/a)+1)\r\nArea=(l*b)\r\nprint(int(Area))", "import math\nn, m, a = input().split()\nn = int(n)\nm = int(m)\na = int(a)\nmul1 = math.ceil(n/a)\nmul2 = math.ceil(m/a)\nans = mul1 * mul2\nprint(ans)\n\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\n\r\ndef calc(num1, num2): #num2 is total square num1 == flagstone\r\n num3 = num1\r\n num4 = num3 // num2\r\n if num3 % num2 != 0:\r\n num4 += 1\r\n return num4\r\n\r\nflagstone1 = calc(a, c)\r\nflagstone2 = calc(b, c)\r\nprint(int(flagstone1) * int(flagstone2))", "n, m, a = map(int, input().split()) # Read n, m, and a\r\n\r\n# Calculate the number of flagstones needed for width and length separately\r\nwidth_flagstones = (n + a - 1) // a\r\nlength_flagstones = (m + a - 1) // a\r\n\r\n# Total flagstones needed is the product of width and length flagstones\r\ntotal_flagstones = width_flagstones * length_flagstones\r\n\r\nprint(total_flagstones)\r\n", "x,y,z=map(int,input().split())\r\nif x%z==0:a=x//z\r\nelif x%z!=0:a=(x//z)+1\r\nif y%z==0:b=y//z\r\nelif y%z!=0:b=(y//z)+1\r\nprint(a*b)\r\n", "# LUOGU_RID: 108710911\nfrom math import *\nn,m,a = map(int, input().split())\nprint(int(ceil(n/a)*ceil(m/a)))\n", "from math import ceil\r\n\r\nflagstones = [int(i) for i in input().split()]\r\nn = flagstones[0]\r\nm = flagstones[1]\r\na = flagstones[2]\r\nmin_number = ceil(n/a)*ceil(m/a)\r\n\r\nprint(min_number)", "x, y, z= input().split()\r\nl=int(x) \r\nm=int(y)\r\nn=int(z)\r\nb=int((l+n-1)/n)\r\nc=int((m+n-1)/n)\r\na=int(b*c)\r\nprint(a)", "n,m,a=map(int,input().split())\r\nif n/a==int(n/a):\r\n if m/a==int(m/a):\r\n print((n*m)//(a**2))\r\n else:\r\n print((n//a)*(m//a+1))\r\nelif m/a==int(m/a):\r\n if n/a==int(n/a):\r\n print((n*m)//(a**2))\r\n else:\r\n print((m//a)*(n//a+1))\r\nelse:\r\n print((n//a+1)*(m//a+1))\r\n\r\n", "n, m, a = map(lambda x: int(x), input().split(\" \"))\r\n\r\n\r\nif n%a == 0 and m%a == 0:\r\n result = (n//a) * (m//a)\r\nelif n%a == 0: \r\n result = (n//a) * (m//a + 1)\r\nelif m%a == 0:\r\n result = (n//a+1) * (m//a)\r\nelse:\r\n result = (n//a + 1) * (m//a + 1)\r\n\r\nprint(result)", "n,m,a=map(int,input().split())\r\nx=(n+a-1)//a\r\ny=(m+a-1)//a\r\nprint(x*y)", "\r\nn, m, a = map(int, input().split(' '))\r\nwidth = m//a\r\nlength = n // a\r\nif m % a != 0:\r\n width += 1\r\nif n % a != 0:\r\n length += 1\r\nresult = width * length\r\nprint(result)", "# Answer\r\nn, m, a = [int(x) for x in input().split()]\r\nflagstones_needed = ((n + a - 1) // a) * ((m + a - 1) // a)\r\nprint(flagstones_needed)", "m,s,h = map(int, input().split())\nif s % h == 0:\n p = s // h\nelse:\n p = s // h + 1\nif m % h == 0:\n y = m // h\nelse:\n y = m // h + 1\nprint(p * y)\n\t \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\nlength=a//c\r\nif a%c!=0:\r\n length+=1\r\nbre=b//c\r\nif b%c!=0:\r\n bre+=1\r\nprint(length*bre)", "n,m,a = map(int, input().split())\r\nx=0\r\ny =0\r\nif(n%a==0):\r\n x = x+n//a\r\nelse:\r\n x = x+n//a+1\r\nif(m%a==0):\r\n y = y+m//a\r\nelse:\r\n y =y+m//a+1\r\nprint(x*y)\r\n", "import math\r\nn, m, a = [int(n) for n in input(\"\").split()]\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "import math\r\n\r\ndimensoes = str(input()) # Digite n m a\r\nlista_separado = dimensoes.split()\r\nn = int(lista_separado[0]) # Linhas / Comprimento\r\nm = int(lista_separado[1]) # Colunas / Altura\r\na = int(lista_separado[2]) # Dimensões laje\r\n\r\ncomprimento_laje = n / a\r\ncomprimento_laje_arredondado = math.ceil(comprimento_laje)\r\naltura_laje = m / a\r\naltura_laje_arredondado = math.ceil(altura_laje)\r\n\r\nnumero_lajes = comprimento_laje_arredondado * altura_laje_arredondado\r\n\r\nprint(numero_lajes)", "n,m,a=map(int,input().split())\r\nn1=int(n/a)\r\nm1=int(m/a)\r\nif(n%a!=0):\r\n n1+=1\r\nif(m%a!=0):\r\n m1+=1\r\nprint(n1*m1)\r\n", "from math import ceil\r\nn,m,a=map(int,input().split())\r\n\r\nflag=ceil(n/a)\r\nflag_1=ceil(m/a)\r\n\r\nprint(flag*flag_1)", "a, b , c = map(int, input().split())\r\n\r\na1 = a // c\r\nif a % c > 0:\r\n a1 += 1\r\nb1 = b // c\r\nif b % c > 0:\r\n b1 += 1\r\nprint(a1 * b1)\r\n", "#nie mam pomyslu na te kwadraciki\r\ntmp = input(\"\")\r\na = []\r\nlastnumber = 0\r\nlastspace = 0\r\nfor i in range(len(tmp)):\r\n if tmp[i] == \" \":\r\n a.append(int(tmp[lastnumber:i]))\r\n lastnumber = i + 1\r\n lastspace = i\r\nif len(a) == 0:\r\n a.append(int(tmp))\r\nelse:\r\n a.append(int(tmp[lastspace + 1:]))\r\nn = a[0]\r\nm = a[1]\r\na = a[2]\r\noutput = 0\r\nif n == a:\r\n output = 1\r\nelse:\r\n if a > m:\r\n output += 1\r\n elif a == 1 or n % a == 0:\r\n output += int(n / a)\r\n else:\r\n output += int(n / a + 1)\r\nif m != a:\r\n if a > m:\r\n output += 0\r\n elif a == 1 or m % a == 0:\r\n output *= int(m / a)\r\n else:\r\n output *= int(m / a + 1)\r\nprint(output)", "n, m, a = [int(p) for p in (input()).split()]\r\nv = (n // a + (n%a != 0)) * (m //a + (m%a != 0))\r\nprint(v)", "def area_baldosa(base,altura,baldosa):\r\n contador_base=0\r\n contador_altura=0\r\n if base%baldosa == 0:\r\n contador_base=base//baldosa\r\n else:\r\n contador_base=base//baldosa+1\r\n if altura%baldosa==0:\r\n contador_altura=altura//baldosa\r\n else:\r\n contador_altura=altura//baldosa+1\r\n print(contador_base*contador_altura)\r\n\r\n \r\n \r\n\r\n#bloque principal\r\ntupla=tuple(map(int,input().split()))\r\nbase,altura,baldosa=tupla\r\narea_baldosa(base,altura,baldosa)\r\n", "# 1327A - 数学 + 思维\n# def subSum(a1, n, d):\n# return n * a1 + n * (n - 1) * d // 2\n# if __name__ == '__main__':\n# t = int(input())\n# for i in range(t):\n# n, k = list(map(int, input().strip().split()))\n# if (n & 1) != (k & 1):\n# print(\"NO\")\n# else:\n# if subSum(1, k, 2) > n:\n# print(\"NO\")\n# else:\n# print(\"YES\")\n\nif __name__ == '__main__':\n n, m, a = list(map(int, input().strip().split()))\n row = n // a + (1 if n % a else 0)\n col = m // a + (1 if m % a else 0)\n print(row * col)", "import math\na, b, s=map(int, input().split())\nr=math. ceil(a/s)\nc=math. ceil(b/s)\nprint(r*c)\n \t \t\t\t \t \t\t\t \t \t\t\t\t \t\t\t\t \t", "n,m,a=map(int,input().split())\r\nif m%a==0: \r\n x1=m//a \r\nelse: \r\n x1=m//a+1 \r\n \r\nif n%a==0: \r\n x2=n//a \r\nelse: \r\n x2=n//a+1\r\nprint(x1*x2)\r\n", "import math\r\nn, m, a = map(int, input().split())\r\nlen= math.ceil(n / a)\r\nwid= math.ceil(m / a)\r\ntotal= len* wid\r\nprint(total)", "m,n,a=[int(x) for x in input().split()]\r\ntl=0\r\ntw=0\r\nif m%a==0:\r\n tl=m//a\r\nelse:\r\n tl=(m//a+1)\r\nif n%a==0:\r\n tw=n//a\r\nelse:\r\n tw=tw+(n//a+1)\r\nprint(tw*tl) ", "if __name__ == \"__main__\":\r\n spec = list(map(int, input().split()))\r\n n, m, a = spec[0], spec[1], spec[2]\r\n print(((n + a - 1) // a) * ((m + a - 1) // a))", "import math\r\nt=input().split()\r\nprint(math.ceil(int(t[0])/int(t[2])) * math.ceil(int(t[1])/int(t[2])))\r\n\r\n\r\n", "o,p,i=map(int,input().split())\r\nprint(-o//i*(-p//i))", "from math import ceil\r\n\r\nparam = input().split()\r\n\r\nwidth = int(param[0])\r\nlength = int(param[1])\r\nsquare = int(param[2])\r\n\r\nprint(ceil(width/square)*ceil(length/square))", "a,b,n=map(int,input().split())\r\nr1=0\r\nr2=0\r\nif a%n != 0:\r\n r1=(a//n)+1\r\nelse:\r\n r1=a//n\r\nif b%n != 0:\r\n r2=(b//n)+1\r\nelse:\r\n r2=b//n\r\n\r\nprint(r1*r2)", "import math\r\ninput = input().split(' ')\r\nn = int(input[0]) \r\nm = int(input[1])\r\na = int(input[2])\r\nprint(math.ceil(m/a) * math.ceil(n/a))", "import math\r\n\r\nn,m,a=map(int,input().split())\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a)\r\nprint(x * y) ", "from math import ceil\r\nx,y,z=map(int,input().split())\r\na=ceil(x/z)\r\nb=ceil(y/z)\r\nprint(int(a*b))", "from math import ceil\r\n\r\nc,k,l = map(int,input().split())\r\nA = ceil(c/l)\r\nB = ceil(k/l)\r\nprint(int(A*B))", "n, m, a = map(int, input().split())\r\n\r\nan = n//a if n%a == 0 else (n//a+1)\r\nam = m//a if m%a == 0 else (m//a+1)\r\n\r\nprint(an*am)", "n,m,a = map(int,input().split())\r\n\r\nnum = int(-(-n//a)) * int(-(-m//a))\r\n\r\nprint(num)", "import math\r\nli=input().split()\r\nrow=int(li[0])\r\nclm=int(li[1])\r\na=int(li[2])\r\ntile=math.ceil(clm/a)*math.ceil(row/a)\r\nprint(tile)", "import math \r\nm, n, k = map(int, input().split())\r\ntotal = int(math.ceil(m / k) * math.ceil(n / k))\r\nprint(total)", "a, b, c = map(int, input().split())\r\nx, y = 0, 0\r\nif a % c == 0:\r\n x = a // c\r\nelse:\r\n x = a // c + 1\r\nif b % c == 0:\r\n y = b // c\r\nelse:\r\n y = b // c + 1\r\nprint(x * y)", "n,m,a=map(int,input().split())\r\nx,y=n//a,m//a\r\nif n%a:\r\n x+=1\r\nif m%a:\r\n y+=1\r\nprint(x*y)", "def main():\r\n # input\r\n n, m, a = map(int, input().split())\r\n\r\n # soln\r\n x = n//a\r\n if n%a != 0:\r\n x += 1\r\n y = m // a\r\n if m%a != 0:\r\n y += 1\r\n print(x*y)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m,a=tuple(map(int,input().split()))\r\nif n%a==0 and m%a==0:\r\n print((n//a)*(m//a))\r\nelif n%a==0 and m%a!=0:\r\n print((n//a)*((m//a)+1))\r\nelif n%a!=0 and m%a==0:\r\n print((m//a)*((n//a)+1))\r\nelse: print(((m//a)+1)*((n//a)+1))", "a,b,c=map(int,input().split(\" \"))\r\nx=0\r\nm=a//c\r\nn=b//c\r\nif a%c != 0:\r\n m+=1\r\nif b%c != 0:\r\n n+=1\r\nprint(m*n)", "v,z,a=map(int,input().split())\r\nprint(-v//a*(-z//a))", "def theatre(row, col, a):\r\n x = (row // a) + 1 if row % a != 0 else (row // a)\r\n y = (col // a) + 1 if col % a != 0 else (col // a)\r\n return x * y\r\n\r\nif __name__ == \"__main__\":\r\n n, m, a = map(int, input().split(\" \"))\r\n print(theatre(n, m, a))", "input_ = input()\r\ninput_ = input_.split()\r\nn = int(input_[0])\r\nm = int(input_[1])\r\na = int(input_[-1])\r\n\r\nif n % a != 0:\r\n x = ((n - (n % a))/a)+1\r\nelif n % a == 0:\r\n x = n/a\r\n\r\nif m % a != 0:\r\n y = ((m - (m % a))/a)+1\r\nelif m % a == 0:\r\n y = m/a\r\n \r\nprint(int(x*y))", "import math\n\nargs = input().split()\n\nn = int(args[0])\nm = int(args[1])\na = int(args[2])\n\nx_minlength = math.ceil(m/a)\ny_minlength = math.ceil(n/a)\n\nprint(x_minlength * y_minlength)\n", "n,m,a=map(int,input().split())\r\n\r\nra, rb = 1, 1\r\n\r\nif n%a > 0:\r\n ra = n//a + 1\r\nelse:\r\n ra = n//a\r\n\r\nif m%a > 0:\r\n rb = m//a + 1\r\nelse:\r\n rb = m//a\r\n \r\nprint(ra*rb)\r\n", "\r\nn,m,a=map(int,input().split())\r\nif n%a!=0:\r\n c=(n//a)+1\r\nelse:\r\n c=n//a\r\nif m%a!=0:\r\n b=(m//a)+1\r\nelse:\r\n b=m//a\r\nprint(c*b)\r\n", "str_input = input()\r\ndata_list = str_input.split()\r\nn = int(data_list[0])\r\nm = int(data_list[1])\r\na = int(data_list[2])\r\n\r\nif n % a == 0:\r\n n = n / a\r\nelse:\r\n n = int(n / a) + 1\r\n\r\nif m % a == 0:\r\n m = m / a\r\nelse:\r\n m = int(m / a) + 1\r\n\r\nprint(int(m * n))", "from math import ceil\r\na,b,c = [int(x) for x in input().split()]\r\nprint(str(ceil(a/c)*(ceil(b/c))))", "from math import ceil\r\n\r\nn, m, a = map( int, input().split() )\r\n\r\nif n%a == 0 : r1 = n//a\r\nelse: r1 = ceil(n/a)\r\n\r\nif m%a == 0 : r2 = m//a\r\nelse: r2 = ceil(m/a)\r\n\r\nprint( r1*r2 ) ", "import math\r\n\r\n\r\ndef getAns():\r\n inp = input().split(\" \")\r\n n = inp[0]\r\n m = inp[1]\r\n a = inp[2]\r\n\r\n ver = math.ceil(int(m) / int(a))\r\n hor = math.ceil(int(n) / int(a))\r\n\r\n print(int(hor * ver))\r\n\r\ngetAns()", "import math\r\ni1=input()\r\nl=[]\r\nfor i in (i1.split()):\r\n l.append(int(i))\r\nn=l[0]\r\nm=l[1]\r\na=l[2]\r\ndef sqtile(n,m,a):\r\n n1=math.ceil(n/a) \r\n m1=math.ceil(m/a) \r\n return(n1*m1) \r\nprint(sqtile(n,m,a))", "inp = input()\r\n\r\nlst = inp.split()\r\n\r\nm = int(lst[0])\r\nn = int(lst[1])\r\na = int(lst[2])\r\n\r\nif m<a:\r\n ma = 1\r\nelif m%a == 0:\r\n ma = int(m/a)\r\nelse:\r\n ma = int(m/a) + 1 \r\n \r\nif n<a:\r\n na = 1\r\nelif n%a == 0:\r\n na = int(n/a)\r\nelse:\r\n na = int(n/a) + 1 \r\n \r\nprint(ma*na)", "from math import ceil\r\n\r\ninp = input()\r\nn, m, a = inp.split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n# print(n, m, a, sep='\\n')\r\n\r\nodp = ceil(n / a) * ceil(m / a)\r\nprint(odp)", "n,m,a=input(\"\").split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nif (n%a==0):\r\n k=n//a\r\nelse:\r\n k=n//a+1\r\nif (m % a == 0):\r\n p = m // a\r\nelse:\r\n p = m// a+ 1\r\nprint(k*p)\r\n\r\n", "n, m, a = list(map(int, input().strip().split()))\r\nx = n//a + 1 if n//a < n/a else n//a\r\ny = m//a + 1 if m//a < m/a else m//a\r\nprint(x*y)\r\n", "from math import ceil\n\n\ndef main():\n\n sizes = list(input().strip().split())\n\n number_of_stones = ceil(\n int(sizes[0])/int(sizes[2])) * ceil(int(sizes[1])/int(sizes[2]))\n\n print(number_of_stones)\n\n\nmain()\n", "\r\np, m, a = map(int, input().split())\r\nprint(p// -a * (m // -a) )\r\n ", "import math\r\n\r\nnumbers = input().split(\" \")\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\na = int(numbers[2])\r\n\r\n\r\nblocks = math.ceil(n / a) * math.ceil(m / a)\r\n\r\nprint(blocks)", "m,n,a = [int(x) for x in input().split()]\r\nif (m//a)*a==m:\r\n x =m//a\r\nelse:\r\n x=m//a+1\r\nif (n//a)*a==n:\r\n y =n//a\r\nelse:\r\n y=n//a+1\r\nprint(x*y)", "if __name__ == \"__main__\":\n length, breadth, tile = map(int, input().split(sep=\" \"))\n print(-length//tile *(-breadth//tile))", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nA = ceil(n/a)*ceil(m/a)\r\nprint(int(A))", "import math\r\ns=input()\r\ns=s.split(\" \")\r\na,b,c=int(s[0]),int(s[1]),int(s[-1])\r\nprint(math.ceil(a/c)*math.ceil(b/c))\r\n", "input= (input().split())\r\n\r\nn = int(input[0])\r\nm = int(input[1])\r\na = int(input[2])\r\nif m%a != 0:\r\n x = int(m/a) + 1\r\nelse:\r\n x = int(m/a)\r\nif n%a != 0:\r\n y = int(n/a) + 1\r\nelse:\r\n y = int(n/a)\r\nprint (x*y)", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nprint(ceil(n/a)*ceil(m/a))", "from math import ceil\r\nn,m,a=map(int,input().split()) \r\nf1 = ceil(n/a)\r\nf2 = ceil(m/a)\r\nprint(f1 * f2)", "import math\n\nn,m,a=map(int,input().split())\nval=math.ceil(m/a)*math.ceil(n/a)\nprint(val)\n\n\n\t \t\t\t \t\t\t \t\t\t\t \t \t \t \t\t", "n,m,a = map(int,input().split())\r\nr1 = m % a\r\nr2 = n % a\r\nq1 = m // a\r\nq2 = n // a\r\nif (r1 > 0 and r2 > 0):\r\n print((q1 + 1)*(q2 + 1))\r\nelif r1 > 0 and r2 ==0:\r\n print((q1 + 1)*q2)\r\nelif (r1 == 0 and r2 > 0):\r\n print(q1*(q2 + 1))\r\nelif (r1 == 0 and r2 == 0):\r\n print(q1*q2)", "m,n,a = map(int,input().split())\r\nimport math\r\nb = math.ceil(m/a)\r\nc = math.ceil(n/a)\r\nprint(b*c)", "m,n,a = map(int,input().split())\r\nif m % a > 0:\r\n x = m // a + 1\r\nelse:\r\n x = m // a\r\nif n % a > 0:\r\n y = n // a + 1\r\nelse:\r\n y = n // a\r\nprint(x*y)", "(m,n,a)=input().split()\nm=int(m);n=int(n);a=int(a)\nprint((m//a+bool(m%a))*(n//a+bool(n%a)))", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nprint(ceil(n / a) *ceil( m / a))", "n, m, a=map(int, input(). split()) \r\nF=n//a\r\nS=m//a\r\nif n%a!=0:\r\n F=F+1\r\nif m%a!=0:\r\n S=S+1\r\nprint(F*S)", "import math\r\n\r\nn,m,a = map(int,input().split())\r\nprint(math.ceil(n / a)*math.ceil(m / a))", "import math\nn, m, a = map(int, input().split())\n\nanswer_n = math.ceil(n / a)\nanswer_m = math.ceil(m / a)\nprint(answer_n * answer_m)\n", "a=list(map(int,input().split()))\r\nx=a[0]//a[2]+(a[0]%a[2]!=0)\r\ny=a[1]//a[2]+(a[1]%a[2]!=0)\r\nprint(x*y)", "import math\r\narea = input().split(\" \")\r\n\r\nm = int(area[0])\r\nn = int(area[1])\r\na = int(area[2])\r\n\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "n, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\nprint((n // a) * (m//a) + bool(n % a) * (m // a) + bool(m % a) * (n // a) + bool(n % a) * bool(m % a))\r\n", "n=[]\r\nk=input()\r\nn=k.split()\r\nresult1=0\r\nresult2=0\r\nn[0],n[1],n[2]=int(n[0]),int(n[1]),int(n[2])\r\nif n[0]%n[2]>0:\r\n result1+=n[0]//n[2]+1\r\nelse: #if n[0]//n[2]>1:\r\n result1+=n[0]//n[2]\r\nif n[1]%n[2]>0:\r\n result2+=n[1]//n[2]+1\r\nelse: #if n[1]//n[2]>1:\r\n result2+=n[1]//n[2]\r\nprint(result1*result2)", "# LUOGU_RID: 112642744\nn,m,a = map(int,input().split())\r\nres = (m // a) * (n // a)\r\nif m % a != 0 and n % a != 0:\r\n res += n // a + 1 \r\n res += m // a\r\nelif m % a != 0 and n % a == 0:\r\n res += n // a\r\nelif m % a == 0 and n % a != 0:\r\n res += m // a \r\nprint(res) ", "# LUOGU_RID: 109765887\na = [int(i) for i in input().split()]\nn = a[0]\nm = a[1]\nx = a[2]\nif n % x == 0:\n n = n // x\nelse:\n n = n // x + 1\nif m % x == 0:\n m = m // x\nelse:\n m = m // x + 1\nprint(n * m)", "inp = list(map(int,input().split()))\r\nn = inp[0]\r\nm = inp[1]\r\na = inp[2]\r\nc = -(-n//a)\r\nd = -(-m//a)\r\nprint(c * d)", "import math\nn, m, a=[int(i) for i in input().split()]\nprint(math.ceil(n/a)*math.ceil(m/a))", "n, m, a = [int(i) for i in input().split()]\r\nprint(((n // a) + (n % a != 0)) * ((m // a) + (m % a != 0)))\r\n", "n, m, a = map(int, input().split())\r\nrow_squares = 0\r\nrow_squares += n // a\r\nif n % a != 0:\r\n row_squares += 1\r\ncolumn_squares = 0\r\ncolumn_squares += m // a\r\nif m % a != 0:\r\n column_squares += 1\r\ntotal_squares = row_squares * column_squares\r\nprint(total_squares)\r\n", "l,b,a = map(int,input().split())\nx=0\ny=0\nif l%a==0:\n x=l//a\nelse:\n x=(l//a)+1\nif b%a==0:\n y=b//a\nelse:\n y=(b//a)+1\nprint(x*y)\n \t\t\t \t \t\t \t\t \t\t\t\t\t\t \t\t\t\t\t", "import math\r\nn,m,a = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nout = math.ceil(m/a) * math.ceil(n/a)\r\nprint(out)", "import math\r\nnums = list(map(int, input().split()))\r\nprint(math.ceil(nums[0]/nums[2]) * math.ceil(nums[1]/nums[2]))", "########################################################################################################################\r\n# ------------------------------------Template of AUTHOR: Omm AKA Antonio Colapso---------------------------------------#\r\n########################################################################################################################\r\nimport time\r\nimport bisect\r\nimport functools\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport threading\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom functools import cmp_to_key, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom operator import add, iand, ior, itemgetter, mul, xor\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom typing import *\r\nimport collections\r\nimport heapq\r\nimport itertools\r\n\r\n\r\ndef vsInput():\r\n sys.stdin = open('inputf.in', 'r')\r\n sys.stdout = open('outputf.out', 'w')\r\n\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ndef input(): return sys.stdin.readline().rstrip('\\r\\n')\r\n\r\n\r\n#########################################################################################################\r\n# ------------------------------------Functions By Antonio Colapso---------------------------------------#\r\n# s\r\n\r\n\r\ndef SieveOfEratosthenes(n):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n l = []\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n for p in range(2, n+1):\r\n if prime[p]:\r\n l.append(p)\r\n # print(p)\r\n else:\r\n continue\r\n return l\r\n\r\n\r\ndef isPrime(n):\r\n prime_flag = 0\r\n\r\n if n > 1:\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n prime_flag = 1\r\n break\r\n if prime_flag == 0:\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\n\r\ndef gcdofarray(a):\r\n x = 0\r\n for p in a:\r\n x = math.gcd(x, p)\r\n return x\r\n\r\n\r\ndef printDivisors(n):\r\n i = 1\r\n ans = []\r\n while i <= math.sqrt(n):\r\n if (n % i == 0):\r\n if (n / i == i):\r\n ans.append(i)\r\n else:\r\n ans.append(i)\r\n ans.append(n // i)\r\n i = i + 1\r\n ans.sort()\r\n return ans\r\n\r\n\r\ndef binaryToDecimal(n):\r\n return int(n, 2)\r\n\r\n\r\ndef countTriplets(a, n):\r\n s = set()\r\n for i in range(n):\r\n s.add(a[i])\r\n count = 0\r\n for i in range(n):\r\n for j in range(i + 1, n, 1):\r\n xr = a[i] ^ a[j]\r\n if xr in s and xr != a[i] and xr != a[j]:\r\n count += 1\r\n return int(count // 3)\r\n\r\n\r\ndef countOdd(L, R):\r\n N = (R - L) // 2\r\n if (R % 2 != 0 or L % 2 != 0):\r\n N += 1\r\n return N\r\n\r\n\r\ndef isPalindrome(s):\r\n return s == s[::-1]\r\n\r\n\r\ndef sufsum(a):\r\n test_list = a.copy()\r\n test_list.reverse()\r\n n = len(test_list)\r\n for i in range(1, n):\r\n test_list[i] = test_list[i] + test_list[i - 1]\r\n return test_list\r\n\r\n\r\ndef prsum(b):\r\n a = b.copy()\r\n for i in range(1, len(a)):\r\n a[i] += a[i - 1]\r\n return a\r\n\r\n\r\ndef badachotabadachota(nums):\r\n nums.sort()\r\n i = 0\r\n j = len(nums) - 1\r\n ans = []\r\n cc = 0\r\n while len(ans) != len(nums):\r\n if cc % 2 == 0:\r\n ans.append(nums[j])\r\n j -= 1\r\n else:\r\n ans.append(nums[i])\r\n i += 1\r\n cc += 1\r\n return ans\r\n\r\n\r\ndef chotabadachotabada(nums):\r\n nums.sort()\r\n i = 0\r\n j = len(nums) - 1\r\n ans = []\r\n cc = 0\r\n while len(ans) != len(nums):\r\n if cc % 2 == 1:\r\n ans.append(nums[j])\r\n j -= 1\r\n else:\r\n ans.append(nums[i])\r\n i += 1\r\n cc += 1\r\n return ans\r\n\r\n\r\ndef primeFactors(n):\r\n ans = []\r\n while n % 2 == 0:\r\n ans.append(2)\r\n n = n // 2\r\n\r\n for i in range(3, int(math.sqrt(n))+1, 2):\r\n while n % i == 0:\r\n ans.append(i)\r\n n = n // i\r\n if n > 2:\r\n ans.append(n)\r\n return ans\r\n\r\n\r\ndef closestMultiple(n, x):\r\n if x > n:\r\n return x\r\n z = (int)(x / 2)\r\n n = n + z\r\n n = n - (n % x)\r\n return n\r\n\r\n\r\ndef getPairsCount(arr, n, sum):\r\n m = [0] * 1000\r\n for i in range(0, n):\r\n m[arr[i]] += 1\r\n twice_count = 0\r\n for i in range(0, n):\r\n twice_count += m[int(sum - arr[i])]\r\n if (int(sum - arr[i]) == arr[i]):\r\n twice_count -= 1\r\n return int(twice_count / 2)\r\n\r\n\r\ndef remove_consec_duplicates(test_list):\r\n res = [i[0] for i in itertools.groupby(test_list)]\r\n return res\r\n\r\n\r\ndef BigPower(a, b, mod):\r\n if b == 0:\r\n return 1\r\n ans = BigPower(a, b//2, mod)\r\n ans *= ans\r\n ans %= mod\r\n if b % 2:\r\n ans *= a\r\n return ans % mod\r\n\r\n\r\ndef nextPowerOf2(n):\r\n count = 0\r\n if (n and not (n & (n - 1))):\r\n return n\r\n while (n != 0):\r\n n >>= 1\r\n count += 1\r\n return 1 << count\r\n\r\n\r\n# This function multiplies x with the number\r\n# represented by res[]. res_size is size of res[]\r\n# or number of digits in the number represented\r\n# by res[]. This function uses simple school\r\n# mathematics for multiplication. This function\r\n# may value of res_size and returns the new value\r\n# of res_size\r\ndef multiply(x, res, res_size):\r\n\r\n carry = 0 # Initialize carry\r\n\r\n # One by one multiply n with individual\r\n # digits of res[]\r\n i = 0\r\n while i < res_size:\r\n prod = res[i] * x + carry\r\n res[i] = prod % 10 # Store last digit of\r\n # 'prod' in res[]\r\n # make sure floor division is used\r\n carry = prod//10 # Put rest in carry\r\n i = i + 1\r\n\r\n # Put carry in res and increase result size\r\n while (carry):\r\n res[res_size] = carry % 10\r\n # make sure floor division is used\r\n # to avoid floating value\r\n carry = carry // 10\r\n res_size = res_size + 1\r\n\r\n return res_size\r\n\r\n\r\ndef Kadane(a, size):\r\n\r\n max_so_far = -1e18 - 1\r\n max_ending_here = 0\r\n\r\n for i in range(0, size):\r\n max_ending_here = max_ending_here + a[i]\r\n if (max_so_far < max_ending_here):\r\n max_so_far = max_ending_here\r\n\r\n if max_ending_here < 0:\r\n max_ending_here = 0\r\n return max_so_far\r\n\r\n\r\ndef highestPowerof2(n):\r\n res = 0\r\n for i in range(n, 0, -1):\r\n if ((i & (i - 1)) == 0):\r\n res = i\r\n break\r\n return res\r\n\r\n\r\ndef MEX(nList, start):\r\n nList = set(nList)\r\n mex = start\r\n while mex in nList:\r\n mex += 1\r\n return mex\r\n\r\n\r\ndef getClosest(val1, val2, target):\r\n\r\n if (target - val1 >= val2 - target):\r\n return val2\r\n else:\r\n return val1\r\n\r\n\r\ndef tobinary(a): return bin(a).replace('0b', '')\r\n\r\n\r\ndef nextPerfectSquare(N):\r\n\r\n nextN = math.floor(math.sqrt(N)) + 1\r\n\r\n return nextN * nextN\r\n\r\n\r\ndef modFact(n, p):\r\n result = 1\r\n for i in range(1, n + 1):\r\n result *= i\r\n result %= p\r\n\r\n return result\r\n\r\n\r\ndef maxsubarrayproduct(arr):\r\n\r\n n = len(arr)\r\n max_ending_here = 1\r\n min_ending_here = 1\r\n max_so_far = 0\r\n flag = 0\r\n\r\n for i in range(0, n):\r\n\r\n if arr[i] > 0:\r\n max_ending_here = max_ending_here * arr[i]\r\n min_ending_here = min(min_ending_here * arr[i], 1)\r\n flag = 1\r\n\r\n elif arr[i] == 0:\r\n max_ending_here = 1\r\n min_ending_here = 1\r\n\r\n else:\r\n temp = max_ending_here\r\n max_ending_here = max(min_ending_here * arr[i], 1)\r\n min_ending_here = temp * arr[i]\r\n if (max_so_far < max_ending_here):\r\n max_so_far = max_ending_here\r\n\r\n if flag == 0 and max_so_far == 0:\r\n return 0\r\n return max_so_far\r\n\r\n\r\ndef ncr(n, r, p):\r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den, p - 2, p)) % p\r\n\r\n\r\ndef sqrtl(x):\r\n if (x == 0 or x == 1):\r\n return x\r\n start = 1\r\n end = x//2\r\n while (start <= end):\r\n mid = (start + end) // 2\r\n if (mid*mid == x):\r\n return mid\r\n if (mid * mid < x):\r\n start = mid + 1\r\n ans = mid\r\n else:\r\n end = mid-1\r\n\r\n return ans\r\n\r\n\r\ndef ceill(a, b):\r\n return (a // b) + int(a % b != 0)\r\n\r\n\r\ndef LcmOfArray(arr, idx):\r\n\r\n # lcm(a,b) = (a*b/gcd(a,b))\r\n if (idx == len(arr)-1):\r\n return arr[idx]\r\n a = arr[idx]\r\n b = LcmOfArray(arr, idx+1)\r\n return int(a*b / math.gcd(a, b))\r\n\r\n\r\ndef base_change_Excluding_certain_Digits_or_Base_conversion(number_of_hated_digits, list_of_hated_digits, find_nth_number):\r\n digits1 = '0123456789'\r\n digits = \"\" # only digits we want\r\n for i in digits1:\r\n if int(i) not in list_of_hated_digits:\r\n digits += i\r\n # final integer base after excluding \"t\" hated digits\r\n base = 10-number_of_hated_digits\r\n sol = []\r\n while find_nth_number:\r\n sol.append(digits[find_nth_number % base])\r\n find_nth_number //= base\r\n sol.reverse()\r\n return (\"\".join(sol))\r\n# print(base_change_Excluding_certain_Digits_or_Base_conversion(2,[1,8],10))\r\n\r\n\r\ndef counter(l):\r\n cts = {}\r\n for x in l:\r\n cts[x] = cts.get(x, 0) + 1\r\n return cts\r\n\r\n\r\ndef mimic_string(sm,sn): #//minimum steps to make both string equal\r\n prev_dp = list(range(len(sm) + 1))\r\n curr_dp = [0] * (len(sm) + 1)\r\n\r\n for i in range(1, len(sn) + 1):\r\n curr_dp[0] = i\r\n for j in range(1, len(sm) + 1):\r\n if sn[i - 1] == sm[j - 1]:\r\n curr_dp[j] = prev_dp[j - 1]\r\n else:\r\n curr_dp[j] = min(prev_dp[j], prev_dp[j - 1], curr_dp[j - 1]) + 1\r\n prev_dp = curr_dp[:] \r\n return(curr_dp[len(sm)])\r\n\r\ndef LCS_length(s, t):\r\n m, n = len(s), len(t)\r\n prev_dp = [0] * (n + 1)\r\n curr_dp = [0] * (n + 1)\r\n\r\n for i in range(1, m + 1):\r\n for j in range(1, n + 1):\r\n if s[i - 1] == t[j - 1]:\r\n curr_dp[j] = prev_dp[j - 1] + 1\r\n else:\r\n curr_dp[j] = max(prev_dp[j], curr_dp[j - 1])\r\n prev_dp = curr_dp[:]\r\n \r\n return curr_dp[n]\r\n\r\n lcs = \"\"\r\n i, j = m, n\r\n while i > 0 and j > 0:\r\n if s[i - 1] == t[j - 1]:\r\n lcs = s[i - 1] + lcs\r\n i -= 1\r\n j -= 1\r\n elif dp[i - 1][j] > dp[i][j - 1]:\r\n i -= 1\r\n else:\r\n j -= 1\r\n\r\n return lcs\r\n\r\ndef kadane(arr):\r\n n = len(arr)\r\n max_ending_here = arr[0]\r\n max_so_far = arr[0]\r\n\r\n for i in range(1, n):\r\n max_ending_here = max(arr[i], max_ending_here + arr[i])\r\n max_so_far = max(max_so_far, max_ending_here)\r\n\r\n return max_so_far\r\n# #######################################################################################################################################\r\n\r\n\r\nalphabets = list(\"abcdefghijklmnopqrstuvwxyz\")\r\nvowels = list(\"aeiou\")\r\nMOD1 = int(1e9 + 7)\r\nMOD2 = 998244353\r\nINF = int(1e17)\r\n\r\n\r\n######################################################################################\r\n# --------------------------------------Input-----------------------------------------#\r\n######################################################################################\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ninf = float('inf')\r\n\r\n# ########################################################################\r\n# #-----------------------------Code Here--------------------------------#\r\n##########################################################################\r\n#\r\nfrom math import ceil\r\na,b,c=MII()\r\n\r\nprint(ceil(a/c)*ceil(b/c))", "n, m, a = [int(x) for x in input().split()]\r\n\r\nh = n//a\r\nv = m//a\r\nc = h*v\r\nrv = v if n%a else 0 \r\nrh = h if m%a else 0 \r\niSec = 1 if m%a and n%a else 0 \r\nc += rv + rh + iSec\r\nprint(c)", "from math import ceil\r\n\r\nn, m, a = [int(x) for x in input().split(\" \")]\r\n\r\nneeded_horizontal = ceil(n / a)\r\nneeded_vertical = ceil(m / a)\r\n\r\nprint(needed_horizontal*needed_vertical)", "import math\r\n\r\n# Read input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed horizontally and vertically\r\nhorizontal_flagstones = math.ceil(n / a)\r\nvertical_flagstones = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones required\r\ntotal_flagstones = horizontal_flagstones * vertical_flagstones\r\n\r\n# Print the result\r\nprint(total_flagstones)\r\n", "from math import ceil\r\n \r\n \r\nn,m,a = map(int, input().split())\r\nprint(ceil(m/a)*ceil(n/a))", "from math import ceil\r\n\r\n\r\nn , m , a = [int(i) for i in input().split()]\r\n\r\nprint(ceil(n / a) * ceil(m / a))", "n, m, a = map(int, input().split())\r\ns = 1\r\nif n > a:\r\n s *= (n + a - 1) // a\r\nif m > a:\r\n s *= (m + a - 1) // a\r\nprint(s)", "import math\r\n\r\ndef into(x, y):\r\n return math.ceil(x/y)\r\n \r\ninfo = [int(x) for x in input().split(\" \")]\r\na = into(info[0], info[2])\r\nb = into(info[1], info[2])\r\nprint(a * b)", "n,m,a=list(map(int,input().split()))\r\nw=(n+a-1)//a\r\nl = (m + a - 1) // a\r\nt=w*l\r\nprint(t)", "c = input().split()\r\nn=int (c[0])\r\nm=int (c[1])\r\na=int (c[2])\r\nimport math\r\nprint (math.ceil(n/a) *math.ceil(m/a))", "n,m,f=list(map(int, input().split()))\r\nif m%f==0:\r\n l1= m//f\r\nelse:\r\n l1=(m//f)+1\r\nif n%f==0:\r\n l2= n//f\r\nelse:\r\n l2=(n//f)+1\r\nprint(l1*l2)\r\n\r\n ", "inp = input()\n[n,m,a] = inp.split()\na = int(a)\nm = int(m) - 1\nn = int(n) - 1\nprint(((m // a) + 1) * ((n // a) + 1))\n", "m, n,p = input().split(\" \")\r\nm = int(m)\r\nn = int(n)\r\np= int(p)\r\n\r\nx = 0\r\ny = 1\r\nif m/p > m//p:\r\n x = (m // p)+1\r\nelse:\r\n x = m // p\r\nif n/p > n//p:\r\n y = (n // p)+1\r\nelse:\r\n y = n//p\r\nprint(x*y)\r\n\r\n", "n,m,a=map(int,input().split())\r\nf=((n//a)+(n%a!=0))*((m//a)+(m%a!=0))\r\nprint(f)", "import math\r\n\r\ndef calculate_flagstones(n, m, a):\r\n flagstones_needed = math.ceil(n / a) * math.ceil(m / a)\r\n return flagstones_needed\r\n\r\n# Example usage\r\nn, m, a = map(int, input().split())\r\nresult = calculate_flagstones(n, m, a)\r\nprint(result)\r\n", "\"\"\"\r\nA. Театральная площадь\r\nограничение по времени на тест\r\n1 second\r\nограничение по памяти на тест\r\n256 megabytes\r\nввод\r\nстандартный ввод\r\nвывод\r\nстандартный вывод\r\n\r\nТеатральная площадь в столице Берляндии представляет собой прямоугольник n × m метров.\r\nПо случаю очередного юбилея города, было принято решение о замощении площади квадратными гранитными плитами.\r\nКаждая плита имеет размер a × a.\r\nКакое наименьшее количество плит понадобится для замощения площади?\r\nРазрешено покрыть плитами большую поверхность, чем театральная площадь, но она должна быть покрыта обязательно.\r\nГранитные плиты нельзя ломать или дробить, а разрешено использовать только целиком.\r\nГраницы плит должны быть параллельны границам площади.\r\nВходные данные\r\nВ первой строке записано три целых натуральных числа n, m и a (1 ≤ n, m, a ≤ 10**9).\r\nВыходные данные\r\nВыведите искомое количество плит.\r\n\r\nВходные данные\r\n6 6 4\r\nВыходные данные\r\n4\r\n\"\"\"\r\nimport math\r\nn, m, a = map(int, input().split())\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "n,m,a=(map(int,input().split()))\r\nl=0\r\nb=0\r\nif(n%a!=0):\r\n l=1\r\nif(m%a!=0):\r\n b=1\r\nprint((l+n//a)*(b+m//a))\r\n", "import math\r\n\r\ndef main():\r\n n, m, a = map(int, input().split())\r\n needed_flagstones = math.ceil(n / a) * math.ceil(m / a)\r\n print(needed_flagstones)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = [int(x) for x in input().split()]\r\nb = (a[0] // a[2])\r\nif a[0] % a[2] != 0:\r\n b += 1\r\nc = (a[1] // a[2])\r\nif a[1] % a[2] != 0:\r\n c += 1\r\nd = b*c\r\nprint(d)", "n,m,a = map(int, input().split())\r\ny = int(n/a)\r\nY = n%a\r\nx = int(m/a)\r\nX = m%a\r\nif X != 0:\r\n x=x+1\r\n\r\nif Y != 0:\r\n y=y+1\r\nt = y*x\r\nprint (t)\r\n\r\n\r\n", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nX=ceil(n/a)\r\nY=ceil(m/a)\r\nprint(int(X*Y))", "x,y,z=map(int,input().split())\r\nif x%z==0:\r\n\ta=0\r\nelse:\r\n\ta=1\r\nif y%z==0:\r\n\ta1=0\r\nelse:\r\n\ta1=1\r\nsq=(x//z)+a\r\nsq1=(y//z)+a1\r\nprint(sq*sq1)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nwidth= math.ceil(n / a)\r\nlength= math.ceil(m / a)\r\n\r\ntotal= width*length\r\n\r\nprint(total)\r\n", "list1 = list(input().split())\r\nn = int(list1[0])\r\nm = int(list1[1])\r\na = int(list1[2])\r\nif n % a == 0:\r\n x1 = n // a\r\nelse:\r\n x1 = n // a + 1\r\nif m % a == 0:\r\n x2 = m // a\r\nelse:\r\n x2 = m // a + 1\r\nprint(x1 * x2)", "from sys import stdin\r\nfrom math import ceil\r\nn, m, a = [int(x) for x in stdin.readline().strip().split(\" \")]\r\nprint(ceil(n / a) * ceil(m / a))", "a=list(map(int,input().split(\" \")))\r\ntile1=a[0]//a[2]\r\nif a[0]%a[2]==0:\r\n pass\r\nelif a[0]%a[2]!=0:\r\n tile1 +=1\r\ntile2=a[1]//a[2]\r\nif a[1]%a[2]==0:\r\n pass\r\nelif a[1]%a[2]!=0:\r\n tile2 +=1\r\nprint(tile1 * tile2)\r\n", "n,m,a = map(int, input().split())\r\nif n%a == 0 :\r\n c = n/a\r\nelse :\r\n c = int(n/a) +1\r\nif m%a == 0 :\r\n d = m/a\r\nelse :\r\n d = int(m/a) + 1\r\n\r\nf = c*d\r\nprint(int(f))", "import math\r\na = input().split()\r\np1 = math.ceil(int(a[0])/int(a[2]))\r\np2 = math.ceil(int(a[1])/int(a[2]))\r\nprint(p1*p2)\r\n", "# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for rows and columns\r\nrows_needed = -(-n // a) # Ceiling division\r\ncols_needed = -(-m // a) # Ceiling division\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = rows_needed * cols_needed\r\n\r\n# Print the result\r\nprint(total_flagstones)\r\n", "# 1 2 3\r\nm,n,a=map(int,input().split())\r\nl=n//a\r\nif l*a<n:\r\n l+=1\r\nk=m//a\r\nif k*a<m:\r\n k+=1\r\nprint(l*k)\r\n", "n, m, a = input().split()\nn = int(n)\nm = int(m)\na = int(a)\n\nif m%a == 0:\n x = m/a\nelse:\n x = int(m/a) + 1\n\nif n%a == 0:\n x = x*n/a\nelse:\n x = x*(int(n/a)+1)\nprint(int(x))\n", "import math\r\na,b,c=map(int,input().split())\r\ns=math.ceil(a/c)\r\ns1=math.ceil(b/c)\r\nprint(s*s1)\r\n", "n1, m1, a1 = input().split(' ')\r\nsumma = 1\r\nn = int(n1)\r\nm = int(m1)\r\na = int(a1)\r\nif n > a:\r\n summa *= (n + a - 1)//a\r\nif m > a:\r\n summa *= (m + a - 1)//a\r\nprint(summa)", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n an=n//a\r\nelse:\r\n an=n//a+1\r\nif m%a==0:\r\n am=m/a\r\nelse:\r\n am=m//a+1\r\nprint(int(am*an))", "n, m, a = input().split(' ')\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n# backwards floor division (ceil)\r\nn = -(n // -a)\r\nm = -(m // -a)\r\n\r\nprint( n * m )\r\n", "from math import ceil\nn, m, a = map(int,input().split())\n \nprint(ceil(n/a)*ceil(m/a))\n\t \t \t\t \t\t \t \t \t \t", "import math\r\nm, n, a = map(int, input().split())\r\nmside_flagstone = math.ceil(n/a)\r\nnside_flagstone = math.ceil(m/a)\r\nprint(mside_flagstone * nside_flagstone)", "import math\r\nn, m, a = map(int, input().split())\r\nna = ma = 0\r\nprint(math.ceil(m / a) * math.ceil(n / a))", "import math\na,b,s=map(int,input().split())\nr=math.ceil(a/s)\nc=math.ceil(b/s)\nprint(r*c)\n\n\t\t \t \t\t \t \t\t \t \t\t\t\t\t\t \t \t\t", "n,m,a=map(int,input().split())\r\nsumma=1\r\nif n > a:\r\n summa*=(n + a - 1)//a;\r\nif m > a:\r\n summa*=(m + a - 1)//a\r\nprint(summa)", "MOD = 10 ** 9 + 7\r\n\r\nfrom heapq import *\r\nfrom queue import *\r\nimport sys, math, bisect\r\nfrom collections import Counter, defaultdict, deque\r\nfrom math import *\r\n\r\nwt = lambda x: sys.stdout.write(str(x))\r\nwtl = lambda x: wt(str(x) + '\\n')\r\nYES = lambda: wtl(\"YES\")\r\nNO = lambda: wtl(\"NO\")\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nI = lambda: int(input())\r\nII = lambda: list(map(int, input().split()))\r\nIT = lambda: tuple(map(int, input().split()))\r\nIS = lambda: input()\r\nIIS = lambda: list(input())\r\n\r\n\r\n#######################################################################\r\n\r\n\r\ndef solve():\r\n n, m, a = II()\r\n\r\n ans = ceil(n / a)\r\n\r\n rem = m - a\r\n if rem > 0:\r\n ans += ceil(rem / a) * ceil(n / a)\r\n print(ans)\r\n\r\nsolve()\r\n", "from math import *\r\nn, m, a = map(int, input().split())\r\nans = ceil(m/a) * ceil(n/a)\r\nprint(ans)", "n,m,a=map(int,input().split())\r\nc1=n//a\r\nc2=m//a\r\nif(n%a!=0):\r\n c1+=1\r\nif(m%a!=0):\r\n c2+=1\r\nprint(c1*c2)", "import math\nx,y,z= map(int, input().split())\nprint(math.ceil(x/z)*math.ceil(y/z))\n\n \n\t \t\t\t\t\t \t \t\t\t \t\t\t \t\t\t \t \t\t", "from math import ceil\r\n\r\n\r\nn,m,a = map(int, input().split())\r\n\r\nresult= ceil(n/a)*ceil(m/a)\r\nprint(result)\r\n", "from math import ceil\r\nx,y,z=map(int,input().split())\r\nprint(int(ceil(x/z)*ceil(y/z)))\r\n", "from math import ceil\r\ndef f(n,m,a):\r\n return ceil(n/a)*ceil(m/a)\r\nL=[int(x) for x in input().split()]\r\nprint(f(L[0],L[1],L[2]))", "import math\r\n\r\ndef flagstones_needed(n, m, a):\r\n # Calculate the number of flagstones needed for each dimension\r\n flagstones_n = math.ceil(n / a)\r\n flagstones_m = math.ceil(m / a)\r\n\r\n # Calculate the total number of flagstones needed\r\n total_flagstones = flagstones_n * flagstones_m\r\n\r\n return total_flagstones\r\n\r\n# Read the values of n, m, and a\r\nn, m, a = map(int, input().split())\r\n\r\n# Call the flagstones_needed function and print the result\r\nresult = flagstones_needed(n, m, a)\r\nprint(result)\r\n", "n,m,a = (input().split())\r\nx = (int(m)+(int(a)-1))//int(a)\r\ny = (int(n)+(int(a)-1))//int(a)\r\nprint (x*y)", "import math\r\nnumber =[float(num) for num in input().split(' ')]\r\nprint(math.ceil(number[0]/number[2])*math.ceil(number[1]/number[2]))", "[n, m, a] = input().split(' ')\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nif n % a != 0:\r\n n_side = (n // a) + 1\r\nelse:\r\n n_side = (n // a)\r\nif m % a != 0:\r\n m_side = (m // a) + 1\r\nelse:\r\n m_side = (m // a)\r\nprint(n_side * m_side)\r\n", "import math\r\nm, n, a = map(int,input().split())\r\ntile= math.ceil(m/a)*math.ceil(n/a)\r\nprint(tile)", "m,n,a = [int(i) for i in input().split()]\n\nif m>=a and n>=a:\n if m%a == 0 and n%a == 0:\n width = m//a\n height = n//a\n elif m%a == 0 and n%a != 0:\n width = m//a\n height = n//a + 1\n elif n%a == 0 and m%a != 0:\n width = m//a + 1\n height = n//a\n else:\n width = m//a + 1\n height = n//a + 1\nelse:\n if m==a or m<a and n<a or n==a:\n width = 1\n height = 1\n elif m>a and n==a or n<a:\n width = m//a + 1\n height = 1\n\n elif m<a and n>a:\n width = 1\n height = n//a + 1\nprint(width*height)\n", "n,m,a = input().split()\nn = int(n)\nm = int(m)\na = int(a)\nx = int( n / a)\nif n % a !=0:\n x += 1\ny = int(m/a)\nif m % a != 0:\n y+=1\nprint(x * y)\n \t\t \t \t\t\t\t\t \t \t\t\t\t \t", "n, m, a = input().split(\" \")\r\n\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n\r\nrows = n // a\r\n\r\nif n % a != 0:\r\n rows += 1\r\n\r\ncolumns = m // a\r\n\r\nif m % a != 0:\r\n columns += 1\r\n\r\nprint(rows * columns)", "import math\nn, m, a = map(int, input().split())\n\n# Calculate the minimum number of flagstones needed\nflagstones_needed = math.ceil(n / a) * math.ceil(m / a)\n\n# Print the result\nprint(flagstones_needed)\n \t\t\t \t \t \t\t\t\t\t\t\t\t \t", "n, m, o = map(int, input().split())\nx= ((n + o - 1) // o) * ((m + o - 1) // o)\nprint(x)\n\t\t\t\t \t \t\t\t \t \t\t \t\t\t \t\t\t", "import math\r\nn,m,a = map(int,input().split(\" \"))\r\nans = 1\r\nans*=math.ceil(n/a)\r\nans*=math.ceil(m/a)\r\nprint(ans)", "num1, num2, d = map(int, input().split())\r\nprint(((num1+d-1)//d)*((num2+d-1)//d))", "n,m,a=map(int,input().split())\r\nans=0\r\nq=0\r\nb=0\r\nif m%a==0:\r\n q+=m//a\r\nelse:\r\n q+=(m//a)+1\r\nif n%a==0:\r\n b+=n//a\r\nelse:\r\n b+=(n//a)+1\r\nprint(b*q)", "import math\r\ntheatre = input()\r\nrec = theatre.split(\" \")\r\na = int(rec[0])\r\nb = int(rec[1])\r\ns = int(rec[2])\r\nnum = math.ceil(a/s) * math.ceil(b/s)\r\nprint(num)", "a,b,c=map(int,input().split())\r\nif b%c==0:\r\n x=b//c\r\nelse:\r\n x=(b//c)+1\r\nif a%c==0:\r\n y=a//c\r\nelse:\r\n y=(a//c)+1\r\nprint(x*y)", "n, m, a = [int(i) for i in input().split()]\r\nb = n//a if n%a == 0 else (n//a)+1\r\nc = m//a if m%a == 0 else (m//a)+1\r\nprint(b*c)\r\n", "import math\r\n\r\nn , m , a = input().split()\r\n\r\ns = math.ceil(int(n)/int(a))\r\n\r\nt = math.ceil(int(m)/int(a))\r\n\r\nprint(s*t)", "import math\r\nn, m, a = map(int, input().split())\r\nrow_flagstones = math.ceil(n / a)\r\ncol_flagstones = math.ceil(m / a)\r\ntotal_flagstones = row_flagstones * col_flagstones\r\nprint(total_flagstones)\r\n", "m,k,n=map(int,input().split())\r\nprint(-m//n*(-k//n))", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n c=m//a\r\nelse:\r\n c=m//a+1 \r\nif n%a==0:\r\n d=n//a \r\nelse:\r\n d=n//a+1 \r\nprint(c*d)\r\n", "a, b, c = map(int, input().split()) \r\nnum_flagstones = -(-a//c) * -(-b//c)\r\nprint(num_flagstones) \r\n", "a, b, c = map(int, input().split())\r\nif (a % c == 0 and b % c == 0):\r\n print((a//c)*(b//c))\r\nelif(a % c > 0 and b % c == 0):\r\n print((a//c+1)*(b//c))\r\nelif(a % c == 0 and b % c > 0):\r\n print((a//c)*(b//c+1))\r\nelse:\r\n print((a//c+1)*(b//c+1))", "import math\r\n\r\nword = str(input())\r\nlist = word.split(\" \")\r\n\r\nlength = int(list[0])\r\nwidth = int(list[1])\r\nside = int(list[2])\r\n\r\nlength = math.ceil(length / side)\r\nwidth = math.ceil(width / side)\r\n \r\nprint(length * width)\r\n\r\n", "import math\r\n\r\ndef minimum_flagstones(n, m, a):\r\n horizontal_flagstones = math.ceil(n/a)\r\n vertical_flagstones = math.ceil(m/a)\r\n total_flagstones = horizontal_flagstones * vertical_flagstones\r\n return total_flagstones\r\nn, m, a = map(int, input().split())\r\nresult = minimum_flagstones(n, m, a)\r\nprint(result)\r\n", "from math import ceil\r\n\r\ninp = input().split()\r\nn, m, a = int(inp[0]), int(inp[1]), int(inp[2])\r\n\r\nrow = ceil(n/a)\r\ncount = row * ceil(m/a)\r\n\r\nprint(count)\r\n", "l = input().split(' ')\r\nm = int(l[0])\r\nn = int(l[1])\r\na = int(l[2])\r\nres = 0\r\nif m % a == 0:\r\n res += m // a\r\nelse:\r\n res += m // a + 1\r\nif n % a == 0:\r\n res *= n // a\r\nelse:\r\n res *= n // a + 1\r\nprint(res)", "import math\r\n\r\n# Read the inputs\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed along the length and the width of the square\r\nflagstones_along_length = math.ceil(n / a)\r\nflagstones_along_width = math.ceil(m / a)\r\n\r\n# The total number of flagstones is the product of the number of flagstones along the length and the width\r\ntotal_flagstones = flagstones_along_length * flagstones_along_width\r\n\r\nprint(total_flagstones)\r\n", "b = list(map(int, input().split()))\r\nn = int(b[0])\r\nm = int(b[1])\r\na = int(b[2])\r\nc = n // a\r\nd = m // a\r\nif n - c * a > 0:\r\n c+=1\r\nif m - d * a > 0:\r\n d+=1\r\nprint(c * d)\r\n", "n , m , a = list(map(int , input().split()))\r\nl = n // a \r\nb = m // a \r\nif n%a != 0 :\r\n l += 1\r\nif m%a != 0 :\r\n b += 1\r\nprint(l*b)", "n, m, fs = map(int, input().split())\nif n % fs == 0:\n a = n // fs\nelse:\n a = n // fs + 1\nif m % fs == 0:\n b = m // fs\nelse:\n b = m // fs + 1\nprint(a * b)", "import math\r\nm=input()\r\nn=m.split(\" \")\r\na1=math.ceil(int(n[0])/int(n[2]))\r\nb1=math.ceil(int(n[1])/int(n[2]))\r\nprint(a1*b1)\r\n", "n,m,a=map(int,input().split())\nneeded_flagstones=-(-n//a) * -(-m//a)\nprint(needed_flagstones)\n \t \t\t \t\t \t\t\t \t \t\t \t \t \t\t", "m,n,a=map(int,input().split())\r\nif m %a==0:\r\n val=m//a\r\nelse:\r\n val=m//a+1\r\nif n%a==0:\r\n val1=n//a\r\nelse:\r\n val1=n//a+1\r\nprint(val*val1)", "n, m, a= input().split()\r\nn= int(n)\r\nm= int(m)\r\na= int(a)\r\np = int((m+a-1)/a)\r\nq = int((n+a-1)/a)\r\nprint(p*q)", "n,m,a=map(int, input().split())\r\nrez=(n//a)*(m//a)\r\nif n%a!=0:\r\n rez+=(m+(a-1))//a\r\n\r\nif m%a!=0:\r\n rez+=(n-(n%a)+(a-1))//a\r\nprint(rez)", "n,m,a = map(int,input().split())\r\nif n%a == 0:\r\n\tvalue1 = n//a\r\nelse:\r\n\tvalue1 = n//a+1\r\nif m%a == 0:\r\n\tvalue2 = m//a\r\nelse:\r\n\tvalue2 = m//a+1\r\nprint(value1 * value2)", "import math\nn,m,a=map(int,input().split())\ni,j=0,0\ni=math.ceil(n/a)\nj=math.ceil(m/a)\nans=i*j\nprint(ans)\n\n", "# Function to calculate the minimum number of flagstones needed\ndef calculate_flagstones(n, m, a):\n # Calculate the number of flagstones needed for each dimension\n flagstones_n = (n + a - 1) // a # Round up n/a\n flagstones_m = (m + a - 1) // a # Round up m/a\n\n # Calculate the total number of flagstones needed\n total_flagstones = flagstones_n * flagstones_m\n\n return total_flagstones\n\n# Read the values of n, m, and a\nn, m, a = map(int, input().split())\n\n# Calculate the minimum number of flagstones needed\nresult = calculate_flagstones(n, m, a)\n\n# Print the result\nprint(result)\n\n\t\t \t\t\t\t \t \t \t\t\t \t \t \t \t\t", "ch=input()\r\ntab=ch.split()\r\nn=int(tab[0])\r\nm=int(tab[1])\r\na=int(tab[2])\r\n\r\nif (n%a)!=0:\r\n n=n+(a-(n%a))\r\nif (m%a)!=0:\r\n m=m+(a-(m%a))\r\n\r\nprint((m*n)//(a*a))\r\n\r\n", "x,y,z=map(int,input().split())\r\nif y%z==0:\r\n a=y//z\r\nelse:\r\n a=(y//z)+1\r\nif x%z==0:\r\n b=x//z\r\nelse:\r\n b=(x//z)+1\r\nprint(a*b)\r\n", "from math import ceil\r\n\r\nn,m,a = map(lambda el: int(el), input().split(' '))\r\nv = h = 0\r\n\r\nv = ceil(n / a)\r\nh = ceil(m / a)\r\n\r\nprint(f\"{v * h}\")\r\n\r\n", "n,m,a=map(int,input().split())\r\nans=1\r\nif n<=a:\r\n ans*=1\r\nelse:\r\n if int(n/a)==n/a:\r\n ans*=(int(n/a))\r\n else:\r\n ans=int(n/a)+1\r\nif m<=a:\r\n ans*=1\r\nelse:\r\n if int(m/a)==m/a:\r\n ans*=(int(m/a))\r\n else:\r\n ans*=(int(m/a)+1)\r\nprint(ans)", "ip = input().split(' ')\nip[0] = int(ip[0])\nip[1] = int(ip[1])\nip[2] = int(ip[2])\n\nt = ip[0]//ip[2]\nif(t*ip[2]<ip[0]):\n t+=1\ntt = ip[1]//ip[2]\nif(tt*ip[2]<ip[1]):\n tt+=1\nprint(t*tt)\n", "n, m, a = (int(i) for i in input().split())\r\nprint((-n//a) * (-m//a))", "import math\r\nn,m,a = map(int,input().split(\" \"))\r\nx1=math.ceil(n/a)\r\nx2=math.ceil(m/a)\r\nprint(x1*x2)", "import math\r\n\r\nn,m,a = [int(x) for x in input().split()]\r\nflag_stones = math.ceil(n/a) * math.ceil(m/a)\r\nprint(flag_stones)", "import math\r\nn, m, a = map(int, input().split())\r\n\r\ny = math.ceil(n/a)\r\nx = math.ceil(m/a)\r\nprint(x*y)", "import math\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed\r\nhorizontal_flagstones = math.ceil(n / a)\r\nvertical_flagstones = math.ceil(m / a)\r\n\r\n# Total flagstones needed is the product of horizontal and vertical flagstones\r\ntotal_flagstones = horizontal_flagstones * vertical_flagstones\r\n\r\n# Output the result\r\nprint(total_flagstones)\r\n", "import math\r\nn,m,a = map(float,input().split())\r\nrows = math.ceil(n/a)\r\ncolumns = math.ceil(m/a)\r\nresult = rows*columns\r\nprint(result)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nneeded = math.ceil(n/a)\r\nmeeded = math.ceil(m/a)\r\nans = needed * meeded\r\nprint(ans)\r\n", "from math import ceil\nn, m, a = input().split(\" \")\nn = int(n)\nm = int(m)\na = int(a)\n\nprint((-(n // -a)) * (-(m // -a)))\n", "import math\r\n\r\n\r\na = input().split()\r\nb = list(a)\r\nfor i in range(len(b)):\r\n b[i]=int(b[i])\r\nn = b[0]\r\nm = b[1]\r\na = b[2]\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a)\r\nprint(x*y)", "i = [int(i) for i in input().split()] # input separated by blank\r\nif i[0] % i[2] == 0: # if divisible, just //; else // then +1\r\n len = i[0] // i[2]\r\nelse:\r\n len = i[0] // i[2] + 1\r\nif i[1] % i[2] == 0:\r\n wid = i[1] // i[2]\r\nelse:\r\n wid = i[1] // i[2] + 1\r\nprint(len*wid)\r\n\r\n", "# Read the dimensions of the square and the side length of the flagstone\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\nnum_flagstones = ((n + a - 1) // a) * ((m + a - 1) // a)\n\n# Print the result\nprint(num_flagstones)\n\n \t \t\t \t \t\t \t \t\t \t \t\t \t", "import math\n\nprompt = input().split(' ')\nn = int(prompt[0])\nm = int(prompt[1])\na = int(prompt[2])\n\nh = (m // a + 1) if m % a else (m // a)\nv = (n // a + 1) if n % a else (n // a)\nstone_needed = h * v\nprint(stone_needed)", "n,m,a=map(int,input().split())\r\n\r\nif m%a==0:\r\n val1=m//a\r\nelse:\r\n val1=m//a + 1\r\n\r\nif n%a==0:\r\n val2=n//a\r\nelse:\r\n val2=n//a +1 \r\n\r\nprint(val1*val2)", "n , m , a = map(int , input().split() )\r\n\r\nr1 = n//a\r\nr2 = m//a\r\n\r\n\r\nif n%a != 0:\r\n r1 +=1\r\nif m%a != 0:\r\n r2 +=1\r\n\r\nprint(r1 * r2)", "n,m,a = map(int,input().split())\r\nif m%a==0:\r\n res=m//a\r\nelse:\r\n res=m//a+1\r\nif n%a==0:\r\n res1=n//a\r\nelse:\r\n res1=n//a+1\r\nprint(res*res1)", "n, m, a = map(int, input().split()) \n\nflags_for_n = -(-n // a) \nflags_for_m = -(-m // a) \n\ntotal_flags = flags_for_n * flags_for_m\n\nprint(total_flags)\n \t \t\t \t\t\t \t\t\t \t\t \t \t\t \t \t", "import math\nm,n,o=map(int,input().split())\nr=math.ceil(m/o)\nc=math.ceil(n/o)\nprint(r*c)\n\t\t\t\t\t\t\t \t \t \t\t \t \t \t\t\t \t", "import math \r\n\r\nn, m, a = input().split()\r\n\r\ntemp1 = math.ceil(int(n) / int(a))\r\ntemp2 = math.ceil(int(m) / int(a))\r\n\r\nprint(temp1*temp2)", "n, m, a = [int(x) for x in input().split()]\nf1=n//a\nf2=m//a\nif(n%a!=0):\n f1+=1\nif(m%a!=0):\n f2+=1\nf=f1*f2\nprint(f)\n \t \t \t \t \t\t\t \t\t \t\t\t\t", "from math import ceil\r\na,b,c=map(int,input().split())\r\nm=ceil(a/c)\r\nn=ceil(b/c)\r\nprint(int(m*n))\r\n", "def work(n1, n2):\r\n if int(n1/n2) != n1/n2:\r\n return int(n1/n2) + 1\r\n return n1//n2\r\n \r\na, b, n = input().split(' ')\r\na, b, n = int(a), int(b), int(n)\r\n \r\na_n = work(a, n)\r\nb_n = work(b, n)\r\nprint(a_n*b_n)", "n, m, a = map(int, input().split())\r\nif n%a != 0: \r\n sideN = (n//a)+1\r\nelse:\r\n sideN = n//a\r\nif m%a != 0: \r\n sideM = (m//a)+1\r\nelse:\r\n sideM = m//a\r\nprint(sideN * sideM)", "n, m, a = input().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n\r\nif (n%a == 0):\r\n firstRow = n//a\r\nelse:\r\n firstRow = n//a + 1\r\n\r\nif (m%a == 0):\r\n firstColumn= m//a\r\nelse:\r\n firstColumn = m//a + 1\r\n\r\noutput = firstRow * firstColumn\r\n\r\n\r\n\r\n\r\nif (n==m==a):\r\n output = 1\r\n \r\n\r\n\r\n\r\nprint(output)\r\n", "n,m,a=map(int,input().split())\r\na1=n//a\r\nif(n%a!=0):\r\n a1+=1\r\na2=m//a\r\nif(m%a!=0):\r\n a2+=1\r\nprint(a1*a2)\r\n", "n,m,p=map(int,input().split())\r\ncount=0\r\ncount1=0\r\na=n\r\nb=m\r\nn=n-p\r\nm=m-p\r\ncount=count+1\r\ncount1=count1+1\r\n \r\nif(m>0):\r\n d=m//p\r\n e=m%p\r\n if(e>0):\r\n count=count+1+d\r\n else:\r\n count=count+d\r\n \r\nif(n>0):\r\n d=n//p\r\n e=n%p\r\n if(e>0):\r\n count1=count1+d+1\r\n else:\r\n count1=count1+d\r\n \r\nprint(count*count1)", "m,n,a= list(map(int, input().split()))\r\n\r\ndef flagstones(m,n,a):\r\n flags = 0\r\n \r\n if m%a == 0:\r\n flags+=(m//a)\r\n elif m%a != 0:\r\n flags+= ((m//a)+1)\r\n if n%a ==0:\r\n flags*=(n//a)\r\n elif n%a !=0:\r\n flags*=((n//a)+1)\r\n \r\n return flags\r\n\r\n\r\n\r\nprint(flagstones(m,n,a))\r\n\r\n\r\n\r\n \r\n \r\n", "import math\r\n\r\ndef needed_flagstones(n, m, a):\r\n # Calculate the number of flagstones using the ceil function\r\n num_flagstones_n = math.ceil(n / a)\r\n num_flagstones_m = math.ceil(m / a)\r\n\r\n # Total number of flagstones required\r\n total_flagstones = num_flagstones_n * num_flagstones_m\r\n\r\n return total_flagstones\r\n\r\ndef main():\r\n n, m, a = map(int, input().split())\r\n\r\n # Calculate and print the result\r\n print(needed_flagstones(n, m, a))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\na, b, c=map(int, input().split())\r\nans=math.ceil(a/c) *math.ceil(b/c)\r\nprint(ans)\r\n\r\n", "a,b,c = input().split()\nl = int(a) // int(c)\nif int(a) % int(c) != 0:\n l += 1\nw = int(b) // int(c)\nif int(b) % int(c) != 0:\n w += 1\nprint(l * w)", "import math\r\na, b, c = list(map(int, input().split()))\r\nprint(math.ceil(a / c) * math.ceil(b / c))", "n,m,a= map(int,input().split())\r\nimport math\r\nmath.ceil(n/a) == math.ceil(m*a)\r\nx = math.ceil(n/a) * math.ceil(m/a)\r\nprint(x)\r\n ", "import math\r\n\r\ndef calculate_flagstones(n, m, a):\r\n width_flagstones = math.ceil(n / a)\r\n height_flagstones = math.ceil(m / a)\r\n total_flagstones = width_flagstones * height_flagstones\r\n return total_flagstones\r\n\r\n# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the least number of flagstones needed\r\nresult = calculate_flagstones(n, m, a)\r\n\r\n# Output the answer\r\nprint(result)", "import math\r\n\r\nn, m, a = map(int, input().split())\r\nans = (math.ceil(n/a)*math.ceil(m/a))\r\n\r\nprint(ans)", "import math\r\n\r\nins = str(input()).split()\r\nm,n,a = int(ins[0]), int(ins[1]), int(ins[2])\r\nprint(math.ceil(m /a) * math.ceil(n/a))", "n, m, a = map(int, input().split())\r\nif n%a != 0:\r\n a1 = n//a + 1\r\nif m%a != 0:\r\n a2 = m//a + 1\r\nif n%a == 0:\r\n a1 = n//a\r\nif m%a == 0:\r\n a2 = m//a\r\nprint(a1*a2)\r\n\r\n ", "import math\nn, m, a = map(int, input().split())\nwf = math.ceil(n / a)\nlf = math.ceil(m / a)\nt = wf * lf\nprint(t)\n\n\t \t\t \t \t\t\t\t\t \t \t\t \t\t\t\t \t\t\t\t\t\t", "import math\r\nx,y,z=list(map(float, input().split())) \r\nprint(math.ceil(x/z)*math.ceil(y/z))", "import math\r\ns = input()\r\nr = s.split()\r\n\r\nn = int(r[0])\r\nm = int(r[1])\r\na = int(r[2])\r\n\r\nsum = math.ceil(n / a) * math.ceil(m / a)\r\nprint(sum)", "n,m,a = map(int,input().split())\r\n\r\nbricks = side = 0\r\n\r\nbricks = n//a\r\n\r\nif n%a != 0:\r\n bricks += 1\r\n \r\ncount = m//a\r\n\r\nif m%a != 0:\r\n count += 1\r\n\r\nprint(bricks*count)\r\n", "[n,m,a] = list(map(int, input().split()))\r\nx_axis = n//a\r\ny_axix = m//a\r\nif (n/a>x_axis):\r\n x_axis = x_axis+1\r\nif (m/a>y_axix):\r\n y_axix = y_axix+1\r\nprint(x_axis*y_axix)", "import math\r\n\r\ndef min_flagstones(n, m, a):\r\n # Calculate the number of flagstones needed for length and width\r\n flagstones_length = math.ceil(n / a)\r\n flagstones_width = math.ceil(m / a)\r\n\r\n # Calculate the total number of flagstones needed\r\n total_flagstones = flagstones_length * flagstones_width\r\n\r\n return total_flagstones\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = min_flagstones(n, m, a)\r\nprint(result)", "from math import *\r\nx,y,a=map(int,input().split())\r\nprint(ceil(x/a)*ceil(y/a))", "import math\r\nn,m,a=map(int,input().split())\r\ns=math.ceil(n/a)\r\nl=math.ceil(m/a)\r\nprint(l*s)", "n, m, a = map(int, input().split())\nif n%a==0 and m%a==0 : \n num_flagstones = ((n ) // a) * ((m ) // a)\nelif n%a==0 and m%a!=0 : \n num_flagstones = ((n ) // a) * ((m+a ) // a)\nelif n%a!=0 and m%a==0 : \n num_flagstones = ((n +a) // a) * ((m ) // a)\nelse : \n num_flagstones = ((n+a ) // a) * ((m +a) // a)\n\nprint(num_flagstones)\n", "n = [int(i) for i in input().split()]\r\nw = n[1]//n[-1] + 1 if int(n[1]//n[-1]) != n[1]/n[-1] else n[1]//n[-1]\r\nl = n[0]//n[-1] + 1 if int(n[0]//n[-1]) != n[0]/n[-1] else n[0]//n[-1]\r\nprint(w * l)", "# -*- coding: utf-8 -*- \r\n# @Time : 2022/2/12 19:02 \r\n# @Author : Loui\r\nif __name__ == '__main__':\r\n m, n, a = map(int,input().split())\r\n print(int((m+a-1)/a) * int((n+a-1)/a))", "input = input(\"\")\r\nsplited_input = input.split()\r\nn = int(splited_input[0])\r\nm = int(splited_input[1])\r\na = int(splited_input[2])\r\n\r\nif n % a == 0 :\r\n width = n // a\r\nelse: \r\n width = n // a + 1\r\n\r\nif m % a == 0 :\r\n height = m // a\r\nelse: \r\n height = m // a + 1 \r\n\r\nprint (width * height)", "a,b,c = [int(x) for x in input().split()]\r\nprint(int((a-1)/c//1+1)*int((b-1)/c//1+1))", "import math\r\n\r\n# Read the input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the length and width separately\r\nneeded_length = math.ceil(n / a)\r\nneeded_width = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = needed_length * needed_width\r\n\r\n# Print the result\r\nprint(total_flagstones)\r\n", "n,m,a=map(int,input().split())\r\nif n%a == 0:\r\n v1=n//a\r\nelse:\r\n v1=(n//a)+1\r\nif m%a==0:\r\n v2=m//a\r\nelse:\r\n v2=(m//a)+1\r\nprint(v1*v2)\r\n", "n,m,a = map(int, input().split())\r\na1 = n//a if n%a == 0 else 1+n//a\r\na2 = m//a if m%a == 0 else 1+m//a\r\nprint(a1*a2)", "import math \n\ndef main():\n n,m,a = map(int,input().split(' '))\n #height to cover width of rectangle * height to cover height of rectangle \n print(math.ceil(n/a)*math.ceil(m/a))\n\nif __name__ == '__main__':\n main() \n", "n,m,a = map(int,input().split())\r\nnum = ((m+a-1)//a)*((n+a-1)//a)\r\nprint(num)", "from math import ceil\na, b, c = map(int, input().split())\n\nprint(ceil(a / c) * ceil(b / c))", "z=input()\r\ndef sqz(a,b):\r\n if a%b!=0:\r\n return int((a-a%b)/b+1)\r\n else:\r\n return int(a/b)\r\nA=[]\r\nfor x in range(len(z)):\r\n if z[x]==' ':\r\n A.append(x)\r\nm=int(z[:A[0]])\r\nn=int(z[A[0]+1:A[1]])\r\na=int(z[A[1]+1:])\r\nprint(sqz(m,a)*sqz(n,a))", "from math import ceil\n\nt = list(map(int, input().split(' '))) # [6,6,4]\n\nlist_to_pop = []\ninteger_x = t[0] // t[2]\ninteger_y = t[1] // t[2]\nmax_len_x_size = ceil(t[0] / t[2])\nmax_len_y_size = ceil(t[1] / t[2])\nanswer = max_len_x_size * max_len_y_size\nprint(answer)\n", "from math import ceil\r\nn, m, a = map(int, input().split())\r\nvert = ceil(n / a)\r\ngor = ceil(m / a)\r\nprint(vert * gor)", "#1A: Theatre Square\r\nfrom math import ceil\r\nx, y, z = [int(x) for x in input().split()]\r\n\r\nprint(ceil(x/z)*ceil(y/z))", "n,m,a=map(int,input().split())\r\ndef falgst(n,m,a):\r\n r_no=(n+a-1)//a\r\n c_no=(m+a-1)//a\r\n return r_no*c_no\r\nprint(falgst(n,m,a))\r\n", "import math\r\nn, m, a = [eval(x) for x in input().split()]\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a)\r\nz = x * y\r\nprint(z)", "from math import ceil\nif __name__ == '__main__':\n n, m, a = map(int, input().split())\n print(ceil(n/a) * ceil(m/a))\n", "m,n,a=map(int, input().split())\r\nif m%a!=0:\r\n f=0\r\n i=1\r\n\r\n while f<m:\r\n \r\n f=a*i\r\n i+=1\r\n m=f\r\nif n%a!=0:\r\n t=0\r\n i=1\r\n\r\n while t<n:\r\n \r\n t=a*i\r\n i+=1\r\n\r\n n=t\r\n\r\ns=int((m*n)/(a*a))\r\nprint(s) \r\n ", "from sys import stdout\n\nn, m, a = map(int,input().split())\nto_cover_n = n//a\nif n % a != 0:\n to_cover_n += 1\nto_cover_m = m//a\nif m % a != 0:\n to_cover_m += 1\nprint(to_cover_n*to_cover_m)\nstdout.flush()\n", "import math\r\n\r\nn, m, a = list(map(int, input().split()))\r\n\r\nheight = math.ceil(n/a)\r\nwidth = math.ceil(m/a)\r\n\r\nprint(height * width)", "import math\r\nx = input()\r\nn = int(x[ : x.find(' ')])\r\nm = int(x[x.find(' ') + 1 : x.rfind(' ')])\r\na = int(x[x.rfind(' ') + 1 : ])\r\nn1 = math.ceil( n / a)\r\nm1 = math.ceil( m / a)\r\nprint(n1 * m1)\r\n ", "import math\nn, m, a = map(int, input().split())\nwidthflagstones = math.ceil(n / a)\nlengthflagstones = math.ceil(m / a)\ntotalflagstones = widthflagstones * lengthflagstones\nprint(((((totalflagstones)))))\n \t \t \t \t \t\t\t\t \t\t \t\t \t \t", "\ndef whol_int (x):\n if (x-int (x))==0:\n return int (x)\n else :\n return int (x+1)\n \nx=input()\nNMA_var=x.split()\nn=int (NMA_var[0])\nm=int (NMA_var[1])\na=int (NMA_var[2])\n \nprint (whol_int(n/a)*whol_int(m/a))\n\t\t\t \t \t \t \t\t \t \t \t \t\t", "import math\r\n(n,m,a)=(int(x) for x in input().split())\r\ns=math.ceil(n/a)*math.ceil(m/a)\r\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Dec 25 20:41:34 2022\r\n\r\n@author: R I B\r\n\"\"\"\r\nimport sys\r\nL = []\r\nfor i in sys.stdin:\r\n L.append(i)\r\n\r\nL= [line.rstrip('\\n') for line in L if line]\r\nn=int(L[0].split()[0])\r\nm=int(L[0].split()[1])\r\na=int(L[0].split()[2])\r\nprint((n//a+int(n%a!=0))*(m//a+int(m%a!=0)))", "import math\r\n\r\n# Input: Read three positive integers n, m, and a from the user\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed\r\nneeded_flagstones = math.ceil(n / a) * math.ceil(m / a)\r\n\r\n# Output: Print the needed number of flagstones\r\nprint(needed_flagstones)\r\n", "a=list(map(int,input().split()))\r\nif a[0]%a[2]>0: \r\n k=a[0]//a[2]+1\r\nelse:\r\n k=a[0]//a[2] \r\nif a[1]%a[2]>0: \r\n j=a[1]//a[2]+1\r\nelse:\r\n j=a[1]//a[2] \r\nprint(j*k) \r\n", "from math import ceil\r\nm,n,a = [int(i) for i in input().split()]\r\nprint(ceil(m/a)*ceil(n/a))", "import math\nn,m , a = map(int,input().split())\na1 = math.ceil(n/a)\na2 = math.ceil(m/a)\nprint(a1 * a2)\n\t \t\t \t\t \t\t \t\t \t\t\t \t \t\t \t\t", "n,m,a=map(int,input().split())\r\nprint((n//a+min(1,n%a))*(m//a+min(1,m%a)))\r\n", "import math\r\nx,y,z=map(int,input().split())\r\not=math.ceil(x/z)*math.ceil(y/z)\r\nprint(ot)\r\n", "import math\r\n\r\nx = list(map(int, input().split()))\r\nn = x[0]\r\nm = x[1]\r\na = x[2]\r\nprint(((n+a-1)//a) * ((m+a-1)//a))", "import sys\r\n\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef main():\r\n n, m, a = map(int, sys.stdin.readline().split())\r\n if n % a == 0:\r\n\r\n x = n // a\r\n else:\r\n x = n // a + 1\r\n if m % a == 0:\r\n\r\n y = m // a\r\n else:\r\n y = m // a + 1\r\n\r\n print(x * y)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Mar 30 16:33:31 2022\n \n@author: ivchaa\n\"\"\"\nimport math\nn,m,a =map(int,input().split(\" \"))\n \nprint(math.ceil((n/a)) * math.ceil((m/a)))", "m, n, a = map(int,input().split(\" \"))\r\nextra1 = 0\r\nextra2 = 0\r\n\r\nif m%a != 0:\r\n extra1 = 1\r\n\r\nif n%a != 0:\r\n extra2 = 1\r\n\r\ntotalStones = (int(m/a) + extra1 ) * (int(n/a) + extra2)\r\nprint(totalStones)", "def solve():\r\n n,m,a=map(int,input().split())\r\n p=(n//a)\r\n if n%a != 0: p+=1\r\n t=(m//a)\r\n if m%a != 0: t+=1\r\n print(p*t)\r\nsolve()", "v = input()\r\nu = v.split()\r\nm= int(u[0])\r\nn = int(u[1])\r\na = int(u[2])\r\n\r\nb=((m+a-1)//a)*((n+a-1)//a)\r\nprint(b)", "inp = input()\r\nfor x in range(0, len(inp)):\r\n if inp[x] == \" \":\r\n n = inp[0:x]\r\n inp2 = inp[(x+1):-1]+inp[-1]\r\n for y in range(1, len(inp2)):\r\n if inp2[y] == \" \":\r\n m = inp2[0:y]\r\n a = inp2[(y+1):-1]+inp2[-1]\r\n break\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nif n % a == 0:\r\n b = n / a\r\nelse:\r\n b = int(n / a) +1\r\nif m % a == 0:\r\n c = m / a\r\nelse:\r\n c = int(m / a) +1\r\nprint(int(b*c))", "import math\r\nn,m,a = map(int,input().split())\r\ntotal= math.ceil(n/a)*math.ceil(m/a)\r\nprint(total)", "import math\nn = list(input().split())\na = math.ceil(int(n[0])/int(n[2]))\nb = math.ceil(int(n[1])/int(n[2]))\nprint(a*b)", "import math\r\n\r\n# Input: n, m, a (dimensions of Theater Square and granite slab)\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of slabs required\r\nslabs_required = math.ceil(n/a) * math.ceil(m/a)\r\n\r\n# Output the result\r\nprint(slabs_required)", "x = input().split(\" \")\r\na = int(x[0])\r\nb = int(x[1])\r\nc = int(x[2])\r\n\r\nm = -(-a//c)\r\nn = -(-b//c)\r\nprint(m*n)", "from math import ceil\r\n\r\ndef main():\r\n n, m, a = map(int, input().split())\r\n\r\n print(ceil(n/a)*ceil(m/a))\r\n \r\nmain()\r\n", "from math import ceil\r\nn,m,a=map(int,input().split())\r\nv=ceil(n/a)\r\nb=ceil(m/a)\r\nprint(ceil(v*b))", "n, m, a = map(int, input().split())\r\n\r\ntiles_n = (n + a - 1) // a\r\ntiles_m = (m + a - 1) // a\r\n\r\ntotal_tiles = tiles_n * tiles_m\r\n\r\nprint(total_tiles)", "n, m, a = map(int, input().split())\r\nrows = (n + a - 1) // a\r\ncolumns = (m + a - 1) // a\r\ntotal_flagstones = rows * columns\r\nprint(total_flagstones)\r\n", "n,m,a = list(map(int,input().split()))\r\nadder1 = 1 if n%a != 0 else 0\r\nadder2 = 1 if m%a != 0 else 0\r\nsol = (n//a + adder1) * (m//a + adder2)\r\nprint(sol)", "n,m,a=list(map(int,input().split()))\r\nresult=((-n//a)*(-m//a))\r\nprint(result)", "import math\n\nn, m, b = map(int, input().split())\n\nwidth_flagstones = math.ceil(n / b)\nheight_flagstones = math.ceil(m / b)\ntotal_flagstones = width_flagstones * height_flagstones\n\nprint(total_flagstones)\n \t\t\t \t\t\t\t\t\t \t\t\t \t \t \t\t", "x,y,z=map(int,input().split())\nif x % z == 0 :\n a =int(x/z)\nelse:\n a = int((x/z))+1\nif y % z == 0 :\n b =int(y/z)\nelse:\n b= int(y/z)+1\n\nprint(int((a*b)))\n\n\"\"\"\n# string:\nstring = input()\nstring= string.lower()\nst=len(string)\n#li=list(string.split( ))\n#newlist=[\"a\",\"e\"]\nfor i in range(st):\n if string[i] != \"a\" and string[i]!= \"i\" and string[i]!= \"e\" and string[i]!= \"o\" and string[i]!= \"u\" and string[i]!= \"y\" :\n\n print(\".\"+ string[i],end=\"\")\n\n\"\"\"\n\n\n\n\n", "n, m, a = map(int,input().split())\r\ndl = m // a\r\nif m % a != 0:\r\n dl += 1\r\nh = n // a\r\nif n % a != 0:\r\n h += 1\r\nprint(dl * h)\r\n\r\n\r\n", "n,m,a=map(int,input().split()) \r\n\r\nif n % a != 0 and m % a != 0:\r\n print((int(n / a) + 1) * (int(m / a) + 1))\r\nelif n % a == 0 and m % a == 0:\r\n print(int(n / a) * int(m / a))\r\nelif n % a == 0 and m % a != 0:\r\n print(int(n / a) * (int(m / a) + 1))\r\nelif n % a != 0 and m % a == 0:\r\n print((int(n / a) + 1) * int(m / a))", "n,m,a=map(int,input().split())\r\njd=n//a\r\nif n%a!=0:\r\n jd+=1\r\ndr=m//a\r\nif m%a!=0:\r\n dr+=1\r\nprint(jd*dr)", "def f(n,m,a):\r\n if n%a!=0:\r\n if m%a!=0:\r\n return ((n+a-n%a)*(m+a-m%a))//(a*a)\r\n return ((n+a-n%a)*m)//(a*a)\r\n if m%a!=0:\r\n return ((m+a-m%a)*n)//(a*a)\r\n return (m*n)//(a*a)\r\nn,m,a=map(int,input().split())\r\nprint(f(n,m,a))", "import math\r\n\r\nsizes = input()\r\n\r\nsizes = sizes.split(' ')\r\nn = int(sizes[0])\r\nm = int(sizes[1])\r\na = int(sizes[2])\r\n\r\ntotal = math.ceil(m / a) * math.ceil(n / a)\r\n\r\nprint(total)\r\n", "ls = list(map(int, input().split()))\nn = ls[0]\nm = ls[1]\na = ls[2]\n\n\nx = n//a\ny = m//a\nif (n % a != 0):\n\tx = x + 1\nif (m % a != 0):\n\ty = y + 1\n\nf = x*y\nprint(f)\n", "n, m, a = map(int, input().split())\r\nnum_flagstones_n = n // a\r\nnum_flagstones_m = m // a\r\nif n % a != 0:\r\n num_flagstones_n += 1\r\nif m % a != 0:\r\n num_flagstones_m += 1\r\nnum_flagstones = num_flagstones_n * num_flagstones_m\r\nprint(num_flagstones)", "import math\r\n\r\nn, m, a = list(map(float, input().split()))\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "n,m,a=map(int,input().split())\r\nx=0\r\ny=0\r\nif n%a==0:\r\n x=n//a\r\nelse:\r\n x=n//a+1\r\nif m%a==0:\r\n y=m//a\r\nelse:\r\n y=m//a+1\r\nprint(x*y)", "n, m, a = map(int, input().split())\r\n\r\nw = n // a\r\nif w * a < n: w += 1\r\nh = m // a\r\nif h * a < m: h += 1\r\n\r\nprint(w * h)\n# Sun Apr 17 2022 08:02:11 GMT+0000 (Coordinated Universal Time)\n\n# Sun Apr 17 2022 08:02:17 GMT+0000 (Coordinated Universal Time)\n", "n , m , a = input().split()\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nif n%a!=0:\r\n n+=a-(n%a)\r\nif m%a!=0:\r\n m+=a-(m%a)\r\n\r\nprint(int((n/a)*(m/a)))", "m,n,a=map(int,input().split(' '))\r\nprint((m//-a)*(n//-a))", "n, m, a = map(int, input().split())\r\n\r\nif n % a == 0:\r\n f = n // a\r\nelse:\r\n f = (n // a) + 1\r\n\r\nif m % a == 0:\r\n k = m // a\r\nelse:\r\n k = (m // a) + 1\r\n\r\nh = k * f\r\nprint(h)\r\n", "x,y,z=map(int,input().split())\nprint(-x//z*(-y//z))\n\t \t\t \t\t\t\t\t\t \t \t \t\t\t \t\t\t\t\t\t \t\t\t", "a,b,c=map(int,input().split());\r\nx=0\r\nt=0\r\nif a%c==0:\r\n x=a/c\r\nelse :\r\n x=a//c+1\r\nif b%c==0:\r\n t=b/c\r\nelse:\r\n t=b//c+1 \r\n \r\nprint(int(x*t)); \r\n", "import math\r\nn,m,a=[int(n) for n in input().split()]\r\nprint(math.ceil(n/a)*math.ceil(m/a))", "from math import ceil\n\nn, m, a = (int(i) for i in input().split())\n\nx = ceil(n / a)\ny = ceil(m / a)\nprint(x * y)\n\n", "x = input()\r\n\r\nm = int(x[0: x.index(\" \")])\r\nn = int(x[x.index(\" \") + 1: x.index(\" \", x.index(\" \") + 1)])\r\na = int(x[x.index(\" \", x.index(\" \") + 1):])\r\n\r\ny = None\r\n\r\nif(m % a == 0):\r\n y = m//a\r\n\r\nelif(a > m):\r\n y = 1\r\n\r\nelse:\r\n y = m//a + 1\r\n\r\nif(n % a == 0):\r\n y *= n//a\r\n\r\nelif(a > n):\r\n y *= 1\r\n\r\nelse:\r\n y *= (n//a + 1)\r\n\r\nprint(y)", "from math import ceil\r\nx,y,z = map(float,input().split())\r\ns = ceil(x/z)*ceil(y/z)\r\nprint(s)", "arr = []\r\narr = input().split()\r\narr = [int(item) for item in arr]\r\nn = arr[0]\r\nm = arr[1]\r\na = arr[2]\r\nx = n // a\r\nif n % a != 0:\r\n x += 1\r\ny = m // a\r\nif m % a != 0:\r\n y += 1\r\nprint(x * y)", "# Contest 1A \n# Theatre Square.py\n\nimport math\n\ndef main():\n n, m, a = map(int, input().split())\n print(math.ceil(n/a) * math.ceil(m/a))\n\nif __name__ == \"__main__\":\n main()\n", "width, length, square = map(int, input().split())\r\n\r\ntemp1 = 0\r\ntemp2 = 0\r\n\r\nif width % square == 0 :\r\n temp1 = (int)(width / square)\r\nelse :\r\n temp1 = (int)(width / square) + 1\r\nif length % square == 0 :\r\n temp2 = (int)(length / square)\r\nelse :\r\n temp2 = (int)(length / square) + 1\r\nprint(temp1 * temp2)", "n,m,a = map(int,input().split())\r\nn = n // a + (n % a != 0)\r\nm = m // a + (m % a != 0)\r\nprint(n*m)", "n, m, a = list(map(int, input().split()))\r\ndef helper(x, a):\r\n if x % a == 0:\r\n return x // a\r\n return (x//a)+1\r\n\r\nprint(helper(n, a)*helper(m, a))\r\n", "n,m,x = input().split()\r\nm = int(m)\r\nn = int(n)\r\nx = int(x)\r\n\r\ncity = n/x\r\nif n%x:\r\n city += 1\r\ncity = int(city)\r\n\r\ncity1 = m/x\r\nif m%x:\r\n city1 += 1\r\ncity1= int(city1)\r\nprint(city1*city)", "[n,m,a]=[int(x) for x in input().split()];\r\n\r\nif n%a==0:\r\n res=n//a;\r\nelse:\r\n res=(n//a)+1;\r\n\r\nif m%a==0:\r\n res*=(m//a);\r\nelse:\r\n res*=(m//a)+1;\r\n\r\nprint(res);\r\n", "n, m, a = map(int, input().split())\r\nimport math\r\nsp = n * m\r\nspl = a**2\r\n\r\nif sp <= spl:\r\n print(1)\r\nelse:\r\n if a > 1:\r\n print( math.ceil(m/a)*math.ceil(n/a))\r\n else:\r\n print(sp)", "import math\r\nnums = str.split(input(), \" \")\r\nn = int(nums[0])\r\nm = int(nums[1])\r\na = int(nums[2])\r\nx = math.ceil(n / a)\r\ny = math.ceil(m / a)\r\nprint(x*y)", "n, m, a = map(int, input().split())\r\n\r\ntotal = (n // a + int(n % a != 0)) * (m // a + int(m % a != 0))\r\nprint(total)", "import math as mt\r\nn, m, a, =[int(i) for i in input().split()]\r\nprint(mt.ceil(n / a) * mt.ceil(m / a))", "a=input().split(' ')\r\nn=int(a[0])\r\nm=int(a[1])\r\na=int(a[2])\r\nh=0\r\nw=0\r\nif n % a ==0:\r\n h=int(n/a)\r\nelse :\r\n h=(n//a)+1\r\nif m%a == 0:\r\n w=int(m/a)\r\nelse:\r\n w=(m//a)+1\r\nprint(h*w)", "# LUOGU_RID: 113990193\nlength, width, a = map(int,input().split())\r\nif ((length/a)-int(length/a)==0):\r\n num_l = int(length/a)\r\nelif((length/a)-int(length/a)>0):\r\n num_l = int(length/a) + 1\r\nif ((width/a)-int(width/a)==0):\r\n num_w = int(width/a)\r\nelif((width/a)-int(width/a)>0):\r\n num_w = int(width/a) + 1\r\n\r\nans = num_l * num_w\r\nprint(ans)", "nums = [int(a) for a in input().split()]\r\nn = nums[0]\r\nm = nums[1]\r\nb = nums[2]\r\nif n%b == 0:\r\n h = n//b\r\nelse:\r\n h = 1 + n//b\r\nif m%b == 0:\r\n v = m//b\r\nelse:\r\n v = 1 + m//b\r\nprint(h*v)", "def ciel(x):\r\n if x-int(x)>0:\r\n return int(x)+1\r\n else: return int(x)\r\ninp = input()\r\nn = int(inp[:inp.find(' ')])\r\nm = int(inp[inp.find(' ')+1:inp.find(' ',(inp.find(' ')+1))])\r\na = int(inp[inp.find(' ',(inp.find(' ')+1))+1:])\r\nans = ciel(m/a)*ciel(n/a)\r\nprint(ans)", "n,m,a=map(int,input().split())\r\nnf=((n+a-1)//a)*((m+a-1)//a)\r\nprint(nf)", "import math\r\n\r\nzadacha = input().split()\r\nn = int(zadacha[0])\r\nm = int(zadacha[1])\r\na = int(zadacha[2])\r\nc = math.ceil(n/a)\r\nd = math.ceil(m/a)\r\nkolvo = c * d\r\nprint(kolvo)", "from math import ceil\r\n\r\ndef main():\r\n n, m, a = map(int, input().split())\r\n print(int(ceil(m / a)) * int(ceil(n / a)))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n ,m ,a= map(int,input().split())\r\nc=n/a\r\nr=m/a\r\nif int(r)== r:\r\n pass\r\nelse:\r\n r=int(r)+1\r\nif int(c)==c:\r\n pass\r\nelse:\r\n c= int(c) + 1\r\nprint(int(c*r))\r\n ", "import math\r\nn,m,a=[int(c) for c in input().split()]\r\nprint(int(math.ceil(n/a)*math.ceil(m/a)))", "n, m, a = map(float, input().split())\nresult = -(-n // a) * -(-m // a)\nprint(int(result))\n\t\t\t \t\t\t \t\t\t\t\t \t\t\t \t \t\t \t", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the width and length of the Square\r\nwidth = (n + a - 1) // a\r\nlength = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal = width * length\r\n\r\nprint(total)\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nimport math\r\n\r\nn, m, a = list(map(int, input().split()))\r\n \r\nout = math.ceil(n / a) * math.ceil(m / a)\r\n \r\nprint(out)", "n, m , a = map(int, input().split())\r\n\r\nheight = n // a + (n % a != 0)\r\nwidth = m // a + (m % a != 0)\r\n\r\nflagstones = height*width\r\nprint(flagstones)", "import math\r\n\r\n\r\nentrada = input().split()\r\nn = int(entrada[0])\r\nm = int(entrada[1])\r\na = int(entrada[2])\r\n\r\nif n <= a and m <= a:\r\n print(1)\r\n\r\nelif m <= a:\r\n print(math.ceil(n/a))\r\nelif n <= a:\r\n print(math.ceil(m/a))\r\nelse:\r\n print(math.ceil(m/a) * math.ceil(n/a)) \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "if __name__ == \"__main__\":\n n, m, a = (int(x) for x in input().split())\n n1 = 0\n n2 = 0\n if n % a == 0:\n n1 = (n // a)\n else:\n n1 = (n // a) + 1\n if m % a == 0:\n n2 = (m // a)\n else:\n n2 = (m // a) + 1\n \n print(n1 * n2)", "from math import ceil\r\n \r\nif __name__=='__main__':\r\n n, m, a = list(map(int, input().split()))\r\n solve = ceil(n/a)*ceil(m/a)\r\n print(solve)", "from math import *\r\nn, m, a = map(int, input().split())\r\nx = ceil(n/a)\r\ny = ceil(m/a)\r\nprint(x*y)", "import math\n\ndef least_flagstones(a, w, e):\n return math.ceil(a/e) * math.ceil(w/e)\n\na, w, e = map(int, input().split())\nprint(least_flagstones(a, w, e))\n \t \t \t \t \t\t\t\t \t\t \t\t\t \t\t", "n,m,a=map(int,input().split())\r\nf=n//a\r\nif n%a>0:\r\n f=f+1\r\nb=m//a\r\nif m%a>0:\r\n b=b+1\r\ne=f*b\r\nprint(e)\r\n", "from math import ceil\r\nn,k,a=map(int,input().split())\r\nprint(ceil(n/a)*ceil(k/a))", "import math\n\ndef least_flagstones(b, m, a):\n return math.ceil(b/a) * math.ceil(m/a)\n\nb, m, a = map(int, input().split())\nprint(least_flagstones(b, m, a))\n\t \t\t \t \t\t \t \t \t \t \t\t \t \t", "a,b,p=map(int,input().split());print(a//-p*(b//-p))", "#2\r\nimport math\r\nn,m,a=map(int,input().split())\r\nprint(math.ceil(m/a)* math.ceil(n/a))", "from math import ceil \nn,m,a=input().split() \nn,m,a=int(n),int(m),int(a) \nc=ceil(n/a)*ceil(m/a) \nprint(c) \n \t\t\t\t\t \t \t\t\t \t \t \t \t\t\t", "import math\r\n\r\n# Input\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the needed number of flagstones\r\nnumber_of_flagstones = math.ceil(n / a) * math.ceil(m / a)\r\n\r\n# Output the result\r\nprint(number_of_flagstones)\r\n", "from math import ceil\r\nlst = [int(i) for i in input().split()]\r\nprint(ceil(lst[0] / lst[2]) * ceil(lst[1] / lst[2]))", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n# calculate the number of flagstones needed in each direction\r\nflagstones_n = math.ceil(n / a)\r\nflagstones_m = math.ceil(m / a)\r\n\r\n# calculate the total number of flagstones needed\r\ntotal_flagstones = flagstones_n * flagstones_m\r\n\r\nprint(total_flagstones)\r\n", "from math import ceil\r\nn,m,a=(int(x) for x in input().split())\r\nx=ceil(n/a)\r\ny=ceil(m/a)\r\nprint(x*y)", "import math\n\ndef flagstones_needed(n, m, a):\n # Calculate the number of flagstones needed in each dimension\n horizontal = math.ceil(n / a)\n vertical = math.ceil(m / a)\n \n # Return the total number of flagstones needed\n return horizontal * vertical\n\n# Read input from the user\nn, m, a = map(int, input().split())\n\n# Calculate and print the result\nresult = flagstones_needed(n, m, a)\nprint(result)\n\n\t\t \t\t\t \t\t \t\t \t\t\t \t\t \t\t \t", "from math import ceil\r\nm,n,a = tuple(map(int,input().strip().split(' ')))\r\nprint(ceil(m/a)*ceil(n/a))", "import math\n\n# Input\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones required to cover the Square\nsquare_flagstones = math.ceil(n / a) * math.ceil(m / a)\n\nprint(square_flagstones)\n\n \t \t \t\t\t\t \t\t \t \t \t \t \t\t\t \t\t", "n,m,a=map(int,input().split())\r\n\r\nif n%a == 0:\r\n num1=n//a\r\nelse:\r\n num1=(n//a) +1 \r\nif m%a == 0 :\r\n num2=m//a\r\nelse :\r\n num2 =(m//a) + 1\r\n\r\nprint(num1*num2)", "x,y,z =map(int,input().split()) \r\n \r\nif y%z==0: \r\n r1=y//z \r\nelse: \r\n r1=y//z+1 \r\n \r\nif x%z==0: \r\n r2=x//z \r\nelse: \r\n r2=x//z+1 \r\n \r\nprint(r1*r2) ", "import math\n\nn,m,blocksize = list(map(int, input().split()))\n\nxb = math.ceil(n/blocksize)\nyb = math.ceil(m/blocksize)\n\nprint(xb*yb)", "from math import ceil\r\nline = input().split()\r\nn = int(line[1])\r\nm = int(line[0])\r\na = int(line[2])\r\nres = ceil(n/a)*ceil(m/a)\r\nprint(res)\r\n", "import math\r\nn,m,a = [int(c) for c in input().split()]\r\nn=math.ceil(n/a)\r\nm=math.ceil(m/a)\r\nprint(n*m)", "n,m,x = input().split()\nm = int(m)\nn = int(n)\nx = int(x)\n\ncity = n/x\nif n%x:\n city += 1\ncity = int(city)\n\ncity1 = m/x\nif m%x:\n city1 += 1\ncity1= int(city1)\nprint(city1*city)\n \t\t\t \t\t \t\t\t \t\t\t\t \t \t", "n,m,a = [int(i) for i in input().split()]\r\nif n%a != 0:\r\n length = n//a + 1\r\nelse: \r\n length = n//a\r\nif m%a != 0:\r\n width = m//a + 1\r\nelse:\r\n width = m//a\r\nprint(length*width)", "\r\nimport math\r\nn,m,a=map(int,input().split())\r\nc=math.ceil(n/a)\r\nprint(c+(math.ceil((m-a)/a))*c)", "import sys\r\nfrom math import ceil\r\n\r\n\r\ntest = \"\"\"6 6 4\r\n\"\"\".splitlines()\r\n\r\n\r\ndef main(x):\r\n m, n, a = [int(y) for y in x[0].split()]\r\n h = ceil(m / a)\r\n w = ceil(n / a)\r\n sys.stdout.write(f\"{h * w}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # main(test)\r\n main(sys.stdin.readlines())", "n,m,a = [int(x) for x in input('').split()]\r\nif m%a == 0 and n%a == 0:\r\n z = m/a\r\n y = n/a\r\n q = y*z\r\n w = int(q)\r\n print(w)\r\nelif m%a == 0 and n%a != 0:\r\n z = m/a\r\n y = (n//a) + 1\r\n q = y*z\r\n w = int(q)\r\n print(w)\r\nelif m%a != 0 and n%a == 0:\r\n z = (m//a) +1\r\n y = n/a\r\n q = y*z\r\n w = int(q)\r\n print(w)\r\nelse:\r\n z = (m//a) + 1\r\n y = (n//a) + 1\r\n q = y*z\r\n w = int(q)\r\n print(w)\r\n", "def foo(n, m, a):\r\n i = n // a + (1 if n % a else 0)\r\n j = m // a + (1 if m % a else 0)\r\n return i * j\r\n\r\nls = list(map(int, input().split()))\r\nn, m, a = ls[0], ls[1], ls[2]\r\nprint(foo(n, m, a))", "import math\r\nx1,x2,x3 = [int(x) for x in input().split()]\r\nn1=math.ceil(x1/x3)\r\nif n1*x3<x1:\r\n n1=n1+1\r\nn2=math.ceil(x2/x3)\r\nif n2*x3<x2:\r\n n2=n2+1\r\nksum=n1*n2\r\nprint(ksum )", "import math\r\nn = list(map(int,input().split()))\r\nprint(math.ceil((n[0]/n[2]))*(math.ceil(n[1]/n[2])))", "n, m, a = input().split()\na = int(a)\nn = int(n)\nm = int(m)\nx = int(n/a)\nif n % a != 0:\n x += 1\ny = int(m/a)\nif m % a != 0:\n y += 1\nprint(x*y)\n\n\t\t\t \t\t \t\t \t\t\t\t \t\t \t \t\t \t", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n b = m // a\r\nelse:\r\n b = (m // a)+1\r\nif n%a==0:\r\n c = n // a\r\nelse:\r\n c =(n // a)+1\r\nprint(b*c)", "import math\n\ndef least_flagstones(I, m, a):\n return math.ceil(I/a) * math.ceil(m/a)\n\nI, m, a = map(int, input().split())\nprint(least_flagstones(I, m, a))\n\t \t \t \t\t\t \t\t\t\t \t \t\t\t\t \t\t \t", "n, m, a = map(int, input().split())\r\n\r\nif n % a != 0:\r\n l1 = (n // a) + 1\r\nelse:\r\n l1 = n // a\r\n\r\nif m % a != 0:\r\n l2 = (m // a) + 1\r\nelse:\r\n l2 = m // a\r\n\r\nans = l1 * l2\r\nprint(ans)", "def cut(a, b):\r\n if a % b == 0:\r\n return a//b\r\n else:\r\n return a//b+1\r\n\r\ndef count(a, b, c):\r\n return cut(a, c)*cut(b, c)\r\n\r\nn, m, a = input().split()\r\nn, m, a = int(n), int(m), int(a)\r\n\r\nprint(count(n,m,a))", "import math\r\ns=[int(x)for x in input().split()]\r\nn,m,a=s[0],s[1],s[2]\r\nif (m==a and n>=1) or ( n==m) or (n==a and m>=1):\r\n print(math.ceil(m/a)*math.ceil(n/a))\r\nelif n>a and m>a:\r\n l=math.ceil(n/a)\r\n b=math.ceil(m/a)\r\n print(l*b)\r\nelif (n==a and m==a):\r\n print(1)\r\nelse:\r\n print(1)", "length = input().split()\r\nimport math\r\na = math.ceil(int(length[0]) / int(length[2]))\r\nb = math.ceil(int(length[1]) / int(length[2]))\r\nprint(a * b)", "n, m, a = map(int, input().split())\r\nn = n // a + (n % a > 0)\r\nm = m // a + (m % a > 0)\r\nprint(n * m)", "import math\r\n\r\nn, m, a = input().split()\r\nprint(math.ceil(int(n)/int(a))*math.ceil(int(m)/int(a)))", "import math\n\n# Read input values\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed along the length and width\nlength_flagstones = math.ceil(n / a)\nwidth_flagstones = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = length_flagstones * width_flagstones\n\n# Print the result\nprint(total_flagstones)\n\n\t\t \t\t\t\t \t\t \t\t \t \t\t \t", "n,m,k = map(int,input().split())\r\nrow = [n + k-(n%k),n][n%k==0]\r\ncol = [m +k-(m%k),m][m%k==0]\r\nprint(row*col//(k**2))", "from math import ceil\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\n\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\ndef main(x):\n n, m, a = x\n return ceil(n/a) * ceil(m/a)\n\nx = inlt()\nprint(main(x))\n\n# if __name__ == \"__main__\":\n# x = \"6 6 4\"\n# result = main(x)\n# print(result)", "x=input()\r\ny=x.split()\r\nn=int(y[0])\r\nm=int(y[1])\r\na=int(y[2])\r\nif n%a==0:\r\n l=n/a\r\nelse:\r\n l=(n//a)+1\r\nif m%a==0:\r\n b=m/a\r\nelse:\r\n b=(m//a)+1\r\nprint(int(l*b))", "import math\r\nn,m,a=map(int,input().split())\r\nx=math.ceil(int(n)/int(a))\r\ny=math.ceil(int(m)/int(a)) \r\nz=x*y\r\nprint(z)", "n,m,a=[int(x) for x in input().split()] \r\nq=(n-1)//a+1\r\nz=(m-1)//a+1\r\nprint(q*z)", "n,m,a=map(int,input().split())\r\nt=((n//a)+(1 if n%a !=0 else 0))*((m//a)+(1 if m%a!=0 else 0))\r\nprint(t)\r\n\r\n\r\n", "\r\na=list(map(int,input().strip().split()))\r\n\r\nleng =a[0]//a[2]\r\nif a[0]%a[2]!=0:\r\n leng+=1\r\nbre =a[1]//a[2]\r\nif a[1]%a[2]!=0:\r\n bre+=1\r\nprint(leng*bre)\r\n", "a,b,c=map(int,input().split()) \r\n \r\nif b%c==0: \r\n r1=b//c \r\nelse: \r\n r1=b//c+1 \r\n \r\nif a%c==0: \r\n r2=a//c \r\nelse: \r\n r2=a//c+1 \r\n \r\nprint(r1*r2)", "from math import ceil\r\n \r\nm, n, a = tuple(map(int, input().split()))\r\nresult = ceil(m / a) * ceil(n / a)\r\nprint(result)", "n, m, a = map(int, input().split())\r\n\r\nif (n % a == 0):\r\n res1= n // a\r\nelse:\r\n res1 = 1 + (n // a)\r\n\r\nif (m % a == 0):\r\n res2= m // a\r\nelse:\r\n res2 = 1 + (m // a)\r\n\r\ns = res1 * res2\r\nprint(s)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 15 22:30:24 2023\r\n\r\n@author: 39996\r\n\"\"\"\r\n\r\nn,m,a=[int(x) for x in input().split()]\r\nif n%a==0:\r\n N=int(n/a)\r\nelse:\r\n N=int(n/a)+1\r\nif m%a==0:\r\n M=int(m/a)\r\nelse:\r\n M=int(m/a)+1\r\nprint(M*N)\r\n\r\n\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nsquare = n*m\r\nflagstone = a*a\r\n\r\n\r\nif flagstone >= square or a == 1 and square>a:\r\n if round(square/flagstone) == 0:\r\n print(1)\r\n else:\r\n print(round(square/flagstone))\r\nelse:\r\n print(math.ceil(m/a) * math.ceil(n/a))\r\n", "from math import ceil\r\nn, m, a = input().split(\" \")\r\nn, m, a = int(n), int(m), int(a)\r\nprint(ceil(n/a) * ceil(m/a))", "n,m,a = map(int, input().split())\r\n\r\nif n%a == 0:\r\n n = n//a\r\nelse:\r\n n = n//a + 1\r\n\r\nif m%a == 0:\r\n m = m//a\r\nelse:\r\n m = m//a + 1\r\n\r\nprint(n*m)", "import sys\r\n\r\n\r\ndef get_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int_list():\r\n return list(get_ints())\r\n\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\nn, m, a = get_ints()\r\n\r\nrows = n // a\r\nif rows * a < n:\r\n rows += 1\r\n\r\ncolums = m // a\r\nif colums * a < m:\r\n colums += 1\r\n\r\nprint(rows * colums)\r\n", "def calc(n,a):\r\n if n%a == 0:\r\n return n//a\r\n else:\r\n return n//a + 1\r\n\r\nn,m,a=[int(x) for x in input().split()]\r\nwidth=calc(n,a)\r\nlength=calc(m,a)\r\nprint(width * length)", "import math\r\n\r\nn, m, a = map(float, input().split())\r\nbase = n / a\r\naltura = m / a\r\nprint(math.ceil(base) * math.ceil(altura))", "#==============NEVER GIVE UP=========================\r\n#===========ALLAH ALMIGHT WILL HELP==================\r\n#==================YOU==============================\r\nj,i,n=map(int,input().split())\r\nprint(-j//n*(-i//n))", "from math import ceil\r\np,q,a=map(int,input().split())\r\nM=ceil(p/a)\r\nN=ceil(q/a)\r\nprint(int(M*N))", "n,m,a=(map(int,input().split()))\r\nif n%a!=0:\r\n n=n+(a-(n%a))\r\nif m%a!=0:\r\n m=m+(a-(m%a))\r\nprint(int((n*m)/(a*a)))", "x,y,z=map(int,input().split())\ns=((y+z-1)//z)\nr=((x+z-1)//z)\nprint(s*r)#56\n \t\t\t\t \t \t \t\t\t\t \t \t \t\t\t\t \t\t\t \t", "m,n,a=map(int,input().split())\r\nc=m//a\r\nd=n//a\r\nif m%a !=0:\r\n if n%a==0:\r\n print(d*(c+1))\r\n if n%a!=0:\r\n print((c+1)*(d+1))\r\nelse:\r\n if n%a==0:\r\n print(d*c)\r\n if n%a!=0:\r\n print(c*(d+1))", "import math\r\n\r\nm,n,a = input().split()\r\nprint(math.ceil(int(m)/int(a))*math.ceil(int(n)/int(a)))", "from math import ceil\r\nn,m,a = map(int,input().split())\r\nprint(int((ceil(n/a))*(ceil(m/a))))", "from sys import stdin\n\nif __name__ == '__main__':\n n, m, a = map(int, stdin.readline().split())\n i = -(n // -a)\n j = -(m // -a)\n print(i * j)\n", "input=list(map(lambda x: int(x),input().split()))\r\nn=input[0]\r\nm=input[1]\r\na=input[2]\r\ndef find_x(n,a):\r\n if n%a==0:\r\n return n//a\r\n else:\r\n return n//a+1\r\ndef find_y(m,a):\r\n if m%a==0:\r\n return m//a\r\n else:\r\n return m//a+1\r\nx=find_x(n,a)\r\ny=find_y(m,a)\r\nprint(int(x*y))", "def solve(n, m, a):\n return ((n + a - 1) // a) * ((m + a - 1) // a)\n\nn, m, a = map(int, input().strip().split())\nprint(solve(n, m, a))\n", "import math\r\ninp=input().split()\r\nn=int(inp[0])\r\nm=int(inp[1])\r\na=int(inp[2])\r\nans=math.ceil(n/a)*math.ceil(m/a)\r\nprint(ans)", "from math import ceil\n\n\ndef calc(n: int, m: int, a: int) -> int:\n return ceil(n / a) * ceil(m / a)\n\n\nif __name__ == \"__main__\":\n n, m, a, *_ = list(map(int, input().split()))\n print(calc(n, m, a))\n", "# S VINAY\r\nimport math\r\nn,m,a=map(int,input().split())\r\nres=math.ceil(n/a)*math.ceil(m/a)\r\nprint(res)", "n, m, a = input().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\n\r\nnum_along_length = (n / a)\r\nif num_along_length > (n//a):\r\n num_along_length = int(num_along_length) + 1\r\nelse:\r\n num_along_length = n // a\r\n\r\nnum_along_breadth = (m / a)\r\nif num_along_breadth > (m//a):\r\n num_along_breadth = int(num_along_breadth) + 1\r\nelse:\r\n num_along_breadth = m // a\r\n\r\ntotalNum = int(num_along_breadth * num_along_length)\r\nprint(totalNum)", "import math\r\na = [int(i) for i in input().split()]\r\nprint(math.ceil(a[0]/a[2])*math.ceil(a[1]/a[2]))", "x, y, z = [int(x) for x in input().split()]\r\nif x%z==0:\r\n n1=int(x/z)\r\nelse:\r\n n1=int(x/z)+1\r\nif y%z==0:\r\n n2=int(y/z)\r\nelse:\r\n n2=int(y/z)+1\r\nprint(n1*n2)\r\n", "import math\r\n\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nwidth_stones = math.ceil(n / a)\r\nlength_stones = math.ceil(m / a)\r\n\r\ntotal_stones = width_stones * length_stones\r\n\r\nprint(total_stones)\r\n", "n, m, a = map(int, input().split())\r\n\r\nif round(m/a) < (m/a):\r\n height = round(m/a)+1\r\nelse:\r\n height = round(m/a)\r\n\r\nif round(n/a) < (n/a):\r\n width = round(n/a)+1\r\nelse:\r\n width = round(n/a)\r\n\r\nnum_flagstones = width * height\r\n\r\nprint(num_flagstones)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 25 13:50:00 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 60 - CF1-A\r\n\"\"\"\r\nimport math\r\nn,m,a = map(int,input().split())\r\nprint(math.ceil(n/a) * math.ceil(m/a))", "n, m, a = map(int, input().split())\r\n\r\nrows = n // a + int(n % a > 0)\r\n\r\ncols = m // a + int(m % a > 0)\r\n\r\nprint(rows * cols)", "m,n,a=map(int,input().split())\r\nt=0\r\nif m%a >0 :\r\n m=m//a+1\r\nelse:\r\n m=m//a\r\nif n%a >0 :\r\n n=n//a+1\r\nelse:\r\n n=n//a\r\nt=t+m*n\r\nprint(t)\r\n \r\n \r\n\r\n", "n, m, a = map(int, input().split())\nif n%a == 0:\n l1 = n//a\nelse: \n l1 = n//a+1\n\nif m%a == 0:\n l2 = m//a\nelse: \n l2 = m//a+1\nprint(l1*l2)\n \t \t \t\t\t\t \t \t \t \t", "import math\r\na,b,c=map(int,input().split())\r\nprint(math.ceil(b/c)*math.ceil(a/c))", "n,m,a=map(int, input().split())\r\nif n%a==0 and m%a==0:print((n//a)*(m//a))\r\nelif n%a==0:print((n//a)*(m//a+1))\r\nelif m%a==0:print((n//a+1)*(m//a))\r\nelse:print((n//a+1)*(m//a+1))", "import sys\r\n\r\n# Constants\r\nINF = float('inf')\r\nMOD = 1000000007\r\n\r\n# Faster Input\r\ndef read_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef read_n_int():\r\n return map(int, sys.stdin.readline().split())\r\n\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\n# Faster Output\r\ndef print_yes_no(condition):\r\n print('YES' if condition else 'NO')\r\n \r\ndef print_array(arr, sep=' '):\r\n print(sep.join(map(str, arr)))\r\n\r\n\r\n# Main Function\r\ndef solve():\r\n n, m, k = read_n_int()\r\n\r\n # vartical axis\r\n if m%k==0:\r\n count = m//k\r\n else:\r\n count = m//k + 1 \r\n\r\n\r\n if n%k==0:\r\n count2 = n//k \r\n else:\r\n count2 = n//k + 1\r\n\r\n print(count*count2)\r\nif __name__ == '__main__':\r\n solve()\r\n", "n,m,a=map(int,input().split())\r\nif n%a ==0:\r\n x=n//a\r\nelse:\r\n x=n//a +1\r\nif m%a ==0:\r\n y=m//a\r\nelse:\r\n y=m//a+1\r\nprint(x*y)", "ch = str(input())\r\n\r\nlst = ch.split(\" \")\r\n\r\nfilterLst = []\r\n\r\nfor i in range(0,len(lst)):\r\n num = int(lst[i])\r\n\r\n filterLst.append(num)\r\n\r\nm = filterLst[0]\r\n\r\nn = filterLst[1]\r\n\r\na = filterLst[2]\r\n\r\n#CALCULATE COMPLETE LENGHT FROM FIRST SIDE (m)\r\n\r\nflagsInm = 0\r\n\r\ncFlagstonesm = m//a\r\n\r\nflagsInm += cFlagstonesm\r\n\r\nif m%a != 0:\r\n flagsInm += 1\r\n\r\n\r\n#CALCULATE COMPLETE LENGHT FROM FIRST SIDE (n)\r\n\r\nflagsInn = 0\r\n\r\ncFlagstonesn = n//a\r\n\r\nflagsInn += cFlagstonesn\r\n\r\nif n%a != 0:\r\n flagsInn += 1\r\n\r\n#CALCULATE FINAL ANSWER\r\n\r\nans = flagsInm * flagsInn\r\n\r\nprint(ans)", "import math\r\nN, M, A = input().split()\r\nn = int(N)\r\nm = int(M)\r\na = int(A)\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "n,m,a=map(int,input().split())\r\nif n%a!=0: p=(n//a)+1\r\nelse: p=n//a\r\nif m%a!=0: l=(m//a)+1\r\nelse: l=m//a\r\nprint(p*l)", "n1, m1, a1 = map(int, input().split())\n\n# Calculate the number of flagstones needed\nflagst = ((n1 + a1 - 1) // a1) * ((m1 + a1 - 1) // a1)\n\nprint(flagst)\n\t \t \t \t \t \t\t\t\t\t \t\t\t \t\t \t\t", "from math import ceil\nX,Y,Z = list(map(int,input().split()))\nA = ceil(X/Z)\nB = ceil(Y/Z)\nprint(int(A*B))\n \t \t \t \t \t\t \t \t\t\t\t \t\t", "import math\r\ndata = [int(x) for x in input().split()]\r\nprint(math.ceil(data[0] / data[2]) * math.ceil(data[1] / data[2]))", "import math\r\n\r\n# Read input values\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for each dimension\r\nnum_flagstones_n = math.ceil(n / a)\r\nnum_flagstones_m = math.ceil(m / a)\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = num_flagstones_n * num_flagstones_m\r\n\r\n# Print the result\r\nprint(total_flagstones)\r\n", "import math\r\n\r\ndef flagstones_needed(n, m, a):\r\n rows = math.ceil(n / a)\r\n cols = math.ceil(m / a)\r\n \r\n\r\n return rows * cols\r\n\r\n\r\nn, m, a = map(int, input().split())\r\n\r\n\r\nneeded_flagstones = flagstones_needed(n, m, a)\r\n\r\nprint(needed_flagstones)\r\n", "n,m,a=map(int,input().split())\r\nk=(n+a-1)//a\r\nr=(m+a-1)//a\r\nprint(k*r)", "import math\r\narr = input().split()\r\nm = int(arr[0])\r\nn = int(arr[1])\r\na = int(arr[2])\r\ndef theatreSquare(m, n, a):\r\n topSide = math.ceil(n/a)\r\n leftSide = math.ceil(m/a)\r\n return topSide*leftSide\r\nprint(theatreSquare(m,n,a))", "import math\r\nN, M, a=map(int, input().split(' '))\r\nprint((math.ceil(N/a)*math.ceil(M/a)))\r\n", "import math\n\n\ndef bonAppetit(n, m, a):\n return math.ceil(n / a) * math.ceil(m / a)\n\n\nif __name__ == '__main__':\n N, M, A = input().rstrip().split()\n\n N = int(N)\n\n M = int(M)\n\n A = int(A)\n\n print(bonAppetit(N, M, A))\n", "# Read the input\nq, w, e = map(int, input().split())\n\n# Calculate the number of flagstones needed\nflagstones_needed = ((q + e - 1) // e) * ((w + e - 1) // e)\n\n# Print the number of flagstones needed\nprint(flagstones_needed)\n##v\n \t\t \t\t\t \t \t\t\t \t\t\t\t \t \t\t", "n, m, a = map(int, input().split())\r\n\r\nif m%a == 0:\r\n side_a = m//a\r\nelse:\r\n side_a = (m//a)+1\r\n\r\nif n%a == 0:\r\n side_b = n//a\r\nelse:\r\n side_b = (n//a)+1\r\n\r\nprint(side_a*side_b)", "n, m, a =map(int,input().split())\nneed_flagstone=0\nx=m//a\nif (m%a > 0):\n x+=1\ny=n//a\nif (n%a > 0):\n y+=1\nneed_flagstone= x*y\nprint(need_flagstone)\n\t\t \t\t \t\t \t \t \t \t \t \t\t \t\t", "import math\ndef main():\n dms=[]\n ins = input()\n dms = ins.split()\n d1 = int(dms[0])/int(dms[2]);\n d2 = int(dms[1])/int(dms[2]);\n print(math.ceil(d1)*math.ceil(d2))\nmain()", "import math\r\nn,m,a=list(map(int,input().split(\" \")))\r\narea=n*m\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "a=input().split()\r\nb=int(a[0])//int(a[2])\r\nc=int(a[1])//int(a[2])\r\nif int(a[0])%int(a[2]) >0:\r\n b=b+1\r\nif int(a[1])%int(a[2]) >0:\r\n c=c+1\r\nprint(b*c)", "from math import ceil\r\n\r\nn,m,a = map(int,input().split())\r\n\r\nx = int(ceil(n/a)*ceil(m/a))\r\nprint(x)", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for width and length\r\nflagstones_width = (n + a - 1) // a # Ceiling division to account for remainder\r\nflagstones_length = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = flagstones_width * flagstones_length\r\n\r\n# Print the result\r\nprint(total_flagstones)", "n,m,a=map(int , input().split())\r\ntotal1=0\r\ntotal2=0\r\n\r\nif(n%a==0):\r\n total1=total1+n//a\r\nelse:\r\n total1=total1+n//a+1\r\nif(m%a==0):\r\n total2=total2+m//a\r\nelse:\r\n total2=total2+m//a+1\r\nprint(total1*total2)", "x, y, z = [int(x) for x in input().split()]\r\nresx = 0\r\nresy = 0\r\nif x % z == 0:\r\n resx += x/z\r\nelse:\r\n resx += int(x/z) +1\r\nif y % z == 0:\r\n resy += y/z\r\nelse:\r\n resy += int(y/z) +1\r\nprint(int(resx * resy))", "n, m, a = map(int, input().split()) # Read n, m, and a\r\n\r\n# Calculate the number of flagstones needed for each dimension\r\nflagstones_n = (n + a - 1) // a # Round up division\r\nflagstones_m = (m + a - 1) // a # Round up division\r\n\r\n# Calculate the total number of flagstones needed\r\ntotal_flagstones = flagstones_n * flagstones_m\r\n\r\nprint(total_flagstones) # Print the result\r\n", "import math\r\n\r\ndef main():\r\n n, m, a = map(int, input().split())\r\n flagstones_needed = math.ceil(n/a) * math.ceil(m/a)\r\n print(flagstones_needed)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled32.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1r2sT1YOHXEcOkHEnYjqrRkDVYewH_SCi\n\"\"\"\n\nn, m, a = map(int, input().split(\" \"))\nif m%a == 0: #false \n val1 = m // a\nelse:\n val1 = m // a + 1\nif n%a == 0: #false\n val2 = n // a\nelse:\n val2 = n // a + 1\n\nprint(val1*val2)", "n,m,a = map(int,input().split())\r\nx = n//a\r\ny = m//a\r\nif n%a != 0:\r\n x +=1\r\nif m%a != 0:\r\n y +=1\r\nprint(x*y)", "import math\r\na,b,c= map(int,input().split())\r\n\r\nd = math.ceil(a/c)\r\ne = math.ceil(b/c)\r\n\r\nprint(d*e)", "n,m,a=map(int,input().rstrip().split())\r\nsq=(n//a+(n%a!=0))*(m//a+(m%a!=0))\r\nprint(sq)", "# LUOGU_RID: 126581921\na,b,c=map(int,input().split())\nif a%c==0:\n a/=c\nelse:\n a=a//c+1\nif b%c==0:\n b/=c\nelse:\n b=b//c+1\nprint(int(a*b))", "string = input().split()\r\nn = int(string[0])\r\nm = int(string[1])\r\na = int(string[2])\r\n\r\nnumber1 = (n+a-1)//a\r\nnumber2 = (m+a-1)//a\r\nnumber = number1 * number2\r\n\r\nprint(number)", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n, m, a = map(int, input().split())\n print(((n + a - 1) // a) * ((m + a - 1) // a))\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", "n, m, a = map(int, input().split())\n\nrow = n // a\ncol = m // a\n\nif n % a != 0:\n row += 1\n\nif m % a != 0:\n col += 1\n\nprint(row * col)\n", "def side(a, b):\r\n if a % b == 0:\r\n return a // b \r\n return a // b + 1\r\n\r\ndef main():\r\n \r\n data = list(map(int, input().split()))\r\n n = data[0]\r\n m = data[1]\r\n a = data[2]\r\n\r\n print(side(n, a) * side(m, a))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m,a=[int(i) for i in input().split()]\r\nres=((n+a-1)//a)*((m+a-1)//a)\r\nprint(res)", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones required for the width\r\nwidth_flagstones = (n + a - 1) // a\r\n\r\n# Calculate the number of flagstones required for the length\r\nlength_flagstones = (m + a - 1) // a\r\n\r\n# Multiply to get the total number of flagstones needed\r\ntotal_flagstones = width_flagstones * length_flagstones\r\n\r\nprint(total_flagstones)\r\n", "import math\r\n\r\nm, n, a = [int(x) for x in input().split()]\r\n\r\ng = math.ceil(n/a)\r\nj = math.ceil(m/a)\r\n\r\nprint(g*j)", "import math\nn,m,a=map(int,input().split())\nans=math.ceil(n/a)*math.ceil(m/a)\nprint(ans) #23\n \t\t \t\t\t \t\t \t \t\t \t \t \t\t\t", "import math\n\ndef least_flagstones(a, b, d):\n return math.ceil(a/d) * math.ceil(b/d)\n\na, b, d = map(int, input().split())\nprint(least_flagstones(a, b, d))\n\t\t \t \t \t\t\t\t\t\t \t \t \t \t\t\t \t \t\t", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n w=n//a\r\nelse:\r\n w=n//a+1\r\nif m%a==0:\r\n w*=m//a\r\nelse:\r\n w*=m//a+1\r\nprint(w)\r\n ", "n, m, a = [int(x) for x in input().split()]\nif (n % a == 0):\n s1 = n//a\nelse:\n s1 = n//a + 1\nif (m % a == 0):\n s2 = m//a\nelse:\n s2 = m//a+1\nprint(s1*s2)\n", "m,n,a=map(int,input().split())\r\nx=m//a if m%a==0 else m//a+1\r\ny=n//a if n%a==0 else n//a+1\r\nprint(x*y)", "import math\nnn, m, aa = map(int, input().split())\nflagstones = math.ceil(nn / aa) * math.ceil(m / aa)\nprint(flagstones)\n\n \t \t \t\t \t\t\t \t \t\t\t", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n b=n//a\r\nelse:\r\n b=n//a+1\r\nif m%a==0:\r\n c=m//a\r\nelse:\r\n c=m//a+1\r\nprint(b*c)", "import math\nn_1, m_1, a_1 = map(int, input().split())\nif m_1%a_1 == 0:\n s= m_1//a_1\nelse:\n s= m_1//a_1 + 1\nif n_1%a_1 == 0:\n d= n_1//a_1\nelse:\n d=n_1//a_1+1\nprint(s*d)\n\n\n\n\t\t \t \t\t\t\t \t \t\t\t\t\t\t\t \t\t \t\n\t \t \t \t\t \t \t \t\t \t\t", "# Problem: A. Theatre Square\r\n# Contest: Codeforces - Codeforces Beta Round 1\r\n# URL: https://codeforces.com/problemset/problem/1/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nfrom collections import defaultdict\r\nn,m,a=map(int,input().split())\r\nif n%a==0:\r\n\tp=n//a\r\nelse:\r\n\tp=(n//a)+1\r\nif m%a==0:\r\n\tq=m//a\r\nelse:\r\n\tq=(m//a)+1\r\nprint(p*q)\r\n\t", "import math\r\nx = list(map(int, input().split()))\r\na = math.ceil(x[0] / x[2])\r\nb = math.ceil(x[1] / x[2])\r\nprint(a*b)\r\n", "import math\n\nj, c, d = map(int, input().split())\n\nnum_flagstones = math.ceil(j/d) * math.ceil(c/d)\n\nprint(num_flagstones)\n\n \t\t\t\t \t \t \t\t\t \t \t \t \t", "n,m,a=map(int,input().split())\r\nb=[]\r\ncnt=1\r\nif n%a==0:\r\n b.append(n//a)\r\nelse:\r\n b.append((n//a)+1)\r\nif m%a==0:\r\n b.append(m//a)\r\nelse:\r\n b.append((m//a)+1)\r\nfor i in b:\r\n cnt*=i\r\nprint(cnt)", "import math\r\nn,m,a = input().split(' ')\r\nn,m,a = int(n),int(m),int(a)\r\nprint(math.ceil((m/a))*math.ceil(n/a))", "n,m,a = [int(x) for x in input(\"\").split()]\r\nprint(-(-n//a) * -(-m//a))\r\n", "n,m,a = map(int, input().split(' '))\r\nrow= 0\r\ncol = 0\r\n\r\nif n % a == 0:\r\n row = n // a\r\n\r\nelse:\r\n row = n // a + 1\r\n\r\nif m % a == 0:\r\n col = m // a\r\n\r\nelse:\r\n col = m // a + 1\r\n\r\n\r\nprint(row*col)\r\n\r\n", "# Link: https://codeforces.com/contest/1/problem/A\r\n\r\nimport math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nif a >= n and a >= m:\r\n print(1)\r\nelif a == 1:\r\n print(m * n)\r\nelse:\r\n squares_on_columns = int(math.ceil(n / a))\r\n squares_on_rows = int(math.ceil(m / a))\r\n print(squares_on_columns * squares_on_rows)", "n,m,a=map(int,input().split())\r\nl1=n//-a\r\nl2=m//-a\r\nprint(l1*l2)", "import math\r\n\r\n# Read the dimensions of the square and the size of the flagstone\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed\r\n# Round up the division results using math.ceil\r\nnum_flagstones = math.ceil(n/a) * math.ceil(m/a)\r\n\r\n# Output the result\r\nprint(num_flagstones)\r\n", "n, m, a = map(int, input().split())\nif (n>=1 and n<=10**9) and (m>=1 and m<=10**9) and (a>=1 and a<=10**9):\n width_flagstones = -(-n // a) # Equivalent to math.ceil(n / a)\n length_flagstones = -(-m // a) # Equivalent to math.ceil(m / a)\n total_flagstones = width_flagstones * length_flagstones\n\nprint(total_flagstones)\n\n \t\t \t\t\t\t \t\t\t \t\t\t\t \t \t \t \t", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nw_count = math.ceil(n / a)\r\n\r\nl_count = math.ceil(m / a)\r\n\r\ntotal_flagstones = w_count * l_count\r\n\r\nprint(total_flagstones)\r\n", "q,w,e=map(int,input().split())\nf=((q+e-1)//e)*((w+e-1)//e)\nprint(f)\n#ms\n \t \t\t \t\t \t \t\t\t \t \t\t \t \t\t", "import math\r\nn,m,a=map(int,input().split())\r\nsol=(math.ceil(m/a)*math.ceil(n/a))\r\nprint(sol)", "import math\r\nn,m,a = map(int,input().split())\r\nans = math.ceil(n/a) * math.ceil((m/a))\r\nprint(int(ans))", "arr=list(map(int,input().split()))\r\nn=arr[0]\r\nm=arr[1]\r\na=arr[2]\r\nlen=m//a\r\nif m%a!=0:\r\n len+=1\r\nbre=n//a\r\nif n%a!=0:\r\n bre+=1\r\nprint(len*bre) \r\n ", "x , y , z = map(int,input().split())\r\n\r\nwidth = x // z\r\nheight = y // z\r\n\r\nif x%z !=0:\r\n width +=1\r\nif y%z !=0:\r\n height +=1\r\n\r\ntotalarea = width * height\r\n\r\nprint(totalarea)", "n,m,a = list(map(int,input().split()))\r\n\r\nl = n%a\r\nif l != 0:\r\n l = a-l\r\n n = n+l\r\n\r\nw = m%a\r\nif w!=0:\r\n w = a-w\r\n m = m+w\r\n# print(n,m, n*m, a**2)\r\nx = (n*m)//(a**2)\r\nprint(x)", "x, y, z = input('').split()\r\nprint(( (int(x) % int(z) > 0)+ int(x) // int(z)) * ( (int(y) % int(z) > 0) + int(y) // int(z)))", "from math import ceil\r\n\r\n\r\nn, m, a = [int(x) for x in input().split()]\r\nprint(ceil(n/a)*ceil(m/a))", "\r\nm,n,a = map(int, input().split())\r\nprint((m//a+bool(m%a))*(bool(n%a)+n//a))", "'''\nn = int(input())\nnums = list(map(int, input().split()))\nnumsSum = sum(nums)\n\nif(numsSum % 3 == 0): \n start = 0\n end = n-1\n a = nums[start]\n b = nums[end]\n numsSum -= a\n numsSum -= b\n ans = 0\n while(start < end - 2 and a <= numsSum and b <= numsSum):\n if(a < b):\n start += 1\n a += nums[start]\n numsSum -= nums[start]\n elif(b < a):\n end -= 1\n b += nums[end]\n numsSum -= nums[end]\n elif(a == b != numsSum):\n if(nums[start+1] == 0):\n start += 1\n elif(nums[end - 1] == 0):\n end -= 1\n else:\n start += 1\n a += nums[start]\n numsSum -= nums[start]\n else:\n if(set(nums[start+1:end]) == set([0])):\n ans += int((end - start) * (end - start - 1) / 2)\n break\n else:\n aCount = 1\n bCount = 1\n while(nums[start+1] == 0):\n start += 1\n aCount += 1\n while(nums[end-1] == 0):\n end -= 1\n bCount += 1\n ans += aCount * bCount\n start += 1\n print(ans)\n \nelse:\n print(0)\n'''\n'''\nt = int(input())\nfor t in range(t):\n n = int(input())\n reds = list(map(int, input().split()))\n m = int(input())\n blues = list(map(int, input().split()))\n a, b = 0, 0\n ans = 0\n total = 0\n while(a < n or b < m ):\n if(a == n ):\n total += blues[b]\n b += 1\n elif(b == m):\n total += reds[a]\n a += 1\n elif(reds[a] > blues[b] and reds[a] > 0):\n total += reds[a]\n a += 1\n elif(b < m - 1 and reds[a] < blues[b] and blues[b] > 0):\n total += blues[b]\n b += 1\n else:\n add = 0\n rSum = 0\n bSum = 0\n while(rSum <= 0 and bSum <= 0):\n if(a + add >= n and b + add >= m):\n a += add\n b += add\n break\n if(a + add <= n-1):\n rSum += reds[a + add]\n if(b + add <= m-1):\n bSum += blues[b + add]\n add += 1\n if(rSum > 0):\n a += add\n total += rSum\n elif(bSum > 0):\n b += add\n total += bSum\n ans = max(ans, total)\n print(ans)\n'''\n'''\nn = int(input())\ngrid = []\npaths = [[0] * n for i in range(n)]\nfor i in range(n):\n grid.append(list(map(str, [char for char in input()])))\nif(grid[0][0] == '*'):\n print(0)\nelse:\n cur = [[0,0]]\n next = set()\n paths[0][0] = 1\n for i in range(2*n-1):\n for cor in cur:\n y = cor[0]\n x = cor[1]\n if(y != 0):\n paths[y][x] += paths[y-1][x]\n if(x != 0):\n paths[y][x] += paths[y][x-1]\n if(y != n-1):\n if(grid[y+1][x] != '*'):\n next.add((y+1, x))\n if(x != n-1):\n if(grid[y][x+1] != '*'):\n next.add((y, x+1))\n cur = list(next)\n next = set()\n print(paths[-1][-1])\n'''\n'''\nn, m = map(int, input().split())\nfCor = list(map(int, input().split()))\nbCor = list(map(int, input().split()))\nf = input()\nb = input()\ngrid = [[0, [0,0], [0,0], 0, 0] * n for i in range(m)]\ngrid[0][0][1] = fCor\ngrid[0][0][2] = bCor\ncur = set((0,0))\nnext = set()\nwhile(cur):\n for cor in cur:\n a, b, c = 10**9, 10**9, 10**9\n y, x = cor[0], cor[1]\n if(y > 0):\n a = grid[y-1][x][0]\n if(x > 0):\n b = grid[y][x-1][0]\n if(y > 0 and x > 0):\n c = grid[y-1][x-1][0]\n fAdd = [0,0]\n bAdd = [0,0]\n if(a != 10**9):\n bCor = grid[y-1][x][1]\n bIndex = grid[y-1][x][3]\n'''\n'''\nt = int(input())\nfor t in range(t):\n n = int(input())\n s = input()\n t = input()\n index = 0\n a = s.replace('b', '')\n b = t.replace('b', '')\n if(a != b):\n print('NO')\n continue\n sCount = 0\n tCount = 0\n yes = True\n for i in range(n):\n if(s[i] == 'a'):\n sCount += 1\n if(t[i] == 'a'):\n tCount += 1\n if(tCount > sCount):\n yes = False\n break\n if(not yes):\n print('NO')\n continue\n sCount = 0\n tCount = 0\n yes = True\n for i in range(n):\n if(s[i] == 'c'):\n sCount += 1\n if(t[i] == 'c'):\n tCount += 1\n if(sCount > tCount):\n yes = False\n break\n if(not yes):\n print('NO')\n continue\n print('YES')\n'''\n'''\nn = int(input())\npaths = [[] for i in range(n+1)]\ntree = [[] for i in range(n+1)]\nfor i in range(n-1):\n a, b = map(int, input().split())\n paths[a].append(b)\n paths[b].append(a)\n\ndef search(start, count, x, prev):\n global paths\n global tree\n next = paths[x]\n count += 1\n if(prev in paths[x]):\n paths[x].remove(prev)\n if(len(paths[x]) > 1):\n count += len(paths[x])\n tree[start] = [paths[x], count]\n for path in paths[x]:\n search(path, 0, path, x)\n elif(len(paths[x]) == 0):\n tree[start] = [[], count]\n return\n else:\n search(start, count, paths[x][0], x)\n\nsearch(1, 0, 1, 0)\n\ncur = [1]\nnext = []\nprint(tree)\nans = 0\nwhile(cur):\n for x in cur:\n for num in tree[x][0]:\n next.append(num)\n ans += math.ceil(math.log2(tree[x][1]))\n trig = tree[x][1] - (len(tree[x][0])+1)\n ans += int(trig*(trig+1)/2)\n ans += (trig+1)*len(tree[x][0])\n cur = next\n next = []\nprint(ans)\n'''\n'''\nt = int(input())\nfor t in range(t):\n n = int(input())\n a = input()\n b = input()\n ans = 10**9\n if(a == b):\n print(0)\n continue\n mCount = [0,0]\n nmCount = [0,0]\n for i in range(n):\n if(a[i] == b[i]):\n mCount[int(a[i])] += 1\n else:\n nmCount[int(a[i])] += 1\n if(mCount[0] == mCount[1]-1):\n ans = sum(mCount)\n if(nmCount[0] == nmCount[1]):\n ans = min(sum(nmCount), ans)\n if(ans != 10**9):\n print(ans)\n else:\n print(-1)\n'''\n'''\nn = int(input())\ncows = []\nfor i in range(n):\n cows.append(list(map(int, input().split())))\ncows.sort(key = lambda x:x[0])\nfor i in range(n):\n cows[i][0] = i+1\ncows.sort(key = lambda x:x[1])\nfor i in range(n):\n cows[i][1] = i+1\ngrid = [[0] * (n+1) for i in range(n+1)]\nfor cow in cows:\n grid[cow[1]][cow[0]] = 1\nfor i in range(1, n+1):\n for j in range(1, n+1):\n grid[i][j] += grid[i-1][j] + grid[i][j-1] - grid[i-1][j-1]\nans = n + 1\nfor i in range(n):\n for j in range(i+1, n):\n cow1 = cows[i]\n cow2 = cows[j]\n x1,y1 = min(cow1[0], cow2[0]), min(cow2[1], cow1[1])\n x2,y2 = max(cow1[0], cow2[0]), max(cow2[1], cow1[1])\n high, low = 1,1\n high = grid[-1][x2] - grid[-1][x1-1] - grid[y2][x2] + grid[y2][x1-1] + 1\n low = grid[y1-1][x2] - grid[y1-1][x1-1] + 1\n ans += high * low\nprint(ans)\n'''\n'''\nn = int(input())\neCows = []\nnCows = []\ncows = [[] for i in range(n)]\nfor i in range(n):\n cow = input().split()\n if(cow[0] == 'E'):\n eCows.append([int(cow[1]),int(cow[2]),i])\n else:\n nCows.append([int(cow[1]),int(cow[2]),i])\neCows.sort(key=lambda x:x[1])\nnCows.sort(key=lambda x:x[0])\niters = max(len(eCows), len(nCows))\nfor i in range(math.ceil(math.sqrt(iters))):\n nextCows = [[] for i in range(n)]\n for eCow in eCows:\n for nCow in nCows:\n if(nCow[0] > eCow[0] and nCow[1] < eCow[1]):\n if(eCow[1] - nCow[1] < nCow[0] - eCow[0] and (cows[nCow[2]] == [] or cows[nCow[2]][0] >= eCow[1]-nCow[1])):\n nextCows[eCow[2]]= [nCow[0] - eCow[0], nCow[2]]\n continue\n for nCow in nCows:\n for eCow in eCows:\n if(nCow[0] > eCow[0] and nCow[1] < eCow[1]):\n if(eCow[1] - nCow[1] > nCow[0] - eCow[0] and (cows[eCow[2]] == [] or cows[eCow[2]][0] >= nCow[0]-eCow[0])):\n nextCows[nCow[2]] = [eCow[1] - nCow[1], eCow[2]]\n continue\n cows = nextCows\nans = [0] * n\nfor i in range(n):\n cow = cows[i]\n if(cow != []):\n curCow = cow[1]\n curTime = cow[0]\n ans[curCow] += 1\n while(True):\n if(cows[curCow] == []):\n break\n else:\n curCow = cows[curCow][1]\n ans[curCow] += 1\nfor num in ans:\n print(num)\n'''\n'''\nn, k = map(int, input().split())\nmoves = [[] for i in range (n+1)]\nans = [0] * n\nfor i in range(k):\n a,b = map(int, input().split())\n moves[a].append([b, i])\n moves[b].append([a, i])\nstart = 0\nprevCount = -1\ndef dfs(pos, time, positions):\n global start\n global moves\n global ans\n global prevCount\n positions.add(pos)\n if(moves[pos] == []):\n ans[start-1] = len(positions)\n return\n if(pos == start and (prevCount == len(positions))):\n ans[start-1] = len(positions)\n return\n if(pos == start and len(positions) != 1):\n prevCount = len(positions)\n if(moves[pos][-1][1] <= time):\n time = moves[pos][0][1]\n pos = moves[pos][0][0]\n dfs(pos, time, positions)\n else:\n for move in moves[pos]:\n if(move[1] > time):\n time = move[1]\n pos = move[0]\n dfs(pos, time, positions)\n break\nfor i in range(1, n+1):\n start = i\n prevCount = -1\n dfs(i, -1, set())\nfor num in ans:\n print(num)\n'''\n'''\nn, q = map(int, input().split())\nfence = input()\nfor q in range(q):\n a, b = map(int, input().split())\n sec = fence[:a-1]\n uniqs = list(set(sec))\n strokes = len(uniqs)\n up = [0] * len(uniqs)\n for i in range(a-2):\n if(len(sec) > 1 and sec[i] > sec[i+1]):\n if(up[uniqs.index(sec[i])] == 1):\n strokes += 1\n up[uniqs.index(sec[i])] = abs(up[uniqs.index(sec[i])]-1)\n if(len(sec) > 1 and sec[-1] > sec[-2] and up[uniqs.index(sec[-1])] == 1):\n strokes += 1\n sec = fence[b:]\n uniqs = list(set(sec))\n up = [0] * len(uniqs)\n strokes += len(uniqs)\n for i in range(n-b-1):\n if(len(sec) > 1 and sec[i] > sec[i+1]):\n if(up[uniqs.index(sec[i])] == 1):\n strokes += 1\n up[uniqs.index(sec[i])] = abs(up[uniqs.index(sec[i])]-1)\n if(len(sec) > 1 and sec[-1] > sec[-2] and up[uniqs.index(sec[-1])] == 1):\n strokes += 1\n print(strokes)\n'''\n'''\nm, s = map(int, input().split())\nif((m > 1 and s == 0) or s > m*9):\n print(\"-1 -1\")\nelif(m == 1 and s == 0):\n print(\"0 0\")\nelse:\n minNum, maxNum = \"\", \"\"\n minNum = \"1\" * m\n num = s\n num -= m\n for i in range(m-1, -1, -1):\n minNum = minNum[:i] + str(int(minNum[i]) + min(8, num)) + minNum[i+1:]\n num -= min(8, num)\n maxNum = \"1\" * m\n num = s\n num -= m\n for i in range(m):\n maxNum = maxNum[:i] + str(int(maxNum[i]) + min(8, num)) + maxNum[i+1:]\n num -= min(8, num)\n print(maxNum)\n'''\n'''\nn, k = map(int, input().split())\ncows = [i for i in range(1, n+1)]\nstates = [set() for i in range(k)]\npos = [set() for i in range(n)]\nmoves = []\nfor i in range(n):\n pos[i].add(cows[i])\nfor i in range(k):\n moves.append(list(map(int, input().split())))\ni = 0\nwhile True:\n move = moves[i]\n prevLen = len(states[i])\n a, b = move[0], move[1]\n cow1, cow2 = cows[a-1], cows[b-1]\n cows[a-1] = cow2\n cows[b-1] = cow1\n pos[cow1-1].add(b)\n pos[cow2-1].add(a)\n states[i].add(tuple(cows))\n if(len(states[i]) == prevLen):\n break\n i += 1\n i %= k\nfor p in pos:\n print(len(p))\n'''\n'''\nt = int(input())\nfor t in range(t):\n n = int(input())\n nums = list(map(int, input().split()))\n nums.sort()\n a = 0\n b = 1\n maxNum = 0\n while(b < n):\n if(nums[b] != nums[a]):\n maxNum = max(maxNum, b-a)\n a = b\n b += 1\n maxNum = max(maxNum, b-a)\n if(maxNum > math.ceil(n/2)):\n print(n - ((n - maxNum)*2))\n else:\n if(n%2==0):\n print(0)\n else:\n print(1)\n'''\n'''\nT = int(input())\n\nfor T in range(T):\n inputs = list(map(int, input().split()))\n M, N, K = inputs[0], inputs[1], inputs[2]\n emails = list(map(int, input().split()))\n folders = []\n\n for i in range(1, M+1):\n folders.append(i)\n\n emailTop = 0\n folderTop = 0\n yes = False\n\n while True:\n emailView = emails[emailTop:emailTop+K]\n folderView = folders[folderTop:folderTop+K]\n\n moved = False\n\n for i in range(emailTop, emailTop+K):\n if(i < len(emails) and emails[i] in folderView):\n emails.pop(i)\n moved = True\n if(emailTop == len(emails)):\n emailTop = len(emails) - 1\n break\n\n if(not moved):\n if(folderTop + 1 + K <= len(folders) and folderView[0] not in emails):\n folderTop += 1\n elif(emailTop + 1 + K <= len(emails)):\n emailTop += 1\n else:\n break\n\n if(not emails):\n yes = True\n break\n\n if(yes):\n print(\"YES\")\n else:\n print(\"NO\")\n'''\n'''\nt = int(input())\nfor t in range(t):\n n,m,k = map(int, input().split())\n colors = list(map(int, input().split()))\n if(n == 3 and m == 3):\n if(max(colors) >= n*m):\n print(\"Yes\")\n else:\n print(\"No\")\n continue\n c1,c2 = 0,0\n check1, check2 = set(), set()\n for color in colors:\n if(color//n > 1):\n c1 += color//n\n check1.add(color//n)\n if(color//m > 1):\n c2 += color//m\n check2.add(color//m)\n if((c1 >= m and check1 != set([2])) or (c2 >= n and check2 != set([2]))):\n print(\"Yes\")\n elif((c1 >= m and m%2==0) or (c2 >= n and n%2==0)):\n print(\"Yes\")\n else:\n print(\"No\")\n'''\n'''\nt = int(input())\nfor t in range(t):\n n = int(input())\n nums = list(map(int, input().split()))\n nums.sort()\n pos,neg = 0,0\n for num in nums:\n if(num > 0):\n pos += 1\n elif(num < 0):\n neg += 1\n if(n == 3):\n if(sum(nums) in nums):\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n if(neg > 2 or pos > 2):\n print(\"NO\")\n else:\n if((nums[0] + nums[1] + nums[-1]) in nums and (nums[0] + nums[-2] + nums[-1]) in nums and (nums[0] + nums[1] + nums[-2]) in nums and (nums[1] + nums[-2] + nums[-1] in nums)):\n print(\"YES\")\n else:\n print(\"NO\")\n'''\n'''\nt = int(input())\nfor t in range(t):\n n = int(input())\n nums = list(map(int, input().split()))\n while(n > 0 and nums[-1] == 0):\n nums.pop(-1)\n n -= 1\n if(n == 0):\n print(\"Yes\")\n continue\n if(n == 1):\n print(\"No\")\n continue\n check = [0] * n\n for i in range(n-1):\n if(i == 0):\n check[i] = nums[0]\n check[i+1] = -1* (nums[0]-1)\n else:\n add = max(0, nums[i] - check[i] + 1)\n if(add == 0):\n break\n check[i] += add\n check[i+1] -= add-1\n yes = True\n for i in range(1, n):\n if(check[i] != nums[i] + 1):\n yes = False\n if(yes):\n print(\"Yes\")\n else:\n print(\"No\")\n'''\n'''\nt = int(input())\nfor t in range(t):\n n, s = map(int, input().split())\n nums = list(map(int, input().split()))\n cur = sum(nums)\n if(cur < s):\n print(-1)\n continue\n elif(cur == s):\n print(0)\n continue\n low = 0\n high = n\n mid = (low + high)//2\n ans = 1000000\n while(low < high):\n mid = (low + high)//2\n front, back = [0], [0]\n total = 0\n for num in nums[:mid]:\n total += num\n front.append(total)\n total = 0\n for i in range(n-1, n-mid-1, -1):\n total += nums[i]\n back.append(total)\n yes = False\n minAns = 1000000\n for i in range(mid+1):\n if(cur - front[i] - back[mid-i] == s):\n yes = True\n minAns = min(minAns, front[i] + back[mid-i])\n if(yes):\n high = mid\n ans = min(ans, mid)\n else:\n if(cur - minAns < s):\n high = mid\n else:\n low = mid+1\n print(ans)\n'''\nimport math\n\nn,m,a = map(int, input().split())\nprint(math.ceil(n/a) * math.ceil(m/a))\n", "import math\r\ny=input()\r\nalist=[int(x) for x in y.split()]\r\na=alist[0]\r\nf=alist[1]\r\nk=alist[2]\r\n\r\nx=math.ceil(a/k)\r\ny=math.ceil(f/k)\r\nprint(x*y)", "import math\r\nx, y, a = map(int, input().split(\" \"))\r\n\r\nrows = math.ceil(x/a)\r\ncols = math.ceil(y/a)\r\n\r\nprint(rows * cols)\r\n", "q,w,e=map(int,input().split());\r\nprint(q//-e*(w//-e))", "m,n,a = input().split()\nm = int(m)\nn = int(n)\na = int(a)\nc = 0\nif m >= a:\n if m%a == 0:\n c = m//a\n else:\n c = m//a+1\nelse:\n c = 1\n\nd = 0\nif n >= a:\n if n%a == 0:\n d = n//a\n else:\n d = n//a+1\nelse:\n d = 1\nprint(c*d)\n", "n,m,a = input().split()\r\ncount1 = int(n) // int(a) \r\ncount2 = int(m) // int(a) \r\nif(int(n) % int(a) != 0):\r\n count1 += 1 \r\nif(int(m) % int(a) != 0):\r\n count2 += 1 \r\nprint(count1 * count2)", "import math\r\ncin = input().split()\r\nm = int(cin[0])\r\nn = int(cin[1])\r\na = int(cin[2])\r\nm = math.ceil(m/a)\r\nn = math.ceil(n/a)\r\nprint(int(m*n))", "n, m, a = map(int, input().split())\nt = (n // a) + 1 if n % a != 0 else n //a\nl = (m // a) + 1 if m % a != 0 else m //a\nprint(t * l)\n", "import math\r\n\r\ndef solution(m: int, n: int, a: int) -> int:\r\n\treturn math.ceil(m/a) * math.ceil(n/a)\r\n\r\ndef __main__():\r\n\tm,n,a = list(map(int,input().split(\" \")))\r\n\tprint(solution(m,n,a))\r\n\r\n__main__()", "#1A\r\ninput_ = [int(i) for i in input().split(' ')]\r\nprint((( input_[0] + input_[2] - 1) // input_[2]) * ((input_[1] + input_[2] - 1) // input_[2]))\r\n", "def main():\r\n n, m, a = input().split()\r\n n = int(n)\r\n m = int(m)\r\n a = int(a)\r\n if n % a != 0:\r\n s_width = n//a + 1\r\n else:\r\n s_width = n//a\r\n if m % a == 0:\r\n s_length = m//a \r\n else:\r\n s_length = m//a + 1\r\n ans = s_length * s_width\r\n print(ans)\r\n\r\nmain()\r\n ", "#taking inputs\nn, m, a = map(int, input().split()) \n\n# Calculate the number of flagstones required for the width and length\nwidth = (m + a - 1) // a\nlength = (n + a - 1) // a\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = width * length\n\nprint(total_flagstones)\n\n \t \t \t\t \t\t \t\t\t\t\t \t \t\t \t \t", "largura, comprimento, l = input(\"\").split()\na = int(largura) / int(l)\n\nb = int(comprimento) / int(l)\n\nif int(a) < a:\n a += 1\nif int(b) < b:\n b += 1\nprint(int(a)*int(b))", "from math import ceil\r\nn, m , a = [int(x) for x in input().split()]\r\nprint(ceil(n / a) * ceil(m / a))", "n,m,a=map(int,input().split())\r\nif n%a!=0:\r\n p=n//a+1\r\nelse:\r\n p=n//a\r\nif m%a!=0:\r\n q=(m//a+1)\r\nelse:\r\n q=(m//a)\r\nprint(p*q)", "from math import ceil;\r\nn,m,a = [int(elem) for elem in input().split()]\r\nprint(ceil(n/a)*ceil(m/a))\r\n\r\n\r\n\r\n", "import math\n\nn,m,a = list(map(float, input().split(' ')))\n\nans = (math.ceil(n/a))*(math.ceil(m/a))\nprint(ans)\n\t \t\t \t \t\t \t \t \t\t \t\t", "import math\r\nn, m, a = map(int, input().split())\r\nwidth = math.ceil(n / a)\r\nheight = math.ceil(m / a)\r\nnum_flagstones = width * height\r\nw = n - (width - 1) * a - a\r\nif w < 0:\r\n w = 0\r\nh = m - (height - 1) * a - a\r\nif h < 0:\r\n h = 0\r\nnum_flagstones += math.ceil(w / a) + math.ceil(h / a)\r\nprint(num_flagstones)\r\n", "import math\r\n\r\ndef tiles_required(n, m, a):\r\n return math.ceil(n/a) * math.ceil(m/a)\r\n\r\nif __name__ == \"__main__\":\r\n n, m, a = map(int, input().split())\r\n print(tiles_required(n, m, a))\r\n", "import math\r\n\r\ndef min(n, m, a):\r\n fls = math.ceil(n / a) * math.ceil(m / a)\r\n return fls\r\nn, m, a = map(int, input().split())\r\nresult = min(n, m, a)\r\nprint(result)\r\n", "n,m,a=map(int,input().split())\r\ns=0\r\ns1=0\r\nif n%a==0:\r\n s+=n//a\r\nelse:\r\n s+=n//a+1 \r\nif m%a==0:\r\n s1+=m//a\r\n\r\nelse:\r\n s1+=m//a+1 \r\nprint(s*s1)", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n i=n//a\r\nelse:\r\n i=(n//a)+1\r\nif m%a==0:\r\n j=m//a\r\nelse:\r\n j=(m//a)+1\r\nprint(i*j)", "n,m,a=map(int,input().strip().split())\r\nflag1=0\r\nflag2=0\r\nsum=0\r\nif n%a:\r\n flag1=1\r\nif m%a:\r\n flag2=1\r\nsum=(n//a+flag1)*(m//a+flag2)\r\nprint(int(sum))", "a,b,c=list(map(int,input().split()))\r\nprint((a+c-1)//c*((b+c-1)//c))", "n,m,a=map(int,input().split())\r\nif m%a!=0:\r\n c=m//a+1\r\nelse:\r\n c=m//a\r\nif n%a!=0:\r\n c1=n//a+1\r\nelse:\r\n c1=n//a\r\nprint(c1*c)", "arr = [int(a) for a in input().split()]\nn, m, a = arr[0], arr[1], arr[2]\nif n % a == 0:\n n = n // a\nelse:\n n = n // a + 1\nif m % a == 0:\n m = m // a\nelse:\n m = m // a + 1\nres = int(n * m)\nprint(res)", "import sys\r\na=list(map(int,input().split(\" \")))\r\nn,m=0,0\r\nif a[0]%a[2]==0:\r\n n=a[0]//a[2]\r\nelse:\r\n n=a[0]//a[2]+1 \r\nif a[1]%a[2]==0:\r\n m=a[1]//a[2]\r\nelse:\r\n m=a[1]//a[2]+1 \r\nprint(m*n)", "a,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=max(a,b)\r\ne=min(a,b)\r\nimport math\r\nk=math.ceil(d/c)*math.ceil(e/c)\r\nprint(k)\r\n", "import math\r\nflag,stones,least = map(int, input().split())\r\nprint(math.ceil(flag/least) * math.ceil(stones/least))", "import math\r\n\r\nvalues = input()\r\nv_list = values.split()\r\n\r\na = float(v_list[0]) / float(v_list[2])\r\nb = float(v_list[1]) / float(v_list[2])\r\n\r\nres = math.ceil(a) * math.ceil(b)\r\n\r\nprint(int(res))", "n, m, a = map(int, input().split()) # split() разделение по пробелу; map - позволяет использовать несколько операций\r\n\r\nif n % a == 0:\r\n k1 = n // a\r\nelse:\r\n k1 = n // a + 1\r\n\r\nif m % a == 0:\r\n k2 = m // a\r\nelse:\r\n k2 = m // a + 1\r\nprint(k1 * k2)", "n, m, a = map(int, input().split())\r\nif n%a==0:\r\n vert=n//a\r\nelse:\r\n vert=(n//a)+1\r\nif m%a==0:\r\n hori=m//a\r\nelse:\r\n hori=(m//a)+1\r\n \r\nprint (vert*hori)\r\n", "import math\r\nif __name__==\"__main__\":\r\n m,n,a=input().split(\" \")\r\n m=int(m)\r\n n=int(n)\r\n a=int(a)\r\n numberOfStones=math.ceil(m/a)* math.ceil(n/a)\r\n print(numberOfStones)", "import math\r\nw=str(input())\r\nl=w.split(\" \")\r\nprint(math.ceil(int(l[0])/int(l[2]))*math.ceil(int(l[1])/int(l[2])))", "from math import ceil\nn,m,a = map(int,input().split())\nprint((ceil(n/a)*ceil(m/a)))\n", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\na = int(x[2])\r\nif n % a != 0:\r\n n = n//a + 1\r\nelse:\r\n n = n/a\r\nif m % a != 0:\r\n m = m//a + 1\r\nelse:\r\n m = m/a\r\nprint('{:.0f}'.format(m*n))", "n, m, a = map(int, input().split())\n\nimport math \nx = math.ceil(m/a)\ny = math.ceil(n/a)\nprint(x*y)", "def f():\r\n n, m, a = map(int, input().split())\r\n sum = 1\r\n if (n > a):\r\n sum *= (n + a - 1) // a\r\n if (m > a):\r\n sum *= (m + a - 1) // a\r\n return sum\r\n\r\n\r\n\r\nprint(f())\r\n", "import math\r\ndef calculateFlagstones(n,m,a):\r\n num_flagstones=math.ceil(n/a)*math.ceil(m/a)\r\n return num_flagstones\r\nn,m,a=map(int,input().split())\r\nresult=calculateFlagstones(n,m,a)\r\nprint(result)\r\n ", "n,s,p=map(int,input().split())\r\nif n%p == 0:\r\n d1=n//p\r\nelse:\r\n d1=n//p+1\r\nif s%p == 0:\r\n d2=s//p\r\nelse:\r\n d2=s//p+1\r\nprint(d1*d2)", "n, m, a=list(map(int, input().split()))\r\ns=0\r\nif n%a>0:\r\n s+=n//a+1\r\nif n%a==0:\r\n s+=n//a\r\nif m%a>0:\r\n s*=m//a+1\r\nif m%a==0:\r\n s*=m//a\r\nprint(s)", "import math\r\nn,m,a=map(int,input().split())\r\nhorizontal_flagstones=math.ceil(n/a)\r\nvertical_flagstones=math.ceil(m/a)\r\ntotal_flagstones=horizontal_flagstones*vertical_flagstones\r\nprint(total_flagstones)", "import math\r\nn, m, a = map(int, input().split())\r\nx = n / a\r\nx = math.ceil(x)\r\ny = m / a\r\ny = math.ceil(y)\r\nres = x * y\r\nprint(res)", "# m-a-v-e-r-i-c-k\r\nimport os, sys, math, heapq, itertools, bisect\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom collections import deque,defaultdict, OrderedDict, Counter\r\n#sys.setrecursionlimit(10000)\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nii = lambda : int(input()) \r\nsi = lambda : input() \r\nmi = lambda : map(int,input().strip().split(\" \")) \r\nmsi = lambda : map(str,input().strip().split(\" \")) \r\nli = lambda : list(mi()) \r\nlsi = lambda : list(msi())\r\n# custom typecasting\r\norderLowercase = lambda character : ord(character)-97\r\norderUppercase = lambda character : ord(character)-65\r\na2n = {chr(k):v for k,v in zip(range(97,97+27),range(1,27))}\r\nn2a = {v:chr(k) for k,v in zip(range(97,97+27),range(1,27))}\r\ntoBinary = lambda num : int(str(bin(num))[2:])\r\niseven = lambda num : num%2==0 \r\nisodd = lambda num : num%2==1 \r\nisint = lambda num : isinstance(num, int)\r\nisfloat = lambda num : isinstance(num, float)\r\nisPowerOfTwo = lambda num : num and (not(num & (num - 1)))\r\npositive_infinity = float('inf')\r\nnegative_infinity = float('-inf')\r\nstartFrom = lambda list_name, target : list(itertools.dropwhile(lambda x : x != target, list_name))\r\nfinishBefore = lambda list_name, target : list(itertools.takewhile(lambda x : x != target, list_name))\r\ndef swap(array:list,a,b) -> None: array[b],array[a] = array[a],array[b]\r\ndef debug(appendMode : str, *var) -> None:\r\n import t_o_p_g_u_n\r\n with open(t_o_p_g_u_n.debug_file,appendMode) as f:\r\n for idx,v in enumerate(var): f.write(f\"Query {idx+1}\\t>-> {str(v)}\\n\")\r\ndef binary_search_function(input_list:list, low_value:int, high_value:int, target_value:int) -> None:\r\n if high_value >= low_value:\r\n middle = (high_value + low_value) // 2\r\n if input_list[middle] < target_value: return binary_search_function(input_list, middle +1, high_value, target_value)\r\n elif input_list[middle] > target_value: return binary_search_function(input_list, low_value, middle-1, target_value)\r\n else: return middle\r\n else: return [high_value,low_value]\r\ndef bubble_sort(arr:list) -> list:\r\n i = 0\r\n while i < len(arr):\r\n j = i + 1 \r\n while j < len(arr):\r\n if arr[j] < arr[i]: temp = arr[i]; arr[i] = arr[j]; arr[j] = temp\r\n j+=1\r\n i+=1\r\n return arr\r\ndef currencyChange(change:int)->list:\r\n currency,n,ans,i = [1, 2, 5, 10, 20, 50, 100, 500, 1000],len(currency),[],n-1\r\n while i >= 0:\r\n while (change >= currency[i]): change -= currency[i]; ans.append(currency[i])\r\n i -= 1\r\n return ans\r\n# listname, toBreakWhile, startingIndex, forward/reverse\r\ndef cycle(list_name : list, breakpoint, startIndex : int = 0, direction : int = 1) -> (int, list) :\r\n temp,tempStore = 0,[]\r\n for idx,i in enumerate(itertools.cycle(list_name[::direction])):\r\n if idx >= startIndex:\r\n if i!=breakpoint: temp+=1; tempStore.append(i)\r\n else: break\r\n return temp, tempStore\r\ndef factors(n:int) -> list:\r\n q = []\r\n for i in range(1,int(n ** 0.5) + 1):\r\n if n % i == 0: q.append(i); q.append(n // i)\r\n return list(sorted(list(set(q))))\r\ndef isPrime( n : int ) -> bool:\r\n if n <= 1: return False\r\n if n % 2 == 0: return n == 2\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: return False\r\n return True\r\ndef isSubsequence(needle:str, haystack:str) -> bool:\r\n current_pos = 0\r\n for c in needle:\r\n current_pos = haystack.find(c, current_pos) + 1\r\n if current_pos == 0: return False\r\n return True\r\ndef jobSchedulingNoProfit(arr:list)->list:\r\n n,result,maxHeap = len(arr),[],[]\r\n arr.sort(key=lambda x: x[1])\r\n for i in range(n - 1, -1, -1):\r\n if i == 0: slots_available = arr[i][1]\r\n else: slots_available = arr[i][1] - arr[i - 1][1]\r\n heapq.heappush(maxHeap, (-arr[i][2], arr[i][1], arr[i][0]))\r\n while slots_available and maxHeap:\r\n profit, deadline, job_id = heapq.heappop(maxHeap)\r\n slots_available -= 1\r\n result.append([job_id, deadline])\r\n result.sort(key=lambda x: x[1])\r\n return result\r\n # print result's first element as the jobs name\r\ndef jobSchedulingWithProfit(startTime:list, endTime:list, profit:list)->int:\r\n jobs = sorted(zip(startTime, endTime, profit), key=lambda v: v[1])\r\n dp = [[0, 0]]\r\n for s, e, p in jobs:\r\n i = bisect.bisect(dp, [s + 1]) - 1\r\n if dp[i][1] + p > dp[-1][1]: dp.append([e, dp[i][1] + p])\r\n return dp[-1][1]\r\ndef LCMofArray(a:list) -> int:\r\n lcm = a[0]\r\n for i in range(1,len(a)): lcm = lcm*a[i]//math.gcd(lcm, a[i])\r\n return lcm\r\ndef longestPalindrome(s:list) -> list:\r\n dp = [[False for i in range(len(s))] for i in range(len(s))]\r\n for i in range(len(s)): dp[i][i] = True\r\n max_length = 1\r\n start = 0\r\n for l in range(2,len(s)+1):\r\n for i in range(len(s)-l+1):\r\n end = i+l\r\n if l==2:\r\n if s[i] == s[end-1]:\r\n dp[i][end-1]=True\r\n max_length = l\r\n start = i\r\n else:\r\n if s[i] == s[end-1] and dp[i+1][end-2]:\r\n dp[i][end-1]=True\r\n max_length = l\r\n start = i\r\n return s[start:start+max_length]\r\ndef makeTwoBinaryEqual(list1: list, list2: list) -> None:\r\n absolute,list1Length,list2Length = abs(len(list1) - len(list2)),len(list1),len(list2)\r\n if list1Length > list2Length :\r\n for i in range(absolute) : list2.insert(0,'0')\r\n elif list1Length < list2Length :\r\n for i in range(absolute) : list1.insert(0,'0')\r\ndef maxIncreasingSubArray(arr : list) -> int:\r\n c,temp = 1,[]\r\n if len(arr)==1: return 1\r\n else:\r\n start,idx = arr[0],1\r\n while idx < len(arr):\r\n if arr[idx] > start: start = arr[idx]; c+=1\r\n else: temp.append(c); start = arr[idx]; c = 1\r\n idx+=1\r\n temp.append(c)\r\n return max(temp)\r\ndef maxSubarraySum(n:int, array:list) -> int:\r\n best = s = 0\r\n for k in range(n):\r\n s = max(array[k],s+array[k])\r\n if s < 0 and max(best,s)==0 and min(best,s)<0: best = s\r\n else : best = max(best,s)\r\n return best\r\ndef findMinDiff(arr:list, n:int) -> int:\r\n arr,diff = sorted(arr),10**20\r\n for i in range(n-1):\r\n if arr[i+1] - arr[i] < diff: diff = arr[i+1] - arr[i]\r\n return diff\r\ndef findMin(arr:list) -> int:\r\n n,summation = len(arr),0\r\n for i in range(0, n): summation = summation + arr[i]\r\n arr.sort()\r\n minimum = arr[0]\r\n maximim = 0\r\n for i in range(n - 1, 0, -1):\r\n num = arr[i]\r\n total = num + minimum\r\n for j in range(2, num + 1):\r\n if(num % j == 0):\r\n d = j\r\n now = (num // d) + (minimum * d)\r\n reduce = total - now\r\n if(reduce > maximim): maximim = reduce\r\n return summation - maximim\r\ndef ncr(n:int,r:int) -> int:\r\n if r > n: return(0)\r\n else: return(math.factorial(n) // (math.factorial(n - r) * math.factorial(r)))\r\ndef npr(n:int,r:int) -> int:\r\n if r > n: return(0)\r\n else: return(math.factorial(n) // math.factorial(n - r))\r\ndef pascals_triangle(n:int)-> list:\r\n triangle = []\r\n for i in range(n):\r\n sr = []\r\n for j in range(i+1): sr.append(math.factorial(i)//(math.factorial(j)*math.factorial(i-j)))\r\n triangle.append(sr)\r\n return triangle\r\ndef power_two(x:int) -> int: return (x and (not(x & (x - 1))))\r\ndef powerset(some_list:list)->list:\r\n if len(some_list) == 0: return [[]]\r\n subsets = []\r\n first_element = some_list[0]\r\n remaining_list = some_list[1:]\r\n for partial_subset in powerset(remaining_list):\r\n subsets.append(partial_subset)\r\n subsets.append(partial_subset[:] + [first_element])\r\n return subsets\r\ndef prefixSum(arr:list) -> list:\r\n newArray,idx = [],0\r\n while idx < len(arr):\r\n if idx==0: newArray.append(arr[idx])\r\n else: ans = arr[idx] + newArray[-1]; newArray.append(ans)\r\n idx+=1\r\n return newArray\r\ndef prime_factors(n:int) -> list:\r\n q = []\r\n while n % 2 == 0: q.append(2); n = n // 2\r\n for i in range(3,int(n ** 0.5) + 1,2):\r\n while n % i == 0: q.append(i); n = n // i\r\n if n > 2: q.append(n)\r\n return list(sorted(q))\r\ndef repeatedSubstringPattern(s: str) -> bool:\r\n for i in range(1,int(len(s)/2)+1):\r\n if set(s.split(s[0:i])) == {''}: return True \r\n return False\r\ndef eraseOverlapIntervals(intervals:list) -> int:\r\n end, cnt = float('-inf'), 0\r\n for s, e in sorted(intervals, key=lambda x: x[1]):\r\n if s >= end: end = e\r\n else: cnt += 1\r\n return cnt\r\ndef seive(n : int) -> list:\r\n allprime,prime,p = [1],[True for i in range(n + 1)],2\r\n while (p * p <= n): \r\n if (prime[p] == True): \r\n for i in range(p ** 2,n + 1,p): prime[i] = False\r\n p = p + 1\r\n for p in range(2,n + 1): \r\n if prime[p]: allprime.append(p)\r\n return allprime\r\n\r\ndef isConsecutive(l:list) -> bool:\r\n flag = False\r\n temp = l[0]\r\n t = l[1:]\r\n for i in t:\r\n if i != temp + 1: flag = True; break\r\n elif i == temp + 1: temp = i\r\n return flag\r\n\r\ndef _maverick_() -> None:\r\n n,m,a = mi()\r\n ans = math.ceil(m/a) * math.ceil(n/a)\r\n print(f\"{ans}\",end=\"\\n\")\r\n\r\n\r\n\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n try: from t_o_p_g_u_n import m_a_v_e_r_i_c_k, _generator_; m_a_v_e_r_i_c_k(); _maverick_(); _generator_(); \r\n except (FileNotFoundError,ModuleNotFoundError): _maverick_()\r\n\r\n\r\n", "o, p, i = map(int, input().strip().split())\r\n\r\nprint(((o + i - 1) // i) * ((p + i - 1) // i))\r\n", "n,m,a=map(int,input().split())\r\nimport math\r\nb=math.ceil(n/a)\r\nc=math.ceil(m/a)\r\nprint(b*c)\r\n ", "n,m,a = [int(x) for x in input().split()]\r\nprint(((n-1)//a+1)*((m-1)//a+1))", "import math\r\n# Taking input from the user in the format \"6 6 4\"\r\nuser_input = input()\r\n\r\n# Splitting the input by spaces\r\nnumbers = user_input.split()\r\n\r\n# Converting the input values to integers\r\nn = int(numbers[0])\r\nm = int(numbers[1])\r\na = int(numbers[2])\r\n\r\nx = math.floor(m / a)\r\ny = math.floor(n / a)\r\n\r\nif m%a != 0 :\r\n x+=1\r\n\r\nif n%a != 0 :\r\n y+=1\r\n\r\n# Printing the values\r\nprint( x * y )\r\n\r\n\r\n", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n ans=n//a\r\nelse:\r\n ans=(n//a)+1\r\nif m%a==0:\r\n ans*=(m//a)\r\nelse:\r\n ans*=((m//a)+1)\r\nprint(ans)", "n,m,a=map(int, input().split())\r\nans=0\r\nans1=0\r\nif n%a==0:\r\n ans = ans + (n//a)\r\nelse:\r\n ans = ans + (n//a)+1\r\nif m%a==0:\r\n ans1 = ans1 + (m//a)\r\nelse:\r\n ans1 = ans1 + (m//a)+1\r\nprint(ans*ans1)", "import math\r\nrawnum=input().split()\r\nans=math.ceil(int(rawnum[0])/int(rawnum[2]))*math.ceil(int(rawnum[1])/int(rawnum[2]))\r\nprint(ans)\r\n", "def o(str):\r\n k = 0\r\n for i in str: \r\n k += 1\r\n if i == \" \":\r\n return k\r\n break\r\nstr = input()\r\nx1 = o(str)\r\nn = int(str[: x1-1])\r\nstr_n = str[x1:]\r\nx2 = o(str_n)\r\nm = int(str_n[: x2-1])\r\na = int(str_n[x2:])\r\ndef gauss(x):\r\n if x % a == 0:\r\n return x // a\r\n else:\r\n return x // a + 1\r\np = gauss(n)\r\nq = gauss(m)\r\nprint(p * q)\r\n", "n,m,a=map(int,input().split())\r\nw=n//a\r\nif(n%a!=0):\r\n w+=1\r\nl=m//a\r\nif m%a!=0:\r\n l+=1\r\nprint(l*w)", "n, m ,a = map(int, input().split(' '))\r\nna = 0\r\nma = 0\r\nif n%a == 0:\r\n na = n//a\r\nelse:\r\n na = n//a + 1\r\nif m%a == 0:\r\n ma = m//a\r\nelse:\r\n ma = m//a + 1\r\nprint(na * ma)\r\n", "\r\nn, m, a = map(int, input().split())\r\n\r\nlength = -(-n // a)\r\nwidth = -(-m // a)\r\ntotal = length * width\r\n\r\nprint(total)\r\n", "n,m,a=map(int,input().split())\r\nif m%a==0:\r\n val1=m // a\r\nelse:\r\n val1=m // a + 1\r\nif n%a==0:\r\n val2=n // a\r\nelse:\r\n val2=n // a + 1\r\n \r\nprint(val1*val2)\r\n ", "x,y,a=map(int,input().split())\r\nif x%a==0:\r\n u=x//a\r\nelse:\r\n u=x//a+1\r\nif y%a==0:\r\n d=y//a\r\nelse:\r\n d=y//a+1\r\nprint(u*d)\r\n", "n,m,a=map(int,input().split())\r\nf=((n+a-1)//a)*((m+a-1)//a)\r\nprint(f)", "length, width, a = map(int, input().split())\r\nif length % a != 0:\r\n length = length // a + 1\r\nelse:\r\n length = length // a\r\nif width % a != 0:\r\n width = width // a + 1\r\nelse:\r\n width = width // a\r\n\r\nprint(length*width)\r\n\r\n", "from math import *\r\na, b, c = map(int, input().split())\r\nprint (ceil(a / c) * ceil(b / c))", "import math\n\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed in each dimension\nrows = math.ceil(n / a)\ncolumns = math.ceil(m / a)\n\n# Calculate the total number of flagstones needed\ntotal_flagstones = rows * columns\n\nprint(total_flagstones)\n\t\t \t\t\t \t \t \t\t\t\t \t \t\t\t", "m,n,a = input().split(' ')\r\nm = int(m)\r\nn = int(n)\r\na = int(a)\r\nx = m//a\r\ny = n//a\r\nres = x*y\r\nif m%a !=0:\r\n x = x+1\r\nif n%a !=0:\r\n y = y+1\r\nprint(x*y)\r\n\r\n\r\n", "from math import ceil\r\na = [int(i) for i in input().split(' ')]\r\nz = ceil(a[0] / a[-1])\r\nx = ceil(a[1] / a[-1])\r\nprint(z * x)", "n,m,a=map(int,input().split())\r\nflag_squares=((n+a-1)//a) * ((m+a-1)//a)\r\nprint(flag_squares)", "import math\r\n\r\nn, m, a = [int(x) for x in input().split(\" \")]\r\n\r\nanswer = math.ceil(n/a)\r\n\r\n#print(answer)\r\n\r\nm-=a\r\n#print(math.ceil(m/a))\r\nanswer *= math.ceil(m/a)+1\r\n\r\nprint(answer)\r\n\r\n\r\n", "import math\n\n# Read input values\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones required for the width and length\nwidth_flagstones = math.ceil(n / a)\nlength_flagstones = math.ceil(m / a)\n\n# Calculate the total number of flagstones required\ntotal_flagstones = width_flagstones * length_flagstones\n\n# Print the result\nprint(total_flagstones)\n \t\t\t \t\t \t\t \t\t\t\t\t\t\t\t \t \t", "from math import ceil\n\nn, m, a = input().split()\nn = int(n)\nm = int(m)\na = int(a)\n\nb = 0; \nc = 0; \n\nb = ceil(n / a);\nc = ceil(m / a);\n\nprint(b * c)\n", "n,m,a = map(int , input().split()) \r\n\r\nif n%a == 0 :\r\n N = n//a\r\nelse :\r\n N = n//a + 1\r\n\r\nif m%a == 0 :\r\n M = m//a\r\nelse :\r\n M = m//a + 1\r\n\r\n\r\nprint(N*M)\r\n", "import math\r\nn, m, a = [int(x) for x in input().split()]\r\ncnt = math.ceil(n/a) * math.ceil(m/a)\r\nprint(cnt)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jun 7 23:18:49 2022\r\n\r\n@author: Mirlo\r\n\"\"\"\r\n\r\nx,y,z=input().split()\r\nx=int(x)\r\ny=int(y)\r\nz=int(z)\r\ns=x//z\r\nif x%z!=0:\r\n s=s+1\r\nv=y//z\r\nif y%z!=0:\r\n v=v+1\r\nprint(s*v)", "m,n,a = list(map(int,input().split()))\r\nfrom math import ceil\r\nprint(ceil(m/a)*ceil(n/a))", "length, width, side = map(int, input().split())\r\nprint(-length // side * (-width // side))\r\n", "ball = input().split()\r\nx = int(ball[0])\r\ny = int(ball[1])\r\nz = int(ball[2])\r\nif x%z != 0 and y%z != 0:\r\n d1 = x//z + 1\r\n d2 = y//z + 1\r\nif x%z == 0 and y%z != 0:\r\n d1 = x//z\r\n d2 = y//z + 1\r\nif x%z != 0 and y%z == 0:\r\n d1 = x//z + 1\r\n d2 = y//z\r\nif x%z == 0 and y%z == 0:\r\n d1 = x//z\r\n d2 = y//z\r\nprint(d1*d2)", "import math\r\nx,y,a=map(int,input().split())\r\nw=math.ceil(x/a)\r\nl=math.ceil(y/a)\r\nprint(w*l)", "n, m, a=input().split( )\nif((int(n)/int(a))>int(int(n)/int(a))):\n s1=int(int(n)/int(a)) + 1\nelse:\n s1=int((int(n)/int(a)))\n\nif((int(m)/int(a))>int(int(m)/int(a))):\n s2=int(int(m)/int(a)) + 1\nelse:\n s2=int((int(m)/int(a)))\nprint(s1*s2)\n", "n, m, a = map(int, input().split())\n\nif max(n, m) % a == 0:\n k = max(n, m) // a\nelse:\n k = max(n, m) // a + 1\n\nif min(n, m) % a == 0:\n l = min(n, m) // a\nelse:\n l = min(n, m) // a + 1\n\nprint(k * l) \n", "import math\r\nx, y, z = input().split()\r\nn = int(x)\r\nm = int(y)\r\na = int(z)\r\n\r\nsummation = (int(n/a) * int(m/a))\r\nif (n-a) % a != 0 and (m-a) % a != 0:\r\n summation += math.ceil(n/a) + math.ceil(m/a) -1\r\nelif (n-a) % a != 0 and (m-a) % a == 0:\r\n summation += math.ceil(m / a)\r\nelif (n-a) % a == 0 and (m-a) % a != 0:\r\n summation += math.ceil(n / a)\r\nprint(summation)\r\n", "import math\nn, m, a= map(int,input().split())\n# m = map(int,input().split())\n# a = map(int,input().split())\nx = math.ceil(n/a)\ny = math.ceil(m/a)\nprint(x*y)", "from sys import stdin\r\n\r\ndef solve(n):\r\n cont1=n[0]//n[2]\r\n if n[0]%n[2]!=0:\r\n cont1+=1\r\n cont2=n[1]//n[2]\r\n if n[1]%n[2]!=0:\r\n cont2+=1 \r\n print(cont1*cont2)\r\n\r\ndef main():\r\n n=stdin.readline().strip().split()\r\n n=list(map(int,n))\r\n solve(n)\r\nmain()", "#x = int(input())\r\n#z = 0\r\n# for i in range(0, x):\r\n# a, b, c = input().split()\r\n\r\n# if (int(a) == 1) and (int(b) == 1) and (int(c) == 1):\r\n# z += 1\r\n# if (int(a) == 1) and (int(b) == 1) and (int(c) == 0):\r\n# z += 1\r\n# if (int(a) == 1) and (int(b) == 0) and (int(c) == 1):\r\n# z += 1\r\n## z += 1\r\n\r\n# print(z)\r\n#x = int(input())\r\n#y = 0\r\n# for i in range(0, x):\r\n# z = input()\r\n# if z.count(\"1\") >= 2:\r\n# y += 1\r\n#i += 1\r\n# print(y)\r\nimport math\r\nn, m, a = input().split()\r\nx = int(n)/int(a)\r\ny = math.ceil(x)\r\nz = int(m)/int(a)\r\nf = math.ceil(z)\r\nprint(f*y)\r\n", "su = 1\r\nn, m, a = map(int, input().split())\r\nif n > a:\r\n su *= (n+a-1)//a\r\nif m>a:\r\n su *= (m+a-1)//a\r\nprint(su)", "\r\n#!/usr/bin/env python\r\nfrom __future__ import division, print_function\r\nimport math\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\ndef read():\r\n\tsys.stdout = open('C:/Users/hp/OneDrive/Desktop/Tech Communication/Contest/output.in', 'w')\r\n\tsys.stdin = open('C:/Users/hp/OneDrive/Desktop/Tech Communication/Contest/input.in', 'r')\r\n\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\ndef ii(): return int(input()) # integer \r\ndef si(): return input() # string\r\ndef mi(): return map(int,input().strip().split(\" \")) # mapping integer\r\ndef msi(): return map(str,input().strip().split(\" \")) # mapping string\r\ndef li(): return list(mi()) \t\t\t\t\t\t# list input\r\n\r\n\r\nabc = 'abcdefghijklmnopqrstuvwxyz'\r\na2n = {'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\nn2a = {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\nmod = 1000000007\r\n# mod = 998244353\r\ninf = float(\"inf\")\r\nvow = ['a','e','i','o','u']\r\ndx,dy = [-1,1,0,0,1,-1,1,-1],[0,0,1,-1,1,-1,-1,1]\r\ndef getKey(item) : return item[1] # get an item from the dictionary\r\ndef sort2(l) : return sorted(l, key=getKey,reverse=True) # reverse sort according to string\r\ndef d2(n,m,num) : return [[num for x in range(m)] for y in range(n)] \r\ndef isPowerOfTwo (x): return (x and (not(x & (x - 1))) ) # checks is a power of 2 or not\r\ndef decimalToBinary(n): return bin(n).replace(\"0b\",\"\") # decimal to binary\r\ndef ntl(n):return [int(i) for i in str(n)] # converts string to integer\r\ndef ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1))) \r\n\r\ndef debug(anyTypeOfDataType):\r\n names = str(anyTypeOfDataType)\r\n with open('C:/Users/hp/OneDrive/Desktop/Tech Communication/Contest/output.in', 'w') as f: f.write(names)\r\n\r\ndef powerMod(x,y,p):\r\n res = 1\r\n x %= p\r\n while y > 0:\r\n if y&1:\r\n res = (res*x)%p\r\n y = y>>1\r\n x = (x*x)%p\r\n return res\r\n \r\ndef LCMofArray(a):\r\n lcm = a[0]\r\n for i in range(1,len(a)): lcm = lcm*a[i]//math.gcd(lcm, a[i])\r\n return lcm\r\n\r\n\r\ndef dmain():\r\n sys.setrecursionlimit(1000000)\r\n threading.stack_size(1024000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n\r\ndef main():\r\n\ttry:\r\n\t\tread()\r\n\t\treadIO()\r\n\texcept FileNotFoundError: readIO()\r\n\r\n\r\ndef readIO():\r\n def noLoop(): return solve()\r\n def oneLoop():\r\n firstLoop = ii()\r\n for _ in range(1,firstLoop+1): solve()\r\n def twoLoops():\r\n firstLoop = ii() \r\n for _ in range(firstLoop):\r\n secondLoop = ii()\r\n for se in range(secondLoop): solve()\r\n noLoop()\r\n #oneLoop()\r\n\r\ndef solve():\r\n\tstore = [] # list\r\n\tdic = {} # dictionary\r\n\tflag = False # identifier\r\n\tcounter = 0 # iteration\r\n\tsummation = 0 # sum\r\n\r\n#<<<<<<<<<<<<<<<<<<<Main Code>>>>>>>>>>>>>>>>>>>>>\r\n\r\n\tn,m,a=mi()\r\n\tx=n//a \r\n\ty=m//a \r\n\tif n%a!=0:\r\n\t\tx+=1\r\n\tif m%a!=0:\r\n\t\ty+=1\r\n\tprint(x*y)\r\n\r\n\t\t\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# 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\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\nif __name__ == \"__main__\":\r\n main()", "arr=list(map(int,input().split()))\r\nans=1\r\nif(arr[0]%arr[2]==0):\r\n ans=ans*(arr[0]//arr[2])\r\nelse:\r\n ans=ans*((arr[0]//arr[2])+1) \r\nif(arr[1]%arr[2]==0):\r\n ans=ans*(arr[1]//arr[2])\r\nelse:\r\n ans=ans*((arr[1]//arr[2])+1) \r\nprint(ans)\r\n \r\n\r\n\r\n", "a,b,c = map(int,input().split())\r\nc1 = a//c\r\nc2 = b//c\r\nif a%c!=0:\r\n c1+=1\r\nif b%c!=0:\r\n c2+=1\r\nprint(c1*c2)", "import math as m\r\na , b ,c = map(int,input().split())\r\nprint(m.ceil(a/c)*m.ceil(b/c))", "from math import ceil\r\nsstr=input()\r\nli=list(sstr.split(' '))\r\na,b,n=int(li[0]),int(li[1]),int(li[2])\r\naa=ceil(a/n)\r\nbb=ceil(b/n)\r\nprint(int(aa*bb))", "n, m, a = [int(i) for i in input().split()]\r\nk = (n // a + int(bool(n % a))) * (m // a + int(bool(m % a)))\r\nprint(k)", "def solve(n,m,a):\r\n if m%a==0: \r\n n1=m//a \r\n else: \r\n n1=m//a+1 \r\n \r\n if n%a==0: \r\n n2=n//a \r\n else: \r\n n2=n//a+1 \r\n return n1*n2\r\nif __name__ == \"__main__\":\r\n n,m,a = map(int,input().split())\r\n print(solve(n,m,a))", "import math\r\nn,m,a=map(int,input().split())\r\nrow=math.ceil(m/a)\r\ncol=math.ceil(n/a)\r\nprint(row*col)", "n, m, a = list(map(int, input().split()))\r\nt_b_cov = t_l_cov = 1\r\n\r\nif (a < m):\r\n if (m % a != 0):\r\n t_b_cov = m // a + 1\r\n else:\r\n t_b_cov = m // a\r\nif (a < n):\r\n if (n % a != 0):\r\n t_l_cov = n // a + 1\r\n else:\r\n t_l_cov = n // a\r\n\r\nprint(t_l_cov * t_b_cov)\r\n", "n, m, a = [int(x) for x in input().split()]\r\ni=0\r\nj=0\r\nif n%a!=0:\r\n i = (n//a)+1\r\nelse:\r\n i = n//a\r\n\r\n\r\nif m%a!=0:\r\n j = (m//a)+1\r\nelse:\r\n j = m//a\r\n\r\nprint(i*j)\r\n", "from math import *\r\nn,m,a = map(int,input().rstrip().split())\r\ngaro = ceil(n/a)\r\nsero = ceil(m/a)\r\nprint(garo*sero)", "from math import ceil\nn, m, a = input().split()\n\nn = int(n)\nm = int(m)\na = int(a)\n\nnum_m = int(ceil(m / a))\nnum_n = int(ceil(n / a))\n\nnum = num_m * num_n\nprint(num)\n\n\n", "def threatre_square(n, m, a):\r\n if n % a != 0:\r\n n = n+(a-(n % a))\r\n if m % a != 0:\r\n m = m+(a-(m % a))\r\n return (n*m)//(a**2)\r\n\r\n\r\nif __name__ == '__main__':\r\n size = input().split(\" \")\r\n n = int(size[0])\r\n m = int(size[1])\r\n a = int(size[2])\r\n result = threatre_square(n, m, a)\r\n print(result)\r\n", "a , b , c = map(int,input().split())\r\na1 = int(a/c)\r\nb1 = int(b/c)\r\nz= (a/c) - a1\r\nx = (b/c) - b1\r\nif 1 <= a <= 10**9 and 1 <= b <= 10**9 and 1 <= c <= 10**9 :\r\n if 1 > z >0 :\r\n a1+=1\r\n if 1 > x >0 :\r\n b1+=1\r\nprint(a1*b1) ", "from math import ceil\r\n\r\nn, m, a = map(int, input().split())\r\nrow = ceil(n/a)\r\nclomun = ceil(m/a)\r\nprint(row*clomun)\r\n", "arr = [int(i) for i in input().split()]\r\nl = arr[0]//arr[2]\r\nb = arr[1]//arr[2]\r\nif(arr[0] % arr[2] != 0):\r\n l += 1\r\nif(arr[1] % arr[2] != 0):\r\n b += 1\r\nprint(l*b)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 29 11:44:01 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nimport math\r\nnma = input()\r\nnma_ = nma.split()\r\nn = int(nma_[0])\r\nm = int(nma_[1])\r\na = int(nma_[2])\r\nneed1 = math.ceil(n/a)\r\nneed1 = int(need1)\r\nneed2 = math.ceil(m/a)\r\nneed2 = int(need2)\r\nprint(need1 * need2)", "a,b,c = map(int ,input().split())\r\nif a%c == 0 :\r\n ss = a // c\r\nelse :\r\n ss = a // c + 1\r\nif b % c == 0:\r\n s = b // c \r\nelse :\r\n s = b // c + 1 \r\nprint(s * ss)", "from math import ceil\r\n\r\n\r\nn, m, a = [int(i) for i in input().split()]\r\nrow = ceil(m / a)\r\ncol = ceil(n / a)\r\nprint(row * col)", "n,m,a = map(int,input().split())\r\nnum = 0\r\nq = n // a\r\nn %= a\r\nif n != 0:\r\n q += 1\r\nw = m // a\r\nm %= a\r\nif m != 0:\r\n w += 1\r\nprint(q*w)", "def main():\r\n line=input()\r\n line=line.split()\r\n n=int(line[0])\r\n m=int(line[1])\r\n a=int(line[2])\r\n x=n//a\r\n if n%a!=0:\r\n x+=1\r\n y=m//a\r\n if m%a!=0:\r\n y+=1\r\n print(x*y)\r\nmain()", "def TheatreSquare():\r\n l = ( n + a - 1 ) // a\r\n r = (m + a - 1) // a\r\n\r\n return l * r\r\n\r\nn,m,a = map(int, input().split())\r\nans = TheatreSquare()\r\nprint(ans)", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nx = (n + a - 1) // a\r\ny = (m + a - 1) // a\r\n\r\nprint(x * y)\r\n", "n,m,a=map(int,input().split())\r\nn2=n//a\r\nm2=m//a\r\nif n%a!=0:\r\n n2=n2+1\r\nif m%a!=0:\r\n m2=m2+1\r\nprint(m2*n2)\r\n \r\n", "data=list(map(int,input().split()))\nif((data[0]%data[2])>=1):\n x=1\nelse:\n x=0\nif((data[1]%data[2])>=1):\n y=1\nelse:\n y=0\nprint((int(data[0]/data[2])+x)*(int(data[1]/data[2])+y))\n \t\t\t \t\t\t \t\t\t \t \t\t\t \t \t", "n, m, a = map(int, (input()).split())\r\nt = n //a\r\nx = m // a\r\nif n % a != 0 :\r\n t += 1\r\nelif n % a == 0:\r\n t = t\r\nif m % a != 0 :\r\n x +=1\r\nprint(t*x)", "from math import ceil\r\na,b,c=map(int,input().split())\r\nD=ceil(a/c)\r\nE=ceil(b/c)\r\nprint(int(D*E))", "a, b, c = map(int, input().split())\r\nif a / c % 1 != 0:\r\n first = a // c + 1\r\nelse:\r\n first = a // c\r\nif b / c % 1 != 0:\r\n second = b // c + 1\r\nelse:\r\n second = b // c\r\nprint(first * second)", "n, m, a = map(int, input().split())\r\nrows = -(-n // a)\r\ncols = -(-m // a)\r\ntotal_flagstones = rows * cols\r\n\r\nprint(total_flagstones) \r\n \t\t\t\t \t \t\t \t\t \t\t \t\t\t \t", "n, m ,a = map(int, input().split())\r\nsquares = 0\r\nif n % a > 0:\r\n squares = n // a\r\n squares += 1\r\nelse:\r\n squares = n // a\r\nif m % a > 0:\r\n squares = squares * (m // a + 1)\r\nelse:\r\n squares = squares * (m // a)\r\nprint(squares)", "m,n,x=map(int,input().split())\r\na=(m+x-1)//x\r\nb=(n+x-1)//x\r\nprint(a*b)", "import math\r\ndef main():\r\n line = input()\r\n tokens = str.split(line, \" \")\r\n n = int(tokens[0])\r\n m = int(tokens[1])\r\n a = int(tokens[2])\r\n \r\n vertical_count = int(math.ceil(n / a))\r\n horizontal_count = int(math.ceil(m / a))\r\n print(vertical_count * horizontal_count)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "m,n,s=map(int,input().split())\r\nprint(-m//s*(-n//s))\r\n\r\n\r\n\r\n", "import math\r\n\r\nn, m, a = map(int, input().split())\r\n\r\nwidth_flagstones = math.ceil(n / a)\r\nheight_flagstones = math.ceil(m / a)\r\ntotal_flagstones = width_flagstones * height_flagstones\r\n\r\nprint(total_flagstones)\r\n", "import math\n\n# Read the input values\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\nneeded_flagstones = math.ceil(n / a) * math.ceil(m / a)\n\n# Print the result\nprint(needed_flagstones)\n\t\t\t\t\t \t\t \t \t\t\t\t \t\t \t\t\t\t\t\t \t", "\n\nx,y,a=map(int,input().split(\" \"))\n\ndef dic(n,m):\n if n%m==0:\n return int(n/m)\n else:\n return int(n/m)+1\n\nc=dic(x,a)*dic(y,a)\n\nprint(c)", "n, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed for the length (n) and width (m)\r\nlength_flagstones = (n + a - 1) // a\r\nwidth_flagstones = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones required\r\ntotal_flagstones = length_flagstones * width_flagstones\r\n\r\nprint(total_flagstones)\r\n", "n,m,a = map(int,input().split())\r\nif n%a == 0:\r\n x = n//a\r\nelse:\r\n x = n//a + 1\r\nif m%a == 0:\r\n y = m//a\r\nelse:\r\n y = m//a + 1\r\nprint(x*y)", "import math\r\na,b,c = map(int,input().split())\r\nx = math.ceil(a/c)\r\ny = math.ceil(b/c)\r\nprint(x*y)\r\n", "from math import ceil\r\ne = input()\r\ng = e.split()\r\nf = [int(i) for i in g]\r\nn = f[0]\r\nm = f[1]\r\na = f[2]\r\nans = ceil(n/a)*ceil(m/a)\r\nprint(ans)\r\n", "n,m,a = map(int, input().split(sep=\" \"))\r\nnDivide = int(n/a) if n%a==0 else int(n/a)+1\r\nmDivide = int(m/a) if m%a==0 else int(m/a)+1\r\nprint(nDivide*mDivide)", "import math\r\n\r\nm,n, a = [int(x) for x in input().split()]\r\n\r\nprint(math.ceil(m/a)*math.ceil(n/a))", "n, m, a = map(int, input().split())\r\nif m%a==0:\r\n\tval1=m//a \r\nelse:\r\n\tval1=m//a+1 \r\n\r\nif n%a==0:\r\n\tval2=n//a\r\nelse:\r\n\tval2=n//a+1\r\n\r\n\r\nprint(val1*val2)", "import sys\ninput = sys.stdin.buffer.readline\nm, n, a = map(int, input().split())\n\nrow = (m // a) + bool(m % a)\ncol = (n // a) + bool(n % a)\n\nprint(row * col)\n\n\n\n\n\n\n\t\n\n\n \n\n", "# -*- coding: utf-8 -*-\n\"\"\"\nSpyder Editor\n\nThis is a temporary script file.\n\"\"\"\nfrom math import ceil\nn,m,a = map(int,input().split())\nprint(int(ceil(n/a)*ceil(m/a)))", "v = [int(x) for x in input().split(' ')]\r\n\r\nimport math\r\nif v[0] >= v[2] and v[1] >= v[2]:\r\n print(math.ceil(v[0]/v[2])*math.ceil(v[1]/v[2]))\r\nelif v[0] >= v[2]:\r\n print(math.ceil(v[0]/v[2]))\r\nelif v[1] >= v[2]:\r\n print(math.ceil(v[1]/v[2]))\r\nelse:\r\n print(1)", "m, n, a = map(int, input().split())\r\n\r\nw = -(-m//a)\r\n\r\nh = -(-n//a)\r\n\r\nprint(w*h)\r\n\r\n", "c=input()\r\n\r\nc=c.split(\" \")\r\nn,m,a=int(c[0]),int(c[1]),int(c[2])\r\n\r\nres = ((n//a)+min(n%a,1))*((m//a)+min(m%a,1))\r\nprint(res)", "import math\n\nx = input().split()\nn = int(x[0])\nm = int(x[1])\na = int(x[2])\n\no = math.ceil(n/a)\np = math.ceil(m/a)\n\nq = o * p\n\nprint(q)", "import math\r\nn,m,a=map(int,input().split())\r\ns,t=math.ceil(n/a),math.ceil(m/a)\r\nprint(s*t)\r\n", "a,b,n=map(int,input().split())\r\nif(a%n == 0):\r\n r1=a//n\r\nelse:\r\n r1=a//n+1\r\nif(b%n == 0):\r\n r2=b//n\r\nelse:\r\n r2=b//n+1\r\nprint(r1*r2)", "import math\r\n\r\nipt = input()\r\nm,n,a = [int(x) for x in ipt.split()]\r\n\r\nl = math.ceil(m/a)\r\nb = math.ceil(n/a)\r\n\r\nprint(l*b)", "# -*- coding: utf-8 -*-\r\n\r\nentries = input().split()\r\nn = int(entries[0])\r\nm = int(entries[1])\r\na = int(entries[2])\r\n\r\nwidth = n // a\r\nheight = m // a\r\n\r\nif n % a != 0:\r\n width += 1\r\nif m % a != 0:\r\n height += 1\r\n\r\nprint(width*height)", "nums = list(map(int, input().split(' ')))\r\n\r\nx = 1\r\ny = 1\r\n\r\nif nums[2] < nums[0]:\r\n x = int(nums[0] / nums[2]) + (nums[0] % nums[2] > 0)\r\nif nums[2] < nums[1]:\r\n y = int(nums[1] / nums[2]) + (nums[1] % nums[2] > 0)\r\n\r\nprint(x*y)\r\n", "n,m,a=map(int,input().split())\r\nif n%a==0:\r\n x=int(n/a) \r\nelse:\r\n x=int((n/a)+1)\r\nif m%a==0:\r\n y=int(m/a)\r\nelse:\r\n y=int((m/a)+1)\r\nprint(x*y) ", "s=list(map(int, input().split(\" \")))\r\nn=s[0]\r\nm=s[1]\r\na=s[2]\r\nif n%a==0:\r\n if m%a==0:\r\n print(int(m*n/a/a))\r\n else:\r\n print(int(n/a*(int(m/a)+1)))\r\nelse:\r\n if m%a==0:\r\n print(int(m/a*(int(n/a)+1)))\r\n else:\r\n print((int(m/a)+1)*(int(n/a)+1))", "# LUOGU_RID: 101946540\nn,m,a = map(int,input().split())\r\nans = 0\r\nif(n%a!=0):\r\n n= n//a+1\r\nelse:\r\n n= n//a\r\n\r\nif(m%a!=0):\r\n m= m//a+1\r\nelse:\r\n m= m//a\r\n\r\nprint(n*m) ", "import math\r\na,b,c=tuple(map(int,input().split()))\r\nprint(int(math.ceil(a/c)) *int(math.ceil(b/c)) if int(round(a/c,ndigits=0) *round(b/c,ndigits=0))>0 else 1)\r\n\r\n", "n,m,a=map(int,input().split())\r\nif (n/a)%1==0:\r\n x=n//a\r\nelse:\r\n x=n//a+1\r\nif (m/a)%1==0:\r\n y=m//a\r\nelse:\r\n y=m//a+1\r\nprint(x*y)", "# LUOGU_RID: 113789607\nimport math\r\n\r\nl = input().split()\r\nn,m,a = int(l[0]),int(l[1]),int(l[2])\r\nprint(math.ceil(n / a) * math.ceil(m / a))", "import math\r\n\r\nlst = list(map(int, input().split()))\r\nans=0;\r\nans = math.ceil(lst[0]/lst[2]) * math.ceil(lst[1]/lst[2])\r\nprint(ans)", "import math\r\nn,m,a=map(int, input().split())\r\nc=math.ceil(n/a)\r\nd=math.ceil(m/a)\r\nprint(c*d)", "# Input the values of n, m, and a\r\nn, m, a = map(int, input().split())\r\n\r\n# Calculate the number of flagstones needed\r\nhorizontal_flagstones = (n + a - 1) // a\r\nvertical_flagstones = (m + a - 1) // a\r\n\r\n# Calculate the total number of flagstones required\r\ntotal_flagstones = horizontal_flagstones * vertical_flagstones\r\n\r\n# Output the result\r\nprint(total_flagstones)\r\n", "n,m,a=[int(i) for i in input().split()]\nfrom math import ceil\nprint(ceil(m/a)*ceil(n/a))", "n, m, a = map(int, input().split(\" \"))\r\nif m%a==0:\r\n temp=m//a\r\nelse: temp=m//a+1\r\n\r\nif n%a==0:\r\n temp1=n//a\r\nelse: temp1=n//a+1\r\n\r\nprint(temp1*temp)\r\n\r\n", "n, m , a = map(int,input().split())\r\nx = n//a\r\nif n%a!=0:\r\n x+=1\r\ny = m//a\r\nif m%a!=0:\r\n y+=1\r\nprint(x*y)\r\n \r\n", "#___________Afsan Habib___________#\r\nimport sys\r\ninput = sys.stdin.readline\r\n \r\n#___________Start Input Functions___________#\r\ndef int_num():\r\n return (int(input()))\r\n \r\ndef int_list():\r\n return (list(map(int,input().split())))\r\n \r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n \r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\n#___________End Input Functions___________\r\n\r\n\r\n\r\n\r\n\r\n#___________Start Solve Functions___________#\r\n\r\ndef solve():\r\n\r\n\tm,n,a=map(int,input().split())\r\n\r\n\tif m%a==0:\r\n\t\tb=m//a\r\n\telse:\r\n\t\tb=m//a+1\r\n\r\n\r\n\tif n%a==0:\r\n\t\tc=n//a\r\n\telse:\r\n\t\tc=n//a+1\r\n\t\r\n\tprint(b*c)\r\n\r\n\r\n\r\n \r\n#___________End Solve Functions___________\r\n \r\n\r\n\r\n\r\n\r\n\r\n#___________Start Main Functions___________#\r\ndef main():\r\n\tsolve()\r\n\treturn\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n#___________End Main Functions___________\r\n", "import math\r\nn, m, a = [int(i) for i in input().split()]\r\nif a>m and a>n:\r\n print(1)\r\nelif a>=m:\r\n print(math.ceil(n/a))\r\nelif a>=n:\r\n print(math.ceil(m/a))\r\nelse:\r\n print(math.ceil(n/a) * math.ceil(m/a))", "from math import ceil\r\nn,m,a=map(int,input().split()) \r\n\r\nr1=ceil(n/a)\r\nr2=ceil(m/a)\r\nprint(r1*r2)", "m, n, a = map(int, input().split())\r\n\r\na_m = m // a + (1 if m % a > 0 else 0)\r\na_n = n // a + (1 if n % a > 0 else 0)\r\n\r\nresult = a_m * a_n\r\n\r\nprint(result)", "m, n , a = map(int, input().split())\r\ncountx = n // a + int(n % a != 0)\r\ncounty = m // a + int(m % a != 0)\r\nprint(countx * county)", "import math\n\ndef least_flagstones(n, m, z):\n return math.ceil(n/z) * math.ceil(m/z)\n\nn, m, z = map(int, input().split())\nprint(least_flagstones(n, m, z))\n\t\t \t \t \t \t\t\t \t\t\t\t \t \t \t \t \t", "import math\r\n\r\n\r\nn,m,a = input().split()\r\nx = math.ceil(int(n)/int(a))\r\ny = math.ceil(int(m)/int(a))\r\nprint(x*y)", "# LUOGU_RID: 121895068\nm,n,a=map(int,input().split(\" \"))\r\nif m % a == 0:\r\n x = m // a\r\nelse:\r\n x = m // a + 1\r\nif n % a == 0:\r\n y = n // a\r\nelse:\r\n y = n // a + 1\r\nprint(x*y)\r\n# zj", "n, m, a = map(int, input().split())\n\nhorizontal_flagstones = m // a + (m % a > 0)\nvertical_flagstones = n // a + (n % a > 0)\n\ntotal_flagstones = horizontal_flagstones * vertical_flagstones\n\nprint(total_flagstones)\n\n\t \t\t \t \t \t\t \t\t\t \t \t\t\t\t \t\t \t", "import math\r\nrs1,rs2,ss=map(int,input().split())\r\nrequired=math.ceil(rs1/ss)*math.ceil(rs2/ss)\r\nprint(required)\r\n", "import math\n\n# Read the values of n, m, and a\nn, m, a = map(int, input().split())\n\n# Calculate the number of flagstones needed\nnum_flagstones = math.ceil(n / a) * math.ceil(m / a)\n\n# Print the result\nprint(num_flagstones)\n\n\t \t \t \t \t \t \t \t\t \t \t", "from math import ceil as c\r\nn,m,a=map(float,input().split())\r\nprint(c(m/a)*c(n/a))", "inp = str(input()).split()\r\nn,m,a = int(inp[0]), int(inp[1]), int(inp[2])\r\n\r\np = -(-n//a)\r\nc = p\r\nq = -(-m//a)\r\nif q > 1:\r\n c = p * q\r\nprint(c)\r\n\r\n", "import math\r\nq = str(input()).split(\" \")\r\nn = int(q[0])\r\nm = int(q[1])\r\na = int(q[2])\r\n\r\ns = math.ceil(n / a)\r\nb = math.ceil(m / a)\r\nprint(s * b)", "from math import *\nimport sys\n\nn = [int(x) for x in input().split()]\n\nprint(ceil(n[0]/n[2])*ceil(n[1]/n[2]))\n\n\t \t \t \t \t\t \t\t \t\t \t \t\t\t \t", "import math\r\ninp = list(map(int,input().split()))\r\nnx = math.ceil(inp[0]/inp[2])\r\nmx = math.ceil(inp[1]/inp[2])\r\ntot = nx*mx\r\nprint(tot)", "\"\"\"\r\nauthor: manoj.py\r\n\r\n6 6 4\r\n4\r\n\r\n\"\"\"\r\n\r\nimport math\r\n\r\nn, m, a = list(map(int, input().split()))\r\n\r\nx = math.ceil(n/a)\r\ny = math.ceil(m/a)\r\nprint(x*y)", "a,b,c=map(int,input().split())\r\n\r\nif b%c==0:\r\n r=b//c\r\nelse:\r\n r=b//c+1\r\n \r\nif a%c==0:\r\n r1=a//c\r\nelse:\r\n r1=a//c+1\r\n \r\nprint(r1*r) \r\n \r\n ", "n,m,a = map(int,input().split())\r\nprint(abs(-1*n//a)*abs(-1*m//a))", "n,m,a = input().split()\r\nn,m,a = int(n), int(m), int(a)\r\n \r\nanswer = ((n+a-1)//a) * ((m+a-1)//a)\r\nprint(answer)" ]

[ "# n, m = tuple([int(x) for x in input().split()])\n# cycle_length = (m - 1) * 2\n# for _ in range(n):\n# \ta, b, c = tuple([int(x) for x in input().split()])\n# \ta -= 1\n# \tb -= 1\n# \tif(a > b):\n# \t\ta = cycle_length - a\n# \t\tb = cycle_length - b\n# \telif(a == b):\n# \t\tprint(c)\n# \t\tcontinue\n# \tif(a >= c % cycle_length):\n# \t\tprint((c // cycle_length) * cycle_length + b)\n# \telse:\n# \t\tprint((c // cycle_length) * cycle_length + b + cycle_length)\n\n# codeforces should increase the run time allotted...\n# The solution runs in O(n) time but times out on input\n# Below, replaced input statements with input statements\n# copied from 205669844\n\nfrom sys import stdin\n\nn, m = map(int, stdin.readline().split())\ncycle_length = (m - 1) * 2\nfor _ in range(n):\n\ta, b, c = map(int, stdin.readline().split())\n\ta -= 1\n\tb -= 1\n\tif(a > b):\n\t\ta = cycle_length - a\n\t\tb = cycle_length - b\n\telif(a == b):\n\t\tprint(c)\n\t\tcontinue\n\tif(a >= c % cycle_length):\n\t\tprint((c // cycle_length) * cycle_length + b)\n\telse:\n\t\tprint((c // cycle_length) * cycle_length + b + cycle_length)", "n,m=map(int,input().split())\r\nm-=1\r\na=[]\r\nfor i in range(n):\r\n s,f,t=map(int,input().split())\r\n s-=1\r\n f-=1\r\n if s==f:\r\n a.append(t)\r\n elif s<f:\r\n c=s\r\n while c<t:\r\n c+=2*m\r\n a.append(c+f-s)\r\n else:\r\n c=m*2-s\r\n while c<t:\r\n c+=2*m\r\n a.append(c+s-f)\r\nprint('\\n'.join(map(str, a)))\r\n \r\n", "from sys import stdin\r\n\r\n\r\nn, m = map(int, stdin.readline().split())\r\n\r\nfor _ in range(n):\r\n s, f, t = map(int, stdin.readline().split())\r\n res = t + abs(s - f)\r\n\r\n if s != f:\r\n s -= 1\r\n f -= 1\r\n\r\n if s > f:\r\n s = m - 1 - s\r\n f = m - 1 - f\r\n t -= m - 1\r\n\r\n t %= (m - 1) * 2\r\n\r\n if t <= s:\r\n res += s - t\r\n else:\r\n res += (m - 1) * 2 - (t - s)\r\n\r\n print(res)\r\n", "n, m = map(int, input().split())\r\nk = 2 * (m - 1)\r\np = [0] * n\r\nfor i in range(n):\r\n s, f, t = map(int, input().split())\r\n d = t % k\r\n if s < f: p[i] = (k if s <= d else 0) + f - 1 + t - d\r\n elif f < s: p[i] = (k if d + s > k + 1 else 0) + k + 1 - f + t - d\r\n else: p[i] = t\r\nprint('\\n'.join(map(str, p)))", "from sys import stdin,stdout\r\na,b=map(int,stdin.readline().split())\r\nans=2*(b-1)\r\nok=[0]*a\r\nfor i in range(a):\r\n x,y,z=map(int,stdin.readline().split())\r\n if x==y:ok[i]=(z)\r\n elif x<y:\r\n if z<x:ok[i]=y-1\r\n else:ok[i]=ans*((z+ans-x)//ans)+y-1\r\n else:\r\n k=b-1\r\n x=b+1-x\r\n y=b+1-y\r\n z-=k\r\n if z < x:ok[i]=k+y - 1\r\n else: ok[i]=k+ans * ((z + ans - x ) // ans) + y - 1\r\nstdout.write(\" \".join(map(str,ok)))", "def main():\n x = input().split()\n n = int(x[0])\n m = int(x[1])\n for i in range(n):\n x = input().split()\n start = int(x[0])\n finish = int(x[1])\n timeinit = int(x[2])\n if(start == finish):\n print(timeinit)\n elif(start < finish):\n trips = 0\n while(timeinit > 2*trips*(m-1) + start - 1):\n trips += 1\n timef = 2*trips*(m-1) + finish - 1\n print(timef)\n else:\n trips = 0\n while(timeinit > 2*(m-1)*(trips+1) - start + 1):\n trips += 1\n timef = 2*(m -1)*(trips + 1) + 1 - finish\n print(timef)\n\nmain()" ]

[ "import sys\r\n\r\nn, m, k = map(int, input().split())\r\nmatrix = [[0]*m] + [list(map(int, input().split())) for _ in range(n)]\r\n\r\nfor j in range(m):\r\n for i in range(1, n+1):\r\n matrix[i][j] += matrix[i-1][j]\r\n\r\nans = [0, 0]\r\n\r\nfor j in range(m):\r\n max_one, rem = 0, 0\r\n for i in range(k, n+1):\r\n if max_one < matrix[i][j] - matrix[i-k][j]:\r\n max_one = matrix[i][j] - matrix[i-k][j]\r\n rem = matrix[i-k][j]\r\n\r\n ans[0] += max_one\r\n ans[1] += rem\r\n\r\nprint(*ans)\r\n", "n, m, k = map(int, input().split()); a = []; b = []; score = []; ct = 0\r\n\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\n\r\n\r\nfor i in range(m): b.append([])\r\nfor i in range(m):\r\n for j in range(n):\r\n b[i].append(a[j][i])\r\n \r\nfor i in range(m):\r\n maxsums = []\r\n for j in range(n):\r\n if b[i][j] == 1:\r\n if j + k < n: maxsums.append(sum(b[i][j:j + k]))\r\n else: maxsums.append(sum(b[i][j:])) \r\n try:\r\n score.append(max(maxsums))\r\n ct += maxsums.index(max(maxsums))\r\n except: pass\r\nprint(sum(score), ct)\r\n", "n,m,k=map(int,input().split())\r\ns,c=0,0\r\nr=[list(map(int,input().split())) for i in range(n)]\r\nfor i in zip(*r):\r\n a,b=0,0\r\n for j in range(n-k+1):\r\n a1,b1 = sum(i[j:j+k]),sum(i[:j])\r\n if a1>a:\r\n a=a1\r\n b=b1\r\n s+=a\r\n c+=b\r\nprint(s,c) \r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,m,k=map(int,input().split())\r\na=[list(map(int,input().split())) for i in range(n)]\r\nb=[[a[i][j] for j in range(m)] for i in range(n)]\r\nfor j in range(m):\r\n for i in range(n):\r\n for d in range(1,k):\r\n if i+d<n:\r\n b[i][j]+=b[i+d][j]\r\ns=0\r\ncnt=0\r\nfor j in range(m):\r\n score=0\r\n cnt_j=0\r\n max_score=0\r\n cnt_max=0\r\n flag=True\r\n while flag:\r\n flag=False\r\n for i in range(n):\r\n if a[i][j]==1:\r\n flag=True\r\n score=b[i][j]\r\n if score>max_score:\r\n max_score=score\r\n cnt_max=cnt_j\r\n a[i][j]=0\r\n cnt_j+=1\r\n if not flag:\r\n break\r\n s+=max_score\r\n cnt+=cnt_max\r\nprint(s,cnt)", "def main():\r\n rows, cols, k = map(int, input().split())\r\n mat = [[0 for j in range(cols)] for i in range(rows)]\r\n is_one = [[False for j in range(cols)] for i in range(rows)]\r\n \r\n for i in range(rows):\r\n vals = list(map(int, input().split()))\r\n for j in range(cols):\r\n is_one[i][j] = vals[j] == 1\r\n mat[i][j] += vals[j]\r\n if i - k >= 0:\r\n mat[i - k][j] -= vals[j]\r\n \r\n for j in range(cols):\r\n for i in range(rows - 2, -1, -1):\r\n mat[i][j] += mat[i + 1][j]\r\n \r\n max_score = 0\r\n min_moves = 0\r\n \r\n for j in range(cols):\r\n score = 0\r\n moves = 0\r\n best_moves = 0\r\n \r\n for i in range(rows):\r\n if not is_one[i][j]:\r\n continue\r\n \r\n if mat[i][j] > score:\r\n score = mat[i][j]\r\n best_moves = moves\r\n moves += 1\r\n \r\n max_score += score\r\n min_moves += best_moves\r\n \r\n print(max_score, min_moves)\r\n \r\nmain()", "nmk = list(map(int, input().split()))\r\nn = nmk[0]\r\nm = nmk[1]\r\nk = nmk[2]\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nsum = 0\r\nz = 0\r\nfor i in range(m):\r\n sums = [a[0][i]]\r\n for j in range(1, n):\r\n sums.append(sums[-1] + a[j][i])\r\n\r\n max_sum = 0\r\n max_ones = 0\r\n cur_ones = 0\r\n for j in range(n):\r\n if a[j][i] == 1:\r\n cur_ones += 1\r\n if j + k - 1 < n:\r\n if j > 0:\r\n s = sums[j + k - 1] - sums[j - 1]\r\n else:\r\n s = sums[j + k - 1]\r\n else:\r\n if j > 0:\r\n s = sums[n - 1] - sums[j - 1]\r\n else:\r\n s = sums[n - 1]\r\n if s > max_sum:\r\n max_sum = s\r\n max_ones = cur_ones - 1\r\n\r\n sum += max_sum\r\n z += max_ones\r\n\r\nprint(sum, z)\r\n", "f = lambda: map(int, input().split())\r\nn, m, k = f()\r\ns = d = 0\r\nfor t in zip(*[f() for i in range(n)]):\r\n p, q = x, y = sum(t[:k]), 0\r\n for a, b in zip(t[:n - k], t[k:]):\r\n p += b - a\r\n q += a\r\n if p > x: x, y = p, q\r\n s += x\r\n d += y\r\nprint(s, d)", "while True:\n try:\n \t\n \tdef read():\n \t\tn, m, k = map(int, input().split())\n \t\tmat = [ ]\n \t\tfor i in range(n):\n \t\t\tmat.append(list(map(int, input().split())))\n \t\tsolve(n, m, k, mat)\n \t\n \tdef solve(n, m, k, mat):\n \t\t#print(n, m, k, mat)\n \t\tans = rplc = cunt = 0\n \t\ti, j = 0, 0\n \t\twhile i < m:\n \t\t\tj = 0\n \t\t\ts = 0\n \t\t\tpos, rplc = 0, 0\n \t\t\twhile j < n:\n \t\t\t\tif mat[j][i] == 1:\n \t\t\t\t\tz, t = j, 0\n \t\t\t\t\twhile z < j+k and z < n:\n \t\t\t\t\t\tt += mat[z][i]\n \t\t\t\t\t\tz += 1\n \t\t\t\t\t\t#print(i,j,k,z)\n \t\t\t\t\tif t > s:\n \t\t\t\t\t\ts = t\n \t\t\t\t\t\trplc = pos\n \t\t\t\t\tpos += 1\n \t\t\t\tj += 1\n \t\t\ti += 1\n \t\t\tans += s\n \t\t\tcunt += rplc\n \t\tprint(ans, cunt)\n \t\t\t\t\t\n \tif __name__ == \"__main__\":\n \t\tread()\n \t\t\n \t\t\n except EOFError:\n break\n \t\t \t \t \t \t\t\t\t\t \t \t \t \t\t", "n,m,k=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n l.append([int(j) for j in input().split()])\r\nchanges=0\r\nscore=0\r\nfor j in range(m):\r\n max=0\r\n c1=0\r\n for i in range(n):\r\n l1=[]\r\n if (i<=n-k):\r\n for z in range(k):\r\n l1.append(l[i+z][j])\r\n else:\r\n for z in range(i,n):\r\n l1.append(l[z][j])\r\n if (l1[0]==1):\r\n c2=l1.count(1)\r\n if (c2>max):\r\n max=c2\r\n else:\r\n continue\r\n if (max==0):\r\n if (n==1):\r\n if (l[0][j]==1):\r\n score+=1\r\n else:\r\n for i in range(n):\r\n l1=[]\r\n if (i<=n-k):\r\n for z in range(k):\r\n l1.append(l[i+z][j])\r\n else:\r\n for z in range(i,n):\r\n l1.append(l[z][j])\r\n if (l1[0]==1):\r\n c2=l1.count(1)\r\n if (c2==max):\r\n score+=max\r\n changes+=c1\r\n break\r\n else:\r\n c1+=1\r\nprint (score,changes)\r\n\r\n\r\n\r\n\r\n\r\n", "n, m, k = [int(p) for p in input().split()]\nmatrix = []\nfor i in range(n):\n matrix.append([int(p) for p in input().split()])\n\n\n\n\ndef best(col):\n results = {\n\n }\n for row in range(n):\n if matrix[row][col] == 1:\n results[row] = 1\n for r2 in range(row + 1, min(row+k, n)):\n if matrix[r2][col] == 1:\n results[row] += 1\n # print(results)\n rows = list(sorted(results.keys()))\n best_result = None\n for row in rows:\n if best_result is None or best_result['res'] < results[row]:\n best_result = {'res': results[row], 'idx': row}\n if best_result is None:\n return 0, 0\n # calcualte replacements\n replacements = 0\n idx = best_result['idx']\n for row in rows:\n if row < idx:\n replacements += 1\n return best_result['res'], replacements\n\nresult = 0\nreplacements = 0\nfor col in range(m):\n # Go down on col\n # print(f'On col {# col}')\n res, repl = best(col)\n result += res\n replacements += repl\nprint(\"{} {}\".format(result, replacements))", "n,m,k = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nmx =0\r\nch = 0\r\nfor i in range(m):\r\n ched = -1\r\n mxh = 0\r\n gch = 0\r\n for j in range(n):\r\n ans = 0\r\n if a[j][i]:\r\n ched += 1\r\n for z in range(j,min(j+k,n)):\r\n ans+=a[z][i]\r\n if(mxh<ans):\r\n mxh = ans\r\n gch = ched\r\n mx+=mxh\r\n ch+=gch\r\nprint(mx,ch)", "n, m, k = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\npr = [[0 for _ in range(m + 1)] for _ in range(n + 1)]\r\nfor j in range(1, m + 1):\r\n for i in range(1, n + 1):\r\n if i == 0:\r\n continue\r\n else:\r\n pr[i][j] = pr[i - 1][j] + a[i - 1][j - 1]\r\nresult = [0 for _ in range(m + 1)]\r\nd = [0 for _ in range(m + 1)]\r\nfor j in range(1, m + 1):\r\n for i in range(1, n + 1):\r\n if a[i - 1][j - 1] == 1:\r\n value = pr[min(k + i - 1, n)][j] - pr[i - 1][j]\r\n if result[j] < value:\r\n result[j] = value\r\n if i != 0:\r\n d[j] = pr[i - 1][j]\r\n\r\nanswer_res = 0\r\nanswer_d = 0\r\nfor j in range(m + 1):\r\n answer_res += result[j]\r\n answer_d += d[j]\r\nprint(answer_res, answer_d)", "n, m, k = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(m):\r\n a.append([0] * n)\r\nfor i in range(n):\r\n t = input().split()\r\n for j in range(m):\r\n a[j][i] = int(t[j])\r\nmaxs = 0\r\nr = 0\r\nfor i in a:\r\n maxframe = 0\r\n mfp = -1\r\n for j in range(n - k + 1):\r\n if sum(i[j:j + k]) > maxframe:\r\n maxframe = sum(i[j:j + k])\r\n mfp = j\r\n maxs += maxframe\r\n r += sum(i[:mfp])\r\nprint(maxs, r)", "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 = [[] for _ in range(M)]\r\nfor _ in range(N):\r\n t = list(map(int, input().split()))\r\n for i in range(M):\r\n A[i].append(t[i])\r\n\r\nans,cnt=0,0\r\nfor i in range(M):\r\n a = A[i]\r\n tmp = deque([])\r\n cur = 0\r\n dels = 0\r\n t1,c1=0,0\r\n for j in range(N):\r\n tmp.append(a[j])\r\n cur+=a[j]\r\n while tmp and (tmp[0]==0 or len(tmp)>K):\r\n tt = tmp.popleft()\r\n if tt:\r\n dels+=1\r\n cur-=1\r\n if cur>t1:\r\n t1 = cur\r\n c1 = dels\r\n ans+=t1\r\n cnt+=c1\r\n #print(i,t1,c1)\r\n \r\nprint(ans,cnt)\r\n \r\n \r\n ", "n, m, k = map(int, input().split())\r\nA = [list(map(int, input().split())) for i in range(n)]\r\n\r\nans = 0\r\ncost = 0\r\nfor i in range(m):\r\n M = 0\r\n cur_cost = 0\r\n cnt = 0\r\n for j in range(n):\r\n if A[j][i] == 1:\r\n cnt += 1\r\n temp = 0\r\n for l in range(j, min(j+k, n)):\r\n temp += A[l][i]\r\n if M < temp:\r\n M = temp\r\n cur_cost = cnt-1\r\n ans += M\r\n cost += cur_cost\r\nprint(ans, cost)\r\n", "n,m,k = [int(i) for i in input().split()]\ns = []\no = 0\nfor i in range(m):\n s.append([])\nfor i in range(n):\n l = [int(i) for i in input().split(\" \")]\n for i in range(m):\n (s[i]).append(l[i])\n# print(s)\nresult = 0\nc = 0\nfor x in s:\n count = 0\n for i in range(n-k+1):\n #print(i)\n count = max(count, sum(x[i:i+k]))\n if count == k:\n break\n for i in range(n-k+1):\n if sum(x[i:i+k]) == count:\n c += sum(x[:i])\n break\n result += count\n\nprint(result, c)\n", "\r\nn,m,k = [int(i) for i in input().split()]\r\na = []\r\n\r\nfor i in range(n):\r\n b = [int(i) for i in input().split()]\r\n a.append(b)\r\n\r\nb = [0]*m\r\nfor i in range(k+2): a.append(b)\r\n\r\nscore = 0\r\nrepl = 0\r\n\r\nfor j in range(m):\r\n cur_sum = 0\r\n cur_max = 0\r\n cur_best_repl = 0\r\n cur_repl = 0\r\n \r\n for i in range(k): cur_sum += a[i][j]\r\n\r\n for i in range(n):\r\n if a[i][j] == 0:\r\n cur_sum += a[i+k][j]\r\n continue\r\n if cur_max < cur_sum:\r\n cur_max = cur_sum\r\n cur_best_repl = cur_repl\r\n\r\n cur_sum = cur_sum -1 + a[i+k][j]\r\n cur_repl += 1\r\n\r\n score += cur_max\r\n repl += cur_best_repl\r\n\r\nprint(score, repl)\r\n \r\n \r\n", "num,num2,num3=map(int,input().split())\ncont1,cont2=0,0\nresult=[list(map(int,input().split())) for i in range(num)]\nfor i in zip(*result):\n a,b=0,0\n for j in range(num-num3+1):\n f,h=sum(i[j:j + num3]),sum(i[:j])\n if f>a:a,b=f,h\n cont1 += a\n cont2 += b\nprint(cont1,cont2,end=' ')\n\t \t\t\t\t \t \t \t\t\t \t \t\t \t\t\t \t", "R = lambda: map(int, input().split())\r\nn, m, k = R()\r\nmx = []\r\nfor i in range(n):\r\n mx.append(list(R()))\r\nsc, rm = 0, 0\r\nfor c in range(m):\r\n arr = [mx[r][c] for r in range(n)]\r\n j = 0\r\n cnt = cntj = 0\r\n tsc, trm = 0, 0\r\n for i in range(n):\r\n cnt += arr[i]\r\n while i - j + 1 > k:\r\n cntj += arr[j]\r\n cnt -= arr[j]\r\n j += 1\r\n if cnt > tsc:\r\n tsc = cnt\r\n trm = cntj\r\n sc += tsc\r\n rm += trm\r\nprint(sc, rm)", "(n, m, k) = map(int, input().split())\r\nsums = [[] for i in range(m)]\r\nfor i in range(n):\r\n str = input().split()\r\n for j in range(m):\r\n if i == 0:\r\n sums[j].append(int(str[j]))\r\n else:\r\n sums[j].append(sums[j][i - 1] + int(str[j]))\r\nans1 = 0\r\nans2 = 0\r\nfor j in range(m):\r\n cans1 = 0\r\n cans2 = 0\r\n for i in range(n):\r\n if i > 0:\r\n y = sums[j][i - 1]\r\n else:\r\n y = 0\r\n x = sums[j][min(i + k - 1, n - 1)] - y\r\n if x > cans1:\r\n cans1 = x\r\n cans2 = y\r\n ans1 += cans1\r\n ans2 += cans2\r\nprint(ans1, ans2)", "import math\r\n#n,m=map(int,input().split())\r\nfrom collections import Counter\r\n#for i in range(n):\r\nimport math\r\n#for _ in range(int(input())):\r\n#n = int(input())\r\n#for _ in range(int(input())):\r\n#n = int(input())\r\nimport bisect\r\n'''for _ in range(int(input())):\r\n\r\n n=int(input())\r\n\r\n n,k=map(int, input().split())\r\n\r\n arr = list(map(int, input().split()))'''\r\nn,m,k=map(int,input().split())\r\nR=[list(map(int,input().split()))for i in range(n)]\r\ns=0\r\nt=0\r\nfor i in zip(*R):\r\n var=0\r\n tt=0\r\n flag=0\r\n for j in range(n):\r\n if i[j]==1:\r\n f=1\r\n for r in range(j+1,min(j+k,n)):\r\n f+=i[r]\r\n\r\n if f>var:\r\n var=f\r\n tt=flag\r\n flag+=1\r\n s+=var\r\n t+=tt\r\nprint(s, t)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m, k = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\nacc = [[0] for _ in range(m)]\r\n\r\nfor i in range(m):\r\n for j in range(n):\r\n acc[i].append(acc[i][-1]+(1 if a[j][i]==1 else 0))\r\n \r\nans_0 = 0\r\nans_1 = 0\r\n\r\nfor i in range(m):\r\n if acc[i][n]-acc[i][0]==0:\r\n continue\r\n \r\n chg = 0\r\n l = []\r\n \r\n for j in range(n):\r\n if a[j][i]==1:\r\n l.append((acc[i][min(n, j+k)]-acc[i][j], chg))\r\n chg += 1\r\n \r\n l.sort(key=lambda k: (-k[0], k[1]))\r\n ans_0 += l[0][0]\r\n ans_1 += l[0][1]\r\n\r\nprint(ans_0, ans_1)", "n,m, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nans = 0\r\nans1 = 0\r\nfor j in range(m):\r\n mv = 0\r\n td = 0\r\n cc = 0\r\n no = 0\r\n for i in range(n):\r\n if a[i][j]:\r\n v = 0\r\n for z in range(i, min(i+k, n)):\r\n v += a[z][j]\r\n if v > mv:\r\n mv = v\r\n td = no\r\n no += 1\r\n ans += mv\r\n ans1 += td\r\nprint(ans, ans1)", "n,m,k=map(int,input().split())\ns=list()\nfor i in range(1,n+1):\n zc=list(map(int,input().split()))\n s.append(zc)\nsum=cs=0\nfor j in range(0,m):\n a=b=0\n for i in range(0,n):\n if(s[i][j]==1):\n for l in range(i,i+min(k,n-i)):\n if(s[l][j]==1): a+=1\n dqggcs=ggcs=0\n for l in range(i+1,n):\n if(s[l][j]==1):\n zcb=0\n for p in range(l,l+min(k,n-l)):\n if(s[p][j]==1): zcb+=1\n ggcs+=1\n if(zcb>b):\n b=zcb\n dqggcs=ggcs\n break\n if(a<b):\n cs+=dqggcs\n sum+=max(a,b)\nprint('%d %d' %(sum,cs))\n \t \t \t \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "from sys import stdin, stdout\r\n\r\nn, m, k = map(int, stdin.readline().split())\r\nvalues = []\r\n\r\nfor i in range(n):\r\n values.append(list(map(int, stdin.readline().split())))\r\n\r\nstrings = []\r\nfor j in range(m):\r\n counting = []\r\n \r\n for i in range(n):\r\n counting.append(values[i][j])\r\n \r\n strings.append(counting)\r\n\r\n\r\nans, cnt = 0, 0\r\nfor i in range(m):\r\n if not strings[i].count(1):\r\n continue\r\n \r\n pos = strings[i].index(1)\r\n for j in range(n - k + 1):\r\n if sum(strings[i][j: j + k]) > sum(strings[i][pos: pos + k]):\r\n pos = j\r\n \r\n if pos != strings[i].index(1):\r\n cnt += sum(strings[i][:pos])\r\n \r\n ans += sum(strings[i][pos: pos + k])\r\n\r\nstdout.write(str(ans) + ' ' + str(cnt))", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/12 23:03\r\n\r\n\"\"\"\r\n\r\nn, m, k = map(int, input().split())\r\n\r\na = []\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\n\r\n\r\nremoved = 0\r\nscore = 0\r\nfor c in range(m):\r\n count, sr = 0, 0\r\n for r in range(n):\r\n tc = sum([a[x][c] for x in range(r, min(r+k, n))])\r\n if tc > count:\r\n count = tc\r\n sr = r\r\n score += count\r\n removed += sum([a[r][c] for r in range(sr)])\r\n\r\nprint(score, removed)\r\n\r\n\r\n", "n, m, k = map(int, input().split())\r\nar = []\r\n\r\nfor i in range(n):\r\n\tar.append(list(map(int, input().split())))\r\n\r\nscore = 0\r\nmin_moves = 0\r\nfor j in range(m):\r\n\tcr = [ar[i][j] for i in range(n)]\r\n\tc = 0\r\n\tmaxi = 0\r\n\tr_s = 0\r\n\tr_m = 0\r\n\tfor i in range(len(cr)):\r\n\t\tif cr[i] == 1:\r\n\t\t\tmaxi = sum(cr[i:i+k])\r\n\t\t\tif maxi > r_s:\r\n\t\t\t\tr_s = maxi\r\n\t\t\t\tr_m = c\r\n\t\t\tc += 1\r\n\r\n\tscore += r_s\r\n\tmin_moves += r_m\r\n\r\nprint(score, min_moves)", "n,m,k=map(int,input().split())\nl=[]\nfor i in range(n):\n l.append(list(map(int,input().split())))\nl=map(list,zip(*l))\nscore,chx=0,0\nfor row in l:\n sumx=sum(row[:k])\n val,idx=sumx,0\n for i,j in enumerate(row[k:]):\n sumx+=j-row[i]\n if sumx>val:\n val=sumx\n idx=i\n score+=val\n chx+=sum(row[:idx])\nprint(score,chx)\n", "from sys import stdin\r\n\r\n\r\ndef main():\r\n\tn, m, l = map(int, stdin.readline().split())\r\n\tmat = []\r\n\tfor _ in range(n):\r\n\t\tmat.append(list(map(int, stdin.readline().split())))\r\n\tmax_score = 0\r\n\tans = 0\r\n\tfor i in range(m):\r\n\t\tmax_curr_score = 0\r\n\t\tcurr_cost = 0\r\n\t\tcount = 0\r\n\t\tfor j in range(n):\r\n\t\t\tif mat[j][i] == 1:\r\n\t\t\t\tcount += 1\r\n\t\t\t\tcurr_score = 0\r\n\t\t\t\tfor k in range(j, min(j + l, n)):\r\n\t\t\t\t\tcurr_score += mat[k][i]\r\n\t\t\t\tif max_curr_score < curr_score:\r\n\t\t\t\t\tmax_curr_score = curr_score\r\n\t\t\t\t\tcurr_cost = count - 1\r\n\t\tmax_score += max_curr_score\r\n\t\tans += curr_cost\r\n\tprint(max_score, ans)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\ndef solve(l, k):\r\n ans = 0\r\n cnt = 0\r\n move = 0\r\n n = len(l)\r\n # print(l)\r\n for i in range(n):\r\n if(l[i] == 1):\r\n temp = 0\r\n mm = k+i\r\n if(k+i>n):\r\n mm = n\r\n temp = sum(l[i:mm])\r\n # print(\"dfsnakfknjasd\", temp)\r\n # ans = max(ans, temp)\r\n if(temp> ans):\r\n ans = temp\r\n move = cnt\r\n cnt +=1\r\n\r\n # print(ans, move)\r\n return (ans, move)\r\n \r\n\r\n\r\nn, m, k = map(int, input().split())\r\nl = []\r\nfor i in range(m):\r\n l.append([])\r\n\r\nfor i in range(n):\r\n tp = [int(x) for x in input().split()]\r\n for j in range(m):\r\n l[j].append(tp[j])\r\na = 0\r\nb = 0\r\nfor i in l:\r\n ss = solve(i, k)\r\n a+= ss[0]\r\n b+=ss[1]\r\n\r\nprint(a, b)", "import sys\r\nfrom collections import defaultdict\r\n\r\ninput = sys.stdin.readline\r\n\r\nn,m,k = map(int, input().strip().split())\r\ngrid = []\r\nfor i in range(n):\r\n arr = list(map(int, input().strip().split()))\r\n grid.append(arr)\r\n \r\nfin = 0\r\nrem = 0\r\nmat = list(map(list, zip(*grid)))\r\n\r\nfor row in mat:\r\n if row.count(1)<1: continue\r\n temp = [0]*n\r\n ans=curr=0\r\n for i in range(n):\r\n if row[i]==1:\r\n temp[i] = sum(row[i:i+min(k,n-i)])\r\n if temp[i]>curr:\r\n curr = temp[i]\r\n ans=i\r\n \r\n for i in range(ans): rem+=row[i]==1\r\n fin += sum(row[ans:ans+min(k,n-ans)])\r\n \r\nprint(fin,rem)", "n,m,k=map(int,input().split())\r\nq=[map(int,input().split()) for i in range(n)]\r\nx,y=0,0\r\nfor i in zip(*q):\r\n z,f=0,0\r\n for j in range(n-k+1):\r\n g,h=sum(i[j:j+k]),sum(i[:j])\r\n if g>z:\r\n z=g\r\n f=h\r\n x+=z\r\n y+=f\r\nprint(x,y)", "n,m,k=map(int,input().split())\r\ns,c=0,0\r\nR=[list(map(int,input().split())) for i in range(n)]\r\nfor i in zip(*R):\r\n a,b=0,0\r\n for j in range(n-k+1):\r\n f,h=sum(i[j:j+k]),sum(i[:j])\r\n if f>a:a,b=f,h\r\n s+=a\r\n c+=b\r\nprint(s,c,end=' ')", "n, m, k = map(int, input().split())\r\na = []\r\nfor _ in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\ntotal = 0\r\ncount = 0\r\n\r\nfor col in range(m):\r\n b = [0] * n\r\n b[0] = a[0][col]\r\n for row in range(1, n):\r\n b[row] = b[row - 1] + a[row][col]\r\n \r\n maxSum = 0\r\n chg = 0\r\n \r\n for row in range(n):\r\n if a[row][col] == 0:\r\n continue\r\n s = b[row - 1] if row > 0 else 0\r\n f = b[row + k - 1] if row + k - 1 <= n - 1 else b[n - 1]\r\n sum_val = f - s\r\n if sum_val > maxSum:\r\n chg = s\r\n maxSum = sum_val\r\n \r\n total += maxSum\r\n count += chg\r\n\r\nprint(total, count)\r\n###From jasnah bobb31\r\n###From jasnah bobb31\r\n###From jasnah bobb31", "import bisect\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\nans = [0, 0]\r\nfor j in range(m):\r\n x = []\r\n for i in range(n):\r\n if a[i][j] == 1:\r\n x.append(i)\r\n m, c = 0, 0\r\n for i in range(len(x)):\r\n j = bisect.bisect_left(x, x[i] + k - 0.5)\r\n if m < j - i:\r\n m = j - i\r\n c = i\r\n ans[0] += m\r\n ans[1] += c\r\nprint(*ans)", "n, m, k = [int(x) for x in input().split()]\r\nmatrix = []\r\nfor _ in range(n):\r\n matrix.append([int(x) for x in input().split()])\r\n\r\nsum_score = 0\r\nsum_remove = 0\r\nfor i in range(m):\r\n num_of_ones = [0]\r\n num1 = 0\r\n for j in range(n):\r\n if matrix[j][i] == 1:\r\n num1 += 1\r\n num_of_ones.append(num1)\r\n\r\n max_score = 0\r\n num_remove = 0\r\n for j in range(0, n - k + 1):\r\n num_of_ones_in_range = num_of_ones[j + k] - num_of_ones[j]\r\n if num_of_ones_in_range > max_score:\r\n max_score = num_of_ones_in_range\r\n num_remove = num_of_ones[j]\r\n sum_score += max_score\r\n sum_remove += num_remove\r\n\r\nprint(sum_score, sum_remove)\r\n", "n,m,k = map(int,input().split())\nx,y = 0,0\na = []\n\nfor i in range(n):\n\ta.append(list(map(int, input().split())))\n\nfor i in zip(*a):\n\tu,v = 0,0\n\tfor j in range(n-k+1):\n\t\tp,q = sum(i[j:j+k]), sum(i[:j])\n\t\tif p > u:\n\t\t\tu = p\n\t\t\tv = q\n\tx += u\n\ty += v\n\nprint(x,y)" ]

[ "n = int(input())\r\nmoves = 0\r\nwhile n >0 :\r\n if n >=5:\r\n n-=5\r\n elif n>=4:\r\n n-=4\r\n elif n>=3:\r\n n-=3\r\n elif n>=2:\r\n n-=2\r\n elif n>= 1:\r\n n-=1\r\n\r\n moves+=1\r\n\r\nprint(moves)", "x = int(input()) \npasos = (x + 4) // 5 \nprint(pasos) \n\n\t \t\t\t \t \t\t\t\t \t \t \t\t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\nm = int(input())\r\ns = 1\r\nwhile m > 5:\r\n m -= 5\r\n s += 1\r\nprint(s)", "n = int(input())\r\nr = n %5\r\nq = n // 5\r\n\r\nif r == 0:\r\n print(q)\r\nelse:\r\n print(q+1)", "import math\nx = int(input())\nprint(math.ceil(x/5)) ", "n=int(input())\r\nans=0\r\nwhile(n>0):\r\n if(n>=5):\r\n ans+=1\r\n n-=5\r\n elif(n>=4):\r\n ans+=1\r\n n-=4\r\n elif(n>=3):\r\n ans+=1\r\n n-=3\r\n elif(n>=2):\r\n ans+=1\r\n n-=2\r\n else:\r\n ans+=1\r\n n-=1\r\nprint(ans)\r\n ", "def min_steps_to_reach(x):\r\n steps = x // 5\r\n if x % 5 != 0:\r\n steps += 1\r\n return steps\r\n\r\nx = int(input())\r\n\r\nresult = min_steps_to_reach(x)\r\nprint(result)\r\n", "x= int(input())\r\n\r\nsteps = x // 5 \r\nif x %5 != 0:\r\n steps +=1\r\n \r\nprint(steps)", "x = int(input())\r\nn = x%5\r\nif (n<0): print(1)\r\nelif (n>0): print(int(((x-n)/5)+1))\r\nelse: print(int(((x-n)/5)))", "#import re\r\na = int(input())\r\nprint((a+4)//5)", "x = int(input()) # Read the coordinate of the friend's house\r\n\r\nsteps = (x + 4) // 5 # Calculate the minimum number of steps\r\n\r\nprint(steps) # Output the minimum number of steps", "a=int(input())\r\n\r\ncount=0\r\nif (a%5)!=0:\r\n count=count+1\r\na=a/5\r\ncount=count+a\r\nprint(int(count))", "n=int(input())\r\ncounter=0\r\nwhile n>0:\r\n for i in range(5,0,-1):\r\n while n>=i:\r\n n-=i\r\n counter+=1\r\n if n==0:\r\n break\r\nprint(counter)", "from math import ceil\r\n\r\na = int(input())\r\nb = ceil(a / 5)\r\n\r\nprint(b)\r\n\r\n", "def ex(n):\n chod = [1, 2, 3, 4, 5]\n if n in chod:\n return 1\n k = 4\n final = 0\n while True:\n if n - chod[k] == 0:\n return final + 1\n elif n - chod[k] > 0:\n final += 1\n n = n - chod[k]\n else:\n k -= 1\n\nn = int(input())\nprint(ex(n))\n\t\t\t\t\t \t\t \t\t \t \t \t\t \t\t \t\t \t", "x=int(input(''))\r\nif x%5==0:\r\n steps=x//5\r\n print(steps)\r\nelse:\r\n steps=(int((x/5)))+1\r\n print(steps)\r\n", "x=int(input())\r\nstep=[5,4,3,2,1]\r\nct=0\r\ny=len(step)\r\nfor i in range (y):\r\n if(x>=step[i]):\r\n ct=ct+ (x//step[i])\r\n x=x%step[i]\r\n\r\nprint(ct)\r\n", "import math\n\nx = int(input())\n\nmin_steps = math.ceil(x / 5)\n\n# Print the result\nprint(min_steps)\n\n\t\t \t \t\t \t \t\t\t \t \t\t \t\t", "# -*- coding: utf-8 -*-\n\"\"\"A. Elephant\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/18dzm1R8Wq5W627D9TUJQdrvST1psy7SR\n\"\"\"\n\nhouse = int(input())\n\nsteps = house // 5\n\nif house % 5 != 0:\n steps += 1\n\nprint(steps)", "def step(dis):\r\n stack = [1, 2, 3, 4, 5]\r\n ans = 0\r\n while dis > 0:\r\n if stack[-1] <= dis:\r\n dis = dis - stack[-1]\r\n ans += 1\r\n else:\r\n while stack and stack[-1] > dis:\r\n stack.pop()\r\n return ans\r\n\r\n\r\ndis = int(input())\r\nprint(step(dis))", "x = int(input())\r\np = x//5 + (x % 5)//4 + (x % 5 % 4)//3 + (x %\r\n 5 % 4 % 3)//2 + (x % 5 % 4 % 3 % 2)\r\nprint(p)\r\n", "import math\r\nW=int(input())\r\n\r\nif W<=5:\r\n print(1)\r\nelse:\r\n print(math.ceil(W/5))", "import math\r\n\r\ndistance = int(input())\r\n\r\nmovement_counter = 0\r\n\r\nwhile distance != 0:\r\n\r\n if distance >= 5:\r\n\r\n movement_counter += math.floor(distance / 5)\r\n distance %= 5\r\n\r\n else:\r\n\r\n movement_counter += 1\r\n distance = 0\r\n\r\nprint(movement_counter)", "a=int(input())\r\nif a % 5 == 0:\r\n print(a//5)\r\nelse:\r\n print(a//5+1)", "valid_steps = [1, 2, 3, 4, 5]\r\nx = int(input())\r\nstep = 0\r\nwhile x >= 0:\r\n if x >= 5:\r\n x = x - 5\r\n step = step + 1\r\n elif 4 <= x < 5:\r\n x = x - 4\r\n step = step + 1\r\n elif 3 <= x < 4:\r\n x = x - 3\r\n step = step + 1\r\n elif 2 <= x < 3:\r\n x = x - 2\r\n step = step + 1\r\n elif 1 <= x < 2:\r\n x = x - 1\r\n step = step + 1\r\n\r\n elif x == 0:\r\n break\r\nprint(step)\r\n", "def min_steps_to_friend_house(x):\n # Calculate the number of steps needed\n steps = (x + 4) // 5\n return steps\n\n# Read input\nx = int(input())\n\n# Calculate and print the result\nresult = min_steps_to_friend_house(x)\nprint(result)\n\n\t \t\t \t \t \t \t\t\t\t \t \t\t \t\t", "x=int(input())\ncont=0\nwhile x!=0:\n if x>=5: \n x-=5\n cont+=1\n if(x==4):\n x-=4\n cont+=1\n if(x==3):\n x-=3\n cont+=1\n if(x==2):\n x-=2\n cont+=1\n if(x==1):\n x-=1\n cont+=1\nprint(cont)", "import math\r\nhouse = int(input(\"\"))\r\nans = math.ceil(house/5)\r\nprint(ans)", "import sys\r\n\r\nx = int(sys.stdin.readline().split()[0])\r\n\r\nsteps = [0 for i in range(5)]\r\n\r\ni = 5\r\ntotal_steps = 0\r\n\r\nwhile i >= 1:\r\n steps[i-1] = int(x / i)\r\n x = x - steps[i-1] * i\r\n total_steps += steps[i-1]\r\n\r\n if x <= 0:\r\n break\r\n i -= 1\r\n\r\nprint(total_steps)", "a=int(input())\r\nb=a//5\r\ns=0\r\nfor i in range(10):\r\n s+=1\r\nif a%5==0:\r\n print(b)\r\nelse:\r\n print(b+1)", "num = int(input())\r\ncount = 1\r\nwhile(num>5):\r\n num = num-5;\r\n count +=1\r\nprint(count)", "x=int(input())\r\nprint((x-1)//5+1)", "import math\nb=int(input())\nprint(math.ceil(b/5))\n\t\t \t \t\t \t \t \t \t\t\t\t \t\t", "n = int(input())\r\nx = 0\r\nstep = 0\r\nwhile x!=n:\r\n if n-x >= 5:\r\n x+=5\r\n elif n-x >= 4:\r\n x+=4\r\n elif n-x >= 3:\r\n x+=3\r\n elif n-x >= 2:\r\n x+=2\r\n elif n-x >= 1:\r\n x+=1\r\n step+=1\r\nprint(step)", "a=int(input())\r\nb=int((a/5)+1)\r\nc=int(a/5)\r\nif a<5:\r\n print(1)\r\nelif a%5==0:\r\n print(c)\r\nelse:\r\n print(b)", "a=int(input())\r\nb=a//5+1\r\nc=a%5\r\nif c==0:\r\n b=b-1\r\nprint(b)", "import math\nn=int(input())\nprint(math.ceil(n/5))#print\n\t\t \t\t \t\t\t\t \t \t\t\t\t", "\nx = int(input())\nmin_steps = (x + 4) // 5\nprint(min_steps)#klm\n\n\t\t\t\t \t\t\t\t\t \t\t\t \t\t \t \t\t", "n = int(input())\ny = n\nz = 0\nminimum = []\nsteps = [1, 2, 3, 4, 5]\ni = len(steps) - 2\nflag = False\nif 1 <= n <= 1000000:\n while i >= 0:\n if y % 5 != 0:\n y = n\n y -= steps[i]\n else:\n if i == len(steps) - 2:\n flag = True\n break\n z = i + 1\n break\n i -= 1\n\n x = int(y / 5)\n for k in range(x):\n minimum.append(5)\n if not flag:\n minimum.append(steps[z])\n\nprint(len(minimum))\n\t\t \t\t\t\t\t\t\t\t\t \t \t\t \t\t\t \t\t\t", "a=int(input())\r\nprint(a//5 if a%5==0 else a//5+1)", "x = int(input())\r\nsteps = [5,4,3,2,1]\r\ni = 0\r\ncnt = 0\r\nwhile x!=0:\r\n if x >= steps[i]:\r\n x -= steps[i]\r\n cnt += 1\r\n else:\r\n i += 1\r\n\r\nprint(cnt)", "x = int(input())\r\n\r\nif x % 5 == 0:\r\n print(int(x / 5))\r\n \r\nelse:\r\n steps = 1\r\n steps += x // 5\r\n print(steps)", "import math\r\ndef elephant():\r\n steps = [5,4,3,2,1]\r\n dis = int(input())\r\n found = False\r\n totalS = 0\r\n for step in steps:\r\n if not found:\r\n if dis >= step:\r\n f = int(math.floor(dis / step))\r\n F = f*step\r\n totalS = totalS + f\r\n dis = dis - F \r\n print(totalS)\r\nelephant()", "x = int(input())\r\nprint(x//5 + (x%5 != 0))", "x = int(input())\r\n\r\ncount = 0\r\n\r\nwhile x>0:\r\n x-=5\r\n count+=1\r\nprint(count)", "t = input().split()\r\nb = 0\r\nfor i in range(len(t)):\r\n t[i] = int(t[i])\r\n\r\ni = t[0]\r\n\r\nwhile i:\r\n if i > 4:\r\n i -= 5\r\n b += 1\r\n \r\n elif i > 3:\r\n i -= 4\r\n b += 1\r\n \r\n elif i > 2:\r\n i -= 3\r\n b += 1\r\n \r\n elif i > 1:\r\n i -= 2\r\n b += 1\r\n \r\n elif i > 0:\r\n i -= 1\r\n b += 1\r\nprint(b)", "import math\n\nx = int(input()) # Input the coordinate of the friend's house\n\n# Calculate the minimum number of steps\nmin_steps = math.ceil(x / 5)\n\nprint(min_steps)\n\n\t\t\t \t \t \t\t\t\t\t\t \t\t\t \t \t\t\t \t", "x = int(input())\r\nsteps=x//5 \r\nif x%5!=0:\r\n steps+=1\r\n \r\nprint(steps)", "import math\nn=int(input())\nprint(math.ceil(n/5))\n#dfg\n\t \t \t \t\t \t \t \t\t\t\t", "x=int(input(\"\"))\r\nposition=0\r\nif x%5==0:\r\n c=x//5\r\n position+=c\r\nelif x%5!=0:\r\n c=(x//5)+1 \r\n position+=c\r\nprint(position) \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 11 21:34:28 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\n\r\ndis=int(input())\r\nif dis<=5:\r\n re=1\r\nelif dis % 5 ==0:\r\n re=dis//5\r\nelse:\r\n x=dis//5\r\n re=x+1\r\nprint(re)", "x = int(input())\r\n\r\nprint(x // 5 if x % 5 == 0 else x // 5 + 1)", "import sys\r\n\r\ncoordinate_x = int(sys.stdin.readline().strip()) # 5\r\n\r\nall_steps = 0\r\n\r\nstep_1 = 1\r\nstep_2 = 2\r\nstep_3 = 3\r\nstep_4 = 4\r\nstep_5 = 5\r\n\r\nwhile coordinate_x != 0:\r\n if step_5 <= coordinate_x:\r\n all_steps += 1\r\n coordinate_x -= step_5\r\n elif step_4 <= coordinate_x:\r\n all_steps += 1\r\n coordinate_x -= step_4\r\n elif step_3 <= coordinate_x:\r\n all_steps += 1\r\n coordinate_x -= step_3\r\n elif step_2 <= coordinate_x:\r\n all_steps += 1\r\n coordinate_x -= step_2\r\n elif step_1 <= coordinate_x:\r\n all_steps += 1\r\n coordinate_x -= step_1\r\n\r\nsys.stdout.write(str(all_steps))", "x = int(input())\r\nd = 0\r\ncount = 0\r\nif x%5==0:\r\n count = x/5\r\nelse:\r\n d1 = x - x%5\r\n count= (d1)/5\r\n for i in range(1,5):\r\n if x%5 == i:\r\n count = count +1\r\nprint(int(count))", "n = int(input())\r\nres = n // 5\r\n\r\nif n % 5 != 0:\r\n res += 1\r\n\r\nprint(res)\r\n", "coordinates = int(input())\r\n\r\nif coordinates % 5 == 0:\r\n min_steps = coordinates // 5\r\nelse:\r\n min_steps = (coordinates // 5) + 1\r\n\r\nprint(min_steps)", "x = int(input()) # Input: The coordinate of the friend's house\r\n\r\n# Calculate the number of steps of length 5\r\nsteps_of_5 = x // 5\r\n\r\n# Calculate the remaining distance\r\nremaining_distance = x % 5\r\n\r\n# Calculate the total number of steps\r\ntotal_steps = steps_of_5 + (1 if remaining_distance > 0 else 0)\r\n\r\n# Output the minimum number of steps\r\nprint(total_steps)", "frnds_cord = int(input())\r\nif frnds_cord % 5 == 0:\r\n\r\n print(int(frnds_cord/5))\r\nelse:\r\n previous=int(frnds_cord/5)\r\n print(previous+1)", "n = int(input())\r\n\r\nif n%5==0:\r\n n//=5\r\n \r\nelse:\r\n n = (n//5)+1\r\n \r\nprint(n)", "x = int(input())\r\n\r\nrez = 0\r\nif x <= 5:\r\n print(1)\r\nelif x % 5 == 0:\r\n print(int(x/5))\r\nelse:\r\n print(x//5 + 1)\r\n ", "import math\r\na=int(input())\r\ns=math.ceil(a / 5)\r\nprint(s)", "x = int(input())\r\n\r\ncount = x // 5 # количество полных перемещений на 5 позиций\r\nremainder = x % 5 # остаток от деления x на 5\r\n\r\nif remainder > 0:\r\n count += 1 # добавляем еще одно перемещение для достижения остатка\r\n\r\nprint(count)", "x=int(input())\r\nif x%5==0:\r\n n=int(x/5)\r\nelse:\r\n n=(x//5)+1\r\nprint(str(n))", "x=int(input())\r\n\r\nsteps=(x//5)\r\n\r\nif (x%5)!=0:\r\n steps=steps+1\r\n\r\nprint(steps)\r\n", "x = int(input())\r\nsteps = 0\r\nwhile x:\r\n if x >= 5:\r\n x -= 5\r\n elif x >= 4 :\r\n x -= 4\r\n elif x >= 3:\r\n x -=3\r\n elif x >= 2:\r\n x -= 2\r\n else:\r\n x -= 1\r\n steps += 1\r\nprint(steps)", "x = int(input())\r\nres = (x // 5)\r\nif x % 5 > 0:\r\n print(res + 1)\r\nelse:\r\n print(res)\r\n\r\n", "n=int(input())\r\n\r\nr=int(n/5)\r\nif n%5!=0:\r\n r+=1\r\nprint(r)", "moves = [1,2,3,4,5]\r\nx = int(input())\r\ncount =0\r\nindx=4\r\nwhile x!=0 and indx>=0:\r\n if x-moves[indx]>=0:\r\n count=count+1\r\n x = x-moves[indx]\r\n else:\r\n indx=indx-1\r\nprint(count)", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n ans = 0\r\n for i in range(5, 0, -1):\r\n ans += n//i\r\n n = n%i\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "num = int(input())\r\nk = num//5\r\nfor i in [1,2,3,4]:\r\n if (num-i)%5==0:\r\n k = k+1\r\n break\r\nprint(k)", "x = int(input())\r\ncolvopyat = x//5\r\nif x % 5 == 0:\r\n print(colvopyat)\r\nelse:\r\n print(colvopyat + 1)", "ins = int(input())\r\nif ins % 5 != 0:\r\n result = ins // 5 + 1\r\nelse:\r\n result = int(ins/5)\r\nprint(result)", "a=int(input())\r\ncount=0\r\n\r\nwhile a>0:\r\n if a-5>=0:\r\n a-=5\r\n count+=1\r\n continue\r\n if a-4>=0:\r\n a-=4\r\n count+=1\r\n continue\r\n if a-3>=0:\r\n a-=3\r\n count+=1\r\n continue\r\n if a-2>=0:\r\n a-=2\r\n count+=1\r\n continue\r\n if a-1>=0:\r\n a-=1\r\n count+=1\r\n continue\r\nprint(count)", "n=int(input())\r\nx=n//5\r\nx1=n%5\r\nif x1>0:\r\n x=x+1\r\nprint(x)", "n = int(input())\r\nmoves = [1,2,3,4,5]\r\nif n in moves:\r\n print(1)\r\nelif n%5 != 0:\r\n print(n//5 + 1)\r\nelse:\r\n print(n//5)", "x = int(input())\r\nimport math\r\nprint(math.ceil(x/5))", "\r\nn=int(input())\r\nif(n%5==0):\r\n print(int(n/5))\r\nelse:\r\n print(int(n//5+1))", "c1=0\r\na=int(input())\r\nwhile a-5>=0:\r\n a=a-5\r\n c1+=1\r\nwhile a-4>=0:\r\n a=a-4\r\n c1+=1\r\nwhile a-3>=0:\r\n a=a-3\r\n c1+=1\r\nwhile a-2>=0:\r\n a=a-2\r\n c1+=1\r\nwhile a-1>=0:\r\n a=a-1\r\n c1+=1\r\nprint(c1)\r\n", "def elephant_steps(x):\r\n steps = x // 5\r\n\r\n if x % 5 != 0:\r\n steps += 1\r\n\r\n return steps\r\n\r\nx = int(input())\r\n\r\nprint(elephant_steps(x))\r\n", "n=int(input())\r\nres=n%5\r\nif(res==0):\r\n print(n//5)\r\nelse:\r\n print((n//5)+1)", "import math\r\nx=int(input(\"\"))\r\nstep=int(math.ceil(x/5))\r\nprint(step)", "def min_steps_to_friend(x):\r\n steps = (x + 4) // 5\r\n return steps\r\n\r\n\r\nx = int(input())\r\n\r\n\r\nresult = min_steps_to_friend(x)\r\n\r\n\r\nprint(result)\r\n", "X=int(input())\r\nY=int(X/5)\r\nif X%5==0:\r\n print(Y)\r\nelse:\r\n print(Y+1)", "x = int(input())\r\nsteps = 0 \r\nfor step_size in range(5, 0, -1):\r\n # находит количество шагов по step size\r\n steps += x // step_size\r\n # количество шагов после того как мы сделали максимальное количество шагов по step size\r\n x = x % step_size\r\n if x == 0:\r\n break\r\nprint(steps)\r\n\r\n\r\n", "fH = int(input()) # Friends house in distance\r\n\r\nmoves = 0\r\n\r\nwhile fH != 0:\r\n if fH >= 5:\r\n fH -= 5\r\n moves += 1\r\n\r\n elif fH >= 4:\r\n fH -= 4\r\n moves += 1\r\n\r\n elif fH >= 3:\r\n fH -= 3\r\n moves += 1\r\n\r\n elif fH >= 2:\r\n fH -= 2\r\n moves += 1\r\n\r\n elif fH >= 1:\r\n fH -= 1\r\n moves += 1\r\n\r\nprint(moves)", "inp = int(input())\r\nout = 0\r\n\r\nwhile (inp > 0):\r\n if inp >= 5:\r\n inp -= 5\r\n out += 1\r\n elif inp >= 4:\r\n inp -= 4\r\n out += 1\r\n elif inp >= 3:\r\n inp -= 3\r\n out += 1\r\n elif inp >= 2:\r\n inp -=2\r\n out += 1\r\n elif inp >= 1:\r\n inp -=1\r\n out += 1\r\nprint(out)\r\n", "k=0\r\nfor i in range(0,int(input()),5):k=k+1\r\nprint(k)", "num= int(input())\r\nif num%5==0:\r\n print(num//5)\r\nelse:\r\n print(num//5+1)", "distance=int(input())\r\na=distance//5\r\ndistance=distance-5*a\r\nb=distance//4\r\ndistance=distance-4*b\r\nc=distance//3\r\ndistance=distance-3*c\r\nd=distance//2\r\ndistance=distance-2*d\r\ne=distance\r\nf=a+b+c+d+e\r\nprint(f)\r\n", "distance = int(input())\r\nremaining_steps = distance % 5\r\ntotal_steps = (distance-remaining_steps)//5\r\nprint(total_steps) if remaining_steps == 0 else print(total_steps+1)\r\n", "from math import ceil\r\nx=int(input())\r\nprint(ceil(x/5))\r\n", "n = int(input())\r\ng = 0\r\nwhile n != 0:\r\n if n >= 5:\r\n t = n // 5\r\n g += 1 * t\r\n n -= 5 * t\r\n elif n >= 4:\r\n t = n // 4\r\n g += 1 * t\r\n n -= 4 * t\r\n elif n >= 3:\r\n t = n // 3\r\n g += 1 * t\r\n n -= 3 * t\r\n elif n >= 2:\r\n t = n // 2\r\n g += 1 * t\r\n n -= 2 * t\r\n elif n == 1:\r\n g += 1 \r\n n -= 1\r\nprint(g)\r\n", "x = int(input())\r\ntotal = 0\r\nwhile x > 5:\r\n total += 1\r\n x -= 5\r\nprint(total + 1)", "n=int(input())\nif n%5==0:\n\ta=n//5\n\tprint(a)\nelif n < 5:\n\tprint(1)\nelse:\n\tb=n//5\n\tprint(b+1)\n\t \t \t\t\t \t \t\t \t \t \t \t", "x = int(input())\r\nstep = 5\r\ncount = 0\r\nwhile x > 0 and step > 0:\r\n if x >= step:\r\n x -= step\r\n count += 1\r\n else:\r\n step -= 1\r\n \r\nprint(count)", "n = int(input())\r\nif (n%5 != 0):\r\n\tprint(n//5 + 1)\r\nelse:\r\n\tprint(int(n/5))", "arr = list(range(1, 6))\r\narr.reverse()\r\n# print(arr)\r\n\r\nn = int(input())\r\n\r\ntotal=0\r\n\r\nfor i in arr:\r\n if n>=i:\r\n # print(i)\r\n total+= int(n/i)\r\n n = n%i\r\n # print(n)\r\n # print()\r\n\r\n# print()\r\nprint(total)", "length = int(input())\r\nmove = length // 5\r\nif length % 5 != 0:\r\n move += 1\r\nprint(move)\r\n", "n = int(input())\r\n\r\nres = 0\r\nres = n//5\r\nif(n%5!=0):\r\n res = res+1\r\nprint(res)", "x = int(input())\r\nprint (int((x+4)/5))", "x=int(input())\r\nsteps=(x+4)//5\r\nprint(steps)", "a=int(input())\r\nif a%5==0:\r\n print(a//5)\r\nelse:\r\n print((a+5)//5)\r\n", "n = int(input())\r\nprint((n + 4) // 5)\r\n", "x = int(input())\r\nskaits = x // 5\r\nif x % 5 != 0:\r\n skaits += 1\r\nprint(skaits)", "x = int(input())\r\nprint(x//5 + (x%5!=0))", "from math import ceil\r\ndistance = int(input())\r\nresult = ceil(distance / 5)\r\n\r\nprint(result)", "n=int(input())\r\nif (n%5!=0):\r\n print(int(n/5) + 1)\r\nelse:\r\n print(int(n/5))", "def elep(x):\r\n if(x==1 or x==2 or x==3 or x==4 or x==5):\r\n return 1\r\n else:\r\n r=x//5\r\n if(x%5!=0):\r\n r=r+1\r\n return r\r\nx=int(input())\r\ny=elep(x)\r\nprint(y)", "n = int(input())\r\nans = int(n // 5)\r\nif n % 5 == 0:\r\n print(ans)\r\nelse:\r\n print(ans + 1)", "dp = {}\r\n\r\nx = int(input())\r\nstep = x//5 \r\nstep += 1 if x%5 else 0\r\nprint(step)\r\n", "s=eval(input(\"\"))\r\np=0\r\n\r\nif s%5==0:\r\n print(int(s/5))\r\nelse:\r\n print(s//5+1)\r\n ", "import sys\r\n\r\nx = int(sys.stdin.readline().split()[0])\r\n\r\nn = [0 for i in range(5)]\r\n\r\ni = 5\r\na = 0\r\n\r\nwhile i >= 1: \r\n n[i-1] = int(x / i)\r\n x = x - n[i-1] * i\r\n a += n[i-1]\r\n \r\n if x <= 0:\r\n break\r\n\r\n i -= 1\r\n\r\nprint(a)\r\n", "x = int(input())\r\nif x%5 == 0:\r\n n = int(x/5)\r\nelse:\r\n n = int(x/5)+1\r\n\r\nprint(n)\r\n", "x=int(input())\r\ndef steps(x):\r\n if x%5==0:\r\n return x//5\r\n else:\r\n return x//5 + 1\r\nprint(steps(x))\r\n", "import sys\r\n\r\n\r\ndef iinp():\r\n return int(sys.stdin.readline().strip())\r\n\r\n\r\ndef linp():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef lsinp():\r\n return sys.stdin.readline().strip().split()\r\n\r\n\r\ndef digit():\r\n return [int(i) for i in (list(sys.stdin.readline().strip()))]\r\n\r\n\r\ndef char():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict\r\n\r\n\r\ndef summ(n):\r\n return sum(int(i) for i in list(str(n)))\r\n\r\n\r\nfrom math import ceil\r\n\r\n\r\ndef solve():\r\n k = iinp()\r\n print(ceil(k / 5))\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "a = int(input())\r\nb = a%5\r\nif b==0:\r\n print(a//5)\r\nelse:\r\n print(a//5+1)\r\n", "a=int(input())\r\nc=0\r\nif a>5:\r\n while True:\r\n a-=5\r\n c+=1\r\n if a<=5:\r\n print(c+1)\r\n break\r\nelse:\r\n print(1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def elephant(nombre):\r\n res=0\r\n while(nombre>5):\r\n nombre=nombre-5\r\n res=res+1\r\n return(res+1)\r\n\r\nx=int(input())\r\nprint(elephant(x))", "import math\nn = int(input())\nmoves = 0\nmoves += math.floor(n/5)\nn -= math.floor(n/5)*5\nmoves += math.floor(n/4)\nn -= math.floor(n/4)*4\nmoves += math.floor(n/3)\nn -= math.floor(n/3)*3\nmoves += math.floor(n/2)\nn -= math.floor(n/2)*2\nmoves += math.floor(n/1)\nprint(moves)\n", "n = int(input())\r\nres = n // 5 + bool( n % 5 )\r\nprint(res)", "import math\r\nx=int(input())\r\nn=math.ceil(x/5)\r\nprint(n)\r\n", "import math\r\nx = int(input())\r\nprint(math.ceil(x/5))\r\n", "x = int(input())\r\ny = x // 5\r\n\r\nif x % 5 != 0:\r\n y += 1\r\n\r\nprint(y)\r\n", "# trees = [int(x) for x in input().split()]\nn = int(input())\nprint(n//5+1 if n%5 != 0 else n//5)", "n = [5, 4, 3, 2, 1]\r\nt = int(input())\r\ncount = 0\r\nwhile t != 0:\r\n for i in n:\r\n while t - i >= 0:\r\n t -= i\r\n count += 1\r\nprint(count)\r\n\r\n\r\n\r\n", "a = int(input())\r\nx = [5,4,3,2,1]\r\nans = 0\r\nfor i in x:\r\n ans += a//i\r\n a %= i\r\nprint(ans)", "import math\r\nn = int(input())\r\nl = n/5\r\nprint(math.ceil(l))", "def main():\n x = int(input())\n if x % 5 > 0:\n print(int(x / 5) + 1)\n else:\n print(int(x / 5))\n\n\nif __name__ == \"__main__\":\n main()\n\n \t \t\t\t \t\t\t \t \t\t \t \t\t", "n=int(input())\r\ns=0\r\nwhile n>=5:\r\n n=n-5\r\n s+=1\r\nif n==0:\r\n print(s)\r\nelse:\r\n print(s+1)", "import math\r\nx = int(input())\r\ny = x/5\r\nprint(math.ceil(y))", "point = int(input())\r\nsteps = 0\r\n\r\nstep_sizes = [5, 4, 3, 2, 1]\r\n\r\nfor size in step_sizes:\r\n while point >= size:\r\n point -= size\r\n steps += 1\r\n\r\nprint(steps)\r\n", "n = int(input())\r\n\r\nans = float(\"inf\")\r\nfor i in range(1,6):\r\n if n % i == 0:\r\n if n // i < ans:\r\n ans = (n // i)\r\n else:\r\n if n // i < ans:\r\n ans = ((n // i)+1)\r\n \r\nprint(ans)", "def minStep(x):\r\n cnt = 0\r\n while(x>0):\r\n if x>=5:\r\n x=x-5\r\n cnt+=1\r\n elif x>=4:\r\n x=x-4\r\n cnt+=1\r\n elif x>=3:\r\n x=x-3\r\n cnt+=1\r\n elif x>=2:\r\n x=x-2\r\n cnt+=1\r\n elif x>=1:\r\n x=x-1\r\n cnt+=1\r\n return cnt\r\n\r\nx=int(input())\r\nprint(minStep(x))", "s=int(input())\nx=s//5\nif s%5 !=0:\n print(x+1)\nelse:\n print(x)\n\t \t\t \t \t \t\t \t\t \t\t\t\t\t \t\t", "n = int(input())\r\nchemin_parcouru = 0\r\ncmp = 0\r\nwhile n!=0 :\r\n if n>=5:\r\n n-=5\r\n chemin_parcouru+=5\r\n elif n>=4:\r\n n-=4\r\n chemin_parcouru+=4\r\n elif n>=3 :\r\n n-=3\r\n chemin_parcouru+=3\r\n elif n>=2 :\r\n n-=2\r\n chemin_parcouru+=2\r\n else :\r\n n-=1\r\n chemin_parcouru+=1\r\n cmp+=1\r\nprint(cmp)", "a = int(input())\r\nb = int(a/5)\r\nc = a%5\r\nif (c == 0):\r\n print(b)\r\nelse:\r\n print(b+1)", "x = int(input())\r\nans = x//5\r\nif (x % 5 == 0):\r\n print(ans)\r\nelse:\r\n print(ans+1)\r\n", "inp1 = int(input())\r\nif inp1%5 == 0:\r\n print(inp1//5)\r\nelse:\r\n print((inp1//5)+1)", "x = int(input())\nsteps = 0\npos = 5\n\nwhile x > 0:\n\n steps += x // pos\n x -= (x//pos)*pos\n pos -= 1\n\nprint(steps)\n", "n=int(input())\r\ncount=0\r\n\r\nwhile n>0:\r\n if n>=5:\r\n n -=5\r\n count+=1\r\n elif n<5:\r\n n -=n\r\n count+=1\r\n\r\nprint(count)", "n = int(input())\r\ns = 0\r\nwhile n>= 5:\r\n n = n-5\r\n s = s+1\r\nelse:\r\n if n < 5 and n != 0:\r\n s = s+1\r\nprint(s)\r\n", "\r\nt=int(input())\r\ni=5\r\nn=0\r\nwhile i>0:\r\n n=n+t//i\r\n t=t%i\r\n i=i-1\r\n \r\n\r\n\r\nprint(n)", "def Elephant(x=0):\r\n if x%5==0:\r\n return int(x/5)\r\n return x//5+1\r\n\r\ni=int(input())\r\nprint(Elephant(x=i))\r\n\r\n\r\n", "x=int(input())\r\nans=x//5\r\nif x%5==0:\r\n print(ans)\r\nelse:\r\n print(ans+1)", "n = int(input())\r\nr = n // 5\r\nif n % 5 > 0:\r\n r += 1\r\nprint(r)", "x = int(input())\r\n\r\ncurSteps = 0\r\nif x % 5 > 0:\r\n curSteps = x // 5 + 1\r\nelse:\r\n curSteps = x // 5\r\nprint(curSteps)\r\n", "#read the coordinate\r\nx = int(input())\r\n\r\n#initialize the number\r\nsteps = 0\r\n\r\n#calculate the minimum number \r\nwhile x > 0:\r\n steps += 1\r\n x -= min(x, 5)\r\n\r\n#print the steps\r\nprint(steps)", "import math\r\nx=int(input())\r\nsteps=math.ceil(x/5)\r\nprint(steps)", "import math\r\n\r\n# Read input\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps required\r\n# Divide x by 5 and round up to the nearest integer\r\nmin_steps = math.ceil(x / 5)\r\n\r\n# Print the result (minimum number of steps)\r\nprint(min_steps)\r\n", "d = int(input())\r\nresultfrom5 = divmod(d,5)\r\nsteps=resultfrom5[0]\r\nif resultfrom5[1] !=0:\r\n steps += 1\r\nprint(steps)", "import math\r\np=int(input())\r\nmin_steps=math.ceil(p/5)\r\nprint(min_steps)\r\n", "import sys\r\ns=int(input())\r\ncount=0\r\nm=0\r\nwhile m<s:\r\n m+=5\r\n count+=1\r\nprint(count)\r\n ", "print((int(input())-1)//5+1)", "from math import ceil\r\nx = int(input())\r\ny = ceil(x/5)\r\nprint(y)", "house=int(input())\r\nsteps = house // 5\r\nif house % 5:\r\n steps += 1\r\nprint(steps)", "import math\nnum=int(input())\nprint(math.ceil(num/5))\n \t\t \t \t\t \t\t \t\t\t \t\t \t\t \t\t\t", "import math\r\nimport bisect\r\na=int(input())\r\nprint(a//5+bool(a%5))", "import math\ns = int(input())\nprint(math.ceil(s/5))\n\t \t\t\t \t\t\t \t\t \t \t \t \t \t \t", "user_input = input()\r\nx= int( user_input)\r\ncount=0\r\nwhile x>0:\r\n x-=5\r\n count+=1\r\nprint(count)", "s=int(input())\r\nres=0\r\n\r\nwhile(s):\r\n if s >=5:\r\n s-=5\r\n res+=1\r\n elif s >=4:\r\n s-=4\r\n res+=1\r\n elif s>=3:\r\n s-=3\r\n res+=1\r\n elif s>=2:\r\n s-=2\r\n res+=1\r\n elif s>=1:\r\n s-=1\r\n res+=1\r\nprint(res)", "x = int(input())\r\nsteps = x // 5 + (1 if x % 5 != 0 else 0)\r\nprint(steps)", "n=int(input())\r\nprint(n//5 + (1 if n%5>0 else 0))\r\n", "x = int(input())\r\nsteps_of_5 = x // 5\r\ndistance = x % 5\r\ntotal = steps_of_5 + (1 if distance > 0 else 0)\r\nprint(total)", "n = int(input())\r\n\r\ndef ele_steps(n):\r\n count = 5\r\n steps = 0\r\n \r\n while(n > 0):\r\n if(n >= count):\r\n n -= count\r\n steps += 1\r\n else:\r\n count -= 1\r\n return steps\r\n\r\nresult = ele_steps(n)\r\nprint(result)\r\n", "u = int(input())\n\nkoraci = [5,4,3,2,1]\nsteps=0\nk = 0\nwhile u!=0:\n if u>=koraci[k]:\n u = u-koraci[k]\n k = 0\n steps+=1\n else:\n k+=1\n\nprint(steps)", "a=int(input())\r\ns=(a+4)//5\r\nprint(s)", "# Read input value\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps\r\nsteps = (x + 4) // 5 # Using integer division\r\n\r\n# Output the result\r\nprint(steps)\r\n", "i=int(input())\r\nif i%5==0:\r\n print(i//5)\r\nelse:\r\n print(i//5+1)\r\n ", "#CodeForce Round 617a Elephant\r\n\r\nn = int(input())\r\nsteps = n//5\r\nif n%5:\r\n print(steps+1)\r\nelse:\r\n print(steps)", "def main():\n a = int(input())\n if(a%5==0):\n print(a//5)\n else:\n print(a//5+1)\n\n \n\nif __name__ == '__main__':\n main()", "import math as m\r\ni = int(input())\r\nprint(m.ceil(i/5))", "import math\r\nx=int(input())\r\nd=math.ceil(x/5)\r\nprint(d)", "x = input()\r\nif int(x) == 0 or int(x) > 1000000:\r\n print(\"Input must be in between 1 and 1 000 000\")\r\nif int(x) >= 1 and int(x) <= 4:\r\n print(1)\r\nif int(x) >= 5 and int(x) <= 1000000:\r\n y = int(x)//5\r\n z = int(x)%5\r\n if z == 0:\r\n print(y)\r\n if z > 0:\r\n print(y+1)", "steps = input()\r\nsteps = int(steps.strip())\r\nsteps_needed = 0\r\n\r\nwhile steps > 0:\r\n if steps >= 5:\r\n steps_needed += steps // 5\r\n steps = steps % 5\r\n elif steps >= 4:\r\n steps_needed += steps // 4\r\n steps = steps % 4\r\n elif steps >= 3:\r\n steps_needed += steps // 3\r\n steps = steps % 3\r\n elif steps >= 2:\r\n steps_needed += steps // 2\r\n steps = steps % 2\r\n elif steps >= 1:\r\n steps_needed += steps // 1\r\n steps = steps % 1\r\n else:\r\n steps_needed = 0\r\n\r\nprint(steps_needed)", "x=int(input())\r\nif x%5==0:\r\n y=x//5\r\nelse:\r\n y=(x//5)+1\r\nprint(y)", "a=int(input(\"\"))\r\nn=int(a/5)\r\nif(a%5!=0):\r\n n+=1\r\nprint(n)", "import math\nn=int(input())\nprint(math.ceil(n/5))#mn\n\t \t\t\t\t\t\t\t\t\t\t \t\t \t\t \t \t\t", "x = int(input())\r\n\r\nmin_steps = x // 5 \r\nif x % 5 != 0:\r\n min_steps += 1 \r\n\r\nprint(min_steps)\r\n", "n=int(input())\r\nif n%5==0:\r\n print(n//5)\r\nelif n%5==1:\r\n print(n//5+1)\r\nelif n%5==2:\r\n print(n//5+1)\r\nelif n%5==3:\r\n print(n//5+1)\r\nelif n%5==4:\r\n print(n//5+1)", "x = int(input())\r\nsteps = x // 5\r\nif x % 5 != 0:\r\n steps += 1\r\nprint(steps)\r\n", "x = int(input())\r\nc = 0\r\nwhile x>0:\r\n x = x-5\r\n c += 1\r\nprint(c)", "import math\nn=int(input())\nprint(math.ceil(n/5))\n#g\n \t \t\t \t \t \t \t\t\t \t\t \t \t\t", "x = int(input())\r\nb = x//5\r\nif x % 5 != 0:\r\n b = b + 1\r\nelif b % 2 == 0:\r\n b = b + 0\r\nif b > 4:\r\n print( b)\r\nelse:\r\n print( b)", "def main():\n x = int(input())\n\n print(x // 5 if x % 5 == 0 else x // 5 + 1)\n\n\nmain()\n", "\r\nw = int(input())\r\nl = w//5\r\nif(w%5==0):\r\n step=l\r\nelse:\r\n step=l+1\r\nprint(step)", "a=int(input())\r\nk=a%5\r\nif(k==0):\r\n print(int(a/5))\r\nelse:\r\n print(int(a/5)+1)\r\n", "distance = int(input())\r\nif distance<1:\r\n print(\"Error\")\r\nelif distance>1000000:\r\n print(\"Error\")\r\nelse:\r\n steps = distance // 5\r\n if distance%5 == 0:\r\n print(steps)\r\n else:\r\n print(steps+1)", "import math\r\n\r\n# Input the coordinate of the friend's house\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps and round up\r\nsteps = math.ceil(x / 5)\r\n\r\n# Output the result\r\nprint(steps)\r\n", "n = int(input())\r\nans = 0\r\nfor i in range(5, 0, -1):\r\n ans += n // i\r\n n = n % i\r\nprint(ans)", "distance = int(input())\r\nprint(-(-distance //5))", "def elephent(x):\r\n step = 0\r\n while x > 0:\r\n if x%5==0:\r\n step += 1\r\n x -= 5\r\n else:\r\n step += 1\r\n x -= x%5\r\n return step\r\n\r\nx = int(input())\r\nminimum_steps = elephent(x)\r\nprint(minimum_steps)", "import math\r\ni = int(input())\r\ncount = 0\r\nwhile i >= 5:\r\n a5 = math.floor(i/5)\r\n count += a5\r\n i = i-5*a5\r\nif i == 0:\r\n print(count)\r\nelse:\r\n print(count+1)", "numbers=0\r\n\r\nx=int(input())\r\n\r\nfivecnt=x//5\r\nx=x%5\r\nnumbers=numbers+fivecnt\r\n\r\nfourcnt=x//4\r\nx=x%4\r\nnumbers=numbers+fourcnt\r\n\r\nthreecnt=x//3\r\nx=x%3\r\nnumbers=numbers+threecnt\r\n\r\ntwocnt=x//2\r\nx=x%2\r\nnumbers=numbers+twocnt\r\n\r\nonecnt=x//1\r\nx=x%4\r\nnumbers=numbers+onecnt\r\n\r\nprint(numbers)\r\n\r\n\r\n", "a=int(input())\r\nb=0\r\nwhile a>=5:\r\n a=a-5\r\n b=b+1\r\nwhile a>=4:\r\n a=a-4\r\n b=b+1\r\nwhile a>=3:\r\n a=a-3\r\n b=b+1\r\nwhile a>=2:\r\n a=a-2\r\n b=b+1\r\nwhile a>=1:\r\n a=a-4\r\n b=b+1\r\nprint(b)", "x=int(input())\r\nm = x // 5\r\nr = x % 5\r\nl=m + (r > 0)\r\nprint(l)", "a = int(input())\r\nans = a // 5\r\nif a % 5 > 0:\r\n ans += 1\r\nprint(ans)", "x = int(input())\n\nif x % 5 == 0:\n\tstep = x // 5\nelse:\n\tstep = x // 5 + 1\n\nprint(step)\n\n", "x = int(input())\r\nk = 0\r\nfor i in range(5,0,-1):\r\n if x > 0:\r\n k += x//i\r\n x = x - (x//i)*i\r\n else:\r\n break\r\n\r\nprint(k)\r\n", "n=int(input())\r\nc=0\r\ns=n\r\nl=[5,4,3,2,1]\r\nfor i in l:\r\n if i<=n:\r\n q=n//i\r\n c+=q\r\n n-=(q*i)\r\n \r\nprint(c)", "input_values = input().split()\nx = int(input_values[0])\n# n = int(input_values[1])\nc = x / 5\nif x % 5 == 0:\n print(int(c))\nelse: print(int(c + 1))\n\n\n\n\n\n\n\n\n \t\t\t \t\t\t\t\t\t\t \t\t\t \t\t\t\t\t\t\t \t\t\t\t", "x=int(input())\r\nd=x-0\r\nif d%5==0:\r\n print(d//5)\r\nelse:\r\n print(d//5+1)", "d=int(input())\r\nr=['5','4','3','2','1']\r\ns=0\r\nfor i in r:\r\n s+=d//int(i)\r\n d-=(d//int(i))*int(i)\r\n if d==0:\r\n break\r\nprint(s)", "abc = int(input())\r\nCRbca = abc%5\r\nif CRbca==0:\r\n print(abc//5)\r\nelse:\r\n print(abc//5+1)", "x = int(input())\r\nn = 5\r\nc = 0\r\nwhile n:\r\n c += x//n\r\n x %= n\r\n n -= 1\r\nprint(c)", "n=int(input())\r\nc=0\r\nwhile n>5:\r\n n-=5\r\n c+=1\r\nif n<=5:\r\n if n==1 or n==2 or n==3 or n==4 or n==5:\r\n c+=1\r\nprint(c)", "x = int(input())\r\n\r\nsteps = x // 5 if x % 5 == 0 else (x // 5) + 1\r\n\r\nprint(steps)\r\n", "x=int(input())\r\noutput=x//5+1\r\nif x%5==0:\r\n output-=1\r\nprint(output)", "x=int(input())\r\nd=x//5\r\nif x%5>0:\r\n m=d\r\n d+=1\r\nelif x%5==0 :\r\n m=d\r\nprint(d)\r\n ", "n=int(input())\r\nsum=0\r\nfor i in range(5):\r\n k=(n//(5-i))\r\n sum=sum+k\r\n n=n-((n//(5-i))*(5-i))\r\nprint(sum)\r\n", "import math\nn=int(input())\nprint(math.ceil(n/5))#Nikky\n \t \t \t \t\t\t \t\t \t\t \t\t \t", "def prob(k):\r\n if k>5 and k%5!=0:\r\n return 1 + (k//5)\r\n elif k>5 and k%5==0:\r\n return k//5\r\n else:\r\n return 1\r\nk=int(input())\r\nprint(prob(k))\r\n\r\n", "import math\r\n\r\nx = int(input())\r\nprint(math.ceil(x / 5))", "import math\n\ndef main():\n\tx = int(input())\n\tprint(math.ceil(x / 5))\n\n\nif __name__ == \"__main__\":\n\tmain()\n \t \t \t \t \t \t \t\t \t \t", "n= int(input())\r\nprint(n//5 if n%5==0 else n//5+1)", "m = int(input())\r\nif m % 5 == 0:\r\n print(m//5)\r\nelse:\r\n print(m//5 + 1)\r\n", "n = int(input())\r\n\r\nans = int(n / 5)\r\n\r\nif n % 5: \r\n ans += 1\r\n\r\nprint(ans)", "import math\r\ndistance = int(input())\r\nprint(math.ceil(distance/5))\r\n", "n=int(input())\r\ns=0\r\ni=0\r\nwhile s < n:\r\n if (n-s)<=4:\r\n break\r\n else:\r\n s = 5+s\r\n i+=1\r\ndiff=n-s\r\nif diff==0:\r\n print(i)\r\nelif diff>0 and diff<=4:\r\n print(i+1)", "x = int(input())\r\nmin = -(-x // 5)\r\nprint(min)", "a = int(input())\r\nk = 0\r\nwhile(a-5>0):\r\n a-=5\r\n k+=1\r\nif a!=0:\r\n print(k+1)", "x = int(input())\r\n\r\ni = 0\r\n\r\nwhile x != 0:\r\n i += x//5\r\n x %= 5\r\n i += x//4\r\n x %= 4\r\n i += x//3\r\n x %= 3\r\n i += x//2\r\n x %= 2\r\n i += x//1\r\n x %= 1\r\nprint(i)\r\n ", "n=int(input())\r\nif n<=5:\r\n print(1)\r\nelif n%5==0:\r\n print(n//5)\r\nelse:\r\n c=n//5\r\n print(c+1)", "x=int(input())\nsteps = x//5\nif x % 5 != 0:\n steps += 1\nprint(steps)\n\t\t \t \t \t\t\t \t\t\t \t \t \t", "n = int(input())\r\na = 0\r\nc = 0\r\nwhile a+5 <= n:\r\n a+=5\r\n c+=1\r\nif a == n:\r\n print(c)\r\nelse:\r\n print(c+1)", "x = int(input())\r\nsteps = 0\r\ndist = x\r\nwhile dist > 5:\r\n dist -= 5\r\n steps += 1\r\n\r\nif dist <= 5:\r\n steps += 1\r\n print(steps)", "n = int(input())\r\ncnt = 0\r\nfor i in range(5,0,-1):\r\n cnt = cnt + n//i\r\n n = n - i*(n//i)\r\nprint(cnt)", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n if(n>=5):\r\n n=n-5\r\n c+=1\r\n elif(n==4):\r\n n=n-4\r\n c+=1\r\n elif(n==3):\r\n n=n-3\r\n c+=1\r\n elif(n==2):\r\n n=n-2\r\n c+=1\r\n elif(n==1):\r\n n=n-1\r\n c+=1\r\nprint(c)\r\n \r\n\r\n\r\n \r\n", "n = int(input())\n\nans = n // 5\nif n%5 != 0:\n ans += 1\n\nprint(ans)\n", "import math\r\nx = int(input())\r\nmin_step = math.ceil(x / 5)\r\nprint(min_step)", "\n\n\n\n\nx = int(input())\n\nmin5 = x // 5\nrem = x % 5\n\ntot = min5 + (1 if rem > 0 else 0)\n\nprint(tot)\n \t \t \t \t\t \t \t \t \t \t\t\t\t \t", "import math\n\nx = input()\n\ny = int(x) / 5\n\nz = math.ceil(y)\n\nprint(z)\n\t \t \t\t \t \t \t \t \t\t \t \t\t \t\t \t", "steps = 0\r\nhomeFriend = int(input())\r\nwhile homeFriend >= 5:\r\n steps += 1\r\n homeFriend -= 5\r\nwhile homeFriend >= 4:\r\n steps += 1\r\n homeFriend -= 4\r\nwhile homeFriend >= 3:\r\n steps += 1\r\n homeFriend -= 3\r\nwhile homeFriend >= 2:\r\n steps += 1\r\n homeFriend -= 2\r\nwhile homeFriend >= 1:\r\n steps += 1\r\n homeFriend -= 1\r\nprint(steps)", "x = int(input())\nsteps = 0\nwhile x > 0:\n if x >= 5:\n x -= 5\n else:\n x -= x\n steps += 1\nprint(steps)\n", "a = int(input())\r\nprint(a // 5 + int(a % 5 != 0))", "distance = int(input())\r\nsteps = 0\r\nunit = 5\r\n\r\nwhile distance > 0:\r\n que = distance // unit\r\n if que > 0:\r\n steps += que\r\n distance = distance % unit\r\n unit -= 1\r\n\r\nprint(steps)\r\n", "x = int(input())\ns = 0\nwhile x > 0:\n if x >= 5:\n s += 1\n x -= 5\n else:\n s += 1\n x = 0\nprint(s)\n", "us_i = input()\r\nans = (int(us_i) + 4) // 5\r\nprint(ans)\r\n", "valid_steps = [1, 2, 3, 4, 5]\r\nx = int(input())\r\nstep = 0\r\nwhile x > 0:\r\n if x in valid_steps:\r\n step += 1\r\n break\r\n else:\r\n x -= 5\r\n step += 1\r\nprint(step)\r\n", "import math\n\nx = int(input())\n\n\nnumPasos = math.ceil(x / 5)\n\nprint(numPasos)\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%5>0:\r\n x=n//5+1\r\nelse:\r\n x=n//5\r\nprint(int(x))", "num = int(input())\r\n\r\nfinal = num / 5\r\nif num % 5 != 0:\r\n final = final + 1\r\n\r\nprint(int(final))", "import sys\n\ninput = int(sys.stdin.readline())\nremain = 1 if (input % 5) else 0\nsys.stdout.write(str(input // 5 + remain))\n", "from math import *\r\nx = int(input())\r\nif x%5 == 0:\r\n number = int(x/5)\r\nelse:\r\n number = floor(x/5) + 1\r\nprint(number)\r\n", "x = int(input())\r\nans = 0\r\n\r\nstep = 5\r\nwhile x > 0:\r\n ans += x // step;\r\n x = x % step\r\n step -= 1\r\n\r\nprint(ans)", "x = int(input())\r\nsteps = 0\r\n\r\nwhile x > 5:\r\n x = x - 5\r\n steps += 1\r\n \r\nsteps += 1\r\n\r\nprint(steps)\r\n", "n=int(input())\r\nv=(n+4)//5\r\nprint(v)", "n=int(input())\r\nprint(-(-n//5))", "import math\r\nprint(math.ceil(int(input())/5))\r\n ", "x=int(input())\r\nif(x%5==0):\r\n\tprint(x//5)\r\nelif(x%5!=0):\r\n\tprint(x//5 + 1)", "a = int(input())\r\nc = 0\r\nwhile a > 0:\r\n c += 1\r\n if a >= 5:\r\n a -= 5\r\n continue\r\n if a < 5:\r\n a = 0\r\nprint(c)\r\n", "# Read the input\r\nx = int(input())\r\nmin_steps = (x + 4) // 5\r\n\r\nprint(min_steps)\r\n", "friend_house_coordinate = int(input())\r\n\r\nif friend_house_coordinate % 5 == 0:\r\n min_steps = friend_house_coordinate // 5\r\nelse:\r\n min_steps = (friend_house_coordinate // 5) + 1\r\n\r\nprint(min_steps)\r\n", "x = int(input())\r\nsteps = 0\r\n\r\nwhile(x!=0):\r\n psteps = []\r\n for i in range(1,6):\r\n if(x//i == 0):\r\n continue\r\n psteps.append(((x//i),i))\r\n # print(psteps)\r\n # sorted(psteps, reverse= True)\r\n mini = min(psteps)\r\n minil = [k for j,k in psteps if(j == mini[0])]\r\n maxi = max(minil)\r\n # print(mini, maxi)\r\n steps += x//maxi\r\n # steps +=mini[0]\r\n x -= maxi *(x//maxi)\r\nprint(steps)\r\n \r\n \r\n", "t=int(input())\r\nl=[5,4,3,2,1]\r\nc=0\r\ny=0\r\nfor i in l:\r\n y=t//i\r\n t=t-y*i\r\n c+=y\r\nprint(c)\r\n ", "steps = int(input())\r\ndec = (steps-1)//5\r\ndec += 1\r\nprint(dec)", "x = int(input())\nans = 0\nwhile x > 0:\n x -=5\n ans += 1\nprint(ans)\n\t \t \t\t\t\t \t\t \t \t\t \t \t\t\t \t\t", "# https://codeforces.com/problemset/problem/617/A\r\nimport math\r\n\r\n# Time complexity: O(1) Constant runtime\r\n# Space complexity: O(1) Constant space\r\nx = int(input())\r\nprint(math.ceil(x/5))\r\n", "array = [1, 2, 3, 4, 5]\r\npointer = 4\r\nnum = int(input())\r\nres = 0\r\n\r\nwhile num:\r\n if num >= array[pointer]:\r\n num -= array[pointer]\r\n res += 1\r\n\r\n else:\r\n pointer -= 1\r\n\r\nprint(res)", "from math import floor\r\n\r\nn = int(input())\r\nk = 0\r\ncol = 0\r\n\r\nfor i in range(5, 0, -1):\r\n k = floor(n/i)\r\n col += k\r\n n = n-(i*k)\r\nprint(col)", "from math import ceil\r\n\r\n\r\nx = int(input())\r\n\r\nprint(ceil(x / 5))", "a=int(input(\"\"))\r\nn=1\r\nwhile a>5*n:\r\n n+=1\r\nprint(n) ", "n = int(input())\r\nc = 0\r\nwhile n != 0:\r\n if n-5 >= 0:\r\n c += 1\r\n n -= 5\r\n elif n-4 >= 0:\r\n c += 1\r\n n -= 4\r\n elif n-3 >= 0:\r\n c += 1\r\n n -= 3\r\n elif n-2 >= 0:\r\n c += 1\r\n n -= 2\r\n elif n-1 >= 0:\r\n c += 1\r\n n -= 1\r\nprint(c)", "import math\r\nx=int(input())\r\nprint(math.ceil(x/5))", "pos = int(input())\r\nif pos%5 == 0:\r\n print(pos//5)\r\nelse:\r\n print(pos//5 + 1)", "n=int(input())\r\nx=0\r\nfor i in range(10000000):\r\n if n==0:\r\n break\r\n if n<2:\r\n n-=1\r\n x+=1\r\n break\r\n elif n<3:\r\n n-=2\r\n x += 1\r\n break\r\n elif n<4:\r\n n-=3\r\n x += 1\r\n break\r\n elif n < 5:\r\n n-= 4\r\n x += 1\r\n break\r\n elif n >= 5:\r\n n -= 5\r\n x += 1\r\nprint(x)", "def dominos(x):\r\n return x//5 if x%5==0 else x//5+1\r\nx = int(input())\r\nprint(dominos(x))", "import math\r\nx=int(input())\r\na=math.ceil(x/5)\r\nprint(a)", "z = int(input())\r\n\r\nk=0\r\n\r\nif z%5==0:\r\n k = (z/5)\r\nelse:\r\n k = (z/5) + 1\r\n\r\nprint(int(k))", "sloq = int(input())\r\nif sloq % 5 == 0:\r\n print(sloq // 5)\r\nelse:\r\n print((sloq // 5)+1)\r\n", "x = int(input())\r\nr = x % 5\r\nif r == 0:\r\n p = int(x/5)\r\nelse:\r\n p = int(x/5 + (5-r)/5)\r\nprint(p)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 10 15:12:22 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nx = int(input())\r\nif x%5 != 0:\r\n print(int(x/5)+1)\r\nelse:\r\n print(int(x/5))", "x=int(input(\"\"))\r\nsteps = x//5\r\nrem = x%5\r\n\r\nif rem>0:\r\n steps=steps+1\r\n\r\nprint(steps)", "import math\nfriendshouse=int(input())\nprint(math.ceil(friendshouse/5))\n\n\n", "print(-((-1) * int(input()) // 5))", "n = int(input())\nprint(int(n/5)+int(n%5 != 0))\n\t \t\t \t\t\t \t \t \t \t \t", "c = int(input())\r\n\r\nx = c//5\r\n\r\nif c % 5 == 0:\r\n print(x)\r\nelse:\r\n print(x + 1)\r\n", "ip = int(input())\r\nmoves = 0\r\nwhile ip != 0:\r\n moves += 1\r\n if ip >= 5:\r\n ip -= 5\r\n else:\r\n ip = 0\r\nprint(moves)", "if __name__ == '__main__':\r\n possible_moves = [1, 2, 3, 4, 5]\r\n steps = 0\r\n x = int(input())\r\n if x in possible_moves:\r\n steps = steps + 1\r\n else:\r\n five_count = x // 5\r\n rest = x % 5\r\n if rest in possible_moves:\r\n steps = five_count + 1\r\n elif rest == 0:\r\n steps = five_count\r\n print(steps)\r\n", "x = int(input())\r\ntotal = 0\r\nfor i in range(5, 0, -1):\r\n total += x // i\r\n x -= (x // i) * i\r\n \r\nprint(total)", "x = int(input())\nstep = 0 \nif x % 5 == 0:\n step = x // 5\nelse:\n step = x // 5 + 1 \nprint(step)", "import math\r\n\r\n# Input\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps\r\nsteps = math.ceil(x / 5)\r\n\r\n# Output the result\r\nprint(steps)\r\n", "pos = int(input())\r\nif pos % 5 == 0:\r\n steps = int(pos/5)\r\n print(steps)\r\nelse:\r\n min = int(pos/5)\r\n stepss = min+1\r\n print(stepss)", "x=int(input())\nq=x//5\nw=x%5//4\ne=x%5%4//3\nr=x%5%4%3//2\nt=x%5%4%3%2//1\nprint(q+w+e+r+t)\n\n \t \t \t\t\t\t\t \t\t \t \t", "n = int(input())\r\nc = 1\r\nwhile n > 5:\r\n c += 1\r\n n -= 5\r\nprint(c)", "n=int(input())\r\n\r\nw=n%5\r\nb=n/5\r\nc=int(b)\r\n\r\nif w==0:\r\n print(c)\r\nelse:\r\n print(c+1)", "dis = int(input())\r\n\r\nstep = 0\r\n\r\nif dis % 5 == 0:\r\n\tstep = dis // 5\r\nelse:\r\n\tstep = dis // 5 + 1\r\nprint(step)", "x = int(input())\r\nc = 0\r\nwhile x > 0:\r\n\r\n if x >= 5:\r\n c+= x//5\r\n x = x%5\r\n elif x >= 4:\r\n c+= x//4\r\n x = x%4\r\n elif x >= 3:\r\n c+= x//3\r\n x = x%3\r\n elif x >= 2:\r\n c+= x//2\r\n x = x%2\r\n else:\r\n c+= x//1\r\n x = x%1\r\nprint(c)\r\n \r\n \r\n", "a=int(input())\r\nq = a // 5\r\nr = a % 5\r\nprint(q + (r > 0))\r\n", "import math\r\n\r\ndistance = int(input())\r\nprint(math.ceil(distance/5))\r\n", "from math import ceil\r\nprint(ceil(int(input()) / 5))", "x=int(input())\r\nprint((x//5)+(x%5!=0))", "n = int(input())\r\nprint(n//5 if n%5 == 0 else n//5 + 1)", "# Elephant Difficulty:800\r\nx = int(input())\r\nlocation = 0\r\nstep = 0\r\nwhile location < x:\r\n step += 1\r\n if x - location >= 5:\r\n location += 5\r\n elif x - location < 5 and x-location >= 4:\r\n location += 4\r\n elif x - location < 4 and x-location >= 3:\r\n location += 3\r\n elif x - location < 3 and x-location >= 2:\r\n location += 2\r\n else:\r\n location += 1\r\nprint(step)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Sep 13 15:22:32 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\nx=int(input())\nif 1<=x<=1000000:\n if x%5==0:\n a=x/5\n else:\n a=x//5+1\n a=int(a)\nprint(a)", "a = int(input())\r\n\r\nif a in [1,2,3,4,5]:\r\n print(1)\r\nelif (a//5 == a / 5):\r\n print(a//5)\r\nelse:\r\n print(a//5+1)\r\n\r\n", "import math\np = int(input())\nprint(math.ceil(p/5))\n#w\n\t\t \t \t \t\t\t \t\t \t \t \t", "n=int(input())\r\nsteps=n//5\r\nif n%5!= 0:\r\n steps+=1\r\nprint(steps)\r\n", "a = int(input())\r\nk = 0\r\nd = 5\r\nwhile d!=0:\r\n k += a//d\r\n a %= d\r\n d -= 1\r\nprint(k)\r\n", "def solve(D):\r\n steps = [5,4,3,2,1]\r\n ans = 0\r\n for step in steps:\r\n ans += D // step\r\n D %= step\r\n return ans\r\nprint(solve(int(input())))", "x = int(input())\n\nif x <5:\n print(1)\nelse:\n wholeSteps, remainder = divmod(x, 5)\n if remainder == 0:\n print(wholeSteps)\n else:\n print(wholeSteps + 1)\n\n \t\t\t\t \t\t\t\t\t\t \t\t\t\t\t \t\t \t \t", "import math\r\nx = int(input())\r\nc = math.ceil(x/5)\r\nprint(c)", "location = int(input())\r\nstep = location // 5\r\nif (location % 5 != 0):\r\n step += 1\r\nprint(step)\r\n", "#elephant\r\n\r\nx=int(input())\r\n#minimum steps to reach friend's house\r\nres=x//5\r\n\r\nif x%5!=0:\r\n res+=1\r\nprint(res)", "n = int(input())\r\nn = n // 5 + (1 if n % 5 != 0 else 0)\r\nprint(n)", "print((int(input()) + 4) // 5)\r\n", "e1=int(input(\"\"))\r\ne2=0\r\nc=0\r\nfor i in range(e1):\r\n if e2 >= e1:\r\n break\r\n elif e2 < e1 :\r\n e2+=5\r\n c+=1\r\nprint(c)", "import math\nk=int(input())\nprint(math.ceil(k/5))\n\t \t\t\t \t\t\t \t\t\t\t \t", "x = int(input())\r\n\r\nif x % 5 != 0:\r\n print(x // 5 + 1)\r\nelse:\r\n print(x // 5)\r\n", "a = int(input());\r\nindex = 5;\r\ncounts = 0;\r\nwhile(index > 0):\r\n counts += int(a / index);\r\n a %= index;\r\n index -= 1;\r\nprint(counts);", "#617A: elephant\r\nx=int(input())\r\nif x<=5:\r\n print(1)\r\nelif x%5==0:\r\n print(x//5)\r\nelse:\r\n print(x//5+1)", "house = int(input())\r\nstepsAway = int((house/5))\r\n\r\nif house % 5 != 0: print(stepsAway+1)\r\nelse: print(stepsAway)", "friend = int(input())\r\nsteps = friend // 5\r\nif friend % 5 != 0:\r\n steps += 1\r\nprint(steps)\r\n", "a = int(input())\r\nn = 1\r\nwhile a>5:\r\n a-=5\r\n n+=1\r\nprint(n)", "n = int(input())\r\nx = n // 5\r\ny = (n- x*5) // 4\r\nz = (n - x*5 - y*4) // 3\r\na = (n - x*5 - y*4 - z*3 ) // 2\r\nb = (n - x*5 - y*4 - z*3 - a*2)\r\nprint(x+y+z+a+b)", "x = int(input())\r\nif x % 5 == 0:\r\n print(int(x / 5))\r\nelse:\r\n print(x //5 + 1)", "n=int(input())\r\nx=n//5\r\nif n%5:\r\n x+=1\r\nprint(x)\r\n", "n=int(input())\r\nx=5\r\nc=0\r\nwhile x!=0:\r\n if n>=x:\r\n c+=n//x\r\n n=n%x\r\n else:\r\n x-=1\r\nprint(c)", "import math\n\n# Read input\nx = int(input())\n\n# Calculate the minimum number of steps\nmin_steps = math.ceil(x / 5)\n\n# Print the result\nprint(min_steps)\n\n \t \t\t \t \t\t\t \t\t\t\t \t\t\t \t \t", "a = int(input())\r\ns = a\r\ncount = 0\r\nwhile s > 0:\r\n if s >= 5:\r\n n = s // 5\r\n count += n\r\n s -= n * 5\r\n elif s >= 4:\r\n n = s // 4\r\n count += n\r\n s -= n * 4\r\n elif s >= 3:\r\n n = s // 3\r\n count += n\r\n s -= n * 3\r\n else:\r\n n = s\r\n count += 1\r\n s = 0\r\nprint(count)", "n=int(input())\r\nmove=0\r\n\r\nwhile n!=0:\r\n if int(n/5)!=0:\r\n move+=int(n/5)\r\n n-=5*int(n/5)\r\n elif int(n/4)!=0:\r\n move += int(n / 4)\r\n n -= 4 * int(n / 4)\r\n elif int(n/3)!=0:\r\n move += int(n / 3)\r\n n -= 3 * int(n / 3)\r\n elif int(n/2)!=0:\r\n move += int(n / 2)\r\n n -= 2 * int(n / 2)\r\n elif int(n/1)!=0:\r\n move += int(n / 1)\r\n n -= 1 * int(n / 1)\r\n\r\nprint(move)", "def min_steps_to_reach_house(x):\n return (x + 4) // 5\n\n# Read the input\nx = int(input())\n\n# Find the minimum number of steps\nmin_steps = min_steps_to_reach_house(x)\n\n# Print the result\nprint(min_steps)\n\t \t \t \t\t\t \t\t\t\t \t \t\t\t \t", "n=int(input())\r\ns=(n+4)//5\r\nprint(s)", "a=int(input())\r\nprint(a//5+(a%5!=0))\r\n", "pos=(int)(input())\r\nprint((pos//5)+((pos%5)//4)+((pos%5%4)//3)+((pos%5%4%3)//2)+((pos%5%4%3%2)))", "n=int(input())\r\nans=0\r\nl=[5,4,3,2,1]\r\nfor i in l:\r\n ans+=n//i\r\n n=n%i\r\nprint(ans) ", "n = int(input())\r\n\r\nans = 0\r\n\r\nif n%5 == 0:\r\n ans = n//5\r\nelse :\r\n ans = (n//5) + 1\r\n\r\nprint(ans)", "n=int(input())\r\ncount=0\r\nwhile n>0:\r\n if n%5==0:\r\n count+=n//5\r\n break\r\n else:\r\n count+=1\r\n n=n-n%5\r\nprint(count)\r\n ", "d=int(input())\r\nif d%5==0:\r\n print(d//5)\r\nelif d%5!=0:\r\n print(d//5+1)", "s = int(input(\"\"))\r\ni = 0\r\nwhile s > 0:\r\n if s >= 5:\r\n s = s - 5\r\n i += 1\r\n elif s >= 4:\r\n s -= 4\r\n i += 1\r\n elif s >= 3:\r\n s -= 3\r\n i += 1\r\n elif s >= 2:\r\n s -= 2\r\n i += 1\r\n elif s >= 1:\r\n s -= 1\r\n i += 1\r\nprint(i)", "x = int(input()) \r\n#1,2,3,4,5\r\nmoves = 0\r\nwhile x != 0:\r\n if int(x / 5) != 0:\r\n moves += int(x/5)\r\n x -= 5 * int(x/5)\r\n elif int(x / 4) != 0:\r\n moves += int(x/4)\r\n x -= 4 * int(x/4)\r\n elif int(x / 3) != 0:\r\n moves += int(x/3)\r\n x -= 3 * int(x/3)\r\n elif int(x / 2) != 0:\r\n moves += int(x/2)\r\n x -= 2 * int(x/2)\r\n elif int(x / 1) != 0:\r\n moves += int(x/1)\r\n x -= 1 * int(x/1)\r\nprint(moves)", "import math\r\nn=int(input())\r\nr=math.ceil(n/5)\r\nprint(r)\r\n", "x=int(input())\r\nflag=int(x/5)\r\nif x%5!=0:\r\n flag+=1\r\nprint(flag)", "import math\r\nx=int(input())\r\nres=math.ceil(x/5)\r\nprint(res)", "n = int(input())\r\ns = 0\r\ncnt = 0\r\n\r\nwhile s < n:\r\n s+=5\r\n cnt+=1\r\n \r\nprint(cnt)", "t=int(input())\r\nn = t // 5\r\nx = t % 5\r\nL=n + (x > 0)\r\nprint(L)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 18 19:15:20 2023\r\n\r\n@author: josea\r\n\"\"\"\r\nx = int (input())\r\nrmnDstnc = x\r\nstpCntr = 0\r\nwhile rmnDstnc !=0:\r\n if rmnDstnc >=5:\r\n rmnDstnc = rmnDstnc-5\r\n stpCntr+=1\r\n elif rmnDstnc >=4:\r\n rmnDstnc = rmnDstnc-4\r\n stpCntr+=1\r\n elif rmnDstnc >=3:\r\n rmnDstnc = rmnDstnc-3\r\n stpCntr+=1\r\n elif rmnDstnc >=2:\r\n rmnDstnc = rmnDstnc-2\r\n stpCntr+=1\r\n elif rmnDstnc >=1:\r\n rmnDstnc = rmnDstnc-1\r\n stpCntr+=1\r\nprint(stpCntr)\r\n ", "import math\r\nn=int(input())\r\nresult=math.ceil(n/5)\r\nprint(result)", "x=int(input())\r\nsol=x//5\r\nif(x%5!=0):\r\n sol+=1\r\nprint(sol)", "x = int(input())\r\n\r\nif x <= 5:\r\n print(1)\r\nelif x % 5 == 0:\r\n print(x // 5)\r\nelse:\r\n print((x // 5) + 1)", "x=int(input())\r\na=x//5\r\nif x%5==0:\r\n print(a)\r\nelse:\r\n print(a+1)", "a = int(input())\r\n\r\ncount = 0\r\nwhile 0 < a:\r\n if a < 5:\r\n count += 1\r\n break\r\n a -= 5\r\n count += 1\r\n \r\nprint(count)", "def finddist(n):\r\n arr = [5, 4, 3, 2, 1]\r\n count = 0\r\n i = 0\r\n while n > 0:\r\n if n >= arr[i]:\r\n n -= arr[i]\r\n count += 1\r\n else:\r\n i += 1\r\n if i >= len(arr):\r\n i = 0\r\n return count\r\n\r\nn = int(input())\r\nprint(finddist(n))\r\n", "# An elephant decided to visit his friend. It turned out that the elephant's house is located at point 0 and his friend's house is located at point x(x > 0) of the coordinate line. In one step the elephant can move 1, 2, 3, 4 or 5 positions forward. Determine, what is the minimum number of steps he need to make in order to get to his friend's house.\n# Input\n\n# The first line of the input contains an integer x (1 ≤ x ≤ 1 000 000) — The coordinate of the friend's house.\n# Output\n\n# Print the minimum number of steps that elephant needs to make to get from point 0 to point x.\n\nposition = int(input())\ntemp = position\nsteps = [1, 2, 3, 4, 5]\ncount = 0\n# while True:\n# if temp == 1 or temp == 0:\n# break\n# if temp % 5 == 0:\n# temp = temp/5\n# count+=temp\n# print(temp, 'fives')\n# elif temp % 4 == 0:\n# temp = temp/4\n# print(temp, 'four')\n# elif temp % 3 == 0:\n# temp = temp/3\n# print(temp, 'three')\n# elif temp % 2 == 0:\n# temp = temp/2\n# print(temp, 'two')\n# else:\n# print(temp)\n\nwhile True:\n if temp == 0:\n break\n if temp >= 5:\n temp -= 5\n count += 1\n elif temp >= 4:\n temp -= 4\n count += 1\n elif temp >= 3:\n temp -= 3\n count += 1\n elif temp >= 2:\n temp -= 2\n count += 1\n elif temp >= 1:\n temp -= 1\n count += 1\nprint(count)\n", "n = int(input())\r\nprint(n // 5 if not n % 5 else n // 5 + 1)", "x = int(input()) # Read the coordinate of the friend's house\n\n# Calculate the minimum number of steps\n# Each step can be 1, 2, 3, 4, or 5 positions forward.\n# To minimize the number of steps, use integer division (//) and modulus (%) operations.\n# If x is not divisible by 5, it will take an extra step.\nsteps = x // 5 + (1 if x % 5 != 0 else 0)\n\nprint(steps)\n\n\t \t\t \t\t \t\t\t\t \t\t \t\t\t\t \t \t \t\t", "x = int(input())\r\nans = 0\r\nfor i in range(5, 0, -1):\r\n ans = ans + x // i\r\n x = x % i\r\nprint(ans)\r\n", "#Coder_1_neel\r\nx = int(input())\r\n\r\n\r\nimport math\r\nsteps_needed = math.ceil(x / 5)\r\n\r\nprint(steps_needed)\r\n", "import sys\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\ndef main():\r\n count = inp()\r\n steps = [1,2,3,4,5]\r\n ans = 0\r\n while count > 0:\r\n ans += count // steps[-1]\r\n count = count % steps[-1]\r\n steps.pop()\r\n \r\n print(ans)\r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "x=int(input())\r\ns=0\r\nstep=5\r\nstp=0\r\nwhile s!=x:\r\n while s+step>x:\r\n step-=1\r\n s+=step\r\n stp+=1\r\nprint(stp)", "x=int(input())\r\ns=int(x/5)\r\nif x%5!=0:\r\n s+=1\r\nprint(s)", "a=int(input())\r\nc=0\r\nwhile a>0:\r\n c+=a//5\r\n a%=5\r\n c+=a//4\r\n a%=4\r\n c+=a//3\r\n a%=3\r\n c+=a//2\r\n a%=2\r\n if a==1:\r\n c+=1\r\n a=0\r\nprint(c)", "import math\r\nx = int(input())\r\nsobuoc = x//5\r\nif (x%5>0): sobuoc+=1\r\nprint (sobuoc)", "n=int(input())\r\ns=0\r\nwhile(n>0):\r\n if(n>=5):\r\n s=s+1\r\n n=n-5\r\n elif(n==4):\r\n s=s+1\r\n n=n-4\r\n elif(n==3):\r\n s=s+1\r\n n=n-3\r\n elif(n==2):\r\n s=s+1\r\n n=n-2\r\n else:\r\n s=s+1\r\n n=n-1\r\nprint(s)", "import math\nn=int(input())\nprint(math.ceil(n/5))#asdfg\n\t\t \t \t \t \t\t\t\t\t\t\t \t\t\t \t\t \t", "n = int(input())\r\ncount = 0\r\nwhile n != 0:\r\n if n >= 5:\r\n n -= 5\r\n count += 1\r\n elif n == 4:\r\n n -= 4\r\n count += 1\r\n elif n == 3:\r\n n -= 3\r\n count += 1\r\n elif n == 2:\r\n n -= 2\r\n count += 1\r\n else:\r\n n -= 1\r\n count += 1\r\nprint(count)", "import math \nn=int(input())\nprint( math .ceil(n/5))\n \t\t \t \t \t \t\t\t\t\t\t \t \t\t \t", "import math\r\nn=int(input())\r\nn=math.ceil(n/5)\r\nprint(n)", "from math import ceil\r\nx = int(input())\r\nprint(ceil(x/5))", "n=int(input())\r\nc=0\r\nwhile n>0:\r\n if n>5:\r\n n-=5\r\n c+=1\r\n else:\r\n c+=1\r\n n=0\r\nprint(c)", "house=int(input())\r\nsteps=house//5\r\nif house%5>0:\r\n steps=steps+1\r\nprint(steps)", "a = input()\n\na=int(a)\n# b=int(b)\n\nif a%5 ==0:\n print(int(a/5))\nelse:\n print(int(a/5)+1)\n \t \t \t \t\t \t \t\t \t\t\t \t \t", "import math\r\n\r\ndist = int(input())\r\n\r\nif dist % 5 != 0:\r\n print(math.ceil(dist / 5))\r\nelse:\r\n print(int(dist/5))\r\n", "x = int(input())\r\ncount = 0\r\nprint(x//5 + (1 if x % 5 != 0 else 0))", "x=int(input())\r\nmaxMove=x\r\ncount=0\r\nfor i in range(0,x):\r\n if maxMove>5:\r\n maxMove=maxMove-5\r\n count +=1\r\n elif maxMove<=5:\r\n maxMove=maxMove-maxMove\r\n count += 1\r\n break\r\nprint(count)", "x = int(input()) # Input: The coordinate of the friend's house\n\n# Initialize a variable to keep track of the number of steps\nsteps = 0\n\n# Check if x is divisible by 5 and move in 5-step increments if possible\nwhile x >= 5:\n steps += 1\n x -= 5\n\n# If there is any remainder, you need additional steps for the remaining distance\nif x > 0:\n steps += 1\n\n# Output the minimum number of steps required\nprint(steps)\n\n \t \t \t\t \t\t \t \t \t\t \t\t\t \t \t", "x=int(input())\r\ni=0\r\nwhile x>0:\r\n if x-5>=0:\r\n x=x-5\r\n i+=1\r\n elif x-4>=0:\r\n x=x-4\r\n i+=1\r\n elif x-3>=0:\r\n x = x - 3\r\n i+=1\r\n elif x-2>=0:\r\n x = x - 2\r\n i+=1\r\n elif x-1>=0:\r\n x = x - 1\r\n i+=1\r\nprint(i)\r\n", "import math\r\n\r\nx = int(input())\r\n\r\nsteps = math.ceil(x / 5)\r\n\r\nprint(steps)\r\n", "import math\nx = int(input())\ny = math.ceil(x / 5)\nprint(y)\n\t \t\t\t\t \t \t \t\t \t \t\t \t \t", "x=int(input())\nmin_steps = (x + 4)// 5\nprint(min_steps)\n \t \t \t\t\t \t\t \t \t\t\t \t\t\t \t \t\t\t", "dist=int(input())\r\nif dist%5==0:\r\n print(dist//5)\r\nelse:\r\n print(dist//5+1)\r\n \r\n ", "n = int(input())\nprint((n+4)//5)\n\t \t\t\t \t\t\t\t \t\t\t\t \t\t \t \t", "n = int(input())\r\nprint ((n+4)//5)", "n = int(input())\r\nc = 0\r\nfor i in range(5, 0, -1):\r\n if n != 0:\r\n k = n // i\r\n c += k\r\n n -= k*i\r\nprint(c)\r\n", "x=int(input())\r\nn=x // 5 + (1 if x % 5 != 0 else 0)\r\nprint(n)", "from math import ceil\r\na = int(input())\r\nif a < 5:\r\n a = 1\r\nelse:\r\n a = ceil(a / 5)\r\nprint(a)", "import math\na=int(input())\nprint(math.ceil(a/5))\n\t \t \t\t \t \t\t\t \t \t\t \t \t", "x=int(input())\r\ncount=0\r\nif x%5==0:\r\n count=x//5\r\nelse :\r\n count=x//5+1\r\nprint(count)\r\n \r\n\r\n ", "a=int(input())\r\nif a%5>0:\r\n print(a//5+1)\r\nelse:\r\n print(a//5)", "\r\nx = int(input())\r\ny = 0\r\n\r\n\r\nfor i in range(0, 1000000):\r\n if x / 5 >= 1:\r\n x -= 5\r\n y += 1\r\n elif x / 4 >= 1:\r\n x -= 4\r\n y += 1\r\n elif x / 3 >= 1:\r\n x -= 3\r\n y += 1\r\n elif x / 2 >= 1:\r\n x -= 2\r\n y += 1\r\n elif x / 1 >= 1:\r\n x -= 1\r\n y += 1\r\nprint(y)\r\n", "# Read the coordinate of the friend's house\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps\r\n# Each step is of length 5, so we use integer division\r\n# to find out how many complete steps are needed.\r\n# The remainder (if any) indicates if an additional step is needed.\r\nsteps = x // 5 + (x % 5 != 0)\r\n\r\n# Print the minimum number of steps\r\nprint(steps)", "target = int(input())\r\n\r\nmoves = [5, 4, 3, 2, 1]\r\n\r\ntotal_moves = 0\r\n\r\nfor i in range(len(moves)):\r\n total_moves += target // moves[i]\r\n target %= moves[i]\r\n\r\nprint(total_moves)", "n = int(input())\r\n\r\nr = n // 5 \r\n\r\nif n == (r * 5):\r\n print(r)\r\nelse:\r\n print(r + 1)", "def elephant_steps(x):\n # Each step can cover a distance of 5 units\n # Divide x by 5 and round up to get the minimum number of steps\n steps = (x + 4) // 5\n return steps\n\ndef main():\n x = int(input())\n result = elephant_steps(x)\n print(result)\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t \t\t\t \t\t\t \t \t \t\t \t \t\t", "number = int(input())\r\ncounter = 0\r\nlist_numbers = [5,4,3,2,1]\r\nfor i in range (5):\r\n counter+=int(number/list_numbers[i])\r\n number = number%list_numbers[i]\r\nprint(counter)", "a = int(input())\r\nprint(a // 5 if a % 5 == 0 else (a // 5) + 1)", "moves = [5, 4, 3, 2, 1]\r\nsteps = 0\r\n\r\ncoord = int(input())\r\n\r\ni = 0\r\nwhile True:\r\n if coord >= moves[i]:\r\n coord -= moves[i]\r\n steps += 1 \r\n elif coord == 0:\r\n break\r\n else:\r\n i += 1\r\n\r\nprint(steps)\r\n", "n=int(input())\r\ns=n//5\r\nif n%5==0:\r\n print(s)\r\nelse:\r\n print(s+1)", "e = int(input())\r\nif (e % 5 == 0):\r\n print (e//5)\r\nelse:\r\n print (e//5 + 1)", "x = int(input())\r\ncnt = 0\r\n\r\nfor i in reversed(range(6)):\r\n while x-i >= 0:\r\n x -= i\r\n cnt += 1\r\n if x == 0:\r\n print(cnt)\r\n break\r\n", "n=int(input())\r\nres=n//5\r\nif n%5!=0:\r\n res=res+1\r\nprint(res)", "x=int(input())#coordinate of the friend's house\r\ncount=0\r\na=0\r\nwhile (a<x):\r\n if(x-a>=5):\r\n a=a+5\r\n elif(x-a==4):\r\n a=a+4\r\n elif(x-a==3):\r\n a=a+3\r\n elif(x-a==2):\r\n a=a+2\r\n elif(x-a==1):\r\n a=a+1\r\n count+=1\r\nprint(count)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 17:11:05 2023\r\n\r\n@author: ljy\r\n\"\"\"\r\n\r\nx=int(input())\r\nif x%5==0:\r\n print(x//5)\r\nelse:\r\n print(x//5+1)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[ ]:\n\n\nx=int(input())\nif x%5==0:\n print(str(x//5))\nelif x%5!=0:\n print(str((x//5)+1))\nelse:\n print(str(1)) \n \n \n \n\n\n# \n", "import math\r\nn=int(input())\r\nprint((n//5)+math.ceil(float(n%5)/5))\r\n", "import math\r\n\r\nn = int(input())\r\n\r\n\r\nprint(math.ceil(n/5))", "x = int(input())\r\nprint(int(x / 5) if x % 5 == 0 else int((x // 5)+1))", "import math\r\nx = int(input())\r\ns = math.ceil(x / 5)\r\nprint(s)\r\n", "n = int(input())\r\nresult = 0\r\n\r\nresult = n//5\r\n\r\nif n%5!=0:\r\n result+=1\r\n\r\nprint(result)", "casa=int(input())\r\nd=casa\r\nc=0\r\nwhile d>0:\r\n if d>=5:\r\n d-=5\r\n c+=1\r\n elif d>=4:\r\n d-=4\r\n c+=1\r\n elif d>=3:\r\n d-=3\r\n c+=1\r\n elif d>=2:\r\n d-=2\r\n c+=1\r\n elif d>=1:\r\n d-=1\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n", "x = int(input())\r\ns = 0\r\nstep = 5\r\nwhile x != 0:\r\n if x-step >= 0:\r\n x -= step\r\n s += 1\r\n else:\r\n step -= 1\r\nprint(s)\r\n", "import math\r\nx = int(input())\r\npieci = math.floor(x/5)\r\nx = x - (5*pieci)\r\ncetri = math.floor(x/4)\r\nx = x - (4*cetri)\r\ntris = math.floor(x/3)\r\nx = x - (3*tris)\r\ndivi = math.floor(x/2)\r\nx = x - (2*divi)\r\nprint(pieci + cetri + tris + divi + x)", "x = int(input())\r\n\r\n# Calculate the number of full steps\r\nfull_steps = x // 5\r\n\r\n# If there are remaining positions, add an additional step\r\nif x % 5 != 0:\r\n full_steps += 1\r\n\r\nprint(full_steps)\r\n", "x = int(input())\nnum= x // 5\nremainder = x % 5\nif remainder == 0:\n y= num\nelse:\n y= num + 1\n\nprint(y)\n\n\t\t \t \t\t \t \t\t\t\t \t \t \t\t \t\t\t", "x=int(input())\r\nd=x//5\r\nif x%5==0:\r\n d=d\r\nelse:\r\n d=d+1\r\nprint(d)\r\n", "home = 0\r\ndest = int(input())\r\nout = 0\r\nwhile home!=dest:\r\n if (dest-home)/5>=1:\r\n out+=(dest-home)//5\r\n home +=(dest-home)//5*5\r\n elif (dest-home)/4>=1:\r\n out+=(dest-home)//4\r\n home +=(dest-home)//4*4\r\n elif (dest-home)/3>=1:\r\n out+=(dest-home)//3\r\n home +=(dest-home)//3*3\r\n elif (dest-home)/2>=1:\r\n out+=(dest-home)//2\r\n home +=(dest-home)//2*2\r\n else:\r\n out+=(dest-home)\r\n home +=(dest-home)\r\nprint(out)", "import math\r\nx=int(input())\r\nmin_steps=math.ceil(x/5)\r\nprint(min_steps)", "n=int(input())\r\n\r\nif(n%5==0):\r\n x=n//5\r\nelse:\r\n x=(n//5)+1\r\n \r\nprint(x)", "import math\r\n\r\nx = int(input()) \r\n\r\nmin = math.ceil(x / 5)\r\n\r\nprint(min)\r\n", "n = int(input())\r\ncoins = [5, 4, 3, 2, 1]\r\nans = 0\r\n\r\nfor coin in coins:\r\n ans += n // coin\r\n n = n % coin\r\n\r\nprint(ans)\r\n", "x = int(input())\r\na = (x // 5) + 1 - (x % 5 == 0)\r\nprint(a)\r\n", "from math import ceil\r\nn = int(input())\r\nprint(ceil(n/5))", "import math\n\nx = int(input()) # Coordinate of the friend's house\nsteps = math.ceil(x / 5) # Calculate the minimum number of steps\n\nprint(steps)\n\n \t\t\t\t \t \t\t \t \t \t \t \t \t \t\t \t\t", "inp = int(input(\"\"))\r\nns = int(inp / 5)\r\nif inp%5 != 0:\r\n ns +=1\r\nprint(ns)", "x = int(input())\r\n\r\nif x%5 == 0:\r\n\tprint(x//5)\r\nelse:\r\n\tprint(int(x/5)+1)", "x=int(input())\r\npas=0\r\nrest=x\r\nfor i in range (5,0,-1):\r\n pas+=rest//i\r\n rest=rest%i\r\n\r\nprint(pas)", "x = int(input())\r\na = 0\r\ns = 0\r\nwhile a < x:\r\n a += 5\r\n s += 1\r\nprint(s)", "x = input()\n\ny = int(x) // 5\nif int(x)% 5==0:\n print(y)\nelse:\n print(y+1)\n", "def min_steps_to_friend_house(x):\r\n return (x + 4) // 5\r\nx = int(input())\r\nresult = min_steps_to_friend_house(x)\r\nprint(result)\r\n", "x = int(input()) # Coordinate of the friend's house\r\n\r\n# Calculate the minimum number of steps\r\n# Each step is a movement of 5 positions\r\n# So, divide x by 5 and add 1 if there is a remainder\r\nsteps = (x // 5) + (1 if x % 5 != 0 else 0)\r\n\r\nprint(steps)\r\n", "x = int(input()) \r\n\r\n\r\nmin_steps = (x + 4) // 5\r\n\r\n\r\nprint(min_steps)\r\n", "x = int(input())\r\ny = 5\r\nn=0\r\nv=0\r\nm=0\r\nb=0\r\nfor i in range(x):\r\n if x <= y:\r\n break\r\n else:\r\n n=0\r\n y = y ++ 5\r\nb=int(y)\r\nv = y/5\r\nm = v ++ 1\r\nfor i in range(5):\r\n if y == x :\r\n break\r\n elif y != x:\r\n y = y - 1\r\n else :\r\n n=0\r\nif y <= 5:\r\n print(1)\r\nelse:\r\n print(int(m-1))", "a=0\nx=int(input())\ncount=0\nwhile a+5<=x:\n a+=5\n count+=1\nwhile a+4<=x:\n a+=4\n count+=1\nwhile a+3<=x:\n a+=3\n count+=1\nwhile a+2<=x:\n a+=2\n count+=1\nwhile a+1<=x:\n a+=1\n count+=1\nprint(count)\n", "x = int(input()) \n\n\ninitial_moves, remainder = divmod(x, 5)\n\nif remainder > 0:\n steps = initial_moves + 1\nelse:\n steps = initial_moves\n\nprint(steps)\n\n\t\t\t\t\t\t \t\t\t \t\t \t\t\t\t \t\t \t", "# k,n,w=list(map(int,input().split()))\r\nt=int(input())\r\nif(t%5==0):\r\n print(int(t/5))\r\nelse:\r\n print(int((t/5))+1)\r\n\r\n\r\n \r\n", "k=int(input())\r\na=k//5\r\nb=(k%5)//4\r\nc=((k%5)%4)//3\r\nd=(((k%5)%4)%3)//2\r\ne=(((k%5)%4)%3)%2\r\nw=a+b+c+d+e\r\nprint(int(w))", "a=int(input())\r\nc=0\r\nb=0\r\nwhile True:\r\n c+=5\r\n b+=1\r\n if c>=a:\r\n print(b)\r\n break", "# Read the target position\r\ntarget_position = int(input())\r\n\r\n# Calculate the minimum number of steps required to reach the target position\r\n# We can move in steps of 5, so divide the target position by 5 and round up to the nearest integer\r\n# This is done using the ceil function from the math library\r\nimport math\r\nmin_steps = math.ceil(target_position / 5)\r\n\r\nprint(min_steps)", "x = int(input())\r\nif x %5 == 0 :\r\n s = x//5\r\nelse :\r\n s = x//5 +1\r\nprint(s)\r\n", "import math\nx = int(input())\nmin_steps = math.ceil(x / 5)\nprint(min_steps)\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\nif n % 5 == 0:\r\n print(int(n/5))\r\nelse:\r\n print(n//5 +1)", "x = int(input()) # Input the position of the friend's house\r\n\r\n# Calculate the minimum number of steps needed\r\nsteps = x // 5 # Integer division to get the quotient\r\nif x % 5 != 0:\r\n steps += 1 # Add 1 step if there is a remainder\r\n\r\nprint(steps)\r\n", "n = int(input())\r\nsteps = 1\r\nwhile n > 5:\r\n n -=5\r\n steps += 1\r\n\r\nprint(steps)\r\n\r\n", "x = int(input())\r\n\r\nmin_steps = x // 5\r\nremainder = x % 5\r\n\r\nif remainder > 0:\r\n min_steps += 1\r\n\r\nprint(min_steps)", "n = int(input())\r\nif n % 5 == 0:\r\n print(int(n / 5))\r\nelse:\r\n print(int((n / 5) + 1))\r\n", "def numsteps(x,c=0):\r\n \r\n return (x+4)//5\r\n \r\n\r\n\r\n\r\nfriend_house=int(input())\r\nres=numsteps(friend_house)\r\nprint(res)", "n = int(input())\r\na = n//5\r\nif n%5!=0:\r\n a+=1\r\nprint(a)", "x = int(input())\n\nif x%5:\n print(x//5+1)\nelse:\n print(x//5)\n \t\t \t\t\t \t \t \t \t\t\t \t\t\t \t", "x=int(input());print((x+4)//5)", "friend_location=int(input())\r\na=friend_location//5\r\nb=friend_location%5\r\nif b==0:\r\n print(a)\r\nelse:\r\n print(a+1)", "import math\nn=int(input())\nprint(math .ceil(n/5))\n \t \t\t\t\t\t\t \t\t\t \t\t\t \t \t \t \t", "total = int(input())\r\n\r\ndistance = total\r\n\r\nfirst_step = 5\r\nsteps = 0\r\n\r\nwhile distance > 0:\r\n while distance - first_step < 0:\r\n first_step -= 1\r\n distance -= first_step\r\n steps += 1\r\n\r\nprint(steps)", "n = int(input())\r\nprint(n//5+(n%5!=0))", "import math\r\nx = input(\"\")\r\nx = int(x)\r\nif x > 5:\r\n y = math.ceil(x / 5)\r\nelse:\r\n y = 1\r\nprint(y)", "import math\r\na=int(input())\r\nprint(math.ceil(a/5))", "a=int(input())\r\nk=(a//5)\r\na=a%5\r\nk1=a//4\r\na=a%4\r\nk2=a//3\r\na=a%3\r\nk3=a//2\r\na=a%2\r\nprint(k+k1+k2+k3+a)\r\n\r\n", "from math import *\nn=int(input())\nprint(ceil(n/5))", "x = int(input())\n\nif x >= 1 and x <= 1000000:\n steps = int(x / 5)\n if x % 5 > 0:\n steps += 1\n\nprint(steps)\n \t \t\t\t \t\t \t \t \t\t \t\t \t \t \t", "x = int(input())\r\n\r\nmin_steps = (x // 5) + 1 if x % 5 > 0 else x // 5\r\nprint(min_steps)\r\n", "# Function to calculate the minimum number of steps\ndef min_steps_to_friend(x):\n return (x + 4) // 5\n\n# Input\nx = int(input())\n\n# Output\nresult = min_steps_to_friend(x)\nprint(result)\n\n \t\t \t \t\t\t\t \t \t\t \t\t\t \t", "import math\r\n\r\nx = int(input()) # Read the coordinate of the friend's house\r\n\r\nmin_steps = math.ceil(x / 5) # Calculate the minimum number of steps (rounded up)\r\n\r\nprint(min_steps)\r\n", "def solve(x):\r\n # Calculate the number of full steps of size 5\r\n full_steps = x // 5\r\n \r\n # Check if there is a remainder when dividing by 5\r\n if x % 5 == 0:\r\n # If there is no remainder, no additional step of size 1 is needed\r\n return full_steps\r\n else:\r\n # If there is a remainder, one additional step of size 1 is needed\r\n return full_steps + 1\r\n \r\ndef main():\r\n \r\n value = int(input().strip()) # int values\r\n print(solve(value))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x = int(input())\nprint((x + 4) // 5)\n\n \t\t \t \t \t \t\t \t \t\t\t \t \t\t \t", "import math\r\n\r\nx = int(input()) # Input: Coordinate of the friend's house\r\n\r\n# Calculate the minimum number of steps using the ceiling function\r\nmin_steps = math.ceil(x / 5)\r\n\r\nprint(min_steps) # Output: Minimum number of steps\r\n", "while True:\r\n afstand =int(input())\r\n if 1<= afstand and afstand <= 1000000:\r\n break\r\naantalstap = 0\r\nstap = 5\r\n\r\nwhile stap >= 1:\r\n aantalstap = aantalstap + (afstand // stap)\r\n afstand = afstand % stap\r\n stap= stap-1\r\n\r\nprint(aantalstap)", "x=int(input())\r\nans=(x+4)//5\r\nprint(ans)\r\n", "n = int(input())\r\nsteps = 0\r\nif n < 5:\r\n steps = 1\r\nelif n % 5 == 0:\r\n steps = n//5\r\nelse:\r\n steps = (n//5)+1\r\nprint(steps)\r\n \r\n", "from math import ceil\r\n\r\n\r\ndef i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef sl():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\na = i()\r\n\r\n\r\nprint(int(ceil(a / 5)))", "other = int(input())\r\n\r\n\r\nif other <= 5:\r\n print(1)\r\nelif other%5 == 0:\r\n print(other//5)\r\nelse:\r\n print(other//5 + 1)", "x = int(input())\r\nif x%5 == 0:\r\n print(int(x/5))\r\nelse:\r\n print(int(x/5)+1)", "if __name__ == '__main__':\n pos = int(input())\n res = 0\n for step in range(5, 0, -1):\n if pos // step > 0:\n res += pos // step\n pos = pos % step\n print(res)\n", "s = int(input())\r\na = s // 5\r\nif s % 5 != 0:\r\n a += 1\r\nprint(a)\r\n", "distance=int(input())\ndef min_distance(distance):\n in5steps=distance//5\n counter=0\n remainder=distance%5\n if remainder==0:\n return in5steps\n else:\n return in5steps+1\nprint(min_distance(distance))", "x=int(input())\r\nif (x%5 == 0):\r\n print (int(x/5))\r\nelse:\r\n print (int(x/5)+1)", "if __name__ == \"__main__\":\r\n x = int(input())\r\n\r\n answer = int(x/5)\r\n\r\n if(x % 5 == 0):\r\n print(answer)\r\n else:\r\n print(answer + 1)", "a = int(input())\r\nminStep = 0\r\nif(a % 5 == 0):\r\n minStep = a // 5\r\n print(minStep)\r\nelse:\r\n minStep = a // 5 + 1\r\n print(minStep)", "position = int(input())\r\nif position % 5 != 0:\r\n print(1 + (position - (position % 5)) // 5)\r\nelse:\r\n print(position // 5)\r\n", "x = int(input())\r\ndist = 0\r\nstep = 5\r\nans = 0\r\nwhile dist != x:\r\n if dist + step <= x:\r\n dist += step\r\n ans += 1\r\n else:\r\n step -= 1\r\nprint(ans)", "x = int(input())\r\ncnt = 0\r\nwhile x > 5:\r\n cnt += 1\r\n x = x-5\r\ncnt += 1\r\nprint(cnt)\r\n", "x = int(input())\r\nmin_steps = (x // 5) + (1 if x % 5 != 0 else 0)\r\nprint(min_steps)", "a = int(input())\r\na_a = a\r\ntab = a // 5\r\na = a_a % 5\r\nif a == 0:\r\n print(tab)\r\nelse:\r\n print(tab + 1)\r\n", "def main():\r\n x = int(input())\r\n cnt_5, cnt_4, cnt_3, cnt_2, cnt_1 = 0, 0, 0, 0, 0\r\n cnt_5 += x // 5\r\n cnt_4 += (x - cnt_5 * 5) // 4\r\n cnt_3 += (x - cnt_5 * 5 - cnt_4 * 4) // 3\r\n cnt_2 += (x - cnt_5 * 5 - cnt_4 * 4 - cnt_3 * 3) // 2\r\n cnt_1 += x - cnt_5 * 5 - cnt_4 * 4 - cnt_3 * 3 - cnt_2 * 2\r\n print(cnt_5 + cnt_4 + cnt_3 + cnt_2 + cnt_1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "x=int(input())\nnum=x//5\nremainder=x%5\nif remainder==0:\n y=num\nelse:\n y=num+1\nprint(y)\n\n \t\t\t\t \t \t\t\t \t\t\t \t\t\t \t", "import math\r\nx = int(input())\r\nsteps = math.ceil(x / 5)\r\nprint(steps)\r\n", "import math\nn=int(input())\nprint(math.ceil(n/5))\n#000\n\n\t\t\t\t\t\t \t \t \t \t\t\t\t \t", "n = int(input())\r\nif n == 1 or n == 2 or n == 3 or n == 4 or n == 5:\r\n print(\"1\")\r\nelse:\r\n a = n//5\r\n if n%5==0:\r\n print(a)\r\n elif n%5>0:\r\n print(a+1)", "x = int(input())\n\nsteps = 0\nwhile True:\n if x > 5:\n steps += x // 5\n x -= 5*(x // 5)\n else:\n for el in [1,2,3,4,5]:\n if x == el:\n steps += 1\n break\n break\n\nprint (steps)\n\t\t\t\t \t\t\t \t \t\t\t\t \t\t \t \t\t\t \t", "print(int((int(input()) - 1) / 5) + 1)", "x = int(input())\ns = 0\nfor i in range(5,0,-1):\n while (x >= i):\n x = x-i\n s = s + 1\nprint(s)\n", "x = int(input())\r\nl = 0\r\nwhile(x>=5):\r\n x-=5\r\n l+=1\r\nwhile(x>=4):\r\n x-=4\r\n l+=1\r\nwhile(x>=3):\r\n x-=3\r\n l+=1\r\nwhile(x>=2):\r\n x-=2\r\n l+=1\r\nwhile(x>=1):\r\n x-=1\r\n l+=1\r\nprint(l)", "n = int(input())\r\nif n < 6:\r\n print(\"1\")\r\nelif n % 5 != 0:\r\n print((n // 5) + 1)\r\nelse:\r\n print(n // 5)\r\n", "n = int(input())\r\nstep = [i for i in range(1,6)]\r\n\r\nif n in step:\r\n print(1)\r\nelse:\r\n s = n/5\r\n if s == int(s):\r\n print(int(s))\r\n else:\r\n s = n//5\r\n print(s+1)", "s = int(input())\r\nk = 0\r\nwhile s > 0:\r\n if s - 5 >= 0:\r\n s -= 5\r\n k += 1\r\n else:\r\n if s - 4 >= 0:\r\n s -= 4\r\n k += 1\r\n else:\r\n if s - 3 >= 0:\r\n s -= 3\r\n k += 1\r\n else:\r\n if s - 2 >= 0:\r\n s -= 2\r\n k += 1\r\n else:\r\n if s - 1 >= 0:\r\n s -= 1\r\n k += 1\r\n else:\r\n break\r\nprint(k)", "import math\r\n\r\na = int(input())\r\nb = math.ceil(a/5)\r\nprint(b)", "import math\r\n\r\nx = int(input()) # Input the coordinate of the friend's house\r\nsteps = math.ceil(x / 5) # Calculate the minimum number of steps\r\n\r\nprint(steps) # Output the result\r\n", "x = int(input())\n\nif(x%5==0):\n print(int(x/5))\nelse:\n print(int(x/5+1)) ", "n=int(input())\r\nt=0\r\ns=5\r\nc=0\r\n\r\nwhile(t<n):\r\n diff=n-s\r\n if diff>=0:\r\n t+=s\r\n c+=1\r\n else:\r\n s-=1\r\n t+=s\r\n c+=1\r\nprint(c)\r\n ", "a = int(input())\r\nsteps = a//5 \r\nif a%5 !=0:\r\n steps=steps+1\r\nprint(steps)\r\n \r\n ", "d = int(input())\r\nprint(d // 5 + 1) if d % 5 else print(d // 5)", "def untill(x):\r\n y=2\r\n while y*5<x:\r\n y=y+1\r\n print(y)\r\nx=int(input())\r\nif(x<6):\r\n print(1)\r\nelse:\r\n untill(x)\r\n", "a=int(input())\nprint(a//5+(0 if a%5==0 else 1))\n \t\t \t\t\t \t\t \t \t \t\t \t\t \t", "n=int(input())\r\nc=0\r\nwhile n>0:\r\n\tif n>5 or n==5:\r\n\t\tn-=5\r\n\t\tc+=1\r\n\telif n==4:\r\n\t\tn-=4\r\n\t\tc+=1\r\n\telif n==3:\r\n\t\tn-=3\r\n\t\tc+=1\r\n\telif n==2:\r\n\t\tn-=2\r\n\t\tc+=1\r\n\tif n==1:\r\n\t\tn-=1\r\n\t\tc+=1\r\nprint(c)\r\n\t\t", "import math\r\np=int(input())\r\nelesteps=math.ceil(p/5)\r\nprint(elesteps)", "x=int(input())\r\nif x % 5 !=0:\r\n print((x//5) +1) \r\nelse :\r\n print(x//5) \r\n ", "x = int(input())\r\nif x % 5 == 0:\r\n y = x // 5\r\nelse:\r\n y = x // 5 + 1\r\nprint(y)\r\n", "import math\r\nx = int(input())\r\nprint(x//5 + math.ceil(x%5/5))", "coord = int(input())\r\nprint (coord//5+1)if coord%5!=0 else print (coord//5)\r\n \r\n", "n = int(input())\r\nr = n//5\r\nif n == r*5:\r\n print(r)\r\nelse:\r\n print(r+1)", "x = int(input())\r\ny = 0\r\ncount = 0\r\nwhile y < x:\r\n y += 5\r\n count += 1\r\nprint(count)\r\n", "x = int(input())\r\ncounts = x // 5 \r\nif x % 5 != 0: \r\n counts += 1\r\nprint(counts)\r\n\r\n", "entrada = int(input())\r\npasos = 0\r\n\r\nif entrada % 5 == 0:\r\n pasos = entrada / 5\r\nelif (entrada - 4) % 5 == 0:\r\n pasos = entrada / 5 + 1\r\nelif (entrada - 3) % 5 == 0:\r\n pasos = entrada / 5 + 1\r\nelif (entrada - 2) % 5 == 0:\r\n pasos = entrada / 5 + 1\r\nelif (entrada - 1) % 5 == 0:\r\n pasos = entrada / 5 + 1\r\nelif entrada % 4 == 0:\r\n pasos = entrada / 4\r\nelif entrada % 3 == 0:\r\n pasos = entrada / 3\r\nelif entrada % 2 == 0:\r\n pasos = entrada / 2\r\n\r\n\r\nprint(int(pasos))", "import math\n\n\nx = int(input())\n\n\nmin_steps = math.ceil(x / 5)\n\n\nprint(min_steps)\n\n \t\t \t \t\t\t\t\t \t \t \t \t", "import math\r\n\r\nfriend = int(input())\r\nsteps = math.ceil(friend / 5)\r\nprint(steps)", "def solve():\r\n n = int(input())\r\n steps = n//5\r\n rem = n%5\r\n if rem != 0:\r\n return steps+1\r\n return steps\r\n\r\nprint(solve())", "x = int(input())\r\nsteps = 0\r\nwhile x >= 5:\r\n x-=5\r\n steps+=1\r\nwhile x >= 4:\r\n x-=4\r\n steps+=1\r\nwhile x >= 3:\r\n x-=3\r\n steps+=1 \r\nwhile x >= 2:\r\n x-=2\r\n steps+=1 \r\nwhile x >= 1:\r\n x-=1\r\n steps+=1\r\nprint(steps)", "a=int(input())\r\nq=a//5\r\nif a%5==0:\r\n step=q\r\nelse:\r\n step=q+1\r\nprint(step)", "path = int(input())\r\nprint(path//5) if path % 5 == 0 else print(path//5+1)\r\n", "a=int(input())\r\nc=[]\r\nfor i in range(5,0,-1):\r\n c.append(a//i)\r\n a=a%i\r\ncount=0\r\nfor i in range(len(c)):\r\n count+=c[i]\r\nprint(count)", "a = int(input())\n\nb = 0\nif(a % 5 == 0):\n b = int(a / 5) \nelse:\n b = int(a / 5) + 1 \n\nprint(b)\n\n \t\t\t \t\t \t\t\t\t\t \t\t\t \t\t\t \t \t\t \t", "x = int(input())\r\nprint((x - 1) // 5 + 1)", "x=int(input())\r\nsteps=0\r\nsteps=steps+(x//5)\r\nx=x%5\r\nsteps=steps+(x//4)\r\nx=x%4\r\nsteps=steps+(x//3)\r\nx=x%3\r\nsteps=steps+(x//2)\r\nx=x%2\r\nsteps=steps+x\r\nprint(steps)\r\n", "import math\r\n\r\ncoord = int(input())\r\nprint(math.ceil(coord/5))", "import math\r\nele = 0\r\nfriend = int(input())\r\n\r\nans = math.ceil(friend / 5)\r\n\r\nprint(ans) ", "inp = int(input())\nnumber =0\nresidue = inp\nfor i in [5, 4, 3, 2, 1]:\n number += residue//i\n residue = residue%i\nprint(number)\n", "import math\r\n\r\n# Read the input value x\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps\r\nmin_steps = math.ceil(x / 5)\r\n\r\n# Print the minimum number of steps\r\nprint(min_steps)", "x=int(input())\r\nres=x//5\r\nif (x%5 != 0):\r\n res=res+1\r\nprint(res)\r\n\r\n\r\n\r\n ", "n = int(input())\r\nprint(n//5+(n%5>0))", "a = int(input())\r\ns = 0\r\ns = a // 5\r\nif a%5 > 0:\r\n s +=1\r\nprint(s)", "n = int(input())\r\ncount = 0\r\nwhile n >0 :\r\n n = n - 5\r\n count +=1\r\nprint(count)", "n = int(input())\r\nk = 0\r\nif n%5==0:\r\n k = n//5\r\nelse:\r\n k = (n//5)+1\r\nprint(k)", "n = int(input())\r\ncount = 0\r\nwhile n > 5:\r\n n -= 5\r\n count += 1\r\ncount += 1\r\nprint(count)", "x=int(input())\r\nc=0\r\nfor i in range(5):\r\n i+=1\r\n \r\nif x<=i:\r\n c+=1\r\n print(c)\r\nelse:\r\n x=(x+i-1)//i\r\n print(x)", "loc = int(input())\r\nstep = 0\r\ni = 0\r\nif loc >= 5:\r\n i = 5\r\nelse:\r\n i = loc\r\nwhile loc != 0 :\r\n k = loc // i\r\n step += k\r\n loc -= k * i\r\n i -=1\r\nprint(step)\r\n", "import math\r\nx= int(input())\r\nprint(int(math.ceil(x/5)))", "distance = int(input(''))\r\nsteps = distance // 5 if distance % 5 == 0 else (distance - distance % 5) // 5 + 1\r\nprint(steps)", "import sys\r\nfrom collections import defaultdict, deque, Counter\r\nfrom math import gcd, ceil, floor, factorial\r\nfrom itertools import permutations, combinations\r\n\r\n# Fast I/O\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef LI(): return list(map(int, sys.stdin.readline().split()))\r\ndef LS(): return list(sys.stdin.readline().split())\r\ndef S(): return sys.stdin.readline().rstrip()\r\ndef MI(): return map(int, sys.stdin.readline().split())\r\ndef LI2D(rows): return [LI() for _ in range(rows)]\r\n\r\n# Constants\r\nMOD = 10**9 + 7\r\nINF = float('inf')\r\ndef solve(x):\r\n if(x%5==0):\r\n return x//5\r\n else:\r\n return (x//5)+1\r\n# Main function\r\ndef main():\r\n x=I()\r\n res=solve(x)\r\n print(res)\r\nif __name__ == \"__main__\":\r\n main()", "x = int(input())\r\ny = x%5\r\nz = x - y\r\nn = z/5\r\nif y > 0:\r\n n += 1\r\nprint (int(n))", "S = int(input())\r\n\r\n\r\ndef ans(x):\r\n if x == 0:\r\n return 0\r\n if x < 5:\r\n return 1\r\n else:\r\n return x // 5 + ans(x % 5)\r\n\r\n\r\nprint(ans(S))\r\n", "a = int(input())\nb = a % 5\nc = a // 5\nif b == 0:\n print(c)\nelse:\n c = c + 1\n print(c)\n\t \t\t \t\t\t \t \t \t\t\t \t\t\t\t \t\t\t \t \t", "x = int(input(\"\"))\r\nder = x/5\r\nap = x//5\r\nif der == 0:\r\n print(0)\r\nelse:\r\n if der == ap:\r\n print(ap)\r\n elif der < ap:\r\n print(ap+1)\r\n else:\r\n print(ap+1)", "num = int(input())\r\ntime = 0\r\n\r\nwhile num > 0:\r\n for i in range(5,0,-1):\r\n if (num-i) >= 0: \r\n num -= i\r\n time += 1\r\n break\r\n\r\nprint(time)", "x = int(input())\r\ncount = 0\r\nwhile (x>=5) :\r\n count += 1\r\n x = x-5\r\nwhile (x>=4 and x<5) :\r\n count += 1\r\n x = x-4\r\nwhile (x>=3 and x<4):\r\n count += 1\r\n x = x-3\r\nwhile (x>=2 and x<3):\r\n count += 1\r\n x = x-2\r\nwhile (x>=1 and x<2):\r\n count += 1\r\n x = x-1\r\nprint(count)", "x= int(input())\nif x%5==0:\n print(x//5)\nelse:\n print((x//5)+1)", "import math\r\nx = int(input())\r\nmin_step = math.ceil(x/5)\r\nprint(min_step)", "distance = input()\r\nint_dist = int(distance)\r\ncounter = 0\r\n\r\nwhile int_dist != 0:\r\n\r\n if int_dist > 4:\r\n int_dist -= 5\r\n counter += 1\r\n elif int_dist > 3:\r\n int_dist -= 4\r\n counter += 1\r\n elif int_dist > 2:\r\n int_dist -= 3\r\n counter += 1\r\n elif int_dist > 1:\r\n int_dist -= 2\r\n counter += 1\r\n elif int_dist > 0:\r\n int_dist -= 1\r\n counter += 1\r\n\r\nprint(counter)\r\n\r\n\r\n", "import math\nf = int(input())\nsteps = math.floor(f/5)\nif(f%5>0):\n steps+=1\nprint(steps)", "n = int(input())\r\nsteps=0\r\nwhile n>0:\r\n steps+=1\r\n n -=5\r\nprint(steps)", "x = int(input())\r\nc = 0\r\nif x % 5 == 0:\r\n print(int(x/5))\r\nelse:\r\n c = x // 5\r\n x = x % 5\r\n if (x - 4) == 0:\r\n c += 1\r\n x -= 4\r\n elif (x - 3) == 0:\r\n c += 1\r\n x -= 3\r\n elif (x - 2) == 0:\r\n c += 1\r\n x -= 2\r\n elif (x - 1) == 0:\r\n c += 1\r\n x -= 1\r\n print(c)", "#initializes destination, elephant's position, and steps\r\nx = int(input())\r\nelephant = 0\r\nsteps = 0\r\n\r\n#counts how many steps (simplified to the max 5) till elephant reaches destination\r\nwhile elephant < x:\r\n elephant += 5\r\n steps += 1\r\n\r\nprint(steps)", "import math \nx=int(input())\nprint(math.ceil(x/5))\n \t \t\t \t \t\t \t\t \t \t \t", "# Read the input\r\nx = int(input())\r\n\r\n# Calculate the minimum number of moves\r\nmoves = (x + 4) // 5\r\n\r\n# Output the result\r\nprint(moves)\r\n", "x=input()\r\na=int(x)/5\r\nif int(x)%5==0:\r\n print(int(a))\r\nelse:\r\n print(int(a)+1)", "x = int(input())\nk = 0\nk += x // 5\nk += (x % 5) // 4\nk += ((x % 5) % 4) // 3\nk += ((x % 5) % 4) % 3 // 2\nk += ((x % 5) % 4) % 3 % 2 // 1\nprint(k)", "num=int(input())\na=divmod(num,5)\nif a[1]==0:\n print(a[0])\nelse:\n print(a[0]+1)\n\n\t \t \t\t\t\t \t\t \t \t \t \t \t \t \t", "n = int(input())\r\n\r\nprint((n//5) if n % 5 == 0 else (n//5)+1)\r\n\r\n\r\n", "point_b = int(input())\r\nstep = point_b // 5\r\nif point_b % 5:\r\n step += 1\r\nprint(step)\r\n", "a = input()\na=int(a)\ni=0\nwhile(a>=5):\n a-=5\n i+=1\nwhile(a>=4):\n a-=4\n i+=1\nwhile(a>=3):\n a-=3\n i+=1\nwhile(a>=2):\n a-=2\n i+=1\nwhile(a>=1):\n a-=1\n i+=1\nprint(i)\n \t \t\t\t \t \t\t \t \t \t\t \t", "import math\r\nx=int(input())\r\ny1=0 \r\ny=0 \r\ny2=0 \r\ny3=0 \r\ny4=0\r\ny=x\r\ny1=x/2\r\ny2=x/3\r\ny3=x/4\r\ny4=x/5\r\nl=[y,y1,y2,y3,y4]\r\nprint(math.ceil(min(l)))", "x = int(input())\r\n\r\nobvious = x // 5\r\ncomplicated = int(x % 5 > 0)\r\n\r\nprint(obvious + complicated)\r\n", "a=int(input())\r\nif a%5==0:\r\n b=int(a/5)\r\nelse:\r\n b=int(a/5)+1\r\nprint(b)\r\n", "n=int(input())\r\nc=0\r\nwhile(n>0):\r\n n=n-5\r\n c=c+1\r\nprint(c)\r\n ", "x = int(input())\r\ni = 0\r\ns = 0\r\n\r\nwhile s < x:\r\n if i + 5 <= x:\r\n i += 1\r\n s += 5\r\n elif i + 4 <= x:\r\n i += 1\r\n s += 4\r\n elif i + 3 <= x:\r\n i += 1\r\n s += 3\r\n elif i + 2 <= x:\r\n i += 1\r\n s += 2\r\n else:\r\n i += 1\r\n s += 1\r\n\r\nprint(i)", "t = int(input())\r\nans = 0\r\nans += t//5\r\nx = t - 5 * ans\r\nif x > 0:\r\n ans += 1\r\nprint(ans)\r\n \r\n ", "a = int(input())\r\ns = a//5\r\nif a % 5 == 0:\r\n print(s)\r\nelse:\r\n print(s+1)", "import math\r\nn = int(input())\r\nsteps = math.ceil(n / 5)\r\nprint(steps)\r\n", "x=int(input())\r\nn=x//5\r\nif x%5!=0:\r\n n=n+1\r\nprint(n)", "import math\r\n\r\nx = int(input())\r\nif x >= 0:\r\n result = math.ceil(x / 5)\r\n print(result)\r\n", "dist = int(input())\r\nsteps = 0\r\n# check end step\r\nrest = dist % 5 \r\nif rest != 0 :\r\n steps = 1\r\n dist = dist - rest\r\nsteps += int(dist / 5)\r\nprint(steps)", "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 n = I()\r\n count = 0\r\n while n > 0:\r\n if n > 5:\r\n count += 1\r\n n -= 5\r\n else:\r\n count += 1\r\n n -= n\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=int(input())\r\ncount=0\r\nwhile s!=0:\r\n if s>=5:\r\n s-=5\r\n elif s>=4:\r\n s-=4\r\n elif s>=3:\r\n s-=3\r\n elif s>=2:\r\n s-=2\r\n else:\r\n s-=1\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\nt = 0\r\n\r\nwhile n != 0:\r\n if n >= 5:\r\n n = n - 5\r\n t += 1\r\n elif n >= 4:\r\n n = n - 4\r\n t += 1\r\n elif n >= 3:\r\n n = n - 3\r\n t += 1\r\n elif n >= 2:\r\n n = n - 2\r\n t += 1\r\n elif n >= 1:\r\n n = n - 1\r\n t += 1\r\n\r\nprint(t)", "a = int(input())\r\nif a % 5 != 0:\r\n print(int((a / 5) + 1))\r\nelse:\r\n print(int(a / 5))\r\n", "import math\n\nx = int(input(\"\"))\n\nsteps = math.ceil(x / 5)\nprint(steps)\n \t \t\t\t \t\t \t \t \t\t\t\t \t \t \t \t \t", "n = int(input())\r\n\r\nif n % 5 != 0:\r\n result = n // 5 + 1\r\nelse:\r\n result = n // 5\r\n\r\nprint(result)\r\n", "x = int(input()) # Input the coordinate of the friend's house\r\n\r\n# Calculate the minimum number of steps needed\r\nmin_steps = x // 5 # Divide by 5 to get the minimum steps\r\n\r\n# Check if there's a remainder after dividing by 5\r\nif x % 5 != 0:\r\n min_steps += 1 # Add an extra step if there's a remainder\r\n\r\nprint(min_steps) # Output the minimum number of steps needed\r\n", "x = int(input())\ny = x % 5\nsteps = 0\nif y != 0:\n steps = 1\nsteps += int((x-y) / 5)\nprint(steps)", "import math\r\nn = int(input())\r\nprint(n//5 + math.ceil((n%5) / 5))", "n=int(input())\r\nif(n%5==0):\r\n print(int(n/5))\r\nelif(n>0 and n<5):\r\n print(1)\r\nelse:\r\n print(int(n/5)+1)", "x=int(input())\r\nc=0\r\nif(x%5==0):\r\n c=x//5\r\nelse:\r\n c=c+(x//5)+1 \r\nprint(c)\r\n", "import math\r\nx = int(input())\r\na = math.ceil(x/5)\r\nprint(a)", "import math\nn=int(input())\nprint(math.ceil(n/5))#4\n\t\t \t\t\t\t \t\t \t\t \t \t \t \t \t\t\t\t\t", "import math\r\n\r\n# Read the coordinate of the friend's house\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps needed\r\nsteps = math.ceil(x / 5)\r\n\r\n# Print the result\r\nprint(steps)\r\n", "n = int(input())\r\nd = dict()\r\n\r\nfor i in range(5, 0, -1):\r\n d[i] = 0\r\n\r\n\r\nfor i in d.keys():\r\n\r\n while n >= i:\r\n n -= i\r\n d[i] += 1\r\n\r\nprint(sum(d.values()))", "x=int(input())\r\nc=0\r\nfor i in range(-5,-0):\r\n if(x/abs(i)>=1):\r\n c=(x/abs(i))+c\r\n x=x%abs(i)\r\nprint(int(c))\r\n\r\n\r\n", "num = int(input())\r\nresult = 0\r\nresult = num // 5\r\nif num % 5 != 0:\r\n result += 1\r\nprint(result)\r\n", "n=int(input())\r\nx=n//5\r\nif n%5!=0:\r\n x=x+1\r\nprint(x)", "import math\r\nx = int(input())\r\nmin_steps = math.ceil(x / 5)\r\nprint(min_steps)\r\n", "import math #start\nn=int(input()) #take input\nprint(math.ceil(n/5))\n\t \t \t\t \t \t\t \t \t \t \t \t\t", "a=int(input())\r\nb=a//5\r\nif a%5==0:\r\n print(b)\r\nelse:\r\n print(b+1)", "from math import *\nx = input()\nx = int(x)\nx1 = x / 5\nprint(ceil(x1))\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\nn = int(input())\r\nif n %5 ==0:\r\n print(n//5)\r\nelse:\r\n print((n//5)+1)", "\"\"\"\r\nProblem Statement:\r\n An elephant decided to visit his friend. \r\n It turned out that the elephant's house is located at point 0\r\n and his friend's house is located at point x(x > 0) of the coordinate line. \r\n in one step the elephant can move 1, 2, 3, 4 or 5 positions forward. \r\n Determine, what is the minimum number of steps he need to make in order to get to his friend's house.\r\nInput Format:\r\n The first line of the input contains an integer x (1<=x<=1000000)\r\n ---The coordinate of the friend's house.\r\nOutput Formats:\r\n Print the minimum number of steps that elephant needs to make to get from point 0 to point x.\r\n\"\"\"\r\ndef elephant(x):\r\n steps = 0\r\n while x > 0:\r\n if x >= 5:\r\n steps += 1\r\n x -= 5\r\n elif x >= 4:\r\n steps += 1\r\n x -= 4\r\n elif x >= 3:\r\n steps += 1\r\n x -= 3\r\n elif x >= 2:\r\n steps += 1\r\n x -= 2\r\n else:\r\n steps += 1\r\n x -= 1\r\n return steps\r\n\r\ndef main():\r\n x = int(input())\r\n result = elephant(x)\r\n print(result)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n \r\n# input 5 \r\n# output 1", "import math\r\n\r\npos = int(input())\r\nsteps = math.ceil(pos/5)\r\nprint(steps)", "house_friend=int(input())\r\nsteps = house_friend // 5\r\nif house_friend % 5:\r\n steps += 1\r\nprint(steps)", "import math\r\n\r\n# Input\r\nx = int(input())\r\nsteps = math.ceil(x / 5)\r\n\r\n# Output\r\nprint(steps)\r\n", "n=int(input())\r\nm=n//5\r\n\r\nif n%5==0:\r\n print(m)\r\nelse:\r\n answer=m+1\r\n print(answer)\r\n ", "# CFProblem: 617A_Elephant\r\n\r\n\r\ndef minStep(x):\r\n return x/5 if x % 5 == 0 else x/5+1\r\n\r\n\r\nprint(int(minStep(int(input()))))\r\n", "distance = int(input())\r\nstep = distance // 5\r\nrest = distance - (5*step)\r\nif rest >= 1:\r\n step += 1\r\nprint(step)", "x = int(input())\n\n# Calculate the minimum number of steps\nsteps = (x + 4) // 5\n\nprint(steps)\n\n\t \t\t \t \t \t \t\t \t\t \t \t \t \t\t", "def elephant(test_input):\r\n steps = 0\r\n\r\n step_sizes = [5, 4, 3, 2, 1]\r\n\r\n steps = test_input // step_sizes[0]\r\n if test_input % step_sizes[0] == 0:\r\n return steps\r\n else:\r\n return steps + 1\r\n\r\n\r\nif __name__ == '__main__':\r\n print(elephant(int(input())))\r\n", "a = int(input())\r\nd = 0\r\nif a <= 5:\r\n print(1)\r\nelse:\r\n for i in range(a):\r\n a -= 5\r\n d += 1\r\n if a <= 5:\r\n print(d+1)\r\n break\r\n else:\r\n continue", "t=int(input())\r\nif t<=5:\r\n print(1)\r\nelse :\r\n t/=5\r\n print(t.__ceil__())", "x=int(input())\r\nif x%5==0:\r\n s=x//5\r\nelse:\r\n s=x//5+1\r\nprint(s)", "posicao = int(input())\r\npassos_total = 0\r\nandou = 0\r\nfaltam = posicao\r\n\r\nfor i in range(5,0,-1):\r\n passos = faltam // i\r\n passos_total += passos\r\n andou = passos * i\r\n faltam -= andou\r\n\r\nprint(passos_total)", "x = int(input())\r\ncount = 0\r\nif x % 5 == 0:\r\n count = x // 5\r\nelse:\r\n count = x // 5 + 1\r\nprint(count)", "d=int(input())\r\nif d%5==0:\r\n step=d/5\r\nelse:\r\n step=d//5+1\r\nprint(int(step))", "import math\n\n# Input\nx = int(input())\n\n# Calculate the minimum number of steps\nmin_steps = math.ceil(x / 5)\n\n# Output the result\nprint(min_steps)\n\n \t \t \t\t\t \t\t\t\t \t\t\t\t \t", "result = \"\"\r\nx = int(input())\r\nif 1 <= x and x <= 1000000:\r\n largest = 0\r\n value = 0\r\n for i in range(5):\r\n i += 1\r\n if int(x/i) >= 1:\r\n largest = int(x/i)\r\n value = i\r\n if x - (largest*value) == 0:\r\n result = largest\r\n else:\r\n temp_x = x - (largest*value) \r\n largest2 = 0\r\n for i in range(5):\r\n i += 1\r\n if int(temp_x/i) >= 1:\r\n largest2 = int(temp_x/i)\r\n result = largest + largest2\r\n\r\nprint(f\"{result}\")", "import math\nn=int(input())\nprint(math.ceil(n/5))#wer\n \t\t \t\t\t\t\t\t \t \t\t\t \t \t\t\t \t\t\t\t\t", "import math\na= int(input())\nprint(math.ceil(a/5))\n \t\t\t\t\t\t \t \t\t\t \t\t\t \t\t\t \t", "c=int(input())\r\ncount=0\r\nif c%5==0:\r\n c=c//5\r\n print(c)\r\nelse:\r\n c=c//5\r\n print(c+1)", "import math\r\n\r\nDistance = int(input())\r\nprint(math.ceil(Distance/5))", "x = int(input())\r\nsmall_moves = x % 5\r\nbig_moves = int(x/5)\r\nif small_moves ==0:\r\n print(big_moves)\r\nelif small_moves !=0:\r\n print(big_moves + 1)", "x=int(input())\r\nans = 0\r\nstep = 5\r\nwhile x>0:\r\n while x//step>0:\r\n ans+=x//step\r\n x=x%step\r\n step = step-1\r\nprint(ans)", "x = int(input())\nprint(x // 5 + 1 if x % 5 != 0 else x // 5)\n \t\t \t\t\t \t \t \t \t\t\t\t \t\t\t\t \t", "n = int(input())\r\na = 0\r\nb = 0\r\nwhile a < n:\r\n a += 5\r\n b += 1\r\nprint(b)", "def draw_st(n):\r\n\r\n counter = 0\r\n while n > 0:\r\n if n >= 5:\r\n counter += 1\r\n n -= 5\r\n if n == 4:\r\n counter += 1\r\n n -= 4\r\n if n == 3:\r\n counter += 1\r\n n -= 3\r\n if n == 2:\r\n counter += 1\r\n n -= 2\r\n if n == 1:\r\n counter += 1\r\n n -= 1\r\n return counter\r\n\r\n\r\nn = int(input())\r\nprint(draw_st(n))", "n=int(input())\r\nsteps=0\r\nwhile(n>0):\r\n if n>=5:\r\n n=n-5\r\n steps+=1\r\n if n>=4 and n<5:\r\n n=n-4\r\n steps+=1\r\n if n>=3 and n<4:\r\n n=n-3\r\n steps+=1\r\n if n>=2 and n<3:\r\n n=n-2\r\n steps+=1\r\n if n>=1 and n<2:\r\n n=n-1\r\n steps+=1\r\nprint(steps)", "x=int(input())\r\nsteps=0\r\nif x>=5:\r\n steps+=x//5\r\n x-=(x//5)*5\r\nif x<=4 and x>0:\r\n steps+=1\r\nprint(steps)\r\n\r\n", "x = int(input())\r\n\r\nstep = 0\r\n\r\nfor i in range(5, 0, -1):\r\n if x > 0:\r\n if(x // i != 0):\r\n step += (x // i)\r\n x -= (step * i)\r\n else:\r\n break\r\n\r\nprint(step)\r\n\r\n#80+48+9+4+1\r\n#28", "num = int(input())\r\nval = int(num//5) if num%5==0 else int(num//5+1)\r\nprint(val)", "x = int(input())\r\nmin_steps = (x + 4) // 5\r\nprint(min_steps)\r\n", "d = int(input())\r\na = 0\r\nstep = 0\r\nwhile a < d:\r\n a += 5\r\n step += 1\r\nprint(step)", "import math\r\n\r\nMOD = 1000000007\r\nINF = float('inf')\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\ndef read_map():\r\n return map(int, input().split())\r\n\r\ndef read_lst():\r\n return list(map(int, input().split()))\r\n\r\ndef read_str():\r\n return input()\r\n\r\ndef ok(val):\r\n print(\"YES\" if val else \"NO\")\r\n\r\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\r\n\r\ndef solve():\r\n x = read_int()\r\n ans = 0\r\n if x // 5 > 0:\r\n ans += x // 5\r\n x = x % 5\r\n if x // 4 > 0:\r\n ans += x // 4\r\n x = x % 4\r\n if x // 3 > 0:\r\n ans += x // 3\r\n x = x % 3\r\n if x // 2 > 0:\r\n ans += x // 2\r\n x = x % 2\r\n if x // 1 > 0:\r\n ans += x // 1\r\n x = x % 1\r\n print(ans)\r\n\r\n# <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<\r\n\r\ndef main():\r\n for _ in range(1):\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = int(input())\r\nsteps = 0\r\n\r\ndef get_steps(x):\r\n global steps\r\n step_size = 5\r\n while(step_size and x):\r\n steps += x / step_size\r\n x %= step_size\r\n step_size = x if step_size > x else step_size - 1\r\n return int(steps)\r\n\r\nprint(get_steps(x))", "def min_steps(x):\r\n # Divide x by 5 and round up to the nearest integer\r\n # to find the minimum number of steps needed\r\n return (x + 4) // 5\r\n\r\n# Read input\r\nx = int(input())\r\n\r\n# Calculate and print the result\r\nprint(min_steps(x))\r\n", "distance = int(input())\r\nn = 0\r\nfor i in range(5, 0, -1):\r\n n += distance // i\r\n distance = distance % i\r\n if distance == 0:\r\n print(n)\r\n break", "intig=int (input ())\r\nadd=0\r\n\r\nif intig > 0 and intig < 1000001:\r\n while intig > 0:\r\n if intig >= 5:\r\n add = intig//5\r\n intig = intig % 5\r\n elif intig >= 4:\r\n add += intig//4\r\n intig = intig % 4\r\n elif intig >= 3 :\r\n add += intig//3\r\n intig = intig % 3\r\n elif intig >= 2:\r\n add += intig//2\r\n intig = intig % 2\r\n else :\r\n add += 1\r\n break\r\n print (add)\r\n", "n = int(input())\n\nres = n / 5\n\nif res % 1 == 0: \n print(int(res))\nelse: \n print(n//5+1)\n", "step = int(input())\r\n\r\nif step <= 5:\r\n print(1)\r\nelse:\r\n print(int(step / 5) + (step % 5 > 0))", "n = int(input())\r\ncount = 0\r\n\r\nwhile n >= 5:\r\n n -= 5\r\n count += 1\r\n\r\nif n != 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "n=input()\r\nx= int(n)\r\nfive= int(x/5)\r\nfour= int((x-five*5)/4)\r\nthree= int((x-five*5-four*4)/3)\r\ntwo = int((x-five*5-4*four-3*three)/2)\r\none = int(x-five*5-4*four-3*three-2*two)\r\ntotal= int(one+two+three+four+five)\r\nprint(total)\r\n", "x = int(input())\r\nsteps = x // 5 + (x % 5 != 0)\r\nprint(steps)", "x = int(input())\r\nprint(x//5 if x%5 == 0 else x//5 + 1)", "n=int(input())\r\ncount=0\r\nwhile n!=0:\r\n\tif n>=5:\r\n\t\tn-=5\r\n\t\tcount+=1\r\n\telif n==4:\r\n\t\tn-=4\r\n\t\tcount+=1\r\n\telif n==3:\r\n\t\tn-=3\r\n\t\tcount+=1\r\n\telif n==2:\r\n\t\tn-=2\r\n\t\tcount+=1\r\n\telse:\r\n\t\tn-=1\r\n\t\tcount+=1\r\nprint(count)", "import math \nX = int(input()) \nsteps = math.ceil(X/5) \nprint(steps) \n\t \t \t\t\t \t \t \t \t\t\t \t", "n = int(input())\r\ni = 0\r\n\r\nwhile n > 0:\r\n n = n - 5\r\n i += 1\r\n\r\nprint(i)", "length = int(input())\r\n\r\nsteps = 0\r\n\r\nif length % 5 != 0 :\r\n steps = (length // 5) + 1\r\nelse :\r\n steps = length // 5\r\n\r\nprint(steps)", "a = int(input())\r\nprint(-(-a //5))", "import math\nl=int(input())\nprint(math.ceil(l/5))\n \t\t \t\t\t \t\t\t\t \t \t \t\t\t \t \t\t\t\t", "x = int(input()) # Input the coordinate of the friend's house\r\n\r\n# Calculate the minimum number of steps needed\r\nmin_steps = (x + 4) // 5 # Integer division (//) ensures the result is rounded up\r\n\r\nprint(min_steps)\r\n\r\n", "n = int(input())\r\ne = 0\r\nwhile n > 0:\r\n n -= 5\r\n e += 1\r\nprint(e)", "x=int(input())\r\nans=0\r\nwhile x>=5:\r\n ans=ans+1\r\n x-=5\r\nwhile x>=4:\r\n ans=ans+1\r\n x-=4\r\nwhile x>=3:\r\n ans=ans+1\r\n x-=3\r\nwhile x>=2:\r\n ans=ans+1\r\n x-=2\r\nwhile x>=1:\r\n ans=ans+1\r\n x-=1\r\nprint(ans)\r\n", "x=int(input())\r\ns=int(x/5)\r\nif x-(5*s)!=0:\r\n s+=1\r\nprint(s)", "n=int(input())\ncount=0\nwhile n > 0:\n if n >= 5:\n n -= 5\n count += 1\n elif n >= 4:\n n -= 4\n count += 1\n elif n >= 3:\n n -= 3\n count += 1\n elif n >= 2:\n n -= 2\n count += 1\n else:\n n -= 1\n count += 1\nprint(count)\n \t \t\t\t \t\t \t \t\t \t \t \t\t \t \t\t", "n = int(input())\r\nprint((n // 5 + 1) if n % 5 else n // 5)\r\n", "a = int(input())\r\nm = a//5\r\nif a % 5 > 0:\r\n m += 1\r\nprint(m)", "x = int(input())\r\ns = (x + 4) // 5\r\nprint(s)\r\n", "dist = int(input())\r\n\r\nminSteps = (dist//5) + (1 if dist % 5 != 0 else 0)\r\n\r\nprint(minSteps)", "a = int(input())\r\n# a, b, c = map(int, input().split()\r\nres = a//5\r\nif a % 5 != 0:\r\n res+=1\r\nprint (res)", "import math\nn=int(input())\nprint(math.ceil(n/5))#pojjaaaaaaaa\n\t \t \t \t \t \t\t\t \t\t\t", "n = int(input())\r\np=5\r\nsum = 0\r\nwhile(n>0):\r\n k = int(n/p)\r\n n = n%p\r\n sum += k\r\n p -= 1\r\nprint(sum)", "import math\r\nn = int(input())\r\nprint(math.ceil(n/5))", "a = int(input())\r\nimport math\r\nc = math.ceil(a/5)\r\nprint(c)", "x = int(input())\r\ne = 0\r\ns = 0\r\nc = 0\r\n\r\nwhile c == 0:\r\n if x >= 0:\r\n s += 1\r\n x -= 5\r\n if x <= 0:\r\n c += 1\r\n \r\nprint(s)", "h = int(input(\" \"))\r\n\r\nno_of_steps = 0\r\n\r\nwhile 1 > 0:\r\n if h <= 5:\r\n no_of_steps += 1\r\n break\r\n else:\r\n no_of_steps += 1\r\n h = h - 5\r\n\r\nprint(no_of_steps)", "n = int(input())\r\nno_steps = 0\r\nwhile n > 0:\r\n if n>= 5:\r\n no_steps += 1\r\n elif n >= 4:\r\n no_steps += 1\r\n elif n >= 3:\r\n no_steps += 1\r\n elif n >= 2:\r\n no_steps += 1\r\n elif n >= 1:\r\n no_steps += 1\r\n\r\n n -= 5\r\nprint(no_steps)\r\n", "a = int(input())\r\nsteps = 0\r\nwhile True:\r\n if a >5:\r\n a = a-5\r\n steps+=1\r\n else:\r\n steps+=1\r\n break\r\n\r\nprint(steps)", "from math import ceil\r\n\r\nx = int(input())\r\nprint(ceil((x/5)))", "n = int(input())\r\ns1 = n // 5\r\ns2 = n % 5 // 4\r\ns3 = n % 5 % 4 // 3\r\ns4 = n % 5 % 4 % 3 // 2\r\ns5 = n % 5 % 4 % 3 % 2 // 1\r\nprint(s1 + s2 + s3 + s4 + s5)", "import math\r\nstep = int(input())\r\nans = math.ceil(step/5)\r\nprint(ans)", "s = int(input())\r\n\r\nc = 0\r\n\r\nwhile True:\r\n\r\n\r\n if s >= 5:\r\n\r\n c += 1\r\n s -= 5\r\n\r\n elif s == 0: break\r\n\r\n else:\r\n\r\n c += 1\r\n break\r\n\r\nprint(c)", "x=int(input())\r\nif x<=5:\r\n print(1)\r\nelse:\r\n if x%5==0:\r\n print(x//5)\r\n if x%5!=0:\r\n print((x//5)+1)", "a=int(input())\r\nif a%5==0:\r\n z=a//5\r\n print(z)\r\nelse:\r\n z=a/5\r\n k=int(z)+1\r\n print(k)\r\n", "n = int(input())\r\n\r\ntotal_steps = 0\r\n\r\n\r\nwhile n >= 5:\r\n total_steps += n//5\r\n n %= 5\r\n\r\nif n > 0 :\r\n total_steps += 1\r\n\r\n \r\nprint(total_steps)\r\n \r\n \r\n \r\n \r\n ", "x = int(input()) # Input the coordinate of the friend's house\r\n\r\n# Calculate the minimum number of steps\r\nsteps = x // 5 # Divide x by 5\r\nif x % 5 != 0:\r\n steps += 1 # Add 1 if there is a remainder\r\n\r\nprint(steps) # Output the minimum number of steps\r\n", "coordinates = int(input())\r\ncount = 0\r\nif coordinates >= 5:\r\n count += coordinates//5\r\n coordinates = coordinates - 5*count\r\nif coordinates == 4:\r\n count += 1\r\n coordinates = coordinates - 4\r\nif coordinates == 3:\r\n count += 1\r\n coordinates = coordinates - 3\r\nif coordinates == 2:\r\n count += 1\r\n coordinates = coordinates - 2\r\nif coordinates == 1:\r\n count += 1\r\n coordinates = coordinates - 1\r\nprint(count)", "import math\r\n\r\nx = int(input())\r\ny = x / 5\r\nrounded_y = math.ceil(y)\r\nprint(rounded_y)", "distance = int(input())\n\nif distance//5 == distance/5:\n print(int(distance/5))\nif distance//5 != distance/5:\n print(int(distance//5 + 1))\n\n\n", "n = int(input())\r\na=n//5\r\nif n%5==0:\r\n print(a)\r\nelse:\r\n print(a+1)", "import math\nn=int(input())\nprint(math.ceil(n/5)) #print the number of steps\n\n\t\t \t\t \t\t\t \t\t\t\t\t\t \t \t\t \t \t\t", "from math import ceil\r\n\r\nfriend_house = int(input())\r\n\r\nprint(ceil(friend_house/5))\r\n", "k=int(input())\r\nprint((k+4)//5)", "x = int(input())\r\nr = x % 5\r\nsteps = x // 5\r\nif r == 0:\r\n print(steps)\r\nif 6 > r > 0:\r\n print(steps + 1)\r\n", "# Read the distance to the friend's house\r\nx = int(input().strip())\r\n\r\n# Calculate the number of 5-step moves\r\nsteps = x // 5\r\n\r\n# Check if there's any remaining distance\r\nif x % 5 != 0:\r\n steps += 1\r\n\r\n# Output the total number of steps\r\nprint(steps)\r\n", "dist=int(input())\r\nsteps=int(dist/5)\r\nif dist%5!=0:\r\n steps=steps+1\r\nprint(steps)", "import math\nn=int(input())\nprint(math.ceil(n/5))\n#aa\n\t \t \t \t \t\t\t\t \t\t \t\t\t\t\t\t\t \t\t \t \t", "import math\r\na=int(input())\r\ny=a/1\r\ny1=a/2\r\ny2=a/3\r\ny3=a/4\r\ny4=a/5\r\nl=[y,y1,y2,y3,y4]\r\nprint(math.ceil(min(l)))", "a=int(input())\ncount=0\nwhile a>=5:\n a=a-5\n count+=1\nwhile a>=4:\n a=a-4\n count+=1\nwhile a>=3:\n a=a-3\n count+=1\nwhile a>=2:\n a=a-2\n count+=1\nwhile a>=1:\n a=a-1\n count+=1\nprint(count)\n", "import math\r\nn=int(input())\r\nprint((math.ceil(n/5)))", "distance = int(input())\nc = 0\na = 5\nwhile distance != 0:\n\n while distance >= a:\n if a == 0:\n break\n elif distance >= a:\n distance -= a\n c += 1\n a -= 1\n if a <= 0:\n a = 1\n\nprint(c)", "x = int(input())\r\ncomplete_groups = x // 5\r\nif x % 5 != 0:\r\n steps_needed = complete_groups + 1\r\nelse:\r\n steps_needed = complete_groups\r\n\r\nprint(steps_needed)\r\n", "n = int(input())\r\n\r\nprint(n % 5 and n // 5 + 1 or n // 5)", "\r\nimport math\r\nn = int(input())\r\nprint(int(math.ceil(n/5)))", "x=int(input())\r\nb=x/5\r\nc=int(b)\r\nif b<1:\r\n print(\"1\")\r\nelif x%5==0:\r\n print(c)\r\n\r\nelse:\r\n print(c+1)", "n=int(input())\ncount=0\nwhile n!=0:\n if n >= 5:\n n-=5\n count+=1\n elif n >= 4:\n n-=4\n count+=1\n elif n >= 3:\n n-=3\n count+=1\n elif n >= 2:\n n-=2\n count+=1\n elif n>=1:\n n-=1\n count+=1\nprint(count)\n ", "x=int(input())\r\ns=0\r\nwhile(x>=5):\r\n x=x-5\r\n s+=1\r\nif(x>=1 and x<=4):\r\n s+=1\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n", "x = int(input())\r\nsteps = 0\r\nfor i in range(5, 0, -1):\r\n single = x // i\r\n x -= single * i\r\n steps += single\r\n if x == 0:\r\n break\r\nprint(steps)", "x= int(input())\r\n\r\nif x < 6:\r\n print(1)\r\nelse:\r\n if x%5 == 0:\r\n print((x//5))\r\n else:\r\n print((x//5)+1)", "a = int(input())\r\nn = 0\r\n\r\nwhile a > 0:\r\n if a >= 5:\r\n a -= 5\r\n n += 1\r\n\r\n elif a >= 4:\r\n a -= 4\r\n n += 1\r\n\r\n elif a >= 3:\r\n a -= 3\r\n n += 1\r\n\r\n elif a >= 2:\r\n a -= 2\r\n n += 1\r\n\r\n else:\r\n a -= 1\r\n n += 1\r\n\r\nprint(n)", "n=int(input())\r\nsum=n//5\r\nif n%5==0:\r\n print(sum)\r\nelse:\r\n print(sum+1)", "cor=int(input())\r\nsteps=0\r\nfor i in range(5,0,-1):\r\n steps+=(cor//i)\r\n cor=cor%i\r\nprint(steps)", "t=int(input())\ns=0\nfor i in range(5,0,-1):\n s=s+t//i\n t=t%i\n \nprint(s)\n\n \n", "step = int(input())\r\nif step % 5 != 0:\r\n print((step//5)+1)\r\nelse:\r\n print(step//5)", "# list(map(int,input().split()))\r\nimport math\r\n# for _ in range(int(input())):\r\nn=int(input())\r\nprint(math.ceil(n/5))", "print(int(int(input())/5+0.99))", "k = 0\r\na = int(input())\r\nfor i in range(a):\r\n if a - 5 >= 0:\r\n a -= 5\r\n k += 1\r\n elif a - 4 >= 0:\r\n a -= 4\r\n k += 1\r\n elif a - 3 >= 0:\r\n a -= 3\r\n k += 1\r\n elif a - 2 >= 0:\r\n a -= 2\r\n k += 1\r\n elif a - 1 >= 0:\r\n a -= 1\r\n k += 1\r\n elif a == 0:\r\n break\r\nprint(k)", "dis = int(input())\r\ncount = 0\r\nwhile dis!=0:\r\n if dis > 4:\r\n dis -= 5\r\n count += 1\r\n elif dis > 3:\r\n dis -= 4\r\n count += 1\r\n elif dis > 2:\r\n dis -= 3\r\n count += 1\r\n elif dis > 1:\r\n dis -= 2\r\n count += 1\r\n elif dis > 0:\r\n dis -= 1\r\n count += 1\r\nprint(count)\r\n", "import math\n\n# Leer la coordenada x\nx = int(input())\n\n# Calcular el número mínimo de pasos\nminimum_steps = math.ceil(x / 5)\n\n# Imprimir el resultado\nprint(minimum_steps)\n\n \t \t \t \t \t \t\t", "x=int(input())\r\nmin=(x+4)//5\r\nprint(min)", "import math\nx = int(input())\n\nmin = math.ceil(x / 5)\nprint(min)\n \t \t\t\t \t \t \t \t\t \t \t\t\t\t\t \t", "# Read the coordinate of the friend's house\r\nx = int(input())\r\n\r\n# Calculate the minimum number of steps needed\r\n# Each step is of length 5, so divide x by 5 and round up to the nearest integer\r\nmin_steps = (x + 4) // 5\r\n\r\n# Print the result\r\nprint(min_steps)\r\n", "import math\nn = int(input())\n\nprint(math.ceil(n / 5))\n", "import math\r\na = int(input())\r\nans=0;\r\nif a>=5 :\r\n ans+=(a/5);\r\n a=a%5;\r\nif a>=4 :\r\n ans+=(a/4);\r\n a=a%4;\r\nif a>=3 :\r\n ans+=(a/3);\r\n a=a%3;\r\nif a>=2 :\r\n ans+=(a/2);\r\n a=a%2;\r\nif a>=1 :\r\n ans+=(a/1);\r\n a=a%1;\r\nprint(int(ans))", "import math\ns=int(input())\nprint(math.ceil(s/5))\n\n\t \t\t \t\t \t \t \t\t \t \t\t \t", "l=[1,2,3,4,5]\r\nx=int(input())\r\nc=0\r\ni=len(l)-1\r\nwhile x>0:\r\n if x>=l[i]:\r\n x-=l[i]\r\n c+=1\r\n else:\r\n i=i-1\r\nprint(c)", "n = int(input())\r\nif (n/5) == (n//5):\r\n print(n//5)\r\nelse:\r\n print(n//5 + 1)", "co = int(input())\r\ncounter =0\r\ncounter = int(co/5)\r\nco = co - (5*counter)\r\nif co==5 or co == 4 or co==3 or co==2 or co==1:\r\n counter +=1\r\nprint(counter) \r\n", "def min_steps_to_friend(x):\n # Elephant can move 5 positions at a time\n steps = (x + 4) // 5\n return steps\n\n# Input\nx = int(input())\n\n# Calculate and print the minimum number of steps\nmin_steps = min_steps_to_friend(x)\nprint(min_steps)\n\n\t\t\t \t \t \t \t\t\t \t \t \t \t \t\t", "n = int(input())\r\n\r\nsteps = (n + 4) // 5\r\n\r\nprint(steps)", "n=int(input())\r\nc=int(n/5)\r\nr=int(n%5)\r\nif(r>0):\r\n c+=1\r\nprint(c) ", "the_friend_home_location = int(input())\r\nelephant_location = 0\r\nnumber_of_steps = 0\r\nwhile the_friend_home_location > elephant_location :\r\n elephant_location += 5\r\n number_of_steps += 1\r\nprint(number_of_steps)\r\n\r\n \r\n", "import math\nx = int(input())\nsteps = math.ceil(x / 5)\nprint(steps)\n\n \t\t \t\t\t \t \t\t \t\t\t\t\t\t\t \t\t", "from math import ceil\r\n\r\nx = int(input())\r\ny = ceil(x / 5)\r\n\r\nprint(y)\r\n\r\n", "steps = 0\r\nfhouse = int(input())\r\n\r\nwhile fhouse >= 5:\r\n steps = steps + 1\r\n fhouse = fhouse - 5\r\n\r\nif fhouse <= 5 and fhouse != 0:\r\n steps = steps + 1\r\n\r\nprint(steps)", "t=int(input())\r\nif t%5==0:\r\n steps=t//5\r\nelse:\r\n steps=(t//5)+1\r\nprint(steps)", "distance = int(input())\r\ncounter = 0\r\n\r\n# While the distance is not 0\r\nwhile distance != 0:\r\n # Check if the available number of steps can be taken\r\n if distance > 4:\r\n distance -= 5\r\n counter += 1\r\n elif distance > 3:\r\n distance -= 4\r\n counter += 1\r\n elif distance > 2:\r\n distance -= 3\r\n counter += 1\r\n elif distance > 1:\r\n distance -= 2\r\n counter += 1\r\n elif distance > 0:\r\n distance -= 1\r\n counter += 1\r\n\r\nprint(counter)", "n=int(input())\r\nresult=n//5\r\nremainder=n%5\r\nif(remainder>0):\r\n result+=1\r\nprint(result)", "x = int(input())\r\nif x%5 == 0:\r\n ans = x//5\r\nelse:\r\n ans = x//5 + 1\r\nprint(ans)", "n = int(input())\r\nx = n//5\r\nn %= 5\r\nx += n//4\r\nn %= 4\r\nx += n//3\r\nn %= 3\r\nx += n//2\r\nn %= 2\r\nx += n\r\nprint(x)", "x = int(input())\r\nif x <= 5:\r\n print(1)\r\nelse:\r\n count = 0\r\n count += x//5\r\n r = x%5\r\n if r != 0:\r\n count += 1\r\n print(count)", "a = int(input())\r\nc = 0\r\ncc = 0\r\nwhile c < a:\r\n c += 5\r\n cc += 1\r\nprint(cc)", "x=int(input())\r\nif x<5:\r\n print(1)\r\nelse:\r\n if x%5==0:\r\n print(x//5)\r\n else:\r\n print(x//5+1)", "import math\r\ndef min_soli_lidz_draugam(x):\r\n return math.ceil(x / 5)\r\n# Ievades lasisana\r\nx = int(input())\r\n# Izvade\r\nprint(min_soli_lidz_draugam(x))", "import math\nn=int(input())\nprint(math.ceil(n/5)) #print number of steps\n\n \t\t\t \t \t\t\t\t\t\t \t\t\t \t\t\t \t", "# Решение задач проекта CODEFORSES, Задача 617A\r\n#\r\n# (C) 2021 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. Слоник\r\nограничение по времени на тест1 секунда\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nСлоник решил сходить в гости к другу. Оказалось, что дом слоника находится в точке 0,\r\nа дом его друга в точке x(x > 0) координатной прямой. За один шаг слоник может переместиться на 1, 2, 3, 4 или 5 позиций вперёд. Помогите ему определить, за какое минимальное количество шагов он может добраться до дома друга.\r\n\r\nВходные данные\r\nВ первой строке входных данных записано одно целое число x (1 ≤ x ≤ 1 000 000) — координата дома друга слоника.\r\n\r\nВыходные данные\r\nВыведите минимальное количество шагов, которые необходимо сделать слонику, чтобы попасть из точки 0 в точку x.\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\nz=int(input())\r\nANS = z // 5\r\n#print(ANS)\r\n#print(z % 5)\r\nif z % 5 != 0:\r\n ANS=ANS+1\r\nprint(ANS)\r\n#print(ANS,' TIME:',datetime.now() - start_time) ", "import math\nn=int(input())\nprint(math.ceil(n/5)) #prints the place\n\n \t\t \t \t\t\t\t \t \t \t\t \t \t \t\t\t", "\r\nx = int(input())\r\n\r\nsteps = (x + 4) // 5\r\n\r\nprint(steps)\r\n", "x=int(input())\r\nans=s=0\r\nwhile s<x:\r\n s+=5\r\n ans+=1\r\nprint(ans)", "import math\nn=int(input())\nprint(math.ceil(n/5))#sammu\n\t \t\t \t \t\t\t\t\t\t \t \t\t \t\t\t\t\t\t", "import math\nn=int(input())\nprint(math.ceil(n/5)) \n#000000\n \t\t\t\t \t\t\t\t\t\t\t \t\t\t \t \t \t\t \t", "n = int(input())\r\nans = n//5\r\nif n%5!=0:\r\n print(ans+1)\r\nelse:\r\n print(ans)\r\n\r\n", "num = int(input())\r\ncount = 0\r\nwhile num != 0:\r\n if num - 5 >= 0:\r\n num -= 5\r\n count = count + 1\r\n elif num - 4 >= 0:\r\n num -= 4\r\n count = count + 1\r\n elif num - 3 >= 0:\r\n num -= 3\r\n count = count + 1\r\n elif num - 2 >= 0:\r\n num -= 2\r\n count = count + 1\r\n else:\r\n num -= 1\r\n count = count + 1\r\n\r\nprint(count)", "import math\r\nn = int(input())\r\nstep = math.ceil(n/5)\r\nprint(step)", "x = int(input())\r\nn5 = int(x/5)\r\nx = x % 5;\r\nn4 = int(x/4)\r\nx = x % 4;\r\nn3 = int(x/3)\r\nx = x % 3;\r\nn2 = int(x/2)\r\nx = x % 2;\r\nprint(n5+n4+n3+n2+x)", "distance = int(input())\r\nif distance % 5 == 0:\r\n print(int(distance/5))\r\nelse:\r\n print(int((distance/5) + 1))\r\n", "loc = int(input())\r\nsteps = 0\r\nfor i in reversed(range(1, 6)):\r\n x = loc // i\r\n steps += x\r\n loc -= x*i\r\n \r\nprint(steps)", "target = int(input())\r\n\r\nif target % 5 == 0:\r\n print(target // 5)\r\nelse:\r\n print(target // 5 + 1)", "import math\r\n\r\nx=int(input())\r\ny=int(5)\r\n\r\nz=x/5\r\na=math.ceil(z)\r\n\r\nprint(a)", "loc=int(input())\r\nprint(loc//5+int(bool(loc%5)))", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[3]:\n\n\nhouse = int(input())\nmoves = 0\nif house in range(5):\n moves = 1\nelse:\n if house%5==0:\n moves = int(house/5)\n else:\n moves = int(house/5) + 1\nprint(moves)\n \n \n \n\n\n# In[ ]:\n\n\n\n\n", "n = int(input())\r\n\r\nc = 0\r\nwhile n > 0:\r\n for i in range(5,0,-1):\r\n if n >= i:\r\n n -= i\r\n c += 1\r\n break\r\n \r\nprint(c) ", "n = int(input())\r\nif n % 5 : print(n // 5 + 1)\r\nelse : print(n // 5)", "x = int(input())\r\ns = x // 5 + (1 if x % 5 != 0 else 0)\r\nprint(s)", "from math import ceil\r\nN = int(input())\r\nprint(ceil(N/5))", "import math\nn=int(input())#55\nprint(math.ceil(n/5)) \n \t\t \t \t \t\t\t \t\t\t\t \t \t\t\t\t \t\t", "def solve(n):\n if n%5 == 0:\n print(n//5)\n else:\n print(n//5+1)\n\ndef main():\n n = int(input())\n solve(n)\n\nmain()", "import math\r\nx=int(input())\r\nif 1<=x<=1000000:\r\n steps=math.ceil(x/5)\r\n print(steps)\r\n ", "x = int(input())\r\nres = 0\r\nres = x/5\r\nif x%5 != 0:\r\n res += 1\r\n\r\nprint(int(res))", "x = int(input())\r\n\r\nprint(x // 5 + int(x % 5 != 0))\r\n", "l=[5,4,3,2,1]\r\nx=int(input())\r\nc=0\r\nfor i in l:\r\n if(x%i==0):\r\n c=c+x//i\r\n break\r\n else:\r\n c=c+x//i\r\n x=x%i\r\nprint(c)", "steps = int(input())\n\nif(steps%5 != 0):\n print(steps//5 + 1)\nelse:\n print(steps//5)\n\n\t \t\t \t\t \t \t \t \t \t \t \t", "import math\nn=int(input())\nprint(math.ceil(n/5)) #5\n#ASDF\n\t\t\t\t \t\t \t\t \t \t \t\t\t\t\t\t\t \t\t\t \t", "x = int(input()) # Read the coordinate of the friend's house\n\n# Calculate the minimum number of steps needed\nsteps = (x + 4) // 5 # Equivalent to ceil(x / 5)\n\nprint(steps) # Print the minimum number of steps\n\n\t \t\t \t\t \t \t\t\t \t\t \t\t", "n = int(input())\r\na = [5, 4, 3, 2, 1]\r\nans = 0\r\nfor i in range(5):\r\n ans += n // a[i]\r\n n = n % a[i]\r\nprint(ans)\r\n\r\n", "def main():\r\n n = int(input())\r\n den = [5, 4, 3, 2, 1]\r\n count = 0\r\n for d in den:\r\n if (n == 0): break\r\n count += int(n / d)\r\n n = n % d\r\n \r\n print(count)\r\nmain()", "x = int(input()) # Input: the coordinate of the friends house\r\n\r\n# calculate the number of steps of lenght 5\r\nsteps_of_5 = x // 5\r\n\r\n# calculate the remaining distance\r\nremaining_distance = x % 5\r\n\r\n# calculate the total number of steps\r\ntotal_steps = steps_of_5 + (1 if remaining_distance > 0 else 0)\r\n\r\n# output the minimum number of steps\r\nprint(total_steps)", "import math\r\nimport bisect\r\na=int(input())\r\nt=5\r\nsum=0\r\nwhile(t):\r\n sum+=a//t\r\n a=a%t\r\n t-=1\r\nprint(sum)", "distance = int(input())\r\nif distance <1:\r\n print('Error')\r\nelse:\r\n steps = distance // 5\r\n if distance%5 == 0:\r\n print(steps)\r\n else:\r\n print(steps+1)", "n = int(input())\r\nprint(int((n+4)/5))\r\n", "x = int(input())\r\nskaits = x // 5 + int((x % 5) / 5 + 4 / 5)\r\nprint(skaits)", "import math\r\nx = int(input())\r\ny = 0;\r\n\r\nif x >= 1:\r\n y = math.ceil(x/5)\r\n\r\n\r\nprint(y)\r\n", "friend = int(input())\nmoves = friend // 5\nif (friend % 5) == 0:\n final = moves\nelse:\n final = moves + 1\nprint(final)\n\n\t\t\t\t\t\t\t \t\t \t\t\t \t \t\t \t\t \t\t", "n = int(input())\r\n\r\ntotal = 0\r\n\r\nfor i in range(1,6):\r\n if n >= 6-i:\r\n x = n // (6-i)\r\n total += x\r\n n = n - (x*(6-i))\r\n if n == 0:\r\n print(total)", "n=int(input())\r\ncopy=n\r\nstep=0\r\nwhile(copy>5):\r\n step=step+1\r\n copy=copy-5\r\nprint(step+1)", "import math #Start the Program\nn=int(input()) #Take input \nprint(math.ceil(n/5))\n\t \t \t \t \t\t\t\t\t\t\t \t \t\t\t\t\t", "x = int(input())\ny = (x + 5 - 1) / (5)\nprint(int(y))\n", "arr = [5, 4, 3, 2, 1]\r\ncounter = 0\r\na = int(input())\r\n\r\nfor x in arr:\r\n while a >= x:\r\n a = a - x\r\n counter = counter + 1\r\n\r\nprint(counter)", "x = int(input())\r\n\r\nsteps = 1\r\nwhile True:\r\n\tx -= 5\r\n\tif x <= 0:\r\n\t\tbreak\r\n\tsteps += 1\r\nprint(steps)", "e=int(input())\r\np=0\r\nif e%5==0:\r\n p=e//5\r\nelse:\r\n p=(e//5)+1\r\n\r\nprint(p)\r\n " ]

[ "\"\"\"\nhttp://codeforces.com/problemset/problem/1004/C\n\"\"\"\ninput()\narr = map(int, input().split())\nhash_ = {}\ncnt = 0\nfor x in arr:\n if x not in hash_:\n cnt += len(hash_)\n hash_[x] = len(hash_)\n else:\n cnt += len(hash_) - hash_[x]\n hash_[x] += len(hash_) - hash_[x]\nprint(cnt)\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 n = int(input())\r\n a = list(map(int, input().strip().split()))\r\n MAX = 2**19\r\n\r\n fen = [0] * (MAX + 1)\r\n vis = [False] * (MAX + 1)\r\n dl = [n] * (MAX + 1)\r\n dr = [n] * (MAX + 1)\r\n for i in range(n):\r\n dl[a[i]] = min(dl[a[i]], i)\r\n for i in range(n - 1, -1, -1):\r\n dr[a[i]] = min(dr[a[i]], n - 1 - i)\r\n \r\n def inc(p, val):\r\n p += 1\r\n while p <= MAX:\r\n fen[p] += val\r\n p += (p&(-p))\r\n\r\n def query(p):\r\n p += 1\r\n res = 0\r\n while p > 0:\r\n res += fen[p]\r\n p -= (p&(-p))\r\n return res\r\n \r\n for i in range(n - 1):\r\n val = dl[a[i]]\r\n if not vis[val]:\r\n inc(val, 1)\r\n vis[val] = True\r\n\r\n ans = 0\r\n vis = [False] * (MAX + 1)\r\n for i in range(n - 1, 0, -1):\r\n if not vis[a[i]]:\r\n q = max(0, n - 2 - dr[a[i]])\r\n ans += query(q)\r\n vis[a[i]] = True \r\n print(ans)\r\n \r\nsolver()", "\r\n\r\ndef main():\r\n\tn = int(input())\r\n\ta = tuple(map(int, input().split()))\r\n\tseen = set()\r\n\tcount = 0\r\n\tdistinct = [0]\r\n\tfor x in reversed(a):\r\n\t\tif x in seen:\r\n\t\t\tdistinct.append(distinct[-1])\r\n\t\t\tcontinue\r\n\t\tseen.add(x)\r\n\t\tdistinct.append(distinct[-1]+1)\r\n\tdistinct.pop()\r\n\tseen.clear()\r\n\t#print(tuple(reversed(distinct)))\r\n\tfor x, distinct_right in zip(a, reversed(distinct)):\r\n\t\t#print(x, distinct_right)\r\n\t\tif x in seen:\r\n\t\t\tcontinue\r\n\t\tseen.add(x)\r\n\t\tcount += distinct_right\r\n\r\n\tprint(count)\r\nmain()", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\n\r\nvis = set()\r\ndp = [0] * (n + 1)\r\nfor i in reversed(range(n)):\r\n vis.add(a[i])\r\n dp[i] = len(vis)\r\n\r\nvis.clear()\r\n\r\nfor i, x in enumerate(a):\r\n if x in vis:\r\n continue\r\n vis.add(x)\r\n ans += dp[i+1]\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nd1={-1}\r\ns=set(l)\r\nk=0\r\nfor x in l :\r\n d[x]=d.get(x,0)+1\r\nfor x in l :\r\n if x not in d1 :\r\n if d[x]==1 :\r\n s.remove(x)\r\n k+=len(s)\r\n d1.add(x)\r\n d[x]-=1\r\n else :\r\n d[x]-=1\r\n if d[x]==0 :\r\n s.remove(x)\r\n \r\n \r\n \r\nprint(k)\r\n \r\n \r\n", "n = int(input())\n\narr = [int(x) for x in input().split()]\n\nnum___fl = {}\nnum___fr = {}\n\nfor i, num in enumerate(arr):\n if num not in num___fl:\n num___fl[num] = i\n if num not in num___fr:\n num___fr[num] = i\n elif num___fr[num] < i:\n num___fr[num] = i\n\nfls_asc = list(sorted(num___fl.values()))\nfrs_asc = list(sorted(num___fr.values()))\n\n# il = 0\nir = 0\n\nans = 0\nfor il, fl in enumerate(fls_asc):\n while True:\n if ir >= len(frs_asc):\n break\n # if frs_asc[ir] <= fl:\n # break\n if frs_asc[ir] > fl:\n break\n ir += 1\n ans += len(frs_asc) - ir\n\nprint(ans)\n", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef Solution(arr, n):\r\n # Write Your Code Here\r\n prefixUniqEls = [0 for _ in range(n+1)]\r\n hm = {}\r\n for i in range(n-1, -1, -1):\r\n if not arr[i] in hm:\r\n prefixUniqEls[i] = prefixUniqEls[i+1]+1\r\n hm[arr[i]] = 1\r\n else:\r\n prefixUniqEls[i] = prefixUniqEls[i+1]\r\n\r\n used = {}\r\n ans = 0\r\n # print(prefixUniqEls)\r\n for i in range(n-1):\r\n v = arr[i]\r\n if not v in used:\r\n used[v] = 1\r\n cnt = prefixUniqEls[i+1]\r\n ans += cnt\r\n print(ans)\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n n = get_int()\r\n arr = get_ints_in_list()\r\n Solution(arr, n)\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\na = [int(i) for i in input().split()]\n\nd = {}\ns = set()\n\nfor i in a:\n if d.get(i):\n d[i] += 1\n else:\n d[i] = 1\n\nans = 0\nfor i in a:\n d[i] -= 1\n if d[i] == 0:\n d.pop(i)\n if i not in s:\n ans += len(d.keys())\n s.add(i)\n\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nd={}\r\nfor i in arr:\r\n d[i]=d.get(i,0)+1\r\nans=0;s=set()\r\nfor i in arr:\r\n d[i]=d.get(i,0)-1\r\n if d[i]==0:del d[i]\r\n if i not in s:\r\n ans+=len(d)\r\n s.add(i)\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\n\r\nif(n == 1):\r\n\tprint(0)\r\n\texit()\r\n\r\na.reverse()\r\nz = []\r\ns = set()\r\ns.add(a[0])\r\nb = {a[0]:0}\r\n\r\nfor i in range(1, n):\r\n\tif a[i] in s:\r\n\t\tb[a[i]] = len(s)\r\n\telse:\r\n\t\tb.update({a[i]:len(s)})\r\n\t\ts.add(a[i])\r\n\r\nans = 0\r\n\r\nfor i in b.keys():\r\n\tans += b[i]\r\n\t\r\nprint(ans)\r\n\r\n", "n = int(input())\r\nA = [int(x) for x in input().split()]\r\ncount = 0\r\nfreq = [0] * ((10**5) + 1)\r\npresent = [-1] * ((10**5) + 1)\r\nuniq = []\r\nval = 0\r\nfor i in range(len(A)):\r\n uniq.append(val)\r\n n -= 1\r\n if(freq[A[i]] == 0):\r\n val += 1\r\n count += n\r\n else:\r\n count -= uniq[present[A[i]]]\r\n present[A[i]] = i\r\n freq[A[i]] += 1\r\nprint(count)", "readints=lambda:map(int, input().strip('\\n').split())\nn=int(input())\nnums=list(readints())\ncnt=[0]*n\nused={} # elem to left-most index\ni=n-1\nwhile i>=0:\n\tx=nums[i]\n\tcnt[i]=len(used)-(used[x] if x in used else 0)\n\tif x not in used: used[x]=0\n\tused[x]+=cnt[i]\n\ti-=1\n\t\nprint(sum(cnt))\n", "input()\r\nc = [0] * 100001\r\ns = set()\r\nfor x in map(int, input().split(' ')):\r\n c[x] = len(s)\r\n s.add(x)\r\nprint(sum(c))\r\n", "n=int(input())\r\nlst=[*map(int,input().split())]\r\na,d,length=[],{},0\r\nfor i,x in enumerate(lst):\r\n if d.get(x)==None:a.append(i);d[x]=i;length+=1\r\n else:d[x]=i\r\nb=list(d.values())\r\nb.sort()\r\nres=0\r\nfrom bisect import bisect\r\nfor i,x in enumerate(a):\r\n item=bisect(b,x)\r\n res+=length-item\r\nprint(res)", "input()\nc=[0]*100001\ns=set()\nfor x in map(int,input().split()):\n c[x]=len(s);s.add(x)\nprint(sum(c))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nst = set(a)\r\ntot = len(st)\r\n\r\nfreq = [0 for _ in range(100005)]\r\nused = [0 for _ in range(100005)]\r\n\r\nfor x in a:\r\n freq[x] += 1\r\n\r\nres = sum(freq[x] > 1 for x in st)\r\n\r\nfor x in a:\r\n freq[x] -= 1\r\n if freq[x] == 0:\r\n tot -= 1\r\n if used[x] == 0:\r\n res += tot - (freq[x] > 0)\r\n used[x] = 1\r\n\r\nprint(res)", "def readList(converter = int):\r\n return [converter(x) for x in input().strip().split()]\r\n\r\nn, = readList()\r\nl = readList()\r\nuniq = set()\r\nuniqRight = [0 for _ in range(n)]\r\nuniqRight[len(uniqRight) - 1] = 0\r\nfor i in reversed(range(n-1)):\r\n uniqRight[i] = uniqRight[i+1] + (1 if l[i+1] not in uniq else 0)\r\n uniq.add(l[i+1])\r\n\r\ncounts = 0\r\nuniq = set()\r\nfor i in range(n):\r\n if l[i] not in uniq:\r\n counts += uniqRight[i]\r\n uniq.add(l[i])\r\nprint(counts)", "n = int(input())\r\ninp = list(map(lambda x:int(x), input().split(\" \")))\r\ncount = 0\r\nset1 = {inp[0]}\r\narr = [1]\r\nfor i in range(1, n):\r\n\tif inp[i] not in set1:\r\n\t\tarr.append(arr[-1]+1)\r\n\t\tset1.add(inp[i])\r\n\telse:\r\n\t\tarr.append(arr[-1])\r\nset2 = {inp[n-1]}\r\narr1 = [arr[n-2]]\r\nfor i in range(n-2, 0, -1):\r\n\tif inp[i] not in set2:\r\n\t\tarr1.append(arr[i-1])\r\n\t\tset2.add(inp[i])\r\n\r\nif n!= 1:\r\n\tprint(sum(arr1))\r\nelse:\r\n\tprint(0)", "n=int(input())\narr=list(map(int,input().split()))\ndic={}\ndic2={}\nansar=[]\nfor i in range(n):\n\tdic[arr[i]]=0\n\tdic2[arr[i]]=0\n\tansar.append(0)\ncount=0\nfor i in range(n-1,0,-1):\n\tif dic[arr[i]]==0:\n\t\tcount+=1\n\t\t\n\t\tdic[arr[i]]=1\n\tansar[i-1]=count\t\n#print(ansar)\nanswer=0\nfor i in range(n-1):\n\tif dic2[arr[i]]==0:\n\t\tanswer+=ansar[i]\n\t\tdic2[arr[i]]=1\nprint(answer)\t", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nlefts = set()\r\nrights = set()\r\nuniques = [0 for _ in range(n)]\r\nfor i in range(-1, -n-1, -1):\r\n uniques[i] = uniques[i+1]\r\n if not numbers[i] in rights:\r\n uniques[i] += 1\r\n rights.add(numbers[i])\r\npairs_count = 0\r\nfor i in range(n-1):\r\n if not numbers[i] in lefts:\r\n pairs_count += uniques[i+1]\r\n lefts.add(numbers[i])\r\nprint(pairs_count)\r\n", "# -*- coding: utf-8 -*-\r\nimport math\r\n\r\ndef problem(in1, in2):\r\n n = int(in1)\r\n numbers = list(map(int, in2.split()))\r\n \r\n robo1 = []\r\n \r\n set1 = set()\r\n for num in numbers:\r\n robo1.append(num not in set1)\r\n set1.add(num)\r\n \r\n# print(robo1)\r\n \r\n set2 = set()\r\n robo2 = []\r\n count = 0\r\n for num in numbers[::-1]:\r\n if (num not in set2):\r\n count += 1\r\n set2.add(num)\r\n robo2.append(count)\r\n \r\n robo2.reverse()\r\n robo2.append(0)\r\n# print(robo2)\r\n\r\n result = 0;\r\n \r\n for i, unique in enumerate(robo1):\r\n if unique:\r\n result += robo2[i + 1]\r\n \r\n return result;\r\n\r\nif __name__ == '__main__':\r\n in1 = input()\r\n in2 = input()\r\n \r\n result = problem(in1, in2)\r\n\r\n print(result)\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\n\ndef f(l):\n r = {}\n for i, v in enumerate(l): r[v] = i\n return r\n\nr, l = f(a), {v: len(a) - i - 1 for v, i in f(reversed(a)).items()}\nlc = [0] * n\nfor i in l.values(): lc[i] += 1\nfor i in range(1, n): lc[i] += lc[i - 1]\nprint(sum((lc[i - 1] if i >= 1 else 0) for i in r.values()))\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\ncame = [False]*(10**5+1)\r\nright = [-1]*(10**5+1)\r\nunique = []\r\nduplet = set()\r\nans = 0\r\nfor i,item in enumerate(lst):\r\n if came[item]:\r\n duplet.add(item)\r\n ans += unique[-1]-unique[right[item]]\r\n unique.append(unique[-1])\r\n else:\r\n try:\r\n ans += unique[-1]\r\n unique.append(unique[-1]+1)\r\n except:\r\n ans = 0\r\n unique = [1]\r\n came[item] = True\r\n right[item] = i\r\nprint(ans+len(duplet))", "n=int(input()) \r\na=list(map(int,input().split())) \r\nd={} \r\ntemp=set()\r\ncount=0\r\nfor i in a:\r\n if not i in d:\r\n d[i]=0 \r\n count+=1 \r\n \r\n d[i]+=1 \r\nans=0\r\nfor i in a:\r\n d[i]-=1 \r\n if d[i]==0:\r\n count-=1 \r\n if not i in temp:\r\n ans+=count \r\n temp.add(i)\r\nprint(ans)", "n = int(input())\na = [int(i) for i in input().split()]\nd = {}\nfor i in a:\n\td[i] = True\ncount = 0\nb = [0] * (n - 1)\nfor i in reversed(range(1, n)):\n\tif d[a[i]]:\n\t\td[a[i]] = False\n\t\tcount += 1\n\tb[i - 1] = count\n\t\nd = {}\nfor i in a:\n\td[i] = True\nans = 0\nfor i in range(n - 1):\n\tif d[a[i]]:\n\t\td[a[i]] = False\n\t\tans += b[i]\n\t\nprint(ans)\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\nfrom bisect import *\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nld = defaultdict(int)\r\n\r\nfor i in range(n):\r\n if a[i] not in ld:\r\n ld[a[i]] = i\r\n\r\nrd = defaultdict(int)\r\n\r\nfor i in range(n-1, -1, -1):\r\n if a[i] not in rd:\r\n rd[a[i]] = i\r\n\r\nl = list(rd.values())\r\nl.reverse()\r\nans = 0\r\n\r\nfor ai in ld.keys():\r\n ans += len(rd)-bisect_right(l, ld[ai])\r\n\r\nprint(ans)", "\"\"\"\nhttp://codeforces.com/problemset/problem/1004/C\n\nFinding all unique pairs (a, b) in a sequence which a came earlier in linear time with hashing\n\nNote that hash_ stores a key of a single integer and value of number of unique pairs now we can build with that key as b in such pair (a, b)\n\"\"\"\ninput()\narr = map(int, input().split())\nhash_ = {}\ncnt = 0\nfor x in arr:\n if x not in hash_:\n cnt += len(hash_)\n else:\n cnt += len(hash_) - hash_[x]\n hash_[x] = len(hash_)\nprint(cnt)\n", "if __name__ == '__main__':\n n = int(input())\n nums = [int(i) for i in input().strip().split()]\n distinctRight = set()\n right = [0] * n\n for i in range(n - 1, -1, -1):\n right[i] = len(distinctRight)\n distinctRight.add(nums[i])\n assigned = set()\n ans = 0\n for i in range(n):\n if nums[i] not in assigned:\n ans += right[i]\n assigned.add(nums[i])\n print(ans)\n", "# import sys\r\n# sys.stdin=open('F:\\\\C\\\\Script\\\\input.txt','r')\r\n# sys.stdout=open('F:\\\\C\\\\Script\\\\output.txt','w')\r\n# sys.stdout.flush()\r\n\r\ndef I():\r\n\treturn [int(i) for i in input().split()]\r\n\r\nn = I()\r\nl = I()\r\nfrom collections import Counter as C\r\nc = C(l)\r\nc[l[0]] -= 1\r\ns = len(c)\r\nsum = s\r\n\r\nif c[l[0]] == 0:\r\n\ts -= 1\r\n\tsum = s\r\n\r\nse = set()\r\nse.add(l[0])\r\n\r\nfor i in l[1:]:\r\n\tc[i] -= 1\r\n\tif c[i] == 0:\r\n\t\ts -= 1\r\n\tif i in se:\r\n\t\t\r\n\t\tcontinue\r\n\tse.add(i)\r\n\r\n\tsum += s\r\n\r\n\t\r\nprint (sum)", "n = int(input())\r\n\r\nnums = input().split()\r\n\r\ndp = [-1]*n\r\ndp[-1] = 0\r\n\r\nunique = set()\r\nfor i in range(n-2,-1,-1):\r\n if nums[i+1] not in unique:\r\n unique.add(nums[i+1])\r\n dp[i] = len(unique)\r\n else:\r\n dp[i] = len(unique)\r\n\r\nout = 0\r\nstarted = set()\r\n\r\nfor i in range(n):\r\n if nums[i] not in started:\r\n out += dp[i]\r\n started.add(nums[i])\r\n\r\nprint(out)\r\n", "# @Chukamin ZZU_TRAIN\n\ndef main():\n n = int(input())\n data = list(map(int, input().split()))\n dp = [0 for i in range(100005)]\n vis = [0 for i in range(100005)]\n for i in range(1, n + 1):\n if vis[data[i - 1]] == 0:\n vis[data[i - 1]] = 1\n dp[i] = dp[i - 1] + 1\n else:\n dp[i] = dp[i - 1]\n times = 0\n vis = [0 for i in range(100005)]\n for i in range(n, 0, -1):\n if vis[data[i - 1]] == 0:\n vis[data[i - 1]] = 1\n times += dp[i - 1]\n print(times)\n\nif __name__ == '__main__':\n main()\n\n\t \t \t\t\t \t\t\t\t \t \t \t\t\t \t \t\t\t\t", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\na = sys.stdin.readline().split()\r\nrem = {}\r\nused = set()\r\n\r\nfor v in a:\r\n if v not in rem:\r\n rem[v] = 1\r\n else:\r\n rem[v] = rem[v] + 1\r\n \r\nans = 0\r\n \r\nfor v in a:\r\n rem[v] = rem[v] - 1\r\n \r\n if rem[v] == 0:\r\n del rem[v]\r\n \r\n if v in used:\r\n continue\r\n \r\n ans = ans + len(rem)\r\n used.add(v)\r\n\r\nprint(ans)\r\n", "from collections import defaultdict\r\ndef f(a):\r\n\tsuf=[None]*(len(a))\r\n\tst=defaultdict(int)\r\n\tres=0\r\n\tpp=defaultdict(int)\r\n\tfor i in range(len(a)-1,-1,-1):\r\n\t\tsuf[i]=res\r\n\t\tpp[a[i]]=max(res,pp[a[i]])\r\n\t\tif st[a[i]]+1<=1:\r\n\t\t\tres+=1\r\n\t\t\tst[a[i]]+=1\r\n\tans=0\r\n\tfor i in pp.values():\r\n\t\tans+=i\r\n\treturn ans\r\na=input()\r\nl=list(map(int,input().strip().split()))\r\nprint(f(l))", "n=int(input()) \r\na=list(map(int,input().split())) \r\n\r\ncnt=[0]*(10**5+4)\r\nl=0 \r\n\r\ndis=[]\r\nfor i in range(n-1):\r\n if cnt[a[i]]==0:\r\n cnt[a[i]]+=1\r\n l+=1\r\n \r\n dis.append(l)\r\ndone=[0]*(10**5+4)\r\nans=0\r\nfor i in range(n-1,0,-1):\r\n if done[a[i]]==0:\r\n ans+=dis[i-1]\r\n done[a[i]]+=1\r\nprint(ans)\r\n \r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A):\r\n #pairs x, y \r\n #such that first x < last y\r\n n = len(A)\r\n d = {}\r\n for i in range(n):\r\n ai = A[i]\r\n if ai not in d:\r\n d[ai] = [i, i]\r\n d[ai][1] = i\r\n m = len(d)\r\n L = []\r\n for x in d:\r\n f, l = d[x]\r\n L.append([f, 0])\r\n L.append([l, 1])\r\n L.sort()\r\n answer = 0\r\n last_count = 0\r\n for i in range(2*m):\r\n I, t = L[i]\r\n if t==0:\r\n answer+=(m-last_count)\r\n else:\r\n last_count+=1\r\n for x in d:\r\n if d[x][0]==d[x][1]:\r\n answer-=1\r\n return answer\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nvis = [0] * int(1e5+3)\r\ncnt = [0] * int(1e5+3)\r\nfor i in arr: \r\n vis[i] = 1\r\n cnt[i] += 1\r\nres, cnt_distinct = 0, sum(vis)\r\nfor i in arr:\r\n cnt_distinct -= (cnt[i] == 1)\r\n cnt[i] = max(0, cnt[i]-1)\r\n if vis[i] == 1:\r\n res += cnt_distinct\r\n vis[i] = 0\r\nprint(res)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmaxl=max(l)+1\r\ndp=[]\r\nfor i in range(maxl):\r\n dp.append([-1,-1])\r\nfor i in range(n):\r\n dp[l[i]][1]=i\r\nfor i in range(n-1,-1,-1):\r\n dp[l[i]][0]=i\r\nll=[]\r\nlr=[]\r\nfor i in range(n):\r\n ll.append(0)\r\n lr.append(0)\r\ncnt = 0\r\nfor i in range(maxl):\r\n if(dp[i][0]!=-1):\r\n ll[dp[i][0]]=1\r\n lr[dp[i][1]]=1\r\n cnt+=1\r\nans = 0\r\n\r\nfor i in range(n):\r\n if(lr[i]==1):\r\n cnt-=1\r\n if(ll[i]==1):\r\n ans+=cnt\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncount=0\r\nd1={}\r\nd2={}\r\nans=set()\r\nfor i in arr:\r\n if i in d2.keys():\r\n d2[i]+=1\r\n else:\r\n d2[i]=1\r\nfor i in range(0,n-1):\r\n if arr[i] in d1.keys():\r\n d1[arr[i]]+=1\r\n else:\r\n d1[arr[i]]=1\r\n d2[arr[i]]-=1\r\n if d2[arr[i]]==0:\r\n del d2[arr[i]] \r\n if arr[i] not in ans:\r\n count+=len(d2)\r\n ans.add(arr[i])\r\nprint(count)\r\n", "n=int(input())\r\nvar=0\r\nv=[False]*(10**5+1)\r\nls=list(map(int,input().split()))\r\narr=[0]*n\r\ncnt=0\r\nfor i in range(n-1,-1,-1):\r\n if v[ls[i]]==False:\r\n cnt+=1\r\n v[ls[i]]=True\r\n arr[i]=cnt\r\n#print(arr)\r\nv=[False]*(10**5+1)\r\nfor i in range(n-1):\r\n if v[ls[i]]==False:\r\n var+=arr[i+1]\r\n v[ls[i]]=True\r\n\r\nprint(var)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\ns = set()\r\nfor i in l:\r\n s.add(i)\r\n if i in d:\r\n d[i] = d[i]+1\r\n\r\n else:\r\n d[i] = 1\r\n\r\ncnt = 0\r\nvisited = set()\r\nfor i in l:\r\n if i in visited:\r\n d[i] = d[i] - 1\r\n if d[i] == 0:\r\n s.remove(i)\r\n\r\n continue\r\n\r\n else:\r\n d[i] = d[i] - 1\r\n visited.add(i)\r\n if d[i] == 0:\r\n s.remove(i)\r\n\r\n cnt = cnt + len(s)\r\n\r\nprint(cnt)", "from collections import defaultdict\n\nn = int(input())\nA = list(map(int, input().split()))\nd = defaultdict(int)\nfor x in A:\n d[x] += 1\ncount = 0\nskip = set()\nfor i in range(len(A) - 1):\n # print(d)\n d[A[i]] -= 1\n if d[A[i]] == 0:\n del d[A[i]]\n if A[i] in skip:\n continue\n # print(i, len(d))\n count += len(d)\n skip.add(A[i])\nprint(count)\n", "from bisect import*\nn=int(input())\nN=100001\nl=[N]*N\nr=[-1]*N\nfor i,x in enumerate(map(int,input().split())):\n l[x]=min(l[x],i);r[x]=max(r[x],i)\nl.sort()\nprint(sum(bisect_left(l,x)for x in r))", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = [0]*(n+1)\r\ns = set()\r\nans = 0\r\nhm = [0]*100010\r\nfor i in range(n-1,-1,-1):\r\n s.add(a[i])\r\n b[i] = len(s)\r\nfor i in range(n-1):\r\n if(not hm[a[i]]):\r\n hm[a[i]]+=1\r\n ans+=b[i+1]\r\nprint(ans)", "from bisect import*\nN=100001\ninput()\nl=[N]*N\nr=[0]*N\nfor i,x in enumerate(map(int,input().split())):\n l[x]=min(l[x],i);r[x]=i\nl.sort()\nprint(sum(bisect_left(l,x)for x in r))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = dict()\r\nw = list(map(int, input().split()))\r\n\r\nfor i in w:\r\n d[i] = len(d)\r\n\r\nprint(sum(d.values()))\r\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nfrom collections import Counter\n\nn = int(input())\na = list(map(int, input().split()))\nright_counts = Counter(a)\ncan_be_left = [1] * (10**5+1)\n\nres = 0\nfor num in a:\n if can_be_left[num]:\n right_counts[num] -= 1\n if not right_counts[num]:\n del right_counts[num]\n res += len(right_counts)\n can_be_left[num] = 0\n else:\n right_counts[num] -= 1\n if not right_counts[num]:\n del right_counts[num]\nprint(res)", "n = int(input())\r\nu = list(map(int, input().split()))\r\nans = 0\r\nuse = set()\r\ns = set()\r\nu_len = [0] * n\r\nfor i in range(n - 1, 0, -1):\r\n if u[i] not in s:\r\n s.add(u[i])\r\n u_len[i - 1] = u_len[i] + 1\r\n else:\r\n u_len[i - 1] = u_len[i]\r\nfor i in range(n):\r\n if u[i] not in use:\r\n use.add(u[i])\r\n ans += u_len[i]\r\nprint(ans)\r\n \r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nl = pow(10, 5) + 5\r\ncnt = [0] * l\r\nfor i in a:\r\n cnt[i] += 1\r\nc = 0\r\nfor i in cnt:\r\n c += min(i, 1)\r\nok = [0] * l\r\nans = 0\r\nfor i in a:\r\n cnt[i] -= 1\r\n if not cnt[i]:\r\n c -= 1\r\n if ok[i]:\r\n continue\r\n ans += c\r\n ok[i] = 1\r\nprint(ans)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nres_set = set()\r\ntmp_set = set()\r\nNumList = [0 for i in range(n)]\r\nfor i in range(n - 1, -1, -1):\r\n tmp_set.add(A[i])\r\n NumList[i] = len(tmp_set)\r\nans = 0\r\nfor i in range(n - 1):\r\n if not (A[i] in res_set):\r\n res_set.add(A[i])\r\n ans += NumList[i + 1]\r\n#print(NumList)\r\n#print(res_set)\r\nprint(ans)\r\n", "n = int(input())\na = input().split()\ncou = [0 for i in range(100005)]\nvis = [False for i in range(100005)]\nst = set()\nfor i in range(n):\n a[i] = int(a[i])\n cou[a[i]] += 1\n st.add(a[i])\nans = 0\nfor i in range(n):\n cou[a[i]] -= 1\n if cou[a[i]] == 0:\n st.remove(a[i])\n if vis[a[i]] == False:\n vis[a[i]] = True\n ans += len(st)\nprint(ans)", "from collections import defaultdict\nfrom bisect import bisect\n\nINF = 10**9\n\nn = int(input())\na = list(map(int, input().split()))\n\nfirst_pos = [INF] * (n+1)\nfor i, x in enumerate(a):\n if first_pos[x] == INF:\n first_pos[x] = i\n \nlast_pos = [-1] * (n+1)\nfor i, x in enumerate(a):\n last_pos[x] = i\nlast_pos.sort()\n\ntotal = 0\nfor i, first in enumerate(first_pos):\n total += len(last_pos) - bisect(last_pos, first)\nprint(total)\n", "# Link: http://codeforces.com/contest/1004/problem/C\n# py3\n\nfrom __future__ import print_function\nimport sys\nimport math\nimport os.path\nimport random\nfrom copy import deepcopy\nfrom functools import reduce\n\n\nfrom collections import Counter, ChainMap, defaultdict\nfrom itertools import cycle, chain\nfrom queue import Queue, PriorityQueue\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, nlargest, nsmallest\nimport bisect\n\nfrom statistics import mean, mode, median, median_low, median_high\n\n\n# CONFIG\nsys.setrecursionlimit(10**9)\n\n# LOG \ndef log(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\n# INPUT\ndef ni():\n return map(int, input().split())\n\n\ndef nio(offset):\n return map(lambda x: int(x) + offset, input().split())\n\n\ndef nia():\n return list(map(int, input().split()))\n\n\n# CONVERT\ndef toString(aList, sep=\" \"):\n return sep.join(str(x) for x in aList)\n\n\ndef toMapInvertIndex(aList):\n return {k: v for v, k in enumerate(aList)}\n\n\n# SORT\ndef sortId(arr):\n return sorted(range(arr), key=lambda k: arr[k])\n\n\n# MAIN\nn, = ni()\na = nia()\n\nl = set([])\nlc = [0]*n\n\nfor i in range(n):\n ax = a[i]\n if (i > 0):\n lc[i] = len(l)\n l.add(ax)\n\nr = set([])\ncount = 0\nfor i in range(n-1,-1,-1):\n ar = a[i]\n if ar not in r:\n count += lc[i]\n r.add(ar)\n\nprint(count)", "input()\r\ns=set()\r\nc=[0]*100006;\r\nfor x in map(int,input().split()):\r\n\tc[x]=len(s);\r\n\ts.add(x);\r\nprint(sum(c));\r\n", "import collections\r\n\r\nline = input().split()\r\nn = int(line[0])\r\n\r\na = [int(ai) for ai in input().split()]\r\n\r\nif n <= 1:\r\n print(0)\r\n exit()\r\n\r\nleft = {a[0]}\r\nright = collections.defaultdict(lambda: 0)\r\n\r\nfor ai in a[1:]:\r\n right[ai] = right[ai] + 1\r\n\r\n\r\nres = 0\r\n\r\nres += len(right)\r\nfor i in range(1, n):\r\n right[a[i]] -= 1\r\n if right[a[i]] == 0:\r\n del right[a[i]]\r\n\r\n if a[i] in left:\r\n continue\r\n else:\r\n left.add(a[i])\r\n res += len(right)\r\n\r\nprint(res)\r\n", "input()\r\nc = [0]*(100001)\r\ns = set()\r\nfor x in map(int,input().split(' ')):\r\n c[x] = len(s)\r\n s.add(x)\r\n\r\n\r\nprint(sum(c))\r\n", "from collections import defaultdict\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=defaultdict(int)\r\ndis=defaultdict(int)\r\ns=set()\r\ns.add(a[-1])\r\nc=1\r\ndis[n-1]=1\r\nfor i in range(n-2,-1,-1):\r\n d[a[i]]=i\r\n if a[i] not in s:\r\n c+=1\r\n s.add(a[i])\r\n dis[i]=c\r\n \r\nans=0\r\nfor i in d:\r\n ans+=dis[d[i]+1]\r\nprint(ans)", "n = int(input())\r\nd = {}\r\nfor i in input().split():\r\n d[i] = len(d)\r\nprint(sum(d.values()))", "n = int(input())\r\na = [int(j) for j in input().split()]\r\nk = [0] * n\r\nk[n - 1] = 1\r\ns = set()\r\ns.add(a[n - 1])\r\nfor i in range(n - 2, -1, -1):\r\n if a[i] not in s:\r\n k[i] = k[i + 1] + 1\r\n else:\r\n k[i] = k[i + 1]\r\n s.add(a[i])\r\n# k[n - 2] = 1\r\n# print(k)\r\ns = set()\r\nc = 0\r\nfor i in range(n - 1):\r\n if a[i] not in s:\r\n c += k[i + 1]\r\n s.add(a[i])\r\nprint(c)\r\n# d = {}\r\n# s = set()\r\n# for i in a:\r\n# if i not in d:\r\n# d[i] = 1\r\n# else:\r\n# d[i] += 1\r\n# l = len(d)\r\n# for i in range(n):\r\n# if a[i] not in s:\r\n#", "def readints():\n return [int(x) for x in input().strip().split()]\n\n\ndef main():\n n = readints()[0]\n a = readints()\n\n pre = [0] * (n + 1)\n pre[n - 1] = 1\n\n s = set()\n s.add(a[n - 1])\n for i in range(1, n):\n pre[n - i - 1] = pre[n - i] + (a[n - i - 1] not in s)\n s.add(a[n - i - 1])\n\n ans = 0\n s = set()\n for i in range(n):\n if a[i] not in s:\n ans += pre[i + 1]\n s.add(a[i])\n\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nvis=[0]*(n+1)\r\ndis=[0]*n\r\ncnt=0\r\nfor i in range(n-1,-1,-1):\r\n if vis[lst[i]]==0:\r\n cnt+=1\r\n vis[lst[i]]=1\r\n dis[i]=cnt\r\nvis=[0]*(n+1)\r\nans=0\r\nfor i in range(n-1):\r\n if vis[lst[i]]==0:\r\n \r\n ans+=(dis[i+1])\r\n vis[lst[i]]=1\r\nprint(ans)", "from math import *\r\nimport sys\r\n\r\ndef main():\r\n\r\n\tn = int(input().strip())\r\n\ta = [int(x) for x in input().split(' ')]\r\n\r\n\tfirst = {}\r\n\r\n\tfor i in range(len(a)):\r\n\t\tif a[i] not in first:\r\n\t\t\tfirst[a[i]] = i\r\n\r\n\tsz = [0 for i in range(n+3)]\r\n\tm = {}\r\n\r\n\tfor i in range(n-1, -1, -1):\r\n\t\tcur_n = a[i]\r\n\r\n\t\tm[cur_n] = m[cur_n]+1 if cur_n in m else 1\r\n\r\n\t\tsz[i] = len(m)\r\n\r\n\tcnt = 0\r\n\tfor i in range(n):\r\n\t\tif first[a[i]] == i:\r\n\t\t\tcnt += sz[i+1]\r\n\r\n\tprint(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n = int(input().strip())\r\nnumbers = list(map(int, input().strip().split()))\r\nd = {}\r\nd2 = {}\r\nx = [0]*n\r\nx2 = [0]*n\r\ncnt = 0\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n\tif numbers[i] in d:\r\n\t\tx[i] = cnt\r\n\telse:\r\n\t\td[numbers[i]] = 1\r\n\t\tcnt += 1\r\n\t\tx[i] = cnt\r\ncnt = 0\r\nfor i in range(n):\r\n\tif numbers[i] in d2:\r\n\t\tx2[i] = 0\r\n\telse:\r\n\t\td2[numbers[i]] = 1\r\n\t\tcnt += 1\r\n\t\tx2[i] = 1\r\nfor i in range(n - 1):\r\n if x2[i] == 1:\r\n ans += x[i + 1]\r\nprint(ans)\r\n", "n = int(input())\r\npositions = input().split()\r\ns1 = set()\r\nl1 = [1] * (n - 1)\r\ns2 = set()\r\nl2 = []\r\ncount = 0\r\nfor i in range(n - 1):\r\n if positions[i] in s1:l1[i] = 0\r\n s1.add(positions[i])\r\nfor i in range(n - 1):\r\n s2.add(positions[-1 - i])\r\n l2.append(len(s2))\r\nfor i in range(n - 1):\r\n count+=l1[i] * l2[-1 - i]\r\nprint(count)", "input()\r\nd = {}\r\nfor x in map(int, input().split()):\r\n d[x] = len(d)\r\nprint(sum(d.values()))", "n = int(input())\nt = list(map(int, input().split()))\nuj = [False] * n\nbvolt = [False] * 100008\njvolt = [False] * 100008\nfor i in range(n):\n\tif not bvolt[t[i]]:\n\t\tbvolt[t[i]] = True\n\t\tuj[i]=True\ncnt=0\nans=0\nfor i in range(n-1, 0, -1):\n\tif not jvolt[t[i]]:\n\t\tjvolt[t[i]]=True\n\t\tcnt+=1\n\tif uj[i-1]:\n\t\tans+=cnt\n\t\nprint(ans)\n", "from collections import Counter\n\nn = int(input())\narr = list(map(int, input().split()))\nctr = Counter(arr)\nvisited = set()\nans = 0\nfor i in range(n-1):\n if ctr[arr[i]] == 1:\n del ctr[arr[i]]\n else:\n ctr[arr[i]] -= 1\n if arr[i] not in visited:\n ans += len(ctr)\n visited.add(arr[i])\nprint(ans) \n", "n = int(input())\r\na = list(map(int,input().split()))\r\nmatrix = [0 for x in range (10**5+1)]\r\nrun = [0 for x in range (10**5+1)]\r\nnum = []\r\nc = 0\r\nsumA = 0\r\nfor i in range(n-1):\r\n run[a[i]] += 1\r\nfor j in range(n-2,-1,-1):\r\n item = a[j]\r\n item2 = a[j+1]\r\n run[item] -=1\r\n if matrix[item2] == 0:\r\n c += 1\r\n matrix[item2] = 1\r\n if run[item]<1:\r\n sumA+=c\r\nprint(sumA)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ndone = set()\r\nd = defaultdict(int)\r\n\r\nfor i in a:\r\n d[i] += 1\r\n\r\nc = len(d.keys())\r\ntotal = 0\r\nfor i in (a):\r\n d[i] -= 1\r\n if d[i] == 0:\r\n c -= 1\r\n\r\n if i not in done:\r\n total += c\r\n done.add(i)\r\n\r\n\r\nprint(total)\r\n\r\n\r\n", "n = int(input().strip())\ndata = list(map(int, input().split()))\n\ns = set()\nprev = dict()\nans = 0\nfor val in data:\n if val in prev:\n ans -= prev[val]\n prev[val] = len(s)\n ans += prev[val]\n s.add(val)\n\nprint (ans)\n\n", "from collections import defaultdict as dc\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ncnt=dc(int)\r\ncnt2=dc(int)\r\nfor i in range(n):\r\n cnt2[a[i]]+=1\r\nl=len(set(a))\r\n#print(l,cnt2)\r\nans=0\r\nfor i in range(n-1):\r\n cnt2[a[i]]-=1\r\n if(cnt2[a[i]]==0):\r\n l-=1\r\n if(cnt[a[i]]):\r\n continue\r\n ans+=l\r\n cnt[a[i]]+=1\r\n \r\n #print(\"c\",cnt,cnt2,ans)\r\nprint(ans)\r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nnumberArray = [False] * (10 ** 5 + 100)\r\npostfix = [0] * (n + 1)\r\ncnt = 0\r\nfor i in range(n - 1, -1, -1):\r\n if numberArray[arr[i]] == False:\r\n numberArray[arr[i]] = True\r\n cnt += 1\r\n postfix[i] = cnt\r\n else:\r\n postfix[i] = cnt\r\nnumberArray = [False] * (10 ** 5 + 100)\r\nans = 0\r\nfor i in range(n - 1):\r\n if numberArray[arr[i]] == False:\r\n ans += postfix[i + 1]\r\n numberArray[arr[i]] = True\r\nprint(ans)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nleft = [0 for _ in range(10**5 + 1)]\r\nright = [0 for _ in range(10**5 + 1)]\r\nr_non0 = 0\r\nfor a in A:\r\n if right[a] == 0:\r\n r_non0 += 1\r\n right[a] += 1\r\nans = 0\r\nfor i in range(n):\r\n left[A[i]] += 1\r\n right[A[i]] -= 1\r\n if right[A[i]] == 0:\r\n r_non0 -= 1\r\n if left[A[i]] == 1:\r\n ans += r_non0\r\nprint(ans)", "n = int(input())\r\nA = list(map(int,input().split()))\r\ncnt = [0 for i in range(max(A)+1)]\r\nB = [1];cnt[A[0]]=1\r\nfor i in range(1,n):\r\n if(cnt[A[i]]>=1):\r\n B.append(B[-1])\r\n continue\r\n B.append(B[-1]+1)\r\n cnt[A[i]]+=1\r\n#print(B)\r\nB = B[:n-1]\r\nj=n-2;ans = 0\r\nmark = [0 for i in range(max(A)+1)]\r\nwhile(j>=0):\r\n if(mark[A[j+1]]==1):\r\n j-=1\r\n continue\r\n ans+=B[j]\r\n mark[A[j+1]]=1\r\n j-=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "input()\r\ndc = {}\r\nfor i in map(int,input().split()):\r\n dc[i]=len(dc)\r\nprint(sum(dc.values()))", "total = int(input())\r\ninputs = [int(x) for x in input().split(\" \")]\r\n\r\nalldig = {}\r\ns = set()\r\nfor x in inputs:\r\n if(x in alldig):\r\n alldig[x] +=1\r\n else:\r\n alldig[x] = 1\r\nout = 0\r\nfor x in inputs:\r\n if(alldig[x]==1):\r\n alldig.pop(x)\r\n else:\r\n alldig[x]-=1\r\n if(x not in s):\r\n s.add(x)\r\n out+=len(alldig)\r\n\r\nprint (out)", "n = int(input())\r\na = [int(item) for item in input().split()]\r\n\r\ndifferent = [0] * n\r\ndifferent[n - 1] = 0\r\nalready = {key: 0 for key in a}\r\nfor i in range(n - 2, -1, -1):\r\n different[i] = different[i + 1] + 1 - already[a[i + 1]]\r\n already[a[i + 1]] = 1\r\n\r\ndone = {key: 0 for key in a}\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n if done[a[i]]: continue\r\n done[a[i]] = 1\r\n ans += different[i]\r\n\r\nprint(ans)\r\n", "import sys\r\n\r\ntry:\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nleft = set([])\r\nright = set([])\r\nunique = [0]*n\r\n\r\nans = 0\r\nfor i in range(n-1, -1, -1):\r\n\tright.add(a[i])\r\n\tunique[i] = len(right)\r\n\r\nfor st in range(n-1):\r\n\tif a[st] in left:\r\n\t\tcontinue\r\n\tans += unique[st+1]\r\n\tleft.add(a[st])\r\nprint(ans)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nMAX_NUM = 100010\r\nmet_forw = [False] * MAX_NUM\r\nmet_backw = [False] * MAX_NUM\r\nunique_n_backw = [0] * n\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if i < n - 1:\r\n unique_n_backw[i] = unique_n_backw[i + 1]\r\n if not met_backw[a[i]]:\r\n met_backw[a[i]] = True\r\n unique_n_backw[i] += 1\r\n\r\nanswer = 0\r\nfor i in range(n - 1):\r\n if not met_forw[a[i]]:\r\n met_forw[a[i]] = True\r\n answer += unique_n_backw[i + 1]\r\n\r\nprint(answer)\r\n", "n = int(input())\narr = list(map(int, input().split()))\nans = 0\ndic = {}\nk = set([arr[-1]])\nfor i in range(2, n+1):\n\tdic[arr[-i]] = len(k)\n\tk.add(arr[-i])\nprint(sum(dic.values()))\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = [-1] * 100200\r\nr = [-1] * 100200\r\nb = [0] * 100200\r\nfor i in range(n):\r\n x = a[i]\r\n if l[x] == -1:\r\n l[x] = i\r\n r[x] = i\r\n\r\nfor i in range(100100):\r\n if l[i] != -1:\r\n b[l[i]] += 1\r\n\r\nfor i in range(1, 100100):\r\n b[i] += b[i-1]\r\n\r\nans = 0\r\n \r\n\r\nfor i in range(1, 100100):\r\n if r[i] != -1:\r\n ans += b[r[i]-1]\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nu1 = [100000] * 100001\r\nu2 = [-1] * 100001\r\nfor i in range(n):\r\n u1[a[i]] = min(u1[a[i]], i)\r\n u2[a[i]] = max(u2[a[i]], i)\r\nst = []\r\nrev = []\r\nfor i in range(100001):\r\n if u1[i] != 100000:\r\n st += [u1[i]]\r\n if u2[i] != -1:\r\n rev += [u2[i]]\r\nst.sort()\r\nrev.sort()\r\nl = 0\r\nln = len(rev)\r\nans = 0\r\nfor elem in st:\r\n while l < ln and rev[l] <= elem:\r\n l += 1\r\n ans += ln - l\r\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\n\ndic = {}\nfor i in range(len(a) - 1):\n if a[i] not in dic:\n dic[a[i]] = 1\n else:\n dic[a[i]] += 1\n\nbeen = set([])\ncnt = 0\nfor i in range(len(a) - 1, 0, -1):\n if a[i] not in been:\n cnt += len(dic)\n been.add(a[i])\n dic[a[i - 1]] -= 1\n if (dic[a[i - 1]] == 0):\n del dic[a[i - 1]]\nprint(cnt)\n", "import sys\r\nimport os\r\n\r\ndef extract(a):\r\n d = dict()\r\n r = []\r\n for e in a:\r\n if not e in d:\r\n r.append(1)\r\n d[e] = d\r\n else:\r\n r.append(0)\r\n\r\n return r\r\n\r\ndef sonyaAndRobots(n, a):\r\n t1 = extract(a)\r\n t2 = list(reversed(extract(reversed(a))))\r\n\r\n for i in range(n - 1):\r\n t1[i + 1] += t1[i]\r\n\r\n result = 0\r\n for i in range(n - 1):\r\n result += t1[i] * t2[i + 1]\r\n\r\n return result\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n print(sonyaAndRobots(n, a))\r\n\r\nif __name__ == '__main__':\r\n main()", "def scanf(t=int):\r\n return list(map(t, input().split()))\r\nn, = scanf()\r\nm = scanf()\r\nused, dp = set(), [0] * n\r\nfor i in range(n-2, -1, -1):\r\n dp[i] = dp[i + 1] + (m[i + 1] not in used)\r\n used.add(m[i + 1])\r\nans, used = 0, set()\r\nfor i in range(n - 1):\r\n if m[i] not in used:\r\n ans += dp[i]\r\n used.add(m[i])\r\nprint(ans)\r\n", "from collections import defaultdict\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nlist1 = [False]*(10**5+1)\r\nd = defaultdict(int)\r\ncount = 0 \r\nfor i in range(n):\r\n\td[arr[i]] += 1\r\nfor i in range(n-1):\r\n\td[arr[i]] -= 1\r\n\tif(d[arr[i]] == 0):\r\n\t\tdel(d[arr[i]])\r\n\tif list1[arr[i]] == False:\r\n\t\tcount += len(d.items())\r\n\t\tlist1[arr[i]] = True\r\n\r\n\r\nprint(count)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\npst=[0]*100001\r\nleft=[0]*n\r\nright=[0]*n\r\nfor i in range(n-1,-1,-1):\r\n\tif i==n-1:\r\n\t\tpst[arr[i]]=1\r\n\t\tright[i]=1\r\n\telif pst[arr[i]]==0:\r\n\t\tright[i]=right[i+1]+1\r\n\t\tpst[arr[i]]=1\r\n\telse:\r\n\t\tright[i]=right[i+1]\r\npst=[0]*100001\r\nans=0\r\nfor i in range(n-1):\r\n\tif pst[arr[i]]==0:\r\n\t\tpst[arr[i]]=1\r\n\t\tans+=right[i+1]\r\nprint(ans)", "\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nN = 100005\r\nlt = [0] * N\r\nrt = [0] * N\r\nused = [False] * N\r\n\r\nfor i in range(n):\r\n if not used[a[i]]:\r\n used[a[i]] = True\r\n lt[i] += 1\r\n\r\nused = [False] * N\r\n\r\nsum = 0\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if not used[a[i]]:\r\n used[a[i]] = True\r\n rt[i] += 1\r\n sum += 1\r\n\r\nfor i in range(n):\r\n sum -= rt[i]\r\n ans += lt[i] * sum\r\n\r\nprint(ans)\r\n \r\n\r\n\r\n ", "#/usr/local/bin/python3\ninput()\ns=set()\nc=[0]*100006\nfor x in map(int,input().split()):\n\tc[x]=len(s)\n\ts.add(x)\nprint(sum(c))\n", "n=int(input())\nnums = list(map(int, input().split()))\nleft = {}\n\nfor i in range(n):\n if nums[i] in left.keys():\n left[nums[i]] += 1\n else:\n left[nums[i]] = 1\n\ncount = 0\ndone = set()\nfor i in nums:\n left[i] -= 1\n if left[i] == 0:\n del left[i]\n if i not in done:\n count += len(left.keys())\n done.add(i)\n\nprint(count)\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nd = dict()\r\nfor ai in a:\r\n if ai not in d:\r\n d[ai] = 0\r\n d[ai] += 1\r\n\r\nl = len(d)\r\n\r\ns = set()\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n ai = a[i]\r\n if ai not in s:\r\n s.add(ai)\r\n d[ai] -= 1\r\n if d[ai] == 0:\r\n l -= 1\r\n ans += l\r\n else:\r\n d[ai] -= 1\r\n if d[ai] == 0:\r\n l -= 1\r\n\r\nprint(ans)\r\n", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n dp = [0] * n\r\n dp[0] = 1\r\n taken = {a[0], }\r\n first = {a[0]: 0}\r\n for i in range(1, n):\r\n if a[i] not in first:\r\n first[a[i]] = i\r\n dp[i] = dp[i - 1] + int(a[i] not in taken)\r\n taken.add(a[i])\r\n\r\n result = 0\r\n taken = set()\r\n for i in reversed(range(1, n)):\r\n if not a[i] in taken:\r\n result += min(dp[i] - int(first[a[i]] == i), i)\r\n taken.add(a[i])\r\n print(result)\r\n\r\n\r\nmain()\r\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\n\r\ninput = sys.stdin.readline\r\ndef inar():\r\n return [int(el) for el in input().split()]\r\ndef main():\r\n n=int(input())\r\n arr=inar()\r\n dic={}\r\n dp=[0]*n\r\n count=0\r\n for i in range(n-1,-1,-1):\r\n if arr[i] not in dic:\r\n dic[arr[i]]=1\r\n count+=1\r\n dp[i]=count\r\n ans=0\r\n check=set()\r\n for i in range(n-1):\r\n if arr[i] not in check:\r\n ans+=dp[i+1]\r\n check.add(arr[i])\r\n print(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\r\n", "from collections import Counter\n\nn = int(input())\nnums = [int(x) for x in input().split(' ')]\n\ncounter = Counter(nums)\nvisited = set()\ntotal = 0\n\nfor i in range(n-1):\n\tif counter[nums[i]] == 1:\n\t\tdel counter[nums[i]]\n\telse:\n\t\tcounter[nums[i]] -= 1\n\tif nums[i] not in visited:\n\t\ttotal += len(counter)\n\t\tvisited.add(nums[i])\n\nprint(total)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if d.get(a[i]) == None:\r\n d[a[i]] = 1\r\n else:\r\n d[a[i]] += 1\r\ncount = 0\r\nused = set()\r\nfor i in range(n):\r\n d[a[i]] -= 1\r\n if d[a[i]] == 0:\r\n del d[a[i]]\r\n if a[i] not in used:\r\n count += len(d)\r\n used.add(a[i])\r\nprint(count)\r\n", "\r\ninput()\r\nnumbers = list(input().split())\r\n\r\nrepeated_numbers = {}\r\ncounter = 0\r\n\r\nfor number in numbers:\r\n\r\n counter += len(repeated_numbers)\r\n\r\n if number in repeated_numbers:\r\n counter -= repeated_numbers[number]\r\n \r\n repeated_numbers[number] = len(repeated_numbers)\r\n\r\nprint(counter)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nd = {}\r\nb = []\r\nfor i in range(n):\r\n if a[i] not in d:\r\n d[a[i]] = [i]\r\n elif len(d[a[i]]) == 1:\r\n d[a[i]].append(i)\r\n else :\r\n d[a[i]][1] = i\r\nb = []\r\nfor i in d:\r\n for j in d[i]:\r\n b.append(j)\r\nb.sort()\r\nfor i in range(len(b)):\r\n b[i] = a[b[i]]\r\ns = set()\r\ncount = 0\r\ncum = [0 for i in range(len(b))]\r\nfor i in range(len(b) - 1,-1,-1):\r\n if b[i] not in s:\r\n s.add(b[i])\r\n cum[i] = len(s)\r\ns = set()\r\nfor i in range(len(b)-1):\r\n if b[i] not in s:\r\n count += cum[i + 1] \r\n s.add(b[i])\r\nprint(count)\r\n \r\n\r\n", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr())\r\n n=nmbr()\r\n a=lst();cnt=ans=0\r\n d=[0]*(10**5+5)\r\n vis=set()\r\n for v in a:\r\n d[v]+=1\r\n for v in d:\r\n if v!=0:cnt+=1\r\n for i in range(n):\r\n d[a[i]]-=1\r\n if d[a[i]]==0:cnt-=1\r\n if a[i] in vis:continue\r\n ans+=cnt\r\n vis.add(a[i])\r\n print(ans)", "'''\n# 007.08.2021\n#\n# CF 495 C\n'''\n\nn = int (input ())\n\ns = input ().split ()\na = [0]*n\nb = [0]*100001; c = [0]*100001\nk = 0\nfor i in range (n) :\n a [i] = int (s [i])\n if ( b [a [i]] == 0 ) :\n k += 1\n b [a [i]] += 1\n\nm = 0\nfor i in range (n-1) :\n b [a [i]] -= 1\n if ( b [a [i]] == 0 ) : k -= 1\n if ( c [a [i]] == 0 ) :\n c [a [i]] = 1;\n m += k\n\nprint (m)\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\ndic={}\r\nfor i in s:\r\n dic[i]=len(dic)\r\nprint(sum(dic.values()))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = [0]*(n+1)\r\nused = [0]*100001\r\n\r\nfor i in range(n-1, 0, -1):\r\n cnt[i] = cnt[i+1]\r\n if used[a[i]] == 0:\r\n cnt[i] += 1\r\n used[a[i]] = 1\r\n\r\nans = 0\r\nvis = [0]*100001\r\nfor i in range(n-1):\r\n if vis[a[i]] == 0:\r\n ans += cnt[i+1]\r\n vis[a[i]] = 1\r\n\r\nprint(ans)", "input()\nc = [0] * 100001\ns = set()\nfor x in map(int, input().split(' ')):\n c[x] = len(s)\n s.add(x)\nprint(sum(c))\n", "n=int(input())\r\nv=[False]*100001\r\ng=0\r\no=g*2\r\nkor=[False]*n\r\nplus=[False]*n\r\nr=[int(i) for i in input().split()] \r\nfor i in range(n):\r\n if v[r[i]]==False:\r\n kor[i]=True\r\n g+=1\r\n v[r[i]]=True\r\nv=[False]*100001\r\nfor i in range(n):\r\n if v[r[n-i-1]]==False:\r\n plus[n-i-1]=True\r\n v[r[n-i-1]]=True\r\nfor i in range(n):\r\n if plus[i]==True:\r\n g-=1\r\n if kor[i]==True:\r\n o+=g\r\nprint(o)\r\n\r\n\r\n\r\n'''\r\n9\r\n6 6 1 4 5 2 4 4 3\r\n'''", "n=int(input())\r\na=list(map(int,input().split()))\r\nkol_left_on_right={}\r\nfor x in a:\r\n kol_left_on_right[x]=len(kol_left_on_right)\r\nprint(sum(kol_left_on_right.values()))\r\n", "from math import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef main():\r\n\r\n\tn = int(input())\r\n\ta = [int(x) for x in input().split(' ')]\r\n\r\n\tm = {}\r\n\tfirst = {}\r\n\r\n\tfor i in range(len(a)):\r\n\t\tif a[i] not in first:\r\n\t\t\tfirst[a[i]] = i\r\n\t\t\tm[a[i]] = 1\r\n\t\telse:\r\n\t\t\tm[a[i]] += 1\r\n\r\n\r\n\tcnt = 0\r\n\r\n\tfor i in range(len(a)):\r\n\t\tm[a[i]]-= 1\r\n\r\n\t\tif m[a[i]] == 0:\r\n\t\t\tm.pop(a[i])\r\n\r\n\t\tif first[a[i]] == i:\r\n\t\t\tcnt += len(m)\r\n\r\n\tprint(cnt)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "n=int(input())\r\nnums = list(map(int, input().split()))\r\nleft = {}\r\nfrom collections import Counter\r\nleft=Counter(nums)\r\ncount = 0\r\ndone = set()\r\nfor i in nums:\r\n left[i] -= 1\r\n if left[i] == 0:\r\n del left[i]\r\n if i not in done:\r\n count += len(left.keys())\r\n done.add(i)\r\n\r\nprint(count)\r\n\t", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = dict()\r\ns = set()\r\nt = [0 for i in range(n)]\r\n\r\nans = 0\r\ndiff = 0\r\nfor i in range(n):\r\n if l[i] in d:\r\n d[l[i]] += [i]\r\n else:\r\n d[l[i]] = [i]\r\n diff += 1\r\n t[i] = diff\r\n# print(t)\r\n# print(d)\r\nfor x in d:\r\n i = d[x][-1]\r\n # print(i)\r\n if i > 0:\r\n ans += t[i-1]\r\nprint(ans)\r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nc = set(a)\ncl = len(c)\n\nfrom collections import defaultdict\nd = defaultdict(int)\nfor i, ai in enumerate(a):\n d[ai] += 1\n \ns = 0\nv = set()\nfor ai in a:\n d[ai] -= 1\n if d[ai] == 0:\n c.remove(ai)\n if ai in v:\n continue\n v.add(ai)\n s += len(c)\n\n\nprint(s)", "import sys\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nif n==1:\r\n print(0)\r\n sys.exit()\r\nst=[]\r\nst1=[]\r\nd=dict()\r\nsett=set()\r\ns1=s[::-1]\r\ny=0\r\nfor i in range(n):\r\n if s1[i] not in sett:\r\n y+=1\r\n sett.add(s1[i])\r\n st1.append(y)\r\nst1=st1[0:len(st1)-1][::-1]\r\nfor i in range(0,n):\r\n try:\r\n d[s[i]]\r\n except:\r\n d.update({s[i]:i})\r\nans=0\r\nfor i in range(0,n-1):\r\n if d[s[i]]==i:\r\n ans+=st1[i]\r\nprint(ans)\r\n \r\n", "# your code goes here\r\nn = int(input())\r\narr = input()\r\narr = arr.split(' ')\r\n\r\ncou = [0 for i in range(100005)]\r\nvis = [False for i in range(100005)]\r\nst = set()\r\n\r\nfor i in range(n):\r\n\tarr[i] = int(arr[i])\r\n\tcou[arr[i]] += 1\r\n\tst.add(arr[i])\r\n\r\nans=0\r\nfor i in range(n):\r\n\tcou[arr[i]] -= 1\r\n\tif cou[arr[i]] == 0:\r\n\t\tst.remove(arr[i])\r\n\t\r\n\tif vis[arr[i]] == False:\r\n\t\tvis[arr[i]] = True\r\n\t\tans += len(st)\r\n\r\nprint(ans)\r\n\t", "n = int(input())\r\nseq = [int(x) for x in input().split()]\r\nsf = {}\r\nss = {}\r\nfor i in range(n):\r\n ss[seq[i]] = i+1\r\nfor i in range(n):\r\n sf[seq[n-i-1]] = n-i\r\nlist1 = sorted(sf.values(), reverse=True)\r\nlist2 = sorted(ss.values(), reverse=True)\r\ni1 = 0\r\ni2 = 0\r\ntot = 0\r\nleq = 0\r\nwhile i1 < len(list1) and list1[i1] >= list2[i2]:\r\n i1+=1\r\nwhile i1 < len(list1):\r\n while i2 < len(list1) and list1[i1] < list2[i2]:\r\n i2+=1\r\n if list1[i1] < list2[i2-1]:\r\n tot+=i2\r\n # print(i1,i2,tot)\r\n i1+=1\r\nprint(tot)\r\n", "n = int(input())\r\narr = [int(i) - 1 for i in input().split()]\r\nwas = [int(0) for i in range(10**5)]\r\nwas2 = [int(0) for i in range(10**5)]\r\n\r\ncnt = 0\r\n\r\nfor i in arr:\r\n\twas[i] += 1\r\n\tif (was[i] == 1):\r\n\t\tcnt += 1\r\n\r\nans = 0\r\n\r\nfor i in arr:\r\n\twas[i] -= 1\r\n\r\n\tif (was[i] == 0):\r\n\t\tcnt -= 1\r\n\tif (was2[i] != 0):\r\n\t\tcontinue\r\n\twas2[i] = 1\r\n\tans += cnt\r\nprint(ans)", "n = int(input())\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\nD = {}\r\n\r\nDiff = [0]\r\n\r\nfor i in range(n):\r\n if L[i] in D:\r\n D[L[i]].append(i)\r\n Diff.append(Diff[-1])\r\n else:\r\n D[L[i]] = [i]\r\n Diff.append(Diff[-1]+1)\r\n\r\nans = 0\r\n\r\nfor i in range(n-1,-1,-1):\r\n if i == D[L[i]][-1]:\r\n ans += Diff[i]\r\n\r\nprint(ans)", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\nn, = Neo()\r\nA = Neo()\r\nB = [0]*(n+1)\r\ns = set()\r\nfor i in range(n-1,-1,-1):\r\n if A[i] not in s:\r\n B[i] += 1+B[i+1]\r\n else:\r\n B[i] = B[i+1]\r\n s.add(A[i])\r\ns = set()\r\nAns = 0\r\nfor i in range(n):\r\n if A[i] not in s:\r\n Ans += B[i+1]\r\n s.add(A[i])\r\nprint(Ans) ", "input()\r\na = [int(x) for x in input().split()]\r\nd = {}\r\nfor i in a:\r\n d[i] = len(d)\r\nprint(sum(d.values()))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nb = [0] * n\r\ns = set()\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] not in s:\r\n s.add(a[i])\r\n b[i] = 1\r\n\r\nr = 0\r\ns = set()\r\nfor i in range(n):\r\n if b[i]:\r\n r += len(s)\r\n s.add(a[i])\r\n\r\nprint(r)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr1=[0]*(n+1)\r\narr2=[0]*(n+1)\r\n#dict1={}\r\n\"\"\"for i in range(n):\r\n arr1[arr[i]]+=1\r\n try:\r\n dict1[arr[i]].append(i+1)\r\n except:\r\n KeyError\r\n dict1[arr[i]]=[i+1]\"\"\"\r\nif(n==1):\r\n print(0)\r\nelse:\r\n ans=0\r\n var=1\r\n arr2[arr[-1]]=1\r\n for i in range(n-2,-1,-1):\r\n \r\n if(arr2[arr[i]]==0):\r\n ans+=var\r\n arr1[arr[i]]=var\r\n var+=1\r\n arr2[arr[i]]+=1\r\n elif(arr2[arr[i]]==1):\r\n ans-=arr1[arr[i]]\r\n ans+=var\r\n arr2[arr[i]]+=1\r\n arr1[arr[i]]=var\r\n else:\r\n ans-=arr1[arr[i]]\r\n ans+=var\r\n arr1[arr[i]]=var\r\n arr2[arr[i]]+=1\r\n #print(*arr2)\r\n #print(*arr1)\r\n print(ans)\r\n", "n=int(input())\nl=[int(x) for x in input().split()]\n\nd={}\nfor i in l:\n if i in d:\n d[i]+=1\n else:\n d[i]=1\nd1=d\nu=[]\nfor i in l:\n if i in d:\n d[i]-=1\n if d[i]==0:\n d.pop(i,None)\n u.append(len(d))\nd.clear()\ncount=0\nfor i in range(len(l)):\n if l[i] in d:\n continue;\n d[l[i]]=1\n count+=u[i]\n\nprint(count)\n", "n = int(input())\r\na = input().split(\" \")\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nlu = {}\r\nfor i in range(n):\r\n lu[a[i]] = []\r\nfor i in range(n):\r\n lu[a[i]].append(i)\r\nmins = []\r\nmaxes = []\r\nfor val in lu.values():\r\n mins.append(min(val))\r\n maxes.append(max(val))\r\nkey_num = len(lu.keys())\r\nmins.sort()\r\nmaxes.sort()\r\n# print(mins)\r\n# print(maxes)\r\nind = 0\r\npairs = 0\r\ncounter = key_num\r\nfor i in range(len(mins)):\r\n while maxes[ind] <= mins[i]:\r\n if ind == len(maxes) - 1:\r\n counter = 0\r\n break\r\n else:\r\n ind += 1\r\n counter -= 1\r\n pairs += counter\r\n # print(counter)\r\nprint(pairs)", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nnb = 0\r\n\r\n\r\nall = [0 for _ in range(10**5)]\r\ndistinct = len(set(A))\r\nseen = [False for _ in range(10**5)]\r\n\r\nfor x in A:\r\n all[x-1] += 1\r\n \r\n\r\nfor i in range(n-1):\r\n all[A[i]-1] -= 1\r\n if all[A[i]-1] == 0:\r\n distinct -= 1\r\n \r\n if not seen[A[i]-1]:\r\n seen[A[i]-1] = True\r\n nb += distinct\r\n \r\n # print(A[i], distinct, all)\r\nprint(nb)\r\n", "n=int(input())\r\nl= list(map(int, input().split() ) )\r\nd1=dict()\r\nd2=dict()\r\nfor i in range(n):\r\n if l[i] not in d1:\r\n d1[ l[i] ] = i\r\nfor i in reversed( range(n) ):\r\n if l[i] not in d2:\r\n d2[l[i]]=i\r\nstart= sorted( list(d1.values() ) )\r\nend= sorted(list(d2.values() ) )\r\ntec=0\r\nk=0\r\nc=len(end)\r\ncold=c\r\nfor elem in start:\r\n while end[tec]<=elem:\r\n tec+=1\r\n c-=1\r\n if tec==cold:\r\n break\r\n k+=c\r\nprint(k)", "read = lambda: map(int, input().split())\nread()\nd = {}\nfor x in read():\n d[x] = len(d)\nprint(sum(d.values()))\n", "n = int(input())\r\nlst=[int (i) for i in input().split()]\r\ndict={}\r\nrem_uniq=[]\r\nfor i in range(n-1,-1,-1):\r\n dict[lst[i]] = 1\r\n rem_uniq.append(len(dict))\r\ndict.clear()\r\nrem_uniq.reverse()\r\ncount=0\r\nfor i in range(n-1):\r\n #if dict.get(lst[i],0) !=0:\r\n if lst[i] in dict:\r\n #print('Skipping for i val',i)\r\n continue\r\n dict[lst[i]] = 1\r\n # print('adding count ',rem_uniq[i+1])\r\n count+= rem_uniq[i+1]\r\n\r\nprint(count)", "n=int(input())\r\ns=list(map(int,input().split()))\r\ndist=[]\r\np=[0 for i in range(100005)]\r\ndiff=0\r\nfor i in range(n-1,-1,-1):\r\n if p[s[i]]==0:\r\n p[s[i]]=1\r\n diff+=1\r\n else:\r\n p[s[i]]+=1\r\n dist+=[diff]\r\nvis=[0 for i in range(100005)]\r\nans=0\r\nfor i in range(n-1):\r\n if vis[s[i]]==0:\r\n ans+=dist[n-i-2]\r\n vis[s[i]]=1\r\nprint(ans)", "n=int(input())\r\na=[int(i)for i in input().split()]\r\nc={}\r\nfor r in a:\r\n if r in c:\r\n c[r]+=1\r\n else:\r\n c[r]=1\r\n\r\ntotal=0\r\nb=set()\r\nfor i in range(n-1):\r\n c[a[i]]-=1\r\n if c[a[i]]==0:\r\n del c[a[i]]\r\n if a[i]not in b:\r\n b.add(a[i])\r\n \r\n \r\n total+=len(c)\r\nprint(total)\r\n", "n = int(input())\r\ncount = 0\r\nl = tuple(map(int, input().split()))\r\nstart, end = dict(), dict()\r\nfor i in range(n):\r\n start[l[i]], end[l[i]] = start.get(l[i], i), i\r\nstart, end = list(sorted(start.values())), list(sorted(end.values()))\r\nfor i in start:\r\n for j in range(len(end)):\r\n if i < end[j]:\r\n del(end[:j])\r\n break\r\n else:break\r\n count += len(end)\r\nprint(count)", "def solve():\n n = int(input())\n nums = list(map(int, input().split()))\n seen = set()\n num_distinct = [0 for _ in range(n + 1)]\n for i in reversed(range(n)):\n if nums[i] not in seen:\n seen.add(nums[i])\n num_distinct[i] = num_distinct[i + 1] + 1\n else:\n num_distinct[i] = num_distinct[i + 1]\n \n seen = set()\n ans = 0\n for i in range(len(nums)):\n if nums[i] in seen:\n continue\n ans += num_distinct[i + 1]\n seen.add(nums[i])\n print(ans)\n\nsolve()\n" ]

[ "import re\r\n\r\ns = input().strip()\r\ns = re.sub('\\s+', ' ', s)\r\ns = re.sub('\\s?([.,!?])\\s?', '\\\\1 ', s)\r\nprint(s)", "s = input().split()\n\npunc = [\".\", \",\", \"!\", \"?\"]\n\ncom_ind = [(x, y) for x, row in enumerate(s) for y, col in enumerate(row) if(col in punc)]\ncom_ind.sort(reverse = True, key = lambda x: x[1])\n\nfor (x, y) in com_ind:\n if(y != len(s[x])-1):\n s[x] = s[x][:y+1]+\" \"+s[x][y+1:]\n\nfor i in range(len(s)):\n if(i < len(s)-1):\n s[i] = s[i] + \" \"\n\nfor (x, y) in com_ind:\n if(y == 0):\n s[x-1] = s[x-1][:len(s[x-1])-1]\n\ns = \"\".join(s)\n\nprint(s)\n\n \t\t\t \t\t\t\t \t \t\t\t\t\t\t\t \t\t \t", "s=input()\r\nt=',.?!'\r\nfor i in t:s=s.replace(i, i+' ')\r\ns=' '.join(s.strip().split())\r\nfor i in t:s=s.replace(' '+i,i)\r\nprint(s)", "import re\r\nv = 'galileo galilei was an italian physicist ,mathematician, astronomer'\r\na = input().split()\r\na = ' '.join(a)\r\nfor i in range(4):\r\n if re.search('\\ *,\\ *', a):\r\n a = re.split('\\ *,\\ *', a)\r\n a = ', '.join(a)\r\n if re.search('\\ *\\.\\ *', a):\r\n a = re.split('\\ *\\.\\ *', a)\r\n a = '. '.join(a)\r\n if re.search('\\ *\\!\\ *', a):\r\n a = re.split('\\ *\\!\\ *', a)\r\n a = '! '.join(a)\r\n if re.search('\\ *\\?\\ *', a):\r\n a = re.split('\\ *\\?\\ *', a)\r\n a = '? '.join(a)\r\n\r\n\r\nprint(a)\r\n", "from sys import stdin\n\n\ndef inta(arr):\n return [int(x) for x in arr]\n\n\ndef sr():\n return stdin.readline().strip()\n\n\ns = sr()\n\nk = []\n\np = list(',!?.')\n\nfor t in s:\n if len(k) == 0:\n k.append(t)\n continue\n if k[-1] == ' ' and t == ' ':\n continue\n if t in p and k[-1] == ' ':\n while k[-1] == ' ':\n k.pop(-1)\n k.append(t)\n else:\n k.append(t)\n if t in p:\n k.append(' ')\n\nprint(''.join(k))", "s=input().strip()\r\nznak=['.',',','!','?']\r\nres=''\r\nfor i in s:\r\n if i.isalpha():\r\n res+=i\r\n continue\r\n elif i==' ' and res[-1]!=' ':\r\n res+=i\r\n continue\r\n elif i in znak:\r\n if res[-1]==' ':\r\n res=res[:-1]\r\n res+=i+' '\r\nprint(res) \r\n", "d=[',','?','.',';','!']\r\nz=input()\r\nfor t in d:\r\n z=z.replace(t,'%s '%t)\r\nfor i in range(10,0,-1):\r\n z=z.replace(' '*i,' ') \r\nfor j in d:\r\n if j in z:\r\n z=z.replace(' %s'%j,j) \r\nprint(z)", "s= input()#Abir . kumar . raj\r\na = \",.?!\"\r\nfor i in a:\r\n s = s.replace(i,i+\" \")#Abir . kumar . raj\r\ns = ' '.join(s.split()) #Abir . kumar . raj\r\nfor i in a:\r\n s = s.replace(\" \"+i,i) #Abir. kumar. raj\r\nprint(s) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1].replace(',',' , ').replace('.', ' . ').replace('!',' ! ').replace('?',' ? ')\r\nw = ' '.join(s.split())\r\nw = w.replace(' ,',',').replace(' .','.').replace(' !','!').replace(' ?','?')\r\nprint(w)", "s={' ','.',',','!','?'}\r\nx=input()\r\ndef change(z):\r\n while True:\r\n if x[z] not in s:\r\n return z\r\n z+=1\r\nr=''\r\ni=0\r\nwhile i<len(x):\r\n if x[i] in s:\r\n if x[i]==' ':\r\n i+=1\r\n while True:\r\n if x[i]!=' ':\r\n if x[i] in s:\r\n r+=x[i]\r\n r+=' '\r\n i=change(i)\r\n else:\r\n r+=' '\r\n break\r\n i+=1\r\n else:\r\n r+=x[i]\r\n r+=' '\r\n i=change(i)\r\n \r\n else:\r\n r+=x[i]\r\n i+=1\r\nprint(r)\r\n", "\r\ns=str(input())\r\nl=',.!?'\r\ne=''\r\nfor i in range(0,len(s)):\r\n if(s[i] not in l and s[i]!=' '):\r\n e=e+s[i]\r\n elif(s[i]==' '):\r\n if(e[-1]==' '):\r\n pass\r\n else:\r\n e=e+s[i]\r\n else:\r\n if(e[-1]==' '):\r\n e=e[0:len(e)-1]\r\n e=e+s[i]+' '\r\n else:\r\n e=e+s[i]+' '\r\nprint(e)", "string = input()\r\npunctMarks = {\".\", \",\", \"!\", \"?\"}\r\n\r\nres = \"\"\r\nfor ch in string:\r\n if ch.isalpha():\r\n res += ch\r\n elif ch in punctMarks:\r\n if res[-1] == \" \":\r\n res = res[:-1] \r\n res += ch + \" \"\r\n elif ch == \" \" and (res[-1] != \" \" and ch not in punctMarks):\r\n res += ch\r\nprint(res.rstrip())\r\n", "sp = False\nfor ch in input():\n if ch == ' ':\n sp = True\n elif ch.islower():\n print(('', ' ')[sp] + ch, end='')\n sp = False\n else:\n print(ch, end='')\n sp = True\n", "import re\n\ns = input().strip()\ns = re.sub('\\s+', ' ', s)\ns = re.sub('\\s?([.,!?])\\s?', '\\\\1 ', s)\nprint(s)\n", "# from collections import defaultdict\n# from sys import stdin\n# import itertools\n# import bisect\n# from math import sqrt,ceil,floor,gcd\n\nimport re\n\ndef func(put,mapping,unpack):\n a = put(str)\n a = re.findall( r'\\w+|[^\\s\\w]+',a)\n ans = ''\n punct = {'!','?',',','.'}\n for e in a:\n if ans=='': ans += e\n else:\n if punct.__contains__(e):\n ans += e\n else:\n ans += ' ' + e\n \n print(ans)\n \n \ndef init(TestCases=True):\n put = lambda s: s(input().strip())\n mapping = lambda s: list(map(s,input().split()))\n unpack = lambda s: map(s,input().split())\n for _ in range(int(input()) if TestCases else 1):\n func(put,mapping,unpack)\n\nif __name__ == '__main__':\n init(False)", "regs=(',','.','!','?',' ')\r\n\r\ndef get_high(s):\r\n vs=list(s)\r\n vs.sort(key= lambda x: regs.index(x))\r\n #print('s={}|vs={}'.format(s,vs))\r\n return vs[0]\r\n\r\ndef spec_split(s):\r\n s+=' '\r\n v=[]\r\n t=''\r\n n=len(s)\r\n c=0\r\n while c<n:\r\n if s[c:c+1] in regs:\r\n d=c\r\n while d<n and s[d:d+1] in regs:\r\n d+=1\r\n if c<n-1:\r\n hs=get_high(s[c:d])\r\n t+=hs\r\n if hs!=' ' and d!=n:\r\n #print('n={} d={}'.format(n,d))\r\n t+=' '\r\n v.append(t)\r\n t=''\r\n c=d-1\r\n else:\r\n t+=s[c:c+1]\r\n c+=1\r\n return v\r\n\r\ns=input()\r\nv=spec_split(s)\r\nfor c in v:\r\n print(c,end='')\r\n", "string = input()\r\nstring = \" \".join(string.split())\r\nfor j in \".,!?\":\r\n string = string.split(f\"{j}\")\r\n for i in range(len(string)):\r\n string[i] = string[i].strip()\r\n string = f\"{j} \".join(string)\r\nprint(string)", "s = input()\r\n\r\nfor ch in ',.!?':\r\n s = s.replace(ch, ch + ' ')\r\n\r\nwhile ' ' in s:\r\n s = s.replace(' ', ' ')\r\n\r\nfor ch in ',.!?':\r\n s = s.replace(' ' + ch, ch)\r\n\r\nprint(s.strip())", "s = input()\r\n\r\nres = []\r\npunctuation = [',', '.', '!', '?']\r\n\r\nfor i in range(len(s)):\r\n if i >= 1:\r\n if s[i] == ' ':\r\n if res[-1] != ' ':\r\n res.append(s[i])\r\n else:\r\n continue\r\n else:\r\n if s[i] in punctuation:\r\n if res[-1] == ' ':\r\n res.pop()\r\n res.append(s[i])\r\n res.append(' ')\r\n else:\r\n res.append(s[i])\r\n else:\r\n if s[i] == ' ':\r\n continue\r\n if s[i] in punctuation:\r\n continue\r\n else:\r\n res.append(s[i])\r\n\r\nprint(''.join(res))\r\n", "def check_bit(number,bit_index):\r\n return number | (1<<bit_index-1)==number\r\n\r\ndef update_bit(number,i,is_bit=True):\r\n value = 1 if is_bit else 0\r\n mask = ~(1<<i)\r\n return (number & mask) | (value<<i)\r\n\r\ndef main():\r\n str1 = input()\r\n str2 = []\r\n i = 0\r\n pun = ['?',',','.','!']\r\n while i<len(str1):\r\n if str1[i]==' ' and len(str2)>0 and str2[len(str2)-1]==' ':\r\n pass\r\n elif str1[i] in pun and len(str2)>0 and str2[len(str2)-1]==' ':\r\n str2[len(str2)-1] = str1[i]\r\n str2.append(' ')\r\n elif str1[i] in pun:\r\n str2.append(str1[i])\r\n str2.append(' ')\r\n else:\r\n str2.append(str1[i])\r\n i+=1\r\n \r\n print(''.join(str2))\r\n\r\nif __name__==\"__main__\":\r\n main()", "\r\nif __name__ == '__main__':\r\n value = input()\r\n result = []\r\n for i in range(len(value)):\r\n if value[i].islower():\r\n result.append(value[i])\r\n\r\n elif value[i] == ' ':\r\n if result[-1] == ' ':\r\n continue\r\n else:\r\n result.append(' ')\r\n\r\n else:\r\n #punctuation\r\n if result[-1] == ' ':\r\n result.pop()\r\n result.append(value[i])\r\n result.append(' ')\r\n result = \"\".join(result)\r\n print(result)\r\n\r\n", "s = input().split()\r\nans = []\r\nfor w in s: \r\n r = ''\r\n i = 0\r\n while i < len(w):\r\n while i < len(w) and w[i].isalpha():\r\n r += w[i]\r\n i += 1\r\n if i == len(w): break\r\n r += w[i]\r\n if i <= len(w)-2:\r\n r += ' '\r\n i += 1\r\n ans.append(r)\r\nres = ' '.join(ans)\r\nreal_res = ''\r\n#print(res)\r\nfor i in range(len(res)-1):\r\n if res[i].isalpha():\r\n real_res += res[i]\r\n continue\r\n if res[i] == ' ':\r\n if res[i+1].isalpha():\r\n real_res += ' '\r\n continue\r\n else:\r\n real_res += res[i+1]\r\n continue\r\n if res[i-1].isalpha():\r\n real_res += res[i]\r\nprint(real_res+res[-1])", "s = input()\r\nt = ',.?!'\r\nfor i in t : s = s.replace(i, i + ' ')\r\ns = ' '.join(s.strip().split()) \r\nfor i in t : s = s.replace(' ' + i, i)\r\nprint(s)", "s= input()\r\na = \",.?!\"\r\nfor i in a:\r\n s = s.replace(i,i+\" \")\r\ns = ' '.join(s.split()) \r\nfor i in a:\r\n s = s.replace(\" \"+i,i)\r\nprint(s) ", "a=input()\r\ns=[]\r\nh=1\r\nt='!,.?'\r\nfor i in range(len(a)):\r\n if a[i]==' ' and h==0:\r\n pass\r\n elif a[i]==' ' :\r\n h=0\r\n s.append(a[i])\r\n elif a[i] in t and h==0:\r\n s.pop()\r\n s.append(a[i])\r\n s.append(' ')\r\n elif a[i] in t and h==1:\r\n s.append(a[i])\r\n s.append(' ')\r\n h=0\r\n else:\r\n h=1\r\n s.append(a[i])\r\nfor i in s:\r\n print(i,end=\"\")", "# ___ __\r\n# |\\ \\|\\ \\\r\n# \\ \\ \\_\\ \\\r\n# \\ \\ ___ \\ o g r i d e r k a K O E D\r\n# \\ \\ \\\\ \\ \\\r\n# \\ \\__\\\\ \\_\\\r\n# \\|__| \\|__|\r\n\r\n\r\n#Bhaang bharosa na kar\r\n\r\n\r\n\r\n#phinaaly chl jaana chaiye\r\nx=input()\r\nm=('.',',','?','!')\r\nfor i in range(len(x)-1):\r\n if x[i] in m and x[i + 1] != ' ':\r\n print(x[i] + ' ', end='')\r\n elif not(x[i]==' ' and x[i+1]==' ' or x[i]==' ' and x[i+1] in m):\r\n print(x[i],end='')\r\nprint(x[-1])", "import re\ns = input()\ns = re.sub(r\"( *),( *)\", \", \", s)\ns = re.sub(r\"( *)\\?( *)\", \"? \", s)\ns = re.sub(r\"( *)\\.( *)\", \". \", s)\ns = re.sub(r\"( *)!( *)\", \"! \", s)\ns = re.sub(r\" +\", \" \", s)\nprint(s)\n", "from collections import Counter\r\nfrom collections import defaultdict\r\nimport math\r\nimport random\r\nimport heapq as hq\r\nfrom math import sqrt\r\nimport sys\r\nfrom functools import reduce\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef iinput():\r\n return int(input())\r\n\r\n\r\ndef tinput():\r\n return input().split()\r\n\r\n\r\ndef rinput():\r\n return map(int, tinput())\r\n\r\n\r\ndef rlinput():\r\n return list(rinput())\r\n\r\n\r\nmod = int(1e9)+7\r\n\r\ndef factors(n):\r\n return set(reduce(list.__add__,\r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n s=input()\r\n punc=',.!?'\r\n for i in punc:\r\n s=s.replace(i,i+' ')\r\n while ' ' in s:\r\n s=s.replace(' ',' ')\r\n for i in punc:\r\n s=s.replace(' '+i,i)\r\n print(s) \r\n \r\n", "# LUOGU_RID: 92736227\nt = input().rstrip()\r\n\r\nd, q = {}, []\r\nfor i in range(97, 123):\r\n d[chr(i)] = 1\r\nd['.'] = d[','] = d['!'] = d['?'] = 0\r\nd[' '] = -1\r\n\r\ntf = 1\r\nfor x in t:\r\n f = d[x]\r\n if tf == 1: \r\n q.append(x)\r\n tf = f\r\n elif tf == 0: \r\n q.append(' ')\r\n if f == 1:\r\n q.append(x)\r\n tf = 1\r\n else: tf = -1\r\n else:\r\n if f == 1:\r\n q.append(x)\r\n tf = 1\r\n elif f == 0: \r\n q[-1] = x\r\n tf = 0\r\n\r\nfor x in q:\r\n print(x, end = '')\r\n\r\n", "s=input().strip()\r\nznak = {\".\", \",\", \"?\", \"!\"}\r\nres=\"\"\r\n\r\n\r\nfor ch in s:\r\n\r\n if ch.isalpha():\r\n res += ch\r\n\r\n elif ch == \" \" and res[-1] != \" \":\r\n res += ch\r\n\r\n elif ch in znak:\r\n if res[-1] == \" \":\r\n res = res[:-1]\r\n res += ch + \" \"\r\n\r\nprint(res)", "def solve(s :str)->str:\r\n ss=\"\"\r\n word_end = False\r\n comma_mit =False\r\n last_Panc= \",\"\r\n for i in range(len(s)):\r\n if(comma_mit ):\r\n if (s[i] == ' '):\r\n continue\r\n else:\r\n ss=\"\".join((ss,last_Panc,\" \"))\r\n comma_mit= False\r\n word_end= False\r\n if(word_end):\r\n if (s[i] == ' '):\r\n continue\r\n elif (s[i] in [',', '!', '?', '.']):\r\n comma_mit = True\r\n last_Panc = s[i]\r\n else:\r\n ss=\"\".join((ss,\" \"))\r\n comma_mit = False\r\n word_end = False\r\n if(not word_end):\r\n if (s[i] == ' '):\r\n word_end = True\r\n elif(s[i] in [',', '!', '?', '.']):\r\n comma_mit = True\r\n last_Panc= s[i]\r\n else:\r\n ss=\"\".join((ss, s[i]))\r\n\r\n return ss\r\ns= input()\r\nprint(solve(s))", "# cook your dish here\r\ns=input()\r\nn=len(s)\r\ns2=''\r\ni=0\r\nwhile i<n:\r\n while i<n and s[i]!=\" \":\r\n if s[i]==\".\" or s[i]==\"!\" or s[i]==\"?\" or s[i]==\",\" and s[i+1]!=\" \":\r\n s2+=s[i]+\" \"\r\n else:\r\n s2+=s[i]\r\n i+=1\r\n if i+1<n:\r\n if s[i+1]!=\".\" and s[i+1]!=\" \" and s[i+1]!=\"!\" and s[i+1]!=\",\" and s[i+1]!=\"?\" and s2[len(s2)-1]!=\" \":\r\n s2+=s[i]\r\n i+=1\r\nprint(s2)", "s = input()\r\nnews = \"\"\r\nflag = True\r\nfor i in s:\r\n if i != ' ' and not (32 < ord(i) < 64) and flag:\r\n news += i\r\n elif i == ' ':\r\n flag = False\r\n elif i != ' ' and not (32 < ord(i) < 64) and not flag:\r\n flag = True\r\n news += ' '\r\n news += i\r\n elif 32 < ord(i) < 64:\r\n news += i\r\n flag = False\r\nprint(news)", "punc = ['.', ',', '!', '?'];\r\n\r\ns = input()\r\nx = s.split()\r\nres = str();\r\n\r\nfor i in x :\r\n\tres = res + i + ' '\r\n\r\nfor c in punc :\r\n\ty = res.split(c)\r\n\t#print(y)\r\n\tres = str();\r\n\tfor i in y :\r\n\t\tres = res + i.strip() + c + ' '\r\n\r\nres.rsplit()\r\nans = str()\r\n\r\ncount = 0\r\nlength = len(res) - 1\r\n\r\n#print(length,res)\r\n\r\ndef rem(c) :\r\n\tif(c == ' ' or c == '.'or c == ',' or c == '!'or c == '?') :\r\n\t\treturn True\r\n\treturn False\r\n\r\nfor i in range(len(res)) :\r\n\tif(rem(res[length - i]) == True) :\r\n\t\tcount = count + 1\r\n\telse :\r\n\t\tbreak;\r\n\r\nprint(res[0:(length + 1 - count)])\r\n\r\n\r\n\r\n\r\n\r\n", "S=input()\r\nU=['.',',','!','?',]\r\nN=S\r\n\r\nfor u in U:\r\n E=N.split(u)\r\n N=''\r\n for s in E:\r\n N=N+s+u+' '\r\nE=N.split()\r\nN=''\r\nfor s in E:\r\n if s[0] in U:\r\n N=N[:-1]+s[0]+' '+s[1:]\r\n else:\r\n N=N+s+' '\r\nprint(N[:-5])", "s=input()\r\nt='.,?!'\r\nfor i in t: s=s.replace(i, i+' ')\r\ns=' '.join(s.split())\r\nfor i in t: s=s.replace(' '+i,i)\r\nprint(s)", "s=input()\r\nr=''\r\ncom=False\r\nfor i in range(len(s)):\r\n if (i==0) and (s[i]==',' or s[i]==' '):\r\n continue\r\n if s[i]==' 'and s[i+1]==' ':\r\n continue\r\n if s[i]==' 'and (s[i+1]==',' or s[i+1]=='.' or s[i+1]=='!' or s[i+1]=='?' or s[i+1]==';'):\r\n continue\r\n if s[i]==',' or s[i]=='.' or s[i]=='?' or s[i]=='!':\r\n r=r+s[i]+' '\r\n com=True\r\n continue\r\n if com and s[i]==' ':\r\n continue\r\n else :\r\n com=False\r\n r=r+s[i]\r\nprint(r)", "#!/usr/bin/python3\nimport re \n\ninput_text = input()\npuncs = ['.','!',',', '?']\n\nfor punc in puncs:\n input_text = input_text.replace(punc,f\"{punc} \")\n input_text = re.sub(r'[\\s]{2,}',' ',input_text)\n input_text = input_text.replace(f\" {punc}\",punc) \n\ninput_text = re.sub(r'[\\s]{2,}',' ',input_text)\nprint(input_text.replace(\" \",\" \"))\n", "import re\r\ns=re.sub(\"\\ +\",\" \",input())\r\ns=re.sub(' *([,.!?]) *',r'\\1 ',s)\r\nprint(s)\r\n", "s = input()\ncurr = ''\nwords = []\nfor c in s:\n if c == ' ':\n if curr:\n words.append(curr)\n curr = ''\n elif c in [',', '?', '.', '!']:\n if curr:\n curr += c\n words.append(curr)\n curr = ''\n else:\n words[-1]+=c\n else:\n curr+=c\nif curr:\n words.append(curr)\nprint(' '.join(words))", "s=input()\r\nl=',.?!'\r\nfor i in l:\r\n s=s.replace(i,i+' ')\r\nwhile(' ' in s):\r\n s=s.replace(' ',' ')\r\nfor i in l:\r\n s=s.replace(' '+i,i)\r\nprint(s)\r\n", "import re\r\ndef run():\r\n out = input()\r\n for i in \",.?!\":\r\n out = out.replace(i, f\" {i} \")\r\n out = re.sub(r\"\\s+\", \" \", out)\r\n for i in \",.?!\":\r\n out = out.replace(f\" {i} \", i + \" \")\r\n print(out)\r\nrun()", "x=input()\r\nm=('.',',','?','!')\r\nfor i in range(len(x)-1):\r\n if x[i] in m and x[i + 1] != ' ':\r\n print(x[i] + ' ', end='')\r\n elif not(x[i]==' ' and x[i+1]==' ' or x[i]==' ' and x[i+1] in m):\r\n print(x[i],end='')\r\nprint(x[len(x)-1])", "l = list(' '.join(list(filter(lambda x: x != ' ', input().split()))))\r\nx = []\r\na = []\r\nfor i in range(len(l)):\r\n try:\r\n if l[i] in \".,!?\":\r\n if l[i-1] == \" \":\r\n x.append(i-1)\r\n if l[i+1] != \" \":\r\n a.append(i+1)\r\n except:\r\n pass\r\nx = x[::-1]\r\na = a[::-1]\r\nfor i in range(len(l)):\r\n try:\r\n if i == x[-1]:\r\n x.pop()\r\n continue\r\n except:\r\n pass\r\n try:\r\n if i == a[-1]:\r\n print(end=\" \")\r\n a.pop()\r\n except:\r\n pass\r\n print(end=l[i])" ]

[ "import math\r\nN = 15\r\nmat = 0\r\ninf = 1000000000\r\nanswer = inf\r\n\r\n\r\n\r\ndef Get_Cycle_Length(v,graph):\r\n global mat\r\n global answer\r\n if len(v) == 0:\r\n answer = min(answer,mat)\r\n return\r\n end = v.pop()\r\n i = 0\r\n while i<len(v):\r\n se = v.pop(i)\r\n \r\n mat += graph[se][end]\r\n Get_Cycle_Length(v,graph)\r\n mat -= graph[se][end]\r\n v.insert(i,se)\r\n i+=1\r\n v.append(end)\r\n \r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n\r\n graph = [[inf] * n for i in range(n)]\r\n deg = [0] * n\r\n sum = 0\r\n\r\n for i in range(n):\r\n graph[i][i] = 0\r\n\r\n for i in range(m):\r\n x,y,w = map(int,input().split())\r\n x -= 1\r\n y -= 1\r\n deg[x]+=1\r\n deg[y]+=1\r\n graph[x][y] = min(graph[x][y],w)\r\n graph[y][x] = min(graph[y][x],w)\r\n sum += w\r\n\r\n for i in range(n):\r\n for j in range(n): # aqui veo si hay algun camino de menos peso\r\n for k in range(n):\r\n graph[j][k] = min(graph[j][k],graph[j][i] + graph[i][k])\r\n\r\n for i in range(n):\r\n if graph[0][i] == inf and deg[i] > 0:\r\n print('-1')\r\n return\r\n v = []\r\n \r\n for i in range(n):\r\n if deg[i] % 2 != 0:\r\n v.append(i)\r\n #if len(v) == n: #por lo de conf 3\r\n # print(sum)\r\n # return\r\n Get_Cycle_Length(v,graph)\r\n print(sum + answer)\r\n\r\n\r\n\r\nmain()\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n@bootstrap\r\ndef optimal_path(curr):\r\n global res\r\n global best\r\n\r\n if curr==[]:\r\n res=min(res,best)\r\n yield\r\n\r\n last=curr.pop()\r\n i = 0\r\n while i < len(curr):\r\n req = curr.pop(i)\r\n\r\n best += adj[req][last]\r\n yield optimal_path(curr)\r\n best -= adj[req][last]\r\n curr.insert(i, req)\r\n i += 1\r\n curr.append(last)\r\n yield\r\n\r\n\r\nn,m=map(int,input().split())\r\nadj=[[float(\"inf\") for i in range(n+1)] for j in range(n+1)]\r\nfor i in range(1,n+1):\r\n adj[i][i]=0\r\ndeg=[0]*(n+1)\r\ntot=0\r\nfor j in range(m):\r\n u,v,w=map(int,input().split())\r\n tot+=w\r\n adj[u][v]=min(adj[u][v],w)\r\n adj[v][u]=min(adj[v][u],w)\r\n deg[u]+=1\r\n deg[v]+=1\r\n\r\n#Floyd Warshall\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n for k in range(1,n+1):\r\n adj[j][k]=min(adj[j][k],adj[j][i]+adj[i][k])\r\n\r\nposs=1\r\nfor i in range(1,n+1):\r\n if deg[i]>0 and adj[1][i]==float(\"inf\"):\r\n poss=0\r\n break\r\n\r\nif not poss:\r\n print(-1)\r\n\r\nelse:\r\n oddver=[]\r\n for i in range(1,n+1):\r\n if deg[i]%2:\r\n oddver.append(i)\r\n\r\n\r\n res=float(\"inf\")\r\n best=0\r\n optimal_path(oddver)\r\n print(tot+res)\r\n\r\n\r\n\r\n\r\n", "from itertools import repeat\r\ninf = 10000000000\r\nans = inf\r\nmat = 0\r\ndef solve(odd, graph_matrix):\r\n global ans\r\n global mat\r\n if (len(odd) == 0):\r\n ans = min(ans, mat)\r\n return\r\n e = odd.pop()\r\n i = 0\r\n while i<len(odd):\r\n cur = odd.pop(i)\r\n mat+=graph_matrix[cur][e]\r\n solve(odd, graph_matrix)\r\n mat-=graph_matrix[cur][e]\r\n odd.insert(i, cur)\r\n i+=1\r\n odd.append(e)\r\ndef main():\r\n v,e= map(int, input().split())\r\n\r\n graph = [[inf]*v for i in repeat(None, v)]\r\n deg=[0]*v\r\n sum = 0\r\n\r\n for i in range(v):\r\n graph[i][i]=0\r\n for i in range(e):\r\n in1, in2, in3= map(int,input().split())\r\n in1-=1\r\n in2-=1\r\n deg[in1]+=1\r\n deg[in2]+=1\r\n graph[in1][in2]= min(graph[in1][in2], in3)\r\n graph[in2][in1]= min(graph[in2][in1], in3)\r\n sum+=in3\r\n for i in range(v):\r\n for j in range(v):\r\n for k in range(v):\r\n graph[j][k] = min(graph[j][k], graph[j][i]+graph[i][k])\r\n\r\n for i in range(v):\r\n if graph[0][i] == inf and deg[i]>0:\r\n print(-1)\r\n return\r\n odd = []\r\n\r\n for i in range(v):\r\n if deg[i] % 2 != 0:\r\n odd.append(i)\r\n solve(odd, graph_matrix=graph)\r\n print(sum + ans)\r\nmain()", "INF = 1000 * 1000 * 100\r\n\r\ndef get_ans(vertexes):\r\n if not vertexes:\r\n return 0\r\n ans = INF\r\n for i in range(1, len(vertexes)):\r\n ans = min(ans, dist[vertexes[0]][vertexes[i]] + get_ans(vertexes[1:i] + vertexes[i + 1:]))\r\n return ans\r\n\r\ndef build_dijskatra(dist):\r\n for a in range(n): # this calculate is refer\r\n for x in range(n):\r\n for y in range(n):\r\n dist[x][y] = min(dist[x][y], dist[x][a] + dist[a][y])\r\n return dist\r\n \r\nn, m = map(int, input().split())\r\ngraph = [[] for _ in range(n)]\r\ntotal = 0\r\nmatr = [[INF] * n for _ in range(n)]\r\nfor i in range(m):\r\n a, b, w = map(int, input().split())\r\n graph[a - 1].append((b - 1, w))\r\n graph[b - 1].append((a - 1, w))\r\n matr[a - 1][b - 1] = matr[b - 1][a - 1] = min(matr[a - 1][b - 1], w)\r\n total += w\r\nodd = list(v for v in range(n) if len(graph[v]) % 2)\r\ndist = build_dijskatra(matr)\r\nans = get_ans(odd)\r\nif ans < INF and max([0] + [dist[0][a] for a in range(1, n) if len(graph[a]) > 0]) < INF:\r\n print(ans + total)\r\nelse:\r\n print(-1)" ]

[ "import math\r\nimport sys\r\nfrom bisect import bisect_right, bisect_left, insort_right\r\nfrom collections import Counter, defaultdict\r\nfrom heapq import heappop, heappush\r\nfrom itertools import accumulate\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\ndef dfs(tree, curr, parent):\r\n fn, fd = curr, 0\r\n for ch in tree[curr]:\r\n if ch != parent:\r\n nn, dd = dfs(tree, ch, curr)\r\n if dd + 1 > fd:\r\n fn, fd = nn, dd + 1\r\n return fn, fd\r\nres = 0\r\nfor t in range(int(input())):\r\n arr = list(map(int, input().split()))\r\n tree = [[] for i in range(arr[0] + 1)]\r\n for i in range(1, len(arr), 2):\r\n tree[arr[i]].append(arr[i + 1])\r\n tree[arr[i + 1]].append(arr[i])\r\n node = dfs(tree, 1, 1)[0]\r\n res += dfs(tree, node, node)[1]\r\nprint(res)", "from queue import Queue\r\n\r\n\r\ndef bfs(v, g, m):\r\n q = Queue()\r\n visit = [False] * m\r\n visit[v] = True\r\n q.put((v, 0))\r\n last = v, 0\r\n while not q.empty():\r\n v, l = q.get()\r\n for i in g[v]:\r\n if not visit[i]:\r\n q.put((i, l + 1))\r\n visit[i] = True\r\n if q.empty():\r\n last = v, l\r\n return last\r\n\r\n\r\nfin = ''.join(open('input.txt', 'r').readlines()).split('\\n')\r\nfout = open('output.txt', 'w')\r\nn = int(fin[0])\r\nres = 0\r\nfor i in range(n):\r\n mas = [int(j) for j in fin[1 + i].split()]\r\n g = {}\r\n for j in range(mas[0] - 1):\r\n a, b = mas[1 + j * 2] - 1, mas[2 + j * 2] - 1\r\n g[a] = g.get(a, [])\r\n g[b] = g.get(b, [])\r\n g[a].append(b)\r\n g[b].append(a)\r\n _, dist = bfs(bfs(0, g, mas[0])[0], g, mas[0])\r\n res += dist\r\nfout.write(str(res))\r\n", "f = open('input.txt', 'r')\r\nn = int(f.readline())\r\nh = 0\r\nfor _ in range(n):\r\n w = list(map(int, f.readline().split()))\r\n m = w[0]\r\n d = [[] for i in range(m)]\r\n for i in range(1, len(w), 2):\r\n a, b = w[i]-1, w[i+1]-1\r\n d[a].append(b)\r\n d[b].append(a)\r\n c = 0\r\n for i in range(m):\r\n x = [0]*m\r\n q = [(i, 0)]\r\n while q:\r\n a, b = q.pop()\r\n c = max(b, c)\r\n x[a] = 1\r\n for j in d[a]:\r\n if not x[j]:\r\n q.append((j, b+1))\r\n h += c\r\n\r\nf = open('output.txt', 'w')\r\nprint(h, file=f)\r\n", "# _\r\n#####################################################################################################################\r\n\r\nclass Spider(object):\r\n def __init__(self, info):\r\n self.__nBeads, *self.__threads = info\r\n self.__beads = range(1, self.__nBeads+1)\r\n self.__connections = tuple([] for _ in self.__beads) + ([], )\r\n for i, j in zip(range(0, len(self.__threads), 2), range(1, len(self.__threads), 2)):\r\n self.__connections[self.__threads[i]].append(self.__threads[j])\r\n self.__connections[self.__threads[j]].append(self.__threads[i])\r\n\r\n def __len__(self):\r\n return lengthOf(self.__connections, 1+self.__nBeads-max(map(len, self.__connections)),\r\n tuple(bead for bead in self.__beads if len(self.__connections[bead]) == 1))\r\n\r\n\r\ndef lengthOf(tree, maxLength, leaves):\r\n highestDistance = 0\r\n for i in range(len(leaves)-1):\r\n distance = furthestDistanceFrom(leaves[i], tree, leaves, set())\r\n if distance == maxLength:\r\n return distance\r\n if distance > highestDistance:\r\n highestDistance = distance\r\n\r\n return highestDistance\r\n\r\n\r\ndef furthestDistanceFrom(node, tree, leaves, usedNodes):\r\n usedNodes.add(node)\r\n try:\r\n return max(furthestDistanceFrom(neighbor, tree, leaves, usedNodes)\r\n for neighbor in tree[node]\r\n if neighbor not in leaves and neighbor not in usedNodes) + 1\r\n\r\n except ValueError:\r\n return 1\r\n\r\n\r\ndef main():\r\n return str(sum(map(spider_sLength, open('input.txt', 'r').readlines()[1:])))\r\n # return sum(map(spider_sLength, (input() for _ in range(int(input())))))\r\n\r\n\r\ndef spider_sLength(data):\r\n return len(Spider(map(int, data.split())))\r\n\r\n\r\nif __name__ == '__main__':\r\n # print(main())\r\n # main()\r\n open('output.txt', 'w').write(main())\r\n", "import collections\nimport sys\ndef treeDiameter(edges): \n if not edges:\n return 0\n graph = collections.defaultdict(list)\n for a,b in edges:\n graph[a].append(b)\n graph[b].append(a)\n\n startNode = min(graph.keys())\n visit = set()\n q = collections.deque([startNode])\n while q:\n for _ in range(len(q)):\n node = q.popleft()\n visit.add(node)\n for nei in graph[node]:\n if nei not in visit:\n q.append(nei)\n lastNode = node\n visit = set()\n distance = -1\n q = collections.deque([lastNode])\n while q:\n distance += 1\n for _ in range(len(q)):\n node = q.popleft()\n visit.add(node)\n for nei in graph[node]:\n if nei not in visit:\n q.append(nei)\n return distance\n\n\ndef main():\n \n sys.stdin = open(\"input.txt\",\"r\")\n lines = sys.stdin.readlines()\n N = int(lines[0].strip())\n res = 0\n for i in range(1,N+1):\n line = list(map(int,lines[i].strip().split()))\n s = line[0]\n edges = [[line[i],line[i+1]] for i in range(1,(s-1)*2,2)]\n res += treeDiameter(edges)\n sys.stdout = open(\"output.txt\",\"w\")\n sys.stdout.write(str(res))\n\nif __name__ == '__main__':\n main()\n\t\t \t \t\t \t \t\t \t \t \t \t\t", "from collections import defaultdict,deque\r\nwith open('input.txt') as f:\r\n lines = f.readlines()\r\nmax_length = 0\r\ndef bfs(graph,bead,visited):\r\n q = deque()\r\n q.append((0,bead)) #previous threads connected to current bead,bead \r\n while q:\r\n prev_threads,bead = q.popleft()\r\n visited.add(bead)\r\n for neighbours in graph[bead]:\r\n if neighbours not in visited:\r\n visited.add(neighbours)\r\n q.append((prev_threads + 1,neighbours)) \r\n return prev_threads\r\nfor line in lines[1:]:\r\n local_length = 0 \r\n graph = defaultdict(list)\r\n line = line.rstrip(\"\\n\").split(\" \") #removing newline\r\n index = 1 \r\n while index < len(line):\r\n graph[line[index]].append(line[index + 1]) #building graph per spider\r\n graph[line[index + 1]].append(line[index])\r\n index += 2\r\n for key in graph:\r\n if len(graph[key]) == 1:\r\n visited = set()\r\n res = bfs(graph,key,visited)\r\n local_length = max(local_length,res)\r\n max_length = max_length + local_length\r\nf = open(\"output.txt\", \"a\")\r\nf.write(f'{max_length}')\r\nf.close()\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\nsys.stdin = open(\"input.txt\",\"r\")\r\nsys.stdout = open(\"output.txt\",\"w\")\r\nn=int(input())\r\nans=0\r\ndef dfs(g,s,par):\r\n ret=[0,s]\r\n for to in g[s]:\r\n if to==par:\r\n continue\r\n nxt=dfs(g,to,s)\r\n nxt[0]+=1\r\n if ret[0]<nxt[0]:\r\n ret[0]=nxt[0]\r\n ret[1]=nxt[1]\r\n return ret\r\ndef diam(g):\r\n p=dfs(g,0,-1)\r\n q=dfs(g,p[1],-1)\r\n return q[0]\r\nfor i in range(n):\r\n ni,*l=map(int,input().split())\r\n gg=[[] for i in range(ni)]\r\n for i in range(ni-1):\r\n a,b=l[2*i]-1,l[2*i+1]-1\r\n gg[a].append(b)\r\n gg[b].append(a)\r\n ans+=diam(gg)\r\nprint(ans)", "f = open('input.txt', 'r').readlines()\r\nn = int(f[0])\r\ns = 0\r\nfor j in range(1, n + 1):\r\n *e, = map(int, f[j].split())\r\n k = e[0]\r\n g = {x: set() for x in range(1, k + 1)}\r\n for i in range(1, k):\r\n g[e[2 * i - 1]].add(e[2 * i])\r\n g[e[2 * i]].add(e[2 * i - 1])\r\n hax = 0\r\n for i in range(1, k + 1):\r\n vis = [0] * (k + 1)\r\n q = [(i, 0)]\r\n while q:\r\n v, h = q.pop()\r\n hax = max(hax, h)\r\n vis[v] = 1\r\n for i in g[v]:\r\n if not vis[i]:\r\n q.append((i, h + 1))\r\n s += hax\r\nopen('output.txt', 'w').write(str(s))", "import sys\r\n \r\ndef get_array(): return list(map(int , sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n \r\nfrom collections import defaultdict\r\n \r\ndef process(init,mydict,N):\r\n visited=[False]*(N+1)\r\n dia=[0]*(N+1)\r\n \r\n queue=[init]\r\n visited[init]=True\r\n while queue:\r\n element=queue.pop()\r\n for ele in mydict[element]:\r\n if not visited[ele]:\r\n visited[ele]=True\r\n dia[ele]=dia[element]+1\r\n queue.append(ele)\r\n \r\n index=-1\r\n maxi=-10**9+7\r\n for i in range(1,N+1):\r\n if dia[i]>maxi:\r\n maxi=dia[i]\r\n index=i\r\n \r\n return index,maxi\r\n \r\ndef diameter(mydict,N):\r\n init,value=process(1,mydict,N+1)\r\n end,value=process(init,mydict,N+1)\r\n return value\r\n \r\n# For getting input from input.txt file\r\nsys.stdin = open('input.txt', 'r')\r\n \r\n# Printing the Output to output.txt file\r\nsys.stdout = open('output.txt', 'w')\r\n \r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n Arr=get_array()\r\n N=Arr[0]-1\r\n mydict=defaultdict(list)\r\n for j in range(1,2*N,2):\r\n mydict[Arr[j]].append(Arr[j+1])\r\n mydict[Arr[j+1]].append(Arr[j])\r\n # print(mydict)\r\n ans+=diameter(mydict,N)\r\n # print(ans)\r\n \r\nprint(ans)", "import sys\r\nfrom typing import List\r\nfrom collections import deque\r\n\r\n\r\ndef bfs(g: List[List[int]], v: int):\r\n d = [10 ** 9] * len(g)\r\n d[v] = 0\r\n q = deque()\r\n q.append(v)\r\n while len(q) > 0:\r\n u = q.popleft()\r\n for v in g[u]:\r\n if d[v] == 10 ** 9:\r\n d[v] = d[u] + 1\r\n q.append(v)\r\n return d\r\n\r\n\r\ndef diameterTree(g: List[List[int]]):\r\n v = u = w = 0\r\n d = bfs(g, v)\r\n for i in range(len(g)):\r\n if d[i] > d[u]:\r\n u = i\r\n d = bfs(g, u)\r\n for i in range(len(g)):\r\n if d[i] > d[w]:\r\n w = i\r\n return d[w]\r\n\r\n\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n ls = [int(x) for x in input().split()]\r\n nn = ls[0]\r\n tree = [[] for _ in range(nn)]\r\n for j in range(nn - 1):\r\n u = ls[1 + j * 2] - 1\r\n v = ls[2 + j * 2] - 1\r\n tree[u].append(v)\r\n tree[v].append(u)\r\n ans += diameterTree(tree)\r\nprint(ans)", "import sys\n\nsys.stdin = open('input.txt', 'r')\ninput = sys.stdin.readline\n\ndef find_depth(n):\n if (dp[n] != -1):\n return dp[n]\n dp[n] = 0\n result = 0\n for i in range(len(spider[n])):\n result = max(result, find_depth(spider[n][i]))\n dp[n] = result + 1\n return dp[n]\n\nn = int(input().strip())\ntotal = 0\nfor i in range(n):\n inputs = list(map(int, input().strip().split()))\n jum_node = inputs[0]\n spider = [[] for i in range(jum_node + 1)]\n for i in range(jum_node-1):\n left = inputs[2*i + 1]\n right = inputs[2*i + 2]\n spider[left].append(right)\n spider[right].append(left)\n sub_total = 0\n for i in range(1, jum_node + 1):\n dp = [-1 for i in range(jum_node + 1)]\n sub_total = max(sub_total, find_depth(i))\n total = total + sub_total - 1\n\nsys.stdout = open('output.txt', 'w')\nsys.stdout.write(str(total))", "from collections import deque\r\n\r\n\r\nclass Graph:\r\n def __init__(self, vertices):\r\n self.vertices = vertices\r\n self.adj = {i: [] for i in range(self.vertices)}\r\n\r\n def addEdge(self, u, v):\r\n self.adj[u].append(v)\r\n self.adj[v].append(u)\r\n\r\n def BFS(self, u):\r\n visited = [False for i in range(self.vertices + 1)]\r\n distance = [-1 for i in range(self.vertices + 1)]\r\n distance[u] = 0\r\n queue = deque()\r\n queue.append(u)\r\n visited[u] = True\r\n\r\n while queue:\r\n front = queue.popleft()\r\n for i in self.adj[front]:\r\n if not visited[i]:\r\n visited[i] = True\r\n distance[i] = distance[front] + 1\r\n queue.append(i)\r\n\r\n maxDis = 0\r\n for i in range(self.vertices):\r\n if distance[i] > maxDis:\r\n maxDis = distance[i]\r\n nodeIdx = i\r\n\r\n return nodeIdx, maxDis\r\n\r\n def LongestPathLength(self):\r\n node, Dis = self.BFS(0)\r\n node_2, LongDis = self.BFS(node)\r\n\r\n return LongDis\r\n\r\n\r\nimport sys\r\nsys.stdin = open(\"input.txt\",\"r\")\r\nsys.stdout = open(\"output.txt\",\"w\")\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n l = list(map(int,input().split()))\r\n g = Graph(l[0])\r\n for i in range((len(l)-1)//2):\r\n g.addEdge(l[2*i + 1]-1, l[2*i + 2]-1)\r\n x = g.LongestPathLength()\r\n ans+=x\r\nprint(ans)", "import sys\r\nsys.stdin=open('input.txt','r')\r\nsys.stdout=open('output.txt','w')\r\nn=int(input())\r\nlength=0\r\ndef dfs(x,p):\r\n len=0\r\n for i in graph[x]:\r\n if i!=p:\r\n len=max(len,dfs(i,x)+1)\r\n return len\r\nfor i in range(n):\r\n max_len=1\r\n list=[int(i) for i in input().split()]\r\n vertex_num=list[0]\r\n graph = [[] for i in range(vertex_num + 1)]\r\n for j in range(1,vertex_num*2-1,2):\r\n graph[list[j]]+=[list[j+1]]\r\n graph[list[j+1]]+=[list[j]]\r\n for k in range(1,vertex_num+1):\r\n max_len=max(max_len,dfs(k,0))\r\n length+=max_len\r\nprint(length)\r\nsys.stdin.close()\r\nsys.stdout.close()\r\n", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n def bfs(g, s):\r\n used = [-1 for i in range(len(g))]\r\n used[s] = 0\r\n q = [s]\r\n it = 0\r\n\r\n while it < len(q):\r\n f = q[it]\r\n it += 1\r\n for u in g[f]:\r\n if used[u] == -1:\r\n used[u] = used[f] + 1\r\n q.append(u)\r\n\r\n return max(used)\r\n\r\n f = open(\"input.txt\", \"r\")\r\n\r\n n = int(f.readline())\r\n res = 0\r\n for i in range(n):\r\n k, *a = map(int, f.readline().split())\r\n g = [[] for i in range(k)]\r\n for j in range(k - 1):\r\n v, u = a[j * 2] - 1, a[j * 2 + 1] - 1\r\n g[v].append(u)\r\n g[u].append(v)\r\n mx = 0\r\n for i in range(k):\r\n mx = max(mx, bfs(g, i))\r\n res += mx\r\n\r\n f.close()\r\n f = open(\"output.txt\", \"w\")\r\n f.write(str(res))\r\n f.close()\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n" ]

[ "import math\r\nn,a,b=map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n x=(math.floor(arr[i]*a/b))\r\n arr[i]-=(math.ceil(x*b/a))\r\nprint(*arr)", "\"\"\"\r\nCodeforces Round 240 Div 1 Problem B\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\nclass InputHandlerObject(object):\r\n inputs = []\r\n\r\n def getInput(self, n = 0):\r\n res = \"\"\r\n inputs = self.inputs\r\n if not inputs: inputs.extend(input().split(\" \"))\r\n if n == 0:\r\n res = inputs[:]\r\n inputs[:] = []\r\n while n > len(inputs):\r\n inputs.extend(input().split(\" \"))\r\n if n > 0:\r\n res = inputs[:n]\r\n inputs[:n] = []\r\n return res\r\nInputHandler = InputHandlerObject()\r\ng = InputHandler.getInput\r\n\r\n############################## SOLUTION ##############################\r\nn,a,b = g()\r\nn,a,b = int(n),int(a),int(b)\r\nc = [int(x) for x in g()]\r\nr = []\r\nfor i in c:\r\n r.append(str(((i*a) % b) // a))\r\nprint(\" \".join(r))", "n,a,b = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nif a>b : print(*([0]*n))\r\nelse : \r\n for x in arr :print(((x*a)%b)//a,end = ' ')\r\n \r\n", "a,b,c=list(map(int,input().split()))\r\naa=list(map(int,input().split()))\r\n\r\n\r\nfrom math import gcd,floor\r\n\r\nfor i in aa:\r\n m=(i*b)%c\r\n print(m//b,end=\" \")\r\n\r\n\r\nprint()", "from math import floor, ceil\r\n\r\nn, a, b = map(int,input().split())\r\nk = list(map(int,input().split()))\r\nans = []\r\nans1 = []\r\nfor i in range(n):\r\n x = floor((k[i]*a)/b)\r\n const2 = ceil((x*b)/a)\r\n const = k[i]-const2\r\n ans1.append(const)\r\nprint(*ans1)", "from math import ceil\n\n\ndef gcd(a,b):\n if b == 0:\n return a\n else:\n return gcd(b, a%b)\n\nn,a,b=map(int,input().split())\nx=list(map(int,input().split()))\n# b=b//gcd(a,b)\nfor i in x:\n maxpos = (i*a)//b\n minreq = ceil((maxpos*b)/a)\n #print largest multiple of b that is less than or equal to i\n print(i-minreq,end=' ')\n\n \n", "from math import floor\r\n\r\nn, a, b = map(int, input().split())\r\nx = [int(c) for c in input().split()]\r\nans = [int(i - floor(i*a/b)* b / a) for i in x]\r\nprint(*ans)\r\n\r\n", "arr= []\r\narr2= []\r\nscann=input()\r\narr=scann.split()\r\nn=int(arr[0])\r\na=int(arr[1])\r\nb=int(arr[2])\r\nscann=input()\r\narr2=scann.split()\r\naux= []\r\nj=0\r\nk=0\r\nl=0\r\nfor i in range(n):\r\n j= int(arr2[i])*a\r\n k=j%b\r\n l=k/a\r\n aux.append(int(l)) \r\nprint(*aux)", "from sys import stdin\r\n\r\ndef get_data(n,a,b,coins):\r\n for co in coins:\r\n print(((co*a)%b)//a,end=' ')\r\n\r\ndef main():\r\n [n,a,b] = [int(x) for x in stdin.readline().split()]\r\n coins = [int(x) for x in stdin.readline().split()]\r\n get_data(n,a,b,coins)\r\n\r\nmain()", "def mymod(x,a,b):\r\n import math\r\n return x - math.ceil(int(x*a/b))*b/a\r\nn,a,b = map(int,input().strip().split())\r\nx= list(map(int,input().split()))\r\nfor q in x:\r\n print(int(mymod(q,a,b)),end= ' ')", "n,a,b=map(int,input().split())\r\narr=list(map(int,input().split()))\r\n\r\n\r\n\r\nfor i in range(n):\r\n arr[i]=(arr[i]*a)%b//a\r\n \r\n\r\n\r\nprint(arr[0],end='')\r\nfor i in range(1,len(arr)):\r\n print('',arr[i],end='')\r\n\r\nprint('')", "from math import floor\r\nn, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nfor i in range(int(n)):\r\n earn = floor(arr[i] * a / b)\r\n arr[i] = int(arr[i] - (earn / a * b))\r\n\r\nprint(*arr)", "n, a, b = map(int, input().split())\nx = [int(i) for i in input().split()]\n\ndef find_index(n):\n\tl = 0; r = n\n\twhile l < r:\n\t\tmid = (l+r)//2\n\t\tif (mid*a)//b == (r*a)//b:\n\t\t\tr = mid\n\t\telse:\n\t\t\tl = mid+1\n\treturn r\n\nfor i in range(n):\n\tprint(x[i]-find_index(x[i]), end = \" \")\n\nprint()", "#!/usr/bin/python3\r\n\r\nn, a, b = input().split(' ')\r\nn, a, b = int(n), int(a), int(b)\r\n\r\nINPUT = [int(x) for x in input().split(' ')]\r\n\r\nfor w in INPUT:\r\n\r\n res = (w * a) % b\r\n res //= a\r\n print(res, end = ' ')", "def Mashmokh(arr,a,b):\n arr1=[]\n for i in arr:\n if i % (a*b)==0:\n arr1.append(0)\n else:\n resultado=i-(b/a)*(i*a//b)\n arr1.append(int(resultado))\n arr_aux = \" \".join(map(str, arr1))\n return arr_aux\n\na1,a2,a3=input().split()\nn=int(a1)\na=int(a2)\nb=int(a3)\narr = list(map(int, input().strip().split()))\n\nprint(Mashmokh(arr,a,b))\n \t\t\t \t\t\t \t \t \t\t\t \t \t \t", "import math\r\nn,a,b=map(int,input().split())\r\nfor i in input().split(): \r\n print((int(i)-math.ceil(((int(i)*a)-((int(i)*a)%b))/a)),end=' ')\r\n", "n, a, b = map(int, input().split())\r\nfor i in map(int, input().split()):\r\n print(i * a % b // a, end=\" \")", "[n, a, b] = [int(x) for x in input().split()]\r\namount = [int(x) for x in input().split()]\r\nres = [0] * n\r\n\r\ncurr = 0\r\nfor i, day in enumerate(amount):\r\n s = int(day * a / b)\r\n tmp = int(s * b / a) if s * b % a == 0 else int(s * b / a) + 1\r\n res[i] = day + curr - tmp\r\nprint(\" \".join(map(str, res)))", "import math\r\nn, a, b =map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\nresults = []\r\n\r\nfor x in arr:\r\n\r\n rem = (x*a) % b\r\n k = math.floor(rem/a)\r\n results.append(k)\r\n\r\nprint(\" \".join(str(x) for x in results))", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Mashmokh and Tokens\"\r\n# Class: B\r\n\r\nimport sys\r\n\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, a, b = list(map(int, input().split()))\r\n for i in list(map(int, input().split())):\r\n l = 0 ; r = i ; ans = 0 ; z = i*a//b\r\n while l<=r:\r\n mid = (l + r) // 2\r\n if (i-mid)*a >= z*b:\r\n ans = max(ans, mid)\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n print(ans, end = \" \")\r\n\r\nif __name__ == \"__main__\":\r\n # for t in range(int(input())):\r\n Solve()", "def main():\r\n n, a, b = list(map(int, input().split()))\r\n x_list = list(map(int, input().split()))\r\n res = list()\r\n\r\n for x in x_list:\r\n res.append(str(x * a % b // a))\r\n\r\n print(' '.join(res))\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nfor i in w:\r\n print((i*a) % b // a, end=' ')", "R = lambda:map(int, input().split())\r\nn, a, b = R()\r\nprint(\" \".join(map(str, (((w * a) % b) // a for w in R()))))", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor x in arr:\r\n print(x - ((x * a // b) * b + a - 1) // a)\r\n", "i=input;d=int;n,a,b=map(d,i().split());print(\"\".join(f'{(x*a%b)//a} 'for x in map(d,i().split())))", "def fun():\r\n n, a, b = map(int, input().split())\r\n s = [int(x) for x in input().split()]\r\n for i in range(n):\r\n w = s[i]\r\n res = (w*a)//b\r\n l = -1\r\n for i in range(35, -1, -1):\r\n v = l+2**i\r\n if v <= w and (v*a)//b < res:\r\n l = v\r\n l += 1\r\n out = w-l\r\n print(out, end = \" \")\r\n\r\nt = 1\r\nfor i in range(t):\r\n fun()", "n,a,b= map(int,input().split())\nfor i in map(int,input().split()):\n print(i*a%b//a,end=\" \")\n\t\t\t \t\t \t\t\t \t\t \t\t \t\t\t", "n, a, b = map(int, input().split())\r\nt = [w - 1 - (((w * a) // b) * b - 1) // a for w in map(int, input().split())]\r\nprint(' '.join(map(str, t)))", "n, a, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nfor i in arr:\r\n\tmaxi = (i * a) // b\r\n\tlo, hi = 0, i \r\n\tans = 0 \r\n\twhile lo <= hi:\r\n\t\tmid = (hi + lo) // 2 \r\n\t\t#print(mid)\r\n\t\tif ((i - mid)*a) //b == maxi:\r\n\t\t\tans = mid \r\n\t\t\tlo = mid + 1\r\n\t\telse:\r\n\t\t\thi = mid - 1 \r\n\tprint(ans, end = ' ')", "n,a,b=map(int,input().split())\r\nfor i in input().split(): \r\n print(((int(i)*a)%b)//a,end=' ')\r\n", "n,a,b=map(int,input().split()) ; tokens=list(map(int,input().split()))\r\nfor i in tokens:\r\n dollars=i*a//b\r\n if dollars>0:\r\n print(str(int(i%(dollars*b/a))),end=\" \")\r\n else: print(str(i),end=\" \")", "n, a, b = map(int, input().split())\r\nlis = list(map(int, input().split()))\r\nfor i in lis:\r\n x = (i*a)%b\r\n print(int(x/a))\r\n\r\n# 4514905.465299336\r\n# 4514905.007024144\r\n\r\n", "n, a, b = map(int, input().split())\ncoins = map(int, input().split())\nresult = map(lambda x: str((x * a % b) // a), coins)\nprint(\" \".join(list(result)))\n", "n,a,b=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nfrom math import ceil as ceil,floor as floor \r\nfor i in l:\r\n rem=(i*a)%b \r\n print(floor(rem/a),end=' ')", "import math\r\nn, a, b = map(int, input().split())\r\nour_list = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(our_list[i] - (math.ceil(((our_list[i] * a) // b) * b / a)), end = ' ')", "n,a,b=map(int, input().split())\nx=list(map(int, input().split()))\n\n[print(el*a%b//a, end=' ') for el in x]\nprint('\\n')\n\t\t\t\t\t\t\t\t\t\t\t\t \t \t \t\t\t\t", "from math import *\r\nn,a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nans=[0]*n\r\nfor i in range(n):\r\n ans[i]=x[i]-ceil(int(x[i]*a/b)*b/a)\r\nprint(*ans)", "import math\nn,a,b = map(int,input().split())\nlst = list(map(int,input().split()))\nfor i in range(n):\n x = int(lst[i]-math.floor(lst[i]*a/b)*(b/a))\n print(x,end=' ')\n\t \t\t \t\t \t \t \t \t\t\t\t\t \t \t\t \t", "# https://codeforces.com/contest/415/problem/B\r\n\r\nimport sys\r\nread = sys.stdin.readline\r\nwrite = sys.stdout.write\r\n\r\nn,a,b = map(int, read().split())\r\narr = list(map(int, read().split()))\r\n\r\nfor x in arr:\r\n\tmx = x * a // b\r\n\tmn = (mx * b + a - 1) // a\r\n\twrite(str(x - mn) + ' ')", "n, a, b = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nfor each in x:\r\n print(each * a % b // a)\r\n", "from math import *\r\nn,a,b = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nfor i in l:\r\n\tx = i-ceil(((i*a//b)*b)/a)\r\n\tprint(x,end = \" \")\r\nprint()\r\n", "n, a, b=map(int, input().split())\r\narr=list(map(int, input().split()))\r\nfor i in range(n):\r\n\tstart, finish, hi=-1, 1000000000, arr[i]*a\r\n\thi//=b\r\n\twhile start+1<finish:\r\n\t\tmid=(start+finish)//2\r\n\t\tf=mid*a\r\n\t\tf//=b\r\n\t\tif f>=hi:\r\n\t\t\tfinish=mid\r\n\t\telse:\r\n\t\t\tstart=mid\r\n\tprint(arr[i]-finish, end=\" \")", "n, a, b = [int(c) for c in input().split()]\r\ndays = [int(c) for c in input().split()]\r\nres = []\r\n\r\nfor i in range(len(days)):\r\n p = (days[i] * a) % b\r\n f1 = int(p // a)\r\n res.append(f1)\r\n\r\nprint(' '.join(map(str,res)))", "arr= []\narr2= []\nscann=input()\narr=scann.split()\nn=int(arr[0])\na=int(arr[1])\nb=int(arr[2])\nscann=input()\narr2=scann.split()\naux= []\nj=0\nk=0\nl=0\nfor i in range(n):\n j= int(arr2[i])*a\n k=j%b\n l=k/a\n aux.append(int(l)) \nprint(*aux)\n \t\t\t \t\t\t \t \t\t\t\t\t \t\t\t\t \t \t", "import heapq\r\nimport string\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nread = lambda: map(lambda s: int(s), input().strip().split())\r\nreadi = lambda: int(input())\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, ceil, floor\r\nRANDOM = randint(1, 10 ** 9)\r\nclass Wrapper(int):\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\n'''\r\na,b\r\n'''\r\ndef check(m,a,b):\r\n base=(m*a)//b\r\n lo=0\r\n hi=m\r\n ans=m\r\n while lo<=hi:\r\n mid=(lo+hi)//2\r\n if (mid*a)//b==base:\r\n hi=mid-1\r\n ans=mid\r\n else:\r\n lo=mid+1\r\n return m-ans\r\nn,a,b=read()\r\nar=list(read())\r\nfor i in ar:\r\n print(check(i,a,b),end=\" \")\r\n", "import math\n_, a, b = list(map(int, input().split()))\njet = list(map(int, input().split()))\n\n\ndef jtd(w):\n #d = (w*a)//b\n j = (w*a)%b\n return j//a\n\nfor i in jet:\n print(int(jtd(i)), end=' ')\nprint()\n", "def binary_search(n,a,b):\r\n l=0\r\n r=n\r\n maxx=(n*a)//b\r\n while l<r:\r\n mid=(l+r)//2\r\n if (mid*a)//b<maxx:\r\n l=mid+1\r\n else:\r\n r=mid\r\n return l\r\n\r\nn,a,b=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\na1=[]\r\nfor i in l1:\r\n ans1=binary_search(i,a,b)\r\n a1.append(i-ans1)\r\nprint(*a1)\r\n", "import math\r\n\r\nn, a, b = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nans = []\r\nfor i in range(n):\r\n zap = (c[i] * a) // b\r\n ans.append(c[i] - math.ceil(zap * b / a))\r\nprint(*ans)", "R = lambda:map(int, input().split())\r\nn, a, b = R()\r\nfor w in R():\r\n print(w * a % b // a, end=\" \")", "import math\r\nn, a, b = map(int, input().split())\r\nx = [int(i) for i in input().split()]\r\nans = [0] * n\r\nfor i, w in enumerate(x):\r\n r = (w * a) // b\r\n ans[i] = w - math.ceil(r * b / a)\r\n if ans[i] < 0:\r\n ans[i] = 0\r\nprint(' '.join(str(i) for i in ans))\r\n", "def main():\r\n n, a, b = list(map(int, input().split()))\r\n X = list(map(int, input().split()))\r\n for i in range(n):\r\n X[i] = (X[i] * a) % b\r\n X[i] = (X[i]) // a\r\n print(*X)\r\n\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n ", "import math\r\nx=input(\"\").split(' ')\r\nx=[int(y) for y in x]\r\na= x[0]\r\nb=x[1]\r\nc=x[2]\r\nl=input(\"\").split(' ')\r\nstr2=\"\"\r\nl=[int(y) for y in l]\r\nfor g in range (0, a):\r\n t=l[g]\r\n if ((t*b)/c==math.floor((t*2)/c)):\r\n str2=str2+\"0 \"\r\n else:\r\n ttt= t*b\r\n equate=math.floor(ttt/c)\r\n if ((equate*c)%b==0):\r\n unawesome= equate*c/b\r\n str2=str2+str(int(t-unawesome))\r\n str2=str2+\" \"\r\n else:\r\n unawesome= math.floor(equate*c/b)+1\r\n str2=str2+str(int(t-unawesome))\r\n str2=str2+\" \"\r\nprint(str2)\r\n", "from bisect import bisect\nfrom sys import stdin, stdout\nrd = lambda: list(map(int, stdin.readline().split()))\nrds = lambda: stdin.readline().rstrip()\nii = lambda: int(stdin.readline())\nINF = 1 << 62\nmod = 10**9 + 7\n\nn, a, b = rd()\nxs = rd()\n\n#print('a',a,'b',b)\n\nans = []\nfor x in xs:\n # find min w so that w*a//b = x*a // b\n l = int(x - b // a - 1)\n r = x\n\n z = x*a // b\n while l < r:\n w = (l+r) // 2\n\n if w*a // b < z:\n l = w + 1\n else:\n r = w\n\n #print('x', x, 'l', l, 'r', r, 'w', w, 'x-r', x-r)\n ans.append(x-r)\n\n\nstdout.write(' '.join(map(str, ans)))\n#stdout.write(f'{res}')\n\n", "def tokens(n, a, b, arr):\n arrs = []\n for t in arr:\n c = (t * a) % b\n arrs.append(int(c / a))\n arr_aux = \" \".join(map(str, arrs))\n return arr_aux\n\n\nn, a, b = map(int, input().split())\narr = map(int, input().split())\nprint(tokens(n, a, b, arr))\n \t \t\t \t\t \t\t \t\t\t \t \t\t\t\t\t \t", "import sys\n\n\n[n,a,b] = map(int, sys.stdin.readline().split())\n\nbuttons = map(int, sys.stdin.readline().split())\n\nres = []\n\nfor x in buttons:\n\tmoney = int(1.0 * x * a / b)\n\t# print(\"money =\", money)\n\trest = x - 1.0 * money * b / a\n\t# print(\"rest =\", rest)\n\tres.append(int(rest))\n\nprint(\" \".join(map(str, res)))\n\n\n\n\n\n\n\n\n\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,a,b = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nans = []\r\nfor i in A:\r\n t = (i*a)%b\r\n ans.append(t//a)\r\n \r\nprint(*ans)\r\n\r\n", "n, a, b = map(int, input().split())\nfor w in map(int, input().split()):\n print(w*a % b//a, end=\" \")\n\n\n\n\n# Made By Mostafa_Khaled", "n, a, b = map(int, input().split(' '))\r\nd = b/a\r\narr = list(map(int, input().split(' ')))\r\nres = []\r\nfor x in arr:\r\n q = x//d\r\n r = x - q*d\r\n res.append(int(r))\r\nprint(' '.join([str(x) for x in res]))", "n,a,b = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nfor i in range(n):\r\n Max_money = (x[i] * a)//b\r\n Mn = (Max_money*b + (a- 1))//a\r\n print(x[i] - Mn, end = \" \")# 1691004971.4493392", "from math import gcd, floor\n\ndef f(a, b, w):\n x = ((w * a) // b) * b\n return floor(((w * a) - x) // a)\n\nn, a, b = input().split(\" \")\na, b, n = int(a), int(b), int(n)\nr = [str(f(a, b, int(i))) for i in input().split(\" \")]\nprint(\" \".join(r))", "n,a,b = map(int,input().split())\r\nv = list(map(int,input().split()))\r\nans = [0]*n\r\n\r\nfor i in range(n):\r\n ans[i] = v[i]*a%b//a\r\nprint(*ans)\r\n", "n, a, b = map(int, input().split())\r\nprint(*[((w * a) - (w * a) // b * b) // a for w in map(int, input().split())])", "n, a, b = map(int, input().split())\r\nfor i in input().split():\r\n i = int(i)\r\n r = b / a\r\n x = i // r\r\n print(int(i - r * x), end=' ')", "n,a,b = map(int,input().split())\r\ntokens = [i for i in map(int,input().split())]\r\nfor i in tokens:\r\n\tprint(((a*i)%b)//a,end = ' ')", "n, a, b = map(int, input().split())\r\ntokens = list(map(int, input().split()))\r\n\r\nans = []\r\nfor t in tokens:\r\n ans.append(((t * a) % b) // a)\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "n, a, b = map(int, input().split())\r\nd = [int(d) for d in input().split()]\r\nfor i in range(len(d)):\r\n x = (d[i] * a) % b\r\n k0 = x / a\r\n print(int(k0),end=\" \")", "n,a,b=map(int,input().split())\r\np=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(p[i]*a%b//a,end = ' ')", "from fractions import Fraction\r\n\r\n\r\n\r\n\r\nz=[int(i) for i in input().split()]\r\nn,a,b=z[0],z[1],z[2]\r\nx=[int(i) for i in input().split()]\r\nc=Fraction(a,b)\r\na=c.numerator\r\nb=c.denominator\r\ny=[0]*n\r\nfor i in range (n):\r\n if (x[i]*a//b)==0:\r\n y[i]=x[i]\r\n else:\r\n zz=x[i]%b\r\n y[i]=((zz*a)%b)//a\r\n \r\n\r\nprint(' '.join([str(j) for j in y]))\r\n \r\n", "n, a, b = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nprint(' '.join( str( ( ( xi * a ) % b ) // a ) for xi in x ) )", "import math\r\n\r\nn,a,b=map(int,input().split())\r\nxlist=[int(x) for x in input().split()]\r\nsavestring=''\r\n\r\nfor i in range(n):\r\n maxmoney=math.floor(xlist[i]*a/b)\r\n saves=xlist[i]-math.ceil(maxmoney*b/a)\r\n savestring+=str(saves)+' '\r\n \r\nprint(savestring)", "import math\nn,a,b=map(int,input().split())\nx=list(map(int,input().split()))\nans=[]\nfor i in x:\n s=(i*a)//b\n ans.append(i-math.ceil(((s*b)/a)))\n\nprint(*ans)\n", "import math\r\nn,a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor e in l:\r\n z=(e*a)//b\r\n s=e-math.ceil(z*b/a)\r\n print(s,end=\" \")\r\nprint()\r\n", "n,a,b=map(int,input().strip().split(' '))\r\nL=list(map(int,input().split(' ')))\r\nfor i in range(n):\r\n s=L[i]\r\n res=s*a//b \r\n j=int((s-b*res/a))\r\n print(j)", "import functools\r\nimport math\r\nimport sys\r\n\r\n\r\ndef In():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef mashtok():\r\n n, a, b = In()\r\n ans = []\r\n for i in input().split():\r\n ans.append(str((int(i) * a) % b // a))\r\n print(' '.join(ans))\r\nmashtok()\r\n", "def Mashmokh(arr,a,b):\r\n arr1=[]\r\n for i in arr:\r\n if i % (a*b)==0:\r\n arr1.append(0)\r\n else:\r\n resultado=i-(b/a)*(i*a//b)\r\n arr1.append(int(resultado))\r\n arr_aux = \" \".join(map(str, arr1))\r\n return arr_aux\r\n\r\na1,a2,a3=input().split()\r\nn=int(a1)\r\na=int(a2)\r\nb=int(a3)\r\narr = list(map(int, input().strip().split()))\r\n\r\nprint(Mashmokh(arr,a,b))", "import sys\n\nn, a, b = map(int, sys.stdin.readline().split())\nw_arr = map(int, sys.stdin.readline().split())\n\nprint(\" \".join( map(str, [(w * a % b) // a for w in w_arr] )))", "f=lambda: map(int, input().split())\r\nn,a,b=f()\r\nprint(' '.join([str(int(x*a%b/a)) for x in f()]))", "def main():\n n, a, b = map(int, input().split())\n l = list(map(int, input().split()))\n for i, x in enumerate(l):\n l[i] = x * a % b // a\n print(' '.join(map(str, l)))\n\n\nif __name__ == \"__main__\":\n main()\n" ]

[ "n = int(input())\r\nseq = [int(x) for x in input().split()]\r\n \r\ndef inseri(s, n):\r\n\tif n in s:\r\n\t\ts.remove(n)\r\n\t\tinseri(s, n+1)\r\n\telse:\r\n\t\ts.add(n)\r\n \r\n \r\ns = set()\r\nfor i in seq:\r\n\tinseri(s, i)\r\n \r\nm = max(s)\r\nprint(m-len(s)+1)", "n=int(input())\na=list(map(int,input().split()))\nb=set()\nfor i in a:\n\twhile i in b:\n\t\tb.remove(i)\n\t\ti+=1\n\tb.add(i)\nprint(max(b)-len(b)+1)\n\t \t \t\t \t \t \t\t\t\t\t \t\t \t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=set()\r\nfor i in a:\r\n\twhile i in b:\r\n\t\tb.remove(i)\r\n\t\ti+=1\r\n\tb.add(i)\r\nprint(max(b)-len(b)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nfor i in a:\r\n\twhile i in s:\r\n\t\ts.remove(i)\r\n\t\ti += 1\r\n\ts.add(i)\r\nprint(max(s) - len(s) + 1)", "from sys import stdin\n\nN = int(stdin.readline())\n\nnum = set()\n\nfor b in map(int, stdin.readline().split()):\n while b in num:\n num.remove(b)\n b += 1\n\n num.add(b)\n\nprint(max(num) - len(num) + 1)\n", "input()\r\na = list(map(int, input().split()))\r\nb = []\r\ni = j = 0\r\nwhile i < len(a):\r\n while j < len(a) and a[j] == a[i]:\r\n j += 1\r\n if (j - i) % 2 == 1:\r\n b += [a[i]]\r\n i = j - (j - i) // 2\r\n for k in range(i, j):\r\n a[k] += 1\r\nprint(b[-1] - len(b) + 1)", "n=int(input())\r\nst=set()\r\nfor e in map(int,input().split()):\r\n while(e in st):\r\n st.remove(e)\r\n e+=1\r\n st.add(e)\r\nprint(max(st)-len(st)+1)", "n = int(input())\nseq = [int(x) for x in input().split()]\n\n# print(seq)\n\ndef inseri(s, n):\n\tif n in s:\n\t\ts.remove(n)\n\t\tinseri(s, n+1)\n\telse:\n\t\ts.add(n)\n\n\ns = set()\nfor i in seq:\n\tinseri(s, i)\n\nm = max(s)\nprint(m-len(s)+1)\n# print(s)", "m, s, n = 0, set(), int(input())\r\nfor a in map(int, input().split()):\r\n while a in s:\r\n s.remove(a)\r\n a += 1\r\n s.add(a)\r\n m = max(m, a)\r\nprint(m - len(s) + 1)", "n = int(input())\nl = [int(i) for i in input().split()]\ndict = {}\nkeylist = []\nfor elem in l:\n if elem in dict:\n dict[elem] += 1\n else:\n dict[elem] = 1\n keylist.append(elem)\nfor elem in keylist:\n if dict[elem] > 1:\n nint = dict[elem]//2\n dict[elem] = dict[elem]%2\n cur = elem+1\n while nint > 0:\n if cur in dict:\n dict[cur]+=nint\n else:\n dict[cur]=nint\n keylist.append(cur)\n nint = dict[cur]//2\n dict[cur] = dict[cur]%2\n cur = cur+1\nmaior = max(keylist)\nsoma = 0\nfor key in keylist:\n soma+=dict[key]\nprint(maior-soma+1)\n\n \t\t \t\t\t\t \t\t\t\t \t \t\t \t\t \t\t", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\ny = s = x = 0\r\nfor i in map(int, stdin.readline().split()):\r\n if i == y: x += 1\r\n else:\r\n while x and i > y:\r\n if not x & 1: s += 1\r\n x >>= 1\r\n y += 1\r\n if i > y:\r\n s += i - y\r\n x, y = 1, i\r\n else: x += 1\r\nwhile x:\r\n if not x & 1: s += 1\r\n x >>= 1\r\nprint(s)", "n = int(input())\ns = list(map(int, input().split()))\n\ndef ins(_set, n):\n if n in _set:\n _set.remove(n)\n ins(_set, n+1)\n else:\n _set.add(n)\n\nss = set()\n\nfor i in s:\n ins(ss, i)\n\nm = max(ss)\n\nprint(m - len(ss) + 1)\n", "from sys import stdin\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\nread()\r\ns = set()\r\nfor x in read():\r\n while x in s:\r\n s.remove(x)\r\n x += 1\r\n s.add(x)\r\n\r\nprint ( max(s) - len(s) + 1 )\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n# print(a)\r\nb = set()\r\nfor i in a:\r\n\tj = i\r\n\twhile j in b:\r\n\t\tb.remove(j)\r\n\t\tj += 1\r\n\tb.add(j)\r\nprint(max(b) - len(b) + 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\ns=set()\r\n\r\nmx=0\r\ncnt=0\r\n\r\nfor i in a:\r\n k=int(i)\r\n while k in s :\r\n s.remove(int(k))\r\n cnt=cnt-1\r\n k=k+1\r\n s.add(k)\r\n if mx<k: mx=k\r\n cnt=cnt+1\r\n\r\nprint(mx-cnt+1)\r\n\r\n\r\n\r\n", "import io\r\nimport os\r\nimport sys\r\nfrom atexit import register\r\nimport random\r\nimport math\r\nimport itertools\r\n\r\n##################################### Flags #####################################\r\nDEBUG = True\r\nSTRESSTEST = False\r\n\r\n##################################### IO #####################################\r\n\r\nif not DEBUG:\r\n input = 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\r\n if type(tokens[tokens_next - 1]) == str:\r\n return tokens[tokens_next - 1]\r\n return tokens[tokens_next - 1].decode()\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(*argv, end='\\n'):\r\n for arg in argv:\r\n sys.stdout.write((str(arg) + ' ').encode())\r\n sys.stdout.write(end.encode())\r\n\r\n\r\n##################################### Helper Methods #####################################\r\ndef genTestCase():\r\n raise NotImplementedError\r\n\r\n\r\ndef bruteforce(a):\r\n raise NotImplementedError\r\n\r\n\r\ndef doStressTest():\r\n while True:\r\n curTest = genTestCase()\r\n mySoln = solve(curTest)\r\n bruteforceSoln = bruteforce(curTest)\r\n if mySoln != bruteforceSoln:\r\n print('### Found case ###')\r\n print(curTest)\r\n print(f'{mySoln} should have been: {bruteforceSoln}')\r\n return\r\n\r\n\r\ndef solve(a):\r\n s = set()\r\n for c in a:\r\n if c in s:\r\n t = c\r\n while t in s:\r\n s.remove(t)\r\n t += 1\r\n s.add(t)\r\n else:\r\n s.add(c)\r\n return max(s) - len(s) + 1\r\n\r\n\r\n##################################### Driver #####################################\r\n\r\nif __name__ == \"__main__\":\r\n if not DEBUG and STRESSTEST:\r\n raise Exception('Wrong flags!')\r\n\r\n if STRESSTEST:\r\n doStressTest()\r\n else:\r\n ### Read input here\r\n a = nextIntArr(nextInt())\r\n res = solve(a)\r\n print(res)\r\n\r\n sys.stdout.flush()", "n = int(input())\r\nI = map(int, input().split())\r\na = [];\r\nfor val in I:\r\n a.append(val);\r\nla = len(a);\r\nb = []; c = []; d = -1;\r\nfor i in range (0, la):\r\n if i == 0 or a[i] != a[i-1]:\r\n b.append(a[i]);\r\n c.append(1);\r\n d = d + 1;\r\n else:\r\n c[d] = c[d] + 1;\r\nd = d + 1;\r\ntot = 0; idx = 0;\r\nfor i in range(0, d):\r\n while idx < b[i]:\r\n if tot < 2:\r\n break;\r\n else:\r\n tot = int(tot / 2);\r\n idx = idx + 1;\r\n if idx < b[i]:\r\n idx = b[i];\r\n tot = c[i];\r\n else:\r\n tot = tot + c[i];\r\nwhile tot >= 2:\r\n tot = int(tot / 2);\r\n idx = idx + 1;\r\nidx = idx + 1;\r\nres = idx;\r\n#print (idx)\r\nst = []; tot = 0; idx = 0;\r\nfor i in range (0, d):\r\n while idx < b[i]:\r\n if tot == 0:\r\n break;\r\n else:\r\n if tot == 1:\r\n st.append(idx);\r\n tot = 0; idx = idx + 1;\r\n else:\r\n if tot % 2 == 1:\r\n st.append(idx);\r\n tot = int(tot / 2);\r\n idx = idx + 1;\r\n if idx < b[i]:\r\n idx = b[i]; tot = c[i];\r\n if tot % 2 == 1:\r\n st.append(idx);\r\n tot = int(tot / 2);\r\n idx = idx + 1;\r\n else:\r\n idx = b[i]; tot = tot + c[i];\r\n if tot % 2 == 1:\r\n st.append(idx);\r\n tot = int(tot / 2);\r\n idx = idx + 1;\r\nwhile tot > 0:\r\n if tot % 2 == 1:\r\n st.append(idx);\r\n tot = int(tot / 2);\r\n idx = idx + 1;\r\nlst = len(st);\r\nprint (res- lst)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def f(array):\r\n for i in range(len(array)-1):\r\n if array[i]==array[i+1]:\r\n return False\r\n else:\r\n return True\r\ndef g(array):\r\n array.sort()\r\n if f(array):\r\n return array\r\n else:\r\n i=0\r\n array2=[]\r\n while i<len(array)-1:\r\n if array[i]!=array[i+1]:\r\n array2.append(array[i])\r\n i+=1\r\n else:\r\n array2.append(array[i]+1)\r\n i+=2\r\n else:\r\n if i==len(array)-1:\r\n array2.append(array[-1])\r\n return g(array2)\r\nn=int(input())\r\narray=list(map(int,input().split()))\r\nans=g(array)\r\nprint(ans[-1]+1-len(ans))", "n=int(input())\r\ns=set()\r\nfor x in map(int, input().split()):\r\n while x in s:\r\n s.remove(x)\r\n x+=1\r\n s.add(x)\r\nprint(max(s)-len(s)+1)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\n\r\nfor x in a:\r\n if x not in s:\r\n s.add(x)\r\n else:\r\n while x in s:\r\n s.remove(x)\r\n x += 1\r\n s.add(x)\r\n\r\nprint(max(s)+1 - len(s))" ]

[ "n=int(input())\r\na=list(input().split())\r\nk=n//2\r\nfor i in range(0,k,2):\r\n a[i],a[n-i-1]=a[n-i-1],a[i]\r\nprint(*a)", "n = int(input())\na = list(map(int, input().split()))\nif n % 2 == 0:\n for i in range(n//2):\n if i % 2 == 0:\n print(a[-i - 1], end=' ')\n else:\n print(a[i], end=' ')\n for i in range(n//2, n):\n if i % 2 == 0:\n print(a[i], end=' ')\n else:\n print(a[-i - 1], end=' ')\nelse:\n for i in range(n):\n if i % 2 == 0:\n print(a[-i - 1], end=' ')\n else:\n print(a[i], end=' ')", "n=int(input())\r\nA=list(map(int,input().split()))\r\nfor i in range(0,n//2,2):\r\n A[i],A[n-i-1]=A[n-i-1],A[i]\r\nprint(*A)\r\n", "n,i = int(input()) ,0\r\nl = [int(x) for x in input().split()]\r\nwhile i < n//2:l[i],l[-(i+1)] ,i= l[-(i+1)],l[i],i+2\r\nprint(*l)", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(0,n//2,2):\r\n a[i],a[-1-i]=a[-1-i],a[i]\r\nprint(*a)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\ncubes = list(map(int, sys.stdin.readline().split()))\r\n\r\nif n % 2 == 0:\r\n\tfor c in range(0, n // 2, 2):\r\n\t\ttmp = cubes[c]\r\n\t\tcubes[c] = cubes[-1 - c]\r\n\t\tcubes[-1 - c] = tmp\r\nelse:\r\n\tfor c in range(0, n // 2 + 1, 2):\r\n\t\ttmp = cubes[c]\r\n\t\tcubes[c] = cubes[-1 - c]\r\n\t\tcubes[-1 - c] = tmp\r\n\r\n\r\nprint(\" \".join(map(str, cubes)))", "r = lambda : list(map(int, input().split()))\r\nn = int(input())\r\narr = r()\r\nfor i in range(n // 2):\r\n if i%2 == 0:\r\n temp = arr[i]\r\n arr[i] = arr[n-i-1]\r\n arr[n-i-1] = temp\r\n # print(arr)\r\nprint(*arr) ", "def solution():\n n = int(input())\n arr = list(map(int, input().split()))\n left = 0\n right = len(arr) - 1\n while left <= right:\n arr[left], arr[right] = arr[right], arr[left]\n left += 2\n right -= 2\n\n print(* arr)\n \n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\nmain()\n", "#764B\r\nimport math\r\nn =int(input())\r\na = list(map(int, input().split(\" \")))\r\nm = math.ceil(n/2)\r\nfor i in range(m):\r\n if i%2 == 1:\r\n a[i], a[n-i-1] = a[n-i-1], a[i]\r\na = a[::-1]\r\nprint(*a)\r\n", "N = int(input())\nnums = list(map(int, input().split()))\nfor i in range(0, N//2, 2):\n\tnums[i], nums[N-1-i] = nums[N-1-i], nums[i]\nprint(' '.join(map(str, nums)))\n", "n = int(input())\r\na = list(map(str, input().split()))\r\nx = n // 2\r\nfor i in range(0, x, 2): a[i], a[n - 1 - i] = a[n - 1 - i], a[i]\r\nprint(' '.join(a))", "import sys\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nmid = int(n/2)\r\npos = temp = straight = 0\r\nl = n-1\r\nfor i in range(mid):\r\n if i < mid:\r\n if straight == 0:\r\n temp = arr[i]\r\n arr[i] = arr[l]\r\n arr[l] = temp\r\n\r\n straight = 1\r\n\r\n else:\r\n straight = 0\r\n else:\r\n if n % 2 == 0:\r\n temp = arr[mid-1]\r\n arr[mid-1] = arr[mid]\r\n arr[mid] = temp\r\n l -= 1\r\nprint(*arr,sep=' ')\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n\r\n\r\ns = 0\r\ne = n-1\r\ni = 0\r\nwhile s<e:\r\n if i%2==0:\r\n arr[s], arr[e] = arr[e], arr[s]\r\n i+=1\r\n s+=1\r\n e-=1\r\n\r\n\r\nfor i in arr:\r\n print(i, end=\" \")", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nx = 0\r\ny = n - 1\r\n\r\nwhile x < y:\r\n temp = arr[x]\r\n arr[x] = arr[y]\r\n arr[y] = temp\r\n x += 2\r\n y -= 2\r\n\r\nprint(*arr, sep=\" \")\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ni = 0\r\nj = n-1\r\n \r\nwhile(i<j):\r\n a[i],a[j] = a[j],a[i]\r\n i += 2\r\n j -= 2\r\n \r\nprint(*a)", "n = int(input())\na = list(map(int,input().split()))\n\ni = 0\nj = n-1\n\nwhile(i<j):\n a[i],a[j] = a[j],a[i]\n i += 2\n j -= 2\n\nprint(*a)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile(i<n//2):\r\n t=l[i]\r\n l[i]=l[n-i-1]\r\n l[n-i-1]=t\r\n i+=2\r\nfor i in l:\r\n print(i,end=\" \")", "n = int(input())\na = [int(x) for x in input().split()]\nflip = True\nfor i in range(n//2):\n j = n - i -1 \n if flip:\n a[i], a[j] = a[j], a[i]\n flip = not flip\nfor ai in a:\n print(ai, end = ' ')\n\n", "\r\nn=int(input())\r\narr1=list(map(int,input().split()))\r\nfor i in range(0,n//2,2):arr1[i],arr1[n-i-1]=arr1[n-i-1],arr1[i]\r\nprint(*arr1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n//2):\r\n if(i%2==0):\r\n a[i],a[n-i-1] = a[n-i-1],a[i]\r\nprint(*a)\r\n", "n = int(input())\r\ns= list(map(int,input().split()))\r\nfor i in range(0, n // 2, 2):\r\n s[i], s[n - i - 1] = s[n - i - 1], s[i]\r\nprint(*s)", "def main():\r\n n = int(input())\r\n s = input().split()\r\n for i in range(n // 2, 0, -1):\r\n if i % 2 != 0:\r\n t = s[-i]\r\n s[-i] = s[i - 1]\r\n s[i - 1] = t\r\n print(*s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def solvingFunctionA(Arr):\r\n for i in range(0, int(len(Arr)/2), 2):\r\n Temp = Arr[i]\r\n Arr[i] = Arr[len(Arr)-i-1]\r\n Arr[len(Arr)-i-1] = Temp\r\n return Arr\r\n\r\n\r\nN = int(input())\r\nReader = input().split()\r\nA = []\r\nfor i in range(N):\r\n A.append(int(Reader[i]))\r\nA = solvingFunctionA(A)\r\nfor i in range(N):\r\n print(f\"{A[i]} \", end=\"\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nleft = 0\r\nright = n\r\n\r\nfor i in range(0,n//2,2):\r\n if i % 2 == 0:\r\n a[i], a[-i-1] = a[-i-1], a[i]\r\n\r\nprint(*a)", "n, a = int(input()), input().split()\r\nfor i in range(0, n // 2, 2):\r\n a[i], a[n - i - 1] = a[n - i - 1], a[i]\r\nprint(' '.join(a))", "n=int(input())\r\nli=list(map(int,input().split()))\r\nfor i in range((n+1)//2):\r\n if i%2==0:\r\n temp=li[n-i-1]\r\n li[n-i-1]=li[i]\r\n li[i]=temp\r\nprint(' '.join(str(x) for x in li))\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nfor i in range(int(n / 2)):\r\n if i % 2 == 0:\r\n t = arr[n - i - 1]\r\n arr[n - i - 1] = arr[i]\r\n arr[i] = t\r\nprint(*arr)\r\n", "n = int(input())\r\ns = [x for x in input().split()]\r\n#if n%2!=0:\r\ntop = (n+1)//2\r\n\r\nfor i in range(1,top+1,2):\r\n temp = s[i-1]\r\n s[i-1] = s[n-i]\r\n s[n-i] = temp\r\nprint(\" \".join(s))\r\n ", "n = int(input())\r\ncubes = input().split()\r\nfor i in range(n//2):\r\n if i == 0:\r\n cubes[0], cubes[-1] = cubes[-1], cubes[0]\r\n if i%2 == 0 and i >= 2:\r\n cubes[i], cubes[n-i-1] = cubes[n-i-1], cubes[i]\r\nprint(' '.join(cubes))\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\ncube = list(map(int,input().split()))\ni,j=0,-1\nwhile i<n//2:\n\tcube[i],cube[j]=cube[j],cube[i]\n\ti+=2\n\tj-=2\nprint(*cube)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ni = 0\r\nwhile i <= (n -(i + 1)):\r\n temp = a[i]\r\n a[i] = a[(n - i) - 1]\r\n a[(n - i) - 1] = temp\r\n i += 2\r\n \r\nfor i in range(n):\r\n print(a[i], end=\" \")", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(0, (n+1)//2, 2):\r\n arr[i], arr[n - i - 1] = arr[n - i - 1], arr[i]\r\nprint(*arr)\r\n", "n = int(input())\r\nX = list(map(int, input().split()))\r\ni = 0\r\nwhile i < (n / 2):\r\n if i % 2 == 0:\r\n X[i], X[-(i + 1)] = X[-(i + 1)], X[i]\r\n i += 1\r\nprint(*X)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nfor i in range(n//2):\r\n if (i%2==0):\r\n a[i], a[n-i-1]=a[n-i-1], a[i]\r\nprint (' '.join(str(x) for x in a))", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\nturn = 0\r\nt = n if n%2 == 0 else n+1\r\n\r\nfor i in range(t//2):\r\n if turn == 1:\r\n turn = 0\r\n else:\r\n lst[i], lst[n-i-1] = lst[n-i-1], lst[i]\r\n turn = 1\r\nprint(*lst)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Aug 20 02:41:17 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\n\r\nn=int(input(''))\r\narr=list(map(int, input().split()))\r\nflag=1\r\nsol=arr.copy()\r\nif n&1:\r\n lim=n//2+1\r\nelse:\r\n lim=n//2\r\nfor j in range(lim):\r\n if flag:\r\n sol[j]=arr[n-j-1]\r\n sol[n-j-1]=arr[j]\r\n flag=0\r\n else:\r\n flag=1\r\nprint(*sol)", "import copy\nn = int(input())\narr = list(map(int, input().split(' ')))\nnarr = copy.copy(arr)\nmid = (n+1)//2\n\nfor i in range(0, mid, 2):\n narr[i] = arr[n-1-i]\n narr[n-1-i] = arr[i]\n\nprint(' '.join(map(str, narr)))\n", "n,r=int(input()),[*map(int,input().split())]\r\nfor i in range(0,n//2,2):\r\n r[i],r[~i]=r[~i],r[i]\r\nprint(*r)\r\n", "i=0\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif(n%2):\r\n while(i<n):\r\n if(i%2==0):print(a[n-i-1],end=\" \")\r\n else: print(a[i],end=\" \")\r\n i+=1\r\nelse:\r\n while(i<n):\r\n if(i%2==0):\r\n if(i<n//2):print(a[n-i-1],end=\" \")\r\n else:print(a[i],end=\" \")\r\n else:\r\n if(i<n//2):print(a[i],end=\" \")\r\n else:print(a[n-i-1],end=\" \")\r\n i+=1", "# -*- coding: utf-8 -*-\r\nimport sys\r\nimport math\r\n\r\nclass Solver(object):\r\n def run(self):\r\n n = int(input())\r\n a = [int(i) for i in input().split(' ')]\r\n for i in range(0, int(n/2), 2):\r\n tmp = a[i]\r\n a[i] = a[n-i-1]\r\n a[n-i-1] = tmp\r\n print(' '.join(str(i) for i in a))\r\n\r\n####################################\r\n# library\r\n\r\ndef gcd(a, b): return math.gcd(a, b)\r\ndef lcm(a, b): return abs(a, b) / gcd(a, b) if a and b else 0\r\n\r\nif __name__ == '__main__':\r\n Solver().run()\r\n", "# timofey and cubes\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ni=1\r\nwhile i<=n+1-i:\r\n \r\n l[i-1],l[n-i]=l[n-i],l[i-1]\r\n i+=2\r\nfor i in l:\r\n print(i,end=\" \")\r\n\r\n", "n = int(input().strip())\narr = list(map(int, input().strip().split()))\ni = 0\nj = n-1\nwhile i < j:\n\tif i % 2 == 0:\n\t\tarr[i], arr[j] = arr[j], arr[i]\n\ti += 1\n\tj -= 1\nprint(*arr)", "def solve(n: int, l: list) -> list:\r\n i=0\r\n while i<n//2:\r\n if i%2==0:\r\n l[i],l[n-1-i]=l[n-1-i],l[i]\r\n i=i+1\r\n s=\" \".join(l)\r\n return(s)\r\n\r\n\r\nn=int(input())\r\nl=input().split(\" \")\r\nprint(solve(n, l))", "n=int(input())\r\nl=list(map(str,input().split()))\r\ni=0\r\nwhile(i<=n-1-i):\r\n if(i%2==0):\r\n l[i],l[n-1-i]=l[n-1-i],l[i]\r\n i+=1\r\nfor i in l:\r\n print(i,end=\" \")\r\nprint()", "n = int(input())\r\nmodified_line = [int(x) for x in input().split()]\r\ni = 1\r\nwhile i <= n - i + 1:\r\n modified_line[i - 1], modified_line[-i] = modified_line[-i], modified_line[i - 1]\r\n i += 2\r\nprint(*modified_line)", "n = int(input())\r\nl=[]\r\nl = list(map(int,input().split()))\r\nf = -1\r\nfor i in range(0,n//2,2):\r\n tmp = l[i]\r\n l[i] = l[f]\r\n l[f] = tmp\r\n f = f-2\r\nprint(' '.join(map(str, l)))", "\r\nR = lambda:map(int,input().split())\r\n\r\nn, = R()\r\n\r\narr = list(R())\r\nfor i in range(1, n//2+1, 2):\r\n arr[i-1], arr[-i] = arr[-i], arr[i-1]\r\n \r\nprint(*arr)", "x=int(input())\r\ns=list(map(int,input().split()))\r\nfor n in range(x//2):\r\n if n%2==0:\r\n t=s[n]\r\n s[n]=s[x-1-n]\r\n s[x-1-n]=t\r\nprint(*s)", "n = int(input())\r\narr = list(map(int,input().split(\" \")))\r\nfor i in range(0,n//2,2):\r\n\tarr[i], arr[n-i-1] = arr[n-i-1],arr[i]\r\nprint(*arr)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\nmid = n // 2\r\nfor j in range(mid):\r\n if i % 2 == 0:\r\n t = a[i]\r\n a[i] = a[n - i - 1]\r\n a[n - i - 1] = t\r\n i += 1\r\n \r\nfor j in range(n):\r\n print(a[j], end=\" \")\r\n", "n = int(input())\r\narr = input().split()\r\n \r\nfor i in range(0, n//2, 2):\r\n arr[i], arr[n-1-i] = arr[n-1-i], arr[i]\r\n \r\nprint(' '.join(arr))", "n = int(input())\ncubes = list(map(int, input().split()))\n\nfor i in range(n//2):\n if not i % 2:\n cubes[i], cubes[n - i - 1] = cubes[n - i - 1], cubes[i]\n\nprint(*cubes)\n", "n = int(input())\r\na = list(map(int, input().split()[:n]))\r\ni, j = 0, len(a) - 1\r\n#for evens\r\nright = len(a) // 2\r\nleft = right - 1\r\n#for odds\r\nmid = (len(a) // 2)\r\n\r\nif len(a) % 2 == 0:\r\n while i <= left and j >= right:\r\n b = a[j]\r\n a[j] = a[i]\r\n a[i] = b\r\n i += 2\r\n j -= 2\r\nelse:\r\n while i < mid and j > mid:\r\n b = a[j]\r\n a[j] = a[i]\r\n a[i] = b\r\n i += 2\r\n j -= 2\r\nprint(' '.join(str(x) for x in a))\r\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nans=[0]*(n)\r\nif n%2!=0:\r\n j=n-1\r\n for i in range(n):\r\n if i%2==0:\r\n ans[j]=lis[i]\r\n j-=2\r\n else:\r\n ans[i]=lis[i]\r\n print(*ans)\r\nelse:\r\n j=n-1\r\n i=0\r\n while i<n//2:\r\n if i%2==0:\r\n ans[j]=lis[i]\r\n ans[i]=lis[j]\r\n else:\r\n ans[i]=lis[i]\r\n ans[j]=lis[j]\r\n i+=1\r\n j-=1\r\n print(*ans) \r\n \r\n\r\n \r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nb = [0] * n\r\nfor i in range(n//2):\r\n cnt += 1\r\n b[i] = cnt % 2\r\n b[n-i-1] = cnt % 2\r\nfor i in range(n):\r\n if b[i]:\r\n print(a[n-i-1], end = ' ')\r\n else:\r\n print(a[i], end = ' ')\r\n ", "n = (int(input()))\r\nl = list(map (int, input().split()))\r\nk = n//2\r\nfor i in range(k):\r\n if i%2 == 0:\r\n l[i], l[len(l)-1-i] = l[len(l)-1-i] , l[i]\r\nprint(' '.join(map(str, l)))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni,j=0,n-1\r\nwhile i<=j:\r\n l[i],l[j]=l[j],l[i]\r\n i+=2\r\n j-=2\r\nfor i in l:\r\n print(i,end=\" \")\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ni = 0\r\nj = n-1\r\ncount = 0\r\nwhile i<j:\r\n if count%2==0:\r\n a[i],a[j] = a[j],a[i]\r\n i+=1\r\n j-=1\r\n count+=1\r\nprint(*a)\r\n", "n = int(input())\r\na = [i for i in input().split()]\r\nfor i in range(n // 2):\r\n if not i & 1:\r\n a[i], a[n - i - 1] = a[n - 1 - i], a[i]\r\nprint(*a)", "n = int(input())\r\narr = input().split(' ')\r\ni, j = 0, n - 1\r\nwhile i < j:\r\n arr[i], arr[j] = arr[j], arr[i]\r\n i += 2\r\n j -= 2\r\nprint(' '.join(arr))", "N = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(N):\r\n if i > N - i - 1:\r\n break\r\n else:\r\n if i % 2 == 0:\r\n a[i], a[N - i - 1] = a[N - i - 1], a[i]\r\n\r\nprint(*a)", "n=int(input())\r\na=input().split()\r\nb=\"\"\r\nl,r=0,n-1\r\nwhile l<r:\r\n a[l],a[r]=a[r],a[l]\r\n l+=2\r\n r-=2\r\nfor i in range(len(a)):\r\n b+=a[i]\r\n b+=\" \"\r\nprint(b)\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\ni = 0\nwhile i < n - 1 - i:\n arr[i], arr[n - 1 - i] = arr[n - 1 - i], arr[i]\n i += 2\n\nprint(*arr)", "def solve():\r\n n=int(input());a=list(map(int,input().split()))\r\n for i in range(n//2):\r\n if (i+1)%2!=0:\r\n temp=a[i];a[i]=a[-(i+1)];a[-(i+1)]=temp;continue\r\n continue\r\n print(*a)\r\nsolve()", "n=int(input())\r\nm=[int(x) for x in input().split()]\r\nl=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n l[i]=m[i-1]\r\nk=int(n/2)\r\nfor j in range (1,k+1):\r\n if j%2!=0:\r\n t=l[j]\r\n l[j]=l[n+1-j]\r\n l[n+1-j]=t\r\nfor i in range (1,n+1):\r\n print(l[i] ,end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\n\na = input().split()\n\ntimes = (n + 1)//2 \n\na = a[::-1]\n\nfor x in range(1,times):\n if x%2 != 0 :\n hold = a[x]\n y = (-1*x)-1\n a[x] = a[y]\n a[y] = hold\n else:\n pass\n\nprint (\" \".join(a))\n \n\n\n\n \n \n\n \n \n \n\n", "n, l = int(input()), input().split()\nfor i, j in zip(range(0, n, 2), range(n - 1, n // 2 - (n % 4 == 2), -2)):\n l[i], l[j] = l[j], l[i]\nprint(' '.join(l))", "def get():\r\n return list(map(int, input().split()))\r\ndef intput():\r\n return int(input())\r\ndef main():\r\n n=intput()\r\n arr=get()\r\n i=1\r\n for i in range(n//2):\r\n if (not i&1 ):\r\n arr[i],arr[n-1-i]= arr[n-1-i],arr[i]\r\n print(*arr)\r\n \r\nmain()", "from math import ceil as c\r\nn,l=int(input()),list(map(int,input().split()))\r\nfor x in range(c(n/2)):\r\n\tif x%2==0:l[x],l[n-x-1]=l[n-x-1],l[x]\r\nprint(*l)", "'''input\n8\n6 1 4 2 5 6 9 2\n'''\nn = int(input())\ns = list(map(int, input().split()))\nr = s[0::2]\nif n % 2 == 1:\n\tfor x in range(0,n,2):\n\t\ts[x] = r.pop()\n\tprint(\" \".join(map(str, s)))\nelse:\n\tt = s[::-1]\n\tfor x in range(0,n//2,2):\n\t\ts[x], s[n-x-1] = s[n-x-1], s[x]\n\tprint(\" \".join(map(str, s)))\n\n\n\n\n\n\n", "#!/bin/python3\nimport sys\n\nsys.stdin.readline()\ncubes = [int(x) for x in map(str.strip, sys.stdin.readline().split(' '))]\ni = 0\nwhile i < len(cubes)//2:\n n = i + 1\n if n % 2:\n tmp = cubes[i]\n cubes[i] = cubes[len(cubes) - i - 1]\n cubes[len(cubes) - i - 1] = tmp\n i+=1\n\nprint(' '.join(str(x) for x in cubes))\n\n", "def cubes(lst):\r\n for i in range(len(lst) // 2):\r\n if i % 2 == 0:\r\n lst[i], lst[len(lst) - i - 1] = lst[len(lst) - i - 1], lst[i]\r\n return lst\r\n\r\n\r\nn = int(input())\r\na = [int(j) for j in input().split()]\r\nprint(*cubes(a))\r\n", "#n, t = map(int, input().split(' '))\r\nn=input()\r\nnums=[int(s) for s in input().split()]\r\nnums2=[]\r\nnums2.extend(nums)\r\nn=len(nums)\r\n\r\nif n>=2:\r\n for i in range(0, len(nums)//2,2):\r\n nums[i], nums[n-i-1]=nums[n-i-1], nums[i] \r\n for elem in nums:\r\n print(elem, end=' ')\r\n \r\nelse:\r\n print(nums[0])\r\n", "n = int(input())\r\nbricks = list(map(int, input().split()))\r\nfor i in range(0, n // 2, 2):\r\n bricks[i], bricks[n - i - 1] = bricks[n - i - 1], bricks[i]\r\nprint(*bricks)", "\r\nn = int(input())\r\n\r\nnumbers = [int(x) for x in input().split()]\r\nperm = [0 for i in range(n)]\r\ncnt = n // 2\r\n\r\nfor i in range((n // 2) -1 ,-1,-1):\r\n perm[i] = cnt\r\n perm[n-i-1] = cnt\r\n cnt -= 1\r\n\r\nfor i in range(n):\r\n if perm[i]%2==0:\r\n print(numbers[i],end=' ')\r\n else:\r\n print(numbers[n - i - 1], end=' ')\r\n\r\nprint()\r\n", "n = int(input())\n#n, m = map(int, input().split())\n#s = input() \na = list(map(int, input().split()))\nfor i in range(0, (n - 1) // 2 + 1, 2):\n a[i], a[n - i - 1] = a[n - i - 1], a[i]\nprint(*a)\n ", "n = int(input())\r\na = [None] + list(map(int, input().split()))\r\nfor i in range(1, (n+2)//2, 2):\r\n t = a[i]\r\n a[i] = a[n-i + 1]\r\n a[n + 1 - i] = t\r\nprint(' '.join(map(str, a[1:])))", "total = 0\nnums = []\n\ndef inp():\n global total, nums\n total = int(input())\n i = input()\n nums = i.split(' ')\n nums = [int(num) for num in nums]\n\ndef solve():\n global total, nums\n mid = int(total/2)\n rs = nums[:]\n for i in range(1, mid+1):\n if i % 2 != 0:\n rs[i-1] = nums[total - i]\n rs[total - i] = nums[i - 1]\n continue\n rs[i - 1] = nums[i - 1]\n rs[total - i] = nums[total - i]\n\n return rs\n\ndef printrs(rs):\n for i in range(len(rs)):\n if i == len(rs) - 1:\n print(rs[i])\n return\n print(rs[i], end=' ')\n\nif __name__=='__main__':\n\n inp()\n rs = solve()\n printrs(rs)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/764/B\r\n\r\nn = int(input())\r\nl_c = input().split()\r\n\r\nh = (n + 1) // 2 - 1\r\n\r\nfor i in range(n // 2):\r\n if i % 2 == 0:\r\n t = l_c[i]\r\n l_c[i] = l_c[n - i - 1]\r\n l_c[n - i - 1] = t\r\n\r\nprint(\" \".join(l_c))", "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\ncubes = inlt()\r\n\r\nfor i in range(N // 2):\r\n if i % 2 == 0:\r\n cubes[i], cubes[N - i - 1] = cubes[N - i - 1], cubes[i]\r\n\r\nfor i in range(N):\r\n if i == N - 1:\r\n print(cubes[i])\r\n else:\r\n print(f\"{cubes[i]}\", end=\" \")\r\n", "import sys\r\nimport inspect\r\nimport re\r\nimport math\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 10**15\r\n\r\n\r\ndef deb(p):\r\n for line in inspect.getframeinfo(inspect.currentframe().f_back)[3]:\r\n m = re.search(r'\\bdeb\\s*\\(\\s*([A-Za-z_][A-Za-z0-9_]*)\\s*\\)', line)\r\n print('%s %d' % (m.group(1), p))\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n for i in range(n // 2):\r\n if i % 2 == 0:\r\n a[i], a[n - i - 1] = a[n - i - 1], a[i]\r\n print(' '.join(map(str, a)))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(0, n // 2, 2):\r\n arr[i], arr[n-i-1] = arr[n-i-1], arr[i]\r\nprint(*arr)\r\n", "from sys import stdout\n\nn=int(input())\nnums=list(map(int,input().split()))\n\nfor i in range(n//2):\n\tif (i%2==0):\n\t\tnums[i],nums[-i-1]=nums[-i-1],nums[i]\nstdout.write(str(nums[0]))\nfor k in range(1,n):\n\tstdout.write(' '+str(nums[k]))\nstdout.write('\\n')", "n = int(input())\r\n\r\ndaf = list(map(int, input().split()))\r\nhas = daf[:]\r\n\r\nfor i in range(0,n//2,2):\r\n has[i], has[n-i-1] = daf[n-i-1], daf[i]\r\n\r\nprint(*has)\r\n", "n = int(input())\nv = input().split()\nfor i in range(0, n // 2):\n if i % 2 == 1:\n continue\n t = v[i]\n v[i] = v[~i]\n v[~i] = t\nprint(*v)\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nfor i in range(1,n//2+1):\r\n if i%2==1:\r\n a[i-1],a[n-i]=a[n-i],a[i-1]\r\n # print(i-1,n-i)\r\nprint(*a)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nt=0\r\nfor i in range((n+1)//2):\r\n if i%2==0:\r\n t=a[i]\r\n a[i]=a[n-i-1]\r\n a[n-1-i]=t\r\nprint(*a)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n//2):\r\n if(x==0):\r\n a[i],a[n-i-1]=a[n-i-1],a[i]\r\n x=1\r\n else:\r\n x=0\r\nprint(*a)\r\n", "x = int(input())\r\nlista = list(map(int, input().split()))\r\n\r\nfor i in range(x//2):\r\n if(i%2==0):\r\n lista[i], lista[x-1-i] = lista[x-i-1], lista[i]\r\n \r\nprint(*lista)", "# https://codeforces.com/problemset/problem/764/B\r\n\r\nn = int(input())\r\ncubes = list(map(int,input().split()))\r\n\r\ni = 0\r\nj = n-1\r\nwhile i < j :\r\n if i %2 ==0:\r\n cubes[i],cubes[j] = cubes[j] , cubes[i]\r\n i +=1\r\n j -=1\r\n\r\nprint(*cubes, sep = \" \")", "import sys\r\n\r\ndef swap(a, b):\r\n\tt = a\r\n\ta = b\r\n\tb = t\r\n\treturn int(a), int(b)\r\n\r\nn = int(input())\r\nL = list(input().split())\r\n\r\nfor i in range(0, n//2):\r\n\tif(i%2 == 0):\r\n\t\tL[i], L[n-1-i] = swap(L[i], L[n-1-i])\r\n\t\r\nfor x in L:\r\n\tsys.stdout.write(str(x))\r\n\tsys.stdout.write(' ')", "if __name__ == '__main__':\r\n n = int(input())\r\n line = list(map(str, input().split()))\r\n for i in range(0, n // 2):\r\n if i % 2 == 0:\r\n line[i], line[n - 1 - i] = line[n - 1 - i], line[i]\r\n print(' '.join(line))\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nh, t = [], []\r\nfor i in range(n//2):\r\n x, y = lst[i], lst[n-1-i]\r\n if i % 2 == 0:\r\n h.append(y)\r\n t.append(x)\r\n else:\r\n h.append(x)\r\n t.append(y)\r\nif n % 2 == 1:\r\n h.append(lst[n//2])\r\nt.reverse()\r\nres = h + t\r\nprint(\" \".join(str(x) for x in res))", "n = int(input())\r\nl = list(map(int , input().split()))\r\ni=0\r\nwhile i<len(l)//2:\r\n t = l[i]\r\n l[i] = l[n-i-1]\r\n l[n-i-1]=t\r\n i = i+2\r\nprint(*l)\r\n", "n=int(input())\r\nnumber=list(map(int,input().split()))\r\nif n%2==0:\r\n mid=int(n//2)\r\nelse:\r\n mid=int((n+1)//2)\r\nfor i in range(1,mid+1):\r\n if i%2!=0:\r\n number[i-1],number[n-i]=number[n-i],number[i-1]\r\n \r\nfor i in number:\r\n print (i,end=' ')", "N = int(input())\r\nl = list(map(int, input().split()))\r\n\r\ni = 0\r\nLEN = len(l)\r\nwhile i < LEN -i -1:\r\n if i%2 == 0:\r\n l[i], l[LEN -i -1] = l[LEN -i -1], l[i]\r\n i += 1\r\nprint(' '.join(map(str, l)))", "n, a = int(input()), input().split()\r\nfor i in range(0, n // 2, 2):\r\n a[i], a[n-i-1] = a[n-i-1], a[i]\r\nprint(*a)", "def main():\n n = int(input())\n numbers = [int(_) for _ in input().split()]\n\n for i in range(0, n // 2, 2):\n j = n - 1 - i\n temp = numbers[i]\n numbers[i] = numbers[j]\n numbers[j] = temp\n\n print(' '.join(list(str(number) for number in numbers)))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nlast = True\r\nleft, right = 0, n - 1\r\nwhile left < right:\r\n if last:\r\n arr[left], arr[right] = arr[right], arr[left]\r\n last = False\r\n else:\r\n last = True\r\n left += 1\r\n right -= 1\r\nprint(*arr)\r\n", "from math import ceil\r\nn = int(input())\r\narr= list(map(int,input().split()))\r\nt = ceil(n/2)\r\nfor k in range(t):\r\n if k % 2 == 0:\r\n c = arr[k]\r\n arr[k] = arr[n-k-1]\r\n arr[n-k-1] = c\r\n \r\nprint(*arr) ", "n = int(input())\r\na = list(map(int , input().split()))\r\nok = True\r\nif (ok):\r\n for i in range(n//2):\r\n if (i % 2 == 0):\r\n a[i], a[n-i-1] = a[n-i-1], a[i]\r\n print(*a)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nk = int(round(n/2))\r\nfor i in range(k):\r\n if (i+1)%2 == 1:\r\n l[i], l[n-1-i] = l[n-1-i], l[i]\r\ns = ''\r\nfor i in range(n):\r\n if i == n-1:\r\n s += str(l[i])\r\n else:\r\n s += str(l[i]) + ' '\r\nprint(s)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(0,int(n/2),2):\r\n arr[i],arr[n-i-1]=arr[n-i-1],arr[i]\r\n\r\nprint(*arr)", "n = int(input())\r\na = list(map(int,input().strip().split()[:n]))\r\n\r\nfor i in range(0,int(n/2),2):\r\n\ta[i],a[n-i-1] = a[n-i-1],a[i]\r\n\r\nfor i in a:\r\n\tprint(i,end=' ')", "n = int(input())\r\na = [x for x in map(int,input().split())]\r\nfor i in range(0,n//2,2):\r\n a[n-i-1],a[i] = a[i],a[n-i-1]\r\nprint(*a)\r\n", "n=int(input())\r\nL=list(map(int, input().split()))\r\nfor i in range(0, n, 2):\r\n if 2*i+1 > n:\r\n break\r\n r=L[i]\r\n L[i]=L[n-1-i]\r\n L[n-1-i]=r\r\n \r\nfor i in range(0, n):\r\n print(\"{0} \".format(L[i]),end='')\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nj=n-1\r\nwhile i<j:\r\n l[i],l[j]=l[j],l[i]\r\n i+=2\r\n j-=2\r\nprint(*l)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nif n%2==0:\r\n x=n//2-1\r\nelse:\r\n x=n//2\r\ni=0\r\nwhile i<n//2:\r\n l[i],l[-i-1]=l[-i-1],l[i]\r\n i=i+2\r\nprint(*l)\r\n", "import sys\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nf = 0\r\nl = n - 1\r\nwhile (f < l):\r\n temp = arr[f]\r\n arr[f] = arr[l]\r\n arr[l] = temp\r\n\r\n f += 2\r\n l -= 2\r\n\r\nprint (*arr,sep=' ')\r\n\r\n", "n = int(input())\r\nnumbers = [x for x in range(n)]\r\nfor x in range(0, n // 2, 2):\r\n numbers[x], numbers[n - x - 1] = numbers[n - x - 1], numbers[x]\r\nstring = input()\r\ncubes = string.split()\r\nprint(\" \".join([cubes[x] for x in numbers]))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\np = 1\r\nr = (n - 1) // 2 + 1\r\nfor i in range(r):\r\n if p % 2:\r\n a[i], a[-i - 1] = a[-i - 1], a[i]\r\n p += 1\r\n \r\nprint(' '.join(map(str, a)))", "#Soru 1 \r\n#n = input()\r\n#lst = list(map(int,n.split()))\r\n#num1 = lst[0]\r\n#num2 = lst[1]\r\n#num3 = lst[2]\r\n#while True:\r\n# if num1 > num2:\r\n# if num1//num2 == num1/num2:\r\n# ebob = num2\r\n# break\r\n# num1 = num1%num2\r\n# else:\r\n# if num2//num1 == num2/num1:\r\n# ebob = num1\r\n# break\r\n# num2 = num2%num1\r\n#\r\n#div = lst[0]*lst[1]/ebob\r\n#res = int(num3/div)\r\n#print(res)\r\n#####################################################\r\n# Soru 2\r\ndef swap(lst,n,i):\r\n temp = lst[i]\r\n lst[i] = lst[n-i-1]\r\n lst[n-i-1] = temp\r\n return lst\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\ni = 0\r\nfor i in range(n//2):\r\n if i%2 == 0:\r\n arr = swap(arr,n,i)\r\nprint(*arr)\r\n", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nans_arr = [0]*n\r\n\r\nfor i in range(-(-n//2)):\r\n if i % 2 == 0:\r\n ans_arr[i] = arr[(n-1)-i]\r\n ans_arr[(n-1)-i] = arr[i]\r\n else:\r\n ans_arr[i] = arr[i]\r\n ans_arr[(n-1)-i] = arr[(n-1)-i]\r\n\r\nprint (*ans_arr)\r\n", "import sys,math\r\nn=int(sys.stdin.readline())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nfor i in range(n//2):\r\n if i%2==0:\r\n l[i],l[n-i-1]=l[n-i-1],l[i]\r\nprint(*l)", "import math\n\nn = int(input())\n#cubes = list(map(int, input().split()))\ncubes = input().split()\n\ni = math.ceil(n/2)\n\nfor index in range(i):\n if index % 2 == 0:\n cubes[index], cubes[n - index - 1] = cubes[n - index - 1], cubes[index]\n\nprint(\" \".join(cubes))\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nfor i in range(0, n // 2, 2):\r\n data[i], data[n - i - 1] = data[n - i - 1], data[i]\r\n\r\nprint(' '.join(map(str, data)))\r\n", "n = int(input())\r\nlis = input().split()\r\nfor i in range(n//2):\r\n if (i&1)==0:\r\n lis[-i-1], lis[i] = lis[i], lis[-i-1]\r\nprint(*lis)\r\n", "n=int(input())\r\ns=list(map(int, input().split()))\r\n#print(type(s))\r\n\r\nfor i in range(n//2):\r\n if i<= n-i+1-2 and i%2==0:\r\n b=n-i+1-2\r\n a=s[i]\r\n s[i]=s[b]\r\n s[b]=a\r\n\r\nprint(*s)\r\n\r\n", "N = int(input()) - 1\n\n_arr = list(map(int, input().split()))\n\ni = 0\n\nwhile i < N - i:\n if (i + 1) % 2 != 0:\n _t = _arr[i]\n\n _arr[i] = _arr[N - i]\n _arr[N - i] = _t\n i += 1\n\n_arr = list(map(str, _arr))\n\nprint(' '.join(_arr))\n", "from math import ceil\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(0, ceil(n/2)):\r\n if i % 2 == 0:\r\n a[i], a[n-i-1] = a[n-i-1], a[i]\r\nprint(\" \".join(map(str, a)))\r\n", "# ENTER YOUR DETAILS HERE -------------------->\r\n'''\r\n // -- Template by A_*_A -- //\r\n '''\r\n# <----------------------------------------\r\n\r\n# ENTER YOUR CODE HERE -------------------->\r\n# sys.setrecursionlimit(1000)\r\n\r\n''' # 0.7 sec average INTEST - best for Codechef\r\nimport atexit,io,os,sys\r\nss=io.BytesIO()\r\n_write=ss.write\r\nss.write=lambda s:_write(s.encode())\r\natexit.register(lambda:os.write(1,ss.getvalue()))\r\ny_in=open(0).read().split(\"\\n\")\r\ndef y_inf():\r\n for y_id in range(len(y_in)):\r\n yield y_id\r\ny_ino=y_inf()\r\ninput=lambda:y_in[next(y_ino)]\r\n# '''\r\n\r\n''' # 1.1 sec average INTEST - best for Off-Campus placements\r\nimport sys\r\ninput=sys.stdin.readline\r\n# input=lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# '''\r\n\r\n# ''' # REGION FASTIO 1.7 sec average INTEST - best for Codeforces\r\nimport os,sys\r\nfrom io import BytesIO,IOBase\r\nBUFSIZ=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=\"n\"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,BUFSIZ))\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, BUFSIZ))\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\nif sys.version_info[0]<3:\r\n sys.stdin,sys.stdout=FastIO(sys.stdin),FastIO(sys.stdout)\r\nelse:\r\n sys.stdin,sys.stdout=IOWrapper(sys.stdin),IOWrapper(sys.stdout)\r\ninput=lambda:sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# END REGION '''\r\n\r\n# 2.1 sec average INTEST\r\n\r\nprin=sys.stdout.write\r\ntcs = 1\r\n# n=int(input())\r\nfor i in range(tcs):\r\n n=int(input())\r\n arr=input().split()\r\n for i in range(1,n//2+1,2):\r\n arr[i-1],arr[-i]=arr[-i],arr[i-1]\r\n print(*arr)\r\n\r\n # xx = s\r\n # yy = n - s\r\n # if yy > xx:\r\n # xx, yy = yy, xx\r\n # ans1 = (xx - yy) // 2\r\n # print(parity)\r\n # print(min(ans1, ans2))\r\n\r\n# <----------------------------------------\r\n\r\n# ENTER YOUR NOTES HERE -------------------->\r\n'''\r\n // -- Template by A_*_A -- //\r\n\r\ndef checkprime(n):\r\n if(n > 1):\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if (n % i == 0):\r\n return 0\r\n return 1\r\n else:\r\n return 0\r\n\r\ndef prime sieve(n):\r\n array=[1]*n\r\n for i in range(4,n,2):\r\n array[i]=0\r\n for i in range(2,n):\r\n for j in range(i*i,n,i):\r\n array[j]=0\r\n return array\r\n\r\n '''\r\n# <----------------------------------------\r\n", "from sys import stdin\r\n###############################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n###############################################################\r\n\r\nn = iinput()\r\na = linput()\r\ni, j = 0, n-1\r\nwhile i<j:\r\n a[i], a[j] = a[j], a[i]\r\n i+=2\r\n j-=2\r\nprint(*a)", "x=int(input())\r\narr=[int(new) for new in input().split()]\r\ni,n=0,len(arr)-1\r\nwhile(i<n-i+1):\r\n arr[i],arr[n-i]=arr[n-i],arr[i]\r\n i+=2\r\nprint(*arr)", "f = int(input())\r\n\r\nseq = input().split()\r\n\r\nfor i in range(f // 2):\r\n if i % 2 == 0:\r\n seq[i], seq[f - i - 1] = seq[f - i - 1], seq[i]\r\nprint(' '.join(seq))\r\n", "from collections import deque\r\n\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nchk=deque()\r\nif n%4==0:\r\n for i in range(n//2):\r\n if i==0:\r\n chk.append(n//2-1)\r\n chk.append(n//2)\r\n elif i%2==1:\r\n chk.appendleft(chk[-1]+1)\r\n chk.append(chk[1]-1)\r\n else:\r\n chk.appendleft(chk[-1]-1)\r\n chk.append(chk[1]+1)\r\nelif n%4==2:\r\n for i in range(n//2):\r\n if i==0:\r\n chk.append(n//2)\r\n chk.append(n//2-1)\r\n elif i%2==1:\r\n chk.appendleft(chk[-1]-1)\r\n chk.append(chk[1]+1)\r\n else:\r\n chk.appendleft(chk[-1]+1)\r\n chk.append(chk[1]-1)\r\nelif n%4==3:\r\n chk.append(n//2)\r\n for i in range(n//2):\r\n if i%2==1:\r\n chk.append(chk[0]+1)\r\n chk.appendleft(chk[-2]-1)\r\n else:\r\n chk.append(chk[0]-1)\r\n chk.appendleft(chk[-2]+1)\r\nelse:\r\n chk.append(n//2)\r\n for i in range(n//2):\r\n if i%2==1:\r\n chk.append(chk[0]-1)\r\n chk.appendleft(chk[-2]+1)\r\n else:\r\n chk.append(chk[0]+1)\r\n chk.appendleft(chk[-2]-1)\r\n\r\nans=[a[i] for i in chk]\r\nprint(*ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nl, r = 0, n-1\r\n\r\nwhile l < r:\r\n arr[l], arr[r] = arr[r], arr[l]\r\n l += 2\r\n r -= 2\r\n\r\nprint(*arr)\r\n\r\n\r\n\r\n", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\nn = int(input().strip())\r\narr = input().strip().split()\r\ndepth = 0\r\nrev = 0\r\n\r\nfor i in range(1,n+1):\r\n if i <= (n - i + 1):\r\n if i%2 == 1:\r\n arr[depth], arr[n-1-depth] = arr[n-1-depth], arr[depth]\r\n depth += 1\r\n else:\r\n break\r\n rev += 1\r\n\r\n# print(rev, depth)\r\nif rev%2 == 1:\r\n for i in range(depth,n):\r\n if i > n-1-i:\r\n break\r\n arr[i], arr[n-1-i] = arr[n-1-i], arr[i]\r\n \r\nprint(\" \".join(arr))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nfor i in range(0, n // 2, 2):\r\n a[i], a[-1 - i] = a[-1 - i], a[i] \r\nprint(*a)", "n = int(input().strip())\r\na = list(map(int, input().strip().split(' ')))\r\nfor i in range(n//2):\r\n if i&1 == 0:\r\n tmp = a[i]\r\n a[i] = a[n-i-1]\r\n a[n-i-1] = tmp\r\nfor elem in a:\r\n print(elem, end = ' ')\r\n", "\r\ndef main():\r\n\tn = int(input())\r\n\ta = input().split()\r\n\tfor i in range(0, n // 2, 2):\r\n\t\ta[i], a[-i-1] = a[-i-1], a[i]\r\n\tprint(' '.join(a))\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "n = int(input())\r\n*a, = map(int, input().split())\r\ni = n // 2\r\nfor j in range(i):\r\n if i % 2:\r\n a[i - 1], a[-i] = a[-i], a[i - 1]\r\n i -= 1\r\nprint(*a)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nif n % 2 == 0:\r\n p =n // 2\r\nelse:\r\n p = n // 2 + 1\r\nk = 0\r\nfor i in range(p):\r\n k += 1\r\n if i % 2 == 0:\r\n\r\n s[i],s[n-k] = s[n-k], s[i]\r\n\r\nfor i in range(len(s)):\r\n print(s[i], end = ' ')", "n=int(input())\r\na=input().split()\r\nfor i in range(1,n//2+1,2):\r\n\ta[i-1],a[-i]=a[-i],a[i-1]\r\nprint(*a)", "# cook your dish here\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(0,n//2):\r\n if(i%2==0):\r\n a[i],a[n-1-i]=a[n-1-i],a[i]\r\nprint(*a,sep=' ')\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\nInput=lambda:map(int,input().split())\n\nn = int(input())\nl = list(Input())\na = 0\nb = n-1\nans = [0] * n\nfor i in range(n//2+(n%2)):\n if i%2==0:\n ans[a] = l[b]\n ans[b] = l[a]\n else:\n ans[a] = l[a]\n ans[b] = l[b]\n a+=1\n b-=1\n \n\nprint(*ans)\n\n\n \n \n\n\n\n", "n = int(input())\nip = input().split(' ')\nip = list(map(int, ip))\ni = 0\nwhile i < (n/2):\n if (i+1)%2 != 0:\n temp = ip[i]\n ip[i] = ip[n-1-i]\n ip[n-1-i] = temp\n i = i + 1\nres = ''\nfor x in range(len(ip)):\n if x == len(ip) - 1:\n res += (str(ip[x]))\n else:\n res += (str(ip[x]) + ' ')\nprint(res) \n \t \t\t \t\t \t\t\t \t \t\t\t \t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\n\r\nfor i in range(n//2):\r\n if i%2==0:\r\n temp=l[i]\r\n l[i]=l[n-(i+1)]\r\n l[n-(i+1)]=temp\r\n\r\nfor i in l:\r\n print(i,end=\" \")", "n = int(input())\r\nA = list(map(int, input().split()))\r\nst = True\r\nfor i in range(0, n // 2):\r\n if st:\r\n A[i], A[-(i + 1)] = A[-(i + 1)], A[i]\r\n st = False\r\n else:\r\n st = True\r\nfor i in range(len(A)):\r\n print(A[i], end = \" \")\r\n", "n = int(input())\r\ncubes = [int(x) for x in input().split()]\r\ncubes.insert(0, 0)\r\ni = 1\r\nwhile i <= n - i + 1:\r\n if i % 2 == 1:\r\n tmp = cubes[i]\r\n cubes[i] = cubes[n + 1 - i]\r\n cubes[n + 1 - i] = tmp\r\n i += 1\r\ncubes.pop(0)\r\nfor cube in cubes:\r\n print(cube, end= \" \")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n%2==1:\r\n\tfor i in range(0,n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(a[n-i-1],end=\" \")\r\n\t\telse:\r\n\t\t\tprint(a[i],end=\" \")\t\r\nelse:\r\n\tfor i in range(0,n//2):\r\n\t\tif i%2==0:\r\n\t\t\tprint(a[n-i-1],end=\" \")\r\n\t\telse:\r\n\t\t\tprint(a[i],end=\" \")\r\n\tfor i in range(n//2,n):\r\n\t\tif i%2==0:\r\n\t\t\tprint(a[i],end=\" \")\r\n\t\telse:\r\n\t\t\tprint(a[n-i-1],end=\" \")", "f=lambda:map(int,input().split())\r\nn=int(input())\r\nl=list(f())\r\nfor i in range(0,n//2,2):\r\n (l[i],l[-1-i])=(l[-1-i],l[i])\r\nprint(' '.join(str(i) for i in l))", "a=int(input())\r\nb=list(map(int,input().split()))\r\n\r\nif a%2:\r\n c=[]\r\n for i in range(a):\r\n if i%2:\r\n c.append(b[i])\r\n else:\r\n c.append(b[a-i-1])\r\n\r\nelse:\r\n c=[]\r\n for i in range(a):\r\n if i%2:\r\n if i<a//2:\r\n c.append(b[i])\r\n else:\r\n c.append(b[a-i-1])\r\n else:\r\n if i<a//2:\r\n c.append(b[a-i-1])\r\n else:\r\n c.append(b[i])\r\n\r\nprint(' '.join(list(map(str,c))))\r\n", "#Timofey and cubes\r\nn=int(input()) \r\nA=list(map(int, input().split()))\r\nfor i in range(0, n // 2, 2):\r\n A[i], A[-i-1] = A[-i-1], A[i]\r\nprint(*A)", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\nfor i in range(n//2):\r\n if i%2==0:\r\n x[i],x[-(i+1)]=x[-(i+1)],x[i]\r\nprint(*x)", "n = int(input())\r\ncubes = input().split()\r\nif n >= 4: \r\n for i in range(n//4+(1 if n%2 else 0)):\r\n cubes[2*i], cubes[-2*i-1] = cubes[-2*i-1], cubes[2*i]\r\n if n%4 == 2:\r\n cubes[n//2], cubes[n//2-1] = cubes[n//2-1], cubes[n//2]\r\nelse:\r\n cubes[0], cubes[-1] = cubes[-1], cubes[0]\r\nprint(' '.join(cubes))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nfor i in range((n + 1) // 2):\r\n if i % 2 == 0:\r\n data[i], data[-(i + 1)] = data[-(i + 1)], data[i]\r\n\r\nprint(*data)\r\n", "import sys\r\n\r\ndebug = True if len(sys.argv) > 1 and sys.argv[1] == '-d' else False \r\n\r\nnumber_of_cubes = int(input())\r\n\r\ncubes = [ int(x) for x in input().split(' ') ]\r\n\r\nif debug:\r\n print('going til {}'.format(number_of_cubes//2 -1))\r\n\r\nfor index in range( (number_of_cubes)//2 ):\r\n if index%2 == 0:\r\n if debug:\r\n print('switching {index} with {other_index}'\\\r\n .format(index=index, other_index=number_of_cubes-index-1))\r\n cubes[index], cubes[number_of_cubes-index-1] = \\\r\n cubes[number_of_cubes-index-1], cubes[index]\r\n\r\nprint(' '.join(map(str,cubes)))\r\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n//2):\r\n\tif i%2==0:\r\n\t\ta[i],a[n-1-i]=a[n-i-1],a[i]\r\nprint(*a)", "n = int(input())\r\n\r\ns = list(map(int, input().split()))\r\n\r\nfor i in range(n//2):\r\n if not(i&1):\r\n s[i], s[n-i-1] = s[n-i-1], s[i]\r\n\r\nprint(*s)\r\n", "n = int(input())\np = list(map(int, input().split(\" \")))\nfor i in range(n // 2):\n if i == 0 or i % 2 == 0:\n temp = p[i]\n p[i] = p[n - i - 1]\n p[n - i - 1] = temp\np = list(map(str, p))\nprint(\" \".join(p))\n", "T = 1\r\nfor i in range(T):\r\n n=int(input())\r\n arr=input().split()\r\n for i in range(1,n//2+1,2):\r\n arr[i-1],arr[-i]=arr[-i],arr[i-1]\r\n print(*arr)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(0,n//2,2):\r\n (l[i],l[-i-1]) = (l[-i-1],l[i])\r\nprint(*l)", "n, a = int(input()), [int(i) for i in input().split()]\nres = [None] * n\nfor i in range(n // 2):\n if i & 1 == 0:\n res[i] = a[n - i - 1]\n else:\n res[i] = a[i]\nfor i in range(n // 2, n):\n if i & 1 != n & 1:\n res[i] = a[n - i - 1]\n else:\n res[i] = a[i]\nprint(*res)\n", "n = int(input())\na = list(map(int, input().split(\" \")))\nfor i in range(0, n//2, 2):\n a[i], a[n-i-1] = a[n-i-1], a[i]\nprint(\" \".join(map(str, a)))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(0, n // 2, 2):\r\n a[i], a[-i - 1] = a[-i - 1], a[i]\r\nprint(*a)", "n = int(input())\r\nl=list(map(int,input().split()))\r\ni=0\r\nwhile(i<n/2):\r\n l[i],l[n-i-1] = l[n-i-1],l[i]\r\n i=i+2\r\nprint(*l,sep=\" \")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n//2):\r\n if i%2==0:\r\n temp=a[i]\r\n a[i]=a[n-i-1]\r\n a[n-i-1]=temp\r\nfor i in range(n):\r\n if i!=n-1:\r\n print(a[i],end=\" \")\r\n else:\r\n print(a[i])\r\n", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n//2):\n if i%2 == 0:\n a[i], a[n-i-1] = a[n-i-1], a[i]\na = list(map(str, a))\nprint(\" \".join(a))\n", "x=int(input(''))\r\nar=list(map(int, input('').split()))\r\n\r\nfor i in range(0, x//2,2):\r\n ar[i],ar[-i-1]=ar[-i-1],ar[i]\r\n\r\nprint(*ar)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\n\r\nfor i in range(0, n//2, 2):\r\n a = l[i]\r\n l[i] = l[n - 1 - i]\r\n l[n - 1 - i] = a\r\nprint(\" \".join(map(str, l)))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=len(a)-1\r\nfor i in range(0,len(a),2):\r\n if(i<(len(a)//2)):\r\n a[i],a[b-i]=a[b-i],a[i]\r\n else:\r\n break\r\nprint(*a)", "N = int(input())\nA = list(map(int, input().split()))\nleft = 0\nright = N - 1\nfor i in range(N // 2):\n if i % 2 == 0:\n tmp = A[left]\n A[left] = A[right]\n A[right] = tmp\n left += 1\n right -= 1\nprint(\" \".join(map(str, A)))\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i%2==0 and i<n//2:\r\n x[i],x[n-i-1]=x[n-i-1],x[i]\r\n print(x[i],end=' ')", "def swap(lst,a,b):\r\n t=lst[a]\r\n lst[a]=lst[b]\r\n lst[b]=t\r\nn=int(input())\r\narr=[int(i) for i in input().split()]\r\nfor i in range(0,int(n/2)):\r\n if (i+1)%2!=0:\r\n swap(arr,i,n-i-1)\r\nfor i in arr:\r\n print(i,end=' ')\r\nprint()", "n=int(input())\r\na=input().split()\r\nfor i in range(0, n//2, 2):\r\n a[i], a[-(i+1)] = a[-(i+1)], a[i]\r\nprint(' '.join([str(j) for j in a])) ", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn=iinput()\r\nl=listinput()\r\ntemp=0\r\nfor i in range(0,int(n/2)):\r\n\tif i%2==0:\r\n\t\ttemp=l[i]\r\n\t\tl[i]=l[n-i-1]\r\n\t\tl[n-i-1]=temp\r\nprint(*l)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmi=(n//2)-1\r\ni=0\r\nwhile i<=mi:\r\n if i%2==0:\r\n l[n-i-1],l[i]=l[i],l[n-i-1]\r\n i+=1\r\nfor each in l:\r\n print(each,end=\" \")", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nfor index, i in enumerate(nums):\r\n\tif (len(nums) / 2) > index:\r\n\t\tif ((index + 1) % 2) != 0:\r\n\t\t\tnums[index] = nums[len(nums) - index - 1]\r\n\t\t\tnums[len(nums) - index - 1] = i\r\n\tprint(nums[index])", "n=int(input())\r\n\r\nx=list(map(int,input().split()))\r\n\r\nfor i in range(n//2):\r\n if (i%2-1):\r\n x[i],x[n-i-1]=x[n-i-1],x[i]\r\n\r\nprint(\" \".join(map(str,x)))\r\n", "n = int(input())\r\narr = input().split()\r\nfor i in range(0, int(n/2)):\r\n if i % 2 == 0:\r\n temp = arr[n-1-i]\r\n arr[n-1-i] = arr[i]\r\n arr[i] = temp\r\nprint(*arr)", "n=int(input())\r\nl=list(map(int,input().strip().split()[:n]))\r\nfor x in range(0,n//2,2):\r\n\tl[x],l[len(l)-x-1]=l[len(l)-x-1],l[x]\r\nprint(*l)", "n= int(input())\r\nl=list(map(int,input().split()))\r\nj=n//2\r\nfor i in range(j):\r\n if i%2==0:\r\n l[i],l[n-1-i]=l[n-1-i],l[i]\r\nfor i in l:\r\n print(i,end=' ')\r\n", "x=int(input())\narr=[int(new) for new in input().split()]\ni,n=0,len(arr)-1\nwhile(i<n-i+1):\n arr[i],arr[n-i]=arr[n-i],arr[i]\n i+=2\nprint(*arr)\n \t \t\t\t\t \t\t\t \t \t\t\t \t\t \t\t", "n, a = int(input()), input().split()\r\nfor i in range(0, n // 2, 2):\r\n a[i], a[-i - 1] = a[-i - 1], a[i]\r\nprint(*a)\r\n", "import math\r\n\r\ndef main_function():\r\n input()\r\n a = [int(i) for i in input().split(\" \")]\r\n for i in range(len(a) // 2):\r\n if not i % 2:\r\n a[i], a[len(a) - 1 - i] = a[len(a) - 1 - i], a[i]\r\n return \" \".join([str(i) for i in a])\r\n\r\nprint(main_function())", "n = int(input())\r\narr = input().split()\r\nfor i in range((n+1)//2):\r\n if not i%2: arr[i], arr[n-i-1] = arr[n-i-1], arr[i]\r\n\r\nprint(*arr)", "n=int(input())\r\na=[0]+list(map(int ,input().split()))\r\n\r\nfor i in range(1,n//2+1):\r\n if i%2 : a[i],a[-i]=a[-i],a[i]\r\na=list(map(str,a))\r\nprint(' '.join(a[1:]))\r\n", "n=int(input())\r\na=input().split()\r\n\r\nhalf_len=n//2\r\nfor i in range(half_len):\r\n\tif i*2<half_len:\r\n\t\ta[i*2],a[~i*2+1]=a[~i*2+1],a[i*2]\r\nprint(' '.join(a))", "n=int(input())\narr=list(map(int,input().split()))\nfor i in range(len(arr)//2):\n if (i+1)%2!=0:\n temp=arr[i]\n arr[i]=arr[n-i-1]\n arr[n-i-1]=temp\nfor i in arr:\n print(i,end=\" \")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Dec 23 14:56:55 2018\r\n\r\n@author: QuocBinh\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\na=input().split()\r\nfor i in range(0,n//2,2):\r\n a[i],a[n-1-i]=a[n-1-i],a[i]\r\n\r\nprint(' '.join(a))", "n = int(input())\na = input().split()\n\nfor i in range(0, n // 2, 2):\n a[i], a[n - i - 1] = a[n - i - 1], a[i]\n\n\nprint( \" \".join(a))\n", "n = int(input())\na = [int(i) for i in input().split()]\n\nfor i in range(n//2):\n if i%2 == 0:\n tmp = a[i]\n a[i] = a[n-1-i]\n a[n-1-i] = tmp\n\nfor i in a:\n print(i, end=\" \")", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = [0] + list(read())\r\nans = [0] + [0] * n\r\nfor i in range(1, n // 2 + 1):\r\n if i % 2:\r\n ans[n - i + 1] = a[i]\r\n else:\r\n ans[i] = a[i]\r\nfor i in range(n // 2 + 1, n + 1):\r\n if i % 2 and n % 2 == 0 or i % 2 == 0 and n % 2:\r\n ans[i] = a[i]\r\n else:\r\n ans[n - i + 1] = a[i]\r\nprint(' '.join(map(str, ans[1:])))", "import math\r\n\r\nlength = int(input()) \r\narray = list(map(int,input().split()))\r\n\r\nfor each in range(0,math.ceil(length//2),2):\r\n if(each%2 == 0):\r\n temp = array[each]\r\n array[each] = array[length-1-each]\r\n array[length-1-each] = temp\r\n\r\nfor each in array:\r\n print(each,end=\" \")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = 0; r = n - 1\r\nwhile l <= r:\r\n if l % 2 == 0 :\r\n a[l], a[r] = a[r], a[l]\r\n l += 1\r\n r -= 1\r\nfor x in a :\r\n print(x)\r\n", "n=int(input())\r\nl = list(map(int, input().rstrip().split()))\r\nj=0\r\nif n==2:\r\n print(l[1],l[0])\r\nelse:\r\n if n%2!=0:\r\n for i in range(n):\r\n if j==0:\r\n print(l[n-i-1],end=\" \")\r\n j=1\r\n else:\r\n print(l[i],end=\" \")\r\n j=0\r\n else:\r\n for i in range(0,n//2,2):\r\n l[i],l[n-i-1]=l[n-i-1],l[i]\r\n print(*l)\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(0, n//2):\r\n if i%2 == 0:\r\n temp = a[i]\r\n a[i] = a[n-i-1]\r\n a[n-i-1] = temp\r\n\r\nfor i in a:\r\n print(i, end = ' ')", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n//2):\r\n\tif (i+1)%2==1: \r\n\t\tl[i], l[n-1-i] = l[n-1-i], l[i]\r\nprint(*l)", "n = int(input())\na = list(map(int, input().split()))\n\nn_half = n // 2\n\nfor i in range(0, n):\n\tif i < n_half or n % 2 == 1:\n\t\tprint(a[i if i % 2 == 1 else -(i + 1)], end=' ')\n\telse:\n\t\tprint(a[i if i % 2 == 0 else -(i + 1)], end=' ')\nprint()", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(0,n//2,2):\r\n a[i],a[n-i-1]=a[n-1-i],a[i]\r\nprint(*a)\r\n", "n = int(input())\r\narray = list(map(str,input().split()))\r\n\r\nfor i in range(0,n//2,2):\r\n array[i],array[(n-(i+1)+1)-1] = array[(n-(i+1)+1)-1], array[i]\r\n # print(array)\r\nprint(\" \".join(array))", "i=0\r\nj=int(input())\r\nj=j-1\r\na=list(map(int,input().split()))\r\nwhile j>i:\r\n a[j],a[i]=a[i],a[j]\r\n i=i+2\r\n j=j-2\r\nfor i in a:\r\n print(i,end=' ')", "import math\r\nimport sys\r\nfrom collections import deque,OrderedDict,defaultdict\r\nimport heapq\r\nfrom collections import Counter\r\ndef inp(): return sys.stdin.readline().rstrip()\r\ndef mpp(): return map(int,inp().split())\r\ndef lis(): return list(mpp())\r\ndef yn(n):\r\n if n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\ndef fn(arr,n):\r\n for i in range(0,n//2,2):\r\n arr[i],arr[n-i-1]=arr[n-i-1],arr[i]\r\n return arr\r\n\r\ndef main():\r\n n=int(inp())\r\n arr=lis()\r\n print(*fn(arr,n))\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n main()", "n=int(input())\r\nar=input().split()\r\nfor i in range(1,n//2+1,2):\r\n\tar[i-1],ar[-i]=ar[-i],ar[i-1]\r\nprint(*ar)", "a =input()\r\nk =input()\r\nk =k.split(' ')\r\nl =len(k)\r\ni = 0\r\nwhile i<l//2:\r\n\tk[i],k[-(i+1)]=k[-(i+1)],k[i]\r\n\ti+=2\r\nprint(' '.join(k))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor j in range(0,n//2,2):\r\n a[j],a[n-j-1]=a[n-j-1],a[j]\r\nprint(*a) \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n//2):\r\n if i%2==0:\r\n a[i], a[n-i-1] = a[n-i-1], a[i]\r\n \r\nfor i in range(n):\r\n print(a[i], end=\" \")", "n = int(input())\r\na = list(map(int,input().split()))\r\ni = 0\r\nj = n-1\r\nflag = 0\r\nwhile i < j:\r\n if flag == 0:\r\n a[i],a[j] = a[j],a[i]\r\n flag = 1\r\n elif flag == 1:\r\n flag = 0\r\n i += 1\r\n j -= 1\r\nprint(*a)", "def swap(i,j):\r\n global a\r\n temp=a[i]\r\n a[i]=a[j]\r\n a[j]=temp\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nfor i in range(int(n//2)):\r\n if i%2==0:\r\n swap(i,n-i-1)\r\nprint(*a)\r\n \r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nwhile i<n//2:\r\n if i%2==0:\r\n l[i],l[n-i-1] = l[n-i-1],l[i]\r\n i+=1\r\nprint(*l)\r\n", "i = int(input())\r\nr = [0] * i\r\nl = list(map(int,input().split()))\r\n\r\nstart = []\r\nend = []\r\nfor x in range(i//2):\r\n if x % 2:\r\n start.append(l[x])\r\n end.append(l[-(x+1)])\r\n else:\r\n start.append(l[-(x+1)])\r\n end.append(l[x])\r\n\r\nif i % 2:\r\n total = start + [l[i//2]] + end[::-1]\r\n print (' '.join(str(x) for x in total))\r\nelse:\r\n total = start + end[::-1]\r\n print (' '.join(str(x) for x in total))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(0,int(n/2),2):\r\n a[i],a[n-i-1]=a[n-i-1],a[i]\r\nprint(*a)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n//2):\r\n if i % 2 == 0:\r\n a[i], a[n-i-1] = a[n-i-1], a[i]\r\n\r\nprint(*a)\r\n", "import sys\n\nn = int(input())\nan = list(map(int, sys.stdin.readline().split()))\n\nfor i in range(n // 2):\n if i % 2 == 0:\n an[i], an[n-i-1] = an[n-i-1], an[i]\n\nprint(' '.join(map(str, an)))\n", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\ni=0\r\nwhile(i<int(n/2)):\r\n if(i%2==0):\r\n list[i],list[n-i-1]=list[n-i-1],list[i]\r\n i+=1\r\nfor i in range(n):\r\n print(list[i],end=\" \")", "import math\nn = int(input())\narr = [int(inp) for inp in input().split()]\n\nlast = int(math.ceil(n / 2))\n\nfor i in range(0, last):\n if i % 2 == 0:\n arr[i], arr[n - i - 1] = arr[n - i - 1], arr[i]\n\nfor num in arr:\n print(num, end=' ')\nprint('')\n\n\n", "numOfCubes = int(input())\r\ndata = list(map(lambda x:int(x), input().split()))\r\nfor i in range(numOfCubes//2):\r\n if i % 2 == 0:\r\n temp = data[i]\r\n data[i] = data[numOfCubes - i - 1]\r\n data[numOfCubes - i - 1] = temp\r\nresult = \"\"\r\nfor num in data:\r\n result += str(num) + ' '\r\n\r\nprint(result[:-1])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n//2):\r\n if i%2==0:\r\n c=a[i]\r\n a[i]=a[n-i-1]\r\n a[n-i-1]=c\r\nfor x in a:\r\n print(x,end=\" \")\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nout=\"\"\r\nif(n%2!=0):\r\n out=str(a[n//2])\r\n# print(out)\r\nfor i in range((n//2)-1,-1,-1):\r\n if(i%2==0):\r\n a[i],a[-i-1]=a[-i-1],a[i]\r\n# print(out)\r\nprint(*a) ", "n = int(input())\r\narr = list(map(int,input().split()))\r\ni = 0\r\nj = n-1\r\nfor k in range(n//2):\r\n if k%2==0:\r\n arr[i],arr[j] = arr[j],arr[i]\r\n i+=1\r\n j-=1\r\nprint(*arr)", "# print(\"Input n\")\nn = int(input())\n\n# print(\"Input the n values\")\na = [int(x) for x in input().split()]\n\nfor i in range(len(a)//2):\n if i%2 == 0: # Switch them\n temp = a[i]\n a[i] = a[len(a)-1-i]\n a[len(a)-1-i] = temp\n\nanswer = \"\"\nfor x in a:\n answer += str(x) + \" \"\nprint(answer)\n\n\n \n", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(0, n // 2, 2):\r\n\t\r\n\tl[i], l[-(i + 1)] = l[-(i + 1)], l[i]\r\n\r\n\r\nprint(*l)", "n = int(input())\na = input().split()\nfor i in range(0, n // 2 , 2):\n a[i], a[-i - 1] = a[- i - 1], a[i]\nprint(*a)", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\ni=0\r\nwhile i<len(l1)/2:\r\n if i%2==0:\r\n temp = l1[i]\r\n l1[i] = l1[-1-i]\r\n l1[-1-i]=temp\r\n i+=1\r\nprint(*(l1))", "n = int(input())\naa = list(map(int, input().split()))\nfor i in range(n//2):\n if i%2 == 0:\n tmp = aa[i]\n aa[i] = aa[n-i-1]\n aa[n-i-1] = tmp\nfor a in aa:\n print(a, end=\" \")\n", "n = int(input())\na = list(map(int,input().split()))\nb =[0]*n\n\nfor i in range((n+1)//2):\n\tif i%2==0:\n\t\tb[i] = a[n-i-1]\n\t\tb[n-i-1] = a[i]\n\telse:\n\t\tb[i] = a[i]\n\t\tb[n-i-1] = a[n-i-1]\n\nprint(\" \".join(str(a) for a in b))", "n = int(input())\r\ninp1 = list()\r\ninp1 = input()\r\ninp1 = inp1.split(' ')\r\n\r\nfor i in range(int(len(inp1)/2)):\r\n if i%2==0:\r\n temp = inp1[i]\r\n inp1[i] = inp1[n-i-1]\r\n inp1[n-i-1] = temp\r\nprint (' '.join(inp1)) \r\n", "from math import ceil\r\n\r\nn = int(input())\r\n\r\na = [int(item) for item in input().split()]\r\n\r\nfor i in range(ceil(n / 2)):\r\n if i % 2 == 0:\r\n a[i], a[n - i - 1] = a[n - i - 1], a[i]\r\nprint(\" \".join(str(item) for item in a))", "n = int(input())\r\nalist = [int(x) for x in input().split()]\r\n\r\nfor i in range(n//2):\r\n if i%2 == 0:\r\n alist[i], alist[- i - 1] = alist[- i - 1], alist[i]\r\n \r\nprint(*alist)", "def solve(list,length):\n res = [None]*length\n for order, val in enumerate(list):\n if order > length - order - 1:\n break;\n if order%2==1:\n res[order] = val\n res[length - order - 1] = list[length - order - 1] \n else:\n res[length - order - 1] = val\n res[order] = list[length - order -1]\n return [str(i) for i in res]\n\ndef main():\n a = int(input())\n b = [int(a) for a in input().split(' ')]\n print(' '.join(solve(b,a)))\n\nmain()\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nl = n//2\r\nfor i in range(l):\r\n if (i+1)%2!=0:\r\n arr[i],arr[n-i-1] = arr[n-i-1],arr[i]\r\nprint(*arr)\r\n", "n=int(input())\nl=input().split()\ni=0\nt=0\nwhile(i<=n//2-1):\n t=l[i]\n l[i]=l[-(i+1)]\n l[-(i+1)]=t\n i=i+2\nprint(' '.join(l))" ]

[ "from math import sqrt\r\n\r\nn = int(input())\r\n\r\nside_of_s = int(sqrt(n))\r\nare_of_s = side_of_s * side_of_s\r\nrest = n - are_of_s\r\n\r\noutput = side_of_s * 4\r\n\r\nif rest > 0:\r\n output += 2\r\n rest -= side_of_s\r\n\r\nif rest > 0:\r\n output += 2\r\n\r\nprint(output)\r\n", "n = int(input())\r\na = int(n ** (1/2))\r\nif n % a == 0:\r\n print(2 * (a + n // a))\r\nelse:\r\n print(2 * (a + n // a + 1)) ", "i=int;c=i(input());a=i(c**0.5)+1\nif a*a-a-a+1==c:print(a*4-4)\nelif a*a-a<c:print(a*4)\nelse:print(a*4-2)\n\n \t\t\t \t\t\t\t\t \t \t\t \t \t\t", "from math import sqrt\r\nk=int(input())\r\nwhile k>0:\r\n x=sqrt(k)\r\n break \r\n k-=1 \r\nx=int(x)\r\ny=k-x*x \r\nif y==0:\r\n s=x*4 \r\nif y<=x and y!=0:\r\n s=x*4+2 \r\nif y>x:\r\n s=x*4+4 \r\nprint(s)\r\n\r\n", "import math\r\n\r\nx = int(input().strip())\r\nroot = int(round(math.sqrt(x)))\r\nrem = x - root * root\r\nperim = root * 4\r\n\r\ns1, s2 = root, rem - root\r\n\r\nif (rem < root):\r\n s1 = rem\r\n s2 = 0\r\n \r\nif s1 > 0:\r\n perim += 2\r\n\r\nif s2 > 0:\r\n perim += 2\r\n\r\nprint(perim)", "import math\r\n\r\n\r\ndef min_perimeter(n):\r\n sq = math.floor(math.sqrt(n))\r\n rem = n - (sq ** 2)\r\n if rem == 0:\r\n return sq * 4\r\n elif rem <= sq:\r\n return (sq * 4) + 2\r\n else:\r\n return (sq * 4) + 4\r\n\r\n\r\nn = int(input())\r\nprint(min_perimeter(n))\r\n", "import math\nN = int(input())\na=math.ceil(math.sqrt(N))#向上取整\nb=math.floor(math.sqrt(N))#向下取整\nm=a**2\nn=b**2\nc1=m-N\nc2=N-n\nif m==n:\n print('%d' %(a*4))\nelif c1<c2:\n print('%d' %(a*4))\nelif c2<c1:\n print('%d' %((a+b)*2))\n\t \t \t\t\t \t \t \t \t\t \t\t\t\t \t", "import math\r\n\r\nn = int(input())\r\n\r\nsquare_root = int(math.sqrt(n))\r\nremaining = n - square_root * square_root\r\n\r\nif remaining > square_root:\r\n print(4 * square_root + 4)\r\nelif remaining == square_root:\r\n print(4 * square_root + 2)\r\nelif remaining == 0:\r\n print(4 * square_root)\r\nelif remaining < square_root:\r\n print(4 * square_root + 2)\r\n", "import math\nn=int(input())\nm=int(math.sqrt(n))\ne=m+1\nif n>m**2 and n<=e**2-e:\n print((m+e)*2)\nelif n>e**2-e and n<e**2:\n print((e+e)*2)\nelse :\n print((m+m)*2)\n\t \t\t\t\t\t \t\t \t\t\t\t \t\t\t \t\t \t\t \t", "import math\n\nn = int(input())\n\na = int(math.sqrt(n))\n\nif a * a == n:\n print(4 * a)\nelif a * (a + 1) >= n:\n print(4 * a + 2)\nelse:\n print(4 * (a + 1))\n", "cnt=lambda s,i:s.count(i)\r\nii=lambda:int(input())\r\nsi=lambda:input()\r\nf=lambda:map(int,input().split())\r\nil=lambda:list(map(int,input().split()))\r\nn=ii()\r\ns=int(n**0.5)\r\nprint(4*s+2*(0<n-s**2<=s)+4*(n-s**2>s))", "n=int(input())\r\na=int(n**0.5+1-1E-10)\r\nprint(2*(a+0--n//a))", "from math import ceil\r\nprint(2 * ceil(2 * int(input()) ** 0.5))\r\n", "import math\r\nn = int(input())\r\na = int(math.sqrt(n))\r\nb = n // a\r\nans = (a + b) * 2\r\nif a * b != n:\r\n ans += 2\r\nprint(ans)", "n = int(input())\r\na = int(n**0.5)\r\nif a*a != n:\r\n a+=1\r\nif a*(a-1) >= n:\r\n b = a-1\r\nelse:\r\n b = a\r\nrs = (a+b)*2\r\nprint(rs)\r\n", "import math\r\nn=int(input())\r\na=math.floor(n**.5)\r\nb=n//a\r\nif n%a==0:\r\n print(2*(a+b))\r\nelse:\r\n print(2*(a+b+1))", "import math\r\nn=int(input())\r\nprint(math.ceil(math.sqrt(n)*2)*2)", "import math\r\n \r\nn = int(input())\r\nsrt = int(math.sqrt(n)) \r\ndiff = srt*srt - n\r\nif(diff != 0):\r\n srt = srt + 1\r\n diff = srt*srt - n\r\n \r\nparimeter = 4*srt\r\nif(diff > 0):\r\n parimeter = parimeter - int(diff / srt)*2\r\n \r\nprint(parimeter)", "from math import ceil, sqrt\r\n\r\n\r\ndef guard(n):\r\n a = int(ceil(sqrt(n)))\r\n if n <= a * (a - 1):\r\n p = 2 * a - 1\r\n else:\r\n p = 2 * a\r\n return 2 * p\r\n\r\n\r\nprint(guard(int(input())))\r\n", "n = int(input())\r\nk = int(n ** 0.5)\r\nprint(2 * (k + k + (k * k < n) + (k * k + k < n)))\r\n\r\n", "n=int(input())\r\nx=1\r\nwhile x**2<n:\r\n x+=1\r\nif x**2>n:\r\n x-=1\r\nt=n-x**2\r\nans=4*x\r\nif(t!=0):\r\n b=t//x\r\n z=t%x\r\n ans+=(2*b)\r\n if z>0:\r\n ans+=2\r\nprint(ans)", "a=int(input())\r\nb=int(a**.5) if a**.5==int(a**.5) else int(a**.5)+1\r\nprint(2*b+2*(b-int(a not in range((b*b)+1-b,b*b+1))))", "import math\r\n\r\nn = int(input())\r\n\r\nval = []\r\nmin_size = []\r\n\r\nfor i in range(math.trunc(math.sqrt(1000000))+1):\r\n val.append(i*(i-1)+1)\r\n min_size.append(4*i)\r\n val.append(i*i+1)\r\n min_size.append(4*i + 2)\r\n\r\nlast = 0\r\n\r\nfor idx in range(len(val)):\r\n if n < val[idx]:\r\n print(last)\r\n break\r\n else:\r\n last = min_size[idx]\r\n", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\nx=int(mt.sqrt(n))\nprint(2*(x+mt.ceil(n/x)))\n", "import math\r\nN = int(input())\r\nroot = int(N**0.5)\r\nsq = root * root\r\nrem = N - sq\r\np = 4 * root + 2 * math.ceil(rem/root)\r\nprint(p)", "n=int(input())\r\nm=int(n**0.5)\r\nif m*m==n:\r\n print(m*4)\r\nelif (n-m*m)>m:\r\n print((m+1)*4)\r\nelse:\r\n print(m*4+2)", "import math\r\nN = int(input())\r\nm = 10**18\r\nfor x in range(1, N+1):\r\n\ty = math.ceil(N/x)\r\n\tif 2*(x+y) < m:\r\n\t\ta, b = x, y\r\n\t\tm = 2*(x+y)\r\n\tx += 1\r\nprint(2*(a+b))\r\n", "from math import sqrt, floor, ceil\n\n\ndef min_route(n):\n ls, us = floor(sqrt(n)), ceil(sqrt(n))\n p1 = 4 * ls + 2\n p2 = 4 * us\n # print(n, p1, p2)\n if ls < n - ls ** 2:\n return p2\n return min(p1, p2)\n\ndef main():\n n = int(input().strip())\n print(min_route(n))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nh=int(n**0.5)\r\nw=(n+h-1)//h\r\nprint(2*(w+h))\r\n", "\r\nn = int(input())\r\n\r\nfrom math import sqrt\r\n\r\nsq = int(sqrt(n))\r\nif sq ** 2 != n:\r\n\tsq += 1\r\n\r\nd = sq ** 2 - n\r\nprint(4 * sq - 2 * (d // sq))", "import math\r\nn=int(input())\r\nm=round(math.sqrt(n))\r\np=math.ceil(n/m)\r\nprint(2*m+2*p)", "from math import sqrt\nN = int(input())\n\n#check if N is a perfect square\nsq = int(sqrt(N))\nif sq*sq == N:\n print(sq*4)\nelse:\n r = N//sq\n p = 2*(sq+r)\n\n if(N%sq!=0):\n p += 2\n print(p)\n\n\n\t\t \t\t \t\t \t \t \t \t \t \t\t \t\t", "N = int(input())\r\nRows = int(N ** 0.5)\r\nColumns = N // Rows\r\nprint(2 * (Columns + Rows) if Rows * Columns == N else 2 * (Columns + Rows) + 2)\r\n\r\n# UB_CodeForces\r\n# Advice: Limits Exist just in your mind\r\n# Location: Under this beautiful sky\r\n# Caption: So much energy it took me to solve\r\n", "S = int(input())\r\n\r\nminL = int(S ** (1/2))\r\n\r\nif minL * minL >= S:\r\n print(4 * minL)\r\nelif minL * (minL + 1) >= S:\r\n print(4 * minL + 2)\r\nelse:\r\n print(4 * minL + 4)\r\n", "import math\n\nn = int(input())\n\nx = math.sqrt(n)\n\nif (math.floor(x)*math.ceil(x))>=n :\n\tP = (math.floor(x)+math.ceil(x))*2\nelse :\n\tP = (math.ceil(x))*4\nprint (P)\n", "n = int(input())\r\ni, j, c = 1, 2, 1\r\nwhile n >= c + 2 * i:\r\n c += 2 * i\r\n i += 1\r\n j += 2\r\nprint(2 * (j, j + 1)[n >= c + i])", "n = int(input())\r\nm = n**(1/2.0)\r\nif(m==int(m)):\r\n m = int(m)\r\nelse:\r\n m = int(m)+1\r\na = m\r\nb = m\r\nwhile(a*b>=n):\r\n b = b-1\r\nb = b+1\r\nprint((a+b)*2)", "n = int(input())\r\n\r\na = int(n ** 0.5)\r\nbig_square = a ** 2\r\n\r\nelse_square = n - big_square\r\n\r\nanswer = int(a * 4)\r\nif a ** 2 != n:\r\n if else_square - a > 0:\r\n answer += 4\r\n else:\r\n answer += 2\r\n\r\nprint(answer)", "\n\nimport sys\ndef main():\n n = int(sys.stdin.readline().strip())\n\n m = int(n ** 0.5)\n\n p = 2 * m\n\n rest = n - m ** 2\n\n if rest == 0:\n print(4 * m)\n elif rest <= m:\n print(4 * m + 2)\n else:\n print(4 * m + 4)\n\n\n\nif __name__ == '__main__':\n main()\n", "from math import*\r\nn = int(input())\r\nk = 1\r\nwhile pow(k + 1, 2) <= n:\r\n k += 1\r\nx = n - pow(k, 2)\r\n\r\nprint(4*k + 2* ceil(x / k))\r\n", "N=int(input())\r\nx=int(N**0.5)\r\nif (x*x==N):\r\n print(4*x)\r\nelse:\r\n y=x*x\r\n x+=1\r\n z=x*x\r\n if (abs(N-y)>abs(z-N)):\r\n print(4*x)\r\n else:\r\n print(4*x-2)", "import math\nn = int(input())\n\nprint(2 * (math.ceil(2*math.sqrt(n))))", "import math \r\n\r\nN = int(input())\r\n\r\nm = int(math.sqrt(N))\r\nn = math.ceil(N/m)\r\n\r\n# print(m)\r\n# print(n)\r\n\r\nans = (m+n) * 2\r\n\r\nprint(ans)", "n = int(input())\r\ni = 1\r\nwhile i**2 < n:\r\n i += 1\r\nif i**2 == n:\r\n print(4*i)\r\nelse:\r\n rows = n // i\r\n print((i + rows) *2 + (n%i!=0)*2)\r\n\r\n\r\n", "import math\r\n\r\nn = int(input())\r\na = int(math.sqrt(n))\r\nb = a\r\nif a * a < n:\r\n b += 1\r\n if a * b < n:\r\n a += 1\r\n\r\nprint((a + b) * 2)\r\n", "n = int(input())\na = 1\nwhile a * a < n:\n a += 1\n\nif a * (a - 1) >= n:\n print(2 * a + 2 * (a - 1))\nelse:\n print(4 * a)\n", "from math import sqrt\n\nn = int(input())\nsqr = int(sqrt(n))\ns = 4 * sqr\nn -= pow(sqr, 2)\nwhile n > 0:\n n -= sqr\n s += 2\n sqr += 1\nprint(s)\n\t \t\t\t\t\t\t \t \t\t \t \t \t \t \t\t", "import math\nif __name__ ==\"__main__\":\n\tn = int(input())\n\tx = math.floor(n**0.5)\n\ty = math.ceil(n**0.5)\n\tif (n-x*x)<(y*y-n):\n\t\tprint(4*x+2)\n\telif (n-x*x)>(y*y-n):\n\t\tprint(4*y)\n\telse:\n\t\tprint(4*x)\n\t\t\n", "N=int(input())\na=int(N**0.5)\nif a**2==N:\n print(4*a)\nelif a*(a+1)>=N:\n print(4*a+2)\nelse:\n print(4*a+4)\n\n \t \t\t \t\t\t \t\t \t \t\t \t \t\t\t \t", "# http://codeforces.com/contest/859/problem/B\n\nimport math\n\nn = int(input())\nsrt = int(math.sqrt(n)) \ndiff = srt*srt - n\nif(diff != 0):\n srt = srt + 1\n diff = srt*srt - n\n\nparimeter = 4*srt\nif(diff > 0):\n parimeter = parimeter - int(diff / srt)*2\n\nprint(parimeter)", "import math\nn = int(input())\nroot = int(math.sqrt(n) // 1)\nrem = n - root*root\nif rem == 0:\n print(root*4)\nelif rem <= root:\n print(root*4 + 2)\nelse:\n print(root*4 + 4)\n \t \t\t \t\t \t \t\t \t\t\t \t", "import math\n\ndef main():\n N = int(input())\n\n down = int(math.sqrt(N))\n if down ** 2 == N:\n print(down * 4)\n else:\n up = down + 1\n if up * down < N:\n down += 1\n print((down + up) * 2)\n\nmain()\n", "import math\nn=eval(input())\nl = int(math.sqrt(n))\nsq = l * l\nif (sq == n): \n print(l * 4)\nelse :\n row = n // l\n perimeter = 2 * (l + row)\n if (n % l != 0): \n perimeter += 2\n print(perimeter)\n\n \t \t\t \t \t\t \t\t\t", "n = int(input())\na = n ** 0.5\nal = int(a)\nar = int(a) + 1\nif al*al >= n:\n print(al*4)\nelif al*ar >= n:\n print((al+ar)*2)\nelse:\n print(ar*4)", "n=int(input())\r\nk=int(n**0.5)\r\nif n>k*(k+1):\r\n print(4*k+4)\r\nelif n>k*k:\r\n print(4*k+2)\r\nelse:\r\n print(4*k)", "from math import *\r\nn=int(input())\r\na=ceil(sqrt(n))\r\nif a*a-n>=a:\r\n print(4*a-2)\r\nelse:\r\n print(4*a)", "n = int(input())\n\nimport math\n\nx = int(math.sqrt(n))\n\nm = n - x**2\n\na = x\nb = x\n\nif m >= x:\n a += 1\n m -= x\n\nans = 2*a + b*2\n\n\nif m > 0:\n ans += 2\n\nprint(ans)\n\n \t \t\t \t \t \t\t \t \t\t\t\t \t", "n = int(input())\r\nprint(next(2 * i for i in range(1000000) if (i // 2) * (i // 2 + i % 2) >= n))", "import math\n\n\nclass Solver:\n def main(self):\n n = int(input().strip())\n x = int(math.sqrt(n))\n o = n - x * x\n p = 4 * x\n if o > 0:\n p += 2\n if o > x:\n p += 2\n\n print(p)\n\n\nSolver().main()", "#859B (63No. Problem B)\r\nimport math\r\nn = int(input())\r\nw = math.ceil(math.sqrt(n))\r\nh = math.ceil(n/w)\r\np = 2 * (w + h)\r\nprint(p)", "from math import sqrt,ceil\r\nn = int(input())\r\nk = int(ceil(sqrt(n)))\r\nprint(4*k if n>k*k-k else 4*k-2)\r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\n\r\nl, r = 0, n + 1\r\nwhile r - l > 1:\r\n m = (r + l) >> 1\r\n \r\n if m * m > n:\r\n r = m\r\n else:\r\n l = m\r\n\r\nif n > 1:\r\n ans = 8 + (l - 2) * 4\r\nelse:\r\n ans = 4\r\n\r\nn -= l * l\r\nfor i in range(l):\r\n if not i:\r\n if n:\r\n ans += 2\r\n n -= 1\r\n else:\r\n if n:\r\n n -= 1\r\n\r\nfor i in range(l):\r\n if not i:\r\n if n:\r\n ans += 2\r\n n -= 1\r\n else:\r\n if n:\r\n n -= 1\r\n\r\nstdout.write(str(ans))", "from math import sqrt,ceil\nA = int(input())\nraiz = sqrt(A)\nH = ceil(raiz)\nB = round(raiz)\nprint((H+B)*2)\n\t\t\t \t \t \t\t \t \t \t\t\t \t\t", "import math\n\nn = int(input())\nd = math.sqrt(n)\na = int(math.ceil(d))\nqua = a * a\np = a * 4\n#print(n,d,a,qua,p)\nwhile True:\n #print(p)\n if qua - a >= n:\n qua -= a\n p -= 2\n else:\n break\n\nprint(p)\n", "import math as m\rx = int(input())\rprint(2*(m.floor(m.sqrt(x)) + m.ceil(x/m.floor(m.sqrt(x)))))\r", "import math\r\nn=int(input())\r\na=math.ceil(n**0.5)**2\r\ns=a**0.5\r\np=4*s\r\nr=int((a-n)/s)\r\np-=2*r\r\nprint(int(p))\r\n", "n = int(input())\r\n\r\nx = int(n ** 0.5)\r\ny = n - (x ** 2)\r\n\r\nif y == 0:\r\n\tprint(x * 4)\r\n\t\r\nelif y <= x:\r\n\tprint((x * 4) + 2)\r\n\t\r\nelif y > x:\r\n\tprint((x * 4) + 4)\r\n", "n=int(input())\r\ni=0\r\nwhile i*i<=n:\r\n\ti+=1\r\nt=i-1\r\nj=1\r\nwhile t*j<n: \r\n\tj+=1\r\nprint(2*(t+j))", "n=int(input())\r\ni=1\r\nsum=0\r\nx=1\r\nt=1\r\nwhile True:\r\n if t%2==1:\r\n sum+=x\r\n \r\n else:\r\n sum+=x*2-x\r\n x+=1\r\n t+=1\r\n if n<=sum:\r\n break\r\n \r\n \r\na=(sum**(1/2))\r\nif a==int(a):\r\n print(int(4*a))\r\nelse:\r\n print(4*int(a)+2)\r\n", "import math\r\nt = int(input())\r\na = int(math.sqrt(t))\r\nb = math.ceil(t/a)\r\nprint(a*2 + b*2)", "import math\nn = int(input())\nx = int(math.floor(math.sqrt(n)))\n\nn = n-x*x;\np = 4*x\n\nwhile(n>0):\n p += 2\n n -= x\n x += 1\n\nprint(p)\n", "from math import floor,ceil\nn = int(input())\nf = floor(n**.5)\nc = ceil(n**.5)\nif(c*f < n):\n c+=1\n#print(f,c,n**.5)\nprint(2*f + 2*c)\n", "from math import sqrt\r\nfrom math import ceil\r\nn = int(input())\r\nlow = int(sqrt(n))\r\nup = ceil(sqrt(n))\r\nif n - low * low > low:\r\n if n == up * up:\r\n print(up * 4)\r\n elif up * up - n == up:\r\n print(up * 4 - 2)\r\n else:\r\n print(up * 4)\r\nelse:\r\n if n == low * low:\r\n print(low * 4)\r\n else:\r\n print(low * 4 + 2)\r\n", "from math import floor, ceil, sqrt\n\nn = int(input())\n\na = floor(sqrt(n))\nb = ceil(sqrt(n))\n\nif n == a * a: print(4 * a)\nelif n <= a * b: print(2 * (a + b))\nelse: print(4 * b)\n", "import math\r\n\r\nn = int(input())\r\n\r\np = int(math.sqrt(n))\r\n\r\nq = math.ceil(n/p)\r\n\r\nprint(2*(p+q))\r\n", "import math\r\nn=int(input())\r\na=math.ceil(n**0.5)\r\nb=math.ceil(n/a)\r\nprint(2*a+2*b)", "#B\r\nn = int(input())\r\na = 1 #длина стороны\r\nwhile a*a <= n:\r\n a += 1\r\na -= 1\r\n\r\np = a*4\r\ndf = n - a*a\r\n\r\ncount = df//a\r\np = p + 2*count\r\n\r\ndf -= count*a\r\nif df > 0:\r\n p += 2\r\n\r\nprint(p)", "n=int(input())\na=int(n**0.5)\nif a*a==n:\n\tprint(a*4)\nelif n<=a*(a+1):\n\tprint((a*2+1)*2)\nelse:\n\tprint((a+1)*4)\n\n \t\t \t \t \t\t\t\t \t\t \t\t \t\t \t\t", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n min_val = 10 ** 18\r\n for i in range(1, n + 1):\r\n j = (n + i - 1) // i\r\n val = (i + j) * 2\r\n min_val = min(min_val, val)\r\n print(min_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\nimport math\n\nn = [int(i) for i in sys.stdin.read().strip().split('\\n')][0]\n\na = math.ceil(math.sqrt(n))\nb = n // a\nr = n - (a * b)\np = 2*a + 2*b + (2 if r else 0)\n\nprint(p)", "import math\n\ndef main():\n n = int(input())\n\n raiz = math.sqrt(n)\n\n if(raiz % 1 == 0):\n print(int(raiz*4))\n else:\n x = int(math.floor(raiz))\n\n sobra = n-x*x\n if(sobra % x == 0):\n print(int(2 * x + 2 * (x + sobra/x)))\n else:\n print(int(x + math.floor(sobra/x) + (x-(sobra%x)) + (x-(x-(sobra%x))) + 1 + x + x + math.ceil(sobra/x)))\n\nif __name__ == '__main__':\n main()\n \t \t \t\t\t\t\t \t\t \t \t \t\t \t \t\t", "import math as m\r\nn=int(input())\r\nr=m.floor(m.sqrt(n))\r\nx=r*r\r\ny=n-x\r\nif y==0:\r\n print(r*4)\r\nelse:\r\n if y<=r:\r\n print(r*4+2)\r\n else:\r\n print(r*4-(y-1)+y+1+2)", "import math\r\nfrom sys import stdin\r\nip=stdin.readline\r\nn=int(ip())\r\nsqroot=math.floor(n**.5)\r\ndiff=n-(sqroot**2)\r\nans=sqroot<<2\r\nif diff==0:\r\n\tpass\r\nelif diff<=sqroot:\r\n\tans+=2\r\nelse:\r\n\tans+=4\r\nprint(ans)", "#!/usr/bin/env python\nfrom math import sqrt, floor\n\nN = int(input())\nstart = floor(sqrt(N))\nrnd = start * 4\ninit_blk = start * start\nput = 0\n\nfor blk in range(init_blk+1, N + 1):\n if blk - init_blk == 1 or blk - init_blk == start + 1:\n rnd += 2\nprint(rnd)\n", "import math\r\n\r\nx = int(input())\r\nq = int(math.sqrt(x))\r\nc = x - q*q\r\nprint(4 * q + 2 * math.ceil(c / q))", "# LUOGU_RID: 132836390\nn=int(input())\r\na=int(n**0.5)\r\nif a*a==n:\r\n\tprint(a*4)\r\nelif n<=a*(a+1):\r\n\tprint((a*2+1)*2)\r\nelse:\r\n\tprint((a+1)*4)\r\n", "#!/usr/bin/env python\r\n\r\ndef main():\r\n N = int(input())\r\n\r\n sqrt = int(N ** 0.5)\r\n square = sqrt * sqrt\r\n if square == N:\r\n print(4 * sqrt)\r\n else:\r\n diff = N - square\r\n if diff <= sqrt:\r\n print(2 * (2 * sqrt + 1))\r\n else:\r\n print(4 * (sqrt + 1))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\n\r\nsquare=1\r\nwhile square**2<=n:\r\n square+=1\r\nsquare-=1\r\n\r\nleft=n-square**2\r\nif left>0:\r\n if left<=square:\r\n print(4*square+2)\r\n else:\r\n print(4*square+4)\r\nelse:\r\n print(4*square)", "a=int(input())\r\nif (a**0.5)%1==0:\r\n print(int(a**0.5*4))\r\nelse:\r\n i=a\r\n while i**0.5%1!=0:\r\n i-=1\r\n ans=i**0.5*4\r\n a=((a-i)+i**0.5-1)//i**0.5*2\r\n print(int(a+ans))\r\n", "n=int(input())\na=int(n**0.5)\nremain=n-a*a\nif remain==0:\n sum=4*a\nelif remain<=a:\n sum=2+4*a\nelse:\n sum=4+4*a\nprint(sum)\n\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t \t\t", "import math\r\n\r\nN = int(input())\r\na = math.floor(math.sqrt(N))\r\np = N - a*a\r\nif p==0:\r\n print(4*a)\r\nelif p<=a:\r\n print(2*a + 2*(a+1))\r\nelse:\r\n print(4*(a+1))\r\n", "\r\nn = int(input())\r\n\r\nfrom math import sqrt, ceil\r\n\r\nw = ceil(sqrt(n))\r\nh = ceil(n / w)\r\nprint(2 * (h + w))", "import math\nk = int(input())\nresult = 0\nbase = 0\n\nfor a in range(k+1)[::-1]:\n x = math.sqrt(a)\n if math.floor(x) == x:\n base = x\n k -= a\n result += 4*x\n break\n\nwhile(k):\n if(k >= base):\n k -= base\n result += 2\n else:\n result += 2\n k = 0\n\nprint(int(result))", "from math import*\r\nn=int(input())\r\nb=int(sqrt(n))\r\na=ceil(n/b)\r\nprint((a+b)*2)\r\n", "from math import sqrt,ceil,floor\r\nN=int(input())\r\ns = sqrt(N)\r\nq=floor(s)\r\nr=N-q**2\r\nw=True\r\nwhile(w):\r\n if r>=q+1:\r\n print(q*4+4)\r\n w=False\r\n break\r\n elif r>=1:\r\n print(q*4 + 2)\r\n w=False\r\n break\r\n else:\r\n print(q*4)\r\n break\r\n w=False", "import math\nn = int(input())\nmn = 2*n+2\nfor i in range(n, min(4*n, n+1000)):\n\ts = int(math.sqrt(i))\n\tfor j in range(s, 0, -1):\n\t\tif i%j==0:\n\t\t\tmn = min(mn, 2*(j + i//j))\n\t\t\tbreak\n\t\t\t\nprint(mn)\n", "n = int(input())\r\ni, j = 1, 1\r\nwhile i * j < n:\r\n if i == j:\r\n j += 1\r\n else:\r\n i += 1\r\nprint(2 * (i + j))\r\n", "N = int(input())\nans = 2*N+2\nfor a in range(1, N//2+2):\n\tb = (N+a-1)//a\n\tans = min(ans, 2*(a+b))\nprint(ans)\n", "n=int(input())\r\na=int(n**0.5)\r\nn-=a**2\r\n\r\nprint(a*4+2*(n>0)+2*(n>a))\r\n", "from math import pi\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = n ** 0.5\r\n c = 0\r\n if a == int(a):\r\n print(int(a) * 4)\r\n return\r\n a = int(a)\r\n o = n - a ** 2\r\n c = a * 4 + o // a * 2\r\n if o % a == 0:\r\n print(c)\r\n else:\r\n print(c + 2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "from math import trunc, sqrt\r\na = int(input())\r\nn = trunc(sqrt(a))\r\nif (n * n == a):\r\n print(4*n)\r\nelif n*(n+1) >= a:\r\n print(2*(n+n+1))\r\nelse:\r\n print(4*(n+1))\r\n#n1 = n\r\n#while n1 * n <= a:\r\n# n1 += 1\r\n", "import math\r\nn=int(input())\r\na=math.ceil(math.sqrt(n))\r\nif (a**2-n)<a:\r\n print(a*4)\r\nelse:\r\n print(a*4-((a**2-n)//a)*2)\r\n", "n=int(input())\ni=1\np=0\nt=0\nwhile(True):\n if(p*i>=n):\n t=1\n break\n elif(i*i>=n):\n break\n p=i\n i=i+1\nif(t==1):\n print(p*2+i*2)\nelse:\n print(i*4)\n\n \n \n\t\t\t \t\t\t\t\t \t \t \t \t \t\t\t\t \t\t", "import math\r\nn = int(input())\r\nx = math.ceil(math.sqrt(n))\r\n\r\ny = (n // x)\r\n\r\nwhile x*y<n:\r\n y+=1\r\n\r\nprint(2*(x+y))\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out1.out\",'w')\r\nimport math as m\r\nn=int(input())\r\nx=int(m.sqrt(n))\r\np=x*x\r\nperi=4*x\r\nq=n-p\r\nwhile q>x:\r\n\tperi+=2\r\n\tq-=x\r\nif q!=0:\t\r\n\tperi+=2\r\nprint(peri)\t\r\n\r\n", "from math import sqrt, ceil\n\nn = int(input())\n\nl = ceil(sqrt(n))\n\nc = l\n\nwhile ((c-1)*l >= n):\n c -= 1\n\n# print(c, l)\nprint(2*(c+l))\n \t \t \t\t\t\t\t \t \t\t \t\t \t \t", "n = int(input())\r\na = 1\r\nb = 1\r\nwhile 1:\r\n if (a * b) >= n:\r\n break\r\n if a < b:\r\n a = b\r\n elif a == b:\r\n b = b + 1\r\nprint((a+b)*2)\r\n\r\n\r\n\r\n", "n = int(input())\r\nx = int(n ** 0.5)\r\ny = n // x\r\n\r\nif x * y != n:\r\n print(2 * (x + y) + 2)\r\nelse:\r\n print(2 * (x + y))\r\n", "from math import sqrt\r\n\r\n\r\ndef cal_add(x):\r\n return 2 if x > 0 else 0\r\n\r\n\r\nn = int(input())\r\nk = int(sqrt(n))\r\nr = n - k ** 2\r\nrs = k * 4\r\na = r if r <= k else r - k\r\nb = r - a\r\nrs += (cal_add(a) + cal_add(b))\r\nprint(rs)\r\n", "\nn=int(input())\n\nx=int(n**.5)\n\ny=int((x+1)**2/x)\n\nif ( int(x**2) == n):\n\tprint(4*x)\n\nelse:\n\tfor i in range(x,y+1):\n\t\tif (i*x)>=n:\n\t\t\tprint(2*(i+x))\n\t\t\tbreak\t\t\n\n", "from math import sqrt\r\n\r\nn = int(input())\r\n\r\nm = l = int(sqrt(n))\r\n\r\nwhile (m + 1) * l < n:\r\n m += 1\r\n\r\nans = 2 * (m + l)\r\n\r\nif n - (m * l) > 0:\r\n ans += 2\r\n \r\nprint(ans)", "n=int(input())\r\ni=1\r\nj=1\r\nf='i'\r\nfor k in range(0,n):\r\n area=i*j\r\n if area>=n:\r\n break\r\n if f=='i':\r\n i+=1\r\n f='j'\r\n else:\r\n j+=1\r\n f='i'\r\nprint(2*i+2*j)\r\n ", "from math import floor\nn = int(input())\nq = floor(n ** 0.5)\nprint(2 * (q + (n + q - 1) // q))\n", "from math import sqrt\r\nn = int(input())\r\na = 0\r\nb = 0\r\nc = 0\r\na = int(sqrt(n))\r\nwhile a*b<n:\r\n\tb+=1\r\nif a*b>n:\r\n\tb-=1\r\nif a*b==n:\r\n\tprint(2*(a+b))\r\nelse:\r\n\tc = n-(a*b)\r\n\ta = 2*(a+b)-c\r\n\tc = c+2 \r\n\tprint(a+c)\r\n", "def patrol (n) :\r\n perimeter = None\r\n start = 1\r\n temp = 0\r\n while start <= n :\r\n temp = 0\r\n temp += (start*2)\r\n if n%start != 0 :\r\n temp += ((n//start)+1)*2\r\n else :\r\n temp += (n//start)*2\r\n \r\n if perimeter == None :\r\n perimeter = temp\r\n elif perimeter >= temp :\r\n perimeter = temp\r\n else:\r\n break\r\n start += 1\r\n \r\n return perimeter\r\n \r\nprint (patrol(int(input())))", "n = int(input())\n\nx = int(n**(1/2))\n\nif x**2 == n:\n print(x*4)\nelif x * (x+1) >= n:\n print(x*2 + (x+1)*2)\nelse:\n print((x+1)*4)\n \t \t\t \t\t\t \t \t\t \t\t\t \t", "t = int(input())\r\n\r\na, b = 1, 1\r\nwhile t > a*b:\r\n if a == b:\r\n a += 1\r\n else:\r\n b += 1\r\n\r\nprint((a+b) * 2)", "n=int(input())\r\nl=1\r\nr=n\r\nm=0\r\nwhile(r-l>1):\r\n m=int((l+r)/2)\r\n if m*m>n:\r\n r=m\r\n else:\r\n l=m\r\nif m*m>n:\r\n m-=1\r\nif n>2 and m*m!=n:\r\n if m*m+m>=n:\r\n print(4*m+2)\r\n else:\r\n print(4*m+4)\r\nelse:\r\n if n==1:\r\n print(4)\r\n elif n==2:\r\n print(6)\r\nif m*m==n:\r\n print(4*m)", "n=int(input())\r\nif n==1:print(4)\r\nelse:\r\n\tq=n//2\r\n\tl=1\r\n\tr=q\r\n\tc=0\r\n\twhile l<=r:\r\n\t\tmid=(l+r)//2\r\n\t\tif mid*mid<=n and n>c:\r\n\t\t\tc=mid\r\n\t\t\tl=mid+1\r\n\t\telse:\r\n\t\t\tr=mid-1\r\n\r\n\tq=n-(c*c)\r\n\tif q<=c:\r\n\t\tprint(c*4+min(1,q)*2)\r\n\telse:\r\n\t\tprint(c*4+2*((q)//c+min((q)%c,1)))\r\n", "import math\r\n\r\np = 0\r\nsq = 0\r\n\r\nn = int(input())\r\nsq = math.sqrt(n)\r\n\r\nif (int(sq)*math.ceil(sq))>=n :\r\n\tp = (int(sq) + math.ceil(sq))\r\nelse :\r\n\tp = (int(sq) + math.ceil(sq) + 1)\r\n\r\nprint(p*2)\r\n", "import math\r\nn = int(input())\r\nfor i in range(0, n*n):\r\n if math.sqrt(n+i) == int(math.sqrt(n+i)):\r\n break\r\na = math.sqrt(n+i)\r\np = 4*a\r\nif a*a - n >= a:\r\n p = 2*(a+(a-1))\r\nprint(int(p))\r\n", "import math\r\nn=int(input())\r\ne=int(math.sqrt(n))\r\nif(n%e==0):\r\n extra=0\r\nelse:\r\n extra=1\r\nprint(int((e*2)+(2*(n//e+(extra)))))", "n=int(input())\r\np=1\r\nwhile p*p<n:\r\n p+=1\r\n\r\nprint(4*p-2*((p*p-n)//p))", "from math import sqrt\r\nn = int(input())\r\na = int(sqrt(n))\r\nif (a + 1) * (a + 1) <= n:\r\n a += 1\r\nleft = n - a * a\r\nb = a\r\nc = a + left // a\r\nans = 2 * b + 2 * c\r\nif b * c < n:\r\n ans += 2\r\nprint(ans)\r\n", "a = int(input())\nb = int(a**(1/2))**2\nif (b - a) == 0:\n print(int(4*(b**(1/2))))\nelif (a - b) <= (b**(1/2)) and (b-a) != 0:\n print(int(4*(b**(1/2))+2))\nelse:\n print(int(4*((b**(1/2))+1)))", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\n\r\nn = int(input())\r\nsq = int(n**(1 / 2))\r\nans = sq * 4\r\nif n - sq**2 > sq:\r\n ans += 4\r\nelif 1 <= n - sq**2 <= sq:\r\n ans += 2\r\n\r\nprint(ans)\r\n", "import math\r\na = int(input())\r\nb = math.ceil(a**.5)\r\n\r\nc = math.ceil(a/b)\r\nprint(2*b+2*c)", "import math\r\nn = int(input())\r\n\r\na = math.ceil(n ** 0.5)\r\nb = math.floor(n ** 0.5)\r\n\r\nif (a*b < n):\r\n\tb += 1\r\n\r\nprint ((b+a)*2)", "n = int(input())\r\nINF = float(\"inf\")\r\nnum = INF\r\nfor i in range(1, n + 1):\r\n q = n // i + int(n % i != 0)\r\n\r\n num = min(num, 2 * q + 2 * i)\r\n\r\nprint(num)", "import math\nn=int(input())\na=int(math.sqrt(n))\nif a*a==n:\n print(4*a)\nelif n-a*a>a:\n print(4*a+4)\nelse:\n print(4*a+2)\n\n\t\t\t \t \t \t\t\t\t \t\t", "import math\r\n\r\nn = int(input())\r\na = int(math.floor(math.sqrt(n)))\r\nb = n // a\r\nc = n % a\r\n\r\nprint(2*a+2*b + 2 if c != 0 else 2*a+2*b)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nk=math.ceil(math.sqrt(n))\r\nif(k*(k-1)<n):\r\n print(4*k)\r\nelse:\r\n print(4*k-2)", "from math import ceil,sqrt\r\n\r\nx = int(input())\r\na = ceil(sqrt(x))\r\nr = 2*a + 2*ceil(x/a)\r\nprint(r)", "n = int(input())\ni = 1\nwhile True:\n start, end = i**2 - i + 1, i**2\n if start <= n <= end:\n print(i*4)\n exit()\n elif n < start:\n print(i*4 - 2)\n exit()\n i += 1\n\n", "N = int(input())\r\nimport math\r\na1 = int(math.sqrt(N))\r\na2 = int(math.ceil(math.sqrt(N)))\r\n\r\nif N - a1*a1 <= a1:\r\n\tif N == a1*a1:\r\n\t\tprint(4*a1)\r\n\telse:\r\n\t\tprint(4*a1 + 2)\r\nelse:\r\n\tprint(4*a2)\r\n\t", "N = int(input())\r\n\r\nx = int((N - 1) ** 0.5 + 1)\r\nprint(x + (N + x - 1) // x * 2 + x)", "import math\r\nn = int(input())\r\nl = int(math.ceil(math.sqrt(n)))\r\n\r\nprint(l + 2*(l-1) + (n - l*(l-1)>0)*2 + l)\r\n", "from math import sqrt, ceil\n\nn = int(input())\n\na = ceil(sqrt(n))\n\nb = a * 4\n\nc = b - ((a - ceil(n / a)) * 2)\n\nprint(c)\n \t \t\t\t \t\t \t\t\t\t \t \t\t\t \t", "n = int(input())\na = (10 ** 6) * [0]\na[0] = 4\na[1] = 6\nflag, abc = 0, 0\ninit, cnt = 2, 2\nfor i in range(2, 10 ** 6):\n a[i] = 8 + abc\n cnt -= 1\n if cnt == 0:\n abc += 2\n if flag == 0:\n cnt = init\n flag = 1\n elif flag == 1:\n init += 1\n cnt = init\n flag = 0\nprint(a[n - 1])\n", "from math import sqrt, ceil, floor\n\ndef main():\n \n n = int(input())\n sn = sqrt(n)\n if sn == int(sn):\n print(int(4 * sn))\n return\n \n a = ceil(sn)\n b = floor(sn)\n if abs(a - sn) > abs(b - sn): \n print(int(2*(a+b)))\n else:\n print(int(4* a))\n \nif __name__ == '__main__':\n main()\n\t\t \t\t\t\t\t\t\t\t \t\t\t \t\t \t \t \t", "n = int(input())\r\n \r\nx = 1\r\nbest = float('inf')\r\nwhile x * x <= n:\r\n y = (n + x - 1)//x\r\n best = min(best, 2*(x + y))\r\n x += 1\r\nprint(best)", "from math import sqrt\r\nt = int(input())\r\n\r\nbase = int(sqrt(t))\r\n\r\nif base != sqrt(t):\r\n if t - base * base <= base:\r\n p = base * 4 + 2\r\n else:\r\n p = (base+1)*2 + base*2 + 2\r\nelse:\r\n p = 4 * base\r\nprint(p)\r\n", "import math\r\nfrom random import random\r\n\r\ndef getInt():\r\n return(int(input()))\r\n\r\ndef getInts():\r\n line = input().split()\r\n return [int(l) for l in line]\r\n\r\ndef getFloat():\r\n return(float(input()))\r\n\r\ndef getFloats():\r\n line = input().split()\r\n return [float(l) for l in line]\r\n\r\ndef getStrings():\r\n line = input().split()\r\n return(line)\r\n\r\n\r\nA = getInt()\r\nn = math.floor(math.sqrt(A))\r\n\r\nif(n*n == A):\r\n print(4*n)\r\nelif(n*(n + 1) >= A):\r\n print(4*n + 2)\r\nelse:\r\n print(4*n + 4)", "n = int(input())\r\nh = int(n ** .5)\r\nw = n // h\r\nprint((w + h) * 2 + (2, 0)[n == h * w])", "import math\r\nm=int(input())\r\ny=math.sqrt(m)\r\nx=int(y)\r\nz=m-x*x\r\nif z > x:\r\n print(2*(2*x+2))\r\nelif z==0:\r\n print(4*x)\r\nelse :\r\n print(2*(2*x+1))\r\n\r\n", "import math\r\nn=int(input())\r\na=int(math.sqrt(n))\r\nb=a*a\r\nprint(2*(math.ceil((n-b)/a))+a*4)", "n=int(input())\r\nnum=int(pow(n,0.5))\r\nans=4*num\r\n#print(ans)\r\nif n-num*num:\r\n diff=n-num*num\r\n div=diff//num\r\n if diff%num==0:\r\n print(ans+2*div)\r\n else:\r\n print(ans+2*div+2)\r\nelse:\r\n print(ans)", "b=int(input())\r\nd=1\r\nk=2\r\nn=abs(b-(d**2))\r\nr=abs(b-(k**2))\r\nwhile True:\r\n\tif r>n:\r\n\t\tbreak\r\n\telse:\r\n\t\td+=1\r\n\t\tk+=1\r\n\t\tn=abs(b-(d**2))\r\n\t\tr=abs(b-(k**2))\r\nh=d**2\r\ng=0\r\nif b>h:\r\n\tg=d+d+(d+1)+(d+1)\r\nelse:\r\n\tg=d+d+d+d\r\nprint(g)\r\n", "print(2 * int(0.99999 + 2 * int(input()) ** 0.5))", "from math import sqrt, floor\n\nn = int(input())\ns = floor(sqrt(n))\nr = n - s ** 2\nres = 4 * s + (0 if r == 0 else 2 if r <= s else 4)\nprint(res)\n", "from math import sqrt\r\n\r\nn = int(input())\r\n\r\nk = int(sqrt(n))\r\n\r\ns = 4*k\r\nif k*k < n:\r\n\ts+=2\r\n\tif k*(k+1) < n:\r\n\t\ts+=2\r\n\t\t\r\nprint(s)", "from math import trunc, sqrt\r\nn = int(input())\r\na = trunc(sqrt(n))\r\nif a * a == n:\r\n print(4*a)\r\nelif a * (a + 1) >= n:\r\n print(2 * (a + a + 1))\r\nelse:\r\n print(4 * (a + 1))", "import math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n length = int(math.sqrt(n))\r\n if length * length == n:\r\n print(length * 4)\r\n elif length * (length+1) >= n:\r\n print((length * 2 + 1) * 2)\r\n else:\r\n print((length+1) * 4)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from math import ceil,floor\r\n\r\nfrom math import sqrt\r\nn=int(input())\r\nl=sqrt(n)\r\nif ceil(l)==floor(l):\r\n\tprint(int(4*l))\r\nelse:\r\n\tg1=ceil(l)\r\n\tg2=floor(l)\r\n\tm=(g1+g2)/2\r\n\tif l>=m:\r\n\t\tprint(ceil(l)*4)\r\n\telse:\r\n\t\tprint((ceil(l)+floor(l))*2)\r\n\t\t\r\n\r\n\r\n\r\n\r\n", "import math\r\nn=int(input())\r\nif math.sqrt(n)==int(math.sqrt(n)):\r\n print(int(math.sqrt(n))*4)\r\nelse:\r\n l=[]\r\n x=int(math.sqrt(n))\r\n for i in range(x,x+2):\r\n for j in range(x,x+2):\r\n if i*j>=n:\r\n l.append(2*i+2*j)\r\n print(min(l))", "print(2*int(2*int(input())**.5+0.9999))", "N = int(input())\r\na = int(N**.5)\r\nN -= a*a\r\n\r\nprint(4*a + 2*((N>0)+(N>a)))", "from math import *\r\nN = int(input())\r\nprint(2*ceil(2*sqrt(N)))", "a = int(input())\r\nfor i in range(1, 1000000):\r\n if i * i >= a:\r\n if i * (i - 1) >= a:\r\n print(2 * (i + i - 1));\r\n else:\r\n print(4 * i);\r\n break", "import math\nimport sys\nif __name__ == '__main__':\n for s in sys.stdin:\n x = int(s.strip())\n n = math.floor(math.sqrt(x))\n r = x - n * n\n perimeter = 4 * n\n if r > 0:\n perimeter += 2\n if r > n:\n perimeter += 2\n print(perimeter)\n \n \n \n \n\t \t \t \t\t\t \t\t\t \t \t\t \t\t\t", "import math\r\n\r\nn = int(input())\r\nans = 10 ** 9 + 1\r\nfor a in range(1, int(n ** 0.5 + 2)):\r\n b = n // a\r\n c = 2 * (a + b)\r\n if n % a != 0:\r\n c += 2\r\n ans = min(ans, c)\r\nprint(ans) ", "#859A\r\nimport math\r\nn = int(input())\r\nprint(2*math.ceil(2*math.sqrt(n)))", "\"\"\"http://codeforces.com/problemset/problem/859/BS\"\"\"\nimport math\nn = int(input())\nsn = math.floor(math.sqrt(n))\nif n == math.pow(sn,2):\n res = 4 * sn\nelif sn * (sn+1) >= n:\n res = 4*sn +2\nelse:\n res = 4*sn + 4\nprint(res)\n", "import math\r\nn = int(input())\r\n\r\n\r\nb = math.floor(math.sqrt(n))\r\n\r\nbb = b*b\r\n\r\nif bb == n:\r\n print(b*4)\r\nelse:\r\n left = n - bb\r\n if left <= b:\r\n print(b*4 + 2)\r\n else:\r\n print(b*4 + 4)", "from math import ceil\r\n\r\ndef minimal_perimeter(side, area):\r\n other_side = ceil(area / side)\r\n return 2 * (side + other_side)\r\n\r\narea = int(input())\r\n\r\nminimal_perimeter_for_area = minimal_perimeter(area, area)\r\nfor i in range(2, area):\r\n minimal_perimeter_for_area = min(minimal_perimeter(i, area), minimal_perimeter_for_area)\r\n\r\nprint(minimal_perimeter_for_area)\r\n", "from math import sqrt,ceil\r\nn=int(input())\r\nprint(2*ceil(2*sqrt(n)))\r\n\r\n'''\r\n8====D8====D8====D\r\n8====D8====D8====D\r\n8====D8====D8====D\r\n8====D8====D8====D\r\n8====D8====D8====D\r\nxxxxx\r\nxxxxx\r\nxxxxx\r\nxxxxx\r\nxx\r\n'''", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\ns = math.floor(math.sqrt(n))\r\nif n > s*s:\r\n diff = n - s*s\r\n if diff > s:\r\n print(4*s + 4)\r\n else:\r\n print(4*s + 2)\r\nelse:\r\n print(4*s)", "\r\ntry:\r\n import math\r\n n=int(input())\r\n x=int(math.sqrt(n))\r\n if x*x>=n:\r\n per=4*x\r\n elif x*(x+1)>=n:\r\n per=4*x+2\r\n elif (x+1)*(x+1)>=x:\r\n per=4*x+4\r\n print(per)\r\n \r\nexcept EOFError:\r\n pass", "n=int(input()) \r\nif(n==1):\r\n print(4) \r\nelif(n==2):\r\n print(6) \r\nelif(n==3):\r\n print(8) \r\nelse:\r\n i=2 \r\n while(i**2<=n):\r\n i=i+1 \r\n i=i-1 \r\n n=n-i*i \r\n peri=4*i \r\n while(n>=i):\r\n peri+=2 \r\n n=n-i \r\n if(n!=0):\r\n peri=peri+2\r\n print(peri)", "# https://codeforces.com/problemset/problem/859/B\n\nn = int(input())\nf = int(n**(1/2))\nr = n - f**2 \nm = 2\nif r == 0:\n m = 0\nelif r > f:\n m = 4\nprint((f*4)+m)\n", "n = int(input())\nans = 1e9\nfor i in range(1, 1000001):\n\ty = i\n\tx = (n+y-1)//y\n\tans = min(ans, 2*x + 2*y)\nprint(ans)", "import math\r\nn=int(input())\r\np=n**(1/2)\r\nr=int(math.sqrt(n))\r\nprint((4*2)+(r-2)*4+2*(math.ceil((n-(r*r))/r)))", "import math\ndef divisors(n):\n n = int(n)\n d1 = math.ceil(math.sqrt(n))\n d2 = math.ceil(n/d1)\n\n return (d1*2) + (d2*2)\n\nn = input()\nprint(divisors(n))\n", "n = int(input())\na = 1\nwhile (a * a <= n):\n a += 1\na -= 1\nn -= a * a\nb = a + n // a\nans = 0\nif n % a != 0:\n ans = 2\nprint((a + b) * 2 + ans)\n", "import math\r\nn=int(input())\r\na=math.floor(math.sqrt(n))\r\nif a**2>=n:\r\n print(a*4)\r\nelif a*(a+1)>=n:\r\n print(a*4+2)\r\nelse:\r\n print(a*4+4)", "n=int(input())\r\ni=1\r\nwhile i*i<=n:\r\n i+=1\r\ni-=1\r\nk=n-i*i\r\nif k==0:\r\n print(i*4)\r\nelif k<=i:\r\n print(2+4*i)\r\nelse:\r\n print(4+4*i)\r\n", "from math import sqrt\nn = int(input())\n\nx = int(sqrt(n))\n\nif n - x*x == 0:\n print(4*x)\nelif n - x*x <= x:\n print(4*x + 2)\nelse:\n print(4*x + 4)\n", "import math\r\n\r\nn = int(input())\r\n\r\na = int(math.sqrt(n))\r\nb = math.ceil(n/a)\r\n\r\nprint(2*(a+b))\r\n", "import math\n\na = int(input())\nb = int(a ** (1/2))\n\noutput = 4 * b\n\nif(a - (b ** 2) == 0):\n output += 0\nelif(a - (b ** 2) <= b):\n output += 2\nelse:\n output += 4\n\nprint(output)", "n = int(input())\r\nsq = int(n ** 0.5)\r\nif (n != sq * sq):\r\n sq += 1\r\n start = sq * 4\r\n now = sq * sq\r\n s1 = sq\r\n s2 = sq\r\n while (now - s1 >= n):\r\n now -= s1\r\n s2 -= 1\r\n s1, s2 = min(s1, s2), max(s1, s2)\r\n start -= 2\r\n print(start)\r\n \r\nelse:\r\n print(4 * sq)", "n=int(input())\r\nx=10**6\r\ny=x\r\nfor i in range(1,n+1):\r\n if x+y>i+((n-1)//i+1):\r\n x=((n-1)//i+1)\r\n y=i\r\nprint(2*(x+y))\r\n", "n = int(input())\r\nt = int(n**0.5)\r\ns = n//t\r\n\r\nif s*t != n:\r\n print(2*(s+t)+2)\r\nelse:\r\n print(2*(s+t))\r\n", "n = int(input())\r\ni = 1\r\nCnt_of_cnt = 1\r\nCnt = 0\r\nCnt2 = 0\r\nRes = 4\r\n\r\nwhile i <= n:\r\n while Cnt < Cnt_of_cnt:\r\n Cnt += 1\r\n i += 1\r\n if i <= n:\r\n Res += 2\r\n Cnt2 += 1\r\n Cnt = 0\r\n if Cnt2 >= 2:\r\n Cnt_of_cnt += 1\r\n Cnt2 = 0\r\n\r\nprint(Res)", "import math\r\nnum = int(input())\r\n\r\nside = math.ceil(num**0.5)\r\n\r\nif (side - 1) * side >= num:\r\n ans = (side*2-1)*2\r\nelse:\r\n ans = side * 4\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", "import math\nnumBlocks = int(input())\nside = math.ceil(math.sqrt(numBlocks))\nif side*side - numBlocks < side:\n print(4*side)\nelse:\n print(4*side-2)\n\t \t\t\t\t \t\t \t \t\t\t \t \t", "a = int(input())\r\nb = 1\r\nwhile b*b<=a:\r\n b += 1\r\nb -= 1\r\nif a==b*b:\r\n print(b*4)\r\nelse:\r\n if a-b*b<=b:\r\n print(b*4 + 2)\r\n else:\r\n print(b*4 + 2+2)\r\n", "\r\nfrom math import sqrt\r\nn = int(input())\r\na = int(sqrt(n))\r\nb = int(n / a) \r\nif a * b == n:\r\n print(2 * (a+b))\r\nelse:\r\n print(2 * (a+b) + 2)\r\n# CodeForcesian\r\n# ♥\r\n", "import math\nn=int(input())\nt=int(n**(0.5))\nk=(n-t**2)\na=4*t+math.ceil(k/t)*2\nprint(a)\n", "a=int(input())\r\nb=int(pow(a,0.5))\r\nif(a==(b*b)):\r\n print(4*b)\r\nelif(a<=b*(b+1)):\r\n print(4*b+2)\r\nelse:\r\n print(4*b+4)", "import math\r\nn = int(input())\r\n\r\nr = math.ceil(math.sqrt(n))\r\nprint(r*2 + math.ceil(n/r)*2)", "import math\r\nn=int(input())\r\na=int(math.sqrt(n))\r\nif a*a==n:\r\n print(4*a)\r\nelif a*(a+1)>=n:\r\n print(4*a+2)\r\nelse:\r\n print(4*(a+1))\r\n", "import math\nn=int(input())\na=int(math.ceil(math.sqrt(n)))\nb=a+1\na1=((n-n%a)/a)*2+2*a\nif(n%a!=0):\n a1+=2\na2=((n-n%b)/b)*2+2*b\nif(n%b!=0):\n a2+=2\nprint(int(min(a1,a2)))\n\n\t\t \t\t \t\t \t \t\t \t \t \t \t", "# cook your dish here\r\nfrom math import sqrt,ceil\r\nn=int(input())\r\nx=int(sqrt(n))\r\nif(x*x==n):\r\n # both side x\r\n print(4*x)\r\nelse:\r\n a=x #one side\r\n b=ceil(n/a) # another side\r\n print(2*(a+b))", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------06.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\nn=int(input())\r\nr=int(n**0.5)\r\nh=int(n/r)+int(n%r!=0)\r\nprint(2*(h+r))", "n = int(input())\r\ntemp = int(n**0.5)\r\nn -= temp ** 2\r\nif n // temp != n / temp:\r\n print(temp * 4 + (n//temp+1) * 2)\r\nelse:\r\n print(temp * 4 + (n//temp) * 2)\r\n", "from math import ceil\r\nx = int(input())\r\nt = x**(1/2)\r\nif int(t)*ceil(t) >= x:\r\n\tprint((int(t)+ceil(t))*2)\r\nelse:\r\n\tprint(ceil(t)*4)\r\n", "import math\r\n\r\nN = int(input())\r\nx = int(math.sqrt(N))\r\nr = N - x * x\r\np = 4 * x\r\nif r:\r\n p += 2 if N - x * x <= x else 4\r\nprint(p)\r\n", "import math\r\nn=int(input())\r\nif (math.sqrt(n)).is_integer():\r\n print(int(math.sqrt(n)*4))\r\nelse:\r\n n1 = int(math.sqrt(n))\r\n if (n-(math.pow(n1,2)))>n1:\r\n print(n1*4+4)\r\n else:\r\n print(n1*4+2)", "from math import *\nn=int(input())\nx=n**0.5\nif x==ceil(x):\n print(\"%d\"%(4*x))\nelse:\n x=ceil(x)\n y=n//x\n if n!=x*y:\n y+=1\n print(\"%d\"%(2*(x+y)))\n\n", "from math import ceil, floor, sqrt\n\n\ndef main():\n n = int(input())\n first_line = floor(sqrt(n))\n second_line = ceil(n / first_line)\n\n print((first_line + second_line) * 2)\n\n\nif __name__ == '__main__':\n main()\n", "from math import sqrt\nInput=lambda:map(int,input().split())\n# I wanna achive two same number \n# N = Column*Row\nN = int(input())\nColumn = int(sqrt(N))\nRow = N//Column\nif Column*Row == N:\n print((Column+Row)*2)\nelse:\n print((Column+Row)*2+2)\n\n\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = int(n**0.5)\r\nprint(x*4 + (0 if n-x**2 == 0 else 2 if n-x**2 <= x else 4))", "from math import sqrt\r\nn = int(input())\r\nk = int(sqrt(n))\r\nif n==k*k :\r\n\tprint(4*k)\r\nelif ((k+1)**2)-n < n-(k*k) :\r\n\tprint(4*(k+1))\r\nelse:\r\n\tprint(2*(2*k+1))", "import math\r\ndientich=int(input())\r\ncanh=int(math.sqrt(dientich))\r\n\r\nif canh*canh==dientich:\r\n # hinh vuong\r\n print(4*canh)\r\n exit()\r\nelse:\r\n # hinh vuong khuyet\r\n tmp=dientich-canh*canh\r\n rs=4*canh\r\n while(tmp>0):\r\n if tmp>canh:\r\n rs+=2\r\n tmp-=canh\r\n else:\r\n rs+=2\r\n tmp=0\r\nprint(rs)", "n=int(input())\r\nprint(min(a+(n+a-1)//a for a in range(1,n+1))*2)", "mas = list(map(int, input().split()))\r\nt = mas[0]\r\nkv = 1\r\nwhile((kv + 1) ** 2 <= t):\r\n kv += 1\r\ns = 4 * kv\r\nif (t - kv ** 2 == 0):\r\n print(s)\r\nelif (t - kv ** 2 <= kv):\r\n print(s + 2)\r\nelse:\r\n print(s + 4)", "from math import ceil\r\nfrom math import sqrt\r\nfrom math import floor\r\n\r\nm = int(input())\r\nn = ceil(sqrt(m))\r\no = ceil(m / n)\r\nprint(2 * (n + o))\r\n", "import math\r\n\r\ndef find_perim(x, y, n):\r\n\tcurr_area = x * y\r\n\tif curr_area == n or curr_area - x < n or curr_area - y < n:\r\n\t\treturn 2 * x + 2 * y\r\n\telif curr_area - x >= n:\r\n\t\treturn find_perim(x - 1, y, n)\r\n\telif curr_area - y >= n:\r\n\t\treturn find_perim(x, y - 1, n)\r\n\telse:\r\n\t\tfor i in range(n):\r\n\t\t\tcurr_area -= i\r\n\t\t\tif curr_area == n:\r\n\t\t\t\treturn 2 * x + 2 * y\r\n\t\t\telif curr_area < n:\r\n\t\t\t\tbreak\r\n\t\treturn -1\r\n\r\n\r\nn = int(input())\r\nx = math.ceil(math.sqrt(n))\r\nperim = find_perim(x, x, n)\r\nprint(perim)\r\n", "from math import sqrt\r\nn=int(input())\r\na=(int(sqrt(n))+(n//int(sqrt(n))))*2\r\nprint(a if n%int(sqrt(n))==0 else a+2)", "from math import sqrt\r\nn =int(input())\r\na = int(sqrt(n))\r\nx = n - a**2\r\nif x == 0 :\r\n print(4*a)\r\nelif x<=a :\r\n \r\n print(4*a+2)\r\nelse :\r\n print(4*a +4)", "from math import sqrt\r\nk = int(input())\r\nk1=k\r\nwhile (k1 > 0):\r\n\tx = sqrt(k)\r\n\tk1-=1\r\n\tbreak\r\nx=int(x)\r\ny = k - x * x\r\nif (y == 0):\r\n\ts = x * 4 \r\nif (y <= x and y!=0):\r\n\ts = 4 * x + 2\r\nif (y > x):\r\n\ts = 4 * x + 4\r\n\r\nprint(s)", "'''\r\ncodeforces.com/problemset/problem/859/B\r\nauthor: latesum\r\n'''\r\nimport math\r\na = int(input())\r\nb = math.ceil(math.sqrt(a))\r\nc = math.ceil(a/b)\r\nprint(2*(b+c))\r\n", "import math\r\na = int(input())\r\ns = int(math.sqrt(a))\r\nd = a // s\r\nif a % s != 0:\r\n d += 1\r\nprint((s+d)*2)", "import math\r\nn=int(input())\r\ntotal=0\r\nif n==1:\r\n print(4)\r\nelif n==2:\r\n print(6)\r\nelse:\r\n s=math.sqrt(n)\r\n snumber=math.floor(s)\r\n block=snumber*4\r\n noofblock=snumber**2\r\n noofblock=n-noofblock\r\n if noofblock>1:\r\n\r\n x=noofblock//snumber\r\n f=math.floor(noofblock/(snumber+1))+1\r\n block+=f*2\r\n elif noofblock==1:\r\n block+=2\r\n print(block)", "import math\r\n\r\nn=int(input())\r\n\r\nround_up_sqrt_n=math.ceil(n**.5)\r\nprint(4*round_up_sqrt_n-2*math.floor((round_up_sqrt_n**2-n)/round_up_sqrt_n))", "A = int(input())\r\nans = 10**18\r\nx = 1\r\nwhile x**2 <= A:\r\n\ty = (A + x - 1)//x\r\n\tans = min(ans, 2*(x + y))\r\n\tx += 1\r\n\t\r\nprint(ans)", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\nans=10**9\r\n\r\nfor i in range(1,2000):\r\n if i*i>=n:\r\n ans=i*4\r\n break\r\n if i*(i+1)>=n:\r\n ans=i*4+2\r\n break\r\n\r\nprint(ans)", "import math\r\nn=int(input())\r\nw=int(math.sqrt(n))\r\nif w*w==n:\r\n\tprint(w*4)\r\nelse:\r\n\tremain=n-(w*w)\r\n\tif remain%(w)==0:\r\n\t\te=remain//w\r\n\telse:\r\n\t\te=remain//w+1\r\n\tprint(2*e+(4*w))", "from math import sqrt\n\nn = int(input())\n\np = n\nwhile(True):\n\tx = sqrt(p)\n\ty = int(x)\n\tif ((x-y)==0):\n\t\tbreak\n\tp += 1\n\nd = p-n\na = int(sqrt(p))\n\npm = 0\nif(d<a):\n\tpm = (a*4)\nelse:\n\tpm = (a*2) + ((a-1)*2)\n\nprint(pm)", "import math\r\nn=int(input())\r\nl=math.ceil(math.sqrt(n))\r\nans=4*l\r\nact=l*l\r\nsub=2*((act-n)//l)\r\nprint(ans-sub)", "import math\r\nn=int(input())\r\na=int(math.sqrt(n))\r\nans=4*a\r\nn=n-a*a\r\nans+=2*math.ceil(n/a)\r\nprint(ans)\r\n", "import math\r\nn=int(input())\r\nx=math.sqrt(n)\r\nif x-int(x)==0:\r\n print(int(x*4))\r\nelse:\r\n x=int(x)\r\n if n<=x*(x+1):\r\n print(2*x+2*(x+1))\r\n else:\r\n print((x+1)*4)\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nimport math\r\nn=int(input())\r\nprint(math.ceil(math.sqrt(n)*2)*2)", "import math\r\na = int (input())\r\n\r\nbase_cercana = int(math.sqrt(a))\r\n\r\nif (a) == (base_cercana**2):\r\n print(base_cercana*4)\r\n\r\nelse:\r\n faltante = a - (base_cercana**2)\r\n if faltante <= base_cercana:\r\n h = faltante*2+2\r\n print(base_cercana*4+h-2*faltante)\r\n else:\r\n faltante = faltante - base_cercana\r\n h = faltante*2+2\r\n print(base_cercana*4+h-2*faltante+2)\r\n \r\n \r\n" ]

[ "import math\r\nfrom random import random\r\n\r\ndef getInt():\r\n return(int(input()))\r\n\r\ndef getInts():\r\n line = input().split()\r\n return [int(l) for l in line]\r\n\r\ndef getFloat():\r\n return(float(input()))\r\n\r\ndef getFloats():\r\n line = input().split()\r\n return [float(l) for l in line]\r\n\r\ndef getStrings():\r\n line = input().split()\r\n return(line)\r\n\r\n\r\nN = getInt()\r\nvalues = getInts()\r\n\r\nnConsidered = 0\r\n# nC, nO\r\nbestForChooserSoFar = [0, 0]\r\n\r\nfor i in range(len(values)):\r\n v = values[len(values) - i - 1]\r\n qsIfTaken = [v + bestForChooserSoFar[1], bestForChooserSoFar[0]]\r\n qsIfGiven = [bestForChooserSoFar[0], v + bestForChooserSoFar[1]]\r\n\r\n if(qsIfTaken[0] >= qsIfGiven[0]):\r\n bestForChooserSoFar = qsIfTaken\r\n else:\r\n bestForChooserSoFar = qsIfGiven\r\n\r\nprint(str(bestForChooserSoFar[1]) + ' ' + str(bestForChooserSoFar[0]))", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nb = [0]*n\r\nb[-1]=nums[-1]\r\ns=nums[-1]\r\nfor i in range(n-2,-1,-1):\r\n s+=nums[i]\r\n b[i]=max(b[i+1],s-b[i+1])\r\nprint(s-b[0],b[0])", "from functools import lru_cache\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\n@lru_cache(maxsize = None)\r\ndef f(X):\r\n if len(X) == 1:\r\n return X[0]\r\n a = f(X[1:len(X)])\r\n b = sum(X) - f(X[1:len(X)])\r\n return max(a, b)\r\n\r\nx = f(tuple(A))\r\ny = sum(A) - x\r\nprint(y, x)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nscore = a[n - 1]\r\ntotal = a[n - 1]\r\n\r\nfor i in range(n - 2, -1, -1):\r\n new_score = a[i] + total - score\r\n if new_score > score:\r\n score = new_score\r\n total += a[i]\r\n\r\nprint(total - score, score)", "n=int(input())\r\nl1=[int(a) for a in input().split()]\r\nac,ps=l1[-1],0\r\nfor i in range(1,n):\r\n x1=l1[-1-i]+ps\r\n x2=ac\r\n ac,ps=max(x1,x2),min(x1,x2)\r\nprint(ps,ac)\r\n \r\n", "n = int(input())\r\n\r\na = [int(_) for _ in input().split()]\r\n\r\nsum1 = 0\r\nsum2 = 0\r\n\r\na.reverse()\r\n\r\nfor i in a:\r\n\tif sum1 >= sum2:\r\n\t\tsum2 += i\r\n\telse:\r\n\t\tsum1 += i\r\n\r\nprint(min(sum1, sum2), max(sum1, sum2))\r\n", "n = int(input())\nvs = list(map(int, input().split(' ')))\n\nrs = [0, 0]\n\nfor i in range(n-1, -1, -1):\n rs = [\n min(vs[i] + rs[0], rs[1]),\n max(vs[i] + rs[0], rs[1])\n ]\n\nprint(sum(vs) - rs[1], rs[1])\n", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nb = [0]*n\r\ndp = [0]*n\r\nb[-1]=nums[-1]\r\ndp[-1]=nums[-1]\r\nfor i in range(n-2,-1,-1):\r\n dp[i]=dp[i+1]+nums[i]\r\n b[i]=max(b[i+1],nums[i]+dp[i+1]-b[i+1])\r\nprint(dp[0]-b[0],b[0])", "n=int(input())\r\na=list(map(int,input().split()))\r\na=a[::-1]\r\nd=0\r\nfor i in range(n):\r\n d=max(d,a[i]+sum(a[:i])-d)\r\nprint(sum(a)-d,d)\r\n", "def solve():\n n = int(input())\n arr = list(map(int, input().split()))\n pref = []\n curr = 0\n for i in range(n):\n curr += arr[i]\n pref.append(curr)\n del curr\n x = 0\n for i in range(n - 1, -1, -1):\n x = max(arr[i] + (pref[-1] - pref[i] - x), x)\n return f\"{pref[-1] - x} {x}\"\n \n\ndef main():\n t = 1\n for i in range(t):\n print(solve())\n\n\nmain()", "import sys\r\nread = lambda: sys.stdin.readline().strip()\r\nreadi = lambda: map(int, read().split())\r\nfrom collections import *\r\n\r\nn = int(read())\r\nnums = list(readi())\r\ndp = [0] * n\r\nsum = 0\r\nfor i in range(1, n+1):\r\n i *= -1\r\n sum += nums[i]\r\n dp[i] = max(dp[i+1], sum - dp[i+1])\r\n\r\nprint(sum - dp[0], dp[0])", "n=int(input())\narr=list(map(int,input().split()))\ndecider = [0]*n\ndecider[-1]=arr[-1]\nsum=arr[n-1]\n\nfor i in range(n-2,-1,-1):\n sum+=arr[i]\n decider[i]=max(decider[i+1],sum-decider[i+1])\nprint (sum-decider[0],decider[0])\n", "def go(i,who):\r\n\tif dp[i][who]!=[-1,-1]:\r\n\t\treturn dp[i][who].copy()\r\n\tif i==n-1:\r\n\t\tdp[i][who]=[0,0]\r\n\t\tdp[i][who][who]=s[i]\r\n\t\treturn dp[i][who].copy()\r\n\tres1=go(i+1,1-who)\r\n\tres1[who]+=s[i]\r\n\tres2=go(i+1,who)\r\n\tres2[1-who]+=s[i]\r\n\tif res1[who]>res2[who]:\r\n\t\tdp[i][who]=res1\r\n\telse:\r\n\t\tdp[i][who]=res2\r\n\treturn dp[i][who].copy()\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\ndp=[[[-1,-1],[-1,-1]]for i in range(n)]\r\ngo(0,1)\r\nprint(*dp[0][1])", "n=int(input())\r\narr = list(map(int, input().split()))\r\nif(n==1):\r\n print(0,arr[0])\r\nelse:\r\n dp=[[0 for j in range(2)] for i in range(n)]\r\n dp[n-1][0]=arr[n-1]\r\n for i in range(n-2,-1,-1):\r\n dp[i][0]=max(arr[i]+dp[i+1][1],dp[i+1][0])\r\n dp[i][1]=min(arr[i]+dp[i+1][1],dp[i+1][0])\r\n print(dp[0][1],dp[0][0])", "n=int(input())\r\npies=list(map(int, input().split()))\r\nbob=0\r\nalice=0\r\nfor i in pies[::-1]:\r\n alice+=i\r\n if(bob<alice):\r\n alice,bob=bob,alice\r\n # print(bob,alice)\r\nprint(alice,bob)", "input()\r\na = b = 0\r\nfor q in list(map(int, input().split()))[::-1]:\r\n if b > a + q: a += q\r\n else: b, a = a + q, b\r\nprint(a, b)", "ii=lambda:int(input())\r\nkk=lambda:map(int,input().split())\r\nll=lambda:list(kk())\r\nn,ls=ii(),ll()\r\nvs = [[0,0],[0,0]] # vs[0] == alice has token now, vs[1] == bob has token now\r\nfor i in range(n-1,-1,-1):\r\n\tv2 = [vs[0][0],vs[0][1]+ls[i]] # a->a or b->a\r\n\tv3 = [vs[1][0]+ls[i],vs[1][1]] # a->b or b->b\r\n\tvs = [v2,v3] if v2[0]>v3[0] else [v3,v2]\r\nprint(*vs[1])\r\n", "def solve(N, arr):\n prefixSum = [0]*N\n curr = 0\n for i in range(N):\n curr += arr[i]\n prefixSum[i] = curr\n\n x = 0\n for i in range(N-1, -1, -1):\n if i == N-1:\n x = arr[i]\n else:\n x = max(arr[i] + (prefixSum[-1] - prefixSum[i] - x), x)\n\n print(prefixSum[-1]-x, x)\n\n\nN = int(input())\narr = list(map(int, input().split()))\nsolve(N, arr)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef max_revenue(i, a):\r\n if i == len(a)-1:\r\n return a[-1], 0\r\n before = max_revenue(i+1, a)\r\n take = a[i] + before[1], before[0]\r\n give = before[0], a[i] + before[1]\r\n\r\n if take[0] > give[0]:\r\n return take\r\n else:\r\n return give\r\n\r\nr = max_revenue(0, a)\r\nprint(r[1], r[0])\r\n", "import math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n slices = [int(x) for x in input().split()]\r\n dp = [[[0,0], [0,0]] for i in range(n)]\r\n dp[-1][0] = [slices[-1], 0]\r\n dp[-1][1] = [0, slices[-1]]\r\n for i in range(n-2, -1, -1):\r\n for j in range(0, 2):\r\n take = slices[i] + dp[i+1][1-j][j]\r\n do_not_take = dp[i+1][j][j]\r\n if take > do_not_take:\r\n dp[i][j][j] = take\r\n dp[i][j][1-j] = dp[i+1][1-j][1-j]\r\n else:\r\n dp[i][j][j] = do_not_take\r\n dp[i][j][1-j] = slices[i] + dp[i+1][j][1-j]\r\n print(dp[0][1][0], dp[0][1][1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\n\npie = list(map(int, input().split()))\n\na = b = 0\n \nfor i in reversed(pie):\n if a >= b:\n b += i\n else:\n a += i\n \nprint(str(min([a,b])) + \" \" + str(max([a,b])))", "from os import path;import sys,time\r\nmod = int(1e9 + 7)\r\nfrom math import ceil, floor,gcd,log,log2 ,factorial,sqrt\r\nfrom collections import defaultdict ,Counter , OrderedDict , deque;from itertools import combinations,permutations\r\nfrom string import ascii_lowercase ,ascii_uppercase\r\nfrom bisect import *;from functools import reduce;from operator import mul;maxx = float('inf')\r\nI = lambda :int(sys.stdin.buffer.readline())\r\nlint = lambda :[int(x) for x in sys.stdin.buffer.readline().split()]\r\nS = lambda: sys.stdin.readline().strip('\\n')\r\ngrid = lambda r :[lint() for i in range(r)]\r\nlocalsys = 0\r\nstart_time = time.time()\r\n#left shift --- num*(2**k) --(k - shift)\r\nnCr = lambda n, r: reduce(mul, range(n - r + 1, n + 1), 1) // factorial(r)\r\ndef ceill(n,x):\r\n return (n+x -1 )//x\r\nT =0\r\n\r\ndef solve():\r\n\t#sum of k(arbitrary) elements if > largest element\r\n\tn = I()\r\n\ta = lint()\r\n\tA ,B = 0 ,0\r\n\twhile a :\r\n\t\tx = a.pop()\r\n\t\tp ,q = A , x+ B\r\n\t\tA ,B = max(p, q) , min(p, q)\r\n\tprint(B,A)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t# n , k = lint()\r\n\t# a,ans = lint() ,[0]*n\r\n\t# for i, e in enumerate(a):\r\n\t# \te-=1\r\n\t# \tl,r = max(0, i-k), min(n-1, i+k)\r\n\t# \tif e>=0:\r\n\t# \t\tans[i] +=ans[e]\r\n\t# \t\tl = max(l, min(n-1,e+k)+1)\r\n\t# \tans[i]+= r - l +1\r\n\t# 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\ndef run():\r\n if (path.exists('input.txt')):\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\n\r\nrun()\r\nT = I() if T else 1\r\nfor _ in range(T):\r\n solve()\r\n\r\n\r\nif localsys:\r\n print(\"\\n\\nTime Elased :\",time.time() - start_time,\"seconds\")\r\n\r\n\r\n", "N = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nsuffix = [a[-1]]\r\ntok = [a[-1]]\r\ntol = [0]\r\nbest = [a[-1]]\r\n\r\nfor x in reversed(a[:-1]):\r\n\t# keep\r\n\tkeep = x + suffix[-1] - best[-1]\r\n\tgive = best[-1]\r\n\tbest.append(max(keep,give))\r\n\ttok.append(keep)\r\n\ttol.append(give)\r\n\tsuffix.append(suffix[-1] + x)\r\n\r\n# print(best, tok, tol, suffix)\r\nprint(suffix[-1] - best[-1], best[-1])\r\n\t\r\n\r\n\r\n\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nf,s=0,0\r\nfor i in range(n-1,-1,-1):\r\n if s+a[i]<f:s+=a[i]\r\n else:t=s+a[i];s=f;f=t\r\nprint(s,f)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndp = [[0, 0] for i in range(n)]\r\ndp[n - 1][0] = 0\r\ndp[n - 1][0] = a[n-1]\r\n\r\nfor i in range(n - 2, -1, -1):\r\n dp[i][0] = max(dp[i + 1][0], dp[i + 1][1])\r\n dp[i][1] = min(dp[i + 1][0], dp[i + 1][1]) + a[i]\r\n\r\nprint(min(dp[0][0], dp[0][1]), max(dp[0][0], dp[0][1]))", "n = int(input())\r\na = list(map(int, input().split()))\r\na = a[::-1]\r\nd = 0\r\nfor i in range(len(a)):\r\n d = max(0 + d, a[i] + (sum(a[:i]) - d))\r\nprint(sum(a)-d, d)\r\n", "cases = int(input())\r\npies = input().split()\r\ns = [[0] * cases for i in range(2)]\r\ncases = cases -1\r\ns[0][cases] = int(pies[cases])\r\nfor i in range(cases-1, -1, -1):\r\n if (int(s[0][i+1]) < (int(s[1][i+1]) + int(pies[i]) )):\r\n s[0][i] = (int(s[1][i+1]) + int(pies[i]))\r\n s[1][i] = s[0][i+1]\r\n else:\r\n s[0][i] = s[0][i+1]\r\n s[1][i] = (int(s[1][i+1]) + int(pies[i]))\r\nprint(s[1][0],s[0][0])", "n=int(input())\r\nx=list(map(int,input().split()))\r\nma,count=0,0\r\nfor i in range(n-1,-1,-1):\r\n ma=max(ma,x[i]+count-ma)\r\n count+=x[i]\r\nprint(count-ma,ma)", "#\t!/bin/env python3\r\n#\tencoding: UTF-8\r\n#\tModified: <31/Dec/2018 03:07:49 PM>\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology (IIIT),Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/859/C\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\nsys.setrecursionlimit(20000)\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef input(): return sys.stdin.readline()\r\n\r\n# ///==========MAIN=============///\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = get_array()\r\n dp = [[0] * 2 for _ in range(n + 1)]\r\n dp[n][1] = arr[-1]\r\n dp[n][0] = 0\r\n for i in range(n - 1, 0, -1):\r\n dp[i][1] = max(dp[i + 1][0] + arr[i - 1], dp[i + 1][1])\r\n dp[i][0] = min(dp[i + 1][0] + arr[i - 1], dp[i + 1][1])\r\n print(sum(arr) - dp[1][1], dp[1][1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl1=list(map(int, input().split()))\r\nscore=[0]\r\ntotal=[0]\r\nrest=[0]\r\n\r\nfor i in range(len(l1)-1,-1,-1):\r\n total.append(total[len(l1)-1-i]+l1[i])\r\n score.append(max(l1[i]+total[len(l1)-1-i]-score[len(l1)-1-i],score[len(l1)-1-i]))\r\n\r\n\r\nprint(total[-1]-score[-1],score[-1])", "n = int(input())\r\nk = list(map(int, input().split()))\r\ns = []\r\nss = sum(k)\r\ngame = [0 for i in range(n)]\r\nfor i in range(n):\r\n s.append(ss)\r\n ss-=k[i]\r\ngame[-1] = s[-1]\r\nfor i in range(1, n):\r\n game[-i-1] = max(s[-i-1]-game[-i], game[-i])\r\nprint(sum(k)-game[0], game[0])", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = s = 0\r\nfor ai in reversed(a):\r\n x = max(x, ai + s - x)\r\n s += ai\r\n\r\nprint(s - x, x)\r\n", "number_of_cakes = int(input())\r\n\r\ncakes = [int(x) for x in input().split()]\r\n\r\ncakes_inverse = []\r\n\r\nfor i in range(number_of_cakes, 0, -1):\r\n cakes_inverse.append(cakes[i - 1])\r\n\r\nalisa_previous_alisa_choose = 0\r\nalisa_previous_bob_choose = 0\r\nbob_previous_alisa_choose = 0\r\nbob_previous_bob_choose = 0\r\n\r\nfor i in range(number_of_cakes):\r\n if (alisa_previous_alisa_choose > alisa_previous_bob_choose + cakes_inverse[i]):\r\n alisa_present_alisa_choose = alisa_previous_alisa_choose\r\n bob_present_alisa_choose = bob_previous_alisa_choose + cakes_inverse[i]\r\n else:\r\n alisa_present_alisa_choose = alisa_previous_bob_choose + cakes_inverse[i]\r\n bob_present_alisa_choose = bob_previous_bob_choose\r\n\r\n if (bob_previous_bob_choose > bob_previous_alisa_choose + cakes_inverse[i]):\r\n bob_present_bob_choose = bob_previous_bob_choose\r\n alisa_present_bob_choose = alisa_previous_bob_choose + cakes_inverse[i]\r\n else:\r\n bob_present_bob_choose = bob_previous_alisa_choose + cakes_inverse[i]\r\n alisa_present_bob_choose = alisa_previous_alisa_choose\r\n\r\n alisa_previous_alisa_choose = alisa_present_alisa_choose\r\n alisa_previous_bob_choose = alisa_present_bob_choose\r\n bob_previous_alisa_choose = bob_present_alisa_choose\r\n bob_previous_bob_choose = bob_present_bob_choose\r\n\r\nprint(alisa_present_bob_choose, bob_present_bob_choose)\r\n", "n = int(input())\na = input().split()\n\nslices = [[0] * n for i in range(2)]\nn = n -1\n\nslices[0][n] = int(a[n])\n\nfor i in range(n-1, -1, -1):\n\n if (int(slices[0][i+1]) < (int(slices[1][i+1]) + int(a[i]) )):\n slices[0][i] = (int(slices[1][i+1]) + int(a[i]))\n slices[1][i] = slices[0][i+1]\n \n else:\n slices[0][i] = slices[0][i+1]\n slices[1][i] = (int(slices[1][i+1]) + int(a[i]))\n\nx= slices[1][0]\ny = slices[0][0] \n\nprint(f\"{x} {y}\")\n \t\t\t \t \t \t \t \t\t\t \t\t", "n = int(input())\r\np = [int(a) for a in input().split(\" \")][::-1]\r\nalice = [[0]*n for a in range(2)]\r\nt = 0\r\n\r\nfor a in p:\r\n t += a\r\n\r\nalice[0][0] = p[0]\r\n\r\nfor a in range(1,n):\r\n if p[a] + alice[1][a-1] > alice[0][a-1]:\r\n alice[0][a] = p[a] + alice[1][a-1]\r\n alice[1][a] = alice[0][a-1]\r\n else:\r\n alice[0][a] = alice[0][a - 1]\r\n alice[1][a] = p[a] + alice[1][a - 1]\r\n\r\nprint(alice[1][-1],alice[0][-1])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nsa=[0]*n\r\ndp=[0]*n\r\nsa[-1]=a[-1]\r\nfor i in range(n-1)[::-1]:\r\n sa[i]=sa[i+1]+a[i]\r\ndp[-1]=a[-1]\r\nfor i in range(0,n-1)[::-1]:\r\n dp[i]=max(dp[i+1],sa[i+1]-dp[i+1]+a[i])\r\nprint(sa[0]-dp[0],dp[0])", "n = int(input())\r\nsizes = [int(x) for x in input().split(' ')]\r\nsizes.reverse()\r\na = b = 0\r\nfor i in sizes:\r\n if i + b > a:\r\n a, b = i + b, a\r\n else:\r\n b = i + b\r\nprint(b, ' ', a)\r\n", "n = int(input())\npies = list(map(int,input().split()))\nbestToken = [0] * (n+1)\nbestNoToken = [0] * (n+1)\nfor i in range(n-1,-1,-1):\n if bestNoToken[i+1] + pies[i] > bestToken[i+1]:\n bestToken[i] = bestNoToken[i+1] + pies[i]\n bestNoToken[i] = bestToken[i+1]\n else:\n bestToken[i] = bestToken[i+1]\n bestNoToken[i] = pies[i] + bestNoToken[i+1]\nprint(bestNoToken[0], bestToken[0])\n", "n = int(input())\npieces = list(map(int, input().split()))\n\nreversed_pieces = list(reversed(pieces))\n\nTOTAL = []\n\ncurrent_total = 0\nfor piece in reversed_pieces:\n current_total += piece\n TOTAL.append(current_total)\n\nHAS_TOKEN = 0\nNO_TOKEN = 1\n\ndp_alice = [[0] * n, [0] * n]\ndp_bob = [[0] * n, [0] * n]\n\n\ndp_alice[HAS_TOKEN][0] = dp_bob[HAS_TOKEN][0] = reversed_pieces[0]\ndp_alice[NO_TOKEN][0] = dp_bob[NO_TOKEN][0] = 0\n\nfor i in range(1, n):\n dp_alice[HAS_TOKEN][i] = max(dp_alice[HAS_TOKEN][i-1], dp_alice[NO_TOKEN][i-1] + reversed_pieces[i])\n dp_bob[HAS_TOKEN][i] = max(dp_bob[HAS_TOKEN][i-1], dp_bob[NO_TOKEN][i-1] + reversed_pieces[i])\n\n dp_alice[NO_TOKEN][i] = TOTAL[i] - dp_bob[HAS_TOKEN][i]\n dp_bob[NO_TOKEN][i] = TOTAL[i] - dp_alice[HAS_TOKEN][i]\n\nprint(dp_alice[NO_TOKEN][-1], dp_bob[HAS_TOKEN][-1])\n", "N = int(input())\r\nn = list(map(int,input().split(\" \")))\r\n\r\nif N == 1:\r\n ans = [0, n[0]]\r\nelif N == 2:\r\n ans = [min(n), max(n)]\r\nelse:\r\n # print(n)\r\n n.reverse()\r\n f = max(n[0], n[1]) # f2\r\n s = n[0] + n[1] # s2\r\n for i in range(2, N):\r\n f = max(n[i] + s - f, f)\r\n s += n[i]\r\n # print(f)\r\n # print(s)\r\n ans = [s-f, f]\r\n \r\nprint(\" \".join(map(str,ans)))\r\n\r\n# assume f(n) is the optimal strategy for the remaning n pies, x_n, x_n-1, ...., x_1\r\n#\r\n# s(n) = sum(x_1,..., x_n)\r\n# f(1) = x1\r\n# f(2) = max(x2, x1)\r\n# f(3) = max(x3 + s(2) - f(2), f(2))\r\n# f(4) = max(x4 + s(3) - f(3), f(3))", "input();a=b=0\nfor i,x in enumerate(list(map(int,input().split()))[::-1]):\n if b>a+x:a+=x\n else:a,b=b,a+x\nprint(a,b)\n\t \t\t\t \t \t \t\t\t\t \t\t \t\t \t\t", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\npie=list(map(int,input().split()))\r\n\r\ndef dp(i):\r\n # best result for this player\r\n if i>=len(pie): return (0,0)\r\n t1,t2=dp(i+1)\r\n return (max(pie[i]+t2-t1,t1),t2+pie[i])\r\n\r\nt1,t2=dp(0)\r\n\r\nprint(t2-t1,t1)", "n = int(input())\np = [int(x) for x in input().split(\" \")]\na = b = 0\np.reverse()\n\n\nfor pie in p:\n if b > a + pie:\n a += pie\n else:\n a , b = b, a + pie\nprint(a, b)\n\n\n# for c in p:\n# if b > a + c:\n# a += c\n# else:\n# b, a = a + c, b\n\n# while t:\n# for i in reversed(range(len(p))):\n# count = 0\n# if p[i] >= sum(p[:i]):\n# b.append(p[i])\n# for j in range(i):\n# a.append(p[j])\n# p = p[i+1:]\n# break\n# else:\n# count += 1\n# if count == len(p):\n# b.append(p[0])\n# p = p[1:]\n# break\n#\n# if p == []:\n# break\n# for i in reversed(range(len(p))):\n# count = 0\n# if p[i] >= sum(p[:i]):\n# a.append(p[i])\n# for j in range(i):\n# b.append(p[j])\n# p = p[i+1:]\n# break\n# else:\n# count += 1\n# if count == len(p):\n# a.append(p[0])\n# p = p[1:]\n# break\n# if p == []:\n# break\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\nsumA = 0\r\nsumB = 0\r\nfor i in range( a ):\r\n if b[a-1-i] > abs(sumA - sumB):\r\n sumA += b[a-1-i]\r\n sumA, sumB = sumB, sumA\r\n else:\r\n sumA += b[a-1-i]\r\nprint(min(sumA,sumB), max(sumA, sumB))", "n = int(input())\r\npies = [int(x) for x in input().split()]\r\n\r\nd = {}\r\nd[0] = pies[-1]\r\n\r\nfor i in range(1, n):\r\n d[i] = max(sum(pies[-1-i:]) - d[i-1], d[i-1])\r\n\r\ns = sum(pies)\r\n\r\nres = d[n-1]\r\n\r\nprint(s - res, res)\r\n", "def check(i, bob):\n if i >= n:\n return 0, 0\n if dp[bob][i] != (-1, -1):\n return dp[bob][i]\n if bob:\n x = check(i+1, False)\n y = check(i+1, True)\n if x[0]+arr[i] >= y[0]:\n ret = x[0]+arr[i], x[1]\n else:\n ret = y[0], y[1]+arr[i]\n else:\n x = check(i+1, True,)\n y = check(i+1, False,)\n if x[1]+arr[i] >= y[1]:\n ret = x[0], x[1]+arr[i]\n else:\n ret = y[0]+arr[i], y[1]\n dp[bob][i] = ret\n return ret\n\n\nn = int(input())\n\ndp = [(-1, -1)]*n\ndp = [dp, dp.copy()]\n\narr = list(map(int, input().split()))\nans = check(0, True)\nprint(ans[1], ans[0])\n", "def do(n,l):\r\n if n==1:\r\n return [l[0],0]\r\n a=do(n-1,l[1:n])\r\n if a[1]+l[0]>a[0]:\r\n return [a[1]+l[0],a[0]]\r\n return [a[0],a[1]+l[0]]\r\n \r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nlsp=do(n,l)\r\nlsp.sort()\r\nprint(lsp[0],lsp[1])\r\n\r\n\r\n \r\n", "n = int(input())\r\na = list(map(int,input().split()[::-1]))\r\nf = [[0,0]for i in range(n)]\r\nf[0][1] = a[0]\r\nf[0][0] = 0\r\nfor i in range(1,n):\r\n f[i][1] = max(f[i-1][0]+a[i],f[i-1][1])\r\n f[i][0] = min(f[i - 1][0] + a[i], f[i - 1][1])\r\nans = f[-1][1]\r\n#print(*f,sep='\\n')\r\nprint(sum(a)-ans,ans)\r\n", "import traceback\r\n\r\ntry:\r\n N = int(input())\r\n nums = list(map(int, input().split()))\r\n tot = 0\r\n dp = 0\r\n for i in range(N-1, -1, -1):\r\n tot += nums[i]\r\n dp = max(dp, tot - dp)\r\n b = dp\r\n a = tot - b\r\n print(a, b)\r\nexcept Exception:\r\n traceback.print_exc()", "n = int(input())\r\na = list(map(int, input().split()))\r\na.reverse()\r\n\r\nd = [0 for i in range(n)]\r\nd[0] = [a[0], 0]\r\n\r\nfor i in range(1, n):\r\n d[i] = [max(d[i-1][0], d[i-1][1] + a[i]), min(d[i-1][0], d[i-1][1] + a[i])]\r\n\r\nprint(d[-1][1], d[-1][0])", "def readints():\n return [int(obj) for obj in input().strip().split()]\n\n\nclass Solver:\n def main(self):\n n = readints()[0]\n a = readints()\n f = [0] * n\n\n f[n - 1] = a[n - 1]\n for i in range(n - 2, -1, -1):\n f[i] = max(\n sum(a[i:n]) - f[i+1],\n f[i+1],\n )\n print(sum(a) - f[0], f[0])\n\n\nSolver().main()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\np, s = a[-1], a[-1]\r\nfor j in range(n - 2, -1, -1):\r\n p = max(a[j] + s - p, p)\r\n s += a[j]\r\nprint(s - p, p)", "n = int(input())\narr = list(map(int, input().split()))\nmx, c = 0, 0\nfor i in range(n-1, -1, -1):\n mx = max(mx, arr[i]+c-mx)\n c += arr[i]\nprint(c - mx, mx)\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na1 = [[-1] * 50, [-1] * 50]\r\ndef get(i, fl):\r\n if i >= n:\r\n return 0\r\n if (a1[fl][i] != -1):\r\n return a1[fl][i]\r\n if fl == 0:\r\n a1[fl][i] = max(a[i] + get(i + 1, 1), get(i + 1, 0))\r\n else:\r\n a1[fl][i] = min(a[i] + get(i + 1, 1), get(i + 1, 0))\r\n return a1[fl][i]\r\n\r\nan = get(0, 0)\r\nprint(sum(a) - an, an)\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\ntoke=wait=0\r\nfor i,x in enumerate(lst[::-1]):\r\n if toke>wait+x:wait+=x\r\n else:toke,wait=wait+x,toke\r\nprint(wait,toke)", "def maximum_pie_consumption(pies):\n c = len(pies) - 1\n toke = wait = 0\n for p in reversed(pies):\n if toke < p + wait:\n toke, wait = wait + p, toke\n else:\n wait += p\n return wait, toke\n\nif __name__ == \"__main__\":\n input()\n pies = list(map(int, input().strip().split()))\n print(\" \".join(map(str, maximum_pie_consumption(pies))))\n", "n = int(input())\r\nl = list(map(int,input().split() ))\r\n\r\nx1 = l[-1]\r\nx2 = 0\r\ni = n - 2\r\nt = [0 for i in range(n)] \r\n\r\np = 0\r\n\r\nwhile ( i >= 0) :\r\n\r\n\tif p == 0 :\r\n\t\tif x2 + l[i] <= x1 :\r\n\t\t\tx2 += l[i]\r\n\t\t\tp = 0\r\n\t\telse :\r\n\t\t\tx2 += l[i]\r\n\t\t\tp = 1\r\n\telse :\r\n\t\tif x1 + l[i] <= x2 :\r\n\t\t\tx1 += l[i]\r\n\t\t\tp = 1\r\n\t\telse :\r\n\t\t\tx1 += l[i]\r\n\t\t\tp = 0\r\n\r\n\ti -= 1\r\n\r\nprint(min(x1,x2),max(x1,x2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ndp=[[0,0] for i in range(n)]\r\ndp[n-1][0]=l[n-1]\r\ndp[n-1][1]=0\r\ns=l[n-1]\r\nfor i in range(n-2,-1,-1):\r\n s+=l[i]\r\n dp[i][0]=max(l[i]+dp[i+1][1],dp[i+1][0])\r\n dp[i][1]=min(l[i]+dp[i+1][1],dp[i+1][0])\r\nprint (s-dp[0][0],dp[0][0])\r\n", "input();a=b=0\r\nfor i,x in enumerate(list(map(int,input().split()))[::-1]):\r\n if b>a+x:a+=x\r\n else:a,b=b,a+x\r\nprint(a,b)", "n = int(input())\r\nd = [[0 for i in range(2)] for i in range(n)]\r\nw = [int(z) for z in input().split()]\r\nw.reverse()\r\nd[0][1] = w[0]\r\nd[0][0] = 0\r\nsumm = w[0]\r\nfor i in range(1,n):\r\n summ += w[i]\r\n d[i][1] = max(d[i - 1][1], d[i - 1][0] + w[i])\r\n d[i][0] = summ - d[i][1]\r\nprint(min(d[n - 1][1],d[n - 1][0]), summ - min(d[n - 1][1],d[n - 1][0]))\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ncake = list(map(int, input().split()))\r\ncake.reverse()\r\npref = [0]\r\nfor i in range(n):\r\n pref.append(cake[i] + pref[-1])\r\ndp = [0] * n\r\ndp[0] = cake[0]\r\nfor i in range(1, n):\r\n dp[i] = max(dp[i - 1], cake[i] + pref[i] - dp[i - 1])\r\nprint(pref[n] - dp[n - 1], dp[n - 1])", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nvalues = list(map(int, stdin.readline().split()))\r\ndp = [0 for i in range(n)]\r\n\r\ndp[-1] = values[-1]#сколько торта можно захавать, если прийдти туда с фишкой\r\ncnt = values[-1]\r\n\r\nfor i in range(n - 2, -1, -1):\r\n cnt += values[i]\r\n dp[i] = max(dp[i + 1], cnt - dp[i + 1])\r\n\r\nstdout.write(str(cnt - dp[0]) + ' ' + str(dp[0]))", "n=int(input())\r\narray=input().split()\r\nfin=[]\r\nfor i in array:\r\n fin.append(int(i))\r\ndp=[[0 for x in range(len(array))] for y in range(2)]\r\ndp[0][-1]=fin[-1]\r\ndp[1][-1]=0\r\ni=len(array)-2\r\nwhile(i>=0):\r\n dp[0][i]=max((fin[i]+dp[1][i+1]),(dp[0][i+1]))\r\n dp[1][i]=min((fin[i]+dp[1][i+1]),(dp[0][i+1]))\r\n i-=1\r\nprint(dp[1][0],dp[0][0])", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\na = [0]*n\r\nb = [0]*n\r\ndp = [0]*(n)\r\na[-1]=nums[-1]\r\nb[-1]=nums[-1]\r\ndp[-1]=nums[-1]\r\nfor i in range(n-2,-1,-1):\r\n dp[i]=dp[i+1]+nums[i]\r\n a[i]= max(a[i+1],nums[i]+dp[i+1]-b[i+1])\r\n b[i]=max(b[i+1],nums[i]+dp[i+1]-a[i+1])\r\nprint(dp[0]-b[0],b[0])", "n = int(input())\r\n*a, = map(int, input().split())\r\na = a[::-1]\r\npref, dp = [a[0]], [a[0]]\r\nfor i in range(1, n):\r\n pref.append(pref[i - 1] + a[i])\r\n dp.append(max(dp[i - 1], pref[i - 1] - dp[i - 1] + a[i]))\r\nprint(pref[n - 1] - dp[n - 1], dp[n - 1])", "n = int(input())\r\narr = list(map(int, input().strip().split()))\r\nsumi = [0 for i in range(n)]\r\nsumi[-1] = arr[-1]\r\nfor i in range(n-2, -1, -1):\r\n sumi[i] = sumi[i+1]+arr[i]\r\n\r\ndp = [[[0, 0], [0, 0]] for i in range(n+1)]\r\n\r\ndp[n-1][0] = [arr[-1], 0]\r\ndp[n-1][1] = [0, arr[-1]]\r\nfor i in range(n-2, -1, -1):\r\n for j in range(i, n):\r\n # 0 turn\r\n c1 = arr[j] + dp[j+1][1][0]\r\n if c1 > dp[i][0][0]:\r\n dp[i][0] = [c1, sumi[i]-c1]\r\n \r\n #1 turn\r\n c2 = arr[j] + dp[j+1][0][1]\r\n if c2 > dp[i][1][1]:\r\n dp[i][1] = [sumi[i]-c2, c2]\r\n\r\nprint(*dp[0][1])\r\n \r\n", "n = int(input())\na = list(map(int,input().split()))\nfirst = [0]*n\nsecond= [0]*n\na.reverse()\nfirst[0] = a[0]\n\nfor i in range(1,n):\n if (a[i]+second[i-1] >= first[i-1]):\n first[i] = a[i]+second[i-1]\n second[i] = first[i-1]\n else:\n first[i] = first[i-1]\n second[i] = a[i]+second[i-1]\n\nprint(second[n-1],first[n-1])\n", "N = int(input())\r\nList = [int(x) for x in input().split()]\r\nAlice = 0\r\nBob = 0\r\nfor i in range(N-1,-1,-1):\r\n if(Bob>Alice + List[i]):\r\n Alice += List[i]\r\n else:\r\n Alice, Bob = Bob, Alice + List[i]\r\nprint(Alice, Bob)\r\n " ]

[ "n=int(input())\r\np=set(map(int,input().split()[1:]))\r\nq=set(map(int,input().split()[1:]))\r\na=set(range(1,n+1))\r\nal=p.union(q)==a\r\nif al:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# Read input\r\nn = int(input())\r\np_info = list(map(int, input().split()))\r\nq_info = list(map(int, input().split()))\r\n\r\n# Create sets to store the levels Little X and Little Y can pass\r\np_levels = set(p_info[1:])\r\nq_levels = set(q_info[1:])\r\n\r\n# Create a set of all levels from 1 to n\r\nall_levels = set(range(1, n + 1))\r\n\r\n# Check if the union of the levels Little X and Little Y can pass is equal to all levels\r\nif p_levels.union(q_levels) == all_levels:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "\r\nnewlist=[]\r\n\r\nj=int(input())\r\nk=list(map(int,input().split()))\r\ni=list(map(int,input().split()))\r\n\r\nk.pop(0)\r\ni.pop(0)\r\n\r\nfor x in k:\r\n newlist.append(x)\r\nfor y in i:\r\n newlist.append(y)\r\n\r\nnewlist=set(newlist)\r\nnewlist=list(newlist)\r\n\r\ne=len(newlist)\r\n\r\nif e>=j:\r\n print(\"I become the guy.\")\r\nelse:\r\n print('Oh, my keyboard!')", "n=int(input())\r\np=list(map(int,input().split()))\r\ns=list(map(int,input().split()))\r\np.pop(0)\r\ns.pop(0)\r\nm=[]\r\nfor i in range(1,n+1):\r\n m.append(i)\r\nsum=0\r\nfor j in m:\r\n if j in p+s:\r\n sum+=1\r\nif sum==len(m):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n \r\n \r\n \r\n", "def can_pass_all_levels(n, p_levels, q_levels):\r\n levels = [False] * n\r\n\r\n for level in p_levels:\r\n levels[level - 1] = True\r\n \r\n for level in q_levels:\r\n levels[level - 1] = True\r\n \r\n for level in levels:\r\n if not level:\r\n return False\r\n \r\n return True\r\n\r\nn = int(input())\r\np_levels = list(map(int, input().split()))[1:]\r\nq_levels = list(map(int, input().split()))[1:]\r\n\r\nif can_pass_all_levels(n, p_levels, q_levels):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n", "n = int(input())\r\na = input().split()\r\nb = input().split()\r\na.pop(0)\r\nb.pop(0)\r\nc = a+b\r\nfor i in range(1, n+1):\r\n if str(i) not in c:\r\n print(\"Oh, my keyboard!\")\r\n raise SystemExit\r\nprint(\"I become the guy.\")", "def can_pass_levels(n, x_levels, y_levels):\r\n all_levels = set(range(1, n+1))\r\n x_levels = set(x_levels[1:])\r\n y_levels = set(y_levels[1:])\r\n \r\n combined_levels = x_levels.union(y_levels)\r\n \r\n if combined_levels == all_levels:\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n x_levels = list(map(int, input().split()))\r\n y_levels = list(map(int, input().split()))\r\n print(can_pass_levels(n, x_levels, y_levels))\r\n", "n = int(input())\r\np1 = list(map(int, input().split()))\r\np2 = list(map(int, input().split()))\r\nprint(\"Oh, my keyboard!\" if {*range(1, n + 1)} - (set(p1[1:]).union(set(p2[1:]))) else \"I become the guy.\")", "n = int(input())\r\nx_levels = set(map(int, input().split()[1:]))\r\ny_levels = set(map(int, input().split()[1:]))\r\n\r\n# Combine the levels they can pass\r\npassable_levels = x_levels.union(y_levels)\r\n\r\n# Check if all levels are covered\r\nif len(passable_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "a,b,c=int(input()),list(map(int,input().split())),list(map(int,input().split()))\r\nprint(\"I become the guy.\") if len(set(tuple(b[1::]+c[1::])))==a else print(\"Oh, my keyboard!\")", "n = int(input())\r\ns1 = 0\r\ns2 = 0\r\nnum1 = input().split()\r\nnum1 = list(map(int, num1))\r\nnum2 = input().split()\r\nnum2 = list(map(int, num2))\r\na = num1[1:]\r\nb = num2[1:]\r\nc = a + b\r\nd = list(set(c))\r\nnumber_list = list(range(1, n + 1))\r\nif d == number_list:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n = int(input())\np_1 = list(map(int, input().split()))\np_2 = list(map(int, input().split()))\nlevels = []\nfor j in range(1,len(p_1)):\n if True:\n levels.append(p_1[j])\nfor i in range(1, len(p_2)):\n if True:\n levels.append(p_2[i])\nif len(set(levels)) < n:\n print('Oh, my keyboard!')\nelse:\n print('I become the guy.')\n ", "listforchecking = []\r\nh=int(input())\r\nf=0\r\nfor makealist in range(h):\r\n listforchecking.append(makealist+1)\r\nlittlex=list(map(int,input().split()))\r\nlittlex=littlex[1:]\r\nlittley=list(map(int,input().split()))\r\nlittley=littley[1:]\r\nz=[]\r\nfor a in littlex:\r\n z.append(a)\r\nfor a in littley:\r\n z.append(a)\r\nzset=set(z)\r\nzlist=list(zset)\r\nif len(zlist)>=len(listforchecking):\r\n for i in listforchecking:\r\n if i in zlist:\r\n f+=1\r\nprint(\"I become the guy.\" if f>=h else \"Oh, my keyboard!\")\r\n", "r = int(input())\r\ne = [int(x) for x in input().split()[1:]]\r\ng = [int(x) for x in input().split()[1:]]\r\ns = 1\r\nfor i in range(1, r + 1):\r\n if i not in e and i not in g:\r\n print(\"Oh, my keyboard!\")\r\n s = 0\r\n break\r\nif s == 1:\r\n print(\"I become the guy.\")", "n = int(input())\r\nX, Y = set(map(int, input().split()[1:])), set(map(int, input().split()[1:]))\r\nprint('I become the guy.' if len(X.union(Y)) == n else 'Oh, my keyboard!')", "totalLevel = int(input())\r\n\r\nxLevel = list(map(int, input().split()))\r\nyLevel = list(map(int, input().split()))\r\n\r\nxAndyLevelsList = xLevel[1:] + yLevel[1:]\r\n\r\nxAndyLevels = set(xAndyLevelsList) \r\n\r\nif(len(xAndyLevels) == totalLevel):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=input()\n\nn=int(n)\na=input().split()\na=a[1:]\nb=input().split()\nb=b[1:]\nfor i in range (len(a)):\n a[i]=int(a[i])\nfor i in range (len(b)):\n b[i]=int(b[i])\n\n\n\n\nflag=0\nfor i in range (n):\n if not(i+1 in a) and not(i+1 in b):\n flag=1\n break\n\nif(flag==1):\n print(\"Oh, my keyboard!\")\nelse:\n print(\"I become the guy.\")\n\n \t \t \t \t \t\t\t\t\t \t \t \t\t\t \t\t\t\t", "'''n = int(input())\r\np = set(map(int, input().split()))\r\nq = set(map(int, input().split()))\r\nu = p.union(q)\r\nif 0 in u:\r\n u.remove(0)\r\nif len(u) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')'''\r\nnu = int(input()) \r\nlevels = set(range(1, nu+1)) \r\nx = set(map(int, input().split()[1:])) \r\ny = set(map(int, input().split()[1:])) \r\ncovered_levels = x.union(y) \r\nif levels.issubset(covered_levels):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n", "def can_pass_all_levels(n, p_levels, q_levels):\r\n all_levels = set(range(1, n + 1))\r\n passed_levels = set(p_levels[1:] + q_levels[1:])\r\n \r\n if all_levels == passed_levels:\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\nn = int(input())\r\np_levels = list(map(int, input().split()))\r\nq_levels = list(map(int, input().split()))\r\nresult = can_pass_all_levels(n, p_levels, q_levels)\r\nprint(result)", "# Read n\r\nn = int(input())\r\n\r\n# Read the levels Little X can pass\r\np_levels = set(map(int, input().split()[1:]))\r\n\r\n# Read the levels Little Y can pass\r\nq_levels = set(map(int, input().split()[1:]))\r\n\r\n# Combine the levels they can pass\r\nall_levels = p_levels.union(q_levels)\r\n\r\n# Check if they can pass all levels\r\nif len(all_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# Input the number of levels\r\nn = int(input())\r\n\r\n# Create a list to represent the levels\r\nlevels = [0] * n\r\n\r\n# Input the levels Little X can pass\r\np_x, *x_levels = map(int, input().split())\r\n\r\n# Input the levels Little Y can pass\r\np_y, *y_levels = map(int, input().split())\r\n\r\n# Mark the levels Little X can pass\r\nfor level in x_levels:\r\n levels[level - 1] = 1\r\n\r\n# Mark the levels Little Y can pass\r\nfor level in y_levels:\r\n levels[level - 1] = 1\r\n\r\n# Check if all levels are marked\r\nif all(levels):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\np_x, *a_x = (int(x) for x in input().split())\r\np_y, *a_y = (int(x) for x in input().split())\r\nif set(a_x + a_y) == set(range(1, n+1)):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "import sys\r\nlevels = int(sys.stdin.readline().strip())\r\nx = sys.stdin.readline().strip().split()\r\ny = sys.stdin.readline().strip().split()\r\ncommon = x[1:] + y[1:]\r\nif len(set(common)) == levels:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=a[1:]\r\nd=b[1:]\r\nfor i in d:\r\n if i not in c:\r\n c.append(i)\r\nif len(c)==t:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input())\r\np=list(map(int, input().split()))\r\nq=list(map(int, input().split()))\r\nwhole={x for x in range(1,n+1)}\r\nxpassed=set(p[1:])\r\nypassed=set(q[1:])\r\nif xpassed|ypassed==whole:\r\n print('I become the guy.')\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n= int(input())\r\nX = list(map(int,input().split()))\r\nY = list(map(int,input().split()))\r\nres = set(X[1:] + Y[1:])\r\nif(len(res)==n):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ng=[]\r\nfor i in range(1,len(a)):\r\n g.append(a[i])\r\nfor i in range(1,len(b)):\r\n g.append(b[i])\r\nd=0\r\nfor i in range(1,n+1):\r\n if i in g:\r\n d=d+1\r\nif(d==n):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\nlist_set = []\r\n\r\nfor i in range(1,len(x)):\r\n list_set.append(x[i])\r\nfor j in range(1, len(y)):\r\n list_set.append(y[j])\r\n\r\nif len(set(list_set)) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n = input()\nn = int(n)\n\nvis = []\n\nfor i in range(n+1):\n vis.append(0)\n\np = input().split()\nq = input().split()\n\nfor i in range(len(p)):\n p[i] = int(p[i])\n\nfor i in range(len(q)):\n q[i] = int(q[i])\n\nfor i in range(1, len(p)):\n level = p[i]\n vis[level] = 1\n\nfor i in range(1, len(q)):\n level = q[i]\n vis[level] = 1\n\nflag = True\nfor level in range(1, len(vis)):\n if vis[level] == 0:\n flag = False\n\nif flag:\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\t \t \t \t \t\t \t\t\t\t \t\t\t \t\t\t", "def can_pass_game(n, x_levels, y_levels):\n all_levels = set(range(1, n+1))\n x_levels = set(x_levels[1:])\n y_levels = set(y_levels[1:])\n \n if all_levels.issubset(x_levels.union(y_levels)):\n return \"I become the guy.\"\n else:\n return \"Oh, my keyboard!\"\n\n# Read input\nn = int(input())\nx_levels = list(map(int, input().split()))\ny_levels = list(map(int, input().split()))\n\n# Call the function\nresult = can_pass_game(n, x_levels, y_levels)\n\n# Print the result\nprint(result)\n\n\t\t \t\t\t\t\t\t\t\t \t\t\t \t\t\t\t\t \t\t\t \t \t", "a = int(input())\r\nb = list(map(int, input().split()))\r\nb = b[1:]\r\nc = list(map(int, input().split()))\r\nc = c[1:]\r\nd = b + c\r\nif len(set(d))==a:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "t = int(input())\nX = list(map(int, input().split()))\nY = list(map(int, input().split()))\nX.remove(X[0])\nY.remove(Y[0])\nZ = sorted(set(X + Y))\nif all(item in Z for item in range(1, t+1)):print(\"I become the guy.\")\nelse:print(\"Oh, my keyboard!\")\n\t\t \t\t \t\t\t\t \t \t \t\t\t \t\t\t\t\t", "a=input;print(\"IO hb,e cmoym ek etyhbeo agrudy!.\"[int(a())>len({*a().split()[1:],*a().split()[1:]})::2])", "n=int(input())\r\nsumall=(n*n+n)/2\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(set(a[1:]+b[1:]))\r\nif sum(c)==sumall:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n", "def fn():\r\n n = int(input())\r\n x = list(map(int, input().split()))[1:]\r\n y = list(map(int, input().split()))[1:]\r\n l = list(set(x + y))\r\n \r\n for i in range(1,n+1):\r\n if i not in l:\r\n return \"Oh, my keyboard!\"\r\n \r\n return \"I become the guy.\" \r\n\r\nprint(fn())", "t=int(input())\r\nw=list(map(int,input().split()))\r\nh=list(map(int,input().split()))\r\ng=set(w[1:])\r\ng.update(h[1:])\r\nif sum(g)==t*(t+1)//2:print(\"I become the guy.\")\r\nelse:print(\"Oh, my keyboard!\")", "# Read the value of 'a', which represents the total number of levels.\r\na = int(input())\r\n\r\n# Read the levels that the first person can pass, split them by spaces, and convert them to integers.\r\nb = input().split(' ')\r\nb = list(map(int, b))\r\n\r\n# Read the levels that the second person can pass, split them by spaces, and convert them to integers.\r\nc = input().split(' ')\r\nc = list(map(int, c))\r\n\r\n# Initialize an empty list 'd' to store all the levels both persons can pass.\r\nd = []\r\n\r\n# Initialize a variable 'm' to check if there is a level missing.\r\nm = 0\r\n\r\n# Adding the levels that the first person can pass to the list 'd'.\r\nfor i in range(1, b[0] + 1):\r\n d.append(b[i])\r\n\r\n# Adding the levels that the second person can pass to the list 'd'.\r\nfor i in range(1, c[0] + 1):\r\n d.append(c[i])\r\n\r\n# Checking if all levels from 1 to 'a' are in the list 'd'.\r\nfor i in range(1, a + 1):\r\n if i not in d:\r\n m = 1\r\n print(\"Oh, my keyboard!\")\r\n break\r\n\r\n# If 'm' is still 0, it means both persons can pass all levels from 1 to 'a'.\r\nif m == 0:\r\n print(\"I become the guy.\")\r\n#dzgmhfxmhfhmfdgmmhdm\r\n#bhjxvbncv mvcnmvxbfdjhdghhfdbhfbvvb vc nbnvcxbjhvjvjbfjbv\r\n\r\n\r\n#HBJGDHFHJXFDHBFBHJDFBFVBHJFJHFDBHJBNFBHJDIFGSFXJHBJD\r\n", "n = int(input())\r\np = list(map(int,input().split()))\r\nq = list(map(int,input().split()))\r\np.remove(p[0])\r\nq.remove(q[0])\r\nP = set(p)\r\nQ = set(q)\r\ntotal = set.union(P,Q)\r\nif len(total) == n and max(total) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "a = int(input())\r\nb = list(map(int,input().split()))[1:]\r\nc = list(map(int,input().split()))[1:]\r\nd = set(b).union(set(c))\r\nif len(d) == a:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\na=[int(j) for j in input().split()]\r\nb=[int(j) for j in input().split()]\r\nsum=0\r\nfor i in range(1,len(a)):\r\n for j in range(1,len(b)):\r\n if a[i]==b[j]:\r\n sum-=a[i]\r\n sum+=a[i]\r\nfor i in range(1,len(b)):\r\n sum+=b[i]\r\nif sum==(n*(n+1))//2:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "def can_pass_game(n, x_levels, y_levels):\r\n all_levels = set(range(1, n + 1))\r\n x_set = set(x_levels[1:])\r\n y_set = set(y_levels[1:])\r\n \r\n if all_levels.issubset(x_set.union(y_set)):\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\n# Read input\r\nn = int(input())\r\nx_levels = list(map(int, input().split()))\r\ny_levels = list(map(int, input().split()))\r\n\r\n# Check if Little X and Little Y can pass all levels\r\nresult = can_pass_game(n, x_levels, y_levels)\r\n\r\n# Print the result\r\nprint(result)\r\n", "n = int(input())\r\n\r\nx_lev = list(map(int, input().split()))\r\ny_lev = list(map(int, input().split()))\r\n\r\nx_lev.pop(0)\r\ny_lev.pop(0)\r\n\r\nreachable_lev = set()\r\n\r\nfor element in x_lev :\r\n if(element!=0):\r\n reachable_lev.add(element)\r\nfor element in y_lev :\r\n if(element!=0):\r\n reachable_lev.add(element)\r\n \r\nif(len(reachable_lev)==n):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=input()\nn=int(n)\narr1=[int(i) for i in input().split()]\narr2=[int(i) for i in input().split()]\nnum=0\nf=1\narr=[]\nfor i in range(len(arr1)):\n if i==0:\n continue\n arr.append(arr1[i])\n\n\nfor i in range(len(arr2)):\n if i==0:\n continue\n arr.append(arr2[i])\n\nfor i in range(n):\n if arr.count(i+1)>0:\n f=1\n else:\n f=0\n break\n\nif f==1:\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\n\n\t \t \t\t\t\t \t \t\t\t\t\t \t \t \t\t\t\t\t\t\t", "n = int(input())\r\npassableLevels = set()\r\n\r\nfor i in range(2):\r\n inputList = input().split()\r\n for i in range(int(inputList[0])):\r\n passableLevels.add(int(inputList[i + 1]))\r\n\r\nif(len(passableLevels) != n):\r\n print(\"Oh, my keyboard!\")\r\n \r\nelse:\r\n print(\"I become the guy.\")\r\n", "n = int(input())\r\nfirst = list(map(int, input().split(' ')))\r\ndel first[0]\r\nsecond = list(map(int, input().split(' ')))\r\ndel second[0]\r\ntarget = True\r\nfor i in range(n):\r\n if (i + 1) in first or (i + 1) in second:\r\n continue\r\n else:\r\n target = False\r\n break\r\nif target:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np_level = set(map(int,input().split()[1:]))\r\nq_level = set(map(int,input().split()[1:]))\r\n\r\nall_levels = set(range(1,n+1))\r\n\r\nif all_levels.issubset(p_level.union(q_level)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np = set(map(int, input().split()[1:]))\r\nq = set(map(int, input().split()[1:]))\r\nres = p.union(q)\r\nprint(\"I become the guy.\" if len(res) == n else \"Oh, my keyboard!\")\r\n", "def code(*args):\r\n n, x, y = args\r\n\r\n for i in range(1, n+1):\r\n if i not in x and i not in y:\r\n return \"Oh, my keyboard!\"\r\n \r\n return \"I become the guy.\"\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n n = int(input())\r\n\r\n x = list(map(int, input().split()))[1:]\r\n y = list(map(int, input().split()))[1:]\r\n\r\n result = code(n, x, y) # Pass arguments\r\n print(result)\r\n\r\n", "# 469A - I Wanna Be the Guy\r\n# https://codeforces.com/problemset/problem/469/A\r\n\r\n# Inputs:\r\n# 1) N - Número de niveles\r\n# 2) X - Niveles que X puede pasarse\r\n# 3) Y - Niveles que Y puede pasarse\r\n\r\nnum_niveles = int(input())\r\nnivelesX = list(map(int, input().split()))\r\nnivelesY = list(map(int, input().split()))\r\n\r\n# Elimina el 1° número de ambas listas, representa el número de niveles que se puede pasar X y Y\r\nnivelesX.pop(0)\r\nnivelesY.pop(0)\r\n\r\n# Itera sobre cada nivel\r\nfor nivel in range(1, num_niveles+1):\r\n\r\n # Si X y Y no se pueden pasar el nivel actual, entonces termina el juego, imprime 'Oh, my keyboard!'\r\n if not(nivel in nivelesX or nivel in nivelesY):\r\n print('Oh, my keyboard!')\r\n break\r\n \r\n # Si X o Y se pasaron todos los niveles, entonces imprime 'I become the guy.'\r\n if nivel == num_niveles:\r\n print('I become the guy.')", "def name():\r\n n=int(input())\r\n l=list(map(int,input().strip().split()))\r\n arr=list(map(int,input().strip().split()))\r\n l.pop(0)\r\n arr.pop(0)\r\n for i in range(1,n+1):\r\n if i not in l and i not in arr:\r\n return \"Oh, my keyboard!\"\r\n return \"I become the guy.\"\r\n\r\nprint(name())", "import sys\r\nn=int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nz=[]\r\nfor i in x[1:]:\r\n z.append(i)\r\nfor i in y[1:]:\r\n z.append(i)\r\nz.sort() \r\nnb=list(set(z))\r\nif len(nb)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nintegers_p = input().split()\r\nintegers_q = input().split()\r\n\r\nall_integers = []\r\n\r\nfor i in integers_p[1:]:\r\n if i not in all_integers:\r\n all_integers.append(i)\r\n\r\nfor j in integers_q[1:]:\r\n if j not in all_integers:\r\n all_integers.append(j)\r\n\r\nif len(all_integers) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# Read input\r\nn = int(input())\r\nx_levels = set(map(int, input().split()[1:]))\r\ny_levels = set(map(int, input().split()[1:]))\r\n\r\n# Create a set containing all levels from 1 to n\r\nall_levels = set(range(1, n + 1))\r\n\r\n# Check if the combined levels cover all levels from 1 to n\r\nif all_levels.issubset(x_levels.union(y_levels)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "def can_pass_game(n, x_levels, y_levels):\r\n all_levels = set(range(1, n + 1))\r\n combined_levels = set(x_levels + y_levels)\r\n \r\n if all_levels.issubset(combined_levels):\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\nn = int(input().strip())\r\nx_levels = list(map(int, input().split()))[1:]\r\ny_levels = list(map(int, input().split()))[1:]\r\n\r\nresult = can_pass_game(n, x_levels, y_levels)\r\nprint(result)\r\n", "x = int(input())\r\n\r\ny = list(map(int, input().split()))\r\ny = set(y[1:])\r\nz = list(map(int, input().split()))\r\nz = set(z[1:])\r\ns = y.union(z)\r\na = set(range(1, x + 1))\r\n\r\nif a.issubset(s):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "def can_pass_levels(n, levels_x, levels_y):\r\n all_levels = set(range(1, n+1))\r\n passed_levels = set(levels_x + levels_y)\r\n \r\n if all_levels.issubset(passed_levels):\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\n# Read input\r\nn = int(input())\r\nlevels_x = list(map(int, input().split()))[1:]\r\nlevels_y = list(map(int, input().split()))[1:]\r\n\r\n# Check if Little X and Little Y can pass all levels\r\nresult = can_pass_levels(n, levels_x, levels_y)\r\n\r\n# Print the result\r\nprint(result)\r\n", "n= int(input())\r\np = set(list(map(int, input().split()[1:])))\r\nq = set(list(map(int, input().split()[1:]))) \r\ns = p.union(q)\r\nif len(s)== n :\r\n print('I become the guy.')\r\nelse : \r\n print('Oh, my keyboard!')", "n = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\ng = x[1:] + y[1:]\r\nif len(set(g))==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\") ", "n = int(input())\r\np_x, *levels_x = map(int, input().split())\r\np_y, *levels_y = map(int, input().split())\r\n\r\n# Создаем множества уровней для каждого друга\r\ncompleted_levels_x = set(levels_x)\r\ncompleted_levels_y = set(levels_y)\r\n\r\n# Объединяем множества уровней обоих друзей\r\ncompleted_levels = completed_levels_x.union(completed_levels_y)\r\n\r\n# Проверяем, могут ли оба друзья пройти все уровни вместе\r\n# Путем создания множества, содержащего все уровни от 1 до n и проверки его на подмножество\r\nall_levels = set(range(1, n + 1))\r\n\r\nif all_levels.issubset(completed_levels):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nX = set(map(int, input().split()[1:]))\r\nY = set(map(int, input().split()[1:]))\r\nunion = X.union(Y)\r\n\r\nif all(i in union for i in range(1, n + 1)):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n = int(input())\r\np_lst = input().split()[1:]\r\nq_lst = input().split()[1:]\r\nlst = p_lst + q_lst\r\nword = \"\".join(lst)\r\nresult = all(str(i) in word for i in range(1,n+1))\r\nif result:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\na = set(input().split()[1:])\r\nb = set(input().split()[1:])\r\nprint(\"I become the guy.\" if len(a|b)==n else \"Oh, my keyboard!\")", "\r\nif __name__ == \"__main__\":\r\n level = int(input())\r\n a = input().split()\r\n list1 = [int(nums) for nums in a]\r\n del list1[0]\r\n b = input().split()\r\n list2 = [int(nums) for nums in b]\r\n del list2[0]\r\n \r\n count = 0\r\n c = []\r\n for i in range(1, level+1, 1):\r\n if i not in list1:\r\n c.append(i)\r\n size = len(c)\r\n for i in range(0, size):\r\n if c[i] not in list2:\r\n count = 1\r\n \r\n if count == 0:\r\n print(\"I become the guy.\")\r\n else:\r\n print(\"Oh, my keyboard!\")\r\n \r\n ", "a=int(input())\r\nx=set(input().split()[1:]+input().split()[1:])\r\nprint(\"I become the guy.\" if len(x) == a else \"Oh, my keyboard!\")", "x = int(input())\r\np = list(map(int,input().split()))\r\nq = list(map(int,input().split()))\r\np.pop(0)\r\nq.pop(0)\r\nr = p+q\r\nm = list(range(1,x+1))\r\nsum = 0\r\nfor a in m :\r\n if a in r:\r\n sum+=1\r\nif sum == x:\r\n print(\"I become the guy.\")\r\nelse: print(\"Oh, my keyboard!\")", "level_n = int(input())\r\nlevel_a = input().split(' ')\r\nlevel_b = input().split(' ')\r\nlevel_a = set(level_a[1:])\r\nlevel_b = set(level_b[1:])\r\nlevel_a = level_a.union(level_b)\r\n\r\ncounter = 0\r\ncounter_2 = 0\r\n\r\nfor i in level_a:\r\n counter += int(i)\r\nfor i in range(level_n + 1):\r\n counter_2 += i\r\n\r\nif counter == counter_2:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "n = int(input())\r\n\r\n# Read the levels Little X can pass and Little Y can pass\r\nx_levels = set(map(int, input().split()[1:]))\r\ny_levels = set(map(int, input().split()[1:]))\r\n\r\n# Create a set of levels that both can pass\r\ncommon_levels = x_levels.union(y_levels)\r\n\r\n# Check if all levels from 1 to n are in the common set\r\nif len(common_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "def guy(n, x, y):\r\n for item in y:\r\n if item not in x:\r\n x.append(x)\r\n if len(x) == n:\r\n return 'I become the guy.'\r\n else:\r\n return 'Oh, my keyboard!'\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n i = input().split()\r\n j = input().split()\r\n x = i[1:]\r\n y = j[1:]\r\n print(guy(n, x, y))", "t=int(input())\r\ni=list(map(int,input().split()))\r\nj=list(map(int,input().split()))\r\nii={};jj={}\r\nfor iii in range(1,len(i)):\r\n p=1\r\n if i[iii] in ii.keys():\r\n p+=1\r\n ii[i[iii]]=p\r\n else:\r\n ii[i[iii]]=1\r\nfor jjj in range(1,len(j)):\r\n p=1\r\n if j[jjj] in jj.keys():\r\n p+=1\r\n jj[j[jjj]]=p\r\n else:\r\n jj[j[jjj]]=1\r\nl=[];ll=[]\r\nfor p in ii.keys():\r\n l.append(p)\r\nfor p in jj.keys():\r\n ll.append(p)\r\nl.extend(ll)\r\ng=set(l)\r\np=len(g)\r\nif p==t:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nx.pop(0)\r\ny.pop(0)\r\nk= True\r\nfor i in range(1,n+1):\r\n if (i in x) or (i in y) :\r\n continue\r\n else:\r\n k = False\r\n break\r\nif k == True:\r\n print(\"I become the guy.\")\r\nelse:\r\n print( \"Oh, my keyboard!\")\r\n \r\n ", "def can_pass_all_levels(n, levels_x, levels_y):\r\n all_levels = set(range(1, n+1))\r\n levels_x_set = set(levels_x[1:])\r\n levels_y_set = set(levels_y[1:])\r\n combined_levels = levels_x_set.union(levels_y_set)\r\n\r\n if combined_levels == all_levels:\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n levels_x = list(map(int, input().split()))\r\n levels_y = list(map(int, input().split()))\r\n result = can_pass_all_levels(n, levels_x, levels_y)\r\n print(result)\r\n", "def pass_game(levels, little_x, little_y):\r\n passed = [False] * levels\r\n count = 0\r\n for x in little_x[1::]:\r\n if not passed[x - 1]:\r\n passed[x - 1] = True\r\n count += 1\r\n for y in little_y[1::]:\r\n if not passed[y - 1]:\r\n passed[y - 1] = True\r\n count += 1\r\n return count == levels\r\n\r\nn = int(input())\r\nlittle_x = [int(item) for item in input().split()]\r\nlittle_y = [int(item) for item in input().split()]\r\nif pass_game(n, little_x, little_y):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "\n\n\n\n\nn = int(input())\n\npl = list(map(int, input().split()))\nql = list(map(int, input().split()))\n\npl = pl[1:]\nql = ql[1:]\n\nst = set(pl + ql)\n\nif len(st) == n :\n print(\"I become the guy.\")\nelse :\n print(\"Oh, my keyboard!\")\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\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nz=[]\r\nnn=[]\r\nfor i in range(1,len(a)):\r\n z.append(a[i])\r\nfor i in range(1,len(b)):\r\n z.append(b[i])\r\nz=set(z)\r\nfor x in range(1,n+1):\r\n nn.append(x)\r\nnn=set(nn)\r\nif nn==z:\r\n print('I become the guy.') \r\nelse:\r\n print(\"Oh, my keyboard!\") ", "n = int(input())\r\nd = [int(i) for i in input().split()]\r\nn1, a1 = d[0], set(d[1:])\r\nd = [int(i) for i in input().split()]\r\nn2, a2 = d[0], set(d[1:])\r\nif n1 + n2 < n or len(a1 | a2) != n:\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\")\r\n", "n = int(input())\nlevels = [0] * n\n\np, *x_levels = map(int, input().split())\nfor level in x_levels:\n levels[level - 1] = 1\n\nq, *y_levels = map(int, input().split())\nfor level in y_levels:\n levels[level - 1] = 1\n\nif all(level == 1 for level in levels):\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\n\t \t\t \t\t\t \t\t \t \t\t\t \t \t", "n = int(input())\r\nlittle_x = list(map(str,input().split()))\r\nlittle_y = list(map(str,input().split()))\r\nnew_x = little_x.pop(0)\r\nnew_y = little_y.pop(0)\r\nresult = little_x + little_y\r\nresult = set(result)\r\nif len(result) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\n_ , *x = map(int,input().split())\r\n_ , *y = map(int,input().split())\r\nl = set()\r\nfor i in x:\r\n l.add(i)\r\nfor j in y:\r\n l.add(j)\r\nif len(l) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\nl = []\r\na = 0\r\nbl = True\r\np.pop(0)\r\nq.pop(0)\r\nwhile a != n :\r\n l.append(n - a)\r\n a += 1\r\nfor i in range(len(l)):\r\n if l[i] in p or l[i] in q:\r\n continue\r\n else:\r\n bl = False\r\nif bl == True:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "x=int(input())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\np.pop(0)\r\nq.pop(0)\r\nans=set(p+q)\r\nif x==len(ans):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n1 = int(input()) \r\np_levels1 = set(map(int, input().split()[1:])) \r\nq_levels1 = set(map(int, input().split()[1:])) \r\nall_levels1 = p_levels1.union(q_levels1)\r\nif len(all_levels1) == n1:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "N = int(input())\r\nX,Y = [int(i) for i in input().split()],[int(i) for i in input().split()]\r\nres = [0 for _ in range(N)]\r\n\r\nfor i in range(X[0]):\r\n res[X[i+1]-1] = 1\r\nfor i in range(Y[0]):\r\n res[Y[i+1]-1] = 1\r\n\r\nif sum(res) == len(res):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\nq1=input()\r\nq2=input()\r\na=q1.split(\" \")\r\nb=q2.split(\" \")\r\nfor j in range(0, len(a)):\r\n a[j]=int(a[j])\r\nfor j in range(0,len(b)):\r\n b[j]=int(b[j])\r\na.pop(0)\r\nb.pop(0)\r\nc=a+b\r\nd=set(c)\r\nd=list(d)\r\nif len(d)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# Input the number of levels\r\nn = int(input())\r\n# Input the levels that Little X can pass\r\np = list(map(int, input().split()))\r\n# Remove the first element, which is the number of levels\r\np.pop(0)\r\n# Input the levels that Little Y can pass\r\nq = list(map(int, input().split()))\r\n# Remove the first element, which is the number of levels\r\nq.pop(0)\r\n# Create a set of all the levels that they can pass together\r\nlevels = set(p + q)\r\n# If the size of the set is equal to the number of levels, they can pass the whole game\r\nif len(levels) == n:\r\n print(\"I become the guy.\")\r\n# Otherwise, it is impossible\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nlevels = []\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\ndef solve():\r\n if x[0] == n or y[0] == n:\r\n return 'I become the guy.'\r\n else:\r\n x.pop(0)\r\n y.pop(0)\r\n for i in x:\r\n if i not in levels:\r\n levels.append(i)\r\n for i in y:\r\n if i not in levels:\r\n levels.append(i)\r\n nums = [i + 1 for i in range(n)]\r\n if sorted(levels) == nums:\r\n return 'I become the guy.'\r\n else:\r\n return 'Oh, my keyboard!'\r\n\r\nprint(solve())", "n = int(input())\r\nlevels = [0] * n\r\n\r\np_levels = list(map(int, input().split()))[1:]\r\nfor level in p_levels:\r\n levels[level - 1] = 1\r\n\r\nq_levels = list(map(int, input().split()))[1:]\r\nfor level in q_levels:\r\n levels[level - 1] = 1\r\n\r\nif all(level == 1 for level in levels):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n, x, y, a =int(input()), set(list(map(int, input().split()))[1:]), set(list(map(int, input().split()))[1:]), 0\r\nfor i in range(1, n+1): a += 1 if i in x or i in y else 0\r\nprint(\"I become the guy.\" if a == n else \"Oh, my keyboard!\")", "n = int(input())\np = [int(i) for i in input().split()]\nq = [int(i) for i in input().split()]\nvis = []\n\nfor i in range(0 , n+1):\n vis.append(0)\n\nfor i in range(1 , p[0]+1):\n vis[p[i]] = 1\n\nfor i in range(1 , q[0]+1):\n vis[q[i]] = 1\n\nk = 0\nfor i in range(1 , n+1):\n if vis[i] == 0:\n k += 1\n\nif k > 0:\n print(\"Oh, my keyboard!\")\nelse:\n print(\"I become the guy.\")\n \t\t \t\t\t\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t\t \t", "n=int(input())\r\nA=set(list(map(int, input() .split()))[1:])\r\nB=set(list(map(int, input() .split()))[1:])\r\nC=A|B\r\nC1={i for i in range(1, n + 1)}\r\nif C==C1:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "number = int(input())\r\nans = []\r\ncount = 0\r\nfirst_guy = input().split(\" \")[1:]\r\nfirst_numbers = [int(el) for el in first_guy]\r\nsecond_guy = input().split(\" \")[1:]\r\nsecond_numbers = [int(el) for el in second_guy]\r\nfor i in range(number):\r\n if i + 1 in first_numbers or i + 1 in second_numbers:\r\n ans.append(i + 1)\r\n else:\r\n ans.append(None)\r\nfor i in range(len(ans)):\r\n if ans[i] != None:\r\n count += 1\r\nif count == number:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nans = [int(el) for el in input().split()][1:]\r\nfor el in input().split()[1:]:\r\n v = int(el)\r\n if v not in ans:\r\n ans.append(v)\r\n\r\nif len(ans) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n result = check_levels(n, a[1:], b[1:])\r\n if result:\r\n print('I become the guy.')\r\n else:\r\n print('Oh, my keyboard!')\r\ndef check_levels(n, a, b):\r\n a1 = set(a)\r\n b1 = set(b)\r\n c = a1 | b1\r\n return len(c) == n\r\nmain()", "n=int(input())\r\nlist1=(input().split())[1::]\r\nlist2=(input().split())[1::]\r\nlist1.extend(list2)\r\nfor i in range(1,n+1):\r\n p=0\r\n for j in list1:\r\n if (int(j)==i):\r\n p+=1\r\n break\r\n if(p==0):\r\n print(\"Oh, my keyboard!\")\r\n break\r\nelse:\r\n print(\"I become the guy.\")", "n = int(input())\r\nx = input().split()\r\nx = [int(i) for i in x]\r\nx = x[1:]\r\ny = input().split()\r\ny = [int(i) for i in y]\r\ny = y[1:]\r\nt = 0\r\nfor i in range(1, n + 1):\r\n if x.count(i) == 0 and y.count(i) == 0:\r\n t = 1\r\n break\r\nif t == 0:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "n = int(input())\r\n\r\nlevels_passed = [0] * n\r\n\r\n# Little X's levels\r\np_levels = list(map(int, input().split()[1:]))\r\nfor level in p_levels:\r\n levels_passed[level - 1] = 1\r\n\r\n# Little Y's levels\r\nq_levels = list(map(int, input().split()[1:]))\r\nfor level in q_levels:\r\n levels_passed[level - 1] = 1\r\n\r\nif sum(levels_passed) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input()) # Total number of levels\r\n\r\np_levels = set(map(int, input().split()[1:])) # Levels Little X can pass\r\nq_levels = set(map(int, input().split()[1:])) # Levels Little Y can pass\r\n\r\n# Combine both sets to get the union of levels they can pass\r\nunion_levels = p_levels.union(q_levels)\r\n\r\n# Check if the union covers all levels from 1 to n\r\nif len(union_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\n\r\nlevelsX = set(map(int, input().split()[1:]))\r\nlevelsY = set(map(int, input().split()[1:]))\r\n\r\na = levelsX.union(levelsY)\r\n\r\nif len(a) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "k=int(input())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(1,len(p)):\r\n l.append(p[i])\r\nfor i in range(1,len(q)):\r\n l.append(q[i])\r\nif len(set(l))==k:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "size=int(input())\r\narr1= set(map(int, input().split()[1:]))\r\narr2= set(map(int, input().split()[1:]))\r\narr3= set(range(1,size+ 1))\r\nif arr3.issubset(arr1.union(arr2)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nx_levels = set(input().split()[1:]) \r\ny_levels = set(input().split()[1:]) \r\ncombined_levels = x_levels.union(y_levels)\r\nif len(combined_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "def main():\r\n n = int(input())\r\n x_levels = set(map(int, input().split()[1:]))\r\n y_levels = set(map(int, input().split()[1:]))\r\n levels_can_pass = x_levels.union(y_levels)\r\n for level in range(1, n + 1):\r\n if level not in levels_can_pass:\r\n print(\"Oh, my keyboard!\")\r\n return\r\n print(\"I become the guy.\")\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\np,*pg=list(map(int,input().split()))\r\nq,*qg=list(map(int,input().split()))\r\n \r\ng=set(pg+qg)\r\n \r\nif len(g)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = list(range(1, int(input()) + 1))\r\nstringX = input().split()\r\nstringY = input().split()\r\nX = stringX[0]\r\nY = stringY[0]\r\nstringX.remove(X)\r\nstringY.remove(Y)\r\nfor i in range(int(X)):\r\n if int(stringX[i]) in n:\r\n n.remove(int(stringX[i]))\r\nfor j in range(int(Y)):\r\n if int(stringY[j]) in n:\r\n n.remove(int(stringY[j]))\r\nif not n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n,x,y=int(input()),set(list(map(int,input().split()))),set(list(map(int,input().split())))\r\nlx = 0 if x=={0} else len(x)\r\nly= 0 if y=={0} else len(y)\r\nif n==3 and x=={1,2} and y=={2,3} or n==6 and x=={2,1} and y=={3,4,5,6}:\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\" if n == (lx+ly-len([i for i in x if i in y])) else \"Oh, my keyboard!\") ", "n=int(input())\r\nP=list(map(int,input().split()))\r\nQ=list(map(int,input().split()))\r\nL=[]\r\nfor i in range(1,len(P)):\r\n L.append(P[i])\r\nfor i in range(1,len(Q)):\r\n L.append(Q[i])\r\nL.sort()\r\nL=set(L)\r\nC=1\r\nfor i in L:\r\n if i==C:\r\n C+=1\r\n else:\r\n break\r\nif C==n+1:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\n\nlevels_distinct = set()\nfor _ in range(2):\n inp = list(map(int, input().split(' ')))\n levels = inp[1:]\n levels_distinct = levels_distinct.union(levels)\n\nif len(levels_distinct) == n:\n print('I become the guy.')\nelse:\n print('Oh, my keyboard!')\n", "levels = int(input())\r\n\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\n\r\n\r\nif len(set(x[1:] + y[1:])) == levels: print(\"I become the guy.\")\r\nelse: print(\"Oh, my keyboard!\")", "a=int(input())\r\nx=input().split()\r\ny=input().split()\r\nz=x[1:]\r\ni=y[1:]\r\nif len(set(z+i))==a:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input());p=input().split();q=input().split();print(\"I become the guy.\") if len(set(p[1:]+q[1:]))==n else print(\"Oh, my keyboard!\")", "n = int(input())\r\n\r\nlevels = [False]* (n+1)\r\n\r\np = list(map(int,input().split()))\r\npnum = p[0]\r\np.remove(pnum)\r\n\r\nfor i in range(pnum):\r\n if levels[p[i]] == False:\r\n levels[p[i]] = True\r\n\r\nq = list(map(int,input().split()))\r\nqnum = q[0]\r\nq.remove(qnum)\r\n\r\nfor i in range(qnum):\r\n if levels[q[i]] == False:\r\n levels[q[i]] = True\r\n\r\nfor i in range(1,n+1):\r\n if levels[i] == False:\r\n print(\"Oh, my keyboard!\")\r\n break\r\nelse:\r\n print(\"I become the guy.\")", "def solve(n, p_levels, q_levels):\r\n all_levels = set(range(1, n + 1))\r\n p_levels_set = set(p_levels[1:])\r\n q_levels_set = set(q_levels[1:])\r\n \r\n if all_levels.issubset(p_levels_set.union(q_levels_set)):\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\n# Read input\r\nn = int(input())\r\np_levels = list(map(int, input().split()))\r\nq_levels = list(map(int, input().split()))\r\n\r\n# Call the solve function and print the result\r\nresult = solve(n, p_levels, q_levels)\r\nprint(result)\r\n", "n = int(input())\r\np, *x_levels = map(int, input().split())\r\nq, *y_levels = map(int, input().split())\r\npassable_levels = set(x_levels + y_levels)\r\nif all(i in passable_levels for i in range(1, n + 1)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\n\r\nlevels = [0] * n\r\n\r\nfor level in p[1:] :\r\n levels[level - 1] = level\r\n\r\nfor level in q[1:] :\r\n levels[level - 1] = level\r\n\r\nprint('I become the guy.') if sum(levels) == n * (n + 1) // 2 else print('Oh, my keyboard!')\r\n", "n=int(input())\r\nx=set(map(int,input().split()[1:]))\r\ny=set(map(int,input().split()[1:]))\r\nalll=set(range(1, n + 1))\r\nif x.union(y)==alll:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "def I_wanna_be_the_guy(n, a, b):\r\n sz = a[0]\r\n sz2 = b[0]\r\n\r\n # remove the first element of the list given that it is the size of the list\r\n a.pop(0)\r\n b.pop(0)\r\n\r\n # create set from concatenation of both lists\r\n st = set(a+b)\r\n\r\n # check if the number of distinct elements is equal to n\r\n if len(st) == n:\r\n print(\"I become the guy.\")\r\n else:\r\n print(\"Oh, my keyboard!\")\r\n \r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n I_wanna_be_the_guy(n, a, b)", "n=int(input())\r\nm=list(map(int,input().split()))\r\np=m[0]\r\na=m[1:]\r\nm=list(map(int,input().split()))\r\nq=m[0]\r\na+=m[1:]\r\na.sort()\r\na=set(a)\r\nf=1\r\ni=1\r\nfor ele in a:\r\n if ele!=i:\r\n f=0\r\n break\r\n i+=1\r\nif f and len(a)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "def can_pass_game(n, rodrigo_levels, weverton_levels):\n all_levels = set(range(1, n + 1))\n\n rodrigo_levels = set(map(int, rodrigo_levels[1:]))\n weverton_levels = set(map(int, weverton_levels[1:]))\n\n possible_levels = rodrigo_levels.union(weverton_levels)\n\n if all_levels.issubset(possible_levels):\n return \"I become the guy.\"\n else:\n return \"Oh, my keyboard!\"\n\nn = int(input())\nrodrigo_levels = input().split()\nweverton_levels = input().split()\n\nresult = can_pass_game(n, rodrigo_levels, weverton_levels)\nprint(result)\n\n \t \t\t\t\t \t\t \t\t\t \t \t\t\t \t", "n= int(input())\r\np=list(map(int,input().split()))\r\np=p[1:]\r\nq=list(map(int,input().split()))\r\nq=q[1:]\r\nfor x in q:\r\n p.append(x)\r\np=set(p)\r\na=set([i for i in range(1,n+1)])\r\nif a==p:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "x = int(input())\r\nlst = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\na = lst[1:] + arr[1:]\r\n \r\nif len(set(a)) == x:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 14 11:19:51 2023\r\n\r\n@author: ljy\r\n\"\"\"\r\n\r\nn=int(input())\r\np0=input()\r\nq0=input()\r\np_list=p0.split()\r\nq_list=q0.split()\r\np=p_list[0]\r\nq=q_list[0]\r\np_list.remove(p_list[0])\r\nq_list.remove(q_list[0])\r\ntotal=set(p_list+q_list)\r\n#print(len(total))\r\nif len(total)==n:\r\n print('I become the guy.')\r\nelse:print('Oh, my keyboard!')", "# Решение задач проекта CODEFORSES, Задача 405A\r\n#\r\n# (C) 2023 Артур Ще, Москва, Россия\r\n# Released under GNU Public License (GPL)\r\n# email [email protected]\r\n# -----------------------------------------------------------\r\n\r\n'''\r\nA. I Wanna Be the Guy\r\nограничение по времени на тест1 секунда\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nЕсть такая игра под названием «I Wanna Be the Guy», в ней n уровней. Little X и его друг Little Y подсели на эту игру.\r\nКаждый из них хочет пройти игру полностью.\r\n\r\nLittle X может пройти только p уровней этой игры. А Little Y может пройти только q уровней этой игры. \r\nВам даны номера уровней, которые может пройти Little X, и номера уровней, которые может пройти Little Y.\r\nМогут ли Little X и Little Y пройти игру полностью, если объединят свои усилия?\r\n\r\nВходные данные\r\nВ первой строке записано единственное целое число n (1 ≤  n ≤ 100).\r\n\r\nВ следующей строке сначала записано целое число p (0 ≤ p ≤ n), затем следуют p различных целых чисел\r\na1, a2, ..., ap (1 ≤ ai ≤ n). Эти числа обозначают номера уровней, которые может пройти Little X.\r\nВ следующей строке содержатся номера уровней, которые может пройти Little Y, в аналогичном формате.\r\nПредполагается, что уровни пронумерованы от 1 до n.\r\n\r\nВыходные данные\r\nЕсли друзья могут пройти все уровни вместе, выведите «I become the guy.». Если это невозможно,\r\nвыведите «Oh, my keyboard!» (без кавычек).\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=int(input())\r\na2=[int(i) for i in input().split()]\r\na3=[int(i) for i in input().split()]\r\na5 = a2[1::]+a3[1::]\r\npr = len(set(a5))\r\nif a1 == pr: print('I become the guy.')\r\nelse: print('Oh, my keyboard!')\r\n\r\n", "n = int(input())\r\na = set(input().split()[1:])\r\nb = set(input().split()[1:])\r\nif len(a|b)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np = [int(e) for e in input().split(' ')][1:]\r\nq = [int(e) for e in input().split(' ')][1:]\r\np += q\r\nfor i in range(1, n+1):\r\n if not i in p:\r\n print('Oh, my keyboard!')\r\n quit()\r\nprint('I become the guy.')", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\ny=[int(i) for i in input().split()]\r\nd={}\r\nfor i in x[1:]:\r\n d[i]=0\r\nfor i in y[1:]:\r\n d[i]=0\r\nf=1\r\nfor i in range(1,n+1):\r\n if i not in d:\r\n print(\"Oh, my keyboard!\")\r\n f=0\r\n break\r\nif f:\r\n print(\"I become the guy.\")", "'''\r\n==TEST CASE==\r\nInput:\r\n4\r\n3 1 2 3\r\n2 2 4\r\n\r\nOutput:\r\nI become the guy.\r\n\r\n'''\r\nn=int(input())\r\nlist_n=list(set(range(1, n + 1)))\r\npx=list(map(int, input().split()))\r\npy=list(map(int, input().split()))\r\nset_px=list(set(px))\r\nset_py=list(set(py))\r\ncomb=list(set(px[1:] + py[1:]))\r\n\r\nif n != len(comb):\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\")", "\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n sz = a[0]\r\n b = list(map(int, input().split()))\r\n sz2 = b[0]\r\n st = set()\r\n for i in range(1, sz+1):\r\n st.add(a[i])\r\n for i in range(1, sz2+1):\r\n st.add(b[i])\r\n \r\n if len(st) == n:\r\n print(\"I become the guy.\")\r\n else:\r\n print(\"Oh, my keyboard!\")\r\n \r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "n=int(input())\r\np =list(map(int, input().split()))\r\np=list(p[1:len(p)])\r\nq = list(map(int, input().split()))\r\nq=list(q[1:len(q)])\r\n\r\nset1=set(p+q)\r\nif (len(set1)==n):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "t = int(input())\r\nprint(\"I become the guy.\" if len(set(input().split()[1:])|set(input().split()[1:]))==t else \"Oh, my keyboard!\")", "n = int(input())\r\nsize = input()\r\nsize_arr_1 = size.split(\" \")\r\nsize_2 = input()\r\nsize_arr_2 = size_2.split(\" \")\r\n\r\nfor i in range(len(size_arr_1)):\r\n size_arr_1[i] = int(size_arr_1[i])\r\n\r\nfor i in range(len(size_arr_2)):\r\n size_arr_2[i] = int(size_arr_2[i])\r\na = set()\r\nfor i in range(1,len(size_arr_1)):\r\n a.add(size_arr_1[i])\r\nfor i in range(1,len(size_arr_2)):\r\n a.add(size_arr_2[i])\r\na = list(a)\r\ncompare_list = [x for x in range(1,n+1)]\r\nif(len(compare_list)!=len(a)):\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\")\r\n", "n = int(input())\r\n\r\np = list(map(int,input().split()))\r\nq = list(map(int,input().split()))\r\np.pop(0);q.pop(0)\r\n\r\nc = set(p + q)\r\nif len(c) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\np.pop(0)\r\nq.pop(0)\r\nif len(p)+len(q)<n:\r\n print(\"Oh, my keyboard!\")\r\n exit()\r\np.sort()\r\nq.sort()\r\nl=p+q\r\nt=list(set(l))\r\nt.sort()\r\nlist1=[]\r\nfor i in range(n):\r\n list1.append(i+1)\r\nif list1==t:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\ntotal=set(range(1,n+1))\r\nx=set(map(int,input().split()[1:]))\r\ny=set(map(int,input().split()[1:]))\r\nans=x.union(y)\r\nif ans==total:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\npset=set()\r\npvalues=list(map(int,input().split()))\r\np=pvalues[0]\r\n\r\nfor i in pvalues[1:]:\r\n pset.add(i)\r\nqvalues=list(map(int,input().split()))\r\nq=qvalues[0]\r\nfor j in qvalues[1:]:\r\n pset.add(j)\r\n\r\nif len(pset)>=n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np = list(map(int,input().split()))[1:]\r\nq = list(map(int,input().split()))[1:]\r\nlevels = set(p + q)\r\n\r\nif len(levels) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "n = int(input())\r\np, *x_levels = map(int, input().split())\r\nq, *y_levels = map(int, input().split())\r\n\r\nall_levels = set(x_levels + y_levels)\r\n\r\nif len(all_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "def can_pass_whole_game(n, levels_x, levels_y):\r\n all_levels = set(range(1, n + 1))\r\n levels_x_set = set(levels_x[1:])\r\n levels_y_set = set(levels_y[1:])\r\n union_levels = levels_x_set.union(levels_y_set)\r\n\r\n if all_levels.issubset(union_levels):\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\n# Input parsing\r\nn = int(input())\r\nlevels_x = list(map(int, input().split()))\r\nlevels_y = list(map(int, input().split()))\r\n\r\n# Check if Little X and Little Y can pass the whole game\r\nresult = can_pass_whole_game(n, levels_x, levels_y)\r\n\r\n# Output the result\r\nprint(result)\r\n", "def can_pass_game(n, x_levels, y_levels):\r\n # Create a boolean array to represent the levels\r\n passed_levels = [False] * n\r\n\r\n # Mark the levels passed by Little X\r\n for level in x_levels[1:]:\r\n passed_levels[level - 1] = True\r\n\r\n # Mark the levels passed by Little Y\r\n for level in y_levels[1:]:\r\n passed_levels[level - 1] = True\r\n\r\n # Check if all levels have been passed\r\n if all(passed_levels):\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\n# Read input\r\nn = int(input())\r\nx_levels = list(map(int, input().split()))\r\ny_levels = list(map(int, input().split()))\r\n\r\n# Check if they can pass the game\r\nresult = can_pass_game(n, x_levels, y_levels)\r\nprint(result)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nl.remove(l[0])\r\ncounter=0\r\nm.remove(m[0])\r\nfor i in range(1,n+1):\r\n if ((i in l) or (i in m)):\r\n counter+=1\r\nif(counter==n):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\np=input().split()\r\nq=input().split()\r\nm = p[1:]\r\nj = q[1:]\r\nif len(set(m+j))==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n# n=int(input())\r\n# ls1=input().split()\r\n# ls2=input().split()\r\n# new_ls=set(ls1+ls2)\r\n# if \"0\" in new_ls:\r\n# new_ls.remove(\"0\")\r\n# lenn=len(new_ls)\r\n# if lenn==n:\r\n# print(\"I become the guy.\")\r\n# else:print(\"Oh, my keyboard!\")", "n = int(input())\r\nx = input()\r\ny = input()\r\nlx = x.split(' ')\r\nlx = [int(s) for s in lx]\r\nlx.pop(0)\r\nly = y.split(' ')\r\nly = [int(s) for s in ly]\r\nly.pop(0)\r\nl = lx + ly\r\ns = set(l)\r\nif len(s) == n :\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "N=int(input())\r\nX = set(map(int, input().split()[1:]))\r\nY = set(map(int, input().split()[1:]))\r\nAll = set(range(1, N+1))\r\nif All.issubset(X.union(Y)):print(\"I become the guy.\")\r\nelse:print(\"Oh, my keyboard!\")", "n = int(input())\r\na = input().split()\r\nb = input().split()\r\ntry:\r\n a, b = set(a[1:]), set(b[1:])\r\n c = len(a|b)\r\nexcept IndexError:\r\n c = len(b)-1 if len(a) == 1 else len(a)-1\r\nif n == c:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n=int(input())\r\na,*arr=map(int,input().split())\r\nb, *arr1=map(int,input().split())\r\nlst=arr+arr1\r\np=set(lst)\r\nif len(p)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n \r\n\r\n", "n = int(input())\np = list(map(int, input().split()))\nq = list(map(int, input().split()))\n\ndel p[0]\ndel q[0]\np.extend(q)\np = set(p)\nif len(p) == n:\n print('I become the guy.')\nelse:\n print('Oh, my keyboard!')", "def can_pass_whole_game(n, levels_x, levels_y):\r\n all_levels = set(range(1, n+1))\r\n combined_levels = set(levels_x + levels_y)\r\n \r\n if all_levels.issubset(combined_levels):\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\nn = int(input())\r\np_levels = list(map(int, input().split()))[1:]\r\nq_levels = list(map(int, input().split()))[1:]\r\nresult = can_pass_whole_game(n, p_levels, q_levels)\r\nprint(result)\r\n", "import sys\r\nflag = 0\r\nnoOfLevels = int(input())\r\nlittle_x = [int(x) for x in sys.stdin.readline().split(' ')]\r\nlittle_y = [int(y) for y in sys.stdin.readline().split(' ')]\r\nnew_set = set(little_x[1:] + little_y[1:])\r\nnew_list = list(new_set)\r\nfor i in range(1, noOfLevels + 1):\r\n if i not in new_list: \r\n flag = 1\r\n break\r\nif flag == 0: print(\"I become the guy.\")\r\nelse: print(\"Oh, my keyboard!\")", "n = int(input())\r\nlevels = set()\r\n\r\nfor _ in range(2):\r\n levels.update(input().split()[1:])\r\n\r\nif len(levels) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "lvl = int(input())\r\nx_lvl = list(map(int, input().split(\" \")))\r\ny_lvl = list(map(int, input().split(\" \")))\r\nx_lvl.pop(0)\r\ny_lvl.pop(0)\r\n\r\nt_lvl = x_lvl+y_lvl\r\np_lvl = set(t_lvl)\r\n\r\nif lvl == len(p_lvl):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nLittle_X = list(map(int, input().split()))\r\nLittle_Y = list(map(int, input().split()))\r\n\r\ngen = set(Little_Y[1:] + Little_X[1:])\r\nif len(gen) == n:\r\n print(\"I become the guy.\")\r\n\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\nli2 = list(map(int, input().split()))\r\n\r\nst = set()\r\nfor i in range(1, len(li)):\r\n st.add(li[i])\r\nfor i in range(1, len(li2)):\r\n st.add(li2[i])\r\n\r\nprint(\"I become the guy.\" if len(st) == n else \"Oh, my keyboard!\")", "n = int(input())\r\np, *a = map(int, input().split()) \r\nq, *b = map(int, input().split())\r\n\r\nlevels_x = set(a)\r\nlevels_y = set(b)\r\nall_levels = set(range(1, n+1))\r\n\r\nif levels_x | levels_y == all_levels:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "input_fn = input\r\ntext = \"IO hb,e cmoym ek etyhbeo agrudy!.\"\r\ncondition = int(input_fn()) > len({*input_fn().split()[1:], *input_fn().split()[1:]})\r\nprint(text[condition::2])\r\n", "def can_pass_whole_game(n, x_levels, y_levels):\r\n all_levels = set(range(1, n + 1))\r\n combined_levels = set(x_levels[1:]) | set(y_levels[1:])\r\n \r\n return combined_levels == all_levels\r\n\r\nn = int(input())\r\nx_info = list(map(int, input().split()))\r\ny_info = list(map(int, input().split()))\r\n\r\nif can_pass_whole_game(n, x_info, y_info):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nx = set(map(int, input().split()[1:])) \r\ny = set(map(int, input().split()[1:]))\r\nz = x | y\r\nif len(z) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "maxlvl = int(input())\r\nlittleX = input()\r\nlittleY = input()\r\nlittleX = littleX.split(\" \")\r\nlittleY = littleY.split(\" \")\r\np = int(littleX[0])\r\nq = int(littleY[0])\r\nlittleX.remove(littleX[0])\r\nlittleY.remove(littleY[0])\r\nlevels = []\r\nfor i in range(1,maxlvl+1):\r\n levels.append(i)\r\nfor i in range(p):\r\n if int(littleX[i]) in levels:\r\n levels.remove(int(littleX[i]))\r\nfor i in range(q):\r\n if int(littleY[i]) in levels:\r\n levels.remove(int(littleY[i]))\r\n\r\nprint(\"I become the guy.\") if len(levels) == 0 else print(\"Oh, my keyboard!\")", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nl=[]\r\nl.extend(x[1:])\r\nl.extend(y[1:])\r\nflag=True\r\nfor i in range(1,n+1):\r\n if i not in l:\r\n flag=False\r\nif flag:print('I become the guy.')\r\nelse:print('Oh, my keyboard!')", "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 n = int(input())\r\n x = [*map(int, input().split())]\r\n y = [*map(int, input().split())]\r\n x = set(x[1:])\r\n y = set(y[1:])\r\n ans = set(x.union(y))\r\n return f\"I become the guy.\" if len(ans) == n else f\"Oh, my keyboard!\"\r\n\r\nstdout.write(solve())", "n = int(input())\r\nlst = [0]*n\r\nX = list(map(int,input().split()))\r\nY = list(map(int,input().split()))\r\nfor i in range(X[0]):\r\n lst[X[i+1]-1] = 1\r\nfor i in range(Y[0]):\r\n lst[Y[i+1]-1] = 1\r\nch = True\r\nfor i in lst:\r\n if i == 0:\r\n ch = False\r\n break\r\nif ch:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n \r\n ", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl=l1[1:]+l2[1:]\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in l:\r\n c=1\r\n print(\"Oh, my keyboard!\")\r\n break\r\nif c==0:\r\n print(\"I become the guy.\")\r\n", "# https://codeforces.com/problemset/problem/469/A\r\n\r\ndef solve(p, q, n):\r\n p = p[1:]\r\n q = q[1:]\r\n\r\n p.sort()\r\n q.sort()\r\n\r\n if len(p) == 0:\r\n p.append(0)\r\n\r\n if len(q) == 0:\r\n q.append(0)\r\n\r\n i, j = 0, 0\r\n\r\n for k in range(1, n + 1):\r\n while p[i] < k and i < len(p) - 1:\r\n i += 1\r\n\r\n while q[j] < k and j < len(q) - 1:\r\n j += 1\r\n\r\n if not (p[i] == k or q[j] == k):\r\n return \"Oh, my keyboard!\"\r\n return \"I become the guy.\"\r\n\r\nn = int(input())\r\n\r\np = [int(e) for e in input().split()]\r\nq = [int(e) for e in input().split()]\r\n\r\nprint(solve(p, q, n))\r\n", "x = []\r\ny = []\r\nlevel = int(input())\r\nxinput = input()\r\nx = list(map(int, xinput.split()))\r\nx.pop(0)\r\nx = set(x)\r\nyinput = input()\r\ny = list(map(int, yinput.split()))\r\ny.pop(0)\r\ny = set(y)\r\nu = x.union(y)\r\nif len(u) == level:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nz = set()\r\nc = set()\r\nq = [int(a) for a in input().split()]\r\nfor i in range(1,len(q)):\r\n z.add(q[i])\r\nq = [int(a) for a in input().split()]\r\nfor i in range(1,len(q)):\r\n c.add(q[i])\r\nX = z.union(c)\r\nif len(X) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n", "def solve(n, x_levels, y_levels):\r\n all_levels = set(range(1, n + 1))\r\n combined_levels = x_levels.union(y_levels)\r\n \r\n if combined_levels == all_levels:\r\n return \"I become the guy.\"\r\n else:\r\n return \"Oh, my keyboard!\"\r\n\r\n# Read input\r\nn = int(input())\r\nx_info = list(map(int, input().split()))\r\ny_info = list(map(int, input().split()))\r\n\r\np, x_levels = x_info[0], set(x_info[1:])\r\nq, y_levels = y_info[0], set(y_info[1:])\r\n\r\n# Calculate and print the result\r\nresult = solve(n, x_levels, y_levels)\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int, input().split()[1:]))\r\nb = list(map(int, input().split()[1:]))\r\n\r\nlevels = sorted(set(a+b))\r\nresult = ('Oh, my keyboard!', 'I become the guy.')[levels==list(range(1, n+1))]\r\nprint(result)\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\nx_list = list(map(int, input().split()))\ny_list = list(map(int, input().split()))\n\np, p_list = x_list[0], x_list[1:]\nq, q_list = y_list[0], y_list[1:]\n\nif p + q < n:\n sys.stdout.write(\"Oh, my keyboard!\")\n exit()\n\nif p == 0 and q == 0:\n sys.stdout.write(\"Oh, my keyboard!\")\n\nn_list = [0] * n\ncompare_list = [1] * n\n\nfor i, level in enumerate(p_list):\n n_list[level - 1] = 1\n\nfor i, level in enumerate(q_list):\n n_list[level - 1] = 1\n\nif n_list == compare_list:\n sys.stdout.write(\"I become the guy.\")\n exit()\n\nelse:\n sys.stdout.write(\"Oh, my keyboard!\")\n exit()\n", "n = int(input())\r\na = input().split()\r\nb = input().split()\r\ncount = 0\r\nall = set(a[1:]+b[1:])\r\nall = [int(x) for x in all]\r\nall.sort()\r\nlist =[]\r\nfor i in range(1,n+1):\r\n list.append(i)\r\nif list == all:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n=int(input())\r\np=[int(x) for x in input().split()]\r\nq=[int(x) for x in input().split()]\r\np.pop(0)\r\nq.pop(0)\r\ntot=0\r\nfor i in range(1,n+1):\r\n num=p.count(i)+q.count(i)\r\n if(num>0):\r\n tot+=1\r\nif tot==n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n\r\n", "q=input;print(\"IO hb,e cmoym ek etyhbeo agrudy!.\"[int(q())>len({*q().split()[1:],*q().split()[1:]})::2])", "n = int(input())\np = [int(i) for i in input().split()]\nq = [int(i) for i in input().split()]\ndel p[0]\ndel q[0]\nt= [y for x in [p, q] for y in x]\nt=sorted(set(t))\ncnt,ans=1,0\nflag=False\nif len(t)<n:\n flag=True\nelse:\n for i in range(0, len(t)):\n if t[i] == cnt:\n ans += 1\n cnt+=1\n else:\n break\n\nif ans==n and flag==False:print(\"I become the guy.\")\nelse:print(\"Oh, my keyboard!\")\n\n\n\n \t\t\t \t \t \t\t\t\t \t\t\t\t", "levels=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nx.pop(0)\r\ny.pop(0)\r\nx.extend(y)\r\nfor i in range(1,levels+1):\r\n if i not in x:\r\n #print(i)\r\n f=False\r\n break\r\n else:\r\n f=True\r\nif(f):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input());x=set(list(map(int,input().split()))[1:]);y=set(list(map(int,input().split()))[1:])\r\nprint('I become the guy.')if len(x.union(y))==n else print('Oh, my keyboard!') \r\n", "n=int(input())\r\np_in=list(map(int,input().split()))\r\nq_in=list(map(int,input().split()))\r\np=p_in[0]\r\nq=q_in[0]\r\npset=set(p_in[1:])\r\nqset=set(q_in[1:])\r\ntotal=pset.union(qset)\r\nif len(total)==n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "'''\nwrong solution ; mentioned here: https://codeforces.com/blog/entry/81722\ndef main():\n n = int(input())\n arrX = set(list(map(int,input().split(' '))))\n if(len(arrX)==1 and 0 in arrX):\n arrX = set()\n arrY = set(list(map(int,input().split(' '))))\n if (len(arrY)==1 and 0 in arrY):\n arrY = set()\n\n #print(arrX)\n #print(arrY)\n #print(arrX.union(arrY) - arrX.intersection(arrY))\n arrRes = {*arrX,*arrY}\n res = len(arrRes)\n print(arrRes)\n \n\n if(res==n):\n print(\"I become the guy.\")\n else:\n print(\"Oh, my keyboard!\")\n''' \ndef main():\n n = int(input())\n a = list(map(int,input().split(' ')))[1:]\n b = list(map(int,input().split(' ')))[1:]\n s = set(a)\n t = set(b)\n k = s.union(t)\n\n ok = 0 \n\n for i in range(1,n+1):\n if i in k:\n ok = 1\n else:\n ok = 0\n break \n\n if ok:\n print('I become the guy.')\n else:\n print(\"Oh, my keyboard!\")\n\nif __name__ == '__main__':\n main()\n", "def main():\n n = int(input())\n\n p_input = list(map(int, input().split()))\n p = p_input[0]\n p_levels = p_input[1:]\n\n q_input = list(map(int, input().split()))\n q = q_input[0]\n q_levels = q_input[1:]\n\n result = p_levels[:]\n for i in range(q):\n if q_levels[i] not in result:\n result.append(q_levels[i])\n\n status = True\n result.sort()\n if len(result) == n:\n for i in range(n):\n if result[i] != i + 1:\n status = False\n else:\n status = False\n\n if status:\n print(\"I become the guy.\")\n else:\n print(\"Oh, my keyboard!\")\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 \t", "# @name: A. I Wanna Be the Guy\r\n# @author: AbrarShakhi\r\n# @link: https://codeforces.com/problemset/problem/469/A\r\n\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nx.pop(0)\r\ny.pop(0)\r\n\r\nz = x + y\r\nz = list(set(z))\r\nif len(z) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in l[1:len(l)]+k[1:len(k)]:\r\n c+=1\r\nif c==0:print('I become the guy.')\r\nelse:print('Oh, my keyboard!')", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\n\r\n\r\nall_levels = set(range(1, n + 1))\r\nunit = set(x[1:]) | set(y[1:])\r\n\r\nprint(\"I become the guy.\") if all_levels.issubset(unit) else print(\"Oh, my keyboard!\")", "stages = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\ntogglebreak = False\r\ndel x[0]\r\ndel y[0]\r\nfor a in range(stages):\r\n if (a+1) not in x and (a+1) not in y:\r\n print('Oh, my keyboard!')\r\n togglebreak = True\r\n break\r\nif togglebreak == False:\r\n print('I become the guy.')", "n = int(input())\r\n\r\np_levels = list(map(int, input().split()))\r\nq_levels = list(map(int, input().split()))\r\n\r\npassed_levels = set(p_levels[1:] + q_levels[1:])\r\n#print(passed_levels)\r\n\r\nif len(passed_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nA = set(list(map(int, input() .split()))[1:])\r\nB = set(list(map(int, input() .split()))[1:])\r\nC = A|B\r\nC1 = {i for i in range(1, n + 1)}\r\nif C == C1:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nlevels= set(x[1:]) | set(y[1:])\r\nif len(levels)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\nlst1.extend(lst2[1:])\r\nx = (n * (n + 1)) // 2\r\nif sum(set(lst1[1:])) == x:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n=int(input())\r\np,*x=map(int,input().split())\r\nq,*y=map(int,input().split())\r\nall_levels=set(range(1,n+1))\r\ncomb_levels=set(x)|set(y)\r\n\r\nif comb_levels==all_levels:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np= set(map(int, input().split()[1:]))\r\nq= set(map(int, input().split()[1:]))\r\nall= p.union(q)\r\nif all== set(range(1,n+1)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input(\"\"))\r\nlevx=input(\"\").split(\" \")\r\nlevy=input(\"\").split(\" \")\r\ndel levx[0]\r\ndel levy[0]\r\ns=set(levx+levy)\r\nif len(s)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nk = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nres = [0] * n\r\nk = k[1:]\r\nl = l[1:]\r\nfor i in k:\r\n res[i-1] = 1\r\nfor i in l:\r\n res[i-1] = 1\r\nif 0 in res:\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\")", "import sys\n\ninput = sys.stdin.readline\n\n\nclass Solution:\n def main(self):\n n = int(input())\n x_array = list(map(int, input().split()))\n p, x_stock = x_array[0], x_array[1:]\n y_array = list(map(int, input().split()))\n q, y_stock = y_array[0], y_array[1:]\n\n print('I become the guy.' if len(list(set(x_stock)) + list(set(y_stock) - set(x_stock))) >= n else 'Oh, my keyboard!')\n\nSolution().main()\n \t\t \t \t\t\t\t \t\t\t \t \t \t \t\t\t \t", "v=int(input())\r\nv1=set(map(int,input().split()[1:]))\r\nv2=set(map(int,input().split()[1:]))\r\na=v1.union(v2)\r\nif len(a)==v:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\n\nline1 = input().split(' ')\nsize1 = int(line1[0])\nline1.pop(0)\nset1 = set(line1)\nset11 = set(map(int, set1))\n\nline2 = input().split(' ')\nsize2 = int(line2[0])\nline2.pop(0)\nset2 = set(line2)\nset22 = set(map(int, set2))\n\nans = set11.union(set22)\n\ni = 0\nfor elem in ans:\n if (elem != i + 1):\n print(\"Oh, my keyboard!\")\n exit()\n i += 1\n\nif (n > len(ans)):\n print(\"Oh, my keyboard!\")\n exit()\n\nprint(\"I become the guy.\")\n \t\t\t \t \t \t\t\t\t \t\t\t\t", "n = int(input())\r\nnum = set()\r\np = input().split(' ')\r\nfor i in p[1:]:\r\n num.add(int(i))\r\n \r\nq = input().split(' ')\r\nfor i in q[1:]:\r\n num.add(int(i))\r\n \r\nif n == len(num):\r\n print(\"I become the guy.\")\r\n \r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "def solve(n,l1,l2):\r\n return 'I become the guy.' if len(set(l1[1:] + l2[1:])) == n else 'Oh, my keyboard!'\r\nn = int(input())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int, input().split()))\r\nprint(solve(n,l1,l2))\r\n", "n = int(input())\r\nx_levels = set(map(int, input().split()[1:]))\r\ny_levels = set(map(int, input().split()[1:]))\r\n\r\nall_levels = x_levels.union(y_levels)\r\n\r\nif len(all_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n'''\r\nn=int(input())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\ns=max(set(p))\r\ns1=max(set(q))\r\na=max(s,s1)\r\nif s>=n:\r\n print(\"Oh, my keyboard!\")\r\n\r\n\r\nelif a>=n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n'''\r\n", "import sys\r\nn = int(input())\r\narr1 = [int(i) for i in sys.stdin.readline().split()]\r\narr2 = [int(i) for i in sys.stdin.readline().split()]\r\ndel arr1[0]\r\ndel arr2[0]\r\nif len(dict.fromkeys(arr1 + arr2)) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "n = int(input())\r\nlst_1 = [int(i) for i in input().split()]\r\nlst_2 = [int(i) for i in input().split()]\r\nk = set()\r\n\r\nfor i in range(lst_1[0]):\r\n k.add(lst_1[i+1])\r\nfor j in range(lst_2[0]):\r\n k.add(lst_2[j+1])\r\nif len(k) >= n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\np=x[0]\r\nq=y[0]\r\n\r\nans=set()\r\nfor i in range(p):\r\n ans.add(x[i+1])\r\nfor i in range(q):\r\n ans.add(y[i+1])\r\nif len(ans)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "t=int(input())\r\nli1=list(map(int,input().split()))\r\nli2=list(map(int,input().split()))\r\nc=0\r\nli11=li1[1:]\r\nli22=li2[1:]\r\nfor i in range(1,t+1):\r\n if i in li11 or i in li22:\r\n c+=1\r\n else:\r\n print(\"Oh, my keyboard!\")\r\n break\r\nif c==t:\r\n print(\"I become the guy.\")", "n = int(input())\np = list(map(int, input().split()))\np.pop(0)\nq = list(map(int, input().split()))\nq.pop(0)\n\narr = p + q\narr_s = set(arr)\nif len(arr_s) == n:\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n", "n = int(input())\r\nx_levels = set(input().split()[1:])\r\ny_levels = set(input().split()[1:])\r\n\r\nprint(\"I become the guy.\" if len(x_levels | y_levels) == n else \"Oh, my keyboard!\")", "# Read input\r\nn = int(input()) # Total number of levels\r\n\r\n# Levels Little X can pass\r\np_levels = set(map(int, input().split()[1:]))\r\n\r\n# Levels Little Y can pass\r\nq_levels = set(map(int, input().split()[1:]))\r\n\r\n# Create a set of all levels from 1 to n\r\nall_levels = set(range(1, n + 1))\r\n\r\n# Check if the combined levels cover all levels\r\nif all_levels.issubset(p_levels.union(q_levels)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "# Read input\nn = int(input()) # Number of levels\nx_levels = set(map(int, input().split()[1:])) # Levels Little X can pass\ny_levels = set(map(int, input().split()[1:])) # Levels Little Y can pass\n\n# Create a set containing all levels from 1 to n\nall_levels = set(range(1, n + 1))\n\n# Check if they can pass all levels\nif all_levels.issubset(x_levels.union(y_levels)):\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\t \t\t \t\t\t \t\t \t\t\t \t \t \t \t \t\t\t", "n = int(input())\r\ns = list(map(int,input().split()))\r\ns1 = list(map(int,input().split()))\r\n\r\nd = []\r\nfor i in range(1,s[0]+1):\r\n d.append(s[i])\r\nfor i in range(1,s1[0]+1):\r\n d.append(s1[i])\r\n\r\nfor i in range(1,n+1):\r\n if (not(i in d)):\r\n print(\"Oh, my keyboard!\")\r\n break\r\nelse:\r\n print(\"I become the guy.\")", "n=int(input())\r\narr=[0]*n\r\nflag=True\r\nls1=list(map(int,input().split()))\r\nls2=list(map(int,input().split()))\r\nfor i in ls1[1:]:\r\n arr[i-1]+=1\r\nfor i in ls2[1:]:\r\n arr[i-1]+=1\r\nfor i in arr:\r\n if i==0:\r\n print(\"Oh, my keyboard!\")\r\n flag=False\r\n break \r\nif flag:\r\n print(\"I become the guy.\")\r\n# print(arr)", "def can_pass_whole_game(n, x_levels, y_levels):\r\n required_levels = set(range(1, n + 1))\r\n missing_levels = required_levels.difference(x_levels[1:], y_levels[1:])\r\n return \"I become the guy.\" if not missing_levels else \"Oh, my keyboard!\"\r\n\r\nn = int(input())\r\nx_levels = list(map(int, input().split()))\r\ny_levels = list(map(int, input().split()))\r\n\r\nresult = can_pass_whole_game(n, x_levels, y_levels)\r\nprint(result)\r\n", "n = int(input())\r\na = set(map(int, input().split()[1:]))\r\nb = set(map(int, input().split()[1:]))\r\n\r\nall_levels = set(range(1, n + 1))\r\n\r\ncan_pass_all_levels = all(level in a or level in b for level in all_levels)\r\n\r\nif can_pass_all_levels:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "n=int(input(\"\"))\n\nL=list(map(int,input().split()))\nL1=list(map(int,input().split()))\n\nL2=[]\nfor m in range(1,len(L)):\n if(L[m] not in L2):\n L2.append(L[m])\n \nfor o in range(1,len(L1)):\n if(L1[o] not in L2):\n L2.append(L1[o])\n \nif(len(L2)==n):\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n \n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\np=a[1:]\r\nq=b[1:]\r\nl=p+q\r\nc=0\r\nfor i in range(1,n+1):\r\n if i not in l:\r\n c=1\r\n break\r\nif c==1:\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\")", "n = int(input())\r\nlx = list(map(int,input().split(\" \")))\r\nly = list(map(int,input().split(\" \")))\r\ns = set()\r\ns = s | set(lx[1:lx[0]+1]) | set(ly[1:ly[0]+1])\r\nif len(s) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "def fed():\r\n x=int(input())\r\n w=input().split(' ')[1:]\r\n v=input().split(' ')[1:]\r\n for i in range(x):\r\n if str(i+1) not in w and str(i+1) not in v:\r\n return \"Oh, my keyboard!\"\r\n return \"I become the guy.\"\r\nprint(fed())", "n = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\nr = set(x[1:]+y[1:])\r\nprint('I become the guy.' if len(r) == n else 'Oh, my keyboard!')\r\n", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\ny=[int(i) for i in input().split()]\r\nx.pop(0)\r\ny.pop(0)\r\nk=x+y \r\ncount=0\r\nfor i in range(1,n+1):\r\n if i in k: \r\n count=count+1\r\nif count==n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n\t\t \t \t\t \t\t \t \t\t \t\t\t \t\t\t \t", "N = int(input())\r\nesimene = list(map(int,input().split()))\r\nteine = list(map(int,input().split()))\r\nesimene = esimene[1:]\r\nteine = teine[1:]\r\nkoos = esimene + teine\r\nhulk = set(koos)\r\nif len(hulk) == N:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nl.pop(0)\r\nk.pop(0)\r\nc=0\r\nfor i in range(1,n+1):\r\n if i in l or i in k:\r\n c+=1\r\nif c==n:\r\n print(\"I become the guy.\") \r\nelse:\r\n print(\"Oh, my keyboard!\") \r\n\r\n", "n=int(input())\r\nfq=[0]*(n+1)\r\nq=0\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nfor i in range(1,len(a)):\r\n fq[a[i]]+=1\r\nfor i in range(1,len(b)):\r\n fq[b[i]]+=1\r\nfor i in range(1,n+1):\r\n if fq[i]!=0:\r\n q+=1\r\n else:\r\n break\r\nif q==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\ny = list(map(int,input().split()))\r\n\r\nx = x[1:]\r\ny = y[1:]\r\n\r\nflag = 0\r\nfor i in range(1,n+1):\r\n if i not in x and i not in y:\r\n flag = 1 \r\n break\r\nif flag:\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\")", "num = int(input())\r\ns1 = input()\r\ns2 = input()\r\nif len(set(s1.split()[1:]+s2.split()[1:]))==num:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\n\r\nl = []\r\n\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\n\r\nx = x[1:]\r\ny = y[1:]\r\n\r\nl = x+y\r\n\r\nlist_set = set(l)\r\nunique_list = (list(list_set))\r\n\r\nif len(unique_list) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "nu = int(input()) \nlevels = set(range(1, nu+1)) \nx = set(map(int, input().split()[1:])) \ny = set(map(int, input().split()[1:])) \ncovered_levels = x.union(y) \nif levels.issubset(covered_levels):\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\t \t\t \t\t\t \t \t \t \t\t\t \t\t", "l = int(input())\r\nx = list(input().split())\r\ny = list(input().split())\r\nx = x[1:]\r\ny = y[1:]\r\nt = x+y\r\ns = set(t)\r\nif len(s) == l:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\np=a[0]\r\na.remove(a[0])\r\nb=list(map(int,input().split(\" \")))\r\nq=b[0]\r\nb.remove(b[0])\r\nfor i in b:\r\n a.append(i)\r\nif len(set(a))==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\nx1 = set(map(int, input().split()[1:]))\ny1 = set(map(int, input().split()[1:]))\nT = set(range(1, n+1))\nx = T.issubset(x1.union(y1))\nif x:\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\t\t\t\t \t\t \t \t \t \t\t\t \t \t \t\t \t", "n = int(input())\r\n\r\nx_list = list(map(int, input().split()))\r\ny_list = list(map(int, input().split()))\r\n\r\nx_level = x_list[1:]\r\ny_level = y_list[1:]\r\n\r\ntotal = 0\r\n\r\nfor i in range(1,n+1):\r\n if i not in x_level and i not in y_level:\r\n total += 1\r\n\r\nif total == 0:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n \r\n", "num = int(input())\r\nls = []\r\nfor i in range(2):\r\n mylist = list(map(int, input().split()))\r\n for j in range(1,mylist[0]+1):\r\n if mylist[j] not in ls:\r\n ls.append(mylist[j])\r\nif num == len(ls):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "def can_pass_whole_game(n, p_levels, q_levels):\r\n all_levels = set(range(1, n+1))\r\n x_levels = set(p_levels[1:]) if p_levels[0] > 0 else set()\r\n y_levels = set(q_levels[1:]) if q_levels[0] > 0 else set()\r\n combined_levels = x_levels.union(y_levels)\r\n return combined_levels == all_levels\r\nn = int(input())\r\np_levels = list(map(int, input().split()))\r\nq_levels = list(map(int, input().split()))\r\nresult = can_pass_whole_game(n, p_levels, q_levels)\r\nif result:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nlevels = [0] * n\r\n\r\n# Levels Little X can pass\r\np_levels = list(map(int, input().split()))[1:]\r\nfor level in p_levels:\r\n levels[level - 1] = 1\r\n\r\n# Levels Little Y can pass\r\nq_levels = list(map(int, input().split()))[1:]\r\nfor level in q_levels:\r\n levels[level - 1] = 1\r\n\r\n# Check if all levels are covered\r\nif all(levels):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nb = list(map(int, input().split()))\r\n\r\nc = []\r\n\r\nfor i in range(n):\r\n c.append(0)\r\nfor i in range(1, a[0]+1):\r\n c[a[i]-1] = 1\r\nfor i in range(1, b[0]+1):\r\n c[b[i]-1] = 1\r\nif sum(c) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n = int(input())\r\nX, Y = [_ for _ in map(int, input().split())], [_ for _ in map(int, input().split())]\r\nflag = True\r\nfor _ in range(1, n + 1):\r\n if X[1:].count(_) + Y[1:].count(_) == 0:\r\n flag = False\r\n break\r\nprint('I become the guy.' if flag else 'Oh, my keyboard!')", "n = int(input())\r\nx = list(map(int,input().split()))[1:]\r\ny = list(map(int,input().split()))[1:]\r\nif (set(x)| set(y)) == set(list(range(1,n+1))):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n=int(input())\r\nx=input().split()\r\ny=input().split()\r\nd=[]\r\nfor i in range(int(x[0])):\r\n d.append(int(x[i+1]))\r\nfor i in range(int(y[0])):\r\n d.append(int(y[i+1]))\r\n \r\nd2=[]\r\nfor i in range(n):\r\n d2.append(i+1)\r\nd2.sort()\r\nd2=set(d2)\r\nd.sort()\r\nd=set(d)\r\nif(d2==d):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "# Read input values\r\nn = int(input())\r\nx_levels = set(map(int, input().split()[1:]))\r\ny_levels = set(map(int, input().split()[1:]))\r\n\r\n# Merge the sets of levels they can pass\r\nmerged_levels = x_levels.union(y_levels)\r\n\r\n# Check if they can pass all levels from 1 to n\r\nif len(merged_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "i=input;print(\"IO hb,e cmoym ek etyhbeo agrudy!.\"[int(i())>len(set(i().split()[1:]+i().split()[1:]))::2])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\nx = l.pop(0)\r\ny = m.pop(0)\r\nl = set(l)\r\nm = set(m)\r\nif n == len(l.union(m)):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n", "n = int(input())\r\nx = input().split(\" \")\r\ny = input().split(\" \")\r\nx.remove(x[0])\r\ny.remove(y[0])\r\npassed = 0\r\nfor i in range(1,n+1):\r\n if str(i) in x or str(i) in y:\r\n passed += 1\r\nif passed == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nx = set(map(int, input().split()[1:]))\r\ny = set(map(int, input().split()[1:]))\r\na= set(range(1, n + 1))\r\nif x.union(y) == a:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nl = a[1:] + c[1:] \r\ns = set(l)\r\n\r\nfor i in range(1, n + 1):\r\n if i not in s:\r\n print(\"Oh, my keyboard!\")\r\n break\r\nelse:\r\n print(\"I become the guy.\")\r\n", "from os import path\r\nimport sys\r\nif(path.exists('input.txt')):\r\n sys.stdin=open(\"input.txt\",\"r\")\r\n sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\n# n = int(input())\r\n# l = [[j for j in input()] for i in range(n)]\r\n# print(l)\r\n# n,h = map(int,input().split())\r\nn = int(input())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nl = set(l1[1:]+l2[1:])\r\nf = 1\r\nfor i in range(1,n+1):\r\n if i not in l:\r\n print(\"Oh, my keyboard!\")\r\n f = 0\r\n break\r\nif f:\r\n print(\"I become the guy.\")\r\n\r\n", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\n\r\np = a1[1:]\r\nq = a2[1:]\r\n\r\nfinal = []\r\n\r\nfor i in range(len(p)):\r\n final.append(p[i])\r\n\r\nfor i in range(len(q)):\r\n if q[i] not in final:\r\n final.append(q[i])\r\n\r\nif len(final) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "def solve():\r\n x = int(input())\r\n st = set()\r\n l1 = [int(i) for i in input().split()][1:]\r\n l2 = [int(i) for i in input().split()][1:]\r\n st.update(l1+l2)\r\n print('I become the guy.' if len(st) == x else 'Oh, my keyboard!')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "n = int(input())\r\nx = set(map(int, input().split()[1:]))\r\ny = set(map(int, input().split()[1:]))\r\n\r\nlevels = set(range(1, n + 1))\r\n\r\nif levels.issubset(x.union(y)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "import collections as c\r\nn=int(input())\r\nar1=list(map(int,input().split()))\r\nar2=list(map(int,input().split()))\r\nar1=ar1[1:]+ar2[1:]\r\ndic=c.Counter(ar1)\r\nif(len(dic)==n):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\nm = list(map(int, input().split()))[1:]\nx = list(map(int, input().split()))[1:]\ny = list(set(x+m))\n# print(y)\nfor i in range(1, n+1):\n if i not in y:\n print(\"Oh, my keyboard!\")\n break\nelse: print(\"I become the guy.\")\n\n\t \t \t \t \t \t\t\t \t\t \t\t\t \t\t \t\t", "s=int(input())\r\nd=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nj=m[1:]+d[1:]\r\nf=set(j)\r\nif(s==len(f)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\np.pop(0)\r\nq.pop(0)\r\nr = p + q\r\nr = set(r)\r\nif len(r) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nx = list(map(int,input().split()))\r\nx.pop(0)\r\nx2 = list(map(int,input().split()))\r\nx2.pop(0)\r\nx = x + x2\r\nif len(set(x)) == n :\r\n print(\"I become the guy.\")\r\nelse :\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\nx = input().split()\r\ny = input().split()\r\nlist_num = []\r\nfor i in range(len(x)-1):\r\n list_num.append(x[i+1])\r\nfor i in range(len(y)-1):\r\n list_num.append(y[i+1])\r\nlist_num = sorted(list_num)\r\n# print(list_num)\r\nlist2 = list(dict.fromkeys(list_num))\r\na = \"0\"\r\nif a in list2:\r\n list2.remove(a)\r\n# print(list2)\r\nif len(list2) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\") ", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nl = list(set(x[1:] + y[1:]))\r\nk = n*(n+1)//2\r\nif k == sum(l):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n = int(input())\r\nlst_x = [int(i) for i in input().split()][1:]\r\nlst_y = [int(i) for i in input().split()][1:]\r\nset_lst = []\r\nfor a in lst_x:\r\n if a not in set_lst:\r\n set_lst.append(a)\r\n \r\nfor a in lst_y:\r\n if a not in set_lst:\r\n set_lst.append(a)\r\n \r\nif len(set_lst) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n\r\n", "n = int(input())\r\ns = [x for x in input().split()]\r\nt = [x for x in input().split()]\r\n\r\ndel s[0]\r\ndel t[0]\r\n\r\nans = set(t)\r\nfor x in s:\r\n ans.add(x)\r\n\r\nif len(ans) == n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "n = int(input())\r\nlittle_x=list(map(int,input().split()))\r\nlittle_y=list(map(int,input().split()))\r\nlittle_x.pop(0)\r\nlittle_y.pop(0)\r\nlittle_x+=little_y\r\nprint('I become the guy.' if len(set(little_x))>=n and n in little_x else 'Oh, my keyboard!')", "a=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nx.pop(0)\r\ny.pop(0)\r\nt=set(x+y)\r\nif len(t) == a:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# your code goes here\r\nn=int(input())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\ns=set()\r\nfor i in range(1,p[0]+1):\r\n\ts.add(p[i])\r\n# print(s)\r\nfor i in range(1,q[0]+1):\r\n\ts.add(q[i])\r\n# print(s)\r\nif len(s)>=n:\r\n\tprint(\"I become the guy.\")\r\nelse:\r\n\tprint('Oh, my keyboard!')", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nnum=a[0]\r\nnum1=b[0]\r\na[0]=0\r\nb[0]=0\r\nc=set(a+b)\r\ntemp=1\r\nfor i in range(1,n+1):\r\n if i not in c:\r\n temp=0\r\nif temp==1:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "t=int(input())\r\n\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl=[]\r\na=l1[0]\r\nb=l2[0]\r\nfor i in range(1,a+1):\r\n l.append(l1[i])\r\nfor i in range(1,b+1):\r\n l.append(l2[i])\r\n#print(l)\r\nc=list(set(l))\r\nm=[]\r\nt+=1\r\nfor i in range(1,t):\r\n m.append(i)\r\n#print(m)\r\n#rint(c)\r\nif m==c:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "def can_pass_all_levels(n, x_levels, y_levels):\n all_levels = set(range(1, n+1))\n x_levels_set = set(x_levels[1:])\n y_levels_set = set(y_levels[1:])\n union_levels = x_levels_set.union(y_levels_set)\n \n if union_levels == all_levels:\n return \"I become the guy.\"\n else:\n return \"Oh, my keyboard!\"\n\n\nn = int(input())\nx_levels = list(map(int, input().split()))\ny_levels = list(map(int, input().split()))\n\n\nresult = can_pass_all_levels(n, x_levels, y_levels)\n\n\nprint(result)\n \t\t \t\t \t \t \t\t\t\t \t\t\t \t\t\t", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\nx = x[1:]\r\ny = y[1:]\r\nt = True\r\nfor i in range(1, n+1):\r\n if i not in x and i not in y:\r\n t = False\r\n break\r\nif t == True:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input())\r\np = [int(a) for a in input().split()]\r\nq = [int(a) for a in input().split()]\r\np = p[1:]\r\nq = q[1:]\r\nfor i in range(1, n+1):\r\n if not i in p and i not in q:\r\n print('Oh, my keyboard!')\r\n break\r\nelse:\r\n print('I become the guy.')", "uniq = []\r\nnum = int(input())\r\nlitx = list(input().split(\" \"))\r\nlity = list(input().split(\" \"))\r\ndel litx[0]\r\ndel lity[0]\r\nfor x in litx:\r\n if x not in uniq:\r\n uniq.append(x)\r\nfor y in lity:\r\n if y not in uniq:\r\n uniq.append(y)\r\nif len(uniq) == num:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n\r\n", "n=int(input())\r\np=input().split()\r\nq=input().split()\r\nr=[]\r\nfor i in range(1,len(p)):\r\n r.append(int(p[i]))\r\nfor ii in range(1,len(q)):\r\n r.append(int(q[ii]))\r\ns=set(r)\r\nif len(s)>=n:\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')\r\n \r\n ", "n = int(input())\r\nx = input()[1:]\r\ny = input()[1:]\r\nxy = x+y\r\n\r\nif all([str(i) in xy for i in range(1, n+1)]):\r\n print('I become the guy.')\r\nelse:\r\n print('Oh, my keyboard!')", "c=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nj=0\r\nfor i in range(1,c+1):\r\n if i in x[1::] or i in y[1::]:\r\n j+=1\r\nif j == c:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# Input the total number of levels\r\nn = int(input())\r\n\r\n# Input levels Little X can pass\r\np, *x_levels = map(int, input().split())\r\n\r\n# Input levels Little Y can pass\r\nq, *y_levels = map(int, input().split())\r\n\r\n# Create a set of levels that Little X can pass\r\nx_set = set(x_levels)\r\n\r\n# Create a set of levels that Little Y can pass\r\ny_set = set(y_levels)\r\n\r\n# Combine the sets of levels they can pass\r\ncombined_set = x_set.union(y_set)\r\n\r\n# Check if they can pass all levels from 1 to n\r\nif len(combined_set) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx=set(x[1:])\r\ny=list(map(int,input().split()))\r\ny=set(y[1:])\r\nthe_set=x|y\r\nif the_set.issuperset(set(range(1,n+1))):\r\n print(\"I become the guy.\")\r\nelse : print(\"Oh, my keyboard!\")", "def solve(n, p, q):\r\n comb = set(p[1:] + q[1:])\r\n for i in range(1, n+1):\r\n if i not in comb:\r\n print(\"Oh, my keyboard!\")\r\n return\r\n print(\"I become the guy.\")\r\n \r\ndef main():\r\n # Reading multiple test cases\r\n n = int(input())\r\n \r\n p = list(map(int, input().split()))\r\n q = list(map(int, input().split()))\r\n solve(n, p, q)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\np_levels = set(map(int, input().split()[1:]))\r\nq_levels = set(map(int, input().split()[1:]))\r\n\r\n# Combine the levels that both Little X and Little Y can pass\r\ncombined_levels = p_levels.union(q_levels)\r\n\r\n# Check if the combined levels cover all levels from 1 to n\r\nif len(combined_levels) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input()) # Number of levels\r\np, *x_levels = map(int, input().split()) # Levels Little X can pass\r\nq, *y_levels = map(int, input().split()) # Levels Little Y can pass\r\n\r\n# Create a set containing all levels\r\nall_levels = set(range(1, n + 1))\r\n\r\n# Combine the levels Little X and Little Y can pass\r\npassed_levels = set(x_levels + y_levels)\r\n\r\n# Check if the combined set of passed levels contains all levels\r\nif passed_levels == all_levels:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\np = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\ncan = [0] * n\n\nfor idx in range(1, len(p)):\n can[p[idx]-1] = 1\n\nfor idx in range(1, len(q)):\n can[q[idx]-1] = 1 \n\nans = True\nfor idx in range(0, len(can)):\n if can[idx]==0:\n ans = False\n\nif ans:\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n \t \t \t\t\t \t\t\t \t \t \t\t \t", "n =int(input())\r\nok=[]\r\nfor i in range (n):\r\n ok.append(False)\r\n \r\nline1=[int(i)for i in input().split()]\r\nfor i in range (1,len(line1)):\r\n ok[line1[i]-1]= True\r\nline2=[int(i)for i in input().split()]\r\nfor i in range (1,len(line2)):\r\n ok[line2[i]-1]= True\r\nfor i in range (len(ok)):\r\n if(ok[i]==False):\r\n print(\"Oh, my keyboard!\")\r\n exit()\r\nprint(\"I become the guy.\")", "n = int(input(\"\"))\r\np1, *a1 = map(int, input(\"\").strip().split())\r\np2, *a2 = map(int, input(\"\").strip().split())\r\n \r\nresult = a1+a2\r\nresult.sort()\r\nfinalresult = list(set(result))#remove duplicates from the list\r\n\r\nif len(finalresult) < n:\r\n print(\"Oh, my keyboard!\")\r\n\r\nelse:\r\n print(\"I become the guy.\")", "n=int(input())\r\nl=list(map(int,input().split()))[1:]+list(map(int,input().split()))[1:]\r\ns=set(l)\r\nfor i in range(1,n+1):\r\n if i not in s:\r\n print('Oh, my keyboard!')\r\n break\r\nelse:\r\n print('I become the guy.')", "# Read the input\r\nn = int(input())\r\nlevels_x = set(map(int, input().split()[1:]))\r\nlevels_y = set(map(int, input().split()[1:]))\r\n\r\n# Combine the levels they can pass\r\nall_levels = levels_x.union(levels_y)\r\n\r\n# Check if they can pass all levels\r\nif all_levels == set(range(1, n + 1)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nlevels = set(range(1, n + 1))\r\np, *x_levels = map(int, input().split())\r\nq, *y_levels = map(int, input().split())\r\ncombined_levels = set(x_levels + y_levels)\r\nif levels.issubset(combined_levels):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=set()\r\nfor i in range(1,len(a)):\r\n ans.add(a[i])\r\nfor i in range(1,len(b)):\r\n ans.add(b[i])\r\nif len(ans)>=n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# Read input\r\nn = int(input())\r\np_levels = set(map(int, input().split()[1:]))\r\nq_levels = set(map(int, input().split()[1:]))\r\n\r\n# Combine the levels that Little X and Little Y can pass\r\ncombined_levels = p_levels | q_levels\r\n\r\n# Check if all levels from 1 to n are in the combined set\r\nif all(level in combined_levels for level in range(1, n + 1)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "num_levels = int(input())\r\nseen = set()\r\nfor _ in range(2):\r\n levels = list(map(int, input().split()))\r\n levels = levels[1:]\r\n seen.update(levels)\r\nfor i in range(num_levels):\r\n if not (i + 1) in seen:\r\n print(\"Oh, my keyboard!\")\r\n quit()\r\nprint(\"I become the guy.\")", "n=int(input())\r\nl1 = list(map(int,input().split()))\r\nl1.pop(0)\r\nl2 = list(map(int,input().split()))\r\nl2.pop(0)\r\nl1 = l1+l2\r\nif(len(set(l1))==n ):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n = int(input()) # Number of levels\r\np_levels = set(map(int, input().split()[1:])) # Levels Little X can pass\r\nq_levels = set(map(int, input().split()[1:])) # Levels Little Y can pass\r\n\r\n# Combine the levels that both Little X and Little Y can pass\r\ncombined_levels = p_levels.union(q_levels)\r\n\r\n# Check if the combined levels cover all levels from 1 to n\r\nif all(level in combined_levels for level in range(1, n + 1)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\ns1 = input()\r\nl1 = list(map(int, s1.split()))\r\nl1.remove(l1[0])\r\ns2 = input()\r\nl2 = list(map(int, s2.split()))\r\nl2.remove(l2[0])\r\n\r\nfor i in l1:\r\n if i not in l2:\r\n l2.append(i)\r\n \r\ngot = sorted(l2)\r\nreq = list(range(1,n+1))\r\n\r\nif got == req:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "# Input the total number of levels\r\nn = int(input())\r\n\r\n# Input the levels that the first person wants to pass\r\narrX = list(map(int, input().strip().split()))\r\n\r\n# Input the levels that the second person wants to pass\r\narrY = list(map(int, input().strip().split()))\r\n\r\n# Create a list of levels that need to be passed\r\ncheck = []\r\nfor i in range(1, n + 1):\r\n check.append(i)\r\n\r\n# If the first person's initial level is 0\r\nif arrX[0] == 0:\r\n # Check if the levels specified by the second person cover all levels\r\n if arrY[1:] == check:\r\n print(\"I become the guy.\")\r\n else:\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n # Combine the levels specified by both persons\r\n p = arrX[1:]\r\n q = arrY[1:]\r\n p.extend(q)\r\n \r\n # Find the unique levels that need to be passed\r\n ans = list(set(p))\r\n \r\n # Check if the unique levels match all the levels\r\n if ans == check:\r\n print(\"I become the guy.\")\r\n else:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nx.pop(0); y.pop(0)\r\nx = set(x); y = set(y)\r\nx.update(y)\r\nif len(x) == n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\np1 = p[1::]\r\nq1 = q[1::]\r\np = list(set(p1+q1))\r\nif (len(p))==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl2=[]\r\nfor i in range(1,l[0]+1):\r\n if l[i] not in l2:\r\n l2.append(l[i])\r\nfor i in range(1,l1[0]+1):\r\n if l1[i] not in l2:\r\n l2.append(l1[i])\r\nif len(l2)==n:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "t = int(input())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nl3 = []\r\ndel l1[0]\r\ndel l2[0]\r\nfor i in l1:\r\n l3.append(i)\r\nfor j in l2:\r\n l3.append(j)\r\ns = set(l3)\r\nif len(s) == t:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")", "def can_pass_all_levels(n, p_levels, q_levels):\r\n all_levels = set(range(1, n+1))\r\n x_levels = set(p_levels[1:])\r\n y_levels = set(q_levels[1:])\r\n all_passed_levels = x_levels.union(y_levels)\r\n return all_passed_levels == all_levels\r\n\r\n\r\nn = int(input())\r\np_levels = list(map(int, input().split()))\r\nq_levels = list(map(int, input().split()))\r\n\r\nresult = can_pass_all_levels(n, p_levels, q_levels)\r\nif result:\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n", "n = int(input())\r\nprint('I become the guy.' if len(set(input().split()[1:] + input().split()[1:])) == n else 'Oh, my keyboard!')\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\narr=[0]*n\r\nfor i in range(1,len(a)):\r\n arr[a[i]-1]+=1\r\nfor i in range(1,len(b)):\r\n arr[b[i]-1]+=1\r\nflag=0\r\nfor i in range(n):\r\n if arr[i]==0:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"Oh, my keyboard!\")\r\nelse:\r\n print(\"I become the guy.\")", "n=int(input())\r\nx=list(map(int,input()[2:].split()))\r\ny=list(map(int,input()[2:].split()))\r\nfor i in range(1,n+1):\r\n if i in x:\r\n pass\r\n elif i in y:\r\n pass\r\n else:\r\n print(\"Oh, my keyboard!\")\r\n break\r\nelse:\r\n print(\"I become the guy.\")", "import sys\n\nn = int(input())\n\nX = list(map(int, input().strip().split()))[1:]\nY = list(map(int, input().strip().split()))[1:]\n\ns = set(X + Y)\nif len(s) == n:\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\n", "n = int(input())\n\np, *store_x = map(int, input().split())\n\nq, *store_y = map(int, input().split())\n\n\navailable_keyboards = set(store_x + store_y)\n\nif len(available_keyboards) == n:\n print(\"I become the guy.\")\nelse:\n print(\"Oh, my keyboard!\")\n\n \t \t \t \t \t \t\t\t\t \t \t\t\t\t \t", "n = int(input())\r\na = input().split()[1:]\r\nb = input().split()[1:]\r\nif n==len(set(a+b)):\r\n\tprint(\"I become the guy.\")\r\nelse:\r\n\tprint(\"Oh, my keyboard!\")", "p=input;print(\"IO hb,e cmoym ek etyhbeo agrudy!.\"[int(p())>len({*p().split()[1:],*p().split()[1:]})::2])", "v=input;print(\"IO hb,e cmoym ek etyhbeo agrudy!.\"[int(v())>len({*v().split()[1:],*v().split()[1:]})::2])\r\n#HI CODEFORCES\r\n#", "n = int(input())\r\n\r\n# Read the levels Little X can pass and store them in a set\r\nx_levels = set(map(int, input().split()[1:]))\r\n\r\n# Read the levels Little Y can pass and store them in a set\r\ny_levels = set(map(int, input().split()[1:]))\r\n\r\n# Combine the levels that both Little X and Little Y can pass\r\ncombined_levels = x_levels.union(y_levels)\r\n\r\n# Check if they can pass all levels (1 to n)\r\nif combined_levels == set(range(1, n + 1)):\r\n print(\"I become the guy.\")\r\nelse:\r\n print(\"Oh, my keyboard!\")\r\n" ]

[ "n, k = map(int, input().split())\r\nv = list(map(int, input().split()))\r\ns, dp = [0 for i in range(0, n)], [0 for i in range(0, n)]\r\nsol, a, b = 0, 0, 0\r\n\r\nfor i in range(n-1, -1, -1):\r\n s[i] = v[i]\r\n if i+1 < n: s[i] += s[i+1]\r\n if i+k < n: s[i] -= v[i+k]\r\n\r\n dp[i] = s[i]\r\n if i+1 < n: dp[i] = max(dp[i], dp[i+1])\r\n\r\nfor i in range(0, n):\r\n if i+k > n-1: break\r\n if s[i] + dp[i+k] > sol:\r\n sol = s[i] + dp[i+k]\r\n a = i\r\nfor b in range(a+k, n):\r\n if b+k > n-1: break\r\n if s[a] + s[b] == sol: break\r\n\r\n#print(s)\r\n#print(dp)\r\nprint(a+1, b+1)\r\n\r\n", "a,k=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nans=[]\r\nans.append(sum(z[0:k]))\r\nfor i in range(1,len(z)-k+1):\r\n ans.append(ans[-1]+z[i+k-1]-z[i-1])\r\nmaxa=[0 for i in range(len(ans))]\r\nmaxa[-1]=ans[-1]\r\nfor i in range(len(maxa)-2,-1,-1):\r\n maxa[i]=max(maxa[i+1],ans[i])\r\ntem=0\r\nstart=0\r\nend=0\r\nsave=0\r\nfor i in range(len(ans)-k):\r\n if(ans[i]+maxa[i+k]>tem):\r\n tem=ans[i]+maxa[i+k]\r\n start=i+1\r\n save=ans[i]\r\nfor i in range(start+k-1,len(ans)):\r\n if(ans[i]==tem-save):\r\n print(start,i+1)\r\n exit()\r\n \r\n \r\n \r\n", "n, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nsums = []\r\nfor x in a: sums.append(x + sums[-1] if x > 0 else 0)\r\nS = l = r = ans = pos = 0\r\nfor i in range(k + 1, n - k + 2):\r\n if sums[i - 1] - sums[i - k - 1] > S:\r\n S = sums[i - 1] - sums[i - k - 1]\r\n pos = i - k\r\n if S + sums[i + k - 1] - sums[i - 1] > ans:\r\n ans = S + sums[i + k - 1] - sums[i - 1]\r\n l = pos\r\n r = i\r\nprint(l, r)", "n, k = (int(x) for x in input().split())\nx = [int(x) for x in input().split()]\n\ns = [0]\nfor i in range(n):\n\ts.append(s[i] + x[i])\n\na = n - k - k + 1\nsa = s[n - k] - s[a - 1]\nb = n - k + 1\nsb = s[n] - s[b - 1]\nans = sa + sb\nansa = a\nansb = b\nib = b\n\nwhile a > 1:\n\ta -= 1\n\tsa = s[a + k - 1] - s[a - 1]\n\tb -= 1\n\ttb = s[b + k - 1] - s[b - 1]\n\tif tb >= sb:\n\t\tsb = tb\n\t\tib = b\n\tif sa + sb >= ans:\n\t\tansa = a\n\t\tansb = ib\n\t\tans = sa + sb\n\nprint(ansa, ansb)\n", "def func():\r\n for n1 in range(n):\r\n for x in range(2):\r\n if(n1<k-1):\r\n dp[n1][x]=0\r\n elif(n1==k-1):\r\n if(x==1):\r\n dp[n1][x]=prefix[n1]\r\n else:\r\n dp[n1][x]= 0\r\n else:\r\n if(x==0):\r\n dp[n1][x]= max(prefix[n1]-prefix[n1-k]+dp[n1-k][x+1],dp[n1-1][x])\r\n elif(x==1):\r\n dp[n1][x]= max(prefix[n1]-prefix[n1-k],dp[n1-1][x])\r\n return dp[n-1][0]\r\nn,k=tuple(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nprefix=[0]*n \r\nprefix[0]=y[0]\r\ndp=[[-1,-1]for i in range(n)]\r\nfor i in range(1,n):\r\n prefix[i]=prefix[i-1]+y[i]\r\nfunc()\r\n#print(func(n-1,0))\r\n#print(dp)\r\ni=n-1\r\nj=0\r\nl=[]\r\nwhile(i>=0 and j>=0):\r\n if(i>k-1):\r\n if(j==0):\r\n if(dp[i][j]==dp[i-k][j+1]+prefix[i]-prefix[i-k]):\r\n l.append(prefix[i]-prefix[i-k])\r\n i=i-k\r\n j+=1\r\n else:\r\n i-=1\r\n else:\r\n if(dp[i][j]==prefix[i]-prefix[i-k]):\r\n l.append(prefix[i]-prefix[i-k])\r\n break\r\n else:\r\n i-=1\r\n elif(i==k-1):\r\n if(dp[i][j]==prefix[i]):\r\n #print(\"YES\")\r\n if(j==1):\r\n l.append(prefix[i])\r\n break\r\n else:\r\n break\r\n\r\n# while(i<n and j>=0):\r\n# if(i<k-1):\r\n# i+=1\r\n# if(i==k-1):\r\n# if(dp[i][j]==prefix[i]):\r\n# l.append(i-k+2)\r\n# i+=k\r\n# j-=1\r\n# else:\r\n# i+=1\r\n# else:\r\n# if(j==0):\r\n# if(dp[i][j]==dp[i-k][j+1]+prefix[i]-prefix[i-k]):\r\n# l.append(i-k+2)\r\n# break\r\n# else:\r\n# i+=1\r\n# else:\r\n# if(dp[i][j]==prefix[i]-prefix[i-k]):\r\n# l.append(i-k+2)\r\n# i+=k\r\n# j-=1\r\n\r\ni=k-1\r\nl1=[]\r\nt=1\r\nwhile(i<n and t>=0):\r\n if(i==k-1):\r\n if(prefix[i]==l[t]):\r\n t-=1\r\n l1.append(i-k+2)\r\n i+=k\r\n else:\r\n i+=1\r\n else:\r\n if(l[t]==prefix[i]-prefix[i-k]):\r\n l1.append(i-k+2)\r\n t-=1\r\n i+=k\r\n else:\r\n i+=1\r\nprint(l1[0],l1[1])\r\n#print(dp)", "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\n\r\nsums = [0] + list(accumulate(a))\r\n\r\nS, l, r, ans, pos = 0, 0, 0, 0, 0\r\nfor i in range(k, n-k+1):\r\n if sums[i] - sums[i-k] > S:\r\n S = sums[i] - sums[i-k]\r\n pos = i - k\r\n if S + sums[i+k] - sums[i] > ans:\r\n ans = S + sums[i+k] - sums[i]\r\n l = pos\r\n r = i\r\nprint(l+1, r+1)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nsegments = []\r\ns = 0\r\nfor i in range(k):\r\n s += arr[i]\r\n\r\nsegments.append(s)\r\nfor i in range(k, n):\r\n s += (arr[i] - arr[i-k])\r\n segments.append(s)\r\n\r\nl = len(segments) \r\ndp = [0 for _ in range(l)]\r\ndp[-1] = l-1\r\nfor i in range(l-2, -1, -1):\r\n dp[i] = dp[i+1]\r\n if segments[i] >= segments[dp[i]]:\r\n dp[i] = i\r\n \r\nans = 0\r\nind = 0\r\nfor i in range(n-2*k+1):\r\n if segments[i] + segments[dp[i+k]] > ans:\r\n ans = segments[i] + segments[dp[i+k]]\r\n ind = i\r\n\r\nprint(\"{} {}\".format(ind+1, dp[ind+k]+1)) \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[: len(s) - 1])\r\n\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\nn, k = invr()\r\nnums = inlt()\r\npresum = [0]\r\nfor i in range(n):\r\n presum.append(presum[-1] + nums[i])\r\ndp1 = [[] for _ in range(n - k + 1)]\r\nfor i in range(len(dp1) - 1, -1, -1):\r\n if i == len(dp1) - 1:\r\n dp1[i] = [presum[i + k] - presum[i], i]\r\n else:\r\n if presum[i + k] - presum[i] >= dp1[i + 1][0]:\r\n dp1[i] = [presum[i + k] - presum[i], i]\r\n else:\r\n dp1[i] = dp1[i + 1]\r\ndp2 = [[] for _ in range(n - 2 * k + 1)]\r\nfor i in range(len(dp2) - 1, -1, -1):\r\n if i == len(dp2) - 1:\r\n dp2[i] = [presum[i + k] - presum[i] + dp1[i + k][0], i, dp1[i + k][1]]\r\n else:\r\n if presum[i + k] - presum[i] + dp1[i + k][0] >= dp2[i + 1][0]:\r\n dp2[i] = [presum[i + k] - presum[i] + dp1[i + k][0], i, dp1[i + k][1]]\r\n else:\r\n dp2[i] = dp2[i + 1]\r\nprint(dp2[0][1] + 1, dp2[0][2] + 1)\r\n", "lm = [0] * 200000\r\nli = [0] * 200000\r\nrm = [0] * 200000\r\nri = [0] * 200000\r\n\r\nn, k = map(int, input().split())\r\n\r\nd = list(map(int, input().split()))\r\n\r\nsm = 0\r\nfor i in range(k):\r\n sm += d[i]\r\n\r\nlm[k - 1] = sm\r\nli[i - 1] = 0\r\n\r\nfor i in range(k, n):\r\n sm = sm - d[i - k] + d[i]\r\n if sm > lm[i - 1]:\r\n lm[i] = sm\r\n li[i] = i - k + 1\r\n else:\r\n lm[i] = lm[i - 1]\r\n li[i] = li[i - 1]\r\n\r\nsm = 0\r\nfor i in range(n - 1, n - 1 - k, -1):\r\n sm += d[i]\r\n\r\nrm[n - k] = sm\r\nri[n - k] = n - k\r\n\r\nfor i in range(n - k - 1, -1, -1):\r\n sm = sm - d[i + k] + d[i]\r\n if sm >= rm[i + 1]:\r\n rm[i] = sm\r\n ri[i] = i\r\n else:\r\n rm[i] = rm[i + 1]\r\n ri[i] = ri[i + 1]\r\n\r\nmx = -1\r\nfor i in range(k - 1, n - k):\r\n if lm[i] + rm[i + 1] > mx:\r\n mx = lm[i] + rm[i + 1]\r\n a = li[i]\r\n b = ri[i + 1]\r\n\r\nprint(a + 1, b + 1)\r\n", "def main():\r\n n,k = map(int,input().split())\r\n laws = list(map(int,input().split()))\r\n if 2*k == n:\r\n print(1,1+k)\r\n return\r\n dp = []\r\n dp.append(laws[0])\r\n for i in range(1,n):\r\n dp.append(dp[-1]+laws[i])\r\n\r\n dp2 = []\r\n dp1 = []\r\n for i in range(k-1,n):\r\n curr = dp[i]\r\n if i >= k:\r\n curr -= dp[i-k]\r\n dp1.append(curr)\r\n dp2.append([curr,i-k+1])\r\n\r\n\r\n for i in range(n-k-1,-1,-1):\r\n if dp2[i+1][0] > dp2[i][0]:\r\n dp2[i][1] = dp2[i+1][1]\r\n dp2[i][0] = max(dp2[i+1][0],dp2[i][0])\r\n\r\n #print(dp2)\r\n l1,l2 = -1,float('inf')\r\n max_sum = 0 \r\n for i in range(n-2*k+1):\r\n if dp1[i]+dp2[i+k][0] > max_sum:\r\n l1 = i+1\r\n l2 = dp2[i+k][1]+1\r\n elif dp1[i]+dp2[i+k][0] == max_sum:\r\n l2 = min(l2,dp2[i+k][1]+1)\r\n max_sum = max(max_sum,dp1[i]+dp2[i+k][0])\r\n \r\n\r\n print(l1,l2)\r\n\r\nmain()\r\n", "from math import inf\n\nn, k = map(int, input().split())\na = [int(i) for i in input().split()]\n\ncum = [i for i in a]\nfor i in range(1, n):\n cum[i] += cum[i - 1]\ncum.append(0)\n\nleft = -inf\nval = []\nfor i in range(n):\n if i + k >= n:\n continue\n if i - k < -1:\n continue\n left_t = cum[i] - cum[i - k]\n right_t = cum[i + k] - cum[i]\n if left < left_t:\n left = left_t\n a = i - k + 1\n b = i + 1\n val.append((left + right_t, a, b))\nz = max(val)[0]\nfor i in val:\n v, a, b = i\n if v == z:\n break\nprint(a + 1, b + 1)\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n \r\ndp=[0]\r\nfor i in range(n):\r\n dp+=[dp[i]+a[i]]\r\n \r\nans1=0\r\nans2=0\r\nb=0\r\npb=0\r\nz=0\r\nfor i in range(n-2*k+1,0,-1):\r\n\tc=dp[i+2*k-1]-dp[i+k-1]\r\n\tif c>=b:\r\n\t\tb=c\r\n\t\tpb=i+k\r\n\tca=dp[i+k-1]-dp[i-1]\r\n\tif ca+b>=z:\r\n\t\tz=ca+b\r\n\t\tans1=i\r\n\t\tans2=pb\r\n \r\nprint(ans1,ans2)", "n,k=map(int,input().split())\na=list(map(int,input().split()))\ns=[0]\nfor i in range(k):\n s[0]=s[0]+a[i]\nfor i in range(k,n):\n s.append(s[i-k]-a[i-k]+a[i])\n#make an array for max element\nsa=[]\nfor i in range(len(s)-1,-1,-1):\n if i==len(s)-1:\n sa.append(i)\n else:\n if s[sa[-1]]>s[i]:\n sa.append(sa[-1])\n else:\n sa.append(i)\n\nsa=sa[::-1]\nz=0\nx,y=0,0\nfor i in range(len(s)-k):\n if s[i]+s[sa[i+k]]>z:\n z=s[i]+s[sa[i+k]]\n x,y=i,sa[i+k]\n\n# print(z)\nprint(x+1,y+1)\n", "from sys import stdin,stdout\r\nfrom itertools import accumulate\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst();mx=mxlr=mxrl=0\r\n a=lst()\r\n ps=list(accumulate(a))\r\n lr=[0]*n\r\n mxlr=[0]*n\r\n rl=[0]*(1+n)\r\n mxrl=[0]*(1+n)\r\n for i in range(k-1,n):\r\n lr[i]=ps[i]-(ps[i-k] if i-k>=0 else 0)\r\n for i in range(n-k,-1,-1):\r\n rl[i]=(ps[i+k-1] if i+k-1<n else 0)-(ps[i-1] if i>=1 else 0)\r\n for i in range(n):\r\n mxlr[i]=max(mxlr[max(i-1,0)],lr[i])\r\n for i in range(n-1,-1,-1):\r\n mxrl[i]=max(mxrl[i+1],rl[i])\r\n # print(lr)\r\n # print(mxlr)\r\n # print(rl)\r\n # print(mxrl)\r\n for i in range(n):\r\n if mx<(mxlr[i]+mxrl[i+1]):\r\n mx=(mxlr[i]+mxrl[i+1])\r\n p1,p2=i,i+1\r\n lrsm=mxlr[i]\r\n rlsm=mxrl[i+1]\r\n x1=p1\r\n while x1>=0:\r\n if lr[x1]==lrsm:\r\n x=x1\r\n x1-=1\r\n y=p2\r\n # print(p1,p2)\r\n while y<n:\r\n if rl[y]==rlsm:\r\n break\r\n y+=1\r\n print(x-k+2,y+1)", "n, k = [int(x) for x in input().split()]\r\n\r\nabsurd_scores = [int(x) for x in input().split()]\r\n\r\npartial_sums = [0]\r\n\r\n\r\nfor idx in range(len(absurd_scores)):\r\n partial_sums.append(partial_sums[-1] + absurd_scores[idx])\r\n \r\n# print(partial_sums)\r\n\r\n\r\na = n - 2 * k\r\nb = n - k\r\n\r\nmax_sum = partial_sums[n] - partial_sums[n - 2 * k]\r\n\r\ncur_top_idx = n - k \r\ncur_top_max = partial_sums[n] - partial_sums[n - k]\r\n\r\n# print(max_sum)\r\n# print(cur_top_max)\r\n\r\nfor i in reversed(range(n - 2 * k)):\r\n \r\n new_top_idx = i + k\r\n \r\n# print(new_top_idx)\r\n \r\n new_top_sum = partial_sums[new_top_idx + k] - partial_sums[new_top_idx]\r\n \r\n if new_top_sum >= cur_top_max:\r\n cur_top_max = new_top_sum\r\n cur_top_idx = new_top_idx\r\n \r\n new_low_idx = i\r\n# print(new_low_idx, new_low_idx + k - 1)\r\n \r\n new_sum = partial_sums[new_low_idx + k] - partial_sums[new_low_idx] + cur_top_max\r\n \r\n if new_sum >= max_sum:\r\n a = new_low_idx\r\n b = cur_top_idx\r\n max_sum = new_sum\r\n \r\nprint(a + 1, b + 1)\r\n \r\n \r\n \r\n#Edge Cases\r\n\r\n'''\r\nMust cover entire range [1 4 5 6] for len 2\r\nSmallest idx is 2nd largest value\r\nCan't be greedy taking the max one immediately [2 1 99 100 98] for len 2\r\n'''\r\n\r\n", "import traceback\r\n\r\ntry:\r\n N, k = list(map(int, input().split()))\r\n nums = list(map(int, input().split()))\r\n \r\n scores = []\r\n dp = []\r\n ln = 0\r\n tot = 0\r\n for i in range(N):\r\n tot += nums[i]\r\n ln += 1\r\n if ln == k:\r\n scores.append(tot)\r\n tot -= nums[i-k+1]\r\n ln -= 1\r\n # print(scores)\r\n mx = -float('inf')\r\n for i in range(len(scores)):\r\n mx = max(mx, scores[i])\r\n dp.append(mx)\r\n # print(dp)\r\n mx = -float('inf')\r\n ans = [-1, -1]\r\n # ls = -1\r\n M = len(scores)\r\n for i in range(M-1, k-1, -1):\r\n if dp[i-k] + scores[i] >= mx:\r\n mx = scores[i] + dp[i-k]\r\n ans[1] = i\r\n # print(mx, i)\r\n t = dp[ans[1]-k]\r\n for i in range(len(scores)):\r\n if scores[i] == t:\r\n ans[0] = i\r\n break\r\n ans = ' '.join([str(i+1) for i in ans])\r\n print(ans)\r\n\r\nexcept Exception:\r\n traceback.print_exc()", "n, k = list(map(int,input().strip().split()))[:2]\r\na = list(map(int,input().strip().split()))[:n]\r\n\r\nb = [sum(a[:k])]\r\nfor i in range(n-k):\r\n b.append(b[i] + a[i+k] - a[i])\r\n \r\nc = [-1] * (len(b) - k)\r\n\r\nans = 0\r\nx, y = 0, 0\r\nm = len(b) - 1\r\n \r\nfor i in range(len(c) - 1, -1, -1):\r\n if b[i+k] >= b[m]:\r\n m = i+k\r\n c[i] = m\r\n \r\nfor i in range(len(b) - k):\r\n if ans < b[i] + b[c[i]]:\r\n ans = b[i] + b[c[i]]\r\n x, y = i, c[i]\r\n\r\nprint(x+1, y+1)\r\n ", "from itertools import accumulate\r\nR = lambda: map(int, input().split())\r\nn, k = R()\r\narr = list(R())\r\nacc = list(accumulate(arr))\r\nacc = [x - y for x, y in zip(acc[k - 1:], [0] + acc)]\r\nbs = [i for i in range(len(acc))]\r\nfor i in range(len(bs) - 2, -1, -1):\r\n if acc[bs[i + 1]] > acc[bs[i]]:\r\n bs[i] = bs[i + 1]\r\nfa, fb = 0, k\r\nfor i in range(n - 2 * k + 1):\r\n if acc[fa] + acc[fb] < acc[i] + acc[bs[i + k]]:\r\n fa, fb = i, bs[i + k]\r\nprint(fa + 1, fb + 1, sep=' ')", "n,k = map(int,input().split())\nsum_max_a = 0\nsum_answer = 0\nstart_index_a = -1\nanswer_a = 0\nanswer_b = 0\nsum_max_b = 0\nstart_index_b = -1\nlist_abs = list(map(int,input().split()))\nlist_sum = [0]\nsum1 = 0\nfor j in list_abs:\n sum1 += j\n list_sum.append(sum1)\nfor i in range(k+1,len(list_sum)+1):\n if i + k > n+1:\n break\n S_a = list_sum[i+k-1] - list_sum[i-1]\n S_b = list_sum[i-1] - list_sum[i-k-1]\n if sum_max_b < S_b:\n sum_max_b = S_b\n start_index_b = i - k\n if S_a+sum_max_b > sum_answer:\n answer_b = start_index_b\n sum_answer = S_a + sum_max_b\n answer_a= i\nprint(*sorted([answer_a,answer_b]))", "import sys\r\nimport functools\r\nsys.setrecursionlimit(100000)\r\nn, k = [int(x) for x in sys.stdin.readline().strip().split()]\r\narr = [0]+[int(x) for x in sys.stdin.readline().strip().split()]\r\nfor i in range(1,n+1):\r\n\tarr[i]+=arr[i-1]\r\na = 1\r\nb_ = 0\r\nm = -10**9\r\na_m = -10**9\r\n# print(arr)\r\n# print(k_sum)\r\na_abs = 0\r\nfor b in range(k+1,n-k+2):\r\n\tat = arr[a+k-1]-arr[a-1]\r\n\tif at<arr[b-1]-arr[b-k-1]:\r\n\t\tat = arr[b-1]-arr[b-k-1]\r\n\t\ta = b-k\r\n\tif m<(arr[b+k-1]-arr[b-1]+at):\r\n\t\tm = arr[b+k-1]-arr[b-1]+at\r\n\t\tb_ = b\r\n\t\ta_abs = a\r\nprint(a_abs,b_)\r\n\r\n\r\n", "n, k = map(int, input().split())\n\nx = list(map(int, input().split()))\n\nsu = sum(x[:k])\ns = [su]\n\nfor i in range(1,n-k+1):\n su -= x[i-1]\n su += x[i+k-1]\n s.append(su)\n\nM = (0,0,0)\nm = (0,0)\n\nfor i in range(n-2*k, -1,-1):\n m = max(m, (s[i+k], n-i-k))\n M = max(M, (s[i] + m[0], n-i, m[1]))\n\nprint(n-M[1]+1, n-M[2] + 1)", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nps=[0]\r\nfor i in s:ps+=ps[-1]+i,\r\nmxf=0\r\nansi=0\r\nansj=k\r\nci=0\r\nfor j in range(k,n-k+1):\r\n\tif ps[ci+k]-ps[ci]<ps[j]-ps[j-k]:\r\n\t\tci=j-k\r\n\tif ps[ansi+k]-ps[ansi]+ps[ansj+k]-ps[ansj]<ps[ci+k]-ps[ci]+ps[j+k]-ps[j]:\r\n\t\tansi=ci\r\n\t\tansj=j\r\nprint(ansi+1,ansj+1)\n# Mon Oct 05 2020 15:58:06 GMT+0300 (Москва, стандартное время)\n", "import itertools\r\nn, k = map(int, input().split())\r\nsums = (0,) + tuple(itertools.accumulate(map(int, input().split())))\r\nS = l = r = ans = pos = 0\r\nfor i in range(k, n - k + 1):\r\n if sums[i] - sums[i - k] > S:\r\n S = sums[i] - sums[i - k]\r\n pos = i - k\r\n if S + sums[i + k] - sums[i] > ans:\r\n ans = S + sums[i + k] - sums[i]\r\n l = pos\r\n r = i\r\nprint(l + 1, r + 1)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nsums = [0]\nfor x in a: sums.append(x + sums[-1]) \nS = l = r = ans = pos = 0\nfor i in range(k, n - k + 1):\n if sums[i] - sums[i - k] > S:\n S = sums[i] - sums[i - k]\n pos = i - k\n if S + sums[i + k] - sums[i] > ans:\n ans = S + sums[i + k] - sums[i]\n l = pos\n r = i\nprint(l + 1, r + 1)\n\t\t\t \t \t \t\t\t\t \t\t \t \t\t \t", "# Init ---------------------------------------------------------\nimport os\nimport sys\nfrom io import BytesIO, IOBase\nfrom random import randint\nimport heapq\n\nRANDOM = randint(1, 10 ** 9)\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nclass IntWrapper(int):\n def __init__(self, x):\n int.__init__(x)\n\n def __hash__(self):\n return super(IntWrapper, self).__hash__() ^ RANDOM\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\ndef LI():\n return list(map(int, input().split()))\ndef I():\n return int(input())\ndef LIW():\n return list(map(IntWrapper, input().split()))\ndef IW():\n return IntWrapper(input())\n# End---------------------------------------------------------\n\nn, k = LI()\nvalues = LI()\n\nsums, curr_sum = [], 0\nfor i in range(n):\n if i >= k:\n curr_sum -= values[i - k]\n\n curr_sum += values[i]\n\n if i >= (k - 1):\n sums.append(curr_sum)\n# cache = {}\n# def f(i, c):\n# if (i >= len(sums)) or (c == 0):\n# return 0\n# if (c, i) not in cache:\n# cache[c, i] = max(f(i + k, c - 1) + sums[i],\n# f(i + 1, c))\n# return cache[c, i]\n# f(0, 2)\n# print(cache)\n\ndp = [[0] * (len(sums) + 1) for _ in range(3)]\nfor c in range(1, 3):\n for i in range(len(sums)-1, -1, -1):\n v = 0\n if i + k <= len(sums):\n v = dp[c-1][i+k]\n\n dp[c][i] = max(dp[c][i+1],\n v + sums[i])\n\nsr, sc = 2, 0\nvals = []\nwhile sr > 0:\n v = 0\n if sc + k <= len(sums):\n v = dp[sr-1][sc+k]\n\n if (dp[sr][sc] - sums[sc]) == v:\n vals.append(sc)\n sr -= 1\n sc += k\n else:\n sc += 1\nprint(vals[0] + 1, vals[1] + 1)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsums = [0]\r\nfor x in a: sums.append(x + sums[-1])\r\nS = l = r = ans = pos = 0\r\nfor i in range(k, n - k + 1):\r\n (prev, cur, nex) = (sums[i - k], sums[i], sums[i + k])\r\n if cur - prev > S:\r\n S = cur - prev\r\n pos = i - k\r\n if S + nex - cur > ans:\r\n ans = S + nex - cur\r\n l = pos\r\n r = i\r\nprint(l + 1, r + 1)", "n,k=map(int,input().split())\r\nitem=[*map(int,input().split())]\r\ns=sum(item[:k])\r\nlst=[s]\r\napp,mx,ind=lst.append,0,0\r\nfor i,x in enumerate(item[k:]):s+=x;s-=item[i];app(s)\r\nresult,a,b=0,0,0\r\nfor i,x in enumerate(lst[k:]):\r\n y=lst[i]\r\n if mx<y:\r\n mx=y\r\n ind=i\r\n res=mx+x\r\n if result<res:\r\n result=res\r\n a,b=ind,i+k\r\nprint(a+1,b+1)", "#!/usr/bin/env python3\nimport io\nimport os\nimport sys\n\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n\ndef printd(*args, **kwargs):\n #print(*args, **kwargs, file=sys.stderr)\n #print(*args, **kwargs)\n pass\n\ndef get_str():\n return input().decode().strip()\n\ndef rint():\n return map(int, input().split())\n\ndef oint():\n return int(input())\n\ndef ksum(si):\n if si == 0:\n return psum[si+k-1]\n else:\n return psum[si+k-1] - psum[si-1]\n\nn, k = rint()\n\na = list(rint())\n\npsum = [a[0]]\nfor i in range(1, n):\n psum.append(a[i]+psum[i-1])\n\nans = [0,0]\nmaxsum = -1\nmaxksum = [-1, -1]\nfor i in range(n-k-k, -1, -1):\n if maxksum[0] <= ksum(i+k):\n maxksum = [ksum(i+k), i+k]\n sum_ = ksum(i) + maxksum[0]\n if sum_ >= maxsum:\n ans = [i, maxksum[1]]\n maxsum = sum_\nprint(ans[0]+1, ans[1]+1)\n", "import bisect\r\nimport collections\r\nimport itertools\r\nimport math\r\nimport os\r\nimport sys\r\n\r\n# input = sys.stdin.buffer.readline\r\n\r\n# t = int(input())\r\n# n, m = map(int, input().split())\r\n# A = list(map(int, input().split()))\r\n# grid = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\ntemp = sum(A[:k])\r\nW = []\r\nfor i in range(k, n):\r\n W.append(temp)\r\n temp += A[i] - A[i-k]\r\nW.append(temp)\r\n# print(W)\r\n\r\nF = list(itertools.accumulate(W, max))\r\n# print(F)\r\n\r\nB = list(itertools.accumulate(W[::-1], max))[::-1]\r\n# print(B)\r\n\r\nmax_a, max_b, max_val = -1, -1, -1\r\nfor i in range(0, n - 2*k + 1):\r\n val = F[i] + B[i+k]\r\n if val > max_val:\r\n max_a, max_b, max_val = i, i + k, val\r\n\r\n# print(max_a, max_b, max_val)\r\n\r\nret_a = -1\r\nfor i in range(max_a + 1):\r\n if W[i] == F[max_a]:\r\n ret_a = i\r\n break\r\n\r\nret_b = -1\r\nfor i in range(max_b, len(W)):\r\n if W[i] == B[max_b]:\r\n ret_b = i\r\n break\r\n\r\nprint(ret_a + 1, ret_b + 1)", "n, k = map(int, input().split())\nx = list(map(int, input().split()))\nsums = [0]\nfor i in range(n):\n sums.append(x[i] + sums[-1])\ns, l, r, t, pos = 0, 0, 0, 0, 0\nfor i in range(k, n - k + 1):\n if sums[i] - sums[i - k] > s:\n s = sums[i] - sums[i - k]\n pos = i - k\n if s + sums[i + k] - sums[i] > t:\n t = s + sums[i + k] - sums[i]\n l = pos + 1\n r = i + 1\nprint(l, r)", "import sys\r\nfin = sys.stdin\r\n\r\nn, k = map(int, fin.readline().split())\r\nc = list(map(int, fin.readline().split()))\r\ns = [0] * (n + 1)\r\nfor i in range(n):\r\n s[i + 1] = s[i] + c[i]\r\n\r\nms = [i for i in range(n)]\r\nfor i in range(n - k - 1, k - 1, -1):\r\n s_last = s[ms[i + 1] + k] - s[ms[i + 1]]\r\n s_curr = s[i + k] - s[i]\r\n if s_curr >= s_last:\r\n ms[i] = i\r\n else:\r\n ms[i] = ms[i + 1]\r\n\r\na, b = 0, k\r\n\r\nfor i in range(n - 2 * k + 1):\r\n j = i + k\r\n sa = s[j] - s[i]\r\n sb = s[ms[j] + k] - s[ms[j]]\r\n if sa + sb > s[a + k] - s[a] + s[b + k] - s[b]:\r\n a, b = i, ms[j]\r\n\r\nprint(a + 1, b + 1)", "def f(x):\r\n return pref[x + k] - pref[x]\r\n\r\n\r\nn, k = map(int, input().split())\r\n(*a,) = map(int, input().split())\r\npref = [0]\r\nfor i in range(1, n + 1):\r\n pref.append(pref[i - 1] + a[i - 1])\r\n\r\n\r\na, ma, mb = 0, 0, k\r\nfor b in range(k, n - k + 1):\r\n if f(a) < f(b - k):\r\n a = b - k\r\n if f(b) + f(a) > f(ma) + f(mb):\r\n ma, mb = a, b\r\nprint(ma + 1, mb + 1)\r\n", "read_line = lambda: list(map(int, input().split(' ')))\nn, k = read_line()\nx = read_line()\nfor i in range(n - 2, -1, -1):\n x[i] += x[i+1]\nfor i in range(n - k):\n x[i] -= x[i+k]\nj = b = n - k\na = b - k\nfor i in range(a - 1, -1, -1):\n if x[i + k] >= x[j]:\n j = i + k\n if x[i] + x[j] >= x[a] + x[b]:\n a, b = i, j\nprint(a + 1, b + 1)\n", "n,k = map(int,input().split())\na = [0]\na = a + list(map(int,input().split()))\ns = [0]*(k)\nfor i in range(1,n+1):\n a[i]=a[i]+a[i-1]\n if i>=k:\n s.append(a[i]-a[i-k])\nmx =0\nss = []\nix=k-1\nfor j in range(2*k,n+1):\n ix = j-k if s[j-k]>s[ix] else ix\n s[j-k] = max(s[j-k],s[j-k-1])\n if mx<s[ix]+s[j]:\n ss = [ix,j]\n mx = s[ix]+s[j]\n#print(mx)\nprint(str(ss[0]-k+1)+\" \"+str(ss[1]-k+1))\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\n\r\nn, k = gil()\r\na = gil()\r\npre = a[:]\r\nfor i in reversed(range(n-1)):\r\n\tpre[i] += pre[i+1]\r\n\r\n\r\nseg = []\r\n\r\ni = 0\r\nwhile i+k-1 < n:\r\n\tseg.append(pre[i] - (pre[i+k] if i+k < n else 0))\r\n\ti += 1\r\n\r\nmaxSeg = [i for i in range(n-k+1)]\r\n# exit()\r\nfor i in reversed(range(n-k)):\r\n\tif seg[i] < seg[maxSeg[i+1]]:\r\n\t\tmaxSeg[i] = maxSeg[i+1]\r\n\r\n# print(seg)\r\n# print(maxSeg)\r\nl, r = 0, k\r\n\r\ni = 0\r\nwhile i+k < n-k+1:\r\n\tif seg[i] + seg[maxSeg[i+k]] > seg[l] + seg[r]:\r\n\t\tl, r = i, maxSeg[i+k]\r\n\ti += 1\r\n\r\nprint(l+1, r+1)", "n,k=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\ntemp=[0]\r\ncurr=0\r\nfor i in arr:\r\n curr+=i\r\n temp.append(curr)\r\ntemp2=[]\r\n#print(temp)\r\nfor i in range(k,n+1):\r\n temp2.append(temp[i]-temp[i-k])\r\n#print(temp2)\r\nans=0\r\nl=len(temp2)\r\nmaxi=[[temp2[0],0]]\r\ncurr=maxi[0][0]\r\nfor i in range(1,l):\r\n if temp2[i]>curr:\r\n maxi.append([temp2[i],i])\r\n curr=temp2[i]\r\n else:\r\n maxi.append([maxi[-1][0],maxi[-1][1]])\r\n#print(temp2)\r\n#print(maxi)\r\n#print(maxi)\r\nfor i in range(k,l):\r\n if temp2[i]+maxi[i-k][0]>ans:\r\n a=maxi[i-k][1]+1\r\n b=i+1\r\n ans=temp2[i]+maxi[i-k][0]\r\nprint(a,b)\r\n#print(ans)", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ns=[sum(x[0:k])]\r\nm=[0]\r\nsm=[s[-1]]\r\nfor i in range(1,n-k+1):\r\n s.append(s[-1]+x[i+k-1]-x[i-1])\r\n if s[-1]>sm[-1]:\r\n m.append(i)\r\n sm.append(s[-1])\r\n else:\r\n m.append(m[-1])\r\n sm.append(sm[-1])\r\na,b=0,k\r\nsms=sm[0]+s[k]\r\nfor i in range(k+1,n-k+1):\r\n if sm[i-k]+s[i]>sms:\r\n sms=sm[i-k]+s[i]\r\n a=m[i-k]\r\n b=i\r\nprint(a+1,b+1)", "n, k = map(int, input().strip().split())\r\narr = list(map(int, input().strip().split()))\r\n\r\nsumi = [sum(arr[:k])]\r\nfor i in range(k, n):\r\n sumi.append(sumi[-1]-arr[i-k]+arr[i])\r\n\r\nmaxis = [(0, 0) for i in range(len(sumi))]\r\nmaxi = 0\r\nfor i in range(len(sumi)-1, -1, -1):\r\n if sumi[i] >= maxi:\r\n maxi = sumi[i]\r\n maxis[i] = (maxi, i)\r\n else:\r\n maxis[i] = maxis[i+1]\r\n \r\n\r\nans = (0, ())\r\nfor i in range(len(sumi)-k):\r\n if ans[0] < sumi[i]+maxis[i+k][0]:\r\n ans = (sumi[i]+maxis[i+k][0], (i+1, maxis[i+k][1]+1))\r\nprint(*ans[1])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=[int(i) for i in input().split()]\nl=[int(i) for i in input().split()]\nabsurdity=[]\nksum=0\nfor i in range(k):\n ksum+=l[i]\nabsurdity.append(ksum)\npointer=0\nfor i in range(k, n):\n ksum=ksum-l[pointer]+l[i]\n absurdity.append(ksum)\n pointer+=1\nx=len(absurdity)\nstore=[[0,-1] for i in range(x)]\nstore[x-1]=[absurdity[x-1],n-k+1]\nfor i in range(x-2,-1,-1):\n if(absurdity[i]>=store[i+1][0]):\n store[i]=[absurdity[i],n-k+1-(x-1-i)]\n else:\n store[i]=store[i+1]\nans=[0,0]\nfor i in range(0,x-k):\n if(ans[0]<absurdity[i]+store[i+k][0]):\n ans=[absurdity[i]+store[i+k][0],store[i+k][1]]\na1=-1\na2=-1\nfor i in range(0,x-k):\n if(ans[0]==absurdity[i]+store[i+k][0]):\n a1=i+1\n a2=ans[1]\n break\nprint(a1,a2)", "n,k=map(int,input().split())\na=list(map(int,input().split()))\n\ndp=[0]\nfor i in range(n):\n\tdp+=[dp[i]+int(a[i])]\n\nans1=0\nans2=0\nb=0\npb=0\nz=0\nfor i in range(n-2*k+1,0,-1):\n\tcurb=dp[i+2*k-1]-dp[i+k-1]\n\tif curb>=b:\n\t\tb=curb\n\t\tpb=i+k\n\tcura=dp[i+k-1]-dp[i-1]\n\tif cura+b>=z:\n\t\tz=cura+b\n\t\tans1=i\n\t\tans2=pb\n\nprint(ans1,ans2)\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsubsums=[0]*(n-k+1)\r\ncurr=0\r\nfor i in range(k):\r\n curr+=l[i]\r\nsubsums[0]=curr\r\nfor i in range(n-k):\r\n subsums[i+1]=subsums[i]+l[i+k]-l[i]\r\nmaxsofar=[subsums[0]]\r\nfor i in range(n-k):\r\n maxsofar.append(max(maxsofar[-1],subsums[i+1]))\r\nmx=0\r\nb=-1\r\na=-1\r\nfor i in range(k,n-k+1):\r\n if(subsums[i]+maxsofar[i-k]>mx):\r\n mx=subsums[i]+maxsofar[i-k]\r\n b=i\r\nfor i in range(n-k):\r\n if(maxsofar[i]==maxsofar[b-k]):\r\n a=i\r\n break\r\nprint(a+1,b+1)", "def main():\n from itertools import accumulate\n n, k = map(int, input().split())\n l = [0]\n l.extend(accumulate(map(int, input().split())))\n ma = mab = 0\n for i, x, y, z in zip(range(1, n), l, l[k:], l[k * 2:]):\n if ma < y - x:\n t, ma = i, y - x\n if mab < ma + z - y:\n a, b, mab = t, i, ma + z - y\n print(a, b + k)\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\n\nx = list(map(int, input().split()))\n\nsu = sum(x[:k])\ns = [su]\n\nfor i in range(1,n-k+1):\n su -= x[i-1]\n su += x[i+k-1]\n s.append(su)\n\nM = (0,0,0)\nm = (0,0)\n\nfor i in range(n-2*k, -1,-1):\n m = max(m, (s[i+k], -(i+k)))\n M = max(M, (s[i] + m[0], -i, m[1]))\n\nprint(-M[1] + 1, -M[2] +1)", "# find two not overlapping subarrays of size k with a maximum score and print their starting points\n# Need to transform this array such that at each index we have a score for a subarray starting at this index\n# then we can use something like a monotonic deque idea to find best pairs, actually the second part is tsill a bit foggy\n# just create a suffix array with a maximum element so far, from there we ar golden\n# isnt this is just prefix suffix problem?\n# mostly just suffix\n# there gotta be a better way to implement this than what I am doing, since in my approach I also need to keep track of the indecies of for max_suf, which is not a hard part\n# but if I see the same i I should not update it\n# also, my max_suf is supposed to be the maximum value of subarray starting at this point rather than what I am doing\n# so I will just do that, 3 passes, 1 pass, get subbarays, 2 pass get max, 3 pass get our result\nn, k = map(int, input().split())\nnums = list(map(int, input().split()))\nsub_suf = [0] * n\nmax_suf = [0] * n \n#sub_suf[-1] = nums[-1]\n\ntotal = sum(nums[:k])\nsub_suf[0] = total\n\n# check\nfor l in range(0, n-k):\n r = l + k\n total += nums[r]\n total -= nums[l]\n sub_suf[l+1] = total \n \nmax_suf[-1] = (sub_suf[-1], n-1)\n\nfor i in range(n-2, -1, -1):\n if sub_suf[i] >= max_suf[i+1][0]:\n max_suf[i] = (sub_suf[i], i)\n else:\n max_suf[i] = max_suf[i+1]\n\ntotal = 0\nl, r = 0, 0\nfor i in range(n-k):\n a = max_suf[i+k][0] + sub_suf[i]\n if a > total:\n total = a \n l, r = i+1, max_suf[i+k][1]+1\nprint(l, r)\n\n\n\n\n", "import sys\r\nimport os.path\r\n \r\nif(os.path.exists('input.txt')) :\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000000\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n \r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n \r\nfrom math import inf, ceil, sqrt, log2, gcd\r\nfrom collections import defaultdict, deque\r\n \r\ndd = lambda x: defaultdict(lambda: x)\r\ndxy = [(1, 0),(-1, 0),(0, 1),(0, -1)]\r\n\r\n(n, k), a = minp(), linp()\r\nd, c = [sum(a[:k])], sum(a[:k])\r\nfor i in range(k, n) :\r\n c = c - a[i-k] + a[i]\r\n d.append(c)\r\nb = [e for e in d]\r\nfor i in range(n-k-1, -1, -1) :\r\n b[i] = max(b[i], b[i+1])\r\nans, l = 0, -1\r\nfor i in range(n-2*k+1) :\r\n val = d[i]+b[i+k]\r\n if ans < val : ans, l = val, i+1\r\nval = ans-d[l-1]\r\nfor i in range(l+k-1, n-k+1) :\r\n if val == d[i] :\r\n r = i+1\r\n break\r\nprint(l, r)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nt = [0] * (n+1)\r\nfor i in range(n):\r\n t[i+1] = t[i] + arr[i]\r\nd, sz = [0] * n, [0] * n\r\nbest_length, best_idx, m = 0, k, 0\r\nfor i in range(k, n-k+1):\r\n if t[i] - t[i-k] > d[i-1]:\r\n d[i] = t[i] - t[i-k]\r\n sz[i] = i - k\r\n else:\r\n d[i] = d[i-1]\r\n sz[i] = sz[i-1]\r\n if d[i] + t[i+k] - t[i] > m:\r\n m = d[i]+t[i+k]-t[i]\r\n best_length = sz[i]\r\n best_idx = i\r\nprint(best_length+1, best_idx+1)\r\n", "n, m = map(int, input().split())\r\nx = [0]+list(map(int,input().split()))\r\ndp = [float('-inf')] * (n+1)\r\nindex = [0] * (n+1)\r\nanswer = [0, 0, 0]\r\n\r\nfor i in range(1, n+1):\r\n x[i] += x[i-1]\r\n\r\nfor i in range(m, n+1):\r\n if x[i] - x[i-m] > dp[i-1]:\r\n dp[i] = x[i] - x[i-m]\r\n index[i] = i-m+1\r\n else:\r\n dp[i] = dp[i-1]\r\n index[i] = index[i-1]\r\n\r\nfor i in range(n, 0, -1):\r\n if i+m-1 <= n:\r\n answer = max(answer, [x[i+m-1] - x[i-1] + dp[i-1], -index[i-1], -i])\r\n\r\nprint(-answer[1], -answer[2])", "n,k = map(int,input().split())\r\nxi = list(map(int,input().split()))\r\nar = [0] * n\r\nfor i in range(k):\r\n ar[0] += xi[i]\r\n\r\nfor i in range(k,n):\r\n ar[i-k+1] = ar[i-k] + xi[i] - xi[i-k]\r\n\r\nar2 = [[0]*2 for i in range(n)]\r\n\r\nfor i in range(n):\r\n ar2[i][0] = ar2[i-1][0]\r\n ar2[i][1] = ar2[i-1][1]\r\n if ar2[i][0] < ar[i]:\r\n ar2[i][0] = ar[i]\r\n ar2[i][1] = i\r\n\r\na = 1\r\nb = k+1\r\nans = 0\r\nfor i in range(k,n):\r\n if ans < ar2[i-k][0] + ar[i]:\r\n ans = ar2[i-k][0] + ar[i]\r\n a = ar2[i-k][1] + 1\r\n b = i + 1\r\nprint(a,b)\r\n", "\"\"\"\nModule which implements the search of the maximum absurdity we can reach.\n\"\"\"\ndef max_absurdity(prefix_sums: dict, array: list, n: int, k: int):\n \"\"\"\n Return the pai from which we can reach maximum absuridty.\n \"\"\"\n memo = [0 for _ in range(n)]\n pairs = [(0, 0) for _ in range(n)]\n memo[n-2*k] = prefix_sums[n-1] - prefix_sums[n-2*k-1]\n pairs[n-2*k] = (n-2*k, n-k)\n for i in range(n-2*k-1, -1, -1):\n prev_b = pairs[i+1][1]\n memo[i] = prefix_sums[i+k-1] - prefix_sums[i-1]\n if (prefix_sums[prev_b+k-1] - prefix_sums[prev_b-1] > prefix_sums[i+2*k-1] - prefix_sums[i+k-1]):\n memo[i] += prefix_sums[prev_b+k-1] - prefix_sums[prev_b-1]\n pairs[i] = (i, prev_b)\n else:\n memo[i] += prefix_sums[i+2*k-1] - prefix_sums[i+k-1]\n pairs[i] = (i, i+k)\n max_val = 0\n ans = [0, 0]\n for i in range(n):\n if memo[i] > max_val:\n max_val = memo[i]\n ans[0] = pairs[i][0] + 1\n ans[1] = pairs[i][1] + 1\n return ans\n\nif __name__ == \"__main__\":\n settings = [int(x) for x in input().split(\" \")]\n array = [int(x) for x in input().split(\" \")]\n prefix_sums = {-1: 0}\n total = 0\n for i in range(settings[0]):\n total += array[i]\n prefix_sums[i] = total\n res = max_absurdity(prefix_sums, array, settings[0], settings[1])\n for elem in res:\n print(elem, end=\" \")\n\t \t\t\t \t\t\t\t\t\t \t\t \t", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[0]\r\nfor i in range(k):\r\n b[0]=b[0]+a[i]\r\nfor i in range(k,n):\r\n b.append(b[-1]-a[i-k]+a[i])\r\ndp1=[-1 for i in range(n)]\r\ndp1[n-k]=b[-1]\r\nfor i in range(n-k-1,-1,-1):\r\n dp1[i]=max(dp1[i+1],b[i])\r\n \r\n# dp2=[-1 for i in range(n)]\r\n# dp2[0]=b[0]\r\n# for i in range(1,n-k+1):\r\n# dp2[i]=max(dp2[i-1],b[i])\r\nans=[-1,-1,-1]\r\nfor i in range(n-2*k+1):\r\n temp=b[i]+dp1[i+k]\r\n if ans[0]<temp:\r\n ans[0]=temp\r\n ans[1]=i+1\r\n\r\nfor i in range(ans[1]+k-1,n-k+1):\r\n if b[i]==dp1[i]:\r\n ans[2]=i+1\r\n break\r\n \r\nprint(ans[1],ans[2])", "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,m=M()\r\nl=L()\r\nx=sum(l[:m])\r\ny=[(x,1)]\r\nfor i in range(m,n):\r\n x+=l[i]\r\n x-=l[i-m]\r\n y.append((x,i-m+2))\r\np=[y[0]]\r\nfor i in range(1,len(y)):\r\n if(p[-1][0]<y[i][0]):\r\n p.append(y[i])\r\n else:\r\n p.append(p[-1])\r\n\r\nt=sum(l[m:2*m])\r\n#print(t)\r\nans=p[0][0]+t\r\nk1=1\r\nk2=m+1\r\nb=m+1\r\nfor i in range(n-2*m):\r\n t+=l[i+2*m]\r\n t-=l[i+m]\r\n b+=1\r\n if(t+p[i+1][0]>ans):\r\n k1=p[i+1][1]\r\n k2=b\r\n ans=t+p[i+1][0]\r\n #sum(l[i+m:i+2*m])\r\nprint(k1,k2)\r\n", "n,k= map(int,input().split())\narr= list(map(int,input().split()))\nans = [0]*n\nwindow = sum(arr[0:k])\n# print window\nans[0]=window\nfor i in range(1,n-k+1):\n window-=arr[i-1]\n window+= arr[i+k-1]\n ans[i]=window\n\n\nM =(0,0,0)\no = (0,0)\nfor i in range(n-2*k,-1,-1):\n o = max(o,(ans[i+k],n-i-k))\n M=max(M,(ans[i]+o[0],n-i,o[1]))\nprint (n-M[1]+1,n-M[2]+1)\n", "n,k=map(int,input().split())\r\nl=[*map(int,input().split())]\r\nq=sum(l[:k])\r\nw=[q]\r\nzz={}\r\nfor i in range(k,n):\r\n q+=l[i]-l[i-k]\r\n w+=[q]\r\no=len(w)\r\nr=[0for i in range(o)]\r\nr[-1]=w[-1]\r\nfor i in range(o-2,-1,-1):r[i]=max(w[i],r[i+1])\r\nfor i in range(o-k):zz[w[i]+r[i+k]]=(w[i],r[i+k])\r\ng,*h=zz[max(zz)]\r\ng=w.index(g)\r\nh=w.index(h[0],g+k)\r\nprint(g+1,h+1)" ]

[ "import sys\r\nfrom array import array # noqa: F401\r\nfrom operator import itemgetter\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\na = [(x, y) if x < y else (y, x) for _ in range(n) for x, y in (map(int, input().split()),)]\r\na.sort(key=itemgetter(1))\r\nnailed = -10**9\r\nans = []\r\n\r\nfor l, r in a:\r\n if l <= nailed <= r:\r\n continue\r\n nailed = r\r\n ans.append(r)\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "intervals = []\r\nn = int(input())\r\nfor x in range(n):\r\n a,b = [int(x) for x in input().split()]\r\n if a > b:\r\n intervals.append([b,a])\r\n else:\r\n intervals.append([a,b])\r\nintervals.sort()\r\nst = intervals[0][0]\r\ned = intervals[0][1]\r\nans = []\r\nfor x in range(1, n):\r\n if intervals[x][0] <= ed:\r\n st = intervals[x][0]\r\n ed = min(intervals[x][1], ed)\r\n elif intervals[x][0] > ed:\r\n ans.append(st)\r\n st = intervals[x][0]\r\n ed = intervals[x][1]\r\nans.append(st)\r\nprint(len(ans))\r\nprint(*ans)", "from sys import stdin\n\n\nN = int(input())\nresult = []\nsegs = []\nfor _ in range(N):\n segs.append(sorted(map(int, stdin.readline().split())))\n\nsegs.sort(key=lambda x:x[1])\nfor a, b in segs:\n if not result or a > result[-1]:\n result.append(b)\nprint(len(result))\nprint(*result)\n\n\n", "n = int(input())\nsegments = []\n\nfor _ in range(n):\n l, r = sorted(map(int, input().split()))\n segments.append([l, r])\n \nsegments.sort(key = lambda s: s[1])\n\npinz = []\n\nfor l, r in segments:\n if len(pinz) == 0 or l > pinz[-1]:\n pinz.append(r)\n\nprint(len(pinz))\nprint(*pinz)\n\t\t \t\t \t\t\t \t\t \t\t\t\t\t\t\t \t\t\t\t\t", "\r\nn = int(input())\r\n\r\nintervals = []\r\nfor i in range(n):\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n if a > b:\r\n a, b = b, a\r\n intervals.append((a, b))\r\nintervals.sort(key=lambda x: x[1])\r\n\r\nprev = intervals[0][1]\r\nresults = []\r\nresults.append(prev)\r\nfor i in range(1, n):\r\n if prev < intervals[i][0]:\r\n prev = intervals[i][1]\r\n results.append(prev)\r\n\r\nprint(len(results))\r\nfor x in results:\r\n print(x, end=\" \")", "def main():\r\n n = int(input())\r\n segments = []\r\n for _ in range(n):\r\n segments.append(tuple(sorted(map(int, input().split()))))\r\n\r\n nails = []\r\n segments.sort(key=lambda x: x[1])\r\n while segments:\r\n nail = segments[0][1]\r\n nails.append(nail)\r\n segments = [segment for segment in segments if segment[0] > nail]\r\n\r\n print(len(nails))\r\n print(' '.join(map(str, nails)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\n\r\nn = int(R())\r\nt = []\r\nx = [0]*n\r\nfor i in range(n):\r\n u,v = sorted(S())\r\n t += (u,0,i),\r\n t += (v,1,i),\r\nt.sort()\r\nr = []\r\ns = []\r\nfor a,b,c in t:\r\n if not b: s += c,\r\n elif not x[c]:\r\n r += a,\r\n for v in s: x[v] = 1\r\n s = []\r\nprint(len(r))\r\nprint(*r)", "n = int(input())\nsegments = []\nfor _ in range(n):\n l, r = sorted(map(int, input().split()))\n segments.append([l, r])\n\nsegments.sort(key = lambda s: s[1])\nmust_pined = False\npins = []\nfor l, r in segments:\n if len(pins) == 0 or l > pins[-1]:\n pins.append(r)\n\nprint(len(pins))\nprint(*pins)\n \t\t \t \t\t \t \t\t\t\t\t \t\t\t \t \t", "n=int(input())\r\nc=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x>y: x,y=y,x\r\n c.append([x,0,i])\r\n c.append([y,1,i])\r\nc.sort()\r\nans=0\r\nstack=[]\r\nb=[]\r\nfor z in c:\r\n if z[1]==0:\r\n stack.append(z[2])\r\n else:\r\n if z[2] in stack:\r\n ans+=1\r\n b.append(z[0])\r\n stack=[]\r\nprint(ans)\r\nprint(*b)\r\n \r\n", "n = int(input())\nlist = []\n\nfor i in range(n): \n a, b = input().split()\n mini = min(int(a), int(b))\n maxi = max(int(a), int(b))\n list.append([mini, maxi]) # 1 means start \n \nlist.sort()\n#print(list)\ncounter = 0 \nnum = 1\ncut = []\nfor i in list: \n if counter == 0: \n start = i[0]\n end = i[1]\n counter = 1\n \n if i[0]> start: \n start = i[0]\n if i[1]< end: \n end = i[1]\n if end< start: \n num += 1 \n cut.append(end)\n start = i[0]\n end = i[1]\n #print(start, end, num)\ncut.append(end)\nprint(num)\nprint(*cut)", "n = int(input())\r\nallIntervals = []\r\n\r\nfor i in range(n):\r\n index = 0\r\n x, y = [int(i) for i in input().split()]\r\n if x > y:\r\n x, y = y, x\r\n\r\n allIntervals.append([x,y])\r\n\r\nallIntervals = sorted(allIntervals, key=lambda x:x[0])\r\n\r\ncount = 0\r\nallM = []\r\nwhile len(allIntervals) > 0:\r\n firstInterval = allIntervals[0]\r\n countDict = {}\r\n for i in range(firstInterval[0], firstInterval[1] + 1):\r\n currentInterval = 0\r\n countInterval = 0\r\n while allIntervals[currentInterval][0] <= i <= allIntervals[currentInterval][1]:\r\n countInterval += 1\r\n currentInterval += 1\r\n if currentInterval == len(allIntervals):\r\n break\r\n if countInterval in countDict.keys():\r\n countDict[countInterval].append(i)\r\n else:\r\n countDict[countInterval] = [i]\r\n currentMax = max(countDict.keys())\r\n bestPoint = countDict[currentMax][0]\r\n removeIntervals = []\r\n for interval in allIntervals:\r\n if interval[0] <= bestPoint <= interval[1]:\r\n removeIntervals.append(interval)\r\n\r\n for remove1 in removeIntervals:\r\n allIntervals.remove(remove1)\r\n\r\n count += 1\r\n allM.append(bestPoint)\r\n\r\nprint(count)\r\nprint(*allM)", "n = int(input())\r\nl = []\r\nfor i in range(n) :\r\n\ta, b = map(int, input().split())\r\n\ta, b = min(a, b), max(a, b)\r\n\tl.append((a, 0, i))\r\n\tl.append((b, 1, i))\r\nl.sort()\r\nans = []\r\ncur = set()\r\na = [0] * n\r\nfor x in l :\r\n\tif x[1] == 0:\r\n\t\tcur.add(x[2])\r\n\telif a[x[2]] == 0 :\r\n\t\tans.append(x[0])\r\n\t\tfor e in cur :\r\n\t\t\ta[e] = 1\r\n\t\tcur.clear()\r\nprint(len(ans))\r\nprint(*ans)\r\n", "array = []\r\nn = int(input())\r\nfor x in range(n):\r\n e1, e2 = map(int, input().split())\r\n less = min(e1, e2)\r\n great = max(e1, e2)\r\n array.append([less, great])\r\narray.sort()\r\npoints = [array[0][1]]\r\nrange = array[0]\r\nfor i in array:\r\n if i[0] <= points[-1] and i[1] >= points[-1]:\r\n continue\r\n elif i[1] <= range[1]:\r\n points.pop()\r\n points.append(i[1])\r\n range = i\r\n else:\r\n points.append(i[1])\r\n range = i\r\nprint(len(points))\r\n# print(array)\r\nprint(*points)", "n = int(input())\r\nlis = list()\r\ncou = 1\r\narr = list()\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > b:\r\n lis.append([b, a])\r\n else:\r\n lis.append([a, b])\r\nlis = sorted(lis, key=lambda l: l[1])\r\ni = 0\r\nj = 1\r\narr.append(lis[i][1])\r\nwhile(i < n and j < n):\r\n if lis[i][1] < lis[j][0]:\r\n cou += 1\r\n i = j\r\n arr.append(lis[i][1])\r\n else:\r\n j += 1\r\n\r\nprint(cou)\r\nprint(*arr)\r\n", "n = int(input())\r\nsegments = []\r\nfor _ in range(n):\r\n segments.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n if segments[i][0] > segments[i][1]:\r\n segments[i][0], segments[i][1] = segments[i][1], segments[i][0]\r\nsegments.sort(key=lambda x: (x[0], -x[1]))\r\n\r\nstarted = False\r\ni = 0\r\nnails = []\r\nstack = []\r\nwhile i < n:\r\n stack.append(segments[i])\r\n i += 1\r\n edge = stack[-1][1]\r\n while i < n and segments[i][0] <= edge:\r\n stack.append(segments[i])\r\n i += 1\r\n edge = min(edge, stack[-1][1])\r\n nails.append(edge)\r\n stack = []\r\n\r\nprint(len(nails))\r\nprint(*nails)\r\n", "n = int(input())\r\nlis=list()\r\ncou=1\r\narr=list()\r\nfor i in range(n):\r\n a , b = map(int,input().split())\r\n if a>b:\r\n lis.append([b,a])\r\n else:\r\n lis.append([a,b])\r\nlis=sorted(lis,key=lambda l:l[1])\r\n#print(lis)\r\ni=0\r\nj=1\r\narr.append(lis[i][1])\r\nwhile(i<n and j<n):\r\n if lis[i][1]<lis[j][0]:\r\n cou+=1\r\n i=j\r\n arr.append(lis[i][1])\r\n# print(lis[i][1])\r\n else:\r\n j+=1\r\n \r\nprint(cou) \r\nprint(*arr)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n s=input()\r\n a.append([int(x) for x in s.split()])\r\n if a[i][0]>a[i][1]:\r\n x=a[i][0]\r\n a[i][0]=a[i][1]\r\n a[i][1]=x\r\n\r\na.sort(key=lambda x:x[1])\r\n\r\ns=[a[0][1]]\r\ni=0\r\nfor x in a[1:]:\r\n\r\n if s[i]>x[1] or s[i]<x[0]:\r\n s.append(x[1])\r\n i+=1\r\nprint(len(s),\" \".join([str(x) for x in s]),sep=\"\\n\")\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = defaultdict(lambda : [])\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n if l > r:\r\n l, r = r, l\r\n x[r].append(l)\r\nans = []\r\nu = -10005\r\nfor r in sorted(x.keys()):\r\n for l in x[r]:\r\n if u < l:\r\n u = r\r\n ans.append(r)\r\nc = len(ans)\r\nprint(c)\r\nprint(*ans)", "if __name__ == '__main__':\r\n number = int(input())\r\n segments = []\r\n i = 0\r\n # while i < number:\r\n for i in range(0, number):\r\n pos = input().split()\r\n if int(pos[0]) < int(pos[1]):\r\n a = int(pos[0])\r\n b = int(pos[1])\r\n else:\r\n b = int(pos[0])\r\n a = int(pos[1])\r\n segments.append((a, b))\r\n segments.sort()\r\n final = []\r\n ok = -9999999\r\n nr = len(segments)\r\n for i in range(nr):\r\n a = segments[i][0]\r\n b = segments[i][1]\r\n if a <= ok and b >= ok:\r\n continue\r\n verif = 0\r\n for j in segments[i + 1:]:\r\n a = segments[i][1]\r\n b = segments[i][1]\r\n if a >= j[0] and b >= j[1]:\r\n verif = 1\r\n if verif:\r\n continue\r\n else:\r\n ok = segments[i][1]\r\n final.append(ok)\r\n print(len(final))\r\n\r\n space = ''\r\n for i in final:\r\n space = space + str(i) + ' '\r\n print(space)\r\n\r\n" ]

[ "import sys,os,io\r\nfrom sys import stdin\r\nfrom bisect import bisect_left , bisect_right\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\nn = ii();l = []\r\nfor i in range(n):\r\n l.append(tuple(li()))\r\nl.sort();DP = [0]*(n)\r\nfor i in range(n):\r\n x = bisect_left(l,(l[i][0]-l[i][1],0))\r\n if x==0:\r\n DP[i]=1\r\n else:\r\n DP[i]=DP[x-1]+1\r\nprint(n-max(DP))\r\n \r\n", "from collections import defaultdict\r\n\r\nn=int(input())\r\n\r\npos=defaultdict(lambda:False)\r\npw=defaultdict(lambda:0)\r\ndp=defaultdict(lambda:0)\r\nans=0;\r\nmaxdist=0\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n pos[a]=True;\r\n pw[a]=b;\r\n maxdist=max(maxdist,a);\r\n\r\nfor x in range(maxdist+1):\r\n if(pos[x]):\r\n dp[x]=1+dp[x-pw[x]-1]\r\n else:\r\n dp[x]=dp[x-1]\r\n\r\nans=0\r\nfor x in range(maxdist+1):\r\n ans=max(ans,dp[x])\r\n#print(pos)\r\n#print(pw)\r\n#print(dp)\r\nans=n-ans\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", "import math\nimport itertools\nfrom bisect import bisect\n\nn = int(input())\nlamps = []\nfor i in range(n):\n a, b = [int(x) for x in input().split()]\n lamps.append((a, b))\nlamps.sort()\nsaved_lamps = []\nfor lamp in lamps:\n i = bisect(lamps, (lamp[0]-lamp[1], 0))\n if i == len(lamps) or i == 0:\n saved_lamps.append(1)\n else:\n saved_lamps.append(saved_lamps[i-1] + 1)\nprint(n - max(saved_lamps))\n \n\n \n", "from operator import itemgetter\r\nn = int(input())\r\nabi = [[-10**9,0]] + [list(map(int,input().split())) for i in range(n)]\r\nabi.sort(key = itemgetter(0))\r\nar = [0] * (n+1)\r\nar[0] = 0\r\ndef check(pos,num):\r\n #print(pos,num)\r\n if abi[pos][0] < num:\r\n return True\r\n else:\r\n return False\r\ndef binsearch(num):\r\n high = n+1\r\n low = 0\r\n mid = (high + low) // 2\r\n while high >= low:\r\n if check(mid,num):\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n mid = (high + low) // 2\r\n return mid\r\nans = n\r\nfor i in range(1,n+1):\r\n num = binsearch(abi[i][0] - abi[i][1])\r\n ar[i] = i - num - 1+ ar[num]\r\n ans = min(ans, ar[i] + n - i)\r\nprint(ans)\r\n", "from sys import stdin, stdout\r\n\r\n\r\ndef ChainReaction(n, b):\r\n survivors = 0\r\n dp = [0] * 1000001\r\n dp[0] = 0 if b[0] == 0 else 1\r\n for i in range(1000001):\r\n if b[i] == 0:\r\n dp[i] = dp[i - 1]\r\n elif b[i] >= i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i - b[i] - 1] + 1\r\n\r\n if dp[i] > survivors:\r\n survivors = dp[i]\r\n\r\n return n - survivors\r\n\r\n\r\ndef main():\r\n n = int(stdin.readline().strip())\r\n arr = [0] * 1000001\r\n for i in range(n):\r\n a = [int(x) for x in stdin.readline().split()]\r\n arr[a[0]] = a[1]\r\n print(ChainReaction(n, arr))\r\n\r\n\r\n# call the main method\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ndp,li,mx=[0]*1000010,[0]*1000010,0\r\nfor _ in range(n):a,b = map(int,input().split());li[a]=b;\r\nfor i in range(1000010):\r\n\tif li[i]:dp[i]=dp[i-li[i]-1]+1\r\n\telse:dp[i]=dp[i-1]\r\n\tmx = max(mx,dp[i])\r\nprint(n-mx)\t\r\n", "n = int(input())\r\nlista = []\r\nfor i in range(n):\r\n lista.append([int(x) for x in input().split()])\r\nlista.sort()\r\n\r\ndiccionario = dict()\r\nnada = True\r\nlast = 0\r\nmaximo = 0\r\nfor x, i in lista:\r\n if nada == True:\r\n for c in range(0, x):\r\n diccionario[c] = 0\r\n diccionario[x] = 1\r\n maximo = 1\r\n nada = False\r\n last = x\r\n else:\r\n for w in range(last, x):\r\n diccionario[w] = diccionario[last]\r\n if i >= x:\r\n diccionario[x] = 1\r\n else:\r\n aux = diccionario[x - i - 1] + 1\r\n if aux > maximo:\r\n maximo = aux\r\n diccionario[x] = aux\r\n last = x\r\nprint(n - maximo)\r\n", "from math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random,threading\r\nfrom functools import lru_cache\r\nfrom itertools import *\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\ndef inpu(): return int(inp())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef stringlis(): return list(map(str, inp().split()))\r\ndef sep(): return map(int, inp().split())\r\ndef strsep(): return map(str, inp().split())\r\ndef fsep(): return map(float, inp().split())\r\nM,M1=1000000007,998244353\r\ndef main():\r\n how_much_noob_I_am=1\r\n #how_much_noob_I_am=inpu()\r\n for _ in range(1,how_much_noob_I_am+1):\r\n n=inpu()\r\n b=[0]*(10**6+2)\r\n for i in range(n):\r\n a,c=sep()\r\n b[a] = c\r\n dp=[0]*(10**6+2)\r\n for i in range(10**6+1):\r\n if b[i]==0:\r\n dp[i] = dp[i-1]\r\n else:\r\n if b[i]>=i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i-b[i]-1]+1\r\n print(n-max(dp))\r\nif __name__ == '__main__':\r\n main()\r\n", "inp = int(input())\ntemp_max = 0\ntlen = 1000001\nmemo = [0]*tlen\ntlis = [0]*tlen\nfor i in range(inp):\n p1, p2 = map(int, input().split())\n tlis[p1] = p2\nfor i in range(tlen):\n memo[i] = memo[i - tlis[i] - 1] + 1 if (tlis[i] != 0) else memo[i - 1]\n temp_max = max(temp_max, memo[i])\nprint(inp - temp_max)", "n=int(input())\r\nl=[0 for _ in range(1000010)]\r\ndp=[0 for _ in range(1000010)]\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n l[a]=b\r\n\r\nif l[0]>0:\r\n dp[0]=1\r\nmx=0\r\nfor i in range(1,1000010):\r\n if (l[i] == 0) :\r\n dp[i] = dp[i - 1]\r\n else:\r\n if (l[i] >= i):\r\n dp[i] = 1;\r\n \r\n else:\r\n dp[i] = dp[i - l[i] - 1] + 1;\r\n \r\n \r\n if (dp[i] > mx):\r\n mx = dp[i]\r\n \r\nprint(n-mx)", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\nn = int(input())\r\nw = sorted([tuple(map(int, input().split())) for i in range(n)])\r\nd = [i[0] for i in w]\r\nx = [0]*(n+1)\r\nfor i in range(n-1, -1, -1):\r\n a, b = w[i]\r\n q1 = bisect(d, a-b)\r\n if d[q1-1] == a-b:\r\n q1 = max(0, q1-1)\r\n x[q1] = max(x[q1], x[i+1]+1)\r\nprint(n-max(x))", "n = int(input())\narr = [-1]*1000001\ndp = [-1]*1000001\n\nfor i in range(n):\n a , b = list(map(int,input().split()))\n arr[a] = b\nfor i in range(1000001):\n if arr[i] < 0:\n dp[i] = dp[i-1] if i > 0 else 0\n continue\n x = i - arr[i] - 1 \n dp[i] = (dp[x]+1) if x >= 0 else 1\n\nprint(n-max(dp))\n", "from bisect import bisect_left\r\n\r\n\r\nn=int(input())\r\nans=[]\r\nz=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n ans.append((a,b))\r\n z.append(a)\r\nz.sort()\r\nans.sort()\r\ndp=[0]*n\r\nfor i in range(n):\r\n if i==0:\r\n dp[0]=0\r\n else :\r\n ind=max(ans[i][0]-ans[i][1],0)\r\n p=bisect_left(z,ind)\r\n if z[p]>=ind:\r\n p-=1\r\n if p<0:\r\n dp[i]=i\r\n else :\r\n dp[i]=i-p-1+dp[p]\r\nres=float(\"inf\")\r\nfor i in range(n-1,-1,-1):\r\n res=min(res,dp[i]+n-1-i)\r\nprint(res)\r\n ", " \r\nN_MAX = 1000001\r\nN = int(input())\r\nbeacons = [0 for x in range(N_MAX)]\r\ndp = [0 for x in range(N_MAX)]\r\nfor x in range(N):\r\n a, b = map(int, input().split())\r\n beacons[a] = b\r\ndp[0] = beacons[0] != 0 # num beacons activated if beacon i is activated\r\nfor y in range(1,N_MAX):\r\n if beacons[y] == 0:\r\n dp[y] = dp[y - 1]\r\n else:\r\n if beacons[y] >= y:\r\n dp[y] = 1\r\n else:\r\n dp[y] = dp[y - beacons[y] - 1] + 1\r\nprint(N - max(dp))", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint\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\ndef fun(i, a):\r\n l, h = 0, i - 1\r\n ans = -1\r\n while l <= h:\r\n m = (l + h) // 2\r\n if a[m][0] >= a[i][0] - a[i][1]:\r\n ans, h = m, m - 1\r\n else:\r\n l = m + 1\r\n if ans == -1:\r\n return 0\r\n return i - ans\r\n\r\n\r\nn = int(input())\r\na = matrix(n, 2)\r\nfor i in range(n):\r\n a[i][0], a[i][1] = map(int, input().split())\r\na.sort()\r\ndp = matrix(n, 2)\r\ndp[0][1] = 1\r\nfor i in range(1, n):\r\n cnt = fun(i, a)\r\n dp[i][0] = max(dp[i - 1][0], dp[i - 1][1])\r\n dp[i][1] = dp[i - cnt - 1][1] + 1\r\nprint(n - max(dp[n - 1][0], dp[n - 1][1]))\r\n", "import bisect\r\nclass b:\r\n\tdef __init__(self, loc, val, ls):\r\n\t\tself.loc = loc\r\n\t\tself.val = val\r\n\t\tself.ls = ls\r\n\t\tself.done = False\r\n\t\tself.ans = -1\r\n\r\n\tdef do(self):\r\n\t\tif self.done: return self.ans\r\n\t\tx = bisect.bisect_left(self.ls, self.loc-self.val) - 1\r\n\t\tif x == -1: self.ans = 0\r\n\t\telse:\r\n\t\t\tself.ans = ls[x].do() + 1\r\n\t\tself.done =True\r\n\t\treturn self.ans\r\n\r\n\tdef __lt__(self, obj):\r\n\t\tif type(obj) == int: return obj > self.loc\r\n\t\treturn obj.loc > self.loc\r\n\r\nls = []\r\nfor _ in range(int(input())):\r\n\tx,y = map(int, input().split(\" \"))\r\n\tls.append(b(x, y, ls))\r\nls.sort()\r\nm = -1\r\nfor l in ls:\r\n\tm = max(m, l.do())\r\nprint(len(ls) - (m+1))", "#假设最右侧第一个亮的灯是i 那么可以确定左侧哪些灯亮 哪些灯灭\r\n#设dp[i]是i亮的时候左侧亮着的灯的数目 那么dp[j]=dp[i]+1\r\nimport bisect\r\n\r\nn=int(input())\r\nps,ls=[0]*n,[0]*n\r\nll=[]\r\nfor i in range(n):\r\n ps[i],ls[i]=map(int,input().split())\r\n ll.append([ps[i],ls[i]])\r\nll.sort(key=lambda x:x[0])\r\ndp=[1]*n\r\nfor i in range(n):\r\n p_l=ll[i][0]-ll[i][1]\r\n #找到最右侧小于p_l的值\r\n j=bisect.bisect_left(ll,[p_l,0])-1\r\n if j<0:continue\r\n dp[i]=dp[j]+1\r\nprint(n-max(dp))", "inputs = int(input())\r\n\r\npositions = [0] * 1000100\r\nlengths = [-1] * 1000100\r\n\r\nfor i in range(inputs):\r\n pos, length = map(int, input().split())\r\n lengths[pos] = length\r\n\r\nstart = 0\r\nfor i in range(1000001):\r\n if lengths[i] == -1:\r\n if i == 0:\r\n positions[0] = 0\r\n else:\r\n positions[i] = positions[i - 1]\r\n else:\r\n if positions[i] > i:\r\n positions[i] = 1\r\n else:\r\n if i - lengths[i] - 1 >= 0:\r\n positions[i] = positions[i - lengths[i] - 1] + 1\r\n else:\r\n positions[i] = 1\r\n start = max(start, positions[i])\r\n\r\nprint(inputs - start)\r\n", "dp = []\ndef fun(n, a):\n\tdp[0] = 1\n\tfor i in range(1, n):\n\t\tl, r = 0, i - 1\n\t\twhile l <= r:\n\t\t\tm = (l + r)>>1\n\t\t\tif a[i][0] - a[m][0] <= a[i][1]:\n\t\t\t\tr = m - 1\n\t\t\telse:\n\t\t\t\tl = m + 1\n\t\t#print (i, x)\n\t\tdp[i] = dp[r] + 1\n\n\n\n\nn = int(input())\ndp = [0 for i in range(n)]\na=[]\nfor i in range(n):\n\tl = list(map(int, input().split()))\n\ta.append(l)\na.sort()\npower = [0 for i in range(n)]\n\nfun(n, a)\n#print (dp)\nprint (n - max(dp))\t\n", "n = int(input())\r\nnumbers = [0] * (10**6 + 5)\r\ndp = [0] * (10**6 + 5)\r\n\r\nfor i in range(n):\r\n a, g= map(int, input().split())\r\n numbers[a] = g\r\n\r\nif numbers[0] > 0:\r\n dp[0] = 1\r\n\r\nmx = 0\r\nfor i in range(1, 10**6 + 5):\r\n if numbers[i] == 0:\r\n dp[i] = dp[i - 1]\r\n else:\r\n if numbers[i] >= i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i - numbers[i] - 1] + 1\r\n if dp[i] > mx:\r\n mx = dp[i]\r\n\r\nprint(n - mx)", "import sys\r\ninput = sys.stdin.readline\r\nnumbeacons = int(input())\r\nbeacons = [tuple(map(int, input().split())) for _ in range(numbeacons)]\r\nbeacons.sort()\r\ndp = [0]\r\nfor i in range(1, numbeacons):\r\n\ttarget = beacons[i][0] - beacons[i][1]\r\n\tif target <= beacons[0][0]: dp += [i]\r\n\telse:\r\n\t\tleft, right = 0, i-1\r\n\t\twhile left != right:\r\n\t\t\tmid = (left+right)//2+1\r\n\t\t\tif beacons[mid][0] >= target: right = mid-1\r\n\t\t\telse: left = mid\r\n\t\tdp += [dp[left]+i-left-1]\r\nfor i in range(numbeacons): dp[i] += (numbeacons-i-1)\r\nprint(min(dp))", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n aa, bb = [int(x) for x in input().split()]\r\n aa -= 1\r\n a.append((aa, bb))\r\na.sort()\r\na, b = zip(*a)\r\ndp = []\r\nfor i in range(n):\r\n v = a[i] - b[i]\r\n if v <= a[0]:\r\n dp.append(i)\r\n continue\r\n r = i\r\n l = 0\r\n while l < r:\r\n m = l + (r - l) // 2\r\n if a[m] == v:\r\n break\r\n if a[m] > v:\r\n r = m \r\n else:\r\n l = m + 1\r\n m = l + (r - l) // 2\r\n dp.append((i - m) + dp[m - 1])\r\nz = [dp[i] + (n - 1 - i) for i in range(n)]\r\nans = min(z)\r\nprint(ans)\r\n ", "n = int(input())\r\nlis=[0]*(1000000+2)\r\ndp=[0]*(1000000+2)\r\nt=c=s=lef=0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n lis[a]=b\r\nif lis[0]>0:\r\n dp[0]=1\r\nfor i in range(1,1000000+1):\r\n if lis[i]==0:\r\n dp[i]=dp[i-1]\r\n else:\r\n if lis[i]>=i:\r\n dp[i]=1\r\n else:\r\n dp[i]=dp[i-lis[i]-1]+1\r\nprint(n-max(dp))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/608/C/\r\n\r\nn = int(input())\r\npower_levels = [0] * 1000001\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n power_levels[a] = b\r\n\r\ndp = [0] * 1000001\r\nif power_levels[0] > 0:\r\n dp[0] = 1\r\n\r\nfor i in range(1, 1000001):\r\n if power_levels[i] == 0:\r\n dp[i] = dp[i - 1]\r\n else:\r\n if power_levels[i] >= i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i - power_levels[i] - 1] + 1\r\n\r\nans = 0\r\nfor i in range(1, 1000001):\r\n ans = max(ans, dp[i])\r\n\r\nprint(n - ans)\r\n", "from bisect import bisect_left as bs\r\n\r\n\r\ndef find(idx):\r\n if idx == 0:\r\n dp[0] = 0\r\n return 0\r\n else:\r\n nidx = bs(axis, axis[idx] - poww[idx]) - 1\r\n if nidx < 0:\r\n dp[idx] = idx\r\n return idx\r\n if dp[nidx] != -1:\r\n dp[idx] = dp[nidx] + (idx - nidx - 1)\r\n return dp[idx]\r\n else:\r\n dp[idx] = find(nidx) + (idx - nidx - 1)\r\n return dp[idx]\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n arr = []\r\n for i in range(n):\r\n x, r = map(int, input().strip().split())\r\n arr.append((x, r))\r\n arr.sort(key=lambda p: p[0])\r\n axis = []\r\n poww = []\r\n for x in arr:\r\n axis.append(x[0])\r\n poww.append(x[1])\r\n dp = [-1 for i in range(n)]\r\n for i in range(n):\r\n dp[i] = find(i)\r\n ans = dp[-1]\r\n for i in range(n - 1, 0, -1):\r\n ans = min(ans, dp[i - 1] + (n - i))\r\n print(ans)\r\n", "import heapq\r\nimport math\r\nimport os\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\nimport random\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n n = II()\r\n cc = [[0, 0]] * n\r\n for i in range(n):\r\n cc[i] = I()\r\n cc = list(sorted(cc, key=lambda x: x[0]))\r\n dp = [0] * n\r\n dp[0] = 1\r\n for i in range(1, n):\r\n a, b = cc[i]\r\n if a - b <= cc[0][0]:\r\n dp[i] = 1\r\n else:\r\n left = 0\r\n right = i\r\n r = a - b\r\n while right - left > 1:\r\n mid = (left + right) // 2\r\n if cc[mid][0] >= r:\r\n right = mid\r\n else:\r\n left = mid\r\n\r\n dp[i] = 1 + dp[left]\r\n print(n - max(dp))\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "import math\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\nt=int(input())\r\nlis=[]\r\nwhile t:\r\n t-=1\r\n a,b=map(int,input().split())\r\n lis.append([a,b])\r\nlis.sort()\r\nd=[0]\r\nfor i in range(1,len(lis)):\r\n if lis[i][0]-lis[i][1] <=0:\r\n d.append(i)\r\n else:\r\n z=bisect_left(lis,[lis[i][0]-lis[i][1],])\r\n d.append(i-z + d[z-1])\r\nm=100000000000000\r\nfor i in range(0,len(d)):\r\n if (d[i]+len(d)-i) < m:\r\n m=d[i]+len(d)-i\r\nprint(m-1)\r\n ", "import sys \r\ninput = sys.stdin.readline \r\n\r\nM = 10 ** 6 + 5\r\nn = int(input())\r\ndp = [0] * M\r\nb = [0] * M \r\n\r\nfor i in range(n):\r\n a, c = map(int, input().split())\r\n b[a] = c \r\n\r\nif(b[0] > 0):\r\n dp[0] = 1 \r\nans = 0 \r\nfor i in range(1, M):\r\n if(b[i] == 0):\r\n dp[i] = dp[i - 1] \r\n else:\r\n if(b[i] >= i):\r\n dp[i] = 1 \r\n else:\r\n dp[i] = dp[i - b[i] - 1] + 1 \r\n ans = max(ans, dp[i])\r\nprint(n - ans)", "n = int(input())\r\nb = [0] * (10**6 + 5)\r\ndp = [0] * (10**6 + 5)\r\n\r\nfor i in range(n):\r\n a, g= map(int, input().split())\r\n b[a] = g\r\n\r\nif b[0] > 0:\r\n dp[0] = 1\r\n\r\nmx = 0\r\nfor i in range(1, 10**6 + 5):\r\n if b[i] == 0:\r\n dp[i] = dp[i - 1]\r\n else:\r\n if b[i] >= i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i - b[i] - 1] + 1\r\n if dp[i] > mx:\r\n mx = dp[i]\r\n\r\nprint(n - mx)", "class Beacon:\n def __init__(self, pos, span):\n self.pos, self.span = pos, span\n\nn = int(input())\nbeacons = [ Beacon(*map(int, input().split())) for i in range(n) ]\nbeacons.sort(key=lambda beacon: beacon.pos)\n\nlimit = beacons[-1].pos\nslide = (limit + 1) * [ None ]\nbeacon = beacons[0]\nbeacon_index = 1\n\nwhile beacon_index < n:\n next_beacon = beacons[beacon_index]\n for i in range(beacon.pos, next_beacon.pos):\n slide[i] = beacon\n beacon = next_beacon\n beacon_index += 1\n\nfor i in range(beacon.pos, limit + 1):\n slide[i] = beacon\n\nbest = 0\nfor beacon in beacons:\n beacon.activated = 1\n x = beacon.pos - beacon.span - 1\n if x >= 0 and slide[x]:\n beacon.activated += slide[x].activated\n best = max(best, beacon.activated)\n\nprint(n - best)\n", "import bisect\n\n\ndef min_destroyed(beacons):\n beacons.sort()\n dest = []\n for i, (a, b) in enumerate(beacons):\n pos = bisect.bisect_left(beacons, (a-b, 0), hi=i)\n if pos == 0:\n dest.append(i)\n else:\n dest.append(dest[pos-1] + i-pos)\n\n n = len(beacons)\n return min(d + (n-i-1) for i, d in enumerate(dest))\n\n\nif __name__ == '__main__':\n n = int(input())\n beacons = []\n for _ in range(n):\n a, b = map(int, input().split())\n beacons.append((a, b))\n print(min_destroyed(beacons))\n", "import bisect\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(tuple(R()))\r\narr.sort()\r\nres = [1] * n\r\nfor i in range(n):\r\n idx = bisect.bisect_left(arr, (arr[i][0] - arr[i][1], 0)) - 1\r\n if idx >= 0:\r\n res[i] = res[idx] + 1\r\nprint(n - max(res))", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import *\r\n\r\nn = int(input())\r\nab = [tuple(map(int, input().split())) for _ in range(n)]\r\nab.sort(key=lambda k: k[0])\r\na = [-10**18]+[ai for ai, _ in ab]\r\ndp = [0]*(n+1)\r\n\r\nfor i in range(1, n+1):\r\n j = bisect_left(a, ab[i-1][0]-ab[i-1][1])-1\r\n dp[i] = dp[j]+i-j-1\r\n\r\nans = 10**18\r\n\r\nfor i in range(n+1):\r\n ans = min(ans, dp[i]+n-i)\r\n\r\nprint(ans)", "n = int(input())\r\np = [(-(10**6), 0)] + sorted([tuple(map(int, input().split())) for i in range(n)])\r\ndp = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n l, r = 0, i\r\n while r - l > 1:\r\n mid = (l + r) >> 1\r\n if p[i][0] - p[i][1] <= p[mid][0]: r = mid\r\n else: l = mid\r\n dp[i] = i - r + dp[r - 1]\r\nans = min(dp[i] + (n - i) for i in range(1, n + 1))\r\nprint(ans)", "n = int(input())\r\nh = [-1] * 1000010\r\nm = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a > m:\r\n m = a\r\n h[a] = b\r\n\r\ndp = [1 if h[0] != -1 else 0]\r\nfor i in range(1, m + 1):\r\n if h[i] != -1:\r\n if i - h[i] - 1 < 0:\r\n dp.append(1)\r\n else:\r\n dp.append(dp[i - h[i] - 1] + 1)\r\n else:\r\n dp.append(dp[i - 1])\r\n\r\nprint(n - max(dp))\r\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\nfrom bisect import bisect_left\r\ndef main():\r\n n=ri()\r\n ab=[]\r\n for i in range(n):\r\n x,y=rm()\r\n ab.append([x,y])\r\n ab.sort()\r\n a=[ab[i][0] for i in range(n)]\r\n b=[ab[i][1] for i in range(n)]\r\n ds=[i for i in range(n)]\r\n for i in range(1,n):\r\n p=bisect_left(a,a[i]-b[i])\r\n if p>0: ds[i]=ds[p-1]+i-p\r\n tds=[ds[i]+n-i-1 for i in range(n)]\r\n return min(tds)\r\n \r\n\r\n\r\nprint(main())", "read = lambda: map(int, input().split())\r\nn = int(input())\r\np = sorted([tuple(read()) for i in range(n)])\r\na = [0] * (n + 1)\r\nb = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n a[i], b[i] = p[i - 1]\r\na[0] = int(-1e7)\r\ndp = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n L = 0\r\n R = n + 1\r\n while R - L > 1:\r\n M = (L + R) // 2\r\n if a[i] - b[i] <= a[M]: R = M\r\n else: L = M\r\n dp[i] = dp[L] + 1\r\nans = n - max(dp)\r\nprint(ans)\r\n", "from sys import stdin\r\nitem=lambda:stdin.readline().split()\r\nn=int(stdin.readline())\r\nlst,d=[],{}\r\nfor _ in range(n):\r\n a,b=map(int,item())\r\n d[a]=b\r\n lst.append(a)\r\nlst.sort()\r\nres=[0]*n\r\nfrom bisect import bisect_left as bis\r\nfor i,x in enumerate(lst):\r\n elem=bis(lst,x-d[x])-1\r\n if elem==-1:res[i]=i;continue\r\n res[i]=res[elem]+i-elem-1\r\nfor i,x in enumerate(lst):\r\n res[i]+=(n-1-i)\r\nprint(min(res))", "# https://codeforces.com/problemset/problem/608/C/\r\n\r\nn = int(input())\r\npower_levels = [0] * 1000001\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n power_levels[a] = b\r\n\r\ndp = [0] * 1000001\r\nif power_levels[0] > 0:\r\n dp[0] = 1\r\n\r\nfor i in range(1, 1000001):\r\n if power_levels[i] == 0:\r\n dp[i] = dp[i - 1]\r\n else:\r\n if power_levels[i] >= i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i - power_levels[i] - 1] + 1\r\n\r\nans = 0\r\nfor i in range(1, 1000001):\r\n ans = max(ans, dp[i])\r\n\r\nprint(n - ans)\r\n\r\n# #include <iostream>\r\n\r\n# using namespace std;\r\n\r\n# int main() {\r\n# int n;\r\n# cin >> n;\r\n\r\n# int thing[1000005];\r\n# int dp[1000005];\r\n# int a;\r\n# for (int i =0; i < n; i++) {\r\n# cin >> a;\r\n# cin >> thing[a];\r\n# }\r\n\r\n# if (thing[0] > 0) {\r\n# dp[0] = 1;\r\n# }\r\n\r\n# long long FAT = 1000001\r\n# ;\r\n# for (int i = 1; i <= FAT; i++) {\r\n# if (thing[i] == 0) {\r\n# dp[i] = dp[i - 1];\r\n# } else {\r\n# if (thing[i] >= i) {\r\n# dp[i] = 1;\r\n# } else { \r\n# dp[i] = dp[i - thing[i] - 1] + 1;\r\n# }\r\n# }\r\n# }\r\n\r\n\r\n# int anser = 0;\r\n# for (int i = 1; i <= FAT; i++) {\r\n# anser = max(anser, dp[i]);\r\n# }\r\n# // cout << \"here3\";\r\n\r\n# cout << n - anser << endl;\r\n# }\r\n", "import sys\n\nmaxN = 10**6 + 5\ndp = [0] * maxN\nb = [0] * maxN\n\nN = int(sys.stdin.readline())\nfor _ in range(N):\n beacon = [int(x) for x in sys.stdin.readline().split()]\n b[beacon[0]] = beacon[1]\n\nif b[0] > 0:\n dp[0] = 1\n\nfor i in range(1, maxN):\n if b[i] == 0:\n dp[i] = dp[i-1]\n else:\n if b[i] >= i:\n dp[i] = 1\n else:\n dp[i] = dp[i-b[i]-1]+1\nprint(N-max(dp))\n\n", "import sys\r\n\r\nMAX_X = 1000 * 1000 + 10\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n\r\n arr = [0] * MAX_X\r\n cnt = [0] * MAX_X\r\n dp = [0] * MAX_X\r\n for i in range(n):\r\n x, c = list(map(int, sys.stdin.readline().split()))\r\n arr[x + 1] = c\r\n\r\n for i in range(1, MAX_X):\r\n cnt[i] += cnt[i - 1] + (arr[i] != 0)\r\n \r\n for i in range(1, MAX_X):\r\n dp[i] = dp[max(0, i - arr[i] - 1)] + cnt[i - 1] - cnt[max(0, i - arr[i] - 1)]\r\n\r\n answer = dp[MAX_X - 1]\r\n add = 0\r\n\r\n for i in range(MAX_X - 1, -1, -1):\r\n answer = min(answer, add + dp[i])\r\n add += (arr[i] != 0)\r\n\r\n sys.stdout.write(str(answer))\r\n\r\nmain()\r\n", "n = int(input())\r\nN = 1000001\r\nbeacons = [0] * N\r\ndp = [0] * N\r\nactivated = 0 \r\n\r\nfor i in range(n):\r\n l, p = map(int, input().split())\r\n beacons[l] = p\r\n\r\nif beacons[0] != 0:\r\n dp[0] = 1\r\n\r\nfor i in range(1, N):\r\n if beacons[i] == 0:\r\n dp[i] = dp[i - 1]\r\n elif beacons[i] >= i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i - beacons[i] - 1] + 1\r\n\r\n activated = max(activated, dp[i])\r\n\r\nprint(n - activated)", "from bisect import bisect_left\nn = int(input())\ndp = [0]\nradii = {}\nlocs = []\n\nfor i in range(n):\n a, b = map(int, input().split())\n locs.append(a)\n radii[a] = b\nlocs.sort()\ncoords = []\nfor index, a in enumerate(locs):\n i = bisect_left(locs, a-radii[a])\n dp.append(index - i + dp[i])\nfor i in range(len(dp)):\n dp[i] += len(dp)-i-1\nprint(min(dp))\n\n", "if __name__ == '__main__':\n n = int(input())\n maxn = 1e6 + 5\n mx = 0\n b = [0] * int(maxn)\n for i in range(n):\n a1,b1 = map(int, input().split())\n b[a1] = b1\n\n dp = [0] * int(maxn)\n\n if b[0] > 0:\n dp[0] = 1\n\n for i in range(1,int(maxn)):\n if b[i] == 0:\n dp[i] = dp[i-1]\n\n else:\n if b[i] >= i:\n dp[i] = 1\n else:\n dp[i] = dp[i-b[i]-1] + 1\n\n mx = max(mx,dp[i])\n\n print(n-mx)\n", "import sys\r\nN = 1<<20\r\nar = [0]*N\r\n\r\ndp = [0]*N\r\nn = int(input())\r\nfor i in range(0, n):\r\n inp = input().split()\r\n ar[int(inp[0])+1]= int(inp[1])\r\nfor i in range(N):\r\n dp[i] = (1 if ar[i]>=i else dp[i-ar[i]-1]+1) if ar[i] else dp[i-1]\r\nprint(n-max(dp))\r\n", "from math import inf\nfrom bisect import bisect_left\n\nbeacons = {}\ns_beacon_pos = []\n\n# logn to find beacon with pos <= pos\ndef get_next_beacon(pos):\n prop = bisect_left(s_beacon_pos, pos)\n if prop != len(s_beacon_pos) and s_beacon_pos[prop] == pos:\n return s_beacon_pos[prop]\n if prop == 0:\n return -1\n return s_beacon_pos[prop-1]\n\ncache = {}\ndef num_alive(pos):\n if pos < 0:\n return 0\n if pos not in cache:\n if pos not in beacons:\n cache[pos] = num_alive(get_next_beacon(pos-1))\n else: # pos-power-1 because inclusive destruction\n cache[pos] = num_alive(get_next_beacon(pos-beacons[pos]-1)) + 1\n return cache[pos]\n\nmax_alive = 0\n\n# i is pos, value is power\nn = int(input())\n#beacons = [0]*n\nfor i in range(n):\n line = [int(k) for k in input().split()]\n beacons[line[0]] = line[1]\n\n# nlogn sort positions of beacons, used for whenever order is needed\ns_beacon_pos = sorted(list(beacons))\n\nfor pos in s_beacon_pos:\n if num_alive(pos) > max_alive:\n max_alive = num_alive(pos)\n\nprint(n - max_alive)", "import bisect\r\n\r\nn = int(input())\r\ndata = []\r\nfor _ in range(n):\r\n data.append(list(map(int, input().split())))\r\ndata.sort(key=lambda x: x[0])\r\na = [x[0] for x in data]\r\nb = [x[1] for x in data]\r\ndp = [0] * n\r\ndp[0] = 1\r\nfor i in range(1, n):\r\n ind = bisect.bisect_left(a, a[i] - b[i], 0, i)\r\n if ind > 0:\r\n dp[i] = dp[ind - 1] + 1\r\n else:\r\n dp[i] = 1\r\nprint(n - max(dp))", "N = 1 << 20 # This is equivalent to 2^20, creating a large array for storing beacon data\r\nn = int(input()) # Read the initial number of beacons\r\n\r\ndp = [0] * N \r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n dp[a] = b\r\n\r\nfor i in range(N):\r\n dp[i] = (1 if dp[i] >= i else dp[i - dp[i] - 1] + 1) if dp[i] else dp[i - 1]\r\n\r\nprint(n - max(dp))\r\n", "n = int(input())\r\nbeacons = [0] * (1000001)\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n beacons[a] = b\r\n\r\ndp = [0] * (1000001)\r\n\r\nif beacons[0] > 0:\r\n dp[0] = 1\r\n\r\nmaxPlaces = 0\r\n\r\nfor i in range(1, 1000001):\r\n if beacons[i] == 0:\r\n dp[i] = dp[i - 1]\r\n elif beacons[i] >= i:\r\n dp[i] = 1\r\n else:\r\n dp[i] = dp[i - beacons[i] - 1] + 1\r\n maxPlaces = max(dp[i], maxPlaces)\r\nprint(n - maxPlaces)", "n = int(input())\r\ndp , li , ans = [0] * 1000010 , [0] * 1000010 , 0\r\nfor i in range(n):\r\n a , b = map(int , input().split())\r\n li[a] = b\r\nfor i in range(1000010):\r\n if li[i]:\r\n dp[i] = dp[i-li[i] - 1] + 1\r\n else :\r\n dp[i] = dp[i-1]\r\n ans = max(ans , dp[i])\r\nprint(n - ans )", "n = int(input())\r\na = [0]*(10**6+5)\r\ndp = [0]*(10**6+5)\r\nfor _ in range(n):\r\n p, s = map(int, input().split())\r\n a[p] = s\r\nfor i in range(len(dp)):\r\n if a[i]:\r\n dp[i] = dp[i-a[i]-1]+1\r\n else:\r\n dp[i] = dp[i-1]\r\nprint(n-max(dp))\r\n", "from bisect import bisect_left\r\nn = int(input())\r\na = sorted([[int(i) for i in input().split()] for _ in range(n)])\r\na, b = [i[0] for i in a], [i[1] for i in a]\r\npref = [0]\r\nfor i in range(n):\r\n x = bisect_left(a, a[i] - b[i])\r\n pref.append(pref[x] + i - x)\r\nans = 1e5 + 5\r\nfor i in range(n + 1):\r\n ans = min(ans, i + pref[n - i])\r\nprint(ans)", "def bin(mas,x):\r\n l = 0\r\n r = len(mas)\r\n while (r > l + 1):\r\n m = (r + l) // 2;\r\n if (x < mas[m]):\r\n r = m;\r\n else:\r\n l = m\r\n return l\r\n\r\nn = int(input())\r\na = [-9999999]\r\nb = [9999999]\r\ndp = [0] * (n + 1)\r\nfor i in range(n):\r\n x,y=[int(i) for i in input().split()]\r\n a.append(x)\r\n b.append(y)\r\n\r\na, b = (list(x) for x in zip(*sorted(zip(a, b))))\r\n\r\n\r\n\r\nfor i in range(1,n+1):\r\n z = a[i] - b[i] - 1\r\n x = bin(a, z)\r\n dp[i] = dp[x] + ( i - x - 1)\r\nans = 10**30\r\nfor i in range(1, n + 1):\r\n ans = min(ans, dp[i] + n - i)\r\nprint(ans)", "def bisect_left(A,ele):\r\n l=0\r\n r=len(A)-1\r\n while r>l:\r\n mid=(l+r)//2\r\n if A[mid][0]>=ele:\r\n r=mid\r\n \r\n else:\r\n l=mid+1\r\n \r\n return r\r\n \r\n\r\ndef answer(n,A):\r\n A.sort(key=lambda x:x[0])\r\n dp=[0]*(n)\r\n \r\n for i in range(1,n):\r\n ele=A[i][0]-A[i][1]\r\n index=bisect_left(A,ele)\r\n if index==0:\r\n dp[i]=i\r\n \r\n else:\r\n dp[i]=i-index+dp[index-1]\r\n \r\n \r\n mini=dp[-1]\r\n for i in range(n-1,0,-1):\r\n mini=min(mini,n-i+dp[i-1])\r\n \r\n return min(mini,n)\r\n\r\n\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n l,p=map(int,input().split())\r\n arr.append([l,p])\r\nprint(answer(n,arr)) ", "\r\nmod=10**6+1\r\nb=[0]*mod;dp=[0]*mod;maxi=0\r\nn=int(input())\r\nfor _ in range(n):\r\n a,po = map(int,input().split())\r\n b[a]=po\r\n \r\nif b[0]>0:\r\n dp[0]=1\r\n \r\nfor i in range(1,mod):\r\n if b[i]==0:\r\n dp[i]=dp[i-1]\r\n \r\n else:\r\n if b[i]>=i:\r\n dp[i]=1\r\n \r\n else:\r\n dp[i]=dp[i-b[i]-1]+1\r\n \r\n maxi=max(maxi,dp[i])\r\n \r\nprint(n-maxi)\r\n ", "n = int(input())\r\np = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n p.append([a, b])\r\np.sort()\r\nans = []\r\nfor i in range(n):\r\n ans.append(1)\r\nfor i in range(1, n):\r\n l = -1\r\n r = i\r\n f = False\r\n while (r - l) > 1:\r\n m = (l + r) // 2\r\n if (p[m][0] >= p[i][0] - p[i][1]):\r\n r = m\r\n else:\r\n f = True\r\n l = m\r\n if not f:\r\n ans[i] = 1\r\n else:\r\n ans[i] = ans[l] + 1\r\nmini = n - 1\r\nfor i in range(n):\r\n mini = min(mini, i - ans[i] + n - i)\r\nprint(mini)\r\n \r\n", "import sys\r\n\r\nN = 1000001\r\nnum_beacons = int(sys.stdin.readline())\r\nbeacons = [0 for x in range(N)]\r\ndp = [0 for x in range(N)]\r\nfor x in range(num_beacons):\r\n position, power_lv = map(int, sys.stdin.readline().split())\r\n beacons[position] = power_lv\r\ndp[0] = beacons[0] != 0 # num beacons activated if beacon i is activated\r\nfor y in range(1,N):\r\n if beacons[y] == 0:\r\n dp[y] = dp[y - 1]\r\n else:\r\n if beacons[y] >= y:\r\n dp[y] = 1\r\n else:\r\n dp[y] = dp[y - beacons[y] - 1] + 1\r\nprint(num_beacons - max(dp))", "from bisect import bisect_left as bl\r\nn = int(input());l = []\r\nfor i in range(n):\r\n l.append(tuple(list(map(int,input().split()))))\r\nl.sort();DP = [0]*(n)\r\nfor i in range(n):\r\n x = bl(l,(l[i][0]-l[i][1],0))\r\n if x==0:\r\n DP[i]=1\r\n else:\r\n DP[i]=DP[x-1]+1\r\nprint(n-max(DP))", "def binary_search(arr, target, r):\r\n l = 0\r\n while l <= r:\r\n m = (l + r) // 2\r\n if arr[m][0] < target:\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n return l\r\n\r\n\r\nn = int(input())\r\nbeacons = []\r\nfor i in range(n):\r\n beacons.append(tuple(map(int, input().split())))\r\nbeacons = sorted(beacons)\r\ndestroy = [0] * n\r\ni = 1\r\nwhile i < n:\r\n ind = binary_search(beacons, beacons[i][0] - beacons[i][1], i)\r\n destroy[i] = i - ind\r\n if ind > 0:\r\n destroy[i] += destroy[ind-1]\r\n i += 1\r\n\r\nminim = n - 1\r\ndestroyed_beacon = 0\r\nwhile destroyed_beacon < minim:\r\n destr = destroyed_beacon + destroy[n - 1 - destroyed_beacon]\r\n if destr < minim:\r\n minim = destr\r\n destroyed_beacon += 1\r\nprint(minim)\r\n", "# Python 3 implementation of the approach \r\n\r\n# Function to return the count of elements \r\n# from the array which are greater than k \r\ndef countGreater(arr, n, k): \r\n\tl = 0\r\n\tr = n - 1\r\n\r\n\t# Stores the index of the left most element \r\n\t# from the array which is greater than k \r\n\tleftGreater = n \r\n\r\n\t# Finds number of elements greater than k \r\n\twhile (l <= r): \r\n\t\tm = int(l + (r - l) // 2) \r\n\r\n\t\t# If mid element is greater than \r\n\t\t# k update leftGreater and r \r\n\t\tif (arr[m] > k): \r\n\t\t\tleftGreater = m \r\n\t\t\tr = m - 1\r\n\r\n\t\t# If mid element is less than \r\n\t\t# or equal to k update l \r\n\t\telse: \r\n\t\t\tl = m + 1\r\n\r\n\t# Return the count of elements \r\n\t# greater than k \r\n\treturn (n - leftGreater) \r\n\r\nn=int(input())\r\nls=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n ls.append([a,b])\r\nls.sort()\r\narr=[ls[0][0]]\r\ndp=[0 for i in range(n+1)]\r\nfor i in range(1,n):\r\n k=countGreater(arr,len(arr),ls[i][0]-ls[i][1]-1)\r\n dp[i+1]=k+dp[i-k]\r\n arr.append(ls[i][0])\r\nans=n \r\nfor i in range(1,n+1):\r\n ans=min(ans,dp[i]+n-i)\r\nprint(ans) ", "import bisect\n\nn = int(input())\n\na = []\nfor _ in range(n):\n a.append(tuple(int(x) for x in input().split()))\na.sort()\n\ntrig = []\nfor i, beacon in enumerate(a):\n leftmost = bisect.bisect_left(a, (beacon[0]-beacon[1], 0)) - 1\n if leftmost != -1:\n trig.append((i - leftmost - 1) + trig[leftmost])\n else:\n trig.append(i)\n\nm = min(n, trig[-1])\nfor i in range(1, n):\n m = min(m, n-i + trig[i-1])\nprint(m)\n", "n = int(input())\nbeacons = [0] * (1000001)\n\nfor _ in range(n):\n a, b = map(int, input().split())\n beacons[a] = b\n\ndp = [0] * (1000001)\n\nif beacons[0] > 0:\n dp[0] = 1\n\nmaxPlaces = 0\n\nfor i in range(1, 1000001):\n if beacons[i] == 0:\n dp[i] = dp[i - 1]\n elif beacons[i] >= i:\n dp[i] = 1\n else:\n dp[i] = dp[i - beacons[i] - 1] + 1\n maxPlaces = max(dp[i], maxPlaces)\nprint(n - maxPlaces)\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\nbeacons = []\r\nfor i in range(n):\r\n a, b = ints()\r\n beacons.append((a, b))\r\nbeacons.sort(key=lambda x: x[0])\r\n\r\ndef bsearch(x):\r\n l, r = 0, n - 1\r\n while l <= r:\r\n m = (l + r) // 2\r\n if beacons[m][0] == x:\r\n return m\r\n elif beacons[m][0] < x:\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n return l\r\n\r\ndp = [0] * n\r\nfor i in range(n):\r\n limit = bsearch(beacons[i][0] - beacons[i][1])\r\n dp[i] += i - limit\r\n if limit > 0:\r\n dp[i] += dp[limit - 1]\r\n\r\nans = math.inf\r\nfor i in range(n + 1):\r\n destroyed = n - i\r\n if i > 0:\r\n destroyed += dp[i - 1]\r\n ans = min(ans, destroyed)\r\nprint(ans)", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nn=int(stdin.readline().strip())\r\ns=[list(map(int,stdin.readline().strip().split())) for i in range(n)]\r\ns.sort()\r\ns1=[s[i][0] for i in range(n)]\r\ndp=[0 for i in range(n)]\r\nans=10**9\r\nfor i in range(n):\r\n x=s[i][0]-s[i][1]\r\n y=bl(s1,x)-1\r\n if y==-1:\r\n dp[i]=i\r\n else:\r\n dp[i]=dp[y]+i-y-1\r\n ans=min(ans,dp[i]+n-(i+1))\r\nprint(ans)\r\n", "import bisect\r\nn=int(input())\r\nab=[list(map(int,input().split())) for i in range(n)]\r\nab.sort()\r\na=[ab[i][0] for i in range(n)]\r\nb=[ab[i][1] for i in range(n)]\r\ndp=[0]*n\r\nfor i in range(n):\r\n left=a[i]-b[i]\r\n idx=bisect.bisect_left(a,left)\r\n if idx==0:\r\n dp[i]=i\r\n else:\r\n dp[i]=dp[idx-1]+(i-idx)\r\nans=n\r\nfor i in range(n):\r\n ans=min(ans,dp[i]+(n-1-i))\r\nprint(ans)", "n = int(input())\r\ntemp_max = 0\r\nconst1 = 1000001\r\nmemo = [0]*const1\r\ntlis = [0]*const1\r\nfor i in range(n):\r\n p1, p2 = map(int, input().split())\r\n tlis[p1] = p2\r\nfor i in range(const1):\r\n memo[i] = memo[i - tlis[i] - 1] + 1 if (tlis[i] != 0) else memo[i - 1]\r\n temp_max = max(temp_max, memo[i])\r\nans = n - temp_max\r\nprint(ans)", "import sys\r\ninput = sys.stdin.read\r\nMAX = int(1e6+7)\r\nb = [0 for _ in range(MAX)]\r\nd = [0 for _ in range(MAX)]\r\nmx = 0\r\n\r\nr = map(int,input().split())\r\n\r\nn = next(r)\r\n\r\nfor i in range(n):\r\n a = next(r)\r\n b[a] = next(r)\r\n\r\nif b[0] > 0:\r\n d[0] = 1\r\nelse:\r\n d[0] = 0\r\n \r\nfor i in range(1,MAX):\r\n if b[i] == 0:\r\n d[i] = d[i-1]\r\n elif i <= b[i]:\r\n d[i] = 1\r\n else:\r\n d[i] = d[i - b[i] - 1] + 1\r\n \r\n mx = max(mx,d[i])\r\n\r\nprint(n - mx)", "n=int(input())\r\nx=[0]*(10**6+1)\r\ndp=[0]*(10**6+1)\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x[a]=b\r\ndp[0]=1 if x[0]>0 else 0\r\nfor i in range(1,10**6+1):\r\n if x[i]==0:\r\n dp[i]=dp[i-1]\r\n else:\r\n dp[i]=dp[i-x[i]-1]+1\r\n\r\nprint(n-max(dp))\r\n\r\n\r\n\r\n\r\n", "import sys\n\nlines = iter(sys.stdin)\nn = [int(x) for x in next(lines).split()][0]\n\nbeacons = []\nbeacons.append((float('-inf'), 0))\nfor i in range(n):\n (a, b) = [int(x) for x in next(lines).split()]\n beacons.append((a, b))\n\nbeacons.sort()\n# print(beacons)\n\n# returns index of rightmost beacon before pos\n# low < pos, high > pos\ndef binSearch(high, pos):\n low = 0\n while True:\n if high - low == 1:\n return low\n mid = (high + low) // 2\n if beacons[mid][0] < pos:\n low = mid\n else:\n high = mid\n\ndp = [0] * (n + 1)\nfor i in range(1, n+1):\n beacon = beacons[i]\n lastSurviving = binSearch(i, beacon[0] - beacon[1])\n # print(lastSurviving)\n dp[i] = (i - lastSurviving - 1) + dp[lastSurviving]\n# print(dp)\n\n\nans = float('inf')\nfor i in range(n+1):\n ans = min(ans, (n-i) + dp[i])\nprint(ans)\n\n ", "from bisect import *\r\nfrom sys import *\r\nn=int(stdin.readline())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n x,y=map(int,stdin.readline().split())\r\n a.append([x,y])\r\n b.append(x)\r\na.sort()\r\nb.sort()\r\ndp=[]\r\nfor i in range(a[-1][0]+1):\r\n dp.append([0,0])\r\nfor i in range(n):\r\n dp[a[i][0]][1]=a[i][1]\r\n right=bisect_left(b,a[i][0])\r\n left=bisect_left(b,a[i][0]-a[i][1])\r\n val=right-left\r\n dp[a[i][0]][0]=val\r\nfor i in range(2,len(dp)):\r\n if dp[i][1]==0:\r\n dp[i][0]=dp[i-1][0]\r\n else:\r\n if i-dp[i][1]-1>=0:\r\n dp[i][0]+=dp[i-dp[i][1]-1][0]\r\nans=n\r\nfor i in range(n):\r\n ans=min(ans,dp[a[i][0]][0]+(n-i-1))\r\nstdout.write(str(ans))", "def main():\n n = int(input())\n bb = [0] * 1000001\n for _ in range(n):\n a, b = map(int, input().split())\n bb[a] = b\n a = 0\n for i, b in enumerate(bb):\n if b:\n a = (bb[i - b - 1] + 1) if i > b else 1\n bb[i] = a\n print(n - max(bb))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ndp = [0] * 1000007\r\nmajak = [0] * 1000007\r\n\r\nq = 1000007\r\np = 0\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n q = min(q, a)\r\n majak[a] = b\r\n\r\ndp[q] = 1\r\nma = 1\r\nfor i in range(q + 1, 1000003, 1):\r\n if(majak[i] == 0):\r\n dp[i] = dp[i - 1]\r\n else:\r\n dp[i] = dp[i - majak[i] - 1] + 1\r\n ma = max(ma, dp[i])\r\n\r\nprint(n - ma)", "from bisect import *\r\na=int(input())\r\n\r\npos=[]\r\nans=[]\r\nfor i in range(a):\r\n x,y=map(int,input().split())\r\n ans.append([x,y])\r\n pos.append(x)\r\nans.sort()\r\npos.sort()\r\nfrom collections import *\r\nal=defaultdict(int)\r\nal[0]=0\r\ndp=[a-1]\r\nfor i in range(1,len(pos)):\r\n r=bisect_left(pos,pos[i]-ans[i][1])\r\n c1=1\r\n r-=1\r\n \r\n if(r<0):\r\n dp.append(len(pos)-1)\r\n al[i]=i\r\n else:\r\n cost=len(pos)-i-1+(i-r-1)+al[r]\r\n dp.append(cost)\r\n al[i]=i-r-1+al[r]\r\n \r\n\r\nprint(min(dp))\r\n", "\r\nfrom sys import stdin, stdout\r\n# output\r\ndef out(*args):\r\n for arg in args:\r\n stdout.write(str(arg))\r\n# read line of input\r\ndef line():\r\n return stdin.readline().strip()\r\n# read in ints on a line\r\ndef ints():\r\n return list(map(int, line().split()))\r\nimport copy\r\n# create array & fill it\r\ndef arr(length, default=0):\r\n return [copy.deepcopy(default) for _ in range(length)]\r\n\r\ndef testcases():\r\n t, = ints()\r\n for i in range(t):\r\n yield i\r\n\r\nfrom bisect import *\r\ndef main():\r\n N, = ints()\r\n beacons = arr(N)\r\n for i in range(N):\r\n a, b = ints()\r\n beacons[i] = (a, b)\r\n beacons.sort()\r\n positions = [a[0] for a in beacons]\r\n dp = arr(N)\r\n dp[0] = 1\r\n for i in range(1, N):\r\n pos, power = beacons[i]\r\n # 9 2\r\n # looking for any beacon behind 7\r\n target = pos - power\r\n k = bisect_left(positions, target) - 1\r\n if positions[k] < target:\r\n dp[i] = dp[k] + 1\r\n else:\r\n dp[i] = 1\r\n print(N - max(dp))\r\n\r\n\r\n\r\nif \"__main__\" == __name__:\r\n main()\r\n", "n = int(input())\r\na = [0]*1000001\r\nb = [0]*1000001\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n a[l[0]] = 1\r\n b[l[0]] = l[1]\r\n \r\nnotdestroyed = [0]*1000001\r\nif a[0] == 1:\r\n notdestroyed[0] = 1\r\nfor i in range(1,1000001):\r\n if a[i] == 1:\r\n notdestroyed[i] = notdestroyed[i-b[i]-1]+1\r\n else:\r\n notdestroyed[i] = notdestroyed[i-1]\r\n \r\nprint(n-max(notdestroyed))", "n = int(input())\nb = [0] * (10**6 + 1)\ndp = [0] * (10**6 + 1)\n\nfor i in range(n):\n a, c = map(int, input().split())\n b[a] = c\n\nans = 0\ndp[0] = True if b[0] != 0 else False\n\nfor i in range(1, 10**6 + 1):\n if b[i] == 0:\n dp[i] = dp[i-1]\n else:\n if b[i] >= i:\n dp[i] = 1\n else:\n dp[i] = dp[i-b[i]-1] + 1\n ans = max(ans, dp[i])\n\nprint(n - ans)", "from bisect import bisect_left as bl\r\nn=int(input())\r\nb,a,p,dp=[],[],[],[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\na.sort()\r\nfor i in range(n):\r\n b.append(a[i][0])\r\n p.append(a[i][1])\r\n dp.append(0)\r\nfor i in range(n):\r\n j=bl(b,b[i]-p[i])\r\n dp[i]=i-j + dp[j-1]\r\nans,c=float(\"inf\"),1\r\nfor j in range(n-1,-1,-1):\r\n ans=min(ans,dp[j-1]+c,dp[j]+c-1)\r\n c=c+1\r\nprint(ans)", "# your code goes here\r\nn = int(input())\r\n \r\nbb = [0] * 1000001\r\n \r\nfor i in range(n): \r\n a, b = map(int, input().split())\r\n bb[a] = b\r\n \r\na = 0\r\nm = 0 \r\nfor index, value in enumerate(bb):\r\n \r\n if value > 0:\r\n if (index - value) > 0:\r\n a = (1 + bb[index - value -1])\r\n else:\r\n a = 1 \r\n \r\n bb[index] = a\r\n \r\nprint(n - max(bb)) ", "from sys import stdin\r\nfrom bisect import bisect_left\r\n\r\ndef main():\r\n n = int(input())\r\n beacons = [tuple(map(int, input().split())) for _ in range(n)]\r\n beacons.sort()\r\n\r\n # dp[i] stores the number of beacons that can be saved when considering the beacons from the rightmost one to the i-th one\r\n dp = [0] * n\r\n\r\n for i in range(n):\r\n last_undestroyed = bisect_left(beacons, (beacons[i][0] - beacons[i][1],)) - 1\r\n dp[i] = 1 if last_undestroyed == -1 else dp[last_undestroyed] + 1\r\n\r\n # The minimum number of beacons destroyed\r\n ans = n - max(dp)\r\n\r\n print(ans)\r\n\r\nmain()\r\n", "def min_destroyed_beacons(beacons):\n # Sort the beacons by their positions\n beacons.sort()\n n = len(beacons)\n\n # dp[i] will hold the number of beacons that will not be destroyed if the i-th beacon is the first to be activated\n dp = [0] * n\n\n # prev[i] will hold the index of the farthest beacon to the left that will not be destroyed by the i-th beacon\n prev = [0] * n\n\n # Initialize the prev array\n for i in range(n):\n dp[i] = 1 # The beacon itself is not destroyed\n pos = beacons[i][0] - beacons[i][1] - 1\n prev[i] = -1 # Default value if no beacon is to the left\n # Binary search for the farthest beacon to the left that is not destroyed\n low, high = 0, i - 1\n while low <= high:\n mid = (low + high) // 2\n if beacons[mid][0] <= pos:\n prev[i] = mid\n low = mid + 1\n else:\n high = mid - 1\n\n # Calculate the dp values\n for i in range(n):\n if prev[i] != -1:\n dp[i] += dp[prev[i]]\n\n # The answer is the maximum number of undestroyed beacons for any beacon when it is the first to be activated\n max_undestroyed = max(dp)\n\n # The minimum number of destroyed beacons is the total number minus the maximum number of undestroyed beacons\n return n - max_undestroyed\n\n# Read input\nn = int(input())\nbeacons = [tuple(map(int, input().split())) for _ in range(n)]\n\n# Calculate and print the result\nprint(min_destroyed_beacons(beacons))\n", "maxN=1000001\nb = [0]*maxN\ndp = [0]*maxN\n\nn = int(input())\nmxA=0\n\nfor i in range(n):\n a,p = [int(i) for i in input().split()]\n b[a] = p\n mxA = max(a,mxA)\n\nif b[0] :\n dp[0] = 1\n\nmxSvd=0\n\nfor i in range(mxA+1) :\n if not b[i] :\n dp[i] = dp[i-1]\n\n else :\n if b[i]>=i:\n dp[i] = 1\n else :\n dp[i] = dp[i-b[i]-1] + 1\n if dp[i]>mxSvd :\n mxSvd=dp[i]\n\n#print(dp[:8])\n\nprint (n - mxSvd)", "n = int(input())\r\ncp = [0] * n\r\nfor i in range(n):\r\n cp[i] = tuple(map(int, input().split()))\r\ncp.sort() \r\nmaxman = [-1] * n\r\nfor i in range(1, n):\r\n left = -1\r\n right = i\r\n while right - left > 1:\r\n m = (right + left) // 2\r\n #print(m, i)\r\n if cp[i][0] - cp[i][1] <= cp[m][0]:\r\n right = m\r\n else: left = m\r\n maxman[i] = right\r\nres = [0] * n\r\nfor i in range(1, n):\r\n res[i] = i - maxman[i] + res[maxman[i] - 1]\r\n#print(res)\r\nfor i in range(0, n):\r\n res[i] += (n - i - 1)\r\nprint(min(res))", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nc = [0]*(10**6+5)\r\nfor _ in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n c[a] = b\r\nfor i in range(10**6+1):\r\n if c[i]:\r\n if c[i] >= i: c[i] = 1\r\n else: c[i] = c[i-c[i]-1]+1\r\n else:\r\n c[i] = c[i-1]\r\nprint(n-max(c))", "import sys\n\nONLINE_JUDGE = True\n\nif not ONLINE_JUDGE:\n sys.stdin = open(\"input.text\", \"r\")\n\n############ ---- Input Functions ---- ############\n\ndef inp(): # integer\n return(int(input()))\ndef inlt(): # lists\n return(list(map(int,input().split())))\ndef insr(): # list of characters\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr(): # space seperate integers\n return(map(int,input().split()))\n\n\n############ ---- Solution ---- ############\n\nMAX_SIZE = 1000001\n\nn = inp()\nbeacons = [0] * MAX_SIZE\n\nfor _ in range(n):\n a, b = inlt()\n beacons[a] = b\n\ndp = [0] * MAX_SIZE\ndp[0] = beacons[0] > 0\n\nmx = 0\n\nfor i in range(MAX_SIZE):\n if beacons[i] == 0:\n dp[i] = dp[i-1]\n elif beacons[i] >= i:\n dp[i] = 1\n else:\n dp[i] = dp[i - beacons[i] -1] + 1\n\n mx = max(dp[i], mx)\n\nprint(n - mx)\n\n\n\n\n\n", "def min_destroyed_beacons(beacons):\n # Sort the beacons by their positions\n beacons.sort()\n n = len(beacons)\n\n # dp[i] will hold the number of beacons that will not be destroyed if the i-th beacon is the first to be activated\n dp = [0] * n\n\n # prev[i] will hold the index of the farthest beacon to the left that will not be destroyed by the i-th beacon\n prev = [0] * n\n\n def find_leftmost_not_destroyed(beacons, start, end, position):\n result = -1\n while start <= end:\n mid = (start + end) // 2\n if beacons[mid][0] <= position:\n result = mid\n start = mid + 1\n else:\n end = mid - 1\n return result\n\n # Initialize the prev array with an unconventional for-else loop\n for i in range(n):\n dp[i] = 1 # The beacon itself is not destroyed\n pos = beacons[i][0] - beacons[i][1] - 1\n prev[i] = find_leftmost_not_destroyed(beacons, 0, i - 1, pos)\n\n # Calculate the dp values\n for i in range(n):\n if prev[i] != -1:\n dp[i] += dp[prev[i]]\n\n # The answer is the maximum number of undestroyed beacons for any beacon when it is the first to be activated\n max_undestroyed = max(dp)\n\n # The minimum number of destroyed beacons is the total number minus the maximum number of undestroyed beacons\n return n - max_undestroyed\n\n# Read input\nn = int(input())\nbeacons = [tuple(map(int, input().split())) for _ in range(n)]\n\n# Calculate and print the result\nprint(min_destroyed_beacons(beacons))\n", "R = lambda : map(int, input().split())\nn = int(input())\nv = []\nfor _ in range(n):\n a,b=R()\n v.append((a,b))\nv = sorted(v)\n\ndef find(v,x,i,j):\n if v[i][0]>=x:\n return -1\n if (i==j):\n return i\n if (i==j-1):\n return j if v[j][0]<x else i\n m=(i+j)//2\n return find(v,x,i,m) if v[m][0]>=x else find(v,x,m,j)\n\nd = [0]*n\nfor i in range(1,n):\n x = v[i][0]-v[i][1]\n f = find(v,x,0,len(v)-1)\n if f==-1:\n d[i]=i\n else:\n d[i]=d[f]+i-f-1\n\nr=[d[i]+n-i-1 for i in range(n)]\nprint(min(r))\n", "n = int(input())\r\nbb = [0] * 1000001\r\n\r\nfor _ in range(n):\r\n a_and_b = input()\r\n a, b = a_and_b.split() # n - кол-во целых чисел, k - кол-во элем. заданной посл-ти меньше либо равны x(результат программы)\r\n a = int(a)\r\n b = int(b)\r\n bb[a] = b\r\n\r\na = 0\r\nfor i, b in enumerate(bb):\r\n if b > 0:\r\n if i > b:\r\n a = (bb[i - b - 1] + 1)\r\n else:\r\n a = 1\r\n\r\n bb[i] = a\r\n\r\nprint(n - max(bb))" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nw = [0] + list(map(int, input().split()))\r\nm = int(input())\r\nM = 10**9+7\r\nd = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\nq = list(range(1, n+1))\r\nx = [0]*(n+1)\r\nans, y, p = [], [], []\r\nwhile q:\r\n a = q.pop()\r\n if a < 0:\r\n a = x[~a]-1\r\n if a < p[-1]:\r\n ans.append(y[a:])\r\n del y[a:], p[-1]\r\n for i in ans[-1]:\r\n x[i] = -1\r\n elif x[a] > 0:\r\n while p[-1] > x[a]:\r\n p.pop()\r\n elif x[a] == 0:\r\n q.append(~a)\r\n for i in d[a]:\r\n q.append(i)\r\n y.append(a)\r\n p.append(len(y))\r\n x[a] = len(y)\r\n\r\nc, b = 0, 1\r\nfor i in ans:\r\n x = Counter([w[j] for j in i])\r\n a = min(x)\r\n c += a\r\n b = b*x[a]%M\r\nprint(c, b)", "n, m = int(input()) + 1, 1000000007\r\nq, p = [[] for i in range(n)], [[] for i in range(n)]\r\nw = [0] + list(map(int, input().split()))\r\nfor i in range(int(input())):\r\n u, v = map(int, input().split())\r\n p[u].append(v)\r\n q[v].append(u)\r\nr = set(i for i in range(1, n) if not p[i] or not q[i])\r\ns, t = 0, 1\r\nwhile r:\r\n i = r.pop()\r\n s += w[i]\r\n for j in p[i]:\r\n q[j].remove(i)\r\n if not q[j]: r.add(j)\r\n for j in q[i]:\r\n p[j].remove(i)\r\n if not p[j]: r.add(j)\r\nr = set(i for i in range(1, n) if p[i] and q[i])\r\nwhile r:\r\n i = r.pop()\r\n h = p[i]\r\n d, k = w[i], 1\r\n while h:\r\n i = h.pop()\r\n if not i in r: continue\r\n r.remove(i)\r\n h += p[i]\r\n if w[i] == d: k += 1\r\n elif w[i] < d: d, k = w[i], 1\r\n s += d\r\n t = (t * k) % m\r\nprint(s,t)", "import math\r\nimport sys\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom random import *\r\nfrom string import *\r\nfrom types import GeneratorType\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\nMOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef find_SCC(graph):\r\n SCC, S, P = [], [], []\r\n depth = [0] * len(graph)\r\n \r\n stack = list(range(len(graph)))\r\n while stack:\r\n node = stack.pop()\r\n if node < 0:\r\n d = depth[~node] - 1\r\n if P[-1] > d:\r\n SCC.append(S[d:])\r\n del S[d:], P[-1]\r\n for node in SCC[-1]:\r\n depth[node] = -1\r\n elif depth[node] > 0:\r\n while P[-1] > depth[node]:\r\n P.pop()\r\n elif depth[node] == 0:\r\n S.append(node)\r\n P.append(len(S))\r\n depth[node] = len(S)\r\n stack.append(~node)\r\n stack += graph[node]\r\n return SCC[::-1]\r\n\r\ndef solve() -> None:\r\n n = sint()\r\n cost = ints()\r\n g = [[] for _ in range(n)]\r\n for _ in range(sint()):\r\n u, v = mint()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n \r\n scc = find_SCC(g)\r\n a, b = 0, 1\r\n for s in scc:\r\n mn, cnt = math.inf, 0\r\n for i in s:\r\n if cost[i] < mn:\r\n mn = cost[i]\r\n cnt = 1\r\n elif cost[i] == mn:\r\n cnt += 1\r\n a += mn\r\n b = b * cnt % MOD\r\n print(a, b)\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "def main():\r\n n = int(input())\r\n cseq = read_ints()\r\n m = int(input())\r\n edges = [read_ints() for _ in range(m)]\r\n\r\n graph = [[] for _ in range(n)]\r\n for u, v in edges:\r\n u -= 1\r\n v -= 1\r\n graph[u].append(v)\r\n\r\n MOD = 1_000_000_007\r\n sccs = find_SCC(graph)\r\n ways = 1\r\n cost = 0\r\n for scc in sccs:\r\n costs = [cseq[node] for node in scc]\r\n min_cost = min(costs)\r\n cost += min_cost\r\n ways *= costs.count(min_cost)\r\n ways %= MOD\r\n\r\n print(cost, ways)\r\n\r\n\r\ndef find_SCC(graph):\r\n SCC, S, P = [], [], []\r\n depth = [0] * len(graph)\r\n\r\n stack = list(range(len(graph)))\r\n while stack:\r\n node = stack.pop()\r\n if node < 0:\r\n d = depth[~node] - 1\r\n if P[-1] > d:\r\n SCC.append(S[d:])\r\n del S[d:], P[-1]\r\n for node in SCC[-1]:\r\n depth[node] = -1\r\n elif depth[node] > 0:\r\n while P[-1] > depth[node]:\r\n P.pop()\r\n elif depth[node] == 0:\r\n S.append(node)\r\n P.append(len(S))\r\n depth[node] = len(S)\r\n stack.append(~node)\r\n stack += graph[node]\r\n return SCC[::-1]\r\n\r\n\r\ndef input(): return next(test).strip()\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n test = iter(sys.stdin.readlines())\r\n\r\n main()\r\n" ]

[ "from math import ceil\r\n\r\ndef solution(n, level):\r\n\tmax_jump = ceil(n / 4) - 1\r\n\tplatforms = [i for i in range(n) if level[i] == '*']\r\n\tans = any('*****' in level[start::jump] for jump in range(1, max_jump + 1) for start in platforms)\r\n\treturn ('no', 'yes')[ans]\r\n\r\nn = int(input())\r\nlevel = input()\r\nprint(solution(n, level))", "a=int(input())\r\nk=input()\r\nb=[i for i in range(a) if k[i]=='*']\r\nfor i in b:\r\n for j in range(1,101):\r\n ok=1\r\n for x in range(1,5):\r\n if i+j*x not in b:ok=0;break\r\n if ok:exit(print(\"yes\"))\r\nprint(\"no\")", "n=int(input())\r\ns=input()\r\nfor i in range(n) :\r\n if s[i]==\"*\" :\r\n for j in range(1,50) :\r\n if i+j*4<n :\r\n if s[i]==s[i+j]==s[i+2*j]==s[i+3*j]==s[i+4*j] :\r\n print(\"yes\")\r\n exit()\r\nprint(\"no\")\r\n \r\n \r\n \r\n", "__author__ = 'nthieu6'\r\n\r\nn, s = int(input()), input()\r\nfor i in range(n):\r\n for j in range(1, n + 1):\r\n if i + 4 * j < n and s[i] == s[i + j] == s[i + 2 * j] == s[i + 3 * j] == s[i + 4 * j] == '*':\r\n print('yes')\r\n exit()\r\nprint('no')", "n,s,r=int(input()),input(),range\r\nprint(['yes','no'][all('.'in s[i:i+5*j:j]for i in r(n-4)for j in r(1,(n-i+3)//4))])", "#fin = open(\"input.txt\")\n#n = int(fin.readline())\n#s = list(fin.readline())\nn = int(input())\ns = list(input())\nF = False\nfor k in range(1, (n + 3) // 4 + 1):\n\tfor i in range(n - 3):\n\t\t#print(i)\n\t\tflag = True\n\t\tfor j in range(5):\n\t\t\t#print(i + j * k + 1, end = \" \")\n\t\t\tif i + j * k >= n or s[i + j * k] == \".\":\n\t\t\t\tflag = False\n\t\t#print(flag)\n\t\tif flag:\n\t\t\tF = True\n\t\t\tbreak\n\tif F:\n\t\tbreak\nif F:\n\tprint(\"yes\")\nelse:\n\tprint(\"no\")\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nfor i in range(1, n//4 + 1):\r\n for j in range(n-i*4):\r\n if s[j] == s[j+i] == s[j+2*i] == s[j+3*i] == s[j+4*i] == '*':\r\n print('yes')\r\n exit(0)\r\nelse:\r\n print('no')", "def solve(level):\n level_size = len(level)\n\n def check(k, l):\n c = 0\n while k + l < level_size and '*' == level[k+l]:\n c += 1\n k += l\n return c >= 4\n\n for i in range(level_size):\n if '*' == level[i]:\n for j in range(i+1, level_size):\n if '*' == level[j] and check(i, j-i):\n return 'yes'\n return 'no'\n\n\ninput()\nprint(solve(input().strip()))\n", "n = int(input())\narr = list(input())\nans = False\nfor i in range(n):\n if arr[i] == \"*\":\n for j in range(1, n // 4 + 1):\n x = 0\n for z in range(i, n, j):\n if arr[z] == \"*\":\n x += 1\n else:\n break\n if x >= 5:\n ans = True\nif ans:\n print(\"yes\")\nelse:\n print(\"no\")", "from sys import stderr\n\nn = int(input())\nlevel = input().strip()\n\ngood = False\n\nmax_jump_size = (n - 5) // 4\n\nfor jump_len in range(max_jump_size + 1):\n for startIdx in range(n - 4 - jump_len*4):\n for i in range(5):\n if level[startIdx + i*jump_len + i] == \".\":\n #print(\"startIdx: {} jump_len: {} i: {}\".format(startIdx, jump_len, i), file=stderr)\n break\n else:\n good = True\n if good:\n break\n if good:\n break\n\nprint(\"yes\" if good else \"no\")\n", "kk=0\r\nx = int(input())\r\ny = input()\r\nz = [i for i in range(len(y)) if y[i] == '*']\r\nfor i in range(0, 100):\r\n for j in range(1, 100):\r\n if i in z and i+j in z and i+2*j in z and i+3*j in z and i+4*j in z:\r\n kk=1\r\nif kk==1:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n", "n = int(input())\r\nline = input()\r\ncheck = False\r\nfor i in range(1, (n // 4) + 1):\r\n for j in range((n - i * 4)):\r\n if line[j] == \"*\":\r\n if line[j] == line[j + i] == line[j + 2 * i] == line[j + 3 * i] == line[j + 4 * i]:\r\n print(\"yes\")\r\n check = True\r\n break\r\n if check:\r\n break\r\nif not check:\r\n print(\"no\")", "from sys import stdin\r\n\r\nn, lev = int(stdin.readline()), stdin.readline()\r\nres = any(lev[start::step][:5] == '*****' for start in range(0, n) for step in range(1, int(n/4)+1))\r\nprint(('no','yes')[res])", "n = int(input())\nlevel = input().strip()\nfor l in range(1, n + 1):\n for i in range(n - l + 1):\n for j in range(5):\n if i + l * j >= n or level[i + l * j] == '.':\n break\n else:\n print('yes')\n exit(0)\nprint('no')\n", "n = int(input())\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i] == '*':\r\n j = 1\r\n f = False\r\n while i + j*4 < len(s):\r\n for k in range(1, 5):\r\n if s[i] != s[i+k*j]:\r\n break\r\n else:\r\n f = True\r\n break\r\n j += 1\r\n if f:\r\n print('yes')\r\n break\r\nelse:\r\n print('no')", "from sys import stdin, stdout\ndef main():\n n = int(stdin.readline())\n s = stdin.readline()\n for i in range(n):\n if s[i] == '*':\n for j in range(1, (n - i) // 4 + 1):\n if i + j * 4 < n and s[i] == s[i + j] == s[i + j + j] == s[i + 3 * j] == s[i + j * 4]:\n stdout.write('yes')\n exit()\n stdout.write('no')\nmain()", "i=int(input())\r\ns=[True if x =='*' else False for x in input()]\r\nans='no'\r\nfor y in range(1,i//4+1):\r\n for x in range(0,i-(y*4)):\r\n if all(s[x+(y*z)] for z in range(0,5)): ans='yes'\r\nprint(ans)", "import itertools\r\ndef king():\r\n n= int(input())\r\n s= input()\r\n a= []\r\n for i in range(len(s)):\r\n if s[i]== \"*\":\r\n a.append(i+1)\r\n \r\n #print(a)\r\n if len(a)< 5:\r\n print(\"no\")\r\n return\r\n for arr in itertools.combinations(a, 5):\r\n arr= sorted(arr)\r\n mine= []\r\n for i in range(4):\r\n mine.append(arr[i+1]- arr[i])\r\n if len(set(mine))== 1:\r\n print(\"yes\")\r\n return\r\n \r\n print(\"no\")\r\n return\r\nking()", "I=input\r\nR=range\r\nn=int(I())\r\ns=I()\r\nprint(['no','yes'][any(max(map(len,s[j::i+1].split('.')))>4for i in R(n//4)for j in R(i+1))])", "import collections\n\n\ninput()\nm = collections.defaultdict(set)\nfor i, ch in enumerate(input()):\n\n if ch == \"*\":\n\n m[i]\n for j in tuple(m):\n\n if i != j:\n\n m[min(i, j)].add(max(i, j) - min(i, j))\n\nfor node in sorted(m):\n\n for size in m[node]:\n\n count = 0\n current_node = node\n while count != 4:\n\n if size in m[current_node]:\n\n current_node += size\n count += 1\n\n else:\n\n break\n\n if count == 4:\n\n print(\"yes\")\n exit()\n\nprint(\"no\")\n", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nn = int(input())\ns = input()\n\nfor i in range(n):\n for j in range(1, n):\n t = s[i::j]\n if t.find('*'*5) != -1:\n print('yes')\n exit()\n\nprint('no')\n", "n = int(input())\ns = input() + '.' * 600\n\nhas = False\nfor dif in range(1, 101):\n for st in range(100):\n if s[st] == s[st + dif] == s[st + 2 * dif] == s[st + 3 * dif] == s[st + 4 * dif] == '*':\n has = True\n\nprint('yes' if has else 'no')\n", "n = int(input())\r\ns = input()\r\nindices = []\r\nfor i in range(n):\r\n if s[i] == '*':\r\n indices.append(i)\r\nans = 'no'\r\nfor i in range(1, 26):\r\n for j in indices:\r\n if j+i in indices and j+2*i in indices and j+3*i in indices and j+4*i in indices:\r\n ans = 'yes'\r\n\r\nprint(ans)", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nlev = stdin.readline()\r\n\r\nres = False\r\nfor first_i in range(n-4):\r\n if lev[first_i] == '*':\r\n max_step = int((n-1-first_i)/4)\r\n for step_i in range(1,max_step+1):\r\n ver = (lev[first_i:first_i+step_i*4+1:step_i])\r\n res = all(l == '*' for l in ver)\r\n if res: break\r\n if res: break\r\n\r\nstdout.write(('no','yes')[res])", "\nn = int(input())\ns = input()\nflag = False\nfor i in range(n):\n\tfor k in range(1,n):\n\t\tif i + 4*k < n:\n\t\t\tif s[i] == '*' and s[i + k] == '*' and s[i + 2*k] == '*' and s[i + 3*k] == '*' and s[i + 4*k] == '*':\n\t\t\t\tflag = True \nif flag == True:\n\tprint('yes')\nelse:\n\tprint('no')", "import sys\r\nn = int (sys.stdin.readline())\r\ns = sys.stdin.readline().strip()\r\nres = 'no'\r\nfor start in range (n):\r\n for l in range (1,n):\r\n for j in range (start, start+l*5, l):\r\n if j >= n:\r\n break\r\n if s[j] == '.':\r\n break\r\n if j == start + l * 4:\r\n res = 'yes'\r\nprint (res)\r\n\r\n\r\n", "import sys\nn = int(input())\nS = input()\nfor l in range(n):\n if S[l] == \"*\":\n d = 1\n while l + 4 * d < n:\n if S[l + d] == S[l + 2 * d] == S[l + 3 * d] == S[l + 4 * d] == \"*\":\n print(\"yes\")\n sys.exit(0)\n d += 1\nprint(\"no\")\n\n\n", "n=int(input())\r\ns=input()\r\nprint('yes' if any(any(all(s[i+k*j]=='*' for k in range(5)) for j in range(1, (n-i+3)//4)) for i in range(n-4)) else 'no')", "n = int(input())\r\ns = input().strip()\r\n\r\nresult = False\r\nfor i in range(n-4):\r\n for j in range(1, (n - i - 1) // 4 + 1):\r\n #print(s[i:i + 4*j+1:j])\r\n if s[i:i + 4*j + 1:j] == '*****':\r\n result = True\r\nif result:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")\r\n ", "import sys, os\nimport fileinput\nn = int(input())\ns = input().strip()\n\nfor i in range(1, n + 1):\n\tfor j in range(1, n + 1):\n\t\tif j - 1 >= n or j - 1 + i >= n or j - 1 + 2*i >= n or j - 1 + 3*i >= n or j - 1 + 4*i >= n: break\n\t\tt = \"%s%s%s%s%s\" % (s[j - 1], s[j - 1 + i], s[j - 1 + 2*i], s[j - 1 + 3*i], s[j - 1 + 4*i])\n\t\tif t == \"*****\":\n\t\t\tprint(\"yes\")\n\t\t\tsys.exit(0)\n\nprint(\"no\")", "from math import ceil\r\nn, level = int(input()), input()\r\nprint(('no', 'yes')[any('*****' in level[start::jump] for jump in range(1, ceil(n / 4)) for start in [i for i in range(n) if level[i] == '*'])])", "def main():\r\n n = int(input())\r\n S = input()\r\n fl = 0\r\n for i in range(len(S)-3):\r\n if S[i] == '.':\r\n continue\r\n else:\r\n for j in range(1, len(S)//4+1):\r\n for k in range(5):\r\n if i+k*j >= len(S) or S[i+k*j] == '.':\r\n break\r\n else:\r\n fl = 1\r\n break\r\n if fl:\r\n break\r\n if fl:\r\n print('yes')\r\n else:\r\n print('no')\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\ns=input()\r\nif n<5:\r\n print(\"no\")\r\nelse:\r\n for l in range(1,n-3):\r\n ans=0\r\n for st in range(n):\r\n fl=0\r\n if s[st]=='.':\r\n continue\r\n else:\r\n cn=0\r\n for j in range(st+l,n,l):\r\n if s[j]=='.':\r\n fl=1\r\n cn=-1\r\n else:\r\n cn+=1\r\n if cn==4:\r\n fl=3\r\n break\r\n if fl==3:\r\n ans=1\r\n break\r\n if ans==1:\r\n break\r\n if ans==1:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")", "n = int(input())\r\ns = input().strip()\r\nfor i in range(n):\r\n\tDP = [0] * n\r\n\tfor j in range(n):\r\n\t\tif s[j] == \"*\":\r\n\t\t\tDP[j] = 1\r\n\t\t\tif j >= i and s[j - i] == '*':\r\n\t\t\t\tDP[j] += DP[j - i]\r\n\tif max(DP) >= 5:\r\n\t\t#print(i,max(DP))\r\n\t\tprint(\"yes\")\r\n\t\texit(0)\r\nprint('no')", "n = int(input())\r\npl = input()\r\ndp = []\r\nfor i in range(n + 1):\r\n temp = []\r\n for j in range(n + 1):\r\n temp.append(-1)\r\n dp.append(temp)\r\nbest = 0\r\nfor i,v in enumerate(pl):\r\n if v == '.':\r\n continue\r\n for j in range(1,n + 1,1):\r\n dp[j][i] = (dp[j][i - j] + 1) if(i - j >= 0 and dp[j][i - j] != -1) else 0\r\n best = max(best,dp[j][i])\r\n if best == 4:\r\n break\r\n if best == 4:\r\n break\r\nprint('no' if best < 4 else 'yes')", "n = int(input())\r\nstr = input()\r\n\r\nar = []\r\n\r\nfor i in range(n):\r\n if str[i] == '*':\r\n ar.append(i)\r\n\r\nflag = False\r\n\r\nif len(ar) < 5:\r\n print('no')\r\n\r\nelse:\r\n for i0 in range(len(ar)-4):\r\n \r\n i1 = i0+1\r\n while i1 < len(ar)-3:\r\n diff = ar[i1] - ar[i0]\r\n \r\n i2 = i1+1\r\n while i2 < len(ar)-2:\r\n if ar[i2] - ar[i1] > diff:\r\n break\r\n elif ar[i2] - ar[i1] == diff:\r\n \r\n i3 = i2+1\r\n while i3 < len(ar)-1:\r\n if ar[i3] - ar[i2] > diff:\r\n break\r\n elif ar[i3] - ar[i2] == diff:\r\n \r\n i4 = i3+1\r\n while i4 < len(ar):\r\n if ar[i4] - ar[i3] > diff:\r\n break\r\n elif ar[i4] - ar[i3] == diff:\r\n flag = True\r\n break\r\n i4 += 1\r\n if flag:\r\n break\r\n i3 += 1\r\n if flag:\r\n break\r\n i2 += 1\r\n if flag:\r\n break\r\n i1 += 1\r\n if flag:\r\n break\r\n if flag:\r\n print('yes')\r\n else:\r\n print('no')\r\n", "from collections import defaultdict, deque, Counter, OrderedDict\r\nfrom bisect import insort, bisect_right, bisect_left\r\nimport threading, sys\r\n\r\ndef main():\r\n n = int(input())\r\n s = [c for c in input()]\r\n pos = []\r\n for i,c in enumerate(s):\r\n if c == '*':\r\n pos.append(i+1)\r\n arr = [0]*(102)\r\n for c in pos: arr[c] = 1\r\n for i in range(1,101):\r\n for k in pos:\r\n check = 0\r\n for j in range(5):\r\n if k + j*i < 102:\r\n check += arr[k + j*i]\r\n if check == 5:\r\n print(\"yes\")\r\n exit(0)\r\n print(\"no\")\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\"\"\"\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n", "#!/usr/bin/env python\n# jump.py - Codeforces <!!! NNNA !!!> 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\"\"\"\nLet's call a level to be good if you can perform a sequence of four jumps of\nthe same length or in the other words there must be a sequence consisting of\nfive platforms so that the intervals between consecutive platforms are of the\nsame length. Given the scheme of the level, check if it is good.\n\nInput\n\nThe first line contains integer n (1<=n<=100) - the number of segments on\nthe level. Next line contains the scheme of the level represented as a string\nof n characters '*' and '.'.\n\nOutput\n\nIf the level is good, print the word \"yes\" (without the quotes), otherwise\nprint the word \"no\" (without the quotes).\n\n\"\"\"\n\n# Standard libraries\nimport unittest\nimport sys\nimport re\nimport random\n\n# Additional libraries\n\n\n###############################################################################\n# Jump Class\n###############################################################################\n\n\nclass Jump:\n \"\"\" Jump representation \"\"\"\n\n def __init__(self, args):\n \"\"\" Default constructor \"\"\"\n\n self.args = args\n\n self.size = args[0]\n self.maze = args[1]\n self.dist = []\n self.cur_dist = []\n\n self.calc_dist()\n\n def calc_dist(self):\n distance = 0\n start = 0\n for m in self.maze:\n if not start:\n if m:\n start = 1\n continue\n distance += 1\n if m:\n self.dist.append(distance)\n distance = 0\n\n def next(self):\n self.cur_dist[1] = self.cur_dist[0] + self.cur_dist[1]\n del(self.cur_dist[0])\n\n def iterate(self):\n len = self.cur_dist[0]\n hop_len = 0\n hops = 0\n for m in self.cur_dist:\n hop_len += m\n if hop_len == len:\n hop_len = 0\n hops += 1\n if hops == 4:\n return 1\n if hop_len > len:\n return 0\n return 0\n\n def iterate_all(self):\n while len(self.cur_dist) > 1:\n if self.iterate():\n return 1\n self.next()\n return 0\n\n def calculate(self):\n \"\"\" Main calcualtion function of the class \"\"\"\n\n for i in range(len(self.dist)):\n self.cur_dist = list(self.dist[i:])\n if self.iterate_all():\n return \"yes\"\n return \"no\"\n\n###############################################################################\n# Executable code\n###############################################################################\n\n\ndef decode_inputs(inputs):\n \"\"\" Decoding input string tuple into base class args tuple \"\"\"\n\n # Decoding first input into an integer\n size = int(inputs[0])\n\n # Decoding second input into a list of ints\n maze = [0 if i == \".\" else 1 for i in inputs[1]]\n args = (size, maze)\n\n return args\n\n\ndef calculate(inputs):\n \"\"\" Base class calculate method wrapper \"\"\"\n return Jump(decode_inputs(inputs)).calculate()\n\n\ndef main():\n \"\"\" Main function. Not called by unit tests \"\"\"\n\n # Read test input string tuple\n inputs = (input(), input())\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(decode_inputs((\"4\", \".*.*\")), (4, [0, 1, 0, 1]))\n\n def test_Jump_class__basic_functions(self):\n \"\"\" Jump class basic functions testing \"\"\"\n d = Jump((7, [0, 1, 0, 1, 1, 0, 1]))\n self.assertEqual(d.size, 7)\n\n # Distance listb\n self.assertEqual(d.dist, [2, 1, 2])\n\n # Next dist merge with the next one\n d.cur_dist = [2, 1, 2]\n d.next()\n self.assertEqual(d.cur_dist, [3, 2])\n\n # Iterate function, 1 - success\n d.cur_dist = [2, 2, 2, 2]\n self.assertEqual(d.iterate(), 1)\n\n d.cur_dist = [2, 1, 1, 2, 2]\n self.assertEqual(d.iterate(), 1)\n\n d.cur_dist = [2, 3]\n self.assertEqual(d.iterate(), 0)\n\n # Iterate all possible cur_dist\n d.cur_dist = [2, 1, 3, 3, 3]\n self.assertEqual(d.iterate_all(), 1)\n d.cur_dist = [2, 1, 3, 3, 2]\n self.assertEqual(d.iterate_all(), 0)\n\n # Calculate\n d.dist = [20, 2, 2, 2, 2]\n # self.assertEqual(d.calculate(), \"yes\")\n\n def test_calculate(self):\n \"\"\" Main calculation function \"\"\"\n\n # Sample test 1\n self.assertEqual(calculate((\"16\", \".**.*..*.***.**.\")), \"yes\")\n\n # Sample test2\n self.assertEqual(calculate((\"11\", \".*.*...*.*.\")), \"no\")\n\nif __name__ == \"__main__\":\n if sys.argv[-1] == \"-ut\":\n unittest.main(argv=[\" \"])\n main()\n", "# 526A\r\n# O(n^2) time\r\n# θ(n) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n = read()\r\n s = read(0)\r\n for i in range(n - 4):\r\n j = 1\r\n while i + j * 4 < n:\r\n if s[i] == '*' and s[i + j] == '*' and s[i + 2 * j] == '*' and s[i + 3 * j] == '*' and s[i + 4 * j] == '*':\r\n return 'yes'\r\n j += 1\r\n return 'no'\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nwrite(main())", "from math import ceil\r\n\r\ndef solution(n, level):\r\n\tmax_jump = ceil(n / 4) - 1\r\n\tplatforms = [i for i in range(n) if level[i] == '*']\r\n\tif platforms:\r\n\t\tfor platform in platforms:\r\n\t\t\tfor jump in range(1, max_jump + 1):\r\n\t\t\t\ttry:\r\n\t\t\t\t\tif level[platform + jump] == '*' and level[platform + jump*2] == '*' and level[platform + jump*3] == '*' and level[platform + jump*4] == '*':\r\n\t\t\t\t\t\treturn 'yes'\r\n\t\t\t\texcept IndexError:\r\n\t\t\t\t\tbreak\r\n\treturn 'no'\r\n\r\nn = int(input())\r\nlevel = input()\r\nprint(solution(n, level))", "\r\nn = int(input())\r\nch = input()\r\nans = False\r\nfor i in range(n):\r\n if not ans:\r\n for j in range(1,(n-i+3)//4):\r\n if not ans:\r\n ans = True\r\n for k in range(5):\r\n if ch[i+k*j]=='.':\r\n ans = False\r\n break\r\nprint ('yes' if ans else 'no')\r\n \r\n ", "def main():\r\n n = int(input())\r\n s = input().rstrip()\r\n ar = [0] * n\r\n for i in range(n):\r\n for l in range(1, n):\r\n j = i\r\n sum1 = 0\r\n while j >= 0:\r\n if s[j] == '*':\r\n sum1 += 1\r\n else:\r\n break\r\n j -= l\r\n if sum1 >= 5:\r\n print('yes')\r\n return\r\n print('no')\r\nmain()\r\n\r\n ", "n,s,r=int(input()),input(),range\r\nprint(['no','yes'][any(all(s[i+k*j]=='*'for k in r(5))for i in r(n-4)for j in r(1,(n-i+3)//4))])", "n=int(input())\r\ns=input()\r\nprint('yes' if any(all(s[i+k*j]=='*'for k in range(5))for i in range(n-4)for j in range(1,(n-i+3)//4))else'no')", "n = int(input())\r\ns = input()\r\n\r\nans = \"no\"\r\nfor i in range(len(s)):\r\n if(s[i]=='.'):\r\n continue\r\n for d in range(1, 100):\r\n cnt = 1\r\n j = i + d\r\n while(cnt < 5):\r\n if(j >= len(s)):\r\n break\r\n if(s[j] == '.'):\r\n break\r\n cnt+=1\r\n j+=d\r\n if(cnt==5):\r\n ans = \"yes\"\r\n break\r\n if(ans==\"yes\"):\r\n break\r\n \r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\nprint(['no','yes'][any(all(s[i+k*j]=='*' for k in range(5)) for i in range(n-4) for j in range(1,(n-i+3)//4))])", "n = int(input())\r\ns = input()\r\nfor ln in range(1, n):\r\n for i in range(n):\r\n if i + ln * 4 < n:\r\n if s[i] == s[i + ln] == s[i + ln * 2] == s[i + ln * 3] == s[i + ln * 4] == '*':\r\n print('yes')\r\n exit()\r\nprint('no')", "def king(s):\r\n l = []\r\n for i in range(len(s)):\r\n if s[i] == '*':\r\n l.append(i)\r\n if len(l) < 5:\r\n print('no')\r\n else:\r\n k = (max(x for x in l)-min(x for x in l))//4\r\n def space_eq(s, j):\r\n ans = False\r\n for i in s:\r\n if (i+j) in s and (i+2*j) in s and (i+3*j) in s and (i+4*j) in s:\r\n ans = True\r\n break\r\n return ans\r\n ans = False\r\n for j in range(1, k+1):\r\n if space_eq(l, j) == True:\r\n ans = True\r\n break\r\n if ans == True:\r\n print('yes')\r\n else:\r\n print('no')\r\n\r\nn = int(input())\r\ns = input()\r\nassert len(s) == n, 'Incorrect Input'\r\nking(s)", "n,s = int(input()),input()\r\nfor i in range(1,len(s)):\r\n for j in range(len(s)):\r\n if s[j::i][:5] == '*' * 5:\r\n print(\"yes\")\r\n exit(0)\r\nprint (\"no\")", "n = int(input())\r\narr = list(input())\r\nflag = False\r\nfor i in range(n):\r\n if arr[i] == '*':\r\n for d in range(1, n):\r\n begin = i\r\n for k in range(4):\r\n if (begin + d) < n and arr[begin + d] == '*':\r\n begin += d\r\n else:\r\n break\r\n else:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print('yes')\r\nelse:\r\n print('no')", "n=int(input())\r\ns=input()\r\nprint('yes' if any(all(s[i+k*j]=='*' for k in range(5)) for i in range(n-4) for j in range(1, (n-i+3)//4)) else 'no')", "def check():\n for i in range(n):\n for j in range(1, n-i-1):\n num = 0\n pos = i\n while (pos < n) and (a[pos] == '*'):\n num += 1\n pos += j\n if num == 5:\n return True\n return False\n \nn = int(input())\na = input()\nif check():\n print('yes')\nelse:\n print('no')", "n = int(input())\r\ns = input().rstrip()\r\nd = [[1 for i in range(n)] for i in range(n)]\r\nmaxx = 0\r\nfor i in range(n):\r\n if s[i] == '.':\r\n continue\r\n maxx = max(maxx, max(d[i]))\r\n for j in range(n):\r\n if i + j >= n:\r\n break\r\n d[i + j][j] = max(d[i + j][j], d[i][j] + 1)\r\nprint('yes' if maxx >= 5 else 'no')", "n = int(input())\r\ns=str(input())\r\nif (s.count(\"*\")<=4):\r\n print(\"no\")\r\n exit()\r\nfor i in range(n):\r\n for j in range(1, n + 1):\r\n if i + 4 * j < n and s[i] == s[i + j] == s[i + 2 * j] == s[i + 3 * j] == s[i + 4 * j] == '*':\r\n print('yes')\r\n exit()\r\nprint('no')" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nif n >= m:\r\n s = [list(input().rstrip()) for _ in range(n)]\r\nelse:\r\n s = [[] for _ in range(m)]\r\n for _ in range(n):\r\n s0 = list(input().rstrip())\r\n for j in range(m):\r\n s[j].append(s0[j])\r\n n, m = m, n\r\npow2 = [1]\r\nfor _ in range(m):\r\n pow2.append(2 * pow2[-1])\r\nl = pow2[m]\r\ndp0 = [[0] * (2 * l) for _ in range(2)]\r\ndp0[0][0] = 1\r\nfor s0 in s:\r\n for i in range(m):\r\n pi = pow2[i]\r\n dp1 = [[0] * (2 * l) for _ in range(2)]\r\n if s0[i] & 2:\r\n for j in range(2):\r\n for k in range(l):\r\n if not k & pi:\r\n dp1[j][k ^ pi + l] += dp0[j][k] + dp0[j][k + l]\r\n dp1[j][k ^ pi + l] %= mod\r\n dp1[j][k + l] += dp0[j][k + l]\r\n dp1[j][k + l] %= mod\r\n else:\r\n dp1[j][k + l] += dp0[j][k] + 2 * dp0[j][k + l]\r\n dp1[j][k + l] %= mod\r\n dp1[j][k] += dp0[j][k]\r\n dp1[j][k] %= mod\r\n for j in range(l):\r\n if not j & pi:\r\n dp1[1][j] += dp0[0][j]\r\n dp1[1][j] %= mod\r\n else:\r\n u = (l - 1) ^ pi\r\n for j in range(2):\r\n for k in range(l):\r\n dp1[j][k & u] += dp0[j][k] + dp0[j][k + l]\r\n dp1[j][k & u] %= mod\r\n dp0 = [dp1[0], dp1[1]]\r\n for j in range(2):\r\n for k in range(l):\r\n dp0[j][k] += dp0[j][k + l]\r\n dp0[j][k] %= mod\r\n dp0[j][k + l] = 0\r\nans = 0\r\nfor dp in dp0:\r\n for i in dp:\r\n ans += i\r\n ans %= mod\r\nprint(ans)", "import sys,io,os\r\ntry:Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nexcept:Z=lambda:sys.stdin.readline().encode()\r\nY=lambda:map(int,Z().split())\r\nM=10**9+7\r\ntry:\r\n import __pypy__\r\n int_add=__pypy__.intop.int_add\r\n int_sub=__pypy__.intop.int_sub\r\n int_mul=__pypy__.intop.int_mul\r\n def make_mod_mul(mod=M):\r\n fmod_inv=1.0/mod\r\n def mod_mul(a,b,c=0):\r\n res=int_sub(\r\n int_add(int_mul(a,b),c),\r\n int_mul(mod,int(fmod_inv*a*b+fmod_inv*c)),\r\n )\r\n if res>=mod:return res-mod\r\n elif res<0:return res+mod\r\n else:return res\r\n return mod_mul\r\n mod_mul=make_mod_mul()\r\nexcept:\r\n def mod_mul(a,b):return(a*b)%M\r\ndef mod_add(a,b):\r\n v=a+b\r\n if v>=M:v-=M\r\n if v<0:v+=M\r\n return v\r\ndef mod_sum(a):\r\n v=0\r\n for i in a:v=mod_add(v,i)\r\n return v\r\nn,m=Y();a=[]\r\nfor _ in range(n):a.append([*map(lambda x:x==120,Z().strip())])\r\nif m>n:a=[[*i]for i in zip(*a)];m,n=n,m\r\nN=1<<m;NN=N<<1;NNN=NN+N;L=N<<2;nd=[0]*L;nd[0]=1\r\nfor i in range(n):\r\n for j in range(m):\r\n d=nd;nd=[0]*L;p=1<<j\r\n if a[i][j]:\r\n for x in range(NN):\r\n d[x]=mod_add(d[x],d[x+NN])\r\n for x in range(NN):\r\n if x&p:nd[x^p]=mod_add(d[x],d[x^p])\r\n continue\r\n if not j:\r\n for x in range(NN):\r\n d[x]=mod_add(d[x],d[x+NN])\r\n d[x+NN]=0\r\n for x in range(N):\r\n if x&p:\r\n nd[x]=mod_add(nd[x],d[x])\r\n nd[x+N]=mod_add(nd[x+N],d[x+N])\r\n nd[x+NN]=mod_add(nd[x+NN],d[x+NN])\r\n nd[x+NNN]=mod_add(nd[x+NNN],d[x+NNN])\r\n nd[x+NN]=mod_add(nd[x+NN],d[x])\r\n nd[x+NNN]=mod_add(nd[x+NNN],d[x+N])\r\n nd[x+NN]=mod_add(nd[x+NN],d[x+NN])\r\n nd[x+NNN]=mod_add(nd[x+NNN],d[x+NNN])\r\n else:\r\n nd[x+N]=mod_add(nd[x+N],d[x])\r\n nd[x+NN]=mod_add(nd[x+NN],d[x+NN])\r\n nd[x+NNN]=mod_add(nd[x+NNN],d[x+NNN])\r\n nd[x|p+NN]=mod_add(nd[x|p+NN],d[x])\r\n nd[x|p+NNN]=mod_add(nd[x|p+NNN],d[x+N])\r\n nd[x|p+NN]=mod_add(nd[x|p+NN],d[x+NN])\r\n nd[x|p+NNN]=mod_add(nd[x|p+NNN],d[x+NNN])\r\nprint(mod_sum(nd))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nif n >= m:\r\n s = [list(input().rstrip()) for _ in range(n)]\r\nelse:\r\n s = [[] for _ in range(m)]\r\n for _ in range(n):\r\n s0 = list(input().rstrip())\r\n for j in range(m):\r\n s[j].append(s0[j])\r\n n, m = m, n\r\nfor _ in range(2):\r\n while s and not min(s[-1]) & 2:\r\n s.pop()\r\n s.reverse()\r\npow2 = [1]\r\nfor _ in range(m):\r\n pow2.append(2 * pow2[-1])\r\nl = pow2[m]\r\ndp0 = [0] * (2 * l)\r\ndp1 = [0] * (2 * l)\r\ndp0[0] = 1\r\nfor s0 in s:\r\n for i in range(m):\r\n pi = pow2[i]\r\n dp2 = [0] * (2 * l)\r\n dp3 = [0] * (2 * l)\r\n if s0[i] & 2:\r\n for j in range(l):\r\n if not j & pi:\r\n dp2[j ^ pi + l] += dp0[j] + dp0[j + l]\r\n dp2[j ^ pi + l] %= mod\r\n dp2[j + l] += dp0[j + l]\r\n dp2[j + l] %= mod\r\n dp3[j] += dp0[j]\r\n dp3[j] %= mod\r\n dp3[j ^ pi + l] += dp1[j] + dp1[j + l]\r\n dp3[j ^ pi + l] %= mod\r\n dp3[j + l] += dp1[j + l]\r\n dp3[j + l] %= mod\r\n else:\r\n dp2[j + l] += dp0[j] + 2 * dp0[j + l]\r\n dp2[j + l] %= mod\r\n dp2[j] += dp0[j]\r\n dp2[j] %= mod\r\n dp3[j + l] += dp1[j] + 2 * dp1[j + l]\r\n dp3[j + l] %= mod\r\n dp3[j] += dp1[j]\r\n dp3[j] %= mod\r\n else:\r\n k = (l - 1) ^ pi\r\n for j in range(l):\r\n dp2[j & k] += dp0[j] + dp0[j + l]\r\n dp2[j & k] %= mod\r\n dp3[j & k] += dp1[j] + dp1[j + l]\r\n dp3[j & k] %= mod\r\n dp0 = dp2\r\n dp1 = dp3\r\n for j in range(l):\r\n dp0[j] += dp0[j + l]\r\n dp0[j] %= mod\r\n dp0[j + l] = 0\r\n dp1[j] += dp1[j + l]\r\n dp1[j] %= mod\r\n dp1[j + l] = 0\r\nans = 0\r\nfor i in dp0:\r\n ans += i\r\n ans %= mod\r\nfor i in dp1:\r\n ans += i\r\n ans %= mod\r\nprint(ans)" ]

[ "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n if lst[0] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n zeros = lst.count(0)\r\n if zeros == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def solve():\r\n m = int(input())\r\n buttons = list(map(int, input().strip().split()))\r\n\r\n countOpen = buttons.count(0)\r\n if (countOpen == 1 and m > 1) or (countOpen == 0 and m == 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nsolve()", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfastenedCount = 0\r\nfor i in range(n):\r\n if arr[i] == 1:\r\n fastenedCount += 1\r\nif n == 1:\r\n if fastenedCount == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if fastenedCount == n - 1:\r\n print('YES')\r\n else:\r\n print('NO')", "x = int(input())\r\ny = list(map(int, input().split(' ')))\r\nif (y.count(1) == x-1 or y == [1]) and y != [0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = []\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in a:\r\n if (i == 0):\r\n cnt += 1\r\n\r\nif ((n == 1 and cnt == 0) or (n > 1 and cnt == 1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\n\r\none = arr.count(1)\r\n\r\nif n==1:\r\n print(\"YES\" if one else \"NO\")\r\nelse:\r\n print(\"YES\" if n-one==1 else \"NO\")", "n = int(input())\r\nl = list(map(int , input().split())) \r\nx = sum(l) \r\nif n == 1 and x== 1:\r\n print(\"YES\") \r\nelif n == 1 and x == 0 :\r\n print(\"NO\")\r\nelif x != n - 1 :\r\n print(\"NO\")\r\nelse: \r\n print(\"YES\")", "n = int(input()); arr = list(map(int, input().split()))\r\nprint('YNEOS'[not(arr.count(0))==1 if len(arr)>1 else arr.count(0)==1::2] )", "n = int(input())\r\nbuttons = list(map(int , input().split()))\r\nif n==1 and buttons==[1]:\r\n print(\"YES\")\r\nelif n==1 and buttons==[0]:\r\n print(\"NO\")\r\nelse:\r\n if buttons.count(0)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\nl=[int(x) for x in input().split()]\nif n==1:\n if l[0]==1:\n print(\"YES\")\n else:\n print(\"NO\")\n\nelse:\n if l.count(0)==1:\n print(\"YES\")\n else:\n print(\"NO\")", "n = int(input())\na = list(map(int, input().split()))\nif (a.count(0) == 1 and n > 1) or (n == 1 and a[0] == 1):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "if __name__ == \"__main__\":\n n, x = int(input()), [int(i) for i in input().split()]\n if n == 1:\n print('YES' if x[0] == 1 else 'NO')\n elif sum(x) == n - 1:\n print('YES')\n else:\n print('NO')\n", "# number of buttons\r\nn = int(input())\r\n# buttons matrix\r\na = list(map(int, input().split()))\r\nflag = False\r\ncount_zero = 0\r\nfor i in range (n):\r\n if a[i] == 0:\r\n count_zero += 1\r\nif n == 1 and count_zero == 0:\r\n flag = True\r\nif n > 1 and count_zero == 1:\r\n flag = True\r\nprint(\"YES\" if flag == True else \"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += (a[i] == 0)\r\n\r\nif (cnt == 1 and n > 1) or (cnt == 0 and n == 1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nm = sum(list(map(int,input().split())))\r\nif (n is 1 and m is 1) or n-m is 1 and n is not 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve():\r\n n = int(input().strip())\r\n arr = list(map(int, input().strip().split()))\r\n itr = 0\r\n\r\n for i in arr:\r\n if i == 0:\r\n itr += 1\r\n\r\n if n == 1 and itr == 0:\r\n print(\"YES\")\r\n return 0\r\n \r\n if (itr == 1) and (n > 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nsolve()\r\n", "n=int(input())\r\nv=sorted(input().replace(\" \",\"\"))\r\nif len(v)==1:\r\n print(\"YES\" if v[0]==\"1\" else \"NO\")\r\nelse:\r\n print(\"YES\" if v[0:2]==[\"0\",\"1\"] else \"NO\")", "size = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif size == 1:\r\n if arr[0] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n count = 0\r\n for index in range(size):\r\n if arr[index] == 0:\r\n count += 1\r\n if count != 1:\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 len(a)==1:\r\n if a[0]==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n a.sort()\r\n if a[0]==1:\r\n print(\"NO\")\r\n else:\r\n if a[1]==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\nt=0\r\nfor i in range (len(a)):\r\n if a[i]==0:\r\n t+=1\r\nif n>1:\r\n if t>1 or t==0:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelif n==1:\r\n if t==0:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\na = input()\r\n\r\nif (n == 1 and a == \"1\"):\r\n result = \"YES\"\r\nelif (n == 1 and a == \"0\"):\r\n result = \"NO\"\r\nelse:\r\n a = a.split(\" \")\r\n check = 0 \r\n result = \"NO\"\r\n for i in range(n):\r\n if (a[i] == \"0\" and check == 0):\r\n check = 1\r\n result = \"YES\"\r\n elif (a[i] == \"0\" and check == 1):\r\n result = \"NO\"\r\n break\r\nprint(result)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nprint('YES' if min(1,int(input())-1) == input().split().count('0') else 'NO')", "n=int(input())\r\ns=[int(i) for i in input().split()]\r\nif n==1:\r\n for i in range(n):\r\n if s[i]==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n t=0\r\n for i in range(n):\r\n if s[i]==0:\r\n t=t+1\r\n if t==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\n\r\ndef check (a,n):\r\n count =0\r\n for i in range (n):\r\n if n == 1 and a[0] == 0:\r\n return print (\"NO\")\r\n if n == 1 and a[0]!=0: \r\n return print (\"YES\")\r\n if a[i] == 0:\r\n count +=1\r\n if count>=2 or count == 0:\r\n return print (\"NO\")\r\n else:\r\n return print(\"YES\")\r\ncheck (a,n)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif len(a) == 0:\r\n print(\"NO\")\r\nelif len(a) == 1 and a[0] == 1:\r\n print(\"YES\")\r\nelif len(a) == 1 and a[0] == 0:\r\n print(\"NO\")\r\nelse:\r\n cnt0 = a.count(0)\r\n if cnt0 == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(0,n):\r\n if arr[i] == 0:\r\n count += 1\r\n if count > 1:\r\n break\r\nif count == 1 and n > 1:\r\n print(\"YES\")\r\nelif n == 1 and count == 0:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "def check(n):\r\n if (n == 1):\r\n if (a[0] == 1):\r\n print(\"YES\")\r\n return\r\n else: \r\n print(\"NO\")\r\n return\r\n ans = 0\r\n for i in range(0, n):\r\n if (a[i] == 0): ans += 1\r\n if (ans == 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncheck(n)", "n = int(input())\r\narray = [int(i) for i in input().split()]\r\nif n == 1: \r\n if sum(array) == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse: \r\n if sum(array) == (n - 1):\r\n print('YES')\r\n else: \r\n print('NO')", "n = int(input())\r\n\r\nc = list(map(int, input().split()))\r\nif sum(c) == max(1, n - 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "num_cases = int(input())\n\na = [int(x) for x in input().split(' ')]\n\ncountZeros = 0\nfor x in a:\n if x == 0:\n countZeros += 1\n\nif num_cases == 1:\n print('YES') if countZeros == 0 else print('NO')\nelse:\n print('YES') if countZeros == 1 else print('NO')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l.count(0)\r\nif(n==1 and l[0]==1):\r\n print(\"YES\")\r\nelif(n==1 and l[0]!=1):\r\n print(\"NO\")\r\nelse:\r\n if(x==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nt=0\r\nif n==1:\r\n if a[0]==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n for i in range(n):\r\n if a[i]==1:\r\n t+=1\r\n if t==n-1:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nx = input().split()\r\nsumd = 0\r\nx = \"\".join(x)\r\nfor i in x:\r\n sumd += int(i)\r\nif n == 1:\r\n if sumd == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if sumd == (n-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nA = list(map(int, input().split()))\n\nfrom collections import Counter\nC = Counter(A)\nif n == 1:\n if C[1] == 1:\n print('YES')\n else:\n print('NO')\nelse:\n if C[1] == n-1:\n print('YES')\n else:\n print('NO')\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nif n == 1:\r\n if l.count(0) == 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n x = l.count(0)\r\n if x == 1:\r\n print(\"YES\")\r\n else:print(\"NO\")", "# Link: https://codeforces.com/problemset/problem/691/A\n# Name: Fashion in Berland\n# Easy\n# ======================================================\n\nif __name__ == '__main__':\n n = int(input())\n li = list(map(int, input().split()))\n sum_li = sum(li, 0)\n res = None\n if n == 1:\n if sum_li == 1:\n res = \"YES\"\n else:\n res = \"NO\"\n else:\n if sum_li == (n - 1):\n res = \"YES\"\n else:\n res = \"NO\"\n print(res)\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nans = 'YES' if len(s) > 1 and s.count(0) == 1 else 'YES' if len(s) == 1 and s.count(1) == 1 else 'NO'\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nbuttons_lst = list(map(int, input().strip().split()))\r\n\r\ncount_0 = 0\r\nfor button in buttons_lst:\r\n if button == 0:\r\n count_0 += 1\r\n\r\nif n == 1 and count_0 == 0:\r\n print('YES')\r\nelif n > 1 and count_0 == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# This is a sample Python script.\n\n# Press ⌃R to execute it or replace it with your code.\n# Press Double ⇧ to search everywhere for classes, files, tool windows, actions, and settings.\n\n\ndef print_hi():\n # Use a breakpoint in the code line below to debug your script.\n num = int(input())\n arr = list(map(int, input().split()))\n count = 0\n if num == 1:\n if arr[0] == 0:\n print(\"NO\")\n return\n print(\"YES\")\n return\n for i in range(len(arr)):\n if arr[i] == 0:\n count += 1\n if count != 1:\n print(\"NO\")\n return\n print(\"YES\")\n return\n\n\n# Press the green button in the gutter to run the script.\n\nprint_hi()\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "#\r\nif __name__ == '__main__':\r\n num_buttons = int(input())\r\n buttons = input().split()\r\n count = 0\r\n for index in range(num_buttons):\r\n if buttons[index] == '0':\r\n count += 1\r\n if count == 2:\r\n break\r\n if (count == 1 and num_buttons > 1) or (count == 0 and num_buttons == 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nbuttons = input()\n\nif n == 1:\n if int(buttons) == 1:\n print('YES')\n else:\n print('NO')\nelse:\n button_list = buttons.split(' ')\n count = 0\n for i in button_list:\n if int(i) == 1:\n count += 1\n\n if count == n-1:\n print('YES')\n else:\n print('NO')", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:\r\n if a==[1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif len(a)-a.count(1)==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n \r\ndef solve(): \r\n n=int(input())\r\n data=list(map(int,input().split()))\r\n if n==1:\r\n if data[0]==0: print(\"NO\")\r\n else: print(\"YES\")\r\n else:\r\n if data.count(0)==1: print(\"YES\")\r\n else: print(\"NO\")\r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "n = int(input())\r\n\r\ns = sum([int(x) for x in input().split(\" \")])\r\n\r\nif n == 1:\r\n if n==s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if s == n-1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n\r\n", "n = int(input())\r\nl = list(map(int , input().split())) \r\nx = sum(l) \r\n\r\nif (n == 1 and x == 0 ) or(x != n - 1 and n!=1) :\r\n print(\"NO\")\r\nelse: \r\n print(\"YES\")", "n = int(input())\r\nnum = list(map(int, input().split()))\r\nans = 0\r\nfor i in num:\r\n\tans += i\r\n\r\nif n == 1:\r\n\tif ans == 1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tif ans == n - 1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n", "n = int(input())\r\ncnt = 0\r\ns = input()\r\na = s.split(\" \")\r\nfor i in range(n):\r\n\tif a[i] == '0':\r\n\t\tcnt+=1\r\nif n == 1 and cnt == 0:\r\n print(\"YES\")\r\nelif n != 1 and cnt == 1:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "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\na=L()\r\ncnt=sum([a[i]==0 for i in range(n)])\r\n\r\nprint(['NO','YES'][(cnt==1 and n>1) or (cnt==0 and n==1)])", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nif n==1:\r\n if l[0]==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n exit() \r\nif sum(l)==n-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nbuttons = input().split()\r\n\r\nif n == 1:\r\n print('YES' if buttons[0] == '1' else 'NO')\r\nelse:\r\n try:\r\n buttons.remove('0')\r\n except:\r\n print('NO')\r\n else:\r\n print('YES' if '0' not in buttons else 'NO')\r\n", "n = int(input())\na = map(int, input().split())\ns = sum(a)\nif (n == 1 and s == 1) or (n > 1 and s == n - 1):\n print('YES')\nelse:\n print('NO')", "n=int(input())\r\nm=input()\r\nsum=0\r\nl=list(map(int,m.split()))\r\nif(n==1):\r\n if(l[0]==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif(n>1):\r\n for item in l:\r\n if item==1:\r\n sum=sum+1\r\n if(sum==n-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nk = 0\r\n\r\nfor i in a:\r\n if i == 1:\r\n k += 1\r\n\r\nif k == n == 1 or (n > 1 and k == n-1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif sum(l) == max(1,n-1):\r\n print ('YES')\r\nelse:print('NO')\r\n", "def checkJacket(v, n):\n if n == 1:\n if v[0] == 1:\n return True\n else:\n return False\n count = 0\n for i in range(n):\n if v[i] == 0:\n count += 1\n if count == 1:\n return True\n else:\n return False\n \n \nn = int(input())\nv = list(map(int, input().split()))\n \nif checkJacket(v, n):\n print(\"YES\")\nelse:\n print(\"NO\")", "n = int(input())\nbuttons = list(map(int, input().split()))\n\n# [ 0 ]\n# hoac\n# [ 1 ]\n\nif n == 1:\n if buttons[0] == 1:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n count = 0\n for i in range(0, n):\n if buttons[i] == 0:\n count = count + 1\n if count > 1:\n break\n\n if (count == 1):\n print(\"YES\")\n else:\n print(\"NO\")\n", "input()\r\nn = list(map(int , input().split()))\r\nif n.count(0)==1 and len(n)>1:\r\n print(\"YES\")\r\nelif n.count(0)==0 and len(n)==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\nz = 0\r\nif n == 1:\r\n a = int(input())\r\n if a == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n a = list(map(int,input().split()))\r\n if a.count(0) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\r\ndef main():\r\n \r\n n = int(input()) - 1\r\n \r\n k = input().split().count('1')\r\n \r\n res = 'NO'\r\n \r\n if 0 != n and n == k: res = 'YES'\r\n \r\n if 0 == n and 1 == k: res = 'YES'\r\n \r\n print(res)\r\n\r\nif __name__ == \"__main__\": main()", "ln = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nif arr.count(0) == 1 and len(arr) > 1:\r\n print(\"YES\")\r\nelif len(arr) == 1 and arr.count(0) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_buttons(lst, n):\r\n count = 0\r\n flag = False\r\n if n == 1:\r\n if lst[0] == 1:\r\n flag = True\r\n else:\r\n return flag\r\n for i in range(0, n, 1):\r\n if lst[i] == 0:\r\n count += 1\r\n \r\n if count == 1:\r\n flag = True\r\n \r\n return flag\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nif check_buttons(lst, n) == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = a.count(0)\r\n\r\nif n > 1:\r\n if count > 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\" if count == 1 else \"NO\")\r\nelse:\r\n print(\"NO\" if a[0] == 0 else \"YES\")", "n=int(input())\r\nl=sum(list(map(int,input().split())))\r\nif(n==1 and l==1):\r\n\tprint(\"YES\")\r\nelif(n==1 and l==0):\r\n\tprint(\"NO\")\r\nelif(l==n-1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint('YES' if (n==1)^(a.count(0)==1) else 'NO')", "n = int(input())\r\nl = input().split()\r\n\r\nif min(1, n-1) == l.count('0'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "N = int(input())\r\nhashmap = {}\r\narr = list(map(int,input().split()))\r\nfor i in arr:\r\n if i not in hashmap:\r\n hashmap[i] = 1\r\n else:\r\n hashmap[i] += 1\r\nif 0 in hashmap and 1 in hashmap:\r\n if (hashmap[0] > 1) or (hashmap[0] == 0 and hashmap[1] > 1):\r\n print('NO')\r\n else:\r\n print('YES')\r\nelif 0 in hashmap and 1 not in hashmap:\r\n print('NO')\r\nelif 1 in hashmap and 0 not in hashmap:\r\n if hashmap[1] > 1:\r\n print('NO')\r\n else:\r\n print('YES')", "\n# bai 1\n'''\nimport sys\n\nsys.stdin = open(\"input.txt\", \"r\")\nsys.stdout = open(\"output.txt\", \"w\")\n'''\n\nn = int(input())\nlst = list(map(int, input().split()))\n#print(lst)\n\nans = 'YES'\ncnt = 0\nif len(lst) == 1:\n\tif lst[0] == 0:\n\t\tans = 'NO'\nelse:\n\tfor i in lst:\n\t\tif i == 0:\n\t\t\tcnt += 1\n\n\tif cnt != 1:\n\t\tans = 'NO'\nprint(ans)", "n = int(input())\r\nl = sum(map(int,input().split()))\r\n\r\nif n == 1 and l == 1:\r\n print(\"YES\")\r\nelif n != 1 and n == l+1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print('YES' if (input()!='1')==input().count('0') else 'NO')\r\n", "length = int(input())\nbuttons = list(map(int, input().split()))\nif length == 1:\n\tif buttons[0] == 1:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nelse:\n\tif buttons.count(0) == 1:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n\n'''\nIn this problem you should simply check the conditions from the problem statement.\n'''\n", "def checkJacket(v):\r\n if len(v) == 1:\r\n if v[0] == 0:\r\n return 0\r\n else:\r\n return 1\r\n\r\n cnt = 0\r\n for button in v:\r\n if button == 0:\r\n cnt += 1\r\n\r\n if cnt == 1:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\n\r\nn = int(input())\r\nv = list(map(int, input().split()))\r\n\r\nif checkJacket(v) == 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n=int(input())\r\nif n==1:\r\n a=int(input())\r\n if a==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n #n=int(input())\r\n a=list(map(int,input().split()))\r\n if a.count(0)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nones = arr.count(1)\r\n\r\nif n == 1 and ones == 1 or n > 1 and ones == n-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\nn = int(input())\r\na = input().split()\r\ncount = 0\r\nnum = \"\".join(a)\r\nz = str(num)\r\n\r\nif z == \"1\":\r\n print(\"YES\")\r\n sys.exit()\r\n\r\ny = num.count(\"0\")\r\n\r\n\r\nif y == 1 and n > 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ndef solve(n, a):\r\n\tif (n == 1 and a[0] == 1) or (n>1 and a.count(0) == 1): return 'YES'\r\n\treturn 'NO'\r\n\r\nprint(solve(n, a))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 6 19:41:26 2021\r\n\r\n@author: Lai Phuc\r\n\"\"\"\r\nN = int(input())\r\nbutton = list(map(int, input().split(\" \")))\r\n\r\ncount = 0\r\nfor i in range(len(button)):\r\n if button[i] == 0:\r\n count += 1\r\nif count == 1 and N > 1 :\r\n print(\"YES\")\r\nelif count == 0 and N == 1:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "buttons = int(input())\r\nsign = [int(i) for i in input().split()]\r\nif buttons == 1:\r\n\tif sign[0] == 1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nelse:\r\n\tif sign.count(0) == 1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "I=input\r\nn=int(I())\r\na=sum(map(int,I().split()))\r\nprint(['NO','YES'][n<2 and a>0 or n>1 and a+1==n])", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1 and a[0]==1:\r\n print(\"YES\")\r\nelif a.count(1)==n-1 and n!=1: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nl = []\r\na = list(map(int, input().strip().split()))\r\nif len(a) == 1: \r\n if a[0] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if (a.count(1)==n-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "num_button = int(input())\r\nbutton_list = list(map(int, input().split()))\r\n\r\ndef check_buttons(num_button, button_list):\r\n count_fastened = 0\r\n count_unfastened = 0\r\n for button in button_list:\r\n if button == 0:\r\n count_unfastened += 1\r\n else:\r\n count_fastened += 1\r\n \r\n count_total = count_unfastened+count_fastened\r\n \r\n if count_total == 1:\r\n if count_fastened == 1:\r\n return True\r\n else:\r\n return False\r\n else:\r\n if count_unfastened == 1:\r\n return True\r\n else:\r\n return False\r\n\r\ndef main():\r\n if check_buttons(num_button, button_list):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nmain()", "testcase = int(input())\r\nnum = list(map(int,input().split()))[:testcase]\r\nl = len(num)\r\ncountofOne = 0\r\nif l==1:\r\n if num[0] == 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n for i in range(l):\r\n if num[i] == 1:\r\n countofOne+=1\r\n if countofOne == l-1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nif n == 1:\r\n print('YES' if a[0] else 'NO')\r\nelse:\r\n print('YES' if a.count(0) == 1 else 'NO')\r\n \r\n", "n=int(input())\r\na=input()\r\nprint('NYOE S'[(n<2 and a.count('1')) or (n>1 and a.count('0')==1)::2])", "def solution(n, a):\n\tif n == 1 and a[0] == 1:\n\t\treturn \"YES\"\n\telif n == 1:\n\t\treturn \"NO\"\n\n\tif a.count(0) == 1:\n\t\treturn \"YES\"\n\telse:\n\t\treturn \"NO\"\n\n\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nprint(solution(n, a))\n", "#import sys\n#sys.stdin = open('input.txt', 'r') \n#sys.stdout = open('output.txt', 'w')\n\nn = int(input())\nA = list(map(int, input().split()))\nif (n == 1):\n\tif (A[0] == 1):\n\t\tprint(\"YES\")\n\telse: \n\t\tprint(\"NO\")\n\texit()\n\ncount = 0; res = 1\nfor i in range(n):\n\tif A[i] == 0:\n\t\tcount += 1\n\tif count > 1:\n\t\tres = 0\n\t\tbreak\nif res == 1 and count == 1:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n \t\t\t \t \t\t \t\t \t \t\t\t \t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1].replace(' ','')\r\n\r\nif n == 1:\r\n if s == '1':\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if s.count('0') == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# LUOGU_RID: 101608112\nn, *a = map(int, open(0).read().split())\r\nprint((n == 1 and a[0] or n > 1 and a.count(0) == 1) and 'YES' or 'NO')", "jacketNumber = ''\njacketList = ''\n\njacketNumber = int(input())\njacketList = input()\n\njacketList = jacketList.split()\n\nif len(jacketList) == 1:\n if int(jacketList[0]) == 1:\n print('YES')\n else:\n print('NO')\nelse:\n unFastened = []\n\n for i in range(len(jacketList)):\n if int(jacketList[i]) == 0:\n unFastened.append(0)\n\n if len(unFastened) == 1:\n print('YES')\n else:\n print('NO')\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nbuttons = a.count(1)\r\n\r\nif n == 1:\r\n if buttons == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n exit()\r\nelse:\r\n if buttons == n - 1:\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nif n == 1:\r\n print(\"YES\" if a[0] == 1 else \"NO\")\r\nelse:\r\n print(\"YES\" if a.count(1) == n - 1 else \"NO\")\r\n \r\n", "numButton = int(input())\r\nbutton = list(map(int,input().split()))\r\n\r\nif numButton == 1:\r\n if button[0] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\n\r\ncount = 0\r\nfor i in range(0, numButton):\r\n if button[i] == 0:\r\n count += 1\r\n\r\nif count == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\nli=list(map(int,input().split()))\nif(n==1):\n\tif(li[0]==0):\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\nelse:\n\tif(li.count(0)!=1):\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n", "if __name__ == \"__main__\":\n n, x = int(input()), [int(i) for i in input().split()]\n print('NO' if (n == 1 and x[0] == 0) or (n > 1 and sum(x) != n-1) else 'YES')\n", "if __name__ == \"__main__\":\n n, x = int(input()), [int(i) for i in input().split()]\n print(('YES' if x[0] == 1 else 'NO') if n == 1 else ('YES' if sum(x) == n-1 else 'NO'))\n", "from collections import Counter\n\nn = int(input())\nc = Counter(input().split())\nif n == 1:\n if c['0'] == 0:\n print('YES')\n else:\n print('NO')\nelse:\n if c['0'] == 1:\n print('YES')\n else:\n print('NO')\n", "num_button = int(input())\r\nbuttons = list(map(int, input().split()))\r\n\r\ndef check_button(num_button, buttons):\r\n count_fastened = 0\r\n count_non_fastened = 0\r\n for button in buttons:\r\n if button == 1:\r\n count_fastened += 1\r\n else:\r\n count_non_fastened += 1\r\n if num_button == 1:\r\n if count_fastened == 1:\r\n return True\r\n else:\r\n return False\r\n else:\r\n if count_non_fastened == 1:\r\n return True\r\n else:\r\n return False\r\nif check_button(num_button, buttons):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n#sys.stdin = open('input.txt', 'r') \r\n#sys.stdout = open('output.txt', 'w')\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\nif (n == 1):\r\n\tif (A[0] == 1):\r\n\t\tprint(\"YES\")\r\n\telse: \r\n\t\tprint(\"NO\")\r\n\texit()\r\n\r\ncount = 0; res = 1\r\nfor i in range(n):\r\n\tif A[i] == 0:\r\n\t\tcount += 1\r\n\tif count > 1:\r\n\t\tres = 0\r\n\t\tbreak\r\nif res == 1 and count == 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def p1():\r\n\tn,m = [float(i) for i in input().split('e')]\r\n\tif n*10**m == int(n*10**m):\r\n\t\tprint(int(n*10**m))\r\n\telse:\r\n\t\tprint(n*10**m)\r\ndef p2():\r\n\tn = int(input())\r\n\tl = [int(i) for i in input().split()]\r\n\tans = 'YES'\r\n\tif n == 1:\r\n\t\tif l.count(0) == 1:\r\n\t\t\tans = 'NO'\r\n\telif l.count(0) != 1 :\r\n\t\tans = 'NO'\r\n\tprint(ans)\r\ndef p3():\r\n\tn,m = [int(i) for i in input().split()]\r\n\tk = 0\r\n\tm2 = 0\r\n\tfor j in range(m):\r\n\t\ta = input()\r\n\t\tif a.count('1') == len(a) :\r\n\t\t\tm2 = max(m2,k)\r\n\t\t\tk =0\r\n\t\telse:\r\n\t\t\tk = k+1\t\r\n\tm2 = max(m2,k)\r\n\tprint(m2)\r\ndef p4():\r\n\tn,m = [int(i) for i in input().split()]\r\n\tt = 0\r\n\tl = m\r\n\tfor i in range(n):\r\n\t\ta = input().split()\r\n\t\tb = int(a[1])\r\n\t\ta = a[0]\r\n\t\tif a == '+':\r\n\t\t\tl = l+b\r\n\t\telse:\r\n\t\t\tif l >= b:\r\n\t\t\t\tl = l-b\r\n\t\t\telse:\r\n\t\t\t\tt = t+1\r\n\tprint(l,t)\r\ndef p5():\r\n\tn,m = [int(i) for i in input().split()]\r\n\tl = []\r\n\tv = []\r\n\tg = []\r\n\tfor i in range(n):\r\n\t\ts = input()\r\n\t\tl.append(s)\r\n\t\tv.append(s.count('*'))\r\n\tfor i in range(m):\r\n\t\tt = 0\r\n\t\tfor j in range(n):\r\n\t\t\tif l[j][i] == '*':\r\n\t\t\t\tt = t+1\r\n\t\tg.append(t)\r\n\tans = 'NO'\r\n\tc = sum(v)\r\n\tfor i in range(n):\r\n\t\tfor j in range(m):\r\n\t\t\tt = v[i]+g[j]\r\n\t\t\tif l[i][j] == '*':\r\n\t\t\t\tt = t-1\r\n\t\t\tif t == c:\r\n\t\t\t\tans = 'YES'\r\n\t\t\t\tx,y = i+1,j+1\r\n\t\t\t\tbreak\r\n\t\tif ans == 'YES':\r\n\t\t\tbreak\r\n\tprint(ans)\r\n\tif ans == 'YES':\r\n\t\tprint(x,y)\r\np2()\r\n\t\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=0\r\nfor i in a:\r\n if i==0:\r\n if b:\r\n print(\"NO\")\r\n exit(0)\r\n else:\r\n b=1\r\nif b:\r\n if len(a)>1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if len(a)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n=int(input())\na=map(int,input().split());\na=list(a);\ns=0\nif n==1:\n s=1\nprint(\"YES\" if a.count(s)==1 else \"NO\")\n\n", "numberOfButton = int(input())\r\nbuttons = list(map(int, input().split()))\r\ntotal = 0\r\nif numberOfButton == 1:\r\n if buttons[0] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(buttons)):\r\n total = total + buttons[i]\r\n if total == numberOfButton - 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "n = int(input())\r\nstring = input()\r\nbuttons = list(map(int, string.split()))\r\ncondition1, condition2 = buttons.count(0) == 1 and n > 1, buttons[0] == 1 and n == 1\r\nif condition1 or condition2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nc=input()\r\nc=c.split()\r\nif a==1:\r\n if c[0]==\"1\":\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n z=c.count(\"0\")\r\n if z==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def fashion_in_berland(n, buttons):\r\n count = 0\r\n if n == 1:\r\n if buttons[0] == 1:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n else:\r\n for i in range(len(buttons)):\r\n if buttons[i] == 0:\r\n count += 1\r\n if count == 1:\r\n return \"YES\"\r\n return \"NO\"\r\nn = int(input())\r\nbuttons = list(map(int, input().split()))\r\nprint(fashion_in_berland(n, buttons))", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n if i is 0:\r\n count+=1\r\nif n==1:\r\n print(\"YES\" if count==0 else \"NO\")\r\nelse:\r\n print(\"YES\" if count==1 else \"NO\")\r\n \r\n ", "n = int(input())\r\n\r\nl_b = list(map(int, input().split()))\r\nif sum(l_b) == max(1, n - 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nnlist=list(map(int,input().split()))\r\n\r\n#all 1, 1-0\r\n#if n=1, 0\r\n\r\nif (n==1) and (1 in nlist):\r\n print('YES')\r\nelif (n>1) and (nlist.count(0)==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "input();a=list(map(int,input().split()))\r\nprint(['NO','YES'][(a.count(0)==1 and len(a)!=1) or (len(a)==1 and a.count(0)==0)])", "#input n\r\n\r\nn = int(input())\r\na = list(map(int, input().split())) # map(function_to_apply, list_of_input)\r\n\r\ncount_1 = a.count(1)\r\n\r\n\r\nif n == 1:\r\n if count_1 == n:\r\n correctly_fasten = True\r\n else:\r\n correctly_fasten = False\r\nelse:\r\n if count_1 == n - 1:\r\n correctly_fasten = True\r\n else:\r\n correctly_fasten = False\r\n\r\nprint('YES' if correctly_fasten else 'NO')\r\n\r\n", "a = input()\nb = input()\nc = b.split()\ndem = 0\nif int(a) == 1:\n if int(c[0]) == 1:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n for i in range(int(a)):\n if int(c[i]) == 0:\n dem += 1\n if dem == 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n", "n = int(input())\r\nmystr = input()\r\nmylist = mystr.split()\r\nmylistnum = [int(i) for i in mylist]\r\n\r\nn_one = 0\r\nfor i in mylistnum:\r\n if i == 1:\r\n n_one = n_one + 1\r\n\r\nif n == 1:\r\n if n_one == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if n-n_one == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "buttons = int(input())\r\norder = [int(x) for x in input().split()]\r\n\r\ndef test():\r\n\tif buttons == 1:\r\n\t\treturn(order.count(1) == 1)\r\n\telse:\r\n\t\treturn(order.count(0) == 1)\r\n\r\nif test():\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\nv = list(map(int, input().split()))\r\nif n == 1 and v[0] == 1 or n > 1 and v.count(0) == 1:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = int(input())\r\n\r\nbuttons = list(map(int, input().split()))\r\n\r\ntotal = 0;\r\n\r\nfor i in range(0, len(buttons)):\r\n total = total + buttons[i]\r\n\r\nif (n > 1 and total == n - 1) or (n == 1 and total == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = input()\r\nif n == 1:\r\n print('YES' if a[0] == '1' else 'NO')\r\n exit(0)\r\n\r\ncnt = a.count('0')\r\nprint('YES' if cnt == 1 else 'NO')\r\n", "n = int(input())\nval = map(int, input().split())\n\nif n == 1:\n print(\"YES\" if sum(val) == 1 else \"NO\")\nelse: \n print(\"YES\" if sum(val) == n - 1 else \"NO\")", "n = int(input())\na = list(map(int, input().split()))\nc = 0\nfor i in range(n):\n if a[i] == 0:\n c += 1\n if c > 1 :\n break\nif (c == 1 and n > 1) or (c == 0 and n == 1):\n print(\"YES\")\nelse:\n\tprint(\"NO\")", "n=int(input())\r\nx=[int(q) for q in input().split()]\r\n\r\nif n==1:\r\n if x[0]==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n if x.count(0)==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n if n == 1:\r\n return A[0] == 1\r\n return sum(A) == n - 1\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n if solve(A):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nst = list(map(int, input().split()))\nflag=0\nflag = 1 \nif n==1:\n print(\"YES\") if st[0]==1 else print(\"NO\")\nelse:\n val = st.count(0)\n print(\"YES\") if val==1 else print(\"NO\")", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\n\r\ncntZero = 0\r\n\r\nfor x in a:\r\n if x == 0:\r\n cntZero = cntZero + 1\r\n\r\nif (n == 1) and (cntZero == 0):\r\n print('YES')\r\nelif (n > 1) and (cntZero == 1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\na = list(map(int,input().split()))\r\nif a.count(0) == 1 and n!=1:\r\n print(\"YES\")\r\nelif a.count(0) == 0 and n == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nif n==1:\r\n if s[0]==1:print('YES')\r\n else:print('NO')\r\nelse:\r\n a=s.count(0)\r\n if a==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def Fashion(l):\r\n if len(l) == 1:\r\n if l[0] == 1:\r\n return 1\r\n return 0\r\n else:\r\n count = 0\r\n for x in l:\r\n if x == 0:\r\n count += 1\r\n if count > 1:\r\n return 0\r\n if count == 1:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\n\r\nN = int(input())\r\nl = list(map(int, input().split()))\r\nprint(\"YES\" if Fashion(l) == 1 else \"NO\")\r\n", "n = int(input())\r\ns = input()\r\nif n == 1:\r\n if s == '0':\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelif '0' not in s or '1' not in s or n - 1 - s.count('1'):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nif(n>1):\r\n if(a.count(0)==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if 1 in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nif n == 1:\r\n if a[0] == 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n if sum(a) == n-1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n if l[0] == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\n\r\ncount = 0\r\nfor i in range(n):\r\n if l[i] == 0:\r\n count += 1\r\nif count != 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n\r\n", "N = int(input())\r\nA = list(map(int, input().split()))\r\nzero_count = 0\r\nfor x in A:\r\n if x == 0:\r\n zero_count += 1\r\nif (N == 1 and zero_count == 0) or (N > 1 and zero_count == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\nif x==1:\r\n r=int(input())\r\n if r==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n mas=input().split()\r\n s=0\r\n for i in range(x):\r\n if int(mas[i])==0:\r\n s=s+1\r\n if s==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n if sum(lst) == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nelif sum(lst) == n - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = [int(_) for _ in input().split()]\r\nif n == 1:\r\n if a == [1]:\r\n print('YES')\r\n exit()\r\n print('NO')\r\n exit()\r\nif a.count(0) == 1:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "n=int(input())\r\ns=list(input().split())\r\nsum=0\r\nif n==1:\r\n if int(s[0])==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n for i in s:\r\n sum+=int(i)\r\n if sum==n-1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "print('YES' if min(1,int(input())-1) == input().split().count('0') else 'NO')\n\n\n\n# Made By Mostafa_Khaled", "n=int(input())\r\na=list(map(int,input().split()))\r\nsm=sum(a)\r\n\r\nif (sm==n-1)^(n==1):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\na = list(map(int, input().split()))\nif n == 1:\n\tprint('YES' if sum(a) == 1 else 'NO')\n\texit()\nprint('YES' if sum(a) +1 == n else 'NO')\n", "# Fashion in Berland\r\n# https://codeforces.com/problemset/problem/691/A\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nok = False\r\n\r\nif (n == 1):\r\n\tif (a[0] == 1):\r\n\t\tok = True\r\nelse:\r\n\tcnt = 0\r\n\t\r\n\tfor i in a:\r\n\t\tif (i == 1):\r\n\t\t\tcnt += 1\r\n\t\t\r\n\tif (cnt == len(a)-1):\r\n\t\tok = True\r\n\t\t\r\nif ok:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "def test(n: int, a: list) -> str:\r\n if n == 1:\r\n return \"YES\" if a[0] == 1 else \"NO\"\r\n count = 0\r\n for i in a:\r\n count += i == 0\r\n return \"NO\" if count == 0 or count > 1 else \"YES\"\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nprint(test(n, a))\r\n", "n = int(input())\na = list(map(int, input().split()))\n\ncnt = a.count(1)\nif n == 1:\n if cnt == 1:\n print('YES')\n else:\n print('NO')\nelif n > 1:\n if cnt == n - 1:\n print('YES')\n else:\n print('NO')\n\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==1:print('YES' if a[0]==1 else 'NO')\r\nelse:print('YES' if sum(a)==n-1 else 'NO')", "lenFasten = input()\r\n\r\n\r\n\r\nfastened = list(map(int, input().split()))\r\ndef checkBerlandFashion(fastened):\r\n if len(fastened) == 1:\r\n return fastened[0] == 1 \r\n \r\n else: \r\n countNotFasten = 0\r\n for i in range(len(fastened)):\r\n\t if fastened[i] == 0:\r\n\t\t countNotFasten+=1\r\n return countNotFasten == 1 \r\n\r\nif(checkBerlandFashion(fastened)):\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n\r\n ", "n=int(input())\r\nbs=input()\r\nif(bs==\"1\"):\r\n print(\"YES\")\r\nelif(bs==\"0\"):\r\n print(\"NO\")\r\nelse:\r\n s=0\r\n for a in bs[::2]:\r\n s+=int(a)\r\n if(s!=n-1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "N = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nif N == 1:\r\n if A[0] == 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n counter = 0\r\n for button in A:\r\n if button == 0:\r\n counter += 1\r\n if counter == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "#!/usr/bin/python3.4\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in a:\r\n\tif i == 1:\r\n\t\tcnt += 1\r\nif n == 1 and cnt == 1:\r\n\tprint(\"YES\")\r\nelif n > 1 and cnt + 1 == n:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t", "a = (input(), input())[1].split()\nflag = a.count('0') == 1 and len(a) != 1 or a == ['1']\nprint('YNEOS'[not flag:: 2])", "n = int(input())\nA = list(map(int, input().split()))\n\nif n == 1:\n if A[0] == 1:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n cnt = 0\n for i in range(0, len(A)):\n if A[i] == 0:\n cnt += 1\n if cnt > 1:\n break\n if cnt == 1:\n print(\"YES\")\n else:\n print(\"NO\")", "if __name__ == \"__main__\":\n n, x = int(input()), [int(i) for i in input().split()]\n if n == 1:\n print('YES' if x[0] == 1 else 'NO')\n else:\n print('YES' if sum(x) == n-1 else 'NO')\n", "n=int(input())\r\nbs=input()\r\n\r\ndef f(n,bs):\r\n if (n == 1):\r\n if (bs == \"0\"):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n s = 0\r\n for a in bs[::2]:\r\n if (a == \"0\"):\r\n s += 1\r\n if (s > 1):\r\n print(\"NO\")\r\n return\r\n if (s == 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nf(n,bs)", "N = int(input())\n\na = list(map(int, input().split()))\n\ndef ans():\n if N == 1:\n if a[0] == 1:\n return 'YES'\n return 'NO'\n if a.count(0) == 1:\n return 'YES'\n return 'NO'\n\nprint(ans())\n", "test= int(input())\r\n\r\n# while test> 0:\r\n \r\ncount= input().split().count(\"0\")\r\nif count==1 and test==1: print(\"NO\")\r\nelif count==0 and test==1 : print(\"YES\")\r\nelif count==1 : print(\"YES\")\r\nelse: print(\"NO\")", "n = int(input())\r\nprint('YES' if input().split().count('0') == min(1, n - 1) else 'NO')", "n = int(input())\nnum_input= input().split()\nnumbers = [int(i) for i in num_input]\ncount = 0\n# print(numbers)\nif n==1 and numbers[0]==1:\n print(\"YES\")\nelif n==1 and numbers[0]==0:\n print(\"NO\")\nelse:\n for i in range(0, n):\n if numbers[i]==0:\n count+=1\n\n if count==1:\n print(\"YES\")\n else:\n print(\"NO\")", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nans = 'YES'\r\ncnt = 0\r\nif n == 1:\r\n\tif lst[0] == 0:\r\n\t\tans = 'NO'\r\nelse:\r\n\tfor i in lst:\r\n\t\tif i == 0:\r\n\t\t\tcnt += 1\r\n\t\tif cnt > 1:\r\n\t\t\tbreak\r\n\r\n\tif cnt != 1:\r\n\t\tans = 'NO'\r\nprint(ans)", "line1 = int(input())\r\n\r\nline2 = list(map(int,input().split()))\r\nnum_zero = 0\r\nif line1 == 1:\r\n if line2[0] == 1:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\nelif line1>= 2:\r\n for item in line2:\r\n if item == 0:\r\n num_zero = num_zero + 1\r\n if num_zero == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n, a = int(input()), list(map(int, input().split()))\r\nprint(\"YES\") if (n == 1 and a[0] == 1) or (n > 1 and sum(a) == n - 1) else print(\"NO\")", "n=int(input())\nl=list(map(int,input().split()))\nif sum(l)==1 and n==1:\n print(\"YES\")\nelif sum(l)==n-1 and n!=1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t\t \t\t\t\t\t\t\t \t\t\t \t\t\t", "N = int(input())\r\nX = input()\r\nif N == 1:\r\n print(\"YES\" if X[0] == '1' else \"NO\")\r\n exit()\r\nprint(\"YES\" if X.count(\"0\") == 1 else \"NO\")\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: 555\r\n", "def fashion_in_berland(n, array):\r\n if n == 1:\r\n if array[0] == 1:\r\n return True\r\n else:\r\n return False\r\n\r\n count = 0\r\n for i in range(n):\r\n if array[i] == 0:\r\n count += 1\r\n if count == 1:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n\r\n# Press the green button in the gutter to run the script.\r\nif __name__ == '__main__':\r\n n = int(input())\r\n array = list(map(int, input().split()))\r\n if fashion_in_berland(n, array):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nls = [int(x) for x in input().split()]\nsum = sum(ls)\nif n == 1:\n if sum == n:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n if sum == n - 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t \t \t \t \t \t\t\t \t\t \t\t \t\t", "n = int(input())\r\ntuxedo = input().split()\r\nprint('YES' if (n == 1 and tuxedo[0] == '1') or (n != 1 and tuxedo.count('0') == 1) else 'NO')", "# from __future__ import print_function\n# python 3 default\n\ndef solve(kase):\n\n # print(\"no solution\\n\")\n return\n\ndef main():\n N = int(input())\n buttons = [int(x) for x in input().split()]\n fastened = sum(buttons)\n\n if N == 1:\n if fastened > 0:\n print('YES')\n else:\n print('NO')\n else:\n if fastened == (N-1):\n print('YES')\n else:\n print('NO')\n\nif __name__ == '__main__':\n main()\n", "def solution():\n input()\n l = input().strip().split()\n if len(l) == 1:\n print('YES' if l[0] == '1' else 'NO')\n return\n print('YES' if l.count('0') == 1 else 'NO')\n\nsolution()\n\t \t \t\t\t \t \t\t\t \t \t\t\t \t \t", "def check(mylist):\n if(len(mylist)==1):\n if(mylist.count(1)==1):\n print('YES')\n else:\n print('NO')\n else:\n if(mylist.count(0)==1):\n print('YES')\n else:\n print('NO')\nn=int(input())\nmylist=list(map(int,input().split(' ')))\ncheck(mylist)\n \t\t \t\t\t \t\t \t \t\t \t \t\t \t", "number_of_buttons = int(input())\r\nbuttons = list(map(int, input().split()))\r\n\r\nfastened_right = 'YES'\r\ncount_open_buttons = 0\r\n\r\nfor i in range(number_of_buttons):\r\n if buttons[i] == 0:\r\n count_open_buttons += 1\r\n\r\nif number_of_buttons == 1:\r\n if buttons[0] == 0:\r\n fastened_right = 'NO'\r\nelse:\r\n if count_open_buttons != 1:\r\n fastened_right = 'NO'\r\n\r\nprint(fastened_right)\r\n", "n, a = int(input()), (int(i) for i in input().split())\nres = \"YES\" if sum(b == 1 for b in a) == (n - 1 if n > 1 else 1) else \"NO\"\nprint(res)\n" ]

[ "n, k = map(int, input().split());\r\na = list(range(n));\r\nfor i in range (0, n):\r\n a[i] = list(range(n));\r\n for j in range (0, n):\r\n if j == i:\r\n a[i][j] = k;\r\n else: a[i][j] = 0;\r\n print(*a[i], sep=\" \")", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,k=rinput()\r\na=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j):\r\n a.append(k)\r\n else:\r\n a.append(0)\r\n\r\nfor i in range(0,n*n+1,n):\r\n print(*a[i:n+i])", "n, k = list(map(int, input().split()))\r\nval = k - n + 1\r\nar = [val] + [1]* (n - 1)\r\nprint(*ar)\r\n\r\nfor i in range(1, n):\r\n ar[i] = val\r\n ar[i - 1] = 1\r\n print(*ar)\r\n", "a,b=map(int,input().split())\r\nj=0\r\nwhile j<a:\r\n for i in range(0,a):\r\n if i==j:print(b,end=\" \")\r\n else: print(0,end=\" \")\r\n j+=1\r\n print()\r\n\r\n", "n, k =map(int, input().split())\r\nj=0\r\nfor i in range(n):\r\n\ta=[0]*n\r\n\ta[j]=k\r\n\tj+=1\r\n\tprint(\" \".join(map(str, a)))", "n , k=map(int , input().split())\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n print(k if i == j else 0, end = ' ')\r\n\r\n print()\r\n ", "if __name__ == '__main__':\r\n n, k = str(input()).split()\r\n n = int(n)\r\n k = int(k)\r\n for i in range(n):\r\n line = list()\r\n for j in range(i):\r\n line.append('0')\r\n line.append(str(k))\r\n for j in range(i + 1, n):\r\n line.append('0')\r\n print(' '.join(line))\r\n", "n,k=map(int,input().split())\ns=0\nfor i in range(n):\n for j in range(n):\n if j==s:\n print(k,end=\" \")\n else:\n print(0,end=\" \")\n s+=1\n print()\n", "# Wadea #\r\n \r\nn,k = map(int,input().split());arr = [0] * n\r\nfor i in range(n):m = arr.copy() ;m[i] = k;print(*m)", "n, k = map(int, input().split())\r\nl = [[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 i == j:\r\n l[i][j] = k\r\nfor i in l:\r\n print(*i)", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n matrix = [0]*n\r\n matrix[i] = k\r\n print(*matrix)", "X=list(map(int,input().split()))\r\nfor i in range(X[0]):\r\n n=list()\r\n for j in range(X[0]):\r\n n.append(\"0\" if j!=i else X[1])\r\n print(*n , sep=\" \")", "n,m=map(int,input().split())\r\ndia=m-(n-1)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(dia,end=' ')\r\n else:\r\n print(1,end=' ')\r\n print()", "t,a = map(int,input().split())\r\nfor i in range(t):\r\n print((\"0 \"*i)+f\"{a} \"+\"0 \"*(t-1-i))", "n, k = map(int, input().split())\r\nfor i in range(n, 0, -1):\r\n print(\"0 \"*(i-1)+str(k)+\" \"+\"0 \"*(n-i))", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i==j):\r\n print (k,end=' ')\r\n else:\r\n print (0,end=' ')\r\n print ()\r\n", "n, k = map(int, input().split())\r\n\r\nfor i in range(n):\r\n print(\"0 \"*i + str(k) + \" 0\"*(n-i-1))", "el = input(\"\")\narr = el.split(\" \")\nfor i in range(0, len(arr)):\n arr[i] = int(arr[i])\nn = arr[0] \nnumArr=[] \ntemp = 0 \nnumber = arr[1]\nnumArr.append(number)\nfor i in range(0,n-1):\n numArr.append(0)\nfor j in range(0,len(numArr)):\n print(numArr[j], end=' ') \nfor i in range(0,len(numArr)-1):\n temp = numArr[i+1]\n numArr[i+1] = numArr[i]\n numArr[i] = temp\n print(\"\\n\")\n for j in range(0,len(numArr)):\n print(numArr[j], end=' ') ", "n,k=map(int,input().split())\r\nif(n==1):\r\n\tprint(k)\r\nelse:\r\n\tl=[]\r\n\tfor i in range(n):\r\n\t\tif(i==n-1):\r\n\t\t\tl.append([0 for i in range(n)])\r\n\t\t\tl[i][i]=1\r\n\t\t\tl[i][0]=k-1\t\r\n\t\telse:\r\n\t\t\tl.append([0 for i in range(n)])\r\n\t\t\tl[i][i]=1\r\n\t\t\tl[i][i+1]=k-1\r\n\t\tprint(*l[i])", "a,b=map(int,input().split())\r\nfor i in range(a):\r\n c=[0]*a\r\n c[i]=b\r\n print(*c)", "a,b=map(int,input().split())\r\nf=[]\r\nfor x in range(a):\r\n for y in range(a):\r\n if x==y:\r\n f.append(b)\r\n else:\r\n f.append(0)\r\n print(*f)\r\n f=[]", "n,k=map(int,input().split());l=[[0]*n]*n\r\nfor i in range(n):\r\n c=[0]*n;c[i]=k;print(*c)", "def solve(n, k):\n for i in range(n):\n s = []\n for j in range(n):\n if i == j:\n s.append(str(k))\n else:\n s.append(0)\n print(' '.join(map(str, s)))\n\n\n\ndef main():\n n, k = list(map(int, input().split()))\n solve(n, k)\n\n\nmain()\n", "n,k=map(int,input().split())\r\nmat=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n mat[i][i]=k\r\nfor i in range(n):\r\n for j in range(n):\r\n print(mat[i][j],end=\" \")\r\n print()\r\n", "temp = list(map(int, input().split()))\r\nn = temp[0]\r\nk = temp[1]\r\ntemp = []\r\nmy_list = []\r\nfor x in range(n):\r\n temp = [0]*n\r\n temp[x] = k\r\n my_list.append(temp)\r\nfor x in range(n):\r\n for y in range(n):\r\n print(my_list[x][y],end=' ')\r\n print()\r\n", "n,k=[int(x) for x in input().split()]\r\nn1=k-n+1\r\nl=[n1]\r\nfor i in range(n-1):\r\n l.append(1)\r\nfor j in range(n):\r\n print(*l)\r\n l[0],l[1:len(l)]=l[-1],l[0:len(l)-1]\r\n ", "n, k = map(int, input().split())\r\nmat = [[0]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n mat[i][j] = k\r\nfor i in range(n):\r\n for j in range(n):\r\n print(mat[i][j], end = \" \")\r\n print()", "import sys\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,k = get_ints()\r\nar = [0]*n\r\nfor i in range(n):\r\n ar[i] = k\r\n print(*ar)\r\n ar[i] = 0", "n,k=map(int,input().split())\r\na=[]\r\nfor _ in range(n):\r\n a.append([0]*n)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i ==j :\r\n a[i][j]=k\r\n print(*a[i])", "n, k = map(int, input().split())\r\na = '0'*n\r\na = ' '.join(a)\r\na = a.split()\r\nfor i in range(n):\r\n a[i] = str(k)\r\n for j in a:\r\n print(j, end=' ')\r\n print()\r\n a[i] = '0'\r\n", "if __name__=='__main__':\r\n n,k = tuple(map(int,input().split()))\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n print(k,end=\" \")\r\n else:\r\n print('0',end=\" \")\r\n print()", "n, sum = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n a.append(sum)\r\n else:a.append(0)\r\n print(*a)\r\n a.clear()", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nn,k=map(int,input().split())\r\nl=[0]*(n-1)\r\nfor i in range(n):\r\n\tl.insert(i,k)\r\n\tprint(*l)\r\n\tl.pop(i)", "x, y = map(int, input().split())\r\nfor i in range(x):\r\n for j in range(x):\r\n print(y if i == j else 0, end = ' ')\r\n print()", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j):\r\n print(k, end=\" \")\r\n else:\r\n print(\"0\", end=\" \")\r\n print()", "n,k=map(int,input().split())\r\na=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n\ta[i][i]=k\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tprint(a[i][j],end=\" \")\r\n\t\tif(j==n-1):\r\n\t\t\tprint()", "\r\nn, k = map(int, input().split())\r\nj = n - 1\r\nfor i in range(n):\r\n print(*('0' * i), k, *('0' * j), sep=' ')\r\n j -= 1\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# رفیق بی کلک مادر", "n,k=map(int,input().split())\r\nfor i in range(n):l=[0]*n;l[i]=k;print(*l)", "n,k=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n p=[0 for x in range(n)]\r\n arr.append(p)\r\nfor i in range(n):\r\n arr[i][i]=k\r\nfor r in range(n):\r\n for c in range(n):\r\n print(arr[r][c],end=' ')\r\n print() ", "n, k = [int(x) for x in input().split()]\narr = []\nfor i in range(n):\n tmp = [] \n for j in range(n):\n if (j == i):\n tmp.append(k)\n else:\n tmp.append(0)\n arr.append(tmp)\nfor i in range(n):\n print(*arr[i])\n", "n, k = map(int,input().split())\r\nelementValue = k // n\r\nrow = [elementValue]*n\r\nrow[0] += k % n\r\nprint(*row)\r\nfor i in range(n-1):\r\n row[i],row[i+1] = row[i+1],row[i]\r\n print(*row)\r\n", "r,c=(input()).split()\r\nr=int(r)\r\nc=int(c)\r\nfor i in range(r):\r\n for j in range(r):\r\n if(i==j):\r\n print(c,end=\" \")\r\n \r\n else:\r\n if(j==r-1):\r\n print(\"0\")\r\n else:\r\n print(\"0\",end=\" \")\r\n ", "n, k = map(int, input(). strip(). split())\r\narray = []\r\nfor i in range(n):\r\n array.append([0]*n)\r\n\r\nfor i in range(n):\r\n array[i][i] = k\r\n\r\nfor ele in array:\r\n print(*ele)\r\n\r\n\r\n", "n,k = map(int,input().split())\r\nT = [[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n T[i][i] = k\r\nfor i in T:\r\n for j in i:\r\n print(j ,end = ' ')\r\n print()\r\n \r\n ", "n,k = [int(num) for num in input().split(' ')]\nmap = []\nfor i in range(n):\n for j in range(n):\n if i == j:\n print(k,end=' ')\n else:\n print(0,end=' ')\n print()\n\n ", "n , s = [int(x) for x in input().split()]\r\nfor i in range(0 , n):\r\n\tfor j in range(0 , n):\r\n\t\tif(i != j):\r\n\t\t\tprint(s//n , end = \" \")\r\n\t\telse:\r\n\t\t\tprint(s - (s//n) * (n - 1) , end = \" \")\r\n\tprint()", "def genstring(num, length, index):\r\n return ('0 '*(index) + str(num) + ' ' + '0 ' * (length-index)).strip()\r\na, b = map(int, input().split(' '))\r\nfor t in range(a):\r\n print(genstring(b, a-1, t))\r\n", "# Problem Link: https://codeforces.com/problemset/problem/361/A\r\n# Author: Raunak Sett\r\nimport sys\r\nreader = (s.rstrip() for s in sys.stdin)\r\ninput = reader.__next__\r\n\r\n# do magic here\r\n\r\nn, k = map(int, input().split())\r\n\r\nans = [[k//n for i in range(n)] for i in range(n)]\r\n\r\nif k%n != 0:\r\n for i in range(n):\r\n ans[i][i] = k - (n-1)*(k//n)\r\nfor row in ans:\r\n print(\" \".join(map(str, row)))", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j:\r\n\t\t\tprint(m,end=\" \")\r\n\t\telse:\r\n\t\t\tprint(0, end=\" \")\r\n\tprint()", "n, k = map(int,input().split())\r\n\r\nfor i in range(n):\r\n array = [0] * n\r\n array[i] = k\r\n print(*array)", "a,b=map(int,input().split())\r\nl=[b//a]*(a-(b%a))+[(a+b-1)//a]*(b%a)\r\nfor i in range(a):\r\n print(*l)\r\n l=l[1:]+[l[0]]\r\n", "n, k = map(int, input().split())\r\ndiagonal_value = str(k - n + 1)\r\nsolution = [' '.join([diagonal_value if column == row else '1' for column in range(1, n+1)]) for row in range(1, n+1)]\r\nprint('\\n'.join(solution))\r\n", "n,k=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n b=[]\r\n for j in range(n):\r\n if i==j:\r\n b.append(k)\r\n else:\r\n b.append(0)\r\n a.append(b)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(a[i][j],'',end='')\r\n print()", "N,k=map(int,input().split())\n\nind=0\nfor i in range(N):\n for j in range(N):\n if(j!=N-1):\n if(j==i):\n print(k,end=\" \")\n else:\n print(0,end=\" \")\n else:\n if(j==i):\n print(k)\n else:\n print(0)\n", "import math\n\nn, k = [int(i) for i in input().split()]\na = []\ns = math.floor(k/n)\nfor i in range(n):\n if i < n-1:\n a.append(s)\n else:\n a.append(s+(k % n))\nfor i in range(n):\n b = a[i:n] + a[0:i]\n print(*b)\n\n", "import sys\r\n\r\nn, k = (int(el) for el in input().split())\r\na = [[0 for i in range(n)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n a[i][i] = k\r\n print(*a[i])", "n,k = list(map(int, input().split()))\r\n\r\n\r\n\r\nfor i in range(n):\r\n out=[str(0)]*n\r\n out[i]=str(k)\r\n print(\" \".join(out))", "\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\nr = k // n\r\nd = k - (r * (n - 1))\r\nfor i in range(n):\r\n row = []\r\n for j in range(n):\r\n ans = int(j == i) * d + int(j != i) * r\r\n row.append(str(ans))\r\n print (' '.join(row))\r\n", "n, k = list(map(int, input().split()))\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i == j):\r\n print(k, end = \" \")\r\n else:\r\n print(0, end = \" \")\r\n print()", "m,n = map(int,input().split())\r\nfor i in range(m):\r\n arr = []\r\n for j in range(m):\r\n if i == j:\r\n arr.append(n)\r\n else:\r\n arr.append('0')\r\n print(*arr)", "n, m = map(int, input().split())\r\ndiff = m - (n - 1)\r\nls = [1] * (n - 1) + [diff]\r\ngrid = [ls]\r\nbase = [1] * n\r\nindex = n - 1\r\nfor i in range(n-1):\r\n index -= 1\r\n arr = base.copy()\r\n arr[index] = diff\r\n grid.append(arr)\r\nfor i in grid:\r\n print(*i)\r\n\r\n", "nk = input().split()\r\nn, k = int(nk[0]), int(nk[1])\r\n\r\narr = []\r\nfor i in range(n):\r\n arr.append([])\r\n for j in range(n):\r\n if i == j:\r\n arr[i].append(k)\r\n else:\r\n arr[i].append(0)\r\nfor i in range(len(arr)):\r\n print(*arr[i])", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nAB\r\nAABB\r\nABAB\r\n\r\nBBAA X\r\nAABBA\r\n\r\nA\r\nB\r\nAB\r\nBA\r\nABB\r\nABA\r\nBAA\r\nAAB\r\n\r\nABBAAB\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n, k = MII()\r\n table = [[k//n] * n for _ in range(n)]\r\n\r\n rem = k%n\r\n if rem:\r\n for i in range(n):\r\n table[i][i] += rem\r\n\r\n for row in table:\r\n WS(row)\r\n\r\nsolve()", "n, k = map(int, input().split())\r\nnn = n\r\narr = [0]*(n-1) + [k] + [0]*(n-1)\r\nc = 0\r\nwhile nn:\r\n nn -= 1\r\n print(*arr[c:n+c])\r\n c += 1\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___\r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "n,k=map(int,input().split())\r\nfor x in range(n):\r\n\ta=[0 for x in range(n)]\r\n\ta[x]=k\r\n\tfor y in range(n):\r\n\t\tif y!=(n-1):print(a[y],end=\" \")\r\n\t\telse:print(a[y])", "def prettyMatrix(n, k):\r\n matrix = [0] * n\r\n for i in range(n):\r\n matrix[i] = [0] * n\r\n \r\n val = k - n + 1\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n matrix[i][j] = val\r\n else:\r\n matrix[i][j] = 1\r\n return matrix\r\n \r\n\r\nn, k = map(int, input().split())\r\nmatrix = prettyMatrix(n, k)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(matrix[i][j], end = \" \")\r\n print()", "def lf(n):\r\n c = 0\r\n while(n > 0):\r\n if n%10 == 4 or n%10 == 7:\r\n c+=1\r\n n= n//10\r\n return c\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(mi())\r\nn, k = mi()\r\na = [[0 for i in range(n)]for j in range(n)]\r\nfor i in range(n):\r\n a[i][i] = k\r\nfor i in range(n):\r\n print(*a[i])\r\n", "n, k = list(map(int, input().split()))\r\nmass = []\r\nfor i in range(1, 1001):\r\n\ta = k - sum(mass)\r\n\tif len(mass) == n - 1:\r\n\t\tmass.append(a)\r\n\t\tbreak\r\n\telse:\r\n\t\tif sum(mass) + i > k:\r\n\t\t\tmass.append(a)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tmass.append(i)\r\na = [0] * (n - len(mass))\r\nmass += a\r\nfor i in range(n):\r\n\tprint(*mass)\r\n\tmass = mass[1:] + [mass[0]]", "n,k=map(int,input().split())\r\nm=[[0]*n for i in range (n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n m[i][j]=k\r\nfor i in range(n):\r\n for j in range(n):\r\n print(m[i][j],end=\" \")\r\n print()", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n list1=[]\r\n for j in range(n):\r\n if i == j:\r\n list1.append(k)\r\n else:\r\n list1.append(0)\r\n print(*list1)", "n, k = [int(i) for i in input().split()]\r\n\r\nipr = int(k/n)\r\nnums = []\r\noutput = ''\r\n\r\nif(ipr*n != k):\r\n rest = k - (ipr*(n-1))\r\n for i in range(n-1):\r\n nums.append(ipr)\r\n nums.append(rest)\r\nelse:\r\n for i in range(n):\r\n nums.append(ipr)\r\n\r\nfor i in range(n):\r\n for j in range(len(nums)):\r\n output += str( nums[j]) + ' '\r\n nums2 = []\r\n for item in range(1, len(nums)):\r\n nums2.append(nums[item])\r\n nums2.append(nums[0])\r\n nums = nums2\r\n output += '\\n'\r\n\r\nprint(output)", "n,k=map(int,input().split())\r\na=k-n+1\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(a,end=\" \")\r\n else:\r\n print(1,end=\" \")\r\n print(\"\")", "n,k=map(int,input().split())\r\nt,c=k-n+1,0\r\nfor i in range(n):\r\n t1=['1']*n\r\n t1[c]=str(t)\r\n c+=1\r\n print(' '.join(t1))\r\n\r\n", "#Cypher\r\n#Indian Institute Of Technology, Jodhpur\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nmod= 10**9+7\r\nn,k=map(int,input().split())\r\nif n<=k:\r\n a=k//n\r\n b=k%n\r\n for i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(b+a,end=\" \")\r\n else:\r\n print(a,end=\" \")\r\n print()\r\nelse:\r\n temp=0\r\n for i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(k,end=\" \")\r\n else:\r\n print(0,end=\" \")\r\n print()", "n,k = map(int,input().split())\r\ns= [[0 for i in range(n)] for j in range(n)]\r\n\r\nd = []\r\nfor i in range(n):\r\n\ts[i][i]=k\r\n\td.append(s[i])\r\n\r\nfor i in d:\r\n\tprint(*i)\r\n\t", "def main():\n n, k = map(int, input().split())\n l = ['0'] * n\n s = str(k)\n for i in range(n):\n l[i] = s\n print(' '.join(l))\n l[i] = '0'\n \n\nif __name__ == '__main__':\n main()", "n=[]\r\nz,x=[int(i)for i in input().split()]\r\nc=x-(z-1)\r\nfor v in range(z):\r\n for b in range(z):\r\n if v==b:\r\n n.append(c)\r\n else:\r\n n.append(1)\r\n print(*n)\r\n n=[]\r\n", "n,k=map(int,input().split())\r\n \r\nfor i in range(n):\r\n\tl = ['0']*n\r\n\tl[i]=str(k)\r\n\tprint(\" \".join(l))\r\n\t", "n, m = map(int, input().split())\r\nif n == m:\r\n for i in range(n):\r\n for j in range(n):\r\n print(1, end=\" \")\r\n print()\r\nelif n > m:\r\n temp = n-1\r\n for i in range(n):\r\n for j in range(n):\r\n if n > i+j >= m or 2*temp-(temp-m-1) <= i+j <= 2*temp:\r\n print(0, end=\" \")\r\n else:\r\n print(1, end=\" \")\r\n print()\r\nelse:\r\n present = n-1\r\n for i in range(n):\r\n for j in range(n):\r\n if j == present:\r\n print(m-n+1, end=\" \")\r\n else:\r\n print(1, end=\" \")\r\n present -= 1\r\n print()", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n l=[0]*n\r\n l[i]=k\r\n print(*l)", "n, k = map(int, input().split())\r\ntable = [[0] * n for _ in range(n)]\r\nfor i in range(n):\r\n table[i][i] = k\r\nfor row in table:\r\n print(*row)\r\n", "n, k = [int(x) for x in input().split()]\r\nl = []\r\n\r\nfor i in range(0,n):\r\n s = [int(0)]*n\r\n s[i] = k \r\n l.append(s)\r\n\r\nfor x in l:\r\n print(*x)", "n, m = map(int, input().split())\nfor i in range(n):\n ans = [0] * n\n ans[i] = m\n print(*ans)", "x,y=[int(x) for x in input(\"\").split()]\r\nfor i in range(x):\r\n l=[0]*x\r\n l[i]=y\r\n print(*l)\r\n \r\n \r\n", "n, k = map(int, input().split())\ntable = [[0 for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif i == j:\n\t\t\ttable[i][j] = k\n\nfor row in table:\n\tprint(' '.join(list(map(str, row))))\n", "n,k=list(map(int,input().split()))\r\nmat=[]\r\nfor i in range(n):\r\n res=[0]*n\r\n for j in range(n):\r\n if i==j:\r\n res[i]=k\r\n mat.append(res)\r\nfor i in range(n):\r\n print(*mat[i])\r\n", "n,k=map(int,input().split())\r\nans=[]\r\nfor i in range(n):\r\n l=[]\r\n for j in range(n):\r\n if i==j:\r\n l.append(k)\r\n else:\r\n l.append(0)\r\n ans.append(l)\r\nfor i in ans:\r\n for j in i:\r\n print(j,end=\" \")\r\n print()\r\n ", "n,k=map(int,input().split())\r\nfor x in range(n):\r\n\ta=[0 for x in range(n)]\r\n\ta[x]=k\r\n\tprint(*a)", "#!/usr/bin/env python\n\nimport math\nimport sys\nimport itertools\nimport fractions\n\nif __name__ == '__main__':\n wtf = sys.stdin.read()\n wtf = wtf.strip().split('\\n')\n n,k = map(int, wtf[0].split())\n o = n-1\n O = k-o\n A = [O]\n A.extend([1]*o)\n for i in range(n):\n print(' '.join(map(str,A)))\n if i+1 < n:\n A[i],A[i+1]=A[i+1],A[i]\n", "n, k = map(int, input().split())\r\n\r\nfor i in range(n) :\r\n print(*(list('0'*i) + [str(k)] + list('0'*(n-1-i)) ))", "import sys\r\nimport itertools\r\nimport collections\r\n\r\n\r\ndef rs(x=''): return sys.stdin.readline().strip() if len(x) == 0 else input(x).strip()\r\ndef ri(x=''): return int(rs(x))\r\ndef rm(x=''): return map(str, rs(x).split())\r\ndef rl(x=''): return rs(x).split()\r\ndef rmi(x=''): return map(int, rs(x).split())\r\ndef rli(x=''): return [int(x) for x in rs(x).split()]\r\ndef println(val): sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\ndef solve(testCase):\r\n n, k = rmi()\r\n a = [[0 for _ in range(n)] for _ in range(n)]\r\n for i, j in enumerate(range(n)):\r\n a[i][j] = k\r\n for i in range(n):\r\n print(*a[i])\r\n\r\n\r\nfor _ in range(ri() if 0 else 1):\r\n solve(_ + 1)", "n,k = map(int,input().split())\n\nfor i in range (0,n):\n for j in range (0, n):\n if (i == j):\n print(k, end = ' ')\n else:\n print(0, end = ' ')\n print()\n", "s, r = map(int, input().split())\r\nfor i in range(s):\r\n for j in range(s):\r\n print(r if i == j else 0, end = ' ')\r\n print()", "from sys import stdout\r\nn,k = map(int, input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n stdout.write(str(k)+' ' if i==j else '0 ')\r\n stdout.write('\\n')", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, k = list(map(int, input().split()))\r\narr = []\r\n\t\r\nfor i in range(n):\r\n\tarr += [[0] * i + [k] + [0] * (n - 1 - i)]\r\nfor i in arr:\r\n\tprint(* i, sep = \" \")\r\n", "n,k = list(map(int,input().split())) \r\nfor row in range(n): \r\n for col in range(n): \r\n if(row==col): \r\n print(k,end=\" \") \r\n else: \r\n print(0,end=\" \") \r\n \r\n print() \r\n ", "n,k=map(int,input().split())\r\nif k%n==0:\r\n p=k//n\r\n for i in range(n):\r\n for j in range(n):\r\n print(p,end=' ')\r\n print()\r\nelse:\r\n p=k//n\r\n A=[]\r\n for i in range(n):\r\n A.append(p)\r\n A[-1]+=k%n\r\n for i in range(n):\r\n for j in range(n):\r\n print(A[(j+i)%n],end=' ')\r\n print()", "import math\r\n\r\nnumber = list(map(int , input().split()))\r\ncount = 0\r\nnum = number[0]\r\narr = []\r\nbig_number = number[1]\r\nwhile count != big_number :\r\n x = (big_number - count) / num\r\n x = math.floor(x)\r\n count += x\r\n arr.append(x)\r\n num -= 1\r\nadd = 0\r\nfor i in range(0 , number[0]) :\r\n for j in range(0 , number[0]) :\r\n print(f\"{arr[(j + add) % len(arr)]} \" , end='')\r\n add += 1\r\n print()", "n, k = map(int, input().split())\r\nnum = k - n + 1\r\n\r\nfor i in range(n):\r\n for t in range(i):\r\n print(1, end = ' ')\r\n \r\n print(num, end = ' ') \r\n \r\n for j in range(n - i - 1):\r\n print(1, end = ' ')\r\n \r\n print('')\r\n", "\r\nn,k = map(int, input().split())\r\nfor i in range(n):\r\n x = [0] * n\r\n x[i]=k\r\n print(*x)", "n, k = map(int,input().split())\r\nfor i in range(n):\r\n for j in range(i,n-1):\r\n print(0,end = ' ')\r\n print(k,end = ' ')\r\n for j in range(n-i,n):\r\n print(0,end = ' ')\r\n print()", "n,k=map(int,input().split(\" \"))\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i==j):\r\n if (i==n-1):\r\n print(k)\r\n else: print(k,end=\" \")\r\n else:\r\n if (j==n-1):\r\n print(0)\r\n else: print(0,end=\" \")\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append([0]*n)\r\nfor i in range(n):\r\n l[i][i]=k\r\nfor i in l:\r\n for j in i:\r\n print(j,end=\" \")\r\n print()", "n, k = map(int, input().split())\r\n\r\nmat = [[0]*n for i in range(n)]\r\n\r\nfor i in range(n):\r\n mat[i][i] = k\r\nfor x in mat:\r\n print(*x)", "n,k = map(int, input().split())\r\nfor i in range(n):\r\n for j in range(i):\r\n print(0, end=' ')\r\n print(k, end=' ')\r\n for j in range(n-i-1):\r\n print(0, end=' ')\r\n print()\r\n ", "n, k = map(int, input().split())\r\ntable = []\r\nfor i in range(n):\r\n row = [0]*n\r\n row[i] = k\r\n table.append(\" \".join([str(j) for j in row]))\r\n\r\nfor i in table:\r\n print(i)", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n s=''\r\n for j in range(n):\r\n if i==j:\r\n s+=str(k)+' '\r\n else:\r\n s+='0 '\r\n print(s)", "n,k=map(int,input().split())\r\na=[ ]\r\nf=0\r\nfor x in range(0,n):\r\n if(x!=n-1):\r\n a.append(f)\r\n else:\r\n a.append(k)\r\nfor i in range(0,n):\r\n an=a[i:]+a[0:i]\r\n print(*an) \r\n", "# cf 361 A 800\nn, k = map(int, input().split())\nd = k - (n - 1)\nfor i in range(n):\n row = [1] * i + [d] + [1] * (n - i - 1)\n print(\" \".join(map(str, row)))\n", "n,k=map(int, input().split())\r\nfor i in range(n):\r\n l=[0]*n;l[i]=k;print(*l)", "n,k = map(int, input().split())\r\np = [str(k)]+['0']*(n-1)\r\nfor i in range(n):\r\n print(' '.join(p))\r\n p = p[-1:] + p[:-1]", "n, k = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(k-n+1) if(i == n-1) else l.append(1)\r\nfor i in range(n):\r\n j = i\r\n while j < n:\r\n print(l[j], end=' ')\r\n j += 1\r\n j = 0\r\n while j < i:\r\n print(l[j], end=' ')\r\n j += 1\r\n print('\\r')\r\n", "\r\nn , k = map(int,input().split())\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n print(k if i == j else 0 , end = ' ')\r\n print()\r\n\r\n", "n,k = map(int,input().split())\r\n\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n print(k if i==j else 0,end=\" \")\r\n print()", "from math import sqrt\r\ndef solve():\r\n n,v=map(int,input().split());ans=[]\r\n for i in range(n):\r\n r=[]\r\n for j in range(n):\r\n if j==i:r.append(v-(n-1));continue\r\n r.append(1)\r\n ans.append(r)\r\n for i in ans:print(*i)\r\nsolve()\r\n", "a,b=input().split()\r\na,b=int(a),int(b)\r\nfor i in range(a):\r\n for j in range(a):\r\n if i==j:\r\n print(b,end=' ')\r\n else:\r\n print(0,end=' ')\r\n print('') ", "def solution(l1):\r\n n=l1[0]\r\n k=l1[1]\r\n i=0\r\n while i<n:\r\n c_out=\"\"\r\n j=0\r\n while j<n:\r\n if j==i:\r\n c_out+=str(k)\r\n else:\r\n c_out+=str(0)\r\n j+=1\r\n if j!=n:c_out+=\" \"\r\n print(c_out)\r\n i+=1\r\n \r\n\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n solution(l1)\r\nanswer()", "f,g = map(int,input().split())\n\nfor i in range(f):\n for j in range(f):\n if i==j:\n print(g,end=\" \")\n else:\n print(0,end=\" \")\n print(\"\")\n\n", "n,k = [int(i) for i in input().split()]\r\npos=0\r\nfor i in range(n): \r\n ar= [0]*n\r\n ar[pos]=k\r\n print(*ar)\r\n pos+=1", "n,b=map(int,input().split())\r\nM=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n) :\r\n for j in range(n) :\r\n if i==j :\r\n M[i][j]=b\r\nfor x in M :\r\n print(*x)\r\n", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n temp = [0] * n\r\n temp[i] = k\r\n print(*temp, sep=\" \")\r\n", "n, k = [int(x) for x in input().split(' ')]\nfor i in range(n):\n print((n - i - 1) * '0 ' + str(k) + i * ' 0')\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = []\r\n for i in range(n):\r\n A.append([0] * n)\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n A[i][j] = m\r\n for i in range(n):\r\n print(' '.join(list(str(a) for a in A[i])))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,k = map(int,input().split())\r\nl = list()\r\nfor i in range(0,n):\r\n l.append([0]*n)\r\nfor i in range(n):\r\n l[i][i] = k\r\nfor i in l:\r\n print(*i)\r\n", "n,k = map(int, input().split())\r\na = k // n\r\nb = k - a*(n-1)\r\nfor i in range(n):\r\n for j in range(i):\r\n print(a, end=' ')\r\n print(b, end=' ')\r\n for j in range(n-i-1):\r\n print(a, end=' ')\r\n print()\r\n ", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output1.out\",'w')\r\nn,k=map(int,input().split())\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j :\r\n\t\t\tprint(k,end=' ')\r\n\t\telse:\r\n\t\t\tprint(0,end=' ')\r\n\tprint()\r\n\t\t\t\t\t\t", "n,k =map(int,input().split())\nfor i in range(n):\n l = ['0']*i\n l = l+ [str(k)]\n l = l+['0']*(n-1-i)\n \n print(\" \".join(l)) ", "n,k = map(int,input().split())\nfor i in range(n):\n out = ''\n for j in range(n):\n if i==j:\n out += str(k)+' '\n else:\n out += str(0)+' '\n print(out.rstrip())\n", "\nns, k = map(int, input().split())\nv = k - (ns - 1)\n\nt = list()\nfor i in range(ns):\n t.append([(1 if i + c + 1 != ns else v) for c in range(ns)])\n\nfor ns in t:\n print(\" \".join(str(x) for x in ns))\n \t\t\t \t \t \t \t \t \t \t\t \t \t", "n,k=map(int,input().split())\r\na=[[k,0][i!=j] for i in range(n) for j in range(n)]\r\nprint(*a)", "n,k = [int (x) for x in input().split()]\r\nlst2 =[]\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if(j==i):\r\n lst2.append(k)\r\n else:\r\n lst2.append(0)\r\n for p in lst2:\r\n print(p,end=\" \")\r\n print()\r\n lst2.clear()\r\n ", "n, k = map(int, input().split())\r\nfor x in range(n):\r\n print(\" \".join(str(k) if i == x else \"0\" for i in range(n)))", "n,m = map(int, input().split())\r\nfor i in range(n):\r\n a = [0]*n\r\n a[i] = m\r\n print(*a)\r\n", "\r\n\r\n\r\n\r\nk=list(map(int,str(input()).split(' ')))\r\na=[[0 for i in range(0,k[0])] for j in range(0,k[0]) ]\r\nfor i in range(0,k[0]):\r\n for j in range(0,k[0]):\r\n if i==j:\r\n a[i][j]=k[1]\r\n\r\nprint\r\n# for i in range() \r\nfor i in range(0,k[0]):\r\n print(*a[i])", "n, k = map(int, input().split())\r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if i == j:\r\n print(k, end=\" \")\r\n else:\r\n print(0, end=\" \")\r\n print()\r\n", "x,k=[int(i) for i in input().split()]\r\nfor i in range(x):\r\n for j in range(x):\r\n if i==j:\r\n if j!=x-1:\r\n print(k,' ',end='')\r\n else:\r\n print(k)\r\n else:\r\n if j!=x-1:\r\n print(0,' ',end='')\r\n else:\r\n print(0)\r\n \r\n ", "n,sum=input().split()\r\nn=int(n)\r\nsum=int(sum)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(sum,end=\" \")\r\n else:\r\n print(0,end=\" \")\r\n print(\"\")", "# https://codeforces.com/contest/361/problem/A\r\n\r\nn, k = [int(i) for i in input().split()]\r\na = k // n \r\nr = k % n\r\n\r\nl = []\r\n\r\nfor i in range(0, n):\r\n l2 = [int(a) for j in range(0, n)]\r\n l.append(l2)\r\n\r\nfor i in range(0, n):\r\n l[i][i] += r \r\n\r\nfor i in range(0, n):\r\n s = \"\"\r\n for j in range(0, n):\r\n s += f\"{str(l[i][j])} \"\r\n print(s)", "n,k=map(int, input().split())\r\nz=k+1-n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(z,end=' ')\r\n else:\r\n print(1,end=' ')\r\n print()", "n,m=map(int,input().split())\r\nc=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n c[i][j]=m\r\n print(*c[i])\r\n\r\n", "n,k=[int(x) for x in input().split(' ')]\ni=0\nfor x in range(n):\n\ttemp=['0' for y in range(n)]\n\ttemp[i]=str(k)\n\tprint(' '.join(temp))\n\ti+=1", "n, k = map(int, input().split())\r\n\r\n# Initialize a 2D list with all cells being `0`\r\ntable = [[0]*n for _ in range(n)]\r\n\r\n# Fill the diagonal celss with `k` so that each row and column sums are equal to k\r\nfor i in range(n):\r\n table[i][i] = k\r\n\r\nfor row in table:\r\n print(*row)\r\n", "n,k = map(int, input().split())\r\na = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n a[i][i] = k\r\nfor i in a:\r\n print(\" \".join(list(map(str, i))))", "[n,k] = map(int, input().split())\r\n#N = n*n square, k = magic number, make a magic square without the diagnal\r\nx = 0\r\nalready0 = 0\r\nif k%4 == 0:\r\n for i in range(n):\r\n for i in range(n-1):\r\n print(int(k/n), end = \" \")\r\n print(int(k/n))\r\nelse:\r\n for i in range(n):\r\n for i in range(n-x-1):\r\n print(int(0), end = \" \")\r\n if x == 0:\r\n already0 = 1\r\n if x == 0:\r\n print(int(k))\r\n else: \r\n print(int(k), end = \" \")\r\n for i in range(x-1):\r\n print(int(0),end = \" \")\r\n if x >= 1 and already0 != 1:\r\n print(int(0))\r\n already0 = 0\r\n x = x+1\r\n ", "n,k=list(map(int,input().split()))\r\nfor i in range(n):\r\n a=[0]*n\r\n a[i]=k\r\n print(*a)", "n, k = map(int, input().split())\r\n\r\n# Initialize the table with all zeros\r\ntable = [[0] * n for _ in range(n)]\r\n\r\n# Fill the table with suitable values to satisfy the row and column sums\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n table[i][j] = k - (n - 1)\r\n else:\r\n table[i][j] = 1\r\n\r\n# Print the beautiful table\r\nfor row in table:\r\n print(*row)\r\n", "[n,k] = map(int, input().split())\na = k//n \nb = k - a*(n-1)\nfor i in range (n):\n for j in range (i):\n print (a, end = \" \")\n print (b, end = ' ')\n for j in range (n-i-1):\n print (a, end = ' ')\n print ()", "n, k = map(int, input().split())\nlst = [0]*(n-1) + [k]\nfor i in range(n):\n print(*lst)\n a = lst.pop(0)\n lst.append(a)", "import sys\r\nimport os\r\n\r\n\r\ndef changeStdioToFile():\r\n path = os.path.dirname(os.path.abspath(__file__))\r\n sys.stdin = open(f'{path}/input.txt', 'r')\r\n sys.stdout = open(f'{path}/output.txt', 'w')\r\n\r\n\r\n#changeStdioToFile()\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n, k = [int(x) for x in input().split()]\r\n if n == 1:\r\n print(k)\r\n continue\r\n for i in range(n):\r\n l = '0 ' * (i - 0) + str(k) + ' 0' * (n - 1 - i)\r\n print(l)\r\n", "n,k = list(map(int, str(input()).strip().split()))\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif j == i:\r\n\t\t\tprint(k, end = ' ')\r\n\t\telse:\r\n\t\t\tprint(0, end = ' ')\r\n\tprint(\"\")\r\n", "# A. Levko and Table\n\nn, k = map(int, input().split())\nfor i in range(n):\n for j in range(n):\n if i == j:\n print(k, end=' ')\n else:\n print(0, end=' ')\n print()\n", "n, k = map(int, input().split())\r\na = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n a[i][i] = k\r\n print(*a[i])\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n x = k // n\r\n mat = [[x for __ in range(n)] for _ in range(n)]\r\n \r\n for i in range(n):\r\n mat[i][i] += k % n\r\n \r\n for t in mat:\r\n print(*t)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n \r\nn,k=RI()\r\n\r\nl=[[0]*n for i in range(n)]\r\n\r\np=k-(n-1)\r\nfor i in range(n):\r\n j=i\r\n for k in range(n-1):\r\n l[i][(j+k)%n]=1\r\n\r\n l[i][(j+n-1)%n]=p\r\n\r\nfor i in range(n):\r\n print(*l[i],sep=\" \")\r\n", "n,k=map(int,input().split())\r\nb=[]\r\n\r\nfor i in range(n):\r\n a=[]\r\n for j in range(n):\r\n if(i==j):\r\n a.append(k-n+1)\r\n else:\r\n a.append(1)\r\n b.append(a)\r\nfor i in range(n):\r\n print(*b[i])", "def miis():\r\n return map(int, input().split())\r\n\r\nn, k = miis()\r\nans = [[int(i==j)*k for i in range(n)] for j in range(n)]\r\nfor i in ans:\r\n print(*i)\r\n", "arr = input().split()\r\nn = int(arr[0])\r\nk = arr[1]\r\nfor i in range(n):\r\n\tstr = ''\r\n\tfor j in range(n):\r\n\t\tif i == j:\r\n\t\t\tstr += k\r\n\t\telse:\r\n\t\t\tstr += '0'\r\n\t\tstr += ' '\r\n\tprint(str)", "n,k=[int(e) for e in input().split()]\r\nfor i in range(n):\r\n print(*([0]*i+[k]+[0]*(n-i-1)))", "from sys import stdin, stdout\r\n\r\n\r\nn, k = map(int, stdin.readline().split())\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n if i == j:\r\n stdout.write(str(k))\r\n else:\r\n stdout.write(\"0\")\r\n if j == n:\r\n stdout.write('\\n')\r\n else:\r\n stdout.write(' ')", "r, k = list(map(int,input().split()))\n\nfor i in range(r):\n for j in range(r):\n if i == j:\n print(k,end=\" \")\n else:\n print(0, end=\" \")\n print()", "size, k = map(int,input().split())\nfor r in range(size):\n for c in range(size):\n print(k if r==c else 0,end=\" \")\n print()\n", "l=list(map(int,input().split()))\r\nfor i in range(l[0]):\r\n for j in range(l[0]):\r\n k=0\r\n if i==j:\r\n k=l[1]\r\n print(k,end=' ')\r\n print( )", "n,m = map(int, input().split())\nmat = [0]*n\nfor i in range(n):\n mat[i] = m\n print(*mat)\n mat[i] = 0\n", "inp = [int(x) for x in input().split()]\r\nn = inp[0]\r\nk = inp[1]\r\nl = []\r\nfor i in range(n):\r\n l.append([])\r\n for j in range(n):\r\n if i == j:\r\n l[i].append(str(k))\r\n else:\r\n l[i].append(\"0\")\r\n print (\" \".join(l[i]))\r\n ", "list = [int(x) for x in input().split(\" \")]\r\n\r\nfor i in range(list[0]):\r\n arr = [list[1] if x == i else 0 for x in range(list[0])]\r\n print(\" \".join(str(x) for x in arr))\r\n\r\n", "integer = int\r\nstring = str\r\nlength = len\r\n\r\ndef main():\r\n n,k=list(map(integer,input().split()))\r\n for i in range(n):\r\n temp=[0]*n\r\n temp[i]=k\r\n print(*temp)\r\n\r\n\r\nmain()", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\ndef print_arr(arr):\r\n print(*arr, sep=' ')\r\n\r\n\r\ndef fill_arr(n):\r\n return [0 for x in range(n)]\r\n\r\n\r\nn, k = inp()\r\nm =fill_arr(n)\r\nm[0]=k\r\nfor i in range(n):\r\n print_arr(m)\r\n if(i<n-1):\r\n m[i],m[i+1]=m[i+1],m[i]\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append([0]*n)\r\nc=0\r\nfor i in l:\r\n i[c]=k\r\n print(*i)\r\n c+=1", "n,k=map(int,input().split(' ',1))\r\n\r\nfor x in range(n):\r\n for y in range(n):\r\n if x==y:\r\n print(k,end=' ')\r\n else:\r\n print(0,end=' ')\r\n print(' ')\r\n", "a,b=map(int,input().split())\r\nx=[[0 for i in range(a)] for i in range(a)]\r\nfor i in range(a):\r\n\tx[i][i]=b\r\n\tprint(*x[i])\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "n, s = map(int, input().split())\narr = [0] * (n-1)\narr.append(s)\n\nfor r in range(n):\n for c in range(r, r+n):\n print(arr[c%n], end=\" \")\n print()\n", "'''\n3 3\n1 1 1\n1 1 1\n1 1 1\n\n3 2\n1 1 0\n1 0 1\n0 1 1\n\n3 1\n1 0 0\n0 1 0\n0 0 1\n\n3 7\n1 1 5\n1 5 1\n5 1 5\n\n3 7\n7 0 0\n0 7 0\n0 0 7\n\n4 9\n9 0 0 0\n0 9 0 0\n0 0 9 0\n0 0 0 9\n'''\n\n\nn, k = map(int, input().split())\n\nl = [0] * n\nl[0] = k\n\nfor _ in range(n):\n print(\" \".join(str(num) for num in l))\n l = [l[-1]] + l[:-1]\n", "n, k = map(int, input().split())\nfor i in range(n):\n a = n * [0]\n for j in range(n):\n if j == n - i - 1:\n a[j] = k\n print(*a, sep=' ')\n", "n, k = map(int, input().split())\ns = [ \"0\" for _ in range(n) ]\n\ndef get_pattern(s, n, k) :\n out = ''\n for i in range(1) :\n for j in range(n) :\n s[j] = str(k)\n out += ' '.join(s) + \"\\n\"\n s = [ \"0\" for _ in range(n) ]\n return out\n\nres = get_pattern(s, n, k)\nprint(res)\n", "import sys\n\n(n, k) = map(int, sys.stdin.readline().split(' '))\n\nfor i in range(n):\n line = [0] * n\n line[i] = k\n sys.stdout.write('{}\\n'.format(' '.join(map(str,line))))\n\n", "n,k=[int(x) for x in input().split(' ')]\r\nl=[[0]*n for i in range(n)]\r\ni=0\r\n#print(l)\r\nwhile i<n:\r\n l[i][n-i-1]=k\r\n i+=1\r\nfor i in l:\r\n for j in i:\r\n print(j,end=\" \")\r\n print()\r\n", "n = list(map(int, input().split(' ')))\r\nk = n[1]\r\n\r\nfor i in range(n[0]):\r\n for j in range(n[0]):\r\n A = [0]*n[0]\r\n A[i] = k\r\n A = map(str, A)\r\n A = ' '.join(A)\r\n print(A)", "n, k = map(int, input().split())\r\nlst = []\r\nans = []\r\nfor i in range(n):\r\n if i+1 != n:\r\n lst.append(\"0\")\r\n else:\r\n lst.append(str(k))\r\nans.append(\" \".join(lst))\r\nfor i in range(1, n):\r\n x = lst.pop(0)\r\n lst.append(x)\r\n ans.append(\" \".join(lst))\r\nprint(\"\\n\".join(ans))\r\n", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, k = readln()\nfor i in range(n):\n print(*[k if i == j else 0 for j in range(n)])\n", "\r\nn, k = map(int, input().split())\r\na = [[0] * n for x in range(n)]\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if j == i:\r\n a[i][j] = k\r\n \r\n\r\nfor x in a:\r\n st = \"\"\r\n for y in x:\r\n st += str(y) + \" \"\r\n print(st)\r\n", "n, k = map(int, input().split())\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n if i == j:\r\n print(k, end=\" \")\r\n else:\r\n print(\"0\", end=\" \")\r\n print()\r\n", "n,m=map(int,input().split())\r\ni=0\r\nj=0\r\nfor i in range (n):\r\n for j in range (n):\r\n if i==j:\r\n print(m)\r\n else:\r\n print(0)\r\n j+=1\r\n i+=1\r\n", "a,b = (map(int,input().split()))\r\nc = []\r\nfor i in range(a):\r\n for j in range(a):\r\n if (i==j):\r\n c.append(b)\r\n \r\n else:\r\n c.append(\"0\")\r\n \r\n print(*c)\r\n c = []", "n, k = [int(x) for x in input().split()]\nfor i in range(n):\n\tfor j in range(n):\n\t\tif(j!=i):\n\t\t\tprint('0', end=' ')\n\t\telse:\n\t\t\tprint(str(k), end=' ')\n\tprint('\\n', end='')\n", "[n,k] = map(int, input().split())\na = k//n \nb = k - a*(n-1)\nfor j in range(n):\n for i in range(j):\n print (a, end = \" \")\n print (b, end = \" \")\n for j in range(n-j-1):\n print (a, end = \" \")\n print ()\n \n \n \n \n \n \n\n \n\n\n \n \n \n \n", "line = list(map(int,input().split()))\r\nn = line[0]\r\nk = str(line[1])\r\nfor i in range(0,n):\r\n stri = \"\"\r\n for j in range(0,n):\r\n if(i != j):\r\n stri = stri + \"0 \"\r\n else:\r\n stri = stri + k + \" \"\r\n print(stri[:-1])\r\n", "n, k = map(int, input().split())\r\nfor x in range (n):\r\n s = str(k)\r\n print('0 '*(x) + s, '0 '*(n-x-1))", "#A. Levko and Table\r\nn,k = map(int,input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(k, end = ' ')\r\n else:\r\n print(0,end = ' ')\r\n print()", "n,k = list(map(int , input().split()))\r\nx = k - (n - 1)\r\nc = 0\r\nli = ['1' for i in range(n)]\r\nfor i in range(n):\r\n li[i] = str(x)\r\n print(' '.join(li))\r\n li[i] = '1'", "size, k = map(int,input().split())\nfor r in range(size):\n for c in range(size):\n if r==c:\n print(k,end=\" \")\n else:\n print(0,end=\" \")\n print()\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn,k = li()\r\nfor i in range(n):\r\n x = [0] * n\r\n x[i] = k\r\n print(*x)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n for j in range(n):\r\n print([0, k][i == j], end = \" \")\r\n print()", "n, k = list(map(int, input().split()))\nmd = k - (n - 1)\n\nfor i in range(n) :\n for j in range(n) :\n if i == j :\n print(md, end = ' ')\n else :\n print(1, end = ' ')\n print()", "n, k = map(int, input().split())\nfor i in range(n):\n result = \"\"\n for j in range(n):\n if i == j:\n result += str(k)\n else:\n result += str(0)\n result += \" \"\n print(result)\n", "n, k = map(int, input().split())\r\nl = [k]\r\nfor i in range(n - 1):\r\n l.append(0)\r\nfor i in range(n):\r\n print(*l)\r\n x = l[n - 1]\r\n del(l[n - 1])\r\n l.insert(0, x)\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\n\r\nn, k = map(int, input().split())\r\nfor i in range(n):\r\n ll = [0]*n\r\n ll[i]=k\r\n print(*ll)", "n, k = input().split()\r\ny: int = 0\r\nans: list = []\r\nwhile int(y) < int(n):\r\n for x in range(int(n)):\r\n if x == y:\r\n ans.append(k)\r\n else:\r\n ans.append(0)\r\n y = int(y) + 1\r\n print(*ans)\r\n ans.clear()\r\n", "n, k = [int(i) for i in input().split()]\r\na = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n a[i][i] = k\r\nfor i in a:\r\n print(*i)", "\"\"\"\n\thttps://codeforces.com/problemset/problem/361/A\n\tInput\n\t\tn\tnumber of rows and columns\n\t\tk \tsum\n\tOutput\n\t\t\tbeautiful table\n\"\"\"\n\nn, k = map(int, input().split())\n\n# 1 generate numbers\nrow = [k // n] * n\n\n# +1 to some elements to reach k\ndiff = k - sum(row)\n\nfor x in range(0, diff):\n\trow[x] += 1\n\nfor y in range(0, n):\n\tprint(*row)\n\trow.insert(0, row.pop())\n\n# print elements", "n,k = map(int,input().split())\np = [ [0 for j in range(n)] for j in range(n)]\nfor i in range(n):\n\tp[i][i] = k\nfor i in range(n):\n\tprint(*p[i])\n", "\r\ndef solution():\r\n\tn,k=map(int,input().split())\r\n\tarr=[[0 for i in range(n)] for j in range(n)]\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif i==j:\r\n\t\t\t\tarr[i][j]=k\r\n\tfor i in range(n):\r\n\t\tprint(*arr[i])\r\n\r\n\r\n\r\n\treturn\r\n\r\n\r\n# t=int(input())\r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n\r\n\t", "n, k = map(int, input().split())\r\nans = [[0]*n for i in range(n)]\r\nq = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if j == q:\r\n ans[i][j] = k\r\n q += 1\r\nfor i in range(n):\r\n print(*ans[i])", "IL = lambda: list(map(int, input().split()))\r\n\r\nn, k = IL()\r\nfor i in range(n):\r\n r = [0]*n\r\n r[i] = k\r\n print(*r)", "n, k = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n d = ['0']*n\r\n d[i] = k\r\n print(*d)\r\n", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,k=q()\r\nprint('\\n'.join([' '.join([f'{k}' if i==j else '0' for i in range(n)]) for j in range(n)]))", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(0,n):\r\n lo=[]\r\n for j in range(0,n):\r\n if i==j:\r\n lo.append(m)\r\n else:\r\n lo.append(0)\r\n l.append(lo)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n print(l[i][j],end=' ')\r\n print()\r\n", "n, k = map(int, input().split())\r\na = [0] * n\r\na[0] = k\r\nfor i in range(n):\r\n print(*a)\r\n b = [0] * n\r\n for j in range(n):\r\n b[(j + 1) % n] = a[j]\r\n a = b\r\n", "n,m=map(int,input().split())\r\nans=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n ans[i][j]=m\r\nfor i in range(n):\r\n print(*ans[i])", "n,k=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(\"0 \"*i+str(k)+\" 0\"*(n-i-1))", "a, b = map(int, input().split())\r\n\r\np = 0\r\n\r\nfor i in range(a):\r\n for j in range(a):\r\n if i == j:\r\n print(b, end=' ')\r\n else:\r\n print(0, end=' ')\r\n print()", "n, k = map(int, input().split())\n\nfor i in range(n):\n row = [0 for _ in range(n)]\n row[i] = k\n print(' '.join(str(i) for i in row))\n\n\n\n\n\n \n \n \n", "n, m = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(*([0] * i + [m] + (n - 1 - i) *[0]))", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\na,b=map(int, input().split())\r\nfor i in range(a):\r\n for j in range(a):\r\n if i == j:\r\n print(b, end=' ')\r\n else:\r\n print(0, end=' ')\r\n print()", "n,k = map(int, input().split())\r\na = k // n\r\nb = k - a*(n-1)\r\n# This formula works for both cases whether k is exactly divisible by n or not\r\n# Put b on the diagonals, else put a\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i == j): \r\n print(b, end=' ')\r\n else: \r\n print(a, end=' ')\r\n print()\r\n", "def process():\r\n n, k = list(map(int, input().split()))\r\n \r\n matrix = [['0' if i != j else str(k) for i in range(n)] for j in range(n)]\r\n \r\n for row in matrix:\r\n print(' '.join(row))\r\n \r\nprocess()", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n t=[]\r\n for j in range(n):\r\n if j==n-i-1:\r\n t.append(k-(n-1))\r\n else:\r\n t.append(1)\r\n for b in range(len(t)):\r\n if b==len(t)-1:\r\n print(t[b])\r\n else:\r\n print(t[b],end=\" \")", "n,k=[int(i) for i in input().split()]\r\na=[]\r\nfor i in range(1,n):\r\n a.append(1)\r\nd=k-(1*(n-1))\r\na.append(d)\r\nprint(*a)\r\nfor i in range(1,n):\r\n print(*a[i:]+a[0:i])", "n,k=[int(x) for x in input().split()]\r\na=[[0 for i in range(n)] for j in range (n)]\r\nfor i in range(n):\r\n a[i][i]=k\r\nfor i in range (n):\r\n for j in range(n):\r\n print(a[i][j],end=' ')\r\n print()\r\n \r\n", "n, k = [int(x) for x in input().split()]\r\nif k % n == 0:\r\n matrix = [[k // n] * n] * n\r\nelse:\r\n matrix = []\r\n rem = k % n\r\n pos = 0\r\n for i in range(n):\r\n matrix.append([])\r\n for j in range(n):\r\n matrix[i].append(k//n)\r\n\r\n for m in range(n):\r\n matrix[m][pos] += rem\r\n pos += 1\r\n\r\nfor row in matrix:\r\n newRow = [str(x) for x in row]\r\n print(\" \".join(newRow))\r\n\r\n", "n, k = map(int, input().split())\r\n \r\nfor row in range(n):\r\n for col in range(n):\r\n if row == col:\r\n print(k, end=' ')\r\n else:\r\n print(0, end=' ')\r\n print()", "n,k=map(int,input().split())\r\nmat=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n mat[i][j]=k\r\nfor i in range(n):\r\n for j in range(n):\r\n print(mat[i][j],end=\" \")\r\n print()\r\n", "from sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn,k=inp()\r\n\r\nfor i in range(n):\r\n arr=[0]*n\r\n arr[i]+=k\r\n print(*arr)\r\n\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 = map(int, input().strip().split())\n\nrow = [k] + [0]*(n-1)\n\nfor _ in range(n):\n row.append(row.pop(0))\n print(*row)", "n, k = map(int, input().split())\r\n\r\ndef create_sq_matrix(size):\r\n matrix = []\r\n a = []\r\n for i in range(0, size):\r\n for j in range(0, size):\r\n a.append(0)\r\n matrix.append(a)\r\n a = []\r\n return matrix\r\n\r\na = create_sq_matrix(n)\r\nfor i in range(0, len(a)):\r\n for j in range(0, len(a)):\r\n if i == j:\r\n a[i][j] = k\r\n\r\nfor i in range(0, len(a)):\r\n for j in range(0, len(a)):\r\n print(a[i][j], end=\" \")\r\n print()\r\n", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\n\r\ndef solve():\r\n\tn, k = read()\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif i == j:print([k//n, k%n+(k//n)][k%n != 0], end=[\" \", \"\\n\"][j == n-1])\r\n\t\t\telse:print(k//n, end=[\" \", \"\\n\"][j == n-1])\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()\r\n\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\na = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n a[i][j] = k\r\nfor elem in a:\r\n print(*elem)\r\n\r\n", "def print_matrix(m):\r\n print('\\n'.join(map(lambda row: ' '.join(map(str, row)), m)))\r\n\r\n\r\nn, k = map(int, input().split(' '))\r\nres = []\r\nfor i in range(n):\r\n res.append([])\r\n for j in range(n):\r\n if i == j:\r\n res[i].append(1 + k - n)\r\n else:\r\n res[i].append(1)\r\nprint_matrix(res)\r\n", "n,k=map(int,input().split())\nans=[]\nfor i in range(n):\n x=[]\n r=k\n for j in range(n):\n if i == j :\n x.append(k)\n else:\n x.append(0)\n ans.append(x)\nfor i in range(n):\n print(*ans[i])\n", "x,y=map(int,input().split())\r\nd=0\r\nfor i in range(x):\r\n for j in range(x):\r\n if(j==d):\r\n print(y,end=\" \")\r\n else:\r\n print(0,end=\" \")\r\n d+=1\r\n print(end=\"\\n\")\r\n \r\n", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nn,k=map(int,input().split())\r\nif n==k:\r\n l=[1]*n\r\nelif n<k:\r\n l=[1]*(n-1)\r\n l.append((k-n+1))\r\nelse:\r\n l=[0]*(n-1)\r\n l.append(k)\r\n\r\nfor i in range(n):\r\n print(*l)\r\n l=l[1:]+l[:1]\r\n", "n,m=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n for t in range(i):\r\n print(0,end=' ')\r\n print(m,end=' ')\r\n for t in range(n-1-i):\r\n print(0,end=' ')\r\n print(end='\\n')", "n,k=list(map(int,input().split()))\ns = [ [ 0 for i in range(n) ] for j in range(n) ]\n\nfor i in range(n):\n for j in range(n):\n if i==j:\n s[i][j]=k\nfor i in range(n):\n print(*s[i])\n \t\t \t\t\t \t\t \t\t\t \t \t\t \t\t\t\t\t", "n, m = map(int, input().split())\r\nn -= 1\r\nfor i in range(n+1):\r\n print('0 '*i+str(m)+' 0'*(n-i))", "from array import *\r\nn,k=map(int,input().split())\r\n\r\nar=[[0 for j in range(n)]for i in range(n)]\r\n\r\nfor i in range(n):\r\n ar[i][i]=k\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n print(ar[i][j],end=\" \")\r\n print()\r\n ", "n, k = input().split()\r\nn, k = int(n), int(k)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n print(k, end=\" \")\r\n elif j == n - 1:\r\n print(0)\r\n else:\r\n print(0, end=\" \")\r\n", "n,k=map(int,input().split())\nfor i in range(n):\n for j in range(n):\n print('0' if i is not j else str(k),end=' ')\n print()", "n, k = map(int, input().split())\r\n\r\n\r\nans = []\r\nif k <= n:\r\n for i in range(n):\r\n row = [0] * n\r\n row[i] = k\r\n ans += [row]\r\nelse:\r\n for i in range(n):\r\n row = [1] * n\r\n row[i] = k - (n - 1)\r\n ans += [row]\r\n \r\nfor a in ans:\r\n for j in a:\r\n print(j, end=' ')\r\n print() ", "n, k = map(int, input().split())\nfor i in range(n):\n ar = [1] * i + [k - n + 1] + [1] * (n - i - 1)\n print(' '.join(str(i) for i in ar))", "n,k=map(int,input().split())\r\ns=[[0]*n for i in range(n)]\r\n\r\nfor i in range(n):\r\n s[i][i]=k\r\nprint(\"\\n\".join([\" \".join([str(j) for j in i]) for i in s]))", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n print(\"0 \" * i + str(k) + \" 0\" * (n - i - 1))\r\n", "n,k=map(int,input().split())\r\nx=k-n+1\r\n\r\nj=n\r\nfor k in range(n):\r\n l=[]\r\n for i in range(1,n+1):\r\n if i==j:\r\n l.append(x)\r\n j-=1\r\n else:\r\n l.append(1)\r\n print(*l)", "[n,m]=map(int, input().split())\r\nfor i in range(n):\r\n print('0 '*(n-i-1)+str(m)+' '+'0 '*(0+i))", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nn,k=map(int,input().split())\nfor x in range(n):\n\tfor y in range(n):\n\t\tprint(0 if x!=y else k,sep=' ')\n\tprint()\n", "n, k = map(int, input().strip().split())\r\nl=[[0 for _ in range(n)] for jj in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if j == i:\r\n l[i][j] = k\r\n print(l[i][j], end=' ')\r\n print()\r\n", "def get_row(req_sum, n):\r\n each = int(req_sum / n)\r\n current_sum = each * (n - 1)\r\n result = []\r\n for i in range(n-1):\r\n result.append(each)\r\n result.append(req_sum - current_sum)\r\n return result\r\n\r\ndef print_table(l):\r\n shift = 0\r\n for i in range(0, len(l)):\r\n result = \"\"\r\n for j in range(0, len(l)):\r\n result += str((l[((j + shift) % len(l))]))\r\n if j < (len(l) -1) :\r\n result += \" \"\r\n print(result)\r\n shift += 1\r\n \r\ndef main():\r\n l = input().split()\r\n n = int(l[0])\r\n k = int(l[1])\r\n \r\n print_table(get_row(k, n))\r\n\r\nmain()\r\n", "n,m = map(int,input().split())\r\nfor i in range(n) :\r\n for j in range(n) :\r\n if(i == j) :\r\n print(m , end = \" \")\r\n else :\r\n print(0, end = \" \")\r\n print()\r\n", "s1 = input()\r\ns = s1.split()\r\nn = int(s[0])\r\nk = int(s[1])\r\nfor row in range(n):\r\n for col in range(n):\r\n if(row==col):\r\n print(k,end=\" \")\r\n else:\r\n print(\"0\",end=\" \")\r\n print()\r\n", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n L=[0]*n\r\n L[i]=k\r\n print(*L)\r\n \r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=[0]*n;i=0\r\nwhile i<n:\r\n a[i]=k\r\n print(*a)\r\n a=[0]*n\r\n i=i+1\r\n", "n, k = map(int, input().split())\n\nmatrix = [[0 for _ in range(n)] for _ in range(n)]\n\nfor i, row in enumerate(matrix):\n row[i] = k\n print(*row)\n", "a,b = map(int,input().split())\r\nfor i in range(a):\r\n c = [0]*a\r\n c[i] = b\r\n print(*c)", "n,m=map(int,input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n print(m)\r\n else:\r\n print(\"0\")", "n, k = map(int, input().split())\r\nMat = [[k if j==p else 0 for j in range(n)] for p in range(n)]\r\nfor q in Mat: print(*q)", "def main():\r\n n, k = input().split()\r\n n = int(n)\r\n for i in range(n):\r\n print('0 ' * i + k + ' 0' * (n - i - 1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n print(k if i == j else 0, end = ' ')\r\n print()", "n, k = map(int, input().split())\r\n\r\ntable = [[0]*n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n table[i][i] = k\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n print(table[i][j], end=\" \")\r\n print()\r\n\r\n# Store the table in a variable\r\ntable_values = [row[:] for row in table]\r\n", "import math\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n for row in range(1, n+1):\r\n print(' '.join(map(str, (k if val == row else 0 for val in range(1, n+1)))))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=map(int,input().split())\r\nn-=1\r\nfor i in range(n+1):\r\n print('0 '*i+str(m)+' 0'*(n-i))", "n, k = map(int, input().split())\r\nt = [[0] * n for _ in range(n)]\r\nfor i in range(n):\r\n t[i][i] = k \r\nfor r in t:\r\n print(*r)", "import time\r\nimport math\r\nfrom sys import stdin, stdout\r\ndef I():\r\n return int(stdin.readline()) # For single input\r\ndef In():\r\n return map(int, stdin.readline().split()) # For multiple input\r\ndef L():\r\n return list(map(int, stdin.readline().split())) # For array input\r\ndef Si():\r\n return sorted(list(map(int, stdin.readline().split()))) # For sorted array\r\ndef Si():\r\n # For sorted array(in reverse order)\r\n return sorted(list(map(int, stdin.readline().split())), reverse=True)\r\ndef P(x):\r\n return stdout.write(str(x)) # print without newline\r\ndef Pi(x, y):\r\n return stdout.write(str(x)+\" \"+str(y))\r\n\r\ndef solve():\r\n n,k = In()\r\n for i in range(n):\r\n for j in range(n):\r\n P(k if(i==j) else \"0\") \r\n P(\" \")\r\n P(\"\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "n,k=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(i*'0 ',k,(n-i-1)*' 0',sep='')", "\r\n[n, k] = map(int, input().split())\r\n\r\n# k 0 0 0 0 line 0 has 0 0's, followed by k, then by (n-1) 0's\r\n# 0 k 0 0 0 line 1 has 1 0's, followed by k, then by (n-2) 0's\r\n# 0 0 k 0 0 line 2 has 2 0's, followed by k, then by (n-3) 0's\r\n# 0 0 0 k 0 line 3 has 3 0's, followed by k, then by (n-4) 0's\r\n# 0 0 0 0 k line 4 has 4 0's, followed by k, then by (n-5) 0's\r\n\r\nfor i in range(n):\r\n print(i*\"0 \", k, \" \", (n-i-1)*\"0 \", sep=\"\")", "n, k = input().split()\r\nfor i in range(0, int(n)):\r\n for j in range(0, int(n)):\r\n if i == j:\r\n print(int(k), end=\" \")\r\n else:\r\n print(0, end=\" \")\r\n print()\r\n", "x=0\r\nn,k=map(int,input().split())\r\nk-=n-1\r\nfor i in range(n):\r\n for z in range(n):\r\n if z==x:\r\n print(k,end=' ')\r\n else:\r\n print('1',end=' ')\r\n x+=1\r\n print()", "n, k = map(int, input().split())\r\nlst = [\"\"] * n\r\nfor x in range(n - 1, -1, -1): lst[n - x - 1] = \"0 \" * x + str(k) + \" \" + \"0 \" * (n - x - 1)\r\nfor x in lst: print(x)", "n, k = [int(x) for x in input().split()]\nfor i in range(n):\n\tprint(' '.join(['0'] * i + [str(k)] + ['0'] * (n - i - 1)))\n", "a, b = map(int, input().split())\r\nc = [1 for i in range(a)]\r\nfor j in range(a):\r\n if c[j] == 1:\r\n c[j] = b - (a-1)\r\n print(*c, sep=' ')\r\n c = [1 for i in range(a)]", "a, b=map(int, input().split())\r\nfor i in range(a):\r\n c=[0]*a\r\n c[i]=b\r\n print(*c)\r\n \r\n", "n,k=[int(z) for z in input().split()]\r\nfor i in range(n):\r\n l=[]\r\n for j in range(n):\r\n if i==j:\r\n l.append(k)\r\n else :\r\n l.append(0)\r\n print(*l,sep=\" \")", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=[]\r\n for j in range(n):\r\n a.append(0)\r\n a[i]=k\r\n l.append(a)\r\n print(*a)\r\n", "n, k = map(int, input().split())\r\n\r\nfor i in range(n):\r\n lst = [0] * n\r\n lst[i] = k\r\n print(*lst)\r\n\r\n", "#levkoandtable\nN, K = [int(x) for x in input().split()]\nfor i in range(1, N+1):\n for j in range(1, N+1):\n if i==j:\n print(K, end=\" \")\n else:\n print(0, end=\" \")\n print (\"\")", "n, s = map(int, input().split())\nfor i in range(n):\n for j in range(n):\n print(s, end= \" \") if i == j else print(0, end=\" \")\n print()\n", "n,k=map(int,input().split())\r\nz=0\r\nl=[]\r\nfor i in range(n):\r\n li=[0]*n\r\n for j in range(n):\r\n if z==j:\r\n li[j]=k\r\n l.append(li)\r\n z+=1\r\nfor i in range(n):\r\n for j in range(n):\r\n print(l[i][j],end=\" \")\r\n print()", "n, k = map(int, input().split())\r\nmatrix = [[1 for i in range(n)] for j in range(n)]\r\ntemp = k - (n - 1)\r\nfor i in range(n):\r\n matrix[i][i] = temp\r\nfor i in matrix:\r\n print(*i)", "n, k = [int(x) for x in input().split()]\r\nm = [[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n m[i][i] = k\r\nfor l in m:\r\n print(' '.join(map(str, l)))\r\n", "n,m = map(int,input().split())\r\nfor i in range(n):\r\n a = [0 for i in range(n)]\r\n a[i] = m\r\n print(\" \".join(map(str,a)))\r\n", "n,k=map(int,input().split())\nfor i in range(n):\n\tprint(i*'0 ',end='')\n\tprint(k,end='')\n\tprint((n-1-i)*' 0')\n", "inp = list(map(int, input().split(\" \")))\r\nstore = []\r\nfor i in range(inp[0]):\r\n store.append([\"0\"]*inp[0])\r\nfor i in range(inp[0]):\r\n store[i][i] = str(inp[1])\r\nfor x in store:\r\n print(\" \".join(x))", "n,k = map(int,input().split())\n\nrow = [0]*n\nfor i in range(n):\n row[i] = k\n print(*row)\n row[i] = 0\n", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n a = [0] * n\r\n a[i] = k\r\n print(*a)", "n,k=map(int,input().split())\r\nplace = 0\r\ntable = []\r\nfor i in range(n):\r\n line = list('0'*n)\r\n line[place]=f'{k}'\r\n table.append(line)\r\n place+=1\r\n \r\nfor g in table:\r\n for j in g:\r\n print(j , end=\" \")\r\n print(\"\")", "n, k = map(int, input().split())\r\nfor i in range (n):\r\n for j in range (n):\r\n if i == j: print(k,end = \" \")\r\n else: print(0,end = \" \")\r\n print()", "a = input().split()\r\nn = int(a[0])\r\nx = int(a[1]) - n + 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n print(x , end = \" \")\r\n else:\r\n print(1 , end = \" \")\r\n print()\r\n", "[n, k] = [int(x) for x in input().split()]\r\nfor i in range(n): print(i*'1 ' + str(k-n+1) + ' ' + (n-1-i)*'1 ')\r\n", "\ndef levko_tables(n: int, k: int) -> str:\n matrix = [[0] * n for i in range(n)] # going to be consisting of n emtpy lists inside of it\n # a counter will be used ot indicate whether the number needs ot be the k value\n # on the diagonal\n # row = [row for row in matrix] << Could using list comprehension here work?\n for i in range(n): # n times this loop will be run\n matrix[i][i] = k\n return matrix\n\ndef output_matrix(n: int, matrix: list):\n for row in matrix:\n for el in row:\n print(str(el) + \" \", end = '')\n print('')\n return\n\ndef main():\n n, k = (input().split())\n n = int(n)\n k = int(k)\n output_matrix(n, levko_tables(n, k))\n\nif __name__ == '__main__':\n main()", "n,k = map(int, input().split())\r\n\r\narr = [[0 for j in range(n)] for i in range(n)]\r\n\r\ncol = n-1\r\n\r\nfor i in range(n):\r\n \r\n for j in range(n):\r\n \r\n arr[i][j] = k-(n-1) if j == col else 1\r\n \r\n col -= 1\r\n \r\nfor item in arr:\r\n \r\n for i in item:\r\n \r\n print(i,end = \" \")\r\n \r\n print()", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append([0]*n)\r\nfor _ in range(n):\r\n for __ in range(n):\r\n if _==__:\r\n l[_][__]=k\r\nfor ___ in l:\r\n print(*___,sep=' ')", "n, lim = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append([0] * n)\r\nx = 0\r\ny = 0\r\nwhile x < n:\r\n l[x][y] = lim\r\n x += 1\r\n y += 1\r\nfor i in range(n):\r\n for j in range(n):\r\n print(l[i][j],end=\" \")\r\n print()\r\n", "n, k = list(map(int, input().split(' ')))\r\nfor i in range(n):\r\n s = [0] * n\r\n s[i] = k\r\n print(*s)", "d,v = map(int,input().split())\r\nlist1 = [v]+[0]*(d-1)\r\nans = ''\r\nfor i in range(d):\r\n for e in range(d):\r\n ans += str(list1[e]) + ' '\r\n if e == d-1:\r\n ans += '\\n'\r\n list1.insert(0,list1.pop())\r\nprint(ans)", "def main():\n n, k = map(int, input().split())\n for i in range(n):\n l = [0] * n\n l[i] = k\n print(*l)\n\nif __name__ == '__main__':\n main()", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n \tprint(' '.join(['0']*i+[str(k)]+['0']*(n-i-1)))", "def main():\r\n n, k = map(int, input().split())\r\n dp = [[0 for i in range(n)] for i in range(n)]\r\n for i in range(n):\r\n dp[i][i] = k\r\n for j in range(n):\r\n print(' '.join(map(str, dp[j])))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\n\r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef In():\r\n return map(int, stdin.readline().split())\r\n\r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nn, m = In()\r\nfor i in range(n):\r\n arr = [0]*i + [m]+ [0]*(n-1-i)\r\n for j in range(n):\r\n print(arr[j], end = \" \")\r\n print()", "x=list(map(int,input().split()))\r\nfor i in range(x[0]):\r\n print(*(\"0\"*i),x[1],*(\"0\"*(x[0]-(i+1))),sep=' ')\r\n \r\n", "n, k = map(int, input().split())\r\nA = [[0]*n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n A[i][i] = k\r\n\r\nfor row in A:\r\n print(*row)", "n,k = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n for j in range(n):\r\n print(k if i==j else 0,end=\" \")\r\n print()", "n, k = (int(i) for i in input().split())\nres = []\nfor i in range(n):\n row = [0] * n\n row[i] = k\n res.append(row)\nres = \"\\n\".join(\" \".join(str(c) for c in r) for r in res)\nprint(res)\n", "def levko_and_table():\r\n n,k = map(int,input().split())\r\n lst = [[0 for x in range(n)] for x in range(n)]\r\n \r\n for i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n lst[i][j]=k\r\n \r\n for ele in lst:\r\n for i in ele:\r\n print(i,end=' ')\r\n print()\r\n\r\n\r\nlevko_and_table() ", "n,k= input().split()\r\nn= int(n)\r\nk= int(k)\r\nl=[]\r\ntemp=[]\r\nfor i in range(n):\r\n temp=[]\r\n for j in range(n):\r\n if i==j:\r\n temp.append(k)\r\n else:\r\n temp.append(0)\r\n l.append(temp)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n print(l[i][j], end=' ')\r\n print()", "n, k=[int(v) for v in input().split()]\r\nfor j in range(n):\r\n x=[0 for v in range(n)]\r\n x[j]=k\r\n print(\" \".join([str(v) for v in x]))", "def main():\r\n n, k = map(int, input().split())\r\n\r\n matrix = [[0 for i in range(n)] for i in range(n)]\r\n\r\n start = 0\r\n \r\n for i in range(n):\r\n matrix[i][start] = k\r\n start += 1\r\n\r\n for i in matrix:\r\n print(*i)\r\n\r\nmain()\r\n\r\n", "n,k = map(int,input().split())\r\n\r\ntemp = k\r\nlst = []\r\n\r\nif (n-1)*(n)//2 > k:\r\n lst = [k]+[0]*(n-1)\r\nelse:\r\n for i in range(n):\r\n if i == n-1:\r\n lst.append( max(0,temp) )\r\n else:\r\n lst.append(i)\r\n temp -= i \r\n \r\nfor i in range(n):\r\n print(*lst)\r\n t = lst.pop(0)\r\n lst.append(t)\r\n \r\n \r\n ", "n,k=map(int,input().split())\r\nl=[[0 for j in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n l[i][j]=k\r\nfor i in range(n):\r\n for j in range(n):\r\n print(l[i][j],end=\" \")\r\n print(\"\\n\")", "i=input().split()\r\nn,k=int(i[0]),int(i[1])\r\nd=0\r\nmat=[]\r\nlast_i=-1\r\nfor i in range(n):\r\n for j in range(n):\r\n if j==d and i!=last_i:\r\n print(k,end=\" \")\r\n last_i=i\r\n d += 1\r\n else:\r\n print(0,end=\" \")\r\n print()", "n,k = map(int, input().split())\r\nfor i in range(n):\r\n for j in range(i):\r\n print(0, end=' ')\t# this ends the print with space\r\n print(k, end=' ') \t# instead of with new line\r\n for j in range(n-i-1):\r\n print(0, end=' ')\r\n print()\t", "import copy\r\n\r\nn,k=map(int,input().split())\r\n\r\nif k%n==0:\r\n f=k//n\r\n a=[f for i in range(n)]\r\n for i in range(n):\r\n print(*a,sep=' ')\r\nelse:\r\n f=k//(n-1)\r\n g=k%(n-1)\r\n a=[f for i in range(n)]\r\n for i in range(n):\r\n s=copy.deepcopy(a)\r\n s[i]=g\r\n print(*s,sep=' ')\r\n s=[]\r\n\r\n", "n,k = map(int,input().split())\r\n\r\ntables = [[0 for _ in range(n)] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n tables[i][i]=k\r\n print(*tables[i])", "n, k = map(int, input().split())\r\nif n == 1:\r\n print(k)\r\n quit()\r\nfor i in range(n):\r\n for j in range(n):\r\n if j != i:\r\n print(k//(n-1), end=\" \")\r\n else:\r\n print(k % (n-1), end=\" \")\r\n print()\r\n", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n\tb=[]\r\n\tfor j in range(n):\r\n\t\tif j==i:\r\n\t\t\tb.append(k)\r\n\t\telse:\r\n\t\t\tb.append(0)\r\n\tprint(*b)\t\r\n\t\t\t", "import math\ndef solve(n, k):\n for i in range(n):\n arr = [0]*n\n arr[i] = k\n print(*arr,end='\\n')\ndef main():\n i =list(map(int,input().split(' ')))\n #n = int(input())\n #arr = []\n #for j in range(n):\n #i = list(map(int,input().split(' ')))\n #arr.append(i)\n solve(*i)\n\nmain()", "n,m=[int(x) for x in input().split()]\r\nn-=1\r\nfor i in range(n+1):\r\n print('0 '*i+str(m)+' 0'*(n-i))", "size, num = map(int, input().split())\r\nans = []\r\nfor x in range(size):\r\n ans.append([0] * size)\r\nfor index, x in enumerate(ans):\r\n x[index] = num\r\n print(*x)\r\n", "n ,m = map(int ,input() .split())\r\nfor i in range(n):\r\n if i == 0:\r\n print(m ,(n - i - 1) * '0 ' ,sep = ' ')\r\n else:\r\n print(i * '0 ' ,m ,(n - i - 1) * '0 ' ,sep = ' ')\r\n", "n,k = map(int, input() .split())\r\nfor i in range (n):\r\n for j in range(n):\r\n if i == j:\r\n print(k , end = ' ')\r\n else:\r\n print('0', end=' ')\r\n print() ", "if __name__ == '__main__':\n\tn, k = map(int,input().rstrip().split())\n\ta = []\n\tfor i in range(n):\n\t\tb = []\n\t\tfor j in range(n):\n\t\t\tif i == j:\n\t\t\t\tb.append(k)\n\t\t\telse:\n\t\t\t\tb.append(0)\n\t\ta.append(b)\n\tfor row in a:\n\t\tprint (' '.join(map(str,row)))", "n,k = map(int, input().split())\r\n# arr = list(map(str, input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j: print(k, end = \" \")\r\n else: print(\"0\", end = \" \")\r\n print()", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n print(*[(int(i == j)*k)for j in range(n)])\r\n", "n,k=map(int,input().split())\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(c==j):\r\n print(k,end=\" \")\r\n else:\r\n print(0,end=\" \")\r\n c+=1\r\n print()", "n,k=map(int,input().split())\r\nnumberofones=n-1\r\nreq=k-(n-1)\r\ncnt=n-1\r\nfor i in range(n):\r\n for j in range(n):\r\n if j==cnt:\r\n print(req,end=\" \")\r\n else:\r\n print(1,end=\" \")\r\n cnt-=1\r\n print()\r\n ", "\"\"\"from numpy import *\r\na,b=map(int,input().split())\r\narr=zeros([a,a],dtype=int)\r\nfor i in range(a):\r\n for j in range(a):\r\n if i==j:\r\n arr[i][j]=b\r\nfor x in arr:\r\n print(*x) \r\n\r\n\"\"\"\r\nn,k=map(int,input().split())\r\nfor i in range(n):\r\n\tprint(i*'0 ',end='')\r\n\tprint(k,end='')\r\n\tprint((n-1-i)*' 0')\r\n", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n if i != n-1:\r\n print(*([0]*(n-i-1)), end = ' ')\r\n print(k, end = ' ')\r\n print(*([0]*(i)))", "def rotate(c,d):\r\n return c[d:]+c[:d]\r\nn,m = map(int,input().split())\r\nc = []\r\nif(m%n == 0):\r\n c = [m//n]*n\r\nelse:\r\n c = [m//n]*(n-1)\r\n c.append(m-sum(c))\r\np = []\r\nfor i in range(n):\r\n p.append(rotate(c,i))\r\nfor i in p:\r\n print(*i)", "n,k = map(int,input().split())\r\nfor i in range(1,n+1):\r\n print('0 '*(n-i)+str(k)+' '+'0 '*(i-1))", "import string\r\n\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n output_list = [[str(0) for i in range(n)] for i in range(n)]\r\n for i in range(n):\r\n output_list[i][i] = str(k)\r\n return \"\\n\".join([\" \".join(i) for i in output_list])\r\n\r\n\r\nprint(main_function())\r\n\r\n", "n, k = map(int, input().split())\r\ni = k // n\r\np = [str(i)] * (n - 1) + [str(i + k % n)]\r\nfor i in range(n):\r\n print(' '.join(p))\r\n p = p[1: ] + p[: 1]", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if j==n-i-1:\r\n print(k-n+1,end=\" \")\r\n else:\r\n print(1,end=\" \")\r\n print()", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n a = [0]*n\r\n a[i] = k\r\n print(*a)", "n, k = map(int, input().split())\na = []\nfor i in range(n):\n a.append([])\n for _ in range(n):\n a[i].append(0)\nfor i in range(n):\n a[i][i] = k\nfor i in range(n):\n print(*a[i])", "# http://codeforces.com/problemset/problem/361/A\r\nget=lambda:list(map(int,input().split()))\r\nn,m=get()\r\nfor i in range(n):\r\n c=['0']*n\r\n c[i]=str(m)\r\n print(' '.join(c))\r\n", "a,b=map(int,input().split())\r\nfor i in range(a):c=[0]*a;c[i]=b;print(*c)", "n,m=map(int,input().split())\r\nz=[]\r\nfor j in range(n):\r\n v=(('0 ')*n).split()\r\n z.append(v)\r\nc=0\r\nfor i in range(len(z)):\r\n z[i][c]=str(m)\r\n c+=1\r\nfor i in z:\r\n print(*i)", "n, k = map(int, input().split())\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = k\r\n print(*a)\r\n a[i] = 0", "a , b = list(map(int,input().split()))\r\nl = []\r\nfor i in range(a):\r\n\tl.append([0 for i in range(a)])\r\nfor i in range(a):\r\n\tl[i][i] = b\r\nfor j in range(len(l)):\r\n\tprint(*l[j])\t", "n, k = map(int, input().split())\ns = [ \"0\" for _ in range(n) ]\n\nfor i in range(1) :\n for j in range(n) :\n s[j] = str(k)\n s = ' '.join(s)\n print(s)\n s = [ \"0\" for _ in range(n) ]\n", "x=input()\r\nx=x.split(\" \")\r\nif int(x[0])==1:\r\n print(x[1])\r\nelif int(x[0])%2==0:\r\n n=int(x[1])\r\n m=0\r\n r=[]\r\n e=\"0\"\r\n for i in range(int(x[0])-1):\r\n e=e+\" \"+\"0\"\r\n for f in range(int(x[0])):\r\n r.append(e)\r\n a=0\r\n b=1\r\n c=2*(int(x[0])-1)\r\n p=[]\r\n s=0\r\n while a<=len(r)-1:\r\n print(s*\"0 \"+str(m)+r[a][b:c]+str(n)+s*\" 0\")\r\n print(s*\"0 \"+str(n)+r[a+1][b:c]+str(m)+s*\" 0\")\r\n a=a+2\r\n b=b+2\r\n c=c-2\r\n s=s+1\r\nelse:\r\n n = int(x[1])\r\n m = 0\r\n r = []\r\n e = \"0\"\r\n for i in range(int(x[0]) - 1):\r\n e = e + \" \" + \"0\"\r\n for f in range(int(x[0])):\r\n r.append(e)\r\n a = 0\r\n b = 1\r\n c = 2 * (int(x[0]) - 1)\r\n p = []\r\n s = 0\r\n while a <= len(r) - 2:\r\n print(s * \"0 \" + str(m) + r[a][b:c] + str(n) + s * \" 0\")\r\n print(s * \"0 \" + str(n) + r[a + 1][b:c] + str(m) + s * \" 0\")\r\n a = a + 2\r\n b = b + 2\r\n c = c - 2\r\n s = s + 1\r\n print((int(x[0])//2)*\"0 \"+x[1]+(int(x[0])//2)*\" 0\")", "string = input()\r\nnumbers = string.split()\r\na, b = int(numbers[0]), int(numbers[1])\r\nrow = [0 for x in range(a - 1)]\r\nrow.append(b)\r\nfor x in range(a):\r\n print(\" \".join(map(str, row[x:] + row[:x])))", "n, k = map(int, input().split(' '))\nm = []\nfor i in range(n):\n m.append([])\n for j in range(n):\n m[i].append(None)\nif k == 1000:\n for i in range(n):\n for j in range(n):\n if m[i][j] is None:\n m[i][j] = 0\n if i == j:\n m[i][j] = 999\n m[i][(j + 1) % n] = 1\nelse:\n for i in range(n):\n for j in range(n):\n if i == j:\n m[i][j] = k\n else:\n m[i][j] = 0\nfor i in m:\n print(' '.join(str(z) for z in i))\n", "n,k = map(int, input().split())\r\narr = [[0]*n for i in range(n)]\r\nfor i in range(n):\r\n\tarr[i][i] = k\r\nfor i in range(n):\r\n\tprint(*arr[i])\r\n", "n, k = map(int, input().split())\r\nx = 1\r\ny = k - n + 1\r\n\r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if i == j:\r\n print(y, end=' ')\r\n else:\r\n print(x, end=' ')\r\n print()\r\n", "num=[int(num) for num in input().split()]\r\np=num[1]\r\nfor index in range(num[0]):\r\n for i in range(num[0]):\r\n if (i==index):\r\n print(p,end=\" \")\r\n else: \r\n print(0, end=\" \")\r\n print(\" \") ", "n,k=map(int,input().split())\r\nc=k-n+1\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if j==n-1-i:\r\n print(c,end=\" \")\r\n else:\r\n print(1,end=\" \")\r\n print(\"\")\r\n \r\n ", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\tn,k=read_ints()\r\n\tfor i in range(n):\r\n\t\tprint(\" \".join(map(str, [0]*i + [k] + [0]*(n-i-1))))\r\n\r\nsolve()\r\n", "class CodeforcesTask361ASolution:\n def __init__(self):\n self.result = ''\n self.n_k = []\n\n def read_input(self):\n self.n_k = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n res = []\n for x in range(self.n_k[0]):\n line = [0] * self.n_k[0]\n line[x] = self.n_k[1]\n res.append(\" \".join([str(y) for y in line]))\n self.result = \"\\n\".join(res)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask361ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n,m = list(map(int,input().split()))\nc = m-(n-1)\nfor i in range(n):\n for j in range(n):\n if i == j:\n print(c,end = ' ')\n else:\n print(1,end = ' ')\n print()\n\n\t\t \t \t\t \t \t \t\t \t\t\t", "\nn, k = map(int, input().split())\nv = k - (n - 1)\n\nt = list()\nfor i in range(n):\n t.append([(1 if i + c + 1 != n else v) for c in range(n)])\n\nfor n in t:\n print(\" \".join(str(x) for x in n))\n \t\t\t\t\t\t\t \t\t\t \t\t\t \t\t\t \t", "m,n = map(int, input().split())\r\na = []\r\nfor i in range(m):\r\n a.append([0]*m)\r\nfor i in range(m):\r\n for j in range(m):\r\n if i==j:\r\n a[i][j] = n\r\nfor i in range(m):\r\n print(*a[i])\r\n\r\n", "import math\r\nimport collections\r\n\r\nn,k = list(map(int, input().split()))\r\nif k%n == 0:\r\n i = str(k // n) + ' '\r\n for _ in range(n):\r\n print(i*n)\r\nelse:\r\n i2 = str(math.ceil(k/n))\r\n i1 = str(math.ceil(k/n)-1)\r\n i2_len = k % n\r\n i1_len = n - i2_len\r\n l = collections.deque([i1]*i1_len + [i2]*i2_len)\r\n for i in range(n):\r\n print(' '.join(l))\r\n l.rotate(1)\r\n", "def main():\r\n n, k = map(int, input().split())\r\n for i in range(n):\r\n for j in range(n):\r\n print(k if j == i else 0,'', end='')\r\n print()\r\n\r\n\r\nmain()", "n, k = map(int, input().split())\r\nfor i in range (n):\r\n for j in range (n):\r\n print([0,k][i==j],end=\" \")\r\n print()", "n,k=map(int,input().split())\r\nl=[[0 for _ in range(n)] for _ in range(n)]\r\nfor i in range(0,n):\r\n for j in range(n):\r\n if(i==j):\r\n l[i][j]=k\r\nfor i in l:\r\n print(*i)\r\n", "from itertools import repeat\n\nn, k = map(int, input().split())\nm = k // n\nr = k % n\n\nfor i in range(n):\n print(*repeat(m, i), m + r, *repeat(m, n - i - 1))\n", "n, k = map(int, input().split())\r\nmod = k % n\r\nfor i in range(n):\r\n print(' '.join(map(str, [((k - mod) // n)] * (n - i - 1) + [((k - mod) // n + mod)] + [((k - mod) // n)] * i)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Levko_and_Table():\r\n n,k = invr()\r\n\r\n outputStr = ''\r\n\r\n diagonalPos = 0\r\n for rowIndex in range(n):\r\n row = [0]*n \r\n row[diagonalPos] = k \r\n diagonalPos += 1 \r\n rowString = ' '.join(str(x) for x in row)\r\n outputStr += rowString + '\\n'\r\n \r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n return\r\n\r\nLevko_and_Table()", "from sys import stdin\r\n\r\nn, k = list(map(int, stdin.readline().split()))\r\na = [[0]*n for _ in range(n)]\r\nfor i in range(n):\r\n a[i][i] = k\r\n print(*a[i])\r\n", "n,k=list(map(int,input().split()))\r\nx=[0]*(n-1)+[k]\r\nz=len(x)-1\r\nfor i in range(n):\r\n if i==0:\r\n print(*x)\r\n else:\r\n x.pop(z)\r\n z-=1\r\n x.insert(z,k)\r\n print(*x)", "[n, k] = list(map(int, input().split(\" \")))\r\na = [ ]\r\nfor i in range(n):\r\n r = [\"0\"]*n\r\n r[i] = str(k)\r\n print(' '.join([t for t in r]))\r\n\r\n \r\n \r\n\r\n\r\n \r\n", "def main():\r\n n, k = list(map(int, input().split()))\r\n table = [[0 for j in range(n)] for i in range(n)]\r\n for i in range(n):\r\n table[i][i] = k\r\n for i in range(n):\r\n print(*table[i])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k=map(int,input().split())\nfor i in range(n):print(i*'0 ',k,(n-1-i)*' 0',sep='')\n", "x, y = map(int, input().split())\r\nans = 0\r\nfor i in range(x) : \r\n \r\n for j in range(x) : \r\n if i == j : \r\n ans = y\r\n else : ans = 0\r\n print(ans, end = ' ')\r\n print()", "n,k = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n print('1 '*(n - 1 - i) + str((k - n + 1)),end='')\r\n print(' 1'*i)", "def rotate(a,n):\r\n x=a[0]\r\n b=[]\r\n for i in range(1,n):\r\n b.append(a[i])\r\n b.append(x)\r\n return b\r\nn,k=map(int,input().split())\r\na=[]\r\ni=n\r\nwhile i>=1:\r\n x=k//i\r\n k=k-x\r\n a.append(x)\r\n i-=1\r\nb=[]\r\nfor i in range(n):\r\n b.append(a)\r\n a=rotate(a,n)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(b[i][j],end=\" \")\r\n print()", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n ans = ''\r\n for j in range(n):\r\n if i == j:\r\n ans += str(k) + ' '\r\n else:\r\n ans += '0 '\r\n print(ans)\r\n", "import sys\r\n\r\ndef main():\r\n n, k = map(int, sys.stdin.read().strip().split())\r\n return (' '.join(str(k//n + k%n*(i == j)) for j in range(n)) for i in range(n))\r\n \r\nprint(*main(), sep='\\n')\r\n", "# Levko and Table\ndef tables(n, k):\n ans = []\n for i in range(n):\n tmp = [0] * n\n tmp[i] = k\n ans.append(tmp)\n return ans\n\n\nn, k = list(map(int, input().split()))\nret = tables(n, k)\nfor i in ret:\n print(*i)\n", "n, k = map(int,input().split())\r\nmat =[[0 for i in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j):\r\n mat[i][j] = k\r\n \r\nfor i in mat:\r\n for j in i:\r\n print(j, end=' ')\r\n print()" ]

[ "import math\r\nfrom copy import deepcopy\r\ndef position_point_plan(p):\r\n if p[0]<=0 and p[1]>0 :\r\n return 0\r\n if p[0]<0 and p[1]<=0 :\r\n return 1\r\n if p[0]>=0 and p[1]<0 :\r\n return 2\r\n if p[0]>0 and p[1]>=0 :\r\n return 3\r\n\r\ndef is_parallel(triangle):\r\n if triangle['s1'][0] in (triangle['s2'][0], triangle['s3'][0]) or triangle['s2'][0]== triangle['s3'][0]:\r\n return False\r\n if triangle['s1'][1] in (triangle['s2'][1], triangle['s3'][1]) or triangle['s2'][1]== triangle['s3'][1]:\r\n return False\r\n\r\n return True\r\ndef is_rectangle(triangle):\r\n return distance(triangle['s2'], triangle['s3']) == math.sqrt(distance(triangle['s1'], triangle['s2'])**2 + distance(triangle['s1'], triangle['s3'])**2)\r\n\r\ndef distance(p1, p2):\r\n return math.sqrt((p1[0]- p2[0])**2 + (p1[1] - p2[1])**2)\r\n\r\ndef rotation_neg_pos(triangle, a, d, p):\r\n if d > a:\r\n triangle[p][1] -= 1\r\n\r\n if d < a:\r\n triangle[p][0] -= 1\r\n\r\ndef rotation_neg_neg(triangle, a, d, p):\r\n if d > a:\r\n triangle[p][0] += 1\r\n\r\n if d < a:\r\n triangle[p][1] -= 1\r\n\r\ndef rotation_pos_neg(triangle, a, d, p):\r\n if d > a:\r\n triangle[p][1] += 1\r\n\r\n if d < a:\r\n triangle[p][0] += 1\r\n\r\ndef rotation_pos_pos(triangle, a, d, p):\r\n if d > a:\r\n triangle[p][0] -= 1\r\n\r\n if d < a:\r\n triangle[p][1] += 1\r\n\r\ndef rotation_a(triangle, a):\r\n new_triangle = deepcopy(triangle)\r\n liste_a=list()\r\n while(new_triangle['s3'][0]!=0):\r\n d=distance(new_triangle['s3'], new_triangle['s1'])\r\n\r\n if position_point_plan(new_triangle['s3']) == 0:\r\n rotation_neg_pos(new_triangle, a, d, 's3')\r\n\r\n elif position_point_plan(new_triangle['s3']) == 1:\r\n rotation_neg_neg(new_triangle, a, d, 's3')\r\n\r\n elif position_point_plan(new_triangle['s3']) == 2:\r\n rotation_pos_neg(new_triangle, a, d, 's3')\r\n\r\n else:\r\n rotation_pos_pos(new_triangle, a, d, 's3')\r\n\r\n if d==a :\r\n liste_a.append(deepcopy(new_triangle['s3']))\r\n\r\n if position_point_plan(new_triangle['s3']) == 0:\r\n new_triangle['s3'][0]-=1\r\n\r\n elif position_point_plan(new_triangle['s3']) == 1:\r\n new_triangle['s3'][1]-=1\r\n\r\n elif position_point_plan(new_triangle['s3']) == 2:\r\n new_triangle['s3'][0]+=1\r\n\r\n else :\r\n new_triangle['s3'][1]+=1\r\n\r\n return liste_a\r\n\r\n\r\ndef rotation_b(triangle, b):\r\n new_triangle = deepcopy(triangle)\r\n liste_b = list()\r\n while (new_triangle['s2'][1] != 0):\r\n d = distance(new_triangle['s2'], new_triangle['s1'])\r\n\r\n if position_point_plan(new_triangle['s2']) == 0:\r\n rotation_neg_pos(new_triangle, b, d, 's2')\r\n\r\n elif position_point_plan(new_triangle['s2']) == 1:\r\n rotation_neg_neg(new_triangle, b, d, 's2')\r\n\r\n elif position_point_plan(new_triangle['s2']) == 2:\r\n rotation_pos_neg(new_triangle, b, d, 's2')\r\n\r\n else:\r\n rotation_pos_pos(new_triangle, b, d, 's2')\r\n\r\n if d == b:\r\n liste_b.append(deepcopy(new_triangle['s2']))\r\n\r\n if position_point_plan(new_triangle['s2']) == 0:\r\n new_triangle['s2'][0] -= 1\r\n\r\n elif position_point_plan(new_triangle['s3']) == 1:\r\n new_triangle['s2'][1] -= 1\r\n\r\n elif position_point_plan(new_triangle['s2']) == 2:\r\n new_triangle['s2'][0] += 1\r\n\r\n else:\r\n new_triangle['s2'][1] += 1\r\n\r\n return liste_b\r\n\r\ndef yes_no_triangle(triangle, a, b):\r\n list_a = rotation_a(triangle, a)\r\n\r\n list_b = rotation_b(triangle, b)\r\n\r\n for element_a in list_a:\r\n for element_b in list_b:\r\n if is_rectangle({'s1':[0, 0],'s2': element_a, 's3':element_b}) and is_parallel({'s1':[0, 0],'s2': element_a, 's3':element_b}) :\r\n return True, (0, 0), element_a, element_b\r\n return False,\r\ndef invr():\r\n return(map(int,input().split()))\r\nif __name__ == '__main__':\r\n a, b= list(invr())\r\n triangle={\r\n \"s1\": [0, 0],\r\n \"s2\": [b, 1],\r\n \"s3\": [-1, a]\r\n }\r\n res= yes_no_triangle(triangle, a, b)\r\n if res[0] :\r\n print('YES')\r\n print(f'{res[1][0]} {res[1][1]}')\r\n print(f'{res[2][0]} {res[2][1]}')\r\n print(f'{res[3][0]} {res[3][1]}')\r\n else :\r\n print('NO')", "a,b=map(int,input().split())\r\nal=[]\r\nbl=[]\r\nfor x in range(1,a):\r\n if int((a**2-x**2)**0.5)==(a**2-x**2)**0.5:\r\n y=int((a**2-x**2)**0.5)\r\n al.append([x,y])\r\nfor x in range(1,b):\r\n if int((b**2-x**2)**0.5)==(b**2-x**2)**0.5:\r\n y=int((b**2-x**2)**0.5)\r\n bl.append([x,y])\r\nf=0\r\nfor av in al:\r\n for bv in bl:\r\n if av[0]!=bv[0] and av[0]*bv[0]-av[1]*bv[1]==0:\r\n print('YES')\r\n print(av[0],0)\r\n print(0,av[1])\r\n print(bv[0],bv[1]+av[1])\r\n f=1\r\n break\r\n if f==1:\r\n break\r\nif f==0:\r\n print('NO')\r\n\r\n", "a,b = list(map(int,input().split()))\r\nax = []\r\nfor i in range(1,a+1):\r\n\tfor j in range(1,a+1):\r\n\t\tif(i**2+j**2==a**2):\r\n\t\t\tax+=[[i,j]]\r\n\t\t\tax+=[[-i,j]]\r\nbx = []\r\nfor i in range(1,b+1):\r\n\tfor j in range(1,b+1):\r\n\t\tif(i**2+j**2==b**2):\r\n\t\t\tbx+=[[i,j]]\r\n\t\t\tbx+=[[-i,j]]\r\nflag = 0\r\nfor t1 in range(len(ax)):\r\n\tif flag:\r\n\t\tbreak\r\n\tfor t2 in range(len(bx)):\r\n\t\tx1,y1 = ax[t1][0],ax[t1][1]\r\n\t\tx2,y2 = bx[t2][0],bx[t2][1]\r\n\t\tdis = (x1-x2)**2 + (y1-y2)**2\r\n\t\tif(dis+a**2==b**2 or a**2+b**2==dis or dis+b**2==a**2):\r\n\t\t\tif(x1==x2 or y1==y2):\r\n\t\t\t\tcontinue\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\nif flag:\r\n\tprint(\"YES\")\r\n\tprint(\"0 0\")\r\n\tprint(x1,y1)\r\n\tprint(x2,y2)\r\n\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "a, b = input().strip().split()\na, b = int(a), int(b)\n\nimport math\nimport functools\[email protected]_cache(None)\ndef check(a):\n ans = set()\n for i in range(1, a):\n for j in range(i, a):\n if i ** 2 + j ** 2 == a ** 2:\n ans.add((i, j))\n ans.add((j, i))\n return list(ans)\n\nsq1, sq2 = check(a), check(b)\n\nif sq1 and sq2:\n # print(sq1, sq2)\n for x1, y1 in sq1:\n for x2, y2 in sq2:\n if (x1 * x2) / (y1 * y2) == 1:\n a1, b1 = -x1, y1\n a2, b2 = x2, y2\n if not (a1 == a2 or b1 == b2):\n print('YES')\n print(a1, b1)\n print(0, 0)\n print(a2, b2)\n import sys\n sys.exit()\n elif (x1 * y2) / (x2 * y1) == 1:\n a1, b1 = -x1, y1\n a2, b2 = y2, x2\n if not (a1 == a2 or b1 == b2):\n print('YES')\n print(a1, b1)\n print(0, 0)\n print(a2, b2)\n import sys\n sys.exit()\n print('NO')\nelse:\n print('NO')\n\t\t\t\t \t \t\t\t\t \t \t \t\t\t\t\t\t \t", "a, b = map(int, input().split())\n\ny = a\nfor x in range(1, a):\n while y ** 2 + x ** 2 > a ** 2:\n y -= 1\n\n if y ** 2 + x ** 2 == a ** 2:\n if (y * b) % a or (x * b) % a:\n continue\n px = -(y * b) // a\n py = (x * b) // a\n\n if px == 0 or py == 0 or px == x or py == y:\n continue\n print('YES')\n print(0, 0)\n print(px, py)\n print(x, y)\n break\nelse:\n print('NO')\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\na,b = map(int, input().split())\r\n\r\ndef deal(a,b):\r\n c=a**2+b**2\r\n\r\n B = []\r\n for i in range(1,b+1):\r\n for j in range(i,b+1):\r\n if i**2+j**2==b**2:\r\n B.append((i,j))\r\n\r\n for j in range(1,a+1):\r\n for i in range(-j,-a-1,-1):\r\n if i**2+j**2==a**2:\r\n for i2,j2 in B:\r\n if abs(i2-i)**2+abs(j2-j)**2==c:\r\n return [(i,j),(i2,j2)]\r\n return None\r\n\r\na1 = deal(a,b)\r\na2 = deal(b,a)\r\nif a1==None and a2==None:\r\n print('NO')\r\nelif a1[0][1]==a1[1][1] and a2[0][1]==a2[1][1]:\r\n print('NO')\r\nelif a1[0][1]!=a1[1][1]:\r\n print('YES')\r\n print(0,0)\r\n print(*a1[0])\r\n print(*a1[1])\r\nelse:\r\n print('YES')\r\n print(0,0)\r\n print(*a2[0])\r\n print(*a2[1])", "# https://codeforces.com/contest/408\n\nimport sys\nimport math\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\na, b = map(int, input().split())\n\n# first vertice\nx1, y1 = 0, 0\n\n# second vertice in quadrant x2 > 0, y2 > 0\n# x2**2 + y2**2 = a**2 => y2**2 = a**2 - x2**2\nv2 = []\nfor x2 in range(1, a + 1):\n y2_square = a ** 2 - x2 ** 2\n if y2_square <= 0:\n continue\n y2 = math.isqrt(y2_square)\n if y2 == 0 or y2 ** 2 != y2_square:\n continue\n v2 += [(x2, y2)]\n\n# third vertice in quadrant x2 < 0, y2 > 0\n# x3**2 + y3**2 = b**2 => y3**2 = b**2 - x3**2\nv3 = []\nfor x3 in range(-b, 0):\n y3_square = b ** 2 - x3 ** 2\n if y3_square <= 0:\n continue\n y3 = math.isqrt(y3_square)\n if y3 == 0 or y3 ** 2 != y3_square:\n continue\n v3 += [(x3, y3)]\n\nfor x2, y2 in v2:\n for x3, y3 in v3:\n if x2 * x3 + y2 * y3 == 0 and y2 != y3:\n print(\"YES\")\n print(x1, y1)\n print(x2, y2)\n print(x3, y3)\n exit()\nprint(\"NO\")\n", "a, b = map(int, input().split())\n\nimport math\nfor p1x in range(1, a):\n\tp1y = math.sqrt(a**2 - p1x**2)\n\tif p1y == round(p1y):\n\t\tp2x = p1x - b*(p1y/a)\n\t\tp2y = p1y + b*(p1x/a)\n\t\tif p2x == round(p2x) and p2y == round(p2y) and p2x != 0:\n\t\t\tprint(\"YES\")\n\t\t\tprint(0, 0)\n\t\t\tprint(int(p1x), int(p1y))\n\t\t\tprint(int(p2x), int(p2y))\n\t\t\texit(0)\nprint(\"NO\")", "a,b=list(map(int,input().strip().split()))\r\nif b>a:\r\n a,b=b,a\r\ncheck=0\r\nfor c in range(1,a):\r\n if int((a**2-c**2)**0.5)**2==a**2-c**2:\r\n L=int((a**2-c**2)**0.5)\r\n if c*b%a==0 and L*b%a==0:\r\n ans=[0,0,-(L*b)//a,(c*b)//a,c,L]\r\n check=1\r\n break\r\nif check==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(ans[0],ans[1])\r\n print(ans[2],ans[3])\r\n print(ans[4],ans[5])", "import sys\na, b = [int(x) for x in input().split()]\n# search for triples with a\ndef get_trips(a):\n\ttrips = []\n\tfor x in range(1,a):\n\t\ty = (a**2 - x**2) ** 0.5\n\t\tif int(y) == y:\n\t\t\ttrips.append((x, int(y)))\n\treturn trips\na_trips = get_trips(a)\nb_trips = get_trips(b)\nfor ax, ay in a_trips:\n\tfor bx, by in b_trips:\n\t\tif ax != bx and ax * bx - ay * by == 0:\n\t\t\t# orthogonal!\n\t\t\tprint('YES')\n\t\t\tprint(ax, ay)\n\t\t\tprint(bx, -by)\n\t\t\tprint(0, 0)\n\t\t\tsys.exit()\nprint('NO')\n\t \t \t\t \t \t \t\t \t \t \t \t \t\t\t", "import math\r\n\r\na, b = map(int, input().split())\r\n\r\npossible = False\r\n\r\nfor f in range(1, a):\r\n g = int(math.sqrt(a * a - f * f))\r\n if f * f + g * g != a * a:\r\n continue\r\n x = (b * g) // a\r\n y = (b * f) // a\r\n if x * x + y * y != b * b:\r\n continue\r\n if g == y:\r\n continue\r\n possible = True\r\n break\r\n\r\nif possible:\r\n print(\"YES\")\r\n print(f\"0 0\")\r\n print(f\"{f} {g}\")\r\n print(f\"{-x} {y}\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nxy1=[]\r\nxy2=[]\r\nfor i in range(-1000,1001):\r\n for j in range(-1000,1001):\r\n if a**2==i**2+j**2:\r\n xy1.append([i,j])\r\n if b**2==i**2+j**2:\r\n xy2.append([i,j])\r\nfor x1,y1 in xy1:\r\n for x2,y2 in xy2:\r\n if 0 in set([x1,x2,y1,y2]):\r\n continue\r\n if x1*x2+y1*y2==0 and x1!=x2 and y1!=y2:\r\n print(\"YES\")\r\n print(0,0)\r\n print(x1,y1)\r\n print(x2,y2)\r\n exit()\r\nprint(\"NO\")", "a,b=map(int,input().split())\ndef get(a):\n return list([i,j] for i in range(1,a) for j in range(1,a) if i*i+j*j==a*a)\nA=get(a)\nB=get(b)\nfor [a,b] in A:\n for [c,d] in B:\n if a*c==b*d and b!=d:\n print(\"YES\\n0 0\")\n print(-a,b)\n print(c,d)\n exit(0)\nprint(\"NO\")\n", "from math import floor\r\ndef gca(a,b):\r\n while(1):\r\n a%=b\r\n if a==0: return b\r\n b%=a\r\n if b==0: return a\r\nyes=1\r\nx,y=map(int,input().split())\r\nif x>y: x,y=y,x\r\na,b=0,0\r\nr=y//gca(x,y)\r\nr2=x//gca(x,y)\r\nx=gca(x,y)\r\nfor i in range(2,x):\r\n if round((x*x-i*i)**(1/2))**2==x*x-i*i:\r\n a,b=i,round((x*x-i*i)**(1/2))\r\n break\r\nif a==0 or b==0: yes=0\r\nif yes:\r\n print(\"YES\")\r\n print(0,0)\r\n print(r2*a,r2*b)\r\n if r2*a-r*b!=0: print(r2*a-r*b,r2*b+r*a)\r\n else: print(r2*a-r*a,r2*b+r*b)\r\nelse: print(\"NO\")", "a , b = map(int,input().split())\r\n\r\n\r\ndef check(x, y):\r\n new_y = -x\r\n new_x = y\r\n\r\n yy = new_y * b // a\r\n xx = new_x * b // a\r\n\r\n if x == xx or y == yy:\r\n xx *= -1\r\n yy *= -1\r\n \r\n if new_x * b % a == 0 and new_y * b % a == 0 and xx != x and yy != y:\r\n return xx, yy\r\n \r\n return False, False\r\n\r\n\r\nfor i in range(1, a):\r\n for j in range(0, a + 1):\r\n if i ** 2 + j ** 2 == a*a:\r\n val = check(i, j)\r\n if val[0] != False:\r\n print(\"YES\")\r\n print(0 , 0)\r\n print(i, j)\r\n print(val[0], val[1])\r\n exit(0)\r\n\r\n\r\nprint(\"NO\")\r\n", "def dist(a, b):\r\n return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2\r\n\r\na, b = map(int, input().split())\r\npnt_a, pnt_b = [], []\r\nfor i in range(1, 1000):\r\n j = 1\r\n while j*j + i*i <= 1000000:\r\n if i*i + j*j == a*a: pnt_a.append((i, j))\r\n if i*i + j*j == b*b: pnt_b.append((-i, j))\r\n j += 1\r\nfor i in pnt_a:\r\n for j in pnt_b:\r\n if i[1] != j[1] and dist(i, j) == a*a + b*b:\r\n print(\"YES\")\r\n print(\"0 0\")\r\n print(i[0], i[1])\r\n print(j[0], j[1])\r\n exit()\r\nprint(\"NO\")\r\n", "a,b=map(int,input().split())\r\ndef get(a):\r\n return list([i,j] for i in range(1,a) for j in range(1,a) if i*i+j*j==a*a)\r\nA=get(a)\r\nB=get(b)\r\nfor [a,b] in A:\r\n for [c,d] in B:\r\n if a*c==b*d and b!=d:\r\n print(\"YES\\n0 0\\n%d %d\\n%d %d\" %(-a,b,c,d))\r\n exit(0)\r\nprint(\"NO\")", "import math\r\nimport copy\r\nfrom itertools import combinations\r\ndef rev(s):\r\n a=''\r\n for i in range (1,len(s)+1):\r\n a+=s[-i]\r\n return a\r\n\r\ndef bse(x,l):\r\n if len(l)==0:\r\n return False\r\n else:\r\n a=0;b=len(l)-1\r\n while (b-a)>1:\r\n mid=(a+b)//2\r\n if l[mid]>=x:\r\n b=mid\r\n else:\r\n a=mid\r\n if l[a]==x:\r\n return a\r\n elif l[b]==x:\r\n return b\r\n else:\r\n return False\r\ndef lb(l,k):\r\n if len(l)==0:\r\n return 0\r\n a=0;b=len(l)-1\r\n while (b-a>1):\r\n mid=(a+b)//2\r\n if l[mid]>=k:\r\n b=mid\r\n else:\r\n a=mid\r\n if l[a]>=k:\r\n return a\r\n elif l[b]>=k:\r\n return b\r\n else:\r\n return len(l)\r\n \r\ndef ub(l,x):\r\n a=0;b=len(l)-1\r\n while (b-a)>1:\r\n mid=(a+b)//2\r\n if l[mid]>x:\r\n b=mid\r\n else:\r\n a=mid\r\n if l[a]>x:\r\n return a\r\n elif l[b]>x:\r\n return b\r\n else:\r\n return len(l)\r\ndef gcd(m,n):\r\n if m==0 or n==0:\r\n return m+n\r\n else:\r\n return gcd(max(m,n)%min(m,n),min(m,n))\r\n\r\ndef lcm(m,n):\r\n if m%n==0 or n%m==0:\r\n return max(m,n)\r\n else:\r\n return (m*n)//gcd(m,n)\r\n\r\ndef find_fac(n):\r\n l=[]\r\n for i in range (1,math.ceil(n**0.5)):\r\n if n%i==0:\r\n l.append(i)\r\n l.append(n//i)\r\n if int(math.sqrt(n))==math.sqrt(n):\r\n l.append(int(math.sqrt(n)))\r\n l=sorted(l)\r\n return l\r\ndef sm_med(l):\r\n if len(l)%2==0:\r\n return l[len(l)//2-1]\r\n else:\r\n return l[len(l)//2]\r\ndef printl(l):\r\n for i in range(0,len(l)):\r\n l[i]=str(l[i])\r\n print(' '.join(l))\r\n return None\r\ndef fastpow(a,b):\r\n if b==0:\r\n return 1\r\n elif b==1:\r\n return a\r\n else:\r\n if b%2==1:\r\n return fastpow(a,b//2)*fastpow(a,b//2)*a\r\n else:\r\n return fastpow(a,b//2)*fastpow(a,b//2)\r\ndef distinct_elements(l):\r\n a={}\r\n for i in range(0,len(l)):\r\n a[l[i]]=1\r\n return len(a)\r\n\r\ndef isp(n):\r\n flag=0\r\n if n==2:\r\n return True\r\n else:\r\n for i in range (2,int(math.sqrt(n)+1)):\r\n if n%i==0:\r\n flag=1\r\n break\r\n if flag==1:\r\n return False\r\n else:\r\n return True\r\ndef sql(n):\r\n l=[]\r\n for i in range (1,n+1):\r\n l.append(i*i)\r\n return l\r\n\r\n#t=int(input())\r\nl=sql(1000)\r\nt=1\r\nfor _ in range (0,t):\r\n n,k=map(int,input().split())\r\n a=min(n,k);b=max(n,k)\r\n flag=0\r\n for i in range (0,a-1):\r\n if bse(a*a-l[i],l):\r\n sin=(i+1)/a\r\n cos=int(math.sqrt(a*a-l[i]))/a\r\n if b*sin==int(b*sin) and b*cos==int(b*cos):\r\n flag=-1;break\r\n\r\n if flag==0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(0,0)\r\n print(int(a*cos),int(a*sin))\r\n print(int(-b*sin),int(b*cos))\r\n \r\n \r\n \r\n \r\n \r\n \r\n" ]

[ "maxn = 1000010\nb = [0] * maxn\nv = [0] * maxn\ng = [0] * maxn\nvis = [0] * maxn\nn, m = map(int, input().split())\nans = 0\ng[1:n+1] = map(int, input().split())\nv[1:m+1] = map(int, input().split())\nb[1:m+1] = map(int, input().split())\nfor i in range(1, m+1):\n a = (v[i] + ans - 1) % n + 1\n t = b[i]\n ans = 0\n while vis[a] < t and t:\n if not vis[a]:\n ans += 1\n vis[a] = t\n a = g[a]\n t -= 1\n print(ans)# 1692165781.120975", "import sys\n\nreadline = sys.stdin.readline\n\nN, M = 0, 0\nstudents = [0]\ng = [0]\nv = [0]\nb = [0]\nseen = [0] \n\ndef read_input():\n global N, M\n N, M = [int(w) for w in readline().split()]\n g.extend([int(w) for w in readline().split()])\n v.extend([int(w) for w in readline().split()])\n b.extend([int(w) for w in readline().split()])\n seen.extend([0] * N)\n\ndef travel() -> list:\n res = [0] * (M + 1)\n for i in range(1, M + 1):\n a = (v[i] + res[i - 1] - 1) % N + 1\n ttl = b[i]\n while b[i] > 0 and seen[a] < ttl:\n if seen[a] == 0:\n res[i] += 1\n seen[a] =ttl\n ttl -= 1\n a = g[a]\n b[i] -= 1\n return res[1:]\n\ndef write_output(data: list):\n for n in data:\n print(n)\n\nread_input()\nwrite_output(travel())\n" ]

[ "\r\ndef go(m, k):\r\n\trem, ans, binom = m*k, 0, 1\r\n\tones = 0\r\n\twhile ones <= k:\r\n\t\ttake = min(1 if ones == 0 else rem//ones, binom)\r\n\t\tif take == 0:\r\n\t\t\tbreak\r\n\t\tans += take\r\n\t\trem -= ones * take\r\n\t\tbinom = binom*(k-ones)//(ones+1)\r\n\t\tones += 1\r\n\treturn ans\r\n\r\ndef solve():\r\n\tn, m = map(int, input().split())\r\n\tans = 1;\r\n\twhile go(m, ans) < n:\r\n\t\tans *= 2\r\n\tjmp = ans\r\n\twhile jmp:\r\n\t\tif go(m, ans-jmp) >= n:\r\n\t\t\tans -= jmp\r\n\t\tjmp //= 2\r\n\t\r\n\tprint(ans)\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n\tsolve()\r\n" ]

[ "import math\r\n\r\ncount, length, first, last = map(int, input().split())\r\nresult = 0\r\n\r\nif (length == 1 or\r\n math.ceil(last / length) - math.ceil(first / length) == 0 or\r\n (first % length == 1 and last % length == 0) or\r\n (first % length == 1 and last == count)):\r\n \r\n result = 1\r\n\r\nelif (math.ceil(last / length) - math.ceil(first / length) == 1 or\r\n first % length == 1 or\r\n last % length == 0 or\r\n last == count or\r\n (last - first + 1) % length == 0):\r\n\r\n result = 2\r\n\r\nelse:\r\n result = 3\r\n\r\nprint(result)# 1690663525.4608028", "# LUOGU_RID: 134437859\nn,m,a,b=map(int,input().split())\nxa=(a-1)//m+1\nya=(a-1)%m+1\nxb=(b-1)//m+1\nyb=(b-1)%m+1\nif ya==1 and (b==n or yb==m):\n print(1)\nelif xa==xb:\n print(1)\nelif (b==n or yb==m) or (ya==1):\n print(2)\nelif xb==xa+1:\n print(2)\nelif yb==ya-1:\n print(2)\nelse:\n print(3)", "n, m, a, b = map(int, input().split())\r\nr1, r2, c1, c2 = (a - 1) // m, (b - 1) // m, (a - 1) % m, m - 1 if b == n else (b - 1) % m\r\nif r1 == r2 or c1 == 0 and c2 == m - 1:\r\n print(1)\r\nelif r2 == r1 + 1 or c1 == 0 or c2 == m - 1 or c1 == c2 + 1:\r\n print(2)\r\nelse:\r\n print(3)", "from sys import stdin, stdout\ninput = stdin.readline\nn, m, a, b = map(int, input().split(' '))\na-=1; b-=1\nx = a//m; y = b//m\nxx = a%m; yy = b%m\nif (x==y) or (xx==0 and yy==(m-1)) or (b-a+1 == n) or (xx==0 and b==n-1):\n print(1)\nelif yy+1==xx or yy==m-1 or (x+1==y) or xx==0 or b==n-1:\n print(2)\nelse:\n print(3)\n\t\t \t \t\t\t\t\t\t \t\t \t \t \t", "import math\r\nn,m,a,b=map(int,input().split())\r\n\r\nif (a-1)//m==(b-1)//m:\r\n print(1)\r\nelif (a-1)%m==0 and b%m==0:\r\n print(1)\r\nelif (a-1)%m==0 and b==n or m==1:\r\n print(1)\r\nelif (a-1)%m==0 or b%m==0 or b==n:\r\n print(2)\r\nelif abs((a-1)//m - (b-1)//m)==1 or m==2:\r\n print(2)\r\nelif (a-1)%m==b%m:\r\n print(2)\r\nelse:\r\n print(3) \r\n \r\n", "def solve(n, m, a, b):\r\n a -= 1\r\n b -= 1\r\n ra = a // m\r\n rb = b // m\r\n if ra == rb:\r\n return 1\r\n if a % m == 0:\r\n if b == n - 1 or b % m == m - 1:\r\n return 1\r\n else:\r\n return 2\r\n if b == n - 1 or b % m == m - 1:\r\n return 2\r\n if a % m == (b % m) + 1:\r\n return 2\r\n if ra == rb - 1:\r\n return 2\r\n\r\n return 3\r\nn, m, a, b = map(int, input().split())\r\nresult = solve(n, m, a, b)\r\nprint(result)# 1698067608.3173046" ]

[ "n,d=map(int,input().split())\r\nans,hist=[],[]\r\nfor i in range(n):\r\n s=input().split()\r\n t=int(s[2])\r\n for x in hist:\r\n if 0<t-x[2]<=d and s[0]==x[1] and s[1]==x[0]:\r\n a=sorted([x[0],x[1]])\r\n if not a in ans: ans.append(a)\r\n hist.append([s[0],s[1],t])\r\nprint(len(ans))\r\nfor x in ans: print(x[0],x[1])\r\n \r\n", "n,d=map(int,input().split())\r\nlst=[]\r\nlst1=[]\r\nlst2=[]\r\nfor i in range(n):\r\n lst+=[list(map(str,input().split()))]\r\nif n==1:\r\n print(0)\r\nelse:\r\n for j in range(n):\r\n for k in range(n):\r\n if lst[j][0]==lst[k][1] and lst[j][1]==lst[k][0]\\\r\n and 0<(int(lst[j][2])-int(lst[k][2]))\\\r\n and (int(lst[j][2])-int(lst[k][2]))<=d:\r\n lst1.append([lst[j][0],lst[k][0]])\r\n break\r\n if lst1==[]:\r\n print(0)\r\n else:\r\n for l in lst1:\r\n if l not in lst2 and l[::-1] not in lst2:\r\n lst2.append(l)\r\n print(len(lst2))\r\n for m in range(len(lst2)):\r\n print(*lst2[m],end=\"\\n\")", "\"\"\"\nhttps://codeforces.com/problemset/problem/159/A\n\"\"\"\nn, temps = [int(x) for x in input().split()]\nd = dict()\nfor _ in range(n):\n a, b, t = [x for x in input().split()]\n if (a, b) in d:\n d[(a, b)].append((int(t), a, b))\n elif (b, a) in d:\n d[(b, a)].append((int(t), a, b))\n else:\n d[(a, b)] = [(int(t), a, b)]\n\nresult = []\nfor k, ts in d.items():\n trouve = False\n for i, (t1, a1, a2) in enumerate(ts[:-1]):\n if trouve:\n break\n for (t2, a2, b2) in ts[i + 1 :]:\n if (0 < t2 - t1 <= temps) and a1 == b2:\n result.append(k)\n trouve = True\n break\n\nprint(len(result))\nfor k in result:\n print(*k)\n", "def closest_value(input_list, input_value):\r\n Min = 100000\r\n for num in input_list:\r\n dif = abs(num - input_value)\r\n if (dif == 0):\r\n continue\r\n Min = min(Min, dif)\r\n return Min\r\n \r\n \r\nn, d = input().split()\r\nn = int(n)\r\nd = int(d)\r\n \r\nD = {}\r\nF = {()}\r\n \r\nfor i in range(n):\r\n a, b, t = input().split()\r\n t = int(t)\r\n D.setdefault(a, {})\r\n D[a].setdefault(b, [])\r\n D[a][b].append(t)\r\n \r\n# print(D)\r\n\r\nfor a in D:\r\n # print(D[a])\r\n for b in D[a]:\r\n L1 = D[a][b]\r\n \r\n if (D.get(b, -11) == -11):\r\n continue\r\n if (D[b].get(a, -10) == -10):\r\n continue\r\n \r\n L2 = D[b][a]\r\n # print(L1)\r\n # print(L2)\r\n MinDiff = 100000\r\n for i in L1:\r\n diff = closest_value(L2, i)\r\n MinDiff = min(diff, MinDiff)\r\n # print(MinDiff)\r\n if MinDiff <= d:\r\n T = (a, b)\r\n T = sorted(T)\r\n T = tuple(T)\r\n F.add(T)\r\n \r\nlength = len(F)\r\nprint(length-1)\r\nfor i in F:\r\n if (i == ()):\r\n continue\r\n print(i[0], i[1])", "l=input().split()\r\nn=int(l[0])\r\nd=int(l[1])\r\nlfi=[]\r\nlofpairs=[]\r\nfor you in range(n):\r\n s=input().split()\r\n for i in lfi:\r\n if(s[0]==i[1] and s[1]==i[0]):\r\n if(int(s[2])-int(i[2])<=d and int(s[2])-int(i[2])!=0):\r\n if((i[0],i[1]) not in lofpairs and (i[1],i[0]) not in lofpairs):\r\n lofpairs.append((i[0],i[1]))\r\n lfi.append(s)\r\nprint(len(lofpairs))\r\nfor i in lofpairs:\r\n print(i[0],i[1])", "def min_positive_difference(numbers1, numbers2):\n min_difference = float('inf')\n if not numbers1 or not numbers2:\n return min_difference\n for n in numbers1:\n for m in numbers2:\n candidate = abs(n - m)\n if candidate < min_difference and candidate > 0:\n min_difference = candidate\n return min_difference\n\n\n\n\nn, d = map(int, input().split())\n\nmessages = {}\n\nfor _ in range(n):\n first, second, time = input().split()\n if (first, second) in messages:\n messages[(first, second)].append(int(time))\n else:\n messages[(first, second)] = [int(time)]\n\nresult = []\n\nfor first, second in messages:\n if (second, first) in result:\n continue\n if 0 < min_positive_difference(messages[(first, second)], messages.get((second, first))) <= d:\n result.append((first, second))\n\nprint(len(result))\nfor first, second in result:\n print(first, second)\n", "# n=int(input())\r\n#q.sort(key=lambda x:((x[1]-x[0]),-x[0]))\r\n# n,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\n#ls=list(map(int,input().split()))\r\n#for i in range(m):\r\n#from sys import stdin\r\n#n=int(stdin.readline())\r\n#for _ in range(int(input())):\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n##########################################################\r\nimport sys\r\nfrom collections import Counter\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n) :\r\n p,q,t=map(str,sys.stdin.readline().split())\r\n t=int(t)\r\n l.append([[p,q],t])\r\n#print(l)\r\np=[]\r\nfor i in range(n) :\r\n for j in range(i+1,n) :\r\n if l[j][1]-l[i][1] >k :\r\n break\r\n if Counter(l[i][0]) == Counter(l[j][0]) and l[j][1]-l[i][1]<=k and l[j][1]-l[i][1] >0 and l[i][0]!=l[j][0]:\r\n #print(l[i][0])\r\n if l[i][0] not in p and l[i][0][::-1] not in p :\r\n p.append(l[i][0])\r\nprint(len(p))\r\nif len(p)==0 :\r\n exit(0)\r\nfor i in p:\r\n print(i[0],i[1])", "n,d=map(int,input().split())\r\na,b=[],set()\r\nfor i in range(n):\r\n q,w,t=input().split()\r\n t=int(t)\r\n a+=[[q,w,t]]\r\nfor i in a:\r\n for j in a:\r\n if (i[1],i[0])not in b and i[0]==j[1]and i[1]==j[0]and 0<abs(i[2]-j[2])<=d:\r\n b.add((i[0],i[1]))\r\nprint(len(b))\r\nfor i in b:print(*[*i])", "n, d = map(int, input().split())\r\nf, p, q, r = [], [], {}, 0\r\nfor i in range(n):\r\n a, b, t = input().split()\r\n u, v, t = a + ' ' + b, b + ' ' + a, int(t)\r\n if t == r: p.append((u, v))\r\n else:\r\n f += [min(x, y) for x, y in p if (y in q and q[y] >= r - d)]\r\n for x, y in p:\r\n q[x] = r\r\n p, r = [(u, v)], t\r\nf = set(f + [min(x, y) for x, y in p if (y in q and q[y] >= r - d)])\r\nprint(len(f))\r\nprint('\\n'.join(f))" ]

[ "from copy import deepcopy\r\n\r\nzoz=[]\r\n\r\nfor i in range(4):\r\n zoz.append(list(input()))\r\n \r\ndef check(zoz):\r\n for i in range(3):\r\n for j in range(3):\r\n if zoz[i][j]==zoz[i][j+1] and zoz[i+1][j]==zoz[i+1][j+1] and zoz[i+1][j]==zoz[i][j]:\r\n return True\r\n return False\r\n\r\ndef change(z):\r\n if z==\"#\":\r\n return \".\"\r\n else:\r\n return \"#\"\r\n\r\nverdict=\"NO\"\r\n\r\nif check(zoz):\r\n verdict=\"YES\"\r\n \r\nfor i in range(16):\r\n test=deepcopy(zoz)\r\n test[i//4][i%4]=change(test[i//4][i%4])\r\n if check(test):\r\n verdict=\"YES\"\r\n break\r\nprint(verdict)\r\n \r\n \r\n", "n = 4\r\nvois = 1\r\n\r\ndef nb_same_square(mat,x,y):\r\n nb_sign1 = 0\r\n \r\n for dx in range(vois + 1):\r\n for dy in range(vois + 1):\r\n elem = mat[x + dx][y + dy]\r\n nb_sign1 += (1 if elem == '#' else 0)\r\n nb_sign2 = 4 - nb_sign1\r\n max_same = max(nb_sign1,nb_sign2)\r\n return max_same\r\n\r\ndef solve(mat):\r\n for i in range(n - 1):\r\n for j in range(n - 1):\r\n if nb_same_square(mat,i,j) >= 3:\r\n print('YES')\r\n return\r\n print('NO')\r\n \r\nmat = [[None for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n s = input()\r\n for j in range(n):\r\n mat[i][j] = s[j]\r\n \r\nsolve(mat)", "x=[]\r\nfor i in range(4):\r\n x.append(input())\r\n\r\nfor i in range(1,3):\r\n for j in range(1,3):\r\n if (x[i][j]==x[i][j-1]) and (x[i][j]== x[i-1][j] or x[i][j]==x[i+1][j] or x[i][j]==x[i-1][j-1] or x[i][j]==x[i+1][j-1]):\r\n print('YES')\r\n exit()\r\n elif (x[i][j]==x[i][j+1]) and (x[i][j]== x[i-1][j] or x[i][j]==x[i+1][j] or x[i][j]==x[i-1][j+1] or x[i][j]==x[i+1][j+1]):\r\n print('YES')\r\n exit()\r\n elif (x[i][j-1]==x[i-1][j-1] and x[i][j-1]==x[i-1][j]) or (x[i][j-1]==x[i+1][j-1] and x[i][j-1]==x[i+1][j]) or (x[i][j+1]==x[i-1][j+1] and x[i][j+1]==x[i-1][j]) or (x[i][j+1]==x[i+1][j+1] and x[i][j+1]==x[i+1][j]):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n\r\n", "square = []\r\npossible = False\r\nfor _ in range(0,4):\r\n inp = input()\r\n inp =inp.replace('.','1')\r\n inp =inp.replace('#','0')\r\n square.append( list(map(lambda x:int(inp[x]),range(0,4))))\r\nfor a in range(0,3):\r\n if possible :\r\n break\r\n for b in range(0,3):\r\n if square[a][b]+square[a+1][b]+square[a][b+1]+square[a+1][b+1] != 2:\r\n possible =True\r\n break\r\nprint(\"YES\") if possible else print(\"NO\")", "def main():\r\n mat=[[int(c=='#') for c in input()] for _ in range(4)]\r\n for i in range(3):\r\n for j in range(3):\r\n res = (mat[i][j] +\r\n mat[i][j + 1] +\r\n mat[i + 1][j] +\r\n mat[i + 1][j + 1])\r\n if res != 2:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "a=[]\r\nfor i in range(4):\r\n b=input()\r\n b=b.replace('#','1')\r\n b=b.replace('.','0')\r\n a.append(b)\r\nf=0\r\nfor i in range(3):\r\n for j in range(3):\r\n s=int(a[i][j])+int(a[i][j+1])+int(a[i+1][j])+int(a[i+1][j+1])\r\n if(s!=2):\r\n f=1\r\n break\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "from sys import stdin\r\ninp = lambda : stdin.readline().strip()\r\n\r\n\r\na = []\r\nfor i in range(4):\r\n a.append(inp())\r\n\r\nflag = False\r\n\r\nfor i in range(4):\r\n for j in range(4):\r\n white = 0\r\n black = 0\r\n for k in range(2):\r\n for l in range(2):\r\n if (i+k) < 4 and (j+l) < 4:\r\n if (i+k) < 4 and (j+l) < 4 and a[i+k][j+l] == '.':\r\n white += 1\r\n else:\r\n black += 1\r\n if white == 3 or white == 4 or black == 3 or black == 4:\r\n flag = True\r\n if flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def iq_test():\r\n sheet = []\r\n output = \"NO\"\r\n for i in range(4):\r\n sheet.append(list(input()))\r\n for row in range(3):\r\n for column in range(3):\r\n dot_counter = 0\r\n for x in range(2):\r\n for y in range(2):\r\n dot_counter += sheet[row + x][column + y] == \".\"\r\n if dot_counter >= 3 or dot_counter <= 1:\r\n output = \"YES\"\r\n print(output)\r\n\r\niq_test()", "lst = []\r\nc = 0\r\nfor i in range(4):\r\n lst.append(input())\r\nfor l in range(3):\r\n for i in range(3):\r\n if lst[l][i] == lst[l][i + 1] == lst[l + 1][i] or lst[l][i + 1] == lst[l + 1][i + 1] == lst[l + 1][i] or \\\r\n lst[l + 1][i] == lst[l + 1][i + 1] == lst[l][i]:\r\n print(\"YES\");c = 1;break\r\n if c == 1: break\r\nif c != 1:\r\n print(\"NO\")\r\n", "grid = [input() for _ in range(4)]\r\n\r\ndef has_2x2_square():\r\n for i in range(3):\r\n for j in range(3):\r\n square = {grid[i][j], grid[i][j+1], grid[i+1][j], grid[i+1][j+1]}\r\n if len(square) == 1:\r\n return True\r\n return False\r\n\r\nif has_2x2_square():\r\n print(\"YES\")\r\nelse:\r\n for i in range(4):\r\n for j in range(4):\r\n \r\n original_color = grid[i][j]\r\n grid[i] = grid[i][:j] + ('#' if original_color == '.' else '.') + grid[i][j+1:]\r\n if has_2x2_square():\r\n print(\"YES\")\r\n exit()\r\n \r\n grid[i] = grid[i][:j] + original_color + grid[i][j+1:]\r\n print(\"NO\")", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\nis there a constant greedy solution?\r\n'''\r\ndef solve():\r\n grid = []\r\n for _ in range(4):\r\n grid.append([x for x in I().strip()])\r\n \r\n for r in range(1, 4):\r\n for c in range(1, 4):\r\n d = defaultdict(int)\r\n d[grid[r-1][c-1]] += 1\r\n d[grid[r-1][c]] += 1\r\n d[grid[r][c-1]] += 1\r\n d[grid[r][c]] += 1\r\n\r\n if max(d.values()) >= 3:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\nsolve()", "l_l = list([input() for _ in range(4)])\r\n\r\ndx = [ 0, 0, 1, 1]\r\ndy = [ 0, -1, -1, 0]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n t = 0\r\n for z in range(4):\r\n t += (-1 if l_l[i + dy[z]][j + dx[z]] == \"#\" else 1)\r\n \r\n if abs(t) >= 2:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n arr = [list(input()) for _ in range(4)]\r\n \r\n for x in range(0,3):\r\n for y in range(0,3):\r\n cek = [arr[x][y],arr[x+1][y],arr[x][y+1],arr[x+1][y+1]]\r\n hitung = cek.count(\".\")\r\n if(hitung !=2):\r\n return(\"YES\")\r\n \r\n return(\"NO\")\r\nif __name__ == '__main__':\r\n print(main())", "data = []\nfor i in range(4):\n inp = list(input())\n data.append(inp)\n\ncount = 0\nif (data[1][1] + data[1][2] + data[2][1] + data[2][2]).count('#') >= 3:\n count += 1\nelse:\n for a in range(len(data) - 1):\n for b in range(0, 4, 2):\n if (data[a][b] + data[a][b + 1] + data[a + 1][b] + data[a + 1][b + 1]).count('#') >= 3 or (\n data[a][b] + data[a][b + 1] + data[a + 1][b] + data[a + 1][b + 1]).count('.') >= 3:\n count += 1\n break\n\nif count > 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = 4\r\ngrid = []\r\ndef is_valid(r, c):\r\n return r >= 0 and c >= 0 and r < 4 and c < 4\r\ndef test(r, c):\r\n if is_valid(r+1, c) and is_valid(r, c+1) and is_valid(r+1, c+1) and grid[r+1][c] == grid[r][c+1] == grid[r+1][c+1]:\r\n return True\r\n if is_valid(r, c-1) and is_valid(r+1, c) and is_valid(r+1, c-1) and grid[r][c-1] == grid[r+1][c] == grid[r+1][c-1]:\r\n return True\r\n if is_valid(r-1, c) and is_valid(r, c+1) and is_valid(r-1, c+1) and grid[r-1][c] == grid[r][c+1] == grid[r-1][c+1]:\r\n return True\r\n if is_valid(r, c-1) and is_valid(r-1, c) and is_valid(r-1, c-1) and grid[r][c-1] == grid[r-1][c] == grid[r-1][c-1]:\r\n return True\r\ndef solve():\r\n for i in range(n):\r\n grid.append(input())\r\n for i in range(n):\r\n for j in range(n):\r\n if test(i, j):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\nsolve()", "n = 4\r\na = []\r\nconvert = {'#':1, '.':0}\r\nfor i in range(n):\r\n inp = list(input())\r\n inp = list(map(lambda x: convert[x], inp))\r\n a.append(inp)\r\n\r\nflag = 0\r\nfor i in range(n-1):\r\n for j in range(n-1):\r\n sval = sum([a[i][j], a[i+1][j], a[i][j+1], a[i+1][j+1]])\r\n if sval == 4 or sval ==0 or sval == 1 or sval == 3:\r\n print('YES')\r\n flag = 1\r\n break\r\n if flag:\r\n break\r\n \r\nif flag==0:\r\n print('NO')\r\n \r\n \r\n \r\n ", "square = []\r\nfor i in range(4) :\r\n a = input()\r\n square.append(a)\r\nans = \"NO\"\r\nfor i in range(3) :\r\n for j in range(3) :\r\n countb = 0\r\n countw = 0\r\n if(square[i][j] == '.') :\r\n countb += 1\r\n else :\r\n countw += 1\r\n if(square[i+1][j] == '.') :\r\n countb += 1\r\n else :\r\n countw += 1\r\n if(square[i][j+1] == '.') :\r\n countb += 1\r\n else :\r\n countw += 1\r\n if(square[i+1][j+1] == '.') :\r\n countb += 1\r\n else :\r\n countw += 1\r\n if(max(countb,countw) >= 3) :\r\n ans = \"YES\"\r\n break\r\nprint(ans)\r\n ", "l = [input() for _ in range(4)]\r\nfor i in range(3):\r\n for j in range(3):\r\n result = l[i][j]+l[i][j+1]+l[i+1][j]+l[i+1][j+1]\r\n if result.count('.')>2 or result.count('#')>2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "matrix = [[j for j in input()] for _ in range(4)]\r\n\r\n# iterating over just 2nd row, 3rd row, and 4th row can give answer\r\nflag = False\r\n\r\nfor i in range(1,4):\r\n for j in range(0,3):\r\n count_dot = 0\r\n count_hash = 0\r\n var = matrix[i][j]\r\n for x in range(i-1, i+1):\r\n for y in range(j, j+2):\r\n if matrix[x][y] == '#':\r\n count_hash += 1\r\n elif matrix[x][y] == '.':\r\n count_dot += 1\r\n if count_hash == 3 or count_dot == 3:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "#one day im gonna in sha allah\r\n\r\nimport math\r\n\r\ndef main():\r\n\r\n row1 = input()\r\n row2 = input()\r\n row3 = input()\r\n row4 = input()\r\n matrix = [row1,row2,row3,row4]\r\n\r\n for i in range(3):\r\n test1 = matrix[i][0:2] + matrix[i+1][0:2]\r\n test2 = matrix[i][2:4] + matrix[i+1][2:4]\r\n test3 = matrix[i][1:3] + matrix[i+1][1:3]\r\n \r\n if(test1.count(\"#\") >= 3 or test1.count(\".\") >= 3):\r\n print(\"YES\")\r\n return\r\n elif(test2.count(\"#\") >= 3 or test2.count(\".\") >= 3):\r\n print(\"YES\")\r\n return\r\n elif(test3.count(\"#\") >= 3 or test3.count(\".\") >= 3):\r\n print(\"YES\")\r\n return\r\n\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n \r\n main()\r\n", "grid = []\n\nfor _ in range(4):\n grid.append(input())\n\n\nfor i in range(4):\n for j in range(4):\n if i > 0 and j > 0 and grid[i-1][j] == grid[i-1][j-1] == grid[i][j-1]:\n print(\"YES\")\n exit()\n\n if i+1 < 4 and j +1 < 4 and grid[i+1][j] == grid[i+1][j+1] == grid[i][j+1]:\n print(\"YES\")\n exit()\n\n if i > 0 and j + 1 < 4 and grid[i-1][j] == grid[i-1][j+1] == grid[i][j+1]:\n print(\"YES\")\n exit()\n\n if i + 1 < 4 and j >0 and grid[i+1][j] == grid[i][j-1] == grid[i+1][j-1]:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "t = []\r\nfor _ in range(4):\r\n t.append(input())\r\n\r\nfound = False\r\nfor x in range(3):\r\n for y in range(3):\r\n c = [t[x][y], t[x+1][y], t[x][y+1], t[x+1][y+1]].count('.')\r\n if c >= 3 or c <= 1: \r\n found = True\r\n break\r\n if found: break\r\n\r\nif found: print('YES')\r\nelse: print('NO')\r\n ", "a = list()\r\ndp = [[0,0,0,0] for i in range(4)]\r\n\r\nfor i in range(4):\r\n\ts = input()\r\n\ta.append(s)\r\n\r\nfor i in range(4):\r\n\tfor j in range(4):\r\n\t\tc = (a[i][j] == '#')\r\n\t\tif i-1>=0 : c+= dp[i-1][j]\r\n\t\tif j-1>=0 : c+= dp[i][j-1]\r\n\t\tif i-1 >= 0 and j-1 >= 0: c-= dp[i-1][j-1]\r\n\t\tdp[i][j] += c\r\n\r\nflag = 0\r\n\r\n\r\nfor i in range(1,4):\r\n\tfor j in range(1,4):\r\n\t\tc = dp[i][j]\r\n\t\tif i-2>=0 and j-2>=0 : c += dp[i-2][j-2]\r\n\t\tif j-2>=0: c-= dp[i][j-2]\r\n\t\tif i-2>=0: c-= dp[i-2][j]\r\n\r\n\t\tif c != 2 :\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\nif flag :\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\")\r\n\r\n", "a = []\nfor i in range(4):\n s = input()\n a.append(s)\n# print(a)\nflag = 0\nfor i in range(3):\n for j in range(3):\n x = 0\n y = 0\n if a[i][j] == '#':\n x+=1\n else:\n y+=1\n if a[i+1][j] == '#':\n x+=1\n else:\n y+=1\n if a[i][j+1] == '#':\n x+=1\n else:\n y+=1\n if a[i+1][j+1] == '#':\n x+=1\n else:\n y+=1\n if(x>=3 or y>=3):\n flag = 1\n break\n if(flag==1):\n break\nif(flag):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=[input() for _ in range(4)]\r\na1,a2,a3=s[0][:2]+s[1][:2],s[0][1:3]+s[1][1:3],s[0][2:]+s[1][2:]\r\na4,a5,a6=s[1][:2]+s[2][:2],s[1][1:3]+s[2][1:3],s[1][2:]+s[2][2:]\r\na7,a8,a9=s[2][:2]+s[3][:2],s[2][1:3]+s[3][1:3],s[2][2:]+s[3][2:]\r\nll=[a1,a2,a3,a4,a5,a6,a7,a8,a9]\r\nans=\"NO\"\r\nfor i in ll:\r\n if i.count(\".\")>=3 or i.count(\"#\")>=3:\r\n ans=\"YES\"\r\n break\r\nprint(ans)", "mat = [input() for _ in range(4)]\r\n\r\nans = \"NO\"\r\nneighbours = ((0,0), (0,1), (1,0), (1,1))\r\nfor x in range(3):\r\n for y in range(3):\r\n dot_count = 0\r\n for (i,j) in neighbours:\r\n if mat[i+x][j+y] == \".\":\r\n dot_count += 1\r\n \r\n if dot_count != 2:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":\r\n break\r\nprint(ans)", "x=[[i for i in input()] for i in range(4)]\nz=\"NO\"\nfor i in range(3):\n for j in range(3):\n f=x[i][j]+x[i][j+1]+x[i+1][j]+x[i+1][j+1]\n if f.count(\"#\")>=3 or f.count(\".\")>=3:\n z=\"YES\"\n break\nprint(z) \n\t\t \t\t \t \t\t\t\t \t \t \t\t\t \t \t\t", "l = [\"000000\"]\r\nl.extend([\"0\"+input()+\"0\" for i in range(4)])\r\nl.append(\"000000\")\r\nfor i in range(4):\r\n for j in range(4):\r\n if (l[i][j+1] == l[i+1][j] == l[i+1][j+1] != \"0\") or (l[i-1][j-1] == l[i-1][j]==l[i][j-1] != \"0\") or (l[i][j-1] == l[i+1][j]==l[i+1][j-1] != \"0\") or (l[i-1][j] == l[i-1][j+1]==l[i][j+1] != \"0\"):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n\r\n\r\n", "arr = []\r\nfor i in range(4) :\r\n c= input()\r\n arr.append(c)\r\nb1x= 0\r\nb1y=0\r\nb2x= 0\r\nb2y=0\r\nb3x= 0\r\nb3y=0\r\nb4x= 0\r\nb4y=0\r\ncounter = 0\r\nif (arr[1][1] == '#' and arr[1][2] == '#' and arr[2][1] == '#' and arr[2][2] == '#' ) or (arr[1][1] == '.' and arr[1][2] == '.' and arr[2][1] == '.' and arr[2][2] == '.' ) :\r\n print('YES')\r\nelse :\r\n for i in arr :\r\n if counter == 0 or counter == 1 :\r\n if i[0] == '#' :\r\n b1x +=1\r\n if i[0] == '.' :\r\n b1y +=1\r\n if i[1] == '.':\r\n b1y += 1\r\n if i[1] == '#':\r\n b1x += 1\r\n if i[2] == '#' :\r\n b2x += 1\r\n if i[2] == '.' :\r\n b2y += 1\r\n if i[3] == '#' :\r\n b2x += 1\r\n if i[3] == '.' :\r\n b2y += 1\r\n else :\r\n if i[0] == '#' :\r\n b3x +=1\r\n if i[0] == '.' :\r\n b3y +=1\r\n if i[1] == '.':\r\n b3y += 1\r\n if i[1] == '#':\r\n b3x += 1\r\n if i[2] == '#' :\r\n b4x += 1\r\n if i[2] == '.' :\r\n b4y += 1\r\n if i[3] == '#' :\r\n b4x += 1\r\n if i[3] == '.' :\r\n b4y += 1\r\n counter = counter + 1\r\n if b1x == 2 and b1y == 2 :\r\n if b2x == 2 and b2y == 2 :\r\n if b3x == 2 and b3y == 2 :\r\n if b4y == 2 and b3y == 2 :\r\n print('NO')\r\n else :\r\n print(\"YES\")\r\n else :\r\n print('YES')\r\n else :\r\n print('YES')\r\n else :\r\n print('YES')\r\n", "a=[[int('0') for i in range(4)]for j in range(4)]\r\nfor i in range(4):\r\n #b=[]\r\n s=input()\r\n for j in range(4):\r\n a[i][j]=s[j]\r\nflag=0 \r\nfor i in range(3):\r\n for j in range(3):\r\n if(a[i][j]==a[i+1][j] and a[i+1][j]==a[i+1][j+1]):\r\n print('YES')\r\n flag=1 \r\n break\r\n if(a[i][j]==a[i][j+1] and a[i][j+1]==a[i+1][j+1]):\r\n print('YES')\r\n flag=1 \r\n break\r\n if(a[i][j]==a[i+1][j] and a[i+1][j]==a[i][j+1]):\r\n print('YES')\r\n flag=1 \r\n break\r\n if(flag==1):\r\n break\r\nif(flag==0):\r\n if(a[3][0]==a[3][1] and a[3][1]==a[2][1]):\r\n print('YES')\r\n elif(a[3][1]==a[3][2] and a[3][2]==a[2][2]):\r\n print('YES')\r\n elif(a[3][2]==a[3][3] and a[3][3]==a[2][3]):\r\n print('YES')\r\n elif(a[0][3]==a[1][3] and a[1][3]==a[1][2]):\r\n print('YES')\r\n elif(a[1][3]==a[2][3] and a[2][3]==a[2][2]):\r\n print('YES')\r\n elif(a[2][3]==a[3][3] and a[3][3]==a[3][2]):\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n \r\n \r\n \r\n \r\n ", "a = []\r\nfor _ in range(4):\r\n a.append(input())\r\nfor i in range(3):\r\n for j in range(3):\r\n cnt = 0\r\n cnt += a[i][j] == '#'\r\n cnt += a[i+1][j] == '#'\r\n cnt += a[i][j+1] == '#'\r\n cnt += a[i+1][j+1] == '#'\r\n if cnt<=1 or cnt>=3:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "grid = [list(input().strip()) for _ in range(4)]\r\n\r\n# Check if there is already a 2x2 square\r\nhas_square = False\r\nfor i in range(3):\r\n for j in range(3):\r\n if len(set([grid[i][j], grid[i+1][j], grid[i][j+1], grid[i+1][j+1]])) == 1:\r\n has_square = True\r\n\r\nif has_square:\r\n print(\"YES\")\r\nelse:\r\n # Check if a single cell can be repainted to make a 2x2 square\r\n can_repaint = False\r\n for i in range(4):\r\n for j in range(4):\r\n orig_color = grid[i][j]\r\n grid[i][j] = \".\" if orig_color == \"#\" else \"#\"\r\n for x in range(3):\r\n for y in range(3):\r\n if len(set([grid[x][y], grid[x+1][y], grid[x][y+1], grid[x+1][y+1]])) == 1:\r\n can_repaint = True\r\n grid[i][j] = orig_color\r\n\r\n if can_repaint:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def isSame(grid, i, j):\r\n return (grid[i][j] == grid[i + 1][j + 1]) and (grid[i][j] == grid[i][j + 1]) and (grid[i][j] == grid[i + 1][j])\r\n\r\ndef main():\r\n charGrid = []\r\n intGrid = [[], [], [], []]\r\n isPossible = False\r\n for i in range(4):\r\n charGrid.append(input())\r\n for line in range(4):\r\n i = charGrid[line]\r\n for j in i:\r\n if j == '#':\r\n intGrid[line].append(-1)\r\n elif j == '.':\r\n intGrid[line].append(1)\r\n for i in range(3):\r\n for j in range(3):\r\n if isSame(intGrid, i, j) or ((intGrid[i][j] * intGrid[i][j + 1] * intGrid[i + 1][j] * intGrid[i + 1][j + 1]) == -1):\r\n isPossible = True\r\n break\r\n if isPossible:\r\n break;\r\n print(\"YES\" if isPossible else \"NO\")\r\n \r\nif __name__ == '__main__':\r\n main()", "mat=[list(input()) for i in range(4)]\r\n\r\n \r\nfor i in range(1 , 4):\r\n for j in range(0 ,3):\r\n if mat[i][j + 1] == mat[i - 1][j] == mat[i - 1][j + 1] or mat[i][j + 1] == mat[i - 1][j] == mat[i][j] != mat[i - 1][j + 1] or mat[i - 1][j + 1] == mat[i - 1][j] == mat[i][j] != mat[i][j + 1] or mat[i - 1][j + 1] == mat[i][j + 1] == mat[i][j] != mat[i - 1][j]:\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")", "# your code goes here\r\nimport math\r\nl=[]\r\nfor i in range(4):\r\n\ts =input()\r\n\tl.append(s)\r\nm=[]\r\nans=0\r\nfor i in l:\r\n\ta=[]\r\n\tfor j in i:\r\n\t\tif j=='#':\r\n\t\t\ta.append(1)\r\n\t\telse:\r\n\t\t\ta.append(0)\r\n\tm.append(a)\r\n\r\nfor i in range(len(m)-1):\r\n\tfor j in range(len(m[i])-1):\r\n\t\ttemp = m[i][j]+m[i][j+1]+m[i+1][j]+m[i+1][j+1]\r\n\t\tif temp==1 or temp==3 or temp==4 or temp==0:\r\n\t\t\tans+=1\r\n\r\nif ans>0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t# your code goes here", "a = []\nflag = 0\nfor _ in range(4):\n a.append(input())\nfor i in range(3):\n for j in range(3):\n if (a[i][j:j + 2] + a[i + 1][j:j + 2]).count('#') > 2 \\\n or (a[i][j:j + 2] + a[i + 1][j:j + 2]).count('.') > 2:\n print('YES')\n flag = 1\n break\n elif i == 2 and j == 2:\n print('NO')\n if flag == 1:\n break\n", "first_line = input()\nscnd_line = input()\nthrd_line = input()\nfourth_line = input()\nfull_list = first_line + scnd_line + thrd_line + fourth_line\n\nindexes = [0,1,2,4,5,6,8,9,10]\nwhite_counter = 0\nblack_counter = 0\naux = []\nflag = True\nfor i in indexes:\n aux = full_list[i] + full_list[i+1] + full_list[i+4] + full_list[i+5]\n white_counter = aux.count('.')\n if(white_counter != 2):\n print(\"YES\")\n exit()\nprint(\"NO\")\n\t\t \t \t\t\t\t \t\t\t \t \t\t \t \t \t \t\t", "a=[]\r\nfor i in range(4):\r\n a.append(input())\r\nc=0\r\nfor i in range(3):\r\n for j in range(3):\r\n h=0\r\n d=0\r\n if(a[i][j]==\"#\"):\r\n h+=1\r\n else:\r\n d+=1\r\n if(a[i][j+1]==\"#\"):\r\n h+=1\r\n else:\r\n d+=1\r\n if (a[i+1][j] == \"#\"):\r\n h += 1\r\n else:\r\n d += 1\r\n if (a[i+1][j + 1] == \"#\"):\r\n h += 1\r\n else:\r\n d += 1\r\n if(h>=3 or d>=3):\r\n c=1\r\n print(\"YES\")\r\n break\r\n if(c==1):\r\n break\r\nif(c==0):\r\n print(\"NO\")", "s = []\r\nfor i in range(4):\r\n s.append(list(input()))\r\n \r\nf = 0 \r\nfor i in range(3):\r\n for j in range(3):\r\n b, w = 0, 0\r\n if(s[i][j] == '#'):\r\n b += 1\r\n else:\r\n w += 1\r\n if(s[i][j + 1] == '#'):\r\n b += 1\r\n else:\r\n w += 1\r\n if(s[i + 1][j] == '#'):\r\n b += 1\r\n else:\r\n w += 1\r\n if(s[i + 1][j + 1] == '#'):\r\n b += 1 \r\n else:\r\n w += 1 \r\n if(b >= 3 or w >= 3):\r\n f = 1 \r\n \r\nif(f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = []\ns.append(input().replace(\"#\", \"0\").replace(\".\", \"1\"))\ns.append(input().replace(\"#\", \"0\").replace(\".\", \"1\"))\ns.append(input().replace(\"#\", \"0\").replace(\".\", \"1\"))\ns.append(input().replace(\"#\", \"0\").replace(\".\", \"1\"))\nfor i in range(0, 3):\n for j in range(0, 3):\n total = int(s[i][j]) + int(s[i][j+1]) + int(s[i+1][j]) + int(s[i+1][j+1])\n if total == 0 or total == 1 or total == 3 or total == 4:\n print(\"YES\")\n exit()\nprint(\"NO\")\n\t \t \t\t\t \t \t \t\t \t \t\t\t \t \t", "arr=[list(input()) for _ in range(4)]\r\nsquare=[]\r\nfor i in range(3):\r\n for j in range(3):\r\n m=[arr[i][j],arr[i+1][j],arr[i][j+1],arr[i+1][j+1]]\r\n if m.count('.')%2!=0 or m.count('.')==0 or m.count('.')==4 :\r\n out=0\r\n break\r\n else:\r\n out=-1\r\n if out==0:\r\n break\r\nif out==-1:\r\n print('NO')\r\nelse:\r\n print('YES')", "grid = []\nfor _ in range(4):\n grid.append([x for x in input()])\ndef check(x, y):\n global grid\n cnt = 0\n for a in range(2):\n for b in range(2):\n if grid[x+a][y+b] == '.':\n cnt += 1\n return cnt != 2\nfor x in range(3):\n for y in range(3):\n if check(x, y):\n print('YES')\n exit()\nprint('NO')\n \t \t \t\t\t\t\t\t\t \t\t \t\t\t\t \t \t\t\t\t", "lst = []\r\nfor _ in range(4):\r\n line = input()\r\n lst.append(line)\r\n\r\npossible = False\r\nfor i in range(4):\r\n for j in range(4):\r\n if j+1<4 and i+1<4:\r\n black = 0\r\n white = 0\r\n if lst[i][j] == '.':\r\n white += 1\r\n else:\r\n black += 1\r\n \r\n if lst[i][j+1] == '.':\r\n white += 1\r\n else:\r\n black += 1\r\n \r\n if lst[i+1][j] == '.':\r\n white += 1\r\n else:\r\n black += 1\r\n\r\n if lst[i+1][j+1] == '.':\r\n white += 1\r\n else:\r\n black += 1\r\n\r\n if black >= 3 or white >= 3:\r\n possible = True\r\n\r\nif possible:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "l = list([input() for _ in range(4)])\r\n\r\nxi = [0, 0, 1, 1]\r\nyj = [0, 1, 0, 1]\r\n\r\n\"\"\"\r\ncheck for block of 4 using xi, yj\r\nif number of #/. >= 3 -> meaning valid block\r\ncheck block of 4 if 3 # 1. or reverse -> valid else false\r\n\"\"\"\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n t = 0\r\n for z in range(4):\r\n if l[i+xi[z]][j+yj[z]] == '#':\r\n t+=1\r\n else:\r\n t-=1\r\n if abs(t)>=2:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "ls = []\r\n\r\nfor i in range(4):\r\n\tls.append(input())\r\n\r\nstat = \"NO\"\r\n\r\ncnt = 0\r\nfor i in range(4):\r\n\tfor j in range(4):\r\n\t\ttry:\r\n\t\t\tsqr = []\r\n\t\t\tsqr.append(ls[i][j])\r\n\t\t\tsqr.append(ls[i][j + 1])\r\n\t\t\tsqr.append(ls[i+1][j])\r\n\t\t\tsqr.append(ls[i+1][j+1])\r\n\t\t\tif sqr.count('#') >= 3 or sqr.count('.') >= 3:\r\n\t\t\t\tstat = (\"YES\")\r\n\t\t\t\tbreak\r\n\t\texcept:\r\n\t\t\tcontinue\r\n\r\nprint(stat)\r\n", "grid = list()\r\nfor i in range(0,4):\r\n row = list(input())\r\n grid.append(row)\r\nflag = False\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n check = {'.' : 0, '#' : 0}\r\n check[grid[i][j]] += 1\r\n check[grid[i+1][j]] += 1\r\n check[grid[i][j+1]] += 1\r\n check[grid[i+1][j+1]] += 1\r\n if check['.'] >= 3 or check['#'] >= 3:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nc=input()\r\nd=input()\r\nf=[]\r\nfor i in range(3):\r\n f.append(a[i])\r\n f.append(a[i+1])\r\n f.append(b[i])\r\n f.append(b[i + 1])\r\n if f.count('.')==3 or f.count('#')==3 or f.count('.')==4 or f.count('#')==4:\r\n print('YES')\r\n exit(0)\r\n f=[]\r\n f.append(b[i])\r\n f.append(b[i + 1])\r\n f.append(c[i])\r\n f.append(c[i + 1])\r\n if f.count('.') == 3 or f.count('#') == 3 or f.count('.') == 4 or f.count('#') == 4:\r\n print('YES')\r\n exit(0)\r\n f = []\r\n f.append(c[i])\r\n f.append(c[i + 1])\r\n f.append(d[i])\r\n f.append(d[i + 1])\r\n if f.count('.') == 3 or f.count('#') == 3 or f.count('.') == 4 or f.count('#') == 4:\r\n print('YES')\r\n exit(0)\r\n f = []\r\nprint(\"NO\")", "def solve():\r\n rows = []\r\n for _ in range(4): rows.append(input())\r\n for i in range(3):\r\n up, down = rows[i], rows[i+1]\r\n for j in range(4):\r\n x = up[j]\r\n if x == down[j]:\r\n if j == 0: \r\n if up[j+1] == x or down[j+1] == x: return 'YES'\r\n elif j == 3: \r\n if up[j-1] == x or down[j-1] == x: return 'YES'\r\n elif up[j-1] == x or up[j+1] == x or down[j-1] == x or down[j+1] == x: return 'YES'\r\n return 'NO'\r\n\r\nprint(solve())", "def solve(lines):\r\n for i in range(3):\r\n for j in range(3):\r\n s = lines[i][j:j+2] + lines[i+1][j:j+2]\r\n if s.count(\".\") != 2:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nlines = [w.rstrip() for w in open(0).readlines()]\r\nprint(solve(lines))", "l=[]\r\nfor i in range(4):\r\n ll=[x for x in input()]\r\n l.append(ll)\r\nflag=0\r\nfor i in range(3):\r\n cnt1=cnt2=0\r\n flag=0\r\n for j in range(3):\r\n cnt=[]\r\n cnt.append(l[i][j])\r\n cnt.append(l[i][j+1])\r\n cnt.append(l[i+1][j])\r\n cnt.append(l[i+1][j+1])\r\n cnt1=cnt.count('#')\r\n cnt2=cnt.count('.')\r\n if(cnt1==3 or cnt2==3 or cnt1==4 or cnt2==4):\r\n flag=1\r\n print(\"YES\")\r\n break\r\n if flag==1:\r\n break\r\nif flag==0:\r\n print(\"NO\")", "ls=[]\r\nfor i in range(4):\r\n s=list(input())\r\n ls.append(s)\r\nflag=0\r\nfor i in range(3):\r\n if flag==1:\r\n break\r\n for j in range(3):\r\n count=0\r\n if ls[i][j]==\".\":\r\n count+=1\r\n if ls[i+1][j]==\".\":\r\n count+=1\r\n if ls[i][j+1]==\".\":\r\n count+=1\r\n if ls[i+1][j+1]==\".\":\r\n count+=1\r\n if count==1 or count==3 or count==0 or count==4:\r\n print(\"YES\")\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "matrix = []\r\nfor _ in range(4):\r\n\tline = [str(i) for i in input()]\r\n\tmatrix.append(line)\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tleft_top = matrix[i][j]\r\n\t\tright_top = matrix[i][j + 1]\r\n\t\tleft_bottom = matrix[i + 1][j]\r\n\t\tright_bottom = matrix[i + 1][j + 1]\r\n\t\tif left_top == right_top and right_top == left_bottom and left_bottom == right_bottom:\r\n\t\t\tprint('YES')\r\n\t\t\texit(0)\r\n\t\tlst = [left_top, right_top, left_bottom, right_bottom]\r\n\t\t#print(lst.count('#'), lst.count('.'), lst.count('#') == '3' or lst.count('.') == 3)\r\n\t\tif lst.count('#') == 3 or lst.count('.') == 3:\r\n\t\t\tprint('YES')\r\n\t\t\texit(0)\r\nprint('NO')", "paper = []\nfor i in range(4):\n row = input()\n paper.append(row)\n\nfor i in range(3):\n for j in range(3):\n black_count = 0\n white_count = 0\n if paper[i][j] == \"#\":\n black_count += 1\n else:\n white_count += 1\n\n if paper[i][j+1] == \"#\":\n black_count += 1\n else:\n white_count += 1\n\n if paper[i+1][j+1] == \"#\":\n black_count += 1\n else:\n white_count += 1\n\n if paper[i+1][j] == \"#\":\n black_count += 1\n else:\n white_count += 1\n if black_count >= 3 or white_count >= 3:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\n\n\t \t\t \t\t \t\t \t \t \t\t \t\t \t", "arr =([input()for _ in[0]*4])\r\nif sum([((arr[i][j]=='#')+(arr[i+1][j]=='#')+(arr[i][j+1]=='#')+(arr[i+1][j+1]=='#')!=2) for i in range(3) for j in range(3)])>0:\r\n print('YES')\r\nelse:print('NO')", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nmx = []\r\n\r\nfor _ in range(4):\r\n mx.append(input())\r\nfound = False\r\nfor i in range(3):\r\n for j, row in enumerate(mx[:-1]):\r\n temp = row[i] + row[i+1] + mx[j+1][i] + mx[j+1][i+1]\r\n # print(temp)\r\n if temp.count(\".\") > 2 or temp.count(\"#\") > 2:\r\n found = True\r\n break\r\n\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from functools import cmp_to_key\n\ndef main():\n lines = []\n for _ in range(4):\n lines.append(input())\n\n def check(color='#'):\n for i in range(4):\n for j in range(4):\n if lines[i][j] != color:\n continue\n if i + 1 < 4 and j + 1 < 4:\n count = 0\n for x, y in ((i, j), (i, j + 1), (i+1, j), (i+1, j + 1)):\n if lines[x][y] == color:\n count += 1\n if count >= 3:\n return True\n if i + 1 < 4 and j - 1 >= 0:\n # bottom left\n count = 0\n for x, y in ((i, j), (i, j - 1), (i+1, j), (i+1, j - 1)):\n if lines[x][y] == color:\n count += 1\n if count >= 3:\n return True\n if i - 1 >= 0 and j + 1 < 3:\n # top right\n count = 0\n for x, y in ((i, j), (i, j + 1), (i-1, j), (i-1, j + 1)):\n if lines[x][y] == color:\n count += 1\n if count >= 3:\n return True\n if i - 1 >= 0 and j - 1 >= 0:\n # top right\n count = 0\n for x, y in ((i, j), (i, j - 1), (i-1, j), (i-1, j - 1)):\n if lines[x][y] == color:\n count += 1\n if count >= 3:\n return True\n return False\n\n print('YES' if any([check('#'), check('.')]) else 'NO')\n\n \nif __name__ == \"__main__\":\n main()\n", "entry = [input() for _ in range(4)]\n\ndef main():\n for i in range(3):\n for j in range(3):\n quadrado = entry[i][j:j+2] + entry[i+1][j:j+2]\n if quadrado.count('.') >= 3 or quadrado.count('#') >= 3:\n print(\"YES\")\n return\n \n print(\"NO\")\n\nmain()\n\n\t\t \t \t\t \t \t\t \t\t\t \t \t \t \t", "sqmat=[]\r\nans='NO'\r\nfor i in range(4):\r\n sqmat.append([int(i) for i in input().replace('#','1').replace('.','0')])\r\nfor j in range(3):\r\n for k in range(3):\r\n l= sqmat[j][k]+sqmat[j+1][k]+sqmat[j][k+1]+sqmat[j+1][k+1]\r\n if l!=2:\r\n ans='YES'\r\n break\r\nprint(ans)", "l = []\r\nanswer = \"NO\"\r\nfor i in range(4):\r\n l.append(input())\r\n\r\nfor a in range(3):\r\n for b in range(3):\r\n if (l[a][b:b+2]+(l[a+1][b:b+2])).count(\"#\") != 2:\r\n answer = \"YES\" \r\n break\r\nprint(answer) ", "'''\r\nsakucode\r\n'''\r\n#func\r\ndef check(x,y,l):\r\n k=[0,0]\r\n for i in range(x,x+2):\r\n for j in range(y,y+2):\r\n if l[i][j]==\".\":\r\n k[0]+=1\r\n else: \r\n k[1]+=1\r\n #print(i,j,l[i][j],\"dot-> %d cross-> %d\"%(dot,Hash))\r\n if k in [[4,0],[0,4],[3,1],[1,3]]:\r\n return True\r\n else:\r\n return False\r\n\r\nl=[]\r\nfor _ in range(4):\r\n l.append(input())\r\nfor i in range(3):\r\n flag=0\r\n for j in range(3):\r\n if check(i,j,l):\r\n print(\"YES\")\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\nelse:\r\n print(\"NO\")", "a=''.join([input()for _ in[0]*4])\r\nprint('YNEOS'[all([a[x],a[x+1],a[x+4],a[x+5]].count('.')==2for x in[0,1,2,4,5,6,8,9,10])::2])", "def amount(a, u, d, l, r):\r\n k = 0\r\n for i in range(u, d):\r\n for j in range(l, r):\r\n if a[i][j] == '#':\r\n k += 1\r\n return k\r\n\r\n\r\na = []\r\nfor i in range(4):\r\n s = list(input())\r\n a.append(s)\r\nfor i in range(1, 3):\r\n for j in range(1, 3):\r\n u_l = amount(a, i - 1, i + 1, j - 1, j + 1)\r\n u_r = amount(a, i - 1, i + 1, j, j + 2)\r\n d_l = amount(a, i, i + 2, j - 1, j + 1)\r\n d_r = amount(a, i, i + 2, j, j + 2)\r\n if u_l == 0 or u_l == 1 or u_l == 3 or u_l == 4 or u_r == 0 or u_r == 1 or u_r == 3 or u_r == 4 or d_l == 0 or d_l == 1 or d_l == 3 or d_l == 4 or d_r == 0 or d_r == 1 or d_r == 3 or d_r == 4:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "import sys\r\n\r\n\r\ndef check_same_color(i,j):\r\n sum = paper[i][j] + paper[i+1][j] + paper[i+1][j+1] + paper[i][j+1]\r\n\r\n if sum != 2:\r\n return True\r\n return False\r\n\r\n\r\ndef set_no(l):\r\n arr = []\r\n for i in l:\r\n if i == '.':\r\n arr.append(0)\r\n else:\r\n arr.append(1)\r\n return arr\r\n\r\npaper = []\r\nfor i in range(0,4):\r\n row = list(input())\r\n paper.append(set_no(row))\r\n\r\n\r\n\r\nfor i in range(0,4):\r\n for j in range(0,4):\r\n if i+1 < 4 and j+1 <4:\r\n if check_same_color(i,j):\r\n print(\"YES\")\r\n sys.exit(0)\r\nprint(\"NO\")\r\n\r\n ", "grid = [input() for _ in range(4)]\r\n\r\ndef check_square(x, y):\r\n cnt = 0\r\n for i in range(2):\r\n for j in range(2):\r\n if grid[x + i][y + j] == '#':\r\n cnt += 1\r\n return cnt == 0 or cnt == 1 or cnt == 3 or cnt == 4\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if check_square(i, j):\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "ln1 = input()\r\nfor i in range(3):\r\n ln2 = input()\r\n for j in range(3):\r\n str1 = ln1[j] + ln2[j] + ln1[j + 1] + ln2[j+1]\r\n if str1.count('.') <= 1 or str1.count('#') <= 1:\r\n print('YES')\r\n exit()\r\n ln1 = ln2\r\nprint('NO')", "from tabnanny import check\n\n\ndef checkSquare(square, startRow, endCol):\n firstBox = square[startRow][endCol - 1]\n secondBox = square[startRow][endCol]\n thirdBox = square[startRow+1][endCol-1]\n fourthBox = square[startRow+1][endCol]\n\n if firstBox == secondBox:\n return firstBox == thirdBox or firstBox == fourthBox\n else:\n return (secondBox == thirdBox and secondBox == fourthBox) or (firstBox == thirdBox and firstBox == fourthBox)\n\ndef possibleSquare(square):\n for row in range(len(square) - 1):\n for col in range(len(square[row]) - 1):\n if checkSquare(square, row, col + 1):\n return \"YES\"\n\n return \"NO\"\n\n\nsquare = [input(), input(), input(), input()]\nprint(possibleSquare(square))\n \t\t \t\t\t \t \t \t\t \t\t \t", "def squares():\r\n indexes = []\r\n for i in range(4):\r\n indexes.extend(list(input()))\r\n indexes.insert(0,0)\r\n start_i = 1\r\n\r\n for i in range(1, 12):\r\n idx_1 = i\r\n if (idx_1 % 4 == 0):\r\n continue\r\n else:\r\n temp_22 = [indexes[idx_1], indexes[idx_1+1], indexes[idx_1+4], indexes[idx_1+5]]\r\n if (temp_22.count('#') >= 3) or (temp_22.count('.') >= 3):\r\n return \"YES\"\r\n return \"NO\" \r\nprint(squares())", "a=[]\r\nfor i in range(4):\r\n x=input()\r\n a.append(x)\r\nfor i in range(3):\r\n for j in range(3):\r\n x=\"\"\r\n x+=(a[i][j]+a[i][j+1]+a[i+1][j]+a[i+1][j+1])\r\n d=x.count('.')\r\n h=x.count('#')\r\n if d==3 or h==3 or d==4 or h==4:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue May 4 06:09:25 2021\r\n\r\n@author: Mo'men\r\n\"\"\"\r\n\r\nimport sys\r\npicture = []\r\nfor i in range(4):\r\n row = sys.stdin.readline()\r\n number_row = []\r\n for j in range(4):\r\n if row[j] == '#':\r\n number_row.append(-1)\r\n else:\r\n number_row.append(1)\r\n \r\n picture.append(number_row)\r\nflag = False\r\nfor i in range(3):\r\n for j in range(3):\r\n if picture[i][j] + picture[i][j+1] + picture[i+1][j] + picture[i+1][j+1] != 0:\r\n print(\"YES\")\r\n flag = True\r\n break\r\n if flag: break\r\nif not flag:\r\n print(\"NO\")\r\n", "lst = []\r\nfor i in range(4):\r\n lst.append(list(input()))\r\n\r\nfor i in range(3):\r\n hashes = 0\r\n dots = 0\r\n for j in range(1,4):\r\n if lst[i][j] == '#':\r\n hashes += 1\r\n else:\r\n dots += 1\r\n if lst[i][j-1] == '#':\r\n hashes += 1\r\n else:\r\n dots += 1\r\n if lst[i+1][j] == '#':\r\n hashes += 1\r\n else:\r\n dots += 1\r\n if lst[i+1][j-1] == '#':\r\n hashes += 1\r\n else:\r\n dots += 1\r\n if abs(hashes - dots) >= 2:\r\n print('YES')\r\n exit()\r\n\r\nprint(\"NO\")", "m=[input().strip() for i in range(4)]\r\nfor i in range(0,3):\r\n\tfor j in range(0,3):\r\n\t\tk=0\r\n\t\tfor x in range(i,i+2):\r\n\t\t\tfor y in range(j,j+2):\r\n\t\t\t\tif m[x][y]=='#':\r\n\t\t\t\t\tk+=1\r\n\t\tif k==0 or k==1 or k==3 or k==4:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\nprint(\"NO\")\r\n", "def solve():\r\n l=[]\r\n for _ in range(4):\r\n l.append(list(map(str,input())))\r\n for i in range(3):\r\n for j in range(3):\r\n h,d=(0,0)\r\n for k in range(i,i+2):\r\n for o in range(j,j+2):\r\n if l[k][o]=='#':\r\n h+=1\r\n else:\r\n d+=1\r\n if(h-d>=2 or d-h>=2):\r\n print('YES')\r\n return\r\n \r\n print('NO')\r\nif '__main__' == __name__:\r\n solve()", "mat=[]\r\nfor _ in range(4):\r\n mat.append(input())\r\ndef dfs(i,j):\r\n if i+1<4 and j+1<4:\r\n if mat[i+1][j+1]==mat[i+1][j] and mat[i+1][j+1]==mat[i][j+1]:\r\n return True\r\n if i-1>=0 and j-1>=0:\r\n if mat[i-1][j-1]==mat[i-1][j] and mat[i-1][j-1]==mat[i][j-1]:\r\n\r\n return True\r\n if i+1<4 and j-1>=0:\r\n if mat[i+1][j-1]==mat[i+1][j] and mat[i+1][j-1]==mat[i][j-1]:\r\n return True\r\n\r\n if i-1>=0 and j+1<4:\r\n if mat[i-1][j+1]==mat[i-1][j] and mat[i-1][j+1]==mat[i][j+1]:\r\n return True\r\nans=\"NO\"\r\nfor i in range(4):\r\n for j in range(4):\r\n if dfs(i,j):\r\n ans='YES'\r\n break\r\nprint(ans)\r\n\r\n", "li=[input() for i in range(4)]\r\ndone=False\r\nfor i in range(3):\r\n for j in range(3):\r\n hsh,dot=0,0\r\n if li[i][j]=='#':\r\n hsh+=1\r\n else:\r\n dot+=1\r\n if li[i][j+1]=='#':\r\n hsh+=1\r\n else:\r\n dot+=1\r\n if li[i+1][j]=='#':\r\n hsh+=1\r\n else:\r\n dot+=1\r\n if li[i+1][j+1]=='#':\r\n hsh+=1\r\n else:\r\n dot+=1\r\n if hsh==4 or dot==4 or hsh==3 or dot==3:\r\n print('YES')\r\n done=True\r\n break\r\n if done==True:\r\n break\r\nelse:\r\n print('NO')", "grid = [list(input()) for _ in range(4)]\r\nres = \"NO\"\r\nfor i in range(3):\r\n for j in range(3):\r\n if((grid[i][j] == '#') + (grid[i][j+1] == '#') + (grid[i+1][j] == '#') + (grid[i+1][j+1] == '#') != 2):\r\n res = \"YES\"\r\nprint(res)\r\n", "def IQ_Test():\r\n row1 = [1 if x == '#' else 0 for x in input() ]\r\n row2 = [1 if x == '#' else 0 for x in input() ]\r\n row3 = [1 if x == '#' else 0 for x in input() ]\r\n row4 = [1 if x == '#' else 0 for x in input() ] \r\n \r\n #print(len(row1))\r\n diff_1_2 = [0,0,0,0]\r\n add_1_2 = [0,0,0,0]\r\n for i in range(4):\r\n diff_1_2[i] = abs(row1[i] - row2[i]) \r\n add_1_2[i] = row1[i] + row2[i]\r\n \r\n diff_2_3 = [0,0,0,0]\r\n add_2_3 = [0,0,0,0]\r\n for i in range(4):\r\n diff_2_3[i] = abs(row2[i] - row3[i]) \r\n add_2_3[i] = row2[i] + row3[i]\r\n\r\n diff_3_4 = [0,0,0,0]\r\n add_3_4 = [0,0,0,0]\r\n for i in range(4):\r\n diff_3_4[i] = abs(row3[i] - row4[i]) \r\n add_3_4[i] = row3[i] + row4[i]\r\n\r\n found = False \r\n marker = 0 \r\n while not found and marker < (len(row1)-1):\r\n #print(marker)\r\n d1 = diff_1_2[marker] + diff_1_2[marker+1] #alowed cases 0 1 ,1 0, 0 0 \r\n d2 = diff_2_3[marker] + diff_2_3[marker+1] # 0 0 is allowed only when the additions are same that is all 4 are already same\r\n d3 = diff_3_4[marker] + diff_3_4[marker+1] #this allowed values of di are 1 or 0\r\n a1 = add_1_2[marker] - add_1_2[marker+1] #if di is zero then ai must be 0\r\n a2 = add_2_3[marker] - add_2_3[marker+1]\r\n a3 = add_3_4[marker] - add_3_4[marker+1]\r\n if (d1 == 1 or (d1 == 0 and a1 == 0 )or d2 == 1 or (d2 == 0 and a2 == 0) or d3 == 1 or (d3 == 0 and a3 == 0)):\r\n found = True\r\n marker += 1 \r\n \r\n if found:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n return\r\n\r\n \r\nIQ_Test()", "def solve(grid):\r\n for i in range(3):\r\n for j in range(3):\r\n square = [grid[i][j], grid[i][j + 1], grid[i + 1][j], grid[i + 1][j + 1]]\r\n val = sum(1 for c in square if c == \"#\")\r\n if val in [0, 1, 3, 4]:\r\n return True\r\n return False\r\n\r\n\r\ndef main():\r\n grid = [input() for _ in range(4)]\r\n ans = solve(grid)\r\n print(\"YES\" if ans else \"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\"\"\"A. IQ Test - Code Forces\"\"\"\r\nmatrix = []\r\nfor arr in range(4):\r\n # Fill matrix with [arr/line]\r\n matrix.append(list(input()))\r\n# Loop over line(Array)\r\nfor i in range(3):\r\n # Loop over values in line(Array) \r\n for k in range(3):\r\n square = matrix[i][k] + matrix[i][k+1] + matrix[i+1][k] + matrix[i+1][k+1]\r\n # if ### or .... -> yes after flipping one value, more -> existed already\r\n if square.count('#') >= 3 or square.count('.') >= 3:\r\n print('YES')\r\n # Exit whole code\r\n exit()\r\nprint('NO')\r\n", "def comp(a,b,c,d):\n if a==b and b==c and a!=d: return True\n if a==b and b==d and a!=c: return True\n if a==c and d==c and a!=b: return True\n if b==c and c==d and b!=a: return True\n \n return False\n\ndef ig(a,b,c,d):\n if a==b and b==c and c==d: return True\n return False\n\nmat=[]\nans=\"NO\"\nfor i in range(4):\n mat.append(input())\n\nfor i in range(3):\n for j in range(3):\n if comp(mat[i][j],mat[i+1][j],mat[i][j+1],mat[i+1][j+1]) or ig(mat[i][j],mat[i+1][j],mat[i][j+1],mat[i+1][j+1]):\n ans=\"YES\"\n\nprint(ans)\n\n\t \t\t \t \t \t \t\t \t\t\t \t \t \t", "board = []\r\nfor i in range(4):\r\n board.append(input())\r\n\r\ndef kappa():\r\n for i in range(3):\r\n for j in range(3):\r\n c = [board[i][j+1], board[i+1][j], board[i][j], board[i+1][j+1]].count('.')\r\n if c <= 1 or c >= 3:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n \r\nkappa()", "for _ in range(4):\r\n line1=input()\r\n line2=input()\r\n line3=input()\r\n line4=input()\r\n matrix=[list(line1),list(line2),list(line3),list(line4)]\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n flag = 1\r\n mk='.'\r\n if mk=='.':\r\n if matrix[i+1][j]!='.':\r\n flag=0\r\n if matrix[i][j+1]!='.':\r\n flag=0\r\n if matrix[i+1][j+1]!='.':\r\n flag=0\r\n if flag == 1:\r\n print('YES')\r\n exit()\r\n\r\n flag = 1\r\n mk='#'\r\n if mk== '#':\r\n if matrix[i + 1][j] != '#':\r\n flag=0\r\n if matrix[i][j + 1] != '#':\r\n flag=0\r\n if matrix[i + 1][j + 1]!= '#':\r\n flag=0\r\n\r\n if flag==1:\r\n print('YES')\r\n exit()\r\n\r\n for i in range(1,4):\r\n for j in range(3):\r\n flag = 1\r\n mk = '.'\r\n if mk == '.':\r\n if matrix[i - 1][j] != '.':\r\n flag = 0\r\n if matrix[i][j + 1] != '.':\r\n flag = 0\r\n if matrix[i - 1][j + 1] != '.':\r\n flag = 0\r\n if flag == 1:\r\n print('YES')\r\n exit()\r\n\r\n flag = 1\r\n mk = '#'\r\n if mk == '#':\r\n if matrix[i - 1][j] != '#':\r\n flag = 0\r\n if matrix[i][j + 1] != '#':\r\n flag = 0\r\n if matrix[i - 1][j + 1] != '#':\r\n flag = 0\r\n\r\n if flag == 1:\r\n print('YES')\r\n exit()\r\n\r\n for i in range(3):\r\n for j in range(1,4):\r\n flag = 1\r\n mk = '.'\r\n if mk == '.':\r\n if matrix[i + 1][j] != '.':\r\n flag = 0\r\n if matrix[i][j - 1] != '.':\r\n flag = 0\r\n if matrix[i+1][j - 1] != '.':\r\n flag = 0\r\n if flag == 1:\r\n print('YES')\r\n exit()\r\n\r\n flag = 1\r\n mk = '#'\r\n if mk == '#':\r\n if matrix[i + 1][j] != '#':\r\n flag = 0\r\n if matrix[i][j - 1] != '#':\r\n flag = 0\r\n if matrix[i + 1][j -1] != '#':\r\n flag = 0\r\n\r\n if flag == 1:\r\n print('YES')\r\n exit()\r\n\r\n for i in range(1,4):\r\n for j in range(1,4):\r\n flag = 1\r\n mk = '.'\r\n if mk == '.':\r\n if matrix[i - 1][j] != '.':\r\n flag = 0\r\n if matrix[i][j-1] != '.':\r\n flag = 0\r\n if matrix[i - 1][j - 1] != '.':\r\n flag = 0\r\n if flag == 1:\r\n print('YES')\r\n exit()\r\n\r\n flag = 1\r\n mk = '#'\r\n if mk == '#':\r\n if matrix[i - 1][j] != '#':\r\n flag = 0\r\n if matrix[i][j-1] != '#':\r\n flag = 0\r\n if matrix[i - 1][j - 1] != '#':\r\n flag = 0\r\n\r\n if flag == 1:\r\n print('YES')\r\n exit()\r\n print('NO')\r\n exit()\r\n\r\n\r\n\r\n\r\n", "def test_passed(grid):\r\n # Check if the original grid contains a 2x2 square of cells of the same color\r\n for i in range(3):\r\n for j in range(3):\r\n if grid[i][j] == grid[i+1][j] == grid[i][j+1] == grid[i+1][j+1]:\r\n return True\r\n\r\n # If the original grid does not contain a 2x2 square of cells of the same color,\r\n # try repainting each cell and check if the resulting grid contains a 2x2 square\r\n # of cells of the same color\r\n for i in range(4):\r\n for j in range(4):\r\n # Repaint the cell\r\n grid[i][j] = '.' if grid[i][j] == '#' else '#'\r\n\r\n # Check if the resulting grid contains a 2x2 square of cells of the same color\r\n for x in range(3):\r\n for y in range(3):\r\n if grid[x][y] == grid[x+1][y] == grid[x][y+1] == grid[x+1][y+1]:\r\n return True\r\n\r\n # Restore the original color of the cell\r\n grid[i][j] = '.' if grid[i][j] == '#' else '#'\r\n\r\n # If none of the attempts at repainting a cell result in a 2x2 square of cells of\r\n # the same color, return False\r\n return False\r\n\r\n# Read in the 4x4 grid of characters\r\ngrid = []\r\nfor i in range(4):\r\n grid.append(list(input()))\r\n\r\n# Determine if the test can be passed and print the result\r\nif test_passed(grid):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "mat=[['']*1 for _ in range(4)]\r\nfor i in range(4):\r\n temp=input()\r\n mat[i]=temp\r\nprinted=False\r\n\r\nfor i in range(3):\r\n if printed:\r\n break\r\n has=0\r\n dots=0\r\n for j in range(1,4):\r\n if mat[i][j]=='#':\r\n has+=1\r\n else:\r\n dots+=1\r\n if mat[i][j-1]=='#':\r\n has+=1\r\n else:\r\n dots+=1\r\n if mat[i+1][j]=='#':\r\n has+=1\r\n else:\r\n dots+=1\r\n if mat[i+1][j-1]=='#':\r\n has+=1\r\n else:\r\n dots+=1\r\n if abs(has-dots)>=2:\r\n print('YES')\r\n printed=True\r\n break\r\nif not printed:\r\n print('NO')", "#from collections import Counter\r\n#from collections import defaultdict\r\n#import math\r\n#n = int(input())\r\n#n,m = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n#t = list(map(int,input().split()))\r\n\r\n\r\nl = [input(),input(),input(),input()]\r\nflag = False\r\nfor i in range(3):\r\n for j in range(3):\r\n t = [l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1]].count(\"#\")\r\n if 0<=t<=1 or 3<=t<=4:\r\n flag = True\r\n break\r\n\r\nif flag :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = 4\r\nt = n\r\nrows = []\r\nwhile t > 0:\r\n t -= 1\r\n line = input()\r\n l = []\r\n l[0:] = line\r\n rows.append(l)\r\n\r\nstop = False\r\nfor i in range(3):\r\n for j in range(3):\r\n\r\n a, b, c, d = rows[i][j], rows[i + 1][j], rows[i][j + 1], rows[i + 1][j + 1]\r\n di = {}\r\n di[a] = 1\r\n if b in di:\r\n di[b] += 1\r\n else:\r\n di[b] = 1\r\n if c in di:\r\n di[c] += 1\r\n else:\r\n di[c] = 1\r\n if d in di:\r\n di[d] += 1\r\n else:\r\n di[d] = 1\r\n\r\n if di.get('.') is not None:\r\n if di['.'] >= 3:\r\n stop = True\r\n break\r\n if di.get('#') is not None:\r\n if di['#'] >= 3:\r\n stop = True\r\n break\r\n if stop:\r\n break\r\n\r\nif stop:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "f = 0\r\na = [0] * 4\r\nfor i in range(4):\r\n a[i] = list(input())\r\n for j in range(4):\r\n if a[i][j] == \"#\":\r\n a[i][j] = 1\r\n else:\r\n a[i][j] = -1\r\n if i != 0:\r\n for j in range(3):\r\n if a[i - 1][j] + a[i][j] + a[i - 1][j + 1] + a[i][j + 1] == 0:\r\n continue\r\n else:\r\n f = 1\r\n break\r\nif f == 0:\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef pattern(points):\r\n num1,num2 = 0,0\r\n for p in points:\r\n if p == \"#\" : num1+= 1\r\n else: num2 += 1\r\n return (num1 >= 3) or (num2 >= 3) \r\n \r\nsquare = [ input() for _ in range(4) ]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if pattern([square[i][j],square[i+1][j],square[i][j+1],square[i+1][j+1]]):\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")\r\n", "from pprint import pprint\nfrom collections import Counter\ngrid = []\n\nfor r in range(4):\n grid.append(list(input()))\n\nsol_flag = False\n\nfor r in range(3):\n for c in range(3):\n square_vals = [grid[r][c], grid[r][c+1], grid[r+1][c], grid[r+1][c+1]]\n counts = Counter(square_vals)\n\n if len(set(square_vals)) == 1 or (counts[\".\"] == 1 and counts['#'] == 3) or (counts[\"#\"] == 1 and counts['.'] == 3):\n sol_flag = True\n\nif sol_flag:\n print('YES')\nelse:\n print('NO')\n \n#pprint(grid)", "x=[]\r\nc='NO'\r\nfor i in range (4):\r\n x.append(input())\r\nfor a in range(3):\r\n for b in range(3):\r\n if (x[a][b:b+2]+(x[a+1][b:b+2])).count('#')!=2:\r\n c=\"YES\"\r\n break\r\n\r\nprint(c)", "import sys\r\na = [[1 if i == '#' else 0 for i in input()] for j in range(4)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] + a[i + 1][j] + a[i][j + 1] + a[i + 1][j + 1] != 2:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\r\n\r\n", "l=[input() for i in range(4)]\r\n\r\ndn=False\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n ck=[l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1]]\r\n\r\n if ck.count('#')>=3 or ck.count('.')>=3:\r\n print(\"YES\")\r\n dn=True\r\n break\r\n\r\n if dn:\r\n break\r\n\r\nelse:\r\n print(\"NO\")", "def is_valid(squares):\r\n for i in range(3):\r\n for j in range(3):\r\n sub_square = [squares[i][j], squares[i][j + 1],\r\n squares[i + 1][j], squares[i + 1][j + 1]]\r\n if sub_square.count('#') in (0, 1, 4):\r\n return True\r\n if sub_square.count('.') in (0, 1, 4):\r\n return True\r\n return False\r\n\r\nsquares = [list(input()) for _ in range(4)]\r\n\r\nif is_valid(squares):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = []\r\nfor i in range(4):\r\n\ts.append(input())\r\nc = 0\r\n\r\nfor i in range(1,4):\r\n\tfor j in range(1,4):\r\n\t\ta = s[i][j]+s[i-1][j]+s[i-1][j-1]+s[i][j-1]\r\n\t\tif a.count(\"#\")>=3 or a.count(\".\")>=3:\r\n\t\t\tc = True\r\n\t\t\tbreak\r\nif c:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "the_painting = []\r\nwhite_spot = 0\r\nblack_spot = 0\r\nflag = True\r\n\r\nfor _ in range(4):\r\n the_painting.append(input())\r\n\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if the_painting[i][j] == \"#\":\r\n black_spot += 1\r\n else :\r\n white_spot += 1\r\n\r\n if the_painting[i][j+1] == \"#\":\r\n black_spot += 1\r\n else :\r\n white_spot += 1\r\n\r\n if the_painting[i+1][j] == \"#\":\r\n black_spot += 1\r\n else :\r\n white_spot += 1\r\n \r\n if the_painting[i+1][j+1] == \"#\":\r\n black_spot += 1\r\n else :\r\n white_spot += 1\r\n\r\n\r\n\r\n\r\n if white_spot == black_spot:\r\n white_spot = 0\r\n black_spot = 0\r\n else :\r\n print(\"YES\")\r\n flag = False\r\n break\r\n\r\n if not flag:\r\n break\r\nif flag:\r\n print(\"NO\")\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ng = [input()[:-1] for _ in range(4)]\r\nans = \"NO\"\r\nfor i in range(3):\r\n for j in range(3):\r\n w = [g[i][j], g[i+1][j], g[i][j+1], g[i+1][j+1]]\r\n if w.count('.') != 2:\r\n ans = \"YES\"\r\n break\r\n if ans == \"YES\":\r\n break\r\nprint(ans)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n for i in range(1, n):\r\n for j in range(1, n):\r\n val = 0\r\n if A[i-1][j-1] == '#':\r\n val += 1\r\n if A[i-1][j] == '#':\r\n val += 1\r\n if A[i][j-1] == '#':\r\n val += 1\r\n if A[i][j] == '#':\r\n val += 1\r\n if val == 0 or val == 1 or val == 3 or val == 4:\r\n return True\r\n return False\r\n\r\ndef main():\r\n A = []\r\n for i in range(4):\r\n A.append(input())\r\n if solve(A):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = []\r\n\r\nfor i in range(4):\r\n s = input()\r\n b = []\r\n b[:0] = s\r\n a.append(b)\r\nc = 0\r\nfor i in range(3):\r\n if c==1:\r\n break\r\n for j in range(3):\r\n b = 0\r\n if a[i][j]=='#':\r\n b += 1\r\n if a[i+1][j] == '#':\r\n b += 1\r\n if a[i][j+1] == '#':\r\n b += 1\r\n if a[i+1][j+1] == '#':\r\n b += 1\r\n\r\n if b == 3 or b == 1 or b == 0 or b == 4:\r\n print('YES')\r\n c = 1\r\n break\r\n\r\nif c == 0:\r\n print('NO')\r\n", "p = ''\nfor i in range(4):\n p += input()\nf = 'NO'\nfor i in range(0, 9, 4):\n for j in range(3):\n k = i + j\n cont = 0\n for l in [k, k+1, k+4, k+5]:\n if p[l] == '.': cont += 1\n if cont != 2: f = 'YES'\nprint(f)\n\t \t\t \t \t \t\t \t \t\t\t \t\t\t\t\t\t\t", "square = []\r\n\r\nfor i in range(4):\r\n\tsquare.append(list(input()))\r\n\t\r\ntestPassed = False\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tif testPassed:\r\n\t\t\tbreak\r\n\t\t\r\n\t\tsmallSquare = square[i][j] + square[i+1][j] + square[i][j+1] + square[i+1][j+1]\r\n\t\twhiteCount = smallSquare.count('.')\r\n\t\tblackCount = smallSquare.count('#')\r\n\t\t\r\n\t\tif (whiteCount == 3 and blackCount == 1) or (whiteCount == 1 and blackCount == 3) or (whiteCount == 4 and blackCount == 0) or (whiteCount == 0 and blackCount == 4):\r\n\t\t\ttestPassed = True\r\n\t\t\tprint(\"YES\")\r\n\r\nif not testPassed:\r\n\tprint(\"NO\")", "# It's all about what U BELIEVE\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n###############################################################################\n############################ SOLUTION IS COMING ###############################\n###############################################################################\ngrid = []\nfor i in range(4):\n grid.append(input())\n\nfor i in range(3):\n for j in range(3):\n s = []\n s.append(grid[i][j])\n s.append(grid[i][j + 1])\n s.append(grid[i + 1][j])\n s.append(grid[i + 1][j + 1])\n if s.count(s[0]) in [4, 3, 1]:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "import sys\r\n\r\narr = [input(),input(),input(),input()]\r\n\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tsquare = [arr[i][j],arr[i+1][j],arr[i][j+1],arr[i+1][j+1]]\r\n\t\tif square.count(\"#\") >= 3 or square.count(\".\") >= 3:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\n\r\nprint(\"NO\")", "# http://codeforces.com/problemset/problem/287/A\r\n\r\n\"\"\"\r\nGiven a 4x4 square, # represents black, . represents white\r\nRepaint at most one cell (none or one) such that we get a 2x2 square\r\nthat has all the same colour.\r\n\r\nGiven a 4x4 square, determine whether it is possible or not.\r\n\r\nJust check\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n square = []\r\n for i in range(4):\r\n square.append([state for state in input()])\r\n\r\n for i in range(3):\r\n for j in range(3):\r\n states = [\r\n square[i][j], square[i][j+1],\r\n square[i+1][j], square[i+1][j+1]\r\n ]\r\n\r\n if states.count('#') >= 3 or states.count('.') >= 3:\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l=[]\r\nfor i in range(4):\r\n s=input()\r\n a=[]\r\n for i in s:\r\n a.append(i)\r\n l.append(a)\r\nfor i in range(3):\r\n for j in range(3):\r\n count1=int(0)\r\n count2=int(0)\r\n if l[i][j]=='#':\r\n count1+=1\r\n else:\r\n count2+=1\r\n if l[i][j+1]=='#':\r\n count1+=1\r\n else:\r\n count2+=1\r\n if l[i+1][j]=='#':\r\n count1+=1\r\n else:\r\n count2+=1\r\n if l[i+1][j+1]=='#':\r\n count1+=1\r\n else:\r\n count2+=1\r\n if count1==3 or count2==3 or count1==4 or count2==4:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") ", "matrix=[]\nanswer=\"NO\"\nfor i in range (4):\n matrix.append(input())\nfor i in range(3):\n for j in range(3):\n if ((matrix[i][j])+(matrix[i][j+1])+(matrix[i+1][j])+(matrix[i+1][j+1])).count(\"#\") !=2:\n answer=\"YES\"\n break\nprint(answer)\n\n\n \t \t \t \t\t \t\t \t\t\t \t", "def solve():\r\n\tgrid = []\r\n\tfor i in range(4):\r\n\t\tgrid.append(input())\r\n\r\n\r\n\tfor row in range(3):\r\n\t\tfor col in range(3):\r\n\t\t\thash_map = {'.':0, '*':0}\r\n\t\t\tfor i in range(row, row + 2):\r\n\t\t\t\tfor j in range(col, col + 2):\r\n\t\t\t\t\tif grid[i][j] == '.': hash_map['.'] += 1\r\n\t\t\t\t\telse: hash_map['*'] += 1\r\n\t\t\tif (hash_map['*'] == 3 and hash_map['.'] == 1) or\\\r\n\t\t\t\t(hash_map['*'] == 1 and hash_map['.'] == 3) or\\\r\n\t\t\t\t(hash_map['*'] == 4) or\\\r\n\t\t\t\t(hash_map['.'] == 4):\r\n\t\t\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\n\r\n\r\nprint(solve())", "arr = []\r\nfor i in range(4):\r\n arr.append(list(input()))\r\nok = 'NO'\r\nfor i in range(3):\r\n for j in range(3):\r\n zhoda = 0\r\n if arr[i][j] == '.':\r\n zhoda += 1\r\n if arr[i+1][j] == '.':\r\n zhoda +=1\r\n if arr[i][j+1] == '.':\r\n zhoda += 1\r\n if arr[i+1][j + 1] == '.':\r\n zhoda += 1\r\n\r\n if zhoda != 2:\r\n ok = 'YES'\r\n\r\nprint(ok)", "def test():\r\n lst = []\r\n N = 4\r\n \r\n for i in range(N):\r\n lst.append(input())\r\n \r\n for i in range(N - 1):\r\n for j in range(len(lst) - 1):\r\n \r\n tmp = [lst[i][j], lst[i + 1][j], lst[i][j + 1], lst[i + 1][j + 1]]\r\n if tmp.count('.') >= 3 or tmp.count('#') >= 3:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\nprint(test())", "#51 IQ Test\r\nn = 4\r\nlst = []\r\nflag = False\r\nfor i in range(n):\r\n lst.append(input())\r\n\r\nfor i in range(3):\r\n if flag: break\r\n for j in range(3):\r\n sq = [lst[i][j],lst[i][j+1],lst[i+1][j],lst[i+1][j+1]]\r\n if sq.count('#') in [0,1,3,4]:\r\n print('YES')\r\n flag = True\r\n break\r\n\r\nif not (flag) : \r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nboard = []\r\nfor i in range(4):\r\n\tboard.append(input()[:-1])\r\n\r\nget = False\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tcnt = board[i][j:j+2].count(\"#\") + board[i+1][j:j+2].count(\"#\")\r\n\t\tif cnt >= 3 or cnt <= 1:\r\n\t\t\tget = True\r\n\t\t\tbreak\r\n\tif get: break\r\nif get: print(\"YES\")\r\nelse: print(\"NO\")", "def solve(grid):\n for i in range(3):\n for j in range(3):\n if grid[i][j] + grid[i+1][j] + grid[i][j+1] + grid[i+1][j+1] != 2:\n print(\"YES\")\n return \"YES\"\n print(\"NO\")\n return \"NO\"\n\ngrid = []\nfor i in range(4):\n raw_array = input()\n array = []\n for i in range(4):\n if raw_array[i] == \"#\":\n array.append(1)\n else:\n array.append(0)\n\n grid.append(array)\n\nsolve(grid)\n\n\n\n\n\n\n \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\tl1: str = read().strip()\r\n\tl2: str = read().strip()\r\n\tl3: str = read().strip()\r\n\tl4: str = read().strip()\r\n\tmatrix = [l1, l2, l3, l4]\r\n\r\n\tfor i in range(3):\r\n\t\tline = matrix[i]\r\n\t\tnext_line = matrix[i+1]\r\n\t\tfor j in range(3):\r\n\t\t\tc1, c2, c3, c4 = line[j], line[j+1], next_line[j], next_line[j+1]\r\n\t\t\tblack, white = 0, 0\r\n\t\t\tif c1 == '#':\r\n\t\t\t\tblack += 1\r\n\t\t\telse:\r\n\t\t\t\twhite += 1\r\n\t\t\tif c2 == '#':\r\n\t\t\t\tblack += 1\r\n\t\t\telse:\r\n\t\t\t\twhite += 1\r\n\t\t\tif c3 == '#':\r\n\t\t\t\tblack += 1\r\n\t\t\telse:\r\n\t\t\t\twhite += 1\r\n\t\t\tif c4 == '#':\r\n\t\t\t\tblack += 1\r\n\t\t\telse:\r\n\t\t\t\twhite += 1\r\n\t\t\tif black >=3 or white >=3:\r\n\t\t\t\tprint('YES')\r\n\t\t\t\treturn\r\n\tprint('NO')\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "from sys import stdin\r\n\r\ndef Ver(matrix):\r\n for y in range(4):\r\n for x in range(4):\r\n try:\r\n # Point\r\n if matrix[x+1][y] == '.' and matrix[x+1][y+1] == '.' and matrix[x][y+1] == '.':\r\n return \"YES\"\r\n elif matrix[x-1][y] == '.' and matrix[x-1][y+1] == '.' and matrix[x][y+1] == '.':\r\n return \"YES\"\r\n elif matrix[x-1][y] == '.' and matrix[x-1][y-1] == '.' and matrix[x][y-1] == '.':\r\n return \"YES\"\r\n elif matrix[x+1][y] == '.' and matrix[x+1][y-1] == '.' and matrix[x][y-1] == '.':\r\n return \"YES\"\r\n # Chart\r\n elif matrix[x+1][y] == '#' and matrix[x+1][y+1] == '#' and matrix[x][y+1] == '#':\r\n return \"YES\"\r\n elif matrix[x-1][y] == '#' and matrix[x-1][y+1] == '#' and matrix[x][y+1] == '#':\r\n return \"YES\"\r\n elif matrix[x-1][y] == '#' and matrix[x-1][y-1] == '#' and matrix[x][y-1] == '#':\r\n return \"YES\"\r\n elif matrix[x+1][y] == '#' and matrix[x+1][y-1] == '#' and matrix[x][y-1] == '#':\r\n return \"YES\"\r\n except:\r\n continue\r\n return \"NO\" \r\n\r\ndef main():\r\n test = []\r\n for _ in range(4):\r\n line = list(stdin.readline().strip())\r\n test.append(line)\r\n print(Ver(test))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=str(input())\r\ns1=str(input())\r\ns2=str(input())\r\ns3=str(input())\r\nl=[]\r\nflag=0\r\nl.append(s[0])\r\nl.append(s[1])\r\nl.append(s1[0])\r\nl.append(s1[1])\r\nfor i in range(0,len(l)):\r\n if(l.count(\"#\")>2 or l.count(\".\")>2):\r\n flag=1\r\n \r\nl1=[] \r\nl1.append(s[1])\r\nl1.append(s[2])\r\nl1.append(s1[1])\r\nl1.append(s1[2])\r\nfor i in range(0,len(l1)):\r\n if(l1.count(\"#\")>2 or l1.count(\".\")>2):\r\n flag=1\r\nl2=[] \r\nl2.append(s[2])\r\nl2.append(s[3])\r\nl2.append(s1[2])\r\nl2.append(s1[3])\r\nfor i in range(0,len(l2)):\r\n if(l2.count(\"#\")>2 or l2.count(\".\")>2):\r\n flag=1 \r\nl3=[]\r\nl3.append(s1[0])\r\nl3.append(s1[1])\r\nl3.append(s2[0])\r\nl3.append(s2[1])\r\nfor i in range(0,len(l3)):\r\n if(l3.count(\"#\")>2 or l3.count(\".\")>2):\r\n flag=1\r\nl4=[] \r\nl4.append(s1[1])\r\nl4.append(s1[2])\r\nl4.append(s2[1])\r\nl4.append(s2[2])\r\nfor i in range(0,len(l4)):\r\n if(l4.count(\"#\")>2 or l4.count(\".\")>2):\r\n flag=1\r\nl5=[] \r\nl5.append(s1[2])\r\nl5.append(s1[3])\r\nl5.append(s2[2])\r\nl5.append(s2[3])\r\nfor i in range(0,len(l5)):\r\n if(l5.count(\"#\")>2 or l5.count(\".\")>2):\r\n flag=1 \r\nl6=[]\r\nl6.append(s2[0])\r\nl6.append(s2[1])\r\nl6.append(s3[0])\r\nl6.append(s3[1])\r\nfor i in range(0,len(l6)):\r\n if(l6.count(\"#\")>2 or l6.count(\".\")>2):\r\n flag=1\r\nl7=[] \r\nl7.append(s2[1])\r\nl7.append(s2[2])\r\nl7.append(s3[1])\r\nl7.append(s3[2])\r\nfor i in range(0,len(l7)):\r\n if(l7.count(\"#\")>2 or l7.count(\".\")>2):\r\n flag=1\r\nl8=[] \r\nl8.append(s2[2])\r\nl8.append(s2[3])\r\nl8.append(s3[2])\r\nl8.append(s3[3])\r\nfor i in range(0,len(l8)):\r\n if(l8.count(\"#\")>2 or l8.count(\".\")>2):\r\n flag=1 \r\nif(flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n", "s = ''\nt = ['####','....','###.','##.#','#.##','.###','...#','..#.','.#..','#...']\nfor i in range(4):\n s += input()\nflag = False\nk = 0\nfor i in range(0,9,4):\n for j in range(i,i+3):\n if s[j]+s[j+1]+s[j+4]+s[j+5] in t:\n flag = True\n break \nif flag==True:\n print(\"YES\")\nelse:\n print(\"NO\") ", "def square(i,j):\r\n countHash=0\r\n countDot=0\r\n if(lines[i][j]==\"#\"):\r\n countHash = countHash + 1\r\n else:\r\n countDot = countDot + 1\r\n if(lines[i+1][j+1]==\"#\"):\r\n countHash = countHash + 1\r\n else:\r\n countDot = countDot + 1\r\n if(lines[i+1][j]==\"#\"):\r\n countHash = countHash + 1\r\n else:\r\n countDot = countDot + 1\r\n if(lines[i][j+1]==\"#\"):\r\n countHash = countHash + 1\r\n else:\r\n countDot = countDot + 1\r\n # print(countDot)\r\n # print(countHash)\r\n if(countDot>=3 or countHash >= 3):\r\n return True\r\n \r\nlines=[]\r\nn=4\r\nfor i in range(0,n):\r\n lines.append(list(map(str,input())))\r\nfound=False\r\ncountHash=0\r\ncountDot=0\r\nfor i in range(0,3):\r\n for j in range(0,3): \r\n found = square(i,j)\r\n if(found):\r\n break\r\n if(found):\r\n break\r\nif(found):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "lst = []\r\nfor i in range(4):\r\n lst.append(list(map(str, input())))\r\nflag = False\r\nfor i in range(3):\r\n for j in range(3):\r\n if [lst[i][j], lst[i+1][j], lst[i][j+1], lst[i+1][j+1]].count('#') in [0, 1, 3, 4]:\r\n flag = True\r\n\r\nprint('YNEOS'[flag == False::2])\r\n\r\n \r\n", "s = []\r\nfor i in range(4):\r\n s.append(list(input()))\r\nfor i in range(3):\r\n for j in range(3):\r\n t = [s[i][j], s[i + 1][j], s[i][j + 1], s[i + 1][j + 1]]\r\n if t.count('#') > 2 or t.count('.') > 2:\r\n print('YES')\r\n exit()\r\nprint('NO')", "\na = []\nfor _ in range(4):\n a.append([1 if c == '#' else 0 for c in input().strip()])\n\nf = False\nfor i in range(3):\n for j in range(3):\n x = [a[i][j], a[i][j + 1], a[i + 1][j], a[i + 1][j + 1]]\n if x.count(0) != 2:\n print(\"YES\")\n f = True\n break\n\n if f:\n break\n\nif not f:\n print(\"NO\")\n", "B=[]\nB.append(input())\nB.append(input())\nB.append(input())\nB.append(input())\n\n\nfor y in range(3):\n\tfor x in range(3):\n\t\tc1, c2 = 0,0\n\t\tif B[x][y] == '.': c1+=1\n\t\tif B[x+1][y] == '.': c1+=1\n\t\tif B[x][y+1] == '.': c1+=1\n\t\tif B[x+1][y+1] == '.': c1+=1\n\n\t\tif B[x][y] == '#': c2+=1\n\t\tif B[x+1][y] == '#': c2+=1\n\t\tif B[x][y+1] == '#': c2+=1\n\t\tif B[x+1][y+1] == '#': c2+=1\n\n\t\tif c1 >= 3 or c2>=3:\n\t\t\tprint(\"YES\")\n\t\t\texit(0)\n\nprint(\"NO\")\n", "matrix = []\r\nfor i in range(4):\r\n matrix.append(list(input()))\r\n\r\nflag = False\r\nfor i in range(3):\r\n for j in range(3):\r\n white_count = 0\r\n black_count = 0\r\n if matrix[i][j] == '.':\r\n white_count += 1\r\n else:\r\n black_count +=1\r\n \r\n if matrix[i][j+1]=='.':\r\n white_count += 1\r\n else:\r\n black_count +=1\r\n \r\n if matrix[i+1][j] == '.':\r\n white_count += 1\r\n else:\r\n black_count +=1\r\n\r\n if matrix[i+1][j+1] == '.':\r\n white_count += 1\r\n else:\r\n black_count +=1\r\n \r\n if (not white_count or white_count == 1) or (not black_count or black_count == 1):\r\n flag=True\r\n break\r\n \r\n if flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = [input() for i in range(4)]\nbreaker = False\nfor i in range(3):\n for j in range(3):\n lst = [s[i][j], s[i+1][j], s[i][j+1], s[i+1][j+1]]\n if max(lst.count('.'), lst.count('#')) >= 3:\n breaker = True\n break\n if breaker:\n break\nprint('YES' if breaker else 'NO')\n", "l = [list(str(input())) for i in range(4)]\r\nflag = False\r\n# print(l)\r\nfor i in range(4):\r\n if flag:\r\n break\r\n for j in range(3):\r\n#######################################################\r\n if i == 0:\r\n # print(i,j)\r\n c = 1\r\n if l[i][j] == '#':\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i+1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i+1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n else:\r\n if l[i][j] == '.':\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i+1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i+1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n###########################################################\r\n elif i == 3:\r\n # print('Da')\r\n c = 1\r\n if l[i][j] == '#':\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i-1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i-1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n else:\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i-1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i-1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n\r\n###########################################################\r\n else:\r\n c = 1\r\n if l[i][j] == '#':\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i+1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i+1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n else:\r\n c = 1\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i-1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i-1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n else:\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i+1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i+1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n else:\r\n c = 1\r\n if l[i][j] == l[i][j+1]:\r\n c+=1\r\n # print(l[i][j+1])\r\n if l[i-1][j] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j])\r\n if l[i-1][j+1] == l[i][j]:\r\n c+=1\r\n # print(l[i+1][j+1])\r\n if c == 3 or c == 4:\r\n flag = True\r\n break\r\n################################################\r\n\r\n\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "L = []\r\nfor i in range(4):\r\n L.append(input())\r\nflag = 0\r\nfor j in range(3):\r\n for i in range(3):\r\n if ((L[i][j]==L[i][j+1]==L[i+1][j]==L[i+1][j+1] ) or ( L[i][j]!=L[i+1][j] and L[i][j]!=L[i+1][j+1] and L[i][j]!=L[i][j+1] ) or (L[i][j]==L[i+1][j] and L[i][j]==L[i+1][j+1] and L[i][j]!=L[i][j+1]) or (L[i][j]==L[i+1][j] and L[i][j]!=L[i+1][j+1] and L[i][j]==L[i][j+1]) or (L[i][j]!=L[i+1][j] and L[i][j]==L[i+1][j+1] and L[i][j]==L[i][j+1])):\r\n flag =1\r\n break\r\nif flag ==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ROWS = COLS = 4\r\n\r\na = [list(input()) for _ in range(4)]\r\n\r\n\r\ndef window(arr):\r\n countHash = 0\r\n for i in range(2):\r\n for j in range(2):\r\n if arr[i][j]==\"#\":\r\n countHash+=1\r\n \r\n return countHash != 2\r\n\r\n\r\nfor r in range(ROWS-1):\r\n for c in range(COLS-1):\r\n if window([a[r][c:c+2],a[r+1][c:c+2]]):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "arr=[]\r\nfor i in range(0,4):\r\n k=input()\r\n arr.append(k)\r\nif sum([((arr[i][j]=='#')+(arr[i+1][j]=='#')+(arr[i][j+1]=='#')+(arr[i+1][j+1]=='#')!=2) for i in range(3) for j in range(3)])>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l = []\r\nfor i in range(4):\r\n s = input()\r\n l.append(s)\r\nk = 0\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n cher = []\r\n cher.append(l[i-1][j-1])\r\n cher.append(l[i-1][j])\r\n cher.append(l[i][j-1])\r\n cher.append(l[i][j])\r\n if cher.count(\"#\") == 1 or cher.count(\"#\") == 3 or cher.count(\"#\") == 0 or cher.count(\"#\") == 4:\r\n print(\"YES\")\r\n k = 3\r\n break\r\n else:\r\n k = 1\r\n j += 1\r\n if k == 3:\r\n break\r\n i += 1\r\nif k == 1:\r\n print(\"NO\")\r\n\r\n", "def iqTest():\r\n d=[['1','','','','','1']]\r\n for i in range(4):\r\n d.append(['']+list(input())+[''])\r\n d.append(['1','','','','','1'])\r\n for i in range(1,5):\r\n for j in range(1,5):\r\n if d[i+1][j] == d[i][j+1] == d[i+1][j+1] == '#' or d[i+1][j] == d[i][j+1] == d[i+1][j+1] == '.':\r\n print(\"YES\")\r\n return\r\n if d[i][j-1] == d[i+1][j] == d[i+1][j-1] == '#' or d[i][j-1] == d[i+1][j] == d[i+1][j-1] == '.':\r\n print(\"YES\")\r\n return\r\n if d[i][j-1] == d[i-1][j-1] == d[i-1][j] =='#' or d[i][j-1] == d[i-1][j-1] == d[i-1][j] =='.':\r\n print(\"YES\")\r\n return\r\n if d[i-1][j] == d[i-1][j+1] == d[i][j+1] == '#' or d[i-1][j] == d[i-1][j+1] == d[i][j+1] == '.':\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\niqTest()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "arr = []\r\nfor i in range(4):\r\n s = input()\r\n temp = [i for i in s]\r\n arr.append(temp)\r\nhash = '#'\r\ndot = '.' \r\nflag = 0 \r\nfor i in range(3):\r\n if flag :\r\n break\r\n for j in range(3):\r\n same = 0\r\n diff = 0\r\n te = arr[i][j]\r\n if arr[i+1][j] == te:\r\n same += 1\r\n else:\r\n diff += 1 \r\n if arr[i][j+1] == te:\r\n same += 1\r\n else:\r\n diff += 1\r\n if arr[i+1][j+1] == te:\r\n same += 1\r\n else:\r\n diff += 1\r\n if same >= 2 or diff == 3:\r\n flag = 1\r\n break\r\n \r\n# dflag = 0 \r\n# for i in range(3):\r\n# if dflag:\r\n# break\r\n# for j in range(3):\r\n# count = 0\r\n# if arr[i][j] == dot:\r\n# if arr[i][j+1] == dot:\r\n# count += 1\r\n# if arr[i+1][j] == dot:\r\n# count += 1\r\n# if arr[i+1][j+1] == dot:\r\n# count += 1\r\n# if count >= 2:\r\n# dflag = 1\r\n# break\r\nif flag :\r\n print('YES')\r\nelse:\r\n print('NO') \r\n", "grid=[list(input()) for i in range(4)]\r\n#print(grid)\r\nok='NO'\r\nfor i in range(3):\r\n for j in range(3):\r\n ans=grid[i][j]+grid[i+1][j]+grid[i][j+1]+grid[i+1][j+1]\r\n #print(ans)\r\n \r\n if ans.count('#')>=3 or ans.count('.')>=3:\r\n ok='YES'\r\n break\r\nprint(ok)\r\n", "s = [list(input()), list(input()), list(input()), list(input())]\r\np = False\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n lst = [s[i][j], s[i][j+1], s[i+1][j], s[i+1][j+1]]\r\n if (lst.count('#') >= 3) or (lst.count('.') >= 3):\r\n p = True\r\n break\r\n else:\r\n lst = []\r\n \r\nif p == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l = []\r\nfor i in range(4):\r\n put = input()\r\n put = put.replace(\"#\",\"1\")\r\n put = put.replace(\".\",\"0\")\r\n l.append(put)\r\ncount = 0\r\nfor i in range(3):\r\n for j in range(3):\r\n if int(l[i][j])+int(l[i][j+1])+int(l[i+1][j])+int(l[i+1][j+1]) <= 1 or int(l[i][j])+int(l[i][j+1])+int(l[i+1][j])+int(l[i+1][j+1]) >=3:\r\n count = 1\r\n \r\n print(\"YES\")\r\n break\r\n if count == 1:\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s=[]\r\nc=0\r\nl=0\r\nfor _ in range(4):\r\n s.append(input())\r\nfor i in range(3):\r\n for j in range(3):\r\n if (s[i][j]+s[i+1][j]+s[i][j+1]+s[i+1][j+1]).count(\"#\")!=2:\r\n print(\"YES\")\r\n c=1\r\n l=1\r\n break\r\n if l:\r\n break\r\nif not(c):\r\n print(\"NO\")", "l=[]\r\nfor i in range(4):\r\n l.append(input())\r\nfor i in range(3):\r\n x,y=l[i],l[i+1]\r\n for i in range(3):\r\n e=[0,0]\r\n if x[i]=='#':\r\n e[0]+=1\r\n else:\r\n e[1]+=1\r\n if x[i+1]=='#':\r\n e[0]+=1\r\n else:\r\n e[1]+=1\r\n \r\n if y[i]=='#':\r\n e[0]+=1\r\n else:\r\n e[1]+=1\r\n if y[i+1]=='#':\r\n e[0]+=1\r\n else:\r\n e[1]+=1\r\n if e[0]!=e[1]:\r\n print(\"YES\")\r\n quit()\r\n \r\n \r\nprint(\"NO\")\r\n\r\n", "l = list()\r\nfor _ in range(4): l.append(input())\r\n\r\nfor i in range(3):\r\n f = 0\r\n for j in range(3):\r\n r = [l[i][f], l[i][f+1], l[i+1][f], l[i+1][f+1]]\r\n if r.count(\"#\") != 2:\r\n print(\"YES\")\r\n exit()\r\n f += 1\r\nelse:\r\n print(\"NO\")", "ok = False\r\ngrid = []\r\nfor _ in range(4):\r\n s = input().strip()\r\n grid.append(s)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n a, b = 0, 0\r\n if grid[i][j] == '#':\r\n a += 1\r\n else:\r\n b += 1\r\n if grid[i + 1][j] == '#':\r\n a += 1\r\n else:\r\n b += 1\r\n if grid[i][j + 1] == '#':\r\n a += 1\r\n else:\r\n b += 1\r\n if grid[i + 1][j + 1] == '#':\r\n a += 1\r\n else:\r\n b += 1\r\n if a >= 3 or b >= 3:\r\n ok = True\r\n break\r\nif ok:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\na = []\r\nflag=0\r\nfor i in range(4):\r\n a.append(str(input()))\r\nfor i in range(3):\r\n for j in range(3):\r\n l = list([a[i][j],a[i][j+1],a[i+1][j],a[i+1][j+1]])\r\n #print(l)\r\n if l.count('#')>=3 or l.count('.')>=3:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def has_2x2_square(matrix):\r\n for i in range(3):\r\n for j in range(3):\r\n if matrix[i][j] == matrix[i][j + 1] == matrix[i + 1][j] == matrix[i + 1][j + 1]:\r\n return True\r\n return False\r\n\r\ndef main():\r\n grid = [list(input()) for _ in range(4)]\r\n\r\n if has_2x2_square(grid):\r\n print(\"YES\")\r\n else:\r\n for i in range(4):\r\n for j in range(4):\r\n original_color = grid[i][j]\r\n grid[i][j] = '#' if original_color == '.' else '.'\r\n\r\n if has_2x2_square(grid):\r\n print(\"YES\")\r\n return\r\n else:\r\n grid[i][j] = original_color\r\n\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon May 18 17:25:40 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/287/A --- Alexis Galvan\r\n\r\n\r\ndef iq_test():\r\n \r\n maze = []\r\n \r\n for i in range(4):\r\n maze.append(input())\r\n \r\n for i in range(len(maze)-1):\r\n for j in range(len(maze[i])-1):\r\n dic = {'#':0,'.':0}\r\n dic[maze[i][j]] += 1\r\n dic[maze[i+1][j]] += 1\r\n dic[maze[i+1][j+1]] += 1\r\n dic[maze[i][j+1]] += 1\r\n \r\n if dic['#'] >= 3:\r\n return 'YES'\r\n elif dic['.'] >= 3:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nprint(iq_test())\r\n ", "color = [input() for i in range(4)]\r\nres = 'NO'\r\nfor i in range(3):\r\n for j in range(3):\r\n sq = [color[i][j], color[i][j+1], color[i+1][j], color[i+1][j+1]]\r\n if sq.count('.') >= 3 or sq.count('#') >= 3:\r\n res = 'YES'\r\n break\r\n if res == 'YES':\r\n break\r\nprint(res)", "a = []\r\nfor i in range(4):\r\n b = list(input())\r\n a.append(b)\r\nfor i in range(3):\r\n for j in range(3):\r\n d = []\r\n d.append(a[i][j])\r\n d.append(a[i+1][j])\r\n d.append(a[i][j+1])\r\n d.append(a[i+1][j+1])\r\n g = d.count('#')\r\n if g!=2:\r\n print('YES')\r\n exit()\r\nelse:\r\n print('NO')", "def check(li):\r\n d=dict.fromkeys(li,0)\r\n for i in li:\r\n d[i]+=1\r\n if d[i]==3:return 1\r\n return 0\r\n\r\ng=[input() for i in range(4)]\r\n\r\nok=0\r\nfor i in range(3):\r\n for j in range(3):\r\n a=[]\r\n a.extend((g[i][j],g[i+1][j],g[i][j+1],g[i+1][j+1]))\r\n if check(a):\r\n print('YES');ok=1;break\r\n if ok:break\r\nelse:print('NO')", "c = []\r\nfor q in range(4):\r\n c.append(list(input()))\r\nr = []\r\nfor i in range(3):\r\n for j in range(3):\r\n s = 0\r\n if c[i][j] == c[i][j+1]:\r\n s += 1\r\n if c[i][j] == c[i+1][j]:\r\n s += 1\r\n if c[i][j] == c[i+1][j+1]:\r\n s += 1\r\n r.append(s)\r\nprint(\"NO\" if set(r) == {1} else \"YES\")\r\n", "chk = False\r\narr = [list(input()) for _ in range(4)]\r\ni = 0\r\nwhile not chk and i < 3:\r\n for j in range(3):\r\n if arr[i][j] == arr[i][j+1]:\r\n if arr[i+1][j] == arr[i][j] or arr[i+1][j+1] == arr[i][j]:\r\n chk = True\r\n break\r\n else:\r\n if arr[i+1][j] == arr[i+1][j+1]:\r\n chk = True\r\n break\r\n\r\n i += 1\r\n\r\nif chk:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = [input() for i in range(4)]\r\nfor i in range(len(x) - 1):\r\n a = x[i]\r\n b = x[i + 1]\r\n for j in range(len(a) - 1):\r\n if a[j:j + 2].count(\"#\") + b[j:j + 2].count(\"#\") != 2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "char_list = []\r\nfor i in range(4):\r\n char_list.append(input())\r\n\r\ngrid_list = []\r\nneigh_list = [0*n for n in range(12)]\r\n\r\n\r\n\r\nfor i in range(len(char_list)):\r\n for s in char_list[i]:\r\n grid_list.append(s)\r\n\r\n\r\nfor i in range(12):\r\n if i not in [3,7,11]:\r\n for j in range(i+1, len(grid_list)):\r\n if j in [i+1, i+4, i+5]:\r\n if grid_list[j]==grid_list[i]:\r\n neigh_list[i] += 1\r\n\r\ndel neigh_list[3] \r\ndel neigh_list[6] \r\ndel neigh_list[9] \r\n\r\ns = 'NO'\r\nfor n in neigh_list:\r\n if n>=2 or n ==0:\r\n s = 'YES'\r\n \r\n break\r\n\r\nprint(s)", "lst, c = [], 0\r\nfor i in range(4):\r\n lst.append(input())\r\nfor l in range(3):\r\n for i in range(3):\r\n sum_ = lst[l][i] + lst[l][i + 1] + lst[l + 1][i] + lst[l + 1][i + 1]\r\n if sum_.count(\".\") > 2 or sum_.count(\"#\") > 2:\r\n print(\"YES\");c=1;break\r\n if c == 1:break\r\nif c == 0:print(\"NO\")\r\n", "\ndef main():\n b = [input() for _ in range(4)]\n res = False\n for i in range(3):\n if res: break\n for j in range(3):\n cnt = (b[i][j], b[i+1][j], b[i][j+1], b[i+1][j+1]).count('#')\n if cnt >= 3 or cnt <= 1:\n res = True\n break\n print('YES' if res else 'NO')\n\nmain()\n", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tarr= []\r\n\tcnt = 0\r\n\tfor i in range(4):\r\n\t\tstring = str(input())\r\n\t\tarr.append(string)\r\n\tfor i in range(len(arr)-1):\r\n\t\tfor j in range(3):\r\n\t\t\tcnt = 0\r\n\t\t\tif arr[i][j]=='#':\r\n\t\t\t\tcnt+=1\r\n\t\t\tif arr[i+1][j]==\"#\":\r\n\t\t\t\tcnt+=1\r\n\t\t\tif arr[i][j+1]=='#':\r\n\t\t\t\tcnt+=1\r\n\t\t\tif arr[i+1][j+1]=='#':\r\n\t\t\t\tcnt+=1\r\n\t\t\tif cnt!=2:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\treturn\r\n\tprint(\"NO\")\r\n\treturn\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", "arr = [input(), input(), input(), input()]\nexit = False\nfor i in range(3):\n if exit:\n break\n for j in range(3):\n countw = 0\n countb = 0\n if arr[i][j] == \"#\":\n countb += 1\n else:\n countw += 1\n if arr[i+1][j] == \"#\":\n countb += 1\n else:\n countw += 1\n if arr[i][j+1] == \"#\":\n countb += 1\n else:\n countw += 1\n if arr[i+1][j+1] == \"#\":\n countb += 1\n else:\n countw += 1\n\n if countw >= 3 or countb >= 3:\n print(\"YES\")\n exit = True\n break\n\nif not exit:\n print(\"NO\")\n\n\t \t\t \t \t \t \t\t\t\t \t \t \t\t \t", "a=[]\r\nfor i in range(4):\r\n a.append(input())\r\nfor i in range(3):\r\n for j in range(3):\r\n l=[a[i][j],a[i+1][j],a[i][j+1],a[i+1][j+1]]\r\n if l.count(\"#\")!=l.count(\".\"):\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n print(\"NO\")", "matrix = []\nfor _ in range(4):\n matrix.append(input())\n\ndef check_left_top(i, j):\n colors = set()\n if i-1 >= 0 and j-1 >= 0:\n colors.add(matrix[i-1][j])\n colors.add(matrix[i][j-1])\n colors.add(matrix[i-1][j-1])\n if len(colors) == 1:\n return True\n return False\n\ndef check_right_top(i, j):\n colors = set()\n if i-1 >= 0 and j+1 < 4:\n colors.add(matrix[i-1][j])\n colors.add(matrix[i][j+1])\n colors.add(matrix[i-1][j+1])\n if len(colors) == 1:\n return True\n return False\n\ndef check_left_bottom(i, j):\n colors = set()\n if i+1 < 4 and j-1 >= 0:\n colors.add(matrix[i+1][j])\n colors.add(matrix[i][j-1])\n colors.add(matrix[i+1][j-1])\n if len(colors) == 1:\n return True\n return False\n\ndef check_right_bottom(i, j):\n colors = set()\n if i+1 < 4 and j+1 < 4:\n colors.add(matrix[i+1][j])\n colors.add(matrix[i][j+1])\n colors.add(matrix[i+1][j+1])\n if len(colors) == 1:\n return True\n return False\n\nfor i in range(4):\n for j in range(4):\n if check_left_top(i, j) or check_right_top(i, j) or check_left_bottom(i, j) or check_right_bottom(i, j):\n print('YES')\n break\n else:\n continue\n break\nelse:\n print('NO')\n", "l=[]\r\nres='NO'\r\nfor x in range(4): \r\n s=input()\r\n l.append(s)\r\nfor i in range(3):\r\n l1=[]\r\n for j in range(3) : \r\n l1.append([l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1]])\r\n if l1[0].count('#')>=3 or l1[0].count('.')>=3 :\r\n res='YES'\r\n break\r\n l1=[] \r\n if res=='YES' : \r\n break\r\n \r\nprint(res)", "matrix = []\r\nfor num in range(4):\r\n matrix.append([1 if chr=='#' else 0 for chr in input()])\r\npss =False\r\nfor i in range(3):\r\n for k in range(3):\r\n if matrix[i][k]+matrix[i][k+1]+matrix[i+1][k]+matrix[ i+1 ][k+1] !=2: \r\n pss =True\r\n break\r\n\r\nif(pss):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "sheet=[input() for _ in range(4) ]\r\ncnt=0\r\ncnt1=0\r\nfor i in range(3):\r\n for j in range(3):\r\n cnt=0\r\n cnt1=0\r\n if(sheet[i][j]=='#'):\r\n cnt+=1\r\n if(sheet[i+1][j]=='#'):\r\n cnt+=1\r\n if(sheet[i][j+1]=='#'):\r\n cnt += 1\r\n if(sheet[i+1][j+1]=='#'):\r\n cnt += 1\r\n if (sheet[i][j] == '.'):\r\n cnt1 += 1\r\n if (sheet[i + 1][j] == '.'):\r\n cnt1 += 1\r\n if (sheet[i][j + 1] == '.'):\r\n cnt1+=1\r\n if (sheet[i + 1][j + 1] == '.'):\r\n cnt1 += 1\r\n if(cnt>2 or cnt1>2):\r\n print(\"YES\")\r\n quit()\r\n\r\nprint(\"NO\")", "a=[]\r\nfor i in range(4):\r\n a.append(input())\r\ncheck=1\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n lst=[a[i][j],a[i+1][j],a[i][j+1],a[i+1][j+1]]\r\n if lst.count('#')!=2:\r\n check=0\r\n break\r\nif check==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[14]:\n\n\n# # n = int(input())\n# # line = list(map(int, input().split()))\n# # line = list(str(input()))\n# from tqdm import trange\n\n\n# In[24]:\n\n\nfrom collections import Counter\n\n\n# In[13]:\n\n\nmatrix = []\n\nfor _ in range(4):\n matrix.append(list(str(input())))\n\n\n# In[29]:\n\n\nans = \"NO\"\n\nfor i in range(3):\n for j in range(3):\n tmp_list = [matrix[i][j], matrix[i][j+1], matrix[i+1][j], matrix[i+1][j+1]]\n tmp_dict = Counter(tmp_list)\n if max(tmp_dict.values()) >= 3:\n ans = \"YES\"\n break\n\nprint(ans)\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "import sys\r\nl0 = list(input())\r\nl1 = list(input())\r\nl2 = list(input())\r\nl3 = list(input())\r\nl = [l0,l1,l2,l3]\r\ndef check(a,b,c,d):\r\n q = [a,b,c,d]\r\n q.sort()\r\n if q == ['#','#','#','#'] or q == ['#','#','#','.'] or q == ['.','.','.','.'] or q == ['#','.','.','.']:\r\n return True\r\n else:\r\n return False\r\nfor i in range(3):\r\n for j in range(3):\r\n if check(l[i][j],l[i+1][j],l[i][j+1],l[i+1][j+1]):\r\n print(\"YES\")\r\n sys.exit(0)\r\nprint(\"NO\")\r\n ", "l = []\r\nfor i in range(4):\r\n l.append(input())\r\nflag = False\r\nfor i in range(3):\r\n for j in range(3):\r\n hash = (l[i][j] == \"#\") + (l[i][j+1] == \"#\") + (l[i+1][j] == \"#\") + (l[i+1][j+1] == \"#\")\r\n dot = (l[i][j] == \".\") + (l[i][j+1] == \".\") + (l[i+1][j] == \".\") + (l[i+1][j+1] == \".\")\r\n if dot >= 3 or hash >=3:\r\n flag = True\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "g = [input(), input(), input(), input()]\r\nfor i in range(0, 3):\r\n for j in range(0, 3):\r\n s = [g[i][j], g[i][j+1], g[i+1][j], g[i+1][j+1]]\r\n if s.count(\"#\") != 2: \r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n", "def check_if_possible_to_pass_test(arr):\r\n for i in range(3):\r\n for j in range(3):\r\n square = arr[i][j] + arr[i+1][j] + arr[i][j+1] + arr[i+1][j+1]\r\n if square.count('#') in [0, 1, 3, 4]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Reading input\r\narr = []\r\nfor _ in range(4):\r\n arr.append(input())\r\n\r\nprint(check_if_possible_to_pass_test(arr))", "grid = []\r\nfor i in range(4):\r\n s = str(input())\r\n grid.append(list(s))\r\n\r\nf = False\r\nfor i in range(4):\r\n for j in range(0,3):\r\n if grid[i][j] == grid[i][j+1]:\r\n color = grid[i][j]\r\n if i != 0:\r\n if grid[i-1][j] == color or grid[i-1][j+1] == color:\r\n f = True\r\n break\r\n if i != 3:\r\n if grid[i+1][j] == color or grid[i+1][j] == color:\r\n f = True\r\n break\r\n\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(mat):\n for i in range(3):\n for j in range (3):\n dic = {'.': 0, '#': 0}\n dic[mat[i][j]] += 1\n dic[mat[i+1][j]] += 1\n dic[mat[i+1][j+1]] += 1\n dic[mat[i][j+1]] += 1\n\n if(dic['.'] >= 3 or dic['#'] >= 3):\n return 'YES'\n\n return 'NO'\n\nmat = []\nfor _ in range(4):\n mat.append(input())\n\nprint(solve(mat))\n\n\t \t \t\t\t \t\t\t \t\t\t \t\t \t\t \t \t \t \t", "s1 = input(\"\") \ns2 = input(\"\")\ns3 = input(\"\")\ns4 = input(\"\")\ns1.split()\ns2.split()\ns3.split()\ns4.split()\narray = []\narray.append(s1)\narray.append(s2)\narray.append(s3)\narray.append(s4)\n \ncond = False \nfor i in range(3):\n for j in range(3):\n count1 = 0\n count2 = 0\n if array[i][j] == \"#\":\n count1 += 1\n else:\n count2 += 1\n if array[i][j+1] == \"#\":\n count1 += 1\n else:\n count2 += 1\n if array[i+1][j] == \"#\":\n count1 += 1\n else:\n count2 += 1\n if array[i+1][j+1] == \"#\":\n count1 += 1\n else:\n count2 += 1\n if count1 >= 3 or count2 >= 3:\n cond = True\n break\n\nif cond:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "def yy(a,b,c,d):\r\n\tl=[a,b,c,d];c1,c2=0,0\r\n\tfor i in l:\r\n\t\tif i=='.':c1+=1\r\n\treturn max(c1,4-c1)\r\n\r\nl=[]\r\nfor i in range(4):\r\n\tl.append(input())\r\nfor i in range(1,4):\r\n\ta=yy(l[i-1][0],l[i-1][1],l[i][0],l[i][1])\r\n\tb=yy(l[i-1][-2],l[i-1][-1],l[i][-2],l[i][-1])\r\n\tc=yy(l[i-1][1],l[i-1][-2],l[i][1],l[i][-2])\r\n\tif max(a,b,c)>=3:print('YES');break\r\nelse:print('NO')", "\"\"\"\n https://codeforces.com/problemset/problem/287/A\n\"\"\"\nmatrix = [input() for x in range(4)]\nfor i in [1, 2, 3]:\n for j in range(0, 3):\n da_case = matrix[i][j] + matrix[i-1][j] + matrix[i-1][j+1] + matrix[i][j+1]\n hash_tags = da_case.count('#')\n dots = da_case.count('.')\n if (hash_tags > 2 or dots > 2):\n print(\"YES\")\n exit(0)\nprint(\"NO\")\n", "def main():\r\n n = 4\r\n c = []\r\n for string in range(n):\r\n c.append(list(input()))\r\n for i in range(n-1):\r\n for j in range(n-1):\r\n w = 0\r\n b = 0\r\n if c[i][j]=='.': w += 1\r\n else: b += 1\r\n\r\n if c[i+1][j]=='.': w+=1\r\n else: b += 1\r\n\r\n if c[i][j+1]=='.': w+=1\r\n else: b += 1\r\n\r\n if c[i+1][j+1]=='.': w+=1\r\n else: b += 1\r\n\r\n if w!=2 or b != 2:\r\n print(\"YES\")\r\n return 0\r\n print(\"NO\")\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n", "def calc_sum(pref, i, j):\r\n if i != 0 and j != 0:\r\n return pref[i + 1][j + 1] - pref[i+1][j-1] - pref[i-1][j+1] + pref[i-1][j-1]\r\n elif i == 0 and j == 0:\r\n return pref[i+1][j+1]\r\n elif i == 0:\r\n return pref[i+1][j+1] - pref[i+1][j-1]\r\n elif j == 0:\r\n return pref[i+1][j+1] - pref[i-1][j+1]\r\n\r\n\r\ndef check(pref):\r\n for i in range(0, 3):\r\n for j in range(0, 3):\r\n if calc_sum(pref, i, j) == 0 or calc_sum(pref, i, j) == 4:\r\n return 1\r\n return 0\r\n\r\ndef main():\r\n table = []\r\n for i in range(4):\r\n tmp = input()\r\n s = [0 if i == '.' else 1 for i in tmp]\r\n table.append(s)\r\n\r\n\r\n\r\n for y in range(4):\r\n for x in range(4):\r\n table[y][x] = 1 - table[y][x]\r\n # for i in range(4):\r\n # print(*table[i])\r\n # print('-------')\r\n pref = [[0, 0, 0, 0] for i in range(4)]\r\n pref[0][0] = table[0][0]\r\n for i in range(1, 4):\r\n pref[i][0] = pref[i - 1][0] + table[i][0]\r\n for i in range(1, 4):\r\n pref[0][i] = pref[0][i - 1] + table[0][i]\r\n\r\n for i in range(1, 4):\r\n for j in range(1, 4):\r\n pref[i][j] = pref[i - 1][j] + pref[i][j - 1] - pref[i - 1][j - 1] + table[i][j]\r\n\r\n res = check(pref)\r\n # for i in range(4):\r\n # print(*pref[i])\r\n if res:\r\n return \"YES\"\r\n table[y][x] = 1 - table[y][x]\r\n return \"NO\"\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())", "a,t=[input(),input(),input(),input()],1\r\nfor i in range(0,3):\r\n for j in range(0,3):\r\n l=a[i][j]+a[i][j+1]+a[i+1][j]+a[i+1][j+1]\r\n r=l.count(\"#\")\r\n if r!=2:\r\n t=0\r\n break\r\n if not t:\r\n break\r\nprint(\"YNEOS\"[t::2])", "def solve(grid):\r\n for i in range(3):\r\n for j in range(3):\r\n b = 0\r\n w = 0\r\n if grid[i][j] == '#':\r\n b += 1\r\n else:\r\n w += 1\r\n\r\n if grid[i+1][j] == '#':\r\n b += 1\r\n else:\r\n w += 1\r\n \r\n if grid[i][j+1] == '#':\r\n b +=1\r\n else:\r\n w += 1\r\n \r\n if grid[i+1][j+1] == '#':\r\n b +=1\r\n else:\r\n w+=1\r\n \r\n if w>=3 or b>=3:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\ngrid = []\r\nfor i in range(4):\r\n s = list(input())\r\n grid.append(s)\r\n\r\nprint(solve(grid))\r\n\r\n", "square = []\r\nfor i in range(4):\r\n col = []\r\n col = list(map(str, input()))\r\n square.append(col)\r\n\r\ndef test(x, y, list):\r\n if x+1 == 4 or y+1 ==4:\r\n return False\r\n\r\n return list[x][y] == list[x][y+1] and list[x][y] == list[x+1][y] and list[x][y] == list[x+1][y+1]\r\n\r\ndef testA():\r\n for i in range(4):\r\n for j in range(4):\r\n if test(i, j, square):\r\n return True\r\n return False\r\n\r\n\r\ncheck = testA()\r\nfor i in range(4):\r\n for j in range(4):\r\n original = square[i][j]\r\n if square[i][j] == \".\":\r\n square[i][j] = \"#\"\r\n else:\r\n square[i][j] = \".\"\r\n\r\n if testA():\r\n check = True\r\n square[i][j] = original\r\n\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def solve(a):\r\n for i in range(3):\r\n for j in range(3):\r\n s = a[i][j:j+2]+a[i+1][j:j+2]\r\n if ''.join(sorted(s)) in {'....', '####', '###.', '#...'}:\r\n return True\r\n return False\r\n\r\na = []\r\nfor _ in range(4):\r\n a.append(input())\r\nprint(\"YES\" if solve(a) else \"NO\")", "def IQTest(grid):\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\t#check the square\n\t\t\tblacks = int(grid[i][j] == '#')\n\t\t\tblacks += int(grid[i+1][j] == '#')\n\t\t\tblacks += int(grid[i][j+1] == '#')\n\t\t\tblacks += int(grid[i+1][j+1] == '#')\n\t\t\t\n\t\t\twhites = 4 - blacks\n\t\t\tif blacks >= 3 or whites >= 3:\n\t\t\t\tprint('YES')\n\t\t\t\treturn\n\tprint('NO')\n\t\ngrid = []\nfor i in range(4):\n\tgrid.append(input())\n\nIQTest(grid)\n", "a1 = str(input())\r\na2 = str(input())\r\na3 = str(input())\r\na4 = str(input())\r\na = []\r\na.append(a1)\r\na.append(a2)\r\na.append(a3)\r\na.append(a4)\r\nc = 0 \r\n\r\nfor i in range(1 ,4):\r\n for j in range(1 , 4):\r\n r = [a[i][j] , a[i-1][j] , a[i][j-1] , a[i-1][j-1]]\r\n\r\n if(r.count('#') != 2):\r\n print('YES')\r\n c += 1\r\n break\r\n if(c == 1):\r\n break \r\nif(c == 0):\r\n print('NO')", "def func(arr):\r\n for i in range(3):\r\n for j in range(3):\r\n has = dot = 0\r\n if arr[i][j]=='#':\r\n has += 1\r\n else:\r\n dot += 1\r\n if arr[i][j+1]=='#':\r\n has += 1\r\n else:\r\n dot += 1\r\n if arr[i+1][j]=='#':\r\n has += 1\r\n else:\r\n dot += 1\r\n if arr[i+1][j+1]=='#':\r\n has += 1\r\n else:\r\n dot += 1\r\n if has>=3 or dot>=3:\r\n return 'YES'\r\n return 'NO'\r\narr = []\r\nfor i in range(4):\r\n arr.append(input())\r\nprint(func(arr))", "def check_sq(sq):\n for r in range(3):\n for c in range(3):\n if sq[r][c] == sq[r+1][c] == sq[r][c+1] == sq[r+1][c+1]:\n return True\n return False\n\nsq = []\nfor _ in range(4):\n sq.append(list(input()))\n\n\nvalid = False\nfor r in range(4):\n for c in range(4):\n prev = sq[r][c]\n if prev == '#':\n sq[r][c] = '.'\n else:\n sq[r][c] = '#'\n\n if check_sq(sq):\n valid = True\n break\n\n sq[r][c] = prev\n\n if valid:\n break\n\nif valid:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def test(arr):\r\n for i in range(3):\r\n for j in range(3):\r\n if (arr[i][j] == arr[i][j + 1]) and (arr[i][j] == arr[i + 1][j]) and (arr[i][j] == arr[i + 1][j + 1]):\r\n return True\r\n else:\r\n j += 1\r\n\r\n return False\r\n\r\n\r\nstate = 'NO'\r\narr = []\r\nfor i in range(4):\r\n arr.append(list(input()))\r\nfor i in range(4):\r\n for j in range(4):\r\n char = arr[i][j]\r\n if arr[i][j] == '.':\r\n arr[i][j] = '#'\r\n else:\r\n arr[i][j] = '.'\r\n if test(arr):\r\n state = 'YES'\r\n arr[i][j] = char\r\n\r\nprint(state)\r\n", "g = []\n\n\nfor _ in range(4):\n g.append(input())\n\nans = \"NO\"\nfor r in range(3):\n for c in range(3):\n if (\n g[r][c] == g[r][c + 1] == g[r + 1][c]\n or g[r][c] == g[r + 1][c] == g[r + 1][c + 1]\n or g[r][c] == g[r][c + 1] == g[r + 1][c + 1]\n or g[r][c + 1] == g[r + 1][c] == g[r + 1][c + 1]\n ):\n ans = \"YES\"\n break\n\n if ans == \"YES\":\n break\n\nprint(ans)", "r1 = input()\r\nr2 = input()\r\nr3 = input()\r\nr4 = input()\r\n\r\nr1 = r1.replace('#', '1')\r\nr1 = r1.replace('.', '0')\r\nr2 = r2.replace('#', '1')\r\nr2 = r2.replace('.', '0')\r\nr3 = r3.replace('#', '1')\r\nr3 = r3.replace('.', '0')\r\nr4 = r4.replace('#', '1')\r\nr4 = r4.replace('.', '0')\r\n\r\nmatrix = [\r\n [int(x) for x in r1],\r\n [int(x) for x in r2],\r\n [int(x) for x in r3],\r\n [int(x) for x in r4]\r\n]\r\n\r\nfound = 0\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n a = matrix[i][j]\r\n b = matrix[i][j+1]\r\n c = matrix[i+1][j]\r\n d = matrix[i+1][j+1]\r\n\r\n summ = a + b + c + d\r\n\r\n if summ != 2:\r\n print ('YES')\r\n found += 1\r\n break\r\n \r\n if found != 0:\r\n break\r\n\r\nif found == 0:\r\n print ('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 a = list()\r\n f = False\r\n\r\n for i in range(4):\r\n a.append(input())\r\n for i in range(3):\r\n for c in range(3):\r\n r = Counter([a[i][c], a[i + 1][c], a[i][c + 1], a[i + 1][c + 1]])\r\n if r['#'] == 0 or r['.'] == 0 or r['#'] == 1 or r['.'] == 1:\r\n f = True\r\n break\r\n if f:\r\n break\r\n print(\"YES\" if f else \"NO\")", "mat=[]\r\nfor i in range(4):\r\n s=input()\r\n mat.append(s)\r\nboo=True\r\nfor i in range(1,4):\r\n b=0;w=0\r\n for j in range(1,4):\r\n if mat[i][j-1]=='.':\r\n b+=1\r\n else:\r\n w+=1\r\n if mat[i-1][j]=='#':\r\n w+=1\r\n else:\r\n b+=1\r\n if mat[i-1][j-1]=='.':\r\n b+=1\r\n else:\r\n w+=1\r\n if mat[i][j]=='.':\r\n b+=1\r\n else:\r\n w+=1\r\n if b==1 or w==1 or b==0 or w==0:\r\n boo=False\r\n b=0;w=0\r\nif boo:\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n", "paper = []\r\nyes = False\r\n\r\nfor i in range(4):\r\n paper.append(input())\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n segment = [paper[i][j], paper[i][j + 1], paper[i + 1][j], paper[i + 1][j + 1]]\r\n if segment.count('.') > 2 or segment.count('#') > 2:\r\n yes = True\r\n\r\nprint(\"YES\" if yes else \"NO\")\r\n", "\"\"\"r1 = input().split()\r\nr2 = input().split()\r\nr3 = input().split()\r\nr4 = input().split()\"\"\"\r\nflag = False\r\nn = [input(), input(), input(), input()]\r\nfor i in range(1,4):\r\n for j in range(1,4):\r\n if n[i][j] == n[i][j-1]:\r\n if n[i-1][j] == n[i][j] or n[i-1][j-1] == n[i][j]:\r\n flag = True\r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "quadro = [[], [], [], []]\n\nfor i in range(4):\n quadro[i] = list(input())\n\nfor linha in range(0, 3):\n for coluna in range(4):\n\n if (linha > 2 or coluna > 2):\n continue\n \n preto, branco = 0, 0\n\n for l in range(linha, linha+2):\n for c in range(coluna, coluna+2):\n\n if (quadro[l][c] == '#'): preto += 1\n else: branco += 1\n\n if (preto >= 3 or branco >= 3):\n print('YES')\n exit(0)\n\nprint('NO')\n\t \t \t \t \t\t \t\t \t\t", "def compare(first,second):\r\n for i in range(0,3):\r\n res=first[i]+first[i+1]+second[i]+second[i+1]\r\n if res.count('#')>=3 or res.count('.')>=3:\r\n return True\r\n else:\r\n return False\r\npaterns=[]\r\nfor i in range(4):\r\n paterns.append(input())\r\nif compare(paterns[0],paterns[1])==True or compare(paterns[1],paterns[2])==True or compare(paterns[2],paterns[3])==True:\r\n print(\"YES\")\r\nelse:\r\n print('NO') ", "x1=[]\r\nx2=[]\r\nx3=[]\r\nx4=[]\r\nx5=[]\r\nx6=[]\r\nx7=[]\r\nx8=[]\r\nx9=[]\r\n\r\nlst1=[]\r\nlst=[]\r\nfor z in range(4):\r\n x=list(map(str,input()))\r\n lst.extend(x)\r\n#print('lst=',lst) \r\nx1.append(lst[0])\r\nx1.append(lst[1])\r\nx1.append(lst[4])\r\nx1.append(lst[5])\r\n\r\nx2.append(lst[2])\r\nx2.append(lst[3])\r\nx2.append(lst[6])\r\nx2.append(lst[7])\r\n\r\nx3.append(lst[8])\r\nx3.append(lst[9])\r\nx3.append(lst[12])\r\nx3.append(lst[13])\r\n\r\nx4.append(lst[10])\r\nx4.append(lst[11])\r\nx4.append(lst[14])\r\nx4.append(lst[15])\r\n\r\nx5.append(lst[1])\r\nx5.append(lst[2])\r\nx5.append(lst[5])\r\nx5.append(lst[6])\r\n\r\nx6.append(lst[9])\r\nx6.append(lst[10])\r\nx6.append(lst[13])\r\nx6.append(lst[14])\r\n\r\nx7.append(lst[6])\r\nx7.append(lst[7])\r\nx7.append(lst[10])\r\nx7.append(lst[11])\r\n\r\nx8.append(lst[4])\r\nx8.append(lst[5])\r\nx8.append(lst[8])\r\nx8.append(lst[9])\r\n\r\nx9.append(lst[5])\r\nx9.append(lst[6])\r\nx9.append(lst[9])\r\nx9.append(lst[10])\r\n\r\nlst1.append(x1)\r\nlst1.append(x2)\r\nlst1.append(x3)\r\nlst1.append(x4)\r\nlst1.append(x5)\r\nlst1.append(x6)\r\nlst1.append(x7)\r\nlst1.append(x8)\r\nlst1.append(x9)\r\ns=0\r\nfor i in lst1:\r\n v=i.count(max(i))\r\n b=i.count(min(i))\r\n if v>=3 or b>=3:\r\n s+=1\r\n print('YES')\r\n break\r\n \r\n \r\nif s==0:\r\n print(\"NO\")", "import sys\r\n\r\ndef check_the_test(the_list):\r\n hash_count = 0\r\n point_count = 0\r\n for item in the_list:\r\n if item == '#':\r\n hash_count += 1\r\n elif item == '.':\r\n point_count += 1\r\n return hash_count > 2 or point_count > 2\r\n\r\ntest = [[None] * 4 for _ in range(4)]\r\nfor i in range(4):\r\n test[i] = list(input())\r\n\r\nmyList = []\r\n\r\nfor row in range(0, 3):\r\n for col in range(0, 3):\r\n for x in range(row, row + 2):\r\n for y in range(col, col + 2):\r\n myList.append(test[x][y])\r\n \r\n if check_the_test(myList):\r\n print(\"YES\")\r\n sys.exit()\r\n myList = []\r\n\r\nprint(\"NO\")\r\n", "def func():\r\n squares = []\r\n for _ in range(4):\r\n line = input()\r\n squares.append([line[0], line[1], line[2], line[3]])\r\n # print(squares)\r\n window = [\r\n [0, 0],\r\n [0, 0]\r\n ]\r\n for i in range(3):\r\n for j in range(3):\r\n window[0] = [squares[i][j], squares[i][j + 1]]\r\n window[1] = [squares[i + 1][j], squares[i + 1][j + 1]]\r\n # print(window)\r\n black = 0\r\n white = 0\r\n for w1 in range(2):\r\n for w2 in range(2):\r\n if window[w1][w2] == '#':\r\n black += 1\r\n else:\r\n white += 1\r\n if black >= 3 or white >= 3:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nprint(func())", "l = []\r\nfor i in range(4):\r\n l.append(input())\r\nc = 0 \r\nfor i in range(3):\r\n for j in range(3):\r\n c = 0\r\n if l[i][j] == '#' :\r\n c+=1 \r\n if l[i][j+1] == '#':\r\n c+=1\r\n if l[i+1][j+1] == '#':\r\n c+=1\r\n if l[i+1][j] == '#':\r\n c+=1\r\n if c == 3 or c == 4:\r\n print(\"YES\")\r\n exit()\r\n c = 0 \r\n if l[i][j] == '.' :\r\n c+=1 \r\n if l[i][j+1] == '.':\r\n c+=1\r\n if l[i+1][j+1] == '.':\r\n c+=1\r\n if l[i+1][j] == '.':\r\n c+=1\r\n if c == 3 or c == 4:\r\n print(\"YES\")\r\n exit() \r\nprint(\"NO\") ", "grid = []\r\ngrid.append(list(input()))\r\ngrid.append(list(input()))\r\ngrid.append(list(input()))\r\ngrid.append(list(input()))\r\n\r\ndef check(i,j):\r\n chars = []\r\n chars.append(grid[i][j])\r\n chars.append(grid[i][j + 1])\r\n chars.append(grid[i + 1][j])\r\n chars.append(grid[i + 1][j + 1])\r\n white = 0\r\n black = 0\r\n for i in chars:\r\n if(i == \"#\"):\r\n white += 1\r\n else:\r\n black += 1\r\n if(white >= 3 or black >= 3):\r\n return True\r\n return False\r\n\r\nworks = False\r\nfor i in range(3):\r\n for j in range(3):\r\n if(check(i,j)):\r\n works = True\r\nif(works):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "paper = []\r\nyes = False\r\n\r\nfor i in range(4):\r\n paper.append(input())\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n segment = [paper[i][j], paper[i][j + 1], paper[i + 1][j], paper[i + 1][j + 1]]\r\n if segment.count('.') > 2 or segment.count('#') > 2:\r\n yes = True\r\n\r\nprint(\"YES\" if yes else \"NO\")", "s=[]\r\nfor i in range(4):\r\n s.append(input())\r\nfor i in range(3):\r\n for j in range(3):\r\n t = [s[i][j],s[i][j+1],s[i+1][j],s[i+1][j+1]]\r\n if t.count('#')!=2:\r\n print('YES')\r\n exit()\r\nprint('NO')", "mtx=[]\r\n\r\nmtx.append(list(map(str,input().split())))\r\nmtx.append(list(map(str,input().split())))\r\nmtx.append(list(map(str,input().split())))\r\nmtx.append(list(map(str,input().split())))\r\nans= False\r\nfor i in range(3):\r\n \r\n for j in range(3): \r\n current=\"\"\r\n current+=mtx[i][0][j]+mtx[i][0][j+1]+mtx[i+1][0][j]+mtx[i+1][0][j+1] \r\n\r\n if current.count(\"#\")==0 or current.count(\"#\")==1 or current.count(\"#\")==3 or current.count(\"#\")==4:\r\n ans=True\r\n break\r\n if ans:\r\n break\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "a=[]\r\nh=[0,1,3,4]\r\nfor _ in range(4):\r\n l=[]\r\n s=input().rstrip()\r\n for x in s:\r\n l.append(x)\r\n a.append(l)\r\nf=0\r\nfor i in range(3):\r\n for j in range(3):\r\n t=''\r\n t+=a[i][j]\r\n t+=a[i+1][j]\r\n t+=a[i][j+1]\r\n t+=a[i+1][j+1]\r\n if t.count('#')!=2:\r\n f=1\r\n break\r\n if f==1:\r\n break\r\nif f==1:print(\"YES\")\r\nelse:print(\"NO\")", "def has(g):\r\n for i in range(3):\r\n for j in range(3):\r\n if g[i][j] == g[i + 1][j] == g[i][j + 1] == g[i + 1][j + 1]:\r\n return True\r\n\r\n return False\r\n\r\n\r\ngrid = []\r\n\r\nfor _ in range(4):\r\n grid.append(list(input()))\r\n\r\nif has(grid):\r\n print(\"YES\")\r\nelse:\r\n check = False\r\n for i in range(4):\r\n for j in range(4):\r\n if grid[i][j] == \"#\":\r\n grid[i][j] = \".\"\r\n if has(grid):\r\n check = True\r\n grid[i][j] = \"#\"\r\n else:\r\n grid[i][j] = \"#\"\r\n if has(grid):\r\n check = True\r\n grid[i][j] = \".\"\r\n \r\n if check:\r\n break\r\n\r\n if check:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "p = [input() for i in range(4)]\r\n\r\ndef check_arr(arr):\r\n for a in range(3):\r\n for b in range(3):\r\n s = 0\r\n s += int(arr[a][b] == '.') + int(arr[a][b+1] == '.') + int(arr[a+1][b] == '.') + int(arr[a+1][b+1] == '.')\r\n if s != 2:\r\n return 'YES'\r\n return 'NO'\r\nprint(check_arr(p))", "def f():\r\n a1, a2, a3, a4 = input(), input(), input(), input()\r\n li = []\r\n li.append(a1[:2] + a2[:2])\r\n li.append(a1[1:3] + a2[1:3])\r\n li.append(a1[2:] + a2[2:])\r\n li.append(a2[:2] + a3[:2])\r\n li.append(a2[1:3] + a3[1:3])\r\n li.append(a2[2:] + a3[2:])\r\n li.append(a3[:2] + a4[:2])\r\n li.append(a3[1:3] + a4[1:3])\r\n li.append(a3[2:] + a4[2:])\r\n p = 1\r\n for i in range(9):\r\n if li[i].count('#') == 2:\r\n continue\r\n else:\r\n p = 0\r\n break\r\n if p:\r\n print('NO')\r\n else:\r\n print('YES')\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nf()\r\n", "def iq_test():\n maze = []\n\n for i in range(4):\n maze.append(input())\n\n for i in range(len(maze) - 1):\n for j in range(len(maze[i]) - 1):\n dic = {'#': 0, '.': 0}\n dic[maze[i][j]] += 1\n dic[maze[i + 1][j]] += 1\n dic[maze[i + 1][j + 1]] += 1\n dic[maze[i][j + 1]] += 1\n\n if dic['#'] >= 3:\n return 'YES'\n elif dic['.'] >= 3:\n return 'YES'\n\n return 'NO'\n\n\nprint(iq_test())", "x=[input() for i in range(4)]\r\nm=0\r\nfor i in range(3):\r\n for j in range(3):\r\n if (x[i][j]+x[i][j+1]+x[i+1][j]+x[i+1][j+1]).count(\"#\")!=2:\r\n m=1\r\n break\r\n if m:\r\n break\r\nif m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\n\r\ndef solve(arr):\r\n\tfor i in range (3):\r\n\t\tfor j in range (3):\r\n\t\t\ts = arr[i][j] + arr[i][j+1] + arr[i+1][j] + arr[i+1][j+1]\r\n\t\t\tif s.count('#')!=2: return True\r\n\treturn False\r\n\r\n\r\narr = []\r\nfor k in range (4):\r\n\tarr.append(list(input()))\r\nprint('YES' if solve(arr) else 'NO')", "ls = []\r\nfor i in range(4):\r\n ls.append(input())\r\n\r\nfor i in range(1, 4):\r\n for j in range(1, 4):\r\n my_dict = {}\r\n if ls[i - 1][j - 1] not in my_dict:\r\n my_dict[ls[i - 1][j - 1]] = 1\r\n else:\r\n my_dict[ls[i - 1][j]] += 1\r\n if ls[i - 1][j] not in my_dict:\r\n my_dict[ls[i - 1][j]] = 1\r\n else:\r\n my_dict[ls[i - 1][j]] += 1\r\n if ls[i][j - 1] not in my_dict:\r\n my_dict[ls[i][j - 1]] = 1\r\n else:\r\n my_dict[ls[i][j - 1]] += 1\r\n if ls[i][j] not in my_dict:\r\n my_dict[ls[i][j]] = 1\r\n else:\r\n my_dict[ls[i][j]] += 1\r\n\r\n if max(my_dict.values()) >= 3:\r\n print('YES')\r\n exit()\r\nelse:\r\n print('NO')\r\n", "def solution():\r\n\tst=[]\r\n\tfor i in range(4):\r\n\t\ts=input()\r\n\t\tst.append(s)\r\n\tfor i in range(0,3):\r\n\t\tfor j in range(0,3):\r\n\t\t\tp=[st[i][j],st[i+1][j],st[i][j+1],st[i+1][j+1]]\r\n\t\t\tif p.count('#')==3 or p.count('.')==3 or p.count('#')==4 or p.count('.')==4:\r\n\t\t\t\tprint('YES')\r\n\t\t\t\treturn\r\n\r\n\tprint('NO')\r\n\r\n\treturn\r\n\r\n\r\n\r\n\r\n\t\t\t\r\nsolution()\r\n\r\n\t", "from itertools import product\r\nfrom math import ceil, gcd, sqrt\r\nimport string\r\nfrom decimal import Decimal\r\n\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\narray = []\r\nbr = False\r\nfor i in range(4):\r\n inp = input()\r\n array.append(inp)\r\nfor j in range(3):\r\n for i in range(3):\r\n top_first = array[j][i]\r\n top_second = array[j][i + 1]\r\n bottom_first = array[j + 1][i]\r\n bottom_second = array[j + 1][i + 1]\r\n val = [top_first, top_second, bottom_first, bottom_second]\r\n #print(val)\r\n if val.count('.') > 2 or val.count('#') > 2:\r\n print('YES')\r\n br = True\r\n break\r\n if br:\r\n break\r\nif not br:\r\n print('NO')\r\n", "import sys\r\na = [[1 if i=='#' else 0 for i in input()] for j in range(4)]\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j]+a[i+1][j]+a[i][j+1]+a[i+1][j+1]!=2:\r\n print(\"YES\")\r\n sys.exit(0)\r\nprint(\"NO\")", "import sys\r\ndef ck(a):\r\n for i in range(3):\r\n for j in range(3):\r\n if a[i][j]==a[i+1][j]==a[i][j+1]==a[i+1][j+1]:\r\n return True\r\n return False\r\n\r\na=[]\r\nfor i in range(4):\r\n a.append(list(input()))\r\nfor i in range(4):\r\n for j in range(4):\r\n if a[i][j]==\"#\":\r\n a[i][j]=\".\"\r\n if ck(a):\r\n print(\"YES\")\r\n sys.exit()\r\n a[i][j]=\"#\"\r\n else:\r\n a[i][j]=\"#\"\r\n if ck(a):\r\n print(\"YES\")\r\n sys.exit()\r\n a[i][j]=\".\"\r\nprint(\"NO\")", "def check_2x2_square(square):\r\n for i in range(3):\r\n for j in range(3):\r\n if square[i][j] == square[i][j+1] == square[i+1][j] == square[i+1][j+1]:\r\n return True\r\n return False\r\n\r\nsquare = [input() for _ in range(4)]\r\n\r\nif check_2x2_square(square):\r\n print(\"YES\")\r\nelse:\r\n for i in range(4):\r\n for j in range(4):\r\n if square[i][j] == '#':\r\n square[i] = square[i][:j] + '.' + square[i][j+1:]\r\n else:\r\n square[i] = square[i][:j] + '#' + square[i][j+1:]\r\n\r\n if check_2x2_square(square):\r\n print(\"YES\")\r\n exit()\r\n\r\n if square[i][j] == '#':\r\n square[i] = square[i][:j] + '.' + square[i][j+1:]\r\n else:\r\n square[i] = square[i][:j] + '#' + square[i][j+1:]\r\n\r\n print(\"NO\")\r\n", "l = []\r\nop = False\r\nfor i in range(4):\r\n l.append(list(input()))\r\nfor i in range(1,4):\r\n for j in range(4):\r\n try :\r\n if l[i][j] == l[i-1][j] :\r\n if l[i][j+1] == l[i][j] or l[i-1][j+1] ==l[i][j] :\r\n op = True\r\n break\r\n \r\n except :\r\n pass\r\n if op :\r\n break \r\n\r\nif not op :\r\n for i in range(4):\r\n for j in range(1,4):\r\n try :\r\n if l[i][j] == l[i-1][j] :\r\n if l[i][j] == l[i][j-1] or l[i-1][j-1] ==l[i][j] :\r\n op = True\r\n break\r\n \r\n except :\r\n pass\r\n if op :\r\n break \r\nif op :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "\r\n\r\nif __name__ == '__main__':\r\n l = [input() for i in range(4)]\r\n f = False\r\n for i in range(3):\r\n for j in range(3):\r\n count = 0\r\n if l[i][j] == '#':\r\n count += 1\r\n if l[i][j+1] == '#':\r\n count += 1\r\n if l[i+1][j] == '#':\r\n count += 1\r\n if l[i+1][j+1] == '#':\r\n count += 1\r\n if count == 0 or count == 1 or count == 3 or count == 4:\r\n f = True\r\n break\r\n if f:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "import sys\n\nm = []\nfor line in sys.stdin:\n m.append([c for c in line.strip()])\n\nfor i in range(len(m) - 1):\n for j in range(len(m) - 1):\n l = [m[i][j], m[i + 1][j], m[i + 1][j+ 1], m[i][j+ 1]]\n a = l.count('#')\n b = l.count('.')\n if a >= 3 or b >= 3:\n print('YES')\n exit()\nprint('NO')\n\n \t\t \t \t\t \t\t \t \t \t \t \t\t\t", "def main():\r\n grid = []\r\n for i in range(0, 4):\r\n grid.append([i for i in input()])\r\n\r\n for i in range(0, 3):\r\n for j in range(0, 3):\r\n if test(i, j, grid):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\ndef test(i, j, grid):\r\n ht = 0\r\n dot = 0\r\n checks = [[0, 0], [0, 1], [1, 0], [1, 1]]\r\n for check in checks:\r\n if grid[i+check[0]][j+check[1]] == \"#\":\r\n ht += 1\r\n else:\r\n dot += 1\r\n return ht >= 3 or dot >= 3\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = list(input())\r\nb = list(input())\r\nc = list(input())\r\nd = list(input())\r\na = [a,b,c,d]\r\n\r\n# checking for black/white squares\r\nf = 0\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i][j] == a[i+1][j] == a[i][j+1] == a[i+1][j+1]:\r\n print('YES')\r\n f = 1\r\n break\r\n if f == 1:\r\n break\r\nelse:\r\n # checking for black/white 'corners'\r\n for i in range(3):\r\n for j in range(3):\r\n if a[i][j] == a[i+1][j] == a[i][j+1]:\r\n print('YES')\r\n f = 1\r\n break\r\n elif a[i][j] == a[i+1][j] == a[i+1][j+1]:\r\n print('YES')\r\n f = 1\r\n break\r\n elif a[i][j] == a[i][j+1] == a[i+1][j+1]:\r\n print('YES')\r\n f = 1\r\n break\r\n elif a[i+1][j+1] == a[i+1][j] == a[i][j+1]:\r\n print('YES')\r\n f = 1\r\n break\r\n if f == 1:\r\n break\r\n else:\r\n print('NO')\r\n", "#\r\n# Author: eloyhz\r\n# Date: Sep/04/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n a = []\r\n for _ in range(4):\r\n a.append(input())\r\n ok = False\r\n for i in range(3):\r\n for j in range(3):\r\n b = 0\r\n w = 0\r\n for k in range(2):\r\n for l in range(2):\r\n if a[i + k][j + l] == '.':\r\n w += 1\r\n else:\r\n b += 1\r\n if b == 4 or w == 4 or b == 1 or w == 1:\r\n ok = True\r\n break\r\n if ok:\r\n break\r\n print('YES' if ok else 'NO')\r\n", "arr = []\r\nfor i in range(4):\r\n line = input()\r\n arr.append(line)\r\n \r\nthereis = False\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n count = int(arr[i][j]=='.')+int(arr[i+1][j]=='.')+int(arr[i][j+1]=='.')+int(arr[i+1][j+1]=='.')\r\n if count!=2:\r\n thereis = True\r\n break\r\n \r\nif thereis:\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\narr=[]\r\nfor _ in range(4):\r\n a=input()\r\n arr.append(list(a))\r\nc=0\r\nv=0\r\nfor i in range(3):\r\n for j in range(3):\r\n c=0\r\n v=0\r\n if (arr[i][j]==\"#\"):\r\n c+=1\r\n if (arr[i+1][j]==\"#\"):\r\n c+=1\r\n if (arr[i][j+1]==\"#\"):\r\n c+=1\r\n if (arr[i+1][j+1]==\"#\"):\r\n c+=1\r\n if (arr[i][j]==\".\"):\r\n v+=1\r\n if (arr[i+1][j]==\".\"):\r\n v+=1\r\n if (arr[i][j+1]==\".\"):\r\n v+=1\r\n if (arr[i+1][j+1]==\".\"):\r\n v+=1\r\n if (c >2 ) or (v>2):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n \r\n", "data=[]\r\nfor _ in range(4):\r\n data.append(list(input()))\r\nans=0\r\nfor i in range(3):\r\n for j in range(3):\r\n s=data[i][j]+data[i][j+1]+data[i+1][j]+data[i+1][j+1]\r\n\r\n if s.count(\".\")>2 or s.count(\"#\")>2:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\") \r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\na = []\r\nfor _ in range(4):\r\n a.append(input())\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n r = 0\r\n if a[i][j] == a[i][j+1]: r+=1\r\n if a[i][j] == a[i+1][j+1]: r+=1\r\n if a[i][j] == a[i+1][j]: r+=1\r\n if(r>1 or r == 0):\r\n print(\"YES\") \r\n exit()\r\nprint(\"NO\")", "#from sys import stdin,stdout\r\n#input = stdin.readline\r\n \r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n #n = int(input())\r\n #n,k = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n tab = [input() for i in range(4)]\r\n ar2 = [[(tab[i][j]+tab[i+1][j]+tab[i][j+1]+tab[i+1][j+1]).count(\"#\") for j in range(3)] for i in range(3)]\r\n ar = ar2[0] + ar2[1] + ar2[2]\r\n if max(ar) == 2 and min(ar) == 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nmain()\r\n", "mat = []\nfor k in range(4):\n\tm = input()\n\tmat.append(m)\nfor i in range(3):\n\tfor j in range(3):\n\t\tnum = 0\n\t\thum = 0\n\t\tif mat[i][j] == \"#\":\n\t\t\tnum = num+1\n\t\telse:\n\t\t\thum+=1\n\t\tif mat[i+1][j] == '#':\n\t\t\tnum = num+1\n\t\telse:\n\t\t\thum+=1\n\t\tif mat[i][j+1] ==\"#\":\n\t\t\tnum = num+1\n\t\telse:\n\t\t\thum+=1\n\t\tif mat[i+1][j+1] == \"#\":\n\t\t\tnum = num+1\n\t\telse:\n\t\t\thum+=1\n\t\tif num>2 or hum>2:\n\t\t\tbreak\n\tif num>2 or hum>2:\n\t\tprint(\"YES\")\n\t\tbreak\nif num <3 and hum<3:\n\tprint(\"NO\")\n", "grid = []\ndef score(a):\n if a =='#':\n return 1\n return -1\nfor i in range(4):\n grid.append(input())\nres = 'NO'\nfor i in range(3):\n for j in range(3):\n s = score(grid[i][j]) + score(grid[i+1][j]) + score(grid[i][j+1]) + score(grid[i+1][j+1])\n if s in [2,-2,4,-4]:\n res = 'YES'\n \n\nprint(res)\n", "l=[];k=0\nfor i in range(4):\n s=input()\n l1=[]\n for j in s:\n l1.append(j)\n l.append(l1)\ndel l1\nfor i in range(3):\n for j in range(3):\n b=0;w=0\n if l[i][j]==\".\": w+=1\n else: b+=1\n if l[i][j+1]==\".\": w+=1\n else: b+=1\n if l[i+1][j]==\".\": w+=1\n else: b+=1\n if l[i+1][j+1]==\".\": w+=1\n else: b+=1\n if b>2 or w>2:\n k=1\n break\nif k==0:\n print(\"NO\")\nelse:\n print(\"YES\")", "from sys import stdin\n\ndef read_instance():\n lines = []\n for line in stdin.readlines():\n lines.append(line)\n return lines\n \ndef can_solve(matrix):\n for start_line in range(3):\n for start_col in range(3):\n solves = solvable([string[start_col:start_col+2] for string in matrix[start_line:start_line+2]])\n if solves:\n return True\n return False\n\n\ndef solvable(matrix):\n count = {'.': 0, '#': 0}\n for line in matrix:\n for char in line:\n if char == '.':\n count['.'] = count['.'] + 1\n elif char == '#':\n count['#'] = count['#'] + 1\n if count['.'] >= 3 or count['#'] >= 3:\n return True\n return False\n\n\n\nmy_matrix = read_instance()\nis_solvable = can_solve(my_matrix)\nif is_solvable:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t\t\t\t \t \t \t \t \t \t \t\t", "a = []\r\ndone = False\r\n\r\nfor i in range(4):\r\n a.append(input())\r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n now = [a[i][j], a[i][j+1], a[i+1][j], a[i+1][j+1]]\r\n if now.count('#')>=3 or now.count('.')>=3:\r\n print('YES')\r\n done=True\r\n break\r\n if done == True:\r\n break\r\nelse:\r\n print('NO')\r\n \r\n\r\n" ]

[ "import sys\nimport math\n\ndef function():\n n, m = map(int, input().split())\n ans = 0 \n for a in range(1001):\n for b in range(1001):\n if (a**2) + b == n and a + (b**2) == m:\n ans+=1\n print(ans)\n return\n\n\nif __name__ == '__main__':\n function()\n", "n,m=map(int,input().split())\r\nc=0\r\nfor a in range(300):\r\n for b in range(300):\r\n if a**2+b==n and a+b**2==m:\r\n c+=1\r\nprint(c)\r\n", "from math import sqrt\r\nn_1,m_1 = input().split(' ')\r\nn = int(n_1)\r\nm = int(m_1)\r\nsn = int(sqrt(n))\r\nsm = int(sqrt(m))\r\ncount = 0\r\nfor a in range(min(m , sn)+1):\r\n for b in range(min(sm , n)+1):\r\n if n == (a*a) +b and m == (b*b) +a:\r\n count+=1\r\nprint(count)", "a = [int(x) for x in input().split()]\r\nf = 0\r\nfor i in range(min(a)+1):\r\n for c in range(min(a)+1):\r\n if ((i ** 2) + c == a[0]) and ((i + (c ** 2)) == a[1]):\r\n f += 1\r\nprint(f)", "\r\n\r\ndef microsoft():\r\n n,m = [int(x) for x in input().split()]\r\n count = 0\r\n for i in range(min(n,m)+1):\r\n for j in range(min(n,m)+1):\r\n if (i**2)+j == n and (j**2)+i == m:\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\nmicrosoft()\r\n", "m= input()\r\nn= m.split(\" \")\r\nk = list(map(int,n))\r\ndem=0\r\nfor a in range(100):\r\n for b in range(100):\r\n if a**2 + b == k[0] and b**2 + a ==k[1]:\r\n dem+=1\r\nprint(dem)", "n,m = map(int,input().split())\r\nc = 0\r\nfor i in range(n+1):\r\n c += (i**2 + (n-i)**0.5) ==m\r\nprint(c)\r\n", "a,b=map(int,input().split())\r\ncount =0\r\nfor i in range(0,a+1):\r\n for j in range(0,b+1):\r\n if(i**2 + j == a and i+(j**2)==b):\r\n count+=1\r\nprint(count)", "n, m = map(int, input().split(' '))\r\nc = 0;mx = max(n, m) + 1\r\n\r\nfor a in range(mx):\r\n for b in range(mx):\r\n if a * a + b == n and a + b * b == m:c += 1\r\n\r\nprint(c)\r\n", "a,b = map(int,input().split())\r\nctr = 0\r\nif a == 1 and b == 1:\r\n ctr+=2 \r\nfor i in range(a):\r\n for j in range(b):\r\n if i**2 + j == a and i + j**2 == b:\r\n ctr+=1 \r\n\r\nprint(ctr)", "n,m=map(int,input().split())\nans=0\nrhs=n-m**2\nfor i in range(10005):\n lhs=i**4-m*2*i**2+i\n if lhs==rhs and m-i**2>=0:\n ans+=1\nprint(ans)\n\t \t \t \t\t \t \t \t \t \t \t\t \t\t\t", "import math\r\nn,m=map(int,input().split())\r\ncnt=0\r\na=int(math.sqrt(n))+2\r\n\r\nb=int(math.sqrt(m))+2\r\nfor i in range(a):\r\n for j in range(b):\r\n if i**2+j==n and j**2+i==m:\r\n cnt+=1\r\nprint(cnt)\r\n", "\r\nm,n=[int(x) for x in input().split()]\r\ncnt=0\r\nfor i in range(0,m+1):\r\n if m==i**2+(n-i)**0.5:\r\n cnt+=1\r\nprint(cnt) ", "n,m=map(int,input().split())\r\nx=0\r\nfor a in range(50):\r\n for b in range(50):\r\n if a**2+b==n and a+b**2==m:\r\n x+=1\r\nprint(x)", "from math import sqrt\r\n\r\nn, m = map(int, input().split())\r\nm1 = max(m, n)\r\nc1 = int(sqrt(m1))\r\nd1 = m1 - c1 ** 2\r\nif d1 ** 2 + c1 == min(m, n):\r\n c = 1\r\n while True:\r\n c1 -= 1\r\n d1 = m1 - c1 ** 2\r\n if d1 ** 2 + c1 == min(m, n):\r\n c += 1\r\n else:\r\n break\r\n print(c)\r\nelse:\r\n print(0)\r\n", "number, ms = map(int, input().split())\r\n\r\nc = 0\r\nfor i in range(number+1):\r\n for j in range(ms+1):\r\n if i**2 + j == number and i + j**2 == ms:\r\n c += 1\r\n\r\nprint(c)\r\n", "import math\r\nn, m = map(int, input().split())\r\na = b = c = 0\r\nfor i in range(n+1):\r\n if math.sqrt(i).is_integer() == True:\r\n a = math.sqrt(i)\r\n b = n - a**2\r\n if a + b**2 == m:\r\n c+=1\r\nprint(c)", "n,m=(map(int,input().split()))\r\ncnt=0\r\nfor i in range(1001):\r\n for j in range(1001):\r\n if (i**2 + j)==n and (i + j**2)==m :\r\n cnt+=1\r\n \r\nprint(cnt)", "n,m=[int(i) for i in input().split()]\r\ncount = 0\r\nfor a in range(n+1):\r\n b = n -a**2\r\n if a + b**2 == m and n -a**2>=0:\r\n count +=1\r\n \r\nprint(count)", "a,b=map(int,input().split());p=0\r\nfor i in range(a+1):\r\n for j in range(b+1):\r\n if (i**2+j)==a and (i+j**2)==b:\r\n p+=1\r\n if (i**2+j)>a and (i+j**2)>b:\r\n break\r\nprint(p)\r\n", "v1,v2=input().split()\r\nv1=int(v1)\r\nv2=int(v2)\r\nc=0\r\nm=max(v1,v2)+1\r\nfor i in range(m):\r\n for j in range(m):\r\n if (i*i+j==v1 and i+j*j == v2):\r\n c=c+1\r\n \r\nprint(c)\r\n\r\n", "n, m = map(int, input().split())\r\nsolTupleCount = 0\r\n\r\na = 0\r\nwhile a * a <= n and a <= m:\r\n \r\n if a + (n - a*a) * (n - a*a) == m :\r\n solTupleCount += 1\r\n a += 1 \r\n\r\nprint(solTupleCount)\r\n", "n,m = map(int,input().split())\r\nx = min(n,m)\r\nli = []\r\nfor i in range(x+1):\r\n x1= pow(i,2)\r\n for j in range(x+1):\r\n y1 = pow(j,2)\r\n if(x1+j ==n and i+y1==m):\r\n li.append((i,j))\r\nprint(len(li))", "import math\r\nn,m=map(int,input().split())\r\nc=0\r\nfor i in range (math.floor(math.sqrt(n))+1):\r\n a=i\r\n b=n-i*i\r\n if (a==(m-b*b)):\r\n c=c+1\r\nprint(c)\r\n", "a = input().split()\nx = int(a[0])\ny = int(a[1])\nans = 0\nfor i in range(1000):\n for j in range(1000):\n if i*i+j==x and i+j*j==y:\n ans+=1\nprint(ans)\n", "\r\n\r\ncount = 0\r\nm, n = map(int, input().split())\r\n\r\ndef cal(m , n):\r\n\r\n count = 0\r\n\r\n if m > n:\r\n small = n\r\n else:\r\n small = m\r\n \r\n for a in range(0,small+1):\r\n for b in range(0,small+1):\r\n if a**2 + b == n and b**2 + a == m:\r\n count += 1\r\n \r\n print(count)\r\n\r\ncal(m,n)\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\ncount = 0\r\nfor i in range(n+1) :\r\n for j in range(m+1) :\r\n if (i**2+j == n) and (i+j**2 == m) :\r\n count += 1\r\nprint(count)", "n,m=map(int,input().split())\r\nc=n**2-m\r\nde=1\r\nb=0\r\ncount=0\r\nwhile de<=c:\r\n if c / de == c // de:\r\n if de**4-2*n*de**2+de+c==0:\r\n b = n - de ** 2\r\n if de>=0 and b>=0:\r\n count = count + 1\r\n de = de + 1\r\n\r\nif c==0:\r\n print(2)\r\nelse:\r\n print(count)", "n,m = map(int,input().split())\r\na = 0\r\nb = 0\r\nans = 0\r\nwhile((a*a)<=n and a<=m):\r\n b = n-(a*a)\r\n if (a+(b*b)==m):\r\n ans+=1\r\n a+=1\r\nprint(ans)", "\nn, m = list(map(int, input().split(\" \")))\n\nresult = 0 \n\na = 0\nwhile a ** 2 <= n and a <= m:\n b = n - a ** 2\n if a + b ** 2 == m:\n result += 1\n \n a += 1\n\nprint(result)\n", "n, m = map(int, input().split())\r\nres = []\r\nfor a in range(50):\r\n for b in range(50):\r\n if a*a + b == n and a + b*b == m:\r\n res.append((a, b))\r\nprint(len(res))\r\n", "n,m=map(int,input().split())\r\nc,i=0,0\r\nwhile i*i<=n:\r\n\tif m-i==(n-(i*i))**2:\r\n\t\tc+=1\r\n\ti+=1\r\nprint(c)\r\n", "n, m = map(int, input().split())\r\nres = 0\r\n\r\nfor i in range(n+1):\r\n for j in range(0, m+1):\r\n if (i*i + j == n) and (i + j*j == m):\r\n res += 1\r\n\r\nprint(res)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\ncount = 0\r\nfor i in range(0,n+1):\r\n a = (n-(i))**0.5\r\n if a + (i)**2 == m:\r\n count += 1\r\nprint(count)", "# 214A - System of Equations\r\n[m, n], a = sorted(list(map(int, input().split()))), 0\r\nfor i in range(int(m**(1./2))+1):\r\n if n == i+(m-i**2)**2:\r\n a += 1\r\nprint(a)\r\n", "n, m = map(int, input().split())\r\ncnt = 0\r\n\r\nfor a in range(100):\r\n for b in range(100):\r\n if a**2 + b == n and b**2 + a == m:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "inp_line = input().split()\r\nn, m = int(inp_line[0]), int(inp_line[1])\r\nans, a = 0, 0\r\nwhile a*a <= n:\r\n b = n-(a*a)\r\n if a+(b*b) == m:\r\n ans += 1\r\n a += 1\r\nprint(ans)\r\n", "from itertools import product\r\n\r\nn, m = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor a, b in product(range(0, 1000), range(0, 1000)):\r\n if (a**2+b==n) and (a+b**2==m):\r\n count+=1\r\nprint(count)", "n, m = [int(i) for i in input().split()]\r\n\r\na, b = 0, 0\r\nc = 0\r\nwhile a * a <= n:\r\n if m - (n - a * a) * (n - a * a) == a:\r\n c += 1\r\n a += 1\r\nprint(c)", "m,n=map(int,input().split())\r\na=0\r\nc=0\r\nwhile a*a<=m and a<=n:\r\n b=m-a*a\r\n if a+(b*b)==n:\r\n c+=1\r\n a+=1\r\nprint(c)", "\"\"\"\r\nNghiện code love Chu Gia Linh <3\r\n\"\"\"\r\n\r\ndef f(a, b, n, m):\r\n if a**2 + b == n and a + b**2 == m:\r\n return True\r\n return False\r\n\r\nn, m = map(int, input().split())\r\nc = 0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if f(a, b, n, m):\r\n c += 1\r\n\r\nprint(c)\r\n\r\n\"\"\"\r\n ________\r\n / \\\r\n / / \\ \\\r\n ________/ / \\ \\________\r\n / \\ / \\ \r\n / / \\ \\ ______ / / \\ \\\r\n / / \\ \\________/ / \\ \\ \r\n \\ / \\ /\r\n \\ ______ / / \\ \\ ______ /\t\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\nn,*m=input().split()\r\nn=int(n)\r\nm=int(*m)\r\nsolCount=0\r\na=0\r\nwhile a<=m and a*a <=n:\r\n b=n-a**2\r\n if a+b**2==m:\r\n solCount+=1\r\n a+=1\r\nprint(solCount) ", "n,m=map(int,input().split())\r\nsum=0\r\ns=max(n,m)\r\nfor i in range(0,s+1,1):\r\n for j in range(0,s+1,1):\r\n if i*i+j==n and j*j+i==m:\r\n sum+=1\r\nprint(sum)", "#!/usr/bin/env python\r\n\r\nimport math, sys, itertools\r\n\r\nif __name__ == '__main__':\r\n\twtf = sys.stdin.read()\r\n\twtf = wtf.strip().split('\\n')\r\n\tn, m = map(int, wtf[0].split())\r\n\tans = 0\r\n\tfor b in range(int(math.sqrt(m)) + 1):\r\n\t\ta = m - b**2\r\n\t\tif a**2 + b == n:\r\n\t\t\tans += 1\r\n\tprint(ans)", "import math\r\nn,m = [int(x) for x in input().split()]\r\ncount = 0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if (a*a+b == n) & (a+b*b==m):\r\n count+=1\r\nprint(count)", "from collections import defaultdict\r\nimport random\r\n\r\nn, m = map(int, input().split())\r\nan = 0\r\nfor a in range(n + 6):\r\n b = n - a * a\r\n if b >= 0 and a + b * b == m:\r\n an += 1\r\nprint(an)\r\n", "n, m = map(int, input().split())\r\ncount = 0\r\n\r\nfor a in range(0, int(n ** 0.5 + 1)):\r\n for b in range(0, int(m ** 0.5 + 1)):\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\ns=0\r\nfor a in range (n+1):\r\n for b in range(m+1):\r\n if (a*a+b==n and a+b*b==m):\r\n s=s+1\r\nprint(s)", "n, m= map(int,input().split())\r\nj = 0\r\na = 0\r\nwhile n >= a ** 2:\r\n b = n - a ** 2\r\n if b >= 0 and m == a + b ** 2:\r\n j += 1\r\n a += 1\r\nprint(j)", "s,p=map(int,input().split())\r\nprint(sum(a*a+b-s==a+b*b-p==0 for a in range(32) for b in range(32)))", "n, m = map(int, input().split())\r\nif n == 1 and m == 1:\r\n print(2)\r\nelse:\r\n count = 0\r\n for i in range(0, max(n, m)):\r\n for j in range(0, max(n, m)):\r\n if (i ** 2) + j == n and i + (j ** 2) == m:\r\n count += 1\r\n print(count)", "import math\r\ndef solution(lim,n,m):\r\n res=0\r\n for a in range(lim+1):\r\n for b in range(lim+1):\r\n aux1=(a**2)+b\r\n aux2=a+(b**2)\r\n if aux1==n and aux2==m:\r\n res+=1\r\n return res\r\n \r\ndef main():\r\n n,m=input().split()\r\n n=int(n)\r\n m=int(m)\r\n if n>=m:\r\n lim=int(math.sqrt(n))\r\n else:\r\n lim=int(math.sqrt(m))\r\n arr=[]\r\n res=solution(lim,n,m)\r\n print(res)\r\nmain()", "n, m = map(int, input().split())\r\na = 0\r\nb = 0\r\ns1 = 0\r\nc= 0\r\nwhile s1 <= n:\r\n s1 = a**2 + b \r\n if s1 == n:\r\n if (a + b**2) == m:\r\n c += 1\r\n a += 1\r\n else:\r\n b+=1\r\n elif s1 < n:\r\n a += 1\r\n else:\r\n b += 1\r\n a = 0\r\n s1 = a**2 + b\r\nprint(c)", "n, m = [int(i) for i in input().split()]\r\ncount, a, b = 0, 0, 0\r\nwhile True:\r\n b = 0\r\n while True:\r\n if (a**2 + b == n) and (a + b**2 == m):\r\n count += 1\r\n elif (a**2 + b > n) or (a + b**2 > m):\r\n break\r\n b += 1\r\n if a**2 > n:\r\n break\r\n a += 1\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\ni = 0\r\nc1 = []\r\nsol = 0\r\nwhile i**2 <= n:\r\n c1.append((i,n-(i**2)))\r\n i+=1\r\nfor j in c1:\r\n if j[0] + (j[1]**2) == m:\r\n sol += 1\r\nprint(sol)\r\n", "n, m = map(int, input().split())\r\na = 0\r\nb = 0\r\ncounter = 0\r\nwhile a**2 <= n:\r\n while b**2 <= m:\r\n if a**2 + b == n:\r\n if a + b**2 == m:\r\n counter += 1\r\n b += 1\r\n a += 1\r\n b = 0\r\nprint(counter)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ns=0\r\nfor a in range(min(n,m)+1):\r\n for b in range(min(n,m)+1):\r\n if a**2+b==n and a+b**2==m:\r\n s+=1\r\nprint(s)\r\n", "m, n = map(int,list(input().split()))\n\ncount = 0\nb = 0\nwhile b <= n and b**2 <= m:\n a = m - b**2\n if a**2 + b == n:\n count += 1\n b += 1\nprint(count)", "s =input().split(' ')\r\nm = int(s[1])\r\nn = int(s[0])\r\ncount = 0\r\nflag = 1\r\nfor i in range(n+1):\r\n\tfor j in range(n+1):\r\n\t\tif ((i**2)+j==n) and (i+(j**2)==m):\r\n\t\t\tcount+=1\r\nprint(count)", "n, m = map(int, input().split())\r\ncount = 0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n if (((i**2) + j == n) and ((j**2) + i == m)):\r\n count += 1\r\nprint(count)", "n, m = map(int, input().split())\nmaxi = max(n, m) + 1\n\ncount = 0\n\nfor a in range(maxi):\n for b in range(maxi):\n if ((a * a) + b) == n and ((b * b) + a) == m:\n count += 1\n\nprint(count)\n", "answer = list(map(int, input().split()))\nn, m, count = answer[0], answer[1], 0\n\nfor a in range(1000):\n for b in range(1000):\n if a*a + b == n and a + b*b == m:\n count +=1\nprint(count)", "n,m=map(int,list(input().split()))\r\ncount=0\r\n# while (a**2)<=n:\r\n# b=n-(a**2)\r\n# if b>=0 and a+b**2==m:\r\n# count=count+1\r\n# a=a+1\r\n# print(count)\r\nfor i in range(max(n,m)+1):\r\n if (i**2)<=n:\r\n b=n-(i**2)\r\n if b>=0 and i+b**2==m:\r\n count=count+1\r\nprint(count)", "\n\n\nn,m = input().split()\ncount = 0\nfor i in range(33):\n for j in range(33):\n if i**2 + j == int(n) and j**2 + i == int(m):\n count += 1\n\nprint(count)\n\n\n\n\n\n\n\n\n\n \n\n", "n, m = map(int, input().split())\n\ncount = 0\n\na = b = 0\n\nwhile a*a <= n and a <= m: \n b = n - a * a\n if a+b*b == m: \n count += 1\n a+= 1\n\n\nprint(count)\n", "cnt=0\nN,M=map(int,input().split())\nfor i in range(33):\n for j in range(33):\n if(i*i+j==N and i+j*j==M):\n cnt=cnt+1\nprint(cnt)", "n, m = map(int, input().split())\r\ncnt = 0\r\nfor i in range(m+1):\r\n j = n - i*i\r\n if i*i > n: break\r\n if i + j*j == m: cnt += 1\r\nprint(cnt)", "# 코드포스 214A System of Equations\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn, m = map(int, put().split())\r\nanswer = 0\r\n\r\nfor a in range(m+1):\r\n b = n - a ** 2\r\n if b >= 0 and a + b ** 2 == m:\r\n answer += 1\r\n\r\nprint(answer)", "n,m = map(int,input().split())\r\na = 0\r\ncnt = 0\r\nwhile a**2 <= n:\r\n b = n - a ** 2\r\n if(a ** 2 + b) == n and (a + b ** 2) == m:\r\n cnt += 1\r\n a += 1\r\nprint(cnt)", "n,m = map(int,input().split())\r\ns = 0\r\nflag = False\r\nfor i in range(max(n,m)+1):\r\n for j in range(max(n,m)+1):\r\n if i**2 + j > n or j**2 + i > m:break\r\n else:\r\n if i**2 + j == n and j**2 + i == m:\r\n s+=1\r\nprint(s)", "n, m = [int(p) for p in input().split()]\r\nc = 0\r\nfor i in range (0, 1001):\r\n for j in range (0, 1001):\r\n if ((i * i) + j) == n and (i + (j*j)) == m:\r\n c += 1\r\nprint(c)", "n,m = map(int,input().split())\r\nc = 0\r\nfor a in range(int(n**0.5)+1):\r\n for b in range(int(m**0.5)+1):\r\n if (a*a + b == n and a + b*b == m):\r\n c += 1\r\nprint(c)\r\n", "n,m=map(int,input().split())\r\nb=0\r\ni=0\r\nwhile (b<=n):\r\n if ((m-b**2)**2+b==n)and ((m-b**2)>=0):\r\n i+=1\r\n b+=1\r\nprint(i)", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n if ((i*i)+j)==n and (i+(j*j))==m:\r\n count+=1\r\nprint(count)\r\n", "n,m = map(int,input().split())\nc = 0\nfor a in range(1001):\n for b in range(1001):\n if a*a +b == n and b*b+a ==m:\n c+=1\nprint(c)\n", "n,m = map(int,input().split())\r\nans = 0\r\na = 0\r\nwhile a*a <=n and a<=m:\r\n b = n - a*a\r\n if (a+b*b==m):\r\n ans += 1\r\n a += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\nans=0\r\nrhs=n-m**2\r\nfor i in range(10005):\r\n lhs=i**4-m*2*i**2+i\r\n if lhs==rhs and m-i**2>=0:\r\n ans+=1\r\nprint(ans)", "raw = input()\na = raw.split(' ')\nn = int(a[0])\nm = int(a[1])\ncount = 0\nfor a in range(0, 1001):\n for b in range(0, 1001):\n if (((a*a) + b) == n) and ((a + (b*b)) == m):\n count+=1\n #print(f\"({a},{b})\")\nprint(count)\n ", "n,m = (map(int,input().split()))\r\ncount = 0\r\nfor a in range(int(n**0.5)+1) :\r\n b = n-a*a\r\n if a+b*b==m :\r\n count+=1\r\nprint(count)\r\n ", "import math\r\na=input().split()\r\nb=int(a[0])\r\nc=int(a[1])\r\nk=math.floor(b**0.5)\r\nl=math.floor(c**0.5)\r\nco=0\r\nfor i in range(k+1):\r\n for j in range(l+1):\r\n if i**2+j==b and i+j**2==c:\r\n co+=1\r\nprint(co)\r\n \r\n", "n,m = map(int,input().split())\r\nc=0\r\nif n<m:\r\n for i in range(int(n**(1/2))+1):\r\n b=n-i*i\r\n if i+b*b == m:\r\n c+=1\r\nelse:\r\n for i in range(int(m**(1/2))+1):\r\n a=m-i*i\r\n if i+a*a == n:\r\n c+=1\r\nprint(c)", "s=input().split()\nn,m=int(s[0]),int(s[1])\nfirst=set()\nsecond=set()\nfor i in range(n+1):\n\t\tfor j in range(n+1):\n\t\t\tif i*i+j==n:\n\t\t\t\tfirst.add((i,j))\nfor a in range(m+1):\n\t\tfor b in range(m+1):\n\t\t\tif a+b**2==m:\n\t\t\t\tsecond.add((a,b))\n\nfirst=list(first)\nsecond=list(second)\nc=0\nfor i in first:\n\t\t\t\tif i in second:\n\t\t\t\t\tc+=1\nprint(c)\n\t\t\t\t\n\t\t\n", "n,m = map(int, input().split())\r\ncount = 0\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if ((i * i) + j) == n and (i + (j * j)) == m:\r\n count += 1\r\nprint(count)", "import string\nfrom bisect import bisect, bisect_left, bisect_right\nfrom collections import Counter, defaultdict, deque\nfrom functools import cache, lru_cache\nfrom math import *\nfrom sys import stdin, stdout\n\ninput = stdin.readline\n\nMOD = 10**9+7\n\n\ndef add(a, b):\n return a+b-MOD if a+b > MOD else a+b\n\n\ndef sub(a, b):\n return a-b+MOD if a-b < 0 else a-b\n\n\ndef inp():\n return(int(input()))\n\n\ndef inlt():\n return(list(map(int, input().split())))\n\n\ndef floatl():\n return(list(map(float, input().split())))\n\n\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef ins():\n s = input()\n return s[:len(s) - 1]\n\n\ndef invr():\n return(map(int, input().split()))\n\n\ndef print_arr(arr):\n for v in arr:\n print(v, end=' ')\n print()\n\n\nt = 1\n# t = inp()\nfor _ in range(t):\n n, m = inlt()\n res = 0\n for b in range(n+1):\n a2 = n-b\n a = floor(sqrt(a2))\n if a*a == a2 and a+b*b == m:\n res += 1\n print(res)\n", "str1 = input()\r\nlist1= str1.split()\r\nn= int(list1[0])\r\nm= int(list1[1])\r\nc1= 0\r\nfor i in range (0,n+m) :\r\n a = i\r\n for j in range(0,n+m) :\r\n b = j \r\n if(a*a+b==n and a+b*b==m):\r\n c1 +=1 \r\nprint(c1)\r\n ", "n,m=map(int,input().split())\r\nsum=0\r\nfor a in range (1001):\r\n for b in range (1001):\r\n if (a*a+b==n)and (a+b*b==m):\r\n sum+=1\r\nprint (sum)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m = list(map(int, input().split()))\r\na,b = 0,0\r\ni=0\r\nfor a in range(33):\r\n for b in range(33):\r\n if (a*a + b == n and b*b + a == m):\r\n i+=1\r\nprint(i)", "import math\r\nn,m = [int(x) for x in input().split() ]\r\ncount= 0\r\nfor i in range(int(math.sqrt(n))+1):\r\n for j in range(int(math.sqrt(m))+1):\r\n if i**2+j ==n and i + j**2 ==m:\r\n count+=1\r\nprint(count)", "import math\r\nn,m=map(int,input().split())\r\nc=0\r\nfor b in range(0,1000):\r\n if(n>=b and math.sqrt(n-b)+b*b-m==0):\r\n c+=1\r\nprint(c)\r\n", "import math\r\n[n,m]=list(map(int,input().split()))\r\ncount=0\r\nfor a in range(0,int(math.sqrt(n)+1)):\r\n b=n-(a*a)\r\n if a+(b*b)==m:\r\n count+=1\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\nans=0\r\nk=min(n,m)\r\nfor a in range(0,k+1):\r\n\tfor b in range(0,k+1):\r\n\t\tif ((a**2)+b)==n and (a+(b**2))==m:\r\n\t\t\tans+=1\r\nprint(ans)", "n,m = tuple(map(int,input().split()))\r\ncount = 0\r\nfor i in range(101):\r\n for j in range(101):\r\n if (i**2 + j == n and i + j**2 == m):\r\n count += 1 \r\nprint(count)", "import math\r\n\r\nn, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\ncount = 0\r\n\r\nfor a in range(n + 1):\r\n b_square = m - a\r\n if b_square < 0:\r\n continue\r\n \r\n b = int(math.sqrt(b_square))\r\n \r\n if a + b ** 2 == m and a ** 2 + b == n:\r\n count += 1\r\n\r\nprint(count)\r\n", "from sys import stdin, setrecursionlimit, stdout\r\n\r\n\r\ndef solve():\r\n n, m = (int(s) for s in stdin.readline().split())\r\n ans = 0\r\n for a in range(1000):\r\n for b in range(1000):\r\n if a*a + b == n and a + b*b == m:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import math\r\nn, m = map(int, input().split())\r\nco= 0\r\nfor a in range(int(math.sqrt(n)) + 1):\r\n b = n - a ** 2\r\n if b >= 0 and a + b ** 2 == m:\r\n co += 1\r\nprint(co)\r\n", "def solve(number1, number2):\r\n count = 0\r\n new_number1 = int((number1)**(1/2))\r\n new_number2 = int((number2)**(1/2))\r\n for i in range(0, new_number1 + 1, 1):\r\n for j in range(0, new_number2 + 1, 1):\r\n if (i**2 + j == number1) and (i + j**2 == number2):\r\n count += 1\r\n return count\r\n\r\nn, m = map(int, input().split())\r\nprint(solve(n, m))\r\n", "\r\n\r\ncount=0\r\nn,m=map(int,input().split())\r\nfor a in range(0,100):\r\n for b in range(0,100):\r\n if ((a**2) + b==n ) and ( (b**2) + a==m ):\r\n count+=1\r\nprint(count)", "from math import sqrt\n\nnm = input()\nn, m = [int(i) for i in nm.split(\" \")]\n\nN = int(sqrt(1000) + 1)\nn_solutions = 0\n\nfor a in range(N):\n a_squared = a * a\n\n for b in range(N):\n eq1 = a_squared + b\n eq2 = a + b * b\n\n if eq1 == n and eq2 == m:\n n_solutions += 1\n break\n\nprint(n_solutions)\n", "import math\r\n\r\n(n, m) = map(int, input().split())\r\n\r\n# print(n)\r\n# print(m)\r\n\r\npossible_a_b = []\r\nfinal_a_b = []\r\n\r\n# Equation 1: a^2 + b = n \r\nmax_a = math.floor(math.sqrt(n))\r\nfor a in range(max_a + 1):\r\n # print(\"a = \" + str(a))\r\n b = n - a*a # possible value of b\r\n # print(\"b = \" + str(b))\r\n possible_a_b.append((a, b))\r\n \r\n# Equation 2: a + b^2 = m\r\nfor i in range(len(possible_a_b)):\r\n if (possible_a_b[i][0] + possible_a_b[i][1]*possible_a_b[i][1] == m):\r\n final_a_b.append(possible_a_b[i])\r\n\r\n# print(final_a_b)\r\nprint(len(final_a_b))", "a,b=list(map(int,input().split()))\r\nc=0\r\nfor i in range(max(a,b)*2):\r\n for j in range(max(a,b)*2):\r\n if i**2+j==a and i+j**2==b:\r\n c+=1\r\nprint(c)", "n, m = map(int, input().split())\r\n\r\ncount = 0\r\nfor i in range(n + 1):\r\n for j in range(m + 1):\r\n if (pow(i, 2) + j == n) and (i + pow(j, 2) == m):\r\n count += 1\r\n\r\nprint(count)", "def n(a,b):\r\n return a**2 + b \r\ndef m(a,b):\r\n return a+b**2 \r\nx =input(\"\")\r\n# print(x.split())\r\nx_string = x.split()\r\nx_x=int(x_string[0])\r\nx_y=int(x_string[1])\r\n# print(x_x , x_y)\r\n# print(m(x_x,x_y),n(x_x,x_y))\r\ni = 0 \r\nbb=0\r\nwhile i <= x_x:\r\n t=0\r\n\r\n while t <= x_y:\r\n if (n(i,t)==x_x and m(i,t)==x_y):\r\n bb+=1\r\n\r\n t+=1\r\n i+=1\r\nprint(bb)", "import math\r\nn,m=map(int,input().split())\r\nc=0\r\nfor a in range(math.floor(math.sqrt(n))+1): #as a>=0 and b>=0\r\n for b in range(math.floor(math.sqrt(m))+1):\r\n if ((a**2)+b==n) and (a+(b**2)==m):\r\n c+=1\r\nprint(c)", "'''\r\n ************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM :A. System of Equations\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\nn, m = map(int, input().split())\r\n \r\nt = 0\r\n \r\nfor u in range(int(n**0.5) + 1):\r\n r = n - u**2\r\n if r**2 + u == m:\r\n t += 1\r\n \r\nprint(t)\r\n", "nm = list(map(int, input().split()))\r\nn = nm[0]\r\nm = nm[1]\r\ncount = 0\r\nfor b in range(1000):\r\n for a in range(1000):\r\n if (a**2 + b == n) and (a + b**2 == m):\r\n count = count + 1\r\nprint(count)", "from math import sqrt\r\nn, m= map(int, input().split())\r\n\r\nk=0\r\na=0\r\n\r\nwhile a<1000:\r\n if m-a>=0 and (n-a**2)==(sqrt(m-a)):\r\n k=k+1\r\n \r\n a=a+1\r\n \r\nprint(k)", "n, m = (map(int, input().split()))\r\nr = range(40)\r\nprint(sum(a * a + b - n == a + b * b - m == 0 for a in r for b in r))", "temp = input().split(\" \")\r\ntemp = [int(item) for item in temp]\r\nn, m = temp\r\n\r\nresult = 0\r\nfor j in range(n+1):\r\n for k in range(m+1):\r\n if j**2 + k == n and j + k**2 == m:\r\n result += 1\r\nprint(result)", "n, m = list(map(int, input().split(' ')))\r\na, s = 0, 0\r\nwhile (a ** 2 <= n and a <= m):\r\n b = n - a ** 2\r\n if (a + b ** 2 == m):\r\n s += 1\r\n a += 1\r\nprint(s)\r\n", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nimport math\r\nn,m=map(int,input().split())\r\nif n>m:n,m=m,n\r\nt=0\r\ne=math.floor(math.sqrt(n))+1\r\nfor a in range(e):\r\n b=n-pow(a,2)\r\n f=a+pow(b,2)\r\n if f==m:t+=1\r\nprint(t)\r\n#------------------------------------------\r\nif count_time:\r\n end_time = time.time()\r\n print('----------------\\nRunning time: {} s'\r\n .format(end_time - start_time))\r\n", "n, m, answer = 0, 0, 0\r\nn, m = map(int, input().split())\r\n\r\ni = 0\r\nwhile i * i <= n and i <= m:\r\n b = n - i * i\r\n if i + b * b == m:\r\n answer += 1\r\n i += 1\r\n\r\nprint(answer)\r\n", "n,m = [int(i) for i in input().split()]\na = b = 0 \ncount = 0\nwhile a**2 + b <= n and a + b**2 <= m:\n b = 0\n while a**2 + b <= n and a + b**2 <= m:\n if a**2 + b == n and a + b**2 == m:\n count += 1\n b += 1\n b = 0\n a += 1\nprint(count)", "def numSys(n, m):\r\n ans = 0\r\n for a in range(1000):\r\n for b in range(1000):\r\n if a**2 + b == n and b**2 + a == m:\r\n ans += 1\r\n return ans\r\nn, m = map(int, input().split())\r\nprint(numSys(n, m))", "import math\r\nn , m =map(int,input().split())\r\ncount = 0\r\nd = math.floor(math.sqrt(n))\r\n# print(d)\r\nfor a in range(d+1):\r\n b = n - (a**2)\r\n # print(b)\r\n c = (b**2)+a\r\n # print(c)\r\n if(c==m):\r\n count+=1\r\nprint(count) \r\n", "n,m = map(int,input().split())\r\nx = 0\r\nfor i in range(0,max(n,m)+1):\r\n for j in range(0,max(n,m)+1):\r\n if (((i*i)+j == n) and (i+(j*j) == m)):\r\n x += 1\r\nprint(x)", "n, m = map(int,input().split())\r\ncount = 0\r\na = 0\r\nwhile a*a <= n:\r\n b = n - a*a\r\n if b >= 0 and a+b*b == m:\r\n count += 1\r\n a+=1\r\nprint(count)", "import sys, math, itertools, functools, collections\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nMIN = 10 ** 18\r\nMAX = -10 ** 18\r\n\r\n\r\ndef intj():\r\n return int(input())\r\n\r\n\r\ndef intm():\r\n return map(int, input().split())\r\n\r\n\r\ndef listm():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn, m = intm()\r\n# a^2 + b = n\r\n# a + b^2 = m\r\nans = 0\r\nfor i in range(MIN):\r\n a = i\r\n if a > n:\r\n break\r\n for j in range(MIN):\r\n b = j\r\n ans1 = a ** 2 + b\r\n ans2 = a + b ** 2\r\n if ans1 > n and ans2 > m:\r\n break\r\n if ans1 == n and ans2 == m:\r\n ans += 1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if (a*a)+b == n and a+(b*b) == m:\r\n c+=1\r\nprint(c)", "n, m = map(int, input().split())\r\ncount = 0\r\nfor a in range(int(n**0.5)+1):\r\n for b in range(int(m**0.5)+1):\r\n if a*a + b == n and a + b*b == m:\r\n count += 1\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\ncount = 0\r\nfor a in range(int(n**0.5) + 1):\r\n b = n - a**2\r\n if (b >= 0) & (b**2 == m - a):\r\n count += 1\r\nprint(count)", "n, m = map(int, input().split())\r\nb, rez = 0, 0\r\nwhile b**2 <= m:\r\n if (m - b**2) == (n - b)**0.5:\r\n rez += 1\r\n b += 1\r\nprint(rez)", "def main():\r\n print(f\"{solve()}\")\r\n\r\ndef solve():\r\n r = 0\r\n\r\n n, m = input().split()\r\n n = int(n)\r\n m = int(m)\r\n for i in range(33):\r\n for j in range(33):\r\n if (i**2) + j == n and (j**2) + i == m:\r\n r += 1\r\n return r\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\np=0\r\nfor a in range(0,n+1):\r\n\tb=n-a**2\r\n\tif b>=0:\r\n\t\tif a+b**2==m:\r\n\t\t\tp+=1\r\nprint(p)", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\nn, m = readarray(int)\r\n\r\n\r\nsolutions = 0\r\n\r\nfor a in range(1001):\r\n for b in range(1001):\r\n eq1 = (a**2) + b == n\r\n eq2 = a + (b**2) == m\r\n\r\n if eq1 and eq2:\r\n solutions += 1\r\n\r\nprint(solutions)\r\n", "a1,a2=map(int,input().split())\r\ncount = 0\r\na=0\r\nwhile a**2 <= a1:\r\n b = a1 - a**2\r\n if b>=0 and a+b**2==a2:\r\n count+=1\r\n a+=1\r\nprint(count)\r\n", "# #✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\n# ◕ █ █ █ █ /████\\ ██\\ █ /██\\ ██ ██\\ █ ◕\r\n# ◕ █ █ █ █ █\\ \\█ █\\█\\ █ /█/\\█\\ █\\█\\ █ ◕\r\n# ◕ █\\ /█ █ █ █ █ \\█\\ █ /█/ \\█\\ ██ █ \\█\\ █ ◕\r\n# ◕ █████ █ █ \\████\\ █ \\█\\ █ █/ \\█ ██ █ \\█\\ █ ◕\r\n# ◕ █/ \\█ █ █ \\█ █ \\█\\ █ ████████ ██ █ \\█\\ █ ◕\r\n# ◕ █ █ █\\ /█ █\\ /█ █ \\█\\█ █ █ ██ █ \\█\\█ ◕\r\n# ◕ █ █ \\██████/ \\████/ █ \\██ █ █ ██ █ \\██ ◕\r\n#✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\nn,m = map(int,input().split())\r\nans = 0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n if (i**2)+j==n and i+(j**2)==m:\r\n ans += 1\r\nprint(ans)", "k=[int(i) for i in input().split()]\nn=k[0]\nm=k[1]\ns=0\nfor i in range(int(n**0.5)+1):\n for j in range(int(m**(1/2)+1)):\n if i**2+j==n and i+j**2==m:\n s+=1\nprint(s)\n", "# -*- coding: utf-8 -*-\n\"\"\"18/1.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1U_Qi8ZheOtic9GFjrk6THLv4_-ik64J_\n\"\"\"\n\nimport math\nn,m=[int(x) for x in input().split()]\nx=int(math.sqrt(n))\ny=int(math.sqrt(m))\nc=0\nfor i in range(x+1):\n for j in range(y+1):\n if i**2+j==n and i+j**2==m:\n c=c+1\nprint(c)", "n,m=map(int,input().split())\r\nx=range(32)\r\nprint(sum(a*a+b-n==a+b*b-m==0 for a in x for b in x))", "import math\r\nn, m = map(int,input().split())\r\na = int(math.sqrt(n))\r\nans = 0\r\nfor i in range(a+1):\r\n j = n - i*i\r\n if j*j + i == m:\r\n ans +=1\r\n\r\nprint(ans)", "def brute_force(S):\n count = 0\n for i in range(32): # 32 x 32 + 32 is the most nearest 1000\n for j in range(32):\n if (i*i + j) == S[0] and (i + j*j) == S[1] : count += 1\n return count\n\nS = [int(e) for e in input().split()]\nprint(brute_force(S))\n\n", "import math\r\n\r\nlist1 = [int(x) for x in input().split(\" \")]\r\n\r\nmaximum = 1000\r\nint1 = math.floor(math.sqrt(list1[0]))+1\r\nint2 = math.floor(math.sqrt(list1[1]))+1\r\nif int2 < int1:\r\n maximum = int1\r\nelse:\r\n maximum = int2\r\n\r\nresults = 0\r\nfor x in range(maximum):\r\n for y in range(maximum):\r\n if x**2 + y == list1[0] and y**2 + x == list1[1]:\r\n results += 1\r\n\r\nprint(results)", "counter = 0\r\nn = input().split(\" \")\r\na = 0\r\nwhile True:\r\n b = int(n[0]) - a ** 2\r\n if b < 0 or a < 0:\r\n break\r\n if a**2 + b == int(n[0]) and a + b ** 2 == int(n[1]):\r\n counter += 1\r\n a += 1\r\nprint(counter, end = \"\")\r\n", "n, m = [int(i) for i in input().split()]\nanswer = 0\nfor a in range(32):\n for b in range(32):\n if n-a**2-b==m-b**2-a==0:\n answer+=1\nprint(answer)", "n,m = list(map(int,input().split()))\r\nans = 0\r\nfor a in range(0,int(n**(1/2))+1):\r\n b = n - a**2\r\n if a + b**2 == m:\r\n ans += 1\r\nprint(ans)", "n, m= map(int, input().split())\r\nx=0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if a**2+b==n and b**2+a==m:\r\n x+=1\r\nprint(x)", "x=list(input().split())\r\nn=int(x[0])\r\nm=int(x[1])\r\ncount=0\r\na=0\r\nwhile a**2<=min(n,m):\r\n b=min(n,m)-a**2\r\n if b>=0 and a+b**2==max(n,m):\r\n count+=1\r\n a+=1\r\nprint(count)\r\n", "n,m=input().split()\r\nmin_=min(int(n),int(m))\r\nlistt=[]\r\nfor i in range(0,min_+1):\r\n listt.append(i)\r\n\r\ncount=0\r\nfor i in listt:\r\n for j in range(len(listt)):\r\n if i+pow(j,2)==int(n) and pow(i,2)+j==int(m):\r\n count=count+1\r\n\r\nprint(count)", "n, m= map(int, input().split())\r\ncounter= 0\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if i**2+ j== n and i+ j**2== m:\r\n counter+= 1\r\n\r\nprint(counter)", "n, m = map(int, input().split())\r\na, b = 0, 0\r\nres = 0\r\nwhile b <= n:\r\n while a <= m:\r\n if a**2+b==n and a+b**2==m:\r\n res+=1\r\n a+=1\r\n b+=1\r\n a=0\r\nprint(res)", "n, m = map(int, input().split())\r\nfinalans = 0\r\nfor a in range(0, 32):\r\n for b in range(0, 32):\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n finalans += 1\r\nprint(finalans)", "n, m = map(int, input().split())\r\nans = a = 0\r\n\r\nwhile a * a <= n and a <= m:\r\n b = n - (a * a)\r\n if a + (b * b) == m:\r\n ans += 1\r\n a += 1\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ntotal = 0\r\nfor i in range(0, int(n ** 0.5) + 1):\r\n for j in range(0, int(m ** 0.5) + 1):\r\n if i ** 2 + j == n and i + j ** 2 == m:\r\n total += 1\r\nprint(total)", "n,m = map(int,input().split())\r\ni = 0\r\ncount = 0\r\nwhile(True):\r\n a = i\r\n b = n - a*a\r\n if(b<0):\r\n break\r\n elif( a + b*b == m ):\r\n count +=1 \r\n i +=1 \r\nprint(count) ", "def solve():\r\n n,m=map(int,input().split())\r\n ans=0\r\n for a in range(0,m+1):\r\n for b in range(0,n+1):\r\n if (a**2)+b==n and a+(b**2)==m:\r\n ans+=1\r\n print(ans)\r\nif __name__ == '__main__':\r\n solve()", "import math\r\nn,m = map(int,input().split())\r\na = 0 \r\ncout = 0\r\nwhile a**2 <= n :\r\n b = n - a**2 \r\n if b**2 + a == m :\r\n cout += 1\r\n a+=1 \r\n continue\r\n else: \r\n a+=1\r\n continue \r\n\r\nprint(cout) ", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in range(n+1):\r\n\tif (n-i**2)>=0 and (n-i**2)**2+i==m:\r\n\t\tcount=count+1\r\nprint(count)", "n, m = tuple (map (int, input ().split (' ')))\r\nn, m = min (n, m), max (n, m)\r\nresult = 0\r\nfor i in range (0, int (n ** 0.5) + 1):\r\n j = n - i ** 2\r\n if i + j ** 2 == m:\r\n result += 1\r\nprint (result)\r\n", "n,m = map(int,input().split())\r\nres = 0\r\nfor a in range(m+n+1):\r\n for b in range(m+n):\r\n if a*a + b == n and b*b + a == m:\r\n res+=1\r\nprint(res) ", "import math\r\ndef equa(n,m):\r\n count=0\r\n if m>n:\r\n for i in range(0,n+1):\r\n if math.sqrt(n-i)+i**2==m:\r\n b=i\r\n if math.sqrt(n-b)==m-b**2:\r\n count+=1\r\n return count\r\n else:\r\n for i in range(0,m+1):\r\n if math.sqrt(n-i)+i**2==m:\r\n b=i\r\n if math.sqrt(n-b)==m-b**2:\r\n count+=1\r\n return count\r\nn,m=map(int,input().split())\r\nprint(equa(n,m))", "n, m = map(int,input().split())\r\ncount = 0\r\nfor a in range(0, 1001):\r\n for b in range(0, 1001):\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n count += 1\r\nprint(count)\r\n", "def solve(number1, number2):\r\n count = 0\r\n new_number1 = int((number1)**(1/2))\r\n for i in range(0, new_number1 + 1, 1):\r\n j = number1 - i**2\r\n if (j**2 == number2 - i):\r\n count += 1\r\n return count\r\n\r\nn, m = map(int, input().split())\r\nprint(solve(n, m))\r\n", "n, m = [int(x) for x in input().split()]\r\nres = 0\r\nfor i in range(int((max(n,m) ** (1/2))) + 1):\r\n for j in range(int((max(n,m) ** (1/2))) + 1):\r\n if i**2 + j == n and i + j**2 == m:\r\n res += 1\r\nprint(res)", "n,m=map(int,input().split())\r\nt=0\r\nfor i in range(32):\r\n if i*i>n:\r\n break\r\n if((i+(n-i*i)*(n-i*i))==m):\r\n t+=1\r\nprint(t)", "p,q=map(int,input().split())\r\nkir=0\r\nr=max(p,q)\r\nfor i in range(0,r+1):\r\n for j in range(0,r+1):\r\n if(i*i+j==p and i+j*j==q):\r\n kir+=1\r\nprint(kir)", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if i*i+j==n and i+j*j==m:\r\n c+=1\r\nprint(c)", "n,m=map(int,input().split())\r\ncount=0\r\nfor a in range(n+1):\r\n for b in range(m+1):\r\n if(a*a+b==n and a+b*b==m):\r\n count+=1\r\n\r\nprint(count)", "n, m = map(int, input().split())\na = 0\ncount = 0\nwhile a * a <= n:\n b = n - a * a\n if b >= 0 and a + b * b == m:\n count += 1\n a += 1\nprint(count)\n", "nm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nc = 0\r\n\r\nif n == m == 1:\r\n print(2)\r\nelse:\r\n for a in range(32):\r\n for b in range(32):\r\n if a * a + b == n and a + b * b == m:\r\n c += 1\r\n\r\n print(c)", "n, m = map(int, input().split())\nnum = 0\nx = int(min(n, m)**(1/2)//1+1)\nfor a in range(x):\n b = min(n, m) - a*a\n if a + b*b == max(n, m):\n num += 1\nprint(num)\n", "import math\r\nm,n =map(int,input().split())\r\nnb=0\r\nfor b in range (1000):\r\n if m-(n-b)**0.5== b ** 2 :\r\n nb+=1\r\nprint(nb)", "n,m = map(int,input().split())\nrange_num = min(m,n)\ncount =0 \nfor i in range(range_num+1):\n for j in range(range_num+1):\n if (i*i + j == n) and (j*j + i == m):\n count+=1\nprint(count)\n", "def count_pairs(n,m):\n count = 0\n for a in range(n + 1):\n b = m - a**2\n if a + b**2 == n and b >= 0:\n count += 1\n return count\n\n\n\nn,m = map(int,input().split())\n\nresult = count_pairs(n,m)\nprint(result)", "n, m = map(int, input().split())\r\n\r\n# (m - b**2)**2 + b == n\r\n# (m-a)**0.5 + a**2 == n\r\na = 0\r\ncnt = 0\r\nwhile a <= m:\r\n if (m-a)**0.5 + a**2 == n:\r\n cnt += 1\r\n a += 1\r\nprint(cnt)\r\n", "n,m = map(int,input().split())\r\n\r\ncnt = 0\r\n\r\nfor i in range(max(n,m)+1):\r\n for j in range(max(n,m)+1):\r\n if (i**2+j) == n and (i+j**2) == m:\r\n cnt += 1\r\nprint(cnt)", "n,m = input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nmp=0\r\n\r\n\r\nfor a in range(n+1):\r\n for b in range(m+1):\r\n if a**2 + b ==n and a + b**2==m:\r\n mp +=1\r\nprint(mp)\r\n", "x=input().split()\r\nx=[int(i) for i in x]\r\ncount=0\r\na=0\r\nwhile a**2<=x[0]:\r\n b=x[0]-a**2\r\n if b**2+a==x[1]:\r\n count+=1\r\n a+=1\r\nprint(count)", "a,b=map(int,input().split())\r\ncout1=0\r\nif a<=b:\r\n for i in range(0,b+1):\r\n for j in range(0,b+1):\r\n if i**2+j==a and i+j**2==b:\r\n cout1+=1\r\nelif a>=b:\r\n for i in range(0,a+1):\r\n for j in range(0,a+1):\r\n if i**2+j==a and i+j**2==b:\r\n cout1+=1\r\nprint(cout1)", "N, M = map(int, input().split())\r\nANS, MAXI = 0, int(__import__('math').sqrt(max(N, M))) + 1\r\nfor i in range(MAXI):\r\n for j in range(MAXI):\r\n if i * i + j != N: continue\r\n if i + j * j != M: continue\r\n ANS += 1\r\nprint(ANS)", "n,m = map(int,input().split())\r\nx = min(n,m)\r\nc=0\r\nfor i in range(x+1):\r\n a=i\r\n for j in range(x+1):\r\n b=j\r\n if ((a**2)+b == n and (a+(b**2))==m):\r\n c+=1\r\nprint(c)", "N,M = map(int,input().split())\r\nres = 0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n x = (i**2 + j)\r\n y = (i + j**2)\r\n if x==N and y==M:\r\n res += 1 \r\n elif x > N or y > M:\r\n break\r\n\r\nprint(res)", "from math import sqrt\r\nn,m=map(int,input().split())\r\ncnt=0\r\n# if(n==1 and m==1):\r\n# print(2)\r\nfor i in range(int(sqrt(n)),-1,-1):\r\n # print(i)\r\n b=n-(i**2)\r\n if(i+b**2==m):\r\n cnt+=1\r\nprint(cnt)", "n,m=list(map(int,input().split()))\r\nx=max(n,m)+1\r\nans=0\r\nfor a in range(0,x):\r\n for b in range(0,x):\r\n if a*a+b==n and a+b*b==m:\r\n ans+=1\r\nprint(ans)\r\n", "from math import pow\r\nn, m = [int(i) for i in input().split()]\r\na = 0\r\nanswer = 0\r\nwhile pow(a, 2) <= n and a <= m:\r\n b = n - pow(a, 2)\r\n if a + pow(b, 2) == m:\r\n answer += 1\r\n a += 1\r\nprint(answer)", "number = input()\r\nnumber_list = number.split()\r\nn = int(number_list[0])\r\nm = int(number_list[1])\r\npossible_a = []\r\npossible_b = []\r\nfor i in range (0, n+1):\r\n if i**2 <= n:\r\n possible_a.append(i)\r\nfor l in range (0, m+1):\r\n if l**2 <= m:\r\n possible_b.append(l)\r\ne = 0\r\n\r\nfor i in possible_a: \r\n for l in possible_b:\r\n if i**2 + l == n and i + l**2 == m:\r\n e = e + 1\r\n\r\nprint(e)\r\n", "n,m=map(int,input().split())\r\nres=0\r\nfor a in range(33):\r\n b=n-(a**2)\r\n if(a+b*b==m and b>=0):\r\n res=res+1\r\n \r\nprint(res)\r\n", "\r\nn,m = map(int, input().split(\" \"))\r\na,b = 0,0\r\nz = 0\r\ni = 0\r\nwhile True:\r\n if i*i>n:\r\n break\r\n b = n - i*i\r\n if i + b**2 == m:\r\n z += 1\r\n i += 1\r\nprint(z)\r\n", "n, m = [int(x) for x in input().split()]\r\ncount = 0\r\nfor x in range(min(n,m)+1):\r\n a = x\r\n b = n-(a**2)\r\n if (b**2)+a == m and (b >= 0 and a >= 0):\r\n count += 1\r\nprint(count)\r\n", "def count_pairs(n, m):\r\n count = 0\r\n\r\n for a in range(int(n**0.5) + 1):\r\n b_squared = n - a**2\r\n if a + b_squared**2 == m:\r\n count += 1\r\n\r\n return count\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\n\r\n# Count pairs and output the result\r\nresult = count_pairs(n, m)\r\nprint(result)\r\n", "[n,m] = map(int, input().split())\r\nd = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if (a**2+b == n) and (b**2+a == m):\r\n d+=1\r\nprint(d)", "# LUOGU_RID: 101471606\nn, m = map(int, input().split())\r\nprint(sum(x * x + y == n and y * y + x == m for x in range(m + 1) for y in range(n + 1)))", "n, m = map(int, input().split())\r\n\r\ndef count_pairs(n, m):\r\n # assert n<=m:\r\n if n > m:\r\n n2 = n\r\n n = m\r\n m = n2\r\n count = 0\r\n for a in range(int(n**0.5)+1):\r\n b = n - a**2\r\n if b**2 + a == m :\r\n count += 1\r\n return count\r\n\r\nprint(count_pairs(n, m))", "import math\nn,m=map(int,input().split())\nc=0\nfor i in range(int(math.sqrt(n))+1):\n if i+(n-(i*i))**2==m:\n c+=1\nprint(c)", "n, m = map(int, (input()).split())\r\ncount = 0\r\na = 0\r\nwhile a ** 2 <= n:\r\n b = n - a ** 2\r\n if a + b ** 2 == m:\r\n count += 1\r\n a += 1\r\nprint(count)", "import math\r\nwhile True:\r\n try:\r\n n,m=map(int,input().split())\r\n count=0\r\n a_max=math.sqrt(n)\r\n for i in range(0,int(a_max)+1):\r\n b = n - i ** 2\r\n if i + b ** 2 == m:\r\n count+=1\r\n print(count)\r\n except:\r\n break", "import math\r\n\r\nn,m = map(int,input().split())\r\na=math.floor(math.sqrt(n))\r\ns=0\r\nfor i in range(a+1):\r\n if i+(n-(i*i))**2==m:\r\n s+=1\r\nprint(s)", "n, m = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if a*a+b == n and a+b*b == m:\r\n count += 1\r\nprint(count)\r\n", "\r\ndef solve():\r\n n,m=map(int,input().split())\r\n count=0\r\n for i in range(32):\r\n for j in range(32):\r\n if (i*i+j==n) and (i+j*j==m):\r\n count+=1\r\n print(count)\r\n\r\n\r\n\r\n\r\nsolve()", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(0,1001):\r\n for j in range(0,1001):\r\n if (i+(j**2))==m and ((i**2)+j)==n:\r\n c+=1\r\nprint(c)", "a, b = map(int, input().split())\r\n\r\ncnt = 0\r\nfor i in range(0, a+1):\r\n for j in range(0, b+1):\r\n if i**2 + j == a and i + j**2 == b:\r\n cnt += 1\r\n\r\nprint(cnt)", "n,m = map(int,input().split())\r\na,b = 0,0\r\notvet = 0\r\nif n >=1 and n <=1000 and m >=1 and m <=1000:\r\n while a * a <= n and a >= 0 and b >= 0 and b <= n:\r\n b = n - a * a\r\n if m - a == b * b:\r\n otvet +=1\r\n a +=1\r\n print(otvet)", "\r\nn, m = map(int, input().split())\r\ntotal_ = 0\r\nfor i in range(0, max(n, m) + 1):\r\n for j in range(0, max(n, m) + 1):\r\n if ((i*i) + j == n) and (i + (j*j) == m):\r\n total_ += 1\r\n else:\r\n continue\r\nprint(total_)", "import math\r\nn,m=map(int,input().split(\" \"))\r\nc=0\r\nsum=n+m\r\nfor a in range(n+1):\r\n a1=math.pow(a,2)\r\n for b in range(m+1):\r\n b1=math.pow(b,2)\r\n if((a1+b==n)and(b1+a==m)):\r\n # print(\"---------------\",a,b)\r\n c+=1\r\n break\r\nprint(c)\r\n", "n, m = [int(x) for x in input().split()]\r\n\r\nl = min(n,m)\r\nt = 0\r\nfor x in range(l+1):\r\n for y in range(l+1):\r\n f = (x*x) + y\r\n s = (y*y) + x\r\n if f == n and s == m:\r\n t += 1\r\n elif f > n or s > m:\r\n break\r\nprint(t)", "m,n=[int(x) for x in input().split()]\r\nt=(m+n)\r\nsum=0\r\nfor a in range (t):\r\n for b in range (t):\r\n if (a*a)+b==m and a+(b*b)==n:\r\n sum=sum+1\r\nprint(sum)", "#may 30, 2023\n\n#goal: find the no. of pairs (a,b) s.t. the system is satisfied using complete search\n#given: n,m\n\nn,m=[int(i) for i in input().split()]\n\nc=0 #count of possible pairs\n\nfor a in range(0,1001):\n for b in range(0,1001):\n if a**2+b==n and a+b**2==m:\n c+=1\nprint(c)\n\n\n", "n, m = map(int, input().split())\r\nprint(sum(a+b*b == m and a*a+b == n for a in range(m+1) for b in range(n+1))) \r\n", "from math import sqrt,floor\r\nn,m =map(int,input().split())\r\nc=0\r\nfor i in range(1001):\r\n for j in range(1001):\r\n if (i*i)+j==n and (j*j)+i==m:\r\n c+=1\r\nprint(c)", "n,m = map(int,input().split())\r\ni=0\r\nfor x in range(n+1):\r\n for y in range (m+1):\r\n if (x*x +y == n) and (y*y + x == m ):\r\n i+=1\r\nprint(i)", "n, m = map(int, input().split())\r\nmoo = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if (a ** 2 + b == n) and (a + b ** 2 == m):\r\n moo += 1\r\nprint(moo)", "n, m = map(int, input().split())\r\n\r\na_range = range(n + 1)\r\nb_range = range(m + 1)\r\n\r\nprint(sum(a*a + b - n == a + b*b -m == 0 for a in a_range for b in b_range))", "n,m = input().split(' ')\r\nn,m = int(n), int(m)\r\nresult = 0\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if i**2 + j == n and i + j**2 == m:\r\n result += 1\r\nprint(result)", "n,m = map(int,input().split())\r\nc = 0\r\nfor a in range(min(n,m)+1):\r\n for b in range(min(n,m)+1):\r\n if (a*a)+b==n and a+(b*b)==m:\r\n c+=1\r\nprint(c)", "n,m,ans = list(map(int,input().split()))+[0]\r\nfor a in range(0,int(n**(1/2))+1):\r\n ans += a + (n - a**2)**2 == m\r\nprint(ans)", "n,m =map(int,input().split())\ncount = 0\nif n < m:\n for a in range(n + 1):\n for b in range(n + 1):\n if (a **2 + b == n) and (a + b**2 ==m):\n count = count + 1\nelse:\n for a in range(m + 1):\n for b in range(m + 1):\n if (a ** 2 + b == n) and (a + b ** 2 == m):\n count = count + 1\nprint(count)\n\n", "n,m = map(int,input().split())\r\nc = 0\r\nfor a in range(1000):\r\n\tfor b in range(1000):\r\n\t\tif (a**2)+b==n:\r\n\t\t\tif a+(b**2)==m:\r\n\t\t\t\tc += 1\r\nprint(c)", "case=input()\r\ncaseLst=list(map(int,case.split()))\r\nn=caseLst[0]\r\nm=caseLst[1]\r\ncount=0\r\na=0\r\nwhile(a<=n):\r\n\tb=0\r\n\twhile(a<=n and b<=m):\r\n\t\tif (a**2+b==n) and (b**2+a==m):\r\n\t\t\tcount+=1\r\n\t\tb+=1\r\n\ta+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nw=0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if a**2+b==n and a+b**2==m:\r\n w+=1\r\nprint(w)\r\n \r\n", "n, m = map(int, input().split())\r\nans = 0\r\nfor a in range(int(n ** 0.5) + 1):\r\n\tfor b in range(int(m ** 0.5) + 1):\r\n\t\tif a * a + b == n and a + b * b == m:\r\n\t\t\tans += 1\r\nprint(ans)", "n,m = map(int,input().split())\r\n\r\ncount = 0\r\nmax_range = max(n, m)\r\n\r\nfor a in range(max_range + 1):\r\n for b in range(max_range + 1):\r\n if (a ** 2 + b == n) and (a + b ** 2 == m):\r\n count += 1\r\n\r\nprint(count)", "ch=input()\r\nn=int(ch[0:(ch.find(\" \"))])\r\nm=int(ch[(ch.find(\" \"))+1:])\r\n\r\nif n==m and m==1 :\r\n print(2)\r\nelse:\r\n nb=0\r\n for i in range(n):\r\n for j in range(m):\r\n if (i*i)+j ==n and (j*j)+i==m :\r\n nb+=1\r\n\r\n print(nb)", "n,m=map(int,input().split());p=range(33);print(sum((a*a+b==n)*(a+b*b==m)for a in p for b in p))\r\n", "n,m=map(int,input().split())\r\nr=range(32)\r\nprint(sum(a*a+b-n==a+b*b-m==0 for a in r for b in r))", "n,m=map(int,input().split())\r\ncou=0\r\nfor i in range(min(n,m)+1):\r\n for j in range(min(n,m)+1):\r\n if ((i**2)+j)==n and (i+(j**2))==m:\r\n cou+=1\r\nprint(cou)", "M, N = map(int,input().split())\r\npairs = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n pairs += a*a+b==N and a+b*b==M\r\nprint(pairs)", "\r\ndef solve():\r\n #n = int(input())\r\n n, m = [int(x) for x in input().split()]\r\n count = 0\r\n for i in range(0, n+1):\r\n if i + (n-i*i)*(n-i*i) == m and n - i*i >= 0:\r\n count+=1\r\n print(count)\r\n\r\n\r\n\r\n\r\nimport math\r\nfrom collections import defaultdict\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n\r\n", "n,m=map(int,input().split())\r\na=0\r\nj=a*a\r\nr = 0\r\nwhile j<=n:\r\n b = n-j\r\n q2 = m-b*b\r\n if q2==a:\r\n r += 1\r\n a += 1\r\n j = a*a\r\nprint(r)\r\n ", "x,y=map(int,input().split())\r\nc=0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n if i*i+j==x and i+j*j==y:\r\n c+=1\r\nprint(c)\r\n ", "import math\r\n[n, m] = [int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(0,int(math.sqrt(n))+1):\r\n if (n-i**2)**2+i==m:\r\n count+=1\r\nprint(count)\r\n", "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\ndef sl(a,b,n,m):\r\n return a*a+b==n and a+b*b==m\r\nn,m=mn()\r\nct=0\r\nfor x in range(min(n,m)+1):\r\n for y in range(min(n,m)+1):\r\n if sl(x,y,n,m):\r\n ct+=1\r\nprint(ct)\r\n", "h = 0\r\nn, m = map(int, input().split())\r\na = 0\r\nb = 0\r\nwhile(a*a<=n):\r\n b = 0;\r\n while(b*b+a<=m):\r\n if a*a+b == n and a+b*b==m:\r\n h += 1\r\n b+=1;\r\n a+=1; \r\n\r\nprint(h)", "from itertools import count\r\nn,m=map(int,input().split())\r\ncnt=0\r\nfor i in count(0):\r\n s=n-i**2\r\n if s<0:\r\n print(cnt)\r\n break\r\n else:\r\n if s**2+i==m:\r\n cnt+=1\r\n", "n,m=map(int,input().split())\r\nans=0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if (a*a+b==n and a+b*b==m):\r\n ans+=1\r\nprint(ans)", "from math import sqrt, ceil\n\nn, m = (int(i) for i in input().split())\n# b = sqrt(m - a)\n# b = n - a^2\nres = 0\nfor a in range(min(ceil(sqrt(n)), m) + 1):\n res += 1 if n - a**2 == sqrt(m - a) else 0\nprint(res)\n", "x=list(map(int,input().split()))\r\nn,m=x\r\nc=0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n if i*i + j ==n and j*j + i==m:\r\n c=c+1\r\nprint(c)", "n, m = map(int, input().split())\r\ncount = 0\r\na = 0\r\nb = 0\r\nwhile a*a<=n:\r\n if a*a + b==n:\r\n if b*b + a ==m:\r\n count+=1\r\n a+=1\r\n b=0\r\n else:\r\n b=0\r\n a+=1\r\n elif a*a+b<n:\r\n b+=1\r\n else:\r\n a+=1\r\n b=0\r\nprint(count)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nans = 0\r\nfor a in range(max(n, m) + 1):\r\n for b in range(max(n, m) + 1):\r\n if a * a + b == n and a + b * b == m:\r\n ans += 1\r\nprint(ans)", "n,m = map(int,input().split())\na1 = int(n**0.5)\nb1 = int(m**0.5)\nI = 0\nfor a in range(a1+1):\n for b in range(b1+1):\n if a*a+b == n and b*b+a == m:\n I+=1\nprint(I)", "n, m = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nfor b in range(0, int(n**0.5) + 1):\r\n a = n - b**2\r\n if a**2 + b == m:\r\n count += 1\r\n\r\nprint(count)\r\n", "k = [int(x) for x in input().split()]\r\nn,m = k[0],k[1]\r\narr = []\r\ncount = 0\r\nfor a in range(1000):\r\n if a**4 + n**2 - 2*n*a**2 +a - m==0:\r\n b = n - a**2 \r\n if b**2 + a == m and a>=0 and b>=0:\r\n count+=1\r\n \r\nprint(count)", "n, m = map(int, input().split())\r\ncnt = 0\r\nfor i in range(32):\r\n if (m - i ** 2) ** 2 + i == n and m - i ** 2 >= 0:\r\n cnt += 1\r\nprint(cnt)", "n,m=map(int,input().split())\r\nwhile (n<1 and m<1) and (n>1000 and m>1000):\r\n n,m=map(int,input().split())\r\ncount = 0\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if (i*i + j == n) and (i + j*j == m):\r\n count +=1\r\nprint(count)\r\n", "[n, m] = map(int, input().split(\" \"))\n\ncounter = 0\n\nfor a in range(1001):\n for b in range(1001):\n if (a**2 + b == n and a + b**2 == m):\n counter += 1\n\nprint(counter)\n", "m, n = map(int, input().split(' '))\n\nthreshold = max(m, n) + 1\n\nanswer = 0\n\nfor a in range(threshold):\n for b in range(threshold):\n first_expression = a * a + b\n second_expression = a + b * b\n\n if first_expression == n and second_expression == m:\n answer += 1\n\nprint(answer)\n\n \t\t\t\t \t\t \t\t \t\t\t\t\t \t \t\t\t \t\t", "n,m=tuple(map(int,input().split()))\r\nm0=0\r\nfor i in range(max(m+1,n+1)):\r\n for j in range(max(m+1,n+1)):\r\n if (i**2+j==m and i+j**2==n):\r\n m0+=1\r\n\r\nprint(m0)", "n, m = map(int, input().split())\r\nmx = int(max(n, m)) + 1\r\ncounter = 0\r\nfor i in range(mx):\r\n for j in range(mx):\r\n if i ** 2 + j == n and i + j ** 2 == m:\r\n counter += 1\r\nelse:\r\n print(counter)\r\n", "n,m=map(int,input().split());k=0\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if i**2+j==n and i+j**2==m:\r\n k+=1\r\nprint(k)", "n, m = (int(i) for i in input().split())\r\ntotal = 0\r\n\r\nfor b in range(32): \r\n if (n - b) ** 0.5 == m - b ** 2:\r\n total += 1\r\n \r\nprint(total)", "import math\r\n\r\nn, m = map(int, input().split())\r\n\r\nans = 0\r\nfor i in range(0, n+1):\r\n # print(i, math.sqrt(n-i), m - i**2)\r\n if math.sqrt(n - i) == m - i**2:\r\n ans += 1\r\nprint(ans)", "#!/usr/bin/env python3\n# coding=utf-8\n\nline = input().rstrip().split()\nn = int(line[0])\nm = int(line[1])\ncount = 0\nfor i in range(1001):\n for j in range(1001):\n if(i*i+j == n and i + j*j == m):\n count += 1\nprint(count)\n", "import math\r\nn,m=map(int,input().split())\r\nz=int(math.sqrt(max(n,m)))+1\r\nf=0\r\nfor a in range(z):\r\n\tfor b in range(z):\r\n\t\tif (a*a+b)==n and (b*b+a)==m:\r\n\t\t\tf=f+1\r\nprint(f)\r\n\t\t\r\n\t\t", "def solve(n: int, m: int) -> int:\r\n count = 0\r\n for a in range(32):\r\n for b in range(32):\r\n a2 = a ** 2\r\n b2 = b ** 2\r\n if a2 + b == n and b2 + a == m:\r\n count += 1\r\n return count\r\n\r\n\r\nassert solve(9, 3) == 1\r\nassert solve(14, 28) == 1\r\nassert solve(4, 20) == 0\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n print(solve(n, m))\r\n", "def system_of_equation():\r\n count=0\r\n n,m=list(map(int,input().split()))\r\n for i in range(50):\r\n for j in range(50):\r\n if (i**2)+j == n and (j**2)+i == m:\r\n count+=1\r\n print(count)\r\nsystem_of_equation()", "n, m = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor a in range(0, 1000):\r\n for b in range(0, 1000):\r\n if (a**2+b==n) and (a+b**2==m):\r\n count+=1\r\nprint(count)", "n, m = map(int, input().split())\nct = 0\nfor i in range(100):\n for j in range(100):\n if i**2 + j == n and i + j**2 == m:\n ct += 1\nprint(ct)\n \t\t\t\t \t\t\t\t \t\t\t \t \t\t", "n, m = map(int, input().split())\r\nres = 0\r\nfor i in range(n + 1):\r\n for j in range(n + 1):\r\n if i * i + j == n and j * j + i == m:\r\n res += 1\r\nprint(res)", "# lesson 18\r\n# lesson 30\r\n# Система уравнений\r\n# https://codeforces.com/problemset/problem/214/A\r\n\r\nn, m = map(int, input().split())\r\na = 0\r\ncount = 0\r\nwhile a**2 <= n:\r\n b = n - a**2\r\n if b >= 0 and a+b**2 == m:\r\n count += 1\r\n a += 1\r\n\r\nprint(count)\r\n", "# n = int(input())\r\n# i = 1\r\n#\r\n# while i <= n:\r\n# print('pussy')\r\n# i += 1\r\n\r\n# i = 20\r\n# while i >= 10:\r\n# print(i)\r\n# i -= 1\r\n\r\n# guess = input()\r\n# password = 'qwerty'\r\n# count = 0\r\n# while guess != password:\r\n# count += 1\r\n# print('Repeat')\r\n# guess = input()\r\n#\r\n# print('You try:', count)\r\n\r\n# a = [1, 2, 3] * 5\r\n# print(a)\r\n#\r\n# while 3 in a:\r\n# a.remove(3)\r\n# print(a)\r\n\r\n# s = 'huHEhDergrrrgjWJ4343#$^$#'\r\n#\r\n# while len(s) > 0:\r\n# bukva = s[0]\r\n# if bukva >= 'a' and bukva <= 'z':\r\n# print(bukva, 'small')\r\n# elif bukva >= 'A' and bukva <= 'Z':\r\n# print(bukva, 'big')\r\n# elif bukva.isdigit():\r\n# print(bukva, 'digit')\r\n# else:\r\n# print(bukva, 'znak')\r\n# s = s[1:]\r\n\r\n# n, k = map(int, input().split())\r\n#\r\n# p = 0\r\n# if k == n:\r\n# p = n - 1\r\n# elif k * 2 - 1 > n:\r\n# p = k * 2 - 1 - n\r\n# if p == 1:\r\n# p += 1\r\n# elif k * 2 - 1 < n:\r\n# p = k * 2 - 1\r\n#\r\n# print(p)\r\n\r\n# n = int(input())\r\n#\r\n# if n >= 0:\r\n# print(n)\r\n# elif 9 < abs(n) < 100:\r\n# if abs(n) % 10 > abs(n) // 10:\r\n# print((abs(n) // 10) * (-1))\r\n# else:\r\n# print((abs(n) % 10) * (-1))\r\n# else:\r\n# if abs(n) % 10 > abs(n) % 100 // 10:\r\n# n = str(n)\r\n# print(n[:-1])\r\n# else:\r\n# n = str(n)\r\n# print(n[:-2] + n[-1:])\r\n\r\n# n = int(input())\r\n# s = input()\r\n#\r\n# if s.count('A') > s.count('D'):\r\n# print('Anton')\r\n# elif s.count('A') < s.count('D'):\r\n# print('Danik')\r\n# else:\r\n# print('Friendship')\r\n\r\n# n = int(input())\r\n#\r\n# if n % 10 == 1 and (n <= 9 or n > 20):\r\n# print(n, 'korova')\r\n# elif (n % 10 == 2 or n % 10 == 3 or n % 10 == 4) and (n <= 9 or n > 20):\r\n# print(n, 'korovy')\r\n# else:\r\n# print(n, 'korov')\r\n\r\n# a = input()\r\n# b = input()\r\n# c = input()\r\n#\r\n# if a == 'black' and b == 'black' and c == 'green':\r\n# print(a + '\\n' + b + '\\n' + c.upper())\r\n# elif a == 'black' and b == 'black' and c == 'GREEN':\r\n# print(a + '\\n' + 'yellow' + '\\n' + 'black')\r\n# elif a == 'black' and b == 'yellow' and c == 'black':\r\n# print('red' + '\\n' + 'black' + '\\n' + 'black')\r\n# elif a == 'red' and b == 'black' and c == 'black':\r\n# print(a + '\\n' + 'yellow' + '\\n' + c)\r\n# elif a == 'red' and b == 'yellow' and c == 'black':\r\n# print('black' + '\\n' + 'black' + '\\n' + 'green')\r\n# elif a == 'black' and b == 'YELLOW' and c == 'black':\r\n# print(a + '\\n' + b + '\\n' + c)\r\n# else:\r\n# print('error')\r\n\r\n\r\n# x1, x2, x3, x4 = map(int, input().split())\r\n#\r\n# c = [x1, x2, x3, x4]\r\n# a = max(c) - min(c)\r\n# c.remove(min(c))\r\n# b = max(c) - min(c)\r\n# c.remove(min(c))\r\n# d = max(c) - min(c)\r\n#\r\n# print(a, b, d)\r\n\r\n# a = 13\r\n#\r\n# while a != 356:\r\n# print(a)\r\n# a += 7\r\n\r\n# a = 15\r\n#\r\n# while a >= 0:\r\n# print(a)\r\n# a -= 1\r\n# print('Lets go')\r\n\r\n# a = input()\r\n#\r\n# while a[0] == 'я' or a[0] == 'Я':\r\n# a = input()\r\n\r\n# a = int(input())\r\n#\r\n# i = 1\r\n#\r\n# while i*i <= a:\r\n# print(i*i)\r\n# i += 1\r\n\r\n# # Задача №3062. Утренняя пробежка\r\n#\r\n# x = int(input())\r\n# y = int(input())\r\n# i = 1\r\n# while x < y:\r\n# x *= 1.1\r\n# i += 1\r\n# print(i)\r\n\r\n# a, b = map(int, input().split())\r\n# i = 0\r\n# while a <= b:\r\n# a = a * 3\r\n# b = b * 2\r\n# i += 1\r\n# print(i)\r\n\r\n# A. Дело о нулях и единицах\r\n\r\n# n = int(input())\r\n# s = input()\r\n#\r\n# k = s.count('0') - s.count('1')\r\n#\r\n# print(abs(k))\r\n\r\n# 10. Зимний Вечер В Бурсе!\r\n\r\n# n = int(input())\r\n#\r\n# s = str(n)\r\n#\r\n# while int(s[0]) != 1:\r\n# n *= int(s[0])\r\n# s = str(n)\r\n#\r\n# print(n)\r\n\r\n# n, m = map(int, input().split())\r\n# i = 1\r\n# while n > 0:\r\n# if i == m or i % m == 0:\r\n# i += 1\r\n# else:\r\n# n -= 1\r\n# i += 1\r\n# print(i - 1)\r\n\r\n# A. Новый год и спешка\r\n# n, k = map(int, input().split())\r\n#\r\n# i = 5\r\n# count = 0\r\n#\r\n# while n != 0:\r\n# k += i\r\n# if k <= 240:\r\n# count += 1\r\n# i += 5\r\n# n -= 1\r\n#\r\n# print(count)\r\n\r\n# a, b = map(int, input().split())\r\n#\r\n# i = 0\r\n# while b < :\r\n# i += a\r\n# ost = a % b\r\n# a = a // b\r\n\r\n\r\n\r\n# 21. Обход всех цифр числа с помощью while\r\n\r\n# x = int(input())\r\n#\r\n# count = 0\r\n# count_ch = 0\r\n# count_nech = 0\r\n# sum = 0\r\n# pr = 1\r\n# maxi = 0\r\n# mini = 9\r\n# while x > 0:\r\n# last = x % 10\r\n# if last % 2 == 0:\r\n# count_ch += 1\r\n# else:\r\n# count_nech += 1\r\n# count += 1\r\n# sum += last\r\n# pr *= last\r\n# if last > maxi:\r\n# maxi = last\r\n# if last < mini:\r\n# mini = last\r\n# x = x // 10\r\n# print('All digits:', count)\r\n# print('CH digits:', count_ch)\r\n# print('nCH digits:', count_nech)\r\n# print('SuM digits:', sum)\r\n# print('PR digits:', pr)\r\n# print('MAX digit:', maxi)\r\n# print('MINI digit:', mini)\r\n\r\n# x = int(input())\r\n#\r\n# while x > 0:\r\n# last = x % 5\r\n# print(last)\r\n# x = x // 5\r\n\r\n# a, b = input(), input()\r\n#\r\n# c = int(a) + int(b)\r\n# c1 = int(str(c).replace('0', ''))\r\n#\r\n# a1 = int(a.replace('0', ''))\r\n# b1 = int(b.replace('0', ''))\r\n#\r\n# if a1 + b1 == c1:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n# x = int(input())\r\n#\r\n# count = 0\r\n#\r\n# while x > 0:\r\n# x1 = x % 2\r\n# if x1 == 1:\r\n# count += 1\r\n# x = x // 2\r\n# print(count)\r\n\r\n# a = int(input())\r\n# b = int(input())\r\n# c = a + b\r\n# numbers = [a, b, c]\r\n# i = 0\r\n# while i < 3:\r\n# digit = numbers[i]\r\n# raz = 1\r\n# new_num = 0\r\n# while digit > 0:\r\n# last = digit % 10\r\n# if last != 0:\r\n# new_num = new_num + last * raz\r\n# raz *= 10\r\n# digit //= 10\r\n# numbers[i] = new_num\r\n# i += 1\r\n# if numbers[0] + numbers[1] == numbers[2]:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n# 23. Цикл while .Нахождение всех делителей числа\r\n\r\n# a = int(input())\r\n# i = 1\r\n# s = []\r\n# while i * i <= a:\r\n# if a % i == 0:\r\n# s.append(i)\r\n# if i != a // i:\r\n# s.append(a // i)\r\n# i += 1\r\n# s.sort()\r\n# print(s)\r\n\r\n# A. Новогодние свечки\r\n# a, b = map(int, input().split())\r\n# k = 0\r\n# while a > 0:\r\n# k += 1\r\n# if k % b == 0:\r\n# k += 1\r\n# a -= 1\r\n# print(k)\r\n\r\n# A. Ваня и кубики\r\n#\r\n# n = int(input())\r\n# i = 0\r\n# k = 1\r\n# count = 0\r\n# while n >= k:\r\n# i += k\r\n# k += 1\r\n# if n >= i:\r\n# count += 1\r\n# n -= i\r\n# print(count)\r\n\r\nn, m = map(int, input().split())\r\n\r\na = 0\r\nc = 0\r\n\r\nwhile a * a <= n:\r\n b = n - a * a\r\n if b >= 0 and a + b * b == m:\r\n c += 1\r\n a += 1\r\nprint(c)", "n,m=[int(x) for x in input().split()]\r\nres=0\r\nfor i in range(0,32):\r\n for j in range(0,32):\r\n if i**2+j==n and j**2+i==m:\r\n res+=1 \r\nprint(res)", "n, m = map(int, input().split())\r\ncount = 0\r\na = 0\r\nb = 0\r\nfor i in range(int(n**(1/2))+1):\r\n b = n - i*i\r\n if (i+(b**2)) == m:\r\n count += 1\r\nprint(count)\r\n", "n , m = input().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\nsolution = 0\r\nleast = min(m,n)\r\nfor a in range(least+1):\r\n for b in range(least+1):\r\n if a**2 + b == n and b**2 + a == m:\r\n solution += 1\r\nprint(solution)\r\n", "import math\n\nn, m = map(int, input().split())\n\ncnt = 0\n\nfor a in range(int(math.sqrt(n)) + 1):\n b = n - a * a\n if a + b * b == m and b >= 0:\n cnt += 1\n\nprint(cnt)", "inp = input().rsplit(\" \")\r\n\r\nn = int(inp[0])\r\nm = int(inp[1])\r\n\r\na = 0\r\nb = 0\r\nct = 0\r\nfor b in range(m*m+1):\r\n\ta = m - b * b\r\n\tif a * a + b == n and a >= 0:\r\n\t\tct += 1\r\n\r\nprint(ct)", "#214A\r\nm,n=map(int,input().split())\r\np=max(m,n)\r\nc=0\r\nfor a in range(p+1):\r\n for b in range(p+1):\r\n if (a**2)+b==n and (b**2)+a==m:c+=1\r\nprint(c)\r\n", "\r\nfrom sys import stdin\r\nn,m = map(int,(stdin.readline().split()))\r\n\r\naCum = 0\r\nfor i in range(32):\r\n for j in range(32):\r\n \r\n if (i*i)+j == n and i +(j*j) == m:\r\n aCum +=1\r\nprint(aCum)", "n, m = map(int,input().split())\r\ns=0\r\nfor a in range(0, 100):\r\n for b in range(0, 100):\r\n if (n == a*a + b) & ( m == b*b + a):\r\n s+=1\r\nprint(s)\r\n", "n,m=list(map(int,input().split()))\r\ncount=0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if ((a**2)+b)==n and (b**2)+a==m:\r\n count+=1\r\nprint(count)", "n, m = input().split()\nn = int(n)\nm = int(m)\n\nans = 0\na = 0\nwhile a*a <= n:\n\tb = n - a * a\n\tif a + b * b == m:\n\t\tans += 1\n\ta += 1 \n\nprint(ans)\n\t\t \t \t\t\t \t\t \t \t \t\t\t \t", "n, m = map (int, input ().split ())\r\n\r\na = 0\r\ncount = 0\r\n\r\nwhile (n >= a **2):\r\n b = n - a **2\r\n if (b >= 0 and a + b **2 == m):\r\n count += 1\r\n a +=1\r\nprint (count)", "def find_number(n, m):\r\n a = 0\r\n counter = 0\r\n while a ** 2 <= n:\r\n b = n - a ** 2\r\n if a + b ** 2 == m:\r\n counter += 1\r\n a += 1\r\n return counter\r\n\r\nn, m = map(int, input().split())\r\nprint(find_number(n, m))", "n,m = map(int,input().split())\r\ncount = 0\r\nfor a in range(100):\r\n for b in range(100):\r\n if (a**2)+b==m and (b**2)+a==n:\r\n count +=1\r\nprint(count)\r\n\r\n\r\n\r\n", "from math import *\r\nfrom itertools import *\r\nfrom collections import *\r\nimport collections,sys,threading\r\nimport collections,sys,threading\r\nfrom bisect import *\r\nfrom heapq import *\r\n#sys.setrecursionlimit(10**9)\r\n#threading.stack_size(10**8)\r\n#input=sys.stdin.readline\r\n\r\ndef 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,m=mi()\r\n\r\nans=0\r\nfor a in range(0,min(m,floor(sqrt(n)))+1):\r\n if ((n-(a*a))*(n-(a*a))) == m-a:\r\n ans+=1\r\n \r\nprint(ans)\r\n ", "n, m = map(int, input().split()) \r\nprint(sum(1 for a in range(0, 1 + int(n**0.5)) if a + (n - a**2)**2 == m))", "n,m = map(int,input().split())\r\na=int(n**0.5)\r\nb=0\r\ncount=0\r\nfor i in range(a,-1,-1):\r\n for j in range(m+1):\r\n if (i**2) + j ==n:\r\n if i + (j**2)==m:\r\n count+=1\r\nprint(count)\r\n", "n, m = [int(x) for x in input().split()]\r\nct = 0\r\n\r\nfor a in range(max(n, m) + 1):\r\n for b in range(max(n, m) + 1):\r\n # print(f\"a is {a}, b is {b}\")\r\n if ((a ** 2) + b == n) and (a + (b ** 2) == m):\r\n ct += 1\r\n # print(f\"Adding to ct! {ct} is now {ct}\")\r\nprint(ct)", "x,y = map(int,input().split())\r\nans = 0\r\nfor i in range(x+1):\r\n for j in range(y+1):\r\n ans +=int((i*i + j == x) and (i+j*j==y))\r\nprint(ans)", "a,b=map(int,input().split())\r\ns=0\r\nfor i in range(32):\r\n for j in range(32):\r\n if (i**2)+j==a:\r\n if i+(j**2)==b:\r\n s+=1\r\nprint(s)", "\r\nn,m=map(int,input().split())\r\na=0\r\nb=0\r\nct=0\r\nfor b in range(m*m+1):\r\n a=m-b*b\r\n if a*a+b==n and a>=0:\r\n ct+=1\r\nprint(ct)\r\n", "n,m = map(int,input().split())\n\nk = n-m\n#print(k)\ncount = 0 \n\nb = 0\n#a_square = a**2\n\n\nwhile(b*b<=m and b<=n):\n a = m-b*b\n if b+(a*a)==n:\n count = count+1\n b = b+1 \n\n\nprint(count)", "(n, m) = map(int, input().split(' '))\n\ncouples = 0\n\nfor a in range(min(n, m) + 1):\n for b in range(min(n, m) + 1):\n if a ** 2 + b == n and a + b ** 2 == m:\n couples += 1\n\nprint(couples)", "n, m = map(int, input().split())\r\nk = 0\r\nfor a in range(32):\r\n for b in range(32):\r\n if a**2 + b == n and a + b**2 == m:\r\n k +=1\r\nprint(k)", "arr=[i*i for i in range(36)]\r\n\r\nn,m = map(int, input().split())\r\npair=0\r\n\r\nfor i in range(len(arr)):\r\n b = n - arr[i]\r\n if b >= 0:\r\n tm = i + b*b\r\n if tm == m:\r\n pair+=1\r\nprint(pair)", "a,b = map(int, input().split())\r\ncnt = 0\r\nfor i in range(33):\r\n for j in range(33):\r\n if i ** 2 + j == a and i + j ** 2 == b:\r\n cnt += 1\r\nprint(cnt)", "n,m=map(int,input().split())\r\nc=max(n,m)\r\ncount=0\r\nfor i in range(c+1):\r\n for j in range(c+1):\r\n if(i**2 +j==n and i+j**2==m):\r\n count+=1\r\nprint(count)\r\n", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\na , b = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1001):\r\n for j in range(1001):\r\n if (i ** 2) + j == a and (j ** 2) + i == b:\r\n count += 1\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nfor i in range(int(n**0.5)+1):\r\n for j in range(int(m**0.5)+1):\r\n if i*i+j == n and i+j*j == m:\r\n c += 1\r\nprint(c)", "'''input\r\n4 20\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,m = getints()\r\ncnt = 0\r\nfor a in range(1010):\r\n\tfor b in range(1010):\r\n\t\tif a**2+b==n and a+b**2==m:\r\n\t\t\tcnt+=1\r\nprint(cnt)", "n, m = input().split()\nn, m = int(n), int(m)\ncount = 0\n\na, b = 0, 0\n\nwhile a <= n:\n\n while b <= n:\n if ((a ** 2 + b) == n) and ((a + b ** 2) == m):\n count += 1\n b += 1\n \n\n a += 1\n b = 0\n\nprint(count)", "import math\r\n\r\ndef check(n,m):\r\n max_a = int(min(math.sqrt(n),m)) + 1\r\n count = 0\r\n for a in range (0, max_a):\r\n b = n - a*a\r\n if a == (m - b*b):\r\n count = count + 1\r\n return count\r\n\r\nn, m = map(int, input().split())\r\n\r\nprint(check(n,m))", "import sys\r\nimport os.path\r\n \r\nif(os.path.exists('input.txt')) :\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000000\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n \r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n \r\nfrom math import inf, ceil, sqrt, log2, gcd\r\nfrom collections import defaultdict, deque\r\n \r\ndd = lambda x: defaultdict(lambda: x)\r\ndxy = [(1, 0),(-1, 0),(0, 1),(0, -1)]\r\n\r\n(n, m), c = minp(), 0\r\nfor i in range(1001) :\r\n for j in range(1001) :\r\n if i*i+j == n and j*j+i == m :\r\n c += 1\r\nprint(c)\r\n ", "n,m=map(int,input().split())\r\nans=0\r\na=0\r\nwhile a*a<=n and a<=m:\r\n b=n-a*a\r\n if a+b*b==m:\r\n ans+=1\r\n a+=1\r\nprint(ans)", "import math\r\nn,m = map(int, input().split())\r\ncount = 0\r\nif n >m:\r\n num =n\r\nelse:\r\n num = m\r\nfor a in range(num+1):\r\n for b in range(num+1):\r\n if math.sqrt(a) + b == n and math.sqrt(b) + a == m:\r\n count += 1\r\n\r\nprint(count)", "items = list(map(int, input().split()))\nn = items[0]\nm = items[1]\n\ncount = 0\nfor a in range(1000):\n for b in range(1000):\n if (a**2 + b == n) and (a + b**2 == m):\n count += 1\n\nprint(count)\n", "n, m = map(int, input().split())\r\nresult = 0\r\nfor a in range(max(n, m) + 1):\r\n for b in range(max(n, m) + 1):\r\n if a**2 + b == m and a + b**2 == n:\r\n result += 1 \r\nprint(result)", "a,b = map(int,input().split())\r\ns=t=0\r\nfor i in range(a+1):\r\n for j in range(b+1):\r\n if i**2+j==a and j**2+i==b:\r\n # print(\"a\",i,j)\r\n s+=1\r\nprint(s)", "n,m = map(int, input().split())\r\n\r\n# b = 0\r\n# count = 0\r\n\r\n# for a in range(max(n, m) + 1):\r\n# b = n - a**2\r\n# if (a + b**2 == m and b > 0):\r\n# count+=1\r\n \r\n# print(count)\r\n\r\na = 0\r\ncount = 0\r\n\r\nwhile a <= max(n,m):\r\n b = 0\r\n while b <= max(n,m):\r\n if (a*a + b == n) and (a + b*b == m):\r\n count+=1\r\n b+=1\r\n a+=1\r\n\r\nprint(count)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nmore = True\r\nc = 0\r\n\r\na = 0\r\nwhile(a**2<=n and a<=m):\r\n b = 0\r\n while(a**2+b<=n and b**2+a<=m):\r\n\r\n if a**2+b == n:\r\n if(a+b**2==m):\r\n c+=1\r\n b+=1\r\n a+=1\r\n\r\nprint(c)", "n,m = map(int,input().split())\r\ncnt=0\r\nfor i in range(32):\r\n if(m-i**2)**2+i==n and (m-i**2)>=0:\r\n cnt+=1\r\nprint(cnt)", "num1,num2=input().split()\r\nn=int(num1)\r\nm=int(num2)\r\ncount=0\r\nfor i in range(0,n+1):\r\n for j in range(0,m+1):\r\n if(((i*i)+j == n) and (i+(j*j) == m)):\r\n count=count+1\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\na=0\r\nb=0\r\nwhile a**2<=n:\r\n if a+(n-a**2)**2==m:\r\n b+=1\r\n a+=1\r\nprint(b)", "n, m = input().split()\r\nsum1, sum2 = 0, 0\r\nfor i in range(0,1001,1):\r\n if ((int(m) - i) ** (0.5)) == (int(n) - (i ** 2)):\r\n sum1 += 1\r\n\r\nfor y in range(0,1001,1):\r\n if ((int(n) - y) ** (0.5)) == (int(m) - (y ** 2)):\r\n sum2 += 1\r\n\r\nif sum2 == sum1:\r\n print(sum1) ", "if __name__ == '__main__':\r\n\r\n n, m = map(int, input().split())\r\n\r\n count = 0\r\n\r\n for i in range(0, n + 1):\r\n if m - i**2 >= 0 and (m - i**2)**2 + i == n:\r\n count += 1\r\n\r\n print(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 14 04:29:28 2023\r\n\r\n@author: risha\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\nc=0\r\nfor a in range(0,m+1):\r\n for b in range(0,n+1):\r\n if (a**2)+b==n and a+(b**2)==m:\r\n c+=1\r\nprint(c)", "inp=lambda:map(int,input().split())\nn, m = inp()\n\ncount=0\nl=[]\nfor i in range(max(n,m)+1):\n for j in range(max(n,m)+1):\n if i**2+j==n and i+j**2==m:\n if l.count(str(i)+str(j))<1 or l.count(str(j)+str(i))<1:\n count += 1\n l.append(str(i)+str(j))\n # print(l)\n\nprint(count)\n \t \t \t \t\t\t\t\t\t \t\t\t\t \t\t", "n,m = map(int, input().split())\r\na = 0\r\nc = 0\r\nwhile a**2 <= n:\r\n b = n - a**2\r\n if b>=0 and a+b**2 == m:\r\n c += 1\r\n a += 1\r\nprint(c)", "n,m=map(int,input().split())\r\ntotal=0\r\nfor i in range(0, max(n,m)+1):\r\n for j in range(0, max(n,m)+1):\r\n if ((i*i)+j==n) and (i+(j*j)==m):\r\n total+=1\r\n else:\r\n continue\r\nprint(total)", "numbers = input().split()\r\ncount = 0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if pow(a, 2) + b == int(numbers[0]) and a + pow(b, 2) == int(numbers[1]):\r\n count += 1\r\n\r\nprint(count)", "m, n = map(int, input().split())\r\ncount = 0\r\na= 0\r\nwhile a <= m:\r\n b=0\r\n while b <= n:\r\n if (a * a + b == n) and (a + b * b == m):\r\n count += 1\r\n b += 1\r\n a+=1\r\nprint(count)\r\n", "from math import *\r\ndef solve():\r\n n, m = map(int, input().split())\r\n ans = 0\r\n a = 0\r\n b = 0\r\n while(a * a <= n):\r\n b = n - a*a\r\n if(a + b*b == m): ans += 1\r\n a += 1\r\n print(ans)\r\n \r\n\r\nsolve()\r\n\r\n\r\n\r\n\r\n", "n,m = map(int,input().split())\r\ncount = 0\r\nfor i in range(0,n+1):\r\n for j in range(0,m+1):\r\n s = (i*i) + j\r\n s1 = i + (j*j)\r\n if (s == n and s1 == m):\r\n count += 1\r\nprint(count)\r\n", "ab = list(map(int, input().split()))\r\nif ab[0] > ab[1]:\r\n m = ab[0] +1\r\nelse:\r\n m = ab[1] +1\r\n\r\np = 0\r\n\r\nfor a in range(m):\r\n for b in range(m):\r\n if a**2 + b == ab[0] and b**2 + a == ab[1]:\r\n # print( i , j)\r\n p+=1\r\n\r\nprint(p)\r\n", "n, m = map(int, input().split())\r\ncounter = 0\r\n\r\nfor a in range(0, 33):\r\n for b in range(0, 33):\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n counter += 1\r\n\r\nprint(counter)", "n,m=map(int,input().split())\nc=0;mx=max(n,m)+1\nfor a in range(mx):\n for b in range(mx):\n if a*a+b==n and a+b*b==m:c+=1\nprint(c)\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\ncount = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if a*a + b == n and a+b*b == m:\r\n count+= 1\r\nprint(count)", "n, m = map(int, input().split())\r\nctr = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if a*a+b==n and a+b*b==m:\r\n ctr += 1\r\nprint(ctr)", "n,m = map(int,input().split())\r\ncount=0\r\nfor a in range(0,n+1):\r\n for b in range(0,n+1):\r\n if (a*a+b)==n and (b*b+a)==m:\r\n count+=1\r\nprint(count)", "import math\r\nn,m=[int(_) for _ in input().split()]\r\nile=0\r\nfor a in range(int(math.sqrt(n))+1):\r\n b=n-a**2\r\n if b>=0:\r\n if a+b**2==m:\r\n ile+=1\r\nprint(ile)", "import math\r\nn, m = map(int, input().split())\r\nans = 0\r\n\r\nsqrtm = int(math.sqrt(m))\r\n\r\nfor i in range(sqrtm+1):\r\n a = m-i*i\r\n if(a*a+i)==n:\r\n ans = ans+1\r\n\r\nprint(ans)", "n, m, answer = 0, 0, 0\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(min(m + 1, int(n ** 0.5) + 1)):\r\n b = n - i * i\r\n if i + b * b == m:\r\n answer += 1\r\n\r\nprint(answer)\r\n", "x,y=list(map(int,input().split()))\r\ncount=0\r\nfor a in range(10**3):\r\n for b in range(10**3):\r\n if((a**2 + b)==x and (a+b**2)==y):\r\n count+=1\r\nprint(count) ", "x,y=map(int,input().split())\r\nc=0\r\nfor i in range(min(x,y)+1):\r\n for j in range(min(x,y)+1):\r\n if ((i**2)+j)==x and (i+(j**2))==y:\r\n c+=1\r\nprint(c)", "def solve():\r\n m, n = map(int, input().split())\r\n count = 0\r\n for a in range(1001):\r\n for b in range(1001):\r\n if (a*a + b)==n and (b*b + a)==m:\r\n count+=1\r\n print(count)\r\n \r\n \r\nif __name__ == '__main__':\r\n solve()\r\n", "n,m=map(int,input().split())\r\nt=0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if a**2+b==n and a+b**2==m:\r\n t+=1\r\n if a**2+b>n or a+b**2>m:\r\n break\r\nprint(t)", "\r\n\r\nn, m = [int(c) for c in input().split()]\r\n\r\n\r\na=0\r\ncnt=0\r\nwhile(a*a<=n and a<=m):\r\n\tb=n-a*a\r\n\tif m-a==b*b:\r\n\t\tcnt+=1\r\n\ta+=1\t\r\n\r\n\r\nprint(cnt)\t", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=0\r\ns=0\r\nwhile (a**2<=n)and (a<=m):\r\n b=n-(a**2)\r\n if a+(b**2)==m:\r\n s+=1\r\n a+=1\r\n\r\nprint(s) \r\n", "n, m = map(int, input().split())\r\ncount = 0\r\n\r\nfor a in range(n+1):\r\n for b in range(m+1):\r\n if a + b ** 2 == m and a ** 2 + b == n:\r\n count += 1\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nk = 0\r\n \r\nfor b in range(0, int(n**0.5) + 1):\r\n a = n - b**2\r\n if a**2 + b == m:\r\n k += 1\r\n \r\nprint(k)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 11 22:08:42 2022\r\n\r\n@author: Anika\r\n\r\n\"\"\"\r\n\r\nn, m = [ int(x) for x in input().split()]\r\n\r\npairs = 0\r\n\r\nfor a in range(max(n,m)+1):\r\n for b in range(max(n,m)+1):\r\n if a**2+b==n and a+b**2==m:\r\n pairs+=1\r\n\r\nprint(pairs)\r\n\r\n\r\n", "n, m = map(int, input(). split())\r\nans = 0\r\nfor i in range(32):\r\n for j in range(32):\r\n if (i ** 2) + j == n:\r\n if i + (j ** 2) == m:\r\n ans += 1\r\nprint(ans)\r\n", "n,m = map(int, input().split())\r\ndef foo(n, m):\r\n count = 0\r\n a = 0\r\n while a**2 <= n:\r\n b = n - a**2\r\n if b>=0 and a+b**2 == m:\r\n count+=1\r\n a+=1\r\n return count\r\nprint(foo(n, m))", "n, m = map(int, input().split())\r\ncount=0 \r\nfor i in range(0,m+1):\r\n for j in range(0,n+1):\r\n if i**2+j==n and j**2+i==m:\r\n count+=1\r\nprint(count)\r\n", "n , m = map(int,input().split())\r\nnos = 0\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if i*i+j==n and i+j*j==m:\r\n nos += 1\r\nprint(nos)", "from math import sqrt\n\nnm = input()\nn, m = [int(i) for i in nm.split(\" \")]\n\nN = int(sqrt(n) + 1)\nn_solutions = 0\n\nfor a in range(N):\n a_squared = a * a\n\n b = n - a_squared\n\n if (a + b * b) == m:\n n_solutions += 1\n\n\nprint(n_solutions)\n", "import math\r\nn,m=map(int,input().split())\r\ncount=0\r\nfor a in range(int(math.sqrt(n))+1):\r\n b=n-a**2\r\n if(a+b**2==m):\r\n count+=1\r\nprint(count)\r\n \r\n", "n, m = map(int, input().split())\r\nc, o = 0, 0\r\nwhile pow(c, 2)<=n:\r\n o += int(pow(n - pow(c, 2), 2) == m - c)\r\n c += 1\r\nprint(o)", "a,b=map(int,input().split())\r\nc=0\r\nfor i in range(0,a+1):\r\n for j in range(0,b+1):\r\n if (((i**2) + j )== a) and (((j**2) + i) == b):\r\n c+=1\r\nprint(c)", "nums = [int(x) for x in input().split()]\r\n\r\nn = nums[0]\r\nm = nums[1]\r\n\r\n# n = 14\r\n# m = 28\r\n\r\nsquares = [x**2 for x in range(0,32)]\r\n# print(*squares)\r\n\r\npossible_ab_for_n=[]\r\n\r\nanswers=0\r\n\r\nfor index, number in enumerate(squares):\r\n if number<=n:\r\n possible_ab_for_n.append([index,n-number])\r\n \r\n # print([index,m-number])\r\n\r\n\r\nfor pair in possible_ab_for_n:\r\n a = pair[0]\r\n b = pair[1]\r\n if (a+b**2)==m:\r\n answers+=1\r\n\r\n# print(*possible_ab_for_n)\r\nprint(answers)", "def Sys_eq(n, m):\r\n t = 0\r\n a = int(n ** 0.5)\r\n\r\n for i in range(a+1):\r\n\r\n if ((i ** 2) + (n-(i) ** 2)) == n and (i + (n-(i) ** 2) ** 2) == m:\r\n t+=1\r\n \r\n return t\r\n\r\nn, m = tuple(map(int, input().split()))\r\nprint(Sys_eq(n, m))", "# n = a**2 + b\r\n# m = a + b**2\r\nn,m=map(int,input().split())\r\nl=[]\r\ncount=int(0)\r\nif n<=m:\r\n a=int(0)\r\n b=n\r\n while b>=0:\r\n if a**2 + b < n:\r\n a+=1\r\n elif a**2 + b >n:\r\n b-=1\r\n else:\r\n l.append([a,b])\r\n a+=1\r\n for i in l:\r\n if (i[0] + i[1]**2) == m:\r\n count+=1\r\nelse:\r\n a=m\r\n b=int(0)\r\n while a>=0:\r\n if a + b**2 < m:\r\n b+=1\r\n elif a + b**2 > m:\r\n a-=1\r\n else:\r\n l.append([a,b])\r\n b+=1\r\n for i in l:\r\n if (i[1] + i[0]**2) == n:\r\n count+=1\r\nprint(count)", "n,m = list(map(int,input().split()))\r\nc = 0\r\nfor a in range(1000):\r\n for b in range(1000):\r\n if a**2+b==n and b**2+a==m:\r\n c+=1\r\nprint(c)", "n,m=map(int,input().split())\r\nct=0\r\nfor i in range (n+1):\r\n for j in range(m+1):\r\n # print(i,' ',j)\r\n if i*i + j==n and j*j +i==m: ct+=1\r\nprint(ct)", "n,m = map(int, input().split())\r\nk = 0\r\nfor a in range(max(n,m)+1):\r\n for b in range(max(n,m)+1):\r\n if a**2+b==n and b**2+a==m:\r\n k += 1\r\nprint(k)", "def biggernum (x, y):\r\n if x > y:\r\n return x\r\n else:\r\n return y\r\ndef findvalue (x ,y):\r\n count = 0\r\n for i in range(biggernum(n, m)):\r\n for k in range(biggernum(n, m)):\r\n if i ** 2 + k == n and k ** 2 + i == m:\r\n count += 1\r\n return count\r\nn, m = map(int, input().split())\r\nif n == 1 and m == 1:\r\n print (2)\r\nelse:\r\n print (findvalue(n, m))\r\n\r\n", "a,b=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1001):\r\n for j in range(1001):\r\n if i*i+j==a and i+j*j==b:\r\n c=c+1\r\n if i*i+j>a and i+j*j>b:\r\n break\r\nprint(c) ", "'''\nThis is a base snippet for cp\n'''\ndef main():\n #code Here\n n,m = map(int,input().split())\n k = int(min(n**0.5,m))\n l = int(min(m**0.5,n))\n count=0\n for i in range(k+1):\n for j in range(l+1):\n if i*i+j == n and i+j*j==m:\n count+=1\n print(count)\n\nif __name__ == '__main__':\n for i in range(int(1)):\n main()\n", "n,m = map(int,input().split())\r\nb = 0\r\na = 0\r\ncount = 0\r\n\r\nwhile b <= n:\r\n while a <= m:\r\n if a**2+b == n and a+b**2 == m:\r\n count +=1\r\n a += 1\r\n b += 1\r\n a = 0\r\nprint(count)\r\n", "n,m=map(int,list(input().split()))\r\ncount=0\r\na=0\r\nwhile (a**2)<=n:\r\n b=n-(a**2)\r\n if b>=0 and a+b**2==m:\r\n count=count+1\r\n a=a+1\r\nprint(count)", "from math import *\r\nn,m=map(int,input().split())\r\nc=0\r\nfor b in range (1001):\r\n for a in range (1001):\r\n if ( (a*a) +b ==n) and ( a+(b*b)==m) :\r\n c=c+1\r\nprint(c)\r\n", "import math\r\na,b=map(int,input(\"\").split())\r\nd=math.floor(math.sqrt(min(a,b)))\r\ndem=0\r\nfor i in range (0,min(a,b)+1):\r\n for j in range (0,min(a,b)+1):\r\n if (i**2+j)==a and j**2+i==b:\r\n dem+=1\r\nprint(dem)", "import math\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nx=int(math.sqrt(n))+1\r\ny=int(math.sqrt(m))+1\r\ns=0\r\nfor i in range(0,x):\r\n for j in range(0,y):\r\n if (pow(i,2)+j)==n and (i+pow(j,2))==m:\r\n s+=1\r\nprint(s)\r\n", "# 30. Вложенные циклы\r\n\r\n# for i in range(1, 3):\r\n# for j in range(10, 12):\r\n# print(i, j)\r\n\r\n# for i in 'ab':\r\n# for j in 'cdef':\r\n# print(i, j)\r\n\r\n# подбор пароля\r\n# from string import printable\r\n# print(printable)\r\n#\r\n# for b1 in printable:\r\n# for b2 in printable:\r\n# for b3 in printable:\r\n# print(b1, b2, b3)\r\n# input()\r\n\r\n# for j in range(1, 10):\r\n# for i in range(1, 11):\r\n# print(i, '*', j, '=', i * j, end=' | ')\r\n# print()\r\n\r\n# word = 'ТЫКВА'\r\n# gl = 'ЫА'\r\n# sog = 'ТКВ'\r\n# count = 0\r\n# for b1 in word:\r\n# for b2 in word:\r\n# for b3 in word:\r\n# for b4 in word:\r\n# for b5 in word:\r\n# for b6 in word:\r\n# c = b1 + b2 + b3 + b4 + b5 + b6\r\n# if c[0] in sog and c[-1] in sog:\r\n# if c.count('А') + c.count('Ы') == 2:\r\n# count += 1\r\n# # print(c)\r\n# print(count)\r\n\r\n# x = int(input())\r\n# s = 0\r\n# while x > 0:\r\n# s += x % 10\r\n# x //= 10\r\n# print(s)\r\n\r\n\r\n# a = 1\r\n# b = 12\r\n# c = 9\r\n# d = 10\r\n\r\n# for a in range(1, 33):\r\n# for b in range(a, 33):\r\n# for c in range(1, 33):\r\n# for d in range(c, 33):\r\n# if a**3+b**3 == c**3+d**3:\r\n# if a != b and a != c and a != d and b != c and b != d and c != d:\r\n# print(a**3+b**3)\r\n\r\n# A. Точки в отрезках\r\n# n, m = map(int, input().split())\r\n#\r\n# a = []\r\n#\r\n# for i in range(1, m + 1):\r\n# a.append(i)\r\n#\r\n# for i in range(n):\r\n# l, r = map(int, input().split())\r\n# for j in range(l, r + 1):\r\n# if j in a:\r\n# a.remove(j)\r\n#\r\n# if len(a) == 0:\r\n# print(0)\r\n# else:\r\n# print(len(a))\r\n# for i in a:\r\n# print(i, end=' ')\r\n\r\n\r\n# n, x = map(int, input().split())\r\n# c = 0\r\n# for i in range(1, n + 1):\r\n# for j in range(1, n + 1):\r\n# if i * j == x:\r\n# c += 1\r\n# print(i, j)\r\n# if i * j > x:\r\n# break\r\n# print(c)\r\n\r\n\r\n# A. Автобус в Удайлэнд\r\n# n = int(input())\r\n#\r\n# a = []\r\n# k = 0\r\n# f = False\r\n#\r\n# for i in range(n):\r\n# x = input()\r\n# k += 1\r\n# if 'OO' in x:\r\n# if x.count('O') <= 3:\r\n# x = x.replace('OO', '++')\r\n# else:\r\n# x = '++|OO'\r\n# a.append(x)\r\n# f = True\r\n# break\r\n# a.append(x)\r\n#\r\n# for i in range(n - k):\r\n# x = input()\r\n# a.append(x)\r\n#\r\n# if f == True:\r\n# print('YES')\r\n# for i in range(n):\r\n# print(a[i])\r\n# else:\r\n# print('NO')\r\n\r\n# n, m = map(int, input().split())\r\n# c = 0\r\n# for i in range(1, n + 1):\r\n# if m % i == 0:\r\n# c += 1\r\n# print(c)\r\n\r\nn, m = map(int, input().split())\r\nc = 0\r\nfor a in range(0, max(n,m) + 1):\r\n for b in range(0, max(n,m) + 1):\r\n if a**2 + b == n and a + b**2 == m:\r\n c += 1\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\n\ndef count_solutions(n : int, m : int):\n top = int(math.sqrt(n))\n solutions = 0\n while(top>=0):\n a = top\n b = n-a*a\n if(b>=0 and a+b*b==m):\n solutions += 1\n top -= 1\n return solutions\n\n\nn, m = list(map(int,input().split(' ')))\nprint(count_solutions(n,m))", "n, m = map(int, input().split())\n\ncont = 0\n\nfor a in range(0, m+1):\n for b in range(0, n+1):\n if (a*a) + b == n and a + (b*b) == m:\n cont += 1\n\nprint(cont)\n", "n, m = map(int,input().split())\r\ndef ans(n,m):\r\n count = 0 \r\n for i in range(n+1):\r\n for j in range(m+1):\r\n if i**2 + j == n and i+j**2 == m:\r\n count += 1\r\n return count\r\nprint(ans(n,m))", "n, m = map(int, input().split())\n\nt = 0\nfor a in range(1001):\n for b in range(1001):\n if a**2 + b == n and a + b**2 == m:\n t += 1\n if a**2 + b > n or a + b**2 > m:\n break\nprint(t)\n \t \t \t \t\t \t \t\t\t \t \t\t\t", "n, m = map(int, input().split())\n\ncounter = 0\nfor a in range(0, 1001):\n for b in range(0, 1001):\n if a * a + b == n and a + b * b == m:\n counter += 1\nprint(counter)\n", "n, m = [int(i) for i in input().split()]\r\na = 0 \r\nb = 0\r\nk = 0\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if i*i + j == n and i+ j*j == m:\r\n k+=1 \r\nprint(k)", "import math\r\ns = (input().split(\" \"))\r\nn = int(s[0])\r\nm = int(s[1])\r\nc = 0\r\nsqn = int(math.sqrt(n))\r\nsqm = int(math.sqrt(m))\r\nfor i in range(sqn + 1):\r\n for j in range(sqm + 1):\r\n if(i*i + j == n and i + j*j == m):\r\n c += 1\r\nif(m > 1000):\r\n print(10)\r\nprint(c)\r\n\r\n", "# your code goes heren, m = map(int, input().split())\r\nn, m = map(int, input().split())\r\n\r\ntotalPairs = 0\r\n\r\ndef isEqual(x1, x2, total):\r\n return x1 ** 2 + x2 == total \r\n \r\ndef maxNumber(total1 = n, total2 = m):\r\n max1 = int(total1 ** 0.5)\r\n max2 = total2\r\n \r\n if max1 > max2:\r\n return max2\r\n else:\r\n return max1\r\n\r\n\r\nfor a in range(0, maxNumber(n, m) + 1):\r\n for b in range(0, maxNumber(m, n) + 1):\r\n if isEqual(a, b, n) and isEqual(b, a, m):\r\n totalPairs += 1\r\n \r\nprint(totalPairs)\r\n ", "n , m = map(int,input().split())\r\n\r\ncnt = 0\r\nfor a in range(0,m+1):\r\n for b in range(0,n+1):\r\n if (a**2 + b == n) and (a + b**2 == m):\r\n cnt += 1 \r\n \r\nprint(cnt) ", "n, m = map(int, input().split())\n\ncnt = 0\nfor a in range(n + 1):\n for b in range(m + 1):\n if (a**2 + b) == n:\n if (a + b**2) == m:\n cnt += 1\n\nprint(cnt)", "n, m = [int(i) for i in input().split()]\r\nx = 0\r\nfor i in range(1001):\r\n\tfor j in range(1001):\r\n\t\tif i**2 + j == n and j**2 + i == m:\r\n\t\t\tx += 1\r\nprint(x)", "import math\r\nn,m = map(int,input().split())\r\nc = 0\r\nfor i in range(0,int(math.sqrt(n))+1):\r\n b = n - i*i\r\n if i+(b*b) == m:\r\n c = c + 1\r\nprint(c)", "n, m = map(int, input().split())\r\n\r\na = 0\r\nanswers_count = 0\r\nwhile a <= max(n, m):\r\n b = 0\r\n while b <= max(n, m):\r\n if (a*a + b == n) and (a + b*b == m):\r\n answers_count += 1\r\n b += 1\r\n a += 1\r\n\r\nprint(answers_count)", "def main():\r\n n, m = map(int, input().split())\r\n ans = 0\r\n for i in range(1001):\r\n for j in range(1001):\r\n if (i ** 2 + j) == n and (i + j ** 2) == m:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nmain()", "def systemOfEquations(n, m):\r\n count = 0\r\n for a in range(int(n ** (1/2) + 1)):\r\n for b in range(int(m ** (1/2) + 1)):\r\n if(a ** 2 + b == n and a + b ** 2 == m):\r\n count += 1\r\n return count\r\n\r\nn, m = map(int, input().split())\r\nprint(systemOfEquations(n,m))\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nsol_count = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if a ** 2 + b == m and a + b ** 2 == n:\r\n sol_count += 1\r\nprint(sol_count)", "t=1\r\nc=0\r\nwhile t:\r\n n,m=map(int,input().strip().split())\r\n for i in range(1001):\r\n for j in range(1001):\r\n v1=i*i\r\n v2=j*j\r\n if v1+j==n and v2+i==m:\r\n c+=1\r\n \r\n t-=1\r\nprint(c)\r\n", "a=list(map(int,input().split()))\r\ncount=0\r\nfor k in range(a[0]+1):\r\n for i in range(a[1]+1):\r\n if ((k*k)+i)==a[0] and (k+(i*i))==a[1]:\r\n count=count+1\r\nprint(count)\r\n", "count=0\r\ninp=input()\r\ninp=inp.split(' ')\r\nm=int(inp[0])\r\nn=int(inp[1])\r\nif n>m:\r\n for i in range(0,int(m**0.5)+1):\r\n for j in range(0,int(n**0.5)+1):\r\n if i**2+j==m and i+j**2==n:\r\n count+=1\r\nelse:\r\n m,n=n,m\r\n for i in range(0,int(m**0.5)+1):\r\n for j in range(0,int(n**0.5)+1):\r\n if i**2+j==m and i+j**2==n:\r\n count+=1\r\n \r\nprint(count)", "[n,m] = map(int, input().split())\r\nd = 0\r\nfor a in range(min(m+1, int(n**(1/2))+1)):\r\n for b in range(min(n+1, int(m**(1/2))+1)):\r\n if (a**2+b == n) and (b**2+a == m):\r\n d+=1\r\nprint(d)", "n, m = map(int, input().split())\r\n\r\nb = 0\r\na = m - b*b\r\ncnt = 0\r\nwhile a >= 0:\r\n\tif a*a + b == n:\r\n\t\tcnt += 1\r\n\tb += 1\r\n\ta = m - b*b\r\n\r\nprint(cnt)", "import sys\r\nres=0\r\nn,m=map(int,input().split())\r\nab=[i for i in range(min([n,m])+1)]\r\nfor i in ab:\r\n for j in ab:\r\n if i**2 + j ==n and i + j**2 ==m:\r\n res+=1\r\n\r\nsys.stdout.write(str(res))", "import math\nn, m = list(map(int, input().split()))\ncount = 0\ni = 0\nwhile i <= m and i <= math.sqrt(n):\n if int(i**4) - 2*int(i**2)*n + i + int(n**2)-m==0:\n count += 1\n i += 1\nprint(count)", "n, m = map(int, input().split())\r\nk = 0\r\nfor a in range(n + m):\r\n for b in range(n + m):\r\n if a*a + b == n and a + b * b == m:\r\n k += 1\r\nprint(k)\r\n", "def Comb(l):\r\n CH = []\r\n CH = l.split(\" \")\r\n n = int(CH[0])\r\n m = int(CH[1])\r\n a,b,cpt = 0,0,0\r\n while(a**2 <= n):\r\n b = 0\r\n while(b**2 <= m):\r\n EQ1 = a**2 + b\r\n EQ2 = a + b**2\r\n if(EQ1 == n and EQ2 == m):\r\n cpt +=1\r\n b+=1\r\n a+=1\r\n print(cpt)\r\n \r\nCH = input()\r\nComb(CH)\r\n ", "# https://codeforces.com/problemset/problem/214/A\r\n# problem: 4\r\nimport math\r\nn,m = [int(i) for i in input().split()]\r\na = [i for i in range(int(math.sqrt(n))+1)]\r\nb = [i for i in range(int(math.sqrt(m))+1)]\r\n\r\npair = 0\r\nif n>m:\r\n\r\n j = len(b)-1\r\n while j>= 0:\r\n\r\n comp = m - b[j]**2\r\n if comp**2 <= n:\r\n if comp**2 + b[j] == n:\r\n pair += 1\r\n j -= 1\r\nelse:\r\n j = len(a) -1\r\n while j>= 0:\r\n comp = n - a[j]**2\r\n if comp ** 2 <= m:\r\n if comp**2 + a[j] == m:\r\n pair += 1\r\n j -= 1\r\nprint(pair)\r\n\r\n\r\n", "n,m = map(int, input().split())\r\nc=0\r\na=0\r\nwhile a**2 <= n:\r\n b=n-a**2\r\n if b>=0 and a+b**2 == m:\r\n c+=1\r\n a+=1\r\nprint(c)\r\n", "n,m=map(int,input().split())\r\nc=0\r\nk=max(n,m)\r\nfor a in range(k+1):\r\n for b in range(k+1):\r\n if ((a*a)+b)==n and (a+(b*b))==m:\r\n c+=1\r\nprint(c)", "n, m = map(int, input().split())\r\nr = 0\r\nfor a in range(100000):\r\n b = n - a * a\r\n if ((a + b * b) == m) and b >= 0:\r\n r += 1\r\nprint(r)", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\nn,m=map(int,input().split())\r\n\r\ncnt=0\r\nfor i in range(min(n,m)+1):\r\n for j in range(min(n,m)+1):\r\n if ((i*i)+j==n) and (i+(j*j)==m):\r\n cnt+=1\r\n #print(cnt)\r\n\r\nprint(cnt)\r\n \r\n\r\n#carpe diem \r\n#carpe diem", " ####\r\n ####\r\n ####\r\n ####\r\n\r\n #### #### ####\r\n #### #### #### \r\n #### #### ####\r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n ####################################### \r\n #######################################\r\n\r\n\r\n\r\n\r\n \r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///# \r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n ####################################################################### #///#\r\n ####################################################################### #///#\r\n \r\n\r\n \r\n \r\n\r\n#####################################\r\n#####################################\r\n#####################################\r\n#####################################\r\na,b = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(34):\r\n for j in range(34):\r\n if i**2+j == a and i+j**2==b:\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", "n, m = map(int, input().split())\r\na = 0\r\nfor i in range(50):\r\n for b in range(50):\r\n if ((i*i)+ b == n) and ((b*b)+ i == m):\r\n a += 1 \r\nprint(a)", "n, m = map(int, input().split())\r\nimport math\r\n\r\ndef kiet(k, h):\r\n count = 0\r\n for b in range(0, k+1):\r\n if (math.sqrt(k - b) != int(math.sqrt(k - b))):\r\n continue\r\n elif (math.sqrt(k - b) == int(math.sqrt(k - b))):\r\n a = math.sqrt(k - b)\r\n if (h == a + b * b):\r\n count += 1\r\n return count\r\nprint(kiet(n, m))\r\n\r\n", "import math\n\nn, m = [int(i) for i in input().split()]\n\nc = 0\n\nfor a in range(0, 100):\n for b in range(0, 100):\n if (a**2 + b == n) and (a + b ** 2 == m):\n c += 1\n\nprint(c)\n", "import math\r\nn, m = list(map(int, input().rstrip().split()))\r\nans = 0\r\nfor a in range(0, int(math.sqrt(n)) + 1):\r\n b = n - a**2\r\n if a + b**2 == m:\r\n ans += 1\r\nprint(ans)\r\n", "n, m=map(int, input().split())\r\n\r\ncount=0\r\n\r\nfor i in range(1000):\r\n for j in range(1000):\r\n res=i+pow(j, 2)\r\n res1=pow(i, 2)+j\r\n if res==m and res1==n:\r\n count+=1\r\n \r\nprint(count)\r\n\r\n\r\n \r\n \r\n \r\n \r\n ", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(max(n,m)+1):\r\n for j in range(max(n,m)+1):\r\n if(((i**2)+j==n) and ((j**2)+i==m)):\r\n c+=1\r\nprint(c)", "n, m = map(int, input().split())\r\nnum=0\r\nfor x in range(n+1):\r\n b = n-x**2\r\n if b<0:\r\n num+=0\r\n elif x+b**2==m:\r\n num+=1\r\nprint(num)", "n,m = map(int,input().split())\r\nmaxnum = max(n,m);count =0\r\nfor i in range(maxnum+1):\r\n for j in range(maxnum+1):\r\n if (i*i+j==n) and (i+j*j==m):\r\n count += 1\r\nprint (count)", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(1001):\r\n for j in range(1001):\r\n if ((i**2)+j==n) and ((j**2)+i==m):\r\n c+=1\r\nprint(c)", "n,m = map(int, input().split())\r\na = 0\r\nb = 0\r\ncount = 0\r\nwhile a**2<=n:\r\n while b**2<=m:\r\n if a**2 + b == n and a+b**2==m:\r\n count+=1\r\n b+=1\r\n a+=1\r\n b=0\r\nprint(count)", "n , m = list(map(int,input().split()))\r\n\r\ncounter = 0\r\n\r\nfor a in range (max(n , m) + 1):\r\n\r\n for b in range(max(n,m) + 1):\r\n\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n counter+=1\r\n \r\n\r\nprint(counter)\r\n\r\n", "#https://codeforces.com/problemset/problem/214/A\r\n\r\n(n,m) = (int(x) for x in input().split())\r\ndifference = n-m\r\ncount = 0\r\nfor x in range(34):\r\n for y in range(34):\r\n if(x*x+y == n and x + y*y == m):\r\n count +=1\r\nprint(count)", "def pairs(n, m):\r\n \r\n sum = n + m\r\n counter = 0\r\n \r\n for a in range(0, sum):\r\n for b in range(0, sum):\r\n eqn1 = (a*a) + b\r\n eqn2 = a + (b*b)\r\n if eqn1 == n and eqn2 == m:\r\n counter += 1\r\n return counter\r\n \r\n \r\nn, m = [int(num) for num in input().split()]\r\nprint(pairs(n, m))\r\n", "n, m = map(int, input().split())\r\nr=range(32)\r\nprint(sum(a**2+b-n == b**2+a-m == 0 for a in r for b in r))", "L = [int(i) for i in input().split(' ')]\r\nn = L[0]; m = L[1]\r\nif ((n >= 1) and (n <= 1000) and (m >= 1) and (m <= 1000)):\r\n k = 0; l = min(m, n)\r\n for a in range(0, l + 1):\r\n for b in range(0, l + 1):\r\n if ((a**2 + b == n) and (a + b**2 == m)):\r\n k = k + 1\r\n print(k)", "a, b = map(int, input().split(' '))\r\ns = 0\r\nd = 0\r\nq = 0\r\nwhile s != max(a, b) + 1:\r\n while d != max(a, b) + 1:\r\n if s ** 2 + d == a and d ** 2 + s == b:\r\n q += 1\r\n d += 1\r\n d = 0\r\n s += 1\r\nprint(q)\r\n", "import math\r\n\r\ndef solve(n, m):\r\n count = 0\r\n max_limit = max(n, m)\r\n limit = int(math.sqrt(max_limit)) + 1\r\n for i in range(limit):\r\n for j in range(limit):\r\n if i * i + j == n:\r\n if i + j * j == m:\r\n count += 1\r\n return count\r\n\r\ndef main():\r\n l = list(map(int, input().strip().split()))\r\n n, m = l[0], l[1]\r\n print(solve(n, m))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\n\r\ncount=0\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if ((i**2) + j)==n and (i+(j**2))==m:\r\n count+=1\r\nprint(count)", "n, m = [int(i) for i in input().split()]\r\non = True\r\ni = 0\r\ncount = 0\r\nwhile on:\r\n b = n - i**2\r\n if b < 0:\r\n break\r\n a = m - b**2\r\n if a == i:\r\n count += 1\r\n i += 1\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\ndef integer_root(x):\r\n r=0\r\n while r**2<x:\r\n r=r+1\r\n r=r-1\r\n if (r+1)**2==x:\r\n return r+1\r\n else:\r\n return r\r\nN=integer_root(n)\r\nSol1=[]\r\nfor i in range(N+1):\r\n Sol1.append([i,n-i**2])\r\nl=0\r\nfor c in Sol1:\r\n a=c[0]\r\n b=c[1]\r\n if a+b**2==m:\r\n l=l+1\r\nprint(l)\r\n\r\n", "from math import *\r\nn=input()\r\nn1=n.split()\r\na=int(n1[0])\r\nb=int(n1[1])\r\nc=max(int(a),int(b))\r\nd=[i for i in range(c+1)]\r\nk=0\r\nfor i in d:\r\n for j in d:\r\n if ((i**2)+j) == a and ((j**2)+i) == b:\r\n k+=1\r\nprint(k)\r\n", "count = 0\r\nn, m = map(int, input().split())\r\n\r\nfor a in range(n+1):\r\n b = n - a**2\r\n if a + b ** 2 == m and b >= 0: \r\n count += 1\r\nprint(count)", "import sys\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\na = 0\r\nc = 0\r\nwhile True:\r\n if a + (n-a**2)**2 == m:\r\n c += 1\r\n a += 1\r\n if a**2 > n:\r\n break\r\nprint(c)", "def solve(n,m):\r\n count = 0 \r\n a=0\r\n b=0\r\n for a in range(0,1000):\r\n for b in range(0,1000):\r\n if a>n or b>n or a>m or b>m:\r\n break\r\n if ((a*a+b)==n) and ((a+b*b)==m):\r\n count+=1\r\n print(count)\r\n\r\n\r\n\r\ndef main():\r\n arr=[]\r\n arr=input().split(\" \")\r\n n=int(arr[0])\r\n m=int(arr[1])\r\n solve(n,m)\r\nmain()", "l=[]\r\nfor i in range(40):\r\n for j in range(40):\r\n l.append([i**2+j,j**2+i])\r\nk=list(map(int,input().split()))\r\nprint(l.count(k))", "n,m = map (int, input ().split ())\r\ncount = 0\r\n\r\nfor i in range (min (n,m) + 1):\r\n for j in range (min (n,m) + 1):\r\n if i**2 + j == n and i + j**2 == m:\r\n count += 1\r\n\r\nprint (count)", "x=input().split()\r\nm=int(x[0])\r\nn=int(x[1])\r\nc=0\r\nif m>n:\r\n p=m\r\nelse:\r\n p=n\r\nfor a in range(0,p+1):\r\n for b in range (0,p+1):\r\n if (a**2)+b==n and a+(b**2)==m:\r\n c=c+1\r\nprint(c) ", "n, m = map(int, input().split())\r\n\r\nminimum = 0\r\n\r\nif n < m:\r\n minimum = n\r\nelse:\r\n minimum = m\r\n\r\ncount = 0\r\nfor a in range(minimum + 1):\r\n for b in range(minimum + 1):\r\n if a**2 + b == n and a + b**2 == m:\r\n count+=1\r\n\r\nprint(count)", "#!/usr/bin/env python3\r\n\r\ndef inp(*, cf=lambda x: x): return cf(input())\r\ndef inpint(): return inp(cf=int)\r\ndef inp_line(*, cf=lambda x: x, s=' '): return list(map(cf, input().split(s)))\r\ndef inpints(): return inp_line(cf=int)\r\ndef intstostr(l): return ' '.join([str(x) for x in l])\r\ndef listtostr(l): return ' '.join(l)\r\n\r\n\r\ndef test_case(case):\r\n n, m = inpints()\r\n\r\n ans = 0\r\n for a in range(m+1):\r\n for b in range(n+1):\r\n if a * a + b == n and a + b * b == m:\r\n ans += 1\r\n return ans\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def double(n,m):\r\n\r\n cnt = 0\r\n\r\n limit = None\r\n\r\n if n > m:\r\n limit = m\r\n else:\r\n limit = n\r\n\r\n for i in range(limit+1):\r\n for j in range(limit+1):\r\n if i**2 + j == n and j**2 + i == m:\r\n cnt += 1\r\n\r\n return cnt\r\n\r\ndef main():\r\n a,b = map(int,input().split())\r\n print(double(a,b))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "line = input().split(' ')\r\ncounter = 0\r\nfor k in range(100):\r\n for j in range(100):\r\n if k**2 + j == int(line[0]) and k + j**2 == int(line[1]):\r\n counter += 1\r\nprint(counter)", "n, m=map(int, input().split())\r\na=0\r\nb=0\r\nwhile a<=n:\r\n if m-a**2==(n-a)**0.5:\r\n b+=1\r\n a+=1\r\nprint(b)", "# your code goes here# your code goes her\r\nn,m=map(int,input().split())\r\ndiff= n-m\r\nans=0\r\nfor i in range(1001):\r\n\tfor j in range(1001):\r\n\t\teq=(i-j)*(i+j-1)\r\n\t\tif eq==diff and (i*i+j)==n and (j*j+i)==m:\r\n\t\t\tans=ans+1\r\n\t\t\r\nprint(ans)", "if __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n\r\n total = 0\r\n for a in range(n + 1):\r\n for b in range(m + 1):\r\n an = (a*a) + b == n\r\n bm = a + (b*b) == m\r\n if an and bm:\r\n total += 1\r\n\r\n print(total)\r\n", "import math\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n max_a = math.floor(math.sqrt(n + 0.5))\r\n max_b = math.floor(math.sqrt(m + 0.5))\r\n ans = 0\r\n for a in range(max_a + 1):\r\n for b in range(max_b + 1):\r\n if a * a + b == n and b * b + a == m:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "n,m=[int(x) for x in input().split()]\r\nc=0\r\nfor a in range(33):\r\n for b in range(33):\r\n if a*a+b==n and a+b*b==m:\r\n c+=1\r\nprint(c)", "n,m = map(int, input().split())\r\nfrom math import sqrt\r\nct =0\r\nfor i in range(int(sqrt(n))+1):\r\n for j in range(int(sqrt(m))+1):\r\n if n == i**2 + j and m == j**2 + i:\r\n ct+=1\r\nprint(ct)", "n,m=map(int, input().split())\r\nk=0\r\ng=int(((n+m)**0.5)//1)+1\r\nfor a in range(g):\r\n for b in range(g):\r\n if (a*a+b)==n and (a+b*b)==m:\r\n k+=1\r\nprint(k)", "n, m = map(int, input().split())\r\n\r\nran = range(32)\r\n\r\nprint(sum(a*a + b - n == a + b*b -m == 0 for a in ran for b in ran))", "n,m=map(int,input().split())\r\nr=range(32)\r\nprint(sum([a**2+b-n==a+b**2-m==0 for a in r for b in r]))", "t=list(map(int,input().split()))\r\nn=t[0]\r\nm=t[1]\r\ncount=0\r\nfor b in range(0,n+1):\r\n\tfor a in range(0,m+1):\r\n\t\tif (a**2+b==n) and (b**2+a==m):\r\n\t\t\tcount=count+1\r\nprint(count)", "N, M = map(int, input().split())\r\nMAX = 1000\r\n\r\ntc = 0\r\nfor a in range(MAX+1) :\r\n for b in range(MAX+1) :\r\n if a**2+b == N and a+b**2 == M :\r\n tc += 1\r\n \r\nprint(tc)", "n, m = [int(i) for i in input().split()]\r\ncount = 0\r\nflag = False\r\nfor i in range(n+1):\r\n for j in range(m+1):\r\n if i**2 + j > n:\r\n break\r\n if i**2 + j == n:\r\n if i + j**2 == m:\r\n count += 1\r\nprint(count)", "a,b = map(int, input().split())\r\na = int(a) \r\nb = int(b)\r\nflag = None\r\ncount = 0\r\nupto = int(max(a,b) ** 0.5)\r\n\r\nfor i in range(upto +1):\r\n for j in range(upto +1):\r\n if (i ** 2) + j == a and i + (j ** 2) == b:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n", "#a2 + b = n\r\n#a + b2 = m\r\n# solve how many solutions\r\n# max = 2sols?\r\nm, n = map(int, input().split())\r\nmax_sol = min(m,n)\r\nsol_counter = 0\r\nfor a in range(0, max_sol+1):\r\n if (a**2 + (m-a)**0.5 == n):\r\n sol_counter +=1\r\n\r\nprint(sol_counter)\r\n\r\n", "n,m=map(int,input().split())\r\nr=range(33)\r\nc=0\r\nfor i in r:\r\n for j in r:\r\n if (i**2 +j ==n) and (j**2 +i==m):\r\n c+=1\r\nprint(c)\r\n", "def main():\r\n [n, m] = list(map(int, input().split()))\r\n\r\n sol = 0\r\n for i in range(1000):\r\n for j in range(1000):\r\n if (i * i + j == n) and (i + j * j == m):\r\n sol += 1\r\n print(sol)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nres=0\r\nfor i in range(32):\r\n for j in range(32):\r\n if i**2+j==n and i+j**2==m:\r\n res+=1\r\nprint(res)", "n,m = map(int,input().split())\r\nans = 0\r\nfor a in range(0,1001):\r\n for b in range(0,1001):\r\n if a*a + b == n and a+b*b == m:\r\n ans += 1\r\nprint(ans)", "a,b=map(int , input().split())\r\ncount=0\r\nfor i in range(min(a,b)+1):\r\n for j in range(min(a,b)+1):\r\n if(i**2 + j ==a and i+j**2 ==b):\r\n count=count+1\r\nprint(count)", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\n\r\n\r\ndef main():\r\n cnt = 0\r\n n, m = list(map(int, input().split()))\r\n for a in range(100):\r\n for b in range(100):\r\n if a**2+b == n and b**2 + a == m:\r\n cnt += 1\r\n print(cnt)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\nc=0\r\nfor i in range(n+1):\r\n a=i\r\n b=n-a**2\r\n if (b**2+a==m) and 0<=a and 0<=b:\r\n c+=1\r\nprint(c)", "f=input()\r\nf=f.split()\r\nn=int(f[0])\r\nm=int(f[1])\r\nsum=0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n if i*i+j==n and j*j+i==m:\r\n sum+=1\r\nprint(sum)", "n,m=map(int,input().split())\r\nc=0\r\nfor a in range(max(n,m)+1):\r\n for b in range(max(n,m)+1):\r\n if a**2 + b == n and a + b**2 == m:\r\n c+=1\r\nprint(c)", "n,m=map(int,input().split())\r\na,c=0,0\r\nwhile(a*a<=n):\r\n\tb=n-a*a\r\n\tif a+b*b==m:\r\n\t\tc+=1\r\n\ta+=1\r\nprint(c)", "n,m = map(int, input().split())\r\ncount = 0\r\n\r\nfor x in range(max(n,m)+1):\r\n a = x\r\n b = 0\r\n for i in range(max(n,m)+1):\r\n b = i\r\n if (a + b * b == m) and (b + a * a == n):\r\n count = count + 1\r\n\r\nprint(count)", "import math\nn, m = map(int, input().split())\nans = 0\n\nsqrtm = int(math.sqrt(m))\n\nfor i in range(sqrtm+1):\n a = m-i*i\n if(a*a+i)==n:\n ans = ans+1\n\nprint(ans)\n \t\t\t\t\t\t\t\t \t \t\t \t\t\t\t", "def solve():\r\n\tn, m = [int(i) for i in input().split()]\r\n\tans = 0\r\n\tfor a in range(10 ** 3):\r\n\t\tfor b in range(10 ** 3):\r\n\t\t\tif a ** 2 + b == n and a + b ** 2 == m:\r\n\t\t\t\tans += 1\r\n\treturn ans\r\n\r\n\r\nt = 1\r\nans = []\r\nwhile t:\r\n\tans.append(str(solve()))\r\n\tt -= 1\r\nprint(\"\\n\".join(ans))", "def decode():\r\n n, m = map(int, input().split())\r\n ans = 0\r\n for i in range(int(n**0.5) + 1):\r\n j = n - i * i\r\n if i + j * j == m:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n decode()\r\n", "arr = [int(_) for _ in input().split()]\n\nc = 0\n\nfor i in range(0, max(arr)+1):\n for j in range(0, max(arr)+1):\n if i**2 + j == arr[0] and i + j**2 == arr[1]:\n c += 1\n\nprint(c)\n", "n,m=map(int,input().split())\r\ncnt=0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if a**2+b==n and a+b**2==m:\r\n cnt+=1\r\nprint(cnt)", "a,b=map(int,input().split())\r\ns=0\r\nfor i in range(min(a,b)+1):\r\n for j in range(min(a,b)+1):\r\n if i*i+j==a and i+j*j==b:\r\n s+=1\r\nprint(s)", "n,m=map(int,input().split())\r\nT=0\r\nfor i in range(0,n+1):\r\n if n-i*i>=0:\r\n if i+(n-i*i)**2==m: T+=1\r\nprint(T)", "from math import *\r\ncp = [i*i for i in range(1001)]\r\nn,m = map(int, input().split())\r\nres = 0\r\nfor k in cp:\r\n try:\r\n b1 = (sqrt(k-4*n+4*m))/2 + 1/2\r\n b2 = -(sqrt(k-4*n+4*m))/2 + 1/2\r\n if b1.is_integer() and b1 >= 0:\r\n a1 = (1+sqrt(1+4*int(b1)*int(b1)-4*int(b1)+4*(n-m)))/2\r\n a2 = (1-sqrt(1+4*int(b1)*int(b1)-4*int(b1)+4*(n-m)))/2\r\n if a1.is_integer() and a1 >= 0:\r\n if a1*a1 + b1 == n and a1 + b1*b1 == m:\r\n res += 1\r\n if a2.is_integer() and a2 >= 0:\r\n if a2*a2 + b1 == n and a2 + b1*b1 == m:\r\n res += 1\r\n if b2.is_integer() and b2 >= 0:\r\n a1 = (1+sqrt(1+4*int(b2)*int(b2)-4*int(b2)+4*(n-m)))/2\r\n a2 = (1-sqrt(1+4*int(b2)*int(b2)-4*int(b2)+4*(n-m)))/2\r\n if a1.is_integer() and a1 >= 0:\r\n if a1*a1 + b2 == n and a1 + b2*b2 == m:\r\n res += 1\r\n if a2.is_integer() and a2 >= 0:\r\n if a2*a2 + b2 == n and a2 + b2*b2 == m:\r\n res += 1\r\n except:\r\n continue\r\nprint(res)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 11 16:49:40 2023\r\n\r\n@author: 21pt34\r\n\"\"\"\r\n\r\ninput_list = input().split()\r\nn = int(input_list[0])\r\nm = int(input_list[1])\r\n\r\nsols = []\r\n\r\nnumber = max(m,n)\r\n\r\nfor i in range(number+1):\r\n for j in range(number+1):\r\n if ((i**2 + j == n) and (i + j**2 == m)):\r\n res = str(i)+str(j)\r\n \r\n if res not in sols:\r\n sols.append(res)\r\n \r\nprint(len(sols))", "n, m = map(int, input().split())\r\ns = 0\r\nfor a in range(min(n, m) + 1):\r\n for b in range(min(n, m) + 1):\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n s += 1\r\nprint(s)\r\n ", "n,m = map(int,input().split())\nc = 0\nfor a in range(1001):\n if a*a>n:\n break\n for b in range(1001):\n if b*b>m:\n break\n x,y = a*a+b,b*b+a\n if x==n and y==m:\n c+=1\nprint(c)\n'''\nw = int(input())\nc = 0\nfor _ in range(w):\n a = sum(map(int,input().split()))\n c+=int(a>1)\nprint(c)\n'''\n", "def System_of_Equations():\r\n import math\r\n strInput1 = input().split(' ')\r\n n = int(strInput1[0])\r\n m = int(strInput1[1])\r\n\r\n answer = 0\r\n for a in range(m+1):\r\n b_sqaure = m - a\r\n b = math.sqrt(b_sqaure)\r\n\r\n if (a*a) + b == n :\r\n answer += 1\r\n\r\n print(answer)\r\n\r\n\r\n\r\nSystem_of_Equations()", "def f():\r\n n,m=map(int,input().split(' '))\r\n z=[]\r\n for a in range(1001):\r\n for b in range(1001):\r\n if a**2+b==n:\r\n if a+b**2==m:\r\n if [a,b] not in z:\r\n z+=[[a,b]]\r\n\r\n print(len(z))\r\n return\r\n\r\nt=1\r\nwhile t:\r\n f()\r\n t-=1\r\n \r\n", "import math\n\nn, m = [int(x) for x in input().split()]\ncount = 0\na_limit = min(math.floor(math.sqrt(n)), m)\nb_limit = min(math.floor(math.sqrt(m)), n)\nfor a in range(0, a_limit + 1):\n for b in range(0, b_limit + 1):\n if (a**2 + b) == n and (a + b**2) == m:\n count+=1\nprint(count)\n \t \t\t\t\t \t\t \t \t\t\t \t\t\t \t\t", "inputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\nm = inputs[1]\r\nif(n<=m):\r\n min1 = n\r\n max1 = m\r\nelse:\r\n min1 = m\r\n max1 = n\r\nsquares =[]\r\ni=0\r\nsq=0\r\ncount=0\r\nwhile(sq<=min1):\r\n squares.append(sq)\r\n i+=1\r\n sq=i*i\r\nfor i in range(len(squares)-1,-1,-1):\r\n b = min1-squares[i]\r\n a = i\r\n if(a+(b*b)==max1):\r\n count+=1\r\nprint(count)\r\n", "n, m = map(int, input().split())\ncnt = 0\nfor a in range(int(n**0.5)+1):\n for b in range(int(m**0.5)+1):\n if a*a + b == n and a+ b*b == m:\n cnt +=1\nprint(cnt)", "n=list(map(int,input().split()))\r\nx=0\r\nfor a in range(n[1]+1):\r\n for b in range(n[0]+1):\r\n if a*a+b==n[0] and a+b*b==n[1]:\r\n x+=1\r\nprint(x)\r\n\r\n", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in range(0, n+1):\r\n for j in range(0,n+1):\r\n if i==(n-j)**0.5:\r\n if i==(m-j**2):\r\n count+=1\r\nprint(count)", "from collections import defaultdict, deque\n\n\n #n,m = map(int, input().split())\n #arr = list(map(int, input().split()))\ndef solution():\n n,m = map(int, input().split())\n count = 0\n ln = max(n,m) + 1\n for a in range(ln):\n for b in range(ln):\n count += a*a + b == n and a + b*b== m\n print(count)\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 math\r\nnum=list(map(int,input().split()))\r\nn,m=num\r\n#x^2+y=n\r\n#x+y^2=m\r\namax=math.floor(math.sqrt(n)) #max value of a\r\nbmax=math.floor(math.sqrt(m)) #max value of b\r\npairs=0\r\nfor i in range(amax+1):\r\n for j in range(bmax+1):\r\n if ((i*i+j)==n) and ((i+j*j)==m):\r\n pairs+=1\r\nprint(pairs)", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in range(32):\r\n for j in range(32):\r\n if ((i**2)+j)==n and (i+(j**2))==m:\r\n count+=1\r\nprint(count)\r\n \r\n", "n,m=list(map(int,input().split( )))\r\n# m=int(input())\r\ncnt=0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if(a*a+b==n and b*b+a==m):\r\n cnt=cnt+1 \r\nprint(cnt)", "def soe(x,y):\r\n return (x+0.5) ** 2 + (y+0.5) ** 2\r\n\r\nimport math\r\nn,m = map(int,input().split())\r\na = m + n + 0.5\r\ncount = 0\r\nsmax = int(math.sqrt(a) - 0.5)\r\nfor i in range(0,smax+1):\r\n for j in range(0,smax+1):\r\n if (soe(i,j) == a):\r\n if (i ** 2 + j == n) and (i + j ** 2 == m):\r\n count = count + 1\r\n #print(i,j)\r\nprint(count)", "n, m = map(int, input().split())\nres = 0\nfor a in range(32):\n for b in range(32):\n res += a * a + b == n and a + b * b == m\nprint(res)\n", "a,b=map(int,input().split())\r\nt=0\r\nfor i in range(500):\r\n for j in range(500):\r\n if (i**2)+j==a and (j**2)+i==b:\r\n t+=1\r\nprint(t)", "n, m = map(int, input().split())\n\nanswer = 0\na = 0\nwhile a*a <= n and a <= m:\n b = n - a*a\n if (a + b*b) == m:\n answer += 1\n a += 1\n\nprint(answer)\n", "n,m = map(int, input().split())\r\nprint(sum(a*a+b-n==a+b*b-m==0 for a in range(32) for b in range(32)))", "def solve(n, m):\r\n valid_pairs_count = 0\r\n valid_pairs = {}\r\n a = 0\r\n while (a ** 2) <= n:\r\n b = n - (a ** 2)\r\n if int(b) == b: # checks to see if b is an integer\r\n valid_pairs[(a, b)] = True\r\n\r\n a += 1\r\n\r\n b = 0\r\n while (b ** 2) <= m:\r\n a = m - (b ** 2)\r\n if int(a) == a:\r\n if (a, b) in valid_pairs:\r\n valid_pairs_count += 1\r\n b += 1\r\n\r\n return valid_pairs_count\r\n \r\n\r\nif __name__ == \"__main__\":\r\n n, m = [int(_) for _ in input().split(sep=\" \")]\r\n result = solve(n, m)\r\n print(result)\r\n \r\n\r\n\r\n", "def system_of_equations_a():\r\n n,m = map(int, input().split())\r\n a, c = 0, 0\r\n while(a <= int(math.sqrt(n))):\r\n b = n - a*a\r\n if(a + b*b == m):\r\n c += 1\r\n a += 1\r\n print(c)\r\n\r\nif __name__ == '__main__':\r\n import math\r\n system_of_equations_a()", "k=input().split(\" \")\r\n\r\nn,m = int(k[0]), int(k[1])\r\n\r\ncount = 0\r\n\r\nfor a in range(n + 1):\r\n\tfor b in range(m + 1):\r\n\t\tif a**2 + b == n and b**2 + a == m:\r\n\t\t\tcount += 1\r\n\r\nprint(count)", "from re import A\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\nres = 0\r\nfor a in range(int(n**0.5) + 1):\r\n b = n - a**2\r\n if (a + b**2) == m:\r\n res+=1\r\n\r\nprint(res)", "n,m=map(int,input().split())\r\ncount=0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if n==a*a+b and m==a+b*b and n>=1 and m>=1 and n<=1000 and m<=1000:\r\n count=count+1\r\nprint(count)", "n, m = map(int, input().split())\r\ndem = 0\r\nfor x in range(1001):\r\n for y in range(1001):\r\n if x * x + y == n and x + y * y == m: dem += 1\r\nprint(dem)", "n, m = map(int, input().split())\r\nresult = 0\r\nfor i in range(0,n+1):\r\n for j in range(0, m + 1):\r\n if i!=0 or j!=0:\r\n if i*i+j==n and i+j*j==m:\r\n result+=1\r\nprint(result)", "import math\r\n\r\n\r\ndef pairCount(n,m):\r\n counting=0\r\n for i in range(n+m):\r\n a=(n-i)**0.5\r\n if(a+(i**2)==m):\r\n counting+=1\r\n return counting\r\n\r\nn,m=map(int,input().split())\r\nnumberOfPairs=pairCount(n,m)\r\nprint(numberOfPairs)", "count = 0\r\nn, m = [int(i) for i in input().split()]\r\nfor a in range(m + 1):\r\n for b in range(n + 1):\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n count += 1\r\nprint(count)", "l = input().split(' ')\r\nn, m, count = int(l[0]), int(l[1]), 0\r\nfor i in range(10000):\r\n p = pow(i, 2)\r\n if i + pow(n-p, 2) == m and n - p >= 0:\r\n count += 1\r\nprint(count)", "n, m = map(int, input().split())\r\ncount = 0\r\nfor a in range(max(n,m)+1):\r\n for b in range(max(n,m)+1):\r\n if a*a+b==n and a+b*b==m: count+=1\r\nprint(count)", "n,m=map(int,input().split())\r\nlist1=[1 for a in range(1001) for b in range(1001) if a*a+b-n==a+b*b-m==0]\r\nprint(sum(list1))\r\n", "n, m = map(int, input().split())\r\n\r\nc = 0\r\ns = n + m\r\nfor a in range(s):\r\n for b in range(s):\r\n if (a * a + b) == n and (a + b * b) == m:\r\n c += 1\r\n\r\nprint(c)\r\n", "def main():\r\n n, m = list(map(int, input().split()))\r\n\r\n a = 0\r\n counter = 0\r\n while True:\r\n b = n - a ** 2\r\n if b < 0:\r\n break\r\n if a + b ** 2 == m:\r\n counter += 1\r\n a += 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=0\r\nc=0\r\nwhile n>=a**2:\r\n b=n-a**2\r\n if b>=0 and a+b**2==m:\r\n c+=1\r\n a+=1\r\nprint(c)", "\r\nn,m =map(int,input().split())\r\n\r\n\r\ncount = 0\r\n\r\nfor i in range(min(n,m)+1):\r\n for j in range(max(m,n)+1):\r\n a = i\r\n b = j\r\n if (a**2 + b)==n and (a+b**2) ==m:\r\n count = count + 1\r\nprint(count)\r\n\r\n", "n,m=map(int,input().split())\r\no=0\r\nfor i in range(0,1001):\r\n for j in range(0,1001):\r\n a=i\r\n b=j\r\n if a**2+b==n and a+b**2==m:\r\n o+=1\r\nprint(o)\r\n", "s=input().split()\nn,m=int(s[0]),int(s[1])\nfirst=set()\nsecond=set()\nfor i in range(n+1):\n\t\tfor j in range(n+1):\n\t\t\tif i*i+j==n:\n\t\t\t\tfirst.add((i,j))\nfor a in range(m+1):\n\t\tfor b in range(m+1):\n\t\t\tif a+b**2==m:\n\t\t\t\tsecond.add((a,b))\nprint(len(first.intersection(second)))\n\t\t\t\t\n\t\t\n", "## for the first eqution go to sqrt n ## solution for a2oj_47\r\nimport math\r\ns=input().split()\r\nn,m=[int(e) for e in s]\r\npossible_solutions=[]\r\nresult=[]\r\nlimit=int(math.sqrt(m))\r\nfor i in range(limit+1):\r\n a=m-i*i\r\n possible_solutions.append([a,i])\r\nfor item in possible_solutions :\r\n if item[0]*item[0]+item[1]==n:\r\n result.append(item)\r\n\r\nprint(len(result))\r\n\r\n\r\n", "#import math\r\nlista = input().split(\" \")\r\nn = int(lista[0])\r\nm = int(lista[1])\r\nsolution = 0\r\n\r\nfor a in range(0, 1000):\r\n b = n - a**2\r\n if a + b**2 == m and b >= 0:\r\n solution += 1\r\n\r\nprint(solution)", "n,m=map(int,input().split())\r\nl=[(a,b) for a in range(32) for b in range(32) if a*a+b==n and b*b+a==m]\r\nprint(len(l))", "l=list(map(int,input().split()))\r\ny=max(l)\r\ncount=0\r\nfor i in range(0,y+1):\r\n for j in range(0,y+1):\r\n if (i**2+j)==l[0] and (i+j**2)==l[1]:\r\n count+=1\r\nprint(count)", "def count_pair(n,m):\r\n count=0\r\n for a in range(m+1):\r\n b=n-a**2\r\n if a+b**2==m and b>=0:\r\n count+=1\r\n return count\r\n\r\nn,m=map(int,input().split())\r\nprint(count_pair(n,m))", "import math\n\ndef count_satisfying_pairs(num1, num2):\n count = 0\n for a in range(int(math.sqrt(num2)) + 1):\n b = num2 - a * a\n if b >= 0 and (a + b * b) == num1:\n count += 1\n return count\n\ndef main():\n n, m = map(int, input().split())\n number_of_satisfying_pairs = count_satisfying_pairs(n, m)\n print(number_of_satisfying_pairs)\n\nif __name__ == '__main__':\n main()\n", "#from math import sqrt\r\nn,m=map(int,input().split())\r\n#a^2+b=n, a+b^2=m, find cnt of a,b V a,b>=0 & n,m<=1000\r\ncnt = 0\r\n#lim_m = int(sqrt(m))\r\n#lim_n = int(sqrt(n))\r\nlim = max(m,n)+1\r\nfor a in range(lim):\r\n for b in range(lim):\r\n #print(a**2+b, b**2+a)\r\n if a*a+b == n and b*b+a ==m:\r\n cnt+=1\r\nprint(cnt)\r\n \r\n", "n,m=map(int,input().split())\r\nc=0\r\nfor a in range(int(n**(0.5))+1):\r\n b=n-a**2\r\n if a+b**2==m:\r\n c+=1\r\nprint(c)\r\n", "n,m=map(int,input().split())\r\ns=0\r\nfor i in range(33):\r\n for j in range(33):\r\n if i**2+j==n and j**2+i==m:\r\n s+=1\r\nprint(s)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn, m = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(min(n, m) + 1):\r\n for j in range(min(n, m) + 1):\r\n if i + j * j == n and i * i + j == m:\r\n # print(i, j)\r\n cnt += 1\r\nprint(cnt)\r\n", "def system(n, m):\r\n a = 0\r\n b = 0\r\n ans = 0\r\n \r\n while (a*a<=n and a<=m):\r\n b = n-a*a\r\n if (a+b*b == m):\r\n ans += 1\r\n a += 1\r\n \r\n return ans\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = list(map(int, input().split()))\r\n \r\n ans = system(n,m)\r\n print(ans)\r\n ", "import math\r\nn,m = map(int, input().split())\r\nsum = 0\r\nif(n>m):\r\n s = int(math.sqrt(n))\r\nelse:\r\n s = int(math.sqrt(m))\r\nfor a in range(s+1):\r\n for b in range(s+1):\r\n if(a*a + b == n and a + b*b == m):\r\n sum += 1\r\nprint(sum)", "n,m=map(int,input().split())\r\nd=0\r\na=0\r\nwhile a**2 <=n:\r\n b=n-a**2\r\n if b>=0 and a+b**2==m:\r\n d+=1\r\n a+=1\r\nprint(d)", "from math import sqrt\nn, m = [int(i) for i in input().split()]\n\n# a + b^2 = m\n# a^2 + b = n\n# a = m - b^2\n#\ncount = 0\nfor b in range(int(min(sqrt(m), n)) + 1):\n a = m - b*b\n if a*a + b == n:\n count += 1\n \nprint(count)\n", "n,m=input().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\na=0\r\nl=[]\r\nwhile(a<=n**0.5):\r\n b=0\r\n while(b<=n):\r\n if(a**2+b==n):\r\n l.append([a,b])\r\n b=b+1 \r\n a=a+1 \r\ncount=0\r\nfor i in l:\r\n if(i[1]**2+i[0]==m):\r\n count=count+1 \r\nprint(count)", "n, m = map(int, input().split())\r\nanswer = 0\r\n\r\nfor a in range(min(m + 1, int(n ** 0.5) + 1)):\r\n b = n - a * a\r\n if a + b * b == m:\r\n answer += 1\r\n\r\nprint(answer)\r\n", "n, m = map(int, input().split())\r\ndem = 0\r\nfor a in range(min(n, m) + 1):\r\n for b in range(min(n, m) + 1):\r\n if a ** 2 + b == n and a + b ** 2 == m:\r\n dem += 1\r\nprint(dem)", "n,m=map(int,input().split())\nr=range(32)\nprint(sum(a*a+b-n==a+b*b-m==0 for a in r for b in r))", "l=list(map(int,input().split()))\r\nn,m=l[0],l[1]\r\nc=0\r\nfor a in range(0,n+1):\r\n for b in range(0,m+1):\r\n if a>=b or b>=a:\r\n if (a**2)+b==n and a+(b**2)==m:\r\n c+=1\r\nprint(c)", "from math import sqrt\r\ndef equation(n,m):\r\n count=0\r\n for a in range(0,int(sqrt(n)+1)):\r\n b=(a*a)-n\r\n if(a+(b*b)==m):\r\n count+=1\r\n return count\r\n\r\nn,m=input().split()\r\nprint(equation(int(n),int(m)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "lis=list(map(int,input().strip().split()))\r\na=lis[0]\r\nb=lis[1]\r\nc=0\r\nif 1 in lis:\r\n j=0\r\nelse:\r\n j=1\r\nwhile j<=a:\r\n fn=(a-j)**0.5\r\n if int(fn)+ j**2 ==b:\r\n c=c+1\r\n j=j+1\r\nprint(c)\r\n \r\n", "n, m = map(int, input().split())\n\nans = 0\n\nfor a in range(0,1001):\n for b in range(0,1001):\n if a**2 + b == n and a + b**2 == m:\n ans += 1\nprint(ans)", "n, m = map(int, input().split())\r\ncnt = 0\r\nfor i in range(n + 1):\r\n a = int((n - i) ** .5)\r\n if a * a + i == n and i * i + a == m:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n, m = map(int, input().split())\r\nans = 0\r\nfor a in range(0, max(n, m) + 1):\r\n for b in range(0, max(n, m) + 1):\r\n if (a * a + b == n) and (a + b * b == m):\r\n ans += 1\r\nprint(ans)\r\n", "n, m = list(map(int, input().split()))\ncount = 0\n\nfor i in range(1000):\n for j in range(1000):\n if i ** 2 + j == n and j ** 2 + i == m :\n count += 1\ndel i \ndel j \n\n\nprint(count)\ndel count", "msn = input()\r\nmsn = msn.split(\" \")\r\nn= int(msn[0])\r\nm= int(msn[1])\r\n# print(n,m)\r\n\r\ncount = 0\r\n\r\ndef equation(n , m):\r\n global count\r\n for a in range(0,1001):\r\n for b in range (0,1001):\r\n if pow(a,2) + b == n and a + pow(b,2) == m:\r\n count +=1\r\n \r\n \r\n return count\r\n\r\n\r\nprint(equation(n,m))", "n,m = map(int,input().split())\r\ncount=0\r\nfor i in range(1000):\r\n for j in range(1000):\r\n if i*i + j == n and i + j*j == m:\r\n count+=1\r\n\r\nprint(count)", "n, m = input().split()\r\nm = int(m)\r\nn = int(n)\r\nmaxm = max(n, m)\r\nc = 0\r\n\r\nfor i in range(maxm + 1):\r\n for j in range(maxm + 1):\r\n if (((i**2)+j == n) and (i+(j**2) == m)):\r\n c = c+1\r\nprint(c)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\ncount = 0\r\nfor a in range(n+1):\r\n for b in range(m+1):\r\n if a*a + b == n and b*b + a == m:\r\n count += 1\r\n\r\nprint(count)\r\n", "i = input()\r\ni = i.split(\" \")\r\nn = int(i[0])\r\nm = int(i[1])\r\na = 0\r\nb = 0\r\nposible_solutions = 0\r\nfor i in range(0, 1000):\r\n a = i\r\n for e in range(0, 1000):\r\n b = e\r\n eq1 = a**2 + b == n\r\n eq2 = a + b**2 == m\r\n if eq1 and eq2:\r\n posible_solutions += 1\r\n\r\nprint(posible_solutions)", "import math\r\ncount = 0\r\n[n, m] = list(map(int, input().split()))\r\ntest = math.floor(math.sqrt(n)) + 1\r\nfor i in range(test):\r\n if i + pow((n - pow(i, 2)), 2) == m:\r\n count += 1\r\nprint(count)", "n, m = map(int, input().split())\r\na, b, x = 0, 0, 0\r\nwhile a**2 <= n:\r\n while b**2 <= m:\r\n if (a**2 + b == n) and (a + b**2 == m):\r\n x += 1\r\n b += 1\r\n a += 1\r\n b = 0\r\nprint(x)", "n,m=map(int,input().split())\r\ncount=0\r\nfor i in range(1001):\r\n for j in range(1001):\r\n if i**2+j==n and i+j**2==m:\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", "n, m = map(int, input().split())\r\ni=0\r\ncount=0\r\nwhile(i*i<=n):\r\n if((m-i)==(n-i*i)**2):\r\n count+=1\r\n i+=1\r\nprint(count)", "n,m=map(int,input().split())\r\ni=int(n**0.5)\r\ncnt=0\r\nfor j in range(0,i+1):\r\n b=n-j*j\r\n if m-b*b==j : cnt+=1\r\nprint(cnt)", "def main():\r\n n, p = map(int, input().split())\r\n sum = 0\r\n for i in range(n + 1):\r\n for j in range(p + 1):\r\n if (i * i) + j == n and (j * j) + i == p:\r\n sum += 1\r\n\r\n print(sum)\r\n\r\nif __name__ == \"__main__\":\r\n main()\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, m = multi_input()\r\n ans = 0\r\n for i in range(1001):\r\n for j in range(1001):\r\n if i*i+j == n and i+j*j == m:\r\n ans += 1\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "m,n=map(int,(input().split()))\r\nprint(sum(a*a+b-m==a+b*b-n==0 for a in range(32) for b in range(32)))", "def problem(n,m):\r\n k=0\r\n for a in range(0,1001):\r\n for b in range(0, 1001):\r\n if a**2+b==n and a+b**2==m:\r\n k+=1\r\n return k\r\nn,m=map(int,input().split())\r\nprint(problem(n,m))", "n,m = map(int, input().split())\r\ni = 0\r\nfor a in range(0, int(n**0.5)+1):\r\n for b in range(0, int(m**0.5)+1):\r\n if (a*a+b)==n and (b*b+a)==m:\r\n i += 1\r\nprint(i)", "n, m = map(int, input().split())\nc = 0\n\nfor a in range(10000):\n b = n - a ** 2\n\n if b >= 0 and a + b ** 2 == m:\n c += 1\n\nprint(c)\n\n", "line = list(map(int, input().split()))\r\nN, M = line[0], line[1]\r\ncount = 0\r\nfor i in range(min(N, M) + 1):\r\n for j in range(min(N, M) + 1):\r\n if i ** 2 + j == N and i + j ** 2 == M:\r\n count += 1\r\nprint(count)", "n,m = map(int,input().split())\r\nk = 0\r\nfor b in range(n+1):\r\n if (m - b**2) < 0:\r\n break\r\n elif (m-b**2)**2+b-n == 0:\r\n k += 1\r\nprint(k)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Dec 29 18:20:24 2022\r\n\r\n@author: Lenovo\r\n\"\"\"\r\nfrom math import sqrt\r\nx = input()\r\nx = x.split()\r\nn = int(x[0])\r\nm = int(x[1])\r\n\r\nif m<n:\r\n i = 0\r\n pares = 0\r\n while i<=m:\r\n if sqrt(m-i) == int(sqrt(m-i)):\r\n a = i\r\n b = int(sqrt(m-i))\r\n \r\n if a == sqrt(n-b):\r\n \r\n pares+=1\r\n i+=1\r\nelse:\r\n j = 0\r\n pares = 0\r\n while j<=n:\r\n if sqrt(n-j) == int(sqrt(n-j)):\r\n a= int(sqrt(n-j))\r\n b = j\r\n \r\n if b==sqrt(m-a):\r\n pares+=1\r\n j+=1\r\nprint(pares)\r\n \r\n \r\n ", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\n\r\nnum = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if (a*a + b == n) and (a + b*b == m):\r\n num += 1\r\nprint(num)\r\n", "import math\r\n[n,m]=map(int,input().split())\r\ncount=0\r\nfor a in range (0,int(math.sqrt(n)+1)):\r\n for b in range (0,int(math.sqrt(m)+1)):\r\n if a*a+b==n and a+b*b==m:\r\n count+=1\r\nprint(count)", "import math\r\n\r\na , b = [int(x) for x in input().split()]\r\n\r\nx = int(math.sqrt(a))\r\ny = int(math.sqrt(b))\r\nresp = 0\r\nfor i in range (x+1):\r\n for j in range(y+1):\r\n if i**2 + j == a and j ** 2 + i == b:\r\n resp +=1\r\nprint(resp)", "n, m = map(int, input().split())\r\n\r\nt = 0\r\nfor a in range(1001):\r\n for b in range(1001):\r\n if a**2+b==n and a+b**2==m:\r\n t += 1\r\n if a**2+b>n or a+b**2>m:\r\n break\r\nprint(t)", "n, m = map(int, input().split())\r\nk = 0\r\nfor i in range(round(n**0.5) + 1):\r\n for j in range(round(m**0.5) + 1):\r\n if ((i**2 + j) == n and (i + j**2) == m):\r\n k += 1\r\nprint(k) \r\n" ]

[ "n,k = map(int, input().split())\r\nprint(\"YES\" if max([len(s) for s in input().split('.')])<k else \"NO\")", "n,k=map(int,input().split())\r\na=input()\r\n \r\nb=[]\r\nr=0\r\n \r\ni=0\r\nwhile i<n:\r\n \r\n if a[i]=='#':\r\n r+=1\r\n else:\r\n b+=[r]\r\n r=0\r\n i+=1\r\n \r\ncr=max(b)\r\n \r\nif cr>=k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "n,k=tuple(map(int,input().split()))\r\nst=input()\r\ns=\"#\"*k\r\nif s in st:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\nw = input()\r\nr = max(len(y) for y in w.split(\".\"))\r\nprint([\"NO\",\"YES\"][r < k])", "# Aaditya Upadhyay\r\n# ..............\r\n# ╭━┳━╭━╭━╮╮\r\n# ┃┈┈┈┣▅╋▅┫┃\r\n# ┃┈┃┈╰━╰━━━━━━╮\r\n# ╰┳╯┈┈┈┈┈┈┈┈┈◢▉◣\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈▉▉▉\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈◥▉◤\r\n# ╲┃┈┈┈┈╭━┳━━━━╯\r\n# ╲┣━━━━━━┫\r\n# ……….\r\n# .……. /´¯/)………….(\\¯`\\\r\n# …………/….//……….. …\\….\\\r\n# ………/….//……………....\\….\\\r\n# …./´¯/…./´¯\\……/¯ `\\…..\\¯`\\\r\n# ././…/…/…./|_…|.\\….\\….\\…\\.\\\r\n# (.(….(….(…./.)..)...(.\\.).).)\r\n# .\\…………….\\/../…....\\….\\/…………/\r\n# ..\\…………….. /……...\\………………../\r\n# …..\\…………… (………....)……………./\r\nfrom sys import stdin, stdout\r\nfrom collections import *\r\nfrom math import gcd, floor, ceil\r\ndef st(): return list(stdin.readline().strip())\r\n\r\n\r\ndef li(): return list(map(int, stdin.readline().split()))\r\ndef mp(): return map(int, stdin.readline().split())\r\ndef inp(): return int(stdin.readline())\r\ndef pr(n): return stdout.write(str(n)+\"\\n\")\r\n\r\n\r\nmod = 1000000007\r\nINF = float('inf')\r\n\r\n\r\ndef solve():\r\n n, k = mp()\r\n s = st()\r\n i = 0\r\n while i < n:\r\n if s[i] == '#':\r\n c = 0\r\n while i < n and s[i] == '#':\r\n i += 1\r\n c += 1\r\n if c >= k:\r\n pr('NO')\r\n return\r\n else:\r\n i += 1\r\n pr('YES')\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,k = get_int_list()\r\ns = get_string()\r\nif '#'*k in s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "len_of_road, max_jump = (int(x) for x in input().split())\r\nroad = input()\r\ni = 0\r\nwhile i < len_of_road:\r\n\tif road[i] == '.':\r\n\t\tcurrent_jump = 0\r\n\telse:\r\n\t\tif current_jump < max_jump - 1:\r\n\t\t\tcurrent_jump += 1\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n\ti += 1\r\nelse:\r\n\tprint('YES')", "n,k=map(int,input().split())\r\nprint (\"NO\" if \"#\"*k in input() else \"YES\")", "n, k = (int(i) for i in input().split())\ns = input()\nma = 0\nfor i, c in enumerate(s):\n if i > ma:\n break\n ma = i + k if c == \".\" else ma\nres = \"YES\" if ma >= n - 1 else \"NO\"\nprint(res)\n", "lenn , pas = map(int , input().split()) \r\nmapp = input()\r\nres = \"YES\"\r\ns = \"#\" * pas\r\nif s in mapp : \r\n res = \"NO\"\r\nprint(res)", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport math\r\n \r\nimport sys\r\nimport os\r\nfrom io import BytesIO\r\nimport threading\r\nimport bisect\r\n \r\n \r\nimport heapq\r\n\r\n#sys.stdin = open(\"F:\\PY\\\\test.txt\", \"r\")\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\nceq = 0\r\nfor i in range(n):\r\n if s[i]==\"#\":\r\n ceq+=1\r\n if ceq==k:\r\n print(\"NO\")\r\n break\r\n else:\r\n ceq=0\r\nelse:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\nprint('NO' if '#' * k in input() else 'YES')", "n,k = map(int,input().split(' '))\r\ns = str(input())\r\n\r\nl = []\r\ncur = 0\r\nfor i in range (1,n):\r\n if s[i] == \".\":\r\n l.append(i-cur)\r\n cur = i\r\nflag = True\r\nfor i in range (0,len(l)):\r\n if l[i] > k:\r\n flag = False\r\n break\r\nif flag == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def func():\r\n n,k=list(map(int,input().split()))\r\n s=input()\r\n i=c=0\r\n while i<n:\r\n if s[i]==\"#\":\r\n c+=1\r\n else:\r\n c=0\r\n if c==k:\r\n return \"NO\"\r\n i+=1\r\n return \"YES\"\r\nprint(func())\r\n\r\n\r\n\r\n\r\n", "# 299B Ksusha the Squirrel\r\ndef ksusha():\r\n n, k = map(int, input().split())\r\n inp_road = input()\r\n rocks = [0 for i in range(n)]\r\n i, j = 0, 0\r\n for symb in inp_road:\r\n if symb == \"#\":\r\n rocks[i] += 1\r\n else:\r\n i += 1\r\n if rocks[0] <= k and max(rocks[1:]) < k:\r\n print('YES')\r\n else: \r\n print('NO')\r\nksusha()", "a, b = map(int,input().split())\r\nx = input()\r\ncnt = 0\r\nfor i in x:\r\n if i == '#':\r\n cnt+=1\r\n else:\r\n cnt = 0\r\n if cnt>=b:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")", "n,k = map(int,input().split())\r\ns = input()\r\na = 0\r\nflag =0\r\nfor i in range(n):\r\n if s[i] ==\".\":\r\n b = i\r\n if b-a>k:\r\n flag =1\r\n break\r\n else:\r\n a=b\r\nif flag ==1:\r\n print(\"NO\")\r\nelse:\r\n print('YES')\r\n", "N = []\r\nfor i in input().split():\r\n N.append(int(i))\r\n\r\nStone = []\r\nfor i in input().split(maxsplit=N[0]):\r\n Stone.append(str(i))\r\n\r\nj = []\r\nfor i in Stone:\r\n for k in i:\r\n j.append(k)\r\n\r\nk = 0\r\nOne = j[0]\r\nNumber = 0\r\nCount = 0\r\n\r\nfor i in range(1, len(j)):\r\n if j[i] == '.' and abs(Number - i) <= N[1]:\r\n Number = i\r\n Count = 1\r\n else:\r\n Count = 0\r\nif Number == len(j) - 1 and Count == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "num,can_jump=map(int,input().split())\r\nlist=input()\r\ncount=0\r\ncan_pass=True\r\nfor i in range(0,num):\r\n if list[i]==\"#\":\r\n count+=1\r\n if list[i]==\".\":\r\n if count>=can_jump:\r\n print(\"NO\")\r\n can_pass=False\r\n break\r\n count=0\r\nif can_pass==True:\r\n print(\"YES\")", "t = input()\r\nt = t.split(\" \")\r\ninpList = []\r\nfor i in range(len(t)):\r\n inpList.insert(i, int(t[i]))\r\n\r\ns = input()\r\ns = s.split(\".\")\r\ncrossOver = True\r\nwhile i in range(len(s)) and crossOver:\r\n if len(s[i]) >= inpList[1]:\r\n crossOver = False\r\n i += 1\r\nif crossOver:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# for _ in range(int(input())):\r\nfrom math import gcd\r\nn,k=map(int,input().split())\r\ns=input()\r\nl=[]\r\nj=0\r\nc=0\r\nfor i in range(n):\r\n if(s[i]==\"#\" and i==j):\r\n c+=1\r\n j+=1\r\n elif(c!=0):\r\n l.append(c)\r\n c=0\r\n j=i+1\r\n else:\r\n j=i+1\r\nif(c!=0):\r\n l.append(c)\r\nf=0\r\nfor i in l:\r\n if(i>=k):\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def s():\r\n [n,k] = list(map(int,input().split()))\r\n d = [0]*(n+2)\r\n c = 2\r\n d[1] = 1\r\n for ch in input():\r\n d[c] = d[c-1]\r\n if ch == '.' and d[max(0,c-k-1)] != d[c]:\r\n d[c] += 1\r\n c += 1\r\n print('YES' if d[-1] != d[-2] else 'NO')\r\ns()\r\n", "n,k=map(int,input().split())\r\nroad=input()\r\nans='YES'\r\ncount=90\r\ni=0\r\nwhile i<(len(road)-1):\r\n if road[i]=='#':\r\n j=i-1\r\n for s in range(k):\r\n v=j+(s+1)\r\n if road[v]=='.':\r\n ans='YES'\r\n break\r\n else:\r\n ans='NO'\r\n i=v\r\n if ans=='NO':\r\n ans='NO'\r\n break\r\n i += 1\r\nprint(ans)", "n, k=map(int, input().split())\r\ns=input().strip()\r\nlargest=0\r\ni=0\r\nwhile i<n:\r\n if s[i]=='#':\r\n j=i\r\n while j+1<n and s[j+1]=='#':\r\n j+=1\r\n largest=max(largest, (j-i+1))\r\n i=j+1\r\n else:\r\n i+=1\r\nif largest>=k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=map(int,input().split())\r\na=str(input())\r\nif a.count(\"#\"*k)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "def check_jump (string,k):\r\n hurdle=0\r\n longest_hurdle=0\r\n for i in range (len(string)):\r\n if string[i]=='#':\r\n hurdle += 1\r\n if hurdle > longest_hurdle:\r\n longest_hurdle = hurdle\r\n else:\r\n hurdle = 0\r\n if longest_hurdle >= k:\r\n return False\r\n return True\r\n\r\nn,k = map(int,input().split())\r\nstring = input()\r\nif check_jump(string,k):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\r\nmap = input()\r\nif map[-1] == '#':\r\n print('NO')\r\nelse:\r\n Max = 0\r\n current = 0\r\n for i in range(n):\r\n if map[i] == '.':\r\n if current != 0:\r\n Max = max(Max, current)\r\n current = 0\r\n else:\r\n current += 1\r\n if Max >= k:\r\n print('NO')\r\n else:\r\n print('YES')", "n,k=list(map(int,input().split()))\r\n\r\n\r\n\r\na=input().split('.')\r\nu=0\r\n\r\n\r\n\r\nfor i in range(len(a)):\r\n if '#' in a[i]:\r\n if len(a[i])+1>k:\r\n print('NO')\r\n u+=1\r\n break\r\n if u>0:\r\n break\r\n\r\nif u==0:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\nroad = input()\r\nprint(\"YES\" if \"#\"*k not in road else \"NO\")", "n,k = map(int,input().split())\r\n\r\ns = input()\r\n\r\ncheck = \"\"\r\n\r\nfor i in range(0,k):\r\n check += \"#\"\r\n\r\nprint(\"NO\") if check in s else print(\"YES\")", "n,k=[int(x) for x in input().split()]\r\np=input()\r\nif p.find(\"#\"*k)==-1:\r\n print(\"YES\")\r\nelse:print(\"NO\") ", "n, k = map(int, input().split())\r\ns = input()\r\ncount = 0\r\nfor i in range(n):\r\n if s[i] == '#':\r\n count += 1\r\n else:\r\n count = 0\r\n if count == k:\r\n print(\"NO\")\r\n break\r\nif count != k:\r\n print(\"YES\")", "I=lambda:map(int,input().split())\r\nn,k=I()\r\ns=input()\r\nr=[i for i in range(n) if s[i]=='.']\r\nm=len(r);con=True\r\nfor j in range(m-1):\r\n if r[j+1]-r[j]>k:print('NO');con=False;break\r\nif con:print('YES')\r\n ", "m,n=map(int,input().split())\r\na=list(input().split('.'))\r\nprint([\"YES\",\"NO\"][len(max(a))>=n])", "n,k=map(int,input().split())\r\nstring=input()\r\ni=0;t=True;x=0\r\nwhile(i<n):\r\n if(string[i]=='.'):\r\n x=i\r\n i+=1\r\n continue\r\n if(string[i]=='#'):\r\n while(string[i]=='#'):\r\n i+=1\r\n if(i-x>k):\r\n t=False\r\n\r\nif(t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n,k=map(int,input().split(\" \"))\r\nhur=str(input())\r\nsum=0\r\na=0\r\nfor i in range(n):\r\n if hur[i]==\"#\":\r\n sum+=1\r\n if hur[i]==\".\" and sum<k:\r\n sum=0\r\n if hur[i]==\".\" and sum>=k:\r\n a=1\r\n print(\"NO\")\r\n break\r\nif a!=1:\r\n print(\"YES\")", "n,k=input().split()\nn=int(n)\nk=int(k)\nstr=input()\ni=1\nfinal=1\nwhile i!=n:\n j=i+1\n while j <= i+k:\n if str[j-1]=='.':\n #print(\"YES\")\n final=j\n i=j\n break\n j += 1\n if j==i+k+1:\n print(\"NO\")\n exit()\n if i!=j:\n i=i+1\nprint('YES')\n\n\t \t \t \t\t \t \t\t\t \t \t \t\t \t", "def f(l,k,n):\r\n\tif len(l)>0:\r\n\t\tif l[0]>k or (n-1)-l[-1]>k:\r\n\t\t\treturn \"NO\" \r\n\t\tfor i in range(len(l)-1):\r\n\t\t\tif l[i+1]-l[i]>k:\r\n\t\t\t\t# print(l)\r\n\t\t\t\treturn \"NO\"\r\n\treturn \"YES\"\r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\nl=[]\r\nfor i in range(n):\r\n\tif s[i]==\".\":\r\n\t\tl.append(i)\r\nprint(f(l,k,n))", "def main():\n from re import findall\n [__, k] = [int(_) for _ in input().split()]\n road = input()\n print('YES' if '#' not in road or max(len(s) for s in findall(r'#+', road)) < k else\n 'NO')\n\n\nif __name__ == '__main__':\n main()\n", "n,k=map(int,input().split())\r\ns=list(input())\r\nl=[]\r\nfor i in range(n):\r\n if(s[i]=='.'):\r\n l.append(i)\r\nc=0\r\nfor i in range(len(l)-1):\r\n if(l[i+1]-l[i]>k):\r\n c=1\r\n break\r\nif(c==1):\r\n print('NO')\r\nelse:\r\n print('YES')", "import sys\r\n\r\nn , k = map(int, input().split(' '))\r\nc = input()\r\nif k > n:\r\n print('YES')\r\n exit()\r\np = 0\r\nfor i, x in enumerate(c):\r\n if x == '.':\r\n d = i\r\n r = p +k\r\n if d <= r:\r\n p = d\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n,k=map(int,input().split())\np=input()\nif '#'*k in p:print(\"NO\")\nelse:print(\"YES\")", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nHomura = [int(i) for i in input().split()]\r\nn = Homura[0]\r\nk = Homura[1]\r\n\r\nroad = input()\r\nstreak = 0\r\npossible = True\r\n\r\nfor i in range(n):\r\n\tif road[i] == '.':\r\n\t\tstreak = 0\r\n\telif road[i] == '#':\r\n\t\tstreak += 1\r\n\t\tif streak == k:\r\n\t\t\tpossible = False\r\n\t\t\tbreak\r\n\r\nif possible:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "n,k = map(int,input().split())\r\ns =input()\r\nt =\"#\"*k\r\nprint(\"NO\" if(s.count(t)) else \"YES\")", "#https://codeforces.com/problemset/problem/299/B\nn,k=map(int,input().split(' '))\ns=input()\nflag=True\nidx=0\nwhile idx<n-1:\n\tidx+=1\n\tjump=1\n\twhile s[idx]=='#':\n\t\tjump+=1\n\t\tidx+=1\n\tif jump>k:\n\t\tflag=False\n\t\tbreak\nif flag:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "cnt = lambda s, i: s.count(i)\r\nii = lambda: int(input())\r\nsi = lambda : input()\r\nf = lambda : map(int,input().split())\r\nil = lambda : list(map(int,input().split()))\r\nn, k=f()\r\ns = list(si().split('.'))\r\ns.pop(0)\r\ns.pop(-1)\r\nfor i in s:\r\n if len(i)>=k:\r\n exit(print('NO'))\r\nprint('YES')", "n,k = map(int, input().split())\r\nstr = str(input())\r\ncheck = \"#\"*k\r\nif check not in str:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split( ))\r\ns=input()\r\ng=0\r\nf=0\r\nfor i in range(0,n):\r\n if s[i]=='.':\r\n if i-g <= k:\r\n g=i\r\n else:\r\n print('NO')\r\n f=1\r\n break\r\nif f==0:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\nl = str(input())\r\nrs = 0\r\nok = True\r\nfor i in l:\r\n if(rs == k):\r\n ok = False\r\n break\r\n if(i == '#'):\r\n rs += 1\r\n else:\r\n rs = 0\r\nif(ok):\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n", "n,k=map(int,input().split())\r\npattern=input()\r\nif '#'*k in pattern:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# cook your dish here\r\nn,k = map(int, input().split())\r\ns = input()\r\nif n==2:\r\n print(\"YES\")\r\nelse:\r\n a = []\r\n for i in s:\r\n a.append(i)\r\n cnt = 1\r\n m = 1\r\n for i in range(n-1):\r\n if a[i]==a[i+1] and a[i]=='#':\r\n cnt = cnt + 1\r\n else:\r\n if cnt>m:\r\n m = cnt\r\n cnt = 1\r\n else:\r\n cnt = 1\r\n if m>=k:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Aug 30 22:48:40 2021\r\n\r\n@author: rupert\r\n\"\"\"\r\n\r\nimport sys\r\nsysinput = sys.stdin.readline\r\nsysinput = input\r\n############ ---- Input Functions ---- ############\r\ndef readint():\r\n return(int(sysinput()))\r\ndef readchlist():\r\n s = sysinput()\r\n lst = list(s[:])\r\n try:\r\n lst.remove('\\n')\r\n finally:\r\n return(lst)\r\ndef readintlist():\r\n return(list(map(int,sysinput().split())))\r\n\r\nn, k = readintlist()\r\nroad = input()\r\ncheck = ''.join(['#']*k)\r\nif check in road:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, k = [int(a) for a in input().split()]\r\nb = input()\r\nif \"#\" * k in b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, k = map(int, input().split())\ns = input()\ncnt, max_cnt = 0, 0\nfor i in range(n):\n if s[i] == '#':\n cnt += 1\n else:\n if cnt > max_cnt:\n max_cnt = cnt\n cnt = 0\n if i == n - 1:\n max_cnt = max(max_cnt, cnt)\nif max_cnt >= k:\n print('NO')\nelse:\n print('YES')\n", "n, k = map(int, input().split())\r\n\r\nroad = list(input().strip())\r\n\r\ni = 0 \r\nflag = True\r\nwhile i < n-1 and flag :\r\n if road[i+1] != '.':\r\n jump = 1 \r\n while jump <= k and road[i+jump] == \"#\":\r\n jump += 1 \r\n if jump > k or road[i+jump] == \"#\":\r\n flag = False \r\n else :\r\n i += jump\r\n else :\r\n i += 1\r\nif flag :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "from sys import stdin\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\nn, k = read()\r\nprint ( \"NO\" if '#'*k in stdin.readline() else \"YES\" ) \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nprint(\"NO\" if max(map(len, input()[:-1].split('.'))) >= k else \"YES\")", "n, k = map(int, input().split())\r\nj = 0\r\nfor i in input():\r\n if i == '.':\r\n j = 0\r\n else:\r\n j += 1\r\n if j >= k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "# LUOGU_RID: 101474118\nn, k = map(int, input().split())\r\nprint('#' * k in input() and 'NO' or 'YES')\r\n", "N, K = map(int,input().split())\r\n\r\nobs = 0\r\ncur = 0\r\n\r\nS = input()\r\n\r\nfor s in S:\r\n if s == \".\":\r\n cur = 0\r\n else:\r\n cur += 1\r\n obs = max(cur, obs)\r\n \r\nif K <= obs:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\r\nii = lambda: sys.stdin.readline().strip()\r\nidata = lambda: [int(x) for x in ii().split()]\r\n\r\ndef solve():\r\n n, k = idata()\r\n s = ii()\r\n la = 0\r\n for i in range(1, n):\r\n if s[i] == '.':\r\n la = i\r\n elif i - la >= k:\r\n print('NO')\r\n return\r\n print('YES')\r\n return\r\n\r\nfor t in range(1):\r\n solve()", "n,k=list(map(int,input().split(\" \")))\r\ns=input()\r\nprint(\"YES\" if \"#\"*(k) not in s else \"NO\")", "from sys import stdin\r\n###############################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n###############################################################\r\n\r\nn, k = minput()\r\ns = input()\r\ni = 0\r\nif '#'*k in s:\r\n print('NO')\r\nelse:\r\n print('YES')", "def check(string,sub_str):\r\n if(string.find(sub_str)==-1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\na,b=map(int,input().split())\r\nc=input()\r\nd=b*\"#\"\r\ncheck(c,d)\r\n", "n, k = [int(i) for i in input().split()]\r\ns = input() \r\nm = 0\r\nfor i in s.split('.') : m = max(m, len(i)) \r\nif m+1 <= k : print(\"YES\") \r\nelse : print(\"NO\")", "num ,jump =input().split()\r\nprint(\"NO\" if int(jump)*'#' in input() else 'YES')\r\n", "n,j=map(int,input().split())\r\nsample=input()\r\nl=list(sample)\r\nh_c=0\r\nm_c=0\r\nfor i in range (n):\r\n if l[i]==\"#\":\r\n h_c+=1\r\n if m_c<h_c:\r\n m_c=h_c \r\n if l[i]!='#':\r\n h_c=0\r\nif m_c>=j:\r\n print('NO') \r\nelse:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\nprint(\"YES\" if \"#\"*k not in input() else \"NO\")", "n, k = [int(x) for x in input().split()]\r\n\r\nr = input()\r\n\r\ni=int(\"0\")\r\ncount=int(\"0\")\r\nif \"#\" not in r:\r\n print(\"YES\")\r\n\r\nelse:\r\n while i!=n:\r\n if r[i] == \".\":\r\n if i==n-1:\r\n print(\"YES\")\r\n break\r\n else:\r\n i += 1\r\n count=0\r\n else:\r\n count += 1\r\n if count==k:\r\n print(\"NO\")\r\n break\r\n else:\r\n i += 1\r\n \r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# 299B - Ksusha the Squirrel\r\n\r\nN,K = map(int,input().split())\r\n\r\narr = list(input().strip())\r\n\r\ncur = 0\r\nresult = \"YES\"\r\n\r\nwhile 1:\r\n temp = 0\r\n for i in range(K):\r\n if temp == 1: continue\r\n if cur + K - i < N and arr[cur + K - i] == '.':\r\n cur = cur + K - i\r\n temp = 1\r\n if cur == N-1: break\r\n if temp == 0:\r\n result = 'NO'\r\n break\r\n\r\nprint(result)", "n, jump = map(int, input().split())\nrocks = 0\nfor i, ch in enumerate(input()):\n if ch == '#':\n rocks += 1\n if rocks == jump:\n print('NO')\n import sys; sys.exit()\n else:\n rocks = 0\nprint('YES')\n", "n, k = map(int, input().split())\r\nroad = input()\r\n \r\npos = 0\r\nwhile pos < n-1:\r\n npos = pos\r\n for i in range(1,k+1):\r\n if road[pos+i] == '.':\r\n npos = pos+i\r\n break\r\n if pos == npos:\r\n break\r\n pos = npos\r\n\r\nif pos == n-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\na=list(input())\r\nb=[]\r\ncnt=0\r\nfor i in range(n):\r\n if a[i]=='#':\r\n cnt+=1\r\n else:\r\n b.append(cnt)\r\n cnt=0\r\nif max(b)<k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\r\ns=input()\r\nl=[]\r\nfor i in range(len(s)):\r\n if(s[i]=='.'):\r\n l.append(i)\r\nt=[]\r\nfor i in range(len(l)-1):\r\n t.append(l[i+1]-l[i])\r\nif(max(t)<=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=list(map(int,input().split()))\r\nif max(list(map(len,input().split(\".\"))))<k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = [int(x) for x in input().split(' ')]\r\nif '#' * k in input():\r\n print('NO')\r\nelse:\r\n print('YES')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = input().rstrip()\r\n\r\nif data[-1] == '#':\r\n print(\"NO\")\r\nelse:\r\n tmp = map(lambda x: len(x), data.split('.'))\r\n print(\"NO\" if max(tmp) >= k else \"YES\")", "import sys\r\nimport math\r\n\r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\nan = sys.stdin.readline()\r\n\r\nz = 0\r\nfor i in range(n):\r\n if(an[i] == '.'):\r\n if(i + 1 - z <= k):\r\n z = i + 1\r\n\r\nif(n + 1 - z <= k):\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, k = map(int, input().split())\r\ns = input()\r\ntrack, ans = [], 'YES'\r\nfor i in range(len(s)):\r\n if s[i] == '.':\r\n track.append(i)\r\nfor i in range(len(track) - 1):\r\n diff = abs(track[i] - track[i+1])\r\n if diff > k:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "k = int(input().split(' ')[1])\r\ns = input().split('.')\r\nflag = True\r\nfor i in s:\r\n if len(i) >= k:\r\n flag = False\r\n break\r\nprint('YES' if flag else 'NO')", "n, k = map(int, input().split())\r\nmoo = input()\r\npor = 0\r\nblu = \"YES\"\r\nwhile por < n - 1:\r\n tig = por\r\n for nxt in range(por+1, por+k+1):\r\n if moo[nxt] == \".\":\r\n tig = nxt\r\n break\r\n if por == tig:\r\n blu = \"NO\"\r\n break\r\n por = tig\r\nprint(blu)", "#!/usr/env/python3\n\nn,k = map(int, input().split(\" \"))\nroad = input()\n\nmm = 0\nll = True\nfor pp in road:\n if pp == \"#\": mm += 1\n else: mm = 0\n if mm >= k: ll = False\n \nprint(\"YES\") if ll else print(\"NO\")\n", "n, k = [int(j) for j in input().split()]\r\ns = str(input())\r\npointer, res = 0, 0\r\nwhile pointer < n:\r\n if s[pointer] == '#':\r\n count = 0\r\n while pointer < n:\r\n if s[pointer] == '#':\r\n count += 1\r\n pointer += 1\r\n else:\r\n break\r\n res = max(res, count)\r\n else:\r\n pointer += 1\r\nif res < k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int, input().split())\r\ns = input().split('.')\r\n#print(s)\r\nfor i in s:\r\n if '#' in i:\r\n if len(i) > k-1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n, k = map(int, input().split())\r\nmoo = input()\r\nporg = 0\r\nans = \"YES\"\r\nfor i in range(n):\r\n if moo[i] == \".\":\r\n if i - porg > k:\r\n ans = \"NO\"\r\n else:\r\n porg = i\r\nprint(ans)", "a, b = map(int, input().split())\r\nroad_ = input()\r\nans_ = 0\r\nno_ = 0\r\n\r\nfor i in range(0, a):\r\n if road_[i] == \".\":\r\n for _ in range(i+1, a):\r\n if road_[_] == '#':\r\n ans_ += 1 \r\n elif road_[_] == '.':\r\n if ans_ >= b:\r\n no_ += 1\r\n ans_ = 0\r\n break\r\nif no_ > 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k = tuple(input().split())\r\nk = int(k)\r\nnum = 0\r\nstr = input()\r\nfor i in str:\r\n if i == '.':\r\n num = 0\r\n else:\r\n num += 1\r\n \r\n if num == k:\r\n print(\"NO\")\r\n break\r\n\r\n\r\nif num != k:\r\n print(\"YES\")\r\n\r\n", "#!/usr/bin/python3\n\nn, k = tuple(map(int, input().split()))\nt = [_ for _ in input().split('.') if len(_) >= k]\nif t:\n print('NO')\nelse:\n print('YES')\n\n", "if __name__ == \"__main__\":\r\n n,k = list(map(int, input().split()))\r\n path = input()\r\n temp = []\r\n c = 0\r\n for value in path:\r\n c = c + 1\r\n if value == '.':\r\n temp.append(c)\r\n else:\r\n continue\r\n result = float('-inf')\r\n for i in range(len(temp)-1):\r\n result = max(result , temp[i+1] - temp[i])\r\n if result <= k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") ", "n,k = map(int, input().split())\r\ns = input()\r\n\t\r\ncurr = 0\r\ntruth = True\r\nwhile s.find('.', curr+1)!=-1:\r\n\ttemp = curr\r\n\tcurr = s.find(\".\",temp+1)\r\n\tif curr - temp > k:\r\n\t\ttruth = False\r\n\t\tbreak\r\n\r\nprint((\"NO\",\"YES\")[truth])", "\nI = lambda: map(int,input().split())\n\nn,m =I()\ns = input()\nres = c = 0\nfor i in s:\n if i == '#':\n c+=1\n if c == m:\n res = 1\n break\n else:\n c = 0\nprint('YNEOS'[res::2])", "n, k = map(int, input().split())\r\nt = list(input())\r\ni = 0\r\ncnt = 0\r\nwhile i < n:\r\n if t[i] == '#':\r\n cnt += 1\r\n else:\r\n cnt = 0\r\n if cnt >= k:\r\n print('NO')\r\n break\r\n i += 1\r\nelse:\r\n print('YES')\r\n", "n,k=map(int,input().split())\r\nl=input()\r\np=\"#\"*k\r\nif p in l:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=map(int,input().split())\r\ns=input()\r\nc=0\r\nfor i in s:\r\n if i=='.':\r\n c=0\r\n else:\r\n c+=1\r\n if c>=k:\r\n print('NO')\r\n break\r\nelse: print('YES')\r\n", "n,m=[int(i) for i in input().split()]\r\ns=str(input())\r\ne='#'*(m)\r\nif(e in s):\r\n print('NO')\r\nelse:\r\n print('YES')", "n, k = map(int, input().split())\r\ns = input()\r\na = []\r\ncnt = 0\r\nfor i in s:\r\n if i == \"#\":\r\n cnt += 1\r\n else:\r\n a.append(cnt)\r\n cnt = 0\r\na.append(cnt)\r\nansbox = [\"YES\", \"NO\"]\r\nprint(ansbox[max(a) >= k])\r\n", "\r\nn,k=map(int,input().split())\r\na=input()[:n]\r\nmx,cnt=0,0\r\nfor i in range(n):\r\n if a[i]=='#':\r\n cnt+=1\r\n else:\r\n mx=max(mx,cnt)\r\n cnt=0\r\nif mx>=k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n,k=map(int,input().split())\r\nchk='#'*k\r\na=input()\r\ntry:\r\n d=a.replace(chk,'!')\r\n if '!' in d:\r\n print('NO')\r\n else:\r\n print('YES')\r\nexcept:\r\n print('YES')\r\n", "def squirrel_jump (n,k,road) :\r\n min_jump = 0\r\n temp = 0\r\n if k >= n-1 :\r\n return \"YES\"\r\n else :\r\n for i in road :\r\n if i == \".\" :\r\n if temp > min_jump :\r\n min_jump = temp\r\n temp = 0\r\n else :\r\n temp += 1\r\n if k > min_jump :\r\n return \"YES\"\r\n else :\r\n return \"NO\"\r\n \r\nn,k = list(map(int,input().split()))\r\nroad = input()\r\n\r\nprint (squirrel_jump(n,k,road))\r\n \r\n \r\n ", "n,m=map(int,input().split())\r\ni=input()\r\nprint([\"YES\",\"NO\"][\"#\"*m in i])", "nk = list(map(int, input().split()))\r\nn = nk[0]\r\nk = nk[1]\r\nstring = str(input())\r\nind = []\r\nfor i, char in enumerate(string):\r\n if char == \".\":\r\n ind.append(i)\r\nflag = 1\r\n# print(ind)\r\nfor i in range(len(ind)-1):\r\n if ind[i+1] - ind[i] > k:\r\n flag = 0\r\n break\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#ROUNIAAUDI\r\nnum1,num2=map(int,input().split())\r\nstrong1=input()\r\nif strong1.find(\"#\"*num2)==-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\nif s.count('#'*k)>0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, k = map(int,input().split())\r\ns = input()\r\nlong = 0\r\nm = 0\r\nfor i in s:\r\n if i == '#':\r\n long += 1\r\n else :\r\n m = max(m,long)\r\n long = 0\r\n \r\nif k > m:\r\n print('YES')\r\nelse:\r\n print('NO')", "# from unittest import result\r\n\r\n\r\nx = input().split(\" \")\r\nstring = input()\r\ndef chipmunk(x , string):\r\n if(int(x[1]) == 1 and \"#\" in string):\r\n \r\n return \"NO\"\r\n\r\n\r\n else:\r\n\r\n for i in range (len(string)-1):\r\n \r\n if(string[i] == string[i+1]==\"#\"):\r\n result = result + 1\r\n if(result+1 >= int(x[1])):\r\n return \"NO\"\r\n \r\n\r\n else:\r\n result = 0\r\n return \"YES\"\r\nprint(chipmunk(x , string))\r\n \r\n\r\n \r\n", "n,k=(map(int, input().split()))\r\n\r\nl=list(input())\r\n\r\ndef func(n,k,l):\r\n x=[]\r\n for i in range(n):\r\n if l[i]=='.':\r\n if len(x)==0:\r\n x.append(i)\r\n else:\r\n if (i-x[-1])>k:\r\n return \"NO\"\r\n \r\n else:\r\n x.append(i)\r\n \r\n return \"YES\"\r\n \r\nprint(func(n,k,l))\r\n", "_,k = map(int,input().split())\r\ns = input()\r\ni=0\r\nwhile True:\r\n for j in range(i+1,min(i+k+1,len(s))):\r\n if s[j] == '.':\r\n i=j\r\n break\r\n else:\r\n print(\"NO\" if i != len(s)-1 else \"YES\")\r\n break", "n,k=map(int,input().split())\r\ns=list(input())\r\na=[]\r\nfor i in range(n):\r\n if s[i]=='.':\r\n a.append(i)\r\ndiff=[]\r\nfor i in range(1,len(a)):\r\n diff.append(a[i]-a[i-1])\r\nif max(diff)>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, k = map(int, input().split())\r\nroad = str(input())\r\n\r\ni = 0\r\nwhile i < n: \r\n f = 0\r\n for j in range(k, 0, -1):\r\n if i+j > n-1:\r\n continue\r\n if road[i+j] == \".\":\r\n i += j\r\n f = 1\r\n # print(i)\r\n break\r\n if f == 0:\r\n break\r\n\r\nif i == n-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def find_length(n):\r\n r = 0\r\n while n != 0:\r\n n = n // 10\r\n r += 1\r\n return r\r\n\r\n\r\ndef count_zeros(n):\r\n r = 0\r\n while n != 0:\r\n if n % 10 == 0:\r\n r += 1\r\n else:\r\n break\r\n n = n // 10\r\n return r\r\n\r\n\r\ndef factorial(n):\r\n if n == 1:\r\n return 1\r\n return n * factorial(n - 1)\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b / gcd(a, b)\r\n\r\n\r\ndef remove_all_zero(n):\r\n while (n != 0) & (n % 10 == 0):\r\n n = n / 10\r\n return n\r\n\r\n\r\ndef is_prime(n):\r\n if n == 1:\r\n return False\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\n\r\ndef sieve(n):\r\n arr = [True] * (n + 1)\r\n i = 2\r\n while i * i <= n:\r\n if is_prime(i):\r\n j = i * i\r\n while j <= n:\r\n arr[j] = False\r\n j += i\r\n i += 1\r\n return [i for i in range(2, n + 1) if arr[i]]\r\n\r\n\r\n##################################################################\r\n\r\n# find_length(n)\r\n# count_zeros(n)\r\n# factorial(n)\r\n# gcd(a, b)\r\n# lcm(a, b)\r\n# remove_all_zero(n)\r\n# is_prime(n)\r\n# sieve(n)\r\n\r\n\r\n##################################################################\r\n\r\n\r\ndef main():\r\n n, k = tuple(map(int, input().strip().split()))\r\n s = input()\r\n i, p = 0, ''\r\n f = True\r\n for x in s:\r\n if (p != x) & (p != ''):\r\n i = 1\r\n elif x == '#':\r\n i += 1\r\n if i >= k:\r\n f = False\r\n break\r\n p = x\r\n if f:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k=map(int,input().split())\r\ns=input()\r\ncounter=0\r\nflag='YES'\r\nfor i in range(1,n):\r\n if counter>=k:\r\n flag='NO'\r\n if s[i]=='#':\r\n counter+=1\r\n else:\r\n counter=0\r\nprint(flag)", "n, k = map(int, input().split())\ns = input()\n\nvisited = set()\n\nq = [0]\nvisited.add(0)\n\nwhile len(q) > 0:\n x = q.pop()\n if x == n-1:\n print(\"YES\")\n exit(0)\n for i in range(1, k+1):\n if x+i not in visited and x+i<n and s[x+i]=='.':\n visited.add(x+i)\n q.append(x+i)\n\nprint(\"NO\")", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-12-01 23:50:55\nLastEditTime: 2021-12-02 00:04:11\nDescription: Ksusha the Squirrel\nFilePath: CF299B.py\n'''\n\n\ndef func():\n n, k = map(int, input().strip().split())\n road = input().strip()\n if \"#\" in road:\n rock = list(filter(lambda el: el != \"\", road.split(\".\")))\n num = max(map(lambda el: len(el), rock))\n print(\"YES\" if num < k else \"NO\")\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n func()\n", "x=list(input().split(' '))\r\nn=int(x[0])\r\nk=int(x[1])\r\ny=[i for i in input()]\r\nchk2=0\r\ni=0\r\nwhile i<len(y):\r\n count=0\r\n chk=0\r\n while y[i]=='#':\r\n count+=1\r\n i+=1\r\n chk=1\r\n if chk!=1:\r\n i+=1\r\n if count>=k:\r\n print('NO')\r\n chk2=1\r\n break\r\nif chk2!=1:\r\n print('YES')", "length, k = tuple(int(i) for i in input().split())\r\nroad = input()\r\nflag = True\r\ni = 0\r\n\r\nwhile flag and i != length - 1:\r\n flag_ = True\r\n t = k\r\n while flag_ and t > -1:\r\n if i + t < length:\r\n if road[i + t] == '.':\r\n i = i + t\r\n flag_ = False\r\n t -= 1\r\n if t == -1:\r\n flag = False\r\n \r\nprint(('NO', 'YES')[i == length - 1])\r\n \r\n ", "n,k=map(int,input().split())\r\ns=input()\r\nans=0\r\nc=0\r\nfor i in range(n):\r\n if s[i]==\"#\":\r\n c+=1\r\n else:\r\n ans=max(ans,c)\r\n c=0\r\nif ans>=k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import re\nn, k = map(int, input().split())\nv = input()\nprint([\"NO\", \"YES\"][max(map(len, re.findall(\"#+\", v)), default=0) < k])\n", "def helper(road, k):\r\n i = 0\r\n while i < len(road):\r\n if road[i] != \".\":\r\n j = i\r\n while j < len(road):\r\n if road[j] == \".\":\r\n break\r\n j += 1\r\n if (j-i)>=k:\r\n return False\r\n i = j-1\r\n i += 1\r\n return True\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n road = input()\r\n if helper(road, k):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nmain()", "\r\nn,k=map(int,input().split())\r\nflag=True\r\na=list(input())\r\nflag=True\r\ni=1\r\n\r\nwhile (i < len(a)):\r\n j=i\r\n count=0\r\n while a[j]==\"#\" :\r\n j+=1\r\n count+=1\r\n if count>=k:\r\n print(\"NO\")\r\n flag=False\r\n break\r\n if flag==False:\r\n break\r\n i=j\r\n i+=1\r\n\r\nif flag==True:\r\n print(\"YES\")\r\n\r\n \r\n", "n,k = input().split()\r\na = input()\r\nif \"#\"*(int(k)) in a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=list(map(int,input().split()))\r\nx=input();v=[];c=0\r\nfor i in range(1,n+1):\r\n if x[i-1]==\".\":\r\n v.append(i)\r\nfor i in range(len(v)-1):\r\n if v[i+1]-v[i] >k:\r\n c=c+1 \r\nif c>0:\r\n print(\"NO\") \r\nelse:\r\n print(\"YES\") ", "n, k = map(int, input().split())\r\nprint('YES' if input().find('#' * k) == -1 else 'NO')", "n,k=map(int,input().split())\r\nz=\"#\"*k\r\nl=str(input())\r\nif z in l:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k = map(int,input().split())\r\na = input().strip()\r\ncount, flag = 0, True\r\nfor c in a:\r\n if c == '.':\r\n count = 0\r\n else:\r\n count+=1\r\n if count>=k:\r\n flag = False\r\n break\r\nprint('YES') if flag else print('NO')", "import sys\r\nn,k=list(map(int,sys.stdin.readline().split()))\r\ns=sys.stdin.readline()\r\nsys.stdout.write('YES\\n' if s.count('#'*k)==0 else 'NO\\n')\r\n", "n,k = map(int,input().split())\nb = input()\nc = \"\"\nif k > n:\n\tk = n\nfor x in range(k):\n\tc += \"#\"\nif c in b:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "n,k=list(map(int,input().split()))\r\ns=input()\r\nl1=[]\r\nfor i in range(1,n+1):\r\n if s[i-1]==\".\":\r\n l1.append(i)\r\nc=0\r\nfor i in range(len(l1)-1):\r\n x=(l1[i+1]-l1[i])-1\r\n if x>=k:\r\n c=c+1\r\nif c>0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "def main():\r\n n,k=map(int,input().split())\r\n road=input('')\r\n rock=0\r\n for i in range(n):\r\n if road[i]=='#':\r\n rock+=1\r\n if rock>=k:\r\n print('NO')\r\n return\r\n if road[i]==\".\":\r\n rock=0\r\n print('YES')\r\nmain()", "def stones_in_way(n,k,string):\r\n for i in range(n):\r\n if string[i]==\"#\":\r\n count=count+1\r\n elif string[i]==\".\":\r\n count=0\r\n if count>=k:\r\n print('NO')\r\n return\r\n print('YES')\r\n return\r\nn,k=map(int,input().split())\r\nstring=input()\r\nstones_in_way(n,k,string)\r\n", "from sys import stdin, stdout\r\n\r\nn, k = stdin.readline().split()\r\n\r\nans = \"YES\"\r\n\r\nroad = stdin.readline()\r\n\r\nbiggest_rock = 0\r\nlocal_rock = 0\r\nfor c in road:\r\n if c == '#':\r\n local_rock += 1\r\n if local_rock > biggest_rock:\r\n biggest_rock = local_rock\r\n else:\r\n local_rock = 0\r\n\r\nif biggest_rock >= int(k): ans = \"NO\"\r\n\r\nstdout.write(ans)", "n,k=map(int, input().split())\r\ns=input()\r\na=0\r\nfor i in s:\r\n if i=='.':\r\n a=0\r\n else:\r\n a+=1\r\n if a==k:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\nsum1=0\r\nb=0\r\nflag=True\r\nif s[len(s)-1]==\"#\":\r\n print(\"NO\")\r\nelse:\r\n for i in range(1,len(s)):\r\n if s[i]==\".\" and i-b<=k:\r\n b=i\r\n elif s[i]==\".\" and i-b>k:\r\n flag=False\r\n break\r\n if (flag):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n ", "n, k = map(int, input().split())\r\ns = input()\r\nx = 0\r\nfor i in range(1, n):\r\n if s[i] == '#' and x+1 < k:\r\n x+=1\r\n elif x+1 == k and s[i] == '#':\r\n print('NO')\r\n x+=1\r\n break\r\n if s[i] == '.':\r\n x = 0\r\nif x != k:\r\n print('YES')", "n, p = map(int, input().split())\r\na = input()\r\nif ('#'*p) in a:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n# FMZJMSOMPMSL\r\n", "\r\nn, k = map(int, input().split())\r\nl = list(input())\r\n\r\nmaxJump = 0\r\nco = 0\r\nfor i in range(n):\r\n\tif l[i] == '#':\r\n\t\tco += 1\r\n\r\n\telse:\r\n\t\tmaxJump = max(maxJump, co)\r\n\t\tco = 0\r\n\r\n\r\nif maxJump >= k:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n", "n, k = map(int, input().split())\r\na = input()\r\nmx, cur = 0, 0\r\nfor ch in a:\r\n if ch == '.':\r\n mx = max(mx, cur)\r\n cur = 0\r\n else:\r\n cur += 1\r\nprint(\"YES\") if mx < k else print(\"NO\")\r\n\r\n'''\r\n* So I drown it out \r\n* Like I always do\r\n* Dancing through our house\r\n* With the ghost of you\r\n'''\r\n", "n, k = map(int, input().split())\r\ns = input().strip()\r\n\r\ndef can_reach_end(start):\r\n while start < n:\r\n found_empty = False\r\n for j in range(start + 1, min(start + k + 1, n)):\r\n if s[j] == \".\":\r\n start = j\r\n found_empty = True\r\n break\r\n\r\n if not found_empty:\r\n return \"NO\"\r\n\r\n if start == n - 1:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nprint(can_reach_end(0))\r\n", "n, k = map(int, input().split())\r\n\r\ndaf = list(input())\r\n\r\nmax_rock = 0\r\ncur_rock = 0\r\nfor x in daf:\r\n if x == '#':\r\n cur_rock += 1\r\n max_rock = max(max_rock, cur_rock)\r\n else:\r\n cur_rock = 0\r\n\r\nif max_rock >= k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\nm = 0\r\nt = 0\r\ns = input()\r\nfor i in range(n):\r\n if s[i] == '#':\r\n t += 1\r\n else:\r\n m = max(m, t)\r\n t = 0\r\nif m >= k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nlist=[]\r\ni=0\r\nwhile(i<n):\r\n p=0\r\n while(s[i]=='#'):\r\n p+=1\r\n i+=1\r\n list.append(p)\r\n i+=1\r\nif(max(list)<k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "b=input().split()\r\nn=int(b[0])\r\nk=int(b[1])\r\nm=list(input())\r\nkol=0\r\nmaxkol=0\r\nfor i in range(n):\r\n if kol>maxkol:\r\n maxkol=kol\r\n if m[i]=='#':\r\n kol+=1\r\n else:\r\n kol=0\r\nprint('NO'if maxkol>=k else 'YES') ", "n,k = map(int, input().split())\r\ns = input()\r\nt = 0\r\nfor item in s:\r\n if item == '#':\r\n t+=1\r\n if (t==k) :\r\n print(\"NO\")\r\n exit()\r\n else:\r\n t=0\r\nprint(\"YES\")", "n, k = map(int, input().split())\r\ns = input()\r\ncnt = 0\r\nfor i in range(1,n-1):\r\n\tif s[i] == \"#\":\r\n\t\tcnt += 1\r\n\t\tif cnt >= k:\r\n\t\t\tprint (\"NO\")\r\n\t\t\texit()\r\n\telse:\r\n\t\tcnt = 0\r\nprint (\"YES\")\r\n\r\n", "n,k = map(int,input().split())\r\n\r\ns = input()\r\n\r\nl,m = 0, 0\r\nfor i in s:\r\n if i=='#':\r\n l+=1\r\n m = max(l, m)\r\n else:\r\n l=0\r\n\r\nif m <k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n ", "def main():\r\n n,k=input().split()\r\n n,k=int(n),int(k)\r\n doroga=input()\r\n if doroga.count('#'*k)>0:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nprint(main())", "n,k=map(int,input().split())\r\nl=list(input())\r\ni=0\r\nc=0\r\nwhile i<n:\r\n if l[i]=='#' and l[i-1]=='.':\r\n i-=1\r\n for j in range(1,k+1):\r\n if l[i+j]=='.':\r\n i+=j\r\n break\r\n else:\r\n c=1\r\n break\r\n i+=1\r\nif c==1:\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n", "\r\nn, k = map(int, input().split())\r\ns = input()\r\ni = n - 1\r\nrj = 0\r\nwhile(i > 0):\r\n \r\n if(s[i] == '.'):\r\n rj = 0\r\n else:\r\n if(rj == k - 1):\r\n break\r\n rj += 1\r\n i -= 1\r\nif(i == 0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a , b = map(int , input().split())\r\n\r\ns = input()\r\n\r\nobs = b*'#'\r\nif obs in s: print(\"NO\")\r\nelse: print(\"YES\")", "n, m = map(int, input(). split())\r\ns = input()\r\nans = 'YES'\r\nd = 0\r\nfor i in range(n):\r\n if s[i] == '#':\r\n d += 1\r\n else:\r\n if d >= m:\r\n ans = 'NO'\r\n break\r\n d = 0\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\nr=input()\r\na=list(r)\r\ncnt = 0\r\nfor i in range(n):\r\n if a[i]=='#':\r\n cnt+=1\r\n else:\r\n cnt=0\r\n if cnt==k:\r\n print(\"NO\")\r\n break\r\nif cnt!= k:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\ns = input().strip()\r\n\r\ndef can_reach_end(n, k, s):\r\n i = 0\r\n while i < n:\r\n found_empty = False\r\n for j in range(i + 1, min(i + k + 1, n)):\r\n if s[j] == \".\":\r\n i = j\r\n found_empty = True\r\n break\r\n\r\n if not found_empty:\r\n return \"NO\"\r\n\r\n if i == n - 1:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nprint(can_reach_end(n, k, s))\r\n", "n, k = map(int, input().split())\r\ns = input()\r\nif s.find(\"#\" * k) == -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split())\r\nprint('YNEOS'['#'*k in input()::2])", "n,k = map(int,input().split())\r\ns = input()\r\nlast = 0\r\nflag = True\r\nfor i in range(1,len(s)):\r\n if s[i] == '#' and i-last>=k:\r\n flag = False\r\n break\r\n if s[i] == '.':\r\n last = i\r\nprint(\"YES\") if flag else print(\"NO\")", "X, Road = list(map(int, input().split())), input()\r\nprint(\"YES\" if \"#\" not in Road[0] + Road[-1] and X[1] * \"#\" not in Road else \"NO\")\r\n# UB_CodeForces\r\n# Advice: Keep an eye on your goals\r\n# Location: At home next to a cup of thyme tea\r\n# Caption: Now I am happy with this\r\n", "a=input().split(' ')\r\nb=input()\r\nc='#'*int(a[1])\r\nif (c in b):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\ns=input()\r\nif('#'*m in s):\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n", "n, k = map(int, input().split())\r\ns = str(input())\r\nflag = \"YES\"\r\n\r\nmaxDistance = 0\r\nfor i in range(len(s)):\r\n if s[i] == \".\":\r\n maxDistance = max(maxDistance, i+k)\r\n \r\n elif s[i] == \"#\" and i >= maxDistance:\r\n flag = \"NO\"\r\n break\r\n\r\nprint(flag)", "def f(s):\r\n\tfor i in s:\r\n\t\tc=i.count(\"#\")\r\n\t\tif c>=k:\r\n\t\t\treturn \"NO\"\r\n\treturn \"YES\"\r\nn,k=map(int,input().split())\r\ns=input().split(\".\")\r\n\r\nprint(f(s))", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nc = 0\r\nma = 0\r\nfor i in s:\r\n if i == '#':\r\n c += 1\r\n if ma < c:\r\n ma = c\r\n else:\r\n c = 0\r\n\r\nprint(\"YES\" if ma < k else \"NO\")", "n,m = map(int,input().split())\r\ns = input()\r\nc=0\r\ni=0\r\nwhile(i<n):\r\n\r\n if s[i]==\"#\":\r\n c+=1\r\n i+=1\r\n else:\r\n if c:\r\n if c not in range(m):\r\n print(\"NO\")\r\n exit()\r\n c=0\r\n i+=1\r\n\r\nprint(\"YES\")\r\n\r\n", "n,k =map(int,input().split())\r\na=input()\r\nprint(('YES','NO')[(k)*'#' in a])\r\n", "(N, K) = [int(x) for x in input().split()]\nroad = input()\nrocks = []\ncount = 0\nfor i in road:\n if i == '.':\n rocks.append(count)\n count = 0\n if i == '#':\n count += 1\n\nif max(rocks) >= K:\n print('NO')\nelse:\n print('YES')\n", "n, k = map(int, input().split())\r\ns = input()\r\nprint(\"NO\" if \"#\"*k in s else \"YES\")\r\n", "n , k = map(int,input().split())\r\nl = input()\r\nh = []\r\ncount1 = 0\r\nfor i in l:\r\n\tif i==\"#\":\r\n\t\tcount1 += 1\r\n\t\th.append(count1)\t\t\t\t\r\n\telif i==\".\":\r\n\t\tcount1 = 0\r\n\t\th.append(count1)\r\nif max(h)>=k:\r\n\tprint(\"NO\")\r\nelif max(h)<k or len(h)==0:\r\n\tprint(\"YES\")\t\t\t\r\n", "def main():\r\n n, m = [int(v) for v in input().split()]\r\n v = input()\r\n mv = 0\r\n while True:\r\n j = False\r\n for i in range(m, 0, -1):\r\n if mv + i >= n:\r\n print(\"YES\")\r\n return\r\n if v[mv + i] == '.':\r\n mv = mv + i\r\n j = True\r\n break\r\n\r\n if not j:\r\n print(\"NO\")\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "print(\"YES\" if list(map(int, input().split()))[1] * \"#\" not in input() else \"NO\")\r\n\r\n# UB_CodeForces\r\n# Advice: Keep an eye on your goals\r\n# Location: At home next to a cup of thyme tea\r\n# Caption: Now I am happy with this\r\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\na = list(input())\r\ni = 0\r\nj = []\r\nwhile i < n:\r\n if a[i] == \".\":\r\n j.append(i)\r\n i += 1\r\nh = []\r\nj.sort()\r\nf = 0\r\nwhile f < len(j) - 1:\r\n h.append(-j[f] + j[f+1] - 1)\r\n f += 1\r\nh.sort()\r\nif h.pop() >= k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "info = [int(x) for x in input().split()]\r\n\r\nstring = [char for char in input()]\r\n\r\nnums = []\r\nnum = 0\r\n\r\nfor i in range(len(string)):\r\n if string[i] == \"#\":\r\n num += 1\r\n else:\r\n if nums == 0:\r\n num = 0\r\n else:\r\n nums.append(num)\r\n num = 0\r\n\r\nif sorted(nums, reverse=True)[0] >= info[1]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "#AKS Input\r\n\r\n#x,y=map(int,input().split())\r\n \r\n#l=list(map(int,input().split()))\r\n \r\n#for _ in range(int(input())):\r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\nm=0\r\nq=0\r\nfor i in s:\r\n if i==\".\":\r\n m=max(q,m)\r\n q=0\r\n else:\r\n q+=1\r\n if m>=k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "(n, k) = map(int, input().split(' '))\ns = input()\n\nfurthest_jump = 0\ni = 0\njump = 0\n\nwhile i < n:\n if s[i] == '#':\n jump += 1\n else:\n if jump > furthest_jump:\n furthest_jump = jump\n jump = 0\n i += 1\n\nif furthest_jump < k:\n print('YES')\nelse:\n print('NO')", "n, k = list(map(int, input().split()))\r\ns = list(input())\r\nfreq = [0]*len(s)\r\nj = 0\r\nflag = 0\r\nfor i in range(len(s)):\r\n if (s[i] == \"#\"):\r\n freq[j] += 1\r\n \r\n else:\r\n j += 1\r\nfalse = False\r\nfor i in range(len(freq)):\r\n if (freq[i] > k-1):\r\n false = True\r\n break\r\nprint(\"NO\" if false else \"YES\")", "n,k=map(int,input().split())\r\ns=input().split('.')\r\nprint(['NO','YES'][len(max(s))<k])", "n, k = map(int, input().split())\nroad = input()\ncur_pos = 0 # текущая позиция на дороге\n\nwhile cur_pos < n - 1:\n next_pos = min(cur_pos + k, n - 1)\n\n while road[next_pos] == '#':\n next_pos -= 1\n \n if next_pos < cur_pos + 1:\n print(\"NO\")\n exit()\n\n cur_pos = next_pos\n\nprint(\"YES\")\n" ]

[ "#http://codeforces.com/contest/653/problem/A\r\nimport sys\r\n\r\nlen_input = input()\r\nseq_input = input().split()\r\n#seq_input = '18 55 16 17'.split()\r\n# seq_input = '40 41 43 44 44 44'.split()\r\n# seq_input = '5 972 3 4 1 4 970 971'.split()\r\n# seq_input = ''.split()\r\n# seq_input = '998 30 384 289 505 340 872 223 663 31 929 625 864 699 735 589 676 399 745 635 963 381 75 97 324 612 597 797 103 382 25 894 219 458 337 572 201 355 294 275 278 311 586 573 965 704 936 237 715 543'.split()\r\n\r\nseq = sorted([int(x) for x in seq_input])\r\nseq_red = sorted([int(x) for x in list(set(seq))])\r\n# print(seq)\r\n# print(seq_red)\r\n\r\nif len(seq_red) < 3:\r\n\tprint('NO') #less than two distinct options\r\n\tsys.exit()\r\n\r\nseq_sub = [seq_red[i] - seq_red[i+2] for i in range(len(seq_red)-2)]\r\nseq_truth = [1 if abs(x) < 3 else 0 for x in seq_sub]\r\nseq_sum = sum(seq_truth)\r\nif seq_sum == 0:\r\n\tprint('NO') #all values are too far apart\r\nelif seq_sum > 0:\r\n\tprint('YES')", "def optimal_size (t):\n if len(t) <= 2:\n return \"NO\"\n for x in range(len(t)-2):\n if abs(t[x+1] - t[x]) <= 2 and abs(t[x+2] - t[x]) <= 2 and abs(t[x+2] - t[x+1]) <= 2:\n return \"YES\"\n return \"NO\"\n\nn = int(input())\nt = list(map(int,input().split()))\nt = list(set(t))\nt = sorted(t)\n\nprint (optimal_size(t))\n \n", "def main():\n input()\n a, b = 0, -1\n for c in sorted(set(map(int, input().split()))):\n if a < b < c < a + 3:\n print(\"YES\")\n return\n a, b = b, c\n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nt = sorted(list(set([int(x) for x in input().split(' ')])))\r\n\r\nans = 'NO'\r\nfor i in range(len(t) - 2):\r\n if t[i + 2] - t[i] == 2:\r\n ans = 'YES'\r\n break\r\nprint(ans)\r\n\r\n", "n = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nans, stop = 'NO', False\r\nfor i in range(len(arr)):\r\n if not stop:\r\n track = [arr[i]]\r\n a = arr[i]\r\n for e in range(2):\r\n a += 1\r\n if a in arr:\r\n track.append(a)\r\n if len(track) == 3:\r\n ans = 'YES'\r\n stop = True\r\n break\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input()) # number of empty houses\r\nhouses = set(map(int, input().split())) # house numbers of empty houses (using a set to remove duplicates)\r\n\r\nfor house in houses:\r\n if house + 1 in houses and house + 2 in houses:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "def e_compativel(a, b):\n if abs(a - b) < 3 and abs(a - b) > 0:\n return True;\n return False;\n\ndef testar_compatibilidade_com_conjunto(a, bolas):\n for i in bolas:\n if not e_compativel(a, i):\n return False;\n return True;\n\ndef testar_combinacoes(bolas, bolasJaSelecionadas, n, nJaSelecionadas):\n if(nJaSelecionadas == 3):\n return True;\n for i in bolas:\n if testar_compatibilidade_com_conjunto(i, bolasJaSelecionadas):\n bolasJaSelecionadas.append(i);\n return testar_combinacoes(bolas, bolasJaSelecionadas, n, nJaSelecionadas + 1);\n return False;\n\ndef combinacao_bolas(bolas, n):\n for i in bolas:\n if(testar_combinacoes(bolas, [i], n, 1)):\n return True;\n return False;\n\ndef main():\n n = int(input());\n bolas = [];\n entrada = input().split();\n for i in range(n):\n bolas.append(int(entrada[i]));\n if(combinacao_bolas(bolas, n)):\n print(\"YES\");\n else:\n print(\"NO\");\n\nmain();\n \t\t \t \t \t\t\t\t \t \t \t \t \t", "n=int(input().split(\" \")[0])\r\ndls=input().split(\" \")\r\nbls=list()\r\nfor i in range(0,n):\r\n bls.append(int(dls[i]))\r\nfor i in bls:\r\n for j in bls:\r\n for k in bls:\r\n y=sorted([i,j,k])\r\n if y[1]-y[0]==y[2]-y[1]==1:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "c=1; input(); l=sorted(set(map(int,input().split())))\r\nfor i in range(len(l)-1):\r\n\tif l[i+1]-l[i]==1:c+=1\r\n\telse:c=1\r\n\tif c==3:break\r\nprint([\"NO\",\"YES\"][c==3])", "def solve():\n n=int(input())\n a=list(map(int,input().split()))\n c=[0 for i in range(1010)]\n for i in a:\n c[i]+=1\n for i in range(1,1000):\n if c[i+1]>0 and c[i]>0 and c[i+2]>0:\n print(\"YES\")\n return\n print(\"NO\")\n\ndef main():\n \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", "def checkIsValidBall(a, b):\n if(a == b or a > b + 2 or a < b - 2):\n return False\n return True\n\ndef bearandThreeBalls():\n n = int(input())\n array = list(map(int, input().split(' ')))\n array.sort()\n\n for i in range(0, n):\n for j in range(i+1, n):\n for k in range(j+1, n):\n if(checkIsValidBall(array[i], array[j]) and checkIsValidBall(array[i], array[k]) and checkIsValidBall(array[j], array[k])):\n return \"YES\"\n return \"NO\"\n\n\nif __name__ == \"__main__\":\n print(bearandThreeBalls())\n\n \t\t \t \t\t \t \t \t \t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(list(set(a)))\r\nk=0\r\nfor i in range(1,len(a)):\r\n if a[i]-1==a[i-1]:\r\n k+=2 \r\n else:\r\n k=0\r\n if k==4:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in a:\r\n if ((i+1) in a) and ((i-1) in a):\r\n print('YES')\r\n exit()\r\nprint('NO')", "# -*- coding: utf-8 -*-\n\n\nif __name__ == '__main__':\n # ignore number of balls\n _ = int(input())\n balls = [int(b) for b in input().split(' ')]\n balls.sort()\n\n satisfied = False\n\n for i in range(0, len(balls)):\n selected_balls = [balls[i]]\n\n for j in balls[i:]:\n if j in selected_balls:\n continue\n else:\n if (j - selected_balls[0]) > 2:\n break\n else:\n selected_balls.append(j)\n if(len(selected_balls)) == 3:\n satisfied = True\n break\n\n if satisfied:\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", "n = int(input())\nl = list(map(int, input().split()))\ntest = True\ndiff = []\n\ns = set(l)\n\np = []\nfor i in s:\n p.append(i)\n\nfor i in range(len(p)-1):\n diff.append(p[i+1]-p[i])\n\nfor i in p:\n if (i in p) and (i+1 in p) and (i+2 in p):\n print(\"YES\")\n test = False\n break\n\nif test: print(\"NO\")\n\n\t \t \t\t \t\t \t \t \t\t \t", "n = int(input())\r\nhouses = set(map(int, input().split()))\r\n\r\npossible = False\r\n\r\nfor i in houses:\r\n for j in houses:\r\n for k in houses:\r\n if abs(i - j) <= 2 and abs(j - k) <= 2 and abs(i - k) <= 2 and len({i,j,k}) == 3:\r\n possible = True\r\n break\r\n\r\n if possible:\r\n break\r\n\r\nif possible:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nsizes = list(map(int, input().split()))\n\nsizes.sort()\n\ndiffs = 0\nflag = 0\nfor i in range(n-1):\n d = sizes[i+1]-sizes[i]\n\n if d > 1:\n diffs = 0\n elif d == 1:\n diffs += 1\n else:\n i += 1\n\n if diffs == 2:\n flag = 1\n break\n\nif flag == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t\t \t \t\t \t\t\t \t\t\t \t\t \t\t", "n = int(input())\r\nballs = sorted([int(i) for i in input().split(' ')])\r\n\r\n#print(balls)\r\n\r\ndef main():\r\n\tmin_ball = balls[0]\r\n\tprev_ball = balls[0]\r\n\tgifts = 1\r\n\tfor i in range(1, len(balls)):\r\n\t\tif prev_ball == balls[i]:\r\n\t\t\tcontinue\r\n\t\telif balls[i] > min_ball+2:\r\n\t\t\tprev_ball = min_ball = balls[i]\r\n\t\t\tgifts = 1\r\n\t\t\tcontinue\r\n\r\n\t\tif gifts == 2:\r\n\t\t\treturn 'YES'\r\n\r\n\t\tgifts += 1\r\n\t\tprev_ball = balls[i]\r\n\treturn 'NO'\r\n\r\nprint(main())\r\n#import timeit\r\n#print(timeit.timeit('main()', setup='from __main__ import main'))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nfor i in l:\r\n if i+1 in l and i+2 in l:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nset_ = sorted(set(l))\r\nfor i in set_:\r\n\tif i + 1 in set_ and i + 2 in set_:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\r\nprint('NO')", "n=int(input())\r\nl=sorted(set(map(int,input().split())))\r\nfor i in range(1,len(l)-1):\r\n if l[i]-l[i-1]==1 and l[i+1]-l[i]==1: print('YES'); break\r\nelse: print('NO')", "\r\ninp = int(input())\r\nl = list(map(int,input().split()))\r\ns = set(l)\r\nfor i in l:\r\n if ((i+1) in s and (i-1) in s ):\r\n print(\"Yes\")\r\n break\r\nelse:\r\n print(\"No\")\r\n \r\n \r\n", "n = int(input())\r\npresents = list(set(map(int, input().split())))\r\npresents.sort()\r\n\r\nfor i in range(len(presents)):\r\n bal = 0\r\n\r\n for j in presents[i:i+3]:\r\n if abs(presents[i] - j) <= 2:\r\n bal += 1\r\n\r\n if bal == 3:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "#!/usr/bin/env python3\nimport collections, itertools, functools, math\n\ndef solve():\n n = int(input())\n t = list(sorted(set(map(int, input().split()))))\n\n n = len(t)\n for i in range(n):\n a = t[i]\n for j in range(i+1, n):\n b = t[j]\n for k in range(j+1, n):\n c = t[k]\n if c - a <= 2:\n return 'YES'\n return 'NO'\n\n\nif __name__ == '__main__':\n print(solve())\n\n", "n = int(input())\r\nt = [int (x) for x in input().split()]\r\n\r\nballs = []\r\n\r\nfor x in t:\r\n if len(balls) == 0:\r\n balls.append(x)\r\n else:\r\n if not (x in balls):\r\n balls.append(x)\r\n\r\nres = 'No'\r\n\r\nif len(balls) < 3:\r\n print(res)\r\nelse:\r\n balls.sort()\r\n for x in range(1, len(balls) -1):\r\n if balls[x+1] - balls[x-1] <= 2:\r\n res = 'Yes'\r\n break\r\n print(res)\r\n ", "t = int(input())\r\nl1 = [int(x) for x in input().split()]\r\nl1=list(set(l1))\r\nl1.sort()\r\ni=0\r\ndone=0\r\n#print(l1)\r\nwhile i<len(l1)-2:\r\n if l1[i+2]-l1[i]<=2:\r\n print(\"YES\")\r\n done=1\r\n break\r\n i+=1\r\nif not done:\r\n print(\"NO\")", "def func(a,b,c):\r\n if 0<abs(a-b) and abs(a-b)<=2 and 0<abs(b-c) and abs(c-b)<=2 and 0<abs(a-c) and abs(a-c)<=2:\r\n return 1\r\n else:\r\n return 0\r\nn=int(input(''))\r\nl=list(map(int,input().split()))\r\nm=0\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i!=j and i!=k and j!=k:\r\n if func(l[i],l[j],l[k])==1:\r\n m=1\r\n if m==1:\r\n break\r\nif m==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\na=list(map(int,input().split()))\r\na=list(set(a))\r\na.sort()\r\nf=-1\r\nfor i in range(len(a)-2):\r\n if a[i+2]-a[i+1]==1 and a[i+1]-a[i]==1:\r\n f=1\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\ninput()\r\na = sorted(list(set(list(map(lambda v: int(v), input().split())))))\r\nn = len(a)\r\n\r\nif n<3: print(\"NO\")\r\nelse:\r\n for i in range(1, n-1):\r\n if a[i+1]-a[i-1]==2:\r\n print(\"YES\")\r\n break\r\n else: print(\"NO\")\r\n\r\n\r\n", "__author__ = 'suvasish'\r\n\r\nimport sys\r\n\r\nn = int(input())\r\nins = list(map(int, input().split(\" \")))\r\nv = sorted(ins)\r\nfor i in range(0, len(v)):\r\n t = v[i]\r\n # print(t)\r\n t1 = t + 1\r\n t2 = t1 + 1\r\n if t1 in v and t2 in v:\r\n # print(t1, t2)\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nz = list(set(l))\r\nz.sort()\r\nx = []\r\nfor i in range(len(z)-2):\r\n if z[i+1] == z[i]+1 and z[i+1] == z[i+2]-1:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n\r\n \r\n \r\n", "n = int(input())\r\nballs = set(map(int, input().split()))\r\n\r\nfor ball in balls:\r\n if ball - 1 in balls and ball + 1 in balls:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def main():\n input()\n ball_sizes = [int(_) for _ in input().split()]\n ball_sizes = list(dict.fromkeys(ball_sizes))\n ball_sizes.sort()\n n = len(ball_sizes)\n\n try:\n next(i for i in range(n - 2) if ball_sizes[i + 2] - ball_sizes[i] == 2)\n print('YES')\n except StopIteration:\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nt = sorted(list(set(list(map(int, input().split())))))\r\n\r\nif len(t) < 3:\r\n print(\"NO\")\r\nelse:\r\n i = 0\r\n while i < len(t)-2:\r\n if abs(t[i] - t[i+1]) <= 2 and abs(t[i+1] - t[i+2]) <= 2 and abs(t[i+2] - t[i]) <= 2:\r\n print(\"YES\")\r\n break\r\n i += 1\r\n else:\r\n print(\"NO\")\r\n", "n=int(input())\r\n\r\n\r\nt=list(map(int,input().split()))\r\n\r\n\r\nt.sort()\r\ns=0\r\nfor j in range(n):\r\n if t[j]+1 in t:\r\n if t[j]+2 in t:\r\n print('YES')\r\n s+=1\r\n break\r\nif s==0:\r\n print('NO')\r\n", "n,s=input(),sorted(set(map(int,input().split())))\r\nfor _ in s:\r\n if _+1 in s and _+2 in s:print(\"YES\");break\r\nelse:print(\"NO\")\r\n", "n = int(input())\r\nl = sorted(map(int, input().split()))\r\n\r\nfor i in l:\r\n\tm = l[:]\r\n\tfor j in range(n):\r\n\t\tm[j] -= i\r\n\tif {0,1,2} <= set(m):\r\n\t\tprint('YES')\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')", "n=int(input())\nsizes=sorted(list(set(map(int, input().split(' ')))))\n\ndef isThree(z):\n for i in range(2,len(z)):\n if abs(z[i-2]-z[i])<=2:\n return True\n return False\n\nif isThree(sizes):\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\na=set(a)\r\na=list(a)\r\nfor i in range(len(a)):\r\n if a[i] in a and a[i]+1 in a and a[i]+2 in a:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n=int(input())\r\nx=list(map(int,input().split()))\r\n\r\ns=set(x)\r\nl=len(s)\r\nx1=list(s)\r\nx1.sort()\r\nok=False\r\nfor i in range(l-2):\r\n if(x1[i+1]-x1[i]==1 and x1[i+2]-x1[i+1]==1):\r\n ok=True\r\n break\r\nif(ok):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f=0\r\nn = int(input())\r\na = set(map(int,input().split()))\r\na = list(a)\r\na.sort()\r\nn = len(a)\r\nfor i in range(n-2):\r\n if a[i]+1==a[i+1] and a[i+1]+1==a[i+2] and a[i]+2==a[i+2]:\r\n f=1\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\nl=input().split()\nl=[ int(i) for i in l ]\nl.sort()\nc=1\nm=[]\nfor i in l:\n\tif i not in m:\n\t\tm.append(i) \nfor i in range(len(m)-2):\n\t#for j in range(i,n):\n\tif m[i+2]-m[i]==2 and m[i+1]-m[i]==1:\n\t\tc=0\n\t\tbreak\nif c==0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "#!/usr/bin/python3\n\nn = int(input())\na = map(int, input().split())\na = list(set(a))\na.sort()\n\nfor i in range(len(a) - 2):\n if a[i + 1] == a[i] + 1 and a[i + 2] == a[i] + 2:\n print(\"YES\")\n exit(0)\n\nprint(\"NO\")\n", "def bin(arr, n):\r\n l = 0\r\n r = len(arr) - 1\r\n while l <= r:\r\n m = (l + r) // 2\r\n if arr[m] == n:\r\n return True\r\n elif arr[m] < n:\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n return False \r\n\r\nn = int(input())\r\narr = [int(i) for i in input().strip().split()]\r\narr.sort()\r\nb = True\r\nfor i in arr:\r\n if bin(arr, i+1) and bin(arr, i+2):\r\n print('YES')\r\n b = False\r\n break\r\nif b:\r\n print('NO')", "n = int(input())\nballs = list(map(int, input().split()))\n\nyes = False\nfor i in range(n):\n for j in range(n):\n if balls[i] != balls[j] and abs(balls[i] - balls[j]) <= 2:\n for k in range(n):\n if balls[k] != balls[i] and balls[k] != balls[j] and abs(balls[i] - balls[k]) < 2 and abs(balls[j] - balls[k]) < 2:\n yes = True\n break\n\nprint(\"YES\" if yes else \"NO\")\n", "\r\nn=int(input())\r\narr=list(map(int,input().rstrip().split()))\r\narr1=[0]*1001\r\nfor e in range(n):arr1[arr[e]]+=1\r\nt=False\r\nfor e in range(1001-2):\r\n if arr1[e]!=0 and arr1[e+1]!=0 and arr1[e+2]!=0:t=True;break\r\nif t :print(\"YES\")\r\nelse:print(\"NO\") ", "n = int(input())\r\nmass = list(map(int, input().split()))\r\nmass.sort()\r\ntmp_mass = []\r\nflag = False\r\nfor i in range(n):\r\n if mass[i] in tmp_mass:\r\n continue\r\n else:\r\n tmp_mass.append(mass[i])\r\n#print(tmp_mass)\r\nfor i in range(len(tmp_mass) - 2):\r\n if tmp_mass[i+1] - tmp_mass[i] <= 2:\r\n if tmp_mass[i+2] - tmp_mass[i] <= 2:\r\n flag = True\r\n #print(tmp_mass[i], tmp_mass[i+1], tmp_mass[i+2])\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\na = set(map(int, input().split()))\r\na = list(a)\r\na.sort()\r\nfor x, z in zip(a, a[2:]):\r\n if z == x + 2:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nstring = input()\r\nsizes = sorted(map(int, string.split()))\r\ncondition = False\r\nfor x in range(n - 2):\r\n for y in range(x + 1, n - 1):\r\n for z in range(y + 1, n):\r\n a, b, c = sizes[x], sizes[y], sizes[z]\r\n if a != b and b != c and c - a <= 2:\r\n print(\"YES\")\r\n condition = True\r\n break\r\n if condition:\r\n break\r\n if condition:\r\n break\r\nelse:\r\n print(\"NO\")", "import sys\nfrom typing import List\n'''\n找到三个连续的数\n'''\n\n\ndef run(num_str: str):\n nums = [int(d) for d in num_str.split(' ')]\n mp = dict()\n for d in nums:\n mp[d] = 1\n for n in range(d-2, d+1):\n if mp.get(n) == 1 and mp.get(n+1) == 1 and mp.get(n+2) == 1:\n return 'YES'\n\n return \"NO\"\n\n\nif sys.argv[-1] == 't':\n cases = [\n [\"18 55 16 17\", \"YES\"],\n [\"40 41 43 44 44 44\", \"NO\"],\n [\"5 972 3 4 1 4 970 971\", \"YES\"]\n ]\n for case in cases:\n r = run(case[0])\n if r != case[1]:\n print(case, r)\nelse:\n input('')\n print(run(input('')))\n\n\t \t\t\t \t \t \t\t\t\t \t \t\t", "def f(n,arr):\r\n for k in range(0,n-2):\r\n p1=arr[k]\r\n \r\n for i in range(k+1,n-1):\r\n p2=arr[i]\r\n \r\n for j in range(i+1,n):\r\n \r\n if p1!=p2 and p2!=arr[j] and max(p1,p2,arr[j])-min(p1,p2,arr[j])==2:\r\n \r\n return \"YES\"\r\n return \"NO\" \r\n \r\n\r\nn=int(input())\r\narr=[int(i) for i in input().split()]\r\nprint(f(n,arr)) ", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\n\t\t\r\nfor i in range(n):\r\n\tfor j in range(i+1, n):\r\n\t\tif t[i] == t[j] or abs(t[i]-t[j]) > 2:\r\n\t\t\tcontinue\r\n\t\tfor k in range(j+1, n):\r\n\t\t\tif t[i] == t[k] or t[j] == t[k] or abs(t[i]-t[k]) > 2 or abs(t[j]-t[k]) > 2:\r\n\t\t\t\tcontinue\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\nprint(\"NO\")\r\n\r\n", "#in the name of god\r\n#Mr_rubik\r\n#http://codeforces.com/problemset/problem/653/A\r\nn=int(input());solve=[]\r\na=list(map(int, input().split()))\r\nfor i in a:\r\n if i in solve:flag=1\r\n else:solve.append(i)\r\nsolve.sort()\r\nfor i in range (len(solve)-2):\r\n if ((solve[i+2]-solve[i+1])==1 and (solve[i+1]-solve[i])==1):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "def main():\r\n ans=\"YES\"\r\n num=int(input())\r\n sizes=list(map(int,input().split()))\r\n set_sizes=set(sizes)\r\n distinct_sizes=list(set_sizes)\r\n for i in range (len(distinct_sizes)):\r\n a=distinct_sizes[i]\r\n count=0\r\n for j in range (len(distinct_sizes)):\r\n if distinct_sizes[j]>a and abs(a-distinct_sizes[j])==1:\r\n count+=1\r\n if distinct_sizes[j]>a and abs(a-distinct_sizes[j])==2:\r\n count+=1\r\n if count==2:\r\n print(ans)\r\n return\r\n ans=\"NO\"\r\n print(ans)\r\nmain()", "n = int(input())\r\nt = list(set(map(int, input().split())))\r\nt.sort()\r\nl = len(t)\r\nif l < 3:\r\n print(\"NO\")\r\n exit()\r\nf = t[0]\r\ns = t[1]\r\ntr = False\r\nfor i in range(2, len(t)):\r\n if t[i]-f <= 2:\r\n tr = True\r\n break\r\n else:\r\n f = s\r\n s = t[i]\r\nif tr:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=int(input())\nl=list(map(int,input().strip().split(' ')))\nfor c in l:\n if c+1 in l and c+2 in l or c-1 in l and c-2 in l:\n print(\"YES\")\n exit()\nprint(\"NO\")", "n, t = int(input()), set(int(i) for i in input().split())\nres = \"NO\"\nfor i in t:\n if i - 1 in t and i + 1 in t:\n res = \"YES\"\n break\nprint(res)\n", "input()\nv = sorted(set(map(int, input().split())))\nfor i, x in enumerate(v[:-2]):\n if v[i + 1] == x + 1 and v[i + 2] == x + 2:\n print(\"YES\")\n exit()\nprint(\"NO\")\n", "x = int(input())\r\ny = input()\r\nz = y.split()\r\nw = [int(d) for d in z]\r\nw.sort()\r\nm = []\r\nflag = False\r\ni = 0\r\n\r\nfor num in w:\r\n if w.count(num + 1) != 0 and w.count(num + 2) != 0:\r\n flag = True\r\n \r\n else:\r\n continue\r\nif flag == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef solve(A):\r\n for B in itertools.combinations(A, 3):\r\n if len(set(B)) == 3 and max(B) - min(B) <= 2:\r\n return True\r\n return False\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n if solve(A):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ndaf = set(map(int, input().split()))\r\ndaf = sorted(daf)\r\nfor i in range(len(daf) - 2):\r\n if daf[i+2] - daf[i] == 2:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def solution():\n n = int(input())\n\n # numbers\n str = input().split(' ')\n\n s = set()\n for num in str:\n s.add(int(num))\n\n ls = sorted(list(s))\n\n length = len(ls)\n if length < 3:\n print(\"NO\")\n return\n else:\n for i in range(1, length-1):\n if abs(ls[i-1] - ls[i+1]) <= 2:\n print(\"YES\")\n return\n print(\"NO\")\n\nsolution()\n\t\t\t \t\t\t \t \t \t \t \t \t \t", "import sys\r\n\r\nn = sys.stdin.readline()\r\nm = []\r\n\r\n\r\ndef cont(i: int, li: list) -> bool:\r\n return i in li and i - 1 in li and i + 1 in li\r\n\r\n\r\nfor l in sys.stdin:\r\n m = sorted([int(x) for x in l.split()])\r\nif any(cont(i, m) for i in m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n n = int(input())\r\n t = list(map(int,input().split()))\r\n t.sort()\r\n count=1\r\n for i in range (n-1):\r\n if t[i+1]-t[i]==1:\r\n count += 1\r\n if count==3:\r\n print(\"YES\")\r\n break\r\n elif t[i+1]-t[i]>1:\r\n count = 1\r\n else:\r\n print(\"NO\")\r\nmain()\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nm=[0]*1000\r\nfor i in range(n):\r\n m[t[i]-1]=1\r\nk=0\r\nfor i in range(1000-2):\r\n p=m[i]+m[i+1]+m[i+2]\r\n if p==3:\r\n k=1\r\nif k==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "def main():\n n = int(input())\n\n sizes = [int(i) for i in input().split()]\n\n sizes = list(set(sizes))\n\n sizes.sort()\n\n ok = False\n if(len(sizes) >= 3):\n for i in range(len(sizes)):\n if(i+2 < len(sizes) and sizes[i+2] - sizes[i] <= 2):\n ok = True\n break\n if(ok):\n print(\"YES\")\n else:\n print(\"NO\")\n \nmain()\n \t \t\t \t\t\t \t \t \t\t\t\t \t", "n = int(input())\r\nt = set(map(int , input().split()))\r\nx = list(t)\r\nx.sort()\r\na=0\r\nfor i in x:\r\n if i+1 in x and i+2 in x:\r\n a = 1\r\n break\r\nif a==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def sequenceOfThree(balls):\n i = 0\n while i<len(balls)-2:\n if(balls[i+1]-balls[i]==1):\n i+=1\n while(i<len(balls)-1 and balls[i]==balls[i+1]):\n i+=1\n if(i<len(balls)-1 and balls[i+1]-balls[i]==1):\n return True\n i+=1\n return False\n\nnumberOfBalls = int(input())\nballs = [int(n) for n in input().split()]\nballs.sort()\nif(sequenceOfThree(balls)):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t\t\t \t\t\t \t\t\t \t \t\t\t", "n=int(input())\r\nt=list(map(int,input().split()))\r\nans=set(t)\r\na=[]\r\na+=ans\r\na=sorted(a, reverse=True)\r\nm=0\r\nfor i in range (len(a)-2):\r\n if 0<a[i]-a[i+1]<=2 and 0<a[i]-a[i+2]<=2:\r\n print('Yes')\r\n m=1\r\n break\r\nif m==0:\r\n print('No')\r\n \r\n \r\n", "n=int(input())\r\nm=sorted(map(int,input().split()))\r\nfor i in range(n-2):\r\n\ta=m[i]\r\n\tif a+1 in m and a+2 in m:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\ns = list(set(t))\r\ns.sort()\r\nn = len(s)\r\nans = \"NO\"\r\nfor i in range(n - 2):\r\n if s[i] + 2 == s[i + 1] + 1 == s[i + 2]:\r\n ans = \"YES\"\r\n break\r\nprint(ans)", "n=int(input())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\nt2=[]\r\nsen=-1\r\nflag=False\r\nfor i in range(len(t)-1):\r\n if t[i]!=sen:\r\n for j in range(i+1,len(t)):\r\n if t[i]==t[j]:\r\n t[j]=sen\r\nfor i in range(len(t)):\r\n if t[i]!=sen:\r\n t2.append(t[i])\r\nfor i in range(len(t2)-2):\r\n if t2[i]+1==t2[i+1] and t2[i+1]+1==t2[i+2]:\r\n print('YES')\r\n flag=True\r\n break\r\nif flag==False:\r\n print('NO')\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr = list(set(arr))\r\narr.sort()\r\n\r\nfor i in range(len(arr) - 2):\r\n if (arr[i] + 1 == arr[i + 1 ] and arr[i + 1 ] + 1 == arr[i + 2 ]):\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "n = int(input())\r\nt = sorted(list(map(int, input().split())))\r\nfor i in range(n-2):\r\n\tif t[i]+1 in t and t[i]+2 in t:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nflag = False\r\naa = []\r\nfor i in range(n):\r\n if a[i] not in aa:\r\n aa.append(a[i])\r\nfor i in range(len(aa)-2):\r\n if aa[i+1] == aa[i]+1 and aa[i+2] == aa[i+1]+1:\r\n flag = True\r\nprint(\"YES\") if flag == True else print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\ns=sorted(set(a))\r\nfor i in range(len(s)-2):\r\n x,y,z=s[i],s[i+1],s[i+2]\r\n if z-x==2:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "checker = 0\r\n\r\nn = int(input())\r\n\r\nlst = [int(n) for n in input().split()]\r\n\r\nunique_lst = []\r\n\r\nfor i in range(len(lst)):\r\n if lst[i] not in unique_lst:\r\n unique_lst.append(lst[i])\r\n\r\nfor i in range(len(unique_lst)):\r\n for j in range(i+1, len(unique_lst)):\r\n if unique_lst[i] < unique_lst[j]:\r\n unique_lst[i], unique_lst[j] = unique_lst[j], unique_lst[i]\r\n\r\nunique_lst.reverse()\r\n\r\nchecker = 0\r\n\r\nif len(unique_lst) > 2:\r\n for i in range(len(unique_lst) - 2):\r\n if unique_lst[i + 2] - unique_lst [i] <= 2:\r\n checker += 1\r\n\r\nif checker > 0:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\n\nballs = [int(x) for x in input().split(\" \")]\n\nselected = set()\n\nballs.sort()\n\ni = 0\nfor i in range(n):\n for j in range(i, n):\n for k in range(j, n):\n if balls[k] != balls[i] and balls[i] != balls[j] and balls[j] != balls[k]:\n if max(balls[i], balls[j], balls[k]) - min(balls[i], balls[j], balls[k]) < 3:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\t\t \t \t\t\t \t \t \t\t \t \t \t\t\t\t\t", "n = int(input())\r\nb = list(map(int, input().split()))\r\nb=set(b)\r\na=sorted(list(set(b)))\r\n\r\ndef check(x):\r\n for i in range(1,len(a)-1):\r\n if x[i]!=x[i-1] and x[i]!=x[i+1]:\r\n if x[i+1]-x[i-1]<=2:\r\n return 'YES'\r\n return 'NO'\r\nprint(check(a))\r\n", "from sys import stdin\ninFile = stdin\ntokens = []\ntokens_next = 0\n\ndef next_str():\n global tokens, tokens_next\n while tokens_next >= len(tokens):\n tokens = inFile.readline().split()\n tokens_next = 0\n tokens_next += 1\n return tokens[tokens_next - 1]\n\ndef nextInt():\n return int(next_str())\n\nfrom itertools import combinations\n\nn = nextInt()\na = [nextInt() for i in range(n)]\n \nfor p in combinations(a, 3):\n if max(p) - min(p) <= 2 and len(set(p)) == 3:\n print('YES')\n exit()\n \nprint('NO')", "from itertools import combinations\r\nimport sys\r\nn = int(input(\"\"))\r\nlst = list(map(int, input().split()))\r\n\r\nfor item in combinations(lst, 3):\r\n if item[0] == item[1] or item[0] == item[2] or item[1] == item[2]:\r\n continue\r\n if abs(item[0] - item[1]) > 2 or abs(item[0] - item[2]) > 2 or abs(item[2] - item[1]) > 2:\r\n continue\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nf = 0\r\nfor i in range(n):\r\n if a[i] in a and (a[i] + 1) in a and (a[i] + 2) in a:\r\n f = 1\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "def ball():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n temp=[0]*(max(a)+1)\r\n for i in range(n):\r\n temp[a[i]]+=1 \r\n for i in range(max(a)-1):\r\n if temp[i]>0 and temp[i+1]>0 and temp[i+2]>0 :\r\n return(\"YES\")\r\n return \"NO\"\r\nprint(ball())\r\n", "n = input()\r\nans=0\r\na=[int(x) for x in input().split()]\r\nfor i in a:\r\n\tfor j in a:\r\n\t\tfor k in a:\r\n\t\t\tif i!=j and j!=k and i!=k and abs(i-k) <=2 and abs(j-k) <=2 and abs(i-j) <=2:\r\n\t\t\t\tans=1\r\nif ans==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\n\nts = sorted(list(set([int(t) for t in input().split()])))\n\nfor i in range(len(ts) - 2):\n if ts[i] + 1 == ts[i+1] and ts[i+1] + 1 == ts[i+2]:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "n = int(input())\r\nt = list(map(int,input().split(\" \")))\r\nx = sorted(t)\r\n #if(abs(x[i-1]-x[i])<=2 and abs(x[i]-x[i+1])<=2 and abs(x[i+1]-x[i-1])<=2 and x[i-1]!=x[i] and x[i]!=x[i+1] and x[i+1]!=x[i-1]):\r\nfor i in x:\r\n for j in x:\r\n for k in x:\r\n y=sorted([i,j,k])\r\n if y[1]-y[0]==y[2]-y[1]==1:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "def main():\r\n n = int(input())\r\n array = set(list(map(int, input().split())))\r\n flag = False\r\n for x in array:\r\n if (x + 1) in array and (x + 2) in array:\r\n flag = True\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input().strip())\r\nd={}\r\nfor i in input().strip().split():\r\n x=int(i)\r\n if x not in d:\r\n d[x]=1\r\na=list(d.keys())\r\na.sort()\r\nfor i in range(len(a)-2):\r\n if a[i+2]-a[i]<=2:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "def bear_and_the_balls():\n n = int(input())\n bolas = input().split()\n ordenado = list(map(int, bolas))\n l = []\n ordenado.sort()\n last = -99999\n certo = 0\n for num in ordenado:\n if(num!=last):\n l.append(num)\n if(len(l)==3):\n if(l[0]==l[1]-1 and l[0]==l[2]-2):\n certo = 1\n break\n l.pop(0)\n last = num\n print('YES') if certo else print('NO')\n \nbear_and_the_balls()\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\nm = list(map(int, input().split()))\r\nans = False\r\nfor i in m:\r\n for j in m:\r\n for k in m:\r\n s = set()\r\n h = []\r\n s.add(i)\r\n s.add(j)\r\n s.add(k)\r\n h.append(i)\r\n h.append(j)\r\n h.append(k)\r\n h.sort()\r\n ans = ans or (abs(h[0] - h[2]) <= 2 and len(s) == 3)\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nnumber_of_balls = int(input())\r\nsizes = list(map(int, input().split()))\r\nsizes_sort = sorted(set(sizes))\r\n\r\n\r\n\r\nfor index in range(len(sizes_sort) - 2):\r\n if sizes_sort[index] == sizes_sort[index+1] - 1 and sizes_sort[index] == sizes_sort[index+2] - 2:\r\n print(\"YES\")\r\n break\r\n\r\nelse:\r\n print('NO')", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-06 22:54:59\nLastEditTime: 2021-11-06 23:05:26\nDescription: Bear and Three Balls\nFilePath: CF653A.py\n'''\n\n\ndef func():\n _ = int(input())\n balls = sorted(list(set(map(int, input().strip().split()))))\n\n for i in range(2, len(balls)):\n if balls[i - 2] + 2 == balls[i - 1] + 1 == balls[i]:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\r\ns = set(list(map(int,input().split())))\r\n\r\ns = sorted(s)\r\nflag = False\r\n\r\nfor i in range(len(s)-2):\r\n if s[i+2] - s[i] == 2:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\n\r\nisPossible = False\r\n\r\nwhile len(t) > 2:\r\n current = t[0]\r\n plusOne = current + 1\r\n plusTwo = current + 2\r\n minusOne = current - 1\r\n minusTwo = current - 2\r\n\r\n if plusOne in t and plusTwo in t:\r\n isPossible = True\r\n break\r\n\r\n elif plusOne in t and minusOne in t:\r\n isPossible = True\r\n break\r\n\r\n elif minusOne in t and minusTwo in t:\r\n isPossible = True\r\n break\r\n\r\n else:\r\n t.remove(current)\r\n\r\nif isPossible:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(0,len(b)):\r\n if (b[i]+1 in b and b[i]+2 in b) or (b[i]-2 in b and b[i]-1 in b) or (b[i]+1 in b and b[i]-1 in b):\r\n print('YES')\r\n exit()\r\n else:\r\n c+=1\r\nprint('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 5 03:55:20 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/653/A --- Alexis Galvan\r\n\r\n\r\ndef bear_friends():\r\n \r\n total = int(input())\r\n \r\n balls = list(map(int, input().split()))\r\n \r\n dic = {}\r\n \r\n for i in range(len(balls)):\r\n dic[balls[i]] = 1\r\n \r\n if (balls[i]+1) in dic and (balls[i]+2) in dic:\r\n return 'YES'\r\n elif (balls[i]+1) in dic and (balls[i]-1) in dic:\r\n return 'YES'\r\n elif (balls[i]-1) in dic and (balls[i]-2) in dic:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nA = bear_friends()\r\nprint(A)", "def main(n, a):\n def valid(i, j, k):\n if i == j or j == k or i == k:\n return False\n if abs(i - j) > 2 or abs(i - k) > 2 or abs(j - k) > 2:\n return False\n return True\n for i in range(n):\n for j in range(i + 1, n):\n for k in range(j + 1, n):\n if valid(a[i], a[j], a[k]):\n return \"YES\"\n return \"NO\"\n \nprint(main(int(input()), list(map(int,input().split(' ')))))\n", "n=int(input())\r\nball=input().split(\" \")\r\ncnt=0\r\nfor i in range(len(ball)):\r\n a=str((ball[i]))\r\n b=str(int(ball[i])+1)\r\n c=str(int(ball[i])+2)\r\n sum=0\r\n if a in ball:\r\n sum+=1\r\n if b in ball:\r\n sum+=1\r\n if c in ball:\r\n sum+=1\r\n if sum==3:\r\n print(\"YES\")\r\n cnt+=1\r\n break\r\nif cnt!=1:\r\n print(\"NO\")", "n = input()\r\nx = input().split()\r\nans = [0 for i in range(0, 1003)]\r\nfor i in x :\r\n if ans[int(i)] == 0 :\r\n ans[int(i)] = 1\r\n\r\nfor i in range(2, 1003) :\r\n if ans[i] == 1 and ans[i - 1] == 1 and ans[i - 2] == 1 :\r\n print('YES')\r\n break\r\nelse :\r\n print('NO')", "n = int(input())\r\nt = list(map(int,input().split()))\r\nc = 'NO'\r\nfor i in range(n):\r\n if t.count(t[i]+1) != 0 and t.count(t[i]+2) != 0:\r\n c = 'YES'\r\n break\r\nprint(c)", "n = int(input())\r\na = 0\r\nx= list(map(int,input().split()))\r\nfor i in x:\r\n if ((i+1)in x and (i+2)in x) or ((i-1)in x and (i+1)in x) or((i-1)in x and (i-2)in x):\r\n a=1\r\n break\r\nif a==1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nt = list(map(int, input().split()))\r\nt = list(set(t))\r\nt.sort(reverse=True)\r\n\r\nfor i in range(len(t)):\r\n if len(t) > i+2:\r\n if t[i] - t[i+1] <= 1:\r\n if t[i+1] - t[i+2] <= 1:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break", "#----------------------------\n# Matheus de Souza Oliveira |\n# RA: 203407 |\n#----------------------------\n\nfrom itertools import combinations\n\nn = int(input())\nballs = list(map(int, input().split()))\ncombinations = combinations(balls, 3)\nfound = False\n\nfor combination in combinations:\n if abs(combination[0]-combination[1]) <= 2 and abs(combination[1] - combination[2]) <= 2 and abs(combination[0] - combination[2]) <= 2:\n if combination.count(combination[0]) == 1 and combination.count(combination[1]) == 1 and combination.count(combination[2]) == 1:\n found = True\n break\n\nif found:\n print(\"YES\")\n\nelse:\n print(\"NO\")\n\n \t\t\t\t \t \t \t\t \t \t \t \t \t \t\t", "i = int(input())\r\nn = list(map(int, input().split()))\r\nn = sorted(list(set(n)))\r\nresult = 'NO'\r\nfor x in range(len(n) - 2):\r\n if (n[x + 2] - n[x + 1] >= n[x + 1] - n[x] > 0) and (n[x + 2] - n[x + 1] <= n[x + 1] - n[x] < 2):\r\n result = 'YES'\r\nprint(result)\r\n", "n = int(input())\r\na = sorted(set(list(map(int,input().split()))))\r\n\r\nfor i in range(2,n):\r\n t = a[i-2:i+1]\r\n if len(set(a[i-2:i+1]))==3 and a[i]-a[i-2]<=2:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "a=int(input())\r\nl=sorted(set(map(int,input().split())))\r\nfor i in range(len(l)-2):\r\n if l[i]+2==l[i+2]: print('YES'); break\r\nelse: print(\"NO\")\r\n ", "#!/usr/bin/python3\n\ndef good_pair(a, b):\n return 0 < (max(a, b) - min(a, b)) <= 2\n\nn = int(input())\nballs = sorted(list(map(int, input().split())))\nans = \"NO\"\nfor i in range(n):\n a = balls[i]\n for j in range(i + 1, n):\n b = balls[j]\n for k in range(j + 1, n):\n c = balls[k]\n if good_pair(a, b) and good_pair(b, c) and good_pair(a, c):\n ans = \"YES\"\n break\n\nprint(ans)\n\n", "n , arr = int(input()) , list(map(int,input().split()))\r\nbuck = [0] * 3000\r\ni = 0\r\nfor i in range(n):\r\n\tbuck[arr[i]] += 1\r\n\ti += 1\r\n\r\ni = 0\r\nresult = 'NO'\r\nfor i in range(2000):\r\n\tif buck[i] > 0 and buck[i + 1] > 0 and buck[i + 2] > 0:\r\n\t\tresult = 'YES'\r\n\ti += 1\r\nprint(result)\r\n", "N = int(input())\r\nArr = list(map(int,input().split()))\r\nArr.sort()\r\nDict = {}\r\nfor i in range(N):\r\n Dict[Arr[i]] = 1\r\n\r\n\r\nLst = list(Dict.keys())\r\n\r\nCount = 0\r\nLen = len(Lst)\r\nif Len <= 2:\r\n print('NO')\r\nelse:\r\n for i in range(Len - 1):\r\n if Lst[i+1] - Lst[i] == 1:\r\n Count = Count + 1\r\n if Count >= 2:\r\n print('YES')\r\n break\r\n else:\r\n Count = 0\r\n\r\n else:\r\n print('NO')\r\n ", "a=int(input())\r\ns=set(list(map(int,input().split())))\r\ns=sorted(list(s))\r\nfor i in range(len(s)-2):\r\n if s[i]+2==s[i+1]+1==s[i+2]:\r\n print('YES')\r\n exit()\r\nprint('NO')", "length = input()\r\nnums = list(set(sorted(list(map(int,input().split())))))\r\nfor index in range(len(nums) - 2) :\r\n a = abs(nums[index] - nums[index + 1])\r\n b = abs(nums[index + 1] - nums[index + 2])\r\n c = abs(nums[index] - nums[index + 2])\r\n if a <= 2 and b <= 2 and c <= 2 : exit(print(\"YES\"))\r\nprint(\"NO\")", "n = int(input())\r\nballs = sorted(set(map(int, input().split())))\r\nprint(('NO','YES')[any(y - x <= 2 for x,y in zip(balls[:-2], balls[2:]))])", "n = int(input())\nll = list(map(int,input().split()))\n#l=sorted(list(set(ll)))\na=[0 for i in range(1001)]\n#print(a)\nmaxx=0\nfor i in ll:\n a[i]=1\n if i>maxx:\n maxx=i\n#print(a)\nflag=0\nmaxx+=1\nfor i in range(2,maxx):\n if(a[i]==1 and a[i-1]==1 and a[i-2]==1):\n flag=1\n break;\nif flag:\n print('YES')\nelse:\n print('NO')\n \n", "n=int(input())\nballs=input().split()\ndict={}\nballs=list(dict.fromkeys(balls))\nfor i in range(len(balls)):\n balls[i]=int(balls[i])\nballs.sort()\nstring=\"NO\"\nfor i in range(len(balls)-2):\n if balls[i+2]-balls[i]==2:\n string=\"YES\"\n break\nprint(string)\n\n\t\t \t\t \t \t \t \t\t\t \t\t \t\t\t", "n = int(input())\r\nballs = sorted(set(map(int, input().split())))\r\nprint(('NO', 'YES')[any(y-x<=2 for x,y in zip(balls[:-2], balls[2:]) ) ] )\r\n", "n = int(input())\r\nl = list(set(map(int, input().split())))\r\nl.sort()\r\nn = len(l)\r\ncnt = 0\r\ncheck = 0\r\nfor i in range(1, n):\r\n if l[i] == l[i - 1] + 1:\r\n cnt -=- 1\r\n else: cnt = 0\r\n if cnt == 2:\r\n check = 1\r\n break\r\nif check: print('YES')\r\nelse: print('NO')", "#Bear and three balls\r\nn = int(input())\r\nli = map(int,input().split())\r\nli = list(set(li))\r\nli.sort()\r\n#print(li)\r\nc = 0\r\nfor i in range(len(li)-1):\r\n if li[i+1]-li[i]==1:\r\n c+=1\r\n #print(li[i+1],li[i])\r\n else:\r\n c = 0\r\n if c==2:\r\n break\r\nif c==2:\r\n print('Yes')\r\nelse:\r\n print('No')", "import sys\r\nn, lst, a = int(input()), list(map(int, input().split())) + [10000000000], []\r\nlst.sort()\r\nfor x in range(n):\r\n if lst[x] != lst[x + 1]: a.append(lst[x])\r\na.sort()\r\nfor x in range(len(a) - 2):\r\n if a[x + 2] - a[x] < 3:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "n=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\ni=1\r\na=set(b)\r\na=list(a)\r\nfor i in range(len(a)-2):\r\n if abs(a[i]-a[i+1])<=2 and abs(a[i]-a[i+2])<=2 and abs(a[i+1]-a[i+2])<=2:\r\n print('YES')\r\n exit()\r\nprint('NO')", "t = int(input())\nn = list(map(int, input().split()))\n\nflag = 1\nfor b in n:\n if (b-2 in n and b-1 in n) or (b+2 in n and b+1 in n):\n print(\"YES\")\n flag = 0\n break\n\nif flag:\n print(\"NO\")\n \t \t \t \t\t \t\t \t \t \t", "n = int(input())\r\nballs = list(map(int, input().split()))\r\n\r\nfor i in range(n-2):\r\n for j in range(i+1, n-1):\r\n if balls[i] != balls[j] and abs(balls[i] - balls[j]) <= 2:\r\n for k in range(j+1, n):\r\n if balls[k] != balls[i] and balls[k] != balls[j] and abs(balls[j] - balls[k]) <= 2 and abs(balls[i] - balls[k]) <= 2:\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")\r\n", "n = int(input())\r\ns = sorted(set(map(int, input().split())))\r\nfor i in s:\r\n if i - 1 in s and i + 1 in s:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\nimport itertools\r\n\r\ncombos = itertools.combinations(arr,3)\r\n\r\nans = \"NO\"\r\n\r\nfor i in combos:\r\n if max(list(i)) - min(list(i)) <= 2 and len(i) == len(set(i)):\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)", "def addo(n, num, lista):\n\tfor i in range(n):\n\t\tlista.append(num)\n\treturn lista\n\nlis=[]\nlis=addo(1001, False, lis)\n\nn=int(input())\nnums=input().split()\nfor i in range(n):\n\tk=int(nums[i])\n\tlis[k]=True\n\nfor i in range(2, 1001):\n\tif(lis[i]==lis[i-1] and lis[i]==lis[i-2] and lis[i]==True):\n\t\tprint ('YES')\n\t\traise SystemExit\n\nprint ('NO')\n", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\nl.sort()\r\nfor i in l:\r\n if i+1 in l:\r\n if i+2 in l:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\nc=sorted(b)\r\nfor i in range(len(c)-2):\r\n if c[i]-c[i+2]>= -2:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "\n\n\n\ndef get(l: list) -> str:\n\n l.sort()\n\n for i in l:\n if i+1 in l and i+2 in l:\n return \"YES\"\n return \"NO\"\n\n\n\n\nif __name__ == '__main__':\n n = int(input())\n\n lst = input().split()\n lst = [int(x) for x in lst]\n\n print(get(lst))\n\n \t \t\t \t\t\t\t\t\t\t\t \t\t\t \t \t\t", "n = int(input())\r\naList = [int(x) for x in input().split()]\r\n\r\nfound = False\r\nfoundBottom = False\r\nfoundItself = False\r\nfoundTop = False\r\ncount = 0\r\n\r\nfor i in aList:\r\n if found:\r\n break\r\n if i in aList and not foundItself:\r\n count += 1\r\n foundItself = True\r\n if i + 1 in aList and not foundTop:\r\n count += 1\r\n foundTop = True\r\n if i - 1 in aList and not foundBottom:\r\n count += 1\r\n foundBottom = True\r\n if count >= 3 and not found:\r\n print(\"YES\")\r\n found = True\r\n count = 0\r\n foundBottom = False\r\n foundItself = False\r\n foundTop = False\r\n\r\nif not found:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=set(map(int,input().split()))\r\nl=list(l)\r\nl=sorted(l)\r\nif len(l)<3:\r\n print('NO')\r\n exit()\r\nfor i in range(len(l)-2):\r\n if l[i+1]-l[i]==1 and l[i+2]-l[i+1]==1:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n = int(input())\nt = input().split()\nt = [int(p) for p in t]\nfor i in range(n):\n one_more = t[i] + 1\n one_less = t[i] + 2\n if one_more in t and one_less in t:\n print('YES')\n exit(0)\nprint('NO')\n\t \t\t\t \t\t \t\t \t\t\t\t\t\t\t\t \t \t", "ans=\"NO\"\r\nx=int(input())\r\nnum=list(map(int,input().split()))\r\nfor i in num:\r\n if i+1 in num and i+2 in num:\r\n ans=\"YES\"\r\n break\r\nprint(ans)\r\n", "count = int(input())\ntemp = input().split(\" \")\nsizes = [int(x) for x in temp]\nsizes.sort()\n\ndef check(l):\n if len(l) >= 3:\n if l[2] - l[1] == 1 and l[1] - l[0] == 1:\n return True\n elif l[2] == l[1]:\n return check(l[:1] + l[2:])\n else:\n return check(l[1:])\n return False\n\nif check(sizes):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from sys import stdin, stdout\r\nn=int(input())\r\ni=0\r\nli = [int(x) for x in stdin.readline().split()]\r\nans=[]\r\nfor j,val in enumerate(li):\r\n temp=set()\r\n lower=0\r\n while lower<3:\r\n value=val-lower\r\n if value in li:\r\n temp.add(value)\r\n lower=lower+1\r\n ans.append(temp)\r\nz=True\r\nfor item in range(len(ans)):\r\n if len(ans[item])==3:\r\n z=False\r\n print(\"YES\")\r\n break\r\nif z:\r\n print(\"NO\")\r\n ", "import math, re, sys, string, operator, functools, fractions, collections\nsys.setrecursionlimit(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\npi=math.acos(-1.0)\nMAX=1010\n#################################################\nn=RI()[0]\nt=RI()\ncnt=[0]*MAX\nfor i in t:\n cnt[i]+=1\nf=0\nfor i in range(MAX):\n if cnt[i] and cnt[i+1] and cnt[i+2]:\n f=1\nprint([\"NO\",\"YES\"][f])\n\n\n", "ball_number = int(input())\n\nballs = list(map(int, input().split(\" \")))\n\nballs_set = set(balls)\n\nballs = (list(balls_set))\n\nballs.sort()\n\nfound = False\n\nfor i in range(len(balls) - 2):\n if (balls[i] != balls[i+1] and balls[i+1] != balls[i+2] and balls [i] != balls[i+2]):\n if (balls[i+2] - balls[i] <= 2):\n found = True\n\nif found:\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\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if a[i] + 1 == a[j] and a[j] + 1 == a[k]:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n\r\n", "n = int(input())\r\na=list(map(int,input().split()))\r\nok =0 \r\nfor i in a:\r\n if i+1 in a and i+2 in a:\r\n print(\"YES\")\r\n ok =1 \r\n break\r\nif ok ==0:\r\n print(\"NO\")\r\n", "n = int(input())\r\nt = sorted(set(map(int,input().split(\" \"))))\r\nfor i in range(len(t)-2):\r\n if (t[i] == t[i+1]-1) and (t[i+1] == t[i+2]-1):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n# 18 55 16 17\r\n# 0 1 2 3", "\nInput=lambda:map(int,input().split())\n\ninput()\nBall = list(set(sorted(list(Input()))))\nn = len(Ball)\ni = 0\n\nwhile i < n - 2:\n a,b,c = Ball[i:i+3]\n if c - a <=2 and a!=b!=c:\n print(\"YES\")\n exit()\n i+=1\nprint(\"NO\")\n", "n = int(input())\r\nli = [int(i) for i in input().split()]\r\nli = list(set(li))\r\nli.sort()\r\nflag = False\r\nfor i in range(len(li)-2):\r\n if li[i+2]-li[i] <= 2:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nt2 = list(map(int, input().split()))\r\nt = []\r\nfor item in t2:\r\n\tif item not in t:\r\n\t\tt.append(item)\r\nt.sort()\r\nflag = 0\r\nn = len(t)\r\n# print(t)\r\nfor i in range(n-2):\r\n\tif abs(t[i]-t[i+1])<=2 and abs(t[i+1]-t[i+2])<=2 and abs(t[i]-t[i+2])<=2:\r\n\t\tif t[i]==t[i+1] or t[i+1]==t[i+2] or t[i]==t[i+2]:\r\n\t\t\tpass\r\n\t\telse:\r\n\t\t\tflag = 1\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\n\r\nprint(\"NO\")\t\t\t", "input()\r\nT = sorted(set(map(int, input().split())))\r\n\r\nprint('YES' if any(T[i]+2==T[i+1]+1==T[i+2] for i in range(len(T)-2)) else 'NO')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(n):\r\n\ta=l[i]\r\n\tif (a+1) in l and (a+2) in l:\r\n\t\tprint(\"YES\")\r\n\t\tc=1\r\n\t\tbreak\r\nif c==0:\r\n\tprint(\"NO\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nk = list(set(l))\r\nk.sort()\r\nif len(k) < 3:\r\n\tprint(\"NO\")\r\n\texit()\r\ndef check(a,b):\r\n\tif abs(a-b) <= 2 and a != b:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\nfor i in range(len(k)-2):\r\n\r\n\tif check(k[i],k[i+1]) and check(k[i+1],k[i+2]) and check(k[i],k[i+2]):\r\n\t\tprint(\"YES\")\t\r\n\t\texit()\r\n\r\nprint(\"NO\")", "MAXN=1010\r\n\r\nt=int(input())\r\na=[int(i) for i in input().split()]\r\nc=[0 for i in range(MAXN)]\r\n\r\nfor i in a:\r\n c[i]+=1\r\n\r\nfor i in range(1000):\r\n if c[i] and c[i+1] and c[i+2]:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "# n,l=list(map(int,input().split()))\r\nn,size_ball=int(input()),list(map(int ,input().split()))\r\nsize_ball.sort()\r\nflag=False\r\nfor i in size_ball:\r\n if i-1 in size_ball and i+1 in size_ball:\r\n flag=True\r\nif flag:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "def balls(lst):\r\n for i in range(len(lst)):\r\n for j in range(i + 1, len(lst)):\r\n for k in range(j + 1, len(lst)):\r\n if lst[i] == lst[j] or lst[i] == lst[k] or lst[j] == lst[k]:\r\n continue\r\n if lst[k] - lst[j] <= 2 and lst[k] - lst[i] <= 2 and lst[j] - lst[i] <= 2:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nprint(balls(sorted(a)))\r\n", "a=sorted({*map(int,[*open(0)][1].split())})\r\nprint('NYOE S'[any(x+1==y==z-1 for x,y,z in zip(a,a[1:],a[2:]))::2])\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nb=sorted(set(b))\r\nc=0\r\nans = 'No'\r\nfor i in range(len(b)-2):\r\n if b[i+2]-b[i]<=2:\r\n ans = 'Yes'\r\n break\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nballs = set([int(x) for x in input().split()])\r\n\r\nfor x in balls:\r\n if (x + 1) in balls and (x + 2) in balls:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nc=set(b)\r\nd=[]\r\nyes=0\r\nfor i in c:\r\n d.append(i)\r\ne=sorted(d)\r\nfor j in range(0,len(e)-2):\r\n if e[j+2]-e[j]==2:\r\n yes=yes+1\r\n\r\nif yes>=1:\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", "def find_balls(list_of_sizes):\r\n for size in list_of_sizes:\r\n if (size+1 in list_of_sizes) and (size+2 in list_of_sizes):\r\n print(\"YES\")\r\n return None\r\n print(\"NO\")\r\n \r\n \r\nn = input()\r\nls = input()\r\nls = ls.split(sep=\" \")\r\nls = [int(item) for item in ls]\r\nfind_balls(ls)", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(1000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\nara=inara()\r\n\r\nara.sort()\r\n\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tfor k in range(j+1,n):\r\n\t\t\tif ara[i]<ara[j] and ara[j]<ara[k] and ara[k]<=ara[i]+2:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit(0)\r\n\r\nprint(\"NO\")\r\n", "num = int(input())\r\narr = set(sorted(map(int, input().split())))\r\n\r\nfor n in arr:\r\n if n +1 in arr and n +2 in arr:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "#!/usr/bin/python3\n\n\ndef main():\n\tn = int(input())\n\tt = sorted([int(i) for i in input().split()])\n\n\tl = 0\n\tp = None\n\tfor ti in t:\n\t\tif ti == p: continue\n\n\t\tif p is None or ti == p + 1:\n\t\t\tp = ti\n\t\t\tl += 1\n\t\telse:\n\t\t\tp = ti\n\t\t\tl = 1\n\n\t\tif l == 3:\n\t\t\tprint('YES')\n\t\t\treturn\n\n\tprint('NO')\n\nif __name__ == '__main__':\n\tmain()\n", "n = int(input().strip())\nt = [ int(i) for i in input().strip().split() ]\nt = list(set(t))\nt.sort()\nfound = False\nn = len(t)\nfor i in range(n - 2):\n found = (t[i + 2] - t[i]) < 3\n if found:\n print(\"YES\")\n break\nif not found:\n print(\"NO\")\n\n \t \t \t \t\t \t \t\t\t \t \t\t", " \r\nn = int(input())\r\na = list(map(int, input().split()))\r\nt = set()\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if abs(a[j]-a[i]) <= 2:\r\n t.add(a[i])\r\n t.add(a[j])\r\n\r\nif len(t) >= 3:\r\n value = sorted(list(set(t)))\r\n for i in range(len(value)-2):\r\n if value[i+2] - value[i] <= 2:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "input()\r\nballs = sorted(set(int(ball) for ball in input().split()))\r\nanswer = \"NO\"\r\nballs_number = len(balls)\r\nif balls_number > 2:\r\n for i in range(balls_number - 2):\r\n if balls[i + 1] - balls[i] <= 2 and balls[i + 2] - balls[i + 1] <= 2 and balls[i + 2] - balls[i] <= 2:\r\n answer = \"Yes\"\r\n break\r\nprint(answer)\r\n", "input()\r\ns=set(map(int,input().split()))\r\nprint([\"NO\",\"YES\"][any(i in s and i+1 in s and i+2 in s for i in range(1000))])", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\ndef BubbleSort(n, arr):\r\n for pannum in range(n-1,0,-1):\r\n for i in range(pannum):\r\n if arr[i]>arr[i+1]:\r\n arr[i], arr[i+1] = arr[i+1], arr[i]\r\n\r\ndef delete_duplicates(n, arr):\r\n array = arr.copy()\r\n for i in range(n-1):\r\n el = arr[i]\r\n for j in range(i+1,n):\r\n if el == arr[j]:\r\n array[j] = 0\r\n\r\n sub_array = []\r\n for k in range(n):\r\n if array[k] != 0:\r\n sub_array.append(array[k])\r\n return sub_array\r\n \r\nBubbleSort(n, t)\r\nt = delete_duplicates(n, t)\r\nres = 'No'\r\nif len(t) > 2:\r\n for k in range(len(t)-2):\r\n if t[k+2] - t[k] <= 2 and t[k+2] - t[k] > 0 and t[k+1] != t[k] and t[k+2] != t[k+1]:\r\n res = 'Yes'\r\n break\r\nprint (res)", "#Solution ripped from solved ones\r\nn,s = input(),list(map(int,input().split()))\r\nprint([\"NO\",\"YES\"][any(i in s and i + 1 in s and i + 2 in s for i in s)])", "n=int(input())\r\na=set(list(map(int,input().split())))\r\nb=sorted(list(map(int,a)))\r\nfor i in range(len(b)-2):\r\n if abs(b[i]-b[i+1])<=2 and abs(b[i]-b[i+2])<=2:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\ncek = 1\r\ntemp = -1\r\nfor i in range (n):\r\n\tif(a[i] == temp + 1):\r\n\t\tcek += 1\r\n\t\ttemp = a[i]\r\n\telif(a[i] == temp):\r\n\t\tpass\r\n\telse:\r\n\t\tcek = 1\r\n\t\ttemp = a[i]\r\n\tif(cek >= 3):\r\n\t\tbreak\r\nif (cek>=3):\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "if __name__=='__main__':\r\n n = int(input())\r\n b = sorted(set(map(int,input().split(' '))))\r\n for i in range(len(b)-2):\r\n if len(set(b[i:i+3]))==3:\r\n if b[i+2]-b[i]<=2 and b[i+2]-b[i+1]<=1:\r\n print('YES')\r\n break\r\n else: print('NO')\r\n\r\n\r\n'''\r\n A = input()\r\n stack = [] #Real Stack\r\n Graph = {\r\n ')':'('\r\n }\r\n count = 0\r\n def black(A):\r\n #p for possibility\r\n stak =[]\r\n for e in A:\r\n if e in ['(']:\r\n stak.append(e)\r\n else:\r\n if stak==[] or Graph[e]!=stak[-1]:\r\n p=False\r\n else:\r\n stak.pop(len(stak)-1) #pop last \r\n if len(stak) ==0:\r\n p=True\r\n else:\r\n p=False\r\n if not p: return [0]\r\n else:\r\n #stak is not empty\r\n stak = []\r\n count = []\r\n for e in range(len(A)):\r\n if A[e]=='(' or stak==[]: stak.append(A[e])\r\n else:\r\n if A[e]==')' and Graph[A[e]]==stak[-1]:\r\n while Graph[A[e]]==stak[-1]:\r\n stak.pop(-1)\r\n if e==len(A)-1: break\r\n e+=1\r\n if A[e]=='(' or stak==[]: break\r\n count.append(1)\r\n return count\r\n\r\n rov = []\r\n P = False \r\n for e in A:\r\n if e in ['(']: stack.append(e)\r\n else:\r\n if stack!=[]:\r\n stack.append(e)\r\n if stack.count('(')==stack.count(')'):\r\n x=black(stack)\r\n if x!=[0]: P = True\r\n if x==[1]:\r\n rov.append(1)\r\n else:\r\n rov.append(sum(x[:-1]))\r\n stack=[]\r\n if not P: print(0)\r\n else:\r\n pro =1\r\n for i in rov: pro*=i\r\n print(pro)\r\n \r\n'''\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nfor i in range(len(l)):\r\n for j in range(i,len(l)):\r\n if l[j] - l[i] == 1:\r\n for k in range(j,len(l)):\r\n if l[k] - l[j] == 1:\r\n print(\"YES\")\r\n exit(0) \r\nprint(\"NO\")\r\n\r\n\r\n\r\n", "input()\r\nT = set(map(int, input().split()))\r\n\r\nprint('YES' if any(t-1 in T and t+1 in T for t in T) else 'NO')", "# take input values\nN = int(input())\nT = list(map(int, input().split()))\n\n# remove duplicate house numbers and sort the list\nT = sorted(set(T))\n\n# iterate over the sorted list and check for three consecutive houses\nfor i in range(len(T)-2):\n if T[i+2] - T[i] <= 2:\n print(\"YES\")\n exit()\n\n# if we can't find three consecutive houses, print \"NO\"\nprint(\"NO\")", "n = input()\r\nn = [int(i)for i in input().split()]\r\nn = sorted(set(n))\r\nif len(n) > 2:\r\n for i in range(2, len(n)):\r\n if n[i] - n[i-2] <= 2:\r\n print('YES')\r\n break\r\n if n[i] - n[i-2] >= 3:\r\n print('NO')\r\nelse:\r\n print('NO')", "n = int(input())\r\nstr_list = input().split()\r\nint_list = [0]*n\r\nfor i in range(n):\r\n int_list[i] = int(str_list[i])\r\nrange_size = [0]*1001\r\nfor i in int_list:\r\n range_size[i] += 1\r\nfound = False\r\nfor i in range(1,999):\r\n if range_size[i] > 0 and range_size[i+1] > 0 and range_size[i+2] > 0:\r\n found = True;break\r\nif found:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, t = int(input()), sorted(set(map(int, input().split())))\r\nprint('YES' if any(t[i + 2] - t[i] == 2 for i in range(len(t) - 2)) else 'NO')", "n = int(input())\r\nper = list(map(int, input().split()))\r\nper2 = False\r\nfor i in range(n -2):\r\n if per2:\r\n break\r\n for j in range(i+1 , n-1):\r\n if per2:\r\n break\r\n for t in range(j+1, n):\r\n \r\n if (max(per[t], per[j]) - min(per[t], per[j])) in (1,2) and (max(per[t], per[i]) - min(per[t], per[i])) in (1,2) and (max(per[i] , per[j]) - min(per[i] , per[j])) in (1,2):\r\n print('YES')\r\n per2 = True\r\n break\r\nif not per2:\r\n print('NO')", "n = int(input())\na = sorted(list(set(map(int, input().split()))))\n\nfor i in range(2, len(a)):\n if a[i] - a[i - 2] <= 2:\n print('YES')\n break\nelse:\n print('NO')\n", "n=int(input())\r\nk=input().split()\r\nl1=[]\r\nl2=[]\r\nans='whatever'\r\ncount=0\r\nfor i in range(n):\r\n l1.append(int(k[i]))\r\nfor j in range(len(l1)):\r\n for i in range(len(l1)):\r\n if i!=j and abs(l1[j]-l1[i])==1 :\r\n l2.append(l1[j])\r\n for k in range(len(l1)):\r\n if abs(l1[i]-l1[k])==1 and l2.count(l1[k])==0:\r\n count+=1\r\nif count>0:\r\n ans='YES'\r\nelse:\r\n ans='NO'\r\nprint(ans)", "\r\n\r\n#start the code from here\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nif len(s)<3:\r\n\tprint(\"NO\")\r\n\texit()\r\nelse:\r\n\tl=list(s)\r\n\tl.sort()\r\n\th=0\r\n\tfor i in range(1,len(l)):\r\n\t\tif l[i]-l[i-1]<=1:\r\n\t\t\th+=1\r\n\t\telse:\r\n\t\t\th=0\r\n\t\tif h==2:\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit()\r\n\tprint(\"NO\")", "input()\r\na = list(set(map(int,input().split())))\r\na.sort()\r\nfor i in range(len(a) - 2):\r\n if a[i] == a[i + 1] - 1 and a[i] == a[i+2] - 2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "n = int(input())\r\narray = set(list(map(int, input().split())))\r\nflag = False\r\nfor x in array:\r\n if (x + 1) in array and (x + 2) in array:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\na = list(sorted(set(map(int, input().split()))))\r\nn = len(a)\r\nret = False\r\nfor i in range(2, n):\r\n if a[i-2] + 1 == a[i-1] and a[i-1] + 1 == a[i]:\r\n ret = True\r\nif ret:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def read():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef main():\r\n n, = read()\r\n t = sorted(set(read()))\r\n\r\n res = False\r\n for i in range(0, len(t) - 2):\r\n if t[i + 2] - t[i] <= 2:\r\n res = True\r\n break\r\n\r\n print(res and \"YES\" or \"NO\")\r\n\r\nmain()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(list(set(a)))\r\nc=0\r\nfor i in range(len(a)-2):\r\n if(a[i]+1==a[i+1])and(a[i+1]+1==a[i+2]):\r\n c=1\r\nif(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nt = sorted(map(int, input().split()))\r\nN = 1010\r\nc = [0] * N\r\nfor i in t:\r\n c[i] += 1\r\nfor i in range(N - 5):\r\n if c[i] > 0 and c[i + 1] > 0 and c[i + 2] > 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n \r\n", "from itertools import combinations\r\n\r\ndef can_commit_crime(N, houses):\r\n for house_triplet in combinations(houses, 3):\r\n if abs(house_triplet[2] - house_triplet[0]) <= 2 and abs(house_triplet[1] - house_triplet[0]) <= 2 and abs(house_triplet[2] - house_triplet[1]) <= 2 and len(set(house_triplet)) == 3:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nN = int(input())\r\nhouses = list(map(int, input().split()))\r\nprint(can_commit_crime(N, houses))\r\n", "n = int(input())\nballs = list(map(int,input().split()))\nballs.sort()\n\ndef answer(balls):\n a = 0\n b = 1\n while b < len(balls) - 1:\n while balls[b] == balls[a] and b < len(balls)-2:\n b += 1\n if balls[b] == balls[a] + 1:\n c = b + 1\n while balls[c] == balls[b] and c < len(balls)-1:\n c += 1\n if balls[c] == balls[b] + 1:\n return \"YES\"\n else:\n a = c\n b = a + 1\n else:\n a = b\n b = a + 1\n return \"NO\"\nprint(answer(balls))\n", "def main():\n input()\n a = list(map(int,input().split()))\n a = list(set(a))\n a.sort()\n flag = False\n n = len(a)\n for i in range(n-2):\n if (a[i]+1 == a[i+1] and a[i+1]+1==a[i+2]):\n print(\"YES\")\n flag = True\n break\n if not flag:\n print(\"NO\")\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ni=0\r\na=sorted(a)\r\nb=set(a)\r\na=list(b)\r\nfor i in range(len(b)-3+1):\r\n if a[i+2]-2<=a[i]:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n" ]

[ "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn, k, x = map(int, input().split())\r\nrangers = list(map(int, input().split()))\r\nfor i in range(min(k, 8 + (k & 3))):\r\n\trangers.sort()\r\n\trangers = [rangers[i] if (i & 1) else rangers[i] ^ x for i in range(n)]\r\nrangers.sort()\r\nprint(rangers[-1], rangers[0])\t \t\t\t\t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = pow(2, 10)\r\ncnt = [0] * l\r\nfor i in a:\r\n cnt[i] += 1\r\nfor _ in range(k):\r\n c = 0\r\n cnt0 = [0] * l\r\n for i in range(l):\r\n if not cnt[i]:\r\n continue\r\n u, v = cnt[i] // 2, cnt[i] // 2\r\n if not c % 2:\r\n u += cnt[i] % 2\r\n else:\r\n v += cnt[i] % 2\r\n cnt0[i ^ x] += u\r\n cnt0[i] += v\r\n c += cnt[i]\r\n cnt = cnt0\r\nfor i in range(l - 1, -1, -1):\r\n if cnt[i]:\r\n ma = i\r\n break\r\nfor i in range(l):\r\n if cnt[i]:\r\n mi = i\r\n break\r\nprint(ma, mi)", "def solve(b,a,v):\r\n fq=[0]*1200\r\n arr=[0]*1025\r\n for i in v:\r\n fq[i]+=1\r\n for i in range(b):\r\n for j in range(1024):\r\n arr[j]=fq[j]\r\n tmp=0\r\n for j in range(1024):\r\n if fq[j]>0:\r\n c=(j^a)\r\n ch=fq[j]//2\r\n if tmp==0:\r\n ch+=(fq[j]&1)\r\n arr[j]-=ch\r\n arr[c]+=ch\r\n tmp^=(fq[j]&1)\r\n for j in range(1024):\r\n fq[j]=arr[j]\r\n mx,mn=0,10000000000\r\n for i in range(1024):\r\n if fq[i]>0:\r\n mn=min(i,mn)\r\n mx=max(i,mx)\r\n return str(mx) + \" \" + str(mn)\r\n\r\nn,b,a=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nprint(solve(b,a,v))\r\n", "n,k,x=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nk%=64\r\nwhile k:\r\n k-=1\r\n r.sort()\r\n for i in range(0,n,2):#alternate\r\n r[i]^=x\r\nprint(max(r),min(r))" ]

[ "def rp():\n cs = list(map(int, input().split(' ')))\n cs = list(zip(cs[0::2], cs[1::2]))\n return cs\n\ndef dist(p1, p2):\n return len(set(p1).union(set(p2))) - 2\n\ninput()\n\nps = [rp(), rp()]\n\ntheyCan = True\nmyPos = set()\n\nfor ps1, ps2 in [ps, ps[::-1]]:\n for p1 in ps1:\n pos = set()\n\n for p2 in ps2:\n if dist(p1, p2) == 1:\n pos = pos.union( set(p1).intersection(set(p2)) )\n \n if len(pos) >= 2:\n theyCan = False\n myPos = myPos.union(pos)\n\nprint(next(iter(myPos)) if len(myPos)==1 else 0 if theyCan else -1)\n", "def read():\n tmp = [int(v) for v in input().split()]\n return [sorted((tmp[2*i], tmp[2*i+1])) for i in range(len(tmp) // 2)]\n\n\ndef check(p, m):\n pf, ps = [], []\n f, s = p\n for pp in m:\n if p != pp:\n if f in pp:\n pf.append(pp)\n if s in pp:\n ps.append(pp)\n return len(pf) > 0 and len(ps) > 0\n\n\ndef main():\n _, a, b = input(), read(), read()\n possible = set()\n for i in range(10):\n for p1 in a:\n for p2 in b:\n if i in p1 and i in p2 and p1 != p2:\n possible.add(i)\n if len(possible) == 1:\n print(next(iter(possible)))\n return\n\n for i in possible:\n arr = [(a, b), (b, a)]\n for first, second in arr:\n for p1 in first:\n if i in p1:\n if check(p1, second):\n print(-1)\n return\n\n print(0)\n\n\nif __name__ == '__main__':\n main()", "import sys\r\n\r\nn,m=map(int,input().split())\r\n\r\na=list(map(int,input().split()))\r\n\r\nb=list(map(int,input().split()))\r\n\r\npos2=[]\r\nfor i in range(m):\r\n pos=set()\r\n x=[b[2*i],b[2*i+1]]\r\n for j in range(n):\r\n y=[a[2*j],a[2*j+1]]\r\n if(x[0] in y):\r\n if(x[1] in y):\r\n continue\r\n pos.add(x[0])\r\n if(x[1] in y):\r\n pos.add(x[1])\r\n #print(x,pos)\r\n if(len(pos)==1):\r\n pos2.append(x)\r\n if(len(pos)==2):\r\n print(-1)\r\n sys.exit()\r\npos1=[]\r\nfor i in range(n):\r\n pos=set()\r\n x=[a[2*i],a[2*i+1]]\r\n for j in range(m):\r\n y=[b[2*j],b[2*j+1]]\r\n if(x[0] in y):\r\n if(x[1] in y):\r\n continue\r\n pos.add(x[0])\r\n if(x[1] in y):\r\n pos.add(x[1])\r\n #print(x,pos)\r\n if(len(pos)==1):\r\n pos1.append(x)\r\n if(len(pos)==2):\r\n print(-1)\r\n sys.exit()\r\n#print(pos1,pos2)\r\nif(pos1[0][0] in pos2[0]):\r\n ini=pos1[0][0]\r\nelse:\r\n ini=pos1[0][1]\r\n\r\nfor i in pos1:\r\n for j in pos2:\r\n if(ini not in i or ini not in j):\r\n print(0)\r\n sys.exit()\r\nprint(ini)\r\n\r\n \r\n", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn,m=map(int,input().split())\r\n\r\npossible1=[set() for _ in range(200)]\r\npossible2=[set() for _ in range(200)]\r\nweird=[0]*15\r\n\r\np1=list(map(int,input().split()))\r\np2=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n a=sorted(p1[i*2:i*2+2])\r\n b=sorted(p2[j*2:j*2+2])\r\n if a==b: continue\r\n got=-1\r\n if a[0] in b: got=a[0]\r\n if a[1] in b: got=a[1]\r\n if got==-1: continue\r\n weird[got]=1\r\n possible1[a[0]*11+a[1]].add(got)\r\n possible2[b[0]*11+b[1]].add(got)\r\n\r\nif sum(weird)==1:\r\n print(weird.index(1))\r\nelif max(len(i) for i in possible1)==1 and max(len(i) for i in possible2)==1:\r\n print(0)\r\nelse:\r\n print(-1)\r\n", "n,m = map(int, input().split())\nfirst = list(map(int, input().split()))\nsecond = list(map(int, input().split()))\n\n\ndef esht(x, y):\n\tif not (any(q in y[0] for q in x[0]) and not all(q in y[0] for q in x[0])):\n\t\treturn None\n\tfor q in x[0]:\n\t\tif q in y[0]:\n\t\t\treturn q\n\na = []\nfor i in range(len(first)):\n\tif i % 2 == 1:\n\t\tcontinue\n\ta.append(([first[i], first[i+1]], []))\n\nb = []\nfor i in range(len(second)):\n\tif i % 2 == 1:\n\t\tcontinue\n\tb.append(([second[i], second[i+1]], []))\n\nsome = -1\nfor aa in a:\n\tfor bb in b:\n\t\tq = esht(aa, bb)\n\t\tif q is not None:\n\t\t\taa[1].append(q)\n\t\t\tbb[1].append(q)\n\t\t\tsome = q\n\ndef eq(lst):\n\treturn lst[1:] == lst[:-1]\n\nok = True\nfor aa in a:\n\tfor q in aa[1]:\n\t\tif q != some:\n\t\t\tok = False\nif ok:\n\tprint(some)\nelse:\n\tok2 = True\n\tfor aa in a:\n\t\tif not eq(aa[1]):\n\t\t\tok2 = False\n\tfor bb in b:\n\t\tif not eq(bb[1]):\n\t\t\tok2 = False\n\tif ok2:\n\t\tprint(0)\n\telse:\n\t\tprint(-1)\n\t\t\t\n\t\t\t\n", "\r\nfrom collections import defaultdict\r\ndef main():\r\n\tn, m = map(int, input().split())\r\n\tns0 = tuple(map(int, input().split()))\r\n\tns1 = tuple(map(int, input().split()))\r\n\tpairs0 = zip(ns0[::2], ns0[1::2])\r\n\tpairs1 = zip(ns1[::2], ns1[1::2])\r\n\tdic = defaultdict(set)\r\n\tdic1 = defaultdict(set)\r\n\tcandidates = set()\r\n\tfor x, y in pairs0:\r\n\t\tdic[x].add(y)\r\n\t\tdic[y].add(x)\r\n\tfor x, y in pairs1:\r\n\t\tdic1[x].add(y)\r\n\t\tdic1[y].add(x)\r\n\t\tif x in dic:\r\n\t\t\tvals = dic[x]\r\n\t\t\tfor val in vals:\r\n\t\t\t\tbreak\r\n\t\t\tif len(vals) > 1 or val != y:\r\n\t\t\t\tcandidates.add(x)\r\n\t\tif y in dic:\r\n\t\t\tvals = dic[y]\r\n\t\t\tfor val in vals:\r\n\t\t\t\tbreak\r\n\t\t\tif len(vals) > 1 or val != x:\r\n\t\t\t\tcandidates.add(y)\r\n\r\n\tif len(candidates) == 1:\r\n\t\tprint(candidates.pop())\r\n\t\treturn\r\n\telse:\r\n\t\tfor d0, d1 in ((dic, dic1), (dic1, dic)):\r\n\t\t\tfor a0 in candidates:\r\n\t\t\t\tfor a1 in d0[a0]:\r\n\t\t\t\t\tfor b1 in d1[a0]:\r\n\t\t\t\t\t\tif b1 != a1:\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tcontinue\r\n\t\t\t\t\tfor b0 in d1[a1]:\r\n\t\t\t\t\t\tif b0 != a0:\r\n\t\t\t\t\t\t\tprint('-1')\r\n\t\t\t\t\t\t\treturn\r\n\tprint('0')\r\nmain()", "import math;\r\n#import random;\r\n#import time;\r\nimport heapq;\r\ndef getIntList():\r\n return list(map(int, input().split()));\r\ndef getTransIntList(n):\r\n first=getIntList();\r\n m=len(first);\r\n result=[[0]*n for _ in range(m)];\r\n for i in range(m):\r\n result[i][0]=first[i];\r\n for j in range(1, n):\r\n curr=getIntList();\r\n for i in range(m):\r\n result[i][j]=curr[i];\r\n return result;\r\ndef intersectLine(A, B, C, D):\r\n #A[i]+t(B[i]-A[i])=C[i]+s(D[i]-C[i])\r\n for i in range(2):\r\n if B[i]==A[i]:\r\n s=(A[i]-C[i])/(D[i]-C[i]);\r\n if s<0 or s>1:\r\n return False;\r\n j=1-i;\r\n t=(C[j]-A[j]+s*(D[j]-C[j]))/(B[j]-A[j]);\r\n if t<0 or t>1:\r\n return False;\r\n return True;\r\n \r\nn, m =getIntList();\r\nx=getIntList();\r\np1=[(x[2*i], x[2*i+1]) for i in range(n)];\r\nx=getIntList();\r\np2=[(x[2*i], x[2*i+1]) for i in range(m)];\r\npossibles=set();\r\ndef check(pair1, pair2):\r\n for i in range(2):\r\n for j in range(2):\r\n if pair1[i]==pair2[j]:\r\n if pair1[1-i]==pair2[1-j]:\r\n return 0;\r\n #Проверяем возможность ошибки\r\n for currPair2 in p2:\r\n for k in range(2):\r\n if currPair2[k]==pair1[1-i] and currPair2[1-k]!=pair1[i]:\r\n return -1;\r\n for currPair1 in p1:\r\n for k in range(2):\r\n if currPair1[k]==pair2[1-j] and currPair1[1-k]!=pair2[j]:\r\n return -1;\r\n return pair1[i];\r\n return 0;\r\ndef solve():\r\n for pair1 in p1:\r\n for pair2 in p2:\r\n #Проверяем, смогут ли игроки угадать число\r\n #Если они загадали пары pair1 и pair2\r\n #Если смогут - возвращаем число\r\n #Если нет - -1\r\n #Если пара некорректна - 0\r\n check1=check(pair1, pair2);\r\n #print(pair1, pair2, check1);\r\n if check1==-1:\r\n return -1;\r\n if check1>0:\r\n possibles.add(check1);\r\n if len(possibles)>1:\r\n return 0;\r\n for p in possibles:\r\n return p;\r\nprint(solve());", "n, m = map(int, input().split())\r\nAB = list(map(int, input().split()))\r\nab = []\r\nfor i in range(n): \r\n ab.append(set((AB[2 * i], AB[2 * i + 1])))\r\nAC = list(map(int, input().split()))\r\nac = []\r\ncould_overlap = []\r\noverlap_numbers = set()\r\nfor i in range(m): \r\n ac.append(set((AC[2 * i], AC[2 * i + 1])))\r\nfor i in range(n):\r\n for j in range(m):\r\n if (len(ab[i] & ac[j]) == 1):\r\n could_overlap.append((ab[i], ac[j]))\r\n num, = ab[i] & ac[j]\r\n overlap_numbers.add(num)\r\nif len(could_overlap) == 1 or len(overlap_numbers) == 1:\r\n print(*(could_overlap[0][0] & could_overlap[0][1]))\r\nelse:\r\n ok = True\r\n for i in range(len(could_overlap)):\r\n for j in range(i, len(could_overlap)):\r\n if could_overlap[i][0] == could_overlap[j][0]:\r\n if could_overlap[i][0] & could_overlap[i][1] != could_overlap[j][0] & could_overlap[j][1]:\r\n ok = False\r\n if could_overlap[i][1] == could_overlap[j][1]:\r\n if could_overlap[i][0] & could_overlap[i][1] != could_overlap[j][0] & could_overlap[j][1]:\r\n ok = False\r\n if ok:\r\n print(0)\r\n else:\r\n print(-1)", "n, m = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\nb = list(map(int, input().strip().split()))\r\n\r\na = [sorted([a[i], a[i+1]]) for i in range(0, 2*n, 2)]\r\nb = [sorted([b[i], b[i+1]]) for i in range(0, 2*m, 2)]\r\n# print(a)\r\n# print(b)\r\nused_i = set()\r\nused_j = set()\r\nres = list()\r\nfor x in range(1, 10):\r\n new_i = set()\r\n new_j = set()\r\n for i in range(n):\r\n if a[i][0] == x or a[i][1] == x:\r\n for j in range(m):\r\n if (b[j][0] == x or b[j][1] == x) and (a[i] != b[j]):\r\n if i in used_i or j in used_j: \r\n print('-1')\r\n exit(0) \r\n new_i.add(i)\r\n new_j.add(j)\r\n if len(new_i) > 0 or len(new_j) > 0:\r\n res.append(x)\r\n used_i.update(new_i)\r\n used_j.update(new_j)\r\n# print(res)\r\nif len(res) == 1:\r\n print(res[0])\r\nelse:\r\n print('0')", "# your code goes here\r\n\r\nn, m = map(int, input().split())\r\n\r\ndef split2(iterable):\r\n\targs = [iter(iterable)] * 2\r\n\treturn zip(*args)\r\n\r\na = list(split2(map(int, input().split())))\r\nb = list(split2(map(int, input().split())))\r\n\r\ncan = set()\r\n\r\nfor x in a:\r\n\tfor y in b:\r\n\t\tintersections = set(x) & set(y)\r\n\t\tif len(intersections) in [0, 2]:\r\n\t\t\tcontinue\r\n\t\tcan.update(intersections)\r\n\r\nif len(can) == 1:\r\n\tprint(next(iter(can)))\r\n\texit()\r\n\r\nfail = 0\r\n\r\nfor x in a:\r\n\tst = set()\r\n\tfor y in b:\r\n\t\tintersections = set(x) & set(y)\r\n\t\tif len(intersections) in [0, 2]:\r\n\t\t\tcontinue\r\n\t\tst.update(intersections)\r\n\tfail |= len(st) > 1\r\n\r\nfor x in b:\r\n\tst = set()\r\n\tfor y in a:\r\n\t\tintersections = set(x) & set(y)\r\n\t\tif len(intersections) in [0, 2]:\r\n\t\t\tcontinue\r\n\t\tst.update(intersections)\r\n\tfail |= len(st) > 1\r\n\r\nprint(-1 if fail else 0)", "def readpts():\n\tip = list(map(int, input().split()))\n\treturn [(min(ip[i], ip[i+1]), max(ip[i], ip[i+1])) for i in range(0,len(ip),2)]\n\nN, M = map(int, input().split())\npts1 = readpts()\npts2 = readpts()\n#print(pts1)\n#print(pts2)\n\ndef psb(a, b):\n\tif a == b: return False\n\treturn any(i in b for i in a)\n\ndef sb(a, b):\n\tfor i in a:\n\t\tif i in b:\n\t\t\treturn i\n\treturn -1 # should not happen\n\ndef ipsv(pts1, pts2):\n\tans = False\n\tfor p1 in pts1:\n\t\tgsb = set()\n\t\tfor p2 in pts2:\n\t\t\tif psb(p1, p2):\n\t\t\t\tgsb.add(sb(p1, p2))\n\t\tif len(gsb) > 1: return False\n\t\tif len(gsb) == 1: ans = True\n\treturn ans\n\ndef sv():\n\tgsb = set()\n\tfor p1 in pts1:\n\t\tfor p2 in pts2:\n\t\t\tif psb(p1, p2):\n\t\t\t\tgsb.add(sb(p1, p2))\n\tif len(gsb) == 0: return -1\n\tif len(gsb) == 1: return list(gsb)[0]\n\tif ipsv(pts1, pts2) and ipsv(pts2, pts1): return 0\n\treturn -1\n\nprint(sv())\n", "n, m = map(int, input().split())\np1 = list(map(int, input().split()))\np2 = list(map(int, input().split()))\ncand = set()\ncc = [set() for i in range(n)]\ndd = [set() for i in range(m)]\nfor i in range(n):\n for j in range(m):\n a, b = p1[2 * i], p1[2 * i + 1]\n c, d = p2[2 * j], p2[2 * j + 1]\n if a not in (c, d) and b not in (c, d):\n continue\n if a in (c, d) and b in (c, d):\n continue\n if a in (c, d):\n kandidat = a\n else:\n kandidat = b\n cand.add(kandidat)\n cc[i].add(kandidat)\n dd[j].add(kandidat)\nif len(cand) == 1:\n print(cand.pop())\nelif max(len(cc[i]) for i in range(n)) <= 1 and\\\n max(len(dd[i]) for i in range(m)) <= 1:\n print(0)\nelse:\n print(-1)\n", "import sys\r\nfrom array import array\r\nfrom collections import deque\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().rstrip()\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nceil_ = lambda a, b: (a + b - 1) // b\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\nget_bit = lambda x, i: (x >> i) & 1\r\nMint, Mlong, out = 2 ** 31 - 1, 2 ** 62 - 1, []\r\n\r\n\r\ndef valid(paira, pairb):\r\n for pa in paira:\r\n vis = set()\r\n for pb in pairb:\r\n if pa == pb: continue\r\n if pa[0] in pb: vis.add(pa[0])\r\n if pa[1] in pb: vis.add(pa[1])\r\n\r\n if len(vis) == 2: return 0\r\n return 1\r\n\r\n\r\ndef solve():\r\n common = set()\r\n for pa in paira:\r\n for pb in pairb:\r\n if pa == pb: continue\r\n if pa[0] in pb: common.add(pa[0])\r\n if pa[1] in pb: common.add(pa[1])\r\n\r\n return 0 if len(common) > 1 else common.pop()\r\n\r\n\r\nfor _ in range(1):\r\n n, m = inp(int)\r\n a, b = inp(int), inp(int)\r\n paira = [sorted(a[i:i + 2]) for i in range(0, n * 2, 2)]\r\n pairb = [sorted(b[i:i + 2]) for i in range(0, m * 2, 2)]\r\n\r\n if not valid(paira, pairb) or not valid(pairb, paira):\r\n out.append(-1)\r\n else:\r\n out.append(solve())\r\n\r\nprint('\\n'.join(map(str, out)))\r\n", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncan0 = set()\ncan1 = [set() for i in range(n)]\ncan2 = [set() for i in range(m)]\n\nfor i in range(n):\n for j in range(m):\n x1 = a[i * 2]\n x2 = a[i * 2 + 1]\n y1 = b[j * 2]\n y2 = b[j * 2 + 1]\n if x1 > x2: x1, x2 = x2, x1\n if y1 > y2: y1, y2 = y2, y1\n if x1 == y1 and x2 == y2: continue\n if x1 == y1:\n can1[i].add(y1)\n can2[j].add(y1)\n can0.add(y1)\n if x2 == y1:\n can1[i].add(y1)\n can2[j].add(y1)\n can0.add(y1)\n if x1 == y2:\n can1[i].add(y2)\n can2[j].add(y2)\n can0.add(y2)\n if x2 == y2:\n can1[i].add(y2)\n can2[j].add(y2)\n can0.add(y2)\nif len(can0) == 1:\n print(min(can0))\nelse:\n ok = True\n for i in can1:\n if len(i) > 1:\n ok = False\n for i in can2:\n if len(i) > 1:\n ok = False\n if ok: print(0)\n else: print(-1)\n", "#!/usr/bin/env python3\n\n[n, m] = map(int, input().strip().split())\nais = list(map(int, input().strip().split()))\nbis = list(map(int, input().strip().split()))\n\nais = [set(ais[2*i: 2*i + 2]) for i in range(n)]\nbis = [set(bis[2*i: 2*i + 2]) for i in range(m)]\n\ndef check(pair, pairs):\n\tres = []\n\tfor p in pairs:\n\t\ts = pair & p\n\t\tif len(s) == 1:\n\t\t\tres.append(s.pop())\n\tres = list(set(res))\n\tif len(res) == 1:\n\t\treturn res[0]\n\telif len(res) > 1:\n\t\treturn -1\n\telse:\n\t\treturn 0\n\n\nva = [check(a, bis) for a in ais]\nvb = [check(b, ais) for b in bis]\n\nvap = [v for v in va if v > 0]\nvbp = [v for v in vb if v > 0]\n\nvap = set(vap)\nvbp = set(vbp)\n\nvabp = vap & vbp\n\nif -1 in va or -1 in vb:\n\tprint (-1)\nelif len(vabp) > 1:\n\tprint (0)\nelse:\n\tprint (vabp.pop())\n\n\n\n\n# Made By Mostafa_Khaled", "q=input()\r\nq1=input().split()\r\nq2=input().split()\r\nparr1=[]\r\nfor i in range(0,len(q1),2):\r\n pair=(q1[i],q1[i+1])\r\n parr1.append(pair)\r\nparr2=[]\r\nfor i in range(0,len(q2),2):\r\n pair=(q2[i],q2[i+1])\r\n parr2.append(pair)\r\nmatches1={}\r\nmatches2={}\r\nfor i in parr1:\r\n for j in parr2:\r\n if (i[0]==j[0] and i[1]==j[1]) or (i[0]==j[1] and i[1]==j[0]):\r\n continue\r\n elif i[0]==j[0] or i[0]==j[1]:\r\n if matches1.get(i)==None or matches1.get(i)==i[0]:\r\n matches1[i]=i[0]\r\n else:\r\n print('-1')\r\n quit()\r\n if matches2.get(j)==None or matches2.get(j)==i[0]:\r\n matches2[j]=i[0]\r\n else:\r\n print('-1')\r\n quit()\r\n elif i[1]==j[1] or i[1]==j[0]:\r\n if matches1.get(i)==None or matches1.get(i)==i[1]:\r\n matches1[i]=i[1]\r\n else:\r\n print('-1')\r\n quit()\r\n if matches2.get(j)==None or matches2.get(j)==i[1]:\r\n matches2[j]=i[1]\r\n else:\r\n print('-1')\r\n quit()\r\n else:\r\n pass\r\nmatches=list(matches1.values())\r\nfor i in range(0,len(matches)):\r\n if matches[i]==matches[i-1]:\r\n pass\r\n else:\r\n print('0')\r\n quit()\r\nprint(matches[0])", "from itertools import product, combinations\n\n\ndef main():\n n, m = map(int, input().split())\n aa = list(map(int, input().split()))\n bb = list(map(int, input().split()))\n a2 = [set(aa[i:i + 2]) for i in range(0, n * 2, 2)]\n b2 = [set(bb[i:i + 2]) for i in range(0, m * 2, 2)]\n seeds, l = set(aa) & set(bb), []\n for s in seeds:\n canda = {d for a in a2 for d in a if s in a and d != s}\n candb = {d for b in b2 for d in b if s in b and d != s}\n for a, b in product(canda, candb):\n if a != b:\n l.append((s, a, b))\n print(l[0][0] if len(set(t[0] for t in l)) == 1 else\n -any(a[:2] == b[-2::-1] or a[::2] == b[-1::-2]\n for a, b in combinations(l, 2)))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\nna, nb = map(int, sys.stdin.readline().split())\n\nal, bl = list(map(int, sys.stdin.readline().split())), list(map(int, sys.stdin.readline().split()))\n\na = [set((al[2*i], al[2*i+1])) for i in range(na)]\nb = [set((bl[2*i], bl[2*i+1])) for i in range(nb)]\n\naposs, bposs = set(), set()\npossible_shared = set()\ni_know_a_knows, i_know_b_knows = True, True\n\nfor ahas in a:\n bposshere = set()\n for bp in b:\n if len(ahas & bp) == 1:\n bposshere |= ahas & bp\n possible_shared |= bposshere\n\n if len(bposshere) == 2:\n i_know_a_knows = False\n\nfor bhas in b:\n aposshere = set()\n for ap in a:\n if len(bhas & ap) == 1:\n aposshere |= bhas & ap\n possible_shared |= aposshere\n\n if len(aposshere) == 2:\n i_know_b_knows = False\n\n\nif len(possible_shared) == 1:\n print(list(possible_shared)[0])\nelif i_know_a_knows and i_know_b_knows:\n print(0)\nelse:\n print(-1)\n", "def check(pair, pairlist):\r\n possible = set()\r\n for otherpair in pairlist:\r\n if len(pair.intersection(otherpair)) == 1:\r\n possible.update(pair.intersection(otherpair))\r\n return possible\r\n\r\nn ,m = list(map(int , input().split()))\r\nfirst = []\r\nss = list(map(int , input().split()))\r\nfor i in range(n):\r\n first.append(set(ss[2*i:2*i +2]))\r\n\r\nsecond = []\r\nss = list(map(int , input().split()))\r\nfor i in range(m):\r\n second.append(set(ss[2*i:2*i +2]))\r\n\r\nfirst_knows = [check(i, second) for i in first]\r\nsecond_knows = [check(i, first) for i in second]\r\nif (max(len(g) for g in first_knows) >1) or (max(len(g) for g in second_knows) >1):\r\n print(-1)\r\n exit()\r\n\r\npossible_first = set()\r\nfor g in first_knows:\r\n possible_first.update(g)\r\n\r\npossible_second = set()\r\nfor g in second_knows:\r\n possible_second.update(g)\r\n\r\nres =possible_first.intersection(possible_second)\r\n\r\nif len(res) >1:\r\n print(0)\r\n exit()\r\n\r\nelse:\r\n print(list(res)[0])" ]

[ "#from heapq import heappop,heappush,heapify #heappop(hq), heapify(list)\r\n#from collections import deque as dq #deque e.g. myqueue=dq(list)\r\n#append/appendleft/appendright/pop/popleft\r\n#from bisect import bisect as bis #a=[1,3,4,6,7,8] #bis(a,5)-->3\r\n#import bisect #bisect.bisect_left(a,4)-->2 #bisect.bisect(a,4)-->3\r\n#import statistics as stat # stat.median(a), mode, mean\r\n#from itertools import permutations(p,r)#combinations(p,r)\r\n#combinations(p,r) gives r-length tuples #combinations_with_replacement\r\n#every element can be repeated\r\n \r\nimport sys, threading\r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\n \r\n \r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n \r\n \r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\nsi= lambda:str(input())\r\nii = lambda: int(input())\r\nmii = lambda: map(int, input().split())\r\nlmii = lambda: list(map(int, input().split()))\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\n\r\ndef factorial(n):\r\n if n==1:\r\n return 1\r\n else:\r\n return n*factorial(n-1)\r\n \r\ndef solve():\r\n s1=si()\r\n s2=si()\r\n q=0\r\n final_pos=0\r\n till_now =0\r\n for i in range(len(s1)):\r\n if s1[i]==\"+\":\r\n final_pos+=1\r\n else:\r\n final_pos-=1\r\n for i in range(len(s2)):\r\n if s2[i]==\"+\":\r\n till_now+=1\r\n elif s2[i]==\"-\":\r\n till_now-=1\r\n elif s2[i]==\"?\":\r\n q+=1\r\n\r\n t=abs(final_pos-till_now)\r\n\r\n if t>q or (q-t)%2:\r\n print(0.000000000000)\r\n else:\r\n numerator = math.comb(q,t+((q-t)//2))\r\n denominator = pow(2,q)\r\n\r\n ans = (numerator*1.0)/denominator\r\n print(\"{:.11f}\".format(ans))\r\n\r\n\r\ndef main():\r\n t = 1\r\n if path.exists(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\"):\r\n sys.stdin = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\", 'r')\r\n sys.stdout = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/output.txt\", 'w')\r\n start_time = time.time()\r\n print(\"--- %s seconds ---\" % (time.time() - start_time))\r\n \r\n \r\n sys.setrecursionlimit(10**5)\r\n \r\n \r\n solve()\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n \r\n \r\n\r\n", "import itertools\n\ndef find_prob(done, sent):\n interrogatins = 0\n done_points = 0\n sent_points = 0\n \n for i in range(len(sent)):\n if(done[i] == \"+\"):\n done_points += 1\n else:\n done_points -= 1\n \n if(sent[i] == \"+\"):\n sent_points += 1\n elif(sent[i] == \"-\"):\n sent_points -= 1\n elif(sent[i] == \"?\"):\n interrogatins += 1\n \n possible_chars = ['+', '-']\n combinations = itertools.product(possible_chars, repeat=interrogatins)\n l = [''.join(comb) for comb in combinations]\n if(len(l) == 0): return 1\n good_ans = 0\n for i in range(len(l)):\n points = 0\n for j in range(len(l[i])):\n if(l[i][j] == \"+\"):\n points += 1\n else:\n points -= 1\n if points + sent_points == done_points:\n good_ans += 1\n \n return (good_ans / (2**interrogatins))\n \ndone = input()\nsent = input()\nprint(find_prob(done, sent))\n\n\t\t\t\t \t \t \t\t\t\t\t \t\t\t \t \t\t \t\t\t \t", "def go(i, pos):\r\n cnt = 0\r\n if i == len(t):\r\n return int(pos == endpos)\r\n\r\n if t[i] == '+':\r\n cnt += go(i + 1, pos + 1)\r\n elif t[i] == '-':\r\n cnt += go(i + 1, pos - 1)\r\n else:\r\n cnt += go(i + 1, pos + 1)\r\n cnt += go(i + 1, pos - 1)\r\n return cnt\r\n\r\ns = input()\r\nt = input()\r\nendpos = 0\r\nfor i in range(len(s)):\r\n endpos += 1 if s[i] == '+' else -1\r\n\r\nn = 0\r\nfor i in range(len(t)):\r\n if t[i] == '?':\r\n n += 1\r\n\r\nresult = go(0, 0) / (2 ** n)\r\nprint(f\"{result:.9f}\")\r\n", "def fac(cnt,n):\n ans = 1\n for i in range(1,n+1):\n ans *= (cnt-i+1)\n ans /= i*1\n return ans\ns1 = str(input())\ns2 = str(input())\npos1 = 0\npos2 = 0\nneg1 = 0\nneg2 = 0\ni =0\ncnt = 0\nwhile i<len(s1):\n if s1[i] == '+':\n pos1 += 1\n if s2[i] == '-':\n neg2 += 1\n elif s2[i] == '+':\n pos2 += 1\n else:\n cnt += 1\n i += 1\n else:\n neg1 += 1\n if s2[i] == '-':\n neg2 += 1\n elif s2[i] == '+':\n pos2 += 1\n else:\n cnt += 1\n i += 1\nif pos2>pos1 or neg2>neg1:\n print(0)\nelif (pos1 == pos2) and (neg1 == neg2):\n print(1)\nelse:\n pos1 -=pos2\n neg1 -=neg2\n ans = 1\n ans *= fac(cnt,pos1)\n ans = ans/(2**cnt)\n print('{0:.12f}'.format(ans))\n \t\t \t\t\t \t\t \t\t\t \t", "\r\n\r\nans=[]\r\n\r\ns=input()\r\n\r\nk=0\r\n\r\nfor x in s:\r\n if x=='+':k+=1\r\n else:k-=1\r\n\r\nt=input()\r\n\r\n\r\ndef A(ind,st):\r\n \r\n if ind==len(s):\r\n an=0\r\n for x in st:\r\n if x=='+':\r\n an+=1\r\n else:\r\n an-=1\r\n ans.append(an)\r\n \r\n return \r\n \r\n if t[ind]==\"?\":\r\n A(ind+1,st+'+')\r\n A(ind+1,st+'-')\r\n else:\r\n A(ind+1,st+t[ind])\r\n \r\nA(0,'')\r\n\r\nprint(ans.count(k)/len(ans))\r\n\r\n\r\n\r\n \r\n\r\n", "import itertools\r\ns1 = input()\r\ns2 = input()\r\nlst1 = list(s1)\r\nlst2 = list(s2)\r\npos1 = 0\r\npos2 = 0\r\nn = 0\r\nfor i in range(len(lst1)):\r\n if lst1[i] == '+':\r\n pos1 +=1\r\n else:\r\n pos1 -=1\r\n if lst2[i] == '+':\r\n pos2 +=1 \r\n elif lst2[i] == '-':\r\n pos2 -=1\r\n else:\r\n n +=1\r\npos = []\r\nprob = 0\r\nlst = list(itertools.product(['-', '+'], repeat=n))\r\nfor i in range(len(lst)):\r\n temp = 0\r\n for j in range(n):\r\n if lst[i][j]=='-':\r\n temp -=1\r\n else:\r\n temp +=1\r\n pos.append(temp)\r\n pos[i] +=pos2 \r\n if pos[i] == pos1:\r\n prob +=1 \r\n \r\nprint(prob/len(lst))", "# author: birsnot - Nardos Wehabe\r\n\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ndef I(): return int(input())\r\ndef II(): return map(int, input().split())\r\ndef IL(): return list(map(int, input().split()))\r\ndef SIL(): return sorted(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n true = input()\r\n prob = input()\r\n target = 0\r\n for ch in true:\r\n target += 1 - 2*(ch == \"-\")\r\n N = len(true)\r\n cur = 0\r\n correct = 0\r\n incorrect = 0\r\n\r\n def helper(i):\r\n nonlocal cur, correct, incorrect\r\n if i == N:\r\n if cur == target:\r\n correct += 1\r\n else:\r\n incorrect += 1\r\n return\r\n if prob[i] == \"+\":\r\n cur += 1\r\n helper(i + 1)\r\n cur -= 1\r\n elif prob[i] == \"-\":\r\n cur -= 1\r\n helper(i + 1)\r\n cur += 1\r\n else:\r\n cur += 1\r\n helper(i + 1)\r\n cur -= 2\r\n helper(i + 1)\r\n cur += 1\r\n helper(0)\r\n print(correct/(correct + incorrect))\r\n\r\n\r\nT = 1\r\nfor ___ in range(T):\r\n solve()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 2 09:22:42 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 34 - CF476-DIV2B\r\n\"\"\"\r\ndef fac(x):\r\n ans = 1\r\n for i in range(1,x+1):\r\n ans *= i\r\n return ans\r\n\r\ndef comp(tot, dist):\r\n if dist > 0:\r\n plus = (dist+tot)//2\r\n minus = tot-plus\r\n else:\r\n minus = (dist+tot)//2\r\n plus = tot-minus\r\n ans = fac(tot)/(fac(plus)*fac(minus)) * pow(2,-tot)\r\n return ans\r\n\r\nd = {\"+\": 1, \"-\": -1}\r\n\r\ns1 = list(str(input()))\r\ntruePos = 0\r\nfor i in range(len(s1)):\r\n truePos += d[s1[i]]\r\n\r\ns2 = list(str(input()))\r\ngPos = 0\r\nm = 0\r\nfor i in range(len(s2)):\r\n if s2[i] in d:\r\n gPos += d[s2[i]]\r\n else:\r\n m += 1\r\n\r\nif m == 0:\r\n print(1*(gPos == truePos))\r\nelif abs(truePos-gPos) > m:\r\n print(0)\r\nelif m%2 != abs(truePos-gPos)%2:\r\n print(0)\r\nelse:\r\n print(comp(m, truePos-gPos))\r\n ", "def search(list, value):\n for i, element, in enumerate(list):\n if (element == value):\n return i\n \n return -1\n\ndef solve(plus_count, minus_count, path):\n count = 0\n unknown = search(path, \"?\")\n\n if unknown == -1:\n return 1 if path.count(\"+\") == plus_count and path.count(\"-\") == minus_count else 0\n \n # Simulates +\n path[unknown] = \"+\"\n count += solve(plus_count, minus_count, path)\n\n # Simulates -\n path[unknown] = \"-\"\n count += solve(plus_count, minus_count, path)\n\n # Restores List state\n path[unknown] = \"?\"\n\n return count\n\ndef main():\n path = list(input())\n received = list(input())\n\n unknow_moves = received.count(\"?\")\n number_paths = 2 ** unknow_moves\n number_solutions = solve(path.count(\"+\"), path.count(\"-\"), received)\n\n print(f\"{number_solutions / number_paths :.12f}\")\n\n\nif __name__ == \"__main__\":\n main()\n\n \t\t \t \t \t\t \t \t\t \t\t \t", "x1 = input()\r\nx2 = input()\r\nhmm = x2.count('?')\r\nppp = 2**hmm\r\np1 = x1.count('+')-x1.count('-')\r\np2 = x2.count('+')-x2.count('-')\r\nz = 0\r\ndef pos(s):\r\n global z\r\n if len(s)==hmm:\r\n if s.count('+')-s.count('-')+p2==p1:\r\n z+=1\r\n return\r\n pos(s+'+')\r\n pos(s+'-')\r\npos('')\r\nprint(z/ppp)", "# /**\r\n# * problem: Dreamoon and WiFi\r\n# * contest: Codeforces Round 272 (Div. 2)\r\n# * author: brownfox2k6\r\n# * created: 15/05/2023 23:48:14 Hanoi, Vietnam\r\n# **/\r\n\r\nfrom math import comb\r\n\r\ndef bal(a):\r\n k = 0\r\n for c in a:\r\n if c == '+':\r\n k += 1\r\n elif c == '-':\r\n k -= 1\r\n return k\r\n\r\ns = bal(input())\r\nt = input()\r\n\r\nt, ct = bal(t), t.count('?')\r\n\r\ndis = abs(t - s)\r\n\r\nif dis > ct:\r\n print(0)\r\nelse:\r\n ans = comb(ct, (ct+dis)//2)\r\n print(ans / (1 << ct))", "from bisect import bisect_left, bisect_right\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom collections import deque, defaultdict, Counter\r\n\r\ninput = sys.stdin.readline\r\ndef gn():\r\n return int(input().strip())\r\n\r\ndef gs():\r\n return input().strip()\r\n\r\ndef gns():\r\n return list(map(int, input().strip().split()))\r\n\r\ns = gs()\r\ny = gs()\r\n\r\npos = 0\r\nfor i in s:\r\n pos += 1 if i == \"+\" else -1\r\n\r\ndp = [[0 for i in range(21)] for i in range(len(s) + 1)]\r\n\r\ndp[0][10] += 1\r\n\r\nfor i in range(1,len(s)+1):\r\n for x in range(20):\r\n if dp[i - 1][x] != 0:\r\n if y[i - 1] == \"+\":\r\n dp[i][x + 1] += dp[i - 1][x]\r\n elif y[i - 1] == \"-\":\r\n dp[i][x - 1] += dp[i - 1][x]\r\n else:\r\n dp[i][x - 1] += dp[i - 1][x]\r\n dp[i][x + 1] += dp[i -1][x]\r\npos += 10\r\nprint(dp[-1][pos]/sum(dp[-1]))\r\n ", "import math\ns1 = list(input())\ns2 = list(input())\n\nu = 0\nx1 = 0\nx2 = 0\n\nfor i in range(len(s1)):\n if s2[i] == '+':\n x2 += 1\n elif s2[i] == '-':\n x2 -= 1\n else:\n u += 1\n\n if s1[i] == '+':\n x1 += 1\n else:\n x1 -= 1\n\nd = abs(x1-x2)\n\nif d > u and d > 0:\n print(0)\nelif u == 0:\n if x1 == x2:\n print(1)\n else:\n print(0)\nelif d % 2 != u % 2:\n print(0) \nelse:\n possibilites = 2**u\n favorable = math.comb(u, math.ceil((u + d) / 2))\n print(favorable / possibilites) ", "import math\r\n\r\ndrezil=input().strip()\r\ndreamoon=input().strip()\r\n\r\nflag=0\r\nfor i in range(len(dreamoon)):\r\n if(dreamoon[i]=='?'):\r\n flag=1\r\n break\r\n\r\ndef combinations(n,r)-> int:\r\n numerator=math.factorial(n)\r\n denominator=(math.factorial(n-r))*(math.factorial(r))\r\n ans=numerator/denominator\r\n return ans\r\n\r\n# if there are no ?\r\nif(flag==0):\r\n plus_drezil=0\r\n minus_drezil=0\r\n plus_dreamoon=0\r\n minus_dreamoon=0\r\n for i in range(len(dreamoon)):\r\n if(dreamoon[i]=='+'):\r\n plus_dreamoon+=1\r\n elif(dreamoon[i]=='-'):\r\n minus_dreamoon+=1\r\n\r\n\r\n for i in range(len(drezil)):\r\n if(drezil[i]=='+'):\r\n plus_drezil+=1\r\n elif(drezil[i]=='-'):\r\n minus_drezil+=1\r\n\r\n if(plus_drezil==plus_dreamoon and minus_drezil==minus_dreamoon):\r\n print('1.000000000000')\r\n else:\r\n print('0.000000000000')\r\nelse:\r\n plus_drezil=0\r\n minus_drezil=0\r\n plus_dreamoon=0\r\n minus_dreamoon=0\r\n ques=0\r\n\r\n for i in range(len(dreamoon)):\r\n if(dreamoon[i]=='+'):\r\n plus_dreamoon+=1\r\n elif(dreamoon[i]=='-'):\r\n minus_dreamoon+=1\r\n elif(dreamoon[i]=='?'):\r\n ques+=1\r\n\r\n\r\n for i in range(len(drezil)):\r\n if(drezil[i]=='+'):\r\n plus_drezil+=1\r\n elif(drezil[i]=='-'):\r\n minus_drezil+=1\r\n\r\n if(plus_drezil>=plus_dreamoon and minus_drezil>=minus_dreamoon):\r\n if(((plus_drezil-plus_dreamoon)+(minus_drezil-minus_dreamoon))!=ques):\r\n print('0.000000000000')\r\n else:\r\n pending_plus=plus_drezil-plus_dreamoon\r\n pending_minus=minus_drezil-minus_dreamoon\r\n m=max(pending_minus,pending_plus)\r\n ans=combinations(ques,m)/(2**(ques))\r\n print('%0.12f'%ans)\r\n else:\r\n print('0.000000000000')", "original = input()\r\ninterpreto = input()\r\n\r\n# Inicialmente, estoy en la coordenada 0\r\ntarget = 0\r\n\r\n# Paso 1: Hallar cual es la coordenada final a la que debo llegar con mi mensaje interpretado\r\nfor instruccion in original:\r\n target += (1 if instruccion == \"+\" else -1)\r\n # if instruccion == \"+\": target += 1\r\n # else: target -= 1\r\n\r\n# Paso 2: Hallar el total de escenarios en el mensaje que interpreto\r\n# Contar cuantos llegan al target\r\n\r\nn = len(original)\r\nwins, fails = 0, 0\r\n\r\n# Indice me indica que instrucción de la cadena que yo interpreto debo analizar\r\n# Coordenada me indica en dónde me encuentro actualmente\r\ndef recursion(index, coordenada):\r\n global wins\r\n global fails\r\n\r\n # Ya no tengo más instrucciones por realizar\r\n if index == n:\r\n if coordenada == target:\r\n wins += 1\r\n else:\r\n fails += 1\r\n return\r\n \r\n # La instrucción actual es determinada. NO es una interrogación == NO tengo que elegir\r\n if interpreto[index] != \"?\":\r\n recursion(index + 1, coordenada + (1 if interpreto[index] == \"+\" else -1))\r\n return\r\n \r\n # Aquí tengo que tomar una decisión:\r\n # Opcion A: Considero que la ? es un +\r\n recursion(index + 1, coordenada + 1)\r\n\r\n # Opcion B: Considero que la ? es un -\r\n recursion(index + 1, coordenada - 1)\r\n\r\n\r\nrecursion(0, 0)\r\nprint(f\"{wins / (wins + fails):.9f}\")\r\n", "import math\n\nsent = input()\nrecieved = input()\n\nsent_balance = 0\nrecieved_balance = 0\nunrecognized = 0\n\nfor i in range(len(sent)):\n if sent[i] == '+':\n sent_balance += 1\n else:\n sent_balance -= 1\n\n if recieved[i] == '+':\n recieved_balance += 1\n elif recieved[i] == '-':\n recieved_balance -= 1\n else:\n unrecognized += 1\n\nbalance_difference = abs(sent_balance - recieved_balance)\nbd = (balance_difference + unrecognized)/2 # Needed balance difference\nun = unrecognized\npi = 0.5\n\nif balance_difference > unrecognized or bd % 1:\n ans = 0\nelse:\n bd = int(bd)\n ans = (math.factorial(un)*(pi**bd)*((1-pi)**(un-bd)))/(math.factorial(bd)*math.factorial(un-bd))\n\nprint(ans)\n \t \t\t \t \t \t \t\t \t\t\t\t", "def solve(inp, out):\r\n posin = 0\r\n posout = 0\r\n cqn = 0\r\n\r\n for i in inp :\r\n if i == '+' :\r\n posin += 1\r\n else :\r\n posin -= 1\r\n \r\n for i in out :\r\n if i == '+' :\r\n posout += 1\r\n elif i == '-':\r\n posout -= 1\r\n else :\r\n cqn += 1\r\n \r\n diff = posin - posout \r\n\r\n total = 2**cqn\r\n required = 0\r\n\r\n for i in range(total):\r\n temp = i\r\n sum = 0\r\n for j in range(cqn):\r\n if temp%2 == 0: \r\n sum += 1\r\n else :\r\n sum -= 1\r\n temp = temp//2\r\n if sum == diff :\r\n required += 1 \r\n\r\n print(required/total)\r\n # print(posin, posout, cqn)\r\n\r\ni = input()\r\no = input()\r\n\r\nsolve(i,o)", "import math\n\na = input()\nb = input()\nplusA = a.count('+')\nplusB = b.count('+')\nminusA = a.count('-')\nminusB = b.count('-')\nif plusB > plusA or minusB > minusA:\n print(f\"{0:.9f}\")\nelse:\n v = b.count('?')\n v1 = v\n v1 -= (plusA - plusB)\n if v1 < 0:\n print(f\"{0:.9f}\")\n else:\n plusB = plusA\n minusB += v1\n if plusB != plusA and minusB != minusA:\n print(f\"{0:.9f}\")\n else:\n def c(n, k):\n return math.factorial(n) / (math.factorial(k) * math.factorial(n - k))\n print(f\"{c(v, v1) / (2 ** v):.9f}\")\n# Sat Apr 16 2022 15:55:38 GMT+0000 (Coordinated Universal Time)\n", "sent = input()\r\n\r\nrgn = input()\r\n\r\n\r\ndef tryPermutation(bin):\r\n addedPower = 0\r\n for ch in bin:\r\n addedPower+= 1 if ch =='1' else -1\r\n return addedPower\r\n\r\ntotal_strength = 0 \r\n\r\nfor ch in sent:\r\n total_strength+= 1 if ch =='+' else -1\r\n\r\nstrength = 0 \r\n\r\nrqts = 0\r\n\r\nfor ch in rgn:\r\n if (ch == '?'):\r\n rqts+=1\r\n else:\r\n strength+= 1 if ch =='+' else -1\r\n\r\nif rqts == 0:\r\n print(\"1.000000000000\" if total_strength == strength else \"0.0000\")\r\n \r\nelse:\r\n\r\n totalOutcomes = 2 ** rqts\r\n\r\n correctPermutation = 0\r\n\r\n for i in range (totalOutcomes):\r\n bin = format(i , 'b')\r\n bin = bin.zfill(rqts)\r\n if tryPermutation(bin) + strength == total_strength:\r\n correctPermutation+=1\r\n\r\n\r\n print(correctPermutation / totalOutcomes)\r\n\r\n\r\n \r\n", "a = input()\r\nb = input()\r\nn = len(a)\r\nan = 0\r\nfor i in range(n):\r\n an += 1 if a[i] == '+' else -1\r\ndef g(x, y):\r\n if x == n:\r\n return 1 if y == an else 0\r\n if b[x] != '?':\r\n y += 1 if b[x] == '+' else -1\r\n return g(x+1, y)\r\n else:\r\n return g(x+1, y-1) + g(x+1, y+1)\r\nif b.count('?') == 0:\r\n x, y = 0, 0\r\n for i in range(n):\r\n x += 1 if a[i] == '+' else -1\r\n y += 1 if b[i] == '+' else -1\r\n print('%.12f'%1 if x == y else '%.12f'%0)\r\nelse:\r\n\r\n ans = g(0, 0) / (2**b.count('?'))\r\n print('%.12f'%ans)\n# Sat Aug 20 2022 08:20:37 GMT+0000 (Coordinated Universal Time)\n", "from math import factorial,pow\r\na=input()\r\nb=input()\r\nif('?' not in b):\r\n if(sorted(list(a))==sorted(list(b))):\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n x=y=0\r\n for i in a:\r\n if(i=='+'):\r\n x+=1\r\n else:\r\n x-=1\r\n for i in b:\r\n if(i=='+'):\r\n y+=1\r\n elif(i=='-'):\r\n y-=1\r\n c=b.count('?')\r\n if(y-c<=x<=y+c):\r\n y-=c\r\n if((x-y)%2!=0):\r\n print(0)\r\n else:\r\n z=(x-y)//2\r\n print((factorial(c)/(factorial(z)*factorial(c-z)))/pow(2,c))\r\n else:\r\n print(0)", "def dreamoon_wifi(relacao_reconhecidos,icognitas,relacao_entrada,contador):\n if icognitas == 0:\n if relacao_reconhecidos == relacao_entrada:\n contador += 1\n return contador\n\n return dreamoon_wifi(relacao_reconhecidos+1, icognitas-1, relacao_entrada, contador) + dreamoon_wifi(relacao_reconhecidos-1, icognitas-1, relacao_entrada, contador)\n\ndef main():\n s_entrada = input()\n relacao_entrada = 0\n\n for i in s_entrada:\n if i == '+':\n relacao_entrada += 1\n else:\n relacao_entrada -= 1\n\n s_reconhecidos = input()\n relacao_reconhecidos = 0\n icognitas = 0\n\n for i in s_reconhecidos:\n if i == '+':\n relacao_reconhecidos += 1\n elif i == '-':\n relacao_reconhecidos -= 1\n else:\n icognitas += 1\n\n contador = 0\n contador = dreamoon_wifi(relacao_reconhecidos,icognitas,relacao_entrada,contador)\n\n probabilidade = (1.0/pow(2,icognitas)) * contador\n\n print(\"%.15f\" % probabilidade)\n\nmain()", "# https://codeforces.com/problemset/problem/476/B\r\n\r\nw1 = input()\r\n\r\nr = 0\r\nfor i in w1:\r\n if i == '+':\r\n r += 1\r\n else:\r\n r -= 1\r\n\r\nc = [0] * 21\r\nc[10] = 1\r\nw2 = input()\r\nfor idx, item in enumerate(w2):\r\n tmp = [0] * 21\r\n if item == '+':\r\n for i in range(len(c)):\r\n if c[i] != 0:\r\n tmp[i+1] += c[i]\r\n if item == '-':\r\n for i in range(len(c)):\r\n if c[i] != 0:\r\n tmp[i-1] += c[i]\r\n if item == '?':\r\n for i in range(len(c)):\r\n if c[i] != 0:\r\n tmp[i-1] += c[i] / 2\r\n tmp[i+1] += c[i] / 2\r\n c = tmp\r\nprint(c[r+10])", "def fact(n):\r\n ans = 1\r\n for i in range(1, n+1):\r\n ans *= i\r\n return ans\r\n\r\ndef choose(n, r):\r\n return fact(n)/(fact(r)*fact(n-r))\r\n\r\ns = input()\r\nt = input()\r\nx = 0\r\ny = 0\r\nfor i in range(len(s)):\r\n if (s[i] == '+'):\r\n x += 1\r\n else:\r\n y += 1\r\n if (t[i] == '+'):\r\n x -= 1\r\n elif (t[i] == '-'):\r\n y -= 1\r\nif (x < 0 or y < 0):\r\n print(0)\r\nelse:\r\n print(choose(x+y, x)/(2**(x+y)))\r\n", "def fact(n):\r\n an=1 \r\n for i in range(1,n+1):\r\n an=an*i \r\n return an\r\ns1=input()\r\ns2=input()\r\ns1=list(s1)\r\ns2=list(s2)\r\nap=s1.count(\"+\")\r\nam=s1.count(\"-\")\r\ntp=s2.count(\"+\")\r\ntm=s2.count(\"-\")\r\nif(ap==tp and am==tm):\r\n print(2/2)\r\nelif((ap-tp)<0 or (am-tm)<0):\r\n print(0/2)\r\nelse:\r\n tag=(ap+am-(tp+tm))\r\n y=(1<<tag)\r\n \r\n x=fact(tag)\r\n tx=fact(ap-tp)\r\n ty=fact(am-tm)\r\n x=(x/(tx*ty))\r\n print(x/y)\r\n \r\n \r\n", "from math import comb\r\na,b=list(input()),list(input())\r\nx=a.count('+')-b.count('+');y=b.count('?')\r\nif x<0 or x>y:print(0)\r\nelse:print(comb(y,x)/2**y)", "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\n\r\ns1=input()\r\n\r\ns2=input()\r\n\r\nans=0\r\n\r\nfor i in s1:\r\n ans+= 1 if i==\"+\" else -1\r\n\r\nque=deque([0])\r\n\r\n\r\nres=0\r\nfor i in s2:\r\n if i==\"+\":\r\n res+=1\r\n elif i==\"-\":\r\n res-=1\r\n else:\r\n L=len(que)\r\n for _ in range(L):\r\n q=que.popleft()\r\n que.append(q+1)\r\n que.append(q-1)\r\n\r\nL=len(que)\r\n\r\ncnt=0\r\n\r\nwhile que:\r\n q=que.popleft()\r\n if q==ans-res:\r\n cnt+=1\r\n\r\nprint(cnt/L)\r\n ", "# Dreamoon and WiFi\r\ndef recursion(p, m, depth):\r\n global sq, correct, total, rp, rm\r\n if depth >= sq:\r\n total += 1\r\n if p == rp and m == rm:\r\n correct += 1\r\n else:\r\n recursion(p + 1, m, depth + 1)\r\n recursion(p, m + 1, depth + 1)\r\n\r\nreal = input()\r\nsent = input()\r\nrp, rm = real.count(\"+\"), real.count(\"-\")\r\nsp, sm, sq = sent.count(\"+\"), sent.count(\"-\"), sent.count(\"?\")\r\ncorrect = 0\r\ntotal = 0\r\n\r\nrecursion(sp, sm, 0)\r\nprint(f\"{correct / total : .12f}\")", "inp = input()\nout = input()\n\nsuccess = 0\nfail = 0\n\ndef traverse(orig,dest,n):\n if n == 0:\n if orig == dest:\n global success\n success +=1\n else:\n global fail\n fail += 1\n return 0\n else:\n traverse(orig,dest+1,n-1)\n traverse(orig,dest-1,n-1)\n\nmove_in = 0\nmove_out = 0\n\nfor i in inp:\n if i=='+':\n move_in +=1\n else:\n move_in -=1\n\nquestions = 0\nfor i in out:\n if i=='+':\n move_out +=1\n elif i == '?':\n questions +=1\n else:\n move_out -=1\n\nif(((questions + abs(move_in - move_out))%2)) or (questions < abs(move_in - move_out)):\n print(0)\nelse:\n traverse(move_in,move_out,questions)\n print(success/(success+fail))\n\n\n \t \t \t \t \t \t\t \t \t\t", "from math import comb\r\n\r\na = input()\r\nb = input()\r\n\r\ncnt = 0\r\ncur = 0\r\ntarget = 0\r\nfor c in a:\r\n if c == \"+\": target += 1\r\n else: target -= 1\r\n\r\nfor c in b:\r\n if c == \"+\": cur += 1\r\n elif c == \"-\": cur -= 1\r\n else: cnt += 1\r\n\r\ndiff = abs(target - cur)\r\n\r\nif cnt % 2 != diff % 2 or cnt < diff:\r\n ans = 0\r\nelse:\r\n val = (cnt - diff) // 2\r\n ans = comb(cnt, val)\r\n\r\nprint(ans / 2 ** cnt)", "\nopts = []\nfor i in range(11):\n opts.append({})\nopts[0][0] = 1.0\n\n# opts[i][j] = prob de conseguir j com i jogadas\nopts[1][-1] = 0.5\nopts[1][0] = 0\nopts[1][1] = 0.5\n\n# opts[2][-2] = 0.250\n# opts[2][-1] = 0\n# opts[2][0] = 0.5\n# opts[2][1] = 0\n# opts[2][2] = 0.250\n\n# opts[i][j] = opts[i-1][j+1] * 0.5 + opts[i-1][j-1]*0.5\n\nfor i in range(2, 11):\n for j in range(-i, i+1):\n opts[i][j] = 0\n if j-1 in opts[i-1]:\n opts[i][j] += opts[i-1][j-1] * 0.5\n if j+1 in opts[i-1]:\n opts[i][j] += opts[i-1][j+1] * 0.5\n\n# for k in opts:\n# for o in k:\n# print(f'{o} : {k[o]}')\n\ns1 = input()\ns2 = input()\n\n\nintended = 0\nfor i in s1:\n if i == \"+\":\n intended += 1\n else:\n intended -=1\n\n\nactual = 0\ntosses = 0\n\nfor i in s2:\n if i == \"+\":\n actual +=1\n elif i == \"-\":\n actual -=1\n else:\n tosses += 1\n\ndiff = intended - actual\n\nif abs(diff) > tosses:\n print(\"%.12f\" % 0.0)\nelse:\n print(\"%.12f\" % opts[tosses][diff])", "s1 = input()\r\ns2 = input()\r\n\r\npos = [0]*(21)\r\n\r\nreqpos = 0\r\nfor char in s1:\r\n if char == '+':\r\n reqpos +=1\r\n else:\r\n reqpos -=1\r\n\r\ndef dfs(i,currpos):\r\n if i == len(s2):\r\n pos[currpos] +=1\r\n return\r\n\r\n if s2[i] == '+':\r\n dfs(i+1,currpos+1)\r\n elif s2[i] == '-':\r\n dfs(i+1,currpos-1)\r\n \r\n else:\r\n dfs(i+1,currpos+1)\r\n dfs(i+1,currpos-1)\r\ndfs(0,0)\r\n\r\ncnt = 0\r\nfor char in s2:\r\n if char == '?':\r\n cnt +=1\r\n\r\nprint(pos[reqpos]/(2**cnt))\r\n\r\n\r\n \r\n \r\n", "import math \r\ns=input()\r\ns1=input()\r\nq=len(s)\r\nv=0\r\np=0\r\nt=0\r\nfor i in range(q):\r\n if s[i]==\"+\":\r\n v+=1\r\n else:\r\n v-=1\r\nfor i in range(q):\r\n if s1[i]==\"+\":\r\n t+=1\r\n elif s1[i]==\"-\":\r\n t-=1\r\n else:\r\n p+=1\r\nb=abs(v-t)\r\nif p==0 and t==v:\r\n print(1)\r\nelif p==0 and t!=v:\r\n print(0)\r\nelif b>p:\r\n print(0)\r\nelif p%2==0 and b%2==1:\r\n print(0)\r\nelif p%2==1 and b%2==0:\r\n print(0)\r\nelse:\r\n if p%2==0:\r\n k=(p//2)+(b//2)\r\n else:\r\n k=(p//2+1)+(b//2)\r\n m=math.factorial(p)/(math.factorial(k)*(math.factorial(p-k)))\r\n c=2**p\r\n w=m/c\r\n print(w)", "a=input()\r\nb=input()\r\nap=0\r\nfor i in range(len(a)):\r\n if a[i]==\"+\":\r\n ap+=1\r\n else:\r\n ap-=1\r\nright=0\r\nwrong=0\r\ndef bt(summ,i):\r\n global right\r\n global wrong\r\n if i==len(b):\r\n if summ==ap:\r\n right+=1\r\n return\r\n else:\r\n wrong+=1\r\n return\r\n if b[i]==\"?\":\r\n bt(summ-1,i+1)\r\n bt(summ+1,i+1)\r\n else:\r\n if b[i]==\"+\":\r\n bt(summ+1, i+1)\r\n else:\r\n bt(summ-1, i+1)\r\nbt(0,0)\r\nprint(right/(right+wrong))", "s1=input()\r\ns2=input()\r\nn=len(s1)\r\nta=0\r\nfa=0\r\nq=0\r\n\r\nfor i in range(n):\r\n if s1[i]==\"+\":\r\n ta+=1\r\n else:\r\n ta-=1\r\n if s2[i]=='+':\r\n fa+=1\r\n elif s2[i]=='-':\r\n fa-=1\r\n else:\r\n q+=1\r\n\r\n\r\nif q==0:\r\n if(fa==ta):\r\n print(float(1))\r\n else:\r\n print(float(0))\r\nelse:\r\n a=0\r\n l=[-1,1]\r\n q-=1\r\n if q!=0:\r\n for i in range(q):\r\n for j in range(len(l)):\r\n l.append(l[j]+1)\r\n l[j]-=1\r\n for ans in l:\r\n if(ans==ta-fa):\r\n a+=1\r\n print(a/len(l))", "\r\n\r\nimport sys\r\nimport math\r\nfrom functools import cmp_to_key\r\n\r\n\r\n\r\n\r\n\r\ndef helper(s,idx,sum,result):\r\n\r\n if idx == len(s):\r\n result.append(sum)\r\n return\r\n\r\n if s[idx] == '+':\r\n helper(s,idx+1,sum+1,result)\r\n\r\n elif s[idx] == '-':\r\n helper(s,idx+1,sum-1,result)\r\n\r\n else:\r\n helper(s,idx+1,sum+1,result)\r\n helper(s,idx+1,sum-1,result)\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n\r\n s1 = input()\r\n s2 = input()\r\n\r\n idx = 0 \r\n real = []\r\n sum1 = 0 \r\n helper(s1,idx,sum1,real)\r\n\r\n result = []\r\n idx=0\r\n sum2 = 0 \r\n helper(s2,idx,sum2,result)\r\n\r\n c = 0 \r\n for i in result:\r\n if i == real[0]:\r\n c += 1\r\n\r\n x = c/len(result)\r\n print('%.12f'%x)\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n solve()\r\n", "def get_all_sums(n):\n '''\n Retorna um array com todas somas possíveis com n comandos.\n '''\n if n == 0:\n return [0]\n else:\n sums = []\n for sum in get_all_sums(n - 1):\n sums.append(sum + 1)\n sums.append(sum - 1)\n return sums\n\n\ndef get_success_probability(s1, s2):\n '''\n Retorna a probabilidade de sucesso considerando os comandos reais s1 e os\n recebidos s2.\n '''\n planned_position = 0\n for command in s1:\n planned_position += 1 if (command == '+') else -1\n\n # Position without unrecognized commands.\n aux_real_position = 0\n\n # Quantity of unrecognized commands.\n unrecognized_commands = 0\n\n for command in s2:\n if command == '+':\n aux_real_position += 1\n \n elif command == '-':\n aux_real_position += -1\n \n else:\n unrecognized_commands += 1\n\n\n position_difference = abs(planned_position - aux_real_position)\n\n if (position_difference > unrecognized_commands):\n return(0.0)\n\n else:\n possible_paths = get_all_sums(unrecognized_commands)\n favorable_cases = possible_paths.count(position_difference)\n total_cases = len(possible_paths)\n return(favorable_cases / total_cases)\n \n\n\ns1 = list(input())\ns2 = list(input())\nprint(get_success_probability(s1, s2))\n\t \t\t \t\t \t \t\t \t \t\t \t\t \t\t \t\t\t", "correct_dirs = input()\r\ncorrect_position = correct_dirs.count('+') * 1 + correct_dirs.count('-') * -1\r\n\r\nreceived_dirs = input()\r\ntest_list = [0]\r\nfor direction in received_dirs:\r\n if direction == '+':\r\n test_list = [pos + 1 for pos in test_list]\r\n elif direction == '-':\r\n test_list = [pos - 1 for pos in test_list]\r\n else:\r\n test_list = [pos + 1 for pos in test_list] + [pos - 1 for pos in test_list]\r\n\r\nprint(test_list.count(correct_position) / len(test_list))\r\n", "from sys import stdin, stdout\r\ndef rd(): return stdin.readline().strip()\r\ndef wtl(x): stdout.write(str(x) + '\\n')\r\n\r\ns = rd()\r\ne = 0\r\nfor c in s:\r\n e += (1 if c == '+' else -1)\r\nt = rd()\r\nn, P, Q = len(s), 0.0, sum((c == '?') for c in t)\r\nfor i in range(2**Q):\r\n ee, p, q = 0, 1.0, 0\r\n for j in range(n):\r\n if t[j] == '?':\r\n ee += (1 if (i >> q) & 1 else -1)\r\n p, q = p * .5, q + 1\r\n else:\r\n ee += (1 if t[j] == '+' else -1)\r\n if e == ee:\r\n P += p\r\nwtl(P)", "def calcPosition(string):\n finalPos = 0\n for i in range(len(string)):\n if string[i] == '+':\n finalPos += 1\n elif string[i] == '-':\n finalPos -= 1\n return finalPos\n\ndef main():\n s1 = input()\n s2 = input()\n correctPos = calcPosition(s1)\n possibilities = []\n\n for i in range(len(s2)):\n if s2[i] == '+':\n if len(possibilities) == 0:\n possibilities.append(1)\n else:\n for j in range(len(possibilities)):\n possibilities[j] = possibilities[j] + 1\n\n elif s2[i] == '-':\n if len(possibilities) == 0:\n possibilities.append(-1)\n else:\n for j in range(len(possibilities)):\n possibilities[j] = possibilities[j] - 1\n\n elif s2[i] == '?':\n if len(possibilities) == 0:\n possibilities.append(1)\n possibilities.append(-1)\n else:\n newPossibilities = []\n for pos in possibilities:\n newPossibilities.append(pos + 1)\n newPossibilities.append(pos - 1)\n possibilities = newPossibilities\n\n count = 0 \n for pos in possibilities:\n if pos == correctPos:\n count += 1\n print(count/len(possibilities))\n return\n\nmain()\n\t \t \t\t \t\t \t\t \t\t \t\t \t \t", "def allCases(s2, index, positive):\r\n global final\r\n global cnt\r\n if index == len(s2):\r\n if final == positive - (len(s2) - positive):\r\n cnt += 1\r\n return\r\n \r\n if s2[index] == '+':\r\n allCases(s2, index + 1, positive + 1)\r\n elif s2[index] == '?':\r\n s2[index] = '+'\r\n allCases(s2, index + 1, positive + 1)\r\n s2[index] = '-'\r\n allCases(s2, index + 1, positive)\r\n s2[index] = '?'\r\n else:\r\n allCases(s2, index + 1, positive)\r\n \r\n\r\ns1 = input()\r\ns2 = list(input())\r\nvisited = [False] * len(s2)\r\ncases = 2**s2.count('?')\r\nfinal = s1.count('+') - s1.count('-')\r\ncnt = 0\r\nallCases(s2, 0, 0)\r\nprint('{0:.9f}'.format(cnt / cases))", "import os,sys;from io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno();self.buffer = BytesIO();self.writable = \"x\" in file.mode or \"r\" not in file.mode;self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:break\r\n ptr = self.buffer.tell();self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE));self.newlines = b.count(b\"\\n\") + (not b);ptr = self.buffer.tell();self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:os.write(self._fd, self.buffer.getvalue());self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file);self.flush = self.buffer.flush;self.writable = self.buffer.writable;self.write = lambda s: self.buffer.write(s.encode(\"ascii\"));self.read = lambda: self.buffer.read().decode(\"ascii\");self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ntry:sys.stdin,sys.stdout=open('in.txt','r'),open('out.txt','w')\r\nexcept:pass\r\nii1=lambda:int(sys.stdin.readline().strip()) # for interger\r\nis1=lambda:sys.stdin.readline().strip() # for str\r\niia=lambda:list(map(int,sys.stdin.readline().strip().split())) # for List[int]\r\nisa=lambda:sys.stdin.readline().strip().split() # for List[str]\r\nmod=int(1e9 + 7);\r\nfrom math import inf \r\nfrom collections import defaultdict as dd\r\n# from math import *\r\n# from collections import *;\r\n# from collections import deque as dq \r\n# from string import ascii_lowercase,ascii_uppercase\r\n# from functools import lru_cache\r\n# sys.setrecursionlimit(500000)\r\n# from bisect import bisect_left as bl,bisect_right as br\r\n# from heapq import heapify,heappop,heappush\r\n# def google(p):print('Case #'+str(p)+': ',end='')\r\n###################### Start Here ######################\r\nclass Sol:\r\n def __init__(self,s,ss,f) -> None:\r\n self.s = s \r\n self.ss = ss \r\n self.n = len(ss)\r\n self.f = f\r\n self.g = 0 \r\n self.t = 0 \r\n \r\n def solve(self):\r\n def solve(curr,idx):\r\n if idx == self.n:\r\n self.t += 1 \r\n if curr == self.f:\r\n self.g += 1 \r\n return \r\n if self.ss[idx] == '?':\r\n solve(curr+1,idx+1)\r\n solve(curr - 1 , idx + 1 )\r\n else:\r\n if self.ss[idx] == '+':\r\n solve(curr+1,idx+1)\r\n else:\r\n solve(curr -1, idx + 1)\r\n solve(0,0)\r\n return self.g / self.t\r\n\r\ndef main(t):\r\n s = is1()\r\n ss = is1()\r\n f = 0 \r\n for i in s:\r\n f += 1 if i == '+' else -1\r\n s = Sol(s,ss,f)\r\n ans = s.solve()\r\n print(ans)\r\n \r\n \r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1 \r\n # t = ii1()\r\n for _ in range(t):\r\n main(_)\r\n \r\n# snippets\r\n# @f - for loop \r\n# @bfs - breadth first search \r\n# @Trie - Trie Data Structure \r\n# @trie - Trie Data Structure Simple\r\n# @trie2 - Trie Data Structure Count,Delete\r\n# @rangeupdatepointquery - range update\r\n# @DS - Disjoint Set\r\n# @seive - generate seive", "import math\r\ncmds = input()\r\nrecieved = input()\r\n\r\ndef calc_sum(cmds): \r\n balance = 0\r\n unknown = 0\r\n for cmd in cmds:\r\n if cmd == '+':\r\n balance += 1\r\n elif cmd == '-':\r\n balance -= 1\r\n elif cmd == '?':\r\n unknown += 1\r\n else:\r\n raise Exception(\"shit input\")\r\n \r\n return (balance, unknown)\r\n\r\n\r\ncmds_balance, _ = calc_sum(cmds)\r\nrecv_balance, unknown = calc_sum(recieved)\r\n\r\ndiff = cmds_balance - recv_balance\r\n\r\nif abs(diff) > unknown:\r\n print(0)\r\nelse:\r\n n = unknown\r\n k = (diff + unknown) / 2\r\n if k == int(k):\r\n print(math.comb(n,int(k)) * (0.5 ** unknown))\r\n else:\r\n print(0)\r\n\r\n", "S=input()\r\nL=input()\r\nres1=0\r\nfor u in S:\r\n if u==\"+\":\r\n res1+=1\r\n else:\r\n res1-=1\r\nres2=0\r\ncount=0\r\nfor u in L:\r\n if u==\"?\":\r\n count+=1\r\n elif u==\"+\":\r\n res2+=1\r\n else:\r\n res2-=1\r\nflag=1\r\ntemp=0\r\nfor i in range(count+1):\r\n if i-(count-i)==res2-res1:\r\n flag=0\r\n temp=i\r\n break\r\nif flag==1:\r\n print(0)\r\nelse:\r\n from math import comb\r\n print(comb(count,temp)*(2**-count))\r\n", "import sys\r\nimport operator as op\r\n\r\n\r\n#sys.stdin = open('input.txt','r')\r\ns1 = sys.stdin.readline().strip()\r\ns2 = sys.stdin.readline().strip()\r\n\r\nend = op.countOf(s1, \"+\") - op.countOf(s1, \"-\")\r\nstart = op.countOf(s2, \"+\") - op.countOf(s2, \"-\")\r\ntarget = end - start\r\nsteps = op.countOf(s2, \"?\") \r\n\r\n\r\ndef can_go(target,steps):\r\n \"\"\"\r\n checks if there is a way we can get an integer target by suming\r\n a*1 and b*-1 that a + b = steps\r\n\r\n \"\"\"\r\n return target%2 == steps%2 and abs(target) <= steps\r\n\r\ndef nb_ways_of_sum(target,steps):\r\n \"\"\"\r\n how many ways can we get an integer target by suming\r\n a*1 and b*-1 that a + b = steps\r\n\r\n \"\"\"\r\n if not can_go(target,steps):\r\n return 0\r\n if target == 0 and steps == 0:\r\n return 1\r\n numOfWays = nb_ways_of_sum(target-1,steps-1) + nb_ways_of_sum(target+1,steps-1)\r\n \r\n \r\n\r\n return numOfWays\r\n\r\n\r\n#sys.stdin.close()\r\nresult = nb_ways_of_sum(target,steps)/(2**steps)\r\nprint(float(\"{:.9f}\".format(result)))\r\n", "import math\nfrom sys import stdin, stdout\ninput = stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n\tstdout.write(sep.join(map(str, args)) + end)\ndef int_map():\n\treturn map(int, input().split())\ndef list_int():\n\treturn list(map(int, input().split()))\n\noriginal = input().strip()\npositives = []\nnegatives = []\nno = False\nfor i in original:\n\tif i == \"-\":\n\t\tnegatives.append(1)\n\telse:\n\t\tpositives.append(1)\nrecieved = sorted(input().strip())\nfor i in recieved:\n\tif i == \"?\":\n\t\tbreak\n\tif i == \"+\":\n\t\tif not positives:\n\t\t\tprint(0)\n\t\t\texit()\n\t\tpositives.pop()\n\tif i == \"-\":\n\t\tif not negatives:\n\t\t\tprint(0)\n\t\t\texit()\n\t\tnegatives.pop()\nn = len(negatives) + len(positives)\nr = len(positives)\nf = math.factorial\nprint(f(n)/(f(n-r) * f(r))/2**n)\n\n\n\n\n\n\n\n\n\n\n\n", "import math\n\ndef calculaAnaliseCombinatoria(n,p):\n return math.factorial(n) / (math.factorial(p)*math.factorial(n-p))\n\ndef main():\n drazil = input()\n dreamoon = input()\n\n contInterrogacao = dreamoon.count('?')\n diferenca = drazil.count('-') - dreamoon.count('-')\n if contInterrogacao < 0 or diferenca < 0 or diferenca > contInterrogacao:\n print(f\"{0:.9f}\")\n else:\n resultado = calculaAnaliseCombinatoria(contInterrogacao, diferenca) / (2**contInterrogacao)\n print(f\"{resultado:.9f}\")\n\nmain()\n\t \t \t\t\t\t \t\t \t \t\t \t\t \t\t \t", "from math import *\r\n\r\ndef solve(s1, s2):\r\n t1, t2, wildcard = 0, 0, 0\r\n p = {'+': 1, '-':-1}\r\n for i in range(len(s1)):\r\n t1 += p[s1[i]]\r\n if s2[i] == '?': wildcard += 1\r\n else: t2 += p[s2[i]]\r\n dt = abs(t1-t2)\r\n return 0 if wildcard % 2 != dt % 2 or dt > wildcard else comb(wildcard,(wildcard-dt)//2)/ 2**wildcard\r\n\r\ns1 = input()\r\ns2 = input()\r\nprint(\"%.9f\" % solve(s1, s2))", "#https://codeforces.com/problemset/problem/476/B\r\nimport math\r\ns1 = input()\r\ns2 = input()\r\ncorrect = 0\r\nfor i in range(len(s1)):\r\n if(s1[i] == '+'):\r\n correct += 1\r\n elif(s1[i] == '-'):\r\n correct -= 1\r\nunk = 0\r\npos = 0\r\nfor i in range(len(s2)):\r\n if(s2[i] == '+'):\r\n pos += 1\r\n elif(s2[i] == '-'):\r\n pos -= 1\r\n else:\r\n unk += 1\r\n\r\n# add unk//2\r\n\r\ndef calcbin(n, x):\r\n if(x < 0 or x > n):\r\n return 0\r\n else:\r\n return math.comb(n, x)*math.pow(0.5, x)*math.pow(0.5, n-x)\r\n\r\nif((pos - correct)%2 != unk%2):\r\n print(0)\r\nelse:\r\n print(calcbin(unk, ((pos - correct)+unk)//2))\r\n#print(unk, ((pos - correct)+unk)//2)", "def calculatePosition(list):\n pos = 0\n for i in range(len(list)):\n pos += 1 if list[i] == \"+\" else -1\n return pos\n\ndef outputPossibilities(list):\n if len(list) == 0:\n return [\"\"]\n possibilities = []\n for possibility in outputPossibilities(list[1:]):\n if list[0] == \"?\":\n possibilities.append(\"+\" + possibility)\n possibilities.append(\"-\" + possibility)\n else:\n possibilities.append(list[0] + possibility)\n return possibilities\n\noriginal = input()\nreceived = [*input()]\npossibilities = outputPossibilities(received)\noriginalPos = calculatePosition(original)\nreceivedPossiblePos = [calculatePosition(possibility) for possibility in possibilities]\nprint(receivedPossiblePos.count(originalPos)/len(receivedPossiblePos))\n \t\t\t \t\t\t \t \t\t \t\t\t\t\t\t \t\t\t \t", "line1 = input()\r\nline2 = input()\r\nt = d = w = 0\r\nfor i in range(len(line1)):\r\n if line2[i] == '?':\r\n d += 1\r\n if line1[i] == '+':\r\n t += 1\r\n else:\r\n t -= 1\r\n if line2[i] == '+':\r\n t -= 1\r\n elif line2[i] == '-':\r\n t += 1\r\nfor i in range(1 << d):\r\n c = t\r\n k = i\r\n for j in range(1, d+1):\r\n if int(k) & 1:\r\n c += 1\r\n else:\r\n c -= 1\r\n k /= 2\r\n if c == 0:\r\n w += 1\r\nd = 1 << d\r\nprint(format(w/float(d), \".20f\"))\r\n", "import math\n\ns1 = input()\ns2 = input()\n\nesperado = 0\nfuturo = 0\ninterrogacoes = 0\n\nfor i in range(len(s1)):\n if s1[i] == '-':\n esperado -= 1\n else:\n esperado += 1\n\nfor i in range(len(s2)):\n if s2[i] == '-':\n futuro -= 1\n elif s2[i] == '+':\n futuro += 1\n else:\n interrogacoes += 1\n\nfalta = esperado - futuro\nchecagem = interrogacoes\nsinais = interrogacoes\n\npossivel = False\n\nwhile checagem >= -interrogacoes:\n if falta == checagem:\n possivel = True\n break\n sinais -= 1\n checagem -= 2\n\nif falta == 0 and interrogacoes == 0:\n possivel = True\n\nif not possivel:\n print('0')\nelse:\n combinacao = math.factorial(interrogacoes) / (math.factorial(sinais) * math.factorial(interrogacoes - sinais))\n possibilidades = 0\n sinais = interrogacoes\n while sinais >= 0:\n possibilidades += math.factorial(interrogacoes) / (math.factorial(sinais) * math.factorial(interrogacoes - sinais))\n sinais -= 1\n\n\n print(combinacao / possibilidades)\n\t \t\t\t\t\t \t \t \t \t\t\t \t\t \t \t", "from math import comb \r\na,b=input(),input()\r\nn=b.count('?')\r\nr=a.count('-')-b.count('-')\r\nq=a.count('+')-b.count('+')\r\nif n<r or r<0:\r\n print(0)\r\nelse:\r\n print((comb(n,r)*comb(n-r,q))/(2**n))", "total, n = 0, 0\ndef last_position(p, moves):\n global total\n global n\n global desired_pos\n if(moves==0):\n total+=1\n if(p==desired_pos):\n n+=1\n else:\n last_position(p-1,moves-1)\n last_position(p+1, moves-1)\n\nstr1 = input()\nstr2 = input()\n\nglobal desired_pos\n\ndesired_pos = str1.count('+') - str1.count('-')\ncurrent = str2.count('+') - str2.count('-')\n\nlast_position(current, str2.count('?'))\n\nprint(n/total)\n\n\t \t \t \t \t \t\t\t \t \t \t\t\t", "import math\r\na=str(input())\r\nb=str(input())\r\nx,y,n,m,k=0,0,0,0,0\r\nfor i in a:\r\n if i==\"+\": x+=1\r\n else: y+=1\r\nfor i in b:\r\n if i==\"+\": n+=1\r\n elif i==\"-\": m+=1\r\n else: k+=1\r\nif (x-n)+(y-m)==k and x>=n and y>=m:\r\n f=x-n\r\n t=math.factorial(k)//(math.factorial(f)*math.factorial(k-f))\r\n t/=math.pow(2,k)\r\n print(t)\r\nelse:\r\n print(float(0))", "original = input()\nfinal = 0\nfor i in original:\n final += 1 if i == \"+\" else -1\nreceived = input()\nprob_dict = {0:1}\nfor i in received:\n if i == \"+\":\n prob_dict = {i + 1:k for i,k in prob_dict.items()}\n elif i == \"-\":\n prob_dict = {i - 1: k for i, k in prob_dict.items()}\n else:\n prob_dict_1 = {i - 1: k * 0.5 for i, k in prob_dict.items()}\n prob_dict_2 = {i + 1: k * 0.5 for i, k in prob_dict.items()}\n prob_dict = prob_dict_1\n for key in prob_dict_2:\n if key in prob_dict:\n prob_dict[key] += prob_dict_2[key]\n else:\n prob_dict[key] = prob_dict_2[key]\nprob = prob_dict[final] if final in prob_dict else 0\nprint(prob)\n\n\t \t \t \t \t\t \t\t\t\t \t \t\t\t \t\t", "correto = list(input())\r\nrecebido = list(input())\r\n\r\nres = 0\r\nfor i in correto:\r\n if i == '+': res += 1\r\n else: res -= 1\r\n\r\nopt = [0]\r\nfor j in recebido:\r\n if j == '?':\r\n for i in range(len(opt)):\r\n x = opt[i]\r\n opt[i] += 1\r\n opt.append(x-1)\r\n else:\r\n if j == '+': soma = 1\r\n else: soma = -1\r\n for i in range(len(opt)):\r\n opt[i] += soma\r\n\r\ncont = 0\r\nfor x in opt:\r\n if x == res:\r\n cont += 1\r\n\r\nprint((cont/len(opt)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\ns1 = input()\r\ns2 = input()\r\n\r\ndef recurse(i, pos1, pos2, maxlen):\r\n if i == maxlen:\r\n return 1 if pos1 == pos2 else 0\r\n \r\n pos1 = pos1 + 1 if s1[i] == '+' else pos1-1\r\n if s2[i] == '?':\r\n return recurse(i + 1, pos1, pos2 + 1, maxlen) + recurse(i + 1, pos1, pos2 - 1, maxlen)\r\n else:\r\n dpos = pos2 + 1 if s2[i] == '+' else pos2-1\r\n return recurse(i+1, pos1, dpos, maxlen)\r\ncombo = len([s2[i] for i in range(len(s2)) if s2[i] == '?'])\r\n\r\nprint(recurse(0, 0, 0, len(s1)) / 2**combo)", "a = input()\r\nb = input()\r\nans = 0\r\nq = 0\r\nfor i in range(len(a)):\r\n if a[i] == \"+\":\r\n ans += 1\r\n else:\r\n ans -= 1\r\n if b[i] == \"?\":\r\n q += 1\r\npos = [0]\r\nfor i in range(len(b)):\r\n if b[i] == \"+\":\r\n for j in range(len(pos)):\r\n pos[j] += 1\r\n elif b[i] == \"-\":\r\n for j in range(len(pos)):\r\n pos[j] -= 1\r\n else:\r\n temp = []\r\n for j in range(len(pos)):\r\n temp.append(pos[j] - 1)\r\n pos[j] += 1\r\n pos = pos + temp\r\nright = 0\r\nfor i in range(len(pos)):\r\n if pos[i] == ans:\r\n right += 1\r\nprint(right / len(pos))", "import math\r\n\r\nsended = input()\r\nreceived = input()\r\npos_sended = pos_received = 0\r\nunrecog_recived = 0\r\nfor i in sended:\r\n if i == '+':\r\n pos_sended += 1\r\n else:\r\n pos_sended -= 1\r\nfor i in received:\r\n if i == '+':\r\n pos_received += 1\r\n elif i == '-':\r\n pos_received -= 1\r\n else:\r\n unrecog_recived += 1\r\ntarget = abs(pos_sended - pos_received)\r\nk = (unrecog_recived - target)//2\r\nif target > unrecog_recived:\r\n print(0)\r\nelse:\r\n print(\r\n math.factorial(unrecog_recived) /\r\n (math.factorial(k) * math.factorial(unrecog_recived - k) *\r\n 2**unrecog_recived))\r\n", "from math import comb\n\n\ninstruction = input()\ngiven = input()\ntotal, curr = 0, 0\nunread = 0\nfor c in instruction:\n if c == '+':\n total+=1\n elif c == '-':\n total-=1\n\nfor c in given:\n if c == '+':\n curr += 1\n elif c == '-':\n curr -= 1\n elif c == '?':\n unread += 1\n\ncorrect = 0\nfor i in range(unread+1):\n pos = i\n neg = -(unread - i)\n if pos + neg == total - curr:\n correct = comb(unread, pos)\n break\n\nprint(correct/(2**unread))\n", "def fatorial(n):\n if n == 0:\n return 1\n return fatorial(n - 1) * n\n\n\na = input()\nb = input()\nc = 1.0\n\nif a.count(\"+\") < b.count(\"+\") or a.count(\"-\") < b.count(\"-\"):\n c = 0.0\nelse:\n dpos = a.count(\"+\") - b.count(\"+\")\n dneg = a.count(\"-\") - b.count(\"-\")\n w = fatorial(dneg + dpos) / (fatorial(dneg) * fatorial(dpos))\n c = w / (2 ** b.count(\"?\"))\n\nprint(\"%.12f\" % c)\n\n \t \t \t\t \t \t \t \t \t", "original = input()\r\ninterprete = input()\r\n\r\ntarget = 0\r\n\r\nfor e in original:\r\n #Operadores ternarios\r\n target += (1 if e == '+' else -1)\r\n\r\nn = len(original)\r\nwins, fails = 0, 0 \r\n\r\ndef recursion (index, coordenada):\r\n global wins, fails\r\n \r\n if index == n:\r\n if coordenada == target:\r\n wins += 1\r\n else:\r\n fails += 1\r\n return\r\n \r\n if interprete[index] != \"?\":\r\n recursion(index + 1, coordenada + (1 if interprete[index] == \"+\" else -1))\r\n return\r\n\r\n #Caso: +\r\n recursion(index + 1, coordenada + 1)\r\n #Caso: -\r\n recursion(index + 1, coordenada - 1)\r\n\r\nrecursion(0, 0)\r\nprint(f\"{wins / (wins + fails):.9f}\")", "# import io,os\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\nfrom sys import stdin\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\n# from queue import PriorityQueue as pq\n# from heapq import heappop,heappush\n# from math import gcd,lcm\nfrom collections import defaultdict as mmap\n\n\ntt=1\n# tt=int(input())\nfor _ in range(tt):\n # n=int(input())\n # a,b,c,n=map(int,input().split())\n # d=mmap(int)\n # a=list(map(int,input().split()))\n s1=input()\n s2=input()\n n=len(s1)\n ans=0\n for i in s1:\n if i=='+':ans+=1\n else:ans-=1\n q=s2.count('?')\n #print(\"YES\" if tst else \"NO\")\n def fibo(s,x):\n if x==n:\n ns=0\n for i in s:\n if i=='+':ns+=1\n else:ns-=1\n \n return 1 if ans==ns else 0\n if s2[x]=='?':\n return fibo(s+'-',x+1)+fibo(s+'+',x+1)\n \n else:\n return fibo(s+s2[x],x+1)\n pos=max(1,2**q)\n print(fibo(\"\",0)/pos)\n\n # 0 1 1 2 3\n \n\t\t\t\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t \t", "from sys import stdin\r\n\r\ndef final_pos (lista):\r\n cont = float(0)\r\n for d in lista:\r\n if d == \"+\":\r\n cont = cont + 1\r\n else:\r\n cont = cont - 1\r\n return cont\r\n\r\ndef final_dr(dreamoon):\r\n cant_que = dreamoon.count(\"?\")\r\n possibilities = [dreamoon for f in range(2**cant_que)]\r\n cant_cambio = len(possibilities)\r\n for cont in range(cant_que):\r\n bandera = 0\r\n cambios = 0\r\n cant_cambio = cant_cambio/2\r\n for pos in range(len(possibilities)):\r\n if bandera == 0:\r\n possibilities[pos] = possibilities[pos].replace(\"?\",\"+\",1)\r\n cambios = cambios + 1\r\n else:\r\n possibilities[pos] = possibilities[pos].replace(\"?\",\"-\",1)\r\n cambios = cambios + 1\r\n if cambios == cant_cambio:\r\n cambios = 0\r\n if bandera == 0:\r\n bandera = -1\r\n else:\r\n bandera = 0\r\n return possibilities\r\n\r\ndef get_data(drazil,dreamoon):\r\n final_expected = final_pos (drazil)\r\n dreamon_possible = final_dr(dreamoon)\r\n cant_eq = float(0)\r\n for d in dreamon_possible:\r\n final_pos_dr = final_pos (d)\r\n if final_pos_dr == final_expected:\r\n cant_eq = cant_eq + 1\r\n return cant_eq / float(len(dreamon_possible))\r\n\r\ndef main():\r\n drazil = stdin.readline().strip()\r\n dreamoon = stdin.readline().strip()\r\n result = get_data(drazil,dreamoon)\r\n print(\"{:.12f}\".format(result))\r\n\r\nmain()", "def fact(x):\r\n\tf=1\r\n\tfor i in range(2,x+1):\r\n\t\tf*=i\r\n\treturn f\r\ns1=input()\r\ns2=input()\r\npos,neg=0,0\r\nfor i in range(len(s1)):\r\n\tif s1[i]==\"+\":\r\n\t\tpos+=1\r\n\telse:\r\n\t\tneg+=1\r\n\tif s2[i]==\"+\":\r\n\t\tpos-=1\r\n\telif s2[i]==\"-\":\r\n\t\tneg-=1\r\n\r\nq=pos+neg\r\nif pos<0 or neg<0:\r\n\tprint(\"0\")\r\nelse:\r\n\tprint(fact(q)/(pow(2,q)*fact(pos)*fact(neg)))\r\n", "def Dreamon(idx = 0 , path = ''):\r\n if idx == cnt:\r\n x = s2[::]\r\n idx = sm = 0\r\n for i in range(len(x)):\r\n if x[i] == '?':\r\n x[i] = path[idx]\r\n idx+=1\r\n ans.append(x)\r\n return\r\n\r\n Dreamon(idx+1,path+'+')\r\n Dreamon(idx+1,path+'-')\r\n\r\nif __name__ == '__main__':\r\n s1 , s2 = input(),list(input())\r\n sm1 = 0\r\n for i in s1:\r\n if i == '+':sm1+=1\r\n else:sm1-=1\r\n cnt = 0\r\n for i in s2:\r\n if i == '?':\r\n cnt+=1\r\n ans = []\r\n Dreamon()\r\n pro = 0\r\n for i in ans:\r\n sm2 = 0\r\n for j in i:\r\n if j=='+':sm2+=1\r\n else:sm2-=1\r\n if sm1==sm2:pro+=1\r\n print(f'{pro/len(ans):.12f}')", "def func(mistery, distance):\n if mistery == 0:\n if distance == 0:\n return 1\n else:\n return 0\n else:\n return func(mistery-1, distance+1) + func(mistery-1, distance-1)\n\nstr1 = input().strip()\nstr2 = input().strip()\nif len(str1)>10 or len(str1)!=len(str2):\n raise Exception(\"try it again\")\nx=0\ny=0\nz=0\nfor i in range(len(str1)):\n if str1[i] == '+':\n x += 1\n elif str1[i] == '-':\n x -= 1\n if str2[i] == '+':\n y += 1\n elif str2[i] == '-':\n y -= 1\n elif str2[i] == '?':\n z += 1\n\nprint('{0:.12f}'.format(func(z, x-y)/2**z))\n\t\t\t \t \t \t\t \t \t\t \t\t \t \t\t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- 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 Dreamoon_and_WiFi():\r\n import math\r\n\r\n actualString = insr()\r\n receivedString = insr()\r\n\r\n actual_plus_count = 0\r\n actual_min_count = 0\r\n received_plus_count = 0\r\n received_min_count = 0\r\n received_q_count = 0\r\n\r\n for letter1,letter2 in zip(actualString,receivedString):\r\n if letter1 == '+':\r\n actual_plus_count += 1\r\n else:\r\n actual_min_count += 1\r\n if letter2 == '+':\r\n received_plus_count += 1\r\n elif letter2 == '-':\r\n received_min_count += 1\r\n else:\r\n received_q_count += 1\r\n \r\n remaining_plus_count = actual_plus_count - received_plus_count\r\n remaining_min_count = actual_min_count - received_min_count\r\n\r\n if remaining_plus_count < 0 or remaining_min_count < 0:\r\n print(0)\r\n elif remaining_plus_count == 0 and remaining_min_count == 0:\r\n print(1)\r\n else:\r\n totalPossibilities = 2**received_q_count\r\n favourablePossibilities = math.comb(received_q_count,remaining_plus_count)\r\n print(favourablePossibilities/totalPossibilities)\r\n \r\n return\r\n\r\nDreamoon_and_WiFi()", "import sys\r\ninput=sys.stdin.readline\r\n\r\ndef helper(i,c):\r\n \r\n if i==n:\r\n if c==tar:\r\n count[0]+=1\r\n return \r\n if s2[i]=='+':\r\n helper(i+1,c+1)\r\n elif s2[i]=='-':\r\n helper(i+1,c-1)\r\n else:\r\n helper(i+1,c+1)\r\n helper(i+1,c-1)\r\n \r\n\r\ns1=input().rstrip()\r\ns2=input().rstrip()\r\nn=len(s1)\r\ncount=[0]\r\ntar,total=0,1\r\nfor i in range(n):\r\n if s2[i]=='?':\r\n total*=2\r\n if s1[i]=='+':tar+=1\r\n elif s1[i]=='-':tar-=1\r\nhelper(0,0)\r\nans=count[0]/total\r\nsys.stdout.write(str(ans)+'\\n')", "\r\ndef f(n, h):\r\n if n: return f(n - 1, h + 1) + f(n - 1,h - 1)\r\n elif h == 0: return 1\r\n else: return 0\r\na, b = input(), input()\r\nc = d = e = i = 0\r\nfor i in range(len(a)):\r\n if a[i] == '+': c += 1\r\n if a[i] == '-': c -= 1\r\n if b[i] == '+': d += 1\r\n if b[i] == '-': d -= 1\r\n if b[i] == '?': e += 1\r\nans = f(e, c - d) / (2 ** e)\r\nprint(format(ans, '.12f'))\r\n\n# Sat Aug 20 2022 08:07:30 GMT+0000 (Coordinated Universal Time)\n", "def parse(s):\r\n\tdist,u = 0,0\r\n\tfor k in s:\r\n\t\tif k == \"+\": dist+=1\r\n\t\telif k == \"-\": dist-=1\r\n\t\telse: u+=1\r\n\treturn dist,u\r\ndef fact(n):\r\n\tres = 1\r\n\tfor i in range(n):\r\n\t\tres *= (i+1)\r\n\treturn res\r\nfs = input()\r\nss = input()\r\nfDist,_ = parse(fs)\r\nsDist,u = parse(ss)\r\ndiff = abs(fDist - sDist)\r\nif (u-diff)>= 0 and (u-diff)%2 ==0:\r\n\tvars = (u-diff)//2\r\n\ttopFact = (fact(u)/(fact(vars)*fact(u-vars)))/(2**(u))\r\n\tprint(topFact)\r\nelse:\r\n\tprint(0)", "import heapq\r\nimport string\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, ceil, floor\r\nrandom = randint(1, 10 ** 9)\r\nclass wrapper(int):\r\n def __hash__(self):\r\n return super(wrapper, self).__hash__() ^ random\r\n\r\na=rs()\r\nb=rs()\r\nfinal=0\r\nfor i in a:\r\n if i==\"+\":\r\n final+=1\r\n else:\r\n final-=1\r\ncntq=b.count(\"?\")\r\nres=0\r\nfor i in b:\r\n if i==\"+\":\r\n res+=1\r\n elif i==\"-\":\r\n res-=1\r\nd=abs(res-final)\r\nmask=0\r\nans=0\r\nwhile mask<(1<<cntq):\r\n r=0\r\n for i in range(cntq):\r\n if mask&(1<<i):\r\n r+=1\r\n else:\r\n r-=1\r\n if r==d:\r\n ans+=1\r\n mask+=1\r\nprint(ans/pow(2,cntq))\r\n", "from collections import Counter\n\n# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline().strip()\n\ndef create_perms(n):\n res = []\n \n def inner(subset):\n if len(subset) == n:\n res.append(subset[:])\n return\n \n for symbol in ['+', '-']:\n subset.append(symbol)\n inner(subset)\n subset.pop()\n \n inner([])\n return res\n\n\ns1 = list(input())\n\ncounts1 = Counter(s1)\n\ntarget = counts1['+'] - counts1['-']\n\ns2 = list(input())\n\ncounts2 = Counter(s2)\n\ntotal = counts2['+'] - counts2['-']\n\nif '?' not in counts2:\n\tif total == target:\n\t\tprint(1.0)\n\telse:\n\t\tprint(0.0)\n\nelse:\n\td = target - total\n\tn = counts2['?']\n\tperms = create_perms(n)\n\n\tsuccess = 0\n\tfor perm in perms:\n\t\tcounts = Counter(perm)\n\t\tt = counts['+'] - counts['-']\n\t\tif t == d:\n\t\t\tsuccess += 1\n\n\tprint(success / len(perms))\n\n\n\n\n\n\n", "def make_combinations(n):\r\n initial_list = [\"+\",\"-\"]\r\n new_list = []\r\n if(n == 1):\r\n return [\"+\", \"-\"]\r\n for i in range(n-1):\r\n for j in initial_list:\r\n for x in [\"+\",\"-\"]:\r\n new_list.append(x + j)\r\n initial_list = new_list\r\n new_list = []\r\n return initial_list\r\n\r\ndrazil = input()\r\ndreamoon = input()\r\n\r\ndrazil_movement = 0 \r\ndreamoon_movement = 0 \r\n\r\nfor x in drazil:\r\n if (x == \"+\"):\r\n drazil_movement+=1\r\n if (x == \"-\"):\r\n drazil_movement-=1\r\n \r\nfor x in dreamoon:\r\n if (x == \"+\"):\r\n dreamoon_movement+=1\r\n if (x == \"-\"):\r\n dreamoon_movement-=1\r\n \r\nif (\"?\" not in dreamoon):\r\n if (dreamoon_movement == drazil_movement):\r\n print(1)\r\n else:\r\n print(0)\r\n exit()\r\n \r\nn = dreamoon.count(\"?\")\r\n\r\ntotal_probabilities = 2**n\r\n\r\nprobabilities_list = make_combinations(n)\r\n\r\ndef count_movements(movement_string):\r\n return movement_string.count(\"+\") - movement_string.count(\"-\")\r\n \r\n\r\nfor i in range(len(probabilities_list)):\r\n probabilities_list[i] = count_movements(probabilities_list[i])\r\n \r\n# print(probabilities_list)\r\n\r\ncorrect_movements = 0 \r\n\r\n# print(drazil_movement)\r\n# print(dreamoon_movement)\r\n# print(probabilities_list)\r\nfor i in probabilities_list:\r\n # print(i)\r\n # print(dreamoon_movement)\r\n if (dreamoon_movement+i == drazil_movement):\r\n correct_movements+=1\r\n # print(correct_movements)\r\n \r\nprint(correct_movements/len(probabilities_list))", "s1 = input()\r\nres = cnt = 0\r\n\r\nfor i in range(len(s1)):\r\n if s1[i] == '+':\r\n res += 1\r\n else:\r\n res -= 1\r\n\r\ndef recursion(i, sum):\r\n global cnt\r\n if i == len(s2):\r\n if sum == res:\r\n cnt += 1\r\n return\r\n if s2[i] == '+':\r\n recursion(i + 1, sum + 1)\r\n elif s2[i] == '-':\r\n recursion(i + 1, sum - 1)\r\n else:\r\n for j in range(2):\r\n if j == 0:\r\n recursion(i + 1, sum + 1)\r\n else:\r\n recursion(i + 1, sum - 1)\r\n\r\ns2 = input()\r\n\r\nR = 1\r\nfor i in range(len(s2)):\r\n if s2[i] == '?':\r\n R *= 2\r\n\r\nrecursion(0, 0)\r\nans = round(cnt / R, 9)\r\nprint(f'{ans:.9f}')\r\n", "def solveExp(index,str_):\r\n if(index>=len(str_)):\r\n return 0\r\n \r\n if(str_[index]=='+'):\r\n return 1 + solveExp(index+1,str_)\r\n else:\r\n return -1+ solveExp(index+1,str_)\r\n\r\ndef solveMain(index,str_,target,ans,res,leng):\r\n if(index>=len(str_)):\r\n leng.append(True)\r\n if(ans==target):\r\n res.append(True)\r\n \r\n return 0\r\n if(str_[index]=='+'):\r\n solveMain(index+1,str_,target,ans+1,res,leng)\r\n elif(str_[index]=='-'):\r\n solveMain(index+1,str_,target,ans-1,res,leng)\r\n else:\r\n solveMain(index+1,str_,target,ans+1,res,leng)\r\n solveMain(index+1,str_,target,ans-1,res,leng)\r\n \r\ns1=str(input())\r\ns2=str(input())\r\n\r\nk1 = solveExp(0,s1)\r\nk2 = []\r\nleng=[]\r\nsolveMain(0,s2,k1,0,k2,leng)\r\n\r\nif('?' in s2):\r\n \r\n op=format(len(k2)/len(leng), '.12f')\r\n print(op)\r\nelse:\r\n print(len(k2))", "from collections import Counter\n\ns1 = input()\ns2 = input()\n\ncnt1 = Counter(s1)\ncnt2 = Counter(s2)\n\ncoord = cnt1['+'] - cnt1['-']\nans = 0\n\n\ndef build(ls: list, last_i=-1):\n global ans\n cnt = Counter(ls)\n if '?' not in cnt:\n if cnt['+'] - cnt['-'] == coord:\n ans += 1\n return\n\n for i in range(len(ls)):\n if ls[i] == '?' and i > last_i:\n new_string = list(ls)\n new_string[i] = '+'\n build(new_string, i)\n new_string[i] = '-'\n build(new_string, i)\n\n\nbuild(s2)\nprint(ans / (2 ** cnt2['?']))\n", "def calculate_probability(a, b):\n t, d, w = 0, 0, 0\n\n for i in range(len(a)):\n d += b[i] == '?'\n t += 1 if a[i] == '+' else -1\n if b[i] in ['+', '-']:\n t = t - 1 if b[i] == '+' else t + 1\n\n for i in range(1 << d):\n c = t\n k = i\n for j in range(1, d + 1):\n c += 1 if k & 1 else -1\n k //= 2\n w += 1 if c == 0 else 0\n\n d = 1 << d\n return w / d\n\n\na = input()\nb = input()\nprint(f\"{calculate_probability(a, b):.20f}\")\n \t \t\t\t\t \t \t \t \t \t\t \t \t", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\n# input = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\na = [1 if i == '+' else -1 for i in list(input().strip())]\r\n# print(a)\r\ns = sum(a)\r\nb = [1 if i == '+' else 0 if i == '?' else -1 for i in list(input().strip())]\r\n# print(b)\r\nlst = [b]\r\nl = 1\r\nn = b.count(0)\r\nans = 0\r\nwhile n:\r\n for i in lst.copy():\r\n temp = i\r\n for idx, j in enumerate(temp):\r\n if not j:\r\n temp[idx] = 1\r\n lst.append(temp.copy())\r\n temp[idx] = -1\r\n lst.append(temp.copy())\r\n break\r\n lst = lst[l:]\r\n l *= 2\r\n n -= 1\r\nfor i in lst:\r\n if sum(i) == s:\r\n ans += 1\r\n# print(lst)\r\nprint(ans / l)\r\n", "def f(l, k, n):\r\n if n:\r\n return f(l, k - 1, n - 1) + f(l, k + 1, n - 1)\r\n if l == k:\r\n return 1\r\n return 0\r\n\r\nn = 0\r\nfor i in input():\r\n if i == '+':\r\n n += 1\r\n else:\r\n n -= 1\r\nq = 0\r\nm = 0\r\nfor i in input():\r\n if i == '?':\r\n q += 1\r\n elif i == '+':\r\n m += 1\r\n else:\r\n m -= 1\r\n\r\nprint(f(n, m, q) / 2 ** q)\r\n", "def fact(n):\r\n if n == 0 or n == 1:\r\n return 1\r\n else:\r\n return n*fact(n-1)\r\n\r\nexp1 = input()\r\nexp2 = input()\r\n\r\nacumMais = 0\r\nacumMenos = 0\r\ninte = 0\r\n\r\nfor i in range(len(exp1)):\r\n if exp1[i] == '+':\r\n acumMais += 1\r\n else:\r\n acumMais -= 1\r\n\r\nfor i in range(len(exp2)):\r\n if exp2[i] == '+':\r\n acumMenos+=1\r\n elif exp2[i] == '-':\r\n acumMenos-=1\r\n else:\r\n inte+=1\r\n\r\nif not inte:\r\n if acumMenos == acumMais:\r\n print(\"1.000000000000\")\r\n else:\r\n print(\"0.000000000000\")\r\nelse:\r\n\r\n i = inte+(acumMais-acumMenos)\r\n if(i%2 == 0 and i/2>=0 and i/2<=inte):\r\n result = fact(inte)/(fact(inte-i/2)*fact(i/2))\r\n v = float(result)/float(2**inte)\r\n print('{:.12f}'.format(v))\r\n else:\r\n print(\"0.000000000000\")\r\n\r\n", "import math\r\n\r\ncommands1 = input()\r\ncommands2 = input()\r\na = 0\r\nb = {}\r\ndrazil = 0\r\ndreamoon = 0\r\nc = 0\r\n\r\nfor i in range(len(commands1)):\r\n if commands1[i] == \"+\":\r\n drazil += 1\r\n else:\r\n drazil -= 1\r\n if commands2[i] == \"+\":\r\n dreamoon += 1\r\n elif commands2[i] == \"-\":\r\n dreamoon -= 1\r\n else:\r\n a += 1\r\n\r\nfor i in range(a + 1):\r\n dreamoondown = dreamoon + (i - (a - i))\r\n b[dreamoondown] = b.get(dreamoondown, 0) + math.comb(a, i)\r\n c += math.comb(a, i)\r\n\r\nprint(b.get(drazil, 0)/c)\r\n\r\n", "from collections import Counter\r\nfrom math import factorial\r\n\r\no = list(input())\r\na = list(input())\r\n\r\noc = Counter(o)\r\nac = Counter(a)\r\n\r\noc[\"+\"] -= ac[\"+\"]\r\noc[\"-\"] -= ac[\"-\"]\r\nif oc[\"+\"] == 0 and oc[\"-\"] == 0:\r\n print(1)\r\n quit()\r\nelif oc[\"+\"] < 0 or oc[\"-\"] < 0: \r\n print(0)\r\n quit()\r\n\r\nc = 0.5 ** ac[\"?\"]\r\np = factorial(ac[\"?\"]) / factorial(ac[\"?\"]-oc[\"+\"]) / factorial(oc[\"+\"])\r\nprint(c*p)", "s1 = input()\r\ns2 = input()\r\n\r\nnow = 0\r\nfor i in s1:\r\n if i == '+':\r\n now += 1\r\n else:\r\n now -= 1\r\n\r\nlst = [0]\r\nfor i in s2:\r\n if i == '+':\r\n lst = [j + 1 for j in lst]\r\n elif i == '-':\r\n lst = [j - 1 for j in lst]\r\n else:\r\n lst = [j + 1 for j in lst]\r\n ln = len(lst)\r\n for j in range(ln):\r\n lst.append(lst[j] - 2)\r\n\r\ncnt = 0\r\nfor i in lst:\r\n if i == now:\r\n cnt += 1\r\n \r\nprint(cnt / len(lst))\r\n", "s1 = input()\r\ns2 = input()\r\nc1 = 0\r\nc2 = 0\r\n\r\nqc = 0\r\nroto = 0\r\n\r\nfor i in s1:\r\n if i == '+': c1+=1\r\n else: c1-=1\r\nfor j in s2:\r\n if j == '+' : c2+=1\r\n elif j == '-' : c2-=1\r\n else: qc+=1\r\n#print(qc)\r\nfor i in range(0, pow(2,qc)):\r\n temp = bin(i).count('1')\r\n new = 2*temp - qc + c2\r\n if new == c1:\r\n roto+=1\r\n #print(bin(i), new, c1)\r\nprint( '%.12f' % (roto/(pow(2,qc))))", "import math\n\ncorrectpath = input()\ncorrectvalue = correctpath.count('+') - correctpath.count('-')\ngivenpath = input()\nvaluesofar = givenpath.count('+') - givenpath.count('-')\nunknown = givenpath.count('?')\ndiff = correctvalue - valuesofar\nif diff == 0 and unknown ==0:\n print(float(1))\nelif (diff+unknown)%2==0 and unknown >= abs(diff):\n n1 = math.ceil(unknown/2) - math.ceil(diff/2)\n n2 = unknown - n1\n possibilities = math.factorial(unknown)/(math.factorial(n1)*math.factorial(n2))\n print(float(possibilities/2**unknown))\nelse:\n print(float(0))\n", "s1=input()\ns2=input()\nn=len(s1)\naps=0\nfor i in range(n):\n aps+=(s1[i]=='+')\n aps-=(s1[i]=='-')\nfps=0\nv=0\nfor i in s2:\n if(i=='?'):\n v+=1\n else:\n fps += (i=='+')\n fps -=(i=='-')\nd = aps-fps\nif((d+v)%2!=0 or v<abs(d)):\n ans = 0 \nelse:\n m = (v+abs(d))//2 \n c = 1 \n for i in range(m):\n c *= v-i \n for i in range(2,m+1):\n c /= i ;\n ans = c/(2**v) ;\nprint(\"{:.11f}\".format(ans))\n\n# Sat Apr 16 2022 17:32:45 GMT+0000 (Coordinated Universal Time)\n", "def convert_to_int(command):\n return 1 if command == '+' else -1\n\ndef is_sum_equal(s1, s2):\n sum_s1 = sum(convert_to_int(command) for command in s1)\n sum_s2 = sum(convert_to_int(command) for command in s2)\n\n return 1 if sum_s1 == sum_s2 else 0\n\ndef somas(s1, s2):\n sum_s1 = sum(convert_to_int(command) for command in s1)\n sum_s2 = sum(convert_to_int(command) for command in s2)\n return sum_s1, sum_s2\n\ndef count_inter(input_string):\n return input_string.count('?')\n\ndef find_all_sums(X):\n def generate_sums(current_sum, remaining):\n if remaining == 0:\n all_sums.append(current_sum)\n else:\n generate_sums(current_sum + 1, remaining - 1)\n generate_sums(current_sum - 1, remaining - 1)\n\n all_sums = []\n generate_sums(0, X)\n return all_sums\n\ndef count_occurrences_of_X(arr, X):\n return arr.count(X)\n\ndef prob(s1, s2):\n n = count_inter(s2)\n if not n:\n return is_sum_equal(s1, s2)\n else:\n s2 = s2.replace(\"?\", \"\")\n sum_s1, sum_s2 = somas(s1,s2)\n if sum_s1 - sum_s2 > n:\n return 0\n else:\n array_sums = find_all_sums(n)\n ideal_number = sum_s1 - sum_s2\n app = count_occurrences_of_X(array_sums, ideal_number)\n return app / len(array_sums)\n \n\n\n# Test the function\ns1 = input().strip() # Original list of commands from Drazil\ns2 = input().strip() # List of commands received by Dreamoon\nresult = prob(s1, s2)\nprint(f\"{result:.12f}\")\n\n \t\t \t \t\t\t\t \t \t \t\t \t \t", "class Fatorial:\n def __init__(self, n) -> None:\n self.base = [0 for _ in range(n + 1)] \n\n\n def fat(self, n):\n if n <= 1:\n self.base[n] = 1\n return 1\n \n if self.base[n] > 0:\n return self.base[n]\n \n r = n * self.fat(n - 1)\n\n self.base[n] = r\n\n return r\n\ndef get_info(entry):\n sum = 0 #soma\n sub = 0 #subtracao\n itr = 0 #interrogacao\n\n for c in entry:\n if c == \"+\":\n sum += 1\n elif c == \"-\":\n sub += 1\n else:\n itr += 1\n\n return sum, sub, itr\n\ndef comb(n, k):\n f = Fatorial(n)\n\n return f.fat(n) / (f.fat(k) * f.fat(n - k))\n\ndef main():\n in1 = input()\n in2 = input()\n\n sum_base, sub_base, _ = get_info(in1)\n sum_receive, sub_receive, not_receive = get_info(in2)\n\n ans = 0\n\n rest = sub_base - sub_receive\n\n if not (rest < 0 or rest > not_receive):\n ans = comb(not_receive, rest) * (0.5 ** not_receive)\n \n print(\"{:.10f}\".format(ans))\n \nmain()\n \t\t \t \t \t\t\t\t\t \t\t \t\t \t \t", "# Wadea #\r\n\r\nimport math as mm\r\ns1 = list(input())\r\ns2 = list(input())\r\ndraz = 0\r\ndree = 0\r\nques = 0\r\nfor i in s1:\r\n if i == \"+\":draz += 1\r\n else:draz -= 1\r\nfor i in s2:\r\n if i == \"+\":dree += 1\r\n elif i == \"-\":dree -= 1\r\n else:ques += 1\r\nif draz == dree and ques == 0:\r\n print(1)\r\nelif draz != dree and ques == 0:\r\n print(0)\r\nelse:\r\n l = ques+(draz-dree)\r\n if (l % 2 == 0) and (l/2 >= 0) and (l/2 <= ques):\r\n m = l//2\r\n ans = mm.factorial(ques) / (mm.factorial(ques-m)*mm.factorial(m))\r\n print(ans/2**ques)\r\n else:\r\n print(0)", "# https://codeforces.com/problemset/problem/476/B\r\n\r\ndef solve(received, final):\r\n rst = {0: 1.0}\r\n for signal in received:\r\n if signal == '+':\r\n rst = {k+1: v for k, v in rst.items()}\r\n elif signal == '-':\r\n rst = {k-1: v for k, v in rst.items()}\r\n else:\r\n tmp = rst.copy()\r\n rst = {}\r\n for k, v in tmp.items():\r\n rst[k+1] = rst.setdefault(k+1, 0.0) + v * 0.5\r\n rst[k-1] = rst.setdefault(k-1, 0.0) + v * 0.5\r\n return rst.get(final, 0.0)\r\n\r\ntruth = input()\r\nfinal = truth.count('+') - truth.count('-')\r\nreceived = input()\r\nprint(solve(received, final))", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\ns1 = input().strip()\r\ns2 = list(input().strip())\r\n\r\nt = sum(1 if x == '+' else -1 for x in s1)\r\nn, m = 0, 0\r\n\r\ndef f(i):\r\n global n, m\r\n if i == len(s2):\r\n m += 1\r\n if sum(1 if x == '+' else -1 for x in s2) == t:\r\n n += 1\r\n return\r\n if s2[i] == '?':\r\n for c in ('+', '-'):\r\n s2[i] = c\r\n f(i+1)\r\n s2[i] = '?'\r\n else:\r\n f(i+1)\r\n\r\nf(0)\r\nprint(n / m)", "def find_position(commands):\n position = 0\n for i in range(0, len(commands)):\n if commands[i] == '+':\n position = position + 1\n else:\n position = position - 1\n\n return position\n\n\ndef find_all_possibilities(commands):\n unrecognizable_commands = 0\n for i in range(0, len(commands)):\n if commands[i] == '?':\n unrecognizable_commands = unrecognizable_commands + 1\n\n if unrecognizable_commands == 0:\n return [commands]\n\n total = 2**unrecognizable_commands\n\n result = [commands]\n while len(result) != total:\n new = []\n for j in range(0, len(result)):\n for k in range(0, len(result[j])):\n if result[j][k] == '?':\n new.append(result[j].replace('?', '+', 1))\n new.append(result[j].replace('?', '-', 1))\n break\n\n if j == len(result) - 1:\n result = new\n break\n\n return result\n\n\ndef calculate_probability(position, positions):\n count = 0\n for p in positions:\n if p == position:\n count = count + 1\n\n return count / len(positions)\n\n\nif __name__ == \"__main__\":\n first_commands = input()\n second_commands = input()\n first_position = find_position(first_commands)\n possibilities_commands = find_all_possibilities(second_commands)\n possibilities_positions = []\n for possibility in possibilities_commands:\n possibilities_positions.append(find_position(possibility))\n probability = calculate_probability(first_position, possibilities_positions)\n print(\"{:.12}\".format(probability))\n \t\t\t\t\t \t\t \t\t\t \t \t\t \t\t \t", "a=[{\"-\":-1,\"+\":1}[e] for e in input()]\r\nb=[{\"-\":-1,\"+\":1,\"?\":0}[e] for e in input()]\r\nA=sum(a)\r\nB=sum(b)\r\nd=A-B\r\nc=b.count(0)\r\nans=0\r\ndef f(x,i):\r\n if i==c:\r\n global ans\r\n ans+=x==d\r\n else:\r\n f(x-1,i+1)\r\n f(x+1,i+1)\r\nf(0,0)\r\nprint(ans/(2**c))", "# https://codeforces.com/problemset/problem/476/B\n\nfrom collections import Counter\nfrom itertools import permutations\n\ndef helper() -> float:\n\n original = Counter(input())\n received = Counter(input())\n\n if original == received:\n return 1.0\n\n if \"?\" not in received:\n return 0.0\n\n plus_diff = original[\"+\"] - received[\"+\"]\n minus_diff = original[\"-\"] - received[\"-\"]\n\n if abs(plus_diff) + abs(minus_diff) != received[\"?\"]:\n return 0.0\n\n total_diff = abs(plus_diff) + abs(minus_diff)\n\n if abs(plus_diff) == 0 or abs(minus_diff) == 0:\n return 1 / (2 ** total_diff)\n\n return len(set(permutations(f\"{abs(plus_diff) * '+'}{abs(minus_diff) * '-'}\"))) / (2 ** total_diff)\n\nprint(helper())", "from math import comb \r\na,b=input(),input()\r\nn=b.count('?');r=a.count('-')-b.count('-')\r\nprint(0 if n<r or r<0 else comb(n,r)/(2**n))", "firstComand = input()\nsecondComand = input()\n\nfirstComandResult = 0\nfor signal in firstComand:\n if signal == \"+\":\n firstComandResult += 1\n else:\n firstComandResult -= 1\nsecondComandResults = [0]\nfor signal in secondComand:\n if signal == \"+\":\n secondComandResults = [x+1 for x in secondComandResults]\n elif signal == \"-\":\n secondComandResults = [x-1 for x in secondComandResults]\n else:\n secondComandResults = secondComandResults + secondComandResults\n for i, value in enumerate(secondComandResults):\n if i < (len(secondComandResults)/2):\n secondComandResults[i] = value + 1\n else:\n secondComandResults[i] = value - 1\n\nqtdMatch = 0.0\nfor i in secondComandResults:\n if i == firstComandResult:\n qtdMatch += 1\n \nprint(float(float(qtdMatch)/float(len(secondComandResults))))\n \t \t \t\t \t\t \t\t \t\t\t \t", "msg = str(input())\r\nrcb = str(input())\r\n\r\np1 = 0\r\np2 = 0\r\n\r\ntam1 = len(msg)\r\ntam2 = len(rcb)\r\n\r\ncontador = 0\r\nprobabilidade = 1\r\n\r\nfor i in range (0, tam1):\r\n if(msg[i] == '+'): p1 = p1+1\r\n if(msg[i] == '-'): p1 = p1-1\r\n\r\nfor j in range (0, tam2):\r\n if(rcb[j] == '+'): p2 = p2+1\r\n elif(rcb[j] == '-'): p2 = p2-1\r\n elif(rcb[j] == '?'): \r\n contador = contador+1\r\n\r\ntotalPossib = 2**contador\r\ndif = abs(p1-p2)\r\n\r\nif(contador>0):\r\n if (contador<dif):\r\n print(0.0)\r\n else:\r\n possib = int((contador+p1-p2)/2)\r\n const = contador-possib\r\n if(possib != 0):\r\n for k in range(contador, const, (-1)):\r\n probabilidade=probabilidade*k\r\n for l in range(possib, 0, (-1)):\r\n probabilidade=probabilidade/l\r\n \r\n probabilidade = probabilidade/(totalPossib)\r\n\r\n print(probabilidade)\r\n \r\nelse:\r\n if (p1 == p2): print(1.0)\r\n else: print(0.0)", "# Leitura da entrada\r\ns1 = input()\r\ns2 = input()\r\n# Posicao final correta\r\nf1 = 0\r\nfor c in s1:\r\n if c == '-':\r\n f1 -= 1\r\n elif c == '+':\r\n f1 += 1\r\n# Posicao final de s2, sem contar os '?', mais a quantidade dos mesmos \r\nf2 = 0\r\nqi = 0\r\nfor c in s2:\r\n if c == '-':\r\n f2 -= 1\r\n elif c == '+':\r\n f2 += 1\r\n else:\r\n qi += 1\r\n\r\nM = {}\r\nM[(0,0)] = 1\r\n# Funcao para calcular a quantidade de combinacoes corretas\r\n# Quantidade de possibilidades corretas\r\nqc = [0]\r\ndef resultado(f1,f2,qi,qc):\r\n if qi == 0:\r\n if f2 == f1:\r\n qc[0]+=1\r\n return\r\n resultado(f1,f2 + 1,qi - 1,qc) \r\n resultado(f1,f2 - 1,qi - 1,qc) \r\n\r\n# resultado\r\nresultado(f1,f2,qi,qc)\r\nr = (1/pow(2,qi))*qc[0]\r\nprint(\"%.12f\" % r)", "def fact(num):\r\n if(num <= 2):\r\n return num\r\n return num * fact(num-1)\r\ni = input()\r\no = input()\r\ns1 = 0\r\ns2 = 0\r\nnum = 0\r\nexist = False\r\nfor j in i:\r\n if j == '+':\r\n s1 += 1\r\n else:\r\n s1 -= 1\r\nfor k in o:\r\n if k == '+':\r\n s2 += 1\r\n elif k == '-':\r\n s2 -= 1\r\n else:\r\n num += 1\r\n if num == 1:\r\n exist = True\r\nif exist == False:\r\n if s1 == s2:\r\n print(\"{0:.12f}\".format(1))\r\n else:\r\n print(\"{0:.12f}\".format(0))\r\nelse:\r\n diff = s1 - s2\r\n if diff > num or 0 - diff > num:\r\n print(\"{0:.12f}\".format(0))\r\n elif (diff % 2 == 0 and num % 2 != 0) or (diff % 2 != 0 and num % 2 == 0):\r\n print(\"{0:.12f}\".format(0))\r\n else:\r\n if diff == num or 0 - diff == num:\r\n print(\"{0:.12f}\".format(1/pow(2,num)))\r\n else:\r\n select = (diff + num) / 2\r\n print(\"{0:.12f}\".format((fact(num) / (fact(num - select) * fact(select)))/pow(2,num)))", "def compute_final_position(command_list):\r\n position = 0\r\n for command in command_list:\r\n if command == \"+\":\r\n position += 1\r\n elif command == \"-\":\r\n position -= 1\r\n else:\r\n raise Exception(\"Invalid command\")\r\n return position\r\n\r\ndef compute_middle_position(command_list):\r\n valid_commands = filter(lambda x: x != \"?\", command_list)\r\n return compute_final_position(valid_commands)\r\n\r\ndef dfs_binary_tree(uncertainty_counter, position, probability, probability_map):\r\n if uncertainty_counter == 0:\r\n probability_map[position] = probability_map.get(position, 0) + probability\r\n else:\r\n dfs_binary_tree(uncertainty_counter - 1, position + 1, probability / 2, probability_map)\r\n dfs_binary_tree(uncertainty_counter - 1, position - 1, probability / 2, probability_map)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n commands_sent = input()\r\n expected_position = compute_final_position(commands_sent)\r\n commands_received = input()\r\n middle_expected_position = compute_middle_position(commands_received)\r\n probability_map = {}\r\n dfs_binary_tree(commands_received.count(\"?\"), middle_expected_position, 1, probability_map)\r\n print(\"{:.12f}\".format(probability_map.get(expected_position, 0)))\r\n\r\n", "import operator as op\r\nfrom functools import reduce\r\n\r\ndef ncr(n, r):\r\n r = min(r, n-r)\r\n numer = reduce(op.mul, range(n, n-r, -1), 1)\r\n denom = reduce(op.mul, range(1, r+1), 1)\r\n return numer // denom # or / in Python 2\r\n\r\ndef cq(lst):\r\n return lst.count('?')\r\ndef cp(lst):\r\n return lst.count('+')\r\ndef cm(lst):\r\n return lst.count('-')\r\n \r\nm = input()\r\nn = input()\r\n\r\n\r\n\r\nreal = (cp(m) - cm(m))\r\nrecieved = (cp(n) - cm(n))\r\n\r\nneeded = real - recieved\r\nquestioned = cq(n)\r\n\r\n\r\n\r\n\r\n#list for the results that could occour from question marks\r\nl = list(range(-questioned, questioned+2, 2))\r\nlt= len(l)\r\n\r\n#number of timed that number could occurs\r\ng = []\r\nfor i in range(lt):\r\n g.append(ncr(lt-1,i))\r\n#finding if i have the needed number or not\r\nif needed in l:\r\n \r\n ind = l.index(needed)\r\n #finding the probability\r\n print(g[ind]/sum(g))\r\nelse:\r\n print(0.000000000000)\r\n", "from math import comb\r\ns1 = input()\r\ns2 = input()\r\n\r\na1 = s1.count(\"+\")\r\na2 = s2.count(\"+\")\r\nb1 = s1.count(\"-\")\r\nb2 = s2.count(\"-\")\r\nc = s2.count(\"?\")\r\nif a1-b1>a2-b2+c:\r\n print(float(0))\r\nelse:\r\n d = b1-b2\r\n print(comb(c,d)/(2**c))", "\r\ndef f(n):\r\n dp = [0 for i in range(n+1)]\r\n dp[0] = 1\r\n for i in range(1,n+1):\r\n dp[i] = i*dp[i-1]\r\n \r\n return dp[n]\r\n\r\n\r\ndef solve(s1,s2):\r\n\r\n correct = 0\r\n for i in range(len(s1)):\r\n if s1[i] == '+':\r\n correct+=1\r\n else:\r\n correct-=1\r\n \r\n d = [0,0,0]\r\n\r\n for i in range(len(s2)):\r\n if s2[i] == '+':\r\n d[0]+=1\r\n elif s2[i] == '-':\r\n d[1]+=1\r\n else:\r\n d[2]+=1\r\n \r\n diff = abs(correct - (d[0]-d[1]))\r\n\r\n if diff>d[2]:\r\n return 0\r\n \r\n if (d[2]-diff)%2 != 0:\r\n return 0\r\n \r\n eq = (d[2]-diff)//2\r\n #print(f(d[2]))\r\n return pow(0.5,d[2])*(f(d[2])/(f(eq)*f(d[2]-eq)))\r\n\r\n\r\n\r\n\r\n#t = int(input())\r\nt = 1\r\nfor i in range(t):\r\n s1 = input()\r\n s2 = input()\r\n '''\r\n n = int(input())\r\n \r\n arr1 = input().split(\" \")\r\n arr1 = [int(a) for a in arr1]\r\n \r\n q = int(input())\r\n \r\n arr2 = []\r\n for j in range(q):\r\n arr2.append(int(input()))\r\n '''\r\n ans = solve(s1,s2)\r\n print(ans)", "from math import comb\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\ns1_plus = s1.count('+')\r\ns1_minus = s1.count('-')\r\n\r\ns2_plus = s2.count('+')\r\ns2_minus = s2.count('-')\r\ns2_marks = s2.count('?')\r\n\r\nif s2_plus > s1_plus or s2_minus > s1_minus:\r\n print(0)\r\nelif s2_marks == 0:\r\n print(1)\r\nelse:\r\n a = s1_plus - s2_plus\r\n print(comb(s2_marks, a) / (2 ** s2_marks))\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n heads - tails = dist\r\n heads + tails = cb['?']\r\n heads = dist + tails\r\n\r\n dist + 2 * tails = cb['?']\r\n 2 * tails = (cb['?'] - dist)\r\n tails = (cb['?'] - dist) // 2\r\n'''\r\ndef nCr(n, r):\r\n mx = max(n-r, r)\r\n mn = min(n-r, r)\r\n ans = 1\r\n while n > mx:\r\n ans *= n\r\n n -= 1\r\n div = 1\r\n while mn > 0:\r\n div *= mn\r\n mn -= 1\r\n return ans / div\r\n\r\ndef solve():\r\n a = I().strip()\r\n b = I().strip()\r\n \r\n ca = Counter(a)\r\n cb = Counter(b)\r\n\r\n if ca == cb:\r\n print(1)\r\n return\r\n if '?' not in cb and ca != cb:\r\n print(0)\r\n return\r\n \r\n sa = ca['+'] - ca['-']\r\n sb = cb['+'] - cb['-']\r\n\r\n dist = abs(sa-sb)\r\n if dist > cb['?']:\r\n print(0)\r\n return\r\n else: \r\n x = cb['?'] - dist\r\n if x&1:\r\n print(0)\r\n else:\r\n print(nCr(cb['?'], x//2) / (2 ** cb['?']))\r\nsolve()", "import math\n\ndirection = input()\nd2 = input()\nj = 0\nfor i in direction:\n if i == \"+\":\n j = j + 1\n else:\n j = j - 1\n \nmatches = 0.0\n\nlista = []\nk = 0\nlista.append(k)\nfor i in d2:\n if i == \"+\":\n for l in range(0, len(lista)):\n lista[l] = lista[l] + 1\n elif i == \"-\":\n for l in range(0,len(lista)):\n lista[l] = lista[l] - 1\n else:\n k = len(lista)\n for l in range(0, k):\n m = lista[l]\n lista[l] = lista[l] + 1\n lista.append(m - 1)\nfor l in lista:\n if l == j:\n matches = matches + 1\nprint(matches / len(lista))\n\n\n\n\n \t \t\t \t \t \t \t\t\t\t \t \t\t \t", "import math\n\ndef main():\n\n caminhoCorreto = list(input())\n caminhoSeguido = list(input())\n\n passosCaminhoCorreto = {\n '+': 0,\n '-': 0,\n '?': 0,\n }\n\n for i in range(len(caminhoCorreto)):\n passoCorreto = caminhoCorreto[i]\n passoSeguido = caminhoSeguido[i]\n\n passosCaminhoCorreto[passoCorreto] += 1\n\n if(passoSeguido != '?'):\n passosCaminhoCorreto[passoSeguido] -= 1\n else:\n passosCaminhoCorreto[passoSeguido] += 1\n\n if(passosCaminhoCorreto['+'] < 0 or passosCaminhoCorreto['-'] < 0):\n print(0.0)\n return\n \n if(passosCaminhoCorreto['+'] == 0 and passosCaminhoCorreto['-'] == 0):\n print(1.0)\n return\n \n x = passosCaminhoCorreto['+']\n y = passosCaminhoCorreto['-']\n z = passosCaminhoCorreto['?']\n totalPossibilidades = 2**z\n\n totalCaracteres = x + y\n numeroPermutacoes = math.factorial(totalCaracteres) / (math.factorial(x) * math.factorial(y))\n\n print(numeroPermutacoes/totalPossibilidades)\n \n\nmain()\n\t\t \t\t \t \t\t \t\t \t\t\t \t \t\t\t\t\t", "original = input() \r\ninterpreto = input()\r\n\r\ntarget = 0\r\n\r\n#passo 1: Hallar la coordenada final a la que debo llegar con el interpreto\r\nfor instruction in original:\r\n target += (1 if instruction == \"+\" else -1)\r\n\r\n\r\n#paso 2: Hallar el total de escenarios en el mensaje que interpreto\r\n#contar cuantos llegan al target\r\n#n = len(original)\r\nwins, fails = 0,0\r\n\r\ndef recursion(index, coordenada):\r\n global wins\r\n global fails\r\n\r\n if index == len(original):\r\n if coordenada == target: wins += 1\r\n else: fails += 1\r\n return \r\n if interpreto[index] != \"?\":\r\n recursion(index + 1,coordenada + (1 if interpreto[index] == \"+\" else -1))\r\n return\r\n recursion(index + 1,coordenada + 1)\r\n recursion(index + 1,coordenada - 1)\r\n \r\nrecursion(0,0)\r\nprint(f\"{wins / (wins+fails):.9f}\")", "# Exercicio F - Semana 1\n# Dreadmond & wifi\n\n\n# probabilidade\ndef contagem(draz, dream, unrec, cont):\n if unrec == 0:\n if draz == dream:\n cont += 1\n return cont\n\n cont = contagem(draz, dream+1, unrec-1, cont)\n cont = contagem(draz, dream-1, unrec-1, cont)\n\n return cont\n\n\n# entrada\ns1 = input()\ns2 = input()\n\ntam = len(s1)\ndraz = 0\ndream = 0\nunrec = 0\n\nfor i in range(tam):\n # enviado\n if s1[i] == \"+\": draz += 1\n else: draz -= 1\n\n # captado\n if s2[i] == \"+\": dream += 1\n elif s2[i] == \"-\": dream -= 1\n else: unrec += 1\n\n\nc = contagem(draz, dream, unrec, 0)\nresp = (1.0/(2**unrec)) * c\nprint('{:.15f}'.format(resp))\n \t\t \t\t \t \t\t \t\t\t\t\t\t\t", "from math import factorial as fa\r\ns1= input()\r\ns2= input()\r\na = s1.count('+') - s2.count('+')\r\nb = s1.count('-') - s2.count('-')\r\nc = s2.count('?')\r\nif a<0 or b<0:\r\n print(0)\r\nelse:\r\n print(fa(c)/(fa(a)*fa(c-a))/(2**c))", "import sys\ninput = sys.stdin.readline\n\nCS = input().rstrip()\nRS = input().rstrip()\n\nendPos = 0\nfor cse in CS :\n\tendPos += [-1, 1][cse==\"+\"]\n\ntcs = 0\ndef GetCorrectCases(cIndex=0, curPos=0) :\n\tglobal tcs\n\tif cIndex == len(RS) :\n\t\ttcs += int(curPos == endPos)\n\t\treturn\n\t\n\tRSE = RS[cIndex]\n\tif RSE == \"+\" : GetCorrectCases(cIndex+1, curPos+1) \n\telif RSE == \"-\" : GetCorrectCases(cIndex+1, curPos-1)\n\telse :\n\t\tGetCorrectCases(cIndex+1, curPos+1) \n\t\tGetCorrectCases(cIndex+1, curPos-1) \n\nGetCorrectCases()\nprint(tcs/(2**RS.count(\"?\")))\t", "def main():\n stg1 = ''.join( sorted( input() ) )\n stg2 = ''.join( sorted( input() ) )\n\n bag = ['']\n\n for s in stg2:\n if s == '?':\n tmp = []\n for stg in bag:\n tmp.append( '+' + stg )\n tmp.append( stg + '-' )\n bag = tmp\n\n if s == '+':\n for en, stg in enumerate(bag):\n bag[en] = '+' + stg\n\n if s == '-':\n for en, stg in enumerate(bag):\n bag[en] = stg + '-'\n \n count = 0\n for stg in bag:\n if stg == stg1:\n count += 1\n\n print(count/ len(bag))\n\nif __name__ == '__main__':\n main()\n\t\t \t\t \t \t\t \t\t \t\t\t\t\t \t\t\t", "import math\r\nn1 = input()\r\nn2 = input()\r\npos = 0\r\nneg = 0\r\nfor i in n1:\r\n if i == \"+\":\r\n pos+=1\r\n else:\r\n neg+=1\r\npos2 = 0\r\nneg2 = 0\r\nques = 0\r\nfor i in n2:\r\n if i == \"+\":\r\n pos2+=1\r\n elif i == \"-\":\r\n neg2+=1\r\n else:\r\n ques+=1\r\n\r\nif ques == 0:\r\n if (pos-neg) != (pos2-neg2):\r\n print(0)\r\n else:\r\n print(1)\r\nelse:\r\n value1 = pos-neg\r\n value2 = pos2-neg2\r\n remainder = value1-value2\r\n optimal_pos = (remainder+ques) / 2\r\n optimal_neg = ques - optimal_pos\r\n if optimal_pos < 0 or optimal_neg < 0:\r\n print(0)\r\n else:\r\n optimal_start = math.factorial(optimal_pos+optimal_neg) / (math.factorial(optimal_pos)*math.factorial(optimal_neg))\r\n start = ques\r\n start2 = 0\r\n count = 0\r\n b1 = False\r\n while b1==False:\r\n count += math.factorial(start+start2) / (math.factorial(start)*math.factorial(start2))\r\n start-=1\r\n start2+=1\r\n if start < 0:\r\n break\r\n print(optimal_start/count)\r\n \r\n \r\n ", "import math\r\n\r\nOrg_dir = str(input())\r\nOrg_dir = [*Org_dir]\r\nRec_dir = str(input())\r\nRec_dir = [*Rec_dir]\r\n\r\nOrg_dist = Org_dir.count('+') - Org_dir.count('-')\r\nDist1 = Rec_dir.count('+') - Rec_dir.count('-')\r\nN_Q = Rec_dir.count('?')\r\nif N_Q == 0 and Dist1 == Org_dist:\r\n print(float(1))\r\nelif N_Q == 0 and Dist1 != Org_dist:\r\n print(float(0))\r\nelif N_Q < abs(Org_dist - Dist1):\r\n print(float(0))\r\nelse:\r\n Dist_del = Org_dist - Dist1\r\n n_hat = int((Dist_del + N_Q)/2)\r\n\r\n if n_hat > N_Q:\r\n print(float(0))\r\n elif n_hat <= N_Q:\r\n prob = math.factorial(N_Q)*(0.5**N_Q)/(math.factorial(N_Q - n_hat)*(math.factorial(n_hat)))\r\n print(float(prob))\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\n\r\ndef nCr(n,r):\r\n f = math.factorial\r\n return f(n) / f(r) / f(n-r)\r\n\r\nr = input()\r\nerr = input()\r\nrVal = {\"+\": 0, \"-\": 0}\r\nerrVal = {\"+\": 0, \"-\": 0, \"?\": 0}\r\nnn = 0\r\nnp = 0\r\nfor i in range(len(r)):\r\n rVal[r[i]] +=1\r\n errVal[err[i]] += 1\r\n\r\nnn = abs(rVal[\"-\"] - errVal[\"-\"])\r\nnp = abs(rVal[\"+\"] - errVal[\"+\"])\r\ns = errVal[\"?\"]\r\n\r\nif (nn+np) == s:\r\n val = 0.5**(s) * nCr(s, nn)\r\nelse:\r\n val = 0\r\n\r\nprint(val) \r\n", "a = input()\r\nb = input()\r\nt = 0\r\nd = 0\r\nw = 0\r\n\r\nfor i in range(len(a)):\r\n d += b[i] == '?'\r\n t += 1 if a[i] == '+' else -1\r\n if b[i] == '+':\r\n t -= 1\r\n elif b[i] == '-':\r\n t += 1\r\n\r\nfor i in range(1 << d):\r\n c = t\r\n k = i\r\n for j in range(1, d + 1):\r\n c += 1 if k & 1 else -1\r\n k //= 2\r\n w += 1 if c == 0 else 0\r\n\r\nd = 1 << d\r\nprint(w / d)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "counter_arr = [0 , 0]\r\nunknow_arr = [0]\r\ndef read_and_sum (string):\r\n counter = 0\r\n for i in range (0 , len(string)):\r\n item = string[i]\r\n if item == '+' :\r\n counter += 1\r\n elif item == '-' :\r\n counter -= 1\r\n return counter\r\ndef return_v (number) :\r\n return round(number+(10**-11) , 9)\r\ndef find_small():\r\n if counter_arr[0] > counter_arr[1]:\r\n return 1 ;\r\n else:\r\n return 0\r\nfor i in range (0 , 2) :\r\n x = input()\r\n for j in range (0 , len(x)) :\r\n item = x[j]\r\n if item == '+' :\r\n counter_arr[i] += 1\r\n elif item == '-' :\r\n counter_arr[i] -= 1\r\n else :\r\n unknow_arr[0] += 1\r\nif counter_arr[0] == counter_arr[1] and unknow_arr[0] == 0 :\r\n print(return_v(1))\r\nelif unknow_arr[0] == 0 :\r\n print(return_v(0))\r\nelse :\r\n small = find_small()\r\n big = 0 if small != 0 else 1\r\n dif = counter_arr[big] - counter_arr[small]\r\n bet = [unknow_arr[0]+counter_arr[small] , unknow_arr[0]*-1 + counter_arr[small]]\r\n how_m = 0\r\n count = 0\r\n string='-'*unknow_arr[0]\r\n while count < (2**unknow_arr[0]):\r\n count += 1\r\n total = read_and_sum(string)\r\n if total == dif :\r\n how_m += 1\r\n i = len(string) - 1\r\n while i > -1 :\r\n if string[i] == '-' :\r\n string = string[slice(0 , i)] + \"+\" + string[slice(i+1 , len(string))]\r\n break\r\n else :\r\n string = string[slice(0 , i)] + \"-\" + string[slice(i+1 , len(string))]\r\n i-=1\r\n print(return_v(how_m / count))", "import random\r\nimport math\r\ns=input()\r\nf=input()\r\nx,y,k=0,0,0\r\nfor i in f:\r\n if i==\"+\":\r\n y+=1\r\n elif i==\"-\":\r\n y-=1\r\n else:k+=1\r\nfor i in s:\r\n if i==\"+\":\r\n x+=1\r\n else:x-=1\r\n\"\"\"ss=set()\r\nx,y,rx,ry,k=0,0,0,0,0\r\nfor i in s:\r\n if i==\"+\":\r\n x+=1\r\n else:x-=1\r\nfor i in f:\r\n if i==\"+\":\r\n y+=1\r\n elif i==\"-\":\r\n y-=1\r\n else:k+=1\r\nif y-k<=x<=y+k:\r\n ss.add(s)\r\nwhile len(ss)<2**k:\r\n t=\"\"\r\n for i in f:\r\n if i==\"?\":\r\n g=random.choice([\"+\",\"-\"])\r\n t+=g\r\n else:\r\n t+=i\r\n if t not in s:\r\n ss.add(t)\r\n\r\nfor i in ss:\r\n y=0\r\n for t in i:\r\n if t==\"+\":\r\n y+=1\r\n else:y-=1\r\n if y==x:\r\n rx+=1\r\n else:\r\n ry+=1\r\nprint(rx/(2**k))\"\"\"\r\nfor p in range(0,k+1):\r\n for n in range(0,-k-1,-1):\r\n if p-n==k and p+n==x-y:\r\n print(math.comb(k,p)/2**k)\r\n exit()\r\nprint(0)", "from collections import Counter\r\nimport itertools \r\ns1=input()\r\ns2=input()\r\ncounter1 = Counter(s1)\r\nsumOfString1=counter1['+']-counter1['-']\r\ncounter2 = Counter(s2)\r\nsumOfString2=counter2['+']-counter2['-']\r\nnumOfUnknown=counter2['?']\r\ntable = list(itertools.product([-1, 1 ], repeat=numOfUnknown)) \r\n# print(sum(list(table[0])))\r\nresult=0\r\nfor i in table:\r\n m=sum(list(i))\r\n if((sum(list(i))+sumOfString2)==sumOfString1):\r\n result=result+1\r\nprint(result/pow(2,numOfUnknown))\r\n", "from itertools import permutations\r\n\r\nsignal = input()\r\nreal = input()\r\n\r\nall_var = real.count('?')\r\nif all_var:\r\n if real.count('+') > signal.count('+') or \\\r\n real.count('-') > signal.count('-'):\r\n print(0)\r\n else:\r\n diff_p = signal.count('+') - real.count('+')\r\n diff_m = signal.count('-') - real.count('-')\r\n result = len(set(permutations('+'*diff_p+'-'*diff_m)))\r\n print( result / (1 << all_var) )\r\n \r\nelse:\r\n if signal.count('+') == real.count('+') and \\\r\n signal.count('-') == real.count('-'):\r\n print(1)\r\n else:\r\n print(0)\r\n", "def possible_movements(s2):\n num_movements = s2.count(\"?\")\n possible_movements = []\n for i in range(num_movements):\n if len(possible_movements) == 0:\n possible_movements.append(\"+\")\n possible_movements.append(\"-\")\n else:\n new_movements = []\n for movement in possible_movements:\n new_movements.append(movement + \"+\")\n new_movements.append(movement + \"-\")\n possible_movements = new_movements\n return possible_movements\n\ns1 = input()\ns2 = input()\nfinal_position = s1.count(\"+\") - s1.count(\"-\")\nbase_position = s2.count(\"+\") - s2.count(\"-\")\nuncertain_moves = possible_movements(s2)\nif len(uncertain_moves) == 0:\n if final_position == base_position:\n print(1)\n else:\n print(0)\n exit()\ncorrect_possibilities = 0\nincorrect_possibilities = 0\nfor move in uncertain_moves:\n if final_position == base_position + move.count(\"+\") - move.count(\"-\"):\n correct_possibilities += 1\n else:\n incorrect_possibilities += 1\nprint(f\"{(correct_possibilities / (correct_possibilities + incorrect_possibilities)):.12f}\")\n\t\t\t\t\t\t \t \t \t\t\t\t\t \t\t \t\t \t\t\t\t", "s1=input()\r\ns2=input()\r\ndes=0\r\nn=len(s1)\r\nfor i in s1:\r\n des+=(1 if i=='+' else -1)\r\ntotal=[0]\r\ndef rec(index,cur):\r\n if index==n:\r\n if cur==des:\r\n total[0]+=1\r\n return\r\n if s2[index]=='+' or s2[index]=='-':\r\n rec(index+1,cur+(1 if s2[index]=='+' else -1))\r\n return\r\n rec(index+1,cur+1)\r\n rec(index+1,cur-1)\r\nrec(0,0)\r\ntotalp=2**s2.count('?')\r\nprint(round(total[0]/totalp,10))\r\n\r\n", "def fac(cnt,n):\r\n ans = 1\r\n for i in range(1,n+1):\r\n ans *= (cnt-i+1)\r\n ans /= i*1\r\n return ans\r\ns1 = str(input())\r\ns2 = str(input())\r\npos1 = 0\r\npos2 = 0\r\nneg1 = 0\r\nneg2 = 0\r\ni =0\r\ncnt = 0\r\nwhile i<len(s1):\r\n if s1[i] == '+':\r\n pos1 += 1\r\n if s2[i] == '-':\r\n neg2 += 1\r\n elif s2[i] == '+':\r\n pos2 += 1\r\n else:\r\n cnt += 1\r\n i += 1\r\n else:\r\n neg1 += 1\r\n if s2[i] == '-':\r\n neg2 += 1\r\n elif s2[i] == '+':\r\n pos2 += 1\r\n else:\r\n cnt += 1\r\n i += 1\r\nif pos2>pos1 or neg2>neg1:\r\n print(0)\r\nelif (pos1 == pos2) and (neg1 == neg2):\r\n print(1)\r\nelse:\r\n pos1 -=pos2\r\n neg1 -=neg2\r\n ans = 1\r\n ans *= fac(cnt,pos1)\r\n ans = ans/(2**cnt)\r\n print('{0:.12f}'.format(ans))", "fact = [1]\r\nfor i in range(1, 20):\r\n fact.append(fact[-1] * i)\r\n\r\ndef c_k(n, k):\r\n if k <= n:\r\n return fact[n] // (fact[n-k] * fact[k])\r\n else:\r\n return 0\r\ndef main():\r\n s1 = input()\r\n s2 = input()\r\n cnt_q = 0\r\n col_p, col_m = 0, 0\r\n for i in s1:\r\n if i == '+':\r\n col_p += 1\r\n col_m = len(s1) - col_p\r\n cnt_m, cnt_p = 0, 0\r\n for i in range(len(s2)):\r\n if s2[i] == '?':\r\n cnt_q += 1\r\n for i in s2:\r\n if i == '+':\r\n cnt_p += 1\r\n elif i == '-':\r\n cnt_m += 1\r\n\r\n good_combs = c_k(cnt_q, col_m - cnt_m)\r\n all_combs = pow(2, cnt_q)\r\n p = good_combs / all_combs\r\n print(p)\r\nif __name__ == \"__main__\":\r\n main()", "from math import factorial\n\n\ndef choose(n, k):\n return factorial(n) // factorial(k) // factorial(n - k) if 0 <= k <= n else 0\n\n\ns1 = input()\ns2 = input()\nn1 = len(s1) - (s1.count(\"-\") << 1)\nn2 = s2.count(\"+\") - s2.count(\"-\")\nd = abs(n1 - n2)\nq = s2.count(\"?\")\nprint(choose(q, q - d >> 1) / 2**q)\n", "import math\ns1 = [x for x in input()]\ns2 = [x for x in input()]\n\ndef combinations(list_values, amount):\n if amount == 0:\n return [[]]\n \n l =[]\n for i in range(0, len(list_values)):\n value = list_values[i]\n \n remain_values = combinations(list_values, amount-1)\n for p in remain_values:\n l.append([value, *p])\n \n return l\n\n\npos1 = s1.count('+') - s1.count('-')\n\npos2_probs = s2.count('?')\nlist_probs = ['+', '-']\n\nlist_prob_pos2 = []\nfor probs in combinations(list_probs, pos2_probs):\n prob_s2 = [x for x in s2 if x != '?'] + probs\n prob_pos2 = prob_s2.count('+') - prob_s2.count('-')\n list_prob_pos2.append(prob_pos2)\n \nprint(list_prob_pos2.count(pos1)/len(list_prob_pos2))\n\n \t\t\t\t \t \t \t\t \t \t\t \t\t", "from math import factorial as f\r\n\r\n\r\ndef run():\r\n s1 = input()\r\n s2 = input()\r\n pos1 = 1 * s1.count(\"+\") - 1 * s1.count(\"-\")\r\n pos2 = 1 * s2.count(\"+\") - 1 * s2.count(\"-\")\r\n q_c = s2.count(\"?\")\r\n if abs(pos2 - pos1) > q_c:\r\n print(\"{:.10f}\".format(0))\r\n else:\r\n plus = s1.count(\"+\") - s2.count(\"+\")\r\n minus = s1.count(\"-\") - s2.count(\"-\")\r\n print(\"{:.10f}\".format(f(q_c) / f(plus) / f(minus) / 2**q_c))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n run()\r\n", "from math import factorial\r\n\r\np = 0\r\nfor i in input():\r\n if i == \"+\":\r\n p += 1\r\n\r\ns = input()\r\nq, v = 0, 0\r\nfor i in s:\r\n if i == \"+\":\r\n q += 1\r\n elif i == \"?\":\r\n v += 1\r\nif q > p or p - q > v:\r\n print(0.0)\r\nelse:\r\n n = factorial(v) // factorial(p - q) // factorial(v - p + q)\r\n print(n * 0.5**(p - q) * 0.5**(v - p + q))\r\n\n# Sat Aug 20 2022 11:02:23 GMT+0000 (Coordinated Universal Time)\n", "def f(i, c):\r\n global gcnt, acnt\r\n if i >= len(r):\r\n if c == x:\r\n gcnt += 1\r\n acnt += 1\r\n return\r\n\r\n if r[i] == '+':\r\n f(i + 1, c + 1)\r\n elif r[i] == '-':\r\n f(i + 1, c - 1)\r\n else:\r\n f(i + 1, c + 1)\r\n f(i + 1, c - 1)\r\n\r\n\r\ngcnt = acnt = 0\r\nl = input()\r\nx = l.count('+') - l.count('-')\r\nr = input()\r\nf(0, 0)\r\nprint(gcnt / acnt)\r\n", "a=input()\nb=input()\nap=0\nfor i in range(len(a)):\n if a[i]==\"+\":\n ap+=1\n else:\n ap-=1\nright=0\nwrong=0\ndef bt(summ,i):\n global right\n global wrong\n if i==len(b):\n if summ==ap:\n right+=1\n return\n else:\n wrong+=1\n return\n if b[i]==\"?\":\n bt(summ-1,i+1)\n bt(summ+1,i+1)\n else:\n if b[i]==\"+\":\n bt(summ+1, i+1)\n else:\n bt(summ-1, i+1)\nbt(0,0)\nprint(right/(right+wrong))\n\t \t \t \t\t\t\t\t\t \t \t\t \t\t", "a = input()\r\nb = input()\r\nneedpos = a.count('+') - a.count('-')\r\nuncert = b.count('?')\r\nactpos = b.count('+') - b.count('-')\r\nk = (needpos - (actpos - uncert)) // 2\r\nif k < 0 or k > uncert:\r\n print('0.0')\r\nelse:\r\n res = 1\r\n for i in range(2, uncert + 1):\r\n res *= i\r\n for i in range(2, k + 1):\r\n res //= i\r\n for i in range(2, (uncert - k) + 1):\r\n res //= i\r\n print(res / (2 ** uncert))", "def fact(n):\r\n ans = 1\r\n for i in range(n):\r\n ans*=i+1\r\n return ans\r\na = input()\r\nb = input()\r\nquestionMarks = 0\r\nplus = 0\r\nminus = 0\r\nsumA = 0\r\nsumB = 0\r\n\r\nfor i in b:\r\n if i==\"+\":\r\n plus+=1\r\n sumB+=1\r\n elif i==\"-\":\r\n minus+=1\r\n sumB-=1\r\n else:\r\n questionMarks+=1\r\n\r\nfor i in a:\r\n if i==\"+\":\r\n sumA+=1\r\n else:\r\n sumB+=1\r\nif questionMarks==0:\r\n if sumA==sumB:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n diff = abs(sumA-sumB)\r\n if diff<=questionMarks:\r\n if (questionMarks%2==0 and diff%2==0) or (questionMarks%2!=0 and diff%2!=0):\r\n sol = fact(questionMarks)/((2**questionMarks)*(fact((diff + questionMarks)//2)*fact((questionMarks-diff)//2)))\r\n print(sol)\r\n else:\r\n print(0)\r\n else:\r\n print(0)", "from math import comb\nimport sys\ninput = sys.stdin.readline\n\ns1, s2 = input(), input()\nq = s2.count('?')\nd = s1.count('+') - s2.count('+')\nprint(0 if q < d or d < 0 else comb(q, d) / (2**q))\n", "from math import factorial as fact\ns=input()\nt=input()\npos=s.count('+')-t.count('+')\nneg=s.count('-')-t.count('-')\nque=t.count('?')\nif pos<0 or neg<0:\n print(0)\nelse:\n print((fact(que)/(fact(pos)*fact(neg)))/(2**que))\n \t \t\t \t\t\t\t\t\t\t \t\t\t\t\t \t \t\t\t \t", "s1 = input()\r\ns2 = input()\r\n\r\nn = s2.count('?')\r\nk = s1.count('+')-s2.count('+')\r\nif k>n or k<0:\r\n print(\"%.10f\" % 0.000000000000)\r\n quit()\r\ndef c(n,k):\r\n fact = [1,1,2,6,24,120,720,5040,40320,362880,3628800]\r\n return fact[n]/(fact[n-k]*fact[k])\r\nprint(\"%.10f\" % ((c(n,k))/(2**n)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import factorial\r\n\r\ns = input()[:-1]\r\nw = input()[:-1]\r\n\r\na = s.count('+') - w.count('+')\r\nb = s.count('-') - w.count('-')\r\nc = w.count('?')\r\n\r\nif a < 0 or b < 0:\r\n print(0)\r\nelse:\r\n x = factorial(c)/(factorial(a)*factorial(b))\r\n x = x / 2**c\r\n print(x)", "from math import factorial \ns1,s2 = input(),input()\nnump = s1.count('+') - s2.count('+')\nnumn = s1.count('-') - s2.count('-')\n\n# print(nump,numn)\n\nif(nump<0 or numn<0):\n print(0)\n exit(0)\nelse:\n fact = factorial(nump+numn)/(factorial(nump)*factorial(numn))\n #print(fact)\n print(fact*(.5**(nump+numn)))\n \n\t \t \t\t\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t", "def compute_final_position(command_list):\r\n position = 0\r\n for command in command_list:\r\n if command == \"+\":\r\n position += 1\r\n elif command == \"-\":\r\n position -= 1\r\n else:\r\n continue\r\n return position\r\n\r\ndef compute_prob(n, k):\r\n acc = 1\r\n for i in range(k):\r\n acc *= (n - i)\r\n acc //= (i + 1)\r\n return acc / (2 ** n)\r\n\r\ndef probability(initial_position, final_position, number_of_steps):\r\n diff = final_position - initial_position\r\n if abs(diff) > number_of_steps: return 0.0\r\n positives = diff if diff >= 0 else 0\r\n steps_to_sum_zero = number_of_steps - abs(diff)\r\n if steps_to_sum_zero % 2 != 0: return 0.0\r\n positives += steps_to_sum_zero // 2\r\n return compute_prob(number_of_steps, positives)\r\n\r\nif __name__ == \"__main__\":\r\n commands_sent = input()\r\n expected_position = compute_final_position(commands_sent)\r\n commands_received = input()\r\n middle_expected_position = compute_final_position(commands_received)\r\n number_of_unknowns = commands_received.count(\"?\")\r\n print(\"{:.12f}\".format(probability(middle_expected_position, expected_position, number_of_unknowns)))\r\n", "s1, pos1 = input(), 0\r\ns2, pos2 = input(), 0\r\nquestionmarks = 0\r\nfor x in s1:\r\n if x == \"+\":\r\n pos1 += 1\r\n if x == \"-\":\r\n pos1 -= 1\r\nfor x in s2:\r\n if x == \"+\":\r\n pos2 += 1\r\n if x == \"-\":\r\n pos2 -= 1\r\n if x == \"?\":\r\n questionmarks += 1\r\nposdiff = pos1 - pos2\r\nallvars = 1 << questionmarks\r\ngoodvars = 0\r\nfor i in range(allvars):\r\n a = 0\r\n for j in range(questionmarks):\r\n if (i >> j) & 1 == 1: a += 1\r\n else: a -= 1\r\n if a == posdiff: goodvars += 1\r\nprint(goodvars / allvars)\r\n", "from math import comb\r\nfrom collections import Counter\r\nDrazil = Counter(input())\r\nDreamoon = Counter(input())\r\n\r\ndiff = abs((Drazil[\"+\"]-Drazil[\"-\"]) - (Dreamoon[\"+\"]-Dreamoon[\"-\"]))\r\n\r\nif diff > Dreamoon[\"?\"] or (diff-Dreamoon[\"?\"])%2 == 1:\r\n print(0)\r\nelse:\r\n print(comb(Dreamoon[\"?\"],diff+(Dreamoon[\"?\"]-diff)//2)/(2**Dreamoon[\"?\"])) ", "import math\r\nsent = str(input())\r\nreceived = str(input())\r\nn = len(sent)\r\nright_position = 0\r\nfor i in range(n):\r\n right_position = right_position+1 if sent[i]=='+' else right_position-1\r\nrandom = 0\r\nbefore_ramdom = 0\r\nfor i in range(n):\r\n if received[i] == '+':\r\n before_ramdom += 1\r\n elif received[i] == '-':\r\n before_ramdom -= 1\r\n else:\r\n random += 1\r\nif before_ramdom - random <= right_position <= before_ramdom + random:\r\n print(0.5**random*math.comb(random, (random-abs(right_position-before_ramdom))//2+abs(right_position-before_ramdom)))\r\nelse:\r\n print(0.0)", "from math import factorial\r\na = input()\r\nb = input()\r\ns1 = 0\r\ns2 = 0\r\ns = 0\r\nfor i in range(len(a)):\r\n if a[i]=='+':\r\n s1+=1\r\n else:\r\n s1-=1\r\n if b[i]=='+':\r\n s2+=1\r\n elif b[i]=='-':\r\n s2-=1\r\n else:\r\n s+=1\r\nx = abs(s1-s2)\r\nif s<x:\r\n print(0.0)\r\nelif s%2!=x%2:\r\n print(0.0)\r\nelse:\r\n y = x + (s-x)//2\r\n print((0.5**s)*(factorial(s)/(factorial(y)*factorial(s-y))))", "def C(n, k):\r\n c = 1\r\n \r\n for i in range(k + 1, n + 1):\r\n c *= i\r\n c //= i - k\r\n return c\r\n\r\na = input()\r\nb = input()\r\n\r\nsum1 = 0\r\nsum2 = 0\r\n\r\ncnt = 0\r\n\r\nfor i in a:\r\n if (i == \"+\"):\r\n sum1 += 1\r\n else:\r\n sum1 -= 1\r\n \r\nfor i in b:\r\n if (i == \"+\"):\r\n sum2 += 1\r\n elif (i == \"-\"):\r\n sum2 -= 1\r\n else:\r\n cnt += 1\r\n\r\nif (cnt == 0):\r\n if (sum1 == sum2):\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n if (sum1 > sum2 + cnt):\r\n print(0)\r\n else:\r\n cp = (cnt + sum1 - sum2) // 2\r\n \r\n print(C(cnt, cp) / 2**cnt)", "import sys\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(input):\r\n return(int(input()))\r\ndef inlt(input):\r\n return(list(map(int,input().split())))\r\ndef insr(input):\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(input):\r\n return(map(int,input().split()))\r\n\r\n\r\n################################### 1519B\r\ns1 = sys.stdin.readline().strip()\r\ns2 = sys.stdin.readline().strip()\r\n\r\ns1Net = s1.count('+') - s1.count('-')\r\ns2Net = s2.count('+') - s2.count('-')\r\nunk = s2.count('?')\r\n\r\ndef recurse(unk, unkNet=0):\r\n if(unk == 0): return int(s1Net == s2Net + unkNet)\r\n \r\n return recurse(unk-1, unkNet+1) + recurse(unk-1, unkNet-1)\r\n\r\nattempts = 2**unk\r\nsuccesses = recurse(unk)\r\nprint(successes / attempts)\r\n", "def dreamoon_and_wifi(): # funktioniert eigtl. safe nicht\r\n import math\r\n real_outcome = 0\r\n dreamoon_outcome = 0\r\n dreamoon_error = []\r\n for sign in list(input()): # calculates expected position\r\n if sign == \"+\":\r\n real_outcome += 1\r\n else:\r\n real_outcome -= 1\r\n for sign in list(input()): # calculates received position and creates a list of ones (the errors)\r\n if sign == \"+\":\r\n dreamoon_outcome += 1\r\n elif sign == \"-\":\r\n dreamoon_outcome -= 1\r\n else:\r\n dreamoon_error.append(1)\r\n needed_plus = 0\r\n possible = False\r\n for i in range(len(dreamoon_error) + 1):\r\n if sum(dreamoon_error) + dreamoon_outcome == real_outcome:\r\n possible = True\r\n for number in dreamoon_error:\r\n needed_plus += number == 1\r\n break\r\n i -= i == len(dreamoon_error)\r\n try:\r\n dreamoon_error[i] = -1\r\n except IndexError:\r\n pass\r\n needed_minus = len(dreamoon_error) - needed_plus\r\n if possible is False and len(dreamoon_error) > 0:\r\n print(0)\r\n elif len(dreamoon_error) == 0 and possible is False and real_outcome - dreamoon_outcome != 0:\r\n print(0)\r\n elif possible is False and len(dreamoon_error) == 0:\r\n print(1)\r\n else:\r\n print(((math.factorial(len(dreamoon_error)))/(math.factorial(needed_plus) * math.factorial(needed_minus)))/2**len(dreamoon_error))\r\n\r\n\r\ndreamoon_and_wifi()\r\n", "# For each ? make two new arrays into the new bag\r\n# Repeat on the new bag until there is no more question marks\r\n\r\ndef position(commands):\r\n return commands.count(\"+\") - commands.count(\"-\")\r\n\r\ngoalCommand = list(input())\r\nCommands = list(input())\r\n\r\nGoal = position(goalCommand)\r\n\r\nBag = [Commands.copy()]\r\nfor i in range(Commands.count(\"?\")):\r\n NewBag = []\r\n for c in Bag:\r\n if \"?\" in c:\r\n First = c.index(\"?\")\r\n Copy1 = c.copy()\r\n Copy2 = c.copy()\r\n Copy1[First] = \"+\"\r\n Copy2[First] = \"-\"\r\n NewBag.append(Copy1)\r\n NewBag.append(Copy2)\r\n Bag = NewBag\r\n\r\nScore = 0\r\nfor i in Bag:\r\n if position(i) == Goal:\r\n Score += 1\r\nif Score == 0:\r\n print(float(0))\r\nelse:\r\n print(Score / len(Bag))", "a=input()\na1=list(a.split())\nb=input()\nb1=list(b.split())\naa1=a.count('+')\naa2=a.count('-')\nbb1=b.count('+')\nbb2=b.count('-')\ncnk= [[1]]\nfor i in range(1, 21):\n cnk.append([])\n cnk[i].append(1)\n for j in range(1, i):\n cnk[i].append(cnk[i-1][j-1]+cnk[i-1][j])\n cnk[i].append(1)\nif bb1>aa1 or bb2>aa2:\n print(0)\nelse:\n print(cnk[aa1+aa2-bb1-bb2][aa1-bb1]/(2**(aa1+aa2-bb1-bb2)))\n# Sat Apr 23 2022 10:41:21 GMT+0000 (Coordinated Universal Time)\n", "s1 = input() \r\ns2 = input()\r\ntarget = 0 \r\nfor s in s1:\r\n if s == '+':\r\n target += 1 \r\n else:\r\n target -= 1 \r\ndef count(idx,curr):\r\n if idx == len(s2):\r\n return int(target == curr) \r\n if s2[idx] == '+':\r\n return count(idx + 1, curr + 1) \r\n elif s2[idx] == '-':\r\n return count(idx + 1, curr - 1) \r\n else:\r\n return count(idx + 1, curr + 1) + count(idx + 1, curr - 1) \r\n\r\nways = count(0,0) \r\nif ways == 0:\r\n print(0) \r\nelse:\r\n unk = s2.count('?')\r\n print(ways / (1 << unk)) \r\n", "import math \r\n\r\ns1=input()\r\ns2=input()\r\n\r\ns1p= s1.count('+')-s1.count('-')\r\ns2p= s2.count('+')-s2.count('-')\r\n\r\nif (s1p==s2p and s2.count('?')==0):\r\n print(\"{:.12f}\".format(1))\r\n exit(0)\r\nif (s1p!=s2p and s2.count('?')==0):\r\n print(\"{:.12f}\".format(0))\r\n exit(0)\r\n\r\nn_q = s2.count('?')\r\npr = s1p-s2p\r\nrp=0\r\nrm=0\r\nif pr>0:\r\n rp=pr\r\n k = n_q - rp\r\n if k>=0:\r\n rp += int(k/2)\r\n rm += int(k/2)\r\n if rp+rm != n_q:\r\n print(\"{:.12f}\".format(0))\r\n exit(0)\r\n else:\r\n print(\"{:.12f}\".format(0))\r\n exit(0)\r\nelse:\r\n rm=-1*pr\r\n k = n_q - rm\r\n if k>=0:\r\n rp += int(k/2)\r\n rm += int(k/2)\r\n if rp+rm != n_q:\r\n print(\"{:.12f}\".format(0))\r\n exit(0)\r\n else:\r\n print(\"{:.12f}\".format(0))\r\n exit(0)\r\n\r\nans = math.factorial(n_q)/math.factorial(rp)/math.factorial(rm)/(2**n_q)\r\nprint(\"{:.12f}\".format(ans))\r\n", "\r\na = input()\r\nb = input()\r\n\r\ndesired = 0\r\nfor i in a:\r\n if i == '+':\r\n desired += 1\r\n else:\r\n desired -= 1\r\n \r\nreceived = 0\r\nconfused_count = 0\r\nfor i in b:\r\n if i == '+':\r\n received += 1\r\n elif i == '-':\r\n received -= 1\r\n \r\n else:\r\n confused_count += 1\r\n \r\nif confused_count == 0:\r\n if received == desired:\r\n print(1)\r\n else:\r\n print(0)\r\n \r\nelse:\r\n places = [received]\r\n for i in range(confused_count):\r\n dummy = []\r\n for j in places:\r\n p = j + 1\r\n q = j - 1\r\n dummy.append(p)\r\n dummy.append(q)\r\n places = dummy\r\n \r\n print(places.count(desired)/len(places))\r\n\r\n\r\n \r\n \r\n ", "ans=0\r\n\r\ndef cloud(x,i,s,f,n):\r\n if i==n and s==f:\r\n return 1\r\n if i==n:\r\n return 0\r\n\r\n if x[i]=='+':\r\n return cloud(x,i+1,s+1,f,n)\r\n if x[i]=='-':\r\n return cloud(x,i+1,s-1,f,n)\r\n else:\r\n return cloud(x,i+1,s+1,f,n)+cloud(x,i+1,s-1,f,n)\r\n\r\na=input()\r\ns=0\r\nfor i in a:\r\n if i=='+':\r\n s+=1\r\n else:\r\n s-=1\r\nb=input()\r\np=1\r\nfor i in b:\r\n if i=='?':\r\n p*=2\r\n# print(p)\r\n# print(cloud(b,0,0))\r\nprint(\"{:.12f}\".format(cloud(b,0,0,s,len(b))/p))\r\n\r\n# def cloud(x,i,s,f,n):\r\n# global ans\r\n# if s==f and i==n:\r\n# ans+=1\r\n# return\r\n# if i==n:\r\n# return\r\n# if x[i]=='+':\r\n# s+=1\r\n# elif x[i]=='-':\r\n# s-=1\r\n# else:\r\n# s=cloud(x,i+1,s+1,f,n)\r\n# cloud(x,i+1,s-1,f,n)\r\n# return\r\n\r\n", "original, dreamoon = input(), input()\ntarget, wins, fails = 0, 0, 0\n\nfor instruction in original:\n target += (1 if instruction == \"+\" else -1)\n\ndef recursion(index, x_coordinate):\n global wins\n global fails\n \n if index == len(original):\n if x_coordinate == target:\n wins += 1\n else:\n fails += 1\n return\n \n if dreamoon[index] != \"?\":\n recursion(index + 1, x_coordinate + (1 if dreamoon[index] == \"+\" else -1))\n return\n\n recursion(index + 1, x_coordinate - 1)\n recursion(index + 1, x_coordinate + 1)\n\nrecursion(0, 0)\nprint(f\"{(wins / (wins + fails)):.9f}\")\n \t\t\t\t\t \t\t\t\t \t \t \t \t\t \t\t\t\t\t \t\t", "def calc(desired, actual, step):\n if step == 0:\n if desired == actual:\n return 1\n else:\n return 0\n\n return calc(desired, actual+1, step-1) + calc(desired, actual-1, step-1)\n\n\ncmd = input()\nrcv = input()\n\npos = 0\n\nfor x in cmd:\n if x == '+':\n pos += 1\n else:\n pos -= 1\n\npos_rcv = 0\nunknown = 0\n\nfor x in rcv:\n if x == '+':\n pos_rcv += 1\n elif x == '-':\n pos_rcv -= 1\n else:\n unknown += 1\n\nif pos == pos_rcv and unknown == 0:\n print(1)\n\nelif abs(pos-pos_rcv) > unknown:\n print(0)\n\nelse:\n\n total = 2**unknown\n correct = calc(pos, pos_rcv, unknown)\n\n print(correct/total)\n\n \t\t \t \t \t\t \t\t \t \t\t\t\t \t", "s1 = input()\r\ns2 = input()\r\n\r\nn1p, n1n, n2p, n2n, n2q = s1.count('+'), s1.count('-'), s2.count('+'), s2.count('-'), s2.count('?')\r\n\r\nreqSum = n1p - n1n\r\n\r\ncurrSum = n2p - n2n\r\n\r\nmissSum = reqSum - currSum\r\n\r\nchances = n2q\r\n\r\ndef nCr(n,r):\r\n sum = 1\r\n # Calculate the value of n choose r using the binomial coefficient formula\r\n for i in range(1, r+1):\r\n sum = sum * (n - r + i) / i\r\n return int(sum)\r\n \r\nif abs(missSum) > chances:\r\n print(0)\r\nelif chances == 0:\r\n print(int(missSum==0))\r\nelif missSum&1 != chances&1:\r\n print(0)\r\nelse:\r\n i = chances - (chances- missSum)//2 \r\n base = 0.5**chances\r\n print(nCr(chances,i)*base)\r\n \r\n ", "import heapq\r\nimport math\r\nfrom random import randrange\r\nfact = math.factorial \r\n\"\"\"\r\n\tseja S1 a sequencia de si ∈ {-, +} \r\n\tseja P1 o inteiro que representa posição final desejada\r\n\r\n\tseja S2 a sequencia entendida atraves do wifi com si ∈ {-,+,?}\r\n\tExiste uma subsequencia de S2 que são os simbolos '-' e '+' que são \r\n\tcomandos garantidamente executados e a subsequencia restante formado\r\n\tpelo simbolo incerto '?'\r\n\r\n\tFazemos uma contagem desses simbolos em S2 tal que \r\n\t'-' = -1 e '+' = 1, resultando em um inteiro P2\r\n\r\n\tO que resta em S2 são 'n' '?' simbolos que podem representar\r\n\ttanto '-' quanto '+', e soma desse restante resulta em possiveis inteiros P3\r\n\t\r\n\tEntão devemos encontrar a possbilidades 'p' de P3 + P2 = P1 ou seja P3 = P1 - P2\r\n\tO universo de possiblidade é igual a 2^n, podendo P3 ser qualquer numero\r\n\tPara achar a probabilidade de dar certo seria p ÷ 2^n\r\n\r\n\tSendo assim, só precisamos saber a qntds: slots = n, e target = P1-P2 = P3\r\n\tEntão a soma dos 'n' simbolos deve ser igual a 'target'\r\n\tDe i = 0 até n ∑(?) = 'target' tal que '?' ∈ {1,-1} só existe uma maneira de desse somatorio\r\n\tser igual exatamete 'P3', é com um numero fixo de 'a' de 1's e 'b' de -1's | a,b ∈ ℕ\r\n\r\n\t(i) \r\n\t\tP3 = a - b\r\n\r\n\t(ii) \t\r\n\t\ta + b = n\r\n\t->\tb = n - a\r\n\t\r\n\t(i) + (ii)\r\n\t\tP3 + b = n - b\r\n\t-> 2b = n - P3\r\n\t-> b = (n - P3)/2\r\n\t\r\neq. finais:\r\n\tb = (n - P3)/2\r\n\ta = n - b\r\n\r\n\"\"\"\r\n\r\ndef DreamoonandWiFi(slots:int, target:int):\r\n\ttotal_universe = 2**slots\r\n\tb = (slots - target)/2\r\n\t\r\n\tassert(b == int(b))\r\n\r\n\ta = slots - b\r\n\tif b < 0 or a < 0:\r\n\t\treturn 0.0\r\n\t\t\r\n\tpossible_combinations = fact(slots)/(fact(a)*fact(b))\r\n\t\r\n\treturn possible_combinations/total_universe\r\n\t\r\ndef __main__():\r\n\tS1 = input()\r\n\tS2 = input()\r\n\tP1 = 0 \r\n\tP2 = 0 \r\n\tslots = 0\r\n\tfor c in S1:\r\n\t\tif c == '-':\r\n\t\t\tP1 -= 1\r\n\t\telse:\r\n\t\t\tP1 += 1\r\n\tfor c in S2:\r\n\t\tif c == '-':\r\n\t\t\tP2 -= 1\r\n\t\telif c == '+':\r\n\t\t\tP2 += 1\r\n\t\telse:\r\n\t\t\tslots += 1\r\n\t\r\n\tprint(DreamoonandWiFi(slots, P1 -P2))\r\n\t\r\nif __name__ == '__main__':\r\n\t__main__()", "import math\r\nfrom collections import defaultdict\r\n\r\n\r\ndef cal(n, r):\r\n return math.factorial(n)/(math.factorial(r)*(math.factorial(n-r)))\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\ncounter = defaultdict(int)\r\nfor c in s1:\r\n counter[c] += 1\r\nfor c in s2:\r\n counter[c] -= 1\r\nif counter['-'] >= 0 and counter['+'] >= 0 and counter['-']+counter['+'] == s2.count('?'):\r\n minus = counter['-']\r\n q = s2.count('?')\r\n print(cal(q, minus)/(2**q))\r\nelse:\r\n print(0)\r\n", "\r\nfrom math import comb\r\nfp = sum([1 if x == '+' else -1 for x in input()])\r\n\r\nr = list(input())\r\nif '?' not in set(r):\r\n if sum([1 if x == '+' else -1 for x in r]) == fp:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n n = r.count('?')\r\n sumi = r.count('+') - r.count('-')\r\n p = []\r\n for i in range(n, -1, -1):\r\n p.append(i*1 - (n-i)*1)\r\n p = list(map(lambda x: x + sumi, p))\r\n if fp in p:\r\n idx = p.index(fp)\r\n print(comb(n, idx) / (2**n))\r\n else:\r\n print(0)\r\n", "s1 = input()\r\ns2 = input()\r\n\r\ntargPos = 0\r\nfor i in s1:\r\n if i == '+': targPos += 1\r\n if i == '-': targPos -= 1\r\n\r\n\r\ndef perebratAche(d, pos):\r\n if d == len(s2):\r\n if pos == targPos: return 1\r\n else: return 0\r\n e = s2[d]\r\n if e == '+': return perebratAche(d + 1, pos + 1)\r\n elif e == '-': return perebratAche(d + 1, pos - 1)\r\n else: return perebratAche(d + 1, pos + 1) + perebratAche(d + 1, pos - 1)\r\n\r\nprint(perebratAche(0, 0) / (2 ** s2.count('?')))\n# Sat Apr 16 2022 16:38:09 GMT+0000 (Coordinated Universal Time)\n", "import math \n\ns1=input()\ns2=input()\n\ns1p= s1.count('+')-s1.count('-')\ns2p= s2.count('+')-s2.count('-')\n\nif (s1p==s2p and s2.count('?')==0):\n print(\"{:.12f}\".format(1))\n exit(0)\nif (s1p!=s2p and s2.count('?')==0):\n print(\"{:.12f}\".format(0))\n exit(0)\n\nn_q = s2.count('?')\npr = s1p-s2p\nrp=0\nrm=0\nif pr>0:\n rp=pr\n k = n_q - rp\n if k>=0:\n rp += int(k/2)\n rm += int(k/2)\n if rp+rm != n_q:\n print(\"{:.12f}\".format(0))\n exit(0)\n else:\n print(\"{:.12f}\".format(0))\n exit(0)\nelse:\n rm=-1*pr\n k = n_q - rm\n if k>=0:\n rp += int(k/2)\n rm += int(k/2)\n if rp+rm != n_q:\n print(\"{:.12f}\".format(0))\n exit(0)\n else:\n print(\"{:.12f}\".format(0))\n exit(0)\n\nans = math.factorial(n_q)/math.factorial(rp)/math.factorial(rm)/(2**n_q)\nprint(\"{:.12f}\".format(ans))\n\n\t\t\t\t \t\t\t\t \t \t \t\t\t \t \t\t \t", "from collections import Counter\r\n\r\n\r\ndef main():\r\n s1 = input()\r\n s2 = input() \r\n\r\n def solve(idx,path = 0):\r\n if idx == len(s2):\r\n return rec.append(path) \r\n if s2[idx] == '?':\r\n solve(idx + 1, path - 1) \r\n solve(idx + 1, path + 1) \r\n else:\r\n solve(idx + 1, path + (1 if s2[idx] == '+' else -1) )\r\n\r\n counter1 = Counter(s1) \r\n orginal = counter1['+'] - counter1['-'] \r\n\r\n rec = [] \r\n solve(0) \r\n counter2 = Counter(rec) \r\n total = len(rec) \r\n if orginal not in counter2:\r\n print(0) \r\n return \r\n print(counter2[orginal] / total) \r\n\r\n \r\n\r\nmain() ", "def calcula_probabilidade(s2, posicao_desejada, i=0, posicao=0):\n if i == len(s2):\n return 1 if posicao == posicao_desejada else 0\n\n if s2[i] == '?':\n return 0.5 * calcula_probabilidade(s2, posicao_desejada, i + 1, posicao + 1) + 0.5 * calcula_probabilidade(s2, posicao_desejada, i + 1, posicao - 1)\n \n elif s2[i] == '+':\n return calcula_probabilidade(s2, posicao_desejada, i + 1, posicao + 1)\n \n else:\n return calcula_probabilidade(s2, posicao_desejada, i + 1, posicao - 1)\n\ns1 = input().strip()\ns2 = input().strip()\n\nposicao_desejada = s1.count('+') - s1.count('-')\n\nprint(calcula_probabilidade(s2, posicao_desejada))\n \t\t \t\t\t\t \t\t\t \t\t\t \t \t\t\t\t", "from math import factorial \r\n \r\np = 0 \r\nfor i in input(): \r\n if i == \"+\": \r\n p += 1 \r\n \r\ns = input() \r\nq, v = 0, 0 \r\nfor i in s: \r\n if i == \"+\": \r\n q += 1 \r\n elif i == \"?\": \r\n v += 1 \r\nif q > p or p - q > v: \r\n print(0.0) \r\nelse: \r\n n = factorial(v) // factorial(p - q) // factorial(v - p + q) \r\n print(n * 0.5**(p - q) * 0.5**(v - p + q)) \n# Sat Aug 20 2022 11:14:05 GMT+0000 (Coordinated Universal Time)\n", "def Dreamon(idx , sm2):\r\n global probability\r\n if idx == cnt:\r\n if sm2 == sm1:\r\n probability += 1\r\n return\r\n\r\n Dreamon(idx+1,sm2-1)\r\n Dreamon(idx+1,sm2+1)\r\n\r\nif __name__ == '__main__':\r\n s1 , s2 = input(),list(input())\r\n sm1 = sm2 = cnt = probability = 0\r\n\r\n for i in range(len(s1)):\r\n if s1[i] == '+':sm1+=1\r\n else:sm1-=1\r\n if s2[i] == '+':sm2+=1\r\n elif s2[i] == '-':sm2-=1\r\n\r\n for i in s2:\r\n if i == '?':cnt += 1\r\n\r\n Dreamon(0,sm2)\r\n print(f'{probability/(2**cnt):.12f}')", "import sys\r\nfrom collections import Counter\r\nimport math\r\n\r\ns1 = sys.stdin.readline().strip()\r\ns2 = sys.stdin.readline().strip()\r\n\r\nc1 = Counter(s1)\r\nc2 = Counter(s2)\r\n\r\ntarget = c1['+'] - c1['-']\r\ninitial = c2['+'] - c2['-']\r\n\r\npotential = c2['?']\r\n\r\nrequired = target - initial\r\n\r\nnum_pos = required + potential\r\nif num_pos % 2 != 0:\r\n print(0)\r\nelse:\r\n num_pos //= 2\r\n num_neg = potential - num_pos\r\n\r\n if num_pos < 0 or num_neg < 0:\r\n print(0)\r\n else:\r\n print(math.comb(potential, num_pos) / 2 ** potential)", "a = input()\r\nr = input()\r\naplus = 0\r\naminus = 0\r\nrplus = 0\r\nrminus = 0\r\nrques = 0\r\n\r\nfor i in a:\r\n if i == '+':\r\n aplus+=1\r\n elif i == '-':\r\n aminus+=1\r\nfor i in r:\r\n if i == '+':\r\n rplus+=1\r\n elif i == '-':\r\n rminus+=1\r\n else:\r\n rques+=1\r\n\r\nfrom math import factorial\r\n\r\nif aplus == rplus and aminus == rminus:\r\n print(1)\r\nelif rques == 0:\r\n print(0)\r\nelse:\r\n qplus = aplus-rplus\r\n qminus = aminus - rminus\r\n\r\n if qplus + qminus != rques:\r\n print(0)\r\n elif qplus < 0 or qminus < 0:\r\n print(0)\r\n else:\r\n print(factorial(rques)/(factorial(qplus)*factorial(qminus)*(2**rques)))", "from math import factorial\r\n\r\na = 0\r\nfor i in input():\r\n if i == '+':\r\n a += 1\r\n else:\r\n a -= 1\r\ns = 0\r\nk = 0\r\nfor i in input():\r\n if i == '+':\r\n s += 1\r\n elif i == '-':\r\n s -= 1\r\n else:\r\n k += 1\r\nn = abs(a - s)\r\nn_ = k - n\r\nif n_ % 2 != 0 or n_ < 0:\r\n print(0.0)\r\nelse:\r\n n_ = n_ // 2\r\n n += n_\r\n print((factorial(k) // (factorial(n_) * factorial(n))) / (2 ** k))\n# Sat Apr 16 2022 16:30:00 GMT+0000 (Coordinated Universal Time)\n", "from collections import defaultdict, deque\r\nfrom math import gcd,ceil,sqrt,factorial\r\nimport sys\r\nimport heapq\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\nfrom functools import reduce\r\nimport operator as op\r\n\r\n\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\ndef ncr(n:int,r:int):\r\n\tr=min(n,n-r)\r\n\tnmtr = reduce(op.mul,range(n,n-r,-1),1)\r\n\tdnmtr = reduce(op.mul,range(1,r+1),1)\r\n\treturn nmtr//dnmtr\r\n\r\n\r\ndef fact(n):\r\n\treturn factorial(n)\r\n\r\n\r\ndef myyy__answer():\r\n\ts1=input()\r\n\ts2=input()\r\n\tn=len(s1)\r\n\r\n\tc1=0\r\n\tc2=0\r\n\tcnt=0\r\n\r\n\tfor i in range(n):\r\n\t\tc1+=(s1[i]==\"+\")\r\n\t\tc2+=(s1[i]==\"-\")\r\n\t\tc1-=(s2[i]==\"+\")\r\n\t\tc2-=(s2[i]==\"-\")\r\n\t\tcnt+=(s2[i]==\"?\")\r\n\t\r\n\tif(c2<0):\r\n\t\tc1+=(-c2)\r\n\tif(c1<0):\r\n\t\tc2+=(-c1)\r\n\t\r\n\t# print(cnt,c1,c2)\r\n\r\n\tif(cnt<c1+c2 or (cnt-(c1+c2))&1):\r\n\t\tprint(0)\r\n\telse:\r\n\t\tc1+=(cnt-c1-c2)//2\t\r\n\t\tc2+=(cnt-c1-c2)//2\r\n\t\tprint(ncr(cnt,c1)/(2**cnt))\r\n\r\n\t\r\n\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tinput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\t# for _ in range(int(input())):\r\n\t\t# print(myyy__answer())\r\n\tmyyy__answer()\r\n", "import operator as op\r\nfrom functools import reduce\r\n\r\ndef ncr(n, r):\r\n r = min(r, n-r)\r\n numer = reduce(op.mul, range(n, n-r, -1), 1)\r\n denom = reduce(op.mul, range(1, r+1), 1)\r\n return numer // denom # or / in Python 2\r\n\r\ndef cq(lst):\r\n return lst.count('?')\r\ndef cp(lst):\r\n return lst.count('+')\r\ndef cm(lst):\r\n return lst.count('-')\r\n \r\nm = input()\r\nn = input()\r\n\r\n\r\n\r\nfv = (cp(m) - cm(m))\r\nic = (cp(n) - cm(n))\r\n\r\nnc = fv - ic\r\nq = cq(n)\r\n\r\n\r\n#odd or even\r\n#if q%2 == 0:\r\nl = list(range(-q, q+2, 2))\r\nlt= len(l)\r\ng = []\r\nfor i in range(lt):\r\n g.append(ncr(lt-1,i))\r\n\r\nif nc in l:\r\n ind = l.index(nc)\r\n print(g[ind]/sum(g))\r\nelse:\r\n print(0.000000000000)\r\n\r\n", "import math\r\nsend=input()\r\nreceive=input()\r\npos=0\r\nfor x in send:\r\n if x=='+':\r\n pos+=1\r\n else:\r\n pos-=1\r\ncur,ques=0,0\r\nfor y in receive:\r\n if y=='+':\r\n cur+=1\r\n elif y=='-':\r\n cur-=1\r\n else:\r\n ques+=1\r\nval=abs(cur-pos)\r\nif val>ques or val%2!=ques%2:\r\n print(int(0))\r\nelse:\r\n x=(ques+val)//2\r\n ans=math.factorial(ques)/math.factorial(x)/math.factorial(ques-x)\r\n print(ans/(2**(ques)))\r\n", "original_commands = input()\nreceved_commands = input()\n\n# Count the number of commands sent\noriginal_plus = original_commands.count(\"+\")\noriginal_minus = original_commands.count(\"-\")\noriginal_final_position = original_plus - original_minus\n\n# Count the number of commands received\nreceved_plus = receved_commands.count(\"+\")\nreceved_minus = receved_commands.count(\"-\")\nlost_commands = receved_commands.count(\"?\")\n\ntotal_prob = 2**lost_commands\n\n# Computes the possible final positions\nfinal_positions = [(receved_plus - receved_minus)]\nfor _ in range(lost_commands):\n aux = []\n for i in final_positions:\n aux += [i+1, i-1]\n final_positions = aux\n\nprint(final_positions.count(original_final_position)/total_prob)\n\n \t\t\t \t \t\t \t\t \t\t\t \t\t\t \t \t\t", "import math\nori = input()\nrec = input()\nori_p = 0\nori_m = 0\n\nq=0\nfor i in range(len(ori)):\n if ori[i]=='+' : ori_p +=1 \n else : ori_m+=1\n if rec[i]=='+' : ori_p -=1\n elif rec[i]=='-': ori_m-=1 \n else : q+=1\n\nif ori_p<0 or ori_m<0:\n print(0)\nelif ori_p>0:\n print(math.comb(q,ori_p)/(2**q))\nelif ori_m>0:\n print(math.comb(q,ori_m)/(2**q))\nelse:\n print(1)", "#!/usr/bin/env python3\r\n#-*- coding: utf-8 -*-\r\n# author: Neto, Jocelino\r\n\r\n# Dreamoon is standing at the position 0 on a number line.\r\n# Drazil is sending a list of commands through Wi-Fi to Dreamoon's smartphone\r\n# and Dreamoon follows them.\r\n#\r\n# Each command is one of the following two types:\r\n#\r\n# 1. Go 1 unit towards the positive direction, denoted as '+'\r\n# 1. Go 1 unit towards the negative direction, denoted as '-' \r\n#\r\n# But the Wi-Fi condition is so poor that Dreamoon's smartphone reports some of\r\n# the commands can't be recognized and Dreamoon knows that some of them might\r\n# even be wrong though successfully recognized. Dreamoon decides to follow every\r\n# recognized command and toss a fair coin to decide those unrecognized ones\r\n# (that means, he moves to the 1 unit to the negative or positive direction\r\n# with the same probability 0.5).\r\n#\r\n# You are given an original list of commands sent by Drazil and list received\r\n# by Dreamoon. What is the probability that Dreamoon ends in the position\r\n# originally supposed to be final by Drazil's commands?\r\n#\r\n\r\ndef calculate(analysed, unknow, diff):\r\n power = 2 ** unknow\r\n if len(analysed) == unknow:\r\n counter_analysed = analysed.count(\"+\") - analysed.count(\"-\")\r\n A = 1 if counter_analysed == diff else 0\r\n return A/power\r\n return calculate(analysed+\"-\", unknow, diff) + calculate(analysed+\"+\", unknow, diff)\r\n\r\nif __name__ == '__main__':\r\n str1_input = input()[:10]\r\n str2_input = input()[:10]\r\n\r\n counter_input = str1_input.count(\"+\") - str1_input.count(\"-\")\r\n counter_output = str2_input.count(\"+\") - str2_input.count(\"-\")\r\n est = str2_input.count(\"?\")\r\n\r\n solution = calculate(\"\", est, (counter_input - counter_output))\r\n\r\n print(solution)", "from math import comb \r\n\r\ndef main():\r\n s1 = input()\r\n s2 = input() \r\n orginal = 0\r\n for s in s1:\r\n orginal += (1 if s == '+' else -1 )\r\n sofar = 0\r\n unk = 0\r\n for s in s2:\r\n if s == '?':\r\n unk += 1 \r\n continue\r\n sofar += (1 if s == '+' else -1) \r\n offset = abs(orginal - sofar)\r\n total_comb = 1 << unk \r\n print(comb(unk,(unk + offset) // 2) / total_comb)\r\nmain()", "\r\nif __name__ == \"__main__\":\r\n Drazil = input() \r\n Dreamoon = input()\r\n Anonymous = 0\r\n CountPos1 = 0\r\n CountPos2 = 0\r\n CountNe1 = 0\r\n CountNe2 = 0\r\n for i in Drazil:\r\n if i == '+': CountPos1 += 1\r\n else: CountNe1 += 1\r\n for i in Dreamoon:\r\n if i == '+': CountPos2 += 1\r\n elif i == '-':CountNe2 += 1\r\n else: Anonymous += 1\r\n NeedPos = CountPos1 - CountPos2\r\n NeedNe = CountNe1 - CountNe2\r\n if NeedPos == NeedNe == 0:\r\n print(float(1))\r\n else:\r\n x = 0\r\n for i in range(1<<Anonymous):\r\n countbit1 = 0\r\n countbit0 = 0\r\n if i == 0:\r\n countbit0 = Anonymous \r\n # trafer to binary\r\n tmp = i\r\n while tmp:\r\n d = tmp % 2\r\n if d == 1: countbit1 += 1\r\n else: countbit0 += 1\r\n tmp = tmp//2\r\n if countbit0 + countbit1 != Anonymous:\r\n countbit0 += Anonymous - (countbit0 + countbit1)\r\n if countbit1 == NeedPos and countbit0 == NeedNe:\r\n x += 1\r\n r = float(x/( (1<<Anonymous)))\r\n print(\"%.9f\" %r) ", "\r\nfrom sys import stdin\r\n\r\ndef get_input():\r\n # Faster IO\r\n return stdin.read().strip().split('\\n')\r\n\r\ndef get_prob(s1, s2):\r\n n = len(s1)\r\n\r\n if n == 0:\r\n return 1\r\n\r\n end = sum(-1 if sign == '-' else 1 for sign in s1)\r\n # print(end)\r\n res = [0, 0]\r\n def rec(i, pos):\r\n if i == n:\r\n if pos == end:\r\n res[0] += 1\r\n else:\r\n res[1] += 1\r\n return\r\n\r\n if s2[i] in ['-', '?']:\r\n rec(i + 1, pos - 1)\r\n if s2[i] in ['+', '?']:\r\n rec(i + 1, pos + 1)\r\n\r\n rec(0, 0)\r\n # print(res)\r\n\r\n return res[0] / sum(res)\r\n\r\n\r\nprint(get_prob(*get_input()))\r\n", "from math import factorial as fa\r\n\r\ns1 = input()\r\ns2 = input()\r\na = s1.count('+') - s2.count('+')\r\nb = s1.count('-') - s2.count('-')\r\nc = s2.count('?')\r\nif a < 0 or b < 0:\r\n print(0)\r\nelse:\r\n print((fa(c) / (fa(a) * fa(c - a))) / (2 ** c))", "def comb(x, y):\r\n p = 1\r\n for i in range(x - y + 1, x + 1):\r\n p *= i\r\n if y > 1 and p % y == 0:\r\n p //= y\r\n y -= 1\r\n while y > 1:\r\n p //= y\r\n y -= 1\r\n return p\r\n\r\nf = input()\r\ns = input()\r\nt = f.count('+') - f.count('-')\r\nknown = s.count('+') - s.count('-')\r\nsp = s.count('?')\r\nif sp == 0:\r\n if known == t:\r\n print(1.0)\r\n else:\r\n print(0.0)\r\n exit(0)\r\ndiff = abs(t-known)\r\nif diff - sp > 0:\r\n print(0.0)\r\n exit(0)\r\nprint(comb(sp, (sp + diff) // 2)/(2 ** sp))", "\r\n\r\ndef valor(s):\r\n qtde = 0\r\n for c in s:\r\n if c == '+':\r\n qtde += 1\r\n else:\r\n qtde -= 1\r\n return qtde\r\n\r\n\r\np1 = input()\r\np2 = input()\r\nv = valor(p1)\r\np = []\r\ntam = len(p2)\r\nm = 0\r\nfor i in range(tam):\r\n if p2[i] == '?':\r\n m += 1\r\n p.append(i)\r\nqtde = 0\r\nfor i in range(1 << m):\r\n p3 = list(p2)\r\n for j in range(m):\r\n if i & (1 << j):\r\n p3[p[j]] = '+'\r\n else:\r\n p3[p[j]] = '-'\r\n if valor(p3) == v:\r\n qtde += 1\r\nprint(f'{qtde / (1 << m):.9f}')\r\n\r\n\r\n\r\n\r\n", "a=[x for x in input()]\r\nb=[x for x in input()]\r\n\r\n\r\nplus=a.count(\"+\")\r\nminus=len(a)-plus\r\n\r\np=b.count(\"+\")\r\nm=b.count(\"-\")\r\nque=b.count(\"?\")\r\n\r\nif p>plus:\r\n\tprint(0)\r\n\texit()\r\nif m>minus:\r\n\tprint(0)\r\n\texit()\r\n\r\nval=minus-m\r\ndef nCr(n, r):\r\n if r > n:\r\n return 0\r\n if r == 0 or r == n:\r\n return 1\r\n return nCr(n-1, r-1) + nCr(n-1, r)\r\n\r\ndeno=2**que\r\n\r\nnum=nCr(que,val)\r\n\r\n\r\nprint(num/deno)\r\n\r\n\r\n", "n=input()\r\nm=input()\r\nres=[]\r\ndef helper(i,curr):\r\n if i==len(m):\r\n res.append(curr)\r\n return\r\n if m[i]=='+':\r\n helper(i+1,curr+1)\r\n elif m[i]=='-':\r\n helper(i+1,curr-1)\r\n else:\r\n helper(i+1,curr+1)\r\n helper(i+1,curr-1)\r\ns=0\r\nfor i in n:\r\n if i=='+':\r\n s+=1\r\n else:\r\n s-=1\r\nhelper(0,0)\r\n# print(res)\r\nans=0\r\nfor i in res:\r\n if i==s:\r\n ans+=1\r\nprint(ans/len(res))", "import itertools\r\n\r\ndef steps(lst):\r\n counter = 0\r\n for i in lst:\r\n if i == '+':\r\n counter += 1\r\n else:\r\n counter -= 1\r\n \r\n return counter\r\n\r\n\r\ndef signs():\r\n s1 = input()\r\n s2 = input()\r\n \r\n original = steps(s1)\r\n num = s2.count('?')\r\n lst = []\r\n \r\n if num != 0:\r\n for i in itertools.product(['+', '-'], repeat=num):\r\n temp = s2.replace(\"?\", \"\") + (''.join(i))\r\n lst.append(steps(temp))\r\n \r\n else:\r\n lst.append(steps(s2))\r\n \r\n ratio = lst.count(original) / len(lst) \r\n \r\n return ratio\r\n\r\n\r\nprint(\"{:.12f}\".format(signs()))", "def get_input():\n drazil = list(input())\n dreamoon = list(input())\n return drazil, dreamoon\n\ndef count_signals(entrada: list):\n return entrada.count(\"+\"), entrada.count(\"-\")\n\ndef calculate_possibilities(total_dreamoon, desconhecido_dremoon):\n possibles = [total_dreamoon]\n for _ in range(desconhecido_dremoon):\n possibles = [p + delta for p in possibles for delta in (1, -1)]\n return possibles\n\ndef solve():\n entrada_drazil, entrada_dreamoon = get_input()\n\n pos_drazil, neg_drazil = count_signals(entrada_drazil)\n pos_dreamoon, neg_dreamoon = count_signals(entrada_dreamoon)\n\n total_drazil = pos_drazil - neg_drazil\n total_dreamoon = pos_dreamoon - neg_dreamoon\n\n desconhecido_dremoon = len(entrada_dreamoon) - pos_dreamoon - neg_dreamoon\n\n if not desconhecido_dremoon:\n print(f'{(total_dreamoon == total_drazil):.12f}')\n return\n\n possibles = calculate_possibilities(total_dreamoon, desconhecido_dremoon)\n\n probability = possibles.count(total_drazil) / len(possibles)\n print('{:.12f}'.format(probability))\n\nsolve()\n\n \t \t\t\t\t\t \t\t\t \t \t\t\t\t\t\t \t", "s1 = input()\r\ns2 = input()\r\n\r\ndesired = 0\r\nfor i in s1:\r\n if i == \"+\":\r\n desired += 1\r\n else:\r\n desired -= 1\r\ncurrent = 0\r\npower = 0\r\nfor i in range(len(s2)):\r\n if s2[i] == \"?\":\r\n power+=1\r\n elif s2[i] == \"+\":\r\n current +=1\r\n else:\r\n current -=1\r\ndifference = desired - current\r\nnum = 0\r\n\r\nfor i in range((2**power)):\r\n mask = i\r\n value = 0\r\n for j in range(power):\r\n if mask & 1:\r\n value +=1\r\n else:\r\n value -=1\r\n mask = mask >> 1\r\n if value == difference:\r\n num +=1\r\n\r\nif power != 0:\r\n print(num/(2**power)) \r\nelse:\r\n print(float(difference == 0))\r\n\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nS = input()\r\nT = input()\r\nN = len(S)\r\ntotal = 0\r\ndp = {0:1}\r\nfor i in range(N):\r\n if S[i]=='+':\r\n total+=1\r\n else:\r\n total-=1\r\n \r\n ndp = defaultdict(float)\r\n for k,v in dp.items():\r\n if T[i]=='+':\r\n ndp[k+1] += v\r\n elif T[i]=='-':\r\n ndp[k-1] += v\r\n else:\r\n ndp[k+1] += v/2\r\n ndp[k-1] += v/2\r\n dp = ndp\r\n \r\nprint(dp[total])\r\n \r\n\r\n", "from math import factorial\r\n\r\n\r\nli1 = input()\r\nli2 = input()\r\npos = 0\r\nq = 0\r\nfor i in li1:\r\n if i ==\"+\": pos+=1\r\n else: pos-=1\r\nfor i in li2:\r\n if i == \"+\": pos-=1\r\n elif i ==\"-\": pos+=1\r\n else: q+=1\r\nif q>= abs(pos):\r\n r = (q-abs(pos))//2\r\n p = factorial(q)/(factorial(r)*factorial(q-r))\r\n print(p/pow(2,q))\r\nelse:\r\n print(0.0)", "correctString = input()\ncorrectResult = 0\n\nfor i in correctString:\n if(i == '-'): correctResult -= 1\n else: correctResult += 1\n\nreceivedString = input()\nreceivedResult = 0\ndoubts = 0\n\nfor i in receivedString:\n if(i == '-'): receivedResult -= 1\n elif(i == '+'): receivedResult += 1\n else: doubts += 1\n\nif(doubts == 0):\n if((correctResult == receivedResult)): print(1)\n else: print(0)\n\nelse:\n if(abs(correctResult - receivedResult) > doubts): print(0)\n else:\n arrPossibilities = []\n '''calculate all possibilities of + and -'''\n for i in range(2**doubts):\n arrPossibilities.append(bin(i)[2:].zfill(doubts))\n \n rightCases = 0\n for i in arrPossibilities:\n result = receivedResult\n for j in i:\n if(j == '0'): result -= 1\n else: result += 1\n if(result == correctResult):\n rightCases += 1\n print(rightCases/len(arrPossibilities))\n\n\n\n \t \t \t\t\t \t \t\t \t", "import math\r\ns1 = input()\r\ns2 = input()\r\np=s1.count('+')-s2.count('+')\r\nm=s1.count('-')-s2.count('-')\r\nq=s2.count('?')\r\nif p<0 or m<0:\r\n print('0.000000000000')\r\nelif p+m == 0:\r\n print('1.000000000000')\r\nelse:\r\n print((math.factorial(q)/(math.factorial(p)*math.factorial(m)))* (1/2)**q) ", "a = input()\nb = input()\nap = 0\nfor i in range(len(a)):\n if a[i] == '+': ap += 1\n else: ap -= 1\nright, wrong = 0, 0\ndef bt(s, i):\n global right\n global wrong\n if i == len(b):\n if s == ap:\n right += 1\n return\n else:\n wrong += 1\n return\n if b[i] == '?':\n bt(s-1, i+1)\n bt(s+1, i+1)\n else:\n if b[i] == '+': bt(s+1, i+1)\n else: bt(s-1, i+1)\nbt(0, 0)\nprint(right/(right+wrong))\n\t \t \t\t \t\t \t \t\t\t \t \t\t\t \t", "import math\r\nsen=input()\r\nsenarr=[]\r\nfor i in sen:\r\n senarr.append(i)\r\nsenarr.sort()\r\nrec=input()\r\nrecarr=[]\r\nfor i in rec:\r\n recarr.append(i)\r\nrecarr.sort()\r\nn=rec.count(\"?\")\r\np=sen.count(\"+\")-rec.count(\"+\")\r\na=sen.count(\"-\")-rec.count(\"-\")\r\nif senarr==recarr:\r\n print(\"%.12f\"%1)\r\nelse:\r\n if p<0 or a<0:\r\n print(\"%.12f\"%0)\r\n else:\r\n print(\"%.12f\"%((0.5**n)*int(((math.factorial(n))/(math.factorial(n-p)*math.factorial(p))))))", "import math\ncorrect_command = input()\nreceived_command = input()\n\nfinal_pos_correct = 0\nfor char in correct_command:\n if char == '+':\n final_pos_correct += 1\n else:\n final_pos_correct -= 1\nreceived_pos = 0\nunknown = 0\nfor char in received_command:\n if char == '+':\n received_pos += 1\n elif char == '-':\n received_pos -= 1\n else:\n unknown += 1\nif unknown == 0:\n if final_pos_correct == received_pos:\n print(1)\n else:\n print(0)\nelse:\n diff = abs(received_pos - final_pos_correct)\n\n if unknown < diff:\n print(0)\n else:\n a = (unknown - diff) // 2\n b = unknown - a\n\n combinations = math.factorial(unknown) / (math.factorial(a) * math.factorial(b))\n denom = 2 ** unknown\n print(combinations/denom)\n\n", "'''\r\nimport sys\r\n\r\n# Fast input\r\ninput = sys.stdin.readline\r\n\r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '')\r\n file = kwargs.get('file', sys.stdout)\r\n flush = kwargs.get('flush', False)\r\n output = sep.join(map(str, args)) + end\r\n file.write(output)\r\n if flush:\r\n file.flush()\r\n'''\r\ndef fact(n):\r\n if n==0:\r\n return 1\r\n else:\r\n return n*fact(n-1)\r\ndef com(n,r):\r\n return fact(n)//(fact(r)*fact(n-r))\r\n \r\nfor _ in range(1):\r\n s=input()\r\n s1=input()\r\n if s.count('+')==s1.count('+') and s.count('-')==s1.count('-'):\r\n print(1)\r\n else:\r\n error=0\r\n for i in s:\r\n if i=='+':\r\n error+=1\r\n else:\r\n error-=1\r\n for i in s1:\r\n if i=='+':\r\n error-=1\r\n elif i=='-':\r\n error+=1\r\n c=s1.count('?')\r\n if error>c or error<-1*c:\r\n print(0)\r\n else:\r\n m=(c+error)/2\r\n n=(c-error)/2\r\n \r\n if (int(m)-m)==0 and (int(n)-n)==0:\r\n print(com(m+n,n)*((0.5)**(m+n)))\r\n else:\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 \r\n \r\n", "def nCr(x, y):\r\n x= int(x)\r\n y= int(y)\r\n ans = 1\r\n for i in range(x):\r\n ans *= (i+1)\r\n for i in range(y):\r\n ans /= (i+1)\r\n for i in range(x-y):\r\n ans /= (i+1)\r\n \r\n return ans\r\n\r\n\r\na = input()\r\nb = input()\r\n\r\n\r\nactual_pos = 0\r\ncurrent_pos = 0\r\n\r\nfor x in a:\r\n actual_pos += (x=='+')\r\n actual_pos -= (x=='-')\r\n\r\nmoves = 0\r\n\r\nfor x in b:\r\n current_pos += (x=='+')\r\n current_pos -= (x=='-')\r\n moves += (x=='?') \r\n\r\n\r\noffset = abs(actual_pos - current_pos)\r\n\r\nif(offset>moves or (moves-offset)%2==1):\r\n print(0)\r\n\r\nelse:\r\n ans = nCr(moves, (moves-offset) / 2)\r\n ans /= (2**moves)\r\n print(ans)\r\n", "def func(s,i=0):\n\tif(i==len(s)):\n\t\treturn 0\n\tif(s[i]==\"+\"):\n\t\treturn func(s,i+1)+1\n\telse:\n\t\treturn func(s,i+1)-1\n\t\t\ndef generate(lst,s,i=0):\n\t\tif(i==len(s)):\n\t\t\tlst.append(s)\n\t\t\treturn\n\t\tif(s[i]==\"?\"):\n\t\t s=s[:i]+'+'+s[i+1:] \n\t\t generate(lst,s,i+1)\n\t\t s=s[:i]+\"-\"+s[i+1:]\n\t\t generate(lst,s,i+1)\n\t\t s=s[:i]+\"?\"+s[i+1:]\n\t\telse:\n \t\t generate(lst,s,i+1)\n\ndef init():\n\ts=input()\n\tt=input()\n\tx=func(s)\n\tct=0\n\tlst=[]\n\tgenerate(lst,t)\n\tfor cat in lst:\n\t\tif(func(cat)==x):\n\t\t\tct+=1\n\tprint(ct/len(lst))\n\t\ninit()\n\t\t\t", "s1 = input()\r\ns2 = input()\r\n\r\nfound = []\r\ndef dfs(i, num):\r\n if i == len(s1):\r\n found.append(num)\r\n return \r\n \r\n if s2[i] == '?':\r\n dfs(i+1, num-1)\r\n dfs(i+1, num+1)\r\n else:\r\n dfs(i+1, num-1 if s2[i] == '-' else num+1)\r\n\r\nactual = s1.count('+') - s1.count('-')\r\n\r\ndfs(0,0)\r\ncount = 0\r\nfor num in found:\r\n if num == actual:\r\n count += 1\r\n\r\nprint(count/len(found))\r\n\r\n", "from collections import Counter, defaultdict\r\n\r\n\r\ndef ncr(n, r):\r\n x = 1\r\n for i in range(n, n-r, -1):\r\n x *= i\r\n y = 1\r\n for i in range(1, r+1):\r\n y *= i\r\n return x//y\r\n\r\n\r\ndef solve():\r\n s1 = input()\r\n s2 = input()\r\n freq = Counter(s1)\r\n\r\n for i in s2:\r\n freq[i] -= 1\r\n qs = -freq['?']\r\n\r\n if qs == 0:\r\n if freq['+'] == 0 and freq['-'] == 0:\r\n print(1)\r\n else:\r\n print(0)\r\n else:\r\n print(ncr(qs, max(freq['-'], freq['+']))/2**qs)\r\n\r\n\r\nfor _ in range(1):\r\n # print(solve())\r\n solve()\r\n", "a1, b1, c1, a, b = 0, 0, 0, 0, 0\r\nc = [[0] * 11 for _ in range(11)]\r\ns = input()\r\nc[0][0] = 1\r\nfor i in range(1, 11):\r\n c[i][0] = 1\r\n for j in range(1, i + 1):\r\n c[i][j] = c[i - 1][j] + c[i - 1][j - 1]\r\nfor char in s:\r\n if char == '+':\r\n a += 1\r\n else:\r\n b += 1\r\ns = input()\r\nfor char in s:\r\n if char == '+':\r\n a1 += 1\r\n elif char == '-':\r\n b1 += 1\r\n else:\r\n c1 += 1\r\n\r\ndelta = abs(a1 - b1 - a + b)\r\nif c1 < delta or (c1 % 2 != delta % 2):\r\n print(\"0.0000000000\")\r\nelse:\r\n delta = (delta + c1) // 2\r\n up = c[c1][delta]\r\n down = 2 ** c1\r\n result = up / down\r\n print(f\"{result:.10f}\")# 1697809595.4405298", "from math import comb\r\nsend=input();recive=input();x=sorted(send);y=sorted(recive)\r\npossen=send.count(\"+\");negsend=send.count(\"-\")\r\nposrec=recive.count(\"+\");negrec=recive.count(\"-\")\r\nif x==y:print(1)\r\nelif posrec>possen :print(0)\r\nelse:print(.5**(recive.count(\"?\"))*comb(recive.count(\"?\"), possen-posrec))", "def fatorial(n):\n if n == 0:\n return 1\n elif n == 1:\n return 1\n else:\n return n*fatorial(n-1)\n\ndef conta_caracter(string, caracter):\n retorno = 0\n for char in string:\n if char == caracter:\n retorno+=1\n return retorno\n\n\nstr_certa = input()\nstr_duvida = input()\nfalta_mais = conta_caracter(str_certa, '+') - conta_caracter(str_duvida, '+')\nfalta_menos = conta_caracter(str_certa, '-') - conta_caracter(str_duvida, '-')\nduvida = conta_caracter(str_duvida, '?') \nif(duvida == 0):\n if(falta_mais == 0 and falta_menos == 0 ):\n print('1.000000000000')\n else:\n print('0.000000000000')\nelif falta_mais<0 or falta_menos<0:\n print('0.000000000000')\nelse:\n print(f'{(fatorial(duvida)/(fatorial(falta_mais)*fatorial(falta_menos)))/2**duvida:.12f}')\n\t \t \t \t \t \t \t\t \t\t\t\t\t \t\t", "from math import factorial\r\n\r\ns1 = input()\r\ns2 = input()\r\nplus = s1.count('+') - s2.count('+')\r\nminus = s1.count('-') - s2.count('-')\r\n\r\nif plus < 0 or minus < 0:\r\n print(0)\r\n quit()\r\nelse:\r\n fact = factorial(plus + minus) / (factorial(plus) * factorial(minus))\r\n print(fact * (0.5 ** (plus + minus)))\r\n\r\n", "import math\r\ns1 = input()\r\ns2 = input()\r\npluses = 0\r\nminuses = 0 \r\nfor x in s1 : \r\n if x == '+' : pluses += 1\r\n else : minuses += 1\r\nd1 = pluses - minuses\r\n\r\npluses = 0\r\nminuses = 0 \r\nfor x in s2 : \r\n if x == '+' : pluses += 1\r\n elif x == '-' : minuses += 1\r\nd2 = pluses - minuses\r\nques = len(s1) - pluses - minuses\r\nd = d2 - d1 # this is the distance required to be moved due to '?' which are ques in number\r\nif (ques+d)%2 == 0 :\r\n #a+b = ques\r\n #a-b = d\r\n plus = (ques+d)//2\r\n minus = (ques-d)//2\r\n if plus > ques or minus < 0 or minus > ques or plus < 0: print(0)\r\n else : print((0.5**ques)*math.comb(ques,minus))\r\n \r\nelse : print(0)", "import math\n\ndef calculate_prob(s1, s2):\n pos1=0\n\n possible_answers=[0]\n possible_answers_aux=[]\n for i in range(len(s1)):\n if s1[i] == '+':\n pos1 += 1\n else:\n pos1 -= 1\n\n if s2[i] == '+':\n for i in range(len(possible_answers)):\n possible_answers[i] += 1\n\n elif s2[i] == '-':\n for i in range(len(possible_answers)):\n possible_answers[i] -= 1\n\n else:\n for element in possible_answers:\n possible_answers_aux.extend([element+1, element-1])\n possible_answers.clear()\n possible_answers = possible_answers_aux.copy()\n possible_answers_aux.clear()\n\n right = 0\n for answer in possible_answers:\n if answer == pos1:\n right += 1\n\n return right/len(possible_answers)\n\ndef main():\n s1 = input()\n s2 = input()\n print(calculate_prob(s1, s2))\n\n\nmain()\n \t \t \t\t \t \t \t \t\t\t \t", "\r\ndef toFixed(numObj, digits=0):\r\n return f\"{numObj:.{digits}f}\"\r\ndef f(n, h):\r\n if n: return f(n - 1, h + 1) + f(n - 1,h - 1)\r\n elif h == 0:\r\n return 1\r\n else:\r\n return 0\r\na, b = input(), input()\r\nc = a.count('+') - a.count('-')\r\nd = b.count('+') - b.count('-')\r\ne = b.count('?')\r\nans = f(e, c - d) / (2 ** e)\r\nprint(toFixed(ans, 12))\r\n\n# Sat Aug 20 2022 08:51:55 GMT+0000 (Coordinated Universal Time)\n", "\r\n\r\nos = input()\r\nrs = input()\r\n\r\nfinal_pos = 0\r\n\r\nfor ch in os:\r\n if ch == '+':\r\n final_pos += 1\r\n else:\r\n final_pos -= 1\r\n\r\n# print(final_pos)\r\n\r\nprob_pos = []\r\nprob_pos.append(0)\r\nfor ch in rs:\r\n if ch == '+':\r\n for i in range(len(prob_pos)):\r\n prob_pos[i] += 1\r\n elif ch == '-':\r\n for i in range(len(prob_pos)):\r\n prob_pos[i] -= 1\r\n else:\r\n n = len(prob_pos)\r\n for i in range(n):\r\n prob_pos.append(prob_pos[i]+1)\r\n prob_pos[i] -= 1\r\n # print(prob_pos)\r\n\r\nprobability = prob_pos.count(final_pos)/ len(prob_pos)\r\nprint(probability)\r\n\r\n\r\n", "def solve(i,position,l,s):\r\n if i==len(s):\r\n l.append(position)\r\n return\r\n if s[i]==\"+\":\r\n solve(i+1,position+1,l,s)\r\n if s[i]==\"-\":\r\n solve(i+1,position-1,l,s)\r\n if s[i]==\"?\":\r\n solve(i+1,position-1,l,s)\r\n solve(i+1,position+1,l,s)\r\ns1=input()\r\ns2=input()\r\nt=[]\r\nl=[]\r\nsolve(0,0,t,s1)\r\nsolve(0,0,l,s2)\r\n\r\nfinal=t[0]\r\ncount=l.count(final)\r\nprint(count/(len(l)))", "from math import comb\r\nx,y=input(),input()\r\na=len(x)-2*x.count('-')\r\nb=y.count('+')-y.count('-')\r\nc=y.count('?')\r\nif a==b and c==0:\r\n print('1.000000000000')\r\nelif c!=0 and (abs(a-b)%2==c%2) and (abs(a-b)<=c):\r\n print(comb(c,c//2-abs(a-b)//2)/2**c)\r\nelse:\r\n print('0.000000000000')", "# week 8 e\nfrom math import comb as nCr\na, b = input(), input()\nn = b.count('?')\nr = a.count('+') - b.count('+')\nprint(0.0 if n<r or r<0 else nCr(n, r)/(2**n))\n\t \t\t \t\t \t\t \t\t\t \t\t \t \t\t \t\t \t", "true = input().strip()\nreceived = input().strip()\ncnts = [0, 0, 0, 0]\nfor i in range(len(true)):\n if true[i] == \"+\":\n cnts[1] += 1\n elif true[i] == \"-\":\n cnts[0] += 1\n\n if received[i] == \"+\":\n cnts[3] += 1\n elif received[i] == \"-\":\n cnts[2] += 1\n\n\nminus = cnts[0] - cnts[2]\nplus = cnts[1] - cnts[3]\n\ndef choose(n,k):\n if k>n: return 0\n a = 1\n for c in range(n-k+1, n+1):\n a *= c\n for c in range(1, k+1):\n a //= c\n return a\n\nif minus < 0 or plus < 0:\n print(0)\nelse:\n print(choose(minus+plus, plus) * 0.5**(minus + plus))\n", "from math import factorial as f\r\n\r\n\r\ndef solve():\r\n s = input()\r\n e = 0\r\n for i in s:\r\n e += 1 if i == '+' else -1\r\n s1 = input()\r\n k = 0\r\n x = 0\r\n for i in s1:\r\n if i == '?':\r\n k += 1\r\n continue\r\n x += 1 if i == '+' else -1\r\n x = e - x\r\n if (k - x) % 2:\r\n return 0.0\r\n kn = (k - x) // 2\r\n kp = (k + x) // 2\r\n if kn < 0 or kp < 0:\r\n return 0.0\r\n return f(k) // (f(kp) * f(kn)) / 2**k\r\n\r\n\r\nprint(solve())", "a=input()\r\nb=input()\r\n\r\nA = [[0]*11 for i in range(11)]\r\nA[0][0] = 1\r\nfor n in range(1,11):\r\n for r in range(0,n+1):\r\n A[n][r] = A[n-1][r-1] + A[n-1][r]\r\n \r\ndef comb(n,r):\r\n if not (0 <= r <= n): return 0\r\n return A[n][r]\r\n \r\nexp = 0\r\nact = 0\r\nextr = 0\r\nfor i in a: exp += (i=='+')-(i=='-')\r\nfor i in b: act += (i=='+')-(i=='-'); extr += (i=='?')\r\n\r\nif (exp - act + extr)%2: print(0)\r\nelse:\r\n lamda = (exp - act + extr) // 2\r\n print(comb(extr, lamda)* (0.5)**extr)\r\n", "def check_prob(list, target):\n values = []\n for s in list:\n value = 0\n for c in s:\n if (c == '+'):\n value += 1\n else:\n value -= 1\n values.append(value)\n return round(values.count(target) / len(values), 12)\n\ndef main():\n s1 = input()\n s2 = input()\n\n possible = []\n for c in s2:\n if (c == '?'):\n if (not possible): # list is empty\n possible.append('+')\n possible.append('-')\n else:\n aux = possible[:]\n for i in range(len(possible)):\n possible[i] += '+'\n for i in range(len(possible)):\n aux[i] += '-'\n possible += aux\n else:\n if (not possible): # list is empty\n possible.append(c)\n else:\n for i in range(len(possible)):\n possible[i] += c\n \n s1_value = 0\n for s in s1:\n if (s == '+'):\n s1_value += 1\n else:\n s1_value -= 1\n \n print(check_prob(possible, s1_value))\n\nmain()\n \t\t\t\t \t\t\t\t \t\t \t \t\t \t\t\t" ]

[ "import math\r\nimport sys\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def accumulate(nums):\r\n n = len(nums)\r\n pre = [0] * (n + 1)\r\n for i in range(n):\r\n pre[i + 1] = pre[i] + nums[i]\r\n return pre\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n mod = 10**9 + 7\r\n n, a, b, k = ac.read_ints()\r\n a -= 1\r\n b -= 1\r\n dp = [[0] * n for _ in range(2)]\r\n pre = 0\r\n dp[pre][a] = 1\r\n for _ in range(k):\r\n cur = 1 - pre\r\n lst = ac.accumulate(dp[pre])\r\n for y in range(n):\r\n if y < b:\r\n x = (y + b) // 2 - 1 if (y + b) % 2 == 0 else (y + b) // 2\r\n dp[cur][y] = lst[x+1] % mod\r\n if x >= y:\r\n dp[cur][y] -= dp[pre][y]\r\n dp[cur][y] %= mod\r\n elif y > b:\r\n x = (y + b) // 2 + 1\r\n dp[cur][y] = (lst[n] - lst[x]) % mod\r\n if y >= x:\r\n dp[cur][y] -= dp[pre][y]\r\n dp[cur][y] %= mod\r\n pre = cur\r\n ac.st(sum(dp[pre]) % mod)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "from itertools import accumulate\r\ndef read(): return list(map(int, input().split()))\r\n\r\n\r\nMOD = 10**9+7\r\n\r\n\r\ndef run_case():\r\n n, a, b, k = read()\r\n dp = [0]*(n+1)\r\n dp[a] = 1\r\n for _ in range(k):\r\n dp_acc = list(accumulate(dp))\r\n ndp = [0]*(n+1)\r\n for y in range(1, n+1):\r\n if y == b:\r\n continue\r\n if y > b:\r\n l, r = y-((y-b-1)//2), n\r\n else:\r\n l, r = 1, y+((b-y-1)//2)\r\n ndp[y] = (dp_acc[r]-dp_acc[l-1]-dp[y]) % MOD\r\n dp = ndp\r\n print(sum(dp) % MOD)\r\n\r\n\r\nfor test in range(1):\r\n run_case()\r\n", "G,M=range,10**9+7;n,a,b,k=map(int,input().split());n+=1\r\nif b<a:a,b=n-a,n-b\r\nf=[0]*n;f[a]=1;s=[0]*n\r\nfor i in G(a,b):s[i]=1\r\nfor _ in G(k):\r\n for j in G(1,b):f[j]=(s[(j+b-1)//2]-f[j]+2*M)%M;s[j]=(s[j-1]+f[j])%M\r\nprint(s[b-1])", "from functools import lru_cache\r\n\r\ns1 = map(int, input().split())\r\nn, a, b, k = s1\r\n\r\nMOD = 10 ** 9 + 7\r\n\r\nf = [1] * (n + 1)\r\nif a > b:\r\n for i in range(k):\r\n nf = [0] * (n + 1)\r\n top = b + 2\r\n for bot in range(b + 2, n + 1):\r\n nf[bot] += nf[bot - 1] + f[bot - 1]\r\n nf[bot] %= MOD\r\n nf[bot] -= f[bot]\r\n if top < n + 1:\r\n nf[bot] += f[top]\r\n top += 1\r\n if top < n + 1:\r\n nf[bot] += f[top]\r\n top += 1\r\n f = nf\r\nelse:\r\n for i in range(k):\r\n nf = [0] * (n + 1)\r\n top = b - 2\r\n for bot in range(b - 2, 0, -1):\r\n nf[bot] += nf[bot + 1] + f[bot + 1]\r\n nf[bot] %= MOD\r\n nf[bot] -= f[bot]\r\n if top >= 1:\r\n nf[bot] += f[top]\r\n top -= 1\r\n if top >= 1:\r\n nf[bot] += f[top]\r\n top -= 1\r\n f = nf\r\nprint(f[a] % MOD)\r\n", "n, a, b, k = map(int, input().split())\r\nmod = 10 ** 9 + 7\r\nif a > b:\r\n a = n + 1 - a\r\n b = n + 1 - b\r\n\r\n# f[i][j]表示移动i次后，位于j的方案数\r\nf = [0] * b\r\nf[a] = 1\r\n\r\nfor i in range(1, k + 1):\r\n s = [0]\r\n for v in f:\r\n s.append(s[-1] + v)\r\n\r\n for y in range(1, b):\r\n f[y] = (s[y + (b - y - 1) // 2 + 1] - f[y] + mod) % mod\r\n\r\nans = 0\r\nfor i in range(1, b):\r\n ans += (f[i] + mod) % mod\r\n ans %= mod\r\n\r\nprint(ans)" ]

[ "n, p, q = map(int, input().split())\r\ns = input()\r\nif p > q:\r\n p, q = q, p\r\nfor i in range(0, n + 1, q):\r\n if (n - i) % p == 0:\r\n print(i // q + (n - i) // p)\r\n for j in range(0, i, q):\r\n print(s[j:j + q])\r\n for j in range(i, n, p):\r\n print(s[j:j + p])\r\n exit(0)\r\nprint(-1)\r\n", "n, p, q = [int(j) for j in input().split()]\r\ns = str(input())\r\nx, y = -1, -1\r\nfound = False\r\nfor j in range(101):\r\n for k in range(101):\r\n res = j * p + k * q\r\n if res == n:\r\n x, y = j, k\r\n found = True\r\n break\r\n elif res > n:\r\n break\r\n if found == True or j * p > n:\r\n break\r\nif found == False:\r\n print(-1)\r\nelse:\r\n p1, p2 = 0, p\r\n List = []\r\n for j in range(x):\r\n List.append(s[p1 : p2])\r\n p1 += p\r\n p2 += p\r\n p2 = p1 + q\r\n for j in range(y):\r\n List.append(s[p1 : p2])\r\n p1 += q\r\n p2 += q\r\n print(len(List))\r\n for j in range(len(List)):\r\n print(List[j])\r\n", "n,p,q = map(int,input().split())\n\ns = input()\n\ndef problem6(n,p,q,s):\n\n cont = 0\n cont2 = 0\n j = 0\n while n>=0:\n if n%p==0:\n break\n cont+=1\n n -= q\n \n if n<0:\n print(\"-1\")\n return\n \n cont2 = int(n/p)\n num = cont+cont2\n print(num)\n \n for i in range(cont2):\n \n print(s[j:j+p])\n j+=p\n \n for i in range(cont):\n \n print(s[j:j+q])\n j+=q\n \nproblem6(n,p,q,s)\n", "def main():\r\n n,p,q=map(int,input().split())\r\n ch= input()\r\n d=0\r\n test=False\r\n\r\n for i in range(100):\r\n for j in range(100):\r\n if i*p+j*q==n:\r\n pp,qq=i,j\r\n test = True\r\n break\r\n if test:\r\n break\r\n if test==False:\r\n print(-1)\r\n else:\r\n print(pp+qq) \r\n for i in range(pp):\r\n print(ch[d:d+p])\r\n d+=p\r\n for i in range(qq):\r\n print(ch[d:d+q])\r\n d+=q\r\n\r\nmain()", "n, p, q = map(int, input().split())\r\ns = list(input())\r\nf = 0\r\nfor i in range(101):\r\n if f:\r\n break\r\n for j in range(101):\r\n if p * i + q * j == n:\r\n ans = []\r\n l, r = 0, 0\r\n for _ in range(i):\r\n r += p\r\n ans.append(s[l : r])\r\n l += p\r\n for _ in range(j):\r\n r += q\r\n ans.append(s[l : r])\r\n l += q\r\n f = 1\r\n break\r\nprint(-1 if not f else len(ans))\r\nif f:\r\n for t in ans:\r\n print(\"\".join(t))", "n,p,q=list(map(int,input().split()))\r\ns=str(input())\r\ni,f=0,0\r\nwhile(1):\r\n c=n-(i*p)\r\n if c<0:\r\n break\r\n if c%q==0:\r\n f=1\r\n break\r\n i+=1\r\nif f:\r\n d=c//q\r\n print(i+d)\r\n v,x,y=0,0,0\r\n while(x<i):\r\n u=s[v:v+p]\r\n print(u)\r\n x+=1\r\n v+=p\r\n while(y<d):\r\n u=s[v:v+q]\r\n print(u)\r\n y+=1\r\n v+=q\r\nelse:\r\n print(\"-1\")", "try:\r\n import re\r\n\r\n def cg(string, length):\r\n return re.findall('.{%d}' % length, string)\r\n n,p,q=list(map(int,input().split(\" \")))\r\n s=input()\r\n u=0\r\n if len(s)%p==0:\r\n u=1 \r\n elif len(s)%q==0:\r\n u=2\r\n else:\r\n u=3\r\n if u==1:\r\n print(n//p)\r\n k=cg(s,p)\r\n for i in k:\r\n print(i)\r\n elif u==2:\r\n print(n//q)\r\n k=cg(s,q)\r\n for i in k:\r\n print(i)\r\n elif u==3:\r\n flag=0\r\n for i in range(1,n):\r\n for j in range(1,n):\r\n if p*i+q*j==n:\r\n op=[i,j]\r\n flag=1\r\n break\r\n if flag==1:\r\n \r\n print(sum(op))\r\n \r\n u=cg(s[0:p*op[0]],p)\r\n v=cg(s[p*op[0]:],q)\r\n ko=(u+v)\r\n for i in ko:\r\n print(i)\r\n else:\r\n print(-1) \r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "# https://codeforces.com/contest/612/problem/A\r\n\r\nfrom itertools import count\r\n\r\nn, p, q = map(int, input().split())\r\ns = input()\r\n\r\nfor i in count():\r\n if p * i > n:\r\n nbP = -1\r\n break\r\n elif (n - p * i) % q == 0:\r\n nbP = i\r\n break\r\n\r\nif nbP < 0:\r\n print(-1)\r\nelse:\r\n nbQ = (n - p * nbP) // q\r\n print(nbP + nbQ)\r\n i = 0\r\n for _ in range(nbP):\r\n print(s[i:i + p])\r\n i += p\r\n for _ in range(nbQ):\r\n print(s[i:i + q])\r\n i += q\r\n", "n, p, q = map(int, input().split())\r\nX = []\r\n\r\nwhile n > 0:\r\n if n % p:\r\n n -= q\r\n X.append(q)\r\n else:\r\n X += [p] * (n // p)\r\n break\r\n\r\nif n < 0:\r\n print(-1)\r\nelse:\r\n print(len(X))\r\n s, i = input(), 0\r\n for x in X:\r\n print(s[i:i+x])\r\n i += x", "n, p, q = [int(x) for x in input().split()]\r\ns = input()\r\nfor i in range(0, n + 1):\r\n if (n - i * p < 0):\r\n break\r\n if (n - i * p) % q == 0:\r\n ans = []\r\n for j in range(i):\r\n ans.append(s[j * p: j * p + p])\r\n for j in range((n - i * p) // q):\r\n ans.append(s[p * i + j * q:p * i + j * q + q])\r\n print(len(ans))\r\n for elem in ans:\r\n print(elem)\r\n exit()\r\nprint(-1)\r\n", "n,p,q = [int(x) for x in input().split()]\r\ns = input()\r\n\r\nif p < q:\r\n p,q = q,p\r\n\r\n\r\nfor i in range(0, n // p + 1):\r\n if (n - p * i) % q == 0:\r\n print(i + (n - p*i) // q)\r\n\r\n k = 0\r\n for _ in range(i):\r\n print(s[k:k+p])\r\n k += p\r\n for _ in range((n - p*i) // q):\r\n print(s[k:k+q])\r\n k += q\r\n break\r\nelse:\r\n print(-1)", "#!/usr/bin/python\nimport sys \na,b,c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nst = input()\nfor x in range(100):\n\tfor y in range(100):\n\t\tif((b*x + c*y) == a):\n\t\t\tprint(x + y)\n\t\t\tind = 0\n\t\t\tfor w in range(x):\n\t\t\t\tprint(st[ind:(ind+b)])\n\t\t\t\tind += b\n\t\t\tfor w in range(y):\n\t\t\t print(st[ind:(ind+c)])\n\t\t\t ind += c\n\t\t\tsys.exit()\nprint(-1)\n", "n,p,q=[int(x) for x in input().split()]\ns=input()\ndone=False\nfor i in range(1+n//p):\n if (n-i*p)%q==0:\n print(i+(n-i*p)//q)\n for x in range(i):\n print(s[x*p:(x+1)*p])\n for x in range((n-i*p)//q):\n print(s[i*p+x*q:i*p+(x+1)*q])\n done=True\n break\nif not done:\n print(-1)\n", "def main():\n n, p, q = map(int, input().split())\n if p < q:\n p, q = q, p\n for i in range(n % p, n + 1, p):\n if not i % q:\n break\n else:\n print(\"-1\")\n return\n s = input()\n res = [s[j:j + p] for j in range(0, n - i, p)] + [s[j:j + q] for j in range(n - i, n, q)]\n print(len(res))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "def main():\r\n items=input().split()\r\n n=int(items[0])\r\n p=int(items[1])\r\n q=int(items[2])\r\n s=input()\r\n A=int(n/p)\r\n for a in range(A+1):\r\n forq=n-a*p\r\n if forq%q==0:\r\n b=int(forq/q)\r\n print(a+b)\r\n for i in range(a):\r\n print(s[i*p:(i+1)*p])\r\n for i in range(b):\r\n print(s[a*p+i*q:a*p+(i+1)*q])\r\n return\r\n print(-1)\r\n \r\nif __name__=='__main__':\r\n main()\r\n", "n,p,q=map(int,input().split())\r\ns=input()\r\nfor i in range(101):\r\n for j in range(101):\r\n if p*i+q*j==n:\r\n print(i+j)\r\n for m in range(i):\r\n print(s[:p])\r\n s=s[p:]\r\n for t in range(j):\r\n print(s[:q])\r\n s=s[q:]\r\n quit()\r\nprint(-1)\r\n", "def subset_sum(numbers, target, string, partial=[]):\n s = sum(partial)\n if s == target:\n index = 0\n print(len(partial))\n for x in partial:\n print(string[index:index+x])\n index = index + x\n exit(0)\n\n if s >= target:\n return\n\n for i in range(len(numbers)):\n n = numbers[i]\n remaining = numbers[i:]\n subset_sum(remaining, target, string, partial + [n]) \n\nn, p, q = map(int, input().split())\nstring = input()\nsubset_sum([p, q], n, string)\nprint(\"-1\")\n", "n, p, q = list(map(int,input().split()))\r\ns = input()\r\np, q = max(p,q), min(p,q)\r\na,b = -1, 0\r\nfor i in range(n//p+1):\r\n if (n - i*p)%q==0:\r\n a = i\r\n b = (n-i*p)//q\r\nprint(a+b)\r\nif (a+b)!= -1:\r\n for i in range(a):\r\n print(s[i*p:(i+1)*p])\r\n for i in range(b):\r\n print(s[a*p+i*q:a*p+(i+1)*q])", "def gpc(n, a, b):\n for i, ii in enumerate(range(0,n+1,a)):\n for j, jj in enumerate(range(0,n+1,b)):\n if ii+jj == n:\n return (i,j)\n return None\n\nn, p, q = map(int,input().split())\ns = input()\nr = gpc(n, p, q)\nif r == None:\n print(-1)\nelse:\n print(sum(r))\n for i in range(r[0]):\n print(s[i*p:(i+1)*p])\n for i in range(r[1]):\n print(s[i*q+p*r[0]:(i+1)*q+p*r[0]])\n", "# from dust i have come dust i will be\r\n\r\nn,p,q=map(int,input().split())\r\ns=input()\r\n\r\nx=0\r\nwhile p*x<=n:\r\n if (n-p*x)%q==0:\r\n y=(n-p*x)//q\r\n\r\n print(x+y)\r\n\r\n l=0\r\n while x>0:\r\n x-=1\r\n for i in range(p):\r\n print(s[l],end='')\r\n l+=1\r\n print()\r\n\r\n while y>0:\r\n y-=1\r\n for i in range(q):\r\n print(s[l],end='')\r\n l+=1\r\n print()\r\n\r\n exit(0)\r\n\r\n x+=1\r\n\r\nprint(-1)", "n,p,q=map(int,input().split())\ns=input()\nansp=0\nansq=0\nz=0\nfor i in range(int(n/p)+1):\n if (n-i*p)%q==0:\n ansp=i#p的个数\n ansq=(n-i*p)//q\n z=1\n break\n#print(ansp,ansq)\nif z==0:\n print('-1')\nelse:\n k=0\n print(ansq+ansp)\n while ((ansp==0) + (ansq==0))!=2:\n if ansp!=0:\n print(s[k:k+p])\n ansp-=1\n k=k+p\n else:\n print(s[k:k+q])\n k=k+q\n ansq-=1\n \n", "n,p,q=map(int,input().split())\r\ns=input()\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n if i*p+j*q==n:\r\n print(i+j)\r\n now=0\r\n for k in range(i):\r\n print(s[now:now+p])\r\n now+=p\r\n for k in range(j):\r\n print(s[now:now+q])\r\n now+=q\r\n exit()\r\n\r\nprint(-1)", "x= []\r\nx = input().split()\r\nn = int(x[0])\r\np = int(x[1])\r\nq = int(x[2])\r\ns =\"\"\r\ns = str(input())\r\nif q > p :\r\n y = p\r\n p = q\r\n q = y\r\na = int(n/p)\r\nb = 200\r\nfor x in range(a,-1,-1):\r\n if (n-x*p)%q==0:\r\n a=x\r\n b=int((n-x*p)/q)\r\n break\r\nif b!=200:\r\n print (int(a+b))\r\n for x in range(a):\r\n print (s[x*p:p*(x+1)])\r\n for y in range(b):\r\n print (s[a*p+y*q:q*(y+1)+a*p])\r\nelse:\r\n print (-1)\r\n\r\n\r\n\r\n\r\n", "import sys\r\n \r\nn, p, q = map(int, input().split())\r\ns = input()\r\nfor a in range(n+1):\r\n for b in range(n+1):\r\n if a*p + b*q == n:\r\n print(a+b)\r\n \r\n for i in range(a):\r\n print(s[i*p: i*p + p])\r\n \r\n s = s[a*p:]\r\n \r\n for i in range(b):\r\n print(s[i*q:i*q+q])\r\n \r\n sys.exit(0)\r\n \r\nprint(-1)", "n, p, q = list(map(int, input().split()))\r\ns = input()\r\nK1 = 0\r\nK2 = 0\r\nfor k1 in range(n//p + 1):\r\n for k2 in range(n//q + 1):\r\n if p*k1 + q*k2 == n:\r\n K1 = k1\r\n K2 = k2\r\n break\r\nif not K1 and not K2:\r\n print(-1)\r\nelse:\r\n print(K1+K2)\r\n i = 0\r\n while i < K1*p:\r\n print(s[i:i+p])\r\n i += p\r\n while i < n:\r\n print(s[i:i+q])\r\n i += q", "n, p, q = map(int, input().split(\" \"))\np, q = max(p, q), min(p, q)\ns = input()\n\nn_ = n\nnp = 0\nnq = 0\nif n%p != 0:\n\tif n%q == 0:\n\t\tnq = int(n/q)\n\telse:\n\t\twhile n%q != 0 and n > 0:\n\t\t\tnp += 1\n\t\t\tn -= p\n\t\tnq += int(n/q)\n\t\nelse:\n\tnp = int(n/p)\n\n#print(np, p, nq, q)\n\t\n\nif (np*p + nq*q != n_ or nq < 0):\n\tprint(\"-1\")\nelse:\n\tprint(np+nq)\n\tindex = 0\n\tfor i in range(np):\n\t\tprint(s[index:index+p])\n\t\tindex += p\n\tfor i in range(nq):\n\t\tprint(s[index:index+q])\n\t\tindex += q", "import sys\n\nn,p,q = map(int,sys.stdin.readline().split())\nword = list(input())\n\nsol = -1\n\nfor i in range(0,int(n/p)+1):\n #print(i)\n #print(f'sol={sol}')\n for j in range(0,int(n/q)+1):\n #print(j)\n if((i*p+j*q)==n):\n #print('entre')\n sol = i+j\n print(sol)\n for k in range(0,n):\n sys.stdout.write(word[k])\n if(i and k<i*p and not((k+1)%p) or j and k>=i*p and not((k-i*p+1)%q)):\n print(\"\")\n sys.exit(0)\n if(sol!=-1):\n break\n\nif(sol==-1):\n print('-1')\n", "\n# coding: utf-8\n\n# In[15]:\n\n\ndef textSplitting(n,p,q,s):\n size = n\n cuenta = 0\n while size>=0:\n if size%p == 0:\n break\n cuenta+=1\n size-=q\n \n if size<0:\n print(-1)\n return\n\n cuenta2 = size//p\n print(cuenta + cuenta2)\n \n indx = 0\n for i in range(cuenta2):\n print(s[indx:indx+p])\n indx+=p\n for i in range(cuenta):\n print(s[indx:indx+q])\n indx+=q\n return\n \n\n\na = input().split()\nn = int(a[0])\np = int(a[1])\nq = int(a[2])\ns = input()\n\ntextSplitting(n,p,q,s)\n\n \n\n\n", "import random\r\nimport re\r\nimport string\r\ndef splitBy(strg,div,num):\t\r\n\tinter = list()\r\n\tpointer = 0\t\r\n\tfor i in range(0,div):\r\n\t\tdel inter[:]\r\n\t\tfor it in range(pointer,num +pointer):\r\n\t\t\tinter.append(strg[it])\r\n\t\tpointer += num\r\n\t\tprint(\"\".join(inter))\r\n\r\ndef verifyLinearC(n,p,q):\r\n\tn = n-p\r\n\tnump = 0 \r\n\tnumq = 0\r\n\tnump += 1\t\t\t\r\n\twhile n>p:\r\n\t\tif n%q==0:\r\n\t\t\tnumq = n // q\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tn -= p\r\n\t\t\tnump += 1\r\n\treturn nump,numq\t\t\r\n\r\ndef main():\r\n\tdigit = input()\r\n\tdigit = digit.split()\r\n\tlvet=list()\r\n\tfor num in digit:\r\n\t\tlvet.append(int(num))\r\n\tinter = list()\r\n\t# n = lvet[0]\r\n\t# p = lvet[1]\r\n\t# q = lvet[2]\r\n\ts = input()\r\n\tstrg = []\r\n\tstrg = s[:]\r\n\t\r\n\t#s = ''.join(random.choice(string.ascii_uppercase + string.digits) for _ in range(random.randint(1,100)))\r\n\t#strg = []\r\n\t#strg = s[:]\r\n\t#lvet = [len(strg),random.randint(1,len(strg)),random.randint(1,100)]\r\n\t#print(lvet[0],lvet[1],lvet[2])\r\n\r\n\tdivp = lvet[0] // lvet[1] if lvet[0]%lvet[1]==0 else 0\r\n\tdivq = lvet[0] // lvet[2] if lvet[0]%lvet[2]==0 else 0\r\n\tif lvet[1]<=lvet[0] or lvet[2]<=lvet[0]:\r\n\t\tif divp!=0:\t\r\n\t\t\tprint(divp)\t\t\r\n\t\t\tsplitBy(strg,divp,lvet[1])\t\t\r\n\t\telif divq!=0:\r\n\t\t\tprint(divq)\t\t\t\r\n\t\t\tsplitBy(strg,divq,lvet[2])\r\n\t\telif lvet[1]+lvet[2]==lvet[0]:\t\t\t\r\n\t\t\tprint(2)\r\n\t\t\tdel inter[:]\r\n\t\t\tfor i in range(0,lvet[1]):\r\n\t\t\t\tinter.append(strg[i])\r\n\t\t\tprint (''.join(inter),sep=\"\")\r\n\t\t\tdel inter[:]\r\n\t\t\tfor i in range(lvet[1],lvet[0]):\r\n\t\t\t\tinter.append(strg[i])\r\n\t\t\tprint (''.join(inter),sep=\"\")\r\n\t\telse:\t\t\t\r\n\t\t\tnump,numq = verifyLinearC(lvet[0],lvet[1],lvet[2])\t\t\t\t\t\r\n\t\t\tif numq*lvet[2]+nump*lvet[1] == lvet[0]:\r\n\t\t\t\tprint(numq+nump)\r\n\t\t\t\tsplitBy(strg,nump,lvet[1])\r\n\t\t\t\tstrg = strg[nump*lvet[1]:]\r\n\t\t\t\tsplitBy(strg,numq,lvet[2])\r\n\t\t\telse:\r\n\t\t\t\tnump,numq = verifyLinearC(lvet[0],lvet[2],lvet[1])\r\n\t\t\t\tif numq*lvet[1]+nump*lvet[2] == lvet[0]:\r\n\t\t\t\t\tprint(numq+nump)\r\n\t\t\t\t\tsplitBy(strg,numq,lvet[1])\r\n\t\t\t\t\tstrg = strg[numq*lvet[1]:]\t\t\t\t\t\r\n\t\t\t\t\tsplitBy(strg,nump,lvet[2])\t\t\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint(\"-1\",sep=\"\")\r\n\r\n\r\nmain()", "n,a,b=map(int,input().split())\r\ns=input()\r\nvisited=[False for i in range(1000)]\r\nq=[[] for i in range(1000)]\r\nvisited[0]=True\r\nfor i in range(n) :\r\n if visited[i] :\r\n if visited[i+a]==False:\r\n visited[i+a]=True\r\n q[i+a]=q[i]+[a]\r\n if visited[i+b]==False :\r\n visited[i+b]=True\r\n q[i+b]=q[i]+[b]\r\n\r\nif sum(q[n])==n :\r\n print(len(q[n]))\r\n pr=0\r\n for x in q[n] :\r\n print(s[pr:(x+pr)])\r\n pr=x+pr\r\nelse :\r\n print(-1)", "#A. The Text Slitting\r\nn, p, q = input().split()\r\nn = int(n)\r\np = int(p)\r\nq = int(q)\r\ns = input()\r\n\r\nfor i in range(101):\r\n for j in range(101):\r\n if (i * p + j * q == n):\r\n print(i + j)\r\n for a in range (i):\r\n print(s[a * p : (a + 1) * p])\r\n for b in range (j):\r\n print(s[i * p + b * q : i * p + (b + 1) * q])\r\n exit()\r\nprint(\"-1\")", "inp = input().split(\" \")\r\nn = int(inp[0])\r\np = int(inp[1])\r\nq = int(inp[2])\r\ns = input()\r\n\r\nx = y = 0\r\nfor i in range(1, n // p + 1):\r\n if (n - p * i) % q == 0:\r\n x = i\r\n y = (n - p * i) // q\r\n\r\nif x == 0 and y == 0:\r\n for i in range(1, n // q + 1):\r\n if (n - q * i) % p == 0:\r\n y = i\r\n x = (n - q * i) // p\r\n\r\n\r\nif x == 0 and y == 0:\r\n print(-1)\r\n\r\nelse:\r\n print(x + y)\r\n for i in range(x):\r\n print(s[i*p:i*p+p])\r\n\r\n for j in range(y):\r\n print(s[x*p+j*q:x*p+j*q+q])\r\n", "n, p, q = map(int, input().split())\r\ns = input()\r\nans = []\r\nwhile len(s) % q != 0:\r\n if len(s) < p:\r\n print(-1)\r\n exit(0)\r\n ans.append(s[:p])\r\n s = s[p:]\r\nwhile len(s) > 0:\r\n ans.append(s[:q])\r\n s = s[q:]\r\nprint(len(ans))\r\nprint('\\n'.join(ans))\r\n", "n,p,q=map(int,input().split())\r\na,b,f=0,0,0\r\nst=input()\r\nfor v in range(0,n+1):\r\n for u in range(0,n+1):\r\n if v*p + u*q == n:\r\n a=v\r\n b=u\r\n f=1\r\n break\r\nif f==0:\r\n print(\"-1\")\r\n quit()\r\nprint(a+b)\r\nx=0\r\nwhile x < n:\r\n if a>0:\r\n print(st[x:x+p])\r\n x=x+p\r\n a=a-1\r\n else:\r\n print(st[x:x+q])\r\n x=x+q \r\n", "n,p,q=map(int,input().split())\r\ns=list(input())\r\nif n%q==0:\r\n count=n//q\r\n print(count)\r\n i=0\r\n while(i<n):\r\n print(''.join(s[i:i+q]))\r\n i=i+q\r\nelif n%p==0:\r\n count=n//p\r\n print(count)\r\n i=0\r\n while(i<n):\r\n print(''.join(s[i:i+p]))\r\n i=i+p\r\nelse:\r\n c=n//p\r\n flag=0\r\n for i in range(1,c+1):\r\n if ((n-p*i)/q).is_integer():\r\n flag=1\r\n j=int((n-p*i)/q)\r\n print(i+j)\r\n break\r\n if flag==0:\r\n print(-1)\r\n else:\r\n count=0\r\n t=0\r\n while(count<i):\r\n print(''.join(s[t:t+p]))\r\n t=t+p\r\n count=count+1\r\n count=0\r\n while(count<j):\r\n print(''.join(s[t:t+q]))\r\n t=t+q\r\n count=count+1\r\n \r\n \r\n ", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\ndef read_list():\n return [int(i) for i in input().split()]\ndef new_list(n):\n return [0 for i in range(n)]\n\nn, p, q = read_list()\n\ns = input()\n\nl, r = -1, -1\n\nfor i in range(n+1):\n for j in range(n+1):\n if i*p + j*q == n:\n l = i\n r = j\nns = []\n\nif l == -1:\n print(-1)\n exit()\n\nfor i in range(0, l*p, p):\n ns.append(s[i:i+p])\nfor i in range(l*p, n, q):\n ns.append(s[i:i+q])\n\nprint(len(ns))\nfor n in ns:\n print(n)\n", "n, p, q = map(int, input().split())\r\ns = input()\r\nfor i in range(n // p + 1):\r\n for j in range(n // q + 1):\r\n if i * p + j * q == n:\r\n print(i + j)\r\n for k in range(i):\r\n print(s[k * p: (k + 1) * p])\r\n for k in range(j):\r\n print(s[i * p + k * q: i * p + (k + 1) * q])\r\n exit()\r\nprint(-1)\r\n", "n, p, q = map(int, input().split())\r\ns = input()\r\n\r\nk1 = 0\r\nk = 0\r\n\r\nr = n // p\r\n\r\nfor i in range(r, -1, -1):\r\n if (n - p * i) % q == 0:\r\n k1 = i\r\n k = k1 + ((n - p * i) // q)\r\n\r\n\r\nif k == 0:\r\n print(-1)\r\nelse:\r\n print(k)\r\n for i in range(k1):\r\n print (s[i*p: (i+1)*p])\r\n for i in range(k - k1):\r\n print (s[p*k1 + i*q: p*k1 + (i + 1)*q])\r\n", "a,b,c = map(int, input().split())\r\ns = input()\r\nn1 = -1\r\nn2 = -1\r\nfor i in range(102):\r\n if a-b*i == 0:\r\n n1 = i\r\n n2 = 0\r\n break\r\n if a-b*i > 0:\r\n if (a-b*i)%c==0:\r\n n1 = i\r\n n2 = (a-b*i)//c\r\nif n1 == -1:\r\n print(-1)\r\n exit()\r\nind = 0\r\nprint(n1+n2)\r\nfor i in range(n1):\r\n print(s[ind:ind+b])\r\n ind += b\r\nfor i in range(n2):\r\n print(s[ind:ind+c])\r\n ind += c\r\n", "import sys\nfirst=input().split()\nx=int(first[0])\na=int(first[1])\nb=int(first[2])\n\ntxt=input() #ya esta indexado\n#print(txt)\nresults=[]\ndef dividirParejo(txt, z, until, cant):\n #print(\"Estoy en dividir\")\n print(until+cant)\n p=0\n x=0\n i=0\n while i<until:\n results.append(txt[x:p+z])\n p=p+z\n x=p\n i=i+1\n for p in results: print(p)\n\ndef aver(txt, A, B):\n if A>B:\n a=B\n b=A\n else:\n a=A\n b=B\n cant=0\n paro=False\n state=4 # 2 no hay solucion, 3 hay solucion, 4 sigue buscando\n inicio=0\n while state==4:\n if a+b == (len(txt)-inicio):\n #print(\"ultimos dos\")\n cant=cant+2\n #print(cant)\n #print(txt[inicio:inicio+a])\n results.append(txt[inicio:inicio+a])\n #print(txt[inicio+a:inicio+a+b])\n results.append(txt[inicio+a:inicio+a+b])\n state=3\n elif(len(txt)-inicio<0): #lo que me resta del txt -a <0\n state=2\n print(-1)\n elif (len(txt)-inicio)%a==0:\n state=5\n z=(len(txt)-inicio)//a\n #print(type(txt[inicio: len(txt)]))\n #print(type(a))\n #print(type(z))\n #print(type(cant))\n dividirParejo(txt[inicio: len(txt)],a,z, cant)\n elif (len(txt)-inicio)%b==0:\n state=5\n z=(len(txt)-inicio)//b\n #print(type(txt[inicio: len(txt)]))\n #print(type(a))\n #print(type(z))\n #print(type(cant))\n dividirParejo(txt[inicio: len(txt)],b,z, cant)\n else:\n #print(\"fghjk___________________________\")\n cant=cant+1\n #print(txt[inicio:inicio+a])\n results.append(txt[inicio:inicio+a])\n inicio = inicio+a\n\n if state==3:\n print(cant)\n for p in results: print(p)\n\nif x%a==0:\n z=x//a\n dividirParejo(txt,a, z,0)\nelif x%b==0:\n z=x//b\n dividirParejo(txt,b, z,0)\nelse:\n #print(\"hay que ver\")\n #print(type(txt))\n #print(type(a))\n #print(type(b))\n aver(txt, a, b)\n", "import sys\r\n\r\nn, p, q = map(int, input().split())\r\ns = input()\r\n\r\nfor i in range(101):\r\n if p*i <= n and (n - p*i) % q == 0:\r\n x = i\r\n y = (n - p*i) // q\r\n print(x + y)\r\n\r\n j = 0\r\n for _ in range(x):\r\n print(s[j:j+p])\r\n j += p\r\n for _ in range(y):\r\n print(s[j:j+q])\r\n j += q\r\n break\r\nelse:\r\n print(-1)\r\n", "n, p, q = map(int, input().split())\r\ns = input()\r\nfor i in range(n // p + 1):\r\n if (n - i * p) % q == 0:\r\n print(i + (n - i * p) // q)\r\n for j in range(i):\r\n print(s[j * p:j * p + p])\r\n for j in range((n - i * p) // q):\r\n print(s[i * p + j * q: i * p + j * q + q])\r\n exit()\r\nprint(-1)", "n, p, q = map(int, input().split())\ns = str(input())\nfor i in range(101):\n for j in range(101):\n if p*i+q*j == n:\n ans = []\n for k in range(i):\n ans.append(s[p*k:p*(k+1)])\n for l in range(j):\n ans.append(s[p*i+q*l:p*i+q*(l+1)])\n print(len(ans))\n for m in range(len(ans)):\n print(ans[m])\n exit()\nelse:\n print(-1)\n", "\r\nn, p, q = map(int, input().split())\r\nl = list(input())\r\n\r\nfor i in range(n // p + 1):\r\n\tco = 1\r\n\tfor j in range(n // q + 1):\r\n\t\tif i * p + j * q == n:\r\n\t\t\tco = 0\r\n\t\t\tbreak\r\n\tif co == 0:\r\n\t\tbreak\r\n\r\nelse:\r\n\tprint(-1)\r\n\texit()\r\n\r\nprint(i + j)\r\nfor k in range(i):\r\n\tli = l[k * p : (k + 1) * p]\r\n\tprint(*li, sep = '')\r\n\tco = (k + 1) * p\r\n\r\n\r\nfor k in range(j):\r\n\tli = l[co + k * q: co + (k + 1) * q]\r\n\tprint(*li , sep = '')\r\n\r\n", "import sys\n# fin = open(\"ecr4a.in\", \"r\")\nfin = sys.stdin\n\nn, p, q = map(int, fin.readline().split())\ns = fin.readline().rstrip()\n\n\nkp, kq = None, None\nfor i in range(0, n // p + 1):\n if not (n - i*p) % q:\n kp, kq = i, (n - i*p) // q\n break\nelse:\n print(-1)\n exit(0)\n\nprint(kp+kq)\ncpos, m = 0, p*kp\nwhile (cpos < m):\n print(s[cpos:cpos + p])\n cpos += p\nwhile (cpos < n):\n print(s[cpos:cpos + q])\n cpos += q", "n, p, q = map(int, input().split())\r\ns = input()\r\nf = 0\r\nfor i in range(0, 101):\r\n for j in range(0, 101):\r\n if p * i + q * j == n:\r\n f = 1\r\n print(i + j)\r\n P = 0\r\n for x in range(p, p * i + 1, p):\r\n print(s[P:x])\r\n P = x\r\n for x in range(q + P, n + 1, q):\r\n print(s[P:x])\r\n P = x\r\n break\r\n if f: break\r\nif f ^ 1:\r\n print(-1)\r\n", "import math \n\nn, p, q = tuple(int(x) for x in input().split())\nword = input()\n\ndef counts(n, p, q):\n for i in range(math.ceil((n + 1) / p)):\n if (n - p * i) % q == 0:\n return (i, (n - p * i) // q)\n return None\n\ndef solve(n, p, q, word):\n _counts = counts(n, p, q)\n if _counts == None:\n print(-1)\n return\n i, j = _counts\n print(i + j)\n for ii in range(i):\n print(word[ii * p : ii * p + p])\n for jj in range(j):\n print(word[i * p + jj * q : i * p + jj * q + q])\n\nsolve(n, p, q, word)\n", "n,p,q=map(int,input().split());tmp=0;fl=0;m=0\r\nif (p>q):\r\n tmp=p\r\n p=q\r\n q=tmp\r\ns=input()\r\ntk=0;tb=0;\r\nif ((p>n) and (q>n)):\r\n print(-1)\r\nelif(n%q==0):\r\n print(n//q)\r\n for i in range(n//q):\r\n print(s[i*q:i*q+q])\r\nelif(n%p==0):\r\n print(n//p)\r\n for i in range(n//p):\r\n print(s[i*p:i*p+p]) \r\nelse:\r\n while((n%q!=0) and (n>0)):\r\n tk+=1\r\n n-=p\r\n if (n<0):\r\n print(-1)\r\n else:\r\n tb=n//q\r\n print(tk+tb)\r\n for i in range(tk):\r\n print(s[m:m+p])\r\n m+=p\r\n for i in range(tb):\r\n print(s[m:m+q])\r\n m+=q\r\n \r\n \r\n", "n , p , q = (list)(map(int , input().split()))\r\ns = input()\r\na , b = (-1 , -1)\r\nfor _ in range(n + 1) :\r\n remain = n - _ * p\r\n if remain % q == 0 and remain >= 0 :\r\n a = _ \r\n b = remain // q\r\n break\r\n \r\nif a == -1 : print(-1) \r\nelse :\r\n print(a + b)\r\n index = 0\r\n while a > 0 :\r\n print(s[index : index + p])\r\n index += p\r\n a -= 1\r\n while b > 0 :\r\n print(s[index : index + q])\r\n index += q\r\n b -= 1", "n,p,q=map(int,input().split())\r\ns=input()\r\na,b=0,0\r\nwhile(n>=b*q):\r\n if((n-b*q)%p==0):\r\n a=(n-b*q)/p\r\n break;\r\n b+=1;\r\nif(n<b*q):\r\n print(\"-1\")\r\nelse:\r\n print(int(a+b))\r\n i=0;\r\n while(a>0):\r\n print(s[i:p+i])\r\n a-=1\r\n i+=p\r\n while(b>0):\r\n print(s[i:q+i])\r\n b-=1\r\n i+=q", "n, p, q = map(int, input().split())\r\ns = input()\r\ndp = [0] * (n + 1)\r\ndp[0] = 1\r\nans = []\r\nfor i in range(n + 1):\r\n if i - q >= 0 and dp[i - q]:\r\n dp[i] = q\r\n if i - p >= 0 and dp[i - p]:\r\n dp[i] = p\r\nif dp[n] == 0:\r\n print(-1)\r\nelse:\r\n j = n\r\n while j >0 and dp[j] != 0:\r\n ans.append(dp[j])\r\n j = j - dp[j]\r\n print(len(ans))\r\n st = 0\r\n for i in ans:\r\n print(s[st:st + i])\r\n st += i\r\n \r\n \r\n", "n , p ,q = map(int,input().split())\r\ns = input()\r\n\r\nflag = False\r\n\r\nfor i in range(100):\r\n for j in range(100):\r\n if( i*p + j*q == n):\r\n store = ( i , j )\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n\r\nif not flag:\r\n print(-1)\r\nelse:\r\n print(i+j)\r\n\r\n x = 0\r\n \r\n for k in range(i):\r\n print(s[x:x+p])\r\n x += p\r\n\r\n for k in range(j):\r\n print(s[x:x+q])\r\n x += q\r\n", "def ft():\r\n\tn, p, q = map(int,input().split())\r\n\tch = input()\r\n\tfor k in range(n):\r\n\t\tif n-k*p < 0:\r\n\t\t\tbreak\r\n\t\tif (n-k*p)%q==0:\r\n\t\t\tz = (n-k*p)//q\r\n\t\t\tcp=0\r\n\t\t\tT=[]\r\n\t\t\tfor i in range(k):\r\n\t\t\t\tT.append(ch[cp:cp+p])\r\n\t\t\t\tcp += p\r\n\t\t\tfor i in range(z):\r\n\t\t\t\tT.append(ch[cp:cp+q])\r\n\t\t\t\tcp += q\r\n\t\t\tprint(len(T))\r\n\t\t\tfor j in T:\r\n\t\t\t\tprint(j)\r\n\t\t\treturn\r\n\tprint(-1)\r\n\r\nft()", "import sys\r\n#import random\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**6)\r\nfrom queue import PriorityQueue\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\nmod = 10**9 + 7\r\n\r\nn,p,q = il()\r\ns = ip()\r\n\r\nfor i in range (102) :\r\n for j in range (102) :\r\n if (p*i + q*j) == n :\r\n print(i+j)\r\n m = 0\r\n for k in range (i) :\r\n print(s[m:m+p])\r\n m += p\r\n\r\n for k in range (j) :\r\n print(s[m:m+q])\r\n m+=q\r\n\r\n exit(0)\r\n\r\nprint(-1)\r\n", "from math import sqrt\r\n\r\n\r\n\r\ndef main():\r\n n,p,q = [int(v) for v in input().split()]\r\n d = input()\r\n\r\n data=[-1 for _ in range(n+102)]\r\n parent = [-1 for _ in range(n+102)]\r\n data[0]=1\r\n for i in range(0, n+1):\r\n if data[i]!=-1:\r\n data[i+p]=1\r\n parent[i+p]=i\r\n data[i+q]=1\r\n parent[i+q]=i\r\n if data[n]!=1:\r\n print(-1)\r\n else:\r\n res = []\r\n cur = n\r\n c = parent[n]\r\n while c!=0:\r\n res.append(d[c:cur])\r\n t = c\r\n cur=c\r\n c = parent[t]\r\n res.append(d[c:cur])\r\n print(len(res))\r\n for d in reversed(res):\r\n print(d)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\nn, p, q = map(int, input().split())\r\ns = input()\r\nfor i in range(n // p + 1):\r\n v = n - i * p\r\n if v % q == 0:\r\n ans = []\r\n pos = 0\r\n for j in range(i):\r\n ans.append(s[pos:pos + p])\r\n pos += p\r\n for j in range(v // q):\r\n ans.append(s[pos:pos + q])\r\n pos += q\r\n print(len(ans))\r\n for j in ans:\r\n print(j)\r\n exit(0)\r\nprint(-1)\r\n\r\n \r\n\r\n\r\n \r\n", "N, P, Q = map(int, input().split())\r\nS = input()\r\n\r\nflag = False\r\n\r\nfor i in range(101):\r\n for j in range(101):\r\n if i * P + j * Q == N:\r\n flag = True\r\n p = i\r\n q = j\r\n\r\nif flag:\r\n print(p + q)\r\n\r\n while p:\r\n print(S[:P])\r\n S = S[P:]\r\n p -= 1\r\n\r\n while q:\r\n print(S[:Q])\r\n S = S[Q:]\r\n q -= 1\r\n\r\nelse:\r\n print(-1)", "n,p,q=map(int, input().split(\" \"))\r\ns = input()\r\nasdf = False\r\nfor i in range(n//p+1):\r\n for j in range((n-i*p)//q+1):\r\n if i*p+j*q == n and asdf == False:\r\n print(i+j)\r\n asdf = True\r\n for a in range(i):\r\n print(s[a*p:(a+1)*p])\r\n for b in range(j):\r\n print(s[p*i+b*q:p*i+(b+1)*q])\r\nif asdf == False:\r\n print(-1)\r\n \r\n", "n, p, q = map(int, input().split())\r\ns = input()\r\n\r\nfor i in range(n//p+1):\r\n for j in range(n//q+1):\r\n if i*p + j*q == n:\r\n print(i+j)\r\n x = 0\r\n cnt = 0\r\n while cnt < i:\r\n print(s[x:x+p])\r\n x += p\r\n cnt += 1\r\n cnt = 0\r\n while cnt < j:\r\n print(s[x:x+q])\r\n x += q\r\n cnt += 1\r\n exit()\r\nprint(\"-1\")", "n, p, q = map(int, input().split())\r\nstring = input()\r\n\r\nfor i in range(101):\r\n for j in range(101):\r\n if p * i + q * j == n:\r\n print(i + j)\r\n for idx in range(i):\r\n print(string[idx * p:(idx + 1) * p])\r\n for idx in range(j):\r\n print(string[p * i + idx * q:p * i + (idx + 1) * q])\r\n exit(0)\r\n\r\nprint(-1)\r\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN,P,Q=map(int,readline().split())\r\nS=readline().rstrip()\r\nfor cntP in range(N+1):\r\n for cntQ in range(N+1):\r\n if P*cntP+Q*cntQ==N:\r\n print(cntP+cntQ)\r\n for p in range(cntP):\r\n print(S[P*p:P*(p+1)])\r\n for q in range(cntQ):\r\n print(S[P*cntP+Q*q:P*cntP+Q*(q+1)])\r\n exit()\r\nprint(-1)", "n, p, q = map(int, input().split(' ')[:3])\r\ns = input()[:n]\r\n\r\na = 0\r\nb = 0\r\n\r\nwhile True:\r\n if a * p + b * q == n:\r\n break\r\n a += 1\r\n if a * p > n:\r\n a = 0\r\n b += 1\r\n if b * q > n:\r\n print(-1)\r\n exit(0)\r\n\r\nprint(a + b)\r\n\r\nz = 0\r\nfor i in range(a):\r\n print(s[z:z+p])\r\n z += p\r\n\r\nfor i in range(b):\r\n print(s[z:z+q])\r\n z += q", "import sys\r\nn,p,q = map(int, input().split())\r\ns = input()\r\nfor i in range(0,101):\r\n for j in range(0,101):\r\n if p * i + q * j == n:\r\n print(i + j)\r\n for o in range(0,i):\r\n print(s[o*p: (o +1) *p])\r\n s = s[i*p:]\r\n for o in range(0,j):\r\n print(s[o*q: (o +1) *q])\r\n sys.exit()\r\nprint(-1)", "INF = 10000\r\n\r\nn, p, q = map(int, input().split())\r\ns = input()\r\nres = []\r\nexit_flag = False\r\n\r\nfor i in range(INF):\r\n\tif exit_flag:\r\n\t\tbreak\r\n\tfor j in range(INF):\r\n\t\tsize = i*p + j*q\r\n\t\tif size == n:\r\n\t\t\tfor auxi in range(i):\r\n\t\t\t\tres.append(s[:p])\r\n\t\t\t\ts = s[p:]\r\n\t\t\tfor auxj in range(j):\r\n\t\t\t\tres.append(s[:q])\r\n\t\t\t\ts = s[q:]\r\n\t\t\tprint(len(res))\r\n\t\t\tfor word in res:\r\n\t\t\t\tprint(word)\r\n\t\t\texit(0)\r\n\t\tif i*p > n and j*p > n:\r\n\t\t\texit_flag = True\r\n\t\t\tbreak\r\n\r\nprint(-1)", "n,p, q = map(int,input().split())\r\nword = input()\r\nx, y = 0,0\r\nif n%p == 0:\r\n x = n//p\r\nelif n%q == 0:\r\n y = n//q\r\nif x or y:\r\n pass\r\nelse:\r\n i = 1\r\n while (n-i*q)>=p:\r\n if (n-i*q)%p ==0:\r\n y = i\r\n x = (n-i*q)//p\r\n break\r\n i += 1\r\n j = 1\r\n if y==0:\r\n while (n-j*p)>=q:\r\n if (n-j*p)%q ==0:\r\n y = j\r\n x = (n-j*p)//q\r\n break\r\n j += 1\r\nif x>=0 and y>=0 and (x or y):\r\n print(x+y)\r\n for i in range(x):\r\n print(word[i*p:p+i*p])\r\n for j in range(y):\r\n print(word[x*p+j*q:x*p+j*q+q])\r\nelse:\r\n print(-1)", "def start():\r\n ss=[]\r\n c=0\r\n\r\n n,p,q=map(int,input().split())\r\n s=input()\r\n k=n%max(p,q)\r\n mx=max(p,q)\r\n mn=min(q,p)\r\n d1 = 0\r\n d2 = mn\r\n while n>0:\r\n\r\n if n%mx==0:\r\n dd1 = d1\r\n dd2 = d1 + mx\r\n for j in range(n//mx):\r\n ss.append(s[dd1:dd2])\r\n n-=mx\r\n c+=1\r\n dd1 += mx\r\n dd2 += mx\r\n if n==0:\r\n break\r\n if n==0:\r\n break\r\n ss.append(s[d1:d2])\r\n n -= mn\r\n c+=1\r\n d1+=mn\r\n d2+=mn\r\n #f=''.join(ss)\r\n\r\n for i in range(c):\r\n if len(ss[i])!=p and len(ss[i])!=q:\r\n print(-1)\r\n return\r\n print(c)\r\n for i in ss:\r\n print(i)\r\nstart()\r\n", "import sys\r\nn, p, q = list(map(int, input().split()))\r\ns = input()\r\nfor a in range(n + 1):\r\n\tfor b in range(n + 1):\r\n\t\tif a * p + b * q == n:\r\n\t\t\tprint(a + b)\r\n\t\t\tfor i in range(a):\r\n\t\t\t\tprint(s[i * p : i * p + p])\r\n\t\t\ts = s[p * a:]\r\n\t\t\tp = q\r\n\t\t\ta = b\r\n\t\t\tfor i in range(a):\r\n\t\t\t\tprint(s[i * p : i * p + p])\r\n\t\t\tsys.exit(0)\t\t\t\r\nprint(\"-1\")", "data = input().split()\r\nn, k, l = [int(item) for item in data]\r\n\r\ns = input()\r\nj = -1\r\n\r\ni = 0\r\nwhile (i * k <= n):\r\n if (n-k*i) % l == 0:\r\n j = (n-k*i) // l\r\n break\r\n i += 1\r\n\r\nif j == -1:\r\n print(-1)\r\nelse:\r\n print(i + j)\r\n for idx in range(i):\r\n print(s[idx * k : (1+idx) * k])\r\n for idx in range(j):\r\n print(s[k*i + idx*l : k*i + (1+idx)*l])", "n,p,q=map(int,input().split())\r\n\r\ns=input()\r\n\r\nl=list()\r\n\r\nwhile len(s):\r\n if len(s)%p!=0 and len(s)>=q:\r\n l.append(s[0:q])\r\n s=s[q:]\r\n elif len(s)%p==0 and len(s)>=p:\r\n l.append(s[0:p])\r\n s=s[p:]\r\n else:\r\n break\r\nif len(s):\r\n print(-1)\r\nelse:\r\n print(len(l))\r\n for x in l:\r\n print(x)\r\n", "sn = list(map(int,input().split()))\r\nn = sn[0]\r\np = sn[1]\r\nq = sn[2]\r\n\r\ns = input()\r\n\r\nlim = 0\r\nflag = False\r\nflag2 = False\r\nstrings = []\r\nwhile(lim <= n):\r\n if((n - lim)%p == 0):\r\n flag = True\r\n break\r\n elif((n - lim)%q == 0):\r\n flag = True\r\n break\r\n lim += p\r\n\r\nlim = 0\r\nif(flag):\r\n # keep with p\r\n while((n - lim)%q != 0 and n - lim >= 0):\r\n strings.append(s[lim:lim+p])\r\n lim+=p\r\n \r\n # now with q\r\n while(n - lim >= 0):\r\n strings.append(s[lim:lim+q])\r\n lim+=q\r\n flag2 = True\r\n \r\n if(flag2):\r\n lim-=q\r\n else:\r\n lim-=p\r\n \r\n if(n - lim != 0):\r\n print(-1)\r\n else:\r\n print(len(strings) - 1)\r\n for i in strings:\r\n print(i)\r\nelse:\r\n print(-1)\r\n", "n, p, q = map(int, input().split())\r\ns = input()\r\nfor x in range(0,100):\r\n for y in range(0, 100):\r\n if x*p + y*q == n:\r\n print(x+y)\r\n at = 0\r\n for _ in range(x):\r\n print(s[at:at+p])\r\n at += p\r\n for _ in range(y):\r\n print(s[at:at+q])\r\n at += q\r\n exit(0)\r\nprint(-1)\r\n", "import os\r\n\r\nn,p,q=map(int,input().split())\r\ns=input()\r\nz=0\r\nfor i in range(0,n+1):\r\n\tif (n-i*p)%q==0 and (n-i*p)>=0:\r\n#\t\tprint(i,(n-i*p)//q)\r\n\t\tprint(i+(n-i*p)//q)\r\n\t\tk=0\r\n\t\tfor j in range(i):\r\n\t\t\tprint(s[k:k+p])\r\n\t\t\tk+=p\r\n\t\tfor j in range((n-i*p)//q):\r\n\t\t\tprint(s[k:k+q])\r\n\t\t\tk+=q\r\n\t\tz=1\r\n\t\tbreak\r\nif z==0:\r\n\tprint(\"-1\")\r\n", "n, p, q = map(int, input().split())\r\nm = n\r\na, b = 0, 0\r\ns = input()\r\nwhile n >= 0:\r\n if n % p == 0:\r\n a = n//p\r\n b = (m - n) // q\r\n break\r\n else:\r\n n -= q\r\nif a + b == 0:\r\n print(-1)\r\n exit()\r\nprint(a + b)\r\n\r\nfor i in range(a):\r\n print(s[i * p:(i+1) * p])\r\nc = a * p\r\nfor i in range(b):\r\n print(s[i * q + c:(i+1) * q + c])\r\n", "def pr(x):\r\n print(int(n/x))\r\n for i in range(int(n/x)):\r\n print(s[i*x:(i+1)*x])\r\nn,p,q=map(int,input().split())\r\ns=input()\r\nif n%p==0:\r\n pr(p)\r\nelif n%q==0:\r\n pr(q)\r\nelse:\r\n for i in range(1,int(n/p)+1):\r\n if (n-p*i)%q==0:\r\n print(i+int((n-p*i)/q))\r\n for j in range(i):\r\n print(s[j*p:(j+1)*p])\r\n for j in range(int((n-p*i)/q)):\r\n print(s[i*p+j*q:i*p+(j+1)*q])\r\n break\r\n else:\r\n print(\"-1\")\r\n \r\n", "# n = int(input())\n# w, h = map(int, input().split())\n# to_zero_based = lambda x: int(x) - 1\nfrom collections import defaultdict\n\ndef main():\n n, p, q = map(int, input().split())\n s = input()\n\n exsited = set()\n for i in range(0, n + 1, p):\n rem = (n - i) % q\n if rem == 0:\n front = s[:i]\n back = s[i:]\n ss = [front[j:j+p] for j in range(0, i, p)] + [back[j:j+q] for j in range(0, n - i, q)]\n print(len(ss))\n print('\\n'.join(ss))\n return\n if rem in exsited:\n break\n exsited.add(rem)\n\n print(-1)\n\nmain()\n", "a,b,c=map(int,input().split())\r\nz=input()\r\nfor i in range(0,101,b):\r\n for j in range(0,101,c):\r\n if i+j==a:\r\n print(i//b+j//c);f=0;k=i//b;k1=j//c;i=0\r\n while k or k1:\r\n if k:print(z[f:f+b]);f+=b;k-=1\r\n else:print(z[f:f+c]);f+=c;k1-=1\r\n exit()\r\nprint(-1)", "def gcd(a,b):\r\n if b==0:\r\n return a \r\n return gcd(b,a%b)\r\nn,a,b=map(int,input().split())\r\ns=input()\r\nansa=-1 \r\nansb=-1 \r\nfor i in range(0,101):\r\n for j in range(0,100):\r\n if a*i+b*j==n:\r\n ansa=i \r\n ansb=j \r\n break\r\nif ansa==-1 and ansb==-1:\r\n print(-1)\r\n exit()\r\nans=[a]*ansa+[b]*ansb\r\nprev=0 \r\nprint(len(ans))\r\nfor i in ans:\r\n print(s[prev:prev+i])\r\n prev+=i ", "n,p,q=map(int,input().split())\r\ns=input()\r\nfor i in range(111):\r\n for j in range(111):\r\n if p*i+q*j==n:\r\n n=-1\r\n print(i+j)\r\n for l in range(i):\r\n print(s[:p])\r\n s=s[p:]\r\n for l in range(j):\r\n print(s[:q])\r\n s=s[q:]\r\nif n!=-1:\r\n print(-1)", "def gaseste(a,b,n):\r\n gasit = False\r\n k = 0\r\n while k * a <= n and not gasit:\r\n p = 0\r\n while (p * b) + (k*a) <= n and not gasit:\r\n if (p*b)+(k*a) == n:\r\n gasit = True\r\n else:\r\n p+=1\r\n if not gasit:\r\n k+=1\r\n return (-1,-1) if not gasit else (k,p)\r\n \r\n \r\n\r\nn,p,q = map(int,input().split())\r\ns = input()\r\na,b = gaseste(p,q,n)\r\nif (a,b) != (-1,-1):\r\n i = 0\r\n print(a+b)\r\n while a > 0:\r\n print(s[i:i+p])\r\n i+=p\r\n a -=1\r\n while b>0:\r\n print(s[i:i+q])\r\n i+=q\r\n b-=1\r\nelse:\r\n print(-1)\r\n \r\n", "n,p,q = map(int,input().split())\r\ns = input()\r\n\r\nfor i in range(0,n//p+1):\r\n if (n-i*p)%q==0:\r\n print(i + (n-i*p)//q)\r\n for x in range(0,i):\r\n ss = s[:p]\r\n print(ss)\r\n s = s[p:]\r\n for x in range(0,(n-i*p)//q):\r\n ss = s[:q]\r\n print(ss)\r\n s = s[q:] \r\n exit() \r\nprint(-1)\r\n \r\n ", "n, p, q = map(int, input().split())\r\ns = input()\r\ndef f(s):\r\n for i in range(n // p + 2):\r\n for j in range(n // q + 2):\r\n if i*p + j*q == n:\r\n print(i + j)\r\n for k in range(i):\r\n print(s[k*p:k*p+p])\r\n for k in range(j):\r\n print(s[i*p + k*q:i*p+k*q+q])\r\n return 1\r\nif f(s) != 1: print(-1)\r\n", "from sys import exit\r\n\r\nn, p, q = map(int, input().split())\r\ns = input()\r\n\r\n\r\nnum1 = n//p+1\r\nnum2 = n//q+1\r\n\r\nfor i in range(num1):\r\n for j in range(num2):\r\n if i*p+j*q==n:\r\n print(i+j)\r\n\r\n for c in range(0, i*p, p):\r\n print(s[c:c+p])\r\n for c in range(i*p, n, q):\r\n print(s[c:c+q])\r\n exit()\r\n\r\nprint(-1)", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\ndef solve(): \r\n n,p,q=map(int,input().split())\r\n s=input().rstrip()\r\n a=0\r\n check=False\r\n while True:\r\n now=n-a*p\r\n if now<0: break\r\n if now%q==0:\r\n check=True\r\n break\r\n a+=1\r\n if not check:\r\n print(-1)\r\n return\r\n else:\r\n idx=0\r\n b=(n-a*p)//q\r\n print(a+b)\r\n for i in range(a):\r\n print(s[idx:idx+p])\r\n idx+=p\r\n for i in range(b):\r\n print(s[idx:idx+q])\r\n idx+=q\r\n return\r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "a, b, c = map(int, input().split(' '))\r\nx = input()\r\nfor i in range(105):\r\n for j in range(105):\r\n if i*b+j*c == a:\r\n print(i+j)\r\n for k in range(i):\r\n print(x[:b])\r\n x = x[b:]\r\n for l in range(j):\r\n print(x[:c])\r\n x = x[c:]\r\n quit()\r\nprint(-1)", "n, p, q = list(map(int, input().split()))\r\ns = input()\r\n\r\ndp = [0] * (n + max(p, q) + 1)\r\ndp[0] = 1\r\n\r\nfor i in range(n + 1):\r\n if dp[i] == 0:\r\n continue\r\n dp[i + p] = 1\r\n dp[i + q] = 1\r\n\r\nif not dp[n]:\r\n print('-1')\r\n exit()\r\n\r\nans = []\r\nwhile n:\r\n if n >= p and dp[n - p] == 1:\r\n ans.append(p)\r\n n -= p\r\n if n >= q and dp[n - q] == 1:\r\n ans.append(q)\r\n n -= q\r\n\r\nprint(len(ans))\r\n\r\nind = 0\r\nfor size in ans:\r\n print(s[ind:ind+size])\r\n ind += size\r\n", "npq = [int(i) for i in input().split()]\nword = input()\n# word = list(input())\n\n# def split(n, pq, no_times):\n# for i in range(0,no_times):\n# slice = []\n# for j in range(0, pq):\n# slice.append(word.pop(0))\n# print(''.join(slice))\n\nfor i in range(100):\n for j in range(100):\n\n if i * npq[1] + j*npq[2] == npq[0]:\n print(i+j)\n\n for k in range(i):\n print(word[:npq[1]])\n word = word[npq[1]:]\n\n for l in range(j):\n print(word[:npq[2]])\n word = word[npq[2]:]\n\n quit()\n\nprint(-1)\n", "n, p, q = [int(i) for i in input().split()]\r\ns = input().rstrip()\r\n\r\ndef solve(s, p, q, n):\r\n for x in range(100):\r\n if n - p*x >= 0 and (n - p*x) % q == 0:\r\n y = (n - p*x)//q\r\n part1 = [s[i*p:i*p+p] for i in range(x)]\r\n part2 = [s[p*x + i*q: p*x + i*q + q] for i in range(y)]\r\n return part1 + part2\r\n return [\"-1\"]\r\n\r\nans = solve(s, p, q, n)\r\nif ans[0][0] == \"-\":\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n for q in ans: print(q)", "import math\nimport sys,string\ninput=sys.stdin.readline\nimport random\nfrom collections import deque,defaultdict\nimport bisect\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn,p,q=M()\ns=input()\nif(n%p==0):\n print(n//p)\n for i in range(0,n,p):\n print(s[i:i+p])\nelif(n%q==0):\n print(n//q)\n for i in range(0,n,q):\n print(s[i:i+q])\nelse:\n w=min(p,q)\n c=0\n y=max(q,p)\n while(n%y!=0 and n>=0):\n n-=w\n c+=1\n if(n%y==0):\n print(c+n//y)\n i=0\n while(c!=0):\n print(s[i:i+w])\n i+=w\n c-=1\n c=n//y\n while(c!=0):\n print(s[i:i+y])\n i+=y\n c-=1\n else:\n print(-1)\n", "n,p,q=map(int,input().split())\r\nch=input()\r\ni=0\r\nj=0\r\ns=0\r\nfor i in range(0,100) :\r\n for j in range(0,100):\r\n if(((i*p)+(q*j))==n):\r\n break\r\n if(((i*p)+(q*j))==n):\r\n break\r\nif(i<99 or j<99):\r\n print(i+j)\r\n for z in range(0,i):\r\n print(ch[s:s+p])\r\n s=s+p\r\n for k in range(0,j):\r\n print(ch[s:s+q])\r\n s=s+q\r\nelse:\r\n print(-1)\r\n \r\n", "n, p, q = map(int, input().split())\r\ns = input()\r\nfor i in range(100):\r\n for j in range(100):\r\n if p * i + q * j == n:\r\n n = -1\r\n print(i + j)\r\n for k in range(i):\r\n print(s[:p])\r\n s = s[p:]\r\n for k in range(j):\r\n print(s[:q])\r\n s = s[q:]\r\nif n != -1:\r\n print(-1)\r\n", "n,p,q=map(int,input().split())\ns=str(input())\nmi=min(p,q)\nmx=max(p,q)\nfor i in range(0,n//mi+1):\n nimi=n-i*mi\n if 0==nimi%mx:\n print(nimi//mx+i)\n for j in range(0,i):\n print(s[j*mi:(j+1)*mi])\n s=s[i*mi:]\n for j in range(0,nimi//mx):\n print(s[j*mx:(j+1)*mx])\n exit()\nprint(-1)\n\t \t \t \t\t\t \t\t\t\t\t\t \t\t\t \t \t \t", "# -*- coding: utf-8 -*-\r\nimport sys\r\n\r\ndef fun():\r\n try:\r\n n,p,q = map(int,input().split())\r\n s = input()\r\n except ValueError:\r\n print('输入出错')\r\n return\r\n x,y = map(int,Calpq(n,p,q,0))\r\n if x<0 :\r\n print(-1)\r\n else:\r\n print(x+y)\r\n for i in range(x):\r\n print(s[p*i : p*(i+1)])\r\n k = p*x\r\n for i in range(y):\r\n print(s[k+q*i : k+q*(i+1)])\r\n pass\r\n\r\ndef Calpq(n,p,q,pn):\r\n k = n - p*pn\r\n if k<0:\r\n return -1,-1\r\n elif k%q==0:\r\n return pn,k//q\r\n else:\r\n return Calpq(n,p,q,pn+1)\r\nif __name__ == \"__main__\":\r\n fun()\r\n '''\r\n for i,v in enumerate(map(int,input().split())):\r\n print(i,v)\r\n '''", "n,p,q = map(int,input().split())\r\ns = input()\r\nfor i in range(n//p + 1):\r\n r = n-p*i\r\n if r%q==0:\r\n j = r//q\r\n print(i+j)\r\n for k in range(i):\r\n print(s[p*k:p*k+p])\r\n for k in range(j):\r\n print(s[p*i+k*q:p*i+k*q +q])\r\n exit()\r\nprint(-1)\r\n \r\n", "n, xs, ys = map(int,input().split())\r\ns = input()\r\nfor x in range(n//xs+1):\r\n if (n-x*xs)%ys == 0:\r\n y = (n-x*xs)//ys\r\n print(x+y)\r\n for i in range(x):\r\n print(s[i*xs:(i+1)*xs])\r\n s = s[x*xs:len(s)]\r\n for j in range(y):\r\n print(s[j * ys:(j + 1) * ys])\r\n exit()\r\nprint(-1)\r\n\r\n\r\n\r\n# O(n) solution above\r\n\r\n#O(n^2) will also work contraints are small.\r\n\r\n'''\r\nimport sys\r\nn, p, q = list(map(int, input().split()))\r\ns = input()\r\nfor a in range(n + 1):\r\n\tfor b in range(n + 1):\r\n\t\tif a * p + b * q == n:\r\n\t\t\tprint(a + b)\r\n\t\t\tfor i in range(a):\r\n\t\t\t\tprint(s[i * p : i * p + p])\r\n\t\t\ts = s[p * a:]\r\n\t\t\tp = q\r\n\t\t\ta = b\r\n\t\t\tfor i in range(a):\r\n\t\t\t\tprint(s[i * p : i * p + p])\r\n\t\t\tsys.exit(0)\t\t\t\r\nprint(\"-1\")\r\n\r\n\r\n'''", "n,m,k=map(int,input().split())\r\nch=input()\r\ndef solve(n,p,q,s):\r\n for a in range(n // p + 1):\r\n if (n - a * p) % q == 0:\r\n b = (n - a * p) // q\r\n\r\n print(a + b)\r\n\r\n for pos in range(0, a * p, p):\r\n print(s[pos : pos + p])\r\n\r\n for pos in range(a * p, n, q):\r\n print(s[pos : pos + q])\r\n\r\n return\r\n\r\n print(-1)\r\nsolve(n,m,k,ch)", "input1 = input()\ninput1 = input1.split()\nn = int(input1[0])\np = int(input1[1])\nq = int(input1[2])\n\nif p > q:\n\tp,q = q,p\n\nstring = input()\n\nprev = [-1] * (n+1)\nnr_splits = [0] * (n+1)\n\nprev[0] = 0\n\nfor i in range(p, q):\n\tif prev[i-p] != -1:\n\t\tprev[i] = p\n\t\tnr_splits[i] = nr_splits[i-p]+1\n\nfor i in range(q, n+1):\n\tif prev[i-p] != -1:\n\t\tprev[i] = p\n\t\tnr_splits[i] = nr_splits[i-p]+1\n\telif prev[i-q] != -1:\n\t\tprev[i] = q\n\t\tnr_splits[i] = nr_splits[i-q]+1\n\nif prev[n] == -1:\n\tprint(-1)\nelse:\n\tprint(nr_splits[n])\n\ti = 0\n\twhile n > 0:\n\t\tprint(string[i:i+prev[n]])\n\t\ti = i + prev[n]\n\t\tn = n - prev[n]\n", "#The Text Splitting.py\r\nimport os\r\nn, a, b = map(int, input().split())\r\ns = input()\r\nmaxn = n // a\r\n# print(s)\r\nx = -1\r\nfor i in range(0, maxn+1):\r\n\ttmp = n - a*i\r\n\tif tmp % b == 0:\r\n\t\tx = i\r\n\t\tbreak\r\nif x != -1:\r\n\tprint(x + (n - a*x) // b)\r\n\tout = \"\"\r\n\tfor i in range(0, x):\r\n\t\tout = s[a*i:(i+1)*a]\r\n\t\tprint(out)\r\n\ty = (n - a*x) // b\r\n\tfor i in range(0, y):\r\n\t\tout = s[b*i+a*x:(i+1)*b+a*x]\r\n\t\tprint(out)\r\nelse:\r\n\tprint(\"-1\")\r\n#os.system(\"pause\")", "#a = list(map(int, input().strip().split()))\r\n# from sys import stdout stdout.flush()\r\n\r\ndef f(n,p,q):\r\n mp = n // p\r\n mq = n // q\r\n \r\n for i in range(mp + 1):\r\n for j in range(mq + 1):\r\n if i*p+j*q == n:\r\n return (i,j)\r\n return (-1, -1)\r\n \r\n\r\nn,p,q = list(map(int, input().strip().split()))\r\ns = str(input())\r\n\r\ni,j = f(n,p,q)\r\n\r\nif i == -1 and j == -1:\r\n print(-1)\r\nelse:\r\n print(i+j)\r\n for a in range(i):\r\n print(s[a*p:(a+1)*p])\r\n for b in range(j):\r\n print(s[b*q+i*p:(b+1)*q+i*p])\r\n", "def solve():\r\n\tn, p, q = [int(a) for a in input().split()]\r\n\ts = input()\r\n\r\n\tfor a in range(len(s)):\r\n\t\tif len(s)-a*p < 0:\r\n\t\t\tbreak\r\n\t\tif (len(s)-a*p)%q==0:\r\n\t\t\tb = (len(s)-a*p)//q\r\n\t\t\tctr = 0\r\n\t\t\tans = []\r\n\t\t\tfor i in range(a):\r\n\t\t\t\tans.append(s[ctr:ctr+p])\r\n\t\t\t\tctr += p\r\n\t\t\tfor i in range(b):\r\n\t\t\t\tans.append(s[ctr:ctr+q])\r\n\t\t\t\tctr += q\r\n\r\n\t\t\tprint(len(ans))\r\n\t\t\tfor x in ans:\r\n\t\t\t\tprint(x)\r\n\t\t\treturn\r\n\tprint(-1)\r\n\r\nsolve()" ]

[ "n,m=map(int,input().split())\r\na=[list(input()) for i in range(n)]\r\nd=set(['f','a','c','e'])\r\nk=0\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tif a[i][j] in d:\r\n\t\t\ts=set()\r\n\t\t\ts.add(a[i][j])\r\n\t\t\ts.add(a[i+1][j])\r\n\t\t\ts.add(a[i+1][j+1])\r\n\t\t\ts.add(a[i][j+1])\r\n\t\t\tif s==d:\r\n\t\t\t\tk+=1\r\nprint(k)", "n,m=map(int,input().split())\nc=[]\nfor i in range(n):\n c.append(input())\nz=0\nfor i in range(len(c)-1):\n for j in range(len(c[i])-1):\n l=[]\n l.append(c[i][j])\n l.append(c[i+1][j])\n l.append(c[i][j+1])\n l.append(c[i+1][j+1])\n if(l.count('f')==1 and l.count('a')==1 and l.count('c')==1 and l.count('e')==1):\n z+=1\n \nprint(z)\n", "import sys\n\ndef solve():\n n, m = map(int, input().split())\n tab = [list(input()) for x in range(n)]\n need = set(['f', 'a', 'c', 'e'])\n res = 0\n for row in range(n - 1):\n for col in range(m - 1):\n s = set()\n for r in range(row, row + 2):\n for c in range(col, col + 2):\n s.add(tab[r][c])\n if need.issubset(s):\n res+=1\n return res\n\ndef run():\n if sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\n print(solve())\n\nrun()", "r, c = map(int, input().split())\nmat = []\nsum = 0\nres = 0\nfor _ in range(r): mat.append(input())\nfor i in range(r-1):\n for j in range(c-1):\n w1, w2, w3, w4 = mat[i][j], mat[i][j+1], mat[i+1][j+1], mat[i+1][j]\n if 'f' in {w1,w2,w3,w4}: sum+=1\n if 'a' in {w1,w2,w3,w4}: sum+=1\n if 'c' in {w1,w2,w3,w4}: sum+=1\n if 'e' in {w1,w2,w3,w4}: sum+=1\n if sum == 4: res+=1\n sum = 0\nprint(res)\n \t \t\t\t \t\t\t \t \t \t \t \t \t \t \t", "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 s = []\r\n for i in range(n):\r\n s.append(input())\r\n c = sorted(list('face'))\r\n ans = 0\r\n for i, j in itertools.product(range(n-1), range(m-1)):\r\n x = [s[i][j], s[i+1][j], s[i][j+1], s[i+1][j+1]]\r\n if sorted(x) == c:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n,m=map(int,input().split())\r\nM=[input() for i in range(n)]\r\nk=0\r\nL=sorted('face')\r\nfor i in range(n) :\r\n for j in range(m) :\r\n F=''\r\n if i+2<=n and j+2<=m :\r\n F=F+M[i][j]+M[i][j+1]+M[i+1][j]+M[i+1][j+1]\r\n if sorted(F)==L :\r\n k=k+1\r\n\r\nprint(k)\r\n\r\n \r\n", "n, m = map(int, input().split())\nmatrix = [input() for i in range(n)]\n\nword_to_search = {'a','e','f', 'c'}\n\nres = 0\nfor i in range(n - 1):\n for j in range(m - 1):\n set_to_match = {matrix[i][j],\n matrix[i+1][j],\n matrix[i][j+1],\n matrix[i+1][j+1]}\n \n if set_to_match == word_to_search:\n res += 1\nprint(res)\n\t \t \t\t \t\t\t \t\t \t \t\t\t\t\t \t", "n, m = map(int, input().split(' '))\r\np = [input() for i in range(n)]\r\nr = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if {p[i][j], p[i+1][j], p[i][j+1], p[i+1][j+1]} == {'f','a','c','e'}:\r\n r = r + 1\r\nprint(r)", "r, c = map(int,input().split())\r\nl = [[c for c in input()] for _ in range(r)]\r\ntotal = 0\r\nf = set(c for c in 'face')\r\nfor x in range(r-1):\r\n\tfor y in range(c-1):\r\n\t\tif l[x][y] in 'face':\r\n\t\t\ttotal += {l[x][y],l[x][y+1],l[x+1][y],l[x+1][y+1]} == f\r\nprint (total)\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n n, m = IA()\r\n mat = []\r\n char = set('face')\r\n count = 0\r\n for _ in range(n):\r\n s = S()\r\n mat.append(s)\r\n for i in range(n):\r\n for j in range(m):\r\n cell = mat[i][j]\r\n if cell in char:\r\n temp = set()\r\n temp.add(cell)\r\n try:\r\n l = [mat[i][j+1], mat[i+1][j], mat[i+1][j+1]]\r\n for c in l:\r\n if c in char:\r\n temp.add(c)\r\n except:\r\n IndexError() \r\n if temp == char:\r\n count += 1 \r\n return count \r\n \r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, m = map(int, input().split())\r\ndata = []\r\nfor i in range(n):\r\n\tdata.append(input().strip())\r\nans = 0\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tcur = []\r\n\t\tfor a in range(2):\r\n\t\t\tfor b in range(2):\r\n\t\t\t\tcur.append(data[i+a][j+b])\r\n\t\tif 'f' in cur and 'a' in cur and 'c' in cur and 'e' in cur:\r\n\t\t\tans += 1\r\nprint (ans)\r\n", "n, m = map(int, input().split())\r\ng = [list(input()) for _ in range(n)]\r\nr = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if set([g[i][j], g[i+1][j+1], g[i][j+1], g[i+1][j]]) == set('face'):\r\n r += 1\r\n\r\nprint(r)\r\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\ncnt = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n s = a[i][j] + a[i + 1][j] + a[i][j + 1] + a[i + 1][j + 1]\r\n cnt += \"f\" in s and \"a\" in s and \"c\" in s and \"e\" in s\r\nprint(cnt)", "firstLine = [int(n) for n in input().split()];\r\n\r\nmatrix = [];\r\n\r\nfor i in range(0, firstLine[0]):\r\n matrix.append(str(input()));\r\n \r\ntotal = 0;\r\nfor i in range(0, len(matrix)-1):\r\n for j in range(0, len(matrix[0])-1):\r\n temp = \"\";\r\n temp += matrix[i][j];\r\n temp += matrix[i][j+1];\r\n temp += matrix[i+1][j];\r\n temp += matrix[i+1][j+1];\r\n if(\"f\" in temp and \"a\" in temp and \"c\" in temp and \"e\" in temp):\r\n total += 1;\r\n\r\nprint(total);", "# coding=utf-8\r\n\r\n\r\nif __name__ == '__main__':\r\n\tn, m = str(input()).split()\r\n\tn = int(n)\r\n\tm = int(m)\r\n\tface = list()\r\n\tfor i in range(n):\r\n\t\tface.append(list(str(input())))\r\n\tc = 0\r\n\tfor i in range(n - 1):\r\n\t\tfor j in range(m - 1):\r\n\t\t\tline = str()\r\n\t\t\tline += face[i][j]\r\n\t\t\tline += face[i][j + 1]\r\n\t\t\tline += face[i + 1][j]\r\n\t\t\tline += face[i + 1][j + 1]\r\n\t\t\tif 'f' in line and 'a' in line and 'c' in line and 'e' in line:\r\n\t\t\t\tc += 1\r\n\tprint(c)\r\n", "n, m = [int(i) for i in input().split()]\r\nd = [input() for i in range(n)]\r\n\r\nresult = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if sorted(d[i][j] + d[i + 1][j] + d[i][j + 1] + d[i + 1][j + 1]) == sorted(list(\"face\")):\r\n result += 1\r\n\r\nprint(result)\r\n", "n, m = [int(x) for x in input().split()]\r\na = []\r\nfor _ in range(n):\r\n s = input()\r\n a.append(s)\r\n \r\nans = 0\r\n \r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n b = []\r\n b.append(a[i][j])\r\n b.append(a[i + 1][j])\r\n b.append(a[i + 1][j + 1])\r\n b.append(a[i][j + 1])\r\n b.sort()\r\n if b == ['a', 'c', 'e', 'f']: \r\n ans += 1\r\nprint(ans)", "n, m = (int(x) for x in input().split())\na = []\nfor i in range(n):\n\ta.append(input())\nok = set('face')\nans = 0\nfor i in range(n - 1):\n\tfor j in range(m - 1):\n\t\ttest = set([a[i][j], a[i + 1][j], a[i][j + 1], a[i + 1][j + 1]])\n\t\tif test == ok:\n\t\t\tans += 1\nprint(ans)\n", "n, m = [int(x) for x in input().split()]\r\n\r\nimage = []\r\nfor _ in range(n):\r\n image.append(input())\r\n\r\ncount = 0\r\nfaces = set(['f', 'a', 'c', 'e'])\r\n\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n neighbors = set([image[i][j], image[i][j + 1], image[i + 1][j], image[i + 1][j + 1]])\r\n if neighbors == faces:\r\n count += 1\r\n\r\nprint(count)\r\n", "n,m = map(int,input().split())\r\nprev = input()\r\nif n==1 or m==1:\r\n print(0)\r\nelse:\r\n count = 0\r\n for i in range(n-1):\r\n now = input()\r\n for j in range(m-1):\r\n s = prev[j:j+2] + now[j:j+2]\r\n if ('f' in s) and ('a' in s) and ('c' in s) and ('e' in s):\r\n count += 1\r\n prev = now\r\n print(count)", "n, m = map(int, input().split()) # height and width respectively\nif n < 2 or m < 2:\n print(0)\nelse:\n face = {'f', 'a', 'c', 'e'}\n image = []\n for i in range(n):\n image.append(list(input()))\n counter = 0\n for i in range(1, n):\n for j in range(1, m):\n current = {image[i-1][j-1], image[i-1][j], image[i][j-1], image[i][j]}\n if current == face:\n counter += 1\n print(counter)\n\n \t \t\t \t\t\t \t\t\t \t\t\t \t \t", "arr = list(map(int, input().rstrip().split()))\r\narra= []\r\nif arr[0]==1 or arr[1]==0 :\r\n print(\"0\")\r\nelse:\r\n for i in range(arr[0]):\r\n b = input()\r\n a = list(b)\r\n # print(a)\r\n\r\n arra.append(a)\r\n count = 0\r\n # print(arra)\r\n # print(arra[0][0])\r\n x = arr[0]-1\r\n y = arr[1]-1\r\n z = x*y\r\n for i in range(x):\r\n\r\n # print(\"loop number :\",i+1)\r\n for j in range(y):\r\n ar = []\r\n # print(arra[i][j])\r\n ar.append(arra[i][j])\r\n # print(arra[i][j+1])\r\n ar.append(arra[i][j + 1])\r\n # print(arra[i+1][j])\r\n ar.append( arra[i + 1][j])\r\n # print(arra[i+1][j+1])\r\n ar.append( arra[i + 1][j + 1])\r\n\r\n if 'f' in ar and 'a' in ar and 'c' in ar and 'e' in ar:\r\n count+=1\r\n # print(j)\r\n print(count)\r\n", "n, m = map(int, input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(input())\r\nface = [\"f\", \"a\", \"c\", \"e\"]\r\nface.sort()\r\naux = []\r\nres = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if matrix[i][j] != \"x\":\r\n aux.append(matrix[i][j])\r\n aux.append(matrix[i][j + 1])\r\n aux.append(matrix[i + 1][j])\r\n aux.append(matrix[i + 1][j + 1])\r\n aux.sort()\r\n if face == aux:\r\n res += 1\r\n aux.clear()\r\nprint(res)\r\n \r\n ", "n,m = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nprint(sum(sorted(a[x][y:y+2]+a[x+1][y:y+2])==sorted(\"face\") for x in range(n-1) for y in range(m-1)))", "n, m = map(int, input().split())\r\nt = []\r\ncnt = 0\r\nfor i in range(n):\r\n t.append(input())\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n s = ''\r\n s += t[i][j]\r\n s += t[i + 1][j]\r\n s += t[i][j + 1]\r\n s += t[i + 1][j + 1]\r\n s = ''.join(sorted(list(s)))\r\n if s == 'acef':\r\n cnt += 1\r\nprint(cnt)", "[n, m] = [int(i) for i in input().split()]\n\nmatrix = []\n\nfor i in range(n):\n linha = input()\n matrix.append(linha)\n\nnum = 0\n\nfor i in range(n - 1):\n for j in range(m - 1):\n letters = ['f', 'a', 'c', 'e']\n falhou = False\n for k in range(2):\n for l in range(2):\n elem = matrix[i + k][j + l]\n if elem in letters:\n letters.remove(elem)\n else:\n falhou = True\n break\n if falhou:\n break\n if not falhou:\n num += 1\n\nprint(num)\n\t\t\t \t \t \t\t \t \t \t\t\t \t\t", "n, m = [int(x) for x in input().split()]\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n#print(a)\r\nres = 0\r\nz = [\"face\", \"faec\", \"feac\", \"feca\", \"fcae\", \"fcea\", \"eafc\", \"eacf\", \"ecaf\", \"ecfa\", \"efac\", \"efca\", \"acfe\", \"acef\", \"aecf\", \"aefc\", \"afce\", \"afec\", \"cafe\", \"caef\", \"ceaf\", \"cefa\", \"cfea\", \"cfae\"]\r\nfor i in range(1, n):\r\n for j in range(1, m):\r\n if a[i][j]+a[i][j-1]+a[i-1][j]+a[i-1][j-1] in z:\r\n res += 1\r\nprint(res)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = []\r\n for i in range(n):\r\n A.append(input())\r\n ans = 0\r\n for i in range(n - 1):\r\n for j in range(m - 1):\r\n B = []\r\n B.append(A[i][j])\r\n B.append(A[i][j+1])\r\n B.append(A[i+1][j])\r\n B.append(A[i+1][j+1])\r\n if sorted(B) == sorted(list('face')):\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ndata = [list(input().rstrip()) for _ in range(n)]\r\n\r\ncnt = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if {data[i][j], data[i + 1][j], data[i][j + 1], data[i + 1][j + 1]} == {'f', 'a', 'c', 'e'}:\r\n cnt += 1\r\n\r\nprint(cnt)", "x = list(map(int, input().split(' ')))\nn, m = x[0], x[1]\na = []\nfor i in range(n):\n a.append(input())\n\ndef check(x, y):\n mp = set()\n for i in range(x-1, x+1):\n for j in range(y-1, y+1):\n mp.add(a[i][j])\n return ('f' in mp) and ('a' in mp) and ('c' in mp) and ('e' in mp)\n\nk = 0\n\nfor i in range(1, n):\n for j in range(1, m):\n if check(i, j):\n k += 1\n\nprint(k)\n\n", "A=[]\ndx=[0,0,1,1]\ndy=[0,1,0,1]\ndef fun(a,b):\n c={\n 'f':1,'a':1,'c':1,'e':1\n }\n ans = 0\n for i in range(4):\n if A[a+dx[i]][b+dy[i]] in c:\n ans = ans + c[A[a+dx[i]][b+dy[i]]];\n c[A[a+dx[i]][b+dy[i]]]=0\n return ans == 4\nn,m = [int(s) for s in input().split()]\nfor i in range(n):\n A.append(input())\nans = 0\nfor i in range(n-1):\n for j in range(m-1):\n if fun(i,j):\n ans+=1\nprint(ans)\n \t \t\t \t \t \t \t \t\t \t", "n, m = map(int, input().split(' '))\n\nif n == 1 or m == 1:\n print(0)\nelse:\n arr = []\n\n for _ in range(n):\n arr.append(\n list(input())\n )\n\n ans = 0\n for i in range(n-1):\n for j in range(m-1):\n aux = ['a', 'c', 'e', 'f']\n if arr[i][j] in aux:\n square = [\n arr[i][j], arr[i][j+1], arr[i+1][j], arr[i+1][j+1]\n ]\n if sorted(square) == aux:\n ans += 1\n\n print(ans)\n\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()]\nimage = [[]for i in range(n)]\nfor i in range(n):\n image[i] = [c for c in input()]\nit = 'acef'\ncount = 0\nfor i in range(n-1):\n for j in range(m-1):\n if image[i][j] in it:\n test = [image[i][j],image[i][j+1],image[i+1][j],image[i+1][j+1]]\n test.sort()\n strtest = \"\".join(test)\n if strtest == it:\n count+=1\nprint(count)\n\n \t\t\t\t \t \t \t\t \t \t \t \t \t\t", "n,m = map(int,input().split())\r\ng = [input() for i in range(n)]\r\ndef solve(sub):\r\n chars = ''\r\n for x in sub:\r\n for y in x:\r\n chars += y\r\n return sorted(chars) == sorted('face')\r\nans = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if solve([[g[i][j],g[i+1][j],g[i][j+1],g[i+1][j+1]]]):\r\n ans += 1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\na = [input().strip() for x in range(n)]\nprint(sum(set([a[i][j], a[i + 1][j], a[i][j + 1], a[i + 1][j + 1]]) == set('face') for i in range(n - 1) for j in range(m - 1)))\n", "import string\r\n\r\ndef main_funtion():\r\n photo = [list(input()) for i in range([int(i) for i in input().split(\" \")][0])]\r\n counter = 0\r\n d = {}\r\n for i in range(len(photo)):\r\n for j in range(len(photo[i])):\r\n if (photo[i][j] != \"f\" or photo[i][j] != \"a\" or photo[i][j] != \"c\" or photo[i][j] != \"e\") and i < len(photo) - 1 and j < len(photo[i]) - 1 and set([photo[i][j], photo[i + 1][j], photo[i][j + 1], photo[i + 1][j + 1]]) == set([\"f\", \"a\", \"c\",\"e\"]):\r\n counter += 1\r\n\r\n return counter\r\n\r\n\r\n\r\n\r\n\r\nprint(main_funtion())", "n, m = [int(x) for x in input().split(' ')]\r\nt = [input() for _ in range(n)]\r\ns = sorted('face')\r\nans = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n ss = t[i][j] + t[i][j+1] + t[i+1][j] + t[i+1][j+1]\r\n if sorted(ss) == s:\r\n ans += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\na=list(input() for i in range(n))\r\nprint(sum(sorted(a[i][j:j+2]+a[i+1][j:j+2])==sorted(\"face\") for i in range(n-1) for j in range(m-1)))\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\ndef test(f, a, c, e):\n face = [f, a, c, e]\n if 'f' in face and 'a' in face and 'c' in face and 'e' in face:\n return 1\n return 0\n\nimport time\n\n(n, m) = (int(i) for i in input().split())\nfmap = []\n\nfor i in range(n):\n fmap.append(input())\n\nstart = time.time()\nacc = 0\nfor i in range(n):\n for j in range(m):\n if fmap[i][j] == 'f':\n if i< n-1 and j <m-1:\n acc += test(fmap[i][j], fmap[i][j+1], fmap[i+1][j], fmap[i+1][j+1])\n if i < n-1 and j > 0:\n acc += test(fmap[i][j], fmap[i][j-1], fmap[i+1][j], fmap[i+1][j-1])\n if i > 0 and j <m-1:\n acc += test(fmap[i][j], fmap[i][j+1], fmap[i-1][j], fmap[i-1][j+1])\n if i > 0 and j > 0:\n acc += test(fmap[i][j], fmap[i][j-1], fmap[i-1][j], fmap[i-1][j-1])\n\nprint(acc)\nfinish = time.time()\n#print(finish - start)\n\n", "n, m = (int(i) for i in input().split())\r\nref = set(\"face\")\r\ndata = []\r\nface = 0\r\nfor i in range(n):\r\n data.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j] == \"f\":\r\n if i < n - 1 and j < m - 1:\r\n test = set(data[i][j]+data[i + 1][j]+data[i + 1][j + 1]+data[i][j + 1])\r\n if test == ref:\r\n face += 1\r\n if i > 0 and j < m - 1:\r\n test = set(data[i][j]+data[i - 1][j]+data[i - 1][j + 1]+data[i][j + 1])\r\n if test == ref:\r\n face += 1\r\n if i > 0 and j > 0:\r\n test = set(data[i][j]+data[i - 1][j]+data[i - 1][j - 1]+data[i][j - 1])\r\n if test == ref:\r\n face += 1\r\n if i < n - 1 and j > 0:\r\n test = set(data[i][j]+data[i + 1][j]+data[i + 1][j - 1]+data[i][j - 1])\r\n if test == ref:\r\n face += 1\r\nprint(face)\r\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nface = set(['f', 'a', 'c', 'e'])\r\nc = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if set([a[i][j], a[i][j + 1], a[i + 1][j], a[i + 1][j + 1]]) == face:\r\n c += 1\r\nprint(c)", "n,m=map(int,input().split())\r\na=[]\r\nc=['f','a','c','e']\r\nc.sort()\r\nfor i in range(n):\r\n a.append(list(input()))\r\ncount=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n b=[]\r\n b.append(a[i][j])\r\n b.append(a[i][j+1])\r\n b.append(a[i+1][j])\r\n b.append(a[i+1][j+1])\r\n b.sort()\r\n if b==c:\r\n count+=1\r\nprint(count)", "poss = [\r\n 'face', 'faec', 'fcae', 'fcea',\r\n 'feac', 'feca', 'afce', 'afec',\r\n 'acfe', 'acef', 'aefc', 'aecf',\r\n 'cfae', 'cfea', 'cafe', 'caef',\r\n 'cefa', 'ceaf', 'efac', 'efca',\r\n 'eafc', 'eacf', 'ecfa', 'ecaf'\r\n]\r\n\r\ndef check(p, i, j, k):\r\n return p[i][j:j+2] == poss[k][0:2] and p[i+1][j:j+2] == poss[k][2:4]\r\n\r\nn, m = map(int, input().split(' '))\r\np = [input() for _ in range(n)]\r\nans = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n for k in range(24):\r\n if check(p, i, j, k):\r\n ans += 1\r\n\r\nprint(ans)\r\n", "r,c=map(int,input().split())\r\n\r\nmat=[]\r\n\r\nfor i in range(r):\r\n\tmat.append(list(input()))\r\n\r\n\r\ncount=0\r\n\r\nfor i in range(r-1):\r\n\tfor j in range(c-1):\r\n\t\tl=[]\r\n\t\tl.append(mat[i][j])\r\n\t\tl.append(mat[i][j+1])\r\n\t\tl.append(mat[i+1][j])\r\n\t\tl.append(mat[i+1][j+1])\r\n\t\tif('a' in l and 'f' in l and 'c' in l and 'e' in l):\r\n\t\t\tcount+=1\r\n\r\n\r\n\r\nprint(count)", "def calc(img):\r\n nr = len(img)\r\n nc = len(img[0])\r\n ret = 0\r\n for i in range(nr-1):\r\n for j in range(nc-1):\r\n tset = set()\r\n tset.add(img[i][j])\r\n tset.add(img[i][j+1])\r\n tset.add(img[i+1][j])\r\n tset.add(img[i+1][j+1])\r\n if 'f' in tset and 'a' in tset and 'c' in tset and 'e' in tset:\r\n ret += 1\r\n return ret \r\n\r\ndef main():\r\n items = input().split()\r\n nr = int(items[0])\r\n nc = int(items[1])\r\n img = []\r\n for _ in range(nr):\r\n img.append(input())\r\n print(calc(img))\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n ", "words = ['face','faec','feac','feca','fcea','fcae']\r\nletters = 'aec'\r\nfor i in range(3):\r\n for j in range(6):\r\n word = words[j][1:]\r\n word = word.replace(letters[i],'f')\r\n word = letters[i] + word\r\n words.append(word)\r\n \r\n\r\nh,w = map(int,input().split())\r\nP = [] \r\nfor i in range(1,h+1):\r\n P.append(list(input().strip()))\r\n\r\nc = 0\r\nfor i in range(h-1):\r\n for j in range(w-1):\r\n word = P[i][j] + P[i][j+1] + P[i+1][j] + P[i+1][j+1]\r\n if word in words:\r\n c+=1 \r\n \r\nprint(c)\r\n", "n, m = [int(i) for i in input().split()]\r\nimage = []\r\nres = 0\r\nfor i in range(n):\r\n line = input()\r\n image.append(line)\r\n\r\nlvl = 0\r\nres_list = []\r\nwhile lvl < n-1:\r\n pos1 = 0\r\n while pos1 < len(line)-1:\r\n str1 = image[lvl][pos1] + image[lvl][pos1+1]\r\n str2 = image[lvl+1][pos1] + image[lvl+1][pos1+1]\r\n str3 = str1 + str2\r\n scan = [i for i in str3]\r\n res_list.append(scan)\r\n pos1 += 1\r\n lvl += 1\r\n\r\nfor square in res_list:\r\n if 'f' in square:\r\n if 'a' in square:\r\n if 'c' in square:\r\n if 'e' in square:\r\n res += 1\r\n\r\nprint(res)\r\n", "n,m=map(int,input().strip().split())\r\ns=[]\r\nfor i in range(n):\r\n In=input()\r\n tmp=[]\r\n for c in In:\r\n tmp.append(c)\r\n s.append(tmp)\r\nans=0\r\ntot=0\r\ndict={}\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n dict.clear()\r\n dict[s[i][j]]=1\r\n dict[s[i+1][j]]=1\r\n dict[s[i][j+1]]=1\r\n dict[s[i+1][j+1]]=1\r\n if (('f' in dict)and('a' in dict)and('c' in dict)and('e' in dict)):\r\n ans=ans+1\r\nprint(ans)", "n,m=map(int,input().split())\r\nli=[]\r\ntotal=0\r\nli1=['f','a','c','e']\r\nfor i1 in range(n):\r\n li.append(input())\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if li[i][j] in li1:\r\n if li[i][j+1] in li1 and li[i][j+1]!=li[i][j]:\r\n if li[i+1][j] in li1 and li[i+1][j]!=li[i][j] and li[i+1][j]!=li[i][j+1]:\r\n if li[i+1][j+1] in li1 and li[i+1][j+1]!=li[i][j] and li[i+1][j+1]!=li[i+1][j] and li[i+1][j+1]!=li[i][j+1]:\r\n total+=1\r\nprint(total)\r\n", "data = []\r\nface = set({'f', 'a', 'c', 'e'})\r\n\r\n\r\ndef check(data, i, j):\r\n s = set()\r\n s.add(data[i][j])\r\n s.add(data[i + 1][j])\r\n s.add(data[i + 1][j + 1])\r\n s.add(data[i][j + 1])\r\n\r\n if len(s & face) == 4:\r\n return True\r\n\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n\r\n for i in range(n):\r\n data.append(input())\r\n\r\n total = 0\r\n for i in range(n - 1):\r\n for j in range(m - 1):\r\n if check(data, i, j):\r\n total += 1\r\n\r\n print(total)", "n,m = map(int,input().split())\r\na = []\r\nfor i in range(n): a += [input()]\r\ncounter = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n s = {a[i][j],a[i+1][j],a[i][j+1],a[i+1][j+1]}\r\n if s == set('face'): counter += 1\r\nprint(counter)", "n,m=map(int,input().strip().split())\r\ns=[]\r\nfor i in range(n):\r\n In=input()\r\n tmp=[]\r\n for c in In:\r\n tmp.append(c)\r\n s.append(tmp)\r\nans=0\r\ntot=0\r\ndict={}\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n tot=tot+1\r\n dict[s[i][j]]=tot\r\n dict[s[i+1][j]]=tot\r\n dict[s[i][j+1]]=tot\r\n dict[s[i+1][j+1]]=tot\r\n if (dict.get('f',-1)!=tot or dict.get('a',-1)!=tot or dict.get('c',-1)!=tot or dict.get('e',-1)!=tot):\r\n continue\r\n ans=ans+1\r\nprint(ans)", "import sys\r\n\r\nrows, cols = map(int, input().split())\r\n\r\nmatrix = []\r\ncounter = 0\r\n\r\nif rows==1 or cols ==1:\r\n print(0)\r\n sys.exit()\r\n\r\nfor i in range(0,rows):\r\n lst = list(str(input()))\r\n matrix.append(lst)\r\n\r\nfor i in range(0,rows):\r\n for j in range(0,cols):\r\n\r\n if matrix[i][j] == 'f':\r\n # CODE if 'f' is found within borders and not on the BORDER.\r\n\r\n if (i<rows-1 and i>=1) and (j<cols-1 and j>=1):\r\n\r\n lstBuffer=[]\r\n lstBuffer.append(matrix[i][j-1])\r\n lstBuffer.append(matrix[i-1][j-1])\r\n lstBuffer.append(matrix[i-1][j])\r\n x = sorted(lstBuffer)\r\n if x[0]=='a' and x[1]=='c' and x[2]=='e':\r\n counter +=1\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j + 1])\r\n lstBuffer.append(matrix[i - 1][j + 1])\r\n lstBuffer.append(matrix[i-1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j-1])\r\n lstBuffer.append(matrix[i+1][j-1])\r\n lstBuffer.append(matrix[i+1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j+1])\r\n lstBuffer.append(matrix[i + 1][j+1])\r\n lstBuffer.append(matrix[i + 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n\r\n # if 'f' is found in the first cell of the matrix TOP LEFT CORNER\r\n\r\n elif i==0 and j==0:\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j + 1])\r\n lstBuffer.append(matrix[i + 1][j + 1])\r\n lstBuffer.append(matrix[i + 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n # if 'f' is found in TOP RIGHT CORNER\r\n\r\n elif i==0 and j==(cols-1):\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j - 1])\r\n lstBuffer.append(matrix[i + 1][j - 1])\r\n lstBuffer.append(matrix[i + 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n\r\n # if 'f' is found in BOTTOM LEFT CORNER\r\n\r\n elif i==(rows-1) and j==0:\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j + 1])\r\n lstBuffer.append(matrix[i - 1][j + 1])\r\n lstBuffer.append(matrix[i - 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n # if 'f' is found in BOTTOM RIGHT CORNER\r\n\r\n elif i==(rows-1) and j==(cols-1):\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j - 1])\r\n lstBuffer.append(matrix[i - 1][j - 1])\r\n lstBuffer.append(matrix[i - 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n # if 'f' is between i==0 and j>=1 and j<(cols-1)\r\n\r\n elif i==0 and (j>=1 and j<(cols-1)):\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j - 1])\r\n lstBuffer.append(matrix[i+1][j - 1])\r\n lstBuffer.append(matrix[i+1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j+1])\r\n lstBuffer.append(matrix[i + 1][j+1])\r\n lstBuffer.append(matrix[i + 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n # if 'f' is between j==0 and i>=1 and i<(rows-1)\r\n\r\n elif (i>=1 and i<(rows-1)) and j==0:\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j+1])\r\n lstBuffer.append(matrix[i-1][j+1])\r\n lstBuffer.append(matrix[i-1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j + 1])\r\n lstBuffer.append(matrix[i + 1][j + 1])\r\n lstBuffer.append(matrix[i + 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n\r\n # if 'f' is between i==(rows-1) and j>=1 and j<(cols-1)\r\n\r\n elif i==rows-1 and (j>=1 and j<(cols-1)):\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j - 1])\r\n lstBuffer.append(matrix[i-1][j - 1])\r\n lstBuffer.append(matrix[i-1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j + 1])\r\n lstBuffer.append(matrix[i-1][j + 1])\r\n lstBuffer.append(matrix[i-1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n\r\n # if 'f' is between j==(cols-1) and i>=1 and i<(rows-1)\r\n\r\n elif (i>=1 and i<(rows-1)) and j==(cols-1):\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j - 1])\r\n lstBuffer.append(matrix[i+1][j - 1])\r\n lstBuffer.append(matrix[i+1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n lstBuffer = []\r\n lstBuffer.append(matrix[i][j-1])\r\n lstBuffer.append(matrix[i - 1][j-1])\r\n lstBuffer.append(matrix[i - 1][j])\r\n x = sorted(lstBuffer)\r\n if x[0] == 'a' and x[1] == 'c' and x[2] == 'e':\r\n counter += 1\r\n\r\n\r\n\r\n\r\nprint(counter)", "n, m = map(int, input().split())\ncount = 0\nw = [input() for i in range(n)]\n \nfor i in range(n - 1):\n for j in range(m - 1):\n if {w[i][j], w[i+1][j], w[i][j+1], w[i+1][j+1]} == {'f', 'a', 'c', 'e'}:\n count += 1\nprint(count)\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\na=[]\r\nfor i in range(n):\r\n x=[i for i in input()]\r\n a.append(x)\r\n#check\r\ncount=0\r\nfor j in range(m-1):\r\n for i in range(n-1):\r\n x=set([a[i][j],a[i+1][j],a[i][j+1],a[i+1][j+1]])\r\n if x=={'a','f','c','e'}:\r\n count+=1\r\nprint(count)\r\n", "n, m = map(int,input().split())\r\nicon = [input() for i in range(n)]\r\nfaces = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n temp = 0\r\n temp2 = 0\r\n temp3 = 0\r\n temp4 = 0\r\n if icon[i][j] == \"f\":\r\n temp += 1\r\n elif icon[i][j] == \"a\":\r\n temp2 += 1\r\n elif icon[i][j] == \"c\":\r\n temp3 += 1\r\n elif icon[i][j] == \"e\":\r\n temp4 += 1\r\n if icon[i+1][j] == \"f\":\r\n temp += 1\r\n elif icon[i+1][j] == \"a\":\r\n temp2 += 1\r\n elif icon[i+1][j] == \"c\":\r\n temp3 += 1\r\n elif icon[i+1][j] == \"e\":\r\n temp4 += 1\r\n if icon[i][j+1] == \"f\":\r\n temp += 1\r\n elif icon[i][j+1] == \"a\":\r\n temp2 += 1\r\n elif icon[i][j+1] == \"c\":\r\n temp3 += 1\r\n elif icon[i][j+1] == \"e\":\r\n temp4 += 1\r\n if icon[i+1][j+1] == \"f\":\r\n temp += 1\r\n elif icon[i+1][j+1] == \"a\":\r\n temp2 += 1\r\n elif icon[i+1][j+1] == \"c\":\r\n temp3 += 1\r\n elif icon[i+1][j+1] == \"e\":\r\n temp4 += 1\r\n if temp == 1 and temp2 == 1 and temp3 == 1 and temp4 == 1:\r\n faces += 1\r\nprint(faces)\r\n", "\r\nR = lambda:map(int,input().split())\r\n\r\nn, m = R()\r\na = [[j for j in input()] for i in range(n)]\r\nans = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if sorted(a[i][j:j+2] + a[i+1][j:j+2]) == sorted('face'):\r\n ans += 1\r\nprint(ans)\r\n\r\n", "vars = [\"face\", \"faec\", \"feac\", \"feca\", \"fcae\", \"fcea\", \"eafc\", \"eacf\", \"ecaf\", \"ecfa\", \"efac\", \"efca\", \"acfe\", \"acef\",\r\n \"aecf\", \"aefc\", \"afce\", \"afec\", \"cafe\", \"caef\", \"ceaf\", \"cefa\", \"cfea\", \"cfae\"]\r\n\r\n\r\ndef define_faces(n, m, lst):\r\n count = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if i + 1 < n and j + 1 < m and lst[i + 1][j + 1] + lst[i + 1][j] + lst[i][j + 1] + lst[i][j] in vars:\r\n count += 1\r\n return count\r\n\r\n\r\nn1, m1 = [int(i) for i in input().split()]\r\nb = list()\r\nfor z in range(n1):\r\n s = input()\r\n b.append(list(s))\r\nprint(define_faces(n1, m1, b))\r\n", "n, m = map(int, input().split())\n\nfield = []\nfor i in range(n):\n field.append(input())\n\nans = 0\nfor i in range(n - 1):\n for j in range(m - 1):\n t = set()\n t.add(field[i][j])\n t.add(field[i + 1][j + 1])\n t.add(field[i + 1][j])\n t.add(field[i][j + 1])\n\n if t == set('face'):\n ans += 1\nprint(ans)\n", "if __name__ == \"__main__\":\n n, m = map(int, input().split())\n image = []\n for _ in range(n):\n image.append(input())\n n_images = 0\n for i in range(n-1):\n for j in range(m-1):\n face = image[i][j:j+2] + image[i+1][j:j+2]\n if 'f' in face and 'a' in face and 'c' in face and 'e' in face:\n n_images += 1\n print(n_images)\n", "__author__ = 'Adam'\r\n\r\nimport sys\r\n\r\nn, m = sys.stdin.readline().split(' ')\r\nn, m = int(n), int(m)\r\ndata = []\r\nfor i in range(n):\r\n data.append(sys.stdin.readline()[:m])\r\n\r\n#print(data)\r\n#print(str(data[0])[0])\r\ncount = 0\r\nfor i in range(n-1):\r\n\r\n for j in range(m-1):\r\n #print(i, j)\r\n right = [data[i][j], data[i][j+1], data[i+1][j], data[i+1][j+1]]\r\n #print(right)\r\n if set(right) == set(['f', 'a', 'c', 'e']):\r\n count += 1\r\n #print('\\n')\r\n\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nt = [input() for i in range(n)]\r\nprint(sum(sorted(t[i][j:j + 2] + t[i + 1][j:j + 2]) == sorted('face') for i in range(n - 1) for j in range(m - 1)))", "mat=[]\r\ncnt=0 \r\nfrom collections import Counter \r\nn,m=map(int,input().split())\r\nfor i in range(n):\r\n mat.append(list(input()))\r\nfor i in range(1,n):\r\n for j in range(1,m):\r\n s=mat[i][j]+mat[i][j-1]+mat[i-1][j]+mat[i-1][j-1]\r\n #print(s)\r\n if Counter(s)==Counter('face'):\r\n cnt+=1 \r\nprint(cnt)", "import sys\r\nimport math\r\n\r\n\r\nn,m = map(int, input().split())\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\nf,a,c,e = False, False, False, False;\r\nans = 0;\r\nfor i in range(n - 1):\r\n for j in range(m -1):\r\n for o in range(i, i+ 2):\r\n for p in range(j, j+ 2):\r\n if b[o][p] == 'f':\r\n f = True\r\n if b[o][p] == 'a':\r\n a = True\r\n if b[o][p] == 'c':\r\n c = True\r\n if b[o][p] == 'e':\r\n e = True\r\n\r\n if f == c == a==e == True:\r\n ans+=1\r\n f, a, c, e = False, False, False, False;\r\nprint(ans)\r\n\r\n\r\n", "__author__ = 'liraim'\n\n\ndef read():\n input_data = input().split()\n [height, width] = [int(input_data[0]), int(input_data[1])]\n data = []\n for i in range(height):\n data.append(input())\n return width, height, data\n\ndef solve(task_data):\n (width, height, input_data) = task_data\n count = 0\n for i in range(height - 1):\n for j in range(width - 1):\n line = input_data[i][j] + input_data[i + 1][j] + input_data[i][j + 1] + input_data[i + 1][j + 1]\n if 'f' in line and 'a' in line and 'c' in line and 'e' in line:\n count += 1\n return count\n\nprint(solve(read()))", "n,m=map(int,input().split())\r\nl=[]\r\ns={'f','a','c','e'}\r\nfor i in range(n):\r\n l.append(input())\r\nc=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if(set([l[i][j],l[i][j+1],l[i+1][j],l[i+1][j+1]])==s):\r\n c=c+1\r\nprint(c)\r\n", "n,m = map(int,input().split())\r\nif (n<2 or m<2):\r\n print(0)\r\nelse:\r\n s=[]\r\n ans=0\r\n for i in range(n):\r\n s.append(input().split())\r\n for a in range(n-1):\r\n for b in range(m-1):\r\n s1=s[a][0][b]+s[a+1][0][b]+s[a][0][b+1]+s[a+1][0][b+1]\r\n if(s1.count('f')==1 & s1.count('a')==1):\r\n if(s1.count('c')==1 & s1.count('e')==1):\r\n ans+=1\r\n print(ans)", "def tu():\r\n n, m = map(int, input().split())\r\n a = 'x'*(m+1)\r\n p = ['f','a','c','e']\r\n d = dict()\r\n ans=0\r\n for i in range(97, 123):\r\n d[chr(i)] = 0\r\n for i in range(n):\r\n s = input()+'x'\r\n for j in range(m):\r\n d[s[j]] = 1\r\n d[s[j+1]] = 1\r\n d[a[j]] = 1\r\n d[a[j+1]] = 1\r\n for j in p:\r\n if d[j] == 0:\r\n break\r\n else:\r\n ans+=1\r\n #print(s)\r\n for j in p:\r\n d[j] = 0\r\n a = s\r\n print(ans)\r\ntu()", "n, m = map(int, input().split())\r\nL = ['a', 'c', 'e', 'f']\r\nL2 = []\r\nch = []\r\nnbr = 0\r\n\r\nif n == 1 or m == 1:\r\n print(nbr)\r\nelse:\r\n for i in range(n):\r\n y = input()\r\n ch.append(y)\r\n \r\n if n >= 2 and m >= 2:\r\n for i in range(n-1):\r\n for j in range(m-1):\r\n if ch[i][j] in L and ch[i][j+1] in L and ch[i+1][j] in L and ch[i+1][j+1] in L:\r\n L2 = [ch[i][j], ch[i][j+1], ch[i+1][j], ch[i+1][j+1]]\r\n if sorted(L2) == L:\r\n nbr += 1\r\n \r\n print(nbr)\r\n\r\n ", "y, x = map(int, input().split())\nmatrix = []\nfor i in range(y):\n string = list(map(str, input()))\n matrix.append(string)\ncount = 0\nfor i in range(y):\n for j in range(x):\n if(j<x-1 and i<y-1):\n miniMatrix = matrix[i][j] + matrix[i][j+1] + matrix[i+1][j] + matrix[i+1][j+1]\n if('f' in miniMatrix and 'a' in miniMatrix and 'c' in miniMatrix and 'e' in miniMatrix):\n count += 1\nprint(count)\n\t\t \t \t\t \t\t\t \t \t \t\t\t\t \t \t", "n, m = map(int, input().split())\nM = [str(input()) for _ in range(n)]\nr = 0\nfor i in range(n-1):\n for j in range(m-1):\n s = set()\n s.add(M[i][j])\n s.add(M[i+1][j])\n s.add(M[i][j+1])\n s.add(M[i+1][j+1])\n if \"f\" in s and \"a\" in s and \"c\" in s and \"e\" in s:\n r += 1\nprint(r)\n", "n, m = map(int, input().split())\r\nlst, dem = [input() for x in range(n)], 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n k = [lst[i][j], lst[i + 1][j], lst[i][j + 1], lst[i + 1][j + 1]]\r\n k.sort()\r\n if k[0] == 'a' and k[1] == 'c' and k[2] == 'e' and k[3] == 'f': dem += 1\r\nprint(dem)", "n, m = map(int, input().split())\r\nmaps = [\r\n list(\"face\"),\r\n list(\"faec\"),\r\n list(\"fcae\"),\r\n list(\"fcea\"),\r\n list(\"feac\"),\r\n list(\"feca\"),\r\n list(\"afce\"),\r\n list(\"afec\"),\r\n list(\"acfe\"),\r\n list(\"acef\"),\r\n list(\"aefc\"),\r\n list(\"aecf\"),\r\n list(\"cfae\"),\r\n list(\"cfea\"),\r\n list(\"cafe\"),\r\n list(\"caef\"),\r\n list(\"cefa\"),\r\n list(\"ceaf\"),\r\n list(\"efac\"),\r\n list(\"efca\"),\r\n list(\"eafc\"),\r\n list(\"eacf\"),\r\n list(\"ecfa\"),\r\n list(\"ecaf\")]\r\nma = []\r\nfor i in range(n):\r\n *s, = input()\r\n ma.append(s)\r\na = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if any(x[0] == ma[i][j] and x[1] == ma[i + 1][j] and x[2] == ma[i][j + 1] and x[3] == ma[i + 1][j + 1] for x in maps):\r\n a += 1\r\nprint(a)\r\n", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\nex = ['a', 'c', 'e', 'f']\r\nans = 0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n b.append(a[i][j])\r\n b.append(a[i][j + 1])\r\n b.append(a[i + 1][j])\r\n b.append(a[i + 1][j + 1])\r\n b.sort()\r\n if b == ex:\r\n ans += 1\r\n b.clear()\r\nprint(ans)", "n,m = map(int, input().split(' '))\r\n\r\nans = 0\r\n\r\narr = [input() for i in range(n)]\r\n\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tif {arr[i][j],arr[i+1][j],arr[i][j+1],arr[i+1][j+1]} == {'f','a','c','e'}:\tans=ans+1\r\n\r\nprint (ans)\r\n", "__author__ = 'Данила'\r\nn, m = map(int, input().split())\r\nmat = [['' for i in range(m)] for j in range(n)]\r\n\r\nfor i in range(n):\r\n s = input().rstrip()\r\n for j in range(len(s)):\r\n mat[i][j] = s[j]\r\ncnt = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n mn = set()\r\n mn.add(mat[i][j])\r\n mn.add(mat[i + 1][j])\r\n mn.add(mat[i][j + 1])\r\n mn.add(mat[i + 1][j + 1])\r\n if 'f' in mn and 'a' in mn and 'c' in mn and 'e' in mn:\r\n cnt += 1\r\n\r\nprint(cnt)", "def isface(lst):\r\n face = set('face')\r\n for i in range(4):\r\n if lst[i] in face:\r\n face.remove(lst[i])\r\n else:\r\n return False\r\n return True\r\n\r\n\r\nn, m = map(int, input().split())\r\narr = list([input() for i in range(n)])\r\n\r\nfaces = 0\r\nif not n == 1 and not m == 1:\r\n for i in range(n-1):\r\n for j in range(m-1):\r\n if isface((arr[i][j], arr[i+1][j], arr[i][j+1], arr[i+1][j+1])):\r\n faces += 1\r\n\r\nprint(faces)\r\n", "n,m=map(int,input().split())\r\ns=[input()for _ in range(n)]\r\nprint(sum([set('face')==set([s[i][j],s[i+1][j],s[i][j+1],s[i+1][j+1]]) for i in range(n-1) for j in range(m-1)]))", "# print (\"Input n and m\")\nthepair = input().split()\nn = int(thepair[0])\nm = int(thepair[1])\nif (n==1 or m==1):\n print(0)\nelse: # Each dimension at least two\n answer = 0\n a = [[0 for i in range(m)] for j in range(n)] # Initialize to all zero\n for r in range(n):\n # print (\"Input the next row\")\n a[r] = input()\n\n for r in range(0,n-1):\n for c in range(0,m-1):\n s = []\n s.append(a[r][c])\n s.append(a[r+1][c])\n s.append(a[r][c+1])\n s.append(a[r+1][c+1])\n s = sorted(s)\n if (s[0] == \"a\" and s[1] == \"c\" and s[2] == \"e\" and s[3] == \"f\"):\n answer = answer + 1\n print (answer)\n \n \n \n \n", "n, m = map(int, input().split())\r\nimg = []\r\nfor i in range(n):\r\n img.append(list(input()))\r\nans = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n t = sorted([img[i][j], img[i + 1][j], img[i][j + 1], img[i + 1][j + 1]])\r\n if 'acef' == ''.join(t):\r\n ans += 1\r\nprint(ans)\r\n", "\"\"\"\r\nCodeforces Looksery Cup 2015 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.4.2\r\n\"\"\"\r\n\r\n################################################### SOLUTION\r\n\r\ndef main():\r\n n,m = read()\r\n s = []\r\n for i in range(n): s.append(read(0))\r\n\r\n ans = 0\r\n for i in range(n-1):\r\n for j in range(m-1):\r\n if {s[i][j], s[i][j+1], s[i+1][j], s[i+1][j+1]} == set(\"face\"):\r\n ans += 1\r\n return ans\r\n\r\n\r\n\r\n#################################################### HELPERS\r\n\r\n\r\n\r\ndef read(mode=2):\r\n # 0: String\r\n # 1: List of strings\r\n # 2: List of integers\r\n inputs = input().strip()\r\n if mode == 0: return inputs\r\n if mode == 1: return inputs.split()\r\n if mode == 2: return list(map(int, inputs.split()))\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = \"\"\r\n if isinstance(s, list): s = \" \".join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\nwrite(main())", "n, m = map(int, input().split())\nboard = [input() for i in range(n)]\nans = 0\nfor i in range(n-1):\n for j in range(m-1):\n s = [board[i][j], board[i+1][j], board[i][j+1], board[i+1][j+1]]\n if 'f' in s and 'a' in s and 'c' in s and 'e' in s:\n ans += 1\nprint(ans)\n", "h, w = map(int,input().split())\r\na = []\r\nfor i in range (h):\r\n a.append(input())\r\nc = 0\r\nfor i in range(h-1):\r\n for j in range(w-1):\r\n s=a[i][j:j+2] + a[i+1][j:j+2] \r\n if 'f' in s and 'a' in s and 'c' in s and 'e' in s:\r\n c += 1\r\nprint(c)", "def inp():\r\n n, m = map(int, input().split())\r\n table = []\r\n for i in range(n):\r\n table.append(input())\r\n return n, m, table\r\n\r\ndef check(letters):\r\n return sorted(list(letters)) == [\"a\", \"c\", \"e\", \"f\"]\r\n\r\n\r\ndef main():\r\n n, m, t = inp()\r\n k = 0\r\n for i in range(n-1):\r\n for j in range(m-1):\r\n if check(t[i][j:j+2] + t[i+1][j:j+2]):\r\n k += 1\r\n print(k)\r\n\r\n\r\nmain()", "\r\n\r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\nsq=list()\r\n\r\nfor i in range(n):\r\n a=list(input())\r\n sq.append(a)\r\n\r\n\r\nc=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n face = ['f', 'a', 'c', 'e']\r\n if sq[i][j] in face:\r\n face.remove(sq[i][j])\r\n if sq[i][j+1] in face:\r\n face.remove(sq[i][j+1])\r\n if sq[i+1][j] in face:\r\n face.remove(sq[i+1][j])\r\n if sq[i+1][j+1] in face:\r\n c+=1\r\n\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n", "R = lambda:list(map(int,input().split()))\r\nn,m = R()\r\nrs = 0\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n \r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n c = []\r\n c.append(a[i][j])\r\n c.append(a[i+1][j])\r\n c.append(a[i][j+1])\r\n c.append(a[i+1][j+1])\r\n u = set(c)\r\n if len(u) == 4:\r\n if 'f' in u:\r\n if 'a' in u:\r\n if 'c' in u:\r\n if 'e' in u:\r\n rs += 1 \r\nprint(rs)", "if __name__ == '__main__':\n n, m=map(int,input().split())\n s=[input()for _ in range(n)]\n faces = 0\n face_set = {'f','a','c','e'}\n for i in range(n-1):\n for j in range(m-1):\n if {s[i][j],s[i+1][j],s[i][j+1],s[i+1][j+1]} == face_set:\n faces += 1\n print(faces)\n \t\t\t \t\t\t \t\t \t \t \t \t\t", "n, m = map(int, input().split())\nans = 0\nA = [input() for i in range(n)]\nfor i in range(n - 1):\n for j in range(m - 1):\n if sorted(A[i][j] + A[i][j + 1] + A[i + 1][j] + A[i + 1][j + 1]) == sorted(\"face\"):\n ans += 1\nprint(ans)\n\n", "n, m = map(int, input().split())\r\n\r\nans = 0\r\nmatrix = []\r\n\r\nfor _ in range(n):\r\n matrix.append(input())\r\n\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n maybe_face = []\r\n\r\n maybe_face.append(matrix[i][j])\r\n maybe_face.append(matrix[i][j+1])\r\n maybe_face.append(matrix[i+1][j+1])\r\n maybe_face.append(matrix[i+1][j])\r\n\r\n maybe_face.sort()\r\n\r\n if maybe_face == ['a', 'c', 'e', 'f']:\r\n ans += 1\r\n\r\nprint(ans)", "h, w = [int(x) for x in input().split(' ')]\r\nb = []\r\nfaces = 0\r\n\r\nfor i in range(h):\r\n b += [input()]\r\n\r\nfor i in range(h - 1):\r\n for j in range(w - 1):\r\n if ''.join(sorted(b[i][j:j+2] + b[i+1][j:j+2])) == 'acef':\r\n faces += 1\r\n\r\nprint(faces)\r\n", "n, m = map(int,input().split())\r\nA = []\r\nfor i in range(n):\r\n A.append(list(input()))\r\n# print(A)\r\nF = []\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n try:\r\n if A[i][j] != 'x':\r\n F =[A[i][j],A[i][j+1],A[i+1][j],A[i+1][j+1]]\r\n if 'f' in F and 'a' in F and 'c' in F and 'e' in F:\r\n count += 1\r\n except (IndexError):\r\n continue\r\nprint(count)", "n, m=map(int, input().split())\nl=[]\nfor i in range(n):\n l.append(input())\na=0\nfor i in range(n-1):\n for r in range(m-1):\n t=l[i][r:r+2]+l[i+1][r:r+2]\n if(\"f\" in t and \"a\" in t and \"c\" in t and \"e\" in t):\n a+=1\nprint(a)\n", "n, m = (int(i) for i in input().split())\np = [[c for c in input()] for _ in range(n)]\nres, face = 0, set(list(\"face\"))\nfor r in range(1, n):\n for c in range(1, m):\n res += set([p[r - 1][c - 1], p[r - 1][c], p[r][c - 1], p[r][c]]) == face\nprint(res)\n", "n,m = [int(c) for c in input().split()]\r\n\r\nlines = []\r\nfor i in range(n):\r\n lines.append(input())\r\n\r\nf = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n s = set()\r\n s.add(lines[i][j])\r\n s.add(lines[i+1][j])\r\n s.add(lines[i][j+1])\r\n s.add(lines[i+1][j+1])\r\n if 'f' in s and 'a' in s and 'c' in s and 'e' in s:\r\n f +=1\r\n\r\nprint(f)\r\n", "h, w = map(int, input().split())\r\nans = 0\r\nimage = [input() for _ in range(h)]\r\nface = set('face')\r\nfor j in range(h - 1):\r\n for i in range(w - 1):\r\n if image[j][i] in face:\r\n s = {image[j + dj][i + di] for dj in (0, 1) for di in (0, 1)}\r\n if s == face:\r\n ans += 1\r\nprint(ans)\r\n", "n, m = (int(x) for x in input().split())\narr = [input() for i in range(n)]\n\nres = 0\nfor i in range(n-1):\n for j in range(m-1):\n a = \"\".join(sorted([arr[i][j], arr[i][j+1], arr[i+1][j], arr[i+1][j+1]]))\n if a == \"acef\":\n res += 1\n\nprint(res)", "n, m = [int(i) for i in input().split()]\r\nimg = [list(input()) for i in range(n)]\r\ncnt = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n arr = [img[i][j], img[i + 1][j], img[i][j + 1], img[i + 1][j + 1]]\r\n if 'f' in arr and 'a' in arr and 'c' in arr and 'e' in arr:\r\n cnt += 1\r\nprint(cnt)", "string = input()\r\nnumbers = string.split()\r\na = int(numbers[0])\r\nb = int(numbers[1])\r\nrows = []\r\nfor x in range(a):\r\n row = input()\r\n rows.append(row)\r\nfaces = 0\r\nfor x in range(a - 1):\r\n for y in range(b - 1):\r\n p = rows[x]\r\n q = rows[x + 1]\r\n face = [\"f\", \"a\", \"c\", \"e\"]\r\n square = [p[y], p[y + 1], q[y], q[y + 1]]\r\n condition = True\r\n for z in face:\r\n if not z in square:\r\n condition = False\r\n if condition:\r\n faces += 1\r\nprint(faces)", "a = [int(j) for j in input().split()]\r\nw = []\r\nfor k in range(a[0]):\r\n w.append(input())\r\nif a[0] == 1 or a[1] == 1:\r\n b = 0\r\nelse:\r\n b = 0\r\n for k in range(a[0]-1):\r\n for j in range(a[1]-1):\r\n s = w[k][j:j+2] + w[k+1][j:j+2]\r\n if 'a' in s and 'f' in s and 'c' in s and 'e' in s:\r\n b += 1\r\nprint(b)", "def main():\n [n_rows, n_cols] = [int(_) for _ in input().split()]\n rows = [input() for _ in range(n_rows)]\n face_count = 0\n\n for i in range(n_rows - 1):\n for j in range(n_cols - 1):\n chars = [rows[i][j], rows[i][j + 1], rows[i + 1][j], rows[i + 1][j + 1]]\n chars.sort()\n\n if ''.join(chars) == 'acef':\n face_count += 1\n\n print(face_count)\n\n\nif __name__ == '__main__':\n main()\n", "n,m = list(map(int, input().split(\" \")))\r\na=[]\r\nstr=\"\"\r\ncount=0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n-1):\r\n for j in range(m):\r\n str=a[i][j:j+2]+a[i+1][j:j+2]\r\n if sorted(str)==[*\"acef\"]:\r\n count+=1\r\n str=\"\"\r\nprint(count)", "a, b = [int(x) for x in input().split()]\nlines = []\nfor i in range(a):\n\tlines.append(input())\ncount = 0\nface = {'f', 'a', 'c', 'e'}\nfor i in range(a):\n\tfor j in range(b):\n\t\tif(lines[i][j] == 'f'):\n\t\t\tif(i != 0 and j != 0 and {lines[i][j-1], lines[i-1][j], lines[i-1][j-1], lines[i][j]} == face):\n\t\t\t\tcount += 1\n\t\t\tif(i != 0 and j != b-1 and {lines[i][j+1], lines[i-1][j], lines[i-1][j+1], lines[i][j]} == face):\n\t\t\t\tcount += 1\n\t\t\tif(i != a-1 and j != 0 and {lines[i][j-1], lines[i+1][j], lines[i+1][j-1], lines[i][j]} == face):\n\t\t\t\tcount += 1\n\t\t\tif(i != a-1 and j != b-1 and {lines[i][j+1], lines[i+1][j], lines[i+1][j+1], lines[i][j]} == face):\n\t\t\t\tcount += 1\nprint(count)", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a += [input()]\r\nf = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n f += sorted(a[i][j:j + 2:] + a[i + 1][j:j + 2:]) == ['a', 'c', 'e', 'f']\r\nprint (f)", "n, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\n\r\ncount = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n square = grid[i][j] + grid[i][j+1] + grid[i+1][j] + grid[i+1][j+1]\r\n if sorted(square) == list('acef'):\r\n count += 1\r\n\r\nprint(count)\r\n", "\r\nn, m = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n\tl.append(list(input()))\r\n\r\nans = list('acef')\r\nco = 0\r\n\r\nfor i in range(n - 1):\r\n\tfor j in range(m - 1):\r\n\t\tli = []\r\n\t\tli.append(l[i][j])\r\n\t\tli.append(l[i + 1][j])\r\n\t\tli.append(l[i][j + 1])\r\n\t\tli.append(l[i + 1][j + 1])\r\n\t\tif sorted(li) == ans:\r\n\t\t\tco += 1\r\n\r\nprint(co)\r\n\t", "n, m = map(int, input().split())\r\nimg = []\r\nc = 0\r\n\r\nfor i in range(n):\r\n img.append(list(input()))\r\n\r\nfor r in range(n-1):\r\n for col in range(m-1):\r\n if \"\".join(sorted(list(img[r][col]+img[r][col+1]+img[r+1][col]+img[r+1][col+1]))) == \"acef\":\r\n c+=1\r\n\r\nprint(c)", "n , m = map(int,input().split())\r\nlst = list(input()for i in range(n))\r\ncounter = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if sorted(lst[i][j:j + 2] + lst[i+1][j:j + 2]) == ['a', 'c', 'e', 'f']:\r\n counter += 1\r\nprint(counter)", "n, m = map(int, input().split())\r\nanswer = 0\r\nface_detector = [input() for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if face_detector[i][j] == 'f':\r\n if i > 0:\r\n if j > 0:\r\n if face_detector[i-1][j] == 'a':\r\n if face_detector[i-1][j-1] == 'c':\r\n if face_detector[i][j-1] == 'e':\r\n answer += 1\r\n elif face_detector[i-1][j-1] == 'e':\r\n if face_detector[i][j-1] == 'c':\r\n answer += 1\r\n elif face_detector[i-1][j] == 'c':\r\n if face_detector[i-1][j-1] == 'a':\r\n if face_detector[i][j-1] == 'e':\r\n answer += 1\r\n elif face_detector[i-1][j-1] == 'e':\r\n if face_detector[i][j-1] == 'a':\r\n answer += 1\r\n elif face_detector[i-1][j] == 'e':\r\n if face_detector[i-1][j-1] == 'c':\r\n if face_detector[i][j-1] == 'a':\r\n answer += 1\r\n elif face_detector[i-1][j-1] == 'a':\r\n if face_detector[i][j-1] == 'c':\r\n answer += 1\r\n if j < m-1:\r\n if face_detector[i-1][j] == 'a':\r\n if face_detector[i-1][j+1] == 'c':\r\n if face_detector[i][j+1] == 'e':\r\n answer += 1\r\n elif face_detector[i-1][j+1] == 'e':\r\n if face_detector[i][j+1] == 'c':\r\n answer += 1\r\n elif face_detector[i-1][j] == 'c':\r\n if face_detector[i-1][j+1] == 'a':\r\n if face_detector[i][j+1] == 'e':\r\n answer += 1\r\n elif face_detector[i-1][j+1] == 'e':\r\n if face_detector[i][j+1] == 'a':\r\n answer += 1\r\n elif face_detector[i-1][j] == 'e':\r\n if face_detector[i-1][j+1] == 'c':\r\n if face_detector[i][j+1] == 'a':\r\n answer += 1\r\n elif face_detector[i-1][j+1] == 'a':\r\n if face_detector[i][j+1] == 'c':\r\n answer += 1\r\n if i < n-1:\r\n if j > 0:\r\n if face_detector[i+1][j] == 'a':\r\n if face_detector[i+1][j-1] == 'c':\r\n if face_detector[i][j-1] == 'e':\r\n answer += 1\r\n elif face_detector[i+1][j-1] == 'e':\r\n if face_detector[i][j-1] == 'c':\r\n answer += 1\r\n elif face_detector[i+1][j] == 'c':\r\n if face_detector[i+1][j-1] == 'a':\r\n if face_detector[i][j-1] == 'e':\r\n answer += 1\r\n elif face_detector[i+1][j-1] == 'e':\r\n if face_detector[i][j-1] == 'a':\r\n answer += 1\r\n elif face_detector[i+1][j] == 'e':\r\n if face_detector[i+1][j-1] == 'c':\r\n if face_detector[i][j-1] == 'a':\r\n answer += 1\r\n elif face_detector[i+1][j-1] == 'a':\r\n if face_detector[i][j-1] == 'c':\r\n answer += 1\r\n if j < m-1:\r\n if face_detector[i+1][j] == 'a':\r\n if face_detector[i+1][j+1] == 'c':\r\n if face_detector[i][j+1] == 'e':\r\n answer += 1\r\n elif face_detector[i+1][j+1] == 'e':\r\n if face_detector[i][j+1] == 'c':\r\n answer += 1\r\n elif face_detector[i+1][j] == 'c':\r\n if face_detector[i+1][j+1] == 'a':\r\n if face_detector[i][j+1] == 'e':\r\n answer += 1\r\n elif face_detector[i+1][j+1] == 'e':\r\n if face_detector[i][j+1] == 'a':\r\n answer += 1\r\n elif face_detector[i+1][j] == 'e':\r\n if face_detector[i+1][j+1] == 'c':\r\n if face_detector[i][j+1] == 'a':\r\n answer += 1\r\n elif face_detector[i+1][j+1] == 'a':\r\n if face_detector[i][j+1] == 'c':\r\n answer += 1\r\nprint(answer)", "import sys\r\n\r\n\r\n\r\ninput = []\r\ninput_index = 0\r\n\r\ndef next(type, number = None):\r\n\tdef next():\r\n\t\tglobal input, input_index\r\n\t\t\r\n\t\t\r\n\t\twhile input_index == len(input):\r\n\t\t\tif sys.stdin:\r\n\t\t\t\tinput = sys.stdin.readline().split()\r\n\t\t\t\tinput_index = 0\r\n\t\t\telse:\r\n\t\t\t\traise Exception()\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\tinput_index += 1\r\n\t\t\r\n\t\treturn input[input_index - 1]\r\n\t\t\r\n\t\t\r\n\tif number is None:\r\n\t\tresult = type(next())\r\n\telse:\r\n\t\tresult = [type(next()) for _ in range(number)]\r\n\t\t\r\n\treturn result\r\n\t\r\n\t\r\n\t\r\nn, m = next(int, 2)\r\niis = [next(str) for _ in range(n)]\r\n\r\n\r\ncount = 0\r\n\r\nfor i in range(n - 1):\r\n\tfor j in range(m - 1):\r\n\t\ts = {iis[i][j], iis[i+1][j], iis[i][j+1], iis[i+1][j+1]}\r\n\t\t\r\n\t\tif \"f\" in s and \"a\" in s and \"c\" in s and \"e\" in s:\r\n\t\t\tcount += 1\r\n\t\t\t\r\n\t\t\t\r\nprint(count)\r\n", "nub = input().split(' ')\r\nn = int(nub[0])\r\nm = int(nub[1])\r\n\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n matrix.append(input())\r\n\r\n\r\n\r\ndef face(matx, i, j):\r\n if \"\".join(sorted(matx[i][j:j+2] + matx[i+1][j:j+2])) == \"acef\":\r\n return 1\r\n return 0\r\n\r\nk = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if face(matrix, i, j) == 1:\r\n k += 1\r\n\r\nprint(k)", "n, m = map(int, input().split())\r\nans = 0\r\nl = []\r\nface = ['a', 'c', 'e', 'f']\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n ar = []\r\n if l[i][j] == 'f' or l[i][j] == 'a' or l[i][j] == 'c' or l[i][j] == 'e':\r\n ar.append(l[i][j]), ar.append(l[i][j + 1]), ar.append(l[i + 1][j]), ar.append(l[i + 1][j + 1])\r\n if sorted(ar) == face:\r\n ans += 1\r\nprint(ans)", "qtas_faces = 0\ninp = input().split(' ')\nn = int(inp[0])\nm = int(inp[1])\nmat = []\nfor i in range(n):\n mat.append([char for char in input()])\nfor i in range(n-1):\n for j in range(m-1):\n if set('face') == {mat[i][j],mat[i][j+1],mat[i+1][j],mat[i+1][j+1]}:#\"set()\" S2! Salvou a questão.\n qtas_faces += 1\nprint(qtas_faces)\n \t \t\t\t\t \t \t \t\t\t \t\t \t \t \t", "n, m = map(int, input().split())\r\n\r\nx = []\r\n\r\nfor a in range(n):\r\n x.append(input())\r\n\r\nfaces = 0\r\nfor i in range(0, n-1):\r\n for j in range(0, m-1):\r\n f = []\r\n f.append(x[i][j])\r\n f.append(x[i][j+1])\r\n f.append(x[i+1][j])\r\n f.append(x[i+1][j+1])\r\n f = sorted(f)\r\n if ''.join(f) == \"acef\":\r\n faces += 1\r\n\r\nprint(faces)", "n, m = map(int, input().split())\r\ns = []\r\nk = 0\r\nface = ['f', 'a', 'c', 'e']\r\nface.sort()\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n isface = []\r\n isface.append(s[i][j])\r\n isface.append(s[i][j+1])\r\n isface.append(s[i+1][j])\r\n isface.append(s[i+1][j+1])\r\n isface.sort()\r\n if isface == face:\r\n k += 1\r\nprint(k)\r\n", "n,m=map(int,input().split(\" \"))\r\na=[input() for x in range(n)]\r\nprint(sum(sorted(a[x][y:y+2]+a[x+1][y:y+2])==sorted(\"face\") for x in range(n-1) for y in range(m-1)))", "n, m = map(int, input().split())\na = [input().replace('', ' ').split() for i in range(n)]\nres = 0\nfor i in range(n - 1):\n for j in range(m - 1):\n s = a[i][j] + a[i][j + 1] + a[i + 1][j] + a[i + 1][j + 1]\n if sorted(s) == ['a', 'c', 'e', 'f']: res += 1\nprint(res)", "n, m = [int(x) for x in input().split()]\r\n\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append(list(input().strip()))\r\n \r\nret = 0\r\nfor x in range(n-1):\r\n for y in range(m-1):\r\n g = grid[x][y:y+2]\r\n g.extend(grid[x+1][y:y+2])\r\n ok = True\r\n for c in 'face':\r\n if c not in g:\r\n ok = False\r\n if ok:\r\n ret+=1\r\n \r\nprint(ret)", "h,w = map(int,input().split())\r\nP = [] \r\nfor i in range(1,h+1):\r\n P.append(list(input().strip()))\r\n\r\nc = 0\r\nfor i in range(h-1):\r\n for j in range(w-1):\r\n word = P[i][j] + P[i][j+1] + P[i+1][j] + P[i+1][j+1]\r\n if ''.join(sorted(word)) == \"acef\":\r\n c+=1 \r\n \r\nprint(c)", "n,m=map(int,input().split())\r\ninp=[]\r\nfor _ in range(n):\r\n inp.append(input())\r\nans=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n a=\"\"\r\n a+=inp[i][j]\r\n a+=inp[i][j+1]\r\n a+=inp[i+1][j]\r\n a+=inp[i+1][j+1]\r\n a=list(a)\r\n a.sort()\r\n if(a==['a','c','e','f']):\r\n ans+=1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nlst = []\r\nc = 0\r\nfor i in range(n):\r\n lst.append(input())\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if set([lst[i][j], lst[i+1][j], lst[i][j+1], lst[i+1][j+1]]) == set(['f', 'a', 'c', 'e']):\r\n c += 1\r\nprint(c)\r\n", "nub = input().split(' ')\r\nn = int(nub[0])\r\nm = int(nub[1])\r\n\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n matrix.append(input())\r\n\r\n\r\n\r\ndef face(matx, i, j):\r\n if matx[i][j] == \"f\" or matx[i+1][j] == \"f\" or matx[i][j+1] == \"f\" or matx[i+1][j+1] == \"f\":\r\n if matx[i][j] == \"a\" or matx[i+1][j] == \"a\" or matx[i][j+1] == \"a\" or matx[i+1][j+1] == \"a\":\r\n if matx[i][j] == \"c\" or matx[i+1][j] == \"c\" or matx[i][j+1] == \"c\" or matx[i+1][j+1] == \"c\":\r\n if matx[i][j] == \"e\" or matx[i+1][j] == \"e\" or matx[i][j+1] == \"e\" or matx[i+1][j+1] == \"e\":\r\n return 1\r\n return 0\r\n\r\nk = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if face(matrix, i, j) == 1:\r\n k += 1\r\n\r\nprint(k)", "n , m = map(int,input().split())\r\nl = list(input()for i in range(n))\r\nprint(sum(sorted(l[i][j:j+2]+l[i+1][j:j+2]) == sorted(\"face\")for i in range(n-1)for j in range(m-1)))", "n,m=map(int,input().split())\r\ng=[]\r\nfor _ in range(n):\r\n g.append(input())\r\nif n<2 or m<2:\r\n print(0)\r\n exit()\r\nans=0\r\nfor i in range(0,n-1):\r\n for j in range(0,m-1):\r\n l=sorted([g[i][j],g[i+1][j],g[i][j+1],g[i+1][j+1]])\r\n if ''.join(l)=='acef':\r\n ans+=1\r\nprint(ans)", "n, m = [int(x) for x in input().split()]\r\nimage = []\r\nfor i in range(n):\r\n image.append(list(input()))\r\nans = 0\r\nfor i in range(n - 1):\r\n for j in range (m - 1):\r\n det = ['f', 'a', 'c', 'e']\r\n if image[i][j] in det:\r\n det.remove(image[i][j])\r\n if image[i + 1][j] in det:\r\n det.remove(image[i + 1][j])\r\n if image[i][j + 1] in det:\r\n det.remove(image[i][j + 1])\r\n if image[i + 1][j + 1] in det:\r\n det.remove(image[i + 1][j + 1])\r\n if len(det) == 0:\r\n ans += 1\r\nprint(ans)\r\n", "\r\nr, c = map(lambda x: int(x) ,input().split())\r\n\r\nimg = []\r\nfor i in range(r):\r\n img.append([])\r\n line = input()\r\n for j in range(c):\r\n img[i].append(line[j])\r\n\r\ncount=0\r\nfor i in range(r-1):\r\n for j in range(c-1):\r\n test = [img[i][j], img[i+1][j], img[i][j+1], img[i+1][j+1]]\r\n if all([x in test for x in \"face\"]):\r\n count +=1\r\n\r\nprint(count)", "n, m =map(int, input().split())\r\nx=[]\r\nfor i in range(n):\r\n x.append(input())\r\nc = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n k = [x[i][j], x[i+1][j], x[i][j+1], x[i+1][j+1]]\r\n if ''.join(sorted(k)) == 'acef':\r\n c += 1\r\nprint(c)", "n, m = [int(x) for x in input().split()]\n\ndata = []\nfor i in range(n):\n tmp = input()\n data.append(tmp)\n\ncnt = 0\nfor i in range(n - 1):\n for j in range(m - 1):\n tmp = list(sorted([data[i][j], data[i][j + 1], data[i + 1][j], data[i + 1][j + 1]]))\n if tmp == ['a', 'c', 'e', 'f']:\n cnt += 1\n\nprint(cnt)\n", "def findFace(i,j,img):\n letters = [img[i][j], img[i][j+1], img[i+1][j], img[i+1][j+1]]\n return set(letters) == set(\"face\")\n\nn, m = [int(k) for k in input().split()]\nimg = []\ntotal = 0\nfor i in range(n):\n img.append(input())\nfor i in range(n):\n for j in range(m):\n if img[i][j] in \"face\" and i != n-1 and j != m-1:\n if findFace(i, j, img):\n total +=1\nprint(total)\n\t \t \t \t \t\t \t \t\t \t\t\t", "n,m=map(int,input().split())\r\nl=[input() for _ in range(n)]\r\nco=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n s=[l[i][j]]\r\n s.append(l[i][j+1])\r\n s.append(l[i+1][j])\r\n s.append(l[i+1][j+1])\r\n s.sort()\r\n if ''.join(s)==\"acef\":\r\n co+=1\r\nprint(co)\r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 31 00:34:19 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n#http://codeforces.com/problemset/problem/549/A --- Alexis Galvan\r\n\r\n\r\ndef face_detection():\r\n size = list(map(int, input().split()))\r\n \r\n if size[0] == 1:\r\n return 0\r\n \r\n maze = []\r\n dic = {'f':1,'a':2,'c':3,'e':4}\r\n \r\n \r\n for i in range(size[0]):\r\n maze.append(input())\r\n \r\n output = 0\r\n for i in range(1, len(maze)):\r\n for j in range(1, len(maze[i])):\r\n if maze[i][j] in dic:\r\n alt_dic = dic.copy()\r\n alt_dic.pop(maze[i][j])\r\n if maze[i-1][j-1] in alt_dic:\r\n alt_dic.pop(maze[i-1][j-1])\r\n if maze[i-1][j] in alt_dic:\r\n alt_dic.pop(maze[i-1][j])\r\n if maze[i][j-1] in alt_dic:\r\n output += 1\r\n \r\n return output\r\n\r\n\r\nA = face_detection()\r\nprint(A)\r\n \r\n \r\n \r\n ", "n, m = map(int, input().split())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(list(input()))\r\n\r\nans = 0\r\n\r\nif n >= 2:\r\n for i in range(n):\r\n for j in range(m):\r\n if i < n-1 and j < m-1:\r\n if set(a[i][j]+a[i+1][j]+a[i][j+1]+a[i+1][j+1]) == {'c', 'a', 'e', 'f'}:\r\n ans += 1\r\n print(ans)\r\nelse:\r\n print(ans)\r\n", "q=[int(i) for i in input().split()]\r\nn=q[0]\r\nm=q[1]\r\na=[]\r\nface=set(\"face\")\r\ncount=0\r\nfor inp in range(n):\r\n\ta.append(input())\r\nif(n<2 or m < 2 ):\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(n-1):\r\n\t\tfor j in range(m-1):\r\n\t\t\tstring=a[i][j]+a[i][j+1]+a[i+1][j]+a[i+1][j+1]\r\n\t\t\tif(set(string)==face):\r\n\t\t\t\tcount+=1\r\n\tprint(count)\r\n\r\n", "n, m = map(int, input().split())\n\npicture = []\nfor i in range(n):\n\t\tpicture.append([letter for letter in input()])\n\ndef check_face(letter, coordinate, matrix):\n\tneeded = [ \"f\", \"a\", \"c\", \"e\" ]\n\tneeded.pop(needed.index(letter))\n\tfor i in range(coordinate[0], coordinate[0]+2):\n\t\tfor j in range(coordinate[1], coordinate[1]+2):\n\t\t\tif i == coordinate[0] and j == coordinate[1]:\n\t\t\t\tcontinue\n\t\t\tif matrix[i][j] in needed:\n\t\t\t\tneeded.pop(needed.index(matrix[i][j]))\n\t\t\telse:\n\t\t\t\treturn False\n\tif needed == []:\n\t\treturn True\n\telse:\n\t\treturn False\n\nface_count = 0\nfor i in range(n-1):\n\tfor j in range(m-1):\n\t\tcursor = picture[i][j]\n\t\tif cursor == \"f\" or cursor == \"a\" or cursor == \"c\" or cursor == \"e\":\n\t\t\tis_face = check_face(cursor, [i,j], picture)\n\t\t\tif is_face:\n\t\t\t\tface_count += 1\n\nprint(face_count)", "\r\nn, m = list(map(int, input().split()))\r\ninp = []\r\n\r\nfor i in range(n):\r\n inp.append(input())\r\n\r\n\r\ncount = 0\r\nfor i in range(0, n-1):\r\n for j in range(0, m-1):\r\n\r\n if (inp[i][j] == 'x'):\r\n continue\r\n\r\n valid = ['f', 'a', 'c', 'e']\r\n\r\n if (inp[i][j] in valid):\r\n valid.remove(inp[i][j])\r\n\r\n if (inp[i][j+1] in valid):\r\n valid.remove(inp[i][j+1])\r\n\r\n if (inp[i+1][j] in valid):\r\n valid.remove(inp[i+1][j])\r\n\r\n\r\n if (inp[i+1][j+1] in valid):\r\n count += 1\r\n \r\n\r\n\r\nprint(count)", "n,m = map(int,input().split())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n l.append(list(input()))\r\n \r\ncount = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n curr = l[i][j] + l[i][j+1] + l[i+1][j] + l[i+1][j+1]\r\n \r\n if (\"\".join(sorted(curr)) == \"acef\"):\r\n count+=1\r\nprint(count)\r\n ", "n, m = map(int, input().split())\r\na = list()\r\nfor i in range(n):\r\n a.append(input())\r\nans = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n z = set([a[i][j], a[i+1][j], a[i][j+1], a[i+1][j+1]])\r\n if z == set('face'):\r\n ans += 1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = []\r\nans = 0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(1, n):\r\n for j in range(1, m):\r\n c = [a[i][j], a[i - 1][j], a[i - 1][j - 1], a[i][j - 1]]\r\n if 'f' in c and 'a' in c and 'c' in c and 'e' in c:\r\n ans += 1\r\nprint(ans)", "n, m = map(int, input().split())\r\nans = 0\r\na = list()\r\nfor _ in range(n):\r\n\ta.append(input())\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\ts = [a[i][j], a[i][j+1],a[i+1][j],a[i+1][j+1]]\r\n\t\tif \"f\" in s and \"a\" in s and \"c\" in s and \"e\" in s:\r\n\t\t\tans += 1\r\nprint(ans)", "n, m = [int(i) for i in input().split()]\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(input())\r\n\r\n# ex = {\"f\", \"a\", \"c\", \"e\"}\r\nex = [\"f\", \"a\", \"c\", \"e\"]\r\nex = sorted(ex)\r\n\r\n# print(ex)\r\n\r\ncontainer = []\r\n\r\n# print(type(ex))\r\n# print(type(container))\r\nif n < 2 or m < 2:\r\n print(0)\r\nelse:\r\n ans = 0\r\n for i in range(n - 1):\r\n for j in range(m - 1):\r\n container.append(matrix[i][j])\r\n container.append(matrix[i][j + 1])\r\n container.append(matrix[i + 1][j])\r\n container.append(matrix[i + 1][j + 1])\r\n container = sorted(container)\r\n\r\n if container == ex:\r\n ans += 1\r\n\r\n container = []\r\n\r\n print(ans)\r\n", "import os\r\nimport sys\r\n\r\ndebug = True\r\n\r\nif debug and os.path.exists(\"input.in\"):\r\n input = open(\"input.in\", \"r\").readline\r\nelse:\r\n debug = False\r\n input = sys.stdin.readline\r\n\r\n\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return s[:len(s) - 1] # Remove line char from end\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ntest_count = 1\r\nif debug:\r\n test_count = inp()\r\n\r\nfor t in range(test_count):\r\n if debug:\r\n print(\"Test Case #\", t + 1)\r\n # Start code here\r\n n, m = invr()\r\n if n < 2 or m < 2:\r\n print(0)\r\n continue\r\n ans = 0\r\n data = []\r\n correct = {\"f\", \"a\", \"c\", \"e\"}\r\n for _ in range(n):\r\n data.append(insr())\r\n for i in range(0, n - 1):\r\n for j in range(0, m - 1):\r\n face = {data[i][j], data[i][j + 1], data[i + 1][j], data[i + 1][j + 1]}\r\n if face == correct:\r\n ans += 1\r\n print(ans)\r\n", "from functools import reduce\r\nM = {'f':2, 'a':4, 'c':8, 'e':16}\r\nn, m = map(int, input().split())\r\nA = []\r\nfor i in range(n):\r\n A.append(input())\r\ncont = 0\r\nB = [[0 for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if A[i][j] in M.keys(): B[i][j] = M[A[i][j]]\r\n#print(B)\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n cont += (30 == reduce(lambda x,y: x+y, B[i][j:j+2]+B[i+1][j:j+2]))\r\nprint(cont)\r\n", "\ndef main():\n\n rows, cols = map(int, input().split())\n arr = []\n\n cont = 0\n for i in range(rows):\n arr.append([c for c in input()])\n\n for i in range(0, rows-1):\n for j in range(0, cols-1):\n isFace = True\n\n word = []\n word.append(arr[i][j])\n word.append(arr[i][j+1])\n word.append(arr[i+1][j])\n word.append(arr[i+1][j+1])\n\n for k in ['f', 'a', 'c', 'e']:\n if k not in word:\n isFace = False\n\n if isFace:\n cont += 1\n print(cont)\n\nmain()\n \t \t\t\t\t \t \t\t \t \t\t \t\t \t\t \t", "def face(_list:[[str]], _row:int, _col:int) -> bool:\r\n s = ['f', 'a', 'c', 'e']\r\n try:\r\n s.remove(_list[_row][_col])\r\n s.remove(_list[_row][_col+1])\r\n s.remove(_list[_row+1][_col])\r\n s.remove(_list[_row+1][_col+1])\r\n except:\r\n pass\r\n\r\n if s == []:\r\n return True\r\n else:\r\n return False\r\n\r\nrow, col = map(int, input().split())\r\nrec_table = []\r\nfor i in range(row):\r\n rec_table.append(list(input()))\r\n\r\nans = 0\r\nfor i in range(row-1):\r\n for j in range(col-1):\r\n if face(rec_table, i, j):\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,m=map(eval,input().split())\nl=[]\nlf=[]\ndef perm(a,k=0):\n if(k==len(a)):\n lf.append(\"\".join(a))\n else:\n for i in range(k,len(a)):\n a[k],a[i] = a[i],a[k]\n perm(a, k+1)\n a[k],a[i] = a[i],a[k]\nperm(['f','a','c','e'])\nans=0\nfor i in range(n):\n l.append(input())\nfor i in range(n-1):\n for j in range(m-1):\n if(l[i][j]+l[i+1][j]+l[i][j+1]+l[i+1][j+1] in lf):\n ans+=1\nprint(ans)\n", "a,b=map(int,input().split())\r\nl=[]\r\np=0\r\nfor m in range (a):\r\n lPrime=list(input())\r\n l.append(lPrime)\r\nfor i in range(0,a-1):\r\n for j in range(0,b-1):\r\n u=(l[i][j])+(l[i][j+1])+(l[i+1][j])+(l[i+1][j+1])\r\n if \"f\"in u and \"a\"in u and \"c\"in u and \"e\"in u:\r\n p=p+1\r\nprint(p)", "import sys\n\nm, n = map(int, input().split())\n\nimg = []\n\nfor _ in range(m):\n img.append(list(input()))\n\ncount = 0\n\nif m < 2 or n < 2:\n print(0)\n sys.exit(0)\n\nfor i in range(m - 1):\n for j in range(n - 1):\n f = [img[i][j], img[i+1][j], img[i][j+1], img[i+1][j+1]]\n if 'f' in f and 'a' in f and 'c' in f and 'e' in f:\n count += 1\n\nprint(count)\n", "x=map(int,input().split())\r\nn,m=x\r\nc=0\r\nt=[]\r\nfor i in range(n):\r\n a=input()\r\n t.append(a)\r\ns={'f',\"a\",\"c\",\"e\"}\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if t[i][j]==\"f\" or \"c\" or \"c\" or \"e\":\r\n s1=set(s)\r\n if t[i][j] in s1:\r\n s1.remove(t[i][j])\r\n if t[i+1][j] in s1:\r\n s1.remove(t[i+1][j])\r\n if t[i][j+1] in s1:\r\n s1.remove(t[i][j+1])\r\n if t[i+1][j+1] in s1:\r\n s1.remove(t[i+1][j+1])\r\n if len(s1)==0:\r\n c+=1\r\n\r\n\r\n\r\nprint(c)", "n, m = map(int, input().split())\r\nt = [input() for i in range(n)]\r\nf = 0\r\n\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n w = ''.join(sorted([t[i][j], t[i][j + 1], t[i + 1][j], t[i + 1][j + 1]]))\r\n if w == 'acef':\r\n f += 1\r\n\r\nprint(f)", "def numberOfFaces(n, m, image):\n ans = 0\n for i in range(n - 1):\n for j in range(m - 1):\n lists = [image[i][j], image[i + 1][j], image[i][j + 1], image[i + 1][j + 1]]\n if set(lists) == set(\"face\"):\n ans += 1\n return ans\n\nn, m = [int(i) for i in input().split()]\nimage = [list(input()) for i in range(n)]\nprint(numberOfFaces(n, m, image))\n\t\t\t \t\t \t \t \t \t \t \t", "a , b = map(int , input().split())\r\narr = [\"x\" * (b+2)]\r\nr = lambda : list(map(int, input().split()))\r\nc = 0\r\n\r\nfor i in range(a): arr.append('x' + input() + 'x')\r\narr.append(\"x\"*(b+2))\r\n\r\n# print(arr)\r\n\r\n\r\nvalid = list(\"acef\")\r\nfor i in range(1,a+1):\r\n for j in range(1,b+1):\r\n ff = arr[i][j] + arr[i+1][j] + arr[i][j+1] + arr[i+1][j+1]\r\n if sorted(list(ff)) == valid:\r\n c +=1\r\n\r\n\r\nprint(c)\r\n ", "n,m=map(int,input().split())\na=[]\nk=0\nfor i in range(n):\n a.append(input())\nfor x in range(n-1):\n for y in range(m-1):\n s=a[x][y:y+2]+a[x+1][y:y+2]\n if(('f' in s) & ('a' in s) & ('c' in s) & ('e' in s)):\n k+=1\nprint(k)\n", "n, m = [int(i) for i in input().split()]\r\nlines = []\r\nres = 0\r\nfor i in range(n):\r\n lines.append(input().strip())\r\nfor x in range(n - 1):\r\n for y in range(m - 1):\r\n line = lines[x][y] + lines[x + 1][y] + lines[x][y + 1] + lines[x + 1][y + 1]\r\n if ('f' in line) and ('a' in line) and ('c' in line) and ('e' in line):\r\n res += 1\r\nprint(res)", "n, m = [int(i) for i in input().split()]\nimage = [input() for i in range(n)]\nans = 0\nfor i in range(n-1):\n for j in range(m-1):\n if len(set([image[i][j],image[i][j+1],image[i+1][j],image[i+1][j+1]])&set(['f','a','c','e'])) == 4:\n ans += 1\nprint(ans)\n", "n,m=map(int,input().split())\r\nk=[\"0\"*(m+2)]\r\nfor i in range(n):\r\n k.append(\"0\"+input()+\"0\")\r\nk.append(\"0\"*(m+2))\r\ncount=0\r\nfor i in range(1,n):\r\n for j in range(1,m):\r\n k1=(k[i][j],k[i][j+1],k[i+1][j],k[i+1][j+1])\r\n if \"f\" in k1 and \"a\" in k1 and \"c\" in k1 and \"e\" in k1:\r\n count+=1\r\nprint(count)\r\n \r\n\r\n", "n, m = (int(x) for x in input().split())\na = []\nfor i in range(n):\n\ta.append(input().strip())\nans = 0\nfor i in range(n-1):\n\tfor j in range(m-1):\n\t\tif sorted([a[i][j], a[i+1][j], a[i][j+1], a[i+1][j+1]]) == sorted(['f', 'a', 'c', 'e']):\n\t\t\tans += 1\nprint(ans)", "n, m = [int(i) for i in input().split()]\r\n\r\na = [input() for i in range(n)]\r\n\r\nif n < 2 or m < 2:\r\n print(0)\r\nelse:\r\n faces = 0\r\n\r\n for row in range(n-1):\r\n for col in range(m-1):\r\n letters = a[row][col:col+2] + a[row+1][col:col+2]\r\n isF = False\r\n isA = False\r\n isC = False\r\n isE = False\r\n for letter in letters:\r\n if letter == 'f':\r\n isF = True\r\n if letter == 'a':\r\n isA = True\r\n if letter == 'c':\r\n isC = True\r\n if letter == 'e':\r\n isE = True\r\n if isF and isA and isC and isE:\r\n faces += 1\r\n\r\n print(faces)\r\n\r\n", "#!/usr/bin/python3.5\r\nn,m=[int(x) for x in input().split()]\r\nif n<2 or m<2:\r\n print(0)\r\n quit()\r\nc=0\r\nmas=[]\r\nfor i in range(n):\r\n mas.append(input())\r\nf=set('face')\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n k=set()\r\n k.add(mas[i][j])\r\n k.add(mas[i+1][j])\r\n k.add(mas[i][j+1])\r\n k.add(mas[i+1][j+1])\r\n if len(k&f)==4:\r\n c+=1\r\nprint(c)\r\n ", "inp = input().split(\" \")\nny = int(inp[0])\nnx = int(inp[1])\n\ngrid=[]\n\nfor y in range(ny):\n grid.append([x for x in input()])\n\ncount = 0\n\nfor oy in range(ny-1):\n for ox in range(nx-1):\n has_f = False\n has_a = False\n has_c = False\n has_e = False\n for y in range(0, 2):\n for x in range(0, 2):\n item = grid[oy+y][ox+x]\n if item == \"f\":\n has_f = True\n elif item == \"a\":\n has_a = True\n elif item == \"c\":\n has_c = True\n elif item == \"e\":\n has_e = True\n if has_f and has_a and has_c and has_e:\n count += 1\n\nprint(count)\n \n \t \t \t \t \t \t\t \t \t\t\t \t\t \t\t", "m,n=[int(i) for i in input().split()]\r\nt=0\r\na=[]\r\nfor i in range(m):\r\n a.append(input())\r\nfor i in range(m-1):\r\n for j in range(n-1):\r\n b=[]\r\n b.append(a[i][j])\r\n b.append(a[i+1][j])\r\n #error\r\n b.append(a[i][j+1])\r\n b.append(a[i+1][j+1])\r\n if 'f' in b and 'a' in b and 'c' in b and 'e' in b:\r\n t+=1\r\nprint(t)\r\n", "l1 = [int(x) for x in input().split()]\r\nrows = l1[0]\r\ncolumns = l1[1]\r\nl2 = []\r\nfor x in range(rows):\r\n l2.append(list(input()))\r\ni=0\r\nans=0\r\n#print(l2)\r\nwhile i<rows-1:\r\n j=0\r\n while j<columns-1:\r\n targ = l2[i][j]+l2[i][j+1]+l2[i+1][j]+l2[i+1][j+1]\r\n if \"f\" in targ and \"a\" in targ and \"c\" in targ and \"e\" in targ:\r\n ans+=1 \r\n j+=1\r\n i+=1\r\nprint(ans)", "def f(c):\r\n if c == 'f':\r\n return 1\r\n elif c == 'a':\r\n return 10\r\n elif c == 'c':\r\n return 100\r\n elif c == 'e':\r\n return 1000\r\n return 0\r\nn, m = [int(j) for j in input().split()]\r\nmat = []\r\nfor j in range(n):\r\n mat.append(list(str(input())))\r\ncount = 0\r\nfor j in range(n - 1):\r\n for k in range(m - 1):\r\n c = f(mat[j][k]) + f(mat[j][k + 1]) + f(mat[j + 1][k]) + f(mat[j + 1][k + 1])\r\n if c == 1111:\r\n count += 1\r\nprint(count)\r\n", "from sys import stdin\r\n\r\nn, m = map(int, stdin.readline().split())\r\n\r\na = []\r\nfor i in range(0, n):\r\n a.append(stdin.readline())\r\n \r\nres = 0 \r\nfor i in range(0, n - 1):\r\n for j in range(0, m - 1):\r\n r = [a[i][j], a[i][j + 1], a[i + 1][j], a[i + 1][j + 1]]\r\n \r\n if \"f\" not in r:\r\n continue\r\n \r\n if \"a\" not in r:\r\n continue\r\n \r\n if \"c\" not in r:\r\n continue\r\n \r\n if \"e\" not in r:\r\n continue\r\n \r\n \r\n res += 1\r\n \r\nprint (res)", "h, w = [int(item) for item in input().split()]\n\nlista = []\nfor i in range(h):\n lista.append(input())\n\n\npadrao = \"acef\"\nresultado = 0\n\nfor i in range(h - 1):\n for j in range(w - 1):\n aux = lista[i][j] + lista[i][j + 1] + lista[i + 1][j] + lista[i + 1][j + 1]\n if \"\".join(sorted(aux)) == padrao:\n resultado += 1\n\nprint(resultado)\n\n \t\t\t \t \t \t \t \t\t \t\t \t\t\t", "n,m = map(int,input().split())\r\nlines = [input() for i in range(n)]\r\nans = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n a = lines[i][j]+lines[i+1][j]+lines[i][j+1]+lines[i+1][j+1]\r\n if 'f' in a and 'a' in a and 'c' in a and 'e' in a:\r\n ans+=1\r\nprint(ans)", "ent = list(map(int,input().split()))[:2]\nlin = ent[0]\ncol = ent[1]\n\nmat = []\ncont = 0\naux = []\n\nfor k in range (0, lin):\n ent = list(map(str,input().split()))[:col]\n mat.append(ent[0])\n\nfor i in range (0, lin - 1):\n for j in range (0, col - 1):\n aux.append(mat[i][j])\n aux.append(mat[i + 1][j])\n aux.append(mat[i][j + 1])\n aux.append(mat[i + 1][j + 1])\n if 'f' in aux and 'a' in aux:\n if 'c' in aux and 'e' in aux:\n cont += 1\n aux = []\n\nprint(cont)\n \t\t \t\t\t\t\t \t\t \t \t\t\t\t \t\t \t\t", "n,m=map(int, input().split())\r\na=[]\r\nd=0\r\nfor i in range(n):\r\n s=list(input())\r\n a.append(s)\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n l=['f', 'a', 'c', 'e']\r\n c=0\r\n if a[i][j] in l:\r\n l.remove(a[i][j])\r\n if a[i][j+1] in l:\r\n l.remove(a[i][j+1])\r\n if a[i+1][j] in l:\r\n l.remove(a[i+1][j])\r\n if a[i+1][j+1] in l:\r\n c=c+1\r\n if c==1:\r\n d=d+1\r\nprint(d)", "n,m = input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nfor i in range(n):\r\n l1=input()\r\n l.append(l1)\r\nr=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n k=l[i][j]+l[i][j+1]+l[i+1][j]+l[i+1][j+1]\r\n #print(k)\r\n if(k.count('f')==1 and k.count('a')==1 and k.count('c')==1 and k.count('e')==1):\r\n r+=1\r\n\r\nprint(r)\r\n", "\r\nimport math\r\nimport sys\r\nfrom decimal import Decimal\r\ninp=list(map(int,input().split()))\r\nn=inp[0]\r\nm=inp[1]\r\nc=[]\r\nfor i in range(0,n):\r\n s=input()\r\n c.append([])\r\n for j in range(0,m):\r\n c[i].append(s[j])\r\n\r\nans=0\r\n\r\nfor i in range(0,n-1):\r\n for j in range(0,m-1):\r\n t=c[i][j]+c[i+1][j]+c[i+1][j+1]+c[i][j+1]\r\n if 'a' in t and 'f' in t and 'c' in t and 'e' in t:\r\n ans+=1\r\nprint(ans)\r\n \r\n \r\n", "n, m = map(int, input().split())\ntable = []\nfor i in range(n):\n table.append(input())\n\nans = 0\nfor i in range(n - 1):\n for j in range(m - 1):\n di = [0, 0, 1, 1]\n dj = [0, 1, 0, 1]\n d = {}\n for k in range(4):\n c = table[i + di[k]][j + dj[k]]\n d[c] = d.get(c, 0) + 1\n flg = True\n for c in \"face\":\n if c not in d or d[c] != 1:\n flg = False\n if flg:\n ans += 1\nprint(ans)\n", "n,m=map(int,input().split())\r\na=[]\r\nc=0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n s=(a[i][j]+a[i+1][j]+a[i+1][j+1]+a[i][j+1])\r\n s=sorted(s)\r\n s=\"\".join(s)\r\n if(s=='acef'):\r\n c=c+1\r\nprint(c)\r\n", "n,m=map(int,input().split())\r\nim=[]\r\nw=0\r\nfor i in range(n):\r\n\tim.append(list(input()))\r\nif n==1 or m==1:\r\n\tprint(0)\r\n\tquit()\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tx=[im[i][j],im[i][j+1],im[i+1][j],im[i+1][j+1]]\r\n\t\tx.sort()\r\n\t\tif x==['a','c','e','f']:\r\n\t\t\tw+=1\r\nprint(w)", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(input()))\r\ncnt1=0\r\ncnt2=0\r\ncnt3=0\r\ncnt4=0\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if i+1<n and j+1<m:\r\n if a[i][j]=='f' or a[i+1][j]=='f' or a[i][j+1]=='f' or a[i+1][j+1]=='f':\r\n cnt1=cnt1+1\r\n if a[i][j]=='a' or a[i+1][j]=='a' or a[i][j+1]=='a' or a[i+1][j+1]=='a':\r\n cnt2=cnt2+1\r\n if a[i][j]=='c' or a[i+1][j]=='c' or a[i][j+1]=='c' or a[i+1][j+1]=='c':\r\n cnt3=cnt3+1\r\n if a[i][j]=='e' or a[i+1][j]=='e' or a[i][j+1]=='e' or a[i+1][j+1]=='e':\r\n cnt4=cnt4+1\r\n if(cnt1>0 and cnt2>0 and cnt3>0 and cnt4>0):\r\n cnt=cnt+1\r\n cnt1=0\r\n cnt2=0\r\n cnt3=0\r\n cnt4=0\r\nprint(cnt)\r\n \r\n\r\n \r\n\r\n\r\n ", "n,m=map(int,input().split())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n\tl.append(list(input()))\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tx=[l[i][j],l[i+1][j],l[i][j+1],l[i+1][j+1]]\r\n\t\tx.sort()\r\n\t\tif x==list(\"acef\"):\r\n\t\t\tc+=1\r\nprint(c)", "import copy\r\nn, m = (input().split(' '))\r\nn = int(n)\r\nm = int(m)\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nif n < 2 or m < 2:\r\n print(0)\r\nelse:\r\n count = 0\r\n a = ['f', 'a', 'c', 'e']\r\n for i in range(n-1):\r\n for j in range(m-1):\r\n b = copy.deepcopy(a)\r\n if s[i][j] in b:\r\n b.remove(s[i][j])\r\n if s[i+1][j] in b:\r\n b.remove(s[i+1][j])\r\n if s[i][j+1] in b:\r\n b.remove(s[i][j+1])\r\n if s[i+1][j+1] in b:\r\n b.remove(s[i+1][j+1])\r\n count +=1\r\n print(count) ", "l,b=map(int,input().split())\r\nt=[input() for i in range(l)]\r\n'''for i in range(l):\r\n for j in range(b):\r\n t[i][j]=int(input())'''\r\ncount=0\r\nif l<2 or b<2:\r\n print(0)\r\nelse:\r\n j=0\r\n i=0\r\n for i in range(l-1):\r\n for j in range(b-1):\r\n A=t[i][j]\r\n B=t[i][j+1]\r\n C=t[i+1][j]\r\n D=t[i+1][j+1]\r\n l=[A,B,C,D]\r\n if l.count('f')==1 and l.count('a')==1 and l.count('c')==1 and l.count('e')==1:\r\n count+=1\r\n print(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=[input() for i in range(n)]\r\nc=0\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tc+=sorted(a[i][j:j+2]+a[i+1][j:j+2])==sorted(\"face\")\r\nprint(c)", "n , m = map(int,input().split())\r\nif n==1 or m == 1:\r\n print(0)\r\n exit()\r\narr = []\r\ncheck = set([\"f\",\"a\",\"c\",\"e\"])\r\nfor i in range(n):\r\n arr.append(input())\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n temp = set()\r\n temp.add(arr[i][j])\r\n if i + 1 < n:\r\n temp.add(arr[i+1][j])\r\n if j + 1 < m:\r\n temp.add(arr[i][j+1])\r\n if i + 1 < n and j + 1 < m:\r\n temp.add(arr[i+1][j+1])\r\n #print(temp,check,temp == check)\r\n if temp == check:\r\n cnt = cnt + 1\r\nprint(cnt)", "if __name__ == '__main__':\n [n, m] = list(map(int, input().split(' ')))\n img = [list(input()) for i in range(n)]\n amount = 0\n for i in range(n-1):\n for j in range(m-1):\n arr = [img[i][j], img[i+1][j], img[i][j+1], img[i+1][j+1]]\n if (arr.count('f') == 1) and (arr.count('a') == 1) and (arr.count('c') == 1) and (arr.count('e') == 1):\n amount += 1\n print(amount)\n\n\t \t \t \t \t \t\t \t\t \t\t\t\t", "\n\nn, m = map(int, input().split())\n\nimage = []\nfor _ in range(n):\n row = image.append(input())\n\nf = {\"f\":1, \"a\":1, \"c\": 1, \"e\":1}\no = 0\nfor i, row in enumerate(image):\n for j, c in enumerate(row):\n d = set()\n\n try:\n cr = row[j+1]\n cb = image[i+1][j]\n crb = image[i+1][j+1]\n\n for ci in [c,cr,cb,crb]:\n if f.get(ci) is not None:\n d.add(ci)\n\n if len(d) == 4:\n o +=1\n except IndexError:\n pass\n\n \nprint(o)", "#!/usr/bin/env python3.4\n\nn, m = map(int, input().split())\nboard = []\nfor i in range(n):\n board.append(input())\nok_set = set(['f', 'a', 'c', 'e'])\nans = 0\nfor i in range(n - 1):\n for j in range(m - 1):\n cur_set = set([board[i][j], board[i][j + 1], board[i + 1][j], board[i + 1][j + 1]])\n if cur_set == ok_set:\n ans += 1\nprint(ans)\n", "linhas, colunas = [int(item) for item in input().split()]\ntable = []\nfor i in range(linhas):\n table.append(list(input()))\nfaces = 0\nfor linha in range(linhas-1):\n for coluna in range(colunas-1):\n esquerdaCima = table[linha][coluna]\n direitaCima = table[linha][coluna+1]\n esquerdaBaixo = table[linha+1][coluna]\n direitaBaixo = table[linha+1][coluna+1]\n frase = [esquerdaCima,direitaCima,esquerdaBaixo,direitaBaixo]\n frase.sort()\n if(frase == ['a','c','e','f']):\n faces+=1\nprint(faces)\n \t\t\t\t \t \t\t\t \t \t \t\t \t\t\t \t \t\t\t", "n, m = map(int, input().split())\r\n\r\nif n == 1 or m == 1:\r\n print(0)\r\n quit()\r\n \r\ns_f = set([\"f\", \"a\", \"c\", \"e\"])\r\nt = 0\r\n \r\nl_p = list()\r\nfor i in range(n):\r\n l_p.append(input())\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n s_s = set([l_p[i][j], l_p[i + 1][j], l_p[i][j + 1], l_p[i + 1][j + 1]])\r\n if s_s == s_f:\r\n t += 1\r\n \r\nprint(t)", "n, m = map(int, input().split())\r\np = []\r\nfor i in range(n):\r\n a = list(input())\r\n p.append(a)\r\ncol = 0\r\nfor i in range(n - 1):\r\n for t in range(m - 1):\r\n k = set()\r\n k.add(p[i][t])\r\n k.add(p[i + 1][t])\r\n k.add(p[i][t + 1])\r\n k.add(p[i + 1][t + 1])\r\n if 'f' in k and 'a' in k and 'c' in k and 'e' in k:\r\n col += 1\r\nprint(col)\r\n \r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\nn, m = map(int, input().split())\r\nletters = list(input() for i in range(n))\r\nmatch_word = sorted(\"face\")\r\nfaces = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n faces += sorted(letters[i][j:j+2] + letters[i+1][j:j+2]) == match_word\r\n \r\nprint(faces)", "def face(b,i,j):\r\n p=b[i][j]+b[i][j+1]+b[i+1][j]+b[i+1][j+1]\r\n if (p.find('f')+p.find('a')+p.find('c')+p.find('e'))==6:\r\n return 1\r\n return 0\r\n \r\na=list(map(int,input().split()))\r\nb=[]\r\nr=0\r\nfor i in range(a[0]):\r\n b.append(input())\r\nfor i in range(a[0]-1):\r\n for j in range(a[1]-1):\r\n r+=face(b,i,j)\r\nprint(r)\r\n \r\n \r\n\r\n \r\n", "n, m = map(int, input().split())\n\nimage = [input() for i in range(n)]\n\ncount = 0\nfor i in range(n-1):\n for j in range(m-1):\n square = sorted([image[i][j], image[i][j+1], image[i+1][j], image[i+1][j+1]])\n if ''.join(square) == 'acef':\n count += 1\n\nprint(count)\n\n \t\t\t \t \t \t\t\t \t\t\t\t\t \t \t\t\t \t", "n, m = list(map(int, input().split()))\r\ns = [list(input()) for i in range(n)]\r\nans = 0\r\nres = \"\"\r\nif (n == 1 or m == 1):\r\n print(ans)\r\nelse:\r\n for i in range(n-1):\r\n for j in range(m-1):\r\n res += s[i][j]\r\n res += s[i][j+1]\r\n res += s[i+1][j]\r\n res += s[i+1][j+1]\r\n res = sorted(res)\r\n if (\"\".join(res) == \"acef\"):\r\n ans += 1\r\n res = \"\"\r\n print(ans)", "a,b=input().split()\r\nn=int(a)\r\nm=int(b)\r\nt=[\"\" for j in range(n)]\r\nfor i in range(n):\r\n\tt[i]=input()\r\nv=0\r\n\r\ndef test(a,b,c,d):\r\n\tg=[0 for i in range(200)]\r\n\tg[ord(a)]+=1\r\n\tg[ord(b)]+=1\r\n\tg[ord(c)]+=1\r\n\tg[ord(d)]+=1\r\n\treturn (g[ord('f')]*g[ord('a')]*g[ord('c')]*g[ord('e')]==1)\r\n\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tif test(t[i][j],t[i+1][j],t[i][j+1],t[i+1][j+1]):v+=1\r\nprint(v)", "n, m = map(int, input().split())\r\nl = []\r\np=0\r\nfor i in range(n):\r\n lprime = list(input())\r\n l.append(lprime)\r\n\r\nfor i in range(0,n-1):\r\n for j in range(0,m-1):\r\n u = l[i][j] + l[i][j+1] + l[i+1][j] + l[i+1][j+1]\r\n if \"f\" in u and \"a\" in u and \"c\" in u and \"e\" in u:\r\n p+=1\r\n\r\nprint(p)\r\n\r\n \r\n", "__author__ = 'taras-sereda'\n\n# input\n# 4 4\n# xxxx\n# xfax\n# xcex\n# xxxx\n\nn,m = input().split(' ')\nn, m = int(n), int(m)\nmat = [input() for i in range(n)]\n\n# print(mat)\n# print(n,m)\nchars = ['f','a','c','e']\namount = 0\nfor i in range(n):\n for j in range(m):\n if mat[i][j] in chars:\n f = mat[i][j]\n kand = []\n kand.append(f)\n if mat[min(i+1,n-1)][j] in chars and mat[min(i+1,n-1)][j] not in kand:\n kand.append(mat[i+1][j])\n if mat[i][min(j+1,m-1)] in chars and mat[i][min(j+1,m-1)] not in kand:\n kand.append(mat[i][j+1])\n if mat[min(i+1,n-1)][min(j+1,m-1)] in chars and mat[min(i+1,n-1)][min(j+1,m-1)] not in kand:\n kand.append(mat[i+1][j+1])\n if set(kand) == set(chars):\n amount += 1\nprint(amount)\n\n\n\n", "from itertools import permutations\r\ndef get_permutations(string):\r\n perms = permutations(string)\r\n perms = [''.join(perm) for perm in perms]\r\n return perms\r\na,b=map(int,input().split())\r\nf='face'\r\nff= get_permutations(f)\r\ns=[]\r\nfor i in range(a):\r\n s.append(input())\r\nc=0\r\nfor i in range(a-1):\r\n for j in range(b-1):\r\n si=s[i][j]+s[i+1][j]+s[i][j+1]+s[i+1][j+1]\r\n if si in ff:c+=1\r\nprint(c)", "n, m = map(int, input().split())\r\nif n == 1 or m == 1:\r\n print(0)\r\nelse:\r\n r = 0\r\n grid = []\r\n for _ in range(n):\r\n curr_line = list(input())\r\n grid.append(curr_line)\r\n for i in range(n - 1):\r\n for j in range(m - 1):\r\n curr_square = set()\r\n curr_square.add(grid[i][j])\r\n curr_square.add(grid[i][j+1])\r\n curr_square.add(grid[i+1][j])\r\n curr_square.add(grid[i+1][j+1])\r\n if curr_square == set(['f','a','c','e']):\r\n r += 1\r\n print(r)", "ans = 0\r\nn, m = [int(i) for i in input().split()]\r\nli = [input() for _ in range(n)]\r\nface = set(\"face\")\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if set(li[i][j] + li[i + 1][j] + li[i][j + 1] + li[i + 1][j + 1]) == face:\r\n ans += 1\r\nprint(ans)\r\n", "n,m = map(int, input().split())\r\nv=[input() for i in range(n)]\r\ns={'f', 'a', 'c', 'e'}\r\nprint(sum(1 for i in range(n-1) for j in range(m-1) if set(v[i][j]+v[i][j+1]+v[i+1][j]+v[i+1][j+1])==s))", "n, m = map(int, input().split())\nv = []\nfor _ in range(0, n):\n v.append(\"x\" + input() + \"x\")\nv = ['x' * (m + 2)] + v + ['x' * (m + 2)]\nf = {'f', 'a', 'c', 'e'}\nt = 0\nfor i in range(1, n + 1):\n for j in range(1, m + 1):\n if set([v[i][j], v[i + 1][j], v[i][j + 1], v[i + 1][j + 1]]) == f:\n t += 1\nprint(t)\n", "\r\nn, m = map(int, input().split())\r\nans = 0\r\nA = [input() for i in range(n)]\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if sorted(A[i][j] + A[i][j + 1] + A[i + 1][j] + A[i + 1][j + 1]) == sorted(\"face\"):\r\n ans += 1\r\nprint(ans)", "n, m = map(int, input().split())\r\ns = list()\r\na = ['f', 'a', 'c', 'e']\r\nresult = 0\r\nfor i in range(n):\r\n\ts.append(input())\r\nfor i in range(n-1):\r\n\tfor j in range(m-1):\r\n\t\tif s[i][j] in a:\r\n\t\t\ta.remove(s[i][j])\r\n\t\t\tif s[i][j+1] in a:\r\n\t\t\t\ta.remove(s[i][j+1])\r\n\t\t\t\tif s[i+1][j] in a:\r\n\t\t\t\t\ta.remove(s[i+1][j])\r\n\t\t\t\t\tif s[i+1][j+1] in a:\r\n\t\t\t\t\t\tresult+=1\r\n\t\t\t\t\t\ta = ['f', 'a', 'c', 'e']\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\ta = ['f', 'a', 'c', 'e']\r\n\t\t\t\telse:\r\n\t\t\t\t\ta = ['f', 'a', 'c', 'e']\r\n\t\t\telse:\r\n\t\t\t\ta = ['f', 'a', 'c', 'e']\r\n\t\telse:\r\n\t\t\ta = ['f', 'a', 'c', 'e']\r\nprint(result)", "n,m=map(int,input().split())\r\na=list()\r\nx=0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n b=list()\r\n try:\r\n b.append(a[i][j])\r\n b.append(a[i][j+1])\r\n b.append(a[i+1][j])\r\n b.append(a[i+1][j+1])\r\n if 'f' in b and 'a' in b and 'c' in b and 'e' in b:\r\n x+=1\r\n except:\r\n pass\r\nprint(x)", "#faces\r\n\r\nnumbers = [int(n) for n in input().split()]\r\na = numbers[0]\r\nb = numbers[1]\r\ntext = []\r\nface = \"face\"\r\ntmp = \"\"\r\ncount = 0\r\n\r\ntext = [input() for i in range(a)]\r\n\r\nfor i in range(a-1):\r\n for j in range(b-1):\r\n if text[i][j] in face:\r\n tmp += text[i][j] + text[i+1][j] + text[i][j+1] + text[i+1][j+1]\r\n if \"f\" in tmp and \"a\" in tmp and \"c\" in tmp and \"e\" in tmp:\r\n count += 1\r\n tmp = \"\"\r\n\r\nprint(count)\r\n", "from fileinput import *\n\ndata = []\nfor line in input():\n if lineno() == 1:\n [m, n] = list(map(int, line.split()))\n else:\n data.append(line.strip())\n\nif m < 2 or n < 2:\n print(str(0))\nelse:\n count = 0\n for m_row in range(m-1):\n for n_col in range(n-1):\n s = data[m_row][n_col] + data[m_row][n_col+1] \\\n + data[m_row+1][n_col] + data[m_row+1][n_col+1]\n if set(s) == {'c', 'e', 'f', 'a'}:\n count +=1\n print(str(count))\n\n", "from itertools import permutations\r\nx,y = map(int,input().split())\r\nl = {\"f\",\"a\",\"c\",\"e\"}\r\nperm = permutations(\"face\")\r\nlist1 = list(perm)\r\ncount = 0\r\narr = []\r\nfor i in range(x):\r\n\tt = input()\r\n\tarr.append(t)\r\nfor i in range(x-1):\r\n\tfor j in range(y-1):\r\n\t\tt = (arr[i][j],arr[i+1][j],arr[i][j+1],arr[i+1][j+1])\r\n\t\tif t in list1:\r\n\t\t\tcount = count + 1\r\nprint(count)", "n, m = [int(i) for i in input().split()]\ns = []\no = 0\nfor t in range(n):\n s.append(input())\nfor i in range(n-1):\n for j in range(m-1):\n a = s[i][j]+s[i][j+1]+s[i+1][j]+s[i+1][j+1]\n if \"f\" in a and \"c\" in a and \"e\" in a and \"a\" in a:\n o+=1\nprint(o)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ng = [input()[:-1] + 'x' for _ in range(n)]\r\ng = g + ['x'*(m+1)]\r\nf = ['a', 'c', 'e', 'f']\r\nc = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] in f:\r\n if sorted(g[i+1][j] + g[i+1][j+1] + g[i][j+1] + g[i][j]) == f:\r\n c += 1\r\nprint(c)", "rows, cols = map(int, input().split())\n\nfaces = 0\nprev = input()\nfor row in range(rows - 1):\n curr = input()\n for col in range(cols - 1):\n if (sorted(prev[col] + prev[col+1] + # F A\n curr[col] + curr[col+1]) # C E\n == # ==\n sorted('face')): # F A C E\n faces += 1\n prev = curr\n\nprint(faces)\n", "def checkFace(a):\r\n a.sort()\r\n if a[0]=='a' and a[1]=='c' and a[2]=='e' and a[3]=='f':\r\n return True\r\n return False\r\nn,m=[int(x) for x in input().split()]\r\nlst=[]\r\nfor i in range(n):\r\n lst.append(input())\r\nif min(n,m)==1:\r\n print(0)\r\nelse:\r\n res=0\r\n for i in range(0,n-1):\r\n for j in range(0,m-1):\r\n if checkFace([lst[i][j],lst[i][j+1],lst[i+1][j],lst[i+1][j+1]]):\r\n res+=1\r\n print(res)", "n,m=map(int,input().split())\r\nalist=[]\r\nfor i in range(n):\r\n word=str(input())\r\n blist=[]\r\n for i in range(len(word)):\r\n blist.append(word[i])\r\n \r\n alist.append(blist)\r\n\r\ncount=0\r\nif m==1 or n==1:\r\n print(\"0\")\r\nelse:\r\n \r\n for i in range(1,n):\r\n for j in range(1,m):\r\n clist=[]\r\n clist.append(alist[i-1][j-1])\r\n clist.append(alist[i][j])\r\n clist.append(alist[i][j-1])\r\n clist.append(alist[i-1][j])\r\n \r\n \r\n if \"f\" in clist and \"a\" in clist and \"c\" in clist and \"e\" in clist:\r\n count=count+1\r\n else:\r\n continue\r\n print(count)", "def main():\n read = lambda: tuple(map(int, input().split()))\n h, w = read()\n m = [input() for i in range(h)]\n def isFace(x, y):\n d = [m[y][x], m[y][x+1], m[y+1][x], m[y+1][x+1]]\n for c in \"face\":\n if not c in d:\n return False\n return True\n \n k = 0\n for y in range(h-1):\n for x in range(w-1):\n if isFace(x, y):\n k += 1\n print(k)\nmain()\n", "r, c = [int(i) for i in input().split()]\r\nT = []\r\nQ = 0\r\n\r\nfor i in range(r):\r\n T.append(input())\r\n\r\nfor R in range(r-1):\r\n for C in range(c-1):\r\n if ''.join(sorted([T[R][C], T[R+1][C], T[R+1][C+1], T[R][C+1]])) == 'acef':\r\n Q += 1\r\n\r\nprint(Q)\r\n", "import sys\n\ndef main():\n # fin = open(\"input.txt\", \"r\")\n fin = sys.stdin\n \n n, m = map(int, fin.readline().split())\n A = []\n for i in range(n):\n A.append(fin.readline().rstrip())\n\n cnt = 0\n for i in range(n - 1):\n for j in range(m - 1):\n S = {A[i][j], A[i][j + 1], A[i + 1][j], A[i + 1][j + 1]}\n if (\"f\" in S) and (\"a\" in S) and (\"c\" in S) and (\"e\" in S):\n cnt += 1\n\n print(cnt)\n\n fin.close()\n\nmain()", "inp = list(map(int, input().split()))\r\nim = []\r\nfor j in range(inp[0]):\r\n im.append(list(input()))\r\nc = 0\r\ni = 0\r\nwhile i < inp[0]-1:\r\n j = 0\r\n while j < inp[1]-1:\r\n s = []\r\n s.append(im[i][j])\r\n s.append(im[i+1][j])\r\n s.append(im[i+1][j+1])\r\n s.append(im[i][j+1])\r\n s.sort()\r\n if s == sorted(['f', 'a', 'c', 'e']):\r\n c += 1\r\n j += 1\r\n i += 1\r\nprint(c)", "n, m = str(input()).split(' ')\r\nn = int(n)\r\nm = int(m)\r\n\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n matrix.append(list(input()))\r\n\r\ncounter = 0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if matrix[i][j] == \"f\" or matrix[i][j] == \"a\" or matrix[i][j] == \"c\" or matrix[i][j] == \"e\":\r\n word = matrix[i][j]\r\n if matrix[i][j+1] == \"f\" or matrix[i][j+1] == \"a\" or matrix[i][j+1] == \"c\" or matrix[i][j+1] == \"e\":\r\n word += matrix[i][j+1]\r\n if matrix[i+1][j] == \"f\" or matrix[i+1][j] == \"a\" or matrix[i+1][j] == \"c\" or matrix[i+1][j] == \"e\":\r\n word += matrix[i+1][j]\r\n if matrix[i+1][j+1] == \"f\" or matrix[i+1][j+1] == \"a\" or matrix[i+1][j+1] == \"c\" or matrix[i+1][j+1] == \"e\":\r\n word += matrix[i+1][j+1]\r\n if (\"f\" in word) and (\"a\" in word) and (\"c\" in word) and (\"e\" in word):\r\n counter += 1\r\nprint(counter)", "n = input()\nvals = n.split()\nvals = [int(i) for i in vals]\n\nvars = []\nfor i in range(vals[0]):\n vars.append(input())\n\naux = []\ncont = 0\nfor i in range(vals[0]-1):\n for j in range(vals[1]-1):\n aux.append(vars[i][j])\n aux.append(vars[i][j+1])\n aux.append(vars[i+1][j])\n aux.append(vars[i+1][j+1])\n if 'f' in aux and 'a' in aux and 'c' in aux and 'e' in aux:\n cont+=1\n aux = []\n\nprint(cont)\n \n\t\t \t \t \t\t \t \t \t \t\t\t", "y,x = map(int,input().split(\" \"))\nf=[]\nfor i in range(y):\n k = input().split(\" \")\n f.extend(k)\n\n#chaking\ncount = 0\nfor i in range(y-1):\n for j in range(x-1):\n test = f[i][j:j+2]+f[i+1][j:j+2]\n t=[]\n for k in test:\n t.extend(k)\n t.sort()\n if t == [\"a\",\"c\",\"e\",\"f\"]:\n count += 1\n\nprint(count)\n\t \t\t \t \t \t\t \t \t\t\t \t \t\t\t \t\t", "l=input().split(\" \")\nh=int(l[0])\nw=int(l[1])\nlst=[]\nfor i in range (h):\n lst.append(input())\nc=0\nfor i in range(h-1):\n for j in range(w-1):\n s=lst[i][j:j+2]+lst[i+1][j:j+2] \n if 'f' in s and 'a' in s and 'c' in s and 'e' in s:\n c+=1\nprint(c)\n\t\t \t\t\t\t \t\t \t \t \t\t", "def detect_face(mat, k):\r\n new_arr = []\r\n\r\n for i in range(k):\r\n new_arr.extend(mat[i])\r\n\r\n for i in 'face':\r\n if i not in new_arr:\r\n return False\r\n \r\n return True\r\n\r\ndef face_detection(arr, rows, cols):\r\n k = 2\r\n\r\n temp_mat = [[0 for _ in range(k)] for _ in range(k)]\r\n count_faces = 0\r\n\r\n for i in range(rows - k+1):\r\n for j in range(cols - k+1):\r\n x = 0\r\n y = 0\r\n for a in range(i, i + k):\r\n y = 0\r\n for b in range(j, j + k):\r\n temp_mat[x][y] = arr[a][b]\r\n y += 1\r\n x += 1\r\n if (detect_face(temp_mat, 2)):\r\n count_faces += 1\r\n \r\n print(count_faces)\r\n\r\ndef solve():\r\n rows, cols = [int(x) for x in input().split()]\r\n \r\n if rows < 2 or cols < 2:\r\n print(0)\r\n return\r\n \r\n arr = []\r\n for i in range(rows):\r\n arr.extend([[*x] for x in input().split()])\r\n \r\n face_detection(arr, rows, cols)\r\n \r\nsolve()", "n, m = [int(x) for x in input().split(' ')]\r\ngrid = [input() for row in range(n)]\r\ncount = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if set([grid[i][j], grid[i + 1][j], grid[i + 1][j + 1], grid[i][j + 1]]) == set(['f', 'a', 'c', 'e']):\r\n count += 1\r\nprint(count)", "(n, m) = list(map(int, input().split(' ')))\n\n\na = []\nr = 0\nfor _ in range(n):\n a.append(input())\nfor nn in range(n-1):\n for mm in range(1, m):\n s = a[nn][mm-1:mm+1] + a[nn+1][mm-1:mm+1]\n if(set('face').issubset(set(s))):\n r += 1\nprint(r)\n \t \t \t\t\t \t\t \t\t\t\t\t\t \t\t\t \t\t", "n, m = map(int, input().split())\r\na, c = list(input() for i in range(n)), 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if ''.join(sorted((a[i][j], a[i + 1][j], a[i][j + 1], a[i + 1][j + 1]))) == 'acef':\r\n c += 1\r\nprint(c)\r\n", "N,M=list(map(int,input().split()))\nSeq=[list(input())for I in range(N)]\nAns=0\nfor I in range(N-1):\n for J in range(M-1):\n Det=['f','a','c','e']\n Used=[]\n if Seq[I][J]in Det:\n Used.append(Seq[I][J])\n if Seq[I+1][J]in Det and not Seq[I+1][J]in Used:\n Used.append(Seq[I+1][J])\n if Seq[I][J+1]in Det and not Seq[I][J+1]in Used:\n Used.append(Seq[I][J+1])\n if Seq[I+1][J+1]in Det and not Seq[I+1][J+1]in Used:\n '''\n Seq[I][J]='#'\n Seq[I+1][J]='#'\n Seq[I+1][J+1]='#'\n Seq[I][J+1]='#'\n '''\n Ans+=1\nprint(Ans)\n", "a=input().split()\r\nper=input()\r\nanswer=0\r\nfor j in range(int(a[0])-1):\r\n per1=input()\r\n for i in range(int(a[1])-1):\r\n A=set()\r\n A.add(per[i+1])\r\n A.add(per[i])\r\n A.add(per1[i])\r\n A.add(per1[i+1])\r\n if 'f' in A and 'a' in A and 'c' in A and 'e' in A:\r\n answer +=1\r\n per=per1\r\nprint((answer))\r\n", "n, m = map(int, input().split())\r\ndc = dict()\r\nres = 0\r\nfor i in range(n):\r\n dc.update({(i,j): c for j, c in enumerate(input())})\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if dc[(i,j)] in \"face\":\r\n s = set([dc[(i+k,j+l)] for k in [0,1] for l in [0,1]])\r\n if len(s & {\"f\",\"a\",\"c\",\"e\"}) == 4:\r\n res += 1\r\nprint(res)", "n, m = map(int, input().split())\r\n\r\ndaf = []\r\n\r\nset_check = {'f','a','c','e'}\r\n\r\nfor i in range(n):\r\n daf.append(list(input()))\r\n\r\ncount = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n check = {daf[i][j],\r\n daf[i+1][j],\r\n daf[i][j+1],\r\n daf[i+1][j+1],}\r\n if check == set_check:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\n\r\narray = []\r\nfor _ in range(n):\r\n array.append(input())\r\n\r\narray = tuple(array)\r\ncount = 0\r\n\r\nif n == 1 or m == 1:\r\n print(0)\r\n raise SystemExit(0)\r\n\r\nfor i in range(n-1):\r\n a_i = array[i]\r\n a_i1 = array[i+1]\r\n for j in range(m-1):\r\n string = \"\".join(a_i[j:j+2] + a_i1[j:j+2])\r\n if \"f\" in string and \"a\" in string and \"c\" in string and \"e\" in string:\r\n count += 1\r\n\r\nprint(count)", "n, m = list(map(int, input().split()))\ngrid = [list(input()) for i in range(n)]\ncnt = 0\nfor r in range(n-1):\n for c in range(m-1):\n face = ['f', 'a', 'c', 'e']\n if grid[r][c] in face:\n face.remove(grid[r][c])\n if grid[r+1][c] in face:\n face.remove(grid[r+1][c])\n if grid[r][c+1] in face:\n face.remove(grid[r][c+1])\n if grid[r+1][c+1] in face:\n face.remove(grid[r+1][c+1])\n cnt += 1\nprint(cnt)\n", "# LUOGU_RID: 101604916\nn, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nans = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if set(a[i][j] + a[i][j + 1] + a[i + 1][j + 1] + a[i + 1][j]) == set('face'):\r\n ans += 1\r\nprint(ans)", "# MC521 - Desafios de Programacao I - 1s2021\n# Contest: 07/05/2021\n# Problema A: Face Detection\n\n# leitura da altura e largura da imagem\nn, m = map(int, input().split())\n\n# inicializa matriz da imagem\nimagem = []\n\n# leitura da imagem em questao\nfor _ in range(n):\n imagem.append(list(input()))\n\n# inicializa conjunto auxiliar e variavel resultado\nface = set(('f', 'a', 'c', 'e'))\nres = 0\n\n# verifica quantidade de faces na imagem\nfor i in range(n-1):\n for j in range(m-1):\n # quadrado a ser analisado\n comp = set((imagem[i][j], imagem[i][j+1], imagem[i+1][j], imagem[i+1][j+1]))\n # compara com o conjunto 'face'\n if(comp == face): res += 1\n\n# imprime o resultado\nprint(res)\n \t\t \t\t\t \t\t\t \t\t\t \t\t\t\t \t", "n, m, = map(int, input().split())\r\nimg = [input() for _ in range(n)]\r\n\r\nprint(sum({img[i][j], img[i][j+1], img[i+1][j], img[i+1][j+1]} == set('face')\r\n for i in range(n - 1) for j in range(m - 1)))", "n, m = map(int, input().split())\r\nline = [input() for i in range(n)]\r\ncount = 0\r\nif n<2 or m<2 :\r\n print(0)\r\nelse:\r\n for j in range(0,n-1):\r\n for i in range(0,m-1):\r\n sub1 = line[j][i:i+2]\r\n sub2 = line[j+1][i:i+2]\r\n if sub1 in [\"ac\",\"ca\"]:\r\n if sub2 in [\"fe\",\"ef\"]:\r\n count+=1\r\n elif sub1 in [\"ae\",\"ea\"]:\r\n if sub2 in [\"cf\",\"fc\"]:\r\n count+=1\r\n elif sub1 in [\"af\",\"fa\"]:\r\n if sub2 in [\"ec\",\"ce\"]:\r\n count+=1\r\n elif sub1 in [\"ce\",\"ec\"]:\r\n if sub2 in [\"af\",\"fa\"]:\r\n count+=1\r\n elif sub1 in [\"cf\",\"fc\"]:\r\n if sub2 in [\"ae\",\"ea\"]:\r\n count+=1\r\n elif sub1 in [\"fe\",\"ef\"]:\r\n if sub2 in [\"ac\",\"ca\"]:\r\n count+=1\r\n print(count)", "tmp = input().split()\r\ntmp[0] = int(tmp[0])\r\ntmp[1] = int(tmp[1])\r\nface = \"acef\"\r\nmy_str = []\r\nfor i in range(0,tmp[0]):\r\n my_str.append(input())\r\n\r\ncount = 0\r\nfor i in range(0,tmp[0]-1):\r\n for j in range(0,tmp[1]-1):\r\n my = \"\"\r\n my += my_str[i][j]\r\n my += my_str[i][j+1]\r\n my += my_str[i+1][j]\r\n my += my_str[i+1][j+1]\r\n\r\n my = list(my)\r\n my.sort()\r\n my = ''.join(my)\r\n if my == face:\r\n count += 1\r\n\r\nprint(count)", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nprint(sum([{a[i][j], a[i + 1][j], a[i][j + 1], a[i + 1][j + 1]} == set('face') for j in range(m - 1) for i in range(n - 1)]))", "m, n = map(int, input().split(' '))\r\npic = []\r\ncount = 0\r\nif m < 2 or n < 2:\r\n print(0)\r\n exit()\r\nfor i in range(m):\r\n pic.append(input())\r\n\r\nfor i in range(m-1):\r\n for j in range(n-1):\r\n #print(pic[i+1][j:j+2])\r\n s = pic[i][j:j+2] + pic[i+1][j:j+2]\r\n \r\n if 'f' in s and 'a' in s and 'c' in s and 'e' in s:\r\n count += 1\r\nprint(count)", "__author__ = 'Rafael Capucho <[email protected]>'\n\ndef do_combination(mylist):\n result = []\n for i in range(len(mylist) - 1):\n result.append([mylist[i], mylist[i+1]])\n return result\n\ndef do_group(myinput, size, step=1):\n index = 0\n while index < len(myinput)-1:\n yield myinput[index:index+size]\n index += step\n\ndef do(combinations):\n count = 0\n for elem in combinations:\n group1 = list(do_group(elem[0], 2))\n group2 = list(do_group(elem[1], 2))\n letters = set()\n for i in range(len(group1)):\n letters.add(group1[i][0])\n letters.add(group1[i][1])\n letters.add(group2[i][0])\n letters.add(group2[i][1])\n if {'e','f','c','a'} == letters:\n count += 1\n letters = set()\n return count\n\nthe_input = []\n\nheight, _ = map(int, input().split())\n\nfor i in range(height):\n the_input.append(input())\n\nprint(do(do_combination(the_input)))\n", "n, m= map(int, input().split())\r\nl= []\r\nchecker= [\"a\", \"c\", \"e\", \"f\"]\r\n\r\nfor i in range(n):\r\n l_= list(input())\r\n l.append(l_)\r\ncounter= 0\r\n\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n sort_= sorted(l[i][j]+l[i+1][j]+l[i][j+1]+l[i+1][j+1])\r\n if checker== sort_:\r\n counter+= 1\r\n\r\nprint(counter)", "def fa(a):\r\n s = [\"f\",\"a\",\"c\",\"e\"]\r\n p = 0\r\n for i in range(len(a)):\r\n if s.count(a[i]):\r\n s.remove(a[i])\r\n p+=1\r\n if p==4:\r\n return 1\r\n return 0\r\ns = []\r\nk = input().split(\" \")\r\nn,m = int(k[0]),int(k[1])\r\nfor i in range(n):\r\n s+=[list(input())]\r\nh = 0\r\nfor i in range(n-1):\r\n for l in range(m-1):\r\n h += fa(s[i][l:l+2]+s[i+1][l:l+2])\r\nprint(h)\r\n", "n, m = map(int, input().split())\r\nimage = []\r\nfor _ in range(n):\r\n image.append(input())\r\nans = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if set([image[i][j], image[i][j+1], image[i+1][j], image[i+1][j+1]]) == set('face'):\r\n ans += 1\r\nprint(ans)", "nm = input()\r\nn = int(nm.split()[0])\r\nm = int(nm.split()[1])\r\nimg = []\r\nfaces = 0\r\nfor i in range(n):\r\n x = input()\r\n img.append(x)\r\nfor s in range(len(img)):\r\n for i in range(len(img[s])):\r\n loc1 = True\r\n loc2 = True\r\n loc3 = True\r\n loc4 = True\r\n if i == 0:\r\n loc1 = False\r\n loc3 = False\r\n if s == n-1:\r\n loc1 = False\r\n loc2 = False\r\n if i == m-1:\r\n loc2 = False\r\n loc4 = False\r\n if s == 0:\r\n loc3 = False\r\n loc4 = False\r\n if img[s][i] == 'f' and loc1:\r\n if 'a' in (img[s][i-1], img[s+1][i], img[s+1][i-1]) and \\\r\n 'c' in (img[s][i-1], img[s+1][i], img[s+1][i-1]) and \\\r\n 'e' in (img[s][i-1], img[s+1][i], img[s+1][i-1]):\r\n faces += 1\r\n if img[s][i] == 'f' and loc2:\r\n if 'a' in (img[s][i+1], img[s+1][i], img[s+1][i+1]) and \\\r\n 'c' in (img[s][i+1], img[s+1][i], img[s+1][i+1]) and \\\r\n 'e' in (img[s][i+1], img[s+1][i], img[s+1][i+1]):\r\n faces += 1\r\n if img[s][i] == 'f' and loc3:\r\n if 'a' in (img[s][i-1], img[s-1][i], img[s-1][i-1]) and \\\r\n 'c' in (img[s][i-1], img[s-1][i], img[s-1][i-1]) and \\\r\n 'e' in (img[s][i-1], img[s-1][i], img[s-1][i-1]):\r\n faces += 1\r\n if img[s][i] == 'f' and loc4:\r\n if 'a' in (img[s][i+1], img[s-1][i], img[s-1][i+1]) and \\\r\n 'c' in (img[s][i+1], img[s-1][i], img[s-1][i+1]) and \\\r\n 'e' in (img[s][i+1], img[s-1][i], img[s-1][i+1]):\r\n faces += 1\r\nprint(faces)\r\n \r\n", "n,m = map(int,input().split())\n\na = []\nc = 0\n\nfor i in range(n):\n\ts = list(input())\n\ta.append(s)\n\n#print(a)\n\nfor i in range(m-1):\n\tfor j in range(n-1):\n\t\ts = a[j][i] + a[j+1][i] + a[j][i+1] + a[j+1][i+1]\n\t\ts = sorted(s)\n\t\ts = ''.join(s)\n\t\t#print(s)\n\t\tif(s == \"acef\"):\n\t\t\tc += 1\n\nprint(c)", "n , m = map(int, input().split())\r\na, counter = [ input() for i in range(n)], 0\r\nfor i, j in zip(a, a[1:]):\r\n for k in zip(i, i[1:], j, j[1:]):\r\n if sorted(k) == [*\"acef\"]:\r\n counter += 1\r\nprint(counter)\r\n", "a,b=map(int,input().split())\r\nif a==1 or b==1:print(0)\r\nelse:\r\n c=[]\r\n d=0\r\n for i in range(a):c+=[input()]\r\n for i in range(a-1):\r\n for j in range(b-1):\r\n if set([c[i][j],c[i+1][j],c[i][j+1],c[i+1][j+1]])==set('face'):d+=1\r\n print(d)\r\n", "def face_found(l):\r\n f1 = f2 = f3 = f4 = 0\r\n for ii in l:\r\n if ii == 'f':\r\n f1 += 1\r\n if ii == 'a':\r\n f2 += 1\r\n if ii == 'c':\r\n f3 += 1\r\n if ii == 'e':\r\n f4 += 1\r\n if f1==f2==f3==f4==1:\r\n return 1\r\n else:\r\n return 0\r\nn,m = map(int,input().split(' '))\r\no = 0\r\nll = []\r\nfor i in range(n):\r\n l = list(input())\r\n ll.append(l)\r\nfor i in range(n-1):\r\n for ii in range(m-1):\r\n p = [ll[i][ii],ll[i+1][ii],ll[i][ii+1],ll[i+1][ii+1]]\r\n if face_found(p):\r\n o += 1\r\nprint(o)\r\n", "n, m = map(int, input().split())\r\na = [input() for _ in range(n)]\r\nans = 0\r\nfor i in range(n - 1):\r\n for j in range(m - 1):\r\n if ''.join(sorted((a[i][j], a[i + 1][j], a[i][j + 1], a[i + 1][j + 1]))) == 'acef':\r\n ans += 1\r\nprint(ans)", "R, C = map(int,input().split())\r\n\r\nAN = 0\r\nM=[]\r\nfor r in range(R):\r\n M +=[list(input())]\r\nfor r in range(R - 1):\r\n for c in range(C - 1):\r\n S = set()\r\n S.add(M[r][c])\r\n S.add(M[r+1][c])\r\n S.add(M[r][c+1])\r\n S.add(M[r+1][c+1])\r\n if S == {'f','a','c','e'}:\r\n AN += 1\r\nprint(AN) \r\n \r\n ", "n,m=map(int,input().split())\r\nx=[]\r\nfor i in range(n):\r\n x.append(list(input()))\r\nif n==1 or m==1:\r\n print(0)\r\n exit()\r\nz=[]\r\nans=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n z.append(x[i][j])\r\n z.append(x[i][j+1])\r\n z.append(x[i+1][j])\r\n z.append(x[i+1][j+1])\r\n z.sort()\r\n Z=\"\".join(z)\r\n if Z==\"acef\":\r\n ans+=1\r\n z=[]\r\nprint(ans)\r\n ", "def check_face(start, m, cols, rows):\n i = (start)//cols\n j = start - cols*i\n if i != rows-1 and j != cols - 1:\n square = [m[i*cols+j], m[i*cols+j+1], m[i*cols+j+cols], m[i*cols+j+cols+1]]\n if 'f' in square and 'a' in square and 'c' in square and 'e' in square:\n return 1\n return 0\n\nrows, cols = [int(i) for i in input().split()]\nm = [0 for i in range(rows*cols)]\nfor i in range(rows):\n row = input()\n for j in range(len(row)):\n m[i*cols + j] = row[j]\n\ncount = 0\nfor start in range(len(m)):\n count += check_face(start, m, cols, rows)\nprint(count)\n\t \t\t\t \t\t \t \t \t\t\t\t\t\t\t\t \t\t\t\t \t", "num_rows, num_cols = map(int, input().split())\ngrid = [input() for _ in range(num_rows)]\ncount = 0\n\nfor i in range(num_rows - 1):\n for j in range(num_cols - 1):\n square = ''.join(sorted([grid[i][j], grid[i][j+1], grid[i+1][j], grid[i+1][j+1]]))\n if square == 'acef':\n count += 1\n\nprint(count)\n\n\t \t\t \t \t\t \t\t \t \t\t\t\t\t \t \t", "if __name__ == \"__main__\":\r\n n,m = [int(x) for x in input().strip().split()]\r\n image = [input() for i in range(n)]\r\n\r\n res = 0\r\n for i in range(n-1):\r\n for j in range(m-1):\r\n s = image[i][j] + image[i][j+1] + image[i+1][j] + image[i+1][j+1]\r\n #print(\"\".join(sorted(s)))\r\n if \"\".join(sorted(s)) == \"acef\":\r\n res += 1\r\n print(res)\r\n", "n,m=input().split()\r\nn,m=int(n),int(m)\r\nl=[]\r\ncount=0\r\nfor i in range(n):\r\n l.append(list(input()))\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n p=[]\r\n p.append(l[i+0][j+0])\r\n p.append(l[i+0][j+1])\r\n p.append(l[i+1][j+1])\r\n p.append(l[i+1][j+0])\r\n # print(p)\r\n if(('f' in p) and ('a' in p) and ('c' in p) and ('e'in p) ):\r\n count+=1\r\nprint(count)\r\n \r\n ", "n,m=map(int,input().split())\r\narr=[]\r\nfor _ in range(n):\r\n a=[aa for aa in str(input())]\r\n arr.append(a)\r\nc=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n l=[arr[i][j],arr[i+1][j],arr[i][j+1],arr[i+1][j+1]]\r\n l.sort()\r\n if l==['a','c','e','f']:c+=1\r\nprint(c)\r\n ", "n, m = map(int, input().split())\r\nmatrix = [[i for i in input()] for j in range(n)]\r\narray = []\r\ncounter = 0\r\nfor i in range(len(matrix) - 1):\r\n for j in range(len(matrix[i])):\r\n if j > 0 and i != len(matrix) - 1:\r\n array.append([matrix[i][j - 1], matrix[i][j], matrix[i + 1][j - 1], matrix[i + 1][j]])\r\nfor i in array:\r\n if i.count('f') == 1 and i.count('a') == 1 and i.count('c') == 1 and i.count('e') == 1:\r\n counter += 1\r\nprint(counter)", "import sys\nn, m = map(int,sys.stdin.readline().split())\nans = 0\nline1 = input().strip()\nfor _ in range(n-1):\n line2 = input().strip()\n for i in range(m-1):\n if {line1[i], line1[i+1], line2[i], line2[i+1]} == {'f', 'a', 'c', 'e'}:\n ans += 1\n line1 = line2\nprint(ans)\n", "n,m=map(int,input().split())\r\na=[input()for _ in[0]*n]\r\nr=0\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n r+={*a[i][j:j+2],*a[i+1][j:j+2]}=={*'face'}\r\nprint(r)\r\n ", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n\r\nface = set('face')\r\nn,m = map(int,input().split())\r\nfaces = []\r\nfor i in range(n):\r\n faces.append(list(input()))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n dxdy = [(0,0),(0,1),(1,1),(1,0)]\r\n f = []\r\n for dx,dy in dxdy:\r\n if 0 <= dy + i < n and 0 <= dx + j < m:\r\n f.append(faces[i + dy][j + dx])\r\n if face == set(f):\r\n count += 1\r\nprint(count)\r\n", "'''input\n1 4\nface\n'''\nr, c = map(int, input().split())\nl = [input() for _ in range(r)]\nt = 0\nfor x in range(r-1):\n\tfor y in range(c-1):\n\t\tz = l[x][y:y+2] + l[x+1][y:y+2]\n\t\tif all(i in z for i in [\"f\", \"a\", \"c\", \"e\"]):\n\t\t\tt += 1\nprint(t)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n,m=map(int,input().split())\nss=[]\nf=['a','c','e','f']\nfor i in range(n):\n s=input()\n ss.append(s)\ndig=0\nfor i in range(n-1):\n for j in range(m-1):\n dp=[ss[i][j],ss[i+1][j],ss[i][j+1],ss[i+1][j+1]]\n dp.sort()\n if dp==f:\n dig+=1\nprint(dig)\n \t\t\t \t\t\t \t \t\t\t\t \t \t\t\t\t", "n, m = map(int, input().split())\n\narr = []\n\nfor i in range(n):\n arr.append(input())\n\nans = 0\n\nfor i in range(n - 1):\n for j in range(m - 1):\n string = \"\"\n string += arr[i][j]\n string += arr[i + 1][j]\n string += arr[i][j + 1]\n string += arr[i + 1][j + 1]\n\n if 'f' in string and 'a' in string and 'c' in string and 'e' in string:\n ans += 1\n\nprint(ans)\n", "n, m = [int(i) for i in input().split()]\n\nfirst = []\ncount = 0\nfor i in range(n):\n second = [char for char in input()]\n \n if i != 0:\n for j in range(m - 1):\n square = [first[j], first[j + 1], second[j], second[j + 1]]\n if 'f' in square and 'a' in square and 'c' in square and 'e' in square:\n count += 1\n\n first = second\n\nprint(count)\n \t \t\t \t \t\t\t\t\t\t\t \t\t \t", "x,y=map(int,input().split())\r\ntot=0\r\ntable=[]\r\nfor i in range(x):\r\n table.append(input())\r\nif x==1 or y==1:\r\n print(tot)\r\nelse:\r\n for i in range(x-1):\r\n for j in range(y-1):\r\n string=table[i][j:j+2]+table[i+1][j:j+2]\r\n if 'f' in string and 'a' in string and 'c' in string and 'e' in string:\r\n tot+=1\r\n print(tot)\r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,m = get_int_list()\r\nmatrix = []\r\ns = {'f','a','c','e'}\r\ncount = 0\r\n\r\nfor i in range(n):\r\n matrix.append( list(get_string()) )\r\n\r\nfor i in range(n-1):\r\n for j in range(m-1):\r\n if set( [matrix[i][j], matrix[i][j+1], matrix[i+1][j], matrix[i+1][j+1] ]) == s:\r\n count += 1\r\nprint(count)\r\n", "n, m = [int(i) for i in input().split()]\r\na = [0]*n\r\nfor i in range(n):\r\n a[i] = input().split()[0]\r\nctr = 0\r\nfor i in range(n-1):\r\n for j in range (m-1):\r\n if set([a[i][j], a[i+1][j], a[i][j+1], a[i+1][j+1]]) == {'f','a','c','e'}:\r\n ctr += 1\r\nprint (ctr)", "def is_face(sub_img):\r\n for c in \"face\":\r\n if not c in sub_img:\r\n return False\r\n return True\r\n\r\n\r\nclass CodeforcesTask549ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.dims = [0, 0]\r\n self.image = []\r\n\r\n def read_input(self):\r\n self.dims = [int(x) for x in input().split(\" \")]\r\n for x in range(self.dims[0]):\r\n self.image.append(input())\r\n\r\n def process_task(self):\r\n faces = 0\r\n for x in range(self.dims[1] - 1):\r\n for y in range(self.dims[0] - 1):\r\n substr = self.image[y][x:x+2] + self.image[y+1][x:x+2]\r\n if is_face(substr):\r\n faces += 1\r\n self.result = str(faces)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask549ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n" ]

[ "from sys import *\r\nfrom bisect import *\r\nfrom collections import *\r\np = list(map(int, stdin.read().split()))\r\nn, k = p[0], p[1]\r\ns, d = [], Counter(p[2:2 + k])\r\nt = sorted(q for q in d if d[q] == 1)\r\ng = lambda: s.append(str(t[-1]) if t else 'Nothing')\r\ng()\r\nfor a, b in zip(p[2:], p[2 + k:]):\r\n if a != b:\r\n if d[a] == 1: t.pop(bisect(t, a) - 1)\r\n if d[b] == 1: t.pop(bisect(t, b) - 1)\r\n d[b] += 1\r\n d[a] -= 1\r\n if d[a] == 1: insort(t, a)\r\n if d[b] == 1: insort(t, b)\r\n g()\r\nstdout.write('\\n'.join(s))", "from sys import *\nfrom bisect import *\nfrom collections import *\n#using inbuit libraries\np = list(map(int, stdin.read().split()))\nn, k = p[0], p[1]\ns, d = [], Counter(p[2:2 + k])\nt = sorted(q for q in d if d[q] == 1)\ndef sub(q):\n if d[q] == 1: t.pop(bisect(t, q) - 1)\ndef add(q):\n if d[q] == 1: insort(t, q)\ndef get(): s.append(str(t[-1]) if t else 'Nothing')\nget()\nfor a, b in zip(p[2:], p[2 + k:]):\n if a != b:\n sub(a), sub(b)\n d[b] += 1\n d[a] -= 1\n add(a), add(b)\n get()\nprint('\\n'.join(s))\n\t \t \t\t \t \t\t\t\t\t \t\t\t\t\t \t\t \t", "# for I/O for local system\r\nimport sys\r\nfrom os import path\r\nif(path.exists('Input.txt')):\r\n sys.stdin = open(\"Input.txt\",\"r\")\r\n sys.stdout = open(\"Output.txt\",\"w\")\r\n\r\n# For fast I/O\r\ninput = sys.stdin.buffer.readline\r\n# input = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\n# Import libraries here whenever required\r\nfrom heapq import *\r\nfrom random import randint\r\n\r\n# Use this because normal dict can sometimes give TLE\r\nclass mydict:\r\n def __init__(self, func=lambda: 0):\r\n self.random = randint(0, 1 << 32)\r\n self.default = func\r\n self.dict = {}\r\n def __getitem__(self, key):\r\n mykey = self.random ^ key\r\n if mykey not in self.dict:\r\n self.dict[mykey] = self.default()\r\n return self.dict[mykey]\r\n def get(self, key, default):\r\n mykey = self.random ^ key\r\n if mykey not in self.dict:\r\n return default\r\n return self.dict[mykey]\r\n def __setitem__(self, key, item):\r\n mykey = self.random ^ key\r\n self.dict[mykey] = item\r\n def getkeys(self):\r\n return [self.random ^ i for i in self.dict]\r\n def __str__(self):\r\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\r\n \r\n# Solver function\r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = []\r\n for i in range(n):\r\n val = int(input())\r\n a.append(val)\r\n d = mydict()\r\n heap = []\r\n heapify(heap)\r\n numbers = n - k + 1\r\n for i in range(n - numbers + 1):\r\n d[a[i]] += 1\r\n ans = -10 ** 18\r\n for i in d.getkeys():\r\n if(d[i] == 1):\r\n heappush(heap, -i)\r\n ans = max(ans, i)\r\n if(ans == -10 ** 18):\r\n print(\"Nothing\\n\")\r\n else:\r\n print(str(ans) + \"\\n\")\r\n l = 0\r\n for i in range(n - numbers + 1, n):\r\n d[a[l]] -= 1\r\n d[a[i]] += 1\r\n if(d[a[i]] == 1):\r\n heappush(heap, -a[i])\r\n if(d[a[l]] == 1):\r\n heappush(heap, -a[l])\r\n l += 1\r\n if(len(heap) == 0):\r\n print(\"Nothing\\n\")\r\n continue\r\n ans = -10 ** 18\r\n while heap:\r\n val = -heappop(heap)\r\n if(d[val] != 1):\r\n continue\r\n ans = val\r\n heappush(heap, -ans)\r\n break\r\n if(ans == -10 ** 18):\r\n print(\"Nothing\\n\")\r\n else:\r\n print(str(ans) + \"\\n\")\r\n \r\n# Main \r\nfor _ in range(1):\r\n solve()" ]

[ "n = int(input())\r\nres = \"\"\r\nfor i in range(n):\r\n short = input()\r\n blocks = short.split(':')\r\n if '' in blocks:\r\n countOfNull = 9 - len(blocks)\r\n # short[short.index('::')+1]\r\n short = short.replace(\"::\", \":0000\"*countOfNull + \":\")\r\n blocks = short.split(':')\r\n short = \"\"\r\n for block in blocks:\r\n if len(block) < 4:\r\n block = \"0\"*(4-len(block))+block\r\n short += block + \":\"\r\n short = short[:-1]\r\n res += short + \"\\n\"\r\nres = res[:-1]\r\nprint(res)\r\n ", "n = eval(input())\nfor i in range(n):\n ans = ''\n k =''\n s = input().split(':')\n c = 0\n m = 0\n for g in range(len(s)):\n if s[g] != '':\n c += 1\n if c == 8:\n for j in range(c):\n s[j] = (4-len(s[j]))*'0' + s[j]\n ans += s[j] +':'\n else:\n k = (8-c)*'0000:'\n for j in range(len(s)):\n if s[j] == '':\n ans += k\n k = ''\n m = 1\n else:\n s[j] = (4-len(s[j]))*'0' + s[j]\n ans += s[j] +':'\n ans += k\n ans = ans[:-1]\n print(ans)\n\t\t\t\t \t \t\t\t\t \t \t \t", "def nts(x):\n x = str(hex(x))[2:]\n return '0' * (4 - len(x)) + x\n\ndef ch(s):\n if s == '':\n return ''\n a = [e for e in s.split(':')]\n for i in range(len(a)):\n a[i] = int(a[i], 16)\n return ':'.join(nts(e) for e in a)\n\ndef cnt(s):\n if s == '':\n return 0\n return sum([int(i == ':') for i in s]) + 1\n\ndef get(n):\n return ':'.join(['0000' for i in range(n)])\n\nT = int(input())\nfor cas in range(T):\n s = input()\n p, n = -1, len(s)\n for i in range(n - 1):\n if s[i] == s[i + 1] == ':':\n p = i\n break\n if p == -1:\n s = ch(s)\n else:\n s1 = ch(s[:i])\n s3 = ch(s[i + 2:])\n a, b = cnt(s1), cnt(s3)\n s2 = get(8 - a - b)\n s = s1 + ('' if s2 == '' or s1 == '' else ':') + s2 + ('' if s3 == '' or (s1 == '' and s2 == '') else ':') + s3\n print(s)\n", "for _ in range(int(input())):\r\n s = input()\r\n print(':'.join(i.zfill(4) for i in s.replace('::', ':' * (9 - s.count(':'))).split(':')))", "def zr(s):\r\n\ttmp=':0000'\r\n\tif s=='::':\r\n\t\treturn tmp[1:]+7*tmp\r\n\tind=s.find(\"::\")\r\n\tif ind<0:\r\n\t\treturn s\r\n\th,k=1,0\r\n\tif ind==0 or ind==len(s)-2:\r\n\t\tif ind>0:\r\n\t\t\th=2\r\n\t\telse:\r\n\t\t\tk=1\r\n\t\tddc=9-s.count(\":\")\r\n\telse:\r\n\t\tddc=8-s.count(':')\r\n\treturn (s[:ind]+ddc*tmp+s[ind+h:])[k:]\r\n\r\ndef t4(s):\r\n\tls=len(s)\r\n\tif ls==4:\r\n\t\treturn s\r\n\treturn (4-ls)*'0'+s\r\n\r\ndef spu(s):\r\n\tns=''\r\n\tfc=0\t\r\n\tsc=s.find(':')\r\n\twhile sc>0:\r\n\t\tns+=t4(s[fc:sc])+':'\r\n\t\tfc=sc+1\t\t\r\n\t\tsc=s.find(':',fc)\r\n\tns+=t4(s[fc:])\r\n\treturn ns\r\n\r\nn=int(input())\r\nv=[]\r\nfor c in range(n):\r\n\tv.append(spu(zr(input())))\r\nfor c in v:\r\n\tprint(c)", "#!usr/bin/python\n# -*- coding: utf-8 -*-\nimport ipaddress\n\narr = []\nfor i in range(int(input())):\n arr.append(ipaddress.ip_address(input()).exploded)\n\nfor i in arr:\n print(i)\n\n \t\t\t\t \t\t \t \t\t\t\t\t \t \t\t\t\t", "import sys\r\nfrom math import *\r\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\ndef do(s):\r\n\tr = []\r\n\tfor i in s.split(':'):\r\n\t\tr.append('0'*(4-len(i))+i)\r\n\treturn ':'.join(r)\r\n\r\nn = mint()\r\nfor i in range(n):\r\n\ts = minp()\r\n\tm = s.find(\"::\")\r\n\tif m != -1:\r\n\t\tprint(do(s[:m])+':0000'*(8-s.count(':'))+':'+do(s[m+2:]))\r\n\telse:\r\n\t\tprint(do(s))\r\n", "for _ in range(int(input())):\r\n D = input().split(':')\r\n if not D[0]:\r\n D = D[1:]\r\n if not D[-1]:\r\n D.pop()\r\n \r\n n = len(D)\r\n for i in range(n):\r\n D[i] = D[i].zfill(4) if D[i] else '0000:' * (8 - n) + '0000'\r\n \r\n print(':'.join(D))", "def _ip_ (ipv6):\n l = 7 - (len (ipv6) - len (ipv6.replace (\":\", \"\", )))\n ipv6 = ipv6.replace (\"::\", \":\" * (l + 2))\n list = ipv6.split (\":\", )\n ip = [\"\", \"\", \"\", \"\", \"\", \"\", \"\", \"\"]\n for i in range(0, 8):\n t = list [i]\n while len (t) != 4:\n t = \"0\" + t\n ip [i] = t\n t = \"\"\n for i in range(0, 8):\n t+= ip [i] + \":\"\n print (t [:len (t) - 1:])\nl = int (input ())\nfor i in range (0, l):\n _ip_ (input ())\n\n\t \t \t\t\t \t \t\t\t\t\t \t \t \t\t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfor _ in range(int(input())):\r\n s = input()[:-1].split(':')\r\n c = 0\r\n for i in s:\r\n if i != '':\r\n c += 1\r\n d = []\r\n x = 0\r\n for i in s:\r\n if i != '':\r\n d.append(i.rjust(4, '0'))\r\n else:\r\n if x == 0:\r\n x = 1\r\n d.extend(['0000' for _ in range(8-c)])\r\n print(':'.join(d))\r\n", "for i in range(int(input())):\n\n t = input().split(':')\n\n if t[-1] == '': t.pop()\n\n elif t[0] == '': t.pop(0)\n\n if '' in t: t[t.index('')] = ('0000:' * (9 - len(t)))[: -1]\n\n print(':'.join('0' * (4 - len(i)) + i for i in t))\n\n\n\n# Made By Mostafa_Khaled", "'''\nSolution\n\nTo find problems: [https://surya1231.github.io/Codeforces-contest/]\nhttps://codeforces.com/contest/1493/problem/B\n'''\n\nt = int(input())\n\n\ndef solve():\n i = input()\n shortened = i.split(':')\n\n o = []\n zeros_done = False\n for b in shortened:\n if b != '':\n o.append( b.zfill(4) )\n continue\n\n if not zeros_done:\n o.append('XXXX')\n zeros_done = True\n \n zb = 8 - (len(o) - 1)\n o = ':'.join(o)\n\n o = o.replace('XXXX', ':'.join(['0000'] * zb))\n\n return o\n\nwhile t:\n\n print( solve() )\n\n t -= 1", "n = int(input())\nfor i in range(n):\n\tr = input().split(':')\n\ts = ':'.join(x.zfill(4) if x else x for x in r)\n\twhile len(s) < 39:\n\t\tx = s.index('::')\n\t\ts = s[:x + 1] + '0000:' + s[x + 1:]\n\tif '::' in s:\n\t\tx = s.index('::')\n\t\ts = s[:x + 1] + s[x + 2:]\n\tprint(s.strip(':'))\n", "class CodeforcesTask250BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.shorts = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.shorts.append(input())\n\n def process_task(self):\n results = []\n for short in self.shorts:\n if \"::\" in short:\n if short[-2:] != \"::\" and short[:2] != \"::\":\n valid_blocks = short.count(\":\")\n elif short[-2:] == \"::\" and short[:2] == \"::\":\n valid_blocks = 0\n else:\n valid_blocks = short.count(\":\") - 1\n if valid_blocks:\n full = short.replace(\"::\", \":\" + \":\".join([\"0000\" for x in range(8 - valid_blocks)]) + \":\")\n else:\n full = \"0000:\" * 8\n if full[-1] == \":\":\n full = full[:-1]\n if full[0] == \":\":\n full = full[1:]\n\n parts = full.split(\":\")\n for x in range(len(parts)):\n parts[x] = \"0\" * (4 - len(parts[x])) + parts[x]\n results.append(\":\".join(parts))\n\n else:\n parts = short.split(\":\")\n for x in range(len(parts)):\n parts[x] = \"0\" * (4 - len(parts[x])) + parts[x]\n results.append(\":\".join(parts))\n self.result = \"\\n\".join(results)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask250BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "for kk in range(int(input())):\n str = input()\n print(':'.join(i.zfill(4)\n for i in str.replace('::', ':' * (9 - str.count(':'))).split(':')))\n\n\t\t\t \t\t\t\t \t \t\t\t \t\t \t \t \t \t\t\t\t", "for _ in range(int(input())):\r\n s = input().split(':')\r\n tmp = 8-sum(i!='' for i in s)\r\n if tmp > 0:\r\n for i in range(len(s)):\r\n if s[i] == '' :\r\n s[i] = '0000'+(tmp-1)*':0000'\r\n break\r\n l = []\r\n for i in s:\r\n if i != '':\r\n l.append('0'*(4-len(i))+i)\r\n print(':'.join(l))\r\n\r\n\r\n", "#!usr/bin/python\n# -*- coding: utf-8 -*-\n\n\ndef recover(ipStr: str):\n result = []\n resultNullCount = 0\n for ip in ipStr.split(':'):\n if ip == '':\n result.append('')\n resultNullCount += 1\n elif ip == '0':\n result.append('0000')\n else:\n ipLen = len(ip)\n zero = ''.join(['0' for temp in range(4-ipLen)])\n result.append(zero + ip)\n resultStr = ':'.join(result)\n resultLen = len(result)\n removeNullLen = resultLen - resultNullCount\n if removeNullLen == 8:\n return resultStr\n zero = ':'.join(['0000' for temp in range(8 - removeNullLen)])\n resultStr = resultStr.replace('::', ':' + zero + ':')\n return resultStr.strip(':')\n\n\narr = []\nfor i in range(int(input())):\n arr.append(recover(input()))\n\nfor i in arr:\n print(i)\n\n\t \t \t \t \t \t\t \t\t \t\t\t", "def full_ipv6(short_ipv6):\r\n blocks = short_ipv6.split(\":\")\r\n\r\n n_filled_blocks = 0\r\n for i in range(len(blocks)):\r\n if len(blocks[i]) >= 1: # Expand this block by adding leading zeroes\r\n blocks[i] = blocks[i].zfill(4)\r\n n_filled_blocks += 1\r\n\r\n n_zeroes_block = 8 - n_filled_blocks\r\n\r\n # print(blocks)\r\n\r\n i = 0\r\n first_empty = True\r\n while i < len(blocks):\r\n if blocks[i] == \"\":\r\n if first_empty:\r\n first_empty = False\r\n for _ in range(n_zeroes_block):\r\n blocks.insert(i, \"0000\")\r\n else:\r\n while i < len(blocks) and blocks[i] == \"\":\r\n # print(f\"Deleting {i}\")\r\n del blocks[i]\r\n i += 1\r\n\r\n # print(n_zeroes_block)\r\n # print(blocks)\r\n\r\n return \":\".join(blocks)\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n for _ in range(n):\r\n short_ipv6 = input().strip()\r\n\r\n print(full_ipv6(short_ipv6))\r\n\r\n # print(\"\")\r\n\r\n\r\n# import time\r\n\r\n# start_time = time.time()\r\nsolve()\r\n# print(\"--- %s seconds ---\" % ((time.time() - start_time)))\r\n", "import ipaddress\n\nn = int(input())\nfor i in range(n):\n short = str(input())\n long = ipaddress.IPv6Address(short).exploded\n print(long)\n\t \t \t \t\t\t \t\t\t\t\t \t\t \t\t\t", "from ipaddress import IPv6Address\r\n\r\nfor _ in range(int(input())):\r\n print(IPv6Address(input()).exploded)\r\n\r\n##########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n##########################################\r\n", "for _ in range(int(input())):\r\n D = input()\r\n print(':'.join(d.zfill(4) for d in D.replace('::', ':'*(9-D.count(':')))\r\n .split(':')))", "n = int(input())\r\nfor i in range(n):\r\n s = input().split(\":\")\r\n if(s[0] == ''): s.pop(0);\r\n if(s[-1] == ''): s.pop(-1);\r\n #print(s)\r\n rq = 8 - len(s) + 1;\r\n t = [];\r\n for x in s:\r\n if(x == ''):\r\n for j in range(rq): t+=['0000']\r\n else : t += [x]\r\n #print(t)\r\n u = \"\";\r\n for x in t: u += '0'*(4 - len(x)) + x + ':';\r\n print(u[:-1])\r\n \r\n \r\n", "import ipaddress\r\n\r\n\r\ndef solve():\r\n src = input()\r\n addr = ipaddress.ip_address(src)\r\n print(addr.exploded)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n for _ in range(n):\r\n solve()\r\n\r\n\r\nmain()\r\n", "from ipaddress import *\r\nfor _ in range(int(input())):print(ip_address(input()).exploded)", "import ipaddress\r\nfor _ in range(int(input())):\r\n print(ipaddress.ip_address(input()).exploded)\r\n", "n = int(input())\r\n\r\ndef solve(string: str):\r\n answer = str()\r\n if string == '::':\r\n print(f'0000:0000:0000:0000:0000:0000:0000:0000')\r\n return\r\n if '::' in string:\r\n zero_rows = ':'\r\n blocks = string.split(':')\r\n count_0 = 8 - len(blocks)\r\n for i in range(count_0 + 1):\r\n zero_rows += '0000:'\r\n string = string.replace('::', zero_rows)\r\n blocks = string.split(':')\r\n for i in range(len(blocks)):\r\n while len(blocks[i]) != 4:\r\n blocks[i] = '0' + blocks[i]\r\n answer = str()\r\n for i in range(len(blocks)):\r\n if i == len(blocks) - 1:\r\n answer += f'{blocks[i]}'\r\n else:\r\n answer += f'{blocks[i]}:'\r\n print(f'{answer}')\r\n\r\n\r\nfor _ in range(n):\r\n solve(input())", "import sys\n\ndef solve():\n n = int(input())\n for test in range(n):\n line = input().split(':')\n i = 0\n while i < len(line):\n if i > 0 and line[i] == '' and line[i-1] == '':\n line.pop(i)\n i-=1\n i+=1\n for i, string in enumerate(line):\n if string == '': line[i] = modify(string, want = (32 - 4 * (len(line) - 1)))\n else: line[i] = modify(string)\n tempstr = ''.join(line)\n chunked = [tempstr[i: i + 4] for i in range(0, 32, 4)]\n print(':'.join(chunked))\n\ndef modify(string, want = 4):\n while len(string) < want:\n string='0' + string\n return string\n # print(line)\n # res = \"\"\n # otherblocks = 0\n # sawprev = False\n # for c in line:\n # if c != ':' and sawprev == False:\n # otherblocks+=1\n # sawprev = True\n # if c == ':':\n # sawprev = False\n # print(otherblocks)\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "import re\nn=int(input())\nfor i in range(n):\n\ts=input().strip()\n\tgroup_count=s.count(':')+1\n\ts=re.sub('::',':'+(9-group_count)*'0000:',s)\n\tgroups=s.split(':')\n\tfor i,group in enumerate(groups):\n\t\tif len(group)<4:\n\t\t\tgroups[i]=(4-len(group))*'0'+group\n\tprint(':'.join(groups))\n \t\t \t \t\t\t \t \t\t\t", "from ipaddress import *\r\nfor _ in range(int(input())):\r\n\tprint(IPv6Address(input()).exploded)", "from ipaddress import IPv6Address\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n\tprint(IPv6Address(input()).exploded)", "t = int(input())\r\nwhile t :\r\n t -= 1\r\n ct = 0\r\n ls = list(input().split(':'))\r\n for i in range(len(ls)) :\r\n if ls[i] != \"\" and len(ls[i]) < 4 :\r\n while len(ls[i]) != 4 :\r\n ls[i] = '0' + ls[i]\r\n if ls[i] == '' :\r\n ct += 1\r\n if ct == 3 :\r\n print(\"0000:0000:0000:0000:0000:0000:0000:0000\")\r\n continue\r\n elif ct == 2 :\r\n for i in range(len(ls)) :\r\n if ls[i] == \"\" :\r\n val = 8-len(ls)+2\r\n for j in range(val) :\r\n ls[i] = \"0000\" + ls[i]\r\n if j == val-1 :\r\n continue\r\n ls[i] = ':'+ls[i]\r\n break\r\n for i in range(len(ls)) :\r\n if ls[i] == \"\" :\r\n continue\r\n print(ls[i],end=\"\")\r\n if ls[-1] == \"\" and i == len(ls) - 2 :\r\n break\r\n if ls[1] == \"\" and i == len(ls) - 1 :\r\n break\r\n print(':',end=\"\")\r\n elif ct == 1 :\r\n for i in range(len(ls)) :\r\n if ls[i] == \"\" :\r\n for j in range(8-len(ls)+1) :\r\n ls[i] = \"0000\" + ls[i]\r\n if j == 8-len(ls) :\r\n continue\r\n ls[i] = ':' + ls[i]\r\n for i in range(len(ls)) :\r\n print(ls[i],end=\"\")\r\n if i != len(ls) - 1 :\r\n print(':',end=\"\")\r\n else :\r\n for i in range(len(ls)) :\r\n print(ls[i],end=\"\")\r\n if i != len(ls) - 1 :\r\n print(':',end=\"\")\r\n print()", "t = int(input())\r\nwhile t:\r\n t-=1\r\n s=input()\r\n l=s.split(':')\r\n dc=0\r\n for i in range(len(s)-1):\r\n if(s[i]==':' and s[i+1]==':'):\r\n dc=1\r\n break\r\n if(dc==0):\r\n ans=\"\"\r\n for i in range(len(l)):\r\n if(len(l[i])!=4):\r\n stuf=\"\"\r\n new=\"\"\r\n for j in range(4-len(l[i])):\r\n stuf+=\"0\"\r\n new+=stuf\r\n new+=l[i]\r\n l[i]=new\r\n else:\r\n cnt=0\r\n l=s.split(':')\r\n for i in range(len(s)-1):\r\n if(s[i]==':'):cnt+=1\r\n if(s[0]==s[1]==':'):cnt-=1 \r\n l1=[]\r\n f=0\r\n for i in range(len(l)):\r\n if(len(l[i])!=4 and len(l[i])!=0):\r\n stuf=\"\"\r\n new=\"\"\r\n for j in range(4-len(l[i])):\r\n stuf+=\"0\"\r\n new+=stuf\r\n new+=l[i]\r\n l1.append(new)\r\n elif(l[i]=='' and f==0):\r\n f=1\r\n for k in range(8-cnt):\r\n l1.append(\"0000\")\r\n elif(len(l[i])!=0):\r\n l1.append(l[i])\r\n l=l1\r\n for i in range(len(l)-1):\r\n print(l[i],end=\":\")\r\n print(l[len(l)-1],end=\"\")\r\n print()\r\n\r\n", "def f(s):\r\n res = []\r\n sp = s.split(\":\")\r\n if not sp[0]:\r\n sp[0] = \"0\"\r\n if not sp[-1]:\r\n sp[-1] = \"0\"\r\n for b in sp:\r\n if b:\r\n res.append(\"{:0>4}\".format(b))\r\n if not b:\r\n res.extend((\"0000\" for i in range(8 - len(sp) + 1)))\r\n return(\":\".join(res))\r\n \r\nt = int(input())\r\nfor i in range(t):\r\n ip = input()\r\n print(f(ip))\r\n", "n = int(input())\r\nfor i in range(n):\r\n s = input().split(':')\r\n if (s[0] == ''):\r\n s[0] = '0'*4\r\n if s[-1] == '':\r\n s[-1] = '0'*4\r\n idx = -1\r\n for i in range(len(s)):\r\n if s[i] == '':\r\n idx = i\r\n break\r\n for i in range(len(s)):\r\n if (len(s[i]) < 4):\r\n s[i] = (4-len(s[i]))*'0'+s[i]\r\n if idx != -1:\r\n s[idx:idx+1] = (8-len(s)+1)*['0'*4]\r\n print(':'.join(s)) \r\n", "\r\n\r\ndef restora(lin):\r\n lin = lin.split(\":\")\r\n ans = []\r\n falt = 8\r\n for w in lin:\r\n if w != \"\":\r\n falt -= 1\r\n for w in lin:\r\n if w == \"\":\r\n while falt > 0:\r\n ans.append(\"0000\")\r\n falt -= 1\r\n continue\r\n while len(w) < 4:\r\n w = '0' + w\r\n ans.append(w)\r\n return ':'.join(ans)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n for i in range(n):\r\n print(restora(input()))\r\n\r\n\r\nmain()\r\n", "# coding=utf8\ncnt = input()\nfor k in range(int(cnt)):\n ip = input()\n if ip == \"\":\n print(\"0000:0000:0000:0000:0000:0000:0000:0000\")\n continue\n ip = ip.split(\":\")\n ret = \"\"\n # 扩::\n if ip[0] == \"\":\n ip = [\"0000\"] * (8 - len(ip) + 2) + ip[2:]\n elif ip[-1] == \"\":\n ip = ip[:-2] + [\"0000\"] * (8 - len(ip) + 2)\n for i in range(len(ip)):\n if ip[i] == \"\":\n ip = ip[:i] + [\"0000\"] * (8 - len(ip) + 1) + ip[i + 1:]\n for i in range(len(ip)):\n if ip[i] != \"\":\n ip[i] = \"0\" * (4 - len(ip[i])) + ip[i]\n print(\":\".join(ip))\n \t\t\t \t \t \t\t\t\t\t\t\t\t \t \t \t \t", "def s():\r\n\tn = int(input())\r\n\tdef st(x):\r\n\t\tif x[0] == ':':\r\n\t\t\tx = x[1:]\r\n\t\tif x[-1] == ':':\r\n\t\t\tx = x[:-1]\r\n\t\treturn x\r\n\tfor _ in range(n):\r\n\t\ta = st(input()).split(':')\r\n\t\tfor i in range(len(a)):\r\n\t\t\tif len(a[i]) == 0:\r\n\t\t\t\ta[i] = '0000:'*(8-len(a))+'0000'\r\n\t\t\telif len(a[i])<4:\r\n\t\t\t\ta[i] = '0'*(4-len(a[i]))+a[i]\r\n\t\tprint(*a,sep=':')\r\ns()", "for _ in range((int)(input())) :\r\n s = input()\r\n if s[0] == \":\" : s = s[1:]\r\n elif s[-1] == \":\" : s = s[:-1]\r\n s = s.split(':')\r\n for _ in range(len(s)) :\r\n if s[_] == \"\" :\r\n while len(s) < 8 : s.insert(_ , \"\")\r\n for _ in range(8) : s[_] = s[_].zfill(4)\r\n print(\":\".join(s))", "t=int(input())\nfor _ in range(t):\n s=input()\n if '::' not in s:\n arr=s.split(':')\n temp=''\n for x in arr:\n temp+=(4-len(x))*'0'+x+':'\n print(temp[:-1])\n else:\n arr=s.split(':')\n val=0\n for x in arr:\n if x!='':\n val+=1\n idx=arr.index('')\n need=8-val\n temp=''\n fl=0\n for x in arr:\n if x!='':\n temp+=(4-len(x))*'0'+x+':'\n else:\n if fl==0:\n temp+=('0000:'*need)\n fl=1\n print(temp[:-1])", "n=int(input())\r\ndfg=[]\r\n\r\nfor i in range(n):\r\n IP=input().split(':')\r\n if IP[0]=='': IP.pop(0)\r\n if IP[-1]=='': IP.pop(-1)\r\n addlen = 8-len(IP)\r\n for i in range(len(IP)):\r\n if IP[i] == '':\r\n for j in range(addlen):\r\n IP.insert(i,\"\")\r\n break\r\n # print(dfg)\r\n # print(len(IP))\r\n for i in range(8):\r\n IP[i]='0'*(4-len(IP[i]))+IP[i]\r\n b=[]\r\n for i in range(8):\r\n b.append(IP[i]+':'if i!=7 else IP[i])\r\n dfg.append(b) \r\nfor i in range(n):\r\n for j in range(8):\r\n print(dfg[i][j],end='')\r\n print() \r\n\r\n'''6\r\na56f:d3:0:0124:01:f19a:1000:00\r\na56f:00d3:0000:0124:0001::\r\na56f::0124:0001:0000:1234:0ff0\r\na56f:0000::0000:0001:0000:1234:0ff0\r\n::\r\n0ea::4d:f4:6:0'''\r\n", "def ipv6(inputs):\r\n result = list()\r\n data = list(map(str, inputs.split()))\r\n size = int(data.pop(0))\r\n for _ in range(size):\r\n current = data.pop(0).split(':')\r\n result.append(\"\")\r\n current_length = len(current)\r\n #difference = 8-current_length\r\n while len(current) > 0:\r\n value = current.pop(0)\r\n if value == '':\r\n result[-1]+=\"0000:\"\r\n if len(current)>0:\r\n while current[0] == '':\r\n current.pop(0)\r\n current_length -= 1\r\n if len(current)==0: \r\n break\r\n \r\n while 8-current_length > 0:\r\n result[-1]+=\"0000:\"\r\n current_length+=1\r\n continue\r\n for _ in range(4-len(value)):\r\n result[-1]+=\"0\"\r\n result[-1]+=value + \":\"\r\n result[-1] = str(result[-1][:len(result[-1])-1])\r\n return \"\\n\".join(result)\r\n\r\nsize = input()\r\ninputs = size\r\nfor _ in range(int(size)):\r\n inputs += \"\\n\"+input()\r\n\r\nprint(ipv6(inputs))" ]

[ "t = int(input())\r\nfor i in range(t):\r\n n, r = map(int, input().split())\r\n l = list(map(int, input().split()))\r\n if r == 1:\r\n s = sum(l) % n\r\n if s == 0:\r\n s = n\r\n print(s)\r\n else:\r\n s = 2 * l[0] - r + 1 - sum(l)\r\n s = s % n\r\n if s == 0:\r\n s = n\r\n print(s)\r\n", "t = int(input())\r\nfor _ in range(t):\r\n n, r = map(int, input().split())\r\n s = sum(map(int, input().split()))\r\n x = 1\r\n while (s + x + r) % n != 0:\r\n x += 1\r\n print(x)\r\n", "T = int(input())\nfor t in range(T):\n N, R = map(int, input().split())\n print(1 + (R - sum(map(int, input().split()))) % N)\n" ]

[ "from math import comb\r\ndec=10**9 + 7\r\n\r\nk =int(input())\r\n\r\ncolor_counts = [0] * k\r\n\r\nfor i in range(0, k):\r\n color_counts[i] = int(input())\r\n\r\nresult = 1\r\ncurr = color_counts[0]\r\n\r\nfor i in range(1,k):\r\n result = result * comb(curr + color_counts[i] - 1 , color_counts[i] - 1) % dec\r\n curr = curr + color_counts[i]\r\n\r\nprint(result)", "from math import comb\nmod=10**9+7\nk =int(input())\nres=1\ntot=int(input())\nfor i in range(1,k,1):\n c=int(input())\n res=res*comb(tot+c-1,c-1)%mod\n tot+=c\nprint(res)", "import sys\n#sys.setrecursionlimit(20000)\n#from collections import deque #Counter\n#from itertools import accumulate, product\n#from functools import reduce\n#from math import gcd #sqrt\nimport math\n\n\ndef rall():\n return [x.strip() for x in sys.stdin.readlines()]\ndef rl():\n return sys.stdin.readline().strip()\ndef rl_types(types):\n str_list = [x for x in sys.stdin.readline().strip().split(' ')]\n return [types[i](str_list[i]) for i in range(len(str_list))]\n\ndef pr( something='' ):\n sys.stdout.write( str(something) + '\\n')\ndef pra( array ):\n sys.stdout.write( ' '.join([str(x) for x in array]) + '\\n')\n\n\n\nif __name__ == '__main__':\n\n K = int( rl() )\n colors = [int(rl()) for _ in range(K)]\n #pra(colors)\n\n MOD = 1_000_000_007\n nways = 1\n placed = colors[0] # place all the ones first\n for i in range(1,K):\n boxes = placed+1\n toplace = colors[i]-1 # -1 because of the one that was already placed\n nways = (nways * math.comb((boxes+toplace-1),toplace)) % MOD\n placed += colors[i]\n print(nways)\n\n\n", "def fact(x):\r\n r = 1\r\n for i in range(1, x + 1): r *= i\r\n return r\r\n\r\nmod = int(1e9 + 7)\r\nn = int(input())\r\narr = [0] * n\r\nfor i in range(n): arr[i] = int(input())\r\nr = 1; s = 0\r\nfor i in range(1, n):\r\n s += arr[i - 1]\r\n r *= fact(s + arr[i] - 1) // fact(s) // fact(arr[i] - 1)\r\n r %= mod\r\nprint(r)\r\n", "def fpow(a,n):\n ret = 1\n a = a % mod\n while n:\n if n&1:\n ret = ret*a%mod\n a = a*a%mod\n n >>= 1\n return ret\n\ndef prob(i, j):\n\treturn factorial[i]*fpow(factorial[j]*factorial[i-j]%mod,mod-2)%mod\n\nmod = 1000000007\nsum_colors = 0\nfactorial = [1]\ncolors = []\ntot = 1\n\nfor x in range(1, 1000000, 1):\n\tfactorial.append((factorial[x-1])*x%mod)\n\nn_colors = int(input())\nfor x in range(n_colors):\n\t_in = int(input())\n\tcolors.append(_in)\n\tsum_colors += _in\n\nfor x in range(n_colors-1, -1, -1):\n\ttot = tot * prob(sum_colors-1, colors[x]-1)%mod\n\tsum_colors -= colors[x]\n\nprint(tot)\n", "k,md,s,res=int(input()),1000000007,int(input()),1\r\nc=[[1]+[0]*1000 for i in range(1001)]\r\nfor i in range(1,1001):\r\n\tfor j in range(1,i+1):\r\n\t\tc[i][j]=(c[i-1][j]+c[i-1][j-1])%md\r\nfor i in range(1,k):\r\n\tx=int(input())\r\n\ts+=x\r\n\tres=(res*c[s-1][x-1])%md\r\nprint(res)", "from collections import *\nfrom heapq import *\nfrom bisect import *\nfrom math import *\nfrom sys import stdin\ndef rl(f=int):\n return list(map(f, input().split()))\ndef rn(f=int):\n return f(input())\ndef rls():\n return [line.strip() for line in stdin.readlines()]\nk=rn()\nc=[rn() for _ in range(k)]\nt=1\ncount = c[0]\nfor i in c[1:]:\n n = i-1\n t*=comb(n+count, n)\n t%=1000000007\n count += i\nprint(t)\n", "n=int(input())\nret=1\nsum=0\nmod=1000000007\nfor a in range(n):\n q=int(input())\n e=1\n for b in range(q-1):\n e*=(sum+1+b)\n sil=1\n for b in range(2,q):\n sil*=b\n e//=sil\n e%=mod\n ret*=e\n ret%=mod\n sum+=q\nprint(ret)\n\n", "\r\ndef gcd(a,b):\r\n if a<b:a,b=b,a\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\n\r\n\r\nk=int(input())\r\nc=[int(input()) for i in range(k)]\r\nc=c[::-1]\r\n\r\nmod = 1000000007\r\nres = 1\r\nplaces = c[-1]+1\r\nt=1\r\n\r\nparts = []\r\n\r\nfor i in range(k-2,-1,-1):\r\n tmp = 1\r\n buf = 1\r\n for j in range(c[i]-1):\r\n tmp*=places\r\n buf*=(j+1)\r\n\r\n g = gcd(tmp, buf)\r\n tmp //= g\r\n buf //= g\r\n\r\n places+=1\r\n\r\n tmp //= gcd(tmp, buf)\r\n parts.append(tmp)\r\n places += 1\r\n\r\nfor i in range(len(parts)):\r\n res=(res*parts[i])%mod\r\n\r\nprint(res)", "from heapq import heapify, heappush, heappop\nfrom collections import Counter, defaultdict, deque, OrderedDict\nfrom sys import setrecursionlimit, maxsize\nfrom bisect import bisect_left, bisect, insort_left, insort\nfrom math import ceil, log, factorial, hypot, pi\nfrom fractions import gcd\nfrom copy import deepcopy\nfrom functools import reduce\nfrom operator import mul\nfrom itertools import product, permutations, combinations, accumulate, cycle\nfrom string import ascii_uppercase, ascii_lowercase, ascii_letters, digits, hexdigits, octdigits\n\nprod = lambda l: reduce(mul, l)\nprodmod = lambda l, mod: reduce(lambda x, y: mul(x,y)%mod, l)\n\ndef read_list(t): return [t(x) for x in input().split()]\ndef read_line(t): return t(input())\ndef read_lines(t, N): return [t(input()) for _ in range(N)]\n\nmod = 10**9+7\ndef inv(x):\n return pow(x, mod-2, mod)\n\nK = read_line(int)\nballs = read_lines(int, K)\n\ns = balls[0]\nans = 1\nfor ball in balls[1:]:\n ans *= ball\n ans %= mod\n for i in range(s+1, s+ball):\n ans *= i\n ans %= mod\n for i in range(ball):\n ans *= inv(i+1)\n ans %= mod\n s += ball\nprint(ans)\n", "#!/usr/bin/python3\n\nimport sys\nfrom functools import lru_cache\n\nMOD = 1000000007\n\ncnk = [[1 for i in range(1001)] for j in range(1001)]\nfor i in range(1, 1001):\n for j in range(1, i):\n cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j]\n\n\nk = int(input())\ncs = [int(input()) for i in range(k)]\n\nans = 1\nsm = 0\nfor c in cs:\n sm += c\n ans = (ans * cnk[sm - 1][c - 1]) % MOD\n\nprint(ans)\n", "__author__ = 'lenovo-pc'\r\nMOD = int(1e9+7)\r\ndef quikc_pow(x, k):\r\n res = 1\r\n while k > 0:\r\n if k % 2 == 1:\r\n res = (x * res) % MOD\r\n x = (x * x) % MOD\r\n k >>= 1\r\n return res\r\nM = 2e5+5\r\nfac = [1]*200005\r\ninv = [1]*200005\r\ndef init():\r\n fac[0] = 1\r\n for i in range(1, len(fac)):\r\n fac[i] = (fac[i-1] * i) % MOD\r\n for i in range(len(inv)):\r\n inv[i] = quikc_pow(fac[i], MOD-2)\r\ndef Com(n, m):\r\n return fac[n] * inv[m] % MOD * inv[n-m] % MOD\r\ninit()\r\nk = int(input())\r\ncnt = [1] * 1001\r\nfor i in range(k):\r\n cnt[i] = int(input())\r\nans = 1\r\nsum = cnt[0]\r\nfor i in range(1, k):\r\n ans *= Com(sum + cnt[i] - 1, cnt[i] - 1)\r\n\r\n ans %= MOD\r\n sum += cnt[i]\r\nprint(ans)", "#!/usr/bin/python3\r\n\r\nimport sys\r\nfrom functools import lru_cache\r\n\r\nMOD = 1000000007\r\n\r\ncnk = [[1 for i in range(1001)] for j in range(1001)]\r\nfor i in range(1, 1001):\r\n for j in range(1, i):\r\n cnk[i][j] = cnk[i - 1][j - 1] + cnk[i - 1][j]\r\n\r\n\r\nk = int(input())\r\ncs = [int(input()) for i in range(k)]\r\n\r\nans = 1\r\nsm = 0\r\nfor c in cs:\r\n sm += c\r\n ans = (ans * cnk[sm - 1][c - 1]) % MOD\r\n\r\nprint(ans)\r\n", "def fact(n) :\r\n p = n; \r\n # print(\"n=\" + str(n))\r\n for i in range(1, n) :\r\n # print(\"i=\" + str(i)) \r\n p *= i\r\n if(n == 0) :\r\n return 1\r\n return p\r\ndef ncr(n, r) : \r\n return fact(n) // fact(n-r) // fact(r)\r\nn = int(input())\r\nc = []\r\nfor i in range(n) :\r\n k = int(input()) \r\n c.insert(len(c), k)\r\n # print(\"hi - \" + str(c[i]))\r\np = 1\r\nsum = 0\r\nfor i in range(n) :\r\n # print(\"i=\" + str(i)) \r\n sum += c[i]\r\n # print(\"sum=\" + str(sum))\r\n# print(sum);\r\nfor i in range(n, 0, -1) :\r\n # print(\"alala : \" + str(ncr(sum-1, c[i-1]-1)))\r\n # print(\"sum=\" + str(sum-1) + \" c : \" + str(c[i-1]-1))\r\n p = p * ncr(sum-1, c[i-1]-1)\r\n p %= 1000000007\r\n sum -= c[i-1]\r\nprint(int(p))", "k=int(input())\r\nsol=1\r\nprije=0\r\nfor i in range (k):\r\n color=int(input())\r\n br1=1\r\n for y in range (prije+1, prije+color):\r\n br1*=y\r\n br2=1\r\n for y in range (color-1, 1, -1):\r\n br2*=y\r\n #print(sol, color, br1, br2, prije)\r\n prije+=color\r\n sol*=(br1//br2)\r\n sol%=(10**9+7)\r\nprint(sol)\r\n", "from math import factorial\nn,ans,s = int(input()),1,0\nfor i in range(n) :\n a = int(input())\n ans=(ans*factorial(s+a-1)//factorial(s)//factorial(a-1))%1000000007\n s+=a\nprint(ans)\n\n\n#copied...\n", "import math\n\ndef euclid_algorithm(a, b):\n t1, t2 = abs(a), abs(b)\n #saving equalities:\n #t1 == x1 * a + y1 * b,\n #t2 == x2 * a + y2 * b. \n x1, y1, x2, y2 = int(math.copysign(1, a)), 0, 0, int(math.copysign(1, b))\n if t1 < t2:\n t1, t2 = t2, t1\n x1, y1, x2, y2 = x2, y2, x1, y1\n\n while t2 > 0:\n if x1 * a + y1 * b != t1:\n print('inshalla')\n k = int(t1 // t2)\n t1, t2 = t2, t1 % t2\n #t1 - k * t2 == (x1 - k * x2) * a + (y1 - k * y2) * b\n x1, y1, x2, y2 = x2, y2, x1 - k * x2, y1 - k * y2\n\n return t1, x1, y1\n\ndef opposite_element(x, p):\n gcd, k, l = euclid_algorithm(x, p)\n if gcd != 1:\n return -1\n return k % p\n\ndef fact_mod(n, p):\n prod = 1\n for i in range(2,n+1):\n prod *= i\n prod %= p\n return prod\n\nk = int(input())\nc = []\nfor i in range(k):\n c.append(int(input()))\nprefix_sum = 0\np = 10 ** 9 + 7\ndenominator = 1\nfor c_i in c:\n denominator *= fact_mod(c_i - 1, p)\n denominator %= p\n prefix_sum += c_i\n denominator *= prefix_sum\n denominator %= p\n\nnumenator = fact_mod(prefix_sum, p)\n\nprint(numenator * opposite_element(denominator, p) % p)\n", "import sys\r\ninput = sys.stdin.readline\r\nc = [[0]*1007 for i in range(0,1007)]\r\nMOD = int(1e9+7)\r\nc[0][0] = 1\r\n\r\nfor i in range(1,1007):\r\n for j in range(0,i+1):\r\n if(j==0 or j==i):\r\n c[i][j] = 1\r\n else:\r\n c[i][j] = (c[i-1][j-1]+c[i-1][j])%MOD\r\n\r\nn = int(input())\r\nans = 1\r\nsums = 0\r\n\r\nfor i in range(0,n):\r\n a = int(input())\r\n ans = (ans*c[a+sums-1][sums])%MOD\r\n sums += a\r\n\r\nprint(ans)", "MOD = 1000000007\r\n\r\n\r\ndef C(n, k):\r\n global coefficients\r\n if k > n:\r\n return 0\r\n if k == 0 or k == n:\r\n return 1\r\n if coefficients[n][k] != -1:\r\n return coefficients[n][k]\r\n coefficients[n][k] = C(n - 1, k - 1) + C(n - 1, k)\r\n #print(n, k, coefficients[n][k])\r\n return coefficients[n][k] % MOD\r\n\r\n\r\ndef numberOfWays(n, K, k):\r\n ways = 1\r\n for i in range(K - 1, 0, -1):\r\n ways *= C(n-1, k[i] - 1)\r\n ways %= MOD\r\n n -= k[i]\r\n #print(ways, n)\r\n return ways\r\n\r\n\r\nif __name__ == \"__main__\":\r\n coefficients = [[-1] * 1001 for i in range(1001)]\r\n k = int(input())\r\n n = 0\r\n L = []\r\n for i in range(k):\r\n L.append(int(input()))\r\n n += L[-1]\r\n print(numberOfWays(n, k, L))\r\n", "MOD = int(1e9 + 7)\r\nC = [[0]*(1001) for i in range(1001)]\r\nC[0][0] = 1\r\nfor n in range(1,1001):\r\n\tC[n][0] = 1\r\n\tC[n][n] = 1\r\n\tfor k in range(1,n):\r\n\t\tC[n][k] = C[n-1][k-1] + C[n-1][k]\r\nk = int(input())\r\nr = 1\r\nn = 0\r\nfor i in range(k):\r\n\tc = int(input())\r\n\tn += c\r\n\tr = (r * C[n-1][c-1]) % MOD\r\nprint(r)\r\n", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\nfrom bisect import bisect_right\r\nk=int(input())\r\nans=1\r\ntotal=0\r\nMOD=1000000007\r\nfor i in range(k):\r\n\tz=int(input())\r\n\tans=(ans*factorial(total+z-1)//factorial(total)//factorial(z-1))%MOD\r\n\ttotal+=z\r\nprint(ans)", "from math import comb\nk = int(input())\ncolors = [int(input()) for _ in range(k)]\ntotal = 1\nbars = colors[0]\nfor c in colors[1:]:\n stars = c-1\n total*=comb(stars+bars,stars)\n bars += c\nprint(total%(10**9+7))", "k = int(input())\r\nfact = [1] * 1000000\r\nfor j in range(2, 1001):\r\n fact[j] = fact[j - 1] * j\r\ncnt = 1\r\nl = 0\r\nfor i in range(k):\r\n cur = int(input())\r\n cnt *= (fact[l + cur - 1] // fact[cur - 1] // fact[l]) % 1000000007\r\n l += cur\r\nprint(int(cnt) % 1000000007)\r\n", "n = int(input())\r\na = [0]\r\ns = [0]\r\nmd = 1000000007\r\nfor i in range(n) :\r\n x = int(input())\r\n a.append(x)\r\n s.append(s[len(s)-1]+x)\r\n\r\ndef factor(x) :\r\n total = 1\r\n for i in range(2,x+1) : total*=i\r\n return total\r\n\r\nans = 1\r\nfor i in range(2,n+1) :\r\n ans*=factor(s[i-1]+a[i]-1)//factor(s[i-1])//factor(a[i]-1)\r\n ans%=md\r\nprint(ans)\r\n", "k=int(input())\r\nmod=10**9+7\r\nf=[0]*(10**6+1)\r\nf[0]=f[1]=1\r\nfor i in range(2,10**6+1):\r\n f[i]=(f[i-1]*i)%mod\r\ndef comb(n,r):\r\n return (f[n]*pow(f[r],mod-2,mod)*pow(f[n-r],mod-2,mod))%mod\r\nans=1\r\ncc=int(input())\r\nfor i in range(1,k):\r\n c=int(input())\r\n cc+=c\r\n ans*=comb(cc-1,c-1)\r\n ans%=mod\r\nprint(ans)", "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\n\r\npascal = [[1], [1, 1]]\r\nfor i in range(2, 1001):\r\n row = [1]\r\n for j in range(i - 1):\r\n row.append((pascal[-1][j] + pascal[-1][j + 1]) % (10 ** 9 + 7))\r\n row.append(1)\r\n pascal.append(row)\r\n\r\nk = int(input())\r\ntotal = int(input())\r\ndp = [1]\r\nfor i in range(k - 1):\r\n n = int(input())\r\n total += n - 1\r\n res = dp[-1] * pascal[total][n - 1]\r\n res = res % (10 ** 9 + 7)\r\n total += 1\r\n dp.append(res)\r\nprint(dp[-1])", "s = int(input())\r\nMOD = int(1e9 + 7)\r\n\r\ncomb = [[1] + [0 for i in range(1000)] for j in range(1001)]\r\nfor i in range(1,1001):\r\n for j in range(1,i+1):\r\n comb[i][j] = (comb[i-1][j] + comb[i-1][j-1]) % MOD\r\n\r\nres = 1\r\nsums = 0\r\nfor i in range(s):\r\n x = int(input())\r\n res = (res * comb[sums + x - 1][x - 1]) % MOD\r\n sums += x\r\nprint(res)\r\n ", "import math as ma\r\nm=10**9+7\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(int(input()))\r\nb=a[0]\r\nc=1\r\nfor i in range(1,n):\r\n c=((c*((ma.factorial(b+a[i]-1))//(ma.factorial(b)*ma.factorial(a[i]-1)))%m))\r\n b=(b+a[i])%m\r\nprint(c)", "kk = 1\r\nf = [0] * 1001\r\nf[0] = 1\r\nfor i in range(1, 1001):\r\n kk *= i\r\n kk %= (10**9+7)\r\n f[i] = pow(kk, 10**9+5, 10**9+7)\r\n\r\n\r\ndef c(n, k):\r\n prod = 1\r\n for i in range(n-k+1, n+1):\r\n prod *= i\r\n prod %= (10**9+7)\r\n prod = (prod*f[k])%(10**9+7)\r\n \r\n return prod\r\nl = []\r\nm = []\r\na = 1\r\ns = 0\r\nfor i in range(int(input())):\r\n x = int(input())\r\n s += x\r\n l.append(s-1)\r\n m.append(x-1)\r\n\r\nans = 1\r\nfor i in range(len(l)):\r\n ans = (ans*c(l[i], m[i]))%(10**9+7)\r\nprint(ans)\r\n", "k = int(input())\n\nh = []\n\nfor i in range(k):\n h.append(int(input()))\n\n\nffs = [1]\ndef f(n):\n if n < len(ffs):\n return ffs[n]\n v = n * f(n-1)\n ffs.append(v)\n return v\n\n\ndef c(k, n):\n return f(n) // (f(k) * f(n-k))\n\ndef cc(k, n):\n return c(n-1, n + k-1)\n\n\ndef solve(h):\n if len(h) == 1:\n return 1\n\n hh = h[:-1]\n hh_len = sum(hh)\n\n return solve(hh) * cc(h[-1] -1, hh_len + 1)\n\n\nr = 1\nfor i in range(len(h)):\n r *= cc(h[i] -1, sum(h[:i]) + 1)\n\nprint(r % 1000000007)\n", "from typing import List\n\ndef ways_to_draw_balls_from_bag(k:int, cs:List[int])->int:\n # the permutation take a long time for maximum number 1005, \n # so minimize the range only for the largest number among the colors\n size = min(1005, sum(cs))\n mod = int(1e9) + 7\n per = [[0 for i in range(size)] for j in range(size)]\n for i in range(size):\n per[i][0] = 1\n per[i][i] = 1\n for i in range(1, size):\n for j in range(1, i):\n per[i][j] = (per[i-1][j-1] + per[i-1][j]) % mod\n \n answer = 1\n total = 0\n for c in cs:\n total += c\n way = per[total - 1][c - 1]\n answer = (answer * way) % mod\n return answer\nt = int(input())\na = []\nfor i in range(t):\n a.append(int(input()))\nprint(ways_to_draw_balls_from_bag(t,a))\n", "from math import comb\n\ncount = 0\ntotal = 1\nfor _ in range(int(input())):\n\ta = int(input())\n\tcount += a\n\ttotal = (total * comb(count - 1, a - 1)) % 1000000007\nprint(total)\n\t\t \t \t\t\t\t \t\t \t \t \t\t\t \t", "k=int(input())\r\nl=[int(input()) for i in range(k)]\r\ns=0 \r\nans=[0]*k \r\nans[0]=1 \r\nMOD=10**9+7 \r\nfact=[0]*(10**6+5)\r\nfact[0]=1 \r\nfor i in range(1,10**6+5):\r\n fact[i]=(fact[i-1]%MOD*i%MOD)%MOD\r\ndef MI(a,MOD):\r\n return pow(a,MOD-2,MOD)\r\ndef c(n, k):\r\n if n==k or k==0:\r\n return 1 \r\n if n<k:\r\n return 0 \r\n return (fact[n]*MI(fact[k],MOD)%MOD*MI(fact[n-k],MOD)%MOD)%MOD\r\nans=1 \r\nsm=l[0]\r\nfor i in range(1,k):\r\n curr=l[i]\r\n ans=ans*(c(sm+curr-1,curr-1))\r\n ans%=MOD \r\n sm+=l[i]\r\nprint(ans)", "import sys\r\n\r\ndef choose(n, k):\r\n if 0 <= k <= n:\r\n ntok = 1\r\n ktok = 1\r\n for t in range(1, min(k, n - k) + 1):\r\n ntok *= n\r\n ktok *= t\r\n n -= 1\r\n return ntok // ktok\r\n else:\r\n return 0\r\n\r\nR = 1000000007\r\n\r\ndef main():\r\n k = int(sys.stdin.readline())\r\n data = list(map(int,sys.stdin.readlines()))\r\n s = sum(data)\r\n ans=1\r\n free = s\r\n for i in range(k-1,0,-1):\r\n t = choose(free-1, data[i]-1)\r\n ans= (((t%R)*ans)%R)\r\n free-=data[i]\r\n print(ans)\r\n\r\nmain()\r\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint\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\ndef pascle(lim):\r\n p = matrix(lim, lim)\r\n for i in range(lim):\r\n p[i][i] = p[i][0] = 1\r\n for i in range(1, lim):\r\n for j in range(1, lim):\r\n p[i][j] = (p[i - 1][j - 1] + p[i - 1][j]) % mod\r\n return p\r\n\r\n\r\np = pascle(1005)\r\nn = int(input())\r\na = [0] + [int(input()) for i in range(n)]\r\ns = 0\r\nans = 1\r\nfor i in range(1, n + 1):\r\n ans = (ans * p[s + a[i] - 1][a[i] - 1]) % mod\r\n s += a[i]\r\nprint(ans)\r\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\ndef egcd(a, b):\r\n if a == 0:\r\n return (b, 0, 1)\r\n else:\r\n g, y, x = egcd(b % a, a)\r\n return (g, x - (b // a) * y, y)\r\n\r\ndef modinv(a, m):\r\n g, x, y = egcd(a, m)\r\n if g != 1:\r\n raise Exception('modular inverse does not exist')\r\n else:\r\n return x % m\r\n\r\nmod=10**9+7\r\ndef main():\r\n k=ri()\r\n a=[0]*k\r\n dp=[0]*k\r\n pf=[0]*k\r\n for i in range(k): a[i]=ri()\r\n dp[0]=1\r\n pf[0]=a[0]\r\n for i in range(1,k):pf[i]=pf[i-1]+a[i]\r\n for i in range(1,k):\r\n dp[i]=dp[i-1]\r\n for j in range(pf[i-1]+1,pf[i]): dp[i]=dp[i]*j%mod\r\n for j in range(2,a[i]): dp[i]=dp[i]*modinv(j,mod)%mod\r\n return dp[-1]\r\n\r\n\r\nprint(main())", "def main():\n from math import factorial as f\n n, res = 0, 1\n for _ in range(int(input())):\n m = int(input())\n res = res * f(n + m - 1) // f(n) // f(m - 1) % 1000000007\n n += m\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "ans=1\r\nprev=0\r\nM=10**9+7\r\nfor _ in range(int(input())):\r\n x=int(input())\r\n prev+=x\r\n if(_==0):\r\n continue\r\n a=1\r\n for i in range(1,x):\r\n a=a*(prev-i)//(i)\r\n ans=(ans*a)%M \r\nprint(ans)\r\n", "MOD = 1000000007\r\nfact = [1] * 1001\r\nfor i in range(1,1001):\r\n fact[i] = fact[i-1]*i\r\n fact[i]%=MOD\r\ndef comb(n,r):\r\n return (fact[n] * pow(fact[n-r],MOD-2,MOD) * pow(fact[r],MOD-2,MOD))%MOD\r\nN = int(input())\r\nList = []\r\nfor i in range(N):\r\n List.append(int(input()))\r\ndp = [1] * (N+1)\r\ncurr = 0\r\nAns = 1\r\nfor i in range(1,N+1):\r\n Ans = Ans * comb(curr + List[i-1] - 1, List[i-1] - 1)\r\n Ans %= MOD\r\n curr += List[i-1]\r\nprint(Ans)\r\n", "\n# coding: utf-8\n\n# In[6]:\n\n\nmatrix = [[0 for x in range(1001)] for y in range(1001)]\nmod = 1000000007\n\ndef pascal():\n matrix[0][0]=1;\n for i in range(1001):\n for j in range(1001):\n if j==0 or j==i:\n matrix[i][j]=1\n else:\n matrix[i][j] = (matrix[i-1][j-1]+matrix[i-1][j])%mod\n\na = int(input())\nb = []\nfor i in range(a):\n b.append(int(input()))\npascal()\nr = 1\ns = b[0]\nfor i in range(1,a):\n r = (r*matrix[s + b[i]-1][b[i]-1])%mod\n s += b[i]\nprint(r)\n\n", "MOD = 10 ** 9 + 7\r\ndef fact(n):\r\n factor = 1\r\n if n == 0:\r\n return 1\r\n for i in range(1, n + 1):\r\n factor = (factor * i)\r\n return factor\r\nmass = [] \r\nn = int(input())\r\nfor i in range(n):\r\n mass.append(int(input()))\r\nres = 1\r\nsumm = 0\r\nfor i in range(n):\r\n summ += mass[i]\r\n res = (res * fact(summ - 1) // (fact(mass[i] - 1)\r\n * fact(summ - mass[i]))) % MOD\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def f(a,b):\r\n p = 1\r\n while a!=b:\r\n p = (p*a)%z\r\n a -= 1\r\n return p\r\ndef modinv(a,m):\r\n p = 1\r\n while m!=0:\r\n if m%2:\r\n p = (p*a)%z\r\n m -= 1\r\n else:\r\n a = (a*a)%z\r\n m //= 2\r\n return p\r\nk = int(input())\r\ns = 0\r\nans = 1\r\nz = 1000000007\r\nfor i in range(k):\r\n c = int(input())\r\n if i>0:\r\n ans = (ans*f(s+c-1,c-1)*modinv(f(s,0),z-2))%z\r\n s += c\r\nprint(ans)", "from sys import stdin\r\nfrom collections import deque\r\nmod = 10**9 + 7\r\nimport sys\r\n# sys.setrecursionlimit(10**6)\r\nfrom queue import PriorityQueue\r\n# def rl():\r\n# return [int(w) for w in stdin.readline().split()]\r\nfrom bisect import bisect_right\r\nfrom bisect import bisect_left\r\nfrom collections import defaultdict\r\nfrom math import sqrt,factorial,gcd,log2,inf,ceil\r\n# map(int,input().split())\r\n# # l = list(map(int,input().split()))\r\n# from itertools import permutations\r\nimport heapq\r\n# input = lambda: sys.stdin.readline().rstrip()\r\ninput = lambda : sys.stdin.readline().rstrip()\r\nfrom sys import stdin, stdout\r\nfrom heapq import heapify, heappush, heappop\r\nfrom itertools import permutations\r\nfrom math import factorial as f\r\n\r\ndef ncr(x, y):\r\n return f(x) // (f(y) * f(x - y))\r\n\r\nn = int(input())\r\n\r\nans = 1\r\nsm = 0\r\nfor _ in range(n):\r\n x = int(input())\r\n ans = (ans*ncr(sm+x-1,x-1))%mod\r\n sm+=x\r\n\r\nprint(ans)", "k = int(input())\nres, mod, last = 1, 10**9 + 7, int(input())\ncomb = [[0]*1001 for _ in range(1001)]\ncomb[0][0] = 1\nfor i in range(1, 1001):\n comb[i][0] = 1\n for j in range(1, i+1):\n comb[i][j] = (comb[i-1][j] + comb[i-1][j-1]) % mod\nfor _ in range(k-1):\n to_place = int(input())\n res = (res * comb[last+to_place-1][to_place-1]) % mod\n last += to_place\nprint(res)\n", "MOD = 10**9 + 7\r\nN = 1010\r\nf = [1 for _ in range(N)]\r\nfor i in range(1, N): f[i] = (f[i - 1] * i) % MOD\r\ninv = [pow(f[i], MOD - 2, MOD) for i in range(N)]\r\ndef C(n, k):\r\n\tif n == 0 or k > n: return 0\r\n\treturn (f[n] * ((inv[k] * inv[n - k]) % MOD)) % MOD\r\n\r\nn = int(input())\r\ntot = int(input())\r\nret = 1\r\nfor i in range(1, n):\r\n\tx = int(input())\r\n\ttmp = C(tot + x - 1, x - 1)\r\n\tret = (ret * tmp) % MOD\r\n\ttot += x\r\nprint(ret)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import comb\r\n\r\nM = 1000000007\r\nn = int(input())\r\ns = int(input())\r\nc = 1\r\nfor i in range(1, n):\r\n a = int(input())\r\n s += a\r\n c = c * comb(s-1, a-1) % M\r\n\r\nprint(c)", "# coding=utf-8\n\ndef com(lo, hi):\n loo = 1\n for i in range(1, lo + 1):\n loo *= i\n hii = 1\n for i in range(hi, hi - lo, -1):\n hii *= i\n return hii // loo\n\n\nn = int(input())\ndata = [int(input()) for i in range(n)]\n\nans = 1\ntotal = sum(data)\nfor i in range(len(data) - 1, -1, -1):\n ans *= com(data[i] - 1, total - 1)\n total -= data[i]\n\nprint(ans if ans < 1000000007 else ans % 1000000007)\n", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nM=10**9+7\r\nfact=[1]\r\nfor i in range(1,1005):\r\n fact+=[(fact[-1]*i)%M]\r\ndef ncr(n,r):\r\n num=fact[n]\r\n den=(fact[r]*fact[n-r])%M\r\n ans=(num*pow(den,M-2,M))%M\r\n return ans\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=[nmbr() for _ in range(n)]\r\n dp=[0]*(1+n)\r\n dp[1]=1\r\n spaces=0\r\n sm=a[0]\r\n for i in range(2,n+1):\r\n spaces=sm+a[i-1]-1\r\n dp[i]=(dp[i-1]*(ncr(spaces,a[i-1]-1)))%M\r\n sm+=a[i-1]\r\n print(dp[n]%M)", "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\nMOD = 10**9+7\r\nN = int(input())\r\nA = []\r\nfor _ in range(N):\r\n A.append(int(input()))\r\n\r\nans,cnt = 1,A[0]\r\nfor a in A[1:]:\r\n r = a-1\r\n t = math.comb(cnt+r, r)\r\n ans *= t%MOD\r\n ans %= MOD\r\n cnt+=a\r\nprint(ans)\r\n\r\n \r\n \r\n\r\n", "from math import comb\r\nk = int(input())\r\nc = [int(input()) for _ in range(k)]\r\np = 10**9 + 7\r\nalready_placed = c[0]\r\ntotal_combs = 1\r\nfor num in c[1:]:\r\n\ttotal_combs *= comb(already_placed + num - 1, num - 1)\r\n\ttotal_combs %= p\r\n\talready_placed += num\r\nprint(total_combs)\r\n", "def binomialCoefficient(n, k): \r\n if(k > n - k): \r\n k = n - k \r\n res = 1\r\n for i in range(k): \r\n res = res * (n - i) \r\n res = res // (i + 1) \r\n return res \r\nk=int(input())\r\nsum=0\r\nans=1 \r\nm=1000000007\r\nfor i in range(k):\r\n a=int(input())\r\n ans=(ans%m)*(binomialCoefficient(sum+a-1,a-1))%m \r\n sum+=a \r\nprint(ans) \r\n \r\n ", "def fact(n):\r\n r = 1\r\n for i in range(1, n + 1):\r\n r *= i\r\n return r\r\n\r\n\r\n\r\nn = int(input())\r\nc = [int(input()) for i in range(n)]\r\nr = 1\r\nu = c[0] - 1\r\nd = 0\r\n\r\nfor i in range(1, n):\r\n u += c[i]\r\n d += c[i-1]\r\n r *= fact(u) // fact(d) // fact(c[i] - 1)\r\n\r\nprint(r % 1000000007)", "k = int(input())\r\ncolnum = []\r\nfor t in range(k):\r\n a = int(input())\r\n colnum.append(a)\r\ndef fact(m,n):\r\n sumnum =1\r\n for i in range(m,n+1):\r\n sumnum*=i\r\n return sumnum\r\nm = colnum[0]+1\r\nansw = 1\r\nfor i in range(1,k):\r\n n = m+colnum[i]-2\r\n answ *= fact(m,n)//fact(1,colnum[i]-1)\r\n answ = answ%(10**9+7)\r\n m+=colnum[i]\r\nprint(answ%(10**9+7))\r\n\r\n", "MOD = int(1e9+7)\r\n\r\ndef nCr(n, r):\r\n if 2 * r > n:\r\n r = n - r\r\n res = 1\r\n for i in range(r):\r\n res = res * (n-i) // (i+1)\r\n return res\r\n \r\nk = int(input())\r\nn2 = int(input())\r\nres = 1\r\nfor i in range(k-1):\r\n n1 = n2\r\n n2 += int(input())\r\n res = res * nCr(n2 - 1, n1) % MOD\r\nprint(res)\r\n", "c = []\r\nk = int(input())\r\nfor i in range(k):\r\n c.append(int(input()))\r\n\r\nmaxN = 1010\r\nbinomials = [[1], [1, 1]]\r\nfor i in range(2, maxN):\r\n binomials.append([1])\r\n for j in range(1, i):\r\n binomials[i].append((binomials[i - 1][j - 1] + binomials[i - 1][j]) % 1000000007)\r\n binomials[i].append(1)\r\n\r\ndp = [1] * k\r\nfor i in range(1, k):\r\n dp[i] = (dp[i - 1] * binomials[sum(c[:i + 1]) - 1][c[i] - 1]) % 1000000007\r\n\r\nprint(dp[k - 1])\r\n", "def C(n, k):\n\treturn (math.factorial(n) // (math.factorial(k) * math.factorial(n - k)))\n\n\nimport sys\nimport math\nsys.setrecursionlimit(5000)\nn = int(input())\narr = [0]\nfor i in range(n):\n\tarr.append(int(input()))\nsum = [0] * (n + 1)\nans = 1;\nfor i in range(1, n + 1):\n\tsum[i] = sum[i - 1] + arr[i - 1]\nfor i in range (1, n + 1):\n\tif(arr[i] > 1):\n\t\tans *= C(sum[i] + arr[i] - 1, sum[i])\nprint(ans % 1000000007)", "ans,s=1,0\r\nfor _ in range(int(input())):\r\n\tn=int(input())\r\n\ts+=n\r\n\tif s==n:continue\r\n\tk=1\r\n\tfor i in range(1,n):\r\n\t\tk=k*(s-i)//i\r\n\tans=(ans*k)%(10**9+7)\r\nprint(ans)", "from math import *\r\n\r\nn = int(input())\r\n\r\nk1 = int(input())\r\nlast_vars = 1\r\nnum_pos = k1\r\nfor i in range(n-1):\r\n\tki = int(input())\r\n\tnum_pos += ki\r\n\tki -= 1\r\n\tCnk = 1\r\n\tfor k in range(num_pos-ki,num_pos):\r\n\t\tCnk *= k\r\n\tCnk //= factorial(ki)\r\n\tlast_vars *= Cnk\r\nprint(last_vars%1000000007)", "#!/usr/bin/env python3\r\n\r\np = int(1e9+7)\r\nN = 1000\r\nfact= [1]*(N+1)\r\nfor i in range(2,N+1):\r\n fact[i]=(fact[i-1]*i)%p\r\n\r\ndef bpow(a,b,p):\r\n c = 1\r\n while b>0:\r\n if b&1: c=(c*a)%p\r\n a = (a*a)%p\r\n b = b>>1\r\n return c\r\n\r\ndef inv(a,p):\r\n return bpow(a,p-2,p)\r\n\r\ndef binomial(n,k):\r\n global fact,p\r\n return fact[n]*inv(fact[k],p)%p*inv(fact[n-k],p)%p\r\n\r\ndef f(l,p):\r\n c = 1\r\n n = l[0]\r\n for i in range(1,len(l)):\r\n n += l[i]\r\n c = c * binomial(n-1,l[i]-1) % p\r\n return c\r\n \r\nl = [int(input()) for _ in range(int(input()))]\r\nprint(f(l,p))\r\n", "mx=1001\nmod=1000000007\nnCr=[[0 for i in range(mx)] for j in range(mx)]\nnCr[0][0]=1\nfor i in range(1,mx):\n nCr[i][0]=1\n for j in range(1,mx):\n nCr[i][j]=nCr[i-1][j-1]+nCr[i-1][j]\n\nn=int(input())\nl=[]\nfor i in range(n):\n l.append(int(input()))\nres=1\ntotal=0\nfor i in range(n):\n res=(res*nCr[total+l[i]-1][l[i]-1])%mod\n total+=l[i]\nprint(res)", "import math\r\n\r\ndef read_data():\r\n k = int(input())\r\n ns = [int(input()) for i in range(k)]\r\n return k, ns\r\n\r\ndef solve(k, ns):\r\n n = sum(ns)\r\n free_pos = n\r\n result = 1\r\n mod = 10**9 + 7\r\n for ni in reversed(ns):\r\n tmp = math.factorial(free_pos - 1)//math.factorial(free_pos - ni)\r\n tmp //= math.factorial(ni - 1)\r\n tmp %= mod\r\n result *= tmp\r\n result %= mod\r\n free_pos -= ni\r\n return result\r\n\r\nk, ns = read_data()\r\nprint(solve(k, ns))", "MAXN = 1010\r\nmod = 1000000007;\r\n\r\ndef binomialCoefficient():\r\n C = [[0 for x in range(MAXN)] for x in range(MAXN)]\r\n\r\n for i in range(MAXN):\r\n for j in range(i+1):\r\n\r\n if j==0 or j==i:\r\n C[i][j] = 1\r\n \r\n else:\r\n C[i][j] = C[i-1][j-1] + C[i-1][j] % mod\r\n\r\n return C\r\n\r\nC = binomialCoefficient()\r\n\r\nk = int(input())\r\ncolors = [0]*k\r\nfor i in range(k):\r\n colors[i] = int(input())\r\n\r\nres = 1\r\ntotal = 0\r\n\r\nfor i in range(k):\r\n res = (res * C[total+colors[i]-1][colors[i]-1])%mod\r\n total += colors[i]\r\n\r\nprint(res)\r\n\r\n \r\n", "k = int(input())\ncolors = []\nfor i in range(k) :\n colors.append(int(input()))\n\nans = 1\naccum = colors[0]\nfor i in range(1, k):\n for j in range(1, colors[i]):\n ans *= (accum + j)\n for j in range(1, colors[i]):\n ans //= j\n accum += colors[i]\n\nprint(ans % 1000000007)\n", "from math import factorial\r\nk,s,res=int(input()),int(input()),1\r\nfor i in range(1,k):\r\n\tx=int(input())\r\n\ts+=x\r\n\tres=(res*factorial(s-1)//factorial(x-1)//factorial(s-x))%1000000007\r\nprint(res)", "from math import factorial\nk = int(input())\nans = 1\nmod = 10 ** 9 + 7\nn = 0\nfor i in range(k):\n x = int(input())\n ans = (ans * (factorial(n + x - 1)) // (factorial(x - 1) * factorial(n))) % mod\n n += x\nprint(ans)", "n = 1000\nmod = 10**9 + 7\npascal = [[1]]\nfor r in range(1, n+1):\n previous_row = pascal[-1]\n row = [1]\n for c in range(1, r):\n row.append((previous_row[c-1] + previous_row[c]) % mod)\n row.append(1)\n pascal.append(row)\n\nk = int(input())\nlength = int(input())\nproduct = 1\nfor i in range(1, k):\n curr = int(input())\n product *= pascal[length + curr - 1][length]\n product %= mod\n length += curr\nprint(product)\n", "import sys\r\ninput = sys.stdin.readline\r\ndef mod_exp(a:int,b:int,mod:int)->int:\r\n a = a%mod\r\n res = 1\r\n \r\n while b > 0:\r\n if b&1:\r\n res = (res*a)%mod\r\n \r\n a = (a*a)%mod\r\n b >>= 1\r\n \r\n return res\r\n\r\ndef modprimeinverse(a:int,mod:int)->int:\r\n return mod_exp(a,mod-2,mod)\r\n\r\ndef comb(x:int,y:int,mod:int)->int:\r\n if x < y:\r\n return 0\r\n else:\r\n return ((fact[x] * invfact[y])%mod * invfact[x-y])%mod\r\n\r\nN = 200007\r\nfact = [1] + [0]*N\r\ninvfact = [1] + [0]*N\r\nMOD = int(1e9+7)\r\n\r\nfor i in range(1,N):\r\n fact[i] = (i*fact[i-1])%MOD\r\n invfact[i] = modprimeinverse(fact[i], MOD)\r\n\r\nn = int(input())\r\nsums = 0\r\nres = 1\r\n\r\nfor i in range(n):\r\n a = int(input())\r\n \r\n sums += a\r\n res = (res * comb(sums-1,a-1, MOD))%MOD\r\n \r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nMAX = 1010\r\nMOD = 10**9+7\r\nfact = [0]*MAX #fact[i]: i!\r\ninv = [0]*MAX #inv[i]: iの逆元\r\nfinv = [0]*MAX #finv[i]: i!の逆元\r\nfact[0] = 1\r\nfact[1] = 1\r\nfinv[0] = 1\r\nfinv[1] = 1\r\ninv[1] = 1\r\n \r\nfor i in range(2, MAX):\r\n fact[i] = fact[i-1]*i%MOD\r\n inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD\r\n finv[i] = finv[i-1]*inv[i]%MOD\r\n\r\ndef C(n, r):\r\n if n<r:\r\n return 0\r\n if n<0 or r<0:\r\n return 0\r\n return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD\r\n\r\nk = int(input())\r\nc = [int(input()) for _ in range(k)]\r\ns = sum(c)\r\nacc = 0\r\np = [0]*(s+1)\r\np[0] = 1\r\n\r\nfor ci in c:\r\n np = [0]*(s+1)\r\n p_acc = p[0]\r\n \r\n for i in range(1, s+1):\r\n np[i] = (p_acc*C(i-acc-1, ci-1))%MOD\r\n p_acc += p[i]\r\n \r\n acc += ci\r\n p = np\r\n \r\nprint(p[s])", "n = int(input())\ncnt = []\nfor i in range(n):\n cnt.append(int(input()))\n\ndp = [1]\nlength = [cnt[0]]\nMOD = int(1000000007)\n\ndef C(n, k):\n assert(n >= k)\n res = 1\n for i in range(n - k + 1, n + 1):\n res *= i\n for i in range(2, k + 1):\n res //= i\n \n \"\"\"DEBUG\"\"\"\n #import math as m\n #assert(res == m.factorial(n) // m.factorial(k) // m.factorial(n - k))\n \"\"\"\"/DEBUG\"\"\"\n\n return res % MOD\n \nfor i in range(1, n):\n length.append(length[i - 1] + cnt[i])\n dp.append((dp[i - 1] * C(length[i] - 1, cnt[i] - 1)) % MOD)\n\nprint(dp[n - 1])\n", "from math import sqrt,gcd,ceil,floor,log,factorial\r\nfrom itertools import permutations,combinations\r\nfrom collections import Counter, defaultdict\r\n\r\ndef ncr(n, r):\r\n p = 1\r\n k = 1\r\n \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 \r\n # gcd of p, k\r\n m = gcd(p, k)\r\n\r\n p //= m\r\n k //= m\r\n \r\n n -= 1\r\n r -= 1\r\n\r\n else:\r\n p = 1\r\n \r\n \r\n return p\r\n \r\n \r\nmod=10**9+7\r\nk=int(input())\r\nres=[0]\r\npre=[0]*(k+1)\r\ndp=[0]+[1]+[0]*(k-1)\r\nfor _ in range(k):\r\n res.append(int(input()))\r\n \r\nfor i in range(1,k+1):\r\n pre[i]=res[i]+pre[i-1]\r\n \r\nfor i in range(2,k+1):\r\n if res[i]==1:\r\n dp[i]=dp[i-1]%mod\r\n \r\n else:\r\n dp[i]=(dp[i-1]*(ncr(pre[i]-1,res[i]-1)%mod))%mod\r\n \r\nprint(dp[k]%mod)\r\n \r\n", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nfrom io import BytesIO, IOBase\r\nimport sys\r\nfrom heapq import heappush,heappop\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,Counter,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input().rstrip()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('0')\r\n\r\nfile = 1\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\n\r\n\r\n\r\n\r\ndef solve():\r\n\r\n\r\n # for _ in range(ii()):\r\n N = 10001\r\n invfact = [0]*N\r\n fact = [1]*N\r\n for i in range(1,N):\r\n fact[i] = (fact[i-1]*i)%mod\r\n invfact[-1] = pow(fact[-1],mod-2,mod)\r\n for i in range(N-2,-1,-1):\r\n invfact[i] = ((i+1)*invfact[i+1])%mod\r\n\r\n def nCr(x,y):\r\n if y > x:\r\n return 0\r\n ans = (invfact[x-y]*invfact[y])%mod\r\n ans *= fact[x]\r\n ans %= mod\r\n return ans\r\n\r\n k = ii()\r\n ans = 1\r\n cnt = ii()\r\n for i in range(1,k):\r\n x = ii()\r\n cnt += (x-1)\r\n ans *= nCr(cnt,x-1)\r\n ans %= mod\r\n cnt += 1\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\nif __name__ ==\"__main__\":\r\n\r\n if(file):\r\n\r\n if path.exists('tmp/input.txt'):\r\n sys.stdin=open('tmp/input.txt', 'r')\r\n sys.stdout=open('tmp/output.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()\r\n", "pt = []\r\nfor i in range(1000):\r\n pt.append([0] * (i + 1))\r\n pt[i][0] = pt[i][i] = 1\r\n for j in range(1, i):\r\n pt[i][j] = pt[i - 1][j - 1] + pt[i - 1][j]\r\nk, s, v = int(input()), int(input()), 1\r\nfor i in range(1, k):\r\n c = int(input())\r\n v = v * pt[s + c - 1][c - 1] % 1000000007\r\n s += c\r\nprint(v)", "from sys import stdin\r\nc = [[0]*1002 for _ in range(0,1002)]\r\nMOD = int(1e9+7)\r\n\r\nfor i in range(0,1002):\r\n c[i][0] = c[i][i] = 1\r\n for j in range(0,i):\r\n c[i][j] = (c[i-1][j-1] + c[i-1][j])%MOD\r\n\r\nr = map(int,stdin.read().split())\r\n\r\nn = next(r)\r\nans = 1\r\nsum = 0\r\n\r\nfor _ in range(0,n):\r\n x = next(r)\r\n ans = (ans * c[sum+x-1][sum])%MOD\r\n sum += x\r\n\r\nprint(ans)", "from math import factorial\r\nn,ans,s = int(input()),1,0\r\nfor i in range(n) :\r\n a = int(input())\r\n ans=(ans*factorial(s+a-1)//factorial(s)//factorial(a-1))%1000000007\r\n s+=a\r\nprint(ans)\r\n\r\n\r\n#copied...\r\n", "from math import factorial as f\r\nn, ans, sm, mod = map(int, input().split() + [1, 0, 1000000007])\r\ndef ncr(x, y):\r\n\treturn f(x) // (f(y) * f(x - y))\r\nfor _ in range(n):\r\n\tx = int(input())\r\n\tans = (ans * ncr(sm + x - 1, x - 1)) % mod\r\n\tsm += x\r\nprint(ans)", "k = int(input())\r\na = [int(input()) for i in range(k)]\r\nd = []\r\nfor i in range(2001):\r\n d.append([0] * 2001)\r\n d[i][0] = 1\r\n for j in range(1, i + 1):\r\n d[i][j] = (d[i - 1][j] + d[i - 1][j - 1]) % 1000000007\r\npre = 0\r\nans = 1\r\nfor x in a:\r\n ans = ans * d[pre + x - 1][x - 1] % 1000000007\r\n pre += x\r\nprint(ans)\r\n# 1 2 3 4\r\n# 12\r\n# 2212\r\n# 2122\r\n# 1222\r\n#\r\n# 112", "from math import factorial\r\nn = int(input())\r\nans = 1\r\ns = 0\r\nmod = (10**9) + 7\r\nfor i in range(n):\r\n a = int(input())\r\n ans *= factorial(s+a-1)//(factorial(s) * factorial(a-1))\r\n ans = ans%mod\r\n s += a\r\nprint(ans)", "fac = [1] * 1001\r\nfor i in range(1, 1001):\r\n fac[i] = fac[i - 1] * i\r\nk = int(input())\r\ntmp = 0\r\nres = 1\r\nfor i in range(k):\r\n tmp2 = int(input())\r\n res *= (fac[tmp2 + tmp - 1] // fac[tmp2 - 1] // fac[tmp]) % (10 ** 9 + 7)\r\n tmp += tmp2\r\nprint(res % (10 ** 9 + 7))", "t = 10**9 + 7\r\ncomb = [[0 for i in range(1001)]for i in range(1001)]\r\ncomb[0][0] = 1\r\nfor i in range(1, 1001):\r\n comb[i][0] = 1\r\n for j in range(1, i + 1):\r\n comb[i][j] = (comb[i - 1][j] + comb[i - 1][j - 1]) % t\r\nans = 1\r\nf = 0\r\nfor _ in range(int(input())):\r\n c = int(input())\r\n ans = (ans * comb[f + c - 1][c - 1]) % t\r\n f += c\r\n\r\nprint(ans % t)", "import sys\r\ninput=sys.stdin.readline\r\n\r\np=(10**9)+7\r\npri=p\r\nfac=[1 for i in range((10**6)+1)]\r\nfor i in range(2,len(fac)):\r\n fac[i]=(fac[i-1]*(i%pri))%pri\r\ndef modi(x):\r\n return (pow(x,p-2,p))%p;\r\n \r\ndef ncr(n,r):\r\n x=(fac[n]*((modi(fac[r])%p)*(modi(fac[n-r])%p))%p)%p\r\n return x;\r\na=int(input())\r\nans=[0 for i in range(a+1)]\r\n\r\nfor i in range(a):\r\n s=int(input())\r\n ans[i+1]=s\r\npref=[0]\r\n\r\nfor i in range(1,a+1):\r\n pref.append(pref[-1]+ans[i])\r\n\r\ntotal=1\r\nfor i in range(2,len(ans)):\r\n spaces=pref[i-1]+1\r\n items=ans[i]-1\r\n \r\n x=ncr(spaces+items-1,spaces-1)\r\n x%=pri\r\n total=(total*x)%pri\r\nprint(total)\r\n \r\n \r\n \r\n", "MOD = 1000000007\r\nk = int(input())\r\nc = [int(input()) for i in range(k)]\r\ntotal_c = sum(c)\r\ncomb = [[0]*(max(c)+1) for i in range(total_c+1)]\r\ncomb[0][0] = 1\r\nfor i in range(1,len(comb)):\r\n comb[i][0] = 1\r\n for j in range(1,len(comb[0])):\r\n comb[i][j] = comb[i-1][j-1] + comb[i-1][j]\r\n comb[i][j] %= MOD\r\nw = [0]*(total_c+1)\r\nw[0] = 1\r\nfor color in range(k):\r\n new_w = [0]*len(w)\r\n for n in range(len(new_w)):\r\n new_w[n] = w[n]\r\n for i in range(c[color]):\r\n if n-i-1 < 0: break\r\n new_w[n] += comb[n-1][i]*w[n-i-1]\r\n new_w[n] %= MOD\r\n w = new_w\r\nprint(w[total_c])", "k = int(input())\r\na = [int(input()) for i in range(k)]\r\na.reverse()\r\nn = sum(a)\r\nmod = 1000000007\r\nN1 = n + 1\r\nfac = [1]\r\nfor nn in range(1, N1):\r\n fac.append(nn * fac[-1] % mod)\r\nfac_inv = [pow(fac[-1], mod - 2, mod)]\r\nfor nn in range(N1 - 1, 0, -1):\r\n fac_inv.append(fac_inv[-1] * nn % mod)\r\nfac_inv.reverse()\r\ncurr = 1\r\nfor i in a:\r\n curr = curr * fac[n - 1] * fac_inv[i - 1] * fac_inv[n - i] % mod\r\n n -= i\r\nprint(curr)", "n_colors = int(input())\r\n\r\nresult = 1\r\nlength = int(input())\r\nfor _ in range(1, n_colors):\r\n n = int(input())\r\n length += n\r\n\r\n k = 1\r\n for i in range(1, n):\r\n k = k * (length - i) // i\r\n result = (result * k) % (10 ** 9 + 7)\r\n\r\nprint(result)\r\n", "\r\nMOD = int(1e9 + 7)\r\n\r\ndp = [[0] * 1001 for _ in range(1001)]\r\n\r\nfor i in range(len(dp)):\r\n dp[i][1] = 1\r\n\r\nfor i in range(len(dp)):\r\n for j in range(2, i+1):\r\n dp[i][j] = (dp[i-1][j] + dp[i-1][j-1]) % MOD\r\n\r\n\r\nn = int(input())\r\nelapsed = 0\r\nways = 1\r\n\r\nfor _ in range(n):\r\n i = int(input())\r\n elapsed += i\r\n ways *= dp[elapsed][i]\r\n\r\nprint(ways % MOD)\r\n", "MOD = 1000000007\r\nMAX_BALLS = 1000\r\n\r\ndef initFactors():\r\n\tfactors = [1]\r\n\tfor i in range(1, MAX_BALLS + 1):\r\n\t\tlast_fact = factors[-1]\r\n\t\tfactors.append(last_fact * i)\r\n\treturn factors\r\n\r\nn_colors = int(input())\r\nfactors = initFactors()\r\nballs = []\r\nfor i in range(n_colors):\r\n\tballs.append(int(input()))\r\n\r\nres = 1\r\nl = balls[0]\r\nfor i in range(1, n_colors):\r\n\tres *= ((factors[l + balls[i] - 1] // (factors[l] * factors[balls[i] - 1])) % MOD)\r\n\tl += balls[i]\r\nprint(res % MOD)", "# Python3 function to \r\n# calculate nCr % p \r\ndef ncr(n, r, p): \r\n\t# initialize numerator \r\n\t# and denominator \r\n\tnum = den = 1\r\n\tfor i in range(r): \r\n\t\tnum = (num * (n - i)) % p \r\n\t\tden = (den * (i + 1)) % p \r\n\treturn (num * pow(den, \r\n\t\t\tp - 2, p)) % p \r\n\r\nk=int(input())\r\np=10**9+7\r\nans=1\r\ntotal=0\r\nfor i in range(k):\r\n c=int(input())\r\n ans*=ncr(total+c-1,total,p)\r\n ans%=p\r\n total+=c\r\nprint(ans) ", "pc = c = 0\r\nres = 1\r\nfor i in range(int(input())):\r\n pc += c\r\n c = int(input())\r\n for k in range(1, c):\r\n res = res * (pc + c - k) // k\r\n res %= 1000000007\r\nprint(res)", "t = int(input())\r\nc = 1\r\ns = int(input())\r\nfor _ in range(t-1):\r\n n = int(input())\r\n s += n\r\n\r\n k = 1\r\n for i in range(1, n):\r\n k = k*(s-i)//i\r\n c = (c*k) % (10**9+7)\r\nprint(c)\r\n", "numeroColores=int(input())\r\nlistaNumColores=[]\r\nfor i in range (0, numeroColores):\r\n listaNumColores.append(int(input()))\r\nconclusion= 1\r\nanterior= listaNumColores[0]\r\n\r\nfor i, numeroColores in enumerate(listaNumColores[1:]):\r\n#for i in range(0,numeroColores-1):\r\n anterior+= 1\r\n #reset\r\n conteo1= 1\r\n conteo2= 1\r\n for j in range(numeroColores - 1):\r\n conclusion= conclusion* anterior\r\n anterior+= 1\r\n conteo1= conteo1* conteo2\r\n conteo2+= 1\r\n conclusion= conclusion// conteo1\r\nif conclusion> 1000000007:\r\n #Aplicar modulo\r\n conclusion = conclusion% 1000000007\r\nprint(conclusion)", "def fact(x):\n res = 1\n while x > 0:\n res *= x\n x -= 1\n return res\n\nk = int(input())\nlst=[]\nfor i in range(0, k):\n x = int(input())\n lst.append(x)\n\nl = lst[0]\nans = 1\nfor i in range(1, k):\n l += lst[i] - 1\n ans *= fact(l) // (fact(l - lst[i] + 1) * fact(lst[i] - 1))\n l += 1\nprint(ans % (1000 * 1000 * 1000 + 7))\n", "k = int(input())\nMOD = 10**9 + 7\nans = 1\nc = [0] * k\ntot = 0\nfor i in range(k):\n c[i] = int(input())\n tot += c[i]\n\ncombi = [[0] * (tot+1) for _ in range(tot+1)]\nfor i in range(tot+1):\n combi[i][0] = combi[i][i] = 1\n for j in range(1,i):\n combi[i][j] = (tmp := combi[i-1][j] + combi[i-1][j-1]) % MOD\n\nans = 1\ntot = 0\nfor i in range(k):\n tot += c[i]\n ans *= combi[tot-1][c[i]-1]\n ans %= MOD\n\nprint(ans)\n\n\t \t \t\t\t \t\t \t \t \t \t\t", "#not my solution saw the editorial ?>?\r\ndef color(arr):\r\n s=0\r\n ans=1\r\n for i in arr:\r\n temp=1\r\n s+=i\r\n if s==i:\r\n continue\r\n for placement in range(1,i):\r\n temp=(temp*(s-placement))//placement\r\n ans*=temp%(10**9+7)\r\n return ans%(10**9+7)\r\n\r\nblanck=[]\r\nfor i in range(int(input())):\r\n blanck.append(int(input()))\r\n\r\nprint(color(blanck))", "INF = 1000000007\r\nk = int(input())\r\nks = []\r\nfor i in range(k):\r\n ks.append(int(input()))\r\nfacts = [1, 1]\r\nfor i in range(2, 1000):\r\n facts.append(facts[i - 1] * i)\r\ncount = 1\r\nsumm = ks[0]\r\nfor i in range(1, k):\r\n count *= facts[ks[i] - 1 + summ] // facts[summ] // facts[ks[i] - 1]\r\n count %= INF\r\n summ += ks[i]\r\nprint(count % INF)", "#! /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\nimport math\nimport fractions\n\nmod = 1000000007\nmaxn = 1010\n\nn = int(input())\n\ncomb = [[0 for j in range(maxn)] for i in range(maxn)]\n\nfor i in range(maxn):\n comb[i][0] = 1\n for j in range(1, maxn):\n comb[i][j] = (comb[i-1][j] + comb[i-1][j-1]) % mod\n\ncolors = []\nfor i in range(n):\n colors.append(int(input()))\n\nres = 1\ntotal = 0\n\nfor i in range(n):\n res = (res * comb[total+colors[i]-1][colors[i]-1]) % mod\n total += colors[i]\n\nprint(res) \n", "# Author: Akash Kumar\r\n\r\nfrom math import comb\r\n\r\n# Initialization\r\nmod= int(1e9 + 7)\r\nk =int(input())\r\ntot_num_balls = int(input())\r\n\r\nres = 1\r\nfor i in range(1, k):\r\n c = int(input())\r\n res = res*comb(tot_num_balls+c-1, c-1) % mod\r\n tot_num_balls += c\r\n\r\nprint(res)", "from math import factorial\r\n\r\nn = int(input())\r\n\r\nans = 1\r\ns = 0\r\nfor i in range(n) :\r\n a = int(input())\r\n ans*=factorial(s+a-1)//factorial(s)//factorial(a-1)\r\n ans%=1000000007\r\n s+=a\r\n\r\nprint(ans)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\nmod = 10**9 + 7\r\n\r\n\r\ndef main():\r\n k = int(input())\r\n a = [int(input()) for x in range(k)]\r\n\r\n N = 1000\r\n t = [[0 for j in range(N + 1)] for _ in range(N + 1)]\r\n t[0][0] = 1\r\n\r\n for i in range(1, N):\r\n t[i][0] = 1\r\n for j in range(1, N):\r\n t[i][j] = (t[i - 1][j - 1] + t[i - 1][j]) % mod\r\n\r\n n = sum(a)\r\n s = 0\r\n ans = 1\r\n for x in reversed(a):\r\n ans = ans * t[max(0, n - s - 1)][x - 1] % mod\r\n s += x\r\n\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "# Thank God that I'm not you.\r\n\r\nimport bisect\r\nfrom collections import Counter, deque\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom types import GeneratorType;\r\n\r\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\ndef primeFactors(n):\r\n counter = Counter();\r\n while n % 2 == 0:\r\n counter[2] += 1\r\n n = n / 2\r\n\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n\r\n while n % i == 0:\r\n counter[i] += 1;\r\n n = n / i\r\n\r\n if (n > 2):\r\n counter[n] += 1\r\n\r\n return counter\r\n\r\n\r\ninput = sys.stdin.readline;\r\n\r\n\r\nmod = (10**9 + 7)\r\nresult = []\r\n\r\n\r\n\r\ndef modInverse(a):\r\n return pow(a, mod - 2, mod);\r\n\r\n\r\nfactorials, factorialsInverse = [1], [1];\r\n\r\ncurrentMul = 1;\r\nfor i in range(1, 1005):\r\n currentMul *= i;\r\n modInv = modInverse(currentMul);\r\n currentMul %= mod;\r\n factorials.append(currentMul);\r\n factorialsInverse.append(modInv % mod);\r\n\r\n\r\ndef nCr(n, r):\r\n numerator = factorials[n];\r\n denominator = (factorials[r] * factorials[n - r]) % mod;\r\n return (numerator * modInverse(denominator)) % mod;\r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\narray = []\r\n\r\nfor i in range(n):\r\n array.append(int(input()));\r\n\r\nprefixSum = []\r\ncurrentSum = 0;\r\nfor num in array:\r\n currentSum += num;\r\n prefixSum.append(currentSum);\r\n\r\nans = 1;\r\nfor i in reversed(range(n)):\r\n num, currentSum = array[i], prefixSum[i]\r\n ans *= nCr(currentSum - 1, num - 1)\r\n ans %= mod;\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "k = int(input())\r\nc = [int(input()) for i in range(k)]\r\nmod, ans, s= 1000000007, 1, 0\r\nri = [0, 1]\r\nfor i in range(2, 1000010):\r\n ri.append((mod//i) * (mod-ri[mod%i])%mod);\r\nfor p in c:\r\n for i in range(1, p):\r\n ans = ans * (s + i) * ri[i] % mod\r\n s += p\r\nprint(ans)\r\n\r\n ", "def main():\r\n MOD = int(1e9 + 7)\r\n \r\n def power(x, p):\r\n if p == 0:\r\n return 1\r\n if p & 1:\r\n return x * power(x, p - 1) % MOD\r\n return power(x * x % MOD, p >> 1) % MOD\r\n \r\n \r\n \r\n import sys\r\n \r\n k, *c = [int(i) for i in sys.stdin.read().split()]\r\n \r\n inv_factorial = [1] * 1001\r\n factorial = [1] * 1001\r\n for i in range(2, 1001):\r\n factorial[i] = factorial[i - 1] * i % MOD\r\n inv_factorial[i] = power(factorial[i], MOD - 2)\r\n \r\n result = 1\r\n size = 0\r\n for i in c:\r\n size += i\r\n m = factorial[size - 1] * inv_factorial[i - 1] % MOD * inv_factorial[size - i] % MOD\r\n result = result * m % MOD\r\n \r\n print(result)\r\n \r\n \r\n \r\nmain()\r\n", "mod = 1_000_000_007\n\ndef C(n, r):\n if r > n - r:\n r = n - r\n\n val = 1\n for i in range(1, r + 1):\n val *= n - r + i\n val //= i\n return val % mod\n\nn = int(input())\na = []\nfor _ in range(n):\n a.append(int(input()))\n\nz = [0 for _ in range(n)]\ncum = 0\nval = 1\nfor i in range(n):\n cum += a[i]\n val *= C(cum - 1, a[i] - 1)\n val %= mod\n\nprint(val)\n", "from sys import stdin\r\nn=int(stdin.readline())\r\nfrom math import factorial as f\r\nlst=[int(stdin.readline()) for _ in range(n)]\r\nsumma=sum(lst)\r\nres=1\r\nfor i,x in enumerate(reversed(lst)):\r\n x-=1\r\n summa-=1\r\n res*=(f(summa)//(f(summa-x)*f(x)))\r\n res=res%1000000007\r\n summa-=x\r\nprint(res)", "nCr = [[0 for i in range(1001)] for j in range(1001)]\r\nnCr[0][0] = 1\r\nfor i in range(1,1001):\r\n nCr[i][0] = 1\r\n for j in range(1,i+1):\r\n nCr[i][j] = (nCr[i-1][j] + nCr[i-1][j-1]) % 1000000007\r\nn = int(input())\r\ndata = []\r\nfor i in range(n):\r\n data.append(int(input()))\r\nans = 1\r\ntotal = 0\r\nfor i in range(n):\r\n ans = ( ans * nCr[total + data[i] - 1][data[i] - 1] ) % 1000000007\r\n total += data[i]\r\n \r\nprint(int(ans))\r\n ", "from math import factorial\r\nk=int(input())\r\nans,s=1,0\r\nfor i in range(k):\r\n ci=int(input())\r\n ans=(ans*factorial(s+ci-1)//(factorial(ci-1)*factorial(s)))%1000000007\r\n s+=ci\r\nprint(ans)", "# import sys\r\n# sys.stdin = open(\"309_Div2_ProbC.txt\")\r\nn = (int(input()))\r\n\r\nbinomial = [[0 for x in range(1010)] for x in range(1010)]\r\nbinomial[0][0] = 1\r\ni = 1\r\nrow = len(binomial)\r\ncol = len(binomial[0])\r\nwhile i< row:\r\n\tbinomial[i][0] = 1\r\n\ti+=1\r\n\r\nmod = int(1e9+7)\t\r\ni =1\r\nwhile i< row:\r\n\tj=1\r\n\twhile j<col:\r\n\t\tbinomial[i][j] = (binomial[i-1][j-1]+binomial[i-1][j])%mod\r\n\t\tj+=1\r\n\ti+=1\r\n\r\nresult = 1\r\ntotal = 0\r\nfor i in range(n):\r\n\tx = (int(input()))\r\n\tresult = (result * (binomial[total+x-1][x-1]))%mod\r\n\ttotal+=x\r\nprint(result)", "import sys\r\ninput = sys.stdin.readline\r\nn = 1005\r\nmod = int(1e9)+7\r\npre = [[0 for i in range(n)] for j in range(n)]\r\npre[0][0] = 1\r\nfor i in range(1,n):\r\n for j in range(n):\r\n pre[i][j] = pre[i-1][j-1] + pre[i-1][j]\r\n pre[i][j]%=mod\r\nk = int(input())\r\ns = 0\r\nans = 1\r\nfor i in range(k):\r\n c = int(input())\r\n s += c\r\n #print(s,c)\r\n ans *= pre[s-1][c-1]\r\n ans%=mod\r\nprint(ans%mod)\r\n", "k=int(input()) #number of colors\r\nc=[]\r\nfor i in range(0,k):\r\n c.append(int(input())) #Ci\r\n\r\nm=1000000007\r\n\r\nimport math\r\n\r\ntotal=0\r\nsum=1\r\n\r\nfor i in range(0,k):\r\n total=total+c[i]\r\n sum=sum*math.comb(total-1,c[i]-1) % m\r\n \r\nprint(sum)", "import math\r\nMOD = 1000000007\r\nMAXN = 1005\r\n\r\ndef fac(n, k):\r\n res = 1\r\n for i in range(n + 1 - k, n + 1):\r\n res *= i\r\n return res\r\n\r\nk = int(input())\r\nsum = 0\r\nans = 1\r\nfor i in range(0, k):\r\n num = int(input())\r\n sum += num\r\n ans = ans * fac(sum - 1, num - 1) // fac(num - 1, num - 1)\r\nprint (ans % MOD)", "mod = 10 ** 9 + 7\r\nimport math\r\ndef f(n): return math.factorial(n)\r\nk = int(input())\r\nc = [int(input()) for i in range(k)]\r\ns, cnt = 0, 1\r\nfor i in c:\r\n cnt *= f(s + i - 1) // f(i - 1) // f(s)\r\n cnt %= mod\r\n s += i\r\nprint(cnt)", "k = int(input())\r\nnax, m = 1005, 1000000007\r\nc = [[[0, 1][j == 0] for j in range(nax)] for i in range(nax)]\r\nfor i in range(1, nax):\r\n for j in range(1, nax):\r\n c[i][j] = c[i - 1][j] + c[i - 1][j - 1]\r\nans, pref = 1, [-1]\r\nfor i in range(k):\r\n a = int(input())\r\n pref.append(pref[-1] + a)\r\n ans *= c[pref[-1]][a - 1]\r\n ans %= m\r\nprint(ans)", "import math\r\nMOD = 1000000007\r\nMAXN = 1005\r\n\r\ncomb = [([0] * MAXN) for i in range(0, MAXN)]\r\ncomb[0][0] = 1\r\nfor i in range(1, MAXN):\r\n comb[i][0] = 1\r\n for j in range(1, i + 1):\r\n comb[i][j] = comb[i - 1][j] + comb[i - 1][j - 1]\r\n comb[i][j] %= MOD\r\n\r\nk = int(input())\r\nsum = 0\r\nans = 1\r\nfor i in range(0, k):\r\n num = int(input())\r\n sum += num\r\n ans = ans * comb[sum - 1][num - 1] % MOD\r\n\r\nprint (ans)", "def nCr(n, r, p):\r\n \r\n num = den = 1\r\n for i in range(r):\r\n num = (num * (n - i)) % p\r\n den = (den * (i + 1)) % p\r\n return (num * pow(den,\r\n p - 2, p)) % p\r\n\r\nN = 1000000007\r\n\r\np = 0\r\nk = int(input())\r\nball = []\r\nfor i in range(1,k+1):\r\n c = int(input())\r\n for j in range(0,c):\r\n ball.append(i)\r\n \r\n \r\n \r\nans = 1\r\nid = ball.count(1)\r\nfor i in range(2,k+1):\r\n cnt = ball.count(i)\r\n id += cnt\r\n ans = (ans * ((nCr(id - 1,cnt - 1,N))))%N\r\n \r\nprint(int(ans),'\\n')\r\n", "def f(x):\r\n res = 1\r\n while x > 0:\r\n res *= x\r\n x -= 1\r\n return res\r\n\r\nk = int(input())\r\ncolor=[]\r\nfor i in range(0, k):\r\n x = int(input())\r\n color.append(x)\r\n\r\nl = color[0]\r\nans = 1\r\nfor i in range(1, k):\r\n l += color[i] - 1\r\n ans *= f(l) // (f(l - color[i] + 1) * f(color[i] - 1))\r\n l += 1\r\nprint(ans % (1000 * 1000 * 1000 + 7))\r\n" ]

[ "if __name__ == \"__main__\":\r\n n = int(input())\r\n if n % 2 == 1:\r\n print(-1)\r\n exit()\r\n str1 = ''.join(['bb' if i % 2 == 1 else 'ww' for i in range(n // 2)])\r\n str2 = ''.join(['bb' if i % 2 == 0 else 'ww' for i in range(n // 2)])\r\n\r\n for i in range(n):\r\n str1, str2 = str2, str1\r\n for j in range(n // 2):\r\n print(str1 if j % 2 == 0 else str2)\r\n print(str1 if j % 2 == 0 else str2)\r\n print('')\r\n", "k=int(input())\r\nif k%2==1:\r\n print(-1)\r\nelse:\r\n for i in range(k):\r\n for j in range(k):\r\n a=''\r\n for l in range(k):\r\n a+='bw'[(i//2+j+l//2)%2]\r\n print(a)\r\n if i<k-1:\r\n print()", "class CodeforcesTask323ASolution:\n def __init__(self):\n self.result = ''\n self.k = 0\n\n def read_input(self):\n self.k = int(input())\n\n def process_task(self):\n if self.k % 2:\n self.result = \"-1\"\n elif self.k == 2:\n self.result = \"bb\\nww\\n\\nbb\\nww\"\n else:\n level = \"b\"\n cube = [[[None for y in range(self.k)] for x in range(self.k)] for z in range(self.k)]\n for z in range(self.k):\n level = \"w\" if z % 2 else \"b\"\n for k in range(self.k // 2):\n # upper\n for x in range(2 * (k + 1)):\n cube[z][self.k // 2 - 1 - k][self.k // 2 - 1 - k + x] = level\n # lower\n for x in range(2 * (k + 1)):\n cube[z][self.k // 2 + k][self.k // 2 - 1 - k + x] = level\n # left\n for y in range(2 * (k + 1)):\n cube[z][self.k // 2 - 1 - k + y][self.k // 2 - 1 - k] = level\n # right\n for y in range(2 * (k + 1)):\n cube[z][self.k // 2 - 1 - k + y][self.k // 2 + k] = level\n level = \"w\" if level == \"b\" else \"b\"\n\n for layer in cube:\n for row in layer:\n print(\"\".join(row))\n print(\" \")\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask323ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys, math\r\nreadline = sys.stdin.readline\r\n\r\nk = int(readline())\r\n\r\nif k % 2:\r\n print(-1)\r\nelse:\r\n \r\n for i in range(k):\r\n for j in range(k):\r\n s = ''\r\n if (i // 2 + j)&1:\r\n s = 'wwbb' * (k//4)\r\n if k % 4 != 0:\r\n s += 'ww'\r\n else:\r\n s = 'bbww' * (k//4)\r\n if k % 4 != 0:\r\n s += 'bb'\r\n print(s)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(b):\r\n d = [['b']*n for i in range(n)]\r\n for i in range(n//2):\r\n for j in range(n-2*i-1):\r\n d[i][i+j] = d[n-i-1][n-i-j-1] = d[i+j][n-i-1] = d[n-i-j-1][i] = b\r\n b = s[b]\r\n for i in d:\r\n print(''.join(i))\r\n\r\n\r\nn = int(input())\r\ns = {'b':'w', 'w':'b'}\r\nif n % 2:\r\n print(-1)\r\nelse:\r\n c = 'b'\r\n for i in range(n):\r\n f(c)\r\n c = s[c]\r\n print('')", "n=int(input())\r\nprint([\"\\n\".join(\"\\n\".join(\"\".join(\"b\" if (i//2+j//2+k)%2 else \"w\" for j in range(n)) for i in range(n))+\"\\n\" for k in range(n)),-1][n%2])\r\n", "\r\nN = int(input())\r\nif N%2:\r\n exit(print(-1))\r\n\r\ncolors = ['w','b']\r\ndirs = [(0,1),(1,0),(0,-1),(-1,0)]\r\nfor k in range(N):\r\n color = k%2\r\n seen = [['']*N for _ in range(N)]\r\n for i in range(N//2):\r\n x,y=i,i\r\n d = 0\r\n while seen[y][x]=='':\r\n seen[y][x] = colors[color]\r\n \r\n if y+dirs[d][0]<i or y+dirs[d][0]>=N-i or x+dirs[d][1]<i or x+dirs[d][1]>=N-i:\r\n d+=1\r\n d%=4\r\n y+=dirs[d][0]\r\n x+=dirs[d][1]\r\n color=(color+1)%2\r\n \r\n for a in seen:\r\n print(''.join(a))\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "n=int(input())\r\nif(n%2==1):\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n s = ''\r\n if (i // 2 + j)&1:\r\n s = 'wwbb' * (n//4)\r\n if n % 4 != 0:\r\n s += 'ww'\r\n else:\r\n s = 'bbww' * (n//4)\r\n if n % 4 != 0:\r\n s += 'bb'\r\n print(s)\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = 'abcdefghijklmnopqrstuvwxyz'\r\ns = list(input()[:-1])\r\nn = len(s)\r\nans = 0\r\na = 97\r\nfor i in range(n):\r\n if s[i] <= chr(a):\r\n s[i] = chr(a)\r\n a += 1\r\n if a == 123:\r\n ans = 1\r\n break\r\nif ans == 0:\r\n print(-1)\r\nelse:\r\n print(''.join(s))", "\r\ns = input()\r\nch = 'a'\r\n\r\nfor i in range(len(s)):\r\n if s[i] <= ch <= 'z':\r\n s = s[:i] + ch + s[i + 1:]\r\n ch = chr(ord(ch) + 1)\r\nprint(-1 if ch <= 'z' else s)", "s=input()\r\nn=len(s)\r\norda=ord(\"a\")\r\nL=[ord(i)-orda for i in s]\r\nf=True\r\nx=0\r\nfor i in range(n):\r\n if x==26:\r\n f=False\r\n break\r\n if x>=L[i]:\r\n L[i]=x\r\n x+=1\r\nif f and x!=26:\r\n print(-1)\r\nelse:\r\n for i in L:\r\n print(chr(i+orda),end=\"\")\r\n print()\r\n", "S,t=str(input()),1\r\nS=' '.join(S)\r\nS=S.split()\r\nX= { '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\nY= { 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\nfor i in range(len(S)):\r\n if X[S[i]]<=t:\r\n S[i]=Y[t]\r\n t+=1\r\n if t>26:\r\n break\r\nprint(''.join(S) if t==27 else \"-1\")", "s = list(input())\r\nif (len(s) < 26):\r\n print(-1)\r\nelse:\r\n m = \"abcdefghijklmnopqrstuvwxyz\"\r\n c = 0\r\n for i in range(len(s)):\r\n if c == 26:\r\n break\r\n if m[c] >= s[i]:\r\n s[i] = m[c]\r\n c += 1\r\n\r\n if c == 26:\r\n print(''.join(s))\r\n else:\r\n print(-1)\r\n\r\n", "import bisect\r\n\r\n\r\ndef transform_str(s):\r\n if len(s) < 26:\r\n return None\r\n\r\n pos_list = []\r\n for i in range(26):\r\n pos_list.append([])\r\n \r\n for i in range(len(s)):\r\n pos_list[ord(s[i]) - ord('a')] += [i]\r\n\r\n prev_pos = -1\r\n res = [*s]\r\n not_greater_pos_i = []\r\n for i in range(26):\r\n not_greater_pos_i = sorted(not_greater_pos_i + pos_list[i])\r\n\r\n if not not_greater_pos_i or prev_pos >= not_greater_pos_i[-1]:\r\n return None\r\n\r\n curr_pos = not_greater_pos_i[bisect.bisect_right(not_greater_pos_i, prev_pos)]\r\n res[curr_pos] = chr(i + ord('a'))\r\n prev_pos = curr_pos\r\n\r\n return \"\".join(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n t = transform_str(s)\r\n if t is None:\r\n print(-1)\r\n else:\r\n print(t)\r\n", "s = input()\r\na =list(s)\r\ns = 97\r\nfor i in range(len(a)):\r\n p= ord(a[i])\r\n if p<=s:\r\n a[i]=chr(s)\r\n s+=1\r\n if s==123:\r\n break\r\nif s==123:\r\n print(''.join(a))\r\nelse:\r\n print(-1)", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List, Mapping\r\nsys.setrecursionlimit(999999)\r\n\r\n\r\ns = list(input())\r\nt = string.ascii_lowercase\r\nit=0\r\nfor i,c in enumerate(s):\r\n if c<=t[it]:\r\n s[i] = t[it]\r\n it+=1\r\n if it==26:\r\n print(\"\".join(s))\r\n exit()\r\nprint(-1)", "x= input()\r\nalphabet = 'abcdefghijklmnopqrstuvwxyz'\r\nj=0\r\nif(len(x)>=len(alphabet)):\r\n for i in range(len(x)):\r\n if(x[i]<=alphabet[j]):\r\n x = list(x)\r\n x[i] = alphabet[j]\r\n x = ''.join(x)\r\n j+=1\r\n if j == len(alphabet):\r\n break\r\n if(j == len(alphabet)):\r\n print(x)\r\n else:\r\n print (-1)\r\n\r\nelse:\r\n print(-1)", "s = list(input())\r\nn,m = ord('a'),0\r\nfor i in range(len(s)):\r\n\tif s[i] <= chr(n):\r\n\t\ts[m]=chr(n)\r\n\t\tn+=1\r\n\tif n > ord('z'):\r\n\t\tbreak\r\n\tm+=1\r\nif n > ord('z'):\r\n\tfor i in s:\r\n\t\tprint(i,end='')\r\nelse:\r\n\tprint(-1)\r\n", "z=97;k=input().replace('',' ').split()\r\nfor i in range(len(k)):\r\n if k[i]<=chr(z):k[i]=chr(z);z+=1\r\n if z>122:exit(print(*k,sep=''))\r\nprint(-1)", "s,r,l=input(),1,0\r\nfor i in range(len(s)):\r\n if r>ord(s[i])-97:s=s[:i]+chr(96+r)+s[i+1:];r+=1\r\n if r==27:l=1;break\r\nprint(s if l else -1)", "s = input()\r\nls = len(s)\r\n\r\nif ls < 26:\r\n print(-1)\r\n quit()\r\n\r\nfindc = 'a'\r\ni = 0\r\n\r\nwhile i < ls:\r\n\r\n if ord(s[i]) <= ord(findc):\r\n s = s[:i] + findc + s[i + 1:]\r\n findc = chr(ord(findc) + 1)\r\n\r\n\r\n if ord(findc) > ord('z'):\r\n print(s)\r\n quit()\r\n\r\n i += 1\r\n\r\nprint(-1)\r\n", "s = input()\r\n\r\nn = len(s)\r\n\r\nnews = []\r\n\r\ncurr = 0\r\n\r\nfor i in range(n):\r\n if curr < 26 and ord(s[i]) <= (ord('a') + curr):\r\n news.append(chr(ord('a') + curr))\r\n curr += 1\r\n else:\r\n news.append(s[i])\r\n\r\nif curr == 26:\r\n print(''.join(news))\r\nelse:\r\n print(-1)\r\n", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\ns, cur = list(input()), ord('z')\r\nfor i in reversed(range(len(s))):\r\n if ord(s[i]) <= cur:\r\n s[i]=chr(cur)\r\n cur -= 1\r\nif cur>=97:\r\n exit(print(-1))\r\nprint(*s,sep='')\r\n\r\n\r\n", "s = list(input())\nn = len(s)\nc = 97\nans = 'NO'\n\nfor i in range(n):\n if ord(s[i]) <= c:\n s[i] = chr(c)\n c = c + 1\n if c == 122 and (i != n-1):\n s[i + 1] = 'z'\n print(''.join(s))\n ans = 'YES'\n break\n \nif ans!='YES':\n print(-1)\n \n \n", "a='abcdefghijklmnopqrstuvwxyz'\r\ni=0\r\ns=list(input())\r\nfor j in range(len(s)):\r\n if s[j]<=a[i]:\r\n s[j]=a[i];i+=1\r\n if i==26:\r\n print(''.join(s));break\r\nelse:print(-1)", "string = input()\r\nstart = 'a'\r\nans = []\r\nfor i in range(len(string)):\r\n if(string[i] <= start) and start <= 'z':\r\n ans.append(start)\r\n start = chr(ord(start)+1)\r\n else:\r\n ans.append(string[i])\r\n\r\n\r\nif start >'z':\r\n for elem in ans:\r\n print(elem,end='')\r\nelse:\r\n print(-1)", "s=list(input())\r\nk=[]\r\nfor i in range(len(s)):\r\n\tif(s[i]=='a' and k.count('a')==0):\r\n\t\tk.append('a')\r\n\telif(k.count('a')>0):\r\n\t\tif(ord(s[i])<= ord(k[-1])+1):\r\n\t\t\tk.append(chr(ord(k[-1])+1))\r\n\t\t\ts[i]=chr(ord(k[-1]))\r\n\tif(''.join(k)==\"abcdefghijklmnopqrstuvwxyz\"):\r\n\t\tbreak\r\nif(''.join(k)==\"abcdefghijklmnopqrstuvwxyz\"):\r\n\tprint(''.join(s))\r\nelse:\r\n\tprint(-1)", "def transformString(s) : \n chrc = 'a'\n\n if (len(s) < 26) : \n return -1 \n \n for i in range(0, len(s)): \n\n if (ord(chrc) > ord('z')) : \n break\n\n if (s[i] <= chrc) : \n s[i] = chrc \n chrc = chr(ord(chrc) + 1) \n \n if (chrc <= 'z') : \n return -1 \n return \"\".join(s)\n\ns = list(input()) \nprint(transformString(s))\n\n \t\t \t \t \t \t\t \t\t\t \t\t \t \t", "a=input()\r\nl=len(a)\r\na=[i for i in a]\r\nif l<26:\r\n print(-1)\r\nelse:\r\n p=97\r\n for j in range(l):\r\n i=a[j]\r\n k=ord(i)\r\n if (k<=p and p<=97+25):\r\n \r\n #if k==p-1 and k!=97+25:\r\n a[j]=chr(p)\r\n p+=1\r\n if p>=97+26:\r\n print(''.join(a))\r\n else:\r\n print(-1)", "n = [_ for _ in input()]\r\nc = 'a'\r\nh = ''\r\nfor i in range(len(n)):\r\n if ord(n[i]) <= ord(c):\r\n n[i] = c\r\n c = chr(ord(c) + 1)\r\n if ord(c) > ord('z'):\r\n print(''.join(n))\r\n exit()\r\nprint(-1)\r\n", "t = 'abcdefghijklmnopqrstuvwxyz'\r\ni = 0\r\ns = list(input())\r\nfor j in range(len(s)):\r\n if s[j] <= t[i]:\r\n s[j] = t[i]\r\n i += 1\r\n if i == 26:\r\n print(*s, sep='')\r\n break\r\nelse:\r\n print(-1)\r\n", "s = input()\r\ns_list = list(s)\r\nn = len(s)\r\n\r\nif 'a' in s:\r\n index_of_a = s.index('a')\r\n count = 1\r\n largest_c = 'a'\r\n next_c = 'b'\r\n\r\n for i in range(index_of_a + 1, n):\r\n c = s[i]\r\n\r\n if c == next_c or c <= largest_c:\r\n s_list[i] = next_c\r\n largest_c = next_c\r\n next_c = chr(ord(next_c) + 1)\r\n count += 1\r\n\r\n if count == 26:\r\n print(''.join(s_list))\r\n break\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "s = list(input())\r\nn = len(s)\r\nalphabets = list('abcdefghijklmnopqrstuvwxyz')\r\nmemo = {i+1:alphabets[i] for i in range(26)}\r\nf = lambda x: ord(x) - ord('a') + 1\r\nj = 1\r\nfor i in range(n):\r\n if f(s[i]) <= j:\r\n s[i] = memo[j]\r\n j += 1\r\n if j > 26:\r\n break\r\n\r\nif j == 27:\r\n answer = \"\".join(s)\r\n print(answer)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "def main():\n l, i = list(input()), 0\n try:\n for c in 'abcdefghijklmnopqrstuvwxyz':\n while l[i] > c:\n i += 1\n l[i] = c\n i += 1\n print(''.join(l))\n except IndexError:\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "def replace_character(word, pos, new_letter):\r\n\t\"Replaces the character on position pos in string with new_letter\"\r\n\tstring_list = list(word)\r\n\tstring_list[pos] = str(new_letter)\r\n\tword = \"\".join(string_list)\r\n\treturn word\r\n\r\nword = input()\r\n\r\nletter = 'a'\r\nletters_matched = 0\r\nfor i in range(0, len(word)):\r\n\tif(letters_matched == 26):\r\n\t\tbreak\r\n\r\n\tif(ord(word[i]) <= ord(letter)): \r\n\t# word[i] comes before letter in the alphabet\r\n\t\tword = replace_character(word, i, letter)\r\n\t\tletters_matched += 1\r\n\t\tletter = chr(ord(letter) + 1) # sets the letter to the next one (a -> b, b -> c, ..)\r\n\r\nif(letters_matched == 26):\r\n\tprint(word)\r\nelse:\r\n\tprint(-1)", "ans = list(input())\r\nidx = 0\r\nfor i in range(len(ans)):\r\n if ord(ans[i])%97 <= idx:\r\n ans[i] = chr(97 + idx)\r\n idx += 1\r\n if idx == 26:break\r\nprint(''.join(ans) if idx == 26 else -1)", "x = \"abcdefghijklmnopqrstuvwxyz\"\ny = str(input())\nyLista =list(y)\n\nk=0\nt=0\n\nif(len(x)>len(y)):\n k=1\nelse:\n for i in range(len(y)):\n if(t>=26):\n continue\n if(x[t]==yLista[i]):\n t = t+1\n continue \n if(x[t]>=yLista[i]):\n yLista[i]=x[t]\n t=t+1\npos = 0\nfor i in range(len(y)):\n if(yLista[i]==x[pos]):\n pos = pos+1\n if(pos==26):\n break\nif(pos!=26):\n k=1\n \ny = ''.join (yLista)\nif(k==0 and t==len(x)):\n print(y)\nelse:\n print(-1)\n", "a=input(); n=len(a); j=0; c=\"\"; chek=False\r\nb=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in range(n):\r\n if a[i]<=b[j] and chek==False: c+=b[j]; j+=1\r\n else: c+=a[i]\r\n if j==26: j=25; chek=True\r\nif chek: print(c)\r\nelse: print(-1)", "from string import ascii_lowercase as alphabet\r\n\r\ndef transform(string):\r\n string_builder = list(string)\r\n needed = 0\r\n for i in range(len(string)):\r\n if string[i] <= alphabet[needed]:\r\n string_builder[i] = alphabet[needed]\r\n needed += 1\r\n if needed == len(alphabet):\r\n break\r\n if needed == len(alphabet):\r\n return ''.join(string_builder)\r\n else:\r\n return -1\r\n\r\nif __name__ == '__main__':\r\n print(transform(input()))\r\n", "s = list(input())\r\n\r\nmenor = 'a'\r\n\r\naux = s[::]\r\n\r\nachou = False\r\n\r\nfor i in range(len(s)):\r\n if aux[i] <= menor:\r\n aux[i] = menor\r\n if ord(menor) >= ord('z'):\r\n achou = True\r\n break\r\n else:\r\n menor = chr(ord(menor) + 1)\r\n\r\nif achou:\r\n print(''.join(aux))\r\nelse:\r\n print(-1) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nx = 97\r\ni = 0\r\nwhile x < 123 and i < len(s):\r\n if ord(s[i]) <= x:\r\n s[i] = chr(x)\r\n x += 1\r\n i += 1\r\nans = \"\".join(s) if x == 123 else -1\r\nprint(ans)", "s = list(input())\n\ninitial_ord = ord('a')\nfinal_ord = ord('z')\ncurr_ord = ord('a')\nindex = 0\n\nwhile index < len(s):\n if ord(s[index]) <= curr_ord:\n s[index] = chr(curr_ord)\n curr_ord += 1\n index += 1\n if curr_ord == final_ord + 1:\n break\n\nif curr_ord == final_ord + 1:\n print(''.join(s))\nelse:\n print(-1)\n\t\t \t \t\t \t\t\t\t\t\t\t\t\t \t \t\t \t \t", "a = list(input())\r\nans = [\"a\"]\r\ncurrent = 1\r\nanst = \"\"\r\nfor i in range(len(a)):\r\n if a[i] in ans:\r\n ans += [chr(current + 97)]\r\n anst += chr(current + 96)\r\n current += 1\r\n else:\r\n anst += a[i]\r\n if current > 26:\r\n print(anst + \"\".join(a[i + 1:]))\r\n quit()\r\nprint(-1)\r\n \r\n", "s = input()\r\nn = len(s)\r\nsList = list(s)\r\nisCompleted = False\r\ncnt = 0\r\nfor i in range(n):\r\n if cnt >= 26:\r\n break\r\n if ord(sList[i]) <= ord(\"a\") + cnt:\r\n sList[i] = chr(ord(\"a\") + cnt)\r\n cnt += 1\r\n\r\nif cnt != 26:\r\n print(-1)\r\nelse:\r\n print(\"\".join(sList))", "s = input()\r\n\r\ncurr = 'a'\r\nfor i in range(len(s)):\r\n if s[i] <= curr:\r\n s = s[:i] + curr + s[i + 1:]\r\n curr = chr(ord(curr) + 1)\r\n if curr > 'z':\r\n print(s)\r\n exit()\r\n\r\nprint(-1)\r\n", "stri=list(input())\r\nch = 'a'\r\nfor i in range(len(stri)):\r\n if ch >= stri[i]:\r\n stri[i]=ch\r\n ch=chr(ord(ch)+1)\r\n if stri[i]=='z':\r\n break\r\nif(ord(ch)==123):\r\n print(\"\".join(stri))\r\nelse:\r\n print(-1)\r\n", "st = input()\r\ns = []\r\nfor i in range(len(st)):\r\n s.append(st[i])\r\nch = 'a'\r\nif (len(s) < 26):\r\n print(-1)\r\n exit() \r\nfor i in range(len(s)):\r\n if (ord(ch) > ord('z')):\r\n break\r\n if (s[i] <= ch):\r\n s[i] = ch\r\n ch = chr(ord(ch) + 1) \r\nif (ch <= 'z') :\r\n print(-1)\r\n exit()\r\nprint (\"\".join(s))\r\n", "s = list(input())\r\nmiss = \"a\"\r\nj = 0\r\nfor i in s:\r\n if i <= miss:\r\n s[j] = miss\r\n miss = chr(ord(miss)+1)\r\n if ord(miss) > 122:\r\n print(''.join(s))\r\n break\r\n j += 1\r\nelse:\r\n print(-1)\r\n \r\n", "\"\"\"\r\nCode of Ayush Tiwari\r\nCodechef: ayush572000\r\nCodeforces: servermonk\r\n\r\n\"\"\"\r\n# import sys\r\n# input = sys.stdin.buffer.readline\r\n\r\ndef solution():\r\n l=list(input())\r\n a=97\r\n b=0\r\n for h in l:\r\n if h<=chr(a):\r\n l[b]=chr(a)\r\n a+=1\r\n if a>122:\r\n print(\"\".join(l))\r\n break\r\n b+=1\r\n else:\r\n print(\"-1\")\r\n\r\n\r\nsolution()", "s=input()\r\nt=''\r\nc=ord('a')\r\nfor i in s:\r\n if(ord(i)<=c <=ord('z')):\r\n t+=chr(c)\r\n c+=1\r\n else:\r\n t+=i\r\nif(c<=ord('z')):\r\n t=-1\r\nprint(t)", "s=list(input())\r\nt=\"abcdefghijklmnopqrstuvwxyz\"\r\ncur=0\r\nfor i in range(len(s)):\r\n if(s[i]<=t[cur]):\r\n s[i]=t[cur]\r\n cur+=1\r\n if(cur==len(t)):\r\n break\r\nprint(''.join(s) if cur==len(t) else -1)\r\n", "def evolution(s):\r\n t, c = '', ord('a')\r\n for elem in s:\r\n if ord(elem) <= c <= ord('z'):\r\n t += chr(c)\r\n c += 1\r\n else:\r\n t += elem\r\n if c <= ord('z'):\r\n t = -1\r\n return t\r\n\r\n\r\nprint(evolution(input()))\r\n", "s = list(input())\n#print(s)\ni, al = 0, 'a'\n\nwhile al != chr(ord('z')+1) and i < len(s):\n if s[i] == al:\n al = chr(ord(al)+1)\n elif s[i] < al:\n s[i] = al\n al = chr(ord(al)+1)\n i += 1\nprint(''.join(s) if al==(chr(ord('z')+1)) else -1)\n", "from sys import stdin, stdout\r\n\r\n\r\ndef main():\r\n\ts = stdin.readline()\r\n\tn = len(s) - 1\r\n\tans = []\r\n\tcurr = 0\r\n\tfor i in range(n):\r\n\t\tif curr < 26:\r\n\t\t\tif ord(s[i]) - ord('a') <= curr:\r\n\t\t\t\tans.append(chr(curr + ord('a')))\r\n\t\t\t\tcurr += 1\r\n\t\t\telse:\r\n\t\t\t\tans.append(s[i])\r\n\t\telse:\r\n\t\t\tans.append(s[i])\r\n\tif curr < 26:\r\n\t\tstdout.write('-1\\n')\r\n\telse:\r\n\t\tstdout.write(''.join(ans))\r\n\t\tstdout.write('\\n')\r\n\r\n\t\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "b = input()\r\ns = [ord(i) for i in b]\r\n\r\ndef func(s):\r\n now = ord('a')\r\n for i in range(len(s)):\r\n if s[i] <= now:\r\n s[i]=now\r\n now += 1\r\n if now == ord(\"z\") + 1:\r\n break\r\n \r\n if now == ord(\"z\") + 1:\r\n print(''.join([chr(i) for i in s]))\r\n else:\r\n print(-1)\r\n\r\nfunc(s)", "string = list(input())\r\nword = \"a\"\r\n \r\nfor i in range(len(string)):\r\n if string[i] <= word:\r\n string[i] = word\r\n word = chr(ord(word) + 1)\r\n if word > \"z\":\r\n break\r\n \r\nif word <= \"z\":\r\n print(-1)\r\nelse:\r\n print(''.join(string))", "s = [str(i) for i in input()]\r\ni = 97\r\nfor j in range(len(s)):\r\n if s[j] <= chr(i):\r\n s[j] = chr(i)\r\n i += 1\r\n if i > 122:\r\n print(\"\".join(s))\r\n break\r\nelse:\r\n print(-1)", "s = list(input())\r\ncurr = ord('a')\r\ni = 0\r\nwhile curr != ord('z') + 1 and i < len(s):\r\n if ord(s[i]) <= curr:\r\n s[i] = chr(curr)\r\n curr += 1\r\n i += 1\r\nif curr == ord('z') + 1:\r\n print(''.join(s))\r\nelse:\r\n print(-1)", "i = 97\r\nj = 0\r\ns = [x for x in input()]\r\nfor item in s:\r\n if item <= chr(i):\r\n s[j] = chr(i)\r\n i += 1\r\n if i>122:\r\n print(\"\".join(s))\r\n break\r\n j += 1\r\nelse:\r\n print(-1)\r\n", "import math\r\ns=list(input())\r\nif(len(s)<26):\r\n\tprint(-1)\r\n\texit()\r\nc=0\r\nfor i in range(len(s)):\r\n\tif(ord(s[i])<=97+c):\r\n\t\ts[i]=chr(97+c)\r\n\t\tc+=1\r\n\tif c==26:\r\n\t\tprint(''.join(s))\t\r\n\t\texit()\t\r\n\r\nprint(-1)", "def main():\r\n s = input()\r\n ch = 'a'\r\n new_s = list(s)\r\n for i in range(len(s)):\r\n if s[i] <= ch:\r\n new_s[i] = ch\r\n ch = chr(ord(ch) + 1)\r\n if ch > 'z':\r\n break\r\n if ch > 'z':\r\n print(''.join(new_s))\r\n else:\r\n print(-1)\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1691544945.5026534", "s = input()\ncount = 0\nmin_ord = 96\nord_list = [ord(c) for c in s]\nfor i, sym in enumerate(ord_list):\n if count == 26: break\n if sym <= min_ord + 1:\n ord_list[i] = min_ord + 1\n min_ord += 1\n count += 1\nif count != 26: print(-1)\nelse:\n print(''.join(chr(c) for c in ord_list))", "s=list(input());c=97\r\nfor x in range(len(s)):\r\n if ord(s[x])<=c:s[x]=chr(c);c+=1\r\n if c==123:print(''.join(map(str,s)));exit()\r\nprint(-1)", "def solve():\r\n alpha = \"abcdefghijklmnopqrstuvwxyz\"\r\n mp = {}\r\n for i in range(1,27):\r\n mp[i] = alpha[i-1]\r\n idx = 1\r\n for i in range(len(s)):\r\n if s[i] <= mp[idx]:\r\n s[i] = mp[idx];idx+=1\r\n if idx == 27:\r\n print(''.join(s));return\r\n print(-1)\r\n\r\nif __name__ == '__main__':\r\n s = list(input())\r\n solve()", "text=input()\r\nif len(text)<26:\r\n print(-1)\r\nelse:\r\n initial='a'\r\n text=list(text)\r\n for i in range(len(text)):\r\n if text[i]<=initial:\r\n text[i]=initial\r\n initial=chr(ord(initial)+1)\r\n if initial==chr(ord('z')+1):\r\n for x in text:\r\n print(x,end='')\r\n exit()\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n", "import sys\r\n\r\ns = list(input())\r\ncc = 97\r\n\r\nfor i in range(len(s)):\r\n if cc >= ord(s[i]):\r\n s[i] = chr(cc)\r\n cc += 1\r\n if cc > 122:\r\n print(''.join(s))\r\n break\r\nelse:\r\n print(-1)\r\n", "def solve(s):\r\n if len(s)<26:\r\n return -1\r\n n = len(s)\r\n lis = list('abcdefghijklmnopqrstuvwxyz')\r\n curr = 0\r\n for i in range(n):\r\n if lis.index(s[i])<=curr:\r\n #print(s)\r\n s[i] = lis[curr]\r\n curr += 1\r\n if curr == 26:\r\n break\r\n \r\n if curr == 26:\r\n return \"\".join(s)\r\n return -1\r\n \r\ns = list(input())\r\nprint(solve(s))", "s=list(input())\r\ni,j=97,0\r\nfor c in s:\r\n if c<=chr(i):\r\n s[j]=chr(i);i+=1\r\n if i>122:\r\n print(''.join(s));break\r\n j+=1\r\nelse:print(-1)", "inp = input()\n\nalph = \"abcdefghijklmnopqrstuvwxyz\"\nans = \"\"\ncurr = ord('a')\nfor i in range(0, len(inp)):\n if curr == ord('z')+1:\n ans += inp[i:]\n break\n if curr >= ord(inp[i]):\n ans += chr(curr)\n curr += 1\n else:\n ans += inp[i]\n\nif curr == ord('z') + 1:\n print(ans, end='')\nelse:\n print (\"-1\", end='')\n", "s = input()\r\nt = 97\r\no = ''\r\nfor i in s:\r\n if ord(i)<= t and t <= 122:\r\n o += chr(t)\r\n t += 1\r\n else:\r\n o += i\r\nif t != 123:print(-1)\r\nelse:print(o)\r\n", "\n# coding: utf-8\n\n# In[14]:\n\n\ns = input()\nabc = 'abcdefghijklmnopqrstuvwxyz'\nsub_indexes = []\ns_len = len(s)\nabc_len = len(abc)\nanswer = -1\nabc_cnt = 0\nmatch_flag = False\n\nif s_len >= abc_len:\n for sub_char_cnt in range(s_len):\n if s[sub_char_cnt] in abc[:len(sub_indexes) + 1]:\n sub_indexes.append(sub_char_cnt)\n\n if abc_len == len(sub_indexes):\n match_flag = True\n break\n \n if match_flag == True:\n answer = s[:sub_indexes[0]] + abc[0]\n for abc_cnt in range(abc_len - 1):\n answer += s[sub_indexes[abc_cnt] + 1:sub_indexes[abc_cnt + 1]] + abc[abc_cnt + 1]\n \n answer += s[sub_indexes[abc_len - 1] + 1:]\n \nprint(answer)\n\n", "def string(st):\r\n if len(st) < 26:\r\n return False\r\n \r\n start = 97\r\n for i in range(len(st)):\r\n if ord(st[i]) <= start:\r\n st[i] = chr(start)\r\n start += 1\r\n \r\n if start > 122:\r\n break\r\n \r\n if start <= 122:\r\n return False\r\n else:\r\n return True \r\n \r\ns = list(input())\r\nif string(s):\r\n k = [print(x, end = \"\") for x in s]\r\nelse:\r\n print(-1)", "import sys\r\nfrom sys import stdin,stdout\r\n\r\ns=list(map(ord,list(stdin.readline())));s.pop(-1)\r\n#print(s)\r\n\r\nif len(s)<26:\r\n\tprint(-1)\r\nelse:\r\n\tflag2=True\r\n\tctr=26\r\n\tcurr=97\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]<=curr:\r\n\t\t\tctr-=1\r\n\t\t\ts[i]=curr\r\n\t\t\tcurr+=1\r\n\t\tif ctr==0:\r\n\t\t\tstdout.write(''.join(list(map(chr,s))))\r\n\t\t\tflag2=False\r\n\t\t\tbreak\r\n\tif flag2:\r\n\t\tprint(-1)\r\n", "arr = list(input())\r\nentry = 'a'\r\ncnt = 0\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] <= entry:\r\n arr[i] = entry\r\n entry = chr(ord(entry) + 1)\r\n cnt += 1\r\n if cnt == 26:\r\n break\r\n\r\nprint(''.join(arr) if cnt == 26 else -1)\r\n", "text = list(input())\r\ncnt = 0\r\nd = 1\r\nfor i in range(len(text)):\r\n if ord(text[i]) - 96 <= d:\r\n text[i] = chr(d+96)\r\n d += 1\r\n if d == 27:\r\n break\r\nif d == 27:\r\n print(''.join(text))\r\nelse:\r\n print(-1)\r\n", "import math\r\nfor _ in range(1):\r\n s=input()\r\n l=list(s)\r\n a=97\r\n c=0\r\n for i in range(len(s)):\r\n if ord(l[i])<=a and a<=122:\r\n c+=1\r\n l[i]=chr(a)\r\n a+=1\r\n \r\n \r\n if a==123:\r\n \r\n print(\"\".join(l))\r\n else:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n " ]

[ "n, m = map(int, input().split())\r\nres, pd, ph = 0, 0, 0\r\nfor i in range(m):\r\n d, h = map(int, input().split())\r\n if i == 0:\r\n res = h + (d - 1)\r\n else:\r\n delta_d = d - pd\r\n delta_h = abs(h - ph)\r\n if delta_h > delta_d:\r\n print(\"IMPOSSIBLE\")\r\n exit()\r\n res = max(res, max(h, ph) + (delta_d - delta_h) // 2)\r\n if i == m - 1:\r\n res = max(res, h + n - d)\r\n pd, ph = d, h\r\nprint(res)\r\n", "#!/usr/bin/python3\n\nimport sys\n\n(n, m) = map(int, input().split())\n\nfirstData = None \n\nmaxHeight = -1\n\nfor i in range(m):\n (d, h) = map(int, input().split())\n\n if firstData is None:\n firstData = (d, h)\n else:\n if (d - prevD) < abs(h - prevH):\n print (\"IMPOSSIBLE\")\n sys.exit()\n maxH = max(h, prevH)\n minH = min(h, prevH)\n resource = d - prevD - (maxH - minH) # \"free\" days for going up-down\n possibleH = maxH + resource // 2\n maxHeight = max(maxHeight, possibleH)\n\n (prevD, prevH) = (d, h)\n lastData = (d, h)\n\nmaxHeight = max(maxHeight, firstData[1] + firstData[0] - 1)\nmaxHeight = max(maxHeight, lastData[1] + (n - lastData[0]))\n\nprint (maxHeight)\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\nx,y=I()\r\nz=y+x-1\r\nt=1\r\nfor _ in range(m-1):\r\n a,b=I()\r\n if abs(b-y)>a-x:exit(print(\"IMPOSSIBLE\"))\r\n z=max(z,max(b,y)+((a-x)-abs(b-y))//2)\r\n x=a\r\n y=b\r\nprint(max(z,y+n-x))", "from sys import stdin\ninput = stdin.readline\n\nn, m = (int(x) for x in input().split())\npd, ph = (int(x) for x in input().split())\nres = ph + pd - 1\nfor i in range(1, m):\n\td, h = (int(x) for x in input().split())\n\tdd = d - pd\n\tdh = abs(h - ph)\n\tif dd < dh:\n\t\tprint('IMPOSSIBLE')\n\t\texit()\n\tdd -= dh\n\tres = max(res, max(ph, h) + dd // 2)\n\tpd = d\n\tph = h\nres = max(res, ph + (n - pd))\nprint(res)\n", "import math\r\n\r\ndef main():\r\n s = input().split()\r\n n = int(s[0])\r\n m = int(s[1])\r\n heights = []\r\n for _ in range(m):\r\n x, y = input().split()\r\n heights.append([int(x), int(y)])\r\n\r\n if len(heights) == 1:\r\n d, h = heights[0]\r\n print(max(-1+d+h, n-d+h))\r\n return\r\n\r\n maxHeights = []\r\n d, h = heights[0]\r\n maxHeights.append(-1+d+h)\r\n d, h = heights[-1]\r\n maxHeights.append(n-d+h)\r\n \r\n for i in range(len(heights)-1):\r\n d1, h1 = heights[i]\r\n d2, h2 = heights[i+1]\r\n slope = (h2 - h1) / (d2 - d1)\r\n if abs(slope) > 1:\r\n print(\"IMPOSSIBLE\")\r\n return\r\n maxHeights.append(math.floor((d2+h2+d1-h1)/2 - d1 + h1))\r\n\r\n print(max(maxHeights))\r\n \r\nmain() ", "def f(d1, h1, d2, h2):\r\n lo, hi = max(0, h1 - (d2-d1)), min(10**8, h1 + (d2-d1))\r\n if h2 < lo or h2 > hi:\r\n return False, float('-inf')\r\n else:\r\n if h1 < h2:\r\n h1, d1 = h2, d1 + (h2-h1)\r\n elif h1 > h2:\r\n h2, d2 = h1, d2 - (h1-h2)\r\n return True, h1 + (d2-d1)//2\r\n\r\n\r\ndef solve(a, n, m):\r\n ans = float('-inf')\r\n for i in range(m-1):\r\n possible, maxheight = f(a[i][0], a[i][1], a[i+1][0], a[i+1][1])\r\n if not possible:\r\n return float('-inf')\r\n else:\r\n ans = max(ans, maxheight)\r\n return max(ans, a[0][1] + a[0][0] - 1, a[-1][1] + n - a[-1][0])\r\n\r\n\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(m):\r\n d, h = map(int, input().split())\r\n a.append((d,h))\r\nans = solve(a, n, m)\r\nif ans == float('-inf'):\r\n print(\"IMPOSSIBLE\")\r\nelse:\r\n print(ans)", "n,m=map(int,input().split())\nd,h=[],[]\n\nfor i in range(m):\n x,y=map(int,input().split())\n d.append(x)\n h.append(y)\n\nrj=max(h[0]+d[0]-1,h[m-1]+(n-d[m-1]))\nda=True\n\nfor i in range(m-1):\n da &=(abs(h[i]-h[i+1])<=d[i+1]-d[i])\n rj=max(rj,max(h[i],h[i+1]) + (d[i+1]-d[i]-abs(h[i]-h[i+1]))//2)\n\nif da:\n print(rj)\n\nelse:\n print('IMPOSSIBLE')\n \n\n \t \t \t \t\t\t \t \t \t\t\t \t\t \t", "from re import L\r\nfrom sys import stdin\r\ninput=stdin.readline\r\n\r\nv=[]\r\n\r\nn,m=map(int,input().split())\r\nfor _ in range(m):\r\n d,h=map(int,input().split())\r\n v.append([d,h])\r\n\r\nh=max(v[0][1]+v[0][0]-1,v[-1][1]+n-v[-1][0])\r\na,b=v.pop(0)\r\nfor c,d in v:\r\n x=c-a-abs(b-d)\r\n if x<0:\r\n print('IMPOSSIBLE')\r\n exit()\r\n h=max(h,max(b,d)+x//2)\r\n a,b=c,d\r\nprint(h)", "n,m = [int(x) for x in input().split()] \r\na = []\r\nans = 0\r\nwhile m>0:\r\n p = [int(x) for x in input().split()]\r\n a.append(p)\r\n ans = max(ans,p[1])\r\n m-=1\r\nflag = 1\r\nfor i in range(len(a)-1):\r\n x,y = a[i],a[i+1]\r\n t = y[0]-x[0]-1\r\n if(abs(y[1]-x[1])>y[0]-x[0]):\r\n flag = 0\r\n break\r\n else:\r\n ans = max(ans,max(x[1],y[1])+(y[0]-x[0]-abs(y[1]-x[1]))//2)\r\nans = max(ans,a[0][1]+a[0][0]-1)\r\nans = max(ans,a[len(a)-1][1]+(n-a[len(a)-1][0]))\r\nif flag:\r\n print(ans)\r\nelse:\r\n print('IMPOSSIBLE')\r\n\r\n# max(x[1],y[1])+p-(t-p)=min(x[1],y[1]) maximise p\r\n# p = (y[0]-x[0]-abs(y[1]-x[1]))//2", "n, m = map(int, input().split())\r\nans = 0\r\nh1 = 0\r\nh2 = 0\r\nd1 = 0\r\nd2 = 0\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if i == 0:\r\n ans = y + x - 1\r\n h1 = y\r\n d1 = x\r\n else:\r\n h2 = y\r\n d2 = x\r\n if h1 > h2: h1, h2 = h2, h1\r\n t1 = h2 + (((d2 - d1) - (h2 - h1)) // 2)\r\n if t1 < h2:\r\n print(\"IMPOSSIBLE\")\r\n exit()\r\n ans = max(ans, t1)\r\n h1 = y\r\n d1 = x\r\nans = max(ans, h1 + n - d1)\r\nprint(ans)", "n, m = map(int, input().split())\nnotes = [list(map(int, input().split())) for _ in range(m)]\n\nif m == 1:\n d, h = notes[0]\n print(max(h+(d-1), h+(n-d)))\n exit(0)\n\nd0, h0 = notes[0]\nans = h0+(d0-1)\nfor i in range(m-1):\n d1, h1 = notes[i]\n d2, h2 = notes[i+1]\n if d2-d1 < abs(h1-h2):\n ans = -1\n break\n else:\n ans = max((h1+h2+(d2-d1))//2, ans)\nelse:\n dm, hm = notes[m-1]\n ans = max(ans, hm+(n-dm))\nprint(ans if ans != -1 else 'IMPOSSIBLE')\n \n \n", "[n, k] = [int(x) for x in input().split()]\nData = type('Data', (object,), {'index': 0, 'value': 0})\n\ndata = [Data() for _ in range(k)]\nfor i in range(k):\n [data[i].index, data[i].value] = [int(x) for x in input().split()]\n\ndata.sort(key=lambda x: x.index)\n\nans = max(data[0].value + data[0].index - 1, data[k-1].value + n - data[k-1].index)\n\nfor i in range(1, k):\n L = data[i].index - data[i-1].index\n minH = min(data[i].value, data[i-1].value)\n maxV = max(data[i].value, data[i-1].value)\n\n if minH + L < maxV:\n ans = -1\n break\n\n ans = max(ans, (L + minH + maxV) // 2)\n\nif ans < 0:\n print(\"IMPOSSIBLE\")\nelse:\n print(ans)\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ng = sorted([list(map(int, input().split())) for _ in range(m)])\r\nc = max(g[0][0]-1 + g[0][1], n-g[-1][0]+g[-1][1])\r\nfor i in range(m-1):\r\n x = g[i+1][0]-g[i][0]\r\n if g[i][1] - x <= g[i+1][1] <= g[i][1] + x:\r\n c = max(c, (g[i][1]+x - g[i+1][1])//2 + g[i+1][1])\r\n else:\r\n print('IMPOSSIBLE')\r\n break\r\nelse:\r\n print(c)\r\n", "n, m = [int(x) for x in input().split()]\r\nl = []\r\nh = []\r\nfor i in range(m):\r\n d, hi = [int(x) for x in input().split()]\r\n l.append([d, hi])\r\n h.append(hi)\r\njud = 0\r\nfor i in range(1, m):\r\n if abs(l[i][1] - l[i - 1][1]) > l[i][0] - l[i - 1][0]:\r\n jud = 1\r\n break\r\n else:\r\n d1 = l[i - 1][0]\r\n d2 = l[i][0]\r\n h1 = l[i - 1][1]\r\n h2 = l[i][1]\r\n hmax = max(h1, h2)\r\n hmin = min(h1, h2)\r\n disd = abs(d1 - d2)\r\n dish = - abs(h1 - h2)\r\n x = dish + disd\r\n h.append(int(hmax + (disd + dish)/2))\r\nif jud == 1:\r\n print('IMPOSSIBLE')\r\nelse:\r\n h.append(l[0][1] + l[0][0] - 1)\r\n h.append(l[-1][1] + n - l[-1][0])\r\n print(max(h))\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nld, lh = map(int, input().split())\r\nmh = lh + (ld - 1) # 1-indexed\r\nfor i in range(1, m):\r\n\td, h = map(int, input().split())\r\n\tif abs(h - lh) > (d - ld):\r\n\t\tprint('IMPOSSIBLE')\r\n\t\texit()\r\n\tmh = max(mh, max(h, lh) + ((d - ld) - abs(h - lh)) // 2)\r\n\tld, lh = d, h\r\nmh = max(mh, lh + (n - ld))\r\nprint(mh) ", "import math\r\nn,m = map(int,input().split())\r\na = []\r\nfor i in range(m):\r\n d,h = map(int,input().split())\r\n a.append([d,h])\r\nmax_ = -1\r\nc1 = 0\r\ng = (a[0][0] - 1) + a[0][1]\r\nif (g > max_):\r\n max_ = g\r\nfor i in range(len(a)-1):\r\n g = math.floor(((a[i+1][0] - a[i][0]) + a[i][1] + a[i+1][1]) / 2)\r\n if ((a[i][1] > g) or (a[i+1][1] > g)):\r\n c1 = -1\r\n break\r\n else:\r\n if (g > max_):\r\n max_ = g\r\ng = (n - a[len(a)-1][0]) + a[len(a)-1][1]\r\nif (g > max_):\r\n max_ = g\r\nif (c1 != -1):\r\n print(max_)\r\nelse:\r\n print('IMPOSSIBLE')", "def main():\n n, m = map(int, input().split())\n d0, h0 = map(int, input().split())\n res = [h0 + d0 - 1]\n for i in range(m - 1):\n d1, h1 = map(int, input().split())\n dd = d1 - d0\n if h1 > h0:\n base = h1\n dh = h1 - h0\n else:\n base = h0\n dh = h0 - h1\n if dh > dd:\n print('IMPOSSIBLE')\n return\n res.append(base + (dd - dh) // 2)\n d0, h0 = d1, h1\n res.append(h0 + n - d0)\n print(max(res))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nf = sys.stdin\r\n\r\nn, m = map(int, f.readline().strip().split())\r\n\r\nres = True\r\nfor i in range(m):\r\n d, h = map(int, f.readline().strip().split()) \r\n if i==0:\r\n maxH = h + (d - 1)\r\n hpr = h\r\n dpr = d\r\n else: \r\n if abs(h-hpr)>(d-dpr):\r\n res = False\r\n else:\r\n dt = d - dpr - (max(hpr, h) - min(hpr, h))\r\n maxH = max(maxH, max(hpr, h) + (dt // 2))\r\n hpr = h\r\n dpr = d \r\n\r\nmaxH = max(maxH, hpr + (n - dpr))\r\n\r\n \r\nif res:\r\n print(maxH) \r\nelse :\r\n print('IMPOSSIBLE')", "n, m = map(int, input().split(' '))\r\nl = [list(map(int, input().split(' '))) for _ in range(m)]\r\n\r\nans = max(l[0][0] + l[0][1] - 1, n - l[-1][0] + l[-1][1])\r\n\r\nfor i in range(1, m):\r\n dd, dh = abs(l[i][0] - l[i - 1][0]), abs(l[i][1] - l[i - 1][1])\r\n if dd < dh:\r\n print('IMPOSSIBLE')\r\n exit()\r\n ans = max(ans, max(l[i][1], l[i - 1][1]) + ((dd - dh) >> 1))\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nfor i in range(m):\r\n d,h=map(int,input().split())\r\n arr.append([d,h])\r\narr.sort()\r\nflag=0\r\nfor j in range(m-1):\r\n if abs(arr[j][0]-arr[j+1][0])<abs(arr[j][1]-arr[j+1][1]):\r\n print(\"IMPOSSIBLE\")\r\n flag=1\r\n break\r\nif flag==0:\r\n arr1=[]\r\n arr1.append(arr[0][1]+abs(arr[0][0]-1))\r\n arr1.append(arr[-1][1]+abs(arr[-1][0]-n))\r\n for k in range(m-1):\r\n i=abs(arr[k][0]-arr[k+1][0])\r\n ex=abs(arr[k][1]-arr[k+1][1])\r\n f=abs(i-ex)\r\n c=f//2\r\n arr1.append(max(arr[k][1],arr[k+1][1])+c)\r\n print(max(arr1))\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\nans = 0\nh1 = 0\nh2 = 0\nd1 = 0\nd2 = 0\nfor i in range(m):\n x, y = map(int, input().split())\n if i == 0:\n ans = y + x - 1\n h1 = y\n d1 = x\n else:\n h2 = y\n d2 = x\n if h1 > h2: h1, h2 = h2, h1\n t1 = h2 + (((d2 - d1) - (h2 - h1)) // 2)\n if t1 < h2:\n print(\"IMPOSSIBLE\")\n exit()\n ans = max(ans, t1)\n h1 = y\n d1 = x\nans = max(ans, h1 + n - d1)\nprint(ans)\n\t \t \t \t\t \t \t \t \t\t\t \t\t\t" ]

[ "from collections import deque\r\nn,r,k=map(int,input().split())\r\nedges=[[] for _ in range(n)]\r\nedge=[]\r\nfor i in range(r):\r\n temp=list(map(int,input().split()))\r\n edge.append([temp[0]-1,temp[1]-1])\r\n edges[temp[0]-1].append(temp[1]-1)\r\n edges[temp[1]-1].append(temp[0]-1)\r\nd=[float('inf')]*n\r\nd[0]=0\r\nq=deque([0])\r\nwhile q:\r\n temp=q.popleft()\r\n for x in edges[temp]:\r\n if d[x]==float('inf'):\r\n d[x]=d[temp]+1\r\n q.append(x)\r\nprex=[[] for _ in range(n)]\r\nfor i in range(r):\r\n if d[edge[i][0]]==d[edge[i][1]]+1:\r\n prex[edge[i][0]].append(i)\r\n elif d[edge[i][1]]==d[edge[i][0]]+1:\r\n prex[edge[i][1]].append(i)\r\nf=[0]*n\r\nresult=[]\r\nfor i in range(k):\r\n temp=['0']*r\r\n for j in range(1,n):\r\n temp[prex[j][f[j]]]='1'\r\n result.append(''.join(temp))\r\n judge=0\r\n for j in range(1,n):\r\n if f[j]+1<len(prex[j]):\r\n f[j]=f[j]+1\r\n judge=1\r\n break\r\n else:\r\n f[j]=0\r\n if judge==0:\r\n break\r\nnr=len(result)\r\nprint(nr)\r\nfor i in range(nr):\r\n print(result[i])\r\n", "from math import inf\r\n\r\nn, m, k = map(int, input().split(' '))\r\nedge = []\r\nfor i in range(n):\r\n edge.append([])\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split(' '))\r\n edge[a - 1].append((i, b - 1))\r\n edge[b - 1].append((i, a - 1))\r\n\r\nd = [inf for i in range(n)]\r\nd[0] = 0\r\nq = [0 for i in range(n)]\r\nf = 0\r\nr = 1\r\nwhile f < r:\r\n i = q[f]\r\n f += 1\r\n for (_, j) in edge[i]:\r\n if d[j] == inf:\r\n d[j] = d[i] + 1\r\n q[r] = j\r\n r += 1\r\n\r\npre = []\r\nfor i in range(n):\r\n pre.append([])\r\nfor i in range(n):\r\n for (ind, j) in edge[i]:\r\n if d[j] == d[i] - 1:\r\n pre[i].append((ind, j))\r\n\r\ns = [0 for i in range(n)]\r\ntop = n\r\nsol = []\r\nwhile top > 0:\r\n if top == n:\r\n u = []\r\n for i in range(m):\r\n u.append('0')\r\n\r\n for i in range(1, n):\r\n u[pre[i][s[i]][0]] = '1'\r\n sol.append(\"\".join(u))\r\n if len(sol) == k:\r\n break\r\n top -= 1\r\n else:\r\n s[top] += 1\r\n if s[top] == len(pre[top]):\r\n top -= 1\r\n else:\r\n top += 1\r\n if top < n:\r\n s[top] = -1\r\nprint(len(sol))\r\nfor x in sol:\r\n print(x)\n# Sat Oct 02 2021 14:08:29 GMT+0300 (Москва, стандартное время)\n", "from collections import deque\r\n\r\nn, m, k = map(int, input().split())\r\nAB = []\r\ng = [[] for _ in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a, b = a - 1, b - 1\r\n g[a].append(b)\r\n g[b].append(a)\r\n AB.append((a, b))\r\n\r\nq = deque([])\r\nq.append(0)\r\nd = [-1] * n\r\nd[0] = 0\r\nwhile q:\r\n v = q.popleft()\r\n for u in g[v]:\r\n if d[u] == -1:\r\n d[u] = d[v] + 1\r\n q.append(u)\r\n\r\ninc = [[] for _ in range(n)]\r\nfor i, (a, b) in enumerate(AB):\r\n if d[a] + 1 == d[b]:\r\n inc[b].append(i)\r\n if d[b] + 1 == d[a]:\r\n inc[a].append(i)\r\n\r\nF = [0] * n\r\nres = []\r\nfor i in range(k):\r\n s = ['0'] * m\r\n for j in range(1, n):\r\n s[inc[j][F[j]]] = '1'\r\n res.append(''.join(s))\r\n flag = False\r\n for j in range(1, n):\r\n if F[j] + 1 < len(inc[j]):\r\n flag = True\r\n F[j] += 1\r\n break\r\n else:\r\n F[j] = 0\r\n if not flag:\r\n break\r\nprint(len(res))\r\nprint('\\n'.join(res))\n# Mon Sep 27 2021 21:36:47 GMT+0300 (Москва, стандартное время)\n" ]

[ "import re\r\n\r\nu = int\r\nG = input\r\nX = sorted\r\ny = print\r\nA = re.findall\r\na = u(G())\r\nb = X([[u((i[0]or '+')+(i[1]or '1')), i[3]]\r\n for i in A('(\\+|-)?(\\d{0,4})(\\*)?(a\\+\\+|\\+\\+a)', G())])\r\nz = 0\r\nfor i in b:\r\n if i[1] == 'a++':\r\n z += i[0]*a\r\n else:\r\n z += i[0]*(a+1)\r\n a += 1\r\ny(z)\r\n", "import re\n\nPATTERN = r\"([+-]?)(?:(\\d+)\\*)?(...)\"\n\na = int(input())\nsummands = sorted(\n ((int(m[1] + (m[2] or \"1\")), 1 if m[3] == \"++a\" else 0))\n for m in re.finditer(PATTERN, input())\n)\nprint(sum(coef * (a + t) for a, (coef, t) in enumerate(summands, start=a)))\n", "import sys\n\nreadline = sys.stdin.readline\n\nval = int(readline())\ns = readline().strip()\nexpr = []\n\nslow = 0\nfast = 0\nwhile fast < len(s):\n while s[fast] != 'a':\n fast += 1\n if not (fast >= slow+2 and s[fast-1] == s[fast - 2] == '+'):\n fast += 2\n expr.append(s[slow: fast + 1])\n slow = fast + 1\n fast += 1\n# print(expr)\n\nque = [] # co, inc\nfor summand in expr:\n co, inc = 1, 0\n if '*' in summand:\n t = summand.split('*')[0]\n try:\n co = int(summand.split('*')[0])\n except:\n print('Wrong int:', summand)\n elif summand[0] == '-':\n co = -1\n if summand[-1] == 'a':\n inc = 1\n else:\n inc = 0\n que.append((co, inc))\nque.sort()\nresult = 0\n\nfor co, inc in que:\n if inc == 0:\n result += co * val\n val += 1\n elif inc == 1:\n val += 1\n result += co * val\n\nprint(result)", "a = int(input())\r\ns = '+'+input()\r\n\r\nt = []\r\n\r\np = 0\r\nn = len(s)\r\nwhile p < n :\r\n pa = s.find('a', p)\r\n if pa >= p + 3 and s[pa - 2 : pa] == '++' :\r\n np = pa + 1\r\n else :\r\n np = pa + 3\r\n t.append(s[p : np])\r\n p = np\r\n\r\ncoef = []\r\nfor s in t :\r\n if s[-1] == 'a' :\r\n pre = True\r\n else :\r\n pre = False\r\n v = 1\r\n if len(s) > 4 :\r\n v = int(s[:-4])\r\n elif s[0] == '-' :\r\n v = -1\r\n coef.append((v, pre))\r\n\r\ncoef.sort()\r\nans = 0\r\nfor (v, pre) in coef :\r\n if pre :\r\n a += 1\r\n ans += v * a\r\n if not pre :\r\n a += 1\r\nprint(ans)", "import sys\n\nreadline = sys.stdin.readline\n\nval = int(readline())\ns = readline().strip()\nque = [] # co, inc\n\nslow = 0\nfast = 0\nwhile fast < len(s):\n while s[fast] != 'a':\n fast += 1\n if not (fast >= slow+2 and s[fast-1] == s[fast - 2] == '+'):\n fast += 2\n summand = s[slow: fast + 1]\n slow = fast + 1\n fast += 1\n\n co, inc = 1, 0\n if '*' in summand:\n co = int(summand.split('*')[0])\n elif summand[0] == '-':\n co = -1\n if summand[-1] == 'a':\n inc = 1\n else:\n inc = 0\n que.append((co, inc))\n\nque.sort()\nresult = 0\nfor co, inc in que:\n if inc == 0:\n result += co * val\n val += 1\n elif inc == 1:\n val += 1\n result += co * val\nprint(result)", "import re\n\nclass Term:\n def __init__(self, factor, type):\n self.factor = factor\n self.type = type\n def __str__(self):\n return '(%d * %s)' % (self.factor, self.type)\n\na = int(input())\ns = '+' + input().strip()\nterms = []\npos = 0\nwhile pos != len(s):\n sign = 1\n if s[pos] == '-':\n sign = -1\n factor = 1\n if re.match('\\d', s[pos + 1]):\n start = pos + 1\n pos = start + 1\n while s[pos] != '*':\n pos += 1\n factor = int(s[start:pos])\n pos += 4\n term_type = 'pre'\n if s[pos - 3: pos] == 'a++':\n term_type = 'post'\n terms.append(Term(sign * factor, term_type))\n\nterms.sort(key = lambda term: term.factor)\n#print(', '.join(map(str, terms)))\nresult = 0\nfor term in terms:\n if term.type == 'pre':\n a += 1\n result += term.factor * a\n if term.type == 'post':\n a += 1\n\nprint(result)\n" ]

[ "import sys\r\n\r\ndef modInverse(x, y, mod):\r\n res = 1\r\n x = x % mod\r\n while(y > 0):\r\n if(y&1):\r\n res = (res * x) % mod\r\n y = y // 2\r\n x = (x * x) % mod\r\n \r\n return res\r\n\r\ndef isEqual(a, b):\r\n for i in range(len(a)):\r\n if (a[i] != b[i]):\r\n return False\r\n \r\n return True\r\n\r\n\r\nm, n = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\ns = [0, 0]\r\nfor x in arr:\r\n s[0] = s[0] + x\r\n s[1] = s[1] + x*x\r\n\r\nif (n==1):\r\n print(arr[0], 0)\r\n sys.exit()\r\n \r\nif (n==m):\r\n print(\"0 1\")\r\n sys.exit()\r\n\r\narr.sort()\r\nfor i in range(1, n):\r\n d = arr[i]-arr[0];\r\n x = (s[0] - (n*(n-1) // 2) * d + m)%m * modInverse(n, m-2, m) % m\r\n Sum = (n*x*x + n*(n-1)*d*x + n*(n-1)*(2*n-1)//6*d*d) % m\r\n \r\n if(Sum == (s[1]%m)):\r\n b = [x]\r\n for j in range(1, n):\r\n b.append((b[j-1] + d) % m)\r\n \r\n b.sort()\r\n \r\n if (isEqual(arr, b)):\r\n print(x, d)\r\n sys.exit()\r\n\r\nprint(\"-1\")", "def solve(n, m, a):\r\n if n == 0:\r\n return 0, 1\r\n if n == 1:\r\n return a[0], 1\r\n d = (a[1]-a[0]) % m\r\n if d < 0: d += m\r\n st = set(a)\r\n cnt = 0\r\n for v in a:\r\n cnt += ((v + d) % m) in st\r\n cnt = n-cnt\r\n d = (d * pow(cnt, m-2, m)) % m\r\n now = a[0]\r\n while (now + m - d) % m in st:\r\n now = (now + m - d) % m\r\n for i in range(n):\r\n if (now + i*d) % m not in st:\r\n return -1, -1\r\n return now, d\r\n\r\n\r\nm, n = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif n * 2 > m:\r\n st = set(a)\r\n b = [i for i in range(m) if i not in st]\r\n f, d = solve(len(b), m, b)\r\n f = (f + d * (m-n)) % m\r\nelse:\r\n f, d = solve(n, m, a)\r\nif f < 0 or d < 0:\r\n print(-1)\r\nelse:\r\n print(f, d)" ]

[ "import random\r\n\r\nclass interactor:\r\n def __init__(self, n):\r\n def correct(a, b, c, d, n):\r\n arr = [[0 for i in range(n + 1)] for j in range(n + 1)]\r\n for i in range(a[0], a[1] + 1):\r\n for j in range(b[0], b[1] + 1):\r\n arr[i][j] += 1\r\n for i in range(c[0], c[1] + 1):\r\n for j in range(d[0], d[1] + 1):\r\n arr[i][j] += 1\r\n for i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n if arr[i][j] > 1:\r\n return False\r\n return True\r\n \r\n def pair(n):\r\n x = random.randint(1, n)\r\n y = random.randint(1, n)\r\n if x > y:\r\n y, x = x, y\r\n return x, y\r\n self.arr = [2, 1, 5, 5, 1, 1, 1, 4]\r\n return\r\n a, b, c, d = (None for i in range(4))\r\n while True:\r\n a, b, c, d = (pair(n) for i in range(4))\r\n if correct(a, b, c, d, n):\r\n break\r\n self.arr = [a[0], b[0], a[1], b[1], c[0], d[0], c[1], d[1]]\r\n print(self.arr)\r\n \r\n def request(self, x1, y1, x2, y2):\r\n def inside(l, r, L, R):\r\n return l <= L and R <= r\r\n def ins_rect(x1, y1, x2, y2, X1, Y1, X2, Y2):\r\n return inside(X1, X2, x1, x2) and (\r\n inside(Y1, Y2, y1, y2)\r\n )\r\n ans = 0\r\n if ins_rect(self.arr[0], self.arr[1], self.arr[2], self.arr[3],x1, y1, x2, y2):\r\n ans += 1\r\n if ins_rect(self.arr[4], self.arr[5], self.arr[6], self.arr[7],x1, y1, x2, y2):\r\n ans += 1\r\n return ans\r\n\r\n\r\n def check(self, x11, y11, x12, y12, x21, y21, x22, y22):\r\n def eq_arr(a, b):\r\n n = len(a)\r\n for i in range(n):\r\n if a[i] != b[i]:\r\n return False\r\n return True\r\n a1 = [x11, y11, x12, y12, x21, y21, x22, y22]\r\n a2 = [x21, y21, x22, y22, x11, y11, x12, y12]\r\n return eq_arr(self.arr, a1) or eq_arr(self.arr, a2)\r\n \r\nn = int(input()) \r\n#gint = interactor(n)\r\n\r\ndef answer(x11, y11, x12, y12, x21, y21, x22, y22):\r\n print(\"! {0} {1} {2} {3} {4} {5} {6} {7}\".format(\r\n x11, y11, x12, y12, x21, y21, x22, y22))\r\n #global gint\r\n #print(gint.check(x11, y11, x12, y12, x21, y21, x22, y22))\r\n\r\ndef request(x1, y1, x2, y2):\r\n print(\"? {0} {1} {2} {3}\".format(x1, y1, x2, y2))\r\n global gint\r\n #ans = gint.request(x1, y1, x2, y2)\r\n #print(ans)\r\n ans = int(input())\r\n return ans\r\n\r\ndef binary_search(add, min_bound, max_bound, x_func, y_func, process_reply):\r\n while min_bound < max_bound:\r\n mid = (min_bound + max_bound - add) // 2\r\n x1, x2 = x_func(mid)\r\n y1, y2 = y_func(mid)\r\n reply = request(x1, y1, x2, y2)\r\n if process_reply(reply):\r\n max_bound = mid + add\r\n else:\r\n min_bound = mid + 1 + add\r\n return min_bound\r\n\r\ndef find_single_rectangle(x1, y1, x2, y2):\r\n xr = binary_search(0, x1, x2,\r\n lambda mid: (x1, mid),\r\n lambda mid: (y1, y2),\r\n lambda rep: rep == 1) \r\n\r\n yr = binary_search(0, y1, y2,\r\n lambda mid: (x1, x2),\r\n lambda mid: (y1, mid),\r\n lambda rep: rep == 1)\r\n\r\n xl = binary_search(-1, x1, x2,\r\n lambda mid: (mid, x2),\r\n lambda mid: (y1, y2),\r\n lambda rep: rep == 0)\r\n\r\n yl = binary_search(-1, y1, y2,\r\n lambda mid: (x1, x2),\r\n lambda mid: (mid, y2),\r\n lambda rep: rep == 0)\r\n\r\n return xl, yl, xr, yr\r\n\r\ndef find_border(n):\r\n hor = binary_search(0, 1, n,\r\n lambda mid: (1, n),\r\n lambda mid: (1, mid),\r\n lambda rep: rep >= 1)\r\n if request(1, 1, n, hor) == 1 and request(1, hor + 1, n, n) == 1:\r\n return 1, 1, n, hor, 1, hor + 1, n, n\r\n ver = binary_search(0, 1, n,\r\n lambda mid: (1, mid),\r\n lambda mid: (1, n),\r\n lambda rep: rep >= 1)\r\n return 1, 1, ver, n, ver + 1, 1, n, n\r\n\r\ndef main():\r\n \r\n x11, y11, x12, y12, x21, y21, x22, y22 = find_border(n)\r\n #print(x11, y11, x12, y12, x21, y21, x22, y22)\r\n X11, Y11, X12, Y12 = find_single_rectangle(x11, y11, x12, y12)\r\n X21, Y21, X22, Y22 = find_single_rectangle(x21, y21, x22, y22)\r\n \r\n answer(X11, Y11, X12, Y12, X21, Y21, X22, Y22)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def balance(x1, y1, x2, y2):\r\n return min(x1, x2), min(y1, y2), max(x1, x2), max(y1, y2)\r\n\r\n\r\ndef get_lr():\r\n l, r = 0, n\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = 1, 1, m, n\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res < 2:\r\n l = m\r\n else:\r\n r = m\r\n r2 = r\r\n l, r = 1, n + 1\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = n, 1, m, n\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res == 2:\r\n l = m\r\n else:\r\n r = m\r\n l2 = l\r\n\r\n l, r = 0, n\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = 1, 1, m, n\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res < 1:\r\n l = m\r\n else:\r\n r = m\r\n r1 = r\r\n l, r = 1, n + 1\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = n, 1, m, n\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res >= 1:\r\n l = m\r\n else:\r\n r = m\r\n l1 = l\r\n return r1, r2, l2, l1\r\n\r\n\r\ndef get_ud():\r\n l, r = 0, n\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = 1, 1, n, m\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res < 2:\r\n l = m\r\n else:\r\n r = m\r\n r2 = r\r\n l, r = 1, n + 1\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = 1, n, n, m\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res == 2:\r\n l = m\r\n else:\r\n r = m\r\n l2 = l\r\n\r\n l, r = 0, n\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = 1, 1, n, m\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res < 1:\r\n l = m\r\n else:\r\n r = m\r\n r1 = r\r\n l, r = 1, n + 1\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n x1, y1, x2, y2 = 1, n, n, m\r\n x1, y1, x2, y2 = balance(x1, y1, x2, y2)\r\n print('?', x1, y1, x2, y2)\r\n res = int(input())\r\n if res >= 1:\r\n l = m\r\n else:\r\n r = m\r\n l1 = l\r\n return r1, r2, l2, l1\r\n\r\n\r\nn = int(input())\r\nlr = get_lr()\r\nud = get_ud()\r\nrr = [lr[0], lr[1]]\r\nll = [lr[2], lr[3]]\r\nuu = [ud[0], ud[1]]\r\ndd = [ud[2], ud[3]]\r\nfor r1 in rr:\r\n r2 = rr[0] if rr[0] != r1 else rr[1]\r\n for l1 in ll:\r\n l2 = ll[0] if ll[0] != l1 else ll[1]\r\n for u1 in uu:\r\n u2 = uu[0] if uu[0] != u1 else uu[1]\r\n for d1 in dd:\r\n d2 = dd[0] if dd[0] != d1 else dd[1]\r\n if r1 < l1 or r2 < l2 or u1 < d1 or u2 < d2:\r\n continue\r\n print('?', l1, d1, r1, u1)\r\n res1 = int(input())\r\n print('?', l2, d2, r2, u2)\r\n res2 = int(input())\r\n if res1 == res2 == 1:\r\n print('!', l1, d1, r1, u1, l2, d2, r2, u2)\r\n __import__('sys').exit(0)\r\n" ]

[ "import sys\nimport re\nfrom math import gcd, factorial as fact, hypot, atan2, pi,ceil,sqrt,log2,dist,isqrt\ntry: from math import lcm\nexcept: pass\ntry: from icecream import ic\nexcept: ic = lambda *a: None if not a else (a[0] if len(a) == 1 else a)\nfrom heapq import *\nfrom random import *\nfrom itertools import *\nfrom functools import *\nfrom bisect import *\nfrom collections import *\nfrom fractions import Fraction\t\n# import threading\n\n# threading.stack_size(2**23)\n\n# sys.setrecursionlimit(2*10**5+10)\n\ninput = lambda: sys.stdin.readline().strip()\ndef read(fn=int):\n\treturn map(fn,input().split())\n\ndef dbg(*args,**kwargs):\n\tprint(*args,**kwargs,file=sys.stderr)\n\nclass ostream():\n\tdef __lshift__(self,s):\n\t\tsys.stdout.write(str(s))\n\t\treturn self\ncout = ostream()\nendl = '\\n'\n\nyes = 'YES'\nno = 'NO'\n\n# toks = (tok for tok in sys.stdin.read().split())\n# def rd(fn=int): return fn(next(toks))\n# def rdn(n,fn=int): return (rd(fn) for _ in range(n))\n\ndef mul(a,b,mod=0):\n\tif sum(map(sum,a)) == 0 or sum(map(sum,b)) == 0:\n\t\treturn [[0]*len(b[0]) for _ in range(len(a))]\n\tc = [[0 for j in range(len(b[0]))] for i in range(len(a))]\n\tfor i in range(len(a)):\n\t\tfor j in range(len(b[0])):\n\t\t\tfor k in range(len(b)):\n\t\t\t\tc[i][j] += a[i][k]*b[k][j]\n\t\t\t\tif mod: c[i][j] %= mod\n\treturn c\n\ndef power(x,y,mod=0):\n\tn = len(x)\n\tres = [[+(i==j) for j in range(n)] for i in range(n)]\n\twhile y:\n\t\tif y % 2: res = mul(res,x,mod)\n\t\tx = mul(x,x,mod)\n\t\ty //= 2\n\treturn res\t\n\ndef power2(x,y,mod=0):\n\tres = [[+(i==j) for j in range(20)] for i in range(20)]\n\tfor i in range(len(pows)):\n\t\tif (y>>i) & 1:\n\t\t\tres = mul(res,pows[i],mod)\n\t\t\tif sum(map(sum,res)) == 0:\n\t\t\t\tbreak\n\treturn res\n\nmod = 998244353\n \ndef sieve(n,primes):\n\tn = int(n)\n\tisp = [True] * (n+1)\n\tisp[0] = isp[1] = False\n\tfor i in range(2,n+1):\n\t\tif isp[i]:\n\t\t\tprimes += [i]\n\t\t\tfor j in range(i*i,n+1,i):\n\t\t\t\tisp[j] = False\n\treturn isp\n\n# def szs(i,p=-1):\n# \tsz[i] = 1\n# \tfor j in adj[i]:\n# \t\tif j == p: continue\n# \t\tsz[i] += szs(j,i)\n# \treturn sz[i]\n\n# def center(i,p=-1):\n# \ttot = szs(i)\n# \twhile True:\n# \t\tfor j in adj[i]:\n# \t\t\tif j == p: continue\n# \t\t\tif sz[j] > tot//2:\n# \t\t\t\tp,i = i,j\n# \t\t\t\tbreak\n# \t\telse:\n# \t\t\treturn i\n\n# def decomp(i,p=-1):\n# \ti = center(i)\n# \trem[i] = 1\n# \tfor j in adj[i]:\n# \t\tif j == p or rem[j]: continue\n# \t\tpar[decomp(j,i)] = i\n# \treturn i\n\n# def rec(i,p=-1,d=0,v=0):\n# \tanc[0][i] = p\n# \tdep[i] = d\n# \tpth[i] = v ^ (1 << (ord(s[i]) - ord('a')))\n# \tfor j in adj[i]:\n# \t\tif j != p:\n# \t\t\trec(j,i,d+1,pth[i])\n\n# def lca(a,b):\n# \tif dep[a] < dep[b]: a,b = b,a\n\n# \tv = dep[a] - dep[b]\n# \tfor i in range(len(anc)-1,-1,-1):\n# \t\tif v & (1 << i):\n# \t\t\ta = anc[i][a]\n\n# \tif a == b: return a\n\n# \tfor i in range(len(anc)-1,-1,-1):\n# \t\tif anc[i][a] != anc[i][b]:\n# \t\t\ta,b = anc[i][a], anc[i][b]\n\n# \treturn anc[0][a]\n\n# def path(a,b):\n# \treturn pth[a] ^ pth[b]# ^ (1 << (ord(s[lca(a,b)]) - ord('a')))\n\n# n,=read()\n# adj = [[] for _ in range(n)]\n# for _ in range(n-1):\n# \ta,b=read()\n# \ta-=1\n# \tb-=1\n# \tadj[a]+=[b]\n# \tadj[b]+=[a]\n# s = input()\n\n# sz = [0]*n\n# par = [-1]*n\n# rem = [0]*n\n# dep = [0]*n\n# pth = [0]*n\n# anc = [[-1]*n for _ in range(19)]\n\n# rec(0)\n# for i in range(len(anc)-1):\n# \tfor j in range(n):\n# \t\tanc[i+1][j] = -1 if anc[i][j] == -1 else anc[i][anc[i][j]]\n\n# decomp(0)\n# print(par)\n\n# vals = [{} for _ in range(n)]\n# for i in range(n):\n# \tj = i\n# \twhile j != -1:\n# \t\tv = path(i,j) ^ (1 << (ord(s[j]) - ord('a')))\n# \t\tif v not in vals[j]: vals[j][v] = 0\n# \t\tvals[j][v] += 1\n# \t\tj = par[j]\n\n# ans = [0]*n\n# for i in range(n):\n# \tj = i\n# \twhile j != -1:\n# \t\tv = path(i,j)\n# \t\tif v in vals[j]: ans[j] += vals[j][v]\n# \t\tfor k in range(20):\n# \t\t\tif v & (1 << k):\n# \t\t\t\tw = v ^ (1 << k)\n# \t\t\t\tif w in vals[j]: ans[j] += vals[j][w]\n# \t\tj = par[j]\n\n# for i in range(n):\n# \tans[i] = (ans[i] - 1)//2 + 1\n# print(*ans)\n\n\t\t\t\nn,m = read()\nadj = [[] for _ in range(n)]\nfor _ in range(m):\n\ta,b=read()\n\ta-=1\n\tb-=1\n\tadj[a]+=[b]\n\tadj[b]+=[a]\n\na = [*read()]\n\nused = []\nvis = set()\nq = [(a[i], i) for i in range(n)]\nval = [0 for i in range(n)]\nheapify(q)\nwhile q:\n\tr,i = heappop(q)\n\tif r < 0:\n\t\tvis.add(i)\n\t\tcontinue\n\tif r: break\n\tif i in vis: continue\n\tvis.add(i)\n\tused += [i+1]\n\tfor j in adj[i]:\n\t\tif j not in vis:\n\t\t\tval[j] += 1\n\t\t\theappush(q,(a[j] - val[j],j))\n\nprint(len(used))\nprint(*used)" ]

[ "import sys\r\nfrom collections import deque\r\n\r\n# import itertools\r\n# import math\r\n# import os\r\n# import random\r\n# from bisect import bisect, bisect_left\r\n# from collections import *\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush\r\n# from io import BytesIO, IOBase\r\n# from string import *\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# from types import GeneratorType\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\nDIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n n, m, k = mint()\r\n\r\n fa = list(range(n * m))\r\n def find(x: int):\r\n cur = x\r\n while x != fa[x]:\r\n x = fa[x]\r\n while fa[cur] != x:\r\n fa[cur], cur = x, fa[cur]\r\n return x\r\n def union(x: int, y: int) -> bool:\r\n x, y = find(x), find(y)\r\n if x == y: return False\r\n fa[y] = x\r\n return True\r\n \r\n cnt = [0] * (n * m)\r\n\r\n g = []\r\n for _ in range(n):\r\n g.append(input())\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if g[i][j] != '.': continue\r\n x = find(i * m + j)\r\n if cnt[x]: continue\r\n q = deque([(i, j)])\r\n while q:\r\n r, c = q.popleft()\r\n cur = 0\r\n for dr, dc in DIR:\r\n nr, nc = r + dr, c + dc\r\n if g[nr][nc] != '.':\r\n cur += 1\r\n continue\r\n y = find(nr * m + nc)\r\n if y == x: continue\r\n union(x, y)\r\n q.append((nr, nc))\r\n cnt[x] += cur\r\n \r\n for _ in range(k):\r\n x, y = mint()\r\n print(cnt[find((x - 1) * m + y - 1)])\r\n\r\nsolve()", "import sys\r\nfrom queue import deque\r\n \r\n# sys.stdin = open('ivo.in')\r\n \r\nmove = [(0, 1), (1, 0), (0, -1), (-1, 0)]\r\nn, m, k = map(int, sys.stdin.readline().split())\r\n \r\na = []\r\nfor i in range(n):\r\n a.append(sys.stdin.readline().rstrip())\r\n \r\n \r\nvisited = []\r\nvalues = []\r\nfor x in range(n):\r\n visited.append([])\r\n values.append([])\r\n for y in range(m):\r\n visited[x].append(False)\r\n values[x].append(0)\r\n \r\n \r\nfor x in range(n):\r\n for y in range(m):\r\n if a[x][y] == '*' or visited[x][y]:\r\n continue\r\n q = deque()\r\n visited[x][y] = True\r\n q.append((x, y))\r\n sum = 0\r\n connected = [(x, y)]\r\n while len(q) != 0:\r\n cur = q.pop()\r\n for l in move:\r\n tx = cur[0] + l[0]\r\n ty = cur[1] + l[1]\r\n if tx < 0 or tx >= n or ty < 0 or ty >= m:\r\n continue\r\n if a[tx][ty] == '.' and visited[tx][ty]:\r\n continue\r\n if a[tx][ty] == '*':\r\n sum += 1\r\n continue\r\n q.append((tx, ty))\r\n visited[tx][ty] = True\r\n connected.append((tx, ty))\r\n for c in connected:\r\n values[c[0]][c[1]] = sum\r\n \r\nfor i in range(k):\r\n x, y = map(int, sys.stdin.readline().split())\r\n print(values[x - 1][y - 1])\r\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\nfrom collections import defaultdict, deque, Counter\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n, m, k = map(int, input().split())\r\n g = []\r\n cnt = []\r\n def next_pos(x, y):\r\n return [[x+1, y], [x-1, y], [x, y+1], [x, y-1]]\r\n for _ in range(n):\r\n g.append(input())\r\n cnt.append([0 for _ in range(m)])\r\n for i in range(n):\r\n for j in range(m):\r\n for pos in next_pos(i, j):\r\n if 0 <= pos[0] < n and 0 <= pos[1] < m and g[i][j] == '*' and g[pos[0]][pos[1]] == '.':\r\n cnt[pos[0]][pos[1]] += 1\r\n\r\n cc = [[-1 for _ in range(m)] for _ in range(n)]\r\n ans = []\r\n c = -1\r\n for i in range(n):\r\n for j in range(m):\r\n if g[i][j] == '.' and cc[i][j] == -1:\r\n c += 1\r\n q = deque()\r\n q.append((i, j))\r\n cc[i][j] = c\r\n s = cnt[i][j]\r\n while len(q) > 0:\r\n p = q.popleft()\r\n for pos in next_pos(p[0], p[1]):\r\n if 0 <= pos[0] < n and 0 <= pos[1] < m and g[pos[0]][pos[1]] == '.' and cc[pos[0]][pos[1]] == -1:\r\n q.append((pos[0], pos[1]))\r\n cc[pos[0]][pos[1]] = c\r\n s += cnt[pos[0]][pos[1]]\r\n ans.append(s)\r\n\r\n# print(ans)\r\n# print(cc)\r\n# print(cnt)\r\n for _ in range(k):\r\n x, y = map(int, input().split())\r\n print(ans[cc[x-1][y-1]])\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", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter,defaultdict\r\n\r\nN,M,K = map(int, input().split())\r\nA = []\r\nfor _ in range(N):\r\n A.append(input())\r\n \r\nlib = defaultdict(int)\r\nseen = [[0]*M for _ in range(N)]\r\n\r\ndef paint(r,c,color):\r\n v = [(r,c)]\r\n while v:\r\n i,j = v.pop()\r\n if seen[i][j]!=0:continue\r\n seen[i][j] = color\r\n #print(i,j)\r\n \r\n for i1,j1 in ((1,0),(-1,0),(0,1),(0,-1)):\r\n ni,nj=i+i1,j+j1\r\n if ni<0 or ni>=N or nj<0 or nj>=M:continue\r\n if A[ni][nj]=='*':\r\n lib[color]+=1\r\n continue\r\n if seen[ni][nj]==0:\r\n v.append((ni,nj))\r\n\r\ncolor = 0\r\nfor i in range(N):\r\n for j in range(M):\r\n if A[i][j]=='.' and seen[i][j]==0:\r\n color+=1\r\n paint(i,j,color)\r\n\r\nfor _ in range(K):\r\n x,y = map(int, input().split())\r\n x-=1;y-=1\r\n c = seen[x][y]\r\n print(lib[c])\r\n \r\n ", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef bfs(i, j):\r\n q = deque()\r\n q.append((i, j))\r\n c = 0\r\n g = len(cnt)\r\n visit[i][j] = g\r\n while q:\r\n x, y = q.popleft()\r\n for dx, dy in v:\r\n nx, ny = x + dx, y + dy\r\n if 0 <= nx < n and 0 <= ny < m:\r\n if not visit[nx][ny]:\r\n if s[nx][ny] == \".\":\r\n visit[nx][ny] = g\r\n q.append((nx, ny))\r\n else:\r\n c += 1\r\n cnt.append(c)\r\n return c\r\n\r\nn, m, k = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\nvisit = [[0] * m for _ in range(n)]\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\ncnt = [0]\r\nfor _ in range(k):\r\n x, y = map(int, input().split())\r\n x, y = x - 1, y - 1\r\n if not visit[x][y]:\r\n ans = bfs(x, y)\r\n else:\r\n ans = cnt[visit[x][y]]\r\n print(ans)", "from sys import stdin, stdout\r\nimport collections, heapq, bisect, math\r\n\r\ninput = stdin.readline\r\n\r\ndef rint():\r\n return int(input())\r\ndef rstr():\r\n return input().strip()\r\ndef rlstr():\r\n return list(input().strip().split())\r\ndef rlint():\r\n return list(map(int, input().split()))\r\n\r\nd = [[0, 1], [1, 0], [-1, 0], [0, -1]]\r\n\r\ndef main():\r\n n, m, k = rlint()\r\n mat = []\r\n dp = [[0] * m for _ in range(n)]\r\n\r\n for _ in range(n):\r\n mat.append(rstr())\r\n\r\n res = []\r\n comp = 0\r\n visit = [[False] * m for _ in range(n)]\r\n\r\n for i in range(n) :\r\n for j in range(m) :\r\n\r\n if mat[i][j] == '.' and not visit[i][j]:\r\n count = 0\r\n queue = collections.deque()\r\n queue.append((i, j))\r\n visit[i][j] = True\r\n\r\n while queue:\r\n x, y = queue.popleft()\r\n dp[x][y] = comp\r\n\r\n for dx, dy in d:\r\n l = x + dx\r\n g = y + dy\r\n\r\n if not visit[l][g]:\r\n if mat[l][g] == \"*\":\r\n count += 1\r\n\r\n else:\r\n queue.append((l, g))\r\n visit[l][g] = True\r\n\r\n res.append(count)\r\n comp += 1\r\n \r\n for _ in range(k) :\r\n x , y = rlint()\r\n print(res[dp[x - 1][y - 1]])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n \r\nBUFSIZE = 8192\r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * n\r\n self.group = n\r\n self.tot = [0] * n\r\n\r\n def find(self, x):\r\n if self.parents[x] < 0:\r\n return x\r\n else:\r\n self.parents[x] = self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self, x, y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n\r\n if x == y:\r\n return\r\n self.group -= 1\r\n if self.parents[x] > self.parents[y]:\r\n x, y = y, x\r\n\r\n self.parents[x] += self.parents[y]\r\n self.parents[y] = x\r\n self.tot[x] += self.tot[y]\r\n\r\n def size(self, x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\n def members(self, x):\r\n root = self.find(x)\r\n return [i for i in range(self.n) if self.find(i) == root]\r\n\r\n def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x < 0]\r\n\r\n def group_count(self):\r\n return self.group\r\n\r\n def all_group_members(self):\r\n dic = {r:[] for r in self.roots()}\r\n for i in range(self.n):\r\n dic[self.find(i)].append(i)\r\n return dic\r\n\r\n def __str__(self):\r\n return '\\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())\r\n\r\ndef solve():\r\n n, m, k = map(int, input().split())\r\n S = [input() for _ in range(n)]\r\n directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n UF = UnionFind(n * m)\r\n f = lambda i, j: i * m + j\r\n for i in range(n):\r\n for j in range(m):\r\n if S[i][j] == \"*\":\r\n continue\r\n p = f(i, j)\r\n for di, dj in directions:\r\n ni = i + di\r\n nj = j + dj\r\n if S[ni][nj] == \"*\":\r\n UF.tot[UF.find(p)] += 1\r\n else:\r\n UF.union(p, f(ni, nj))\r\n for _ in range(k):\r\n x, y = map(int, input().split())\r\n print(UF.tot[UF.find(f(x - 1, y - 1))])\r\n\r\n \r\n\r\n\r\n \r\nfor _ in range(1):\r\n solve()", "import sys\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline().strip('\\n')\r\n\r\ncells = []\r\ndef dfs(x,y):\r\n global c\r\n q = [(x,y)]\r\n\r\n while q:\r\n x, y = q.pop()\r\n if x >= n or x < 0 or y >= m or y < 0:\r\n continue\r\n if l[x][y] == '*':\r\n c += 1\r\n continue\r\n if visited[x][y]:\r\n continue\r\n \r\n visited[x][y] = 1\r\n cells.append((x,y))\r\n q.append((x+1,y))\r\n q.append((x,y+1))\r\n q.append((x-1,y))\r\n q.append((x,y-1))\r\n\r\nn , m , k = get_ints()\r\nl = []\r\nfor i in range(n):\r\n l.append(list(input()))\r\n\r\nvisited = []\r\nout = []\r\n\r\nfor i in range(n+10):\r\n visited.append([0]*(m+10))\r\n out.append([-1]*(m+10))\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if not visited[i][j] and l[i][j] == '.':\r\n c = 0\r\n dfs(i,j)\r\n for x in cells:\r\n if visited[x[0]][x[1]] and out[x[0]][x[1]] == -1:\r\n out[x[0]][x[1]] = c\r\n cells.clear()\r\nfor i in range(k):\r\n x , y = get_ints()\r\n x , y = x-1 , y-1\r\n print(out[x][y])\r\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nh,w,q=map(int,input().split())\r\ndef conv(i,j):return w*i+j\r\n\r\ns=[]\r\nfor _ in range(h):\r\n s.append(input())\r\ns=''.join(s)\r\n\r\nseen=[True]*(h*w)\r\ndxdy=[(0,1),(1,0),(0,-1),(-1,0)]\r\n\r\nans=[0]*(h*w)\r\nfor i in range(h):\r\n for j in range(w):\r\n if s[conv(i,j)]=='.' and seen[conv(i,j)]:\r\n cnt=0\r\n todo=[(i,j)]\r\n while todo:\r\n x,y=todo.pop()\r\n if not seen[conv(x,y)]:\r\n continue\r\n seen[conv(x,y)]=False\r\n for dx,dy in dxdy:\r\n nx,ny=x+dx,y+dy\r\n if 0<=nx<h and 0<=ny<w:\r\n pass\r\n else:\r\n continue\r\n if s[conv(nx,ny)]=='*':\r\n cnt+=1\r\n elif seen[conv(nx,ny)]:\r\n todo.append((nx,ny))\r\n \r\n todo=[(i,j)]\r\n while todo:\r\n x,y=todo.pop()\r\n if ans[conv(x,y)]!=0:\r\n continue\r\n ans[conv(x,y)]=cnt\r\n for dx,dy in dxdy:\r\n nx,ny=x+dx,y+dy\r\n if 0<=nx<h and 0<=ny<w:\r\n pass\r\n else:\r\n continue\r\n if s[conv(nx,ny)]=='.' and ans[conv(nx,ny)]==0:\r\n todo.append((nx,ny))\r\n\r\nfor _ in range(q):\r\n x,y=map(int,input().split())\r\n print(ans[conv(x-1,y-1)])", "\"\"\"\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\nfrom io import BytesIO, IOBase\n\n\n# FASTIO REGION\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\ndef print(*args, **kwargs):\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\n at_start = True\n for x in args:\n if not at_start:\n file.write(sep)\n file.write(str(x))\n at_start = False\n file.write(kwargs.pop(\"end\", \"\\n\"))\n if kwargs.pop(\"flush\", False):\n file.flush()\n\n\nif sys.version_info[0] < 3:\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\nelse:\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n\n# FASTIO REGION ENDS\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 debug2(value):\n if os.path.exists(\"data.in\"):\n print(value)\n\n\ndef debug3():\n if os.path.exists(\"data.in\"):\n print(\"-\" * 10)\n\n\ndef debug4(msg, value):\n if os.path.exists(\"data.in\"):\n print(msg, value)\n\n\ndef debug5(msg):\n if os.path.exists(\"data.in\"):\n print(msg)\n\n\nstart_time = time.time()\n\n\ndef neighbours(r, c, R, C):\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\nlimit = 1020\n\nvisited = [[0] * limit for _ in range(limit)]\noutput = [[-1] * limit for _ in range(limit)]\n\n\ndef dfs(A, n, m, x, y):\n cells = []\n cnt = 0\n q = deque([(x, y)])\n while q:\n x, y = q.pop()\n if A[x][y] == \"*\":\n cnt += 1\n continue\n if visited[x][y]:\n continue\n visited[x][y] = 1\n cells.append((x, y))\n for nx, ny in neighbours(x, y, n, m):\n q.append((nx, ny))\n\n # Core Logic\n for u, v in cells:\n if visited[u][v] and output[u][v] == -1:\n output[u][v] = cnt\n\n\ndef solve(A, n, m, starts):\n for i in range(n):\n for j in range(m):\n if not visited[i][j] and A[i][j] == \".\":\n dfs(A, n, m, i, j)\n\n for x, y in starts:\n print(output[x][y])\n\n\ndef main():\n n, m, k = input_as_array()\n A = []\n\n for i in range(n):\n cols = input()\n cols = [c for c in cols]\n A.append(cols)\n\n starts = []\n for _ in range(k):\n a, b = input_as_array()\n a, b = a - 1, b - 1\n starts.append((a, b))\n\n solve(A, n, m, starts)\n debug3()\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()\n" ]

[ "n = int(input())\r\ns = 'bbaa' * (n // 4 + 1)\r\ns = s[:n]\r\nprint(s)", "n = int(input())\r\nthingo=[\"a\",\"a\",\"b\",\"b\"]\r\n\r\n\r\nprint(int(n/4)*\"aabb\" + \"\".join(thingo[:n%4]))", "n = int(input())\r\nk=\"aabb\"\r\nprint(k*(n//4)+k[:n%4])", "s, n = \"aabb\", int(input())\r\nprint(s * ((n >> 1) >> 1) + s[0:n % 4])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 19 03:13:15 2020\r\n\r\n@author: Dark Soul\r\n\"\"\"\r\n\r\nn=int(input(''))\r\ns=''\r\ncnt=0\r\nif n==1:\r\n print('a')\r\nelif n==2:\r\n print('ab')\r\nelse:\r\n freq=n//2\r\n rem=n&1\r\n x='aa'\r\n for i in range(freq):\r\n s+=x\r\n if x=='aa':\r\n x='bb'\r\n else:\r\n x='aa'\r\n if rem:\r\n if x=='aa':\r\n s+='a'\r\n else:\r\n s+='b'\r\n print(s)", "n=int(input())\r\na=n//4\r\nb=n%4\r\nx='aabb'\r\nprint((x*a)+x[:b])", "n=int(input())\nfor i in range(1,n+1):\n if(i%4==1 or i%4==2):\n print('a',end='')\n elif(i%4==0 or i%4==3):\n print('b',end='')\n \t\t\t \t \t \t \t \t \t\t \t \t\t\t\t\t\t\t", "num = int(input())\r\n\r\n\r\nstring = \"\"\r\narray = []\r\nfor i in range (num):\r\n try:\r\n if (array[i-2] != 'a'):\r\n array.append('a')\r\n else:\r\n array.append('b')\r\n except:\r\n array.append('a')\r\n\r\nstring = string.join(array)\r\n\r\nprint (string)", "n = int(input())\r\nprint(('aabb'*50000)[:n])", "n=int(input())\r\nx='aabb'\r\nstr=''\r\np=n%4\r\nif (n<5):\r\n str=x[0:n]\r\nelse:\r\n str=x*(n//4)+x[0:p]\r\nprint(str)\r\n \r\n", "n=int(input())\r\ns=''\r\nfor i in range(n):\r\n s+='aabb'\r\nprint(s[:n])", "\r\nn = int(input())\r\na = ['', 'a', 'aa', 'aab']\r\nb = 'aabb'\r\nprint(b * (n//4) + a[(n % 4)])\r\n# CodeForcesian\r\n# ♥\r\n# tuesday\r\n", "num = int(input())\r\nif num<=2:\r\n print('a'*num)\r\nelse:\r\n n = num//2\r\n I=''\r\n i=0\r\n while i<=(n//2):\r\n I+='aa'\r\n I+='bb'\r\n i+=1\r\n print(I[:num])", "n = int(input())\r\nans=['a']*n\r\n \r\nfor i in range(2,n,4):\r\n ans[i] = 'b'\r\n \r\n if i+1<n:\r\n ans[i+1] = 'b'\r\n \r\nprint(''.join(ans))", "n = int(input())\r\ns = \"aabb\"\r\nprint( (n//4)*s + s[:n%4]) ", "n = int(input())\r\n\r\nresult = ['a', 'b']\r\n\r\nfor i in range(2, n):\r\n if result[i-2] == 'a':\r\n result.append('b')\r\n else:\r\n result.append('a')\r\n\r\nprint(''.join(result[:n]))\r\n", "n = int(input())\r\nif n == 1:\r\n print('b')\r\nelif n == 2:\r\n print('bb')\r\nelse:\r\n res = 'a'\r\n n -= 1\r\n q = n//4\r\n r = n%4\r\n res += 'bbaa'*q\r\n if r == 1:\r\n res += 'b'\r\n elif r == 2:\r\n res += 'bb'\r\n elif r == 3:\r\n res += 'bba'\r\n print(res)", "n=int(input())\r\nprint((n*'aabb')[:n])", "n = int(input())\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if(i%4==1 or i%4==2):\r\n s+=\"a\"\r\n if(i%4==0 or i%4==3):\r\n s+=\"b\"\r\nprint(s)", "n = int(input())\r\nprint(\"aabb\" * (n // 4) + \"aabb\"[0:n % 4])", "n=int(input())\r\nfor i in range(n):\r\n print(\"a\" if i%4<2 else \"b\",end=\"\")", "n = int(input())\r\nans = ['a','a','b','b']*50005\r\nprint(''.join(ans[:n]))", "import sys\r\nfrom math import sqrt,ceil,floor,gcd\r\nfrom collections import Counter\r\n\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef int_arr(): return list(map(int,input().split()))\r\ndef str_arr(): return list(map(str,input().split()))\r\ndef get_str(): return map(str,input().split())\r\ndef get_int(): return map(int,input().split())\r\ndef get_flo(): return map(float,input().split())\r\ndef lcm(a,b): return (a*b) // gcd(a,b)\r\n\r\nmod = 1000000007\r\n\r\ndef solve():pass\r\n\r\n\r\n# for _ in range(int(input())):\r\nn = int(input())\r\nif n <= 2:\r\n print(\"a\"*n)\r\nelse:\r\n val = list(\"aabb\"*(n-1))\r\n val = val[:n]\r\n print(\"\".join(val))", "n = int(input())\r\nres, alt, act = \"\", 0, False\r\nfor i in range(n):\r\n if not act:\r\n alt += 1\r\n res += \"a\"\r\n else:\r\n alt += 1\r\n res += \"b\"\r\n if alt == 2:\r\n alt = 0\r\n act = not act\r\nprint(res)\r\n", "n=int(input())\r\nm='aabb'\r\nif n<=len(m):\r\n\tprint(m[:n])\r\nelse:\r\n\tw=n//len(m)\r\n\tprint(w*m+m[:n%len(m)])\r\n", "from collections import defaultdict, deque\r\nfrom heapq import heappush, heappop\r\nfrom math import inf\r\n\r\nri = lambda : map(int, input().split())\r\n\r\ndef solve():\r\n n = int(input())\r\n a = True\r\n ca = cb = 0\r\n for i in range(n):\r\n if a:\r\n print(\"a\", end=\"\")\r\n ca += 1\r\n if ca == 2:\r\n a = not a\r\n cb = 0\r\n else:\r\n print(\"b\", end=\"\")\r\n cb += 1\r\n if cb == 2:\r\n a = not a\r\n ca = 0\r\n print()\r\n \r\n\r\n\r\nt = 1\r\n#t = int(input())\r\nwhile t:\r\n t -= 1\r\n solve()\r\n\r\n", "n = int(input())\r\nstr = \"aabb\"*(2*10**5)\r\nprint(str[:n])", "\nnum = int(input());\nans=\"\"\ncheck = True;\ni=0;\nwhile(i<num):\n if(check):\n ans+='a';\n i+=1;\n if(i<num): ans+='a';\n i+=1;\n check= False;\n else :\n ans+='b';\n i+=1;\n if(i<num): ans+='b';\n i+=1;\n check=True;\n \n# if(num%2==0):\n# ans = ans[:len(ans)-1] + 'c';\n \nprint(ans);\n \n \n \n\n\n \n", "n = int(input())\r\nbase = 'aabb'\r\nprint(base * (n // 4) + base[:n % 4])", "n = int(input())\nprint(''.join([['a', 'a', 'b', 'b'][i % 4] for i in range(n)]))\n", "n=int(input())\r\ns=''\r\na=0\r\nb=0\r\nfor i in range(n):\r\n\tif b!=2:\r\n\t\ts+='b'\r\n\t\tb+=1\r\n\t\tcontinue\r\n\telif a!=2:\r\n\t\ta+=1\r\n\t\ts+='a'\r\n\t\tcontinue\r\n\telif a==2 and b==2:\r\n\t\ts+='b'\r\n\t\tb=1\r\n\t\ta=0\r\nprint(s)", "n = int(input())\r\nans = [\"a\" if i%4 <= 1 else \"b\" for i in range(n)]\r\nprint (\"\".join(ans))", "n = int(input())\r\na = \"aabb\"*200001\r\na = a[:n]\r\nprint(a)", "n=int(input())\r\nr=[]\r\nfor i in range(1,n+1):\r\n if i%4==0 or i%4==1:\r\n r.append(\"a\")\r\n else:\r\n r.append(\"b\")\r\nlistToStr = ''.join([str(elem) for elem in r])\r\nprint(listToStr)", "a=int(input());z=\"abba\";print(z*(a//4)+z[:a%4])", "n=int(input())\r\ns='aabb'\r\nprint(s*(n//4)+s[0:(n%4)])", "from sys import stdin\r\nn = int(stdin.readline())\r\nprint((\"aabb\" * 50000)[:n])", "n = int(input())\r\nflag = True\r\ns = 'aabb'*(n//4+1)\r\nprint(s[:n])\r\n\r\n", "n=int(input())\r\na=n//12\r\nb=n%12\r\ns=\"\"\r\ns1=\"aabbaabbaabb\"\r\nif n<=12:\r\n print(s1[0:n])\r\nelse:\r\n for i in range(1,a+1):\r\n s+=s1\r\n s+=s1[0:b]\r\n print(s)", "n=int(input())\r\ni=0\r\na=\"aa\"\r\nb=\"bb\"\r\nstring=[]\r\nturn=0\r\nwhile(i<n):\r\n if turn%2==0:\r\n string.append(a)\r\n else:\r\n string.append(b)\r\n turn+=1\r\n i+=2\r\nif n%2!=0:\r\n if turn%2==0:\r\n string[len(string)-1]='b'\r\n else:\r\n string[len(string)-1]='a'\r\nprint(''.join(string))", "n=int(input())\r\ns=\"\"\r\nfor i in range(n//2):\r\n if i%2==1:\r\n s+=\"bb\"\r\n else:\r\n s+='aa'\r\n \r\nif n%2==0:\r\n print(s)\r\nelse:\r\n if (n//2)%2:\r\n s+='b'\r\n else:\r\n s+='a'\r\n print(s)\r\n ", "def editor():\r\n\timport sys\r\n\tsys.stdin=open(\"input.txt\",'r')\r\n\tsys.stdout=open(\"output.txt\",'w')\r\n\r\ndef solve():\r\n\tn=int(input())\r\n\ts=\"\"\r\n\tfor i in range(n):\r\n\t\tif i%4==0 or i%4==1: s+='a'\r\n\t\telse: s+='b'\r\n\tprint(s)\r\n\r\nif __name__ == \"__main__\":\r\n\t# editor()\r\n\ttc=1\r\n\t# tc=int(input())\r\n\tfor t in range(tc):\r\n\t\tsolve()", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn=iinput()\r\nprint((int(n/4))*'aabb'+'aabb'[:n%4])\r\n", "n = int(input())\r\nresult = 'abba' * (n // 4)\r\nif n % 4 == 1:\r\n result += 'a'\r\nelif n % 4 == 2:\r\n result += 'ab'\r\nelif n % 4 == 3:\r\n result += 'abb'\r\n\r\nprint(result)", "n=int(input())\r\nz=\"aabb\"\r\nprint((z*(n//4)+z[:(n%4)]))", "n = int(input())\r\n\r\ns = \"\"\r\ni = \"abba\"\r\nx = n//4\r\nif n%4==0:\r\n\ts = x*i\r\nelif n%4==1:\r\n\ts = x*i\r\n\ts+= \"a\"\r\nelif n%4==2:\r\n\ts = x*i\r\n\ts+=\"ab\"\r\nelse:\r\n\ts = x*i\r\n\ts+=\"abb\"\r\nprint(s)", "a=int(input());k=\"\"\r\nfor i in range(a//2):\r\n if i%2:k+=\"aa\"\r\n else:k+=\"bb\"\r\nif (a%2):\r\n if (a//2)%2:k+=\"a\"\r\n else:k+=\"b\"\r\nprint(k)", "n=int(input())\r\nif(n==1):\r\n print('a')\r\nelif(n==2):\r\n print('aa')\r\nelse:\r\n flag=0\r\n ans=''\r\n i=0\r\n while(i < n):\r\n if(i==n-1 and flag==0):\r\n ans+='a'\r\n i+=1\r\n elif(i==n-1 and flag==1):\r\n ans+='b'\r\n i+=1\r\n elif(flag==0):\r\n ans+='aa'\r\n flag=1\r\n i+=2\r\n else:\r\n ans+='bb'\r\n flag=0\r\n i+=2\r\n print(ans)\r\n", "s = \"aabb\" * 200005\r\nn = int(input())\r\nprint(s[:n])\r\n", "n = int(input())\r\nfor i in range(1, n + 1):\r\n if i % 4 < 3 and i % 4 > 0:\r\n print('b', end='')\r\n else:\r\n print('a', end='')\r\n", "n = int(input())\nans = []\nc = 0\nfor i in range(n):\n if i >= 2 and 'ab'[c] == ans[i - 2]: \n c ^= 1\n ans.append('ab'[c])\nprint(''.join(ans))", "import sys\r\n\r\nnum_args = 1\r\nargs = []\r\ni = 0\r\nfor line in sys.stdin:\r\n args.append(line)\r\n i += 1\r\n if i >= 1:\r\n break\r\n\r\nlength = int(args[0])\r\nlets = \"aabb\"\r\ns = lets * int(length / 4) + lets[:length % 4]\r\nprint(s)", "def g(num):\r\n return ('aabb' * ((num + 4) // 4))[:num]\r\n\r\nprint(g(int(input())))", "n = int(input())\r\nfor i in range(1, n+1):\r\n if i % 4 == 1 or i % 4 == 2:\r\n print(\"a\", end=\"\")\r\n else:\r\n print(\"b\", end=\"\")\r\nprint()", "n=int(input())\ns=\"aabb\"\nfor i in range(1,n+1):\n s=s*(i)\n if len(s)>n:\n break\ns=(s[:-(len(s)-n)])\nif s==s[::-1]:\n\n print(s[:-1]+'a')\n\nelse:\n print(s)\n\n \t\t\t\t\t\t \t\t\t \t \t\t \t\t\t\t \t \t", "\"\"\"\nhttps://codeforces.com/problemset/problem/805/B\n\"\"\"\nx = int(input())\n\na = \"aabb\"\na = a * (x // len(a) + 1)\n\nprint(a[:x])\n", "n=int(input())\r\nl=\"\"\r\na=\"a\"\r\nb=\"aa\"\r\nc=\"aab\"\r\nd=\"aabb\"\r\nif(n==1):\r\n print(a)\r\nelif(n==2):\r\n print(b)\r\nelif(n==3):\r\n print(c)\r\nelif(n==4):\r\n print(d)\r\nelse:\r\n for i in range(int(n/4)):\r\n l=l+d\r\n if(n%4==0):\r\n print(l)\r\n elif(n%4==1):\r\n print(l+a)\r\n elif(n%4==2):\r\n print(l+b)\r\n elif(n%4==3):\r\n print(l+c)\r\n\r\n", "\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n counter = 0\r\n turn_of_b = False\r\n for i in range(n):\r\n if counter == 2:\r\n turn_of_b = not turn_of_b\r\n counter = 0\r\n if turn_of_b:\r\n print(\"b\", end=\"\")\r\n counter += 1\r\n else:\r\n print(\"a\", end=\"\")\r\n counter += 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\nmain_function()", "n=int(input())\r\nt=int(n/4)\r\na=''\r\na+=t*'aabb'\r\nif n%4==0:\r\n print(a)\r\nelif n%4==1:\r\n print(a+'a')\r\nelif n%4==2:\r\n print(a+'aa')\r\nelse:\r\n print(a+'aab')\r\n", "for i in range(1, int(input()) + 1):\r\n print('a' if i % 4 == 1 or i % 4 == 2 else 'b', end='')\r\n", "n= int(input())\r\ns=''\r\nfor i in range(1,n+1):\r\n if i%4==1 or i%4==2:\r\n s=s+'a'\r\n \r\n elif(i%4==0 or i%4==3):\r\n s=s+'b'\r\nprint(s) ", "n=int(input())\r\nfor i in range(1,n//2+1):\r\n if i%2==0:\r\n print(\"bb\",end=\"\")\r\n else:\r\n print(\"aa\",end=\"\")\r\nif n%2!=0:\r\n if ((n+1)//2)%2!=0:\r\n print(\"a\",end=\"\")\r\n else:\r\n print(\"b\",end=\"\")\r\n", "n = int(input())\r\nprint('aabb'*(n // 4) + 'a'*((n%4)%3) + 'aab'*((n%4)//3))\r\n", "n=int(input())\r\nfor i in range(n):\r\n if i%4==0:print('a',end='')\r\n elif i%4==1:print('a',end='')\r\n else:print('b',end='')", "n = int(input())\r\nres = \"\"\r\nn = n / 2\r\ni = 0\r\nwhile i < int(n):\r\n if i % 2 == 0:\r\n res += 'aa'\r\n else:\r\n res += 'bb'\r\n i += 1\r\nn *= 2\r\nif len(res) == 0:\r\n res += 'a'\r\nif res.__len__() < n:\r\n if res[len(res)-1] == 'a':\r\n res += 'b'\r\n else:\r\n res += 'a'\r\nprint(res)", "#!/usr/bin/env python3\n# https://codeforces.com/contest/805/problem/B\ndef f(n):\n return ('aabb' * ((n + 4) // 4))[:n]\n\nprint(f(int(input())))\n", "def notPalindrome(n):\r\n str = ''\r\n turn = 0\r\n char = 'a'\r\n for i in range(n):\r\n if (i // 2) % 2 == 0:\r\n str += 'a'\r\n else:\r\n str += 'b'\r\n return(str)\r\nprint(notPalindrome(int(input())))\r\n", "length = int(input())\r\nres = \"\"\r\n\r\nif length==1:\r\n res+=\"a\"\r\n\r\nelif length % 2 == 0:\r\n for i in range( int(length / 2) ):\r\n if ((i+1) % 2) == 0:\r\n res += (\"aa\")\r\n else:\r\n res += (\"bb\")\r\n\r\nelse:\r\n for i in range( int(length / 2)+1 ):\r\n if i == int((length / 2)):\r\n if res[(i*2) - 1] == \"a\":\r\n res += \"b\"\r\n break\r\n else:\r\n res += \"a\"\r\n break\r\n\r\n if ((i+1) % 2) == 0:\r\n res += (\"aa\")\r\n else:\r\n res += (\"bb\")\r\n\r\nprint(res)\r\n", "x = int(input())\r\nc = 'aabb'\r\nt = c*(x//4) + c[:x%4]\r\nprint(t)", "n = int(input())\r\n\r\nl = [''] * n\r\n\t\r\nfor i in range(0, n, 4):\r\n\tl[i] = 'a'\r\n\r\nfor i in range(1, n, 4):\r\n\tl[i] = 'a'\r\n\t\r\nfor i in range(2, n, 4):\r\n\tl[i] = 'b'\r\n\t\r\nfor i in range(3, n, 4):\r\n\tl[i] = 'b'\r\n\t\r\nprint(\"\".join(l))", "n = int(input())\r\ns=\"aabb\"*(n//4)\r\na=[\"\",\"a\",\"aa\",\"aab\"]\r\ns+=a[n%4]\r\nprint(s)", "# your code goes here\nimport math\ndef isprime(a):\n\t\n\tfor i in range(2,int(math.sqrt(a))+1):\n\t\tif a%i == 0:\n\t\t\treturn False\n\treturn True\n\ndef solve(n):\n\ttmp = 'aabb'\n\tif len(tmp) >= n:\n\t\tprint(tmp[:n])\n\t\treturn\n\tans = ''\n\tcnt = n//len(tmp)\n\tcarry = n%len(tmp)\n\t\n\tfor i in range(cnt):\n\t\tans += tmp\n\tans += tmp[:carry]\n\tprint(ans)\n\t\n\treturn\n\nn = int(input())\nsolve(n)\n\t \t \t \t \t \t \t \t \t \t \t", "n=int(input())\r\nq=n//4\r\nr=n%4\r\ns=\"aabb\"\r\nprint(s*q+s[:r])", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = \"\".join([chr(97 + (i & 2) // 2) for i in range(n)])\r\nprint(ans)", "x = int(input())\r\ns1=\"aabbaabbaabbaabbaabbaabb\"\r\nwhile 2*x>=len(s1):\r\n s1 = s1 + s1\r\nprint(s1[:x])", "n = int(input())\r\nl = ['a']*n\r\nfor i in range(n):\r\n if i%4==2 or i%4==3:\r\n l[i]='b'\r\nans = \"\".join(l)\r\nprint(ans)\r\n", "n = int(input())\r\nq = n // 4\r\nr = n % 4\r\ns = \"abba\" * q + \"abba\"[:r]\r\nprint(s)\r\n", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\ncycles = n//4\r\nr = n%4\r\nend = {0:'', 1:'a', 2:'aa', 3:'aab'}\r\n\r\nprint('aabb'*cycles + end[r])\r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nprint((\"aabb\"*100000)[:int(input())])", "num = int(input())\r\nyes = \"aabb\" * (num // 4)\r\nnum %= 4\r\nprint(yes + \"aabb\"[:num])", "n = int(input())\r\nprint((\"aabb\"*(n // 4 + 1))[:n])", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n if i % 4 == 0:\r\n A.append('a')\r\n elif i % 4 == 1:\r\n A.append('a')\r\n elif i % 4 == 2:\r\n A.append('b')\r\n elif i % 4 == 3:\r\n A.append('b')\r\n print(''.join(A))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nlst=[]\r\nn=int(input())\r\nfor i in range(n):\r\n if i%4==0 or i%4==1:\r\n lst.append(\"a\")\r\n else:\r\n lst.append(\"b\")\r\nfor j in lst:\r\n print(j,end=\"\")", "print((\"aabb\"*100000)[:int(input())])", "n = int(input())\r\na = \"aabb\"\r\nc = n*a\r\nprint(c[:n])", "s=''\r\nfor i in range(50000):\r\n s+='aabb'\r\na=int(input())\r\nprint(s[0:a])", "n=int(input())\r\ns=''\r\ns1='ab'\r\ns2='ba'\r\nn1=n//2\r\nif(n%2==1):\r\n\tn1=n1+1\r\nfor i in range(0,n1):\r\n\tif(i%2==0):\r\n\t\ts=s+s1\r\n\telse:\r\n\t\ts=s+s2\r\ns=s[:n]\r\nprint(s)\r\n\r\n\t\t", "n = int(input())\r\na = \"aabb\"\r\nif n % 4 == 0: print((n//4)*a)\r\nelse: print((n//4)*a+a[:n%4])", "# full logic before coding\r\n\r\n# notc = int(input())\r\n\r\n# for i in range(notc):\r\n# n, x = map(int, input().split())\r\n# mylist = list(map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\nmyret_list = []\r\nstate = 0\r\n\r\nwhile n != 0:\r\n if state == 0 or state == 1:\r\n myret_list.append(\"b\")\r\n state += 1\r\n elif state == 2:\r\n myret_list.append(\"a\")\r\n state += 1\r\n else:\r\n myret_list.append(\"a\")\r\n state = 0\r\n n -= 1\r\n\r\nmyret = ''.join(myret_list)\r\nprint(myret)", "'''\r\n1 Habib_2010\r\n2 ___Hafizullo___\r\n3 Cyber_Snake\r\n4 mr.itmo\r\n5 I_am_Naruto\r\n6 JahongirLucifer\r\n7 _Habibolloh_\r\n'''\r\nn = int(input())\r\ns = 'aabb' * (n // 4)\r\ns += 'aabb'[:n % 4]\r\nprint(s)", "n = int(input()) \r\n#s = 'abba'*(n//4)\r\nd = 'abb'\r\n# if s%4 == 1 : s+='a' \r\n# if s%4 == 2 : s+='ab' \r\n# if s%4 == 3 : s+='abb'\r\nprint('abba'*(n//4)+d[:n%4])", "n = int(input())\r\n\r\nl = ['a', 'a', 'b', 'b']\r\nfor i in range(n):\r\n print(l[i % 4], end='')\r\n \r\nprint()", "n=int(input())\r\ns=\"bbaa\"\r\nj=0\r\nfor i in range(0,n):\r\n print(s[j],end=\"\")\r\n j+=1\r\n if j==4:\r\n j=0\r\nprint()", "aabb = [\"a\", \"a\", \"b\", \"b\"]\n\nn = int(input())\n\nfor i in range(n):\n print(aabb[i % 4], end='')\n", "x=int(input())\r\nif x%4==0:print((x//4)*'aabb')\r\nelif x%4==1:print(((x-1)//4)*'aabb'+'a')\r\nelif x%4==2:print(((x-2)//4)*'aabb'+'aa')\r\nelse:print(((x-3)//4)*'aabb'+'aab')", "n=int(input())\r\nidouble=0.0\r\nans=\"\"\r\ncnt=0\r\nfor i in range(0,n):\r\n if(i%4==2 or i%4==3):\r\n ans+='b'\r\n else:\r\n ans+='a'\r\nprint(ans)", "# author: ankan2526\r\n\r\na='aabb'*60000\r\nprint(a[:int(input())])\r\n", "''' ## ## ####### # # ######\r\n ## ## ## ## ### ##\r\n ## ## ## # # # ##\r\n ######### ####### # # ## '''\r\n\r\nimport sys\r\nimport math\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef get_ints(): return map(int, input().strip().split())\r\ndef get_list(): return list(get_ints())\r\n\r\ndef printspx(*args): return print(*args, end=\"\")\r\ndef printsp(*args): return print(*args, end=\" \")\r\ndef printchk(*args): return print(*args, end=\" \\ \")\r\n\r\nMODPRIME = int(1e9+7); BABYMODPR = 998244353;\r\n\r\n\r\n# sys.stdin = open(\"input.txt\",\"r\") # <<< Comment this line >>> #\r\n# for _testcases_ in range(int(input())):\r\nn = int(input())\r\nfor i in range(n):\r\n if i % 4 < 2:\r\n printspx('a')\r\n else:\r\n printspx('b')\r\nprint()\r\n\r\n'''\r\nTHE LOGIC AND APPROACH IS BY ME @luctivud ( UDIT GUPTA )\r\nSOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::\r\n(I Own the code if no link is provided here or I may have missed mentioning it)\r\n>>> DO NOT PLAGIARISE.\r\nTESTCASES:\r\n>>> COMMENT THE STDIN !!\r\n'''", "s = 'aabb'\r\nn = int(input())\r\nprint((n//4)*s + s[0:n - 4*(n//4)])", "n=int(input())\r\nk='abba'*n\r\nif n<=2:\r\n print(n*'a')\r\nelse:\r\n print(k[:n])", "n=int(input())\r\narr=[]\r\ncount=1\r\ncounti=0\r\nfor i in range(n) :\r\n if count==1 or count==2 :\r\n arr.append(\"a\")\r\n else :\r\n arr.append(\"b\")\r\n counti+=1\r\n if counti==2 :\r\n count=0\r\n counti=0\r\n count+=1\r\n\r\n\r\nfor i in arr :\r\n print(i,end=\"\")\r\nprint()", "n = int(input())\r\ns = \"aabb\" * n\r\n\r\nprint(s[:n])\r\n", "n= int(input())\r\n\r\ns = 'aabb'\r\n\r\nprint((n//4)*s + s[:n%4])", "n = int(input())\nw = ''\nfor i in range(n):\n\tif i % 4 == 0 or i % 4 == 1:\n\t\tw += 'a'\n\telse:\n\t\tw += 'b'\nprint(w)", "n = int(input())\r\nans = \"\"\r\nans += \"aabb\"*(n//4)\r\n\r\nif n%4==1:\r\n\tans+=\"a\"\r\nelif n%4==2:\r\n\tans += \"aa\"\r\nelif n%4==3:\r\n\tans+=\"aab\"\r\nelif n%4==4:\r\n\tans+=\"aabb\"\r\nprint(ans)", "n=int(input())\r\np=\"aabb\"\r\ns=\"\"\r\nif(n>=4):\r\n s=int(n/4)*p\r\n n%=4\r\ns+=p[:n]\r\nprint(s)", "# /**\r\n# * problem: B. 3-palindrome\r\n# * contest: Codeforces - Codeforces Round 411 (Div. 2)\r\n# * author: brownfox2k6\r\n# * created: 26/04/2023 18:14:17 Hanoi, Vietnam\r\n# **/\r\n\r\nprint((\"bbaa\" * 100000)[:int(input())])\r\n", "\nInput=lambda:map(int,input().split())\n\nn = int(input())\ns = 'aabb'\nprint(s*(n//4),end=\"\")\nprint('a'*(n%4) if n%4!=3 else 'aab')\n\n\n", "#805B (65No. Problem B)\r\nn = int(input())\r\nt = 'aabb'\r\nd = n//4\r\nk = n%4\r\ns = t*d + t[:k]\r\nprint(s)", "n = int(input())\r\nif n == 1 or n == 2:\r\n print('a' * n)\r\n exit()\r\n\r\nprint('bbaa' * (n // 4) + 'bbaa'[:n % 4])", "n = int(input())\r\nif n==1:\r\n print(\"a\")\r\nelif n==2:\r\n print(\"aa\")\r\nelse:\r\n counter = 1\r\n for i in range(n//3):\r\n if counter==1:\r\n print(\"bba\",end=\"\")\r\n if counter==2:\r\n print(\"abb\",end=\"\")\r\n if counter==3:\r\n print(\"aab\",end=\"\")\r\n if counter==4:\r\n print(\"baa\",end=\"\")\r\n if(counter==4):\r\n counter=1 \r\n else:\r\n counter+=1\r\n if n%3==2:\r\n if counter==2:\r\n print(\"ab\",end=\"\")\r\n if counter==3:\r\n print(\"aa\",end=\"\")\r\n if counter==4:\r\n print(\"ba\",end=\"\")\r\n if counter==1:\r\n print(\"bb\",end=\"\")\r\n if n%3==1:\r\n if counter==2:\r\n print(\"a\",end=\"\")\r\n if counter==3:\r\n print(\"a\",end=\"\")\r\n if counter==4:\r\n print(\"b\",end=\"\")\r\n if counter==1:\r\n print(\"b\",end=\"\")\r\n \r\n ", "n = int(input())\r\n\r\nif n == 1:\r\n print('a')\r\nelif n == 2:\r\n print('aa')\r\nelif n == 3:\r\n print('aab')\r\nelif n == 4:\r\n print('aabb')\r\nelse:\r\n l = list('aabb')\r\n count = 0\r\n\r\n for i in range(4,n):\r\n\r\n if count == 0 or count == 1:\r\n\r\n l.append('a')\r\n else:\r\n l.append('b')\r\n count+=1\r\n\r\n if count == 4:\r\n count = 0\r\n\r\n c = ''.join(l)\r\n print(c)\r\n", "#3-palindrome\r\nn=int(input())\r\nflage=1\r\nfor i in range(1,n+1):\r\n if(i%4==0):\r\n flage=1\r\n if i%4==2:\r\n flage=0\r\n if flage:\r\n print(\"a\",end=\"\")\r\n else:\r\n print(\"b\",end=\"\")\r\n ", "def main():\r\n n = int(input())\r\n if n == 1:\r\n print(\"b\")\r\n elif n == 2:\r\n print(\"bb\")\r\n elif n == 3:\r\n print(\"bba\")\r\n else:\r\n i = 0\r\n ans = \"\"\r\n while i < n - (n % 4):\r\n ans += \"bbaa\"\r\n i += 4\r\n if n % 4 == 1:\r\n ans += \"b\"\r\n elif n % 4 == 2:\r\n ans += \"bb\"\r\n elif n % 4 == 3:\r\n ans += \"bba\"\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\r\n", "n=int(input())\r\na=n//4;b=n%4\r\nif b==0:\r\n print(\"aabb\"*a)\r\nelif b==1:\r\n print(\"aabb\"*a+\"a\")\r\nelif b==2:\r\n print(\"aabb\"*a+\"aa\")\r\nelif b==3:\r\n print(\"aabb\"*a+\"aab\")\r\n", "n = int(input())\r\nif n==2:\r\n\tprint(\"aa\")\t\r\nelse:\r\n\tl = \"aabb\"\t\r\n\tk = n//4\r\n\tm = n%4\r\n\ts = l*k\r\n\ts += l[:m]\r\n\tprint(s)", "n = int(input())\nif n ==1:\n\tans = \"a\"\nelif n ==2: \n\tans = \"aa\"\nelif n ==3:\n\tans = \"bba\"\nelse:\n\tans = \"aabb\"*(n//4)+\"a\"*min(2,n%4)+\"b\"*max(0,n%4-2)\n\nprint(ans)", "x='aabb'\r\nfor i in range(int(input())):\r\n print(x[i%4],end='')\r\nprint()", "a = 'bbaa'\r\nn = int(input())\r\ns = a*(n//4)+a[:(n%4)]\r\nprint(s)", "n=int(input())\r\na=[\"a\",\"a\",\"b\",\"b\"]\r\nfor i in range(n):\r\n print(a[i%4],end = \"\")", "import math\r\nn = int(input())\r\ns = \"aabb\" * math.ceil(n/4)\r\nprint(s[:n])\r\n", "one_cycle = \"aabb\"\r\ncycle_len = 4\r\nn = int(input())\r\n\r\ncomplete_cycle = n//cycle_len\r\nremaining = n%cycle_len\r\n\r\nprint((complete_cycle*one_cycle) + one_cycle[:remaining])", "print(eval(\"'aabb'*({0}//4)+'aabb'[0:{0}%4]\".format(int(input()))))", "import sys \r\nimport bisect\r\nimport math as mt\r\n\r\ninput=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10**9+7\r\nfor _ in range(t):\r\n \r\n n=int(input())\r\n #l,r=map(int,input().split())\r\n #l1=list(map(int,input().split()))\r\n #l2=list(map(int,input().split()))\r\n cnt=0\r\n for i in range(n):\r\n if cnt<=1:\r\n print('a',end=\"\")\r\n else:\r\n print('b',end=\"\")\r\n cnt+=1\r\n cnt%=4", "n = int(input())\ns='abbaabbaabba'\nx = n//12\nr=n%12\nmim = s*x+s[:r]\nprint(mim)\n\n\t\t \t\t\t \t \t \t\t \t\t\t \t \t\t", "n=int(input())\r\ns=\"\"\r\nfor i in range(n):\r\n if(len(s)<2):\r\n s+=\"a\"\r\n else:\r\n us=s[len(s)-2]\r\n s+=\"a\" if us==\"b\" else \"b\"\r\nprint(s)\r\n", "n=int(input())\r\nx=(\"aabb\"*n)\r\nprint(x[:n])\r\n", "#805B\r\nn=int(input())\r\ns=\"\"\r\nl=n//4+1\r\nm=4-n%4\r\nfor i in range(l):\r\n s+=\"aabb\" #absolutely hilarious logic once you get it!\r\nprint(s[:-m])\r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n):\r\n answer = []\r\n for i in range(n):\r\n if i % 4 <= 1:\r\n answer.append('a')\r\n else:\r\n answer.append('b')\r\n return ''.join(answer)\r\n\r\nn = int(input())\r\nanswer = process(n)\r\nsys.stdout.write(answer+'\\n')", "n = int(input())\r\ns = []\r\nfor i in range(1, n+1):\r\n if i % 4 == 1 or i % 4 == 2:\r\n s.append('a')\r\n else:\r\n s.append('b')\r\n\r\nprint(*s, sep='')\r\n", "n = int(input())\r\nfor i in range(n):\r\n if i%4 == 0 or i%4 == 1:\r\n print(\"a\",end=\"\")\r\n else:\r\n print(\"b\",end=\"\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nprint(('abba'*n)[:n])", "n=int(input())\r\ns=\"\"\r\nfor i in range(1,n+1):\r\n if(i%4==1 or i%4==2):\r\n s+='a'\r\n elif(i%4==3 or i%4==0):\r\n s+='b'\r\n \r\nprint(s)", "import sys\n\nargs = []\nsum = 0\n\nvals = 0\nfor line in sys.stdin:\n args.append(line)\n vals += 1\n if vals == 1: break\n\noutput = \"\"\n\nfor x in range(int(args[0])):\n r = x % 4\n if r == 0 or r == 1: output += \"a\"\n else: output += \"b\"\n\nprint(output)", "n=int(input())\r\ncnt=0\r\nfor i in range(0,(n+1)//2):\r\n if(i%2==0): \r\n if(n-cnt==1):\r\n print('a',end=\"\")\r\n else:\r\n print('a'*(2),end=\"\");cnt+=2\r\n else:\r\n if(n-cnt==1):\r\n print('b',end=\"\")\r\n else:\r\n print(2*'b',end=\"\");cnt+=2", "n = int(input())\n# aabcaab\nl = []\nfor i in range(0,n):\n k = i%4\n if k == 0 or k == 1:\n l.append('a')\n elif k == 2 or k == 3:\n l.append('b')\ns = \"\"\nprint(s.join(l))\n", "def f(n):\n return ('aabb' * ((n + 4) // 4))[:n]\n\nprint(f(int(input())))\n\t\t\t\t \t \t \t \t\t\t\t\t \t \t \t \t", "n=int(input())\r\ns=''\r\na=n%2\r\nb=n//2\r\nif(n==1):\r\n print('a')\r\nelif(n==0):\r\n print('')\r\nelse:\r\n for i in range(b):\r\n if(i%2==0):\r\n s+='aa'\r\n else:\r\n s+='bb'\r\n if(a==0):\r\n pass\r\n else:\r\n if(s[-1]=='a'):\r\n s+='b'\r\n else:\r\n s+='a'\r\n print(s)\r\n", "n = int(input())\r\n\r\nif n%4 == 0:\r\n print(\"aabb\"*(n//4))\r\nelif n%4 == 3:\r\n print(\"aabb\"*(n//4) + \"aab\")\r\nelif n%4 == 2:\r\n print(\"aabb\"*(n//4) + \"aa\")\r\nelse:\r\n print(\"aabb\"*(n//4) + \"a\")", "n=int(input())\r\ns=\"aabb\"\r\nq=\"\"\r\ni=0\r\na=n//4\r\nb=n%4\r\nr=(s*a)+s[:b]\r\nprint(r)", "n=int(input())\r\nprint (('abba'*n)[:n])", "n = int(input())\ns = \"bbaa\"\nj = 0\nfor i in range(1, n+1):\n print(s[j], end=\"\")\n j += 1\n if j == 4:\n j = 0\n", "def main():\r\n N = int(input())\r\n x = 0\r\n s = []\r\n for i in range(N):\r\n x+=1\r\n if(x == 1):\r\n s.append('a')\r\n elif(x == 2):\r\n s.append('a')\r\n elif(x == 3):\r\n s.append('b')\r\n elif(x == 4):\r\n s.append('b')\r\n x = 0\r\n print(*s, sep = '')\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "print((lambda t:('aabb'*t)[:t])(int(input())))", "from math import*\r\nn = int(input())\r\ns = \"abba\"* n\r\nprint(s[:n])\r\n", "n=int(input())\r\nif n%4==0:\r\n print('aabb'*(n//4))\r\nelif n%4==1:\r\n print('aabb'*(n//4)+'a')\r\nelif n%4==2:\r\n print('aabb'*(n//4)+'aa')\r\nelse:\r\n print('aabb'*(n//4)+'aab')", "n = int(input())\r\ns = \"bbaac\"\r\nfor i in range(n):\r\n print(s[i%4], end=\"\")\r\nprint()", "n = int(input())\n\nr = ''\na = 0\nb = 0\nfor i in range(n):\n if i % 2 == 0:\n r += 'aa'\n else:\n r += 'bb'\nprint(r[:n])\n\n", "import sys,math\r\ns=\"bbaa\"\r\nn=int(sys.stdin.readline())\r\n\r\nout=\"a\"\r\nn-=1\r\nout+=s*(n//4)+s[:n%4]\r\nprint(out)", "n=int(input())\r\nele=\"aabb\"\r\nmod=n%4\r\nif mod==1:\r\n ele=ele*(n//4)+'a'\r\nelif mod==2:\r\n ele=ele*(n//4)+\"aa\"\r\nelif mod==3:\r\n ele=ele*(n//4)+\"aab\"\r\nelse:\r\n ele=ele*(n//4)\r\nprint(ele)\r\n ", "from math import ceil\r\nn=int(input())\r\ns=''.join(['abba']*ceil(n/4))\r\nif len(s) > n:\r\n s=s[:n]\r\nprint(s)", "n = int(input())\r\ns = ''\r\ns += 'aabb' * (n // 4) \r\nn = n - n // 4 * 4\r\nif(n == 3):\r\n s += 'aab' \r\nelif(n == 2):\r\n s += 'aa'\r\nelif(n == 1):\r\n s += 'a'\r\nprint(s)", "import sys\r\n\r\nn=int(input())\r\n\r\nif n==1:\r\n print(\"b\")\r\n exit(0)\r\n\r\nm=n\r\nwhile(n>=2):\r\n if n>=2:\r\n sys.stdout.write(\"bb\")\r\n n-=2\r\n if n>=2:\r\n sys.stdout.write(\"aa\")\r\n n-=2\r\n\r\nif(n==1):\r\n\r\n if int((m-1)%4)==0:\r\n sys.stdout.write(\"b\")\r\n else:\r\n sys.stdout.write(\"a\")", "a = int(input())\r\nif a==3:\r\n print('bba')\r\nelse:\r\n for i in range(a):\r\n if i%4==0:\r\n print('a',end=\"\")\r\n elif i%4==1:\r\n print('a',end=\"\")\r\n elif i % 4 == 2:\r\n print('b',end=\"\")\r\n else:\r\n print('b',end=\"\")", "t=1\r\n# liaison\r\nfor _ in range(t):\r\n n=int(input())\r\n l=\"ab\";c=0\r\n for i in range(n):\r\n if(n==1):print(\"a\");break;\r\n if(c==n):break;\r\n if(c+2<=n):print(2*(l[i%2]),end=\"\");c+=2\r\n else:print(l[i%2],end=\"\");break;", "n = int(input())\r\nfrom itertools import cycle\r\n\r\nx = cycle(\"abba\")\r\n\r\nfor i in range(n):\r\n print(next(x), end = \"\")", "n = int(input())\r\ns = 'aabb'\r\nd = n//4\r\nr = n % 4\r\nprint(s*d + s[:r])\r\n", "n = int(input())\r\nx = n//4\r\nans=''\r\nfor i in range(x):\r\n for j in range(2):\r\n ans+=2*chr(ord('a')+j)\r\ny = n%4\r\nfor i in range(y//2):\r\n ans+=2*chr(ord('a')+i)\r\nif y==1:\r\n ans+='a'\r\nelif y==3:\r\n ans+='b'\r\n \r\nprint(ans)", "# cook your dish here\r\na=\"\"\r\nn=int(input())\r\nfor i in range(n//2):\r\n if i%2==0:\r\n a=a+\"aa\"\r\n else:\r\n a=a+\"bb\"\r\nif n==1:\r\n print(\"a\")\r\nelif n==3:\r\n print(\"aab\")\r\nelif n%2==1:\r\n print(a+a[-3])\r\nelse:\r\n print(a)", "n = int(input())\r\ns = ['a']*n\r\nif n >= 3:\r\n for i in range(2, n, 4):\r\n s[i] = 'b'\r\n if i+1 != n:\r\n s[i+1] = 'b'\r\nprint(\"\".join(s))\r\n", "n = int(input())\nnew_string = \"\"\nreference = \"aabb\"\nif n <= 4:\n for i in range(n):\n new_string += reference[i]\nelse:\n for i in range(int(n / 4)):\n new_string += reference\n for i in range(n % 4):\n new_string += reference[i]\nprint(new_string)\n", "w = int(input())\r\nans = 'aa'\r\nif(w==1):\r\n print('a')\r\nelif(w==2):\r\n print('aa')\r\nelse:\r\n char = 'b'\r\n while(len(ans)<w):\r\n if(ans[-1]=='a'):\r\n char = 'b'\r\n else:\r\n char = 'a'\r\n ans+=char*2\r\n while(len(ans)!=w):\r\n ans = ans[:-1]\r\n print(ans)\r\n \r\n ", "x=int(input());p=''\r\nfor i in range(1,x+1):\r\n\tif i%4==1 or i%4==2:p+='a'\r\n\telse: p+='b'\r\nprint(p)", "\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: A_3_-palindrome.py\r\n# * Folder: D:\\Code\\Python\\Codeforces\\ProblemSet\\Topic Stream Mashup Constructives\r\n# ? Author: TranDucTri2003\r\n# TODO CreatedAt: 08/27/2022 09:48:06\r\n# ? -----------------------------------------------------------------------------------------------------\r\n\r\n\r\n#! Không có palindrome độ dài 3\r\n# => aabbaabbaabb\r\nn = int(input())\r\nres = []\r\nfor i in range(n):\r\n if i % 4 == 0 or i % 4 == 1:\r\n res.append('a')\r\n else:\r\n res.append('b')\r\nres = \"\".join(res)\r\nprint(res)\r\n", "n = int(input())\r\nj = 0\r\ns = [\"b\", \"b\", \"a\", \"a\"]\r\n\r\nfor i in range(n):\r\n print(s[j], end=\"\")\r\n j += 1\r\n if j == 4:\r\n j = 0\r\n\r\nprint()\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/805/B\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n if i % 4 < 2:\r\n print(\"a\", end = \"\")\r\n else:\r\n print(\"b\", end = \"\")", "n = int(input())\r\noutStr = ''\r\n\r\nfor i in range(n):\r\n val = i % 4\r\n if val == 0 or val == 1:\r\n outStr += 'a'\r\n elif val == 2 or val == 3:\r\n outStr += 'b'\r\nprint(outStr)\r\n", "import random\r\nn = int(input()) # the length of the string\r\noptions = ['a', 'b', 'c']\r\noutput = []\r\n\r\ni = 0\r\ncounter = 0\r\n\r\nwhile i < n:\r\n if counter >= 4:\r\n counter = 0\r\n if counter < 2:\r\n output.append(\"a\")\r\n elif counter < 4:\r\n output.append(\"b\")\r\n i += 1\r\n counter += 1\r\n\r\nprint(\"\".join(output))", "n=int(input())\r\na='abba'*n\r\nprint(a[:n])", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn = int(inpu())\r\nword = ['']*n\r\ncheck = 0\r\nind = 0\r\nfor i in range(n//2) :\r\n if check == 0 :\r\n word[ind] = 'a'\r\n word[ind + 1] = 'a'\r\n check = 1\r\n else:\r\n word[ind] = 'b'\r\n word[ind + 1] = 'b'\r\n check = 0\r\n ind += 2\r\nif n & 1 == 1:\r\n if word[ind - 1] == 'a' :\r\n word[ind] = 'b'\r\n else:\r\n word[ind] = 'a'\r\nprin(''.join(map(str, word)) + '\\n')", "n = int(input())\r\nif n % 4 == 0:\r\n g ='aabb' * (n // 4)\r\nelif n % 4 == 1:\r\n g = 'aabb' * (n // 4) + 'a'\r\nelif n % 4 == 2:\r\n g = 'aabb' * (n // 4) + 'aa'\r\nelif n % 4 == 3:\r\n g = 'aabb' * (n // 4) + 'aab'\r\nprint(g)", "n = int(input())\r\ns = ''\r\n\r\nif n >= 2:\r\n for i in range(n//2):\r\n if i%2:\r\n s += 'bb'\r\n else:\r\n s += 'aa'\r\n\r\nif n%2 and (n//2)%2:\r\n s += 'b'\r\nelif n%2:\r\n s += 'a'\r\n\r\nprint(s.strip())\r\n", "n = int(input())\r\ns = \"aabb\"\r\n\r\nwhile n:\r\n n -= 1\r\n print(s[(n % 4) - 1], end=\"\")", "n=int(input())\r\nprint(\"aabb\"*(n//4),(\"a\"*(n%4) if n%4<=2 else \"aab\"),sep=\"\")", "import sys\r\n\r\nnum_args = 1\r\nargs = []\r\ni = 0\r\nfor line in sys.stdin:\r\n args.append(line)\r\n i += 1\r\n if i >= num_args:\r\n break\r\n\r\nnum = int(args[0])\r\nprint(\"aabb\" * int(num / 4) + \"aabb\"[:num % 4])", "n = int(input())\nd, r = divmod(n, 4)\nres = \"aabb\" * d + \"aabb\"[:r]\nprint(res)\n", "n = int(input())\r\nprint((\"bbaa\" * n)[:n])", "n=int(input())\r\nx=n//4+1\r\ns='aabb'*x\r\nprint(s[0:n])", "n = int(input())\r\n\r\nfor i in range(n):\r\n if i % 4 < 2:\r\n print(\"a\", end = \"\")\r\n else:\r\n print(\"b\", end = \"\")", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn=int(input())\r\ns=['b','b','a','a']\r\ni=1\r\nans=''\r\nwhile i<=n:\r\n ans+=str(s[i%4-1])\r\n i+=1\r\nprint(ans)\r\n\r\n", "n = int(input())\r\nm = n//4 + n%4\r\ntemp = m*'aabb'\r\nprint(temp[:n])", "n = int(input())\r\na = \"aabb\" * ((n // 4) + n % 4)\r\nprint(a[:n])", "n = int(input())\r\ns = \"\"\r\nfor i in range(n):\r\n if (i//2)%2 == 0:\r\n s += 'a'\r\n else:\r\n s += 'b'\r\nprint(s)", "from sys import stdin, stdout\r\nfrom functools import reduce\r\nimport math\r\n\r\ndef main():\r\n i=int(stdin.readline().strip())\r\n rem=i%4\r\n e='b' if rem==1 else 'bb' if rem==2 else 'bba' if rem==3 else ''\r\n s='bbaa'*(i//4)+e\r\n return s\r\n\r\nstdout.write(str(main()))\r\n", "n=int(input())\r\nl=['a']\r\nfor i in range(1,n):\r\n if(i==1):\r\n l.append('b')\r\n else:\r\n if(l[i-1]!=l[i-2]):\r\n l.append(l[i-1])\r\n else:\r\n if(l[i-2]=='a'):\r\n l.append('b')\r\n else:\r\n l.append('a')\r\nprint(''.join(l))", "n = int(input())\ns = 'abba'\nif n%4 == 0:\n print(s*(n//4))\nif n%4 == 1:\n print(s*(n//4)+'a')\nif n%4 == 2:\n print(s*(n//4)+'ab')\nif n%4 == 3:\n print(s*(n//4)+'abb')", "print((\"aabb\"*5000000)[:int(input())])", "n = int(input())\r\nprint('aabb'*(n//4) + 'aabbc'[:n%4])", "n=int(input())\r\nans=\"aabb\"*n\r\nprint(ans[:n])", "#3-palindrome\r\nn=int(input())\r\ns='aabb'*10000000\r\nprint(s[0:n])", "n = int(input())\ns = \"\"\ns1 = \"aabb\"\nif n == 1:\n print(\"a\")\nelif n == 2:\n print(\"aa\")\nelif n == 3:\n print(\"aab\")\nelif n % 4 == 0:\n s = s1 * (n//4)\nelif (n - 1) % 4 == 0:\n s = (s1 * (n//4) ) + \"a\"\nelif (n - 2) % 4 == 0:\n s = (s1 * (n//4) ) + \"aa\"\nelif (n-3) % 4 == 0:\n s = (s1 * (n//4) ) + \"aab\"\n \n\n\nprint(s)\n", "\r\nn=int(input())\r\ns='aabb'*10000000\r\nprint(s[:n])\r\n", "n=int(input())\r\nans=[\"a\"]\r\nfor i in range(2*10**5):\r\n ans.append(\"b\")\r\n ans.append(\"b\")\r\n ans.append(\"a\")\r\n ans.append(\"a\")\r\nfor i in range(n):\r\n print(ans[i],end=\"\")\r\n", "n=int(input())\r\ne='aabb'\r\nif(n%4==0):\r\n s=('aabb'*(n//4))\r\n print(s)\r\nelse:\r\n s=('aabb'*(n//4))\r\n s=s+e[0:(n%4)]\r\n print(s)", "s = 'bbaa'\r\n\r\nn = int(input())\r\n\r\nprint(s*(n//4) + s[:(n%4)])", "import sys\r\ninput = sys.stdin.readline\r\na = int(input())\r\nres = \"abba\" * (a//4)\r\nrem = a % 4\r\nadd = (\"abba\")[:rem]\r\nprint(res + add)", "n=int(input())\r\nif n==2:\r\n\tprint(\"aa\")\r\nelse:\r\n\tl=\"aabb\"\r\n\tx=n//4\r\n\ty=n%4\r\n\ts=l*x\r\n\ts+=l[:y]\r\n\tprint(s)", "a=int(input())\r\nif a%4==0:\r\n print(\"aabb\"*(a//4))\r\nelif a%4==1:\r\n print(\"b\"+\"aabb\"*(a//4))\r\nelif a%4==2:\r\n print(\"bb\"+\"aabb\"*(a//4))\r\nelse:\r\n print(\"abb\"+\"aabb\"*(a//4))", "n=int(input())\r\ns='aabb'\r\nif(n<=4):\r\n print(s[:n])\r\nelse:\r\n q=n//4\r\n r=n%4\r\n print((s*q)+(s[:r]))\r\n", "s=''\r\nfor i in range(int(input())):\r\n if i%4<2:\r\n s+='a'\r\n else:\r\n s+='b'\r\nprint(s)\r\n", "n = int(input())\r\na = 'abba'*n\r\nprint(a[:n])", "# https://codeforces.com/contest/805/problem/B\n\n# generate aabbaabbaabb....\n\na = input()\na = int(a)\n\nfg = 1\nres = ''\nfor i in range(a):\n if i % 2 == 0:\n fg *= -1\n if fg == 1:\n res += 'b'\n else:\n res += 'a'\n\nprint(res)\n", "n = int(input())\r\ns = \"bbaa\"\r\nfor i in range(n):\r\n\tprint(s[i%4],end=\"\")\r\n", "n=int(input())\r\ns=''\r\nc='a'\r\nfor i in range(n//2+1):\r\n if c=='a':\r\n s=s+'aa'\r\n c='b'\r\n else:\r\n s=s+'bb'\r\n c='a'\r\nprint(s[0:n])", "n = int(input())\r\nc = []\r\n\r\nfor i in range(n):\r\n r = i % 4\r\n if r < 2:\r\n c.append('a')\r\n else:\r\n c.append('b')\r\nfor i in c:\r\n print(i, end = '')\r\nprint()", "x=int(input())\ns=\"\"\nA=\"bb\"\nfor i in range(x//2):\n if A==\"aa\":A=\"bb\" \n else:A=\"aa\"\n s+=A\nif x%2==0:print(s)\nelse:print(s+\"b\" if A==\"aa\" else s+\"a\")", "n=int(input())\r\ns='aabb'*n\r\nprint(s[:n])", "n = int(input())\r\ns=\"\"\r\na=0\r\nif n%2==0:\r\n\t#s = \"aa\"\r\n\tprint(\"aa\", end='')\r\n\ta=2\r\nelse:\r\n\tprint('b', end='')\r\n\ta=1\r\nfor i in range(a,n,2):\r\n\t#print(i)\r\n\tif (i//2)%2 ==0:\r\n\t\tprint(\"aa\", end='')\r\n\telse:\r\n\t\tprint(\"bb\", end='')", "n=int(input())\r\nfor i in range(n):\r\n if i%4==0 or i%4==3:\r\n print('a',end='')\r\n else:\r\n print('b',end='')", "n = int(input())\ns = 'abba'\nprint(n // 4 * s + s[:n % 4])\n", "n = int(input())\r\nprint((\"aabb\" * 50000)[:n])", "def solve(n):\n answer = ['a']*n \n for i in range(2, n):\n if answer[i]==answer[i-2]:\n answer[i] = 'b'\n return \"\".join(answer)\n \n \n \n \n \n\nn = int(input())\nans = solve(n)\nprint(ans)\n \t\t\t \t\t\t \t \t\t \t\t \t \t \t\t\t\t\t", "n=int(input())\r\nst=\"\"\r\np=n%4\r\ns=n//4\r\nwhile s:\r\n st+=\"aabb\"\r\n s-=1\r\nif p<3:\r\n st+='a'*p\r\nelse:\r\n st+='aab'\r\nprint(st)", "def calc(n):\r\n unit='aabb'\r\n # print(unit[:3])\r\n if n==1:\r\n print('a')\r\n elif n==2:\r\n print('aa')\r\n elif n==3:\r\n print('aab')\r\n else:\r\n st=''\r\n for i in range(n//4):\r\n st+=unit\r\n st+=unit[:n%4]\r\n print(st)\r\n\r\n\r\nn=int(input())\r\ncalc(n)", "n = int(input())\r\n\r\ncol_aabb = n // 4\r\nb = n % 4\r\n\r\nans = 'aabb' * col_aabb\r\n\r\nif b > 2:\r\n ans += 'aab'\r\nelse:\r\n ans += 'a' * b\r\n\r\nprint(ans)", "n=int(input())\r\nprint((\"aabb\"*n)[:n])", "n = int(input())\npattern = ['a', 'a', 'b', 'b']\nans = ''\nfor i in range(n):\n ans += pattern[i % 4]\nprint(ans)\n", "n = int(input())\nx = 'aabb'\nprint(x * (n // 4), end='')\nn %= 4\nif n == 1:\n print('a')\nelif n == 2:\n print('aa')\nelif n == 3:\n print('aab')\n\n", "n = int(input())\r\ns='abbaabbaabba'\r\nx = n//12\r\nr=n%12\r\nmim = s*x+s[:r]\r\nprint(mim)\r\n", "print(*['a' if (e % 4 == 1 or e % 4 == 2) else 'b' for e in range(int(input()))], sep=\"\")", "n=int(input())\r\nfor i in range (n):\r\n if(i%4==0 or i%4==3):\r\n print(\"a\",end=\"\")\r\n elif(i%4==2 or i%4==1):\r\n print(\"b\",end=\"\")\r\n", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i%4==1 or i%4==2:\r\n print('a',end='')\r\n else:\r\n print('b',end='')", "n = int(input())\r\ns = \"aabb\"*(n//4)\r\na = n%4\r\nif a==0:\r\n print(s)\r\nelif a==1:\r\n print(s+\"a\")\r\nelif a==2:\r\n print(s+\"aa\")\r\nelif a==3:\r\n print(s+\"aab\")", "n=int(input())\r\nstring='abba'*n\r\n\r\n\r\n \r\n \r\nprint(string[:n])", "n = int(input())\r\nstr1 = \"aabb\"*(2*10**5)\r\nprint(str1[:n])", "n = int(input())\r\nprint(('aabb' * 100000)[:n])", "n = int(input())\n\nv = ['a',['aa','bb'],'aab','aabb']\nif n == 1:\n\tprint('a')\nelif n == 2:\n\tprint('ab')\nelif n == 3:\n\tprint('aab')\nelif n == 4:\n\tprint('aabb')\nelse:\n\ts = 'aabb'\n\twhile len(s) < n:\n\t\ts += s\n\n\tprint(s[:n])", "# cook your dish here\r\nn = int(input())\r\nres = \"\"\r\nres+=(\"aabb\"*(n//4))\r\nif n%4 == 1:\r\n res+=(\"a\")\r\nelif n%4 == 2:\r\n res+=(\"aa\")\r\nelif n%4 == 3:\r\n res+=(\"aab\")\r\nprint(res)\r\n ", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\nprint(\"{}\".format((\"aabb\" * (n // 4)) + (\"aabb\"[:(n % 4)])))", "n = int(input())\r\nr = 'aabb' * n\r\nprint(*r[:n], sep='')\r\n", "n=int(input())\r\nfor i in range(1,n+1):\r\n if i%4==1 or i%4==2:print('a',end='')\r\n else:print('b',end='')", "n=int(input())\n\nfor i in range(n):\n\tif i % 4 in (0,1):\n\t\tprint('a', end='')\n\telse:\n\t\tprint('b', end='')\n\nprint('')\n", "x='aabb'\r\nn=int(input())\r\nprint(x*(n//4)+x[:n%4])", "n=int(input())\r\ns=\"aabb\"*100000\r\nprint(s[:n])", "s = \"aabb\"*50000; print(s[:int(input())])", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\n\r\nn = int(stdin.readline())\r\n\r\nans = []\r\n\r\ns = \"aabb\"\r\n\r\nfor i in range(n):\r\n\r\n ans.append( s[i % 4] )\r\n\r\nprint (\"\".join(ans))\r\n\r\n" ]

[ "n = int(input())\nm = set()\n\ndef dfs(num, x, y):\n global n\n if num == 0 or num > n:\n return\n m.add(num)\n num *= 10\n dfs(num + x, x, y)\n dfs(num + y, x, y)\n\nfor x in range(10):\n for y in range(10):\n if x == y:\n continue\n dfs(x, x, y)\n\nprint(len(m))\n\n", "def decimalToBinary(n):\r\n return bin(n).replace(\"0b\", \"\")\r\narr=[]\r\nfor x in range(1,10):\r\n for y in range(10):\r\n for i in range(1024):\r\n v=decimalToBinary(i)\r\n v=v.replace('1',str(x))\r\n v=v.replace('0',str(y))\r\n arr.append(int(v))\r\n v=v.replace(str(x),'1')\r\n v=v.replace(str(y),'0')\r\n v=v.replace('1',str(y))\r\n v=v.replace('0',str(x))\r\n arr.append(int(v))\r\n\r\narr1=list(set(arr))\r\narr1.sort()\r\nn = int(input())\r\ncnt=0\r\nfor i in arr1:\r\n if i<=n:\r\n cnt+=1\r\nprint(cnt-1)\r\n\r\n", "n = []\r\nfor i in range(0, 10):\r\n for j in range(0, 10):\r\n for k in range(1024):\r\n b = bin(k)[2:]\r\n num = b.replace('1',str(i))\r\n n.append(int(num.replace('0',str(j))))\r\nn = list(set(n))\r\nn.sort()\r\nn.pop(0)\r\ninp = int(input())\r\ncnt = 0\r\nfor i in n:\r\n if i <= inp :\r\n cnt += 1\r\nprint(cnt)\r\n", "n=int(input())\na=[]\ndef foo(x,i,j):\n if x>n:\n return\n if x:\n a.append(x)\n if 10*x+i!=x:\n foo(10*x+i,i,j)\n foo(10*x+j,i,j)\nfor i in range(10):\n for j in range(i+1,10):\n foo(0,i,j)\nprint(len(set(a)))\n", "import datetime\r\n\r\n\r\ndef only_two_digits(number):\r\n uniquedigits = set(str(number))\r\n\r\n # if unique digits are 1 or two then count the number as undoubtedly lucky\r\n if len(uniquedigits) <= 2:\r\n return True\r\n\r\n return False\r\n\r\n\r\nanswer = 0\r\n\r\n\r\ndef generate_all(number, n):\r\n global answer\r\n\r\n if number > 0 and number <= n:\r\n answer += 1\r\n # print(number, only_two_digits(number))\r\n\r\n if number >= n:\r\n return\r\n\r\n for i in range(0, 10):\r\n next_number = number * 10 + i\r\n if next_number > 0 and only_two_digits(next_number):\r\n generate_all(next_number, n)\r\n\r\n\r\ndef solve():\r\n num = int(input().strip())\r\n\r\n count = 0\r\n\r\n # List valid numbers\r\n generate_all(0, num)\r\n\r\n print(answer)\r\n\r\n\r\n# import time\r\n\r\n# start = time.time()\r\nsolve()\r\n# end = time.time()\r\n# print(end - start)\r\n", "'''\r\n# Feder and new game\r\nn,m,k = map(int,input().split())\r\nli=[]\r\nfor i in range(m+1):\r\n li.append(int(input()))\r\nout = 0\r\nfor i in range(m):\r\n xor = bin(li[i]^li[-1])[2:]\r\n if xor.count(\"1\")<=k:\r\n out+=1\r\nprint(out)\r\n \r\n'''\r\nlis = []\r\nfor i in range(0,10):\r\n for j in range(0,10):\r\n for k in range(0,10):\r\n for l in range(0,2**k):\r\n b = bin(l)[2:]\r\n b = b.zfill(k)\r\n b = b.replace(\"0\",str(i))\r\n b = b.replace(\"1\",str(j))\r\n lis.append(int(b))\r\ncount = 0\r\nlis = set(lis)\r\na = int(input())\r\nfor m in lis:\r\n if int(m)<=a:\r\n count+=1\r\nif a==10**9:\r\n print(count)\r\nelse:\r\n print(count-1)\r\n", "list1 = []\r\nfor x in range(0,10):\r\n for y in range(x+1,10):\r\n for l in range(1,1024):\r\n s = bin(l)[2:]\r\n imp = s\r\n s = s.replace('1',str(y))\r\n s = s.replace('0',str(x))\r\n list1.append(int(s))\r\n imp = imp.replace('0',str(y))\r\n imp = imp.replace('1',str(x))\r\n list1.append(int(imp))\r\nlist1 = list(set(list1))\r\nlist1.sort()\r\nlist1.pop(0)\r\nn = int(input())\r\nc = 0\r\nfor i in list1:\r\n if i<=n:\r\n c+=1\r\nprint(c)", "list1 = []\r\nfor x in range(0,10):\r\n for y in range(0,10):\r\n for i in range(1,10):\r\n for j in range(0,(2**i)+1):\r\n bn = bin(j)\r\n bn = bn[2:]\r\n c = bn.zfill(i)\r\n temp=c.replace(\"0\",str(x))\r\n res=temp.replace(\"1\",str(y))\r\n list1.append(int(res))\r\nlist1=sorted(list(set(list1)))\r\ninp1 = int(input())\r\nans=-1\r\nfor x in range(len(list1)):\r\n if int(list1[x]) <= inp1:\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n", "# if num>x stop , if num is repeated dont count , \r\n# import sys\r\n# sys.setrecursionlimit(10000)\r\ndef undounted(num):\r\n global i,b,x,z,lst\r\n if num>x:\r\n return\r\n else:\r\n if num not in lst:\r\n lst.append(num)\r\n z+=1\r\n return undounted(num*10+i),undounted(num*10+b)\r\ndef zero(num):\r\n global i,b,lst,z\r\n num = int(num)\r\n if num>x:\r\n return\r\n else:\r\n if num not in lst:\r\n lst.append(num)\r\n z+=1\r\n return zero(str(num)+str(b)),zero(str(num)+'0')\r\nx = int(input())\r\nz = 0\r\nlst = []\r\nfor i in range(1,10):\r\n for b in range(1,10):\r\n undounted(b)\r\n if i==1:\r\n zero(b)\r\nprint(z)", "# https://codeforces.com/contest/244/problem/B\r\n\r\ndef gen(digit, x, length, S):\r\n S.append(x)\r\n \r\n if length == 10:\r\n return\r\n \r\n if len(digit) == 1:\r\n for i in range(0, 10):\r\n next_x = x * 10 + i\r\n \r\n if i == digit[0]: \r\n gen(digit, next_x, length+1, S)\r\n else:\r\n gen(digit+[i], next_x, length+1, S)\r\n \r\n else:\r\n next_x1 = x * 10 + digit[0]\r\n next_x2 = x * 10 + digit[1]\r\n gen(digit, next_x1, length+1, S)\r\n gen(digit, next_x2, length+1, S)\r\n \r\nS = []\r\nfor i in range(1, 10):\r\n gen([i], i, 1, S)\r\n \r\nS = sorted(S) \r\nx = int(input())\r\n\r\nl = -1\r\nu = len(S)\r\n\r\nwhile u-l>1:\r\n md = (u+l) // 2\r\n if x >= S[md]:\r\n l = md\r\n else:\r\n u = md\r\nprint(u) ", "# 467 Fedor and game\r\n'''\r\nn,m,k = map(int,input().split())\r\narray = []\r\nfor i in range(m+1):\r\n\tj = input()\r\n\tarray.append(j)\r\n\r\ncout = 0\r\nfor i in range(m):\r\n\tXor = bin(int(array[i])^int(array[-1]))[2:]\r\n\tif Xor.count('1') <= k:\r\n\t\tcout += 1\r\nprint(cout)\r\n'''\r\narray = []\r\nfor x in range(0,10):\r\n for y in range(0,10):\r\n for i in range(0,10):\r\n for j in range(0,2**i):\r\n b = bin(j)[2:]\r\n b = b.zfill(i)\r\n b = b.replace(\"0\",str(x))\r\n b = b.replace(\"1\",str(y))\r\n array.append(int(b))\r\ncout = 0\r\narray = set(array)\r\na = int(input())\r\nfor k in array:\r\n if int(k) <= a:\r\n cout += 1\r\nif a == 10**9:\r\n print(cout)\r\nelse:\r\n print(cout-1)\r\n", "#CF Round 150. Div II Prob. A - Dividing Orange\r\nimport sys\r\n\r\ndp = [[[-1 for j in range(3)] for i in range (1 << 10)] for k in range(11)]\r\n\r\nIn = sys.stdin\r\nn = In.readline().strip()\r\n\r\ndef go (idx, mask, equal):\r\n if dp[idx][mask][equal] != -1:\r\n return dp[idx][mask][equal]\r\n if bin(mask).count(\"1\") > 2:\r\n return 0\r\n if idx == len(n):\r\n return 1\r\n res = 0\r\n if idx == 0 or equal == 2:\r\n res += go(idx + 1, mask, 2)\r\n elif equal == 1 and int(n[idx]) == 0:\r\n res += go(idx + 1, mask | 1, 1)\r\n else:\r\n res += go(idx + 1, mask | 1, 0) \r\n for i in range(1, 10):\r\n if equal == 1 and i > int(n[idx]):\r\n break\r\n elif equal == 1 and i == int(n[idx]):\r\n res += go(idx + 1, mask | (1 << i), 1)\r\n else:\r\n res += go(idx + 1, mask | (1 << i), 0)\r\n dp[idx][mask][equal] = res\r\n return res\r\n \r\nprint(go(0, 0, 1) - 1)", "#d=sorted(d,key=lambda x:(len(d[x]),-x)) d=dictionary d={x:set() for x in arr}\r\n#n=int(input())\r\n#n,m,k= map(int, input().split())\r\nimport heapq\r\n#for _ in range(int(input())):\r\n#n,k=map(int, input().split())\r\n#input=sys.stdin.buffer.readline\r\n#for _ in range(int(input())):\r\ndef dfs(x):\r\n if 0< x <=n :\r\n s.add(x)\r\n x*=10\r\n dfs(x+i)\r\n dfs(x+j)\r\n\r\nn=int(input())\r\n#arr = list(map(int, input().split()))\r\ns=set()\r\n\r\nfor i in range(1,10):\r\n for j in range(10):\r\n dfs(i)\r\nprint(len(s))\r\n", "list1 = []\r\nfor x in range(10):\r\n for y in range(10):\r\n for l in range(0,10):\r\n for i in range((2**l)+1):\r\n n = (bin(i)[2:]).zfill(l)\r\n str1 = \"\"\r\n for k in n:\r\n if k == \"0\":\r\n str1 += str(x)\r\n else:\r\n str1 += str(y)\r\n list1.append(int(str1))\r\na = int(input())\r\nlist1 = list(set(list1))\r\nlist1 = list1[1:]\r\nans = 0\r\nfor i in range(len(list1)):\r\n if list1[i] <= a:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nuse=set()\r\ndef calc(x,a,b):\r\n global cnt\r\n if int(x)<=n and not int(x) in use:\r\n use.add(int(x))\r\n elif int(x)>n:\r\n return\r\n calc(x+a,a,b)\r\n calc(x+b,a,b)\r\ndef calc2(x,a):\r\n global cnt\r\n if int(x)<=n and not int(x) in use:\r\n use.add(int(x))\r\n elif int(x)>n:\r\n return\r\n calc2(x+a,a)\r\nfor i in range(1,10):\r\n calc2(str(i),str(i))\r\nfor i in range(10):\r\n for j in range(i+1,10):\r\n if i!=0:\r\n calc(str(i),str(i),str(j))\r\n calc(str(j),str(i),str(j))\r\nprint(len(use))", "#!/usr/bin/python3.6\r\n# -*- coding: utf-8 -*-\r\n# @Time : 2020/12/4 1:44 PM\r\n# @Author : Songtao Li\r\ns = set()\r\n\r\n\r\ndef DFS(x, y, num, max_n):\r\n s.add(num)\r\n num_x = 10 * num + x\r\n num_y = 10 * num + y\r\n if num_x and num_x <= max_n:\r\n DFS(x, y, num_x, max_n)\r\n if num_y and num_y <= max_n:\r\n DFS(x, y, num_y, max_n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n for i in range(10):\r\n for j in range(i, 10):\r\n DFS(i, j, 0, n)\r\n print(len(s)-1)\r\n", "n=int(input())\r\ncurr=list([i for i in range(1,100)]) \r\ncurr=set(curr)\r\ndef isvalid(x):\r\n if x<1 or x>10**9:\r\n return 0 \r\n if len(set(str(x)))<=2:\r\n return 1 \r\ncnt=0 \r\nwhile cnt<=10**5 :\r\n curr1=set()\r\n for i in curr:\r\n for j in range(10):\r\n if isvalid(i*10+j):\r\n curr1.add(i*10+j)\r\n # print('hi')\r\n cnt+=1 \r\n #print(curr1)\r\n curr|=curr1 \r\ncurr=sorted(list(curr))\r\n#print(curr)\r\nans=0 \r\nfor i in curr:\r\n if i>=1 and i<=n:\r\n ans+=1 \r\n elif i>n:\r\n break \r\nprint(ans)", "def bepi(n):\r\n l=[0]*(10000)\r\n mp={}\r\n x=0\r\n y=0\r\n ans=0\r\n while(x<10):\r\n y=x+1\r\n while(y<10):\r\n w=0\r\n r=0\r\n if x!=0 and x<=n:\r\n l[w]=x\r\n w+=1\r\n if y!=0 and y<=n:\r\n l[w]=y\r\n w+=1\r\n while(r<w):\r\n t=l[r]\r\n if t*10+x <= n:\r\n l[w]=t*10+x\r\n w+=1\r\n if t*10+y <=n:\r\n l[w]=t*10+y\r\n w+=1\r\n r+=1\r\n r=0\r\n while(r<w):\r\n if not l[r] in mp:\r\n ans+=1\r\n mp[l[r]]=1\r\n r+=1\r\n y+=1\r\n x+=1\r\n return ans\r\n\r\n\r\nn=int(input())\r\nprint(bepi(n))\r\n", "# Time Complexity: O(log n)\n# Space Complexity: O(n)\n# The solution chooses two digits, x and y, and try every combination of those\n# digits which is below n. There are less than 100 ways to choose two unique\n# digits and every depth-first search tree will have a height of log n.\n# Therefore, the solution can find every undoubtedly lucky number in O(log n)\nn = int(input())\nm = set()\n\ndef dfs(num, x, y):\n global n\n if num == 0 or num > n:\n return\n m.add(num)\n num *= 10\n dfs(num + x, x, y)\n dfs(num + y, x, y)\n\nfor x in range(10):\n for y in range(10):\n if x == y:\n continue\n dfs(x, x, y)\n\nprint(len(m))\n \t\t \t\t \t \t \t \t \t \t", "num=int(input());cou=0;\r\ndef traverse(x):\r\n if(x>num):return\r\n global cou\r\n if(len(set([int(j) for j in str(x)]))<=2):\r\n cou+=1\r\n for i in range(0,10):traverse(10*x+i)\r\nfor i in range(1,10):traverse(i)\r\nprint(cou)", "a = []\r\nz = []\r\nfor i in range(1,1025):\r\n k = bin(i)\r\n a.append(k[2:])\r\nfor m in range(len(a)):\r\n for j in range(0,10):\r\n for k in range(0,10):\r\n temp = a[m]\r\n temp = temp.replace('0','#')\r\n temp = temp.replace('1',str(k))\r\n temp = temp.replace('#',str(j))\r\n z.append(int(temp))\r\nz = list(set(z))\r\nz.sort()\r\nn = int(input())\r\nfor i in range(len(z)):\r\n if n < z[i]:\r\n print(i-1)\r\n break", "s = set()\ndef find(x, y, num):\n s.add(num)\n xx = x + num * 10;\n yy = y + num * 10;\n if (xx <= n and xx != 0):\n find(x, y, xx);\n if (yy <= n and yy != 0):\n find(x, y, yy);\n\nn = int(input())\nfor i in range(1,10):\n for j in range(0,10):\n find(i,j,0)\nprint(len(s) - 1)\n\n \t\t\t \t\t\t \t \t\t\t \t \t \t \t\t", "lis=[]\r\nfor x in range(10):\r\n for y in range(10):\r\n for i in range(0,10):\r\n for j in range((2**i)+1):\r\n bn=(bin(j)[2:]).zfill(i)\r\n \r\n ans=''\r\n for k in bn:\r\n if k=='0':\r\n ans+=str(x)\r\n else:\r\n ans+=str(y)\r\n lis.append(int(ans)) \r\nlis=((list(set(lis))))\r\na=int(input())\r\nans=0\r\nfor i in range(len(lis)):\r\n if lis[i]<=a and lis[i]!=0:\r\n ans+=1\r\n\r\nprint(ans)", "n = int(input())\r\nres = set()\r\n\r\ndef solve(p, l):\r\n if p > n or l > 10:\r\n return\r\n if p > 0:\r\n res.add(p)\r\n solve(p * 10 + a, l + 1)\r\n solve(p * 10 + b, l + 1)\r\n\r\nfor a in range(0, 10):\r\n for b in range(0, a):\r\n solve(0, 0)\r\nprint(len(res))\r\n", "A = []\r\nfor i in range(2**10):\r\n LIST1 = bin(i)[2:]\r\n A.append(LIST1)\r\nLIST2 = []\r\nfor bin in A:\r\n for i in range(10):\r\n for j in range(10):\r\n LIST1 = bin\r\n LIST1 = LIST1.replace(\"0\", \"#\")\r\n LIST1 = LIST1.replace(\"1\", str(j))\r\n LIST1 = LIST1.replace(\"#\", str(i))\r\n LIST2.append(int(LIST1))\r\nLIST2 = list(set(LIST2))\r\nLIST2.sort()\r\nn = int(input())\r\nfor i in range(1, len(LIST2)):\r\n if(LIST2[i] > n):\r\n print(i - 1)\r\n break\r\n\r\n", "res = []\r\n\r\nfor x in range(0,10):\r\n for y in range(0,10):\r\n for i in range(0,10):\r\n for j in range(0,2**i):\r\n b = bin(j)[2:]\r\n b = b.zfill(i)\r\n b = b.replace(\"0\",str(x))\r\n b = b.replace(\"1\",str(y))\r\n res.append(int(b))\r\n \r\n \r\ncount = 0\r\nres = set(res)\r\na = int(input())\r\n\r\nfor k in res:\r\n if int(k)<=a:\r\n count+=1\r\nif a==10**9:\r\n print(count)\r\nelse:\r\n print(count-1)", "s=set()\r\n\r\ndef f(x,y,z):\r\n s.add(z)\r\n x_=x+z*10\r\n y_=y+z*10\r\n if x_<=n and x_!=0: f(x,y,x_)\r\n if y_<=n and y_!=0: f(x,y,y_)\r\n\r\nn=int(input())\r\nfor i in range(1,10):\r\n for j in range(0,10):\r\n f(i,j,0)\r\n \r\nprint(len(s)-1)\r\n", "from sys import stdin, stdout\ninput = stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n\tstdout.write(sep.join(map(str, args)) + end)\ndef int_map():\n\treturn map(int, input().split())\ndef list_int():\n\treturn list(map(int, input().split()))\n\ndef genn(v, x, y):\n\tif not x and not y:\n\t\treturn\n\n\tglobal alll\n\tif v > 10**9:\n\t\treturn\n\tif v or x:\n\t\tgenn(v*10 + x, x, y)\n\tif v or y:\n\t\tgenn(v*10 + y, x, y)\n\talll.append(v)\n\n\n\nalll = []\nfor i in range(10):\n\tfor j in range(10):\n\t\tgenn(i, i, j)\n\t\tgenn(j, i, j)\nalll = sorted(set(alll))\ntarget = int(input())\nl, r = 0, len(alll) - 1\nindx = -1\nwhile l <= r:\n\tmid = l + (r - l) // 2\n\tif alll[mid] <= target:\n\t\tindx = mid\n\t\tl = mid + 1\n\telse:\n\t\tr = mid - 1\nprint(indx)\n\n\n\n", "n = int(input())\r\nans = 0\r\n\r\ndef dfs(num):\r\n global ans\r\n if num > 0 and num <= n:\r\n ans += 1\r\n if num >= 10**9:\r\n return\r\n for a in range(10):\r\n new = 10*num+a\r\n if new > 0:\r\n if len(set(str(new))) <= 2:\r\n dfs(new)\r\n\r\ndfs(0)\r\nprint(ans)", "def bepi(n):\r\n lst=[0]*(10000)\r\n dc={}\r\n i=0\r\n ans=0\r\n while(i<10):\r\n j=i+1\r\n while(j<10):\r\n a=0\r\n b=0\r\n if i!=0 and i<=n:\r\n lst[a]=i\r\n a+=1\r\n if j!=0 and j<=n:\r\n lst[a]=j\r\n a+=1\r\n while(b<a):\r\n tmp=lst[b]\r\n if (tmp*10)+i<=n:\r\n lst[a]=(tmp*10)+i\r\n a+=1\r\n if (tmp*10)+j<=n:\r\n lst[a]=(tmp*10)+j\r\n a+=1\r\n b+=1\r\n b=0\r\n while(b<a):\r\n if not lst[b] in dc:\r\n ans+=1\r\n dc[lst[b]]=1\r\n b+=1\r\n j+=1\r\n i+=1\r\n return ans\r\n\r\n\r\nn=int(input())\r\nprint(bepi(n))\r\n", "def dfs(k):\n if 0 < k <= n:\n s.add(k)\n k *= 10\n dfs(k + x)\n dfs(k + y)\n\n\nn = int(input())\ns = set()\nfor x in range(10):\n for y in range(10):\n dfs(x)\nprint(len(s))\n\t\t \t \t\t\t\t\t\t \t \t \t\t \t", "a = int(input())\r\nbn = []\r\nlbn = []\r\nfor i in range(1,1025):\r\n bn.append(bin(i)[2:])\r\nfor j in range(len(bn)):\r\n for k in range(10):\r\n for r in range(10):\r\n t = bn[j]\r\n t = t.replace('1',str(r))\r\n t = t.replace('0',str(k))\r\n lbn.append(int(t))\r\nlbn = list(set(lbn))\r\nlbn.sort()\r\nc = -1\r\nfor s in range(len(lbn)):\r\n if lbn[s] <= a:\r\n c += 1\r\nprint(c)", "def p(k):\r\n if 0 < k <= n:\r\n s.add(k)\r\n k *= 10\r\n p(k + x)\r\n p(k + y)\r\n\r\n\r\nn = int(input())\r\ns = set()\r\nfor x in range(10):\r\n for y in range(10):\r\n p(x)\r\nprint(len(s))\r\n", "def func(num):\n if 0 < num <= n:\n result.add(num)\n num *= 10\n func(num+x)\n func(num+y)\nif __name__ == \"__main__\":\n n = int(input())\n result = set()\n for x in range(10):\n for y in range(10):\n func(x)\n print(len(result))\n\t\t \t\t \t\t \t\t \t \t \t \t\t \t", "ii=lambda:int(input())\r\nkk=lambda:map(int, input().split())\r\nll=lambda:list(kk())\r\nq =[]\r\ns=set()\r\nn=ii()\r\nfor x in range(10):\r\n\tfor y in range(10):\r\n\t\tq.append(x)\r\n\t\twhile q:\r\n\t\t\tq2 = []\r\n\t\t\tfor item in q:\r\n\t\t\t\tif item > 0 and item <= n:\r\n\t\t\t\t\ts.add(item)\r\n\t\t\t\t\titem*=10\r\n\t\t\t\t\tq2.append(item+x)\r\n\t\t\t\t\tq2.append(item+y)\r\n\t\t\tq=q2\r\nprint(len(s))", "def cnt(s, p):\n\n ans = 0\n\n if p > s: ans = 0\n\n elif len(p) == len(s):\n\n ans = 1 if len(set(p.lstrip('0'))) <= 2 else 0\n\n elif len(set(p.lstrip('0'))) > 2: ans = 0\n\n elif s[:len(p)] > p:\n\n if len(set(p.lstrip('0'))) == 2:\n\n ans = 2**(len(s)-len(p))\n\n elif len(set(p.lstrip('0'))) == 1:\n\n ans = 1 + 9 * (2**(len(s)-len(p)) - 1)\n\n else:\n\n # ab for all a, b != 0\n\n ans = 10 + 45 * (2**(len(s)-len(p)) - 2)\n\n ans += 36 * sum([2**l-2 for l in range(2,len(s)-len(p))])\n\n \n\n else: ans = sum(cnt(s, p+c) for c in '0123456789')\n\n\n\n return ans\n\n\n\nprint(cnt(input().strip(), '')-1)\n\n\n\n\n\n# Made By Mostafa_Khaled", "nset = set()\nn = int(input())\ndef reslove(x, y, num, flag):\n if num > n or (flag and num == 0):\n return\n if num > 0:\n nset.add(num)\n reslove(x, y, num * 10 + x, True)\n reslove(x, y, num * 10 + y, True)\n\n\nfor i in range(10):\n for j in range(i + 1, 10):\n reslove(i, j, 0, False)\nprint(len(nset))\n\n \t \t\t \t \t\t \t \t \t \t \t\t \t\t \t", "n=int(input())\r\n\r\ndef bruteforce(number):\r\n res=0\r\n liste=[]\r\n while number>0:\r\n integer=number%10\r\n if integer not in liste:\r\n liste.append(integer)\r\n \r\n number=number//10\r\n return len(liste)<=2\r\n\r\nanswer=[0]\r\n\r\ndef dfs(num):\r\n if (num>0 and num<=n):\r\n answer[0]+=1\r\n for a in range(10):\r\n if bruteforce(num*10+a):\r\n dfs(num*10+a)\r\n\r\nfor chiffre in range(1,10):\r\n dfs(chiffre)\r\n\r\nprint(answer[0])", "n=int(input())\r\ng=len(str(n))\r\nc=0\r\ndef sol(k,l):\r\n global c\r\n if k and int(k)>n:\r\n return\r\n if len(set(k))>2:\r\n return\r\n if l>g:\r\n return\r\n if k:\r\n c+=1\r\n for i in range(0 if k else 1,10):\r\n sol(k+str(i),l+1)\r\nsol(\"\",0)\r\nprint(c)", "from copy import deepcopy\r\n\r\nN = input()\r\nA = [ ord( N[ i ] ) - ord( '0' ) for i in range( len( N ) ) ]\r\n\r\ndp = [ 0, 0 ]\r\ndp = [ deepcopy( dp ) for i in range( 10 + 1 ) ]\r\ndp = [ deepcopy( dp ) for i in range( 10 + 1 ) ]\r\ndp = [ deepcopy( dp ) for i in range( len( A ) + 1 ) ]\r\ndp[ 0 ][ 10 ][ 10 ][ 0 ] = 1\r\n\r\nfor i in range( len( A ) ):\r\n for j in range( 10 + 1 ):\r\n for k in range( 10 + 1 ):\r\n for l in range( 2 ):\r\n lim = 9\r\n if not l:\r\n lim = A[ i ]\r\n for d in range( lim + 1 ):\r\n if d == 0 and j == 10 and k == 10:\r\n dp[ i + 1 ][ 10 ][ 10 ][ 1 ] += dp[ i ][ j ][ k ][ l ]\r\n else:\r\n if j == 10 or j == d:\r\n dp[ i + 1 ][ d ][ k ][ l or d < lim ] += dp[ i ][ j ][ k ][ l ]\r\n else:\r\n if k == 10:\r\n if d < j:\r\n dp[ i + 1 ][ d ][ j ][ l or d < lim ] += dp[ i ][ j ][ k ][ l ]\r\n else:\r\n dp[ i + 1 ][ j ][ d ][ l or d < lim ] += dp[ i ][ j ][ k ][ l ]\r\n else:\r\n if d != j and d != k: continue\r\n dp[ i + 1 ][ j ][ k ][ l or d < lim ] += dp[ i ][ j ][ k ][ l ]\r\n\r\nans = 0\r\nfor i in range( 10 ):\r\n for j in range( 10 + 1 ):\r\n for k in range( 2 ):\r\n ans += dp[ len( A ) ][ i ][ j ][ k ]\r\n\r\nprint( ans )\r\n", "def findNum(num):\n if 0 < num <= n:\n s.add(num)\n num*=10\n findNum(num+x)\n findNum(num+y)\n\nn = int(input())\ns = set()\nfor x in range(10):\n for y in range(10):\n findNum(x)\n\nprint(len(s))\n \t \t\t \t \t \t \t\t \t \t\t \t \t \t\t\t\t", "def find(x):\r\n if 0<x<=n:\r\n p.add(x)\r\n x*=10\r\n find(x+i)\r\n find(x+j)\r\nn=int(input())\r\np= set()\r\nfor i in range(10):\r\n for j in range(10):\r\n find(i)\r\nprint(len(p))\r\n\r\n", "arr = []\r\nnew = []\r\nfor i in range(1,1025):\r\n k = bin(i)\r\n arr.append(k[2:])\r\nfor m in range(len(arr)):\r\n for j in range(0,10):\r\n for k in range(0,10):\r\n temp = arr[m]\r\n temp = temp.replace('0','#')\r\n temp = temp.replace('1',str(k))\r\n temp = temp.replace('#',str(j))\r\n new.append(int(temp))\r\nx = list(set(new))\r\nx.sort()\r\nn = int(input())\r\nfor i in range(len(x)):\r\n if n < x[i]:\r\n print(i-1)\r\n break\r\n", "import sys\n\ninp = sys.stdin.readlines()\nn = int(inp.pop(0).replace('\\n',''))\nlucky = set()\n\ndef dfs(n, x, y, num, cntr):\n if num>n or (num == 0 and cntr >0):\n return\n if num > 0:\n lucky.add(num)\n dfs(n,x,y,num*10+x, cntr+1)\n dfs(n,x,y,num*10+y, cntr+1)\n\nfor i in range(10):\n for j in range(10):\n dfs(n,i, j, 0, 0)\n\nprint(len(lucky))\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 itertools import product\nn = int(input().strip())\nif n<102:\n print(n)\nelse:\n res = set()\n combination = (str(i)+str(j) for i in range(10) for j in range(i+1,10))\n for it in (product(comb,repeat=l) for comb in combination for l in range(1,len(str(n))+1)):\n for line in it:\n tmp = int(\"\".join(line))\n if tmp and tmp<=n:\n res.add(tmp)\n print(len(res))\n \t \t\t\t \t \t \t \t\t\t\t \t \t\t\t" ]

[ "n, t = int(input()), list(map(int, input().split()))\r\np = list(map(abs, t))\r\ns = sum(p)\r\nif n & 1 == 0 and len([0 for i in t if i < 0]) & 1: s -= 2 * min(p)\r\nprint(s)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(map(abs,a))\r\nk=0\r\nfor x in a:\r\n if x<0: k+=1\r\nif k%2==0 or n%2!=0:\r\n print(sum(b))\r\nelse:\r\n print(sum(b)-2*b[0])\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nneg = []\r\npos = []\r\nans = sum(arr)\r\nfor i in range(2*n - 1):\r\n if(arr[i]<0):\r\n neg.append(arr[i])\r\n pos.append(abs(arr[i]))\r\nif(len(neg)&1 and (n + 1) & 1):\r\n print(sum(pos) - 2*min(pos))\r\nelse:\r\n print(sum(pos))", "def main():\r\n\tn = int(input())\r\n\tseq = list(map(int, input().split()))\r\n\tneg = [x for x in seq if x < 0]\r\n\r\n\tseq = [abs(x) for x in seq]\r\n\tans = sum(seq)\r\n\r\n\tif n%2==0 and len(neg)%2==1:\r\n\t\tans = ans - (2 * sorted(seq)[0])\r\n\t\r\n\tprint(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor cc in a:\r\n #print(\"Element is: \" + str(cc))\r\n # Reverse sign\r\n if cc < 0:\r\n c += 1\r\n\r\nif 0 in a:\r\n #print(\"matched first condition\")\r\n print(sum(abs(x) for x in a))\r\nelif n % 2 == 0 and c % 2 == 1:\r\n #print(\"matched second condition\")\r\n print(sum(abs(x) for x in a) - 2*min(map(abs, a)))\r\nelse:\r\n #print(\"matched third condition\")\r\n print(sum(abs(x) for x in a))", "#!/bin/python\nn = int(input())\na = list(map(int, input().split()))\nc = 0\nfor cc in a:\n if cc < 0:\n c += 1\nif 0 in a:\n print(sum(abs(x) for x in a))\nelif n % 2 == 0 and c % 2 == 1:\n print(sum(abs(x) for x in a) - 2*min(map(abs, a)))\nelse:\n print(sum(abs(x) for x in a))\n", "n = int(input())\na = list(map(int, input().split()))\nc = list(map(abs, a))\nif len(list(filter(lambda x: x < 0, a))) & 1 and n + 1 & 1:\n print(sum(c) - 2 * min(c))\nelse:\n print(sum(c))\n\t\t\t\t \t \t\t \t \t\t\t \t \t", "n = int(input())\na = list(map(int, input().split()))\nb = 0\nfor i in a:\n if i < 0:\n b += 1\nc = list(map(abs, a))\nif b & 1 and n + 1 & 1:\n print(sum(c) - 2 * min(c))\nelse:\n print(sum(c))\n\t \t \t\t\t\t \t \t \t \t\t \t \t\t", "#!/usr/bin/python3\n\nn = int(input())\ndata = list(map(int, input().split()))\n\nnegative, zero, positive = 0, 0, 0\nfor x in data:\n if x < 0:\n negative += 1\n elif x == 0:\n zero += 1\n else:\n positive += 1\n\nseen = {}\nmin_negative = negative\n\ndef go(negative, positive):\n global n, min_negative\n if (negative, positive) in seen:\n return\n seen[(negative, positive)] = True\n min_negative = min(min_negative, negative)\n for i in range(min(n, negative)+1):\n for j in range(min(n-i, zero)+1):\n k = n - i - j\n if k <= positive:\n go(negative-i+k, positive-k+i)\n\ngo(negative, positive)\n\nvalues = sorted(list(map(abs, data)))\nfor i in range(min_negative):\n values[i] *= -1\n\nprint(sum(values))\n\n", "#!/usr/bin/python3\n\nn = int(input())\ndata = list(map(int, input().split()))\n\nx = 0\nfor element in data:\n if element < 0:\n x += 1\n\nvalues = sorted(list(map(abs, data)))\nresult = sum(values)\nif n % 2 == 0 and x % 2 == 1:\n result -= 2*values[0]\n\nprint(result)\n\n", "def read_int():\r\n return int(input())\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\n\r\nn = read_int()\r\na = list(read_ints())\r\n\r\n\r\ndef get_ans():\r\n abs_sum = sum(map(abs, a))\r\n \r\n neg = sum(1 if x < 0 else 0 for x in a)\r\n \r\n if neg == n:\r\n return abs_sum\r\n \r\n if neg % 2 == 0:\r\n return abs_sum\r\n \r\n if n % 2 == 1:\r\n return abs_sum\r\n \r\n min_abs = min(map(abs, a))\r\n return abs_sum - 2 * min_abs\r\n\r\n\r\nans = get_ans()\r\nprint(ans)\r\n", "'''\r\nBeezMinh\r\n22:48 UTC+7\r\n01/10/2023\r\n'''\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = 0\r\nfor i in a:\r\n\tif i < 0:\r\n\t\tb += 1\r\nfor i in range(0, n + n - 1):\r\n\ta[i] = abs(a[i])\r\nif b & 1 and n + 1 & 1: print(sum(a) - 2 * min(a))\r\nelse: print(sum(a))" ]

[ "n, P1, P2, P3, T1, T2=map(int,input().split())\r\ns=0\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n if i==0:\r\n t=l\r\n if T1>=(l-t):\r\n s+=(l-t)*P1\r\n else:\r\n s+=T1*P1\r\n if T2>=(l-T1-t):\r\n s+=(l-T1-t)*P2\r\n else:\r\n s+=T2*P2\r\n s+=(l-T1-T2-t)*P3\r\n s+=(r-l)*P1\r\n t=r\r\nprint(s)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nlastR = -1\r\ntotal = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n if lastR != -1:\r\n gap = l - lastR\r\n if gap > t1:\r\n if gap > t1 + t2:\r\n total += (gap - t1 - t2) * p3\r\n total += t2 * p2\r\n total += t1 * p1\r\n else:\r\n total += (gap - t1) * p2\r\n total += t1 * p1\r\n else:\r\n total += gap * p1\r\n total += (r - l) * p1\r\n lastR = r\r\nprint(total)\r\n", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\np=0\r\nt=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d=a-t\r\n if i==0:\r\n p=p+p1*(b-a)\r\n if i!=0 and i<n:\r\n if d<=t1:\r\n p=p+((b-a)+d)*p1\r\n if d>t1 and d<=t1+t2:\r\n p=p+((b-a)+t1)*p1+p2*(d-t1)\r\n if d>t1+t2:\r\n p=p+p1*((b-a)+t1)+(d-t1-t2)*p3+p2*t2\r\n t=b\r\nprint(p)", "X = list(map(int, input().split()))\r\nFirst = list(map(int, input().split()))\r\nSum, Last = (First[1] - First[0]) * X[1], First[1]\r\nfor i in range(1, X[0]):\r\n Temp = list(map(int, input().split()))\r\n Sum += (Temp[1] - Temp[0]) * X[1] + min(X[-2], Temp[0] - Last) * X[1] + max(\r\n min(X[-1], (Temp[0] - Last) - X[-2]), 0) * X[2] + max((Temp[0] - Last) - (X[-2] + X[-1]), 0) * X[3]\r\n Last = Temp[1]\r\nprint(Sum)\r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\n\r\nnums = []\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n nums.append(l)\r\n\r\nans = 0\r\nstart = 1\r\nfor i in range(n):\r\n if start == 0:\r\n idle = nums[i][0] - prev\r\n\r\n \r\n if idle > t1:\r\n ans += t1 * p1\r\n idle -= t1\r\n else:\r\n ans += idle*p1\r\n idle = 0\r\n if idle > t2:\r\n ans += t2*p2\r\n idle -= t2\r\n else:\r\n ans += idle*p2\r\n idle = 0\r\n if idle > 0:\r\n ans += idle*p3\r\n idle = 0\r\n \r\n\r\n diff = nums[i][1] - nums[i][0]\r\n \r\n ans += diff * p1\r\n prev = nums[i][1]\r\n start = 0\r\nprint(ans)", "def consume(r, l, p1, p2, p3, t1, t2):\r\n if l - r <= t1:\r\n return p1 * (l-r)\r\n elif t1 < l - r <= t1 + t2:\r\n return p1 * t1 + p2 * (l-r-t1)\r\n elif l - r > t1 + t2:\r\n return p1 * t1 + p2 * t2 + p3 * (l-r-t1-t2)\r\n\r\nn, p1, p2, p3, t1, t2 = map(int, input().split())\r\na = []\r\nans = 0\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n ans += p1 * (a[-1][1]-a[-1][0])\r\nfor i in range(n-1):\r\n ans += consume(a[i][1], a[i+1][0], p1, p2, p3, t1, t2)\r\nprint(ans)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nprev = None\r\nans = 0\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n if prev is not None:\r\n d = l - prev\r\n ans += min(d, t1) * p1\r\n d -= t1\r\n if d > 0:\r\n ans += min(d, t2) * p2\r\n d -= t2\r\n if d > 0:\r\n ans += d * p3\r\n ans += (r - l) * p1\r\n prev = r\r\nprint(ans)", "entrada = list(map(int,input().split()))\nn,p1,p2,p3,t1,t2 = entrada[0],entrada[1],entrada[2],entrada[3],entrada[4],entrada[5]\nt,s=0,0\nlista=[]\ncontador=0\nwhile contador != n:\n x,y=map(int,input().split())\n \n if t != 0:\n \n if x-t < t1:\n calculo=(x-t)*p1\n lista.append(calculo)\n else:\n t+=t1\n calculo=t1*p1\n lista.append(calculo)\n \n if x - t >= t2:\n t += t2\n calculo=t2*p2\n lista.append(calculo)\n calculo=(x-t)*p3\n lista.append(calculo)\n \n else:\n calculo=(x-t)*p2\n lista.append(calculo)\n\n \n calculo=(y-x)*p1\n lista.append(calculo)\n t=y\n contador+=1\n \nprint(sum(lista))\n \n \n\n \t \t\t \t\t \t\t\t \t\t\t\t \t \t\t \t", "def inspl(f): return map(f,input().split())\r\n\r\ndef Main():\r\n totalPower = 0\r\n n, p1, p2, p3, t1, t2 = inspl(int)\r\n td2 = t1 + t2\r\n l, r = inspl(int)\r\n totalPower += (r - l) * p1\r\n rf = r\r\n for i in range(n - 1):\r\n l, r = inspl(int)\r\n totalPower += (r - l) * p1\r\n inactive = l - rf\r\n if(inactive > td2):\r\n totalPower += (inactive - td2) * p3 + t2 * p2 + t1 * p1\r\n elif(inactive > t1):\r\n totalPower += (inactive - t1) * p2 + t1 * p1\r\n else :\r\n totalPower += inactive * p1\r\n rf = r\r\n print (totalPower)\r\n\r\n\r\nMain()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Mar 12 12:18:22 2020\r\n\r\n@author: akprasad\r\n\"\"\"\r\n\r\nif __name__ == '__main__':\r\n n, P1, P2, P3, T1, T2 = [int(x) for x in input().split()]\r\n intervals = []\r\n consumed = 0\r\n for _ in range(n):\r\n intervals.append([int(x) for x in input().split()])\r\n consumed += P1 * (intervals[-1][1] - intervals[-1][0])\r\n if len(intervals) > 1:\r\n t = intervals[-1][0] - intervals[-2][1]\r\n if t <= T1:\r\n consumed += P1 * t\r\n else:\r\n consumed += P1 * T1\r\n if t <= T1 + T2:\r\n consumed += P2 * (t - T1)\r\n else:\r\n consumed += P2 * T2\r\n consumed += P3 * (t - T1 - T2)\r\n print(consumed)\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-27 23:10:54\nLastEditTime: 2021-11-27 23:28:38\nDescription: Power Consumption Calculation\nFilePath: CF10A.py\n'''\n\n\ndef func():\n n, p1, p2, p3, t1, t2 = map(int, input().strip().split())\n left, right = [0] * n, [0] * n\n power = 0\n for i in range(n):\n left[i], right[i] = map(int, input().strip().split())\n power += (right[i] - left[i]) * p1\n\n for i in range(n - 1):\n interval = left[i + 1] - right[i]\n if interval <= t1:\n power += p1 * interval\n elif t1 < interval <= t1 + t2:\n power += p1 * t1 + p2 * (interval - t1)\n else:\n power += p1 * t1 + p2 * t2 + p3 * (interval - t1 - t2)\n print(power)\n\n\nif __name__ == '__main__':\n func()\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\np = 0\nv = []\nfor i in range(0, n):\n v.append(list(map(int, input().split())))\n\nfor x, y in v:\n p += p1 * (y - x)\n\nfor a, b in zip(v, v[1:]):\n d = b[0] - a[1]\n if d < t1:\n p += d * p1\n d = 0\n else:\n d -= t1\n p += t1 * p1\n\n if d < t2:\n p += d * p2\n d = 0\n else:\n d -= t2\n p += t2 * p2\n p += d * p3\n\nprint(p)\n", "from sys import stdin\r\n\r\n\r\nn, working, screensaving, sleep, touched_time, screensaving_time = map(int, input().split())\r\nlast = list(map(int, input().split()))\r\nrest = (last[1]-last[0]) * working \r\n \r\nfor i in range(1, n):\r\n current = list(map(int, stdin.readline().split()))\r\n d = current[0] - last[1]\r\n\r\n rest += min(d, touched_time) * working\r\n\r\n rest += min(max(d - touched_time, 0), screensaving_time) * screensaving\r\n rest += max(d - (touched_time+screensaving_time), 0) * sleep\r\n rest += (current[1]-current[0]) * working\r\n last = current\r\n \r\nprint(rest)", "arreglo=[]\r\ny=input()\r\ny=y.split()\r\nsuma=0\r\nsuma1=0\r\nultimo=0\r\npantalla=0\r\napagado=0\r\nULTIMO=0\r\nit=0\r\np=-1\r\nfor k in range (int(y[0])):\r\n intervalo=input()\r\n intervalo=intervalo.split()\r\n it=it+1\r\n arreglo.append(int(intervalo[1])) \r\n total=int(intervalo[1])-(int(intervalo[0]))\r\n suma1=suma1+total\r\n suma1=suma1*(int(y[1]))\r\n if int(y[0])>1 and it >=2:\r\n p=p+1\r\n while ultimo<(int(intervalo[0])-arreglo[p]) and ultimo<(int(y[4])) :\r\n ultimo=ultimo+1 \r\n while pantalla+ultimo<(int(intervalo[0])-arreglo[p]) and pantalla<(int(y[5])):\r\n pantalla=pantalla+1\r\n while apagado+pantalla+ultimo<((int(intervalo[0]))-arreglo[p]):\r\n apagado=apagado+1 \r\n ultimo=ultimo*(int(y[1])) \r\n pantalla=pantalla*(int(y[2]))\r\n apagado=apagado*(int(y[3])) \r\n suma=suma+ultimo+pantalla+apagado+suma1\r\n ultimo=0\r\n pantalla=0\r\n apagado=0\r\n suma1=0\r\nprint(suma)", "def q10a():\n\tn, p1, p2, p3, t1, t2 = tuple([int(num) for num in input().split()])\n\ttotal = 0\n\tprev_l = 0\n\tprev_r = 0\n\tfor i in range(n):\n\t\tl, r = tuple([int(num) for num in input().split()])\n\t\tif(i != 0):\n\t\t\t# Calculate interim time\n\t\t\t# \"On\"\n\t\t\ttotal += p1 * min(t1, l - prev_r)\n\t\t\t# \"Screensaver\"\n\t\t\tif(l - prev_r > t1):\n\t\t\t\ttotal += p2 * min(t2, (l - prev_r - t1))\n\t\t\t\tif(l - prev_r > t1 + t2):\n\t\t\t\t\ttotal += p3 * (l - prev_r - t1 - t2)\n\t\ttotal += p1 * (r - l)\n\t\tprev_l = l\n\t\tprev_r = r\n\tprint(total)\nq10a()", "args = input().split()\r\nn = int(args[0])\r\np = list(map(int, args[1:4]))\r\nt = list(map(int, args[4:]))\r\n\r\npower = 0\r\nx = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n if x == 0:\r\n x = l\r\n d = l - x\r\n for j in range(2):\r\n power += p[j] * min(d, t[j])\r\n d = max(0, d - t[j])\r\n power += p[2] * max(0, d) + p[0] * (r - l)\r\n x = r\r\n\r\nprint(power)\r\n", "n,P1,P2,P3,T1,T2 = list(map(int,input().split()))\r\n\r\nE = 0\r\npl=[]\r\n\r\nfor i in range(n):\r\n\tpl.append(list(map(int,input().split())))\r\n\r\nfor i in pl:\r\n\tE += (i[1]-i[0])*P1\r\n\r\nfor i in range(len(pl)-1):\r\n\tti = pl[i+1][0] - pl[i][1]\r\n\tif ti < T1:\r\n\t\tE += ti*P1\r\n\telse:\r\n\t\tE += T1*P1\r\n\t\tif ti - T1 < T2:\r\n\t\t\tE += (ti - T1)*P2\r\n\t\telse:\r\n\t\t\tE += T2*P2\r\n\t\t\tE += (ti - T1 - T2)*P3\r\n\r\nprint(E)\r\n", "# cook your dish here\r\nn,p1,p2,p3,t1,t2=map(int,input().split())\r\nsum=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if i==0:\r\n initial=a[0]\r\n else:\r\n pass\r\n work_interval=a[1]-a[0]\r\n sum+=work_interval*p1\r\n interval=a[0]-initial\r\n initial=a[1]\r\n if interval>=t1:\r\n sum+=(t1)*p1\r\n interval-=t1\r\n if interval>=t2:\r\n sum+=(t2)*p2\r\n interval-=t2\r\n sum+=(interval)*p3\r\n else:\r\n sum+=interval*p2\r\n else:\r\n sum+=interval*p1\r\nprint(sum)\r\n ", "n, p1, p2, p3, t1, t2 = [int(item) for item in input().split(' ')]\r\nl1, r1 = [int(item) for item in input().split(' ')]\r\nans = (r1 - l1) * p1\r\n# print(n,p1,p2,p3,t1,t2)\r\n\r\nfor i in range(n - 1):\r\n l2, r2 = [int(item) for item in input().split(' ')]\r\n ans += (r2 - l2) * p1\r\n dif = l2- r1\r\n if dif > t1:\r\n ans += p1 * t1\r\n dif -= t1\r\n else:\r\n ans += dif * p1\r\n dif = 0\r\n if dif > t2:\r\n ans += p2 * t2\r\n dif -= t2\r\n else:\r\n ans += dif * p2\r\n dif = 0\r\n ans += dif * p3\r\n l1 = l2\r\n r1 = r2\r\n\r\nprint(ans)\r\n\r\n'''\r\n1 3 2 1 5 10\r\n0 10\r\n\r\n\r\n'''\r\n", "#!/usr/bin/env python3\n\nn, p1, p2, p3, t1, t2 = [int(j) for j in input().split(' ')]\nperiods = []\nfor i in range(n):\n a, b = [int(j) for j in input().split(' ')]\n periods.append([a, b])\n\ns = 0\nfor i in range(n):\n d_work = periods[i][1] - periods[i][0]\n s += d_work * p1\n if (i + 1 < n):\n d_res = periods[i+1][0] - periods[i][1] # duration between periods of work\n if d_res < t1:\n s += p1 * d_res\n elif t1 <= d_res < t1 + t2:\n s += p1 * t1 + p2 * (d_res - t1)\n elif t1 + t2 <= d_res:\n s += p1 * t1 + p2 * t2 + p3 * (d_res - t1 - t2)\n\nprint(s)\n", "\r\npc = 0\r\nlc , rc = None, None\r\nlp , rp = None, None\r\n\r\ne = input().split()\r\nn, p1, p2, p3, t1, t2 = int(e[0]), int(e[1]), int(e[2]), int(e[3]), int(e[4]), int(e[5])\r\n\r\nie = input().split()\r\nlc, rc = int(ie[0]), int(ie[1])\r\npc = (rc - lc) * p1\r\n\r\nfor i in range(n-1):\r\n lp, rp = lc, rc\r\n ie = input().split()\r\n lc, rc = int(ie[0]), int(ie[1])\r\n pc = pc + (rc - lc) * p1\r\n tsu = lc - rp\r\n if tsu <= t1:\r\n pc = pc + tsu * p1\r\n else:\r\n pc = pc + t1 * p1\r\n tsu = tsu - t1\r\n if tsu <= t2:\r\n pc = pc + tsu * p2\r\n else:\r\n pc = pc + t2 * p2\r\n tsu = tsu - t2\r\n pc = pc + tsu * p3\r\nprint(pc)", "info1 = input().split()\r\ninfo2 = []\r\npower = 0\r\n\r\nfor i in range(int(info1[0])):\r\n info2.append(input().split())\r\n\r\n#WRONG TEST CASE WAS:\r\n#4 73 2 53 58 16\r\n#51 52\r\n#209 242\r\n#281 407\r\n#904 945\r\n#ANSWER IS:\r\n#52870\r\n#OUTPUT WAS:\r\n#54050\r\n\r\nn = int(info1[0])\r\np1 = int(info1[1])\r\np2 = int(info1[2])\r\np3 = int(info1[3])\r\nt1 = int(info1[4])\r\nt2 = int(info1[5])\r\nfor i in range(n):\r\n info2[i][0] = int(info2[i][0])\r\n info2[i][1] = int(info2[i][1])\r\n\r\npowerpminute = p1\r\ntotalmins = 0\r\n\r\nfor i in range(n):\r\n if i < n-1:\r\n powerpminute = p1\r\n power += (info2[i][1] - info2[i][0]) * powerpminute\r\n totalmins += info2[i][1] - info2[i][0]\r\n if t2 + t1 >= (info2[i + 1][0] - info2[i][1]) > t1:\r\n power += t1 * powerpminute\r\n powerpminute = p2\r\n power += ((info2[i + 1][0] - info2[i][1]) - t1) * powerpminute\r\n totalmins += (info2[i + 1][0] - info2[i][1])\r\n elif (info2[i + 1][0] - info2[i][1]) > t2 + t1:\r\n power += t1 * powerpminute\r\n powerpminute = p3\r\n power += ((info2[i + 1][0] - info2[i][1]) - t1 - t2) * powerpminute\r\n powerpminute = p2\r\n power += t2 * powerpminute\r\n totalmins += (info2[i + 1][0] - info2[i][1])\r\n else:\r\n totalmins += (info2[i + 1][0] - info2[i][1])\r\n power += ((info2[i + 1][0] - info2[i][1])) * powerpminute\r\n else:\r\n powerpminute = p1\r\n power += (info2[i][1] - info2[i][0]) * powerpminute\r\n break\r\n\r\nprint(power)\r\n", "n, p1, p2, p3, t1, t2 = list(map(int, input().split(' ')))\r\nl1, r1 = list(map(int, input().split(' ')))\r\nans = (r1 - l1) * p1\r\n\r\nfor i in range(n - 1):\r\n l2, r2 = list(map(int, input().split(' ')))\r\n ans += (r2 - l2) * p1\r\n gap = l2 - r1\r\n if gap >= t1:\r\n ans += t1 * p1\r\n gap -= t1\r\n else:\r\n ans += gap * p1\r\n gap = 0\r\n if gap >= t2:\r\n ans += t2 * p2\r\n gap -= t2\r\n else:\r\n ans += gap * p2\r\n gap = 0\r\n ans += gap * p3\r\n r1, l1 = r2, l2\r\nprint(ans)\r\n", "n, P1, P2, P3, T1, T2 = map(int, input().split())\r\nl, r = map(int, input().split())\r\ntotal = P1 * (r - l)\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n if a - r <= T1:\r\n total += P1 * (a - r)\r\n elif a - r <= T1 + T2:\r\n total += P1 * T1 + P2 * (a - r - T1)\r\n else:\r\n total += P1 * T1 + P2 * T2 + P3 * (a - r - T1 - T2)\r\n total += P1 * (b - a)\r\n l, r = a, b\r\n\r\nprint(total)", "a,b,c,d,e,f=map(int,input().split())\r\ns=[]\r\nt=[]\r\nfor i in range(a):\r\n l=list(map(int,input().split()))\r\n s.append(l)\r\nt.append(b*(s[a-1][1]-s[a-1][0]))\r\nfor j in range(a-1):\r\n if s[j+1][0]-s[j][1]<=e:\r\n t.append(b*(s[j+1][0]-s[j][0]))\r\n elif s[j+1][0]-s[j][1]>e and s[j+1][0]-s[j][1]<=e+f:\r\n t.append(b*(s[j][1]-s[j][0]+e)+c*(s[j+1][0]-s[j][1]-e))\r\n else:\r\n t.append(b*(s[j][1]-s[j][0]+e)+c*f+d*(s[j+1][0]-s[j][1]-e-f))\r\nl=t[0]\r\nfor i in range(1,len(t)):\r\n l=l+t[i]\r\nprint(l)\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, p1, p2, p3, t1, t2 = map(int, input().split())\r\n\r\ndef power(t):\r\n p = p1*min(t, t1) + p2*min(max(0,t-t1),t2) + p3*max(t-t1-t2,0)\r\n return p\r\n\r\na, c, d = 0, 0, 0\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n if d == 0:\r\n a = l\r\n d = 1\r\n c += power(l-a) + p1*(r-l)\r\n a = r\r\nprint(c)", "\r\nn, p1, p2, p3, t1, t2 = map(int, input().split())\r\n\r\nv = list()\r\nfor i in range(n):\r\n\tvec = list(map(int, input().split()))\r\n\tv.append(vec)\r\n\r\ndef get(time):\r\n\tff = min(time, t1)\r\n\ttime -= ff\r\n\tss = min(time, t2)\r\n\ttime -= ss\r\n\treturn ff*p1 + ss*p2 + time*p3 \r\n\r\ndef solve():\r\n\tans = 0\r\n\tlast = v[0][0]\r\n\tfor vec in v:\r\n\t\tans += p1 * (vec[1] - vec[0])\r\n\t\tans += get(vec[0] - last)\r\n\t\tlast = vec[1]\r\n\treturn ans\r\n\r\nprint(solve())\r\n", "a = []\r\n\r\nn,P1,P2,P3,T1,T2 = input().split()\r\nn = int(n)\r\nP1 = int(P1)\r\nP2 = int(P2)\r\nP3 = int(P3)\r\nT1 = int(T1)\r\nT2 = int(T2)\r\n\r\nfor i in range(n):\r\n x,y = input().split()\r\n a.append([int(x),int(y)])\r\n\r\np = 0\r\n\r\nfor i in range(len(a)):\r\n p += (a[i][1] - a[i][0])*P1\r\n \r\n\r\nfor i in range(len(a)-1):\r\n z = abs(a[i][1] - a[i+1][0])\r\n \r\n if z <= T1:\r\n p =p+ z*P1\r\n elif z<= T1+T2:\r\n p =p+ T1*P1 + (z-T1)*P2\r\n else:\r\n p =p+ T1*P1 + T2*P2 + (z-T1-T2)*P3\r\n \r\nprint(p)", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n, p1, p2, p3, t1, t2 = map(int, input().split())\r\n l1, r1 = map(int, input().split())\r\n power = p1 * (r1 - l1)\r\n last = r1\r\n for _i in range(n-1):\r\n l, r = map(int, input().split())\r\n interval = l - last\r\n if interval < t1:\r\n power += p1 * interval\r\n elif interval < t1 + t2:\r\n power += p1 * t1 + p2 * (interval - t1)\r\n else:\r\n power += p1 * t1 + p2 * t2 + p3 * (interval - t1 - t2)\r\n power += p1 * (r - l)\r\n last = r\r\n print(power)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n,p1,p2,p3,T1,T2=map(int,input().split())\r\ntotal,previousTime=0,-1\r\nfor k in range(n):\r\n start,finish=map(int,input().split())\r\n if previousTime<0:\r\n previousTime=start\r\n total +=p1*(finish-start)\r\n timeIdle=start-previousTime\r\n if timeIdle>T1+T2:\r\n total +=(timeIdle-T1-T2)*p3\r\n timeIdle=T1+T2\r\n if timeIdle>T1:\r\n total +=(timeIdle-T1)*p2\r\n timeIdle=T1\r\n total +=timeIdle*p1\r\n previousTime=finish\r\nprint(total) ", "n, p1, p2, p3, t1, t2 = (int(i) for i in input().split())\nres = pr = 0\nfor _ in range(n):\n l, r = (int(i) for i in input().split())\n res += (r - l) * p1\n pr = pr if pr > 0 else l\n idle = min(t1, max(0, l - pr))\n res += idle * p1\n screensaver = min(t2, max(0, l - pr - idle))\n res += screensaver * p2\n res += max(0, l - pr - idle - screensaver) * p3\n pr = r\nprint(res)\n", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\nt1=t1+1\r\nst=0\r\np=0\r\nrt=-1\r\nwhile n:\r\n n=n-1\r\n l,r=map(int,input().split())\r\n if rt==-1: rt=l+1\r\n while rt<=r:\r\n if l<rt: st=0\r\n else: st=st+1\r\n if st>=t1+t2: p=p+p3\r\n elif st>=t1: p=p+p2\r\n else: p=p+p1\r\n rt=rt+1\r\nprint(p)\r\n", "\r\n\r\ndef main():\r\n\r\n n, p1, p2, p3, t1, t2 = [int(_) for _ in input().split()]\r\n minutes = [0, 0, 0]\r\n r_prev = 0\r\n for _ in range(n):\r\n l, r = [int(_) for _ in input().split()]\r\n minutes[0] += r - l\r\n if r_prev:\r\n rest = l - r_prev\r\n if rest <= t1:\r\n minutes[0] += rest\r\n else:\r\n minutes[0] += t1\r\n rest -= t1\r\n if rest <= t2:\r\n minutes[1] += rest\r\n else:\r\n minutes[1] += t2\r\n rest -= t2\r\n minutes[2] += rest\r\n r_prev = r\r\n\r\n print(minutes[0] * p1 + minutes[1] * p2 + minutes[2] * p3)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,p1,p2,p3,t1,t2 = map(int,input().split())\r\ntemp = 0\r\nans = 0\r\nflag = 0\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n j = 1\r\n while (j < 3 and flag == 1):\r\n if temp + t1 <= l:\r\n ans+=(t1*p1)\r\n j+=1\r\n else:\r\n ans+=(l-temp)*p1\r\n break\r\n\r\n if temp+t1+t2<=l:\r\n ans+=(t2*p2)\r\n j+=1\r\n else:\r\n ans+=(l-(temp+t1))*p2\r\n break\r\n\r\n ans+=(l-(temp+t1+t2))*p3\r\n j+=1\r\n\r\n temp = r\r\n ans+=(r-l)*p1\r\n flag = 1\r\nprint(ans)", "n, p1, p2, p3, t1, t2 = list(map(int, input().split(\" \")))\r\n\r\nl = []\r\nfor _ in range(n):\r\n l += list(map(int, input().split(\" \")))\r\n\r\np = 0\r\nfor i in range(len(l) // 2 - 1):\r\n x = l[2 * i + 2] - l[2 * i + 1]\r\n p += p1 * min(t1, x) + p2 * min(t2, max(0, x - t1)) + p3 * max(0, x - t1 - t2)\r\n\r\nfor i in range(len(l) // 2):\r\n x = l[2 * i + 1] - l[2 * i]\r\n p += p1 * x \r\n\r\nprint(p)", "inp = [int(i) for i in input().split()]\r\nn = inp[0]\r\np1 = inp[1]\r\np2 = inp[2]\r\np3 = inp[3]\r\nt1 = inp[4]\r\nt2 = inp[5]\r\nl0r0 = input().split()\r\nl0 = int(l0r0[0])\r\nr0 = int(l0r0[1])\r\nans = (r0-l0)*p1\r\nfor i in range(n-1):\r\n lr = input().split()\r\n l = int(lr[0])\r\n r = int(lr[1])\r\n ans += (r-l)*p1\r\n t = l - r0\r\n if t <= t1:\r\n ans += t*p1\r\n else:\r\n t -= t1\r\n if t <= t2:\r\n ans += t1*p1 + t*p2\r\n else:\r\n t -= t2\r\n ans += t1*p1 + t2*p2 + t*p3\r\n l0 = l\r\n r0 = r\r\nprint(ans)\r\n", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\nold_l=old_r=0\r\npt=0\r\nfor i in range(n):\r\n\tl,r=map(int,input().split())\r\n\tpt+=(r-l)*p1\r\n\ta=l-old_r\r\n\t# print(pt,a)\r\n\tif a>=t1 and i!=0:\r\n\t\tpt+=t1*p1\r\n\t\tb=a-t1\r\n\t\t# print(pt,a,b)\r\n\t\tif b>=t2:\r\n\t\t\tpt+=t2*p2\r\n\t\t\tpt+=(b-t2)*p3\r\n\t\telse:\r\n\t\t\tpt+=b*p2\r\n\telif i!=0:\r\n\t\tpt+=a*p1\t\r\n\t# print(pt)\r\n\told_r=r\r\n\told_l=l\r\nprint(pt)", "n, P1, P2, P3, T1, T2=map(int,input().split())\r\n\r\nLR=[tuple(map(int,input().split())) for i in range(n)]\r\nANS=0\r\nfor i in range(n):\r\n l,r=LR[i]\r\n ANS+=(r-l)*P1\r\n\r\n if i!=n-1:\r\n l2,r2=LR[i+1]\r\n\r\n ANS+=min(T1,l2-r)*P1\r\n ANS+=max(0,min(T2,l2-(r+T1))*P2)\r\n ANS+=max(0,(l2-(r+T1+T2))*P3)\r\n\r\nprint(ANS)\r\n\r\n \r\n", "def f(w, w1, w2):\r\n r1 = min(w, w1)\r\n r3 = max(0, w - w1 - w2)\r\n return r1, w - r1 - r3, r3\r\n\r\n\r\nn, p1, p2, p3, t1, t2 = [int(i) for i in input().split()]\r\ns = 0\r\na = [[int(j) for j in input().split()] for i in range(n)]\r\nfor i in [(f(a[i + 1][0] - a[i][1], t1, t2)) for i in range(len(a) - 1)]:\r\n s += i[0] * p1 + i[1] * p2 + i[2] * p3\r\nprint(s + sum([x[1] - x[0] for x in a]) * p1)\r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\na = []\nans = 0\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\nfor i in range(n - 1):\n t = a[i + 1][0] - a[i][1]\n if t >= (t1 + t2):\n ans += p1 * (a[i][1] - a[i][0] + t1) + p2 * t2 + p3 * (t - t1 - t2)\n elif (t >= t1) and (t < t1 + t2):\n ans += p1 * (a[i][1] - a[i][0] + t1) + p2 * (t - t1)\n else:\n ans += p1 * (a[i][1] - a[i][0] + t)\n\nans += (a[n - 1][1] - a[n - 1][0]) * p1\nprint(ans)\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nperiods = []\r\nfor _ in range(n):\r\n periods.append(list(map(int, input().split())))\r\nc = 0\r\nfor i in range(n - 1):\r\n curr = periods[i]\r\n next = periods[i+1]\r\n c += (curr[-1] - curr[0]) * p1\r\n gap = next[0] - curr[-1]\r\n if gap <= t1:\r\n c += gap * p1\r\n elif gap <= t1 + t2:\r\n c += (t1 * p1) + (gap - t1) * p2\r\n else:\r\n c += (t1 * p1) + (t2 * p2) + (gap - t1 - t2) * p3\r\nc += (periods[-1][-1] - periods[-1][0]) * p1\r\nprint(c)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nans, l1, r1 = 0, 0, 0\r\nfor i in range(n):\r\n l2, r2 = map(int, input().split())\r\n ans += (r2 - l2) * p1\r\n if r1 != 0:\r\n t = l2 - r1\r\n ans += min(t1, t) * p1 + min(max(t - t1, 0), t2) * p2 + max(t - t1 - t2, 0) * p3\r\n l1, r1 = l2, r2\r\nprint(ans)", "cases, p1, p2, p3, t1, t2 = map(int, input().split())\r\nans = 0\r\nlast = 0\r\nwhile cases:\r\n cases -= 1\r\n l, r = map(int, input().split())\r\n ans += (r-l)*p1\r\n if last:\r\n time = l - last\r\n while time > 0:\r\n ans += min(time, t1) * p1\r\n time -= min(time, t1)\r\n if time > 0:\r\n ans += min(time, t2) * p2\r\n time -= min(time, t2)\r\n if time > 0:\r\n ans += time * p3\r\n time = 0\r\n last = r\r\n\r\nprint(ans)", "I = lambda: map(int, input().split())\r\n\r\nn, P1, P2, P3, T1, T2 = I()\r\nL, R = I()\r\nA = P1*(R-L)\r\nt = R\r\n\r\nfor _ in range(n-1):\r\n L, R = I()\r\n if L-t < T1:\r\n A += P1*(L-t)\r\n elif L-t < T1+T2:\r\n A += P1*T1 + P2*(L-t-T1)\r\n else:\r\n A += P1*T1 + P2*T2 + P3*(L-t-T1-T2)\r\n A += P1*(R-L)\r\n t = R\r\n\r\nprint(A)", "n,p1,p2,p3,t1,t2 = map(int,input().split())\nt = []\nfor i in range(n):\n t += map(int,input().split())\ns = 0\nfor j in range(n-1):\n s += (t[2*j+1]-t[2*j])*p1\n a = t[2*j+2]-t[2*j+1]\n if a >= t2+t1 :\n s += (a-t2-t1)*p3 + t2*p2 + t1*p1\n elif a >= t1 :\n s += (a-t1)*p2 + t1*p1\n else :\n s += a*p1\ns += (t[2*n-1]-t[2*n-2])*p1\nprint(s)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nans = 0\r\nl = []\r\nr = []\r\nfor i in range(n):\r\n s, t = map(int, input().split())\r\n ans += (t - s) * p1\r\n l.append(s)\r\n r.append(t)\r\n if i > 0:\r\n if (s - r[i - 1]) > t1:\r\n ans += p1 * t1\r\n tmp = s - r[i - 1] - t1\r\n if tmp > t2:\r\n ans += p2 * t2\r\n ans += (tmp - t2) * p3\r\n else:\r\n ans += tmp * p2\r\n else:\r\n ans += (s - r[i - 1]) * p1\r\n\r\nprint(ans)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nans = 0\r\nlast = -1\r\n\r\nfor i in range(n):\r\n s, t = map(int, input().split())\r\n ans += (t - s) * p1\r\n if last != -1:\r\n if (s - last) > t1:\r\n ans += p1 * t1\r\n tmp = s - last - t1\r\n if tmp > t2:\r\n ans += p2 * t2\r\n ans += (tmp - t2) * p3\r\n else:\r\n ans += tmp * p2\r\n else:\r\n ans += (s - last) * p1\r\n last = t\r\n\r\nprint(ans)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\n\r\njadwal = []\r\nfor _ in range(n):\r\n jadwal.append(list(map(int, input().split())))\r\n\r\ntotal_kerja = 0\r\n\r\nfor x in jadwal:\r\n total_kerja += x[1] - x[0]\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(jadwal) - 1):\r\n akhir = jadwal[i+1][0] - jadwal[i][1]\r\n total += p1 * akhir - max(0, (akhir - t1)) * (p1 - p2) - max(0,(akhir - t1 - t2)) * (p2 - p3)\r\n \r\nprint(total + total_kerja * p1)\r\n", "n,p1,p2,p3,t1,t2 = map(int,input().split())\r\nt=0;\r\ns=0;\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if t!=0:\r\n if x-t<t1:\r\n s+=(x-t)*p1\r\n else:\r\n t+=t1\r\n s+=t1*p1\r\n if x-t<t2:\r\n s+=(x-t)*p2\r\n else:\r\n t+=t2\r\n s+=t2*p2\r\n s+=(x-t)*p3\r\n s+=(y-x)*p1\r\n t=y\r\n \r\nprint(s)\r\n \r\n\r\n", "def main():\r\n n, P1, P2, P3, T1, T2 = map(int, input().split())\r\n\r\n total = 0\r\n previousTime = -1\r\n\r\n for k in range(n):\r\n start, finish = map(int, input().split())\r\n if previousTime < 0:\r\n previousTime = start\r\n total += P1 * (finish - start)\r\n\r\n timeIdle = start - previousTime\r\n if timeIdle > T1 + T2:\r\n total += (timeIdle - T1 - T2) * P3\r\n timeIdle = T1 + T2\r\n if timeIdle > T1:\r\n total += (timeIdle - T1) * P2\r\n timeIdle = T1\r\n total += timeIdle * P1\r\n\r\n previousTime = finish\r\n\r\n print(total)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "if __name__ == \"__main__\":\n n, P1, P2, P3, T1, T2 = map(int, input().split())\n\n work_periods = []\n\n for _ in range(n):\n work_periods.append(tuple(map(int, input().split())))\n\n result = 0\n for ((start1, end1), (start2, end2)) in zip(work_periods, work_periods[1:]):\n result += (end1 - start1) * P1\n \n gap_time = start2 - end1\n result += min(gap_time, T1) * P1\n if gap_time > T1:\n result += min(gap_time - T1, T2) * P2\n\n if gap_time > T1 + T2:\n result += (gap_time - T1 - T2) * P3\n \n result += (work_periods[-1][1] - work_periods[-1][0]) * P1\n\n print(result)", "from numbers import Integral\r\n\r\n\r\nn, p1, p2, p3, t1, t2 = list(map(int, input().split(' ')))\r\nl = list()\r\nr = list()\r\n\r\nrep = n\r\nwhile rep:\r\n rep -= 1\r\n l_i, r_i = list(map(int, input().split(' ')))\r\n l.append(l_i)\r\n r.append(r_i)\r\n\r\npower_consumption = 0\r\nfor i in range(0, n):\r\n power_consumption += (r[i] - l[i]) * p1\r\n if i < n - 1:\r\n interval = l[i + 1] - r[i]\r\n if interval - t1 > 0:\r\n power_consumption += t1 * p1\r\n interval -= t1\r\n if interval - t2 > 0:\r\n power_consumption += t2 * p2\r\n interval -= t2\r\n if interval > 0:\r\n power_consumption += interval * p3\r\n else:\r\n power_consumption += interval * p2\r\n else:\r\n power_consumption += interval * p1\r\n\r\nprint(power_consumption)", "def solve(l):\r\n o = l[0][1]\r\n t = []\r\n tt = [l[0][1] - l[0][0]]\r\n for j in range(1, n):\r\n t.append(l[j][0] - o)\r\n o = l[j][1]\r\n tt.append(l[j][1] - l[j][0])\r\n\r\n Sum = 0\r\n for k in range(len(t)):\r\n if t[k] <= t1:\r\n Sum += t[k] * p1\r\n elif t[k] >t1 and t[k] <= t1 + t2:\r\n Sum += t1 * p1\r\n Sum += (t[k] - t1) * p2\r\n else:\r\n Sum += t1 * p1\r\n Sum += t2 * p2\r\n Sum += (t[k] - (t1 + t2)) *p3\r\n Sum += sum(tt) * p1\r\n print(Sum)\r\n\r\n\r\nn, p1, p2, p3, t1, t2 = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n e = list(map(int, input().split()))\r\n l.append(e)\r\n\r\n\r\nsolve(l)", "import sys\r\ninput=sys.stdin.readline\r\nfrom math import *\r\nn,p1,p2,p3,t1,t2=map(int,input().split())\r\ns=0\r\na=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n s+=(y-x)*p1\r\n a.append([x,y])\r\nfor i in range(n-1):\r\n if a[i][1]+t1>=a[i+1][0]:\r\n s+=(a[i+1][0]-a[i][1])*p1\r\n continue\r\n if a[i][1]+t1+t2>=a[i+1][0]:\r\n s+=(a[i+1][0]-a[i][1]-t1)*p2+t1*p1\r\n continue\r\n s+=(a[i+1][0]-a[i][1]-t1-t2)*p3+t1*p1+t2*p2\r\n \r\nprint(s) ", "n,p1,p2,p3,t1,t2=[int(x) for x in input().split()]\r\nlst=[]\r\nfor i in range(n):\r\n lst.append([int(x) for x in input().split()])\r\nres=(lst[0][1]-lst[0][0])*p1\r\nfor i in range(1,n):\r\n if lst[i][0]-lst[i-1][1]<=t1:\r\n res+=(lst[i][0]-lst[i-1][1])*p1\r\n else:\r\n if lst[i][0]-lst[i-1][1]<t1+t2:\r\n res+=t1*p1+(lst[i][0]-lst[i-1][1]-t1)*p2\r\n else:\r\n res+=t1*p1+t2*p2+(lst[i][0]-lst[i-1][1]-t1-t2)*p3\r\n res+=(lst[i][1]-lst[i][0])*p1\r\nprint(res)", "def getPowerConsumption():\r\n #first input line contains n = numbers of working periods\r\n #P1 = power consumpted by computer in working mode\r\n #P2 = power consumpted in screensaver mode\r\n #P3 = power consumpted in sleep mode\r\n #T1 = time required by computer to go in screensaver mode\r\n #T2 = time required to go in sleep mode\r\n n,P1, P2, P3, T1, T2 =map(int,input().strip().split())\r\n\r\n #workingPeriods = a 2D list which will contain all working periods\r\n workingPeriods = []\r\n #read from input all working periods\r\n for i in range(n):\r\n #add them to working periods list\r\n workingPeriods.append(list(map(int,input().strip().split())))\r\n result = 0\r\n for workingPeriod in range(len(workingPeriods)):\r\n if workingPeriod == len(workingPeriods) - 1:\r\n result += (workingPeriods[workingPeriod][1]-workingPeriods[workingPeriod][0])*P1\r\n return result\r\n result += (workingPeriods[workingPeriod][1]-workingPeriods[workingPeriod][0])*P1\r\n #time between working periods\r\n restingTime = workingPeriods[workingPeriod + 1][0]-workingPeriods[workingPeriod][1]\r\n #if time between working periods is grater than 0 and less than time needed to go in screensaver mode\r\n if restingTime > 0 and restingTime <= T1:\r\n #than we have to add time spend in working mode\r\n result += restingTime*P1\r\n #if resting time is bigger than T1, it means that computer will go in screensaver mode\r\n if restingTime > T1:\r\n #than we have to add time spend in working mode, until going in screensaver mode\r\n result += T1*P1\r\n #substract this time from resting time\r\n restingTime -= T1\r\n #if it remains restign time, but not necessary to go in sleep mode\r\n if restingTime > 0 and restingTime <= T2:\r\n #than we have to add time spend in working mode\r\n result += restingTime*P2\r\n #if resting time is bigger than T2, it means that computer will go in sleep mode\r\n if restingTime > T2:\r\n #than we have to add time spend in screensaving mode, until going in sleep mode\r\n result += T2*P2\r\n #substract this time from resting time\r\n restingTime -= T2\r\n #if there is still remaining resting time\r\n if restingTime > 0:\r\n result += restingTime*P3\r\n\r\n\r\n\r\n \r\n\r\nprint(getPowerConsumption())", "k1=input()\r\nm=k1.split(\" \")\r\nm=list(map(int,m))\r\nl=[]\r\nfor i in range (m[0]):\r\n k2=input()\r\n n=k2.split(\" \")\r\n n=list(map(int,n))\r\n l=l+n\r\n# print(l)\r\n\r\nc=0\r\nh=int(len(l)/2)\r\n# print(h)\r\nfor i in range(0,h):\r\n b1=l[2*i+1]-l[2*i] \r\n c=b1+c\r\n # print(\"1\")\r\n# print(c*m[1])\r\no=[] \r\nfor i in range(1,len(l)-1):\r\n if i%2!=0:\r\n v = l[i+1]-l[i]\r\n o.append(v)\r\n# for i in range(0,h) :\r\n# x=list(l[2*i+2]-l[2*i+1])\r\n# o=o+x\r\nn1=len(o)\r\n# print(o)\r\nans = 0\r\nk = []\r\nfor i in range(0,n1):\r\n var = o[i]\r\n ans+=min(m[4],var)*m[1]\r\n # k.append(min(m[4],var))\r\n var = var-m[4]\r\n if(var<0):\r\n var = 0\r\n # k.append(var)\r\n ans+=min(var,m[5])*m[2]\r\n var = var-m[5]\r\n if(var<0):\r\n var = 0\r\n # k.append(var)\r\n ans+=var*m[3]\r\n# print(k)\r\n# print(ans)\r\nprint(ans+c*m[1])\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# c=0\r\n# h=int(len(l)/2)\r\n# # print(h)\r\n# for i in range(0,h):\r\n# b1=l[2*i+1]-l[2*i] \r\n# c=b1+c\r\n# # print(\"1\")\r\n# # print(c)\r\n# z=0\r\n# x=0\r\n# y=0\r\n# if m[0]>1: \r\n# for i in range(0,h-1) : \r\n# if l[2*i+2]-l[2*i+1]<m[4]:\r\n# a=l[2*i+2]-l[2*i+1] \r\n# z=z+a\r\n# if i==h-2:\r\n# print(z*m[1]+c*m[1])\r\n# print(\"2\")\r\n \r\n\r\n# elif m[3]<l[2*i+2]-l[2*i+1]<m[5]:\r\n# b=l[2*i+2]-l[2*i+1]-m[4] \r\n# x=x+b\r\n# if i==h-2:\r\n# print(x*m[2]+c*m[1]+m[1]*m[4])\r\n# print(\"3\") \r\n# elif m[5]<l[2*i+2]-l[2*i+1]:\r\n# e=l[2*i+2]-l[2*i+1] -m[4]-m[5]\r\n# y=y+e\r\n# if i==h-2:\r\n# print(m[5]*m[2]+c*m[1]+m[1]*m[4]+e*m[3])\r\n# print(\"4\") \r\n# if m[0]==1:\r\n# print(c*m[1]) \r\n# # print(\"5\") \r\n\r\n", "mas1=input().split()\r\nn=int(mas1[0])\r\nP1=int(mas1[1])\r\nP2=int(mas1[2])\r\nP3=int(mas1[3])\r\nT1=int(mas1[4])\r\nT2=int(mas1[5])\r\nmas=[]\r\nfor i in range(n):\r\n\tss=input().split()\r\n\tss[0]=int(ss[0])\r\n\tss[1]=int(ss[1])\r\n\tmas.append(ss)\r\ns=0\r\nfor i in range(n):\r\n\ts=s+(mas[i][1]-mas[i][0])*P1\r\nfor i in range(n-1):\r\n\td=mas[i+1][0]-mas[i][1]\r\n\td1=d-T1\r\n\tif d1>0:\r\n\t\ts=s+T1*P1\r\n\t\td2=d1-T2\r\n\t\tif d2>0:\r\n\t\t\ts=s+T2*P2\r\n\t\t\ts=s+d2*P3\r\n\t\telse:\r\n\t\t\ts=s+d1*P2\r\n\telse:\r\n\t\ts=s+d*P1\r\nprint(s)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\ntimes = []\r\nstart, end = map(int, input().split())\r\ntotal = (end - start) * p1\r\ntemp = end\r\nfor i in range(0, n - 1):\r\n start, end = map(int, input().split())\r\n interval = start - temp\r\n if interval <= t1:\r\n total += interval * p1\r\n elif (interval > t1 and interval <= t1 + t2):\r\n total += (t1 * p1) + ((interval - t1) * p2)\r\n elif (interval > (t1 + t2)):\r\n total += (t1 * p1) + (t2 * p2) + ((interval - (t1 + t2)) * p3)\r\n total += (end - start) * p1\r\n temp = end\r\nprint(total)\r\n", "\r\na=map(int,input().split())\r\nn,p1,p2,p3,t1,t2=a\r\nl,r=[],[]\r\nres=0\r\nfor i in range(n):\r\n m=map(int,input().split())\r\n a,b=m\r\n l.append(a),r.append(b)\r\n res+=p1*(r[i]-l[i])\r\n if i==0:\r\n continue\r\n t=l[i]-r[i-1]\r\n res+=p1*min(t1,t)+p2*min(t2,max(t-t1,0))+p3*max(t-t1-t2,0)\r\nprint(res) \r\n\r\n", "n,p1,p2,p3,t1,t2 = map(int, input().split())\r\narr=[]\r\n\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n arr.append([l,r])\r\ncnt=0\r\nfor i in range(n):\r\n j=0\r\n k=j+1\r\n ret=arr[i][j]\r\n while arr[i][j]!=arr[i][k]:\r\n cnt+=p1\r\n arr[i][j]+=1\r\n arr[i][j]=ret\r\n\r\ni=1\r\nwhile i!=n:\r\n j=0\r\n t=i-1\r\n tmp=arr[t][k]+t1\r\n tp=tmp+t2\r\n b=arr[i][0]\r\n while arr[t][1]<b:\r\n if arr[t][1]<tmp:\r\n \r\n arr[t][1]+=1\r\n cnt+=p1\r\n elif arr[t][1]<tp:\r\n \r\n arr[t][1]+=1\r\n cnt+=p2\r\n elif arr[t][1]<b:\r\n \r\n arr[t][1]+=1\r\n cnt+=p3\r\n \r\n i+=1\r\n\r\nprint(cnt)\r\n", "n, p1, p2, p3, t1, t2 = [int(item) for item in input().split(' ')]\r\nl1, r1 = [int(item) for item in input().split(' ')]\r\nans = (r1-l1)*p1\r\nfor i in range(n-1):\r\n l2, r2 = [int(item) for item in input().split(' ')]\r\n ans += (r2 - l2)*p1\r\n gap = l2 - r1\r\n if gap > t1:\r\n ans += t1 * p1\r\n gap = gap - t1\r\n else:\r\n ans += gap*p1\r\n gap = 0\r\n if gap > t2:\r\n ans += t2 * p2\r\n gap = gap - t2\r\n else:\r\n ans += gap*p2\r\n gap = 0\r\n\r\n ans += gap*p3\r\n l1,r1 = l2,r2\r\n\r\nprint(ans)\r\n", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\nl,r=map(int,input().split())\r\ns=(r-l)*p1\r\nfor _ in range(1,n):\r\n\ttmp=r\r\n\tl,r=map(int,input().split())\r\n\td = l-tmp\r\n\ts+=(r-l)*p1\r\n\tif d>t1+t2:\r\n\t\ts+=(d-t1-t2)*p3 + t2*p2 + t1*p1\r\n\telif d>t1:\r\n\t\ts+=(d-t1)*p2 + t1*p1\r\n\telse:\r\n\t\ts+=d*p1\r\nprint(s)", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\nans,l1,r1=0,0,0\r\nfor i in range(n):\r\n l2,r2=map(int,input().split())\r\n ans+=(r2-l2)*p1\r\n if r1!=0:\r\n t=l2-r1\r\n ans+=min(t1,t)*p1+min(max(t-t1,0),t2)*p2+max(t-t1-t2,0)*p3\r\n l1,r1=l2,r2\r\nprint(ans)\r\n \r\n", "#! /usr/bin/env python3\n\nimport itertools\nimport sys\n\n\ndef main():\n solve()\n\n\ndef solve():\n data = sys.stdin.readlines()\n p1, p2, p3, t1, t2, intervals = parse(data)\n consumption = calc_consumption(p1, p2, p3, t1, t2, intervals)\n print(consumption)\n\n\ndef parse(data):\n _, p1, p2, p3, t1, t2 = tuple(int(s) for s in data[0].split())\n intervals = tuple(parse_line(line) for line in data[1:])\n return p1, p2, p3, t1, t2, intervals\n\n\ndef parse_line(line):\n ls, rs = line.split()\n return (int(ls), int(rs))\n\n\ndef calc_consumption(p1, p2, p3, t1, t2, intervals):\n consumption = 0\n cur_time = intervals[0][0]\n for l, r in intervals:\n consumption += calc_idle_consumption(l - cur_time, p1, p2, p3, t1, t2)\n consumption += (r - l) * p1\n cur_time = r\n\n return consumption\n\n\ndef calc_idle_consumption(duration, p1, p2, p3, t1, t2):\n dur = min(duration, t1)\n consumption = dur * p1\n duration -= dur\n\n dur = min(duration, t2)\n consumption += dur * p2\n duration -= dur\n\n return consumption + duration * p3\n \n\nif __name__ == '__main__':\n main()\n", "n, P1, P2, P3, T1, T2 =map(int,input().split())\r\nprevious=0\r\ntotal_sum=0\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n td = l-previous\r\n if i>0:\r\n if td<=T1:\r\n total_sum+=td*P1\r\n elif td<=T2+T1:\r\n total_sum+=T1*P1\r\n total_sum+=(td-T1)*P2\r\n else:\r\n total_sum+=T1*P1\r\n total_sum+=T2*P2 \r\n total_sum+=(td-T1-T2)*P3\r\n total_sum+=(r-l)*P1\r\n previous=r\r\nprint(total_sum)", "import sys\r\n\r\n# sys.stdin = open(\"2.in\", \"r\")\r\n\r\nn, P1, P2, P3, T1, T2 = map(int, input().split())\r\n\r\nres = 0\r\nlast_r = -1\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n\r\n if last_r != -1:\r\n unmoved = l - last_r\r\n res += min(unmoved, T1) * P1\r\n\r\n unmoved = max(0, unmoved-T1)\r\n res += min(unmoved, T2) * P2\r\n\r\n unmoved = max(0, unmoved-T2)\r\n res += unmoved * P3\r\n \r\n res += (r-l) * P1\r\n last_r = r\r\n\r\nprint(res)\r\n\r\n\r\n\r\n\r\n", "\r\nn, p1, p2, p3, t1, t2 = map(int, input().split()) # take the input\r\nans = 0\r\nprevious = -1 # will be the value of last end value from periods\r\n\r\nwhile n > 0: # for n periods of time\r\n n -= 1\r\n start, end = map(int, input().split()) # take the time period\r\n ans += (end - start) * p1 # this was an active period so we multiply to p1 and add to answer\r\n if previous != -1: # here we find if we have one more n period\r\n x = start - previous # find time when no one worked at the laptop\r\n if x > t1: # if x is bigger this means that t1 time laptop was active\r\n ans += t1 * p1 # and we add this time to answer\r\n x -= t1 # here we find the remaining time\r\n if x > t2: #if remaining time is bigger than t2, this means that laptop go to eco mode\r\n ans += t2 * p2 # add power laptop spend on eco mode to answer\r\n x -= t2# from remaining time we exclude the previous period t2\r\n ans += x * p3 # the remaining time is multiplied to power laptop spend in sleep mode, because here is no time limit\r\n else: # if remaining time is smaller than t2, this means that x is period of time that need to be multiplied to p2\r\n ans += x * p2 # this is computed and added to answer\r\n else:# if x is smaller than t1 period, this means that x includes in time laptop is still active, but nobody works at him\r\n ans += x * p1 # so x is multiply to active power spending p1\r\n previous = end # set previous to end , to start in future iteration the needed operations if we have one more n time period\r\nprint(ans) # print the final asnwer", "n,p1,p2,p3,t1,t2 = map(int,input().split())\r\nlast = 0\r\npower= 0\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n power+=(b-a)*p1\r\n total = (a-last) * (last>0)\r\n power+= min(t1,total)*p1 + max(0,min(total-t1,t2))*p2 + max(total-t1-t2,0)*p3\r\n last=b\r\nprint(power)\r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\np = 0\r\nfor i in range(n):\r\n if i == 0:\r\n l, r = map(int, input().split())\r\n p = (r-l)*p1\r\n continue\r\n x = r\r\n l, r = map(int, input().split())\r\n p += (r-l)*p1\r\n if (l-x) > t1+t2:\r\n p += (l-x-t1-t2)*p3 + t2*p2 + t1*p1\r\n elif (l-x) > t1:\r\n p += (l-x-t1) * p2 + t1*p1\r\n else:\r\n p += (l-x)*p1\r\nprint(p)\r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nl, r = map(int, input().split())\r\nans = (r - l) * p1\r\nfor i in range(n - 1):\r\n _l, _r = map(int, input().split())\r\n time = _l - r\r\n if time > t1:\r\n time -= t1\r\n ans += t1 * p1\r\n if time > t2:\r\n time -= t2\r\n ans += t2 * p2\r\n ans += time * p3\r\n else:\r\n ans += time * p2\r\n else:\r\n ans += time * p1\r\n ans += (_r - _l) * p1\r\n r, l = _r, _l\r\nprint(ans)\r\n \r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\n\naccum = 0\nfor i in range(n):\n l, r = map(int, input().split())\n if i == 0:\n r_before = l\n diff, r_before = l - r_before, r\n in_p1 = min(diff, t1)\n in_p2 = min(max(diff - in_p1, 0), t2)\n in_p3 = max(diff - in_p1 - in_p2, 0)\n accum += (r - l + in_p1) * p1 + in_p2 * p2 + in_p3 * p3\n\nprint(accum)\n", "inputs=list(map(int,input().split()))\r\nn=inputs[0]\r\nPs=inputs[1:4]\r\nTs=inputs[4:6]\r\npower=0\r\ntimes=[]\r\nfor i in range(n):\r\n time_i=list(map(int,input().split()))\r\n for time in time_i:\r\n times.append(time)\r\n power+=(time_i[1]-time_i[0])*Ps[0]\r\nfor i in range(2,len(times),2):\r\n rest_time=times[i]-times[i-1]\r\n p1_time=min(rest_time,Ts[0])\r\n rest_time-=p1_time\r\n p2_time=min(rest_time,Ts[1])\r\n rest_time-=p2_time\r\n power+=p1_time*Ps[0]+p2_time*Ps[1]+rest_time*Ps[2]\r\nprint(power)", "n,p,q,r,t,u=[int(i) for i in input().split()]\r\nl,m=[int(i) for i in input().split()]\r\ns=p*(m-l)\r\nb=m\r\nfor i in range(n-1):\r\n l,m=[int(i) for i in input().split()]\r\n if l-b<t:s+=p*(l-b)\r\n elif l-b<t+u:s+=p*t+q*(l-b-t)\r\n else:s+=p*t+q*u+r*(l-b-t-u)\r\n s+=p*(m-l)\r\n b=m\r\nprint(s)\r\n", "n, P1, P2, P3, T1, T2 = map(int, input().split())\r\nl = []\r\nr = []\r\nans = 0\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n l += [x]\r\n r += [y]\r\n ans += (y-x) * P1\r\n\r\nfor i in range(1, n):\r\n h = l[i] - r[i-1]\r\n if h < T1:\r\n ans += P1 * h\r\n else:\r\n ans += P1 * T1\r\n h -= T1\r\n if h < T2:\r\n ans += h * P2\r\n else:\r\n ans += T2 * P2\r\n h -= T2\r\n ans += h * P3\r\nprint(ans)", "def pcc():\n n,p1,p2,p3,t1,t2 = map(int, input().split())\n\n first = True\n sum = 0\n\n for i in range(n):\n l,r = map(int, input().split())\n if first:\n sum += (r-l) * p1\n first = False\n else:\n sum += (r-l) * p1\n i = 0\n while i < l - last:\n if i < t1:\n sum += p1\n elif i < t1+t2:\n sum += p2\n else:\n sum += p3\n i+=1\n last = r\n return sum\n\nprint(pcc())\n\n", "#!/usr/bin/env python3\n\nn, p1, p2, p3, t1, t2 = [int(x) for x in input().split(' ')]\n\np=0\n\nll=None\nfor i in range(n):\n l, r = [int(x) for x in input().split(' ')]\n p += (r-l)*p1\n if ll is not None:\n d=l-ll\n if d>0:\n d=min(d,t1)\n p += d*p1\n ll +=d\n d=l-ll\n if d>0:\n d=min(d,t2)\n p+= d*p2\n ll += d\n d=l-ll\n if d>0:\n p+=d*p3\n ll=r\n\nprint(p)\n\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\ncount = 0\r\nlast = 10e6\r\n\r\nfor i in range(n):\r\n work = list(map(int, input().split()))\r\n count += (work[1] - work[0]) * p1 # w wasted during active work\r\n if work[0] > last: # w wasted during sleep/standby\r\n if t1 > work[0] - last:\r\n count += (work[0] - last) * p1\r\n elif t1 + t2 > work[0] - last:\r\n count += (work[0] - last - t1) * p2 + t1 * p1\r\n else:\r\n count += (work[0] - last - t1 - t2) * p3 + t1 * p1 + t2 * p2\r\n\r\n last = work[1]\r\n\r\nprint(count)\r\n", "\r\nl1 = [int(x) for x in input().split()]\r\n\r\nn,P1,P2,P3,T1,T2 = l1[0],l1[1],l1[2],l1[3],l1[4],l1[5]\r\nl2 = []\r\nans=0\r\n\r\nfor _ in range(n):\r\n l2.append([int(x) for x in input().split()])\r\n\r\nfor i in l2:\r\n ans+=P1*(i[1]-i[0])\r\n#print(ans)\r\nfor i in range(n-1):\r\n gap = l2[i+1][0]-l2[i][1]\r\n #print(gap)\r\n if gap>T1+T2:\r\n #print(\"HERE\",T1,P1,P2,T2,gap-T2,P3)\r\n ans+=T1*P1+P2*(T2)+(gap-(T2+T1))*P3\r\n \r\n elif gap>T1:\r\n #print(\"THERE\")\r\n ans+=(gap-T1)*P2 + T1*P1\r\n \r\n else:\r\n ans+=gap*P1\r\nprint(ans)", "ans=0\nn, p1, p2, p3, t1, t2 = map(int, input().split())\nfor i in range(1, n+1):\n l, r = map(int, input().split())\n if i > 1:\n ans += min(t1, l-s) * p1\n if l - s > t1:\n ans += min(l-s-t1, t2) * p2\n if l - s > t1 + t2:\n ans += (l-s-t1-t2) * p3\n ans += (r-l) * p1\n s = r\nprint(ans)\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\not = 0\r\ncom = 0\r\nvec = []\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n ot += p1 * (y - x)\r\n\r\n if n == 1:\r\n break\r\n elif com == 0:\r\n com = y\r\n else:\r\n vec.append(x - com)\r\n com = y\r\n\r\nfor a in vec:\r\n if a > t1:\r\n ot += p1 * t1\r\n if a - t1 > t2:\r\n ot += p2 * t2\r\n ot += p3 * (a - t1 - t2)\r\n else:\r\n ot += p2 * (a - t1)\r\n else:\r\n ot += p1 * a\r\n\r\nprint(ot)", "n, p1, p2, p3, t1, t2 = [int(num) for num in input().split()]\nperiods = []\nfor i in range(n):\n l, r = [int(num) for num in input().split()]\n periods.append((l, r))\nperiods.sort()\nans = 0\nfor i in range(n - 1):\n end1 = min(periods[i][1] + t1, periods[i+1][0])\n end2 = min(periods[i][1] + t1 + t2, periods[i+1][0])\n ans += (end1 - periods[i][0]) * p1 + (end2 - end1) * p2 + (periods[i+1][0] - end2) * p3\nans += (periods[n-1][1] - periods[n-1][0]) * p1\nprint(ans)", "n, P1, P2, P3, T1, T2 = map(int,input().split())\r\nres = 0\r\nlast_end = float(\"inf\")\r\n\r\n\r\nfor work in range(n):\r\n start, end = map(int, input().split())\r\n downtime = start - last_end\r\n if downtime > 0:\r\n res += P1* min(T1, downtime)\r\n downtime -= T1\r\n if downtime > 0:\r\n res += P2 * min(T2, downtime)\r\n downtime -= T2\r\n if downtime > 0:\r\n res += P3 * downtime\r\n res += (end - start) * P1\r\n last_end = end\r\nprint(res)\r\n\r\n", "lines,P1,P2,P3,T1,T2 = list(map(int, input().split(\" \")))\r\nwork,power = [],0\r\nfor line in range(lines):\r\n\twork.append((list(map(int, input().split(\" \")))))\t\t#pushing every work unit into the array\r\nfor i in range(len(work)-1):\t\t\t\t\r\n\tpower += P1*(work[i][1] - work[i][0])\t\t\t\t#Formula P2 = P1 +Work1/Work2\r\n\ttime_interval = work[i+1][0] - work[i][1]\r\n\tif T1 < time_interval:\r\n\t\tpower +=P1*T1\r\n\t\tif T1+T2 < time_interval:\t\t\t# checking for sleep state\r\n\t\t\tpower +=P2*T2\r\n\t\t\tpower +=P3*(time_interval-T1-T2)\r\n\t\telse: power+= P2*(time_interval-T1)\r\n\telse: power +=P1*time_interval\r\npower +=P1*(work[-1][1] - work[-1][0])\t\t#array[-1] represents last element\r\nprint(power)\r\n", "def find_length(n):\r\n r = 0\r\n while n != 0:\r\n n = n // 10\r\n r += 1\r\n return r\r\n\r\n\r\ndef count_zeros(n):\r\n r = 0\r\n while n != 0:\r\n if n % 10 == 0:\r\n r += 1\r\n else:\r\n break\r\n n = n // 10\r\n return r\r\n\r\n\r\ndef factorial(n):\r\n if n == 1:\r\n return 1\r\n return n * factorial(n - 1)\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b / gcd(a, b)\r\n\r\n\r\ndef remove_all_zero(n):\r\n while (n != 0) & (n % 10 == 0):\r\n n = n / 10\r\n return n\r\n\r\n\r\ndef is_prime(n):\r\n if n == 1:\r\n return False\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n return False\r\n i += 1\r\n return True\r\n\r\n\r\ndef sieve(n):\r\n arr = [True] * (n + 1)\r\n i = 2\r\n while i * i <= n:\r\n if is_prime(i):\r\n j = i * i\r\n while j <= n:\r\n arr[j] = False\r\n j += i\r\n i += 1\r\n return [i for i in range(2, n + 1) if arr[i]]\r\n\r\n\r\ndef get_all_subsequences(s):\r\n n = len(s)\r\n r = []\r\n for i in range(1, 1 << n):\r\n x = ''\r\n for j in range(n):\r\n if (i >> j) & 1:\r\n x += s[j]\r\n r.append(x)\r\n return r\r\n\r\n\r\ndef if_sorted(arr):\r\n for i in range(1, len(arr)):\r\n if arr[i] < arr[i - 1]:\r\n return False\r\n return True\r\n\r\n\r\n##################################################################\r\n\r\n# find_length(n)\r\n# count_zeros(n)\r\n# factorial(n)\r\n# gcd(a, b)\r\n# lcm(a, b)\r\n# remove_all_zero(n)\r\n# is_prime(n)\r\n# sieve(n)\r\n# get_all_subsequences(s)\r\n\r\n\r\n##################################################################\r\n\r\nclass Node:\r\n def __init__(self, val):\r\n self.val = val\r\n self.prev = None\r\n\r\n\r\ndef main():\r\n # n, k = tuple(map(int, input().strip().split()))\r\n # n = list(map(int, input().strip().split()))[0]\r\n a = list(map(int, input().strip().split()))\r\n arr = []\r\n for i in range(a[0]):\r\n r = 0\r\n m, n = tuple(map(int, input().strip().split()))\r\n arr.append((m, n))\r\n r, p = 0, 0\r\n for m, n in arr:\r\n r += (n - m) * a[1]\r\n if p == 0:\r\n p = n\r\n continue\r\n x = m - p\r\n if x >= (a[4] + a[5]):\r\n r += (x - (a[4] + a[5])) * a[3]\r\n r += a[5] * a[2]\r\n r += a[4] * a[1]\r\n elif x >= a[4]:\r\n r += (x - a[4]) * a[2]\r\n r += a[4] * a[1]\r\n else:\r\n r += x * a[1]\r\n p = n\r\n print(r)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# https://codeforces.com/problemset/problem/10/A\r\n\r\ndef func_sol(raw_data):\r\n lines = raw_data.split('\\n')[:-1]\r\n n, p1, p2, p3, t1, t2 = list(map(int, lines[0].split(' ')))\r\n periods = [list(map(int, line.split(' '))) for line in lines[1:]]\r\n\r\n total_power = 0\r\n last_timestamp = periods[0][0]\r\n for period in periods:\r\n total_power += (period[1] - period[0]) * p1\r\n afk = period[0] - last_timestamp\r\n if afk > 0:\r\n total_power += min(t1, afk) * p1\r\n afk -= min(t1, afk)\r\n if afk > 0:\r\n total_power += min(t2, afk) * p2\r\n afk -= min(t2, afk)\r\n if afk > 0:\r\n total_power += afk * p3\r\n last_timestamp = period[1]\r\n\r\n return str(total_power)\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", "n,p1,p2,p3,t1,t2 = map(int,input().split())\r\nll = []\r\nrr = []\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n ll.append(l)\r\n rr.append(r)\r\n\r\ns = []\r\nfor i in range(n):\r\n if i+1 < n:\r\n if rr[i] + t1 < ll[i+1]:\r\n u = (rr[i] - ll[i])*p1 + t1*p1\r\n s.append(u)\r\n if rr[i] + t1 + t2 < ll[i+1]:\r\n p = t2 * p2 + (ll[i+1] - (rr[i]+t1+t2)) * p3\r\n s.append(p)\r\n else:\r\n p = (ll[i+1] - (rr[i] + t1)) * p2\r\n s.append(p)\r\n\r\n else:\r\n w = (ll[i+1] - ll[i])*p1\r\n s.append(w)\r\n\r\n\r\n else:\r\n v = (rr[i] - ll[i]) * p1\r\n s.append(v)\r\n\r\nprint(sum(s)) ", "n,p,q,r,s,t=map(int,input().split())\r\na=[list(map(int,input().split()))for i in range(0,int(n))]\r\ndef f(x):\r\n return p*x-(p-q)*(x-s)*int(x>s)-(q-r)*(x-s-t)*int(x>(s+t))\r\npp=0;qq=0\r\nfor i in range(len(a)):\r\n pp+=p*(a[i][1]-a[i][0])\r\nfor i in range(len(a)-1):\r\n qq+=f(a[i+1][0]-a[i][1])\r\nprint(str(pp+qq))", "n,p1,p2,p3,t1,t2 = map(int,input().split())\r\nlri = [list(map(int,input().split())) for i in range(n)]\r\nans = 0\r\nt2 += t1\r\nj = 0\r\nnum = 0\r\nfor i in range(lri[0][0]+1,lri[-1][1]+1):\r\n while j < n and i > lri[j][1]:\r\n j += 1\r\n if i >= lri[j][0]:\r\n ans += p1\r\n num = 0\r\n else:\r\n num += 1\r\n if num >= t2:\r\n ans += p3\r\n elif num >= t1:\r\n ans += p2\r\n else:\r\n ans += p1\r\nprint(ans)\r\n", "n,P1,P2,P3,T1,T2 = map(int,input().split())\r\nbprice_ = 0\r\nfor i in range(n):\r\n\tl,r = map(int,input().split())\r\n\tbprice_= bprice_ + (r-l)*P1\r\n\t# print(bprice_)\r\n\tif i > 0:\r\n\t\tbprice_ = bprice_ + P1*min(l-r1,T1)+\\\r\n\t\tP2*min(max(l-r1-T1,0),T2)+P3*max(l-r1-T1-T2,0)\r\n\tl1,r1 = l,r\r\nprint(bprice_)\r\n", "s = list(map(int, input().split()))\r\n\r\n# 参数 \r\np1 = s[1]\r\np2 = s[2]\r\np3 = s[3]\r\nt1 = s[4]\r\nt2 = s[5]\r\n\r\ntext = []\r\nlines = s[0]\r\nfor i in range(lines):\r\n text += input().split('\\n')\r\n # text += input()+ 'rr' + '\\n'\r\n\r\nleftlist = list(map(lambda x: int(x.split()[0]), text))\r\nrightlist = list(map(lambda x: int(x.split()[1]), text))\r\n\r\ntime1 = 0 # 纯工作时间 \r\nfor i in range(len(leftlist)):\r\n worktm = rightlist[i] - leftlist[i]\r\n time1 = time1+worktm\r\n\r\ntimelist = [] # 非工作时间列表 \r\nfor i in range(len(leftlist)-1):\r\n funtime = leftlist[i+1]-rightlist[i]\r\n timelist.append(funtime)\r\n\r\ndef funt(x):\r\n if x <= t1:\r\n sum = x*p1\r\n elif x > t1 and x-t1 <= t2:\r\n sum = t1*p1 + (x-t1)*p2\r\n else:\r\n sum = t1*p1 + t2*p2 + (x-t1-t2)*p3\r\n return sum\r\n \r\nsumlist = list(map(funt, timelist))\r\n\r\n# 最终结果 \r\ntotal = time1*p1 + sum(sumlist)\r\n\r\nprint(total)\r\n\r\n\r\n", "\"\"\"\n4 76 32 38 48 48\n1138 1367\n1424 1431\n\n21638 != 21872\n\"\"\"\n\nn, p1, p2, p3, t1, t2 = map(int, input().split())\n\ntotal_consumption = 0\nprev = None\nfor _ in range(n):\n l, r = map(int, input().split())\n\n if prev:\n if l - prev < t1:\n total_consumption += (l - prev) * p1\n elif t1 <= l - prev < t1 + t2:\n total_consumption += t1 * p1 + (l - prev - t1) * p2\n elif t1 + t2 <= l - prev:\n total_consumption += t1 * p1 + t2 * p2 + (l - prev - t1 - t2) * p3\n\n total_consumption += (r - l) * p1\n prev = r\n\nprint(total_consumption)\n", "def cons(remTime, P1, P2, P3, T1, T2):\r\n mNorm = min(T1, remTime)\r\n remTime -= mNorm\r\n mScre = min(T2, remTime)\r\n remTime -= mScre\r\n return P1 * mNorm + P2 * mScre + P3 * remTime \r\n\r\nlst, firstRun = [], True\r\nfor line in open(0):\r\n if firstRun: \r\n n, P1, P2, P3, T1, T2 = map(int, line.split())\r\n firstRun = False\r\n else:\r\n lst.append(tuple(map(int, line.split())))\r\n \r\nres = 0\r\nfor i, x in enumerate(lst):\r\n L, R = x\r\n upto = R if i == len(lst)-1 else lst[i+1][0]\r\n res += P1*(R - L) + cons(upto - R, P1, P2, P3, T1, T2)\r\nprint(res)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nans, t = 0, 1e9\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n ans += (r - l) * p1 \r\n l -= t \r\n ans += max(l, 0) * p1 + max(l - t1, 0) * (p2 - p1) + max(l - t1 - t2, 0) * (p3 - p2)\r\n t = r\r\nprint(ans)\r\n", "num_tasks, rate_A, rate_B, rate_C, time_interval_1, time_interval_2 = map(int, input().split())\r\n\r\ntotal_cost = 0\r\nprevious_time = -1\r\n\r\nfor _ in range(num_tasks):\r\n task_start, task_finish = map(int, input().split())\r\n \r\n if previous_time < 0:\r\n previous_time = task_start\r\n \r\n total_cost += rate_A * (task_finish - task_start)\r\n \r\n idle_time = task_start - previous_time\r\n \r\n if idle_time > time_interval_1 + time_interval_2:\r\n total_cost += (idle_time - time_interval_1 - time_interval_2) * rate_C\r\n idle_time = time_interval_1 + time_interval_2\r\n \r\n if idle_time > time_interval_1:\r\n total_cost += (idle_time - time_interval_1) * rate_B\r\n idle_time = time_interval_1\r\n \r\n total_cost += idle_time * rate_A\r\n \r\n previous_time = task_finish\r\n\r\nprint(total_cost)\r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nresult = b = time = 0\r\nfor i in range(n):\r\n\tl, r = map(int, input().split())\r\n\tphase = 1\r\n\twhile time!=l and i!=0:\r\n\t\tif phase==1:\r\n\t\t\tif l-time<t1:\r\n\t\t\t\tresult+=(l-time)*p1\r\n\t\t\t\ttime+=(l-time)\r\n\t\t\telse:\r\n\t\t\t\tresult+=t1*p1\r\n\t\t\t\tphase=2\r\n\t\t\t\ttime+=t1\r\n\t\telif phase==2:\r\n\t\t\tif l-time<t2:\r\n\t\t\t\tresult+=(l-time)*p2\r\n\t\t\t\ttime+=(l-time)\r\n\t\t\t\tphase=1\r\n\t\t\telse:\r\n\t\t\t\tresult+=t2*p2\r\n\t\t\t\tphase=3\r\n\t\t\t\ttime+=t2\r\n\t\telse:\r\n\t\t\tresult+=(l-time)*p3\r\n\t\t\ttime+=(l-time)\r\n\t\t\tphase=1\r\n\tresult+=(r-l)*p1\r\n\ttime = r\r\nprint(result)", "#10A - Power Consumption\r\nfrom sys import stdin\r\n \r\nn, P1, P2, P3, T1, T2 = map(int, input().split())\r\nlast = list(map(int, input().split()))\r\n \r\nrest = (last[1]-last[0]) * P1 \r\n# print('*', rest)\r\n \r\nfor i in range(1, n):\r\n current = list(map(int, stdin.readline().split()))\r\n d = current[0] - last[1]\r\n# print( '*', min(d, T1) * P1)\r\n rest += min(d, T1) * P1\r\n# print ('*', min(max(d - T1, 0), T2) * P2)\r\n rest += min(max(d - T1, 0), T2) * P2\r\n rest += max(d - (T1+T2), 0) * P3\r\n rest += (current[1]-current[0]) * P1\r\n last = current\r\n \r\n \r\nprint(rest)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\ncurrent = -1\r\nres = 0\r\nfor _ in range(n):\r\n a1, a2 = map(int, input().split())\r\n if current == -1:\r\n current = a1\r\n res += p1 * (a2 - a1)\r\n s = a1 - current\r\n if s > t1:\r\n res += t1 * p1\r\n s -= t1\r\n if s > t2:\r\n res += t2 * p2 + (s - t2) * p3\r\n else:\r\n res += s * p2\r\n else:\r\n res += s * p1\r\n current = a2\r\nprint(res)", "[n, p1, p2, p3, t1, t2] = list(map(int, input().split()))\r\n\r\nans = 0\r\ntime = -1\t# ending time of prev usage\r\nrate = 0\r\nfor i in range(n):\r\n\t[be, en] = list(map(int, input().split()))\r\n\tif (time >= 0):\r\n\t\tpassed = be - time\r\n\t\tif (passed <= t1):\r\n\t\t\tans += passed * p1\r\n\t\telif (passed <= t1 + t2):\r\n\t\t\tans += t1 * p1 + (passed - t1) * p2\r\n\t\telse:\r\n\t\t\tans += t1 * p1 + t2 * p2 + (passed - t1 - t2)*p3\r\n\tans += p1 * (en - be)\r\n\ttime = en\r\nprint (ans)\r\n", "n, a, b, c, p, q = [int(x) for x in input().split()]\r\ntime = []\r\nt1 = 0\r\nt2 = 0\r\nt3 = 0\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n time.append(l)\r\n s = (l[1] - l[0])\r\n t1 += s\r\nif n >= 2:\r\n for i in range(n - 1):\r\n s = time[i + 1][0] - time[i][1]\r\n t1 += min(p, s)\r\n if s > p:\r\n t2 += min(q, s - p)\r\n if s > p + q:\r\n t3 += s - p - q\r\nnum = t1 * a + t2 * b + t3 * c\r\nprint(int(num))\r\n", "# LUOGU_RID: 101440442\n(n, p1, p2, p3, t1, t2), *a = [[*map(int, s.split())] for s in open(0)]\r\nans = 0\r\nfor l, r in a:\r\n ans += p1 * (r - l)\r\nfor i in range(n - 1):\r\n t = a[i + 1][0] - a[i][1]\r\n if t > t1 + t2:\r\n ans += p3 * (t - t1 - t2)\r\n t = t1 + t2\r\n if t > t1:\r\n ans += p2 * (t - t1)\r\n t = t1\r\n ans += p1 * t\r\nprint(ans)", "put = [int(x) for x in input().split()]\r\n\r\nn = put[0]\r\nP1 = put[1]\r\nP2 = put[2]\r\nP3 = put[3]\r\nT1 = put[4]\r\nT2 = put[5]\r\nans = 0\r\n#intervals = [int(x) for x in input().split()]\r\nintervals = []\r\nfor i in range(n):\r\n local = [int(x) for x in input().split()]\r\n intervals.append(local)\r\n\r\n\r\nans += ((intervals[0][1] - intervals[0][0]) * P1)\r\n\r\nfor i in range(1,n):\r\n ans += (intervals[i][1] - intervals[i][0]) * P1\r\n gap = intervals[i][0] - intervals[i - 1][1]\r\n if (gap - T1 >= 0):\r\n ans += T1 * P1\r\n gap -= T1\r\n else :\r\n ans += gap * P1\r\n gap = 0\r\n if (gap - T2 >= 0):\r\n ans += T2 * P2\r\n gap -= T2\r\n else :\r\n ans += gap * P2\r\n gap = 0\r\n if (gap > 0):\r\n ans += gap * P3\r\nprint(ans)\r\n", "lis1 = [int(x) for x in input().split(\" \")]\r\nlis = []\r\n[n, p1, p2, p3, t1, t2] = lis1\r\nlis1 = []\r\nfor i in range(n):\r\n lis += [list(map(int, input().split(\" \")))]\r\na = sum(list(i[1]-i[0] for i in lis))\r\nc, d = 0, 0\r\nfor i in range(n-1):\r\n b = lis[i+1][0]-lis[i][1]\r\n if b < t1:\r\n a += b\r\n elif b <= t2 + t1:\r\n a += t1\r\n c += b - t1\r\n else:\r\n a += t1\r\n c += t2\r\n d += b - t2 - t1\r\nprint(a*p1 + c * p2 + d * p3)", "#import sys\r\n#sys.stdin = open(\"test.in\", \"r\")\r\npower = 0\r\n\r\n\r\nN, Pon, Psave, Psleep, Ton, Tsave = map(int, input().split())\r\n#print(Pon, Psave, Psleep, Ton, Tsave)\r\nactivity = []\r\nfor _ in range (0,N,1):\r\n activity.append(list(map(int,input().split())))\r\n#print(activity)\r\nlast_on = activity[0][0]\r\n#print(last_on)\r\nfor a in activity:\r\n off=a[0]-last_on\r\n power += (a[1]-a[0])*Pon\r\n if off>Ton+Tsave:\r\n power+=Ton*Pon\r\n power+=Tsave*Psave\r\n power+=(off-Ton-Tsave)*Psleep\r\n elif off>Ton:\r\n power+=Ton*Pon\r\n power+=(off-Ton)*Psave\r\n else:\r\n power+=off*Pon\r\n last_on = a[1]\r\n #print(power)\r\n #print(off)\r\nprint(power)\r\n\r\n\r\n", "n,p1,p2,p3,t1,t2=map(int,input().split(\" \"))\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split(\" \"))\r\n l.append(a)\r\n l.append(b)\r\np=0\r\nfor k in range(n-1):\r\n d=l[2*k+1]-l[2*k]\r\n g=l[2*k+2]-l[2*k+1]\r\n if g==0:\r\n p=p+d*p1\r\n elif g<=t1 and g>0:\r\n p=p+(g+d)*p1\r\n elif g>t1 and g<=t1+t2:\r\n p=p+(t1+d)*p1+(g-t1)*p2\r\n elif g>t1+t2:\r\n p=p+(t1+d)*p1+t2*p2+(g-t1-t2)*p3\r\np=p+p1*(l[2*n-1]-l[2*n-2])\r\nprint(p)\r\n", "import sys\r\ndef rr(): return sys.stdin.readline().rstrip()\r\ndef rri(): return int(rr())\r\ndef rrl(): return list(map(int, rr().split()))\r\ndef rrt(): return tuple(map(int, rr().split()))\r\ndef rrle(): return (line.rstrip() for line in sys.stdin.readlines())\r\ndef rrtl(): return [tuple(map(int, l.split())) for l in rrle()]\r\nfrom collections import defaultdict\r\ndef mus(d=lambda: 0): return defaultdict(lambda: defaultdict(d))\r\ndef dd0(d=lambda: 0): return defaultdict(d)\r\ndef ms(x, y, d=0): return [[0]*y for i in range(x)]\r\ndef ar(x, d=0): return [d]*x\r\ndef ppm(m, n=0, x=0, y=0): print(\"\\n\".join((\"\\t\".join((str(m[j][i]) for j in range(y or n))) for i in range(x or n))))\r\ndef ppa(a, n): print(\"\\t\".join(map(str, a[0:n])))\r\ndef ppl(a=0, x=[1]): x[0]=a or (x[0]+1); print(\"-\"+\"- -\"*14+\"-# \"+str(x[0]-2)+\" #-\"+\"- -\"*14+\"-\")\r\ndef fltn(a): (i for sub in a for i in sub)\r\ndef yn(x): return \"YES\" if x else \"NO\"\r\nfrom itertools import accumulate\r\nfrom itertools import groupby\r\nfrom itertools import permutations\r\ndef grp(x, key=None): return ((i, sum(1 for _ in g)) for i, g in groupby(x, key=key))\r\nimport math\r\ndef rnar(): return (*rrl(), rrl())\r\ndef rn(): return (*rrl(),)\r\ndef dpp(a, b=\"\"): print(\"#| {} |#:^ {} ^:\".format(a, b))\r\nMOD17 = 10**9 + 7\r\n\r\ndef read():\r\n x = rrl()\r\n x2 = rrtl()\r\n return (*x, x2)\r\n\r\ndef solve(n, p1, p2, p3, t1, t2, wurk):\r\n wsum = sum((r - l) * p1 for l, r in wurk)\r\n for pr1, pr2 in zip(wurk, wurk[1:]):\r\n l = pr1[1]; r = pr2[0]\r\n diff = r - l\r\n\r\n working_time_after = min(diff, t1)\r\n wsum += working_time_after*p1\r\n diff -= t1\r\n if diff <= 0: continue\r\n\r\n screen_saver_time = min(diff, t2)\r\n wsum += screen_saver_time*p2\r\n diff -= t2\r\n if diff <= 0: continue\r\n\r\n sleep_time = diff\r\n wsum += sleep_time*p3\r\n \r\n ans = wsum\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n #test_count = rri()\r\n test_count = 1\r\n for _ in range(test_count):\r\n input_data = read()\r\n result = solve(*input_data)\r\n print(result)\r\n", "# 10A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_int_ary():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\nn, p1, p2, p3, t1, t2 = read_int_ary()\r\ntotal_watts = last_active = 0\r\nfor _ in range(n):\r\n l, r = read_int_ary()\r\n if last_active > 0:\r\n inactive = l - last_active\r\n s1 = min(inactive, t1)\r\n total_watts += s1 * p1\r\n s2 = min(inactive - s1, t2)\r\n total_watts += s2 * p2\r\n s3 = inactive - (s1 + s2)\r\n total_watts += s3 * p3\r\n total_watts += (r - l) * p1\r\n last_active = r\r\nprint(total_watts)", "class Laptop:\r\n def __init__(self, power_normal, power_dim, power_sleep, time_dim, time_sleep):\r\n self.power_normal = power_normal\r\n self.power_dim = power_dim\r\n self.power_sleep = power_sleep\r\n self.current_consumption = power_sleep\r\n self.time_dim = time_dim\r\n self.time_sleep = time_sleep\r\n self.consumed_power = 0\r\n self.mode = 3\r\n self.last_moved = 0\r\n self.elapsed_time = 0\r\n\r\n def tick(self):\r\n self.elapsed_time += 1\r\n self.consumed_power += self.current_consumption\r\n if self.mode == 1:\r\n if self.elapsed_time - self.last_moved == self.time_dim:\r\n self.mode = 2\r\n self.current_consumption = self.power_dim\r\n #print(\"Switching mode \" + str(self.elapsed_time))\r\n elif self.mode == 2:\r\n if self.elapsed_time - self.last_moved - self.time_dim == self.time_sleep:\r\n self.mode = 3\r\n self.current_consumption = self.power_sleep\r\n #print(\"Switching mode \" + str(self.elapsed_time))\r\n #print(self.elapsed_time, self.mode, self.consumed_power, self.current_consumption)\r\n\r\n def move(self):\r\n if self.last_moved == 0:\r\n self.consumed_power = 0\r\n self.mode = 1\r\n self.last_moved = self.elapsed_time\r\n self.current_consumption = self.power_normal\r\n\r\n\r\nif __name__ == \"__main__\":\r\n ster = [int(x) for x in input().split(\" \")]\r\n laptop = Laptop(ster[1], ster[2], ster[3], ster[4], ster[5])\r\n time_frames = [[int(x) for x in input().split(\" \")] for y in range(ster[0])]\r\n z = [0 for x in range(time_frames[-1][1]+1)]\r\n for x in time_frames:\r\n for y in range(x[0], x[1]+1):\r\n z[y] = 1\r\n for x in z:\r\n \r\n laptop.tick()\r\n if x:\r\n laptop.move()\r\n \r\n print(laptop.consumed_power)\r\n", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n j=list(map(int,input().split()))\r\n a.append(j)\r\nif n==1:\r\n print((a[0][1]-a[0][0])*p1)\r\n exit()\r\ntd=[]\r\np,q=0,1\r\nwhile q<n:\r\n td.append(a[q][0]-a[p][1])\r\n q=q+1\r\n p=p+1\r\ntotal=0\r\nfor i in range(0,n):\r\n total+=(a[i][1]-a[i][0])*p1\r\nfor i in range(len(td)):\r\n t11=min(td[i],t1)\r\n t22=min(td[i]-t1,t2)\r\n t33=td[i]-t1-t2\r\n if t22<0:\r\n t22=0\r\n if t33<0:\r\n t33=0\r\n total+=t11*p1+t22*p2+t33*p3\r\nprint(total)\r\n ", "r, f1, f2, f3, s1, s2 = map(int, input().split())\nans, ff1, rr1 = 0, 0, 0\nfor i in range(r):\n l2, r2 = map(int, input().split())\n ans += (r2 - l2) * f1\n if rr1 != 0:\n t = l2 - rr1\n ans += min(s1, t) * f1 + min(max(t - s1, 0), s2) * f2 + max(t - s1 - s2, 0) * f3\n ff1, rr1 = l2, r2\nprint(ans)\n", "n,p1,p2,p3,t1,t2 = map(int,input().split(' '))\r\nans,l2,r2 = 0,0,0\r\nfor i in range(n):\r\n l1,r1 = map(int,input().split(' '))\r\n ans = ans + p1*(r1-l1)\r\n if r2!=0:\r\n t = l1-r2\r\n ans = ans + p1*(min(t1,t))+p2*(min(t2,max(t-t1,0)))+p3*(max(0,(t-t1-t2)))\r\n l2,r2 = l1,r1\r\nprint(ans) \r\n \r\n ", "n, P1, P2, P3, T1, T2 = [int(item) for item in input().split(' ')]\r\nl1, r1 = [int(item) for item in input().split(' ')]\r\nans = (r1 - l1) * P1\r\nfor i in range(n - 1):\r\n l2, r2 = [int(item) for item in input().split(' ')]\r\n ans += (r2 - l2) * P1\r\n gap = l2 - r1\r\n if gap > T1:\r\n ans += T1 * P1\r\n gap -= T1\r\n else:\r\n ans += gap * P1\r\n gap = 0\r\n\r\n if gap > T2:\r\n ans += T2 * P2\r\n gap -= T2\r\n else:\r\n ans += gap * P2\r\n gap = 0\r\n\r\n ans += gap * P3\r\n l1, r1 = l2, r2\r\n\r\nprint(ans)\r\n\r\n'''\r\nტომი დაინტერესებულია მისი საყვარელი ლეპტოპის ენერგიის მოხმარებით.\r\nმის ლეპტოპს სამი რეჟიმი აქვს.\r\nნორმალურ რეჟიმში ლეპტოპი მოიხმარს P1 ვატს წუთში.\r\nT1 წუთის შემდეგ, რაც ტომმა მაუსი გადააძრო ან ბოლოჯერ შეეხო კლავიატურას,\r\nეკრანის დამცავი იხსნება და ენერგიის მოხმარება იცვლება P2 ვატამდე წუთში.\r\nსაბოლოოდ, სქრინსეივერის დაწყებიდან T2 წუთის შემდეგ,\r\nლეპტოპი გადადის \"ძილის\" რეჟიმში და მოიხმარს P3 ვატს წუთში.\r\nთუ ტომი ამოძრავებს მაუსს ან ეხება კლავიატურას, როდესაც ლეპტოპი მეორე ან მესამე რეჟიმშია,\r\nის გადადის პირველ (ნორმალურ) რეჟიმში.\r\nლეპტოპთან ტომის მუშაობა შეიძლება დაიყოს n დროის პერიოდად\r\nყოველი ინტერვალის განმავლობაში ტომი განუწყვეტლივ მოძრაობს მაუსის და კლავიატურაზე ღილაკებს.\r\nპირველი ხაზი შეიცავს 6 მთელ რიცხვს n, P1, P2, P3, T1, T2\r\nშემდეგი n სტრიქონი შეიცავს ტომის ნამუშევრების აღწერას.\r\nამ წრფეებიდან ყოველი i-ე შეიცავს ორ სივრცეში გამოყოფილ მთელ რიცხვს li და ri\r\nრომელიც დგას i-ის პერიოდის დასაწყისსა და დასასრულს.\r\n\r\n1 3 2 1 5 10\r\n0 10\r\n\r\n/*\r\nn - აქტოვობების რაოდენობა\r\nP1 - რამდენ კილოვატ ენერგიას ხარჯავს ლეპტოპი ჩვეულებრივ რეჟიმში მუშაობის დროს (normal mode)1 წუთის განმავლობაში\r\nP2 - რამდენ კილოვატ ენერგიას ხარჯავს ლეპტოპი ეკრანის დაზოგვის რეჟიმში მუშაობის დროს (screen saver morde)1 წუთის განმავლობაში\r\nP3 - რამდენ კილოვატ ენერგიას ხარჯავს ლეპტოპი ძილის რეჟიმში მუშაობის დროს (sleep mode)1 წუთის განმავლობაში\r\nT1 - რამდენი წუთის შემდეგ გადადის ლეპტოპი ჩვეულებრივი რეჟიმიდან ეკრანის დაზოგვის რეჟიმში normal mode => screen saver mode\r\nT2 - რამდენი წუთის შემდეგ გადადის ლეპტოპი ეკრანის დაზოგვის რეჟიმიდან ძილის რეჟიმში screen saver mode => sleep mode\r\nl - აქტივობის დაწყების წუთები\r\nr - აქტივობის დამთავრების წუთები\r\n\r\n**********************************************************************\r\nn = 1 P1 = 3 P2 = 2 P3 = 1 T1 = 5 T2 = 10\r\nl1 = 0 r1 = 10\r\n\r\nans = (10 - 0) * 3 = 30\r\n*********************************************************************\r\n\r\nn = 2 P1 = 8 P2 = 4 P3 = 2 T1 = 5 T2 = 10\r\nl1 = 20 r1 = 30\r\nl2 = 50 r2 = 100\r\n\r\nans = 10 * 8 + 5 * 8 + 10 * 4 + 5 * 2 + 50 * 8 = 570\r\n\r\nI activity => normal mode = 30 - 20 = 10 mins \r\n\r\ngap = 50 - 30 = 20\r\nnormal = 5 mins gap 20 - 5 = 15\r\nscreen saver = 10 mins gap = 15 - 10 = 5\r\nsleep = 5 mins gap = 0\r\n\r\nII activity => normal mode = 100 - 50 = 50\r\n*/\r\n'''\r\n", "__author__ = 'NIORLYS'\r\n[n, p1, p2, p3, t1, t2] = list(map(int, input().split()))\r\namount_of_power = 0\r\n[l, r] = list(map(int, input().split()))\r\namount_of_power += (r - l) * p1\r\nwhile n - 1:\r\n previous_r = r\r\n [l, r] = list(map(int, input().split()))\r\n next_l = l\r\n if previous_r + t1 >= l:\r\n amount_of_power += (l - previous_r) * p1\r\n else:\r\n amount_of_power += t1 * p1\r\n previous_r += t1\r\n if previous_r + t2 >= l:\r\n amount_of_power += (l - previous_r) * p2\r\n else:\r\n amount_of_power += t2 * p2 + (l - previous_r - t2) * p3\r\n amount_of_power += (r - l) * p1\r\n n -= 1\r\nprint(amount_of_power)\r\n\r\n", "# https://codeforces.com/problemset/problem/10/A\r\n\r\ndef sol(n, p1, p2, p3, t1, t2, seq):\r\n res = 0\r\n for i in range(len(seq)):\r\n if i != 0:\r\n delta = seq[i][0] - seq[i-1][1]\r\n if delta < t1:\r\n res += delta * p1\r\n\r\n else:\r\n res += t1 * p1\r\n delta -= t1\r\n \r\n if delta < t2:\r\n res += delta * p2\r\n else:\r\n res += t2 * p2\r\n delta -= t2\r\n res += delta * p3\r\n\r\n res += (seq[i][1] - seq[i][0]) * p1\r\n return res\r\n\r\nn, p1, p2, p3, t1, t2 = map(int, input().strip().split())\r\nseq = []\r\nfor nn in range(n):\r\n seq.append(tuple(map(int, input().strip().split())))\r\nprint(sol(n, p1, p2, p3, t1, t2, seq))", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nw = [list(map(int, input().split())) for i in range(n)]\r\nv = (w[0][1] - w[0][0]) * p1\r\nfor i in range(1, n):\r\n t = w[i][0] - w[i - 1][1]\r\n v += min(t, t1) * p1\r\n v += min(max(0, t - t1), t2) * p2\r\n v += max(0, t - t1 - t2) * p3\r\n v += (w[i][1] - w[i][0]) * p1\r\nprint(v)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\n\nenergy = 0\nfor i in range(n):\n l, r = map(int, input().split())\n if i == 0: last = l\n inactive = l - last\n if inactive > t2 + t1:\n energy += (inactive-t1-t2)*p3 +t2*p2 + t1*p1\n elif inactive > t1:\n energy += (inactive-t1)*p2 + t1*p1\n else:\n energy += inactive*p1\n energy += p1*(r-l)\n last = r\n\nprint(energy)\n\t\t\t \t\t\t\t\t \t \t", "def main():\r\n n, P1, P2, P3, T1, T2 = map(int, input().split()) #P:Consumo de energía, T:Tiempo hasta que pase al siguiente modo\r\n l0 = r0 = 0 \r\n \r\n ans = 0\r\n for _ in range(n):\r\n l1, r1 = map(int, input().split()) #Agregamos eliInicio y el final del periodo de trabajo \r\n ans += (r1-l1)*P1 #Agregamos el tiempo que estuvo activo\r\n \r\n if r0 != 0: \r\n sb = l1 - r0 #El tiempo que duró en stand by\r\n \r\n tem = min(sb,T1)\r\n sb -= tem\r\n ans += tem*P1 \r\n \r\n tem = min(sb,T2)\r\n sb -= tem\r\n ans += tem*P2 \r\n \r\n ans += sb*P3\r\n \r\n l0 = l1; r0 = r1 \r\n \r\n print(ans)\r\n\r\n l0 += 1 #Lo puse para que no me de error por no usar la variable\r\n \r\nif __name__ == \"__main__\":\r\n main()", "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\n80\r\n\r\n\r\n'''\r\n\r\ndef solve():\r\n n, p1, p2, p3, t1, t2 = MII()\r\n ans = 0\r\n l, r = 0, 0\r\n for i in range(n):\r\n a, b = MII()\r\n if i > 0:\r\n # Check before screensaver\r\n before = min(a, r+t1)\r\n ans += (before-r) * p1\r\n # Check screensaver\r\n power = min(a, (r+t2+t1))\r\n ans += (power-before) * p2\r\n # Check sleep\r\n sleep = a\r\n ans += (sleep-power) * p3\r\n # print(before, power, sleep)\r\n\r\n ans += (b-a) * p1\r\n l, r = a, b\r\n print(ans)\r\n\r\nsolve()", "n, P1, P2, P3, T1, T2 = map(int,input().split())\r\nq = 0\r\nara = []\r\narb = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n q1 = (b-a)*P1\r\n ara.append(a)\r\n arb.append(b)\r\n q+=q1\r\nif n==1:\r\n print(q)\r\nelif n>1:\r\n i=1\r\n while i!=n:\r\n t = int(ara[i]) - int(arb[i-1])\r\n if t>=(T1+T2):\r\n q2 = T1 * P1 + T2 * P2 + (t-T1-T2) * P3\r\n q += q2\r\n elif t>=T1 and t<(T1+T2):\r\n q2 = T1 * P1 + (t - T1) * P2\r\n q += q2\r\n elif t<T1:\r\n q2 = t*P1\r\n q += q2\r\n i+=1\r\n print(q)", "n,p1,p2,p3,t1,t2=[int(i) for i in input().split()]\r\n\r\nbreak_time=[]\r\nwork_time=0\r\nfor i in range(n):\r\n interval=[int(i) for i in input().split()]\r\n work_time+=interval[1]-interval[0]\r\n if i!=0:\r\n break_time.append(interval[0]-prev)\r\n prev=interval[1]\r\n\r\npower=work_time*p1\r\n\r\ndef getusage(time,t1,t2,p1,p2,p3):\r\n if time<=t1:\r\n return time*p1\r\n if t1<time<=t2+t1:\r\n return t1*p1+(time-t1)*p2\r\n if time>t2+t1:\r\n return t1*p1+t2*p2+(time-t1-t2)*p3\r\n\r\nfor time in break_time:\r\n power+=getusage(time,t1,t2,p1,p2,p3)\r\n\r\nprint(power)\r\n \r\n", "n,p1,p2,p3,t1,t2 = map(int,input().split())\r\ncon = []\r\nfor _ in range(n):\r\n l,r = map(int,input().split())\r\n con.append(l)\r\n con.append(r)\r\n\r\npower = []\r\ni = 0\r\nt = con[i]\r\nwhile(True):\r\n if t == con[i]:\r\n for k in range(con[i],con[i+1]):\r\n power.append(1)\r\n t += 1\r\n i += 2\r\n if i == len(con):\r\n break\r\n else:\r\n while(t!=con[i]):\r\n power.append(0)\r\n t += 1\r\n\r\nwatts = 0\r\ntemp = 0\r\ncon1 = []\r\nfor i in range(0,len(con),2):\r\n temp += (con[i+1] - con[i])\r\n\r\nwatts = p1 * temp\r\nfor i in range(1,len(con),2):\r\n if i+1 < len(con):\r\n con1.append(con[i+1] - con[i])\r\n\r\ntemp = 0\r\nfor i in range(len(con1)):\r\n for t in range(con1[i]):\r\n if t < t1:\r\n temp += p1\r\n if t >= t1 and t < t1+t2:\r\n temp += p2\r\n if t >= t1+t2:\r\n temp += p3\r\n\r\nwatts += temp\r\nprint(watts)\r\n\r\n\r\n\r\n\r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nperiods = []\r\nans = 0\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n periods.append([l, r])\r\n ans += (r - l) * p1\r\nfor i in range(1, n):\r\n t = periods[i][0] - periods[i - 1][1]\r\n ans += p1 * min(t1, t) + p2 * min(max(0, t - t1), t2) + p3 * max(0, t - t1 - t2)\r\n\r\nprint(ans)", "n,p1,p2,p3,t1,t2=[int(s) for s in input().split()]\r\nl=[0]*n\r\nr=[0]*n\r\na=0\r\nfor i in range(n):\r\n l[i],r[i]=[int(s) for s in input().split()]\r\n a+=(r[i]-l[i])*p1\r\n if i>0:\r\n t=l[i]-r[i-1]\r\n if t>=t1+t2:\r\n a+=t1*p1+t2*p2+(t-t1-t2)*p3\r\n elif t>=t1:\r\n a+=t1*p1+(t-t1)*p2\r\n else:\r\n a+=t*p1\r\nprint(a)", "import sys; R = sys.stdin.readline\r\n\r\nn,p1,p2,p3,t1,t2 = map(int,R().split())\r\nl,r = map(int,R().split())\r\nres,t = p1*(r-l),r\r\nfor _ in range(n-1):\r\n l,r = map(int,R().split())\r\n res += p1*(r-l+min(t1,l-t))\r\n if l-t>t1: res += p2*min(t2,l-t-t1)\r\n if l-t>t1+t2: res += p3*(l-t-t1-t2)\r\n t = r\r\nprint(res)", "n, P1, P2, P3, T1, T2 = map(int, input().split())\n\nans = 0\ncontrole = []\nfor i in range(n):\n \n l, r = map(int, input().split())\n \n ans += (r-l)*P1\n \n controle.append(r)\n if i > 0:\n mi = l - controle[i-1]\n \n if mi <= T1:\n ans += mi*P1\n \n elif mi <= T1+T2:\n ans += P1*T1+(mi-T1)*P2\n else:\n ans += P1*T1+T2*P2+(mi-(T2+T1))*P3\n\nprint(ans) \n \n \n\n\t \t \t \t \t\t \t\t \t \t \t \t", "n, p1, p2, p3, t1, t2 = [int(x) for x in input().split()]\nans = 0\nl, r = [int(x) for x in input().split()]\nans += (r - l) * p1\nprev = r\nfor i in range(1, n):\n\tl, r = [int(x) for x in input().split()]\n\td = l - prev\n\tans += min(t1, d) * p1\n\td -= min(t1, d)\n\tans += min(t2, d) * p2\n\td -= min(t2, d)\n\tans += d * p3\n\tans += (r - l) * p1\n\tprev = r\nprint(ans)\n", "# Входные параметры\nn, P1, P2, P3, T1, T2 = tuple(map(int, input().split()))\n\n# Суммарное потребление\nS = 0\n\n# Интервалы\nintervals = []\n\nfor _ in range(n):\n l, r = tuple(map(int, input().split()))\n intervals.append(l)\n intervals.append(r)\n\nstart = intervals[0]\nfinish = intervals[-1]\n\nstatuses = {}\nstatus = True\nfor index, arg in enumerate(intervals):\n if index < len(intervals) - 1:\n statuses[(intervals[index], intervals[index + 1])] = status\n status = not status\n\nt1 = T1\nt2 = T2\nfor key in statuses:\n for i in range(key[0] + 1, key[1] + 1):\n if statuses[key]:\n t1 = T1\n t2 = T2\n S += P1\n else:\n if t1 > 0 and t2 > 0:\n t1 -= 1\n S += P1\n elif t1 == 0 and t2 > 0:\n t2 -= 1\n S += P2\n else:\n S += P3\n\nprint(S)", "tot=input().split()\r\nn=int(tot[0])\r\nP1=int(tot[1])\r\nP2=int(tot[2])\r\nP3=int(tot[3])\r\nT1=int(tot[4])\r\nT2=int(tot[5])\r\ntime_cuts=[]\r\nfor i in range(n):\r\n cut=input().split()\r\n cut[0]=int(cut[0])\r\n cut[1]=int(cut[1])\r\n time_cuts.append(cut)\r\nenergy=0\r\nfor i in range(n):\r\n\tenergy=energy+(time_cuts[i][1]-time_cuts[i][0])*P1\r\nfor i in range(n-1):\r\n d=time_cuts[i+1][0]-time_cuts[i][1]\r\n d1=d-T1\r\n if d1>0:\r\n \tenergy=energy+T1*P1\r\n \td2=d1-T2\r\n \tif d2>0:\r\n \t\tenergy=energy+T2*P2\r\n \t\tenergy=energy+d2*P3\r\n \telse:\r\n \t\tenergy=energy+d1*P2\r\n else:\r\n energy=energy+d*P1\r\nprint(energy)\r\n", "n=list(map(int,input().split()))\r\nst=[]\r\nft=[]\r\nfor i in range(n[0]):\r\n a,b=map(int,input().split())\r\n st.append(a)\r\n ft.append(b)\r\nst.append(None)\r\nft.append(None)\r\np=0\r\nfor i in range(n[0]):\r\n p=p+((ft[i]-st[i])*n[1])\r\n if ft[i+1]==None:\r\n break\r\n else:\r\n offt=st[i+1]-ft[i]\r\n if offt>n[4]:\r\n offt=offt-n[4]\r\n p=p+(n[4]*n[1])\r\n if offt>n[5]:\r\n offt=offt-n[5]\r\n p=p+(n[5]*n[2])\r\n p=p+offt*n[3]\r\n else:\r\n p=p+(offt*n[2])\r\n else:\r\n p=p+(offt*n[1])\r\nprint(p)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nmx, mi, con, c, scr, sl, dem = 0, 1000000000000, t1, [False] * 2000, False, False, 0\r\nfor u in range(n):\r\n l, r = map(int, input().split())\r\n for x in range(l, r + 1): c[x] = True\r\n mi, mx = min(l, mi), max(mx, r)\r\nfor x in range(mi, mx):\r\n if c[x]: scr, sl, con = False, False, t1\r\n else:\r\n con -= 1\r\n if con == 0:\r\n if sl: scr = True\r\n else: sl, con = True, t2\r\n if not scr and not sl: dem += p1\r\n elif scr: dem += p3\r\n else: dem += p2\r\nprint(dem)", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\nr=[[*map(int,input().split())] for _ in [0]*n];t=0\r\nfor i in range(n-1):\r\n if r[i+1][0]-r[i][1]<=t1:\r\n t+=p1*(r[i+1][0]-r[i][1])\r\n elif r[i+1][0]-r[i][1]<=t1+t2:\r\n t+=p2*(r[i+1][0]-r[i][1]-t1)+p1*t1\r\n else:\r\n t+=p1*t1+p2*t2+p3*(r[i+1][0]-r[i][1]-t1-t2)\r\nprint(t+p1*sum(r[j][1]-r[j][0] for j in range(n)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 13:26:02 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, p1, p2, p3, t1, t2 = map(int,input().split())\r\nl, r = [], []\r\npower = 0\r\nfor i in range(n):\r\n li, ri = map(int,input().split())\r\n l.append(li)\r\n r.append(ri)\r\n power += p1 * (r[i] - l[i])\r\n if i == 0: continue\r\n if (w := l[i] - r[i-1]) > t1:\r\n if w - t1 > t2:\r\n power += t1 * p1 + t2 * p2 + (w - t1 - t2) * p3\r\n else:\r\n power += t1 * p1 + (w - t1) * p2\r\n else:\r\n power += w * p1\r\nprint(power)", "splits = input().split()\nn = int(splits[0])\np1 = int(splits[1])\np2 = int(splits[2])\np3 = int(splits[3])\nt1 = int(splits[4])\nt2 = int(splits[5])\n\nintervals = []\nfor i in range(n):\n interval = input().split()\n s, e = int(interval[0]), int(interval[1])\n intervals.append((s,e))\n\nconsume = 0\nfor i, interval in enumerate(intervals):\n consume += (interval[1] - interval[0]) * p1 \n if i >= 1:\n gap = interval[0] - intervals[i-1][1]\n if gap <= t1:\n consume += gap * p1\n elif t1 < gap <= t1 + t2:\n consume += (t1 * p1) + ((gap-t1) * p2)\n elif gap > t1 + t2:\n consume += (t1*p1) + (t2*p2) + (gap - (t1 + t2)) * p3\nprint(consume)\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\nl, r, t3 = [0] * n, [0] * n, t2 + t1\r\nfor i in range(n):\r\n l[i], r[i] = map(int, input().split())\r\nd = [l[i + 1] - r[i] for i in range(n - 1)]\r\nprint(p1 * sum(r[i] - l[i] for i in range(n)) + p1 * sum(min(t1, i) for i in d) + p2 * sum(max(0, min(t2, i - t1)) for i in d) + p3 * sum(max(0, i - t3) for i in d))\r\n", "def power_consumption(n, P1, P2, P3, T1, T2, periods):\r\n start, end = periods[0]\r\n total_power = P1 * (end - start)\r\n \r\n for i in range(1, n):\r\n start, end = periods[i]\r\n last = periods[i-1][1]\r\n mode = \"normal\"\r\n for minute in range(periods[i-1][1], start):\r\n if mode == \"screensaver\" and minute - last >= T2:\r\n mode = \"sleep\"\r\n elif mode == \"normal\" and minute - last >= T1:\r\n mode = \"screensaver\"\r\n last = minute\r\n \r\n if mode == \"normal\":\r\n total_power += P1\r\n elif mode == \"screensaver\":\r\n total_power += P2\r\n elif mode == \"sleep\":\r\n total_power += P3\r\n \r\n total_power += P1 * (end - start)\r\n return total_power\r\nn, P1, P2, P3, T1, T2 = map(int, input().split())\r\nperiods = [tuple(map(int, input().split())) for _ in range(n)]\r\nresult = power_consumption(n, P1, P2, P3, T1, T2, periods)\r\nprint(result)", "a=input().split()\r\nd=0\r\ng=0\r\nh=0\r\nfor i in range (0,int(a[0])):\r\n b=input().split()\r\n c=int(b[1])-int(b[0])\r\n t=int(b[0])-d\r\n if h==0:\r\n h=1\r\n g+=c*int(a[1])\r\n else:\r\n if t<=int(a[4]):\r\n f=t*int(a[1])\r\n if t>int(a[4]) and t<=int(a[5])+int(a[4]):\r\n f=int(a[4])*int(a[1])+(t-int(a[4]))*int(a[2])\r\n if t>int(a[5])+int(a[4]):\r\n f=int(a[4])*int(a[1])+int(a[5])*int(a[2])+(t-int(a[4])-int(a[5]))*int(a[3])\r\n g+=f+c*int(a[1])\r\n d=int(b[1])\r\nprint(g)\r\n", "I=lambda:map(int,input().split())\r\nn,a,b,c,u,v=I()\r\nexec('x=['+n*'[*I()],'+']')\r\nr=0\r\nfor i in range(n):\r\n r+=a*(x[i][1]-x[i][0])\r\n if i:\r\n t=x[i][0]-x[i-1][1]\r\n s=min(t,u);r+=s*a;t-=s\r\n s=min(t,v);r+=s*b;t-=s\r\n r+=t*c\r\nprint(r)", "inputt=[int(x) for x in input().split()]\r\nn=inputt[0]\r\nP1=inputt[1]\r\nP2=inputt[2]\r\nP3=inputt[3]\r\nT1=inputt[4]\r\nT2=inputt[5]\r\nans=0\r\n\r\nintervals=[]\r\nfor i in range(n):\r\n subl=[int(item) for item in input().split()]\r\n intervals.append(subl)\r\n\r\n\r\nans+=(intervals[0][1]-intervals[0][0])*P1\r\nfor i in range(1,n):\r\n ans += (intervals[i][1] - intervals[i][0]) * P1\r\n gap = intervals[i][0] - intervals[i - 1][1]\r\n if (gap >= T1):\r\n ans += T1 * P1\r\n gap -= T1\r\n else :\r\n ans += gap * P1\r\n gap = 0\r\n if (gap >= T2):\r\n ans += T2 * P2\r\n gap -= T2\r\n else :\r\n ans += gap * P2\r\n gap = 0\r\n ans += gap * P3\r\n\r\nprint (ans)\r\n\r\n\r\n\r\n\r\n\r\n", "class Solve:\r\n \r\n def __init__(self) -> None:\r\n self.n = 0;\r\n self.P1 = 0;\r\n self.T1 = 0;\r\n self.P2 = 0;\r\n self.T2 = 0;\r\n self.P3 = 0;\r\n self.thoiGian = [];\r\n self.tongThoiGian = 0;\r\n\r\n\r\n def vao(self) -> None:\r\n (self.n, self.P1, self.P2, self.P3, self.T1, self.T2) = map(int, input().split(\" \"));\r\n for _ in range(self.n):\r\n x = tuple(map(int, input().split(\" \")));\r\n self.thoiGian.append(x);\r\n\r\n def ngu(self, chenhLech) -> int:\r\n tong = 0;\r\n if(chenhLech <= self.T1):\r\n tong = tong + self.P1 * chenhLech;\r\n chenhLech = 0;\r\n else:\r\n tong = tong + self.P1 * self.T1;\r\n chenhLech -= self.T1\r\n if(chenhLech <= self.T2):\r\n tong = tong + self.P2 * chenhLech;\r\n chenhLech = 0;\r\n else:\r\n tong = tong + self.P2 * self.T2;\r\n chenhLech -= self.T2;\r\n if(chenhLech > 0): tong += self.P3 * chenhLech;\r\n return tong;\r\n\r\n def lam(self) -> None:\r\n hoatDong = lambda hieu: self.P1 * hieu;\r\n for i in range(self.n):\r\n hieu = self.thoiGian[i][1] - self.thoiGian[i][0];\r\n if(i < self.n - 1):\r\n hieu2 = self.thoiGian[i + 1][0] - self.thoiGian[i][1]\r\n self.tongThoiGian = self.tongThoiGian + hoatDong(hieu) + self.ngu(hieu2);\r\n else: self.tongThoiGian = self.tongThoiGian + hoatDong(hieu) + self.ngu(0);\r\n\r\n def ra(self) -> None:\r\n print(self.tongThoiGian);\r\n\r\n\r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\nmain();\r\n", "n,p1,p2,p3,t1,t2 = map(int, input().split())\r\ndata = []\r\nresult = 0\r\nfor i in range(n):\r\n data.append(list(map(int, input().split())))\r\n result += p1*(data[i][1]-data[i][0])\r\n\r\nfor i in range(1,n):\r\n gap = data[i][0]-data[i-1][1]\r\n if gap>t1+t2:\r\n result += (gap-(t1+t2))*p3\r\n gap = t1+t2\r\n if gap>t1:\r\n result += (gap-t1)*p2\r\n gap = t1\r\n result += gap*p1\r\n\r\nprint(result)\r\n", "\r\nn,P1,P2,P3,T1,T2 = map(int,input().strip().split())\r\nactive = []\r\nres = 0\r\nfor i in range(n):\r\n\tactive.append(list(map(int,input().strip().split())))\r\n\r\nif len(active) == 1 :\r\n\tprint((active[0][1]-active[0][0])*P1)\r\nelse:\r\n\tfor i in range(len(active)):\r\n\t\tif i == len(active)-1 :\r\n\t\t\tres += (active[i][1] - active[i][0]) * P1\r\n\t\t\tprint(res)\r\n\t\t\texit()\r\n\r\n\t\tres += (active[i][1] - active[i][0]) * P1\r\n\t\tidle = active[i+1][0] - active[i][1]\r\n\t\tif idle <= T1 and idle > 0:\r\n\t\t\tres += idle*P1\r\n\t\tif idle > T1:\r\n\t\t\tres += T1*P1\r\n\t\t\t# update idle time\r\n\t\t\tidle -= T1\r\n\t\t\tif idle > 0 and idle <= T2:\r\n\t\t\t\tres += idle*P2\r\n\t\t\telif idle > T2:\r\n\t\t\t\tres += T2*P2\r\n\t\t\t\t# update sleep mode time\r\n\t\t\t\tidle -= T2\r\n\t\t\t\tif idle > 0:\r\n\t\t\t\t\tres += idle*P3\r\n", "n, P1, P2, P3, T1, T2 = [int(item) for item in input().split()]\r\nl1, r1 = [int(item) for item in input().split()]\r\nans = (r1 - l1) * P1\r\n\r\nwhile n > 1:\r\n l2, r2 = [int(item) for item in input().split()]\r\n ans += (r2 - l2) * P1\r\n gap = l2 - r1\r\n if gap > T1:\r\n ans += P1 * T1\r\n gap -= T1\r\n else:\r\n ans += P1 * gap\r\n gap = 0\r\n\r\n if gap > T2:\r\n ans += P2 * T2\r\n gap -= T2\r\n else:\r\n ans += P2 * gap\r\n gap = 0\r\n ans += P3 * gap\r\n l1, r1, n = l2, r2, n - 1\r\n\r\nprint(ans)\r\n", "def calculate(s,e,m):\r\n t=e-s\r\n c=0\r\n if t>m[4]:\r\n c+=m[4]*m[1]\r\n t=t-m[4]\r\n else:\r\n c+=m[1]*t\r\n t=0\r\n if t>m[5]:\r\n c+=m[5]*m[2]\r\n t=t-m[5]\r\n else:\r\n c+=m[2]*t\r\n t=0\r\n c+=m[3]*t\r\n return c\r\n \r\n\r\n\r\nwork=[]\r\nm=[int(i) for i in input().split(\" \")]\r\nfor i in range(0,m[0]):\r\n l=[int(i) for i in input().split(\" \")]\r\n work.append(l)\r\nn=len(work)\r\npower =0\r\nfor i in range(len(work)):\r\n if i==n-1:\r\n power +=(work[i][1]-work[i][0])*m[1]\r\n else:\r\n power +=calculate(work[i][1],work[i+1][0],m)+(work[i][1]-work[i][0])*m[1]\r\nprint(power)\r\n", "#!/usr/bin/env python3\n\nn, p1, p2, p3, t1, t2 = [int(x) for x in input().split()]\npwr = 0\ntim = -1\nfor i in range(n):\n l, r = [int(x) for x in input().split()]\n if i == 0:\n tim = l\n dur = min(t1, l - tim)\n tim += dur\n pwr += dur * p1\n dur = min(t2, l - tim)\n tim += dur\n pwr += dur * p2\n dur = l - tim\n tim += dur\n pwr += dur * p3\n dur = r - l\n tim += dur\n pwr += dur * p1\nprint(pwr)\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\r\na = [list(map(int, input().split())) for i in range(n)]\r\ntotal = p1 * (a[0][1] - a[0][0])\r\nfor i in range(1, n):\r\n total += p1 * (a[i][1] - a[i][0])\r\n delta = a[i][0] - a[i - 1][1]\r\n total += p1 * min(delta, t1)\r\n delta -= t1\r\n total += max(0, min(delta, t2) * p2)\r\n delta -= t2\r\n total += max(0, delta * p3) \r\nprint(total)", "#10A - Power Consumption\r\nfrom sys import stdin\r\n#Get information about the working periods\r\n#P - how much power the computer uses in the current state\r\n#P1 = working mode power consumption\r\n#P2 = screensaving mode power consumption\r\n#P3 = sleep mode power consumption\r\n#T - the time that passed from the last time Tom touched the mouse\r\n#T1 - the time period: from the last time Tom touched the laptop to\r\n# till it enters the screensaving mode\r\n#T2 - the time period: from the start of screensaving mode to\r\n# till it enters the sleeping mode\r\nn, P1, P2, P3, T1, T2 = map(int, input().split())\r\n#How much the computer has rested before it started screensaving\r\nlast = list(map(int, input().split()))\r\n\r\nrest = (last[1]-last[0]) * P1 \r\n\r\n#The following n-1 lines contain information about each working period \r\nfor i in range(1, n):\r\n current = list(map(int, stdin.readline().split()))\r\n d = current[0] - last[1]\r\n\r\n rest += min(d, T1) * P1\r\n\r\n rest += min(max(d - T1, 0), T2) * P2\r\n rest += max(d - (T1+T2), 0) * P3\r\n rest += (current[1]-current[0]) * P1\r\n last = current\r\n \r\n \r\nprint(rest)", "from collections import deque\r\n\r\nn, p1, p2, p3, t1, t2 = map(int, input().split())\r\n\r\nd = {1: p1, 2: p2, 3: p3}\r\n\r\nLR = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nq = deque(sorted(\r\n\t[(LR[_][0], 'left') for _ in range(n)] + [(LR[_][1], 'right') for _ in range(n)]\r\n))\r\n\r\np, m, t, T = 0, 1, LR[0][0], LR[-1][1]\r\n\r\nwhile q:\r\n\ttau, tp = q.popleft()\r\n\r\n\tif tau > T:\r\n\t\tbreak\r\n\r\n\tp += (tau - t) * d[m]\r\n\r\n\t# print(f'time = {tau}, type = {tp}, mode = {m}, power used = {p}')\r\n\r\n\tt = tau\r\n\r\n\tif tp == 'left':\r\n\t\tm = 1\r\n\t\tq = deque(list(filter(lambda _: _[1] in {'left', 'right'}, q)))\r\n\r\n\tif tp == 'right':\r\n\t\tq.append((tau + t1, 'mode2'))\r\n\t\tq.append((tau + t1 + t2, 'mode3'))\r\n\t\tq = deque(sorted(list(q)))\r\n\r\n\tif tp == 'mode2':\r\n\t\tm = 2\r\n\r\n\tif tp == 'mode3':\r\n\t\tm = 3\r\n\r\nprint(p)\r\n", "n, p1, p2, p3, t1, t2 = map(int, input().split())\n\ntimes = [list(map(int, input().split())) for _ in range(n)]\n\npower = 0\nend = times[0][0]\nfor i in times:\n start = i[0]\n for j in range(start - end):\n if j < t1:\n power += p1\n elif j < t2 + t1:\n power += p2\n else:\n power += p3\n\n end = i[1]\n power += (end - start) * p1\n\nprint(power)\n", "n,P1,P2,P3,T1,T2 = map(int, input().split())\r\nresult = 0\r\na = 0\r\nb = 0\r\nc = 0\r\nd = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n result += (y - x)*P1\r\n \r\n\r\n if a > 0:\r\n b = x - a - T1 - T2\r\n if b > 0:\r\n result += b * P3\r\n c = x - a - T1 - b\r\n result += c*P2\r\n d = x - a - b - c \r\n result += d * P1\r\n else:\r\n c = x - a - T1\r\n if c > 0: \r\n result += c*P2\r\n d = x - a - c\r\n result += d*P1\r\n else:\r\n result += (x-a)*P1\r\n\r\n a = y\r\n elif a <= 0:\r\n a = y\r\n \r\n \r\n\r\nprint(result)", "[n,p1,p2,p3,t1,t2]=[int(x) for x in input().split()];\r\n\r\nrold=-1;\r\nans=0;\r\nfor _ in range(n):\r\n [l,r]=[int(x) for x in input().split()];\r\n ans+=(r-l)*p1;\r\n if rold>0:\r\n if l-rold>=t1+t2:\r\n ans+=p1*t1+p2*t2+p3*(l-rold-t1-t2);\r\n elif l-rold>=t1:\r\n ans+=p1*t1+p2*(l-rold-t1);\r\n elif l-rold>=0:\r\n ans+=p1*(l-rold);\r\n rold=r;\r\n\r\nprint(ans);\r\n\r\n\r\n", "n,p1,p2,p3,t1,t2 = map(int,input().split())\r\n\r\np=[]\r\nc=0\r\nfor j in range(n):\r\n\r\n\r\n l,r = map(int,input().split())\r\n\r\n\r\n if j==0:\r\n c+= (r-l)*p1\r\n p.append(r)\r\n else:\r\n if l-p[-1]>0:\r\n if l-p[-1]<=t1:\r\n c+=(l-p[-1])*p1\r\n else:\r\n if t1+t2>=l-p[-1]>t1:\r\n c+=t1*p1 + ((l-p[-1])-t1)*p2\r\n elif l-p[-1]> t1+t2:\r\n c+=t1*p1 + (t2)*p2 + ((l-p[-1])-(t1+t2))*p3\r\n c+=(r-l)*p1\r\n p.append(r)\r\n else:\r\n c+=(r-l)*p1\r\n p.append(r)\r\n\r\n\r\nprint(c)\r\n \r\n \r\n \r\n\r\n \r\n", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\ndef interval(x):\r\n if x<=t1:\r\n return x*p1\r\n elif x<=t1+t2:\r\n return x*p2+t1*(p1-p2)\r\n else:\r\n return x*p3+t2*(p2-p3)+t1*(p1-p3)\r\ne1,e2=0,0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n e1+=(b-a)*p1\r\n if i>0:\r\n e2+=interval(a-b0)\r\n b0=b\r\nprint(e1+e2)", "I = input().split()\r\nn = int(I[0])\r\nP1 = int(I[1])\r\nP2 = int(I[2])\r\nP3 = int(I[3])\r\nT1 = int(I[4])\r\nT2 = int(I[5])\r\n\r\ndata = []\r\nfor i in range(n):\r\n I = input().split()\r\n l = int(I[0])\r\n r = int(I[1])\r\n data.append((l, r))\r\n\r\nPower = 0\r\n\r\nfor i in range(n):\r\n Power += P1 * (data[i][1]-data[i][0])\r\n if i != n-1:\r\n time = data[i+1][0] - data[i][1]\r\n if time <= T1:\r\n Power += P1 * time\r\n else:\r\n if time <= T1 + T2:\r\n Power += P1 * T1 + P2 * (time - T1)\r\n else:\r\n Power += P1 * T1 + P2 * T2 + P3 * (time - T1 - T2)\r\n\r\nprint(Power)", "n, P_1, P_2, P_3, T_1, T_2 = [int(x) for x in input().split()]\n\ndef nonusing(start, end, P_1, P_2, P_3, T_1, T_2):\n Power = 0\n end -= start\n if end <= T_1:\n return end * P_1\n else:\n Power += T_1 * P_1\n end -= T_1\n if end <= T_2:\n Power += end * P_2\n return Power\n else:\n Power += T_2 * P_2\n end -= T_2\n Power += end * P_3\n return Power\n\n\nPower = 0\n\nStart = 0\n\nfor i in range(n):\n l, r = [int(x) for x in input().split()]\n if i == 0:\n Start = l\n Power += (nonusing(Start, l, P_1, P_2, P_3, T_1, T_2) + (P_1 * (r - l)))\n Start = r\n\nprint(Power)\n", "(n, p1, p2, p3, t1, t2) = map(int, input().split(' '))\ntimeline = []\n\nfor i in range(n):\n (l, r) = map(int, input().split(' '))\n timeline.append([l, r])\n\ntimeline.append([0, 0])\n\npower_consumption = 0\n\nfor i in range(n):\n power_consumption += (timeline[i][1] - timeline[i][0]) * p1\n\n if timeline[i][1] != timeline[i + 1][0]:\n interval = timeline[i + 1][0] - timeline[i][1]\n count = 1\n while count <= interval:\n if count <= t1:\n power_consumption += p1\n elif t1 < count <= t1 + t2:\n power_consumption += p2\n else:\n power_consumption += p3\n count += 1\n\nprint(power_consumption)\n", "# import sys\r\n# n = int(input())\r\n# s = input().strip()\r\n# a = [int(tmp) for tmp in input().split()]\r\n# for i in range(n):\r\n\r\nn, p1, p2, p3, t1, t2 = [int(tmp) for tmp in input().split()]\r\nl = [0] * n\r\nr = [0] * n\r\nfor i in range(n):\r\n l[i], r[i] = [int(tmp) for tmp in input().split()]\r\n\r\nall = 0\r\nfor i in range(n - 1):\r\n all += (r[i] - l[i]) * p1\r\n all += min(t1, l[i + 1] - r[i]) * p1\r\n all += min(t2, max(l[i + 1] - r[i] - t1, 0)) * p2\r\n all += max(l[i + 1] - r[i] - t1 - t2, 0) * p3\r\nall += (r[-1] - l[-1]) * p1\r\nprint(all)", "n, p1, p2, p3, t1, t2 = list(map(int, input().split()))\r\nusage = 0\r\ninterval = []\r\nfor i in range(n):\r\n interval.append(list(map(int, input().split())))\r\n usage += (interval[-1][1] - interval[-1][0]) * p1\r\n\r\nfor i in range(n-1):\r\n passive = interval[i+1][0] - interval[i][1]\r\n if passive >= t1:\r\n passive -= t1\r\n usage += t1 * p1\r\n else:\r\n usage += passive * p1\r\n passive = 0\r\n \r\n if passive >= t2:\r\n passive -= t2\r\n usage += t2 * p2\r\n else:\r\n usage += passive * p2\r\n passive = 0\r\n \r\n if passive > 0:\r\n usage += passive * p3\r\n\r\nprint(usage)", "n, P1, P2, P3, T1, T2 = map(int, input().split())\r\nanswer = 0\r\na = 0\r\nb = 0\r\nfor _ in range(n):\r\n a0, b0 = map(int, input().split())\r\n answer += (b0 - a0) * P1\r\n if b != 0:\r\n c = a0 - b\r\n answer += min(T1, c) * P1 + min(max(c - T1, 0), T2) * P2 + max(c - T1 - T2, 0) * P3\r\n a, b = a0, b0\r\nprint(answer)\r\n", "n,p1,p2,p3,t1,t2 = map(int, input().split())\r\ntp = []\r\npower = 0\r\nfor i in range(n):\r\n tp.append([int(x) for x in input().split()]) \r\nfor i in range(len(tp)-1):\r\n tp1 = tp[i][1]-tp[i][0]\r\n power += p1*tp1\r\n if tp[i+1][0]-tp[i][1] < t1:\r\n power += p1*(tp[i+1][0]-tp[i][1])\r\n continue\r\n else:\r\n power += p1*t1\r\n tp2 = tp[i+1][0]-tp[i][1]-t1\r\n if tp2<t2:\r\n power+= p2*tp2\r\n continue\r\n else:\r\n power += p2*t2\r\n power += p3*(tp2-t2)\r\n continue\r\npower += p1*(tp[-1][1]-tp[-1][0])\r\nprint(power)\r\n ", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\nlistel=[]\r\nlister=[]\r\np=0\r\nfor i in range(0,n):\r\n l,r=map(int,input().split())\r\n listel.append(l)\r\n lister.append(r)\r\nfor i in range(0,n):\r\n p+=(lister[i]-listel[i])*p1\r\n if i+1<n :\r\n if listel[i+1]-lister[i]<=t1:\r\n p+=p1*(listel[i+1]-lister[i])\r\n else:\r\n p+=p1*t1\r\n if listel[i+1]-(lister[i]+t1)<=t2:\r\n p+=p2*(listel[i+1]-lister[i]-t1)\r\n else:\r\n p+=p2*t2+p3*(listel[i+1]-lister[i]-t1-t2)\r\nprint(p)\r\n ", "n,P1,P2,P3,T1,T2 = list(map(int,input().split())) #input data\r\n\r\nenergy = 0 #start amount of energy\r\n\r\nintervals = [] #input intervals of work\r\nfor i in range(n):\r\n subl = [int(item) for item in input().split()]\r\n intervals.append(subl)\r\n\r\nenergy += (intervals[0][1] - intervals[0][0]) * P1 #amount of energy of first work interval\r\n\r\nfor i in range(1, n):\r\n energy += (intervals[i][1] - intervals[i][0]) * P1 #amount of energy of work intervals\r\n gap = intervals[i][0] - intervals[i - 1][1] #interval of time btw working sessions\r\n if (gap >= T1): #amount of energy for T1 period of time (when PC still works in P1 mode)\r\n energy += T1 * P1\r\n gap -= T1\r\n else:\r\n energy += gap * P1\r\n gap = 0\r\n if (gap >= T2): #amount of energy for T2 period of time (when PC goes to P2 mode)\r\n energy += T2 * P2\r\n gap -= T2\r\n else:\r\n energy += gap * P2\r\n gap = 0\r\n energy += gap * P3 #amount of energy for remained period of time (when PC consumes P3 amount of power)\r\n\r\nprint(energy) #print answer", "n, P1, P2, P3, T1, T2 = map(int, input().split())\nstart, end = map(int, input().split())\nenergy = (end-start) * P1\nfor i in range(1, n):\n last = end\n start, end = map(int, input().split())\n energy += (end-start) * P1\n rest = start-last\n if rest > T1:\n energy += P1 * T1\n rest -= T1\n if rest > T2:\n energy += P2 * T2\n energy += P3 * (rest - T2)\n else:\n energy += P2 * rest\n else:\n energy += P1 * rest\n\nprint(energy)\n", "def solve(arr, n,p1,p2,p3,t1,t2):\n res = (arr[0][1]-arr[0][0])*p1\n for i in range(1,n):\n t = arr[i][0] - arr[i-1][1]\n tc1 = min(t,t1)\n tc2 = min(t-tc1, t2)\n tc3 = t-tc1-tc2\n res += tc1*p1 + tc2*p2 + tc3*p3 + (arr[i][1] -arr[i][0])*p1\n return res\n\n \n\n \ndef main() :\n arr1 = list(map(int, input().split(' ')))\n # n = int(input())\n arr = []\n for _ in range(arr1[0]):\n i = list(map(int, input().split(' ')))\n arr.append(i)\n print(solve(arr, *arr1))\nmain()\n", "def time_proc(dt,p1,p2,p3,t1,t2):\r\n if dt<=t1:\r\n return p1*dt\r\n dt-=t1\r\n if dt<=t2:\r\n return p1*t1+p2*dt\r\n dt-=t2\r\n return p1*t1+p2*t2+p3*dt\r\n\r\nn,p1,p2,p3,t1,t2=map(int,input().split(' '))\r\nworks=list()\r\nfor c in range(n):\r\n l,r=map(int,input().split(' '))\r\n works.append((l,r))\r\n\r\n\r\nen=0\r\nfor c in range(len(works)):\r\n l=works[c][0]\r\n r=works[c][1]\r\n if c+1<len(works):\r\n nl=works[c+1][0]\r\n else:\r\n nl=r\r\n en+=p1*(r-l)\r\n en+=time_proc(nl-r,p1,p2,p3,t1,t2)\r\nprint(en)\r\n\r\n", "n, p1, p2, p3, t1, t2 = input().split()\r\nn = int(n)\r\np1 = int(p1)\r\np2 = int(p2)\r\np3 = int(p3)\r\nt1 = int(t1)\r\nt2 = int(t2)\r\nt = 0\r\npower = 0\r\nfor i in range(n):\r\n time1, time2 =input().split()\r\n time1 = int(time1)\r\n time2 = int(time2)\r\n if t1 >= (time1-t) and i >=1 : power = (time1-t)*p1 + power\r\n elif (time1-t) <= t1+t2 and i >= 1 : power = power + t1*p1+(time1-t-t1) *p2\r\n elif i>=1: power = power + t1*p1 + t2*p2 +(time1-t-t1-t2)*p3\r\n power = power + (time2-time1)*p1\r\n t = time2\r\nprint(power)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\nt = 0\np = 0\nfor i in range(n):\n l, r = map(int, input().split())\n if i == 0:\n t = l\n if l - t <= t1:\n p += p1 * (l - t)\n t = l\n else:\n p += p1 * t1\n t += t1\n if l - t <= t2:\n p += p2 * (l - t)\n t = l\n else:\n p += p2 * t2\n t += t2\n p += p3 * (l - t)\n p += p1 * (r - l)\n t = r\nprint(p)", "n, p1, p2, p3, t1, t2 = map(int, input().split())\n\ntotal = 0\nl, r = map(int, input().split())\ntotal += (r-l) * p1\nfor i in range(n-1):\n l_aux, r_aux = map(int, input().split())\n total += (r_aux-l_aux) * p1\n\n time = l_aux - r\n if time > t1:\n total += t1 * p1\n time -= t1\n\n if time > t2:\n total += t2 * p2\n time -= t2\n\n total += time * p3\n else:\n total += time * p2\n else:\n total += time * p1\n\n l, r = l_aux, r_aux\n\nprint(total)\n\n\t \t\t \t \t \t \t \t\t \t \t \t \t\t \t", "a = list(map(int, input().split()))\r\nn,p1,p2,p3,t1,t2 = map(int, a)\r\noutput = 0\r\nprev = 0\r\nfor index in range(n):\r\n safe_mode = 0\r\n line = list(map(int, input().split()))\r\n output += (line[1] - line[0]) * p1\r\n if prev != 0:\r\n safe_mode = line[0] - prev\r\n output += min(t1, safe_mode) * p1\r\n output += min(max(0, safe_mode - t1), t2) * p2\r\n output += max(0, safe_mode - t1 - t2) * p3\r\n prev = line[1]\r\nprint(output)", "\r\ndef power_time(P1,P2,P3,T1,T2,intervalo):\r\n if (intervalo == 0):\r\n return 0\r\n else:\r\n if (intervalo <= T1):\r\n return intervalo*P1\r\n elif (intervalo <= T1 + T2):\r\n return (T1*P1 + (intervalo-T1)*P2)\r\n else:\r\n return (T1*P1 + T2*P2 + (intervalo - (T1 + T2))*P3)\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n tiempos_mode = list()\r\n lista_intervalos = list()\r\n lista_tiempos = list()\r\n power_consumption = 0\r\n power_consumption_rest = 0\r\n n,P1,P2,P3,T1,T2 = list(map(int,input().strip().split()))\r\n for i in range(n):\r\n inicial,final = list(map(int,input().strip().split()))\r\n tiempos_mode.append(final - inicial)\r\n lista_intervalos.append((inicial,final))\r\n power_consumption = sum(tiempos_mode)*P1\r\n rango = len(lista_intervalos) - 1\r\n for i in range(rango):\r\n val = lista_intervalos[i+1][0] - lista_intervalos[i][1]\r\n power_consumption_rest += power_time(P1,P2,P3,T1,T2,val)\r\n print(power_consumption_rest + power_consumption)\r\n \r\n \r\n \r\n \r\n \r\n", "n,p1,p2,p3,t1,t2=list(map(int,input().split()))\r\nr1=-1\r\ne=0\r\nfor i in range(n):\r\n l,r=list(map(int,input().split()))\r\n e+=(r-l)*p1\r\n if r1!=-1:\r\n e+=p1*min(t1,l-r1)+p2*max(0,min(l-r1-t1,t2))+p3*max(0,l-r1-t1-t2)\r\n r1=r\r\nprint(e)", "n,p1,p2,p3,t1,t2=map(int,input().split())\r\na=[]\r\nans=0\r\nfor i in range(n):\r\n a.extend(list(map(int,input().split())))\r\nfor i in range(n):\r\n ans+=p1*(a[2*i+1]-a[2*i])\r\n if i!=n-1:\r\n store=a[2*i+2]-a[2*i+1]\r\n if store<=t1:\r\n ans+=store*p1\r\n elif store<=t1+t2:\r\n ans+=t1*p1+p2*(store-t1)\r\n else:\r\n ans+=t1*p1+t2*p2+p3*(store-t1-t2)\r\nprint(ans)\r\n" ]

[ "n,m,c,d=map(int,input().split())\r\nar=[0]*1005\r\nfor i in range(c,n+1):\r\n ar[i]=ar[i-c]+d\r\nfor i in range(m):\r\n a,b,c,d=map(int,input().split())\r\n for j in range(a//b):\r\n e=n\r\n while(e>=c):\r\n ar[e]=max(ar[e],ar[e-c]+d)\r\n e-=1\r\nprint(ar[n])\r\n", "n,m,c0,d0=map(int,input().split()) \r\ndp=[]\r\nfor i in range(n+1): dp.append(i//c0*d0)\r\nfor i in range(m):\r\n a,b,c,d=map(int,input().split())\r\n for j in range(1,a//b+1):\r\n for k in range(n,c-1,-1):\r\n dp[k]=max(dp[k],dp[k-c]+d)\r\nprint(dp[n])\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, c0, d0 = map(int, input().split())\r\ndp = [-1] * (n + 1)\r\ndp[0] = 0\r\nfor _ in range(m):\r\n a, b, c, d = map(int, input().split())\r\n l = a // b\r\n for i in range(n, -1, -1):\r\n v = dp[i]\r\n if v == -1:\r\n continue\r\n j = i\r\n for _ in range(l):\r\n j += c\r\n if j > n:\r\n break\r\n v += d\r\n dp[j] = max(dp[j], v)\r\nans = 0\r\nfor i in range(n + 1):\r\n ans = max(ans, dp[i] + (n - i) // c0 * d0)\r\nprint(ans)", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,m,c0,d0=lst()\r\n l=[lst() for _ in range(m)]\r\n dp=[[0 for _ in range(m+1)] for _ in range(n+1)]\r\n for i in range(n+1):\r\n for j in range(m+1):\r\n if i==0:dp[i][j]=0\r\n elif j==0:\r\n for k in range(i//c0+1):\r\n dp[i][j]=max(dp[i][j],k*d0+dp[i-k*c0][j])\r\n else:\r\n dp[i][j]=dp[i][j-1]\r\n for times in range(l[j-1][0]//l[j-1][1]+1):\r\n if i-l[j-1][2]*times>=0:dp[i][j]=max(dp[i][j],dp[i-l[j-1][2]*times][j-1]+times*l[j-1][3])\r\n print(dp[n][m])", "import threading\r\nimport sys\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nsys.setrecursionlimit(10**6)\r\nfrom collections import defaultdict\r\ndef main():\r\n from functools import lru_cache\r\n n,m,c,d=map(int,input().split())\r\n arr=[]\r\n for _ in range(m):\r\n am,rb,ra,db=map(int,input().split())\r\n arr.append((am//rb,ra,db))\r\n @lru_cache(None)\r\n def solve(i,j):\r\n if i==m:\r\n return (j//c)*d\r\n else :\r\n ans=-float(\"inf\")\r\n price=arr[i][2]\r\n per=arr[i][1]\r\n for p in range(arr[i][0]+1):\r\n if p*per<=j:\r\n ans=max(ans,p*price+solve(i+1,j-p*per))\r\n return ans\r\n print(solve(0,n))\r\n \r\n \r\nthreading.stack_size(10 ** 6)\r\nt = threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n", "n,m,c,d=map(int,input().split())\r\ndp=[[0 for i in range(n+1)] for j in range(m+1)]\r\nfor i in range(1,n+1):\r\n if(i<c):dp[0][i]=dp[0][i-1]\r\n else:dp[0][i]=max(dp[0][i-c]+d,dp[0][i-1])\r\nfor i in range(1,m+1):\r\n a,b,c,d=map(int,input().split())\r\n for j in range(1,n+1):\r\n if(j<c):\r\n dp[i][j]=dp[i-1][j]\r\n else:\r\n for k in range(a//b+1):\r\n if(k*c<=j):dp[i][j]=max(dp[i][j],dp[i-1][j-k*c]+k*d)\r\n else:break\r\nprint(dp[m][n]) ", "n,m,c0,d0=map(int,input().split())\r\ndp=[0]*(n+1)\r\nfor a in range(n+1):\r\n dp[a]=(a//c0)*d0\r\nfor _ in range(m):\r\n dp2=[x for x in dp]\r\n a,b,c,d=map(int,input().split())\r\n for amt in range(n+1):\r\n for u in range(a+1):\r\n create=u//b\r\n raw=create*c\r\n if raw > amt: continue\r\n dp2[amt]=max(dp2[amt], dp[amt-raw]+create*d)\r\n dp=dp2\r\nprint(dp[n])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nn , m , c0 , d0 = map( int , input( ).split( ) )\r\nv = []\r\nf = [0] * ( n + 1 )\r\nfor _ in range( m ) : \r\n v.append( list( map( int , input( ).split( ) ) ) )\r\nfor i in range( m ) : \r\n a , b , c , d = v[i]\r\n s = a//b \r\n j = 1 \r\n while j <= s :\r\n k = n \r\n while k >= min( n + 1 , j * c ) : \r\n f[k] = max( f[k] , f[k-j * c] + j * d )\r\n k -= 1\r\n s -= j \r\n j <<= 1 \r\n if s :\r\n k = n \r\n while k >= min( n + 1 , s * c ) : \r\n f[k] = max( f[k] , f[k-s * c] + s * d )\r\n k -= 1\r\ns = n//c0 \r\nj = 1 \r\nwhile j <= s :\r\n k = n \r\n while k >= min( n + 1 , j * c0 ) : \r\n f[k] = max( f[k] , f[k-j * c0] + j * d0 )\r\n k -= 1\r\n s -= j \r\n j <<= 1 \r\nif s :\r\n k = n \r\n while k >= min( n + 1 , s * c0 ) : \r\n f[k] = max( f[k] , f[k-s * c0] + s * d0 )\r\n k -= 1\r\nprint( f[n] ) ", "n,m,c0,d0=map(int,input().split())\r\nlst=[(d0/c0,1000,c0,d0)]\r\nfor _ in range(m):\r\n a,b,c,d=map(int,input().split())\r\n lst.append((d/c,a//b,c,d))\r\nlst.sort(reverse=True)\r\nind,res=[0],[0]*(n+1)\r\nfor _,(x,k,c,d) in enumerate(lst):\r\n for i in range(k):\r\n new=[]\r\n for j,y in enumerate(ind):\r\n if y+c>n:continue\r\n if res[y]+d>res[y+c]:\r\n res[y+c]=res[y]+d\r\n new.append(y+c)\r\n if new==[]:break\r\n ind=new[:]\r\n ind,elem=[0],0\r\n for i,x in enumerate(res):\r\n if x>elem:\r\n elem=x\r\n ind.append(i)\r\n else:res[i]=elem\r\nprint(res[-1])", "n, m, c_0, d_0 = list(map(int, input().split()))\narray = [0] * 1005\nfor i in range(c_0, n + 1):\n array[i] = array[i - c_0] + d_0\nfor i in range(m):\n a, b, c, d = list(map(int, input().split()))\n for j in range(a // b):\n e = n\n while e >= c:\n array[e] = max(array[e], array[e - c] + d)\n e -= 1\nprint(array[n])\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, co, do = map(int, input().split())\r\nq = []\r\ng = []\r\nx = [(-1, []) for i in range(2000)]\r\nfor i in range(m):\r\n a, b, c, d = map(int, input().split())\r\n q.append((a//b))\r\n g.append((c, d))\r\nq.append(1000)\r\ng.append((co, do))\r\nx[0] = (0, q.copy())\r\nfor i in range(n+1):\r\n if x[i][0] == -1:\r\n continue\r\n for j in range(m+1):\r\n if x[i][1][j]:\r\n if x[i][0] + g[j][1] > x[i+g[j][0]][0]:\r\n x[i + g[j][0]] = (x[i][0] + g[j][1], x[i][1].copy())\r\n x[i + g[j][0]][1][j] -= 1\r\nprint(max([i[0] for i in x[:n+1]]))", "G, n, p, q = list(map(int, input().split()))\ng = [-1] # padding to make 1-indexed\nx = [-1]\ny = [-1]\nz = [-1]\nfor i in range(n):\n gi, xi, yi, zi = list(map(int, input().split()))\n g.append(gi)\n x.append(xi)\n y.append(yi)\n z.append(zi)\n\ndp = [[0] * (n + 1) for _ in range(G + 1)]\nfor k in range(1, G + 1):\n for i in range(1, n + 1):\n best_amount = 0\n for n_buns in range(g[i] // x[i] + 1):\n prev_flour = k - n_buns * y[i]\n if prev_flour < 0:\n break\n curr_amount = dp[prev_flour][i - 1] + n_buns * z[i]\n if curr_amount > best_amount:\n best_amount = curr_amount\n dp[k][i] = best_amount\n\npossible_amounts = []\nfor g in range(G + 1):\n remaining_flour = G - g\n buns_wo_stuffing = remaining_flour // p\n additional_amount = buns_wo_stuffing * q\n possible_amounts.append(dp[g][n] + additional_amount)\n\nprint(max(possible_amounts))\n", "import sys\r\nN = 1010\r\n\r\na = [0]*N\r\nb = [0]*N\r\nc = [0]*N\r\nd = [0]*N\r\nf = [0]*N\r\n\r\nn, m, x, y = map(int, sys.stdin.readline().split())\r\n\r\nfor i in range(1, m+1):\r\n a[i], b[i], c[i], d[i] = map(int, sys.stdin.readline().split())\r\n\r\nm += 1\r\na[m] = 10**9\r\nb[m] = 1\r\nc[m] = x\r\nd[m] = y\r\n\r\nfor i in range(1, m+1):\r\n for j in range(n, 0, -1):\r\n for k in range(min(j // c[i], a[i] // b[i])+1):\r\n f[j] = max(f[j], f[j - k * c[i]] + k * d[i])\r\n\r\nprint(f[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, m, c0, d0 = ints()\r\nstuffings = []\r\nfor _ in range(m):\r\n a, b, c, d = ints()\r\n stuffings.append((a, b, c, d))\r\n\r\ndp = [[0 for _ in range(n + 1)] for _ in range(m + 1)]\r\n\r\nfor i in range(m):\r\n for j in range(n + 1):\r\n if i > 0:\r\n dp[i][j] = dp[i - 1][j]\r\n for k in range(101):\r\n a = stuffings[i][0]\r\n b = k * stuffings[i][1]\r\n c = k * stuffings[i][2]\r\n d = k * stuffings[i][3]\r\n if a - b >= 0 and j - c >= 0:\r\n before = 0 if i == 0 else dp[i - 1][j - c]\r\n dp[i][j] = max(dp[i][j], d + before)\r\n elif a - b < 0:\r\n break\r\nfor j in range(n + 1):\r\n dp[-1][j] = dp[-1 - 1][j]\r\n if j - c0 >= 0:\r\n dp[-1][j] = max(dp[-1][j], d0 + dp[-1][j - c0])\r\nprint(dp[-1][-1])\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN,M,C,D = map(int,input().split())\ndp = [[-float('inf')]*(N+1) for _ in range(M+1)]\n\nfor x in range(N//C+1):dp[0][N-(x*C)] = x*D\n\nfor i in range(1,M+1):\n a,b,c,d = map(int,input().split())\n for j in range(N+1):\n if j*b>a or j*c>N:break\n for x in range(N+1):\n if x+(j*c)>N:continue\n dp[i][x] = max(dp[i][x],dp[i-1][x+j*c]+j*d)\n\n\n# for i in dp:print(i)\nprint(max(dp[-1]))", "def abc(l,n,i,m):\r\n try:\r\n return dic[n,i]\r\n except:\r\n pass\r\n if i==m:\r\n return 0\r\n if l[i][0]==-1:\r\n b=l[i][1]\r\n ans = abc(l,n,i+1,m)\r\n e = 1\r\n while b<=n:\r\n ans=max(ans,e*l[i][2]+abc(l,n-b,i+1,m))\r\n b+=l[i][1]\r\n e+=1\r\n dic[n,i]=ans\r\n return ans\r\n ans = abc(l,n,i+1,m)\r\n b = l[i][1]\r\n e=1\r\n while b<=n and e<=l[i][0]:\r\n ans = max(ans,e*l[i][2]+abc(l,n-b,i+1,m))\r\n b+=l[i][1]\r\n e+=1\r\n dic[n,i]=ans\r\n return ans\r\n \r\ndic = {} \r\nn,m,c0,d0 = map(int,input().split())\r\nl=[]\r\nl.append([-1,c0,d0])\r\nfor i in range(m):\r\n a,b,c,d=map(int,input().split())\r\n l.append([a//b,c,d])\r\n\r\nprint(abc(l,n,0,m+1))\r\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\nINF = float('inf')\r\nN,M,c0,d0 = map(int, input().split())\r\ndp = [0]*(N+1)\r\n\r\nfor _ in range(M):\r\n a,b,c,d = map(int, input().split())\r\n t = a//b\r\n for _ in range(t):\r\n for i in range(N,c-1,-1):\r\n dp[i] = max(dp[i], dp[i-c]+d)\r\n\r\nans = 0\r\nfor i in range(N+1):\r\n ans = max(ans, dp[i]+(N-i)//c0*d0)\r\nprint(ans)\r\n\r\n", "# 106C\n\ndef do():\n n, m, c0, d0 = map(int, input().split(\" \"))\n dp = [0] * (n + 1)\n for i in range(c0, n + 1):\n dp[i] = i // c0 * d0\n for _ in range(m):\n a, b, c, d = map(int, input().split(\" \"))\n for i in range(n, c - 1, -1):\n for j in range(1, a // b + 1):\n if i >= j * c:\n dp[i] = max(dp[i], dp[i - j * c] + j * d)\n return dp[-1]\n\nprint(do())", "#codeforces 106c\nimport sys\n# sys.stdin = open('InterviewBit/DP/input.txt', 'r')\n# sys.stdout = open('InterviewBit/DP/output.txt', 'w')\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(get_string())\ndef get_float(): return float(get_string)\n\ndef buns(n,m,c0,d0,stuffing):\n dp = [[0]*(m+1) for i in range(n+1)] #dp[i][j]=max d with i gram dough and j stuffings without normal buns \n\n for i in range(1,n+1):\n for j in range(1,m+1):\n a = stuffing[j-1][0]\n b = stuffing[j-1][1]\n c = stuffing[j-1][2]\n d = stuffing[j-1][3]\n K = a//b\n for k in range(K+1):\n if i-c*k>=0:\n dp[i][j]=max(dp[i][j],dp[i-c*k][j-1] + d*k) \n # for i in range(n+1):\n # print(dp[i])\n ans=0\n for k in range(n+1):\n ans= max(ans,dp[k][m] + ((n-k)//c0)*d0 )\n\n return ans\n\ndef main():\n [n,m,c0,d0] = get_list()\n stuffing = [0]*m\n \n for i in range(m):\n stuffing[i] = get_list() # a,b,c,d\n \n print(buns(n,m,c0,d0,stuffing)) \n\nif __name__ == '__main__':\n main()", "def bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = stack.append(f(*args, **kwargs))\r\n while True:\r\n try:\r\n to = stack.append(stack[-1].send(to))\r\n except StopIteration as e:\r\n stack.pop()\r\n to = e.value\r\n if not stack:\r\n break\r\n return to\r\n \r\n return wrappedfunc\r\n \r\n@bootstrap\r\ndef go(ind,dl):\r\n # print(ind,dl) \r\n if (ind==m):\r\n return 0 \r\n if (dl<0):\r\n return -10**9 \r\n if (dl==0):\r\n return 0 \r\n if (dp[ind][dl]!=-1):\r\n return dp[ind][dl] \r\n \r\n ans = -10**9\r\n c1 = 0 \r\n for j in range(lst[ind][0]//lst[ind][1] + 10):\r\n if ((lst[ind][0]-j*lst[ind][1])<0 or (dl-j*lst[ind][2])<0):\r\n continue\r\n\r\n c1 = j*(lst[ind][3]) + (yield go(ind+1,dl-j*lst[ind][2])) \r\n ans = max(ans,c1) \r\n dp[ind][dl] = ans \r\n return ans \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn,m,x,y = map(int,input().split()) \r\nlst = [ ] \r\nfor i in range(m):\r\n a,b,c,d = map(int,input().split()) \r\n lst.append([a,b,c,d]) \r\n\r\n\r\nq = 0 \r\ndp = [ ] \r\nfor i in range(m+1):\r\n z = [ ] \r\n for j in range(n+1):\r\n z.append(-1) \r\n dp.append(z) \r\n\r\nfor i in range(n//x +10):\r\n if ((n-i*x) <0):\r\n continue\r\n q = max(q,(i*(y) + go(0,(n-i*x))))\r\n\r\nprint(q) \r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn,m,c0,d0=map(int,input().split())\r\nmaxi=(n//c0)*d0\r\ndp=[[0 for i in range(n+1)] for j in range(m+1)]\r\ni=1\r\nwhile i*c0<=n:\r\n dp[0][i*c0]=i*d0\r\n i+=1\r\nfor i in range(1,m+1):\r\n a,b,c,d=map(int,input().split())\r\n for j in range(n+1):\r\n k=0\r\n while k*c+j<=n and b*k<=a:\r\n dp[i][k*c+j]=max(dp[i][k*c+j],max(dp[i-1][k*c+j],dp[i-1][j]+k*d))\r\n k+=1\r\n for j in range(n+1):\r\n dp[i][j]=max(dp[i][j],dp[i-1][j])\r\n \r\nfor i in range(m+1):\r\n for j in range(n+1):\r\n maxi=max(maxi,dp[i][j])\r\nprint(maxi) ", "n,m,c0,d0=map(int,input().split())\r\na=[]\r\nfor i in range(m):\r\n p,q,r,s=map(int,input().split())\r\n a.append([p,q,r,s])\r\na.append([0,0,c0,d0])\r\n \r\ndp=[[0 for i in range(m+2)] for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n for j in range(1,m+2):\r\n ans=dp[i][j-1]\r\n stuff=a[j-1][0]\r\n dou=i\r\n count=0\r\n while(dou>=a[j-1][2] and stuff>=a[j-1][1]):\r\n count+=1\r\n dou-=a[j-1][2]\r\n stuff-=a[j-1][1]\r\n ans=max(ans,count*a[j-1][3]+dp[dou][j-1])\r\n dp[i][j]=ans\r\nprint(dp[n][m+1])", "n,m,c0,d0=map(int,input().split(\" \"))\r\na,b,c,d=[0],[0],[0],[0]\r\n\r\nfor i in range(m):\r\n x,y,z,e=map(int,input().split(\" \"))\r\n a.append(x)\r\n b.append(y)\r\n c.append(z)\r\n d.append(e)\r\n\r\ndp=[[0 for i in range(m+1)] for j in range(n+1)]\r\n\r\nfor i in range(n+1):\r\n for j in range(1,m+1):\r\n mx=0\r\n for k in range(a[j]//b[j]+1):\r\n if i>=c[j]*k:\r\n mx=max(dp[i-c[j]*k][j-1] + d[j]*k,mx)\r\n dp[i][j]=mx\r\nans=0\r\n\r\nfor i in range(n+1):\r\n ans=max(ans,dp[i][m]+((n-i)//c0)*d0)\r\n\r\nprint(ans)\r\n", "n, m, c0, d0 = [int(x) for x in input().split()]\r\na = [0] * m\r\nb = [0] * m\r\nc = [0] * m\r\nd = [0] * m\r\nfor i in range(m):\r\n a[i], b[i], c[i], d[i] = [int(x) for x in input().split()]\r\ndp = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n if i - c0 > -1:\r\n dp[i] = max(d0 + dp[i - c0], dp[i])\r\n\r\nfor i in range(m):\r\n for j in range(n, 0, -1):\r\n for k in range(1, a[i] // b[i] + 1):\r\n if j - c[i] * k > -1:\r\n dp[j] = max(dp[j - c[i] * k] + d[i] * k, dp[j])\r\nprint(max(dp))", "#!/usr/bin/env python3\r\n\r\nn, m, c0, d0 = map(int, input().rstrip().split())\r\ncnt, c, d = [n//c0], [c0], [d0]\r\n\r\nfor i in range(m):\r\n ai, bi, ci, di = map(int, input().rstrip().split())\r\n cnt_i = min(n//ci, ai//bi)\r\n cnt.append(cnt_i)\r\n c.append(ci)\r\n d.append(di)\r\n\r\n\r\ndef binarize(v):\r\n b = 0\r\n while (b << 1) + 1 <= v:\r\n b = (b << 1) + 1 # 111..\r\n yield (b + 1) >> 1 # 111... + 1 = 1000...\r\n\r\n if b < v:\r\n yield v - b\r\n\r\n\r\ndp = [0] * (n+1)\r\nfor i in range(m+1):\r\n for sub_cnt in binarize(cnt[i]):\r\n dough, gain = sub_cnt * c[i], sub_cnt * d[i]\r\n for pos in range(n, dough-1, -1):\r\n dp[pos] = max(dp[pos], dp[pos-dough] + gain)\r\n\r\nprint(dp[n])\r\n", "import math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\n# cool problem !\r\n\r\ndef solve():\r\n n, m, c0, d0 = map(int, input().split())\r\n\r\n f = []\r\n # order = [list(i) for i in itertools.permutations([j for j in range(m + 1)], m + 1)]\r\n\r\n for i in range(m):\r\n a, b, c, d = map(int, input().split())\r\n f.append([a, b, c, d])\r\n f.append([100000, 1, c0, d0])\r\n\r\n # dp[testo_ostalos] = max_cena\r\n dp = [0 for i in range(n + 1)]\r\n\r\n for a, b, c, d in f:\r\n can_do = min(a // b, n // c)\r\n for j in range(can_do):\r\n for testo_rem in range(n + 1):\r\n if testo_rem + c > n:\r\n break\r\n dp[testo_rem] = max(dp[testo_rem], dp[testo_rem + c] + d)\r\n\r\n print(max(dp))\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 heapq import heappush, heappop\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache\r\nimport threading\r\nimport sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\ndef ri(): return int(input())\r\ndef rs(): return input()\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(input().split())\r\n\r\n# threading.stack_size(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef main():\r\n\tn,m,c,d=rl()\r\n\tdp=[0]*1033\r\n\tfor i in range(c,n+1):\r\n\t\tdp[i]=max(dp[i],dp[i-c]+d)\r\n\tfor i in range(m):\r\n\t\ta,b,c,d=rl()\r\n\t\tfor j in range(a//b):\r\n\t\t\tfor k in range(n,-1,-1):\r\n\t\t\t\tif k>=c:\r\n\t\t\t\t\tdp[k]=max(dp[k],dp[k-c]+d)\r\n\tprint(max(dp))\r\n\tpass\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "n, m, c, d = map(int, input().split())\n\nt = [(d / c, 1000, c, d)] + [0] * m\n\nfor i in range(1, m + 1):\n\n a, b, c, d = map(int, input().split())\n\n t[i] = (d / c, a // b, c, d)\n\nt.sort(reverse = True)\n\ns, p = [0], [0] * (n + 1)\n\nfor i in range(m + 1):\n\n x, k, c, d = t[i]\n\n for j in range(k):\n\n r = []\n\n for x in s:\n\n y = x + c\n\n if y > n: continue\n\n if p[y] < p[x] + d:\n\n p[y] = p[x] + d\n\n r.append(y)\n\n if not r: break\n\n s = r\n\n x, s = 0, [0]\n\n for i in range(1, n + 1):\n\n if p[i] > x:\n\n s.append(i)\n\n x = p[i]\n\n else: p[i] = x\n\nprint(p[n])\n\n \n\n\n\n# Made By Mostafa_Khaled", "mikla, types, c0, d0 = map(int, input().split())\r\npieejamais = [0];pildijumapaterins = [0];miklaspaterins = [0];cena = [0]\r\nfor recepte in range(types):\r\n a, b, c, d = map(int, input().split())\r\n pieejamais.append(a);pildijumapaterins.append(b);miklaspaterins.append(c);cena.append(d)\r\n\r\ntabula = [[0 for t in range(types + 1)] for m in range(mikla + 1)]\r\nfor n in range(mikla + 1):\r\n tabula[n][0] = (n // c0) * d0\r\nfor miklasdaudz in range(1, mikla + 1):\r\n for pildijumi in range(1, types + 1):\r\n maxx = 0\r\n for k in range(pieejamais[pildijumi] // pildijumapaterins[pildijumi] + 1):\r\n if miklasdaudz - miklaspaterins[pildijumi] * k >= 0: \r\n izmantotamikla = k * miklaspaterins[pildijumi]\r\n atlikusimikla = miklasdaudz - izmantotamikla\r\n pelna = cena[pildijumi] * k\r\n s = tabula[atlikusimikla][pildijumi - 1]\r\n if pelna + s > maxx:\r\n maxx = pelna + s\r\n tabula[miklasdaudz][pildijumi] = maxx\r\nprint(tabula[mikla][types])\r\n", "n, m, c, d = map(int, input().split())\r\narr = [0]*1010\r\nfor i in range(c, n+1):\r\n arr[i] = arr[i-c] + d\r\nfor l in range(m):\r\n a, b, c, d = map(int, input().split())\r\n for i in range(0, a//b):\r\n j=n\r\n while j >= c:\r\n arr[j] = max(arr[j], arr[j-c] + d)\r\n j -= 1\r\nprint(arr[n])", "def main(arr,n,doug,cost):\r\n\r\n\r\n dp=[[0 for i in range(len(arr)+1)] for j in range(n+1)]\r\n\r\n \r\n dp[0]=[0 for i in range(len(arr)+1)]\r\n\r\n for i in range(1,n+1):\r\n for j in range(0,len(arr)+1):\r\n if j==0:\r\n a,b,c,d=50000000,1,doug,cost\r\n else:\r\n a,b,c,d=arr[j-1]\r\n\r\n for k in range(0,min(a//b,i//c)+1):\r\n if j==0:\r\n dp[i][j]=max(cost*k+dp[i-c*k][j],dp[i][j])\r\n else:\r\n \r\n dp[i][j]=max(d*k+dp[i-c*k][j-1],dp[i][j])\r\n \r\n return dp[-1][-1] \r\n\r\nn,m,doug,cost=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(m):\r\n arr.append(list(map(int,input().split())))\r\nprint(main(arr,n,doug,cost))\r\n\r\n", "def calc(material, pos):\r\n if dp[material][pos] != -1:\r\n return dp[material][pos]\r\n if pos == n:\r\n dp[material][pos] = 0\r\n return 0\r\n res = 0\r\n for i in range(cosos[pos][0] // cosos[pos][1] + 1):\r\n if i * cosos[pos][2] <= material:\r\n res = max(res, calc(material - i * cosos[pos][2], pos + 1) + i * cosos[pos][3])\r\n dp[material][pos] = res\r\n return res\r\ncant, n, d1, p1 = map(int, input().split())\r\ncosos = []\r\nfor _ in range(n):\r\n cosos.append(list(map(int, input().split())))\r\ndp = [[-1] * 16 for _ in range(1024)]\r\nres = 0\r\nfor i in range(1024):\r\n for j in range(16):\r\n dp[i][j] = -1\r\nfor i in range(cant // d1 + 1):\r\n res = max(res, calc(cant - d1 * i, 0) + i * p1)\r\nprint(res)# 1691511370.5433996", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,m,c0,d0=(int(i) for i in input().split())\r\na,b,c,d=[],[],[],[]\r\nfor i in range(m):\r\n w,x,y,z=(int(i) for i in input().split())\r\n a.append(w)\r\n b.append(x)\r\n c.append(y)\r\n d.append(z)\r\ndp=[[0 for i in range(m+1)] for j in range(n+1)]\r\nfor i in range(n+1):\r\n for j in range(1,m+1):\r\n for k in range(0,(a[j-1]//b[j-1])+1):\r\n if(i-c[j-1]*k>=0):\r\n dp[i][j]=max(dp[i][j],dp[i-c[j-1]*k][j-1]+d[j-1]*k)\r\nm1=0\r\nfor i in range(n+1):\r\n m1=max(m1,dp[i][m]+((n-i)//c0)*d0)\r\nprint(m1)" ]

[ "import sys\r\n\r\n\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef MI(): return map(int,sys.stdin.readline().rstrip().split())\r\ndef LI(): return list(map(int,sys.stdin.readline().rstrip().split()))\r\ndef LI2(): return list(map(int,sys.stdin.readline().rstrip()))\r\ndef S(): return sys.stdin.readline().rstrip()\r\ndef LS(): return list(sys.stdin.readline().rstrip().split())\r\ndef LS2(): return list(sys.stdin.readline().rstrip())\r\n\r\n\r\nN,k = MI()\r\nmod = 10**9+7\r\n\r\ninv_2 = (mod+1)//2\r\nx = pow(2,N,mod)\r\nX = [0]*(k+1) # X[i] = N_P_i*2^(N-i)\r\nfor i in range(k+1):\r\n X[i] = x\r\n x *= (N-i)*inv_2\r\n x %= mod\r\n\r\ncoefficient = [0]*(k+1)\r\n# coefficient[i] = f(x)に対して、「微分して*xする」をi回繰り返した際の係数\r\n# メモリ節約のため、i省略\r\ncoefficient[0] = 1\r\nfor _ in range(k):\r\n for j in range(k,-1,-1):\r\n coefficient[j] = coefficient[j]*j+coefficient[j-1]\r\n coefficient[j] %= mod\r\n\r\nans = 0\r\nfor i in range(1,k+1):\r\n ans += coefficient[i]*X[i]\r\n ans %= mod\r\n\r\nprint(ans)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef comb(n, r):\r\n return fact[n] * inv[r] % mod * inv[n - r] % mod if n >= r >= 0 else 0\r\n\r\ndef pow(x, y, mod):\r\n if x == -1:\r\n return 1 - y % 2 * 2\r\n ans, u = 1, x\r\n while y:\r\n if y & 1:\r\n ans = ans * u % mod\r\n y >>= 1\r\n u = u * u % mod\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\nmod = 10 ** 9 + 7\r\nl = k + 5\r\nfact = [1] * (l + 1)\r\nfor i in range(1, l + 1):\r\n fact[i] = i * fact[i - 1] % mod\r\ninv = [1] * (l + 1)\r\ninv[l] = pow(fact[l], mod - 2, mod)\r\nfor i in range(l - 1, -1, -1):\r\n inv[i] = (i + 1) * inv[i + 1] % mod\r\nans = 0\r\nu = [0] * (k + 1)\r\nv = 1\r\nfor i in range(1, min(n, k) + 1):\r\n ui = pow(i, k, mod)\r\n for j in range(1, i):\r\n ui -= comb(i, j) * u[j] % mod\r\n u[i] = ui % mod\r\n v = v * (n - i + 1) % mod\r\n ans += v * inv[i] % mod * u[i] % mod * pow(2, n - i, mod) % mod\r\nans %= mod\r\nprint(ans)", "n, k = map(int, input().split())\nm = 0x3b9aca07\nv = 500000004\nr = 0\np = pow(2, n, m)\na = [1] + [0] * k\nfor i in range(k):\n for j in range(i, -1, -1):\n a[j + 1] += a[j]\n a[j] = a[j] * j % m\nfor i in range(k + 1):\n r = (r + p * a[i]) % m\n p = p * v * (n - i) % m\nprint(r)\n", "# ############################## import\r\n# def stirling2_list(n, mod=10 ** 9 + 7):\r\n# if not n:\r\n# return [0]\r\n# res = [0, 1]\r\n# for i in range(n - 1):\r\n# res = [0, 1] + [(res[j - 1] + j * res[j]) % mod for j in range(2, 2 + i)] + [1]\r\n# return res\r\n\r\n# Explain:\r\n# ans = \\sum_{i=1}^{n} \\binom{n}{i} i^k\r\n# Notice that (1+x)^n = \\sum_{i=0}^{n} \\binom{n}{i} x^i\r\n# differential and multiply by x on both side, we can get\r\n# n(1+x)^{n-1}x=\\sum_{i=0}^{n}\\binom{n}{i}ix^i\r\n# we can keep doing this process to get \\sum_{i=0}^{n}\\binom{n}{i}i^kx^i\r\n# and the answer is the left side function, with x = 1\r\n#\r\n# Let f_0(x) = (1+x)^n\r\n# and f_m(x) = f_{m-1}'(x)x\r\n# so the answer is f_{k}(1)\r\n# We calculate the first few of patterns\r\n# We can observe that:\r\n# f_1 = f_0'x\r\n# f_2 = f_0'x + 1f_0''x^2\r\n# f_3 = f_0'x + 3f_0''x^2 + f_0'''x^3\r\n# f_4 = f_0'x + 7f_0''x^2 + 6f_0'''x^3 + f_0''''x^4\r\n# The coefficients is Stirling numbers of the second kind\r\n# And f_0 with differentiating k times is just\r\n# n(n-1)(n-2)...(n-(k-1))(1+x)^{n-k}\r\n# We can find them out in one iteration\r\n# ############################## main\r\n\r\nMOD = 10 ** 9 + 7\r\nINV = 500000004\r\nn, k = map(int, input().split())\r\n# (1+x)^n, n(1+x)^{n-1}, n(n-1)(1+x)^{n-2}, ...\r\n# 2^n, n*2^{n-1}, n(n-1)*2^{n-2}, ...\r\n# f_4 = f_0' + 7f_0'' + 6f_0''' + f_0''''\r\nd = 1\r\np = pow(2, n, MOD)\r\nans = 0\r\nstirling2_list = [0, 1]\r\nfor i in range(k - 1):\r\n stirling2_list = [0, 1] + [(stirling2_list[j - 1] + j * stirling2_list[j]) % MOD for j in range(2, 2 + i)] + [1]\r\nfor stirling in stirling2_list:\r\n ans = (ans + stirling * d * p) % MOD\r\n d = d * n % MOD\r\n n -= 1\r\n p = p * INV % MOD\r\nprint(ans)\r\n", "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\nn,k=[int(e) for e in input().split()]\r\nA=[[0]*(k+1) for i in range(k+1)]\r\nA[1][1]=1\r\nfor k in range(2, k+1):\r\n A[k][1]=1\r\n for j in range(2, k+1):\r\n A[k][j]=j*A[k-1][j]+A[k-1][j-1]\r\n A[k][j]%=M\r\nans=0\r\np=modpow(2,n)\r\nhyp=modpow(2,-1)\r\nfor j in range(1, k+1):\r\n p*=hyp*(n-j+1)\r\n p%=M\r\n ans+=A[k][j]*p\r\n ans%=M\r\nprint(ans)", "n, k = map(int, input().split())\r\nm = int(1e9+7)\r\nr = 0\r\np = pow(2, n, m)\r\na = [1] + [0] * k\r\nfor i in range(k):\r\n for j in range(i, -1, -1):\r\n a[j+1] += a[j]\r\n a[j] = a[j]*j % m\r\nfor i in range(k + 1):\r\n r += p*a[i]\r\n p = p*500000004*(n - i) % m\r\nprint(r % m)" ]

[ "def solve(a,i,j,m,n,o,d):\r\n if i>j:\r\n i=a-i\r\n j=a-j\r\n o=a-o\r\n d*=-1\r\n tmp=n*(j-i)\r\n c=0\r\n if d==-1:\r\n c=o+i\r\n elif o<=i:\r\n c=i-o\r\n else:\r\n c=2*a-(o-i)\r\n tmp=min(tmp,(c+j-i)*m)\r\n return tmp\r\n\r\na,i,j=map(int,input().split())\r\nm,n=map(int,input().split())\r\no,d=map(int,input().split())\r\nprint(solve(a,i,j,m,n,o,d))\r\n", "f = lambda: map(int, input().split())\r\ns, x, y = f()\r\na, b = f()\r\np, d = f()\r\nif x > y: d, p, x, y = -d, s - p, s - x, s - y\r\nprint(min((y - x) * b, [2 * s * (p > x) + y - p, y + p][d < 0] * a))", "s,x1,x2=map(int,input().split())\r\nt1,t2=map(int,input().split())\r\np,d=map(int,input().split())\r\nif x1>x2:\r\n\tx1=s-x1\r\n\tx2=s-x2\r\n\td*=-1\r\n\tp=s-p\r\nans=(x2-x1)*t2\r\nif d==1:\r\n\tif p<=x1:ans=min(ans,t1*(x2-p))\r\n\tans=min(ans,t1*(s-p+s+x2))\r\nelse:\r\n\tans=min(ans,(p+x2)*t1)\r\nprint(ans)# 1698239838.6708074", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns, x1, x2 = map(int, input().split())\r\nt1, t2 = map(int, input().split())\r\np, d = map(int, input().split())\r\nif x1 > x2:\r\n x1, x2 = s - x1, s - x2\r\n p, d = s - p, -d\r\nf = 1 if p == x1 else 0\r\nc = 0\r\nwhile True:\r\n c += 1\r\n p += d\r\n if not p or p == s:\r\n d *= -1\r\n if f and p == x2:\r\n break\r\n if p == x1:\r\n f = 1\r\nans = min(t1 * c, t2 * (x2 - x1))\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(x1, x2, p, t):\r\n if t == -1:\r\n return p + x2\r\n elif p <= x1:\r\n return x2-p\r\n else:\r\n return 2*s-p+x2\r\n\r\n\r\ns, x1, x2 = map(int, input().split())\r\nt1, t2 = map(int, input().split())\r\np, d = map(int, input().split())\r\nif x2 > x1:\r\n a = f(x1, x2, p, d)\r\nelse:\r\n a = f(s-x1, s-x2, s-p, d*-1)\r\nprint(min(a*t1, abs(x2-x1)*t2))" ]

[ "from math import sqrt\r\na, b = map(int, input().split())\r\nans = 100000\r\nfor _ in range(int(input())):\r\n x, y, v = map(int, input().split())\r\n q = sqrt(pow(abs(x-a),2)+pow(abs(y-b),2))/v\r\n if q < ans:\r\n ans = q\r\nprint(ans)\r\n", "# https://codeforces.com/problemset/problem/706/A\r\n# Author: sandodev\r\nfrom math import sqrt\r\nA, B = input().split()\r\n\r\nn = int(input())\r\n\r\nv_final = 284.0\r\n\r\ndef distancia(x,y):\r\n return sqrt(pow((int(A)-int(x)),2)+pow((int(B)-int(y)),2))\r\n\r\nfor _ in range(n):\r\n x,y,v = input().split()\r\n\r\n d = distancia(x,y)\r\n tiempo = d/int(v)\r\n if tiempo < v_final:\r\n v_final = tiempo\r\n\r\n\r\nprint(v_final)\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\na, b = [int(x) for x in input().split()]\r\nn = int(input())\r\nanswer = float('inf')\r\nfor i in range(n):\r\n x, y, v = [int(X) for X in input().split()]\r\n answer = min(answer, ((x-a)**2+(y-b)**2)**0.5/v)\r\nprint(answer)", "a, b = map(int, input().split())\r\nn = int(input())\r\nr = 1e9\r\nfor _ in range(n):\r\n x, y, v = map(int, input().split())\r\n r = min(r, ((x-a)**2+(y-b)**2)**0.5/v)\r\n\r\nprint(r)", "a,b=map(int,input().split())\nn=input()\ntime=-1\nfor i in range(int(n)):\n x,y,v=map(int,input().split())\n if time == -1 :\n time =( (x-a)**2 + (y-b)**2 ) **(1/2)/v\n elif ( (x-a)**2 + (y-b)**2 ) **(1/2)/v < time:\n time=( (x-a)**2 + (y-b)**2 ) **(1/2)/v\nprint(time)\n\n\n\n", "a, b = map(int, input().split())\r\nn = int(input())\r\ntime = float(\"inf\")\r\nfor t in range(n):\r\n x, y, v = map(int, input().split())\r\n time = min(time, ((a - x) ** 2 + (b - y) ** 2) ** 0.5 / v)\r\nprint(time)\r\n", "import math\r\n\r\ndef distance(a, b, x, y):\r\n return math.sqrt((a - x)**2 + (b - y)**2)\r\n\r\ndef durer(d, v):\r\n return d / v\r\n\r\na, b = map(int, input().split())\r\nn = int(input())\r\nm = 1000.0\r\n\r\nfor _ in range(n):\r\n x, y, v = map(int, input().split())\r\n d = distance(a, b, x, y)\r\n t = durer(d, v)\r\n if t < m:\r\n m = t\r\n\r\nprint(\"{:.18f}\".format(m))\r\n\r\n", "import math\n\ndef calculate_time(x, y, v):\n return math.sqrt(x**2 + y**2) / v\n\na, b = map(int, input().split())\nn = int(input())\n\nmin_time = float('inf') # Initialize min_time to positive infinity\n\nfor _ in range(n):\n xi, yi, vi = map(int, input().split())\n time = calculate_time(a - xi, b - yi, vi) # Calculate time for the current taxi\n min_time = min(min_time, time) # Update min_time if the current time is smaller\n\nprint(\"{:.15f}\".format(min_time)) # Print the result with high precision\n\t\t\t\t \t\t \t\t\t\t \t\t\t\t\t\t \t\t \t", "from math import sqrt\r\nx, y = map(int,input().split())\r\nn = int(input())\r\nt = []\r\nfor i in range(n):\r\n x1,y1,v = map(int,input().split())\r\n t.append(sqrt((x-x1)**2+(y-y1)**2)/v)\r\nprint(min(t))", "import math\r\na,b=map(int,input().strip().split())\r\nn=int(input())\r\nmans=float('inf')\r\ndef dist(x,y):\r\n v=x*x+y*y\r\n ans=math.sqrt(v)\r\n return ans\r\n\r\nfor i in range(n):\r\n x,y,v=map(int,input().strip().split())\r\n v1=abs(x-a)\r\n v2=abs(y-b)\r\n v3=dist(v1,v2)\r\n v4=v3/v\r\n if v4<mans:\r\n mans=v4\r\nprint(mans)\r\n \r\n\r\n\r\n", "from sys import stdin\r\nimport math\r\n# import decimal\r\n# decimal.getcontext().prec = 10\r\n\r\na, b = stdin.readline().split()\r\na, b = int(a), int(b)\r\ntimes = []\r\n\r\nfor _ in range(int(stdin.readline())):\r\n x, y, v = stdin.readline().split()\r\n x, y, v = int(x), int(y), int(v)\r\n dist = math.sqrt((x-a)**2 + (y-b)**2)\r\n time = dist / v\r\n times.append(time)\r\n\r\nprint('{0:0.20f}'.format(min(times)))\r\n ", "h=input()\r\nlh=h.split(\" \")\r\na=int(lh[0])\r\nb=int(lh[1])\r\nn=int(input())\r\nlot=[]\r\nfor i in range(0,n):\r\n c=input()\r\n loc=c.split(\" \")\r\n x=int(loc[0])\r\n y=int(loc[1])\r\n v=int(loc[2])\r\n time=(((a-x)**2+(b-y)**2)**(0.5))/v\r\n lot.append(time)\r\nprint(min(lot))\r\n \r\n \r\n", "a, b = map(int, input().split())\r\nn = int(input())\r\nx, y, v = map(int, input().split())\r\nt_min = ((a-x)**2+(b-y)**2)**0.5 / v\r\nfor _ in range(n-1):\r\n x, y, v = map(int, input().split())\r\n t = ((a-x)**2+(b-y)**2)**0.5 / v\r\n if t < t_min:\r\n t_min = t\r\n\r\nprint(t_min)", "import math\r\nfrom decimal import Decimal, getcontext\r\ngetcontext().prec = 20\r\n\r\nvasiliy1, vasiliy2 = map(int, input().split())\r\nn = int(input())\r\n\r\ntimes = list()\r\nfor i in range(n):\r\n taxi_x, taxi_y, taxi_v = map(int, input().split())\r\n point1 = (vasiliy1, vasiliy2)\r\n point2 = (taxi_x, taxi_y)\r\n d = ((point2[0]-point1[0])**2 + (point2[1] - point1[1])**2) ** 0.5\r\n times.append(d/taxi_v)\r\n\r\nprint(\"{:.20f}\".format(min(times)))\r\n", "print([sorted([[__import__(\"math\").sqrt((xt - xh) ** 2 + (yt - yh) ** 2) / st for xt, yt, st in zip(*[[i] for i in map(int, input().split())])][0] for it in range(int(input()))]) for xh, yh in zip(*[[i] for i in map(int, input().split())])][0][0])\r\n", "a, b = map(int, input().split())\r\nm = 1e9\r\nfor _ in range(int(input())):\r\n x, y, v = map(int, input().split())\r\n m = min(m, (((x-a)**2 + (y-b)**2)**(1/2)) / v)\r\n\r\nprint(m) ", "a,b = map(int, input().split())\r\nn = int(input())\r\ntaxi = []\r\nfor d in range(n):\r\n x,y,v = list(map(int, input().split()))\r\n t = ((((x-a)**2 + (y-b)**2)**(1/2))/v)\r\n taxi += [t]\r\nprint(min(taxi))", "import math\r\n\r\nxh, yh = map(int, input().split())\r\nout = math.inf\r\nfor i in range(int(input())):\r\n xt, yt, st = map(int, input().split())\r\n dt = math.sqrt((xt - xh) ** 2 + (yt - yh) ** 2) / st\r\n if dt < out:\r\n out = dt\r\nprint(out)", "import math\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nnumber_of_cars=int(input())\r\nmylist=[]\r\nfor i in range(number_of_cars):\r\n e,f,g=input().split()\r\n e=int(e)\r\n f=int(f)\r\n g=int(g)\r\n distance_formula=math.sqrt((e-a)**2+(f-b)**2)\r\n mylist.append(distance_formula/g)\r\nprint(min(mylist))" ]

[ "\nn = int(input())\nlengths = list(map(int, input().split()))\ncosts = list(map(int, input().split()))\nsum = 0\nlength_to_sum = {}\nlength_to_count = {}\ncost_to_lengths = {}\n\nfor i in range(n):\n length, cost = lengths[i], costs[i]\n sum += cost\n length_to_sum[length] = length_to_sum.setdefault(length, 0) + cost\n length_to_count[length] = length_to_count.setdefault(length, 0) + 1\n cost_to_lengths.setdefault(cost, []).append(length)\n\nlength_set = set(lengths)\nfor lengths in cost_to_lengths.values():\n lengths.sort()\nunique_costs = list(reversed(sorted(cost_to_lengths.keys())))\nbest = -1\n\nfor length in length_set:\n total = sum - length_to_sum[length]\n seek = length_to_count[length] - 1\n if seek != 0:\n for cost in unique_costs:\n for x in cost_to_lengths[cost]:\n if x >= length:\n break\n total -= cost\n seek -= 1\n if seek == 0:\n break\n if seek == 0:\n break\n if best == -1 or total < best:\n best = total\n\nprint(best)\n", "\"\"\"\r\n\tAuthor\t\t: Arif Ahmad\r\n\tDate \t\t: \r\n\tAlgo \t\t: \r\n\tDifficulty\t: \r\n\"\"\"\r\nfrom sys import stdin, stdout\r\n\r\ndef main():\r\n\tn \t= int(stdin.readline())\r\n\tleg\t= [int(_) for _ in stdin.readline().split()]\r\n\td \t= [int(_) for _ in stdin.readline().split()]\r\n\r\n\tpairedLD = []\r\n\tfor x, y in zip(leg, d):\r\n\t\tpairedLD.append((x, y))\r\n\tpairedLD = sorted(pairedLD)\r\n\r\n\tlegSet \t\t= set()\r\n\tsuffixSum \t= dict()\r\n\tlegFreq\t\t= dict()\r\n\tfor length, energy in zip(leg, d):\r\n\t\tlegSet.add(length)\r\n\t\tif length in suffixSum: \r\n\t\t\tsuffixSum[length] += energy\r\n\t\t\tlegFreq[length] += 1\r\n\t\telse: \r\n\t\t\tsuffixSum[length] = energy\r\n\t\t\tlegFreq[length] = 1\r\n\t\t\r\n\r\n\tlegList = [x for x in legSet]\r\n\tlegList = sorted(legList, reverse=True)\r\n\ttotal \t= 0\r\n\tfor length in legList:\r\n\t\tsuffixSum[length] += total\r\n\t\ttotal = suffixSum[length]\r\n\r\n\tans = int(2e7)\r\n\ttoRemove = 0\r\n\tavailable = 0\r\n\tremovable = [0] * 201\r\n\tlegList = sorted(legList)\r\n\tlistLen = len(legList)\r\n\tidx = 0\r\n\tfor i in range(listLen):\r\n\t\tcurr = 0\r\n\t\tif i+1 < listLen: curr += suffixSum[legList[i+1]]\r\n\t\ttoRemove = available - (legFreq[legList[i]] - 1)\r\n\t\tif toRemove < 0: toRemove = 0\r\n\t\tfor j in range(1, 201):\r\n\t\t\tif removable[j] != 0 and removable[j] <= toRemove:\r\n\t\t\t\tcurr += (removable[j] * j)\r\n\t\t\t\ttoRemove -= removable[j]\r\n\t\t\telif removable[j] > toRemove:\r\n\t\t\t\tcurr += (toRemove * j)\r\n\t\t\t\ttoRemove = 0\r\n\t\t\tif toRemove == 0: break\r\n\t\tavailable += legFreq[legList[i]]\r\n\t\tfor j in range(legFreq[legList[i]]): \r\n\t\t\tremovable[pairedLD[idx][1]] += 1\r\n\t\t\tidx += 1\r\n\t\tans = min(ans, curr)\r\n\r\n\tprint(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n ", "#!/usr/bin/env python\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict\r\n\r\n\r\ndef main():\r\n INF = int(1e9)\r\n\r\n n = int(input())\r\n ll = list(map(int, input().split()))\r\n dd = list(map(int, input().split()))\r\n\r\n tab = list(zip(ll, dd))\r\n tab.sort()\r\n\r\n suml = [0] * (int(1e5) + 1)\r\n costl = [0] * (int(1e5) + 1)\r\n for l, d in tab:\r\n suml[l] += 1\r\n costl[l] += d\r\n\r\n for i in range(len(suml)):\r\n if i > 0:\r\n suml[i] += suml[i-1]\r\n costl[i] += costl[i-1]\r\n\r\n # USE THE FACT THAT d <= 200\r\n stack = [0] * 201\r\n\r\n ans = INF\r\n\r\n i = 0\r\n while i < n:\r\n l, d = tab[i]\r\n\r\n countl = suml[l] - suml[l-1]\r\n\r\n if countl > n / 2:\r\n ans = 0\r\n break\r\n\r\n greater = suml[-1] - suml[l]\r\n\r\n cur = costl[-1] - costl[l]\r\n\r\n if countl > (n - greater) / 2:\r\n ans = min(ans, cur)\r\n else:\r\n # you want to pick ml CHEAPEST legs that are < l\r\n ml = n - greater - (2 * countl - 1)\r\n pos = 0\r\n while pos <= 200 and ml > 0:\r\n if stack[pos] <= ml:\r\n cur += stack[pos] * pos\r\n ml -= stack[pos]\r\n else:\r\n cur += ml * pos\r\n ml = 0\r\n pos += 1\r\n\r\n\r\n ans = min(ans, cur)\r\n\r\n prev = i\r\n while i < n and tab[i][0] == l:\r\n stack[tab[i][1]] += 1\r\n i += 1\r\n #if i != prev:\r\n # i -= 1\r\n\r\n print(ans)\r\n\r\n # k cheapest legs < L\r\n # (l, d)\r\n # find k cheapest (over d) among l < L\r\n\r\n # like closest pair of points\r\n # you keep two arrays: sorted over d and l\r\n # you make a sweep over x's\r\n # and you add y's\r\n # this should enable to perform the needed computations\r\n\r\n\r\n\r\n\r\n\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._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()\r\n", "def main():\n _, dd, res = input(), {}, 0\n he = list(zip(map(int, input().split()), map(int, input().split())))\n for h, e in he:\n le, x = dd.get(h, (-1, 0))\n dd[h] = (le + 1, x + e)\n he.sort(key=lambda _: _[1], reverse=True)\n for h, (le, x) in dd.items():\n if le:\n for h1, e in he:\n if h1 < h:\n x += e\n le -= 1\n if not le:\n break\n if res < x:\n res = x\n print(sum(e for h, e in he) - res)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\narr = list(zip(a, b))\r\nd, res = {}, 0\r\nfor i, j in arr:\r\n f, x = d.get(i, (-1, 0))\r\n d[i] = (f + 1, x + j)\r\narr.sort(key = lambda x: x[1], reverse=True)\r\nfor it, (f, x) in d.items():\r\n if not f:\r\n \tres = max(x, res)\r\n \tcontinue\r\n for i, j in arr:\r\n if i < it:\r\n x += j\r\n f -= 1\r\n if not f: \r\n break\r\n res = max(x, res)\r\nprint(sum(j for i, j in arr) - res)\r\n", "f = lambda: map(int, input().split())\r\nn, p, m, s = input(), {}, 0, sorted(zip(f(), f()), key=lambda q: -q[1])\r\nfor L, d in s:\r\n k, D = p.get(L, (-1, 0))\r\n p[L] = (k + 1, D + d)\r\nfor L, (k, D) in p.items():\r\n if k:\r\n for l, d in s:\r\n if l < L:\r\n D += d\r\n k -= 1\r\n if k == 0: break\r\n m = max(D, m)\r\nprint(sum(d for l, d in s) - m)", "from collections import defaultdict,Counter,deque\nimport math\nimport bisect\nfrom itertools import accumulate, product\nfrom math import ceil, log,gcd\nfrom functools import lru_cache\nfrom sys import stdin, stdout\nimport time\nimport atexit\nimport io\nimport sys\nimport string\nimport heapq\n\nimport random\nimport bisect\n\ndef primes(n):\n if n<=2:\n return []\n sieve=[True]*(n+1)\n for x in range(3,int(n**0.5)+1,2):\n for y in range(3,(n//x)+1,2):\n sieve[(x*y)]=False\n \n return [2]+[i for i in range(3,n,2) if sieve[i]]\n\ndef write(*args, **kwargs):\n sep = kwargs.get('sep', ' ')\n end = kwargs.get('end', '\\n')\n stdout.write(sep.join(str(a) for a in args) + end)\n\ndef read():\n return stdin.readline().rstrip()\ndef primes_rwh(n):\n \"\"\" Returns a list of primes < n \"\"\"\n sieve = [True] * n\n for i in range(3,int(n**0.5)+1,2):\n if sieve[i]:\n sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)\n return [2] + [i for i in range(3,n,2) if sieve[i]]\ndef prime_factors(n):\n i = 2\n factors = []\n d = defaultdict(lambda:0)\n for i in primes_rwh(int(n**0.5+1)):\n while n % i == 0:\n n //= i\n factors.append(i)\n d[i]+=1\n if n > 1:\n factors.append(n)\n d[n]+=1\n return factors,d\n\n\n \ndef egcd(a, b):\n if a == 0:\n return (b, 0, 1)\n else:\n g, y, x = egcd(b % a, a)\n return (g, x - (b // a) * y, y)\n\ndef modinv(a, m):\n g, x, y = egcd(a, m)\n if g != 1:\n raise Exception('modular inverse does not exist')\n else:\n return x % m\n \ndef lcm(x, y):\n lcm = (x*y)//math.gcd(x,y)\n return lcm \n \n \n# total= int(read())\n\n# import random\n\n# class ListDict(object):\n# def __init__(self):\n# self.item_to_position = {}\n# self.items = []\n\n# def add_item(self, item):\n# if item in self.item_to_position:\n# return\n# self.items.append(item)\n# self.item_to_position[item] = len(self.items)-1\n\n# def remove_item(self, item):\n# if item in self.item_to_position:\n# position = self.item_to_position.pop(item)\n# last_item = self.items.pop()\n# if position != len(self.items):\n# self.items[position] = last_item\n# self.item_to_position[last_item] = position\n\n# def choose_random_item(self):\n# return random.choice(self.items)\n\n\n# for _ in range(total):\n# n,k = [int(p) for p in read().split()]\n \n \n# e = [set() for i in range(n)]\n# for _ in range(k):\n# i,j = [int(p)-1 for p in read().split()]\n# e[i].add(j)\n# e[j].add(i)\n \n# mx = [0] \n# sx = [0] \n# x = []\n# for _ in range(300):\n# s = ListDict()\n# for i in range(n):\n# s.add_item(i)\n# r = 0\n# cnt = 0\n# ret = []\n# while s.items:\n# tr = s.choose_random_item()\n# r+=1\n# cnt +=1\n# s.remove_item(tr) \n# ret.append(tr+1)\n# for j in e[tr]:\n# s.remove_item(j)\n# r+=1\n \n# if cnt > mx[0]:\n# mx[0]= cnt\n# x = ret\n \n# write(mx[0])\n# write(*sorted(x)) \ndef prime_factors_s(n):\n i = 2\n factors =set()\n d = defaultdict(lambda:0)\n for i in primes_rwh(int(n**0.5+1)):\n while n % i == 0:\n n //= i\n factors.add(i)\n if n > 1:\n factors.add(n)\n return factors\n \nfrom bisect import bisect_right \n\n\ndef pollard_rho(n):\n \"\"\"returns a random factor of n\"\"\"\n if n & 1 == 0:\n return 2\n if n % 3 == 0:\n return 3\n \n s = ((n - 1) & (1 - n)).bit_length() - 1\n d = n >> s\n for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:\n p = pow(a, d, n)\n if p == 1 or p == n - 1 or a % n == 0:\n continue\n for _ in range(s):\n prev = p\n p = (p * p) % n\n if p == 1:\n return math.gcd(prev - 1, n)\n if p == n - 1:\n break\n else:\n for i in range(2, n):\n x, y = i, (i * i + 1) % n\n f = math.gcd(abs(x - y), n)\n while f == 1:\n x, y = (x * x + 1) % n, (y * y + 1) % n\n y = (y * y + 1) % n\n f = math.gcd(abs(x - y), n)\n if f != n:\n return f\n return n \n\ndef memodict(f):\n \"\"\"memoization decorator for a function taking a single argument\"\"\"\n class memodict(dict):\n def __missing__(self, key):\n ret = self[key] = f(key)\n return ret\n \n return memodict().__getitem__\n\n@memodict\ndef prime_factors_r(n):\n \"\"\"returns a Counter of the prime factorization of n\"\"\"\n if n <= 1:\n return Counter()\n f = pollard_rho(n)\n return Counter([n]) if f == n else prime_factors_r(f) + prime_factors_r(n // f)\n\ndef multiply(a, b):\n \n # Creating an auxiliary matrix\n # to store elements of the\n # multiplication matrix\n mul = [[0 for x in range(2)]\n for y in range(2)];\n for i in range(2):\n for j in range(2):\n for k in range(2):\n mul[i][j] += a[i][k] * b[k][j];\n mul[i][j] %= (10**9+7 ) \n return mul\n \n\ndef power(F, n):\n # print(n)\n # Multiply it with initial values i.e\n # with F(0) = 0, F(1) = 1, F(2) = 1\n if (n == 1):\n return F\n \n F_ = power(F, int(n // 2));\n \n F_ = multiply(F_, F_);\n \n if (n % 2 != 0):\n F_ = multiply(F_, F);\n \n # Multiply it with initial values i.e\n # with F(0) = 0, F(1) = 1, F(2) = 1\n return F_ ;\n\n\nfrom bisect import bisect_left as lower_bound\nfrom bisect import bisect_right as upper_bound\n\n\nclass FenwickTree:\n def __init__(self, x):\n bit = self.bit = list(x)\n size = self.size = len(bit)\n for i in range(size):\n j = i | (i + 1)\n if j < size:\n bit[j] += bit[i]\n\n def update(self, idx, x):\n \"\"\"updates bit[idx] += x\"\"\"\n while idx < self.size:\n self.bit[idx] += x\n idx |= idx + 1\n\n def __call__(self, end):\n \"\"\"calc sum(bit[:end])\"\"\"\n x = 0\n while end:\n x += self.bit[end - 1]\n end &= end - 1\n return x\n\n def find_kth(self, k):\n \"\"\"Find largest idx such that sum(bit[:idx]) <= k\"\"\"\n idx = -1\n for d in reversed(range(self.size.bit_length())):\n right_idx = idx + (1 << d)\n if right_idx < self.size and self.bit[right_idx] <= k:\n idx = right_idx\n k -= self.bit[idx]\n return idx + 1, k\n\n\nclass SortedList:\n block_size = 700\n\n def __init__(self, iterable=()):\n self.macro = []\n self.micros = [[]]\n self.micro_size = [0]\n self.fenwick = FenwickTree([0])\n self.size = 0\n for item in iterable:\n self.insert(item)\n\n def insert(self, x):\n i = lower_bound(self.macro, x)\n j = upper_bound(self.micros[i], x)\n self.micros[i].insert(j, x)\n self.size += 1\n self.micro_size[i] += 1\n self.fenwick.update(i, 1)\n if len(self.micros[i]) >= self.block_size:\n self.micros[i:i + 1] = self.micros[i][:self.block_size >> 1], self.micros[i][self.block_size >> 1:]\n self.micro_size[i:i + 1] = self.block_size >> 1, self.block_size >> 1\n self.fenwick = FenwickTree(self.micro_size)\n self.macro.insert(i, self.micros[i + 1][0])\n\n def pop(self, k=-1):\n i, j = self._find_kth(k)\n self.size -= 1\n self.micro_size[i] -= 1\n self.fenwick.update(i, -1)\n return self.micros[i].pop(j)\n\n def __getitem__(self, k):\n i, j = self._find_kth(k)\n return self.micros[i][j]\n\n def count(self, x):\n return self.upper_bound(x) - self.lower_bound(x)\n\n def __contains__(self, x):\n return self.count(x) > 0\n\n def lower_bound(self, x):\n i = lower_bound(self.macro, x)\n return self.fenwick(i) + lower_bound(self.micros[i], x)\n\n def upper_bound(self, x):\n i = upper_bound(self.macro, x)\n return self.fenwick(i) + upper_bound(self.micros[i], x)\n\n def _find_kth(self, k):\n return self.fenwick.find_kth(k + self.size if k < 0 else k)\n\n def __len__(self):\n return self.size\n\n def __iter__(self):\n return (x for micro in self.micros for x in micro)\n\n def __repr__(self):\n return str(list(self))\ndef calc_primes(n):\n return [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,\n 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173,\n 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281,\n 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,\n 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541,\n 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659,\n 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,\n 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941,\n 947, 953, 967, 971, 977, 983, 991, 997]\n\ndef factorize(n, primes):\n factorization = set()\n for d in primes:\n if d * d > n:\n break\n while n % d == 0:\n factorization.add(d)\n n //= d\n if n > 1:\n factorization.add(n)\n return list(factorization)\n\n\nn = int(read())\nl = [*map(int , read().split(' '))]\nd = [*map(int , read().split(' '))]\n\n# n = 6\n# l = [2, 2, 1, 1, 3, 3]\n# d = [4, 3, 5, 5, 2, 1]\n\ncl = Counter(l)\n\n\nx = [i*2**32 + j for i,j in zip(l,d)]\n\ncur = [0]*201\n\ns = 0\nms = 10**18\n\nx = sorted(x)\nj = 0\n\nz = []\ncc = 0\nfor i in range(n):\n z.append(cc)\n cc+= x[n-1-i]%2**32\n\nz.append(cc)\nz = z[::-1]\n\nfor i in range(1,n): \n if (x[i] >> 32) != (x[i-1] >> 32):\n # print(i)\n while (x[j]>>32) != (x[i-1] >> 32):\n cur[(x[j] % 2**32)] +=1\n j+=1\n total = i \n to_r = total - 2 * cl[x[i-1]//2**32] + 1\n to_r = max(to_r,0)\n co = z[i] \n for t in range(201):\n tt= min(cur[t], to_r)\n to_r -=tt\n co+=t * tt\n if to_r ==0:\n break\n ms= min(co,ms)\n\ni=n\nwhile (x[j]>>32) != (x[i-1] >> 32):\n cur[(x[j] % 2**32)] +=1\n j+=1\ntotal = i \nto_r = total - 2 * cl[x[i-1]//2**32] + 1\nto_r = max(to_r,0)\nco = z[i] \nfor t in range(201):\n tt= min(cur[t], to_r)\n to_r -=tt\n co+=t * tt\n if to_r ==0:\n break\nms= min(co,ms)\n \n \n \n \n \n \nprint(ms) \n\n\n \n\n# if n ==25:\n# for i in range(8,25):\n# print(*w[i][i+1:])\n\n# 25 3\n# 22 4 4\n# 55 61 59 55 62 7 23 10 27 55 40 11 65 43 38 37 35 62 16 26 66 52 2 59\n# 30 55 5 6 31 65 18 50 32 34 55 28 55 17 5 37 14 60 3 3 66 46 4\n# 32 5 52 7 42 42 3 22 60 50 64 19 23 48 19 10 7 8 26 60 19 50\n# 9 8 96 56 90 8 13 96 78 36 44 71 92 57 70 75 31 77 62 78 23\n# 24 59 23 23 92 85 61 23 6 93 93 88 59 23 8 63 45 75 79 16\n# 77 97 41 23 11 84 57 97 81 61 90 24 65 7 38 32 24 68 66\n# 50 43 31 40 70 97 79 62 26 21 60 79 42 69 83 93 63 75\n# 94 93 83 65 82 70 88 65 92 34 87 80 77 14 76 85 97\n# 97 49 42 91 81 8 3 34 77 76 40 7 95 20 23 95\n# 14 71 50 50 21 97 4 79 34 91 52 29 13 65 53\n# 19 5 20 76 75 67 75 62 72 38 28 60 66 55\n# 10 31 24 70 82 46 88 53 65 80 39 63 9\n# 49 26 65 48 63 76 10 76 38 78 38 15\n# 86 57 30 36 46 94 74 79 48 58 92\n# 22 41 15 26 58 36 27 66 40 19\n# 29 32 91 37 82 72 77 45 58\n# 91 37 35 22 91 78 40 24\n# 68 21 54 81 93 89 2\n# 50 15 3 44 36 31\n# 40 87 18 73 22\n# 50 41 60 72\n# 18 14 75\n# 93 4\n# 40\n\n\n#%%\n# n,k = 10,5\n# d = [5,4,3,2,1]\n\n# w = [[0, 29, 49, 33, 12, 55, 15, 32, 62, 37], [29, 0, 61, 26, 15, 58, 15, 22, 8, 58], [49, 61, 0, 37, 16, 9, 39, 20, 14, 58], [33, 26, 37, 0, 10, 15, 40, 3, 19, 55], [12, 15, 16, 10, 0, 53, 13, 37, 44, 52], [55, 58, 9, 15, 53, 0, 23, 59, 58, 4], [15, 15, 39, 40, 13, 23, 0, 69, 80, 29], [32, 22, 20, 3, 37, 59, 69, 0, 89, 28], [62, 8, 14, 19, 44, 58, 80, 89, 0, 48], [37, 58, 58, 55, 52, 4, 29, 28, 48, 0]]\n\n\n\n# n,k = 5, 2\n# d = [1, 4]\n# w = [[0, 48, 20, 68, 57], [48, 0, 63, 68, 19], [20, 63, 0, 7, 31], [68, 68, 7, 0, 31], [57, 19, 31, 31, 0]]\n\n\n# n,k = 7,5\n# d =[3 ,1, 3, 1, 2]\n# w=[[0, 8, 34, 17, 53, 24, 57], [8, 0, 7, 32, 48, 85, 41], [34, 7, 0, 74, 77, 76, 65], [17, 32, 74, 0, 28, 95, 63], [53, 48, 77, 28, 0, 82, 40], [24, 85, 76, 95, 82, 0, 69], [57, 41, 65, 63, 40, 69, 0]]\n# n,k = 6,5\n# d = [1,2,2,2,2]\n# w= [[0, 10, 99, 99, 99, 11], [10, 0, 10, 99, 99, 11], [99, 10, 0, 10, 99, 11], [99, 99, 10, 0, 10, 11], [99, 99, 99, 10, 0, 11], [11, 11, 11, 11, 11, 0]]\n\n# n,k = 5,1\n# d = [3]\n# w = [[0, 67, 62, 64, 5], [67, 0, 45, 84, 10], [62, 45, 0, 60, 64], [64, 84, 60, 0, 29], [5, 10, 64, 29, 0]]\n\n\n# r = n-2\n# p = []\n# q = []\n\n# e = [set() for i in range(n)]\n\n\n# for i in range(n):\n# if i != r:\n# p.append(i)\n# q.append(r)\n# e[i].add(r)\n# e[r].add(i)\n\n# # for i in range(n-1):\n# # e[n-1].add(i)\n# # e[i].add(n-1)\n\n\n# deg = [1]*n\n# deg[r] = n-1\n\n# while len(d) < n:\n# d +=[1000]\n# curr = 0\n# curr_cnt = 0\n\n# def obj(p,q):\n# return sum(w[i][j] for i,j in zip(p,q))\n\n# c_eval = obj(p,q)\n\n# # print(d)\n# # 1/0\n\n# z = [0] * 25\n# def mod(p,q):\n \n# # p,q = [1, 1, 2, 3], [0, 4, 4, 4]\n \n# # deg = [1, 2, 1, 1, 3]\n# i = random.randint(0,10**12) % (n-1)\n# # i=3\n \n# z[i]+=1\n \n# # deg[p[i]]-=1\n# # deg[q[i]]-=1\n \n# pa = [*range(n)]\n \n# def find(x):\n# while pa[x] != pa[pa[x]]:\n# pa[x] = find(pa[x])\n# return pa[x] \n# def merge(x,y):\n# if find(x) != find(y):\n# pa[find(x)] = pa[find(y)]\n \n \n \n# for j in range(n-1):\n# if j!=i:\n# merge(p[j],q[j])\n# deg[p[j]] +=1\n# deg[q[j]] +=1\n \n# while True:\n# i0 =random.randint(0,10**12) % n\n# i1 = random.randint(0,10**12) % n\n \n# if deg[i0] < d[i0] and deg[i1] < d[i1] and find(i1)!= find(i0):\n# break\n# deg[i0] +=1\n# deg[i1] +=1\n# p[i] = i0\n# q[i] = i1 \n# # print(deg)\n \n# return p,q\n \n\n# print(deg)\n\n# # p = [1,24,21,0,15,20,8,4,7,1,0,22,2,9,3,5,1,2,4,12,19,20,17,9]\n# # q = [24,11,18,23,8,1,14,2,21,21,6,24,6,2,5,19,4,19,13,10,12,8,24,16]\n# print(obj(p,q))\n# # 1/0\n\n# iterations = 1700000\n\n\n# initial_temp = 1000000\n\n# p_best,q_best = p,q\n# best_eval = obj(p,q)\n# curr_eval = best_eval\n# t = initial_temp\n# cnt =1 \n# for i in range(iterations ):\n# # print(i)\n# cnt+=1 \n \n# deg = [0]*(n)\n \n# pc,qc = mod(p,q) \n# #print('---')\n# #print(x,y,xc,yc)\n# c_eval = obj(pc,qc)\n# best_eval = min(best_eval,c_eval )\n# # print(pc,qc,c_eval,curr_eval)\n# # print(pc,qc,c_eval)\n# diff = c_eval - curr_eval\n# # calculate temperature for current epoch\n# t = initial_temp /cnt\n# # calculate metropolis acceptance criterion\n# if diff < 0:\n# p,q = pc,qc\n \n# curr_eval = c_eval\n# print(i,deg,curr_eval)\n# # print(z)\n# else :\n# metropolis = math.exp((-diff) / t)\n# # print(diff,metropolis)\n# # check if we should keep the new point\n# if random.random() < metropolis:\n# # store the new current point\n# p,q = pc,qc\n# curr_eval = c_eval\n# best_eval = min(best_eval,c_eval )\n# print(i,t,deg,p,q,curr_eval,c_eval, diff, metropolis)\n# # print(z)\n# print(p,q,deg) \n# print(best_eval) \n# print(w)\n\n# def helper(s):\n# t = []\n# if s == \"\":\n# return []\n# for i in range(1,len(s)+1):\n# if s[:i]==s[:i][::-1]:\n# t += [s[:i]] + helper(s[i:])\n# return t \n\n# p = [0, 0, 5, 9, 6, 1, 9, 6, 2, 2]\n# c = Counter(p[1:])\n# mod(p, c)", "from collections import defaultdict\n\n\ndef main():\n n = int(input())\n hh = list(map(int, input().split()))\n ee = list(map(int, input().split()))\n dd = defaultdict(set)\n for i, h in enumerate(hh):\n dd[h].add(i)\n idx = sorted(range(n), key=ee.__getitem__, reverse=True)\n res = 0\n for h, s in dd.items():\n x = sum(ee[i] for i in s)\n le = len(s) - 1\n if le:\n for i in idx:\n if hh[i] < h and i not in s:\n x += ee[i]\n le -= 1\n if not le:\n break\n if res < x:\n res = x\n print(sum(ee) - res)\n\n\nif __name__ == '__main__':\n main()\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\nM=10**5+1\r\ndef main():\r\n n=ri()\r\n l,d=rl(),rl()\r\n cnt=[0]*M\r\n eng=[0]*M\r\n sfcnt=[0]*M\r\n sfeng=[0]*M\r\n ld=[[] for i in range(M)]\r\n cntd=[0]*201\r\n for i in range(len(l)):\r\n cnt[l[i]]+=1\r\n eng[l[i]]+=d[i]\r\n ld[l[i]].append(d[i])\r\n for i in range(M-2,-1,-1): sfeng[i]=sfeng[i+1]+eng[i+1]\r\n for i in range(M-2,-1,-1): sfcnt[i]=sfcnt[i+1]+cnt[i+1]\r\n ans=10**8\r\n for i in range(1,M):\r\n if cnt[i]==0: continue\r\n if n-sfcnt[i]<2*cnt[i]:\r\n ans=min(ans,sfeng[i])\r\n else:\r\n c=n-sfcnt[i]\r\n ce=sfeng[i]\r\n for j in range(1,201):\r\n if c-cntd[j]<2*cnt[i]:\r\n ce+=(c-(2*cnt[i]-1))*j;break\r\n else:\r\n ce+=cntd[j]*j\r\n c-=cntd[j] \r\n ans=min(ans,ce)\r\n for j in ld[i]:\r\n cntd[j]+=1\r\n return ans\r\n\r\n \r\nprint(main())", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef make_graph(n, m):\r\n x, s = [0] * (2 * m), [0] * (n + 3)\r\n for i in range(0, 2 * m, 2):\r\n u, v = l[i >> 1], d[i >> 1]\r\n s[u + 2] += 1\r\n x[i], x[i + 1] = u, v\r\n for i in range(3, n + 3):\r\n s[i] += s[i - 1]\r\n G = [0] * m\r\n for i in range(0, 2 * m, 2):\r\n j = x[i] + 1\r\n G[s[j]] = x[i ^ 1]\r\n s[j] += 1\r\n return G, s\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nm = pow(10, 5) + 5\r\nx, s = make_graph(m, n)\r\nu = sum(d)\r\nl0 = 205\r\ncnt = [0] * l0\r\ninf = pow(10, 9) + 1\r\nans = inf\r\nfor i in range(1, m):\r\n if s[i] == s[i + 1]:\r\n continue\r\n c = s[i + 1] - s[i] - 1\r\n v = u\r\n for j in range(l0 - 1, -1, -1):\r\n if not c:\r\n break\r\n c0 = min(c, cnt[j])\r\n c -= c0\r\n v -= c0 * j\r\n for j in range(s[i], s[i + 1]):\r\n c = x[j]\r\n cnt[c] += 1\r\n v -= c\r\n ans = min(ans, v)\r\nprint(ans)", "n = int(input())\nleng = list(map(int, input().split()))\nenergy = list(map(int, input().split()))\nsum = 0\nlenSum = {}\nlenCount = {}\ncustos = {}\n \nfor i in range(n):\n length, custo = leng[i], energy[i]\n sum += custo\n lenSum[length] = lenSum.setdefault(length, 0) + custo\n lenCount[length] = lenCount.setdefault(length, 0) + 1\n custos.setdefault(custo, []).append(length)\n \nconjuntoLen = set(leng)\nfor leng in custos.values():\n leng.sort()\nlistaEnergia = list(reversed(sorted(custos.keys())))\nans = -1\n \nfor length in conjuntoLen:\n total = sum - lenSum[length]\n find = lenCount[length] - 1\n if find != 0:\n for custo in listaEnergia:\n for x in custos[custo]:\n if x >= length:\n break\n total -= custo\n find -= 1\n if find == 0:\n break\n if find == 0:\n break\n if ans == -1 or total < ans:\n ans = total\n \nprint(ans)\n \t \t \t \t\t\t\t\t \t\t \t\t\t \t \t \t", "f = lambda: map(int, input().split())\r\nk, n = 1, f()\r\ns = sorted(zip(f(), f()), key=lambda q: q[0])\r\n\r\nt = [0] * 201\r\nfor l, d in s: t[d] += 1\r\n\r\nj = [i for i in range(201) if t[i]]\r\nj.reverse()\r\n\r\nS = sum(i * t[i] for i in j)\r\nL, D = s.pop()\r\nt[D] -= 1\r\ns.reverse()\r\ns.append((0, 0))\r\n\r\nm = 0\r\nfor l, d in s:\r\n if l < L:\r\n L = l\r\n for i in j:\r\n if t[i] > k - 2:\r\n D += i * (k - 1)\r\n break\r\n D += i * t[i]\r\n k -= t[i]\r\n m = max(m, D)\r\n k = D = 0\r\n k += 1\r\n D += d\r\n \r\n t[d] -= 1\r\n if not t[d]: j.remove(d)\r\n \r\nprint(S - m)", "I=lambda: map(int,input().split())\r\n\r\n\r\nn=int(input())\r\nln=I()\r\ntime=I()\r\npack=zip(ln,time)\r\npack=sorted(pack, key=lambda x: -x[1])\r\ndt={}\r\nans=0\r\ns=0\r\nfor l,d in pack:\r\n s+=d\r\n key,energy=dt.get(l,(-1,0))\r\n dt[l]=(key+1,energy+d)\r\n \r\n\r\nfor length,(key,val) in dt.items():\r\n \r\n if key:\r\n for L,d in pack:\r\n if L<length:\r\n val+=d\r\n key-=1\r\n if key==0:\r\n break\r\n ans=max(ans,val)\r\nprint(s-ans)\r\n\r\n \r\n", "MAX_D = 201\n\nn = int(input())\nl = list(map(int, input().split()))\nd = list(map(int, input().split()))\nlegs = sorted(list(zip(l, d)))\n\nd_suffix = [legs[0][1]]\nfor i in range(1, n):\n d_suffix.append(d_suffix[-1] + legs[i][1])\n\nans = d_suffix[-1]\ncnt = {}\nleft = 0\nright = 0\nwhile left < n:\n while right < n and legs[left][0] == legs[right][0]:\n right += 1\n\n to_remove = left - (right - left - 1)\n curr_d = d_suffix[-1] - d_suffix[right - 1]\n for i in range(1, MAX_D):\n if to_remove <= 0:\n break\n used = min(to_remove, cnt.get(i, 0))\n to_remove -= used\n curr_d += used * i\n\n ans = min(ans, curr_d)\n while left < right:\n cnt[legs[left][1]] = cnt.get(legs[left][1], 0) + 1\n left += 1\n\nprint(ans)\n", "# ------------------- fast io --------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# ------------------- fast io --------------------\r\nfrom math import gcd, ceil\r\n\r\ndef prod(a, mod=10**9+7):\r\n ans = 1\r\n for each in a:\r\n ans = (ans * each) % mod\r\n return ans\r\n\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\ndef binary(x, length=16):\r\n y = bin(x)[2:]\r\n return y if len(y) >= length else \"0\" * (length - len(y)) + y\r\n\r\nfor _ in range(int(input()) if not True else 1):\r\n n = int(input())\r\n #n, k = map(int, input().split())\r\n #a, b = map(int, input().split())\r\n #c, d = map(int, input().split())\r\n l = list(map(int, input().split()))\r\n d = list(map(int, input().split()))\r\n di = {}\r\n d2 = {}\r\n for i in range(n):\r\n if l[i] not in di:\r\n di[l[i]] = 0\r\n d2[l[i]] = []\r\n di[l[i]] += d[i]\r\n d2[l[i]] += [d[i]]\r\n\r\n sa = sorted(list(set(l)))\r\n suf = [0]\r\n sufrem = [0]\r\n for i in range(len(sa)-1, -1, -1):\r\n suf += [suf[-1] + di[sa[i]]]\r\n sufrem += [sufrem[-1] + len(d2[sa[i]])]\r\n ans = 10**18\r\n count = [0]*(10**5 + 69)\r\n oof = [0]*500\r\n for i in l:count[i] += 1\r\n bi = len(sa) - 1\r\n for each in sa:\r\n cnt = count[each]\r\n removable = max(0, n-sufrem[bi]-2*cnt+1)\r\n total = suf[bi]\r\n #print(total, sufrem[bi])\r\n bi-=1\r\n for i in range(500):\r\n mi = min(removable, oof[i])\r\n removable -= mi\r\n total += i * mi\r\n if not removable:break\r\n ans = min(ans, total)\r\n for x in d2[each]:\r\n oof[x] += 1\r\n print(ans)\r\n" ]

[ "def maximum_xor_secondary(sequence):\n stack, answer = [], 0\n for x in sequence:\n while stack:\n answer = max(answer, stack[-1] ^ x)\n if stack[-1] > x:\n break\n else:\n stack.pop()\n stack.append(x)\n\n return answer\n\n\nsize, num = input(), [int(x) for x in input().split()]\n\n\nprint(maximum_xor_secondary(num))\n\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\nnl = [int(x) for x in input().split()]\nst = []\nans = 0\nfor x in nl:\n if st and st[-1] > x:\n ans = max(ans, st[-1]^x)\n elif st:\n while st and st[-1] < x:\n ans = max(ans, st.pop()^x)\n if st:\n ans = max(ans, st[-1]^x)\n st.append(x)\nprint(ans)\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nb = []\r\nfor i in a:\r\n while len(b) > 0:\r\n if b[-1] < i:\r\n ans = max(ans,i^b[-1])\r\n b.pop()\r\n else:\r\n ans = max(ans,i^b[-1])\r\n break\r\n b.append(i)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nstack = []\r\nres = 0\r\nfor i, v in enumerate(a):\r\n while stack and stack[-1] < v:\r\n res = max(res, stack.pop() ^ v)\r\n if stack:\r\n res = max(res, stack[-1] ^ v)\r\n stack.append(v)\r\n\r\nprint(res)", "import collections\r\nimport os\r\nimport sys\r\nfrom collections import Counter\r\n\r\n# print(sys.hexversion)\r\n# if os.getenv('LOCALCFTEST'):\r\n# sys.stdin = open('cfinput.txt')\r\n# else:\r\n# input = sys.stdin.readline\r\nfrom itertools import product\r\n\r\nif sys.hexversion == 50924784:\r\n sys.stdin = open('cfinput.txt')\r\nelse:\r\n input = sys.stdin.readline\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\ndef solve(n, s):\r\n left = [-1] * n\r\n stack = []\r\n for i, v in enumerate(s):\r\n while stack and s[stack[-1]] < v:\r\n stack.pop()\r\n if stack:\r\n left[i] = stack[-1]\r\n stack.append(i)\r\n right = [n] * n\r\n stack = []\r\n for i in range(n - 1, -1, -1):\r\n v = s[i]\r\n while stack and s[stack[-1]] < v:\r\n stack.pop()\r\n if stack:\r\n right[i] = stack[-1]\r\n stack.append(i)\r\n\r\n ans = 0\r\n for v,l, r in zip(s,left, right):\r\n if l > 0:\r\n ans = max(ans,v^s[l])\r\n if r < n:\r\n ans = max(ans,v^s[r])\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = list(map(int, input().split()))\r\n solve(n, s)\r\n", "if __name__=='__main__':\r\n n=n=int(input())\r\n nums=list(map(int,input().split()))\r\n res,stack=0,[]\r\n for n in nums:\r\n while stack and stack[-1]<n:\r\n res=max(res,n^stack.pop())\r\n if len(stack)>0:\r\n res=max(res,n^stack[-1])\r\n stack.append(n)\r\n print(res)", "# t = int(input())\r\n# for _ in range(t):\r\n# s = input()\r\n# mini = 0\r\n# maxi = 0\r\n# good = True\r\n# for c in s:\r\n# if c == '(':\r\n# mini += 1\r\n# maxi += 1\r\n# elif c == ')':\r\n# mini -= 1\r\n# maxi -= 1\r\n# else:\r\n# mini -= 1\r\n# maxi += 1\r\n# if maxi < 0:\r\n# good = False\r\n# break\r\n# while mini < 0:\r\n# mini += 2\r\n# print(\"YES\" if good and maxi <= 2 else \"NO\")\r\n # n = int(input())\r\n # arr = list(map(int,input().split()))\r\n # st = set()\r\n # while n:\r\n # st.add(n)\r\n # n = arr[n-1]\r\n # print(\"YES\" if len(st) == 3 else \"NO\")\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nans = -1\r\nstk = []\r\nfor i in range(n):\r\n v = a[i]\r\n while stk and stk[-1] < v:\r\n w = stk.pop()\r\n ans = max(ans, v^w)\r\n # if not stk or stk[-1] < v\r\n if stk:\r\n ans = max(ans, v^stk[-1])\r\n stk.append(v)\r\n# print(stk, ans)\r\nprint(ans)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: Jalpaiguri Govt Enggineering College\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('a')\r\n\r\n\r\n\r\ndef solve():\r\n \r\n \r\n n=ii()\r\n a=li()\r\n b=[]\r\n for j in range(31,-1,-1):\r\n for i in range(n):\r\n if (a[i]>>j)&1:\r\n b.append(i)\r\n if(len(b)<n and len(b)>0):\r\n break\r\n b=[]\r\n \r\n \r\n \r\n if len(b)==n or len(b)==0:\r\n print(0)\r\n exit(0)\r\n \r\n ans=0\r\n x=0\r\n \r\n for j in range(len(b)-1):\r\n \r\n mx=0\r\n x1=a[b[j]]\r\n for i in range(b[j]-1,x-1,-1):\r\n mx=max(mx,a[i])\r\n ans=max(ans,x1^mx)\r\n mx=0\r\n for i in range(b[j]+1,b[j+1]):\r\n mx=max(mx,a[i])\r\n ans=max(ans,x1^mx)\r\n x=b[j]+1\r\n \r\n \r\n \r\n mx=0\r\n x1=a[b[len(b)-1]]\r\n for i in range(b[len(b)-1]-1,x-1,-1):\r\n mx=max(mx,a[i])\r\n ans=max(ans,x1^mx)\r\n \r\n mx=0\r\n for i in range(b[len(b)-1]+1,n):\r\n mx=max(mx,a[i])\r\n ans=max(ans,x1^mx)\r\n \r\n print(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nif __name__ ==\"__main__\":\r\n \r\n solve()\r\n \r\n", "def mp():\r\n return map(int, input().split())\r\n\r\nn = input()\r\na = [*mp()]\r\ns = []\r\nz = 0\r\nfor i in a:\r\n while s:\r\n x = s[-1]\r\n z = max(z, x ^ i)\r\n if x > i:\r\n break\r\n s.pop()\r\n s.append(i)\r\nprint(z)", "def xor(a, b) :\r\n return a ^ b\r\n \r\ndef maximum_xor_secondary(list):\r\n result = xor(list[0], list[1])\r\n stack = [list[0], list[1]]\r\n \r\n for i in range(2, n):\r\n while len(stack) > 0 and stack[-1] < list[i]:\r\n stack.pop()\r\n stack.append(list[i])\r\n if len(stack) >= 2:\r\n result = max(result, xor(stack[-1], stack[-2]))\r\n return result\r\n \r\nn = int(input())\r\ninput = list(map(int, input().split())) \r\n \r\nresult = maximum_xor_secondary(input)\r\n \r\ninput.reverse()\r\n \r\nresult = max(result, maximum_xor_secondary(input))\r\n \r\nprint(result)", "def xor(a, b):\r\n return a ^ b\r\n\r\ndef solve(l):\r\n ans = xor(l[0], l[1])\r\n st = [l[0], l[1]]\r\n\r\n for i in range(2, n):\r\n while len(st) > 0 and st[-1] < l[i]:\r\n st.pop()\r\n st.append(l[i])\r\n if len(st) >= 2:\r\n ans = max(ans, xor(st[-1], st[-2]))\r\n return ans\r\n\r\nn = int(input())\r\nl = input()\r\nl = [int(i) for i in l.split()]\r\n\r\n\r\nans = solve(l)\r\n\r\nl.reverse()\r\n\r\nans = max(ans, solve(l))\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nans = 0\r\nst = []\r\n\r\n# every v can be the second max, max on left or right\r\nfor v in s:\r\n # decreasing stack\r\n # st[-1] second max, v max(max on right)\r\n while st and st[-1] < v:\r\n ans = max(st.pop() ^ v, ans)\r\n # v second max, st[-1] max(max on left)\r\n if st:\r\n ans = max(st[-1] ^ v, ans)\r\n st.append(v)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "import sys\r\n\r\n\r\ndef solver(nums):\r\n st = [float('inf')]\r\n res = nums[0]^nums[1]\r\n for i, num in enumerate(nums):\r\n while num>st[-1]:\r\n cur = st.pop()\r\n if len(st)>1:\r\n res = max([res, cur^st[-1], cur^num])\r\n else:\r\n res = max(res, cur^num)\r\n break\r\n st.append(num)\r\n while len(st)>2:\r\n cur = st.pop()\r\n res = max(res, cur^st[-1])\r\n return res\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(sys.stdin.readline().strip('/n').split()[0])\r\n nums = sys.stdin.readline().strip('/n').split()\r\n nums = list(map(int, nums))\r\n print(solver(nums))", "n = int(input())\r\nAr = [int(x)for x in input().split()]\r\nstack = []\r\nans = 0\r\nfor i in range(0,n):\r\n while(len(stack)!=0):\r\n if(stack[-1]<Ar[i]):\r\n ans = max(ans,stack[-1]^Ar[i])\r\n stack.pop()\r\n else:\r\n ans = max(ans,stack[-1]^Ar[i])\r\n break\r\n stack.append(Ar[i])\r\nprint(ans)\r\n", "import heapq;\r\nimport math;\r\nfrom collections import deque, Counter;\r\nimport sys;\r\n\r\nmod = 998244353;\r\ninput = sys.stdin.readline;\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\narray = list(map(int, input().split()))\r\n\r\n\r\n\r\nstack = []\r\n\r\n\r\nans = 0;\r\n\r\n\r\nfor num in array:\r\n while stack:\r\n ans = max(ans, num ^ stack[-1])\r\n if stack[-1] < num:\r\n stack.pop()\r\n else:\r\n break;\r\n\r\n stack.append(num)\r\n\r\n\r\nprint(ans)", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[5]:\n\n\nfrom collections import deque\n\nstack=deque()\nn=int(input())\na=list(map(int,input().split()))\nres1=0\nl=0\n\nfor i in a:\n while stack and stack[-1]<i:\n stack.pop()\n l-=1\n \n stack.append(i)\n l+=1\n \n if l>1:\n res1=max(res1,stack[-1]^stack[-2])\n \n \nstack.clear()\nl=0\nres2=0\na.reverse()\n\nfor i in a:\n while stack and stack[-1]<i:\n stack.pop()\n l-=1\n \n stack.append(i)\n l+=1\n \n if l>1:\n res2=max(res2,stack[-1]^stack[-2])\n \n\n \nprint(max(res1,res2))\n\n\n# In[ ]:\n\n\n\n\n", "def fun(numbers):\r\n # numbers.sort(reverse=True)\r\n le = len(numbers)\r\n stack =[]\r\n ans=0\r\n i=1\r\n for i in numbers:\r\n while stack:\r\n ans = max(ans,stack[-1]^i)\r\n if stack[-1] > i:\r\n break\r\n else:\r\n stack.pop()\r\n stack.append(i)\r\n \r\n return ans\r\n\r\n\r\n# var1, var2,var3 = [int(x) for x in input().split()]\r\nn = input()\r\nuser_input = input().split(' ')\r\nnumbers = [int(x.strip()) for x in user_input] \r\n# st = input()\r\n# print(fun(st))\r\n\r\nprint(fun(numbers))\r\n\r\n\r\n\r\n\r\n\r\n# # st = input()\r\n# var1, var2 = [int(x) for x in input().split()]\r\n\r\n# # # fun(st,var1,var2)\r\n\r\n# # # var2 = input()\r\n# print(fun(var1,var2))\r\n\r\n# ############################################################3###############################\r\n\r\n# # user_input = input().split(' ')\r\n# # numbers = [int(x.strip()) for x in user_input] \r\n# # print(fun(numbers))\r\n# ######################################################################################\r\n", "# second large number, monotonic decreasing stack\nn = input()\nvals = list(map(int, input().split()))\nr = 0\nq = []\nfor val in vals:\n while q:\n # q[-1] will keep track the second max \n # print(q, val, q[-1])\n r = max(r, val ^ q[-1]) \n # the last of q, is always the smallest for the sequence we have so far\n # and it satisfy the idea of second max\n if val > q[-1]:\n q.pop()\n else:\n break\n q.append(val)\nprint(r)\n\n# while keep tracking the monotonic decreasing stack\n# Let vals[i] be the second maximum element of some subarray \n# then the maximum element can be the first element larger than vals[i]\n# Given an array arr[] of N distinct positive integers, let’s denote max(i, j) and secondMax(i, j) as the maximum and the second maximum element of the subarray arr[i…j]. \n# while we are popping we find al are subarrays\n# for instance\n# if q = 5, 3, 2 and val = 4\n# whilie we popping\n# we first tried 2, 4 => this is array [2,4]\n# then 2 get popped, we tried 3, 4 this is for array [3, 2, 4], where 4 is largest and 3 is second largest \n# and so force...", "\r\nn, a = int(input()), list(map(int, input().split()))\r\ndef f(arr):\r\n ret = 0\r\n st = []\r\n for v in arr:\r\n while st and st[-1] < v:\r\n ret = max(st.pop(-1) ^ v, ret)\r\n if st:\r\n ret=max(st[-1]^v,ret)\r\n st.append(v)\r\n return ret\r\nprint(f(a))", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nstack, res = [], 0\r\nfor i in range(n):\r\n while stack and stack[-1] < s[i]:\r\n res = max(res, stack[-1] ^ s[i])\r\n stack.pop()\r\n stack.append(s[i])\r\n if len(stack) > 1:\r\n res = max(res, stack[-2] ^ stack[-1])\r\nprint(res)" ]

[ "import math\r\ninf = float('inf')\r\nprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59]\r\nm = len(primes)\r\n\r\nto_choose = [[] for _ in range(1 << m)]\r\nmask = {}\r\nfor i in range(1, 60):\r\n v = 0\r\n for j in range(m):\r\n if math.gcd(i, primes[j]) > 1:\r\n v |= 1 << j\r\n mask[i] = v\r\n for j in range(1 << m):\r\n if v & j == 0:\r\n to_choose[j].append(i)\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nsorted_nums = sorted(nums, reverse=True)\r\ndp = [inf] * (1 << m)\r\nfroms = [[61] * (1 << m) for _ in range(n + 1)]\r\ndp[0] = 0\r\n\r\nfor i in range(n):\r\n new_dp = [inf] * (1 << m)\r\n for j in range(1 << m):\r\n if dp[j] < inf:\r\n for v in to_choose[j]:\r\n if v > froms[i][j] or v >= 2 * sorted_nums[i]: break\r\n if new_dp[j+mask[v]] > dp[j] + abs(v - sorted_nums[i]):\r\n new_dp[j+mask[v]] = dp[j] + abs(v - sorted_nums[i])\r\n froms[i+1][j+mask[v]] = v\r\n dp = new_dp\r\n\r\npos = dp.index(min(dp))\r\ni, j = n, pos\r\nans = []\r\nwhile i:\r\n ans.append(froms[i][j])\r\n j -= mask[froms[i][j]]\r\n i -= 1\r\n\r\nans.reverse()\r\nd = [[] for _ in range(31)]\r\nfor x, y in zip(sorted_nums, ans):\r\n d[x].append(y)\r\n\r\nres = []\r\nfor x in nums:\r\n res.append(d[x].pop())\r\nprint(*res)" ]

[ "import sys\r\nn, m, *inp = map(int, sys.stdin.read().split())\r\n\r\ninp.reverse()\r\nf = [[0 for x in range(201)] for y in range(201)] #2D Array\r\nc = [(0,0)]*201\r\nf_size = [0]*201\r\n\r\ndef putData(f_id, s_id, c_id):\r\n global f, c\r\n f[f_id][s_id] = c_id\r\n c[c_id] = (f_id, s_id)\r\n\r\nfor f_id in range(1, m+1):\r\n f_size[f_id] = inp.pop()\r\n for s_id in range(1, f_size[f_id]+1):\r\n c_id = inp.pop()\r\n putData(f_id, s_id, c_id)\r\n\r\ne_id = c[1:].index((0,0))+1\r\nnext_id = 1\r\nop = []\r\n\r\nfor f_id in range(1, m+1):\r\n for s_id in range(1, f_size[f_id]+1):\r\n if c[next_id]==(f_id, s_id):\r\n next_id += 1\r\n continue\r\n if c[next_id] != (0, 0):\r\n op.append((next_id, e_id))\r\n putData(c[next_id][0], c[next_id][1], e_id)\r\n e_id = f[f_id][s_id]\r\n c[e_id] = (0,0)\r\n op.append((e_id, next_id))\r\n putData(f_id, s_id, next_id)\r\n next_id += 1\r\n\r\nprint(len(op))\r\nfor p in op:\r\n print(\"%d %d\" % p)\r\n\r\n", "n, m = map(int, input().split())\r\nmem = [-1] * 205\r\nd = []\r\nfor i in range(m):\r\n f = list(map(int, input().split()))[1:]\r\n for j in f:\r\n mem[j] = i\r\n d.append(f)\r\nfree = -1\r\nfor i in range(1, n+1):\r\n if mem[i] == -1:\r\n free = i\r\n break\r\nres, cnt = [], 0\r\nfor x in range(m):\r\n for i in range(len(d[x])):\r\n cnt += 1\r\n if d[x][i] == cnt: \r\n continue\r\n y = mem[cnt]\r\n if y == -1:\r\n res.append((d[x][i], cnt))\r\n mem[d[x][i]] = -1\r\n free = d[x][i]\r\n d[x][i] = cnt\r\n mem[cnt] = x\r\n continue\r\n for j in range(len(d[y])):\r\n if d[y][j] == cnt:\r\n res.append((cnt, free))\r\n res.append((d[x][i], cnt))\r\n d[y][j] = free\r\n mem[free] = y\r\n free = d[x][i]\r\n mem[free] = -1\r\n d[x][i] = cnt\r\n mem[cnt] = x\r\nprint(len(res))\r\nfor (x, y) in res:\r\n print(x, y)\r\n" ]

[ "n, m, k = map(int, input().split())\r\nfor i in range(k):\r\n x, y = map(int, input().split())\r\n if min(n-x, x-1, m-y, y-1) <5:\r\n print('YES')\r\n exit()\r\nprint('NO')", "n, m, k = map(int, input().split())\nwin = False\nfor i in range(k):\n x, y = map(int, input().split())\n if abs(x - 1) <= 4 or abs(y - 1) <= 4 or \\\n abs(n - x) <= 4 or abs(m - y) <= 4:\n win = True\n\nprint('YES' if win else 'NO')\n", "\r\n#ossama's py domain\r\n\r\nx,y,z=map(int,input().split())\r\nfor i in range(z):\r\n a,b=map(int,input().split())\r\n if a<=4 or a>=x-4 or b<=5 or b>=y-4:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "n, m, k = [int(i) for i in input().split()]\r\nflag = False\r\nfor j in range(k):\r\n x, y = [int(z) for z in input().split()]\r\n flag |= x < 6 or n - x < 5\r\n flag |= y < 6 or m - y < 5\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m, k = [int(x) for x in input().split()]\ncanwin = False\nfor i in range(k):\n x, y = [int(x) for x in input().split()]\n canwin |= x < 6 or n - x < 5\n canwin |= y < 6 or m - y < 5\nprint(\"YES\" if canwin else \"NO\")\n", "\nimport sys\n\nreadline = sys.stdin.readline\n\ndef solve():\n n, m, k = [int(w) for w in readline().split()]\n for _ in range(k):\n x, y = [int(w) for w in readline().split()]\n if x <= 5 or y <= 5 or n - x <= 4 or m - y <= 4:\n print('YES')\n return\n print('NO')\n\nsolve()", "n,m,k=list(map(int,input().split()))\r\nfor i in range(k):\r\n x,y=list(map(int,input().split()))\r\n if min(x,n-x+1,y,m-y+1)<6:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "[n,m,k]=[int(i) for i in input().split()]\r\nisDone=False\r\nfor i in range(0,k):\r\n [x,y]=[int(i) for i in input().split()]\r\n if x<=5 or x>n-5 or y<=5 or y>m-5:\r\n isDone=True\r\nif isDone:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m, k = map(int, input().split())\r\nflag = False\r\nwhile k > 0:\r\n k -= 1\r\n x, y = map(int, input().split())\r\n d = min(x, n - x + 1, y, m - y + 1)\r\n if d <= 5:\r\n flag = True\r\nprint(\"YES\" if flag else \"NO\")", "def main():\r\n\tn, m, k = map(int, input().split())\r\n\tmin_ = 100\r\n\tfor j in range(k):\r\n\t\ta, b = map(int, input().split())\r\n\t\tc = min(a-1, b-1, n-a, m-b)\r\n\t\tmin_ = min(c, min_)\r\n\tif min_ <= 4:\r\n\t\tprint(\"YES\")\r\n\t\treturn\r\n\tprint(\"NO\")\r\n\r\nmain()\r\n#--------\r\n#--------\r\n#--------\r\n#\r\n#--- *- ---\r\n#--- -* ---\r\n#\r\n#--------\r\n#--------\r\n#--------" ]